snapshot.c 61 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352
  1. /*
  2. * linux/kernel/power/snapshot.c
  3. *
  4. * This file provides system snapshot/restore functionality for swsusp.
  5. *
  6. * Copyright (C) 1998-2005 Pavel Machek <pavel@ucw.cz>
  7. * Copyright (C) 2006 Rafael J. Wysocki <rjw@sisk.pl>
  8. *
  9. * This file is released under the GPLv2.
  10. *
  11. */
  12. #include <linux/version.h>
  13. #include <linux/module.h>
  14. #include <linux/mm.h>
  15. #include <linux/suspend.h>
  16. #include <linux/delay.h>
  17. #include <linux/bitops.h>
  18. #include <linux/spinlock.h>
  19. #include <linux/kernel.h>
  20. #include <linux/pm.h>
  21. #include <linux/device.h>
  22. #include <linux/init.h>
  23. #include <linux/bootmem.h>
  24. #include <linux/syscalls.h>
  25. #include <linux/console.h>
  26. #include <linux/highmem.h>
  27. #include <linux/list.h>
  28. #include <linux/slab.h>
  29. #include <asm/uaccess.h>
  30. #include <asm/mmu_context.h>
  31. #include <asm/pgtable.h>
  32. #include <asm/tlbflush.h>
  33. #include <asm/io.h>
  34. #include "power.h"
  35. static int swsusp_page_is_free(struct page *);
  36. static void swsusp_set_page_forbidden(struct page *);
  37. static void swsusp_unset_page_forbidden(struct page *);
  38. /*
  39. * Number of bytes to reserve for memory allocations made by device drivers
  40. * from their ->freeze() and ->freeze_noirq() callbacks so that they don't
  41. * cause image creation to fail (tunable via /sys/power/reserved_size).
  42. */
  43. unsigned long reserved_size;
  44. void __init hibernate_reserved_size_init(void)
  45. {
  46. reserved_size = SPARE_PAGES * PAGE_SIZE;
  47. }
  48. /*
  49. * Preferred image size in bytes (tunable via /sys/power/image_size).
  50. * When it is set to N, swsusp will do its best to ensure the image
  51. * size will not exceed N bytes, but if that is impossible, it will
  52. * try to create the smallest image possible.
  53. */
  54. unsigned long image_size;
  55. void __init hibernate_image_size_init(void)
  56. {
  57. image_size = ((totalram_pages * 2) / 5) * PAGE_SIZE;
  58. }
  59. /* List of PBEs needed for restoring the pages that were allocated before
  60. * the suspend and included in the suspend image, but have also been
  61. * allocated by the "resume" kernel, so their contents cannot be written
  62. * directly to their "original" page frames.
  63. */
  64. struct pbe *restore_pblist;
  65. /* Pointer to an auxiliary buffer (1 page) */
  66. static void *buffer;
  67. /**
  68. * @safe_needed - on resume, for storing the PBE list and the image,
  69. * we can only use memory pages that do not conflict with the pages
  70. * used before suspend. The unsafe pages have PageNosaveFree set
  71. * and we count them using unsafe_pages.
  72. *
  73. * Each allocated image page is marked as PageNosave and PageNosaveFree
  74. * so that swsusp_free() can release it.
  75. */
  76. #define PG_ANY 0
  77. #define PG_SAFE 1
  78. #define PG_UNSAFE_CLEAR 1
  79. #define PG_UNSAFE_KEEP 0
  80. static unsigned int allocated_unsafe_pages;
  81. static void *get_image_page(gfp_t gfp_mask, int safe_needed)
  82. {
  83. void *res;
  84. res = (void *)get_zeroed_page(gfp_mask);
  85. if (safe_needed)
  86. while (res && swsusp_page_is_free(virt_to_page(res))) {
  87. /* The page is unsafe, mark it for swsusp_free() */
  88. swsusp_set_page_forbidden(virt_to_page(res));
  89. allocated_unsafe_pages++;
  90. res = (void *)get_zeroed_page(gfp_mask);
  91. }
  92. if (res) {
  93. swsusp_set_page_forbidden(virt_to_page(res));
  94. swsusp_set_page_free(virt_to_page(res));
  95. }
  96. return res;
  97. }
  98. unsigned long get_safe_page(gfp_t gfp_mask)
  99. {
  100. return (unsigned long)get_image_page(gfp_mask, PG_SAFE);
  101. }
  102. static struct page *alloc_image_page(gfp_t gfp_mask)
  103. {
  104. struct page *page;
  105. page = alloc_page(gfp_mask);
  106. if (page) {
  107. swsusp_set_page_forbidden(page);
  108. swsusp_set_page_free(page);
  109. }
  110. return page;
  111. }
  112. /**
  113. * free_image_page - free page represented by @addr, allocated with
  114. * get_image_page (page flags set by it must be cleared)
  115. */
  116. static inline void free_image_page(void *addr, int clear_nosave_free)
  117. {
  118. struct page *page;
  119. BUG_ON(!virt_addr_valid(addr));
  120. page = virt_to_page(addr);
  121. swsusp_unset_page_forbidden(page);
  122. if (clear_nosave_free)
  123. swsusp_unset_page_free(page);
  124. __free_page(page);
  125. }
  126. /* struct linked_page is used to build chains of pages */
  127. #define LINKED_PAGE_DATA_SIZE (PAGE_SIZE - sizeof(void *))
  128. struct linked_page {
  129. struct linked_page *next;
  130. char data[LINKED_PAGE_DATA_SIZE];
  131. } __attribute__((packed));
  132. static inline void
  133. free_list_of_pages(struct linked_page *list, int clear_page_nosave)
  134. {
  135. while (list) {
  136. struct linked_page *lp = list->next;
  137. free_image_page(list, clear_page_nosave);
  138. list = lp;
  139. }
  140. }
  141. /**
  142. * struct chain_allocator is used for allocating small objects out of
  143. * a linked list of pages called 'the chain'.
  144. *
  145. * The chain grows each time when there is no room for a new object in
  146. * the current page. The allocated objects cannot be freed individually.
  147. * It is only possible to free them all at once, by freeing the entire
  148. * chain.
  149. *
  150. * NOTE: The chain allocator may be inefficient if the allocated objects
  151. * are not much smaller than PAGE_SIZE.
  152. */
  153. struct chain_allocator {
  154. struct linked_page *chain; /* the chain */
  155. unsigned int used_space; /* total size of objects allocated out
  156. * of the current page
  157. */
  158. gfp_t gfp_mask; /* mask for allocating pages */
  159. int safe_needed; /* if set, only "safe" pages are allocated */
  160. };
  161. static void
  162. chain_init(struct chain_allocator *ca, gfp_t gfp_mask, int safe_needed)
  163. {
  164. ca->chain = NULL;
  165. ca->used_space = LINKED_PAGE_DATA_SIZE;
  166. ca->gfp_mask = gfp_mask;
  167. ca->safe_needed = safe_needed;
  168. }
  169. static void *chain_alloc(struct chain_allocator *ca, unsigned int size)
  170. {
  171. void *ret;
  172. if (LINKED_PAGE_DATA_SIZE - ca->used_space < size) {
  173. struct linked_page *lp;
  174. lp = get_image_page(ca->gfp_mask, ca->safe_needed);
  175. if (!lp)
  176. return NULL;
  177. lp->next = ca->chain;
  178. ca->chain = lp;
  179. ca->used_space = 0;
  180. }
  181. ret = ca->chain->data + ca->used_space;
  182. ca->used_space += size;
  183. return ret;
  184. }
  185. /**
  186. * Data types related to memory bitmaps.
  187. *
  188. * Memory bitmap is a structure consiting of many linked lists of
  189. * objects. The main list's elements are of type struct zone_bitmap
  190. * and each of them corresonds to one zone. For each zone bitmap
  191. * object there is a list of objects of type struct bm_block that
  192. * represent each blocks of bitmap in which information is stored.
  193. *
  194. * struct memory_bitmap contains a pointer to the main list of zone
  195. * bitmap objects, a struct bm_position used for browsing the bitmap,
  196. * and a pointer to the list of pages used for allocating all of the
  197. * zone bitmap objects and bitmap block objects.
  198. *
  199. * NOTE: It has to be possible to lay out the bitmap in memory
  200. * using only allocations of order 0. Additionally, the bitmap is
  201. * designed to work with arbitrary number of zones (this is over the
  202. * top for now, but let's avoid making unnecessary assumptions ;-).
  203. *
  204. * struct zone_bitmap contains a pointer to a list of bitmap block
  205. * objects and a pointer to the bitmap block object that has been
  206. * most recently used for setting bits. Additionally, it contains the
  207. * pfns that correspond to the start and end of the represented zone.
  208. *
  209. * struct bm_block contains a pointer to the memory page in which
  210. * information is stored (in the form of a block of bitmap)
  211. * It also contains the pfns that correspond to the start and end of
  212. * the represented memory area.
  213. */
  214. #define BM_END_OF_MAP (~0UL)
  215. #define BM_BITS_PER_BLOCK (PAGE_SIZE * BITS_PER_BYTE)
  216. struct bm_block {
  217. struct list_head hook; /* hook into a list of bitmap blocks */
  218. unsigned long start_pfn; /* pfn represented by the first bit */
  219. unsigned long end_pfn; /* pfn represented by the last bit plus 1 */
  220. unsigned long *data; /* bitmap representing pages */
  221. };
  222. static inline unsigned long bm_block_bits(struct bm_block *bb)
  223. {
  224. return bb->end_pfn - bb->start_pfn;
  225. }
  226. /* strcut bm_position is used for browsing memory bitmaps */
  227. struct bm_position {
  228. struct bm_block *block;
  229. int bit;
  230. };
  231. struct memory_bitmap {
  232. struct list_head blocks; /* list of bitmap blocks */
  233. struct linked_page *p_list; /* list of pages used to store zone
  234. * bitmap objects and bitmap block
  235. * objects
  236. */
  237. struct bm_position cur; /* most recently used bit position */
  238. };
  239. /* Functions that operate on memory bitmaps */
  240. static void memory_bm_position_reset(struct memory_bitmap *bm)
  241. {
  242. bm->cur.block = list_entry(bm->blocks.next, struct bm_block, hook);
  243. bm->cur.bit = 0;
  244. }
  245. static void memory_bm_free(struct memory_bitmap *bm, int clear_nosave_free);
  246. /**
  247. * create_bm_block_list - create a list of block bitmap objects
  248. * @pages - number of pages to track
  249. * @list - list to put the allocated blocks into
  250. * @ca - chain allocator to be used for allocating memory
  251. */
  252. static int create_bm_block_list(unsigned long pages,
  253. struct list_head *list,
  254. struct chain_allocator *ca)
  255. {
  256. unsigned int nr_blocks = DIV_ROUND_UP(pages, BM_BITS_PER_BLOCK);
  257. while (nr_blocks-- > 0) {
  258. struct bm_block *bb;
  259. bb = chain_alloc(ca, sizeof(struct bm_block));
  260. if (!bb)
  261. return -ENOMEM;
  262. list_add(&bb->hook, list);
  263. }
  264. return 0;
  265. }
  266. struct mem_extent {
  267. struct list_head hook;
  268. unsigned long start;
  269. unsigned long end;
  270. };
  271. /**
  272. * free_mem_extents - free a list of memory extents
  273. * @list - list of extents to empty
  274. */
  275. static void free_mem_extents(struct list_head *list)
  276. {
  277. struct mem_extent *ext, *aux;
  278. list_for_each_entry_safe(ext, aux, list, hook) {
  279. list_del(&ext->hook);
  280. kfree(ext);
  281. }
  282. }
  283. /**
  284. * create_mem_extents - create a list of memory extents representing
  285. * contiguous ranges of PFNs
  286. * @list - list to put the extents into
  287. * @gfp_mask - mask to use for memory allocations
  288. */
  289. static int create_mem_extents(struct list_head *list, gfp_t gfp_mask)
  290. {
  291. struct zone *zone;
  292. INIT_LIST_HEAD(list);
  293. for_each_populated_zone(zone) {
  294. unsigned long zone_start, zone_end;
  295. struct mem_extent *ext, *cur, *aux;
  296. zone_start = zone->zone_start_pfn;
  297. zone_end = zone->zone_start_pfn + zone->spanned_pages;
  298. list_for_each_entry(ext, list, hook)
  299. if (zone_start <= ext->end)
  300. break;
  301. if (&ext->hook == list || zone_end < ext->start) {
  302. /* New extent is necessary */
  303. struct mem_extent *new_ext;
  304. new_ext = kzalloc(sizeof(struct mem_extent), gfp_mask);
  305. if (!new_ext) {
  306. free_mem_extents(list);
  307. return -ENOMEM;
  308. }
  309. new_ext->start = zone_start;
  310. new_ext->end = zone_end;
  311. list_add_tail(&new_ext->hook, &ext->hook);
  312. continue;
  313. }
  314. /* Merge this zone's range of PFNs with the existing one */
  315. if (zone_start < ext->start)
  316. ext->start = zone_start;
  317. if (zone_end > ext->end)
  318. ext->end = zone_end;
  319. /* More merging may be possible */
  320. cur = ext;
  321. list_for_each_entry_safe_continue(cur, aux, list, hook) {
  322. if (zone_end < cur->start)
  323. break;
  324. if (zone_end < cur->end)
  325. ext->end = cur->end;
  326. list_del(&cur->hook);
  327. kfree(cur);
  328. }
  329. }
  330. return 0;
  331. }
  332. /**
  333. * memory_bm_create - allocate memory for a memory bitmap
  334. */
  335. static int
  336. memory_bm_create(struct memory_bitmap *bm, gfp_t gfp_mask, int safe_needed)
  337. {
  338. struct chain_allocator ca;
  339. struct list_head mem_extents;
  340. struct mem_extent *ext;
  341. int error;
  342. chain_init(&ca, gfp_mask, safe_needed);
  343. INIT_LIST_HEAD(&bm->blocks);
  344. error = create_mem_extents(&mem_extents, gfp_mask);
  345. if (error)
  346. return error;
  347. list_for_each_entry(ext, &mem_extents, hook) {
  348. struct bm_block *bb;
  349. unsigned long pfn = ext->start;
  350. unsigned long pages = ext->end - ext->start;
  351. bb = list_entry(bm->blocks.prev, struct bm_block, hook);
  352. error = create_bm_block_list(pages, bm->blocks.prev, &ca);
  353. if (error)
  354. goto Error;
  355. list_for_each_entry_continue(bb, &bm->blocks, hook) {
  356. bb->data = get_image_page(gfp_mask, safe_needed);
  357. if (!bb->data) {
  358. error = -ENOMEM;
  359. goto Error;
  360. }
  361. bb->start_pfn = pfn;
  362. if (pages >= BM_BITS_PER_BLOCK) {
  363. pfn += BM_BITS_PER_BLOCK;
  364. pages -= BM_BITS_PER_BLOCK;
  365. } else {
  366. /* This is executed only once in the loop */
  367. pfn += pages;
  368. }
  369. bb->end_pfn = pfn;
  370. }
  371. }
  372. bm->p_list = ca.chain;
  373. memory_bm_position_reset(bm);
  374. Exit:
  375. free_mem_extents(&mem_extents);
  376. return error;
  377. Error:
  378. bm->p_list = ca.chain;
  379. memory_bm_free(bm, PG_UNSAFE_CLEAR);
  380. goto Exit;
  381. }
  382. /**
  383. * memory_bm_free - free memory occupied by the memory bitmap @bm
  384. */
  385. static void memory_bm_free(struct memory_bitmap *bm, int clear_nosave_free)
  386. {
  387. struct bm_block *bb;
  388. list_for_each_entry(bb, &bm->blocks, hook)
  389. if (bb->data)
  390. free_image_page(bb->data, clear_nosave_free);
  391. free_list_of_pages(bm->p_list, clear_nosave_free);
  392. INIT_LIST_HEAD(&bm->blocks);
  393. }
  394. /**
  395. * memory_bm_find_bit - find the bit in the bitmap @bm that corresponds
  396. * to given pfn. The cur_zone_bm member of @bm and the cur_block member
  397. * of @bm->cur_zone_bm are updated.
  398. */
  399. static int memory_bm_find_bit(struct memory_bitmap *bm, unsigned long pfn,
  400. void **addr, unsigned int *bit_nr)
  401. {
  402. struct bm_block *bb;
  403. /*
  404. * Check if the pfn corresponds to the current bitmap block and find
  405. * the block where it fits if this is not the case.
  406. */
  407. bb = bm->cur.block;
  408. if (pfn < bb->start_pfn)
  409. list_for_each_entry_continue_reverse(bb, &bm->blocks, hook)
  410. if (pfn >= bb->start_pfn)
  411. break;
  412. if (pfn >= bb->end_pfn)
  413. list_for_each_entry_continue(bb, &bm->blocks, hook)
  414. if (pfn >= bb->start_pfn && pfn < bb->end_pfn)
  415. break;
  416. if (&bb->hook == &bm->blocks)
  417. return -EFAULT;
  418. /* The block has been found */
  419. bm->cur.block = bb;
  420. pfn -= bb->start_pfn;
  421. bm->cur.bit = pfn + 1;
  422. *bit_nr = pfn;
  423. *addr = bb->data;
  424. return 0;
  425. }
  426. static void memory_bm_set_bit(struct memory_bitmap *bm, unsigned long pfn)
  427. {
  428. void *addr;
  429. unsigned int bit;
  430. int error;
  431. error = memory_bm_find_bit(bm, pfn, &addr, &bit);
  432. BUG_ON(error);
  433. set_bit(bit, addr);
  434. }
  435. static int mem_bm_set_bit_check(struct memory_bitmap *bm, unsigned long pfn)
  436. {
  437. void *addr;
  438. unsigned int bit;
  439. int error;
  440. error = memory_bm_find_bit(bm, pfn, &addr, &bit);
  441. if (!error)
  442. set_bit(bit, addr);
  443. return error;
  444. }
  445. static void memory_bm_clear_bit(struct memory_bitmap *bm, unsigned long pfn)
  446. {
  447. void *addr;
  448. unsigned int bit;
  449. int error;
  450. error = memory_bm_find_bit(bm, pfn, &addr, &bit);
  451. BUG_ON(error);
  452. clear_bit(bit, addr);
  453. }
  454. static int memory_bm_test_bit(struct memory_bitmap *bm, unsigned long pfn)
  455. {
  456. void *addr;
  457. unsigned int bit;
  458. int error;
  459. error = memory_bm_find_bit(bm, pfn, &addr, &bit);
  460. BUG_ON(error);
  461. return test_bit(bit, addr);
  462. }
  463. static bool memory_bm_pfn_present(struct memory_bitmap *bm, unsigned long pfn)
  464. {
  465. void *addr;
  466. unsigned int bit;
  467. return !memory_bm_find_bit(bm, pfn, &addr, &bit);
  468. }
  469. /**
  470. * memory_bm_next_pfn - find the pfn that corresponds to the next set bit
  471. * in the bitmap @bm. If the pfn cannot be found, BM_END_OF_MAP is
  472. * returned.
  473. *
  474. * It is required to run memory_bm_position_reset() before the first call to
  475. * this function.
  476. */
  477. static unsigned long memory_bm_next_pfn(struct memory_bitmap *bm)
  478. {
  479. struct bm_block *bb;
  480. int bit;
  481. bb = bm->cur.block;
  482. do {
  483. bit = bm->cur.bit;
  484. bit = find_next_bit(bb->data, bm_block_bits(bb), bit);
  485. if (bit < bm_block_bits(bb))
  486. goto Return_pfn;
  487. bb = list_entry(bb->hook.next, struct bm_block, hook);
  488. bm->cur.block = bb;
  489. bm->cur.bit = 0;
  490. } while (&bb->hook != &bm->blocks);
  491. memory_bm_position_reset(bm);
  492. return BM_END_OF_MAP;
  493. Return_pfn:
  494. bm->cur.bit = bit + 1;
  495. return bb->start_pfn + bit;
  496. }
  497. /**
  498. * This structure represents a range of page frames the contents of which
  499. * should not be saved during the suspend.
  500. */
  501. struct nosave_region {
  502. struct list_head list;
  503. unsigned long start_pfn;
  504. unsigned long end_pfn;
  505. };
  506. static LIST_HEAD(nosave_regions);
  507. /**
  508. * register_nosave_region - register a range of page frames the contents
  509. * of which should not be saved during the suspend (to be used in the early
  510. * initialization code)
  511. */
  512. void __init
  513. __register_nosave_region(unsigned long start_pfn, unsigned long end_pfn,
  514. int use_kmalloc)
  515. {
  516. struct nosave_region *region;
  517. if (start_pfn >= end_pfn)
  518. return;
  519. if (!list_empty(&nosave_regions)) {
  520. /* Try to extend the previous region (they should be sorted) */
  521. region = list_entry(nosave_regions.prev,
  522. struct nosave_region, list);
  523. if (region->end_pfn == start_pfn) {
  524. region->end_pfn = end_pfn;
  525. goto Report;
  526. }
  527. }
  528. if (use_kmalloc) {
  529. /* during init, this shouldn't fail */
  530. region = kmalloc(sizeof(struct nosave_region), GFP_KERNEL);
  531. BUG_ON(!region);
  532. } else
  533. /* This allocation cannot fail */
  534. region = alloc_bootmem(sizeof(struct nosave_region));
  535. region->start_pfn = start_pfn;
  536. region->end_pfn = end_pfn;
  537. list_add_tail(&region->list, &nosave_regions);
  538. Report:
  539. printk(KERN_INFO "PM: Registered nosave memory: [mem %#010llx-%#010llx]\n",
  540. (unsigned long long) start_pfn << PAGE_SHIFT,
  541. ((unsigned long long) end_pfn << PAGE_SHIFT) - 1);
  542. }
  543. /*
  544. * Set bits in this map correspond to the page frames the contents of which
  545. * should not be saved during the suspend.
  546. */
  547. static struct memory_bitmap *forbidden_pages_map;
  548. /* Set bits in this map correspond to free page frames. */
  549. static struct memory_bitmap *free_pages_map;
  550. /*
  551. * Each page frame allocated for creating the image is marked by setting the
  552. * corresponding bits in forbidden_pages_map and free_pages_map simultaneously
  553. */
  554. void swsusp_set_page_free(struct page *page)
  555. {
  556. if (free_pages_map)
  557. memory_bm_set_bit(free_pages_map, page_to_pfn(page));
  558. }
  559. static int swsusp_page_is_free(struct page *page)
  560. {
  561. return free_pages_map ?
  562. memory_bm_test_bit(free_pages_map, page_to_pfn(page)) : 0;
  563. }
  564. void swsusp_unset_page_free(struct page *page)
  565. {
  566. if (free_pages_map)
  567. memory_bm_clear_bit(free_pages_map, page_to_pfn(page));
  568. }
  569. static void swsusp_set_page_forbidden(struct page *page)
  570. {
  571. if (forbidden_pages_map)
  572. memory_bm_set_bit(forbidden_pages_map, page_to_pfn(page));
  573. }
  574. int swsusp_page_is_forbidden(struct page *page)
  575. {
  576. return forbidden_pages_map ?
  577. memory_bm_test_bit(forbidden_pages_map, page_to_pfn(page)) : 0;
  578. }
  579. static void swsusp_unset_page_forbidden(struct page *page)
  580. {
  581. if (forbidden_pages_map)
  582. memory_bm_clear_bit(forbidden_pages_map, page_to_pfn(page));
  583. }
  584. /**
  585. * mark_nosave_pages - set bits corresponding to the page frames the
  586. * contents of which should not be saved in a given bitmap.
  587. */
  588. static void mark_nosave_pages(struct memory_bitmap *bm)
  589. {
  590. struct nosave_region *region;
  591. if (list_empty(&nosave_regions))
  592. return;
  593. list_for_each_entry(region, &nosave_regions, list) {
  594. unsigned long pfn;
  595. pr_debug("PM: Marking nosave pages: [mem %#010llx-%#010llx]\n",
  596. (unsigned long long) region->start_pfn << PAGE_SHIFT,
  597. ((unsigned long long) region->end_pfn << PAGE_SHIFT)
  598. - 1);
  599. for (pfn = region->start_pfn; pfn < region->end_pfn; pfn++)
  600. if (pfn_valid(pfn)) {
  601. /*
  602. * It is safe to ignore the result of
  603. * mem_bm_set_bit_check() here, since we won't
  604. * touch the PFNs for which the error is
  605. * returned anyway.
  606. */
  607. mem_bm_set_bit_check(bm, pfn);
  608. }
  609. }
  610. }
  611. /**
  612. * create_basic_memory_bitmaps - create bitmaps needed for marking page
  613. * frames that should not be saved and free page frames. The pointers
  614. * forbidden_pages_map and free_pages_map are only modified if everything
  615. * goes well, because we don't want the bits to be used before both bitmaps
  616. * are set up.
  617. */
  618. int create_basic_memory_bitmaps(void)
  619. {
  620. struct memory_bitmap *bm1, *bm2;
  621. int error = 0;
  622. BUG_ON(forbidden_pages_map || free_pages_map);
  623. bm1 = kzalloc(sizeof(struct memory_bitmap), GFP_KERNEL);
  624. if (!bm1)
  625. return -ENOMEM;
  626. error = memory_bm_create(bm1, GFP_KERNEL, PG_ANY);
  627. if (error)
  628. goto Free_first_object;
  629. bm2 = kzalloc(sizeof(struct memory_bitmap), GFP_KERNEL);
  630. if (!bm2)
  631. goto Free_first_bitmap;
  632. error = memory_bm_create(bm2, GFP_KERNEL, PG_ANY);
  633. if (error)
  634. goto Free_second_object;
  635. forbidden_pages_map = bm1;
  636. free_pages_map = bm2;
  637. mark_nosave_pages(forbidden_pages_map);
  638. pr_debug("PM: Basic memory bitmaps created\n");
  639. return 0;
  640. Free_second_object:
  641. kfree(bm2);
  642. Free_first_bitmap:
  643. memory_bm_free(bm1, PG_UNSAFE_CLEAR);
  644. Free_first_object:
  645. kfree(bm1);
  646. return -ENOMEM;
  647. }
  648. /**
  649. * free_basic_memory_bitmaps - free memory bitmaps allocated by
  650. * create_basic_memory_bitmaps(). The auxiliary pointers are necessary
  651. * so that the bitmaps themselves are not referred to while they are being
  652. * freed.
  653. */
  654. void free_basic_memory_bitmaps(void)
  655. {
  656. struct memory_bitmap *bm1, *bm2;
  657. BUG_ON(!(forbidden_pages_map && free_pages_map));
  658. bm1 = forbidden_pages_map;
  659. bm2 = free_pages_map;
  660. forbidden_pages_map = NULL;
  661. free_pages_map = NULL;
  662. memory_bm_free(bm1, PG_UNSAFE_CLEAR);
  663. kfree(bm1);
  664. memory_bm_free(bm2, PG_UNSAFE_CLEAR);
  665. kfree(bm2);
  666. pr_debug("PM: Basic memory bitmaps freed\n");
  667. }
  668. /**
  669. * snapshot_additional_pages - estimate the number of additional pages
  670. * be needed for setting up the suspend image data structures for given
  671. * zone (usually the returned value is greater than the exact number)
  672. */
  673. unsigned int snapshot_additional_pages(struct zone *zone)
  674. {
  675. unsigned int res;
  676. res = DIV_ROUND_UP(zone->spanned_pages, BM_BITS_PER_BLOCK);
  677. res += DIV_ROUND_UP(res * sizeof(struct bm_block),
  678. LINKED_PAGE_DATA_SIZE);
  679. return 2 * res;
  680. }
  681. #ifdef CONFIG_HIGHMEM
  682. /**
  683. * count_free_highmem_pages - compute the total number of free highmem
  684. * pages, system-wide.
  685. */
  686. static unsigned int count_free_highmem_pages(void)
  687. {
  688. struct zone *zone;
  689. unsigned int cnt = 0;
  690. for_each_populated_zone(zone)
  691. if (is_highmem(zone))
  692. cnt += zone_page_state(zone, NR_FREE_PAGES);
  693. return cnt;
  694. }
  695. /**
  696. * saveable_highmem_page - Determine whether a highmem page should be
  697. * included in the suspend image.
  698. *
  699. * We should save the page if it isn't Nosave or NosaveFree, or Reserved,
  700. * and it isn't a part of a free chunk of pages.
  701. */
  702. static struct page *saveable_highmem_page(struct zone *zone, unsigned long pfn)
  703. {
  704. struct page *page;
  705. if (!pfn_valid(pfn))
  706. return NULL;
  707. page = pfn_to_page(pfn);
  708. if (page_zone(page) != zone)
  709. return NULL;
  710. BUG_ON(!PageHighMem(page));
  711. if (swsusp_page_is_forbidden(page) || swsusp_page_is_free(page) ||
  712. PageReserved(page))
  713. return NULL;
  714. if (page_is_guard(page))
  715. return NULL;
  716. return page;
  717. }
  718. /**
  719. * count_highmem_pages - compute the total number of saveable highmem
  720. * pages.
  721. */
  722. static unsigned int count_highmem_pages(void)
  723. {
  724. struct zone *zone;
  725. unsigned int n = 0;
  726. for_each_populated_zone(zone) {
  727. unsigned long pfn, max_zone_pfn;
  728. if (!is_highmem(zone))
  729. continue;
  730. mark_free_pages(zone);
  731. max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
  732. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  733. if (saveable_highmem_page(zone, pfn))
  734. n++;
  735. }
  736. return n;
  737. }
  738. #else
  739. static inline void *saveable_highmem_page(struct zone *z, unsigned long p)
  740. {
  741. return NULL;
  742. }
  743. #endif /* CONFIG_HIGHMEM */
  744. /**
  745. * saveable_page - Determine whether a non-highmem page should be included
  746. * in the suspend image.
  747. *
  748. * We should save the page if it isn't Nosave, and is not in the range
  749. * of pages statically defined as 'unsaveable', and it isn't a part of
  750. * a free chunk of pages.
  751. */
  752. static struct page *saveable_page(struct zone *zone, unsigned long pfn)
  753. {
  754. struct page *page;
  755. if (!pfn_valid(pfn))
  756. return NULL;
  757. page = pfn_to_page(pfn);
  758. if (page_zone(page) != zone)
  759. return NULL;
  760. BUG_ON(PageHighMem(page));
  761. if (swsusp_page_is_forbidden(page) || swsusp_page_is_free(page))
  762. return NULL;
  763. if (PageReserved(page)
  764. && (!kernel_page_present(page) || pfn_is_nosave(pfn)))
  765. return NULL;
  766. if (page_is_guard(page))
  767. return NULL;
  768. return page;
  769. }
  770. /**
  771. * count_data_pages - compute the total number of saveable non-highmem
  772. * pages.
  773. */
  774. static unsigned int count_data_pages(void)
  775. {
  776. struct zone *zone;
  777. unsigned long pfn, max_zone_pfn;
  778. unsigned int n = 0;
  779. for_each_populated_zone(zone) {
  780. if (is_highmem(zone))
  781. continue;
  782. mark_free_pages(zone);
  783. max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
  784. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  785. if (saveable_page(zone, pfn))
  786. n++;
  787. }
  788. return n;
  789. }
  790. /* This is needed, because copy_page and memcpy are not usable for copying
  791. * task structs.
  792. */
  793. static inline void do_copy_page(long *dst, long *src)
  794. {
  795. int n;
  796. for (n = PAGE_SIZE / sizeof(long); n; n--)
  797. *dst++ = *src++;
  798. }
  799. /**
  800. * safe_copy_page - check if the page we are going to copy is marked as
  801. * present in the kernel page tables (this always is the case if
  802. * CONFIG_DEBUG_PAGEALLOC is not set and in that case
  803. * kernel_page_present() always returns 'true').
  804. */
  805. static void safe_copy_page(void *dst, struct page *s_page)
  806. {
  807. if (kernel_page_present(s_page)) {
  808. do_copy_page(dst, page_address(s_page));
  809. } else {
  810. kernel_map_pages(s_page, 1, 1);
  811. do_copy_page(dst, page_address(s_page));
  812. kernel_map_pages(s_page, 1, 0);
  813. }
  814. }
  815. #ifdef CONFIG_HIGHMEM
  816. static inline struct page *
  817. page_is_saveable(struct zone *zone, unsigned long pfn)
  818. {
  819. return is_highmem(zone) ?
  820. saveable_highmem_page(zone, pfn) : saveable_page(zone, pfn);
  821. }
  822. static void copy_data_page(unsigned long dst_pfn, unsigned long src_pfn)
  823. {
  824. struct page *s_page, *d_page;
  825. void *src, *dst;
  826. s_page = pfn_to_page(src_pfn);
  827. d_page = pfn_to_page(dst_pfn);
  828. if (PageHighMem(s_page)) {
  829. src = kmap_atomic(s_page);
  830. dst = kmap_atomic(d_page);
  831. do_copy_page(dst, src);
  832. kunmap_atomic(dst);
  833. kunmap_atomic(src);
  834. } else {
  835. if (PageHighMem(d_page)) {
  836. /* Page pointed to by src may contain some kernel
  837. * data modified by kmap_atomic()
  838. */
  839. safe_copy_page(buffer, s_page);
  840. dst = kmap_atomic(d_page);
  841. copy_page(dst, buffer);
  842. kunmap_atomic(dst);
  843. } else {
  844. safe_copy_page(page_address(d_page), s_page);
  845. }
  846. }
  847. }
  848. #else
  849. #define page_is_saveable(zone, pfn) saveable_page(zone, pfn)
  850. static inline void copy_data_page(unsigned long dst_pfn, unsigned long src_pfn)
  851. {
  852. safe_copy_page(page_address(pfn_to_page(dst_pfn)),
  853. pfn_to_page(src_pfn));
  854. }
  855. #endif /* CONFIG_HIGHMEM */
  856. static void
  857. copy_data_pages(struct memory_bitmap *copy_bm, struct memory_bitmap *orig_bm)
  858. {
  859. struct zone *zone;
  860. unsigned long pfn;
  861. for_each_populated_zone(zone) {
  862. unsigned long max_zone_pfn;
  863. mark_free_pages(zone);
  864. max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
  865. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  866. if (page_is_saveable(zone, pfn))
  867. memory_bm_set_bit(orig_bm, pfn);
  868. }
  869. memory_bm_position_reset(orig_bm);
  870. memory_bm_position_reset(copy_bm);
  871. for(;;) {
  872. pfn = memory_bm_next_pfn(orig_bm);
  873. if (unlikely(pfn == BM_END_OF_MAP))
  874. break;
  875. copy_data_page(memory_bm_next_pfn(copy_bm), pfn);
  876. }
  877. }
  878. /* Total number of image pages */
  879. static unsigned int nr_copy_pages;
  880. /* Number of pages needed for saving the original pfns of the image pages */
  881. static unsigned int nr_meta_pages;
  882. /*
  883. * Numbers of normal and highmem page frames allocated for hibernation image
  884. * before suspending devices.
  885. */
  886. unsigned int alloc_normal, alloc_highmem;
  887. /*
  888. * Memory bitmap used for marking saveable pages (during hibernation) or
  889. * hibernation image pages (during restore)
  890. */
  891. static struct memory_bitmap orig_bm;
  892. /*
  893. * Memory bitmap used during hibernation for marking allocated page frames that
  894. * will contain copies of saveable pages. During restore it is initially used
  895. * for marking hibernation image pages, but then the set bits from it are
  896. * duplicated in @orig_bm and it is released. On highmem systems it is next
  897. * used for marking "safe" highmem pages, but it has to be reinitialized for
  898. * this purpose.
  899. */
  900. static struct memory_bitmap copy_bm;
  901. /**
  902. * swsusp_free - free pages allocated for the suspend.
  903. *
  904. * Suspend pages are alocated before the atomic copy is made, so we
  905. * need to release them after the resume.
  906. */
  907. void swsusp_free(void)
  908. {
  909. struct zone *zone;
  910. unsigned long pfn, max_zone_pfn;
  911. for_each_populated_zone(zone) {
  912. max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
  913. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  914. if (pfn_valid(pfn)) {
  915. struct page *page = pfn_to_page(pfn);
  916. if (swsusp_page_is_forbidden(page) &&
  917. swsusp_page_is_free(page)) {
  918. swsusp_unset_page_forbidden(page);
  919. swsusp_unset_page_free(page);
  920. __free_page(page);
  921. }
  922. }
  923. }
  924. nr_copy_pages = 0;
  925. nr_meta_pages = 0;
  926. restore_pblist = NULL;
  927. buffer = NULL;
  928. alloc_normal = 0;
  929. alloc_highmem = 0;
  930. }
  931. /* Helper functions used for the shrinking of memory. */
  932. #define GFP_IMAGE (GFP_KERNEL | __GFP_NOWARN)
  933. /**
  934. * preallocate_image_pages - Allocate a number of pages for hibernation image
  935. * @nr_pages: Number of page frames to allocate.
  936. * @mask: GFP flags to use for the allocation.
  937. *
  938. * Return value: Number of page frames actually allocated
  939. */
  940. static unsigned long preallocate_image_pages(unsigned long nr_pages, gfp_t mask)
  941. {
  942. unsigned long nr_alloc = 0;
  943. while (nr_pages > 0) {
  944. struct page *page;
  945. page = alloc_image_page(mask);
  946. if (!page)
  947. break;
  948. memory_bm_set_bit(&copy_bm, page_to_pfn(page));
  949. if (PageHighMem(page))
  950. alloc_highmem++;
  951. else
  952. alloc_normal++;
  953. nr_pages--;
  954. nr_alloc++;
  955. }
  956. return nr_alloc;
  957. }
  958. static unsigned long preallocate_image_memory(unsigned long nr_pages,
  959. unsigned long avail_normal)
  960. {
  961. unsigned long alloc;
  962. if (avail_normal <= alloc_normal)
  963. return 0;
  964. alloc = avail_normal - alloc_normal;
  965. if (nr_pages < alloc)
  966. alloc = nr_pages;
  967. return preallocate_image_pages(alloc, GFP_IMAGE);
  968. }
  969. #ifdef CONFIG_HIGHMEM
  970. static unsigned long preallocate_image_highmem(unsigned long nr_pages)
  971. {
  972. return preallocate_image_pages(nr_pages, GFP_IMAGE | __GFP_HIGHMEM);
  973. }
  974. /**
  975. * __fraction - Compute (an approximation of) x * (multiplier / base)
  976. */
  977. static unsigned long __fraction(u64 x, u64 multiplier, u64 base)
  978. {
  979. x *= multiplier;
  980. do_div(x, base);
  981. return (unsigned long)x;
  982. }
  983. static unsigned long preallocate_highmem_fraction(unsigned long nr_pages,
  984. unsigned long highmem,
  985. unsigned long total)
  986. {
  987. unsigned long alloc = __fraction(nr_pages, highmem, total);
  988. return preallocate_image_pages(alloc, GFP_IMAGE | __GFP_HIGHMEM);
  989. }
  990. #else /* CONFIG_HIGHMEM */
  991. static inline unsigned long preallocate_image_highmem(unsigned long nr_pages)
  992. {
  993. return 0;
  994. }
  995. static inline unsigned long preallocate_highmem_fraction(unsigned long nr_pages,
  996. unsigned long highmem,
  997. unsigned long total)
  998. {
  999. return 0;
  1000. }
  1001. #endif /* CONFIG_HIGHMEM */
  1002. /**
  1003. * free_unnecessary_pages - Release preallocated pages not needed for the image
  1004. */
  1005. static void free_unnecessary_pages(void)
  1006. {
  1007. unsigned long save, to_free_normal, to_free_highmem;
  1008. save = count_data_pages();
  1009. if (alloc_normal >= save) {
  1010. to_free_normal = alloc_normal - save;
  1011. save = 0;
  1012. } else {
  1013. to_free_normal = 0;
  1014. save -= alloc_normal;
  1015. }
  1016. save += count_highmem_pages();
  1017. if (alloc_highmem >= save) {
  1018. to_free_highmem = alloc_highmem - save;
  1019. } else {
  1020. to_free_highmem = 0;
  1021. save -= alloc_highmem;
  1022. if (to_free_normal > save)
  1023. to_free_normal -= save;
  1024. else
  1025. to_free_normal = 0;
  1026. }
  1027. memory_bm_position_reset(&copy_bm);
  1028. while (to_free_normal > 0 || to_free_highmem > 0) {
  1029. unsigned long pfn = memory_bm_next_pfn(&copy_bm);
  1030. struct page *page = pfn_to_page(pfn);
  1031. if (PageHighMem(page)) {
  1032. if (!to_free_highmem)
  1033. continue;
  1034. to_free_highmem--;
  1035. alloc_highmem--;
  1036. } else {
  1037. if (!to_free_normal)
  1038. continue;
  1039. to_free_normal--;
  1040. alloc_normal--;
  1041. }
  1042. memory_bm_clear_bit(&copy_bm, pfn);
  1043. swsusp_unset_page_forbidden(page);
  1044. swsusp_unset_page_free(page);
  1045. __free_page(page);
  1046. }
  1047. }
  1048. /**
  1049. * minimum_image_size - Estimate the minimum acceptable size of an image
  1050. * @saveable: Number of saveable pages in the system.
  1051. *
  1052. * We want to avoid attempting to free too much memory too hard, so estimate the
  1053. * minimum acceptable size of a hibernation image to use as the lower limit for
  1054. * preallocating memory.
  1055. *
  1056. * We assume that the minimum image size should be proportional to
  1057. *
  1058. * [number of saveable pages] - [number of pages that can be freed in theory]
  1059. *
  1060. * where the second term is the sum of (1) reclaimable slab pages, (2) active
  1061. * and (3) inactive anonymouns pages, (4) active and (5) inactive file pages,
  1062. * minus mapped file pages.
  1063. */
  1064. static unsigned long minimum_image_size(unsigned long saveable)
  1065. {
  1066. unsigned long size;
  1067. size = global_page_state(NR_SLAB_RECLAIMABLE)
  1068. + global_page_state(NR_ACTIVE_ANON)
  1069. + global_page_state(NR_INACTIVE_ANON)
  1070. + global_page_state(NR_ACTIVE_FILE)
  1071. + global_page_state(NR_INACTIVE_FILE)
  1072. - global_page_state(NR_FILE_MAPPED);
  1073. return saveable <= size ? 0 : saveable - size;
  1074. }
  1075. /**
  1076. * hibernate_preallocate_memory - Preallocate memory for hibernation image
  1077. *
  1078. * To create a hibernation image it is necessary to make a copy of every page
  1079. * frame in use. We also need a number of page frames to be free during
  1080. * hibernation for allocations made while saving the image and for device
  1081. * drivers, in case they need to allocate memory from their hibernation
  1082. * callbacks (these two numbers are given by PAGES_FOR_IO (which is a rough
  1083. * estimate) and reserverd_size divided by PAGE_SIZE (which is tunable through
  1084. * /sys/power/reserved_size, respectively). To make this happen, we compute the
  1085. * total number of available page frames and allocate at least
  1086. *
  1087. * ([page frames total] + PAGES_FOR_IO + [metadata pages]) / 2
  1088. * + 2 * DIV_ROUND_UP(reserved_size, PAGE_SIZE)
  1089. *
  1090. * of them, which corresponds to the maximum size of a hibernation image.
  1091. *
  1092. * If image_size is set below the number following from the above formula,
  1093. * the preallocation of memory is continued until the total number of saveable
  1094. * pages in the system is below the requested image size or the minimum
  1095. * acceptable image size returned by minimum_image_size(), whichever is greater.
  1096. */
  1097. int hibernate_preallocate_memory(void)
  1098. {
  1099. struct zone *zone;
  1100. unsigned long saveable, size, max_size, count, highmem, pages = 0;
  1101. unsigned long alloc, save_highmem, pages_highmem, avail_normal;
  1102. struct timeval start, stop;
  1103. int error;
  1104. printk(KERN_INFO "PM: Preallocating image memory... ");
  1105. do_gettimeofday(&start);
  1106. error = memory_bm_create(&orig_bm, GFP_IMAGE, PG_ANY);
  1107. if (error)
  1108. goto err_out;
  1109. error = memory_bm_create(&copy_bm, GFP_IMAGE, PG_ANY);
  1110. if (error)
  1111. goto err_out;
  1112. alloc_normal = 0;
  1113. alloc_highmem = 0;
  1114. /* Count the number of saveable data pages. */
  1115. save_highmem = count_highmem_pages();
  1116. saveable = count_data_pages();
  1117. /*
  1118. * Compute the total number of page frames we can use (count) and the
  1119. * number of pages needed for image metadata (size).
  1120. */
  1121. count = saveable;
  1122. saveable += save_highmem;
  1123. highmem = save_highmem;
  1124. size = 0;
  1125. for_each_populated_zone(zone) {
  1126. size += snapshot_additional_pages(zone);
  1127. if (is_highmem(zone))
  1128. highmem += zone_page_state(zone, NR_FREE_PAGES);
  1129. else
  1130. count += zone_page_state(zone, NR_FREE_PAGES);
  1131. }
  1132. avail_normal = count;
  1133. count += highmem;
  1134. count -= totalreserve_pages;
  1135. /* Add number of pages required for page keys (s390 only). */
  1136. size += page_key_additional_pages(saveable);
  1137. /* Compute the maximum number of saveable pages to leave in memory. */
  1138. max_size = (count - (size + PAGES_FOR_IO)) / 2
  1139. - 2 * DIV_ROUND_UP(reserved_size, PAGE_SIZE);
  1140. /* Compute the desired number of image pages specified by image_size. */
  1141. size = DIV_ROUND_UP(image_size, PAGE_SIZE);
  1142. if (size > max_size)
  1143. size = max_size;
  1144. /*
  1145. * If the desired number of image pages is at least as large as the
  1146. * current number of saveable pages in memory, allocate page frames for
  1147. * the image and we're done.
  1148. */
  1149. if (size >= saveable) {
  1150. pages = preallocate_image_highmem(save_highmem);
  1151. pages += preallocate_image_memory(saveable - pages, avail_normal);
  1152. goto out;
  1153. }
  1154. /* Estimate the minimum size of the image. */
  1155. pages = minimum_image_size(saveable);
  1156. /*
  1157. * To avoid excessive pressure on the normal zone, leave room in it to
  1158. * accommodate an image of the minimum size (unless it's already too
  1159. * small, in which case don't preallocate pages from it at all).
  1160. */
  1161. if (avail_normal > pages)
  1162. avail_normal -= pages;
  1163. else
  1164. avail_normal = 0;
  1165. if (size < pages)
  1166. size = min_t(unsigned long, pages, max_size);
  1167. /*
  1168. * Let the memory management subsystem know that we're going to need a
  1169. * large number of page frames to allocate and make it free some memory.
  1170. * NOTE: If this is not done, performance will be hurt badly in some
  1171. * test cases.
  1172. */
  1173. shrink_all_memory(saveable - size);
  1174. /*
  1175. * The number of saveable pages in memory was too high, so apply some
  1176. * pressure to decrease it. First, make room for the largest possible
  1177. * image and fail if that doesn't work. Next, try to decrease the size
  1178. * of the image as much as indicated by 'size' using allocations from
  1179. * highmem and non-highmem zones separately.
  1180. */
  1181. pages_highmem = preallocate_image_highmem(highmem / 2);
  1182. alloc = (count - max_size) - pages_highmem;
  1183. pages = preallocate_image_memory(alloc, avail_normal);
  1184. if (pages < alloc) {
  1185. /* We have exhausted non-highmem pages, try highmem. */
  1186. alloc -= pages;
  1187. pages += pages_highmem;
  1188. pages_highmem = preallocate_image_highmem(alloc);
  1189. if (pages_highmem < alloc)
  1190. goto err_out;
  1191. pages += pages_highmem;
  1192. /*
  1193. * size is the desired number of saveable pages to leave in
  1194. * memory, so try to preallocate (all memory - size) pages.
  1195. */
  1196. alloc = (count - pages) - size;
  1197. pages += preallocate_image_highmem(alloc);
  1198. } else {
  1199. /*
  1200. * There are approximately max_size saveable pages at this point
  1201. * and we want to reduce this number down to size.
  1202. */
  1203. alloc = max_size - size;
  1204. size = preallocate_highmem_fraction(alloc, highmem, count);
  1205. pages_highmem += size;
  1206. alloc -= size;
  1207. size = preallocate_image_memory(alloc, avail_normal);
  1208. pages_highmem += preallocate_image_highmem(alloc - size);
  1209. pages += pages_highmem + size;
  1210. }
  1211. /*
  1212. * We only need as many page frames for the image as there are saveable
  1213. * pages in memory, but we have allocated more. Release the excessive
  1214. * ones now.
  1215. */
  1216. free_unnecessary_pages();
  1217. out:
  1218. do_gettimeofday(&stop);
  1219. printk(KERN_CONT "done (allocated %lu pages)\n", pages);
  1220. swsusp_show_speed(&start, &stop, pages, "Allocated");
  1221. return 0;
  1222. err_out:
  1223. printk(KERN_CONT "\n");
  1224. swsusp_free();
  1225. return -ENOMEM;
  1226. }
  1227. #ifdef CONFIG_HIGHMEM
  1228. /**
  1229. * count_pages_for_highmem - compute the number of non-highmem pages
  1230. * that will be necessary for creating copies of highmem pages.
  1231. */
  1232. static unsigned int count_pages_for_highmem(unsigned int nr_highmem)
  1233. {
  1234. unsigned int free_highmem = count_free_highmem_pages() + alloc_highmem;
  1235. if (free_highmem >= nr_highmem)
  1236. nr_highmem = 0;
  1237. else
  1238. nr_highmem -= free_highmem;
  1239. return nr_highmem;
  1240. }
  1241. #else
  1242. static unsigned int
  1243. count_pages_for_highmem(unsigned int nr_highmem) { return 0; }
  1244. #endif /* CONFIG_HIGHMEM */
  1245. /**
  1246. * enough_free_mem - Make sure we have enough free memory for the
  1247. * snapshot image.
  1248. */
  1249. static int enough_free_mem(unsigned int nr_pages, unsigned int nr_highmem)
  1250. {
  1251. struct zone *zone;
  1252. unsigned int free = alloc_normal;
  1253. for_each_populated_zone(zone)
  1254. if (!is_highmem(zone))
  1255. free += zone_page_state(zone, NR_FREE_PAGES);
  1256. nr_pages += count_pages_for_highmem(nr_highmem);
  1257. pr_debug("PM: Normal pages needed: %u + %u, available pages: %u\n",
  1258. nr_pages, PAGES_FOR_IO, free);
  1259. return free > nr_pages + PAGES_FOR_IO;
  1260. }
  1261. #ifdef CONFIG_HIGHMEM
  1262. /**
  1263. * get_highmem_buffer - if there are some highmem pages in the suspend
  1264. * image, we may need the buffer to copy them and/or load their data.
  1265. */
  1266. static inline int get_highmem_buffer(int safe_needed)
  1267. {
  1268. buffer = get_image_page(GFP_ATOMIC | __GFP_COLD, safe_needed);
  1269. return buffer ? 0 : -ENOMEM;
  1270. }
  1271. /**
  1272. * alloc_highmem_image_pages - allocate some highmem pages for the image.
  1273. * Try to allocate as many pages as needed, but if the number of free
  1274. * highmem pages is lesser than that, allocate them all.
  1275. */
  1276. static inline unsigned int
  1277. alloc_highmem_pages(struct memory_bitmap *bm, unsigned int nr_highmem)
  1278. {
  1279. unsigned int to_alloc = count_free_highmem_pages();
  1280. if (to_alloc > nr_highmem)
  1281. to_alloc = nr_highmem;
  1282. nr_highmem -= to_alloc;
  1283. while (to_alloc-- > 0) {
  1284. struct page *page;
  1285. page = alloc_image_page(__GFP_HIGHMEM);
  1286. memory_bm_set_bit(bm, page_to_pfn(page));
  1287. }
  1288. return nr_highmem;
  1289. }
  1290. #else
  1291. static inline int get_highmem_buffer(int safe_needed) { return 0; }
  1292. static inline unsigned int
  1293. alloc_highmem_pages(struct memory_bitmap *bm, unsigned int n) { return 0; }
  1294. #endif /* CONFIG_HIGHMEM */
  1295. /**
  1296. * swsusp_alloc - allocate memory for the suspend image
  1297. *
  1298. * We first try to allocate as many highmem pages as there are
  1299. * saveable highmem pages in the system. If that fails, we allocate
  1300. * non-highmem pages for the copies of the remaining highmem ones.
  1301. *
  1302. * In this approach it is likely that the copies of highmem pages will
  1303. * also be located in the high memory, because of the way in which
  1304. * copy_data_pages() works.
  1305. */
  1306. static int
  1307. swsusp_alloc(struct memory_bitmap *orig_bm, struct memory_bitmap *copy_bm,
  1308. unsigned int nr_pages, unsigned int nr_highmem)
  1309. {
  1310. if (nr_highmem > 0) {
  1311. if (get_highmem_buffer(PG_ANY))
  1312. goto err_out;
  1313. if (nr_highmem > alloc_highmem) {
  1314. nr_highmem -= alloc_highmem;
  1315. nr_pages += alloc_highmem_pages(copy_bm, nr_highmem);
  1316. }
  1317. }
  1318. if (nr_pages > alloc_normal) {
  1319. nr_pages -= alloc_normal;
  1320. while (nr_pages-- > 0) {
  1321. struct page *page;
  1322. page = alloc_image_page(GFP_ATOMIC | __GFP_COLD);
  1323. if (!page)
  1324. goto err_out;
  1325. memory_bm_set_bit(copy_bm, page_to_pfn(page));
  1326. }
  1327. }
  1328. return 0;
  1329. err_out:
  1330. swsusp_free();
  1331. return -ENOMEM;
  1332. }
  1333. asmlinkage int swsusp_save(void)
  1334. {
  1335. unsigned int nr_pages, nr_highmem;
  1336. printk(KERN_INFO "PM: Creating hibernation image:\n");
  1337. drain_local_pages(NULL);
  1338. nr_pages = count_data_pages();
  1339. nr_highmem = count_highmem_pages();
  1340. printk(KERN_INFO "PM: Need to copy %u pages\n", nr_pages + nr_highmem);
  1341. if (!enough_free_mem(nr_pages, nr_highmem)) {
  1342. printk(KERN_ERR "PM: Not enough free memory\n");
  1343. return -ENOMEM;
  1344. }
  1345. if (swsusp_alloc(&orig_bm, &copy_bm, nr_pages, nr_highmem)) {
  1346. printk(KERN_ERR "PM: Memory allocation failed\n");
  1347. return -ENOMEM;
  1348. }
  1349. /* During allocating of suspend pagedir, new cold pages may appear.
  1350. * Kill them.
  1351. */
  1352. drain_local_pages(NULL);
  1353. copy_data_pages(&copy_bm, &orig_bm);
  1354. /*
  1355. * End of critical section. From now on, we can write to memory,
  1356. * but we should not touch disk. This specially means we must _not_
  1357. * touch swap space! Except we must write out our image of course.
  1358. */
  1359. nr_pages += nr_highmem;
  1360. nr_copy_pages = nr_pages;
  1361. nr_meta_pages = DIV_ROUND_UP(nr_pages * sizeof(long), PAGE_SIZE);
  1362. printk(KERN_INFO "PM: Hibernation image created (%d pages copied)\n",
  1363. nr_pages);
  1364. return 0;
  1365. }
  1366. #ifndef CONFIG_ARCH_HIBERNATION_HEADER
  1367. static int init_header_complete(struct swsusp_info *info)
  1368. {
  1369. memcpy(&info->uts, init_utsname(), sizeof(struct new_utsname));
  1370. info->version_code = LINUX_VERSION_CODE;
  1371. return 0;
  1372. }
  1373. static char *check_image_kernel(struct swsusp_info *info)
  1374. {
  1375. if (info->version_code != LINUX_VERSION_CODE)
  1376. return "kernel version";
  1377. if (strcmp(info->uts.sysname,init_utsname()->sysname))
  1378. return "system type";
  1379. if (strcmp(info->uts.release,init_utsname()->release))
  1380. return "kernel release";
  1381. if (strcmp(info->uts.version,init_utsname()->version))
  1382. return "version";
  1383. if (strcmp(info->uts.machine,init_utsname()->machine))
  1384. return "machine";
  1385. return NULL;
  1386. }
  1387. #endif /* CONFIG_ARCH_HIBERNATION_HEADER */
  1388. unsigned long snapshot_get_image_size(void)
  1389. {
  1390. return nr_copy_pages + nr_meta_pages + 1;
  1391. }
  1392. static int init_header(struct swsusp_info *info)
  1393. {
  1394. memset(info, 0, sizeof(struct swsusp_info));
  1395. info->num_physpages = get_num_physpages();
  1396. info->image_pages = nr_copy_pages;
  1397. info->pages = snapshot_get_image_size();
  1398. info->size = info->pages;
  1399. info->size <<= PAGE_SHIFT;
  1400. return init_header_complete(info);
  1401. }
  1402. /**
  1403. * pack_pfns - pfns corresponding to the set bits found in the bitmap @bm
  1404. * are stored in the array @buf[] (1 page at a time)
  1405. */
  1406. static inline void
  1407. pack_pfns(unsigned long *buf, struct memory_bitmap *bm)
  1408. {
  1409. int j;
  1410. for (j = 0; j < PAGE_SIZE / sizeof(long); j++) {
  1411. buf[j] = memory_bm_next_pfn(bm);
  1412. if (unlikely(buf[j] == BM_END_OF_MAP))
  1413. break;
  1414. /* Save page key for data page (s390 only). */
  1415. page_key_read(buf + j);
  1416. }
  1417. }
  1418. /**
  1419. * snapshot_read_next - used for reading the system memory snapshot.
  1420. *
  1421. * On the first call to it @handle should point to a zeroed
  1422. * snapshot_handle structure. The structure gets updated and a pointer
  1423. * to it should be passed to this function every next time.
  1424. *
  1425. * On success the function returns a positive number. Then, the caller
  1426. * is allowed to read up to the returned number of bytes from the memory
  1427. * location computed by the data_of() macro.
  1428. *
  1429. * The function returns 0 to indicate the end of data stream condition,
  1430. * and a negative number is returned on error. In such cases the
  1431. * structure pointed to by @handle is not updated and should not be used
  1432. * any more.
  1433. */
  1434. int snapshot_read_next(struct snapshot_handle *handle)
  1435. {
  1436. if (handle->cur > nr_meta_pages + nr_copy_pages)
  1437. return 0;
  1438. if (!buffer) {
  1439. /* This makes the buffer be freed by swsusp_free() */
  1440. buffer = get_image_page(GFP_ATOMIC, PG_ANY);
  1441. if (!buffer)
  1442. return -ENOMEM;
  1443. }
  1444. if (!handle->cur) {
  1445. int error;
  1446. error = init_header((struct swsusp_info *)buffer);
  1447. if (error)
  1448. return error;
  1449. handle->buffer = buffer;
  1450. memory_bm_position_reset(&orig_bm);
  1451. memory_bm_position_reset(&copy_bm);
  1452. } else if (handle->cur <= nr_meta_pages) {
  1453. clear_page(buffer);
  1454. pack_pfns(buffer, &orig_bm);
  1455. } else {
  1456. struct page *page;
  1457. page = pfn_to_page(memory_bm_next_pfn(&copy_bm));
  1458. if (PageHighMem(page)) {
  1459. /* Highmem pages are copied to the buffer,
  1460. * because we can't return with a kmapped
  1461. * highmem page (we may not be called again).
  1462. */
  1463. void *kaddr;
  1464. kaddr = kmap_atomic(page);
  1465. copy_page(buffer, kaddr);
  1466. kunmap_atomic(kaddr);
  1467. handle->buffer = buffer;
  1468. } else {
  1469. handle->buffer = page_address(page);
  1470. }
  1471. }
  1472. handle->cur++;
  1473. return PAGE_SIZE;
  1474. }
  1475. /**
  1476. * mark_unsafe_pages - mark the pages that cannot be used for storing
  1477. * the image during resume, because they conflict with the pages that
  1478. * had been used before suspend
  1479. */
  1480. static int mark_unsafe_pages(struct memory_bitmap *bm)
  1481. {
  1482. struct zone *zone;
  1483. unsigned long pfn, max_zone_pfn;
  1484. /* Clear page flags */
  1485. for_each_populated_zone(zone) {
  1486. max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages;
  1487. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  1488. if (pfn_valid(pfn))
  1489. swsusp_unset_page_free(pfn_to_page(pfn));
  1490. }
  1491. /* Mark pages that correspond to the "original" pfns as "unsafe" */
  1492. memory_bm_position_reset(bm);
  1493. do {
  1494. pfn = memory_bm_next_pfn(bm);
  1495. if (likely(pfn != BM_END_OF_MAP)) {
  1496. if (likely(pfn_valid(pfn)))
  1497. swsusp_set_page_free(pfn_to_page(pfn));
  1498. else
  1499. return -EFAULT;
  1500. }
  1501. } while (pfn != BM_END_OF_MAP);
  1502. allocated_unsafe_pages = 0;
  1503. return 0;
  1504. }
  1505. static void
  1506. duplicate_memory_bitmap(struct memory_bitmap *dst, struct memory_bitmap *src)
  1507. {
  1508. unsigned long pfn;
  1509. memory_bm_position_reset(src);
  1510. pfn = memory_bm_next_pfn(src);
  1511. while (pfn != BM_END_OF_MAP) {
  1512. memory_bm_set_bit(dst, pfn);
  1513. pfn = memory_bm_next_pfn(src);
  1514. }
  1515. }
  1516. static int check_header(struct swsusp_info *info)
  1517. {
  1518. char *reason;
  1519. reason = check_image_kernel(info);
  1520. if (!reason && info->num_physpages != get_num_physpages())
  1521. reason = "memory size";
  1522. if (reason) {
  1523. printk(KERN_ERR "PM: Image mismatch: %s\n", reason);
  1524. return -EPERM;
  1525. }
  1526. return 0;
  1527. }
  1528. /**
  1529. * load header - check the image header and copy data from it
  1530. */
  1531. static int
  1532. load_header(struct swsusp_info *info)
  1533. {
  1534. int error;
  1535. restore_pblist = NULL;
  1536. error = check_header(info);
  1537. if (!error) {
  1538. nr_copy_pages = info->image_pages;
  1539. nr_meta_pages = info->pages - info->image_pages - 1;
  1540. }
  1541. return error;
  1542. }
  1543. /**
  1544. * unpack_orig_pfns - for each element of @buf[] (1 page at a time) set
  1545. * the corresponding bit in the memory bitmap @bm
  1546. */
  1547. static int unpack_orig_pfns(unsigned long *buf, struct memory_bitmap *bm)
  1548. {
  1549. int j;
  1550. for (j = 0; j < PAGE_SIZE / sizeof(long); j++) {
  1551. if (unlikely(buf[j] == BM_END_OF_MAP))
  1552. break;
  1553. /* Extract and buffer page key for data page (s390 only). */
  1554. page_key_memorize(buf + j);
  1555. if (memory_bm_pfn_present(bm, buf[j]))
  1556. memory_bm_set_bit(bm, buf[j]);
  1557. else
  1558. return -EFAULT;
  1559. }
  1560. return 0;
  1561. }
  1562. /* List of "safe" pages that may be used to store data loaded from the suspend
  1563. * image
  1564. */
  1565. static struct linked_page *safe_pages_list;
  1566. #ifdef CONFIG_HIGHMEM
  1567. /* struct highmem_pbe is used for creating the list of highmem pages that
  1568. * should be restored atomically during the resume from disk, because the page
  1569. * frames they have occupied before the suspend are in use.
  1570. */
  1571. struct highmem_pbe {
  1572. struct page *copy_page; /* data is here now */
  1573. struct page *orig_page; /* data was here before the suspend */
  1574. struct highmem_pbe *next;
  1575. };
  1576. /* List of highmem PBEs needed for restoring the highmem pages that were
  1577. * allocated before the suspend and included in the suspend image, but have
  1578. * also been allocated by the "resume" kernel, so their contents cannot be
  1579. * written directly to their "original" page frames.
  1580. */
  1581. static struct highmem_pbe *highmem_pblist;
  1582. /**
  1583. * count_highmem_image_pages - compute the number of highmem pages in the
  1584. * suspend image. The bits in the memory bitmap @bm that correspond to the
  1585. * image pages are assumed to be set.
  1586. */
  1587. static unsigned int count_highmem_image_pages(struct memory_bitmap *bm)
  1588. {
  1589. unsigned long pfn;
  1590. unsigned int cnt = 0;
  1591. memory_bm_position_reset(bm);
  1592. pfn = memory_bm_next_pfn(bm);
  1593. while (pfn != BM_END_OF_MAP) {
  1594. if (PageHighMem(pfn_to_page(pfn)))
  1595. cnt++;
  1596. pfn = memory_bm_next_pfn(bm);
  1597. }
  1598. return cnt;
  1599. }
  1600. /**
  1601. * prepare_highmem_image - try to allocate as many highmem pages as
  1602. * there are highmem image pages (@nr_highmem_p points to the variable
  1603. * containing the number of highmem image pages). The pages that are
  1604. * "safe" (ie. will not be overwritten when the suspend image is
  1605. * restored) have the corresponding bits set in @bm (it must be
  1606. * unitialized).
  1607. *
  1608. * NOTE: This function should not be called if there are no highmem
  1609. * image pages.
  1610. */
  1611. static unsigned int safe_highmem_pages;
  1612. static struct memory_bitmap *safe_highmem_bm;
  1613. static int
  1614. prepare_highmem_image(struct memory_bitmap *bm, unsigned int *nr_highmem_p)
  1615. {
  1616. unsigned int to_alloc;
  1617. if (memory_bm_create(bm, GFP_ATOMIC, PG_SAFE))
  1618. return -ENOMEM;
  1619. if (get_highmem_buffer(PG_SAFE))
  1620. return -ENOMEM;
  1621. to_alloc = count_free_highmem_pages();
  1622. if (to_alloc > *nr_highmem_p)
  1623. to_alloc = *nr_highmem_p;
  1624. else
  1625. *nr_highmem_p = to_alloc;
  1626. safe_highmem_pages = 0;
  1627. while (to_alloc-- > 0) {
  1628. struct page *page;
  1629. page = alloc_page(__GFP_HIGHMEM);
  1630. if (!swsusp_page_is_free(page)) {
  1631. /* The page is "safe", set its bit the bitmap */
  1632. memory_bm_set_bit(bm, page_to_pfn(page));
  1633. safe_highmem_pages++;
  1634. }
  1635. /* Mark the page as allocated */
  1636. swsusp_set_page_forbidden(page);
  1637. swsusp_set_page_free(page);
  1638. }
  1639. memory_bm_position_reset(bm);
  1640. safe_highmem_bm = bm;
  1641. return 0;
  1642. }
  1643. /**
  1644. * get_highmem_page_buffer - for given highmem image page find the buffer
  1645. * that suspend_write_next() should set for its caller to write to.
  1646. *
  1647. * If the page is to be saved to its "original" page frame or a copy of
  1648. * the page is to be made in the highmem, @buffer is returned. Otherwise,
  1649. * the copy of the page is to be made in normal memory, so the address of
  1650. * the copy is returned.
  1651. *
  1652. * If @buffer is returned, the caller of suspend_write_next() will write
  1653. * the page's contents to @buffer, so they will have to be copied to the
  1654. * right location on the next call to suspend_write_next() and it is done
  1655. * with the help of copy_last_highmem_page(). For this purpose, if
  1656. * @buffer is returned, @last_highmem page is set to the page to which
  1657. * the data will have to be copied from @buffer.
  1658. */
  1659. static struct page *last_highmem_page;
  1660. static void *
  1661. get_highmem_page_buffer(struct page *page, struct chain_allocator *ca)
  1662. {
  1663. struct highmem_pbe *pbe;
  1664. void *kaddr;
  1665. if (swsusp_page_is_forbidden(page) && swsusp_page_is_free(page)) {
  1666. /* We have allocated the "original" page frame and we can
  1667. * use it directly to store the loaded page.
  1668. */
  1669. last_highmem_page = page;
  1670. return buffer;
  1671. }
  1672. /* The "original" page frame has not been allocated and we have to
  1673. * use a "safe" page frame to store the loaded page.
  1674. */
  1675. pbe = chain_alloc(ca, sizeof(struct highmem_pbe));
  1676. if (!pbe) {
  1677. swsusp_free();
  1678. return ERR_PTR(-ENOMEM);
  1679. }
  1680. pbe->orig_page = page;
  1681. if (safe_highmem_pages > 0) {
  1682. struct page *tmp;
  1683. /* Copy of the page will be stored in high memory */
  1684. kaddr = buffer;
  1685. tmp = pfn_to_page(memory_bm_next_pfn(safe_highmem_bm));
  1686. safe_highmem_pages--;
  1687. last_highmem_page = tmp;
  1688. pbe->copy_page = tmp;
  1689. } else {
  1690. /* Copy of the page will be stored in normal memory */
  1691. kaddr = safe_pages_list;
  1692. safe_pages_list = safe_pages_list->next;
  1693. pbe->copy_page = virt_to_page(kaddr);
  1694. }
  1695. pbe->next = highmem_pblist;
  1696. highmem_pblist = pbe;
  1697. return kaddr;
  1698. }
  1699. /**
  1700. * copy_last_highmem_page - copy the contents of a highmem image from
  1701. * @buffer, where the caller of snapshot_write_next() has place them,
  1702. * to the right location represented by @last_highmem_page .
  1703. */
  1704. static void copy_last_highmem_page(void)
  1705. {
  1706. if (last_highmem_page) {
  1707. void *dst;
  1708. dst = kmap_atomic(last_highmem_page);
  1709. copy_page(dst, buffer);
  1710. kunmap_atomic(dst);
  1711. last_highmem_page = NULL;
  1712. }
  1713. }
  1714. static inline int last_highmem_page_copied(void)
  1715. {
  1716. return !last_highmem_page;
  1717. }
  1718. static inline void free_highmem_data(void)
  1719. {
  1720. if (safe_highmem_bm)
  1721. memory_bm_free(safe_highmem_bm, PG_UNSAFE_CLEAR);
  1722. if (buffer)
  1723. free_image_page(buffer, PG_UNSAFE_CLEAR);
  1724. }
  1725. #else
  1726. static inline int get_safe_write_buffer(void) { return 0; }
  1727. static unsigned int
  1728. count_highmem_image_pages(struct memory_bitmap *bm) { return 0; }
  1729. static inline int
  1730. prepare_highmem_image(struct memory_bitmap *bm, unsigned int *nr_highmem_p)
  1731. {
  1732. return 0;
  1733. }
  1734. static inline void *
  1735. get_highmem_page_buffer(struct page *page, struct chain_allocator *ca)
  1736. {
  1737. return ERR_PTR(-EINVAL);
  1738. }
  1739. static inline void copy_last_highmem_page(void) {}
  1740. static inline int last_highmem_page_copied(void) { return 1; }
  1741. static inline void free_highmem_data(void) {}
  1742. #endif /* CONFIG_HIGHMEM */
  1743. /**
  1744. * prepare_image - use the memory bitmap @bm to mark the pages that will
  1745. * be overwritten in the process of restoring the system memory state
  1746. * from the suspend image ("unsafe" pages) and allocate memory for the
  1747. * image.
  1748. *
  1749. * The idea is to allocate a new memory bitmap first and then allocate
  1750. * as many pages as needed for the image data, but not to assign these
  1751. * pages to specific tasks initially. Instead, we just mark them as
  1752. * allocated and create a lists of "safe" pages that will be used
  1753. * later. On systems with high memory a list of "safe" highmem pages is
  1754. * also created.
  1755. */
  1756. #define PBES_PER_LINKED_PAGE (LINKED_PAGE_DATA_SIZE / sizeof(struct pbe))
  1757. static int
  1758. prepare_image(struct memory_bitmap *new_bm, struct memory_bitmap *bm)
  1759. {
  1760. unsigned int nr_pages, nr_highmem;
  1761. struct linked_page *sp_list, *lp;
  1762. int error;
  1763. /* If there is no highmem, the buffer will not be necessary */
  1764. free_image_page(buffer, PG_UNSAFE_CLEAR);
  1765. buffer = NULL;
  1766. nr_highmem = count_highmem_image_pages(bm);
  1767. error = mark_unsafe_pages(bm);
  1768. if (error)
  1769. goto Free;
  1770. error = memory_bm_create(new_bm, GFP_ATOMIC, PG_SAFE);
  1771. if (error)
  1772. goto Free;
  1773. duplicate_memory_bitmap(new_bm, bm);
  1774. memory_bm_free(bm, PG_UNSAFE_KEEP);
  1775. if (nr_highmem > 0) {
  1776. error = prepare_highmem_image(bm, &nr_highmem);
  1777. if (error)
  1778. goto Free;
  1779. }
  1780. /* Reserve some safe pages for potential later use.
  1781. *
  1782. * NOTE: This way we make sure there will be enough safe pages for the
  1783. * chain_alloc() in get_buffer(). It is a bit wasteful, but
  1784. * nr_copy_pages cannot be greater than 50% of the memory anyway.
  1785. */
  1786. sp_list = NULL;
  1787. /* nr_copy_pages cannot be lesser than allocated_unsafe_pages */
  1788. nr_pages = nr_copy_pages - nr_highmem - allocated_unsafe_pages;
  1789. nr_pages = DIV_ROUND_UP(nr_pages, PBES_PER_LINKED_PAGE);
  1790. while (nr_pages > 0) {
  1791. lp = get_image_page(GFP_ATOMIC, PG_SAFE);
  1792. if (!lp) {
  1793. error = -ENOMEM;
  1794. goto Free;
  1795. }
  1796. lp->next = sp_list;
  1797. sp_list = lp;
  1798. nr_pages--;
  1799. }
  1800. /* Preallocate memory for the image */
  1801. safe_pages_list = NULL;
  1802. nr_pages = nr_copy_pages - nr_highmem - allocated_unsafe_pages;
  1803. while (nr_pages > 0) {
  1804. lp = (struct linked_page *)get_zeroed_page(GFP_ATOMIC);
  1805. if (!lp) {
  1806. error = -ENOMEM;
  1807. goto Free;
  1808. }
  1809. if (!swsusp_page_is_free(virt_to_page(lp))) {
  1810. /* The page is "safe", add it to the list */
  1811. lp->next = safe_pages_list;
  1812. safe_pages_list = lp;
  1813. }
  1814. /* Mark the page as allocated */
  1815. swsusp_set_page_forbidden(virt_to_page(lp));
  1816. swsusp_set_page_free(virt_to_page(lp));
  1817. nr_pages--;
  1818. }
  1819. /* Free the reserved safe pages so that chain_alloc() can use them */
  1820. while (sp_list) {
  1821. lp = sp_list->next;
  1822. free_image_page(sp_list, PG_UNSAFE_CLEAR);
  1823. sp_list = lp;
  1824. }
  1825. return 0;
  1826. Free:
  1827. swsusp_free();
  1828. return error;
  1829. }
  1830. /**
  1831. * get_buffer - compute the address that snapshot_write_next() should
  1832. * set for its caller to write to.
  1833. */
  1834. static void *get_buffer(struct memory_bitmap *bm, struct chain_allocator *ca)
  1835. {
  1836. struct pbe *pbe;
  1837. struct page *page;
  1838. unsigned long pfn = memory_bm_next_pfn(bm);
  1839. if (pfn == BM_END_OF_MAP)
  1840. return ERR_PTR(-EFAULT);
  1841. page = pfn_to_page(pfn);
  1842. if (PageHighMem(page))
  1843. return get_highmem_page_buffer(page, ca);
  1844. if (swsusp_page_is_forbidden(page) && swsusp_page_is_free(page))
  1845. /* We have allocated the "original" page frame and we can
  1846. * use it directly to store the loaded page.
  1847. */
  1848. return page_address(page);
  1849. /* The "original" page frame has not been allocated and we have to
  1850. * use a "safe" page frame to store the loaded page.
  1851. */
  1852. pbe = chain_alloc(ca, sizeof(struct pbe));
  1853. if (!pbe) {
  1854. swsusp_free();
  1855. return ERR_PTR(-ENOMEM);
  1856. }
  1857. pbe->orig_address = page_address(page);
  1858. pbe->address = safe_pages_list;
  1859. safe_pages_list = safe_pages_list->next;
  1860. pbe->next = restore_pblist;
  1861. restore_pblist = pbe;
  1862. return pbe->address;
  1863. }
  1864. /**
  1865. * snapshot_write_next - used for writing the system memory snapshot.
  1866. *
  1867. * On the first call to it @handle should point to a zeroed
  1868. * snapshot_handle structure. The structure gets updated and a pointer
  1869. * to it should be passed to this function every next time.
  1870. *
  1871. * On success the function returns a positive number. Then, the caller
  1872. * is allowed to write up to the returned number of bytes to the memory
  1873. * location computed by the data_of() macro.
  1874. *
  1875. * The function returns 0 to indicate the "end of file" condition,
  1876. * and a negative number is returned on error. In such cases the
  1877. * structure pointed to by @handle is not updated and should not be used
  1878. * any more.
  1879. */
  1880. int snapshot_write_next(struct snapshot_handle *handle)
  1881. {
  1882. static struct chain_allocator ca;
  1883. int error = 0;
  1884. /* Check if we have already loaded the entire image */
  1885. if (handle->cur > 1 && handle->cur > nr_meta_pages + nr_copy_pages)
  1886. return 0;
  1887. handle->sync_read = 1;
  1888. if (!handle->cur) {
  1889. if (!buffer)
  1890. /* This makes the buffer be freed by swsusp_free() */
  1891. buffer = get_image_page(GFP_ATOMIC, PG_ANY);
  1892. if (!buffer)
  1893. return -ENOMEM;
  1894. handle->buffer = buffer;
  1895. } else if (handle->cur == 1) {
  1896. error = load_header(buffer);
  1897. if (error)
  1898. return error;
  1899. error = memory_bm_create(&copy_bm, GFP_ATOMIC, PG_ANY);
  1900. if (error)
  1901. return error;
  1902. /* Allocate buffer for page keys. */
  1903. error = page_key_alloc(nr_copy_pages);
  1904. if (error)
  1905. return error;
  1906. } else if (handle->cur <= nr_meta_pages + 1) {
  1907. error = unpack_orig_pfns(buffer, &copy_bm);
  1908. if (error)
  1909. return error;
  1910. if (handle->cur == nr_meta_pages + 1) {
  1911. error = prepare_image(&orig_bm, &copy_bm);
  1912. if (error)
  1913. return error;
  1914. chain_init(&ca, GFP_ATOMIC, PG_SAFE);
  1915. memory_bm_position_reset(&orig_bm);
  1916. restore_pblist = NULL;
  1917. handle->buffer = get_buffer(&orig_bm, &ca);
  1918. handle->sync_read = 0;
  1919. if (IS_ERR(handle->buffer))
  1920. return PTR_ERR(handle->buffer);
  1921. }
  1922. } else {
  1923. copy_last_highmem_page();
  1924. /* Restore page key for data page (s390 only). */
  1925. page_key_write(handle->buffer);
  1926. handle->buffer = get_buffer(&orig_bm, &ca);
  1927. if (IS_ERR(handle->buffer))
  1928. return PTR_ERR(handle->buffer);
  1929. if (handle->buffer != buffer)
  1930. handle->sync_read = 0;
  1931. }
  1932. handle->cur++;
  1933. return PAGE_SIZE;
  1934. }
  1935. /**
  1936. * snapshot_write_finalize - must be called after the last call to
  1937. * snapshot_write_next() in case the last page in the image happens
  1938. * to be a highmem page and its contents should be stored in the
  1939. * highmem. Additionally, it releases the memory that will not be
  1940. * used any more.
  1941. */
  1942. void snapshot_write_finalize(struct snapshot_handle *handle)
  1943. {
  1944. copy_last_highmem_page();
  1945. /* Restore page key for data page (s390 only). */
  1946. page_key_write(handle->buffer);
  1947. page_key_free();
  1948. /* Free only if we have loaded the image entirely */
  1949. if (handle->cur > 1 && handle->cur > nr_meta_pages + nr_copy_pages) {
  1950. memory_bm_free(&orig_bm, PG_UNSAFE_CLEAR);
  1951. free_highmem_data();
  1952. }
  1953. }
  1954. int snapshot_image_loaded(struct snapshot_handle *handle)
  1955. {
  1956. return !(!nr_copy_pages || !last_highmem_page_copied() ||
  1957. handle->cur <= nr_meta_pages + nr_copy_pages);
  1958. }
  1959. #ifdef CONFIG_HIGHMEM
  1960. /* Assumes that @buf is ready and points to a "safe" page */
  1961. static inline void
  1962. swap_two_pages_data(struct page *p1, struct page *p2, void *buf)
  1963. {
  1964. void *kaddr1, *kaddr2;
  1965. kaddr1 = kmap_atomic(p1);
  1966. kaddr2 = kmap_atomic(p2);
  1967. copy_page(buf, kaddr1);
  1968. copy_page(kaddr1, kaddr2);
  1969. copy_page(kaddr2, buf);
  1970. kunmap_atomic(kaddr2);
  1971. kunmap_atomic(kaddr1);
  1972. }
  1973. /**
  1974. * restore_highmem - for each highmem page that was allocated before
  1975. * the suspend and included in the suspend image, and also has been
  1976. * allocated by the "resume" kernel swap its current (ie. "before
  1977. * resume") contents with the previous (ie. "before suspend") one.
  1978. *
  1979. * If the resume eventually fails, we can call this function once
  1980. * again and restore the "before resume" highmem state.
  1981. */
  1982. int restore_highmem(void)
  1983. {
  1984. struct highmem_pbe *pbe = highmem_pblist;
  1985. void *buf;
  1986. if (!pbe)
  1987. return 0;
  1988. buf = get_image_page(GFP_ATOMIC, PG_SAFE);
  1989. if (!buf)
  1990. return -ENOMEM;
  1991. while (pbe) {
  1992. swap_two_pages_data(pbe->copy_page, pbe->orig_page, buf);
  1993. pbe = pbe->next;
  1994. }
  1995. free_image_page(buf, PG_UNSAFE_CLEAR);
  1996. return 0;
  1997. }
  1998. #endif /* CONFIG_HIGHMEM */