proc_sysctl.c 36.5 KB
Newer Older
1 2 3
/*
 * /proc/sys support
 */
A
Alexey Dobriyan 已提交
4
#include <linux/init.h>
5
#include <linux/sysctl.h>
L
Lucas De Marchi 已提交
6
#include <linux/poll.h>
7 8
#include <linux/proc_fs.h>
#include <linux/security.h>
9
#include <linux/namei.h>
10
#include <linux/module.h>
11 12
#include "internal.h"

A
Al Viro 已提交
13
static const struct dentry_operations proc_sys_dentry_operations;
14
static const struct file_operations proc_sys_file_operations;
15
static const struct inode_operations proc_sys_inode_operations;
A
Al Viro 已提交
16 17
static const struct file_operations proc_sys_dir_file_operations;
static const struct inode_operations proc_sys_dir_operations;
18

L
Lucas De Marchi 已提交
19 20 21 22 23 24 25 26 27
void proc_sys_poll_notify(struct ctl_table_poll *poll)
{
	if (!poll)
		return;

	atomic_inc(&poll->event);
	wake_up_interruptible(&poll->wait);
}

28 29 30
static struct ctl_table root_table[] = {
	{
		.procname = "",
31
		.mode = S_IFDIR|S_IRUGO|S_IXUGO,
32 33 34
	},
	{ }
};
35 36 37
static struct ctl_table_root sysctl_table_root = {
	.default_set.list = LIST_HEAD_INIT(sysctl_table_root.default_set.dir.header.ctl_entry),
	.default_set.dir.header = {
38 39 40 41
		{{.count = 1,
		  .nreg = 1,
		  .ctl_table = root_table,
		  .ctl_entry = LIST_HEAD_INIT(sysctl_table_root.default_set.list),}},
42
		.ctl_table_arg = root_table,
43 44 45
		.root = &sysctl_table_root,
		.set = &sysctl_table_root.default_set,
	},
46 47 48 49
};

static DEFINE_SPINLOCK(sysctl_lock);

50
static void drop_sysctl_table(struct ctl_table_header *header);
51 52 53 54
static int sysctl_follow_link(struct ctl_table_header **phead,
	struct ctl_table **pentry, struct nsproxy *namespaces);
static int insert_links(struct ctl_table_header *head);
static void put_links(struct ctl_table_header *header);
55
static int sysctl_check_dups(struct ctl_dir *dir, struct ctl_table *table);
56

57 58 59 60 61 62 63
static void sysctl_print_dir(struct ctl_dir *dir)
{
	if (dir->header.parent)
		sysctl_print_dir(dir->header.parent);
	printk(KERN_CONT "%s/", dir->header.ctl_table[0].procname);
}

64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
static int namecmp(const char *name1, int len1, const char *name2, int len2)
{
	int minlen;
	int cmp;

	minlen = len1;
	if (minlen > len2)
		minlen = len2;

	cmp = memcmp(name1, name2, minlen);
	if (cmp == 0)
		cmp = len1 - len2;
	return cmp;
}

static struct ctl_table *find_entry(struct ctl_table_header **phead,
80
	struct ctl_dir *dir, const char *name, int namelen)
81
{
82
	struct ctl_table_set *set = dir->header.set;
83 84 85 86 87 88
	struct ctl_table_header *head;
	struct ctl_table *entry;

	list_for_each_entry(head, &set->list, ctl_entry) {
		if (head->unregistering)
			continue;
89
		if (head->parent != dir)
90
			continue;
91
		for (entry = head->ctl_table; entry->procname; entry++) {
92 93 94 95 96 97 98 99 100 101
			const char *procname = entry->procname;
			if (namecmp(procname, strlen(procname), name, namelen) == 0) {
				*phead = head;
				return entry;
			}
		}
	}
	return NULL;
}

102 103 104 105
static void init_header(struct ctl_table_header *head,
	struct ctl_table_root *root, struct ctl_table_set *set,
	struct ctl_table *table)
{
106
	head->ctl_table = table;
107 108 109 110 111 112 113 114 115 116 117
	head->ctl_table_arg = table;
	INIT_LIST_HEAD(&head->ctl_entry);
	head->used = 0;
	head->count = 1;
	head->nreg = 1;
	head->unregistering = NULL;
	head->root = root;
	head->set = set;
	head->parent = NULL;
}

118 119 120 121 122
static void erase_header(struct ctl_table_header *head)
{
	list_del_init(&head->ctl_entry);
}

123
static int insert_header(struct ctl_dir *dir, struct ctl_table_header *header)
124
{
125 126
	int err;

127 128 129 130
	err = sysctl_check_dups(dir, header->ctl_table);
	if (err)
		return err;

131
	dir->header.nreg++;
132
	header->parent = dir;
133 134 135
	err = insert_links(header);
	if (err)
		goto fail_links;
136
	list_add_tail(&header->ctl_entry, &header->set->list);
137 138 139 140 141
	return 0;
fail_links:
	header->parent = NULL;
	drop_sysctl_table(&dir->header);
	return err;
142 143
}

144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182
/* called under sysctl_lock */
static int use_table(struct ctl_table_header *p)
{
	if (unlikely(p->unregistering))
		return 0;
	p->used++;
	return 1;
}

/* called under sysctl_lock */
static void unuse_table(struct ctl_table_header *p)
{
	if (!--p->used)
		if (unlikely(p->unregistering))
			complete(p->unregistering);
}

/* called under sysctl_lock, will reacquire if has to wait */
static void start_unregistering(struct ctl_table_header *p)
{
	/*
	 * if p->used is 0, nobody will ever touch that entry again;
	 * we'll eliminate all paths to it before dropping sysctl_lock
	 */
	if (unlikely(p->used)) {
		struct completion wait;
		init_completion(&wait);
		p->unregistering = &wait;
		spin_unlock(&sysctl_lock);
		wait_for_completion(&wait);
		spin_lock(&sysctl_lock);
	} else {
		/* anything non-NULL; we'll never dereference it */
		p->unregistering = ERR_PTR(-EINVAL);
	}
	/*
	 * do not remove from the list until nobody holds it; walking the
	 * list in do_sysctl() relies on that.
	 */
183
	erase_header(p);
184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229
}

static void sysctl_head_get(struct ctl_table_header *head)
{
	spin_lock(&sysctl_lock);
	head->count++;
	spin_unlock(&sysctl_lock);
}

