syscall.c 45 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041
  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. #include <linux/cred.h>
  27. #include <linux/timekeeping.h>
  28. #include <linux/ctype.h>
  29. #define IS_FD_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY || \
  30. (map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \
  31. (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \
  32. (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
  33. #define IS_FD_HASH(map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS)
  34. #define IS_FD_MAP(map) (IS_FD_ARRAY(map) || IS_FD_HASH(map))
  35. #define BPF_OBJ_FLAG_MASK (BPF_F_RDONLY | BPF_F_WRONLY)
  36. DEFINE_PER_CPU(int, bpf_prog_active);
  37. static DEFINE_IDR(prog_idr);
  38. static DEFINE_SPINLOCK(prog_idr_lock);
  39. static DEFINE_IDR(map_idr);
  40. static DEFINE_SPINLOCK(map_idr_lock);
  41. int sysctl_unprivileged_bpf_disabled __read_mostly;
  42. static const struct bpf_map_ops * const bpf_map_types[] = {
  43. #define BPF_PROG_TYPE(_id, _ops)
  44. #define BPF_MAP_TYPE(_id, _ops) \
  45. [_id] = &_ops,
  46. #include <linux/bpf_types.h>
  47. #undef BPF_PROG_TYPE
  48. #undef BPF_MAP_TYPE
  49. };
  50. /*
  51. * If we're handed a bigger struct than we know of, ensure all the unknown bits
  52. * are 0 - i.e. new user-space does not rely on any kernel feature extensions
  53. * we don't know about yet.
  54. *
  55. * There is a ToCToU between this function call and the following
  56. * copy_from_user() call. However, this is not a concern since this function is
  57. * meant to be a future-proofing of bits.
  58. */
  59. static int check_uarg_tail_zero(void __user *uaddr,
  60. size_t expected_size,
  61. size_t actual_size)
  62. {
  63. unsigned char __user *addr;
  64. unsigned char __user *end;
  65. unsigned char val;
  66. int err;
  67. if (unlikely(actual_size > PAGE_SIZE)) /* silly large */
  68. return -E2BIG;
  69. if (unlikely(!access_ok(VERIFY_READ, uaddr, actual_size)))
  70. return -EFAULT;
  71. if (actual_size <= expected_size)
  72. return 0;
  73. addr = uaddr + expected_size;
  74. end = uaddr + actual_size;
  75. for (; addr < end; addr++) {
  76. err = get_user(val, addr);
  77. if (err)
  78. return err;
  79. if (val)
  80. return -E2BIG;
  81. }
  82. return 0;
  83. }
  84. const struct bpf_map_ops bpf_map_offload_ops = {
  85. .map_alloc = bpf_map_offload_map_alloc,
  86. .map_free = bpf_map_offload_map_free,
  87. };
  88. static struct bpf_map *find_and_alloc_map(union bpf_attr *attr)
  89. {
  90. const struct bpf_map_ops *ops;
  91. struct bpf_map *map;
  92. int err;
  93. if (attr->map_type >= ARRAY_SIZE(bpf_map_types))
  94. return ERR_PTR(-EINVAL);
  95. ops = bpf_map_types[attr->map_type];
  96. if (!ops)
  97. return ERR_PTR(-EINVAL);
  98. if (ops->map_alloc_check) {
  99. err = ops->map_alloc_check(attr);
  100. if (err)
  101. return ERR_PTR(err);
  102. }
  103. if (attr->map_ifindex)
  104. ops = &bpf_map_offload_ops;
  105. map = ops->map_alloc(attr);
  106. if (IS_ERR(map))
  107. return map;
  108. map->ops = ops;
  109. map->map_type = attr->map_type;
  110. return map;
  111. }
  112. void *bpf_map_area_alloc(size_t size, int numa_node)
  113. {
  114. /* We definitely need __GFP_NORETRY, so OOM killer doesn't
  115. * trigger under memory pressure as we really just want to
  116. * fail instead.
  117. */
  118. const gfp_t flags = __GFP_NOWARN | __GFP_NORETRY | __GFP_ZERO;
  119. void *area;
  120. if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER)) {
  121. area = kmalloc_node(size, GFP_USER | flags, numa_node);
  122. if (area != NULL)
  123. return area;
  124. }
  125. return __vmalloc_node_flags_caller(size, numa_node, GFP_KERNEL | flags,
  126. __builtin_return_address(0));
  127. }
  128. void bpf_map_area_free(void *area)
  129. {
  130. kvfree(area);
  131. }
  132. void bpf_map_init_from_attr(struct bpf_map *map, union bpf_attr *attr)
  133. {
  134. map->map_type = attr->map_type;
  135. map->key_size = attr->key_size;
  136. map->value_size = attr->value_size;
  137. map->max_entries = attr->max_entries;
  138. map->map_flags = attr->map_flags;
  139. map->numa_node = bpf_map_attr_numa_node(attr);
  140. }
  141. int bpf_map_precharge_memlock(u32 pages)
  142. {
  143. struct user_struct *user = get_current_user();
  144. unsigned long memlock_limit, cur;
  145. memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  146. cur = atomic_long_read(&user->locked_vm);
  147. free_uid(user);
  148. if (cur + pages > memlock_limit)
  149. return -EPERM;
  150. return 0;
  151. }
  152. static int bpf_map_charge_memlock(struct bpf_map *map)
  153. {
  154. struct user_struct *user = get_current_user();
  155. unsigned long memlock_limit;
  156. memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  157. atomic_long_add(map->pages, &user->locked_vm);
  158. if (atomic_long_read(&user->locked_vm) > memlock_limit) {
  159. atomic_long_sub(map->pages, &user->locked_vm);
  160. free_uid(user);
  161. return -EPERM;
  162. }
  163. map->user = user;
  164. return 0;
  165. }
  166. static void bpf_map_uncharge_memlock(struct bpf_map *map)
  167. {
  168. struct user_struct *user = map->user;
  169. atomic_long_sub(map->pages, &user->locked_vm);
  170. free_uid(user);
  171. }
  172. static int bpf_map_alloc_id(struct bpf_map *map)
  173. {
  174. int id;
  175. idr_preload(GFP_KERNEL);
  176. spin_lock_bh(&map_idr_lock);
  177. id = idr_alloc_cyclic(&map_idr, map, 1, INT_MAX, GFP_ATOMIC);
  178. if (id > 0)
  179. map->id = id;
  180. spin_unlock_bh(&map_idr_lock);
  181. idr_preload_end();
  182. if (WARN_ON_ONCE(!id))
  183. return -ENOSPC;
  184. return id > 0 ? 0 : id;
  185. }
  186. void bpf_map_free_id(struct bpf_map *map, bool do_idr_lock)
  187. {
  188. unsigned long flags;
  189. /* Offloaded maps are removed from the IDR store when their device
  190. * disappears - even if someone holds an fd to them they are unusable,
  191. * the memory is gone, all ops will fail; they are simply waiting for
  192. * refcnt to drop to be freed.
  193. */
  194. if (!map->id)
  195. return;
  196. if (do_idr_lock)
  197. spin_lock_irqsave(&map_idr_lock, flags);
  198. else
  199. __acquire(&map_idr_lock);
  200. idr_remove(&map_idr, map->id);
  201. map->id = 0;
  202. if (do_idr_lock)
  203. spin_unlock_irqrestore(&map_idr_lock, flags);
  204. else
  205. __release(&map_idr_lock);
  206. }
  207. /* called from workqueue */
  208. static void bpf_map_free_deferred(struct work_struct *work)
  209. {
  210. struct bpf_map *map = container_of(work, struct bpf_map, work);
  211. bpf_map_uncharge_memlock(map);
  212. security_bpf_map_free(map);
  213. /* implementation dependent freeing */
  214. map->ops->map_free(map);
  215. }
  216. static void bpf_map_put_uref(struct bpf_map *map)
  217. {
  218. if (atomic_dec_and_test(&map->usercnt)) {
  219. if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY)
  220. bpf_fd_array_map_clear(map);
  221. }
  222. }
  223. /* decrement map refcnt and schedule it for freeing via workqueue
  224. * (unrelying map implementation ops->map_free() might sleep)
  225. */
  226. static void __bpf_map_put(struct bpf_map *map, bool do_idr_lock)
  227. {
  228. if (atomic_dec_and_test(&map->refcnt)) {
  229. /* bpf_map_free_id() must be called first */
  230. bpf_map_free_id(map, do_idr_lock);
  231. INIT_WORK(&map->work, bpf_map_free_deferred);
  232. schedule_work(&map->work);
  233. }
  234. }
  235. void bpf_map_put(struct bpf_map *map)
  236. {
  237. __bpf_map_put(map, true);
  238. }
  239. void bpf_map_put_with_uref(struct bpf_map *map)
  240. {
  241. bpf_map_put_uref(map);
  242. bpf_map_put(map);
  243. }
  244. static int bpf_map_release(struct inode *inode, struct file *filp)
  245. {
  246. struct bpf_map *map = filp->private_data;
  247. if (map->ops->map_release)
  248. map->ops->map_release(map, filp);
  249. bpf_map_put_with_uref(map);
  250. return 0;
  251. }
  252. #ifdef CONFIG_PROC_FS
  253. static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp)
  254. {
  255. const struct bpf_map *map = filp->private_data;
  256. const struct bpf_array *array;
  257. u32 owner_prog_type = 0;
  258. u32 owner_jited = 0;
  259. if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY) {
  260. array = container_of(map, struct bpf_array, map);
  261. owner_prog_type = array->owner_prog_type;
  262. owner_jited = array->owner_jited;
  263. }
  264. seq_printf(m,
  265. "map_type:\t%u\n"
  266. "key_size:\t%u\n"
  267. "value_size:\t%u\n"
  268. "max_entries:\t%u\n"
  269. "map_flags:\t%#x\n"
  270. "memlock:\t%llu\n",
  271. map->map_type,
  272. map->key_size,
  273. map->value_size,
  274. map->max_entries,
  275. map->map_flags,
  276. map->pages * 1ULL << PAGE_SHIFT);
  277. if (owner_prog_type) {
  278. seq_printf(m, "owner_prog_type:\t%u\n",
  279. owner_prog_type);
  280. seq_printf(m, "owner_jited:\t%u\n",
  281. owner_jited);
  282. }
  283. }
  284. #endif
  285. static ssize_t bpf_dummy_read(struct file *filp, char __user *buf, size_t siz,
  286. loff_t *ppos)
  287. {
  288. /* We need this handler such that alloc_file() enables
  289. * f_mode with FMODE_CAN_READ.
  290. */
  291. return -EINVAL;
  292. }
  293. static ssize_t bpf_dummy_write(struct file *filp, const char __user *buf,
  294. size_t siz, loff_t *ppos)
  295. {
  296. /* We need this handler such that alloc_file() enables
  297. * f_mode with FMODE_CAN_WRITE.
  298. */
  299. return -EINVAL;
  300. }
  301. const struct file_operations bpf_map_fops = {
  302. #ifdef CONFIG_PROC_FS
  303. .show_fdinfo = bpf_map_show_fdinfo,
  304. #endif
  305. .release = bpf_map_release,
  306. .read = bpf_dummy_read,
  307. .write = bpf_dummy_write,
  308. };
  309. int bpf_map_new_fd(struct bpf_map *map, int flags)
  310. {
  311. int ret;
  312. ret = security_bpf_map(map, OPEN_FMODE(flags));
  313. if (ret < 0)
  314. return ret;
  315. return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
  316. flags | O_CLOEXEC);
  317. }
  318. int bpf_get_file_flag(int flags)
  319. {
  320. if ((flags & BPF_F_RDONLY) && (flags & BPF_F_WRONLY))
  321. return -EINVAL;
  322. if (flags & BPF_F_RDONLY)
  323. return O_RDONLY;
  324. if (flags & BPF_F_WRONLY)
  325. return O_WRONLY;
  326. return O_RDWR;
  327. }
  328. /* helper macro to check that unused fields 'union bpf_attr' are zero */
  329. #define CHECK_ATTR(CMD) \
  330. memchr_inv((void *) &attr->CMD##_LAST_FIELD + \
  331. sizeof(attr->CMD##_LAST_FIELD), 0, \
  332. sizeof(*attr) - \
  333. offsetof(union bpf_attr, CMD##_LAST_FIELD) - \
  334. sizeof(attr->CMD##_LAST_FIELD)) != NULL
  335. /* dst and src must have at least BPF_OBJ_NAME_LEN number of bytes.
  336. * Return 0 on success and < 0 on error.
  337. */
  338. static int bpf_obj_name_cpy(char *dst, const char *src)
  339. {
  340. const char *end = src + BPF_OBJ_NAME_LEN;
  341. memset(dst, 0, BPF_OBJ_NAME_LEN);
  342. /* Copy all isalnum() and '_' char */
  343. while (src < end && *src) {
  344. if (!isalnum(*src) && *src != '_')
  345. return -EINVAL;
  346. *dst++ = *src++;
  347. }
  348. /* No '\0' found in BPF_OBJ_NAME_LEN number of bytes */
  349. if (src == end)
  350. return -EINVAL;
  351. return 0;
  352. }
  353. #define BPF_MAP_CREATE_LAST_FIELD map_ifindex
  354. /* called via syscall */
  355. static int map_create(union bpf_attr *attr)
  356. {
  357. int numa_node = bpf_map_attr_numa_node(attr);
  358. struct bpf_map *map;
  359. int f_flags;
  360. int err;
  361. err = CHECK_ATTR(BPF_MAP_CREATE);
  362. if (err)
  363. return -EINVAL;
  364. f_flags = bpf_get_file_flag(attr->map_flags);
  365. if (f_flags < 0)
  366. return f_flags;
  367. if (numa_node != NUMA_NO_NODE &&
  368. ((unsigned int)numa_node >= nr_node_ids ||
  369. !node_online(numa_node)))
  370. return -EINVAL;
  371. /* find map type and init map: hashtable vs rbtree vs bloom vs ... */
  372. map = find_and_alloc_map(attr);
  373. if (IS_ERR(map))
  374. return PTR_ERR(map);
  375. err = bpf_obj_name_cpy(map->name, attr->map_name);
  376. if (err)
  377. goto free_map_nouncharge;
  378. atomic_set(&map->refcnt, 1);
  379. atomic_set(&map->usercnt, 1);
  380. err = security_bpf_map_alloc(map);
  381. if (err)
  382. goto free_map_nouncharge;
  383. err = bpf_map_charge_memlock(map);
  384. if (err)
  385. goto free_map_sec;
  386. err = bpf_map_alloc_id(map);
  387. if (err)
  388. goto free_map;
  389. err = bpf_map_new_fd(map, f_flags);
  390. if (err < 0) {
  391. /* failed to allocate fd.
  392. * bpf_map_put() is needed because the above
  393. * bpf_map_alloc_id() has published the map
  394. * to the userspace and the userspace may
  395. * have refcnt-ed it through BPF_MAP_GET_FD_BY_ID.
  396. */
  397. bpf_map_put(map);
  398. return err;
  399. }
  400. trace_bpf_map_create(map, err);
  401. return err;
  402. free_map:
  403. bpf_map_uncharge_memlock(map);
  404. free_map_sec:
  405. security_bpf_map_free(map);
  406. free_map_nouncharge:
  407. map->ops->map_free(map);
  408. return err;
  409. }
  410. /* if error is returned, fd is released.
  411. * On success caller should complete fd access with matching fdput()
  412. */
  413. struct bpf_map *__bpf_map_get(struct fd f)
  414. {
  415. if (!f.file)
  416. return ERR_PTR(-EBADF);
  417. if (f.file->f_op != &bpf_map_fops) {
  418. fdput(f);
  419. return ERR_PTR(-EINVAL);
  420. }
  421. return f.file->private_data;
  422. }
  423. /* prog's and map's refcnt limit */
  424. #define BPF_MAX_REFCNT 32768
  425. struct bpf_map *bpf_map_inc(struct bpf_map *map, bool uref)
  426. {
  427. if (atomic_inc_return(&map->refcnt) > BPF_MAX_REFCNT) {
  428. atomic_dec(&map->refcnt);
  429. return ERR_PTR(-EBUSY);
  430. }
  431. if (uref)
  432. atomic_inc(&map->usercnt);
  433. return map;
  434. }
  435. struct bpf_map *bpf_map_get_with_uref(u32 ufd)
  436. {
  437. struct fd f = fdget(ufd);
  438. struct bpf_map *map;
  439. map = __bpf_map_get(f);
  440. if (IS_ERR(map))
  441. return map;
  442. map = bpf_map_inc(map, true);
  443. fdput(f);
  444. return map;
  445. }
  446. /* map_idr_lock should have been held */
  447. static struct bpf_map *bpf_map_inc_not_zero(struct bpf_map *map,
  448. bool uref)
  449. {
  450. int refold;
  451. refold = __atomic_add_unless(&map->refcnt, 1, 0);
  452. if (refold >= BPF_MAX_REFCNT) {
  453. __bpf_map_put(map, false);
  454. return ERR_PTR(-EBUSY);
  455. }
  456. if (!refold)
  457. return ERR_PTR(-ENOENT);
  458. if (uref)
  459. atomic_inc(&map->usercnt);
  460. return map;
  461. }
  462. int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
  463. {
  464. return -ENOTSUPP;
  465. }
  466. /* last field in 'union bpf_attr' used by this command */
  467. #define BPF_MAP_LOOKUP_ELEM_LAST_FIELD value
  468. static int map_lookup_elem(union bpf_attr *attr)
  469. {
  470. void __user *ukey = u64_to_user_ptr(attr->key);
  471. void __user *uvalue = u64_to_user_ptr(attr->value);
  472. int ufd = attr->map_fd;
  473. struct bpf_map *map;
  474. void *key, *value, *ptr;
  475. u32 value_size;
  476. struct fd f;
  477. int err;
  478. if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
  479. return -EINVAL;
  480. f = fdget(ufd);
  481. map = __bpf_map_get(f);
  482. if (IS_ERR(map))
  483. return PTR_ERR(map);
  484. if (!(f.file->f_mode & FMODE_CAN_READ)) {
  485. err = -EPERM;
  486. goto err_put;
  487. }
  488. key = memdup_user(ukey, map->key_size);
  489. if (IS_ERR(key)) {
  490. err = PTR_ERR(key);
  491. goto err_put;
  492. }
  493. if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
  494. map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
  495. map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
  496. value_size = round_up(map->value_size, 8) * num_possible_cpus();
  497. else if (IS_FD_MAP(map))
  498. value_size = sizeof(u32);
  499. else
  500. value_size = map->value_size;
  501. err = -ENOMEM;
  502. value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
  503. if (!value)
  504. goto free_key;
  505. if (bpf_map_is_dev_bound(map)) {
  506. err = bpf_map_offload_lookup_elem(map, key, value);
  507. } else if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
  508. map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
  509. err = bpf_percpu_hash_copy(map, key, value);
  510. } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
  511. err = bpf_percpu_array_copy(map, key, value);
  512. } else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
  513. err = bpf_stackmap_copy(map, key, value);
  514. } else if (IS_FD_ARRAY(map)) {
  515. err = bpf_fd_array_map_lookup_elem(map, key, value);
  516. } else if (IS_FD_HASH(map)) {
  517. err = bpf_fd_htab_map_lookup_elem(map, key, value);
  518. } else {
  519. rcu_read_lock();
  520. ptr = map->ops->map_lookup_elem(map, key);
  521. if (ptr)
  522. memcpy(value, ptr, value_size);
  523. rcu_read_unlock();
  524. err = ptr ? 0 : -ENOENT;
  525. }
  526. if (err)
  527. goto free_value;
  528. err = -EFAULT;
  529. if (copy_to_user(uvalue, value, value_size) != 0)
  530. goto free_value;
  531. trace_bpf_map_lookup_elem(map, ufd, key, value);
  532. err = 0;
  533. free_value:
  534. kfree(value);
  535. free_key:
  536. kfree(key);
  537. err_put:
  538. fdput(f);
  539. return err;
  540. }
  541. #define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
  542. static int map_update_elem(union bpf_attr *attr)
  543. {
  544. void __user *ukey = u64_to_user_ptr(attr->key);
  545. void __user *uvalue = u64_to_user_ptr(attr->value);
  546. int ufd = attr->map_fd;
  547. struct bpf_map *map;
  548. void *key, *value;
  549. u32 value_size;
  550. struct fd f;
  551. int err;
  552. if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
  553. return -EINVAL;
  554. f = fdget(ufd);
  555. map = __bpf_map_get(f);
  556. if (IS_ERR(map))
  557. return PTR_ERR(map);
  558. if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
  559. err = -EPERM;
  560. goto err_put;
  561. }
  562. key = memdup_user(ukey, map->key_size);
  563. if (IS_ERR(key)) {
  564. err = PTR_ERR(key);
  565. goto err_put;
  566. }
  567. if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
  568. map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
  569. map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
  570. value_size = round_up(map->value_size, 8) * num_possible_cpus();
  571. else
  572. value_size = map->value_size;
  573. err = -ENOMEM;
  574. value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
  575. if (!value)
  576. goto free_key;
  577. err = -EFAULT;
  578. if (copy_from_user(value, uvalue, value_size) != 0)
  579. goto free_value;
  580. /* Need to create a kthread, thus must support schedule */
  581. if (bpf_map_is_dev_bound(map)) {
  582. err = bpf_map_offload_update_elem(map, key, value, attr->flags);
  583. goto out;
  584. } else if (map->map_type == BPF_MAP_TYPE_CPUMAP) {
  585. err = map->ops->map_update_elem(map, key, value, attr->flags);
  586. goto out;
  587. }
  588. /* must increment bpf_prog_active to avoid kprobe+bpf triggering from
  589. * inside bpf map update or delete otherwise deadlocks are possible
  590. */
  591. preempt_disable();
  592. __this_cpu_inc(bpf_prog_active);
  593. if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
  594. map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
  595. err = bpf_percpu_hash_update(map, key, value, attr->flags);
  596. } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
  597. err = bpf_percpu_array_update(map, key, value, attr->flags);
  598. } else if (IS_FD_ARRAY(map)) {
  599. rcu_read_lock();
  600. err = bpf_fd_array_map_update_elem(map, f.file, key, value,
  601. attr->flags);
  602. rcu_read_unlock();
  603. } else if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
  604. rcu_read_lock();
  605. err = bpf_fd_htab_map_update_elem(map, f.file, key, value,
  606. attr->flags);
  607. rcu_read_unlock();
  608. } else {
  609. rcu_read_lock();
  610. err = map->ops->map_update_elem(map, key, value, attr->flags);
  611. rcu_read_unlock();
  612. }
  613. __this_cpu_dec(bpf_prog_active);
  614. preempt_enable();
  615. out:
  616. if (!err)
  617. trace_bpf_map_update_elem(map, ufd, key, value);
  618. free_value:
  619. kfree(value);
  620. free_key:
  621. kfree(key);
  622. err_put:
  623. fdput(f);
  624. return err;
  625. }
  626. #define BPF_MAP_DELETE_ELEM_LAST_FIELD key
  627. static int map_delete_elem(union bpf_attr *attr)
  628. {
  629. void __user *ukey = u64_to_user_ptr(attr->key);
  630. int ufd = attr->map_fd;
  631. struct bpf_map *map;
  632. struct fd f;
  633. void *key;
  634. int err;
  635. if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
  636. return -EINVAL;
  637. f = fdget(ufd);
  638. map = __bpf_map_get(f);
  639. if (IS_ERR(map))
  640. return PTR_ERR(map);
  641. if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
  642. err = -EPERM;
  643. goto err_put;
  644. }
  645. key = memdup_user(ukey, map->key_size);
  646. if (IS_ERR(key)) {
  647. err = PTR_ERR(key);
  648. goto err_put;
  649. }
  650. if (bpf_map_is_dev_bound(map)) {
  651. err = bpf_map_offload_delete_elem(map, key);
  652. goto out;
  653. }
  654. preempt_disable();
  655. __this_cpu_inc(bpf_prog_active);
  656. rcu_read_lock();
  657. err = map->ops->map_delete_elem(map, key);
  658. rcu_read_unlock();
  659. __this_cpu_dec(bpf_prog_active);
  660. preempt_enable();
  661. out:
  662. if (!err)
  663. trace_bpf_map_delete_elem(map, ufd, key);
  664. kfree(key);
  665. err_put:
  666. fdput(f);
  667. return err;
  668. }
  669. /* last field in 'union bpf_attr' used by this command */
  670. #define BPF_MAP_GET_NEXT_KEY_LAST_FIELD next_key
  671. static int map_get_next_key(union bpf_attr *attr)
  672. {
  673. void __user *ukey = u64_to_user_ptr(attr->key);
  674. void __user *unext_key = u64_to_user_ptr(attr->next_key);
  675. int ufd = attr->map_fd;
  676. struct bpf_map *map;
  677. void *key, *next_key;
  678. struct fd f;
  679. int err;
  680. if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
  681. return -EINVAL;
  682. f = fdget(ufd);
  683. map = __bpf_map_get(f);
  684. if (IS_ERR(map))
  685. return PTR_ERR(map);
  686. if (!(f.file->f_mode & FMODE_CAN_READ)) {
  687. err = -EPERM;
  688. goto err_put;
  689. }
  690. if (ukey) {
  691. key = memdup_user(ukey, map->key_size);
  692. if (IS_ERR(key)) {
  693. err = PTR_ERR(key);
  694. goto err_put;
  695. }
  696. } else {
  697. key = NULL;
  698. }
  699. err = -ENOMEM;
  700. next_key = kmalloc(map->key_size, GFP_USER);
  701. if (!next_key)
  702. goto free_key;
  703. if (bpf_map_is_dev_bound(map)) {
  704. err = bpf_map_offload_get_next_key(map, key, next_key);
  705. goto out;
  706. }
  707. rcu_read_lock();
  708. err = map->ops->map_get_next_key(map, key, next_key);
  709. rcu_read_unlock();
  710. out:
  711. if (err)
  712. goto free_next_key;
  713. err = -EFAULT;
  714. if (copy_to_user(unext_key, next_key, map->key_size) != 0)
  715. goto free_next_key;
  716. trace_bpf_map_next_key(map, ufd, key, next_key);
  717. err = 0;
  718. free_next_key:
  719. kfree(next_key);
  720. free_key:
  721. kfree(key);
  722. err_put:
  723. fdput(f);
  724. return err;
  725. }
  726. static const struct bpf_prog_ops * const bpf_prog_types[] = {
  727. #define BPF_PROG_TYPE(_id, _name) \
  728. [_id] = & _name ## _prog_ops,
  729. #define BPF_MAP_TYPE(_id, _ops)
  730. #include <linux/bpf_types.h>
  731. #undef BPF_PROG_TYPE
  732. #undef BPF_MAP_TYPE
  733. };
  734. static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
  735. {
  736. if (type >= ARRAY_SIZE(bpf_prog_types) || !bpf_prog_types[type])
  737. return -EINVAL;
  738. if (!bpf_prog_is_dev_bound(prog->aux))
  739. prog->aux->ops = bpf_prog_types[type];
  740. else
  741. prog->aux->ops = &bpf_offload_prog_ops;
  742. prog->type = type;
  743. return 0;
  744. }
  745. /* drop refcnt on maps used by eBPF program and free auxilary data */
  746. static void free_used_maps(struct bpf_prog_aux *aux)
  747. {
  748. int i;
  749. for (i = 0; i < aux->used_map_cnt; i++)
  750. bpf_map_put(aux->used_maps[i]);
  751. kfree(aux->used_maps);
  752. }
  753. int __bpf_prog_charge(struct user_struct *user, u32 pages)
  754. {
  755. unsigned long memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  756. unsigned long user_bufs;
  757. if (user) {
  758. user_bufs = atomic_long_add_return(pages, &user->locked_vm);
  759. if (user_bufs > memlock_limit) {
  760. atomic_long_sub(pages, &user->locked_vm);
  761. return -EPERM;
  762. }
  763. }
  764. return 0;
  765. }
  766. void __bpf_prog_uncharge(struct user_struct *user, u32 pages)
  767. {
  768. if (user)
  769. atomic_long_sub(pages, &user->locked_vm);
  770. }
  771. static int bpf_prog_charge_memlock(struct bpf_prog *prog)
  772. {
  773. struct user_struct *user = get_current_user();
  774. int ret;
  775. ret = __bpf_prog_charge(user, prog->pages);
  776. if (ret) {
  777. free_uid(user);
  778. return ret;
  779. }
  780. prog->aux->user = user;
  781. return 0;
  782. }
  783. static void bpf_prog_uncharge_memlock(struct bpf_prog *prog)
  784. {
  785. struct user_struct *user = prog->aux->user;
  786. __bpf_prog_uncharge(user, prog->pages);
  787. free_uid(user);
  788. }
  789. static int bpf_prog_alloc_id(struct bpf_prog *prog)
  790. {
  791. int id;
  792. idr_preload(GFP_KERNEL);
  793. spin_lock_bh(&prog_idr_lock);
  794. id = idr_alloc_cyclic(&prog_idr, prog, 1, INT_MAX, GFP_ATOMIC);
  795. if (id > 0)
  796. prog->aux->id = id;
  797. spin_unlock_bh(&prog_idr_lock);
  798. idr_preload_end();
  799. /* id is in [1, INT_MAX) */
  800. if (WARN_ON_ONCE(!id))
  801. return -ENOSPC;
  802. return id > 0 ? 0 : id;
  803. }
  804. void bpf_prog_free_id(struct bpf_prog *prog, bool do_idr_lock)
  805. {
  806. /* cBPF to eBPF migrations are currently not in the idr store.
  807. * Offloaded programs are removed from the store when their device
  808. * disappears - even if someone grabs an fd to them they are unusable,
  809. * simply waiting for refcnt to drop to be freed.
  810. */
  811. if (!prog->aux->id)
  812. return;
  813. if (do_idr_lock)
  814. spin_lock_bh(&prog_idr_lock);
  815. else
  816. __acquire(&prog_idr_lock);
  817. idr_remove(&prog_idr, prog->aux->id);
  818. prog->aux->id = 0;
  819. if (do_idr_lock)
  820. spin_unlock_bh(&prog_idr_lock);
  821. else
  822. __release(&prog_idr_lock);
  823. }
  824. static void __bpf_prog_put_rcu(struct rcu_head *rcu)
  825. {
  826. struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);
  827. free_used_maps(aux);
  828. bpf_prog_uncharge_memlock(aux->prog);
  829. security_bpf_prog_free(aux);
  830. bpf_prog_free(aux->prog);
  831. }
  832. static void __bpf_prog_put(struct bpf_prog *prog, bool do_idr_lock)
  833. {
  834. if (atomic_dec_and_test(&prog->aux->refcnt)) {
  835. int i;
  836. trace_bpf_prog_put_rcu(prog);
  837. /* bpf_prog_free_id() must be called first */
  838. bpf_prog_free_id(prog, do_idr_lock);
  839. for (i = 0; i < prog->aux->func_cnt; i++)
  840. bpf_prog_kallsyms_del(prog->aux->func[i]);
  841. bpf_prog_kallsyms_del(prog);
  842. call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
  843. }
  844. }
  845. void bpf_prog_put(struct bpf_prog *prog)
  846. {
  847. __bpf_prog_put(prog, true);
  848. }
  849. EXPORT_SYMBOL_GPL(bpf_prog_put);
  850. static int bpf_prog_release(struct inode *inode, struct file *filp)
  851. {
  852. struct bpf_prog *prog = filp->private_data;
  853. bpf_prog_put(prog);
  854. return 0;
  855. }
  856. #ifdef CONFIG_PROC_FS
  857. static void bpf_prog_show_fdinfo(struct seq_file *m, struct file *filp)
  858. {
  859. const struct bpf_prog *prog = filp->private_data;
  860. char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
  861. bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
  862. seq_printf(m,
  863. "prog_type:\t%u\n"
  864. "prog_jited:\t%u\n"
  865. "prog_tag:\t%s\n"
  866. "memlock:\t%llu\n",
  867. prog->type,
  868. prog->jited,
  869. prog_tag,
  870. prog->pages * 1ULL << PAGE_SHIFT);
  871. }
  872. #endif
  873. const struct file_operations bpf_prog_fops = {
  874. #ifdef CONFIG_PROC_FS
  875. .show_fdinfo = bpf_prog_show_fdinfo,
  876. #endif
  877. .release = bpf_prog_release,
  878. .read = bpf_dummy_read,
  879. .write = bpf_dummy_write,
  880. };
  881. int bpf_prog_new_fd(struct bpf_prog *prog)
  882. {
  883. int ret;
  884. ret = security_bpf_prog(prog);
  885. if (ret < 0)
  886. return ret;
  887. return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
  888. O_RDWR | O_CLOEXEC);
  889. }
  890. static struct bpf_prog *____bpf_prog_get(struct fd f)
  891. {
  892. if (!f.file)
  893. return ERR_PTR(-EBADF);
  894. if (f.file->f_op != &bpf_prog_fops) {
  895. fdput(f);
  896. return ERR_PTR(-EINVAL);
  897. }
  898. return f.file->private_data;
  899. }
  900. struct bpf_prog *bpf_prog_add(struct bpf_prog *prog, int i)
  901. {
  902. if (atomic_add_return(i, &prog->aux->refcnt) > BPF_MAX_REFCNT) {
  903. atomic_sub(i, &prog->aux->refcnt);
  904. return ERR_PTR(-EBUSY);
  905. }
  906. return prog;
  907. }
  908. EXPORT_SYMBOL_GPL(bpf_prog_add);
  909. void bpf_prog_sub(struct bpf_prog *prog, int i)
  910. {
  911. /* Only to be used for undoing previous bpf_prog_add() in some
  912. * error path. We still know that another entity in our call
  913. * path holds a reference to the program, thus atomic_sub() can
  914. * be safely used in such cases!
  915. */
  916. WARN_ON(atomic_sub_return(i, &prog->aux->refcnt) == 0);
  917. }
  918. EXPORT_SYMBOL_GPL(bpf_prog_sub);
  919. struct bpf_prog *bpf_prog_inc(struct bpf_prog *prog)
  920. {
  921. return bpf_prog_add(prog, 1);
  922. }
  923. EXPORT_SYMBOL_GPL(bpf_prog_inc);
  924. /* prog_idr_lock should have been held */
  925. struct bpf_prog *bpf_prog_inc_not_zero(struct bpf_prog *prog)
  926. {
  927. int refold;
  928. refold = __atomic_add_unless(&prog->aux->refcnt, 1, 0);
  929. if (refold >= BPF_MAX_REFCNT) {
  930. __bpf_prog_put(prog, false);
  931. return ERR_PTR(-EBUSY);
  932. }
  933. if (!refold)
  934. return ERR_PTR(-ENOENT);
  935. return prog;
  936. }
  937. EXPORT_SYMBOL_GPL(bpf_prog_inc_not_zero);
  938. bool bpf_prog_get_ok(struct bpf_prog *prog,
  939. enum bpf_prog_type *attach_type, bool attach_drv)
  940. {
  941. /* not an attachment, just a refcount inc, always allow */
  942. if (!attach_type)
  943. return true;
  944. if (prog->type != *attach_type)
  945. return false;
  946. if (bpf_prog_is_dev_bound(prog->aux) && !attach_drv)
  947. return false;
  948. return true;
  949. }
  950. static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *attach_type,
  951. bool attach_drv)
  952. {
  953. struct fd f = fdget(ufd);
  954. struct bpf_prog *prog;
  955. prog = ____bpf_prog_get(f);
  956. if (IS_ERR(prog))
  957. return prog;
  958. if (!bpf_prog_get_ok(prog, attach_type, attach_drv)) {
  959. prog = ERR_PTR(-EINVAL);
  960. goto out;
  961. }
  962. prog = bpf_prog_inc(prog);
  963. out:
  964. fdput(f);
  965. return prog;
  966. }
  967. struct bpf_prog *bpf_prog_get(u32 ufd)
  968. {
  969. return __bpf_prog_get(ufd, NULL, false);
  970. }
  971. struct bpf_prog *bpf_prog_get_type_dev(u32 ufd, enum bpf_prog_type type,
  972. bool attach_drv)
  973. {
  974. struct bpf_prog *prog = __bpf_prog_get(ufd, &type, attach_drv);
  975. if (!IS_ERR(prog))
  976. trace_bpf_prog_get_type(prog);
  977. return prog;
  978. }
  979. EXPORT_SYMBOL_GPL(bpf_prog_get_type_dev);
  980. static int
  981. bpf_prog_load_check_attach_type(enum bpf_prog_type prog_type,
  982. enum bpf_attach_type expected_attach_type)
  983. {
  984. /* There are currently no prog types that require specifying
  985. * attach_type at load time.
  986. */
  987. return 0;
  988. }
  989. static int bpf_prog_attach_check_attach_type(const struct bpf_prog *prog,
  990. enum bpf_attach_type attach_type)
  991. {
  992. /* There are currently no prog types that require specifying
  993. * attach_type at load time.
  994. */
  995. return 0;
  996. }
  997. /* last field in 'union bpf_attr' used by this command */
  998. #define BPF_PROG_LOAD_LAST_FIELD expected_attach_type
  999. static int bpf_prog_load(union bpf_attr *attr)
  1000. {
  1001. enum bpf_prog_type type = attr->prog_type;
  1002. struct bpf_prog *prog;
  1003. int err;
  1004. char license[128];
  1005. bool is_gpl;
  1006. if (CHECK_ATTR(BPF_PROG_LOAD))
  1007. return -EINVAL;
  1008. if (attr->prog_flags & ~BPF_F_STRICT_ALIGNMENT)
  1009. return -EINVAL;
  1010. /* copy eBPF program license from user space */
  1011. if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
  1012. sizeof(license) - 1) < 0)
  1013. return -EFAULT;
  1014. license[sizeof(license) - 1] = 0;
  1015. /* eBPF programs must be GPL compatible to use GPL-ed functions */
  1016. is_gpl = license_is_gpl_compatible(license);
  1017. if (attr->insn_cnt == 0 || attr->insn_cnt > BPF_MAXINSNS)
  1018. return -E2BIG;
  1019. if (type == BPF_PROG_TYPE_KPROBE &&
  1020. attr->kern_version != LINUX_VERSION_CODE)
  1021. return -EINVAL;
  1022. if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
  1023. type != BPF_PROG_TYPE_CGROUP_SKB &&
  1024. !capable(CAP_SYS_ADMIN))
  1025. return -EPERM;
  1026. if (bpf_prog_load_check_attach_type(type, attr->expected_attach_type))
  1027. return -EINVAL;
  1028. /* plain bpf_prog allocation */
  1029. prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
  1030. if (!prog)
  1031. return -ENOMEM;
  1032. prog->expected_attach_type = attr->expected_attach_type;
  1033. prog->aux->offload_requested = !!attr->prog_ifindex;
  1034. err = security_bpf_prog_alloc(prog->aux);
  1035. if (err)
  1036. goto free_prog_nouncharge;
  1037. err = bpf_prog_charge_memlock(prog);
  1038. if (err)
  1039. goto free_prog_sec;
  1040. prog->len = attr->insn_cnt;
  1041. err = -EFAULT;
  1042. if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
  1043. bpf_prog_insn_size(prog)) != 0)
  1044. goto free_prog;
  1045. prog->orig_prog = NULL;
  1046. prog->jited = 0;
  1047. atomic_set(&prog->aux->refcnt, 1);
  1048. prog->gpl_compatible = is_gpl ? 1 : 0;
  1049. if (bpf_prog_is_dev_bound(prog->aux)) {
  1050. err = bpf_prog_offload_init(prog, attr);
  1051. if (err)
  1052. goto free_prog;
  1053. }
  1054. /* find program type: socket_filter vs tracing_filter */
  1055. err = find_prog_type(type, prog);
  1056. if (err < 0)
  1057. goto free_prog;
  1058. prog->aux->load_time = ktime_get_boot_ns();
  1059. err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name);
  1060. if (err)
  1061. goto free_prog;
  1062. /* run eBPF verifier */
  1063. err = bpf_check(&prog, attr);
  1064. if (err < 0)
  1065. goto free_used_maps;
  1066. /* eBPF program is ready to be JITed */
  1067. if (!prog->bpf_func)
  1068. prog = bpf_prog_select_runtime(prog, &err);
  1069. if (err < 0)
  1070. goto free_used_maps;
  1071. err = bpf_prog_alloc_id(prog);
  1072. if (err)
  1073. goto free_used_maps;
  1074. err = bpf_prog_new_fd(prog);
  1075. if (err < 0) {
  1076. /* failed to allocate fd.
  1077. * bpf_prog_put() is needed because the above
  1078. * bpf_prog_alloc_id() has published the prog
  1079. * to the userspace and the userspace may
  1080. * have refcnt-ed it through BPF_PROG_GET_FD_BY_ID.
  1081. */
  1082. bpf_prog_put(prog);
  1083. return err;
  1084. }
  1085. bpf_prog_kallsyms_add(prog);
  1086. trace_bpf_prog_load(prog, err);
  1087. return err;
  1088. free_used_maps:
  1089. free_used_maps(prog->aux);
  1090. free_prog:
  1091. bpf_prog_uncharge_memlock(prog);
  1092. free_prog_sec:
  1093. security_bpf_prog_free(prog->aux);
  1094. free_prog_nouncharge:
  1095. bpf_prog_free(prog);
  1096. return err;
  1097. }
  1098. #define BPF_OBJ_LAST_FIELD file_flags
  1099. static int bpf_obj_pin(const union bpf_attr *attr)
  1100. {
  1101. if (CHECK_ATTR(BPF_OBJ) || attr->file_flags != 0)
  1102. return -EINVAL;
  1103. return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
  1104. }
  1105. static int bpf_obj_get(const union bpf_attr *attr)
  1106. {
  1107. if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
  1108. attr->file_flags & ~BPF_OBJ_FLAG_MASK)
  1109. return -EINVAL;
  1110. return bpf_obj_get_user(u64_to_user_ptr(attr->pathname),
  1111. attr->file_flags);
  1112. }
  1113. struct bpf_raw_tracepoint {
  1114. struct bpf_raw_event_map *btp;
  1115. struct bpf_prog *prog;
  1116. };
  1117. static int bpf_raw_tracepoint_release(struct inode *inode, struct file *filp)
  1118. {
  1119. struct bpf_raw_tracepoint *raw_tp = filp->private_data;
  1120. if (raw_tp->prog) {
  1121. bpf_probe_unregister(raw_tp->btp, raw_tp->prog);
  1122. bpf_prog_put(raw_tp->prog);
  1123. }
  1124. kfree(raw_tp);
  1125. return 0;
  1126. }
  1127. static const struct file_operations bpf_raw_tp_fops = {
  1128. .release = bpf_raw_tracepoint_release,
  1129. .read = bpf_dummy_read,
  1130. .write = bpf_dummy_write,
  1131. };
  1132. #define BPF_RAW_TRACEPOINT_OPEN_LAST_FIELD raw_tracepoint.prog_fd
  1133. static int bpf_raw_tracepoint_open(const union bpf_attr *attr)
  1134. {
  1135. struct bpf_raw_tracepoint *raw_tp;
  1136. struct bpf_raw_event_map *btp;
  1137. struct bpf_prog *prog;
  1138. char tp_name[128];
  1139. int tp_fd, err;
  1140. if (strncpy_from_user(tp_name, u64_to_user_ptr(attr->raw_tracepoint.name),
  1141. sizeof(tp_name) - 1) < 0)
  1142. return -EFAULT;
  1143. tp_name[sizeof(tp_name) - 1] = 0;
  1144. btp = bpf_find_raw_tracepoint(tp_name);
  1145. if (!btp)
  1146. return -ENOENT;
  1147. raw_tp = kzalloc(sizeof(*raw_tp), GFP_USER);
  1148. if (!raw_tp)
  1149. return -ENOMEM;
  1150. raw_tp->btp = btp;
  1151. prog = bpf_prog_get_type(attr->raw_tracepoint.prog_fd,
  1152. BPF_PROG_TYPE_RAW_TRACEPOINT);
  1153. if (IS_ERR(prog)) {
  1154. err = PTR_ERR(prog);
  1155. goto out_free_tp;
  1156. }
  1157. err = bpf_probe_register(raw_tp->btp, prog);
  1158. if (err)
  1159. goto out_put_prog;
  1160. raw_tp->prog = prog;
  1161. tp_fd = anon_inode_getfd("bpf-raw-tracepoint", &bpf_raw_tp_fops, raw_tp,
  1162. O_CLOEXEC);
  1163. if (tp_fd < 0) {
  1164. bpf_probe_unregister(raw_tp->btp, prog);
  1165. err = tp_fd;
  1166. goto out_put_prog;
  1167. }
  1168. return tp_fd;
  1169. out_put_prog:
  1170. bpf_prog_put(prog);
  1171. out_free_tp:
  1172. kfree(raw_tp);
  1173. return err;
  1174. }
  1175. #ifdef CONFIG_CGROUP_BPF
  1176. #define BPF_PROG_ATTACH_LAST_FIELD attach_flags
  1177. static int sockmap_get_from_fd(const union bpf_attr *attr,
  1178. int type, bool attach)
  1179. {
  1180. struct bpf_prog *prog = NULL;
  1181. int ufd = attr->target_fd;
  1182. struct bpf_map *map;
  1183. struct fd f;
  1184. int err;
  1185. f = fdget(ufd);
  1186. map = __bpf_map_get(f);
  1187. if (IS_ERR(map))
  1188. return PTR_ERR(map);
  1189. if (attach) {
  1190. prog = bpf_prog_get_type(attr->attach_bpf_fd, type);
  1191. if (IS_ERR(prog)) {
  1192. fdput(f);
  1193. return PTR_ERR(prog);
  1194. }
  1195. }
  1196. err = sock_map_prog(map, prog, attr->attach_type);
  1197. if (err) {
  1198. fdput(f);
  1199. if (prog)
  1200. bpf_prog_put(prog);
  1201. return err;
  1202. }
  1203. fdput(f);
  1204. return 0;
  1205. }
  1206. #define BPF_F_ATTACH_MASK \
  1207. (BPF_F_ALLOW_OVERRIDE | BPF_F_ALLOW_MULTI)
  1208. static int bpf_prog_attach(const union bpf_attr *attr)
  1209. {
  1210. enum bpf_prog_type ptype;
  1211. struct bpf_prog *prog;
  1212. struct cgroup *cgrp;
  1213. int ret;
  1214. if (!capable(CAP_NET_ADMIN))
  1215. return -EPERM;
  1216. if (CHECK_ATTR(BPF_PROG_ATTACH))
  1217. return -EINVAL;
  1218. if (attr->attach_flags & ~BPF_F_ATTACH_MASK)
  1219. return -EINVAL;
  1220. switch (attr->attach_type) {
  1221. case BPF_CGROUP_INET_INGRESS:
  1222. case BPF_CGROUP_INET_EGRESS:
  1223. ptype = BPF_PROG_TYPE_CGROUP_SKB;
  1224. break;
  1225. case BPF_CGROUP_INET_SOCK_CREATE:
  1226. ptype = BPF_PROG_TYPE_CGROUP_SOCK;
  1227. break;
  1228. case BPF_CGROUP_SOCK_OPS:
  1229. ptype = BPF_PROG_TYPE_SOCK_OPS;
  1230. break;
  1231. case BPF_CGROUP_DEVICE:
  1232. ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
  1233. break;
  1234. case BPF_SK_MSG_VERDICT:
  1235. return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, true);
  1236. case BPF_SK_SKB_STREAM_PARSER:
  1237. case BPF_SK_SKB_STREAM_VERDICT:
  1238. return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, true);
  1239. default:
  1240. return -EINVAL;
  1241. }
  1242. prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
  1243. if (IS_ERR(prog))
  1244. return PTR_ERR(prog);
  1245. if (bpf_prog_attach_check_attach_type(prog, attr->attach_type)) {
  1246. bpf_prog_put(prog);
  1247. return -EINVAL;
  1248. }
  1249. cgrp = cgroup_get_from_fd(attr->target_fd);
  1250. if (IS_ERR(cgrp)) {
  1251. bpf_prog_put(prog);
  1252. return PTR_ERR(cgrp);
  1253. }
  1254. ret = cgroup_bpf_attach(cgrp, prog, attr->attach_type,
  1255. attr->attach_flags);
  1256. if (ret)
  1257. bpf_prog_put(prog);
  1258. cgroup_put(cgrp);
  1259. return ret;
  1260. }
  1261. #define BPF_PROG_DETACH_LAST_FIELD attach_type
  1262. static int bpf_prog_detach(const union bpf_attr *attr)
  1263. {
  1264. enum bpf_prog_type ptype;
  1265. struct bpf_prog *prog;
  1266. struct cgroup *cgrp;
  1267. int ret;
  1268. if (!capable(CAP_NET_ADMIN))
  1269. return -EPERM;
  1270. if (CHECK_ATTR(BPF_PROG_DETACH))
  1271. return -EINVAL;
  1272. switch (attr->attach_type) {
  1273. case BPF_CGROUP_INET_INGRESS:
  1274. case BPF_CGROUP_INET_EGRESS:
  1275. ptype = BPF_PROG_TYPE_CGROUP_SKB;
  1276. break;
  1277. case BPF_CGROUP_INET_SOCK_CREATE:
  1278. ptype = BPF_PROG_TYPE_CGROUP_SOCK;
  1279. break;
  1280. case BPF_CGROUP_SOCK_OPS:
  1281. ptype = BPF_PROG_TYPE_SOCK_OPS;
  1282. break;
  1283. case BPF_CGROUP_DEVICE:
  1284. ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
  1285. break;
  1286. case BPF_SK_MSG_VERDICT:
  1287. return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, false);
  1288. case BPF_SK_SKB_STREAM_PARSER:
  1289. case BPF_SK_SKB_STREAM_VERDICT:
  1290. return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, false);
  1291. default:
  1292. return -EINVAL;
  1293. }
  1294. cgrp = cgroup_get_from_fd(attr->target_fd);
  1295. if (IS_ERR(cgrp))
  1296. return PTR_ERR(cgrp);
  1297. prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
  1298. if (IS_ERR(prog))
  1299. prog = NULL;
  1300. ret = cgroup_bpf_detach(cgrp, prog, attr->attach_type, 0);
  1301. if (prog)
  1302. bpf_prog_put(prog);
  1303. cgroup_put(cgrp);
  1304. return ret;
  1305. }
  1306. #define BPF_PROG_QUERY_LAST_FIELD query.prog_cnt
  1307. static int bpf_prog_query(const union bpf_attr *attr,
  1308. union bpf_attr __user *uattr)
  1309. {
  1310. struct cgroup *cgrp;
  1311. int ret;
  1312. if (!capable(CAP_NET_ADMIN))
  1313. return -EPERM;
  1314. if (CHECK_ATTR(BPF_PROG_QUERY))
  1315. return -EINVAL;
  1316. if (attr->query.query_flags & ~BPF_F_QUERY_EFFECTIVE)
  1317. return -EINVAL;
  1318. switch (attr->query.attach_type) {
  1319. case BPF_CGROUP_INET_INGRESS:
  1320. case BPF_CGROUP_INET_EGRESS:
  1321. case BPF_CGROUP_INET_SOCK_CREATE:
  1322. case BPF_CGROUP_SOCK_OPS:
  1323. case BPF_CGROUP_DEVICE:
  1324. break;
  1325. default:
  1326. return -EINVAL;
  1327. }
  1328. cgrp = cgroup_get_from_fd(attr->query.target_fd);
  1329. if (IS_ERR(cgrp))
  1330. return PTR_ERR(cgrp);
  1331. ret = cgroup_bpf_query(cgrp, attr, uattr);
  1332. cgroup_put(cgrp);
  1333. return ret;
  1334. }
  1335. #endif /* CONFIG_CGROUP_BPF */
  1336. #define BPF_PROG_TEST_RUN_LAST_FIELD test.duration
  1337. static int bpf_prog_test_run(const union bpf_attr *attr,
  1338. union bpf_attr __user *uattr)
  1339. {
  1340. struct bpf_prog *prog;
  1341. int ret = -ENOTSUPP;
  1342. if (!capable(CAP_SYS_ADMIN))
  1343. return -EPERM;
  1344. if (CHECK_ATTR(BPF_PROG_TEST_RUN))
  1345. return -EINVAL;
  1346. prog = bpf_prog_get(attr->test.prog_fd);
  1347. if (IS_ERR(prog))
  1348. return PTR_ERR(prog);
  1349. if (prog->aux->ops->test_run)
  1350. ret = prog->aux->ops->test_run(prog, attr, uattr);
  1351. bpf_prog_put(prog);
  1352. return ret;
  1353. }
  1354. #define BPF_OBJ_GET_NEXT_ID_LAST_FIELD next_id
  1355. static int bpf_obj_get_next_id(const union bpf_attr *attr,
  1356. union bpf_attr __user *uattr,
  1357. struct idr *idr,
  1358. spinlock_t *lock)
  1359. {
  1360. u32 next_id = attr->start_id;
  1361. int err = 0;
  1362. if (CHECK_ATTR(BPF_OBJ_GET_NEXT_ID) || next_id >= INT_MAX)
  1363. return -EINVAL;
  1364. if (!capable(CAP_SYS_ADMIN))
  1365. return -EPERM;
  1366. next_id++;
  1367. spin_lock_bh(lock);
  1368. if (!idr_get_next(idr, &next_id))
  1369. err = -ENOENT;
  1370. spin_unlock_bh(lock);
  1371. if (!err)
  1372. err = put_user(next_id, &uattr->next_id);
  1373. return err;
  1374. }
  1375. #define BPF_PROG_GET_FD_BY_ID_LAST_FIELD prog_id
  1376. static int bpf_prog_get_fd_by_id(const union bpf_attr *attr)
  1377. {
  1378. struct bpf_prog *prog;
  1379. u32 id = attr->prog_id;
  1380. int fd;
  1381. if (CHECK_ATTR(BPF_PROG_GET_FD_BY_ID))
  1382. return -EINVAL;
  1383. if (!capable(CAP_SYS_ADMIN))
  1384. return -EPERM;
  1385. spin_lock_bh(&prog_idr_lock);
  1386. prog = idr_find(&prog_idr, id);
  1387. if (prog)
  1388. prog = bpf_prog_inc_not_zero(prog);
  1389. else
  1390. prog = ERR_PTR(-ENOENT);
  1391. spin_unlock_bh(&prog_idr_lock);
  1392. if (IS_ERR(prog))
  1393. return PTR_ERR(prog);
  1394. fd = bpf_prog_new_fd(prog);
  1395. if (fd < 0)
  1396. bpf_prog_put(prog);
  1397. return fd;
  1398. }
  1399. #define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
  1400. static int bpf_map_get_fd_by_id(const union bpf_attr *attr)
  1401. {
  1402. struct bpf_map *map;
  1403. u32 id = attr->map_id;
  1404. int f_flags;
  1405. int fd;
  1406. if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
  1407. attr->open_flags & ~BPF_OBJ_FLAG_MASK)
  1408. return -EINVAL;
  1409. if (!capable(CAP_SYS_ADMIN))
  1410. return -EPERM;
  1411. f_flags = bpf_get_file_flag(attr->open_flags);
  1412. if (f_flags < 0)
  1413. return f_flags;
  1414. spin_lock_bh(&map_idr_lock);
  1415. map = idr_find(&map_idr, id);
  1416. if (map)
  1417. map = bpf_map_inc_not_zero(map, true);
  1418. else
  1419. map = ERR_PTR(-ENOENT);
  1420. spin_unlock_bh(&map_idr_lock);
  1421. if (IS_ERR(map))
  1422. return PTR_ERR(map);
  1423. fd = bpf_map_new_fd(map, f_flags);
  1424. if (fd < 0)
  1425. bpf_map_put(map);
  1426. return fd;
  1427. }
  1428. static const struct bpf_map *bpf_map_from_imm(const struct bpf_prog *prog,
  1429. unsigned long addr)
  1430. {
  1431. int i;
  1432. for (i = 0; i < prog->aux->used_map_cnt; i++)
  1433. if (prog->aux->used_maps[i] == (void *)addr)
  1434. return prog->aux->used_maps[i];
  1435. return NULL;
  1436. }
  1437. static struct bpf_insn *bpf_insn_prepare_dump(const struct bpf_prog *prog)
  1438. {
  1439. const struct bpf_map *map;
  1440. struct bpf_insn *insns;
  1441. u64 imm;
  1442. int i;
  1443. insns = kmemdup(prog->insnsi, bpf_prog_insn_size(prog),
  1444. GFP_USER);
  1445. if (!insns)
  1446. return insns;
  1447. for (i = 0; i < prog->len; i++) {
  1448. if (insns[i].code == (BPF_JMP | BPF_TAIL_CALL)) {
  1449. insns[i].code = BPF_JMP | BPF_CALL;
  1450. insns[i].imm = BPF_FUNC_tail_call;
  1451. /* fall-through */
  1452. }
  1453. if (insns[i].code == (BPF_JMP | BPF_CALL) ||
  1454. insns[i].code == (BPF_JMP | BPF_CALL_ARGS)) {
  1455. if (insns[i].code == (BPF_JMP | BPF_CALL_ARGS))
  1456. insns[i].code = BPF_JMP | BPF_CALL;
  1457. if (!bpf_dump_raw_ok())
  1458. insns[i].imm = 0;
  1459. continue;
  1460. }
  1461. if (insns[i].code != (BPF_LD | BPF_IMM | BPF_DW))
  1462. continue;
  1463. imm = ((u64)insns[i + 1].imm << 32) | (u32)insns[i].imm;
  1464. map = bpf_map_from_imm(prog, imm);
  1465. if (map) {
  1466. insns[i].src_reg = BPF_PSEUDO_MAP_FD;
  1467. insns[i].imm = map->id;
  1468. insns[i + 1].imm = 0;
  1469. continue;
  1470. }
  1471. if (!bpf_dump_raw_ok() &&
  1472. imm == (unsigned long)prog->aux) {
  1473. insns[i].imm = 0;
  1474. insns[i + 1].imm = 0;
  1475. continue;
  1476. }
  1477. }
  1478. return insns;
  1479. }
  1480. static int bpf_prog_get_info_by_fd(struct bpf_prog *prog,
  1481. const union bpf_attr *attr,
  1482. union bpf_attr __user *uattr)
  1483. {
  1484. struct bpf_prog_info __user *uinfo = u64_to_user_ptr(attr->info.info);
  1485. struct bpf_prog_info info = {};
  1486. u32 info_len = attr->info.info_len;
  1487. char __user *uinsns;
  1488. u32 ulen;
  1489. int err;
  1490. err = check_uarg_tail_zero(uinfo, sizeof(info), info_len);
  1491. if (err)
  1492. return err;
  1493. info_len = min_t(u32, sizeof(info), info_len);
  1494. if (copy_from_user(&info, uinfo, info_len))
  1495. return -EFAULT;
  1496. info.type = prog->type;
  1497. info.id = prog->aux->id;
  1498. info.load_time = prog->aux->load_time;
  1499. info.created_by_uid = from_kuid_munged(current_user_ns(),
  1500. prog->aux->user->uid);
  1501. memcpy(info.tag, prog->tag, sizeof(prog->tag));
  1502. memcpy(info.name, prog->aux->name, sizeof(prog->aux->name));
  1503. ulen = info.nr_map_ids;
  1504. info.nr_map_ids = prog->aux->used_map_cnt;
  1505. ulen = min_t(u32, info.nr_map_ids, ulen);
  1506. if (ulen) {
  1507. u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
  1508. u32 i;
  1509. for (i = 0; i < ulen; i++)
  1510. if (put_user(prog->aux->used_maps[i]->id,
  1511. &user_map_ids[i]))
  1512. return -EFAULT;
  1513. }
  1514. if (!capable(CAP_SYS_ADMIN)) {
  1515. info.jited_prog_len = 0;
  1516. info.xlated_prog_len = 0;
  1517. goto done;
  1518. }
  1519. ulen = info.xlated_prog_len;
  1520. info.xlated_prog_len = bpf_prog_insn_size(prog);
  1521. if (info.xlated_prog_len && ulen) {
  1522. struct bpf_insn *insns_sanitized;
  1523. bool fault;
  1524. if (prog->blinded && !bpf_dump_raw_ok()) {
  1525. info.xlated_prog_insns = 0;
  1526. goto done;
  1527. }
  1528. insns_sanitized = bpf_insn_prepare_dump(prog);
  1529. if (!insns_sanitized)
  1530. return -ENOMEM;
  1531. uinsns = u64_to_user_ptr(info.xlated_prog_insns);
  1532. ulen = min_t(u32, info.xlated_prog_len, ulen);
  1533. fault = copy_to_user(uinsns, insns_sanitized, ulen);
  1534. kfree(insns_sanitized);
  1535. if (fault)
  1536. return -EFAULT;
  1537. }
  1538. if (bpf_prog_is_dev_bound(prog->aux)) {
  1539. err = bpf_prog_offload_info_fill(&info, prog);
  1540. if (err)
  1541. return err;
  1542. goto done;
  1543. }
  1544. /* NOTE: the following code is supposed to be skipped for offload.
  1545. * bpf_prog_offload_info_fill() is the place to fill similar fields
  1546. * for offload.
  1547. */
  1548. ulen = info.jited_prog_len;
  1549. info.jited_prog_len = prog->jited_len;
  1550. if (info.jited_prog_len && ulen) {
  1551. if (bpf_dump_raw_ok()) {
  1552. uinsns = u64_to_user_ptr(info.jited_prog_insns);
  1553. ulen = min_t(u32, info.jited_prog_len, ulen);
  1554. if (copy_to_user(uinsns, prog->bpf_func, ulen))
  1555. return -EFAULT;
  1556. } else {
  1557. info.jited_prog_insns = 0;
  1558. }
  1559. }
  1560. done:
  1561. if (copy_to_user(uinfo, &info, info_len) ||
  1562. put_user(info_len, &uattr->info.info_len))
  1563. return -EFAULT;
  1564. return 0;
  1565. }
  1566. static int bpf_map_get_info_by_fd(struct bpf_map *map,
  1567. const union bpf_attr *attr,
  1568. union bpf_attr __user *uattr)
  1569. {
  1570. struct bpf_map_info __user *uinfo = u64_to_user_ptr(attr->info.info);
  1571. struct bpf_map_info info = {};
  1572. u32 info_len = attr->info.info_len;
  1573. int err;
  1574. err = check_uarg_tail_zero(uinfo, sizeof(info), info_len);
  1575. if (err)
  1576. return err;
  1577. info_len = min_t(u32, sizeof(info), info_len);
  1578. info.type = map->map_type;
  1579. info.id = map->id;
  1580. info.key_size = map->key_size;
  1581. info.value_size = map->value_size;
  1582. info.max_entries = map->max_entries;
  1583. info.map_flags = map->map_flags;
  1584. memcpy(info.name, map->name, sizeof(map->name));
  1585. if (bpf_map_is_dev_bound(map)) {
  1586. err = bpf_map_offload_info_fill(&info, map);
  1587. if (err)
  1588. return err;
  1589. }
  1590. if (copy_to_user(uinfo, &info, info_len) ||
  1591. put_user(info_len, &uattr->info.info_len))
  1592. return -EFAULT;
  1593. return 0;
  1594. }
  1595. #define BPF_OBJ_GET_INFO_BY_FD_LAST_FIELD info.info
  1596. static int bpf_obj_get_info_by_fd(const union bpf_attr *attr,
  1597. union bpf_attr __user *uattr)
  1598. {
  1599. int ufd = attr->info.bpf_fd;
  1600. struct fd f;
  1601. int err;
  1602. if (CHECK_ATTR(BPF_OBJ_GET_INFO_BY_FD))
  1603. return -EINVAL;
  1604. f = fdget(ufd);
  1605. if (!f.file)
  1606. return -EBADFD;
  1607. if (f.file->f_op == &bpf_prog_fops)
  1608. err = bpf_prog_get_info_by_fd(f.file->private_data, attr,
  1609. uattr);
  1610. else if (f.file->f_op == &bpf_map_fops)
  1611. err = bpf_map_get_info_by_fd(f.file->private_data, attr,
  1612. uattr);
  1613. else
  1614. err = -EINVAL;
  1615. fdput(f);
  1616. return err;
  1617. }
  1618. SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
  1619. {
  1620. union bpf_attr attr = {};
  1621. int err;
  1622. if (sysctl_unprivileged_bpf_disabled && !capable(CAP_SYS_ADMIN))
  1623. return -EPERM;
  1624. err = check_uarg_tail_zero(uattr, sizeof(attr), size);
  1625. if (err)
  1626. return err;
  1627. size = min_t(u32, size, sizeof(attr));
  1628. /* copy attributes from user space, may be less than sizeof(bpf_attr) */
  1629. if (copy_from_user(&attr, uattr, size) != 0)
  1630. return -EFAULT;
  1631. err = security_bpf(cmd, &attr, size);
  1632. if (err < 0)
  1633. return err;
  1634. switch (cmd) {
  1635. case BPF_MAP_CREATE:
  1636. err = map_create(&attr);
  1637. break;
  1638. case BPF_MAP_LOOKUP_ELEM:
  1639. err = map_lookup_elem(&attr);
  1640. break;
  1641. case BPF_MAP_UPDATE_ELEM:
  1642. err = map_update_elem(&attr);
  1643. break;
  1644. case BPF_MAP_DELETE_ELEM:
  1645. err = map_delete_elem(&attr);
  1646. break;
  1647. case BPF_MAP_GET_NEXT_KEY:
  1648. err = map_get_next_key(&attr);
  1649. break;
  1650. case BPF_PROG_LOAD:
  1651. err = bpf_prog_load(&attr);
  1652. break;
  1653. case BPF_OBJ_PIN:
  1654. err = bpf_obj_pin(&attr);
  1655. break;
  1656. case BPF_OBJ_GET:
  1657. err = bpf_obj_get(&attr);
  1658. break;
  1659. #ifdef CONFIG_CGROUP_BPF
  1660. case BPF_PROG_ATTACH:
  1661. err = bpf_prog_attach(&attr);
  1662. break;
  1663. case BPF_PROG_DETACH:
  1664. err = bpf_prog_detach(&attr);
  1665. break;
  1666. case BPF_PROG_QUERY:
  1667. err = bpf_prog_query(&attr, uattr);
  1668. break;
  1669. #endif
  1670. case BPF_PROG_TEST_RUN:
  1671. err = bpf_prog_test_run(&attr, uattr);
  1672. break;
  1673. case BPF_PROG_GET_NEXT_ID:
  1674. err = bpf_obj_get_next_id(&attr, uattr,
  1675. &prog_idr, &prog_idr_lock);
  1676. break;
  1677. case BPF_MAP_GET_NEXT_ID:
  1678. err = bpf_obj_get_next_id(&attr, uattr,
  1679. &map_idr, &map_idr_lock);
  1680. break;
  1681. case BPF_PROG_GET_FD_BY_ID:
  1682. err = bpf_prog_get_fd_by_id(&attr);
  1683. break;
  1684. case BPF_MAP_GET_FD_BY_ID:
  1685. err = bpf_map_get_fd_by_id(&attr);
  1686. break;
  1687. case BPF_OBJ_GET_INFO_BY_FD:
  1688. err = bpf_obj_get_info_by_fd(&attr, uattr);
  1689. break;
  1690. case BPF_RAW_TRACEPOINT_OPEN:
  1691. err = bpf_raw_tracepoint_open(&attr);
  1692. break;
  1693. default:
  1694. err = -EINVAL;
  1695. break;
  1696. }
  1697. return err;
  1698. }