base.c 75 KB

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