void sysctl_head_put(struct ctl_table_header *head)
{
	spin_lock(&sysctl_lock);
	if (!--head->count)
		kfree_rcu(head, rcu);
	spin_unlock(&sysctl_lock);
}

static struct ctl_table_header *sysctl_head_grab(struct ctl_table_header *head)
{
	if (!head)
		BUG();
	spin_lock(&sysctl_lock);
	if (!use_table(head))
		head = ERR_PTR(-ENOENT);
	spin_unlock(&sysctl_lock);
	return head;
}

static void sysctl_head_finish(struct ctl_table_header *head)
{
	if (!head)
		return;
	spin_lock(&sysctl_lock);
	unuse_table(head);
	spin_unlock(&sysctl_lock);
}

static struct ctl_table_set *
lookup_header_set(struct ctl_table_root *root, struct nsproxy *namespaces)
{
	struct ctl_table_set *set = &root->default_set;
	if (root->lookup)
		set = root->lookup(root, namespaces);
	return set;
}

230
static struct ctl_table *lookup_entry(struct ctl_table_header **phead,
231
				      struct ctl_dir *dir,
232 233 234 235 236 237
				      const char *name, int namelen)
{
	struct ctl_table_header *head;
	struct ctl_table *entry;

	spin_lock(&sysctl_lock);
238 239 240 241 242
	entry = find_entry(&head, dir, name, namelen);
	if (entry && use_table(head))
		*phead = head;
	else
		entry = NULL;
243 244 245 246
	spin_unlock(&sysctl_lock);
	return entry;
}

247
static struct ctl_table_header *next_usable_entry(struct ctl_dir *dir,
248
						  struct list_head *tmp)
249
{
250
	struct ctl_table_set *set = dir->header.set;
251 252
	struct ctl_table_header *head;

253
	for (tmp = tmp->next; tmp != &set->list; tmp = tmp->next) {
254 255
		head = list_entry(tmp, struct ctl_table_header, ctl_entry);

256 257
		if (head->parent != dir ||
		    !head->ctl_table->procname ||
258
		    !use_table(head))
259 260
			continue;

261
		return head;
262 263 264 265
	}
	return NULL;
}

266
static void first_entry(struct ctl_dir *dir,
267 268
	struct ctl_table_header **phead, struct ctl_table **pentry)
{
269 270
	struct ctl_table_header *head;
	struct ctl_table *entry = NULL;
271 272

	spin_lock(&sysctl_lock);
273
	head = next_usable_entry(dir, &dir->header.set->list);
274
	spin_unlock(&sysctl_lock);
275 276
	if (head)
		entry = head->ctl_table;
277 278 279 280
	*phead = head;
	*pentry = entry;
}

281
static void next_entry(struct ctl_table_header **phead, struct ctl_table **pentry)
282
{
283 284 285 286 287 288 289
	struct ctl_table_header *head = *phead;
	struct ctl_table *entry = *pentry;

	entry++;
	if (!entry->procname) {
		spin_lock(&sysctl_lock);
		unuse_table(head);
290
		head = next_usable_entry(head->parent, &head->ctl_entry);
291 292
		spin_unlock(&sysctl_lock);
		if (head)
293
			entry = head->ctl_table;
294 295 296
	}
	*phead = head;
	*pentry = entry;
297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
}

void register_sysctl_root(struct ctl_table_root *root)
{
}

/*
 * sysctl_perm does NOT grant the superuser all rights automatically, because
 * some sysctl variables are readonly even to root.
 */

static int test_perm(int mode, int op)
{
	if (!current_euid())
		mode >>= 6;
	else if (in_egroup_p(0))
		mode >>= 3;
	if ((op & ~mode & (MAY_READ|MAY_WRITE|MAY_EXEC)) == 0)
		return 0;
	return -EACCES;
}

static int sysctl_perm(struct ctl_table_root *root, struct ctl_table *table, int op)
{
	int mode;

	if (root->permissions)
		mode = root->permissions(root, current->nsproxy, table);
	else
		mode = table->mode;

	return test_perm(mode, op);
}

A
Al Viro 已提交
331 332
static struct inode *proc_sys_make_inode(struct super_block *sb,
		struct ctl_table_header *head, struct ctl_table *table)
333 334
{
	struct inode *inode;
A
Al Viro 已提交
335
	struct proc_inode *ei;
336

A
Al Viro 已提交
337
	inode = new_inode(sb);
338 339 340
	if (!inode)
		goto out;

341 342
	inode->i_ino = get_next_ino();

A
Al Viro 已提交
343
	sysctl_head_get(head);
344
	ei = PROC_I(inode);
A
Al Viro 已提交
345 346 347
	ei->sysctl = head;
	ei->sysctl_entry = table;

348
	inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
A
Al Viro 已提交
349
	inode->i_mode = table->mode;
350
	if (!S_ISDIR(table->mode)) {
A
Al Viro 已提交
351 352 353 354 355 356 357 358
		inode->i_mode |= S_IFREG;
		inode->i_op = &proc_sys_inode_operations;
		inode->i_fop = &proc_sys_file_operations;
	} else {
		inode->i_mode |= S_IFDIR;
		inode->i_op = &proc_sys_dir_operations;
		inode->i_fop = &proc_sys_dir_file_operations;
	}
359 360 361 362
out:
	return inode;
}

A
Adrian Bunk 已提交
363
static struct ctl_table_header *grab_header(struct inode *inode)
364
{
365 366
	struct ctl_table_header *head = PROC_I(inode)->sysctl;
	if (!head)
367
		head = &sysctl_table_root.default_set.dir.header;
368
	return sysctl_head_grab(head);
A
Al Viro 已提交
369
}
370

A
Al Viro 已提交
371 372 373 374 375 376 377 378 379
static struct dentry *proc_sys_lookup(struct inode *dir, struct dentry *dentry,
					struct nameidata *nd)
{
	struct ctl_table_header *head = grab_header(dir);
	struct ctl_table_header *h = NULL;
	struct qstr *name = &dentry->d_name;
	struct ctl_table *p;
	struct inode *inode;
	struct dentry *err = ERR_PTR(-ENOENT);
380
	struct ctl_dir *ctl_dir;
381
	int ret;
382

A
Al Viro 已提交
383 384
	if (IS_ERR(head))
		return ERR_CAST(head);
385

386
	ctl_dir = container_of(head, struct ctl_dir, header);
387

388
	p = lookup_entry(&h, ctl_dir, name->name, name->len);
A
Al Viro 已提交
389
	if (!p)
390 391
		goto out;

392 393 394 395 396
	ret = sysctl_follow_link(&h, &p, current->nsproxy);
	err = ERR_PTR(ret);
	if (ret)
		goto out;

397
	err = ERR_PTR(-ENOMEM);
A
Al Viro 已提交
398 399 400 401
	inode = proc_sys_make_inode(dir->i_sb, h ? h : head, p);
	if (h)
		sysctl_head_finish(h);

402 403 404 405
	if (!inode)
		goto out;

