inode.c 12 KB

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