blob: 1cf88900ec4fdc162b6ad1250d2c4d13d3895458 [file] [log] [blame]
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001/*
Pavel Machek96bc7ae2005-10-30 14:59:58 -08002 * linux/kernel/power/snapshot.c
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08003 *
Rafael J. Wysocki83573762006-12-06 20:34:18 -08004 * This file provides system snapshot/restore functionality for swsusp.
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08005 *
Pavel Macheka2531292010-07-18 14:27:13 +02006 * Copyright (C) 1998-2005 Pavel Machek <pavel@ucw.cz>
Rafael J. Wysocki83573762006-12-06 20:34:18 -08007 * Copyright (C) 2006 Rafael J. Wysocki <rjw@sisk.pl>
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08008 *
Rafael J. Wysocki83573762006-12-06 20:34:18 -08009 * This file is released under the GPLv2.
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080010 *
11 */
12
Rafael J. Wysockif577eb32006-03-23 02:59:59 -080013#include <linux/version.h>
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080014#include <linux/module.h>
15#include <linux/mm.h>
16#include <linux/suspend.h>
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080017#include <linux/delay.h>
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080018#include <linux/bitops.h>
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080019#include <linux/spinlock.h>
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080020#include <linux/kernel.h>
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080021#include <linux/pm.h>
22#include <linux/device.h>
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -070023#include <linux/init.h>
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080024#include <linux/bootmem.h>
25#include <linux/syscalls.h>
26#include <linux/console.h>
27#include <linux/highmem.h>
Rafael J. Wysocki846705d2008-11-26 18:00:24 -050028#include <linux/list.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090029#include <linux/slab.h>
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080030
31#include <asm/uaccess.h>
32#include <asm/mmu_context.h>
33#include <asm/pgtable.h>
34#include <asm/tlbflush.h>
35#include <asm/io.h>
36
Rafael J. Wysocki25761b62005-10-30 14:59:56 -080037#include "power.h"
38
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -070039static int swsusp_page_is_free(struct page *);
40static void swsusp_set_page_forbidden(struct page *);
41static void swsusp_unset_page_forbidden(struct page *);
42
Rafael J. Wysockife419532009-06-11 23:11:17 +020043/*
Rafael J. Wysockiddeb6482011-05-15 11:38:48 +020044 * Number of bytes to reserve for memory allocations made by device drivers
45 * from their ->freeze() and ->freeze_noirq() callbacks so that they don't
46 * cause image creation to fail (tunable via /sys/power/reserved_size).
47 */
48unsigned long reserved_size;
49
50void __init hibernate_reserved_size_init(void)
51{
52 reserved_size = SPARE_PAGES * PAGE_SIZE;
53}
54
55/*
Rafael J. Wysockife419532009-06-11 23:11:17 +020056 * Preferred image size in bytes (tunable via /sys/power/image_size).
Rafael J. Wysocki1c1be3a2011-05-15 11:39:48 +020057 * When it is set to N, swsusp will do its best to ensure the image
58 * size will not exceed N bytes, but if that is impossible, it will
59 * try to create the smallest image possible.
Rafael J. Wysockife419532009-06-11 23:11:17 +020060 */
Rafael J. Wysockiac5c24ec2010-09-20 19:44:56 +020061unsigned long image_size;
62
63void __init hibernate_image_size_init(void)
64{
Rafael J. Wysocki1c1be3a2011-05-15 11:39:48 +020065 image_size = ((totalram_pages * 2) / 5) * PAGE_SIZE;
Rafael J. Wysockiac5c24ec2010-09-20 19:44:56 +020066}
Rafael J. Wysockife419532009-06-11 23:11:17 +020067
Rafael J. Wysocki83573762006-12-06 20:34:18 -080068/* List of PBEs needed for restoring the pages that were allocated before
69 * the suspend and included in the suspend image, but have also been
70 * allocated by the "resume" kernel, so their contents cannot be written
71 * directly to their "original" page frames.
72 */
Rafael J. Wysocki75534b52006-09-25 23:32:52 -070073struct pbe *restore_pblist;
74
Rafael J. Wysocki83573762006-12-06 20:34:18 -080075/* Pointer to an auxiliary buffer (1 page) */
Rafael J. Wysocki940864d2006-09-25 23:32:55 -070076static void *buffer;
Rafael J. Wysocki7088a5c2006-01-06 00:13:05 -080077
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -070078/**
79 * @safe_needed - on resume, for storing the PBE list and the image,
80 * we can only use memory pages that do not conflict with the pages
Rafael J. Wysocki83573762006-12-06 20:34:18 -080081 * used before suspend. The unsafe pages have PageNosaveFree set
82 * and we count them using unsafe_pages.
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -070083 *
Rafael J. Wysocki83573762006-12-06 20:34:18 -080084 * Each allocated image page is marked as PageNosave and PageNosaveFree
85 * so that swsusp_free() can release it.
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -070086 */
87
Rafael J. Wysocki0bcd8882006-09-25 23:32:52 -070088#define PG_ANY 0
89#define PG_SAFE 1
90#define PG_UNSAFE_CLEAR 1
91#define PG_UNSAFE_KEEP 0
92
Rafael J. Wysocki940864d2006-09-25 23:32:55 -070093static unsigned int allocated_unsafe_pages;
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -070094
Rafael J. Wysocki83573762006-12-06 20:34:18 -080095static void *get_image_page(gfp_t gfp_mask, int safe_needed)
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -070096{
97 void *res;
98
99 res = (void *)get_zeroed_page(gfp_mask);
100 if (safe_needed)
Rafael J. Wysocki7be98232007-05-06 14:50:42 -0700101 while (res && swsusp_page_is_free(virt_to_page(res))) {
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -0700102 /* The page is unsafe, mark it for swsusp_free() */
Rafael J. Wysocki7be98232007-05-06 14:50:42 -0700103 swsusp_set_page_forbidden(virt_to_page(res));
Rafael J. Wysocki940864d2006-09-25 23:32:55 -0700104 allocated_unsafe_pages++;
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -0700105 res = (void *)get_zeroed_page(gfp_mask);
106 }
107 if (res) {
Rafael J. Wysocki7be98232007-05-06 14:50:42 -0700108 swsusp_set_page_forbidden(virt_to_page(res));
109 swsusp_set_page_free(virt_to_page(res));
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -0700110 }
111 return res;
112}
113
114unsigned long get_safe_page(gfp_t gfp_mask)
115{
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800116 return (unsigned long)get_image_page(gfp_mask, PG_SAFE);
117}
118
Rafael J. Wysocki5b6d15d2006-12-06 20:34:43 -0800119static struct page *alloc_image_page(gfp_t gfp_mask)
120{
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800121 struct page *page;
122
123 page = alloc_page(gfp_mask);
124 if (page) {
Rafael J. Wysocki7be98232007-05-06 14:50:42 -0700125 swsusp_set_page_forbidden(page);
126 swsusp_set_page_free(page);
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800127 }
128 return page;
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -0700129}
130
131/**
132 * free_image_page - free page represented by @addr, allocated with
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800133 * get_image_page (page flags set by it must be cleared)
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -0700134 */
135
136static inline void free_image_page(void *addr, int clear_nosave_free)
137{
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800138 struct page *page;
139
140 BUG_ON(!virt_addr_valid(addr));
141
142 page = virt_to_page(addr);
143
Rafael J. Wysocki7be98232007-05-06 14:50:42 -0700144 swsusp_unset_page_forbidden(page);
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -0700145 if (clear_nosave_free)
Rafael J. Wysocki7be98232007-05-06 14:50:42 -0700146 swsusp_unset_page_free(page);
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800147
148 __free_page(page);
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -0700149}
150
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700151/* struct linked_page is used to build chains of pages */
152
153#define LINKED_PAGE_DATA_SIZE (PAGE_SIZE - sizeof(void *))
154
155struct linked_page {
156 struct linked_page *next;
157 char data[LINKED_PAGE_DATA_SIZE];
158} __attribute__((packed));
159
160static inline void
161free_list_of_pages(struct linked_page *list, int clear_page_nosave)
162{
163 while (list) {
164 struct linked_page *lp = list->next;
165
166 free_image_page(list, clear_page_nosave);
167 list = lp;
168 }
169}
170
171/**
172 * struct chain_allocator is used for allocating small objects out of
173 * a linked list of pages called 'the chain'.
174 *
175 * The chain grows each time when there is no room for a new object in
176 * the current page. The allocated objects cannot be freed individually.
177 * It is only possible to free them all at once, by freeing the entire
178 * chain.
179 *
180 * NOTE: The chain allocator may be inefficient if the allocated objects
181 * are not much smaller than PAGE_SIZE.
182 */
183
184struct chain_allocator {
185 struct linked_page *chain; /* the chain */
186 unsigned int used_space; /* total size of objects allocated out
187 * of the current page
188 */
189 gfp_t gfp_mask; /* mask for allocating pages */
190 int safe_needed; /* if set, only "safe" pages are allocated */
191};
192
193static void
194chain_init(struct chain_allocator *ca, gfp_t gfp_mask, int safe_needed)
195{
196 ca->chain = NULL;
197 ca->used_space = LINKED_PAGE_DATA_SIZE;
198 ca->gfp_mask = gfp_mask;
199 ca->safe_needed = safe_needed;
200}
201
202static void *chain_alloc(struct chain_allocator *ca, unsigned int size)
203{
204 void *ret;
205
206 if (LINKED_PAGE_DATA_SIZE - ca->used_space < size) {
207 struct linked_page *lp;
208
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800209 lp = get_image_page(ca->gfp_mask, ca->safe_needed);
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700210 if (!lp)
211 return NULL;
212
213 lp->next = ca->chain;
214 ca->chain = lp;
215 ca->used_space = 0;
216 }
217 ret = ca->chain->data + ca->used_space;
218 ca->used_space += size;
219 return ret;
220}
221
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700222/**
223 * Data types related to memory bitmaps.
224 *
225 * Memory bitmap is a structure consiting of many linked lists of
226 * objects. The main list's elements are of type struct zone_bitmap
227 * and each of them corresonds to one zone. For each zone bitmap
228 * object there is a list of objects of type struct bm_block that
Akinobu Mita0d833042008-07-23 21:28:38 -0700229 * represent each blocks of bitmap in which information is stored.
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700230 *
231 * struct memory_bitmap contains a pointer to the main list of zone
232 * bitmap objects, a struct bm_position used for browsing the bitmap,
233 * and a pointer to the list of pages used for allocating all of the
234 * zone bitmap objects and bitmap block objects.
235 *
236 * NOTE: It has to be possible to lay out the bitmap in memory
237 * using only allocations of order 0. Additionally, the bitmap is
238 * designed to work with arbitrary number of zones (this is over the
239 * top for now, but let's avoid making unnecessary assumptions ;-).
240 *
241 * struct zone_bitmap contains a pointer to a list of bitmap block
242 * objects and a pointer to the bitmap block object that has been
243 * most recently used for setting bits. Additionally, it contains the
244 * pfns that correspond to the start and end of the represented zone.
245 *
246 * struct bm_block contains a pointer to the memory page in which
Akinobu Mita0d833042008-07-23 21:28:38 -0700247 * information is stored (in the form of a block of bitmap)
248 * It also contains the pfns that correspond to the start and end of
249 * the represented memory area.
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700250 */
251
252#define BM_END_OF_MAP (~0UL)
253
Wu Fengguang8de03072009-07-22 19:56:10 +0200254#define BM_BITS_PER_BLOCK (PAGE_SIZE * BITS_PER_BYTE)
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700255
256struct bm_block {
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500257 struct list_head hook; /* hook into a list of bitmap blocks */
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700258 unsigned long start_pfn; /* pfn represented by the first bit */
259 unsigned long end_pfn; /* pfn represented by the last bit plus 1 */
Akinobu Mita0d833042008-07-23 21:28:38 -0700260 unsigned long *data; /* bitmap representing pages */
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700261};
262
Akinobu Mita0d833042008-07-23 21:28:38 -0700263static inline unsigned long bm_block_bits(struct bm_block *bb)
264{
265 return bb->end_pfn - bb->start_pfn;
266}
267
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700268/* strcut bm_position is used for browsing memory bitmaps */
269
270struct bm_position {
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700271 struct bm_block *block;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700272 int bit;
273};
274
275struct memory_bitmap {
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500276 struct list_head blocks; /* list of bitmap blocks */
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700277 struct linked_page *p_list; /* list of pages used to store zone
278 * bitmap objects and bitmap block
279 * objects
280 */
281 struct bm_position cur; /* most recently used bit position */
282};
283
284/* Functions that operate on memory bitmaps */
285
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700286static void memory_bm_position_reset(struct memory_bitmap *bm)
287{
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500288 bm->cur.block = list_entry(bm->blocks.next, struct bm_block, hook);
Akinobu Mita0d833042008-07-23 21:28:38 -0700289 bm->cur.bit = 0;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700290}
291
292static void memory_bm_free(struct memory_bitmap *bm, int clear_nosave_free);
293
294/**
295 * create_bm_block_list - create a list of block bitmap objects
Wu Fengguang8de03072009-07-22 19:56:10 +0200296 * @pages - number of pages to track
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500297 * @list - list to put the allocated blocks into
298 * @ca - chain allocator to be used for allocating memory
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700299 */
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500300static int create_bm_block_list(unsigned long pages,
301 struct list_head *list,
302 struct chain_allocator *ca)
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700303{
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500304 unsigned int nr_blocks = DIV_ROUND_UP(pages, BM_BITS_PER_BLOCK);
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700305
306 while (nr_blocks-- > 0) {
307 struct bm_block *bb;
308
309 bb = chain_alloc(ca, sizeof(struct bm_block));
310 if (!bb)
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500311 return -ENOMEM;
312 list_add(&bb->hook, list);
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700313 }
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500314
315 return 0;
316}
317
318struct mem_extent {
319 struct list_head hook;
320 unsigned long start;
321 unsigned long end;
322};
323
324/**
325 * free_mem_extents - free a list of memory extents
326 * @list - list of extents to empty
327 */
328static void free_mem_extents(struct list_head *list)
329{
330 struct mem_extent *ext, *aux;
331
332 list_for_each_entry_safe(ext, aux, list, hook) {
333 list_del(&ext->hook);
334 kfree(ext);
335 }
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700336}
337
338/**
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500339 * create_mem_extents - create a list of memory extents representing
340 * contiguous ranges of PFNs
341 * @list - list to put the extents into
342 * @gfp_mask - mask to use for memory allocations
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700343 */
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500344static int create_mem_extents(struct list_head *list, gfp_t gfp_mask)
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700345{
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500346 struct zone *zone;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700347
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500348 INIT_LIST_HEAD(list);
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700349
KOSAKI Motohiroee99c712009-03-31 15:19:31 -0700350 for_each_populated_zone(zone) {
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500351 unsigned long zone_start, zone_end;
352 struct mem_extent *ext, *cur, *aux;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700353
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500354 zone_start = zone->zone_start_pfn;
355 zone_end = zone->zone_start_pfn + zone->spanned_pages;
356
357 list_for_each_entry(ext, list, hook)
358 if (zone_start <= ext->end)
359 break;
360
361 if (&ext->hook == list || zone_end < ext->start) {
362 /* New extent is necessary */
363 struct mem_extent *new_ext;
364
365 new_ext = kzalloc(sizeof(struct mem_extent), gfp_mask);
366 if (!new_ext) {
367 free_mem_extents(list);
368 return -ENOMEM;
369 }
370 new_ext->start = zone_start;
371 new_ext->end = zone_end;
372 list_add_tail(&new_ext->hook, &ext->hook);
373 continue;
374 }
375
376 /* Merge this zone's range of PFNs with the existing one */
377 if (zone_start < ext->start)
378 ext->start = zone_start;
379 if (zone_end > ext->end)
380 ext->end = zone_end;
381
382 /* More merging may be possible */
383 cur = ext;
384 list_for_each_entry_safe_continue(cur, aux, list, hook) {
385 if (zone_end < cur->start)
386 break;
387 if (zone_end < cur->end)
388 ext->end = cur->end;
389 list_del(&cur->hook);
390 kfree(cur);
391 }
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700392 }
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500393
394 return 0;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700395}
396
397/**
398 * memory_bm_create - allocate memory for a memory bitmap
399 */
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700400static int
401memory_bm_create(struct memory_bitmap *bm, gfp_t gfp_mask, int safe_needed)
402{
403 struct chain_allocator ca;
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500404 struct list_head mem_extents;
405 struct mem_extent *ext;
406 int error;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700407
408 chain_init(&ca, gfp_mask, safe_needed);
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500409 INIT_LIST_HEAD(&bm->blocks);
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700410
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500411 error = create_mem_extents(&mem_extents, gfp_mask);
412 if (error)
413 return error;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700414
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500415 list_for_each_entry(ext, &mem_extents, hook) {
416 struct bm_block *bb;
417 unsigned long pfn = ext->start;
418 unsigned long pages = ext->end - ext->start;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700419
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500420 bb = list_entry(bm->blocks.prev, struct bm_block, hook);
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700421
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500422 error = create_bm_block_list(pages, bm->blocks.prev, &ca);
423 if (error)
424 goto Error;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700425
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500426 list_for_each_entry_continue(bb, &bm->blocks, hook) {
427 bb->data = get_image_page(gfp_mask, safe_needed);
428 if (!bb->data) {
429 error = -ENOMEM;
430 goto Error;
431 }
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700432
433 bb->start_pfn = pfn;
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500434 if (pages >= BM_BITS_PER_BLOCK) {
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700435 pfn += BM_BITS_PER_BLOCK;
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500436 pages -= BM_BITS_PER_BLOCK;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700437 } else {
438 /* This is executed only once in the loop */
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500439 pfn += pages;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700440 }
441 bb->end_pfn = pfn;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700442 }
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700443 }
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500444
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700445 bm->p_list = ca.chain;
446 memory_bm_position_reset(bm);
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500447 Exit:
448 free_mem_extents(&mem_extents);
449 return error;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700450
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500451 Error:
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700452 bm->p_list = ca.chain;
453 memory_bm_free(bm, PG_UNSAFE_CLEAR);
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500454 goto Exit;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700455}
456
457/**
458 * memory_bm_free - free memory occupied by the memory bitmap @bm
459 */
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700460static void memory_bm_free(struct memory_bitmap *bm, int clear_nosave_free)
461{
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500462 struct bm_block *bb;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700463
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500464 list_for_each_entry(bb, &bm->blocks, hook)
465 if (bb->data)
466 free_image_page(bb->data, clear_nosave_free);
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700467
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700468 free_list_of_pages(bm->p_list, clear_nosave_free);
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500469
470 INIT_LIST_HEAD(&bm->blocks);
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700471}
472
473/**
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700474 * memory_bm_find_bit - find the bit in the bitmap @bm that corresponds
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700475 * to given pfn. The cur_zone_bm member of @bm and the cur_block member
476 * of @bm->cur_zone_bm are updated.
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700477 */
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100478static int memory_bm_find_bit(struct memory_bitmap *bm, unsigned long pfn,
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700479 void **addr, unsigned int *bit_nr)
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700480{
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700481 struct bm_block *bb;
482
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500483 /*
484 * Check if the pfn corresponds to the current bitmap block and find
485 * the block where it fits if this is not the case.
486 */
487 bb = bm->cur.block;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700488 if (pfn < bb->start_pfn)
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500489 list_for_each_entry_continue_reverse(bb, &bm->blocks, hook)
490 if (pfn >= bb->start_pfn)
491 break;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700492
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500493 if (pfn >= bb->end_pfn)
494 list_for_each_entry_continue(bb, &bm->blocks, hook)
495 if (pfn >= bb->start_pfn && pfn < bb->end_pfn)
496 break;
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700497
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500498 if (&bb->hook == &bm->blocks)
499 return -EFAULT;
500
501 /* The block has been found */
502 bm->cur.block = bb;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700503 pfn -= bb->start_pfn;
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500504 bm->cur.bit = pfn + 1;
Akinobu Mita0d833042008-07-23 21:28:38 -0700505 *bit_nr = pfn;
506 *addr = bb->data;
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100507 return 0;
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700508}
509
510static void memory_bm_set_bit(struct memory_bitmap *bm, unsigned long pfn)
511{
512 void *addr;
513 unsigned int bit;
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100514 int error;
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700515
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100516 error = memory_bm_find_bit(bm, pfn, &addr, &bit);
517 BUG_ON(error);
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700518 set_bit(bit, addr);
519}
520
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100521static int mem_bm_set_bit_check(struct memory_bitmap *bm, unsigned long pfn)
522{
523 void *addr;
524 unsigned int bit;
525 int error;
526
527 error = memory_bm_find_bit(bm, pfn, &addr, &bit);
528 if (!error)
529 set_bit(bit, addr);
530 return error;
531}
532
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700533static void memory_bm_clear_bit(struct memory_bitmap *bm, unsigned long pfn)
534{
535 void *addr;
536 unsigned int bit;
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100537 int error;
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700538
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100539 error = memory_bm_find_bit(bm, pfn, &addr, &bit);
540 BUG_ON(error);
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700541 clear_bit(bit, addr);
542}
543
544static int memory_bm_test_bit(struct memory_bitmap *bm, unsigned long pfn)
545{
546 void *addr;
547 unsigned int bit;
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100548 int error;
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700549
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100550 error = memory_bm_find_bit(bm, pfn, &addr, &bit);
551 BUG_ON(error);
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700552 return test_bit(bit, addr);
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700553}
554
Rafael J. Wysocki69643272008-11-11 21:32:44 +0100555static bool memory_bm_pfn_present(struct memory_bitmap *bm, unsigned long pfn)
556{
557 void *addr;
558 unsigned int bit;
559
560 return !memory_bm_find_bit(bm, pfn, &addr, &bit);
561}
562
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700563/**
564 * memory_bm_next_pfn - find the pfn that corresponds to the next set bit
565 * in the bitmap @bm. If the pfn cannot be found, BM_END_OF_MAP is
566 * returned.
567 *
568 * It is required to run memory_bm_position_reset() before the first call to
569 * this function.
570 */
571
572static unsigned long memory_bm_next_pfn(struct memory_bitmap *bm)
573{
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700574 struct bm_block *bb;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700575 int bit;
576
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500577 bb = bm->cur.block;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700578 do {
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500579 bit = bm->cur.bit;
580 bit = find_next_bit(bb->data, bm_block_bits(bb), bit);
581 if (bit < bm_block_bits(bb))
582 goto Return_pfn;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700583
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500584 bb = list_entry(bb->hook.next, struct bm_block, hook);
585 bm->cur.block = bb;
586 bm->cur.bit = 0;
587 } while (&bb->hook != &bm->blocks);
588
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700589 memory_bm_position_reset(bm);
590 return BM_END_OF_MAP;
591
Rafael J. Wysocki59a49332006-12-06 20:34:44 -0800592 Return_pfn:
Akinobu Mita0d833042008-07-23 21:28:38 -0700593 bm->cur.bit = bit + 1;
594 return bb->start_pfn + bit;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700595}
596
597/**
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700598 * This structure represents a range of page frames the contents of which
599 * should not be saved during the suspend.
600 */
601
602struct nosave_region {
603 struct list_head list;
604 unsigned long start_pfn;
605 unsigned long end_pfn;
606};
607
608static LIST_HEAD(nosave_regions);
609
610/**
611 * register_nosave_region - register a range of page frames the contents
612 * of which should not be saved during the suspend (to be used in the early
613 * initialization code)
614 */
615
616void __init
Johannes Berg940d67f2007-05-08 19:23:49 +1000617__register_nosave_region(unsigned long start_pfn, unsigned long end_pfn,
618 int use_kmalloc)
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700619{
620 struct nosave_region *region;
621
622 if (start_pfn >= end_pfn)
623 return;
624
625 if (!list_empty(&nosave_regions)) {
626 /* Try to extend the previous region (they should be sorted) */
627 region = list_entry(nosave_regions.prev,
628 struct nosave_region, list);
629 if (region->end_pfn == start_pfn) {
630 region->end_pfn = end_pfn;
631 goto Report;
632 }
633 }
Johannes Berg940d67f2007-05-08 19:23:49 +1000634 if (use_kmalloc) {
635 /* during init, this shouldn't fail */
636 region = kmalloc(sizeof(struct nosave_region), GFP_KERNEL);
637 BUG_ON(!region);
638 } else
639 /* This allocation cannot fail */
Jan Beulich3c1596e2009-09-21 17:03:06 -0700640 region = alloc_bootmem(sizeof(struct nosave_region));
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700641 region->start_pfn = start_pfn;
642 region->end_pfn = end_pfn;
643 list_add_tail(&region->list, &nosave_regions);
644 Report:
Rafael J. Wysocki23976722007-12-08 02:09:43 +0100645 printk(KERN_INFO "PM: Registered nosave memory: %016lx - %016lx\n",
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700646 start_pfn << PAGE_SHIFT, end_pfn << PAGE_SHIFT);
647}
648
649/*
650 * Set bits in this map correspond to the page frames the contents of which
651 * should not be saved during the suspend.
652 */
653static struct memory_bitmap *forbidden_pages_map;
654
655/* Set bits in this map correspond to free page frames. */
656static struct memory_bitmap *free_pages_map;
657
658/*
659 * Each page frame allocated for creating the image is marked by setting the
660 * corresponding bits in forbidden_pages_map and free_pages_map simultaneously
661 */
662
663void swsusp_set_page_free(struct page *page)
664{
665 if (free_pages_map)
666 memory_bm_set_bit(free_pages_map, page_to_pfn(page));
667}
668
669static int swsusp_page_is_free(struct page *page)
670{
671 return free_pages_map ?
672 memory_bm_test_bit(free_pages_map, page_to_pfn(page)) : 0;
673}
674
675void swsusp_unset_page_free(struct page *page)
676{
677 if (free_pages_map)
678 memory_bm_clear_bit(free_pages_map, page_to_pfn(page));
679}
680
681static void swsusp_set_page_forbidden(struct page *page)
682{
683 if (forbidden_pages_map)
684 memory_bm_set_bit(forbidden_pages_map, page_to_pfn(page));
685}
686
687int swsusp_page_is_forbidden(struct page *page)
688{
689 return forbidden_pages_map ?
690 memory_bm_test_bit(forbidden_pages_map, page_to_pfn(page)) : 0;
691}
692
693static void swsusp_unset_page_forbidden(struct page *page)
694{
695 if (forbidden_pages_map)
696 memory_bm_clear_bit(forbidden_pages_map, page_to_pfn(page));
697}
698
699/**
700 * mark_nosave_pages - set bits corresponding to the page frames the
701 * contents of which should not be saved in a given bitmap.
702 */
703
704static void mark_nosave_pages(struct memory_bitmap *bm)
705{
706 struct nosave_region *region;
707
708 if (list_empty(&nosave_regions))
709 return;
710
711 list_for_each_entry(region, &nosave_regions, list) {
712 unsigned long pfn;
713
Rafael J. Wysocki23976722007-12-08 02:09:43 +0100714 pr_debug("PM: Marking nosave pages: %016lx - %016lx\n",
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700715 region->start_pfn << PAGE_SHIFT,
716 region->end_pfn << PAGE_SHIFT);
717
718 for (pfn = region->start_pfn; pfn < region->end_pfn; pfn++)
Rafael J. Wysockia82f7112008-03-12 00:34:57 +0100719 if (pfn_valid(pfn)) {
720 /*
721 * It is safe to ignore the result of
722 * mem_bm_set_bit_check() here, since we won't
723 * touch the PFNs for which the error is
724 * returned anyway.
725 */
726 mem_bm_set_bit_check(bm, pfn);
727 }
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700728 }
729}
730
731/**
732 * create_basic_memory_bitmaps - create bitmaps needed for marking page
733 * frames that should not be saved and free page frames. The pointers
734 * forbidden_pages_map and free_pages_map are only modified if everything
735 * goes well, because we don't want the bits to be used before both bitmaps
736 * are set up.
737 */
738
739int create_basic_memory_bitmaps(void)
740{
741 struct memory_bitmap *bm1, *bm2;
742 int error = 0;
743
744 BUG_ON(forbidden_pages_map || free_pages_map);
745
Rafael J. Wysocki0709db62007-05-06 14:50:45 -0700746 bm1 = kzalloc(sizeof(struct memory_bitmap), GFP_KERNEL);
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700747 if (!bm1)
748 return -ENOMEM;
749
Rafael J. Wysocki0709db62007-05-06 14:50:45 -0700750 error = memory_bm_create(bm1, GFP_KERNEL, PG_ANY);
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700751 if (error)
752 goto Free_first_object;
753
Rafael J. Wysocki0709db62007-05-06 14:50:45 -0700754 bm2 = kzalloc(sizeof(struct memory_bitmap), GFP_KERNEL);
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700755 if (!bm2)
756 goto Free_first_bitmap;
757
Rafael J. Wysocki0709db62007-05-06 14:50:45 -0700758 error = memory_bm_create(bm2, GFP_KERNEL, PG_ANY);
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700759 if (error)
760 goto Free_second_object;
761
762 forbidden_pages_map = bm1;
763 free_pages_map = bm2;
764 mark_nosave_pages(forbidden_pages_map);
765
Rafael J. Wysocki23976722007-12-08 02:09:43 +0100766 pr_debug("PM: Basic memory bitmaps created\n");
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700767
768 return 0;
769
770 Free_second_object:
771 kfree(bm2);
772 Free_first_bitmap:
773 memory_bm_free(bm1, PG_UNSAFE_CLEAR);
774 Free_first_object:
775 kfree(bm1);
776 return -ENOMEM;
777}
778
779/**
780 * free_basic_memory_bitmaps - free memory bitmaps allocated by
781 * create_basic_memory_bitmaps(). The auxiliary pointers are necessary
782 * so that the bitmaps themselves are not referred to while they are being
783 * freed.
784 */
785
786void free_basic_memory_bitmaps(void)
787{
788 struct memory_bitmap *bm1, *bm2;
789
790 BUG_ON(!(forbidden_pages_map && free_pages_map));
791
792 bm1 = forbidden_pages_map;
793 bm2 = free_pages_map;
794 forbidden_pages_map = NULL;
795 free_pages_map = NULL;
796 memory_bm_free(bm1, PG_UNSAFE_CLEAR);
797 kfree(bm1);
798 memory_bm_free(bm2, PG_UNSAFE_CLEAR);
799 kfree(bm2);
800
Rafael J. Wysocki23976722007-12-08 02:09:43 +0100801 pr_debug("PM: Basic memory bitmaps freed\n");
Rafael J. Wysocki74dfd662007-05-06 14:50:43 -0700802}
803
804/**
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700805 * snapshot_additional_pages - estimate the number of additional pages
806 * be needed for setting up the suspend image data structures for given
807 * zone (usually the returned value is greater than the exact number)
808 */
809
810unsigned int snapshot_additional_pages(struct zone *zone)
811{
812 unsigned int res;
813
814 res = DIV_ROUND_UP(zone->spanned_pages, BM_BITS_PER_BLOCK);
815 res += DIV_ROUND_UP(res * sizeof(struct bm_block), PAGE_SIZE);
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800816 return 2 * res;
Rafael J. Wysockib788db72006-09-25 23:32:54 -0700817}
818
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800819#ifdef CONFIG_HIGHMEM
820/**
821 * count_free_highmem_pages - compute the total number of free highmem
822 * pages, system-wide.
823 */
824
825static unsigned int count_free_highmem_pages(void)
826{
827 struct zone *zone;
828 unsigned int cnt = 0;
829
KOSAKI Motohiroee99c712009-03-31 15:19:31 -0700830 for_each_populated_zone(zone)
831 if (is_highmem(zone))
Christoph Lameterd23ad422007-02-10 01:43:02 -0800832 cnt += zone_page_state(zone, NR_FREE_PAGES);
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800833
834 return cnt;
835}
836
837/**
838 * saveable_highmem_page - Determine whether a highmem page should be
839 * included in the suspend image.
840 *
841 * We should save the page if it isn't Nosave or NosaveFree, or Reserved,
842 * and it isn't a part of a free chunk of pages.
843 */
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500844static struct page *saveable_highmem_page(struct zone *zone, unsigned long pfn)
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800845{
846 struct page *page;
847
848 if (!pfn_valid(pfn))
849 return NULL;
850
851 page = pfn_to_page(pfn);
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500852 if (page_zone(page) != zone)
853 return NULL;
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800854
855 BUG_ON(!PageHighMem(page));
856
Rafael J. Wysocki7be98232007-05-06 14:50:42 -0700857 if (swsusp_page_is_forbidden(page) || swsusp_page_is_free(page) ||
858 PageReserved(page))
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800859 return NULL;
860
Stanislaw Gruszkac6968e72012-01-10 15:07:31 -0800861 if (page_is_guard(page))
862 return NULL;
863
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800864 return page;
865}
866
867/**
868 * count_highmem_pages - compute the total number of saveable highmem
869 * pages.
870 */
871
Rafael J. Wysockife419532009-06-11 23:11:17 +0200872static unsigned int count_highmem_pages(void)
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800873{
874 struct zone *zone;
875 unsigned int n = 0;
876
Gerald Schaefer98e73dc2009-07-22 00:36:56 +0200877 for_each_populated_zone(zone) {
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800878 unsigned long pfn, max_zone_pfn;
879
880 if (!is_highmem(zone))
881 continue;
882
883 mark_free_pages(zone);
884 max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
885 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500886 if (saveable_highmem_page(zone, pfn))
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800887 n++;
888 }
889 return n;
890}
891#else
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500892static inline void *saveable_highmem_page(struct zone *z, unsigned long p)
893{
894 return NULL;
895}
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800896#endif /* CONFIG_HIGHMEM */
897
Rafael J. Wysockif6143aa2006-09-25 23:32:50 -0700898/**
Rafael J. Wysocki8a235ef2008-02-20 01:47:44 +0100899 * saveable_page - Determine whether a non-highmem page should be included
900 * in the suspend image.
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800901 *
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800902 * We should save the page if it isn't Nosave, and is not in the range
903 * of pages statically defined as 'unsaveable', and it isn't a part of
904 * a free chunk of pages.
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800905 */
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500906static struct page *saveable_page(struct zone *zone, unsigned long pfn)
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800907{
Pavel Machekde491862005-10-30 14:59:59 -0800908 struct page *page;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800909
910 if (!pfn_valid(pfn))
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -0700911 return NULL;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800912
913 page = pfn_to_page(pfn);
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500914 if (page_zone(page) != zone)
915 return NULL;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800916
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800917 BUG_ON(PageHighMem(page));
918
Rafael J. Wysocki7be98232007-05-06 14:50:42 -0700919 if (swsusp_page_is_forbidden(page) || swsusp_page_is_free(page))
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -0700920 return NULL;
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800921
Rafael J. Wysocki8a235ef2008-02-20 01:47:44 +0100922 if (PageReserved(page)
923 && (!kernel_page_present(page) || pfn_is_nosave(pfn)))
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -0700924 return NULL;
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -0700925
Stanislaw Gruszkac6968e72012-01-10 15:07:31 -0800926 if (page_is_guard(page))
927 return NULL;
928
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -0700929 return page;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800930}
931
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800932/**
933 * count_data_pages - compute the total number of saveable non-highmem
934 * pages.
935 */
936
Rafael J. Wysockife419532009-06-11 23:11:17 +0200937static unsigned int count_data_pages(void)
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800938{
939 struct zone *zone;
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -0700940 unsigned long pfn, max_zone_pfn;
Pavel Machekdc19d502005-11-07 00:58:40 -0800941 unsigned int n = 0;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800942
Gerald Schaefer98e73dc2009-07-22 00:36:56 +0200943 for_each_populated_zone(zone) {
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800944 if (is_highmem(zone))
945 continue;
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800946
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800947 mark_free_pages(zone);
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -0700948 max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
949 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500950 if (saveable_page(zone, pfn))
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800951 n++;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800952 }
Rafael J. Wysockia0f49652005-10-30 14:59:57 -0800953 return n;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -0800954}
955
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800956/* This is needed, because copy_page and memcpy are not usable for copying
957 * task structs.
958 */
959static inline void do_copy_page(long *dst, long *src)
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -0700960{
961 int n;
962
Rafael J. Wysockif623f0d2006-09-25 23:32:49 -0700963 for (n = PAGE_SIZE / sizeof(long); n; n--)
964 *dst++ = *src++;
965}
966
Rafael J. Wysocki8a235ef2008-02-20 01:47:44 +0100967
968/**
969 * safe_copy_page - check if the page we are going to copy is marked as
970 * present in the kernel page tables (this always is the case if
971 * CONFIG_DEBUG_PAGEALLOC is not set and in that case
972 * kernel_page_present() always returns 'true').
973 */
974static void safe_copy_page(void *dst, struct page *s_page)
975{
976 if (kernel_page_present(s_page)) {
977 do_copy_page(dst, page_address(s_page));
978 } else {
979 kernel_map_pages(s_page, 1, 1);
980 do_copy_page(dst, page_address(s_page));
981 kernel_map_pages(s_page, 1, 0);
982 }
983}
984
985
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800986#ifdef CONFIG_HIGHMEM
987static inline struct page *
988page_is_saveable(struct zone *zone, unsigned long pfn)
989{
990 return is_highmem(zone) ?
Rafael J. Wysocki846705d2008-11-26 18:00:24 -0500991 saveable_highmem_page(zone, pfn) : saveable_page(zone, pfn);
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800992}
993
Rafael J. Wysocki8a235ef2008-02-20 01:47:44 +0100994static void copy_data_page(unsigned long dst_pfn, unsigned long src_pfn)
Rafael J. Wysocki83573762006-12-06 20:34:18 -0800995{
996 struct page *s_page, *d_page;
997 void *src, *dst;
998
999 s_page = pfn_to_page(src_pfn);
1000 d_page = pfn_to_page(dst_pfn);
1001 if (PageHighMem(s_page)) {
1002 src = kmap_atomic(s_page, KM_USER0);
1003 dst = kmap_atomic(d_page, KM_USER1);
1004 do_copy_page(dst, src);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001005 kunmap_atomic(dst, KM_USER1);
Peter Zijlstra61ecdb802010-10-26 14:21:47 -07001006 kunmap_atomic(src, KM_USER0);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001007 } else {
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001008 if (PageHighMem(d_page)) {
1009 /* Page pointed to by src may contain some kernel
1010 * data modified by kmap_atomic()
1011 */
Rafael J. Wysocki8a235ef2008-02-20 01:47:44 +01001012 safe_copy_page(buffer, s_page);
Rafael J. Wysockibaa58352008-12-08 00:52:49 +01001013 dst = kmap_atomic(d_page, KM_USER0);
Jan Beulich3ecb01d2010-10-26 14:22:27 -07001014 copy_page(dst, buffer);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001015 kunmap_atomic(dst, KM_USER0);
1016 } else {
Rafael J. Wysocki8a235ef2008-02-20 01:47:44 +01001017 safe_copy_page(page_address(d_page), s_page);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001018 }
1019 }
1020}
1021#else
Rafael J. Wysocki846705d2008-11-26 18:00:24 -05001022#define page_is_saveable(zone, pfn) saveable_page(zone, pfn)
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001023
Rafael J. Wysocki8a235ef2008-02-20 01:47:44 +01001024static inline void copy_data_page(unsigned long dst_pfn, unsigned long src_pfn)
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001025{
Rafael J. Wysocki8a235ef2008-02-20 01:47:44 +01001026 safe_copy_page(page_address(pfn_to_page(dst_pfn)),
1027 pfn_to_page(src_pfn));
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001028}
1029#endif /* CONFIG_HIGHMEM */
1030
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001031static void
1032copy_data_pages(struct memory_bitmap *copy_bm, struct memory_bitmap *orig_bm)
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001033{
1034 struct zone *zone;
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001035 unsigned long pfn;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001036
Gerald Schaefer98e73dc2009-07-22 00:36:56 +02001037 for_each_populated_zone(zone) {
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001038 unsigned long max_zone_pfn;
1039
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001040 mark_free_pages(zone);
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -07001041 max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001042 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001043 if (page_is_saveable(zone, pfn))
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001044 memory_bm_set_bit(orig_bm, pfn);
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001045 }
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001046 memory_bm_position_reset(orig_bm);
1047 memory_bm_position_reset(copy_bm);
Fengguang Wudf7c4872007-10-20 02:26:04 +02001048 for(;;) {
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001049 pfn = memory_bm_next_pfn(orig_bm);
Fengguang Wudf7c4872007-10-20 02:26:04 +02001050 if (unlikely(pfn == BM_END_OF_MAP))
1051 break;
1052 copy_data_page(memory_bm_next_pfn(copy_bm), pfn);
1053 }
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001054}
1055
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001056/* Total number of image pages */
1057static unsigned int nr_copy_pages;
1058/* Number of pages needed for saving the original pfns of the image pages */
1059static unsigned int nr_meta_pages;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001060/*
1061 * Numbers of normal and highmem page frames allocated for hibernation image
1062 * before suspending devices.
1063 */
1064unsigned int alloc_normal, alloc_highmem;
1065/*
1066 * Memory bitmap used for marking saveable pages (during hibernation) or
1067 * hibernation image pages (during restore)
1068 */
1069static struct memory_bitmap orig_bm;
1070/*
1071 * Memory bitmap used during hibernation for marking allocated page frames that
1072 * will contain copies of saveable pages. During restore it is initially used
1073 * for marking hibernation image pages, but then the set bits from it are
1074 * duplicated in @orig_bm and it is released. On highmem systems it is next
1075 * used for marking "safe" highmem pages, but it has to be reinitialized for
1076 * this purpose.
1077 */
1078static struct memory_bitmap copy_bm;
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001079
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001080/**
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001081 * swsusp_free - free pages allocated for the suspend.
Rafael J. Wysockicd560bb2006-09-25 23:32:50 -07001082 *
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001083 * Suspend pages are alocated before the atomic copy is made, so we
1084 * need to release them after the resume.
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001085 */
1086
1087void swsusp_free(void)
1088{
1089 struct zone *zone;
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -07001090 unsigned long pfn, max_zone_pfn;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001091
Gerald Schaefer98e73dc2009-07-22 00:36:56 +02001092 for_each_populated_zone(zone) {
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -07001093 max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
1094 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
1095 if (pfn_valid(pfn)) {
1096 struct page *page = pfn_to_page(pfn);
1097
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001098 if (swsusp_page_is_forbidden(page) &&
1099 swsusp_page_is_free(page)) {
1100 swsusp_unset_page_forbidden(page);
1101 swsusp_unset_page_free(page);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001102 __free_page(page);
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001103 }
1104 }
1105 }
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001106 nr_copy_pages = 0;
1107 nr_meta_pages = 0;
Rafael J. Wysocki75534b52006-09-25 23:32:52 -07001108 restore_pblist = NULL;
Rafael J. Wysocki6e1819d2006-03-23 03:00:03 -08001109 buffer = NULL;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001110 alloc_normal = 0;
1111 alloc_highmem = 0;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001112}
1113
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001114/* Helper functions used for the shrinking of memory. */
Rafael J. Wysockife419532009-06-11 23:11:17 +02001115
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001116#define GFP_IMAGE (GFP_KERNEL | __GFP_NOWARN)
1117
1118/**
1119 * preallocate_image_pages - Allocate a number of pages for hibernation image
1120 * @nr_pages: Number of page frames to allocate.
1121 * @mask: GFP flags to use for the allocation.
1122 *
1123 * Return value: Number of page frames actually allocated
1124 */
1125static unsigned long preallocate_image_pages(unsigned long nr_pages, gfp_t mask)
Rafael J. Wysockife419532009-06-11 23:11:17 +02001126{
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001127 unsigned long nr_alloc = 0;
1128
1129 while (nr_pages > 0) {
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001130 struct page *page;
1131
1132 page = alloc_image_page(mask);
1133 if (!page)
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001134 break;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001135 memory_bm_set_bit(&copy_bm, page_to_pfn(page));
1136 if (PageHighMem(page))
1137 alloc_highmem++;
1138 else
1139 alloc_normal++;
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001140 nr_pages--;
1141 nr_alloc++;
1142 }
1143
1144 return nr_alloc;
Rafael J. Wysockife419532009-06-11 23:11:17 +02001145}
1146
Rafael J. Wysocki67150452010-09-11 20:58:27 +02001147static unsigned long preallocate_image_memory(unsigned long nr_pages,
1148 unsigned long avail_normal)
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001149{
Rafael J. Wysocki67150452010-09-11 20:58:27 +02001150 unsigned long alloc;
1151
1152 if (avail_normal <= alloc_normal)
1153 return 0;
1154
1155 alloc = avail_normal - alloc_normal;
1156 if (nr_pages < alloc)
1157 alloc = nr_pages;
1158
1159 return preallocate_image_pages(alloc, GFP_IMAGE);
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001160}
1161
1162#ifdef CONFIG_HIGHMEM
1163static unsigned long preallocate_image_highmem(unsigned long nr_pages)
1164{
1165 return preallocate_image_pages(nr_pages, GFP_IMAGE | __GFP_HIGHMEM);
1166}
1167
1168/**
1169 * __fraction - Compute (an approximation of) x * (multiplier / base)
1170 */
1171static unsigned long __fraction(u64 x, u64 multiplier, u64 base)
1172{
1173 x *= multiplier;
1174 do_div(x, base);
1175 return (unsigned long)x;
1176}
1177
1178static unsigned long preallocate_highmem_fraction(unsigned long nr_pages,
1179 unsigned long highmem,
1180 unsigned long total)
1181{
1182 unsigned long alloc = __fraction(nr_pages, highmem, total);
1183
1184 return preallocate_image_pages(alloc, GFP_IMAGE | __GFP_HIGHMEM);
1185}
1186#else /* CONFIG_HIGHMEM */
1187static inline unsigned long preallocate_image_highmem(unsigned long nr_pages)
1188{
1189 return 0;
1190}
1191
1192static inline unsigned long preallocate_highmem_fraction(unsigned long nr_pages,
1193 unsigned long highmem,
1194 unsigned long total)
1195{
1196 return 0;
1197}
1198#endif /* CONFIG_HIGHMEM */
1199
1200/**
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001201 * free_unnecessary_pages - Release preallocated pages not needed for the image
1202 */
1203static void free_unnecessary_pages(void)
1204{
Rafael J. Wysocki67150452010-09-11 20:58:27 +02001205 unsigned long save, to_free_normal, to_free_highmem;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001206
Rafael J. Wysocki67150452010-09-11 20:58:27 +02001207 save = count_data_pages();
1208 if (alloc_normal >= save) {
1209 to_free_normal = alloc_normal - save;
1210 save = 0;
1211 } else {
1212 to_free_normal = 0;
1213 save -= alloc_normal;
1214 }
1215 save += count_highmem_pages();
1216 if (alloc_highmem >= save) {
1217 to_free_highmem = alloc_highmem - save;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001218 } else {
1219 to_free_highmem = 0;
Rafael J. Wysocki4d4cf232011-07-06 20:15:23 +02001220 save -= alloc_highmem;
1221 if (to_free_normal > save)
1222 to_free_normal -= save;
1223 else
1224 to_free_normal = 0;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001225 }
1226
1227 memory_bm_position_reset(&copy_bm);
1228
Rafael J. Wysockia9c9b442010-02-25 22:32:37 +01001229 while (to_free_normal > 0 || to_free_highmem > 0) {
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001230 unsigned long pfn = memory_bm_next_pfn(&copy_bm);
1231 struct page *page = pfn_to_page(pfn);
1232
1233 if (PageHighMem(page)) {
1234 if (!to_free_highmem)
1235 continue;
1236 to_free_highmem--;
1237 alloc_highmem--;
1238 } else {
1239 if (!to_free_normal)
1240 continue;
1241 to_free_normal--;
1242 alloc_normal--;
1243 }
1244 memory_bm_clear_bit(&copy_bm, pfn);
1245 swsusp_unset_page_forbidden(page);
1246 swsusp_unset_page_free(page);
1247 __free_page(page);
1248 }
1249}
1250
1251/**
Rafael J. Wysockief4aede2009-07-08 13:24:12 +02001252 * minimum_image_size - Estimate the minimum acceptable size of an image
1253 * @saveable: Number of saveable pages in the system.
1254 *
1255 * We want to avoid attempting to free too much memory too hard, so estimate the
1256 * minimum acceptable size of a hibernation image to use as the lower limit for
1257 * preallocating memory.
1258 *
1259 * We assume that the minimum image size should be proportional to
1260 *
1261 * [number of saveable pages] - [number of pages that can be freed in theory]
1262 *
1263 * where the second term is the sum of (1) reclaimable slab pages, (2) active
1264 * and (3) inactive anonymouns pages, (4) active and (5) inactive file pages,
1265 * minus mapped file pages.
1266 */
1267static unsigned long minimum_image_size(unsigned long saveable)
1268{
1269 unsigned long size;
1270
1271 size = global_page_state(NR_SLAB_RECLAIMABLE)
1272 + global_page_state(NR_ACTIVE_ANON)
1273 + global_page_state(NR_INACTIVE_ANON)
1274 + global_page_state(NR_ACTIVE_FILE)
1275 + global_page_state(NR_INACTIVE_FILE)
1276 - global_page_state(NR_FILE_MAPPED);
1277
1278 return saveable <= size ? 0 : saveable - size;
1279}
1280
1281/**
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001282 * hibernate_preallocate_memory - Preallocate memory for hibernation image
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001283 *
1284 * To create a hibernation image it is necessary to make a copy of every page
1285 * frame in use. We also need a number of page frames to be free during
1286 * hibernation for allocations made while saving the image and for device
1287 * drivers, in case they need to allocate memory from their hibernation
Rafael J. Wysockiddeb6482011-05-15 11:38:48 +02001288 * callbacks (these two numbers are given by PAGES_FOR_IO (which is a rough
1289 * estimate) and reserverd_size divided by PAGE_SIZE (which is tunable through
1290 * /sys/power/reserved_size, respectively). To make this happen, we compute the
1291 * total number of available page frames and allocate at least
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001292 *
Rafael J. Wysockiddeb6482011-05-15 11:38:48 +02001293 * ([page frames total] + PAGES_FOR_IO + [metadata pages]) / 2
1294 * + 2 * DIV_ROUND_UP(reserved_size, PAGE_SIZE)
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001295 *
1296 * of them, which corresponds to the maximum size of a hibernation image.
1297 *
1298 * If image_size is set below the number following from the above formula,
1299 * the preallocation of memory is continued until the total number of saveable
Rafael J. Wysockief4aede2009-07-08 13:24:12 +02001300 * pages in the system is below the requested image size or the minimum
1301 * acceptable image size returned by minimum_image_size(), whichever is greater.
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001302 */
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001303int hibernate_preallocate_memory(void)
Rafael J. Wysockife419532009-06-11 23:11:17 +02001304{
Rafael J. Wysockife419532009-06-11 23:11:17 +02001305 struct zone *zone;
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001306 unsigned long saveable, size, max_size, count, highmem, pages = 0;
Rafael J. Wysocki67150452010-09-11 20:58:27 +02001307 unsigned long alloc, save_highmem, pages_highmem, avail_normal;
Rafael J. Wysockife419532009-06-11 23:11:17 +02001308 struct timeval start, stop;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001309 int error;
Rafael J. Wysockife419532009-06-11 23:11:17 +02001310
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001311 printk(KERN_INFO "PM: Preallocating image memory... ");
Rafael J. Wysockife419532009-06-11 23:11:17 +02001312 do_gettimeofday(&start);
Rafael J. Wysockife419532009-06-11 23:11:17 +02001313
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001314 error = memory_bm_create(&orig_bm, GFP_IMAGE, PG_ANY);
1315 if (error)
1316 goto err_out;
1317
1318 error = memory_bm_create(&copy_bm, GFP_IMAGE, PG_ANY);
1319 if (error)
1320 goto err_out;
1321
1322 alloc_normal = 0;
1323 alloc_highmem = 0;
1324
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001325 /* Count the number of saveable data pages. */
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001326 save_highmem = count_highmem_pages();
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001327 saveable = count_data_pages();
Rafael J. Wysockife419532009-06-11 23:11:17 +02001328
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001329 /*
1330 * Compute the total number of page frames we can use (count) and the
1331 * number of pages needed for image metadata (size).
1332 */
1333 count = saveable;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001334 saveable += save_highmem;
1335 highmem = save_highmem;
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001336 size = 0;
1337 for_each_populated_zone(zone) {
1338 size += snapshot_additional_pages(zone);
1339 if (is_highmem(zone))
1340 highmem += zone_page_state(zone, NR_FREE_PAGES);
1341 else
1342 count += zone_page_state(zone, NR_FREE_PAGES);
1343 }
Rafael J. Wysocki67150452010-09-11 20:58:27 +02001344 avail_normal = count;
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001345 count += highmem;
1346 count -= totalreserve_pages;
Rafael J. Wysockife419532009-06-11 23:11:17 +02001347
Martin Schwidefsky85055dd2011-08-17 20:42:24 +02001348 /* Add number of pages required for page keys (s390 only). */
1349 size += page_key_additional_pages(saveable);
1350
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001351 /* Compute the maximum number of saveable pages to leave in memory. */
Rafael J. Wysockiddeb6482011-05-15 11:38:48 +02001352 max_size = (count - (size + PAGES_FOR_IO)) / 2
1353 - 2 * DIV_ROUND_UP(reserved_size, PAGE_SIZE);
Rafael J. Wysocki266f1a22010-09-20 19:44:38 +02001354 /* Compute the desired number of image pages specified by image_size. */
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001355 size = DIV_ROUND_UP(image_size, PAGE_SIZE);
1356 if (size > max_size)
1357 size = max_size;
1358 /*
Rafael J. Wysocki266f1a22010-09-20 19:44:38 +02001359 * If the desired number of image pages is at least as large as the
1360 * current number of saveable pages in memory, allocate page frames for
1361 * the image and we're done.
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001362 */
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001363 if (size >= saveable) {
1364 pages = preallocate_image_highmem(save_highmem);
Rafael J. Wysocki67150452010-09-11 20:58:27 +02001365 pages += preallocate_image_memory(saveable - pages, avail_normal);
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001366 goto out;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001367 }
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001368
Rafael J. Wysockief4aede2009-07-08 13:24:12 +02001369 /* Estimate the minimum size of the image. */
1370 pages = minimum_image_size(saveable);
Rafael J. Wysocki67150452010-09-11 20:58:27 +02001371 /*
1372 * To avoid excessive pressure on the normal zone, leave room in it to
1373 * accommodate an image of the minimum size (unless it's already too
1374 * small, in which case don't preallocate pages from it at all).
1375 */
1376 if (avail_normal > pages)
1377 avail_normal -= pages;
1378 else
1379 avail_normal = 0;
Rafael J. Wysockief4aede2009-07-08 13:24:12 +02001380 if (size < pages)
1381 size = min_t(unsigned long, pages, max_size);
1382
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001383 /*
1384 * Let the memory management subsystem know that we're going to need a
1385 * large number of page frames to allocate and make it free some memory.
1386 * NOTE: If this is not done, performance will be hurt badly in some
1387 * test cases.
1388 */
1389 shrink_all_memory(saveable - size);
1390
1391 /*
1392 * The number of saveable pages in memory was too high, so apply some
1393 * pressure to decrease it. First, make room for the largest possible
1394 * image and fail if that doesn't work. Next, try to decrease the size
Rafael J. Wysockief4aede2009-07-08 13:24:12 +02001395 * of the image as much as indicated by 'size' using allocations from
1396 * highmem and non-highmem zones separately.
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001397 */
1398 pages_highmem = preallocate_image_highmem(highmem / 2);
1399 alloc = (count - max_size) - pages_highmem;
Rafael J. Wysocki67150452010-09-11 20:58:27 +02001400 pages = preallocate_image_memory(alloc, avail_normal);
1401 if (pages < alloc) {
1402 /* We have exhausted non-highmem pages, try highmem. */
1403 alloc -= pages;
1404 pages += pages_highmem;
1405 pages_highmem = preallocate_image_highmem(alloc);
1406 if (pages_highmem < alloc)
1407 goto err_out;
1408 pages += pages_highmem;
1409 /*
1410 * size is the desired number of saveable pages to leave in
1411 * memory, so try to preallocate (all memory - size) pages.
1412 */
1413 alloc = (count - pages) - size;
1414 pages += preallocate_image_highmem(alloc);
1415 } else {
1416 /*
1417 * There are approximately max_size saveable pages at this point
1418 * and we want to reduce this number down to size.
1419 */
1420 alloc = max_size - size;
1421 size = preallocate_highmem_fraction(alloc, highmem, count);
1422 pages_highmem += size;
1423 alloc -= size;
1424 size = preallocate_image_memory(alloc, avail_normal);
1425 pages_highmem += preallocate_image_highmem(alloc - size);
1426 pages += pages_highmem + size;
1427 }
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001428
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001429 /*
1430 * We only need as many page frames for the image as there are saveable
1431 * pages in memory, but we have allocated more. Release the excessive
1432 * ones now.
1433 */
1434 free_unnecessary_pages();
Rafael J. Wysocki4bb33432009-07-08 13:23:51 +02001435
1436 out:
Rafael J. Wysockife419532009-06-11 23:11:17 +02001437 do_gettimeofday(&stop);
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001438 printk(KERN_CONT "done (allocated %lu pages)\n", pages);
1439 swsusp_show_speed(&start, &stop, pages, "Allocated");
Rafael J. Wysockife419532009-06-11 23:11:17 +02001440
1441 return 0;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001442
1443 err_out:
1444 printk(KERN_CONT "\n");
1445 swsusp_free();
1446 return -ENOMEM;
Rafael J. Wysockife419532009-06-11 23:11:17 +02001447}
1448
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001449#ifdef CONFIG_HIGHMEM
1450/**
1451 * count_pages_for_highmem - compute the number of non-highmem pages
1452 * that will be necessary for creating copies of highmem pages.
1453 */
1454
1455static unsigned int count_pages_for_highmem(unsigned int nr_highmem)
1456{
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001457 unsigned int free_highmem = count_free_highmem_pages() + alloc_highmem;
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001458
1459 if (free_highmem >= nr_highmem)
1460 nr_highmem = 0;
1461 else
1462 nr_highmem -= free_highmem;
1463
1464 return nr_highmem;
1465}
1466#else
1467static unsigned int
1468count_pages_for_highmem(unsigned int nr_highmem) { return 0; }
1469#endif /* CONFIG_HIGHMEM */
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001470
1471/**
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001472 * enough_free_mem - Make sure we have enough free memory for the
1473 * snapshot image.
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001474 */
1475
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001476static int enough_free_mem(unsigned int nr_pages, unsigned int nr_highmem)
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001477{
Rafael J. Wysockie5e2fa72006-01-06 00:14:20 -08001478 struct zone *zone;
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001479 unsigned int free = alloc_normal;
Rafael J. Wysockie5e2fa72006-01-06 00:14:20 -08001480
Gerald Schaefer98e73dc2009-07-22 00:36:56 +02001481 for_each_populated_zone(zone)
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001482 if (!is_highmem(zone))
Christoph Lameterd23ad422007-02-10 01:43:02 -08001483 free += zone_page_state(zone, NR_FREE_PAGES);
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001484
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001485 nr_pages += count_pages_for_highmem(nr_highmem);
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001486 pr_debug("PM: Normal pages needed: %u + %u, available pages: %u\n",
1487 nr_pages, PAGES_FOR_IO, free);
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001488
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001489 return free > nr_pages + PAGES_FOR_IO;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001490}
1491
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001492#ifdef CONFIG_HIGHMEM
1493/**
1494 * get_highmem_buffer - if there are some highmem pages in the suspend
1495 * image, we may need the buffer to copy them and/or load their data.
1496 */
1497
1498static inline int get_highmem_buffer(int safe_needed)
1499{
1500 buffer = get_image_page(GFP_ATOMIC | __GFP_COLD, safe_needed);
1501 return buffer ? 0 : -ENOMEM;
1502}
1503
1504/**
1505 * alloc_highmem_image_pages - allocate some highmem pages for the image.
1506 * Try to allocate as many pages as needed, but if the number of free
1507 * highmem pages is lesser than that, allocate them all.
1508 */
1509
1510static inline unsigned int
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001511alloc_highmem_pages(struct memory_bitmap *bm, unsigned int nr_highmem)
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001512{
1513 unsigned int to_alloc = count_free_highmem_pages();
1514
1515 if (to_alloc > nr_highmem)
1516 to_alloc = nr_highmem;
1517
1518 nr_highmem -= to_alloc;
1519 while (to_alloc-- > 0) {
1520 struct page *page;
1521
1522 page = alloc_image_page(__GFP_HIGHMEM);
1523 memory_bm_set_bit(bm, page_to_pfn(page));
1524 }
1525 return nr_highmem;
1526}
1527#else
1528static inline int get_highmem_buffer(int safe_needed) { return 0; }
1529
1530static inline unsigned int
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001531alloc_highmem_pages(struct memory_bitmap *bm, unsigned int n) { return 0; }
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001532#endif /* CONFIG_HIGHMEM */
1533
1534/**
1535 * swsusp_alloc - allocate memory for the suspend image
1536 *
1537 * We first try to allocate as many highmem pages as there are
1538 * saveable highmem pages in the system. If that fails, we allocate
1539 * non-highmem pages for the copies of the remaining highmem ones.
1540 *
1541 * In this approach it is likely that the copies of highmem pages will
1542 * also be located in the high memory, because of the way in which
1543 * copy_data_pages() works.
1544 */
1545
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001546static int
1547swsusp_alloc(struct memory_bitmap *orig_bm, struct memory_bitmap *copy_bm,
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001548 unsigned int nr_pages, unsigned int nr_highmem)
Rafael J. Wysocki054bd4c2005-11-08 21:34:39 -08001549{
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001550 if (nr_highmem > 0) {
Stanislaw Gruszka2e725a02011-02-12 21:06:51 +01001551 if (get_highmem_buffer(PG_ANY))
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001552 goto err_out;
1553 if (nr_highmem > alloc_highmem) {
1554 nr_highmem -= alloc_highmem;
1555 nr_pages += alloc_highmem_pages(copy_bm, nr_highmem);
1556 }
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001557 }
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001558 if (nr_pages > alloc_normal) {
1559 nr_pages -= alloc_normal;
1560 while (nr_pages-- > 0) {
1561 struct page *page;
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001562
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001563 page = alloc_image_page(GFP_ATOMIC | __GFP_COLD);
1564 if (!page)
1565 goto err_out;
1566 memory_bm_set_bit(copy_bm, page_to_pfn(page));
1567 }
Rafael J. Wysocki054bd4c2005-11-08 21:34:39 -08001568 }
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001569
Rafael J. Wysocki054bd4c2005-11-08 21:34:39 -08001570 return 0;
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001571
Rafael J. Wysocki64a473c2009-07-08 13:24:05 +02001572 err_out:
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001573 swsusp_free();
Stanislaw Gruszka2e725a02011-02-12 21:06:51 +01001574 return -ENOMEM;
Rafael J. Wysocki054bd4c2005-11-08 21:34:39 -08001575}
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001576
Rafael J. Wysocki2e32a432005-10-30 15:00:00 -08001577asmlinkage int swsusp_save(void)
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001578{
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001579 unsigned int nr_pages, nr_highmem;
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001580
Frans Pop07c3bb52010-02-11 23:09:08 +01001581 printk(KERN_INFO "PM: Creating hibernation image:\n");
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001582
Christoph Lameter9f8f2172008-02-04 22:29:11 -08001583 drain_local_pages(NULL);
Rafael J. Wysockia0f49652005-10-30 14:59:57 -08001584 nr_pages = count_data_pages();
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001585 nr_highmem = count_highmem_pages();
Rafael J. Wysocki23976722007-12-08 02:09:43 +01001586 printk(KERN_INFO "PM: Need to copy %u pages\n", nr_pages + nr_highmem);
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001587
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001588 if (!enough_free_mem(nr_pages, nr_highmem)) {
Rafael J. Wysocki23976722007-12-08 02:09:43 +01001589 printk(KERN_ERR "PM: Not enough free memory\n");
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001590 return -ENOMEM;
1591 }
1592
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001593 if (swsusp_alloc(&orig_bm, &copy_bm, nr_pages, nr_highmem)) {
Rafael J. Wysocki23976722007-12-08 02:09:43 +01001594 printk(KERN_ERR "PM: Memory allocation failed\n");
Rafael J. Wysockia0f49652005-10-30 14:59:57 -08001595 return -ENOMEM;
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001596 }
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001597
1598 /* During allocating of suspend pagedir, new cold pages may appear.
1599 * Kill them.
1600 */
Christoph Lameter9f8f2172008-02-04 22:29:11 -08001601 drain_local_pages(NULL);
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001602 copy_data_pages(&copy_bm, &orig_bm);
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001603
1604 /*
1605 * End of critical section. From now on, we can write to memory,
1606 * but we should not touch disk. This specially means we must _not_
1607 * touch swap space! Except we must write out our image of course.
1608 */
1609
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001610 nr_pages += nr_highmem;
Rafael J. Wysockia0f49652005-10-30 14:59:57 -08001611 nr_copy_pages = nr_pages;
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001612 nr_meta_pages = DIV_ROUND_UP(nr_pages * sizeof(long), PAGE_SIZE);
Rafael J. Wysockia0f49652005-10-30 14:59:57 -08001613
Rafael J. Wysocki23976722007-12-08 02:09:43 +01001614 printk(KERN_INFO "PM: Hibernation image created (%d pages copied)\n",
1615 nr_pages);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001616
Rafael J. Wysocki25761b62005-10-30 14:59:56 -08001617 return 0;
1618}
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001619
Rafael J. Wysockid307c4a2007-10-18 03:04:52 -07001620#ifndef CONFIG_ARCH_HIBERNATION_HEADER
1621static int init_header_complete(struct swsusp_info *info)
1622{
1623 memcpy(&info->uts, init_utsname(), sizeof(struct new_utsname));
1624 info->version_code = LINUX_VERSION_CODE;
1625 return 0;
1626}
1627
1628static char *check_image_kernel(struct swsusp_info *info)
1629{
1630 if (info->version_code != LINUX_VERSION_CODE)
1631 return "kernel version";
1632 if (strcmp(info->uts.sysname,init_utsname()->sysname))
1633 return "system type";
1634 if (strcmp(info->uts.release,init_utsname()->release))
1635 return "kernel release";
1636 if (strcmp(info->uts.version,init_utsname()->version))
1637 return "version";
1638 if (strcmp(info->uts.machine,init_utsname()->machine))
1639 return "machine";
1640 return NULL;
1641}
1642#endif /* CONFIG_ARCH_HIBERNATION_HEADER */
1643
Rafael J. Wysockiaf508b32007-10-26 00:59:31 +02001644unsigned long snapshot_get_image_size(void)
1645{
1646 return nr_copy_pages + nr_meta_pages + 1;
1647}
1648
Rafael J. Wysockid307c4a2007-10-18 03:04:52 -07001649static int init_header(struct swsusp_info *info)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001650{
1651 memset(info, 0, sizeof(struct swsusp_info));
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001652 info->num_physpages = num_physpages;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001653 info->image_pages = nr_copy_pages;
Rafael J. Wysockiaf508b32007-10-26 00:59:31 +02001654 info->pages = snapshot_get_image_size();
Rafael J. Wysocki6e1819d2006-03-23 03:00:03 -08001655 info->size = info->pages;
1656 info->size <<= PAGE_SHIFT;
Rafael J. Wysockid307c4a2007-10-18 03:04:52 -07001657 return init_header_complete(info);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001658}
1659
1660/**
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001661 * pack_pfns - pfns corresponding to the set bits found in the bitmap @bm
1662 * are stored in the array @buf[] (1 page at a time)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001663 */
1664
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001665static inline void
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001666pack_pfns(unsigned long *buf, struct memory_bitmap *bm)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001667{
1668 int j;
1669
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001670 for (j = 0; j < PAGE_SIZE / sizeof(long); j++) {
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001671 buf[j] = memory_bm_next_pfn(bm);
1672 if (unlikely(buf[j] == BM_END_OF_MAP))
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001673 break;
Martin Schwidefsky85055dd2011-08-17 20:42:24 +02001674 /* Save page key for data page (s390 only). */
1675 page_key_read(buf + j);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001676 }
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001677}
1678
1679/**
1680 * snapshot_read_next - used for reading the system memory snapshot.
1681 *
1682 * On the first call to it @handle should point to a zeroed
1683 * snapshot_handle structure. The structure gets updated and a pointer
1684 * to it should be passed to this function every next time.
1685 *
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001686 * On success the function returns a positive number. Then, the caller
1687 * is allowed to read up to the returned number of bytes from the memory
Jiri Slabyd3c1b242010-05-01 23:52:02 +02001688 * location computed by the data_of() macro.
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001689 *
1690 * The function returns 0 to indicate the end of data stream condition,
1691 * and a negative number is returned on error. In such cases the
1692 * structure pointed to by @handle is not updated and should not be used
1693 * any more.
1694 */
1695
Jiri Slabyd3c1b242010-05-01 23:52:02 +02001696int snapshot_read_next(struct snapshot_handle *handle)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001697{
Rafael J. Wysockifb13a282006-09-25 23:32:46 -07001698 if (handle->cur > nr_meta_pages + nr_copy_pages)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001699 return 0;
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001700
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001701 if (!buffer) {
1702 /* This makes the buffer be freed by swsusp_free() */
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001703 buffer = get_image_page(GFP_ATOMIC, PG_ANY);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001704 if (!buffer)
1705 return -ENOMEM;
1706 }
Jiri Slabyd3c1b242010-05-01 23:52:02 +02001707 if (!handle->cur) {
Rafael J. Wysockid307c4a2007-10-18 03:04:52 -07001708 int error;
1709
1710 error = init_header((struct swsusp_info *)buffer);
1711 if (error)
1712 return error;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001713 handle->buffer = buffer;
Rafael J. Wysockib788db72006-09-25 23:32:54 -07001714 memory_bm_position_reset(&orig_bm);
1715 memory_bm_position_reset(&copy_bm);
Jiri Slabyd3c1b242010-05-01 23:52:02 +02001716 } else if (handle->cur <= nr_meta_pages) {
Jan Beulich3ecb01d2010-10-26 14:22:27 -07001717 clear_page(buffer);
Jiri Slabyd3c1b242010-05-01 23:52:02 +02001718 pack_pfns(buffer, &orig_bm);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001719 } else {
Jiri Slabyd3c1b242010-05-01 23:52:02 +02001720 struct page *page;
1721
1722 page = pfn_to_page(memory_bm_next_pfn(&copy_bm));
1723 if (PageHighMem(page)) {
1724 /* Highmem pages are copied to the buffer,
1725 * because we can't return with a kmapped
1726 * highmem page (we may not be called again).
1727 */
1728 void *kaddr;
1729
1730 kaddr = kmap_atomic(page, KM_USER0);
Jan Beulich3ecb01d2010-10-26 14:22:27 -07001731 copy_page(buffer, kaddr);
Jiri Slabyd3c1b242010-05-01 23:52:02 +02001732 kunmap_atomic(kaddr, KM_USER0);
1733 handle->buffer = buffer;
1734 } else {
1735 handle->buffer = page_address(page);
1736 }
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001737 }
Jiri Slabyd3c1b242010-05-01 23:52:02 +02001738 handle->cur++;
1739 return PAGE_SIZE;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001740}
1741
1742/**
1743 * mark_unsafe_pages - mark the pages that cannot be used for storing
1744 * the image during resume, because they conflict with the pages that
1745 * had been used before suspend
1746 */
1747
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001748static int mark_unsafe_pages(struct memory_bitmap *bm)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001749{
1750 struct zone *zone;
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -07001751 unsigned long pfn, max_zone_pfn;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001752
1753 /* Clear page flags */
Gerald Schaefer98e73dc2009-07-22 00:36:56 +02001754 for_each_populated_zone(zone) {
Rafael J. Wysockiae83c5e2006-09-25 23:32:45 -07001755 max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
1756 for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
1757 if (pfn_valid(pfn))
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001758 swsusp_unset_page_free(pfn_to_page(pfn));
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001759 }
1760
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001761 /* Mark pages that correspond to the "original" pfns as "unsafe" */
1762 memory_bm_position_reset(bm);
1763 do {
1764 pfn = memory_bm_next_pfn(bm);
1765 if (likely(pfn != BM_END_OF_MAP)) {
1766 if (likely(pfn_valid(pfn)))
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001767 swsusp_set_page_free(pfn_to_page(pfn));
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001768 else
1769 return -EFAULT;
1770 }
1771 } while (pfn != BM_END_OF_MAP);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001772
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001773 allocated_unsafe_pages = 0;
Rafael J. Wysocki968808b2006-06-23 02:04:48 -07001774
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001775 return 0;
1776}
1777
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001778static void
1779duplicate_memory_bitmap(struct memory_bitmap *dst, struct memory_bitmap *src)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001780{
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001781 unsigned long pfn;
1782
1783 memory_bm_position_reset(src);
1784 pfn = memory_bm_next_pfn(src);
1785 while (pfn != BM_END_OF_MAP) {
1786 memory_bm_set_bit(dst, pfn);
1787 pfn = memory_bm_next_pfn(src);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001788 }
1789}
1790
Rafael J. Wysockid307c4a2007-10-18 03:04:52 -07001791static int check_header(struct swsusp_info *info)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001792{
Rafael J. Wysockid307c4a2007-10-18 03:04:52 -07001793 char *reason;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001794
Rafael J. Wysockid307c4a2007-10-18 03:04:52 -07001795 reason = check_image_kernel(info);
1796 if (!reason && info->num_physpages != num_physpages)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001797 reason = "memory size";
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001798 if (reason) {
Rafael J. Wysocki23976722007-12-08 02:09:43 +01001799 printk(KERN_ERR "PM: Image mismatch: %s\n", reason);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001800 return -EPERM;
1801 }
1802 return 0;
1803}
1804
1805/**
1806 * load header - check the image header and copy data from it
1807 */
1808
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001809static int
1810load_header(struct swsusp_info *info)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001811{
1812 int error;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001813
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001814 restore_pblist = NULL;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001815 error = check_header(info);
1816 if (!error) {
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001817 nr_copy_pages = info->image_pages;
1818 nr_meta_pages = info->pages - info->image_pages - 1;
1819 }
1820 return error;
1821}
1822
1823/**
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001824 * unpack_orig_pfns - for each element of @buf[] (1 page at a time) set
1825 * the corresponding bit in the memory bitmap @bm
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001826 */
Rafael J. Wysocki69643272008-11-11 21:32:44 +01001827static int unpack_orig_pfns(unsigned long *buf, struct memory_bitmap *bm)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001828{
1829 int j;
1830
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07001831 for (j = 0; j < PAGE_SIZE / sizeof(long); j++) {
1832 if (unlikely(buf[j] == BM_END_OF_MAP))
1833 break;
1834
Martin Schwidefsky85055dd2011-08-17 20:42:24 +02001835 /* Extract and buffer page key for data page (s390 only). */
1836 page_key_memorize(buf + j);
1837
Rafael J. Wysocki69643272008-11-11 21:32:44 +01001838 if (memory_bm_pfn_present(bm, buf[j]))
1839 memory_bm_set_bit(bm, buf[j]);
1840 else
1841 return -EFAULT;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001842 }
Rafael J. Wysocki69643272008-11-11 21:32:44 +01001843
1844 return 0;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08001845}
1846
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001847/* List of "safe" pages that may be used to store data loaded from the suspend
1848 * image
1849 */
1850static struct linked_page *safe_pages_list;
1851
1852#ifdef CONFIG_HIGHMEM
1853/* struct highmem_pbe is used for creating the list of highmem pages that
1854 * should be restored atomically during the resume from disk, because the page
1855 * frames they have occupied before the suspend are in use.
1856 */
1857struct highmem_pbe {
1858 struct page *copy_page; /* data is here now */
1859 struct page *orig_page; /* data was here before the suspend */
1860 struct highmem_pbe *next;
1861};
1862
1863/* List of highmem PBEs needed for restoring the highmem pages that were
1864 * allocated before the suspend and included in the suspend image, but have
1865 * also been allocated by the "resume" kernel, so their contents cannot be
1866 * written directly to their "original" page frames.
1867 */
1868static struct highmem_pbe *highmem_pblist;
1869
1870/**
1871 * count_highmem_image_pages - compute the number of highmem pages in the
1872 * suspend image. The bits in the memory bitmap @bm that correspond to the
1873 * image pages are assumed to be set.
1874 */
1875
1876static unsigned int count_highmem_image_pages(struct memory_bitmap *bm)
1877{
1878 unsigned long pfn;
1879 unsigned int cnt = 0;
1880
1881 memory_bm_position_reset(bm);
1882 pfn = memory_bm_next_pfn(bm);
1883 while (pfn != BM_END_OF_MAP) {
1884 if (PageHighMem(pfn_to_page(pfn)))
1885 cnt++;
1886
1887 pfn = memory_bm_next_pfn(bm);
1888 }
1889 return cnt;
1890}
1891
1892/**
1893 * prepare_highmem_image - try to allocate as many highmem pages as
1894 * there are highmem image pages (@nr_highmem_p points to the variable
1895 * containing the number of highmem image pages). The pages that are
1896 * "safe" (ie. will not be overwritten when the suspend image is
1897 * restored) have the corresponding bits set in @bm (it must be
1898 * unitialized).
1899 *
1900 * NOTE: This function should not be called if there are no highmem
1901 * image pages.
1902 */
1903
1904static unsigned int safe_highmem_pages;
1905
1906static struct memory_bitmap *safe_highmem_bm;
1907
1908static int
1909prepare_highmem_image(struct memory_bitmap *bm, unsigned int *nr_highmem_p)
1910{
1911 unsigned int to_alloc;
1912
1913 if (memory_bm_create(bm, GFP_ATOMIC, PG_SAFE))
1914 return -ENOMEM;
1915
1916 if (get_highmem_buffer(PG_SAFE))
1917 return -ENOMEM;
1918
1919 to_alloc = count_free_highmem_pages();
1920 if (to_alloc > *nr_highmem_p)
1921 to_alloc = *nr_highmem_p;
1922 else
1923 *nr_highmem_p = to_alloc;
1924
1925 safe_highmem_pages = 0;
1926 while (to_alloc-- > 0) {
1927 struct page *page;
1928
1929 page = alloc_page(__GFP_HIGHMEM);
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001930 if (!swsusp_page_is_free(page)) {
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001931 /* The page is "safe", set its bit the bitmap */
1932 memory_bm_set_bit(bm, page_to_pfn(page));
1933 safe_highmem_pages++;
1934 }
1935 /* Mark the page as allocated */
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001936 swsusp_set_page_forbidden(page);
1937 swsusp_set_page_free(page);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001938 }
1939 memory_bm_position_reset(bm);
1940 safe_highmem_bm = bm;
1941 return 0;
1942}
1943
1944/**
1945 * get_highmem_page_buffer - for given highmem image page find the buffer
1946 * that suspend_write_next() should set for its caller to write to.
1947 *
1948 * If the page is to be saved to its "original" page frame or a copy of
1949 * the page is to be made in the highmem, @buffer is returned. Otherwise,
1950 * the copy of the page is to be made in normal memory, so the address of
1951 * the copy is returned.
1952 *
1953 * If @buffer is returned, the caller of suspend_write_next() will write
1954 * the page's contents to @buffer, so they will have to be copied to the
1955 * right location on the next call to suspend_write_next() and it is done
1956 * with the help of copy_last_highmem_page(). For this purpose, if
1957 * @buffer is returned, @last_highmem page is set to the page to which
1958 * the data will have to be copied from @buffer.
1959 */
1960
1961static struct page *last_highmem_page;
1962
1963static void *
1964get_highmem_page_buffer(struct page *page, struct chain_allocator *ca)
1965{
1966 struct highmem_pbe *pbe;
1967 void *kaddr;
1968
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07001969 if (swsusp_page_is_forbidden(page) && swsusp_page_is_free(page)) {
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001970 /* We have allocated the "original" page frame and we can
1971 * use it directly to store the loaded page.
1972 */
1973 last_highmem_page = page;
1974 return buffer;
1975 }
1976 /* The "original" page frame has not been allocated and we have to
1977 * use a "safe" page frame to store the loaded page.
1978 */
1979 pbe = chain_alloc(ca, sizeof(struct highmem_pbe));
1980 if (!pbe) {
1981 swsusp_free();
Rafael J. Wysocki69643272008-11-11 21:32:44 +01001982 return ERR_PTR(-ENOMEM);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08001983 }
1984 pbe->orig_page = page;
1985 if (safe_highmem_pages > 0) {
1986 struct page *tmp;
1987
1988 /* Copy of the page will be stored in high memory */
1989 kaddr = buffer;
1990 tmp = pfn_to_page(memory_bm_next_pfn(safe_highmem_bm));
1991 safe_highmem_pages--;
1992 last_highmem_page = tmp;
1993 pbe->copy_page = tmp;
1994 } else {
1995 /* Copy of the page will be stored in normal memory */
1996 kaddr = safe_pages_list;
1997 safe_pages_list = safe_pages_list->next;
1998 pbe->copy_page = virt_to_page(kaddr);
1999 }
2000 pbe->next = highmem_pblist;
2001 highmem_pblist = pbe;
2002 return kaddr;
2003}
2004
2005/**
2006 * copy_last_highmem_page - copy the contents of a highmem image from
2007 * @buffer, where the caller of snapshot_write_next() has place them,
2008 * to the right location represented by @last_highmem_page .
2009 */
2010
2011static void copy_last_highmem_page(void)
2012{
2013 if (last_highmem_page) {
2014 void *dst;
2015
2016 dst = kmap_atomic(last_highmem_page, KM_USER0);
Jan Beulich3ecb01d2010-10-26 14:22:27 -07002017 copy_page(dst, buffer);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002018 kunmap_atomic(dst, KM_USER0);
2019 last_highmem_page = NULL;
2020 }
2021}
2022
2023static inline int last_highmem_page_copied(void)
2024{
2025 return !last_highmem_page;
2026}
2027
2028static inline void free_highmem_data(void)
2029{
2030 if (safe_highmem_bm)
2031 memory_bm_free(safe_highmem_bm, PG_UNSAFE_CLEAR);
2032
2033 if (buffer)
2034 free_image_page(buffer, PG_UNSAFE_CLEAR);
2035}
2036#else
2037static inline int get_safe_write_buffer(void) { return 0; }
2038
2039static unsigned int
2040count_highmem_image_pages(struct memory_bitmap *bm) { return 0; }
2041
2042static inline int
2043prepare_highmem_image(struct memory_bitmap *bm, unsigned int *nr_highmem_p)
2044{
2045 return 0;
2046}
2047
2048static inline void *
2049get_highmem_page_buffer(struct page *page, struct chain_allocator *ca)
2050{
Rafael J. Wysocki69643272008-11-11 21:32:44 +01002051 return ERR_PTR(-EINVAL);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002052}
2053
2054static inline void copy_last_highmem_page(void) {}
2055static inline int last_highmem_page_copied(void) { return 1; }
2056static inline void free_highmem_data(void) {}
2057#endif /* CONFIG_HIGHMEM */
2058
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002059/**
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002060 * prepare_image - use the memory bitmap @bm to mark the pages that will
2061 * be overwritten in the process of restoring the system memory state
2062 * from the suspend image ("unsafe" pages) and allocate memory for the
2063 * image.
Rafael J. Wysocki968808b2006-06-23 02:04:48 -07002064 *
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002065 * The idea is to allocate a new memory bitmap first and then allocate
2066 * as many pages as needed for the image data, but not to assign these
2067 * pages to specific tasks initially. Instead, we just mark them as
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002068 * allocated and create a lists of "safe" pages that will be used
2069 * later. On systems with high memory a list of "safe" highmem pages is
2070 * also created.
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002071 */
2072
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002073#define PBES_PER_LINKED_PAGE (LINKED_PAGE_DATA_SIZE / sizeof(struct pbe))
Rafael J. Wysocki968808b2006-06-23 02:04:48 -07002074
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002075static int
2076prepare_image(struct memory_bitmap *new_bm, struct memory_bitmap *bm)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002077{
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002078 unsigned int nr_pages, nr_highmem;
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002079 struct linked_page *sp_list, *lp;
2080 int error;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002081
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002082 /* If there is no highmem, the buffer will not be necessary */
2083 free_image_page(buffer, PG_UNSAFE_CLEAR);
2084 buffer = NULL;
2085
2086 nr_highmem = count_highmem_image_pages(bm);
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002087 error = mark_unsafe_pages(bm);
2088 if (error)
2089 goto Free;
2090
2091 error = memory_bm_create(new_bm, GFP_ATOMIC, PG_SAFE);
2092 if (error)
2093 goto Free;
2094
2095 duplicate_memory_bitmap(new_bm, bm);
2096 memory_bm_free(bm, PG_UNSAFE_KEEP);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002097 if (nr_highmem > 0) {
2098 error = prepare_highmem_image(bm, &nr_highmem);
2099 if (error)
2100 goto Free;
2101 }
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002102 /* Reserve some safe pages for potential later use.
2103 *
2104 * NOTE: This way we make sure there will be enough safe pages for the
2105 * chain_alloc() in get_buffer(). It is a bit wasteful, but
2106 * nr_copy_pages cannot be greater than 50% of the memory anyway.
2107 */
2108 sp_list = NULL;
2109 /* nr_copy_pages cannot be lesser than allocated_unsafe_pages */
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002110 nr_pages = nr_copy_pages - nr_highmem - allocated_unsafe_pages;
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002111 nr_pages = DIV_ROUND_UP(nr_pages, PBES_PER_LINKED_PAGE);
2112 while (nr_pages > 0) {
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002113 lp = get_image_page(GFP_ATOMIC, PG_SAFE);
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002114 if (!lp) {
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002115 error = -ENOMEM;
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002116 goto Free;
Rafael J. Wysocki968808b2006-06-23 02:04:48 -07002117 }
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002118 lp->next = sp_list;
2119 sp_list = lp;
2120 nr_pages--;
Rafael J. Wysocki968808b2006-06-23 02:04:48 -07002121 }
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002122 /* Preallocate memory for the image */
2123 safe_pages_list = NULL;
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002124 nr_pages = nr_copy_pages - nr_highmem - allocated_unsafe_pages;
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002125 while (nr_pages > 0) {
2126 lp = (struct linked_page *)get_zeroed_page(GFP_ATOMIC);
2127 if (!lp) {
2128 error = -ENOMEM;
2129 goto Free;
2130 }
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07002131 if (!swsusp_page_is_free(virt_to_page(lp))) {
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002132 /* The page is "safe", add it to the list */
2133 lp->next = safe_pages_list;
2134 safe_pages_list = lp;
2135 }
2136 /* Mark the page as allocated */
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07002137 swsusp_set_page_forbidden(virt_to_page(lp));
2138 swsusp_set_page_free(virt_to_page(lp));
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002139 nr_pages--;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002140 }
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002141 /* Free the reserved safe pages so that chain_alloc() can use them */
2142 while (sp_list) {
2143 lp = sp_list->next;
2144 free_image_page(sp_list, PG_UNSAFE_CLEAR);
2145 sp_list = lp;
2146 }
2147 return 0;
2148
Rafael J. Wysocki59a49332006-12-06 20:34:44 -08002149 Free:
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002150 swsusp_free();
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002151 return error;
2152}
2153
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002154/**
2155 * get_buffer - compute the address that snapshot_write_next() should
2156 * set for its caller to write to.
2157 */
Rafael J. Wysocki968808b2006-06-23 02:04:48 -07002158
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002159static void *get_buffer(struct memory_bitmap *bm, struct chain_allocator *ca)
2160{
2161 struct pbe *pbe;
Rafael J. Wysocki69643272008-11-11 21:32:44 +01002162 struct page *page;
2163 unsigned long pfn = memory_bm_next_pfn(bm);
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002164
Rafael J. Wysocki69643272008-11-11 21:32:44 +01002165 if (pfn == BM_END_OF_MAP)
2166 return ERR_PTR(-EFAULT);
2167
2168 page = pfn_to_page(pfn);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002169 if (PageHighMem(page))
2170 return get_highmem_page_buffer(page, ca);
2171
Rafael J. Wysocki7be98232007-05-06 14:50:42 -07002172 if (swsusp_page_is_forbidden(page) && swsusp_page_is_free(page))
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002173 /* We have allocated the "original" page frame and we can
2174 * use it directly to store the loaded page.
Rafael J. Wysocki968808b2006-06-23 02:04:48 -07002175 */
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002176 return page_address(page);
2177
2178 /* The "original" page frame has not been allocated and we have to
2179 * use a "safe" page frame to store the loaded page.
Rafael J. Wysocki968808b2006-06-23 02:04:48 -07002180 */
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002181 pbe = chain_alloc(ca, sizeof(struct pbe));
2182 if (!pbe) {
2183 swsusp_free();
Rafael J. Wysocki69643272008-11-11 21:32:44 +01002184 return ERR_PTR(-ENOMEM);
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002185 }
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002186 pbe->orig_address = page_address(page);
2187 pbe->address = safe_pages_list;
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002188 safe_pages_list = safe_pages_list->next;
2189 pbe->next = restore_pblist;
2190 restore_pblist = pbe;
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002191 return pbe->address;
Rafael J. Wysocki968808b2006-06-23 02:04:48 -07002192}
2193
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002194/**
2195 * snapshot_write_next - used for writing the system memory snapshot.
2196 *
2197 * On the first call to it @handle should point to a zeroed
2198 * snapshot_handle structure. The structure gets updated and a pointer
2199 * to it should be passed to this function every next time.
2200 *
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002201 * On success the function returns a positive number. Then, the caller
2202 * is allowed to write up to the returned number of bytes to the memory
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002203 * location computed by the data_of() macro.
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002204 *
2205 * The function returns 0 to indicate the "end of file" condition,
2206 * and a negative number is returned on error. In such cases the
2207 * structure pointed to by @handle is not updated and should not be used
2208 * any more.
2209 */
2210
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002211int snapshot_write_next(struct snapshot_handle *handle)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002212{
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002213 static struct chain_allocator ca;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002214 int error = 0;
2215
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002216 /* Check if we have already loaded the entire image */
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002217 if (handle->cur > 1 && handle->cur > nr_meta_pages + nr_copy_pages)
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002218 return 0;
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002219
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002220 handle->sync_read = 1;
2221
2222 if (!handle->cur) {
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002223 if (!buffer)
2224 /* This makes the buffer be freed by swsusp_free() */
2225 buffer = get_image_page(GFP_ATOMIC, PG_ANY);
2226
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002227 if (!buffer)
2228 return -ENOMEM;
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002229
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002230 handle->buffer = buffer;
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002231 } else if (handle->cur == 1) {
2232 error = load_header(buffer);
2233 if (error)
2234 return error;
2235
2236 error = memory_bm_create(&copy_bm, GFP_ATOMIC, PG_ANY);
2237 if (error)
2238 return error;
2239
Martin Schwidefsky85055dd2011-08-17 20:42:24 +02002240 /* Allocate buffer for page keys. */
2241 error = page_key_alloc(nr_copy_pages);
2242 if (error)
2243 return error;
2244
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002245 } else if (handle->cur <= nr_meta_pages + 1) {
2246 error = unpack_orig_pfns(buffer, &copy_bm);
2247 if (error)
2248 return error;
2249
2250 if (handle->cur == nr_meta_pages + 1) {
2251 error = prepare_image(&orig_bm, &copy_bm);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002252 if (error)
2253 return error;
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002254
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002255 chain_init(&ca, GFP_ATOMIC, PG_SAFE);
2256 memory_bm_position_reset(&orig_bm);
2257 restore_pblist = NULL;
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002258 handle->buffer = get_buffer(&orig_bm, &ca);
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002259 handle->sync_read = 0;
Rafael J. Wysocki69643272008-11-11 21:32:44 +01002260 if (IS_ERR(handle->buffer))
2261 return PTR_ERR(handle->buffer);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002262 }
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002263 } else {
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002264 copy_last_highmem_page();
Martin Schwidefsky85055dd2011-08-17 20:42:24 +02002265 /* Restore page key for data page (s390 only). */
2266 page_key_write(handle->buffer);
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002267 handle->buffer = get_buffer(&orig_bm, &ca);
2268 if (IS_ERR(handle->buffer))
2269 return PTR_ERR(handle->buffer);
2270 if (handle->buffer != buffer)
2271 handle->sync_read = 0;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002272 }
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002273 handle->cur++;
2274 return PAGE_SIZE;
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002275}
2276
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002277/**
2278 * snapshot_write_finalize - must be called after the last call to
2279 * snapshot_write_next() in case the last page in the image happens
2280 * to be a highmem page and its contents should be stored in the
2281 * highmem. Additionally, it releases the memory that will not be
2282 * used any more.
2283 */
2284
2285void snapshot_write_finalize(struct snapshot_handle *handle)
2286{
2287 copy_last_highmem_page();
Martin Schwidefsky85055dd2011-08-17 20:42:24 +02002288 /* Restore page key for data page (s390 only). */
2289 page_key_write(handle->buffer);
2290 page_key_free();
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002291 /* Free only if we have loaded the image entirely */
Jiri Slabyd3c1b242010-05-01 23:52:02 +02002292 if (handle->cur > 1 && handle->cur > nr_meta_pages + nr_copy_pages) {
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002293 memory_bm_free(&orig_bm, PG_UNSAFE_CLEAR);
2294 free_highmem_data();
2295 }
2296}
2297
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002298int snapshot_image_loaded(struct snapshot_handle *handle)
2299{
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002300 return !(!nr_copy_pages || !last_highmem_page_copied() ||
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002301 handle->cur <= nr_meta_pages + nr_copy_pages);
2302}
2303
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002304#ifdef CONFIG_HIGHMEM
2305/* Assumes that @buf is ready and points to a "safe" page */
2306static inline void
2307swap_two_pages_data(struct page *p1, struct page *p2, void *buf)
Rafael J. Wysocki940864d2006-09-25 23:32:55 -07002308{
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002309 void *kaddr1, *kaddr2;
2310
2311 kaddr1 = kmap_atomic(p1, KM_USER0);
2312 kaddr2 = kmap_atomic(p2, KM_USER1);
Jan Beulich3ecb01d2010-10-26 14:22:27 -07002313 copy_page(buf, kaddr1);
2314 copy_page(kaddr1, kaddr2);
2315 copy_page(kaddr2, buf);
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002316 kunmap_atomic(kaddr2, KM_USER1);
Peter Zijlstra61ecdb802010-10-26 14:21:47 -07002317 kunmap_atomic(kaddr1, KM_USER0);
Rafael J. Wysockif577eb32006-03-23 02:59:59 -08002318}
Rafael J. Wysocki83573762006-12-06 20:34:18 -08002319
2320/**
2321 * restore_highmem - for each highmem page that was allocated before
2322 * the suspend and included in the suspend image, and also has been
2323 * allocated by the "resume" kernel swap its current (ie. "before
2324 * resume") contents with the previous (ie. "before suspend") one.
2325 *
2326 * If the resume eventually fails, we can call this function once
2327 * again and restore the "before resume" highmem state.
2328 */
2329
2330int restore_highmem(void)
2331{
2332 struct highmem_pbe *pbe = highmem_pblist;
2333 void *buf;
2334
2335 if (!pbe)
2336 return 0;
2337
2338 buf = get_image_page(GFP_ATOMIC, PG_SAFE);
2339 if (!buf)
2340 return -ENOMEM;
2341
2342 while (pbe) {
2343 swap_two_pages_data(pbe->copy_page, pbe->orig_page, buf);
2344 pbe = pbe->next;
2345 }
2346 free_image_page(buf, PG_UNSAFE_CLEAR);
2347 return 0;
2348}
2349#endif /* CONFIG_HIGHMEM */