2009-09-02 15:14:00 +07:00
|
|
|
/* Key garbage collector
|
|
|
|
*
|
|
|
|
* Copyright (C) 2009 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 Licence
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the Licence, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <keys/keyring-type.h>
|
|
|
|
#include "internal.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Delay between key revocation/expiry in seconds
|
|
|
|
*/
|
|
|
|
unsigned key_gc_delay = 5 * 60;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Reaper
|
|
|
|
*/
|
|
|
|
static void key_gc_timer_func(unsigned long);
|
|
|
|
static void key_garbage_collector(struct work_struct *);
|
|
|
|
static DEFINE_TIMER(key_gc_timer, key_gc_timer_func, 0, 0);
|
|
|
|
static DECLARE_WORK(key_gc_work, key_garbage_collector);
|
|
|
|
static key_serial_t key_gc_cursor; /* the last key the gc considered */
|
2009-09-14 23:26:13 +07:00
|
|
|
static bool key_gc_again;
|
2009-09-02 15:14:00 +07:00
|
|
|
static unsigned long key_gc_executing;
|
|
|
|
static time_t key_gc_next_run = LONG_MAX;
|
2009-09-14 23:26:13 +07:00
|
|
|
static time_t key_gc_new_timer;
|
2009-09-02 15:14:00 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Schedule a garbage collection run
|
|
|
|
* - precision isn't particularly important
|
|
|
|
*/
|
|
|
|
void key_schedule_gc(time_t gc_at)
|
|
|
|
{
|
|
|
|
unsigned long expires;
|
|
|
|
time_t now = current_kernel_time().tv_sec;
|
|
|
|
|
|
|
|
kenter("%ld", gc_at - now);
|
|
|
|
|
2009-09-14 23:26:13 +07:00
|
|
|
if (gc_at <= now) {
|
2009-09-02 15:14:00 +07:00
|
|
|
schedule_work(&key_gc_work);
|
|
|
|
} else if (gc_at < key_gc_next_run) {
|
|
|
|
expires = jiffies + (gc_at - now) * HZ;
|
|
|
|
mod_timer(&key_gc_timer, expires);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The garbage collector timer kicked off
|
|
|
|
*/
|
|
|
|
static void key_gc_timer_func(unsigned long data)
|
|
|
|
{
|
|
|
|
kenter("");
|
|
|
|
key_gc_next_run = LONG_MAX;
|
|
|
|
schedule_work(&key_gc_work);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Garbage collect pointers from a keyring
|
|
|
|
* - return true if we altered the keyring
|
|
|
|
*/
|
|
|
|
static bool key_gc_keyring(struct key *keyring, time_t limit)
|
KEYS: Add a keyctl to install a process's session keyring on its parent [try #6]
Add a keyctl to install a process's session keyring onto its parent. This
replaces the parent's session keyring. Because the COW credential code does
not permit one process to change another process's credentials directly, the
change is deferred until userspace next starts executing again. Normally this
will be after a wait*() syscall.
To support this, three new security hooks have been provided:
cred_alloc_blank() to allocate unset security creds, cred_transfer() to fill in
the blank security creds and key_session_to_parent() - which asks the LSM if
the process may replace its parent's session keyring.
The replacement may only happen if the process has the same ownership details
as its parent, and the process has LINK permission on the session keyring, and
the session keyring is owned by the process, and the LSM permits it.
Note that this requires alteration to each architecture's notify_resume path.
This has been done for all arches barring blackfin, m68k* and xtensa, all of
which need assembly alteration to support TIF_NOTIFY_RESUME. This allows the
replacement to be performed at the point the parent process resumes userspace
execution.
This allows the userspace AFS pioctl emulation to fully emulate newpag() and
the VIOCSETTOK and VIOCSETTOK2 pioctls, all of which require the ability to
alter the parent process's PAG membership. However, since kAFS doesn't use
PAGs per se, but rather dumps the keys into the session keyring, the session
keyring of the parent must be replaced if, for example, VIOCSETTOK is passed
the newpag flag.
This can be tested with the following program:
#include <stdio.h>
#include <stdlib.h>
#include <keyutils.h>
#define KEYCTL_SESSION_TO_PARENT 18
#define OSERROR(X, S) do { if ((long)(X) == -1) { perror(S); exit(1); } } while(0)
int main(int argc, char **argv)
{
key_serial_t keyring, key;
long ret;
keyring = keyctl_join_session_keyring(argv[1]);
OSERROR(keyring, "keyctl_join_session_keyring");
key = add_key("user", "a", "b", 1, keyring);
OSERROR(key, "add_key");
ret = keyctl(KEYCTL_SESSION_TO_PARENT);
OSERROR(ret, "KEYCTL_SESSION_TO_PARENT");
return 0;
}
Compiled and linked with -lkeyutils, you should see something like:
[dhowells@andromeda ~]$ keyctl show
Session Keyring
-3 --alswrv 4043 4043 keyring: _ses
355907932 --alswrv 4043 -1 \_ keyring: _uid.4043
[dhowells@andromeda ~]$ /tmp/newpag
[dhowells@andromeda ~]$ keyctl show
Session Keyring
-3 --alswrv 4043 4043 keyring: _ses
1055658746 --alswrv 4043 4043 \_ user: a
[dhowells@andromeda ~]$ /tmp/newpag hello
[dhowells@andromeda ~]$ keyctl show
Session Keyring
-3 --alswrv 4043 4043 keyring: hello
340417692 --alswrv 4043 4043 \_ user: a
Where the test program creates a new session keyring, sticks a user key named
'a' into it and then installs it on its parent.
Signed-off-by: David Howells <dhowells@redhat.com>
Signed-off-by: James Morris <jmorris@namei.org>
2009-09-02 15:14:21 +07:00
|
|
|
__releases(key_serial_lock)
|
2009-09-02 15:14:00 +07:00
|
|
|
{
|
|
|
|
struct keyring_list *klist;
|
|
|
|
struct key *key;
|
|
|
|
int loop;
|
|
|
|
|
|
|
|
kenter("%x", key_serial(keyring));
|
|
|
|
|
|
|
|
if (test_bit(KEY_FLAG_REVOKED, &keyring->flags))
|
|
|
|
goto dont_gc;
|
|
|
|
|
|
|
|
/* scan the keyring looking for dead keys */
|
|
|
|
klist = rcu_dereference(keyring->payload.subscriptions);
|
|
|
|
if (!klist)
|
|
|
|
goto dont_gc;
|
|
|
|
|
|
|
|
for (loop = klist->nkeys - 1; loop >= 0; loop--) {
|
|
|
|
key = klist->keys[loop];
|
|
|
|
if (test_bit(KEY_FLAG_DEAD, &key->flags) ||
|
|
|
|
(key->expiry > 0 && key->expiry <= limit))
|
|
|
|
goto do_gc;
|
|
|
|
}
|
|
|
|
|
|
|
|
dont_gc:
|
|
|
|
kleave(" = false");
|
|
|
|
return false;
|
|
|
|
|
|
|
|
do_gc:
|
|
|
|
key_gc_cursor = keyring->serial;
|
|
|
|
key_get(keyring);
|
|
|
|
spin_unlock(&key_serial_lock);
|
|
|
|
keyring_gc(keyring, limit);
|
|
|
|
key_put(keyring);
|
|
|
|
kleave(" = true");
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Garbage collector for keys
|
|
|
|
* - this involves scanning the keyrings for dead, expired and revoked keys
|
|
|
|
* that have overstayed their welcome
|
|
|
|
*/
|
|
|
|
static void key_garbage_collector(struct work_struct *work)
|
|
|
|
{
|
|
|
|
struct rb_node *rb;
|
|
|
|
key_serial_t cursor;
|
|
|
|
struct key *key, *xkey;
|
2009-09-14 23:26:13 +07:00
|
|
|
time_t new_timer = LONG_MAX, limit, now;
|
2009-09-02 15:14:00 +07:00
|
|
|
|
2009-09-14 23:26:13 +07:00
|
|
|
now = current_kernel_time().tv_sec;
|
|
|
|
kenter("[%x,%ld]", key_gc_cursor, key_gc_new_timer - now);
|
2009-09-02 15:14:00 +07:00
|
|
|
|
|
|
|
if (test_and_set_bit(0, &key_gc_executing)) {
|
2009-09-14 23:26:13 +07:00
|
|
|
key_schedule_gc(current_kernel_time().tv_sec + 1);
|
|
|
|
kleave(" [busy; deferring]");
|
2009-09-02 15:14:00 +07:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-09-14 23:26:13 +07:00
|
|
|
limit = now;
|
2009-09-02 15:14:00 +07:00
|
|
|
if (limit > key_gc_delay)
|
|
|
|
limit -= key_gc_delay;
|
|
|
|
else
|
|
|
|
limit = key_gc_delay;
|
|
|
|
|
|
|
|
spin_lock(&key_serial_lock);
|
|
|
|
|
2009-09-14 23:26:13 +07:00
|
|
|
if (unlikely(RB_EMPTY_ROOT(&key_serial_tree))) {
|
|
|
|
spin_unlock(&key_serial_lock);
|
|
|
|
clear_bit(0, &key_gc_executing);
|
|
|
|
return;
|
|
|
|
}
|
2009-09-02 15:14:00 +07:00
|
|
|
|
|
|
|
cursor = key_gc_cursor;
|
|
|
|
if (cursor < 0)
|
|
|
|
cursor = 0;
|
2009-09-14 23:26:13 +07:00
|
|
|
if (cursor > 0)
|
|
|
|
new_timer = key_gc_new_timer;
|
|
|
|
else
|
|
|
|
key_gc_again = false;
|
2009-09-02 15:14:00 +07:00
|
|
|
|
|
|
|
/* find the first key above the cursor */
|
|
|
|
key = NULL;
|
|
|
|
rb = key_serial_tree.rb_node;
|
|
|
|
while (rb) {
|
|
|
|
xkey = rb_entry(rb, struct key, serial_node);
|
|
|
|
if (cursor < xkey->serial) {
|
|
|
|
key = xkey;
|
|
|
|
rb = rb->rb_left;
|
|
|
|
} else if (cursor > xkey->serial) {
|
|
|
|
rb = rb->rb_right;
|
|
|
|
} else {
|
|
|
|
rb = rb_next(rb);
|
|
|
|
if (!rb)
|
|
|
|
goto reached_the_end;
|
|
|
|
key = rb_entry(rb, struct key, serial_node);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!key)
|
|
|
|
goto reached_the_end;
|
|
|
|
|
|
|
|
/* trawl through the keys looking for keyrings */
|
|
|
|
for (;;) {
|
2009-09-14 23:26:13 +07:00
|
|
|
if (key->expiry > now && key->expiry < new_timer) {
|
|
|
|
kdebug("will expire %x in %ld",
|
|
|
|
key_serial(key), key->expiry - now);
|
2009-09-02 15:14:00 +07:00
|
|
|
new_timer = key->expiry;
|
2009-09-14 23:26:13 +07:00
|
|
|
}
|
2009-09-02 15:14:00 +07:00
|
|
|
|
|
|
|
if (key->type == &key_type_keyring &&
|
2009-09-14 23:26:13 +07:00
|
|
|
key_gc_keyring(key, limit))
|
|
|
|
/* the gc had to release our lock so that the keyring
|
|
|
|
* could be modified, so we have to get it again */
|
|
|
|
goto gc_released_our_lock;
|
2009-09-02 15:14:00 +07:00
|
|
|
|
|
|
|
rb = rb_next(&key->serial_node);
|
2009-09-14 23:26:13 +07:00
|
|
|
if (!rb)
|
|
|
|
goto reached_the_end;
|
2009-09-02 15:14:00 +07:00
|
|
|
key = rb_entry(rb, struct key, serial_node);
|
|
|
|
}
|
|
|
|
|
2009-09-14 23:26:13 +07:00
|
|
|
gc_released_our_lock:
|
|
|
|
kdebug("gc_released_our_lock");
|
|
|
|
key_gc_new_timer = new_timer;
|
|
|
|
key_gc_again = true;
|
2009-09-02 15:14:00 +07:00
|
|
|
clear_bit(0, &key_gc_executing);
|
2009-09-14 23:26:13 +07:00
|
|
|
schedule_work(&key_gc_work);
|
|
|
|
kleave(" [continue]");
|
2009-09-02 15:14:00 +07:00
|
|
|
return;
|
|
|
|
|
2009-09-14 23:26:13 +07:00
|
|
|
/* when we reach the end of the run, we set the timer for the next one */
|
2009-09-02 15:14:00 +07:00
|
|
|
reached_the_end:
|
2009-09-14 23:26:13 +07:00
|
|
|
kdebug("reached_the_end");
|
|
|
|
spin_unlock(&key_serial_lock);
|
|
|
|
key_gc_new_timer = new_timer;
|
2009-09-02 15:14:00 +07:00
|
|
|
key_gc_cursor = 0;
|
2009-09-14 23:26:13 +07:00
|
|
|
clear_bit(0, &key_gc_executing);
|
|
|
|
|
|
|
|
if (key_gc_again) {
|
|
|
|
/* there may have been a key that expired whilst we were
|
|
|
|
* scanning, so if we discarded any links we should do another
|
|
|
|
* scan */
|
|
|
|
new_timer = now + 1;
|
|
|
|
key_schedule_gc(new_timer);
|
|
|
|
} else if (new_timer < LONG_MAX) {
|
|
|
|
new_timer += key_gc_delay;
|
|
|
|
key_schedule_gc(new_timer);
|
|
|
|
}
|
|
|
|
kleave(" [end]");
|
2009-09-02 15:14:00 +07:00
|
|
|
}
|