gc.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405
  1. /* Key garbage collector
  2. *
  3. * Copyright (C) 2009-2011 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 Licence
  8. * as published by the Free Software Foundation; either version
  9. * 2 of the Licence, or (at your option) any later version.
  10. */
  11. #include <linux/module.h>
  12. #include <linux/slab.h>
  13. #include <linux/security.h>
  14. #include <keys/keyring-type.h>
  15. #include "internal.h"
  16. /*
  17. * Delay between key revocation/expiry in seconds
  18. */
  19. unsigned key_gc_delay = 5 * 60;
  20. /*
  21. * Reaper for unused keys.
  22. */
  23. static void key_garbage_collector(struct work_struct *work);
  24. DECLARE_WORK(key_gc_work, key_garbage_collector);
  25. /*
  26. * Reaper for links from keyrings to dead keys.
  27. */
  28. static void key_gc_timer_func(unsigned long);
  29. static DEFINE_TIMER(key_gc_timer, key_gc_timer_func, 0, 0);
  30. static time_t key_gc_next_run = LONG_MAX;
  31. static struct key_type *key_gc_dead_keytype;
  32. static unsigned long key_gc_flags;
  33. #define KEY_GC_KEY_EXPIRED 0 /* A key expired and needs unlinking */
  34. #define KEY_GC_REAP_KEYTYPE 1 /* A keytype is being unregistered */
  35. #define KEY_GC_REAPING_KEYTYPE 2 /* Cleared when keytype reaped */
  36. /*
  37. * Any key whose type gets unregistered will be re-typed to this if it can't be
  38. * immediately unlinked.
  39. */
  40. struct key_type key_type_dead = {
  41. .name = "dead",
  42. };
  43. /*
  44. * Schedule a garbage collection run.
  45. * - time precision isn't particularly important
  46. */
  47. void key_schedule_gc(time_t gc_at)
  48. {
  49. unsigned long expires;
  50. time_t now = current_kernel_time().tv_sec;
  51. kenter("%ld", gc_at - now);
  52. if (gc_at <= now || test_bit(KEY_GC_REAP_KEYTYPE, &key_gc_flags)) {
  53. kdebug("IMMEDIATE");
  54. queue_work(system_nrt_wq, &key_gc_work);
  55. } else if (gc_at < key_gc_next_run) {
  56. kdebug("DEFERRED");
  57. key_gc_next_run = gc_at;
  58. expires = jiffies + (gc_at - now) * HZ;
  59. mod_timer(&key_gc_timer, expires);
  60. }
  61. }
  62. /*
  63. * Some key's cleanup time was met after it expired, so we need to get the
  64. * reaper to go through a cycle finding expired keys.
  65. */
  66. static void key_gc_timer_func(unsigned long data)
  67. {
  68. kenter("");
  69. key_gc_next_run = LONG_MAX;
  70. set_bit(KEY_GC_KEY_EXPIRED, &key_gc_flags);
  71. queue_work(system_nrt_wq, &key_gc_work);
  72. }
  73. /*
  74. * wait_on_bit() sleep function for uninterruptible waiting
  75. */
  76. static int key_gc_wait_bit(void *flags)
  77. {
  78. schedule();
  79. return 0;
  80. }
  81. /*
  82. * Reap keys of dead type.
  83. *
  84. * We use three flags to make sure we see three complete cycles of the garbage
  85. * collector: the first to mark keys of that type as being dead, the second to
  86. * collect dead links and the third to clean up the dead keys. We have to be
  87. * careful as there may already be a cycle in progress.
  88. *
  89. * The caller must be holding key_types_sem.
  90. */
  91. void key_gc_keytype(struct key_type *ktype)
  92. {
  93. kenter("%s", ktype->name);
  94. key_gc_dead_keytype = ktype;
  95. set_bit(KEY_GC_REAPING_KEYTYPE, &key_gc_flags);
  96. smp_mb();
  97. set_bit(KEY_GC_REAP_KEYTYPE, &key_gc_flags);
  98. kdebug("schedule");
  99. queue_work(system_nrt_wq, &key_gc_work);
  100. kdebug("sleep");
  101. wait_on_bit(&key_gc_flags, KEY_GC_REAPING_KEYTYPE, key_gc_wait_bit,
  102. TASK_UNINTERRUPTIBLE);
  103. key_gc_dead_keytype = NULL;
  104. kleave("");
  105. }
  106. /*
  107. * Garbage collect pointers from a keyring.
  108. *
  109. * Not called with any locks held. The keyring's key struct will not be
  110. * deallocated under us as only our caller may deallocate it.
  111. */
  112. static void key_gc_keyring(struct key *keyring, time_t limit)
  113. {
  114. struct keyring_list *klist;
  115. struct key *key;
  116. int loop;
  117. kenter("%x", key_serial(keyring));
  118. if (test_bit(KEY_FLAG_REVOKED, &keyring->flags))
  119. goto dont_gc;
  120. /* scan the keyring looking for dead keys */
  121. rcu_read_lock();
  122. klist = rcu_dereference(keyring->payload.subscriptions);
  123. if (!klist)
  124. goto unlock_dont_gc;
  125. loop = klist->nkeys;
  126. smp_rmb();
  127. for (loop--; loop >= 0; loop--) {
  128. key = klist->keys[loop];
  129. if (test_bit(KEY_FLAG_DEAD, &key->flags) ||
  130. (key->expiry > 0 && key->expiry <= limit))
  131. goto do_gc;
  132. }
  133. unlock_dont_gc:
  134. rcu_read_unlock();
  135. dont_gc:
  136. kleave(" [no gc]");
  137. return;
  138. do_gc:
  139. rcu_read_unlock();
  140. keyring_gc(keyring, limit);
  141. kleave(" [gc]");
  142. }
  143. /*
  144. * Garbage collect a list of unreferenced, detached keys
  145. */
  146. static noinline void key_gc_unused_keys(struct list_head *keys)
  147. {
  148. while (!list_empty(keys)) {
  149. struct key *key =
  150. list_entry(keys->next, struct key, graveyard_link);
  151. list_del(&key->graveyard_link);
  152. kdebug("- %u", key->serial);
  153. key_check(key);
  154. security_key_free(key);
  155. /* deal with the user's key tracking and quota */
  156. if (test_bit(KEY_FLAG_IN_QUOTA, &key->flags)) {
  157. spin_lock(&key->user->lock);
  158. key->user->qnkeys--;
  159. key->user->qnbytes -= key->quotalen;
  160. spin_unlock(&key->user->lock);
  161. }
  162. atomic_dec(&key->user->nkeys);
  163. if (test_bit(KEY_FLAG_INSTANTIATED, &key->flags))
  164. atomic_dec(&key->user->nikeys);
  165. key_user_put(key->user);
  166. /* now throw away the key memory */
  167. if (key->type->destroy)
  168. key->type->destroy(key);
  169. kfree(key->description);
  170. #ifdef KEY_DEBUGGING
  171. key->magic = KEY_DEBUG_MAGIC_X;
  172. #endif
  173. kmem_cache_free(key_jar, key);
  174. }
  175. }
  176. /*
  177. * Garbage collector for unused keys.
  178. *
  179. * This is done in process context so that we don't have to disable interrupts
  180. * all over the place. key_put() schedules this rather than trying to do the
  181. * cleanup itself, which means key_put() doesn't have to sleep.
  182. */
  183. static void key_garbage_collector(struct work_struct *work)
  184. {
  185. static LIST_HEAD(graveyard);
  186. static u8 gc_state; /* Internal persistent state */
  187. #define KEY_GC_REAP_AGAIN 0x01 /* - Need another cycle */
  188. #define KEY_GC_REAPING_LINKS 0x02 /* - We need to reap links */
  189. #define KEY_GC_SET_TIMER 0x04 /* - We need to restart the timer */
  190. #define KEY_GC_REAPING_DEAD_1 0x10 /* - We need to mark dead keys */
  191. #define KEY_GC_REAPING_DEAD_2 0x20 /* - We need to reap dead key links */
  192. #define KEY_GC_REAPING_DEAD_3 0x40 /* - We need to reap dead keys */
  193. #define KEY_GC_FOUND_DEAD_KEY 0x80 /* - We found at least one dead key */
  194. struct rb_node *cursor;
  195. struct key *key;
  196. time_t new_timer, limit;
  197. kenter("[%lx,%x]", key_gc_flags, gc_state);
  198. limit = current_kernel_time().tv_sec;
  199. if (limit > key_gc_delay)
  200. limit -= key_gc_delay;
  201. else
  202. limit = key_gc_delay;
  203. /* Work out what we're going to be doing in this pass */
  204. gc_state &= KEY_GC_REAPING_DEAD_1 | KEY_GC_REAPING_DEAD_2;
  205. gc_state <<= 1;
  206. if (test_and_clear_bit(KEY_GC_KEY_EXPIRED, &key_gc_flags))
  207. gc_state |= KEY_GC_REAPING_LINKS | KEY_GC_SET_TIMER;
  208. if (test_and_clear_bit(KEY_GC_REAP_KEYTYPE, &key_gc_flags))
  209. gc_state |= KEY_GC_REAPING_DEAD_1;
  210. kdebug("new pass %x", gc_state);
  211. new_timer = LONG_MAX;
  212. /* As only this function is permitted to remove things from the key
  213. * serial tree, if cursor is non-NULL then it will always point to a
  214. * valid node in the tree - even if lock got dropped.
  215. */
  216. spin_lock(&key_serial_lock);
  217. cursor = rb_first(&key_serial_tree);
  218. continue_scanning:
  219. while (cursor) {
  220. key = rb_entry(cursor, struct key, serial_node);
  221. cursor = rb_next(cursor);
  222. if (atomic_read(&key->usage) == 0)
  223. goto found_unreferenced_key;
  224. if (unlikely(gc_state & KEY_GC_REAPING_DEAD_1)) {
  225. if (key->type == key_gc_dead_keytype) {
  226. gc_state |= KEY_GC_FOUND_DEAD_KEY;
  227. set_bit(KEY_FLAG_DEAD, &key->flags);
  228. key->perm = 0;
  229. goto skip_dead_key;
  230. }
  231. }
  232. if (gc_state & KEY_GC_SET_TIMER) {
  233. if (key->expiry > limit && key->expiry < new_timer) {
  234. kdebug("will expire %x in %ld",
  235. key_serial(key), key->expiry - limit);
  236. new_timer = key->expiry;
  237. }
  238. }
  239. if (unlikely(gc_state & KEY_GC_REAPING_DEAD_2))
  240. if (key->type == key_gc_dead_keytype)
  241. gc_state |= KEY_GC_FOUND_DEAD_KEY;
  242. if ((gc_state & KEY_GC_REAPING_LINKS) ||
  243. unlikely(gc_state & KEY_GC_REAPING_DEAD_2)) {
  244. if (key->type == &key_type_keyring)
  245. goto found_keyring;
  246. }
  247. if (unlikely(gc_state & KEY_GC_REAPING_DEAD_3))
  248. if (key->type == key_gc_dead_keytype)
  249. goto destroy_dead_key;
  250. skip_dead_key:
  251. if (spin_is_contended(&key_serial_lock) || need_resched())
  252. goto contended;
  253. }
  254. contended:
  255. spin_unlock(&key_serial_lock);
  256. maybe_resched:
  257. if (cursor) {
  258. cond_resched();
  259. spin_lock(&key_serial_lock);
  260. goto continue_scanning;
  261. }
  262. /* We've completed the pass. Set the timer if we need to and queue a
  263. * new cycle if necessary. We keep executing cycles until we find one
  264. * where we didn't reap any keys.
  265. */
  266. kdebug("pass complete");
  267. if (gc_state & KEY_GC_SET_TIMER && new_timer != (time_t)LONG_MAX) {
  268. new_timer += key_gc_delay;
  269. key_schedule_gc(new_timer);
  270. }
  271. if (unlikely(gc_state & KEY_GC_REAPING_DEAD_2) ||
  272. !list_empty(&graveyard)) {
  273. /* Make sure that all pending keyring payload destructions are
  274. * fulfilled and that people aren't now looking at dead or
  275. * dying keys that they don't have a reference upon or a link
  276. * to.
  277. */
  278. kdebug("gc sync");
  279. synchronize_rcu();
  280. }
  281. if (!list_empty(&graveyard)) {
  282. kdebug("gc keys");
  283. key_gc_unused_keys(&graveyard);
  284. }
  285. if (unlikely(gc_state & (KEY_GC_REAPING_DEAD_1 |
  286. KEY_GC_REAPING_DEAD_2))) {
  287. if (!(gc_state & KEY_GC_FOUND_DEAD_KEY)) {
  288. /* No remaining dead keys: short circuit the remaining
  289. * keytype reap cycles.
  290. */
  291. kdebug("dead short");
  292. gc_state &= ~(KEY_GC_REAPING_DEAD_1 | KEY_GC_REAPING_DEAD_2);
  293. gc_state |= KEY_GC_REAPING_DEAD_3;
  294. } else {
  295. gc_state |= KEY_GC_REAP_AGAIN;
  296. }
  297. }
  298. if (unlikely(gc_state & KEY_GC_REAPING_DEAD_3)) {
  299. kdebug("dead wake");
  300. smp_mb();
  301. clear_bit(KEY_GC_REAPING_KEYTYPE, &key_gc_flags);
  302. wake_up_bit(&key_gc_flags, KEY_GC_REAPING_KEYTYPE);
  303. }
  304. if (gc_state & KEY_GC_REAP_AGAIN)
  305. queue_work(system_nrt_wq, &key_gc_work);
  306. kleave(" [end %x]", gc_state);
  307. return;
  308. /* We found an unreferenced key - once we've removed it from the tree,
  309. * we can safely drop the lock.
  310. */
  311. found_unreferenced_key:
  312. kdebug("unrefd key %d", key->serial);
  313. rb_erase(&key->serial_node, &key_serial_tree);
  314. spin_unlock(&key_serial_lock);
  315. list_add_tail(&key->graveyard_link, &graveyard);
  316. gc_state |= KEY_GC_REAP_AGAIN;
  317. goto maybe_resched;
  318. /* We found a keyring and we need to check the payload for links to
  319. * dead or expired keys. We don't flag another reap immediately as we
  320. * have to wait for the old payload to be destroyed by RCU before we
  321. * can reap the keys to which it refers.
  322. */
  323. found_keyring:
  324. spin_unlock(&key_serial_lock);
  325. kdebug("scan keyring %d", key->serial);
  326. key_gc_keyring(key, limit);
  327. goto maybe_resched;
  328. /* We found a dead key that is still referenced. Reset its type and
  329. * destroy its payload with its semaphore held.
  330. */
  331. destroy_dead_key:
  332. spin_unlock(&key_serial_lock);
  333. kdebug("destroy key %d", key->serial);
  334. down_write(&key->sem);
  335. key->type = &key_type_dead;
  336. if (key_gc_dead_keytype->destroy)
  337. key_gc_dead_keytype->destroy(key);
  338. memset(&key->payload, KEY_DESTROY, sizeof(key->payload));
  339. up_write(&key->sem);
  340. goto maybe_resched;
  341. }