]>
Commit | Line | Data |
---|---|---|
76181c13 | 1 | /* Basic authentication token and access key management |
1da177e4 | 2 | * |
69664cf1 | 3 | * Copyright (C) 2004-2008 Red Hat, Inc. All Rights Reserved. |
1da177e4 LT |
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> | |
a7807a32 | 14 | #include <linux/poison.h> |
1da177e4 LT |
15 | #include <linux/sched.h> |
16 | #include <linux/slab.h> | |
29db9190 | 17 | #include <linux/security.h> |
1da177e4 | 18 | #include <linux/workqueue.h> |
e51f6d34 | 19 | #include <linux/random.h> |
1da177e4 LT |
20 | #include <linux/err.h> |
21 | #include "internal.h" | |
22 | ||
8bc16dea | 23 | struct kmem_cache *key_jar; |
1da177e4 LT |
24 | struct rb_root key_serial_tree; /* tree of keys indexed by serial */ |
25 | DEFINE_SPINLOCK(key_serial_lock); | |
26 | ||
27 | struct rb_root key_user_tree; /* tree of quota records indexed by UID */ | |
28 | DEFINE_SPINLOCK(key_user_lock); | |
29 | ||
738c5d19 SD |
30 | unsigned int key_quota_root_maxkeys = 1000000; /* root's key count quota */ |
31 | unsigned int key_quota_root_maxbytes = 25000000; /* root's key space quota */ | |
0b77f5bf DH |
32 | unsigned int key_quota_maxkeys = 200; /* general key count quota */ |
33 | unsigned int key_quota_maxbytes = 20000; /* general key space quota */ | |
34 | ||
1da177e4 LT |
35 | static LIST_HEAD(key_types_list); |
36 | static DECLARE_RWSEM(key_types_sem); | |
37 | ||
973c9f4f | 38 | /* We serialise key instantiation and link */ |
76181c13 | 39 | DEFINE_MUTEX(key_construction_mutex); |
1da177e4 | 40 | |
1da177e4 LT |
41 | #ifdef KEY_DEBUGGING |
42 | void __key_check(const struct key *key) | |
43 | { | |
44 | printk("__key_check: key %p {%08x} should be {%08x}\n", | |
45 | key, key->magic, KEY_DEBUG_MAGIC); | |
46 | BUG(); | |
47 | } | |
48 | #endif | |
49 | ||
1da177e4 | 50 | /* |
973c9f4f DH |
51 | * Get the key quota record for a user, allocating a new record if one doesn't |
52 | * already exist. | |
1da177e4 | 53 | */ |
9a56c2db | 54 | struct key_user *key_user_lookup(kuid_t uid) |
1da177e4 LT |
55 | { |
56 | struct key_user *candidate = NULL, *user; | |
8f674565 | 57 | struct rb_node *parent, **p; |
1da177e4 | 58 | |
973c9f4f | 59 | try_again: |
8f674565 | 60 | parent = NULL; |
1da177e4 LT |
61 | p = &key_user_tree.rb_node; |
62 | spin_lock(&key_user_lock); | |
63 | ||
64 | /* search the tree for a user record with a matching UID */ | |
65 | while (*p) { | |
66 | parent = *p; | |
67 | user = rb_entry(parent, struct key_user, node); | |
68 | ||
9a56c2db | 69 | if (uid_lt(uid, user->uid)) |
1da177e4 | 70 | p = &(*p)->rb_left; |
9a56c2db | 71 | else if (uid_gt(uid, user->uid)) |
1d1e9756 | 72 | p = &(*p)->rb_right; |
1da177e4 LT |
73 | else |
74 | goto found; | |
75 | } | |
76 | ||
77 | /* if we get here, we failed to find a match in the tree */ | |
78 | if (!candidate) { | |
79 | /* allocate a candidate user record if we don't already have | |
80 | * one */ | |
81 | spin_unlock(&key_user_lock); | |
82 | ||
83 | user = NULL; | |
84 | candidate = kmalloc(sizeof(struct key_user), GFP_KERNEL); | |
85 | if (unlikely(!candidate)) | |
86 | goto out; | |
87 | ||
88 | /* the allocation may have scheduled, so we need to repeat the | |
89 | * search lest someone else added the record whilst we were | |
90 | * asleep */ | |
91 | goto try_again; | |
92 | } | |
93 | ||
94 | /* if we get here, then the user record still hadn't appeared on the | |
95 | * second pass - so we use the candidate record */ | |
ddb99e11 | 96 | refcount_set(&candidate->usage, 1); |
1da177e4 LT |
97 | atomic_set(&candidate->nkeys, 0); |
98 | atomic_set(&candidate->nikeys, 0); | |
99 | candidate->uid = uid; | |
100 | candidate->qnkeys = 0; | |
101 | candidate->qnbytes = 0; | |
102 | spin_lock_init(&candidate->lock); | |
76181c13 | 103 | mutex_init(&candidate->cons_lock); |
1da177e4 LT |
104 | |
105 | rb_link_node(&candidate->node, parent, p); | |
106 | rb_insert_color(&candidate->node, &key_user_tree); | |
107 | spin_unlock(&key_user_lock); | |
108 | user = candidate; | |
109 | goto out; | |
110 | ||
111 | /* okay - we found a user record for this UID */ | |
973c9f4f | 112 | found: |
ddb99e11 | 113 | refcount_inc(&user->usage); |
1da177e4 | 114 | spin_unlock(&key_user_lock); |
a7f988ba | 115 | kfree(candidate); |
973c9f4f | 116 | out: |
1da177e4 | 117 | return user; |
a8b17ed0 | 118 | } |
1da177e4 | 119 | |
1da177e4 | 120 | /* |
973c9f4f | 121 | * Dispose of a user structure |
1da177e4 LT |
122 | */ |
123 | void key_user_put(struct key_user *user) | |
124 | { | |
ddb99e11 | 125 | if (refcount_dec_and_lock(&user->usage, &key_user_lock)) { |
1da177e4 LT |
126 | rb_erase(&user->node, &key_user_tree); |
127 | spin_unlock(&key_user_lock); | |
128 | ||
129 | kfree(user); | |
130 | } | |
a8b17ed0 | 131 | } |
1da177e4 | 132 | |
1da177e4 | 133 | /* |
973c9f4f DH |
134 | * Allocate a serial number for a key. These are assigned randomly to avoid |
135 | * security issues through covert channel problems. | |
1da177e4 LT |
136 | */ |
137 | static inline void key_alloc_serial(struct key *key) | |
138 | { | |
139 | struct rb_node *parent, **p; | |
140 | struct key *xkey; | |
141 | ||
e51f6d34 | 142 | /* propose a random serial number and look for a hole for it in the |
1da177e4 | 143 | * serial number tree */ |
e51f6d34 ML |
144 | do { |
145 | get_random_bytes(&key->serial, sizeof(key->serial)); | |
146 | ||
147 | key->serial >>= 1; /* negative numbers are not permitted */ | |
148 | } while (key->serial < 3); | |
149 | ||
150 | spin_lock(&key_serial_lock); | |
1da177e4 | 151 | |
9ad0830f | 152 | attempt_insertion: |
1da177e4 LT |
153 | parent = NULL; |
154 | p = &key_serial_tree.rb_node; | |
155 | ||
156 | while (*p) { | |
157 | parent = *p; | |
158 | xkey = rb_entry(parent, struct key, serial_node); | |
159 | ||
160 | if (key->serial < xkey->serial) | |
161 | p = &(*p)->rb_left; | |
162 | else if (key->serial > xkey->serial) | |
163 | p = &(*p)->rb_right; | |
164 | else | |
165 | goto serial_exists; | |
166 | } | |
9ad0830f DH |
167 | |
168 | /* we've found a suitable hole - arrange for this key to occupy it */ | |
169 | rb_link_node(&key->serial_node, parent, p); | |
170 | rb_insert_color(&key->serial_node, &key_serial_tree); | |
171 | ||
172 | spin_unlock(&key_serial_lock); | |
173 | return; | |
1da177e4 LT |
174 | |
175 | /* we found a key with the proposed serial number - walk the tree from | |
176 | * that point looking for the next unused serial number */ | |
e51f6d34 | 177 | serial_exists: |
1da177e4 | 178 | for (;;) { |
e51f6d34 | 179 | key->serial++; |
9ad0830f DH |
180 | if (key->serial < 3) { |
181 | key->serial = 3; | |
182 | goto attempt_insertion; | |
183 | } | |
1da177e4 LT |
184 | |
185 | parent = rb_next(parent); | |
186 | if (!parent) | |
9ad0830f | 187 | goto attempt_insertion; |
1da177e4 LT |
188 | |
189 | xkey = rb_entry(parent, struct key, serial_node); | |
190 | if (key->serial < xkey->serial) | |
9ad0830f | 191 | goto attempt_insertion; |
1da177e4 | 192 | } |
a8b17ed0 | 193 | } |
1da177e4 | 194 | |
973c9f4f DH |
195 | /** |
196 | * key_alloc - Allocate a key of the specified type. | |
197 | * @type: The type of key to allocate. | |
198 | * @desc: The key description to allow the key to be searched out. | |
199 | * @uid: The owner of the new key. | |
200 | * @gid: The group ID for the new key's group permissions. | |
201 | * @cred: The credentials specifying UID namespace. | |
202 | * @perm: The permissions mask of the new key. | |
203 | * @flags: Flags specifying quota properties. | |
2b6aa412 | 204 | * @restrict_link: Optional link restriction for new keyrings. |
973c9f4f DH |
205 | * |
206 | * Allocate a key of the specified type with the attributes given. The key is | |
207 | * returned in an uninstantiated state and the caller needs to instantiate the | |
208 | * key before returning. | |
209 | * | |
2b6aa412 MM |
210 | * The restrict_link structure (if not NULL) will be freed when the |
211 | * keyring is destroyed, so it must be dynamically allocated. | |
212 | * | |
973c9f4f DH |
213 | * The user's key count quota is updated to reflect the creation of the key and |
214 | * the user's key data quota has the default for the key type reserved. The | |
215 | * instantiation function should amend this as necessary. If insufficient | |
216 | * quota is available, -EDQUOT will be returned. | |
217 | * | |
218 | * The LSM security modules can prevent a key being created, in which case | |
219 | * -EACCES will be returned. | |
220 | * | |
221 | * Returns a pointer to the new key if successful and an error code otherwise. | |
222 | * | |
223 | * Note that the caller needs to ensure the key type isn't uninstantiated. | |
224 | * Internally this can be done by locking key_types_sem. Externally, this can | |
225 | * be done by either never unregistering the key type, or making sure | |
226 | * key_alloc() calls don't race with module unloading. | |
1da177e4 LT |
227 | */ |
228 | struct key *key_alloc(struct key_type *type, const char *desc, | |
9a56c2db | 229 | kuid_t uid, kgid_t gid, const struct cred *cred, |
5ac7eace | 230 | key_perm_t perm, unsigned long flags, |
2b6aa412 | 231 | struct key_restriction *restrict_link) |
1da177e4 LT |
232 | { |
233 | struct key_user *user = NULL; | |
234 | struct key *key; | |
235 | size_t desclen, quotalen; | |
29db9190 | 236 | int ret; |
1da177e4 LT |
237 | |
238 | key = ERR_PTR(-EINVAL); | |
239 | if (!desc || !*desc) | |
240 | goto error; | |
241 | ||
b9fffa38 DH |
242 | if (type->vet_description) { |
243 | ret = type->vet_description(desc); | |
244 | if (ret < 0) { | |
245 | key = ERR_PTR(ret); | |
246 | goto error; | |
247 | } | |
248 | } | |
249 | ||
16feef43 DH |
250 | desclen = strlen(desc); |
251 | quotalen = desclen + 1 + type->def_datalen; | |
1da177e4 LT |
252 | |
253 | /* get hold of the key tracking for this user */ | |
9a56c2db | 254 | user = key_user_lookup(uid); |
1da177e4 LT |
255 | if (!user) |
256 | goto no_memory_1; | |
257 | ||
258 | /* check that the user's quota permits allocation of another key and | |
259 | * its description */ | |
7e047ef5 | 260 | if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) { |
9a56c2db | 261 | unsigned maxkeys = uid_eq(uid, GLOBAL_ROOT_UID) ? |
0b77f5bf | 262 | key_quota_root_maxkeys : key_quota_maxkeys; |
9a56c2db | 263 | unsigned maxbytes = uid_eq(uid, GLOBAL_ROOT_UID) ? |
0b77f5bf DH |
264 | key_quota_root_maxbytes : key_quota_maxbytes; |
265 | ||
1da177e4 | 266 | spin_lock(&user->lock); |
7e047ef5 | 267 | if (!(flags & KEY_ALLOC_QUOTA_OVERRUN)) { |
f361f6a5 EB |
268 | if (user->qnkeys + 1 > maxkeys || |
269 | user->qnbytes + quotalen > maxbytes || | |
0b77f5bf | 270 | user->qnbytes + quotalen < user->qnbytes) |
7e047ef5 DH |
271 | goto no_quota; |
272 | } | |
1da177e4 LT |
273 | |
274 | user->qnkeys++; | |
275 | user->qnbytes += quotalen; | |
276 | spin_unlock(&user->lock); | |
277 | } | |
278 | ||
279 | /* allocate and initialise the key and its description */ | |
2480f57f | 280 | key = kmem_cache_zalloc(key_jar, GFP_KERNEL); |
1da177e4 LT |
281 | if (!key) |
282 | goto no_memory_2; | |
283 | ||
5057975a DC |
284 | key->index_key.desc_len = desclen; |
285 | key->index_key.description = kmemdup(desc, desclen + 1, GFP_KERNEL); | |
27720e75 | 286 | if (!key->index_key.description) |
5057975a | 287 | goto no_memory_3; |
1da177e4 | 288 | |
fff29291 | 289 | refcount_set(&key->usage, 1); |
1da177e4 | 290 | init_rwsem(&key->sem); |
7845bc39 | 291 | lockdep_set_class(&key->sem, &type->lock_class); |
16feef43 | 292 | key->index_key.type = type; |
1da177e4 LT |
293 | key->user = user; |
294 | key->quotalen = quotalen; | |
295 | key->datalen = type->def_datalen; | |
296 | key->uid = uid; | |
297 | key->gid = gid; | |
298 | key->perm = perm; | |
5ac7eace | 299 | key->restrict_link = restrict_link; |
d2f99974 | 300 | key->last_used_at = ktime_get_real_seconds(); |
1da177e4 | 301 | |
7e047ef5 | 302 | if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) |
76d8aeab | 303 | key->flags |= 1 << KEY_FLAG_IN_QUOTA; |
5d2787cf DH |
304 | if (flags & KEY_ALLOC_BUILT_IN) |
305 | key->flags |= 1 << KEY_FLAG_BUILTIN; | |
237bbd29 EB |
306 | if (flags & KEY_ALLOC_UID_KEYRING) |
307 | key->flags |= 1 << KEY_FLAG_UID_KEYRING; | |
1da177e4 | 308 | |
1da177e4 LT |
309 | #ifdef KEY_DEBUGGING |
310 | key->magic = KEY_DEBUG_MAGIC; | |
311 | #endif | |
312 | ||
29db9190 | 313 | /* let the security module know about the key */ |
d84f4f99 | 314 | ret = security_key_alloc(key, cred, flags); |
29db9190 DH |
315 | if (ret < 0) |
316 | goto security_error; | |
317 | ||
1da177e4 LT |
318 | /* publish the key by giving it a serial number */ |
319 | atomic_inc(&user->nkeys); | |
320 | key_alloc_serial(key); | |
321 | ||
29db9190 | 322 | error: |
1da177e4 LT |
323 | return key; |
324 | ||
29db9190 DH |
325 | security_error: |
326 | kfree(key->description); | |
1da177e4 | 327 | kmem_cache_free(key_jar, key); |
7e047ef5 | 328 | if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) { |
1da177e4 LT |
329 | spin_lock(&user->lock); |
330 | user->qnkeys--; | |
331 | user->qnbytes -= quotalen; | |
332 | spin_unlock(&user->lock); | |
333 | } | |
334 | key_user_put(user); | |
29db9190 DH |
335 | key = ERR_PTR(ret); |
336 | goto error; | |
337 | ||
338 | no_memory_3: | |
339 | kmem_cache_free(key_jar, key); | |
340 | no_memory_2: | |
7e047ef5 | 341 | if (!(flags & KEY_ALLOC_NOT_IN_QUOTA)) { |
29db9190 DH |
342 | spin_lock(&user->lock); |
343 | user->qnkeys--; | |
344 | user->qnbytes -= quotalen; | |
345 | spin_unlock(&user->lock); | |
346 | } | |
347 | key_user_put(user); | |
348 | no_memory_1: | |
1da177e4 LT |
349 | key = ERR_PTR(-ENOMEM); |
350 | goto error; | |
351 | ||
29db9190 | 352 | no_quota: |
1da177e4 LT |
353 | spin_unlock(&user->lock); |
354 | key_user_put(user); | |
355 | key = ERR_PTR(-EDQUOT); | |
356 | goto error; | |
a8b17ed0 | 357 | } |
1da177e4 LT |
358 | EXPORT_SYMBOL(key_alloc); |
359 | ||
973c9f4f DH |
360 | /** |
361 | * key_payload_reserve - Adjust data quota reservation for the key's payload | |
362 | * @key: The key to make the reservation for. | |
363 | * @datalen: The amount of data payload the caller now wants. | |
364 | * | |
365 | * Adjust the amount of the owning user's key data quota that a key reserves. | |
366 | * If the amount is increased, then -EDQUOT may be returned if there isn't | |
367 | * enough free quota available. | |
368 | * | |
369 | * If successful, 0 is returned. | |
1da177e4 LT |
370 | */ |
371 | int key_payload_reserve(struct key *key, size_t datalen) | |
372 | { | |
c5b60b5e | 373 | int delta = (int)datalen - key->datalen; |
1da177e4 LT |
374 | int ret = 0; |
375 | ||
376 | key_check(key); | |
377 | ||
378 | /* contemplate the quota adjustment */ | |
76d8aeab | 379 | if (delta != 0 && test_bit(KEY_FLAG_IN_QUOTA, &key->flags)) { |
9a56c2db | 380 | unsigned maxbytes = uid_eq(key->user->uid, GLOBAL_ROOT_UID) ? |
0b77f5bf DH |
381 | key_quota_root_maxbytes : key_quota_maxbytes; |
382 | ||
1da177e4 LT |
383 | spin_lock(&key->user->lock); |
384 | ||
385 | if (delta > 0 && | |
0b77f5bf DH |
386 | (key->user->qnbytes + delta >= maxbytes || |
387 | key->user->qnbytes + delta < key->user->qnbytes)) { | |
1da177e4 LT |
388 | ret = -EDQUOT; |
389 | } | |
390 | else { | |
391 | key->user->qnbytes += delta; | |
392 | key->quotalen += delta; | |
393 | } | |
394 | spin_unlock(&key->user->lock); | |
395 | } | |
396 | ||
397 | /* change the recorded data length if that didn't generate an error */ | |
398 | if (ret == 0) | |
399 | key->datalen = datalen; | |
400 | ||
401 | return ret; | |
a8b17ed0 | 402 | } |
1da177e4 LT |
403 | EXPORT_SYMBOL(key_payload_reserve); |
404 | ||
363b02da DH |
405 | /* |
406 | * Change the key state to being instantiated. | |
407 | */ | |
408 | static void mark_key_instantiated(struct key *key, int reject_error) | |
409 | { | |
410 | /* Commit the payload before setting the state; barrier versus | |
411 | * key_read_state(). | |
412 | */ | |
413 | smp_store_release(&key->state, | |
414 | (reject_error < 0) ? reject_error : KEY_IS_POSITIVE); | |
415 | } | |
416 | ||
1da177e4 | 417 | /* |
973c9f4f DH |
418 | * Instantiate a key and link it into the target keyring atomically. Must be |
419 | * called with the target keyring's semaphore writelocked. The target key's | |
420 | * semaphore need not be locked as instantiation is serialised by | |
421 | * key_construction_mutex. | |
1da177e4 LT |
422 | */ |
423 | static int __key_instantiate_and_link(struct key *key, | |
cf7f601c | 424 | struct key_preparsed_payload *prep, |
3e30148c | 425 | struct key *keyring, |
f70e2e06 | 426 | struct key *authkey, |
b2a4df20 | 427 | struct assoc_array_edit **_edit) |
1da177e4 LT |
428 | { |
429 | int ret, awaken; | |
430 | ||
431 | key_check(key); | |
432 | key_check(keyring); | |
433 | ||
434 | awaken = 0; | |
435 | ret = -EBUSY; | |
436 | ||
76181c13 | 437 | mutex_lock(&key_construction_mutex); |
1da177e4 LT |
438 | |
439 | /* can't instantiate twice */ | |
363b02da | 440 | if (key->state == KEY_IS_UNINSTANTIATED) { |
1da177e4 | 441 | /* instantiate the key */ |
cf7f601c | 442 | ret = key->type->instantiate(key, prep); |
1da177e4 LT |
443 | |
444 | if (ret == 0) { | |
445 | /* mark the key as being instantiated */ | |
1da177e4 | 446 | atomic_inc(&key->user->nikeys); |
363b02da | 447 | mark_key_instantiated(key, 0); |
1da177e4 | 448 | |
76d8aeab | 449 | if (test_and_clear_bit(KEY_FLAG_USER_CONSTRUCT, &key->flags)) |
1da177e4 | 450 | awaken = 1; |
1da177e4 LT |
451 | |
452 | /* and link it into the destination keyring */ | |
d3600bcf | 453 | if (keyring) { |
eee04502 DH |
454 | if (test_bit(KEY_FLAG_KEEP, &keyring->flags)) |
455 | set_bit(KEY_FLAG_KEEP, &key->flags); | |
d3600bcf | 456 | |
b2a4df20 | 457 | __key_link(key, _edit); |
d3600bcf | 458 | } |
3e30148c DH |
459 | |
460 | /* disable the authorisation key */ | |
d84f4f99 DH |
461 | if (authkey) |
462 | key_revoke(authkey); | |
7dfa0ca6 | 463 | |
0a9dd0e0 | 464 | if (prep->expiry != TIME64_MAX) { |
7dfa0ca6 DH |
465 | key->expiry = prep->expiry; |
466 | key_schedule_gc(prep->expiry + key_gc_delay); | |
467 | } | |
1da177e4 LT |
468 | } |
469 | } | |
470 | ||
76181c13 | 471 | mutex_unlock(&key_construction_mutex); |
1da177e4 LT |
472 | |
473 | /* wake up anyone waiting for a key to be constructed */ | |
474 | if (awaken) | |
76181c13 | 475 | wake_up_bit(&key->flags, KEY_FLAG_USER_CONSTRUCT); |
1da177e4 LT |
476 | |
477 | return ret; | |
a8b17ed0 | 478 | } |
1da177e4 | 479 | |
973c9f4f DH |
480 | /** |
481 | * key_instantiate_and_link - Instantiate a key and link it into the keyring. | |
482 | * @key: The key to instantiate. | |
483 | * @data: The data to use to instantiate the keyring. | |
484 | * @datalen: The length of @data. | |
485 | * @keyring: Keyring to create a link in on success (or NULL). | |
486 | * @authkey: The authorisation token permitting instantiation. | |
487 | * | |
488 | * Instantiate a key that's in the uninstantiated state using the provided data | |
489 | * and, if successful, link it in to the destination keyring if one is | |
490 | * supplied. | |
491 | * | |
492 | * If successful, 0 is returned, the authorisation token is revoked and anyone | |
493 | * waiting for the key is woken up. If the key was already instantiated, | |
494 | * -EBUSY will be returned. | |
1da177e4 LT |
495 | */ |
496 | int key_instantiate_and_link(struct key *key, | |
497 | const void *data, | |
498 | size_t datalen, | |
3e30148c | 499 | struct key *keyring, |
d84f4f99 | 500 | struct key *authkey) |
1da177e4 | 501 | { |
cf7f601c | 502 | struct key_preparsed_payload prep; |
b2a4df20 | 503 | struct assoc_array_edit *edit; |
1da177e4 LT |
504 | int ret; |
505 | ||
cf7f601c DH |
506 | memset(&prep, 0, sizeof(prep)); |
507 | prep.data = data; | |
508 | prep.datalen = datalen; | |
509 | prep.quotalen = key->type->def_datalen; | |
0a9dd0e0 | 510 | prep.expiry = TIME64_MAX; |
cf7f601c DH |
511 | if (key->type->preparse) { |
512 | ret = key->type->preparse(&prep); | |
513 | if (ret < 0) | |
514 | goto error; | |
515 | } | |
516 | ||
f70e2e06 | 517 | if (keyring) { |
4a420896 MM |
518 | ret = __key_link_begin(keyring, &key->index_key, &edit); |
519 | if (ret < 0) | |
520 | goto error; | |
521 | ||
2b6aa412 MM |
522 | if (keyring->restrict_link && keyring->restrict_link->check) { |
523 | struct key_restriction *keyres = keyring->restrict_link; | |
524 | ||
525 | ret = keyres->check(keyring, key->type, &prep.payload, | |
526 | keyres->key); | |
5ac7eace | 527 | if (ret < 0) |
4a420896 | 528 | goto error_link_end; |
5ac7eace | 529 | } |
f70e2e06 | 530 | } |
1da177e4 | 531 | |
b2a4df20 | 532 | ret = __key_instantiate_and_link(key, &prep, keyring, authkey, &edit); |
1da177e4 | 533 | |
4a420896 | 534 | error_link_end: |
1da177e4 | 535 | if (keyring) |
b2a4df20 | 536 | __key_link_end(keyring, &key->index_key, edit); |
1da177e4 | 537 | |
4d8c0250 | 538 | error: |
cf7f601c DH |
539 | if (key->type->preparse) |
540 | key->type->free_preparse(&prep); | |
1da177e4 | 541 | return ret; |
a8b17ed0 | 542 | } |
1da177e4 LT |
543 | |
544 | EXPORT_SYMBOL(key_instantiate_and_link); | |
545 | ||
973c9f4f | 546 | /** |
fdd1b945 | 547 | * key_reject_and_link - Negatively instantiate a key and link it into the keyring. |
973c9f4f DH |
548 | * @key: The key to instantiate. |
549 | * @timeout: The timeout on the negative key. | |
fdd1b945 | 550 | * @error: The error to return when the key is hit. |
973c9f4f DH |
551 | * @keyring: Keyring to create a link in on success (or NULL). |
552 | * @authkey: The authorisation token permitting instantiation. | |
553 | * | |
554 | * Negatively instantiate a key that's in the uninstantiated state and, if | |
fdd1b945 DH |
555 | * successful, set its timeout and stored error and link it in to the |
556 | * destination keyring if one is supplied. The key and any links to the key | |
557 | * will be automatically garbage collected after the timeout expires. | |
973c9f4f DH |
558 | * |
559 | * Negative keys are used to rate limit repeated request_key() calls by causing | |
fdd1b945 DH |
560 | * them to return the stored error code (typically ENOKEY) until the negative |
561 | * key expires. | |
973c9f4f DH |
562 | * |
563 | * If successful, 0 is returned, the authorisation token is revoked and anyone | |
564 | * waiting for the key is woken up. If the key was already instantiated, | |
565 | * -EBUSY will be returned. | |
1da177e4 | 566 | */ |
fdd1b945 | 567 | int key_reject_and_link(struct key *key, |
1da177e4 | 568 | unsigned timeout, |
fdd1b945 | 569 | unsigned error, |
3e30148c | 570 | struct key *keyring, |
d84f4f99 | 571 | struct key *authkey) |
1da177e4 | 572 | { |
b2a4df20 | 573 | struct assoc_array_edit *edit; |
f70e2e06 | 574 | int ret, awaken, link_ret = 0; |
1da177e4 LT |
575 | |
576 | key_check(key); | |
577 | key_check(keyring); | |
578 | ||
579 | awaken = 0; | |
580 | ret = -EBUSY; | |
581 | ||
5ac7eace DH |
582 | if (keyring) { |
583 | if (keyring->restrict_link) | |
584 | return -EPERM; | |
585 | ||
b2a4df20 | 586 | link_ret = __key_link_begin(keyring, &key->index_key, &edit); |
5ac7eace | 587 | } |
1da177e4 | 588 | |
76181c13 | 589 | mutex_lock(&key_construction_mutex); |
1da177e4 LT |
590 | |
591 | /* can't instantiate twice */ | |
363b02da | 592 | if (key->state == KEY_IS_UNINSTANTIATED) { |
1da177e4 | 593 | /* mark the key as being negatively instantiated */ |
1da177e4 | 594 | atomic_inc(&key->user->nikeys); |
363b02da | 595 | mark_key_instantiated(key, -error); |
074d5898 | 596 | key->expiry = ktime_get_real_seconds() + timeout; |
c08ef808 | 597 | key_schedule_gc(key->expiry + key_gc_delay); |
1da177e4 | 598 | |
76d8aeab | 599 | if (test_and_clear_bit(KEY_FLAG_USER_CONSTRUCT, &key->flags)) |
1da177e4 | 600 | awaken = 1; |
1da177e4 | 601 | |
1da177e4 LT |
602 | ret = 0; |
603 | ||
604 | /* and link it into the destination keyring */ | |
f70e2e06 | 605 | if (keyring && link_ret == 0) |
b2a4df20 | 606 | __key_link(key, &edit); |
3e30148c DH |
607 | |
608 | /* disable the authorisation key */ | |
d84f4f99 DH |
609 | if (authkey) |
610 | key_revoke(authkey); | |
1da177e4 LT |
611 | } |
612 | ||
76181c13 | 613 | mutex_unlock(&key_construction_mutex); |
1da177e4 | 614 | |
38327424 | 615 | if (keyring && link_ret == 0) |
b2a4df20 | 616 | __key_link_end(keyring, &key->index_key, edit); |
1da177e4 LT |
617 | |
618 | /* wake up anyone waiting for a key to be constructed */ | |
619 | if (awaken) | |
76181c13 | 620 | wake_up_bit(&key->flags, KEY_FLAG_USER_CONSTRUCT); |
1da177e4 | 621 | |
f70e2e06 | 622 | return ret == 0 ? link_ret : ret; |
a8b17ed0 | 623 | } |
fdd1b945 | 624 | EXPORT_SYMBOL(key_reject_and_link); |
1da177e4 | 625 | |
973c9f4f DH |
626 | /** |
627 | * key_put - Discard a reference to a key. | |
628 | * @key: The key to discard a reference from. | |
629 | * | |
630 | * Discard a reference to a key, and when all the references are gone, we | |
631 | * schedule the cleanup task to come and pull it out of the tree in process | |
632 | * context at some later time. | |
1da177e4 LT |
633 | */ |
634 | void key_put(struct key *key) | |
635 | { | |
636 | if (key) { | |
637 | key_check(key); | |
638 | ||
fff29291 | 639 | if (refcount_dec_and_test(&key->usage)) |
3b07e9ca | 640 | schedule_work(&key_gc_work); |
1da177e4 | 641 | } |
a8b17ed0 | 642 | } |
1da177e4 LT |
643 | EXPORT_SYMBOL(key_put); |
644 | ||
1da177e4 | 645 | /* |
973c9f4f | 646 | * Find a key by its serial number. |
1da177e4 LT |
647 | */ |
648 | struct key *key_lookup(key_serial_t id) | |
649 | { | |
650 | struct rb_node *n; | |
651 | struct key *key; | |
652 | ||
653 | spin_lock(&key_serial_lock); | |
654 | ||
655 | /* search the tree for the specified key */ | |
656 | n = key_serial_tree.rb_node; | |
657 | while (n) { | |
658 | key = rb_entry(n, struct key, serial_node); | |
659 | ||
660 | if (id < key->serial) | |
661 | n = n->rb_left; | |
662 | else if (id > key->serial) | |
663 | n = n->rb_right; | |
664 | else | |
665 | goto found; | |
666 | } | |
667 | ||
973c9f4f | 668 | not_found: |
1da177e4 LT |
669 | key = ERR_PTR(-ENOKEY); |
670 | goto error; | |
671 | ||
973c9f4f | 672 | found: |
92347cfd MR |
673 | /* A key is allowed to be looked up only if someone still owns a |
674 | * reference to it - otherwise it's awaiting the gc. | |
1da177e4 | 675 | */ |
92347cfd MR |
676 | if (!refcount_inc_not_zero(&key->usage)) |
677 | goto not_found; | |
1da177e4 | 678 | |
973c9f4f | 679 | error: |
1da177e4 LT |
680 | spin_unlock(&key_serial_lock); |
681 | return key; | |
a8b17ed0 | 682 | } |
1da177e4 | 683 | |
1da177e4 | 684 | /* |
973c9f4f DH |
685 | * Find and lock the specified key type against removal. |
686 | * | |
687 | * We return with the sem read-locked if successful. If the type wasn't | |
688 | * available -ENOKEY is returned instead. | |
1da177e4 LT |
689 | */ |
690 | struct key_type *key_type_lookup(const char *type) | |
691 | { | |
692 | struct key_type *ktype; | |
693 | ||
694 | down_read(&key_types_sem); | |
695 | ||
696 | /* look up the key type to see if it's one of the registered kernel | |
697 | * types */ | |
698 | list_for_each_entry(ktype, &key_types_list, link) { | |
699 | if (strcmp(ktype->name, type) == 0) | |
700 | goto found_kernel_type; | |
701 | } | |
702 | ||
703 | up_read(&key_types_sem); | |
704 | ktype = ERR_PTR(-ENOKEY); | |
705 | ||
973c9f4f | 706 | found_kernel_type: |
1da177e4 | 707 | return ktype; |
a8b17ed0 | 708 | } |
1da177e4 | 709 | |
59e6b9c1 BS |
710 | void key_set_timeout(struct key *key, unsigned timeout) |
711 | { | |
074d5898 | 712 | time64_t expiry = 0; |
59e6b9c1 BS |
713 | |
714 | /* make the changes with the locks held to prevent races */ | |
715 | down_write(&key->sem); | |
716 | ||
074d5898 BW |
717 | if (timeout > 0) |
718 | expiry = ktime_get_real_seconds() + timeout; | |
59e6b9c1 BS |
719 | |
720 | key->expiry = expiry; | |
721 | key_schedule_gc(key->expiry + key_gc_delay); | |
722 | ||
723 | up_write(&key->sem); | |
724 | } | |
725 | EXPORT_SYMBOL_GPL(key_set_timeout); | |
726 | ||
1da177e4 | 727 | /* |
973c9f4f | 728 | * Unlock a key type locked by key_type_lookup(). |
1da177e4 LT |
729 | */ |
730 | void key_type_put(struct key_type *ktype) | |
731 | { | |
732 | up_read(&key_types_sem); | |
a8b17ed0 | 733 | } |
1da177e4 | 734 | |
1da177e4 | 735 | /* |
973c9f4f DH |
736 | * Attempt to update an existing key. |
737 | * | |
738 | * The key is given to us with an incremented refcount that we need to discard | |
739 | * if we get an error. | |
1da177e4 | 740 | */ |
664cceb0 | 741 | static inline key_ref_t __key_update(key_ref_t key_ref, |
cf7f601c | 742 | struct key_preparsed_payload *prep) |
1da177e4 | 743 | { |
664cceb0 | 744 | struct key *key = key_ref_to_ptr(key_ref); |
1da177e4 LT |
745 | int ret; |
746 | ||
747 | /* need write permission on the key to update it */ | |
f5895943 | 748 | ret = key_permission(key_ref, KEY_NEED_WRITE); |
29db9190 | 749 | if (ret < 0) |
1da177e4 LT |
750 | goto error; |
751 | ||
752 | ret = -EEXIST; | |
753 | if (!key->type->update) | |
754 | goto error; | |
755 | ||
756 | down_write(&key->sem); | |
757 | ||
cf7f601c | 758 | ret = key->type->update(key, prep); |
76d8aeab | 759 | if (ret == 0) |
363b02da DH |
760 | /* Updating a negative key positively instantiates it */ |
761 | mark_key_instantiated(key, 0); | |
1da177e4 LT |
762 | |
763 | up_write(&key->sem); | |
764 | ||
765 | if (ret < 0) | |
766 | goto error; | |
664cceb0 DH |
767 | out: |
768 | return key_ref; | |
1da177e4 | 769 | |
664cceb0 | 770 | error: |
1da177e4 | 771 | key_put(key); |
664cceb0 | 772 | key_ref = ERR_PTR(ret); |
1da177e4 | 773 | goto out; |
a8b17ed0 | 774 | } |
1da177e4 | 775 | |
973c9f4f DH |
776 | /** |
777 | * key_create_or_update - Update or create and instantiate a key. | |
778 | * @keyring_ref: A pointer to the destination keyring with possession flag. | |
779 | * @type: The type of key. | |
780 | * @description: The searchable description for the key. | |
781 | * @payload: The data to use to instantiate or update the key. | |
782 | * @plen: The length of @payload. | |
783 | * @perm: The permissions mask for a new key. | |
784 | * @flags: The quota flags for a new key. | |
785 | * | |
786 | * Search the destination keyring for a key of the same description and if one | |
787 | * is found, update it, otherwise create and instantiate a new one and create a | |
788 | * link to it from that keyring. | |
789 | * | |
790 | * If perm is KEY_PERM_UNDEF then an appropriate key permissions mask will be | |
791 | * concocted. | |
792 | * | |
793 | * Returns a pointer to the new key if successful, -ENODEV if the key type | |
794 | * wasn't available, -ENOTDIR if the keyring wasn't a keyring, -EACCES if the | |
795 | * caller isn't permitted to modify the keyring or the LSM did not permit | |
796 | * creation of the key. | |
797 | * | |
798 | * On success, the possession flag from the keyring ref will be tacked on to | |
799 | * the key ref before it is returned. | |
1da177e4 | 800 | */ |
664cceb0 DH |
801 | key_ref_t key_create_or_update(key_ref_t keyring_ref, |
802 | const char *type, | |
803 | const char *description, | |
804 | const void *payload, | |
805 | size_t plen, | |
6b79ccb5 | 806 | key_perm_t perm, |
7e047ef5 | 807 | unsigned long flags) |
1da177e4 | 808 | { |
16feef43 DH |
809 | struct keyring_index_key index_key = { |
810 | .description = description, | |
811 | }; | |
cf7f601c | 812 | struct key_preparsed_payload prep; |
b2a4df20 | 813 | struct assoc_array_edit *edit; |
d84f4f99 | 814 | const struct cred *cred = current_cred(); |
664cceb0 | 815 | struct key *keyring, *key = NULL; |
664cceb0 | 816 | key_ref_t key_ref; |
1da177e4 | 817 | int ret; |
2b6aa412 | 818 | struct key_restriction *restrict_link = NULL; |
1da177e4 | 819 | |
1da177e4 LT |
820 | /* look up the key type to see if it's one of the registered kernel |
821 | * types */ | |
16feef43 DH |
822 | index_key.type = key_type_lookup(type); |
823 | if (IS_ERR(index_key.type)) { | |
664cceb0 | 824 | key_ref = ERR_PTR(-ENODEV); |
1da177e4 LT |
825 | goto error; |
826 | } | |
827 | ||
664cceb0 | 828 | key_ref = ERR_PTR(-EINVAL); |
c06cfb08 | 829 | if (!index_key.type->instantiate || |
16feef43 | 830 | (!index_key.description && !index_key.type->preparse)) |
cf7f601c | 831 | goto error_put_type; |
1da177e4 | 832 | |
664cceb0 DH |
833 | keyring = key_ref_to_ptr(keyring_ref); |
834 | ||
835 | key_check(keyring); | |
836 | ||
5ac7eace DH |
837 | if (!(flags & KEY_ALLOC_BYPASS_RESTRICTION)) |
838 | restrict_link = keyring->restrict_link; | |
839 | ||
c3a9d654 DH |
840 | key_ref = ERR_PTR(-ENOTDIR); |
841 | if (keyring->type != &key_type_keyring) | |
cf7f601c DH |
842 | goto error_put_type; |
843 | ||
844 | memset(&prep, 0, sizeof(prep)); | |
845 | prep.data = payload; | |
846 | prep.datalen = plen; | |
16feef43 | 847 | prep.quotalen = index_key.type->def_datalen; |
0a9dd0e0 | 848 | prep.expiry = TIME64_MAX; |
16feef43 DH |
849 | if (index_key.type->preparse) { |
850 | ret = index_key.type->preparse(&prep); | |
cf7f601c DH |
851 | if (ret < 0) { |
852 | key_ref = ERR_PTR(ret); | |
4d8c0250 | 853 | goto error_free_prep; |
cf7f601c | 854 | } |
16feef43 DH |
855 | if (!index_key.description) |
856 | index_key.description = prep.description; | |
cf7f601c | 857 | key_ref = ERR_PTR(-EINVAL); |
16feef43 | 858 | if (!index_key.description) |
cf7f601c DH |
859 | goto error_free_prep; |
860 | } | |
16feef43 | 861 | index_key.desc_len = strlen(index_key.description); |
c3a9d654 | 862 | |
4a420896 MM |
863 | ret = __key_link_begin(keyring, &index_key, &edit); |
864 | if (ret < 0) { | |
865 | key_ref = ERR_PTR(ret); | |
866 | goto error_free_prep; | |
867 | } | |
868 | ||
2b6aa412 MM |
869 | if (restrict_link && restrict_link->check) { |
870 | ret = restrict_link->check(keyring, index_key.type, | |
871 | &prep.payload, restrict_link->key); | |
5ac7eace DH |
872 | if (ret < 0) { |
873 | key_ref = ERR_PTR(ret); | |
4a420896 | 874 | goto error_link_end; |
5ac7eace DH |
875 | } |
876 | } | |
008643b8 | 877 | |
664cceb0 DH |
878 | /* if we're going to allocate a new key, we're going to have |
879 | * to modify the keyring */ | |
f5895943 | 880 | ret = key_permission(keyring_ref, KEY_NEED_WRITE); |
29db9190 DH |
881 | if (ret < 0) { |
882 | key_ref = ERR_PTR(ret); | |
cf7f601c | 883 | goto error_link_end; |
29db9190 | 884 | } |
664cceb0 | 885 | |
1d9b7d97 DH |
886 | /* if it's possible to update this type of key, search for an existing |
887 | * key of the same type and description in the destination keyring and | |
888 | * update that instead if possible | |
1da177e4 | 889 | */ |
16feef43 | 890 | if (index_key.type->update) { |
b2a4df20 DH |
891 | key_ref = find_key_to_update(keyring_ref, &index_key); |
892 | if (key_ref) | |
1d9b7d97 DH |
893 | goto found_matching_key; |
894 | } | |
1da177e4 | 895 | |
6b79ccb5 AR |
896 | /* if the client doesn't provide, decide on the permissions we want */ |
897 | if (perm == KEY_PERM_UNDEF) { | |
898 | perm = KEY_POS_VIEW | KEY_POS_SEARCH | KEY_POS_LINK | KEY_POS_SETATTR; | |
96b5c8fe | 899 | perm |= KEY_USR_VIEW; |
1da177e4 | 900 | |
16feef43 | 901 | if (index_key.type->read) |
96b5c8fe | 902 | perm |= KEY_POS_READ; |
1da177e4 | 903 | |
16feef43 DH |
904 | if (index_key.type == &key_type_keyring || |
905 | index_key.type->update) | |
96b5c8fe | 906 | perm |= KEY_POS_WRITE; |
6b79ccb5 | 907 | } |
1da177e4 LT |
908 | |
909 | /* allocate a new key */ | |
16feef43 | 910 | key = key_alloc(index_key.type, index_key.description, |
5ac7eace | 911 | cred->fsuid, cred->fsgid, cred, perm, flags, NULL); |
1da177e4 | 912 | if (IS_ERR(key)) { |
e231c2ee | 913 | key_ref = ERR_CAST(key); |
cf7f601c | 914 | goto error_link_end; |
1da177e4 LT |
915 | } |
916 | ||
917 | /* instantiate it and link it into the target keyring */ | |
b2a4df20 | 918 | ret = __key_instantiate_and_link(key, &prep, keyring, NULL, &edit); |
1da177e4 LT |
919 | if (ret < 0) { |
920 | key_put(key); | |
664cceb0 | 921 | key_ref = ERR_PTR(ret); |
cf7f601c | 922 | goto error_link_end; |
1da177e4 LT |
923 | } |
924 | ||
664cceb0 DH |
925 | key_ref = make_key_ref(key, is_key_possessed(keyring_ref)); |
926 | ||
cf7f601c | 927 | error_link_end: |
b2a4df20 | 928 | __key_link_end(keyring, &index_key, edit); |
cf7f601c | 929 | error_free_prep: |
16feef43 DH |
930 | if (index_key.type->preparse) |
931 | index_key.type->free_preparse(&prep); | |
cf7f601c | 932 | error_put_type: |
16feef43 | 933 | key_type_put(index_key.type); |
cf7f601c | 934 | error: |
664cceb0 | 935 | return key_ref; |
1da177e4 LT |
936 | |
937 | found_matching_key: | |
938 | /* we found a matching key, so we're going to try to update it | |
939 | * - we can drop the locks first as we have the key pinned | |
940 | */ | |
b2a4df20 | 941 | __key_link_end(keyring, &index_key, edit); |
1da177e4 | 942 | |
60ff5b2f DH |
943 | key = key_ref_to_ptr(key_ref); |
944 | if (test_bit(KEY_FLAG_USER_CONSTRUCT, &key->flags)) { | |
945 | ret = wait_for_key_construction(key, true); | |
946 | if (ret < 0) { | |
947 | key_ref_put(key_ref); | |
948 | key_ref = ERR_PTR(ret); | |
949 | goto error_free_prep; | |
950 | } | |
951 | } | |
952 | ||
cf7f601c DH |
953 | key_ref = __key_update(key_ref, &prep); |
954 | goto error_free_prep; | |
a8b17ed0 | 955 | } |
1da177e4 LT |
956 | EXPORT_SYMBOL(key_create_or_update); |
957 | ||
973c9f4f DH |
958 | /** |
959 | * key_update - Update a key's contents. | |
960 | * @key_ref: The pointer (plus possession flag) to the key. | |
961 | * @payload: The data to be used to update the key. | |
962 | * @plen: The length of @payload. | |
963 | * | |
964 | * Attempt to update the contents of a key with the given payload data. The | |
965 | * caller must be granted Write permission on the key. Negative keys can be | |
966 | * instantiated by this method. | |
967 | * | |
968 | * Returns 0 on success, -EACCES if not permitted and -EOPNOTSUPP if the key | |
969 | * type does not support updating. The key type may return other errors. | |
1da177e4 | 970 | */ |
664cceb0 | 971 | int key_update(key_ref_t key_ref, const void *payload, size_t plen) |
1da177e4 | 972 | { |
cf7f601c | 973 | struct key_preparsed_payload prep; |
664cceb0 | 974 | struct key *key = key_ref_to_ptr(key_ref); |
1da177e4 LT |
975 | int ret; |
976 | ||
977 | key_check(key); | |
978 | ||
979 | /* the key must be writable */ | |
f5895943 | 980 | ret = key_permission(key_ref, KEY_NEED_WRITE); |
29db9190 | 981 | if (ret < 0) |
63a0b050 | 982 | return ret; |
1da177e4 LT |
983 | |
984 | /* attempt to update it if supported */ | |
cf7f601c | 985 | if (!key->type->update) |
63a0b050 | 986 | return -EOPNOTSUPP; |
1da177e4 | 987 | |
cf7f601c DH |
988 | memset(&prep, 0, sizeof(prep)); |
989 | prep.data = payload; | |
990 | prep.datalen = plen; | |
991 | prep.quotalen = key->type->def_datalen; | |
0a9dd0e0 | 992 | prep.expiry = TIME64_MAX; |
cf7f601c DH |
993 | if (key->type->preparse) { |
994 | ret = key->type->preparse(&prep); | |
995 | if (ret < 0) | |
996 | goto error; | |
1da177e4 LT |
997 | } |
998 | ||
cf7f601c DH |
999 | down_write(&key->sem); |
1000 | ||
1001 | ret = key->type->update(key, &prep); | |
1002 | if (ret == 0) | |
363b02da DH |
1003 | /* Updating a negative key positively instantiates it */ |
1004 | mark_key_instantiated(key, 0); | |
cf7f601c DH |
1005 | |
1006 | up_write(&key->sem); | |
1007 | ||
4d8c0250 | 1008 | error: |
cf7f601c DH |
1009 | if (key->type->preparse) |
1010 | key->type->free_preparse(&prep); | |
1da177e4 | 1011 | return ret; |
a8b17ed0 | 1012 | } |
1da177e4 LT |
1013 | EXPORT_SYMBOL(key_update); |
1014 | ||
973c9f4f DH |
1015 | /** |
1016 | * key_revoke - Revoke a key. | |
1017 | * @key: The key to be revoked. | |
1018 | * | |
1019 | * Mark a key as being revoked and ask the type to free up its resources. The | |
1020 | * revocation timeout is set and the key and all its links will be | |
1021 | * automatically garbage collected after key_gc_delay amount of time if they | |
1022 | * are not manually dealt with first. | |
1da177e4 LT |
1023 | */ |
1024 | void key_revoke(struct key *key) | |
1025 | { | |
074d5898 | 1026 | time64_t time; |
5d135440 | 1027 | |
1da177e4 LT |
1028 | key_check(key); |
1029 | ||
76181c13 DH |
1030 | /* make sure no one's trying to change or use the key when we mark it |
1031 | * - we tell lockdep that we might nest because we might be revoking an | |
1032 | * authorisation key whilst holding the sem on a key we've just | |
1033 | * instantiated | |
1034 | */ | |
1035 | down_write_nested(&key->sem, 1); | |
1036 | if (!test_and_set_bit(KEY_FLAG_REVOKED, &key->flags) && | |
1037 | key->type->revoke) | |
04c567d9 DH |
1038 | key->type->revoke(key); |
1039 | ||
5d135440 | 1040 | /* set the death time to no more than the expiry time */ |
074d5898 | 1041 | time = ktime_get_real_seconds(); |
5d135440 DH |
1042 | if (key->revoked_at == 0 || key->revoked_at > time) { |
1043 | key->revoked_at = time; | |
c08ef808 | 1044 | key_schedule_gc(key->revoked_at + key_gc_delay); |
5d135440 DH |
1045 | } |
1046 | ||
1da177e4 | 1047 | up_write(&key->sem); |
a8b17ed0 | 1048 | } |
1da177e4 LT |
1049 | EXPORT_SYMBOL(key_revoke); |
1050 | ||
fd75815f DH |
1051 | /** |
1052 | * key_invalidate - Invalidate a key. | |
1053 | * @key: The key to be invalidated. | |
1054 | * | |
1055 | * Mark a key as being invalidated and have it cleaned up immediately. The key | |
1056 | * is ignored by all searches and other operations from this point. | |
1057 | */ | |
1058 | void key_invalidate(struct key *key) | |
1059 | { | |
1060 | kenter("%d", key_serial(key)); | |
1061 | ||
1062 | key_check(key); | |
1063 | ||
1064 | if (!test_bit(KEY_FLAG_INVALIDATED, &key->flags)) { | |
1065 | down_write_nested(&key->sem, 1); | |
1066 | if (!test_and_set_bit(KEY_FLAG_INVALIDATED, &key->flags)) | |
1067 | key_schedule_gc_links(); | |
1068 | up_write(&key->sem); | |
1069 | } | |
1070 | } | |
1071 | EXPORT_SYMBOL(key_invalidate); | |
1072 | ||
6a09d17b DH |
1073 | /** |
1074 | * generic_key_instantiate - Simple instantiation of a key from preparsed data | |
1075 | * @key: The key to be instantiated | |
1076 | * @prep: The preparsed data to load. | |
1077 | * | |
1078 | * Instantiate a key from preparsed data. We assume we can just copy the data | |
1079 | * in directly and clear the old pointers. | |
1080 | * | |
1081 | * This can be pointed to directly by the key type instantiate op pointer. | |
1082 | */ | |
1083 | int generic_key_instantiate(struct key *key, struct key_preparsed_payload *prep) | |
1084 | { | |
1085 | int ret; | |
1086 | ||
1087 | pr_devel("==>%s()\n", __func__); | |
1088 | ||
1089 | ret = key_payload_reserve(key, prep->quotalen); | |
1090 | if (ret == 0) { | |
146aa8b1 DH |
1091 | rcu_assign_keypointer(key, prep->payload.data[0]); |
1092 | key->payload.data[1] = prep->payload.data[1]; | |
1093 | key->payload.data[2] = prep->payload.data[2]; | |
1094 | key->payload.data[3] = prep->payload.data[3]; | |
1095 | prep->payload.data[0] = NULL; | |
1096 | prep->payload.data[1] = NULL; | |
1097 | prep->payload.data[2] = NULL; | |
1098 | prep->payload.data[3] = NULL; | |
6a09d17b DH |
1099 | } |
1100 | pr_devel("<==%s() = %d\n", __func__, ret); | |
1101 | return ret; | |
1102 | } | |
1103 | EXPORT_SYMBOL(generic_key_instantiate); | |
1104 | ||
973c9f4f DH |
1105 | /** |
1106 | * register_key_type - Register a type of key. | |
1107 | * @ktype: The new key type. | |
1108 | * | |
1109 | * Register a new key type. | |
1110 | * | |
1111 | * Returns 0 on success or -EEXIST if a type of this name already exists. | |
1da177e4 LT |
1112 | */ |
1113 | int register_key_type(struct key_type *ktype) | |
1114 | { | |
1115 | struct key_type *p; | |
1116 | int ret; | |
1117 | ||
7845bc39 DH |
1118 | memset(&ktype->lock_class, 0, sizeof(ktype->lock_class)); |
1119 | ||
1da177e4 LT |
1120 | ret = -EEXIST; |
1121 | down_write(&key_types_sem); | |
1122 | ||
1123 | /* disallow key types with the same name */ | |
1124 | list_for_each_entry(p, &key_types_list, link) { | |
1125 | if (strcmp(p->name, ktype->name) == 0) | |
1126 | goto out; | |
1127 | } | |
1128 | ||
1129 | /* store the type */ | |
1130 | list_add(&ktype->link, &key_types_list); | |
1eb1bcf5 DH |
1131 | |
1132 | pr_notice("Key type %s registered\n", ktype->name); | |
1da177e4 LT |
1133 | ret = 0; |
1134 | ||
973c9f4f | 1135 | out: |
1da177e4 LT |
1136 | up_write(&key_types_sem); |
1137 | return ret; | |
a8b17ed0 | 1138 | } |
1da177e4 LT |
1139 | EXPORT_SYMBOL(register_key_type); |
1140 | ||
973c9f4f DH |
1141 | /** |
1142 | * unregister_key_type - Unregister a type of key. | |
1143 | * @ktype: The key type. | |
1144 | * | |
1145 | * Unregister a key type and mark all the extant keys of this type as dead. | |
1146 | * Those keys of this type are then destroyed to get rid of their payloads and | |
1147 | * they and their links will be garbage collected as soon as possible. | |
1da177e4 LT |
1148 | */ |
1149 | void unregister_key_type(struct key_type *ktype) | |
1150 | { | |
1da177e4 | 1151 | down_write(&key_types_sem); |
1da177e4 | 1152 | list_del_init(&ktype->link); |
0c061b57 DH |
1153 | downgrade_write(&key_types_sem); |
1154 | key_gc_keytype(ktype); | |
1eb1bcf5 | 1155 | pr_notice("Key type %s unregistered\n", ktype->name); |
0c061b57 | 1156 | up_read(&key_types_sem); |
a8b17ed0 | 1157 | } |
1da177e4 LT |
1158 | EXPORT_SYMBOL(unregister_key_type); |
1159 | ||
1da177e4 | 1160 | /* |
973c9f4f | 1161 | * Initialise the key management state. |
1da177e4 LT |
1162 | */ |
1163 | void __init key_init(void) | |
1164 | { | |
1165 | /* allocate a slab in which we can store keys */ | |
1166 | key_jar = kmem_cache_create("key_jar", sizeof(struct key), | |
20c2df83 | 1167 | 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL); |
1da177e4 LT |
1168 | |
1169 | /* add the special key types */ | |
1170 | list_add_tail(&key_type_keyring.link, &key_types_list); | |
1171 | list_add_tail(&key_type_dead.link, &key_types_list); | |
1172 | list_add_tail(&key_type_user.link, &key_types_list); | |
9f6ed2ca | 1173 | list_add_tail(&key_type_logon.link, &key_types_list); |
1da177e4 LT |
1174 | |
1175 | /* record the root user tracking */ | |
1176 | rb_link_node(&root_key_user.node, | |
1177 | NULL, | |
1178 | &key_user_tree.rb_node); | |
1179 | ||
1180 | rb_insert_color(&root_key_user.node, | |
1181 | &key_user_tree); | |
a8b17ed0 | 1182 | } |