base.c 79 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353
  1. /*
  2. * linux/fs/proc/base.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. *
  6. * proc base directory handling functions
  7. *
  8. * 1999, Al Viro. Rewritten. Now it covers the whole per-process part.
  9. * Instead of using magical inumbers to determine the kind of object
  10. * we allocate and fill in-core inodes upon lookup. They don't even
  11. * go into icache. We cache the reference to task_struct upon lookup too.
  12. * Eventually it should become a filesystem in its own. We don't use the
  13. * rest of procfs anymore.
  14. *
  15. *
  16. * Changelog:
  17. * 17-Jan-2005
  18. * Allan Bezerra
  19. * Bruna Moreira <bruna.moreira@indt.org.br>
  20. * Edjard Mota <edjard.mota@indt.org.br>
  21. * Ilias Biris <ilias.biris@indt.org.br>
  22. * Mauricio Lin <mauricio.lin@indt.org.br>
  23. *
  24. * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT
  25. *
  26. * A new process specific entry (smaps) included in /proc. It shows the
  27. * size of rss for each memory area. The maps entry lacks information
  28. * about physical memory size (rss) for each mapped file, i.e.,
  29. * rss information for executables and library files.
  30. * This additional information is useful for any tools that need to know
  31. * about physical memory consumption for a process specific library.
  32. *
  33. * Changelog:
  34. * 21-Feb-2005
  35. * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT
  36. * Pud inclusion in the page table walking.
  37. *
  38. * ChangeLog:
  39. * 10-Mar-2005
  40. * 10LE Instituto Nokia de Tecnologia - INdT:
  41. * A better way to walks through the page table as suggested by Hugh Dickins.
  42. *
  43. * Simo Piiroinen <simo.piiroinen@nokia.com>:
  44. * Smaps information related to shared, private, clean and dirty pages.
  45. *
  46. * Paul Mundt <paul.mundt@nokia.com>:
  47. * Overall revision about smaps.
  48. */
  49. #include <asm/uaccess.h>
  50. #include <linux/errno.h>
  51. #include <linux/time.h>
  52. #include <linux/proc_fs.h>
  53. #include <linux/stat.h>
  54. #include <linux/task_io_accounting_ops.h>
  55. #include <linux/init.h>
  56. #include <linux/capability.h>
  57. #include <linux/file.h>
  58. #include <linux/fdtable.h>
  59. #include <linux/string.h>
  60. #include <linux/seq_file.h>
  61. #include <linux/namei.h>
  62. #include <linux/mnt_namespace.h>
  63. #include <linux/mm.h>
  64. #include <linux/swap.h>
  65. #include <linux/rcupdate.h>
  66. #include <linux/kallsyms.h>
  67. #include <linux/stacktrace.h>
  68. #include <linux/resource.h>
  69. #include <linux/module.h>
  70. #include <linux/mount.h>
  71. #include <linux/security.h>
  72. #include <linux/ptrace.h>
  73. #include <linux/tracehook.h>
  74. #include <linux/cgroup.h>
  75. #include <linux/cpuset.h>
  76. #include <linux/audit.h>
  77. #include <linux/poll.h>
  78. #include <linux/nsproxy.h>
  79. #include <linux/oom.h>
  80. #include <linux/elf.h>
  81. #include <linux/pid_namespace.h>
  82. #include <linux/user_namespace.h>
  83. #include <linux/fs_struct.h>
  84. #include <linux/slab.h>
  85. #include <linux/flex_array.h>
  86. #ifdef CONFIG_HARDWALL
  87. #include <asm/hardwall.h>
  88. #endif
  89. #include <trace/events/oom.h>
  90. #include "internal.h"
  91. #include "fd.h"
  92. /* NOTE:
  93. * Implementing inode permission operations in /proc is almost
  94. * certainly an error. Permission checks need to happen during
  95. * each system call not at open time. The reason is that most of
  96. * what we wish to check for permissions in /proc varies at runtime.
  97. *
  98. * The classic example of a problem is opening file descriptors
  99. * in /proc for a task before it execs a suid executable.
  100. */
  101. struct pid_entry {
  102. char *name;
  103. int len;
  104. umode_t mode;
  105. const struct inode_operations *iop;
  106. const struct file_operations *fop;
  107. union proc_op op;
  108. };
  109. #define NOD(NAME, MODE, IOP, FOP, OP) { \
  110. .name = (NAME), \
  111. .len = sizeof(NAME) - 1, \
  112. .mode = MODE, \
  113. .iop = IOP, \
  114. .fop = FOP, \
  115. .op = OP, \
  116. }
  117. #define DIR(NAME, MODE, iops, fops) \
  118. NOD(NAME, (S_IFDIR|(MODE)), &iops, &fops, {} )
  119. #define LNK(NAME, get_link) \
  120. NOD(NAME, (S_IFLNK|S_IRWXUGO), \
  121. &proc_pid_link_inode_operations, NULL, \
  122. { .proc_get_link = get_link } )
  123. #define REG(NAME, MODE, fops) \
  124. NOD(NAME, (S_IFREG|(MODE)), NULL, &fops, {})
  125. #define INF(NAME, MODE, read) \
  126. NOD(NAME, (S_IFREG|(MODE)), \
  127. NULL, &proc_info_file_operations, \
  128. { .proc_read = read } )
  129. #define ONE(NAME, MODE, show) \
  130. NOD(NAME, (S_IFREG|(MODE)), \
  131. NULL, &proc_single_file_operations, \
  132. { .proc_show = show } )
  133. /*
  134. * Count the number of hardlinks for the pid_entry table, excluding the .
  135. * and .. links.
  136. */
  137. static unsigned int pid_entry_count_dirs(const struct pid_entry *entries,
  138. unsigned int n)
  139. {
  140. unsigned int i;
  141. unsigned int count;
  142. count = 0;
  143. for (i = 0; i < n; ++i) {
  144. if (S_ISDIR(entries[i].mode))
  145. ++count;
  146. }
  147. return count;
  148. }
  149. static int get_task_root(struct task_struct *task, struct path *root)
  150. {
  151. int result = -ENOENT;
  152. task_lock(task);
  153. if (task->fs) {
  154. get_fs_root(task->fs, root);
  155. result = 0;
  156. }
  157. task_unlock(task);
  158. return result;
  159. }
  160. static int proc_cwd_link(struct dentry *dentry, struct path *path)
  161. {
  162. struct task_struct *task = get_proc_task(dentry->d_inode);
  163. int result = -ENOENT;
  164. if (task) {
  165. task_lock(task);
  166. if (task->fs) {
  167. get_fs_pwd(task->fs, path);
  168. result = 0;
  169. }
  170. task_unlock(task);
  171. put_task_struct(task);
  172. }
  173. return result;
  174. }
  175. static int proc_root_link(struct dentry *dentry, struct path *path)
  176. {
  177. struct task_struct *task = get_proc_task(dentry->d_inode);
  178. int result = -ENOENT;
  179. if (task) {
  180. result = get_task_root(task, path);
  181. put_task_struct(task);
  182. }
  183. return result;
  184. }
  185. static int proc_pid_cmdline(struct task_struct *task, char * buffer)
  186. {
  187. int res = 0;
  188. unsigned int len;
  189. struct mm_struct *mm = get_task_mm(task);
  190. if (!mm)
  191. goto out;
  192. if (!mm->arg_end)
  193. goto out_mm; /* Shh! No looking before we're done */
  194. len = mm->arg_end - mm->arg_start;
  195. if (len > PAGE_SIZE)
  196. len = PAGE_SIZE;
  197. res = access_process_vm(task, mm->arg_start, buffer, len, 0);
  198. // If the nul at the end of args has been overwritten, then
  199. // assume application is using setproctitle(3).
  200. if (res > 0 && buffer[res-1] != '\0' && len < PAGE_SIZE) {
  201. len = strnlen(buffer, res);
  202. if (len < res) {
  203. res = len;
  204. } else {
  205. len = mm->env_end - mm->env_start;
  206. if (len > PAGE_SIZE - res)
  207. len = PAGE_SIZE - res;
  208. res += access_process_vm(task, mm->env_start, buffer+res, len, 0);
  209. res = strnlen(buffer, res);
  210. }
  211. }
  212. out_mm:
  213. mmput(mm);
  214. out:
  215. return res;
  216. }
  217. static int proc_pid_auxv(struct task_struct *task, char *buffer)
  218. {
  219. struct mm_struct *mm = mm_access(task, PTRACE_MODE_READ);
  220. int res = PTR_ERR(mm);
  221. if (mm && !IS_ERR(mm)) {
  222. unsigned int nwords = 0;
  223. do {
  224. nwords += 2;
  225. } while (mm->saved_auxv[nwords - 2] != 0); /* AT_NULL */
  226. res = nwords * sizeof(mm->saved_auxv[0]);
  227. if (res > PAGE_SIZE)
  228. res = PAGE_SIZE;
  229. memcpy(buffer, mm->saved_auxv, res);
  230. mmput(mm);
  231. }
  232. return res;
  233. }
  234. #ifdef CONFIG_KALLSYMS
  235. /*
  236. * Provides a wchan file via kallsyms in a proper one-value-per-file format.
  237. * Returns the resolved symbol. If that fails, simply return the address.
  238. */
  239. static int proc_pid_wchan(struct task_struct *task, char *buffer)
  240. {
  241. unsigned long wchan;
  242. char symname[KSYM_NAME_LEN];
  243. wchan = get_wchan(task);
  244. if (lookup_symbol_name(wchan, symname) < 0)
  245. if (!ptrace_may_access(task, PTRACE_MODE_READ))
  246. return 0;
  247. else
  248. return sprintf(buffer, "%lu", wchan);
  249. else
  250. return sprintf(buffer, "%s", symname);
  251. }
  252. #endif /* CONFIG_KALLSYMS */
  253. static int lock_trace(struct task_struct *task)
  254. {
  255. int err = mutex_lock_killable(&task->signal->cred_guard_mutex);
  256. if (err)
  257. return err;
  258. if (!ptrace_may_access(task, PTRACE_MODE_ATTACH)) {
  259. mutex_unlock(&task->signal->cred_guard_mutex);
  260. return -EPERM;
  261. }
  262. return 0;
  263. }
  264. static void unlock_trace(struct task_struct *task)
  265. {
  266. mutex_unlock(&task->signal->cred_guard_mutex);
  267. }
  268. #ifdef CONFIG_STACKTRACE
  269. #define MAX_STACK_TRACE_DEPTH 64
  270. static int proc_pid_stack(struct seq_file *m, struct pid_namespace *ns,
  271. struct pid *pid, struct task_struct *task)
  272. {
  273. struct stack_trace trace;
  274. unsigned long *entries;
  275. int err;
  276. int i;
  277. entries = kmalloc(MAX_STACK_TRACE_DEPTH * sizeof(*entries), GFP_KERNEL);
  278. if (!entries)
  279. return -ENOMEM;
  280. trace.nr_entries = 0;
  281. trace.max_entries = MAX_STACK_TRACE_DEPTH;
  282. trace.entries = entries;
  283. trace.skip = 0;
  284. err = lock_trace(task);
  285. if (!err) {
  286. save_stack_trace_tsk(task, &trace);
  287. for (i = 0; i < trace.nr_entries; i++) {
  288. seq_printf(m, "[<%pK>] %pS\n",
  289. (void *)entries[i], (void *)entries[i]);
  290. }
  291. unlock_trace(task);
  292. }
  293. kfree(entries);
  294. return err;
  295. }
  296. #endif
  297. #ifdef CONFIG_SCHEDSTATS
  298. /*
  299. * Provides /proc/PID/schedstat
  300. */
  301. static int proc_pid_schedstat(struct task_struct *task, char *buffer)
  302. {
  303. return sprintf(buffer, "%llu %llu %lu\n",
  304. (unsigned long long)task->se.sum_exec_runtime,
  305. (unsigned long long)task->sched_info.run_delay,
  306. task->sched_info.pcount);
  307. }
  308. #endif
  309. #ifdef CONFIG_LATENCYTOP
  310. static int lstats_show_proc(struct seq_file *m, void *v)
  311. {
  312. int i;
  313. struct inode *inode = m->private;
  314. struct task_struct *task = get_proc_task(inode);
  315. if (!task)
  316. return -ESRCH;
  317. seq_puts(m, "Latency Top version : v0.1\n");
  318. for (i = 0; i < 32; i++) {
  319. struct latency_record *lr = &task->latency_record[i];
  320. if (lr->backtrace[0]) {
  321. int q;
  322. seq_printf(m, "%i %li %li",
  323. lr->count, lr->time, lr->max);
  324. for (q = 0; q < LT_BACKTRACEDEPTH; q++) {
  325. unsigned long bt = lr->backtrace[q];
  326. if (!bt)
  327. break;
  328. if (bt == ULONG_MAX)
  329. break;
  330. seq_printf(m, " %ps", (void *)bt);
  331. }
  332. seq_putc(m, '\n');
  333. }
  334. }
  335. put_task_struct(task);
  336. return 0;
  337. }
  338. static int lstats_open(struct inode *inode, struct file *file)
  339. {
  340. return single_open(file, lstats_show_proc, inode);
  341. }
  342. static ssize_t lstats_write(struct file *file, const char __user *buf,
  343. size_t count, loff_t *offs)
  344. {
  345. struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
  346. if (!task)
  347. return -ESRCH;
  348. clear_all_latency_tracing(task);
  349. put_task_struct(task);
  350. return count;
  351. }
  352. static const struct file_operations proc_lstats_operations = {
  353. .open = lstats_open,
  354. .read = seq_read,
  355. .write = lstats_write,
  356. .llseek = seq_lseek,
  357. .release = single_release,
  358. };
  359. #endif
  360. static int proc_oom_score(struct task_struct *task, char *buffer)
  361. {
  362. unsigned long totalpages = totalram_pages + total_swap_pages;
  363. unsigned long points = 0;
  364. read_lock(&tasklist_lock);
  365. if (pid_alive(task))
  366. points = oom_badness(task, NULL, NULL, totalpages) *
  367. 1000 / totalpages;
  368. read_unlock(&tasklist_lock);
  369. return sprintf(buffer, "%lu\n", points);
  370. }
  371. struct limit_names {
  372. char *name;
  373. char *unit;
  374. };
  375. static const struct limit_names lnames[RLIM_NLIMITS] = {
  376. [RLIMIT_CPU] = {"Max cpu time", "seconds"},
  377. [RLIMIT_FSIZE] = {"Max file size", "bytes"},
  378. [RLIMIT_DATA] = {"Max data size", "bytes"},
  379. [RLIMIT_STACK] = {"Max stack size", "bytes"},
  380. [RLIMIT_CORE] = {"Max core file size", "bytes"},
  381. [RLIMIT_RSS] = {"Max resident set", "bytes"},
  382. [RLIMIT_NPROC] = {"Max processes", "processes"},
  383. [RLIMIT_NOFILE] = {"Max open files", "files"},
  384. [RLIMIT_MEMLOCK] = {"Max locked memory", "bytes"},
  385. [RLIMIT_AS] = {"Max address space", "bytes"},
  386. [RLIMIT_LOCKS] = {"Max file locks", "locks"},
  387. [RLIMIT_SIGPENDING] = {"Max pending signals", "signals"},
  388. [RLIMIT_MSGQUEUE] = {"Max msgqueue size", "bytes"},
  389. [RLIMIT_NICE] = {"Max nice priority", NULL},
  390. [RLIMIT_RTPRIO] = {"Max realtime priority", NULL},
  391. [RLIMIT_RTTIME] = {"Max realtime timeout", "us"},
  392. };
  393. /* Display limits for a process */
  394. static int proc_pid_limits(struct task_struct *task, char *buffer)
  395. {
  396. unsigned int i;
  397. int count = 0;
  398. unsigned long flags;
  399. char *bufptr = buffer;
  400. struct rlimit rlim[RLIM_NLIMITS];
  401. if (!lock_task_sighand(task, &flags))
  402. return 0;
  403. memcpy(rlim, task->signal->rlim, sizeof(struct rlimit) * RLIM_NLIMITS);
  404. unlock_task_sighand(task, &flags);
  405. /*
  406. * print the file header
  407. */
  408. count += sprintf(&bufptr[count], "%-25s %-20s %-20s %-10s\n",
  409. "Limit", "Soft Limit", "Hard Limit", "Units");
  410. for (i = 0; i < RLIM_NLIMITS; i++) {
  411. if (rlim[i].rlim_cur == RLIM_INFINITY)
  412. count += sprintf(&bufptr[count], "%-25s %-20s ",
  413. lnames[i].name, "unlimited");
  414. else
  415. count += sprintf(&bufptr[count], "%-25s %-20lu ",
  416. lnames[i].name, rlim[i].rlim_cur);
  417. if (rlim[i].rlim_max == RLIM_INFINITY)
  418. count += sprintf(&bufptr[count], "%-20s ", "unlimited");
  419. else
  420. count += sprintf(&bufptr[count], "%-20lu ",
  421. rlim[i].rlim_max);
  422. if (lnames[i].unit)
  423. count += sprintf(&bufptr[count], "%-10s\n",
  424. lnames[i].unit);
  425. else
  426. count += sprintf(&bufptr[count], "\n");
  427. }
  428. return count;
  429. }
  430. #ifdef CONFIG_HAVE_ARCH_TRACEHOOK
  431. static int proc_pid_syscall(struct task_struct *task, char *buffer)
  432. {
  433. long nr;
  434. unsigned long args[6], sp, pc;
  435. int res = lock_trace(task);
  436. if (res)
  437. return res;
  438. if (task_current_syscall(task, &nr, args, 6, &sp, &pc))
  439. res = sprintf(buffer, "running\n");
  440. else if (nr < 0)
  441. res = sprintf(buffer, "%ld 0x%lx 0x%lx\n", nr, sp, pc);
  442. else
  443. res = sprintf(buffer,
  444. "%ld 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx\n",
  445. nr,
  446. args[0], args[1], args[2], args[3], args[4], args[5],
  447. sp, pc);
  448. unlock_trace(task);
  449. return res;
  450. }
  451. #endif /* CONFIG_HAVE_ARCH_TRACEHOOK */
  452. /************************************************************************/
  453. /* Here the fs part begins */
  454. /************************************************************************/
  455. /* permission checks */
  456. static int proc_fd_access_allowed(struct inode *inode)
  457. {
  458. struct task_struct *task;
  459. int allowed = 0;
  460. /* Allow access to a task's file descriptors if it is us or we
  461. * may use ptrace attach to the process and find out that
  462. * information.
  463. */
  464. task = get_proc_task(inode);
  465. if (task) {
  466. allowed = ptrace_may_access(task, PTRACE_MODE_READ);
  467. put_task_struct(task);
  468. }
  469. return allowed;
  470. }
  471. int proc_setattr(struct dentry *dentry, struct iattr *attr)
  472. {
  473. int error;
  474. struct inode *inode = dentry->d_inode;
  475. if (attr->ia_valid & ATTR_MODE)
  476. return -EPERM;
  477. error = inode_change_ok(inode, attr);
  478. if (error)
  479. return error;
  480. if ((attr->ia_valid & ATTR_SIZE) &&
  481. attr->ia_size != i_size_read(inode)) {
  482. error = vmtruncate(inode, attr->ia_size);
  483. if (error)
  484. return error;
  485. }
  486. setattr_copy(inode, attr);
  487. mark_inode_dirty(inode);
  488. return 0;
  489. }
  490. /*
  491. * May current process learn task's sched/cmdline info (for hide_pid_min=1)
  492. * or euid/egid (for hide_pid_min=2)?
  493. */
  494. static bool has_pid_permissions(struct pid_namespace *pid,
  495. struct task_struct *task,
  496. int hide_pid_min)
  497. {
  498. if (pid->hide_pid < hide_pid_min)
  499. return true;
  500. if (in_group_p(pid->pid_gid))
  501. return true;
  502. return ptrace_may_access(task, PTRACE_MODE_READ);
  503. }
  504. static int proc_pid_permission(struct inode *inode, int mask)
  505. {
  506. struct pid_namespace *pid = inode->i_sb->s_fs_info;
  507. struct task_struct *task;
  508. bool has_perms;
  509. task = get_proc_task(inode);
  510. if (!task)
  511. return -ESRCH;
  512. has_perms = has_pid_permissions(pid, task, 1);
  513. put_task_struct(task);
  514. if (!has_perms) {
  515. if (pid->hide_pid == 2) {
  516. /*
  517. * Let's make getdents(), stat(), and open()
  518. * consistent with each other. If a process
  519. * may not stat() a file, it shouldn't be seen
  520. * in procfs at all.
  521. */
  522. return -ENOENT;
  523. }
  524. return -EPERM;
  525. }
  526. return generic_permission(inode, mask);
  527. }
  528. static const struct inode_operations proc_def_inode_operations = {
  529. .setattr = proc_setattr,
  530. };
  531. #define PROC_BLOCK_SIZE (3*1024) /* 4K page size but our output routines use some slack for overruns */
  532. static ssize_t proc_info_read(struct file * file, char __user * buf,
  533. size_t count, loff_t *ppos)
  534. {
  535. struct inode * inode = file->f_path.dentry->d_inode;
  536. unsigned long page;
  537. ssize_t length;
  538. struct task_struct *task = get_proc_task(inode);
  539. length = -ESRCH;
  540. if (!task)
  541. goto out_no_task;
  542. if (count > PROC_BLOCK_SIZE)
  543. count = PROC_BLOCK_SIZE;
  544. length = -ENOMEM;
  545. if (!(page = __get_free_page(GFP_TEMPORARY)))
  546. goto out;
  547. length = PROC_I(inode)->op.proc_read(task, (char*)page);
  548. if (length >= 0)
  549. length = simple_read_from_buffer(buf, count, ppos, (char *)page, length);
  550. free_page(page);
  551. out:
  552. put_task_struct(task);
  553. out_no_task:
  554. return length;
  555. }
  556. static const struct file_operations proc_info_file_operations = {
  557. .read = proc_info_read,
  558. .llseek = generic_file_llseek,
  559. };
  560. static int proc_single_show(struct seq_file *m, void *v)
  561. {
  562. struct inode *inode = m->private;
  563. struct pid_namespace *ns;
  564. struct pid *pid;
  565. struct task_struct *task;
  566. int ret;
  567. ns = inode->i_sb->s_fs_info;
  568. pid = proc_pid(inode);
  569. task = get_pid_task(pid, PIDTYPE_PID);
  570. if (!task)
  571. return -ESRCH;
  572. ret = PROC_I(inode)->op.proc_show(m, ns, pid, task);
  573. put_task_struct(task);
  574. return ret;
  575. }
  576. static int proc_single_open(struct inode *inode, struct file *filp)
  577. {
  578. return single_open(filp, proc_single_show, inode);
  579. }
  580. static const struct file_operations proc_single_file_operations = {
  581. .open = proc_single_open,
  582. .read = seq_read,
  583. .llseek = seq_lseek,
  584. .release = single_release,
  585. };
  586. static int __mem_open(struct inode *inode, struct file *file, unsigned int mode)
  587. {
  588. struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
  589. struct mm_struct *mm;
  590. if (!task)
  591. return -ESRCH;
  592. mm = mm_access(task, mode);
  593. put_task_struct(task);
  594. if (IS_ERR(mm))
  595. return PTR_ERR(mm);
  596. if (mm) {
  597. /* ensure this mm_struct can't be freed */
  598. atomic_inc(&mm->mm_count);
  599. /* but do not pin its memory */
  600. mmput(mm);
  601. }
  602. file->private_data = mm;
  603. return 0;
  604. }
  605. static int mem_open(struct inode *inode, struct file *file)
  606. {
  607. int ret = __mem_open(inode, file, PTRACE_MODE_ATTACH);
  608. /* OK to pass negative loff_t, we can catch out-of-range */
  609. file->f_mode |= FMODE_UNSIGNED_OFFSET;
  610. return ret;
  611. }
  612. static ssize_t mem_rw(struct file *file, char __user *buf,
  613. size_t count, loff_t *ppos, int write)
  614. {
  615. struct mm_struct *mm = file->private_data;
  616. unsigned long addr = *ppos;
  617. ssize_t copied;
  618. char *page;
  619. if (!mm)
  620. return 0;
  621. page = (char *)__get_free_page(GFP_TEMPORARY);
  622. if (!page)
  623. return -ENOMEM;
  624. copied = 0;
  625. if (!atomic_inc_not_zero(&mm->mm_users))
  626. goto free;
  627. while (count > 0) {
  628. int this_len = min_t(int, count, PAGE_SIZE);
  629. if (write && copy_from_user(page, buf, this_len)) {
  630. copied = -EFAULT;
  631. break;
  632. }
  633. this_len = access_remote_vm(mm, addr, page, this_len, write);
  634. if (!this_len) {
  635. if (!copied)
  636. copied = -EIO;
  637. break;
  638. }
  639. if (!write && copy_to_user(buf, page, this_len)) {
  640. copied = -EFAULT;
  641. break;
  642. }
  643. buf += this_len;
  644. addr += this_len;
  645. copied += this_len;
  646. count -= this_len;
  647. }
  648. *ppos = addr;
  649. mmput(mm);
  650. free:
  651. free_page((unsigned long) page);
  652. return copied;
  653. }
  654. static ssize_t mem_read(struct file *file, char __user *buf,
  655. size_t count, loff_t *ppos)
  656. {
  657. return mem_rw(file, buf, count, ppos, 0);
  658. }
  659. static ssize_t mem_write(struct file *file, const char __user *buf,
  660. size_t count, loff_t *ppos)
  661. {
  662. return mem_rw(file, (char __user*)buf, count, ppos, 1);
  663. }
  664. loff_t mem_lseek(struct file *file, loff_t offset, int orig)
  665. {
  666. switch (orig) {
  667. case 0:
  668. file->f_pos = offset;
  669. break;
  670. case 1:
  671. file->f_pos += offset;
  672. break;
  673. default:
  674. return -EINVAL;
  675. }
  676. force_successful_syscall_return();
  677. return file->f_pos;
  678. }
  679. static int mem_release(struct inode *inode, struct file *file)
  680. {
  681. struct mm_struct *mm = file->private_data;
  682. if (mm)
  683. mmdrop(mm);
  684. return 0;
  685. }
  686. static const struct file_operations proc_mem_operations = {
  687. .llseek = mem_lseek,
  688. .read = mem_read,
  689. .write = mem_write,
  690. .open = mem_open,
  691. .release = mem_release,
  692. };
  693. static int environ_open(struct inode *inode, struct file *file)
  694. {
  695. return __mem_open(inode, file, PTRACE_MODE_READ);
  696. }
  697. static ssize_t environ_read(struct file *file, char __user *buf,
  698. size_t count, loff_t *ppos)
  699. {
  700. char *page;
  701. unsigned long src = *ppos;
  702. int ret = 0;
  703. struct mm_struct *mm = file->private_data;
  704. if (!mm)
  705. return 0;
  706. page = (char *)__get_free_page(GFP_TEMPORARY);
  707. if (!page)
  708. return -ENOMEM;
  709. ret = 0;
  710. if (!atomic_inc_not_zero(&mm->mm_users))
  711. goto free;
  712. while (count > 0) {
  713. size_t this_len, max_len;
  714. int retval;
  715. if (src >= (mm->env_end - mm->env_start))
  716. break;
  717. this_len = mm->env_end - (mm->env_start + src);
  718. max_len = min_t(size_t, PAGE_SIZE, count);
  719. this_len = min(max_len, this_len);
  720. retval = access_remote_vm(mm, (mm->env_start + src),
  721. page, this_len, 0);
  722. if (retval <= 0) {
  723. ret = retval;
  724. break;
  725. }
  726. if (copy_to_user(buf, page, retval)) {
  727. ret = -EFAULT;
  728. break;
  729. }
  730. ret += retval;
  731. src += retval;
  732. buf += retval;
  733. count -= retval;
  734. }
  735. *ppos = src;
  736. mmput(mm);
  737. free:
  738. free_page((unsigned long) page);
  739. return ret;
  740. }
  741. static const struct file_operations proc_environ_operations = {
  742. .open = environ_open,
  743. .read = environ_read,
  744. .llseek = generic_file_llseek,
  745. .release = mem_release,
  746. };
  747. static ssize_t oom_adj_read(struct file *file, char __user *buf, size_t count,
  748. loff_t *ppos)
  749. {
  750. struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
  751. char buffer[PROC_NUMBUF];
  752. int oom_adj = OOM_ADJUST_MIN;
  753. size_t len;
  754. unsigned long flags;
  755. if (!task)
  756. return -ESRCH;
  757. if (lock_task_sighand(task, &flags)) {
  758. if (task->signal->oom_score_adj == OOM_SCORE_ADJ_MAX)
  759. oom_adj = OOM_ADJUST_MAX;
  760. else
  761. oom_adj = (task->signal->oom_score_adj * -OOM_DISABLE) /
  762. OOM_SCORE_ADJ_MAX;
  763. unlock_task_sighand(task, &flags);
  764. }
  765. put_task_struct(task);
  766. len = snprintf(buffer, sizeof(buffer), "%d\n", oom_adj);
  767. return simple_read_from_buffer(buf, count, ppos, buffer, len);
  768. }
  769. static ssize_t oom_adj_write(struct file *file, const char __user *buf,
  770. size_t count, loff_t *ppos)
  771. {
  772. struct task_struct *task;
  773. char buffer[PROC_NUMBUF];
  774. int oom_adj;
  775. unsigned long flags;
  776. int err;
  777. memset(buffer, 0, sizeof(buffer));
  778. if (count > sizeof(buffer) - 1)
  779. count = sizeof(buffer) - 1;
  780. if (copy_from_user(buffer, buf, count)) {
  781. err = -EFAULT;
  782. goto out;
  783. }
  784. err = kstrtoint(strstrip(buffer), 0, &oom_adj);
  785. if (err)
  786. goto out;
  787. if ((oom_adj < OOM_ADJUST_MIN || oom_adj > OOM_ADJUST_MAX) &&
  788. oom_adj != OOM_DISABLE) {
  789. err = -EINVAL;
  790. goto out;
  791. }
  792. task = get_proc_task(file->f_path.dentry->d_inode);
  793. if (!task) {
  794. err = -ESRCH;
  795. goto out;
  796. }
  797. task_lock(task);
  798. if (!task->mm) {
  799. err = -EINVAL;
  800. goto err_task_lock;
  801. }
  802. if (!lock_task_sighand(task, &flags)) {
  803. err = -ESRCH;
  804. goto err_task_lock;
  805. }
  806. /*
  807. * Scale /proc/pid/oom_score_adj appropriately ensuring that a maximum
  808. * value is always attainable.
  809. */
  810. if (oom_adj == OOM_ADJUST_MAX)
  811. oom_adj = OOM_SCORE_ADJ_MAX;
  812. else
  813. oom_adj = (oom_adj * OOM_SCORE_ADJ_MAX) / -OOM_DISABLE;
  814. if (oom_adj < task->signal->oom_score_adj &&
  815. !capable(CAP_SYS_RESOURCE)) {
  816. err = -EACCES;
  817. goto err_sighand;
  818. }
  819. /*
  820. * /proc/pid/oom_adj is provided for legacy purposes, ask users to use
  821. * /proc/pid/oom_score_adj instead.
  822. */
  823. printk_once(KERN_WARNING "%s (%d): /proc/%d/oom_adj is deprecated, please use /proc/%d/oom_score_adj instead.\n",
  824. current->comm, task_pid_nr(current), task_pid_nr(task),
  825. task_pid_nr(task));
  826. task->signal->oom_score_adj = oom_adj;
  827. trace_oom_score_adj_update(task);
  828. err_sighand:
  829. unlock_task_sighand(task, &flags);
  830. err_task_lock:
  831. task_unlock(task);
  832. put_task_struct(task);
  833. out:
  834. return err < 0 ? err : count;
  835. }
  836. static const struct file_operations proc_oom_adj_operations = {
  837. .read = oom_adj_read,
  838. .write = oom_adj_write,
  839. .llseek = generic_file_llseek,
  840. };
  841. static ssize_t oom_score_adj_read(struct file *file, char __user *buf,
  842. size_t count, loff_t *ppos)
  843. {
  844. struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
  845. char buffer[PROC_NUMBUF];
  846. int oom_score_adj = OOM_SCORE_ADJ_MIN;
  847. unsigned long flags;
  848. size_t len;
  849. if (!task)
  850. return -ESRCH;
  851. if (lock_task_sighand(task, &flags)) {
  852. oom_score_adj = task->signal->oom_score_adj;
  853. unlock_task_sighand(task, &flags);
  854. }
  855. put_task_struct(task);
  856. len = snprintf(buffer, sizeof(buffer), "%d\n", oom_score_adj);
  857. return simple_read_from_buffer(buf, count, ppos, buffer, len);
  858. }
  859. static ssize_t oom_score_adj_write(struct file *file, const char __user *buf,
  860. size_t count, loff_t *ppos)
  861. {
  862. struct task_struct *task;
  863. char buffer[PROC_NUMBUF];
  864. unsigned long flags;
  865. int oom_score_adj;
  866. int err;
  867. memset(buffer, 0, sizeof(buffer));
  868. if (count > sizeof(buffer) - 1)
  869. count = sizeof(buffer) - 1;
  870. if (copy_from_user(buffer, buf, count)) {
  871. err = -EFAULT;
  872. goto out;
  873. }
  874. err = kstrtoint(strstrip(buffer), 0, &oom_score_adj);
  875. if (err)
  876. goto out;
  877. if (oom_score_adj < OOM_SCORE_ADJ_MIN ||
  878. oom_score_adj > OOM_SCORE_ADJ_MAX) {
  879. err = -EINVAL;
  880. goto out;
  881. }
  882. task = get_proc_task(file->f_path.dentry->d_inode);
  883. if (!task) {
  884. err = -ESRCH;
  885. goto out;
  886. }
  887. task_lock(task);
  888. if (!task->mm) {
  889. err = -EINVAL;
  890. goto err_task_lock;
  891. }
  892. if (!lock_task_sighand(task, &flags)) {
  893. err = -ESRCH;
  894. goto err_task_lock;
  895. }
  896. if (oom_score_adj < task->signal->oom_score_adj_min &&
  897. !capable(CAP_SYS_RESOURCE)) {
  898. err = -EACCES;
  899. goto err_sighand;
  900. }
  901. task->signal->oom_score_adj = oom_score_adj;
  902. if (has_capability_noaudit(current, CAP_SYS_RESOURCE))
  903. task->signal->oom_score_adj_min = oom_score_adj;
  904. trace_oom_score_adj_update(task);
  905. err_sighand:
  906. unlock_task_sighand(task, &flags);
  907. err_task_lock:
  908. task_unlock(task);
  909. put_task_struct(task);
  910. out:
  911. return err < 0 ? err : count;
  912. }
  913. static const struct file_operations proc_oom_score_adj_operations = {
  914. .read = oom_score_adj_read,
  915. .write = oom_score_adj_write,
  916. .llseek = default_llseek,
  917. };
  918. #ifdef CONFIG_AUDITSYSCALL
  919. #define TMPBUFLEN 21
  920. static ssize_t proc_loginuid_read(struct file * file, char __user * buf,
  921. size_t count, loff_t *ppos)
  922. {
  923. struct inode * inode = file->f_path.dentry->d_inode;
  924. struct task_struct *task = get_proc_task(inode);
  925. ssize_t length;
  926. char tmpbuf[TMPBUFLEN];
  927. if (!task)
  928. return -ESRCH;
  929. length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
  930. from_kuid(file->f_cred->user_ns,
  931. audit_get_loginuid(task)));
  932. put_task_struct(task);
  933. return simple_read_from_buffer(buf, count, ppos, tmpbuf, length);
  934. }
  935. static ssize_t proc_loginuid_write(struct file * file, const char __user * buf,
  936. size_t count, loff_t *ppos)
  937. {
  938. struct inode * inode = file->f_path.dentry->d_inode;
  939. char *page, *tmp;
  940. ssize_t length;
  941. uid_t loginuid;
  942. kuid_t kloginuid;
  943. rcu_read_lock();
  944. if (current != pid_task(proc_pid(inode), PIDTYPE_PID)) {
  945. rcu_read_unlock();
  946. return -EPERM;
  947. }
  948. rcu_read_unlock();
  949. if (count >= PAGE_SIZE)
  950. count = PAGE_SIZE - 1;
  951. if (*ppos != 0) {
  952. /* No partial writes. */
  953. return -EINVAL;
  954. }
  955. page = (char*)__get_free_page(GFP_TEMPORARY);
  956. if (!page)
  957. return -ENOMEM;
  958. length = -EFAULT;
  959. if (copy_from_user(page, buf, count))
  960. goto out_free_page;
  961. page[count] = '\0';
  962. loginuid = simple_strtoul(page, &tmp, 10);
  963. if (tmp == page) {
  964. length = -EINVAL;
  965. goto out_free_page;
  966. }
  967. kloginuid = make_kuid(file->f_cred->user_ns, loginuid);
  968. if (!uid_valid(kloginuid)) {
  969. length = -EINVAL;
  970. goto out_free_page;
  971. }
  972. length = audit_set_loginuid(kloginuid);
  973. if (likely(length == 0))
  974. length = count;
  975. out_free_page:
  976. free_page((unsigned long) page);
  977. return length;
  978. }
  979. static const struct file_operations proc_loginuid_operations = {
  980. .read = proc_loginuid_read,
  981. .write = proc_loginuid_write,
  982. .llseek = generic_file_llseek,
  983. };
  984. static ssize_t proc_sessionid_read(struct file * file, char __user * buf,
  985. size_t count, loff_t *ppos)
  986. {
  987. struct inode * inode = file->f_path.dentry->d_inode;
  988. struct task_struct *task = get_proc_task(inode);
  989. ssize_t length;
  990. char tmpbuf[TMPBUFLEN];
  991. if (!task)
  992. return -ESRCH;
  993. length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
  994. audit_get_sessionid(task));
  995. put_task_struct(task);
  996. return simple_read_from_buffer(buf, count, ppos, tmpbuf, length);
  997. }
  998. static const struct file_operations proc_sessionid_operations = {
  999. .read = proc_sessionid_read,
  1000. .llseek = generic_file_llseek,
  1001. };
  1002. #endif
  1003. #ifdef CONFIG_FAULT_INJECTION
  1004. static ssize_t proc_fault_inject_read(struct file * file, char __user * buf,
  1005. size_t count, loff_t *ppos)
  1006. {
  1007. struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
  1008. char buffer[PROC_NUMBUF];
  1009. size_t len;
  1010. int make_it_fail;
  1011. if (!task)
  1012. return -ESRCH;
  1013. make_it_fail = task->make_it_fail;
  1014. put_task_struct(task);
  1015. len = snprintf(buffer, sizeof(buffer), "%i\n", make_it_fail);
  1016. return simple_read_from_buffer(buf, count, ppos, buffer, len);
  1017. }
  1018. static ssize_t proc_fault_inject_write(struct file * file,
  1019. const char __user * buf, size_t count, loff_t *ppos)
  1020. {
  1021. struct task_struct *task;
  1022. char buffer[PROC_NUMBUF], *end;
  1023. int make_it_fail;
  1024. if (!capable(CAP_SYS_RESOURCE))
  1025. return -EPERM;
  1026. memset(buffer, 0, sizeof(buffer));
  1027. if (count > sizeof(buffer) - 1)
  1028. count = sizeof(buffer) - 1;
  1029. if (copy_from_user(buffer, buf, count))
  1030. return -EFAULT;
  1031. make_it_fail = simple_strtol(strstrip(buffer), &end, 0);
  1032. if (*end)
  1033. return -EINVAL;
  1034. task = get_proc_task(file->f_dentry->d_inode);
  1035. if (!task)
  1036. return -ESRCH;
  1037. task->make_it_fail = make_it_fail;
  1038. put_task_struct(task);
  1039. return count;
  1040. }
  1041. static const struct file_operations proc_fault_inject_operations = {
  1042. .read = proc_fault_inject_read,
  1043. .write = proc_fault_inject_write,
  1044. .llseek = generic_file_llseek,
  1045. };
  1046. #endif
  1047. #ifdef CONFIG_SCHED_DEBUG
  1048. /*
  1049. * Print out various scheduling related per-task fields:
  1050. */
  1051. static int sched_show(struct seq_file *m, void *v)
  1052. {
  1053. struct inode *inode = m->private;
  1054. struct task_struct *p;
  1055. p = get_proc_task(inode);
  1056. if (!p)
  1057. return -ESRCH;
  1058. proc_sched_show_task(p, m);
  1059. put_task_struct(p);
  1060. return 0;
  1061. }
  1062. static ssize_t
  1063. sched_write(struct file *file, const char __user *buf,
  1064. size_t count, loff_t *offset)
  1065. {
  1066. struct inode *inode = file->f_path.dentry->d_inode;
  1067. struct task_struct *p;
  1068. p = get_proc_task(inode);
  1069. if (!p)
  1070. return -ESRCH;
  1071. proc_sched_set_task(p);
  1072. put_task_struct(p);
  1073. return count;
  1074. }
  1075. static int sched_open(struct inode *inode, struct file *filp)
  1076. {
  1077. return single_open(filp, sched_show, inode);
  1078. }
  1079. static const struct file_operations proc_pid_sched_operations = {
  1080. .open = sched_open,
  1081. .read = seq_read,
  1082. .write = sched_write,
  1083. .llseek = seq_lseek,
  1084. .release = single_release,
  1085. };
  1086. #endif
  1087. #ifdef CONFIG_SCHED_AUTOGROUP
  1088. /*
  1089. * Print out autogroup related information:
  1090. */
  1091. static int sched_autogroup_show(struct seq_file *m, void *v)
  1092. {
  1093. struct inode *inode = m->private;
  1094. struct task_struct *p;
  1095. p = get_proc_task(inode);
  1096. if (!p)
  1097. return -ESRCH;
  1098. proc_sched_autogroup_show_task(p, m);
  1099. put_task_struct(p);
  1100. return 0;
  1101. }
  1102. static ssize_t
  1103. sched_autogroup_write(struct file *file, const char __user *buf,
  1104. size_t count, loff_t *offset)
  1105. {
  1106. struct inode *inode = file->f_path.dentry->d_inode;
  1107. struct task_struct *p;
  1108. char buffer[PROC_NUMBUF];
  1109. int nice;
  1110. int err;
  1111. memset(buffer, 0, sizeof(buffer));
  1112. if (count > sizeof(buffer) - 1)
  1113. count = sizeof(buffer) - 1;
  1114. if (copy_from_user(buffer, buf, count))
  1115. return -EFAULT;
  1116. err = kstrtoint(strstrip(buffer), 0, &nice);
  1117. if (err < 0)
  1118. return err;
  1119. p = get_proc_task(inode);
  1120. if (!p)
  1121. return -ESRCH;
  1122. err = proc_sched_autogroup_set_nice(p, nice);
  1123. if (err)
  1124. count = err;
  1125. put_task_struct(p);
  1126. return count;
  1127. }
  1128. static int sched_autogroup_open(struct inode *inode, struct file *filp)
  1129. {
  1130. int ret;
  1131. ret = single_open(filp, sched_autogroup_show, NULL);
  1132. if (!ret) {
  1133. struct seq_file *m = filp->private_data;
  1134. m->private = inode;
  1135. }
  1136. return ret;
  1137. }
  1138. static const struct file_operations proc_pid_sched_autogroup_operations = {
  1139. .open = sched_autogroup_open,
  1140. .read = seq_read,
  1141. .write = sched_autogroup_write,
  1142. .llseek = seq_lseek,
  1143. .release = single_release,
  1144. };
  1145. #endif /* CONFIG_SCHED_AUTOGROUP */
  1146. static ssize_t comm_write(struct file *file, const char __user *buf,
  1147. size_t count, loff_t *offset)
  1148. {
  1149. struct inode *inode = file->f_path.dentry->d_inode;
  1150. struct task_struct *p;
  1151. char buffer[TASK_COMM_LEN];
  1152. memset(buffer, 0, sizeof(buffer));
  1153. if (count > sizeof(buffer) - 1)
  1154. count = sizeof(buffer) - 1;
  1155. if (copy_from_user(buffer, buf, count))
  1156. return -EFAULT;
  1157. p = get_proc_task(inode);
  1158. if (!p)
  1159. return -ESRCH;
  1160. if (same_thread_group(current, p))
  1161. set_task_comm(p, buffer);
  1162. else
  1163. count = -EINVAL;
  1164. put_task_struct(p);
  1165. return count;
  1166. }
  1167. static int comm_show(struct seq_file *m, void *v)
  1168. {
  1169. struct inode *inode = m->private;
  1170. struct task_struct *p;
  1171. p = get_proc_task(inode);
  1172. if (!p)
  1173. return -ESRCH;
  1174. task_lock(p);
  1175. seq_printf(m, "%s\n", p->comm);
  1176. task_unlock(p);
  1177. put_task_struct(p);
  1178. return 0;
  1179. }
  1180. static int comm_open(struct inode *inode, struct file *filp)
  1181. {
  1182. return single_open(filp, comm_show, inode);
  1183. }
  1184. static const struct file_operations proc_pid_set_comm_operations = {
  1185. .open = comm_open,
  1186. .read = seq_read,
  1187. .write = comm_write,
  1188. .llseek = seq_lseek,
  1189. .release = single_release,
  1190. };
  1191. static int proc_exe_link(struct dentry *dentry, struct path *exe_path)
  1192. {
  1193. struct task_struct *task;
  1194. struct mm_struct *mm;
  1195. struct file *exe_file;
  1196. task = get_proc_task(dentry->d_inode);
  1197. if (!task)
  1198. return -ENOENT;
  1199. mm = get_task_mm(task);
  1200. put_task_struct(task);
  1201. if (!mm)
  1202. return -ENOENT;
  1203. exe_file = get_mm_exe_file(mm);
  1204. mmput(mm);
  1205. if (exe_file) {
  1206. *exe_path = exe_file->f_path;
  1207. path_get(&exe_file->f_path);
  1208. fput(exe_file);
  1209. return 0;
  1210. } else
  1211. return -ENOENT;
  1212. }
  1213. static void *proc_pid_follow_link(struct dentry *dentry, struct nameidata *nd)
  1214. {
  1215. struct inode *inode = dentry->d_inode;
  1216. struct path path;
  1217. int error = -EACCES;
  1218. /* Are we allowed to snoop on the tasks file descriptors? */
  1219. if (!proc_fd_access_allowed(inode))
  1220. goto out;
  1221. error = PROC_I(inode)->op.proc_get_link(dentry, &path);
  1222. if (error)
  1223. goto out;
  1224. nd_jump_link(nd, &path);
  1225. return NULL;
  1226. out:
  1227. return ERR_PTR(error);
  1228. }
  1229. static int do_proc_readlink(struct path *path, char __user *buffer, int buflen)
  1230. {
  1231. char *tmp = (char*)__get_free_page(GFP_TEMPORARY);
  1232. char *pathname;
  1233. int len;
  1234. if (!tmp)
  1235. return -ENOMEM;
  1236. pathname = d_path(path, tmp, PAGE_SIZE);
  1237. len = PTR_ERR(pathname);
  1238. if (IS_ERR(pathname))
  1239. goto out;
  1240. len = tmp + PAGE_SIZE - 1 - pathname;
  1241. if (len > buflen)
  1242. len = buflen;
  1243. if (copy_to_user(buffer, pathname, len))
  1244. len = -EFAULT;
  1245. out:
  1246. free_page((unsigned long)tmp);
  1247. return len;
  1248. }
  1249. static int proc_pid_readlink(struct dentry * dentry, char __user * buffer, int buflen)
  1250. {
  1251. int error = -EACCES;
  1252. struct inode *inode = dentry->d_inode;
  1253. struct path path;
  1254. /* Are we allowed to snoop on the tasks file descriptors? */
  1255. if (!proc_fd_access_allowed(inode))
  1256. goto out;
  1257. error = PROC_I(inode)->op.proc_get_link(dentry, &path);
  1258. if (error)
  1259. goto out;
  1260. error = do_proc_readlink(&path, buffer, buflen);
  1261. path_put(&path);
  1262. out:
  1263. return error;
  1264. }
  1265. const struct inode_operations proc_pid_link_inode_operations = {
  1266. .readlink = proc_pid_readlink,
  1267. .follow_link = proc_pid_follow_link,
  1268. .setattr = proc_setattr,
  1269. };
  1270. /* building an inode */
  1271. struct inode *proc_pid_make_inode(struct super_block * sb, struct task_struct *task)
  1272. {
  1273. struct inode * inode;
  1274. struct proc_inode *ei;
  1275. const struct cred *cred;
  1276. /* We need a new inode */
  1277. inode = new_inode(sb);
  1278. if (!inode)
  1279. goto out;
  1280. /* Common stuff */
  1281. ei = PROC_I(inode);
  1282. inode->i_ino = get_next_ino();
  1283. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  1284. inode->i_op = &proc_def_inode_operations;
  1285. /*
  1286. * grab the reference to task.
  1287. */
  1288. ei->pid = get_task_pid(task, PIDTYPE_PID);
  1289. if (!ei->pid)
  1290. goto out_unlock;
  1291. if (task_dumpable(task)) {
  1292. rcu_read_lock();
  1293. cred = __task_cred(task);
  1294. inode->i_uid = cred->euid;
  1295. inode->i_gid = cred->egid;
  1296. rcu_read_unlock();
  1297. }
  1298. security_task_to_inode(task, inode);
  1299. out:
  1300. return inode;
  1301. out_unlock:
  1302. iput(inode);
  1303. return NULL;
  1304. }
  1305. int pid_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
  1306. {
  1307. struct inode *inode = dentry->d_inode;
  1308. struct task_struct *task;
  1309. const struct cred *cred;
  1310. struct pid_namespace *pid = dentry->d_sb->s_fs_info;
  1311. generic_fillattr(inode, stat);
  1312. rcu_read_lock();
  1313. stat->uid = GLOBAL_ROOT_UID;
  1314. stat->gid = GLOBAL_ROOT_GID;
  1315. task = pid_task(proc_pid(inode), PIDTYPE_PID);
  1316. if (task) {
  1317. if (!has_pid_permissions(pid, task, 2)) {
  1318. rcu_read_unlock();
  1319. /*
  1320. * This doesn't prevent learning whether PID exists,
  1321. * it only makes getattr() consistent with readdir().
  1322. */
  1323. return -ENOENT;
  1324. }
  1325. if ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||
  1326. task_dumpable(task)) {
  1327. cred = __task_cred(task);
  1328. stat->uid = cred->euid;
  1329. stat->gid = cred->egid;
  1330. }
  1331. }
  1332. rcu_read_unlock();
  1333. return 0;
  1334. }
  1335. /* dentry stuff */
  1336. /*
  1337. * Exceptional case: normally we are not allowed to unhash a busy
  1338. * directory. In this case, however, we can do it - no aliasing problems
  1339. * due to the way we treat inodes.
  1340. *
  1341. * Rewrite the inode's ownerships here because the owning task may have
  1342. * performed a setuid(), etc.
  1343. *
  1344. * Before the /proc/pid/status file was created the only way to read
  1345. * the effective uid of a /process was to stat /proc/pid. Reading
  1346. * /proc/pid/status is slow enough that procps and other packages
  1347. * kept stating /proc/pid. To keep the rules in /proc simple I have
  1348. * made this apply to all per process world readable and executable
  1349. * directories.
  1350. */
  1351. int pid_revalidate(struct dentry *dentry, unsigned int flags)
  1352. {
  1353. struct inode *inode;
  1354. struct task_struct *task;
  1355. const struct cred *cred;
  1356. if (flags & LOOKUP_RCU)
  1357. return -ECHILD;
  1358. inode = dentry->d_inode;
  1359. task = get_proc_task(inode);
  1360. if (task) {
  1361. if ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||
  1362. task_dumpable(task)) {
  1363. rcu_read_lock();
  1364. cred = __task_cred(task);
  1365. inode->i_uid = cred->euid;
  1366. inode->i_gid = cred->egid;
  1367. rcu_read_unlock();
  1368. } else {
  1369. inode->i_uid = GLOBAL_ROOT_UID;
  1370. inode->i_gid = GLOBAL_ROOT_GID;
  1371. }
  1372. inode->i_mode &= ~(S_ISUID | S_ISGID);
  1373. security_task_to_inode(task, inode);
  1374. put_task_struct(task);
  1375. return 1;
  1376. }
  1377. d_drop(dentry);
  1378. return 0;
  1379. }
  1380. const struct dentry_operations pid_dentry_operations =
  1381. {
  1382. .d_revalidate = pid_revalidate,
  1383. .d_delete = pid_delete_dentry,
  1384. };
  1385. /* Lookups */
  1386. /*
  1387. * Fill a directory entry.
  1388. *
  1389. * If possible create the dcache entry and derive our inode number and
  1390. * file type from dcache entry.
  1391. *
  1392. * Since all of the proc inode numbers are dynamically generated, the inode
  1393. * numbers do not exist until the inode is cache. This means creating the
  1394. * the dcache entry in readdir is necessary to keep the inode numbers
  1395. * reported by readdir in sync with the inode numbers reported
  1396. * by stat.
  1397. */
  1398. int proc_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
  1399. const char *name, int len,
  1400. instantiate_t instantiate, struct task_struct *task, const void *ptr)
  1401. {
  1402. struct dentry *child, *dir = filp->f_path.dentry;
  1403. struct inode *inode;
  1404. struct qstr qname;
  1405. ino_t ino = 0;
  1406. unsigned type = DT_UNKNOWN;
  1407. qname.name = name;
  1408. qname.len = len;
  1409. qname.hash = full_name_hash(name, len);
  1410. child = d_lookup(dir, &qname);
  1411. if (!child) {
  1412. struct dentry *new;
  1413. new = d_alloc(dir, &qname);
  1414. if (new) {
  1415. child = instantiate(dir->d_inode, new, task, ptr);
  1416. if (child)
  1417. dput(new);
  1418. else
  1419. child = new;
  1420. }
  1421. }
  1422. if (!child || IS_ERR(child) || !child->d_inode)
  1423. goto end_instantiate;
  1424. inode = child->d_inode;
  1425. if (inode) {
  1426. ino = inode->i_ino;
  1427. type = inode->i_mode >> 12;
  1428. }
  1429. dput(child);
  1430. end_instantiate:
  1431. if (!ino)
  1432. ino = find_inode_number(dir, &qname);
  1433. if (!ino)
  1434. ino = 1;
  1435. return filldir(dirent, name, len, filp->f_pos, ino, type);
  1436. }
  1437. #ifdef CONFIG_CHECKPOINT_RESTORE
  1438. /*
  1439. * dname_to_vma_addr - maps a dentry name into two unsigned longs
  1440. * which represent vma start and end addresses.
  1441. */
  1442. static int dname_to_vma_addr(struct dentry *dentry,
  1443. unsigned long *start, unsigned long *end)
  1444. {
  1445. if (sscanf(dentry->d_name.name, "%lx-%lx", start, end) != 2)
  1446. return -EINVAL;
  1447. return 0;
  1448. }
  1449. static int map_files_d_revalidate(struct dentry *dentry, unsigned int flags)
  1450. {
  1451. unsigned long vm_start, vm_end;
  1452. bool exact_vma_exists = false;
  1453. struct mm_struct *mm = NULL;
  1454. struct task_struct *task;
  1455. const struct cred *cred;
  1456. struct inode *inode;
  1457. int status = 0;
  1458. if (flags & LOOKUP_RCU)
  1459. return -ECHILD;
  1460. if (!capable(CAP_SYS_ADMIN)) {
  1461. status = -EACCES;
  1462. goto out_notask;
  1463. }
  1464. inode = dentry->d_inode;
  1465. task = get_proc_task(inode);
  1466. if (!task)
  1467. goto out_notask;
  1468. mm = mm_access(task, PTRACE_MODE_READ);
  1469. if (IS_ERR_OR_NULL(mm))
  1470. goto out;
  1471. if (!dname_to_vma_addr(dentry, &vm_start, &vm_end)) {
  1472. down_read(&mm->mmap_sem);
  1473. exact_vma_exists = !!find_exact_vma(mm, vm_start, vm_end);
  1474. up_read(&mm->mmap_sem);
  1475. }
  1476. mmput(mm);
  1477. if (exact_vma_exists) {
  1478. if (task_dumpable(task)) {
  1479. rcu_read_lock();
  1480. cred = __task_cred(task);
  1481. inode->i_uid = cred->euid;
  1482. inode->i_gid = cred->egid;
  1483. rcu_read_unlock();
  1484. } else {
  1485. inode->i_uid = GLOBAL_ROOT_UID;
  1486. inode->i_gid = GLOBAL_ROOT_GID;
  1487. }
  1488. security_task_to_inode(task, inode);
  1489. status = 1;
  1490. }
  1491. out:
  1492. put_task_struct(task);
  1493. out_notask:
  1494. if (status <= 0)
  1495. d_drop(dentry);
  1496. return status;
  1497. }
  1498. static const struct dentry_operations tid_map_files_dentry_operations = {
  1499. .d_revalidate = map_files_d_revalidate,
  1500. .d_delete = pid_delete_dentry,
  1501. };
  1502. static int proc_map_files_get_link(struct dentry *dentry, struct path *path)
  1503. {
  1504. unsigned long vm_start, vm_end;
  1505. struct vm_area_struct *vma;
  1506. struct task_struct *task;
  1507. struct mm_struct *mm;
  1508. int rc;
  1509. rc = -ENOENT;
  1510. task = get_proc_task(dentry->d_inode);
  1511. if (!task)
  1512. goto out;
  1513. mm = get_task_mm(task);
  1514. put_task_struct(task);
  1515. if (!mm)
  1516. goto out;
  1517. rc = dname_to_vma_addr(dentry, &vm_start, &vm_end);
  1518. if (rc)
  1519. goto out_mmput;
  1520. down_read(&mm->mmap_sem);
  1521. vma = find_exact_vma(mm, vm_start, vm_end);
  1522. if (vma && vma->vm_file) {
  1523. *path = vma->vm_file->f_path;
  1524. path_get(path);
  1525. rc = 0;
  1526. }
  1527. up_read(&mm->mmap_sem);
  1528. out_mmput:
  1529. mmput(mm);
  1530. out:
  1531. return rc;
  1532. }
  1533. struct map_files_info {
  1534. fmode_t mode;
  1535. unsigned long len;
  1536. unsigned char name[4*sizeof(long)+2]; /* max: %lx-%lx\0 */
  1537. };
  1538. static struct dentry *
  1539. proc_map_files_instantiate(struct inode *dir, struct dentry *dentry,
  1540. struct task_struct *task, const void *ptr)
  1541. {
  1542. fmode_t mode = (fmode_t)(unsigned long)ptr;
  1543. struct proc_inode *ei;
  1544. struct inode *inode;
  1545. inode = proc_pid_make_inode(dir->i_sb, task);
  1546. if (!inode)
  1547. return ERR_PTR(-ENOENT);
  1548. ei = PROC_I(inode);
  1549. ei->op.proc_get_link = proc_map_files_get_link;
  1550. inode->i_op = &proc_pid_link_inode_operations;
  1551. inode->i_size = 64;
  1552. inode->i_mode = S_IFLNK;
  1553. if (mode & FMODE_READ)
  1554. inode->i_mode |= S_IRUSR;
  1555. if (mode & FMODE_WRITE)
  1556. inode->i_mode |= S_IWUSR;
  1557. d_set_d_op(dentry, &tid_map_files_dentry_operations);
  1558. d_add(dentry, inode);
  1559. return NULL;
  1560. }
  1561. static struct dentry *proc_map_files_lookup(struct inode *dir,
  1562. struct dentry *dentry, unsigned int flags)
  1563. {
  1564. unsigned long vm_start, vm_end;
  1565. struct vm_area_struct *vma;
  1566. struct task_struct *task;
  1567. struct dentry *result;
  1568. struct mm_struct *mm;
  1569. result = ERR_PTR(-EACCES);
  1570. if (!capable(CAP_SYS_ADMIN))
  1571. goto out;
  1572. result = ERR_PTR(-ENOENT);
  1573. task = get_proc_task(dir);
  1574. if (!task)
  1575. goto out;
  1576. result = ERR_PTR(-EACCES);
  1577. if (!ptrace_may_access(task, PTRACE_MODE_READ))
  1578. goto out_put_task;
  1579. result = ERR_PTR(-ENOENT);
  1580. if (dname_to_vma_addr(dentry, &vm_start, &vm_end))
  1581. goto out_put_task;
  1582. mm = get_task_mm(task);
  1583. if (!mm)
  1584. goto out_put_task;
  1585. down_read(&mm->mmap_sem);
  1586. vma = find_exact_vma(mm, vm_start, vm_end);
  1587. if (!vma)
  1588. goto out_no_vma;
  1589. if (vma->vm_file)
  1590. result = proc_map_files_instantiate(dir, dentry, task,
  1591. (void *)(unsigned long)vma->vm_file->f_mode);
  1592. out_no_vma:
  1593. up_read(&mm->mmap_sem);
  1594. mmput(mm);
  1595. out_put_task:
  1596. put_task_struct(task);
  1597. out:
  1598. return result;
  1599. }
  1600. static const struct inode_operations proc_map_files_inode_operations = {
  1601. .lookup = proc_map_files_lookup,
  1602. .permission = proc_fd_permission,
  1603. .setattr = proc_setattr,
  1604. };
  1605. static int
  1606. proc_map_files_readdir(struct file *filp, void *dirent, filldir_t filldir)
  1607. {
  1608. struct dentry *dentry = filp->f_path.dentry;
  1609. struct inode *inode = dentry->d_inode;
  1610. struct vm_area_struct *vma;
  1611. struct task_struct *task;
  1612. struct mm_struct *mm;
  1613. ino_t ino;
  1614. int ret;
  1615. ret = -EACCES;
  1616. if (!capable(CAP_SYS_ADMIN))
  1617. goto out;
  1618. ret = -ENOENT;
  1619. task = get_proc_task(inode);
  1620. if (!task)
  1621. goto out;
  1622. ret = -EACCES;
  1623. if (!ptrace_may_access(task, PTRACE_MODE_READ))
  1624. goto out_put_task;
  1625. ret = 0;
  1626. switch (filp->f_pos) {
  1627. case 0:
  1628. ino = inode->i_ino;
  1629. if (filldir(dirent, ".", 1, 0, ino, DT_DIR) < 0)
  1630. goto out_put_task;
  1631. filp->f_pos++;
  1632. case 1:
  1633. ino = parent_ino(dentry);
  1634. if (filldir(dirent, "..", 2, 1, ino, DT_DIR) < 0)
  1635. goto out_put_task;
  1636. filp->f_pos++;
  1637. default:
  1638. {
  1639. unsigned long nr_files, pos, i;
  1640. struct flex_array *fa = NULL;
  1641. struct map_files_info info;
  1642. struct map_files_info *p;
  1643. mm = get_task_mm(task);
  1644. if (!mm)
  1645. goto out_put_task;
  1646. down_read(&mm->mmap_sem);
  1647. nr_files = 0;
  1648. /*
  1649. * We need two passes here:
  1650. *
  1651. * 1) Collect vmas of mapped files with mmap_sem taken
  1652. * 2) Release mmap_sem and instantiate entries
  1653. *
  1654. * otherwise we get lockdep complained, since filldir()
  1655. * routine might require mmap_sem taken in might_fault().
  1656. */
  1657. for (vma = mm->mmap, pos = 2; vma; vma = vma->vm_next) {
  1658. if (vma->vm_file && ++pos > filp->f_pos)
  1659. nr_files++;
  1660. }
  1661. if (nr_files) {
  1662. fa = flex_array_alloc(sizeof(info), nr_files,
  1663. GFP_KERNEL);
  1664. if (!fa || flex_array_prealloc(fa, 0, nr_files,
  1665. GFP_KERNEL)) {
  1666. ret = -ENOMEM;
  1667. if (fa)
  1668. flex_array_free(fa);
  1669. up_read(&mm->mmap_sem);
  1670. mmput(mm);
  1671. goto out_put_task;
  1672. }
  1673. for (i = 0, vma = mm->mmap, pos = 2; vma;
  1674. vma = vma->vm_next) {
  1675. if (!vma->vm_file)
  1676. continue;
  1677. if (++pos <= filp->f_pos)
  1678. continue;
  1679. info.mode = vma->vm_file->f_mode;
  1680. info.len = snprintf(info.name,
  1681. sizeof(info.name), "%lx-%lx",
  1682. vma->vm_start, vma->vm_end);
  1683. if (flex_array_put(fa, i++, &info, GFP_KERNEL))
  1684. BUG();
  1685. }
  1686. }
  1687. up_read(&mm->mmap_sem);
  1688. for (i = 0; i < nr_files; i++) {
  1689. p = flex_array_get(fa, i);
  1690. ret = proc_fill_cache(filp, dirent, filldir,
  1691. p->name, p->len,
  1692. proc_map_files_instantiate,
  1693. task,
  1694. (void *)(unsigned long)p->mode);
  1695. if (ret)
  1696. break;
  1697. filp->f_pos++;
  1698. }
  1699. if (fa)
  1700. flex_array_free(fa);
  1701. mmput(mm);
  1702. }
  1703. }
  1704. out_put_task:
  1705. put_task_struct(task);
  1706. out:
  1707. return ret;
  1708. }
  1709. static const struct file_operations proc_map_files_operations = {
  1710. .read = generic_read_dir,
  1711. .readdir = proc_map_files_readdir,
  1712. .llseek = default_llseek,
  1713. };
  1714. #endif /* CONFIG_CHECKPOINT_RESTORE */
  1715. static struct dentry *proc_pident_instantiate(struct inode *dir,
  1716. struct dentry *dentry, struct task_struct *task, const void *ptr)
  1717. {
  1718. const struct pid_entry *p = ptr;
  1719. struct inode *inode;
  1720. struct proc_inode *ei;
  1721. struct dentry *error = ERR_PTR(-ENOENT);
  1722. inode = proc_pid_make_inode(dir->i_sb, task);
  1723. if (!inode)
  1724. goto out;
  1725. ei = PROC_I(inode);
  1726. inode->i_mode = p->mode;
  1727. if (S_ISDIR(inode->i_mode))
  1728. set_nlink(inode, 2); /* Use getattr to fix if necessary */
  1729. if (p->iop)
  1730. inode->i_op = p->iop;
  1731. if (p->fop)
  1732. inode->i_fop = p->fop;
  1733. ei->op = p->op;
  1734. d_set_d_op(dentry, &pid_dentry_operations);
  1735. d_add(dentry, inode);
  1736. /* Close the race of the process dying before we return the dentry */
  1737. if (pid_revalidate(dentry, 0))
  1738. error = NULL;
  1739. out:
  1740. return error;
  1741. }
  1742. static struct dentry *proc_pident_lookup(struct inode *dir,
  1743. struct dentry *dentry,
  1744. const struct pid_entry *ents,
  1745. unsigned int nents)
  1746. {
  1747. struct dentry *error;
  1748. struct task_struct *task = get_proc_task(dir);
  1749. const struct pid_entry *p, *last;
  1750. error = ERR_PTR(-ENOENT);
  1751. if (!task)
  1752. goto out_no_task;
  1753. /*
  1754. * Yes, it does not scale. And it should not. Don't add
  1755. * new entries into /proc/<tgid>/ without very good reasons.
  1756. */
  1757. last = &ents[nents - 1];
  1758. for (p = ents; p <= last; p++) {
  1759. if (p->len != dentry->d_name.len)
  1760. continue;
  1761. if (!memcmp(dentry->d_name.name, p->name, p->len))
  1762. break;
  1763. }
  1764. if (p > last)
  1765. goto out;
  1766. error = proc_pident_instantiate(dir, dentry, task, p);
  1767. out:
  1768. put_task_struct(task);
  1769. out_no_task:
  1770. return error;
  1771. }
  1772. static int proc_pident_fill_cache(struct file *filp, void *dirent,
  1773. filldir_t filldir, struct task_struct *task, const struct pid_entry *p)
  1774. {
  1775. return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
  1776. proc_pident_instantiate, task, p);
  1777. }
  1778. static int proc_pident_readdir(struct file *filp,
  1779. void *dirent, filldir_t filldir,
  1780. const struct pid_entry *ents, unsigned int nents)
  1781. {
  1782. int i;
  1783. struct dentry *dentry = filp->f_path.dentry;
  1784. struct inode *inode = dentry->d_inode;
  1785. struct task_struct *task = get_proc_task(inode);
  1786. const struct pid_entry *p, *last;
  1787. ino_t ino;
  1788. int ret;
  1789. ret = -ENOENT;
  1790. if (!task)
  1791. goto out_no_task;
  1792. ret = 0;
  1793. i = filp->f_pos;
  1794. switch (i) {
  1795. case 0:
  1796. ino = inode->i_ino;
  1797. if (filldir(dirent, ".", 1, i, ino, DT_DIR) < 0)
  1798. goto out;
  1799. i++;
  1800. filp->f_pos++;
  1801. /* fall through */
  1802. case 1:
  1803. ino = parent_ino(dentry);
  1804. if (filldir(dirent, "..", 2, i, ino, DT_DIR) < 0)
  1805. goto out;
  1806. i++;
  1807. filp->f_pos++;
  1808. /* fall through */
  1809. default:
  1810. i -= 2;
  1811. if (i >= nents) {
  1812. ret = 1;
  1813. goto out;
  1814. }
  1815. p = ents + i;
  1816. last = &ents[nents - 1];
  1817. while (p <= last) {
  1818. if (proc_pident_fill_cache(filp, dirent, filldir, task, p) < 0)
  1819. goto out;
  1820. filp->f_pos++;
  1821. p++;
  1822. }
  1823. }
  1824. ret = 1;
  1825. out:
  1826. put_task_struct(task);
  1827. out_no_task:
  1828. return ret;
  1829. }
  1830. #ifdef CONFIG_SECURITY
  1831. static ssize_t proc_pid_attr_read(struct file * file, char __user * buf,
  1832. size_t count, loff_t *ppos)
  1833. {
  1834. struct inode * inode = file->f_path.dentry->d_inode;
  1835. char *p = NULL;
  1836. ssize_t length;
  1837. struct task_struct *task = get_proc_task(inode);
  1838. if (!task)
  1839. return -ESRCH;
  1840. length = security_getprocattr(task,
  1841. (char*)file->f_path.dentry->d_name.name,
  1842. &p);
  1843. put_task_struct(task);
  1844. if (length > 0)
  1845. length = simple_read_from_buffer(buf, count, ppos, p, length);
  1846. kfree(p);
  1847. return length;
  1848. }
  1849. static ssize_t proc_pid_attr_write(struct file * file, const char __user * buf,
  1850. size_t count, loff_t *ppos)
  1851. {
  1852. struct inode * inode = file->f_path.dentry->d_inode;
  1853. char *page;
  1854. ssize_t length;
  1855. struct task_struct *task = get_proc_task(inode);
  1856. length = -ESRCH;
  1857. if (!task)
  1858. goto out_no_task;
  1859. if (count > PAGE_SIZE)
  1860. count = PAGE_SIZE;
  1861. /* No partial writes. */
  1862. length = -EINVAL;
  1863. if (*ppos != 0)
  1864. goto out;
  1865. length = -ENOMEM;
  1866. page = (char*)__get_free_page(GFP_TEMPORARY);
  1867. if (!page)
  1868. goto out;
  1869. length = -EFAULT;
  1870. if (copy_from_user(page, buf, count))
  1871. goto out_free;
  1872. /* Guard against adverse ptrace interaction */
  1873. length = mutex_lock_interruptible(&task->signal->cred_guard_mutex);
  1874. if (length < 0)
  1875. goto out_free;
  1876. length = security_setprocattr(task,
  1877. (char*)file->f_path.dentry->d_name.name,
  1878. (void*)page, count);
  1879. mutex_unlock(&task->signal->cred_guard_mutex);
  1880. out_free:
  1881. free_page((unsigned long) page);
  1882. out:
  1883. put_task_struct(task);
  1884. out_no_task:
  1885. return length;
  1886. }
  1887. static const struct file_operations proc_pid_attr_operations = {
  1888. .read = proc_pid_attr_read,
  1889. .write = proc_pid_attr_write,
  1890. .llseek = generic_file_llseek,
  1891. };
  1892. static const struct pid_entry attr_dir_stuff[] = {
  1893. REG("current", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1894. REG("prev", S_IRUGO, proc_pid_attr_operations),
  1895. REG("exec", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1896. REG("fscreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1897. REG("keycreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1898. REG("sockcreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1899. };
  1900. static int proc_attr_dir_readdir(struct file * filp,
  1901. void * dirent, filldir_t filldir)
  1902. {
  1903. return proc_pident_readdir(filp,dirent,filldir,
  1904. attr_dir_stuff,ARRAY_SIZE(attr_dir_stuff));
  1905. }
  1906. static const struct file_operations proc_attr_dir_operations = {
  1907. .read = generic_read_dir,
  1908. .readdir = proc_attr_dir_readdir,
  1909. .llseek = default_llseek,
  1910. };
  1911. static struct dentry *proc_attr_dir_lookup(struct inode *dir,
  1912. struct dentry *dentry, unsigned int flags)
  1913. {
  1914. return proc_pident_lookup(dir, dentry,
  1915. attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff));
  1916. }
  1917. static const struct inode_operations proc_attr_dir_inode_operations = {
  1918. .lookup = proc_attr_dir_lookup,
  1919. .getattr = pid_getattr,
  1920. .setattr = proc_setattr,
  1921. };
  1922. #endif
  1923. #ifdef CONFIG_ELF_CORE
  1924. static ssize_t proc_coredump_filter_read(struct file *file, char __user *buf,
  1925. size_t count, loff_t *ppos)
  1926. {
  1927. struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
  1928. struct mm_struct *mm;
  1929. char buffer[PROC_NUMBUF];
  1930. size_t len;
  1931. int ret;
  1932. if (!task)
  1933. return -ESRCH;
  1934. ret = 0;
  1935. mm = get_task_mm(task);
  1936. if (mm) {
  1937. len = snprintf(buffer, sizeof(buffer), "%08lx\n",
  1938. ((mm->flags & MMF_DUMP_FILTER_MASK) >>
  1939. MMF_DUMP_FILTER_SHIFT));
  1940. mmput(mm);
  1941. ret = simple_read_from_buffer(buf, count, ppos, buffer, len);
  1942. }
  1943. put_task_struct(task);
  1944. return ret;
  1945. }
  1946. static ssize_t proc_coredump_filter_write(struct file *file,
  1947. const char __user *buf,
  1948. size_t count,
  1949. loff_t *ppos)
  1950. {
  1951. struct task_struct *task;
  1952. struct mm_struct *mm;
  1953. char buffer[PROC_NUMBUF], *end;
  1954. unsigned int val;
  1955. int ret;
  1956. int i;
  1957. unsigned long mask;
  1958. ret = -EFAULT;
  1959. memset(buffer, 0, sizeof(buffer));
  1960. if (count > sizeof(buffer) - 1)
  1961. count = sizeof(buffer) - 1;
  1962. if (copy_from_user(buffer, buf, count))
  1963. goto out_no_task;
  1964. ret = -EINVAL;
  1965. val = (unsigned int)simple_strtoul(buffer, &end, 0);
  1966. if (*end == '\n')
  1967. end++;
  1968. if (end - buffer == 0)
  1969. goto out_no_task;
  1970. ret = -ESRCH;
  1971. task = get_proc_task(file->f_dentry->d_inode);
  1972. if (!task)
  1973. goto out_no_task;
  1974. ret = end - buffer;
  1975. mm = get_task_mm(task);
  1976. if (!mm)
  1977. goto out_no_mm;
  1978. for (i = 0, mask = 1; i < MMF_DUMP_FILTER_BITS; i++, mask <<= 1) {
  1979. if (val & mask)
  1980. set_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);
  1981. else
  1982. clear_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);
  1983. }
  1984. mmput(mm);
  1985. out_no_mm:
  1986. put_task_struct(task);
  1987. out_no_task:
  1988. return ret;
  1989. }
  1990. static const struct file_operations proc_coredump_filter_operations = {
  1991. .read = proc_coredump_filter_read,
  1992. .write = proc_coredump_filter_write,
  1993. .llseek = generic_file_llseek,
  1994. };
  1995. #endif
  1996. /*
  1997. * /proc/self:
  1998. */
  1999. static int proc_self_readlink(struct dentry *dentry, char __user *buffer,
  2000. int buflen)
  2001. {
  2002. struct pid_namespace *ns = dentry->d_sb->s_fs_info;
  2003. pid_t tgid = task_tgid_nr_ns(current, ns);
  2004. char tmp[PROC_NUMBUF];
  2005. if (!tgid)
  2006. return -ENOENT;
  2007. sprintf(tmp, "%d", tgid);
  2008. return vfs_readlink(dentry,buffer,buflen,tmp);
  2009. }
  2010. static void *proc_self_follow_link(struct dentry *dentry, struct nameidata *nd)
  2011. {
  2012. struct pid_namespace *ns = dentry->d_sb->s_fs_info;
  2013. pid_t tgid = task_tgid_nr_ns(current, ns);
  2014. char *name = ERR_PTR(-ENOENT);
  2015. if (tgid) {
  2016. /* 11 for max length of signed int in decimal + NULL term */
  2017. name = kmalloc(12, GFP_KERNEL);
  2018. if (!name)
  2019. name = ERR_PTR(-ENOMEM);
  2020. else
  2021. sprintf(name, "%d", tgid);
  2022. }
  2023. nd_set_link(nd, name);
  2024. return NULL;
  2025. }
  2026. static void proc_self_put_link(struct dentry *dentry, struct nameidata *nd,
  2027. void *cookie)
  2028. {
  2029. char *s = nd_get_link(nd);
  2030. if (!IS_ERR(s))
  2031. kfree(s);
  2032. }
  2033. static const struct inode_operations proc_self_inode_operations = {
  2034. .readlink = proc_self_readlink,
  2035. .follow_link = proc_self_follow_link,
  2036. .put_link = proc_self_put_link,
  2037. };
  2038. /*
  2039. * proc base
  2040. *
  2041. * These are the directory entries in the root directory of /proc
  2042. * that properly belong to the /proc filesystem, as they describe
  2043. * describe something that is process related.
  2044. */
  2045. static const struct pid_entry proc_base_stuff[] = {
  2046. NOD("self", S_IFLNK|S_IRWXUGO,
  2047. &proc_self_inode_operations, NULL, {}),
  2048. };
  2049. static struct dentry *proc_base_instantiate(struct inode *dir,
  2050. struct dentry *dentry, struct task_struct *task, const void *ptr)
  2051. {
  2052. const struct pid_entry *p = ptr;
  2053. struct inode *inode;
  2054. struct proc_inode *ei;
  2055. struct dentry *error;
  2056. /* Allocate the inode */
  2057. error = ERR_PTR(-ENOMEM);
  2058. inode = new_inode(dir->i_sb);
  2059. if (!inode)
  2060. goto out;
  2061. /* Initialize the inode */
  2062. ei = PROC_I(inode);
  2063. inode->i_ino = get_next_ino();
  2064. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  2065. /*
  2066. * grab the reference to the task.
  2067. */
  2068. ei->pid = get_task_pid(task, PIDTYPE_PID);
  2069. if (!ei->pid)
  2070. goto out_iput;
  2071. inode->i_mode = p->mode;
  2072. if (S_ISDIR(inode->i_mode))
  2073. set_nlink(inode, 2);
  2074. if (S_ISLNK(inode->i_mode))
  2075. inode->i_size = 64;
  2076. if (p->iop)
  2077. inode->i_op = p->iop;
  2078. if (p->fop)
  2079. inode->i_fop = p->fop;
  2080. ei->op = p->op;
  2081. d_add(dentry, inode);
  2082. error = NULL;
  2083. out:
  2084. return error;
  2085. out_iput:
  2086. iput(inode);
  2087. goto out;
  2088. }
  2089. static struct dentry *proc_base_lookup(struct inode *dir, struct dentry *dentry)
  2090. {
  2091. struct dentry *error;
  2092. struct task_struct *task = get_proc_task(dir);
  2093. const struct pid_entry *p, *last;
  2094. error = ERR_PTR(-ENOENT);
  2095. if (!task)
  2096. goto out_no_task;
  2097. /* Lookup the directory entry */
  2098. last = &proc_base_stuff[ARRAY_SIZE(proc_base_stuff) - 1];
  2099. for (p = proc_base_stuff; p <= last; p++) {
  2100. if (p->len != dentry->d_name.len)
  2101. continue;
  2102. if (!memcmp(dentry->d_name.name, p->name, p->len))
  2103. break;
  2104. }
  2105. if (p > last)
  2106. goto out;
  2107. error = proc_base_instantiate(dir, dentry, task, p);
  2108. out:
  2109. put_task_struct(task);
  2110. out_no_task:
  2111. return error;
  2112. }
  2113. static int proc_base_fill_cache(struct file *filp, void *dirent,
  2114. filldir_t filldir, struct task_struct *task, const struct pid_entry *p)
  2115. {
  2116. return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
  2117. proc_base_instantiate, task, p);
  2118. }
  2119. #ifdef CONFIG_TASK_IO_ACCOUNTING
  2120. static int do_io_accounting(struct task_struct *task, char *buffer, int whole)
  2121. {
  2122. struct task_io_accounting acct = task->ioac;
  2123. unsigned long flags;
  2124. int result;
  2125. result = mutex_lock_killable(&task->signal->cred_guard_mutex);
  2126. if (result)
  2127. return result;
  2128. if (!ptrace_may_access(task, PTRACE_MODE_READ)) {
  2129. result = -EACCES;
  2130. goto out_unlock;
  2131. }
  2132. if (whole && lock_task_sighand(task, &flags)) {
  2133. struct task_struct *t = task;
  2134. task_io_accounting_add(&acct, &task->signal->ioac);
  2135. while_each_thread(task, t)
  2136. task_io_accounting_add(&acct, &t->ioac);
  2137. unlock_task_sighand(task, &flags);
  2138. }
  2139. result = sprintf(buffer,
  2140. "rchar: %llu\n"
  2141. "wchar: %llu\n"
  2142. "syscr: %llu\n"
  2143. "syscw: %llu\n"
  2144. "read_bytes: %llu\n"
  2145. "write_bytes: %llu\n"
  2146. "cancelled_write_bytes: %llu\n",
  2147. (unsigned long long)acct.rchar,
  2148. (unsigned long long)acct.wchar,
  2149. (unsigned long long)acct.syscr,
  2150. (unsigned long long)acct.syscw,
  2151. (unsigned long long)acct.read_bytes,
  2152. (unsigned long long)acct.write_bytes,
  2153. (unsigned long long)acct.cancelled_write_bytes);
  2154. out_unlock:
  2155. mutex_unlock(&task->signal->cred_guard_mutex);
  2156. return result;
  2157. }
  2158. static int proc_tid_io_accounting(struct task_struct *task, char *buffer)
  2159. {
  2160. return do_io_accounting(task, buffer, 0);
  2161. }
  2162. static int proc_tgid_io_accounting(struct task_struct *task, char *buffer)
  2163. {
  2164. return do_io_accounting(task, buffer, 1);
  2165. }
  2166. #endif /* CONFIG_TASK_IO_ACCOUNTING */
  2167. #ifdef CONFIG_USER_NS
  2168. static int proc_id_map_open(struct inode *inode, struct file *file,
  2169. struct seq_operations *seq_ops)
  2170. {
  2171. struct user_namespace *ns = NULL;
  2172. struct task_struct *task;
  2173. struct seq_file *seq;
  2174. int ret = -EINVAL;
  2175. task = get_proc_task(inode);
  2176. if (task) {
  2177. rcu_read_lock();
  2178. ns = get_user_ns(task_cred_xxx(task, user_ns));
  2179. rcu_read_unlock();
  2180. put_task_struct(task);
  2181. }
  2182. if (!ns)
  2183. goto err;
  2184. ret = seq_open(file, seq_ops);
  2185. if (ret)
  2186. goto err_put_ns;
  2187. seq = file->private_data;
  2188. seq->private = ns;
  2189. return 0;
  2190. err_put_ns:
  2191. put_user_ns(ns);
  2192. err:
  2193. return ret;
  2194. }
  2195. static int proc_id_map_release(struct inode *inode, struct file *file)
  2196. {
  2197. struct seq_file *seq = file->private_data;
  2198. struct user_namespace *ns = seq->private;
  2199. put_user_ns(ns);
  2200. return seq_release(inode, file);
  2201. }
  2202. static int proc_uid_map_open(struct inode *inode, struct file *file)
  2203. {
  2204. return proc_id_map_open(inode, file, &proc_uid_seq_operations);
  2205. }
  2206. static int proc_gid_map_open(struct inode *inode, struct file *file)
  2207. {
  2208. return proc_id_map_open(inode, file, &proc_gid_seq_operations);
  2209. }
  2210. static int proc_projid_map_open(struct inode *inode, struct file *file)
  2211. {
  2212. return proc_id_map_open(inode, file, &proc_projid_seq_operations);
  2213. }
  2214. static const struct file_operations proc_uid_map_operations = {
  2215. .open = proc_uid_map_open,
  2216. .write = proc_uid_map_write,
  2217. .read = seq_read,
  2218. .llseek = seq_lseek,
  2219. .release = proc_id_map_release,
  2220. };
  2221. static const struct file_operations proc_gid_map_operations = {
  2222. .open = proc_gid_map_open,
  2223. .write = proc_gid_map_write,
  2224. .read = seq_read,
  2225. .llseek = seq_lseek,
  2226. .release = proc_id_map_release,
  2227. };
  2228. static const struct file_operations proc_projid_map_operations = {
  2229. .open = proc_projid_map_open,
  2230. .write = proc_projid_map_write,
  2231. .read = seq_read,
  2232. .llseek = seq_lseek,
  2233. .release = proc_id_map_release,
  2234. };
  2235. #endif /* CONFIG_USER_NS */
  2236. static int proc_pid_personality(struct seq_file *m, struct pid_namespace *ns,
  2237. struct pid *pid, struct task_struct *task)
  2238. {
  2239. int err = lock_trace(task);
  2240. if (!err) {
  2241. seq_printf(m, "%08x\n", task->personality);
  2242. unlock_trace(task);
  2243. }
  2244. return err;
  2245. }
  2246. /*
  2247. * Thread groups
  2248. */
  2249. static const struct file_operations proc_task_operations;
  2250. static const struct inode_operations proc_task_inode_operations;
  2251. static const struct pid_entry tgid_base_stuff[] = {
  2252. DIR("task", S_IRUGO|S_IXUGO, proc_task_inode_operations, proc_task_operations),
  2253. DIR("fd", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),
  2254. #ifdef CONFIG_CHECKPOINT_RESTORE
  2255. DIR("map_files", S_IRUSR|S_IXUSR, proc_map_files_inode_operations, proc_map_files_operations),
  2256. #endif
  2257. DIR("fdinfo", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),
  2258. DIR("ns", S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),
  2259. #ifdef CONFIG_NET
  2260. DIR("net", S_IRUGO|S_IXUGO, proc_net_inode_operations, proc_net_operations),
  2261. #endif
  2262. REG("environ", S_IRUSR, proc_environ_operations),
  2263. INF("auxv", S_IRUSR, proc_pid_auxv),
  2264. ONE("status", S_IRUGO, proc_pid_status),
  2265. ONE("personality", S_IRUGO, proc_pid_personality),
  2266. INF("limits", S_IRUGO, proc_pid_limits),
  2267. #ifdef CONFIG_SCHED_DEBUG
  2268. REG("sched", S_IRUGO|S_IWUSR, proc_pid_sched_operations),
  2269. #endif
  2270. #ifdef CONFIG_SCHED_AUTOGROUP
  2271. REG("autogroup", S_IRUGO|S_IWUSR, proc_pid_sched_autogroup_operations),
  2272. #endif
  2273. REG("comm", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),
  2274. #ifdef CONFIG_HAVE_ARCH_TRACEHOOK
  2275. INF("syscall", S_IRUGO, proc_pid_syscall),
  2276. #endif
  2277. INF("cmdline", S_IRUGO, proc_pid_cmdline),
  2278. ONE("stat", S_IRUGO, proc_tgid_stat),
  2279. ONE("statm", S_IRUGO, proc_pid_statm),
  2280. REG("maps", S_IRUGO, proc_pid_maps_operations),
  2281. #ifdef CONFIG_NUMA
  2282. REG("numa_maps", S_IRUGO, proc_pid_numa_maps_operations),
  2283. #endif
  2284. REG("mem", S_IRUSR|S_IWUSR, proc_mem_operations),
  2285. LNK("cwd", proc_cwd_link),
  2286. LNK("root", proc_root_link),
  2287. LNK("exe", proc_exe_link),
  2288. REG("mounts", S_IRUGO, proc_mounts_operations),
  2289. REG("mountinfo", S_IRUGO, proc_mountinfo_operations),
  2290. REG("mountstats", S_IRUSR, proc_mountstats_operations),
  2291. #ifdef CONFIG_PROC_PAGE_MONITOR
  2292. REG("clear_refs", S_IWUSR, proc_clear_refs_operations),
  2293. REG("smaps", S_IRUGO, proc_pid_smaps_operations),
  2294. REG("pagemap", S_IRUGO, proc_pagemap_operations),
  2295. #endif
  2296. #ifdef CONFIG_SECURITY
  2297. DIR("attr", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),
  2298. #endif
  2299. #ifdef CONFIG_KALLSYMS
  2300. INF("wchan", S_IRUGO, proc_pid_wchan),
  2301. #endif
  2302. #ifdef CONFIG_STACKTRACE
  2303. ONE("stack", S_IRUGO, proc_pid_stack),
  2304. #endif
  2305. #ifdef CONFIG_SCHEDSTATS
  2306. INF("schedstat", S_IRUGO, proc_pid_schedstat),
  2307. #endif
  2308. #ifdef CONFIG_LATENCYTOP
  2309. REG("latency", S_IRUGO, proc_lstats_operations),
  2310. #endif
  2311. #ifdef CONFIG_PROC_PID_CPUSET
  2312. REG("cpuset", S_IRUGO, proc_cpuset_operations),
  2313. #endif
  2314. #ifdef CONFIG_CGROUPS
  2315. REG("cgroup", S_IRUGO, proc_cgroup_operations),
  2316. #endif
  2317. INF("oom_score", S_IRUGO, proc_oom_score),
  2318. REG("oom_adj", S_IRUGO|S_IWUSR, proc_oom_adj_operations),
  2319. REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),
  2320. #ifdef CONFIG_AUDITSYSCALL
  2321. REG("loginuid", S_IWUSR|S_IRUGO, proc_loginuid_operations),
  2322. REG("sessionid", S_IRUGO, proc_sessionid_operations),
  2323. #endif
  2324. #ifdef CONFIG_FAULT_INJECTION
  2325. REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations),
  2326. #endif
  2327. #ifdef CONFIG_ELF_CORE
  2328. REG("coredump_filter", S_IRUGO|S_IWUSR, proc_coredump_filter_operations),
  2329. #endif
  2330. #ifdef CONFIG_TASK_IO_ACCOUNTING
  2331. INF("io", S_IRUSR, proc_tgid_io_accounting),
  2332. #endif
  2333. #ifdef CONFIG_HARDWALL
  2334. INF("hardwall", S_IRUGO, proc_pid_hardwall),
  2335. #endif
  2336. #ifdef CONFIG_USER_NS
  2337. REG("uid_map", S_IRUGO|S_IWUSR, proc_uid_map_operations),
  2338. REG("gid_map", S_IRUGO|S_IWUSR, proc_gid_map_operations),
  2339. REG("projid_map", S_IRUGO|S_IWUSR, proc_projid_map_operations),
  2340. #endif
  2341. };
  2342. static int proc_tgid_base_readdir(struct file * filp,
  2343. void * dirent, filldir_t filldir)
  2344. {
  2345. return proc_pident_readdir(filp,dirent,filldir,
  2346. tgid_base_stuff,ARRAY_SIZE(tgid_base_stuff));
  2347. }
  2348. static const struct file_operations proc_tgid_base_operations = {
  2349. .read = generic_read_dir,
  2350. .readdir = proc_tgid_base_readdir,
  2351. .llseek = default_llseek,
  2352. };
  2353. static struct dentry *proc_tgid_base_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
  2354. {
  2355. return proc_pident_lookup(dir, dentry,
  2356. tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));
  2357. }
  2358. static const struct inode_operations proc_tgid_base_inode_operations = {
  2359. .lookup = proc_tgid_base_lookup,
  2360. .getattr = pid_getattr,
  2361. .setattr = proc_setattr,
  2362. .permission = proc_pid_permission,
  2363. };
  2364. static void proc_flush_task_mnt(struct vfsmount *mnt, pid_t pid, pid_t tgid)
  2365. {
  2366. struct dentry *dentry, *leader, *dir;
  2367. char buf[PROC_NUMBUF];
  2368. struct qstr name;
  2369. name.name = buf;
  2370. name.len = snprintf(buf, sizeof(buf), "%d", pid);
  2371. dentry = d_hash_and_lookup(mnt->mnt_root, &name);
  2372. if (dentry) {
  2373. shrink_dcache_parent(dentry);
  2374. d_drop(dentry);
  2375. dput(dentry);
  2376. }
  2377. name.name = buf;
  2378. name.len = snprintf(buf, sizeof(buf), "%d", tgid);
  2379. leader = d_hash_and_lookup(mnt->mnt_root, &name);
  2380. if (!leader)
  2381. goto out;
  2382. name.name = "task";
  2383. name.len = strlen(name.name);
  2384. dir = d_hash_and_lookup(leader, &name);
  2385. if (!dir)
  2386. goto out_put_leader;
  2387. name.name = buf;
  2388. name.len = snprintf(buf, sizeof(buf), "%d", pid);
  2389. dentry = d_hash_and_lookup(dir, &name);
  2390. if (dentry) {
  2391. shrink_dcache_parent(dentry);
  2392. d_drop(dentry);
  2393. dput(dentry);
  2394. }
  2395. dput(dir);
  2396. out_put_leader:
  2397. dput(leader);
  2398. out:
  2399. return;
  2400. }
  2401. /**
  2402. * proc_flush_task - Remove dcache entries for @task from the /proc dcache.
  2403. * @task: task that should be flushed.
  2404. *
  2405. * When flushing dentries from proc, one needs to flush them from global
  2406. * proc (proc_mnt) and from all the namespaces' procs this task was seen
  2407. * in. This call is supposed to do all of this job.
  2408. *
  2409. * Looks in the dcache for
  2410. * /proc/@pid
  2411. * /proc/@tgid/task/@pid
  2412. * if either directory is present flushes it and all of it'ts children
  2413. * from the dcache.
  2414. *
  2415. * It is safe and reasonable to cache /proc entries for a task until
  2416. * that task exits. After that they just clog up the dcache with
  2417. * useless entries, possibly causing useful dcache entries to be
  2418. * flushed instead. This routine is proved to flush those useless
  2419. * dcache entries at process exit time.
  2420. *
  2421. * NOTE: This routine is just an optimization so it does not guarantee
  2422. * that no dcache entries will exist at process exit time it
  2423. * just makes it very unlikely that any will persist.
  2424. */
  2425. void proc_flush_task(struct task_struct *task)
  2426. {
  2427. int i;
  2428. struct pid *pid, *tgid;
  2429. struct upid *upid;
  2430. pid = task_pid(task);
  2431. tgid = task_tgid(task);
  2432. for (i = 0; i <= pid->level; i++) {
  2433. upid = &pid->numbers[i];
  2434. proc_flush_task_mnt(upid->ns->proc_mnt, upid->nr,
  2435. tgid->numbers[i].nr);
  2436. }
  2437. upid = &pid->numbers[pid->level];
  2438. if (upid->nr == 1)
  2439. pid_ns_release_proc(upid->ns);
  2440. }
  2441. static struct dentry *proc_pid_instantiate(struct inode *dir,
  2442. struct dentry * dentry,
  2443. struct task_struct *task, const void *ptr)
  2444. {
  2445. struct dentry *error = ERR_PTR(-ENOENT);
  2446. struct inode *inode;
  2447. inode = proc_pid_make_inode(dir->i_sb, task);
  2448. if (!inode)
  2449. goto out;
  2450. inode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;
  2451. inode->i_op = &proc_tgid_base_inode_operations;
  2452. inode->i_fop = &proc_tgid_base_operations;
  2453. inode->i_flags|=S_IMMUTABLE;
  2454. set_nlink(inode, 2 + pid_entry_count_dirs(tgid_base_stuff,
  2455. ARRAY_SIZE(tgid_base_stuff)));
  2456. d_set_d_op(dentry, &pid_dentry_operations);
  2457. d_add(dentry, inode);
  2458. /* Close the race of the process dying before we return the dentry */
  2459. if (pid_revalidate(dentry, 0))
  2460. error = NULL;
  2461. out:
  2462. return error;
  2463. }
  2464. struct dentry *proc_pid_lookup(struct inode *dir, struct dentry * dentry, unsigned int flags)
  2465. {
  2466. struct dentry *result;
  2467. struct task_struct *task;
  2468. unsigned tgid;
  2469. struct pid_namespace *ns;
  2470. result = proc_base_lookup(dir, dentry);
  2471. if (!IS_ERR(result) || PTR_ERR(result) != -ENOENT)
  2472. goto out;
  2473. tgid = name_to_int(dentry);
  2474. if (tgid == ~0U)
  2475. goto out;
  2476. ns = dentry->d_sb->s_fs_info;
  2477. rcu_read_lock();
  2478. task = find_task_by_pid_ns(tgid, ns);
  2479. if (task)
  2480. get_task_struct(task);
  2481. rcu_read_unlock();
  2482. if (!task)
  2483. goto out;
  2484. result = proc_pid_instantiate(dir, dentry, task, NULL);
  2485. put_task_struct(task);
  2486. out:
  2487. return result;
  2488. }
  2489. /*
  2490. * Find the first task with tgid >= tgid
  2491. *
  2492. */
  2493. struct tgid_iter {
  2494. unsigned int tgid;
  2495. struct task_struct *task;
  2496. };
  2497. static struct tgid_iter next_tgid(struct pid_namespace *ns, struct tgid_iter iter)
  2498. {
  2499. struct pid *pid;
  2500. if (iter.task)
  2501. put_task_struct(iter.task);
  2502. rcu_read_lock();
  2503. retry:
  2504. iter.task = NULL;
  2505. pid = find_ge_pid(iter.tgid, ns);
  2506. if (pid) {
  2507. iter.tgid = pid_nr_ns(pid, ns);
  2508. iter.task = pid_task(pid, PIDTYPE_PID);
  2509. /* What we to know is if the pid we have find is the
  2510. * pid of a thread_group_leader. Testing for task
  2511. * being a thread_group_leader is the obvious thing
  2512. * todo but there is a window when it fails, due to
  2513. * the pid transfer logic in de_thread.
  2514. *
  2515. * So we perform the straight forward test of seeing
  2516. * if the pid we have found is the pid of a thread
  2517. * group leader, and don't worry if the task we have
  2518. * found doesn't happen to be a thread group leader.
  2519. * As we don't care in the case of readdir.
  2520. */
  2521. if (!iter.task || !has_group_leader_pid(iter.task)) {
  2522. iter.tgid += 1;
  2523. goto retry;
  2524. }
  2525. get_task_struct(iter.task);
  2526. }
  2527. rcu_read_unlock();
  2528. return iter;
  2529. }
  2530. #define TGID_OFFSET (FIRST_PROCESS_ENTRY + ARRAY_SIZE(proc_base_stuff))
  2531. static int proc_pid_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
  2532. struct tgid_iter iter)
  2533. {
  2534. char name[PROC_NUMBUF];
  2535. int len = snprintf(name, sizeof(name), "%d", iter.tgid);
  2536. return proc_fill_cache(filp, dirent, filldir, name, len,
  2537. proc_pid_instantiate, iter.task, NULL);
  2538. }
  2539. static int fake_filldir(void *buf, const char *name, int namelen,
  2540. loff_t offset, u64 ino, unsigned d_type)
  2541. {
  2542. return 0;
  2543. }
  2544. /* for the /proc/ directory itself, after non-process stuff has been done */
  2545. int proc_pid_readdir(struct file * filp, void * dirent, filldir_t filldir)
  2546. {
  2547. unsigned int nr;
  2548. struct task_struct *reaper;
  2549. struct tgid_iter iter;
  2550. struct pid_namespace *ns;
  2551. filldir_t __filldir;
  2552. if (filp->f_pos >= PID_MAX_LIMIT + TGID_OFFSET)
  2553. goto out_no_task;
  2554. nr = filp->f_pos - FIRST_PROCESS_ENTRY;
  2555. reaper = get_proc_task(filp->f_path.dentry->d_inode);
  2556. if (!reaper)
  2557. goto out_no_task;
  2558. for (; nr < ARRAY_SIZE(proc_base_stuff); filp->f_pos++, nr++) {
  2559. const struct pid_entry *p = &proc_base_stuff[nr];
  2560. if (proc_base_fill_cache(filp, dirent, filldir, reaper, p) < 0)
  2561. goto out;
  2562. }
  2563. ns = filp->f_dentry->d_sb->s_fs_info;
  2564. iter.task = NULL;
  2565. iter.tgid = filp->f_pos - TGID_OFFSET;
  2566. for (iter = next_tgid(ns, iter);
  2567. iter.task;
  2568. iter.tgid += 1, iter = next_tgid(ns, iter)) {
  2569. if (has_pid_permissions(ns, iter.task, 2))
  2570. __filldir = filldir;
  2571. else
  2572. __filldir = fake_filldir;
  2573. filp->f_pos = iter.tgid + TGID_OFFSET;
  2574. if (proc_pid_fill_cache(filp, dirent, __filldir, iter) < 0) {
  2575. put_task_struct(iter.task);
  2576. goto out;
  2577. }
  2578. }
  2579. filp->f_pos = PID_MAX_LIMIT + TGID_OFFSET;
  2580. out:
  2581. put_task_struct(reaper);
  2582. out_no_task:
  2583. return 0;
  2584. }
  2585. /*
  2586. * Tasks
  2587. */
  2588. static const struct pid_entry tid_base_stuff[] = {
  2589. DIR("fd", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),
  2590. DIR("fdinfo", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),
  2591. DIR("ns", S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),
  2592. REG("environ", S_IRUSR, proc_environ_operations),
  2593. INF("auxv", S_IRUSR, proc_pid_auxv),
  2594. ONE("status", S_IRUGO, proc_pid_status),
  2595. ONE("personality", S_IRUGO, proc_pid_personality),
  2596. INF("limits", S_IRUGO, proc_pid_limits),
  2597. #ifdef CONFIG_SCHED_DEBUG
  2598. REG("sched", S_IRUGO|S_IWUSR, proc_pid_sched_operations),
  2599. #endif
  2600. REG("comm", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),
  2601. #ifdef CONFIG_HAVE_ARCH_TRACEHOOK
  2602. INF("syscall", S_IRUGO, proc_pid_syscall),
  2603. #endif
  2604. INF("cmdline", S_IRUGO, proc_pid_cmdline),
  2605. ONE("stat", S_IRUGO, proc_tid_stat),
  2606. ONE("statm", S_IRUGO, proc_pid_statm),
  2607. REG("maps", S_IRUGO, proc_tid_maps_operations),
  2608. #ifdef CONFIG_CHECKPOINT_RESTORE
  2609. REG("children", S_IRUGO, proc_tid_children_operations),
  2610. #endif
  2611. #ifdef CONFIG_NUMA
  2612. REG("numa_maps", S_IRUGO, proc_tid_numa_maps_operations),
  2613. #endif
  2614. REG("mem", S_IRUSR|S_IWUSR, proc_mem_operations),
  2615. LNK("cwd", proc_cwd_link),
  2616. LNK("root", proc_root_link),
  2617. LNK("exe", proc_exe_link),
  2618. REG("mounts", S_IRUGO, proc_mounts_operations),
  2619. REG("mountinfo", S_IRUGO, proc_mountinfo_operations),
  2620. #ifdef CONFIG_PROC_PAGE_MONITOR
  2621. REG("clear_refs", S_IWUSR, proc_clear_refs_operations),
  2622. REG("smaps", S_IRUGO, proc_tid_smaps_operations),
  2623. REG("pagemap", S_IRUGO, proc_pagemap_operations),
  2624. #endif
  2625. #ifdef CONFIG_SECURITY
  2626. DIR("attr", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),
  2627. #endif
  2628. #ifdef CONFIG_KALLSYMS
  2629. INF("wchan", S_IRUGO, proc_pid_wchan),
  2630. #endif
  2631. #ifdef CONFIG_STACKTRACE
  2632. ONE("stack", S_IRUGO, proc_pid_stack),
  2633. #endif
  2634. #ifdef CONFIG_SCHEDSTATS
  2635. INF("schedstat", S_IRUGO, proc_pid_schedstat),
  2636. #endif
  2637. #ifdef CONFIG_LATENCYTOP
  2638. REG("latency", S_IRUGO, proc_lstats_operations),
  2639. #endif
  2640. #ifdef CONFIG_PROC_PID_CPUSET
  2641. REG("cpuset", S_IRUGO, proc_cpuset_operations),
  2642. #endif
  2643. #ifdef CONFIG_CGROUPS
  2644. REG("cgroup", S_IRUGO, proc_cgroup_operations),
  2645. #endif
  2646. INF("oom_score", S_IRUGO, proc_oom_score),
  2647. REG("oom_adj", S_IRUGO|S_IWUSR, proc_oom_adj_operations),
  2648. REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),
  2649. #ifdef CONFIG_AUDITSYSCALL
  2650. REG("loginuid", S_IWUSR|S_IRUGO, proc_loginuid_operations),
  2651. REG("sessionid", S_IRUGO, proc_sessionid_operations),
  2652. #endif
  2653. #ifdef CONFIG_FAULT_INJECTION
  2654. REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations),
  2655. #endif
  2656. #ifdef CONFIG_TASK_IO_ACCOUNTING
  2657. INF("io", S_IRUSR, proc_tid_io_accounting),
  2658. #endif
  2659. #ifdef CONFIG_HARDWALL
  2660. INF("hardwall", S_IRUGO, proc_pid_hardwall),
  2661. #endif
  2662. #ifdef CONFIG_USER_NS
  2663. REG("uid_map", S_IRUGO|S_IWUSR, proc_uid_map_operations),
  2664. REG("gid_map", S_IRUGO|S_IWUSR, proc_gid_map_operations),
  2665. REG("projid_map", S_IRUGO|S_IWUSR, proc_projid_map_operations),
  2666. #endif
  2667. };
  2668. static int proc_tid_base_readdir(struct file * filp,
  2669. void * dirent, filldir_t filldir)
  2670. {
  2671. return proc_pident_readdir(filp,dirent,filldir,
  2672. tid_base_stuff,ARRAY_SIZE(tid_base_stuff));
  2673. }
  2674. static struct dentry *proc_tid_base_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
  2675. {
  2676. return proc_pident_lookup(dir, dentry,
  2677. tid_base_stuff, ARRAY_SIZE(tid_base_stuff));
  2678. }
  2679. static const struct file_operations proc_tid_base_operations = {
  2680. .read = generic_read_dir,
  2681. .readdir = proc_tid_base_readdir,
  2682. .llseek = default_llseek,
  2683. };
  2684. static const struct inode_operations proc_tid_base_inode_operations = {
  2685. .lookup = proc_tid_base_lookup,
  2686. .getattr = pid_getattr,
  2687. .setattr = proc_setattr,
  2688. };
  2689. static struct dentry *proc_task_instantiate(struct inode *dir,
  2690. struct dentry *dentry, struct task_struct *task, const void *ptr)
  2691. {
  2692. struct dentry *error = ERR_PTR(-ENOENT);
  2693. struct inode *inode;
  2694. inode = proc_pid_make_inode(dir->i_sb, task);
  2695. if (!inode)
  2696. goto out;
  2697. inode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;
  2698. inode->i_op = &proc_tid_base_inode_operations;
  2699. inode->i_fop = &proc_tid_base_operations;
  2700. inode->i_flags|=S_IMMUTABLE;
  2701. set_nlink(inode, 2 + pid_entry_count_dirs(tid_base_stuff,
  2702. ARRAY_SIZE(tid_base_stuff)));
  2703. d_set_d_op(dentry, &pid_dentry_operations);
  2704. d_add(dentry, inode);
  2705. /* Close the race of the process dying before we return the dentry */
  2706. if (pid_revalidate(dentry, 0))
  2707. error = NULL;
  2708. out:
  2709. return error;
  2710. }
  2711. static struct dentry *proc_task_lookup(struct inode *dir, struct dentry * dentry, unsigned int flags)
  2712. {
  2713. struct dentry *result = ERR_PTR(-ENOENT);
  2714. struct task_struct *task;
  2715. struct task_struct *leader = get_proc_task(dir);
  2716. unsigned tid;
  2717. struct pid_namespace *ns;
  2718. if (!leader)
  2719. goto out_no_task;
  2720. tid = name_to_int(dentry);
  2721. if (tid == ~0U)
  2722. goto out;
  2723. ns = dentry->d_sb->s_fs_info;
  2724. rcu_read_lock();
  2725. task = find_task_by_pid_ns(tid, ns);
  2726. if (task)
  2727. get_task_struct(task);
  2728. rcu_read_unlock();
  2729. if (!task)
  2730. goto out;
  2731. if (!same_thread_group(leader, task))
  2732. goto out_drop_task;
  2733. result = proc_task_instantiate(dir, dentry, task, NULL);
  2734. out_drop_task:
  2735. put_task_struct(task);
  2736. out:
  2737. put_task_struct(leader);
  2738. out_no_task:
  2739. return result;
  2740. }
  2741. /*
  2742. * Find the first tid of a thread group to return to user space.
  2743. *
  2744. * Usually this is just the thread group leader, but if the users
  2745. * buffer was too small or there was a seek into the middle of the
  2746. * directory we have more work todo.
  2747. *
  2748. * In the case of a short read we start with find_task_by_pid.
  2749. *
  2750. * In the case of a seek we start with the leader and walk nr
  2751. * threads past it.
  2752. */
  2753. static struct task_struct *first_tid(struct task_struct *leader,
  2754. int tid, int nr, struct pid_namespace *ns)
  2755. {
  2756. struct task_struct *pos;
  2757. rcu_read_lock();
  2758. /* Attempt to start with the pid of a thread */
  2759. if (tid && (nr > 0)) {
  2760. pos = find_task_by_pid_ns(tid, ns);
  2761. if (pos && (pos->group_leader == leader))
  2762. goto found;
  2763. }
  2764. /* If nr exceeds the number of threads there is nothing todo */
  2765. pos = NULL;
  2766. if (nr && nr >= get_nr_threads(leader))
  2767. goto out;
  2768. /* If we haven't found our starting place yet start
  2769. * with the leader and walk nr threads forward.
  2770. */
  2771. for (pos = leader; nr > 0; --nr) {
  2772. pos = next_thread(pos);
  2773. if (pos == leader) {
  2774. pos = NULL;
  2775. goto out;
  2776. }
  2777. }
  2778. found:
  2779. get_task_struct(pos);
  2780. out:
  2781. rcu_read_unlock();
  2782. return pos;
  2783. }
  2784. /*
  2785. * Find the next thread in the thread list.
  2786. * Return NULL if there is an error or no next thread.
  2787. *
  2788. * The reference to the input task_struct is released.
  2789. */
  2790. static struct task_struct *next_tid(struct task_struct *start)
  2791. {
  2792. struct task_struct *pos = NULL;
  2793. rcu_read_lock();
  2794. if (pid_alive(start)) {
  2795. pos = next_thread(start);
  2796. if (thread_group_leader(pos))
  2797. pos = NULL;
  2798. else
  2799. get_task_struct(pos);
  2800. }
  2801. rcu_read_unlock();
  2802. put_task_struct(start);
  2803. return pos;
  2804. }
  2805. static int proc_task_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
  2806. struct task_struct *task, int tid)
  2807. {
  2808. char name[PROC_NUMBUF];
  2809. int len = snprintf(name, sizeof(name), "%d", tid);
  2810. return proc_fill_cache(filp, dirent, filldir, name, len,
  2811. proc_task_instantiate, task, NULL);
  2812. }
  2813. /* for the /proc/TGID/task/ directories */
  2814. static int proc_task_readdir(struct file * filp, void * dirent, filldir_t filldir)
  2815. {
  2816. struct dentry *dentry = filp->f_path.dentry;
  2817. struct inode *inode = dentry->d_inode;
  2818. struct task_struct *leader = NULL;
  2819. struct task_struct *task;
  2820. int retval = -ENOENT;
  2821. ino_t ino;
  2822. int tid;
  2823. struct pid_namespace *ns;
  2824. task = get_proc_task(inode);
  2825. if (!task)
  2826. goto out_no_task;
  2827. rcu_read_lock();
  2828. if (pid_alive(task)) {
  2829. leader = task->group_leader;
  2830. get_task_struct(leader);
  2831. }
  2832. rcu_read_unlock();
  2833. put_task_struct(task);
  2834. if (!leader)
  2835. goto out_no_task;
  2836. retval = 0;
  2837. switch ((unsigned long)filp->f_pos) {
  2838. case 0:
  2839. ino = inode->i_ino;
  2840. if (filldir(dirent, ".", 1, filp->f_pos, ino, DT_DIR) < 0)
  2841. goto out;
  2842. filp->f_pos++;
  2843. /* fall through */
  2844. case 1:
  2845. ino = parent_ino(dentry);
  2846. if (filldir(dirent, "..", 2, filp->f_pos, ino, DT_DIR) < 0)
  2847. goto out;
  2848. filp->f_pos++;
  2849. /* fall through */
  2850. }
  2851. /* f_version caches the tgid value that the last readdir call couldn't
  2852. * return. lseek aka telldir automagically resets f_version to 0.
  2853. */
  2854. ns = filp->f_dentry->d_sb->s_fs_info;
  2855. tid = (int)filp->f_version;
  2856. filp->f_version = 0;
  2857. for (task = first_tid(leader, tid, filp->f_pos - 2, ns);
  2858. task;
  2859. task = next_tid(task), filp->f_pos++) {
  2860. tid = task_pid_nr_ns(task, ns);
  2861. if (proc_task_fill_cache(filp, dirent, filldir, task, tid) < 0) {
  2862. /* returning this tgid failed, save it as the first
  2863. * pid for the next readir call */
  2864. filp->f_version = (u64)tid;
  2865. put_task_struct(task);
  2866. break;
  2867. }
  2868. }
  2869. out:
  2870. put_task_struct(leader);
  2871. out_no_task:
  2872. return retval;
  2873. }
  2874. static int proc_task_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
  2875. {
  2876. struct inode *inode = dentry->d_inode;
  2877. struct task_struct *p = get_proc_task(inode);
  2878. generic_fillattr(inode, stat);
  2879. if (p) {
  2880. stat->nlink += get_nr_threads(p);
  2881. put_task_struct(p);
  2882. }
  2883. return 0;
  2884. }
  2885. static const struct inode_operations proc_task_inode_operations = {
  2886. .lookup = proc_task_lookup,
  2887. .getattr = proc_task_getattr,
  2888. .setattr = proc_setattr,
  2889. .permission = proc_pid_permission,
  2890. };
  2891. static const struct file_operations proc_task_operations = {
  2892. .read = generic_read_dir,
  2893. .readdir = proc_task_readdir,
  2894. .llseek = default_llseek,
  2895. };