linux/security/keys/keyring.c
<<
>>
Prefs
   1/* Keyring handling
   2 *
   3 * Copyright (C) 2004-2005, 2008 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 License
   8 * as published by the Free Software Foundation; either version
   9 * 2 of the License, or (at your option) any later version.
  10 */
  11
  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 <linux/uaccess.h>
  21#include "internal.h"
  22
  23#define rcu_dereference_locked_keyring(keyring)                         \
  24        (rcu_dereference_protected(                                     \
  25                (keyring)->payload.subscriptions,                       \
  26                rwsem_is_locked((struct rw_semaphore *)&(keyring)->sem)))
  27
  28#define rcu_deref_link_locked(klist, index, keyring)                    \
  29        (rcu_dereference_protected(                                     \
  30                (klist)->keys[index],                                   \
  31                rwsem_is_locked((struct rw_semaphore *)&(keyring)->sem)))
  32
  33#define MAX_KEYRING_LINKS                                               \
  34        min_t(size_t, USHRT_MAX - 1,                                    \
  35              ((PAGE_SIZE - sizeof(struct keyring_list)) / sizeof(struct key *)))
  36
  37#define KEY_LINK_FIXQUOTA 1UL
  38
  39/*
  40 * When plumbing the depths of the key tree, this sets a hard limit
  41 * set on how deep we're willing to go.
  42 */
  43#define KEYRING_SEARCH_MAX_DEPTH 6
  44
  45/*
  46 * We keep all named keyrings in a hash to speed looking them up.
  47 */
  48#define KEYRING_NAME_HASH_SIZE  (1 << 5)
  49
  50static struct list_head keyring_name_hash[KEYRING_NAME_HASH_SIZE];
  51static DEFINE_RWLOCK(keyring_name_lock);
  52
  53static inline unsigned keyring_hash(const char *desc)
  54{
  55        unsigned bucket = 0;
  56
  57        for (; *desc; desc++)
  58                bucket += (unsigned char)*desc;
  59
  60        return bucket & (KEYRING_NAME_HASH_SIZE - 1);
  61}
  62
  63/*
  64 * The keyring key type definition.  Keyrings are simply keys of this type and
  65 * can be treated as ordinary keys in addition to having their own special
  66 * operations.
  67 */
  68static int keyring_instantiate(struct key *keyring,
  69                               const void *data, size_t datalen);
  70static int keyring_match(const struct key *keyring, const void *criterion);
  71static void keyring_revoke(struct key *keyring);
  72static void keyring_destroy(struct key *keyring);
  73static void keyring_describe(const struct key *keyring, struct seq_file *m);
  74static long keyring_read(const struct key *keyring,
  75                         char __user *buffer, size_t buflen);
  76
  77struct key_type key_type_keyring = {
  78        .name           = "keyring",
  79        .def_datalen    = sizeof(struct keyring_list),
  80        .instantiate    = keyring_instantiate,
  81        .match          = keyring_match,
  82        .revoke         = keyring_revoke,
  83        .destroy        = keyring_destroy,
  84        .describe       = keyring_describe,
  85        .read           = keyring_read,
  86};
  87EXPORT_SYMBOL(key_type_keyring);
  88
  89/*
  90 * Semaphore to serialise link/link calls to prevent two link calls in parallel
  91 * introducing a cycle.
  92 */
  93static DECLARE_RWSEM(keyring_serialise_link_sem);
  94
  95/*
  96 * Publish the name of a keyring so that it can be found by name (if it has
  97 * one).
  98 */
  99static void keyring_publish_name(struct key *keyring)
 100{
 101        int bucket;
 102
 103        if (keyring->description) {
 104                bucket = keyring_hash(keyring->description);
 105
 106                write_lock(&keyring_name_lock);
 107
 108                if (!keyring_name_hash[bucket].next)
 109                        INIT_LIST_HEAD(&keyring_name_hash[bucket]);
 110
 111                list_add_tail(&keyring->type_data.link,
 112                              &keyring_name_hash[bucket]);
 113
 114                write_unlock(&keyring_name_lock);
 115        }
 116}
 117
 118/*
 119 * Initialise a keyring.
 120 *
 121 * Returns 0 on success, -EINVAL if given any data.
 122 */
 123static int keyring_instantiate(struct key *keyring,
 124                               const void *data, size_t datalen)
 125{
 126        int ret;
 127
 128        ret = -EINVAL;
 129        if (datalen == 0) {
 130                /* make the keyring available by name if it has one */
 131                keyring_publish_name(keyring);
 132                ret = 0;
 133        }
 134
 135        return ret;
 136}
 137
 138/*
 139 * Match keyrings on their name
 140 */
 141static int keyring_match(const struct key *keyring, const void *description)
 142{
 143        return keyring->description &&
 144                strcmp(keyring->description, description) == 0;
 145}
 146
 147/*
 148 * Clean up a keyring when it is destroyed.  Unpublish its name if it had one
 149 * and dispose of its data.
 150 *
 151 * The garbage collector detects the final key_put(), removes the keyring from
 152 * the serial number tree and then does RCU synchronisation before coming here,
 153 * so we shouldn't need to worry about code poking around here with the RCU
 154 * readlock held by this time.
 155 */
 156static void keyring_destroy(struct key *keyring)
 157{
 158        struct keyring_list *klist;
 159        int loop;
 160
 161        if (keyring->description) {
 162                write_lock(&keyring_name_lock);
 163
 164                if (keyring->type_data.link.next != NULL &&
 165                    !list_empty(&keyring->type_data.link))
 166                        list_del(&keyring->type_data.link);
 167
 168                write_unlock(&keyring_name_lock);
 169        }
 170
 171        klist = rcu_access_pointer(keyring->payload.subscriptions);
 172        if (klist) {
 173                for (loop = klist->nkeys - 1; loop >= 0; loop--)
 174                        key_put(rcu_access_pointer(klist->keys[loop]));
 175                kfree(klist);
 176        }
 177}
 178
 179/*
 180 * Describe a keyring for /proc.
 181 */
 182static void keyring_describe(const struct key *keyring, struct seq_file *m)
 183{
 184        struct keyring_list *klist;
 185
 186        if (keyring->description)
 187                seq_puts(m, keyring->description);
 188        else
 189                seq_puts(m, "[anon]");
 190
 191        if (key_is_instantiated(keyring)) {
 192                rcu_read_lock();
 193                klist = rcu_dereference(keyring->payload.subscriptions);
 194                if (klist)
 195                        seq_printf(m, ": %u/%u", klist->nkeys, klist->maxkeys);
 196                else
 197                        seq_puts(m, ": empty");
 198                rcu_read_unlock();
 199        }
 200}
 201
 202/*
 203 * Read a list of key IDs from the keyring's contents in binary form
 204 *
 205 * The keyring's semaphore is read-locked by the caller.
 206 */
 207static long keyring_read(const struct key *keyring,
 208                         char __user *buffer, size_t buflen)
 209{
 210        struct keyring_list *klist;
 211        struct key *key;
 212        size_t qty, tmp;
 213        int loop, ret;
 214
 215        ret = 0;
 216        klist = rcu_dereference_locked_keyring(keyring);
 217        if (klist) {
 218                /* calculate how much data we could return */
 219                qty = klist->nkeys * sizeof(key_serial_t);
 220
 221                if (buffer && buflen > 0) {
 222                        if (buflen > qty)
 223                                buflen = qty;
 224
 225                        /* copy the IDs of the subscribed keys into the
 226                         * buffer */
 227                        ret = -EFAULT;
 228
 229                        for (loop = 0; loop < klist->nkeys; loop++) {
 230                                key = rcu_deref_link_locked(klist, loop,
 231                                                            keyring);
 232
 233                                tmp = sizeof(key_serial_t);
 234                                if (tmp > buflen)
 235                                        tmp = buflen;
 236
 237                                if (copy_to_user(buffer,
 238                                                 &key->serial,
 239                                                 tmp) != 0)
 240                                        goto error;
 241
 242                                buflen -= tmp;
 243                                if (buflen == 0)
 244                                        break;
 245                                buffer += tmp;
 246                        }
 247                }
 248
 249                ret = qty;
 250        }
 251
 252error:
 253        return ret;
 254}
 255
 256/*
 257 * Allocate a keyring and link into the destination keyring.
 258 */
 259struct key *keyring_alloc(const char *description, uid_t uid, gid_t gid,
 260                          const struct cred *cred, unsigned long flags,
 261                          struct key *dest)
 262{
 263        struct key *keyring;
 264        int ret;
 265
 266        keyring = key_alloc(&key_type_keyring, description,
 267                            uid, gid, cred,
 268                            (KEY_POS_ALL & ~KEY_POS_SETATTR) | KEY_USR_ALL,
 269                            flags);
 270
 271        if (!IS_ERR(keyring)) {
 272                ret = key_instantiate_and_link(keyring, NULL, 0, dest, NULL);
 273                if (ret < 0) {
 274                        key_put(keyring);
 275                        keyring = ERR_PTR(ret);
 276                }
 277        }
 278
 279        return keyring;
 280}
 281
 282/**
 283 * keyring_search_aux - Search a keyring tree for a key matching some criteria
 284 * @keyring_ref: A pointer to the keyring with possession indicator.
 285 * @cred: The credentials to use for permissions checks.
 286 * @type: The type of key to search for.
 287 * @description: Parameter for @match.
 288 * @match: Function to rule on whether or not a key is the one required.
 289 * @no_state_check: Don't check if a matching key is bad
 290 *
 291 * Search the supplied keyring tree for a key that matches the criteria given.
 292 * The root keyring and any linked keyrings must grant Search permission to the
 293 * caller to be searchable and keys can only be found if they too grant Search
 294 * to the caller. The possession flag on the root keyring pointer controls use
 295 * of the possessor bits in permissions checking of the entire tree.  In
 296 * addition, the LSM gets to forbid keyring searches and key matches.
 297 *
 298 * The search is performed as a breadth-then-depth search up to the prescribed
 299 * limit (KEYRING_SEARCH_MAX_DEPTH).
 300 *
 301 * Keys are matched to the type provided and are then filtered by the match
 302 * function, which is given the description to use in any way it sees fit.  The
 303 * match function may use any attributes of a key that it wishes to to
 304 * determine the match.  Normally the match function from the key type would be
 305 * used.
 306 *
 307 * RCU is used to prevent the keyring key lists from disappearing without the
 308 * need to take lots of locks.
 309 *
 310 * Returns a pointer to the found key and increments the key usage count if
 311 * successful; -EAGAIN if no matching keys were found, or if expired or revoked
 312 * keys were found; -ENOKEY if only negative keys were found; -ENOTDIR if the
 313 * specified keyring wasn't a keyring.
 314 *
 315 * In the case of a successful return, the possession attribute from
 316 * @keyring_ref is propagated to the returned key reference.
 317 */
 318key_ref_t keyring_search_aux(key_ref_t keyring_ref,
 319                             const struct cred *cred,
 320                             struct key_type *type,
 321                             const void *description,
 322                             key_match_func_t match,
 323                             bool no_state_check)
 324{
 325        struct {
 326                /* Need a separate keylist pointer for RCU purposes */
 327                struct key *keyring;
 328                struct keyring_list *keylist;
 329                int kix;
 330        } stack[KEYRING_SEARCH_MAX_DEPTH];
 331
 332        struct keyring_list *keylist;
 333        struct timespec now;
 334        unsigned long possessed, kflags;
 335        struct key *keyring, *key;
 336        key_ref_t key_ref;
 337        long err;
 338        int sp, nkeys, kix;
 339
 340        keyring = key_ref_to_ptr(keyring_ref);
 341        possessed = is_key_possessed(keyring_ref);
 342        key_check(keyring);
 343
 344        /* top keyring must have search permission to begin the search */
 345        err = key_task_permission(keyring_ref, cred, KEY_SEARCH);
 346        if (err < 0) {
 347                key_ref = ERR_PTR(err);
 348                goto error;
 349        }
 350
 351        key_ref = ERR_PTR(-ENOTDIR);
 352        if (keyring->type != &key_type_keyring)
 353                goto error;
 354
 355        rcu_read_lock();
 356
 357        now = current_kernel_time();
 358        err = -EAGAIN;
 359        sp = 0;
 360
 361        /* firstly we should check to see if this top-level keyring is what we
 362         * are looking for */
 363        key_ref = ERR_PTR(-EAGAIN);
 364        kflags = keyring->flags;
 365        if (keyring->type == type && match(keyring, description)) {
 366                key = keyring;
 367                if (no_state_check)
 368                        goto found;
 369
 370                /* check it isn't negative and hasn't expired or been
 371                 * revoked */
 372                if (kflags & (1 << KEY_FLAG_REVOKED))
 373                        goto error_2;
 374                if (key->expiry && now.tv_sec >= key->expiry)
 375                        goto error_2;
 376                key_ref = ERR_PTR(key->type_data.reject_error);
 377                if (kflags & (1 << KEY_FLAG_NEGATIVE))
 378                        goto error_2;
 379                goto found;
 380        }
 381
 382        /* otherwise, the top keyring must not be revoked, expired, or
 383         * negatively instantiated if we are to search it */
 384        key_ref = ERR_PTR(-EAGAIN);
 385        if (kflags & ((1 << KEY_FLAG_INVALIDATED) |
 386                      (1 << KEY_FLAG_REVOKED) |
 387                      (1 << KEY_FLAG_NEGATIVE)) ||
 388            (keyring->expiry && now.tv_sec >= keyring->expiry))
 389                goto error_2;
 390
 391        /* start processing a new keyring */
 392descend:
 393        kflags = keyring->flags;
 394        if (kflags & ((1 << KEY_FLAG_INVALIDATED) |
 395                      (1 << KEY_FLAG_REVOKED)))
 396                goto not_this_keyring;
 397
 398        keylist = rcu_dereference(keyring->payload.subscriptions);
 399        if (!keylist)
 400                goto not_this_keyring;
 401
 402        /* iterate through the keys in this keyring first */
 403        nkeys = keylist->nkeys;
 404        smp_rmb();
 405        for (kix = 0; kix < nkeys; kix++) {
 406                key = rcu_dereference(keylist->keys[kix]);
 407                kflags = key->flags;
 408
 409                /* ignore keys not of this type */
 410                if (key->type != type)
 411                        continue;
 412
 413                /* skip invalidated, revoked and expired keys */
 414                if (!no_state_check) {
 415                        if (kflags & ((1 << KEY_FLAG_INVALIDATED) |
 416                                      (1 << KEY_FLAG_REVOKED)))
 417                                continue;
 418
 419                        if (key->expiry && now.tv_sec >= key->expiry)
 420                                continue;
 421                }
 422
 423                /* keys that don't match */
 424                if (!match(key, description))
 425                        continue;
 426
 427                /* key must have search permissions */
 428                if (key_task_permission(make_key_ref(key, possessed),
 429                                        cred, KEY_SEARCH) < 0)
 430                        continue;
 431
 432                if (no_state_check)
 433                        goto found;
 434
 435                /* we set a different error code if we pass a negative key */
 436                if (kflags & (1 << KEY_FLAG_NEGATIVE)) {
 437                        err = key->type_data.reject_error;
 438                        continue;
 439                }
 440
 441                goto found;
 442        }
 443
 444        /* search through the keyrings nested in this one */
 445        kix = 0;
 446ascend:
 447        nkeys = keylist->nkeys;
 448        smp_rmb();
 449        for (; kix < nkeys; kix++) {
 450                key = rcu_dereference(keylist->keys[kix]);
 451                if (key->type != &key_type_keyring)
 452                        continue;
 453
 454                /* recursively search nested keyrings
 455                 * - only search keyrings for which we have search permission
 456                 */
 457                if (sp >= KEYRING_SEARCH_MAX_DEPTH)
 458                        continue;
 459
 460                if (key_task_permission(make_key_ref(key, possessed),
 461                                        cred, KEY_SEARCH) < 0)
 462                        continue;
 463
 464                /* stack the current position */
 465                stack[sp].keyring = keyring;
 466                stack[sp].keylist = keylist;
 467                stack[sp].kix = kix;
 468                sp++;
 469
 470                /* begin again with the new keyring */
 471                keyring = key;
 472                goto descend;
 473        }
 474
 475        /* the keyring we're looking at was disqualified or didn't contain a
 476         * matching key */
 477not_this_keyring:
 478        if (sp > 0) {
 479                /* resume the processing of a keyring higher up in the tree */
 480                sp--;
 481                keyring = stack[sp].keyring;
 482                keylist = stack[sp].keylist;
 483                kix = stack[sp].kix + 1;
 484                goto ascend;
 485        }
 486
 487        key_ref = ERR_PTR(err);
 488        goto error_2;
 489
 490        /* we found a viable match */
 491found:
 492        atomic_inc(&key->usage);
 493        key->last_used_at = now.tv_sec;
 494        keyring->last_used_at = now.tv_sec;
 495        while (sp > 0)
 496                stack[--sp].keyring->last_used_at = now.tv_sec;
 497        key_check(key);
 498        key_ref = make_key_ref(key, possessed);
 499error_2:
 500        rcu_read_unlock();
 501error:
 502        return key_ref;
 503}
 504
 505/**
 506 * keyring_search - Search the supplied keyring tree for a matching key
 507 * @keyring: The root of the keyring tree to be searched.
 508 * @type: The type of keyring we want to find.
 509 * @description: The name of the keyring we want to find.
 510 *
 511 * As keyring_search_aux() above, but using the current task's credentials and
 512 * type's default matching function.
 513 */
 514key_ref_t keyring_search(key_ref_t keyring,
 515                         struct key_type *type,
 516                         const char *description)
 517{
 518        if (!type->match)
 519                return ERR_PTR(-ENOKEY);
 520
 521        return keyring_search_aux(keyring, current->cred,
 522                                  type, description, type->match, false);
 523}
 524EXPORT_SYMBOL(keyring_search);
 525
 526/*
 527 * Search the given keyring only (no recursion).
 528 *
 529 * The caller must guarantee that the keyring is a keyring and that the
 530 * permission is granted to search the keyring as no check is made here.
 531 *
 532 * RCU is used to make it unnecessary to lock the keyring key list here.
 533 *
 534 * Returns a pointer to the found key with usage count incremented if
 535 * successful and returns -ENOKEY if not found.  Revoked keys and keys not
 536 * providing the requested permission are skipped over.
 537 *
 538 * If successful, the possession indicator is propagated from the keyring ref
 539 * to the returned key reference.
 540 */
 541key_ref_t __keyring_search_one(key_ref_t keyring_ref,
 542                               const struct key_type *ktype,
 543                               const char *description,
 544                               key_perm_t perm)
 545{
 546        struct keyring_list *klist;
 547        unsigned long possessed;
 548        struct key *keyring, *key;
 549        int nkeys, loop;
 550
 551        keyring = key_ref_to_ptr(keyring_ref);
 552        possessed = is_key_possessed(keyring_ref);
 553
 554        rcu_read_lock();
 555
 556        klist = rcu_dereference(keyring->payload.subscriptions);
 557        if (klist) {
 558                nkeys = klist->nkeys;
 559                smp_rmb();
 560                for (loop = 0; loop < nkeys ; loop++) {
 561                        key = rcu_dereference(klist->keys[loop]);
 562                        if (key->type == ktype &&
 563                            (!key->type->match ||
 564                             key->type->match(key, description)) &&
 565                            key_permission(make_key_ref(key, possessed),
 566                                           perm) == 0 &&
 567                            !(key->flags & ((1 << KEY_FLAG_INVALIDATED) |
 568                                            (1 << KEY_FLAG_REVOKED)))
 569                            )
 570                                goto found;
 571                }
 572        }
 573
 574        rcu_read_unlock();
 575        return ERR_PTR(-ENOKEY);
 576
 577found:
 578        atomic_inc(&key->usage);
 579        keyring->last_used_at = key->last_used_at =
 580                current_kernel_time().tv_sec;
 581        rcu_read_unlock();
 582        return make_key_ref(key, possessed);
 583}
 584
 585/*
 586 * Find a keyring with the specified name.
 587 *
 588 * All named keyrings in the current user namespace are searched, provided they
 589 * grant Search permission directly to the caller (unless this check is
 590 * skipped).  Keyrings whose usage points have reached zero or who have been
 591 * revoked are skipped.
 592 *
 593 * Returns a pointer to the keyring with the keyring's refcount having being
 594 * incremented on success.  -ENOKEY is returned if a key could not be found.
 595 */
 596struct key *find_keyring_by_name(const char *name, bool skip_perm_check)
 597{
 598        struct key *keyring;
 599        int bucket;
 600
 601        if (!name)
 602                return ERR_PTR(-EINVAL);
 603
 604        bucket = keyring_hash(name);
 605
 606        read_lock(&keyring_name_lock);
 607
 608        if (keyring_name_hash[bucket].next) {
 609                /* search this hash bucket for a keyring with a matching name
 610                 * that's readable and that hasn't been revoked */
 611                list_for_each_entry(keyring,
 612                                    &keyring_name_hash[bucket],
 613                                    type_data.link
 614                                    ) {
 615                        if (keyring->user->user_ns != current_user_ns())
 616                                continue;
 617
 618                        if (test_bit(KEY_FLAG_REVOKED, &keyring->flags))
 619                                continue;
 620
 621                        if (strcmp(keyring->description, name) != 0)
 622                                continue;
 623
 624                        if (!skip_perm_check &&
 625                            key_permission(make_key_ref(keyring, 0),
 626                                           KEY_SEARCH) < 0)
 627                                continue;
 628
 629                        /* we've got a match but we might end up racing with
 630                         * key_cleanup() if the keyring is currently 'dead'
 631                         * (ie. it has a zero usage count) */
 632                        if (!atomic_inc_not_zero(&keyring->usage))
 633                                continue;
 634                        keyring->last_used_at = current_kernel_time().tv_sec;
 635                        goto out;
 636                }
 637        }
 638
 639        keyring = ERR_PTR(-ENOKEY);
 640out:
 641        read_unlock(&keyring_name_lock);
 642        return keyring;
 643}
 644
 645/*
 646 * See if a cycle will will be created by inserting acyclic tree B in acyclic
 647 * tree A at the topmost level (ie: as a direct child of A).
 648 *
 649 * Since we are adding B to A at the top level, checking for cycles should just
 650 * be a matter of seeing if node A is somewhere in tree B.
 651 */
 652static int keyring_detect_cycle(struct key *A, struct key *B)
 653{
 654        struct {
 655                struct keyring_list *keylist;
 656                int kix;
 657        } stack[KEYRING_SEARCH_MAX_DEPTH];
 658
 659        struct keyring_list *keylist;
 660        struct key *subtree, *key;
 661        int sp, nkeys, kix, ret;
 662
 663        rcu_read_lock();
 664
 665        ret = -EDEADLK;
 666        if (A == B)
 667                goto cycle_detected;
 668
 669        subtree = B;
 670        sp = 0;
 671
 672        /* start processing a new keyring */
 673descend:
 674        if (test_bit(KEY_FLAG_REVOKED, &subtree->flags))
 675                goto not_this_keyring;
 676
 677        keylist = rcu_dereference(subtree->payload.subscriptions);
 678        if (!keylist)
 679                goto not_this_keyring;
 680        kix = 0;
 681
 682ascend:
 683        /* iterate through the remaining keys in this keyring */
 684        nkeys = keylist->nkeys;
 685        smp_rmb();
 686        for (; kix < nkeys; kix++) {
 687                key = rcu_dereference(keylist->keys[kix]);
 688
 689                if (key == A)
 690                        goto cycle_detected;
 691
 692                /* recursively check nested keyrings */
 693                if (key->type == &key_type_keyring) {
 694                        if (sp >= KEYRING_SEARCH_MAX_DEPTH)
 695                                goto too_deep;
 696
 697                        /* stack the current position */
 698                        stack[sp].keylist = keylist;
 699                        stack[sp].kix = kix;
 700                        sp++;
 701
 702                        /* begin again with the new keyring */
 703                        subtree = key;
 704                        goto descend;
 705                }
 706        }
 707
 708        /* the keyring we're looking at was disqualified or didn't contain a
 709         * matching key */
 710not_this_keyring:
 711        if (sp > 0) {
 712                /* resume the checking of a keyring higher up in the tree */
 713                sp--;
 714                keylist = stack[sp].keylist;
 715                kix = stack[sp].kix + 1;
 716                goto ascend;
 717        }
 718
 719        ret = 0; /* no cycles detected */
 720
 721error:
 722        rcu_read_unlock();
 723        return ret;
 724
 725too_deep:
 726        ret = -ELOOP;
 727        goto error;
 728
 729cycle_detected:
 730        ret = -EDEADLK;
 731        goto error;
 732}
 733
 734/*
 735 * Dispose of a keyring list after the RCU grace period, freeing the unlinked
 736 * key
 737 */
 738static void keyring_unlink_rcu_disposal(struct rcu_head *rcu)
 739{
 740        struct keyring_list *klist =
 741                container_of(rcu, struct keyring_list, rcu);
 742
 743        if (klist->delkey != USHRT_MAX)
 744                key_put(rcu_access_pointer(klist->keys[klist->delkey]));
 745        kfree(klist);
 746}
 747
 748/*
 749 * Preallocate memory so that a key can be linked into to a keyring.
 750 */
 751int __key_link_begin(struct key *keyring, const struct key_type *type,
 752                     const char *description, unsigned long *_prealloc)
 753        __acquires(&keyring->sem)
 754        __acquires(&keyring_serialise_link_sem)
 755{
 756        struct keyring_list *klist, *nklist;
 757        unsigned long prealloc;
 758        unsigned max;
 759        time_t lowest_lru;
size_t size;
 761        int loop, lru, ret;
 762
 763        kenter("%d,%s,%s,", key_serial(keyring), type->name, description);
 764
 765        if (keyring->type != &key_type_keyring)
 766                return -ENOTDIR;
 767
 768        down_write(&keyring->sem);
 769
 770        ret = -EKEYREVOKED;
 771        if (test_bit(KEY_FLAG_REVOKED, &keyring->flags))
 772                goto error_krsem;
 773
 774        /* serialise link/link calls to prevent parallel calls causing a cycle
 775         * when linking two keyring in opposite orders */
 776        if (type == &key_type_keyring)
 777                down_write(&keyring_serialise_link_sem);
 778
 779        klist = rcu_dereference_locked_keyring(keyring);
 780
 781        /* see if there's a matching key we can displace */
 782        lru = -1;
 783        if (klist && klist->nkeys > 0) {
 784                lowest_lru = TIME_T_MAX;
 785                for (loop = klist->nkeys - 1; loop >= 0; loop--) {
 786                        struct key *key = rcu_deref_link_locked(klist, loop,
 787                                                                keyring);
 788                        if (key->type == type &&
 789                            strcmp(key->description, description) == 0) {
 790                                /* Found a match - we'll replace the link with
 791                                 * one to the new key.  We record the slot
 792                                 * position.
 793                                 */
 794                                klist->delkey = loop;
 795                                prealloc = 0;
 796                                goto done;
 797                        }
 798                        if (key->last_used_at < lowest_lru) {
 799                                lowest_lru = key->last_used_at;
 800                                lru = loop;
 801                        }
 802                }
 803        }
 804
 805        /* If the keyring is full then do an LRU discard */
 806        if (klist &&
 807            klist->nkeys == klist->maxkeys &&
 808            klist->maxkeys >= MAX_KEYRING_LINKS) {
 809                kdebug("LRU discard %d\n", lru);
 810                klist->delkey = lru;
 811                prealloc = 0;
 812                goto done;
 813        }
 814
 815        /* check that we aren't going to overrun the user's quota */
 816        ret = key_payload_reserve(keyring,
 817                                  keyring->datalen + KEYQUOTA_LINK_BYTES);
 818        if (ret < 0)
 819                goto error_sem;
 820
 821        if (klist && klist->nkeys < klist->maxkeys) {
 822                /* there's sufficient slack space to append directly */
 823                klist->delkey = klist->nkeys;
 824                prealloc = KEY_LINK_FIXQUOTA;
 825        } else {
 826                /* grow the key list */
 827                max = 4;
 828                if (klist) {
 829                        max += klist->maxkeys;
 830                        if (max > MAX_KEYRING_LINKS)
 831                                max = MAX_KEYRING_LINKS;
 832                        BUG_ON(max <= klist->maxkeys);
 833                }
 834
 835                size = sizeof(*klist) + sizeof(struct key *) * max;
 836
 837                ret = -ENOMEM;
 838                nklist = kmalloc(size, GFP_KERNEL);
 839                if (!nklist)
 840                        goto error_quota;
 841
 842                nklist->maxkeys = max;
 843                if (klist) {
 844                        memcpy(nklist->keys, klist->keys,
 845                               sizeof(struct key *) * klist->nkeys);
 846                        nklist->delkey = klist->nkeys;
 847                        nklist->nkeys = klist->nkeys + 1;
 848                        klist->delkey = USHRT_MAX;
 849                } else {
 850                        nklist->nkeys = 1;
 851                        nklist->delkey = 0;
 852                }
 853
 854                /* add the key into the new space */
 855                RCU_INIT_POINTER(nklist->keys[nklist->delkey], NULL);
 856                prealloc = (unsigned long)nklist | KEY_LINK_FIXQUOTA;
 857        }
 858
 859done:
_prealloc = prealloc;
 861        kleave(" = 0");
 862        return 0;
 863
 864error_quota:
 865        /* undo the quota changes */
 866        key_payload_reserve(keyring,
 867                            keyring->datalen - KEYQUOTA_LINK_BYTES);
 868error_sem:
 869        if (type == &key_type_keyring)
 870                up_write(&keyring_serialise_link_sem);
 871error_krsem:
 872        up_write(&keyring->sem);
 873        kleave(" = %d", ret);
 874        return ret;
 875}
 876
 877/*
 878 * Check already instantiated keys aren't going to be a problem.
 879 *
 880 * The caller must have called __key_link_begin(). Don't need to call this for
 881 * keys that were created since __key_link_begin() was called.
 882 */
 883int __key_link_check_live_key(struct key *keyring, struct key *key)
 884{
 885        if (key->type == &key_type_keyring)
 886                /* check that we aren't going to create a cycle by linking one
 887                 * keyring to another */
 888                return keyring_detect_cycle(keyring, key);
 889        return 0;
 890}
 891
 892/*
 893 * Link a key into to a keyring.
 894 *
 895 * Must be called with __key_link_begin() having being called.  Discards any
 896 * already extant link to matching key if there is one, so that each keyring
 897 * holds at most one link ts a wty/keys/keyring.c#L896" id="L896" class="line" n5id="2a> 897 793 888            9         9         keyring_unlink_rcu
f="+code=keyring" class="sref">keyring, struct key *key)
 867            9         9 }
)
 753         885        if (9href="sec9rity/keys/keyring.c#L8049 id="9804" class="lit *klist, *nklist;
 757        unsi9urity/key9/keyring.c#L805" id="L809" cla9044" class="lit *lruTES" class="sreff">lru="line" name="L757"> 757        unsi9u5ity/key9/ Must be called with __9is fu9l thene" name="L757"> 757        unsi9u6ity/key9/ already extant link to9list<90">key_payload_reserve(kmalloc(klist, *prealloc;
 889        retu9a href="+9ode=klist" class="sref">9list<9a>->prealloc;
 890}
9list<90="line" name="L859"> 859k9ebug((sem);
keyring<, keyring<,  890}
kl91="line" name="L821"> 821        if (9   " = _locked_keyring" class="sref">rcu_dereference_locked_keyring(keyring);
 780
 763        " atomic_inss="sref">preallatomic_insgt;keyrinsagas="line" name="L780"> 780
(&sem);
lowest_lru)e=last_used_at" class="sref">last_used_at;
 780
/* check that we 9ren["sref">RCU_INIT_POINTER(">kt>);rnel_u">kt>);rnel_u 757        unsi9ef="+code9ret" class="sref">ret 877 896re9 91s aren't going to be a ps/keyring.g. 888            9   goto <9 href="+code=error_sem" 9lass=91== & 850            9urity/key9/keyring.c#L821" id="L829" cla92t->, );
);
);
( 850            9u  9list<92ref">nklist->NULL);
 833            9   /* there&939;s 92="line" name="L763"> 763        kl9st->nklist->keys[nklist->delkey], NULL);
 889        retu9    835            9e {
RCU_INIT_POINTER( 890}
/* grow t9e key92="line" name="L877"> 877 888            9   if ( 888            9         9 max +=  844            9         9 if (max > ,  850            9         9         max = NULL);
nkeys + 1;
nkeys + 1;
 833            9         9 BUG_ON(nkeys + 1;
keyring="sr_unef="slass="L7oss=s="line" name="L833"> 833            9    834
(&ass="li"security/keys/keyring.c#L844" id="L844" class="href="security/keys/keyring.c#L852" id="L852" class=f="+code=maxkeys" class="sref">maxkeys) {
 844            9  {
siz9 = sizeof(*, );
);
);
( 850            9   nklist->NULL);
nkeys + 1;
nkeys + 1;
 833            9    833            9   if (n9list = lruTES" class="sreff">lru="lif">rcu_dereference_locked_keyring,ist" class="sref">klist,isspan>e" name="L833"> 833            9         9 href="+code=nklist" cla9s="sr9f">nklist)
nklist->NULL);
 850            9         9 goto error_quotawsem_isde=klisgt;sem);
 833            9urity/key9/keyring.c#L842" id="L849" cla94realloc = 0;
nklist->NULL);
 889        retu9   n9list-> 888            9   if (
 888            9         9 memcpy(klist,_pusref="security/keys/kef">lruTES" class="sreff">lru="liine" name="L889"> 889        retu9  {
 826            9         9 nklist->
 823            9         9 nklist-><="+code=klist" sU discard %d\n", );
);
);
( 850            9         9 klist->NULL);
nkeys + 1;
nkeys + 1;
 833            9   } else9{
 833            9         9 nklist->nklist->nklist->NULL);
 889        retu9         9 nklist-> 889        retu9   nkeys + 1;
 889        retu9   if ( 814
/* add th9 key 9nto thne" name="L814"> 814
 757        unsi9    893 894 894done:

 894 823            9ef="+code9kleave" class="sref">kle9vekeyring_unlink_rcu
keyring, struct key *key_keyring" class="srekey_keyrct key_the" name="L850"> 850            9n 0;
BUG_ON( 753        " __releaseg.c#L848" id="L8__releaseggt;sem);
 753        error_9uota<96res(& 753        /* undo the quota9chang9s */ 826            9ef="+code9key_payload_reserve" cla9s="sr9f">key_payload_reserve(max <= key_type_e=klist" class=.c#L856" id="L856" class="line" name="L856"> 856            9         9     key_reserve(max <= key_tef="security/keys/keya/aing.c#L800" id=ya/aey_type_e=klist" class=.c#L856" id="L856" class="line" name="L856"> 856            9 rity/key9m" class="sref">error_se9:968s="sref">key_reserve(, (sem);
keyring<, key_tef="security/keys/keya/aing.c#L800" id=ya/aey_tty/keys/keyring.creyring.c#L8a1" id="L861" class="linne" name="L856"> 856            9   } else9ode=type" class="sref">t9pe 833            9   (&ef="+code=key_type_keyring" class="sref">key_type_keyring)
 870            9e=error_k9sem" class="sref">error_9rsem<97ref">nklist->keyring_serialise_link_sem);
 871u9_writ97="line" name="L763"> 763        kle9ve 826            9n memcpy( 826            9n {
keykeyring,
 867            9urity/key9/keyring.c#L877" id="L879" cla97ref">nklist->keysem);
KEYQUOTA_Le" name="L867"> 867            9u        9*
keyring->key 8689* Check already instanti9ted k97ist = frenef="scode=keyring" class="sref"st" class="sref">klist, *;
 868nklist)ne" name="L814"> 814
9* The caller must have c9lled 98p_write(&/keys/keyring.cing_serialise_link_sem" class="sref">keyring_serialise_link_semef">sem);
 8689* keys that were created9since9__key_ne" name="L814"> 814

 763         894 894ke9-98_begin() having being called. @span cl:ped tspan cl>
 793/* check 9hat w98g key if there is one, so that@spa:ped tspa>
ass="line" name="L793"> 793
 89496" clas r/aeyringss="line" name="L894"> 894ans/keyring." idpotef="sllycardfouns/by seareyring97" ispa" class="line" name="L894"> 894 8949/keyring.c#L892" id="L899" cla99_key_link_begin() was called.ans/willlconsume somgss="line" name="L894"> 8949*
K66" id=id=6" ce#L86ef="ass="line" name="L894"> 894
 894
 894 894K66" id=remain clLid="ddss="line" name="L894"> 894 8949 if ( 894 894shou ceforf=="line"/1" >" name="L894"> 894 894
 883int 10 ef">__key_link_check_livk href=""+code=key" clak"sref">f="+code=keyring" class="sref">keyring, struct key *key)
 826            10 4       10 
 885        if (10 5       10  Must be called with __10  M>10 code=key" claloc)
 868nklist 875}
 833            10 8       10 if (10 8s="sref">key_reserve( 86810 bug( 889        retu101        10="+code=klist" class="sr10="+>10=" = -e" name="L833"> 833            1011       10="+code=prealloc" class=10="+>10=" L875" id="L875" class="lif">rcu_dereference
last_used_at;
key_th=last_used_at" class="sref">last_used_at;
NULL);
keyring_serialise_lreyring.c#L8a1" id="L861" class="linne" name="L856"> 856            10=2       10 href="+code=done" class10 hr>10=ref">BUG_ON 826            10=3       10rity/keys/keyring.c#L81410rit>10=t->rcu_dereference
key *last_used_at 856            10=4       10/keyring.c#L815" id="L8110/ke>10=ref">memcpy( 856            10=5       10mment">/* check that we 10mme>10=code=key" class="sref">keyf="+cecurity/keys/keyring.c#L867" id="L867" class="lin=last_used_at" class="sref">last_used_atkeyring_serialise_lreyring.c#L8a1" id="L861" class="linne" name="L856"> 856            10=6       10ret" class="sref">ret10=realloc = (unsigned long)last_used_at;
key_th=last_used_at" creyring.c#L8a1" id="L861" class="linne" name="L856"> 856            10=7       10            858
re10ode>10=="line" name="L859"> 85910=" id="L890" class="l_link_check_livL875" id="L875" class="line" name="L875"> 875}
 814
10ode>10/>:
f="+nne" name="L856"> 856            1022       10lass="comment">/* there&10las>10/="line" name="L763"> 763        10/*/
 89410/keyring.c#L895" id="L895" cla a hrunef=" - Unef=" keyrfirs
 89410/_begin() having being called. @span cl:ped tspan cl>
 894/* grow t10las>10/g key if there is one, so that@spa:ped tspa>
L86ef=" is2a>ass="line" name="L793"> 79310/ther */
 89410/s aren't going to be a proRemoveea6ef=" from="L894" clLid="L894ass="line" name="L793"> 79310/keyring.c#L880" id="L880" class="line" name="L880"> 88010 ikey_link_begin() was called. 793 79310 keyring.c#L893" id="L893" cla Rass="s 0ref=successful, -ENOTDIRity/keytspan cl>isf="secur"L894" cl, -ENOENsityss="line" name="L793"> 793or -ENOMEMity/keys/a href=in"security/ss="line" name="L793"> 793 89410 _begin() having being called.ss="line" name="L894"> 894 89410 y/keys/keyring.c#L896" id="L89bearemoved (keytspan cl>shou cefor 89410 s aren't going to be a prorequired on897ytspa)ass="line" name="L894"> 89410 keyring.c#L880" id="L880" claass="line" name="L888"> 888            104        10 goto __key_link_check_livk hrunef=""+code=key" clak"srunef="f="+code=keyring" class="sref">keyring, struct key *key)
 826            1041       10/keyring.c#L842" id="L8410/ke>10 1="line" name="L885"> 885        if (1042       10="+code=nklist" class="s10="+>10 ref">BUG_ON *klist, *nklist;
 757        unsi10 3       10href="+code=klist" class10hre>10  875}
