ia64/linux-2.6.18-xen.hg

view lib/percpu_counter.c @ 897:329ea0ccb344

balloon: try harder to balloon up under memory pressure.

Currently if the balloon driver is unable to increase the guest's
reservation it assumes the failure was due to reaching its full
allocation, gives up on the ballooning operation and records the limit
it reached as the "hard limit". The driver will not try again until
the target is set again (even to the same value).

However it is possible that ballooning has in fact failed due to
memory pressure in the host and therefore it is desirable to keep
attempting to reach the target in case memory becomes available. The
most likely scenario is that some guests are ballooning down while
others are ballooning up and therefore there is temporary memory
pressure while things stabilise. You would not expect a well behaved
toolstack to ask a domain to balloon to more than its allocation nor
would you expect it to deliberately over-commit memory by setting
balloon targets which exceed the total host memory.

This patch drops the concept of a hard limit and causes the balloon
driver to retry increasing the reservation on a timer in the same
manner as when decreasing the reservation.

Also if we partially succeed in increasing the reservation
(i.e. receive less pages than we asked for) then we may as well keep
those pages rather than returning them to Xen.

Signed-off-by: Ian Campbell <ian.campbell@citrix.com>
author Keir Fraser <keir.fraser@citrix.com>
date Fri Jun 05 14:01:20 2009 +0100 (2009-06-05)
parents 831230e53067
children
line source
1 /*
2 * Fast batching percpu counters.
3 */
5 #include <linux/percpu_counter.h>
6 #include <linux/module.h>
8 void percpu_counter_mod(struct percpu_counter *fbc, s32 amount)
9 {
10 long count;
11 s32 *pcount;
12 int cpu = get_cpu();
14 pcount = per_cpu_ptr(fbc->counters, cpu);
15 count = *pcount + amount;
16 if (count >= FBC_BATCH || count <= -FBC_BATCH) {
17 spin_lock(&fbc->lock);
18 fbc->count += count;
19 *pcount = 0;
20 spin_unlock(&fbc->lock);
21 } else {
22 *pcount = count;
23 }
24 put_cpu();
25 }
26 EXPORT_SYMBOL(percpu_counter_mod);
28 /*
29 * Add up all the per-cpu counts, return the result. This is a more accurate
30 * but much slower version of percpu_counter_read_positive()
31 */
32 s64 percpu_counter_sum(struct percpu_counter *fbc)
33 {
34 s64 ret;
35 int cpu;
37 spin_lock(&fbc->lock);
38 ret = fbc->count;
39 for_each_possible_cpu(cpu) {
40 s32 *pcount = per_cpu_ptr(fbc->counters, cpu);
41 ret += *pcount;
42 }
43 spin_unlock(&fbc->lock);
44 return ret < 0 ? 0 : ret;
45 }
46 EXPORT_SYMBOL(percpu_counter_sum);