inode.c 12 KB

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