2019-05-27 06:55:01 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
2011-01-20 16:38:33 +00:00
|
|
|
/* procfs files for key database enumeration
|
2005-04-16 22:20:36 +00:00
|
|
|
*
|
|
|
|
* Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
|
|
|
|
* Written by David Howells (dhowells@redhat.com)
|
|
|
|
*/
|
|
|
|
|
|
|
|
#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 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);
|
|
|
|
|
2008-01-22 23:02:58 +00:00
|
|
|
static const struct seq_operations proc_keys_ops = {
|
2005-04-16 22:20:36 +00:00
|
|
|
.start = proc_keys_start,
|
|
|
|
.next = proc_keys_next,
|
|
|
|
.stop = proc_keys_stop,
|
|
|
|
.show = proc_keys_show,
|
|
|
|
};
|
|
|
|
|
|
|
|
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);
|
|
|
|
|
2008-01-22 23:02:58 +00:00
|
|
|
static const struct seq_operations proc_key_users_ops = {
|
2005-04-16 22:20:36 +00:00
|
|
|
.start = proc_key_users_start,
|
|
|
|
.next = proc_key_users_next,
|
|
|
|
.stop = proc_key_users_stop,
|
|
|
|
.show = proc_key_users_show,
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
2011-01-20 16:38:33 +00:00
|
|
|
* Declare the /proc files.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
|
|
|
static int __init key_proc_init(void)
|
|
|
|
{
|
|
|
|
struct proc_dir_entry *p;
|
|
|
|
|
2018-04-13 17:44:18 +00:00
|
|
|
p = proc_create_seq("keys", 0, NULL, &proc_keys_ops);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (!p)
|
|
|
|
panic("Cannot create /proc/keys\n");
|
|
|
|
|
2018-04-13 17:44:18 +00:00
|
|
|
p = proc_create_seq("key-users", 0, NULL, &proc_key_users_ops);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (!p)
|
|
|
|
panic("Cannot create /proc/key-users\n");
|
|
|
|
|
|
|
|
return 0;
|
2011-01-20 16:38:27 +00:00
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
__initcall(key_proc_init);
|
|
|
|
|
|
|
|
/*
|
2011-01-20 16:38:33 +00:00
|
|
|
* Implement "/proc/keys" to provide a list of the keys on the system that
|
|
|
|
* grant View permission to the caller.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2012-02-08 15:53:04 +00:00
|
|
|
static struct rb_node *key_serial_next(struct seq_file *p, struct rb_node *n)
|
2009-02-27 00:28:04 +00:00
|
|
|
{
|
2012-02-08 15:53:04 +00:00
|
|
|
struct user_namespace *user_ns = seq_user_ns(p);
|
2009-09-02 08:14:05 +00:00
|
|
|
|
|
|
|
n = rb_next(n);
|
2009-02-27 00:28:04 +00:00
|
|
|
while (n) {
|
|
|
|
struct key *key = rb_entry(n, struct key, serial_node);
|
2012-02-08 15:53:04 +00:00
|
|
|
if (kuid_has_mapping(user_ns, key->user->uid))
|
2009-02-27 00:28:04 +00:00
|
|
|
break;
|
|
|
|
n = rb_next(n);
|
|
|
|
}
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2012-02-08 15:53:04 +00:00
|
|
|
static struct key *find_ge_key(struct seq_file *p, key_serial_t id)
|
2009-02-27 00:28:04 +00:00
|
|
|
{
|
2012-02-08 15:53:04 +00:00
|
|
|
struct user_namespace *user_ns = seq_user_ns(p);
|
2009-09-02 08:14:05 +00:00
|
|
|
struct rb_node *n = key_serial_tree.rb_node;
|
|
|
|
struct key *minkey = NULL;
|
2009-02-27 00:28:04 +00:00
|
|
|
|
2009-09-02 08:14:05 +00:00
|
|
|
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;
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2009-09-02 08:14:05 +00:00
|
|
|
if (!minkey)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
for (;;) {
|
2012-02-08 15:53:04 +00:00
|
|
|
if (kuid_has_mapping(user_ns, minkey->user->uid))
|
2009-09-02 08:14:05 +00:00
|
|
|
return minkey;
|
|
|
|
n = rb_next(&minkey->serial_node);
|
|
|
|
if (!n)
|
|
|
|
return NULL;
|
|
|
|
minkey = rb_entry(n, struct key, serial_node);
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void *proc_keys_start(struct seq_file *p, loff_t *_pos)
|
2009-06-18 12:00:05 +00:00
|
|
|
__acquires(key_serial_lock)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2009-09-02 08:14:05 +00:00
|
|
|
key_serial_t pos = *_pos;
|
|
|
|
struct key *key;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
spin_lock(&key_serial_lock);
|
|
|
|
|
2009-09-02 08:14:05 +00:00
|
|
|
if (*_pos > INT_MAX)
|
|
|
|
return NULL;
|
2012-02-08 15:53:04 +00:00
|
|
|
key = find_ge_key(p, pos);
|
2009-09-02 08:14:05 +00:00
|
|
|
if (!key)
|
|
|
|
return NULL;
|
|
|
|
*_pos = key->serial;
|
|
|
|
return &key->serial_node;
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2009-09-02 08:14:05 +00:00
|
|
|
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;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void *proc_keys_next(struct seq_file *p, void *v, loff_t *_pos)
|
|
|
|
{
|
2009-09-02 08:14:05 +00:00
|
|
|
struct rb_node *n;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2012-02-08 15:53:04 +00:00
|
|
|
n = key_serial_next(p, v);
|
2009-09-02 08:14:05 +00:00
|
|
|
if (n)
|
|
|
|
*_pos = key_node_serial(n);
|
keys: Fix proc_keys_next to increase position index
If seq_file .next function does not change position index,
read after some lseek can generate unexpected output:
$ dd if=/proc/keys bs=1 # full usual output
0f6bfdf5 I--Q--- 2 perm 3f010000 1000 1000 user 4af2f79ab8848d0a: 740
1fb91b32 I--Q--- 3 perm 1f3f0000 1000 65534 keyring _uid.1000: 2
27589480 I--Q--- 1 perm 0b0b0000 0 0 user invocation_id: 16
2f33ab67 I--Q--- 152 perm 3f030000 0 0 keyring _ses: 2
33f1d8fa I--Q--- 4 perm 3f030000 1000 1000 keyring _ses: 1
3d427fda I--Q--- 2 perm 3f010000 1000 1000 user 69ec44aec7678e5a: 740
3ead4096 I--Q--- 1 perm 1f3f0000 1000 65534 keyring _uid_ses.1000: 1
521+0 records in
521+0 records out
521 bytes copied, 0,00123769 s, 421 kB/s
But a read after lseek in middle of last line results in the partial
last line and then a repeat of the final line:
$ dd if=/proc/keys bs=500 skip=1
dd: /proc/keys: cannot skip to specified offset
g _uid_ses.1000: 1
3ead4096 I--Q--- 1 perm 1f3f0000 1000 65534 keyring _uid_ses.1000: 1
0+1 records in
0+1 records out
97 bytes copied, 0,000135035 s, 718 kB/s
and a read after lseek beyond end of file results in the last line being
shown:
$ dd if=/proc/keys bs=1000 skip=1 # read after lseek beyond end of file
dd: /proc/keys: cannot skip to specified offset
3ead4096 I--Q--- 1 perm 1f3f0000 1000 65534 keyring _uid_ses.1000: 1
0+1 records in
0+1 records out
76 bytes copied, 0,000119981 s, 633 kB/s
See https://bugzilla.kernel.org/show_bug.cgi?id=206283
Fixes: 1f4aace60b0e ("fs/seq_file.c: simplify seq_file iteration code ...")
Signed-off-by: Vasily Averin <vvs@virtuozzo.com>
Signed-off-by: David Howells <dhowells@redhat.com>
Reviewed-by: Jarkko Sakkinen <jarkko.sakkinen@linux.intel.com>
Cc: stable@vger.kernel.org
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2020-04-14 20:33:16 +00:00
|
|
|
else
|
|
|
|
(*_pos)++;
|
2009-09-02 08:14:05 +00:00
|
|
|
return n;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void proc_keys_stop(struct seq_file *p, void *v)
|
2009-06-18 12:00:05 +00:00
|
|
|
__releases(key_serial_lock)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
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);
|
2017-09-27 19:50:46 +00:00
|
|
|
unsigned long flags;
|
2010-06-11 16:31:10 +00:00
|
|
|
key_ref_t key_ref, skey_ref;
|
2017-11-15 16:38:45 +00:00
|
|
|
time64_t now, expiry;
|
2016-10-26 14:01:54 +00:00
|
|
|
char xbuf[16];
|
2017-10-04 15:43:25 +00:00
|
|
|
short state;
|
2017-11-15 16:38:45 +00:00
|
|
|
u64 timo;
|
2006-06-26 07:24:56 +00:00
|
|
|
int rc;
|
|
|
|
|
2013-09-24 09:35:15 +00:00
|
|
|
struct keyring_search_context ctx = {
|
KEYS: always initialize keyring_index_key::desc_len
syzbot hit the 'BUG_ON(index_key->desc_len == 0);' in __key_link_begin()
called from construct_alloc_key() during sys_request_key(), because the
length of the key description was never calculated.
The problem is that we rely on ->desc_len being initialized by
search_process_keyrings(), specifically by search_nested_keyrings().
But, if the process isn't subscribed to any keyrings that never happens.
Fix it by always initializing keyring_index_key::desc_len as soon as the
description is set, like we already do in some places.
The following program reproduces the BUG_ON() when it's run as root and
no session keyring has been installed. If it doesn't work, try removing
pam_keyinit.so from /etc/pam.d/login and rebooting.
#include <stdlib.h>
#include <unistd.h>
#include <keyutils.h>
int main(void)
{
int id = add_key("keyring", "syz", NULL, 0, KEY_SPEC_USER_KEYRING);
keyctl_setperm(id, KEY_OTH_WRITE);
setreuid(5000, 5000);
request_key("user", "desc", "", id);
}
Reported-by: syzbot+ec24e95ea483de0a24da@syzkaller.appspotmail.com
Fixes: b2a4df200d57 ("KEYS: Expand the capacity of a keyring")
Signed-off-by: Eric Biggers <ebiggers@google.com>
Signed-off-by: David Howells <dhowells@redhat.com>
Cc: stable@vger.kernel.org
Signed-off-by: James Morris <james.morris@microsoft.com>
2019-02-22 15:36:18 +00:00
|
|
|
.index_key = key->index_key,
|
2017-09-18 18:38:29 +00:00
|
|
|
.cred = m->file->f_cred,
|
2014-09-16 16:36:02 +00:00
|
|
|
.match_data.cmp = lookup_user_key_possessed,
|
|
|
|
.match_data.raw_data = key,
|
|
|
|
.match_data.lookup_type = KEYRING_SEARCH_LOOKUP_DIRECT,
|
2019-06-26 20:02:32 +00:00
|
|
|
.flags = (KEYRING_SEARCH_NO_STATE_CHECK |
|
|
|
|
KEYRING_SEARCH_RECURSE),
|
2013-09-24 09:35:15 +00:00
|
|
|
};
|
|
|
|
|
2019-07-11 01:43:43 +00:00
|
|
|
key_ref = make_key_ref(key, 0);
|
2010-06-11 16:31:10 +00:00
|
|
|
|
|
|
|
/* 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
|
|
|
|
*/
|
2019-07-11 01:43:43 +00:00
|
|
|
if (key->perm & KEY_POS_VIEW) {
|
|
|
|
rcu_read_lock();
|
2019-06-19 15:10:15 +00:00
|
|
|
skey_ref = search_cred_keyrings_rcu(&ctx);
|
2019-07-11 01:43:43 +00:00
|
|
|
rcu_read_unlock();
|
2010-06-11 16:31:10 +00:00
|
|
|
if (!IS_ERR(skey_ref)) {
|
|
|
|
key_ref_put(skey_ref);
|
|
|
|
key_ref = make_key_ref(key, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-09-18 18:38:29 +00:00
|
|
|
/* check whether the current task is allowed to view the key */
|
2014-03-14 17:44:49 +00:00
|
|
|
rc = key_task_permission(key_ref, ctx.cred, KEY_NEED_VIEW);
|
2006-06-26 07:24:56 +00:00
|
|
|
if (rc < 0)
|
2019-07-11 01:43:43 +00:00
|
|
|
return 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2017-11-15 16:38:45 +00:00
|
|
|
now = ktime_get_real_seconds();
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2019-07-11 01:43:43 +00:00
|
|
|
rcu_read_lock();
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/* come up with a suitable timeout value */
|
2017-09-27 19:50:46 +00:00
|
|
|
expiry = READ_ONCE(key->expiry);
|
|
|
|
if (expiry == 0) {
|
2005-04-16 22:20:36 +00:00
|
|
|
memcpy(xbuf, "perm", 5);
|
2017-11-15 16:38:45 +00:00
|
|
|
} else if (now >= expiry) {
|
2005-04-16 22:20:36 +00:00
|
|
|
memcpy(xbuf, "expd", 5);
|
2009-09-02 08:14:11 +00:00
|
|
|
} else {
|
2017-11-15 16:38:45 +00:00
|
|
|
timo = expiry - now;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
if (timo < 60)
|
2017-11-15 16:38:45 +00:00
|
|
|
sprintf(xbuf, "%llus", timo);
|
2005-04-16 22:20:36 +00:00
|
|
|
else if (timo < 60*60)
|
2017-11-15 16:38:45 +00:00
|
|
|
sprintf(xbuf, "%llum", div_u64(timo, 60));
|
2005-04-16 22:20:36 +00:00
|
|
|
else if (timo < 60*60*24)
|
2017-11-15 16:38:45 +00:00
|
|
|
sprintf(xbuf, "%lluh", div_u64(timo, 60 * 60));
|
2005-04-16 22:20:36 +00:00
|
|
|
else if (timo < 60*60*24*7)
|
2017-11-15 16:38:45 +00:00
|
|
|
sprintf(xbuf, "%llud", div_u64(timo, 60 * 60 * 24));
|
2005-04-16 22:20:36 +00:00
|
|
|
else
|
2017-11-15 16:38:45 +00:00
|
|
|
sprintf(xbuf, "%lluw", div_u64(timo, 60 * 60 * 24 * 7));
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2017-10-04 15:43:25 +00:00
|
|
|
state = key_read_state(key);
|
|
|
|
|
2017-09-27 19:50:46 +00:00
|
|
|
#define showflag(FLAGS, LETTER, FLAG) \
|
|
|
|
((FLAGS & (1 << FLAG)) ? LETTER : '-')
|
2005-06-24 05:00:49 +00:00
|
|
|
|
2017-09-27 19:50:46 +00:00
|
|
|
flags = READ_ONCE(key->flags);
|
2012-05-11 09:56:56 +00:00
|
|
|
seq_printf(m, "%08x %c%c%c%c%c%c%c %5d %4s %08x %5d %5d %-9.9s ",
|
2005-04-16 22:20:36 +00:00
|
|
|
key->serial,
|
2017-10-04 15:43:25 +00:00
|
|
|
state != KEY_IS_UNINSTANTIATED ? 'I' : '-',
|
2017-09-27 19:50:46 +00:00
|
|
|
showflag(flags, 'R', KEY_FLAG_REVOKED),
|
|
|
|
showflag(flags, 'D', KEY_FLAG_DEAD),
|
|
|
|
showflag(flags, 'Q', KEY_FLAG_IN_QUOTA),
|
|
|
|
showflag(flags, 'U', KEY_FLAG_USER_CONSTRUCT),
|
2017-10-04 15:43:25 +00:00
|
|
|
state < 0 ? 'N' : '-',
|
2017-09-27 19:50:46 +00:00
|
|
|
showflag(flags, 'i', KEY_FLAG_INVALIDATED),
|
2017-03-31 12:20:48 +00:00
|
|
|
refcount_read(&key->usage),
|
2005-04-16 22:20:36 +00:00
|
|
|
xbuf,
|
2019-07-11 01:43:43 +00:00
|
|
|
key->perm,
|
2012-02-08 15:53:04 +00:00
|
|
|
from_kuid_munged(seq_user_ns(m), key->uid),
|
|
|
|
from_kgid_munged(seq_user_ns(m), key->gid),
|
2005-04-16 22:20:36 +00:00
|
|
|
key->type->name);
|
|
|
|
|
2005-06-24 05:00:49 +00:00
|
|
|
#undef showflag
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
if (key->type->describe)
|
|
|
|
key->type->describe(key, m);
|
|
|
|
seq_putc(m, '\n');
|
|
|
|
|
2019-07-11 01:43:43 +00:00
|
|
|
rcu_read_unlock();
|
2005-04-16 22:20:36 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-02-08 15:53:04 +00:00
|
|
|
static struct rb_node *__key_user_next(struct user_namespace *user_ns, struct rb_node *n)
|
2009-02-27 00:28:04 +00:00
|
|
|
{
|
|
|
|
while (n) {
|
|
|
|
struct key_user *user = rb_entry(n, struct key_user, node);
|
2012-02-08 15:53:04 +00:00
|
|
|
if (kuid_has_mapping(user_ns, user->uid))
|
2009-02-27 00:28:04 +00:00
|
|
|
break;
|
|
|
|
n = rb_next(n);
|
|
|
|
}
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2012-02-08 15:53:04 +00:00
|
|
|
static struct rb_node *key_user_next(struct user_namespace *user_ns, struct rb_node *n)
|
2009-02-27 00:28:04 +00:00
|
|
|
{
|
2012-02-08 15:53:04 +00:00
|
|
|
return __key_user_next(user_ns, rb_next(n));
|
2009-02-27 00:28:04 +00:00
|
|
|
}
|
|
|
|
|
2012-02-08 15:53:04 +00:00
|
|
|
static struct rb_node *key_user_first(struct user_namespace *user_ns, struct rb_root *r)
|
2009-02-27 00:28:04 +00:00
|
|
|
{
|
|
|
|
struct rb_node *n = rb_first(r);
|
2012-02-08 15:53:04 +00:00
|
|
|
return __key_user_next(user_ns, n);
|
2009-02-27 00:28:04 +00:00
|
|
|
}
|
2009-09-02 08:14:11 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
static void *proc_key_users_start(struct seq_file *p, loff_t *_pos)
|
2009-06-18 12:00:05 +00:00
|
|
|
__acquires(key_user_lock)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct rb_node *_p;
|
|
|
|
loff_t pos = *_pos;
|
|
|
|
|
|
|
|
spin_lock(&key_user_lock);
|
|
|
|
|
2012-02-08 15:53:04 +00:00
|
|
|
_p = key_user_first(seq_user_ns(p), &key_user_tree);
|
2005-04-16 22:20:36 +00:00
|
|
|
while (pos > 0 && _p) {
|
|
|
|
pos--;
|
2012-02-08 15:53:04 +00:00
|
|
|
_p = key_user_next(seq_user_ns(p), _p);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return _p;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *proc_key_users_next(struct seq_file *p, void *v, loff_t *_pos)
|
|
|
|
{
|
|
|
|
(*_pos)++;
|
2012-02-08 15:53:04 +00:00
|
|
|
return key_user_next(seq_user_ns(p), (struct rb_node *)v);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void proc_key_users_stop(struct seq_file *p, void *v)
|
2009-06-18 12:00:05 +00:00
|
|
|
__releases(key_user_lock)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
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);
|
2012-02-08 15:53:04 +00:00
|
|
|
unsigned maxkeys = uid_eq(user->uid, GLOBAL_ROOT_UID) ?
|
2008-04-29 08:01:32 +00:00
|
|
|
key_quota_root_maxkeys : key_quota_maxkeys;
|
2012-02-08 15:53:04 +00:00
|
|
|
unsigned maxbytes = uid_eq(user->uid, GLOBAL_ROOT_UID) ?
|
2008-04-29 08:01:32 +00:00
|
|
|
key_quota_root_maxbytes : key_quota_maxbytes;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
seq_printf(m, "%5u: %5d %d/%d %d/%d %d/%d\n",
|
2012-02-08 15:53:04 +00:00
|
|
|
from_kuid_munged(seq_user_ns(m), user->uid),
|
2017-03-31 12:20:49 +00:00
|
|
|
refcount_read(&user->usage),
|
2005-04-16 22:20:36 +00:00
|
|
|
atomic_read(&user->nkeys),
|
|
|
|
atomic_read(&user->nikeys),
|
|
|
|
user->qnkeys,
|
2008-04-29 08:01:32 +00:00
|
|
|
maxkeys,
|
2005-04-16 22:20:36 +00:00
|
|
|
user->qnbytes,
|
2008-04-29 08:01:32 +00:00
|
|
|
maxbytes);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|