[deliverable/linux.git] / security / keys / proc.c

/* proc.c: proc files for key database enumeration
 *
 * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
 * Written by David Howells (dhowells@redhat.com)
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version
 * 2 of the License, or (at your option) any later version.
 */

#include <linux/module.h>
#include <linux/init.h>
#include <linux/sched.h>
#include <linux/slab.h>
#include <linux/fs.h>
#include <linux/proc_fs.h>
#include <linux/seq_file.h>
#include <asm/errno.h>
#include "internal.h"

#ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
static int proc_keys_open(struct inode *inode, struct file *file);
static void *proc_keys_start(struct seq_file *p, loff_t *_pos);
static void *proc_keys_next(struct seq_file *p, void *v, loff_t *_pos);
static void proc_keys_stop(struct seq_file *p, void *v);
static int proc_keys_show(struct seq_file *m, void *v);

static const struct seq_operations proc_keys_ops = {
	.start	= proc_keys_start,
	.next	= proc_keys_next,
	.stop	= proc_keys_stop,
	.show	= proc_keys_show,
};

static const struct file_operations proc_keys_fops = {
	.open		= proc_keys_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= seq_release,
};
#endif

static int proc_key_users_open(struct inode *inode, struct file *file);
static void *proc_key_users_start(struct seq_file *p, loff_t *_pos);
static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos);
static void proc_key_users_stop(struct seq_file *p, void *v);
static int proc_key_users_show(struct seq_file *m, void *v);

static const struct seq_operations proc_key_users_ops = {
	.start	= proc_key_users_start,
	.next	= proc_key_users_next,
	.stop	= proc_key_users_stop,
	.show	= proc_key_users_show,
};

static const struct file_operations proc_key_users_fops = {
	.open		= proc_key_users_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= seq_release,
};

/*****************************************************************************/
/*
 * declare the /proc files
 */
static int __init key_proc_init(void)
{
	struct proc_dir_entry *p;

#ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
	p = proc_create("keys", 0, NULL, &proc_keys_fops);
	if (!p)
		panic("Cannot create /proc/keys\n");
#endif

	p = proc_create("key-users", 0, NULL, &proc_key_users_fops);
	if (!p)
		panic("Cannot create /proc/key-users\n");

	return 0;

} /* end key_proc_init() */

__initcall(key_proc_init);

/*****************************************************************************/
/*
 * implement "/proc/keys" to provides a list of the keys on the system
 */
#ifdef CONFIG_KEYS_DEBUG_PROC_KEYS

static struct rb_node *key_serial_next(struct rb_node *n)
{
	struct user_namespace *user_ns = current_user_ns();

	n = rb_next(n);
	while (n) {
		struct key *key = rb_entry(n, struct key, serial_node);
		if (key->user->user_ns == user_ns)
			break;
		n = rb_next(n);
	}
	return n;
}

static int proc_keys_open(struct inode *inode, struct file *file)
{
	return seq_open(file, &proc_keys_ops);
}

static struct key *find_ge_key(key_serial_t id)
{
	struct user_namespace *user_ns = current_user_ns();
	struct rb_node *n = key_serial_tree.rb_node;
	struct key *minkey = NULL;

	while (n) {
		struct key *key = rb_entry(n, struct key, serial_node);
		if (id < key->serial) {
			if (!minkey || minkey->serial > key->serial)
				minkey = key;
			n = n->rb_left;
		} else if (id > key->serial) {
			n = n->rb_right;
		} else {
			minkey = key;
			break;
		}
		key = NULL;
	}

	if (!minkey)
		return NULL;

	for (;;) {
		if (minkey->user->user_ns == user_ns)
			return minkey;
		n = rb_next(&minkey->serial_node);
		if (!n)
			return NULL;
		minkey = rb_entry(n, struct key, serial_node);
	}
}

static void *proc_keys_start(struct seq_file *p, loff_t *_pos)
	__acquires(key_serial_lock)
{
	key_serial_t pos = *_pos;
	struct key *key;

	spin_lock(&key_serial_lock);

	if (*_pos > INT_MAX)
		return NULL;
	key = find_ge_key(pos);
	if (!key)
		return NULL;
	*_pos = key->serial;
	return &key->serial_node;
}

static inline key_serial_t key_node_serial(struct rb_node *n)
{
	struct key *key = rb_entry(n, struct key, serial_node);
	return key->serial;
}

static void *proc_keys_next(struct seq_file *p, void *v, loff_t *_pos)
{
	struct rb_node *n;

	n = key_serial_next(v);
	if (n)
		*_pos = key_node_serial(n);
	return n;
}

