[mirror_ubuntu-artful-kernel.git] / security / keys / proc.c

/* procfs 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/fs.h>
#include <linux/proc_fs.h>
#include <linux/seq_file.h>
#include <asm/errno.h>
#include "internal.h"

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,
};

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;

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

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

	return 0;
}

__initcall(key_proc_init);

/*
 * Implement "/proc/keys" to provide a list of the keys on the system that
 * grant View permission to the caller.
 */
static struct rb_node *key_serial_next(struct seq_file *p, struct rb_node *n)
{
	struct user_namespace *user_ns = seq_user_ns(p);

	n = rb_next(n);
	while (n) {
		struct key *key = rb_entry(n, struct key, serial_node);
		if (kuid_has_mapping(user_ns, key->user->uid))
			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(struct seq_file *p, key_serial_t id)
{
	struct user_namespace *user_ns = seq_user_ns(p);
	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 (kuid_has_mapping(user_ns, minkey->user->uid))
			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(p, 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(p, 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;
	key_ref_t key_ref, skey_ref;
	char xbuf[16];
	short state;
	int rc;

	struct keyring_search_context ctx = {
		.index_key.type		= key->type,
		.index_key.description	= key->description,
		.cred			= current_cred(),
		.match_data.cmp		= lookup_user_key_possessed,
		.match_data.raw_data	= key,
		.match_data.lookup_type	= KEYRING_SEARCH_LOOKUP_DIRECT,
		.flags			= KEYRING_SEARCH_NO_STATE_CHECK,
	};

	key_ref = make_key_ref(key, 0);

	/* determine if the key is possessed by this process (a test we can
	 * skip if the key does not indicate the possessor can view it
	 */
	if (key->perm & KEY_POS_VIEW) {
		skey_ref = search_my_process_keyrings(&ctx);
		if (!IS_ERR(skey_ref)) {
			key_ref_put(skey_ref);
			key_ref = make_key_ref(key, 1);
		}
	}

	/* 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(key_ref, ctx.cred, KEY_NEED_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));
	}

	state = key_read_state(key);

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

	seq_printf(m, "%08x %c%c%c%c%c%c%c %5d %4s %08x %5d %5d %-9.9s ",
		   key->serial,
		   state != KEY_IS_UNINSTANTIATED ? 'I' : '-',
		   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),
		   state < 0 ? 'N' : '-',
		   showflag(key, 'i', KEY_FLAG_INVALIDATED),
		   refcount_read(&key->usage),
		   xbuf,
		   key->perm,
		   from_kuid_munged(seq_user_ns(m), key->uid),
		   from_kgid_munged(seq_user_ns(m), 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;
}

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

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

static struct rb_node *key_user_first(struct user_namespace *user_ns, struct rb_root *r)
{
	struct rb_node *n = rb_first(r);
	return __key_user_next(user_ns, n);
}

/*
 * Implement "/proc/key-users" to provides a list of the key users and their
 * quotas.
 */
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(seq_user_ns(p), &key_user_tree);
	while (pos > 0 && _p) {
		pos--;
		_p = key_user_next(seq_user_ns(p), _p);
	}

	return _p;
}

static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos)
{
	(*_pos)++;
	return key_user_next(seq_user_ns(p), (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 = uid_eq(user->uid, GLOBAL_ROOT_UID) ?
		key_quota_root_maxkeys : key_quota_maxkeys;
	unsigned maxbytes = uid_eq(user->uid, GLOBAL_ROOT_UID) ?
		key_quota_root_maxbytes : key_quota_maxbytes;

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

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