]>
Commit | Line | Data |
---|---|---|
dbec2846 EB |
1 | /* |
2 | * This program is free software; you can redistribute it and/or | |
3 | * modify it under the terms of the GNU General Public License as | |
4 | * published by the Free Software Foundation, version 2 of the | |
5 | * License. | |
6 | */ | |
7 | ||
8 | #include <linux/stat.h> | |
9 | #include <linux/sysctl.h> | |
10 | #include <linux/slab.h> | |
f6b2db1a | 11 | #include <linux/hash.h> |
dbec2846 EB |
12 | #include <linux/user_namespace.h> |
13 | ||
f6b2db1a EB |
14 | #define UCOUNTS_HASHTABLE_BITS 10 |
15 | static struct hlist_head ucounts_hashtable[(1 << UCOUNTS_HASHTABLE_BITS)]; | |
16 | static DEFINE_SPINLOCK(ucounts_lock); | |
17 | ||
18 | #define ucounts_hashfn(ns, uid) \ | |
19 | hash_long((unsigned long)__kuid_val(uid) + (unsigned long)(ns), \ | |
20 | UCOUNTS_HASHTABLE_BITS) | |
21 | #define ucounts_hashentry(ns, uid) \ | |
22 | (ucounts_hashtable + ucounts_hashfn(ns, uid)) | |
23 | ||
24 | ||
dbec2846 EB |
25 | #ifdef CONFIG_SYSCTL |
26 | static struct ctl_table_set * | |
27 | set_lookup(struct ctl_table_root *root) | |
28 | { | |
29 | return ¤t_user_ns()->set; | |
30 | } | |
31 | ||
32 | static int set_is_seen(struct ctl_table_set *set) | |
33 | { | |
34 | return ¤t_user_ns()->set == set; | |
35 | } | |
36 | ||
37 | static int set_permissions(struct ctl_table_header *head, | |
38 | struct ctl_table *table) | |
39 | { | |
40 | struct user_namespace *user_ns = | |
41 | container_of(head->set, struct user_namespace, set); | |
42 | int mode; | |
43 | ||
44 | /* Allow users with CAP_SYS_RESOURCE unrestrained access */ | |
45 | if (ns_capable(user_ns, CAP_SYS_RESOURCE)) | |
46 | mode = (table->mode & S_IRWXU) >> 6; | |
47 | else | |
48 | /* Allow all others at most read-only access */ | |
49 | mode = table->mode & S_IROTH; | |
50 | return (mode << 6) | (mode << 3) | mode; | |
51 | } | |
52 | ||
53 | static struct ctl_table_root set_root = { | |
54 | .lookup = set_lookup, | |
55 | .permissions = set_permissions, | |
56 | }; | |
57 | ||
b376c3e1 EB |
58 | static int zero = 0; |
59 | static int int_max = INT_MAX; | |
25f9c081 EB |
60 | #define UCOUNT_ENTRY(name) \ |
61 | { \ | |
62 | .procname = name, \ | |
63 | .maxlen = sizeof(int), \ | |
64 | .mode = 0644, \ | |
65 | .proc_handler = proc_dointvec_minmax, \ | |
66 | .extra1 = &zero, \ | |
67 | .extra2 = &int_max, \ | |
68 | } | |
f6b2db1a | 69 | static struct ctl_table user_table[] = { |
25f9c081 | 70 | UCOUNT_ENTRY("max_user_namespaces"), |
f333c700 | 71 | UCOUNT_ENTRY("max_pid_namespaces"), |
f7af3d1c | 72 | UCOUNT_ENTRY("max_uts_namespaces"), |
aba35661 | 73 | UCOUNT_ENTRY("max_ipc_namespaces"), |
70328660 | 74 | UCOUNT_ENTRY("max_net_namespaces"), |
d08311dd | 75 | UCOUNT_ENTRY("max_cgroup_namespaces"), |
dbec2846 EB |
76 | { } |
77 | }; | |
78 | #endif /* CONFIG_SYSCTL */ | |
79 | ||
80 | bool setup_userns_sysctls(struct user_namespace *ns) | |
81 | { | |
82 | #ifdef CONFIG_SYSCTL | |
83 | struct ctl_table *tbl; | |
84 | setup_sysctl_set(&ns->set, &set_root, set_is_seen); | |
f6b2db1a | 85 | tbl = kmemdup(user_table, sizeof(user_table), GFP_KERNEL); |
dbec2846 | 86 | if (tbl) { |
25f9c081 EB |
87 | int i; |
88 | for (i = 0; i < UCOUNT_COUNTS; i++) { | |
89 | tbl[i].data = &ns->ucount_max[i]; | |
90 | } | |
f6b2db1a | 91 | ns->sysctls = __register_sysctl_table(&ns->set, "user", tbl); |
dbec2846 EB |
92 | } |
93 | if (!ns->sysctls) { | |
94 | kfree(tbl); | |
95 | retire_sysctl_set(&ns->set); | |
96 | return false; | |
97 | } | |
98 | #endif | |
99 | return true; | |
100 | } | |
101 | ||
102 | void retire_userns_sysctls(struct user_namespace *ns) | |
103 | { | |
104 | #ifdef CONFIG_SYSCTL | |
105 | struct ctl_table *tbl; | |
106 | ||
107 | tbl = ns->sysctls->ctl_table_arg; | |
108 | unregister_sysctl_table(ns->sysctls); | |
109 | retire_sysctl_set(&ns->set); | |
110 | kfree(tbl); | |
111 | #endif | |
112 | } | |
113 | ||
f6b2db1a EB |
114 | static struct ucounts *find_ucounts(struct user_namespace *ns, kuid_t uid, struct hlist_head *hashent) |
115 | { | |
116 | struct ucounts *ucounts; | |
117 | ||
118 | hlist_for_each_entry(ucounts, hashent, node) { | |
119 | if (uid_eq(ucounts->uid, uid) && (ucounts->ns == ns)) | |
120 | return ucounts; | |
121 | } | |
122 | return NULL; | |
123 | } | |
124 | ||
125 | static struct ucounts *get_ucounts(struct user_namespace *ns, kuid_t uid) | |
126 | { | |
127 | struct hlist_head *hashent = ucounts_hashentry(ns, uid); | |
128 | struct ucounts *ucounts, *new; | |
129 | ||
130 | spin_lock(&ucounts_lock); | |
131 | ucounts = find_ucounts(ns, uid, hashent); | |
132 | if (!ucounts) { | |
133 | spin_unlock(&ucounts_lock); | |
134 | ||
135 | new = kzalloc(sizeof(*new), GFP_KERNEL); | |
136 | if (!new) | |
137 | return NULL; | |
138 | ||
139 | new->ns = ns; | |
140 | new->uid = uid; | |
141 | atomic_set(&new->count, 0); | |
142 | ||
143 | spin_lock(&ucounts_lock); | |
144 | ucounts = find_ucounts(ns, uid, hashent); | |
145 | if (ucounts) { | |
146 | kfree(new); | |
147 | } else { | |
148 | hlist_add_head(&new->node, hashent); | |
149 | ucounts = new; | |
150 | } | |
151 | } | |
152 | if (!atomic_add_unless(&ucounts->count, 1, INT_MAX)) | |
153 | ucounts = NULL; | |
154 | spin_unlock(&ucounts_lock); | |
155 | return ucounts; | |
156 | } | |
157 | ||
158 | static void put_ucounts(struct ucounts *ucounts) | |
159 | { | |
160 | if (atomic_dec_and_test(&ucounts->count)) { | |
161 | spin_lock(&ucounts_lock); | |
162 | hlist_del_init(&ucounts->node); | |
163 | spin_unlock(&ucounts_lock); | |
164 | ||
165 | kfree(ucounts); | |
166 | } | |
167 | } | |
168 | ||
b376c3e1 EB |
169 | static inline bool atomic_inc_below(atomic_t *v, int u) |
170 | { | |
171 | int c, old; | |
172 | c = atomic_read(v); | |
173 | for (;;) { | |
174 | if (unlikely(c >= u)) | |
175 | return false; | |
176 | old = atomic_cmpxchg(v, c, c+1); | |
177 | if (likely(old == c)) | |
178 | return true; | |
179 | c = old; | |
180 | } | |
181 | } | |
182 | ||
25f9c081 EB |
183 | struct ucounts *inc_ucount(struct user_namespace *ns, kuid_t uid, |
184 | enum ucount_type type) | |
b376c3e1 | 185 | { |
f6b2db1a EB |
186 | struct ucounts *ucounts, *iter, *bad; |
187 | struct user_namespace *tns; | |
188 | ucounts = get_ucounts(ns, uid); | |
189 | for (iter = ucounts; iter; iter = tns->ucounts) { | |
190 | int max; | |
191 | tns = iter->ns; | |
25f9c081 EB |
192 | max = READ_ONCE(tns->ucount_max[type]); |
193 | if (!atomic_inc_below(&iter->ucount[type], max)) | |
b376c3e1 EB |
194 | goto fail; |
195 | } | |
f6b2db1a | 196 | return ucounts; |
b376c3e1 | 197 | fail: |
f6b2db1a EB |
198 | bad = iter; |
199 | for (iter = ucounts; iter != bad; iter = iter->ns->ucounts) | |
25f9c081 | 200 | atomic_dec(&iter->ucount[type]); |
b376c3e1 | 201 | |
f6b2db1a EB |
202 | put_ucounts(ucounts); |
203 | return NULL; | |
b376c3e1 EB |
204 | } |
205 | ||
25f9c081 | 206 | void dec_ucount(struct ucounts *ucounts, enum ucount_type type) |
b376c3e1 | 207 | { |
f6b2db1a EB |
208 | struct ucounts *iter; |
209 | for (iter = ucounts; iter; iter = iter->ns->ucounts) { | |
25f9c081 | 210 | int dec = atomic_dec_if_positive(&iter->ucount[type]); |
b376c3e1 EB |
211 | WARN_ON_ONCE(dec < 0); |
212 | } | |
f6b2db1a | 213 | put_ucounts(ucounts); |
b376c3e1 EB |
214 | } |
215 | ||
dbec2846 EB |
216 | static __init int user_namespace_sysctl_init(void) |
217 | { | |
218 | #ifdef CONFIG_SYSCTL | |
f6b2db1a | 219 | static struct ctl_table_header *user_header; |
dbec2846 EB |
220 | static struct ctl_table empty[1]; |
221 | /* | |
f6b2db1a | 222 | * It is necessary to register the user directory in the |
dbec2846 EB |
223 | * default set so that registrations in the child sets work |
224 | * properly. | |
225 | */ | |
f6b2db1a EB |
226 | user_header = register_sysctl("user", empty); |
227 | BUG_ON(!user_header); | |
dbec2846 EB |
228 | BUG_ON(!setup_userns_sysctls(&init_user_ns)); |
229 | #endif | |
230 | return 0; | |
231 | } | |
232 | subsys_initcall(user_namespace_sysctl_init); | |
233 | ||
234 |