static void proc_keys_stop(struct seq_file *p, void *v)
	__releases(key_serial_lock)
{
	spin_unlock(&key_serial_lock);
}

static int proc_keys_show(struct seq_file *m, void *v)
{
	struct rb_node *_p = v;
	struct key *key = rb_entry(_p, struct key, serial_node);
	struct timespec now;
	unsigned long timo;
	char xbuf[12];
	int rc;

	/* check whether the current task is allowed to view the key (assuming
	 * non-possession)
	 * - the caller holds a spinlock, and thus the RCU read lock, making our
	 *   access to __current_cred() safe
	 */
	rc = key_task_permission(make_key_ref(key, 0), current_cred(),
				 KEY_VIEW);
	if (rc < 0)
		return 0;

	now = current_kernel_time();

	rcu_read_lock();

	/* come up with a suitable timeout value */
	if (key->expiry == 0) {
		memcpy(xbuf, "perm", 5);
	}
	else if (now.tv_sec >= key->expiry) {
		memcpy(xbuf, "expd", 5);
	}
	else {
		timo = key->expiry - now.tv_sec;

		if (timo < 60)
			sprintf(xbuf, "%lus", timo);
		else if (timo < 60*60)
			sprintf(xbuf, "%lum", timo / 60);
		else if (timo < 60*60*24)
			sprintf(xbuf, "%luh", timo / (60*60));
		else if (timo < 60*60*24*7)
			sprintf(xbuf, "%lud", timo / (60*60*24));
		else
			sprintf(xbuf, "%luw", timo / (60*60*24*7));
	}

#define showflag(KEY, LETTER, FLAG) \
	(test_bit(FLAG,	&(KEY)->flags) ? LETTER : '-')

	seq_printf(m, "%08x %c%c%c%c%c%c %5d %4s %08x %5d %5d %-9.9s ",
		   key->serial,
		   showflag(key, 'I', KEY_FLAG_INSTANTIATED),
		   showflag(key, 'R', KEY_FLAG_REVOKED),
		   showflag(key, 'D', KEY_FLAG_DEAD),
		   showflag(key, 'Q', KEY_FLAG_IN_QUOTA),
		   showflag(key, 'U', KEY_FLAG_USER_CONSTRUCT),
		   showflag(key, 'N', KEY_FLAG_NEGATIVE),
		   atomic_read(&key->usage),
		   xbuf,
		   key->perm,
		   key->uid,
		   key->gid,
		   key->type->name);

#undef showflag

	if (key->type->describe)
		key->type->describe(key, m);
	seq_putc(m, '\n');

	rcu_read_unlock();

	return 0;

}

#endif /* CONFIG_KEYS_DEBUG_PROC_KEYS */

static struct rb_node *__key_user_next(struct rb_node *n)
{
	while (n) {
		struct key_user *user = rb_entry(n, struct key_user, node);
		if (user->user_ns == current_user_ns())
			break;
		n = rb_next(n);
	}
	return n;
}

static struct rb_node *key_user_next(struct rb_node *n)
{
	return __key_user_next(rb_next(n));
}

static struct rb_node *key_user_first(struct rb_root *r)
{
	struct rb_node *n = rb_first(r);
	return __key_user_next(n);
}
/*****************************************************************************/
/*
 * implement "/proc/key-users" to provides a list of the key users
 */
static int proc_key_users_open(struct inode *inode, struct file *file)
{
	return seq_open(file, &proc_key_users_ops);

}

static void *proc_key_users_start(struct seq_file *p, loff_t *_pos)
	__acquires(key_user_lock)
{
	struct rb_node *_p;
	loff_t pos = *_pos;

	spin_lock(&key_user_lock);

	_p = key_user_first(&key_user_tree);
	while (pos > 0 && _p) {
		pos--;
		_p = key_user_next(_p);
	}

	return _p;

}

static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos)
{
	(*_pos)++;
	return key_user_next((struct rb_node *) v);

}

static void proc_key_users_stop(struct seq_file *p, void *v)
	__releases(key_user_lock)
{
	spin_unlock(&key_user_lock);
}

