user.c 4.8 KB

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