base.c 75 KB

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