1 /* Basic authentication token and access key management
3 * Copyright (C) 2004-2008 Red Hat, Inc. All Rights Reserved.
4 * Written by David Howells (dhowells@redhat.com)
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.
12 #include <linux/module.h>
13 #include <linux/init.h>
14 #include <linux/poison.h>
15 #include <linux/sched.h>
16 #include <linux/slab.h>
17 #include <linux/security.h>
18 #include <linux/workqueue.h>
19 #include <linux/random.h>
20 #include <linux/err.h>
23 struct kmem_cache *key_jar;
24 struct rb_root key_serial_tree; /* tree of keys indexed by serial */
25 DEFINE_SPINLOCK(key_serial_lock);
27 struct rb_root key_user_tree; /* tree of quota records indexed by UID */
28 DEFINE_SPINLOCK(key_user_lock);
30 unsigned int key_quota_root_maxkeys = 200; /* root's key count quota */
31 unsigned int key_quota_root_maxbytes = 20000; /* root's key space quota */
32 unsigned int key_quota_maxkeys = 200; /* general key count quota */
33 unsigned int key_quota_maxbytes = 20000; /* general key space quota */
35 static LIST_HEAD(key_types_list);
36 static DECLARE_RWSEM(key_types_sem);
38 /* We serialise key instantiation and link */
39 DEFINE_MUTEX(key_construction_mutex);
42 void __key_check(const struct key *key)
44 printk("__key_check: key %p {%08x} should be {%08x}\n",
45 key, key->magic, KEY_DEBUG_MAGIC);
51 * Get the key quota record for a user, allocating a new record if one doesn't
54 struct key_user *key_user_lookup(kuid_t uid)
56 struct key_user *candidate = NULL, *user;
57 struct rb_node *parent = NULL;
61 p = &key_user_tree.rb_node;
62 spin_lock(&key_user_lock);
64 /* search the tree for a user record with a matching UID */
67 user = rb_entry(parent, struct key_user, node);
69 if (uid_lt(uid, user->uid))
71 else if (uid_gt(uid, user->uid))
77 /* if we get here, we failed to find a match in the tree */
79 /* allocate a candidate user record if we don't already have
81 spin_unlock(&key_user_lock);
84 candidate = kmalloc(sizeof(struct key_user), GFP_KERNEL);
85 if (unlikely(!candidate))
88 /* the allocation may have scheduled, so we need to repeat the
89 * search lest someone else added the record whilst we were
94 /* if we get here, then the user record still hadn't appeared on the
95 * second pass - so we use the candidate record */
96 atomic_set(&candidate->usage, 1);
97 atomic_set(&candidate->nkeys, 0);
98 atomic_set(&candidate->nikeys, 0);
100 candidate->qnkeys = 0;
101 candidate->qnbytes = 0;
102 spin_lock_init(&candidate->lock);
103 mutex_init(&candidate->cons_lock);
105 rb_link_node(&candidate->node, parent, p);
106 rb_insert_color(&candidate->node, &key_user_tree);
107 spin_unlock(&key_user_lock);
111 /* okay - we found a user record for this UID */
113 atomic_inc(&user->usage);
114 spin_unlock(&key_user_lock);
121 * Dispose of a user structure
123 void key_user_put(struct key_user *user)
125 if (atomic_dec_and_lock(&user->usage, &key_user_lock)) {
126 rb_erase(&user->node, &key_user_tree);
127 spin_unlock(&key_user_lock);
134 * Allocate a serial number for a key. These are assigned randomly to avoid
135 * security issues through covert channel problems.
137 static inline void key_alloc_serial(struct key *key)
139 struct rb_node *parent, **p;
142 /* propose a random serial number and look for a hole for it in the
143 * serial number tree */
145 get_random_bytes(&key->serial, sizeof(key->serial));
147 key->serial >>= 1; /* negative numbers are not permitted */
148 } while (key->serial < 3);
150 spin_lock(&key_serial_lock);
154 p = &key_serial_tree.rb_node;
158 xkey = rb_entry(parent, struct key, serial_node);
160 if (key->serial < xkey->serial)
162 else if (key->serial > xkey->serial)
168 /* we've found a suitable hole - arrange for this key to occupy it */
169 rb_link_node(&key->serial_node, parent, p);
170 rb_insert_color(&key->serial_node, &key_serial_tree);
172 spin_unlock(&key_serial_lock);
175 /* we found a key with the proposed serial number - walk the tree from
176 * that point looking for the next unused serial number */
180 if (key->serial < 3) {
182 goto attempt_insertion;
185 parent = rb_next(parent);
187 goto attempt_insertion;
189 xkey = rb_entry(parent, struct key, serial_node);
190 if (key->serial < xkey->serial)
191 goto attempt_insertion;
196 * key_alloc - Allocate a key of the specified type.
197 * @type: The type of key to allocate.
198 * @desc: The key description to allow the key to be searched out.
199 * @uid: The owner of the new key.
200 * @gid: The group ID for the new key's group permissions.
201 * @cred: The credentials specifying UID namespace.
202 * @perm: The permissions mask of the new key.
203 * @flags: Flags specifying quota properties.
205 * Allocate a key of the specified type with the attributes given. The key is
206 * returned in an uninstantiated state and the caller needs to instantiate the
207 * key before returning.
209 * The user's key count quota is updated to reflect the creation of the key and
210 * the user's key data quota has the default for the key type reserved. The
211 * instantiation function should amend this as necessary. If insufficient
212 * quota is available, -EDQUOT will be returned.
214 * The LSM security modules can prevent a key being created, in which case
215 * -EACCES will be returned.
217 * Returns a pointer to the new key if successful and an error code otherwise.
219 * Note that the caller needs to ensure the key type isn't uninstantiated.
220 * Internally this can be done by locking key_types_sem. Externally, this can
221 * be done by either never unregistering the key type, or making sure
222 * key_alloc() calls don't race with module unloading.
224 struct key *key_alloc(struct key_type *type, const char *desc,
225 kuid_t uid, kgid_t gid, const struct cred *cred,
226 key_perm_t perm, unsigned long flags)
228 struct key_user *user = NULL;
230 size_t desclen, quotalen;
233 key = ERR_PTR(-EINVAL);
237 if (type->vet_description) {
238 ret = type->vet_description(desc);
245 desclen = strlen(desc);
246 quotalen = desclen + 1 + type->def_datalen;
248 /* get hold of the key tracking for this user */
249 user = key_user_lookup(uid);
253 /* check that the user's quota permits allocation of another key and
255 if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) {
256 unsigned maxkeys = uid_eq(uid, GLOBAL_ROOT_UID) ?
257 key_quota_root_maxkeys : key_quota_maxkeys;
258 unsigned maxbytes = uid_eq(uid, GLOBAL_ROOT_UID) ?
259 key_quota_root_maxbytes : key_quota_maxbytes;
261 spin_lock(&user->lock);
262 if (!(flags & KEY_ALLOC_QUOTA_OVERRUN)) {
263 if (user->qnkeys + 1 >= maxkeys ||
264 user->qnbytes + quotalen >= maxbytes ||
265 user->qnbytes + quotalen < user->qnbytes)
270 user->qnbytes += quotalen;
271 spin_unlock(&user->lock);
274 /* allocate and initialise the key and its description */
275 key = kmem_cache_alloc(key_jar, GFP_KERNEL);
280 key->index_key.desc_len = desclen;
281 key->index_key.description = kmemdup(desc, desclen + 1, GFP_KERNEL);
282 if (!key->description)
286 atomic_set(&key->usage, 1);
287 init_rwsem(&key->sem);
288 lockdep_set_class(&key->sem, &type->lock_class);
289 key->index_key.type = type;
291 key->quotalen = quotalen;
292 key->datalen = type->def_datalen;
298 key->payload.data = NULL;
299 key->security = NULL;
301 if (!(flags & KEY_ALLOC_NOT_IN_QUOTA))
302 key->flags |= 1 << KEY_FLAG_IN_QUOTA;
304 memset(&key->type_data, 0, sizeof(key->type_data));
307 key->magic = KEY_DEBUG_MAGIC;
310 /* let the security module know about the key */
311 ret = security_key_alloc(key, cred, flags);
315 /* publish the key by giving it a serial number */
316 atomic_inc(&user->nkeys);
317 key_alloc_serial(key);
323 kfree(key->description);
324 kmem_cache_free(key_jar, key);
325 if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) {
326 spin_lock(&user->lock);
328 user->qnbytes -= quotalen;
329 spin_unlock(&user->lock);
336 kmem_cache_free(key_jar, key);
338 if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) {
339 spin_lock(&user->lock);
341 user->qnbytes -= quotalen;
342 spin_unlock(&user->lock);
346 key = ERR_PTR(-ENOMEM);
350 spin_unlock(&user->lock);
352 key = ERR_PTR(-EDQUOT);
355 EXPORT_SYMBOL(key_alloc);
358 * key_payload_reserve - Adjust data quota reservation for the key's payload
359 * @key: The key to make the reservation for.
360 * @datalen: The amount of data payload the caller now wants.
362 * Adjust the amount of the owning user's key data quota that a key reserves.
363 * If the amount is increased, then -EDQUOT may be returned if there isn't
364 * enough free quota available.
366 * If successful, 0 is returned.
368 int key_payload_reserve(struct key *key, size_t datalen)
370 int delta = (int)datalen - key->datalen;
375 /* contemplate the quota adjustment */
376 if (delta != 0 && test_bit(KEY_FLAG_IN_QUOTA, &key->flags)) {
377 unsigned maxbytes = uid_eq(key->user->uid, GLOBAL_ROOT_UID) ?
378 key_quota_root_maxbytes : key_quota_maxbytes;
380 spin_lock(&key->user->lock);
383 (key->user->qnbytes + delta >= maxbytes ||
384 key->user->qnbytes + delta < key->user->qnbytes)) {
388 key->user->qnbytes += delta;
389 key->quotalen += delta;
391 spin_unlock(&key->user->lock);
394 /* change the recorded data length if that didn't generate an error */
396 key->datalen = datalen;
400 EXPORT_SYMBOL(key_payload_reserve);
403 * Instantiate a key and link it into the target keyring atomically. Must be
404 * called with the target keyring's semaphore writelocked. The target key's
405 * semaphore need not be locked as instantiation is serialised by
406 * key_construction_mutex.
408 static int __key_instantiate_and_link(struct key *key,
409 struct key_preparsed_payload *prep,
412 unsigned long *_prealloc)
422 mutex_lock(&key_construction_mutex);
424 /* can't instantiate twice */
425 if (!test_bit(KEY_FLAG_INSTANTIATED, &key->flags)) {
426 /* instantiate the key */
427 ret = key->type->instantiate(key, prep);
430 /* mark the key as being instantiated */
431 atomic_inc(&key->user->nikeys);
432 set_bit(KEY_FLAG_INSTANTIATED, &key->flags);
434 if (test_and_clear_bit(KEY_FLAG_USER_CONSTRUCT, &key->flags))
437 /* and link it into the destination keyring */
439 __key_link(keyring, key, _prealloc);
441 /* disable the authorisation key */
447 mutex_unlock(&key_construction_mutex);
449 /* wake up anyone waiting for a key to be constructed */
451 wake_up_bit(&key->flags, KEY_FLAG_USER_CONSTRUCT);
457 * key_instantiate_and_link - Instantiate a key and link it into the keyring.
458 * @key: The key to instantiate.
459 * @data: The data to use to instantiate the keyring.
460 * @datalen: The length of @data.
461 * @keyring: Keyring to create a link in on success (or NULL).
462 * @authkey: The authorisation token permitting instantiation.
464 * Instantiate a key that's in the uninstantiated state using the provided data
465 * and, if successful, link it in to the destination keyring if one is
468 * If successful, 0 is returned, the authorisation token is revoked and anyone
469 * waiting for the key is woken up. If the key was already instantiated,
470 * -EBUSY will be returned.
472 int key_instantiate_and_link(struct key *key,
478 struct key_preparsed_payload prep;
479 unsigned long prealloc;
482 memset(&prep, 0, sizeof(prep));
484 prep.datalen = datalen;
485 prep.quotalen = key->type->def_datalen;
486 if (key->type->preparse) {
487 ret = key->type->preparse(&prep);
493 ret = __key_link_begin(keyring, &key->index_key, &prealloc);
495 goto error_free_preparse;
498 ret = __key_instantiate_and_link(key, &prep, keyring, authkey,
502 __key_link_end(keyring, &key->index_key, prealloc);
505 if (key->type->preparse)
506 key->type->free_preparse(&prep);
511 EXPORT_SYMBOL(key_instantiate_and_link);
514 * key_reject_and_link - Negatively instantiate a key and link it into the keyring.
515 * @key: The key to instantiate.
516 * @timeout: The timeout on the negative key.
517 * @error: The error to return when the key is hit.
518 * @keyring: Keyring to create a link in on success (or NULL).
519 * @authkey: The authorisation token permitting instantiation.
521 * Negatively instantiate a key that's in the uninstantiated state and, if
522 * successful, set its timeout and stored error and link it in to the
523 * destination keyring if one is supplied. The key and any links to the key
524 * will be automatically garbage collected after the timeout expires.
526 * Negative keys are used to rate limit repeated request_key() calls by causing
527 * them to return the stored error code (typically ENOKEY) until the negative
530 * If successful, 0 is returned, the authorisation token is revoked and anyone
531 * waiting for the key is woken up. If the key was already instantiated,
532 * -EBUSY will be returned.
534 int key_reject_and_link(struct key *key,
540 unsigned long prealloc;
542 int ret, awaken, link_ret = 0;
551 link_ret = __key_link_begin(keyring, &key->index_key, &prealloc);
553 mutex_lock(&key_construction_mutex);
555 /* can't instantiate twice */
556 if (!test_bit(KEY_FLAG_INSTANTIATED, &key->flags)) {
557 /* mark the key as being negatively instantiated */
558 atomic_inc(&key->user->nikeys);
559 set_bit(KEY_FLAG_NEGATIVE, &key->flags);
560 set_bit(KEY_FLAG_INSTANTIATED, &key->flags);
561 key->type_data.reject_error = -error;
562 now = current_kernel_time();
563 key->expiry = now.tv_sec + timeout;
564 key_schedule_gc(key->expiry + key_gc_delay);
566 if (test_and_clear_bit(KEY_FLAG_USER_CONSTRUCT, &key->flags))
571 /* and link it into the destination keyring */
572 if (keyring && link_ret == 0)
573 __key_link(keyring, key, &prealloc);
575 /* disable the authorisation key */
580 mutex_unlock(&key_construction_mutex);
583 __key_link_end(keyring, &key->index_key, prealloc);
585 /* wake up anyone waiting for a key to be constructed */
587 wake_up_bit(&key->flags, KEY_FLAG_USER_CONSTRUCT);
589 return ret == 0 ? link_ret : ret;
591 EXPORT_SYMBOL(key_reject_and_link);
594 * key_put - Discard a reference to a key.
595 * @key: The key to discard a reference from.
597 * Discard a reference to a key, and when all the references are gone, we
598 * schedule the cleanup task to come and pull it out of the tree in process
599 * context at some later time.
601 void key_put(struct key *key)
606 if (atomic_dec_and_test(&key->usage))
607 schedule_work(&key_gc_work);
610 EXPORT_SYMBOL(key_put);
613 * Find a key by its serial number.
615 struct key *key_lookup(key_serial_t id)
620 spin_lock(&key_serial_lock);
622 /* search the tree for the specified key */
623 n = key_serial_tree.rb_node;
625 key = rb_entry(n, struct key, serial_node);
627 if (id < key->serial)
629 else if (id > key->serial)
636 key = ERR_PTR(-ENOKEY);
640 /* pretend it doesn't exist if it is awaiting deletion */
641 if (atomic_read(&key->usage) == 0)
644 /* this races with key_put(), but that doesn't matter since key_put()
645 * doesn't actually change the key
650 spin_unlock(&key_serial_lock);
655 * Find and lock the specified key type against removal.
657 * We return with the sem read-locked if successful. If the type wasn't
658 * available -ENOKEY is returned instead.
660 struct key_type *key_type_lookup(const char *type)
662 struct key_type *ktype;
664 down_read(&key_types_sem);
666 /* look up the key type to see if it's one of the registered kernel
668 list_for_each_entry(ktype, &key_types_list, link) {
669 if (strcmp(ktype->name, type) == 0)
670 goto found_kernel_type;
673 up_read(&key_types_sem);
674 ktype = ERR_PTR(-ENOKEY);
680 void key_set_timeout(struct key *key, unsigned timeout)
685 /* make the changes with the locks held to prevent races */
686 down_write(&key->sem);
689 now = current_kernel_time();
690 expiry = now.tv_sec + timeout;
693 key->expiry = expiry;
694 key_schedule_gc(key->expiry + key_gc_delay);
698 EXPORT_SYMBOL_GPL(key_set_timeout);
701 * Unlock a key type locked by key_type_lookup().
703 void key_type_put(struct key_type *ktype)
705 up_read(&key_types_sem);
709 * Attempt to update an existing key.
711 * The key is given to us with an incremented refcount that we need to discard
712 * if we get an error.
714 static inline key_ref_t __key_update(key_ref_t key_ref,
715 struct key_preparsed_payload *prep)
717 struct key *key = key_ref_to_ptr(key_ref);
720 /* need write permission on the key to update it */
721 ret = key_permission(key_ref, KEY_WRITE);
726 if (!key->type->update)
729 down_write(&key->sem);
731 ret = key->type->update(key, prep);
733 /* updating a negative key instantiates it */
734 clear_bit(KEY_FLAG_NEGATIVE, &key->flags);
745 key_ref = ERR_PTR(ret);
750 * key_create_or_update - Update or create and instantiate a key.
751 * @keyring_ref: A pointer to the destination keyring with possession flag.
752 * @type: The type of key.
753 * @description: The searchable description for the key.
754 * @payload: The data to use to instantiate or update the key.
755 * @plen: The length of @payload.
756 * @perm: The permissions mask for a new key.
757 * @flags: The quota flags for a new key.
759 * Search the destination keyring for a key of the same description and if one
760 * is found, update it, otherwise create and instantiate a new one and create a
761 * link to it from that keyring.
763 * If perm is KEY_PERM_UNDEF then an appropriate key permissions mask will be
766 * Returns a pointer to the new key if successful, -ENODEV if the key type
767 * wasn't available, -ENOTDIR if the keyring wasn't a keyring, -EACCES if the
768 * caller isn't permitted to modify the keyring or the LSM did not permit
769 * creation of the key.
771 * On success, the possession flag from the keyring ref will be tacked on to
772 * the key ref before it is returned.
774 key_ref_t key_create_or_update(key_ref_t keyring_ref,
776 const char *description,
782 struct keyring_index_key index_key = {
783 .description = description,
785 struct key_preparsed_payload prep;
786 const struct cred *cred = current_cred();
787 unsigned long prealloc;
788 struct key *keyring, *key = NULL;
792 /* look up the key type to see if it's one of the registered kernel
794 index_key.type = key_type_lookup(type);
795 if (IS_ERR(index_key.type)) {
796 key_ref = ERR_PTR(-ENODEV);
800 key_ref = ERR_PTR(-EINVAL);
801 if (!index_key.type->match || !index_key.type->instantiate ||
802 (!index_key.description && !index_key.type->preparse))
805 keyring = key_ref_to_ptr(keyring_ref);
809 key_ref = ERR_PTR(-ENOTDIR);
810 if (keyring->type != &key_type_keyring)
813 memset(&prep, 0, sizeof(prep));
816 prep.quotalen = index_key.type->def_datalen;
817 if (index_key.type->preparse) {
818 ret = index_key.type->preparse(&prep);
820 key_ref = ERR_PTR(ret);
823 if (!index_key.description)
824 index_key.description = prep.description;
825 key_ref = ERR_PTR(-EINVAL);
826 if (!index_key.description)
827 goto error_free_prep;
829 index_key.desc_len = strlen(index_key.description);
831 ret = __key_link_begin(keyring, &index_key, &prealloc);
833 key_ref = ERR_PTR(ret);
834 goto error_free_prep;
837 /* if we're going to allocate a new key, we're going to have
838 * to modify the keyring */
839 ret = key_permission(keyring_ref, KEY_WRITE);
841 key_ref = ERR_PTR(ret);
845 /* if it's possible to update this type of key, search for an existing
846 * key of the same type and description in the destination keyring and
847 * update that instead if possible
849 if (index_key.type->update) {
850 key_ref = __keyring_search_one(keyring_ref, &index_key, 0);
851 if (!IS_ERR(key_ref))
852 goto found_matching_key;
855 /* if the client doesn't provide, decide on the permissions we want */
856 if (perm == KEY_PERM_UNDEF) {
857 perm = KEY_POS_VIEW | KEY_POS_SEARCH | KEY_POS_LINK | KEY_POS_SETATTR;
858 perm |= KEY_USR_VIEW;
860 if (index_key.type->read)
861 perm |= KEY_POS_READ;
863 if (index_key.type == &key_type_keyring ||
864 index_key.type->update)
865 perm |= KEY_POS_WRITE;
868 /* allocate a new key */
869 key = key_alloc(index_key.type, index_key.description,
870 cred->fsuid, cred->fsgid, cred, perm, flags);
872 key_ref = ERR_CAST(key);
876 /* instantiate it and link it into the target keyring */
877 ret = __key_instantiate_and_link(key, &prep, keyring, NULL, &prealloc);
880 key_ref = ERR_PTR(ret);
884 key_ref = make_key_ref(key, is_key_possessed(keyring_ref));
887 __key_link_end(keyring, &index_key, prealloc);
889 if (index_key.type->preparse)
890 index_key.type->free_preparse(&prep);
892 key_type_put(index_key.type);
897 /* we found a matching key, so we're going to try to update it
898 * - we can drop the locks first as we have the key pinned
900 __key_link_end(keyring, &index_key, prealloc);
902 key_ref = __key_update(key_ref, &prep);
903 goto error_free_prep;
905 EXPORT_SYMBOL(key_create_or_update);
908 * key_update - Update a key's contents.
909 * @key_ref: The pointer (plus possession flag) to the key.
910 * @payload: The data to be used to update the key.
911 * @plen: The length of @payload.
913 * Attempt to update the contents of a key with the given payload data. The
914 * caller must be granted Write permission on the key. Negative keys can be
915 * instantiated by this method.
917 * Returns 0 on success, -EACCES if not permitted and -EOPNOTSUPP if the key
918 * type does not support updating. The key type may return other errors.
920 int key_update(key_ref_t key_ref, const void *payload, size_t plen)
922 struct key_preparsed_payload prep;
923 struct key *key = key_ref_to_ptr(key_ref);
928 /* the key must be writable */
929 ret = key_permission(key_ref, KEY_WRITE);
933 /* attempt to update it if supported */
935 if (!key->type->update)
938 memset(&prep, 0, sizeof(prep));
941 prep.quotalen = key->type->def_datalen;
942 if (key->type->preparse) {
943 ret = key->type->preparse(&prep);
948 down_write(&key->sem);
950 ret = key->type->update(key, &prep);
952 /* updating a negative key instantiates it */
953 clear_bit(KEY_FLAG_NEGATIVE, &key->flags);
957 if (key->type->preparse)
958 key->type->free_preparse(&prep);
962 EXPORT_SYMBOL(key_update);
965 * key_revoke - Revoke a key.
966 * @key: The key to be revoked.
968 * Mark a key as being revoked and ask the type to free up its resources. The
969 * revocation timeout is set and the key and all its links will be
970 * automatically garbage collected after key_gc_delay amount of time if they
971 * are not manually dealt with first.
973 void key_revoke(struct key *key)
980 /* make sure no one's trying to change or use the key when we mark it
981 * - we tell lockdep that we might nest because we might be revoking an
982 * authorisation key whilst holding the sem on a key we've just
985 down_write_nested(&key->sem, 1);
986 if (!test_and_set_bit(KEY_FLAG_REVOKED, &key->flags) &&
988 key->type->revoke(key);
990 /* set the death time to no more than the expiry time */
991 now = current_kernel_time();
993 if (key->revoked_at == 0 || key->revoked_at > time) {
994 key->revoked_at = time;
995 key_schedule_gc(key->revoked_at + key_gc_delay);
1000 EXPORT_SYMBOL(key_revoke);
1003 * key_invalidate - Invalidate a key.
1004 * @key: The key to be invalidated.
1006 * Mark a key as being invalidated and have it cleaned up immediately. The key
1007 * is ignored by all searches and other operations from this point.
1009 void key_invalidate(struct key *key)
1011 kenter("%d", key_serial(key));
1015 if (!test_bit(KEY_FLAG_INVALIDATED, &key->flags)) {
1016 down_write_nested(&key->sem, 1);
1017 if (!test_and_set_bit(KEY_FLAG_INVALIDATED, &key->flags))
1018 key_schedule_gc_links();
1019 up_write(&key->sem);
1022 EXPORT_SYMBOL(key_invalidate);
1025 * register_key_type - Register a type of key.
1026 * @ktype: The new key type.
1028 * Register a new key type.
1030 * Returns 0 on success or -EEXIST if a type of this name already exists.
1032 int register_key_type(struct key_type *ktype)
1037 memset(&ktype->lock_class, 0, sizeof(ktype->lock_class));
1040 down_write(&key_types_sem);
1042 /* disallow key types with the same name */
1043 list_for_each_entry(p, &key_types_list, link) {
1044 if (strcmp(p->name, ktype->name) == 0)
1048 /* store the type */
1049 list_add(&ktype->link, &key_types_list);
1051 pr_notice("Key type %s registered\n", ktype->name);
1055 up_write(&key_types_sem);
1058 EXPORT_SYMBOL(register_key_type);
1061 * unregister_key_type - Unregister a type of key.
1062 * @ktype: The key type.
1064 * Unregister a key type and mark all the extant keys of this type as dead.
1065 * Those keys of this type are then destroyed to get rid of their payloads and
1066 * they and their links will be garbage collected as soon as possible.
1068 void unregister_key_type(struct key_type *ktype)
1070 down_write(&key_types_sem);
1071 list_del_init(&ktype->link);
1072 downgrade_write(&key_types_sem);
1073 key_gc_keytype(ktype);
1074 pr_notice("Key type %s unregistered\n", ktype->name);
1075 up_read(&key_types_sem);
1077 EXPORT_SYMBOL(unregister_key_type);
1080 * Initialise the key management state.
1082 void __init key_init(void)
1084 /* allocate a slab in which we can store keys */
1085 key_jar = kmem_cache_create("key_jar", sizeof(struct key),
1086 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
1088 /* add the special key types */
1089 list_add_tail(&key_type_keyring.link, &key_types_list);
1090 list_add_tail(&key_type_dead.link, &key_types_list);
1091 list_add_tail(&key_type_user.link, &key_types_list);
1092 list_add_tail(&key_type_logon.link, &key_types_list);
1094 /* record the root user tracking */
1095 rb_link_node(&root_key_user.node,
1097 &key_user_tree.rb_node);
1099 rb_insert_color(&root_key_user.node,