user.c 5.5 KB

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