user.c 5.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229
  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/export.h>
  17. #include <linux/user_namespace.h>
  18. #include <linux/proc_ns.h>
  19. /*
  20. * userns count is 1 for root user, 1 for init_uts_ns,
  21. * and 1 for... ?
  22. */
  23. struct user_namespace init_user_ns = {
  24. .uid_map = {
  25. .nr_extents = 1,
  26. .extent[0] = {
  27. .first = 0,
  28. .lower_first = 0,
  29. .count = 4294967295U,
  30. },
  31. },
  32. .gid_map = {
  33. .nr_extents = 1,
  34. .extent[0] = {
  35. .first = 0,
  36. .lower_first = 0,
  37. .count = 4294967295U,
  38. },
  39. },
  40. .projid_map = {
  41. .nr_extents = 1,
  42. .extent[0] = {
  43. .first = 0,
  44. .lower_first = 0,
  45. .count = 4294967295U,
  46. },
  47. },
  48. .count = ATOMIC_INIT(3),
  49. .owner = GLOBAL_ROOT_UID,
  50. .group = GLOBAL_ROOT_GID,
  51. .ns.inum = PROC_USER_INIT_INO,
  52. #ifdef CONFIG_USER_NS
  53. .ns.ops = &userns_operations,
  54. #endif
  55. .flags = USERNS_INIT_FLAGS,
  56. #ifdef CONFIG_PERSISTENT_KEYRINGS
  57. .persistent_keyring_register_sem =
  58. __RWSEM_INITIALIZER(init_user_ns.persistent_keyring_register_sem),
  59. #endif
  60. };
  61. EXPORT_SYMBOL_GPL(init_user_ns);
  62. /*
  63. * UID task count cache, to get fast user lookup in "alloc_uid"
  64. * when changing user ID's (ie setuid() and friends).
  65. */
  66. #define UIDHASH_BITS (CONFIG_BASE_SMALL ? 3 : 7)
  67. #define UIDHASH_SZ (1 << UIDHASH_BITS)
  68. #define UIDHASH_MASK (UIDHASH_SZ - 1)
  69. #define __uidhashfn(uid) (((uid >> UIDHASH_BITS) + uid) & UIDHASH_MASK)
  70. #define uidhashentry(uid) (uidhash_table + __uidhashfn((__kuid_val(uid))))
  71. static struct kmem_cache *uid_cachep;
  72. struct hlist_head uidhash_table[UIDHASH_SZ];
  73. /*
  74. * The uidhash_lock is mostly taken from process context, but it is
  75. * occasionally also taken from softirq/tasklet context, when
  76. * task-structs get RCU-freed. Hence all locking must be softirq-safe.
  77. * But free_uid() is also called with local interrupts disabled, and running
  78. * local_bh_enable() with local interrupts disabled is an error - we'll run
  79. * softirq callbacks, and they can unconditionally enable interrupts, and
  80. * the caller of free_uid() didn't expect that..
  81. */
  82. static DEFINE_SPINLOCK(uidhash_lock);
  83. /* root_user.__count is 1, for init task cred */
  84. struct user_struct root_user = {
  85. .__count = ATOMIC_INIT(1),
  86. .processes = ATOMIC_INIT(1),
  87. .sigpending = ATOMIC_INIT(0),
  88. .locked_shm = 0,
  89. .uid = GLOBAL_ROOT_UID,
  90. };
  91. /*
  92. * These routines must be called with the uidhash spinlock held!
  93. */
  94. static void uid_hash_insert(struct user_struct *up, struct hlist_head *hashent)
  95. {
  96. hlist_add_head(&up->uidhash_node, hashent);
  97. }
  98. static void uid_hash_remove(struct user_struct *up)
  99. {
  100. hlist_del_init(&up->uidhash_node);
  101. }
  102. static struct user_struct *uid_hash_find(kuid_t uid, struct hlist_head *hashent)
  103. {
  104. struct user_struct *user;
  105. hlist_for_each_entry(user, hashent, uidhash_node) {
  106. if (uid_eq(user->uid, uid)) {
  107. atomic_inc(&user->__count);
  108. return user;
  109. }
  110. }
  111. return NULL;
  112. }
  113. /* IRQs are disabled and uidhash_lock is held upon function entry.
  114. * IRQ state (as stored in flags) is restored and uidhash_lock released
  115. * upon function exit.
  116. */
  117. static void free_user(struct user_struct *up, unsigned long flags)
  118. __releases(&uidhash_lock)
  119. {
  120. uid_hash_remove(up);
  121. spin_unlock_irqrestore(&uidhash_lock, flags);
  122. key_put(up->uid_keyring);
  123. key_put(up->session_keyring);
  124. kmem_cache_free(uid_cachep, up);
  125. }
  126. /*
  127. * Locate the user_struct for the passed UID. If found, take a ref on it. The
  128. * caller must undo that ref with free_uid().
  129. *
  130. * If the user_struct could not be found, return NULL.
  131. */
  132. struct user_struct *find_user(kuid_t uid)
  133. {
  134. struct user_struct *ret;
  135. unsigned long flags;
  136. spin_lock_irqsave(&uidhash_lock, flags);
  137. ret = uid_hash_find(uid, uidhashentry(uid));
  138. spin_unlock_irqrestore(&uidhash_lock, flags);
  139. return ret;
  140. }
  141. void free_uid(struct user_struct *up)
  142. {
  143. unsigned long flags;
  144. if (!up)
  145. return;
  146. local_irq_save(flags);
  147. if (atomic_dec_and_lock(&up->__count, &uidhash_lock))
  148. free_user(up, flags);
  149. else
  150. local_irq_restore(flags);
  151. }
  152. struct user_struct *alloc_uid(kuid_t uid)
  153. {
  154. struct hlist_head *hashent = uidhashentry(uid);
  155. struct user_struct *up, *new;
  156. spin_lock_irq(&uidhash_lock);
  157. up = uid_hash_find(uid, hashent);
  158. spin_unlock_irq(&uidhash_lock);
  159. if (!up) {
  160. new = kmem_cache_zalloc(uid_cachep, GFP_KERNEL);
  161. if (!new)
  162. goto out_unlock;
  163. new->uid = uid;
  164. atomic_set(&new->__count, 1);
  165. /*
  166. * Before adding this, check whether we raced
  167. * on adding the same user already..
  168. */
  169. spin_lock_irq(&uidhash_lock);
  170. up = uid_hash_find(uid, hashent);
  171. if (up) {
  172. key_put(new->uid_keyring);
  173. key_put(new->session_keyring);
  174. kmem_cache_free(uid_cachep, new);
  175. } else {
  176. uid_hash_insert(new, hashent);
  177. up = new;
  178. }
  179. spin_unlock_irq(&uidhash_lock);
  180. }
  181. return up;
  182. out_unlock:
  183. return NULL;
  184. }
  185. static int __init uid_cache_init(void)
  186. {
  187. int n;
  188. uid_cachep = kmem_cache_create("uid_cache", sizeof(struct user_struct),
  189. 0, SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
  190. for(n = 0; n < UIDHASH_SZ; ++n)
  191. INIT_HLIST_HEAD(uidhash_table + n);
  192. /* Insert the root user immediately (init already runs as root) */
  193. spin_lock_irq(&uidhash_lock);
  194. uid_hash_insert(&root_user, uidhashentry(GLOBAL_ROOT_UID));
  195. spin_unlock_irq(&uidhash_lock);
  196. return 0;
  197. }
  198. subsys_initcall(uid_cache_init);