]>
Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 LT |
2 | /* |
3 | * The "user cache". | |
4 | * | |
5 | * (C) Copyright 1991-2000 Linus Torvalds | |
6 | * | |
7 | * We have a per-user structure to keep track of how many | |
8 | * processes, files etc the user has claimed, in order to be | |
9 | * able to have per-user limits for system resources. | |
10 | */ | |
11 | ||
12 | #include <linux/init.h> | |
13 | #include <linux/sched.h> | |
14 | #include <linux/slab.h> | |
15 | #include <linux/bitops.h> | |
16 | #include <linux/key.h> | |
8703e8a4 | 17 | #include <linux/sched/user.h> |
4021cb27 | 18 | #include <linux/interrupt.h> |
9984de1a | 19 | #include <linux/export.h> |
acce292c | 20 | #include <linux/user_namespace.h> |
0bb80f24 | 21 | #include <linux/proc_ns.h> |
1da177e4 | 22 | |
59607db3 SH |
23 | /* |
24 | * userns count is 1 for root user, 1 for init_uts_ns, | |
25 | * and 1 for... ? | |
26 | */ | |
aee16ce7 | 27 | struct user_namespace init_user_ns = { |
22d917d8 EB |
28 | .uid_map = { |
29 | .nr_extents = 1, | |
aa4bf44d CB |
30 | { |
31 | .extent[0] = { | |
32 | .first = 0, | |
33 | .lower_first = 0, | |
34 | .count = 4294967295U, | |
35 | }, | |
22d917d8 EB |
36 | }, |
37 | }, | |
38 | .gid_map = { | |
39 | .nr_extents = 1, | |
aa4bf44d CB |
40 | { |
41 | .extent[0] = { | |
42 | .first = 0, | |
43 | .lower_first = 0, | |
44 | .count = 4294967295U, | |
45 | }, | |
22d917d8 EB |
46 | }, |
47 | }, | |
f76d207a EB |
48 | .projid_map = { |
49 | .nr_extents = 1, | |
aa4bf44d CB |
50 | { |
51 | .extent[0] = { | |
52 | .first = 0, | |
53 | .lower_first = 0, | |
54 | .count = 4294967295U, | |
55 | }, | |
f76d207a EB |
56 | }, |
57 | }, | |
265cbd62 | 58 | .ns.count = REFCOUNT_INIT(3), |
783291e6 EB |
59 | .owner = GLOBAL_ROOT_UID, |
60 | .group = GLOBAL_ROOT_GID, | |
435d5f4b | 61 | .ns.inum = PROC_USER_INIT_INO, |
33c42940 AV |
62 | #ifdef CONFIG_USER_NS |
63 | .ns.ops = &userns_operations, | |
64 | #endif | |
9cc46516 | 65 | .flags = USERNS_INIT_FLAGS, |
b206f281 DH |
66 | #ifdef CONFIG_KEYS |
67 | .keyring_name_list = LIST_HEAD_INIT(init_user_ns.keyring_name_list), | |
0f44e4d9 | 68 | .keyring_sem = __RWSEM_INITIALIZER(init_user_ns.keyring_sem), |
f36f8c75 | 69 | #endif |
aee16ce7 PE |
70 | }; |
71 | EXPORT_SYMBOL_GPL(init_user_ns); | |
72 | ||
1da177e4 LT |
73 | /* |
74 | * UID task count cache, to get fast user lookup in "alloc_uid" | |
75 | * when changing user ID's (ie setuid() and friends). | |
76 | */ | |
77 | ||
7b44ab97 EB |
78 | #define UIDHASH_BITS (CONFIG_BASE_SMALL ? 3 : 7) |
79 | #define UIDHASH_SZ (1 << UIDHASH_BITS) | |
1da177e4 LT |
80 | #define UIDHASH_MASK (UIDHASH_SZ - 1) |
81 | #define __uidhashfn(uid) (((uid >> UIDHASH_BITS) + uid) & UIDHASH_MASK) | |
7b44ab97 | 82 | #define uidhashentry(uid) (uidhash_table + __uidhashfn((__kuid_val(uid)))) |
1da177e4 | 83 | |
e18b890b | 84 | static struct kmem_cache *uid_cachep; |
de83dbd9 | 85 | static struct hlist_head uidhash_table[UIDHASH_SZ]; |
4021cb27 IM |
86 | |
87 | /* | |
88 | * The uidhash_lock is mostly taken from process context, but it is | |
89 | * occasionally also taken from softirq/tasklet context, when | |
90 | * task-structs get RCU-freed. Hence all locking must be softirq-safe. | |
3fa97c9d AM |
91 | * But free_uid() is also called with local interrupts disabled, and running |
92 | * local_bh_enable() with local interrupts disabled is an error - we'll run | |
93 | * softirq callbacks, and they can unconditionally enable interrupts, and | |
94 | * the caller of free_uid() didn't expect that.. | |
4021cb27 | 95 | */ |
1da177e4 LT |
96 | static DEFINE_SPINLOCK(uidhash_lock); |
97 | ||
783291e6 | 98 | /* root_user.__count is 1, for init task cred */ |
1da177e4 | 99 | struct user_struct root_user = { |
fc371912 | 100 | .__count = REFCOUNT_INIT(1), |
7b44ab97 | 101 | .uid = GLOBAL_ROOT_UID, |
bef3efbe | 102 | .ratelimit = RATELIMIT_STATE_INIT(root_user.ratelimit, 0, 0), |
1da177e4 LT |
103 | }; |
104 | ||
5cb350ba DG |
105 | /* |
106 | * These routines must be called with the uidhash spinlock held! | |
107 | */ | |
40aeb400 | 108 | static void uid_hash_insert(struct user_struct *up, struct hlist_head *hashent) |
5cb350ba DG |
109 | { |
110 | hlist_add_head(&up->uidhash_node, hashent); | |
111 | } | |
112 | ||
40aeb400 | 113 | static void uid_hash_remove(struct user_struct *up) |
5cb350ba DG |
114 | { |
115 | hlist_del_init(&up->uidhash_node); | |
116 | } | |
117 | ||
7b44ab97 | 118 | static struct user_struct *uid_hash_find(kuid_t uid, struct hlist_head *hashent) |
3959214f KS |
119 | { |
120 | struct user_struct *user; | |
3959214f | 121 | |
b67bfe0d | 122 | hlist_for_each_entry(user, hashent, uidhash_node) { |
7b44ab97 | 123 | if (uid_eq(user->uid, uid)) { |
fc371912 | 124 | refcount_inc(&user->__count); |
3959214f KS |
125 | return user; |
126 | } | |
127 | } | |
128 | ||
129 | return NULL; | |
130 | } | |
131 | ||
1e1c1583 NP |
132 | static int user_epoll_alloc(struct user_struct *up) |
133 | { | |
134 | #ifdef CONFIG_EPOLL | |
135 | return percpu_counter_init(&up->epoll_watches, 0, GFP_KERNEL); | |
136 | #else | |
137 | return 0; | |
138 | #endif | |
139 | } | |
140 | ||
141 | static void user_epoll_free(struct user_struct *up) | |
142 | { | |
143 | #ifdef CONFIG_EPOLL | |
144 | percpu_counter_destroy(&up->epoll_watches); | |
145 | #endif | |
146 | } | |
147 | ||
5cb350ba DG |
148 | /* IRQs are disabled and uidhash_lock is held upon function entry. |
149 | * IRQ state (as stored in flags) is restored and uidhash_lock released | |
150 | * upon function exit. | |
151 | */ | |
18b6e041 | 152 | static void free_user(struct user_struct *up, unsigned long flags) |
571428be | 153 | __releases(&uidhash_lock) |
5cb350ba DG |
154 | { |
155 | uid_hash_remove(up); | |
156 | spin_unlock_irqrestore(&uidhash_lock, flags); | |
1e1c1583 | 157 | user_epoll_free(up); |
5cb350ba DG |
158 | kmem_cache_free(uid_cachep, up); |
159 | } | |
160 | ||
1da177e4 LT |
161 | /* |
162 | * Locate the user_struct for the passed UID. If found, take a ref on it. The | |
163 | * caller must undo that ref with free_uid(). | |
164 | * | |
165 | * If the user_struct could not be found, return NULL. | |
166 | */ | |
7b44ab97 | 167 | struct user_struct *find_user(kuid_t uid) |
1da177e4 LT |
168 | { |
169 | struct user_struct *ret; | |
3fa97c9d | 170 | unsigned long flags; |
1da177e4 | 171 | |
3fa97c9d | 172 | spin_lock_irqsave(&uidhash_lock, flags); |
7b44ab97 | 173 | ret = uid_hash_find(uid, uidhashentry(uid)); |
3fa97c9d | 174 | spin_unlock_irqrestore(&uidhash_lock, flags); |
1da177e4 LT |
175 | return ret; |
176 | } | |
177 | ||
178 | void free_uid(struct user_struct *up) | |
179 | { | |
3fa97c9d AM |
180 | unsigned long flags; |
181 | ||
36f57413 AM |
182 | if (!up) |
183 | return; | |
184 | ||
ce0a568d | 185 | if (refcount_dec_and_lock_irqsave(&up->__count, &uidhash_lock, &flags)) |
5cb350ba | 186 | free_user(up, flags); |
1da177e4 | 187 | } |
ce5a23c8 | 188 | EXPORT_SYMBOL_GPL(free_uid); |
1da177e4 | 189 | |
7b44ab97 | 190 | struct user_struct *alloc_uid(kuid_t uid) |
1da177e4 | 191 | { |
7b44ab97 | 192 | struct hlist_head *hashent = uidhashentry(uid); |
8eb703e4 | 193 | struct user_struct *up, *new; |
1da177e4 | 194 | |
3fa97c9d | 195 | spin_lock_irq(&uidhash_lock); |
1da177e4 | 196 | up = uid_hash_find(uid, hashent); |
3fa97c9d | 197 | spin_unlock_irq(&uidhash_lock); |
1da177e4 LT |
198 | |
199 | if (!up) { | |
354a1f4d | 200 | new = kmem_cache_zalloc(uid_cachep, GFP_KERNEL); |
8eb703e4 | 201 | if (!new) |
6c4e121f | 202 | return NULL; |
5e8869bb | 203 | |
1da177e4 | 204 | new->uid = uid; |
fc371912 | 205 | refcount_set(&new->__count, 1); |
1e1c1583 NP |
206 | if (user_epoll_alloc(new)) { |
207 | kmem_cache_free(uid_cachep, new); | |
208 | return NULL; | |
209 | } | |
bef3efbe TL |
210 | ratelimit_state_init(&new->ratelimit, HZ, 100); |
211 | ratelimit_set_flags(&new->ratelimit, RATELIMIT_MSG_ON_RELEASE); | |
1da177e4 LT |
212 | |
213 | /* | |
214 | * Before adding this, check whether we raced | |
215 | * on adding the same user already.. | |
216 | */ | |
3fa97c9d | 217 | spin_lock_irq(&uidhash_lock); |
1da177e4 LT |
218 | up = uid_hash_find(uid, hashent); |
219 | if (up) { | |
1e1c1583 | 220 | user_epoll_free(new); |
1da177e4 LT |
221 | kmem_cache_free(uid_cachep, new); |
222 | } else { | |
223 | uid_hash_insert(new, hashent); | |
224 | up = new; | |
225 | } | |
3fa97c9d | 226 | spin_unlock_irq(&uidhash_lock); |
1da177e4 | 227 | } |
5cb350ba | 228 | |
1da177e4 LT |
229 | return up; |
230 | } | |
231 | ||
1da177e4 LT |
232 | static int __init uid_cache_init(void) |
233 | { | |
234 | int n; | |
235 | ||
236 | uid_cachep = kmem_cache_create("uid_cache", sizeof(struct user_struct), | |
20c2df83 | 237 | 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL); |
1da177e4 LT |
238 | |
239 | for(n = 0; n < UIDHASH_SZ; ++n) | |
7b44ab97 | 240 | INIT_HLIST_HEAD(uidhash_table + n); |
1da177e4 | 241 | |
1e1c1583 NP |
242 | if (user_epoll_alloc(&root_user)) |
243 | panic("root_user epoll percpu counter alloc failed"); | |
244 | ||
1da177e4 | 245 | /* Insert the root user immediately (init already runs as root) */ |
3fa97c9d | 246 | spin_lock_irq(&uidhash_lock); |
7b44ab97 | 247 | uid_hash_insert(&root_user, uidhashentry(GLOBAL_ROOT_UID)); |
3fa97c9d | 248 | spin_unlock_irq(&uidhash_lock); |
1da177e4 LT |
249 | |
250 | return 0; | |
251 | } | |
c96d6660 | 252 | subsys_initcall(uid_cache_init); |