base.c 79 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345
  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_adjust_read(struct file *file, char __user *buf,
  748. size_t count, loff_t *ppos)
  749. {
  750. struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
  751. char buffer[PROC_NUMBUF];
  752. size_t len;
  753. int oom_adjust = OOM_DISABLE;
  754. unsigned long flags;
  755. if (!task)
  756. return -ESRCH;
  757. if (lock_task_sighand(task, &flags)) {
  758. oom_adjust = task->signal->oom_adj;
  759. unlock_task_sighand(task, &flags);
  760. }
  761. put_task_struct(task);
  762. len = snprintf(buffer, sizeof(buffer), "%i\n", oom_adjust);
  763. return simple_read_from_buffer(buf, count, ppos, buffer, len);
  764. }
  765. static ssize_t oom_adjust_write(struct file *file, const char __user *buf,
  766. size_t count, loff_t *ppos)
  767. {
  768. struct task_struct *task;
  769. char buffer[PROC_NUMBUF];
  770. int oom_adjust;
  771. unsigned long flags;
  772. int err;
  773. memset(buffer, 0, sizeof(buffer));
  774. if (count > sizeof(buffer) - 1)
  775. count = sizeof(buffer) - 1;
  776. if (copy_from_user(buffer, buf, count)) {
  777. err = -EFAULT;
  778. goto out;
  779. }
  780. err = kstrtoint(strstrip(buffer), 0, &oom_adjust);
  781. if (err)
  782. goto out;
  783. if ((oom_adjust < OOM_ADJUST_MIN || oom_adjust > OOM_ADJUST_MAX) &&
  784. oom_adjust != OOM_DISABLE) {
  785. err = -EINVAL;
  786. goto out;
  787. }
  788. task = get_proc_task(file->f_path.dentry->d_inode);
  789. if (!task) {
  790. err = -ESRCH;
  791. goto out;
  792. }
  793. task_lock(task);
  794. if (!task->mm) {
  795. err = -EINVAL;
  796. goto err_task_lock;
  797. }
  798. if (!lock_task_sighand(task, &flags)) {
  799. err = -ESRCH;
  800. goto err_task_lock;
  801. }
  802. if (oom_adjust < task->signal->oom_adj && !capable(CAP_SYS_RESOURCE)) {
  803. err = -EACCES;
  804. goto err_sighand;
  805. }
  806. /*
  807. * Warn that /proc/pid/oom_adj is deprecated, see
  808. * Documentation/feature-removal-schedule.txt.
  809. */
  810. printk_once(KERN_WARNING "%s (%d): /proc/%d/oom_adj is deprecated, please use /proc/%d/oom_score_adj instead.\n",
  811. current->comm, task_pid_nr(current), task_pid_nr(task),
  812. task_pid_nr(task));
  813. task->signal->oom_adj = oom_adjust;
  814. /*
  815. * Scale /proc/pid/oom_score_adj appropriately ensuring that a maximum
  816. * value is always attainable.
  817. */
  818. if (task->signal->oom_adj == OOM_ADJUST_MAX)
  819. task->signal->oom_score_adj = OOM_SCORE_ADJ_MAX;
  820. else
  821. task->signal->oom_score_adj = (oom_adjust * OOM_SCORE_ADJ_MAX) /
  822. -OOM_DISABLE;
  823. trace_oom_score_adj_update(task);
  824. err_sighand:
  825. unlock_task_sighand(task, &flags);
  826. err_task_lock:
  827. task_unlock(task);
  828. put_task_struct(task);
  829. out:
  830. return err < 0 ? err : count;
  831. }
  832. static const struct file_operations proc_oom_adjust_operations = {
  833. .read = oom_adjust_read,
  834. .write = oom_adjust_write,
  835. .llseek = generic_file_llseek,
  836. };
  837. static ssize_t oom_score_adj_read(struct file *file, char __user *buf,
  838. size_t count, loff_t *ppos)
  839. {
  840. struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
  841. char buffer[PROC_NUMBUF];
  842. int oom_score_adj = OOM_SCORE_ADJ_MIN;
  843. unsigned long flags;
  844. size_t len;
  845. if (!task)
  846. return -ESRCH;
  847. if (lock_task_sighand(task, &flags)) {
  848. oom_score_adj = task->signal->oom_score_adj;
  849. unlock_task_sighand(task, &flags);
  850. }
  851. put_task_struct(task);
  852. len = snprintf(buffer, sizeof(buffer), "%d\n", oom_score_adj);
  853. return simple_read_from_buffer(buf, count, ppos, buffer, len);
  854. }
  855. static ssize_t oom_score_adj_write(struct file *file, const char __user *buf,
  856. size_t count, loff_t *ppos)
  857. {
  858. struct task_struct *task;
  859. char buffer[PROC_NUMBUF];
  860. unsigned long flags;
  861. int oom_score_adj;
  862. int err;
  863. memset(buffer, 0, sizeof(buffer));
  864. if (count > sizeof(buffer) - 1)
  865. count = sizeof(buffer) - 1;
  866. if (copy_from_user(buffer, buf, count)) {
  867. err = -EFAULT;
  868. goto out;
  869. }
  870. err = kstrtoint(strstrip(buffer), 0, &oom_score_adj);
  871. if (err)
  872. goto out;
  873. if (oom_score_adj < OOM_SCORE_ADJ_MIN ||
  874. oom_score_adj > OOM_SCORE_ADJ_MAX) {
  875. err = -EINVAL;
  876. goto out;
  877. }
  878. task = get_proc_task(file->f_path.dentry->d_inode);
  879. if (!task) {
  880. err = -ESRCH;
  881. goto out;
  882. }
  883. task_lock(task);
  884. if (!task->mm) {
  885. err = -EINVAL;
  886. goto err_task_lock;
  887. }
  888. if (!lock_task_sighand(task, &flags)) {
  889. err = -ESRCH;
  890. goto err_task_lock;
  891. }
  892. if (oom_score_adj < task->signal->oom_score_adj_min &&
  893. !capable(CAP_SYS_RESOURCE)) {
  894. err = -EACCES;
  895. goto err_sighand;
  896. }
  897. task->signal->oom_score_adj = oom_score_adj;
  898. if (has_capability_noaudit(current, CAP_SYS_RESOURCE))
  899. task->signal->oom_score_adj_min = oom_score_adj;
  900. trace_oom_score_adj_update(task);
  901. /*
  902. * Scale /proc/pid/oom_adj appropriately ensuring that OOM_DISABLE is
  903. * always attainable.
  904. */
  905. if (task->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
  906. task->signal->oom_adj = OOM_DISABLE;
  907. else
  908. task->signal->oom_adj = (oom_score_adj * OOM_ADJUST_MAX) /
  909. OOM_SCORE_ADJ_MAX;
  910. err_sighand:
  911. unlock_task_sighand(task, &flags);
  912. err_task_lock:
  913. task_unlock(task);
  914. put_task_struct(task);
  915. out:
  916. return err < 0 ? err : count;
  917. }
  918. static const struct file_operations proc_oom_score_adj_operations = {
  919. .read = oom_score_adj_read,
  920. .write = oom_score_adj_write,
  921. .llseek = default_llseek,
  922. };
  923. #ifdef CONFIG_AUDITSYSCALL
  924. #define TMPBUFLEN 21
  925. static ssize_t proc_loginuid_read(struct file * file, char __user * buf,
  926. size_t count, loff_t *ppos)
  927. {
  928. struct inode * inode = file->f_path.dentry->d_inode;
  929. struct task_struct *task = get_proc_task(inode);
  930. ssize_t length;
  931. char tmpbuf[TMPBUFLEN];
  932. if (!task)
  933. return -ESRCH;
  934. length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
  935. audit_get_loginuid(task));
  936. put_task_struct(task);
  937. return simple_read_from_buffer(buf, count, ppos, tmpbuf, length);
  938. }
  939. static ssize_t proc_loginuid_write(struct file * file, const char __user * buf,
  940. size_t count, loff_t *ppos)
  941. {
  942. struct inode * inode = file->f_path.dentry->d_inode;
  943. char *page, *tmp;
  944. ssize_t length;
  945. uid_t loginuid;
  946. rcu_read_lock();
  947. if (current != pid_task(proc_pid(inode), PIDTYPE_PID)) {
  948. rcu_read_unlock();
  949. return -EPERM;
  950. }
  951. rcu_read_unlock();
  952. if (count >= PAGE_SIZE)
  953. count = PAGE_SIZE - 1;
  954. if (*ppos != 0) {
  955. /* No partial writes. */
  956. return -EINVAL;
  957. }
  958. page = (char*)__get_free_page(GFP_TEMPORARY);
  959. if (!page)
  960. return -ENOMEM;
  961. length = -EFAULT;
  962. if (copy_from_user(page, buf, count))
  963. goto out_free_page;
  964. page[count] = '\0';
  965. loginuid = simple_strtoul(page, &tmp, 10);
  966. if (tmp == page) {
  967. length = -EINVAL;
  968. goto out_free_page;
  969. }
  970. length = audit_set_loginuid(loginuid);
  971. if (likely(length == 0))
  972. length = count;
  973. out_free_page:
  974. free_page((unsigned long) page);
  975. return length;
  976. }
  977. static const struct file_operations proc_loginuid_operations = {
  978. .read = proc_loginuid_read,
  979. .write = proc_loginuid_write,
  980. .llseek = generic_file_llseek,
  981. };
  982. static ssize_t proc_sessionid_read(struct file * file, char __user * buf,
  983. size_t count, loff_t *ppos)
  984. {
  985. struct inode * inode = file->f_path.dentry->d_inode;
  986. struct task_struct *task = get_proc_task(inode);
  987. ssize_t length;
  988. char tmpbuf[TMPBUFLEN];
  989. if (!task)
  990. return -ESRCH;
  991. length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
  992. audit_get_sessionid(task));
  993. put_task_struct(task);
  994. return simple_read_from_buffer(buf, count, ppos, tmpbuf, length);
  995. }
  996. static const struct file_operations proc_sessionid_operations = {
  997. .read = proc_sessionid_read,
  998. .llseek = generic_file_llseek,
  999. };
  1000. #endif
  1001. #ifdef CONFIG_FAULT_INJECTION
  1002. static ssize_t proc_fault_inject_read(struct file * file, char __user * buf,
  1003. size_t count, loff_t *ppos)
  1004. {
  1005. struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
  1006. char buffer[PROC_NUMBUF];
  1007. size_t len;
  1008. int make_it_fail;
  1009. if (!task)
  1010. return -ESRCH;
  1011. make_it_fail = task->make_it_fail;
  1012. put_task_struct(task);
  1013. len = snprintf(buffer, sizeof(buffer), "%i\n", make_it_fail);
  1014. return simple_read_from_buffer(buf, count, ppos, buffer, len);
  1015. }
  1016. static ssize_t proc_fault_inject_write(struct file * file,
  1017. const char __user * buf, size_t count, loff_t *ppos)
  1018. {
  1019. struct task_struct *task;
  1020. char buffer[PROC_NUMBUF], *end;
  1021. int make_it_fail;
  1022. if (!capable(CAP_SYS_RESOURCE))
  1023. return -EPERM;
  1024. memset(buffer, 0, sizeof(buffer));
  1025. if (count > sizeof(buffer) - 1)
  1026. count = sizeof(buffer) - 1;
  1027. if (copy_from_user(buffer, buf, count))
  1028. return -EFAULT;
  1029. make_it_fail = simple_strtol(strstrip(buffer), &end, 0);
  1030. if (*end)
  1031. return -EINVAL;
  1032. task = get_proc_task(file->f_dentry->d_inode);
  1033. if (!task)
  1034. return -ESRCH;
  1035. task->make_it_fail = make_it_fail;
  1036. put_task_struct(task);
  1037. return count;
  1038. }
  1039. static const struct file_operations proc_fault_inject_operations = {
  1040. .read = proc_fault_inject_read,
  1041. .write = proc_fault_inject_write,
  1042. .llseek = generic_file_llseek,
  1043. };
  1044. #endif
  1045. #ifdef CONFIG_SCHED_DEBUG
  1046. /*
  1047. * Print out various scheduling related per-task fields:
  1048. */
  1049. static int sched_show(struct seq_file *m, void *v)
  1050. {
  1051. struct inode *inode = m->private;
  1052. struct task_struct *p;
  1053. p = get_proc_task(inode);
  1054. if (!p)
  1055. return -ESRCH;
  1056. proc_sched_show_task(p, m);
  1057. put_task_struct(p);
  1058. return 0;
  1059. }
  1060. static ssize_t
  1061. sched_write(struct file *file, const char __user *buf,
  1062. size_t count, loff_t *offset)
  1063. {
  1064. struct inode *inode = file->f_path.dentry->d_inode;
  1065. struct task_struct *p;
  1066. p = get_proc_task(inode);
  1067. if (!p)
  1068. return -ESRCH;
  1069. proc_sched_set_task(p);
  1070. put_task_struct(p);
  1071. return count;
  1072. }
  1073. static int sched_open(struct inode *inode, struct file *filp)
  1074. {
  1075. return single_open(filp, sched_show, inode);
  1076. }
  1077. static const struct file_operations proc_pid_sched_operations = {
  1078. .open = sched_open,
  1079. .read = seq_read,
  1080. .write = sched_write,
  1081. .llseek = seq_lseek,
  1082. .release = single_release,
  1083. };
  1084. #endif
  1085. #ifdef CONFIG_SCHED_AUTOGROUP
  1086. /*
  1087. * Print out autogroup related information:
  1088. */
  1089. static int sched_autogroup_show(struct seq_file *m, void *v)
  1090. {
  1091. struct inode *inode = m->private;
  1092. struct task_struct *p;
  1093. p = get_proc_task(inode);
  1094. if (!p)
  1095. return -ESRCH;
  1096. proc_sched_autogroup_show_task(p, m);
  1097. put_task_struct(p);
  1098. return 0;
  1099. }
  1100. static ssize_t
  1101. sched_autogroup_write(struct file *file, const char __user *buf,
  1102. size_t count, loff_t *offset)
  1103. {
  1104. struct inode *inode = file->f_path.dentry->d_inode;
  1105. struct task_struct *p;
  1106. char buffer[PROC_NUMBUF];
  1107. int nice;
  1108. int err;
  1109. memset(buffer, 0, sizeof(buffer));
  1110. if (count > sizeof(buffer) - 1)
  1111. count = sizeof(buffer) - 1;
  1112. if (copy_from_user(buffer, buf, count))
  1113. return -EFAULT;
  1114. err = kstrtoint(strstrip(buffer), 0, &nice);
  1115. if (err < 0)
  1116. return err;
  1117. p = get_proc_task(inode);
  1118. if (!p)
  1119. return -ESRCH;
  1120. err = proc_sched_autogroup_set_nice(p, nice);
  1121. if (err)
  1122. count = err;
  1123. put_task_struct(p);
  1124. return count;
  1125. }
  1126. static int sched_autogroup_open(struct inode *inode, struct file *filp)
  1127. {
  1128. int ret;
  1129. ret = single_open(filp, sched_autogroup_show, NULL);
  1130. if (!ret) {
  1131. struct seq_file *m = filp->private_data;
  1132. m->private = inode;
  1133. }
  1134. return ret;
  1135. }
  1136. static const struct file_operations proc_pid_sched_autogroup_operations = {
  1137. .open = sched_autogroup_open,
  1138. .read = seq_read,
  1139. .write = sched_autogroup_write,
  1140. .llseek = seq_lseek,
  1141. .release = single_release,
  1142. };
  1143. #endif /* CONFIG_SCHED_AUTOGROUP */
  1144. static ssize_t comm_write(struct file *file, const char __user *buf,
  1145. size_t count, loff_t *offset)
  1146. {
  1147. struct inode *inode = file->f_path.dentry->d_inode;
  1148. struct task_struct *p;
  1149. char buffer[TASK_COMM_LEN];
  1150. memset(buffer, 0, sizeof(buffer));
  1151. if (count > sizeof(buffer) - 1)
  1152. count = sizeof(buffer) - 1;
  1153. if (copy_from_user(buffer, buf, count))
  1154. return -EFAULT;
  1155. p = get_proc_task(inode);
  1156. if (!p)
  1157. return -ESRCH;
  1158. if (same_thread_group(current, p))
  1159. set_task_comm(p, buffer);
  1160. else
  1161. count = -EINVAL;
  1162. put_task_struct(p);
  1163. return count;
  1164. }
  1165. static int comm_show(struct seq_file *m, void *v)
  1166. {
  1167. struct inode *inode = m->private;
  1168. struct task_struct *p;
  1169. p = get_proc_task(inode);
  1170. if (!p)
  1171. return -ESRCH;
  1172. task_lock(p);
  1173. seq_printf(m, "%s\n", p->comm);
  1174. task_unlock(p);
  1175. put_task_struct(p);
  1176. return 0;
  1177. }
  1178. static int comm_open(struct inode *inode, struct file *filp)
  1179. {
  1180. return single_open(filp, comm_show, inode);
  1181. }
  1182. static const struct file_operations proc_pid_set_comm_operations = {
  1183. .open = comm_open,
  1184. .read = seq_read,
  1185. .write = comm_write,
  1186. .llseek = seq_lseek,
  1187. .release = single_release,
  1188. };
  1189. static int proc_exe_link(struct dentry *dentry, struct path *exe_path)
  1190. {
  1191. struct task_struct *task;
  1192. struct mm_struct *mm;
  1193. struct file *exe_file;
  1194. task = get_proc_task(dentry->d_inode);
  1195. if (!task)
  1196. return -ENOENT;
  1197. mm = get_task_mm(task);
  1198. put_task_struct(task);
  1199. if (!mm)
  1200. return -ENOENT;
  1201. exe_file = get_mm_exe_file(mm);
  1202. mmput(mm);
  1203. if (exe_file) {
  1204. *exe_path = exe_file->f_path;
  1205. path_get(&exe_file->f_path);
  1206. fput(exe_file);
  1207. return 0;
  1208. } else
  1209. return -ENOENT;
  1210. }
  1211. static void *proc_pid_follow_link(struct dentry *dentry, struct nameidata *nd)
  1212. {
  1213. struct inode *inode = dentry->d_inode;
  1214. struct path path;
  1215. int error = -EACCES;
  1216. /* Are we allowed to snoop on the tasks file descriptors? */
  1217. if (!proc_fd_access_allowed(inode))
  1218. goto out;
  1219. error = PROC_I(inode)->op.proc_get_link(dentry, &path);
  1220. if (error)
  1221. goto out;
  1222. nd_jump_link(nd, &path);
  1223. return NULL;
  1224. out:
  1225. return ERR_PTR(error);
  1226. }
  1227. static int do_proc_readlink(struct path *path, char __user *buffer, int buflen)
  1228. {
  1229. char *tmp = (char*)__get_free_page(GFP_TEMPORARY);
  1230. char *pathname;
  1231. int len;
  1232. if (!tmp)
  1233. return -ENOMEM;
  1234. pathname = d_path(path, tmp, PAGE_SIZE);
  1235. len = PTR_ERR(pathname);
  1236. if (IS_ERR(pathname))
  1237. goto out;
  1238. len = tmp + PAGE_SIZE - 1 - pathname;
  1239. if (len > buflen)
  1240. len = buflen;
  1241. if (copy_to_user(buffer, pathname, len))
  1242. len = -EFAULT;
  1243. out:
  1244. free_page((unsigned long)tmp);
  1245. return len;
  1246. }
  1247. static int proc_pid_readlink(struct dentry * dentry, char __user * buffer, int buflen)
  1248. {
  1249. int error = -EACCES;
  1250. struct inode *inode = dentry->d_inode;
  1251. struct path path;
  1252. /* Are we allowed to snoop on the tasks file descriptors? */
  1253. if (!proc_fd_access_allowed(inode))
  1254. goto out;
  1255. error = PROC_I(inode)->op.proc_get_link(dentry, &path);
  1256. if (error)
  1257. goto out;
  1258. error = do_proc_readlink(&path, buffer, buflen);
  1259. path_put(&path);
  1260. out:
  1261. return error;
  1262. }
  1263. const struct inode_operations proc_pid_link_inode_operations = {
  1264. .readlink = proc_pid_readlink,
  1265. .follow_link = proc_pid_follow_link,
  1266. .setattr = proc_setattr,
  1267. };
  1268. /* building an inode */
  1269. struct inode *proc_pid_make_inode(struct super_block * sb, struct task_struct *task)
  1270. {
  1271. struct inode * inode;
  1272. struct proc_inode *ei;
  1273. const struct cred *cred;
  1274. /* We need a new inode */
  1275. inode = new_inode(sb);
  1276. if (!inode)
  1277. goto out;
  1278. /* Common stuff */
  1279. ei = PROC_I(inode);
  1280. inode->i_ino = get_next_ino();
  1281. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  1282. inode->i_op = &proc_def_inode_operations;
  1283. /*
  1284. * grab the reference to task.
  1285. */
  1286. ei->pid = get_task_pid(task, PIDTYPE_PID);
  1287. if (!ei->pid)
  1288. goto out_unlock;
  1289. if (task_dumpable(task)) {
  1290. rcu_read_lock();
  1291. cred = __task_cred(task);
  1292. inode->i_uid = cred->euid;
  1293. inode->i_gid = cred->egid;
  1294. rcu_read_unlock();
  1295. }
  1296. security_task_to_inode(task, inode);
  1297. out:
  1298. return inode;
  1299. out_unlock:
  1300. iput(inode);
  1301. return NULL;
  1302. }
  1303. int pid_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
  1304. {
  1305. struct inode *inode = dentry->d_inode;
  1306. struct task_struct *task;
  1307. const struct cred *cred;
  1308. struct pid_namespace *pid = dentry->d_sb->s_fs_info;
  1309. generic_fillattr(inode, stat);
  1310. rcu_read_lock();
  1311. stat->uid = GLOBAL_ROOT_UID;
  1312. stat->gid = GLOBAL_ROOT_GID;
  1313. task = pid_task(proc_pid(inode), PIDTYPE_PID);
  1314. if (task) {
  1315. if (!has_pid_permissions(pid, task, 2)) {
  1316. rcu_read_unlock();
  1317. /*
  1318. * This doesn't prevent learning whether PID exists,
  1319. * it only makes getattr() consistent with readdir().
  1320. */
  1321. return -ENOENT;
  1322. }
  1323. if ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||
  1324. task_dumpable(task)) {
  1325. cred = __task_cred(task);
  1326. stat->uid = cred->euid;
  1327. stat->gid = cred->egid;
  1328. }
  1329. }
  1330. rcu_read_unlock();
  1331. return 0;
  1332. }
  1333. /* dentry stuff */
  1334. /*
  1335. * Exceptional case: normally we are not allowed to unhash a busy
  1336. * directory. In this case, however, we can do it - no aliasing problems
  1337. * due to the way we treat inodes.
  1338. *
  1339. * Rewrite the inode's ownerships here because the owning task may have
  1340. * performed a setuid(), etc.
  1341. *
  1342. * Before the /proc/pid/status file was created the only way to read
  1343. * the effective uid of a /process was to stat /proc/pid. Reading
  1344. * /proc/pid/status is slow enough that procps and other packages
  1345. * kept stating /proc/pid. To keep the rules in /proc simple I have
  1346. * made this apply to all per process world readable and executable
  1347. * directories.
  1348. */
  1349. int pid_revalidate(struct dentry *dentry, unsigned int flags)
  1350. {
  1351. struct inode *inode;
  1352. struct task_struct *task;
  1353. const struct cred *cred;
  1354. if (flags & LOOKUP_RCU)
  1355. return -ECHILD;
  1356. inode = dentry->d_inode;
  1357. task = get_proc_task(inode);
  1358. if (task) {
  1359. if ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||
  1360. task_dumpable(task)) {
  1361. rcu_read_lock();
  1362. cred = __task_cred(task);
  1363. inode->i_uid = cred->euid;
  1364. inode->i_gid = cred->egid;
  1365. rcu_read_unlock();
  1366. } else {
  1367. inode->i_uid = GLOBAL_ROOT_UID;
  1368. inode->i_gid = GLOBAL_ROOT_GID;
  1369. }
  1370. inode->i_mode &= ~(S_ISUID | S_ISGID);
  1371. security_task_to_inode(task, inode);
  1372. put_task_struct(task);
  1373. return 1;
  1374. }
  1375. d_drop(dentry);
  1376. return 0;
  1377. }
  1378. const struct dentry_operations pid_dentry_operations =
  1379. {
  1380. .d_revalidate = pid_revalidate,
  1381. .d_delete = pid_delete_dentry,
  1382. };
  1383. /* Lookups */
  1384. /*
  1385. * Fill a directory entry.
  1386. *
  1387. * If possible create the dcache entry and derive our inode number and
  1388. * file type from dcache entry.
  1389. *
  1390. * Since all of the proc inode numbers are dynamically generated, the inode
  1391. * numbers do not exist until the inode is cache. This means creating the
  1392. * the dcache entry in readdir is necessary to keep the inode numbers
  1393. * reported by readdir in sync with the inode numbers reported
  1394. * by stat.
  1395. */
  1396. int proc_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
  1397. const char *name, int len,
  1398. instantiate_t instantiate, struct task_struct *task, const void *ptr)
  1399. {
  1400. struct dentry *child, *dir = filp->f_path.dentry;
  1401. struct inode *inode;
  1402. struct qstr qname;
  1403. ino_t ino = 0;
  1404. unsigned type = DT_UNKNOWN;
  1405. qname.name = name;
  1406. qname.len = len;
  1407. qname.hash = full_name_hash(name, len);
  1408. child = d_lookup(dir, &qname);
  1409. if (!child) {
  1410. struct dentry *new;
  1411. new = d_alloc(dir, &qname);
  1412. if (new) {
  1413. child = instantiate(dir->d_inode, new, task, ptr);
  1414. if (child)
  1415. dput(new);
  1416. else
  1417. child = new;
  1418. }
  1419. }
  1420. if (!child || IS_ERR(child) || !child->d_inode)
  1421. goto end_instantiate;
  1422. inode = child->d_inode;
  1423. if (inode) {
  1424. ino = inode->i_ino;
  1425. type = inode->i_mode >> 12;
  1426. }
  1427. dput(child);
  1428. end_instantiate:
  1429. if (!ino)
  1430. ino = find_inode_number(dir, &qname);
  1431. if (!ino)
  1432. ino = 1;
  1433. return filldir(dirent, name, len, filp->f_pos, ino, type);
  1434. }
  1435. #ifdef CONFIG_CHECKPOINT_RESTORE
  1436. /*
  1437. * dname_to_vma_addr - maps a dentry name into two unsigned longs
  1438. * which represent vma start and end addresses.
  1439. */
  1440. static int dname_to_vma_addr(struct dentry *dentry,
  1441. unsigned long *start, unsigned long *end)
  1442. {
  1443. if (sscanf(dentry->d_name.name, "%lx-%lx", start, end) != 2)
  1444. return -EINVAL;
  1445. return 0;
  1446. }
  1447. static int map_files_d_revalidate(struct dentry *dentry, unsigned int flags)
  1448. {
  1449. unsigned long vm_start, vm_end;
  1450. bool exact_vma_exists = false;
  1451. struct mm_struct *mm = NULL;
  1452. struct task_struct *task;
  1453. const struct cred *cred;
  1454. struct inode *inode;
  1455. int status = 0;
  1456. if (flags & LOOKUP_RCU)
  1457. return -ECHILD;
  1458. if (!capable(CAP_SYS_ADMIN)) {
  1459. status = -EACCES;
  1460. goto out_notask;
  1461. }
  1462. inode = dentry->d_inode;
  1463. task = get_proc_task(inode);
  1464. if (!task)
  1465. goto out_notask;
  1466. mm = mm_access(task, PTRACE_MODE_READ);
  1467. if (IS_ERR_OR_NULL(mm))
  1468. goto out;
  1469. if (!dname_to_vma_addr(dentry, &vm_start, &vm_end)) {
  1470. down_read(&mm->mmap_sem);
  1471. exact_vma_exists = !!find_exact_vma(mm, vm_start, vm_end);
  1472. up_read(&mm->mmap_sem);
  1473. }
  1474. mmput(mm);
  1475. if (exact_vma_exists) {
  1476. if (task_dumpable(task)) {
  1477. rcu_read_lock();
  1478. cred = __task_cred(task);
  1479. inode->i_uid = cred->euid;
  1480. inode->i_gid = cred->egid;
  1481. rcu_read_unlock();
  1482. } else {
  1483. inode->i_uid = GLOBAL_ROOT_UID;
  1484. inode->i_gid = GLOBAL_ROOT_GID;
  1485. }
  1486. security_task_to_inode(task, inode);
  1487. status = 1;
  1488. }
  1489. out:
  1490. put_task_struct(task);
  1491. out_notask:
  1492. if (status <= 0)
  1493. d_drop(dentry);
  1494. return status;
  1495. }
  1496. static const struct dentry_operations tid_map_files_dentry_operations = {
  1497. .d_revalidate = map_files_d_revalidate,
  1498. .d_delete = pid_delete_dentry,
  1499. };
  1500. static int proc_map_files_get_link(struct dentry *dentry, struct path *path)
  1501. {
  1502. unsigned long vm_start, vm_end;
  1503. struct vm_area_struct *vma;
  1504. struct task_struct *task;
  1505. struct mm_struct *mm;
  1506. int rc;
  1507. rc = -ENOENT;
  1508. task = get_proc_task(dentry->d_inode);
  1509. if (!task)
  1510. goto out;
  1511. mm = get_task_mm(task);
  1512. put_task_struct(task);
  1513. if (!mm)
  1514. goto out;
  1515. rc = dname_to_vma_addr(dentry, &vm_start, &vm_end);
  1516. if (rc)
  1517. goto out_mmput;
  1518. down_read(&mm->mmap_sem);
  1519. vma = find_exact_vma(mm, vm_start, vm_end);
  1520. if (vma && vma->vm_file) {
  1521. *path = vma->vm_file->f_path;
  1522. path_get(path);
  1523. rc = 0;
  1524. }
  1525. up_read(&mm->mmap_sem);
  1526. out_mmput:
  1527. mmput(mm);
  1528. out:
  1529. return rc;
  1530. }
  1531. struct map_files_info {
  1532. struct file *file;
  1533. unsigned long len;
  1534. unsigned char name[4*sizeof(long)+2]; /* max: %lx-%lx\0 */
  1535. };
  1536. static struct dentry *
  1537. proc_map_files_instantiate(struct inode *dir, struct dentry *dentry,
  1538. struct task_struct *task, const void *ptr)
  1539. {
  1540. const struct file *file = ptr;
  1541. struct proc_inode *ei;
  1542. struct inode *inode;
  1543. if (!file)
  1544. return ERR_PTR(-ENOENT);
  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 (file->f_mode & FMODE_READ)
  1554. inode->i_mode |= S_IRUSR;
  1555. if (file->f_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. result = proc_map_files_instantiate(dir, dentry, task, vma->vm_file);
  1590. out_no_vma:
  1591. up_read(&mm->mmap_sem);
  1592. mmput(mm);
  1593. out_put_task:
  1594. put_task_struct(task);
  1595. out:
  1596. return result;
  1597. }
  1598. static const struct inode_operations proc_map_files_inode_operations = {
  1599. .lookup = proc_map_files_lookup,
  1600. .permission = proc_fd_permission,
  1601. .setattr = proc_setattr,
  1602. };
  1603. static int
  1604. proc_map_files_readdir(struct file *filp, void *dirent, filldir_t filldir)
  1605. {
  1606. struct dentry *dentry = filp->f_path.dentry;
  1607. struct inode *inode = dentry->d_inode;
  1608. struct vm_area_struct *vma;
  1609. struct task_struct *task;
  1610. struct mm_struct *mm;
  1611. ino_t ino;
  1612. int ret;
  1613. ret = -EACCES;
  1614. if (!capable(CAP_SYS_ADMIN))
  1615. goto out;
  1616. ret = -ENOENT;
  1617. task = get_proc_task(inode);
  1618. if (!task)
  1619. goto out;
  1620. ret = -EACCES;
  1621. if (!ptrace_may_access(task, PTRACE_MODE_READ))
  1622. goto out_put_task;
  1623. ret = 0;
  1624. switch (filp->f_pos) {
  1625. case 0:
  1626. ino = inode->i_ino;
  1627. if (filldir(dirent, ".", 1, 0, ino, DT_DIR) < 0)
  1628. goto out_put_task;
  1629. filp->f_pos++;
  1630. case 1:
  1631. ino = parent_ino(dentry);
  1632. if (filldir(dirent, "..", 2, 1, ino, DT_DIR) < 0)
  1633. goto out_put_task;
  1634. filp->f_pos++;
  1635. default:
  1636. {
  1637. unsigned long nr_files, pos, i;
  1638. struct flex_array *fa = NULL;
  1639. struct map_files_info info;
  1640. struct map_files_info *p;
  1641. mm = get_task_mm(task);
  1642. if (!mm)
  1643. goto out_put_task;
  1644. down_read(&mm->mmap_sem);
  1645. nr_files = 0;
  1646. /*
  1647. * We need two passes here:
  1648. *
  1649. * 1) Collect vmas of mapped files with mmap_sem taken
  1650. * 2) Release mmap_sem and instantiate entries
  1651. *
  1652. * otherwise we get lockdep complained, since filldir()
  1653. * routine might require mmap_sem taken in might_fault().
  1654. */
  1655. for (vma = mm->mmap, pos = 2; vma; vma = vma->vm_next) {
  1656. if (vma->vm_file && ++pos > filp->f_pos)
  1657. nr_files++;
  1658. }
  1659. if (nr_files) {
  1660. fa = flex_array_alloc(sizeof(info), nr_files,
  1661. GFP_KERNEL);
  1662. if (!fa || flex_array_prealloc(fa, 0, nr_files,
  1663. GFP_KERNEL)) {
  1664. ret = -ENOMEM;
  1665. if (fa)
  1666. flex_array_free(fa);
  1667. up_read(&mm->mmap_sem);
  1668. mmput(mm);
  1669. goto out_put_task;
  1670. }
  1671. for (i = 0, vma = mm->mmap, pos = 2; vma;
  1672. vma = vma->vm_next) {
  1673. if (!vma->vm_file)
  1674. continue;
  1675. if (++pos <= filp->f_pos)
  1676. continue;
  1677. get_file(vma->vm_file);
  1678. info.file = vma->vm_file;
  1679. info.len = snprintf(info.name,
  1680. sizeof(info.name), "%lx-%lx",
  1681. vma->vm_start, vma->vm_end);
  1682. if (flex_array_put(fa, i++, &info, GFP_KERNEL))
  1683. BUG();
  1684. }
  1685. }
  1686. up_read(&mm->mmap_sem);
  1687. for (i = 0; i < nr_files; i++) {
  1688. p = flex_array_get(fa, i);
  1689. ret = proc_fill_cache(filp, dirent, filldir,
  1690. p->name, p->len,
  1691. proc_map_files_instantiate,
  1692. task, p->file);
  1693. if (ret)
  1694. break;
  1695. filp->f_pos++;
  1696. fput(p->file);
  1697. }
  1698. for (; i < nr_files; i++) {
  1699. /*
  1700. * In case of error don't forget
  1701. * to put rest of file refs.
  1702. */
  1703. p = flex_array_get(fa, i);
  1704. fput(p->file);
  1705. }
  1706. if (fa)
  1707. flex_array_free(fa);
  1708. mmput(mm);
  1709. }
  1710. }
  1711. out_put_task:
  1712. put_task_struct(task);
  1713. out:
  1714. return ret;
  1715. }
  1716. static const struct file_operations proc_map_files_operations = {
  1717. .read = generic_read_dir,
  1718. .readdir = proc_map_files_readdir,
  1719. .llseek = default_llseek,
  1720. };
  1721. #endif /* CONFIG_CHECKPOINT_RESTORE */
  1722. static struct dentry *proc_pident_instantiate(struct inode *dir,
  1723. struct dentry *dentry, struct task_struct *task, const void *ptr)
  1724. {
  1725. const struct pid_entry *p = ptr;
  1726. struct inode *inode;
  1727. struct proc_inode *ei;
  1728. struct dentry *error = ERR_PTR(-ENOENT);
  1729. inode = proc_pid_make_inode(dir->i_sb, task);
  1730. if (!inode)
  1731. goto out;
  1732. ei = PROC_I(inode);
  1733. inode->i_mode = p->mode;
  1734. if (S_ISDIR(inode->i_mode))
  1735. set_nlink(inode, 2); /* Use getattr to fix if necessary */
  1736. if (p->iop)
  1737. inode->i_op = p->iop;
  1738. if (p->fop)
  1739. inode->i_fop = p->fop;
  1740. ei->op = p->op;
  1741. d_set_d_op(dentry, &pid_dentry_operations);
  1742. d_add(dentry, inode);
  1743. /* Close the race of the process dying before we return the dentry */
  1744. if (pid_revalidate(dentry, 0))
  1745. error = NULL;
  1746. out:
  1747. return error;
  1748. }
  1749. static struct dentry *proc_pident_lookup(struct inode *dir,
  1750. struct dentry *dentry,
  1751. const struct pid_entry *ents,
  1752. unsigned int nents)
  1753. {
  1754. struct dentry *error;
  1755. struct task_struct *task = get_proc_task(dir);
  1756. const struct pid_entry *p, *last;
  1757. error = ERR_PTR(-ENOENT);
  1758. if (!task)
  1759. goto out_no_task;
  1760. /*
  1761. * Yes, it does not scale. And it should not. Don't add
  1762. * new entries into /proc/<tgid>/ without very good reasons.
  1763. */
  1764. last = &ents[nents - 1];
  1765. for (p = ents; p <= last; p++) {
  1766. if (p->len != dentry->d_name.len)
  1767. continue;
  1768. if (!memcmp(dentry->d_name.name, p->name, p->len))
  1769. break;
  1770. }
  1771. if (p > last)
  1772. goto out;
  1773. error = proc_pident_instantiate(dir, dentry, task, p);
  1774. out:
  1775. put_task_struct(task);
  1776. out_no_task:
  1777. return error;
  1778. }
  1779. static int proc_pident_fill_cache(struct file *filp, void *dirent,
  1780. filldir_t filldir, struct task_struct *task, const struct pid_entry *p)
  1781. {
  1782. return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
  1783. proc_pident_instantiate, task, p);
  1784. }
  1785. static int proc_pident_readdir(struct file *filp,
  1786. void *dirent, filldir_t filldir,
  1787. const struct pid_entry *ents, unsigned int nents)
  1788. {
  1789. int i;
  1790. struct dentry *dentry = filp->f_path.dentry;
  1791. struct inode *inode = dentry->d_inode;
  1792. struct task_struct *task = get_proc_task(inode);
  1793. const struct pid_entry *p, *last;
  1794. ino_t ino;
  1795. int ret;
  1796. ret = -ENOENT;
  1797. if (!task)
  1798. goto out_no_task;
  1799. ret = 0;
  1800. i = filp->f_pos;
  1801. switch (i) {
  1802. case 0:
  1803. ino = inode->i_ino;
  1804. if (filldir(dirent, ".", 1, i, ino, DT_DIR) < 0)
  1805. goto out;
  1806. i++;
  1807. filp->f_pos++;
  1808. /* fall through */
  1809. case 1:
  1810. ino = parent_ino(dentry);
  1811. if (filldir(dirent, "..", 2, i, ino, DT_DIR) < 0)
  1812. goto out;
  1813. i++;
  1814. filp->f_pos++;
  1815. /* fall through */
  1816. default:
  1817. i -= 2;
  1818. if (i >= nents) {
  1819. ret = 1;
  1820. goto out;
  1821. }
  1822. p = ents + i;
  1823. last = &ents[nents - 1];
  1824. while (p <= last) {
  1825. if (proc_pident_fill_cache(filp, dirent, filldir, task, p) < 0)
  1826. goto out;
  1827. filp->f_pos++;
  1828. p++;
  1829. }
  1830. }
  1831. ret = 1;
  1832. out:
  1833. put_task_struct(task);
  1834. out_no_task:
  1835. return ret;
  1836. }
  1837. #ifdef CONFIG_SECURITY
  1838. static ssize_t proc_pid_attr_read(struct file * file, char __user * buf,
  1839. size_t count, loff_t *ppos)
  1840. {
  1841. struct inode * inode = file->f_path.dentry->d_inode;
  1842. char *p = NULL;
  1843. ssize_t length;
  1844. struct task_struct *task = get_proc_task(inode);
  1845. if (!task)
  1846. return -ESRCH;
  1847. length = security_getprocattr(task,
  1848. (char*)file->f_path.dentry->d_name.name,
  1849. &p);
  1850. put_task_struct(task);
  1851. if (length > 0)
  1852. length = simple_read_from_buffer(buf, count, ppos, p, length);
  1853. kfree(p);
  1854. return length;
  1855. }
  1856. static ssize_t proc_pid_attr_write(struct file * file, const char __user * buf,
  1857. size_t count, loff_t *ppos)
  1858. {
  1859. struct inode * inode = file->f_path.dentry->d_inode;
  1860. char *page;
  1861. ssize_t length;
  1862. struct task_struct *task = get_proc_task(inode);
  1863. length = -ESRCH;
  1864. if (!task)
  1865. goto out_no_task;
  1866. if (count > PAGE_SIZE)
  1867. count = PAGE_SIZE;
  1868. /* No partial writes. */
  1869. length = -EINVAL;
  1870. if (*ppos != 0)
  1871. goto out;
  1872. length = -ENOMEM;
  1873. page = (char*)__get_free_page(GFP_TEMPORARY);
  1874. if (!page)
  1875. goto out;
  1876. length = -EFAULT;
  1877. if (copy_from_user(page, buf, count))
  1878. goto out_free;
  1879. /* Guard against adverse ptrace interaction */
  1880. length = mutex_lock_interruptible(&task->signal->cred_guard_mutex);
  1881. if (length < 0)
  1882. goto out_free;
  1883. length = security_setprocattr(task,
  1884. (char*)file->f_path.dentry->d_name.name,
  1885. (void*)page, count);
  1886. mutex_unlock(&task->signal->cred_guard_mutex);
  1887. out_free:
  1888. free_page((unsigned long) page);
  1889. out:
  1890. put_task_struct(task);
  1891. out_no_task:
  1892. return length;
  1893. }
  1894. static const struct file_operations proc_pid_attr_operations = {
  1895. .read = proc_pid_attr_read,
  1896. .write = proc_pid_attr_write,
  1897. .llseek = generic_file_llseek,
  1898. };
  1899. static const struct pid_entry attr_dir_stuff[] = {
  1900. REG("current", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1901. REG("prev", S_IRUGO, proc_pid_attr_operations),
  1902. REG("exec", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1903. REG("fscreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1904. REG("keycreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1905. REG("sockcreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
  1906. };
  1907. static int proc_attr_dir_readdir(struct file * filp,
  1908. void * dirent, filldir_t filldir)
  1909. {
  1910. return proc_pident_readdir(filp,dirent,filldir,
  1911. attr_dir_stuff,ARRAY_SIZE(attr_dir_stuff));
  1912. }
  1913. static const struct file_operations proc_attr_dir_operations = {
  1914. .read = generic_read_dir,
  1915. .readdir = proc_attr_dir_readdir,
  1916. .llseek = default_llseek,
  1917. };
  1918. static struct dentry *proc_attr_dir_lookup(struct inode *dir,
  1919. struct dentry *dentry, unsigned int flags)
  1920. {
  1921. return proc_pident_lookup(dir, dentry,
  1922. attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff));
  1923. }
  1924. static const struct inode_operations proc_attr_dir_inode_operations = {
  1925. .lookup = proc_attr_dir_lookup,
  1926. .getattr = pid_getattr,
  1927. .setattr = proc_setattr,
  1928. };
  1929. #endif
  1930. #ifdef CONFIG_ELF_CORE
  1931. static ssize_t proc_coredump_filter_read(struct file *file, char __user *buf,
  1932. size_t count, loff_t *ppos)
  1933. {
  1934. struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
  1935. struct mm_struct *mm;
  1936. char buffer[PROC_NUMBUF];
  1937. size_t len;
  1938. int ret;
  1939. if (!task)
  1940. return -ESRCH;
  1941. ret = 0;
  1942. mm = get_task_mm(task);
  1943. if (mm) {
  1944. len = snprintf(buffer, sizeof(buffer), "%08lx\n",
  1945. ((mm->flags & MMF_DUMP_FILTER_MASK) >>
  1946. MMF_DUMP_FILTER_SHIFT));
  1947. mmput(mm);
  1948. ret = simple_read_from_buffer(buf, count, ppos, buffer, len);
  1949. }
  1950. put_task_struct(task);
  1951. return ret;
  1952. }
  1953. static ssize_t proc_coredump_filter_write(struct file *file,
  1954. const char __user *buf,
  1955. size_t count,
  1956. loff_t *ppos)
  1957. {
  1958. struct task_struct *task;
  1959. struct mm_struct *mm;
  1960. char buffer[PROC_NUMBUF], *end;
  1961. unsigned int val;
  1962. int ret;
  1963. int i;
  1964. unsigned long mask;
  1965. ret = -EFAULT;
  1966. memset(buffer, 0, sizeof(buffer));
  1967. if (count > sizeof(buffer) - 1)
  1968. count = sizeof(buffer) - 1;
  1969. if (copy_from_user(buffer, buf, count))
  1970. goto out_no_task;
  1971. ret = -EINVAL;
  1972. val = (unsigned int)simple_strtoul(buffer, &end, 0);
  1973. if (*end == '\n')
  1974. end++;
  1975. if (end - buffer == 0)
  1976. goto out_no_task;
  1977. ret = -ESRCH;
  1978. task = get_proc_task(file->f_dentry->d_inode);
  1979. if (!task)
  1980. goto out_no_task;
  1981. ret = end - buffer;
  1982. mm = get_task_mm(task);
  1983. if (!mm)
  1984. goto out_no_mm;
  1985. for (i = 0, mask = 1; i < MMF_DUMP_FILTER_BITS; i++, mask <<= 1) {
  1986. if (val & mask)
  1987. set_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);
  1988. else
  1989. clear_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);
  1990. }
  1991. mmput(mm);
  1992. out_no_mm:
  1993. put_task_struct(task);
  1994. out_no_task:
  1995. return ret;
  1996. }
  1997. static const struct file_operations proc_coredump_filter_operations = {
  1998. .read = proc_coredump_filter_read,
  1999. .write = proc_coredump_filter_write,
  2000. .llseek = generic_file_llseek,
  2001. };
  2002. #endif
  2003. /*
  2004. * /proc/self:
  2005. */
  2006. static int proc_self_readlink(struct dentry *dentry, char __user *buffer,
  2007. int buflen)
  2008. {
  2009. struct pid_namespace *ns = dentry->d_sb->s_fs_info;
  2010. pid_t tgid = task_tgid_nr_ns(current, ns);
  2011. char tmp[PROC_NUMBUF];
  2012. if (!tgid)
  2013. return -ENOENT;
  2014. sprintf(tmp, "%d", tgid);
  2015. return vfs_readlink(dentry,buffer,buflen,tmp);
  2016. }
  2017. static void *proc_self_follow_link(struct dentry *dentry, struct nameidata *nd)
  2018. {
  2019. struct pid_namespace *ns = dentry->d_sb->s_fs_info;
  2020. pid_t tgid = task_tgid_nr_ns(current, ns);
  2021. char *name = ERR_PTR(-ENOENT);
  2022. if (tgid) {
  2023. name = __getname();
  2024. if (!name)
  2025. name = ERR_PTR(-ENOMEM);
  2026. else
  2027. sprintf(name, "%d", tgid);
  2028. }
  2029. nd_set_link(nd, name);
  2030. return NULL;
  2031. }
  2032. static void proc_self_put_link(struct dentry *dentry, struct nameidata *nd,
  2033. void *cookie)
  2034. {
  2035. char *s = nd_get_link(nd);
  2036. if (!IS_ERR(s))
  2037. __putname(s);
  2038. }
  2039. static const struct inode_operations proc_self_inode_operations = {
  2040. .readlink = proc_self_readlink,
  2041. .follow_link = proc_self_follow_link,
  2042. .put_link = proc_self_put_link,
  2043. };
  2044. /*
  2045. * proc base
  2046. *
  2047. * These are the directory entries in the root directory of /proc
  2048. * that properly belong to the /proc filesystem, as they describe
  2049. * describe something that is process related.
  2050. */
  2051. static const struct pid_entry proc_base_stuff[] = {
  2052. NOD("self", S_IFLNK|S_IRWXUGO,
  2053. &proc_self_inode_operations, NULL, {}),
  2054. };
  2055. static struct dentry *proc_base_instantiate(struct inode *dir,
  2056. struct dentry *dentry, struct task_struct *task, const void *ptr)
  2057. {
  2058. const struct pid_entry *p = ptr;
  2059. struct inode *inode;
  2060. struct proc_inode *ei;
  2061. struct dentry *error;
  2062. /* Allocate the inode */
  2063. error = ERR_PTR(-ENOMEM);
  2064. inode = new_inode(dir->i_sb);
  2065. if (!inode)
  2066. goto out;
  2067. /* Initialize the inode */
  2068. ei = PROC_I(inode);
  2069. inode->i_ino = get_next_ino();
  2070. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  2071. /*
  2072. * grab the reference to the task.
  2073. */
  2074. ei->pid = get_task_pid(task, PIDTYPE_PID);
  2075. if (!ei->pid)
  2076. goto out_iput;
  2077. inode->i_mode = p->mode;
  2078. if (S_ISDIR(inode->i_mode))
  2079. set_nlink(inode, 2);
  2080. if (S_ISLNK(inode->i_mode))
  2081. inode->i_size = 64;
  2082. if (p->iop)
  2083. inode->i_op = p->iop;
  2084. if (p->fop)
  2085. inode->i_fop = p->fop;
  2086. ei->op = p->op;
  2087. d_add(dentry, inode);
  2088. error = NULL;
  2089. out:
  2090. return error;
  2091. out_iput:
  2092. iput(inode);
  2093. goto out;
  2094. }
  2095. static struct dentry *proc_base_lookup(struct inode *dir, struct dentry *dentry)
  2096. {
  2097. struct dentry *error;
  2098. struct task_struct *task = get_proc_task(dir);
  2099. const struct pid_entry *p, *last;
  2100. error = ERR_PTR(-ENOENT);
  2101. if (!task)
  2102. goto out_no_task;
  2103. /* Lookup the directory entry */
  2104. last = &proc_base_stuff[ARRAY_SIZE(proc_base_stuff) - 1];
  2105. for (p = proc_base_stuff; p <= last; p++) {
  2106. if (p->len != dentry->d_name.len)
  2107. continue;
  2108. if (!memcmp(dentry->d_name.name, p->name, p->len))
  2109. break;
  2110. }
  2111. if (p > last)
  2112. goto out;
  2113. error = proc_base_instantiate(dir, dentry, task, p);
  2114. out:
  2115. put_task_struct(task);
  2116. out_no_task:
  2117. return error;
  2118. }
  2119. static int proc_base_fill_cache(struct file *filp, void *dirent,
  2120. filldir_t filldir, struct task_struct *task, const struct pid_entry *p)
  2121. {
  2122. return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
  2123. proc_base_instantiate, task, p);
  2124. }
  2125. #ifdef CONFIG_TASK_IO_ACCOUNTING
  2126. static int do_io_accounting(struct task_struct *task, char *buffer, int whole)
  2127. {
  2128. struct task_io_accounting acct = task->ioac;
  2129. unsigned long flags;
  2130. int result;
  2131. result = mutex_lock_killable(&task->signal->cred_guard_mutex);
  2132. if (result)
  2133. return result;
  2134. if (!ptrace_may_access(task, PTRACE_MODE_READ)) {
  2135. result = -EACCES;
  2136. goto out_unlock;
  2137. }
  2138. if (whole && lock_task_sighand(task, &flags)) {
  2139. struct task_struct *t = task;
  2140. task_io_accounting_add(&acct, &task->signal->ioac);
  2141. while_each_thread(task, t)
  2142. task_io_accounting_add(&acct, &t->ioac);
  2143. unlock_task_sighand(task, &flags);
  2144. }
  2145. result = sprintf(buffer,
  2146. "rchar: %llu\n"
  2147. "wchar: %llu\n"
  2148. "syscr: %llu\n"
  2149. "syscw: %llu\n"
  2150. "read_bytes: %llu\n"
  2151. "write_bytes: %llu\n"
  2152. "cancelled_write_bytes: %llu\n",
  2153. (unsigned long long)acct.rchar,
  2154. (unsigned long long)acct.wchar,
  2155. (unsigned long long)acct.syscr,
  2156. (unsigned long long)acct.syscw,
  2157. (unsigned long long)acct.read_bytes,
  2158. (unsigned long long)acct.write_bytes,
  2159. (unsigned long long)acct.cancelled_write_bytes);
  2160. out_unlock:
  2161. mutex_unlock(&task->signal->cred_guard_mutex);
  2162. return result;
  2163. }
  2164. static int proc_tid_io_accounting(struct task_struct *task, char *buffer)
  2165. {
  2166. return do_io_accounting(task, buffer, 0);
  2167. }
  2168. static int proc_tgid_io_accounting(struct task_struct *task, char *buffer)
  2169. {
  2170. return do_io_accounting(task, buffer, 1);
  2171. }
  2172. #endif /* CONFIG_TASK_IO_ACCOUNTING */
  2173. #ifdef CONFIG_USER_NS
  2174. static int proc_id_map_open(struct inode *inode, struct file *file,
  2175. struct seq_operations *seq_ops)
  2176. {
  2177. struct user_namespace *ns = NULL;
  2178. struct task_struct *task;
  2179. struct seq_file *seq;
  2180. int ret = -EINVAL;
  2181. task = get_proc_task(inode);
  2182. if (task) {
  2183. rcu_read_lock();
  2184. ns = get_user_ns(task_cred_xxx(task, user_ns));
  2185. rcu_read_unlock();
  2186. put_task_struct(task);
  2187. }
  2188. if (!ns)
  2189. goto err;
  2190. ret = seq_open(file, seq_ops);
  2191. if (ret)
  2192. goto err_put_ns;
  2193. seq = file->private_data;
  2194. seq->private = ns;
  2195. return 0;
  2196. err_put_ns:
  2197. put_user_ns(ns);
  2198. err:
  2199. return ret;
  2200. }
  2201. static int proc_id_map_release(struct inode *inode, struct file *file)
  2202. {
  2203. struct seq_file *seq = file->private_data;
  2204. struct user_namespace *ns = seq->private;
  2205. put_user_ns(ns);
  2206. return seq_release(inode, file);
  2207. }
  2208. static int proc_uid_map_open(struct inode *inode, struct file *file)
  2209. {
  2210. return proc_id_map_open(inode, file, &proc_uid_seq_operations);
  2211. }
  2212. static int proc_gid_map_open(struct inode *inode, struct file *file)
  2213. {
  2214. return proc_id_map_open(inode, file, &proc_gid_seq_operations);
  2215. }
  2216. static const struct file_operations proc_uid_map_operations = {
  2217. .open = proc_uid_map_open,
  2218. .write = proc_uid_map_write,
  2219. .read = seq_read,
  2220. .llseek = seq_lseek,
  2221. .release = proc_id_map_release,
  2222. };
  2223. static const struct file_operations proc_gid_map_operations = {
  2224. .open = proc_gid_map_open,
  2225. .write = proc_gid_map_write,
  2226. .read = seq_read,
  2227. .llseek = seq_lseek,
  2228. .release = proc_id_map_release,
  2229. };
  2230. #endif /* CONFIG_USER_NS */
  2231. static int proc_pid_personality(struct seq_file *m, struct pid_namespace *ns,
  2232. struct pid *pid, struct task_struct *task)
  2233. {
  2234. int err = lock_trace(task);
  2235. if (!err) {
  2236. seq_printf(m, "%08x\n", task->personality);
  2237. unlock_trace(task);
  2238. }
  2239. return err;
  2240. }
  2241. /*
  2242. * Thread groups
  2243. */
  2244. static const struct file_operations proc_task_operations;
  2245. static const struct inode_operations proc_task_inode_operations;
  2246. static const struct pid_entry tgid_base_stuff[] = {
  2247. DIR("task", S_IRUGO|S_IXUGO, proc_task_inode_operations, proc_task_operations),
  2248. DIR("fd", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),
  2249. #ifdef CONFIG_CHECKPOINT_RESTORE
  2250. DIR("map_files", S_IRUSR|S_IXUSR, proc_map_files_inode_operations, proc_map_files_operations),
  2251. #endif
  2252. DIR("fdinfo", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),
  2253. DIR("ns", S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),
  2254. #ifdef CONFIG_NET
  2255. DIR("net", S_IRUGO|S_IXUGO, proc_net_inode_operations, proc_net_operations),
  2256. #endif
  2257. REG("environ", S_IRUSR, proc_environ_operations),
  2258. INF("auxv", S_IRUSR, proc_pid_auxv),
  2259. ONE("status", S_IRUGO, proc_pid_status),
  2260. ONE("personality", S_IRUGO, proc_pid_personality),
  2261. INF("limits", S_IRUGO, proc_pid_limits),
  2262. #ifdef CONFIG_SCHED_DEBUG
  2263. REG("sched", S_IRUGO|S_IWUSR, proc_pid_sched_operations),
  2264. #endif
  2265. #ifdef CONFIG_SCHED_AUTOGROUP
  2266. REG("autogroup", S_IRUGO|S_IWUSR, proc_pid_sched_autogroup_operations),
  2267. #endif
  2268. REG("comm", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),
  2269. #ifdef CONFIG_HAVE_ARCH_TRACEHOOK
  2270. INF("syscall", S_IRUGO, proc_pid_syscall),
  2271. #endif
  2272. INF("cmdline", S_IRUGO, proc_pid_cmdline),
  2273. ONE("stat", S_IRUGO, proc_tgid_stat),
  2274. ONE("statm", S_IRUGO, proc_pid_statm),
  2275. REG("maps", S_IRUGO, proc_pid_maps_operations),
  2276. #ifdef CONFIG_NUMA
  2277. REG("numa_maps", S_IRUGO, proc_pid_numa_maps_operations),
  2278. #endif
  2279. REG("mem", S_IRUSR|S_IWUSR, proc_mem_operations),
  2280. LNK("cwd", proc_cwd_link),
  2281. LNK("root", proc_root_link),
  2282. LNK("exe", proc_exe_link),
  2283. REG("mounts", S_IRUGO, proc_mounts_operations),
  2284. REG("mountinfo", S_IRUGO, proc_mountinfo_operations),
  2285. REG("mountstats", S_IRUSR, proc_mountstats_operations),
  2286. #ifdef CONFIG_PROC_PAGE_MONITOR
  2287. REG("clear_refs", S_IWUSR, proc_clear_refs_operations),
  2288. REG("smaps", S_IRUGO, proc_pid_smaps_operations),
  2289. REG("pagemap", S_IRUGO, proc_pagemap_operations),
  2290. #endif
  2291. #ifdef CONFIG_SECURITY
  2292. DIR("attr", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),
  2293. #endif
  2294. #ifdef CONFIG_KALLSYMS
  2295. INF("wchan", S_IRUGO, proc_pid_wchan),
  2296. #endif
  2297. #ifdef CONFIG_STACKTRACE
  2298. ONE("stack", S_IRUGO, proc_pid_stack),
  2299. #endif
  2300. #ifdef CONFIG_SCHEDSTATS
  2301. INF("schedstat", S_IRUGO, proc_pid_schedstat),
  2302. #endif
  2303. #ifdef CONFIG_LATENCYTOP
  2304. REG("latency", S_IRUGO, proc_lstats_operations),
  2305. #endif
  2306. #ifdef CONFIG_PROC_PID_CPUSET
  2307. REG("cpuset", S_IRUGO, proc_cpuset_operations),
  2308. #endif
  2309. #ifdef CONFIG_CGROUPS
  2310. REG("cgroup", S_IRUGO, proc_cgroup_operations),
  2311. #endif
  2312. INF("oom_score", S_IRUGO, proc_oom_score),
  2313. REG("oom_adj", S_IRUGO|S_IWUSR, proc_oom_adjust_operations),
  2314. REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),
  2315. #ifdef CONFIG_AUDITSYSCALL
  2316. REG("loginuid", S_IWUSR|S_IRUGO, proc_loginuid_operations),
  2317. REG("sessionid", S_IRUGO, proc_sessionid_operations),
  2318. #endif
  2319. #ifdef CONFIG_FAULT_INJECTION
  2320. REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations),
  2321. #endif
  2322. #ifdef CONFIG_ELF_CORE
  2323. REG("coredump_filter", S_IRUGO|S_IWUSR, proc_coredump_filter_operations),
  2324. #endif
  2325. #ifdef CONFIG_TASK_IO_ACCOUNTING
  2326. INF("io", S_IRUSR, proc_tgid_io_accounting),
  2327. #endif
  2328. #ifdef CONFIG_HARDWALL
  2329. INF("hardwall", S_IRUGO, proc_pid_hardwall),
  2330. #endif
  2331. #ifdef CONFIG_USER_NS
  2332. REG("uid_map", S_IRUGO|S_IWUSR, proc_uid_map_operations),
  2333. REG("gid_map", S_IRUGO|S_IWUSR, proc_gid_map_operations),
  2334. #endif
  2335. };
  2336. static int proc_tgid_base_readdir(struct file * filp,
  2337. void * dirent, filldir_t filldir)
  2338. {
  2339. return proc_pident_readdir(filp,dirent,filldir,
  2340. tgid_base_stuff,ARRAY_SIZE(tgid_base_stuff));
  2341. }
  2342. static const struct file_operations proc_tgid_base_operations = {
  2343. .read = generic_read_dir,
  2344. .readdir = proc_tgid_base_readdir,
  2345. .llseek = default_llseek,
  2346. };
  2347. static struct dentry *proc_tgid_base_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
  2348. {
  2349. return proc_pident_lookup(dir, dentry,
  2350. tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));
  2351. }
  2352. static const struct inode_operations proc_tgid_base_inode_operations = {
  2353. .lookup = proc_tgid_base_lookup,
  2354. .getattr = pid_getattr,
  2355. .setattr = proc_setattr,
  2356. .permission = proc_pid_permission,
  2357. };
  2358. static void proc_flush_task_mnt(struct vfsmount *mnt, pid_t pid, pid_t tgid)
  2359. {
  2360. struct dentry *dentry, *leader, *dir;
  2361. char buf[PROC_NUMBUF];
  2362. struct qstr name;
  2363. name.name = buf;
  2364. name.len = snprintf(buf, sizeof(buf), "%d", pid);
  2365. dentry = d_hash_and_lookup(mnt->mnt_root, &name);
  2366. if (dentry) {
  2367. shrink_dcache_parent(dentry);
  2368. d_drop(dentry);
  2369. dput(dentry);
  2370. }
  2371. name.name = buf;
  2372. name.len = snprintf(buf, sizeof(buf), "%d", tgid);
  2373. leader = d_hash_and_lookup(mnt->mnt_root, &name);
  2374. if (!leader)
  2375. goto out;
  2376. name.name = "task";
  2377. name.len = strlen(name.name);
  2378. dir = d_hash_and_lookup(leader, &name);
  2379. if (!dir)
  2380. goto out_put_leader;
  2381. name.name = buf;
  2382. name.len = snprintf(buf, sizeof(buf), "%d", pid);
  2383. dentry = d_hash_and_lookup(dir, &name);
  2384. if (dentry) {
  2385. shrink_dcache_parent(dentry);
  2386. d_drop(dentry);
  2387. dput(dentry);
  2388. }
  2389. dput(dir);
  2390. out_put_leader:
  2391. dput(leader);
  2392. out:
  2393. return;
  2394. }
  2395. /**
  2396. * proc_flush_task - Remove dcache entries for @task from the /proc dcache.
  2397. * @task: task that should be flushed.
  2398. *
  2399. * When flushing dentries from proc, one needs to flush them from global
  2400. * proc (proc_mnt) and from all the namespaces' procs this task was seen
  2401. * in. This call is supposed to do all of this job.
  2402. *
  2403. * Looks in the dcache for
  2404. * /proc/@pid
  2405. * /proc/@tgid/task/@pid
  2406. * if either directory is present flushes it and all of it'ts children
  2407. * from the dcache.
  2408. *
  2409. * It is safe and reasonable to cache /proc entries for a task until
  2410. * that task exits. After that they just clog up the dcache with
  2411. * useless entries, possibly causing useful dcache entries to be
  2412. * flushed instead. This routine is proved to flush those useless
  2413. * dcache entries at process exit time.
  2414. *
  2415. * NOTE: This routine is just an optimization so it does not guarantee
  2416. * that no dcache entries will exist at process exit time it
  2417. * just makes it very unlikely that any will persist.
  2418. */
  2419. void proc_flush_task(struct task_struct *task)
  2420. {
  2421. int i;
  2422. struct pid *pid, *tgid;
  2423. struct upid *upid;
  2424. pid = task_pid(task);
  2425. tgid = task_tgid(task);
  2426. for (i = 0; i <= pid->level; i++) {
  2427. upid = &pid->numbers[i];
  2428. proc_flush_task_mnt(upid->ns->proc_mnt, upid->nr,
  2429. tgid->numbers[i].nr);
  2430. }
  2431. upid = &pid->numbers[pid->level];
  2432. if (upid->nr == 1)
  2433. pid_ns_release_proc(upid->ns);
  2434. }
  2435. static struct dentry *proc_pid_instantiate(struct inode *dir,
  2436. struct dentry * dentry,
  2437. struct task_struct *task, const void *ptr)
  2438. {
  2439. struct dentry *error = ERR_PTR(-ENOENT);
  2440. struct inode *inode;
  2441. inode = proc_pid_make_inode(dir->i_sb, task);
  2442. if (!inode)
  2443. goto out;
  2444. inode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;
  2445. inode->i_op = &proc_tgid_base_inode_operations;
  2446. inode->i_fop = &proc_tgid_base_operations;
  2447. inode->i_flags|=S_IMMUTABLE;
  2448. set_nlink(inode, 2 + pid_entry_count_dirs(tgid_base_stuff,
  2449. ARRAY_SIZE(tgid_base_stuff)));
  2450. d_set_d_op(dentry, &pid_dentry_operations);
  2451. d_add(dentry, inode);
  2452. /* Close the race of the process dying before we return the dentry */
  2453. if (pid_revalidate(dentry, 0))
  2454. error = NULL;
  2455. out:
  2456. return error;
  2457. }
  2458. struct dentry *proc_pid_lookup(struct inode *dir, struct dentry * dentry, unsigned int flags)
  2459. {
  2460. struct dentry *result;
  2461. struct task_struct *task;
  2462. unsigned tgid;
  2463. struct pid_namespace *ns;
  2464. result = proc_base_lookup(dir, dentry);
  2465. if (!IS_ERR(result) || PTR_ERR(result) != -ENOENT)
  2466. goto out;
  2467. tgid = name_to_int(dentry);
  2468. if (tgid == ~0U)
  2469. goto out;
  2470. ns = dentry->d_sb->s_fs_info;
  2471. rcu_read_lock();
  2472. task = find_task_by_pid_ns(tgid, ns);
  2473. if (task)
  2474. get_task_struct(task);
  2475. rcu_read_unlock();
  2476. if (!task)
  2477. goto out;
  2478. result = proc_pid_instantiate(dir, dentry, task, NULL);
  2479. put_task_struct(task);
  2480. out:
  2481. return result;
  2482. }
  2483. /*
  2484. * Find the first task with tgid >= tgid
  2485. *
  2486. */
  2487. struct tgid_iter {
  2488. unsigned int tgid;
  2489. struct task_struct *task;
  2490. };
  2491. static struct tgid_iter next_tgid(struct pid_namespace *ns, struct tgid_iter iter)
  2492. {
  2493. struct pid *pid;
  2494. if (iter.task)
  2495. put_task_struct(iter.task);
  2496. rcu_read_lock();
  2497. retry:
  2498. iter.task = NULL;
  2499. pid = find_ge_pid(iter.tgid, ns);
  2500. if (pid) {
  2501. iter.tgid = pid_nr_ns(pid, ns);
  2502. iter.task = pid_task(pid, PIDTYPE_PID);
  2503. /* What we to know is if the pid we have find is the
  2504. * pid of a thread_group_leader. Testing for task
  2505. * being a thread_group_leader is the obvious thing
  2506. * todo but there is a window when it fails, due to
  2507. * the pid transfer logic in de_thread.
  2508. *
  2509. * So we perform the straight forward test of seeing
  2510. * if the pid we have found is the pid of a thread
  2511. * group leader, and don't worry if the task we have
  2512. * found doesn't happen to be a thread group leader.
  2513. * As we don't care in the case of readdir.
  2514. */
  2515. if (!iter.task || !has_group_leader_pid(iter.task)) {
  2516. iter.tgid += 1;
  2517. goto retry;
  2518. }
  2519. get_task_struct(iter.task);
  2520. }
  2521. rcu_read_unlock();
  2522. return iter;
  2523. }
  2524. #define TGID_OFFSET (FIRST_PROCESS_ENTRY + ARRAY_SIZE(proc_base_stuff))
  2525. static int proc_pid_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
  2526. struct tgid_iter iter)
  2527. {
  2528. char name[PROC_NUMBUF];
  2529. int len = snprintf(name, sizeof(name), "%d", iter.tgid);
  2530. return proc_fill_cache(filp, dirent, filldir, name, len,
  2531. proc_pid_instantiate, iter.task, NULL);
  2532. }
  2533. static int fake_filldir(void *buf, const char *name, int namelen,
  2534. loff_t offset, u64 ino, unsigned d_type)
  2535. {
  2536. return 0;
  2537. }
  2538. /* for the /proc/ directory itself, after non-process stuff has been done */
  2539. int proc_pid_readdir(struct file * filp, void * dirent, filldir_t filldir)
  2540. {
  2541. unsigned int nr;
  2542. struct task_struct *reaper;
  2543. struct tgid_iter iter;
  2544. struct pid_namespace *ns;
  2545. filldir_t __filldir;
  2546. if (filp->f_pos >= PID_MAX_LIMIT + TGID_OFFSET)
  2547. goto out_no_task;
  2548. nr = filp->f_pos - FIRST_PROCESS_ENTRY;
  2549. reaper = get_proc_task(filp->f_path.dentry->d_inode);
  2550. if (!reaper)
  2551. goto out_no_task;
  2552. for (; nr < ARRAY_SIZE(proc_base_stuff); filp->f_pos++, nr++) {
  2553. const struct pid_entry *p = &proc_base_stuff[nr];
  2554. if (proc_base_fill_cache(filp, dirent, filldir, reaper, p) < 0)
  2555. goto out;
  2556. }
  2557. ns = filp->f_dentry->d_sb->s_fs_info;
  2558. iter.task = NULL;
  2559. iter.tgid = filp->f_pos - TGID_OFFSET;
  2560. for (iter = next_tgid(ns, iter);
  2561. iter.task;
  2562. iter.tgid += 1, iter = next_tgid(ns, iter)) {
  2563. if (has_pid_permissions(ns, iter.task, 2))
  2564. __filldir = filldir;
  2565. else
  2566. __filldir = fake_filldir;
  2567. filp->f_pos = iter.tgid + TGID_OFFSET;
  2568. if (proc_pid_fill_cache(filp, dirent, __filldir, iter) < 0) {
  2569. put_task_struct(iter.task);
  2570. goto out;
  2571. }
  2572. }
  2573. filp->f_pos = PID_MAX_LIMIT + TGID_OFFSET;
  2574. out:
  2575. put_task_struct(reaper);
  2576. out_no_task:
  2577. return 0;
  2578. }
  2579. /*
  2580. * Tasks
  2581. */
  2582. static const struct pid_entry tid_base_stuff[] = {
  2583. DIR("fd", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),
  2584. DIR("fdinfo", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),
  2585. DIR("ns", S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),
  2586. REG("environ", S_IRUSR, proc_environ_operations),
  2587. INF("auxv", S_IRUSR, proc_pid_auxv),
  2588. ONE("status", S_IRUGO, proc_pid_status),
  2589. ONE("personality", S_IRUGO, proc_pid_personality),
  2590. INF("limits", S_IRUGO, proc_pid_limits),
  2591. #ifdef CONFIG_SCHED_DEBUG
  2592. REG("sched", S_IRUGO|S_IWUSR, proc_pid_sched_operations),
  2593. #endif
  2594. REG("comm", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),
  2595. #ifdef CONFIG_HAVE_ARCH_TRACEHOOK
  2596. INF("syscall", S_IRUGO, proc_pid_syscall),
  2597. #endif
  2598. INF("cmdline", S_IRUGO, proc_pid_cmdline),
  2599. ONE("stat", S_IRUGO, proc_tid_stat),
  2600. ONE("statm", S_IRUGO, proc_pid_statm),
  2601. REG("maps", S_IRUGO, proc_tid_maps_operations),
  2602. #ifdef CONFIG_CHECKPOINT_RESTORE
  2603. REG("children", S_IRUGO, proc_tid_children_operations),
  2604. #endif
  2605. #ifdef CONFIG_NUMA
  2606. REG("numa_maps", S_IRUGO, proc_tid_numa_maps_operations),
  2607. #endif
  2608. REG("mem", S_IRUSR|S_IWUSR, proc_mem_operations),
  2609. LNK("cwd", proc_cwd_link),
  2610. LNK("root", proc_root_link),
  2611. LNK("exe", proc_exe_link),
  2612. REG("mounts", S_IRUGO, proc_mounts_operations),
  2613. REG("mountinfo", S_IRUGO, proc_mountinfo_operations),
  2614. #ifdef CONFIG_PROC_PAGE_MONITOR
  2615. REG("clear_refs", S_IWUSR, proc_clear_refs_operations),
  2616. REG("smaps", S_IRUGO, proc_tid_smaps_operations),
  2617. REG("pagemap", S_IRUGO, proc_pagemap_operations),
  2618. #endif
  2619. #ifdef CONFIG_SECURITY
  2620. DIR("attr", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),
  2621. #endif
  2622. #ifdef CONFIG_KALLSYMS
  2623. INF("wchan", S_IRUGO, proc_pid_wchan),
  2624. #endif
  2625. #ifdef CONFIG_STACKTRACE
  2626. ONE("stack", S_IRUGO, proc_pid_stack),
  2627. #endif
  2628. #ifdef CONFIG_SCHEDSTATS
  2629. INF("schedstat", S_IRUGO, proc_pid_schedstat),
  2630. #endif
  2631. #ifdef CONFIG_LATENCYTOP
  2632. REG("latency", S_IRUGO, proc_lstats_operations),
  2633. #endif
  2634. #ifdef CONFIG_PROC_PID_CPUSET
  2635. REG("cpuset", S_IRUGO, proc_cpuset_operations),
  2636. #endif
  2637. #ifdef CONFIG_CGROUPS
  2638. REG("cgroup", S_IRUGO, proc_cgroup_operations),
  2639. #endif
  2640. INF("oom_score", S_IRUGO, proc_oom_score),
  2641. REG("oom_adj", S_IRUGO|S_IWUSR, proc_oom_adjust_operations),
  2642. REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),
  2643. #ifdef CONFIG_AUDITSYSCALL
  2644. REG("loginuid", S_IWUSR|S_IRUGO, proc_loginuid_operations),
  2645. REG("sessionid", S_IRUGO, proc_sessionid_operations),
  2646. #endif
  2647. #ifdef CONFIG_FAULT_INJECTION
  2648. REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations),
  2649. #endif
  2650. #ifdef CONFIG_TASK_IO_ACCOUNTING
  2651. INF("io", S_IRUSR, proc_tid_io_accounting),
  2652. #endif
  2653. #ifdef CONFIG_HARDWALL
  2654. INF("hardwall", S_IRUGO, proc_pid_hardwall),
  2655. #endif
  2656. #ifdef CONFIG_USER_NS
  2657. REG("uid_map", S_IRUGO|S_IWUSR, proc_uid_map_operations),
  2658. REG("gid_map", S_IRUGO|S_IWUSR, proc_gid_map_operations),
  2659. #endif
  2660. };
  2661. static int proc_tid_base_readdir(struct file * filp,
  2662. void * dirent, filldir_t filldir)
  2663. {
  2664. return proc_pident_readdir(filp,dirent,filldir,
  2665. tid_base_stuff,ARRAY_SIZE(tid_base_stuff));
  2666. }
  2667. static struct dentry *proc_tid_base_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
  2668. {
  2669. return proc_pident_lookup(dir, dentry,
  2670. tid_base_stuff, ARRAY_SIZE(tid_base_stuff));
  2671. }
  2672. static const struct file_operations proc_tid_base_operations = {
  2673. .read = generic_read_dir,
  2674. .readdir = proc_tid_base_readdir,
  2675. .llseek = default_llseek,
  2676. };
  2677. static const struct inode_operations proc_tid_base_inode_operations = {
  2678. .lookup = proc_tid_base_lookup,
  2679. .getattr = pid_getattr,
  2680. .setattr = proc_setattr,
  2681. };
  2682. static struct dentry *proc_task_instantiate(struct inode *dir,
  2683. struct dentry *dentry, struct task_struct *task, const void *ptr)
  2684. {
  2685. struct dentry *error = ERR_PTR(-ENOENT);
  2686. struct inode *inode;
  2687. inode = proc_pid_make_inode(dir->i_sb, task);
  2688. if (!inode)
  2689. goto out;
  2690. inode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;
  2691. inode->i_op = &proc_tid_base_inode_operations;
  2692. inode->i_fop = &proc_tid_base_operations;
  2693. inode->i_flags|=S_IMMUTABLE;
  2694. set_nlink(inode, 2 + pid_entry_count_dirs(tid_base_stuff,
  2695. ARRAY_SIZE(tid_base_stuff)));
  2696. d_set_d_op(dentry, &pid_dentry_operations);
  2697. d_add(dentry, inode);
  2698. /* Close the race of the process dying before we return the dentry */
  2699. if (pid_revalidate(dentry, 0))
  2700. error = NULL;
  2701. out:
  2702. return error;
  2703. }
  2704. static struct dentry *proc_task_lookup(struct inode *dir, struct dentry * dentry, unsigned int flags)
  2705. {
  2706. struct dentry *result = ERR_PTR(-ENOENT);
  2707. struct task_struct *task;
  2708. struct task_struct *leader = get_proc_task(dir);
  2709. unsigned tid;
  2710. struct pid_namespace *ns;
  2711. if (!leader)
  2712. goto out_no_task;
  2713. tid = name_to_int(dentry);
  2714. if (tid == ~0U)
  2715. goto out;
  2716. ns = dentry->d_sb->s_fs_info;
  2717. rcu_read_lock();
  2718. task = find_task_by_pid_ns(tid, ns);
  2719. if (task)
  2720. get_task_struct(task);
  2721. rcu_read_unlock();
  2722. if (!task)
  2723. goto out;
  2724. if (!same_thread_group(leader, task))
  2725. goto out_drop_task;
  2726. result = proc_task_instantiate(dir, dentry, task, NULL);
  2727. out_drop_task:
  2728. put_task_struct(task);
  2729. out:
  2730. put_task_struct(leader);
  2731. out_no_task:
  2732. return result;
  2733. }
  2734. /*
  2735. * Find the first tid of a thread group to return to user space.
  2736. *
  2737. * Usually this is just the thread group leader, but if the users
  2738. * buffer was too small or there was a seek into the middle of the
  2739. * directory we have more work todo.
  2740. *
  2741. * In the case of a short read we start with find_task_by_pid.
  2742. *
  2743. * In the case of a seek we start with the leader and walk nr
  2744. * threads past it.
  2745. */
  2746. static struct task_struct *first_tid(struct task_struct *leader,
  2747. int tid, int nr, struct pid_namespace *ns)
  2748. {
  2749. struct task_struct *pos;
  2750. rcu_read_lock();
  2751. /* Attempt to start with the pid of a thread */
  2752. if (tid && (nr > 0)) {
  2753. pos = find_task_by_pid_ns(tid, ns);
  2754. if (pos && (pos->group_leader == leader))
  2755. goto found;
  2756. }
  2757. /* If nr exceeds the number of threads there is nothing todo */
  2758. pos = NULL;
  2759. if (nr && nr >= get_nr_threads(leader))
  2760. goto out;
  2761. /* If we haven't found our starting place yet start
  2762. * with the leader and walk nr threads forward.
  2763. */
  2764. for (pos = leader; nr > 0; --nr) {
  2765. pos = next_thread(pos);
  2766. if (pos == leader) {
  2767. pos = NULL;
  2768. goto out;
  2769. }
  2770. }
  2771. found:
  2772. get_task_struct(pos);
  2773. out:
  2774. rcu_read_unlock();
  2775. return pos;
  2776. }
  2777. /*
  2778. * Find the next thread in the thread list.
  2779. * Return NULL if there is an error or no next thread.
  2780. *
  2781. * The reference to the input task_struct is released.
  2782. */
  2783. static struct task_struct *next_tid(struct task_struct *start)
  2784. {
  2785. struct task_struct *pos = NULL;
  2786. rcu_read_lock();
  2787. if (pid_alive(start)) {
  2788. pos = next_thread(start);
  2789. if (thread_group_leader(pos))
  2790. pos = NULL;
  2791. else
  2792. get_task_struct(pos);
  2793. }
  2794. rcu_read_unlock();
  2795. put_task_struct(start);
  2796. return pos;
  2797. }
  2798. static int proc_task_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
  2799. struct task_struct *task, int tid)
  2800. {
  2801. char name[PROC_NUMBUF];
  2802. int len = snprintf(name, sizeof(name), "%d", tid);
  2803. return proc_fill_cache(filp, dirent, filldir, name, len,
  2804. proc_task_instantiate, task, NULL);
  2805. }
  2806. /* for the /proc/TGID/task/ directories */
  2807. static int proc_task_readdir(struct file * filp, void * dirent, filldir_t filldir)
  2808. {
  2809. struct dentry *dentry = filp->f_path.dentry;
  2810. struct inode *inode = dentry->d_inode;
  2811. struct task_struct *leader = NULL;
  2812. struct task_struct *task;
  2813. int retval = -ENOENT;
  2814. ino_t ino;
  2815. int tid;
  2816. struct pid_namespace *ns;
  2817. task = get_proc_task(inode);
  2818. if (!task)
  2819. goto out_no_task;
  2820. rcu_read_lock();
  2821. if (pid_alive(task)) {
  2822. leader = task->group_leader;
  2823. get_task_struct(leader);
  2824. }
  2825. rcu_read_unlock();
  2826. put_task_struct(task);
  2827. if (!leader)
  2828. goto out_no_task;
  2829. retval = 0;
  2830. switch ((unsigned long)filp->f_pos) {
  2831. case 0:
  2832. ino = inode->i_ino;
  2833. if (filldir(dirent, ".", 1, filp->f_pos, ino, DT_DIR) < 0)
  2834. goto out;
  2835. filp->f_pos++;
  2836. /* fall through */
  2837. case 1:
  2838. ino = parent_ino(dentry);
  2839. if (filldir(dirent, "..", 2, filp->f_pos, ino, DT_DIR) < 0)
  2840. goto out;
  2841. filp->f_pos++;
  2842. /* fall through */
  2843. }
  2844. /* f_version caches the tgid value that the last readdir call couldn't
  2845. * return. lseek aka telldir automagically resets f_version to 0.
  2846. */
  2847. ns = filp->f_dentry->d_sb->s_fs_info;
  2848. tid = (int)filp->f_version;
  2849. filp->f_version = 0;
  2850. for (task = first_tid(leader, tid, filp->f_pos - 2, ns);
  2851. task;
  2852. task = next_tid(task), filp->f_pos++) {
  2853. tid = task_pid_nr_ns(task, ns);
  2854. if (proc_task_fill_cache(filp, dirent, filldir, task, tid) < 0) {
  2855. /* returning this tgid failed, save it as the first
  2856. * pid for the next readir call */
  2857. filp->f_version = (u64)tid;
  2858. put_task_struct(task);
  2859. break;
  2860. }
  2861. }
  2862. out:
  2863. put_task_struct(leader);
  2864. out_no_task:
  2865. return retval;
  2866. }
  2867. static int proc_task_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
  2868. {
  2869. struct inode *inode = dentry->d_inode;
  2870. struct task_struct *p = get_proc_task(inode);
  2871. generic_fillattr(inode, stat);
  2872. if (p) {
  2873. stat->nlink += get_nr_threads(p);
  2874. put_task_struct(p);
  2875. }
  2876. return 0;
  2877. }
  2878. static const struct inode_operations proc_task_inode_operations = {
  2879. .lookup = proc_task_lookup,
  2880. .getattr = proc_task_getattr,
  2881. .setattr = proc_setattr,
  2882. .permission = proc_pid_permission,
  2883. };
  2884. static const struct file_operations proc_task_operations = {
  2885. .read = generic_read_dir,
  2886. .readdir = proc_task_readdir,
  2887. .llseek = default_llseek,
  2888. };