	err = NULL;
406
	d_set_d_op(dentry, &proc_sys_dentry_operations);
407 408 409 410 411 412 413
	d_add(dentry, inode);

out:
	sysctl_head_finish(head);
	return err;
}

414 415
static ssize_t proc_sys_call_handler(struct file *filp, void __user *buf,
		size_t count, loff_t *ppos, int write)
416
{
A
Al Viro 已提交
417 418 419
	struct inode *inode = filp->f_path.dentry->d_inode;
	struct ctl_table_header *head = grab_header(inode);
	struct ctl_table *table = PROC_I(inode)->sysctl_entry;
420 421
	ssize_t error;
	size_t res;
422

A
Al Viro 已提交
423 424
	if (IS_ERR(head))
		return PTR_ERR(head);
425 426 427 428 429 430

	/*
	 * At this point we know that the sysctl was not unregistered
	 * and won't be until we finish.
	 */
	error = -EPERM;
431
	if (sysctl_perm(head->root, table, write ? MAY_WRITE : MAY_READ))
432 433
		goto out;

A
Al Viro 已提交
434 435 436 437 438
	/* if that can happen at all, it should be -EINVAL, not -EISDIR */
	error = -EINVAL;
	if (!table->proc_handler)
		goto out;

439 440
	/* careful: calling conventions are nasty here */
	res = count;
441
	error = table->proc_handler(table, write, buf, &res, ppos);
442 443 444 445 446 447 448 449
	if (!error)
		error = res;
out:
	sysctl_head_finish(head);

	return error;
}

450
static ssize_t proc_sys_read(struct file *filp, char __user *buf,
451 452
				size_t count, loff_t *ppos)
{
453 454
	return proc_sys_call_handler(filp, (void __user *)buf, count, ppos, 0);
}
455

456 457 458 459
static ssize_t proc_sys_write(struct file *filp, const char __user *buf,
				size_t count, loff_t *ppos)
{
	return proc_sys_call_handler(filp, (void __user *)buf, count, ppos, 1);
460 461
}

L
Lucas De Marchi 已提交
462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494
static int proc_sys_open(struct inode *inode, struct file *filp)
{
	struct ctl_table *table = PROC_I(inode)->sysctl_entry;

	if (table->poll)
		filp->private_data = proc_sys_poll_event(table->poll);

	return 0;
}

static unsigned int proc_sys_poll(struct file *filp, poll_table *wait)
{
	struct inode *inode = filp->f_path.dentry->d_inode;
	struct ctl_table *table = PROC_I(inode)->sysctl_entry;
	unsigned long event = (unsigned long)filp->private_data;
	unsigned int ret = DEFAULT_POLLMASK;

	if (!table->proc_handler)
		goto out;

	if (!table->poll)
		goto out;

	poll_wait(filp, &table->poll->wait, wait);

	if (event != atomic_read(&table->poll->event)) {
		filp->private_data = proc_sys_poll_event(table->poll);
		ret = POLLIN | POLLRDNORM | POLLERR | POLLPRI;
	}

out:
	return ret;
}
495 496

static int proc_sys_fill_cache(struct file *filp, void *dirent,
A
Al Viro 已提交
497 498 499
				filldir_t filldir,
				struct ctl_table_header *head,
				struct ctl_table *table)
500 501 502 503 504 505 506 507 508 509 510 511 512
{
	struct dentry *child, *dir = filp->f_path.dentry;
	struct inode *inode;
	struct qstr qname;
	ino_t ino = 0;
	unsigned type = DT_UNKNOWN;

	qname.name = table->procname;
	qname.len  = strlen(table->procname);
	qname.hash = full_name_hash(qname.name, qname.len);

	child = d_lookup(dir, &qname);
	if (!child) {
A
Al Viro 已提交
513 514 515 516 517 518 519
		child = d_alloc(dir, &qname);
		if (child) {
			inode = proc_sys_make_inode(dir->d_sb, head, table);
			if (!inode) {
				dput(child);
				return -ENOMEM;
			} else {
520
				d_set_d_op(child, &proc_sys_dentry_operations);
A
Al Viro 已提交
521
				d_add(child, inode);
522
			}
A
Al Viro 已提交
523 524
		} else {
			return -ENOMEM;
525 526 527
		}
	}
	inode = child->d_inode;
A
Al Viro 已提交
528 529
	ino  = inode->i_ino;
	type = inode->i_mode >> 12;
530
	dput(child);
A
Al Viro 已提交
531 532 533
	return !!filldir(dirent, qname.name, qname.len, filp->f_pos, ino, type);
}

534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552
static int proc_sys_link_fill_cache(struct file *filp, void *dirent,
				    filldir_t filldir,
				    struct ctl_table_header *head,
				    struct ctl_table *table)
{
	int err, ret = 0;
	head = sysctl_head_grab(head);

	/* It is not an error if we can not follow the link ignore it */
	err = sysctl_follow_link(&head, &table, current->nsproxy);
	if (err)
		goto out;

	ret = proc_sys_fill_cache(filp, dirent, filldir, head, table);
out:
	sysctl_head_finish(head);
	return ret;
}

A
Al Viro 已提交
553 554 555 556
static int scan(struct ctl_table_header *head, ctl_table *table,
		unsigned long *pos, struct file *file,
		void *dirent, filldir_t filldir)
{
557
	int res;
A
Al Viro 已提交
558

559 560
	if ((*pos)++ < file->f_pos)
		return 0;
A
Al Viro 已提交
561

562 563 564 565
	if (unlikely(S_ISLNK(table->mode)))
		res = proc_sys_link_fill_cache(file, dirent, filldir, head, table);
	else
		res = proc_sys_fill_cache(file, dirent, filldir, head, table);
A
Al Viro 已提交
566

567 568
	if (res == 0)
		file->f_pos = *pos;
A
Al Viro 已提交
569

570
	return res;
571 572 573 574
}

