base.c 76 KB

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