user.c 5.6 KB

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