syscall.c 45 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012
  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. /* last field in 'union bpf_attr' used by this command */
  981. #define BPF_PROG_LOAD_LAST_FIELD prog_ifindex
  982. static int bpf_prog_load(union bpf_attr *attr)
  983. {
  984. enum bpf_prog_type type = attr->prog_type;
  985. struct bpf_prog *prog;
  986. int err;
  987. char license[128];
  988. bool is_gpl;
  989. if (CHECK_ATTR(BPF_PROG_LOAD))
  990. return -EINVAL;
  991. if (attr->prog_flags & ~BPF_F_STRICT_ALIGNMENT)
  992. return -EINVAL;
  993. /* copy eBPF program license from user space */
  994. if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
  995. sizeof(license) - 1) < 0)
  996. return -EFAULT;
  997. license[sizeof(license) - 1] = 0;
  998. /* eBPF programs must be GPL compatible to use GPL-ed functions */
  999. is_gpl = license_is_gpl_compatible(license);
  1000. if (attr->insn_cnt == 0 || attr->insn_cnt > BPF_MAXINSNS)
  1001. return -E2BIG;
  1002. if (type == BPF_PROG_TYPE_KPROBE &&
  1003. attr->kern_version != LINUX_VERSION_CODE)
  1004. return -EINVAL;
  1005. if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
  1006. type != BPF_PROG_TYPE_CGROUP_SKB &&
  1007. !capable(CAP_SYS_ADMIN))
  1008. return -EPERM;
  1009. /* plain bpf_prog allocation */
  1010. prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
  1011. if (!prog)
  1012. return -ENOMEM;
  1013. prog->aux->offload_requested = !!attr->prog_ifindex;
  1014. err = security_bpf_prog_alloc(prog->aux);
  1015. if (err)
  1016. goto free_prog_nouncharge;
  1017. err = bpf_prog_charge_memlock(prog);
  1018. if (err)
  1019. goto free_prog_sec;
  1020. prog->len = attr->insn_cnt;
  1021. err = -EFAULT;
  1022. if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
  1023. bpf_prog_insn_size(prog)) != 0)
  1024. goto free_prog;
  1025. prog->orig_prog = NULL;
  1026. prog->jited = 0;
  1027. atomic_set(&prog->aux->refcnt, 1);
  1028. prog->gpl_compatible = is_gpl ? 1 : 0;
  1029. if (bpf_prog_is_dev_bound(prog->aux)) {
  1030. err = bpf_prog_offload_init(prog, attr);
  1031. if (err)
  1032. goto free_prog;
  1033. }
  1034. /* find program type: socket_filter vs tracing_filter */
  1035. err = find_prog_type(type, prog);
  1036. if (err < 0)
  1037. goto free_prog;
  1038. prog->aux->load_time = ktime_get_boot_ns();
  1039. err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name);
  1040. if (err)
  1041. goto free_prog;
  1042. /* run eBPF verifier */
  1043. err = bpf_check(&prog, attr);
  1044. if (err < 0)
  1045. goto free_used_maps;
  1046. /* eBPF program is ready to be JITed */
  1047. if (!prog->bpf_func)
  1048. prog = bpf_prog_select_runtime(prog, &err);
  1049. if (err < 0)
  1050. goto free_used_maps;
  1051. err = bpf_prog_alloc_id(prog);
  1052. if (err)
  1053. goto free_used_maps;
  1054. err = bpf_prog_new_fd(prog);
  1055. if (err < 0) {
  1056. /* failed to allocate fd.
  1057. * bpf_prog_put() is needed because the above
  1058. * bpf_prog_alloc_id() has published the prog
  1059. * to the userspace and the userspace may
  1060. * have refcnt-ed it through BPF_PROG_GET_FD_BY_ID.
  1061. */
  1062. bpf_prog_put(prog);
  1063. return err;
  1064. }
  1065. bpf_prog_kallsyms_add(prog);
  1066. trace_bpf_prog_load(prog, err);
  1067. return err;
  1068. free_used_maps:
  1069. free_used_maps(prog->aux);
  1070. free_prog:
  1071. bpf_prog_uncharge_memlock(prog);
  1072. free_prog_sec:
  1073. security_bpf_prog_free(prog->aux);
  1074. free_prog_nouncharge:
  1075. bpf_prog_free(prog);
  1076. return err;
  1077. }
  1078. #define BPF_OBJ_LAST_FIELD file_flags
  1079. static int bpf_obj_pin(const union bpf_attr *attr)
  1080. {
  1081. if (CHECK_ATTR(BPF_OBJ) || attr->file_flags != 0)
  1082. return -EINVAL;
  1083. return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
  1084. }
  1085. static int bpf_obj_get(const union bpf_attr *attr)
  1086. {
  1087. if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
  1088. attr->file_flags & ~BPF_OBJ_FLAG_MASK)
  1089. return -EINVAL;
  1090. return bpf_obj_get_user(u64_to_user_ptr(attr->pathname),
  1091. attr->file_flags);
  1092. }
  1093. struct bpf_raw_tracepoint {
  1094. struct bpf_raw_event_map *btp;
  1095. struct bpf_prog *prog;
  1096. };
  1097. static int bpf_raw_tracepoint_release(struct inode *inode, struct file *filp)
  1098. {
  1099. struct bpf_raw_tracepoint *raw_tp = filp->private_data;
  1100. if (raw_tp->prog) {
  1101. bpf_probe_unregister(raw_tp->btp, raw_tp->prog);
  1102. bpf_prog_put(raw_tp->prog);
  1103. }
  1104. kfree(raw_tp);
  1105. return 0;
  1106. }
  1107. static const struct file_operations bpf_raw_tp_fops = {
  1108. .release = bpf_raw_tracepoint_release,
  1109. .read = bpf_dummy_read,
  1110. .write = bpf_dummy_write,
  1111. };
  1112. #define BPF_RAW_TRACEPOINT_OPEN_LAST_FIELD raw_tracepoint.prog_fd
  1113. static int bpf_raw_tracepoint_open(const union bpf_attr *attr)
  1114. {
  1115. struct bpf_raw_tracepoint *raw_tp;
  1116. struct bpf_raw_event_map *btp;
  1117. struct bpf_prog *prog;
  1118. char tp_name[128];
  1119. int tp_fd, err;
  1120. if (strncpy_from_user(tp_name, u64_to_user_ptr(attr->raw_tracepoint.name),
  1121. sizeof(tp_name) - 1) < 0)
  1122. return -EFAULT;
  1123. tp_name[sizeof(tp_name) - 1] = 0;
  1124. btp = bpf_find_raw_tracepoint(tp_name);
  1125. if (!btp)
  1126. return -ENOENT;
  1127. raw_tp = kzalloc(sizeof(*raw_tp), GFP_USER);
  1128. if (!raw_tp)
  1129. return -ENOMEM;
  1130. raw_tp->btp = btp;
  1131. prog = bpf_prog_get_type(attr->raw_tracepoint.prog_fd,
  1132. BPF_PROG_TYPE_RAW_TRACEPOINT);
  1133. if (IS_ERR(prog)) {
  1134. err = PTR_ERR(prog);
  1135. goto out_free_tp;
  1136. }
  1137. err = bpf_probe_register(raw_tp->btp, prog);
  1138. if (err)
  1139. goto out_put_prog;
  1140. raw_tp->prog = prog;
  1141. tp_fd = anon_inode_getfd("bpf-raw-tracepoint", &bpf_raw_tp_fops, raw_tp,
  1142. O_CLOEXEC);
  1143. if (tp_fd < 0) {
  1144. bpf_probe_unregister(raw_tp->btp, prog);
  1145. err = tp_fd;
  1146. goto out_put_prog;
  1147. }
  1148. return tp_fd;
  1149. out_put_prog:
  1150. bpf_prog_put(prog);
  1151. out_free_tp:
  1152. kfree(raw_tp);
  1153. return err;
  1154. }
  1155. #ifdef CONFIG_CGROUP_BPF
  1156. #define BPF_PROG_ATTACH_LAST_FIELD attach_flags
  1157. static int sockmap_get_from_fd(const union bpf_attr *attr,
  1158. int type, bool attach)
  1159. {
  1160. struct bpf_prog *prog = NULL;
  1161. int ufd = attr->target_fd;
  1162. struct bpf_map *map;
  1163. struct fd f;
  1164. int err;
  1165. f = fdget(ufd);
  1166. map = __bpf_map_get(f);
  1167. if (IS_ERR(map))
  1168. return PTR_ERR(map);
  1169. if (attach) {
  1170. prog = bpf_prog_get_type(attr->attach_bpf_fd, type);
  1171. if (IS_ERR(prog)) {
  1172. fdput(f);
  1173. return PTR_ERR(prog);
  1174. }
  1175. }
  1176. err = sock_map_prog(map, prog, attr->attach_type);
  1177. if (err) {
  1178. fdput(f);
  1179. if (prog)
  1180. bpf_prog_put(prog);
  1181. return err;
  1182. }
  1183. fdput(f);
  1184. return 0;
  1185. }
  1186. #define BPF_F_ATTACH_MASK \
  1187. (BPF_F_ALLOW_OVERRIDE | BPF_F_ALLOW_MULTI)
  1188. static int bpf_prog_attach(const union bpf_attr *attr)
  1189. {
  1190. enum bpf_prog_type ptype;
  1191. struct bpf_prog *prog;
  1192. struct cgroup *cgrp;
  1193. int ret;
  1194. if (!capable(CAP_NET_ADMIN))
  1195. return -EPERM;
  1196. if (CHECK_ATTR(BPF_PROG_ATTACH))
  1197. return -EINVAL;
  1198. if (attr->attach_flags & ~BPF_F_ATTACH_MASK)
  1199. return -EINVAL;
  1200. switch (attr->attach_type) {
  1201. case BPF_CGROUP_INET_INGRESS:
  1202. case BPF_CGROUP_INET_EGRESS:
  1203. ptype = BPF_PROG_TYPE_CGROUP_SKB;
  1204. break;
  1205. case BPF_CGROUP_INET_SOCK_CREATE:
  1206. ptype = BPF_PROG_TYPE_CGROUP_SOCK;
  1207. break;
  1208. case BPF_CGROUP_SOCK_OPS:
  1209. ptype = BPF_PROG_TYPE_SOCK_OPS;
  1210. break;
  1211. case BPF_CGROUP_DEVICE:
  1212. ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
  1213. break;
  1214. case BPF_SK_MSG_VERDICT:
  1215. return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, true);
  1216. case BPF_SK_SKB_STREAM_PARSER:
  1217. case BPF_SK_SKB_STREAM_VERDICT:
  1218. return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, true);
  1219. default:
  1220. return -EINVAL;
  1221. }
  1222. prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
  1223. if (IS_ERR(prog))
  1224. return PTR_ERR(prog);
  1225. cgrp = cgroup_get_from_fd(attr->target_fd);
  1226. if (IS_ERR(cgrp)) {
  1227. bpf_prog_put(prog);
  1228. return PTR_ERR(cgrp);
  1229. }
  1230. ret = cgroup_bpf_attach(cgrp, prog, attr->attach_type,
  1231. attr->attach_flags);
  1232. if (ret)
  1233. bpf_prog_put(prog);
  1234. cgroup_put(cgrp);
  1235. return ret;
  1236. }
  1237. #define BPF_PROG_DETACH_LAST_FIELD attach_type
  1238. static int bpf_prog_detach(const union bpf_attr *attr)
  1239. {
  1240. enum bpf_prog_type ptype;
  1241. struct bpf_prog *prog;
  1242. struct cgroup *cgrp;
  1243. int ret;
  1244. if (!capable(CAP_NET_ADMIN))
  1245. return -EPERM;
  1246. if (CHECK_ATTR(BPF_PROG_DETACH))
  1247. return -EINVAL;
  1248. switch (attr->attach_type) {
  1249. case BPF_CGROUP_INET_INGRESS:
  1250. case BPF_CGROUP_INET_EGRESS:
  1251. ptype = BPF_PROG_TYPE_CGROUP_SKB;
  1252. break;
  1253. case BPF_CGROUP_INET_SOCK_CREATE:
  1254. ptype = BPF_PROG_TYPE_CGROUP_SOCK;
  1255. break;
  1256. case BPF_CGROUP_SOCK_OPS:
  1257. ptype = BPF_PROG_TYPE_SOCK_OPS;
  1258. break;
  1259. case BPF_CGROUP_DEVICE:
  1260. ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
  1261. break;
  1262. case BPF_SK_MSG_VERDICT:
  1263. return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, false);
  1264. case BPF_SK_SKB_STREAM_PARSER:
  1265. case BPF_SK_SKB_STREAM_VERDICT:
  1266. return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, false);
  1267. default:
  1268. return -EINVAL;
  1269. }
  1270. cgrp = cgroup_get_from_fd(attr->target_fd);
  1271. if (IS_ERR(cgrp))
  1272. return PTR_ERR(cgrp);
  1273. prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
  1274. if (IS_ERR(prog))
  1275. prog = NULL;
  1276. ret = cgroup_bpf_detach(cgrp, prog, attr->attach_type, 0);
  1277. if (prog)
  1278. bpf_prog_put(prog);
  1279. cgroup_put(cgrp);
  1280. return ret;
  1281. }
  1282. #define BPF_PROG_QUERY_LAST_FIELD query.prog_cnt
  1283. static int bpf_prog_query(const union bpf_attr *attr,
  1284. union bpf_attr __user *uattr)
  1285. {
  1286. struct cgroup *cgrp;
  1287. int ret;
  1288. if (!capable(CAP_NET_ADMIN))
  1289. return -EPERM;
  1290. if (CHECK_ATTR(BPF_PROG_QUERY))
  1291. return -EINVAL;
  1292. if (attr->query.query_flags & ~BPF_F_QUERY_EFFECTIVE)
  1293. return -EINVAL;
  1294. switch (attr->query.attach_type) {
  1295. case BPF_CGROUP_INET_INGRESS:
  1296. case BPF_CGROUP_INET_EGRESS:
  1297. case BPF_CGROUP_INET_SOCK_CREATE:
  1298. case BPF_CGROUP_SOCK_OPS:
  1299. case BPF_CGROUP_DEVICE:
  1300. break;
  1301. default:
  1302. return -EINVAL;
  1303. }
  1304. cgrp = cgroup_get_from_fd(attr->query.target_fd);
  1305. if (IS_ERR(cgrp))
  1306. return PTR_ERR(cgrp);
  1307. ret = cgroup_bpf_query(cgrp, attr, uattr);
  1308. cgroup_put(cgrp);
  1309. return ret;
  1310. }
  1311. #endif /* CONFIG_CGROUP_BPF */
  1312. #define BPF_PROG_TEST_RUN_LAST_FIELD test.duration
  1313. static int bpf_prog_test_run(const union bpf_attr *attr,
  1314. union bpf_attr __user *uattr)
  1315. {
  1316. struct bpf_prog *prog;
  1317. int ret = -ENOTSUPP;
  1318. if (!capable(CAP_SYS_ADMIN))
  1319. return -EPERM;
  1320. if (CHECK_ATTR(BPF_PROG_TEST_RUN))
  1321. return -EINVAL;
  1322. prog = bpf_prog_get(attr->test.prog_fd);
  1323. if (IS_ERR(prog))
  1324. return PTR_ERR(prog);
  1325. if (prog->aux->ops->test_run)
  1326. ret = prog->aux->ops->test_run(prog, attr, uattr);
  1327. bpf_prog_put(prog);
  1328. return ret;
  1329. }
  1330. #define BPF_OBJ_GET_NEXT_ID_LAST_FIELD next_id
  1331. static int bpf_obj_get_next_id(const union bpf_attr *attr,
  1332. union bpf_attr __user *uattr,
  1333. struct idr *idr,
  1334. spinlock_t *lock)
  1335. {
  1336. u32 next_id = attr->start_id;
  1337. int err = 0;
  1338. if (CHECK_ATTR(BPF_OBJ_GET_NEXT_ID) || next_id >= INT_MAX)
  1339. return -EINVAL;
  1340. if (!capable(CAP_SYS_ADMIN))
  1341. return -EPERM;
  1342. next_id++;
  1343. spin_lock_bh(lock);
  1344. if (!idr_get_next(idr, &next_id))
  1345. err = -ENOENT;
  1346. spin_unlock_bh(lock);
  1347. if (!err)
  1348. err = put_user(next_id, &uattr->next_id);
  1349. return err;
  1350. }
  1351. #define BPF_PROG_GET_FD_BY_ID_LAST_FIELD prog_id
  1352. static int bpf_prog_get_fd_by_id(const union bpf_attr *attr)
  1353. {
  1354. struct bpf_prog *prog;
  1355. u32 id = attr->prog_id;
  1356. int fd;
  1357. if (CHECK_ATTR(BPF_PROG_GET_FD_BY_ID))
  1358. return -EINVAL;
  1359. if (!capable(CAP_SYS_ADMIN))
  1360. return -EPERM;
  1361. spin_lock_bh(&prog_idr_lock);
  1362. prog = idr_find(&prog_idr, id);
  1363. if (prog)
  1364. prog = bpf_prog_inc_not_zero(prog);
  1365. else
  1366. prog = ERR_PTR(-ENOENT);
  1367. spin_unlock_bh(&prog_idr_lock);
  1368. if (IS_ERR(prog))
  1369. return PTR_ERR(prog);
  1370. fd = bpf_prog_new_fd(prog);
  1371. if (fd < 0)
  1372. bpf_prog_put(prog);
  1373. return fd;
  1374. }
  1375. #define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
  1376. static int bpf_map_get_fd_by_id(const union bpf_attr *attr)
  1377. {
  1378. struct bpf_map *map;
  1379. u32 id = attr->map_id;
  1380. int f_flags;
  1381. int fd;
  1382. if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
  1383. attr->open_flags & ~BPF_OBJ_FLAG_MASK)
  1384. return -EINVAL;
  1385. if (!capable(CAP_SYS_ADMIN))
  1386. return -EPERM;
  1387. f_flags = bpf_get_file_flag(attr->open_flags);
  1388. if (f_flags < 0)
  1389. return f_flags;
  1390. spin_lock_bh(&map_idr_lock);
  1391. map = idr_find(&map_idr, id);
  1392. if (map)
  1393. map = bpf_map_inc_not_zero(map, true);
  1394. else
  1395. map = ERR_PTR(-ENOENT);
  1396. spin_unlock_bh(&map_idr_lock);
  1397. if (IS_ERR(map))
  1398. return PTR_ERR(map);
  1399. fd = bpf_map_new_fd(map, f_flags);
  1400. if (fd < 0)
  1401. bpf_map_put(map);
  1402. return fd;
  1403. }
  1404. static const struct bpf_map *bpf_map_from_imm(const struct bpf_prog *prog,
  1405. unsigned long addr)
  1406. {
  1407. int i;
  1408. for (i = 0; i < prog->aux->used_map_cnt; i++)
  1409. if (prog->aux->used_maps[i] == (void *)addr)
  1410. return prog->aux->used_maps[i];
  1411. return NULL;
  1412. }
  1413. static struct bpf_insn *bpf_insn_prepare_dump(const struct bpf_prog *prog)
  1414. {
  1415. const struct bpf_map *map;
  1416. struct bpf_insn *insns;
  1417. u64 imm;
  1418. int i;
  1419. insns = kmemdup(prog->insnsi, bpf_prog_insn_size(prog),
  1420. GFP_USER);
  1421. if (!insns)
  1422. return insns;
  1423. for (i = 0; i < prog->len; i++) {
  1424. if (insns[i].code == (BPF_JMP | BPF_TAIL_CALL)) {
  1425. insns[i].code = BPF_JMP | BPF_CALL;
  1426. insns[i].imm = BPF_FUNC_tail_call;
  1427. /* fall-through */
  1428. }
  1429. if (insns[i].code == (BPF_JMP | BPF_CALL) ||
  1430. insns[i].code == (BPF_JMP | BPF_CALL_ARGS)) {
  1431. if (insns[i].code == (BPF_JMP | BPF_CALL_ARGS))
  1432. insns[i].code = BPF_JMP | BPF_CALL;
  1433. if (!bpf_dump_raw_ok())
  1434. insns[i].imm = 0;
  1435. continue;
  1436. }
  1437. if (insns[i].code != (BPF_LD | BPF_IMM | BPF_DW))
  1438. continue;
  1439. imm = ((u64)insns[i + 1].imm << 32) | (u32)insns[i].imm;
  1440. map = bpf_map_from_imm(prog, imm);
  1441. if (map) {
  1442. insns[i].src_reg = BPF_PSEUDO_MAP_FD;
  1443. insns[i].imm = map->id;
  1444. insns[i + 1].imm = 0;
  1445. continue;
  1446. }
  1447. if (!bpf_dump_raw_ok() &&
  1448. imm == (unsigned long)prog->aux) {
  1449. insns[i].imm = 0;
  1450. insns[i + 1].imm = 0;
  1451. continue;
  1452. }
  1453. }
  1454. return insns;
  1455. }
  1456. static int bpf_prog_get_info_by_fd(struct bpf_prog *prog,
  1457. const union bpf_attr *attr,
  1458. union bpf_attr __user *uattr)
  1459. {
  1460. struct bpf_prog_info __user *uinfo = u64_to_user_ptr(attr->info.info);
  1461. struct bpf_prog_info info = {};
  1462. u32 info_len = attr->info.info_len;
  1463. char __user *uinsns;
  1464. u32 ulen;
  1465. int err;
  1466. err = check_uarg_tail_zero(uinfo, sizeof(info), info_len);
  1467. if (err)
  1468. return err;
  1469. info_len = min_t(u32, sizeof(info), info_len);
  1470. if (copy_from_user(&info, uinfo, info_len))
  1471. return -EFAULT;
  1472. info.type = prog->type;
  1473. info.id = prog->aux->id;
  1474. info.load_time = prog->aux->load_time;
  1475. info.created_by_uid = from_kuid_munged(current_user_ns(),
  1476. prog->aux->user->uid);
  1477. memcpy(info.tag, prog->tag, sizeof(prog->tag));
  1478. memcpy(info.name, prog->aux->name, sizeof(prog->aux->name));
  1479. ulen = info.nr_map_ids;
  1480. info.nr_map_ids = prog->aux->used_map_cnt;
  1481. ulen = min_t(u32, info.nr_map_ids, ulen);
  1482. if (ulen) {
  1483. u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
  1484. u32 i;
  1485. for (i = 0; i < ulen; i++)
  1486. if (put_user(prog->aux->used_maps[i]->id,
  1487. &user_map_ids[i]))
  1488. return -EFAULT;
  1489. }
  1490. if (!capable(CAP_SYS_ADMIN)) {
  1491. info.jited_prog_len = 0;
  1492. info.xlated_prog_len = 0;
  1493. goto done;
  1494. }
  1495. ulen = info.xlated_prog_len;
  1496. info.xlated_prog_len = bpf_prog_insn_size(prog);
  1497. if (info.xlated_prog_len && ulen) {
  1498. struct bpf_insn *insns_sanitized;
  1499. bool fault;
  1500. if (prog->blinded && !bpf_dump_raw_ok()) {
  1501. info.xlated_prog_insns = 0;
  1502. goto done;
  1503. }
  1504. insns_sanitized = bpf_insn_prepare_dump(prog);
  1505. if (!insns_sanitized)
  1506. return -ENOMEM;
  1507. uinsns = u64_to_user_ptr(info.xlated_prog_insns);
  1508. ulen = min_t(u32, info.xlated_prog_len, ulen);
  1509. fault = copy_to_user(uinsns, insns_sanitized, ulen);
  1510. kfree(insns_sanitized);
  1511. if (fault)
  1512. return -EFAULT;
  1513. }
  1514. if (bpf_prog_is_dev_bound(prog->aux)) {
  1515. err = bpf_prog_offload_info_fill(&info, prog);
  1516. if (err)
  1517. return err;
  1518. goto done;
  1519. }
  1520. /* NOTE: the following code is supposed to be skipped for offload.
  1521. * bpf_prog_offload_info_fill() is the place to fill similar fields
  1522. * for offload.
  1523. */
  1524. ulen = info.jited_prog_len;
  1525. info.jited_prog_len = prog->jited_len;
  1526. if (info.jited_prog_len && ulen) {
  1527. if (bpf_dump_raw_ok()) {
  1528. uinsns = u64_to_user_ptr(info.jited_prog_insns);
  1529. ulen = min_t(u32, info.jited_prog_len, ulen);
  1530. if (copy_to_user(uinsns, prog->bpf_func, ulen))
  1531. return -EFAULT;
  1532. } else {
  1533. info.jited_prog_insns = 0;
  1534. }
  1535. }
  1536. done:
  1537. if (copy_to_user(uinfo, &info, info_len) ||
  1538. put_user(info_len, &uattr->info.info_len))
  1539. return -EFAULT;
  1540. return 0;
  1541. }
  1542. static int bpf_map_get_info_by_fd(struct bpf_map *map,
  1543. const union bpf_attr *attr,
  1544. union bpf_attr __user *uattr)
  1545. {
  1546. struct bpf_map_info __user *uinfo = u64_to_user_ptr(attr->info.info);
  1547. struct bpf_map_info info = {};
  1548. u32 info_len = attr->info.info_len;
  1549. int err;
  1550. err = check_uarg_tail_zero(uinfo, sizeof(info), info_len);
  1551. if (err)
  1552. return err;
  1553. info_len = min_t(u32, sizeof(info), info_len);
  1554. info.type = map->map_type;
  1555. info.id = map->id;
  1556. info.key_size = map->key_size;
  1557. info.value_size = map->value_size;
  1558. info.max_entries = map->max_entries;
  1559. info.map_flags = map->map_flags;
  1560. memcpy(info.name, map->name, sizeof(map->name));
  1561. if (bpf_map_is_dev_bound(map)) {
  1562. err = bpf_map_offload_info_fill(&info, map);
  1563. if (err)
  1564. return err;
  1565. }
  1566. if (copy_to_user(uinfo, &info, info_len) ||
  1567. put_user(info_len, &uattr->info.info_len))
  1568. return -EFAULT;
  1569. return 0;
  1570. }
  1571. #define BPF_OBJ_GET_INFO_BY_FD_LAST_FIELD info.info
  1572. static int bpf_obj_get_info_by_fd(const union bpf_attr *attr,
  1573. union bpf_attr __user *uattr)
  1574. {
  1575. int ufd = attr->info.bpf_fd;
  1576. struct fd f;
  1577. int err;
  1578. if (CHECK_ATTR(BPF_OBJ_GET_INFO_BY_FD))
  1579. return -EINVAL;
  1580. f = fdget(ufd);
  1581. if (!f.file)
  1582. return -EBADFD;
  1583. if (f.file->f_op == &bpf_prog_fops)
  1584. err = bpf_prog_get_info_by_fd(f.file->private_data, attr,
  1585. uattr);
  1586. else if (f.file->f_op == &bpf_map_fops)
  1587. err = bpf_map_get_info_by_fd(f.file->private_data, attr,
  1588. uattr);
  1589. else
  1590. err = -EINVAL;
  1591. fdput(f);
  1592. return err;
  1593. }
  1594. SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
  1595. {
  1596. union bpf_attr attr = {};
  1597. int err;
  1598. if (sysctl_unprivileged_bpf_disabled && !capable(CAP_SYS_ADMIN))
  1599. return -EPERM;
  1600. err = check_uarg_tail_zero(uattr, sizeof(attr), size);
  1601. if (err)
  1602. return err;
  1603. size = min_t(u32, size, sizeof(attr));
  1604. /* copy attributes from user space, may be less than sizeof(bpf_attr) */
  1605. if (copy_from_user(&attr, uattr, size) != 0)
  1606. return -EFAULT;
  1607. err = security_bpf(cmd, &attr, size);
  1608. if (err < 0)
  1609. return err;
  1610. switch (cmd) {
  1611. case BPF_MAP_CREATE:
  1612. err = map_create(&attr);
  1613. break;
  1614. case BPF_MAP_LOOKUP_ELEM:
  1615. err = map_lookup_elem(&attr);
  1616. break;
  1617. case BPF_MAP_UPDATE_ELEM:
  1618. err = map_update_elem(&attr);
  1619. break;
  1620. case BPF_MAP_DELETE_ELEM:
  1621. err = map_delete_elem(&attr);
  1622. break;
  1623. case BPF_MAP_GET_NEXT_KEY:
  1624. err = map_get_next_key(&attr);
  1625. break;
  1626. case BPF_PROG_LOAD:
  1627. err = bpf_prog_load(&attr);
  1628. break;
  1629. case BPF_OBJ_PIN:
  1630. err = bpf_obj_pin(&attr);
  1631. break;
  1632. case BPF_OBJ_GET:
  1633. err = bpf_obj_get(&attr);
  1634. break;
  1635. #ifdef CONFIG_CGROUP_BPF
  1636. case BPF_PROG_ATTACH:
  1637. err = bpf_prog_attach(&attr);
  1638. break;
  1639. case BPF_PROG_DETACH:
  1640. err = bpf_prog_detach(&attr);
  1641. break;
  1642. case BPF_PROG_QUERY:
  1643. err = bpf_prog_query(&attr, uattr);
  1644. break;
  1645. #endif
  1646. case BPF_PROG_TEST_RUN:
  1647. err = bpf_prog_test_run(&attr, uattr);
  1648. break;
  1649. case BPF_PROG_GET_NEXT_ID:
  1650. err = bpf_obj_get_next_id(&attr, uattr,
  1651. &prog_idr, &prog_idr_lock);
  1652. break;
  1653. case BPF_MAP_GET_NEXT_ID:
  1654. err = bpf_obj_get_next_id(&attr, uattr,
  1655. &map_idr, &map_idr_lock);
  1656. break;
  1657. case BPF_PROG_GET_FD_BY_ID:
  1658. err = bpf_prog_get_fd_by_id(&attr);
  1659. break;
  1660. case BPF_MAP_GET_FD_BY_ID:
  1661. err = bpf_map_get_fd_by_id(&attr);
  1662. break;
  1663. case BPF_OBJ_GET_INFO_BY_FD:
  1664. err = bpf_obj_get_info_by_fd(&attr, uattr);
  1665. break;
  1666. case BPF_RAW_TRACEPOINT_OPEN:
  1667. err = bpf_raw_tracepoint_open(&attr);
  1668. break;
  1669. default:
  1670. err = -EINVAL;
  1671. break;
  1672. }
  1673. return err;
  1674. }