Blame view
kernel/user_namespace.c
33.2 KB
b886d83c5 treewide: Replace... |
1 |
// SPDX-License-Identifier: GPL-2.0-only |
acce292c8 user namespace: a... |
2 |
|
9984de1a5 kernel: Map most ... |
3 |
#include <linux/export.h> |
acce292c8 user namespace: a... |
4 |
#include <linux/nsproxy.h> |
1aeb272cf kernel: explicitl... |
5 |
#include <linux/slab.h> |
3f07c0144 sched/headers: Pr... |
6 |
#include <linux/sched/signal.h> |
acce292c8 user namespace: a... |
7 |
#include <linux/user_namespace.h> |
0bb80f240 proc: Split the n... |
8 |
#include <linux/proc_ns.h> |
5c1469de7 user_ns: Introduc... |
9 |
#include <linux/highuid.h> |
18b6e0414 User namespaces: ... |
10 |
#include <linux/cred.h> |
973c59142 userns: Start out... |
11 |
#include <linux/securebits.h> |
22d917d80 userns: Rework th... |
12 13 14 15 16 17 18 |
#include <linux/keyctl.h> #include <linux/key-type.h> #include <keys/user-type.h> #include <linux/seq_file.h> #include <linux/fs.h> #include <linux/uaccess.h> #include <linux/ctype.h> |
f76d207a6 userns: Add kproj... |
19 |
#include <linux/projid.h> |
e66eded83 userns: Don't all... |
20 |
#include <linux/fs_struct.h> |
6397fac49 userns: bump idma... |
21 22 |
#include <linux/bsearch.h> #include <linux/sort.h> |
acce292c8 user namespace: a... |
23 |
|
6164281ab user_ns: improve ... |
24 |
static struct kmem_cache *user_ns_cachep __read_mostly; |
f0d62aec9 userns: Rename id... |
25 |
static DEFINE_MUTEX(userns_state_mutex); |
6164281ab user_ns: improve ... |
26 |
|
6708075f1 userns: Don't let... |
27 28 |
static bool new_idmap_permitted(const struct file *file, struct user_namespace *ns, int cap_setid, |
22d917d80 userns: Rework th... |
29 |
struct uid_gid_map *map); |
b032132c3 userns: Free user... |
30 |
static void free_user_ns(struct work_struct *work); |
22d917d80 userns: Rework th... |
31 |
|
25f9c0817 userns: Generaliz... |
32 33 34 35 36 37 38 39 40 |
static struct ucounts *inc_user_namespaces(struct user_namespace *ns, kuid_t uid) { return inc_ucount(ns, uid, UCOUNT_USER_NAMESPACES); } static void dec_user_namespaces(struct ucounts *ucounts) { return dec_ucount(ucounts, UCOUNT_USER_NAMESPACES); } |
cde1975bc userns: Implent p... |
41 42 43 44 45 46 47 48 49 |
static void set_cred_user_ns(struct cred *cred, struct user_namespace *user_ns) { /* Start with the same capabilities as init but useless for doing * anything as the capabilities are bound to the new user namespace. */ cred->securebits = SECUREBITS_DEFAULT; cred->cap_inheritable = CAP_EMPTY_SET; cred->cap_permitted = CAP_FULL_SET; cred->cap_effective = CAP_FULL_SET; |
58319057b capabilities: amb... |
50 |
cred->cap_ambient = CAP_EMPTY_SET; |
cde1975bc userns: Implent p... |
51 52 53 54 55 56 57 58 |
cred->cap_bset = CAP_FULL_SET; #ifdef CONFIG_KEYS key_put(cred->request_key_auth); cred->request_key_auth = NULL; #endif /* tgcred will be cleared in our caller bc CLONE_THREAD won't be set */ cred->user_ns = user_ns; } |
77ec739d8 user namespace: a... |
59 |
/* |
18b6e0414 User namespaces: ... |
60 61 62 63 64 65 |
* Create a new user namespace, deriving the creator from the user in the * passed credentials, and replacing that user with the new root user for the * new namespace. * * This is called by copy_creds(), which will finish setting the target task's * credentials. |
77ec739d8 user namespace: a... |
66 |
*/ |
18b6e0414 User namespaces: ... |
67 |
int create_user_ns(struct cred *new) |
77ec739d8 user namespace: a... |
68 |
{ |
0093ccb68 cred: Refcount th... |
69 |
struct user_namespace *ns, *parent_ns = new->user_ns; |
078de5f70 userns: Store uid... |
70 71 |
kuid_t owner = new->euid; kgid_t group = new->egid; |
f6b2db1a3 userns: Make the ... |
72 |
struct ucounts *ucounts; |
25f9c0817 userns: Generaliz... |
73 |
int ret, i; |
783291e69 userns: Simplify ... |
74 |
|
df75e7748 userns: When the ... |
75 |
ret = -ENOSPC; |
8742f229b userns: limit the... |
76 |
if (parent_ns->level > 32) |
b376c3e1b userns: Add a lim... |
77 |
goto fail; |
f6b2db1a3 userns: Make the ... |
78 79 |
ucounts = inc_user_namespaces(parent_ns, owner); if (!ucounts) |
b376c3e1b userns: Add a lim... |
80 |
goto fail; |
8742f229b userns: limit the... |
81 |
|
3151527ee userns: Don't al... |
82 83 84 85 86 87 |
/* * Verify that we can not violate the policy of which files * may be accessed that is specified by the root directory, * by verifing that the root directory is at the root of the * mount namespace which allows all files to be accessed. */ |
b376c3e1b userns: Add a lim... |
88 |
ret = -EPERM; |
3151527ee userns: Don't al... |
89 |
if (current_chrooted()) |
b376c3e1b userns: Add a lim... |
90 |
goto fail_dec; |
3151527ee userns: Don't al... |
91 |
|
783291e69 userns: Simplify ... |
92 93 94 95 |
/* The creator needs a mapping in the parent user namespace * or else we won't be able to reasonably tell userspace who * created a user_namespace. */ |
b376c3e1b userns: Add a lim... |
96 |
ret = -EPERM; |
783291e69 userns: Simplify ... |
97 98 |
if (!kuid_has_mapping(parent_ns, owner) || !kgid_has_mapping(parent_ns, group)) |
b376c3e1b userns: Add a lim... |
99 |
goto fail_dec; |
77ec739d8 user namespace: a... |
100 |
|
b376c3e1b userns: Add a lim... |
101 |
ret = -ENOMEM; |
22d917d80 userns: Rework th... |
102 |
ns = kmem_cache_zalloc(user_ns_cachep, GFP_KERNEL); |
77ec739d8 user namespace: a... |
103 |
if (!ns) |
b376c3e1b userns: Add a lim... |
104 |
goto fail_dec; |
77ec739d8 user namespace: a... |
105 |
|
6344c433a new helpers: ns_a... |
106 |
ret = ns_alloc_inum(&ns->ns); |
b376c3e1b userns: Add a lim... |
107 108 |
if (ret) goto fail_free; |
33c429405 copy address of p... |
109 |
ns->ns.ops = &userns_operations; |
98f842e67 proc: Usable inod... |
110 |
|
c61a2810a userns: Avoid rec... |
111 |
atomic_set(&ns->count, 1); |
cde1975bc userns: Implent p... |
112 |
/* Leave the new->user_ns reference with the new user namespace. */ |
aeb3ae9da userns: Add an ex... |
113 |
ns->parent = parent_ns; |
8742f229b userns: limit the... |
114 |
ns->level = parent_ns->level + 1; |
783291e69 userns: Simplify ... |
115 116 |
ns->owner = owner; ns->group = group; |
b032132c3 userns: Free user... |
117 |
INIT_WORK(&ns->work, free_user_ns); |
25f9c0817 userns: Generaliz... |
118 119 120 |
for (i = 0; i < UCOUNT_COUNTS; i++) { ns->ucount_max[i] = INT_MAX; } |
f6b2db1a3 userns: Make the ... |
121 |
ns->ucounts = ucounts; |
22d917d80 userns: Rework th... |
122 |
|
9cc46516d userns: Add a kno... |
123 124 125 126 |
/* Inherit USERNS_SETGROUPS_ALLOWED from our parent */ mutex_lock(&userns_state_mutex); ns->flags = parent_ns->flags; mutex_unlock(&userns_state_mutex); |
b206f281d keys: Namespace k... |
127 128 |
#ifdef CONFIG_KEYS INIT_LIST_HEAD(&ns->keyring_name_list); |
0f44e4d97 keys: Move the us... |
129 |
init_rwsem(&ns->keyring_sem); |
f36f8c75a KEYS: Add per-use... |
130 |
#endif |
dbec28460 userns: Add per u... |
131 132 133 134 135 |
ret = -ENOMEM; if (!setup_userns_sysctls(ns)) goto fail_keyring; set_cred_user_ns(new, ns); |
18b6e0414 User namespaces: ... |
136 |
return 0; |
dbec28460 userns: Add per u... |
137 138 139 140 141 |
fail_keyring: #ifdef CONFIG_PERSISTENT_KEYRINGS key_put(ns->persistent_keyring_register); #endif ns_free_inum(&ns->ns); |
b376c3e1b userns: Add a lim... |
142 |
fail_free: |
dbec28460 userns: Add per u... |
143 |
kmem_cache_free(user_ns_cachep, ns); |
b376c3e1b userns: Add a lim... |
144 |
fail_dec: |
f6b2db1a3 userns: Make the ... |
145 |
dec_user_namespaces(ucounts); |
b376c3e1b userns: Add a lim... |
146 |
fail: |
dbec28460 userns: Add per u... |
147 |
return ret; |
acce292c8 user namespace: a... |
148 |
} |
b2e0d9870 userns: Implement... |
149 150 151 |
int unshare_userns(unsigned long unshare_flags, struct cred **new_cred) { struct cred *cred; |
6160968ce userns: unshare_u... |
152 |
int err = -ENOMEM; |
b2e0d9870 userns: Implement... |
153 154 155 156 157 |
if (!(unshare_flags & CLONE_NEWUSER)) return 0; cred = prepare_creds(); |
6160968ce userns: unshare_u... |
158 159 160 161 162 163 164 |
if (cred) { err = create_user_ns(cred); if (err) put_cred(cred); else *new_cred = cred; } |
b2e0d9870 userns: Implement... |
165 |
|
6160968ce userns: unshare_u... |
166 |
return err; |
b2e0d9870 userns: Implement... |
167 |
} |
b032132c3 userns: Free user... |
168 |
static void free_user_ns(struct work_struct *work) |
acce292c8 user namespace: a... |
169 |
{ |
b032132c3 userns: Free user... |
170 171 |
struct user_namespace *parent, *ns = container_of(work, struct user_namespace, work); |
783291e69 userns: Simplify ... |
172 |
|
c61a2810a userns: Avoid rec... |
173 |
do { |
f6b2db1a3 userns: Make the ... |
174 |
struct ucounts *ucounts = ns->ucounts; |
c61a2810a userns: Avoid rec... |
175 |
parent = ns->parent; |
6397fac49 userns: bump idma... |
176 177 178 179 180 181 182 183 184 185 186 187 |
if (ns->gid_map.nr_extents > UID_GID_MAP_MAX_BASE_EXTENTS) { kfree(ns->gid_map.forward); kfree(ns->gid_map.reverse); } if (ns->uid_map.nr_extents > UID_GID_MAP_MAX_BASE_EXTENTS) { kfree(ns->uid_map.forward); kfree(ns->uid_map.reverse); } if (ns->projid_map.nr_extents > UID_GID_MAP_MAX_BASE_EXTENTS) { kfree(ns->projid_map.forward); kfree(ns->projid_map.reverse); } |
dbec28460 userns: Add per u... |
188 |
retire_userns_sysctls(ns); |
b206f281d keys: Namespace k... |
189 |
key_free_user_ns(ns); |
6344c433a new helpers: ns_a... |
190 |
ns_free_inum(&ns->ns); |
c61a2810a userns: Avoid rec... |
191 |
kmem_cache_free(user_ns_cachep, ns); |
f6b2db1a3 userns: Make the ... |
192 |
dec_user_namespaces(ucounts); |
c61a2810a userns: Avoid rec... |
193 194 |
ns = parent; } while (atomic_dec_and_test(&parent->count)); |
acce292c8 user namespace: a... |
195 |
} |
b032132c3 userns: Free user... |
196 197 198 199 200 201 |
void __put_user_ns(struct user_namespace *ns) { schedule_work(&ns->work); } EXPORT_SYMBOL(__put_user_ns); |
5c1469de7 user_ns: Introduc... |
202 |
|
6397fac49 userns: bump idma... |
203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 |
/** * idmap_key struct holds the information necessary to find an idmapping in a * sorted idmap array. It is passed to cmp_map_id() as first argument. */ struct idmap_key { bool map_up; /* true -> id from kid; false -> kid from id */ u32 id; /* id to find */ u32 count; /* == 0 unless used with map_id_range_down() */ }; /** * cmp_map_id - Function to be passed to bsearch() to find the requested * idmapping. Expects struct idmap_key to be passed via @k. */ static int cmp_map_id(const void *k, const void *e) { u32 first, last, id2; const struct idmap_key *key = k; const struct uid_gid_extent *el = e; |
11a8b9270 userns: Don't spe... |
222 |
id2 = key->id + key->count - 1; |
6397fac49 userns: bump idma... |
223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 |
/* handle map_id_{down,up}() */ if (key->map_up) first = el->lower_first; else first = el->first; last = first + el->count - 1; if (key->id >= first && key->id <= last && (id2 >= first && id2 <= last)) return 0; if (key->id < first || id2 < first) return -1; return 1; } /** * map_id_range_down_max - Find idmap via binary search in ordered idmap array. * Can only be called if number of mappings exceeds UID_GID_MAP_MAX_BASE_EXTENTS. */ |
3edf652fa userns: Simplify ... |
246 247 |
static struct uid_gid_extent * map_id_range_down_max(unsigned extents, struct uid_gid_map *map, u32 id, u32 count) |
5c1469de7 user_ns: Introduc... |
248 |
{ |
6397fac49 userns: bump idma... |
249 250 251 252 253 |
struct idmap_key key; key.map_up = false; key.count = count; key.id = id; |
3edf652fa userns: Simplify ... |
254 255 |
return bsearch(&key, map->forward, extents, sizeof(struct uid_gid_extent), cmp_map_id); |
6397fac49 userns: bump idma... |
256 257 258 259 260 261 262 |
} /** * map_id_range_down_base - Find idmap via binary search in static extent array. * Can only be called if number of mappings is equal or less than * UID_GID_MAP_MAX_BASE_EXTENTS. */ |
3edf652fa userns: Simplify ... |
263 264 |
static struct uid_gid_extent * map_id_range_down_base(unsigned extents, struct uid_gid_map *map, u32 id, u32 count) |
5c1469de7 user_ns: Introduc... |
265 |
{ |
3edf652fa userns: Simplify ... |
266 |
unsigned idx; |
22d917d80 userns: Rework th... |
267 |
u32 first, last, id2; |
5c1469de7 user_ns: Introduc... |
268 |
|
22d917d80 userns: Rework th... |
269 |
id2 = id + count - 1; |
5c1469de7 user_ns: Introduc... |
270 |
|
22d917d80 userns: Rework th... |
271 |
/* Find the matching extent */ |
22d917d80 userns: Rework th... |
272 273 274 275 276 |
for (idx = 0; idx < extents; idx++) { first = map->extent[idx].first; last = first + map->extent[idx].count - 1; if (id >= first && id <= last && (id2 >= first && id2 <= last)) |
3edf652fa userns: Simplify ... |
277 |
return &map->extent[idx]; |
22d917d80 userns: Rework th... |
278 |
} |
3edf652fa userns: Simplify ... |
279 |
return NULL; |
22d917d80 userns: Rework th... |
280 |
} |
6397fac49 userns: bump idma... |
281 282 |
static u32 map_id_range_down(struct uid_gid_map *map, u32 id, u32 count) { |
3edf652fa userns: Simplify ... |
283 284 |
struct uid_gid_extent *extent; unsigned extents = map->nr_extents; |
6397fac49 userns: bump idma... |
285 286 287 |
smp_rmb(); if (extents <= UID_GID_MAP_MAX_BASE_EXTENTS) |
3edf652fa userns: Simplify ... |
288 289 290 |
extent = map_id_range_down_base(extents, map, id, count); else extent = map_id_range_down_max(extents, map, id, count); |
22d917d80 userns: Rework th... |
291 |
/* Map the id or note failure */ |
3edf652fa userns: Simplify ... |
292 293 |
if (extent) id = (id - extent->first) + extent->lower_first; |
22d917d80 userns: Rework th... |
294 295 296 297 298 299 300 301 |
else id = (u32) -1; return id; } static u32 map_id_down(struct uid_gid_map *map, u32 id) { |
ece661339 userns: Make map_... |
302 |
return map_id_range_down(map, id, 1); |
6397fac49 userns: bump idma... |
303 304 305 306 307 308 309 |
} /** * map_id_up_base - Find idmap via binary search in static extent array. * Can only be called if number of mappings is equal or less than * UID_GID_MAP_MAX_BASE_EXTENTS. */ |
3edf652fa userns: Simplify ... |
310 311 |
static struct uid_gid_extent * map_id_up_base(unsigned extents, struct uid_gid_map *map, u32 id) |
22d917d80 userns: Rework th... |
312 |
{ |
3edf652fa userns: Simplify ... |
313 |
unsigned idx; |
22d917d80 userns: Rework th... |
314 315 316 |
u32 first, last; /* Find the matching extent */ |
22d917d80 userns: Rework th... |
317 |
for (idx = 0; idx < extents; idx++) { |
22d917d80 userns: Rework th... |
318 |
first = map->extent[idx].lower_first; |
22d917d80 userns: Rework th... |
319 320 |
last = first + map->extent[idx].count - 1; if (id >= first && id <= last) |
3edf652fa userns: Simplify ... |
321 |
return &map->extent[idx]; |
22d917d80 userns: Rework th... |
322 |
} |
3edf652fa userns: Simplify ... |
323 |
return NULL; |
22d917d80 userns: Rework th... |
324 |
} |
22d917d80 userns: Rework th... |
325 |
|
22d917d80 userns: Rework th... |
326 |
/** |
6397fac49 userns: bump idma... |
327 328 329 |
* map_id_up_max - Find idmap via binary search in ordered idmap array. * Can only be called if number of mappings exceeds UID_GID_MAP_MAX_BASE_EXTENTS. */ |
3edf652fa userns: Simplify ... |
330 331 |
static struct uid_gid_extent * map_id_up_max(unsigned extents, struct uid_gid_map *map, u32 id) |
6397fac49 userns: bump idma... |
332 |
{ |
6397fac49 userns: bump idma... |
333 334 335 |
struct idmap_key key; key.map_up = true; |
11a8b9270 userns: Don't spe... |
336 |
key.count = 1; |
6397fac49 userns: bump idma... |
337 |
key.id = id; |
3edf652fa userns: Simplify ... |
338 339 |
return bsearch(&key, map->reverse, extents, sizeof(struct uid_gid_extent), cmp_map_id); |
22d917d80 userns: Rework th... |
340 341 342 343 |
} static u32 map_id_up(struct uid_gid_map *map, u32 id) { |
3edf652fa userns: Simplify ... |
344 345 |
struct uid_gid_extent *extent; unsigned extents = map->nr_extents; |
e79323bd8 user namespace: f... |
346 |
smp_rmb(); |
6397fac49 userns: bump idma... |
347 |
|
3edf652fa userns: Simplify ... |
348 349 350 351 |
if (extents <= UID_GID_MAP_MAX_BASE_EXTENTS) extent = map_id_up_base(extents, map, id); else extent = map_id_up_max(extents, map, id); |
22d917d80 userns: Rework th... |
352 |
/* Map the id or note failure */ |
6397fac49 userns: bump idma... |
353 354 |
if (extent) id = (id - extent->lower_first) + extent->first; |
22d917d80 userns: Rework th... |
355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 |
else id = (u32) -1; return id; } /** * make_kuid - Map a user-namespace uid pair into a kuid. * @ns: User namespace that the uid is in * @uid: User identifier * * Maps a user-namespace uid pair into a kernel internal kuid, * and returns that kuid. * * When there is no mapping defined for the user-namespace uid * pair INVALID_UID is returned. Callers are expected to test |
b080e047a user_namespace.c:... |
371 |
* for and handle INVALID_UID being returned. INVALID_UID |
22d917d80 userns: Rework th... |
372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 |
* may be tested for using uid_valid(). */ kuid_t make_kuid(struct user_namespace *ns, uid_t uid) { /* Map the uid to a global kernel uid */ return KUIDT_INIT(map_id_down(&ns->uid_map, uid)); } EXPORT_SYMBOL(make_kuid); /** * from_kuid - Create a uid from a kuid user-namespace pair. * @targ: The user namespace we want a uid in. * @kuid: The kernel internal uid to start with. * * Map @kuid into the user-namespace specified by @targ and * return the resulting uid. * * There is always a mapping into the initial user_namespace. * * If @kuid has no mapping in @targ (uid_t)-1 is returned. */ uid_t from_kuid(struct user_namespace *targ, kuid_t kuid) { /* Map the uid from a global kernel uid */ return map_id_up(&targ->uid_map, __kuid_val(kuid)); } EXPORT_SYMBOL(from_kuid); /** * from_kuid_munged - Create a uid from a kuid user-namespace pair. * @targ: The user namespace we want a uid in. * @kuid: The kernel internal uid to start with. * * Map @kuid into the user-namespace specified by @targ and * return the resulting uid. * * There is always a mapping into the initial user_namespace. * * Unlike from_kuid from_kuid_munged never fails and always * returns a valid uid. This makes from_kuid_munged appropriate * for use in syscalls like stat and getuid where failing the * system call and failing to provide a valid uid are not an * options. * * If @kuid has no mapping in @targ overflowuid is returned. */ uid_t from_kuid_munged(struct user_namespace *targ, kuid_t kuid) { uid_t uid; uid = from_kuid(targ, kuid); if (uid == (uid_t) -1) uid = overflowuid; return uid; } EXPORT_SYMBOL(from_kuid_munged); /** * make_kgid - Map a user-namespace gid pair into a kgid. * @ns: User namespace that the gid is in |
68a9a435e kernel/user_names... |
432 |
* @gid: group identifier |
22d917d80 userns: Rework th... |
433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 |
* * Maps a user-namespace gid pair into a kernel internal kgid, * and returns that kgid. * * When there is no mapping defined for the user-namespace gid * pair INVALID_GID is returned. Callers are expected to test * for and handle INVALID_GID being returned. INVALID_GID may be * tested for using gid_valid(). */ kgid_t make_kgid(struct user_namespace *ns, gid_t gid) { /* Map the gid to a global kernel gid */ return KGIDT_INIT(map_id_down(&ns->gid_map, gid)); } EXPORT_SYMBOL(make_kgid); /** * from_kgid - Create a gid from a kgid user-namespace pair. * @targ: The user namespace we want a gid in. * @kgid: The kernel internal gid to start with. * * Map @kgid into the user-namespace specified by @targ and * return the resulting gid. * * There is always a mapping into the initial user_namespace. * * If @kgid has no mapping in @targ (gid_t)-1 is returned. */ gid_t from_kgid(struct user_namespace *targ, kgid_t kgid) { /* Map the gid from a global kernel gid */ return map_id_up(&targ->gid_map, __kgid_val(kgid)); } EXPORT_SYMBOL(from_kgid); /** * from_kgid_munged - Create a gid from a kgid user-namespace pair. * @targ: The user namespace we want a gid in. * @kgid: The kernel internal gid to start with. * * Map @kgid into the user-namespace specified by @targ and * return the resulting gid. * * There is always a mapping into the initial user_namespace. * * Unlike from_kgid from_kgid_munged never fails and always * returns a valid gid. This makes from_kgid_munged appropriate * for use in syscalls like stat and getgid where failing the * system call and failing to provide a valid gid are not options. * * If @kgid has no mapping in @targ overflowgid is returned. */ gid_t from_kgid_munged(struct user_namespace *targ, kgid_t kgid) { gid_t gid; gid = from_kgid(targ, kgid); if (gid == (gid_t) -1) gid = overflowgid; return gid; } EXPORT_SYMBOL(from_kgid_munged); |
f76d207a6 userns: Add kproj... |
495 496 497 498 499 500 501 502 503 504 |
/** * make_kprojid - Map a user-namespace projid pair into a kprojid. * @ns: User namespace that the projid is in * @projid: Project identifier * * Maps a user-namespace uid pair into a kernel internal kuid, * and returns that kuid. * * When there is no mapping defined for the user-namespace projid * pair INVALID_PROJID is returned. Callers are expected to test |
7b7b8a2c9 kernel/: fix repe... |
505 |
* for and handle INVALID_PROJID being returned. INVALID_PROJID |
f76d207a6 userns: Add kproj... |
506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 |
* may be tested for using projid_valid(). */ kprojid_t make_kprojid(struct user_namespace *ns, projid_t projid) { /* Map the uid to a global kernel uid */ return KPROJIDT_INIT(map_id_down(&ns->projid_map, projid)); } EXPORT_SYMBOL(make_kprojid); /** * from_kprojid - Create a projid from a kprojid user-namespace pair. * @targ: The user namespace we want a projid in. * @kprojid: The kernel internal project identifier to start with. * * Map @kprojid into the user-namespace specified by @targ and * return the resulting projid. * * There is always a mapping into the initial user_namespace. * * If @kprojid has no mapping in @targ (projid_t)-1 is returned. */ projid_t from_kprojid(struct user_namespace *targ, kprojid_t kprojid) { /* Map the uid from a global kernel uid */ return map_id_up(&targ->projid_map, __kprojid_val(kprojid)); } EXPORT_SYMBOL(from_kprojid); /** * from_kprojid_munged - Create a projiid from a kprojid user-namespace pair. * @targ: The user namespace we want a projid in. * @kprojid: The kernel internal projid to start with. * * Map @kprojid into the user-namespace specified by @targ and * return the resulting projid. * * There is always a mapping into the initial user_namespace. * * Unlike from_kprojid from_kprojid_munged never fails and always * returns a valid projid. This makes from_kprojid_munged * appropriate for use in syscalls like stat and where * failing the system call and failing to provide a valid projid are * not an options. * * If @kprojid has no mapping in @targ OVERFLOW_PROJID is returned. */ projid_t from_kprojid_munged(struct user_namespace *targ, kprojid_t kprojid) { projid_t projid; projid = from_kprojid(targ, kprojid); if (projid == (projid_t) -1) projid = OVERFLOW_PROJID; return projid; } EXPORT_SYMBOL(from_kprojid_munged); |
22d917d80 userns: Rework th... |
562 563 564 565 566 567 |
static int uid_m_show(struct seq_file *seq, void *v) { struct user_namespace *ns = seq->private; struct uid_gid_extent *extent = v; struct user_namespace *lower_ns; uid_t lower; |
5c1469de7 user_ns: Introduc... |
568 |
|
c450f371d userns: For /proc... |
569 |
lower_ns = seq_user_ns(seq); |
22d917d80 userns: Rework th... |
570 571 572 573 574 575 576 577 578 579 580 581 |
if ((lower_ns == ns) && lower_ns->parent) lower_ns = lower_ns->parent; lower = from_kuid(lower_ns, KUIDT_INIT(extent->lower_first)); seq_printf(seq, "%10u %10u %10u ", extent->first, lower, extent->count); return 0; |
5c1469de7 user_ns: Introduc... |
582 |
} |
22d917d80 userns: Rework th... |
583 |
static int gid_m_show(struct seq_file *seq, void *v) |
5c1469de7 user_ns: Introduc... |
584 |
{ |
22d917d80 userns: Rework th... |
585 586 587 588 |
struct user_namespace *ns = seq->private; struct uid_gid_extent *extent = v; struct user_namespace *lower_ns; gid_t lower; |
5c1469de7 user_ns: Introduc... |
589 |
|
c450f371d userns: For /proc... |
590 |
lower_ns = seq_user_ns(seq); |
22d917d80 userns: Rework th... |
591 592 |
if ((lower_ns == ns) && lower_ns->parent) lower_ns = lower_ns->parent; |
5c1469de7 user_ns: Introduc... |
593 |
|
22d917d80 userns: Rework th... |
594 595 596 597 598 599 600 601 602 603 |
lower = from_kgid(lower_ns, KGIDT_INIT(extent->lower_first)); seq_printf(seq, "%10u %10u %10u ", extent->first, lower, extent->count); return 0; } |
f76d207a6 userns: Add kproj... |
604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 |
static int projid_m_show(struct seq_file *seq, void *v) { struct user_namespace *ns = seq->private; struct uid_gid_extent *extent = v; struct user_namespace *lower_ns; projid_t lower; lower_ns = seq_user_ns(seq); if ((lower_ns == ns) && lower_ns->parent) lower_ns = lower_ns->parent; lower = from_kprojid(lower_ns, KPROJIDT_INIT(extent->lower_first)); seq_printf(seq, "%10u %10u %10u ", extent->first, lower, extent->count); return 0; } |
68a9a435e kernel/user_names... |
625 626 |
static void *m_start(struct seq_file *seq, loff_t *ppos, struct uid_gid_map *map) |
22d917d80 userns: Rework th... |
627 |
{ |
22d917d80 userns: Rework th... |
628 |
loff_t pos = *ppos; |
d5e7b3c5f userns: Don't rea... |
629 630 |
unsigned extents = map->nr_extents; smp_rmb(); |
22d917d80 userns: Rework th... |
631 |
|
d5e7b3c5f userns: Don't rea... |
632 |
if (pos >= extents) |
6397fac49 userns: bump idma... |
633 |
return NULL; |
22d917d80 userns: Rework th... |
634 |
|
d5e7b3c5f userns: Don't rea... |
635 |
if (extents <= UID_GID_MAP_MAX_BASE_EXTENTS) |
6397fac49 userns: bump idma... |
636 |
return &map->extent[pos]; |
22d917d80 userns: Rework th... |
637 |
|
6397fac49 userns: bump idma... |
638 |
return &map->forward[pos]; |
22d917d80 userns: Rework th... |
639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 |
} static void *uid_m_start(struct seq_file *seq, loff_t *ppos) { struct user_namespace *ns = seq->private; return m_start(seq, ppos, &ns->uid_map); } static void *gid_m_start(struct seq_file *seq, loff_t *ppos) { struct user_namespace *ns = seq->private; return m_start(seq, ppos, &ns->gid_map); } |
f76d207a6 userns: Add kproj... |
654 655 656 657 658 659 |
static void *projid_m_start(struct seq_file *seq, loff_t *ppos) { struct user_namespace *ns = seq->private; return m_start(seq, ppos, &ns->projid_map); } |
22d917d80 userns: Rework th... |
660 661 662 663 664 665 666 667 668 669 |
static void *m_next(struct seq_file *seq, void *v, loff_t *pos) { (*pos)++; return seq->op->start(seq, pos); } static void m_stop(struct seq_file *seq, void *v) { return; } |
ccf94f1b4 proc: constify se... |
670 |
const struct seq_operations proc_uid_seq_operations = { |
22d917d80 userns: Rework th... |
671 672 673 674 675 |
.start = uid_m_start, .stop = m_stop, .next = m_next, .show = uid_m_show, }; |
ccf94f1b4 proc: constify se... |
676 |
const struct seq_operations proc_gid_seq_operations = { |
22d917d80 userns: Rework th... |
677 678 679 680 681 |
.start = gid_m_start, .stop = m_stop, .next = m_next, .show = gid_m_show, }; |
ccf94f1b4 proc: constify se... |
682 |
const struct seq_operations proc_projid_seq_operations = { |
f76d207a6 userns: Add kproj... |
683 684 685 686 687 |
.start = projid_m_start, .stop = m_stop, .next = m_next, .show = projid_m_show, }; |
68a9a435e kernel/user_names... |
688 689 |
static bool mappings_overlap(struct uid_gid_map *new_map, struct uid_gid_extent *extent) |
0bd14b4fd userns: Allow any... |
690 691 692 693 694 695 696 697 698 699 700 701 702 |
{ u32 upper_first, lower_first, upper_last, lower_last; unsigned idx; upper_first = extent->first; lower_first = extent->lower_first; upper_last = upper_first + extent->count - 1; lower_last = lower_first + extent->count - 1; for (idx = 0; idx < new_map->nr_extents; idx++) { u32 prev_upper_first, prev_lower_first; u32 prev_upper_last, prev_lower_last; struct uid_gid_extent *prev; |
6397fac49 userns: bump idma... |
703 704 705 706 |
if (new_map->nr_extents <= UID_GID_MAP_MAX_BASE_EXTENTS) prev = &new_map->extent[idx]; else prev = &new_map->forward[idx]; |
0bd14b4fd userns: Allow any... |
707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 |
prev_upper_first = prev->first; prev_lower_first = prev->lower_first; prev_upper_last = prev_upper_first + prev->count - 1; prev_lower_last = prev_lower_first + prev->count - 1; /* Does the upper range intersect a previous extent? */ if ((prev_upper_first <= upper_last) && (prev_upper_last >= upper_first)) return true; /* Does the lower range intersect a previous extent? */ if ((prev_lower_first <= lower_last) && (prev_lower_last >= lower_first)) return true; } return false; } |
6397fac49 userns: bump idma... |
725 726 727 728 729 730 731 |
/** * insert_extent - Safely insert a new idmap extent into struct uid_gid_map. * Takes care to allocate a 4K block of memory if the number of mappings exceeds * UID_GID_MAP_MAX_BASE_EXTENTS. */ static int insert_extent(struct uid_gid_map *map, struct uid_gid_extent *extent) { |
3fda0e737 userns: Simplify ... |
732 |
struct uid_gid_extent *dest; |
6397fac49 userns: bump idma... |
733 734 735 736 737 |
if (map->nr_extents == UID_GID_MAP_MAX_BASE_EXTENTS) { struct uid_gid_extent *forward; /* Allocate memory for 340 mappings. */ |
6da2ec560 treewide: kmalloc... |
738 739 740 |
forward = kmalloc_array(UID_GID_MAP_MAX_EXTENTS, sizeof(struct uid_gid_extent), GFP_KERNEL); |
6397fac49 userns: bump idma... |
741 742 743 744 745 746 747 748 749 750 751 752 |
if (!forward) return -ENOMEM; /* Copy over memory. Only set up memory for the forward pointer. * Defer the memory setup for the reverse pointer. */ memcpy(forward, map->extent, map->nr_extents * sizeof(map->extent[0])); map->forward = forward; map->reverse = NULL; } |
3fda0e737 userns: Simplify ... |
753 754 755 756 757 758 759 |
if (map->nr_extents < UID_GID_MAP_MAX_BASE_EXTENTS) dest = &map->extent[map->nr_extents]; else dest = &map->forward[map->nr_extents]; *dest = *extent; map->nr_extents++; |
6397fac49 userns: bump idma... |
760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 |
return 0; } /* cmp function to sort() forward mappings */ static int cmp_extents_forward(const void *a, const void *b) { const struct uid_gid_extent *e1 = a; const struct uid_gid_extent *e2 = b; if (e1->first < e2->first) return -1; if (e1->first > e2->first) return 1; return 0; } /* cmp function to sort() reverse mappings */ static int cmp_extents_reverse(const void *a, const void *b) { const struct uid_gid_extent *e1 = a; const struct uid_gid_extent *e2 = b; if (e1->lower_first < e2->lower_first) return -1; if (e1->lower_first > e2->lower_first) return 1; return 0; } /** * sort_idmaps - Sorts an array of idmap entries. * Can only be called if number of mappings exceeds UID_GID_MAP_MAX_BASE_EXTENTS. */ static int sort_idmaps(struct uid_gid_map *map) { if (map->nr_extents <= UID_GID_MAP_MAX_BASE_EXTENTS) return 0; /* Sort forward array. */ sort(map->forward, map->nr_extents, sizeof(struct uid_gid_extent), cmp_extents_forward, NULL); /* Only copy the memory from forward we actually need. */ map->reverse = kmemdup(map->forward, map->nr_extents * sizeof(struct uid_gid_extent), GFP_KERNEL); if (!map->reverse) return -ENOMEM; /* Sort reverse array. */ sort(map->reverse, map->nr_extents, sizeof(struct uid_gid_extent), cmp_extents_reverse, NULL); return 0; } |
22d917d80 userns: Rework th... |
819 820 821 822 823 824 825 826 827 828 |
static ssize_t map_write(struct file *file, const char __user *buf, size_t count, loff_t *ppos, int cap_setid, struct uid_gid_map *map, struct uid_gid_map *parent_map) { struct seq_file *seq = file->private_data; struct user_namespace *ns = seq->private; struct uid_gid_map new_map; unsigned idx; |
6397fac49 userns: bump idma... |
829 |
struct uid_gid_extent extent; |
70f6cbb6f kernel/*: switch ... |
830 |
char *kbuf = NULL, *pos, *next_line; |
5820f140e userns: move user... |
831 832 833 834 835 836 837 838 839 840 |
ssize_t ret; /* Only allow < page size writes at the beginning of the file */ if ((*ppos != 0) || (count >= PAGE_SIZE)) return -EINVAL; /* Slurp in the user data */ kbuf = memdup_user_nul(buf, count); if (IS_ERR(kbuf)) return PTR_ERR(kbuf); |
22d917d80 userns: Rework th... |
841 842 |
/* |
f0d62aec9 userns: Rename id... |
843 |
* The userns_state_mutex serializes all writes to any given map. |
22d917d80 userns: Rework th... |
844 845 846 847 848 849 850 851 852 853 854 855 856 857 |
* * Any map is only ever written once. * * An id map fits within 1 cache line on most architectures. * * On read nothing needs to be done unless you are on an * architecture with a crazy cache coherency model like alpha. * * There is a one time data dependency between reading the * count of the extents and the values of the extents. The * desired behavior is to see the values of the extents that * were written before the count of the extents. * * To achieve this smp_wmb() is used on guarantee the write |
e79323bd8 user namespace: f... |
858 859 |
* order and smp_rmb() is guaranteed that we don't have crazy * architectures returning stale data. |
22d917d80 userns: Rework th... |
860 |
*/ |
f0d62aec9 userns: Rename id... |
861 |
mutex_lock(&userns_state_mutex); |
22d917d80 userns: Rework th... |
862 |
|
6397fac49 userns: bump idma... |
863 |
memset(&new_map, 0, sizeof(struct uid_gid_map)); |
22d917d80 userns: Rework th... |
864 865 866 867 |
ret = -EPERM; /* Only allow one successful write to the map */ if (map->nr_extents != 0) goto out; |
41c21e351 userns: Changing ... |
868 869 |
/* * Adjusting namespace settings requires capabilities on the target. |
5c1469de7 user_ns: Introduc... |
870 |
*/ |
41c21e351 userns: Changing ... |
871 |
if (cap_valid(cap_setid) && !file_ns_capable(file, ns, CAP_SYS_ADMIN)) |
22d917d80 userns: Rework th... |
872 |
goto out; |
22d917d80 userns: Rework th... |
873 874 875 |
/* Parse the user data */ ret = -EINVAL; pos = kbuf; |
68a9a435e kernel/user_names... |
876 |
for (; pos; pos = next_line) { |
22d917d80 userns: Rework th... |
877 878 879 880 881 882 883 884 885 |
/* Find the end of line and ensure I don't look past it */ next_line = strchr(pos, ' '); if (next_line) { *next_line = '\0'; next_line++; if (*next_line == '\0') next_line = NULL; |
5c1469de7 user_ns: Introduc... |
886 |
} |
22d917d80 userns: Rework th... |
887 888 |
pos = skip_spaces(pos); |
6397fac49 userns: bump idma... |
889 |
extent.first = simple_strtoul(pos, &pos, 10); |
22d917d80 userns: Rework th... |
890 891 892 893 |
if (!isspace(*pos)) goto out; pos = skip_spaces(pos); |
6397fac49 userns: bump idma... |
894 |
extent.lower_first = simple_strtoul(pos, &pos, 10); |
22d917d80 userns: Rework th... |
895 896 897 898 |
if (!isspace(*pos)) goto out; pos = skip_spaces(pos); |
6397fac49 userns: bump idma... |
899 |
extent.count = simple_strtoul(pos, &pos, 10); |
22d917d80 userns: Rework th... |
900 901 902 903 904 905 906 907 908 |
if (*pos && !isspace(*pos)) goto out; /* Verify there is not trailing junk on the line */ pos = skip_spaces(pos); if (*pos != '\0') goto out; /* Verify we have been given valid starting values */ |
6397fac49 userns: bump idma... |
909 910 |
if ((extent.first == (u32) -1) || (extent.lower_first == (u32) -1)) |
22d917d80 userns: Rework th... |
911 |
goto out; |
68a9a435e kernel/user_names... |
912 913 914 |
/* Verify count is not zero and does not cause the * extent to wrap */ |
6397fac49 userns: bump idma... |
915 |
if ((extent.first + extent.count) <= extent.first) |
22d917d80 userns: Rework th... |
916 |
goto out; |
6397fac49 userns: bump idma... |
917 918 |
if ((extent.lower_first + extent.count) <= extent.lower_first) |
22d917d80 userns: Rework th... |
919 |
goto out; |
0bd14b4fd userns: Allow any... |
920 |
/* Do the ranges in extent overlap any previous extents? */ |
6397fac49 userns: bump idma... |
921 |
if (mappings_overlap(&new_map, &extent)) |
22d917d80 userns: Rework th... |
922 |
goto out; |
6397fac49 userns: bump idma... |
923 |
if ((new_map.nr_extents + 1) == UID_GID_MAP_MAX_EXTENTS && |
22d917d80 userns: Rework th... |
924 925 |
(next_line != NULL)) goto out; |
6397fac49 userns: bump idma... |
926 927 928 929 930 |
ret = insert_extent(&new_map, &extent); if (ret < 0) goto out; ret = -EINVAL; |
5c1469de7 user_ns: Introduc... |
931 |
} |
22d917d80 userns: Rework th... |
932 933 934 935 936 937 |
/* Be very certaint the new map actually exists */ if (new_map.nr_extents == 0) goto out; ret = -EPERM; /* Validate the user is allowed to use user id's mapped to. */ |
6708075f1 userns: Don't let... |
938 |
if (!new_idmap_permitted(file, ns, cap_setid, &new_map)) |
22d917d80 userns: Rework th... |
939 |
goto out; |
6397fac49 userns: bump idma... |
940 |
ret = -EPERM; |
22d917d80 userns: Rework th... |
941 942 943 944 |
/* Map the lower ids from the parent user namespace to the * kernel global id space. */ for (idx = 0; idx < new_map.nr_extents; idx++) { |
6397fac49 userns: bump idma... |
945 |
struct uid_gid_extent *e; |
22d917d80 userns: Rework th... |
946 |
u32 lower_first; |
6397fac49 userns: bump idma... |
947 948 949 950 951 |
if (new_map.nr_extents <= UID_GID_MAP_MAX_BASE_EXTENTS) e = &new_map.extent[idx]; else e = &new_map.forward[idx]; |
22d917d80 userns: Rework th... |
952 953 |
lower_first = map_id_range_down(parent_map, |
6397fac49 userns: bump idma... |
954 955 |
e->lower_first, e->count); |
22d917d80 userns: Rework th... |
956 957 958 959 960 961 |
/* Fail if we can not map the specified extent to * the kernel global id space. */ if (lower_first == (u32) -1) goto out; |
6397fac49 userns: bump idma... |
962 |
e->lower_first = lower_first; |
22d917d80 userns: Rework th... |
963 |
} |
d2f007dbe userns: also map ... |
964 965 966 967 968 969 970 |
/* * If we want to use binary search for lookup, this clones the extent * array and sorts both copies. */ ret = sort_idmaps(&new_map); if (ret < 0) goto out; |
22d917d80 userns: Rework th... |
971 |
/* Install the map */ |
6397fac49 userns: bump idma... |
972 973 974 975 976 977 978 |
if (new_map.nr_extents <= UID_GID_MAP_MAX_BASE_EXTENTS) { memcpy(map->extent, new_map.extent, new_map.nr_extents * sizeof(new_map.extent[0])); } else { map->forward = new_map.forward; map->reverse = new_map.reverse; } |
22d917d80 userns: Rework th... |
979 980 981 982 983 984 |
smp_wmb(); map->nr_extents = new_map.nr_extents; *ppos = count; ret = count; out: |
6397fac49 userns: bump idma... |
985 986 987 988 989 990 991 |
if (ret < 0 && new_map.nr_extents > UID_GID_MAP_MAX_BASE_EXTENTS) { kfree(new_map.forward); kfree(new_map.reverse); map->forward = NULL; map->reverse = NULL; map->nr_extents = 0; } |
f0d62aec9 userns: Rename id... |
992 |
mutex_unlock(&userns_state_mutex); |
70f6cbb6f kernel/*: switch ... |
993 |
kfree(kbuf); |
22d917d80 userns: Rework th... |
994 995 |
return ret; } |
68a9a435e kernel/user_names... |
996 997 |
ssize_t proc_uid_map_write(struct file *file, const char __user *buf, size_t size, loff_t *ppos) |
22d917d80 userns: Rework th... |
998 999 1000 |
{ struct seq_file *seq = file->private_data; struct user_namespace *ns = seq->private; |
c450f371d userns: For /proc... |
1001 |
struct user_namespace *seq_ns = seq_user_ns(seq); |
22d917d80 userns: Rework th... |
1002 1003 1004 |
if (!ns->parent) return -EPERM; |
c450f371d userns: For /proc... |
1005 1006 |
if ((seq_ns != ns) && (seq_ns != ns->parent)) return -EPERM; |
22d917d80 userns: Rework th... |
1007 1008 1009 |
return map_write(file, buf, size, ppos, CAP_SETUID, &ns->uid_map, &ns->parent->uid_map); } |
68a9a435e kernel/user_names... |
1010 1011 |
ssize_t proc_gid_map_write(struct file *file, const char __user *buf, size_t size, loff_t *ppos) |
22d917d80 userns: Rework th... |
1012 1013 1014 |
{ struct seq_file *seq = file->private_data; struct user_namespace *ns = seq->private; |
c450f371d userns: For /proc... |
1015 |
struct user_namespace *seq_ns = seq_user_ns(seq); |
22d917d80 userns: Rework th... |
1016 1017 1018 |
if (!ns->parent) return -EPERM; |
c450f371d userns: For /proc... |
1019 1020 |
if ((seq_ns != ns) && (seq_ns != ns->parent)) return -EPERM; |
22d917d80 userns: Rework th... |
1021 1022 1023 |
return map_write(file, buf, size, ppos, CAP_SETGID, &ns->gid_map, &ns->parent->gid_map); } |
68a9a435e kernel/user_names... |
1024 1025 |
ssize_t proc_projid_map_write(struct file *file, const char __user *buf, size_t size, loff_t *ppos) |
f76d207a6 userns: Add kproj... |
1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 |
{ struct seq_file *seq = file->private_data; struct user_namespace *ns = seq->private; struct user_namespace *seq_ns = seq_user_ns(seq); if (!ns->parent) return -EPERM; if ((seq_ns != ns) && (seq_ns != ns->parent)) return -EPERM; /* Anyone can set any valid project id no capability needed */ return map_write(file, buf, size, ppos, -1, &ns->projid_map, &ns->parent->projid_map); } |
68a9a435e kernel/user_names... |
1041 |
static bool new_idmap_permitted(const struct file *file, |
6708075f1 userns: Don't let... |
1042 |
struct user_namespace *ns, int cap_setid, |
22d917d80 userns: Rework th... |
1043 1044 |
struct uid_gid_map *new_map) { |
f95d7918b userns: Only allo... |
1045 |
const struct cred *cred = file->f_cred; |
0542f17bf userns: Document ... |
1046 1047 1048 |
/* Don't allow mappings that would allow anything that wouldn't * be allowed without the establishment of unprivileged mappings. */ |
f95d7918b userns: Only allo... |
1049 1050 |
if ((new_map->nr_extents == 1) && (new_map->extent[0].count == 1) && uid_eq(ns->owner, cred->euid)) { |
37657da3c userns: Allow set... |
1051 1052 1053 |
u32 id = new_map->extent[0].lower_first; if (cap_setid == CAP_SETUID) { kuid_t uid = make_kuid(ns->parent, id); |
f95d7918b userns: Only allo... |
1054 |
if (uid_eq(uid, cred->euid)) |
37657da3c userns: Allow set... |
1055 |
return true; |
68a9a435e kernel/user_names... |
1056 |
} else if (cap_setid == CAP_SETGID) { |
37657da3c userns: Allow set... |
1057 |
kgid_t gid = make_kgid(ns->parent, id); |
66d2f338e userns: Allow set... |
1058 1059 |
if (!(ns->flags & USERNS_SETGROUPS_ALLOWED) && gid_eq(gid, cred->egid)) |
37657da3c userns: Allow set... |
1060 1061 1062 |
return true; } } |
f76d207a6 userns: Add kproj... |
1063 1064 1065 |
/* Allow anyone to set a mapping that doesn't require privilege */ if (!cap_valid(cap_setid)) return true; |
22d917d80 userns: Rework th... |
1066 1067 |
/* Allow the specified ids if we have the appropriate capability * (CAP_SETUID or CAP_SETGID) over the parent user namespace. |
6708075f1 userns: Don't let... |
1068 |
* And the opener of the id file also had the approprpiate capability. |
22d917d80 userns: Rework th... |
1069 |
*/ |
6708075f1 userns: Don't let... |
1070 1071 |
if (ns_capable(ns->parent, cap_setid) && file_ns_capable(file, ns->parent, cap_setid)) |
22d917d80 userns: Rework th... |
1072 |
return true; |
5c1469de7 user_ns: Introduc... |
1073 |
|
22d917d80 userns: Rework th... |
1074 |
return false; |
5c1469de7 user_ns: Introduc... |
1075 |
} |
6164281ab user_ns: improve ... |
1076 |
|
9cc46516d userns: Add a kno... |
1077 1078 1079 |
int proc_setgroups_show(struct seq_file *seq, void *v) { struct user_namespace *ns = seq->private; |
6aa7de059 locking/atomics: ... |
1080 |
unsigned long userns_flags = READ_ONCE(ns->flags); |
9cc46516d userns: Add a kno... |
1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 |
seq_printf(seq, "%s ", (userns_flags & USERNS_SETGROUPS_ALLOWED) ? "allow" : "deny"); return 0; } ssize_t proc_setgroups_write(struct file *file, const char __user *buf, size_t count, loff_t *ppos) { struct seq_file *seq = file->private_data; struct user_namespace *ns = seq->private; char kbuf[8], *pos; bool setgroups_allowed; ssize_t ret; /* Only allow a very narrow range of strings to be written */ ret = -EINVAL; if ((*ppos != 0) || (count >= sizeof(kbuf))) goto out; /* What was written? */ ret = -EFAULT; if (copy_from_user(kbuf, buf, count)) goto out; kbuf[count] = '\0'; pos = kbuf; /* What is being requested? */ ret = -EINVAL; if (strncmp(pos, "allow", 5) == 0) { pos += 5; setgroups_allowed = true; } else if (strncmp(pos, "deny", 4) == 0) { pos += 4; setgroups_allowed = false; } else goto out; /* Verify there is not trailing junk on the line */ pos = skip_spaces(pos); if (*pos != '\0') goto out; ret = -EPERM; mutex_lock(&userns_state_mutex); if (setgroups_allowed) { /* Enabling setgroups after setgroups has been disabled * is not allowed. */ if (!(ns->flags & USERNS_SETGROUPS_ALLOWED)) goto out_unlock; } else { /* Permanently disabling setgroups after setgroups has * been enabled by writing the gid_map is not allowed. */ if (ns->gid_map.nr_extents != 0) goto out_unlock; ns->flags &= ~USERNS_SETGROUPS_ALLOWED; } mutex_unlock(&userns_state_mutex); /* Report a successful write */ *ppos = count; ret = count; out: return ret; out_unlock: mutex_unlock(&userns_state_mutex); goto out; } |
273d2c67c userns: Don't all... |
1155 1156 1157 |
bool userns_may_setgroups(const struct user_namespace *ns) { bool allowed; |
f0d62aec9 userns: Rename id... |
1158 |
mutex_lock(&userns_state_mutex); |
273d2c67c userns: Don't all... |
1159 1160 1161 1162 |
/* It is not safe to use setgroups until a gid mapping in * the user namespace has been established. */ allowed = ns->gid_map.nr_extents != 0; |
9cc46516d userns: Add a kno... |
1163 1164 |
/* Is setgroups allowed? */ allowed = allowed && (ns->flags & USERNS_SETGROUPS_ALLOWED); |
f0d62aec9 userns: Rename id... |
1165 |
mutex_unlock(&userns_state_mutex); |
273d2c67c userns: Don't all... |
1166 1167 1168 |
return allowed; } |
d07b846f6 fs: Limit file ca... |
1169 |
/* |
a2b426267 userns,pidns: Ver... |
1170 1171 |
* Returns true if @child is the same namespace or a descendant of * @ancestor. |
d07b846f6 fs: Limit file ca... |
1172 |
*/ |
a2b426267 userns,pidns: Ver... |
1173 1174 1175 1176 1177 1178 1179 1180 |
bool in_userns(const struct user_namespace *ancestor, const struct user_namespace *child) { const struct user_namespace *ns; for (ns = child; ns->level > ancestor->level; ns = ns->parent) ; return (ns == ancestor); } |
d07b846f6 fs: Limit file ca... |
1181 1182 |
bool current_in_userns(const struct user_namespace *target_ns) { |
a2b426267 userns,pidns: Ver... |
1183 |
return in_userns(target_ns, current_user_ns()); |
d07b846f6 fs: Limit file ca... |
1184 |
} |
73f03c2b4 fuse: Restrict al... |
1185 |
EXPORT_SYMBOL(current_in_userns); |
d07b846f6 fs: Limit file ca... |
1186 |
|
3c0411846 switch the rest o... |
1187 1188 1189 1190 |
static inline struct user_namespace *to_user_ns(struct ns_common *ns) { return container_of(ns, struct user_namespace, ns); } |
64964528b make proc_ns_oper... |
1191 |
static struct ns_common *userns_get(struct task_struct *task) |
cde1975bc userns: Implent p... |
1192 1193 1194 1195 1196 1197 |
{ struct user_namespace *user_ns; rcu_read_lock(); user_ns = get_user_ns(__task_cred(task)->user_ns); rcu_read_unlock(); |
3c0411846 switch the rest o... |
1198 |
return user_ns ? &user_ns->ns : NULL; |
cde1975bc userns: Implent p... |
1199 |
} |
64964528b make proc_ns_oper... |
1200 |
static void userns_put(struct ns_common *ns) |
cde1975bc userns: Implent p... |
1201 |
{ |
3c0411846 switch the rest o... |
1202 |
put_user_ns(to_user_ns(ns)); |
cde1975bc userns: Implent p... |
1203 |
} |
f2a8d52e0 nsproxy: add stru... |
1204 |
static int userns_install(struct nsset *nsset, struct ns_common *ns) |
cde1975bc userns: Implent p... |
1205 |
{ |
3c0411846 switch the rest o... |
1206 |
struct user_namespace *user_ns = to_user_ns(ns); |
cde1975bc userns: Implent p... |
1207 1208 1209 1210 1211 1212 1213 |
struct cred *cred; /* Don't allow gaining capabilities by reentering * the same user namespace. */ if (user_ns == current_user_ns()) return -EINVAL; |
faf00da54 userns,pidns: For... |
1214 1215 |
/* Tasks that share a thread group must share a user namespace */ if (!thread_group_empty(current)) |
cde1975bc userns: Implent p... |
1216 |
return -EINVAL; |
e66eded83 userns: Don't all... |
1217 1218 |
if (current->fs->users != 1) return -EINVAL; |
cde1975bc userns: Implent p... |
1219 1220 |
if (!ns_capable(user_ns, CAP_SYS_ADMIN)) return -EPERM; |
f2a8d52e0 nsproxy: add stru... |
1221 |
cred = nsset_cred(nsset); |
cde1975bc userns: Implent p... |
1222 |
if (!cred) |
f2a8d52e0 nsproxy: add stru... |
1223 |
return -EINVAL; |
cde1975bc userns: Implent p... |
1224 1225 1226 |
put_user_ns(cred->user_ns); set_cred_user_ns(cred, get_user_ns(user_ns)); |
f2a8d52e0 nsproxy: add stru... |
1227 |
return 0; |
cde1975bc userns: Implent p... |
1228 |
} |
bcac25a58 kernel: add a hel... |
1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 |
struct ns_common *ns_get_owner(struct ns_common *ns) { struct user_namespace *my_user_ns = current_user_ns(); struct user_namespace *owner, *p; /* See if the owner is in the current user namespace */ owner = p = ns->ops->owner(ns); for (;;) { if (!p) return ERR_PTR(-EPERM); if (p == my_user_ns) break; p = p->parent; } return &get_user_ns(owner)->ns; } static struct user_namespace *userns_owner(struct ns_common *ns) { return to_user_ns(ns)->parent; } |
cde1975bc userns: Implent p... |
1251 1252 1253 1254 1255 1256 |
const struct proc_ns_operations userns_operations = { .name = "user", .type = CLONE_NEWUSER, .get = userns_get, .put = userns_put, .install = userns_install, |
bcac25a58 kernel: add a hel... |
1257 |
.owner = userns_owner, |
a7306ed8d nsfs: add ioctl t... |
1258 |
.get_parent = ns_get_owner, |
cde1975bc userns: Implent p... |
1259 |
}; |
6164281ab user_ns: improve ... |
1260 1261 1262 1263 1264 |
static __init int user_namespaces_init(void) { user_ns_cachep = KMEM_CACHE(user_namespace, SLAB_PANIC); return 0; } |
c96d6660d kernel: audit/fix... |
1265 |
subsys_initcall(user_namespaces_init); |