proc.c 8.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
/* 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/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);

28
static const struct seq_operations proc_keys_ops = {
L
Linus Torvalds 已提交
29 30 31 32 33 34
	.start	= proc_keys_start,
	.next	= proc_keys_next,
	.stop	= proc_keys_stop,
	.show	= proc_keys_show,
};

35
static const struct file_operations proc_keys_fops = {
L
Linus Torvalds 已提交
36 37 38 39 40 41 42 43 44 45 46 47 48
	.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);

49
static const struct seq_operations proc_key_users_ops = {
L
Linus Torvalds 已提交
50 51 52 53 54 55
	.start	= proc_key_users_start,
	.next	= proc_key_users_next,
	.stop	= proc_key_users_stop,
	.show	= proc_key_users_show,
};

56
static const struct file_operations proc_key_users_fops = {
L
Linus Torvalds 已提交
57 58 59 60 61 62 63 64 65 66 67 68 69 70 71
	.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
A
Alexey Dobriyan 已提交
72
	p = proc_create("keys", 0, NULL, &proc_keys_fops);
L
Linus Torvalds 已提交
73 74 75 76
	if (!p)
		panic("Cannot create /proc/keys\n");
#endif

A
Alexey Dobriyan 已提交
77
	p = proc_create("key-users", 0, NULL, &proc_key_users_fops);
L
Linus Torvalds 已提交
78 79 80 81 82 83 84 85 86 87 88 89 90 91 92
	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

93
static struct rb_node *key_serial_next(struct rb_node *n)
94
{
95 96 97
	struct user_namespace *user_ns = current_user_ns();

	n = rb_next(n);
98 99
	while (n) {
		struct key *key = rb_entry(n, struct key, serial_node);
100
		if (key->user->user_ns == user_ns)
101 102 103 104 105 106
			break;
		n = rb_next(n);
	}
	return n;
}

107
static int proc_keys_open(struct inode *inode, struct file *file)
108
{
109
	return seq_open(file, &proc_keys_ops);
110 111
}

112
static struct key *find_ge_key(key_serial_t id)
113
{
114 115 116
	struct user_namespace *user_ns = current_user_ns();
	struct rb_node *n = key_serial_tree.rb_node;
	struct key *minkey = NULL;
117

118 119 120 121 122 123 124 125 126 127 128 129 130 131
	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;
	}
L
Linus Torvalds 已提交
132

133 134 135 136 137 138 139 140 141 142 143
	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);
	}
L
Linus Torvalds 已提交
144 145 146
}

static void *proc_keys_start(struct seq_file *p, loff_t *_pos)
147
	__acquires(key_serial_lock)
L
Linus Torvalds 已提交
148
{
149 150
	key_serial_t pos = *_pos;
	struct key *key;
L
Linus Torvalds 已提交
151 152 153

	spin_lock(&key_serial_lock);

154 155 156 157 158 159 160 161
	if (*_pos > INT_MAX)
		return NULL;
	key = find_ge_key(pos);
	if (!key)
		return NULL;
	*_pos = key->serial;
	return &key->serial_node;
}
L
Linus Torvalds 已提交
162

163 164 165 166
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;
L
Linus Torvalds 已提交
167 168 169 170
}

static void *proc_keys_next(struct seq_file *p, void *v, loff_t *_pos)
{
171
	struct rb_node *n;
L
Linus Torvalds 已提交
172

173 174 175 176
	n = key_serial_next(v);
	if (n)
		*_pos = key_node_serial(n);
	return n;
L
Linus Torvalds 已提交
177 178 179
}

static void proc_keys_stop(struct seq_file *p, void *v)
180
	__releases(key_serial_lock)
L
Linus Torvalds 已提交
181 182 183 184 185 186
{
	spin_unlock(&key_serial_lock);
}

static int proc_keys_show(struct seq_file *m, void *v)
{
187
	const struct cred *cred = current_cred();
L
Linus Torvalds 已提交
188 189 190 191
	struct rb_node *_p = v;
	struct key *key = rb_entry(_p, struct key, serial_node);
	struct timespec now;
	unsigned long timo;
192
	key_ref_t key_ref, skey_ref;
L
Linus Torvalds 已提交
193
	char xbuf[12];
194 195
	int rc;

196 197 198 199 200 201 202 203 204 205 206 207 208 209 210
	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(key->type, key,
						      lookup_user_key_possessed,
						      cred);
		if (!IS_ERR(skey_ref)) {
			key_ref_put(skey_ref);
			key_ref = make_key_ref(key, 1);
		}
	}

211
	/* check whether the current task is allowed to view the key (assuming
D
David Howells 已提交
212 213 214 215
	 * non-possession)
	 * - the caller holds a spinlock, and thus the RCU read lock, making our
	 *   access to __current_cred() safe
	 */