static int proc_key_users_show(struct seq_file *m, void *v)
{
	struct rb_node *_p = v;
	struct key_user *user = rb_entry(_p, struct key_user, node);
	unsigned maxkeys = (user->uid == 0) ?
		key_quota_root_maxkeys : key_quota_maxkeys;
	unsigned maxbytes = (user->uid == 0) ?
		key_quota_root_maxbytes : key_quota_maxbytes;

	seq_printf(m, "%5u: %5d %d/%d %d/%d %d/%d\n",
		   user->uid,
		   atomic_read(&user->usage),
		   atomic_read(&user->nkeys),
		   atomic_read(&user->nikeys),
		   user->qnkeys,
		   maxkeys,
		   user->qnbytes,
		   maxbytes);

	return 0;

}
Commit	Line	Data
1da177e4 LT	1	/* proc.c: proc files for key database enumeration
	2	*
	3	* Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
	4	* Written by David Howells (dhowells@redhat.com)
	5	*
	6	* This program is free software; you can redistribute it and/or
	7	* modify it under the terms of the GNU General Public License
	8	* as published by the Free Software Foundation; either version
	9	* 2 of the License, or (at your option) any later version.
	10	*/
	11
	12	#include <linux/module.h>
	13	#include <linux/init.h>
	14	#include <linux/sched.h>
	15	#include <linux/slab.h>
	16	#include <linux/fs.h>
	17	#include <linux/proc_fs.h>
	18	#include <linux/seq_file.h>
	19	#include <asm/errno.h>
	20	#include "internal.h"
	21
	22	#ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
	23	static int proc_keys_open(struct inode inode, struct file file);
	24	static void proc_keys_start(struct seq_file p, loff_t *_pos);
	25	static void proc_keys_next(struct seq_file p, void v, loff_t _pos);
	26	static void proc_keys_stop(struct seq_file p, void v);
	27	static int proc_keys_show(struct seq_file m, void v);
	28
1996a109	29	static const struct seq_operations proc_keys_ops = {
1da177e4 LT	30	.start = proc_keys_start,
	31	.next = proc_keys_next,
	32	.stop = proc_keys_stop,
	33	.show = proc_keys_show,
	34	};
	35
9c2e08c5	36	static const struct file_operations proc_keys_fops = {
1da177e4 LT	37	.open = proc_keys_open,
	38	.read = seq_read,
	39	.llseek = seq_lseek,
	40	.release = seq_release,
	41	};
	42	#endif
	43
	44	static int proc_key_users_open(struct inode inode, struct file file);
	45	static void proc_key_users_start(struct seq_file p, loff_t *_pos);
	46	static void proc_key_users_next(struct seq_file p, void v, loff_t _pos);
	47	static void proc_key_users_stop(struct seq_file p, void v);
	48	static int proc_key_users_show(struct seq_file m, void v);
	49
1996a109	50	static const struct seq_operations proc_key_users_ops = {
1da177e4 LT	51	.start = proc_key_users_start,
	52	.next = proc_key_users_next,
	53	.stop = proc_key_users_stop,
	54	.show = proc_key_users_show,
	55	};
	56
9c2e08c5	57	static const struct file_operations proc_key_users_fops = {
1da177e4 LT	58	.open = proc_key_users_open,
	59	.read = seq_read,
	60	.llseek = seq_lseek,
	61	.release = seq_release,
	62	};
	63
	64	/*****************************************************************************/
	65	/*
	66	* declare the /proc files
	67	*/
	68	static int __init key_proc_init(void)
	69	{
	70	struct proc_dir_entry *p;
	71
	72	#ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
da91d2ef	73	p = proc_create("keys", 0, NULL, &proc_keys_fops);
1da177e4 LT	74	if (!p)
1da177e4 LT	75	panic("Cannot create /proc/keys\n");
1da177e4 LT	76	#endif
1da177e4 LT	77
da91d2ef	78	p = proc_create("key-users", 0, NULL, &proc_key_users_fops);
1da177e4 LT	79	if (!p)
	80	panic("Cannot create /proc/key-users\n");
	81
1da177e4 LT	82	return 0;
	83
	84	} /* end key_proc_init() */
	85
	86	__initcall(key_proc_init);
	87
	88	/*****************************************************************************/
	89	/*
	90	* implement "/proc/keys" to provides a list of the keys on the system
	91	*/
	92	#ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
	93
ad73a717	94	static struct rb_node key_serial_next(struct rb_node n)
454804ab	95	{
ad73a717 SH	96	struct user_namespace *user_ns = current_user_ns();
	97
	98	n = rb_next(n);
454804ab SH	99	while (n) {
454804ab SH	100	struct key *key = rb_entry(n, struct key, serial_node);
ad73a717	101	if (key->user->user_ns == user_ns)
454804ab SH	102	break;
	103	n = rb_next(n);
	104	}
	105	return n;
	106	}
	107
