4 * (C) Copyright 1991-2000 Linus Torvalds
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.
11 #include <linux/init.h>
12 #include <linux/sched.h>
13 #include <linux/slab.h>
14 #include <linux/bitops.h>
15 #include <linux/key.h>
16 #include <linux/sched/user.h>
17 #include <linux/interrupt.h>
18 #include <linux/export.h>
19 #include <linux/user_namespace.h>
20 #include <linux/proc_ns.h>
23 * userns count is 1 for root user, 1 for init_uts_ns,
26 struct user_namespace init_user_ns
= {
57 .count
= ATOMIC_INIT(3),
58 .owner
= GLOBAL_ROOT_UID
,
59 .group
= GLOBAL_ROOT_GID
,
60 .ns
.inum
= PROC_USER_INIT_INO
,
62 .ns
.ops
= &userns_operations
,
64 .flags
= USERNS_INIT_FLAGS
,
65 #ifdef CONFIG_PERSISTENT_KEYRINGS
66 .persistent_keyring_register_sem
=
67 __RWSEM_INITIALIZER(init_user_ns
.persistent_keyring_register_sem
),
70 EXPORT_SYMBOL_GPL(init_user_ns
);
73 * UID task count cache, to get fast user lookup in "alloc_uid"
74 * when changing user ID's (ie setuid() and friends).
77 #define UIDHASH_BITS (CONFIG_BASE_SMALL ? 3 : 7)
78 #define UIDHASH_SZ (1 << UIDHASH_BITS)
79 #define UIDHASH_MASK (UIDHASH_SZ - 1)
80 #define __uidhashfn(uid) (((uid >> UIDHASH_BITS) + uid) & UIDHASH_MASK)
81 #define uidhashentry(uid) (uidhash_table + __uidhashfn((__kuid_val(uid))))
83 static struct kmem_cache
*uid_cachep
;
84 struct hlist_head uidhash_table
[UIDHASH_SZ
];
87 * The uidhash_lock is mostly taken from process context, but it is
88 * occasionally also taken from softirq/tasklet context, when
89 * task-structs get RCU-freed. Hence all locking must be softirq-safe.
90 * But free_uid() is also called with local interrupts disabled, and running
91 * local_bh_enable() with local interrupts disabled is an error - we'll run
92 * softirq callbacks, and they can unconditionally enable interrupts, and
93 * the caller of free_uid() didn't expect that..
95 static DEFINE_SPINLOCK(uidhash_lock
);
97 /* root_user.__count is 1, for init task cred */
98 struct user_struct root_user
= {
99 .__count
= ATOMIC_INIT(1),
100 .processes
= ATOMIC_INIT(1),
101 .sigpending
= ATOMIC_INIT(0),
103 .uid
= GLOBAL_ROOT_UID
,
104 .ratelimit
= RATELIMIT_STATE_INIT(root_user
.ratelimit
, 0, 0),
108 * These routines must be called with the uidhash spinlock held!
110 static void uid_hash_insert(struct user_struct
*up
, struct hlist_head
*hashent
)
112 hlist_add_head(&up
->uidhash_node
, hashent
);
115 static void uid_hash_remove(struct user_struct
*up
)
117 hlist_del_init(&up
->uidhash_node
);
120 static struct user_struct
*uid_hash_find(kuid_t uid
, struct hlist_head
*hashent
)
122 struct user_struct
*user
;
124 hlist_for_each_entry(user
, hashent
, uidhash_node
) {
125 if (uid_eq(user
->uid
, uid
)) {
126 atomic_inc(&user
->__count
);
134 /* IRQs are disabled and uidhash_lock is held upon function entry.
135 * IRQ state (as stored in flags) is restored and uidhash_lock released
136 * upon function exit.
138 static void free_user(struct user_struct
*up
, unsigned long flags
)
139 __releases(&uidhash_lock
)
142 spin_unlock_irqrestore(&uidhash_lock
, flags
);
143 key_put(up
->uid_keyring
);
144 key_put(up
->session_keyring
);
145 kmem_cache_free(uid_cachep
, up
);
149 * Locate the user_struct for the passed UID. If found, take a ref on it. The
150 * caller must undo that ref with free_uid().
152 * If the user_struct could not be found, return NULL.
154 struct user_struct
*find_user(kuid_t uid
)
156 struct user_struct
*ret
;
159 spin_lock_irqsave(&uidhash_lock
, flags
);
160 ret
= uid_hash_find(uid
, uidhashentry(uid
));
161 spin_unlock_irqrestore(&uidhash_lock
, flags
);
165 void free_uid(struct user_struct
*up
)
172 local_irq_save(flags
);
173 if (atomic_dec_and_lock(&up
->__count
, &uidhash_lock
))
174 free_user(up
, flags
);
176 local_irq_restore(flags
);
179 struct user_struct
*alloc_uid(kuid_t uid
)
181 struct hlist_head
*hashent
= uidhashentry(uid
);
182 struct user_struct
*up
, *new;
184 spin_lock_irq(&uidhash_lock
);
185 up
= uid_hash_find(uid
, hashent
);
186 spin_unlock_irq(&uidhash_lock
);
189 new = kmem_cache_zalloc(uid_cachep
, GFP_KERNEL
);
194 atomic_set(&new->__count
, 1);
195 ratelimit_state_init(&new->ratelimit
, HZ
, 100);
196 ratelimit_set_flags(&new->ratelimit
, RATELIMIT_MSG_ON_RELEASE
);
199 * Before adding this, check whether we raced
200 * on adding the same user already..
202 spin_lock_irq(&uidhash_lock
);
203 up
= uid_hash_find(uid
, hashent
);
205 key_put(new->uid_keyring
);
206 key_put(new->session_keyring
);
207 kmem_cache_free(uid_cachep
, new);
209 uid_hash_insert(new, hashent
);
212 spin_unlock_irq(&uidhash_lock
);
221 static int __init
uid_cache_init(void)
225 uid_cachep
= kmem_cache_create("uid_cache", sizeof(struct user_struct
),
226 0, SLAB_HWCACHE_ALIGN
|SLAB_PANIC
, NULL
);
228 for(n
= 0; n
< UIDHASH_SZ
; ++n
)
229 INIT_HLIST_HEAD(uidhash_table
+ n
);
231 /* Insert the root user immediately (init already runs as root) */
232 spin_lock_irq(&uidhash_lock
);
233 uid_hash_insert(&root_user
, uidhashentry(GLOBAL_ROOT_UID
));
234 spin_unlock_irq(&uidhash_lock
);
238 subsys_initcall(uid_cache_init
);