base.c 74 KB

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