at v2.6.12-rc2 251 lines 5.9 kB view raw
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 23static int proc_keys_open(struct inode *inode, struct file *file); 24static void *proc_keys_start(struct seq_file *p, loff_t *_pos); 25static void *proc_keys_next(struct seq_file *p, void *v, loff_t *_pos); 26static void proc_keys_stop(struct seq_file *p, void *v); 27static int proc_keys_show(struct seq_file *m, void *v); 28 29static struct seq_operations proc_keys_ops = { 30 .start = proc_keys_start, 31 .next = proc_keys_next, 32 .stop = proc_keys_stop, 33 .show = proc_keys_show, 34}; 35 36static struct file_operations proc_keys_fops = { 37 .open = proc_keys_open, 38 .read = seq_read, 39 .llseek = seq_lseek, 40 .release = seq_release, 41}; 42#endif 43 44static int proc_key_users_open(struct inode *inode, struct file *file); 45static void *proc_key_users_start(struct seq_file *p, loff_t *_pos); 46static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos); 47static void proc_key_users_stop(struct seq_file *p, void *v); 48static int proc_key_users_show(struct seq_file *m, void *v); 49 50static struct seq_operations proc_key_users_ops = { 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 57static struct file_operations proc_key_users_fops = { 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 */ 68static int __init key_proc_init(void) 69{ 70 struct proc_dir_entry *p; 71 72#ifdef CONFIG_KEYS_DEBUG_PROC_KEYS 73 p = create_proc_entry("keys", 0, NULL); 74 if (!p) 75 panic("Cannot create /proc/keys\n"); 76 77 p->proc_fops = &proc_keys_fops; 78#endif 79 80 p = create_proc_entry("key-users", 0, NULL); 81 if (!p) 82 panic("Cannot create /proc/key-users\n"); 83 84 p->proc_fops = &proc_key_users_fops; 85 86 return 0; 87 88} /* end key_proc_init() */ 89 90__initcall(key_proc_init); 91 92/*****************************************************************************/ 93/* 94 * implement "/proc/keys" to provides a list of the keys on the system 95 */ 96#ifdef CONFIG_KEYS_DEBUG_PROC_KEYS 97 98static int proc_keys_open(struct inode *inode, struct file *file) 99{ 100 return seq_open(file, &proc_keys_ops); 101 102} 103 104static void *proc_keys_start(struct seq_file *p, loff_t *_pos) 105{ 106 struct rb_node *_p; 107 loff_t pos = *_pos; 108 109 spin_lock(&key_serial_lock); 110 111 _p = rb_first(&key_serial_tree); 112 while (pos > 0 && _p) { 113 pos--; 114 _p = rb_next(_p); 115 } 116 117 return _p; 118 119} 120 121static void *proc_keys_next(struct seq_file *p, void *v, loff_t *_pos) 122{ 123 (*_pos)++; 124 return rb_next((struct rb_node *) v); 125 126} 127 128static void proc_keys_stop(struct seq_file *p, void *v) 129{ 130 spin_unlock(&key_serial_lock); 131} 132 133static int proc_keys_show(struct seq_file *m, void *v) 134{ 135 struct rb_node *_p = v; 136 struct key *key = rb_entry(_p, struct key, serial_node); 137 struct timespec now; 138 unsigned long timo; 139 char xbuf[12]; 140 141 now = current_kernel_time(); 142 143 read_lock(&key->lock); 144 145 /* come up with a suitable timeout value */ 146 if (key->expiry == 0) { 147 memcpy(xbuf, "perm", 5); 148 } 149 else if (now.tv_sec >= key->expiry) { 150 memcpy(xbuf, "expd", 5); 151 } 152 else { 153 timo = key->expiry - now.tv_sec; 154 155 if (timo < 60) 156 sprintf(xbuf, "%lus", timo); 157 else if (timo < 60*60) 158 sprintf(xbuf, "%lum", timo / 60); 159 else if (timo < 60*60*24) 160 sprintf(xbuf, "%luh", timo / (60*60)); 161 else if (timo < 60*60*24*7) 162 sprintf(xbuf, "%lud", timo / (60*60*24)); 163 else 164 sprintf(xbuf, "%luw", timo / (60*60*24*7)); 165 } 166 167 seq_printf(m, "%08x %c%c%c%c%c%c %5d %4s %06x %5d %5d %-9.9s ", 168 key->serial, 169 key->flags & KEY_FLAG_INSTANTIATED ? 'I' : '-', 170 key->flags & KEY_FLAG_REVOKED ? 'R' : '-', 171 key->flags & KEY_FLAG_DEAD ? 'D' : '-', 172 key->flags & KEY_FLAG_IN_QUOTA ? 'Q' : '-', 173 key->flags & KEY_FLAG_USER_CONSTRUCT ? 'U' : '-', 174 key->flags & KEY_FLAG_NEGATIVE ? 'N' : '-', 175 atomic_read(&key->usage), 176 xbuf, 177 key->perm, 178 key->uid, 179 key->gid, 180 key->type->name); 181 182 if (key->type->describe) 183 key->type->describe(key, m); 184 seq_putc(m, '\n'); 185 186 read_unlock(&key->lock); 187 188 return 0; 189 190} 191 192#endif /* CONFIG_KEYS_DEBUG_PROC_KEYS */ 193 194/*****************************************************************************/ 195/* 196 * implement "/proc/key-users" to provides a list of the key users 197 */ 198static int proc_key_users_open(struct inode *inode, struct file *file) 199{ 200 return seq_open(file, &proc_key_users_ops); 201 202} 203 204static void *proc_key_users_start(struct seq_file *p, loff_t *_pos) 205{ 206 struct rb_node *_p; 207 loff_t pos = *_pos; 208 209 spin_lock(&key_user_lock); 210 211 _p = rb_first(&key_user_tree); 212 while (pos > 0 && _p) { 213 pos--; 214 _p = rb_next(_p); 215 } 216 217 return _p; 218 219} 220 221static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos) 222{ 223 (*_pos)++; 224 return rb_next((struct rb_node *) v); 225 226} 227 228static void proc_key_users_stop(struct seq_file *p, void *v) 229{ 230 spin_unlock(&key_user_lock); 231} 232 233static int proc_key_users_show(struct seq_file *m, void *v) 234{ 235 struct rb_node *_p = v; 236 struct key_user *user = rb_entry(_p, struct key_user, node); 237 238 seq_printf(m, "%5u: %5d %d/%d %d/%d %d/%d\n", 239 user->uid, 240 atomic_read(&user->usage), 241 atomic_read(&user->nkeys), 242 atomic_read(&user->nikeys), 243 user->qnkeys, 244 KEYQUOTA_MAX_KEYS, 245 user->qnbytes, 246 KEYQUOTA_MAX_BYTES 247 ); 248 249 return 0; 250 251}