1 /* proc.c: proc files for key database enumeration
3 * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
4 * Written by David Howells (dhowells@redhat.com)
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.
12 #include <linux/module.h>
13 #include <linux/init.h>
14 #include <linux/sched.h>
16 #include <linux/proc_fs.h>
17 #include <linux/seq_file.h>
18 #include <asm/errno.h>
21 #ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
22 static int proc_keys_open(struct inode *inode, struct file *file);
23 static void *proc_keys_start(struct seq_file *p, loff_t *_pos);
24 static void *proc_keys_next(struct seq_file *p, void *v, loff_t *_pos);
25 static void proc_keys_stop(struct seq_file *p, void *v);
26 static int proc_keys_show(struct seq_file *m, void *v);
28 static const struct seq_operations proc_keys_ops = {
29 .start = proc_keys_start,
30 .next = proc_keys_next,
31 .stop = proc_keys_stop,
32 .show = proc_keys_show,
35 static const struct file_operations proc_keys_fops = {
36 .open = proc_keys_open,
39 .release = seq_release,
43 static int proc_key_users_open(struct inode *inode, struct file *file);
44 static void *proc_key_users_start(struct seq_file *p, loff_t *_pos);
45 static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos);
46 static void proc_key_users_stop(struct seq_file *p, void *v);
47 static int proc_key_users_show(struct seq_file *m, void *v);
49 static const struct seq_operations proc_key_users_ops = {
50 .start = proc_key_users_start,
51 .next = proc_key_users_next,
52 .stop = proc_key_users_stop,
53 .show = proc_key_users_show,
56 static const struct file_operations proc_key_users_fops = {
57 .open = proc_key_users_open,
60 .release = seq_release,
64 * declare the /proc files
66 static int __init key_proc_init(void)
68 struct proc_dir_entry *p;
70 #ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
71 p = proc_create("keys", 0, NULL, &proc_keys_fops);
73 panic("Cannot create /proc/keys\n");
76 p = proc_create("key-users", 0, NULL, &proc_key_users_fops);
78 panic("Cannot create /proc/key-users\n");
83 __initcall(key_proc_init);
86 * implement "/proc/keys" to provides a list of the keys on the system
88 #ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
90 static struct rb_node *key_serial_next(struct rb_node *n)
92 struct user_namespace *user_ns = current_user_ns();
96 struct key *key = rb_entry(n, struct key, serial_node);
97 if (key->user->user_ns == user_ns)
104 static int proc_keys_open(struct inode *inode, struct file *file)
106 return seq_open(file, &proc_keys_ops);
109 static struct key *find_ge_key(key_serial_t id)
111 struct user_namespace *user_ns = current_user_ns();
112 struct rb_node *n = key_serial_tree.rb_node;
113 struct key *minkey = NULL;
116 struct key *key = rb_entry(n, struct key, serial_node);
117 if (id < key->serial) {
118 if (!minkey || minkey->serial > key->serial)
121 } else if (id > key->serial) {
134 if (minkey->user->user_ns == user_ns)
136 n = rb_next(&minkey->serial_node);
139 minkey = rb_entry(n, struct key, serial_node);
143 static void *proc_keys_start(struct seq_file *p, loff_t *_pos)
144 __acquires(key_serial_lock)
146 key_serial_t pos = *_pos;
149 spin_lock(&key_serial_lock);
153 key = find_ge_key(pos);
157 return &key->serial_node;
160 static inline key_serial_t key_node_serial(struct rb_node *n)
162 struct key *key = rb_entry(n, struct key, serial_node);
166 static void *proc_keys_next(struct seq_file *p, void *v, loff_t *_pos)
170 n = key_serial_next(v);
172 *_pos = key_node_serial(n);
176 static void proc_keys_stop(struct seq_file *p, void *v)
177 __releases(key_serial_lock)
179 spin_unlock(&key_serial_lock);
182 static int proc_keys_show(struct seq_file *m, void *v)
184 const struct cred *cred = current_cred();
185 struct rb_node *_p = v;
186 struct key *key = rb_entry(_p, struct key, serial_node);
189 key_ref_t key_ref, skey_ref;
193 key_ref = make_key_ref(key, 0);
195 /* determine if the key is possessed by this process (a test we can
196 * skip if the key does not indicate the possessor can view it
198 if (key->perm & KEY_POS_VIEW) {
199 skey_ref = search_my_process_keyrings(key->type, key,
200 lookup_user_key_possessed,
202 if (!IS_ERR(skey_ref)) {
203 key_ref_put(skey_ref);
204 key_ref = make_key_ref(key, 1);
208 /* check whether the current task is allowed to view the key (assuming
210 * - the caller holds a spinlock, and thus the RCU read lock, making our
211 * access to __current_cred() safe
213 rc = key_task_permission(key_ref, cred, KEY_VIEW);
217 now = current_kernel_time();
221 /* come up with a suitable timeout value */
222 if (key->expiry == 0) {
223 memcpy(xbuf, "perm", 5);
224 } else if (now.tv_sec >= key->expiry) {
225 memcpy(xbuf, "expd", 5);
227 timo = key->expiry - now.tv_sec;
230 sprintf(xbuf, "%lus", timo);
231 else if (timo < 60*60)
232 sprintf(xbuf, "%lum", timo / 60);
233 else if (timo < 60*60*24)
234 sprintf(xbuf, "%luh", timo / (60*60));
235 else if (timo < 60*60*24*7)
236 sprintf(xbuf, "%lud", timo / (60*60*24));
238 sprintf(xbuf, "%luw", timo / (60*60*24*7));
241 #define showflag(KEY, LETTER, FLAG) \
242 (test_bit(FLAG, &(KEY)->flags) ? LETTER : '-')
244 seq_printf(m, "%08x %c%c%c%c%c%c %5d %4s %08x %5d %5d %-9.9s ",
246 showflag(key, 'I', KEY_FLAG_INSTANTIATED),
247 showflag(key, 'R', KEY_FLAG_REVOKED),
248 showflag(key, 'D', KEY_FLAG_DEAD),
249 showflag(key, 'Q', KEY_FLAG_IN_QUOTA),
250 showflag(key, 'U', KEY_FLAG_USER_CONSTRUCT),
251 showflag(key, 'N', KEY_FLAG_NEGATIVE),
252 atomic_read(&key->usage),
261 if (key->type->describe)
262 key->type->describe(key, m);
269 #endif /* CONFIG_KEYS_DEBUG_PROC_KEYS */
271 static struct rb_node *__key_user_next(struct rb_node *n)
274 struct key_user *user = rb_entry(n, struct key_user, node);
275 if (user->user_ns == current_user_ns())
282 static struct rb_node *key_user_next(struct rb_node *n)
284 return __key_user_next(rb_next(n));
287 static struct rb_node *key_user_first(struct rb_root *r)
289 struct rb_node *n = rb_first(r);
290 return __key_user_next(n);
294 * implement "/proc/key-users" to provides a list of the key users
296 static int proc_key_users_open(struct inode *inode, struct file *file)
298 return seq_open(file, &proc_key_users_ops);
301 static void *proc_key_users_start(struct seq_file *p, loff_t *_pos)
302 __acquires(key_user_lock)
307 spin_lock(&key_user_lock);
309 _p = key_user_first(&key_user_tree);
310 while (pos > 0 && _p) {
312 _p = key_user_next(_p);
318 static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos)
321 return key_user_next((struct rb_node *)v);
324 static void proc_key_users_stop(struct seq_file *p, void *v)
325 __releases(key_user_lock)
327 spin_unlock(&key_user_lock);
330 static int proc_key_users_show(struct seq_file *m, void *v)
332 struct rb_node *_p = v;
333 struct key_user *user = rb_entry(_p, struct key_user, node);
334 unsigned maxkeys = (user->uid == 0) ?
335 key_quota_root_maxkeys : key_quota_maxkeys;
336 unsigned maxbytes = (user->uid == 0) ?
337 key_quota_root_maxbytes : key_quota_maxbytes;
339 seq_printf(m, "%5u: %5d %d/%d %d/%d %d/%d\n",
341 atomic_read(&user->usage),
342 atomic_read(&user->nkeys),
343 atomic_read(&user->nikeys),