user.c 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205
  1. /*
  2. * The "user cache".
  3. *
  4. * (C) Copyright 1991-2000 Linus Torvalds
  5. *
  6. * We have a per-user structure to keep track of how many
  7. * processes, files etc the user has claimed, in order to be
  8. * able to have per-user limits for system resources.
  9. */
  10. #include <linux/init.h>
  11. #include <linux/sched.h>
  12. #include <linux/slab.h>
  13. #include <linux/bitops.h>
  14. #include <linux/key.h>
  15. #include <linux/interrupt.h>
  16. #include <linux/module.h>
  17. #include <linux/user_namespace.h>
  18. #include "cred-internals.h"
  19. struct user_namespace init_user_ns = {
  20. .kref = {
  21. .refcount = ATOMIC_INIT(2),
  22. },
  23. .creator = &root_user,
  24. };
  25. EXPORT_SYMBOL_GPL(init_user_ns);
  26. /*
  27. * UID task count cache, to get fast user lookup in "alloc_uid"
  28. * when changing user ID's (ie setuid() and friends).
  29. */
  30. #define UIDHASH_MASK (UIDHASH_SZ - 1)
  31. #define __uidhashfn(uid) (((uid >> UIDHASH_BITS) + uid) & UIDHASH_MASK)
  32. #define uidhashentry(ns, uid) ((ns)->uidhash_table + __uidhashfn((uid)))
  33. static struct kmem_cache *uid_cachep;
  34. /*
  35. * The uidhash_lock is mostly taken from process context, but it is
  36. * occasionally also taken from softirq/tasklet context, when
  37. * task-structs get RCU-freed. Hence all locking must be softirq-safe.
  38. * But free_uid() is also called with local interrupts disabled, and running
  39. * local_bh_enable() with local interrupts disabled is an error - we'll run
  40. * softirq callbacks, and they can unconditionally enable interrupts, and
  41. * the caller of free_uid() didn't expect that..
  42. */
  43. static DEFINE_SPINLOCK(uidhash_lock);
  44. /* root_user.__count is 2, 1 for init task cred, 1 for init_user_ns->creator */
  45. struct user_struct root_user = {
  46. .__count = ATOMIC_INIT(2),
  47. .processes = ATOMIC_INIT(1),
  48. .files = ATOMIC_INIT(0),
  49. .sigpending = ATOMIC_INIT(0),
  50. .locked_shm = 0,
  51. .user_ns = &init_user_ns,
  52. };
  53. /*
  54. * These routines must be called with the uidhash spinlock held!
  55. */
  56. static void uid_hash_insert(struct user_struct *up, struct hlist_head *hashent)
  57. {
  58. hlist_add_head(&up->uidhash_node, hashent);
  59. }
  60. static void uid_hash_remove(struct user_struct *up)
  61. {
  62. hlist_del_init(&up->uidhash_node);
  63. put_user_ns(up->user_ns);
  64. }
  65. static struct user_struct *uid_hash_find(uid_t uid, struct hlist_head *hashent)
  66. {
  67. struct user_struct *user;
  68. struct hlist_node *h;
  69. hlist_for_each_entry(user, h, hashent, uidhash_node) {
  70. if (user->uid == uid) {
  71. atomic_inc(&user->__count);
  72. return user;
  73. }
  74. }
  75. return NULL;
  76. }
  77. /* IRQs are disabled and uidhash_lock is held upon function entry.
  78. * IRQ state (as stored in flags) is restored and uidhash_lock released
  79. * upon function exit.
  80. */
  81. static void free_user(struct user_struct *up, unsigned long flags)
  82. {
  83. uid_hash_remove(up);
  84. spin_unlock_irqrestore(&uidhash_lock, flags);
  85. key_put(up->uid_keyring);
  86. key_put(up->session_keyring);
  87. kmem_cache_free(uid_cachep, up);
  88. }
  89. /*
  90. * Locate the user_struct for the passed UID. If found, take a ref on it. The
  91. * caller must undo that ref with free_uid().
  92. *
  93. * If the user_struct could not be found, return NULL.
  94. */
  95. struct user_struct *find_user(uid_t uid)
  96. {
  97. struct user_struct *ret;
  98. unsigned long flags;
  99. struct user_namespace *ns = current_user_ns();
  100. spin_lock_irqsave(&uidhash_lock, flags);
  101. ret = uid_hash_find(uid, uidhashentry(ns, uid));
  102. spin_unlock_irqrestore(&uidhash_lock, flags);
  103. return ret;
  104. }
  105. void free_uid(struct user_struct *up)
  106. {
  107. unsigned long flags;
  108. if (!up)
  109. return;
  110. local_irq_save(flags);
  111. if (atomic_dec_and_lock(&up->__count, &uidhash_lock))
  112. free_user(up, flags);
  113. else
  114. local_irq_restore(flags);
  115. }
  116. struct user_struct *alloc_uid(struct user_namespace *ns, uid_t uid)
  117. {
  118. struct hlist_head *hashent = uidhashentry(ns, uid);
  119. struct user_struct *up, *new;
  120. /* Make uid_hash_find() + uids_user_create() + uid_hash_insert()
  121. * atomic.
  122. */
  123. spin_lock_irq(&uidhash_lock);
  124. up = uid_hash_find(uid, hashent);
  125. spin_unlock_irq(&uidhash_lock);
  126. if (!up) {
  127. new = kmem_cache_zalloc(uid_cachep, GFP_KERNEL);
  128. if (!new)
  129. goto out_unlock;
  130. new->uid = uid;
  131. atomic_set(&new->__count, 1);
  132. new->user_ns = get_user_ns(ns);
  133. /*
  134. * Before adding this, check whether we raced
  135. * on adding the same user already..
  136. */
  137. spin_lock_irq(&uidhash_lock);
  138. up = uid_hash_find(uid, hashent);
  139. if (up) {
  140. /* This case is not possible when CONFIG_USER_SCHED
  141. * is defined, since we serialize alloc_uid() using
  142. * uids_mutex. Hence no need to call
  143. * sched_destroy_user() or remove_user_sysfs_dir().
  144. */
  145. key_put(new->uid_keyring);
  146. key_put(new->session_keyring);
  147. kmem_cache_free(uid_cachep, new);
  148. } else {
  149. uid_hash_insert(new, hashent);
  150. up = new;
  151. }
  152. spin_unlock_irq(&uidhash_lock);
  153. }
  154. return up;
  155. put_user_ns(new->user_ns);
  156. kmem_cache_free(uid_cachep, new);
  157. out_unlock:
  158. return NULL;
  159. }
  160. static int __init uid_cache_init(void)
  161. {
  162. int n;
  163. uid_cachep = kmem_cache_create("uid_cache", sizeof(struct user_struct),
  164. 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
  165. for(n = 0; n < UIDHASH_SZ; ++n)
  166. INIT_HLIST_HEAD(init_user_ns.uidhash_table + n);
  167. /* Insert the root user immediately (init already runs as root) */
  168. spin_lock_irq(&uidhash_lock);
  169. uid_hash_insert(&root_user, uidhashentry(&init_user_ns, 0));
  170. spin_unlock_irq(&uidhash_lock);
  171. return 0;
  172. }
  173. module_init(uid_cache_init);