blob: c6b2cf29a54b115f48887bb11a953ace5052c330 [file] [log] [blame]
Daniel Mack30070982016-11-23 16:52:26 +01001/*
2 * Functions to manage eBPF programs attached to cgroups
3 *
4 * Copyright (c) 2016 Daniel Mack
5 *
6 * This file is subject to the terms and conditions of version 2 of the GNU
7 * General Public License. See the file COPYING in the main directory of the
8 * Linux distribution for more details.
9 */
10
11#include <linux/kernel.h>
12#include <linux/atomic.h>
13#include <linux/cgroup.h>
Andrey Ignatov7b146ce2019-02-27 12:59:24 -080014#include <linux/filter.h>
Daniel Mack30070982016-11-23 16:52:26 +010015#include <linux/slab.h>
Andrey Ignatov7b146ce2019-02-27 12:59:24 -080016#include <linux/sysctl.h>
Andrey Ignatov808649f2019-02-27 13:28:48 -080017#include <linux/string.h>
Daniel Mack30070982016-11-23 16:52:26 +010018#include <linux/bpf.h>
19#include <linux/bpf-cgroup.h>
20#include <net/sock.h>
21
22DEFINE_STATIC_KEY_FALSE(cgroup_bpf_enabled_key);
23EXPORT_SYMBOL(cgroup_bpf_enabled_key);
24
25/**
26 * cgroup_bpf_put() - put references of all bpf programs
27 * @cgrp: the cgroup to modify
28 */
29void cgroup_bpf_put(struct cgroup *cgrp)
30{
Roman Gushchin8bad74f2018-09-28 14:45:36 +000031 enum bpf_cgroup_storage_type stype;
Daniel Mack30070982016-11-23 16:52:26 +010032 unsigned int type;
33
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -070034 for (type = 0; type < ARRAY_SIZE(cgrp->bpf.progs); type++) {
35 struct list_head *progs = &cgrp->bpf.progs[type];
36 struct bpf_prog_list *pl, *tmp;
Daniel Mack30070982016-11-23 16:52:26 +010037
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -070038 list_for_each_entry_safe(pl, tmp, progs, node) {
39 list_del(&pl->node);
40 bpf_prog_put(pl->prog);
Roman Gushchin8bad74f2018-09-28 14:45:36 +000041 for_each_cgroup_storage_type(stype) {
42 bpf_cgroup_storage_unlink(pl->storage[stype]);
43 bpf_cgroup_storage_free(pl->storage[stype]);
44 }
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -070045 kfree(pl);
Daniel Mack30070982016-11-23 16:52:26 +010046 static_branch_dec(&cgroup_bpf_enabled_key);
47 }
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -070048 bpf_prog_array_free(cgrp->bpf.effective[type]);
Daniel Mack30070982016-11-23 16:52:26 +010049 }
50}
51
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -070052/* count number of elements in the list.
53 * it's slow but the list cannot be long
54 */
55static u32 prog_list_length(struct list_head *head)
56{
57 struct bpf_prog_list *pl;
58 u32 cnt = 0;
59
60 list_for_each_entry(pl, head, node) {
61 if (!pl->prog)
62 continue;
63 cnt++;
64 }
65 return cnt;
66}
67
68/* if parent has non-overridable prog attached,
69 * disallow attaching new programs to the descendent cgroup.
70 * if parent has overridable or multi-prog, allow attaching
71 */
72static bool hierarchy_allows_attach(struct cgroup *cgrp,
73 enum bpf_attach_type type,
74 u32 new_flags)
75{
76 struct cgroup *p;
77
78 p = cgroup_parent(cgrp);
79 if (!p)
80 return true;
81 do {
82 u32 flags = p->bpf.flags[type];
83 u32 cnt;
84
85 if (flags & BPF_F_ALLOW_MULTI)
86 return true;
87 cnt = prog_list_length(&p->bpf.progs[type]);
88 WARN_ON_ONCE(cnt > 1);
89 if (cnt == 1)
90 return !!(flags & BPF_F_ALLOW_OVERRIDE);
91 p = cgroup_parent(p);
92 } while (p);
93 return true;
94}
95
96/* compute a chain of effective programs for a given cgroup:
97 * start from the list of programs in this cgroup and add
98 * all parent programs.
99 * Note that parent's F_ALLOW_OVERRIDE-type program is yielding
100 * to programs in this cgroup
101 */
102static int compute_effective_progs(struct cgroup *cgrp,
103 enum bpf_attach_type type,
104 struct bpf_prog_array __rcu **array)
105{
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000106 enum bpf_cgroup_storage_type stype;
Roman Gushchin3960f4f2018-07-13 12:41:11 -0700107 struct bpf_prog_array *progs;
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700108 struct bpf_prog_list *pl;
109 struct cgroup *p = cgrp;
110 int cnt = 0;
111
112 /* count number of effective programs by walking parents */
113 do {
114 if (cnt == 0 || (p->bpf.flags[type] & BPF_F_ALLOW_MULTI))
115 cnt += prog_list_length(&p->bpf.progs[type]);
116 p = cgroup_parent(p);
117 } while (p);
118
119 progs = bpf_prog_array_alloc(cnt, GFP_KERNEL);
120 if (!progs)
121 return -ENOMEM;
122
123 /* populate the array with effective progs */
124 cnt = 0;
125 p = cgrp;
126 do {
Roman Gushchin394e40a2018-08-02 14:27:21 -0700127 if (cnt > 0 && !(p->bpf.flags[type] & BPF_F_ALLOW_MULTI))
128 continue;
129
130 list_for_each_entry(pl, &p->bpf.progs[type], node) {
131 if (!pl->prog)
132 continue;
133
134 progs->items[cnt].prog = pl->prog;
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000135 for_each_cgroup_storage_type(stype)
136 progs->items[cnt].cgroup_storage[stype] =
137 pl->storage[stype];
Roman Gushchin394e40a2018-08-02 14:27:21 -0700138 cnt++;
139 }
140 } while ((p = cgroup_parent(p)));
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700141
Roman Gushchin3960f4f2018-07-13 12:41:11 -0700142 rcu_assign_pointer(*array, progs);
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700143 return 0;
144}
145
146static void activate_effective_progs(struct cgroup *cgrp,
147 enum bpf_attach_type type,
148 struct bpf_prog_array __rcu *array)
149{
150 struct bpf_prog_array __rcu *old_array;
151
152 old_array = xchg(&cgrp->bpf.effective[type], array);
153 /* free prog array after grace period, since __cgroup_bpf_run_*()
154 * might be still walking the array
155 */
156 bpf_prog_array_free(old_array);
157}
158
Daniel Mack30070982016-11-23 16:52:26 +0100159/**
160 * cgroup_bpf_inherit() - inherit effective programs from parent
161 * @cgrp: the cgroup to modify
Daniel Mack30070982016-11-23 16:52:26 +0100162 */
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700163int cgroup_bpf_inherit(struct cgroup *cgrp)
Daniel Mack30070982016-11-23 16:52:26 +0100164{
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700165/* has to use marco instead of const int, since compiler thinks
166 * that array below is variable length
167 */
168#define NR ARRAY_SIZE(cgrp->bpf.effective)
169 struct bpf_prog_array __rcu *arrays[NR] = {};
170 int i;
Daniel Mack30070982016-11-23 16:52:26 +0100171
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700172 for (i = 0; i < NR; i++)
173 INIT_LIST_HEAD(&cgrp->bpf.progs[i]);
Daniel Mack30070982016-11-23 16:52:26 +0100174
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700175 for (i = 0; i < NR; i++)
176 if (compute_effective_progs(cgrp, i, &arrays[i]))
177 goto cleanup;
178
179 for (i = 0; i < NR; i++)
180 activate_effective_progs(cgrp, i, arrays[i]);
181
182 return 0;
183cleanup:
184 for (i = 0; i < NR; i++)
185 bpf_prog_array_free(arrays[i]);
186 return -ENOMEM;
Daniel Mack30070982016-11-23 16:52:26 +0100187}
188
Roman Gushchin85fc4b12018-08-06 14:27:28 -0700189static int update_effective_progs(struct cgroup *cgrp,
190 enum bpf_attach_type type)
191{
192 struct cgroup_subsys_state *css;
193 int err;
194
195 /* allocate and recompute effective prog arrays */
196 css_for_each_descendant_pre(css, &cgrp->self) {
197 struct cgroup *desc = container_of(css, struct cgroup, self);
198
199 err = compute_effective_progs(desc, type, &desc->bpf.inactive);
200 if (err)
201 goto cleanup;
202 }
203
204 /* all allocations were successful. Activate all prog arrays */
205 css_for_each_descendant_pre(css, &cgrp->self) {
206 struct cgroup *desc = container_of(css, struct cgroup, self);
207
208 activate_effective_progs(desc, type, desc->bpf.inactive);
209 desc->bpf.inactive = NULL;
210 }
211
212 return 0;
213
214cleanup:
215 /* oom while computing effective. Free all computed effective arrays
216 * since they were not activated
217 */
218 css_for_each_descendant_pre(css, &cgrp->self) {
219 struct cgroup *desc = container_of(css, struct cgroup, self);
220
221 bpf_prog_array_free(desc->bpf.inactive);
222 desc->bpf.inactive = NULL;
223 }
224
225 return err;
226}
227
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700228#define BPF_CGROUP_MAX_PROGS 64
229
Daniel Mack30070982016-11-23 16:52:26 +0100230/**
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700231 * __cgroup_bpf_attach() - Attach the program to a cgroup, and
Daniel Mack30070982016-11-23 16:52:26 +0100232 * propagate the change to descendants
233 * @cgrp: The cgroup which descendants to traverse
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700234 * @prog: A program to attach
235 * @type: Type of attach operation
Valdis Kletnieks1832f4e2019-01-29 01:47:06 -0500236 * @flags: Option flags
Daniel Mack30070982016-11-23 16:52:26 +0100237 *
238 * Must be called with cgroup_mutex held.
239 */
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700240int __cgroup_bpf_attach(struct cgroup *cgrp, struct bpf_prog *prog,
241 enum bpf_attach_type type, u32 flags)
Daniel Mack30070982016-11-23 16:52:26 +0100242{
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700243 struct list_head *progs = &cgrp->bpf.progs[type];
244 struct bpf_prog *old_prog = NULL;
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000245 struct bpf_cgroup_storage *storage[MAX_BPF_CGROUP_STORAGE_TYPE],
246 *old_storage[MAX_BPF_CGROUP_STORAGE_TYPE] = {NULL};
247 enum bpf_cgroup_storage_type stype;
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700248 struct bpf_prog_list *pl;
249 bool pl_was_allocated;
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700250 int err;
Daniel Mack30070982016-11-23 16:52:26 +0100251
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700252 if ((flags & BPF_F_ALLOW_OVERRIDE) && (flags & BPF_F_ALLOW_MULTI))
253 /* invalid combination */
254 return -EINVAL;
Daniel Mack30070982016-11-23 16:52:26 +0100255
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700256 if (!hierarchy_allows_attach(cgrp, type, flags))
257 return -EPERM;
258
259 if (!list_empty(progs) && cgrp->bpf.flags[type] != flags)
260 /* Disallow attaching non-overridable on top
261 * of existing overridable in this cgroup.
262 * Disallow attaching multi-prog if overridable or none
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800263 */
264 return -EPERM;
265
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700266 if (prog_list_length(progs) >= BPF_CGROUP_MAX_PROGS)
267 return -E2BIG;
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800268
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000269 for_each_cgroup_storage_type(stype) {
270 storage[stype] = bpf_cgroup_storage_alloc(prog, stype);
271 if (IS_ERR(storage[stype])) {
272 storage[stype] = NULL;
273 for_each_cgroup_storage_type(stype)
274 bpf_cgroup_storage_free(storage[stype]);
275 return -ENOMEM;
276 }
277 }
Roman Gushchind7bf2c12018-08-02 14:27:20 -0700278
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700279 if (flags & BPF_F_ALLOW_MULTI) {
Roman Gushchind7bf2c12018-08-02 14:27:20 -0700280 list_for_each_entry(pl, progs, node) {
281 if (pl->prog == prog) {
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700282 /* disallow attaching the same prog twice */
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000283 for_each_cgroup_storage_type(stype)
284 bpf_cgroup_storage_free(storage[stype]);
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700285 return -EINVAL;
Roman Gushchind7bf2c12018-08-02 14:27:20 -0700286 }
287 }
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800288
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700289 pl = kmalloc(sizeof(*pl), GFP_KERNEL);
Roman Gushchind7bf2c12018-08-02 14:27:20 -0700290 if (!pl) {
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000291 for_each_cgroup_storage_type(stype)
292 bpf_cgroup_storage_free(storage[stype]);
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700293 return -ENOMEM;
Roman Gushchind7bf2c12018-08-02 14:27:20 -0700294 }
295
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700296 pl_was_allocated = true;
297 pl->prog = prog;
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000298 for_each_cgroup_storage_type(stype)
299 pl->storage[stype] = storage[stype];
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700300 list_add_tail(&pl->node, progs);
301 } else {
302 if (list_empty(progs)) {
303 pl = kmalloc(sizeof(*pl), GFP_KERNEL);
Roman Gushchind7bf2c12018-08-02 14:27:20 -0700304 if (!pl) {
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000305 for_each_cgroup_storage_type(stype)
306 bpf_cgroup_storage_free(storage[stype]);
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700307 return -ENOMEM;
Roman Gushchind7bf2c12018-08-02 14:27:20 -0700308 }
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700309 pl_was_allocated = true;
310 list_add_tail(&pl->node, progs);
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800311 } else {
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700312 pl = list_first_entry(progs, typeof(*pl), node);
313 old_prog = pl->prog;
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000314 for_each_cgroup_storage_type(stype) {
315 old_storage[stype] = pl->storage[stype];
316 bpf_cgroup_storage_unlink(old_storage[stype]);
317 }
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700318 pl_was_allocated = false;
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800319 }
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700320 pl->prog = prog;
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000321 for_each_cgroup_storage_type(stype)
322 pl->storage[stype] = storage[stype];
Daniel Mack30070982016-11-23 16:52:26 +0100323 }
324
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700325 cgrp->bpf.flags[type] = flags;
Daniel Mack30070982016-11-23 16:52:26 +0100326
Roman Gushchin85fc4b12018-08-06 14:27:28 -0700327 err = update_effective_progs(cgrp, type);
328 if (err)
329 goto cleanup;
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700330
331 static_branch_inc(&cgroup_bpf_enabled_key);
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000332 for_each_cgroup_storage_type(stype) {
333 if (!old_storage[stype])
334 continue;
335 bpf_cgroup_storage_free(old_storage[stype]);
336 }
Daniel Mack30070982016-11-23 16:52:26 +0100337 if (old_prog) {
338 bpf_prog_put(old_prog);
339 static_branch_dec(&cgroup_bpf_enabled_key);
340 }
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000341 for_each_cgroup_storage_type(stype)
342 bpf_cgroup_storage_link(storage[stype], cgrp, type);
Alexei Starovoitov7f677632017-02-10 20:28:24 -0800343 return 0;
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700344
345cleanup:
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700346 /* and cleanup the prog list */
347 pl->prog = old_prog;
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000348 for_each_cgroup_storage_type(stype) {
349 bpf_cgroup_storage_free(pl->storage[stype]);
350 pl->storage[stype] = old_storage[stype];
351 bpf_cgroup_storage_link(old_storage[stype], cgrp, type);
352 }
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700353 if (pl_was_allocated) {
354 list_del(&pl->node);
355 kfree(pl);
356 }
357 return err;
358}
359
360/**
361 * __cgroup_bpf_detach() - Detach the program from a cgroup, and
362 * propagate the change to descendants
363 * @cgrp: The cgroup which descendants to traverse
364 * @prog: A program to detach or NULL
365 * @type: Type of detach operation
366 *
367 * Must be called with cgroup_mutex held.
368 */
369int __cgroup_bpf_detach(struct cgroup *cgrp, struct bpf_prog *prog,
Valdis Kletnieks1832f4e2019-01-29 01:47:06 -0500370 enum bpf_attach_type type)
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700371{
372 struct list_head *progs = &cgrp->bpf.progs[type];
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000373 enum bpf_cgroup_storage_type stype;
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700374 u32 flags = cgrp->bpf.flags[type];
375 struct bpf_prog *old_prog = NULL;
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700376 struct bpf_prog_list *pl;
377 int err;
378
379 if (flags & BPF_F_ALLOW_MULTI) {
380 if (!prog)
381 /* to detach MULTI prog the user has to specify valid FD
382 * of the program to be detached
383 */
384 return -EINVAL;
385 } else {
386 if (list_empty(progs))
387 /* report error when trying to detach and nothing is attached */
388 return -ENOENT;
389 }
390
391 if (flags & BPF_F_ALLOW_MULTI) {
392 /* find the prog and detach it */
393 list_for_each_entry(pl, progs, node) {
394 if (pl->prog != prog)
395 continue;
396 old_prog = prog;
397 /* mark it deleted, so it's ignored while
398 * recomputing effective
399 */
400 pl->prog = NULL;
401 break;
402 }
403 if (!old_prog)
404 return -ENOENT;
405 } else {
406 /* to maintain backward compatibility NONE and OVERRIDE cgroups
407 * allow detaching with invalid FD (prog==NULL)
408 */
409 pl = list_first_entry(progs, typeof(*pl), node);
410 old_prog = pl->prog;
411 pl->prog = NULL;
412 }
413
Roman Gushchin85fc4b12018-08-06 14:27:28 -0700414 err = update_effective_progs(cgrp, type);
415 if (err)
416 goto cleanup;
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700417
418 /* now can actually delete it from this cgroup list */
419 list_del(&pl->node);
Roman Gushchin8bad74f2018-09-28 14:45:36 +0000420 for_each_cgroup_storage_type(stype) {
421 bpf_cgroup_storage_unlink(pl->storage[stype]);
422 bpf_cgroup_storage_free(pl->storage[stype]);
423 }
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700424 kfree(pl);
425 if (list_empty(progs))
426 /* last program was detached, reset flags to zero */
427 cgrp->bpf.flags[type] = 0;
428
429 bpf_prog_put(old_prog);
430 static_branch_dec(&cgroup_bpf_enabled_key);
431 return 0;
432
433cleanup:
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700434 /* and restore back old_prog */
435 pl->prog = old_prog;
436 return err;
Daniel Mack30070982016-11-23 16:52:26 +0100437}
438
Alexei Starovoitov468e2f62017-10-02 22:50:22 -0700439/* Must be called with cgroup_mutex held to avoid races. */
440int __cgroup_bpf_query(struct cgroup *cgrp, const union bpf_attr *attr,
441 union bpf_attr __user *uattr)
442{
443 __u32 __user *prog_ids = u64_to_user_ptr(attr->query.prog_ids);
444 enum bpf_attach_type type = attr->query.attach_type;
445 struct list_head *progs = &cgrp->bpf.progs[type];
446 u32 flags = cgrp->bpf.flags[type];
447 int cnt, ret = 0, i;
448
449 if (attr->query.query_flags & BPF_F_QUERY_EFFECTIVE)
450 cnt = bpf_prog_array_length(cgrp->bpf.effective[type]);
451 else
452 cnt = prog_list_length(progs);
453
454 if (copy_to_user(&uattr->query.attach_flags, &flags, sizeof(flags)))
455 return -EFAULT;
456 if (copy_to_user(&uattr->query.prog_cnt, &cnt, sizeof(cnt)))
457 return -EFAULT;
458 if (attr->query.prog_cnt == 0 || !prog_ids || !cnt)
459 /* return early if user requested only program count + flags */
460 return 0;
461 if (attr->query.prog_cnt < cnt) {
462 cnt = attr->query.prog_cnt;
463 ret = -ENOSPC;
464 }
465
466 if (attr->query.query_flags & BPF_F_QUERY_EFFECTIVE) {
467 return bpf_prog_array_copy_to_user(cgrp->bpf.effective[type],
468 prog_ids, cnt);
469 } else {
470 struct bpf_prog_list *pl;
471 u32 id;
472
473 i = 0;
474 list_for_each_entry(pl, progs, node) {
475 id = pl->prog->aux->id;
476 if (copy_to_user(prog_ids + i, &id, sizeof(id)))
477 return -EFAULT;
478 if (++i == cnt)
479 break;
480 }
481 }
482 return ret;
483}
484
Sean Youngfdb5c452018-06-19 00:04:24 +0100485int cgroup_bpf_prog_attach(const union bpf_attr *attr,
486 enum bpf_prog_type ptype, struct bpf_prog *prog)
487{
488 struct cgroup *cgrp;
489 int ret;
490
491 cgrp = cgroup_get_from_fd(attr->target_fd);
492 if (IS_ERR(cgrp))
493 return PTR_ERR(cgrp);
494
495 ret = cgroup_bpf_attach(cgrp, prog, attr->attach_type,
496 attr->attach_flags);
497 cgroup_put(cgrp);
498 return ret;
499}
500
501int cgroup_bpf_prog_detach(const union bpf_attr *attr, enum bpf_prog_type ptype)
502{
503 struct bpf_prog *prog;
504 struct cgroup *cgrp;
505 int ret;
506
507 cgrp = cgroup_get_from_fd(attr->target_fd);
508 if (IS_ERR(cgrp))
509 return PTR_ERR(cgrp);
510
511 prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
512 if (IS_ERR(prog))
513 prog = NULL;
514
515 ret = cgroup_bpf_detach(cgrp, prog, attr->attach_type, 0);
516 if (prog)
517 bpf_prog_put(prog);
518
519 cgroup_put(cgrp);
520 return ret;
521}
522
523int cgroup_bpf_prog_query(const union bpf_attr *attr,
524 union bpf_attr __user *uattr)
525{
526 struct cgroup *cgrp;
527 int ret;
528
529 cgrp = cgroup_get_from_fd(attr->query.target_fd);
530 if (IS_ERR(cgrp))
531 return PTR_ERR(cgrp);
532
533 ret = cgroup_bpf_query(cgrp, attr, uattr);
534
535 cgroup_put(cgrp);
536 return ret;
537}
538
Daniel Mack30070982016-11-23 16:52:26 +0100539/**
David Ahernb2cd1252016-12-01 08:48:03 -0800540 * __cgroup_bpf_run_filter_skb() - Run a program for packet filtering
Willem de Bruijn8f917bb2017-04-11 14:08:08 -0400541 * @sk: The socket sending or receiving traffic
Daniel Mack30070982016-11-23 16:52:26 +0100542 * @skb: The skb that is being sent or received
543 * @type: The type of program to be exectuted
544 *
545 * If no socket is passed, or the socket is not of type INET or INET6,
546 * this function does nothing and returns 0.
547 *
548 * The program type passed in via @type must be suitable for network
549 * filtering. No further check is performed to assert that.
550 *
551 * This function will return %-EPERM if any if an attached program was found
552 * and if it returned != 1 during execution. In all other cases, 0 is returned.
553 */
David Ahernb2cd1252016-12-01 08:48:03 -0800554int __cgroup_bpf_run_filter_skb(struct sock *sk,
555 struct sk_buff *skb,
556 enum bpf_attach_type type)
Daniel Mack30070982016-11-23 16:52:26 +0100557{
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700558 unsigned int offset = skb->data - skb_network_header(skb);
559 struct sock *save_sk;
Song Liub39b5f42018-10-19 09:57:57 -0700560 void *saved_data_end;
Daniel Mack30070982016-11-23 16:52:26 +0100561 struct cgroup *cgrp;
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700562 int ret;
Daniel Mack30070982016-11-23 16:52:26 +0100563
564 if (!sk || !sk_fullsock(sk))
565 return 0;
566
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700567 if (sk->sk_family != AF_INET && sk->sk_family != AF_INET6)
Daniel Mack30070982016-11-23 16:52:26 +0100568 return 0;
569
570 cgrp = sock_cgroup_ptr(&sk->sk_cgrp_data);
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700571 save_sk = skb->sk;
572 skb->sk = sk;
573 __skb_push(skb, offset);
Song Liub39b5f42018-10-19 09:57:57 -0700574
575 /* compute pointers for the bpf prog */
576 bpf_compute_and_save_data_end(skb, &saved_data_end);
577
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700578 ret = BPF_PROG_RUN_ARRAY(cgrp->bpf.effective[type], skb,
Alexei Starovoitov6cab5e92019-01-28 18:43:34 -0800579 __bpf_prog_run_save_cb);
Song Liub39b5f42018-10-19 09:57:57 -0700580 bpf_restore_data_end(skb, saved_data_end);
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700581 __skb_pull(skb, offset);
582 skb->sk = save_sk;
583 return ret == 1 ? 0 : -EPERM;
Daniel Mack30070982016-11-23 16:52:26 +0100584}
David Ahernb2cd1252016-12-01 08:48:03 -0800585EXPORT_SYMBOL(__cgroup_bpf_run_filter_skb);
David Ahern610236582016-12-01 08:48:04 -0800586
587/**
588 * __cgroup_bpf_run_filter_sk() - Run a program on a sock
589 * @sk: sock structure to manipulate
590 * @type: The type of program to be exectuted
591 *
592 * socket is passed is expected to be of type INET or INET6.
593 *
594 * The program type passed in via @type must be suitable for sock
595 * filtering. No further check is performed to assert that.
596 *
597 * This function will return %-EPERM if any if an attached program was found
598 * and if it returned != 1 during execution. In all other cases, 0 is returned.
599 */
600int __cgroup_bpf_run_filter_sk(struct sock *sk,
601 enum bpf_attach_type type)
602{
603 struct cgroup *cgrp = sock_cgroup_ptr(&sk->sk_cgrp_data);
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700604 int ret;
David Ahern610236582016-12-01 08:48:04 -0800605
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700606 ret = BPF_PROG_RUN_ARRAY(cgrp->bpf.effective[type], sk, BPF_PROG_RUN);
607 return ret == 1 ? 0 : -EPERM;
David Ahern610236582016-12-01 08:48:04 -0800608}
609EXPORT_SYMBOL(__cgroup_bpf_run_filter_sk);
Lawrence Brakmo40304b22017-06-30 20:02:40 -0700610
611/**
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700612 * __cgroup_bpf_run_filter_sock_addr() - Run a program on a sock and
613 * provided by user sockaddr
614 * @sk: sock struct that will use sockaddr
615 * @uaddr: sockaddr struct provided by user
616 * @type: The type of program to be exectuted
Andrey Ignatov1cedee12018-05-25 08:55:23 -0700617 * @t_ctx: Pointer to attach type specific context
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700618 *
619 * socket is expected to be of type INET or INET6.
620 *
621 * This function will return %-EPERM if an attached program is found and
622 * returned value != 1 during execution. In all other cases, 0 is returned.
623 */
624int __cgroup_bpf_run_filter_sock_addr(struct sock *sk,
625 struct sockaddr *uaddr,
Andrey Ignatov1cedee12018-05-25 08:55:23 -0700626 enum bpf_attach_type type,
627 void *t_ctx)
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700628{
629 struct bpf_sock_addr_kern ctx = {
630 .sk = sk,
631 .uaddr = uaddr,
Andrey Ignatov1cedee12018-05-25 08:55:23 -0700632 .t_ctx = t_ctx,
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700633 };
Andrey Ignatov1cedee12018-05-25 08:55:23 -0700634 struct sockaddr_storage unspec;
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700635 struct cgroup *cgrp;
636 int ret;
637
638 /* Check socket family since not all sockets represent network
639 * endpoint (e.g. AF_UNIX).
640 */
641 if (sk->sk_family != AF_INET && sk->sk_family != AF_INET6)
642 return 0;
643
Andrey Ignatov1cedee12018-05-25 08:55:23 -0700644 if (!ctx.uaddr) {
645 memset(&unspec, 0, sizeof(unspec));
646 ctx.uaddr = (struct sockaddr *)&unspec;
647 }
648
Andrey Ignatov4fbac772018-03-30 15:08:02 -0700649 cgrp = sock_cgroup_ptr(&sk->sk_cgrp_data);
650 ret = BPF_PROG_RUN_ARRAY(cgrp->bpf.effective[type], &ctx, BPF_PROG_RUN);
651
652 return ret == 1 ? 0 : -EPERM;
653}
654EXPORT_SYMBOL(__cgroup_bpf_run_filter_sock_addr);
655
656/**
Lawrence Brakmo40304b22017-06-30 20:02:40 -0700657 * __cgroup_bpf_run_filter_sock_ops() - Run a program on a sock
658 * @sk: socket to get cgroup from
659 * @sock_ops: bpf_sock_ops_kern struct to pass to program. Contains
660 * sk with connection information (IP addresses, etc.) May not contain
661 * cgroup info if it is a req sock.
662 * @type: The type of program to be exectuted
663 *
664 * socket passed is expected to be of type INET or INET6.
665 *
666 * The program type passed in via @type must be suitable for sock_ops
667 * filtering. No further check is performed to assert that.
668 *
669 * This function will return %-EPERM if any if an attached program was found
670 * and if it returned != 1 during execution. In all other cases, 0 is returned.
671 */
672int __cgroup_bpf_run_filter_sock_ops(struct sock *sk,
673 struct bpf_sock_ops_kern *sock_ops,
674 enum bpf_attach_type type)
675{
676 struct cgroup *cgrp = sock_cgroup_ptr(&sk->sk_cgrp_data);
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700677 int ret;
Lawrence Brakmo40304b22017-06-30 20:02:40 -0700678
Alexei Starovoitov324bda9e62017-10-02 22:50:21 -0700679 ret = BPF_PROG_RUN_ARRAY(cgrp->bpf.effective[type], sock_ops,
680 BPF_PROG_RUN);
681 return ret == 1 ? 0 : -EPERM;
Lawrence Brakmo40304b22017-06-30 20:02:40 -0700682}
683EXPORT_SYMBOL(__cgroup_bpf_run_filter_sock_ops);
Roman Gushchinebc614f2017-11-05 08:15:32 -0500684
685int __cgroup_bpf_check_dev_permission(short dev_type, u32 major, u32 minor,
686 short access, enum bpf_attach_type type)
687{
688 struct cgroup *cgrp;
689 struct bpf_cgroup_dev_ctx ctx = {
690 .access_type = (access << 16) | dev_type,
691 .major = major,
692 .minor = minor,
693 };
694 int allow = 1;
695
696 rcu_read_lock();
697 cgrp = task_dfl_cgroup(current);
698 allow = BPF_PROG_RUN_ARRAY(cgrp->bpf.effective[type], &ctx,
699 BPF_PROG_RUN);
700 rcu_read_unlock();
701
702 return !allow;
703}
704EXPORT_SYMBOL(__cgroup_bpf_check_dev_permission);
705
706static const struct bpf_func_proto *
Andrey Ignatovb1cd6092019-03-12 09:27:09 -0700707cgroup_base_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog)
Roman Gushchinebc614f2017-11-05 08:15:32 -0500708{
709 switch (func_id) {
710 case BPF_FUNC_map_lookup_elem:
711 return &bpf_map_lookup_elem_proto;
712 case BPF_FUNC_map_update_elem:
713 return &bpf_map_update_elem_proto;
714 case BPF_FUNC_map_delete_elem:
715 return &bpf_map_delete_elem_proto;
716 case BPF_FUNC_get_current_uid_gid:
717 return &bpf_get_current_uid_gid_proto;
Roman Gushchincd339432018-08-02 14:27:24 -0700718 case BPF_FUNC_get_local_storage:
719 return &bpf_get_local_storage_proto;
Yonghong Song5bf7a602018-09-27 14:37:30 -0700720 case BPF_FUNC_get_current_cgroup_id:
721 return &bpf_get_current_cgroup_id_proto;
Roman Gushchinebc614f2017-11-05 08:15:32 -0500722 case BPF_FUNC_trace_printk:
723 if (capable(CAP_SYS_ADMIN))
724 return bpf_get_trace_printk_proto();
Mathieu Malaterrec8dc7982019-01-16 20:35:29 +0100725 /* fall through */
Roman Gushchinebc614f2017-11-05 08:15:32 -0500726 default:
727 return NULL;
728 }
729}
730
Andrey Ignatovb1cd6092019-03-12 09:27:09 -0700731static const struct bpf_func_proto *
732cgroup_dev_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog)
733{
734 return cgroup_base_func_proto(func_id, prog);
735}
736
Roman Gushchinebc614f2017-11-05 08:15:32 -0500737static bool cgroup_dev_is_valid_access(int off, int size,
738 enum bpf_access_type type,
Andrey Ignatov5e43f892018-03-30 15:08:00 -0700739 const struct bpf_prog *prog,
Roman Gushchinebc614f2017-11-05 08:15:32 -0500740 struct bpf_insn_access_aux *info)
741{
Yonghong Song06ef0cc2017-12-18 10:13:44 -0800742 const int size_default = sizeof(__u32);
743
Roman Gushchinebc614f2017-11-05 08:15:32 -0500744 if (type == BPF_WRITE)
745 return false;
746
747 if (off < 0 || off + size > sizeof(struct bpf_cgroup_dev_ctx))
748 return false;
749 /* The verifier guarantees that size > 0. */
750 if (off % size != 0)
751 return false;
Yonghong Song06ef0cc2017-12-18 10:13:44 -0800752
753 switch (off) {
754 case bpf_ctx_range(struct bpf_cgroup_dev_ctx, access_type):
755 bpf_ctx_record_field_size(info, size_default);
756 if (!bpf_ctx_narrow_access_ok(off, size, size_default))
757 return false;
758 break;
759 default:
760 if (size != size_default)
761 return false;
762 }
Roman Gushchinebc614f2017-11-05 08:15:32 -0500763
764 return true;
765}
766
767const struct bpf_prog_ops cg_dev_prog_ops = {
768};
769
770const struct bpf_verifier_ops cg_dev_verifier_ops = {
771 .get_func_proto = cgroup_dev_func_proto,
772 .is_valid_access = cgroup_dev_is_valid_access,
773};
Andrey Ignatov7b146ce2019-02-27 12:59:24 -0800774
775/**
776 * __cgroup_bpf_run_filter_sysctl - Run a program on sysctl
777 *
778 * @head: sysctl table header
779 * @table: sysctl table
780 * @write: sysctl is being read (= 0) or written (= 1)
781 * @type: type of program to be executed
782 *
783 * Program is run when sysctl is being accessed, either read or written, and
784 * can allow or deny such access.
785 *
786 * This function will return %-EPERM if an attached program is found and
787 * returned value != 1 during execution. In all other cases 0 is returned.
788 */
789int __cgroup_bpf_run_filter_sysctl(struct ctl_table_header *head,
790 struct ctl_table *table, int write,
791 enum bpf_attach_type type)
792{
793 struct bpf_sysctl_kern ctx = {
794 .head = head,
795 .table = table,
796 .write = write,
Andrey Ignatov1d11b302019-02-28 19:22:15 -0800797 .cur_val = NULL,
798 .cur_len = PAGE_SIZE,
Andrey Ignatov7b146ce2019-02-27 12:59:24 -0800799 };
800 struct cgroup *cgrp;
801 int ret;
802
Andrey Ignatov1d11b302019-02-28 19:22:15 -0800803 ctx.cur_val = kmalloc_track_caller(ctx.cur_len, GFP_KERNEL);
804 if (ctx.cur_val) {
805 mm_segment_t old_fs;
806 loff_t pos = 0;
807
808 old_fs = get_fs();
809 set_fs(KERNEL_DS);
810 if (table->proc_handler(table, 0, (void __user *)ctx.cur_val,
811 &ctx.cur_len, &pos)) {
812 /* Let BPF program decide how to proceed. */
813 ctx.cur_len = 0;
814 }
815 set_fs(old_fs);
816 } else {
817 /* Let BPF program decide how to proceed. */
818 ctx.cur_len = 0;
819 }
820
Andrey Ignatov7b146ce2019-02-27 12:59:24 -0800821 rcu_read_lock();
822 cgrp = task_dfl_cgroup(current);
823 ret = BPF_PROG_RUN_ARRAY(cgrp->bpf.effective[type], &ctx, BPF_PROG_RUN);
824 rcu_read_unlock();
825
Andrey Ignatov1d11b302019-02-28 19:22:15 -0800826 kfree(ctx.cur_val);
827
Andrey Ignatov7b146ce2019-02-27 12:59:24 -0800828 return ret == 1 ? 0 : -EPERM;
829}
830EXPORT_SYMBOL(__cgroup_bpf_run_filter_sysctl);
831
Andrey Ignatov808649f2019-02-27 13:28:48 -0800832static ssize_t sysctl_cpy_dir(const struct ctl_dir *dir, char **bufp,
833 size_t *lenp)
834{
835 ssize_t tmp_ret = 0, ret;
836
837 if (dir->header.parent) {
838 tmp_ret = sysctl_cpy_dir(dir->header.parent, bufp, lenp);
839 if (tmp_ret < 0)
840 return tmp_ret;
841 }
842
843 ret = strscpy(*bufp, dir->header.ctl_table[0].procname, *lenp);
844 if (ret < 0)
845 return ret;
846 *bufp += ret;
847 *lenp -= ret;
848 ret += tmp_ret;
849
850 /* Avoid leading slash. */
851 if (!ret)
852 return ret;
853
854 tmp_ret = strscpy(*bufp, "/", *lenp);
855 if (tmp_ret < 0)
856 return tmp_ret;
857 *bufp += tmp_ret;
858 *lenp -= tmp_ret;
859
860 return ret + tmp_ret;
861}
862
863BPF_CALL_4(bpf_sysctl_get_name, struct bpf_sysctl_kern *, ctx, char *, buf,
864 size_t, buf_len, u64, flags)
865{
866 ssize_t tmp_ret = 0, ret;
867
868 if (!buf)
869 return -EINVAL;
870
871 if (!(flags & BPF_F_SYSCTL_BASE_NAME)) {
872 if (!ctx->head)
873 return -EINVAL;
874 tmp_ret = sysctl_cpy_dir(ctx->head->parent, &buf, &buf_len);
875 if (tmp_ret < 0)
876 return tmp_ret;
877 }
878
879 ret = strscpy(buf, ctx->table->procname, buf_len);
880
881 return ret < 0 ? ret : tmp_ret + ret;
882}
883
884static const struct bpf_func_proto bpf_sysctl_get_name_proto = {
885 .func = bpf_sysctl_get_name,
886 .gpl_only = false,
887 .ret_type = RET_INTEGER,
888 .arg1_type = ARG_PTR_TO_CTX,
889 .arg2_type = ARG_PTR_TO_MEM,
890 .arg3_type = ARG_CONST_SIZE,
891 .arg4_type = ARG_ANYTHING,
892};
893
Andrey Ignatov1d11b302019-02-28 19:22:15 -0800894static int copy_sysctl_value(char *dst, size_t dst_len, char *src,
895 size_t src_len)
896{
897 if (!dst)
898 return -EINVAL;
899
900 if (!dst_len)
901 return -E2BIG;
902
903 if (!src || !src_len) {
904 memset(dst, 0, dst_len);
905 return -EINVAL;
906 }
907
908 memcpy(dst, src, min(dst_len, src_len));
909
910 if (dst_len > src_len) {
911 memset(dst + src_len, '\0', dst_len - src_len);
912 return src_len;
913 }
914
915 dst[dst_len - 1] = '\0';
916
917 return -E2BIG;
918}
919
920BPF_CALL_3(bpf_sysctl_get_current_value, struct bpf_sysctl_kern *, ctx,
921 char *, buf, size_t, buf_len)
922{
923 return copy_sysctl_value(buf, buf_len, ctx->cur_val, ctx->cur_len);
924}
925
926static const struct bpf_func_proto bpf_sysctl_get_current_value_proto = {
927 .func = bpf_sysctl_get_current_value,
928 .gpl_only = false,
929 .ret_type = RET_INTEGER,
930 .arg1_type = ARG_PTR_TO_CTX,
931 .arg2_type = ARG_PTR_TO_UNINIT_MEM,
932 .arg3_type = ARG_CONST_SIZE,
933};
934
Andrey Ignatov7b146ce2019-02-27 12:59:24 -0800935static const struct bpf_func_proto *
936sysctl_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog)
937{
Andrey Ignatov808649f2019-02-27 13:28:48 -0800938 switch (func_id) {
939 case BPF_FUNC_sysctl_get_name:
940 return &bpf_sysctl_get_name_proto;
Andrey Ignatov1d11b302019-02-28 19:22:15 -0800941 case BPF_FUNC_sysctl_get_current_value:
942 return &bpf_sysctl_get_current_value_proto;
Andrey Ignatov808649f2019-02-27 13:28:48 -0800943 default:
944 return cgroup_base_func_proto(func_id, prog);
945 }
Andrey Ignatov7b146ce2019-02-27 12:59:24 -0800946}
947
948static bool sysctl_is_valid_access(int off, int size, enum bpf_access_type type,
949 const struct bpf_prog *prog,
950 struct bpf_insn_access_aux *info)
951{
952 const int size_default = sizeof(__u32);
953
954 if (off < 0 || off + size > sizeof(struct bpf_sysctl) ||
955 off % size || type != BPF_READ)
956 return false;
957
958 switch (off) {
959 case offsetof(struct bpf_sysctl, write):
960 bpf_ctx_record_field_size(info, size_default);
961 return bpf_ctx_narrow_access_ok(off, size, size_default);
962 default:
963 return false;
964 }
965}
966
967static u32 sysctl_convert_ctx_access(enum bpf_access_type type,
968 const struct bpf_insn *si,
969 struct bpf_insn *insn_buf,
970 struct bpf_prog *prog, u32 *target_size)
971{
972 struct bpf_insn *insn = insn_buf;
973
974 switch (si->off) {
975 case offsetof(struct bpf_sysctl, write):
976 *insn++ = BPF_LDX_MEM(
977 BPF_SIZE(si->code), si->dst_reg, si->src_reg,
978 bpf_target_off(struct bpf_sysctl_kern, write,
979 FIELD_SIZEOF(struct bpf_sysctl_kern,
980 write),
981 target_size));
982 break;
983 }
984
985 return insn - insn_buf;
986}
987
988const struct bpf_verifier_ops cg_sysctl_verifier_ops = {
989 .get_func_proto = sysctl_func_proto,
990 .is_valid_access = sysctl_is_valid_access,
991 .convert_ctx_access = sysctl_convert_ctx_access,
992};
993
994const struct bpf_prog_ops cg_sysctl_prog_ops = {
995};