fib.c 41 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669
  1. /*
  2. * Copyright (c) 2018 Cumulus Networks. All rights reserved.
  3. * Copyright (c) 2018 David Ahern <[email protected]>
  4. *
  5. * This software is licensed under the GNU General License Version 2,
  6. * June 1991 as shown in the file COPYING in the top-level directory of this
  7. * source tree.
  8. *
  9. * THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
  10. * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
  11. * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  12. * FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE
  13. * OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME
  14. * THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
  15. */
  16. #include <linux/bitmap.h>
  17. #include <linux/in6.h>
  18. #include <linux/kernel.h>
  19. #include <linux/list.h>
  20. #include <linux/rhashtable.h>
  21. #include <linux/spinlock_types.h>
  22. #include <linux/types.h>
  23. #include <net/fib_notifier.h>
  24. #include <net/inet_dscp.h>
  25. #include <net/ip_fib.h>
  26. #include <net/ip6_fib.h>
  27. #include <net/fib_rules.h>
  28. #include <net/net_namespace.h>
  29. #include <net/nexthop.h>
  30. #include <linux/debugfs.h>
  31. #include "netdevsim.h"
  32. struct nsim_fib_entry {
  33. u64 max;
  34. atomic64_t num;
  35. };
  36. struct nsim_per_fib_data {
  37. struct nsim_fib_entry fib;
  38. struct nsim_fib_entry rules;
  39. };
  40. struct nsim_fib_data {
  41. struct notifier_block fib_nb;
  42. struct nsim_per_fib_data ipv4;
  43. struct nsim_per_fib_data ipv6;
  44. struct nsim_fib_entry nexthops;
  45. struct rhashtable fib_rt_ht;
  46. struct list_head fib_rt_list;
  47. struct mutex fib_lock; /* Protects FIB HT and list */
  48. struct notifier_block nexthop_nb;
  49. struct rhashtable nexthop_ht;
  50. struct devlink *devlink;
  51. struct work_struct fib_event_work;
  52. struct work_struct fib_flush_work;
  53. struct list_head fib_event_queue;
  54. spinlock_t fib_event_queue_lock; /* Protects fib event queue list */
  55. struct mutex nh_lock; /* Protects NH HT */
  56. struct dentry *ddir;
  57. bool fail_route_offload;
  58. bool fail_res_nexthop_group_replace;
  59. bool fail_nexthop_bucket_replace;
  60. bool fail_route_delete;
  61. };
  62. struct nsim_fib_rt_key {
  63. unsigned char addr[sizeof(struct in6_addr)];
  64. unsigned char prefix_len;
  65. int family;
  66. u32 tb_id;
  67. };
  68. struct nsim_fib_rt {
  69. struct nsim_fib_rt_key key;
  70. struct rhash_head ht_node;
  71. struct list_head list; /* Member of fib_rt_list */
  72. };
  73. struct nsim_fib4_rt {
  74. struct nsim_fib_rt common;
  75. struct fib_info *fi;
  76. dscp_t dscp;
  77. u8 type;
  78. };
  79. struct nsim_fib6_rt {
  80. struct nsim_fib_rt common;
  81. struct list_head nh_list;
  82. unsigned int nhs;
  83. };
  84. struct nsim_fib6_rt_nh {
  85. struct list_head list; /* Member of nh_list */
  86. struct fib6_info *rt;
  87. };
  88. struct nsim_fib6_event {
  89. struct fib6_info **rt_arr;
  90. unsigned int nrt6;
  91. };
  92. struct nsim_fib_event {
  93. struct list_head list; /* node in fib queue */
  94. union {
  95. struct fib_entry_notifier_info fen_info;
  96. struct nsim_fib6_event fib6_event;
  97. };
  98. struct nsim_fib_data *data;
  99. unsigned long event;
  100. int family;
  101. };
  102. static const struct rhashtable_params nsim_fib_rt_ht_params = {
  103. .key_offset = offsetof(struct nsim_fib_rt, key),
  104. .head_offset = offsetof(struct nsim_fib_rt, ht_node),
  105. .key_len = sizeof(struct nsim_fib_rt_key),
  106. .automatic_shrinking = true,
  107. };
  108. struct nsim_nexthop {
  109. struct rhash_head ht_node;
  110. u64 occ;
  111. u32 id;
  112. bool is_resilient;
  113. };
  114. static const struct rhashtable_params nsim_nexthop_ht_params = {
  115. .key_offset = offsetof(struct nsim_nexthop, id),
  116. .head_offset = offsetof(struct nsim_nexthop, ht_node),
  117. .key_len = sizeof(u32),
  118. .automatic_shrinking = true,
  119. };
  120. u64 nsim_fib_get_val(struct nsim_fib_data *fib_data,
  121. enum nsim_resource_id res_id, bool max)
  122. {
  123. struct nsim_fib_entry *entry;
  124. switch (res_id) {
  125. case NSIM_RESOURCE_IPV4_FIB:
  126. entry = &fib_data->ipv4.fib;
  127. break;
  128. case NSIM_RESOURCE_IPV4_FIB_RULES:
  129. entry = &fib_data->ipv4.rules;
  130. break;
  131. case NSIM_RESOURCE_IPV6_FIB:
  132. entry = &fib_data->ipv6.fib;
  133. break;
  134. case NSIM_RESOURCE_IPV6_FIB_RULES:
  135. entry = &fib_data->ipv6.rules;
  136. break;
  137. case NSIM_RESOURCE_NEXTHOPS:
  138. entry = &fib_data->nexthops;
  139. break;
  140. default:
  141. return 0;
  142. }
  143. return max ? entry->max : atomic64_read(&entry->num);
  144. }
  145. static void nsim_fib_set_max(struct nsim_fib_data *fib_data,
  146. enum nsim_resource_id res_id, u64 val)
  147. {
  148. struct nsim_fib_entry *entry;
  149. switch (res_id) {
  150. case NSIM_RESOURCE_IPV4_FIB:
  151. entry = &fib_data->ipv4.fib;
  152. break;
  153. case NSIM_RESOURCE_IPV4_FIB_RULES:
  154. entry = &fib_data->ipv4.rules;
  155. break;
  156. case NSIM_RESOURCE_IPV6_FIB:
  157. entry = &fib_data->ipv6.fib;
  158. break;
  159. case NSIM_RESOURCE_IPV6_FIB_RULES:
  160. entry = &fib_data->ipv6.rules;
  161. break;
  162. case NSIM_RESOURCE_NEXTHOPS:
  163. entry = &fib_data->nexthops;
  164. break;
  165. default:
  166. WARN_ON(1);
  167. return;
  168. }
  169. entry->max = val;
  170. }
  171. static int nsim_fib_rule_account(struct nsim_fib_entry *entry, bool add,
  172. struct netlink_ext_ack *extack)
  173. {
  174. int err = 0;
  175. if (add) {
  176. if (!atomic64_add_unless(&entry->num, 1, entry->max)) {
  177. err = -ENOSPC;
  178. NL_SET_ERR_MSG_MOD(extack, "Exceeded number of supported fib rule entries");
  179. }
  180. } else {
  181. atomic64_dec_if_positive(&entry->num);
  182. }
  183. return err;
  184. }
  185. static int nsim_fib_rule_event(struct nsim_fib_data *data,
  186. struct fib_notifier_info *info, bool add)
  187. {
  188. struct netlink_ext_ack *extack = info->extack;
  189. int err = 0;
  190. switch (info->family) {
  191. case AF_INET:
  192. err = nsim_fib_rule_account(&data->ipv4.rules, add, extack);
  193. break;
  194. case AF_INET6:
  195. err = nsim_fib_rule_account(&data->ipv6.rules, add, extack);
  196. break;
  197. }
  198. return err;
  199. }
  200. static int nsim_fib_account(struct nsim_fib_entry *entry, bool add)
  201. {
  202. int err = 0;
  203. if (add) {
  204. if (!atomic64_add_unless(&entry->num, 1, entry->max))
  205. err = -ENOSPC;
  206. } else {
  207. atomic64_dec_if_positive(&entry->num);
  208. }
  209. return err;
  210. }
  211. static void nsim_fib_rt_init(struct nsim_fib_data *data,
  212. struct nsim_fib_rt *fib_rt, const void *addr,
  213. size_t addr_len, unsigned int prefix_len,
  214. int family, u32 tb_id)
  215. {
  216. memcpy(fib_rt->key.addr, addr, addr_len);
  217. fib_rt->key.prefix_len = prefix_len;
  218. fib_rt->key.family = family;
  219. fib_rt->key.tb_id = tb_id;
  220. list_add(&fib_rt->list, &data->fib_rt_list);
  221. }
  222. static void nsim_fib_rt_fini(struct nsim_fib_rt *fib_rt)
  223. {
  224. list_del(&fib_rt->list);
  225. }
  226. static struct nsim_fib_rt *nsim_fib_rt_lookup(struct rhashtable *fib_rt_ht,
  227. const void *addr, size_t addr_len,
  228. unsigned int prefix_len,
  229. int family, u32 tb_id)
  230. {
  231. struct nsim_fib_rt_key key;
  232. memset(&key, 0, sizeof(key));
  233. memcpy(key.addr, addr, addr_len);
  234. key.prefix_len = prefix_len;
  235. key.family = family;
  236. key.tb_id = tb_id;
  237. return rhashtable_lookup_fast(fib_rt_ht, &key, nsim_fib_rt_ht_params);
  238. }
  239. static struct nsim_fib4_rt *
  240. nsim_fib4_rt_create(struct nsim_fib_data *data,
  241. struct fib_entry_notifier_info *fen_info)
  242. {
  243. struct nsim_fib4_rt *fib4_rt;
  244. fib4_rt = kzalloc(sizeof(*fib4_rt), GFP_KERNEL);
  245. if (!fib4_rt)
  246. return NULL;
  247. nsim_fib_rt_init(data, &fib4_rt->common, &fen_info->dst, sizeof(u32),
  248. fen_info->dst_len, AF_INET, fen_info->tb_id);
  249. fib4_rt->fi = fen_info->fi;
  250. fib_info_hold(fib4_rt->fi);
  251. fib4_rt->dscp = fen_info->dscp;
  252. fib4_rt->type = fen_info->type;
  253. return fib4_rt;
  254. }
  255. static void nsim_fib4_rt_destroy(struct nsim_fib4_rt *fib4_rt)
  256. {
  257. fib_info_put(fib4_rt->fi);
  258. nsim_fib_rt_fini(&fib4_rt->common);
  259. kfree(fib4_rt);
  260. }
  261. static struct nsim_fib4_rt *
  262. nsim_fib4_rt_lookup(struct rhashtable *fib_rt_ht,
  263. const struct fib_entry_notifier_info *fen_info)
  264. {
  265. struct nsim_fib_rt *fib_rt;
  266. fib_rt = nsim_fib_rt_lookup(fib_rt_ht, &fen_info->dst, sizeof(u32),
  267. fen_info->dst_len, AF_INET,
  268. fen_info->tb_id);
  269. if (!fib_rt)
  270. return NULL;
  271. return container_of(fib_rt, struct nsim_fib4_rt, common);
  272. }
  273. static void
  274. nsim_fib4_rt_offload_failed_flag_set(struct net *net,
  275. struct fib_entry_notifier_info *fen_info)
  276. {
  277. u32 *p_dst = (u32 *)&fen_info->dst;
  278. struct fib_rt_info fri;
  279. fri.fi = fen_info->fi;
  280. fri.tb_id = fen_info->tb_id;
  281. fri.dst = cpu_to_be32(*p_dst);
  282. fri.dst_len = fen_info->dst_len;
  283. fri.dscp = fen_info->dscp;
  284. fri.type = fen_info->type;
  285. fri.offload = false;
  286. fri.trap = false;
  287. fri.offload_failed = true;
  288. fib_alias_hw_flags_set(net, &fri);
  289. }
  290. static void nsim_fib4_rt_hw_flags_set(struct net *net,
  291. const struct nsim_fib4_rt *fib4_rt,
  292. bool trap)
  293. {
  294. u32 *p_dst = (u32 *) fib4_rt->common.key.addr;
  295. int dst_len = fib4_rt->common.key.prefix_len;
  296. struct fib_rt_info fri;
  297. fri.fi = fib4_rt->fi;
  298. fri.tb_id = fib4_rt->common.key.tb_id;
  299. fri.dst = cpu_to_be32(*p_dst);
  300. fri.dst_len = dst_len;
  301. fri.dscp = fib4_rt->dscp;
  302. fri.type = fib4_rt->type;
  303. fri.offload = false;
  304. fri.trap = trap;
  305. fri.offload_failed = false;
  306. fib_alias_hw_flags_set(net, &fri);
  307. }
  308. static int nsim_fib4_rt_add(struct nsim_fib_data *data,
  309. struct nsim_fib4_rt *fib4_rt)
  310. {
  311. struct net *net = devlink_net(data->devlink);
  312. int err;
  313. err = rhashtable_insert_fast(&data->fib_rt_ht,
  314. &fib4_rt->common.ht_node,
  315. nsim_fib_rt_ht_params);
  316. if (err)
  317. goto err_fib_dismiss;
  318. /* Simulate hardware programming latency. */
  319. msleep(1);
  320. nsim_fib4_rt_hw_flags_set(net, fib4_rt, true);
  321. return 0;
  322. err_fib_dismiss:
  323. /* Drop the accounting that was increased from the notification
  324. * context when FIB_EVENT_ENTRY_REPLACE was triggered.
  325. */
  326. nsim_fib_account(&data->ipv4.fib, false);
  327. return err;
  328. }
  329. static int nsim_fib4_rt_replace(struct nsim_fib_data *data,
  330. struct nsim_fib4_rt *fib4_rt,
  331. struct nsim_fib4_rt *fib4_rt_old)
  332. {
  333. struct net *net = devlink_net(data->devlink);
  334. int err;
  335. /* We are replacing a route, so need to remove the accounting which
  336. * was increased when FIB_EVENT_ENTRY_REPLACE was triggered.
  337. */
  338. err = nsim_fib_account(&data->ipv4.fib, false);
  339. if (err)
  340. return err;
  341. err = rhashtable_replace_fast(&data->fib_rt_ht,
  342. &fib4_rt_old->common.ht_node,
  343. &fib4_rt->common.ht_node,
  344. nsim_fib_rt_ht_params);
  345. if (err)
  346. return err;
  347. msleep(1);
  348. nsim_fib4_rt_hw_flags_set(net, fib4_rt, true);
  349. nsim_fib4_rt_hw_flags_set(net, fib4_rt_old, false);
  350. nsim_fib4_rt_destroy(fib4_rt_old);
  351. return 0;
  352. }
  353. static int nsim_fib4_rt_insert(struct nsim_fib_data *data,
  354. struct fib_entry_notifier_info *fen_info)
  355. {
  356. struct nsim_fib4_rt *fib4_rt, *fib4_rt_old;
  357. int err;
  358. if (data->fail_route_offload) {
  359. /* For testing purposes, user set debugfs fail_route_offload
  360. * value to true. Simulate hardware programming latency and then
  361. * fail.
  362. */
  363. msleep(1);
  364. return -EINVAL;
  365. }
  366. fib4_rt = nsim_fib4_rt_create(data, fen_info);
  367. if (!fib4_rt)
  368. return -ENOMEM;
  369. fib4_rt_old = nsim_fib4_rt_lookup(&data->fib_rt_ht, fen_info);
  370. if (!fib4_rt_old)
  371. err = nsim_fib4_rt_add(data, fib4_rt);
  372. else
  373. err = nsim_fib4_rt_replace(data, fib4_rt, fib4_rt_old);
  374. if (err)
  375. nsim_fib4_rt_destroy(fib4_rt);
  376. return err;
  377. }
  378. static void nsim_fib4_rt_remove(struct nsim_fib_data *data,
  379. const struct fib_entry_notifier_info *fen_info)
  380. {
  381. struct nsim_fib4_rt *fib4_rt;
  382. fib4_rt = nsim_fib4_rt_lookup(&data->fib_rt_ht, fen_info);
  383. if (!fib4_rt)
  384. return;
  385. rhashtable_remove_fast(&data->fib_rt_ht, &fib4_rt->common.ht_node,
  386. nsim_fib_rt_ht_params);
  387. nsim_fib4_rt_destroy(fib4_rt);
  388. }
  389. static int nsim_fib4_event(struct nsim_fib_data *data,
  390. struct fib_entry_notifier_info *fen_info,
  391. unsigned long event)
  392. {
  393. int err = 0;
  394. switch (event) {
  395. case FIB_EVENT_ENTRY_REPLACE:
  396. err = nsim_fib4_rt_insert(data, fen_info);
  397. if (err) {
  398. struct net *net = devlink_net(data->devlink);
  399. nsim_fib4_rt_offload_failed_flag_set(net, fen_info);
  400. }
  401. break;
  402. case FIB_EVENT_ENTRY_DEL:
  403. nsim_fib4_rt_remove(data, fen_info);
  404. break;
  405. default:
  406. break;
  407. }
  408. return err;
  409. }
  410. static struct nsim_fib6_rt_nh *
  411. nsim_fib6_rt_nh_find(const struct nsim_fib6_rt *fib6_rt,
  412. const struct fib6_info *rt)
  413. {
  414. struct nsim_fib6_rt_nh *fib6_rt_nh;
  415. list_for_each_entry(fib6_rt_nh, &fib6_rt->nh_list, list) {
  416. if (fib6_rt_nh->rt == rt)
  417. return fib6_rt_nh;
  418. }
  419. return NULL;
  420. }
  421. static int nsim_fib6_rt_nh_add(struct nsim_fib6_rt *fib6_rt,
  422. struct fib6_info *rt)
  423. {
  424. struct nsim_fib6_rt_nh *fib6_rt_nh;
  425. fib6_rt_nh = kzalloc(sizeof(*fib6_rt_nh), GFP_KERNEL);
  426. if (!fib6_rt_nh)
  427. return -ENOMEM;
  428. fib6_info_hold(rt);
  429. fib6_rt_nh->rt = rt;
  430. list_add_tail(&fib6_rt_nh->list, &fib6_rt->nh_list);
  431. fib6_rt->nhs++;
  432. return 0;
  433. }
  434. #if IS_ENABLED(CONFIG_IPV6)
  435. static void nsim_rt6_release(struct fib6_info *rt)
  436. {
  437. fib6_info_release(rt);
  438. }
  439. #else
  440. static void nsim_rt6_release(struct fib6_info *rt)
  441. {
  442. }
  443. #endif
  444. static void nsim_fib6_rt_nh_del(struct nsim_fib6_rt *fib6_rt,
  445. const struct fib6_info *rt)
  446. {
  447. struct nsim_fib6_rt_nh *fib6_rt_nh;
  448. fib6_rt_nh = nsim_fib6_rt_nh_find(fib6_rt, rt);
  449. if (!fib6_rt_nh)
  450. return;
  451. fib6_rt->nhs--;
  452. list_del(&fib6_rt_nh->list);
  453. nsim_rt6_release(fib6_rt_nh->rt);
  454. kfree(fib6_rt_nh);
  455. }
  456. static struct nsim_fib6_rt *
  457. nsim_fib6_rt_create(struct nsim_fib_data *data,
  458. struct fib6_info **rt_arr, unsigned int nrt6)
  459. {
  460. struct fib6_info *rt = rt_arr[0];
  461. struct nsim_fib6_rt *fib6_rt;
  462. int i = 0;
  463. int err;
  464. fib6_rt = kzalloc(sizeof(*fib6_rt), GFP_KERNEL);
  465. if (!fib6_rt)
  466. return ERR_PTR(-ENOMEM);
  467. nsim_fib_rt_init(data, &fib6_rt->common, &rt->fib6_dst.addr,
  468. sizeof(rt->fib6_dst.addr), rt->fib6_dst.plen, AF_INET6,
  469. rt->fib6_table->tb6_id);
  470. /* We consider a multipath IPv6 route as one entry, but it can be made
  471. * up from several fib6_info structs (one for each nexthop), so we
  472. * add them all to the same list under the entry.
  473. */
  474. INIT_LIST_HEAD(&fib6_rt->nh_list);
  475. for (i = 0; i < nrt6; i++) {
  476. err = nsim_fib6_rt_nh_add(fib6_rt, rt_arr[i]);
  477. if (err)
  478. goto err_fib6_rt_nh_del;
  479. }
  480. return fib6_rt;
  481. err_fib6_rt_nh_del:
  482. for (i--; i >= 0; i--) {
  483. nsim_fib6_rt_nh_del(fib6_rt, rt_arr[i]);
  484. }
  485. nsim_fib_rt_fini(&fib6_rt->common);
  486. kfree(fib6_rt);
  487. return ERR_PTR(err);
  488. }
  489. static void nsim_fib6_rt_destroy(struct nsim_fib6_rt *fib6_rt)
  490. {
  491. struct nsim_fib6_rt_nh *iter, *tmp;
  492. list_for_each_entry_safe(iter, tmp, &fib6_rt->nh_list, list)
  493. nsim_fib6_rt_nh_del(fib6_rt, iter->rt);
  494. WARN_ON_ONCE(!list_empty(&fib6_rt->nh_list));
  495. nsim_fib_rt_fini(&fib6_rt->common);
  496. kfree(fib6_rt);
  497. }
  498. static struct nsim_fib6_rt *
  499. nsim_fib6_rt_lookup(struct rhashtable *fib_rt_ht, const struct fib6_info *rt)
  500. {
  501. struct nsim_fib_rt *fib_rt;
  502. fib_rt = nsim_fib_rt_lookup(fib_rt_ht, &rt->fib6_dst.addr,
  503. sizeof(rt->fib6_dst.addr),
  504. rt->fib6_dst.plen, AF_INET6,
  505. rt->fib6_table->tb6_id);
  506. if (!fib_rt)
  507. return NULL;
  508. return container_of(fib_rt, struct nsim_fib6_rt, common);
  509. }
  510. static int nsim_fib6_rt_append(struct nsim_fib_data *data,
  511. struct nsim_fib6_event *fib6_event)
  512. {
  513. struct fib6_info *rt = fib6_event->rt_arr[0];
  514. struct nsim_fib6_rt *fib6_rt;
  515. int i, err;
  516. if (data->fail_route_offload) {
  517. /* For testing purposes, user set debugfs fail_route_offload
  518. * value to true. Simulate hardware programming latency and then
  519. * fail.
  520. */
  521. msleep(1);
  522. return -EINVAL;
  523. }
  524. fib6_rt = nsim_fib6_rt_lookup(&data->fib_rt_ht, rt);
  525. if (!fib6_rt)
  526. return -EINVAL;
  527. for (i = 0; i < fib6_event->nrt6; i++) {
  528. err = nsim_fib6_rt_nh_add(fib6_rt, fib6_event->rt_arr[i]);
  529. if (err)
  530. goto err_fib6_rt_nh_del;
  531. WRITE_ONCE(fib6_event->rt_arr[i]->trap, true);
  532. }
  533. return 0;
  534. err_fib6_rt_nh_del:
  535. for (i--; i >= 0; i--) {
  536. WRITE_ONCE(fib6_event->rt_arr[i]->trap, false);
  537. nsim_fib6_rt_nh_del(fib6_rt, fib6_event->rt_arr[i]);
  538. }
  539. return err;
  540. }
  541. #if IS_ENABLED(CONFIG_IPV6)
  542. static void nsim_fib6_rt_offload_failed_flag_set(struct nsim_fib_data *data,
  543. struct fib6_info **rt_arr,
  544. unsigned int nrt6)
  545. {
  546. struct net *net = devlink_net(data->devlink);
  547. int i;
  548. for (i = 0; i < nrt6; i++)
  549. fib6_info_hw_flags_set(net, rt_arr[i], false, false, true);
  550. }
  551. #else
  552. static void nsim_fib6_rt_offload_failed_flag_set(struct nsim_fib_data *data,
  553. struct fib6_info **rt_arr,
  554. unsigned int nrt6)
  555. {
  556. }
  557. #endif
  558. #if IS_ENABLED(CONFIG_IPV6)
  559. static void nsim_fib6_rt_hw_flags_set(struct nsim_fib_data *data,
  560. const struct nsim_fib6_rt *fib6_rt,
  561. bool trap)
  562. {
  563. struct net *net = devlink_net(data->devlink);
  564. struct nsim_fib6_rt_nh *fib6_rt_nh;
  565. list_for_each_entry(fib6_rt_nh, &fib6_rt->nh_list, list)
  566. fib6_info_hw_flags_set(net, fib6_rt_nh->rt, false, trap, false);
  567. }
  568. #else
  569. static void nsim_fib6_rt_hw_flags_set(struct nsim_fib_data *data,
  570. const struct nsim_fib6_rt *fib6_rt,
  571. bool trap)
  572. {
  573. }
  574. #endif
  575. static int nsim_fib6_rt_add(struct nsim_fib_data *data,
  576. struct nsim_fib6_rt *fib6_rt)
  577. {
  578. int err;
  579. err = rhashtable_insert_fast(&data->fib_rt_ht,
  580. &fib6_rt->common.ht_node,
  581. nsim_fib_rt_ht_params);
  582. if (err)
  583. goto err_fib_dismiss;
  584. msleep(1);
  585. nsim_fib6_rt_hw_flags_set(data, fib6_rt, true);
  586. return 0;
  587. err_fib_dismiss:
  588. /* Drop the accounting that was increased from the notification
  589. * context when FIB_EVENT_ENTRY_REPLACE was triggered.
  590. */
  591. nsim_fib_account(&data->ipv6.fib, false);
  592. return err;
  593. }
  594. static int nsim_fib6_rt_replace(struct nsim_fib_data *data,
  595. struct nsim_fib6_rt *fib6_rt,
  596. struct nsim_fib6_rt *fib6_rt_old)
  597. {
  598. int err;
  599. /* We are replacing a route, so need to remove the accounting which
  600. * was increased when FIB_EVENT_ENTRY_REPLACE was triggered.
  601. */
  602. err = nsim_fib_account(&data->ipv6.fib, false);
  603. if (err)
  604. return err;
  605. err = rhashtable_replace_fast(&data->fib_rt_ht,
  606. &fib6_rt_old->common.ht_node,
  607. &fib6_rt->common.ht_node,
  608. nsim_fib_rt_ht_params);
  609. if (err)
  610. return err;
  611. msleep(1);
  612. nsim_fib6_rt_hw_flags_set(data, fib6_rt, true);
  613. nsim_fib6_rt_hw_flags_set(data, fib6_rt_old, false);
  614. nsim_fib6_rt_destroy(fib6_rt_old);
  615. return 0;
  616. }
  617. static int nsim_fib6_rt_insert(struct nsim_fib_data *data,
  618. struct nsim_fib6_event *fib6_event)
  619. {
  620. struct fib6_info *rt = fib6_event->rt_arr[0];
  621. struct nsim_fib6_rt *fib6_rt, *fib6_rt_old;
  622. int err;
  623. if (data->fail_route_offload) {
  624. /* For testing purposes, user set debugfs fail_route_offload
  625. * value to true. Simulate hardware programming latency and then
  626. * fail.
  627. */
  628. msleep(1);
  629. return -EINVAL;
  630. }
  631. fib6_rt = nsim_fib6_rt_create(data, fib6_event->rt_arr,
  632. fib6_event->nrt6);
  633. if (IS_ERR(fib6_rt))
  634. return PTR_ERR(fib6_rt);
  635. fib6_rt_old = nsim_fib6_rt_lookup(&data->fib_rt_ht, rt);
  636. if (!fib6_rt_old)
  637. err = nsim_fib6_rt_add(data, fib6_rt);
  638. else
  639. err = nsim_fib6_rt_replace(data, fib6_rt, fib6_rt_old);
  640. if (err)
  641. nsim_fib6_rt_destroy(fib6_rt);
  642. return err;
  643. }
  644. static void nsim_fib6_rt_remove(struct nsim_fib_data *data,
  645. struct nsim_fib6_event *fib6_event)
  646. {
  647. struct fib6_info *rt = fib6_event->rt_arr[0];
  648. struct nsim_fib6_rt *fib6_rt;
  649. int i;
  650. /* Multipath routes are first added to the FIB trie and only then
  651. * notified. If we vetoed the addition, we will get a delete
  652. * notification for a route we do not have. Therefore, do not warn if
  653. * route was not found.
  654. */
  655. fib6_rt = nsim_fib6_rt_lookup(&data->fib_rt_ht, rt);
  656. if (!fib6_rt)
  657. return;
  658. /* If not all the nexthops are deleted, then only reduce the nexthop
  659. * group.
  660. */
  661. if (fib6_event->nrt6 != fib6_rt->nhs) {
  662. for (i = 0; i < fib6_event->nrt6; i++)
  663. nsim_fib6_rt_nh_del(fib6_rt, fib6_event->rt_arr[i]);
  664. return;
  665. }
  666. rhashtable_remove_fast(&data->fib_rt_ht, &fib6_rt->common.ht_node,
  667. nsim_fib_rt_ht_params);
  668. nsim_fib6_rt_destroy(fib6_rt);
  669. }
  670. static int nsim_fib6_event_init(struct nsim_fib6_event *fib6_event,
  671. struct fib6_entry_notifier_info *fen6_info)
  672. {
  673. struct fib6_info *rt = fen6_info->rt;
  674. struct fib6_info **rt_arr;
  675. struct fib6_info *iter;
  676. unsigned int nrt6;
  677. int i = 0;
  678. nrt6 = fen6_info->nsiblings + 1;
  679. rt_arr = kcalloc(nrt6, sizeof(struct fib6_info *), GFP_ATOMIC);
  680. if (!rt_arr)
  681. return -ENOMEM;
  682. fib6_event->rt_arr = rt_arr;
  683. fib6_event->nrt6 = nrt6;
  684. rt_arr[0] = rt;
  685. fib6_info_hold(rt);
  686. if (!fen6_info->nsiblings)
  687. return 0;
  688. list_for_each_entry(iter, &rt->fib6_siblings, fib6_siblings) {
  689. if (i == fen6_info->nsiblings)
  690. break;
  691. rt_arr[i + 1] = iter;
  692. fib6_info_hold(iter);
  693. i++;
  694. }
  695. WARN_ON_ONCE(i != fen6_info->nsiblings);
  696. return 0;
  697. }
  698. static void nsim_fib6_event_fini(struct nsim_fib6_event *fib6_event)
  699. {
  700. int i;
  701. for (i = 0; i < fib6_event->nrt6; i++)
  702. nsim_rt6_release(fib6_event->rt_arr[i]);
  703. kfree(fib6_event->rt_arr);
  704. }
  705. static int nsim_fib6_event(struct nsim_fib_data *data,
  706. struct nsim_fib6_event *fib6_event,
  707. unsigned long event)
  708. {
  709. int err;
  710. if (fib6_event->rt_arr[0]->fib6_src.plen)
  711. return 0;
  712. switch (event) {
  713. case FIB_EVENT_ENTRY_REPLACE:
  714. err = nsim_fib6_rt_insert(data, fib6_event);
  715. if (err)
  716. goto err_rt_offload_failed_flag_set;
  717. break;
  718. case FIB_EVENT_ENTRY_APPEND:
  719. err = nsim_fib6_rt_append(data, fib6_event);
  720. if (err)
  721. goto err_rt_offload_failed_flag_set;
  722. break;
  723. case FIB_EVENT_ENTRY_DEL:
  724. nsim_fib6_rt_remove(data, fib6_event);
  725. break;
  726. default:
  727. break;
  728. }
  729. return 0;
  730. err_rt_offload_failed_flag_set:
  731. nsim_fib6_rt_offload_failed_flag_set(data, fib6_event->rt_arr,
  732. fib6_event->nrt6);
  733. return err;
  734. }
  735. static void nsim_fib_event(struct nsim_fib_event *fib_event)
  736. {
  737. switch (fib_event->family) {
  738. case AF_INET:
  739. nsim_fib4_event(fib_event->data, &fib_event->fen_info,
  740. fib_event->event);
  741. fib_info_put(fib_event->fen_info.fi);
  742. break;
  743. case AF_INET6:
  744. nsim_fib6_event(fib_event->data, &fib_event->fib6_event,
  745. fib_event->event);
  746. nsim_fib6_event_fini(&fib_event->fib6_event);
  747. break;
  748. }
  749. }
  750. static int nsim_fib4_prepare_event(struct fib_notifier_info *info,
  751. struct nsim_fib_event *fib_event,
  752. unsigned long event)
  753. {
  754. struct nsim_fib_data *data = fib_event->data;
  755. struct fib_entry_notifier_info *fen_info;
  756. struct netlink_ext_ack *extack;
  757. int err = 0;
  758. fen_info = container_of(info, struct fib_entry_notifier_info,
  759. info);
  760. fib_event->fen_info = *fen_info;
  761. extack = info->extack;
  762. switch (event) {
  763. case FIB_EVENT_ENTRY_REPLACE:
  764. err = nsim_fib_account(&data->ipv4.fib, true);
  765. if (err) {
  766. NL_SET_ERR_MSG_MOD(extack, "Exceeded number of supported fib entries");
  767. return err;
  768. }
  769. break;
  770. case FIB_EVENT_ENTRY_DEL:
  771. if (data->fail_route_delete) {
  772. NL_SET_ERR_MSG_MOD(extack, "Failed to process route deletion");
  773. return -EINVAL;
  774. }
  775. nsim_fib_account(&data->ipv4.fib, false);
  776. break;
  777. }
  778. /* Take reference on fib_info to prevent it from being
  779. * freed while event is queued. Release it afterwards.
  780. */
  781. fib_info_hold(fib_event->fen_info.fi);
  782. return 0;
  783. }
  784. static int nsim_fib6_prepare_event(struct fib_notifier_info *info,
  785. struct nsim_fib_event *fib_event,
  786. unsigned long event)
  787. {
  788. struct nsim_fib_data *data = fib_event->data;
  789. struct fib6_entry_notifier_info *fen6_info;
  790. struct netlink_ext_ack *extack;
  791. int err = 0;
  792. fen6_info = container_of(info, struct fib6_entry_notifier_info,
  793. info);
  794. err = nsim_fib6_event_init(&fib_event->fib6_event, fen6_info);
  795. if (err)
  796. return err;
  797. extack = info->extack;
  798. switch (event) {
  799. case FIB_EVENT_ENTRY_REPLACE:
  800. err = nsim_fib_account(&data->ipv6.fib, true);
  801. if (err) {
  802. NL_SET_ERR_MSG_MOD(extack, "Exceeded number of supported fib entries");
  803. goto err_fib6_event_fini;
  804. }
  805. break;
  806. case FIB_EVENT_ENTRY_DEL:
  807. if (data->fail_route_delete) {
  808. err = -EINVAL;
  809. NL_SET_ERR_MSG_MOD(extack, "Failed to process route deletion");
  810. goto err_fib6_event_fini;
  811. }
  812. nsim_fib_account(&data->ipv6.fib, false);
  813. break;
  814. }
  815. return 0;
  816. err_fib6_event_fini:
  817. nsim_fib6_event_fini(&fib_event->fib6_event);
  818. return err;
  819. }
  820. static int nsim_fib_event_schedule_work(struct nsim_fib_data *data,
  821. struct fib_notifier_info *info,
  822. unsigned long event)
  823. {
  824. struct nsim_fib_event *fib_event;
  825. int err;
  826. if (info->family != AF_INET && info->family != AF_INET6)
  827. /* netdevsim does not support 'RTNL_FAMILY_IP6MR' and
  828. * 'RTNL_FAMILY_IPMR' and should ignore them.
  829. */
  830. return NOTIFY_DONE;
  831. fib_event = kzalloc(sizeof(*fib_event), GFP_ATOMIC);
  832. if (!fib_event)
  833. goto err_fib_event_alloc;
  834. fib_event->data = data;
  835. fib_event->event = event;
  836. fib_event->family = info->family;
  837. switch (info->family) {
  838. case AF_INET:
  839. err = nsim_fib4_prepare_event(info, fib_event, event);
  840. break;
  841. case AF_INET6:
  842. err = nsim_fib6_prepare_event(info, fib_event, event);
  843. break;
  844. }
  845. if (err)
  846. goto err_fib_prepare_event;
  847. /* Enqueue the event and trigger the work */
  848. spin_lock_bh(&data->fib_event_queue_lock);
  849. list_add_tail(&fib_event->list, &data->fib_event_queue);
  850. spin_unlock_bh(&data->fib_event_queue_lock);
  851. schedule_work(&data->fib_event_work);
  852. return NOTIFY_DONE;
  853. err_fib_prepare_event:
  854. kfree(fib_event);
  855. err_fib_event_alloc:
  856. if (event == FIB_EVENT_ENTRY_DEL)
  857. schedule_work(&data->fib_flush_work);
  858. return NOTIFY_BAD;
  859. }
  860. static int nsim_fib_event_nb(struct notifier_block *nb, unsigned long event,
  861. void *ptr)
  862. {
  863. struct nsim_fib_data *data = container_of(nb, struct nsim_fib_data,
  864. fib_nb);
  865. struct fib_notifier_info *info = ptr;
  866. int err;
  867. switch (event) {
  868. case FIB_EVENT_RULE_ADD:
  869. case FIB_EVENT_RULE_DEL:
  870. err = nsim_fib_rule_event(data, info,
  871. event == FIB_EVENT_RULE_ADD);
  872. return notifier_from_errno(err);
  873. case FIB_EVENT_ENTRY_REPLACE:
  874. case FIB_EVENT_ENTRY_APPEND:
  875. case FIB_EVENT_ENTRY_DEL:
  876. return nsim_fib_event_schedule_work(data, info, event);
  877. }
  878. return NOTIFY_DONE;
  879. }
  880. static void nsim_fib4_rt_free(struct nsim_fib_rt *fib_rt,
  881. struct nsim_fib_data *data)
  882. {
  883. struct devlink *devlink = data->devlink;
  884. struct nsim_fib4_rt *fib4_rt;
  885. fib4_rt = container_of(fib_rt, struct nsim_fib4_rt, common);
  886. nsim_fib4_rt_hw_flags_set(devlink_net(devlink), fib4_rt, false);
  887. nsim_fib_account(&data->ipv4.fib, false);
  888. nsim_fib4_rt_destroy(fib4_rt);
  889. }
  890. static void nsim_fib6_rt_free(struct nsim_fib_rt *fib_rt,
  891. struct nsim_fib_data *data)
  892. {
  893. struct nsim_fib6_rt *fib6_rt;
  894. fib6_rt = container_of(fib_rt, struct nsim_fib6_rt, common);
  895. nsim_fib6_rt_hw_flags_set(data, fib6_rt, false);
  896. nsim_fib_account(&data->ipv6.fib, false);
  897. nsim_fib6_rt_destroy(fib6_rt);
  898. }
  899. static void nsim_fib_rt_free(void *ptr, void *arg)
  900. {
  901. struct nsim_fib_rt *fib_rt = ptr;
  902. struct nsim_fib_data *data = arg;
  903. switch (fib_rt->key.family) {
  904. case AF_INET:
  905. nsim_fib4_rt_free(fib_rt, data);
  906. break;
  907. case AF_INET6:
  908. nsim_fib6_rt_free(fib_rt, data);
  909. break;
  910. default:
  911. WARN_ON_ONCE(1);
  912. }
  913. }
  914. /* inconsistent dump, trying again */
  915. static void nsim_fib_dump_inconsistent(struct notifier_block *nb)
  916. {
  917. struct nsim_fib_data *data = container_of(nb, struct nsim_fib_data,
  918. fib_nb);
  919. struct nsim_fib_rt *fib_rt, *fib_rt_tmp;
  920. /* Flush the work to make sure there is no race with notifications. */
  921. flush_work(&data->fib_event_work);
  922. /* The notifier block is still not registered, so we do not need to
  923. * take any locks here.
  924. */
  925. list_for_each_entry_safe(fib_rt, fib_rt_tmp, &data->fib_rt_list, list) {
  926. rhashtable_remove_fast(&data->fib_rt_ht, &fib_rt->ht_node,
  927. nsim_fib_rt_ht_params);
  928. nsim_fib_rt_free(fib_rt, data);
  929. }
  930. atomic64_set(&data->ipv4.rules.num, 0ULL);
  931. atomic64_set(&data->ipv6.rules.num, 0ULL);
  932. }
  933. static struct nsim_nexthop *nsim_nexthop_create(struct nsim_fib_data *data,
  934. struct nh_notifier_info *info)
  935. {
  936. struct nsim_nexthop *nexthop;
  937. u64 occ = 0;
  938. int i;
  939. nexthop = kzalloc(sizeof(*nexthop), GFP_KERNEL);
  940. if (!nexthop)
  941. return ERR_PTR(-ENOMEM);
  942. nexthop->id = info->id;
  943. /* Determine the number of nexthop entries the new nexthop will
  944. * occupy.
  945. */
  946. switch (info->type) {
  947. case NH_NOTIFIER_INFO_TYPE_SINGLE:
  948. occ = 1;
  949. break;
  950. case NH_NOTIFIER_INFO_TYPE_GRP:
  951. for (i = 0; i < info->nh_grp->num_nh; i++)
  952. occ += info->nh_grp->nh_entries[i].weight;
  953. break;
  954. case NH_NOTIFIER_INFO_TYPE_RES_TABLE:
  955. occ = info->nh_res_table->num_nh_buckets;
  956. nexthop->is_resilient = true;
  957. break;
  958. default:
  959. NL_SET_ERR_MSG_MOD(info->extack, "Unsupported nexthop type");
  960. kfree(nexthop);
  961. return ERR_PTR(-EOPNOTSUPP);
  962. }
  963. nexthop->occ = occ;
  964. return nexthop;
  965. }
  966. static void nsim_nexthop_destroy(struct nsim_nexthop *nexthop)
  967. {
  968. kfree(nexthop);
  969. }
  970. static int nsim_nexthop_account(struct nsim_fib_data *data, u64 occ,
  971. bool add, struct netlink_ext_ack *extack)
  972. {
  973. int i, err = 0;
  974. if (add) {
  975. for (i = 0; i < occ; i++)
  976. if (!atomic64_add_unless(&data->nexthops.num, 1,
  977. data->nexthops.max)) {
  978. err = -ENOSPC;
  979. NL_SET_ERR_MSG_MOD(extack, "Exceeded number of supported nexthops");
  980. goto err_num_decrease;
  981. }
  982. } else {
  983. if (WARN_ON(occ > atomic64_read(&data->nexthops.num)))
  984. return -EINVAL;
  985. atomic64_sub(occ, &data->nexthops.num);
  986. }
  987. return err;
  988. err_num_decrease:
  989. atomic64_sub(i, &data->nexthops.num);
  990. return err;
  991. }
  992. static void nsim_nexthop_hw_flags_set(struct net *net,
  993. const struct nsim_nexthop *nexthop,
  994. bool trap)
  995. {
  996. int i;
  997. nexthop_set_hw_flags(net, nexthop->id, false, trap);
  998. if (!nexthop->is_resilient)
  999. return;
  1000. for (i = 0; i < nexthop->occ; i++)
  1001. nexthop_bucket_set_hw_flags(net, nexthop->id, i, false, trap);
  1002. }
  1003. static int nsim_nexthop_add(struct nsim_fib_data *data,
  1004. struct nsim_nexthop *nexthop,
  1005. struct netlink_ext_ack *extack)
  1006. {
  1007. struct net *net = devlink_net(data->devlink);
  1008. int err;
  1009. err = nsim_nexthop_account(data, nexthop->occ, true, extack);
  1010. if (err)
  1011. return err;
  1012. err = rhashtable_insert_fast(&data->nexthop_ht, &nexthop->ht_node,
  1013. nsim_nexthop_ht_params);
  1014. if (err) {
  1015. NL_SET_ERR_MSG_MOD(extack, "Failed to insert nexthop");
  1016. goto err_nexthop_dismiss;
  1017. }
  1018. nsim_nexthop_hw_flags_set(net, nexthop, true);
  1019. return 0;
  1020. err_nexthop_dismiss:
  1021. nsim_nexthop_account(data, nexthop->occ, false, extack);
  1022. return err;
  1023. }
  1024. static int nsim_nexthop_replace(struct nsim_fib_data *data,
  1025. struct nsim_nexthop *nexthop,
  1026. struct nsim_nexthop *nexthop_old,
  1027. struct netlink_ext_ack *extack)
  1028. {
  1029. struct net *net = devlink_net(data->devlink);
  1030. int err;
  1031. err = nsim_nexthop_account(data, nexthop->occ, true, extack);
  1032. if (err)
  1033. return err;
  1034. err = rhashtable_replace_fast(&data->nexthop_ht,
  1035. &nexthop_old->ht_node, &nexthop->ht_node,
  1036. nsim_nexthop_ht_params);
  1037. if (err) {
  1038. NL_SET_ERR_MSG_MOD(extack, "Failed to replace nexthop");
  1039. goto err_nexthop_dismiss;
  1040. }
  1041. nsim_nexthop_hw_flags_set(net, nexthop, true);
  1042. nsim_nexthop_account(data, nexthop_old->occ, false, extack);
  1043. nsim_nexthop_destroy(nexthop_old);
  1044. return 0;
  1045. err_nexthop_dismiss:
  1046. nsim_nexthop_account(data, nexthop->occ, false, extack);
  1047. return err;
  1048. }
  1049. static int nsim_nexthop_insert(struct nsim_fib_data *data,
  1050. struct nh_notifier_info *info)
  1051. {
  1052. struct nsim_nexthop *nexthop, *nexthop_old;
  1053. int err;
  1054. nexthop = nsim_nexthop_create(data, info);
  1055. if (IS_ERR(nexthop))
  1056. return PTR_ERR(nexthop);
  1057. nexthop_old = rhashtable_lookup_fast(&data->nexthop_ht, &info->id,
  1058. nsim_nexthop_ht_params);
  1059. if (!nexthop_old)
  1060. err = nsim_nexthop_add(data, nexthop, info->extack);
  1061. else
  1062. err = nsim_nexthop_replace(data, nexthop, nexthop_old,
  1063. info->extack);
  1064. if (err)
  1065. nsim_nexthop_destroy(nexthop);
  1066. return err;
  1067. }
  1068. static void nsim_nexthop_remove(struct nsim_fib_data *data,
  1069. struct nh_notifier_info *info)
  1070. {
  1071. struct nsim_nexthop *nexthop;
  1072. nexthop = rhashtable_lookup_fast(&data->nexthop_ht, &info->id,
  1073. nsim_nexthop_ht_params);
  1074. if (!nexthop)
  1075. return;
  1076. rhashtable_remove_fast(&data->nexthop_ht, &nexthop->ht_node,
  1077. nsim_nexthop_ht_params);
  1078. nsim_nexthop_account(data, nexthop->occ, false, info->extack);
  1079. nsim_nexthop_destroy(nexthop);
  1080. }
  1081. static int nsim_nexthop_res_table_pre_replace(struct nsim_fib_data *data,
  1082. struct nh_notifier_info *info)
  1083. {
  1084. if (data->fail_res_nexthop_group_replace) {
  1085. NL_SET_ERR_MSG_MOD(info->extack, "Failed to replace a resilient nexthop group");
  1086. return -EINVAL;
  1087. }
  1088. return 0;
  1089. }
  1090. static int nsim_nexthop_bucket_replace(struct nsim_fib_data *data,
  1091. struct nh_notifier_info *info)
  1092. {
  1093. if (data->fail_nexthop_bucket_replace) {
  1094. NL_SET_ERR_MSG_MOD(info->extack, "Failed to replace nexthop bucket");
  1095. return -EINVAL;
  1096. }
  1097. nexthop_bucket_set_hw_flags(info->net, info->id,
  1098. info->nh_res_bucket->bucket_index,
  1099. false, true);
  1100. return 0;
  1101. }
  1102. static int nsim_nexthop_event_nb(struct notifier_block *nb, unsigned long event,
  1103. void *ptr)
  1104. {
  1105. struct nsim_fib_data *data = container_of(nb, struct nsim_fib_data,
  1106. nexthop_nb);
  1107. struct nh_notifier_info *info = ptr;
  1108. int err = 0;
  1109. mutex_lock(&data->nh_lock);
  1110. switch (event) {
  1111. case NEXTHOP_EVENT_REPLACE:
  1112. err = nsim_nexthop_insert(data, info);
  1113. break;
  1114. case NEXTHOP_EVENT_DEL:
  1115. nsim_nexthop_remove(data, info);
  1116. break;
  1117. case NEXTHOP_EVENT_RES_TABLE_PRE_REPLACE:
  1118. err = nsim_nexthop_res_table_pre_replace(data, info);
  1119. break;
  1120. case NEXTHOP_EVENT_BUCKET_REPLACE:
  1121. err = nsim_nexthop_bucket_replace(data, info);
  1122. break;
  1123. default:
  1124. break;
  1125. }
  1126. mutex_unlock(&data->nh_lock);
  1127. return notifier_from_errno(err);
  1128. }
  1129. static void nsim_nexthop_free(void *ptr, void *arg)
  1130. {
  1131. struct nsim_nexthop *nexthop = ptr;
  1132. struct nsim_fib_data *data = arg;
  1133. struct net *net;
  1134. net = devlink_net(data->devlink);
  1135. nsim_nexthop_hw_flags_set(net, nexthop, false);
  1136. nsim_nexthop_account(data, nexthop->occ, false, NULL);
  1137. nsim_nexthop_destroy(nexthop);
  1138. }
  1139. static ssize_t nsim_nexthop_bucket_activity_write(struct file *file,
  1140. const char __user *user_buf,
  1141. size_t size, loff_t *ppos)
  1142. {
  1143. struct nsim_fib_data *data = file->private_data;
  1144. struct net *net = devlink_net(data->devlink);
  1145. struct nsim_nexthop *nexthop;
  1146. unsigned long *activity;
  1147. loff_t pos = *ppos;
  1148. u16 bucket_index;
  1149. char buf[128];
  1150. int err = 0;
  1151. u32 nhid;
  1152. if (pos != 0)
  1153. return -EINVAL;
  1154. if (size > sizeof(buf))
  1155. return -EINVAL;
  1156. if (copy_from_user(buf, user_buf, size))
  1157. return -EFAULT;
  1158. if (sscanf(buf, "%u %hu", &nhid, &bucket_index) != 2)
  1159. return -EINVAL;
  1160. rtnl_lock();
  1161. nexthop = rhashtable_lookup_fast(&data->nexthop_ht, &nhid,
  1162. nsim_nexthop_ht_params);
  1163. if (!nexthop || !nexthop->is_resilient ||
  1164. bucket_index >= nexthop->occ) {
  1165. err = -EINVAL;
  1166. goto out;
  1167. }
  1168. activity = bitmap_zalloc(nexthop->occ, GFP_KERNEL);
  1169. if (!activity) {
  1170. err = -ENOMEM;
  1171. goto out;
  1172. }
  1173. bitmap_set(activity, bucket_index, 1);
  1174. nexthop_res_grp_activity_update(net, nhid, nexthop->occ, activity);
  1175. bitmap_free(activity);
  1176. out:
  1177. rtnl_unlock();
  1178. *ppos = size;
  1179. return err ?: size;
  1180. }
  1181. static const struct file_operations nsim_nexthop_bucket_activity_fops = {
  1182. .open = simple_open,
  1183. .write = nsim_nexthop_bucket_activity_write,
  1184. .llseek = no_llseek,
  1185. .owner = THIS_MODULE,
  1186. };
  1187. static u64 nsim_fib_ipv4_resource_occ_get(void *priv)
  1188. {
  1189. struct nsim_fib_data *data = priv;
  1190. return nsim_fib_get_val(data, NSIM_RESOURCE_IPV4_FIB, false);
  1191. }
  1192. static u64 nsim_fib_ipv4_rules_res_occ_get(void *priv)
  1193. {
  1194. struct nsim_fib_data *data = priv;
  1195. return nsim_fib_get_val(data, NSIM_RESOURCE_IPV4_FIB_RULES, false);
  1196. }
  1197. static u64 nsim_fib_ipv6_resource_occ_get(void *priv)
  1198. {
  1199. struct nsim_fib_data *data = priv;
  1200. return nsim_fib_get_val(data, NSIM_RESOURCE_IPV6_FIB, false);
  1201. }
  1202. static u64 nsim_fib_ipv6_rules_res_occ_get(void *priv)
  1203. {
  1204. struct nsim_fib_data *data = priv;
  1205. return nsim_fib_get_val(data, NSIM_RESOURCE_IPV6_FIB_RULES, false);
  1206. }
  1207. static u64 nsim_fib_nexthops_res_occ_get(void *priv)
  1208. {
  1209. struct nsim_fib_data *data = priv;
  1210. return nsim_fib_get_val(data, NSIM_RESOURCE_NEXTHOPS, false);
  1211. }
  1212. static void nsim_fib_set_max_all(struct nsim_fib_data *data,
  1213. struct devlink *devlink)
  1214. {
  1215. static const enum nsim_resource_id res_ids[] = {
  1216. NSIM_RESOURCE_IPV4_FIB, NSIM_RESOURCE_IPV4_FIB_RULES,
  1217. NSIM_RESOURCE_IPV6_FIB, NSIM_RESOURCE_IPV6_FIB_RULES,
  1218. NSIM_RESOURCE_NEXTHOPS,
  1219. };
  1220. int i;
  1221. for (i = 0; i < ARRAY_SIZE(res_ids); i++) {
  1222. int err;
  1223. u64 val;
  1224. err = devl_resource_size_get(devlink, res_ids[i], &val);
  1225. if (err)
  1226. val = (u64) -1;
  1227. nsim_fib_set_max(data, res_ids[i], val);
  1228. }
  1229. }
  1230. static void nsim_fib_event_work(struct work_struct *work)
  1231. {
  1232. struct nsim_fib_data *data = container_of(work, struct nsim_fib_data,
  1233. fib_event_work);
  1234. struct nsim_fib_event *fib_event, *next_fib_event;
  1235. LIST_HEAD(fib_event_queue);
  1236. spin_lock_bh(&data->fib_event_queue_lock);
  1237. list_splice_init(&data->fib_event_queue, &fib_event_queue);
  1238. spin_unlock_bh(&data->fib_event_queue_lock);
  1239. mutex_lock(&data->fib_lock);
  1240. list_for_each_entry_safe(fib_event, next_fib_event, &fib_event_queue,
  1241. list) {
  1242. nsim_fib_event(fib_event);
  1243. list_del(&fib_event->list);
  1244. kfree(fib_event);
  1245. cond_resched();
  1246. }
  1247. mutex_unlock(&data->fib_lock);
  1248. }
  1249. static void nsim_fib_flush_work(struct work_struct *work)
  1250. {
  1251. struct nsim_fib_data *data = container_of(work, struct nsim_fib_data,
  1252. fib_flush_work);
  1253. struct nsim_fib_rt *fib_rt, *fib_rt_tmp;
  1254. /* Process pending work. */
  1255. flush_work(&data->fib_event_work);
  1256. mutex_lock(&data->fib_lock);
  1257. list_for_each_entry_safe(fib_rt, fib_rt_tmp, &data->fib_rt_list, list) {
  1258. rhashtable_remove_fast(&data->fib_rt_ht, &fib_rt->ht_node,
  1259. nsim_fib_rt_ht_params);
  1260. nsim_fib_rt_free(fib_rt, data);
  1261. }
  1262. mutex_unlock(&data->fib_lock);
  1263. }
  1264. static int
  1265. nsim_fib_debugfs_init(struct nsim_fib_data *data, struct nsim_dev *nsim_dev)
  1266. {
  1267. data->ddir = debugfs_create_dir("fib", nsim_dev->ddir);
  1268. if (IS_ERR(data->ddir))
  1269. return PTR_ERR(data->ddir);
  1270. data->fail_route_offload = false;
  1271. debugfs_create_bool("fail_route_offload", 0600, data->ddir,
  1272. &data->fail_route_offload);
  1273. data->fail_res_nexthop_group_replace = false;
  1274. debugfs_create_bool("fail_res_nexthop_group_replace", 0600, data->ddir,
  1275. &data->fail_res_nexthop_group_replace);
  1276. data->fail_nexthop_bucket_replace = false;
  1277. debugfs_create_bool("fail_nexthop_bucket_replace", 0600, data->ddir,
  1278. &data->fail_nexthop_bucket_replace);
  1279. debugfs_create_file("nexthop_bucket_activity", 0200, data->ddir,
  1280. data, &nsim_nexthop_bucket_activity_fops);
  1281. data->fail_route_delete = false;
  1282. debugfs_create_bool("fail_route_delete", 0600, data->ddir,
  1283. &data->fail_route_delete);
  1284. return 0;
  1285. }
  1286. static void nsim_fib_debugfs_exit(struct nsim_fib_data *data)
  1287. {
  1288. debugfs_remove_recursive(data->ddir);
  1289. }
  1290. struct nsim_fib_data *nsim_fib_create(struct devlink *devlink,
  1291. struct netlink_ext_ack *extack)
  1292. {
  1293. struct nsim_fib_data *data;
  1294. struct nsim_dev *nsim_dev;
  1295. int err;
  1296. data = kzalloc(sizeof(*data), GFP_KERNEL);
  1297. if (!data)
  1298. return ERR_PTR(-ENOMEM);
  1299. data->devlink = devlink;
  1300. nsim_dev = devlink_priv(devlink);
  1301. err = nsim_fib_debugfs_init(data, nsim_dev);
  1302. if (err)
  1303. goto err_data_free;
  1304. mutex_init(&data->nh_lock);
  1305. err = rhashtable_init(&data->nexthop_ht, &nsim_nexthop_ht_params);
  1306. if (err)
  1307. goto err_debugfs_exit;
  1308. mutex_init(&data->fib_lock);
  1309. INIT_LIST_HEAD(&data->fib_rt_list);
  1310. err = rhashtable_init(&data->fib_rt_ht, &nsim_fib_rt_ht_params);
  1311. if (err)
  1312. goto err_rhashtable_nexthop_destroy;
  1313. INIT_WORK(&data->fib_event_work, nsim_fib_event_work);
  1314. INIT_WORK(&data->fib_flush_work, nsim_fib_flush_work);
  1315. INIT_LIST_HEAD(&data->fib_event_queue);
  1316. spin_lock_init(&data->fib_event_queue_lock);
  1317. nsim_fib_set_max_all(data, devlink);
  1318. data->nexthop_nb.notifier_call = nsim_nexthop_event_nb;
  1319. err = register_nexthop_notifier(devlink_net(devlink), &data->nexthop_nb,
  1320. extack);
  1321. if (err) {
  1322. pr_err("Failed to register nexthop notifier\n");
  1323. goto err_rhashtable_fib_destroy;
  1324. }
  1325. data->fib_nb.notifier_call = nsim_fib_event_nb;
  1326. err = register_fib_notifier(devlink_net(devlink), &data->fib_nb,
  1327. nsim_fib_dump_inconsistent, extack);
  1328. if (err) {
  1329. pr_err("Failed to register fib notifier\n");
  1330. goto err_nexthop_nb_unregister;
  1331. }
  1332. devl_resource_occ_get_register(devlink,
  1333. NSIM_RESOURCE_IPV4_FIB,
  1334. nsim_fib_ipv4_resource_occ_get,
  1335. data);
  1336. devl_resource_occ_get_register(devlink,
  1337. NSIM_RESOURCE_IPV4_FIB_RULES,
  1338. nsim_fib_ipv4_rules_res_occ_get,
  1339. data);
  1340. devl_resource_occ_get_register(devlink,
  1341. NSIM_RESOURCE_IPV6_FIB,
  1342. nsim_fib_ipv6_resource_occ_get,
  1343. data);
  1344. devl_resource_occ_get_register(devlink,
  1345. NSIM_RESOURCE_IPV6_FIB_RULES,
  1346. nsim_fib_ipv6_rules_res_occ_get,
  1347. data);
  1348. devl_resource_occ_get_register(devlink,
  1349. NSIM_RESOURCE_NEXTHOPS,
  1350. nsim_fib_nexthops_res_occ_get,
  1351. data);
  1352. return data;
  1353. err_nexthop_nb_unregister:
  1354. unregister_nexthop_notifier(devlink_net(devlink), &data->nexthop_nb);
  1355. err_rhashtable_fib_destroy:
  1356. cancel_work_sync(&data->fib_flush_work);
  1357. flush_work(&data->fib_event_work);
  1358. rhashtable_free_and_destroy(&data->fib_rt_ht, nsim_fib_rt_free,
  1359. data);
  1360. err_rhashtable_nexthop_destroy:
  1361. rhashtable_free_and_destroy(&data->nexthop_ht, nsim_nexthop_free,
  1362. data);
  1363. mutex_destroy(&data->fib_lock);
  1364. err_debugfs_exit:
  1365. mutex_destroy(&data->nh_lock);
  1366. nsim_fib_debugfs_exit(data);
  1367. err_data_free:
  1368. kfree(data);
  1369. return ERR_PTR(err);
  1370. }
  1371. void nsim_fib_destroy(struct devlink *devlink, struct nsim_fib_data *data)
  1372. {
  1373. devl_resource_occ_get_unregister(devlink,
  1374. NSIM_RESOURCE_NEXTHOPS);
  1375. devl_resource_occ_get_unregister(devlink,
  1376. NSIM_RESOURCE_IPV6_FIB_RULES);
  1377. devl_resource_occ_get_unregister(devlink,
  1378. NSIM_RESOURCE_IPV6_FIB);
  1379. devl_resource_occ_get_unregister(devlink,
  1380. NSIM_RESOURCE_IPV4_FIB_RULES);
  1381. devl_resource_occ_get_unregister(devlink,
  1382. NSIM_RESOURCE_IPV4_FIB);
  1383. unregister_fib_notifier(devlink_net(devlink), &data->fib_nb);
  1384. unregister_nexthop_notifier(devlink_net(devlink), &data->nexthop_nb);
  1385. cancel_work_sync(&data->fib_flush_work);
  1386. flush_work(&data->fib_event_work);
  1387. rhashtable_free_and_destroy(&data->fib_rt_ht, nsim_fib_rt_free,
  1388. data);
  1389. rhashtable_free_and_destroy(&data->nexthop_ht, nsim_nexthop_free,
  1390. data);
  1391. WARN_ON_ONCE(!list_empty(&data->fib_event_queue));
  1392. WARN_ON_ONCE(!list_empty(&data->fib_rt_list));
  1393. mutex_destroy(&data->fib_lock);
  1394. mutex_destroy(&data->nh_lock);
  1395. nsim_fib_debugfs_exit(data);
  1396. kfree(data);
  1397. }