2008-02-07 08:13:49 +00:00
|
|
|
/*
|
|
|
|
* resource cgroups
|
|
|
|
*
|
|
|
|
* Copyright 2007 OpenVZ SWsoft Inc
|
|
|
|
*
|
|
|
|
* Author: Pavel Emelianov <xemul@openvz.org>
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/parser.h>
|
|
|
|
#include <linux/fs.h>
|
|
|
|
#include <linux/res_counter.h>
|
|
|
|
#include <linux/uaccess.h>
|
2008-07-25 08:47:04 +00:00
|
|
|
#include <linux/mm.h>
|
2008-02-07 08:13:49 +00:00
|
|
|
|
2009-01-08 02:08:05 +00:00
|
|
|
void res_counter_init(struct res_counter *counter, struct res_counter *parent)
|
2008-02-07 08:13:49 +00:00
|
|
|
{
|
|
|
|
spin_lock_init(&counter->lock);
|
2013-09-12 22:13:47 +00:00
|
|
|
counter->limit = RES_COUNTER_MAX;
|
|
|
|
counter->soft_limit = RES_COUNTER_MAX;
|
2009-01-08 02:08:05 +00:00
|
|
|
counter->parent = parent;
|
2008-02-07 08:13:49 +00:00
|
|
|
}
|
|
|
|
|
2014-04-07 22:37:32 +00:00
|
|
|
static u64 res_counter_uncharge_locked(struct res_counter *counter,
|
|
|
|
unsigned long val)
|
|
|
|
{
|
|
|
|
if (WARN_ON(counter->usage < val))
|
|
|
|
val = counter->usage;
|
|
|
|
|
|
|
|
counter->usage -= val;
|
|
|
|
return counter->usage;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int res_counter_charge_locked(struct res_counter *counter,
|
|
|
|
unsigned long val, bool force)
|
2008-02-07 08:13:49 +00:00
|
|
|
{
|
2012-04-24 23:11:35 +00:00
|
|
|
int ret = 0;
|
|
|
|
|
2008-02-07 08:13:49 +00:00
|
|
|
if (counter->usage + val > counter->limit) {
|
|
|
|
counter->failcnt++;
|
2012-04-24 23:11:35 +00:00
|
|
|
ret = -ENOMEM;
|
|
|
|
if (!force)
|
|
|
|
return ret;
|
2008-02-07 08:13:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
counter->usage += val;
|
2012-04-24 23:11:36 +00:00
|
|
|
if (counter->usage > counter->max_usage)
|
2008-04-29 08:00:17 +00:00
|
|
|
counter->max_usage = counter->usage;
|
2012-04-24 23:11:35 +00:00
|
|
|
return ret;
|
2008-02-07 08:13:49 +00:00
|
|
|
}
|
|
|
|
|
2012-04-24 23:11:35 +00:00
|
|
|
static int __res_counter_charge(struct res_counter *counter, unsigned long val,
|
|
|
|
struct res_counter **limit_fail_at, bool force)
|
2008-02-07 08:13:49 +00:00
|
|
|
{
|
2012-04-24 23:11:35 +00:00
|
|
|
int ret, r;
|
2008-02-07 08:13:49 +00:00
|
|
|
unsigned long flags;
|
2009-01-08 02:08:05 +00:00
|
|
|
struct res_counter *c, *u;
|
2008-02-07 08:13:49 +00:00
|
|
|
|
2012-04-24 23:11:35 +00:00
|
|
|
r = ret = 0;
|
2009-01-08 02:08:05 +00:00
|
|
|
*limit_fail_at = NULL;
|
|
|
|
local_irq_save(flags);
|
|
|
|
for (c = counter; c != NULL; c = c->parent) {
|
|
|
|
spin_lock(&c->lock);
|
2012-04-24 23:11:35 +00:00
|
|
|
r = res_counter_charge_locked(c, val, force);
|
2009-01-08 02:08:05 +00:00
|
|
|
spin_unlock(&c->lock);
|
2012-04-24 23:11:35 +00:00
|
|
|
if (r < 0 && !ret) {
|
|
|
|
ret = r;
|
2009-01-08 02:08:05 +00:00
|
|
|
*limit_fail_at = c;
|
2012-04-24 23:11:35 +00:00
|
|
|
if (!force)
|
|
|
|
break;
|
2009-01-08 02:08:05 +00:00
|
|
|
}
|
|
|
|
}
|
2012-04-24 23:11:35 +00:00
|
|
|
|
|
|
|
if (ret < 0 && !force) {
|
|
|
|
for (u = counter; u != c; u = u->parent) {
|
|
|
|
spin_lock(&u->lock);
|
|
|
|
res_counter_uncharge_locked(u, val);
|
|
|
|
spin_unlock(&u->lock);
|
|
|
|
}
|
2009-01-08 02:08:05 +00:00
|
|
|
}
|
|
|
|
local_irq_restore(flags);
|
2012-04-24 23:11:35 +00:00
|
|
|
|
2008-02-07 08:13:49 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2012-04-24 23:11:35 +00:00
|
|
|
int res_counter_charge(struct res_counter *counter, unsigned long val,
|
|
|
|
struct res_counter **limit_fail_at)
|
|
|
|
{
|
|
|
|
return __res_counter_charge(counter, val, limit_fail_at, false);
|
|
|
|
}
|
|
|
|
|
net: introduce res_counter_charge_nofail() for socket allocations
There is a case in __sk_mem_schedule(), where an allocation
is beyond the maximum, but yet we are allowed to proceed.
It happens under the following condition:
sk->sk_wmem_queued + size >= sk->sk_sndbuf
The network code won't revert the allocation in this case,
meaning that at some point later it'll try to do it. Since
this is never communicated to the underlying res_counter
code, there is an inbalance in res_counter uncharge operation.
I see two ways of fixing this:
1) storing the information about those allocations somewhere
in memcg, and then deducting from that first, before
we start draining the res_counter,
2) providing a slightly different allocation function for
the res_counter, that matches the original behavior of
the network code more closely.
I decided to go for #2 here, believing it to be more elegant,
since #1 would require us to do basically that, but in a more
obscure way.
Signed-off-by: Glauber Costa <glommer@parallels.com>
Cc: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Michal Hocko <mhocko@suse.cz>
CC: Tejun Heo <tj@kernel.org>
CC: Li Zefan <lizf@cn.fujitsu.com>
CC: Laurent Chavey <chavey@google.com>
Acked-by: Tejun Heo <tj@kernel.org>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-01-20 04:57:16 +00:00
|
|
|
int res_counter_charge_nofail(struct res_counter *counter, unsigned long val,
|
|
|
|
struct res_counter **limit_fail_at)
|
|
|
|
{
|
2012-04-24 23:11:35 +00:00
|
|
|
return __res_counter_charge(counter, val, limit_fail_at, true);
|
net: introduce res_counter_charge_nofail() for socket allocations
There is a case in __sk_mem_schedule(), where an allocation
is beyond the maximum, but yet we are allowed to proceed.
It happens under the following condition:
sk->sk_wmem_queued + size >= sk->sk_sndbuf
The network code won't revert the allocation in this case,
meaning that at some point later it'll try to do it. Since
this is never communicated to the underlying res_counter
code, there is an inbalance in res_counter uncharge operation.
I see two ways of fixing this:
1) storing the information about those allocations somewhere
in memcg, and then deducting from that first, before
we start draining the res_counter,
2) providing a slightly different allocation function for
the res_counter, that matches the original behavior of
the network code more closely.
I decided to go for #2 here, believing it to be more elegant,
since #1 would require us to do basically that, but in a more
obscure way.
Signed-off-by: Glauber Costa <glommer@parallels.com>
Cc: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: Michal Hocko <mhocko@suse.cz>
CC: Tejun Heo <tj@kernel.org>
CC: Li Zefan <lizf@cn.fujitsu.com>
CC: Laurent Chavey <chavey@google.com>
Acked-by: Tejun Heo <tj@kernel.org>
Signed-off-by: David S. Miller <davem@davemloft.net>
2012-01-20 04:57:16 +00:00
|
|
|
}
|
2012-04-24 23:11:35 +00:00
|
|
|
|
2012-12-18 22:22:04 +00:00
|
|
|
u64 res_counter_uncharge_until(struct res_counter *counter,
|
|
|
|
struct res_counter *top,
|
|
|
|
unsigned long val)
|
2008-02-07 08:13:49 +00:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
2009-01-08 02:08:05 +00:00
|
|
|
struct res_counter *c;
|
2012-12-18 22:22:04 +00:00
|
|
|
u64 ret = 0;
|
2008-02-07 08:13:49 +00:00
|
|
|
|
2009-01-08 02:08:05 +00:00
|
|
|
local_irq_save(flags);
|
2012-05-29 22:07:03 +00:00
|
|
|
for (c = counter; c != top; c = c->parent) {
|
2012-12-18 22:22:04 +00:00
|
|
|
u64 r;
|
2009-01-08 02:08:05 +00:00
|
|
|
spin_lock(&c->lock);
|
2012-12-18 22:22:04 +00:00
|
|
|
r = res_counter_uncharge_locked(c, val);
|
|
|
|
if (c == counter)
|
|
|
|
ret = r;
|
2009-01-08 02:08:05 +00:00
|
|
|
spin_unlock(&c->lock);
|
|
|
|
}
|
|
|
|
local_irq_restore(flags);
|
2012-12-18 22:22:04 +00:00
|
|
|
return ret;
|
2008-02-07 08:13:49 +00:00
|
|
|
}
|
|
|
|
|
2012-12-18 22:22:04 +00:00
|
|
|
u64 res_counter_uncharge(struct res_counter *counter, unsigned long val)
|
2012-05-29 22:07:03 +00:00
|
|
|
{
|
2012-12-18 22:22:04 +00:00
|
|
|
return res_counter_uncharge_until(counter, NULL, val);
|
2012-05-29 22:07:03 +00:00
|
|
|
}
|
2008-02-07 08:13:49 +00:00
|
|
|
|
2008-02-07 08:13:57 +00:00
|
|
|
static inline unsigned long long *
|
|
|
|
res_counter_member(struct res_counter *counter, int member)
|
2008-02-07 08:13:49 +00:00
|
|
|
{
|
|
|
|
switch (member) {
|
|
|
|
case RES_USAGE:
|
|
|
|
return &counter->usage;
|
2008-04-29 08:00:17 +00:00
|
|
|
case RES_MAX_USAGE:
|
|
|
|
return &counter->max_usage;
|
2008-02-07 08:13:49 +00:00
|
|
|
case RES_LIMIT:
|
|
|
|
return &counter->limit;
|
|
|
|
case RES_FAILCNT:
|
|
|
|
return &counter->failcnt;
|
2009-09-23 22:56:36 +00:00
|
|
|
case RES_SOFT_LIMIT:
|
|
|
|
return &counter->soft_limit;
|
2008-02-07 08:13:49 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
BUG();
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
ssize_t res_counter_read(struct res_counter *counter, int member,
|
2008-02-07 08:13:57 +00:00
|
|
|
const char __user *userbuf, size_t nbytes, loff_t *pos,
|
|
|
|
int (*read_strategy)(unsigned long long val, char *st_buf))
|
2008-02-07 08:13:49 +00:00
|
|
|
{
|
2008-02-07 08:13:57 +00:00
|
|
|
unsigned long long *val;
|
2008-02-07 08:13:49 +00:00
|
|
|
char buf[64], *s;
|
|
|
|
|
|
|
|
s = buf;
|
|
|
|
val = res_counter_member(counter, member);
|
2008-02-07 08:13:57 +00:00
|
|
|
if (read_strategy)
|
|
|
|
s += read_strategy(*val, s);
|
|
|
|
else
|
|
|
|
s += sprintf(s, "%llu\n", *val);
|
2008-02-07 08:13:49 +00:00
|
|
|
return simple_read_from_buffer((void __user *)userbuf, nbytes,
|
|
|
|
pos, buf, s - buf);
|
|
|
|
}
|
|
|
|
|
2011-03-23 23:42:18 +00:00
|
|
|
#if BITS_PER_LONG == 32
|
|
|
|
u64 res_counter_read_u64(struct res_counter *counter, int member)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
u64 ret;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&counter->lock, flags);
|
|
|
|
ret = *res_counter_member(counter, member);
|
|
|
|
spin_unlock_irqrestore(&counter->lock, flags);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#else
|
2008-04-29 07:59:58 +00:00
|
|
|
u64 res_counter_read_u64(struct res_counter *counter, int member)
|
|
|
|
{
|
|
|
|
return *res_counter_member(counter, member);
|
|
|
|
}
|
2011-03-23 23:42:18 +00:00
|
|
|
#endif
|
2008-04-29 07:59:58 +00:00
|
|
|
|
2008-07-25 08:47:04 +00:00
|
|
|
int res_counter_memparse_write_strategy(const char *buf,
|
2013-09-12 22:13:49 +00:00
|
|
|
unsigned long long *resp)
|
2008-02-07 08:13:49 +00:00
|
|
|
{
|
2008-07-25 08:47:04 +00:00
|
|
|
char *end;
|
2013-09-12 22:13:49 +00:00
|
|
|
unsigned long long res;
|
2009-06-17 23:27:20 +00:00
|
|
|
|
2013-09-12 22:13:47 +00:00
|
|
|
/* return RES_COUNTER_MAX(unlimited) if "-1" is specified */
|
2009-06-17 23:27:20 +00:00
|
|
|
if (*buf == '-') {
|
2014-06-04 23:11:24 +00:00
|
|
|
int rc = kstrtoull(buf + 1, 10, &res);
|
|
|
|
|
|
|
|
if (rc)
|
|
|
|
return rc;
|
|
|
|
if (res != 1)
|
2009-06-17 23:27:20 +00:00
|
|
|
return -EINVAL;
|
2013-09-12 22:13:49 +00:00
|
|
|
*resp = RES_COUNTER_MAX;
|
2009-06-17 23:27:20 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-09-12 22:13:49 +00:00
|
|
|
res = memparse(buf, &end);
|
2008-07-25 08:47:04 +00:00
|
|
|
if (*end != '\0')
|
|
|
|
return -EINVAL;
|
2008-02-07 08:13:49 +00:00
|
|
|
|
2013-09-12 22:13:49 +00:00
|
|
|
if (PAGE_ALIGN(res) >= res)
|
|
|
|
res = PAGE_ALIGN(res);
|
2013-09-12 22:13:48 +00:00
|
|
|
else
|
2013-09-12 22:13:49 +00:00
|
|
|
res = RES_COUNTER_MAX;
|
|
|
|
|
|
|
|
*resp = res;
|
2013-09-12 22:13:48 +00:00
|
|
|
|
2008-07-25 08:47:04 +00:00
|
|
|
return 0;
|
|
|
|
}
|