inode.c 12 KB

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