base.c 76 KB

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