inode.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510
  1. /*
  2. * linux/fs/proc/inode.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. */
  6. #include <linux/time.h>
  7. #include <linux/proc_fs.h>
  8. #include <linux/kernel.h>
  9. #include <linux/pid_namespace.h>
  10. #include <linux/mm.h>
  11. #include <linux/string.h>
  12. #include <linux/stat.h>
  13. #include <linux/completion.h>
  14. #include <linux/poll.h>
  15. #include <linux/printk.h>
  16. #include <linux/file.h>
  17. #include <linux/limits.h>
  18. #include <linux/init.h>
  19. #include <linux/module.h>
  20. #include <linux/sysctl.h>
  21. #include <linux/seq_file.h>
  22. #include <linux/slab.h>
  23. #include <linux/mount.h>
  24. #include <asm/uaccess.h>
  25. #include "internal.h"
  26. static void proc_evict_inode(struct inode *inode)
  27. {
  28. struct proc_dir_entry *de;
  29. struct ctl_table_header *head;
  30. const struct proc_ns_operations *ns_ops;
  31. void *ns;
  32. truncate_inode_pages(&inode->i_data, 0);
  33. clear_inode(inode);
  34. /* Stop tracking associated processes */
  35. put_pid(PROC_I(inode)->pid);
  36. /* Let go of any associated proc directory entry */
  37. de = PROC_I(inode)->pde;
  38. if (de)
  39. pde_put(de);
  40. head = PROC_I(inode)->sysctl;
  41. if (head) {
  42. rcu_assign_pointer(PROC_I(inode)->sysctl, NULL);
  43. sysctl_head_put(head);
  44. }
  45. /* Release any associated namespace */
  46. ns_ops = PROC_I(inode)->ns_ops;
  47. ns = PROC_I(inode)->ns;
  48. if (ns_ops && ns)
  49. ns_ops->put(ns);
  50. }
  51. static struct kmem_cache * proc_inode_cachep;
  52. static struct inode *proc_alloc_inode(struct super_block *sb)
  53. {
  54. struct proc_inode *ei;
  55. struct inode *inode;
  56. ei = (struct proc_inode *)kmem_cache_alloc(proc_inode_cachep, GFP_KERNEL);
  57. if (!ei)
  58. return NULL;
  59. ei->pid = NULL;
  60. ei->fd = 0;
  61. ei->op.proc_get_link = NULL;
  62. ei->pde = NULL;
  63. ei->sysctl = NULL;
  64. ei->sysctl_entry = NULL;
  65. ei->ns = NULL;
  66. ei->ns_ops = NULL;
  67. inode = &ei->vfs_inode;
  68. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  69. return inode;
  70. }
  71. static void proc_i_callback(struct rcu_head *head)
  72. {
  73. struct inode *inode = container_of(head, struct inode, i_rcu);
  74. kmem_cache_free(proc_inode_cachep, PROC_I(inode));
  75. }
  76. static void proc_destroy_inode(struct inode *inode)
  77. {
  78. call_rcu(&inode->i_rcu, proc_i_callback);
  79. }
  80. static void init_once(void *foo)
  81. {
  82. struct proc_inode *ei = (struct proc_inode *) foo;
  83. inode_init_once(&ei->vfs_inode);
  84. }
  85. void __init proc_init_inodecache(void)
  86. {
  87. proc_inode_cachep = kmem_cache_create("proc_inode_cache",
  88. sizeof(struct proc_inode),
  89. 0, (SLAB_RECLAIM_ACCOUNT|
  90. SLAB_MEM_SPREAD|SLAB_PANIC),
  91. init_once);
  92. }
  93. static int proc_show_options(struct seq_file *seq, struct dentry *root)
  94. {
  95. struct super_block *sb = root->d_sb;
  96. struct pid_namespace *pid = sb->s_fs_info;
  97. if (!gid_eq(pid->pid_gid, GLOBAL_ROOT_GID))
  98. seq_printf(seq, ",gid=%u", from_kgid_munged(&init_user_ns, pid->pid_gid));
  99. if (pid->hide_pid != 0)
  100. seq_printf(seq, ",hidepid=%u", pid->hide_pid);
  101. return 0;
  102. }
  103. static const struct super_operations proc_sops = {
  104. .alloc_inode = proc_alloc_inode,
  105. .destroy_inode = proc_destroy_inode,
  106. .drop_inode = generic_delete_inode,
  107. .evict_inode = proc_evict_inode,
  108. .statfs = simple_statfs,
  109. .remount_fs = proc_remount,
  110. .show_options = proc_show_options,
  111. };
  112. static void __pde_users_dec(struct proc_dir_entry *pde)
  113. {
  114. pde->pde_users--;
  115. if (pde->pde_unload_completion && pde->pde_users == 0)
  116. complete(pde->pde_unload_completion);
  117. }
  118. void pde_users_dec(struct proc_dir_entry *pde)
  119. {
  120. spin_lock(&pde->pde_unload_lock);
  121. __pde_users_dec(pde);
  122. spin_unlock(&pde->pde_unload_lock);
  123. }
  124. static loff_t proc_reg_llseek(struct file *file, loff_t offset, int whence)
  125. {
  126. struct proc_dir_entry *pde = PDE(file_inode(file));
  127. loff_t rv = -EINVAL;
  128. loff_t (*llseek)(struct file *, loff_t, int);
  129. spin_lock(&pde->pde_unload_lock);
  130. /*
  131. * remove_proc_entry() is going to delete PDE (as part of module
  132. * cleanup sequence). No new callers into module allowed.
  133. */
  134. if (!pde->proc_fops) {
  135. spin_unlock(&pde->pde_unload_lock);
  136. return rv;
  137. }
  138. /*
  139. * Bump refcount so that remove_proc_entry will wail for ->llseek to
  140. * complete.
  141. */
  142. pde->pde_users++;
  143. /*
  144. * Save function pointer under lock, to protect against ->proc_fops
  145. * NULL'ifying right after ->pde_unload_lock is dropped.
  146. */
  147. llseek = pde->proc_fops->llseek;
  148. spin_unlock(&pde->pde_unload_lock);
  149. if (!llseek)
  150. llseek = default_llseek;
  151. rv = llseek(file, offset, whence);
  152. pde_users_dec(pde);
  153. return rv;
  154. }
  155. static ssize_t proc_reg_read(struct file *file, char __user *buf, size_t count, loff_t *ppos)
  156. {
  157. struct proc_dir_entry *pde = PDE(file_inode(file));
  158. ssize_t rv = -EIO;
  159. ssize_t (*read)(struct file *, char __user *, size_t, loff_t *);
  160. spin_lock(&pde->pde_unload_lock);
  161. if (!pde->proc_fops) {
  162. spin_unlock(&pde->pde_unload_lock);
  163. return rv;
  164. }
  165. pde->pde_users++;
  166. read = pde->proc_fops->read;
  167. spin_unlock(&pde->pde_unload_lock);
  168. if (read)
  169. rv = read(file, buf, count, ppos);
  170. pde_users_dec(pde);
  171. return rv;
  172. }
  173. static ssize_t proc_reg_write(struct file *file, const char __user *buf, size_t count, loff_t *ppos)
  174. {
  175. struct proc_dir_entry *pde = PDE(file_inode(file));
  176. ssize_t rv = -EIO;
  177. ssize_t (*write)(struct file *, const char __user *, size_t, loff_t *);
  178. spin_lock(&pde->pde_unload_lock);
  179. if (!pde->proc_fops) {
  180. spin_unlock(&pde->pde_unload_lock);
  181. return rv;
  182. }
  183. pde->pde_users++;
  184. write = pde->proc_fops->write;
  185. spin_unlock(&pde->pde_unload_lock);
  186. if (write)
  187. rv = write(file, buf, count, ppos);
  188. pde_users_dec(pde);
  189. return rv;
  190. }
  191. static unsigned int proc_reg_poll(struct file *file, struct poll_table_struct *pts)
  192. {
  193. struct proc_dir_entry *pde = PDE(file_inode(file));
  194. unsigned int rv = DEFAULT_POLLMASK;
  195. unsigned int (*poll)(struct file *, struct poll_table_struct *);
  196. spin_lock(&pde->pde_unload_lock);
  197. if (!pde->proc_fops) {
  198. spin_unlock(&pde->pde_unload_lock);
  199. return rv;
  200. }
  201. pde->pde_users++;
  202. poll = pde->proc_fops->poll;
  203. spin_unlock(&pde->pde_unload_lock);
  204. if (poll)
  205. rv = poll(file, pts);
  206. pde_users_dec(pde);
  207. return rv;
  208. }
  209. static long proc_reg_unlocked_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
  210. {
  211. struct proc_dir_entry *pde = PDE(file_inode(file));
  212. long rv = -ENOTTY;
  213. long (*ioctl)(struct file *, unsigned int, unsigned long);
  214. spin_lock(&pde->pde_unload_lock);
  215. if (!pde->proc_fops) {
  216. spin_unlock(&pde->pde_unload_lock);
  217. return rv;
  218. }
  219. pde->pde_users++;
  220. ioctl = pde->proc_fops->unlocked_ioctl;
  221. spin_unlock(&pde->pde_unload_lock);
  222. if (ioctl)
  223. rv = ioctl(file, cmd, arg);
  224. pde_users_dec(pde);
  225. return rv;
  226. }
  227. #ifdef CONFIG_COMPAT
  228. static long proc_reg_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
  229. {
  230. struct proc_dir_entry *pde = PDE(file_inode(file));
  231. long rv = -ENOTTY;
  232. long (*compat_ioctl)(struct file *, unsigned int, unsigned long);
  233. spin_lock(&pde->pde_unload_lock);
  234. if (!pde->proc_fops) {
  235. spin_unlock(&pde->pde_unload_lock);
  236. return rv;
  237. }
  238. pde->pde_users++;
  239. compat_ioctl = pde->proc_fops->compat_ioctl;
  240. spin_unlock(&pde->pde_unload_lock);
  241. if (compat_ioctl)
  242. rv = compat_ioctl(file, cmd, arg);
  243. pde_users_dec(pde);
  244. return rv;
  245. }
  246. #endif
  247. static int proc_reg_mmap(struct file *file, struct vm_area_struct *vma)
  248. {
  249. struct proc_dir_entry *pde = PDE(file_inode(file));
  250. int rv = -EIO;
  251. int (*mmap)(struct file *, struct vm_area_struct *);
  252. spin_lock(&pde->pde_unload_lock);
  253. if (!pde->proc_fops) {
  254. spin_unlock(&pde->pde_unload_lock);
  255. return rv;
  256. }
  257. pde->pde_users++;
  258. mmap = pde->proc_fops->mmap;
  259. spin_unlock(&pde->pde_unload_lock);
  260. if (mmap)
  261. rv = mmap(file, vma);
  262. pde_users_dec(pde);
  263. return rv;
  264. }
  265. static int proc_reg_open(struct inode *inode, struct file *file)
  266. {
  267. struct proc_dir_entry *pde = PDE(inode);
  268. int rv = 0;
  269. int (*open)(struct inode *, struct file *);
  270. int (*release)(struct inode *, struct file *);
  271. struct pde_opener *pdeo;
  272. /*
  273. * What for, you ask? Well, we can have open, rmmod, remove_proc_entry
  274. * sequence. ->release won't be called because ->proc_fops will be
  275. * cleared. Depending on complexity of ->release, consequences vary.
  276. *
  277. * We can't wait for mercy when close will be done for real, it's
  278. * deadlockable: rmmod foo </proc/foo . So, we're going to do ->release
  279. * by hand in remove_proc_entry(). For this, save opener's credentials
  280. * for later.
  281. */
  282. pdeo = kmalloc(sizeof(struct pde_opener), GFP_KERNEL);
  283. if (!pdeo)
  284. return -ENOMEM;
  285. spin_lock(&pde->pde_unload_lock);
  286. if (!pde->proc_fops) {
  287. spin_unlock(&pde->pde_unload_lock);
  288. kfree(pdeo);
  289. return -ENOENT;
  290. }
  291. pde->pde_users++;
  292. open = pde->proc_fops->open;
  293. release = pde->proc_fops->release;
  294. spin_unlock(&pde->pde_unload_lock);
  295. if (open)
  296. rv = open(inode, file);
  297. spin_lock(&pde->pde_unload_lock);
  298. if (rv == 0 && release) {
  299. /* To know what to release. */
  300. pdeo->inode = inode;
  301. pdeo->file = file;
  302. /* Strictly for "too late" ->release in proc_reg_release(). */
  303. pdeo->release = release;
  304. list_add(&pdeo->lh, &pde->pde_openers);
  305. } else
  306. kfree(pdeo);
  307. __pde_users_dec(pde);
  308. spin_unlock(&pde->pde_unload_lock);
  309. return rv;
  310. }
  311. static struct pde_opener *find_pde_opener(struct proc_dir_entry *pde,
  312. struct inode *inode, struct file *file)
  313. {
  314. struct pde_opener *pdeo;
  315. list_for_each_entry(pdeo, &pde->pde_openers, lh) {
  316. if (pdeo->inode == inode && pdeo->file == file)
  317. return pdeo;
  318. }
  319. return NULL;
  320. }
  321. static int proc_reg_release(struct inode *inode, struct file *file)
  322. {
  323. struct proc_dir_entry *pde = PDE(inode);
  324. int rv = 0;
  325. int (*release)(struct inode *, struct file *);
  326. struct pde_opener *pdeo;
  327. spin_lock(&pde->pde_unload_lock);
  328. pdeo = find_pde_opener(pde, inode, file);
  329. if (!pde->proc_fops) {
  330. /*
  331. * Can't simply exit, __fput() will think that everything is OK,
  332. * and move on to freeing struct file. remove_proc_entry() will
  333. * find slacker in opener's list and will try to do non-trivial
  334. * things with struct file. Therefore, remove opener from list.
  335. *
  336. * But if opener is removed from list, who will ->release it?
  337. */
  338. if (pdeo) {
  339. list_del(&pdeo->lh);
  340. spin_unlock(&pde->pde_unload_lock);
  341. rv = pdeo->release(inode, file);
  342. kfree(pdeo);
  343. } else
  344. spin_unlock(&pde->pde_unload_lock);
  345. return rv;
  346. }
  347. pde->pde_users++;
  348. release = pde->proc_fops->release;
  349. if (pdeo) {
  350. list_del(&pdeo->lh);
  351. kfree(pdeo);
  352. }
  353. spin_unlock(&pde->pde_unload_lock);
  354. if (release)
  355. rv = release(inode, file);
  356. pde_users_dec(pde);
  357. return rv;
  358. }
  359. static const struct file_operations proc_reg_file_ops = {
  360. .llseek = proc_reg_llseek,
  361. .read = proc_reg_read,
  362. .write = proc_reg_write,
  363. .poll = proc_reg_poll,
  364. .unlocked_ioctl = proc_reg_unlocked_ioctl,
  365. #ifdef CONFIG_COMPAT
  366. .compat_ioctl = proc_reg_compat_ioctl,
  367. #endif
  368. .mmap = proc_reg_mmap,
  369. .open = proc_reg_open,
  370. .release = proc_reg_release,
  371. };
  372. #ifdef CONFIG_COMPAT
  373. static const struct file_operations proc_reg_file_ops_no_compat = {
  374. .llseek = proc_reg_llseek,
  375. .read = proc_reg_read,
  376. .write = proc_reg_write,
  377. .poll = proc_reg_poll,
  378. .unlocked_ioctl = proc_reg_unlocked_ioctl,
  379. .mmap = proc_reg_mmap,
  380. .open = proc_reg_open,
  381. .release = proc_reg_release,
  382. };
  383. #endif
  384. struct inode *proc_get_inode(struct super_block *sb, struct proc_dir_entry *de)
  385. {
  386. struct inode *inode = new_inode_pseudo(sb);
  387. if (inode) {
  388. inode->i_ino = de->low_ino;
  389. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
  390. PROC_I(inode)->pde = de;
  391. if (de->mode) {
  392. inode->i_mode = de->mode;
  393. inode->i_uid = de->uid;
  394. inode->i_gid = de->gid;
  395. }
  396. if (de->size)
  397. inode->i_size = de->size;
  398. if (de->nlink)
  399. set_nlink(inode, de->nlink);
  400. if (de->proc_iops)
  401. inode->i_op = de->proc_iops;
  402. if (de->proc_fops) {
  403. if (S_ISREG(inode->i_mode)) {
  404. #ifdef CONFIG_COMPAT
  405. if (!de->proc_fops->compat_ioctl)
  406. inode->i_fop =
  407. &proc_reg_file_ops_no_compat;
  408. else
  409. #endif
  410. inode->i_fop = &proc_reg_file_ops;
  411. } else {
  412. inode->i_fop = de->proc_fops;
  413. }
  414. }
  415. } else
  416. pde_put(de);
  417. return inode;
  418. }
  419. int proc_fill_super(struct super_block *s)
  420. {
  421. struct inode *root_inode;
  422. s->s_flags |= MS_NODIRATIME | MS_NOSUID | MS_NOEXEC;
  423. s->s_blocksize = 1024;
  424. s->s_blocksize_bits = 10;
  425. s->s_magic = PROC_SUPER_MAGIC;
  426. s->s_op = &proc_sops;
  427. s->s_time_gran = 1;
  428. pde_get(&proc_root);
  429. root_inode = proc_get_inode(s, &proc_root);
  430. if (!root_inode) {
  431. pr_err("proc_fill_super: get root inode failed\n");
  432. return -ENOMEM;
  433. }
  434. s->s_root = d_make_root(root_inode);
  435. if (!s->s_root) {
  436. pr_err("proc_fill_super: allocate dentry failed\n");
  437. return -ENOMEM;
  438. }
  439. return 0;
  440. }