static int proc_sys_readdir(struct file *filp, void *dirent, filldir_t filldir)
{
A
Al Viro 已提交
575
	struct dentry *dentry = filp->f_path.dentry;
576
	struct inode *inode = dentry->d_inode;
A
Al Viro 已提交
577 578
	struct ctl_table_header *head = grab_header(inode);
	struct ctl_table_header *h = NULL;
579
	struct ctl_table *entry;
580
	struct ctl_dir *ctl_dir;
581
	unsigned long pos;
A
Al Viro 已提交
582 583 584 585
	int ret = -EINVAL;

	if (IS_ERR(head))
		return PTR_ERR(head);
586

587
	ctl_dir = container_of(head, struct ctl_dir, header);
588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604

	ret = 0;
	/* Avoid a switch here: arm builds fail with missing __cmpdi2 */
	if (filp->f_pos == 0) {
		if (filldir(dirent, ".", 1, filp->f_pos,
				inode->i_ino, DT_DIR) < 0)
			goto out;
		filp->f_pos++;
	}
	if (filp->f_pos == 1) {
		if (filldir(dirent, "..", 2, filp->f_pos,
				parent_ino(dentry), DT_DIR) < 0)
			goto out;
		filp->f_pos++;
	}
	pos = 2;

605
	for (first_entry(ctl_dir, &h, &entry); h; next_entry(&h, &entry)) {
606
		ret = scan(h, entry, &pos, filp, dirent, filldir);
A
Al Viro 已提交
607 608 609
		if (ret) {
			sysctl_head_finish(h);
			break;
610 611 612 613 614 615 616 617
		}
	}
	ret = 1;
out:
	sysctl_head_finish(head);
	return ret;
}

618
static int proc_sys_permission(struct inode *inode, int mask)
619 620 621 622 623
{
	/*
	 * sysctl entries that are not writeable,
	 * are _NOT_ writeable, capabilities or not.
	 */
624 625
	struct ctl_table_header *head;
	struct ctl_table *table;
626 627
	int error;

628 629 630 631 632
	/* Executable files are not allowed under /proc/sys/ */
	if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode))
		return -EACCES;

	head = grab_header(inode);
A
Al Viro 已提交
633 634
	if (IS_ERR(head))
		return PTR_ERR(head);
635

636
	table = PROC_I(inode)->sysctl_entry;
A
Al Viro 已提交
637 638 639
	if (!table) /* global root - r-xr-xr-x */
		error = mask & MAY_WRITE ? -EACCES : 0;
	else /* Use the permissions on the sysctl table entry */
640
		error = sysctl_perm(head->root, table, mask & ~MAY_NOT_BLOCK);
641 642 643 644 645 646 647 648 649 650 651 652 653 654

	sysctl_head_finish(head);
	return error;
}

static int proc_sys_setattr(struct dentry *dentry, struct iattr *attr)
{
	struct inode *inode = dentry->d_inode;
	int error;

	if (attr->ia_valid & (ATTR_MODE | ATTR_UID | ATTR_GID))
		return -EPERM;

	error = inode_change_ok(inode, attr);
C
Christoph Hellwig 已提交
655 656 657 658 659 660 661 662 663
	if (error)
		return error;

	if ((attr->ia_valid & ATTR_SIZE) &&
	    attr->ia_size != i_size_read(inode)) {
		error = vmtruncate(inode, attr->ia_size);
		if (error)
			return error;
	}
664

C
Christoph Hellwig 已提交
665 666 667
	setattr_copy(inode, attr);
	mark_inode_dirty(inode);
	return 0;
668 669
}

A
Al Viro 已提交
670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686
static int proc_sys_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
{
	struct inode *inode = dentry->d_inode;
	struct ctl_table_header *head = grab_header(inode);
	struct ctl_table *table = PROC_I(inode)->sysctl_entry;

	if (IS_ERR(head))
		return PTR_ERR(head);

	generic_fillattr(inode, stat);
	if (table)
		stat->mode = (stat->mode & S_IFMT) | table->mode;

	sysctl_head_finish(head);
	return 0;
}

687
static const struct file_operations proc_sys_file_operations = {
L
Lucas De Marchi 已提交
688 689
	.open		= proc_sys_open,
	.poll		= proc_sys_poll,
690 691
	.read		= proc_sys_read,
	.write		= proc_sys_write,
692
	.llseek		= default_llseek,
A
Al Viro 已提交
693 694 695
};

static const struct file_operations proc_sys_dir_file_operations = {
696
	.read		= generic_read_dir,
697
	.readdir	= proc_sys_readdir,
698
	.llseek		= generic_file_llseek,
699 700
};

701
static const struct inode_operations proc_sys_inode_operations = {
A
Al Viro 已提交
702 703 704 705 706 707
	.permission	= proc_sys_permission,
	.setattr	= proc_sys_setattr,
	.getattr	= proc_sys_getattr,
};

static const struct inode_operations proc_sys_dir_operations = {
708 709 710
	.lookup		= proc_sys_lookup,
	.permission	= proc_sys_permission,
	.setattr	= proc_sys_setattr,
A
Al Viro 已提交
711
	.getattr	= proc_sys_getattr,
712 713 714 715
};

static int proc_sys_revalidate(struct dentry *dentry, struct nameidata *nd)
{
716 717
	if (nd->flags & LOOKUP_RCU)
		return -ECHILD;
A
Al Viro 已提交
718 719 720
	return !PROC_I(dentry->d_inode)->sysctl->unregistering;
}

N
Nick Piggin 已提交
721
static int proc_sys_delete(const struct dentry *dentry)
A
Al Viro 已提交
722 723 724 725
{
	return !!PROC_I(dentry->d_inode)->sysctl->unregistering;
}

726 727 728 729 730 731 732 733 734 735 736 737 738 739 740
static int sysctl_is_seen(struct ctl_table_header *p)
{
	struct ctl_table_set *set = p->set;
	int res;
	spin_lock(&sysctl_lock);
	if (p->unregistering)
		res = 0;
	else if (!set->is_seen)
		res = 1;
	else
		res = set->is_seen(set);
	spin_unlock(&sysctl_lock);
	return res;
}

N
Nick Piggin 已提交
741 742 743 744
static int proc_sys_compare(const struct dentry *parent,
		const struct inode *pinode,
		const struct dentry *dentry, const struct inode *inode,
		unsigned int len, const char *str, const struct qstr *name)
