user.c 5.1 KB

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