216
	rc = key_task_permission(key_ref, cred, KEY_VIEW);
217 218
	if (rc < 0)
		return 0;
L
Linus Torvalds 已提交
219 220 221

	now = current_kernel_time();

222
	rcu_read_lock();
L
Linus Torvalds 已提交
223 224 225 226

	/* come up with a suitable timeout value */
	if (key->expiry == 0) {
		memcpy(xbuf, "perm", 5);
227
	} else if (now.tv_sec >= key->expiry) {
L
Linus Torvalds 已提交
228
		memcpy(xbuf, "expd", 5);
229
	} else {
L
Linus Torvalds 已提交
230 231 232 233 234 235 236 237 238 239 240 241 242 243
		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));
	}

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

247
	seq_printf(m, "%08x %c%c%c%c%c%c %5d %4s %08x %5d %5d %-9.9s ",
L
Linus Torvalds 已提交
248
		   key->serial,
249 250 251 252 253 254
		   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),
L
Linus Torvalds 已提交
255 256 257 258 259 260 261
		   atomic_read(&key->usage),
		   xbuf,
		   key->perm,
		   key->uid,
		   key->gid,
		   key->type->name);

262 263
#undef showflag

L
Linus Torvalds 已提交
264 265 266 267
	if (key->type->describe)
		key->type->describe(key, m);
	seq_putc(m, '\n');

268
	rcu_read_unlock();
L
Linus Torvalds 已提交
269 270 271 272 273
	return 0;
}

#endif /* CONFIG_KEYS_DEBUG_PROC_KEYS */

274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
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);
}
295

L
Linus Torvalds 已提交
296 297 298 299 300 301 302 303 304 305
/*****************************************************************************/
/*
 * 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)
306
	__acquires(key_user_lock)
L
Linus Torvalds 已提交
307 308 309 310 311 312
{
	struct rb_node *_p;
	loff_t pos = *_pos;

	spin_lock(&key_user_lock);

313
	_p = key_user_first(&key_user_tree);
L
Linus Torvalds 已提交
314 315
	while (pos > 0 && _p) {
		pos--;
316
		_p = key_user_next(_p);
L
Linus Torvalds 已提交
317 318 319 320 321 322 323 324
	}

	return _p;
}

static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos)
{
	(*_pos)++;
325
	return key_user_next((struct rb_node *)v);
L
Linus Torvalds 已提交
326 327 328
}

static void proc_key_users_stop(struct seq_file *p, void *v)
329
	__releases(key_user_lock)
L
Linus Torvalds 已提交
330 331 332 333 334 335 336 337
{
	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);
338 339 340 341
	unsigned maxkeys = (user->uid == 0) ?
		key_quota_root_maxkeys : key_quota_maxkeys;
	unsigned maxbytes = (user->uid == 0) ?
		key_quota_root_maxbytes : key_quota_maxbytes;
L
Linus Torvalds 已提交
342 343 344 345 346 347 348

	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,
349
		   maxkeys,
L
Linus Torvalds 已提交
350
		   user->qnbytes,
351
		   maxbytes);
L
Linus Torvalds 已提交
352 353 354 355

	return 0;

}