A
Al Viro 已提交
745
{
A
Al Viro 已提交
746
	struct ctl_table_header *head;
N
Nick Piggin 已提交
747 748
	/* Although proc doesn't have negative dentries, rcu-walk means
	 * that inode here can be NULL */
A
Al Viro 已提交
749
	/* AV: can it, indeed? */
N
Nick Piggin 已提交
750
	if (!inode)
A
Al Viro 已提交
751
		return 1;
N
Nick Piggin 已提交
752
	if (name->len != len)
A
Al Viro 已提交
753
		return 1;
N
Nick Piggin 已提交
754
	if (memcmp(name->name, str, len))
A
Al Viro 已提交
755
		return 1;
A
Al Viro 已提交
756 757
	head = rcu_dereference(PROC_I(inode)->sysctl);
	return !head || !sysctl_is_seen(head);
758 759
}

A
Al Viro 已提交
760
static const struct dentry_operations proc_sys_dentry_operations = {
761
	.d_revalidate	= proc_sys_revalidate,
A
Al Viro 已提交
762 763
	.d_delete	= proc_sys_delete,
	.d_compare	= proc_sys_compare,
764 765
};

766 767
static struct ctl_dir *find_subdir(struct ctl_dir *dir,
				   const char *name, int namelen)
768
{
769 770
	struct ctl_table_header *head;
	struct ctl_table *entry;
771

772
	entry = find_entry(&head, dir, name, namelen);
773 774 775 776 777 778 779 780
	if (!entry)
		return ERR_PTR(-ENOENT);
	if (S_ISDIR(entry->mode))
		return container_of(head, struct ctl_dir, header);
	return ERR_PTR(-ENOTDIR);
}

static struct ctl_dir *new_dir(struct ctl_table_set *set,
781
			       const char *name, int namelen)
782 783 784 785
{
	struct ctl_table *table;
	struct ctl_dir *new;
	char *new_name;
786

787 788 789
	new = kzalloc(sizeof(*new) + sizeof(struct ctl_table)*2 +
		      namelen + 1, GFP_KERNEL);
	if (!new)
790 791
		return NULL;

792 793 794 795 796 797
	table = (struct ctl_table *)(new + 1);
	new_name = (char *)(table + 2);
	memcpy(new_name, name, namelen);
	new_name[namelen] = '\0';
	table[0].procname = new_name;
	table[0].mode = S_IFDIR|S_IRUGO|S_IXUGO;
798
	init_header(&new->header, set->dir.header.root, set, table);
799 800

	return new;
801 802
}

803 804
static struct ctl_dir *get_subdir(struct ctl_dir *dir,
				  const char *name, int namelen)
805
{
806
	struct ctl_table_set *set = dir->header.set;
807
	struct ctl_dir *subdir, *new = NULL;
808

809
	spin_lock(&sysctl_lock);
810
	subdir = find_subdir(dir, name, namelen);
811 812 813 814 815 816 817 818 819 820 821 822
	if (!IS_ERR(subdir))
		goto found;
	if (PTR_ERR(subdir) != -ENOENT)
		goto failed;

	spin_unlock(&sysctl_lock);
	new = new_dir(set, name, namelen);
	spin_lock(&sysctl_lock);
	subdir = ERR_PTR(-ENOMEM);
	if (!new)
		goto failed;

823
	subdir = find_subdir(dir, name, namelen);
824 825 826 827 828
	if (!IS_ERR(subdir))
		goto found;
	if (PTR_ERR(subdir) != -ENOENT)
		goto failed;

829 830
	if (insert_header(dir, &new->header))
		goto failed;
831 832 833 834 835
	subdir = new;
found:
	subdir->header.nreg++;
failed:
	if (unlikely(IS_ERR(subdir))) {
836 837 838
		printk(KERN_ERR "sysctl could not get directory: ");
		sysctl_print_dir(dir);
		printk(KERN_CONT "/%*.*s %ld\n",
839
			namelen, namelen, name, PTR_ERR(subdir));
840
	}
841 842 843 844 845
	drop_sysctl_table(&dir->header);
	if (new)
		drop_sysctl_table(&new->header);
	spin_unlock(&sysctl_lock);
	return subdir;
846 847
}

848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898
static struct ctl_dir *xlate_dir(struct ctl_table_set *set, struct ctl_dir *dir)
{
	struct ctl_dir *parent;
	const char *procname;
	if (!dir->header.parent)
		return &set->dir;
	parent = xlate_dir(set, dir->header.parent);
	if (IS_ERR(parent))
		return parent;
	procname = dir->header.ctl_table[0].procname;
	return find_subdir(parent, procname, strlen(procname));
}

static int sysctl_follow_link(struct ctl_table_header **phead,
	struct ctl_table **pentry, struct nsproxy *namespaces)
{
	struct ctl_table_header *head;
	struct ctl_table_root *root;
	struct ctl_table_set *set;
	struct ctl_table *entry;
	struct ctl_dir *dir;
	int ret;

	/* Get out quickly if not a link */
	if (!S_ISLNK((*pentry)->mode))
		return 0;

	ret = 0;
	spin_lock(&sysctl_lock);
	root = (*pentry)->data;
	set = lookup_header_set(root, namespaces);
	dir = xlate_dir(set, (*phead)->parent);
	if (IS_ERR(dir))
		ret = PTR_ERR(dir);
	else {
		const char *procname = (*pentry)->procname;
		head = NULL;
		entry = find_entry(&head, dir, procname, strlen(procname));
		ret = -ENOENT;
		if (entry && use_table(head)) {
			unuse_table(*phead);
			*phead = head;
			*pentry = entry;
			ret = 0;
		}
	}

	spin_unlock(&sysctl_lock);
	return ret;
}

899
static int sysctl_check_table_dups(struct ctl_dir *dir, struct ctl_table *old,
900
	struct ctl_table *table)
901
{
902 903
	struct ctl_table *entry, *test;
	int error = 0;
904

905 906 907
	for (entry = old; entry->procname; entry++) {
		for (test = table; test->procname; test++) {
			if (strcmp(entry->procname, test->procname) == 0) {
908 909 910
				printk(KERN_ERR "sysctl duplicate entry: ");
				sysctl_print_dir(dir);
				printk(KERN_CONT "/%s\n", test->procname);
911 912 913 914 915
				error = -EEXIST;
			}
		}
	}
	return error;
916 917
}

