xen: Convert printks to pr_<level>
[deliverable/linux.git] / drivers / xen / balloon.c
1 /******************************************************************************
2 * Xen balloon driver - enables returning/claiming memory to/from Xen.
3 *
4 * Copyright (c) 2003, B Dragovic
5 * Copyright (c) 2003-2004, M Williamson, K Fraser
6 * Copyright (c) 2005 Dan M. Smith, IBM Corporation
7 * Copyright (c) 2010 Daniel Kiper
8 *
9 * Memory hotplug support was written by Daniel Kiper. Work on
10 * it was sponsored by Google under Google Summer of Code 2010
11 * program. Jeremy Fitzhardinge from Citrix was the mentor for
12 * this project.
13 *
14 * This program is free software; you can redistribute it and/or
15 * modify it under the terms of the GNU General Public License version 2
16 * as published by the Free Software Foundation; or, when distributed
17 * separately from the Linux kernel or incorporated into other
18 * software packages, subject to the following license:
19 *
20 * Permission is hereby granted, free of charge, to any person obtaining a copy
21 * of this source file (the "Software"), to deal in the Software without
22 * restriction, including without limitation the rights to use, copy, modify,
23 * merge, publish, distribute, sublicense, and/or sell copies of the Software,
24 * and to permit persons to whom the Software is furnished to do so, subject to
25 * the following conditions:
26 *
27 * The above copyright notice and this permission notice shall be included in
28 * all copies or substantial portions of the Software.
29 *
30 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
31 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
32 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
33 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
34 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
35 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
36 * IN THE SOFTWARE.
37 */
38
39 #define pr_fmt(fmt) "xen:" KBUILD_MODNAME ": " fmt
40
41 #include <linux/kernel.h>
42 #include <linux/sched.h>
43 #include <linux/errno.h>
44 #include <linux/module.h>
45 #include <linux/mm.h>
46 #include <linux/bootmem.h>
47 #include <linux/pagemap.h>
48 #include <linux/highmem.h>
49 #include <linux/mutex.h>
50 #include <linux/list.h>
51 #include <linux/gfp.h>
52 #include <linux/notifier.h>
53 #include <linux/memory.h>
54 #include <linux/memory_hotplug.h>
55
56 #include <asm/page.h>
57 #include <asm/pgalloc.h>
58 #include <asm/pgtable.h>
59 #include <asm/tlb.h>
60
61 #include <asm/xen/hypervisor.h>
62 #include <asm/xen/hypercall.h>
63
64 #include <xen/xen.h>
65 #include <xen/interface/xen.h>
66 #include <xen/interface/memory.h>
67 #include <xen/balloon.h>
68 #include <xen/features.h>
69 #include <xen/page.h>
70
71 /*
72 * balloon_process() state:
73 *
74 * BP_DONE: done or nothing to do,
75 * BP_EAGAIN: error, go to sleep,
76 * BP_ECANCELED: error, balloon operation canceled.
77 */
78
79 enum bp_state {
80 BP_DONE,
81 BP_EAGAIN,
82 BP_ECANCELED
83 };
84
85
86 static DEFINE_MUTEX(balloon_mutex);
87
88 struct balloon_stats balloon_stats;
89 EXPORT_SYMBOL_GPL(balloon_stats);
90
91 /* We increase/decrease in batches which fit in a page */
92 static xen_pfn_t frame_list[PAGE_SIZE / sizeof(unsigned long)];
93
94 #ifdef CONFIG_HIGHMEM
95 #define inc_totalhigh_pages() (totalhigh_pages++)
96 #define dec_totalhigh_pages() (totalhigh_pages--)
97 #else
98 #define inc_totalhigh_pages() do {} while (0)
99 #define dec_totalhigh_pages() do {} while (0)
100 #endif
101
102 /* List of ballooned pages, threaded through the mem_map array. */
103 static LIST_HEAD(ballooned_pages);
104
105 /* Main work function, always executed in process context. */
106 static void balloon_process(struct work_struct *work);
107 static DECLARE_DELAYED_WORK(balloon_worker, balloon_process);
108
109 /* When ballooning out (allocating memory to return to Xen) we don't really
110 want the kernel to try too hard since that can trigger the oom killer. */
111 #define GFP_BALLOON \
112 (GFP_HIGHUSER | __GFP_NOWARN | __GFP_NORETRY | __GFP_NOMEMALLOC)
113
114 static void scrub_page(struct page *page)
115 {
116 #ifdef CONFIG_XEN_SCRUB_PAGES
117 clear_highpage(page);
118 #endif
119 }
120
121 /* balloon_append: add the given page to the balloon. */
122 static void __balloon_append(struct page *page)
123 {
124 /* Lowmem is re-populated first, so highmem pages go at list tail. */
125 if (PageHighMem(page)) {
126 list_add_tail(&page->lru, &ballooned_pages);
127 balloon_stats.balloon_high++;
128 } else {
129 list_add(&page->lru, &ballooned_pages);
130 balloon_stats.balloon_low++;
131 }
132 }
133
134 static void balloon_append(struct page *page)
135 {
136 __balloon_append(page);
137 if (PageHighMem(page))
138 dec_totalhigh_pages();
139 totalram_pages--;
140 }
141
142 /* balloon_retrieve: rescue a page from the balloon, if it is not empty. */
143 static struct page *balloon_retrieve(bool prefer_highmem)
144 {
145 struct page *page;
146
147 if (list_empty(&ballooned_pages))
148 return NULL;
149
150 if (prefer_highmem)
151 page = list_entry(ballooned_pages.prev, struct page, lru);
152 else
153 page = list_entry(ballooned_pages.next, struct page, lru);
154 list_del(&page->lru);
155
156 if (PageHighMem(page)) {
157 balloon_stats.balloon_high--;
158 inc_totalhigh_pages();
159 } else
160 balloon_stats.balloon_low--;
161
162 totalram_pages++;
163
164 return page;
165 }
166
167 static struct page *balloon_first_page(void)
168 {
169 if (list_empty(&ballooned_pages))
170 return NULL;
171 return list_entry(ballooned_pages.next, struct page, lru);
172 }
173
174 static struct page *balloon_next_page(struct page *page)
175 {
176 struct list_head *next = page->lru.next;
177 if (next == &ballooned_pages)
178 return NULL;
179 return list_entry(next, struct page, lru);
180 }
181
182 static enum bp_state update_schedule(enum bp_state state)
183 {
184 if (state == BP_DONE) {
185 balloon_stats.schedule_delay = 1;
186 balloon_stats.retry_count = 1;
187 return BP_DONE;
188 }
189
190 ++balloon_stats.retry_count;
191
192 if (balloon_stats.max_retry_count != RETRY_UNLIMITED &&
193 balloon_stats.retry_count > balloon_stats.max_retry_count) {
194 balloon_stats.schedule_delay = 1;
195 balloon_stats.retry_count = 1;
196 return BP_ECANCELED;
197 }
198
199 balloon_stats.schedule_delay <<= 1;
200
201 if (balloon_stats.schedule_delay > balloon_stats.max_schedule_delay)
202 balloon_stats.schedule_delay = balloon_stats.max_schedule_delay;
203
204 return BP_EAGAIN;
205 }
206
207 #ifdef CONFIG_XEN_BALLOON_MEMORY_HOTPLUG
208 static long current_credit(void)
209 {
210 return balloon_stats.target_pages - balloon_stats.current_pages -
211 balloon_stats.hotplug_pages;
212 }
213
214 static bool balloon_is_inflated(void)
215 {
216 if (balloon_stats.balloon_low || balloon_stats.balloon_high ||
217 balloon_stats.balloon_hotplug)
218 return true;
219 else
220 return false;
221 }
222
223 /*
224 * reserve_additional_memory() adds memory region of size >= credit above
225 * max_pfn. New region is section aligned and size is modified to be multiple
226 * of section size. Those features allow optimal use of address space and
227 * establish proper alignment when this function is called first time after
228 * boot (last section not fully populated at boot time contains unused memory
229 * pages with PG_reserved bit not set; online_pages_range() does not allow page
230 * onlining in whole range if first onlined page does not have PG_reserved
231 * bit set). Real size of added memory is established at page onlining stage.
232 */
233
234 static enum bp_state reserve_additional_memory(long credit)
235 {
236 int nid, rc;
237 u64 hotplug_start_paddr;
238 unsigned long balloon_hotplug = credit;
239
240 hotplug_start_paddr = PFN_PHYS(SECTION_ALIGN_UP(max_pfn));
241 balloon_hotplug = round_up(balloon_hotplug, PAGES_PER_SECTION);
242 nid = memory_add_physaddr_to_nid(hotplug_start_paddr);
243
244 rc = add_memory(nid, hotplug_start_paddr, balloon_hotplug << PAGE_SHIFT);
245
246 if (rc) {
247 pr_info("%s: add_memory() failed: %i\n", __func__, rc);
248 return BP_EAGAIN;
249 }
250
251 balloon_hotplug -= credit;
252
253 balloon_stats.hotplug_pages += credit;
254 balloon_stats.balloon_hotplug = balloon_hotplug;
255
256 return BP_DONE;
257 }
258
259 static void xen_online_page(struct page *page)
260 {
261 __online_page_set_limits(page);
262
263 mutex_lock(&balloon_mutex);
264
265 __balloon_append(page);
266
267 if (balloon_stats.hotplug_pages)
268 --balloon_stats.hotplug_pages;
269 else
270 --balloon_stats.balloon_hotplug;
271
272 mutex_unlock(&balloon_mutex);
273 }
274
275 static int xen_memory_notifier(struct notifier_block *nb, unsigned long val, void *v)
276 {
277 if (val == MEM_ONLINE)
278 schedule_delayed_work(&balloon_worker, 0);
279
280 return NOTIFY_OK;
281 }
282
283 static struct notifier_block xen_memory_nb = {
284 .notifier_call = xen_memory_notifier,
285 .priority = 0
286 };
287 #else
288 static long current_credit(void)
289 {
290 unsigned long target = balloon_stats.target_pages;
291
292 target = min(target,
293 balloon_stats.current_pages +
294 balloon_stats.balloon_low +
295 balloon_stats.balloon_high);
296
297 return target - balloon_stats.current_pages;
298 }
299
300 static bool balloon_is_inflated(void)
301 {
302 if (balloon_stats.balloon_low || balloon_stats.balloon_high)
303 return true;
304 else
305 return false;
306 }
307
308 static enum bp_state reserve_additional_memory(long credit)
309 {
310 balloon_stats.target_pages = balloon_stats.current_pages;
311 return BP_DONE;
312 }
313 #endif /* CONFIG_XEN_BALLOON_MEMORY_HOTPLUG */
314
315 static enum bp_state increase_reservation(unsigned long nr_pages)
316 {
317 int rc;
318 unsigned long pfn, i;
319 struct page *page;
320 struct xen_memory_reservation reservation = {
321 .address_bits = 0,
322 .extent_order = 0,
323 .domid = DOMID_SELF
324 };
325
326 #ifdef CONFIG_XEN_BALLOON_MEMORY_HOTPLUG
327 if (!balloon_stats.balloon_low && !balloon_stats.balloon_high) {
328 nr_pages = min(nr_pages, balloon_stats.balloon_hotplug);
329 balloon_stats.hotplug_pages += nr_pages;
330 balloon_stats.balloon_hotplug -= nr_pages;
331 return BP_DONE;
332 }
333 #endif
334
335 if (nr_pages > ARRAY_SIZE(frame_list))
336 nr_pages = ARRAY_SIZE(frame_list);
337
338 page = balloon_first_page();
339 for (i = 0; i < nr_pages; i++) {
340 if (!page) {
341 nr_pages = i;
342 break;
343 }
344 frame_list[i] = page_to_pfn(page);
345 page = balloon_next_page(page);
346 }
347
348 set_xen_guest_handle(reservation.extent_start, frame_list);
349 reservation.nr_extents = nr_pages;
350 rc = HYPERVISOR_memory_op(XENMEM_populate_physmap, &reservation);
351 if (rc <= 0)
352 return BP_EAGAIN;
353
354 for (i = 0; i < rc; i++) {
355 page = balloon_retrieve(false);
356 BUG_ON(page == NULL);
357
358 pfn = page_to_pfn(page);
359 BUG_ON(!xen_feature(XENFEAT_auto_translated_physmap) &&
360 phys_to_machine_mapping_valid(pfn));
361
362 set_phys_to_machine(pfn, frame_list[i]);
363
364 #ifdef CONFIG_XEN_HAVE_PVMMU
365 /* Link back into the page tables if not highmem. */
366 if (xen_pv_domain() && !PageHighMem(page)) {
367 int ret;
368 ret = HYPERVISOR_update_va_mapping(
369 (unsigned long)__va(pfn << PAGE_SHIFT),
370 mfn_pte(frame_list[i], PAGE_KERNEL),
371 0);
372 BUG_ON(ret);
373 }
374 #endif
375
376 /* Relinquish the page back to the allocator. */
377 ClearPageReserved(page);
378 init_page_count(page);
379 __free_page(page);
380 }
381
382 balloon_stats.current_pages += rc;
383
384 return BP_DONE;
385 }
386
387 static enum bp_state decrease_reservation(unsigned long nr_pages, gfp_t gfp)
388 {
389 enum bp_state state = BP_DONE;
390 unsigned long pfn, i;
391 struct page *page;
392 int ret;
393 struct xen_memory_reservation reservation = {
394 .address_bits = 0,
395 .extent_order = 0,
396 .domid = DOMID_SELF
397 };
398
399 #ifdef CONFIG_XEN_BALLOON_MEMORY_HOTPLUG
400 if (balloon_stats.hotplug_pages) {
401 nr_pages = min(nr_pages, balloon_stats.hotplug_pages);
402 balloon_stats.hotplug_pages -= nr_pages;
403 balloon_stats.balloon_hotplug += nr_pages;
404 return BP_DONE;
405 }
406 #endif
407
408 if (nr_pages > ARRAY_SIZE(frame_list))
409 nr_pages = ARRAY_SIZE(frame_list);
410
411 for (i = 0; i < nr_pages; i++) {
412 page = alloc_page(gfp);
413 if (page == NULL) {
414 nr_pages = i;
415 state = BP_EAGAIN;
416 break;
417 }
418
419 pfn = page_to_pfn(page);
420 frame_list[i] = pfn_to_mfn(pfn);
421
422 scrub_page(page);
423
424 #ifdef CONFIG_XEN_HAVE_PVMMU
425 if (xen_pv_domain() && !PageHighMem(page)) {
426 ret = HYPERVISOR_update_va_mapping(
427 (unsigned long)__va(pfn << PAGE_SHIFT),
428 __pte_ma(0), 0);
429 BUG_ON(ret);
430 }
431 #endif
432 }
433
434 /* Ensure that ballooned highmem pages don't have kmaps. */
435 kmap_flush_unused();
436 flush_tlb_all();
437
438 /* No more mappings: invalidate P2M and add to balloon. */
439 for (i = 0; i < nr_pages; i++) {
440 pfn = mfn_to_pfn(frame_list[i]);
441 __set_phys_to_machine(pfn, INVALID_P2M_ENTRY);
442 balloon_append(pfn_to_page(pfn));
443 }
444
445 set_xen_guest_handle(reservation.extent_start, frame_list);
446 reservation.nr_extents = nr_pages;
447 ret = HYPERVISOR_memory_op(XENMEM_decrease_reservation, &reservation);
448 BUG_ON(ret != nr_pages);
449
450 balloon_stats.current_pages -= nr_pages;
451
452 return state;
453 }
454
455 /*
456 * We avoid multiple worker processes conflicting via the balloon mutex.
457 * We may of course race updates of the target counts (which are protected
458 * by the balloon lock), or with changes to the Xen hard limit, but we will
459 * recover from these in time.
460 */
461 static void balloon_process(struct work_struct *work)
462 {
463 enum bp_state state = BP_DONE;
464 long credit;
465
466 mutex_lock(&balloon_mutex);
467
468 do {
469 credit = current_credit();
470
471 if (credit > 0) {
472 if (balloon_is_inflated())
473 state = increase_reservation(credit);
474 else
475 state = reserve_additional_memory(credit);
476 }
477
478 if (credit < 0)
479 state = decrease_reservation(-credit, GFP_BALLOON);
480
481 state = update_schedule(state);
482
483 #ifndef CONFIG_PREEMPT
484 if (need_resched())
485 schedule();
486 #endif
487 } while (credit && state == BP_DONE);
488
489 /* Schedule more work if there is some still to be done. */
490 if (state == BP_EAGAIN)
491 schedule_delayed_work(&balloon_worker, balloon_stats.schedule_delay * HZ);
492
493 mutex_unlock(&balloon_mutex);
494 }
495
496 /* Resets the Xen limit, sets new target, and kicks off processing. */
497 void balloon_set_new_target(unsigned long target)
498 {
499 /* No need for lock. Not read-modify-write updates. */
500 balloon_stats.target_pages = target;
501 schedule_delayed_work(&balloon_worker, 0);
502 }
503 EXPORT_SYMBOL_GPL(balloon_set_new_target);
504
505 /**
506 * alloc_xenballooned_pages - get pages that have been ballooned out
507 * @nr_pages: Number of pages to get
508 * @pages: pages returned
509 * @highmem: allow highmem pages
510 * @return 0 on success, error otherwise
511 */
512 int alloc_xenballooned_pages(int nr_pages, struct page **pages, bool highmem)
513 {
514 int pgno = 0;
515 struct page *page;
516 mutex_lock(&balloon_mutex);
517 while (pgno < nr_pages) {
518 page = balloon_retrieve(highmem);
519 if (page && (highmem || !PageHighMem(page))) {
520 pages[pgno++] = page;
521 } else {
522 enum bp_state st;
523 if (page)
524 balloon_append(page);
525 st = decrease_reservation(nr_pages - pgno,
526 highmem ? GFP_HIGHUSER : GFP_USER);
527 if (st != BP_DONE)
528 goto out_undo;
529 }
530 }
531 mutex_unlock(&balloon_mutex);
532 return 0;
533 out_undo:
534 while (pgno)
535 balloon_append(pages[--pgno]);
536 /* Free the memory back to the kernel soon */
537 schedule_delayed_work(&balloon_worker, 0);
538 mutex_unlock(&balloon_mutex);
539 return -ENOMEM;
540 }
541 EXPORT_SYMBOL(alloc_xenballooned_pages);
542
543 /**
544 * free_xenballooned_pages - return pages retrieved with get_ballooned_pages
545 * @nr_pages: Number of pages
546 * @pages: pages to return
547 */
548 void free_xenballooned_pages(int nr_pages, struct page **pages)
549 {
550 int i;
551
552 mutex_lock(&balloon_mutex);
553
554 for (i = 0; i < nr_pages; i++) {
555 if (pages[i])
556 balloon_append(pages[i]);
557 }
558
559 /* The balloon may be too large now. Shrink it if needed. */
560 if (current_credit())
561 schedule_delayed_work(&balloon_worker, 0);
562
563 mutex_unlock(&balloon_mutex);
564 }
565 EXPORT_SYMBOL(free_xenballooned_pages);
566
567 static void __init balloon_add_region(unsigned long start_pfn,
568 unsigned long pages)
569 {
570 unsigned long pfn, extra_pfn_end;
571 struct page *page;
572
573 /*
574 * If the amount of usable memory has been limited (e.g., with
575 * the 'mem' command line parameter), don't add pages beyond
576 * this limit.
577 */
578 extra_pfn_end = min(max_pfn, start_pfn + pages);
579
580 for (pfn = start_pfn; pfn < extra_pfn_end; pfn++) {
581 page = pfn_to_page(pfn);
582 /* totalram_pages and totalhigh_pages do not
583 include the boot-time balloon extension, so
584 don't subtract from it. */
585 __balloon_append(page);
586 }
587 }
588
589 static int __init balloon_init(void)
590 {
591 int i;
592
593 if (!xen_domain())
594 return -ENODEV;
595
596 pr_info("Initialising balloon driver\n");
597
598 balloon_stats.current_pages = xen_pv_domain()
599 ? min(xen_start_info->nr_pages - xen_released_pages, max_pfn)
600 : max_pfn;
601 balloon_stats.target_pages = balloon_stats.current_pages;
602 balloon_stats.balloon_low = 0;
603 balloon_stats.balloon_high = 0;
604
605 balloon_stats.schedule_delay = 1;
606 balloon_stats.max_schedule_delay = 32;
607 balloon_stats.retry_count = 1;
608 balloon_stats.max_retry_count = RETRY_UNLIMITED;
609
610 #ifdef CONFIG_XEN_BALLOON_MEMORY_HOTPLUG
611 balloon_stats.hotplug_pages = 0;
612 balloon_stats.balloon_hotplug = 0;
613
614 set_online_page_callback(&xen_online_page);
615 register_memory_notifier(&xen_memory_nb);
616 #endif
617
618 /*
619 * Initialize the balloon with pages from the extra memory
620 * regions (see arch/x86/xen/setup.c).
621 */
622 for (i = 0; i < XEN_EXTRA_MEM_MAX_REGIONS; i++)
623 if (xen_extra_mem[i].size)
624 balloon_add_region(PFN_UP(xen_extra_mem[i].start),
625 PFN_DOWN(xen_extra_mem[i].size));
626
627 return 0;
628 }
629
630 subsys_initcall(balloon_init);
631
632 MODULE_LICENSE("GPL");
This page took 0.04531 seconds and 5 git commands to generate.