ad73a717	108	static int proc_keys_open(struct inode inode, struct file file)
454804ab	109	{
ad73a717	110	return seq_open(file, &proc_keys_ops);
454804ab SH	111	}
454804ab SH	112
ad73a717	113	static struct key *find_ge_key(key_serial_t id)
454804ab	114	{
ad73a717 SH	115	struct user_namespace *user_ns = current_user_ns();
	116	struct rb_node *n = key_serial_tree.rb_node;
	117	struct key *minkey = NULL;
454804ab	118
ad73a717 SH	119	while (n) {
	120	struct key *key = rb_entry(n, struct key, serial_node);
	121	if (id < key->serial) {
	122	if (!minkey \|\| minkey->serial > key->serial)
	123	minkey = key;
	124	n = n->rb_left;
	125	} else if (id > key->serial) {
	126	n = n->rb_right;
	127	} else {
	128	minkey = key;
	129	break;
	130	}
	131	key = NULL;
	132	}
1da177e4	133
ad73a717 SH	134	if (!minkey)
	135	return NULL;
	136
	137	for (;;) {
	138	if (minkey->user->user_ns == user_ns)
	139	return minkey;
	140	n = rb_next(&minkey->serial_node);
	141	if (!n)
	142	return NULL;
	143	minkey = rb_entry(n, struct key, serial_node);
	144	}
1da177e4 LT	145	}
	146
	147	static void proc_keys_start(struct seq_file p, loff_t *_pos)
86abcf9c	148	__acquires(key_serial_lock)
1da177e4	149	{
ad73a717 SH	150	key_serial_t pos = *_pos;
ad73a717 SH	151	struct key *key;
1da177e4 LT	152
	153	spin_lock(&key_serial_lock);
	154
ad73a717 SH	155	if (*_pos > INT_MAX)
	156	return NULL;
	157	key = find_ge_key(pos);
	158	if (!key)
	159	return NULL;
	160	*_pos = key->serial;
	161	return &key->serial_node;
	162	}
1da177e4	163
ad73a717 SH	164	static inline key_serial_t key_node_serial(struct rb_node *n)
	165	{
	166	struct key *key = rb_entry(n, struct key, serial_node);
	167	return key->serial;
1da177e4 LT	168	}
	169
	170	static void proc_keys_next(struct seq_file p, void v, loff_t _pos)
	171	{
ad73a717	172	struct rb_node *n;
1da177e4	173
ad73a717 SH	174	n = key_serial_next(v);
	175	if (n)
	176	*_pos = key_node_serial(n);
	177	return n;
1da177e4 LT	178	}
	179
	180	static void proc_keys_stop(struct seq_file p, void v)
86abcf9c	181	__releases(key_serial_lock)
1da177e4 LT	182	{
	183	spin_unlock(&key_serial_lock);
	184	}
	185
	186	static int proc_keys_show(struct seq_file m, void v)
	187	{
	188	struct rb_node *_p = v;
	189	struct key *key = rb_entry(_p, struct key, serial_node);
	190	struct timespec now;
	191	unsigned long timo;
	192	char xbuf[12];
06ec7be5 ML	193	int rc;
	194
	195	/* check whether the current task is allowed to view the key (assuming
d84f4f99 DH	196	* non-possession)
	197	* - the caller holds a spinlock, and thus the RCU read lock, making our
	198	* access to __current_cred() safe
	199	*/
	200	rc = key_task_permission(make_key_ref(key, 0), current_cred(),
	201	KEY_VIEW);
06ec7be5 ML	202	if (rc < 0)
06ec7be5 ML	203	return 0;
1da177e4 LT	204
	205	now = current_kernel_time();
	206
76d8aeab	207	rcu_read_lock();
1da177e4 LT	208
	209	/* come up with a suitable timeout value */
	210	if (key->expiry == 0) {
	211	memcpy(xbuf, "perm", 5);
	212	}
	213	else if (now.tv_sec >= key->expiry) {
	214	memcpy(xbuf, "expd", 5);
	215	}
	216	else {
	217	timo = key->expiry - now.tv_sec;
	218
	219	if (timo < 60)
	220	sprintf(xbuf, "%lus", timo);
	221	else if (timo < 60*60)
	222	sprintf(xbuf, "%lum", timo / 60);
	223	else if (timo < 606024)
	224	sprintf(xbuf, "%luh", timo / (60*60));
	225	else if (timo < 606024*7)
	226	sprintf(xbuf, "%lud", timo / (606024));
	227	else
	228	sprintf(xbuf, "%luw", timo / (606024*7));
	229	}
	230
76d8aeab DH	231	#define showflag(KEY, LETTER, FLAG) \
	232	(test_bit(FLAG, &(KEY)->flags) ? LETTER : '-')
	233
664cceb0	234	seq_printf(m, "%08x %c%c%c%c%c%c %5d %4s %08x %5d %5d %-9.9s ",
1da177e4	235	key->serial,
76d8aeab DH	236	showflag(key, 'I', KEY_FLAG_INSTANTIATED),
	237	showflag(key, 'R', KEY_FLAG_REVOKED),
	238	showflag(key, 'D', KEY_FLAG_DEAD),
	239	showflag(key, 'Q', KEY_FLAG_IN_QUOTA),
	240	showflag(key, 'U', KEY_FLAG_USER_CONSTRUCT),
	241	showflag(key, 'N', KEY_FLAG_NEGATIVE),
1da177e4 LT	242	atomic_read(&key->usage),
	243	xbuf,
	244	key->perm,
	245	key->uid,
	246	key->gid,
	247	key->type->name);
	248
76d8aeab DH	249	#undef showflag
76d8aeab DH	250
1da177e4 LT	251	if (key->type->describe)
	252	key->type->describe(key, m);
	253	seq_putc(m, '\n');
	254
76d8aeab	255	rcu_read_unlock();
1da177e4 LT	256
	257	return 0;
	258
	259	}
	260
	261	#endif /* CONFIG_KEYS_DEBUG_PROC_KEYS */
	262
