inode.c 12 KB

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