1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /* Key garbage collector
4 * Copyright (C) 2009-2011 Red Hat, Inc. All Rights Reserved.
5 * Written by David Howells (dhowells@redhat.com)
8 #include <linux/slab.h>
9 #include <linux/security.h>
10 #include <keys/keyring-type.h>
14 * Delay between key revocation/expiry in seconds
16 unsigned key_gc_delay = 5 * 60;
19 * Reaper for unused keys.
21 static void key_garbage_collector(struct work_struct *work);
22 DECLARE_WORK(key_gc_work, key_garbage_collector);
25 * Reaper for links from keyrings to dead keys.
27 static void key_gc_timer_func(struct timer_list *);
28 static DEFINE_TIMER(key_gc_timer, key_gc_timer_func);
30 static time64_t key_gc_next_run = TIME64_MAX;
31 static struct key_type *key_gc_dead_keytype;
33 static unsigned long key_gc_flags;
34 #define KEY_GC_KEY_EXPIRED 0 /* A key expired and needs unlinking */
35 #define KEY_GC_REAP_KEYTYPE 1 /* A keytype is being unregistered */
36 #define KEY_GC_REAPING_KEYTYPE 2 /* Cleared when keytype reaped */
40 * Any key whose type gets unregistered will be re-typed to this if it can't be
41 * immediately unlinked.
43 struct key_type key_type_dead = {
48 * Schedule a garbage collection run.
49 * - time precision isn't particularly important
51 void key_schedule_gc(time64_t gc_at)
53 unsigned long expires;
54 time64_t now = ktime_get_real_seconds();
56 kenter("%lld", gc_at - now);
58 if (gc_at <= now || test_bit(KEY_GC_REAP_KEYTYPE, &key_gc_flags)) {
60 schedule_work(&key_gc_work);
61 } else if (gc_at < key_gc_next_run) {
63 key_gc_next_run = gc_at;
64 expires = jiffies + (gc_at - now) * HZ;
65 mod_timer(&key_gc_timer, expires);
70 * Set the expiration time on a key.
72 void key_set_expiry(struct key *key, time64_t expiry)
75 if (expiry != TIME64_MAX) {
76 if (!(key->type->flags & KEY_TYPE_INSTANT_REAP))
77 expiry += key_gc_delay;
78 key_schedule_gc(expiry);
83 * Schedule a dead links collection run.
85 void key_schedule_gc_links(void)
87 set_bit(KEY_GC_KEY_EXPIRED, &key_gc_flags);
88 schedule_work(&key_gc_work);
92 * Some key's cleanup time was met after it expired, so we need to get the
93 * reaper to go through a cycle finding expired keys.
95 static void key_gc_timer_func(struct timer_list *unused)
98 key_gc_next_run = TIME64_MAX;
99 key_schedule_gc_links();
103 * Reap keys of dead type.
105 * We use three flags to make sure we see three complete cycles of the garbage
106 * collector: the first to mark keys of that type as being dead, the second to
107 * collect dead links and the third to clean up the dead keys. We have to be
108 * careful as there may already be a cycle in progress.
110 * The caller must be holding key_types_sem.
112 void key_gc_keytype(struct key_type *ktype)
114 kenter("%s", ktype->name);
116 key_gc_dead_keytype = ktype;
117 set_bit(KEY_GC_REAPING_KEYTYPE, &key_gc_flags);
119 set_bit(KEY_GC_REAP_KEYTYPE, &key_gc_flags);
122 schedule_work(&key_gc_work);
125 wait_on_bit(&key_gc_flags, KEY_GC_REAPING_KEYTYPE,
126 TASK_UNINTERRUPTIBLE);
128 key_gc_dead_keytype = NULL;
133 * Garbage collect a list of unreferenced, detached keys
135 static noinline void key_gc_unused_keys(struct list_head *keys)
137 while (!list_empty(keys)) {
139 list_entry(keys->next, struct key, graveyard_link);
140 short state = key->state;
142 list_del(&key->graveyard_link);
144 kdebug("- %u", key->serial);
147 #ifdef CONFIG_KEY_NOTIFICATIONS
148 remove_watch_list(key->watchers, key->serial);
149 key->watchers = NULL;
152 /* Throw away the key data if the key is instantiated */
153 if (state == KEY_IS_POSITIVE && key->type->destroy)
154 key->type->destroy(key);
156 security_key_free(key);
158 /* deal with the user's key tracking and quota */
159 if (test_bit(KEY_FLAG_IN_QUOTA, &key->flags)) {
160 spin_lock(&key->user->lock);
162 key->user->qnbytes -= key->quotalen;
163 spin_unlock(&key->user->lock);
166 atomic_dec(&key->user->nkeys);
167 if (state != KEY_IS_UNINSTANTIATED)
168 atomic_dec(&key->user->nikeys);
170 key_user_put(key->user);
171 key_put_tag(key->domain_tag);
172 kfree(key->description);
174 memzero_explicit(key, sizeof(*key));
175 kmem_cache_free(key_jar, key);
180 * Garbage collector for unused keys.
182 * This is done in process context so that we don't have to disable interrupts
183 * all over the place. key_put() schedules this rather than trying to do the
184 * cleanup itself, which means key_put() doesn't have to sleep.
186 static void key_garbage_collector(struct work_struct *work)
188 static LIST_HEAD(graveyard);
189 static u8 gc_state; /* Internal persistent state */
190 #define KEY_GC_REAP_AGAIN 0x01 /* - Need another cycle */
191 #define KEY_GC_REAPING_LINKS 0x02 /* - We need to reap links */
192 #define KEY_GC_REAPING_DEAD_1 0x10 /* - We need to mark dead keys */
193 #define KEY_GC_REAPING_DEAD_2 0x20 /* - We need to reap dead key links */
194 #define KEY_GC_REAPING_DEAD_3 0x40 /* - We need to reap dead keys */
195 #define KEY_GC_FOUND_DEAD_KEY 0x80 /* - We found at least one dead key */
197 struct rb_node *cursor;
199 time64_t new_timer, limit, expiry;
201 kenter("[%lx,%x]", key_gc_flags, gc_state);
203 limit = ktime_get_real_seconds();
205 /* Work out what we're going to be doing in this pass */
206 gc_state &= KEY_GC_REAPING_DEAD_1 | KEY_GC_REAPING_DEAD_2;
208 if (test_and_clear_bit(KEY_GC_KEY_EXPIRED, &key_gc_flags))
209 gc_state |= KEY_GC_REAPING_LINKS;
211 if (test_and_clear_bit(KEY_GC_REAP_KEYTYPE, &key_gc_flags))
212 gc_state |= KEY_GC_REAPING_DEAD_1;
213 kdebug("new pass %x", gc_state);
215 new_timer = TIME64_MAX;
217 /* As only this function is permitted to remove things from the key
218 * serial tree, if cursor is non-NULL then it will always point to a
219 * valid node in the tree - even if lock got dropped.
221 spin_lock(&key_serial_lock);
222 cursor = rb_first(&key_serial_tree);
226 key = rb_entry(cursor, struct key, serial_node);
227 cursor = rb_next(cursor);
229 if (refcount_read(&key->usage) == 0)
230 goto found_unreferenced_key;
232 if (unlikely(gc_state & KEY_GC_REAPING_DEAD_1)) {
233 if (key->type == key_gc_dead_keytype) {
234 gc_state |= KEY_GC_FOUND_DEAD_KEY;
235 set_bit(KEY_FLAG_DEAD, &key->flags);
238 } else if (key->type == &key_type_keyring &&
239 key->restrict_link) {
240 goto found_restricted_keyring;
244 expiry = key->expiry;
245 if (expiry != TIME64_MAX) {
246 if (!(key->type->flags & KEY_TYPE_INSTANT_REAP))
247 expiry += key_gc_delay;
248 if (expiry > limit && expiry < new_timer) {
249 kdebug("will expire %x in %lld",
250 key_serial(key), key->expiry - limit);
251 new_timer = key->expiry;
255 if (unlikely(gc_state & KEY_GC_REAPING_DEAD_2))
256 if (key->type == key_gc_dead_keytype)
257 gc_state |= KEY_GC_FOUND_DEAD_KEY;
259 if ((gc_state & KEY_GC_REAPING_LINKS) ||
260 unlikely(gc_state & KEY_GC_REAPING_DEAD_2)) {
261 if (key->type == &key_type_keyring)
265 if (unlikely(gc_state & KEY_GC_REAPING_DEAD_3))
266 if (key->type == key_gc_dead_keytype)
267 goto destroy_dead_key;
270 if (spin_is_contended(&key_serial_lock) || need_resched())
275 spin_unlock(&key_serial_lock);
280 spin_lock(&key_serial_lock);
281 goto continue_scanning;
284 /* We've completed the pass. Set the timer if we need to and queue a
285 * new cycle if necessary. We keep executing cycles until we find one
286 * where we didn't reap any keys.
288 kdebug("pass complete");
290 if (new_timer != TIME64_MAX) {
291 new_timer += key_gc_delay;
292 key_schedule_gc(new_timer);
295 if (unlikely(gc_state & KEY_GC_REAPING_DEAD_2) ||
296 !list_empty(&graveyard)) {
297 /* Make sure that all pending keyring payload destructions are
298 * fulfilled and that people aren't now looking at dead or
299 * dying keys that they don't have a reference upon or a link
306 if (!list_empty(&graveyard)) {
308 key_gc_unused_keys(&graveyard);
311 if (unlikely(gc_state & (KEY_GC_REAPING_DEAD_1 |
312 KEY_GC_REAPING_DEAD_2))) {
313 if (!(gc_state & KEY_GC_FOUND_DEAD_KEY)) {
314 /* No remaining dead keys: short circuit the remaining
315 * keytype reap cycles.
317 kdebug("dead short");
318 gc_state &= ~(KEY_GC_REAPING_DEAD_1 | KEY_GC_REAPING_DEAD_2);
319 gc_state |= KEY_GC_REAPING_DEAD_3;
321 gc_state |= KEY_GC_REAP_AGAIN;
325 if (unlikely(gc_state & KEY_GC_REAPING_DEAD_3)) {
328 clear_bit(KEY_GC_REAPING_KEYTYPE, &key_gc_flags);
329 wake_up_bit(&key_gc_flags, KEY_GC_REAPING_KEYTYPE);
332 if (gc_state & KEY_GC_REAP_AGAIN)
333 schedule_work(&key_gc_work);
334 kleave(" [end %x]", gc_state);
337 /* We found an unreferenced key - once we've removed it from the tree,
338 * we can safely drop the lock.
340 found_unreferenced_key:
341 kdebug("unrefd key %d", key->serial);
342 rb_erase(&key->serial_node, &key_serial_tree);
343 spin_unlock(&key_serial_lock);
345 list_add_tail(&key->graveyard_link, &graveyard);
346 gc_state |= KEY_GC_REAP_AGAIN;
349 /* We found a restricted keyring and need to update the restriction if
350 * it is associated with the dead key type.
352 found_restricted_keyring:
353 spin_unlock(&key_serial_lock);
354 keyring_restriction_gc(key, key_gc_dead_keytype);
357 /* We found a keyring and we need to check the payload for links to
358 * dead or expired keys. We don't flag another reap immediately as we
359 * have to wait for the old payload to be destroyed by RCU before we
360 * can reap the keys to which it refers.
363 spin_unlock(&key_serial_lock);
364 keyring_gc(key, limit);
367 /* We found a dead key that is still referenced. Reset its type and
368 * destroy its payload with its semaphore held.
371 spin_unlock(&key_serial_lock);
372 kdebug("destroy key %d", key->serial);
373 down_write(&key->sem);
374 key->type = &key_type_dead;
375 if (key_gc_dead_keytype->destroy)
376 key_gc_dead_keytype->destroy(key);
377 memset(&key->payload, KEY_DESTROY, sizeof(key->payload));