Home
last modified time | relevance | path

Searched refs:nhsel (Results 1 – 5 of 5) sorted by relevance

/Linux-v4.19/net/mpls/
Dinternal.h161 int nhsel; struct mpls_nh *nh; u8 *__nh; \
162 for (nhsel = 0, nh = (rt)->rt_nh, __nh = (u8 *)((rt)->rt_nh); \
163 nhsel < (rt)->rt_nhn; \
164 __nh += rt->rt_nh_size, nh = (struct mpls_nh *)__nh, nhsel++)
167 int nhsel; struct mpls_nh *nh; u8 *__nh; \
168 for (nhsel = 0, nh = (struct mpls_nh *)((rt)->rt_nh), \
170 nhsel < (rt)->rt_nhn; \
171 __nh += rt->rt_nh_size, nh = (struct mpls_nh *)__nh, nhsel++)
/Linux-v4.19/net/decnet/
Ddn_fib.c53 #define for_nexthops(fi) { int nhsel; const struct dn_fib_nh *nh;\
54 for(nhsel = 0, nh = (fi)->fib_nh; nhsel < (fi)->fib_nhs; nh++, nhsel++)
56 #define change_nexthops(fi) { int nhsel; struct dn_fib_nh *nh;\
57 for(nhsel = 0, nh = (struct dn_fib_nh *)((fi)->fib_nh); nhsel < (fi)->fib_nhs; nh++, nhsel++)
440 if (nhsel < fi->fib_nhs) { in dn_fib_semantic_match()
441 res->nh_sel = nhsel; in dn_fib_semantic_match()
487 res->nh_sel = nhsel; in dn_fib_select_multipath()
Ddn_table.c64 #define for_nexthops(fi) { int nhsel; const struct dn_fib_nh *nh;\
65 for(nhsel = 0, nh = (fi)->fib_nh; nhsel < (fi)->fib_nhs; nh++, nhsel++)
/Linux-v4.19/net/ipv4/
Dfib_semantics.c64 int nhsel; const struct fib_nh *nh; \
65 for (nhsel = 0, nh = (fi)->fib_nh; \
66 nhsel < (fi)->fib_nhs; \
67 nh++, nhsel++)
70 int nhsel; struct fib_nh *nexthop_nh; \
71 for (nhsel = 0, nexthop_nh = (struct fib_nh *)((fi)->fib_nh); \
72 nhsel < (fi)->fib_nhs; \
73 nexthop_nh++, nhsel++)
80 int nhsel; const struct fib_nh *nh = (fi)->fib_nh; \
81 for (nhsel = 0; nhsel < 1; nhsel++)
[all …]
Dfib_trie.c1447 int nhsel, err; in fib_table_lookup() local
1470 for (nhsel = 0; nhsel < fi->fib_nhs; nhsel++) { in fib_table_lookup()
1471 const struct fib_nh *nh = &fi->fib_nh[nhsel]; in fib_table_lookup()
1492 res->nh_sel = nhsel; in fib_table_lookup()