918
static int sysctl_check_dups(struct ctl_dir *dir, struct ctl_table *table)
919
{
920
	struct ctl_table_set *set;
921
	struct ctl_table_header *head;
922
	int error = 0;
923

924 925 926 927 928 929
	set = dir->header.set;
	list_for_each_entry(head, &set->list, ctl_entry) {
		if (head->unregistering)
			continue;
		if (head->parent != dir)
			continue;
930
		error = sysctl_check_table_dups(dir, head->ctl_table, table);
931
	}
932
	return error;
933 934
}

935
static int sysctl_err(const char *path, struct ctl_table *table, char *fmt, ...)
936
{
937 938
	struct va_format vaf;
	va_list args;
939

940 941 942 943 944 945
	va_start(args, fmt);
	vaf.fmt = fmt;
	vaf.va = &args;

	printk(KERN_ERR "sysctl table check failed: %s/%s %pV\n",
		path, table->procname, &vaf);
946

947 948
	va_end(args);
	return -EINVAL;
949 950
}

951
static int sysctl_check_table(const char *path, struct ctl_table *table)
952
{
953
	int err = 0;
954 955
	for (; table->procname; table++) {
		if (table->child)
956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976
			err = sysctl_err(path, table, "Not a file");

		if ((table->proc_handler == proc_dostring) ||
		    (table->proc_handler == proc_dointvec) ||
		    (table->proc_handler == proc_dointvec_minmax) ||
		    (table->proc_handler == proc_dointvec_jiffies) ||
		    (table->proc_handler == proc_dointvec_userhz_jiffies) ||
		    (table->proc_handler == proc_dointvec_ms_jiffies) ||
		    (table->proc_handler == proc_doulongvec_minmax) ||
		    (table->proc_handler == proc_doulongvec_ms_jiffies_minmax)) {
			if (!table->data)
				err = sysctl_err(path, table, "No data");
			if (!table->maxlen)
				err = sysctl_err(path, table, "No maxlen");
		}
		if (!table->proc_handler)
			err = sysctl_err(path, table, "No proc_handler");

		if ((table->mode & (S_IRUGO|S_IWUGO)) != table->mode)
			err = sysctl_err(path, table, "bogus .mode 0%o",
				table->mode);
977
	}
978
	return err;
979 980
}

981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089
static struct ctl_table_header *new_links(struct ctl_dir *dir, struct ctl_table *table,
	struct ctl_table_root *link_root)
{
	struct ctl_table *link_table, *entry, *link;
	struct ctl_table_header *links;
	char *link_name;
	int nr_entries, name_bytes;

	name_bytes = 0;
	nr_entries = 0;
	for (entry = table; entry->procname; entry++) {
		nr_entries++;
		name_bytes += strlen(entry->procname) + 1;
	}

	links = kzalloc(sizeof(struct ctl_table_header) +
			sizeof(struct ctl_table)*(nr_entries + 1) +
			name_bytes,
			GFP_KERNEL);

	if (!links)
		return NULL;

	link_table = (struct ctl_table *)(links + 1);
	link_name = (char *)&link_table[nr_entries + 1];

	for (link = link_table, entry = table; entry->procname; link++, entry++) {
		int len = strlen(entry->procname) + 1;
		memcpy(link_name, entry->procname, len);
		link->procname = link_name;
		link->mode = S_IFLNK|S_IRWXUGO;
		link->data = link_root;
		link_name += len;
	}
	init_header(links, dir->header.root, dir->header.set, link_table);
	links->nreg = nr_entries;

	return links;
}

static bool get_links(struct ctl_dir *dir,
	struct ctl_table *table, struct ctl_table_root *link_root)
{
	struct ctl_table_header *head;
	struct ctl_table *entry, *link;

	/* Are there links available for every entry in table? */
	for (entry = table; entry->procname; entry++) {
		const char *procname = entry->procname;
		link = find_entry(&head, dir, procname, strlen(procname));
		if (!link)
			return false;
		if (S_ISDIR(link->mode) && S_ISDIR(entry->mode))
			continue;
		if (S_ISLNK(link->mode) && (link->data == link_root))
			continue;
		return false;
	}

	/* The checks passed.  Increase the registration count on the links */
	for (entry = table; entry->procname; entry++) {
		const char *procname = entry->procname;
		link = find_entry(&head, dir, procname, strlen(procname));
		head->nreg++;
	}
	return true;
}

static int insert_links(struct ctl_table_header *head)
{
	struct ctl_table_set *root_set = &sysctl_table_root.default_set;
	struct ctl_dir *core_parent = NULL;
	struct ctl_table_header *links;
	int err;

	if (head->set == root_set)
		return 0;

	core_parent = xlate_dir(root_set, head->parent);
	if (IS_ERR(core_parent))
		return 0;

	if (get_links(core_parent, head->ctl_table, head->root))
		return 0;

	core_parent->header.nreg++;
	spin_unlock(&sysctl_lock);

	links = new_links(core_parent, head->ctl_table, head->root);

	spin_lock(&sysctl_lock);
	err = -ENOMEM;
	if (!links)
		goto out;

	err = 0;
	if (get_links(core_parent, head->ctl_table, head->root)) {
		kfree(links);
		goto out;
	}

	err = insert_header(core_parent, links);
	if (err)
		kfree(links);
out:
	drop_sysctl_table(&core_parent->header);
	return err;
}

1090
/**
1091
 * __register_sysctl_table - register a leaf sysctl table
1092
 * @set: Sysctl tree to register on
1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107
 * @path: The path to the directory the sysctl table is in.
 * @table: the top-level table structure
 *
 * Register a sysctl table hierarchy. @table should be a filled in ctl_table
 * array. A completely 0 filled entry terminates the table.
 *
 * The members of the &struct ctl_table structure are used as follows:
 *
 * procname - the name of the sysctl file under /proc/sys. Set to %NULL to not
 *            enter a sysctl file
 *
 * data - a pointer to data for use by proc_handler
 *
 * maxlen - the maximum size in bytes of the data
 *
1108
 * mode - the file permissions for the /proc/sys file
1109
 *
1110
 * child - must be %NULL.
1111 1112 1113 1114 1115 1116 1117 1118
 *
 * proc_handler - the text handler routine (described below)
 *
 * extra1, extra2 - extra pointers usable by the proc handler routines
 *
 * Leaf nodes in the sysctl tree will be represented by a single file
 * under /proc; non-leaf nodes will be represented by directories.
 *
1119 1120
 * There must be a proc_handler routine for any terminal nodes.
 * Several default handlers are available to cover common cases -
1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131
 *
 * proc_dostring(), proc_dointvec(), proc_dointvec_jiffies(),
 * proc_dointvec_userhz_jiffies(), proc_dointvec_minmax(),
 * proc_doulongvec_ms_jiffies_minmax(), proc_doulongvec_minmax()
 *
 * It is the handler's job to read the input buffer from user memory
 * and process it. The handler should return 0 on success.
 *
 * This routine returns %NULL on a failure to register, and a pointer
 * to the table header on success.
 */
