3 * Copyright (C) 2004-2005, 2008, 2013 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/sched.h>
15 #include <linux/slab.h>
16 #include <linux/security.h>
17 #include <linux/seq_file.h>
18 #include <linux/err.h>
19 #include <keys/keyring-type.h>
20 #include <keys/user-type.h>
21 #include <linux/assoc_array_priv.h>
22 #include <linux/uaccess.h>
26 * When plumbing the depths of the key tree, this sets a hard limit
27 * set on how deep we're willing to go.
29 #define KEYRING_SEARCH_MAX_DEPTH 6
32 * We keep all named keyrings in a hash to speed looking them up.
34 #define KEYRING_NAME_HASH_SIZE (1 << 5)
37 * We mark pointers we pass to the associative array with bit 1 set if
38 * they're keyrings and clear otherwise.
40 #define KEYRING_PTR_SUBTYPE 0x2UL
42 static inline bool keyring_ptr_is_keyring(const struct assoc_array_ptr *x)
44 return (unsigned long)x & KEYRING_PTR_SUBTYPE;
46 static inline struct key *keyring_ptr_to_key(const struct assoc_array_ptr *x)
48 void *object = assoc_array_ptr_to_leaf(x);
49 return (struct key *)((unsigned long)object & ~KEYRING_PTR_SUBTYPE);
51 static inline void *keyring_key_to_ptr(struct key *key)
53 if (key->type == &key_type_keyring)
54 return (void *)((unsigned long)key | KEYRING_PTR_SUBTYPE);
58 static struct list_head keyring_name_hash[KEYRING_NAME_HASH_SIZE];
59 static DEFINE_RWLOCK(keyring_name_lock);
61 static inline unsigned keyring_hash(const char *desc)
66 bucket += (unsigned char)*desc;
68 return bucket & (KEYRING_NAME_HASH_SIZE - 1);
72 * The keyring key type definition. Keyrings are simply keys of this type and
73 * can be treated as ordinary keys in addition to having their own special
76 static int keyring_preparse(struct key_preparsed_payload *prep);
77 static void keyring_free_preparse(struct key_preparsed_payload *prep);
78 static int keyring_instantiate(struct key *keyring,
79 struct key_preparsed_payload *prep);
80 static void keyring_revoke(struct key *keyring);
81 static void keyring_destroy(struct key *keyring);
82 static void keyring_describe(const struct key *keyring, struct seq_file *m);
83 static long keyring_read(const struct key *keyring,
84 char __user *buffer, size_t buflen);
86 struct key_type key_type_keyring = {
89 .preparse = keyring_preparse,
90 .free_preparse = keyring_free_preparse,
91 .instantiate = keyring_instantiate,
92 .revoke = keyring_revoke,
93 .destroy = keyring_destroy,
94 .describe = keyring_describe,
97 EXPORT_SYMBOL(key_type_keyring);
100 * Semaphore to serialise link/link calls to prevent two link calls in parallel
101 * introducing a cycle.
103 static DECLARE_RWSEM(keyring_serialise_link_sem);
106 * Publish the name of a keyring so that it can be found by name (if it has
109 static void keyring_publish_name(struct key *keyring)
113 if (keyring->description) {
114 bucket = keyring_hash(keyring->description);
116 write_lock(&keyring_name_lock);
118 if (!keyring_name_hash[bucket].next)
119 INIT_LIST_HEAD(&keyring_name_hash[bucket]);
121 list_add_tail(&keyring->name_link,
122 &keyring_name_hash[bucket]);
124 write_unlock(&keyring_name_lock);
129 * Preparse a keyring payload
131 static int keyring_preparse(struct key_preparsed_payload *prep)
133 return prep->datalen != 0 ? -EINVAL : 0;
137 * Free a preparse of a user defined key payload
139 static void keyring_free_preparse(struct key_preparsed_payload *prep)
144 * Initialise a keyring.
146 * Returns 0 on success, -EINVAL if given any data.
148 static int keyring_instantiate(struct key *keyring,
149 struct key_preparsed_payload *prep)
151 assoc_array_init(&keyring->keys);
152 /* make the keyring available by name if it has one */
153 keyring_publish_name(keyring);
158 * Multiply 64-bits by 32-bits to 96-bits and fold back to 64-bit. Ideally we'd
159 * fold the carry back too, but that requires inline asm.
161 static u64 mult_64x32_and_fold(u64 x, u32 y)
163 u64 hi = (u64)(u32)(x >> 32) * y;
164 u64 lo = (u64)(u32)(x) * y;
165 return lo + ((u64)(u32)hi << 32) + (u32)(hi >> 32);
169 * Hash a key type and description.
171 static unsigned long hash_key_type_and_desc(const struct keyring_index_key *index_key)
173 const unsigned level_shift = ASSOC_ARRAY_LEVEL_STEP;
174 const unsigned long fan_mask = ASSOC_ARRAY_FAN_MASK;
175 const char *description = index_key->description;
176 unsigned long hash, type;
179 int n, desc_len = index_key->desc_len;
181 type = (unsigned long)index_key->type;
183 acc = mult_64x32_and_fold(type, desc_len + 13);
184 acc = mult_64x32_and_fold(acc, 9207);
192 memcpy(&piece, description, n);
195 acc = mult_64x32_and_fold(acc, piece);
196 acc = mult_64x32_and_fold(acc, 9207);
199 /* Fold the hash down to 32 bits if need be. */
201 if (ASSOC_ARRAY_KEY_CHUNK_SIZE == 32)
204 /* Squidge all the keyrings into a separate part of the tree to
205 * ordinary keys by making sure the lowest level segment in the hash is
206 * zero for keyrings and non-zero otherwise.
208 if (index_key->type != &key_type_keyring && (hash & fan_mask) == 0)
209 return hash | (hash >> (ASSOC_ARRAY_KEY_CHUNK_SIZE - level_shift)) | 1;
210 if (index_key->type == &key_type_keyring && (hash & fan_mask) != 0)
211 return (hash + (hash << level_shift)) & ~fan_mask;
216 * Build the next index key chunk.
218 * On 32-bit systems the index key is laid out as:
221 * hash desclen typeptr desc[]
226 * hash desclen typeptr desc[]
228 * We return it one word-sized chunk at a time.
230 static unsigned long keyring_get_key_chunk(const void *data, int level)
232 const struct keyring_index_key *index_key = data;
233 unsigned long chunk = 0;
235 int desc_len = index_key->desc_len, n = sizeof(chunk);
237 level /= ASSOC_ARRAY_KEY_CHUNK_SIZE;
240 return hash_key_type_and_desc(index_key);
242 return ((unsigned long)index_key->type << 8) | desc_len;
245 return (u8)((unsigned long)index_key->type >>
246 (ASSOC_ARRAY_KEY_CHUNK_SIZE - 8));
250 offset += sizeof(chunk) - 1;
251 offset += (level - 3) * sizeof(chunk);
252 if (offset >= desc_len)
260 chunk |= ((u8*)index_key->description)[--offset];
261 } while (--desc_len > 0);
265 chunk |= (u8)((unsigned long)index_key->type >>
266 (ASSOC_ARRAY_KEY_CHUNK_SIZE - 8));
272 static unsigned long keyring_get_object_key_chunk(const void *object, int level)
274 const struct key *key = keyring_ptr_to_key(object);
275 return keyring_get_key_chunk(&key->index_key, level);
278 static bool keyring_compare_object(const void *object, const void *data)
280 const struct keyring_index_key *index_key = data;
281 const struct key *key = keyring_ptr_to_key(object);
283 return key->index_key.type == index_key->type &&
284 key->index_key.desc_len == index_key->desc_len &&
285 memcmp(key->index_key.description, index_key->description,
286 index_key->desc_len) == 0;
290 * Compare the index keys of a pair of objects and determine the bit position
291 * at which they differ - if they differ.
293 static int keyring_diff_objects(const void *object, const void *data)
295 const struct key *key_a = keyring_ptr_to_key(object);
296 const struct keyring_index_key *a = &key_a->index_key;
297 const struct keyring_index_key *b = data;
298 unsigned long seg_a, seg_b;
302 seg_a = hash_key_type_and_desc(a);
303 seg_b = hash_key_type_and_desc(b);
304 if ((seg_a ^ seg_b) != 0)
307 /* The number of bits contributed by the hash is controlled by a
308 * constant in the assoc_array headers. Everything else thereafter we
309 * can deal with as being machine word-size dependent.
311 level += ASSOC_ARRAY_KEY_CHUNK_SIZE / 8;
314 if ((seg_a ^ seg_b) != 0)
317 /* The next bit may not work on big endian */
319 seg_a = (unsigned long)a->type;
320 seg_b = (unsigned long)b->type;
321 if ((seg_a ^ seg_b) != 0)
324 level += sizeof(unsigned long);
325 if (a->desc_len == 0)
329 if (((unsigned long)a->description | (unsigned long)b->description) &
330 (sizeof(unsigned long) - 1)) {
332 seg_a = *(unsigned long *)(a->description + i);
333 seg_b = *(unsigned long *)(b->description + i);
334 if ((seg_a ^ seg_b) != 0)
336 i += sizeof(unsigned long);
337 } while (i < (a->desc_len & (sizeof(unsigned long) - 1)));
340 for (; i < a->desc_len; i++) {
341 seg_a = *(unsigned char *)(a->description + i);
342 seg_b = *(unsigned char *)(b->description + i);
343 if ((seg_a ^ seg_b) != 0)
353 i = level * 8 + __ffs(seg_a ^ seg_b);
358 * Free an object after stripping the keyring flag off of the pointer.
360 static void keyring_free_object(void *object)
362 key_put(keyring_ptr_to_key(object));
366 * Operations for keyring management by the index-tree routines.
368 static const struct assoc_array_ops keyring_assoc_array_ops = {
369 .get_key_chunk = keyring_get_key_chunk,
370 .get_object_key_chunk = keyring_get_object_key_chunk,
371 .compare_object = keyring_compare_object,
372 .diff_objects = keyring_diff_objects,
373 .free_object = keyring_free_object,
377 * Clean up a keyring when it is destroyed. Unpublish its name if it had one
378 * and dispose of its data.
380 * The garbage collector detects the final key_put(), removes the keyring from
381 * the serial number tree and then does RCU synchronisation before coming here,
382 * so we shouldn't need to worry about code poking around here with the RCU
383 * readlock held by this time.
385 static void keyring_destroy(struct key *keyring)
387 if (keyring->description) {
388 write_lock(&keyring_name_lock);
390 if (keyring->name_link.next != NULL &&
391 !list_empty(&keyring->name_link))
392 list_del(&keyring->name_link);
394 write_unlock(&keyring_name_lock);
397 assoc_array_destroy(&keyring->keys, &keyring_assoc_array_ops);
401 * Describe a keyring for /proc.
403 static void keyring_describe(const struct key *keyring, struct seq_file *m)
405 if (keyring->description)
406 seq_puts(m, keyring->description);
408 seq_puts(m, "[anon]");
410 if (key_is_positive(keyring)) {
411 if (keyring->keys.nr_leaves_on_tree != 0)
412 seq_printf(m, ": %lu", keyring->keys.nr_leaves_on_tree);
414 seq_puts(m, ": empty");
418 struct keyring_read_iterator_context {
421 key_serial_t __user *buffer;
424 static int keyring_read_iterator(const void *object, void *data)
426 struct keyring_read_iterator_context *ctx = data;
427 const struct key *key = keyring_ptr_to_key(object);
430 kenter("{%s,%d},,{%zu/%zu}",
431 key->type->name, key->serial, ctx->count, ctx->buflen);
433 if (ctx->count >= ctx->buflen)
436 ret = put_user(key->serial, ctx->buffer);
440 ctx->count += sizeof(key->serial);
445 * Read a list of key IDs from the keyring's contents in binary form
447 * The keyring's semaphore is read-locked by the caller. This prevents someone
448 * from modifying it under us - which could cause us to read key IDs multiple
451 static long keyring_read(const struct key *keyring,
452 char __user *buffer, size_t buflen)
454 struct keyring_read_iterator_context ctx;
455 unsigned long nr_keys;
458 kenter("{%d},,%zu", key_serial(keyring), buflen);
460 if (buflen & (sizeof(key_serial_t) - 1))
463 nr_keys = keyring->keys.nr_leaves_on_tree;
467 /* Calculate how much data we could return */
468 if (!buffer || !buflen)
469 return nr_keys * sizeof(key_serial_t);
471 /* Copy the IDs of the subscribed keys into the buffer */
472 ctx.buffer = (key_serial_t __user *)buffer;
475 ret = assoc_array_iterate(&keyring->keys, keyring_read_iterator, &ctx);
477 kleave(" = %d [iterate]", ret);
481 kleave(" = %zu [ok]", ctx.count);
486 * Allocate a keyring and link into the destination keyring.
488 struct key *keyring_alloc(const char *description, kuid_t uid, kgid_t gid,
489 const struct cred *cred, key_perm_t perm,
491 int (*restrict_link)(struct key *,
492 const struct key_type *,
493 const union key_payload *),
499 keyring = key_alloc(&key_type_keyring, description,
500 uid, gid, cred, perm, flags, restrict_link);
501 if (!IS_ERR(keyring)) {
502 ret = key_instantiate_and_link(keyring, NULL, 0, dest, NULL);
505 keyring = ERR_PTR(ret);
511 EXPORT_SYMBOL(keyring_alloc);
514 * restrict_link_reject - Give -EPERM to restrict link
515 * @keyring: The keyring being added to.
516 * @type: The type of key being added.
517 * @payload: The payload of the key intended to be added.
519 * Reject the addition of any links to a keyring. It can be overridden by
520 * passing KEY_ALLOC_BYPASS_RESTRICTION to key_instantiate_and_link() when
521 * adding a key to a keyring.
523 * This is meant to be passed as the restrict_link parameter to
526 int restrict_link_reject(struct key *keyring,
527 const struct key_type *type,
528 const union key_payload *payload)
534 * By default, we keys found by getting an exact match on their descriptions.
536 bool key_default_cmp(const struct key *key,
537 const struct key_match_data *match_data)
539 return strcmp(key->description, match_data->raw_data) == 0;
543 * Iteration function to consider each key found.
545 static int keyring_search_iterator(const void *object, void *iterator_data)
547 struct keyring_search_context *ctx = iterator_data;
548 const struct key *key = keyring_ptr_to_key(object);
549 unsigned long kflags = READ_ONCE(key->flags);
550 short state = READ_ONCE(key->state);
552 kenter("{%d}", key->serial);
554 /* ignore keys not of this type */
555 if (key->type != ctx->index_key.type) {
556 kleave(" = 0 [!type]");
560 /* skip invalidated, revoked and expired keys */
561 if (ctx->flags & KEYRING_SEARCH_DO_STATE_CHECK) {
562 if (kflags & ((1 << KEY_FLAG_INVALIDATED) |
563 (1 << KEY_FLAG_REVOKED))) {
564 ctx->result = ERR_PTR(-EKEYREVOKED);
565 kleave(" = %d [invrev]", ctx->skipped_ret);
569 if (key->expiry && ctx->now.tv_sec >= key->expiry) {
570 if (!(ctx->flags & KEYRING_SEARCH_SKIP_EXPIRED))
571 ctx->result = ERR_PTR(-EKEYEXPIRED);
572 kleave(" = %d [expire]", ctx->skipped_ret);
577 /* keys that don't match */
578 if (!ctx->match_data.cmp(key, &ctx->match_data)) {
579 kleave(" = 0 [!match]");
583 /* key must have search permissions */
584 if (!(ctx->flags & KEYRING_SEARCH_NO_CHECK_PERM) &&
585 key_task_permission(make_key_ref(key, ctx->possessed),
586 ctx->cred, KEY_NEED_SEARCH) < 0) {
587 ctx->result = ERR_PTR(-EACCES);
588 kleave(" = %d [!perm]", ctx->skipped_ret);
592 if (ctx->flags & KEYRING_SEARCH_DO_STATE_CHECK) {
593 /* we set a different error code if we pass a negative key */
595 ctx->result = ERR_PTR(state);
596 kleave(" = %d [neg]", ctx->skipped_ret);
602 ctx->result = make_key_ref(key, ctx->possessed);
603 kleave(" = 1 [found]");
607 return ctx->skipped_ret;
611 * Search inside a keyring for a key. We can search by walking to it
612 * directly based on its index-key or we can iterate over the entire
613 * tree looking for it, based on the match function.
615 static int search_keyring(struct key *keyring, struct keyring_search_context *ctx)
617 if (ctx->match_data.lookup_type == KEYRING_SEARCH_LOOKUP_DIRECT) {
620 object = assoc_array_find(&keyring->keys,
621 &keyring_assoc_array_ops,
623 return object ? ctx->iterator(object, ctx) : 0;
625 return assoc_array_iterate(&keyring->keys, ctx->iterator, ctx);
629 * Search a tree of keyrings that point to other keyrings up to the maximum
632 static bool search_nested_keyrings(struct key *keyring,
633 struct keyring_search_context *ctx)
637 struct assoc_array_node *node;
639 } stack[KEYRING_SEARCH_MAX_DEPTH];
641 struct assoc_array_shortcut *shortcut;
642 struct assoc_array_node *node;
643 struct assoc_array_ptr *ptr;
647 kenter("{%d},{%s,%s}",
649 ctx->index_key.type->name,
650 ctx->index_key.description);
652 #define STATE_CHECKS (KEYRING_SEARCH_NO_STATE_CHECK | KEYRING_SEARCH_DO_STATE_CHECK)
653 BUG_ON((ctx->flags & STATE_CHECKS) == 0 ||
654 (ctx->flags & STATE_CHECKS) == STATE_CHECKS);
656 if (ctx->index_key.description)
657 ctx->index_key.desc_len = strlen(ctx->index_key.description);
659 /* Check to see if this top-level keyring is what we are looking for
660 * and whether it is valid or not.
662 if (ctx->match_data.lookup_type == KEYRING_SEARCH_LOOKUP_ITERATE ||
663 keyring_compare_object(keyring, &ctx->index_key)) {
664 ctx->skipped_ret = 2;
665 switch (ctx->iterator(keyring_key_to_ptr(keyring), ctx)) {
675 ctx->skipped_ret = 0;
677 /* Start processing a new keyring */
679 kdebug("descend to %d", keyring->serial);
680 if (keyring->flags & ((1 << KEY_FLAG_INVALIDATED) |
681 (1 << KEY_FLAG_REVOKED)))
682 goto not_this_keyring;
684 /* Search through the keys in this keyring before its searching its
687 if (search_keyring(keyring, ctx))
690 /* Then manually iterate through the keyrings nested in this one.
692 * Start from the root node of the index tree. Because of the way the
693 * hash function has been set up, keyrings cluster on the leftmost
694 * branch of the root node (root slot 0) or in the root node itself.
695 * Non-keyrings avoid the leftmost branch of the root entirely (root
698 ptr = ACCESS_ONCE(keyring->keys.root);
700 goto not_this_keyring;
702 if (assoc_array_ptr_is_shortcut(ptr)) {
703 /* If the root is a shortcut, either the keyring only contains
704 * keyring pointers (everything clusters behind root slot 0) or
705 * doesn't contain any keyring pointers.
707 shortcut = assoc_array_ptr_to_shortcut(ptr);
708 smp_read_barrier_depends();
709 if ((shortcut->index_key[0] & ASSOC_ARRAY_FAN_MASK) != 0)
710 goto not_this_keyring;
712 ptr = ACCESS_ONCE(shortcut->next_node);
713 node = assoc_array_ptr_to_node(ptr);
717 node = assoc_array_ptr_to_node(ptr);
718 smp_read_barrier_depends();
720 ptr = node->slots[0];
721 if (!assoc_array_ptr_is_meta(ptr))
725 /* Descend to a more distal node in this keyring's content tree and go
729 if (assoc_array_ptr_is_shortcut(ptr)) {
730 shortcut = assoc_array_ptr_to_shortcut(ptr);
731 smp_read_barrier_depends();
732 ptr = ACCESS_ONCE(shortcut->next_node);
733 BUG_ON(!assoc_array_ptr_is_node(ptr));
735 node = assoc_array_ptr_to_node(ptr);
738 kdebug("begin_node");
739 smp_read_barrier_depends();
742 /* Go through the slots in a node */
743 for (; slot < ASSOC_ARRAY_FAN_OUT; slot++) {
744 ptr = ACCESS_ONCE(node->slots[slot]);
746 if (assoc_array_ptr_is_meta(ptr) && node->back_pointer)
747 goto descend_to_node;
749 if (!keyring_ptr_is_keyring(ptr))
752 key = keyring_ptr_to_key(ptr);
754 if (sp >= KEYRING_SEARCH_MAX_DEPTH) {
755 if (ctx->flags & KEYRING_SEARCH_DETECT_TOO_DEEP) {
756 ctx->result = ERR_PTR(-ELOOP);
759 goto not_this_keyring;
762 /* Search a nested keyring */
763 if (!(ctx->flags & KEYRING_SEARCH_NO_CHECK_PERM) &&
764 key_task_permission(make_key_ref(key, ctx->possessed),
765 ctx->cred, KEY_NEED_SEARCH) < 0)
768 /* stack the current position */
769 stack[sp].keyring = keyring;
770 stack[sp].node = node;
771 stack[sp].slot = slot;
774 /* begin again with the new keyring */
776 goto descend_to_keyring;
779 /* We've dealt with all the slots in the current node, so now we need
780 * to ascend to the parent and continue processing there.
782 ptr = ACCESS_ONCE(node->back_pointer);
783 slot = node->parent_slot;
785 if (ptr && assoc_array_ptr_is_shortcut(ptr)) {
786 shortcut = assoc_array_ptr_to_shortcut(ptr);
787 smp_read_barrier_depends();
788 ptr = ACCESS_ONCE(shortcut->back_pointer);
789 slot = shortcut->parent_slot;
792 goto not_this_keyring;
793 node = assoc_array_ptr_to_node(ptr);
794 smp_read_barrier_depends();
797 /* If we've ascended to the root (zero backpointer), we must have just
798 * finished processing the leftmost branch rather than the root slots -
799 * so there can't be any more keyrings for us to find.
801 if (node->back_pointer) {
802 kdebug("ascend %d", slot);
806 /* The keyring we're looking at was disqualified or didn't contain a
810 kdebug("not_this_keyring %d", sp);
816 /* Resume the processing of a keyring higher up in the tree */
818 keyring = stack[sp].keyring;
819 node = stack[sp].node;
820 slot = stack[sp].slot + 1;
821 kdebug("ascend to %d [%d]", keyring->serial, slot);
824 /* We found a viable match */
826 key = key_ref_to_ptr(ctx->result);
828 if (!(ctx->flags & KEYRING_SEARCH_NO_UPDATE_TIME)) {
829 key->last_used_at = ctx->now.tv_sec;
830 keyring->last_used_at = ctx->now.tv_sec;
832 stack[--sp].keyring->last_used_at = ctx->now.tv_sec;
839 * keyring_search_aux - Search a keyring tree for a key matching some criteria
840 * @keyring_ref: A pointer to the keyring with possession indicator.
841 * @ctx: The keyring search context.
843 * Search the supplied keyring tree for a key that matches the criteria given.
844 * The root keyring and any linked keyrings must grant Search permission to the
845 * caller to be searchable and keys can only be found if they too grant Search
846 * to the caller. The possession flag on the root keyring pointer controls use
847 * of the possessor bits in permissions checking of the entire tree. In
848 * addition, the LSM gets to forbid keyring searches and key matches.
850 * The search is performed as a breadth-then-depth search up to the prescribed
851 * limit (KEYRING_SEARCH_MAX_DEPTH).
853 * Keys are matched to the type provided and are then filtered by the match
854 * function, which is given the description to use in any way it sees fit. The
855 * match function may use any attributes of a key that it wishes to to
856 * determine the match. Normally the match function from the key type would be
859 * RCU can be used to prevent the keyring key lists from disappearing without
860 * the need to take lots of locks.
862 * Returns a pointer to the found key and increments the key usage count if
863 * successful; -EAGAIN if no matching keys were found, or if expired or revoked
864 * keys were found; -ENOKEY if only negative keys were found; -ENOTDIR if the
865 * specified keyring wasn't a keyring.
867 * In the case of a successful return, the possession attribute from
868 * @keyring_ref is propagated to the returned key reference.
870 key_ref_t keyring_search_aux(key_ref_t keyring_ref,
871 struct keyring_search_context *ctx)
876 ctx->iterator = keyring_search_iterator;
877 ctx->possessed = is_key_possessed(keyring_ref);
878 ctx->result = ERR_PTR(-EAGAIN);
880 keyring = key_ref_to_ptr(keyring_ref);
883 if (keyring->type != &key_type_keyring)
884 return ERR_PTR(-ENOTDIR);
886 if (!(ctx->flags & KEYRING_SEARCH_NO_CHECK_PERM)) {
887 err = key_task_permission(keyring_ref, ctx->cred, KEY_NEED_SEARCH);
893 ctx->now = current_kernel_time();
894 if (search_nested_keyrings(keyring, ctx))
895 __key_get(key_ref_to_ptr(ctx->result));
901 * keyring_search - Search the supplied keyring tree for a matching key
902 * @keyring: The root of the keyring tree to be searched.
903 * @type: The type of keyring we want to find.
904 * @description: The name of the keyring we want to find.
906 * As keyring_search_aux() above, but using the current task's credentials and
907 * type's default matching function and preferred search method.
909 key_ref_t keyring_search(key_ref_t keyring,
910 struct key_type *type,
911 const char *description)
913 struct keyring_search_context ctx = {
914 .index_key.type = type,
915 .index_key.description = description,
916 .cred = current_cred(),
917 .match_data.cmp = key_default_cmp,
918 .match_data.raw_data = description,
919 .match_data.lookup_type = KEYRING_SEARCH_LOOKUP_DIRECT,
920 .flags = KEYRING_SEARCH_DO_STATE_CHECK,
925 if (type->match_preparse) {
926 ret = type->match_preparse(&ctx.match_data);
931 key = keyring_search_aux(keyring, &ctx);
933 if (type->match_free)
934 type->match_free(&ctx.match_data);
937 EXPORT_SYMBOL(keyring_search);
940 * Search the given keyring for a key that might be updated.
942 * The caller must guarantee that the keyring is a keyring and that the
943 * permission is granted to modify the keyring as no check is made here. The
944 * caller must also hold a lock on the keyring semaphore.
946 * Returns a pointer to the found key with usage count incremented if
947 * successful and returns NULL if not found. Revoked and invalidated keys are
950 * If successful, the possession indicator is propagated from the keyring ref
951 * to the returned key reference.
953 key_ref_t find_key_to_update(key_ref_t keyring_ref,
954 const struct keyring_index_key *index_key)
956 struct key *keyring, *key;
959 keyring = key_ref_to_ptr(keyring_ref);
961 kenter("{%d},{%s,%s}",
962 keyring->serial, index_key->type->name, index_key->description);
964 object = assoc_array_find(&keyring->keys, &keyring_assoc_array_ops,
974 key = keyring_ptr_to_key(object);
975 if (key->flags & ((1 << KEY_FLAG_INVALIDATED) |
976 (1 << KEY_FLAG_REVOKED))) {
977 kleave(" = NULL [x]");
981 kleave(" = {%d}", key->serial);
982 return make_key_ref(key, is_key_possessed(keyring_ref));
986 * Find a keyring with the specified name.
988 * Only keyrings that have nonzero refcount, are not revoked, and are owned by a
989 * user in the current user namespace are considered. If @uid_keyring is %true,
990 * the keyring additionally must have been allocated as a user or user session
991 * keyring; otherwise, it must grant Search permission directly to the caller.
993 * Returns a pointer to the keyring with the keyring's refcount having being
994 * incremented on success. -ENOKEY is returned if a key could not be found.
996 struct key *find_keyring_by_name(const char *name, bool uid_keyring)
1002 return ERR_PTR(-EINVAL);
1004 bucket = keyring_hash(name);
1006 read_lock(&keyring_name_lock);
1008 if (keyring_name_hash[bucket].next) {
1009 /* search this hash bucket for a keyring with a matching name
1010 * that's readable and that hasn't been revoked */
1011 list_for_each_entry(keyring,
1012 &keyring_name_hash[bucket],
1015 if (!kuid_has_mapping(current_user_ns(), keyring->user->uid))
1018 if (test_bit(KEY_FLAG_REVOKED, &keyring->flags))
1021 if (strcmp(keyring->description, name) != 0)
1025 if (!test_bit(KEY_FLAG_UID_KEYRING,
1029 if (key_permission(make_key_ref(keyring, 0),
1030 KEY_NEED_SEARCH) < 0)
1034 /* we've got a match but we might end up racing with
1035 * key_cleanup() if the keyring is currently 'dead'
1036 * (ie. it has a zero usage count) */
1037 if (!atomic_inc_not_zero(&keyring->usage))
1039 keyring->last_used_at = current_kernel_time().tv_sec;
1044 keyring = ERR_PTR(-ENOKEY);
1046 read_unlock(&keyring_name_lock);
1050 static int keyring_detect_cycle_iterator(const void *object,
1051 void *iterator_data)
1053 struct keyring_search_context *ctx = iterator_data;
1054 const struct key *key = keyring_ptr_to_key(object);
1056 kenter("{%d}", key->serial);
1058 /* We might get a keyring with matching index-key that is nonetheless a
1059 * different keyring. */
1060 if (key != ctx->match_data.raw_data)
1063 ctx->result = ERR_PTR(-EDEADLK);
1068 * See if a cycle will will be created by inserting acyclic tree B in acyclic
1069 * tree A at the topmost level (ie: as a direct child of A).
1071 * Since we are adding B to A at the top level, checking for cycles should just
1072 * be a matter of seeing if node A is somewhere in tree B.
1074 static int keyring_detect_cycle(struct key *A, struct key *B)
1076 struct keyring_search_context ctx = {
1077 .index_key = A->index_key,
1078 .match_data.raw_data = A,
1079 .match_data.lookup_type = KEYRING_SEARCH_LOOKUP_DIRECT,
1080 .iterator = keyring_detect_cycle_iterator,
1081 .flags = (KEYRING_SEARCH_NO_STATE_CHECK |
1082 KEYRING_SEARCH_NO_UPDATE_TIME |
1083 KEYRING_SEARCH_NO_CHECK_PERM |
1084 KEYRING_SEARCH_DETECT_TOO_DEEP),
1088 search_nested_keyrings(B, &ctx);
1090 return PTR_ERR(ctx.result) == -EAGAIN ? 0 : PTR_ERR(ctx.result);
1094 * Preallocate memory so that a key can be linked into to a keyring.
1096 int __key_link_begin(struct key *keyring,
1097 const struct keyring_index_key *index_key,
1098 struct assoc_array_edit **_edit)
1099 __acquires(&keyring->sem)
1100 __acquires(&keyring_serialise_link_sem)
1102 struct assoc_array_edit *edit;
1106 keyring->serial, index_key->type->name, index_key->description);
1108 BUG_ON(index_key->desc_len == 0);
1110 if (keyring->type != &key_type_keyring)
1113 down_write(&keyring->sem);
1116 if (test_bit(KEY_FLAG_REVOKED, &keyring->flags))
1119 /* serialise link/link calls to prevent parallel calls causing a cycle
1120 * when linking two keyring in opposite orders */
1121 if (index_key->type == &key_type_keyring)
1122 down_write(&keyring_serialise_link_sem);
1124 /* Create an edit script that will insert/replace the key in the
1127 edit = assoc_array_insert(&keyring->keys,
1128 &keyring_assoc_array_ops,
1132 ret = PTR_ERR(edit);
1136 /* If we're not replacing a link in-place then we're going to need some
1139 if (!edit->dead_leaf) {
1140 ret = key_payload_reserve(keyring,
1141 keyring->datalen + KEYQUOTA_LINK_BYTES);
1151 assoc_array_cancel_edit(edit);
1153 if (index_key->type == &key_type_keyring)
1154 up_write(&keyring_serialise_link_sem);
1156 up_write(&keyring->sem);
1157 kleave(" = %d", ret);
1162 * Check already instantiated keys aren't going to be a problem.
1164 * The caller must have called __key_link_begin(). Don't need to call this for
1165 * keys that were created since __key_link_begin() was called.
1167 int __key_link_check_live_key(struct key *keyring, struct key *key)
1169 if (key->type == &key_type_keyring)
1170 /* check that we aren't going to create a cycle by linking one
1171 * keyring to another */
1172 return keyring_detect_cycle(keyring, key);
1177 * Link a key into to a keyring.
1179 * Must be called with __key_link_begin() having being called. Discards any
1180 * already extant link to matching key if there is one, so that each keyring
1181 * holds at most one link to any given key of a particular type+description
1184 void __key_link(struct key *key, struct assoc_array_edit **_edit)
1187 assoc_array_insert_set_object(*_edit, keyring_key_to_ptr(key));
1188 assoc_array_apply_edit(*_edit);
1193 * Finish linking a key into to a keyring.
1195 * Must be called with __key_link_begin() having being called.
1197 void __key_link_end(struct key *keyring,
1198 const struct keyring_index_key *index_key,
1199 struct assoc_array_edit *edit)
1200 __releases(&keyring->sem)
1201 __releases(&keyring_serialise_link_sem)
1203 BUG_ON(index_key->type == NULL);
1204 kenter("%d,%s,", keyring->serial, index_key->type->name);
1206 if (index_key->type == &key_type_keyring)
1207 up_write(&keyring_serialise_link_sem);
1210 if (!edit->dead_leaf) {
1211 key_payload_reserve(keyring,
1212 keyring->datalen - KEYQUOTA_LINK_BYTES);
1214 assoc_array_cancel_edit(edit);
1216 up_write(&keyring->sem);
1220 * Check addition of keys to restricted keyrings.
1222 static int __key_link_check_restriction(struct key *keyring, struct key *key)
1224 if (!keyring->restrict_link)
1226 return keyring->restrict_link(keyring, key->type, &key->payload);
1230 * key_link - Link a key to a keyring
1231 * @keyring: The keyring to make the link in.
1232 * @key: The key to link to.
1234 * Make a link in a keyring to a key, such that the keyring holds a reference
1235 * on that key and the key can potentially be found by searching that keyring.
1237 * This function will write-lock the keyring's semaphore and will consume some
1238 * of the user's key data quota to hold the link.
1240 * Returns 0 if successful, -ENOTDIR if the keyring isn't a keyring,
1241 * -EKEYREVOKED if the keyring has been revoked, -ENFILE if the keyring is
1242 * full, -EDQUOT if there is insufficient key data quota remaining to add
1243 * another link or -ENOMEM if there's insufficient memory.
1245 * It is assumed that the caller has checked that it is permitted for a link to
1246 * be made (the keyring should have Write permission and the key Link
1249 int key_link(struct key *keyring, struct key *key)
1251 struct assoc_array_edit *edit;
1254 kenter("{%d,%d}", keyring->serial, atomic_read(&keyring->usage));
1259 ret = __key_link_begin(keyring, &key->index_key, &edit);
1261 kdebug("begun {%d,%d}", keyring->serial, atomic_read(&keyring->usage));
1262 ret = __key_link_check_restriction(keyring, key);
1264 ret = __key_link_check_live_key(keyring, key);
1266 __key_link(key, &edit);
1267 __key_link_end(keyring, &key->index_key, edit);
1270 kleave(" = %d {%d,%d}", ret, keyring->serial, atomic_read(&keyring->usage));
1273 EXPORT_SYMBOL(key_link);
1276 * key_unlink - Unlink the first link to a key from a keyring.
1277 * @keyring: The keyring to remove the link from.
1278 * @key: The key the link is to.
1280 * Remove a link from a keyring to a key.
1282 * This function will write-lock the keyring's semaphore.
1284 * Returns 0 if successful, -ENOTDIR if the keyring isn't a keyring, -ENOENT if
1285 * the key isn't linked to by the keyring or -ENOMEM if there's insufficient
1288 * It is assumed that the caller has checked that it is permitted for a link to
1289 * be removed (the keyring should have Write permission; no permissions are
1290 * required on the key).
1292 int key_unlink(struct key *keyring, struct key *key)
1294 struct assoc_array_edit *edit;
1300 if (keyring->type != &key_type_keyring)
1303 down_write(&keyring->sem);
1305 edit = assoc_array_delete(&keyring->keys, &keyring_assoc_array_ops,
1308 ret = PTR_ERR(edit);
1315 assoc_array_apply_edit(edit);
1316 key_payload_reserve(keyring, keyring->datalen - KEYQUOTA_LINK_BYTES);
1320 up_write(&keyring->sem);
1323 EXPORT_SYMBOL(key_unlink);
1326 * keyring_clear - Clear a keyring
1327 * @keyring: The keyring to clear.
1329 * Clear the contents of the specified keyring.
1331 * Returns 0 if successful or -ENOTDIR if the keyring isn't a keyring.
1333 int keyring_clear(struct key *keyring)
1335 struct assoc_array_edit *edit;
1338 if (keyring->type != &key_type_keyring)
1341 down_write(&keyring->sem);
1343 edit = assoc_array_clear(&keyring->keys, &keyring_assoc_array_ops);
1345 ret = PTR_ERR(edit);
1348 assoc_array_apply_edit(edit);
1349 key_payload_reserve(keyring, 0);
1353 up_write(&keyring->sem);
1356 EXPORT_SYMBOL(keyring_clear);
1359 * Dispose of the links from a revoked keyring.
1361 * This is called with the key sem write-locked.
1363 static void keyring_revoke(struct key *keyring)
1365 struct assoc_array_edit *edit;
1367 edit = assoc_array_clear(&keyring->keys, &keyring_assoc_array_ops);
1368 if (!IS_ERR(edit)) {
1370 assoc_array_apply_edit(edit);
1371 key_payload_reserve(keyring, 0);
1375 static bool keyring_gc_select_iterator(void *object, void *iterator_data)
1377 struct key *key = keyring_ptr_to_key(object);
1378 time_t *limit = iterator_data;
1380 if (key_is_dead(key, *limit))
1386 static int keyring_gc_check_iterator(const void *object, void *iterator_data)
1388 const struct key *key = keyring_ptr_to_key(object);
1389 time_t *limit = iterator_data;
1392 return key_is_dead(key, *limit);
1396 * Garbage collect pointers from a keyring.
1398 * Not called with any locks held. The keyring's key struct will not be
1399 * deallocated under us as only our caller may deallocate it.
1401 void keyring_gc(struct key *keyring, time_t limit)
1405 kenter("%x{%s}", keyring->serial, keyring->description ?: "");
1407 if (keyring->flags & ((1 << KEY_FLAG_INVALIDATED) |
1408 (1 << KEY_FLAG_REVOKED)))
1411 /* scan the keyring looking for dead keys */
1413 result = assoc_array_iterate(&keyring->keys,
1414 keyring_gc_check_iterator, &limit);
1424 down_write(&keyring->sem);
1425 assoc_array_gc(&keyring->keys, &keyring_assoc_array_ops,
1426 keyring_gc_select_iterator, &limit);
1427 up_write(&keyring->sem);