Blame view
kernel/user_namespace.c
22.8 KB
acce292c8 user namespace: a... |
1 2 3 4 5 6 |
/* * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License as * published by the Free Software Foundation, version 2 of the * License. */ |
9984de1a5 kernel: Map most ... |
7 |
#include <linux/export.h> |
acce292c8 user namespace: a... |
8 |
#include <linux/nsproxy.h> |
1aeb272cf kernel: explicitl... |
9 |
#include <linux/slab.h> |
acce292c8 user namespace: a... |
10 |
#include <linux/user_namespace.h> |
0bb80f240 proc: Split the n... |
11 |
#include <linux/proc_ns.h> |
5c1469de7 user_ns: Introduc... |
12 |
#include <linux/highuid.h> |
18b6e0414 User namespaces: ... |
13 |
#include <linux/cred.h> |
973c59142 userns: Start out... |
14 |
#include <linux/securebits.h> |
22d917d80 userns: Rework th... |
15 16 17 18 19 20 21 |
#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... |
22 |
#include <linux/projid.h> |
e66eded83 userns: Don't all... |
23 |
#include <linux/fs_struct.h> |
acce292c8 user namespace: a... |
24 |
|
6164281ab user_ns: improve ... |
25 |
static struct kmem_cache *user_ns_cachep __read_mostly; |
6708075f1 userns: Don't let... |
26 27 |
static bool new_idmap_permitted(const struct file *file, struct user_namespace *ns, int cap_setid, |
22d917d80 userns: Rework th... |
28 |
struct uid_gid_map *map); |
cde1975bc userns: Implent p... |
29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 |
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; 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... |
46 |
/* |
18b6e0414 User namespaces: ... |
47 48 49 50 51 52 |
* 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... |
53 |
*/ |
18b6e0414 User namespaces: ... |
54 |
int create_user_ns(struct cred *new) |
77ec739d8 user namespace: a... |
55 |
{ |
0093ccb68 cred: Refcount th... |
56 |
struct user_namespace *ns, *parent_ns = new->user_ns; |
078de5f70 userns: Store uid... |
57 58 |
kuid_t owner = new->euid; kgid_t group = new->egid; |
98f842e67 proc: Usable inod... |
59 |
int ret; |
783291e69 userns: Simplify ... |
60 |
|
8742f229b userns: limit the... |
61 62 |
if (parent_ns->level > 32) return -EUSERS; |
3151527ee userns: Don't al... |
63 64 65 66 67 68 69 70 |
/* * 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. */ if (current_chrooted()) return -EPERM; |
783291e69 userns: Simplify ... |
71 72 73 74 75 76 77 |
/* 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. */ if (!kuid_has_mapping(parent_ns, owner) || !kgid_has_mapping(parent_ns, group)) return -EPERM; |
77ec739d8 user namespace: a... |
78 |
|
22d917d80 userns: Rework th... |
79 |
ns = kmem_cache_zalloc(user_ns_cachep, GFP_KERNEL); |
77ec739d8 user namespace: a... |
80 |
if (!ns) |
18b6e0414 User namespaces: ... |
81 |
return -ENOMEM; |
77ec739d8 user namespace: a... |
82 |
|
98f842e67 proc: Usable inod... |
83 84 85 86 87 |
ret = proc_alloc_inum(&ns->proc_inum); if (ret) { kmem_cache_free(user_ns_cachep, ns); return ret; } |
c61a2810a userns: Avoid rec... |
88 |
atomic_set(&ns->count, 1); |
cde1975bc userns: Implent p... |
89 |
/* Leave the new->user_ns reference with the new user namespace. */ |
aeb3ae9da userns: Add an ex... |
90 |
ns->parent = parent_ns; |
8742f229b userns: limit the... |
91 |
ns->level = parent_ns->level + 1; |
783291e69 userns: Simplify ... |
92 93 |
ns->owner = owner; ns->group = group; |
22d917d80 userns: Rework th... |
94 |
|
cde1975bc userns: Implent p... |
95 |
set_cred_user_ns(new, ns); |
0093ccb68 cred: Refcount th... |
96 |
|
18b6e0414 User namespaces: ... |
97 |
return 0; |
acce292c8 user namespace: a... |
98 |
} |
b2e0d9870 userns: Implement... |
99 100 101 |
int unshare_userns(unsigned long unshare_flags, struct cred **new_cred) { struct cred *cred; |
6160968ce userns: unshare_u... |
102 |
int err = -ENOMEM; |
b2e0d9870 userns: Implement... |
103 104 105 106 107 |
if (!(unshare_flags & CLONE_NEWUSER)) return 0; cred = prepare_creds(); |
6160968ce userns: unshare_u... |
108 109 110 111 112 113 114 |
if (cred) { err = create_user_ns(cred); if (err) put_cred(cred); else *new_cred = cred; } |
b2e0d9870 userns: Implement... |
115 |
|
6160968ce userns: unshare_u... |
116 |
return err; |
b2e0d9870 userns: Implement... |
117 |
} |
c61a2810a userns: Avoid rec... |
118 |
void free_user_ns(struct user_namespace *ns) |
acce292c8 user namespace: a... |
119 |
{ |
c61a2810a userns: Avoid rec... |
120 |
struct user_namespace *parent; |
783291e69 userns: Simplify ... |
121 |
|
c61a2810a userns: Avoid rec... |
122 123 124 125 126 127 |
do { parent = ns->parent; proc_free_inum(ns->proc_inum); kmem_cache_free(user_ns_cachep, ns); ns = parent; } while (atomic_dec_and_test(&parent->count)); |
acce292c8 user namespace: a... |
128 |
} |
6a3fd92e7 eCryptfs: make ke... |
129 |
EXPORT_SYMBOL(free_user_ns); |
5c1469de7 user_ns: Introduc... |
130 |
|
22d917d80 userns: Rework th... |
131 |
static u32 map_id_range_down(struct uid_gid_map *map, u32 id, u32 count) |
5c1469de7 user_ns: Introduc... |
132 |
{ |
22d917d80 userns: Rework th... |
133 134 |
unsigned idx, extents; u32 first, last, id2; |
5c1469de7 user_ns: Introduc... |
135 |
|
22d917d80 userns: Rework th... |
136 |
id2 = id + count - 1; |
5c1469de7 user_ns: Introduc... |
137 |
|
22d917d80 userns: Rework th... |
138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 |
/* Find the matching extent */ extents = map->nr_extents; smp_read_barrier_depends(); 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)) break; } /* Map the id or note failure */ if (idx < extents) id = (id - first) + map->extent[idx].lower_first; else id = (u32) -1; return id; } static u32 map_id_down(struct uid_gid_map *map, u32 id) { unsigned idx, extents; u32 first, last; /* Find the matching extent */ extents = map->nr_extents; smp_read_barrier_depends(); for (idx = 0; idx < extents; idx++) { first = map->extent[idx].first; last = first + map->extent[idx].count - 1; if (id >= first && id <= last) break; } /* Map the id or note failure */ if (idx < extents) id = (id - first) + map->extent[idx].lower_first; else id = (u32) -1; return id; } static u32 map_id_up(struct uid_gid_map *map, u32 id) { unsigned idx, extents; u32 first, last; /* Find the matching extent */ extents = map->nr_extents; smp_read_barrier_depends(); for (idx = 0; idx < extents; idx++) { first = map->extent[idx].lower_first; last = first + map->extent[idx].count - 1; if (id >= first && id <= last) break; |
5c1469de7 user_ns: Introduc... |
193 |
} |
22d917d80 userns: Rework th... |
194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 |
/* Map the id or note failure */ if (idx < extents) id = (id - first) + map->extent[idx].first; 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 * for and handle handle INVALID_UID being returned. INVALID_UID * 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 * @uid: group identifier * * 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... |
337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 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 |
/** * 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 * for and handle handle INVALID_PROJID being returned. INVALID_PROJID * 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... |
404 405 406 407 408 409 |
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... |
410 |
|
c450f371d userns: For /proc... |
411 |
lower_ns = seq_user_ns(seq); |
22d917d80 userns: Rework th... |
412 413 414 415 416 417 418 419 420 421 422 423 |
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... |
424 |
} |
22d917d80 userns: Rework th... |
425 |
static int gid_m_show(struct seq_file *seq, void *v) |
5c1469de7 user_ns: Introduc... |
426 |
{ |
22d917d80 userns: Rework th... |
427 428 429 430 |
struct user_namespace *ns = seq->private; struct uid_gid_extent *extent = v; struct user_namespace *lower_ns; gid_t lower; |
5c1469de7 user_ns: Introduc... |
431 |
|
c450f371d userns: For /proc... |
432 |
lower_ns = seq_user_ns(seq); |
22d917d80 userns: Rework th... |
433 434 |
if ((lower_ns == ns) && lower_ns->parent) lower_ns = lower_ns->parent; |
5c1469de7 user_ns: Introduc... |
435 |
|
22d917d80 userns: Rework th... |
436 437 438 439 440 441 442 443 444 445 |
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... |
446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 |
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; } |
22d917d80 userns: Rework th... |
467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 |
static void *m_start(struct seq_file *seq, loff_t *ppos, struct uid_gid_map *map) { struct uid_gid_extent *extent = NULL; loff_t pos = *ppos; if (pos < map->nr_extents) extent = &map->extent[pos]; return extent; } 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... |
491 492 493 494 495 496 |
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... |
497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 |
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; } struct seq_operations proc_uid_seq_operations = { .start = uid_m_start, .stop = m_stop, .next = m_next, .show = uid_m_show, }; struct seq_operations proc_gid_seq_operations = { .start = gid_m_start, .stop = m_stop, .next = m_next, .show = gid_m_show, }; |
f76d207a6 userns: Add kproj... |
521 522 523 524 525 526 |
struct seq_operations proc_projid_seq_operations = { .start = projid_m_start, .stop = m_stop, .next = m_next, .show = projid_m_show, }; |
0bd14b4fd userns: Allow any... |
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 |
static bool mappings_overlap(struct uid_gid_map *new_map, struct uid_gid_extent *extent) { 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; prev = &new_map->extent[idx]; 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; } |
22d917d80 userns: Rework th... |
561 562 563 564 565 566 567 568 569 570 571 572 |
static DEFINE_MUTEX(id_map_mutex); 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; |
0bd14b4fd userns: Allow any... |
573 |
struct uid_gid_extent *extent = NULL; |
22d917d80 userns: Rework th... |
574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 |
unsigned long page = 0; char *kbuf, *pos, *next_line; ssize_t ret = -EINVAL; /* * The id_map_mutex serializes all writes to any given map. * * 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 * order and smp_read_barrier_depends() is guaranteed that we * don't have crazy architectures returning stale data. * */ mutex_lock(&id_map_mutex); ret = -EPERM; /* Only allow one successful write to the map */ if (map->nr_extents != 0) goto out; |
41c21e351 userns: Changing ... |
604 605 |
/* * Adjusting namespace settings requires capabilities on the target. |
5c1469de7 user_ns: Introduc... |
606 |
*/ |
41c21e351 userns: Changing ... |
607 |
if (cap_valid(cap_setid) && !file_ns_capable(file, ns, CAP_SYS_ADMIN)) |
22d917d80 userns: Rework th... |
608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 |
goto out; /* Get a buffer */ ret = -ENOMEM; page = __get_free_page(GFP_TEMPORARY); kbuf = (char *) page; if (!page) goto out; /* Only allow <= page size writes at the beginning of the file */ ret = -EINVAL; if ((*ppos != 0) || (count >= PAGE_SIZE)) goto out; /* Slurp in the user data */ ret = -EFAULT; if (copy_from_user(kbuf, buf, count)) goto out; kbuf[count] = '\0'; /* Parse the user data */ ret = -EINVAL; pos = kbuf; new_map.nr_extents = 0; for (;pos; pos = next_line) { extent = &new_map.extent[new_map.nr_extents]; /* 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... |
643 |
} |
22d917d80 userns: Rework th... |
644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 |
pos = skip_spaces(pos); extent->first = simple_strtoul(pos, &pos, 10); if (!isspace(*pos)) goto out; pos = skip_spaces(pos); extent->lower_first = simple_strtoul(pos, &pos, 10); if (!isspace(*pos)) goto out; pos = skip_spaces(pos); extent->count = simple_strtoul(pos, &pos, 10); 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 */ if ((extent->first == (u32) -1) || (extent->lower_first == (u32) -1 )) goto out; /* Verify count is not zero and does not cause the extent to wrap */ if ((extent->first + extent->count) <= extent->first) goto out; if ((extent->lower_first + extent->count) <= extent->lower_first) goto out; |
0bd14b4fd userns: Allow any... |
675 676 |
/* Do the ranges in extent overlap any previous extents? */ if (mappings_overlap(&new_map, extent)) |
22d917d80 userns: Rework th... |
677 678 679 |
goto out; new_map.nr_extents++; |
22d917d80 userns: Rework th... |
680 681 682 683 684 |
/* Fail if the file contains too many extents */ if ((new_map.nr_extents == UID_GID_MAP_MAX_EXTENTS) && (next_line != NULL)) goto out; |
5c1469de7 user_ns: Introduc... |
685 |
} |
22d917d80 userns: Rework th... |
686 687 688 689 690 691 |
/* 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... |
692 |
if (!new_idmap_permitted(file, ns, cap_setid, &new_map)) |
22d917d80 userns: Rework th... |
693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 |
goto out; /* Map the lower ids from the parent user namespace to the * kernel global id space. */ for (idx = 0; idx < new_map.nr_extents; idx++) { u32 lower_first; extent = &new_map.extent[idx]; lower_first = map_id_range_down(parent_map, extent->lower_first, extent->count); /* Fail if we can not map the specified extent to * the kernel global id space. */ if (lower_first == (u32) -1) goto out; extent->lower_first = lower_first; } /* Install the map */ memcpy(map->extent, new_map.extent, new_map.nr_extents*sizeof(new_map.extent[0])); smp_wmb(); map->nr_extents = new_map.nr_extents; *ppos = count; ret = count; out: mutex_unlock(&id_map_mutex); if (page) free_page(page); return ret; } ssize_t proc_uid_map_write(struct file *file, const char __user *buf, size_t size, loff_t *ppos) { struct seq_file *seq = file->private_data; struct user_namespace *ns = seq->private; |
c450f371d userns: For /proc... |
734 |
struct user_namespace *seq_ns = seq_user_ns(seq); |
22d917d80 userns: Rework th... |
735 736 737 |
if (!ns->parent) return -EPERM; |
c450f371d userns: For /proc... |
738 739 |
if ((seq_ns != ns) && (seq_ns != ns->parent)) return -EPERM; |
22d917d80 userns: Rework th... |
740 741 742 743 744 745 746 747 |
return map_write(file, buf, size, ppos, CAP_SETUID, &ns->uid_map, &ns->parent->uid_map); } ssize_t proc_gid_map_write(struct file *file, const char __user *buf, size_t size, loff_t *ppos) { struct seq_file *seq = file->private_data; struct user_namespace *ns = seq->private; |
c450f371d userns: For /proc... |
748 |
struct user_namespace *seq_ns = seq_user_ns(seq); |
22d917d80 userns: Rework th... |
749 750 751 |
if (!ns->parent) return -EPERM; |
c450f371d userns: For /proc... |
752 753 |
if ((seq_ns != ns) && (seq_ns != ns->parent)) return -EPERM; |
22d917d80 userns: Rework th... |
754 755 756 |
return map_write(file, buf, size, ppos, CAP_SETGID, &ns->gid_map, &ns->parent->gid_map); } |
f76d207a6 userns: Add kproj... |
757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 |
ssize_t proc_projid_map_write(struct file *file, const char __user *buf, size_t size, loff_t *ppos) { 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); } |
6708075f1 userns: Don't let... |
773 774 |
static bool new_idmap_permitted(const struct file *file, struct user_namespace *ns, int cap_setid, |
22d917d80 userns: Rework th... |
775 776 |
struct uid_gid_map *new_map) { |
37657da3c userns: Allow set... |
777 778 779 780 781 |
/* Allow mapping to your own filesystem ids */ if ((new_map->nr_extents == 1) && (new_map->extent[0].count == 1)) { u32 id = new_map->extent[0].lower_first; if (cap_setid == CAP_SETUID) { kuid_t uid = make_kuid(ns->parent, id); |
e3211c120 userns: Check uid... |
782 |
if (uid_eq(uid, file->f_cred->fsuid)) |
37657da3c userns: Allow set... |
783 784 785 786 |
return true; } else if (cap_setid == CAP_SETGID) { kgid_t gid = make_kgid(ns->parent, id); |
e3211c120 userns: Check uid... |
787 |
if (gid_eq(gid, file->f_cred->fsgid)) |
37657da3c userns: Allow set... |
788 789 790 |
return true; } } |
f76d207a6 userns: Add kproj... |
791 792 793 |
/* Allow anyone to set a mapping that doesn't require privilege */ if (!cap_valid(cap_setid)) return true; |
22d917d80 userns: Rework th... |
794 795 |
/* 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... |
796 |
* And the opener of the id file also had the approprpiate capability. |
22d917d80 userns: Rework th... |
797 |
*/ |
6708075f1 userns: Don't let... |
798 799 |
if (ns_capable(ns->parent, cap_setid) && file_ns_capable(file, ns->parent, cap_setid)) |
22d917d80 userns: Rework th... |
800 |
return true; |
5c1469de7 user_ns: Introduc... |
801 |
|
22d917d80 userns: Rework th... |
802 |
return false; |
5c1469de7 user_ns: Introduc... |
803 |
} |
6164281ab user_ns: improve ... |
804 |
|
cde1975bc userns: Implent p... |
805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 |
static void *userns_get(struct task_struct *task) { struct user_namespace *user_ns; rcu_read_lock(); user_ns = get_user_ns(__task_cred(task)->user_ns); rcu_read_unlock(); return user_ns; } static void userns_put(void *ns) { put_user_ns(ns); } static int userns_install(struct nsproxy *nsproxy, void *ns) { struct user_namespace *user_ns = ns; struct cred *cred; /* Don't allow gaining capabilities by reentering * the same user namespace. */ if (user_ns == current_user_ns()) return -EINVAL; |
5155040ed userns: Fix typo ... |
831 |
/* Threaded processes may not enter a different user namespace */ |
cde1975bc userns: Implent p... |
832 833 |
if (atomic_read(¤t->mm->mm_users) > 1) return -EINVAL; |
e66eded83 userns: Don't all... |
834 835 |
if (current->fs->users != 1) return -EINVAL; |
cde1975bc userns: Implent p... |
836 837 838 839 840 841 842 843 844 845 846 847 |
if (!ns_capable(user_ns, CAP_SYS_ADMIN)) return -EPERM; cred = prepare_creds(); if (!cred) return -ENOMEM; put_user_ns(cred->user_ns); set_cred_user_ns(cred, get_user_ns(user_ns)); return commit_creds(cred); } |
98f842e67 proc: Usable inod... |
848 849 850 851 852 |
static unsigned int userns_inum(void *ns) { struct user_namespace *user_ns = ns; return user_ns->proc_inum; } |
cde1975bc userns: Implent p... |
853 854 855 856 857 858 |
const struct proc_ns_operations userns_operations = { .name = "user", .type = CLONE_NEWUSER, .get = userns_get, .put = userns_put, .install = userns_install, |
98f842e67 proc: Usable inod... |
859 |
.inum = userns_inum, |
cde1975bc userns: Implent p... |
860 |
}; |
6164281ab user_ns: improve ... |
861 862 863 864 865 866 |
static __init int user_namespaces_init(void) { user_ns_cachep = KMEM_CACHE(user_namespace, SLAB_PANIC); return 0; } module_init(user_namespaces_init); |