1132
struct ctl_table_header *__register_sysctl_table(
1133
	struct ctl_table_set *set,
1134
	const char *path, struct ctl_table *table)
1135
{
1136
	struct ctl_table_root *root = set->dir.header.root;
1137
	struct ctl_table_header *links = NULL;
1138
	struct ctl_table_header *header;
1139
	const char *name, *nextname;
1140
	struct ctl_dir *dir;
1141

1142
	header = kzalloc(sizeof(struct ctl_table_header), GFP_KERNEL);
1143 1144 1145
	if (!header)
		return NULL;

1146
	init_header(header, root, set, table);
1147 1148 1149 1150
	if (sysctl_check_table(path, table))
		goto fail;

	spin_lock(&sysctl_lock);
1151
	dir = &set->dir;
1152 1153
	dir->header.nreg++;
	spin_unlock(&sysctl_lock);
1154

1155
	/* Find the directory for the ctl_table */
1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166
	for (name = path; name; name = nextname) {
		int namelen;
		nextname = strchr(name, '/');
		if (nextname) {
			namelen = nextname - name;
			nextname++;
		} else {
			namelen = strlen(name);
		}
		if (namelen == 0)
			continue;
1167

1168
		dir = get_subdir(dir, name, namelen);
1169 1170
		if (IS_ERR(dir))
			goto fail;
1171
	}
1172

1173
	spin_lock(&sysctl_lock);
1174
	if (insert_header(dir, header))
1175
		goto fail_put_dir_locked;
1176

1177
	drop_sysctl_table(&dir->header);
1178 1179 1180
	spin_unlock(&sysctl_lock);

	return header;
1181

1182 1183
fail_put_dir_locked:
	drop_sysctl_table(&dir->header);
1184 1185
	spin_unlock(&sysctl_lock);
fail:
1186
	kfree(links);
1187 1188 1189
	kfree(header);
	dump_stack();
	return NULL;
1190 1191
}

1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204
static char *append_path(const char *path, char *pos, const char *name)
{
	int namelen;
	namelen = strlen(name);
	if (((pos - path) + namelen + 2) >= PATH_MAX)
		return NULL;
	memcpy(pos, name, namelen);
	pos[namelen] = '/';
	pos[namelen + 1] = '\0';
	pos += namelen + 1;
	return pos;
}

1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224
static int count_subheaders(struct ctl_table *table)
{
	int has_files = 0;
	int nr_subheaders = 0;
	struct ctl_table *entry;

	/* special case: no directory and empty directory */
	if (!table || !table->procname)
		return 1;

	for (entry = table; entry->procname; entry++) {
		if (entry->child)
			nr_subheaders += count_subheaders(entry->child);
		else
			has_files = 1;
	}
	return nr_subheaders + has_files;
}

static int register_leaf_sysctl_tables(const char *path, char *pos,
1225
	struct ctl_table_header ***subheader, struct ctl_table_set *set,
1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261
	struct ctl_table *table)
{
	struct ctl_table *ctl_table_arg = NULL;
	struct ctl_table *entry, *files;
	int nr_files = 0;
	int nr_dirs = 0;
	int err = -ENOMEM;

	for (entry = table; entry->procname; entry++) {
		if (entry->child)
			nr_dirs++;
		else
			nr_files++;
	}

	files = table;
	/* If there are mixed files and directories we need a new table */
	if (nr_dirs && nr_files) {
		struct ctl_table *new;
		files = kzalloc(sizeof(struct ctl_table) * (nr_files + 1),
				GFP_KERNEL);
		if (!files)
			goto out;

		ctl_table_arg = files;
		for (new = files, entry = table; entry->procname; entry++) {
			if (entry->child)
				continue;
			*new = *entry;
			new++;
		}
	}

	/* Register everything except a directory full of subdirectories */
	if (nr_files || !nr_dirs) {
		struct ctl_table_header *header;
1262
		header = __register_sysctl_table(set, path, files);
1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286
		if (!header) {
			kfree(ctl_table_arg);
			goto out;
		}

		/* Remember if we need to free the file table */
		header->ctl_table_arg = ctl_table_arg;
		**subheader = header;
		(*subheader)++;
	}

	/* Recurse into the subdirectories. */
	for (entry = table; entry->procname; entry++) {
		char *child_pos;

		if (!entry->child)
			continue;

		err = -ENAMETOOLONG;
		child_pos = append_path(path, pos, entry->procname);
		if (!child_pos)
			goto out;

		err = register_leaf_sysctl_tables(path, child_pos, subheader,
1287
						  set, entry->child);
1288 1289 1290 1291 1292 1293 1294 1295 1296 1297
		pos[0] = '\0';
		if (err)
			goto out;
	}
	err = 0;
out:
	/* On failure our caller will unregister all registered subheaders */
	return err;
}

1298 1299
/**
 * __register_sysctl_paths - register a sysctl table hierarchy
1300
 * @set: Sysctl tree to register on
1301 1302 1303 1304 1305 1306 1307 1308 1309
 * @path: The path to the directory the sysctl table is in.
 * @table: the top-level table structure
 *
 * Register a sysctl table hierarchy. @table should be a filled in ctl_table
 * array. A completely 0 filled entry terminates the table.
 *
 * See __register_sysctl_table for more details.
 */
