]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - fs/proc/generic.c
net: hns: add the code for cleaning pkt in chip
[mirror_ubuntu-bionic-kernel.git] / fs / proc / generic.c
1 /*
2 * proc/fs/generic.c --- generic routines for the proc-fs
3 *
4 * This file contains generic proc-fs routines for handling
5 * directories and files.
6 *
7 * Copyright (C) 1991, 1992 Linus Torvalds.
8 * Copyright (C) 1997 Theodore Ts'o
9 */
10
11 #include <linux/errno.h>
12 #include <linux/time.h>
13 #include <linux/proc_fs.h>
14 #include <linux/stat.h>
15 #include <linux/mm.h>
16 #include <linux/module.h>
17 #include <linux/slab.h>
18 #include <linux/printk.h>
19 #include <linux/mount.h>
20 #include <linux/init.h>
21 #include <linux/idr.h>
22 #include <linux/bitops.h>
23 #include <linux/spinlock.h>
24 #include <linux/completion.h>
25 #include <linux/uaccess.h>
26
27 #include "internal.h"
28
29 static DEFINE_RWLOCK(proc_subdir_lock);
30
31 static int proc_match(unsigned int len, const char *name, struct proc_dir_entry *de)
32 {
33 if (len < de->namelen)
34 return -1;
35 if (len > de->namelen)
36 return 1;
37
38 return memcmp(name, de->name, len);
39 }
40
41 static struct proc_dir_entry *pde_subdir_first(struct proc_dir_entry *dir)
42 {
43 return rb_entry_safe(rb_first_cached(&dir->subdir),
44 struct proc_dir_entry, subdir_node);
45 }
46
47 static struct proc_dir_entry *pde_subdir_next(struct proc_dir_entry *dir)
48 {
49 return rb_entry_safe(rb_next(&dir->subdir_node), struct proc_dir_entry,
50 subdir_node);
51 }
52
53 static struct proc_dir_entry *pde_subdir_find(struct proc_dir_entry *dir,
54 const char *name,
55 unsigned int len)
56 {
57 struct rb_node *node = dir->subdir.rb_root.rb_node;
58
59 while (node) {
60 struct proc_dir_entry *de = rb_entry(node,
61 struct proc_dir_entry,
62 subdir_node);
63 int result = proc_match(len, name, de);
64
65 if (result < 0)
66 node = node->rb_left;
67 else if (result > 0)
68 node = node->rb_right;
69 else
70 return de;
71 }
72 return NULL;
73 }
74
75 static bool pde_subdir_insert(struct proc_dir_entry *dir,
76 struct proc_dir_entry *de)
77 {
78 struct rb_root_cached *root = &dir->subdir;
79 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
80 bool leftmost = true;
81
82 /* Figure out where to put new node */
83 while (*new) {
84 struct proc_dir_entry *this = rb_entry(*new,
85 struct proc_dir_entry,
86 subdir_node);
87 int result = proc_match(de->namelen, de->name, this);
88
89 parent = *new;
90 if (result < 0)
91 new = &(*new)->rb_left;
92 else if (result > 0) {
93 new = &(*new)->rb_right;
94 leftmost = false;
95 } else
96 return false;
97 }
98
99 /* Add new node and rebalance tree. */
100 rb_link_node(&de->subdir_node, parent, new);
101 rb_insert_color_cached(&de->subdir_node, root, leftmost);
102 return true;
103 }
104
105 static int proc_notify_change(struct dentry *dentry, struct iattr *iattr)
106 {
107 struct inode *inode = d_inode(dentry);
108 struct proc_dir_entry *de = PDE(inode);
109 struct user_namespace *s_user_ns;
110 int error;
111
112 /* Don't let anyone mess with weird proc files */
113 s_user_ns = inode->i_sb->s_user_ns;
114 if (!kuid_has_mapping(s_user_ns, inode->i_uid) ||
115 !kgid_has_mapping(s_user_ns, inode->i_gid))
116 return -EPERM;
117
118 error = setattr_prepare(dentry, iattr);
119 if (error)
120 return error;
121
122 setattr_copy(inode, iattr);
123 mark_inode_dirty(inode);
124
125 proc_set_user(de, inode->i_uid, inode->i_gid);
126 de->mode = inode->i_mode;
127 return 0;
128 }
129
130 static int proc_getattr(const struct path *path, struct kstat *stat,
131 u32 request_mask, unsigned int query_flags)
132 {
133 struct inode *inode = d_inode(path->dentry);
134 struct proc_dir_entry *de = PDE(inode);
135 if (de && de->nlink)
136 set_nlink(inode, de->nlink);
137
138 generic_fillattr(inode, stat);
139 return 0;
140 }
141
142 static const struct inode_operations proc_file_inode_operations = {
143 .setattr = proc_notify_change,
144 };
145
146 /*
147 * This function parses a name such as "tty/driver/serial", and
148 * returns the struct proc_dir_entry for "/proc/tty/driver", and
149 * returns "serial" in residual.
150 */
151 static int __xlate_proc_name(const char *name, struct proc_dir_entry **ret,
152 const char **residual)
153 {
154 const char *cp = name, *next;
155 struct proc_dir_entry *de;
156 unsigned int len;
157
158 de = *ret;
159 if (!de)
160 de = &proc_root;
161
162 while (1) {
163 next = strchr(cp, '/');
164 if (!next)
165 break;
166
167 len = next - cp;
168 de = pde_subdir_find(de, cp, len);
169 if (!de) {
170 WARN(1, "name '%s'\n", name);
171 return -ENOENT;
172 }
173 cp += len + 1;
174 }
175 *residual = cp;
176 *ret = de;
177 return 0;
178 }
179
180 static int xlate_proc_name(const char *name, struct proc_dir_entry **ret,
181 const char **residual)
182 {
183 int rv;
184
185 read_lock(&proc_subdir_lock);
186 rv = __xlate_proc_name(name, ret, residual);
187 read_unlock(&proc_subdir_lock);
188 return rv;
189 }
190
191 static DEFINE_IDA(proc_inum_ida);
192
193 #define PROC_DYNAMIC_FIRST 0xF0000000U
194
195 /*
196 * Return an inode number between PROC_DYNAMIC_FIRST and
197 * 0xffffffff, or zero on failure.
198 */
199 int proc_alloc_inum(unsigned int *inum)
200 {
201 int i;
202
203 i = ida_simple_get(&proc_inum_ida, 0, UINT_MAX - PROC_DYNAMIC_FIRST + 1,
204 GFP_KERNEL);
205 if (i < 0)
206 return i;
207
208 *inum = PROC_DYNAMIC_FIRST + (unsigned int)i;
209 return 0;
210 }
211
212 void proc_free_inum(unsigned int inum)
213 {
214 ida_simple_remove(&proc_inum_ida, inum - PROC_DYNAMIC_FIRST);
215 }
216
217 /*
218 * Don't create negative dentries here, return -ENOENT by hand
219 * instead.
220 */
221 struct dentry *proc_lookup_de(struct proc_dir_entry *de, struct inode *dir,
222 struct dentry *dentry)
223 {
224 struct inode *inode;
225
226 read_lock(&proc_subdir_lock);
227 de = pde_subdir_find(de, dentry->d_name.name, dentry->d_name.len);
228 if (de) {
229 pde_get(de);
230 read_unlock(&proc_subdir_lock);
231 inode = proc_get_inode(dir->i_sb, de);
232 if (!inode)
233 return ERR_PTR(-ENOMEM);
234 d_set_d_op(dentry, &simple_dentry_operations);
235 d_add(dentry, inode);
236 return NULL;
237 }
238 read_unlock(&proc_subdir_lock);
239 return ERR_PTR(-ENOENT);
240 }
241
242 struct dentry *proc_lookup(struct inode *dir, struct dentry *dentry,
243 unsigned int flags)
244 {
245 return proc_lookup_de(PDE(dir), dir, dentry);
246 }
247
248 /*
249 * This returns non-zero if at EOF, so that the /proc
250 * root directory can use this and check if it should
251 * continue with the <pid> entries..
252 *
253 * Note that the VFS-layer doesn't care about the return
254 * value of the readdir() call, as long as it's non-negative
255 * for success..
256 */
257 int proc_readdir_de(struct proc_dir_entry *de, struct file *file,
258 struct dir_context *ctx)
259 {
260 int i;
261
262 if (!dir_emit_dots(file, ctx))
263 return 0;
264
265 read_lock(&proc_subdir_lock);
266 de = pde_subdir_first(de);
267 i = ctx->pos - 2;
268 for (;;) {
269 if (!de) {
270 read_unlock(&proc_subdir_lock);
271 return 0;
272 }
273 if (!i)
274 break;
275 de = pde_subdir_next(de);
276 i--;
277 }
278
279 do {
280 struct proc_dir_entry *next;
281 pde_get(de);
282 read_unlock(&proc_subdir_lock);
283 if (!dir_emit(ctx, de->name, de->namelen,
284 de->low_ino, de->mode >> 12)) {
285 pde_put(de);
286 return 0;
287 }
288 read_lock(&proc_subdir_lock);
289 ctx->pos++;
290 next = pde_subdir_next(de);
291 pde_put(de);
292 de = next;
293 } while (de);
294 read_unlock(&proc_subdir_lock);
295 return 1;
296 }
297
298 int proc_readdir(struct file *file, struct dir_context *ctx)
299 {
300 struct inode *inode = file_inode(file);
301
302 return proc_readdir_de(PDE(inode), file, ctx);
303 }
304
305 /*
306 * These are the generic /proc directory operations. They
307 * use the in-memory "struct proc_dir_entry" tree to parse
308 * the /proc directory.
309 */
310 static const struct file_operations proc_dir_operations = {
311 .llseek = generic_file_llseek,
312 .read = generic_read_dir,
313 .iterate_shared = proc_readdir,
314 };
315
316 /*
317 * proc directories can do almost nothing..
318 */
319 static const struct inode_operations proc_dir_inode_operations = {
320 .lookup = proc_lookup,
321 .getattr = proc_getattr,
322 .setattr = proc_notify_change,
323 };
324
325 static int proc_register(struct proc_dir_entry * dir, struct proc_dir_entry * dp)
326 {
327 int ret;
328
329 ret = proc_alloc_inum(&dp->low_ino);
330 if (ret)
331 return ret;
332
333 write_lock(&proc_subdir_lock);
334 dp->parent = dir;
335 if (pde_subdir_insert(dir, dp) == false) {
336 WARN(1, "proc_dir_entry '%s/%s' already registered\n",
337 dir->name, dp->name);
338 write_unlock(&proc_subdir_lock);
339 proc_free_inum(dp->low_ino);
340 return -EEXIST;
341 }
342 write_unlock(&proc_subdir_lock);
343
344 return 0;
345 }
346
347 static struct proc_dir_entry *__proc_create(struct proc_dir_entry **parent,
348 const char *name,
349 umode_t mode,
350 nlink_t nlink)
351 {
352 struct proc_dir_entry *ent = NULL;
353 const char *fn;
354 struct qstr qstr;
355
356 if (xlate_proc_name(name, parent, &fn) != 0)
357 goto out;
358 qstr.name = fn;
359 qstr.len = strlen(fn);
360 if (qstr.len == 0 || qstr.len >= 256) {
361 WARN(1, "name len %u\n", qstr.len);
362 return NULL;
363 }
364 if (*parent == &proc_root && name_to_int(&qstr) != ~0U) {
365 WARN(1, "create '/proc/%s' by hand\n", qstr.name);
366 return NULL;
367 }
368 if (is_empty_pde(*parent)) {
369 WARN(1, "attempt to add to permanently empty directory");
370 return NULL;
371 }
372
373 ent = kzalloc(sizeof(struct proc_dir_entry) + qstr.len + 1, GFP_KERNEL);
374 if (!ent)
375 goto out;
376
377 memcpy(ent->name, fn, qstr.len + 1);
378 ent->namelen = qstr.len;
379 ent->mode = mode;
380 ent->nlink = nlink;
381 ent->subdir = RB_ROOT_CACHED;
382 atomic_set(&ent->count, 1);
383 spin_lock_init(&ent->pde_unload_lock);
384 INIT_LIST_HEAD(&ent->pde_openers);
385 proc_set_user(ent, (*parent)->uid, (*parent)->gid);
386
387 out:
388 return ent;
389 }
390
391 struct proc_dir_entry *proc_symlink(const char *name,
392 struct proc_dir_entry *parent, const char *dest)
393 {
394 struct proc_dir_entry *ent;
395
396 ent = __proc_create(&parent, name,
397 (S_IFLNK | S_IRUGO | S_IWUGO | S_IXUGO),1);
398
399 if (ent) {
400 ent->data = kmalloc((ent->size=strlen(dest))+1, GFP_KERNEL);
401 if (ent->data) {
402 strcpy((char*)ent->data,dest);
403 ent->proc_iops = &proc_link_inode_operations;
404 if (proc_register(parent, ent) < 0) {
405 kfree(ent->data);
406 kfree(ent);
407 ent = NULL;
408 }
409 } else {
410 kfree(ent);
411 ent = NULL;
412 }
413 }
414 return ent;
415 }
416 EXPORT_SYMBOL(proc_symlink);
417
418 struct proc_dir_entry *proc_mkdir_data(const char *name, umode_t mode,
419 struct proc_dir_entry *parent, void *data)
420 {
421 struct proc_dir_entry *ent;
422
423 if (mode == 0)
424 mode = S_IRUGO | S_IXUGO;
425
426 ent = __proc_create(&parent, name, S_IFDIR | mode, 2);
427 if (ent) {
428 ent->data = data;
429 ent->proc_fops = &proc_dir_operations;
430 ent->proc_iops = &proc_dir_inode_operations;
431 parent->nlink++;
432 if (proc_register(parent, ent) < 0) {
433 kfree(ent);
434 parent->nlink--;
435 ent = NULL;
436 }
437 }
438 return ent;
439 }
440 EXPORT_SYMBOL_GPL(proc_mkdir_data);
441
442 struct proc_dir_entry *proc_mkdir_mode(const char *name, umode_t mode,
443 struct proc_dir_entry *parent)
444 {
445 return proc_mkdir_data(name, mode, parent, NULL);
446 }
447 EXPORT_SYMBOL(proc_mkdir_mode);
448
449 struct proc_dir_entry *proc_mkdir(const char *name,
450 struct proc_dir_entry *parent)
451 {
452 return proc_mkdir_data(name, 0, parent, NULL);
453 }
454 EXPORT_SYMBOL(proc_mkdir);
455
456 struct proc_dir_entry *proc_create_mount_point(const char *name)
457 {
458 umode_t mode = S_IFDIR | S_IRUGO | S_IXUGO;
459 struct proc_dir_entry *ent, *parent = NULL;
460
461 ent = __proc_create(&parent, name, mode, 2);
462 if (ent) {
463 ent->data = NULL;
464 ent->proc_fops = NULL;
465 ent->proc_iops = NULL;
466 parent->nlink++;
467 if (proc_register(parent, ent) < 0) {
468 kfree(ent);
469 parent->nlink--;
470 ent = NULL;
471 }
472 }
473 return ent;
474 }
475 EXPORT_SYMBOL(proc_create_mount_point);
476
477 struct proc_dir_entry *proc_create_data(const char *name, umode_t mode,
478 struct proc_dir_entry *parent,
479 const struct file_operations *proc_fops,
480 void *data)
481 {
482 struct proc_dir_entry *pde;
483 if ((mode & S_IFMT) == 0)
484 mode |= S_IFREG;
485
486 if (!S_ISREG(mode)) {
487 WARN_ON(1); /* use proc_mkdir() */
488 return NULL;
489 }
490
491 BUG_ON(proc_fops == NULL);
492
493 if ((mode & S_IALLUGO) == 0)
494 mode |= S_IRUGO;
495 pde = __proc_create(&parent, name, mode, 1);
496 if (!pde)
497 goto out;
498 pde->proc_fops = proc_fops;
499 pde->data = data;
500 pde->proc_iops = &proc_file_inode_operations;
501 if (proc_register(parent, pde) < 0)
502 goto out_free;
503 return pde;
504 out_free:
505 kfree(pde);
506 out:
507 return NULL;
508 }
509 EXPORT_SYMBOL(proc_create_data);
510
511 struct proc_dir_entry *proc_create(const char *name, umode_t mode,
512 struct proc_dir_entry *parent,
513 const struct file_operations *proc_fops)
514 {
515 return proc_create_data(name, mode, parent, proc_fops, NULL);
516 }
517 EXPORT_SYMBOL(proc_create);
518
519 void proc_set_size(struct proc_dir_entry *de, loff_t size)
520 {
521 de->size = size;
522 }
523 EXPORT_SYMBOL(proc_set_size);
524
525 void proc_set_user(struct proc_dir_entry *de, kuid_t uid, kgid_t gid)
526 {
527 de->uid = uid;
528 de->gid = gid;
529 }
530 EXPORT_SYMBOL(proc_set_user);
531
532 static void free_proc_entry(struct proc_dir_entry *de)
533 {
534 proc_free_inum(de->low_ino);
535
536 if (S_ISLNK(de->mode))
537 kfree(de->data);
538 kfree(de);
539 }
540
541 void pde_put(struct proc_dir_entry *pde)
542 {
543 if (atomic_dec_and_test(&pde->count))
544 free_proc_entry(pde);
545 }
546
547 /*
548 * Remove a /proc entry and free it if it's not currently in use.
549 */
550 void remove_proc_entry(const char *name, struct proc_dir_entry *parent)
551 {
552 struct proc_dir_entry *de = NULL;
553 const char *fn = name;
554 unsigned int len;
555
556 write_lock(&proc_subdir_lock);
557 if (__xlate_proc_name(name, &parent, &fn) != 0) {
558 write_unlock(&proc_subdir_lock);
559 return;
560 }
561 len = strlen(fn);
562
563 de = pde_subdir_find(parent, fn, len);
564 if (de)
565 rb_erase_cached(&de->subdir_node, &parent->subdir);
566 write_unlock(&proc_subdir_lock);
567 if (!de) {
568 WARN(1, "name '%s'\n", name);
569 return;
570 }
571
572 proc_entry_rundown(de);
573
574 if (S_ISDIR(de->mode))
575 parent->nlink--;
576 de->nlink = 0;
577 WARN(pde_subdir_first(de),
578 "%s: removing non-empty directory '%s/%s', leaking at least '%s'\n",
579 __func__, de->parent->name, de->name, pde_subdir_first(de)->name);
580 pde_put(de);
581 }
582 EXPORT_SYMBOL(remove_proc_entry);
583
584 int remove_proc_subtree(const char *name, struct proc_dir_entry *parent)
585 {
586 struct proc_dir_entry *root = NULL, *de, *next;
587 const char *fn = name;
588 unsigned int len;
589
590 write_lock(&proc_subdir_lock);
591 if (__xlate_proc_name(name, &parent, &fn) != 0) {
592 write_unlock(&proc_subdir_lock);
593 return -ENOENT;
594 }
595 len = strlen(fn);
596
597 root = pde_subdir_find(parent, fn, len);
598 if (!root) {
599 write_unlock(&proc_subdir_lock);
600 return -ENOENT;
601 }
602 rb_erase_cached(&root->subdir_node, &parent->subdir);
603
604 de = root;
605 while (1) {
606 next = pde_subdir_first(de);
607 if (next) {
608 rb_erase_cached(&next->subdir_node, &de->subdir);
609 de = next;
610 continue;
611 }
612 write_unlock(&proc_subdir_lock);
613
614 proc_entry_rundown(de);
615 next = de->parent;
616 if (S_ISDIR(de->mode))
617 next->nlink--;
618 de->nlink = 0;
619 if (de == root)
620 break;
621 pde_put(de);
622
623 write_lock(&proc_subdir_lock);
624 de = next;
625 }
626 pde_put(root);
627 return 0;
628 }
629 EXPORT_SYMBOL(remove_proc_subtree);
630
631 void *proc_get_parent_data(const struct inode *inode)
632 {
633 struct proc_dir_entry *de = PDE(inode);
634 return de->parent->data;
635 }
636 EXPORT_SYMBOL_GPL(proc_get_parent_data);
637
638 void proc_remove(struct proc_dir_entry *de)
639 {
640 if (de)
641 remove_proc_subtree(de->name, de->parent);
642 }
643 EXPORT_SYMBOL(proc_remove);
644
645 void *PDE_DATA(const struct inode *inode)
646 {
647 return __PDE_DATA(inode);
648 }
649 EXPORT_SYMBOL(PDE_DATA);