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,
63 /*****************************************************************************/
65 * declare the /proc files
67 static int __init key_proc_init(void)
69 struct proc_dir_entry *p;
71 #ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
72 p = proc_create("keys", 0, NULL, &proc_keys_fops);
74 panic("Cannot create /proc/keys\n");
77 p = proc_create("key-users", 0, NULL, &proc_key_users_fops);
79 panic("Cannot create /proc/key-users\n");
83 } /* end key_proc_init() */
85 __initcall(key_proc_init);
87 /*****************************************************************************/
89 * implement "/proc/keys" to provides a list of the keys on the system
91 #ifdef CONFIG_KEYS_DEBUG_PROC_KEYS
93 static struct rb_node *key_serial_next(struct rb_node *n)
95 struct user_namespace *user_ns = current_user_ns();
99 struct key *key = rb_entry(n, struct key, serial_node);
100 if (key->user->user_ns == user_ns)
107 static int proc_keys_open(struct inode *inode, struct file *file)
109 return seq_open(file, &proc_keys_ops);
112 static struct key *find_ge_key(key_serial_t id)
114 struct user_namespace *user_ns = current_user_ns();
115 struct rb_node *n = key_serial_tree.rb_node;
116 struct key *minkey = NULL;
119 struct key *key = rb_entry(n, struct key, serial_node);
120 if (id < key->serial) {
121 if (!minkey || minkey->serial > key->serial)
124 } else if (id > key->serial) {
137 if (minkey->user->user_ns == user_ns)
139 n = rb_next(&minkey->serial_node);
142 minkey = rb_entry(n, struct key, serial_node);
146 static void *proc_keys_start(struct seq_file *p, loff_t *_pos)
147 __acquires(key_serial_lock)
149 key_serial_t pos = *_pos;
152 spin_lock(&key_serial_lock);
156 key = find_ge_key(pos);
160 return &key->serial_node;
163 static inline key_serial_t key_node_serial(struct rb_node *n)
165 struct key *key = rb_entry(n, struct key, serial_node);
169 static void *proc_keys_next(struct seq_file *p, void *v, loff_t *_pos)
173 n = key_serial_next(v);
175 *_pos = key_node_serial(n);
179 static void proc_keys_stop(struct seq_file *p, void *v)
180 __releases(key_serial_lock)
182 spin_unlock(&key_serial_lock);
185 static int proc_keys_show(struct seq_file *m, void *v)
187 struct rb_node *_p = v;
188 struct key *key = rb_entry(_p, struct key, serial_node);
194 /* check whether the current task is allowed to view the key (assuming
196 * - the caller holds a spinlock, and thus the RCU read lock, making our
197 * access to __current_cred() safe
199 rc = key_task_permission(make_key_ref(key, 0), current_cred(),
204 now = current_kernel_time();
208 /* come up with a suitable timeout value */
209 if (key->expiry == 0) {
210 memcpy(xbuf, "perm", 5);
211 } else if (now.tv_sec >= key->expiry) {
212 memcpy(xbuf, "expd", 5);
214 timo = key->expiry - now.tv_sec;
217 sprintf(xbuf, "%lus", timo);
218 else if (timo < 60*60)
219 sprintf(xbuf, "%lum", timo / 60);
220 else if (timo < 60*60*24)
221 sprintf(xbuf, "%luh", timo / (60*60));
222 else if (timo < 60*60*24*7)
223 sprintf(xbuf, "%lud", timo / (60*60*24));
225 sprintf(xbuf, "%luw", timo / (60*60*24*7));
228 #define showflag(KEY, LETTER, FLAG) \
229 (test_bit(FLAG, &(KEY)->flags) ? LETTER : '-')
231 seq_printf(m, "%08x %c%c%c%c%c%c %5d %4s %08x %5d %5d %-9.9s ",
233 showflag(key, 'I', KEY_FLAG_INSTANTIATED),
234 showflag(key, 'R', KEY_FLAG_REVOKED),
235 showflag(key, 'D', KEY_FLAG_DEAD),
236 showflag(key, 'Q', KEY_FLAG_IN_QUOTA),
237 showflag(key, 'U', KEY_FLAG_USER_CONSTRUCT),
238 showflag(key, 'N', KEY_FLAG_NEGATIVE),
239 atomic_read(&key->usage),
248 if (key->type->describe)
249 key->type->describe(key, m);
256 #endif /* CONFIG_KEYS_DEBUG_PROC_KEYS */
258 static struct rb_node *__key_user_next(struct rb_node *n)
261 struct key_user *user = rb_entry(n, struct key_user, node);
262 if (user->user_ns == current_user_ns())
269 static struct rb_node *key_user_next(struct rb_node *n)
271 return __key_user_next(rb_next(n));
274 static struct rb_node *key_user_first(struct rb_root *r)
276 struct rb_node *n = rb_first(r);
277 return __key_user_next(n);
280 /*****************************************************************************/
282 * implement "/proc/key-users" to provides a list of the key users
284 static int proc_key_users_open(struct inode *inode, struct file *file)
286 return seq_open(file, &proc_key_users_ops);
289 static void *proc_key_users_start(struct seq_file *p, loff_t *_pos)
290 __acquires(key_user_lock)
295 spin_lock(&key_user_lock);
297 _p = key_user_first(&key_user_tree);
298 while (pos > 0 && _p) {
300 _p = key_user_next(_p);
306 static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos)
309 return key_user_next((struct rb_node *)v);
312 static void proc_key_users_stop(struct seq_file *p, void *v)
313 __releases(key_user_lock)
315 spin_unlock(&key_user_lock);
318 static int proc_key_users_show(struct seq_file *m, void *v)
320 struct rb_node *_p = v;
321 struct key_user *user = rb_entry(_p, struct key_user, node);
322 unsigned maxkeys = (user->uid == 0) ?
323 key_quota_root_maxkeys : key_quota_maxkeys;
324 unsigned maxbytes = (user->uid == 0) ?
325 key_quota_root_maxbytes : key_quota_maxbytes;
327 seq_printf(m, "%5u: %5d %d/%d %d/%d %d/%d\n",
329 atomic_read(&user->usage),
330 atomic_read(&user->nkeys),
331 atomic_read(&user->nikeys),