task_mmu.c 82 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395
  1. // SPDX-License-Identifier: GPL-2.0
  2. #include <linux/pagewalk.h>
  3. #include <linux/mm_inline.h>
  4. #include <linux/hugetlb.h>
  5. #include <linux/huge_mm.h>
  6. #include <linux/mount.h>
  7. #include <linux/ksm.h>
  8. #include <linux/seq_file.h>
  9. #include <linux/highmem.h>
  10. #include <linux/ptrace.h>
  11. #include <linux/slab.h>
  12. #include <linux/pagemap.h>
  13. #include <linux/mempolicy.h>
  14. #include <linux/rmap.h>
  15. #include <linux/swap.h>
  16. #include <linux/sched/mm.h>
  17. #include <linux/leafops.h>
  18. #include <linux/mmu_notifier.h>
  19. #include <linux/page_idle.h>
  20. #include <linux/shmem_fs.h>
  21. #include <linux/uaccess.h>
  22. #include <linux/pkeys.h>
  23. #include <linux/minmax.h>
  24. #include <linux/overflow.h>
  25. #include <linux/buildid.h>
  26. #include <asm/elf.h>
  27. #include <asm/tlb.h>
  28. #include <asm/tlbflush.h>
  29. #include "internal.h"
  30. #define SENTINEL_VMA_END -1
  31. #define SENTINEL_VMA_GATE -2
  32. #define SEQ_PUT_DEC(str, val) \
  33. seq_put_decimal_ull_width(m, str, (val) << (PAGE_SHIFT-10), 8)
  34. void task_mem(struct seq_file *m, struct mm_struct *mm)
  35. {
  36. unsigned long text, lib, swap, anon, file, shmem;
  37. unsigned long hiwater_vm, total_vm, hiwater_rss, total_rss;
  38. anon = get_mm_counter_sum(mm, MM_ANONPAGES);
  39. file = get_mm_counter_sum(mm, MM_FILEPAGES);
  40. shmem = get_mm_counter_sum(mm, MM_SHMEMPAGES);
  41. /*
  42. * Note: to minimize their overhead, mm maintains hiwater_vm and
  43. * hiwater_rss only when about to *lower* total_vm or rss. Any
  44. * collector of these hiwater stats must therefore get total_vm
  45. * and rss too, which will usually be the higher. Barriers? not
  46. * worth the effort, such snapshots can always be inconsistent.
  47. */
  48. hiwater_vm = total_vm = mm->total_vm;
  49. if (hiwater_vm < mm->hiwater_vm)
  50. hiwater_vm = mm->hiwater_vm;
  51. hiwater_rss = total_rss = anon + file + shmem;
  52. if (hiwater_rss < mm->hiwater_rss)
  53. hiwater_rss = mm->hiwater_rss;
  54. /* split executable areas between text and lib */
  55. text = PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK);
  56. text = min(text, mm->exec_vm << PAGE_SHIFT);
  57. lib = (mm->exec_vm << PAGE_SHIFT) - text;
  58. swap = get_mm_counter_sum(mm, MM_SWAPENTS);
  59. SEQ_PUT_DEC("VmPeak:\t", hiwater_vm);
  60. SEQ_PUT_DEC(" kB\nVmSize:\t", total_vm);
  61. SEQ_PUT_DEC(" kB\nVmLck:\t", mm->locked_vm);
  62. SEQ_PUT_DEC(" kB\nVmPin:\t", atomic64_read(&mm->pinned_vm));
  63. SEQ_PUT_DEC(" kB\nVmHWM:\t", hiwater_rss);
  64. SEQ_PUT_DEC(" kB\nVmRSS:\t", total_rss);
  65. SEQ_PUT_DEC(" kB\nRssAnon:\t", anon);
  66. SEQ_PUT_DEC(" kB\nRssFile:\t", file);
  67. SEQ_PUT_DEC(" kB\nRssShmem:\t", shmem);
  68. SEQ_PUT_DEC(" kB\nVmData:\t", mm->data_vm);
  69. SEQ_PUT_DEC(" kB\nVmStk:\t", mm->stack_vm);
  70. seq_put_decimal_ull_width(m,
  71. " kB\nVmExe:\t", text >> 10, 8);
  72. seq_put_decimal_ull_width(m,
  73. " kB\nVmLib:\t", lib >> 10, 8);
  74. seq_put_decimal_ull_width(m,
  75. " kB\nVmPTE:\t", mm_pgtables_bytes(mm) >> 10, 8);
  76. SEQ_PUT_DEC(" kB\nVmSwap:\t", swap);
  77. seq_puts(m, " kB\n");
  78. hugetlb_report_usage(m, mm);
  79. }
  80. #undef SEQ_PUT_DEC
  81. unsigned long task_vsize(struct mm_struct *mm)
  82. {
  83. return PAGE_SIZE * mm->total_vm;
  84. }
  85. unsigned long task_statm(struct mm_struct *mm,
  86. unsigned long *shared, unsigned long *text,
  87. unsigned long *data, unsigned long *resident)
  88. {
  89. *shared = get_mm_counter_sum(mm, MM_FILEPAGES) +
  90. get_mm_counter_sum(mm, MM_SHMEMPAGES);
  91. *text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
  92. >> PAGE_SHIFT;
  93. *data = mm->data_vm + mm->stack_vm;
  94. *resident = *shared + get_mm_counter_sum(mm, MM_ANONPAGES);
  95. return mm->total_vm;
  96. }
  97. #ifdef CONFIG_NUMA
  98. /*
  99. * Save get_task_policy() for show_numa_map().
  100. */
  101. static void hold_task_mempolicy(struct proc_maps_private *priv)
  102. {
  103. struct task_struct *task = priv->task;
  104. task_lock(task);
  105. priv->task_mempolicy = get_task_policy(task);
  106. mpol_get(priv->task_mempolicy);
  107. task_unlock(task);
  108. }
  109. static void release_task_mempolicy(struct proc_maps_private *priv)
  110. {
  111. mpol_put(priv->task_mempolicy);
  112. }
  113. #else
  114. static void hold_task_mempolicy(struct proc_maps_private *priv)
  115. {
  116. }
  117. static void release_task_mempolicy(struct proc_maps_private *priv)
  118. {
  119. }
  120. #endif
  121. #ifdef CONFIG_PER_VMA_LOCK
  122. static void reset_lock_ctx(struct proc_maps_locking_ctx *lock_ctx)
  123. {
  124. lock_ctx->locked_vma = NULL;
  125. lock_ctx->mmap_locked = false;
  126. }
  127. static void unlock_ctx_vma(struct proc_maps_locking_ctx *lock_ctx)
  128. {
  129. if (lock_ctx->locked_vma) {
  130. vma_end_read(lock_ctx->locked_vma);
  131. lock_ctx->locked_vma = NULL;
  132. }
  133. }
  134. static const struct seq_operations proc_pid_maps_op;
  135. static inline bool lock_vma_range(struct seq_file *m,
  136. struct proc_maps_locking_ctx *lock_ctx)
  137. {
  138. /*
  139. * smaps and numa_maps perform page table walk, therefore require
  140. * mmap_lock but maps can be read with locking just the vma and
  141. * walking the vma tree under rcu read protection.
  142. */
  143. if (m->op != &proc_pid_maps_op) {
  144. if (mmap_read_lock_killable(lock_ctx->mm))
  145. return false;
  146. lock_ctx->mmap_locked = true;
  147. } else {
  148. rcu_read_lock();
  149. reset_lock_ctx(lock_ctx);
  150. }
  151. return true;
  152. }
  153. static inline void unlock_vma_range(struct proc_maps_locking_ctx *lock_ctx)
  154. {
  155. if (lock_ctx->mmap_locked) {
  156. mmap_read_unlock(lock_ctx->mm);
  157. } else {
  158. unlock_ctx_vma(lock_ctx);
  159. rcu_read_unlock();
  160. }
  161. }
  162. static struct vm_area_struct *get_next_vma(struct proc_maps_private *priv,
  163. loff_t last_pos)
  164. {
  165. struct proc_maps_locking_ctx *lock_ctx = &priv->lock_ctx;
  166. struct vm_area_struct *vma;
  167. if (lock_ctx->mmap_locked)
  168. return vma_next(&priv->iter);
  169. unlock_ctx_vma(lock_ctx);
  170. vma = lock_next_vma(lock_ctx->mm, &priv->iter, last_pos);
  171. if (!IS_ERR_OR_NULL(vma))
  172. lock_ctx->locked_vma = vma;
  173. return vma;
  174. }
  175. static inline bool fallback_to_mmap_lock(struct proc_maps_private *priv,
  176. loff_t pos)
  177. {
  178. struct proc_maps_locking_ctx *lock_ctx = &priv->lock_ctx;
  179. if (lock_ctx->mmap_locked)
  180. return false;
  181. rcu_read_unlock();
  182. mmap_read_lock(lock_ctx->mm);
  183. /* Reinitialize the iterator after taking mmap_lock */
  184. vma_iter_set(&priv->iter, pos);
  185. lock_ctx->mmap_locked = true;
  186. return true;
  187. }
  188. #else /* CONFIG_PER_VMA_LOCK */
  189. static inline bool lock_vma_range(struct seq_file *m,
  190. struct proc_maps_locking_ctx *lock_ctx)
  191. {
  192. return mmap_read_lock_killable(lock_ctx->mm) == 0;
  193. }
  194. static inline void unlock_vma_range(struct proc_maps_locking_ctx *lock_ctx)
  195. {
  196. mmap_read_unlock(lock_ctx->mm);
  197. }
  198. static struct vm_area_struct *get_next_vma(struct proc_maps_private *priv,
  199. loff_t last_pos)
  200. {
  201. return vma_next(&priv->iter);
  202. }
  203. static inline bool fallback_to_mmap_lock(struct proc_maps_private *priv,
  204. loff_t pos)
  205. {
  206. return false;
  207. }
  208. #endif /* CONFIG_PER_VMA_LOCK */
  209. static struct vm_area_struct *proc_get_vma(struct seq_file *m, loff_t *ppos)
  210. {
  211. struct proc_maps_private *priv = m->private;
  212. struct vm_area_struct *vma;
  213. retry:
  214. vma = get_next_vma(priv, *ppos);
  215. /* EINTR of EAGAIN is possible */
  216. if (IS_ERR(vma)) {
  217. if (PTR_ERR(vma) == -EAGAIN && fallback_to_mmap_lock(priv, *ppos))
  218. goto retry;
  219. return vma;
  220. }
  221. /* Store previous position to be able to restart if needed */
  222. priv->last_pos = *ppos;
  223. if (vma) {
  224. /*
  225. * Track the end of the reported vma to ensure position changes
  226. * even if previous vma was merged with the next vma and we
  227. * found the extended vma with the same vm_start.
  228. */
  229. *ppos = vma->vm_end;
  230. } else {
  231. *ppos = SENTINEL_VMA_GATE;
  232. vma = get_gate_vma(priv->lock_ctx.mm);
  233. }
  234. return vma;
  235. }
  236. static void *m_start(struct seq_file *m, loff_t *ppos)
  237. {
  238. struct proc_maps_private *priv = m->private;
  239. struct proc_maps_locking_ctx *lock_ctx;
  240. loff_t last_addr = *ppos;
  241. struct mm_struct *mm;
  242. /* See m_next(). Zero at the start or after lseek. */
  243. if (last_addr == SENTINEL_VMA_END)
  244. return NULL;
  245. priv->task = get_proc_task(priv->inode);
  246. if (!priv->task)
  247. return ERR_PTR(-ESRCH);
  248. lock_ctx = &priv->lock_ctx;
  249. mm = lock_ctx->mm;
  250. if (!mm || !mmget_not_zero(mm)) {
  251. put_task_struct(priv->task);
  252. priv->task = NULL;
  253. return NULL;
  254. }
  255. if (!lock_vma_range(m, lock_ctx)) {
  256. mmput(mm);
  257. put_task_struct(priv->task);
  258. priv->task = NULL;
  259. return ERR_PTR(-EINTR);
  260. }
  261. /*
  262. * Reset current position if last_addr was set before
  263. * and it's not a sentinel.
  264. */
  265. if (last_addr > 0)
  266. *ppos = last_addr = priv->last_pos;
  267. vma_iter_init(&priv->iter, mm, (unsigned long)last_addr);
  268. hold_task_mempolicy(priv);
  269. if (last_addr == SENTINEL_VMA_GATE)
  270. return get_gate_vma(mm);
  271. return proc_get_vma(m, ppos);
  272. }
  273. static void *m_next(struct seq_file *m, void *v, loff_t *ppos)
  274. {
  275. if (*ppos == SENTINEL_VMA_GATE) {
  276. *ppos = SENTINEL_VMA_END;
  277. return NULL;
  278. }
  279. return proc_get_vma(m, ppos);
  280. }
  281. static void m_stop(struct seq_file *m, void *v)
  282. {
  283. struct proc_maps_private *priv = m->private;
  284. struct mm_struct *mm = priv->lock_ctx.mm;
  285. if (!priv->task)
  286. return;
  287. release_task_mempolicy(priv);
  288. unlock_vma_range(&priv->lock_ctx);
  289. mmput(mm);
  290. put_task_struct(priv->task);
  291. priv->task = NULL;
  292. }
  293. static int proc_maps_open(struct inode *inode, struct file *file,
  294. const struct seq_operations *ops, int psize)
  295. {
  296. struct proc_maps_private *priv = __seq_open_private(file, ops, psize);
  297. if (!priv)
  298. return -ENOMEM;
  299. priv->inode = inode;
  300. priv->lock_ctx.mm = proc_mem_open(inode, PTRACE_MODE_READ);
  301. if (IS_ERR(priv->lock_ctx.mm)) {
  302. int err = PTR_ERR(priv->lock_ctx.mm);
  303. seq_release_private(inode, file);
  304. return err;
  305. }
  306. return 0;
  307. }
  308. static int proc_map_release(struct inode *inode, struct file *file)
  309. {
  310. struct seq_file *seq = file->private_data;
  311. struct proc_maps_private *priv = seq->private;
  312. if (priv->lock_ctx.mm)
  313. mmdrop(priv->lock_ctx.mm);
  314. return seq_release_private(inode, file);
  315. }
  316. static int do_maps_open(struct inode *inode, struct file *file,
  317. const struct seq_operations *ops)
  318. {
  319. return proc_maps_open(inode, file, ops,
  320. sizeof(struct proc_maps_private));
  321. }
  322. static void get_vma_name(struct vm_area_struct *vma,
  323. const struct path **path,
  324. const char **name,
  325. const char **name_fmt)
  326. {
  327. struct anon_vma_name *anon_name = vma->vm_mm ? anon_vma_name(vma) : NULL;
  328. *name = NULL;
  329. *path = NULL;
  330. *name_fmt = NULL;
  331. /*
  332. * Print the dentry name for named mappings, and a
  333. * special [heap] marker for the heap:
  334. */
  335. if (vma->vm_file) {
  336. /*
  337. * If user named this anon shared memory via
  338. * prctl(PR_SET_VMA ..., use the provided name.
  339. */
  340. if (anon_name) {
  341. *name_fmt = "[anon_shmem:%s]";
  342. *name = anon_name->name;
  343. } else {
  344. *path = file_user_path(vma->vm_file);
  345. }
  346. return;
  347. }
  348. if (vma->vm_ops && vma->vm_ops->name) {
  349. *name = vma->vm_ops->name(vma);
  350. if (*name)
  351. return;
  352. }
  353. *name = arch_vma_name(vma);
  354. if (*name)
  355. return;
  356. if (!vma->vm_mm) {
  357. *name = "[vdso]";
  358. return;
  359. }
  360. if (vma_is_initial_heap(vma)) {
  361. *name = "[heap]";
  362. return;
  363. }
  364. if (vma_is_initial_stack(vma)) {
  365. *name = "[stack]";
  366. return;
  367. }
  368. if (anon_name) {
  369. *name_fmt = "[anon:%s]";
  370. *name = anon_name->name;
  371. return;
  372. }
  373. }
  374. static void show_vma_header_prefix(struct seq_file *m,
  375. unsigned long start, unsigned long end,
  376. vm_flags_t flags, unsigned long long pgoff,
  377. dev_t dev, unsigned long ino)
  378. {
  379. seq_setwidth(m, 25 + sizeof(void *) * 6 - 1);
  380. seq_put_hex_ll(m, NULL, start, 8);
  381. seq_put_hex_ll(m, "-", end, 8);
  382. seq_putc(m, ' ');
  383. seq_putc(m, flags & VM_READ ? 'r' : '-');
  384. seq_putc(m, flags & VM_WRITE ? 'w' : '-');
  385. seq_putc(m, flags & VM_EXEC ? 'x' : '-');
  386. seq_putc(m, flags & VM_MAYSHARE ? 's' : 'p');
  387. seq_put_hex_ll(m, " ", pgoff, 8);
  388. seq_put_hex_ll(m, " ", MAJOR(dev), 2);
  389. seq_put_hex_ll(m, ":", MINOR(dev), 2);
  390. seq_put_decimal_ull(m, " ", ino);
  391. seq_putc(m, ' ');
  392. }
  393. static void
  394. show_map_vma(struct seq_file *m, struct vm_area_struct *vma)
  395. {
  396. const struct path *path;
  397. const char *name_fmt, *name;
  398. vm_flags_t flags = vma->vm_flags;
  399. unsigned long ino = 0;
  400. unsigned long long pgoff = 0;
  401. unsigned long start, end;
  402. dev_t dev = 0;
  403. if (vma->vm_file) {
  404. const struct inode *inode = file_user_inode(vma->vm_file);
  405. dev = inode->i_sb->s_dev;
  406. ino = inode->i_ino;
  407. pgoff = ((loff_t)vma->vm_pgoff) << PAGE_SHIFT;
  408. }
  409. start = vma->vm_start;
  410. end = vma->vm_end;
  411. show_vma_header_prefix(m, start, end, flags, pgoff, dev, ino);
  412. get_vma_name(vma, &path, &name, &name_fmt);
  413. if (path) {
  414. seq_pad(m, ' ');
  415. seq_path(m, path, "\n");
  416. } else if (name_fmt) {
  417. seq_pad(m, ' ');
  418. seq_printf(m, name_fmt, name);
  419. } else if (name) {
  420. seq_pad(m, ' ');
  421. seq_puts(m, name);
  422. }
  423. seq_putc(m, '\n');
  424. }
  425. static int show_map(struct seq_file *m, void *v)
  426. {
  427. show_map_vma(m, v);
  428. return 0;
  429. }
  430. static const struct seq_operations proc_pid_maps_op = {
  431. .start = m_start,
  432. .next = m_next,
  433. .stop = m_stop,
  434. .show = show_map
  435. };
  436. static int pid_maps_open(struct inode *inode, struct file *file)
  437. {
  438. return do_maps_open(inode, file, &proc_pid_maps_op);
  439. }
  440. #define PROCMAP_QUERY_VMA_FLAGS ( \
  441. PROCMAP_QUERY_VMA_READABLE | \
  442. PROCMAP_QUERY_VMA_WRITABLE | \
  443. PROCMAP_QUERY_VMA_EXECUTABLE | \
  444. PROCMAP_QUERY_VMA_SHARED \
  445. )
  446. #define PROCMAP_QUERY_VALID_FLAGS_MASK ( \
  447. PROCMAP_QUERY_COVERING_OR_NEXT_VMA | \
  448. PROCMAP_QUERY_FILE_BACKED_VMA | \
  449. PROCMAP_QUERY_VMA_FLAGS \
  450. )
  451. #ifdef CONFIG_PER_VMA_LOCK
  452. static int query_vma_setup(struct proc_maps_locking_ctx *lock_ctx)
  453. {
  454. reset_lock_ctx(lock_ctx);
  455. return 0;
  456. }
  457. static void query_vma_teardown(struct proc_maps_locking_ctx *lock_ctx)
  458. {
  459. if (lock_ctx->mmap_locked) {
  460. mmap_read_unlock(lock_ctx->mm);
  461. lock_ctx->mmap_locked = false;
  462. } else {
  463. unlock_ctx_vma(lock_ctx);
  464. }
  465. }
  466. static struct vm_area_struct *query_vma_find_by_addr(struct proc_maps_locking_ctx *lock_ctx,
  467. unsigned long addr)
  468. {
  469. struct mm_struct *mm = lock_ctx->mm;
  470. struct vm_area_struct *vma;
  471. struct vma_iterator vmi;
  472. if (lock_ctx->mmap_locked)
  473. return find_vma(mm, addr);
  474. /* Unlock previously locked VMA and find the next one under RCU */
  475. unlock_ctx_vma(lock_ctx);
  476. rcu_read_lock();
  477. vma_iter_init(&vmi, mm, addr);
  478. vma = lock_next_vma(mm, &vmi, addr);
  479. rcu_read_unlock();
  480. if (!vma)
  481. return NULL;
  482. if (!IS_ERR(vma)) {
  483. lock_ctx->locked_vma = vma;
  484. return vma;
  485. }
  486. if (PTR_ERR(vma) == -EAGAIN) {
  487. /* Fallback to mmap_lock on vma->vm_refcnt overflow */
  488. mmap_read_lock(mm);
  489. vma = find_vma(mm, addr);
  490. lock_ctx->mmap_locked = true;
  491. }
  492. return vma;
  493. }
  494. #else /* CONFIG_PER_VMA_LOCK */
  495. static int query_vma_setup(struct proc_maps_locking_ctx *lock_ctx)
  496. {
  497. return mmap_read_lock_killable(lock_ctx->mm);
  498. }
  499. static void query_vma_teardown(struct proc_maps_locking_ctx *lock_ctx)
  500. {
  501. mmap_read_unlock(lock_ctx->mm);
  502. }
  503. static struct vm_area_struct *query_vma_find_by_addr(struct proc_maps_locking_ctx *lock_ctx,
  504. unsigned long addr)
  505. {
  506. return find_vma(lock_ctx->mm, addr);
  507. }
  508. #endif /* CONFIG_PER_VMA_LOCK */
  509. static struct vm_area_struct *query_matching_vma(struct proc_maps_locking_ctx *lock_ctx,
  510. unsigned long addr, u32 flags)
  511. {
  512. struct vm_area_struct *vma;
  513. next_vma:
  514. vma = query_vma_find_by_addr(lock_ctx, addr);
  515. if (IS_ERR(vma))
  516. return vma;
  517. if (!vma)
  518. goto no_vma;
  519. /* user requested only file-backed VMA, keep iterating */
  520. if ((flags & PROCMAP_QUERY_FILE_BACKED_VMA) && !vma->vm_file)
  521. goto skip_vma;
  522. /* VMA permissions should satisfy query flags */
  523. if (flags & PROCMAP_QUERY_VMA_FLAGS) {
  524. u32 perm = 0;
  525. if (flags & PROCMAP_QUERY_VMA_READABLE)
  526. perm |= VM_READ;
  527. if (flags & PROCMAP_QUERY_VMA_WRITABLE)
  528. perm |= VM_WRITE;
  529. if (flags & PROCMAP_QUERY_VMA_EXECUTABLE)
  530. perm |= VM_EXEC;
  531. if (flags & PROCMAP_QUERY_VMA_SHARED)
  532. perm |= VM_MAYSHARE;
  533. if ((vma->vm_flags & perm) != perm)
  534. goto skip_vma;
  535. }
  536. /* found covering VMA or user is OK with the matching next VMA */
  537. if ((flags & PROCMAP_QUERY_COVERING_OR_NEXT_VMA) || vma->vm_start <= addr)
  538. return vma;
  539. skip_vma:
  540. /*
  541. * If the user needs closest matching VMA, keep iterating.
  542. */
  543. addr = vma->vm_end;
  544. if (flags & PROCMAP_QUERY_COVERING_OR_NEXT_VMA)
  545. goto next_vma;
  546. no_vma:
  547. return ERR_PTR(-ENOENT);
  548. }
  549. static int do_procmap_query(struct mm_struct *mm, void __user *uarg)
  550. {
  551. struct proc_maps_locking_ctx lock_ctx = { .mm = mm };
  552. struct procmap_query karg;
  553. struct vm_area_struct *vma;
  554. struct file *vm_file = NULL;
  555. const char *name = NULL;
  556. char build_id_buf[BUILD_ID_SIZE_MAX], *name_buf = NULL;
  557. __u64 usize;
  558. int err;
  559. if (copy_from_user(&usize, (void __user *)uarg, sizeof(usize)))
  560. return -EFAULT;
  561. /* argument struct can never be that large, reject abuse */
  562. if (usize > PAGE_SIZE)
  563. return -E2BIG;
  564. /* argument struct should have at least query_flags and query_addr fields */
  565. if (usize < offsetofend(struct procmap_query, query_addr))
  566. return -EINVAL;
  567. err = copy_struct_from_user(&karg, sizeof(karg), uarg, usize);
  568. if (err)
  569. return err;
  570. /* reject unknown flags */
  571. if (karg.query_flags & ~PROCMAP_QUERY_VALID_FLAGS_MASK)
  572. return -EINVAL;
  573. /* either both buffer address and size are set, or both should be zero */
  574. if (!!karg.vma_name_size != !!karg.vma_name_addr)
  575. return -EINVAL;
  576. if (!!karg.build_id_size != !!karg.build_id_addr)
  577. return -EINVAL;
  578. if (!mm || !mmget_not_zero(mm))
  579. return -ESRCH;
  580. err = query_vma_setup(&lock_ctx);
  581. if (err) {
  582. mmput(mm);
  583. return err;
  584. }
  585. vma = query_matching_vma(&lock_ctx, karg.query_addr, karg.query_flags);
  586. if (IS_ERR(vma)) {
  587. err = PTR_ERR(vma);
  588. vma = NULL;
  589. goto out;
  590. }
  591. karg.vma_start = vma->vm_start;
  592. karg.vma_end = vma->vm_end;
  593. karg.vma_flags = 0;
  594. if (vma->vm_flags & VM_READ)
  595. karg.vma_flags |= PROCMAP_QUERY_VMA_READABLE;
  596. if (vma->vm_flags & VM_WRITE)
  597. karg.vma_flags |= PROCMAP_QUERY_VMA_WRITABLE;
  598. if (vma->vm_flags & VM_EXEC)
  599. karg.vma_flags |= PROCMAP_QUERY_VMA_EXECUTABLE;
  600. if (vma->vm_flags & VM_MAYSHARE)
  601. karg.vma_flags |= PROCMAP_QUERY_VMA_SHARED;
  602. karg.vma_page_size = vma_kernel_pagesize(vma);
  603. if (vma->vm_file) {
  604. const struct inode *inode = file_user_inode(vma->vm_file);
  605. karg.vma_offset = ((__u64)vma->vm_pgoff) << PAGE_SHIFT;
  606. karg.dev_major = MAJOR(inode->i_sb->s_dev);
  607. karg.dev_minor = MINOR(inode->i_sb->s_dev);
  608. karg.inode = inode->i_ino;
  609. } else {
  610. karg.vma_offset = 0;
  611. karg.dev_major = 0;
  612. karg.dev_minor = 0;
  613. karg.inode = 0;
  614. }
  615. if (karg.vma_name_size) {
  616. size_t name_buf_sz = min_t(size_t, PATH_MAX, karg.vma_name_size);
  617. const struct path *path;
  618. const char *name_fmt;
  619. size_t name_sz = 0;
  620. get_vma_name(vma, &path, &name, &name_fmt);
  621. if (path || name_fmt || name) {
  622. name_buf = kmalloc(name_buf_sz, GFP_KERNEL);
  623. if (!name_buf) {
  624. err = -ENOMEM;
  625. goto out;
  626. }
  627. }
  628. if (path) {
  629. name = d_path(path, name_buf, name_buf_sz);
  630. if (IS_ERR(name)) {
  631. err = PTR_ERR(name);
  632. goto out;
  633. }
  634. name_sz = name_buf + name_buf_sz - name;
  635. } else if (name || name_fmt) {
  636. name_sz = 1 + snprintf(name_buf, name_buf_sz, name_fmt ?: "%s", name);
  637. name = name_buf;
  638. }
  639. if (name_sz > name_buf_sz) {
  640. err = -ENAMETOOLONG;
  641. goto out;
  642. }
  643. karg.vma_name_size = name_sz;
  644. }
  645. if (karg.build_id_size && vma->vm_file)
  646. vm_file = get_file(vma->vm_file);
  647. /* unlock vma or mmap_lock, and put mm_struct before copying data to user */
  648. query_vma_teardown(&lock_ctx);
  649. mmput(mm);
  650. if (karg.build_id_size) {
  651. __u32 build_id_sz;
  652. if (vm_file)
  653. err = build_id_parse_file(vm_file, build_id_buf, &build_id_sz);
  654. else
  655. err = -ENOENT;
  656. if (err) {
  657. karg.build_id_size = 0;
  658. } else {
  659. if (karg.build_id_size < build_id_sz) {
  660. err = -ENAMETOOLONG;
  661. goto out_file;
  662. }
  663. karg.build_id_size = build_id_sz;
  664. }
  665. }
  666. if (vm_file)
  667. fput(vm_file);
  668. if (karg.vma_name_size && copy_to_user(u64_to_user_ptr(karg.vma_name_addr),
  669. name, karg.vma_name_size)) {
  670. kfree(name_buf);
  671. return -EFAULT;
  672. }
  673. kfree(name_buf);
  674. if (karg.build_id_size && copy_to_user(u64_to_user_ptr(karg.build_id_addr),
  675. build_id_buf, karg.build_id_size))
  676. return -EFAULT;
  677. if (copy_to_user(uarg, &karg, min_t(size_t, sizeof(karg), usize)))
  678. return -EFAULT;
  679. return 0;
  680. out:
  681. query_vma_teardown(&lock_ctx);
  682. mmput(mm);
  683. out_file:
  684. if (vm_file)
  685. fput(vm_file);
  686. kfree(name_buf);
  687. return err;
  688. }
  689. static long procfs_procmap_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
  690. {
  691. struct seq_file *seq = file->private_data;
  692. struct proc_maps_private *priv = seq->private;
  693. switch (cmd) {
  694. case PROCMAP_QUERY:
  695. /* priv->lock_ctx.mm is set during file open operation */
  696. return do_procmap_query(priv->lock_ctx.mm, (void __user *)arg);
  697. default:
  698. return -ENOIOCTLCMD;
  699. }
  700. }
  701. const struct file_operations proc_pid_maps_operations = {
  702. .open = pid_maps_open,
  703. .read = seq_read,
  704. .llseek = seq_lseek,
  705. .release = proc_map_release,
  706. .unlocked_ioctl = procfs_procmap_ioctl,
  707. .compat_ioctl = compat_ptr_ioctl,
  708. };
  709. /*
  710. * Proportional Set Size(PSS): my share of RSS.
  711. *
  712. * PSS of a process is the count of pages it has in memory, where each
  713. * page is divided by the number of processes sharing it. So if a
  714. * process has 1000 pages all to itself, and 1000 shared with one other
  715. * process, its PSS will be 1500.
  716. *
  717. * To keep (accumulated) division errors low, we adopt a 64bit
  718. * fixed-point pss counter to minimize division errors. So (pss >>
  719. * PSS_SHIFT) would be the real byte count.
  720. *
  721. * A shift of 12 before division means (assuming 4K page size):
  722. * - 1M 3-user-pages add up to 8KB errors;
  723. * - supports mapcount up to 2^24, or 16M;
  724. * - supports PSS up to 2^52 bytes, or 4PB.
  725. */
  726. #define PSS_SHIFT 12
  727. #ifdef CONFIG_PROC_PAGE_MONITOR
  728. struct mem_size_stats {
  729. unsigned long resident;
  730. unsigned long shared_clean;
  731. unsigned long shared_dirty;
  732. unsigned long private_clean;
  733. unsigned long private_dirty;
  734. unsigned long referenced;
  735. unsigned long anonymous;
  736. unsigned long lazyfree;
  737. unsigned long anonymous_thp;
  738. unsigned long shmem_thp;
  739. unsigned long file_thp;
  740. unsigned long swap;
  741. unsigned long shared_hugetlb;
  742. unsigned long private_hugetlb;
  743. unsigned long ksm;
  744. u64 pss;
  745. u64 pss_anon;
  746. u64 pss_file;
  747. u64 pss_shmem;
  748. u64 pss_dirty;
  749. u64 pss_locked;
  750. u64 swap_pss;
  751. };
  752. static void smaps_page_accumulate(struct mem_size_stats *mss,
  753. struct folio *folio, unsigned long size, unsigned long pss,
  754. bool dirty, bool locked, bool private)
  755. {
  756. mss->pss += pss;
  757. if (folio_test_anon(folio))
  758. mss->pss_anon += pss;
  759. else if (folio_test_swapbacked(folio))
  760. mss->pss_shmem += pss;
  761. else
  762. mss->pss_file += pss;
  763. if (locked)
  764. mss->pss_locked += pss;
  765. if (dirty || folio_test_dirty(folio)) {
  766. mss->pss_dirty += pss;
  767. if (private)
  768. mss->private_dirty += size;
  769. else
  770. mss->shared_dirty += size;
  771. } else {
  772. if (private)
  773. mss->private_clean += size;
  774. else
  775. mss->shared_clean += size;
  776. }
  777. }
  778. static void smaps_account(struct mem_size_stats *mss, struct page *page,
  779. bool compound, bool young, bool dirty, bool locked,
  780. bool present)
  781. {
  782. struct folio *folio = page_folio(page);
  783. int i, nr = compound ? compound_nr(page) : 1;
  784. unsigned long size = nr * PAGE_SIZE;
  785. bool exclusive;
  786. int mapcount;
  787. /*
  788. * First accumulate quantities that depend only on |size| and the type
  789. * of the compound page.
  790. */
  791. if (folio_test_anon(folio)) {
  792. mss->anonymous += size;
  793. if (!folio_test_swapbacked(folio) && !dirty &&
  794. !folio_test_dirty(folio))
  795. mss->lazyfree += size;
  796. }
  797. if (folio_test_ksm(folio))
  798. mss->ksm += size;
  799. mss->resident += size;
  800. /* Accumulate the size in pages that have been accessed. */
  801. if (young || folio_test_young(folio) || folio_test_referenced(folio))
  802. mss->referenced += size;
  803. /*
  804. * Then accumulate quantities that may depend on sharing, or that may
  805. * differ page-by-page.
  806. *
  807. * refcount == 1 for present entries guarantees that the folio is mapped
  808. * exactly once. For large folios this implies that exactly one
  809. * PTE/PMD/... maps (a part of) this folio.
  810. *
  811. * Treat all non-present entries (where relying on the mapcount and
  812. * refcount doesn't make sense) as "maybe shared, but not sure how
  813. * often". We treat device private entries as being fake-present.
  814. *
  815. * Note that it would not be safe to read the mapcount especially for
  816. * pages referenced by migration entries, even with the PTL held.
  817. */
  818. if (folio_ref_count(folio) == 1 || !present) {
  819. smaps_page_accumulate(mss, folio, size, size << PSS_SHIFT,
  820. dirty, locked, present);
  821. return;
  822. }
  823. if (IS_ENABLED(CONFIG_NO_PAGE_MAPCOUNT)) {
  824. mapcount = folio_average_page_mapcount(folio);
  825. exclusive = !folio_maybe_mapped_shared(folio);
  826. }
  827. /*
  828. * We obtain a snapshot of the mapcount. Without holding the folio lock
  829. * this snapshot can be slightly wrong as we cannot always read the
  830. * mapcount atomically.
  831. */
  832. for (i = 0; i < nr; i++, page++) {
  833. unsigned long pss = PAGE_SIZE << PSS_SHIFT;
  834. if (IS_ENABLED(CONFIG_PAGE_MAPCOUNT)) {
  835. mapcount = folio_precise_page_mapcount(folio, page);
  836. exclusive = mapcount < 2;
  837. }
  838. if (mapcount >= 2)
  839. pss /= mapcount;
  840. smaps_page_accumulate(mss, folio, PAGE_SIZE, pss,
  841. dirty, locked, exclusive);
  842. }
  843. }
  844. #ifdef CONFIG_SHMEM
  845. static int smaps_pte_hole(unsigned long addr, unsigned long end,
  846. __always_unused int depth, struct mm_walk *walk)
  847. {
  848. struct mem_size_stats *mss = walk->private;
  849. struct vm_area_struct *vma = walk->vma;
  850. mss->swap += shmem_partial_swap_usage(walk->vma->vm_file->f_mapping,
  851. linear_page_index(vma, addr),
  852. linear_page_index(vma, end));
  853. return 0;
  854. }
  855. #else
  856. #define smaps_pte_hole NULL
  857. #endif /* CONFIG_SHMEM */
  858. static void smaps_pte_hole_lookup(unsigned long addr, struct mm_walk *walk)
  859. {
  860. #ifdef CONFIG_SHMEM
  861. if (walk->ops->pte_hole) {
  862. /* depth is not used */
  863. smaps_pte_hole(addr, addr + PAGE_SIZE, 0, walk);
  864. }
  865. #endif
  866. }
  867. static void smaps_pte_entry(pte_t *pte, unsigned long addr,
  868. struct mm_walk *walk)
  869. {
  870. struct mem_size_stats *mss = walk->private;
  871. struct vm_area_struct *vma = walk->vma;
  872. bool locked = !!(vma->vm_flags & VM_LOCKED);
  873. struct page *page = NULL;
  874. bool present = false, young = false, dirty = false;
  875. pte_t ptent = ptep_get(pte);
  876. if (pte_present(ptent)) {
  877. page = vm_normal_page(vma, addr, ptent);
  878. young = pte_young(ptent);
  879. dirty = pte_dirty(ptent);
  880. present = true;
  881. } else if (pte_none(ptent)) {
  882. smaps_pte_hole_lookup(addr, walk);
  883. } else {
  884. const softleaf_t entry = softleaf_from_pte(ptent);
  885. if (softleaf_is_swap(entry)) {
  886. int mapcount;
  887. mss->swap += PAGE_SIZE;
  888. mapcount = swp_swapcount(entry);
  889. if (mapcount >= 2) {
  890. u64 pss_delta = (u64)PAGE_SIZE << PSS_SHIFT;
  891. do_div(pss_delta, mapcount);
  892. mss->swap_pss += pss_delta;
  893. } else {
  894. mss->swap_pss += (u64)PAGE_SIZE << PSS_SHIFT;
  895. }
  896. } else if (softleaf_has_pfn(entry)) {
  897. if (softleaf_is_device_private(entry))
  898. present = true;
  899. page = softleaf_to_page(entry);
  900. }
  901. }
  902. if (!page)
  903. return;
  904. smaps_account(mss, page, false, young, dirty, locked, present);
  905. }
  906. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  907. static void smaps_pmd_entry(pmd_t *pmd, unsigned long addr,
  908. struct mm_walk *walk)
  909. {
  910. struct mem_size_stats *mss = walk->private;
  911. struct vm_area_struct *vma = walk->vma;
  912. bool locked = !!(vma->vm_flags & VM_LOCKED);
  913. struct page *page = NULL;
  914. bool present = false;
  915. struct folio *folio;
  916. if (pmd_none(*pmd))
  917. return;
  918. if (pmd_present(*pmd)) {
  919. page = vm_normal_page_pmd(vma, addr, *pmd);
  920. present = true;
  921. } else if (unlikely(thp_migration_supported())) {
  922. const softleaf_t entry = softleaf_from_pmd(*pmd);
  923. if (softleaf_has_pfn(entry))
  924. page = softleaf_to_page(entry);
  925. }
  926. if (IS_ERR_OR_NULL(page))
  927. return;
  928. folio = page_folio(page);
  929. if (folio_test_anon(folio))
  930. mss->anonymous_thp += HPAGE_PMD_SIZE;
  931. else if (folio_test_swapbacked(folio))
  932. mss->shmem_thp += HPAGE_PMD_SIZE;
  933. else if (folio_is_zone_device(folio))
  934. /* pass */;
  935. else
  936. mss->file_thp += HPAGE_PMD_SIZE;
  937. smaps_account(mss, page, true, pmd_young(*pmd), pmd_dirty(*pmd),
  938. locked, present);
  939. }
  940. #else
  941. static void smaps_pmd_entry(pmd_t *pmd, unsigned long addr,
  942. struct mm_walk *walk)
  943. {
  944. }
  945. #endif
  946. static int smaps_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
  947. struct mm_walk *walk)
  948. {
  949. struct vm_area_struct *vma = walk->vma;
  950. pte_t *pte;
  951. spinlock_t *ptl;
  952. ptl = pmd_trans_huge_lock(pmd, vma);
  953. if (ptl) {
  954. smaps_pmd_entry(pmd, addr, walk);
  955. spin_unlock(ptl);
  956. goto out;
  957. }
  958. pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
  959. if (!pte) {
  960. walk->action = ACTION_AGAIN;
  961. return 0;
  962. }
  963. for (; addr != end; pte++, addr += PAGE_SIZE)
  964. smaps_pte_entry(pte, addr, walk);
  965. pte_unmap_unlock(pte - 1, ptl);
  966. out:
  967. cond_resched();
  968. return 0;
  969. }
  970. static void show_smap_vma_flags(struct seq_file *m, struct vm_area_struct *vma)
  971. {
  972. /*
  973. * Don't forget to update Documentation/ on changes.
  974. *
  975. * The length of the second argument of mnemonics[]
  976. * needs to be 3 instead of previously set 2
  977. * (i.e. from [BITS_PER_LONG][2] to [BITS_PER_LONG][3])
  978. * to avoid spurious
  979. * -Werror=unterminated-string-initialization warning
  980. * with GCC 15
  981. */
  982. static const char mnemonics[BITS_PER_LONG][3] = {
  983. /*
  984. * In case if we meet a flag we don't know about.
  985. */
  986. [0 ... (BITS_PER_LONG-1)] = "??",
  987. [ilog2(VM_READ)] = "rd",
  988. [ilog2(VM_WRITE)] = "wr",
  989. [ilog2(VM_EXEC)] = "ex",
  990. [ilog2(VM_SHARED)] = "sh",
  991. [ilog2(VM_MAYREAD)] = "mr",
  992. [ilog2(VM_MAYWRITE)] = "mw",
  993. [ilog2(VM_MAYEXEC)] = "me",
  994. [ilog2(VM_MAYSHARE)] = "ms",
  995. [ilog2(VM_GROWSDOWN)] = "gd",
  996. [ilog2(VM_PFNMAP)] = "pf",
  997. [ilog2(VM_MAYBE_GUARD)] = "gu",
  998. [ilog2(VM_LOCKED)] = "lo",
  999. [ilog2(VM_IO)] = "io",
  1000. [ilog2(VM_SEQ_READ)] = "sr",
  1001. [ilog2(VM_RAND_READ)] = "rr",
  1002. [ilog2(VM_DONTCOPY)] = "dc",
  1003. [ilog2(VM_DONTEXPAND)] = "de",
  1004. [ilog2(VM_LOCKONFAULT)] = "lf",
  1005. [ilog2(VM_ACCOUNT)] = "ac",
  1006. [ilog2(VM_NORESERVE)] = "nr",
  1007. [ilog2(VM_HUGETLB)] = "ht",
  1008. [ilog2(VM_SYNC)] = "sf",
  1009. [ilog2(VM_ARCH_1)] = "ar",
  1010. [ilog2(VM_WIPEONFORK)] = "wf",
  1011. [ilog2(VM_DONTDUMP)] = "dd",
  1012. #ifdef CONFIG_ARM64_BTI
  1013. [ilog2(VM_ARM64_BTI)] = "bt",
  1014. #endif
  1015. #ifdef CONFIG_MEM_SOFT_DIRTY
  1016. [ilog2(VM_SOFTDIRTY)] = "sd",
  1017. #endif
  1018. [ilog2(VM_MIXEDMAP)] = "mm",
  1019. [ilog2(VM_HUGEPAGE)] = "hg",
  1020. [ilog2(VM_NOHUGEPAGE)] = "nh",
  1021. [ilog2(VM_MERGEABLE)] = "mg",
  1022. [ilog2(VM_UFFD_MISSING)]= "um",
  1023. [ilog2(VM_UFFD_WP)] = "uw",
  1024. #ifdef CONFIG_ARM64_MTE
  1025. [ilog2(VM_MTE)] = "mt",
  1026. [ilog2(VM_MTE_ALLOWED)] = "",
  1027. #endif
  1028. #ifdef CONFIG_ARCH_HAS_PKEYS
  1029. /* These come out via ProtectionKey: */
  1030. [ilog2(VM_PKEY_BIT0)] = "",
  1031. [ilog2(VM_PKEY_BIT1)] = "",
  1032. [ilog2(VM_PKEY_BIT2)] = "",
  1033. #if CONFIG_ARCH_PKEY_BITS > 3
  1034. [ilog2(VM_PKEY_BIT3)] = "",
  1035. #endif
  1036. #if CONFIG_ARCH_PKEY_BITS > 4
  1037. [ilog2(VM_PKEY_BIT4)] = "",
  1038. #endif
  1039. #endif /* CONFIG_ARCH_HAS_PKEYS */
  1040. #ifdef CONFIG_HAVE_ARCH_USERFAULTFD_MINOR
  1041. [ilog2(VM_UFFD_MINOR)] = "ui",
  1042. #endif /* CONFIG_HAVE_ARCH_USERFAULTFD_MINOR */
  1043. #ifdef CONFIG_ARCH_HAS_USER_SHADOW_STACK
  1044. [ilog2(VM_SHADOW_STACK)] = "ss",
  1045. #endif
  1046. #if defined(CONFIG_64BIT) || defined(CONFIG_PPC32)
  1047. [ilog2(VM_DROPPABLE)] = "dp",
  1048. #endif
  1049. #ifdef CONFIG_64BIT
  1050. [ilog2(VM_SEALED)] = "sl",
  1051. #endif
  1052. };
  1053. size_t i;
  1054. seq_puts(m, "VmFlags: ");
  1055. for (i = 0; i < BITS_PER_LONG; i++) {
  1056. if (!mnemonics[i][0])
  1057. continue;
  1058. if (vma->vm_flags & (1UL << i))
  1059. seq_printf(m, "%s ", mnemonics[i]);
  1060. }
  1061. seq_putc(m, '\n');
  1062. }
  1063. #ifdef CONFIG_HUGETLB_PAGE
  1064. static int smaps_hugetlb_range(pte_t *pte, unsigned long hmask,
  1065. unsigned long addr, unsigned long end,
  1066. struct mm_walk *walk)
  1067. {
  1068. struct mem_size_stats *mss = walk->private;
  1069. struct vm_area_struct *vma = walk->vma;
  1070. struct folio *folio = NULL;
  1071. bool present = false;
  1072. spinlock_t *ptl;
  1073. pte_t ptent;
  1074. ptl = huge_pte_lock(hstate_vma(vma), walk->mm, pte);
  1075. ptent = huge_ptep_get(walk->mm, addr, pte);
  1076. if (pte_present(ptent)) {
  1077. folio = page_folio(pte_page(ptent));
  1078. present = true;
  1079. } else {
  1080. const softleaf_t entry = softleaf_from_pte(ptent);
  1081. if (softleaf_has_pfn(entry))
  1082. folio = softleaf_to_folio(entry);
  1083. }
  1084. if (folio) {
  1085. /* We treat non-present entries as "maybe shared". */
  1086. if (!present || folio_maybe_mapped_shared(folio) ||
  1087. hugetlb_pmd_shared(pte))
  1088. mss->shared_hugetlb += huge_page_size(hstate_vma(vma));
  1089. else
  1090. mss->private_hugetlb += huge_page_size(hstate_vma(vma));
  1091. }
  1092. spin_unlock(ptl);
  1093. return 0;
  1094. }
  1095. #else
  1096. #define smaps_hugetlb_range NULL
  1097. #endif /* HUGETLB_PAGE */
  1098. static const struct mm_walk_ops smaps_walk_ops = {
  1099. .pmd_entry = smaps_pte_range,
  1100. .hugetlb_entry = smaps_hugetlb_range,
  1101. .walk_lock = PGWALK_RDLOCK,
  1102. };
  1103. static const struct mm_walk_ops smaps_shmem_walk_ops = {
  1104. .pmd_entry = smaps_pte_range,
  1105. .hugetlb_entry = smaps_hugetlb_range,
  1106. .pte_hole = smaps_pte_hole,
  1107. .walk_lock = PGWALK_RDLOCK,
  1108. };
  1109. /*
  1110. * Gather mem stats from @vma with the indicated beginning
  1111. * address @start, and keep them in @mss.
  1112. *
  1113. * Use vm_start of @vma as the beginning address if @start is 0.
  1114. */
  1115. static void smap_gather_stats(struct vm_area_struct *vma,
  1116. struct mem_size_stats *mss, unsigned long start)
  1117. {
  1118. const struct mm_walk_ops *ops = &smaps_walk_ops;
  1119. /* Invalid start */
  1120. if (start >= vma->vm_end)
  1121. return;
  1122. if (vma->vm_file && shmem_mapping(vma->vm_file->f_mapping)) {
  1123. /*
  1124. * For shared or readonly shmem mappings we know that all
  1125. * swapped out pages belong to the shmem object, and we can
  1126. * obtain the swap value much more efficiently. For private
  1127. * writable mappings, we might have COW pages that are
  1128. * not affected by the parent swapped out pages of the shmem
  1129. * object, so we have to distinguish them during the page walk.
  1130. * Unless we know that the shmem object (or the part mapped by
  1131. * our VMA) has no swapped out pages at all.
  1132. */
  1133. unsigned long shmem_swapped = shmem_swap_usage(vma);
  1134. if (!start && (!shmem_swapped || (vma->vm_flags & VM_SHARED) ||
  1135. !(vma->vm_flags & VM_WRITE))) {
  1136. mss->swap += shmem_swapped;
  1137. } else {
  1138. ops = &smaps_shmem_walk_ops;
  1139. }
  1140. }
  1141. /* mmap_lock is held in m_start */
  1142. if (!start)
  1143. walk_page_vma(vma, ops, mss);
  1144. else
  1145. walk_page_range(vma->vm_mm, start, vma->vm_end, ops, mss);
  1146. }
  1147. #define SEQ_PUT_DEC(str, val) \
  1148. seq_put_decimal_ull_width(m, str, (val) >> 10, 8)
  1149. /* Show the contents common for smaps and smaps_rollup */
  1150. static void __show_smap(struct seq_file *m, const struct mem_size_stats *mss,
  1151. bool rollup_mode)
  1152. {
  1153. SEQ_PUT_DEC("Rss: ", mss->resident);
  1154. SEQ_PUT_DEC(" kB\nPss: ", mss->pss >> PSS_SHIFT);
  1155. SEQ_PUT_DEC(" kB\nPss_Dirty: ", mss->pss_dirty >> PSS_SHIFT);
  1156. if (rollup_mode) {
  1157. /*
  1158. * These are meaningful only for smaps_rollup, otherwise two of
  1159. * them are zero, and the other one is the same as Pss.
  1160. */
  1161. SEQ_PUT_DEC(" kB\nPss_Anon: ",
  1162. mss->pss_anon >> PSS_SHIFT);
  1163. SEQ_PUT_DEC(" kB\nPss_File: ",
  1164. mss->pss_file >> PSS_SHIFT);
  1165. SEQ_PUT_DEC(" kB\nPss_Shmem: ",
  1166. mss->pss_shmem >> PSS_SHIFT);
  1167. }
  1168. SEQ_PUT_DEC(" kB\nShared_Clean: ", mss->shared_clean);
  1169. SEQ_PUT_DEC(" kB\nShared_Dirty: ", mss->shared_dirty);
  1170. SEQ_PUT_DEC(" kB\nPrivate_Clean: ", mss->private_clean);
  1171. SEQ_PUT_DEC(" kB\nPrivate_Dirty: ", mss->private_dirty);
  1172. SEQ_PUT_DEC(" kB\nReferenced: ", mss->referenced);
  1173. SEQ_PUT_DEC(" kB\nAnonymous: ", mss->anonymous);
  1174. SEQ_PUT_DEC(" kB\nKSM: ", mss->ksm);
  1175. SEQ_PUT_DEC(" kB\nLazyFree: ", mss->lazyfree);
  1176. SEQ_PUT_DEC(" kB\nAnonHugePages: ", mss->anonymous_thp);
  1177. SEQ_PUT_DEC(" kB\nShmemPmdMapped: ", mss->shmem_thp);
  1178. SEQ_PUT_DEC(" kB\nFilePmdMapped: ", mss->file_thp);
  1179. SEQ_PUT_DEC(" kB\nShared_Hugetlb: ", mss->shared_hugetlb);
  1180. seq_put_decimal_ull_width(m, " kB\nPrivate_Hugetlb: ",
  1181. mss->private_hugetlb >> 10, 7);
  1182. SEQ_PUT_DEC(" kB\nSwap: ", mss->swap);
  1183. SEQ_PUT_DEC(" kB\nSwapPss: ",
  1184. mss->swap_pss >> PSS_SHIFT);
  1185. SEQ_PUT_DEC(" kB\nLocked: ",
  1186. mss->pss_locked >> PSS_SHIFT);
  1187. seq_puts(m, " kB\n");
  1188. }
  1189. static int show_smap(struct seq_file *m, void *v)
  1190. {
  1191. struct vm_area_struct *vma = v;
  1192. struct mem_size_stats mss = {};
  1193. smap_gather_stats(vma, &mss, 0);
  1194. show_map_vma(m, vma);
  1195. SEQ_PUT_DEC("Size: ", vma->vm_end - vma->vm_start);
  1196. SEQ_PUT_DEC(" kB\nKernelPageSize: ", vma_kernel_pagesize(vma));
  1197. SEQ_PUT_DEC(" kB\nMMUPageSize: ", vma_mmu_pagesize(vma));
  1198. seq_puts(m, " kB\n");
  1199. __show_smap(m, &mss, false);
  1200. seq_printf(m, "THPeligible: %8u\n",
  1201. !!thp_vma_allowable_orders(vma, vma->vm_flags, TVA_SMAPS,
  1202. THP_ORDERS_ALL));
  1203. if (arch_pkeys_enabled())
  1204. seq_printf(m, "ProtectionKey: %8u\n", vma_pkey(vma));
  1205. show_smap_vma_flags(m, vma);
  1206. return 0;
  1207. }
  1208. static int show_smaps_rollup(struct seq_file *m, void *v)
  1209. {
  1210. struct proc_maps_private *priv = m->private;
  1211. struct mem_size_stats mss = {};
  1212. struct mm_struct *mm = priv->lock_ctx.mm;
  1213. struct vm_area_struct *vma;
  1214. unsigned long vma_start = 0, last_vma_end = 0;
  1215. int ret = 0;
  1216. VMA_ITERATOR(vmi, mm, 0);
  1217. priv->task = get_proc_task(priv->inode);
  1218. if (!priv->task)
  1219. return -ESRCH;
  1220. if (!mm || !mmget_not_zero(mm)) {
  1221. ret = -ESRCH;
  1222. goto out_put_task;
  1223. }
  1224. ret = mmap_read_lock_killable(mm);
  1225. if (ret)
  1226. goto out_put_mm;
  1227. hold_task_mempolicy(priv);
  1228. vma = vma_next(&vmi);
  1229. if (unlikely(!vma))
  1230. goto empty_set;
  1231. vma_start = vma->vm_start;
  1232. do {
  1233. smap_gather_stats(vma, &mss, 0);
  1234. last_vma_end = vma->vm_end;
  1235. /*
  1236. * Release mmap_lock temporarily if someone wants to
  1237. * access it for write request.
  1238. */
  1239. if (mmap_lock_is_contended(mm)) {
  1240. vma_iter_invalidate(&vmi);
  1241. mmap_read_unlock(mm);
  1242. ret = mmap_read_lock_killable(mm);
  1243. if (ret) {
  1244. release_task_mempolicy(priv);
  1245. goto out_put_mm;
  1246. }
  1247. /*
  1248. * After dropping the lock, there are four cases to
  1249. * consider. See the following example for explanation.
  1250. *
  1251. * +------+------+-----------+
  1252. * | VMA1 | VMA2 | VMA3 |
  1253. * +------+------+-----------+
  1254. * | | | |
  1255. * 4k 8k 16k 400k
  1256. *
  1257. * Suppose we drop the lock after reading VMA2 due to
  1258. * contention, then we get:
  1259. *
  1260. * last_vma_end = 16k
  1261. *
  1262. * 1) VMA2 is freed, but VMA3 exists:
  1263. *
  1264. * vma_next(vmi) will return VMA3.
  1265. * In this case, just continue from VMA3.
  1266. *
  1267. * 2) VMA2 still exists:
  1268. *
  1269. * vma_next(vmi) will return VMA3.
  1270. * In this case, just continue from VMA3.
  1271. *
  1272. * 3) No more VMAs can be found:
  1273. *
  1274. * vma_next(vmi) will return NULL.
  1275. * No more things to do, just break.
  1276. *
  1277. * 4) (last_vma_end - 1) is the middle of a vma (VMA'):
  1278. *
  1279. * vma_next(vmi) will return VMA' whose range
  1280. * contains last_vma_end.
  1281. * Iterate VMA' from last_vma_end.
  1282. */
  1283. vma = vma_next(&vmi);
  1284. /* Case 3 above */
  1285. if (!vma)
  1286. break;
  1287. /* Case 1 and 2 above */
  1288. if (vma->vm_start >= last_vma_end) {
  1289. smap_gather_stats(vma, &mss, 0);
  1290. last_vma_end = vma->vm_end;
  1291. continue;
  1292. }
  1293. /* Case 4 above */
  1294. if (vma->vm_end > last_vma_end) {
  1295. smap_gather_stats(vma, &mss, last_vma_end);
  1296. last_vma_end = vma->vm_end;
  1297. }
  1298. }
  1299. } for_each_vma(vmi, vma);
  1300. empty_set:
  1301. show_vma_header_prefix(m, vma_start, last_vma_end, 0, 0, 0, 0);
  1302. seq_pad(m, ' ');
  1303. seq_puts(m, "[rollup]\n");
  1304. __show_smap(m, &mss, true);
  1305. release_task_mempolicy(priv);
  1306. mmap_read_unlock(mm);
  1307. out_put_mm:
  1308. mmput(mm);
  1309. out_put_task:
  1310. put_task_struct(priv->task);
  1311. priv->task = NULL;
  1312. return ret;
  1313. }
  1314. #undef SEQ_PUT_DEC
  1315. static const struct seq_operations proc_pid_smaps_op = {
  1316. .start = m_start,
  1317. .next = m_next,
  1318. .stop = m_stop,
  1319. .show = show_smap
  1320. };
  1321. static int pid_smaps_open(struct inode *inode, struct file *file)
  1322. {
  1323. return do_maps_open(inode, file, &proc_pid_smaps_op);
  1324. }
  1325. static int smaps_rollup_open(struct inode *inode, struct file *file)
  1326. {
  1327. int ret;
  1328. struct proc_maps_private *priv;
  1329. priv = kzalloc_obj(*priv, GFP_KERNEL_ACCOUNT);
  1330. if (!priv)
  1331. return -ENOMEM;
  1332. ret = single_open(file, show_smaps_rollup, priv);
  1333. if (ret)
  1334. goto out_free;
  1335. priv->inode = inode;
  1336. priv->lock_ctx.mm = proc_mem_open(inode, PTRACE_MODE_READ);
  1337. if (IS_ERR_OR_NULL(priv->lock_ctx.mm)) {
  1338. ret = priv->lock_ctx.mm ? PTR_ERR(priv->lock_ctx.mm) : -ESRCH;
  1339. single_release(inode, file);
  1340. goto out_free;
  1341. }
  1342. return 0;
  1343. out_free:
  1344. kfree(priv);
  1345. return ret;
  1346. }
  1347. static int smaps_rollup_release(struct inode *inode, struct file *file)
  1348. {
  1349. struct seq_file *seq = file->private_data;
  1350. struct proc_maps_private *priv = seq->private;
  1351. if (priv->lock_ctx.mm)
  1352. mmdrop(priv->lock_ctx.mm);
  1353. kfree(priv);
  1354. return single_release(inode, file);
  1355. }
  1356. const struct file_operations proc_pid_smaps_operations = {
  1357. .open = pid_smaps_open,
  1358. .read = seq_read,
  1359. .llseek = seq_lseek,
  1360. .release = proc_map_release,
  1361. };
  1362. const struct file_operations proc_pid_smaps_rollup_operations = {
  1363. .open = smaps_rollup_open,
  1364. .read = seq_read,
  1365. .llseek = seq_lseek,
  1366. .release = smaps_rollup_release,
  1367. };
  1368. enum clear_refs_types {
  1369. CLEAR_REFS_ALL = 1,
  1370. CLEAR_REFS_ANON,
  1371. CLEAR_REFS_MAPPED,
  1372. CLEAR_REFS_SOFT_DIRTY,
  1373. CLEAR_REFS_MM_HIWATER_RSS,
  1374. CLEAR_REFS_LAST,
  1375. };
  1376. struct clear_refs_private {
  1377. enum clear_refs_types type;
  1378. };
  1379. static inline bool pte_is_pinned(struct vm_area_struct *vma, unsigned long addr, pte_t pte)
  1380. {
  1381. struct folio *folio;
  1382. if (!pte_write(pte))
  1383. return false;
  1384. if (!is_cow_mapping(vma->vm_flags))
  1385. return false;
  1386. if (likely(!mm_flags_test(MMF_HAS_PINNED, vma->vm_mm)))
  1387. return false;
  1388. folio = vm_normal_folio(vma, addr, pte);
  1389. if (!folio)
  1390. return false;
  1391. return folio_maybe_dma_pinned(folio);
  1392. }
  1393. static inline void clear_soft_dirty(struct vm_area_struct *vma,
  1394. unsigned long addr, pte_t *pte)
  1395. {
  1396. if (!pgtable_supports_soft_dirty())
  1397. return;
  1398. /*
  1399. * The soft-dirty tracker uses #PF-s to catch writes
  1400. * to pages, so write-protect the pte as well. See the
  1401. * Documentation/admin-guide/mm/soft-dirty.rst for full description
  1402. * of how soft-dirty works.
  1403. */
  1404. pte_t ptent = ptep_get(pte);
  1405. if (pte_none(ptent))
  1406. return;
  1407. if (pte_present(ptent)) {
  1408. pte_t old_pte;
  1409. if (pte_is_pinned(vma, addr, ptent))
  1410. return;
  1411. old_pte = ptep_modify_prot_start(vma, addr, pte);
  1412. ptent = pte_wrprotect(old_pte);
  1413. ptent = pte_clear_soft_dirty(ptent);
  1414. ptep_modify_prot_commit(vma, addr, pte, old_pte, ptent);
  1415. } else {
  1416. ptent = pte_swp_clear_soft_dirty(ptent);
  1417. set_pte_at(vma->vm_mm, addr, pte, ptent);
  1418. }
  1419. }
  1420. #if defined(CONFIG_TRANSPARENT_HUGEPAGE)
  1421. static inline void clear_soft_dirty_pmd(struct vm_area_struct *vma,
  1422. unsigned long addr, pmd_t *pmdp)
  1423. {
  1424. pmd_t old, pmd = *pmdp;
  1425. if (!pgtable_supports_soft_dirty())
  1426. return;
  1427. if (pmd_present(pmd)) {
  1428. /* See comment in change_huge_pmd() */
  1429. old = pmdp_invalidate(vma, addr, pmdp);
  1430. if (pmd_dirty(old))
  1431. pmd = pmd_mkdirty(pmd);
  1432. if (pmd_young(old))
  1433. pmd = pmd_mkyoung(pmd);
  1434. pmd = pmd_wrprotect(pmd);
  1435. pmd = pmd_clear_soft_dirty(pmd);
  1436. set_pmd_at(vma->vm_mm, addr, pmdp, pmd);
  1437. } else if (pmd_is_migration_entry(pmd)) {
  1438. pmd = pmd_swp_clear_soft_dirty(pmd);
  1439. set_pmd_at(vma->vm_mm, addr, pmdp, pmd);
  1440. }
  1441. }
  1442. #else
  1443. static inline void clear_soft_dirty_pmd(struct vm_area_struct *vma,
  1444. unsigned long addr, pmd_t *pmdp)
  1445. {
  1446. }
  1447. #endif
  1448. static int clear_refs_pte_range(pmd_t *pmd, unsigned long addr,
  1449. unsigned long end, struct mm_walk *walk)
  1450. {
  1451. struct clear_refs_private *cp = walk->private;
  1452. struct vm_area_struct *vma = walk->vma;
  1453. pte_t *pte, ptent;
  1454. spinlock_t *ptl;
  1455. struct folio *folio;
  1456. ptl = pmd_trans_huge_lock(pmd, vma);
  1457. if (ptl) {
  1458. if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
  1459. clear_soft_dirty_pmd(vma, addr, pmd);
  1460. goto out;
  1461. }
  1462. if (!pmd_present(*pmd))
  1463. goto out;
  1464. folio = pmd_folio(*pmd);
  1465. /* Clear accessed and referenced bits. */
  1466. pmdp_test_and_clear_young(vma, addr, pmd);
  1467. folio_test_clear_young(folio);
  1468. folio_clear_referenced(folio);
  1469. out:
  1470. spin_unlock(ptl);
  1471. return 0;
  1472. }
  1473. pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
  1474. if (!pte) {
  1475. walk->action = ACTION_AGAIN;
  1476. return 0;
  1477. }
  1478. for (; addr != end; pte++, addr += PAGE_SIZE) {
  1479. ptent = ptep_get(pte);
  1480. if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
  1481. clear_soft_dirty(vma, addr, pte);
  1482. continue;
  1483. }
  1484. if (!pte_present(ptent))
  1485. continue;
  1486. folio = vm_normal_folio(vma, addr, ptent);
  1487. if (!folio)
  1488. continue;
  1489. /* Clear accessed and referenced bits. */
  1490. ptep_test_and_clear_young(vma, addr, pte);
  1491. folio_test_clear_young(folio);
  1492. folio_clear_referenced(folio);
  1493. }
  1494. pte_unmap_unlock(pte - 1, ptl);
  1495. cond_resched();
  1496. return 0;
  1497. }
  1498. static int clear_refs_test_walk(unsigned long start, unsigned long end,
  1499. struct mm_walk *walk)
  1500. {
  1501. struct clear_refs_private *cp = walk->private;
  1502. struct vm_area_struct *vma = walk->vma;
  1503. if (vma->vm_flags & VM_PFNMAP)
  1504. return 1;
  1505. /*
  1506. * Writing 1 to /proc/pid/clear_refs affects all pages.
  1507. * Writing 2 to /proc/pid/clear_refs only affects anonymous pages.
  1508. * Writing 3 to /proc/pid/clear_refs only affects file mapped pages.
  1509. * Writing 4 to /proc/pid/clear_refs affects all pages.
  1510. */
  1511. if (cp->type == CLEAR_REFS_ANON && vma->vm_file)
  1512. return 1;
  1513. if (cp->type == CLEAR_REFS_MAPPED && !vma->vm_file)
  1514. return 1;
  1515. return 0;
  1516. }
  1517. static const struct mm_walk_ops clear_refs_walk_ops = {
  1518. .pmd_entry = clear_refs_pte_range,
  1519. .test_walk = clear_refs_test_walk,
  1520. .walk_lock = PGWALK_WRLOCK,
  1521. };
  1522. static ssize_t clear_refs_write(struct file *file, const char __user *buf,
  1523. size_t count, loff_t *ppos)
  1524. {
  1525. struct task_struct *task;
  1526. char buffer[PROC_NUMBUF] = {};
  1527. struct mm_struct *mm;
  1528. struct vm_area_struct *vma;
  1529. enum clear_refs_types type;
  1530. int itype;
  1531. int rv;
  1532. if (count > sizeof(buffer) - 1)
  1533. count = sizeof(buffer) - 1;
  1534. if (copy_from_user(buffer, buf, count))
  1535. return -EFAULT;
  1536. rv = kstrtoint(strstrip(buffer), 10, &itype);
  1537. if (rv < 0)
  1538. return rv;
  1539. type = (enum clear_refs_types)itype;
  1540. if (type < CLEAR_REFS_ALL || type >= CLEAR_REFS_LAST)
  1541. return -EINVAL;
  1542. task = get_proc_task(file_inode(file));
  1543. if (!task)
  1544. return -ESRCH;
  1545. mm = get_task_mm(task);
  1546. if (mm) {
  1547. VMA_ITERATOR(vmi, mm, 0);
  1548. struct mmu_notifier_range range;
  1549. struct clear_refs_private cp = {
  1550. .type = type,
  1551. };
  1552. if (mmap_write_lock_killable(mm)) {
  1553. count = -EINTR;
  1554. goto out_mm;
  1555. }
  1556. if (type == CLEAR_REFS_MM_HIWATER_RSS) {
  1557. /*
  1558. * Writing 5 to /proc/pid/clear_refs resets the peak
  1559. * resident set size to this mm's current rss value.
  1560. */
  1561. reset_mm_hiwater_rss(mm);
  1562. goto out_unlock;
  1563. }
  1564. if (type == CLEAR_REFS_SOFT_DIRTY) {
  1565. for_each_vma(vmi, vma) {
  1566. if (!(vma->vm_flags & VM_SOFTDIRTY))
  1567. continue;
  1568. vm_flags_clear(vma, VM_SOFTDIRTY);
  1569. vma_set_page_prot(vma);
  1570. }
  1571. inc_tlb_flush_pending(mm);
  1572. mmu_notifier_range_init(&range, MMU_NOTIFY_SOFT_DIRTY,
  1573. 0, mm, 0, -1UL);
  1574. mmu_notifier_invalidate_range_start(&range);
  1575. }
  1576. walk_page_range(mm, 0, -1, &clear_refs_walk_ops, &cp);
  1577. if (type == CLEAR_REFS_SOFT_DIRTY) {
  1578. mmu_notifier_invalidate_range_end(&range);
  1579. flush_tlb_mm(mm);
  1580. dec_tlb_flush_pending(mm);
  1581. }
  1582. out_unlock:
  1583. mmap_write_unlock(mm);
  1584. out_mm:
  1585. mmput(mm);
  1586. }
  1587. put_task_struct(task);
  1588. return count;
  1589. }
  1590. const struct file_operations proc_clear_refs_operations = {
  1591. .write = clear_refs_write,
  1592. .llseek = noop_llseek,
  1593. };
  1594. typedef struct {
  1595. u64 pme;
  1596. } pagemap_entry_t;
  1597. struct pagemapread {
  1598. int pos, len; /* units: PM_ENTRY_BYTES, not bytes */
  1599. pagemap_entry_t *buffer;
  1600. bool show_pfn;
  1601. };
  1602. #define PAGEMAP_WALK_SIZE (PMD_SIZE)
  1603. #define PAGEMAP_WALK_MASK (PMD_MASK)
  1604. #define PM_ENTRY_BYTES sizeof(pagemap_entry_t)
  1605. #define PM_PFRAME_BITS 55
  1606. #define PM_PFRAME_MASK GENMASK_ULL(PM_PFRAME_BITS - 1, 0)
  1607. #define PM_SOFT_DIRTY BIT_ULL(55)
  1608. #define PM_MMAP_EXCLUSIVE BIT_ULL(56)
  1609. #define PM_UFFD_WP BIT_ULL(57)
  1610. #define PM_GUARD_REGION BIT_ULL(58)
  1611. #define PM_FILE BIT_ULL(61)
  1612. #define PM_SWAP BIT_ULL(62)
  1613. #define PM_PRESENT BIT_ULL(63)
  1614. #define PM_END_OF_BUFFER 1
  1615. static inline pagemap_entry_t make_pme(u64 frame, u64 flags)
  1616. {
  1617. return (pagemap_entry_t) { .pme = (frame & PM_PFRAME_MASK) | flags };
  1618. }
  1619. static int add_to_pagemap(pagemap_entry_t *pme, struct pagemapread *pm)
  1620. {
  1621. pm->buffer[pm->pos++] = *pme;
  1622. if (pm->pos >= pm->len)
  1623. return PM_END_OF_BUFFER;
  1624. return 0;
  1625. }
  1626. static bool __folio_page_mapped_exclusively(struct folio *folio, struct page *page)
  1627. {
  1628. if (IS_ENABLED(CONFIG_PAGE_MAPCOUNT))
  1629. return folio_precise_page_mapcount(folio, page) == 1;
  1630. return !folio_maybe_mapped_shared(folio);
  1631. }
  1632. static int pagemap_pte_hole(unsigned long start, unsigned long end,
  1633. __always_unused int depth, struct mm_walk *walk)
  1634. {
  1635. struct pagemapread *pm = walk->private;
  1636. unsigned long addr = start;
  1637. int err = 0;
  1638. while (addr < end) {
  1639. struct vm_area_struct *vma = find_vma(walk->mm, addr);
  1640. pagemap_entry_t pme = make_pme(0, 0);
  1641. /* End of address space hole, which we mark as non-present. */
  1642. unsigned long hole_end;
  1643. if (vma)
  1644. hole_end = min(end, vma->vm_start);
  1645. else
  1646. hole_end = end;
  1647. for (; addr < hole_end; addr += PAGE_SIZE) {
  1648. err = add_to_pagemap(&pme, pm);
  1649. if (err)
  1650. goto out;
  1651. }
  1652. if (!vma)
  1653. break;
  1654. /* Addresses in the VMA. */
  1655. if (vma->vm_flags & VM_SOFTDIRTY)
  1656. pme = make_pme(0, PM_SOFT_DIRTY);
  1657. for (; addr < min(end, vma->vm_end); addr += PAGE_SIZE) {
  1658. err = add_to_pagemap(&pme, pm);
  1659. if (err)
  1660. goto out;
  1661. }
  1662. }
  1663. out:
  1664. return err;
  1665. }
  1666. static pagemap_entry_t pte_to_pagemap_entry(struct pagemapread *pm,
  1667. struct vm_area_struct *vma, unsigned long addr, pte_t pte)
  1668. {
  1669. u64 frame = 0, flags = 0;
  1670. struct page *page = NULL;
  1671. struct folio *folio;
  1672. if (pte_none(pte))
  1673. goto out;
  1674. if (pte_present(pte)) {
  1675. if (pm->show_pfn)
  1676. frame = pte_pfn(pte);
  1677. flags |= PM_PRESENT;
  1678. page = vm_normal_page(vma, addr, pte);
  1679. if (pte_soft_dirty(pte))
  1680. flags |= PM_SOFT_DIRTY;
  1681. if (pte_uffd_wp(pte))
  1682. flags |= PM_UFFD_WP;
  1683. } else {
  1684. softleaf_t entry;
  1685. if (pte_swp_soft_dirty(pte))
  1686. flags |= PM_SOFT_DIRTY;
  1687. if (pte_swp_uffd_wp(pte))
  1688. flags |= PM_UFFD_WP;
  1689. entry = softleaf_from_pte(pte);
  1690. if (pm->show_pfn) {
  1691. pgoff_t offset;
  1692. /*
  1693. * For PFN swap offsets, keeping the offset field
  1694. * to be PFN only to be compatible with old smaps.
  1695. */
  1696. if (softleaf_has_pfn(entry))
  1697. offset = softleaf_to_pfn(entry);
  1698. else
  1699. offset = swp_offset(entry);
  1700. frame = swp_type(entry) |
  1701. (offset << MAX_SWAPFILES_SHIFT);
  1702. }
  1703. flags |= PM_SWAP;
  1704. if (softleaf_has_pfn(entry))
  1705. page = softleaf_to_page(entry);
  1706. if (softleaf_is_uffd_wp_marker(entry))
  1707. flags |= PM_UFFD_WP;
  1708. if (softleaf_is_guard_marker(entry))
  1709. flags |= PM_GUARD_REGION;
  1710. }
  1711. if (page) {
  1712. folio = page_folio(page);
  1713. if (!folio_test_anon(folio))
  1714. flags |= PM_FILE;
  1715. if ((flags & PM_PRESENT) &&
  1716. __folio_page_mapped_exclusively(folio, page))
  1717. flags |= PM_MMAP_EXCLUSIVE;
  1718. }
  1719. out:
  1720. if (vma->vm_flags & VM_SOFTDIRTY)
  1721. flags |= PM_SOFT_DIRTY;
  1722. return make_pme(frame, flags);
  1723. }
  1724. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  1725. static int pagemap_pmd_range_thp(pmd_t *pmdp, unsigned long addr,
  1726. unsigned long end, struct vm_area_struct *vma,
  1727. struct pagemapread *pm)
  1728. {
  1729. unsigned int idx = (addr & ~PMD_MASK) >> PAGE_SHIFT;
  1730. u64 flags = 0, frame = 0;
  1731. pmd_t pmd = *pmdp;
  1732. struct page *page = NULL;
  1733. struct folio *folio = NULL;
  1734. int err = 0;
  1735. if (vma->vm_flags & VM_SOFTDIRTY)
  1736. flags |= PM_SOFT_DIRTY;
  1737. if (pmd_none(pmd))
  1738. goto populate_pagemap;
  1739. if (pmd_present(pmd)) {
  1740. page = pmd_page(pmd);
  1741. flags |= PM_PRESENT;
  1742. if (pmd_soft_dirty(pmd))
  1743. flags |= PM_SOFT_DIRTY;
  1744. if (pmd_uffd_wp(pmd))
  1745. flags |= PM_UFFD_WP;
  1746. if (pm->show_pfn)
  1747. frame = pmd_pfn(pmd) + idx;
  1748. } else if (thp_migration_supported()) {
  1749. const softleaf_t entry = softleaf_from_pmd(pmd);
  1750. unsigned long offset;
  1751. if (pm->show_pfn) {
  1752. if (softleaf_has_pfn(entry))
  1753. offset = softleaf_to_pfn(entry) + idx;
  1754. else
  1755. offset = swp_offset(entry) + idx;
  1756. frame = swp_type(entry) |
  1757. (offset << MAX_SWAPFILES_SHIFT);
  1758. }
  1759. flags |= PM_SWAP;
  1760. if (pmd_swp_soft_dirty(pmd))
  1761. flags |= PM_SOFT_DIRTY;
  1762. if (pmd_swp_uffd_wp(pmd))
  1763. flags |= PM_UFFD_WP;
  1764. VM_WARN_ON_ONCE(!pmd_is_migration_entry(pmd));
  1765. page = softleaf_to_page(entry);
  1766. }
  1767. if (page) {
  1768. folio = page_folio(page);
  1769. if (!folio_test_anon(folio))
  1770. flags |= PM_FILE;
  1771. }
  1772. populate_pagemap:
  1773. for (; addr != end; addr += PAGE_SIZE, idx++) {
  1774. u64 cur_flags = flags;
  1775. pagemap_entry_t pme;
  1776. if (folio && (flags & PM_PRESENT) &&
  1777. __folio_page_mapped_exclusively(folio, page))
  1778. cur_flags |= PM_MMAP_EXCLUSIVE;
  1779. pme = make_pme(frame, cur_flags);
  1780. err = add_to_pagemap(&pme, pm);
  1781. if (err)
  1782. break;
  1783. if (pm->show_pfn) {
  1784. if (flags & PM_PRESENT)
  1785. frame++;
  1786. else if (flags & PM_SWAP)
  1787. frame += (1 << MAX_SWAPFILES_SHIFT);
  1788. }
  1789. }
  1790. return err;
  1791. }
  1792. #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
  1793. static int pagemap_pmd_range(pmd_t *pmdp, unsigned long addr, unsigned long end,
  1794. struct mm_walk *walk)
  1795. {
  1796. struct vm_area_struct *vma = walk->vma;
  1797. struct pagemapread *pm = walk->private;
  1798. spinlock_t *ptl;
  1799. pte_t *pte, *orig_pte;
  1800. int err = 0;
  1801. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  1802. ptl = pmd_trans_huge_lock(pmdp, vma);
  1803. if (ptl) {
  1804. err = pagemap_pmd_range_thp(pmdp, addr, end, vma, pm);
  1805. spin_unlock(ptl);
  1806. return err;
  1807. }
  1808. #endif
  1809. /*
  1810. * We can assume that @vma always points to a valid one and @end never
  1811. * goes beyond vma->vm_end.
  1812. */
  1813. orig_pte = pte = pte_offset_map_lock(walk->mm, pmdp, addr, &ptl);
  1814. if (!pte) {
  1815. walk->action = ACTION_AGAIN;
  1816. return err;
  1817. }
  1818. for (; addr < end; pte++, addr += PAGE_SIZE) {
  1819. pagemap_entry_t pme;
  1820. pme = pte_to_pagemap_entry(pm, vma, addr, ptep_get(pte));
  1821. err = add_to_pagemap(&pme, pm);
  1822. if (err)
  1823. break;
  1824. }
  1825. pte_unmap_unlock(orig_pte, ptl);
  1826. cond_resched();
  1827. return err;
  1828. }
  1829. #ifdef CONFIG_HUGETLB_PAGE
  1830. /* This function walks within one hugetlb entry in the single call */
  1831. static int pagemap_hugetlb_range(pte_t *ptep, unsigned long hmask,
  1832. unsigned long addr, unsigned long end,
  1833. struct mm_walk *walk)
  1834. {
  1835. struct pagemapread *pm = walk->private;
  1836. struct vm_area_struct *vma = walk->vma;
  1837. u64 flags = 0, frame = 0;
  1838. spinlock_t *ptl;
  1839. int err = 0;
  1840. pte_t pte;
  1841. if (vma->vm_flags & VM_SOFTDIRTY)
  1842. flags |= PM_SOFT_DIRTY;
  1843. ptl = huge_pte_lock(hstate_vma(vma), walk->mm, ptep);
  1844. pte = huge_ptep_get(walk->mm, addr, ptep);
  1845. if (pte_present(pte)) {
  1846. struct folio *folio = page_folio(pte_page(pte));
  1847. if (!folio_test_anon(folio))
  1848. flags |= PM_FILE;
  1849. if (!folio_maybe_mapped_shared(folio) &&
  1850. !hugetlb_pmd_shared(ptep))
  1851. flags |= PM_MMAP_EXCLUSIVE;
  1852. if (huge_pte_uffd_wp(pte))
  1853. flags |= PM_UFFD_WP;
  1854. flags |= PM_PRESENT;
  1855. if (pm->show_pfn)
  1856. frame = pte_pfn(pte) +
  1857. ((addr & ~hmask) >> PAGE_SHIFT);
  1858. } else if (pte_swp_uffd_wp_any(pte)) {
  1859. flags |= PM_UFFD_WP;
  1860. }
  1861. for (; addr != end; addr += PAGE_SIZE) {
  1862. pagemap_entry_t pme = make_pme(frame, flags);
  1863. err = add_to_pagemap(&pme, pm);
  1864. if (err)
  1865. break;
  1866. if (pm->show_pfn && (flags & PM_PRESENT))
  1867. frame++;
  1868. }
  1869. spin_unlock(ptl);
  1870. cond_resched();
  1871. return err;
  1872. }
  1873. #else
  1874. #define pagemap_hugetlb_range NULL
  1875. #endif /* HUGETLB_PAGE */
  1876. static const struct mm_walk_ops pagemap_ops = {
  1877. .pmd_entry = pagemap_pmd_range,
  1878. .pte_hole = pagemap_pte_hole,
  1879. .hugetlb_entry = pagemap_hugetlb_range,
  1880. .walk_lock = PGWALK_RDLOCK,
  1881. };
  1882. /*
  1883. * /proc/pid/pagemap - an array mapping virtual pages to pfns
  1884. *
  1885. * For each page in the address space, this file contains one 64-bit entry
  1886. * consisting of the following:
  1887. *
  1888. * Bits 0-54 page frame number (PFN) if present
  1889. * Bits 0-4 swap type if swapped
  1890. * Bits 5-54 swap offset if swapped
  1891. * Bit 55 pte is soft-dirty (see Documentation/admin-guide/mm/soft-dirty.rst)
  1892. * Bit 56 page exclusively mapped
  1893. * Bit 57 pte is uffd-wp write-protected
  1894. * Bit 58 pte is a guard region
  1895. * Bits 59-60 zero
  1896. * Bit 61 page is file-page or shared-anon
  1897. * Bit 62 page swapped
  1898. * Bit 63 page present
  1899. *
  1900. * If the page is not present but in swap, then the PFN contains an
  1901. * encoding of the swap file number and the page's offset into the
  1902. * swap. Unmapped pages return a null PFN. This allows determining
  1903. * precisely which pages are mapped (or in swap) and comparing mapped
  1904. * pages between processes.
  1905. *
  1906. * Efficient users of this interface will use /proc/pid/maps to
  1907. * determine which areas of memory are actually mapped and llseek to
  1908. * skip over unmapped regions.
  1909. */
  1910. static ssize_t pagemap_read(struct file *file, char __user *buf,
  1911. size_t count, loff_t *ppos)
  1912. {
  1913. struct mm_struct *mm = file->private_data;
  1914. struct pagemapread pm;
  1915. unsigned long src;
  1916. unsigned long svpfn;
  1917. unsigned long start_vaddr;
  1918. unsigned long end_vaddr;
  1919. int ret = 0, copied = 0;
  1920. if (!mm || !mmget_not_zero(mm))
  1921. goto out;
  1922. ret = -EINVAL;
  1923. /* file position must be aligned */
  1924. if ((*ppos % PM_ENTRY_BYTES) || (count % PM_ENTRY_BYTES))
  1925. goto out_mm;
  1926. ret = 0;
  1927. if (!count)
  1928. goto out_mm;
  1929. /* do not disclose physical addresses: attack vector */
  1930. pm.show_pfn = file_ns_capable(file, &init_user_ns, CAP_SYS_ADMIN);
  1931. pm.len = (PAGEMAP_WALK_SIZE >> PAGE_SHIFT);
  1932. pm.buffer = kmalloc_array(pm.len, PM_ENTRY_BYTES, GFP_KERNEL);
  1933. ret = -ENOMEM;
  1934. if (!pm.buffer)
  1935. goto out_mm;
  1936. src = *ppos;
  1937. svpfn = src / PM_ENTRY_BYTES;
  1938. end_vaddr = mm->task_size;
  1939. /* watch out for wraparound */
  1940. start_vaddr = end_vaddr;
  1941. if (svpfn <= (ULONG_MAX >> PAGE_SHIFT)) {
  1942. unsigned long end;
  1943. ret = mmap_read_lock_killable(mm);
  1944. if (ret)
  1945. goto out_free;
  1946. start_vaddr = untagged_addr_remote(mm, svpfn << PAGE_SHIFT);
  1947. mmap_read_unlock(mm);
  1948. end = start_vaddr + ((count / PM_ENTRY_BYTES) << PAGE_SHIFT);
  1949. if (end >= start_vaddr && end < mm->task_size)
  1950. end_vaddr = end;
  1951. }
  1952. /* Ensure the address is inside the task */
  1953. if (start_vaddr > mm->task_size)
  1954. start_vaddr = end_vaddr;
  1955. ret = 0;
  1956. while (count && (start_vaddr < end_vaddr)) {
  1957. int len;
  1958. unsigned long end;
  1959. pm.pos = 0;
  1960. end = (start_vaddr + PAGEMAP_WALK_SIZE) & PAGEMAP_WALK_MASK;
  1961. /* overflow ? */
  1962. if (end < start_vaddr || end > end_vaddr)
  1963. end = end_vaddr;
  1964. ret = mmap_read_lock_killable(mm);
  1965. if (ret)
  1966. goto out_free;
  1967. ret = walk_page_range(mm, start_vaddr, end, &pagemap_ops, &pm);
  1968. mmap_read_unlock(mm);
  1969. start_vaddr = end;
  1970. len = min(count, PM_ENTRY_BYTES * pm.pos);
  1971. if (copy_to_user(buf, pm.buffer, len)) {
  1972. ret = -EFAULT;
  1973. goto out_free;
  1974. }
  1975. copied += len;
  1976. buf += len;
  1977. count -= len;
  1978. }
  1979. *ppos += copied;
  1980. if (!ret || ret == PM_END_OF_BUFFER)
  1981. ret = copied;
  1982. out_free:
  1983. kfree(pm.buffer);
  1984. out_mm:
  1985. mmput(mm);
  1986. out:
  1987. return ret;
  1988. }
  1989. static int pagemap_open(struct inode *inode, struct file *file)
  1990. {
  1991. struct mm_struct *mm;
  1992. mm = proc_mem_open(inode, PTRACE_MODE_READ);
  1993. if (IS_ERR_OR_NULL(mm))
  1994. return mm ? PTR_ERR(mm) : -ESRCH;
  1995. file->private_data = mm;
  1996. return 0;
  1997. }
  1998. static int pagemap_release(struct inode *inode, struct file *file)
  1999. {
  2000. struct mm_struct *mm = file->private_data;
  2001. if (mm)
  2002. mmdrop(mm);
  2003. return 0;
  2004. }
  2005. #define PM_SCAN_CATEGORIES (PAGE_IS_WPALLOWED | PAGE_IS_WRITTEN | \
  2006. PAGE_IS_FILE | PAGE_IS_PRESENT | \
  2007. PAGE_IS_SWAPPED | PAGE_IS_PFNZERO | \
  2008. PAGE_IS_HUGE | PAGE_IS_SOFT_DIRTY | \
  2009. PAGE_IS_GUARD)
  2010. #define PM_SCAN_FLAGS (PM_SCAN_WP_MATCHING | PM_SCAN_CHECK_WPASYNC)
  2011. struct pagemap_scan_private {
  2012. struct pm_scan_arg arg;
  2013. unsigned long masks_of_interest, cur_vma_category;
  2014. struct page_region *vec_buf;
  2015. unsigned long vec_buf_len, vec_buf_index, found_pages;
  2016. struct page_region __user *vec_out;
  2017. };
  2018. static unsigned long pagemap_page_category(struct pagemap_scan_private *p,
  2019. struct vm_area_struct *vma,
  2020. unsigned long addr, pte_t pte)
  2021. {
  2022. unsigned long categories;
  2023. if (pte_none(pte))
  2024. return 0;
  2025. if (pte_present(pte)) {
  2026. struct page *page;
  2027. categories = PAGE_IS_PRESENT;
  2028. if (!pte_uffd_wp(pte))
  2029. categories |= PAGE_IS_WRITTEN;
  2030. if (p->masks_of_interest & PAGE_IS_FILE) {
  2031. page = vm_normal_page(vma, addr, pte);
  2032. if (page && !PageAnon(page))
  2033. categories |= PAGE_IS_FILE;
  2034. }
  2035. if (is_zero_pfn(pte_pfn(pte)))
  2036. categories |= PAGE_IS_PFNZERO;
  2037. if (pte_soft_dirty(pte))
  2038. categories |= PAGE_IS_SOFT_DIRTY;
  2039. } else {
  2040. softleaf_t entry;
  2041. categories = PAGE_IS_SWAPPED;
  2042. if (!pte_swp_uffd_wp_any(pte))
  2043. categories |= PAGE_IS_WRITTEN;
  2044. entry = softleaf_from_pte(pte);
  2045. if (softleaf_is_guard_marker(entry))
  2046. categories |= PAGE_IS_GUARD;
  2047. else if ((p->masks_of_interest & PAGE_IS_FILE) &&
  2048. softleaf_has_pfn(entry) &&
  2049. !folio_test_anon(softleaf_to_folio(entry)))
  2050. categories |= PAGE_IS_FILE;
  2051. if (pte_swp_soft_dirty(pte))
  2052. categories |= PAGE_IS_SOFT_DIRTY;
  2053. }
  2054. return categories;
  2055. }
  2056. static void make_uffd_wp_pte(struct vm_area_struct *vma,
  2057. unsigned long addr, pte_t *pte, pte_t ptent)
  2058. {
  2059. if (pte_present(ptent)) {
  2060. pte_t old_pte;
  2061. old_pte = ptep_modify_prot_start(vma, addr, pte);
  2062. ptent = pte_mkuffd_wp(old_pte);
  2063. ptep_modify_prot_commit(vma, addr, pte, old_pte, ptent);
  2064. } else if (pte_none(ptent)) {
  2065. set_pte_at(vma->vm_mm, addr, pte,
  2066. make_pte_marker(PTE_MARKER_UFFD_WP));
  2067. } else {
  2068. ptent = pte_swp_mkuffd_wp(ptent);
  2069. set_pte_at(vma->vm_mm, addr, pte, ptent);
  2070. }
  2071. }
  2072. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  2073. static unsigned long pagemap_thp_category(struct pagemap_scan_private *p,
  2074. struct vm_area_struct *vma,
  2075. unsigned long addr, pmd_t pmd)
  2076. {
  2077. unsigned long categories = PAGE_IS_HUGE;
  2078. if (pmd_none(pmd))
  2079. return categories;
  2080. if (pmd_present(pmd)) {
  2081. struct page *page;
  2082. categories |= PAGE_IS_PRESENT;
  2083. if (!pmd_uffd_wp(pmd))
  2084. categories |= PAGE_IS_WRITTEN;
  2085. if (p->masks_of_interest & PAGE_IS_FILE) {
  2086. page = vm_normal_page_pmd(vma, addr, pmd);
  2087. if (page && !PageAnon(page))
  2088. categories |= PAGE_IS_FILE;
  2089. }
  2090. if (is_huge_zero_pmd(pmd))
  2091. categories |= PAGE_IS_PFNZERO;
  2092. if (pmd_soft_dirty(pmd))
  2093. categories |= PAGE_IS_SOFT_DIRTY;
  2094. } else {
  2095. categories |= PAGE_IS_SWAPPED;
  2096. if (!pmd_swp_uffd_wp(pmd))
  2097. categories |= PAGE_IS_WRITTEN;
  2098. if (pmd_swp_soft_dirty(pmd))
  2099. categories |= PAGE_IS_SOFT_DIRTY;
  2100. if (p->masks_of_interest & PAGE_IS_FILE) {
  2101. const softleaf_t entry = softleaf_from_pmd(pmd);
  2102. if (softleaf_has_pfn(entry) &&
  2103. !folio_test_anon(softleaf_to_folio(entry)))
  2104. categories |= PAGE_IS_FILE;
  2105. }
  2106. }
  2107. return categories;
  2108. }
  2109. static void make_uffd_wp_pmd(struct vm_area_struct *vma,
  2110. unsigned long addr, pmd_t *pmdp)
  2111. {
  2112. pmd_t old, pmd = *pmdp;
  2113. if (pmd_present(pmd)) {
  2114. old = pmdp_invalidate_ad(vma, addr, pmdp);
  2115. pmd = pmd_mkuffd_wp(old);
  2116. set_pmd_at(vma->vm_mm, addr, pmdp, pmd);
  2117. } else if (pmd_is_migration_entry(pmd)) {
  2118. pmd = pmd_swp_mkuffd_wp(pmd);
  2119. set_pmd_at(vma->vm_mm, addr, pmdp, pmd);
  2120. }
  2121. }
  2122. #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
  2123. #ifdef CONFIG_HUGETLB_PAGE
  2124. static unsigned long pagemap_hugetlb_category(pte_t pte)
  2125. {
  2126. unsigned long categories = PAGE_IS_HUGE;
  2127. if (pte_none(pte))
  2128. return categories;
  2129. /*
  2130. * According to pagemap_hugetlb_range(), file-backed HugeTLB
  2131. * page cannot be swapped. So PAGE_IS_FILE is not checked for
  2132. * swapped pages.
  2133. */
  2134. if (pte_present(pte)) {
  2135. categories |= PAGE_IS_PRESENT;
  2136. if (!huge_pte_uffd_wp(pte))
  2137. categories |= PAGE_IS_WRITTEN;
  2138. if (!PageAnon(pte_page(pte)))
  2139. categories |= PAGE_IS_FILE;
  2140. if (is_zero_pfn(pte_pfn(pte)))
  2141. categories |= PAGE_IS_PFNZERO;
  2142. if (pte_soft_dirty(pte))
  2143. categories |= PAGE_IS_SOFT_DIRTY;
  2144. } else {
  2145. categories |= PAGE_IS_SWAPPED;
  2146. if (!pte_swp_uffd_wp_any(pte))
  2147. categories |= PAGE_IS_WRITTEN;
  2148. if (pte_swp_soft_dirty(pte))
  2149. categories |= PAGE_IS_SOFT_DIRTY;
  2150. }
  2151. return categories;
  2152. }
  2153. static void make_uffd_wp_huge_pte(struct vm_area_struct *vma,
  2154. unsigned long addr, pte_t *ptep,
  2155. pte_t ptent)
  2156. {
  2157. const unsigned long psize = huge_page_size(hstate_vma(vma));
  2158. softleaf_t entry;
  2159. if (huge_pte_none(ptent)) {
  2160. set_huge_pte_at(vma->vm_mm, addr, ptep,
  2161. make_pte_marker(PTE_MARKER_UFFD_WP), psize);
  2162. return;
  2163. }
  2164. entry = softleaf_from_pte(ptent);
  2165. if (softleaf_is_hwpoison(entry) || softleaf_is_marker(entry))
  2166. return;
  2167. if (softleaf_is_migration(entry))
  2168. set_huge_pte_at(vma->vm_mm, addr, ptep,
  2169. pte_swp_mkuffd_wp(ptent), psize);
  2170. else
  2171. huge_ptep_modify_prot_commit(vma, addr, ptep, ptent,
  2172. huge_pte_mkuffd_wp(ptent));
  2173. }
  2174. #endif /* CONFIG_HUGETLB_PAGE */
  2175. #if defined(CONFIG_TRANSPARENT_HUGEPAGE) || defined(CONFIG_HUGETLB_PAGE)
  2176. static void pagemap_scan_backout_range(struct pagemap_scan_private *p,
  2177. unsigned long addr, unsigned long end)
  2178. {
  2179. struct page_region *cur_buf = &p->vec_buf[p->vec_buf_index];
  2180. if (!p->vec_buf)
  2181. return;
  2182. if (cur_buf->start != addr)
  2183. cur_buf->end = addr;
  2184. else
  2185. cur_buf->start = cur_buf->end = 0;
  2186. p->found_pages -= (end - addr) / PAGE_SIZE;
  2187. }
  2188. #endif
  2189. static bool pagemap_scan_is_interesting_page(unsigned long categories,
  2190. const struct pagemap_scan_private *p)
  2191. {
  2192. categories ^= p->arg.category_inverted;
  2193. if ((categories & p->arg.category_mask) != p->arg.category_mask)
  2194. return false;
  2195. if (p->arg.category_anyof_mask && !(categories & p->arg.category_anyof_mask))
  2196. return false;
  2197. return true;
  2198. }
  2199. static bool pagemap_scan_is_interesting_vma(unsigned long categories,
  2200. const struct pagemap_scan_private *p)
  2201. {
  2202. unsigned long required = p->arg.category_mask & PAGE_IS_WPALLOWED;
  2203. categories ^= p->arg.category_inverted;
  2204. if ((categories & required) != required)
  2205. return false;
  2206. return true;
  2207. }
  2208. static int pagemap_scan_test_walk(unsigned long start, unsigned long end,
  2209. struct mm_walk *walk)
  2210. {
  2211. struct pagemap_scan_private *p = walk->private;
  2212. struct vm_area_struct *vma = walk->vma;
  2213. unsigned long vma_category = 0;
  2214. bool wp_allowed = userfaultfd_wp_async(vma) &&
  2215. userfaultfd_wp_use_markers(vma);
  2216. if (!wp_allowed) {
  2217. /* User requested explicit failure over wp-async capability */
  2218. if (p->arg.flags & PM_SCAN_CHECK_WPASYNC)
  2219. return -EPERM;
  2220. /*
  2221. * User requires wr-protect, and allows silently skipping
  2222. * unsupported vmas.
  2223. */
  2224. if (p->arg.flags & PM_SCAN_WP_MATCHING)
  2225. return 1;
  2226. /*
  2227. * Then the request doesn't involve wr-protects at all,
  2228. * fall through to the rest checks, and allow vma walk.
  2229. */
  2230. }
  2231. if (vma->vm_flags & VM_PFNMAP)
  2232. return 1;
  2233. if (wp_allowed)
  2234. vma_category |= PAGE_IS_WPALLOWED;
  2235. if (vma->vm_flags & VM_SOFTDIRTY)
  2236. vma_category |= PAGE_IS_SOFT_DIRTY;
  2237. if (!pagemap_scan_is_interesting_vma(vma_category, p))
  2238. return 1;
  2239. p->cur_vma_category = vma_category;
  2240. return 0;
  2241. }
  2242. static bool pagemap_scan_push_range(unsigned long categories,
  2243. struct pagemap_scan_private *p,
  2244. unsigned long addr, unsigned long end)
  2245. {
  2246. struct page_region *cur_buf = &p->vec_buf[p->vec_buf_index];
  2247. /*
  2248. * When there is no output buffer provided at all, the sentinel values
  2249. * won't match here. There is no other way for `cur_buf->end` to be
  2250. * non-zero other than it being non-empty.
  2251. */
  2252. if (addr == cur_buf->end && categories == cur_buf->categories) {
  2253. cur_buf->end = end;
  2254. return true;
  2255. }
  2256. if (cur_buf->end) {
  2257. if (p->vec_buf_index >= p->vec_buf_len - 1)
  2258. return false;
  2259. cur_buf = &p->vec_buf[++p->vec_buf_index];
  2260. }
  2261. cur_buf->start = addr;
  2262. cur_buf->end = end;
  2263. cur_buf->categories = categories;
  2264. return true;
  2265. }
  2266. static int pagemap_scan_output(unsigned long categories,
  2267. struct pagemap_scan_private *p,
  2268. unsigned long addr, unsigned long *end)
  2269. {
  2270. unsigned long n_pages, total_pages;
  2271. int ret = 0;
  2272. if (!p->vec_buf)
  2273. return 0;
  2274. categories &= p->arg.return_mask;
  2275. n_pages = (*end - addr) / PAGE_SIZE;
  2276. if (check_add_overflow(p->found_pages, n_pages, &total_pages) ||
  2277. total_pages > p->arg.max_pages) {
  2278. size_t n_too_much = total_pages - p->arg.max_pages;
  2279. *end -= n_too_much * PAGE_SIZE;
  2280. n_pages -= n_too_much;
  2281. ret = -ENOSPC;
  2282. }
  2283. if (!pagemap_scan_push_range(categories, p, addr, *end)) {
  2284. *end = addr;
  2285. n_pages = 0;
  2286. ret = -ENOSPC;
  2287. }
  2288. p->found_pages += n_pages;
  2289. if (ret)
  2290. p->arg.walk_end = *end;
  2291. return ret;
  2292. }
  2293. static int pagemap_scan_thp_entry(pmd_t *pmd, unsigned long start,
  2294. unsigned long end, struct mm_walk *walk)
  2295. {
  2296. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  2297. struct pagemap_scan_private *p = walk->private;
  2298. struct vm_area_struct *vma = walk->vma;
  2299. unsigned long categories;
  2300. spinlock_t *ptl;
  2301. int ret = 0;
  2302. ptl = pmd_trans_huge_lock(pmd, vma);
  2303. if (!ptl)
  2304. return -ENOENT;
  2305. categories = p->cur_vma_category |
  2306. pagemap_thp_category(p, vma, start, *pmd);
  2307. if (!pagemap_scan_is_interesting_page(categories, p))
  2308. goto out_unlock;
  2309. ret = pagemap_scan_output(categories, p, start, &end);
  2310. if (start == end)
  2311. goto out_unlock;
  2312. if (~p->arg.flags & PM_SCAN_WP_MATCHING)
  2313. goto out_unlock;
  2314. if (~categories & PAGE_IS_WRITTEN)
  2315. goto out_unlock;
  2316. /*
  2317. * Break huge page into small pages if the WP operation
  2318. * needs to be performed on a portion of the huge page.
  2319. */
  2320. if (end != start + HPAGE_SIZE) {
  2321. spin_unlock(ptl);
  2322. split_huge_pmd(vma, pmd, start);
  2323. pagemap_scan_backout_range(p, start, end);
  2324. /* Report as if there was no THP */
  2325. return -ENOENT;
  2326. }
  2327. make_uffd_wp_pmd(vma, start, pmd);
  2328. flush_tlb_range(vma, start, end);
  2329. out_unlock:
  2330. spin_unlock(ptl);
  2331. return ret;
  2332. #else /* !CONFIG_TRANSPARENT_HUGEPAGE */
  2333. return -ENOENT;
  2334. #endif
  2335. }
  2336. static int pagemap_scan_pmd_entry(pmd_t *pmd, unsigned long start,
  2337. unsigned long end, struct mm_walk *walk)
  2338. {
  2339. struct pagemap_scan_private *p = walk->private;
  2340. struct vm_area_struct *vma = walk->vma;
  2341. unsigned long addr, flush_end = 0;
  2342. pte_t *pte, *start_pte;
  2343. spinlock_t *ptl;
  2344. int ret;
  2345. ret = pagemap_scan_thp_entry(pmd, start, end, walk);
  2346. if (ret != -ENOENT)
  2347. return ret;
  2348. ret = 0;
  2349. start_pte = pte = pte_offset_map_lock(vma->vm_mm, pmd, start, &ptl);
  2350. if (!pte) {
  2351. walk->action = ACTION_AGAIN;
  2352. return 0;
  2353. }
  2354. lazy_mmu_mode_enable();
  2355. if ((p->arg.flags & PM_SCAN_WP_MATCHING) && !p->vec_out) {
  2356. /* Fast path for performing exclusive WP */
  2357. for (addr = start; addr != end; pte++, addr += PAGE_SIZE) {
  2358. pte_t ptent = ptep_get(pte);
  2359. if ((pte_present(ptent) && pte_uffd_wp(ptent)) ||
  2360. pte_swp_uffd_wp_any(ptent))
  2361. continue;
  2362. make_uffd_wp_pte(vma, addr, pte, ptent);
  2363. if (!flush_end)
  2364. start = addr;
  2365. flush_end = addr + PAGE_SIZE;
  2366. }
  2367. goto flush_and_return;
  2368. }
  2369. if (!p->arg.category_anyof_mask && !p->arg.category_inverted &&
  2370. p->arg.category_mask == PAGE_IS_WRITTEN &&
  2371. p->arg.return_mask == PAGE_IS_WRITTEN) {
  2372. for (addr = start; addr < end; pte++, addr += PAGE_SIZE) {
  2373. unsigned long next = addr + PAGE_SIZE;
  2374. pte_t ptent = ptep_get(pte);
  2375. if ((pte_present(ptent) && pte_uffd_wp(ptent)) ||
  2376. pte_swp_uffd_wp_any(ptent))
  2377. continue;
  2378. ret = pagemap_scan_output(p->cur_vma_category | PAGE_IS_WRITTEN,
  2379. p, addr, &next);
  2380. if (next == addr)
  2381. break;
  2382. if (~p->arg.flags & PM_SCAN_WP_MATCHING)
  2383. continue;
  2384. make_uffd_wp_pte(vma, addr, pte, ptent);
  2385. if (!flush_end)
  2386. start = addr;
  2387. flush_end = next;
  2388. }
  2389. goto flush_and_return;
  2390. }
  2391. for (addr = start; addr != end; pte++, addr += PAGE_SIZE) {
  2392. pte_t ptent = ptep_get(pte);
  2393. unsigned long categories = p->cur_vma_category |
  2394. pagemap_page_category(p, vma, addr, ptent);
  2395. unsigned long next = addr + PAGE_SIZE;
  2396. if (!pagemap_scan_is_interesting_page(categories, p))
  2397. continue;
  2398. ret = pagemap_scan_output(categories, p, addr, &next);
  2399. if (next == addr)
  2400. break;
  2401. if (~p->arg.flags & PM_SCAN_WP_MATCHING)
  2402. continue;
  2403. if (~categories & PAGE_IS_WRITTEN)
  2404. continue;
  2405. make_uffd_wp_pte(vma, addr, pte, ptent);
  2406. if (!flush_end)
  2407. start = addr;
  2408. flush_end = next;
  2409. }
  2410. flush_and_return:
  2411. if (flush_end)
  2412. flush_tlb_range(vma, start, addr);
  2413. lazy_mmu_mode_disable();
  2414. pte_unmap_unlock(start_pte, ptl);
  2415. cond_resched();
  2416. return ret;
  2417. }
  2418. #ifdef CONFIG_HUGETLB_PAGE
  2419. static int pagemap_scan_hugetlb_entry(pte_t *ptep, unsigned long hmask,
  2420. unsigned long start, unsigned long end,
  2421. struct mm_walk *walk)
  2422. {
  2423. struct pagemap_scan_private *p = walk->private;
  2424. struct vm_area_struct *vma = walk->vma;
  2425. unsigned long categories;
  2426. spinlock_t *ptl;
  2427. int ret = 0;
  2428. pte_t pte;
  2429. if (~p->arg.flags & PM_SCAN_WP_MATCHING) {
  2430. /* Go the short route when not write-protecting pages. */
  2431. pte = huge_ptep_get(walk->mm, start, ptep);
  2432. categories = p->cur_vma_category | pagemap_hugetlb_category(pte);
  2433. if (!pagemap_scan_is_interesting_page(categories, p))
  2434. return 0;
  2435. return pagemap_scan_output(categories, p, start, &end);
  2436. }
  2437. i_mmap_lock_write(vma->vm_file->f_mapping);
  2438. ptl = huge_pte_lock(hstate_vma(vma), vma->vm_mm, ptep);
  2439. pte = huge_ptep_get(walk->mm, start, ptep);
  2440. categories = p->cur_vma_category | pagemap_hugetlb_category(pte);
  2441. if (!pagemap_scan_is_interesting_page(categories, p))
  2442. goto out_unlock;
  2443. ret = pagemap_scan_output(categories, p, start, &end);
  2444. if (start == end)
  2445. goto out_unlock;
  2446. if (~categories & PAGE_IS_WRITTEN)
  2447. goto out_unlock;
  2448. if (end != start + HPAGE_SIZE) {
  2449. /* Partial HugeTLB page WP isn't possible. */
  2450. pagemap_scan_backout_range(p, start, end);
  2451. p->arg.walk_end = start;
  2452. ret = 0;
  2453. goto out_unlock;
  2454. }
  2455. make_uffd_wp_huge_pte(vma, start, ptep, pte);
  2456. flush_hugetlb_tlb_range(vma, start, end);
  2457. out_unlock:
  2458. spin_unlock(ptl);
  2459. i_mmap_unlock_write(vma->vm_file->f_mapping);
  2460. return ret;
  2461. }
  2462. #else
  2463. #define pagemap_scan_hugetlb_entry NULL
  2464. #endif
  2465. static int pagemap_scan_pte_hole(unsigned long addr, unsigned long end,
  2466. int depth, struct mm_walk *walk)
  2467. {
  2468. struct pagemap_scan_private *p = walk->private;
  2469. struct vm_area_struct *vma = walk->vma;
  2470. int ret, err;
  2471. if (!vma || !pagemap_scan_is_interesting_page(p->cur_vma_category, p))
  2472. return 0;
  2473. ret = pagemap_scan_output(p->cur_vma_category, p, addr, &end);
  2474. if (addr == end)
  2475. return ret;
  2476. if (~p->arg.flags & PM_SCAN_WP_MATCHING)
  2477. return ret;
  2478. err = uffd_wp_range(vma, addr, end - addr, true);
  2479. if (err < 0)
  2480. ret = err;
  2481. return ret;
  2482. }
  2483. static const struct mm_walk_ops pagemap_scan_ops = {
  2484. .test_walk = pagemap_scan_test_walk,
  2485. .pmd_entry = pagemap_scan_pmd_entry,
  2486. .pte_hole = pagemap_scan_pte_hole,
  2487. .hugetlb_entry = pagemap_scan_hugetlb_entry,
  2488. };
  2489. static int pagemap_scan_get_args(struct pm_scan_arg *arg,
  2490. unsigned long uarg)
  2491. {
  2492. if (copy_from_user(arg, (void __user *)uarg, sizeof(*arg)))
  2493. return -EFAULT;
  2494. if (arg->size != sizeof(struct pm_scan_arg))
  2495. return -EINVAL;
  2496. /* Validate requested features */
  2497. if (arg->flags & ~PM_SCAN_FLAGS)
  2498. return -EINVAL;
  2499. if ((arg->category_inverted | arg->category_mask |
  2500. arg->category_anyof_mask | arg->return_mask) & ~PM_SCAN_CATEGORIES)
  2501. return -EINVAL;
  2502. arg->start = untagged_addr((unsigned long)arg->start);
  2503. arg->end = untagged_addr((unsigned long)arg->end);
  2504. arg->vec = untagged_addr((unsigned long)arg->vec);
  2505. /* Validate memory pointers */
  2506. if (!IS_ALIGNED(arg->start, PAGE_SIZE))
  2507. return -EINVAL;
  2508. if (!access_ok((void __user *)(long)arg->start, arg->end - arg->start))
  2509. return -EFAULT;
  2510. if (!arg->vec && arg->vec_len)
  2511. return -EINVAL;
  2512. if (UINT_MAX == SIZE_MAX && arg->vec_len > SIZE_MAX)
  2513. return -EINVAL;
  2514. if (arg->vec && !access_ok((void __user *)(long)arg->vec,
  2515. size_mul(arg->vec_len, sizeof(struct page_region))))
  2516. return -EFAULT;
  2517. /* Fixup default values */
  2518. arg->end = ALIGN(arg->end, PAGE_SIZE);
  2519. arg->walk_end = 0;
  2520. if (!arg->max_pages)
  2521. arg->max_pages = ULONG_MAX;
  2522. return 0;
  2523. }
  2524. static int pagemap_scan_writeback_args(struct pm_scan_arg *arg,
  2525. unsigned long uargl)
  2526. {
  2527. struct pm_scan_arg __user *uarg = (void __user *)uargl;
  2528. if (copy_to_user(&uarg->walk_end, &arg->walk_end, sizeof(arg->walk_end)))
  2529. return -EFAULT;
  2530. return 0;
  2531. }
  2532. static int pagemap_scan_init_bounce_buffer(struct pagemap_scan_private *p)
  2533. {
  2534. if (!p->arg.vec_len)
  2535. return 0;
  2536. p->vec_buf_len = min_t(size_t, PAGEMAP_WALK_SIZE >> PAGE_SHIFT,
  2537. p->arg.vec_len);
  2538. p->vec_buf = kmalloc_objs(*p->vec_buf, p->vec_buf_len);
  2539. if (!p->vec_buf)
  2540. return -ENOMEM;
  2541. p->vec_buf->start = p->vec_buf->end = 0;
  2542. p->vec_out = (struct page_region __user *)(long)p->arg.vec;
  2543. return 0;
  2544. }
  2545. static long pagemap_scan_flush_buffer(struct pagemap_scan_private *p)
  2546. {
  2547. const struct page_region *buf = p->vec_buf;
  2548. long n = p->vec_buf_index;
  2549. if (!p->vec_buf)
  2550. return 0;
  2551. if (buf[n].end != buf[n].start)
  2552. n++;
  2553. if (!n)
  2554. return 0;
  2555. if (copy_to_user(p->vec_out, buf, n * sizeof(*buf)))
  2556. return -EFAULT;
  2557. p->arg.vec_len -= n;
  2558. p->vec_out += n;
  2559. p->vec_buf_index = 0;
  2560. p->vec_buf_len = min_t(size_t, p->vec_buf_len, p->arg.vec_len);
  2561. p->vec_buf->start = p->vec_buf->end = 0;
  2562. return n;
  2563. }
  2564. static long do_pagemap_scan(struct mm_struct *mm, unsigned long uarg)
  2565. {
  2566. struct pagemap_scan_private p = {0};
  2567. unsigned long walk_start;
  2568. size_t n_ranges_out = 0;
  2569. int ret;
  2570. ret = pagemap_scan_get_args(&p.arg, uarg);
  2571. if (ret)
  2572. return ret;
  2573. p.masks_of_interest = p.arg.category_mask | p.arg.category_anyof_mask |
  2574. p.arg.return_mask;
  2575. ret = pagemap_scan_init_bounce_buffer(&p);
  2576. if (ret)
  2577. return ret;
  2578. for (walk_start = p.arg.start; walk_start < p.arg.end;
  2579. walk_start = p.arg.walk_end) {
  2580. struct mmu_notifier_range range;
  2581. long n_out;
  2582. if (fatal_signal_pending(current)) {
  2583. ret = -EINTR;
  2584. break;
  2585. }
  2586. ret = mmap_read_lock_killable(mm);
  2587. if (ret)
  2588. break;
  2589. /* Protection change for the range is going to happen. */
  2590. if (p.arg.flags & PM_SCAN_WP_MATCHING) {
  2591. mmu_notifier_range_init(&range, MMU_NOTIFY_PROTECTION_VMA, 0,
  2592. mm, walk_start, p.arg.end);
  2593. mmu_notifier_invalidate_range_start(&range);
  2594. }
  2595. ret = walk_page_range(mm, walk_start, p.arg.end,
  2596. &pagemap_scan_ops, &p);
  2597. if (p.arg.flags & PM_SCAN_WP_MATCHING)
  2598. mmu_notifier_invalidate_range_end(&range);
  2599. mmap_read_unlock(mm);
  2600. n_out = pagemap_scan_flush_buffer(&p);
  2601. if (n_out < 0)
  2602. ret = n_out;
  2603. else
  2604. n_ranges_out += n_out;
  2605. if (ret != -ENOSPC)
  2606. break;
  2607. if (p.arg.vec_len == 0 || p.found_pages == p.arg.max_pages)
  2608. break;
  2609. }
  2610. /* ENOSPC signifies early stop (buffer full) from the walk. */
  2611. if (!ret || ret == -ENOSPC)
  2612. ret = n_ranges_out;
  2613. /* The walk_end isn't set when ret is zero */
  2614. if (!p.arg.walk_end)
  2615. p.arg.walk_end = p.arg.end;
  2616. if (pagemap_scan_writeback_args(&p.arg, uarg))
  2617. ret = -EFAULT;
  2618. kfree(p.vec_buf);
  2619. return ret;
  2620. }
  2621. static long do_pagemap_cmd(struct file *file, unsigned int cmd,
  2622. unsigned long arg)
  2623. {
  2624. struct mm_struct *mm = file->private_data;
  2625. switch (cmd) {
  2626. case PAGEMAP_SCAN:
  2627. return do_pagemap_scan(mm, arg);
  2628. default:
  2629. return -EINVAL;
  2630. }
  2631. }
  2632. const struct file_operations proc_pagemap_operations = {
  2633. .llseek = mem_lseek, /* borrow this */
  2634. .read = pagemap_read,
  2635. .open = pagemap_open,
  2636. .release = pagemap_release,
  2637. .unlocked_ioctl = do_pagemap_cmd,
  2638. .compat_ioctl = do_pagemap_cmd,
  2639. };
  2640. #endif /* CONFIG_PROC_PAGE_MONITOR */
  2641. #ifdef CONFIG_NUMA
  2642. struct numa_maps {
  2643. unsigned long pages;
  2644. unsigned long anon;
  2645. unsigned long active;
  2646. unsigned long writeback;
  2647. unsigned long mapcount_max;
  2648. unsigned long dirty;
  2649. unsigned long swapcache;
  2650. unsigned long node[MAX_NUMNODES];
  2651. };
  2652. struct numa_maps_private {
  2653. struct proc_maps_private proc_maps;
  2654. struct numa_maps md;
  2655. };
  2656. static void gather_stats(struct page *page, struct numa_maps *md, int pte_dirty,
  2657. unsigned long nr_pages)
  2658. {
  2659. struct folio *folio = page_folio(page);
  2660. int count;
  2661. if (IS_ENABLED(CONFIG_PAGE_MAPCOUNT))
  2662. count = folio_precise_page_mapcount(folio, page);
  2663. else
  2664. count = folio_average_page_mapcount(folio);
  2665. md->pages += nr_pages;
  2666. if (pte_dirty || folio_test_dirty(folio))
  2667. md->dirty += nr_pages;
  2668. if (folio_test_swapcache(folio))
  2669. md->swapcache += nr_pages;
  2670. if (folio_test_active(folio) || folio_test_unevictable(folio))
  2671. md->active += nr_pages;
  2672. if (folio_test_writeback(folio))
  2673. md->writeback += nr_pages;
  2674. if (folio_test_anon(folio))
  2675. md->anon += nr_pages;
  2676. if (count > md->mapcount_max)
  2677. md->mapcount_max = count;
  2678. md->node[folio_nid(folio)] += nr_pages;
  2679. }
  2680. static struct page *can_gather_numa_stats(pte_t pte, struct vm_area_struct *vma,
  2681. unsigned long addr)
  2682. {
  2683. struct page *page;
  2684. int nid;
  2685. if (!pte_present(pte))
  2686. return NULL;
  2687. page = vm_normal_page(vma, addr, pte);
  2688. if (!page || is_zone_device_page(page))
  2689. return NULL;
  2690. if (PageReserved(page))
  2691. return NULL;
  2692. nid = page_to_nid(page);
  2693. if (!node_isset(nid, node_states[N_MEMORY]))
  2694. return NULL;
  2695. return page;
  2696. }
  2697. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  2698. static struct page *can_gather_numa_stats_pmd(pmd_t pmd,
  2699. struct vm_area_struct *vma,
  2700. unsigned long addr)
  2701. {
  2702. struct page *page;
  2703. int nid;
  2704. if (!pmd_present(pmd))
  2705. return NULL;
  2706. page = vm_normal_page_pmd(vma, addr, pmd);
  2707. if (!page)
  2708. return NULL;
  2709. if (PageReserved(page))
  2710. return NULL;
  2711. nid = page_to_nid(page);
  2712. if (!node_isset(nid, node_states[N_MEMORY]))
  2713. return NULL;
  2714. return page;
  2715. }
  2716. #endif
  2717. static int gather_pte_stats(pmd_t *pmd, unsigned long addr,
  2718. unsigned long end, struct mm_walk *walk)
  2719. {
  2720. struct numa_maps *md = walk->private;
  2721. struct vm_area_struct *vma = walk->vma;
  2722. spinlock_t *ptl;
  2723. pte_t *orig_pte;
  2724. pte_t *pte;
  2725. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  2726. ptl = pmd_trans_huge_lock(pmd, vma);
  2727. if (ptl) {
  2728. struct page *page;
  2729. page = can_gather_numa_stats_pmd(*pmd, vma, addr);
  2730. if (page)
  2731. gather_stats(page, md, pmd_dirty(*pmd),
  2732. HPAGE_PMD_SIZE/PAGE_SIZE);
  2733. spin_unlock(ptl);
  2734. return 0;
  2735. }
  2736. #endif
  2737. orig_pte = pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl);
  2738. if (!pte) {
  2739. walk->action = ACTION_AGAIN;
  2740. return 0;
  2741. }
  2742. do {
  2743. pte_t ptent = ptep_get(pte);
  2744. struct page *page = can_gather_numa_stats(ptent, vma, addr);
  2745. if (!page)
  2746. continue;
  2747. gather_stats(page, md, pte_dirty(ptent), 1);
  2748. } while (pte++, addr += PAGE_SIZE, addr != end);
  2749. pte_unmap_unlock(orig_pte, ptl);
  2750. cond_resched();
  2751. return 0;
  2752. }
  2753. #ifdef CONFIG_HUGETLB_PAGE
  2754. static int gather_hugetlb_stats(pte_t *pte, unsigned long hmask,
  2755. unsigned long addr, unsigned long end, struct mm_walk *walk)
  2756. {
  2757. pte_t huge_pte;
  2758. struct numa_maps *md;
  2759. struct page *page;
  2760. spinlock_t *ptl;
  2761. ptl = huge_pte_lock(hstate_vma(walk->vma), walk->mm, pte);
  2762. huge_pte = huge_ptep_get(walk->mm, addr, pte);
  2763. if (!pte_present(huge_pte))
  2764. goto out;
  2765. page = pte_page(huge_pte);
  2766. md = walk->private;
  2767. gather_stats(page, md, pte_dirty(huge_pte), 1);
  2768. out:
  2769. spin_unlock(ptl);
  2770. return 0;
  2771. }
  2772. #else
  2773. static int gather_hugetlb_stats(pte_t *pte, unsigned long hmask,
  2774. unsigned long addr, unsigned long end, struct mm_walk *walk)
  2775. {
  2776. return 0;
  2777. }
  2778. #endif
  2779. static const struct mm_walk_ops show_numa_ops = {
  2780. .hugetlb_entry = gather_hugetlb_stats,
  2781. .pmd_entry = gather_pte_stats,
  2782. .walk_lock = PGWALK_RDLOCK,
  2783. };
  2784. /*
  2785. * Display pages allocated per node and memory policy via /proc.
  2786. */
  2787. static int show_numa_map(struct seq_file *m, void *v)
  2788. {
  2789. struct numa_maps_private *numa_priv = m->private;
  2790. struct proc_maps_private *proc_priv = &numa_priv->proc_maps;
  2791. struct vm_area_struct *vma = v;
  2792. struct numa_maps *md = &numa_priv->md;
  2793. struct file *file = vma->vm_file;
  2794. struct mm_struct *mm = vma->vm_mm;
  2795. char buffer[64];
  2796. struct mempolicy *pol;
  2797. pgoff_t ilx;
  2798. int nid;
  2799. if (!mm)
  2800. return 0;
  2801. /* Ensure we start with an empty set of numa_maps statistics. */
  2802. memset(md, 0, sizeof(*md));
  2803. pol = __get_vma_policy(vma, vma->vm_start, &ilx);
  2804. if (pol) {
  2805. mpol_to_str(buffer, sizeof(buffer), pol);
  2806. mpol_cond_put(pol);
  2807. } else {
  2808. mpol_to_str(buffer, sizeof(buffer), proc_priv->task_mempolicy);
  2809. }
  2810. seq_printf(m, "%08lx %s", vma->vm_start, buffer);
  2811. if (file) {
  2812. seq_puts(m, " file=");
  2813. seq_path(m, file_user_path(file), "\n\t= ");
  2814. } else if (vma_is_initial_heap(vma)) {
  2815. seq_puts(m, " heap");
  2816. } else if (vma_is_initial_stack(vma)) {
  2817. seq_puts(m, " stack");
  2818. }
  2819. if (is_vm_hugetlb_page(vma))
  2820. seq_puts(m, " huge");
  2821. /* mmap_lock is held by m_start */
  2822. walk_page_vma(vma, &show_numa_ops, md);
  2823. if (!md->pages)
  2824. goto out;
  2825. if (md->anon)
  2826. seq_printf(m, " anon=%lu", md->anon);
  2827. if (md->dirty)
  2828. seq_printf(m, " dirty=%lu", md->dirty);
  2829. if (md->pages != md->anon && md->pages != md->dirty)
  2830. seq_printf(m, " mapped=%lu", md->pages);
  2831. if (md->mapcount_max > 1)
  2832. seq_printf(m, " mapmax=%lu", md->mapcount_max);
  2833. if (md->swapcache)
  2834. seq_printf(m, " swapcache=%lu", md->swapcache);
  2835. if (md->active < md->pages && !is_vm_hugetlb_page(vma))
  2836. seq_printf(m, " active=%lu", md->active);
  2837. if (md->writeback)
  2838. seq_printf(m, " writeback=%lu", md->writeback);
  2839. for_each_node_state(nid, N_MEMORY)
  2840. if (md->node[nid])
  2841. seq_printf(m, " N%d=%lu", nid, md->node[nid]);
  2842. seq_printf(m, " kernelpagesize_kB=%lu", vma_kernel_pagesize(vma) >> 10);
  2843. out:
  2844. seq_putc(m, '\n');
  2845. return 0;
  2846. }
  2847. static const struct seq_operations proc_pid_numa_maps_op = {
  2848. .start = m_start,
  2849. .next = m_next,
  2850. .stop = m_stop,
  2851. .show = show_numa_map,
  2852. };
  2853. static int pid_numa_maps_open(struct inode *inode, struct file *file)
  2854. {
  2855. return proc_maps_open(inode, file, &proc_pid_numa_maps_op,
  2856. sizeof(struct numa_maps_private));
  2857. }
  2858. const struct file_operations proc_pid_numa_maps_operations = {
  2859. .open = pid_numa_maps_open,
  2860. .read = seq_read,
  2861. .llseek = seq_lseek,
  2862. .release = proc_map_release,
  2863. };
  2864. #endif /* CONFIG_NUMA */