struct ctl_table_header *__register_sysctl_paths(
1310
	struct ctl_table_set *set,
1311 1312
	const struct ctl_path *path, struct ctl_table *table)
{
1313
	struct ctl_table *ctl_table_arg = table;
1314 1315
	int nr_subheaders = count_subheaders(table);
	struct ctl_table_header *header = NULL, **subheaders, **subheader;
1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328
	const struct ctl_path *component;
	char *new_path, *pos;

	pos = new_path = kmalloc(PATH_MAX, GFP_KERNEL);
	if (!new_path)
		return NULL;

	pos[0] = '\0';
	for (component = path; component->procname; component++) {
		pos = append_path(new_path, pos, component->procname);
		if (!pos)
			goto out;
	}
1329 1330 1331 1332 1333 1334
	while (table->procname && table->child && !table[1].procname) {
		pos = append_path(new_path, pos, table->procname);
		if (!pos)
			goto out;
		table = table->child;
	}
1335
	if (nr_subheaders == 1) {
1336
		header = __register_sysctl_table(set, new_path, table);
1337 1338 1339 1340 1341 1342 1343 1344 1345 1346
		if (header)
			header->ctl_table_arg = ctl_table_arg;
	} else {
		header = kzalloc(sizeof(*header) +
				 sizeof(*subheaders)*nr_subheaders, GFP_KERNEL);
		if (!header)
			goto out;

		subheaders = (struct ctl_table_header **) (header + 1);
		subheader = subheaders;
1347
		header->ctl_table_arg = ctl_table_arg;
1348 1349

		if (register_leaf_sysctl_tables(new_path, pos, &subheader,
1350
						set, table))
1351 1352 1353
			goto err_register_leaves;
	}

1354 1355 1356
out:
	kfree(new_path);
	return header;
1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367

err_register_leaves:
	while (subheader > subheaders) {
		struct ctl_table_header *subh = *(--subheader);
		struct ctl_table *table = subh->ctl_table_arg;
		unregister_sysctl_table(subh);
		kfree(table);
	}
	kfree(header);
	header = NULL;
	goto out;
1368 1369
}

1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382
/**
 * register_sysctl_table_path - register a sysctl table hierarchy
 * @path: The path to the directory the sysctl table is in.
 * @table: the top-level table structure
 *
 * Register a sysctl table hierarchy. @table should be a filled in ctl_table
 * array. A completely 0 filled entry terminates the table.
 *
 * See __register_sysctl_paths for more details.
 */
struct ctl_table_header *register_sysctl_paths(const struct ctl_path *path,
						struct ctl_table *table)
{
1383
	return __register_sysctl_paths(&sysctl_table_root.default_set,
1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404
					path, table);
}
EXPORT_SYMBOL(register_sysctl_paths);

/**
 * register_sysctl_table - register a sysctl table hierarchy
 * @table: the top-level table structure
 *
 * Register a sysctl table hierarchy. @table should be a filled in ctl_table
 * array. A completely 0 filled entry terminates the table.
 *
 * See register_sysctl_paths for more details.
 */
struct ctl_table_header *register_sysctl_table(struct ctl_table *table)
{
	static const struct ctl_path null_path[] = { {} };

	return register_sysctl_paths(null_path, table);
}
EXPORT_SYMBOL(register_sysctl_table);

1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438
static void put_links(struct ctl_table_header *header)
{
	struct ctl_table_set *root_set = &sysctl_table_root.default_set;
	struct ctl_table_root *root = header->root;
	struct ctl_dir *parent = header->parent;
	struct ctl_dir *core_parent;
	struct ctl_table *entry;

	if (header->set == root_set)
		return;

	core_parent = xlate_dir(root_set, parent);
	if (IS_ERR(core_parent))
		return;

	for (entry = header->ctl_table; entry->procname; entry++) {
		struct ctl_table_header *link_head;
		struct ctl_table *link;
		const char *name = entry->procname;

		link = find_entry(&link_head, core_parent, name, strlen(name));
		if (link &&
		    ((S_ISDIR(link->mode) && S_ISDIR(entry->mode)) ||
		     (S_ISLNK(link->mode) && (link->data == root)))) {
			drop_sysctl_table(link_head);
		}
		else {
			printk(KERN_ERR "sysctl link missing during unregister: ");
			sysctl_print_dir(parent);
			printk(KERN_CONT "/%s\n", name);
		}
	}
}

1439 1440
static void drop_sysctl_table(struct ctl_table_header *header)
{
1441 1442
	struct ctl_dir *parent = header->parent;

1443 1444 1445
	if (--header->nreg)
		return;

1446
	put_links(header);
1447 1448 1449
	start_unregistering(header);
	if (!--header->count)
		kfree_rcu(header, rcu);
1450 1451 1452

	if (parent)
		drop_sysctl_table(&parent->header);
1453 1454
}

1455 1456 1457 1458 1459 1460 1461 1462 1463
/**
 * unregister_sysctl_table - unregister a sysctl table hierarchy
 * @header: the header returned from register_sysctl_table
 *
 * Unregisters the sysctl table and all children. proc entries may not
 * actually be removed until they are no longer used by anyone.
 */
void unregister_sysctl_table(struct ctl_table_header * header)
{
1464
	int nr_subheaders;
1465 1466 1467 1468 1469
	might_sleep();

	if (header == NULL)
		return;

1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485
	nr_subheaders = count_subheaders(header->ctl_table_arg);
	if (unlikely(nr_subheaders > 1)) {
		struct ctl_table_header **subheaders;
		int i;

		subheaders = (struct ctl_table_header **)(header + 1);
		for (i = nr_subheaders -1; i >= 0; i--) {
			struct ctl_table_header *subh = subheaders[i];
			struct ctl_table *table = subh->ctl_table_arg;
			unregister_sysctl_table(subh);
			kfree(table);
		}
		kfree(header);
		return;
	}

1486
	spin_lock(&sysctl_lock);
1487
	drop_sysctl_table(header);
1488 1489 1490 1491
	spin_unlock(&sysctl_lock);
}
EXPORT_SYMBOL(unregister_sysctl_table);

1492
void setup_sysctl_set(struct ctl_table_set *set,
1493
	struct ctl_table_root *root,
1494 1495
	int (*is_seen)(struct ctl_table_set *))
{
1496 1497 1498 1499
	memset(set, sizeof(*set), 0);
	INIT_LIST_HEAD(&set->list);
	set->is_seen = is_seen;
	init_header(&set->dir.header, root, set, root_table);
1500 1501
}

1502 1503 1504 1505
void retire_sysctl_set(struct ctl_table_set *set)
{
	WARN_ON(!list_empty(&set->list));
}
1506

A
Alexey Dobriyan 已提交
1507
int __init proc_sys_init(void)
1508
{
A
Alexey Dobriyan 已提交
1509 1510
	struct proc_dir_entry *proc_sys_root;

1511
	proc_sys_root = proc_mkdir("sys", NULL);
A
Al Viro 已提交
1512 1513
	proc_sys_root->proc_iops = &proc_sys_dir_operations;
	proc_sys_root->proc_fops = &proc_sys_dir_file_operations;
1514
	proc_sys_root->nlink = 0;
1515 1516

	return sysctl_init();
1517
}