10 ="line" name="L835"> 835            10 5       10        sizeof(struct 10 code=key" cla_reserve( 86810 ">key_payload_reserve(last_used_at 856            1047       10 10 > = -e" name="L833"> 833            1048       10 10 8s="sref">key_reserve(- href="securityENOTDIR856" id="L856" ENOTDIR="line" name="L875"> 875}
10 == &key_ty!e_keyring)
 870            105        10 10  = (unsigngo1" ng)
 875}
10 ="line" name="L892"> 892key_reserve(keyring_serialise_link_semef">sem);
 868 892/* add th10las>10 res(&rcu_dereference_locked_keyring(keyring);
 780
10 t; 844            10 6       10="+code=prealloc" class=10="+>10 ref">nklist->for8keyring.aass="line" name="L888"> 888            1057       10rity/keys/keyring.c#L85810rit>10 g" class="sref">keyrifor8=type" class="srloopL757" id="L757"loopey_tef=iny_link_check_livloopL757" id="L757"loopey_t=f="+code=maxkeys" class="sref">maxkeys) {
 870            1058       10/keyring.c#L859" id="L8510/ke>10 ef">klist->nklist-> 826            1059       10ass="sref">done:
10 ">nklist)
)
 875}
10=_8" class="line" name="L858"> 858
kle10kle>10=="line" name="L892"> 892key_reserve(keyring_serialise_link_semef">sem);
 868" L875" id="L875" class="lif">- href="securityENOENT856" id="L856" ENOENT="line" name="L875"> 875}
error_10ota>10=res(&go1" ng)
 875}
/* undo the quota10mme>10= thene" name="L757"> 757        unsi10=6       10key_payload_reserve" cla10key>10=6:
 757        unsi10=7       10      888            1068       10m" class="sref">error_se10m" >10=8s="sref">key_reserve(kmalloc( 888            1069       10ode=type" class="sref">t10ode>10=">nklist)
key)
nkeys + 1;
 867            107        10="+code=up_write" class=10="+>10=">nklist)
 868error_10sem>10=(kmalloc( 826            1072       10up_write" class="sref">u10up_>10=ref">BUG_ON()
 875}
kle10kle>10=" ing.c#L840" id="L840" class="lief="security/keys/keeyring.c#L833" id="L833" class="l"+c href="security ="sref">nkeys + 1;
 875}
10=res(&nkeys + 1;
 875}
 757        unsi1076       10/keyring.c#L877" id="L8710/ke>10=6span class="ef="_link_check_livloopL757" id="L757"loopey_t=f="s 0ne" name="L856"> 856            1077       10*
nklist-><="+code=klist" mL8cpy)
keyring_serialise_lss="sref">keys[nklist-> 850            10=8       10* Check already instanti10* C>10=ef">klist->nkeys + 1;
nklist-> 850            10=9       10*
nklist)
key)
 868 757        unsi1081       10* keys that were created10* k>10* 856            1082       10*/
keyring_serialise_lss="sref">keys[nklist-> 850            1083       10y_link_check_live_key" c10y_l>10*t->nkeys + 1;
nklist-> 850            1084       10s/keyring.c#L885" id="L810s/k>10*ref">memcpy(keys[key)
 868ke10ode>10* thene" name="L757"> 757        unsi1086       10lass="comment">/* check 10las>10*">key_payload_o append directly */ 888            1087       10                * keyrin10   >10*ss="sref">key_reserve(keyring,
 867            10*8       10klist->sem);
KEYQUOTA_Laty/keys/keyrg.c 86810*.c#L8e" name="L833"> 833            109        10s/keyring.c#L891" id="L810s/k>10s/span class="string">" Lassuriign_poi7;d,%s,%s,&lassuriign_poi7;d,ref="security/keys/keyring.c#L780" id="L780" class="lf="+code=NULL" classring 890}
 892
key_reserve(keyring_serialise_link_semef">sem);
 868 892
 888            1095       10* Must be called with __10* M>10scode=key" cla_reserve( 868key_payload_reserve(nkeys + 1;
keyring="sr_unef="slass="L7oss=s="line" name="L833"> 833            10s7       10* holds at most one link10* h>10s> = -e" name="L833"> 833            1098       10 if (10s8s="sref">key_reserve(0ne" name="L833"> 833            10s9       10          833            11         11          757        unsi11 1       11 keyring.c#L892" id="L8911 ke>110 875}
11 /keyrig)
 757        unsi11 3       11  Link a key into to a k11  L>110" L875" id="L875" class="lif">- href="securityENOMEM856" id="L856" ENOMEM="line" name="L875"> 875}
110res(&keyring_serialise_link_semef">sem);
 868)
 875}
ne" name="L858"> 858
 868110="line" name="L859"> 859110keyring.c#L880" id="L880" class="line" name="L893"> 893111ikey_link_begin() was called. 793111_key_link_begin() was called.ass="line" name="L793"> 793111/keyring.c#L883" id="L883" class="line" name="L883"> 883int 11=tstatic ">keyring_unlink_rcu/a>="sr_enearslass="L7oss="sref">keyring="sr_enearslass="L7oss=f="+code=key" class="sref">lasshe/ac#L780" id="L78lasshe/aurity/ecurity/keys/kelasing.c#L800" id=lasgt; 856            11=4       11/keyring.c#L815" id="L8111/ke>111s="line" name="L885"> 885        if (11=5       11mment">/* check that we 11mme>11=code=key" clat *klist, *nklist;
 868ret111ref">nklist 868111> = -e" name="L833"> 833            11=8       11ode=ret" class="sref">re11ode>1118s="sref">key_reserve(rcu_dereferencecontass=r_ofing.c#L800" id=0ontass=r_ofgt; *klist, * 868111.c#L8e" name="L833"> 833            112        11/keyring.c#L821" id="L8211/ke>112/span class="for8=type" class="srloopL757" id="L757"loopey_tef= href="security ="sref">nkeys + 1;
 856            11/1       11ode=klist" class="sref">11ode>112ref">nklist->klist,_pusref="security/keys/kLassuccess_poi7;d,%s,%s,&lassuccess_poi7;d,ref="security/keys/keng.c#L844" id="L844" class="f="+code=NULL" classef">nklist-> 868/* there&11las>11/="line" name="L763"> 763        112" kfreng" class="sref">frenef="ssecurity/keys/keng.c#L844" id="L844" class="nne" name="L868"> 868112to thne" name="L814"> 814
 757        unsi11/6       11lass="comment">/* grow t11las>11/g key if there is one, so t/*rss="line" name="L894"> 89411/ther */
 89411/s aren't going to be a pro@span cl:ped tspan cl>
 79311/keyring.c#L880" id="L880" class="line" name="L880"> 88011 ikey_link_begin() was called. 894 79311 keyring.c#L893" id="L893" cla Rass="s 0ref=successful>or -ENOTDIRity/keytspan cl>isf="secur"L894" class="line" name="L894"> 894 883int keyring="sr_enearf="+code=key" class="sref">ring.c#L852" id="Lkruct key * 856            11 5       11="+code=size" class="sre11="+>113 */ 826            1136       11/keyring.c#L837" id="L8311/ke>113ref">nklist *klist, *nklist;
 868113ss="sref">key_key_link_check_livL875" id="L875" class="line" name="L875"> 875}
113="line" name="L859"> 859113bug(- href="securityENOTDIR856" id="L856" ENOTDIR="line" name="L875"> 875}
114p_write(&ef="+code=key_type_ink_semef">sem);
key_type_keyring)
 844            1141       11/keyring.c#L842" id="L8411/ke>114ref">nklist->
L86e=kls heldysass="line" name="L883"> 883int 114" id="L853" class="li/keys/keyring.cdowng_serialise_link_sem"downg_serief="s>keyring_serialise_link_semef">sem);
 8681143"line" name="L892"> 892114ref">memcpy((rcu_dereference_locked_keyring(keyring);
 780
 844            1146       11 114ref">nklist-> 888            1147       11 114g" class="sref">keyring-&/keys/keyring.ckL8_p="+code=keyring" class="sref">keyring,
 867            1148       11 114ef">klist->keyst" class="sref">klist, * 868114.c#L8e" name="L833"> 833            115        11 11  = (unsignng-&/keys/keyring.cLassuriign_poi7;d,%s,%s,&lassuriign_poi7;d,ref="security/keys/keyring.c#L780" id="L780" class="lf="+code=NULL" classring 833            1151       11 115ref">nklist-><<<<<<<<<<<<<<<<<<<<<<<<<<<<+code=key_type_NULL856" id="L856" NULLs="line" name="L780"> 780
115" id="L853" class="line" name="L814"> 814
 892/* add th11las>115ref">memcpy((keyring_serialise_link_semef">sem);
 868115 thene" name="L757"> 757        unsi11 6       11="+code=prealloc" class=11="+>11 ref">nklist-> 883int 11 g" class="sref">keyriode=type" class="sreng.c#L844" id="L844" class="le" name="L883"> 883int klist->nkeys + 1;
keyring="sr_enearslass="L7oss=f="+ine" name="L868"> 868done:
115.c#L8e" name="L833"> 833            116        11=_prealloc" class="sref"11=_p>116 = (unsignring" class="srL875" id="L875" class="lif">0ne" name="L833"> 833            1161       11kleave" class="sref">kle11kle>116ref">nklist 814
116="line" name="L763"> 763         875}
error_11ota>116to thne" name="L814"> 814
/* undo the quota11mme>11= then href="securityEXPORT_SYMBOL856" id="L856" EXPORT_SYMBOLgt;keyring="sr_enearf="+ine" name="L868"> 86811=6:
 868116ther */
 893error_se11m" >116s aren't going to be a proD"L7oseomme
L86ef="s from="Lr/vokedL894" class="line" name="L894"> 894t11ode>116keyring.c#L880" id="L880" class="line" name="L880"> 880117ikey_link_begin() was called.
L86spa="emlass="-e=kledass="line" name="L894"> 894error_11sem>117_key_link_begin() was called.ass="line" name="L883"> 883int u11up_>11=ref">static ">keyring_unlink_rcu/a>="sr_r/voke"sref">keyring="sr_r/vokef="+code=key" class="sref">ring.c#L852" id="Lkruct key * 856            1173       11kleave" class="sref">kle11kle>11= 844            1174       11"+code=ret" class="sref"11"+c>11=res(&t *klist, *nklist;
 868 757        unsi1176       11/keyring.c#L877" id="L8711/ke>117">key_payload_reserve(rcu_dereference_locked_keyring(keyring);
 780
117> = -e" name="L833"> 833            11=8       11* Check already instanti11* C>11=ef">klist_o append directly */ 888            11=9       11*
keyring,
 780
 757        unsi1181       11* keys that were created11* k>11* 844            1182       11*/
 780
11*t->nkeys + 1;
keyring="sr_enearslass="L7oss=f="+ine" name="L868"> 868
memcpy 814
ke11ode>11* thenne" name="L814"> 814
/* check 11las>1186:
 868 893 893
L86poi7;d,s #L8 shuffaldidownass="line" name="L894"> 894 894 894
 894119/span>
 894
 888            1195       11* Must be called with __11* M>11scode=">keyring_unlink_rcu/a>="sr_g.c#L8a1" id="L86 a>="sr_g.f="+code=key" class="sref">ring.c#L852" id="Lkruct key *nkeys +time_rct nkeys +limitef="ne" name="L856"> 856            1196       11* already extant link to11* a>11s">keyne" name="L844"> 844            11s7       11* holds at most one link11* h>119g" class="sret *klist, *nklist;
nklist;
iewef="ne" name="L868"> 86811s8s="sref">keyode=key" class="sref">key)
 868119== & 868120 thene" name="L757"> 757        unsi12 1       12 keyring.c#L892" id="L8912 ke>120&6" i;{%x,%s}&6" i;ss="linhref="+code=keyring"_keyring_ 868
120="line" name="L763"> 763        120" downg_serialise_link_sem"downg_serief="s>keyring_serialise_link_semef">sem);
 868120="line" name="L835"> 835            12 5       12  Must be called with __12  M>120code=key" cla_reserve(rcu_dereference_locked_keyring(keyring);
 780
 883int 120g" class="sref">keyrigo1" ng)
 868120="line" name="L859"> 859120bug( 888            121        12="+code=klist" class="sr12="+>121/span class="string">" keepL757" id="L757"keepey_tf">0ne" name="L833"> 833            1211       12="+code=prealloc" class=12="+>121nkeys + 1;
 833            1212       12 href="+code=done" class12 hr>121" id="L853" class="lief="!_reserve(nklist;
 833            1213       12rity/keys/keyring.c#L81412rit>121t->nkeys +limitef="nne" name="L853"> 833            1214       12/keyring.c#L815" id="L8112/ke>121ref">memcpy(" keepL757" id="L757"keepey_t++ne" name="L833"> 833            1215       12mment">/* check that we 12mme>121 thene" name="L757"> 757        unsi12=6       12ret" class="sref">ret1216span class="ef="_link_check_livkeepL757" id="L757"keepey_tf"f= href="security ="sref">nkeys + 1;
 833            1217       12           keyrigo1" ng)
 868re12ode>121="line" name="L859"> 859121bug( 888            122        12/keyring.c#L821" id="L8212/ke>122/span class="string">" maxL757" id="L757"max="lif">rcu_dereference_oundupL757" id="L757"_oundupref="security/keys/keyepL757" id="L757"keepey_th=4ine" name="L780"> 780
12ode>122nklist;
iewef=""+c href="security mring.c#L8a1" id="L86 mring.f="+coizeofuode=key" class="sref">keyst" class="sref">klist, *" maxL757" id="L757"max="lif* oizeofuode=key" class="sref">key)
 833            1222       12lass="comment">/* there&12las>122" id="L853" class="lilass="last_used_at" cGFP_KERNEL856" id="L856" GFP_KERNELs="line" name="L868"> 868122(nklist;
iewef="ne" name="L853"> 833            1224       12="+code=prealloc" class=12="+>122ref">memcpy()
 875}
(nklist;
iewef="ef="security/keys/keeyring.c#L833" id="L833" class="l"+c href="securitymaxL757" id="L757"max="line" name="L868"> 868/* grow t12las>122">key_payload_reserve(nklist;
iewef="ef="security/keys/keyring.c#L851" id="L851" class"+c0ne" name="L833"> 833            12/7       12="+code=max" class="sref12="+>122ss="sref">key_reserve(nklist;
iewef="ef="security/keys/kekeyring.c#L852" id="L852" class=+c0ne" name="L833"> 833            12/8       12href="+code=klist" class12hre>122="line" name="L859"> 859122bug( 888            123        12 if (12 ikey_link_begin() was calleddddddddd*"- mDisc#ake c0reLasLexpired spas may be updated back>
 888            1231       12          888            1232       12 1232s="sref">key_reserve(0ne" name="L833"> 833            1233       12ef="security/keys/keyrin12ef=>123nkeys + 1;
 844            1234       12/keyring.c#L835" id="L8312/ke>123ref">memcpy(()
rcu_dereference_locked_k_ef="singnklist;
 833            1235       12="+code=size" class="sre12="+>123code=key" class="srefode=!_reserve()
nkeys +limitef="nnine" name="L844"> 844            1236       12/keyring.c#L837" id="L8312/ke>123ref">nklist-> 833            1237       12="+code=ret" class="sref12="+>123g" class="sref">keyring-&&&&&&&&&go1" ng)
nklist;
disc0rd_aew="line" name="L868"> 868123ef">klist->nklist;
iewef="ef="security/keys/kering.c#L851" id="L81" class"+code=delkey" ckeepL757" id="L757"keepey_t++]href="+code=keyring"_g875" id="L875" clng"_g87ref="security/keys/keey)
 868123">nklist)
 814
124p_write(&ne" name="L814"> 814
nklist;
iewef="ef="security/keys/keyring.c#L851" id="L851" class"+c href="security eepL757" id="L757"keepey_tne" name="L868"> 868124="line" name="L763"> 763        124 888            1244       12 124ref">memcpykeyring,
 867            12 5       12        sizeof(struct 124code=key" class="srefffffffffffffoizeofuode=key" class="sref">keyst" class="sref">klist, * 867            12 6       12 124ref">nklist-> 868124> = -e" name="L833"> 833            1248       12 124ef">klistef="_link_check_livkeepL757" id="L757"keepey_tf"f=0nine" name="L844"> 844            1249       12{
nklist)
 86812  = (unsignsecurity/keys/kefreng" class="sref">frenef="ssecurity/keys/kaewf">nklist;
iewef="nne" name="L868"> 868125ref">nklist 844            12 2       12ef="security/keys/keyrin12ef=>125" id="L853" class="lircu_dereference_locariign_poi7;d,%s,%s,&lassuriign_poi7;d,ref="security/keys/keyring.c#L780" id="L780" class="lf="+code=NULL" classringnklist;
iewef="nne" name="L868"> 868 814
/* add th12las>125="line" name="L835"> 835            12 5       12="+code=RCU_INIT_POINTER12="+>125code=key" cla_reserve(keyring_serialise_link_semef">sem);
 8681256:
 868key_reserve(nkeys + 1;
keyring="sr_enearslass="L7oss=f="+ine" name="L868"> 868
key_reserve( eainref="sg.c#L895" idodeass=>&6" i; [yes]&6" i;ss="linine" name="L868"> 868
done:
125">nklist)lass="ne" name="L868"> 868
126 thene" name="L757"> 757        unsi1261       12kleave" class="sref">kle12kle>126ref">ng)
nklist;
disc0rd_aew="li:e" name="L757"> 757        unsi1262       12ef="security/keys/keyrin12ef=>1262s="sref">key_reserve(nklist;
iewef="ef="security/keys/keyring.c#L851" id="L851" class"+c href="security eepL757" id="L757"keepey_tne" name="L868"> 868" kg"="sr_enearslass="L7oss="sref">keyring="sr_enearslass="L7oss=f="+">keyring_serialise_lsewf">nklist;
iewef="ef="security/keys/keLasing.c#L800" id=lasgt; 868error_12ota>126res(&keyring_serialise_link_semef">sem);
 868/* undo the quota12mme>126code=key" cla_reserve( eainref="sg.c#L895" idodeass=>&6" i; [disc0rd]&6" i;ss="linine" name="L868"> 868
1266>nklist)lass="ne" name="L868"> 868
126> = -e" name="L833"> 833            1268       12m" class="sref">error_se12m" >126s arenreserve( 757        unsi1269       12ode=type" class="sref">t12ode>126bug(keyring_serialise_link_semef">sem);
 868127/span class="string">" kneaing" class="sref"> eainref="sg.c#L895" idodeass=>&6" i; [noLdead]&6" i;ss="linine" name="L868"> 868
error_12sem>127 868
u12up_>127="line" name="L763"> 763        kle12kle>12=)
 757        unsi1274       12"+code=ret" class="sref"12"+c>127res(&keyring_serialise_link_semef">sem);
 868( eainref="sg.c#L895" idodeass=>&6" i; [ o_ng.c#]&6" i;ss="linine" name="L868"> 868
 868
127> = -e" name="L833"> 833            12=8       12* Check already instanti12* C>127s arenreserve( 757        unsi12=9       12*
keyring_serialise_link_semef">sem);
 868" kneaing" class="sref"> eainref="sg.c#L895" idodeass=>&6" i; [oom]&6" i;ss="linine" name="L868"> 868
 814
12*" id=


ed toriginal LXR softw0reLbyc#L86" name="Lhttp://sourceforge.net/projects/lx,&>LXR ectlun 81gt;lx,@a hux.nos="l.
lx,.a hux.no kindly hosted by6" name="Lhttp://www.redpill-a hpro.no">Redpill L hpro ASgt;ii