snapshot.c 60 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355
  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_end_pfn(zone);
  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. if (forbidden_pages_map && free_pages_map)
  623. return 0;
  624. else
  625. BUG_ON(forbidden_pages_map || free_pages_map);
  626. bm1 = kzalloc(sizeof(struct memory_bitmap), GFP_KERNEL);
  627. if (!bm1)
  628. return -ENOMEM;
  629. error = memory_bm_create(bm1, GFP_KERNEL, PG_ANY);
  630. if (error)
  631. goto Free_first_object;
  632. bm2 = kzalloc(sizeof(struct memory_bitmap), GFP_KERNEL);
  633. if (!bm2)
  634. goto Free_first_bitmap;
  635. error = memory_bm_create(bm2, GFP_KERNEL, PG_ANY);
  636. if (error)
  637. goto Free_second_object;
  638. forbidden_pages_map = bm1;
  639. free_pages_map = bm2;
  640. mark_nosave_pages(forbidden_pages_map);
  641. pr_debug("PM: Basic memory bitmaps created\n");
  642. return 0;
  643. Free_second_object:
  644. kfree(bm2);
  645. Free_first_bitmap:
  646. memory_bm_free(bm1, PG_UNSAFE_CLEAR);
  647. Free_first_object:
  648. kfree(bm1);
  649. return -ENOMEM;
  650. }
  651. /**
  652. * free_basic_memory_bitmaps - free memory bitmaps allocated by
  653. * create_basic_memory_bitmaps(). The auxiliary pointers are necessary
  654. * so that the bitmaps themselves are not referred to while they are being
  655. * freed.
  656. */
  657. void free_basic_memory_bitmaps(void)
  658. {
  659. struct memory_bitmap *bm1, *bm2;
  660. BUG_ON(!(forbidden_pages_map && free_pages_map));
  661. bm1 = forbidden_pages_map;
  662. bm2 = free_pages_map;
  663. forbidden_pages_map = NULL;
  664. free_pages_map = NULL;
  665. memory_bm_free(bm1, PG_UNSAFE_CLEAR);
  666. kfree(bm1);
  667. memory_bm_free(bm2, PG_UNSAFE_CLEAR);
  668. kfree(bm2);
  669. pr_debug("PM: Basic memory bitmaps freed\n");
  670. }
  671. /**
  672. * snapshot_additional_pages - estimate the number of additional pages
  673. * be needed for setting up the suspend image data structures for given
  674. * zone (usually the returned value is greater than the exact number)
  675. */
  676. unsigned int snapshot_additional_pages(struct zone *zone)
  677. {
  678. unsigned int res;
  679. res = DIV_ROUND_UP(zone->spanned_pages, BM_BITS_PER_BLOCK);
  680. res += DIV_ROUND_UP(res * sizeof(struct bm_block),
  681. LINKED_PAGE_DATA_SIZE);
  682. return 2 * res;
  683. }
  684. #ifdef CONFIG_HIGHMEM
  685. /**
  686. * count_free_highmem_pages - compute the total number of free highmem
  687. * pages, system-wide.
  688. */
  689. static unsigned int count_free_highmem_pages(void)
  690. {
  691. struct zone *zone;
  692. unsigned int cnt = 0;
  693. for_each_populated_zone(zone)
  694. if (is_highmem(zone))
  695. cnt += zone_page_state(zone, NR_FREE_PAGES);
  696. return cnt;
  697. }
  698. /**
  699. * saveable_highmem_page - Determine whether a highmem page should be
  700. * included in the suspend image.
  701. *
  702. * We should save the page if it isn't Nosave or NosaveFree, or Reserved,
  703. * and it isn't a part of a free chunk of pages.
  704. */
  705. static struct page *saveable_highmem_page(struct zone *zone, unsigned long pfn)
  706. {
  707. struct page *page;
  708. if (!pfn_valid(pfn))
  709. return NULL;
  710. page = pfn_to_page(pfn);
  711. if (page_zone(page) != zone)
  712. return NULL;
  713. BUG_ON(!PageHighMem(page));
  714. if (swsusp_page_is_forbidden(page) || swsusp_page_is_free(page) ||
  715. PageReserved(page))
  716. return NULL;
  717. if (page_is_guard(page))
  718. return NULL;
  719. return page;
  720. }
  721. /**
  722. * count_highmem_pages - compute the total number of saveable highmem
  723. * pages.
  724. */
  725. static unsigned int count_highmem_pages(void)
  726. {
  727. struct zone *zone;
  728. unsigned int n = 0;
  729. for_each_populated_zone(zone) {
  730. unsigned long pfn, max_zone_pfn;
  731. if (!is_highmem(zone))
  732. continue;
  733. mark_free_pages(zone);
  734. max_zone_pfn = zone_end_pfn(zone);
  735. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  736. if (saveable_highmem_page(zone, pfn))
  737. n++;
  738. }
  739. return n;
  740. }
  741. #else
  742. static inline void *saveable_highmem_page(struct zone *z, unsigned long p)
  743. {
  744. return NULL;
  745. }
  746. #endif /* CONFIG_HIGHMEM */
  747. /**
  748. * saveable_page - Determine whether a non-highmem page should be included
  749. * in the suspend image.
  750. *
  751. * We should save the page if it isn't Nosave, and is not in the range
  752. * of pages statically defined as 'unsaveable', and it isn't a part of
  753. * a free chunk of pages.
  754. */
  755. static struct page *saveable_page(struct zone *zone, unsigned long pfn)
  756. {
  757. struct page *page;
  758. if (!pfn_valid(pfn))
  759. return NULL;
  760. page = pfn_to_page(pfn);
  761. if (page_zone(page) != zone)
  762. return NULL;
  763. BUG_ON(PageHighMem(page));
  764. if (swsusp_page_is_forbidden(page) || swsusp_page_is_free(page))
  765. return NULL;
  766. if (PageReserved(page)
  767. && (!kernel_page_present(page) || pfn_is_nosave(pfn)))
  768. return NULL;
  769. if (page_is_guard(page))
  770. return NULL;
  771. return page;
  772. }
  773. /**
  774. * count_data_pages - compute the total number of saveable non-highmem
  775. * pages.
  776. */
  777. static unsigned int count_data_pages(void)
  778. {
  779. struct zone *zone;
  780. unsigned long pfn, max_zone_pfn;
  781. unsigned int n = 0;
  782. for_each_populated_zone(zone) {
  783. if (is_highmem(zone))
  784. continue;
  785. mark_free_pages(zone);
  786. max_zone_pfn = zone_end_pfn(zone);
  787. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  788. if (saveable_page(zone, pfn))
  789. n++;
  790. }
  791. return n;
  792. }
  793. /* This is needed, because copy_page and memcpy are not usable for copying
  794. * task structs.
  795. */
  796. static inline void do_copy_page(long *dst, long *src)
  797. {
  798. int n;
  799. for (n = PAGE_SIZE / sizeof(long); n; n--)
  800. *dst++ = *src++;
  801. }
  802. /**
  803. * safe_copy_page - check if the page we are going to copy is marked as
  804. * present in the kernel page tables (this always is the case if
  805. * CONFIG_DEBUG_PAGEALLOC is not set and in that case
  806. * kernel_page_present() always returns 'true').
  807. */
  808. static void safe_copy_page(void *dst, struct page *s_page)
  809. {
  810. if (kernel_page_present(s_page)) {
  811. do_copy_page(dst, page_address(s_page));
  812. } else {
  813. kernel_map_pages(s_page, 1, 1);
  814. do_copy_page(dst, page_address(s_page));
  815. kernel_map_pages(s_page, 1, 0);
  816. }
  817. }
  818. #ifdef CONFIG_HIGHMEM
  819. static inline struct page *
  820. page_is_saveable(struct zone *zone, unsigned long pfn)
  821. {
  822. return is_highmem(zone) ?
  823. saveable_highmem_page(zone, pfn) : saveable_page(zone, pfn);
  824. }
  825. static void copy_data_page(unsigned long dst_pfn, unsigned long src_pfn)
  826. {
  827. struct page *s_page, *d_page;
  828. void *src, *dst;
  829. s_page = pfn_to_page(src_pfn);
  830. d_page = pfn_to_page(dst_pfn);
  831. if (PageHighMem(s_page)) {
  832. src = kmap_atomic(s_page);
  833. dst = kmap_atomic(d_page);
  834. do_copy_page(dst, src);
  835. kunmap_atomic(dst);
  836. kunmap_atomic(src);
  837. } else {
  838. if (PageHighMem(d_page)) {
  839. /* Page pointed to by src may contain some kernel
  840. * data modified by kmap_atomic()
  841. */
  842. safe_copy_page(buffer, s_page);
  843. dst = kmap_atomic(d_page);
  844. copy_page(dst, buffer);
  845. kunmap_atomic(dst);
  846. } else {
  847. safe_copy_page(page_address(d_page), s_page);
  848. }
  849. }
  850. }
  851. #else
  852. #define page_is_saveable(zone, pfn) saveable_page(zone, pfn)
  853. static inline void copy_data_page(unsigned long dst_pfn, unsigned long src_pfn)
  854. {
  855. safe_copy_page(page_address(pfn_to_page(dst_pfn)),
  856. pfn_to_page(src_pfn));
  857. }
  858. #endif /* CONFIG_HIGHMEM */
  859. static void
  860. copy_data_pages(struct memory_bitmap *copy_bm, struct memory_bitmap *orig_bm)
  861. {
  862. struct zone *zone;
  863. unsigned long pfn;
  864. for_each_populated_zone(zone) {
  865. unsigned long max_zone_pfn;
  866. mark_free_pages(zone);
  867. max_zone_pfn = zone_end_pfn(zone);
  868. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  869. if (page_is_saveable(zone, pfn))
  870. memory_bm_set_bit(orig_bm, pfn);
  871. }
  872. memory_bm_position_reset(orig_bm);
  873. memory_bm_position_reset(copy_bm);
  874. for(;;) {
  875. pfn = memory_bm_next_pfn(orig_bm);
  876. if (unlikely(pfn == BM_END_OF_MAP))
  877. break;
  878. copy_data_page(memory_bm_next_pfn(copy_bm), pfn);
  879. }
  880. }
  881. /* Total number of image pages */
  882. static unsigned int nr_copy_pages;
  883. /* Number of pages needed for saving the original pfns of the image pages */
  884. static unsigned int nr_meta_pages;
  885. /*
  886. * Numbers of normal and highmem page frames allocated for hibernation image
  887. * before suspending devices.
  888. */
  889. unsigned int alloc_normal, alloc_highmem;
  890. /*
  891. * Memory bitmap used for marking saveable pages (during hibernation) or
  892. * hibernation image pages (during restore)
  893. */
  894. static struct memory_bitmap orig_bm;
  895. /*
  896. * Memory bitmap used during hibernation for marking allocated page frames that
  897. * will contain copies of saveable pages. During restore it is initially used
  898. * for marking hibernation image pages, but then the set bits from it are
  899. * duplicated in @orig_bm and it is released. On highmem systems it is next
  900. * used for marking "safe" highmem pages, but it has to be reinitialized for
  901. * this purpose.
  902. */
  903. static struct memory_bitmap copy_bm;
  904. /**
  905. * swsusp_free - free pages allocated for the suspend.
  906. *
  907. * Suspend pages are alocated before the atomic copy is made, so we
  908. * need to release them after the resume.
  909. */
  910. void swsusp_free(void)
  911. {
  912. struct zone *zone;
  913. unsigned long pfn, max_zone_pfn;
  914. for_each_populated_zone(zone) {
  915. max_zone_pfn = zone_end_pfn(zone);
  916. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  917. if (pfn_valid(pfn)) {
  918. struct page *page = pfn_to_page(pfn);
  919. if (swsusp_page_is_forbidden(page) &&
  920. swsusp_page_is_free(page)) {
  921. swsusp_unset_page_forbidden(page);
  922. swsusp_unset_page_free(page);
  923. __free_page(page);
  924. }
  925. }
  926. }
  927. nr_copy_pages = 0;
  928. nr_meta_pages = 0;
  929. restore_pblist = NULL;
  930. buffer = NULL;
  931. alloc_normal = 0;
  932. alloc_highmem = 0;
  933. }
  934. /* Helper functions used for the shrinking of memory. */
  935. #define GFP_IMAGE (GFP_KERNEL | __GFP_NOWARN)
  936. /**
  937. * preallocate_image_pages - Allocate a number of pages for hibernation image
  938. * @nr_pages: Number of page frames to allocate.
  939. * @mask: GFP flags to use for the allocation.
  940. *
  941. * Return value: Number of page frames actually allocated
  942. */
  943. static unsigned long preallocate_image_pages(unsigned long nr_pages, gfp_t mask)
  944. {
  945. unsigned long nr_alloc = 0;
  946. while (nr_pages > 0) {
  947. struct page *page;
  948. page = alloc_image_page(mask);
  949. if (!page)
  950. break;
  951. memory_bm_set_bit(&copy_bm, page_to_pfn(page));
  952. if (PageHighMem(page))
  953. alloc_highmem++;
  954. else
  955. alloc_normal++;
  956. nr_pages--;
  957. nr_alloc++;
  958. }
  959. return nr_alloc;
  960. }
  961. static unsigned long preallocate_image_memory(unsigned long nr_pages,
  962. unsigned long avail_normal)
  963. {
  964. unsigned long alloc;
  965. if (avail_normal <= alloc_normal)
  966. return 0;
  967. alloc = avail_normal - alloc_normal;
  968. if (nr_pages < alloc)
  969. alloc = nr_pages;
  970. return preallocate_image_pages(alloc, GFP_IMAGE);
  971. }
  972. #ifdef CONFIG_HIGHMEM
  973. static unsigned long preallocate_image_highmem(unsigned long nr_pages)
  974. {
  975. return preallocate_image_pages(nr_pages, GFP_IMAGE | __GFP_HIGHMEM);
  976. }
  977. /**
  978. * __fraction - Compute (an approximation of) x * (multiplier / base)
  979. */
  980. static unsigned long __fraction(u64 x, u64 multiplier, u64 base)
  981. {
  982. x *= multiplier;
  983. do_div(x, base);
  984. return (unsigned long)x;
  985. }
  986. static unsigned long preallocate_highmem_fraction(unsigned long nr_pages,
  987. unsigned long highmem,
  988. unsigned long total)
  989. {
  990. unsigned long alloc = __fraction(nr_pages, highmem, total);
  991. return preallocate_image_pages(alloc, GFP_IMAGE | __GFP_HIGHMEM);
  992. }
  993. #else /* CONFIG_HIGHMEM */
  994. static inline unsigned long preallocate_image_highmem(unsigned long nr_pages)
  995. {
  996. return 0;
  997. }
  998. static inline unsigned long preallocate_highmem_fraction(unsigned long nr_pages,
  999. unsigned long highmem,
  1000. unsigned long total)
  1001. {
  1002. return 0;
  1003. }
  1004. #endif /* CONFIG_HIGHMEM */
  1005. /**
  1006. * free_unnecessary_pages - Release preallocated pages not needed for the image
  1007. */
  1008. static void free_unnecessary_pages(void)
  1009. {
  1010. unsigned long save, to_free_normal, to_free_highmem;
  1011. save = count_data_pages();
  1012. if (alloc_normal >= save) {
  1013. to_free_normal = alloc_normal - save;
  1014. save = 0;
  1015. } else {
  1016. to_free_normal = 0;
  1017. save -= alloc_normal;
  1018. }
  1019. save += count_highmem_pages();
  1020. if (alloc_highmem >= save) {
  1021. to_free_highmem = alloc_highmem - save;
  1022. } else {
  1023. to_free_highmem = 0;
  1024. save -= alloc_highmem;
  1025. if (to_free_normal > save)
  1026. to_free_normal -= save;
  1027. else
  1028. to_free_normal = 0;
  1029. }
  1030. memory_bm_position_reset(&copy_bm);
  1031. while (to_free_normal > 0 || to_free_highmem > 0) {
  1032. unsigned long pfn = memory_bm_next_pfn(&copy_bm);
  1033. struct page *page = pfn_to_page(pfn);
  1034. if (PageHighMem(page)) {
  1035. if (!to_free_highmem)
  1036. continue;
  1037. to_free_highmem--;
  1038. alloc_highmem--;
  1039. } else {
  1040. if (!to_free_normal)
  1041. continue;
  1042. to_free_normal--;
  1043. alloc_normal--;
  1044. }
  1045. memory_bm_clear_bit(&copy_bm, pfn);
  1046. swsusp_unset_page_forbidden(page);
  1047. swsusp_unset_page_free(page);
  1048. __free_page(page);
  1049. }
  1050. }
  1051. /**
  1052. * minimum_image_size - Estimate the minimum acceptable size of an image
  1053. * @saveable: Number of saveable pages in the system.
  1054. *
  1055. * We want to avoid attempting to free too much memory too hard, so estimate the
  1056. * minimum acceptable size of a hibernation image to use as the lower limit for
  1057. * preallocating memory.
  1058. *
  1059. * We assume that the minimum image size should be proportional to
  1060. *
  1061. * [number of saveable pages] - [number of pages that can be freed in theory]
  1062. *
  1063. * where the second term is the sum of (1) reclaimable slab pages, (2) active
  1064. * and (3) inactive anonymouns pages, (4) active and (5) inactive file pages,
  1065. * minus mapped file pages.
  1066. */
  1067. static unsigned long minimum_image_size(unsigned long saveable)
  1068. {
  1069. unsigned long size;
  1070. size = global_page_state(NR_SLAB_RECLAIMABLE)
  1071. + global_page_state(NR_ACTIVE_ANON)
  1072. + global_page_state(NR_INACTIVE_ANON)
  1073. + global_page_state(NR_ACTIVE_FILE)
  1074. + global_page_state(NR_INACTIVE_FILE)
  1075. - global_page_state(NR_FILE_MAPPED);
  1076. return saveable <= size ? 0 : saveable - size;
  1077. }
  1078. /**
  1079. * hibernate_preallocate_memory - Preallocate memory for hibernation image
  1080. *
  1081. * To create a hibernation image it is necessary to make a copy of every page
  1082. * frame in use. We also need a number of page frames to be free during
  1083. * hibernation for allocations made while saving the image and for device
  1084. * drivers, in case they need to allocate memory from their hibernation
  1085. * callbacks (these two numbers are given by PAGES_FOR_IO (which is a rough
  1086. * estimate) and reserverd_size divided by PAGE_SIZE (which is tunable through
  1087. * /sys/power/reserved_size, respectively). To make this happen, we compute the
  1088. * total number of available page frames and allocate at least
  1089. *
  1090. * ([page frames total] + PAGES_FOR_IO + [metadata pages]) / 2
  1091. * + 2 * DIV_ROUND_UP(reserved_size, PAGE_SIZE)
  1092. *
  1093. * of them, which corresponds to the maximum size of a hibernation image.
  1094. *
  1095. * If image_size is set below the number following from the above formula,
  1096. * the preallocation of memory is continued until the total number of saveable
  1097. * pages in the system is below the requested image size or the minimum
  1098. * acceptable image size returned by minimum_image_size(), whichever is greater.
  1099. */
  1100. int hibernate_preallocate_memory(void)
  1101. {
  1102. struct zone *zone;
  1103. unsigned long saveable, size, max_size, count, highmem, pages = 0;
  1104. unsigned long alloc, save_highmem, pages_highmem, avail_normal;
  1105. struct timeval start, stop;
  1106. int error;
  1107. printk(KERN_INFO "PM: Preallocating image memory... ");
  1108. do_gettimeofday(&start);
  1109. error = memory_bm_create(&orig_bm, GFP_IMAGE, PG_ANY);
  1110. if (error)
  1111. goto err_out;
  1112. error = memory_bm_create(&copy_bm, GFP_IMAGE, PG_ANY);
  1113. if (error)
  1114. goto err_out;
  1115. alloc_normal = 0;
  1116. alloc_highmem = 0;
  1117. /* Count the number of saveable data pages. */
  1118. save_highmem = count_highmem_pages();
  1119. saveable = count_data_pages();
  1120. /*
  1121. * Compute the total number of page frames we can use (count) and the
  1122. * number of pages needed for image metadata (size).
  1123. */
  1124. count = saveable;
  1125. saveable += save_highmem;
  1126. highmem = save_highmem;
  1127. size = 0;
  1128. for_each_populated_zone(zone) {
  1129. size += snapshot_additional_pages(zone);
  1130. if (is_highmem(zone))
  1131. highmem += zone_page_state(zone, NR_FREE_PAGES);
  1132. else
  1133. count += zone_page_state(zone, NR_FREE_PAGES);
  1134. }
  1135. avail_normal = count;
  1136. count += highmem;
  1137. count -= totalreserve_pages;
  1138. /* Add number of pages required for page keys (s390 only). */
  1139. size += page_key_additional_pages(saveable);
  1140. /* Compute the maximum number of saveable pages to leave in memory. */
  1141. max_size = (count - (size + PAGES_FOR_IO)) / 2
  1142. - 2 * DIV_ROUND_UP(reserved_size, PAGE_SIZE);
  1143. /* Compute the desired number of image pages specified by image_size. */
  1144. size = DIV_ROUND_UP(image_size, PAGE_SIZE);
  1145. if (size > max_size)
  1146. size = max_size;
  1147. /*
  1148. * If the desired number of image pages is at least as large as the
  1149. * current number of saveable pages in memory, allocate page frames for
  1150. * the image and we're done.
  1151. */
  1152. if (size >= saveable) {
  1153. pages = preallocate_image_highmem(save_highmem);
  1154. pages += preallocate_image_memory(saveable - pages, avail_normal);
  1155. goto out;
  1156. }
  1157. /* Estimate the minimum size of the image. */
  1158. pages = minimum_image_size(saveable);
  1159. /*
  1160. * To avoid excessive pressure on the normal zone, leave room in it to
  1161. * accommodate an image of the minimum size (unless it's already too
  1162. * small, in which case don't preallocate pages from it at all).
  1163. */
  1164. if (avail_normal > pages)
  1165. avail_normal -= pages;
  1166. else
  1167. avail_normal = 0;
  1168. if (size < pages)
  1169. size = min_t(unsigned long, pages, max_size);
  1170. /*
  1171. * Let the memory management subsystem know that we're going to need a
  1172. * large number of page frames to allocate and make it free some memory.
  1173. * NOTE: If this is not done, performance will be hurt badly in some
  1174. * test cases.
  1175. */
  1176. shrink_all_memory(saveable - size);
  1177. /*
  1178. * The number of saveable pages in memory was too high, so apply some
  1179. * pressure to decrease it. First, make room for the largest possible
  1180. * image and fail if that doesn't work. Next, try to decrease the size
  1181. * of the image as much as indicated by 'size' using allocations from
  1182. * highmem and non-highmem zones separately.
  1183. */
  1184. pages_highmem = preallocate_image_highmem(highmem / 2);
  1185. alloc = (count - max_size) - pages_highmem;
  1186. pages = preallocate_image_memory(alloc, avail_normal);
  1187. if (pages < alloc) {
  1188. /* We have exhausted non-highmem pages, try highmem. */
  1189. alloc -= pages;
  1190. pages += pages_highmem;
  1191. pages_highmem = preallocate_image_highmem(alloc);
  1192. if (pages_highmem < alloc)
  1193. goto err_out;
  1194. pages += pages_highmem;
  1195. /*
  1196. * size is the desired number of saveable pages to leave in
  1197. * memory, so try to preallocate (all memory - size) pages.
  1198. */
  1199. alloc = (count - pages) - size;
  1200. pages += preallocate_image_highmem(alloc);
  1201. } else {
  1202. /*
  1203. * There are approximately max_size saveable pages at this point
  1204. * and we want to reduce this number down to size.
  1205. */
  1206. alloc = max_size - size;
  1207. size = preallocate_highmem_fraction(alloc, highmem, count);
  1208. pages_highmem += size;
  1209. alloc -= size;
  1210. size = preallocate_image_memory(alloc, avail_normal);
  1211. pages_highmem += preallocate_image_highmem(alloc - size);
  1212. pages += pages_highmem + size;
  1213. }
  1214. /*
  1215. * We only need as many page frames for the image as there are saveable
  1216. * pages in memory, but we have allocated more. Release the excessive
  1217. * ones now.
  1218. */
  1219. free_unnecessary_pages();
  1220. out:
  1221. do_gettimeofday(&stop);
  1222. printk(KERN_CONT "done (allocated %lu pages)\n", pages);
  1223. swsusp_show_speed(&start, &stop, pages, "Allocated");
  1224. return 0;
  1225. err_out:
  1226. printk(KERN_CONT "\n");
  1227. swsusp_free();
  1228. return -ENOMEM;
  1229. }
  1230. #ifdef CONFIG_HIGHMEM
  1231. /**
  1232. * count_pages_for_highmem - compute the number of non-highmem pages
  1233. * that will be necessary for creating copies of highmem pages.
  1234. */
  1235. static unsigned int count_pages_for_highmem(unsigned int nr_highmem)
  1236. {
  1237. unsigned int free_highmem = count_free_highmem_pages() + alloc_highmem;
  1238. if (free_highmem >= nr_highmem)
  1239. nr_highmem = 0;
  1240. else
  1241. nr_highmem -= free_highmem;
  1242. return nr_highmem;
  1243. }
  1244. #else
  1245. static unsigned int
  1246. count_pages_for_highmem(unsigned int nr_highmem) { return 0; }
  1247. #endif /* CONFIG_HIGHMEM */
  1248. /**
  1249. * enough_free_mem - Make sure we have enough free memory for the
  1250. * snapshot image.
  1251. */
  1252. static int enough_free_mem(unsigned int nr_pages, unsigned int nr_highmem)
  1253. {
  1254. struct zone *zone;
  1255. unsigned int free = alloc_normal;
  1256. for_each_populated_zone(zone)
  1257. if (!is_highmem(zone))
  1258. free += zone_page_state(zone, NR_FREE_PAGES);
  1259. nr_pages += count_pages_for_highmem(nr_highmem);
  1260. pr_debug("PM: Normal pages needed: %u + %u, available pages: %u\n",
  1261. nr_pages, PAGES_FOR_IO, free);
  1262. return free > nr_pages + PAGES_FOR_IO;
  1263. }
  1264. #ifdef CONFIG_HIGHMEM
  1265. /**
  1266. * get_highmem_buffer - if there are some highmem pages in the suspend
  1267. * image, we may need the buffer to copy them and/or load their data.
  1268. */
  1269. static inline int get_highmem_buffer(int safe_needed)
  1270. {
  1271. buffer = get_image_page(GFP_ATOMIC | __GFP_COLD, safe_needed);
  1272. return buffer ? 0 : -ENOMEM;
  1273. }
  1274. /**
  1275. * alloc_highmem_image_pages - allocate some highmem pages for the image.
  1276. * Try to allocate as many pages as needed, but if the number of free
  1277. * highmem pages is lesser than that, allocate them all.
  1278. */
  1279. static inline unsigned int
  1280. alloc_highmem_pages(struct memory_bitmap *bm, unsigned int nr_highmem)
  1281. {
  1282. unsigned int to_alloc = count_free_highmem_pages();
  1283. if (to_alloc > nr_highmem)
  1284. to_alloc = nr_highmem;
  1285. nr_highmem -= to_alloc;
  1286. while (to_alloc-- > 0) {
  1287. struct page *page;
  1288. page = alloc_image_page(__GFP_HIGHMEM);
  1289. memory_bm_set_bit(bm, page_to_pfn(page));
  1290. }
  1291. return nr_highmem;
  1292. }
  1293. #else
  1294. static inline int get_highmem_buffer(int safe_needed) { return 0; }
  1295. static inline unsigned int
  1296. alloc_highmem_pages(struct memory_bitmap *bm, unsigned int n) { return 0; }
  1297. #endif /* CONFIG_HIGHMEM */
  1298. /**
  1299. * swsusp_alloc - allocate memory for the suspend image
  1300. *
  1301. * We first try to allocate as many highmem pages as there are
  1302. * saveable highmem pages in the system. If that fails, we allocate
  1303. * non-highmem pages for the copies of the remaining highmem ones.
  1304. *
  1305. * In this approach it is likely that the copies of highmem pages will
  1306. * also be located in the high memory, because of the way in which
  1307. * copy_data_pages() works.
  1308. */
  1309. static int
  1310. swsusp_alloc(struct memory_bitmap *orig_bm, struct memory_bitmap *copy_bm,
  1311. unsigned int nr_pages, unsigned int nr_highmem)
  1312. {
  1313. if (nr_highmem > 0) {
  1314. if (get_highmem_buffer(PG_ANY))
  1315. goto err_out;
  1316. if (nr_highmem > alloc_highmem) {
  1317. nr_highmem -= alloc_highmem;
  1318. nr_pages += alloc_highmem_pages(copy_bm, nr_highmem);
  1319. }
  1320. }
  1321. if (nr_pages > alloc_normal) {
  1322. nr_pages -= alloc_normal;
  1323. while (nr_pages-- > 0) {
  1324. struct page *page;
  1325. page = alloc_image_page(GFP_ATOMIC | __GFP_COLD);
  1326. if (!page)
  1327. goto err_out;
  1328. memory_bm_set_bit(copy_bm, page_to_pfn(page));
  1329. }
  1330. }
  1331. return 0;
  1332. err_out:
  1333. swsusp_free();
  1334. return -ENOMEM;
  1335. }
  1336. asmlinkage int swsusp_save(void)
  1337. {
  1338. unsigned int nr_pages, nr_highmem;
  1339. printk(KERN_INFO "PM: Creating hibernation image:\n");
  1340. drain_local_pages(NULL);
  1341. nr_pages = count_data_pages();
  1342. nr_highmem = count_highmem_pages();
  1343. printk(KERN_INFO "PM: Need to copy %u pages\n", nr_pages + nr_highmem);
  1344. if (!enough_free_mem(nr_pages, nr_highmem)) {
  1345. printk(KERN_ERR "PM: Not enough free memory\n");
  1346. return -ENOMEM;
  1347. }
  1348. if (swsusp_alloc(&orig_bm, &copy_bm, nr_pages, nr_highmem)) {
  1349. printk(KERN_ERR "PM: Memory allocation failed\n");
  1350. return -ENOMEM;
  1351. }
  1352. /* During allocating of suspend pagedir, new cold pages may appear.
  1353. * Kill them.
  1354. */
  1355. drain_local_pages(NULL);
  1356. copy_data_pages(&copy_bm, &orig_bm);
  1357. /*
  1358. * End of critical section. From now on, we can write to memory,
  1359. * but we should not touch disk. This specially means we must _not_
  1360. * touch swap space! Except we must write out our image of course.
  1361. */
  1362. nr_pages += nr_highmem;
  1363. nr_copy_pages = nr_pages;
  1364. nr_meta_pages = DIV_ROUND_UP(nr_pages * sizeof(long), PAGE_SIZE);
  1365. printk(KERN_INFO "PM: Hibernation image created (%d pages copied)\n",
  1366. nr_pages);
  1367. return 0;
  1368. }
  1369. #ifndef CONFIG_ARCH_HIBERNATION_HEADER
  1370. static int init_header_complete(struct swsusp_info *info)
  1371. {
  1372. memcpy(&info->uts, init_utsname(), sizeof(struct new_utsname));
  1373. info->version_code = LINUX_VERSION_CODE;
  1374. return 0;
  1375. }
  1376. static char *check_image_kernel(struct swsusp_info *info)
  1377. {
  1378. if (info->version_code != LINUX_VERSION_CODE)
  1379. return "kernel version";
  1380. if (strcmp(info->uts.sysname,init_utsname()->sysname))
  1381. return "system type";
  1382. if (strcmp(info->uts.release,init_utsname()->release))
  1383. return "kernel release";
  1384. if (strcmp(info->uts.version,init_utsname()->version))
  1385. return "version";
  1386. if (strcmp(info->uts.machine,init_utsname()->machine))
  1387. return "machine";
  1388. return NULL;
  1389. }
  1390. #endif /* CONFIG_ARCH_HIBERNATION_HEADER */
  1391. unsigned long snapshot_get_image_size(void)
  1392. {
  1393. return nr_copy_pages + nr_meta_pages + 1;
  1394. }
  1395. static int init_header(struct swsusp_info *info)
  1396. {
  1397. memset(info, 0, sizeof(struct swsusp_info));
  1398. info->num_physpages = get_num_physpages();
  1399. info->image_pages = nr_copy_pages;
  1400. info->pages = snapshot_get_image_size();
  1401. info->size = info->pages;
  1402. info->size <<= PAGE_SHIFT;
  1403. return init_header_complete(info);
  1404. }
  1405. /**
  1406. * pack_pfns - pfns corresponding to the set bits found in the bitmap @bm
  1407. * are stored in the array @buf[] (1 page at a time)
  1408. */
  1409. static inline void
  1410. pack_pfns(unsigned long *buf, struct memory_bitmap *bm)
  1411. {
  1412. int j;
  1413. for (j = 0; j < PAGE_SIZE / sizeof(long); j++) {
  1414. buf[j] = memory_bm_next_pfn(bm);
  1415. if (unlikely(buf[j] == BM_END_OF_MAP))
  1416. break;
  1417. /* Save page key for data page (s390 only). */
  1418. page_key_read(buf + j);
  1419. }
  1420. }
  1421. /**
  1422. * snapshot_read_next - used for reading the system memory snapshot.
  1423. *
  1424. * On the first call to it @handle should point to a zeroed
  1425. * snapshot_handle structure. The structure gets updated and a pointer
  1426. * to it should be passed to this function every next time.
  1427. *
  1428. * On success the function returns a positive number. Then, the caller
  1429. * is allowed to read up to the returned number of bytes from the memory
  1430. * location computed by the data_of() macro.
  1431. *
  1432. * The function returns 0 to indicate the end of data stream condition,
  1433. * and a negative number is returned on error. In such cases the
  1434. * structure pointed to by @handle is not updated and should not be used
  1435. * any more.
  1436. */
  1437. int snapshot_read_next(struct snapshot_handle *handle)
  1438. {
  1439. if (handle->cur > nr_meta_pages + nr_copy_pages)
  1440. return 0;
  1441. if (!buffer) {
  1442. /* This makes the buffer be freed by swsusp_free() */
  1443. buffer = get_image_page(GFP_ATOMIC, PG_ANY);
  1444. if (!buffer)
  1445. return -ENOMEM;
  1446. }
  1447. if (!handle->cur) {
  1448. int error;
  1449. error = init_header((struct swsusp_info *)buffer);
  1450. if (error)
  1451. return error;
  1452. handle->buffer = buffer;
  1453. memory_bm_position_reset(&orig_bm);
  1454. memory_bm_position_reset(&copy_bm);
  1455. } else if (handle->cur <= nr_meta_pages) {
  1456. clear_page(buffer);
  1457. pack_pfns(buffer, &orig_bm);
  1458. } else {
  1459. struct page *page;
  1460. page = pfn_to_page(memory_bm_next_pfn(&copy_bm));
  1461. if (PageHighMem(page)) {
  1462. /* Highmem pages are copied to the buffer,
  1463. * because we can't return with a kmapped
  1464. * highmem page (we may not be called again).
  1465. */
  1466. void *kaddr;
  1467. kaddr = kmap_atomic(page);
  1468. copy_page(buffer, kaddr);
  1469. kunmap_atomic(kaddr);
  1470. handle->buffer = buffer;
  1471. } else {
  1472. handle->buffer = page_address(page);
  1473. }
  1474. }
  1475. handle->cur++;
  1476. return PAGE_SIZE;
  1477. }
  1478. /**
  1479. * mark_unsafe_pages - mark the pages that cannot be used for storing
  1480. * the image during resume, because they conflict with the pages that
  1481. * had been used before suspend
  1482. */
  1483. static int mark_unsafe_pages(struct memory_bitmap *bm)
  1484. {
  1485. struct zone *zone;
  1486. unsigned long pfn, max_zone_pfn;
  1487. /* Clear page flags */
  1488. for_each_populated_zone(zone) {
  1489. max_zone_pfn = zone_end_pfn(zone);
  1490. for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++)
  1491. if (pfn_valid(pfn))
  1492. swsusp_unset_page_free(pfn_to_page(pfn));
  1493. }
  1494. /* Mark pages that correspond to the "original" pfns as "unsafe" */
  1495. memory_bm_position_reset(bm);
  1496. do {
  1497. pfn = memory_bm_next_pfn(bm);
  1498. if (likely(pfn != BM_END_OF_MAP)) {
  1499. if (likely(pfn_valid(pfn)))
  1500. swsusp_set_page_free(pfn_to_page(pfn));
  1501. else
  1502. return -EFAULT;
  1503. }
  1504. } while (pfn != BM_END_OF_MAP);
  1505. allocated_unsafe_pages = 0;
  1506. return 0;
  1507. }
  1508. static void
  1509. duplicate_memory_bitmap(struct memory_bitmap *dst, struct memory_bitmap *src)
  1510. {
  1511. unsigned long pfn;
  1512. memory_bm_position_reset(src);
  1513. pfn = memory_bm_next_pfn(src);
  1514. while (pfn != BM_END_OF_MAP) {
  1515. memory_bm_set_bit(dst, pfn);
  1516. pfn = memory_bm_next_pfn(src);
  1517. }
  1518. }
  1519. static int check_header(struct swsusp_info *info)
  1520. {
  1521. char *reason;
  1522. reason = check_image_kernel(info);
  1523. if (!reason && info->num_physpages != get_num_physpages())
  1524. reason = "memory size";
  1525. if (reason) {
  1526. printk(KERN_ERR "PM: Image mismatch: %s\n", reason);
  1527. return -EPERM;
  1528. }
  1529. return 0;
  1530. }
  1531. /**
  1532. * load header - check the image header and copy data from it
  1533. */
  1534. static int
  1535. load_header(struct swsusp_info *info)
  1536. {
  1537. int error;
  1538. restore_pblist = NULL;
  1539. error = check_header(info);
  1540. if (!error) {
  1541. nr_copy_pages = info->image_pages;
  1542. nr_meta_pages = info->pages - info->image_pages - 1;
  1543. }
  1544. return error;
  1545. }
  1546. /**
  1547. * unpack_orig_pfns - for each element of @buf[] (1 page at a time) set
  1548. * the corresponding bit in the memory bitmap @bm
  1549. */
  1550. static int unpack_orig_pfns(unsigned long *buf, struct memory_bitmap *bm)
  1551. {
  1552. int j;
  1553. for (j = 0; j < PAGE_SIZE / sizeof(long); j++) {
  1554. if (unlikely(buf[j] == BM_END_OF_MAP))
  1555. break;
  1556. /* Extract and buffer page key for data page (s390 only). */
  1557. page_key_memorize(buf + j);
  1558. if (memory_bm_pfn_present(bm, buf[j]))
  1559. memory_bm_set_bit(bm, buf[j]);
  1560. else
  1561. return -EFAULT;
  1562. }
  1563. return 0;
  1564. }
  1565. /* List of "safe" pages that may be used to store data loaded from the suspend
  1566. * image
  1567. */
  1568. static struct linked_page *safe_pages_list;
  1569. #ifdef CONFIG_HIGHMEM
  1570. /* struct highmem_pbe is used for creating the list of highmem pages that
  1571. * should be restored atomically during the resume from disk, because the page
  1572. * frames they have occupied before the suspend are in use.
  1573. */
  1574. struct highmem_pbe {
  1575. struct page *copy_page; /* data is here now */
  1576. struct page *orig_page; /* data was here before the suspend */
  1577. struct highmem_pbe *next;
  1578. };
  1579. /* List of highmem PBEs needed for restoring the highmem pages that were
  1580. * allocated before the suspend and included in the suspend image, but have
  1581. * also been allocated by the "resume" kernel, so their contents cannot be
  1582. * written directly to their "original" page frames.
  1583. */
  1584. static struct highmem_pbe *highmem_pblist;
  1585. /**
  1586. * count_highmem_image_pages - compute the number of highmem pages in the
  1587. * suspend image. The bits in the memory bitmap @bm that correspond to the
  1588. * image pages are assumed to be set.
  1589. */
  1590. static unsigned int count_highmem_image_pages(struct memory_bitmap *bm)
  1591. {
  1592. unsigned long pfn;
  1593. unsigned int cnt = 0;
  1594. memory_bm_position_reset(bm);
  1595. pfn = memory_bm_next_pfn(bm);
  1596. while (pfn != BM_END_OF_MAP) {
  1597. if (PageHighMem(pfn_to_page(pfn)))
  1598. cnt++;
  1599. pfn = memory_bm_next_pfn(bm);
  1600. }
  1601. return cnt;
  1602. }
  1603. /**
  1604. * prepare_highmem_image - try to allocate as many highmem pages as
  1605. * there are highmem image pages (@nr_highmem_p points to the variable
  1606. * containing the number of highmem image pages). The pages that are
  1607. * "safe" (ie. will not be overwritten when the suspend image is
  1608. * restored) have the corresponding bits set in @bm (it must be
  1609. * unitialized).
  1610. *
  1611. * NOTE: This function should not be called if there are no highmem
  1612. * image pages.
  1613. */
  1614. static unsigned int safe_highmem_pages;
  1615. static struct memory_bitmap *safe_highmem_bm;
  1616. static int
  1617. prepare_highmem_image(struct memory_bitmap *bm, unsigned int *nr_highmem_p)
  1618. {
  1619. unsigned int to_alloc;
  1620. if (memory_bm_create(bm, GFP_ATOMIC, PG_SAFE))
  1621. return -ENOMEM;
  1622. if (get_highmem_buffer(PG_SAFE))
  1623. return -ENOMEM;
  1624. to_alloc = count_free_highmem_pages();
  1625. if (to_alloc > *nr_highmem_p)
  1626. to_alloc = *nr_highmem_p;
  1627. else
  1628. *nr_highmem_p = to_alloc;
  1629. safe_highmem_pages = 0;
  1630. while (to_alloc-- > 0) {
  1631. struct page *page;
  1632. page = alloc_page(__GFP_HIGHMEM);
  1633. if (!swsusp_page_is_free(page)) {
  1634. /* The page is "safe", set its bit the bitmap */
  1635. memory_bm_set_bit(bm, page_to_pfn(page));
  1636. safe_highmem_pages++;
  1637. }
  1638. /* Mark the page as allocated */
  1639. swsusp_set_page_forbidden(page);
  1640. swsusp_set_page_free(page);
  1641. }
  1642. memory_bm_position_reset(bm);
  1643. safe_highmem_bm = bm;
  1644. return 0;
  1645. }
  1646. /**
  1647. * get_highmem_page_buffer - for given highmem image page find the buffer
  1648. * that suspend_write_next() should set for its caller to write to.
  1649. *
  1650. * If the page is to be saved to its "original" page frame or a copy of
  1651. * the page is to be made in the highmem, @buffer is returned. Otherwise,
  1652. * the copy of the page is to be made in normal memory, so the address of
  1653. * the copy is returned.
  1654. *
  1655. * If @buffer is returned, the caller of suspend_write_next() will write
  1656. * the page's contents to @buffer, so they will have to be copied to the
  1657. * right location on the next call to suspend_write_next() and it is done
  1658. * with the help of copy_last_highmem_page(). For this purpose, if
  1659. * @buffer is returned, @last_highmem page is set to the page to which
  1660. * the data will have to be copied from @buffer.
  1661. */
  1662. static struct page *last_highmem_page;
  1663. static void *
  1664. get_highmem_page_buffer(struct page *page, struct chain_allocator *ca)
  1665. {
  1666. struct highmem_pbe *pbe;
  1667. void *kaddr;
  1668. if (swsusp_page_is_forbidden(page) && swsusp_page_is_free(page)) {
  1669. /* We have allocated the "original" page frame and we can
  1670. * use it directly to store the loaded page.
  1671. */
  1672. last_highmem_page = page;
  1673. return buffer;
  1674. }
  1675. /* The "original" page frame has not been allocated and we have to
  1676. * use a "safe" page frame to store the loaded page.
  1677. */
  1678. pbe = chain_alloc(ca, sizeof(struct highmem_pbe));
  1679. if (!pbe) {
  1680. swsusp_free();
  1681. return ERR_PTR(-ENOMEM);
  1682. }
  1683. pbe->orig_page = page;
  1684. if (safe_highmem_pages > 0) {
  1685. struct page *tmp;
  1686. /* Copy of the page will be stored in high memory */
  1687. kaddr = buffer;
  1688. tmp = pfn_to_page(memory_bm_next_pfn(safe_highmem_bm));
  1689. safe_highmem_pages--;
  1690. last_highmem_page = tmp;
  1691. pbe->copy_page = tmp;
  1692. } else {
  1693. /* Copy of the page will be stored in normal memory */
  1694. kaddr = safe_pages_list;
  1695. safe_pages_list = safe_pages_list->next;
  1696. pbe->copy_page = virt_to_page(kaddr);
  1697. }
  1698. pbe->next = highmem_pblist;
  1699. highmem_pblist = pbe;
  1700. return kaddr;
  1701. }
  1702. /**
  1703. * copy_last_highmem_page - copy the contents of a highmem image from
  1704. * @buffer, where the caller of snapshot_write_next() has place them,
  1705. * to the right location represented by @last_highmem_page .
  1706. */
  1707. static void copy_last_highmem_page(void)
  1708. {
  1709. if (last_highmem_page) {
  1710. void *dst;
  1711. dst = kmap_atomic(last_highmem_page);
  1712. copy_page(dst, buffer);
  1713. kunmap_atomic(dst);
  1714. last_highmem_page = NULL;
  1715. }
  1716. }
  1717. static inline int last_highmem_page_copied(void)
  1718. {
  1719. return !last_highmem_page;
  1720. }
  1721. static inline void free_highmem_data(void)
  1722. {
  1723. if (safe_highmem_bm)
  1724. memory_bm_free(safe_highmem_bm, PG_UNSAFE_CLEAR);
  1725. if (buffer)
  1726. free_image_page(buffer, PG_UNSAFE_CLEAR);
  1727. }
  1728. #else
  1729. static inline int get_safe_write_buffer(void) { return 0; }
  1730. static unsigned int
  1731. count_highmem_image_pages(struct memory_bitmap *bm) { return 0; }
  1732. static inline int
  1733. prepare_highmem_image(struct memory_bitmap *bm, unsigned int *nr_highmem_p)
  1734. {
  1735. return 0;
  1736. }
  1737. static inline void *
  1738. get_highmem_page_buffer(struct page *page, struct chain_allocator *ca)
  1739. {
  1740. return ERR_PTR(-EINVAL);
  1741. }
  1742. static inline void copy_last_highmem_page(void) {}
  1743. static inline int last_highmem_page_copied(void) { return 1; }
  1744. static inline void free_highmem_data(void) {}
  1745. #endif /* CONFIG_HIGHMEM */
  1746. /**
  1747. * prepare_image - use the memory bitmap @bm to mark the pages that will
  1748. * be overwritten in the process of restoring the system memory state
  1749. * from the suspend image ("unsafe" pages) and allocate memory for the
  1750. * image.
  1751. *
  1752. * The idea is to allocate a new memory bitmap first and then allocate
  1753. * as many pages as needed for the image data, but not to assign these
  1754. * pages to specific tasks initially. Instead, we just mark them as
  1755. * allocated and create a lists of "safe" pages that will be used
  1756. * later. On systems with high memory a list of "safe" highmem pages is
  1757. * also created.
  1758. */
  1759. #define PBES_PER_LINKED_PAGE (LINKED_PAGE_DATA_SIZE / sizeof(struct pbe))
  1760. static int
  1761. prepare_image(struct memory_bitmap *new_bm, struct memory_bitmap *bm)
  1762. {
  1763. unsigned int nr_pages, nr_highmem;
  1764. struct linked_page *sp_list, *lp;
  1765. int error;
  1766. /* If there is no highmem, the buffer will not be necessary */
  1767. free_image_page(buffer, PG_UNSAFE_CLEAR);
  1768. buffer = NULL;
  1769. nr_highmem = count_highmem_image_pages(bm);
  1770. error = mark_unsafe_pages(bm);
  1771. if (error)
  1772. goto Free;
  1773. error = memory_bm_create(new_bm, GFP_ATOMIC, PG_SAFE);
  1774. if (error)
  1775. goto Free;
  1776. duplicate_memory_bitmap(new_bm, bm);
  1777. memory_bm_free(bm, PG_UNSAFE_KEEP);
  1778. if (nr_highmem > 0) {
  1779. error = prepare_highmem_image(bm, &nr_highmem);
  1780. if (error)
  1781. goto Free;
  1782. }
  1783. /* Reserve some safe pages for potential later use.
  1784. *
  1785. * NOTE: This way we make sure there will be enough safe pages for the
  1786. * chain_alloc() in get_buffer(). It is a bit wasteful, but
  1787. * nr_copy_pages cannot be greater than 50% of the memory anyway.
  1788. */
  1789. sp_list = NULL;
  1790. /* nr_copy_pages cannot be lesser than allocated_unsafe_pages */
  1791. nr_pages = nr_copy_pages - nr_highmem - allocated_unsafe_pages;
  1792. nr_pages = DIV_ROUND_UP(nr_pages, PBES_PER_LINKED_PAGE);
  1793. while (nr_pages > 0) {
  1794. lp = get_image_page(GFP_ATOMIC, PG_SAFE);
  1795. if (!lp) {
  1796. error = -ENOMEM;
  1797. goto Free;
  1798. }
  1799. lp->next = sp_list;
  1800. sp_list = lp;
  1801. nr_pages--;
  1802. }
  1803. /* Preallocate memory for the image */
  1804. safe_pages_list = NULL;
  1805. nr_pages = nr_copy_pages - nr_highmem - allocated_unsafe_pages;
  1806. while (nr_pages > 0) {
  1807. lp = (struct linked_page *)get_zeroed_page(GFP_ATOMIC);
  1808. if (!lp) {
  1809. error = -ENOMEM;
  1810. goto Free;
  1811. }
  1812. if (!swsusp_page_is_free(virt_to_page(lp))) {
  1813. /* The page is "safe", add it to the list */
  1814. lp->next = safe_pages_list;
  1815. safe_pages_list = lp;
  1816. }
  1817. /* Mark the page as allocated */
  1818. swsusp_set_page_forbidden(virt_to_page(lp));
  1819. swsusp_set_page_free(virt_to_page(lp));
  1820. nr_pages--;
  1821. }
  1822. /* Free the reserved safe pages so that chain_alloc() can use them */
  1823. while (sp_list) {
  1824. lp = sp_list->next;
  1825. free_image_page(sp_list, PG_UNSAFE_CLEAR);
  1826. sp_list = lp;
  1827. }
  1828. return 0;
  1829. Free:
  1830. swsusp_free();
  1831. return error;
  1832. }
  1833. /**
  1834. * get_buffer - compute the address that snapshot_write_next() should
  1835. * set for its caller to write to.
  1836. */
  1837. static void *get_buffer(struct memory_bitmap *bm, struct chain_allocator *ca)
  1838. {
  1839. struct pbe *pbe;
  1840. struct page *page;
  1841. unsigned long pfn = memory_bm_next_pfn(bm);
  1842. if (pfn == BM_END_OF_MAP)
  1843. return ERR_PTR(-EFAULT);
  1844. page = pfn_to_page(pfn);
  1845. if (PageHighMem(page))
  1846. return get_highmem_page_buffer(page, ca);
  1847. if (swsusp_page_is_forbidden(page) && swsusp_page_is_free(page))
  1848. /* We have allocated the "original" page frame and we can
  1849. * use it directly to store the loaded page.
  1850. */
  1851. return page_address(page);
  1852. /* The "original" page frame has not been allocated and we have to
  1853. * use a "safe" page frame to store the loaded page.
  1854. */
  1855. pbe = chain_alloc(ca, sizeof(struct pbe));
  1856. if (!pbe) {
  1857. swsusp_free();
  1858. return ERR_PTR(-ENOMEM);
  1859. }
  1860. pbe->orig_address = page_address(page);
  1861. pbe->address = safe_pages_list;
  1862. safe_pages_list = safe_pages_list->next;
  1863. pbe->next = restore_pblist;
  1864. restore_pblist = pbe;
  1865. return pbe->address;
  1866. }
  1867. /**
  1868. * snapshot_write_next - used for writing the system memory snapshot.
  1869. *
  1870. * On the first call to it @handle should point to a zeroed
  1871. * snapshot_handle structure. The structure gets updated and a pointer
  1872. * to it should be passed to this function every next time.
  1873. *
  1874. * On success the function returns a positive number. Then, the caller
  1875. * is allowed to write up to the returned number of bytes to the memory
  1876. * location computed by the data_of() macro.
  1877. *
  1878. * The function returns 0 to indicate the "end of file" condition,
  1879. * and a negative number is returned on error. In such cases the
  1880. * structure pointed to by @handle is not updated and should not be used
  1881. * any more.
  1882. */
  1883. int snapshot_write_next(struct snapshot_handle *handle)
  1884. {
  1885. static struct chain_allocator ca;
  1886. int error = 0;
  1887. /* Check if we have already loaded the entire image */
  1888. if (handle->cur > 1 && handle->cur > nr_meta_pages + nr_copy_pages)
  1889. return 0;
  1890. handle->sync_read = 1;
  1891. if (!handle->cur) {
  1892. if (!buffer)
  1893. /* This makes the buffer be freed by swsusp_free() */
  1894. buffer = get_image_page(GFP_ATOMIC, PG_ANY);
  1895. if (!buffer)
  1896. return -ENOMEM;
  1897. handle->buffer = buffer;
  1898. } else if (handle->cur == 1) {
  1899. error = load_header(buffer);
  1900. if (error)
  1901. return error;
  1902. error = memory_bm_create(&copy_bm, GFP_ATOMIC, PG_ANY);
  1903. if (error)
  1904. return error;
  1905. /* Allocate buffer for page keys. */
  1906. error = page_key_alloc(nr_copy_pages);
  1907. if (error)
  1908. return error;
  1909. } else if (handle->cur <= nr_meta_pages + 1) {
  1910. error = unpack_orig_pfns(buffer, &copy_bm);
  1911. if (error)
  1912. return error;
  1913. if (handle->cur == nr_meta_pages + 1) {
  1914. error = prepare_image(&orig_bm, &copy_bm);
  1915. if (error)
  1916. return error;
  1917. chain_init(&ca, GFP_ATOMIC, PG_SAFE);
  1918. memory_bm_position_reset(&orig_bm);
  1919. restore_pblist = NULL;
  1920. handle->buffer = get_buffer(&orig_bm, &ca);
  1921. handle->sync_read = 0;
  1922. if (IS_ERR(handle->buffer))
  1923. return PTR_ERR(handle->buffer);
  1924. }
  1925. } else {
  1926. copy_last_highmem_page();
  1927. /* Restore page key for data page (s390 only). */
  1928. page_key_write(handle->buffer);
  1929. handle->buffer = get_buffer(&orig_bm, &ca);
  1930. if (IS_ERR(handle->buffer))
  1931. return PTR_ERR(handle->buffer);
  1932. if (handle->buffer != buffer)
  1933. handle->sync_read = 0;
  1934. }
  1935. handle->cur++;
  1936. return PAGE_SIZE;
  1937. }
  1938. /**
  1939. * snapshot_write_finalize - must be called after the last call to
  1940. * snapshot_write_next() in case the last page in the image happens
  1941. * to be a highmem page and its contents should be stored in the
  1942. * highmem. Additionally, it releases the memory that will not be
  1943. * used any more.
  1944. */
  1945. void snapshot_write_finalize(struct snapshot_handle *handle)
  1946. {
  1947. copy_last_highmem_page();
  1948. /* Restore page key for data page (s390 only). */
  1949. page_key_write(handle->buffer);
  1950. page_key_free();
  1951. /* Free only if we have loaded the image entirely */
  1952. if (handle->cur > 1 && handle->cur > nr_meta_pages + nr_copy_pages) {
  1953. memory_bm_free(&orig_bm, PG_UNSAFE_CLEAR);
  1954. free_highmem_data();
  1955. }
  1956. }
  1957. int snapshot_image_loaded(struct snapshot_handle *handle)
  1958. {
  1959. return !(!nr_copy_pages || !last_highmem_page_copied() ||
  1960. handle->cur <= nr_meta_pages + nr_copy_pages);
  1961. }
  1962. #ifdef CONFIG_HIGHMEM
  1963. /* Assumes that @buf is ready and points to a "safe" page */
  1964. static inline void
  1965. swap_two_pages_data(struct page *p1, struct page *p2, void *buf)
  1966. {
  1967. void *kaddr1, *kaddr2;
  1968. kaddr1 = kmap_atomic(p1);
  1969. kaddr2 = kmap_atomic(p2);
  1970. copy_page(buf, kaddr1);
  1971. copy_page(kaddr1, kaddr2);
  1972. copy_page(kaddr2, buf);
  1973. kunmap_atomic(kaddr2);
  1974. kunmap_atomic(kaddr1);
  1975. }
  1976. /**
  1977. * restore_highmem - for each highmem page that was allocated before
  1978. * the suspend and included in the suspend image, and also has been
  1979. * allocated by the "resume" kernel swap its current (ie. "before
  1980. * resume") contents with the previous (ie. "before suspend") one.
  1981. *
  1982. * If the resume eventually fails, we can call this function once
  1983. * again and restore the "before resume" highmem state.
  1984. */
  1985. int restore_highmem(void)
  1986. {
  1987. struct highmem_pbe *pbe = highmem_pblist;
  1988. void *buf;
  1989. if (!pbe)
  1990. return 0;
  1991. buf = get_image_page(GFP_ATOMIC, PG_SAFE);
  1992. if (!buf)
  1993. return -ENOMEM;
  1994. while (pbe) {
  1995. swap_two_pages_data(pbe->copy_page, pbe->orig_page, buf);
  1996. pbe = pbe->next;
  1997. }
  1998. free_image_page(buf, PG_UNSAFE_CLEAR);
  1999. return 0;
  2000. }
  2001. #endif /* CONFIG_HIGHMEM */