khugepaged.c 50 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994
  1. // SPDX-License-Identifier: GPL-2.0
  2. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  3. #include <linux/mm.h>
  4. #include <linux/sched.h>
  5. #include <linux/sched/mm.h>
  6. #include <linux/sched/coredump.h>
  7. #include <linux/mmu_notifier.h>
  8. #include <linux/rmap.h>
  9. #include <linux/swap.h>
  10. #include <linux/mm_inline.h>
  11. #include <linux/kthread.h>
  12. #include <linux/khugepaged.h>
  13. #include <linux/freezer.h>
  14. #include <linux/mman.h>
  15. #include <linux/hashtable.h>
  16. #include <linux/userfaultfd_k.h>
  17. #include <linux/page_idle.h>
  18. #include <linux/swapops.h>
  19. #include <linux/shmem_fs.h>
  20. #include <asm/tlb.h>
  21. #include <asm/pgalloc.h>
  22. #include "internal.h"
  23. enum scan_result {
  24. SCAN_FAIL,
  25. SCAN_SUCCEED,
  26. SCAN_PMD_NULL,
  27. SCAN_EXCEED_NONE_PTE,
  28. SCAN_PTE_NON_PRESENT,
  29. SCAN_PAGE_RO,
  30. SCAN_LACK_REFERENCED_PAGE,
  31. SCAN_PAGE_NULL,
  32. SCAN_SCAN_ABORT,
  33. SCAN_PAGE_COUNT,
  34. SCAN_PAGE_LRU,
  35. SCAN_PAGE_LOCK,
  36. SCAN_PAGE_ANON,
  37. SCAN_PAGE_COMPOUND,
  38. SCAN_ANY_PROCESS,
  39. SCAN_VMA_NULL,
  40. SCAN_VMA_CHECK,
  41. SCAN_ADDRESS_RANGE,
  42. SCAN_SWAP_CACHE_PAGE,
  43. SCAN_DEL_PAGE_LRU,
  44. SCAN_ALLOC_HUGE_PAGE_FAIL,
  45. SCAN_CGROUP_CHARGE_FAIL,
  46. SCAN_EXCEED_SWAP_PTE,
  47. SCAN_TRUNCATED,
  48. };
  49. #define CREATE_TRACE_POINTS
  50. #include <trace/events/huge_memory.h>
  51. static struct task_struct *khugepaged_thread __read_mostly;
  52. static DEFINE_MUTEX(khugepaged_mutex);
  53. /* default scan 8*512 pte (or vmas) every 30 second */
  54. static unsigned int khugepaged_pages_to_scan __read_mostly;
  55. static unsigned int khugepaged_pages_collapsed;
  56. static unsigned int khugepaged_full_scans;
  57. static unsigned int khugepaged_scan_sleep_millisecs __read_mostly = 10000;
  58. /* during fragmentation poll the hugepage allocator once every minute */
  59. static unsigned int khugepaged_alloc_sleep_millisecs __read_mostly = 60000;
  60. static unsigned long khugepaged_sleep_expire;
  61. static DEFINE_SPINLOCK(khugepaged_mm_lock);
  62. static DECLARE_WAIT_QUEUE_HEAD(khugepaged_wait);
  63. /*
  64. * default collapse hugepages if there is at least one pte mapped like
  65. * it would have happened if the vma was large enough during page
  66. * fault.
  67. */
  68. static unsigned int khugepaged_max_ptes_none __read_mostly;
  69. static unsigned int khugepaged_max_ptes_swap __read_mostly;
  70. #define MM_SLOTS_HASH_BITS 10
  71. static __read_mostly DEFINE_HASHTABLE(mm_slots_hash, MM_SLOTS_HASH_BITS);
  72. static struct kmem_cache *mm_slot_cache __read_mostly;
  73. /**
  74. * struct mm_slot - hash lookup from mm to mm_slot
  75. * @hash: hash collision list
  76. * @mm_node: khugepaged scan list headed in khugepaged_scan.mm_head
  77. * @mm: the mm that this information is valid for
  78. */
  79. struct mm_slot {
  80. struct hlist_node hash;
  81. struct list_head mm_node;
  82. struct mm_struct *mm;
  83. };
  84. /**
  85. * struct khugepaged_scan - cursor for scanning
  86. * @mm_head: the head of the mm list to scan
  87. * @mm_slot: the current mm_slot we are scanning
  88. * @address: the next address inside that to be scanned
  89. *
  90. * There is only the one khugepaged_scan instance of this cursor structure.
  91. */
  92. struct khugepaged_scan {
  93. struct list_head mm_head;
  94. struct mm_slot *mm_slot;
  95. unsigned long address;
  96. };
  97. static struct khugepaged_scan khugepaged_scan = {
  98. .mm_head = LIST_HEAD_INIT(khugepaged_scan.mm_head),
  99. };
  100. #ifdef CONFIG_SYSFS
  101. static ssize_t scan_sleep_millisecs_show(struct kobject *kobj,
  102. struct kobj_attribute *attr,
  103. char *buf)
  104. {
  105. return sprintf(buf, "%u\n", khugepaged_scan_sleep_millisecs);
  106. }
  107. static ssize_t scan_sleep_millisecs_store(struct kobject *kobj,
  108. struct kobj_attribute *attr,
  109. const char *buf, size_t count)
  110. {
  111. unsigned long msecs;
  112. int err;
  113. err = kstrtoul(buf, 10, &msecs);
  114. if (err || msecs > UINT_MAX)
  115. return -EINVAL;
  116. khugepaged_scan_sleep_millisecs = msecs;
  117. khugepaged_sleep_expire = 0;
  118. wake_up_interruptible(&khugepaged_wait);
  119. return count;
  120. }
  121. static struct kobj_attribute scan_sleep_millisecs_attr =
  122. __ATTR(scan_sleep_millisecs, 0644, scan_sleep_millisecs_show,
  123. scan_sleep_millisecs_store);
  124. static ssize_t alloc_sleep_millisecs_show(struct kobject *kobj,
  125. struct kobj_attribute *attr,
  126. char *buf)
  127. {
  128. return sprintf(buf, "%u\n", khugepaged_alloc_sleep_millisecs);
  129. }
  130. static ssize_t alloc_sleep_millisecs_store(struct kobject *kobj,
  131. struct kobj_attribute *attr,
  132. const char *buf, size_t count)
  133. {
  134. unsigned long msecs;
  135. int err;
  136. err = kstrtoul(buf, 10, &msecs);
  137. if (err || msecs > UINT_MAX)
  138. return -EINVAL;
  139. khugepaged_alloc_sleep_millisecs = msecs;
  140. khugepaged_sleep_expire = 0;
  141. wake_up_interruptible(&khugepaged_wait);
  142. return count;
  143. }
  144. static struct kobj_attribute alloc_sleep_millisecs_attr =
  145. __ATTR(alloc_sleep_millisecs, 0644, alloc_sleep_millisecs_show,
  146. alloc_sleep_millisecs_store);
  147. static ssize_t pages_to_scan_show(struct kobject *kobj,
  148. struct kobj_attribute *attr,
  149. char *buf)
  150. {
  151. return sprintf(buf, "%u\n", khugepaged_pages_to_scan);
  152. }
  153. static ssize_t pages_to_scan_store(struct kobject *kobj,
  154. struct kobj_attribute *attr,
  155. const char *buf, size_t count)
  156. {
  157. int err;
  158. unsigned long pages;
  159. err = kstrtoul(buf, 10, &pages);
  160. if (err || !pages || pages > UINT_MAX)
  161. return -EINVAL;
  162. khugepaged_pages_to_scan = pages;
  163. return count;
  164. }
  165. static struct kobj_attribute pages_to_scan_attr =
  166. __ATTR(pages_to_scan, 0644, pages_to_scan_show,
  167. pages_to_scan_store);
  168. static ssize_t pages_collapsed_show(struct kobject *kobj,
  169. struct kobj_attribute *attr,
  170. char *buf)
  171. {
  172. return sprintf(buf, "%u\n", khugepaged_pages_collapsed);
  173. }
  174. static struct kobj_attribute pages_collapsed_attr =
  175. __ATTR_RO(pages_collapsed);
  176. static ssize_t full_scans_show(struct kobject *kobj,
  177. struct kobj_attribute *attr,
  178. char *buf)
  179. {
  180. return sprintf(buf, "%u\n", khugepaged_full_scans);
  181. }
  182. static struct kobj_attribute full_scans_attr =
  183. __ATTR_RO(full_scans);
  184. static ssize_t khugepaged_defrag_show(struct kobject *kobj,
  185. struct kobj_attribute *attr, char *buf)
  186. {
  187. return single_hugepage_flag_show(kobj, attr, buf,
  188. TRANSPARENT_HUGEPAGE_DEFRAG_KHUGEPAGED_FLAG);
  189. }
  190. static ssize_t khugepaged_defrag_store(struct kobject *kobj,
  191. struct kobj_attribute *attr,
  192. const char *buf, size_t count)
  193. {
  194. return single_hugepage_flag_store(kobj, attr, buf, count,
  195. TRANSPARENT_HUGEPAGE_DEFRAG_KHUGEPAGED_FLAG);
  196. }
  197. static struct kobj_attribute khugepaged_defrag_attr =
  198. __ATTR(defrag, 0644, khugepaged_defrag_show,
  199. khugepaged_defrag_store);
  200. /*
  201. * max_ptes_none controls if khugepaged should collapse hugepages over
  202. * any unmapped ptes in turn potentially increasing the memory
  203. * footprint of the vmas. When max_ptes_none is 0 khugepaged will not
  204. * reduce the available free memory in the system as it
  205. * runs. Increasing max_ptes_none will instead potentially reduce the
  206. * free memory in the system during the khugepaged scan.
  207. */
  208. static ssize_t khugepaged_max_ptes_none_show(struct kobject *kobj,
  209. struct kobj_attribute *attr,
  210. char *buf)
  211. {
  212. return sprintf(buf, "%u\n", khugepaged_max_ptes_none);
  213. }
  214. static ssize_t khugepaged_max_ptes_none_store(struct kobject *kobj,
  215. struct kobj_attribute *attr,
  216. const char *buf, size_t count)
  217. {
  218. int err;
  219. unsigned long max_ptes_none;
  220. err = kstrtoul(buf, 10, &max_ptes_none);
  221. if (err || max_ptes_none > HPAGE_PMD_NR-1)
  222. return -EINVAL;
  223. khugepaged_max_ptes_none = max_ptes_none;
  224. return count;
  225. }
  226. static struct kobj_attribute khugepaged_max_ptes_none_attr =
  227. __ATTR(max_ptes_none, 0644, khugepaged_max_ptes_none_show,
  228. khugepaged_max_ptes_none_store);
  229. static ssize_t khugepaged_max_ptes_swap_show(struct kobject *kobj,
  230. struct kobj_attribute *attr,
  231. char *buf)
  232. {
  233. return sprintf(buf, "%u\n", khugepaged_max_ptes_swap);
  234. }
  235. static ssize_t khugepaged_max_ptes_swap_store(struct kobject *kobj,
  236. struct kobj_attribute *attr,
  237. const char *buf, size_t count)
  238. {
  239. int err;
  240. unsigned long max_ptes_swap;
  241. err = kstrtoul(buf, 10, &max_ptes_swap);
  242. if (err || max_ptes_swap > HPAGE_PMD_NR-1)
  243. return -EINVAL;
  244. khugepaged_max_ptes_swap = max_ptes_swap;
  245. return count;
  246. }
  247. static struct kobj_attribute khugepaged_max_ptes_swap_attr =
  248. __ATTR(max_ptes_swap, 0644, khugepaged_max_ptes_swap_show,
  249. khugepaged_max_ptes_swap_store);
  250. static struct attribute *khugepaged_attr[] = {
  251. &khugepaged_defrag_attr.attr,
  252. &khugepaged_max_ptes_none_attr.attr,
  253. &pages_to_scan_attr.attr,
  254. &pages_collapsed_attr.attr,
  255. &full_scans_attr.attr,
  256. &scan_sleep_millisecs_attr.attr,
  257. &alloc_sleep_millisecs_attr.attr,
  258. &khugepaged_max_ptes_swap_attr.attr,
  259. NULL,
  260. };
  261. struct attribute_group khugepaged_attr_group = {
  262. .attrs = khugepaged_attr,
  263. .name = "khugepaged",
  264. };
  265. #endif /* CONFIG_SYSFS */
  266. #define VM_NO_KHUGEPAGED (VM_SPECIAL | VM_HUGETLB)
  267. int hugepage_madvise(struct vm_area_struct *vma,
  268. unsigned long *vm_flags, int advice)
  269. {
  270. switch (advice) {
  271. case MADV_HUGEPAGE:
  272. #ifdef CONFIG_S390
  273. /*
  274. * qemu blindly sets MADV_HUGEPAGE on all allocations, but s390
  275. * can't handle this properly after s390_enable_sie, so we simply
  276. * ignore the madvise to prevent qemu from causing a SIGSEGV.
  277. */
  278. if (mm_has_pgste(vma->vm_mm))
  279. return 0;
  280. #endif
  281. *vm_flags &= ~VM_NOHUGEPAGE;
  282. *vm_flags |= VM_HUGEPAGE;
  283. /*
  284. * If the vma become good for khugepaged to scan,
  285. * register it here without waiting a page fault that
  286. * may not happen any time soon.
  287. */
  288. if (!(*vm_flags & VM_NO_KHUGEPAGED) &&
  289. khugepaged_enter_vma_merge(vma, *vm_flags))
  290. return -ENOMEM;
  291. break;
  292. case MADV_NOHUGEPAGE:
  293. *vm_flags &= ~VM_HUGEPAGE;
  294. *vm_flags |= VM_NOHUGEPAGE;
  295. /*
  296. * Setting VM_NOHUGEPAGE will prevent khugepaged from scanning
  297. * this vma even if we leave the mm registered in khugepaged if
  298. * it got registered before VM_NOHUGEPAGE was set.
  299. */
  300. break;
  301. }
  302. return 0;
  303. }
  304. int __init khugepaged_init(void)
  305. {
  306. mm_slot_cache = kmem_cache_create("khugepaged_mm_slot",
  307. sizeof(struct mm_slot),
  308. __alignof__(struct mm_slot), 0, NULL);
  309. if (!mm_slot_cache)
  310. return -ENOMEM;
  311. khugepaged_pages_to_scan = HPAGE_PMD_NR * 8;
  312. khugepaged_max_ptes_none = HPAGE_PMD_NR - 1;
  313. khugepaged_max_ptes_swap = HPAGE_PMD_NR / 8;
  314. return 0;
  315. }
  316. void __init khugepaged_destroy(void)
  317. {
  318. kmem_cache_destroy(mm_slot_cache);
  319. }
  320. static inline struct mm_slot *alloc_mm_slot(void)
  321. {
  322. if (!mm_slot_cache) /* initialization failed */
  323. return NULL;
  324. return kmem_cache_zalloc(mm_slot_cache, GFP_KERNEL);
  325. }
  326. static inline void free_mm_slot(struct mm_slot *mm_slot)
  327. {
  328. kmem_cache_free(mm_slot_cache, mm_slot);
  329. }
  330. static struct mm_slot *get_mm_slot(struct mm_struct *mm)
  331. {
  332. struct mm_slot *mm_slot;
  333. hash_for_each_possible(mm_slots_hash, mm_slot, hash, (unsigned long)mm)
  334. if (mm == mm_slot->mm)
  335. return mm_slot;
  336. return NULL;
  337. }
  338. static void insert_to_mm_slots_hash(struct mm_struct *mm,
  339. struct mm_slot *mm_slot)
  340. {
  341. mm_slot->mm = mm;
  342. hash_add(mm_slots_hash, &mm_slot->hash, (long)mm);
  343. }
  344. static inline int khugepaged_test_exit(struct mm_struct *mm)
  345. {
  346. return atomic_read(&mm->mm_users) == 0 || !mmget_still_valid(mm);
  347. }
  348. int __khugepaged_enter(struct mm_struct *mm)
  349. {
  350. struct mm_slot *mm_slot;
  351. int wakeup;
  352. mm_slot = alloc_mm_slot();
  353. if (!mm_slot)
  354. return -ENOMEM;
  355. /* __khugepaged_exit() must not run from under us */
  356. VM_BUG_ON_MM(atomic_read(&mm->mm_users) == 0, mm);
  357. if (unlikely(test_and_set_bit(MMF_VM_HUGEPAGE, &mm->flags))) {
  358. free_mm_slot(mm_slot);
  359. return 0;
  360. }
  361. spin_lock(&khugepaged_mm_lock);
  362. insert_to_mm_slots_hash(mm, mm_slot);
  363. /*
  364. * Insert just behind the scanning cursor, to let the area settle
  365. * down a little.
  366. */
  367. wakeup = list_empty(&khugepaged_scan.mm_head);
  368. list_add_tail(&mm_slot->mm_node, &khugepaged_scan.mm_head);
  369. spin_unlock(&khugepaged_mm_lock);
  370. mmgrab(mm);
  371. if (wakeup)
  372. wake_up_interruptible(&khugepaged_wait);
  373. return 0;
  374. }
  375. int khugepaged_enter_vma_merge(struct vm_area_struct *vma,
  376. unsigned long vm_flags)
  377. {
  378. unsigned long hstart, hend;
  379. if (!vma->anon_vma)
  380. /*
  381. * Not yet faulted in so we will register later in the
  382. * page fault if needed.
  383. */
  384. return 0;
  385. if (vma->vm_ops || (vm_flags & VM_NO_KHUGEPAGED))
  386. /* khugepaged not yet working on file or special mappings */
  387. return 0;
  388. hstart = (vma->vm_start + ~HPAGE_PMD_MASK) & HPAGE_PMD_MASK;
  389. hend = vma->vm_end & HPAGE_PMD_MASK;
  390. if (hstart < hend)
  391. return khugepaged_enter(vma, vm_flags);
  392. return 0;
  393. }
  394. void __khugepaged_exit(struct mm_struct *mm)
  395. {
  396. struct mm_slot *mm_slot;
  397. int free = 0;
  398. spin_lock(&khugepaged_mm_lock);
  399. mm_slot = get_mm_slot(mm);
  400. if (mm_slot && khugepaged_scan.mm_slot != mm_slot) {
  401. hash_del(&mm_slot->hash);
  402. list_del(&mm_slot->mm_node);
  403. free = 1;
  404. }
  405. spin_unlock(&khugepaged_mm_lock);
  406. if (free) {
  407. clear_bit(MMF_VM_HUGEPAGE, &mm->flags);
  408. free_mm_slot(mm_slot);
  409. mmdrop(mm);
  410. } else if (mm_slot) {
  411. /*
  412. * This is required to serialize against
  413. * khugepaged_test_exit() (which is guaranteed to run
  414. * under mmap sem read mode). Stop here (after we
  415. * return all pagetables will be destroyed) until
  416. * khugepaged has finished working on the pagetables
  417. * under the mmap_sem.
  418. */
  419. down_write(&mm->mmap_sem);
  420. up_write(&mm->mmap_sem);
  421. }
  422. }
  423. static void release_pte_page(struct page *page)
  424. {
  425. dec_node_page_state(page, NR_ISOLATED_ANON + page_is_file_cache(page));
  426. unlock_page(page);
  427. putback_lru_page(page);
  428. }
  429. static void release_pte_pages(pte_t *pte, pte_t *_pte)
  430. {
  431. while (--_pte >= pte) {
  432. pte_t pteval = *_pte;
  433. if (!pte_none(pteval) && !is_zero_pfn(pte_pfn(pteval)))
  434. release_pte_page(pte_page(pteval));
  435. }
  436. }
  437. static int __collapse_huge_page_isolate(struct vm_area_struct *vma,
  438. unsigned long address,
  439. pte_t *pte)
  440. {
  441. struct page *page = NULL;
  442. pte_t *_pte;
  443. int none_or_zero = 0, result = 0, referenced = 0;
  444. bool writable = false;
  445. for (_pte = pte; _pte < pte+HPAGE_PMD_NR;
  446. _pte++, address += PAGE_SIZE) {
  447. pte_t pteval = *_pte;
  448. if (pte_none(pteval) || (pte_present(pteval) &&
  449. is_zero_pfn(pte_pfn(pteval)))) {
  450. if (!userfaultfd_armed(vma) &&
  451. ++none_or_zero <= khugepaged_max_ptes_none) {
  452. continue;
  453. } else {
  454. result = SCAN_EXCEED_NONE_PTE;
  455. goto out;
  456. }
  457. }
  458. if (!pte_present(pteval)) {
  459. result = SCAN_PTE_NON_PRESENT;
  460. goto out;
  461. }
  462. page = vm_normal_page(vma, address, pteval);
  463. if (unlikely(!page)) {
  464. result = SCAN_PAGE_NULL;
  465. goto out;
  466. }
  467. /* TODO: teach khugepaged to collapse THP mapped with pte */
  468. if (PageCompound(page)) {
  469. result = SCAN_PAGE_COMPOUND;
  470. goto out;
  471. }
  472. VM_BUG_ON_PAGE(!PageAnon(page), page);
  473. /*
  474. * We can do it before isolate_lru_page because the
  475. * page can't be freed from under us. NOTE: PG_lock
  476. * is needed to serialize against split_huge_page
  477. * when invoked from the VM.
  478. */
  479. if (!trylock_page(page)) {
  480. result = SCAN_PAGE_LOCK;
  481. goto out;
  482. }
  483. /*
  484. * cannot use mapcount: can't collapse if there's a gup pin.
  485. * The page must only be referenced by the scanned process
  486. * and page swap cache.
  487. */
  488. if (page_count(page) != 1 + PageSwapCache(page)) {
  489. unlock_page(page);
  490. result = SCAN_PAGE_COUNT;
  491. goto out;
  492. }
  493. if (pte_write(pteval)) {
  494. writable = true;
  495. } else {
  496. if (PageSwapCache(page) &&
  497. !reuse_swap_page(page, NULL)) {
  498. unlock_page(page);
  499. result = SCAN_SWAP_CACHE_PAGE;
  500. goto out;
  501. }
  502. /*
  503. * Page is not in the swap cache. It can be collapsed
  504. * into a THP.
  505. */
  506. }
  507. /*
  508. * Isolate the page to avoid collapsing an hugepage
  509. * currently in use by the VM.
  510. */
  511. if (isolate_lru_page(page)) {
  512. unlock_page(page);
  513. result = SCAN_DEL_PAGE_LRU;
  514. goto out;
  515. }
  516. inc_node_page_state(page,
  517. NR_ISOLATED_ANON + page_is_file_cache(page));
  518. VM_BUG_ON_PAGE(!PageLocked(page), page);
  519. VM_BUG_ON_PAGE(PageLRU(page), page);
  520. /* There should be enough young pte to collapse the page */
  521. if (pte_young(pteval) ||
  522. page_is_young(page) || PageReferenced(page) ||
  523. mmu_notifier_test_young(vma->vm_mm, address))
  524. referenced++;
  525. }
  526. if (unlikely(!writable)) {
  527. result = SCAN_PAGE_RO;
  528. } else if (unlikely(!referenced)) {
  529. result = SCAN_LACK_REFERENCED_PAGE;
  530. } else {
  531. result = SCAN_SUCCEED;
  532. trace_mm_collapse_huge_page_isolate(page, none_or_zero,
  533. referenced, writable, result);
  534. return 1;
  535. }
  536. out:
  537. release_pte_pages(pte, _pte);
  538. trace_mm_collapse_huge_page_isolate(page, none_or_zero,
  539. referenced, writable, result);
  540. return 0;
  541. }
  542. static void __collapse_huge_page_copy(pte_t *pte, struct page *page,
  543. struct vm_area_struct *vma,
  544. unsigned long address,
  545. spinlock_t *ptl)
  546. {
  547. pte_t *_pte;
  548. for (_pte = pte; _pte < pte + HPAGE_PMD_NR;
  549. _pte++, page++, address += PAGE_SIZE) {
  550. pte_t pteval = *_pte;
  551. struct page *src_page;
  552. if (pte_none(pteval) || is_zero_pfn(pte_pfn(pteval))) {
  553. clear_user_highpage(page, address);
  554. add_mm_counter(vma->vm_mm, MM_ANONPAGES, 1);
  555. if (is_zero_pfn(pte_pfn(pteval))) {
  556. /*
  557. * ptl mostly unnecessary.
  558. */
  559. spin_lock(ptl);
  560. /*
  561. * paravirt calls inside pte_clear here are
  562. * superfluous.
  563. */
  564. pte_clear(vma->vm_mm, address, _pte);
  565. spin_unlock(ptl);
  566. }
  567. } else {
  568. src_page = pte_page(pteval);
  569. copy_user_highpage(page, src_page, address, vma);
  570. VM_BUG_ON_PAGE(page_mapcount(src_page) != 1, src_page);
  571. release_pte_page(src_page);
  572. /*
  573. * ptl mostly unnecessary, but preempt has to
  574. * be disabled to update the per-cpu stats
  575. * inside page_remove_rmap().
  576. */
  577. spin_lock(ptl);
  578. /*
  579. * paravirt calls inside pte_clear here are
  580. * superfluous.
  581. */
  582. pte_clear(vma->vm_mm, address, _pte);
  583. page_remove_rmap(src_page, false);
  584. spin_unlock(ptl);
  585. free_page_and_swap_cache(src_page);
  586. }
  587. }
  588. }
  589. static void khugepaged_alloc_sleep(void)
  590. {
  591. DEFINE_WAIT(wait);
  592. add_wait_queue(&khugepaged_wait, &wait);
  593. freezable_schedule_timeout_interruptible(
  594. msecs_to_jiffies(khugepaged_alloc_sleep_millisecs));
  595. remove_wait_queue(&khugepaged_wait, &wait);
  596. }
  597. static int khugepaged_node_load[MAX_NUMNODES];
  598. static bool khugepaged_scan_abort(int nid)
  599. {
  600. int i;
  601. /*
  602. * If node_reclaim_mode is disabled, then no extra effort is made to
  603. * allocate memory locally.
  604. */
  605. if (!node_reclaim_mode)
  606. return false;
  607. /* If there is a count for this node already, it must be acceptable */
  608. if (khugepaged_node_load[nid])
  609. return false;
  610. for (i = 0; i < MAX_NUMNODES; i++) {
  611. if (!khugepaged_node_load[i])
  612. continue;
  613. if (node_distance(nid, i) > RECLAIM_DISTANCE)
  614. return true;
  615. }
  616. return false;
  617. }
  618. /* Defrag for khugepaged will enter direct reclaim/compaction if necessary */
  619. static inline gfp_t alloc_hugepage_khugepaged_gfpmask(void)
  620. {
  621. return khugepaged_defrag() ? GFP_TRANSHUGE : GFP_TRANSHUGE_LIGHT;
  622. }
  623. #ifdef CONFIG_NUMA
  624. static int khugepaged_find_target_node(void)
  625. {
  626. static int last_khugepaged_target_node = NUMA_NO_NODE;
  627. int nid, target_node = 0, max_value = 0;
  628. /* find first node with max normal pages hit */
  629. for (nid = 0; nid < MAX_NUMNODES; nid++)
  630. if (khugepaged_node_load[nid] > max_value) {
  631. max_value = khugepaged_node_load[nid];
  632. target_node = nid;
  633. }
  634. /* do some balance if several nodes have the same hit record */
  635. if (target_node <= last_khugepaged_target_node)
  636. for (nid = last_khugepaged_target_node + 1; nid < MAX_NUMNODES;
  637. nid++)
  638. if (max_value == khugepaged_node_load[nid]) {
  639. target_node = nid;
  640. break;
  641. }
  642. last_khugepaged_target_node = target_node;
  643. return target_node;
  644. }
  645. static bool khugepaged_prealloc_page(struct page **hpage, bool *wait)
  646. {
  647. if (IS_ERR(*hpage)) {
  648. if (!*wait)
  649. return false;
  650. *wait = false;
  651. *hpage = NULL;
  652. khugepaged_alloc_sleep();
  653. } else if (*hpage) {
  654. put_page(*hpage);
  655. *hpage = NULL;
  656. }
  657. return true;
  658. }
  659. static struct page *
  660. khugepaged_alloc_page(struct page **hpage, gfp_t gfp, int node)
  661. {
  662. VM_BUG_ON_PAGE(*hpage, *hpage);
  663. *hpage = __alloc_pages_node(node, gfp, HPAGE_PMD_ORDER);
  664. if (unlikely(!*hpage)) {
  665. count_vm_event(THP_COLLAPSE_ALLOC_FAILED);
  666. *hpage = ERR_PTR(-ENOMEM);
  667. return NULL;
  668. }
  669. prep_transhuge_page(*hpage);
  670. count_vm_event(THP_COLLAPSE_ALLOC);
  671. return *hpage;
  672. }
  673. #else
  674. static int khugepaged_find_target_node(void)
  675. {
  676. return 0;
  677. }
  678. static inline struct page *alloc_khugepaged_hugepage(void)
  679. {
  680. struct page *page;
  681. page = alloc_pages(alloc_hugepage_khugepaged_gfpmask(),
  682. HPAGE_PMD_ORDER);
  683. if (page)
  684. prep_transhuge_page(page);
  685. return page;
  686. }
  687. static struct page *khugepaged_alloc_hugepage(bool *wait)
  688. {
  689. struct page *hpage;
  690. do {
  691. hpage = alloc_khugepaged_hugepage();
  692. if (!hpage) {
  693. count_vm_event(THP_COLLAPSE_ALLOC_FAILED);
  694. if (!*wait)
  695. return NULL;
  696. *wait = false;
  697. khugepaged_alloc_sleep();
  698. } else
  699. count_vm_event(THP_COLLAPSE_ALLOC);
  700. } while (unlikely(!hpage) && likely(khugepaged_enabled()));
  701. return hpage;
  702. }
  703. static bool khugepaged_prealloc_page(struct page **hpage, bool *wait)
  704. {
  705. /*
  706. * If the hpage allocated earlier was briefly exposed in page cache
  707. * before collapse_file() failed, it is possible that racing lookups
  708. * have not yet completed, and would then be unpleasantly surprised by
  709. * finding the hpage reused for the same mapping at a different offset.
  710. * Just release the previous allocation if there is any danger of that.
  711. */
  712. if (*hpage && page_count(*hpage) > 1) {
  713. put_page(*hpage);
  714. *hpage = NULL;
  715. }
  716. if (!*hpage)
  717. *hpage = khugepaged_alloc_hugepage(wait);
  718. if (unlikely(!*hpage))
  719. return false;
  720. return true;
  721. }
  722. static struct page *
  723. khugepaged_alloc_page(struct page **hpage, gfp_t gfp, int node)
  724. {
  725. VM_BUG_ON(!*hpage);
  726. return *hpage;
  727. }
  728. #endif
  729. static bool hugepage_vma_check(struct vm_area_struct *vma)
  730. {
  731. if ((!(vma->vm_flags & VM_HUGEPAGE) && !khugepaged_always()) ||
  732. (vma->vm_flags & VM_NOHUGEPAGE) ||
  733. test_bit(MMF_DISABLE_THP, &vma->vm_mm->flags))
  734. return false;
  735. if (shmem_file(vma->vm_file)) {
  736. if (!IS_ENABLED(CONFIG_TRANSPARENT_HUGE_PAGECACHE))
  737. return false;
  738. return IS_ALIGNED((vma->vm_start >> PAGE_SHIFT) - vma->vm_pgoff,
  739. HPAGE_PMD_NR);
  740. }
  741. if (!vma->anon_vma || vma->vm_ops)
  742. return false;
  743. if (is_vma_temporary_stack(vma))
  744. return false;
  745. return !(vma->vm_flags & VM_NO_KHUGEPAGED);
  746. }
  747. /*
  748. * If mmap_sem temporarily dropped, revalidate vma
  749. * before taking mmap_sem.
  750. * Return 0 if succeeds, otherwise return none-zero
  751. * value (scan code).
  752. */
  753. static int hugepage_vma_revalidate(struct mm_struct *mm, unsigned long address,
  754. struct vm_area_struct **vmap)
  755. {
  756. struct vm_area_struct *vma;
  757. unsigned long hstart, hend;
  758. if (unlikely(khugepaged_test_exit(mm)))
  759. return SCAN_ANY_PROCESS;
  760. *vmap = vma = find_vma(mm, address);
  761. if (!vma)
  762. return SCAN_VMA_NULL;
  763. hstart = (vma->vm_start + ~HPAGE_PMD_MASK) & HPAGE_PMD_MASK;
  764. hend = vma->vm_end & HPAGE_PMD_MASK;
  765. if (address < hstart || address + HPAGE_PMD_SIZE > hend)
  766. return SCAN_ADDRESS_RANGE;
  767. if (!hugepage_vma_check(vma))
  768. return SCAN_VMA_CHECK;
  769. return 0;
  770. }
  771. /*
  772. * Bring missing pages in from swap, to complete THP collapse.
  773. * Only done if khugepaged_scan_pmd believes it is worthwhile.
  774. *
  775. * Called and returns without pte mapped or spinlocks held,
  776. * but with mmap_sem held to protect against vma changes.
  777. */
  778. static bool __collapse_huge_page_swapin(struct mm_struct *mm,
  779. struct vm_area_struct *vma,
  780. unsigned long address, pmd_t *pmd,
  781. int referenced)
  782. {
  783. int swapped_in = 0, ret = 0;
  784. struct vm_fault vmf = {
  785. .vma = vma,
  786. .address = address,
  787. .flags = FAULT_FLAG_ALLOW_RETRY,
  788. .pmd = pmd,
  789. .pgoff = linear_page_index(vma, address),
  790. .vma_flags = vma->vm_flags,
  791. .vma_page_prot = vma->vm_page_prot,
  792. };
  793. /* we only decide to swapin, if there is enough young ptes */
  794. if (referenced < HPAGE_PMD_NR/2) {
  795. trace_mm_collapse_huge_page_swapin(mm, swapped_in, referenced, 0);
  796. return false;
  797. }
  798. vmf.pte = pte_offset_map(pmd, address);
  799. for (; vmf.address < address + HPAGE_PMD_NR*PAGE_SIZE;
  800. vmf.pte++, vmf.address += PAGE_SIZE) {
  801. vmf.orig_pte = *vmf.pte;
  802. if (!is_swap_pte(vmf.orig_pte))
  803. continue;
  804. swapped_in++;
  805. ret = do_swap_page(&vmf);
  806. /* do_swap_page returns VM_FAULT_RETRY with released mmap_sem */
  807. if (ret & VM_FAULT_RETRY) {
  808. down_read(&mm->mmap_sem);
  809. if (hugepage_vma_revalidate(mm, address, &vmf.vma)) {
  810. /* vma is no longer available, don't continue to swapin */
  811. trace_mm_collapse_huge_page_swapin(mm, swapped_in, referenced, 0);
  812. return false;
  813. }
  814. /* check if the pmd is still valid */
  815. if (mm_find_pmd(mm, address) != pmd) {
  816. trace_mm_collapse_huge_page_swapin(mm, swapped_in, referenced, 0);
  817. return false;
  818. }
  819. }
  820. if (ret & VM_FAULT_ERROR) {
  821. trace_mm_collapse_huge_page_swapin(mm, swapped_in, referenced, 0);
  822. return false;
  823. }
  824. /* pte is unmapped now, we need to map it */
  825. vmf.pte = pte_offset_map(pmd, vmf.address);
  826. }
  827. vmf.pte--;
  828. pte_unmap(vmf.pte);
  829. trace_mm_collapse_huge_page_swapin(mm, swapped_in, referenced, 1);
  830. return true;
  831. }
  832. static void collapse_huge_page(struct mm_struct *mm,
  833. unsigned long address,
  834. struct page **hpage,
  835. int node, int referenced)
  836. {
  837. pmd_t *pmd, _pmd;
  838. pte_t *pte;
  839. pgtable_t pgtable;
  840. struct page *new_page;
  841. spinlock_t *pmd_ptl, *pte_ptl;
  842. int isolated = 0, result = 0;
  843. struct mem_cgroup *memcg;
  844. struct vm_area_struct *vma;
  845. unsigned long mmun_start; /* For mmu_notifiers */
  846. unsigned long mmun_end; /* For mmu_notifiers */
  847. gfp_t gfp;
  848. VM_BUG_ON(address & ~HPAGE_PMD_MASK);
  849. /* Only allocate from the target node */
  850. gfp = alloc_hugepage_khugepaged_gfpmask() | __GFP_THISNODE;
  851. /*
  852. * Before allocating the hugepage, release the mmap_sem read lock.
  853. * The allocation can take potentially a long time if it involves
  854. * sync compaction, and we do not need to hold the mmap_sem during
  855. * that. We will recheck the vma after taking it again in write mode.
  856. */
  857. up_read(&mm->mmap_sem);
  858. new_page = khugepaged_alloc_page(hpage, gfp, node);
  859. if (!new_page) {
  860. result = SCAN_ALLOC_HUGE_PAGE_FAIL;
  861. goto out_nolock;
  862. }
  863. /* Do not oom kill for khugepaged charges */
  864. if (unlikely(mem_cgroup_try_charge(new_page, mm, gfp | __GFP_NORETRY,
  865. &memcg, true))) {
  866. result = SCAN_CGROUP_CHARGE_FAIL;
  867. goto out_nolock;
  868. }
  869. down_read(&mm->mmap_sem);
  870. result = hugepage_vma_revalidate(mm, address, &vma);
  871. if (result) {
  872. mem_cgroup_cancel_charge(new_page, memcg, true);
  873. up_read(&mm->mmap_sem);
  874. goto out_nolock;
  875. }
  876. pmd = mm_find_pmd(mm, address);
  877. if (!pmd) {
  878. result = SCAN_PMD_NULL;
  879. mem_cgroup_cancel_charge(new_page, memcg, true);
  880. up_read(&mm->mmap_sem);
  881. goto out_nolock;
  882. }
  883. /*
  884. * __collapse_huge_page_swapin always returns with mmap_sem locked.
  885. * If it fails, we release mmap_sem and jump out_nolock.
  886. * Continuing to collapse causes inconsistency.
  887. */
  888. if (!__collapse_huge_page_swapin(mm, vma, address, pmd, referenced)) {
  889. mem_cgroup_cancel_charge(new_page, memcg, true);
  890. up_read(&mm->mmap_sem);
  891. goto out_nolock;
  892. }
  893. up_read(&mm->mmap_sem);
  894. /*
  895. * Prevent all access to pagetables with the exception of
  896. * gup_fast later handled by the ptep_clear_flush and the VM
  897. * handled by the anon_vma lock + PG_lock.
  898. */
  899. down_write(&mm->mmap_sem);
  900. result = hugepage_vma_revalidate(mm, address, &vma);
  901. if (result)
  902. goto out;
  903. /* check if the pmd is still valid */
  904. if (mm_find_pmd(mm, address) != pmd)
  905. goto out;
  906. vm_write_begin(vma);
  907. anon_vma_lock_write(vma->anon_vma);
  908. pte = pte_offset_map(pmd, address);
  909. pte_ptl = pte_lockptr(mm, pmd);
  910. mmun_start = address;
  911. mmun_end = address + HPAGE_PMD_SIZE;
  912. mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end);
  913. pmd_ptl = pmd_lock(mm, pmd); /* probably unnecessary */
  914. /*
  915. * After this gup_fast can't run anymore. This also removes
  916. * any huge TLB entry from the CPU so we won't allow
  917. * huge and small TLB entries for the same virtual address
  918. * to avoid the risk of CPU bugs in that area.
  919. */
  920. _pmd = pmdp_collapse_flush(vma, address, pmd);
  921. spin_unlock(pmd_ptl);
  922. mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end);
  923. spin_lock(pte_ptl);
  924. isolated = __collapse_huge_page_isolate(vma, address, pte);
  925. spin_unlock(pte_ptl);
  926. if (unlikely(!isolated)) {
  927. pte_unmap(pte);
  928. spin_lock(pmd_ptl);
  929. BUG_ON(!pmd_none(*pmd));
  930. /*
  931. * We can only use set_pmd_at when establishing
  932. * hugepmds and never for establishing regular pmds that
  933. * points to regular pagetables. Use pmd_populate for that
  934. */
  935. pmd_populate(mm, pmd, pmd_pgtable(_pmd));
  936. spin_unlock(pmd_ptl);
  937. anon_vma_unlock_write(vma->anon_vma);
  938. vm_write_end(vma);
  939. result = SCAN_FAIL;
  940. goto out;
  941. }
  942. /*
  943. * All pages are isolated and locked so anon_vma rmap
  944. * can't run anymore.
  945. */
  946. anon_vma_unlock_write(vma->anon_vma);
  947. __collapse_huge_page_copy(pte, new_page, vma, address, pte_ptl);
  948. pte_unmap(pte);
  949. __SetPageUptodate(new_page);
  950. pgtable = pmd_pgtable(_pmd);
  951. _pmd = mk_huge_pmd(new_page, vma->vm_page_prot);
  952. _pmd = maybe_pmd_mkwrite(pmd_mkdirty(_pmd), vma);
  953. /*
  954. * spin_lock() below is not the equivalent of smp_wmb(), so
  955. * this is needed to avoid the copy_huge_page writes to become
  956. * visible after the set_pmd_at() write.
  957. */
  958. smp_wmb();
  959. spin_lock(pmd_ptl);
  960. BUG_ON(!pmd_none(*pmd));
  961. page_add_new_anon_rmap(new_page, vma, address, true);
  962. mem_cgroup_commit_charge(new_page, memcg, false, true);
  963. lru_cache_add_active_or_unevictable(new_page, vma);
  964. pgtable_trans_huge_deposit(mm, pmd, pgtable);
  965. set_pmd_at(mm, address, pmd, _pmd);
  966. update_mmu_cache_pmd(vma, address, pmd);
  967. spin_unlock(pmd_ptl);
  968. vm_write_end(vma);
  969. *hpage = NULL;
  970. khugepaged_pages_collapsed++;
  971. result = SCAN_SUCCEED;
  972. out_up_write:
  973. up_write(&mm->mmap_sem);
  974. out_nolock:
  975. trace_mm_collapse_huge_page(mm, isolated, result);
  976. return;
  977. out:
  978. mem_cgroup_cancel_charge(new_page, memcg, true);
  979. goto out_up_write;
  980. }
  981. static int khugepaged_scan_pmd(struct mm_struct *mm,
  982. struct vm_area_struct *vma,
  983. unsigned long address,
  984. struct page **hpage)
  985. {
  986. pmd_t *pmd;
  987. pte_t *pte, *_pte;
  988. int ret = 0, none_or_zero = 0, result = 0, referenced = 0;
  989. struct page *page = NULL;
  990. unsigned long _address;
  991. spinlock_t *ptl;
  992. int node = NUMA_NO_NODE, unmapped = 0;
  993. bool writable = false;
  994. VM_BUG_ON(address & ~HPAGE_PMD_MASK);
  995. pmd = mm_find_pmd(mm, address);
  996. if (!pmd) {
  997. result = SCAN_PMD_NULL;
  998. goto out;
  999. }
  1000. memset(khugepaged_node_load, 0, sizeof(khugepaged_node_load));
  1001. pte = pte_offset_map_lock(mm, pmd, address, &ptl);
  1002. for (_address = address, _pte = pte; _pte < pte+HPAGE_PMD_NR;
  1003. _pte++, _address += PAGE_SIZE) {
  1004. pte_t pteval = *_pte;
  1005. if (is_swap_pte(pteval)) {
  1006. if (++unmapped <= khugepaged_max_ptes_swap) {
  1007. continue;
  1008. } else {
  1009. result = SCAN_EXCEED_SWAP_PTE;
  1010. goto out_unmap;
  1011. }
  1012. }
  1013. if (pte_none(pteval) || is_zero_pfn(pte_pfn(pteval))) {
  1014. if (!userfaultfd_armed(vma) &&
  1015. ++none_or_zero <= khugepaged_max_ptes_none) {
  1016. continue;
  1017. } else {
  1018. result = SCAN_EXCEED_NONE_PTE;
  1019. goto out_unmap;
  1020. }
  1021. }
  1022. if (!pte_present(pteval)) {
  1023. result = SCAN_PTE_NON_PRESENT;
  1024. goto out_unmap;
  1025. }
  1026. if (pte_write(pteval))
  1027. writable = true;
  1028. page = vm_normal_page(vma, _address, pteval);
  1029. if (unlikely(!page)) {
  1030. result = SCAN_PAGE_NULL;
  1031. goto out_unmap;
  1032. }
  1033. /* TODO: teach khugepaged to collapse THP mapped with pte */
  1034. if (PageCompound(page)) {
  1035. result = SCAN_PAGE_COMPOUND;
  1036. goto out_unmap;
  1037. }
  1038. /*
  1039. * Record which node the original page is from and save this
  1040. * information to khugepaged_node_load[].
  1041. * Khupaged will allocate hugepage from the node has the max
  1042. * hit record.
  1043. */
  1044. node = page_to_nid(page);
  1045. if (khugepaged_scan_abort(node)) {
  1046. result = SCAN_SCAN_ABORT;
  1047. goto out_unmap;
  1048. }
  1049. khugepaged_node_load[node]++;
  1050. if (!PageLRU(page)) {
  1051. result = SCAN_PAGE_LRU;
  1052. goto out_unmap;
  1053. }
  1054. if (PageLocked(page)) {
  1055. result = SCAN_PAGE_LOCK;
  1056. goto out_unmap;
  1057. }
  1058. if (!PageAnon(page)) {
  1059. result = SCAN_PAGE_ANON;
  1060. goto out_unmap;
  1061. }
  1062. /*
  1063. * cannot use mapcount: can't collapse if there's a gup pin.
  1064. * The page must only be referenced by the scanned process
  1065. * and page swap cache.
  1066. */
  1067. if (page_count(page) != 1 + PageSwapCache(page)) {
  1068. result = SCAN_PAGE_COUNT;
  1069. goto out_unmap;
  1070. }
  1071. if (pte_young(pteval) ||
  1072. page_is_young(page) || PageReferenced(page) ||
  1073. mmu_notifier_test_young(vma->vm_mm, address))
  1074. referenced++;
  1075. }
  1076. if (writable) {
  1077. if (referenced) {
  1078. result = SCAN_SUCCEED;
  1079. ret = 1;
  1080. } else {
  1081. result = SCAN_LACK_REFERENCED_PAGE;
  1082. }
  1083. } else {
  1084. result = SCAN_PAGE_RO;
  1085. }
  1086. out_unmap:
  1087. pte_unmap_unlock(pte, ptl);
  1088. if (ret) {
  1089. node = khugepaged_find_target_node();
  1090. /* collapse_huge_page will return with the mmap_sem released */
  1091. collapse_huge_page(mm, address, hpage, node, referenced);
  1092. }
  1093. out:
  1094. trace_mm_khugepaged_scan_pmd(mm, page, writable, referenced,
  1095. none_or_zero, result, unmapped);
  1096. return ret;
  1097. }
  1098. static void collect_mm_slot(struct mm_slot *mm_slot)
  1099. {
  1100. struct mm_struct *mm = mm_slot->mm;
  1101. VM_BUG_ON(NR_CPUS != 1 && !spin_is_locked(&khugepaged_mm_lock));
  1102. if (khugepaged_test_exit(mm)) {
  1103. /* free mm_slot */
  1104. hash_del(&mm_slot->hash);
  1105. list_del(&mm_slot->mm_node);
  1106. /*
  1107. * Not strictly needed because the mm exited already.
  1108. *
  1109. * clear_bit(MMF_VM_HUGEPAGE, &mm->flags);
  1110. */
  1111. /* khugepaged_mm_lock actually not necessary for the below */
  1112. free_mm_slot(mm_slot);
  1113. mmdrop(mm);
  1114. }
  1115. }
  1116. #if defined(CONFIG_SHMEM) && defined(CONFIG_TRANSPARENT_HUGE_PAGECACHE)
  1117. static void retract_page_tables(struct address_space *mapping, pgoff_t pgoff)
  1118. {
  1119. struct vm_area_struct *vma;
  1120. struct mm_struct *mm;
  1121. unsigned long addr;
  1122. pmd_t *pmd, _pmd;
  1123. i_mmap_lock_write(mapping);
  1124. vma_interval_tree_foreach(vma, &mapping->i_mmap, pgoff, pgoff) {
  1125. /* probably overkill */
  1126. if (vma->anon_vma)
  1127. continue;
  1128. addr = vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
  1129. if (addr & ~HPAGE_PMD_MASK)
  1130. continue;
  1131. if (vma->vm_end < addr + HPAGE_PMD_SIZE)
  1132. continue;
  1133. mm = vma->vm_mm;
  1134. pmd = mm_find_pmd(mm, addr);
  1135. if (!pmd)
  1136. continue;
  1137. /*
  1138. * We need exclusive mmap_sem to retract page table.
  1139. * If trylock fails we would end up with pte-mapped THP after
  1140. * re-fault. Not ideal, but it's more important to not disturb
  1141. * the system too much.
  1142. */
  1143. if (down_write_trylock(&mm->mmap_sem)) {
  1144. if (!khugepaged_test_exit(mm)) {
  1145. spinlock_t *ptl = pmd_lock(mm, pmd);
  1146. /* assume page table is clear */
  1147. _pmd = pmdp_collapse_flush(vma, addr, pmd);
  1148. spin_unlock(ptl);
  1149. atomic_long_dec(&mm->nr_ptes);
  1150. pte_free(mm, pmd_pgtable(_pmd));
  1151. }
  1152. up_write(&mm->mmap_sem);
  1153. }
  1154. }
  1155. i_mmap_unlock_write(mapping);
  1156. }
  1157. /**
  1158. * collapse_shmem - collapse small tmpfs/shmem pages into huge one.
  1159. *
  1160. * Basic scheme is simple, details are more complex:
  1161. * - allocate and lock a new huge page;
  1162. * - scan over radix tree replacing old pages the new one
  1163. * + swap in pages if necessary;
  1164. * + fill in gaps;
  1165. * + keep old pages around in case if rollback is required;
  1166. * - if replacing succeed:
  1167. * + copy data over;
  1168. * + free old pages;
  1169. * + unlock huge page;
  1170. * - if replacing failed;
  1171. * + put all pages back and unfreeze them;
  1172. * + restore gaps in the radix-tree;
  1173. * + unlock and free huge page;
  1174. */
  1175. static void collapse_shmem(struct mm_struct *mm,
  1176. struct address_space *mapping, pgoff_t start,
  1177. struct page **hpage, int node)
  1178. {
  1179. gfp_t gfp;
  1180. struct page *page, *new_page, *tmp;
  1181. struct mem_cgroup *memcg;
  1182. pgoff_t index, end = start + HPAGE_PMD_NR;
  1183. LIST_HEAD(pagelist);
  1184. struct radix_tree_iter iter;
  1185. void **slot;
  1186. int nr_none = 0, result = SCAN_SUCCEED;
  1187. VM_BUG_ON(start & (HPAGE_PMD_NR - 1));
  1188. /* Only allocate from the target node */
  1189. gfp = alloc_hugepage_khugepaged_gfpmask() | __GFP_THISNODE;
  1190. new_page = khugepaged_alloc_page(hpage, gfp, node);
  1191. if (!new_page) {
  1192. result = SCAN_ALLOC_HUGE_PAGE_FAIL;
  1193. goto out;
  1194. }
  1195. /* Do not oom kill for khugepaged charges */
  1196. if (unlikely(mem_cgroup_try_charge(new_page, mm, gfp | __GFP_NORETRY,
  1197. &memcg, true))) {
  1198. result = SCAN_CGROUP_CHARGE_FAIL;
  1199. goto out;
  1200. }
  1201. __SetPageLocked(new_page);
  1202. __SetPageSwapBacked(new_page);
  1203. new_page->index = start;
  1204. new_page->mapping = mapping;
  1205. /*
  1206. * At this point the new_page is locked and not up-to-date.
  1207. * It's safe to insert it into the page cache, because nobody would
  1208. * be able to map it or use it in another way until we unlock it.
  1209. */
  1210. index = start;
  1211. spin_lock_irq(&mapping->tree_lock);
  1212. radix_tree_for_each_slot(slot, &mapping->page_tree, &iter, start) {
  1213. int n = min(iter.index, end) - index;
  1214. /*
  1215. * Stop if extent has been hole-punched, and is now completely
  1216. * empty (the more obvious i_size_read() check would take an
  1217. * irq-unsafe seqlock on 32-bit).
  1218. */
  1219. if (n >= HPAGE_PMD_NR) {
  1220. result = SCAN_TRUNCATED;
  1221. goto tree_locked;
  1222. }
  1223. /*
  1224. * Handle holes in the radix tree: charge it from shmem and
  1225. * insert relevant subpage of new_page into the radix-tree.
  1226. */
  1227. if (n && !shmem_charge(mapping->host, n)) {
  1228. result = SCAN_FAIL;
  1229. goto tree_locked;
  1230. }
  1231. for (; index < min(iter.index, end); index++) {
  1232. radix_tree_insert(&mapping->page_tree, index,
  1233. new_page + (index % HPAGE_PMD_NR));
  1234. }
  1235. nr_none += n;
  1236. /* We are done. */
  1237. if (index >= end)
  1238. break;
  1239. page = radix_tree_deref_slot_protected(slot,
  1240. &mapping->tree_lock);
  1241. if (radix_tree_exceptional_entry(page) || !PageUptodate(page)) {
  1242. spin_unlock_irq(&mapping->tree_lock);
  1243. /* swap in or instantiate fallocated page */
  1244. if (shmem_getpage(mapping->host, index, &page,
  1245. SGP_NOHUGE)) {
  1246. result = SCAN_FAIL;
  1247. goto tree_unlocked;
  1248. }
  1249. } else if (trylock_page(page)) {
  1250. get_page(page);
  1251. spin_unlock_irq(&mapping->tree_lock);
  1252. } else {
  1253. result = SCAN_PAGE_LOCK;
  1254. goto tree_locked;
  1255. }
  1256. /*
  1257. * The page must be locked, so we can drop the tree_lock
  1258. * without racing with truncate.
  1259. */
  1260. VM_BUG_ON_PAGE(!PageLocked(page), page);
  1261. VM_BUG_ON_PAGE(!PageUptodate(page), page);
  1262. /*
  1263. * If file was truncated then extended, or hole-punched, before
  1264. * we locked the first page, then a THP might be there already.
  1265. */
  1266. if (PageTransCompound(page)) {
  1267. result = SCAN_PAGE_COMPOUND;
  1268. goto out_unlock;
  1269. }
  1270. if (page_mapping(page) != mapping) {
  1271. result = SCAN_TRUNCATED;
  1272. goto out_unlock;
  1273. }
  1274. if (isolate_lru_page(page)) {
  1275. result = SCAN_DEL_PAGE_LRU;
  1276. goto out_unlock;
  1277. }
  1278. if (page_mapped(page))
  1279. unmap_mapping_range(mapping, index << PAGE_SHIFT,
  1280. PAGE_SIZE, 0);
  1281. spin_lock_irq(&mapping->tree_lock);
  1282. slot = radix_tree_lookup_slot(&mapping->page_tree, index);
  1283. VM_BUG_ON_PAGE(page != radix_tree_deref_slot_protected(slot,
  1284. &mapping->tree_lock), page);
  1285. VM_BUG_ON_PAGE(page_mapped(page), page);
  1286. /*
  1287. * The page is expected to have page_count() == 3:
  1288. * - we hold a pin on it;
  1289. * - one reference from radix tree;
  1290. * - one from isolate_lru_page;
  1291. */
  1292. if (!page_ref_freeze(page, 3)) {
  1293. result = SCAN_PAGE_COUNT;
  1294. spin_unlock_irq(&mapping->tree_lock);
  1295. putback_lru_page(page);
  1296. goto out_unlock;
  1297. }
  1298. /*
  1299. * Add the page to the list to be able to undo the collapse if
  1300. * something go wrong.
  1301. */
  1302. list_add_tail(&page->lru, &pagelist);
  1303. /* Finally, replace with the new page. */
  1304. radix_tree_replace_slot(&mapping->page_tree, slot,
  1305. new_page + (index % HPAGE_PMD_NR));
  1306. slot = radix_tree_iter_resume(slot, &iter);
  1307. index++;
  1308. continue;
  1309. out_unlock:
  1310. unlock_page(page);
  1311. put_page(page);
  1312. goto tree_unlocked;
  1313. }
  1314. /*
  1315. * Handle hole in radix tree at the end of the range.
  1316. * This code only triggers if there's nothing in radix tree
  1317. * beyond 'end'.
  1318. */
  1319. if (index < end) {
  1320. int n = end - index;
  1321. /* Stop if extent has been truncated, and is now empty */
  1322. if (n >= HPAGE_PMD_NR) {
  1323. result = SCAN_TRUNCATED;
  1324. goto tree_locked;
  1325. }
  1326. if (!shmem_charge(mapping->host, n)) {
  1327. result = SCAN_FAIL;
  1328. goto tree_locked;
  1329. }
  1330. for (; index < end; index++) {
  1331. radix_tree_insert(&mapping->page_tree, index,
  1332. new_page + (index % HPAGE_PMD_NR));
  1333. }
  1334. nr_none += n;
  1335. }
  1336. __inc_node_page_state(new_page, NR_SHMEM_THPS);
  1337. if (nr_none) {
  1338. struct zone *zone = page_zone(new_page);
  1339. __mod_node_page_state(zone->zone_pgdat, NR_FILE_PAGES, nr_none);
  1340. __mod_node_page_state(zone->zone_pgdat, NR_SHMEM, nr_none);
  1341. }
  1342. tree_locked:
  1343. spin_unlock_irq(&mapping->tree_lock);
  1344. tree_unlocked:
  1345. if (result == SCAN_SUCCEED) {
  1346. /*
  1347. * Replacing old pages with new one has succeed, now we need to
  1348. * copy the content and free old pages.
  1349. */
  1350. index = start;
  1351. list_for_each_entry_safe(page, tmp, &pagelist, lru) {
  1352. while (index < page->index) {
  1353. clear_highpage(new_page + (index % HPAGE_PMD_NR));
  1354. index++;
  1355. }
  1356. copy_highpage(new_page + (page->index % HPAGE_PMD_NR),
  1357. page);
  1358. list_del(&page->lru);
  1359. page->mapping = NULL;
  1360. page_ref_unfreeze(page, 1);
  1361. ClearPageActive(page);
  1362. ClearPageUnevictable(page);
  1363. unlock_page(page);
  1364. put_page(page);
  1365. index++;
  1366. }
  1367. while (index < end) {
  1368. clear_highpage(new_page + (index % HPAGE_PMD_NR));
  1369. index++;
  1370. }
  1371. SetPageUptodate(new_page);
  1372. page_ref_add(new_page, HPAGE_PMD_NR - 1);
  1373. set_page_dirty(new_page);
  1374. mem_cgroup_commit_charge(new_page, memcg, false, true);
  1375. lru_cache_add_anon(new_page);
  1376. /*
  1377. * Remove pte page tables, so we can re-fault the page as huge.
  1378. */
  1379. retract_page_tables(mapping, start);
  1380. *hpage = NULL;
  1381. } else {
  1382. /* Something went wrong: rollback changes to the radix-tree */
  1383. spin_lock_irq(&mapping->tree_lock);
  1384. mapping->nrpages -= nr_none;
  1385. shmem_uncharge(mapping->host, nr_none);
  1386. radix_tree_for_each_slot(slot, &mapping->page_tree, &iter,
  1387. start) {
  1388. if (iter.index >= end)
  1389. break;
  1390. page = list_first_entry_or_null(&pagelist,
  1391. struct page, lru);
  1392. if (!page || iter.index < page->index) {
  1393. if (!nr_none)
  1394. break;
  1395. nr_none--;
  1396. /* Put holes back where they were */
  1397. radix_tree_delete(&mapping->page_tree,
  1398. iter.index);
  1399. continue;
  1400. }
  1401. VM_BUG_ON_PAGE(page->index != iter.index, page);
  1402. /* Unfreeze the page. */
  1403. list_del(&page->lru);
  1404. page_ref_unfreeze(page, 2);
  1405. radix_tree_replace_slot(&mapping->page_tree,
  1406. slot, page);
  1407. slot = radix_tree_iter_resume(slot, &iter);
  1408. spin_unlock_irq(&mapping->tree_lock);
  1409. unlock_page(page);
  1410. putback_lru_page(page);
  1411. spin_lock_irq(&mapping->tree_lock);
  1412. }
  1413. VM_BUG_ON(nr_none);
  1414. spin_unlock_irq(&mapping->tree_lock);
  1415. mem_cgroup_cancel_charge(new_page, memcg, true);
  1416. new_page->mapping = NULL;
  1417. }
  1418. unlock_page(new_page);
  1419. out:
  1420. VM_BUG_ON(!list_empty(&pagelist));
  1421. /* TODO: tracepoints */
  1422. }
  1423. static void khugepaged_scan_shmem(struct mm_struct *mm,
  1424. struct address_space *mapping,
  1425. pgoff_t start, struct page **hpage)
  1426. {
  1427. struct page *page = NULL;
  1428. struct radix_tree_iter iter;
  1429. void **slot;
  1430. int present, swap;
  1431. int node = NUMA_NO_NODE;
  1432. int result = SCAN_SUCCEED;
  1433. present = 0;
  1434. swap = 0;
  1435. memset(khugepaged_node_load, 0, sizeof(khugepaged_node_load));
  1436. rcu_read_lock();
  1437. radix_tree_for_each_slot(slot, &mapping->page_tree, &iter, start) {
  1438. if (iter.index >= start + HPAGE_PMD_NR)
  1439. break;
  1440. page = radix_tree_deref_slot(slot);
  1441. if (radix_tree_deref_retry(page)) {
  1442. slot = radix_tree_iter_retry(&iter);
  1443. continue;
  1444. }
  1445. if (radix_tree_exception(page)) {
  1446. if (++swap > khugepaged_max_ptes_swap) {
  1447. result = SCAN_EXCEED_SWAP_PTE;
  1448. break;
  1449. }
  1450. continue;
  1451. }
  1452. if (PageTransCompound(page)) {
  1453. result = SCAN_PAGE_COMPOUND;
  1454. break;
  1455. }
  1456. node = page_to_nid(page);
  1457. if (khugepaged_scan_abort(node)) {
  1458. result = SCAN_SCAN_ABORT;
  1459. break;
  1460. }
  1461. khugepaged_node_load[node]++;
  1462. if (!PageLRU(page)) {
  1463. result = SCAN_PAGE_LRU;
  1464. break;
  1465. }
  1466. if (page_count(page) != 1 + page_mapcount(page)) {
  1467. result = SCAN_PAGE_COUNT;
  1468. break;
  1469. }
  1470. /*
  1471. * We probably should check if the page is referenced here, but
  1472. * nobody would transfer pte_young() to PageReferenced() for us.
  1473. * And rmap walk here is just too costly...
  1474. */
  1475. present++;
  1476. if (need_resched()) {
  1477. slot = radix_tree_iter_resume(slot, &iter);
  1478. cond_resched_rcu();
  1479. }
  1480. }
  1481. rcu_read_unlock();
  1482. if (result == SCAN_SUCCEED) {
  1483. if (present < HPAGE_PMD_NR - khugepaged_max_ptes_none) {
  1484. result = SCAN_EXCEED_NONE_PTE;
  1485. } else {
  1486. node = khugepaged_find_target_node();
  1487. collapse_shmem(mm, mapping, start, hpage, node);
  1488. }
  1489. }
  1490. /* TODO: tracepoints */
  1491. }
  1492. #else
  1493. static void khugepaged_scan_shmem(struct mm_struct *mm,
  1494. struct address_space *mapping,
  1495. pgoff_t start, struct page **hpage)
  1496. {
  1497. BUILD_BUG();
  1498. }
  1499. #endif
  1500. static unsigned int khugepaged_scan_mm_slot(unsigned int pages,
  1501. struct page **hpage)
  1502. __releases(&khugepaged_mm_lock)
  1503. __acquires(&khugepaged_mm_lock)
  1504. {
  1505. struct mm_slot *mm_slot;
  1506. struct mm_struct *mm;
  1507. struct vm_area_struct *vma;
  1508. int progress = 0;
  1509. VM_BUG_ON(!pages);
  1510. VM_BUG_ON(NR_CPUS != 1 && !spin_is_locked(&khugepaged_mm_lock));
  1511. if (khugepaged_scan.mm_slot)
  1512. mm_slot = khugepaged_scan.mm_slot;
  1513. else {
  1514. mm_slot = list_entry(khugepaged_scan.mm_head.next,
  1515. struct mm_slot, mm_node);
  1516. khugepaged_scan.address = 0;
  1517. khugepaged_scan.mm_slot = mm_slot;
  1518. }
  1519. spin_unlock(&khugepaged_mm_lock);
  1520. mm = mm_slot->mm;
  1521. /*
  1522. * Don't wait for semaphore (to avoid long wait times). Just move to
  1523. * the next mm on the list.
  1524. */
  1525. vma = NULL;
  1526. if (unlikely(!down_read_trylock(&mm->mmap_sem)))
  1527. goto breakouterloop_mmap_sem;
  1528. if (likely(!khugepaged_test_exit(mm)))
  1529. vma = find_vma(mm, khugepaged_scan.address);
  1530. progress++;
  1531. for (; vma; vma = vma->vm_next) {
  1532. unsigned long hstart, hend;
  1533. cond_resched();
  1534. if (unlikely(khugepaged_test_exit(mm))) {
  1535. progress++;
  1536. break;
  1537. }
  1538. if (!hugepage_vma_check(vma)) {
  1539. skip:
  1540. progress++;
  1541. continue;
  1542. }
  1543. hstart = (vma->vm_start + ~HPAGE_PMD_MASK) & HPAGE_PMD_MASK;
  1544. hend = vma->vm_end & HPAGE_PMD_MASK;
  1545. if (hstart >= hend)
  1546. goto skip;
  1547. if (khugepaged_scan.address > hend)
  1548. goto skip;
  1549. if (khugepaged_scan.address < hstart)
  1550. khugepaged_scan.address = hstart;
  1551. VM_BUG_ON(khugepaged_scan.address & ~HPAGE_PMD_MASK);
  1552. while (khugepaged_scan.address < hend) {
  1553. int ret;
  1554. cond_resched();
  1555. if (unlikely(khugepaged_test_exit(mm)))
  1556. goto breakouterloop;
  1557. VM_BUG_ON(khugepaged_scan.address < hstart ||
  1558. khugepaged_scan.address + HPAGE_PMD_SIZE >
  1559. hend);
  1560. if (shmem_file(vma->vm_file)) {
  1561. struct file *file;
  1562. pgoff_t pgoff = linear_page_index(vma,
  1563. khugepaged_scan.address);
  1564. if (!shmem_huge_enabled(vma))
  1565. goto skip;
  1566. file = get_file(vma->vm_file);
  1567. up_read(&mm->mmap_sem);
  1568. ret = 1;
  1569. khugepaged_scan_shmem(mm, file->f_mapping,
  1570. pgoff, hpage);
  1571. fput(file);
  1572. } else {
  1573. ret = khugepaged_scan_pmd(mm, vma,
  1574. khugepaged_scan.address,
  1575. hpage);
  1576. }
  1577. /* move to next address */
  1578. khugepaged_scan.address += HPAGE_PMD_SIZE;
  1579. progress += HPAGE_PMD_NR;
  1580. if (ret)
  1581. /* we released mmap_sem so break loop */
  1582. goto breakouterloop_mmap_sem;
  1583. if (progress >= pages)
  1584. goto breakouterloop;
  1585. }
  1586. }
  1587. breakouterloop:
  1588. up_read(&mm->mmap_sem); /* exit_mmap will destroy ptes after this */
  1589. breakouterloop_mmap_sem:
  1590. spin_lock(&khugepaged_mm_lock);
  1591. VM_BUG_ON(khugepaged_scan.mm_slot != mm_slot);
  1592. /*
  1593. * Release the current mm_slot if this mm is about to die, or
  1594. * if we scanned all vmas of this mm.
  1595. */
  1596. if (khugepaged_test_exit(mm) || !vma) {
  1597. /*
  1598. * Make sure that if mm_users is reaching zero while
  1599. * khugepaged runs here, khugepaged_exit will find
  1600. * mm_slot not pointing to the exiting mm.
  1601. */
  1602. if (mm_slot->mm_node.next != &khugepaged_scan.mm_head) {
  1603. khugepaged_scan.mm_slot = list_entry(
  1604. mm_slot->mm_node.next,
  1605. struct mm_slot, mm_node);
  1606. khugepaged_scan.address = 0;
  1607. } else {
  1608. khugepaged_scan.mm_slot = NULL;
  1609. khugepaged_full_scans++;
  1610. }
  1611. collect_mm_slot(mm_slot);
  1612. }
  1613. return progress;
  1614. }
  1615. static int khugepaged_has_work(void)
  1616. {
  1617. return !list_empty(&khugepaged_scan.mm_head) &&
  1618. khugepaged_enabled();
  1619. }
  1620. static int khugepaged_wait_event(void)
  1621. {
  1622. return !list_empty(&khugepaged_scan.mm_head) ||
  1623. kthread_should_stop();
  1624. }
  1625. static void khugepaged_do_scan(void)
  1626. {
  1627. struct page *hpage = NULL;
  1628. unsigned int progress = 0, pass_through_head = 0;
  1629. unsigned int pages = khugepaged_pages_to_scan;
  1630. bool wait = true;
  1631. barrier(); /* write khugepaged_pages_to_scan to local stack */
  1632. while (progress < pages) {
  1633. if (!khugepaged_prealloc_page(&hpage, &wait))
  1634. break;
  1635. cond_resched();
  1636. if (unlikely(kthread_should_stop() || try_to_freeze()))
  1637. break;
  1638. spin_lock(&khugepaged_mm_lock);
  1639. if (!khugepaged_scan.mm_slot)
  1640. pass_through_head++;
  1641. if (khugepaged_has_work() &&
  1642. pass_through_head < 2)
  1643. progress += khugepaged_scan_mm_slot(pages - progress,
  1644. &hpage);
  1645. else
  1646. progress = pages;
  1647. spin_unlock(&khugepaged_mm_lock);
  1648. }
  1649. if (!IS_ERR_OR_NULL(hpage))
  1650. put_page(hpage);
  1651. }
  1652. static bool khugepaged_should_wakeup(void)
  1653. {
  1654. return kthread_should_stop() ||
  1655. time_after_eq(jiffies, khugepaged_sleep_expire);
  1656. }
  1657. static void khugepaged_wait_work(void)
  1658. {
  1659. if (khugepaged_has_work()) {
  1660. const unsigned long scan_sleep_jiffies =
  1661. msecs_to_jiffies(khugepaged_scan_sleep_millisecs);
  1662. if (!scan_sleep_jiffies)
  1663. return;
  1664. khugepaged_sleep_expire = jiffies + scan_sleep_jiffies;
  1665. wait_event_freezable_timeout(khugepaged_wait,
  1666. khugepaged_should_wakeup(),
  1667. scan_sleep_jiffies);
  1668. return;
  1669. }
  1670. if (khugepaged_enabled())
  1671. wait_event_freezable(khugepaged_wait, khugepaged_wait_event());
  1672. }
  1673. static int khugepaged(void *none)
  1674. {
  1675. struct mm_slot *mm_slot;
  1676. set_freezable();
  1677. set_user_nice(current, MAX_NICE);
  1678. while (!kthread_should_stop()) {
  1679. khugepaged_do_scan();
  1680. khugepaged_wait_work();
  1681. }
  1682. spin_lock(&khugepaged_mm_lock);
  1683. mm_slot = khugepaged_scan.mm_slot;
  1684. khugepaged_scan.mm_slot = NULL;
  1685. if (mm_slot)
  1686. collect_mm_slot(mm_slot);
  1687. spin_unlock(&khugepaged_mm_lock);
  1688. return 0;
  1689. }
  1690. static void set_recommended_min_free_kbytes(void)
  1691. {
  1692. struct zone *zone;
  1693. int nr_zones = 0;
  1694. unsigned long recommended_min;
  1695. for_each_populated_zone(zone)
  1696. nr_zones++;
  1697. /* Ensure 2 pageblocks are free to assist fragmentation avoidance */
  1698. recommended_min = pageblock_nr_pages * nr_zones * 2;
  1699. /*
  1700. * Make sure that on average at least two pageblocks are almost free
  1701. * of another type, one for a migratetype to fall back to and a
  1702. * second to avoid subsequent fallbacks of other types There are 3
  1703. * MIGRATE_TYPES we care about.
  1704. */
  1705. recommended_min += pageblock_nr_pages * nr_zones *
  1706. MIGRATE_PCPTYPES * MIGRATE_PCPTYPES;
  1707. /* don't ever allow to reserve more than 5% of the lowmem */
  1708. recommended_min = min(recommended_min,
  1709. (unsigned long) nr_free_buffer_pages() / 20);
  1710. recommended_min <<= (PAGE_SHIFT-10);
  1711. if (recommended_min > min_free_kbytes) {
  1712. if (user_min_free_kbytes >= 0)
  1713. pr_info("raising min_free_kbytes from %d to %lu to help transparent hugepage allocations\n",
  1714. min_free_kbytes, recommended_min);
  1715. min_free_kbytes = recommended_min;
  1716. }
  1717. setup_per_zone_wmarks();
  1718. }
  1719. int start_stop_khugepaged(void)
  1720. {
  1721. int err = 0;
  1722. mutex_lock(&khugepaged_mutex);
  1723. if (khugepaged_enabled()) {
  1724. if (!khugepaged_thread)
  1725. khugepaged_thread = kthread_run(khugepaged, NULL,
  1726. "khugepaged");
  1727. if (IS_ERR(khugepaged_thread)) {
  1728. pr_err("khugepaged: kthread_run(khugepaged) failed\n");
  1729. err = PTR_ERR(khugepaged_thread);
  1730. khugepaged_thread = NULL;
  1731. goto fail;
  1732. }
  1733. if (!list_empty(&khugepaged_scan.mm_head))
  1734. wake_up_interruptible(&khugepaged_wait);
  1735. set_recommended_min_free_kbytes();
  1736. } else if (khugepaged_thread) {
  1737. kthread_stop(khugepaged_thread);
  1738. khugepaged_thread = NULL;
  1739. }
  1740. fail:
  1741. mutex_unlock(&khugepaged_mutex);
  1742. return err;
  1743. }
  1744. void khugepaged_min_free_kbytes_update(void)
  1745. {
  1746. mutex_lock(&khugepaged_mutex);
  1747. if (khugepaged_enabled() && khugepaged_thread)
  1748. set_recommended_min_free_kbytes();
  1749. mutex_unlock(&khugepaged_mutex);
  1750. }