454804ab SH	263	static struct rb_node __key_user_next(struct rb_node n)
	264	{
	265	while (n) {
	266	struct key_user *user = rb_entry(n, struct key_user, node);
	267	if (user->user_ns == current_user_ns())
	268	break;
	269	n = rb_next(n);
	270	}
	271	return n;
	272	}
	273
	274	static struct rb_node key_user_next(struct rb_node n)
	275	{
	276	return __key_user_next(rb_next(n));
	277	}
	278
	279	static struct rb_node key_user_first(struct rb_root r)
	280	{
	281	struct rb_node *n = rb_first(r);
	282	return __key_user_next(n);
	283	}
1da177e4 LT	284	/*****************************************************************************/
	285	/*
	286	* implement "/proc/key-users" to provides a list of the key users
	287	*/
	288	static int proc_key_users_open(struct inode inode, struct file file)
	289	{
	290	return seq_open(file, &proc_key_users_ops);
	291
	292	}
	293
	294	static void proc_key_users_start(struct seq_file p, loff_t *_pos)
86abcf9c	295	__acquires(key_user_lock)
1da177e4 LT	296	{
	297	struct rb_node *_p;
	298	loff_t pos = *_pos;
	299
	300	spin_lock(&key_user_lock);
	301
454804ab	302	_p = key_user_first(&key_user_tree);
1da177e4 LT	303	while (pos > 0 && _p) {
1da177e4 LT	304	pos--;
454804ab	305	_p = key_user_next(_p);
1da177e4 LT	306	}
	307
	308	return _p;
	309
	310	}
	311
	312	static void proc_key_users_next(struct seq_file p, void v, loff_t _pos)
	313	{
	314	(*_pos)++;
454804ab	315	return key_user_next((struct rb_node *) v);
1da177e4 LT	316
	317	}
	318
	319	static void proc_key_users_stop(struct seq_file p, void v)
86abcf9c	320	__releases(key_user_lock)
1da177e4 LT	321	{
	322	spin_unlock(&key_user_lock);
	323	}
	324
	325	static int proc_key_users_show(struct seq_file m, void v)
	326	{
	327	struct rb_node *_p = v;
	328	struct key_user *user = rb_entry(_p, struct key_user, node);
0b77f5bf DH	329	unsigned maxkeys = (user->uid == 0) ?
	330	key_quota_root_maxkeys : key_quota_maxkeys;
	331	unsigned maxbytes = (user->uid == 0) ?
	332	key_quota_root_maxbytes : key_quota_maxbytes;
1da177e4 LT	333
	334	seq_printf(m, "%5u: %5d %d/%d %d/%d %d/%d\n",
	335	user->uid,
	336	atomic_read(&user->usage),
	337	atomic_read(&user->nkeys),
	338	atomic_read(&user->nikeys),
	339	user->qnkeys,
0b77f5bf	340	maxkeys,
1da177e4	341	user->qnbytes,
0b77f5bf	342	maxbytes);
1da177e4 LT	343
	344	return 0;
	345
	346	}