syscall.c 25 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123
  1. /* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
  2. *
  3. * This program is free software; you can redistribute it and/or
  4. * modify it under the terms of version 2 of the GNU General Public
  5. * License as published by the Free Software Foundation.
  6. *
  7. * This program is distributed in the hope that it will be useful, but
  8. * WITHOUT ANY WARRANTY; without even the implied warranty of
  9. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  10. * General Public License for more details.
  11. */
  12. #include <linux/bpf.h>
  13. #include <linux/bpf_trace.h>
  14. #include <linux/syscalls.h>
  15. #include <linux/slab.h>
  16. #include <linux/sched/signal.h>
  17. #include <linux/vmalloc.h>
  18. #include <linux/mmzone.h>
  19. #include <linux/anon_inodes.h>
  20. #include <linux/file.h>
  21. #include <linux/license.h>
  22. #include <linux/filter.h>
  23. #include <linux/version.h>
  24. #include <linux/kernel.h>
  25. #include <linux/idr.h>
  26. DEFINE_PER_CPU(int, bpf_prog_active);
  27. static DEFINE_IDR(prog_idr);
  28. static DEFINE_SPINLOCK(prog_idr_lock);
  29. int sysctl_unprivileged_bpf_disabled __read_mostly;
  30. static const struct bpf_map_ops * const bpf_map_types[] = {
  31. #define BPF_PROG_TYPE(_id, _ops)
  32. #define BPF_MAP_TYPE(_id, _ops) \
  33. [_id] = &_ops,
  34. #include <linux/bpf_types.h>
  35. #undef BPF_PROG_TYPE
  36. #undef BPF_MAP_TYPE
  37. };
  38. static struct bpf_map *find_and_alloc_map(union bpf_attr *attr)
  39. {
  40. struct bpf_map *map;
  41. if (attr->map_type >= ARRAY_SIZE(bpf_map_types) ||
  42. !bpf_map_types[attr->map_type])
  43. return ERR_PTR(-EINVAL);
  44. map = bpf_map_types[attr->map_type]->map_alloc(attr);
  45. if (IS_ERR(map))
  46. return map;
  47. map->ops = bpf_map_types[attr->map_type];
  48. map->map_type = attr->map_type;
  49. return map;
  50. }
  51. void *bpf_map_area_alloc(size_t size)
  52. {
  53. /* We definitely need __GFP_NORETRY, so OOM killer doesn't
  54. * trigger under memory pressure as we really just want to
  55. * fail instead.
  56. */
  57. const gfp_t flags = __GFP_NOWARN | __GFP_NORETRY | __GFP_ZERO;
  58. void *area;
  59. if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER)) {
  60. area = kmalloc(size, GFP_USER | flags);
  61. if (area != NULL)
  62. return area;
  63. }
  64. return __vmalloc(size, GFP_KERNEL | flags, PAGE_KERNEL);
  65. }
  66. void bpf_map_area_free(void *area)
  67. {
  68. kvfree(area);
  69. }
  70. int bpf_map_precharge_memlock(u32 pages)
  71. {
  72. struct user_struct *user = get_current_user();
  73. unsigned long memlock_limit, cur;
  74. memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  75. cur = atomic_long_read(&user->locked_vm);
  76. free_uid(user);
  77. if (cur + pages > memlock_limit)
  78. return -EPERM;
  79. return 0;
  80. }
  81. static int bpf_map_charge_memlock(struct bpf_map *map)
  82. {
  83. struct user_struct *user = get_current_user();
  84. unsigned long memlock_limit;
  85. memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  86. atomic_long_add(map->pages, &user->locked_vm);
  87. if (atomic_long_read(&user->locked_vm) > memlock_limit) {
  88. atomic_long_sub(map->pages, &user->locked_vm);
  89. free_uid(user);
  90. return -EPERM;
  91. }
  92. map->user = user;
  93. return 0;
  94. }
  95. static void bpf_map_uncharge_memlock(struct bpf_map *map)
  96. {
  97. struct user_struct *user = map->user;
  98. atomic_long_sub(map->pages, &user->locked_vm);
  99. free_uid(user);
  100. }
  101. /* called from workqueue */
  102. static void bpf_map_free_deferred(struct work_struct *work)
  103. {
  104. struct bpf_map *map = container_of(work, struct bpf_map, work);
  105. bpf_map_uncharge_memlock(map);
  106. /* implementation dependent freeing */
  107. map->ops->map_free(map);
  108. }
  109. static void bpf_map_put_uref(struct bpf_map *map)
  110. {
  111. if (atomic_dec_and_test(&map->usercnt)) {
  112. if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY)
  113. bpf_fd_array_map_clear(map);
  114. }
  115. }
  116. /* decrement map refcnt and schedule it for freeing via workqueue
  117. * (unrelying map implementation ops->map_free() might sleep)
  118. */
  119. void bpf_map_put(struct bpf_map *map)
  120. {
  121. if (atomic_dec_and_test(&map->refcnt)) {
  122. INIT_WORK(&map->work, bpf_map_free_deferred);
  123. schedule_work(&map->work);
  124. }
  125. }
  126. void bpf_map_put_with_uref(struct bpf_map *map)
  127. {
  128. bpf_map_put_uref(map);
  129. bpf_map_put(map);
  130. }
  131. static int bpf_map_release(struct inode *inode, struct file *filp)
  132. {
  133. struct bpf_map *map = filp->private_data;
  134. if (map->ops->map_release)
  135. map->ops->map_release(map, filp);
  136. bpf_map_put_with_uref(map);
  137. return 0;
  138. }
  139. #ifdef CONFIG_PROC_FS
  140. static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp)
  141. {
  142. const struct bpf_map *map = filp->private_data;
  143. const struct bpf_array *array;
  144. u32 owner_prog_type = 0;
  145. if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY) {
  146. array = container_of(map, struct bpf_array, map);
  147. owner_prog_type = array->owner_prog_type;
  148. }
  149. seq_printf(m,
  150. "map_type:\t%u\n"
  151. "key_size:\t%u\n"
  152. "value_size:\t%u\n"
  153. "max_entries:\t%u\n"
  154. "map_flags:\t%#x\n"
  155. "memlock:\t%llu\n",
  156. map->map_type,
  157. map->key_size,
  158. map->value_size,
  159. map->max_entries,
  160. map->map_flags,
  161. map->pages * 1ULL << PAGE_SHIFT);
  162. if (owner_prog_type)
  163. seq_printf(m, "owner_prog_type:\t%u\n",
  164. owner_prog_type);
  165. }
  166. #endif
  167. static const struct file_operations bpf_map_fops = {
  168. #ifdef CONFIG_PROC_FS
  169. .show_fdinfo = bpf_map_show_fdinfo,
  170. #endif
  171. .release = bpf_map_release,
  172. };
  173. int bpf_map_new_fd(struct bpf_map *map)
  174. {
  175. return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
  176. O_RDWR | O_CLOEXEC);
  177. }
  178. /* helper macro to check that unused fields 'union bpf_attr' are zero */
  179. #define CHECK_ATTR(CMD) \
  180. memchr_inv((void *) &attr->CMD##_LAST_FIELD + \
  181. sizeof(attr->CMD##_LAST_FIELD), 0, \
  182. sizeof(*attr) - \
  183. offsetof(union bpf_attr, CMD##_LAST_FIELD) - \
  184. sizeof(attr->CMD##_LAST_FIELD)) != NULL
  185. #define BPF_MAP_CREATE_LAST_FIELD inner_map_fd
  186. /* called via syscall */
  187. static int map_create(union bpf_attr *attr)
  188. {
  189. struct bpf_map *map;
  190. int err;
  191. err = CHECK_ATTR(BPF_MAP_CREATE);
  192. if (err)
  193. return -EINVAL;
  194. /* find map type and init map: hashtable vs rbtree vs bloom vs ... */
  195. map = find_and_alloc_map(attr);
  196. if (IS_ERR(map))
  197. return PTR_ERR(map);
  198. atomic_set(&map->refcnt, 1);
  199. atomic_set(&map->usercnt, 1);
  200. err = bpf_map_charge_memlock(map);
  201. if (err)
  202. goto free_map_nouncharge;
  203. err = bpf_map_new_fd(map);
  204. if (err < 0)
  205. /* failed to allocate fd */
  206. goto free_map;
  207. trace_bpf_map_create(map, err);
  208. return err;
  209. free_map:
  210. bpf_map_uncharge_memlock(map);
  211. free_map_nouncharge:
  212. map->ops->map_free(map);
  213. return err;
  214. }
  215. /* if error is returned, fd is released.
  216. * On success caller should complete fd access with matching fdput()
  217. */
  218. struct bpf_map *__bpf_map_get(struct fd f)
  219. {
  220. if (!f.file)
  221. return ERR_PTR(-EBADF);
  222. if (f.file->f_op != &bpf_map_fops) {
  223. fdput(f);
  224. return ERR_PTR(-EINVAL);
  225. }
  226. return f.file->private_data;
  227. }
  228. /* prog's and map's refcnt limit */
  229. #define BPF_MAX_REFCNT 32768
  230. struct bpf_map *bpf_map_inc(struct bpf_map *map, bool uref)
  231. {
  232. if (atomic_inc_return(&map->refcnt) > BPF_MAX_REFCNT) {
  233. atomic_dec(&map->refcnt);
  234. return ERR_PTR(-EBUSY);
  235. }
  236. if (uref)
  237. atomic_inc(&map->usercnt);
  238. return map;
  239. }
  240. struct bpf_map *bpf_map_get_with_uref(u32 ufd)
  241. {
  242. struct fd f = fdget(ufd);
  243. struct bpf_map *map;
  244. map = __bpf_map_get(f);
  245. if (IS_ERR(map))
  246. return map;
  247. map = bpf_map_inc(map, true);
  248. fdput(f);
  249. return map;
  250. }
  251. int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
  252. {
  253. return -ENOTSUPP;
  254. }
  255. /* last field in 'union bpf_attr' used by this command */
  256. #define BPF_MAP_LOOKUP_ELEM_LAST_FIELD value
  257. static int map_lookup_elem(union bpf_attr *attr)
  258. {
  259. void __user *ukey = u64_to_user_ptr(attr->key);
  260. void __user *uvalue = u64_to_user_ptr(attr->value);
  261. int ufd = attr->map_fd;
  262. struct bpf_map *map;
  263. void *key, *value, *ptr;
  264. u32 value_size;
  265. struct fd f;
  266. int err;
  267. if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
  268. return -EINVAL;
  269. f = fdget(ufd);
  270. map = __bpf_map_get(f);
  271. if (IS_ERR(map))
  272. return PTR_ERR(map);
  273. err = -ENOMEM;
  274. key = kmalloc(map->key_size, GFP_USER);
  275. if (!key)
  276. goto err_put;
  277. err = -EFAULT;
  278. if (copy_from_user(key, ukey, map->key_size) != 0)
  279. goto free_key;
  280. if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
  281. map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
  282. map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
  283. value_size = round_up(map->value_size, 8) * num_possible_cpus();
  284. else
  285. value_size = map->value_size;
  286. err = -ENOMEM;
  287. value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
  288. if (!value)
  289. goto free_key;
  290. if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
  291. map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
  292. err = bpf_percpu_hash_copy(map, key, value);
  293. } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
  294. err = bpf_percpu_array_copy(map, key, value);
  295. } else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
  296. err = bpf_stackmap_copy(map, key, value);
  297. } else if (map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS ||
  298. map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
  299. err = -ENOTSUPP;
  300. } else {
  301. rcu_read_lock();
  302. ptr = map->ops->map_lookup_elem(map, key);
  303. if (ptr)
  304. memcpy(value, ptr, value_size);
  305. rcu_read_unlock();
  306. err = ptr ? 0 : -ENOENT;
  307. }
  308. if (err)
  309. goto free_value;
  310. err = -EFAULT;
  311. if (copy_to_user(uvalue, value, value_size) != 0)
  312. goto free_value;
  313. trace_bpf_map_lookup_elem(map, ufd, key, value);
  314. err = 0;
  315. free_value:
  316. kfree(value);
  317. free_key:
  318. kfree(key);
  319. err_put:
  320. fdput(f);
  321. return err;
  322. }
  323. #define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
  324. static int map_update_elem(union bpf_attr *attr)
  325. {
  326. void __user *ukey = u64_to_user_ptr(attr->key);
  327. void __user *uvalue = u64_to_user_ptr(attr->value);
  328. int ufd = attr->map_fd;
  329. struct bpf_map *map;
  330. void *key, *value;
  331. u32 value_size;
  332. struct fd f;
  333. int err;
  334. if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
  335. return -EINVAL;
  336. f = fdget(ufd);
  337. map = __bpf_map_get(f);
  338. if (IS_ERR(map))
  339. return PTR_ERR(map);
  340. err = -ENOMEM;
  341. key = kmalloc(map->key_size, GFP_USER);
  342. if (!key)
  343. goto err_put;
  344. err = -EFAULT;
  345. if (copy_from_user(key, ukey, map->key_size) != 0)
  346. goto free_key;
  347. if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
  348. map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
  349. map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
  350. value_size = round_up(map->value_size, 8) * num_possible_cpus();
  351. else
  352. value_size = map->value_size;
  353. err = -ENOMEM;
  354. value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
  355. if (!value)
  356. goto free_key;
  357. err = -EFAULT;
  358. if (copy_from_user(value, uvalue, value_size) != 0)
  359. goto free_value;
  360. /* must increment bpf_prog_active to avoid kprobe+bpf triggering from
  361. * inside bpf map update or delete otherwise deadlocks are possible
  362. */
  363. preempt_disable();
  364. __this_cpu_inc(bpf_prog_active);
  365. if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
  366. map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
  367. err = bpf_percpu_hash_update(map, key, value, attr->flags);
  368. } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
  369. err = bpf_percpu_array_update(map, key, value, attr->flags);
  370. } else if (map->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY ||
  371. map->map_type == BPF_MAP_TYPE_PROG_ARRAY ||
  372. map->map_type == BPF_MAP_TYPE_CGROUP_ARRAY ||
  373. map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) {
  374. rcu_read_lock();
  375. err = bpf_fd_array_map_update_elem(map, f.file, key, value,
  376. attr->flags);
  377. rcu_read_unlock();
  378. } else if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
  379. rcu_read_lock();
  380. err = bpf_fd_htab_map_update_elem(map, f.file, key, value,
  381. attr->flags);
  382. rcu_read_unlock();
  383. } else {
  384. rcu_read_lock();
  385. err = map->ops->map_update_elem(map, key, value, attr->flags);
  386. rcu_read_unlock();
  387. }
  388. __this_cpu_dec(bpf_prog_active);
  389. preempt_enable();
  390. if (!err)
  391. trace_bpf_map_update_elem(map, ufd, key, value);
  392. free_value:
  393. kfree(value);
  394. free_key:
  395. kfree(key);
  396. err_put:
  397. fdput(f);
  398. return err;
  399. }
  400. #define BPF_MAP_DELETE_ELEM_LAST_FIELD key
  401. static int map_delete_elem(union bpf_attr *attr)
  402. {
  403. void __user *ukey = u64_to_user_ptr(attr->key);
  404. int ufd = attr->map_fd;
  405. struct bpf_map *map;
  406. struct fd f;
  407. void *key;
  408. int err;
  409. if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
  410. return -EINVAL;
  411. f = fdget(ufd);
  412. map = __bpf_map_get(f);
  413. if (IS_ERR(map))
  414. return PTR_ERR(map);
  415. err = -ENOMEM;
  416. key = kmalloc(map->key_size, GFP_USER);
  417. if (!key)
  418. goto err_put;
  419. err = -EFAULT;
  420. if (copy_from_user(key, ukey, map->key_size) != 0)
  421. goto free_key;
  422. preempt_disable();
  423. __this_cpu_inc(bpf_prog_active);
  424. rcu_read_lock();
  425. err = map->ops->map_delete_elem(map, key);
  426. rcu_read_unlock();
  427. __this_cpu_dec(bpf_prog_active);
  428. preempt_enable();
  429. if (!err)
  430. trace_bpf_map_delete_elem(map, ufd, key);
  431. free_key:
  432. kfree(key);
  433. err_put:
  434. fdput(f);
  435. return err;
  436. }
  437. /* last field in 'union bpf_attr' used by this command */
  438. #define BPF_MAP_GET_NEXT_KEY_LAST_FIELD next_key
  439. static int map_get_next_key(union bpf_attr *attr)
  440. {
  441. void __user *ukey = u64_to_user_ptr(attr->key);
  442. void __user *unext_key = u64_to_user_ptr(attr->next_key);
  443. int ufd = attr->map_fd;
  444. struct bpf_map *map;
  445. void *key, *next_key;
  446. struct fd f;
  447. int err;
  448. if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
  449. return -EINVAL;
  450. f = fdget(ufd);
  451. map = __bpf_map_get(f);
  452. if (IS_ERR(map))
  453. return PTR_ERR(map);
  454. if (ukey) {
  455. err = -ENOMEM;
  456. key = kmalloc(map->key_size, GFP_USER);
  457. if (!key)
  458. goto err_put;
  459. err = -EFAULT;
  460. if (copy_from_user(key, ukey, map->key_size) != 0)
  461. goto free_key;
  462. } else {
  463. key = NULL;
  464. }
  465. err = -ENOMEM;
  466. next_key = kmalloc(map->key_size, GFP_USER);
  467. if (!next_key)
  468. goto free_key;
  469. rcu_read_lock();
  470. err = map->ops->map_get_next_key(map, key, next_key);
  471. rcu_read_unlock();
  472. if (err)
  473. goto free_next_key;
  474. err = -EFAULT;
  475. if (copy_to_user(unext_key, next_key, map->key_size) != 0)
  476. goto free_next_key;
  477. trace_bpf_map_next_key(map, ufd, key, next_key);
  478. err = 0;
  479. free_next_key:
  480. kfree(next_key);
  481. free_key:
  482. kfree(key);
  483. err_put:
  484. fdput(f);
  485. return err;
  486. }
  487. static const struct bpf_verifier_ops * const bpf_prog_types[] = {
  488. #define BPF_PROG_TYPE(_id, _ops) \
  489. [_id] = &_ops,
  490. #define BPF_MAP_TYPE(_id, _ops)
  491. #include <linux/bpf_types.h>
  492. #undef BPF_PROG_TYPE
  493. #undef BPF_MAP_TYPE
  494. };
  495. static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
  496. {
  497. if (type >= ARRAY_SIZE(bpf_prog_types) || !bpf_prog_types[type])
  498. return -EINVAL;
  499. prog->aux->ops = bpf_prog_types[type];
  500. prog->type = type;
  501. return 0;
  502. }
  503. /* drop refcnt on maps used by eBPF program and free auxilary data */
  504. static void free_used_maps(struct bpf_prog_aux *aux)
  505. {
  506. int i;
  507. for (i = 0; i < aux->used_map_cnt; i++)
  508. bpf_map_put(aux->used_maps[i]);
  509. kfree(aux->used_maps);
  510. }
  511. int __bpf_prog_charge(struct user_struct *user, u32 pages)
  512. {
  513. unsigned long memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  514. unsigned long user_bufs;
  515. if (user) {
  516. user_bufs = atomic_long_add_return(pages, &user->locked_vm);
  517. if (user_bufs > memlock_limit) {
  518. atomic_long_sub(pages, &user->locked_vm);
  519. return -EPERM;
  520. }
  521. }
  522. return 0;
  523. }
  524. void __bpf_prog_uncharge(struct user_struct *user, u32 pages)
  525. {
  526. if (user)
  527. atomic_long_sub(pages, &user->locked_vm);
  528. }
  529. static int bpf_prog_charge_memlock(struct bpf_prog *prog)
  530. {
  531. struct user_struct *user = get_current_user();
  532. int ret;
  533. ret = __bpf_prog_charge(user, prog->pages);
  534. if (ret) {
  535. free_uid(user);
  536. return ret;
  537. }
  538. prog->aux->user = user;
  539. return 0;
  540. }
  541. static void bpf_prog_uncharge_memlock(struct bpf_prog *prog)
  542. {
  543. struct user_struct *user = prog->aux->user;
  544. __bpf_prog_uncharge(user, prog->pages);
  545. free_uid(user);
  546. }
  547. static int bpf_prog_alloc_id(struct bpf_prog *prog)
  548. {
  549. int id;
  550. spin_lock_bh(&prog_idr_lock);
  551. id = idr_alloc_cyclic(&prog_idr, prog, 1, INT_MAX, GFP_ATOMIC);
  552. if (id > 0)
  553. prog->aux->id = id;
  554. spin_unlock_bh(&prog_idr_lock);
  555. /* id is in [1, INT_MAX) */
  556. if (WARN_ON_ONCE(!id))
  557. return -ENOSPC;
  558. return id > 0 ? 0 : id;
  559. }
  560. static void bpf_prog_free_id(struct bpf_prog *prog)
  561. {
  562. /* cBPF to eBPF migrations are currently not in the idr store. */
  563. if (!prog->aux->id)
  564. return;
  565. spin_lock_bh(&prog_idr_lock);
  566. idr_remove(&prog_idr, prog->aux->id);
  567. spin_unlock_bh(&prog_idr_lock);
  568. }
  569. static void __bpf_prog_put_rcu(struct rcu_head *rcu)
  570. {
  571. struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);
  572. free_used_maps(aux);
  573. bpf_prog_uncharge_memlock(aux->prog);
  574. bpf_prog_free(aux->prog);
  575. }
  576. void bpf_prog_put(struct bpf_prog *prog)
  577. {
  578. if (atomic_dec_and_test(&prog->aux->refcnt)) {
  579. trace_bpf_prog_put_rcu(prog);
  580. bpf_prog_free_id(prog);
  581. bpf_prog_kallsyms_del(prog);
  582. call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
  583. }
  584. }
  585. EXPORT_SYMBOL_GPL(bpf_prog_put);
  586. static int bpf_prog_release(struct inode *inode, struct file *filp)
  587. {
  588. struct bpf_prog *prog = filp->private_data;
  589. bpf_prog_put(prog);
  590. return 0;
  591. }
  592. #ifdef CONFIG_PROC_FS
  593. static void bpf_prog_show_fdinfo(struct seq_file *m, struct file *filp)
  594. {
  595. const struct bpf_prog *prog = filp->private_data;
  596. char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
  597. bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
  598. seq_printf(m,
  599. "prog_type:\t%u\n"
  600. "prog_jited:\t%u\n"
  601. "prog_tag:\t%s\n"
  602. "memlock:\t%llu\n",
  603. prog->type,
  604. prog->jited,
  605. prog_tag,
  606. prog->pages * 1ULL << PAGE_SHIFT);
  607. }
  608. #endif
  609. static const struct file_operations bpf_prog_fops = {
  610. #ifdef CONFIG_PROC_FS
  611. .show_fdinfo = bpf_prog_show_fdinfo,
  612. #endif
  613. .release = bpf_prog_release,
  614. };
  615. int bpf_prog_new_fd(struct bpf_prog *prog)
  616. {
  617. return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
  618. O_RDWR | O_CLOEXEC);
  619. }
  620. static struct bpf_prog *____bpf_prog_get(struct fd f)
  621. {
  622. if (!f.file)
  623. return ERR_PTR(-EBADF);
  624. if (f.file->f_op != &bpf_prog_fops) {
  625. fdput(f);
  626. return ERR_PTR(-EINVAL);
  627. }
  628. return f.file->private_data;
  629. }
  630. struct bpf_prog *bpf_prog_add(struct bpf_prog *prog, int i)
  631. {
  632. if (atomic_add_return(i, &prog->aux->refcnt) > BPF_MAX_REFCNT) {
  633. atomic_sub(i, &prog->aux->refcnt);
  634. return ERR_PTR(-EBUSY);
  635. }
  636. return prog;
  637. }
  638. EXPORT_SYMBOL_GPL(bpf_prog_add);
  639. void bpf_prog_sub(struct bpf_prog *prog, int i)
  640. {
  641. /* Only to be used for undoing previous bpf_prog_add() in some
  642. * error path. We still know that another entity in our call
  643. * path holds a reference to the program, thus atomic_sub() can
  644. * be safely used in such cases!
  645. */
  646. WARN_ON(atomic_sub_return(i, &prog->aux->refcnt) == 0);
  647. }
  648. EXPORT_SYMBOL_GPL(bpf_prog_sub);
  649. struct bpf_prog *bpf_prog_inc(struct bpf_prog *prog)
  650. {
  651. return bpf_prog_add(prog, 1);
  652. }
  653. EXPORT_SYMBOL_GPL(bpf_prog_inc);
  654. static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *type)
  655. {
  656. struct fd f = fdget(ufd);
  657. struct bpf_prog *prog;
  658. prog = ____bpf_prog_get(f);
  659. if (IS_ERR(prog))
  660. return prog;
  661. if (type && prog->type != *type) {
  662. prog = ERR_PTR(-EINVAL);
  663. goto out;
  664. }
  665. prog = bpf_prog_inc(prog);
  666. out:
  667. fdput(f);
  668. return prog;
  669. }
  670. struct bpf_prog *bpf_prog_get(u32 ufd)
  671. {
  672. return __bpf_prog_get(ufd, NULL);
  673. }
  674. struct bpf_prog *bpf_prog_get_type(u32 ufd, enum bpf_prog_type type)
  675. {
  676. struct bpf_prog *prog = __bpf_prog_get(ufd, &type);
  677. if (!IS_ERR(prog))
  678. trace_bpf_prog_get_type(prog);
  679. return prog;
  680. }
  681. EXPORT_SYMBOL_GPL(bpf_prog_get_type);
  682. /* last field in 'union bpf_attr' used by this command */
  683. #define BPF_PROG_LOAD_LAST_FIELD prog_flags
  684. static int bpf_prog_load(union bpf_attr *attr)
  685. {
  686. enum bpf_prog_type type = attr->prog_type;
  687. struct bpf_prog *prog;
  688. int err;
  689. char license[128];
  690. bool is_gpl;
  691. if (CHECK_ATTR(BPF_PROG_LOAD))
  692. return -EINVAL;
  693. if (attr->prog_flags & ~BPF_F_STRICT_ALIGNMENT)
  694. return -EINVAL;
  695. /* copy eBPF program license from user space */
  696. if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
  697. sizeof(license) - 1) < 0)
  698. return -EFAULT;
  699. license[sizeof(license) - 1] = 0;
  700. /* eBPF programs must be GPL compatible to use GPL-ed functions */
  701. is_gpl = license_is_gpl_compatible(license);
  702. if (attr->insn_cnt == 0 || attr->insn_cnt > BPF_MAXINSNS)
  703. return -E2BIG;
  704. if (type == BPF_PROG_TYPE_KPROBE &&
  705. attr->kern_version != LINUX_VERSION_CODE)
  706. return -EINVAL;
  707. if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
  708. type != BPF_PROG_TYPE_CGROUP_SKB &&
  709. !capable(CAP_SYS_ADMIN))
  710. return -EPERM;
  711. /* plain bpf_prog allocation */
  712. prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
  713. if (!prog)
  714. return -ENOMEM;
  715. err = bpf_prog_charge_memlock(prog);
  716. if (err)
  717. goto free_prog_nouncharge;
  718. prog->len = attr->insn_cnt;
  719. err = -EFAULT;
  720. if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
  721. bpf_prog_insn_size(prog)) != 0)
  722. goto free_prog;
  723. prog->orig_prog = NULL;
  724. prog->jited = 0;
  725. atomic_set(&prog->aux->refcnt, 1);
  726. prog->gpl_compatible = is_gpl ? 1 : 0;
  727. /* find program type: socket_filter vs tracing_filter */
  728. err = find_prog_type(type, prog);
  729. if (err < 0)
  730. goto free_prog;
  731. /* run eBPF verifier */
  732. err = bpf_check(&prog, attr);
  733. if (err < 0)
  734. goto free_used_maps;
  735. /* eBPF program is ready to be JITed */
  736. prog = bpf_prog_select_runtime(prog, &err);
  737. if (err < 0)
  738. goto free_used_maps;
  739. err = bpf_prog_alloc_id(prog);
  740. if (err)
  741. goto free_used_maps;
  742. err = bpf_prog_new_fd(prog);
  743. if (err < 0)
  744. /* failed to allocate fd */
  745. goto free_id;
  746. bpf_prog_kallsyms_add(prog);
  747. trace_bpf_prog_load(prog, err);
  748. return err;
  749. free_id:
  750. bpf_prog_free_id(prog);
  751. free_used_maps:
  752. free_used_maps(prog->aux);
  753. free_prog:
  754. bpf_prog_uncharge_memlock(prog);
  755. free_prog_nouncharge:
  756. bpf_prog_free(prog);
  757. return err;
  758. }
  759. #define BPF_OBJ_LAST_FIELD bpf_fd
  760. static int bpf_obj_pin(const union bpf_attr *attr)
  761. {
  762. if (CHECK_ATTR(BPF_OBJ))
  763. return -EINVAL;
  764. return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
  765. }
  766. static int bpf_obj_get(const union bpf_attr *attr)
  767. {
  768. if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0)
  769. return -EINVAL;
  770. return bpf_obj_get_user(u64_to_user_ptr(attr->pathname));
  771. }
  772. #ifdef CONFIG_CGROUP_BPF
  773. #define BPF_PROG_ATTACH_LAST_FIELD attach_flags
  774. static int bpf_prog_attach(const union bpf_attr *attr)
  775. {
  776. enum bpf_prog_type ptype;
  777. struct bpf_prog *prog;
  778. struct cgroup *cgrp;
  779. int ret;
  780. if (!capable(CAP_NET_ADMIN))
  781. return -EPERM;
  782. if (CHECK_ATTR(BPF_PROG_ATTACH))
  783. return -EINVAL;
  784. if (attr->attach_flags & ~BPF_F_ALLOW_OVERRIDE)
  785. return -EINVAL;
  786. switch (attr->attach_type) {
  787. case BPF_CGROUP_INET_INGRESS:
  788. case BPF_CGROUP_INET_EGRESS:
  789. ptype = BPF_PROG_TYPE_CGROUP_SKB;
  790. break;
  791. case BPF_CGROUP_INET_SOCK_CREATE:
  792. ptype = BPF_PROG_TYPE_CGROUP_SOCK;
  793. break;
  794. default:
  795. return -EINVAL;
  796. }
  797. prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
  798. if (IS_ERR(prog))
  799. return PTR_ERR(prog);
  800. cgrp = cgroup_get_from_fd(attr->target_fd);
  801. if (IS_ERR(cgrp)) {
  802. bpf_prog_put(prog);
  803. return PTR_ERR(cgrp);
  804. }
  805. ret = cgroup_bpf_update(cgrp, prog, attr->attach_type,
  806. attr->attach_flags & BPF_F_ALLOW_OVERRIDE);
  807. if (ret)
  808. bpf_prog_put(prog);
  809. cgroup_put(cgrp);
  810. return ret;
  811. }
  812. #define BPF_PROG_DETACH_LAST_FIELD attach_type
  813. static int bpf_prog_detach(const union bpf_attr *attr)
  814. {
  815. struct cgroup *cgrp;
  816. int ret;
  817. if (!capable(CAP_NET_ADMIN))
  818. return -EPERM;
  819. if (CHECK_ATTR(BPF_PROG_DETACH))
  820. return -EINVAL;
  821. switch (attr->attach_type) {
  822. case BPF_CGROUP_INET_INGRESS:
  823. case BPF_CGROUP_INET_EGRESS:
  824. case BPF_CGROUP_INET_SOCK_CREATE:
  825. cgrp = cgroup_get_from_fd(attr->target_fd);
  826. if (IS_ERR(cgrp))
  827. return PTR_ERR(cgrp);
  828. ret = cgroup_bpf_update(cgrp, NULL, attr->attach_type, false);
  829. cgroup_put(cgrp);
  830. break;
  831. default:
  832. return -EINVAL;
  833. }
  834. return ret;
  835. }
  836. #endif /* CONFIG_CGROUP_BPF */
  837. #define BPF_PROG_TEST_RUN_LAST_FIELD test.duration
  838. static int bpf_prog_test_run(const union bpf_attr *attr,
  839. union bpf_attr __user *uattr)
  840. {
  841. struct bpf_prog *prog;
  842. int ret = -ENOTSUPP;
  843. if (CHECK_ATTR(BPF_PROG_TEST_RUN))
  844. return -EINVAL;
  845. prog = bpf_prog_get(attr->test.prog_fd);
  846. if (IS_ERR(prog))
  847. return PTR_ERR(prog);
  848. if (prog->aux->ops->test_run)
  849. ret = prog->aux->ops->test_run(prog, attr, uattr);
  850. bpf_prog_put(prog);
  851. return ret;
  852. }
  853. SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
  854. {
  855. union bpf_attr attr = {};
  856. int err;
  857. if (!capable(CAP_SYS_ADMIN) && sysctl_unprivileged_bpf_disabled)
  858. return -EPERM;
  859. if (!access_ok(VERIFY_READ, uattr, 1))
  860. return -EFAULT;
  861. if (size > PAGE_SIZE) /* silly large */
  862. return -E2BIG;
  863. /* If we're handed a bigger struct than we know of,
  864. * ensure all the unknown bits are 0 - i.e. new
  865. * user-space does not rely on any kernel feature
  866. * extensions we dont know about yet.
  867. */
  868. if (size > sizeof(attr)) {
  869. unsigned char __user *addr;
  870. unsigned char __user *end;
  871. unsigned char val;
  872. addr = (void __user *)uattr + sizeof(attr);
  873. end = (void __user *)uattr + size;
  874. for (; addr < end; addr++) {
  875. err = get_user(val, addr);
  876. if (err)
  877. return err;
  878. if (val)
  879. return -E2BIG;
  880. }
  881. size = sizeof(attr);
  882. }
  883. /* copy attributes from user space, may be less than sizeof(bpf_attr) */
  884. if (copy_from_user(&attr, uattr, size) != 0)
  885. return -EFAULT;
  886. switch (cmd) {
  887. case BPF_MAP_CREATE:
  888. err = map_create(&attr);
  889. break;
  890. case BPF_MAP_LOOKUP_ELEM:
  891. err = map_lookup_elem(&attr);
  892. break;
  893. case BPF_MAP_UPDATE_ELEM:
  894. err = map_update_elem(&attr);
  895. break;
  896. case BPF_MAP_DELETE_ELEM:
  897. err = map_delete_elem(&attr);
  898. break;
  899. case BPF_MAP_GET_NEXT_KEY:
  900. err = map_get_next_key(&attr);
  901. break;
  902. case BPF_PROG_LOAD:
  903. err = bpf_prog_load(&attr);
  904. break;
  905. case BPF_OBJ_PIN:
  906. err = bpf_obj_pin(&attr);
  907. break;
  908. case BPF_OBJ_GET:
  909. err = bpf_obj_get(&attr);
  910. break;
  911. #ifdef CONFIG_CGROUP_BPF
  912. case BPF_PROG_ATTACH:
  913. err = bpf_prog_attach(&attr);
  914. break;
  915. case BPF_PROG_DETACH:
  916. err = bpf_prog_detach(&attr);
  917. break;
  918. #endif
  919. case BPF_PROG_TEST_RUN:
  920. err = bpf_prog_test_run(&attr, uattr);
  921. break;
  922. default:
  923. err = -EINVAL;
  924. break;
  925. }
  926. return err;
  927. }