| /f-stack/freebsd/contrib/dpdk_rte_lpm/ |
| H A D | rte_lpm.c | 482 lpm->tbl24[i].depth <= depth)) { in add_depth_small()
488 .depth = depth, in add_depth_small()
511 lpm->tbl8[j].depth <= depth) { in add_depth_small()
516 .depth = depth, in add_depth_small()
567 .depth = depth, in add_depth_big()
626 .depth = depth, in add_depth_big()
664 lpm->tbl8[i].depth <= depth) { in add_depth_big()
667 .depth = depth, in add_depth_big()
815 lpm->tbl24[i].depth <= depth) { in delete_depth_small()
971 if (lpm->tbl8[i].depth <= depth) in delete_depth_big()
[all …]
|
| H A D | rte_lpm6.c | 220 key->depth = depth;
688 tbl[i].depth <= depth)) { in add_step()
692 .depth = depth, in add_step()
775 .depth = tbl[entry_ind].depth, in add_step()
1033 rule->depth = depth; in fill_rule6()
1191 rule_key.depth = depth;
1196 rule->depth = depth;
1291 .depth = lsp_rule->depth, in remove_tbl()
1379 depth, lsp_rule->depth, in rte_lpm6_delete()
1389 } else if (from->depth == depth) { in rte_lpm6_delete()
[all …]
|
| /f-stack/dpdk/app/test/ |
| H A D | test_lpm6.c | 550 depth = 25; in test11()
557 depth = 33; in test11()
564 depth = 41; in test11()
645 depth = 1; in test13()
649 depth = 2; in test13()
653 depth = 3; in test13()
657 depth = 2; in test13()
661 depth = 3; in test13()
823 for (depth = 1; depth <= 16; depth++) { in test17()
840 for (depth = 16; depth >= 1; depth--) { in test17()
[all …]
|
| H A D | test_lpm.c | 384 for (depth = 1; depth <= 32; depth++) { in test8()
408 for (depth = 32; depth >= 1; depth--) { in test8()
467 depth = 24; in test9()
489 depth = 23; in test9()
498 depth = 24; in test9()
507 depth = 24; in test9()
512 depth = 23; in test9()
525 depth = 32; in test9()
535 depth = 32; in test9()
551 depth = 32; in test9()
[all …]
|
| H A D | test_lpm6_data.h | 12 uint8_t depth; member
1045 const uint8_t *ip_in, uint8_t depth) in mask_ip6_prefix() argument
1051 if (depth >= 8) in mask_ip6_prefix()
1053 else if (depth > 0) { in mask_ip6_prefix()
1061 depth -= 8; in mask_ip6_prefix()
1069 const uint8_t *ip_rule, uint8_t depth) in check_lpm6_rule() argument
1075 if (depth >= 8) { in check_lpm6_rule()
1078 } else if (depth > 0) { in check_lpm6_rule()
1087 depth -= 8; in check_lpm6_rule()
1107 if (rule[i].depth >= max_depth) { in get_next_hop()
[all …]
|
| H A D | test_fib_perf.c | 35 uint8_t depth; member
200 rule_num = rule_count.a[depth - 1]; in generate_random_rule_prefix()
204 rule_num = rule_count.b[depth - 1]; in generate_random_rule_prefix()
208 rule_num = rule_count.c[depth - 1]; in generate_random_rule_prefix()
217 class_depth = depth - fixed_bit_num; in generate_random_rule_prefix()
243 ptr_rule->depth = depth; in generate_random_rule_prefix()
266 large_route_table[pos].depth = depth; in insert_rule_in_random_pos()
274 uint8_t depth; in generate_large_route_rule_table() local
280 for (depth = 1; depth <= RTE_FIB_MAX_DEPTH; depth++) in generate_large_route_rule_table()
310 if (table[j].depth == (uint8_t) i) in print_route_distribution()
[all …]
|
| H A D | test_lpm_perf.c | 51 uint8_t depth; member
222 rule_num = rule_count.a[depth - 1]; in generate_random_rule_prefix()
226 rule_num = rule_count.b[depth - 1]; in generate_random_rule_prefix()
230 rule_num = rule_count.c[depth - 1]; in generate_random_rule_prefix()
266 ptr_rule->depth = depth; in generate_random_rule_prefix()
270 if (depth > 24) { in generate_random_rule_prefix()
272 ptr_ldepth_rule->depth = ptr_rule->depth; in generate_random_rule_prefix()
298 large_route_table[pos].depth = depth; in insert_rule_in_random_pos()
306 uint8_t depth; in generate_large_route_rule_table() local
313 for (depth = 1; depth <= RTE_LPM_MAX_DEPTH; depth++) { in generate_large_route_rule_table()
[all …]
|
| H A D | test_rib.c | 122 uint8_t depth = 24; in test_insert_invalid() local
128 node = rte_rib_insert(NULL, ip, depth); in test_insert_invalid()
142 node = rte_rib_insert(rib, ip, depth); in test_insert_invalid()
144 node1 = rte_rib_insert(rib, ip, depth); in test_insert_invalid()
169 uint8_t depth = 24; in test_get_fn() local
179 node = rte_rib_insert(rib, ip, depth); in test_get_fn()
248 uint8_t depth = 24; in test_basic() local
257 node = rte_rib_insert(rib, ip, depth); in test_basic()
279 rte_rib_remove(rib, ip, depth); in test_basic()
302 uint8_t depth = 30; in test_tree_traversal() local
[all …]
|
| H A D | test_rib6.c | 123 uint8_t depth = 24; in test_insert_invalid() local
129 node = rte_rib6_insert(NULL, ip, depth); in test_insert_invalid()
143 node = rte_rib6_insert(rib, ip, depth); in test_insert_invalid()
145 node1 = rte_rib6_insert(rib, ip, depth); in test_insert_invalid()
171 uint8_t depth = 24; in test_get_fn() local
181 node = rte_rib6_insert(rib, ip, depth); in test_get_fn()
251 uint8_t depth = 24; in test_basic() local
260 node = rte_rib6_insert(rib, ip, depth); in test_basic()
282 rte_rib6_remove(rib, ip, depth); in test_basic()
309 uint8_t depth = 126; in test_tree_traversal() local
[all …]
|
| /f-stack/dpdk/lib/librte_lpm/ |
| H A D | rte_lpm.c | 597 i_lpm->lpm.tbl24[i].depth <= depth)) { in add_depth_small()
603 .depth = depth, in add_depth_small()
626 i_lpm->lpm.tbl8[j].depth <= depth) { in add_depth_small()
631 .depth = depth, in add_depth_small()
682 .depth = depth, in add_depth_big()
741 .depth = depth, in add_depth_big()
779 i_lpm->lpm.tbl8[i].depth <= depth) { in add_depth_big()
782 .depth = depth, in add_depth_big()
930 i_lpm->lpm.tbl24[i].depth <= depth) { in delete_depth_small()
1087 if (i_lpm->lpm.tbl8[i].depth <= depth) in delete_depth_big()
[all …]
|
| H A D | rte_lpm6.c | 224 key->depth = depth; in rule_key_init()
682 tbl[i].depth <= depth)) { in add_step()
686 .depth = depth, in add_step()
702 expand_rule(lpm, tbl8_gindex, depth, depth, in add_step()
769 .depth = tbl[entry_ind].depth, in add_step()
1168 rule_key.depth = depth; in rule_find_less_specific()
1173 rule->depth = depth; in rule_find_less_specific()
1267 .depth = lsp_rule->depth, in remove_tbl()
1351 depth, lsp_rule->depth, in rte_lpm6_delete()
1361 } else if (from->depth == depth) { in rte_lpm6_delete()
[all …]
|
| /f-stack/dpdk/lib/librte_rib/ |
| H A D | rte_rib.c | 37 uint8_t depth; member
138 if ((cur->ip == ip) && (cur->depth == depth) && in __rib_lookup_exact()
141 if ((cur->depth > depth) || in __rib_lookup_exact()
179 while ((tmp) && (tmp->depth < depth)) in rte_rib_get_nxt()
188 (tmp->depth > depth))) in rte_rib_get_nxt()
196 (tmp->depth > depth))) { in rte_rib_get_nxt()
271 new_node->depth = depth; in rte_rib_insert()
289 if ((ip == (*tmp)->ip) && (depth == (*tmp)->depth)) { in rte_rib_insert()
295 d = (*tmp)->depth; in rte_rib_insert()
302 common_depth = RTE_MIN(depth, (*tmp)->depth); in rte_rib_insert()
[all …]
|
| H A D | rte_rib6.c | 37 uint8_t depth; member
174 (cur->depth == depth) && in rte_rib6_lookup_exact()
179 (cur->depth >= depth)) in rte_rib6_lookup_exact()
212 while ((tmp) && (tmp->depth < depth)) in rte_rib6_get_nxt()
221 (tmp->depth > depth))) in rte_rib6_get_nxt()
229 (tmp->depth > depth))) { in rte_rib6_get_nxt()
311 new_node->depth = depth; in rte_rib6_insert()
330 (depth == (*tmp)->depth)) { in rte_rib6_insert()
338 ((*tmp)->depth >= depth)) { in rte_rib6_insert()
348 common_depth = RTE_MIN(depth, (*tmp)->depth); in rte_rib6_insert()
[all …]
|
| H A D | rte_rib6.h | 108 get_msk_part(uint8_t depth, int byte) { in get_msk_part() argument
112 depth = RTE_MIN(depth, 128); in get_msk_part()
113 part = RTE_MAX((int16_t)depth - (byte * 8), 0); in get_msk_part()
164 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE], uint8_t depth);
193 uint8_t depth, struct rte_rib6_node *last, int flag);
208 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE], uint8_t depth);
226 const uint8_t ip[RTE_RIB6_IPV6_ADDR_SIZE], uint8_t depth);
257 rte_rib6_get_depth(const struct rte_rib6_node *node, uint8_t *depth);
|
| H A D | rte_rib.h | 62 rte_rib_depth_to_mask(uint8_t depth) in rte_rib_depth_to_mask() argument
64 return (uint32_t)(UINT64_MAX << (32 - depth)); in rte_rib_depth_to_mask()
111 rte_rib_lookup_exact(struct rte_rib *rib, uint32_t ip, uint8_t depth);
138 rte_rib_get_nxt(struct rte_rib *rib, uint32_t ip, uint8_t depth,
153 rte_rib_remove(struct rte_rib *rib, uint32_t ip, uint8_t depth);
170 rte_rib_insert(struct rte_rib *rib, uint32_t ip, uint8_t depth);
200 rte_rib_get_depth(const struct rte_rib_node *node, uint8_t *depth);
|
| /f-stack/freebsd/kern/ |
| H A D | subr_stack.c | 74 if (st->depth < STACK_MAX) { in stack_put()
75 st->pcs[st->depth++] = pc; in stack_put()
103 for (i = 0; i < st->depth; i++) { in stack_print()
119 for (i = 0; i < st->depth; i++) { in stack_print_short()
139 for (i = 0; i < st->depth; i++) { in stack_print_ddb()
155 for (i = 0; i < st->depth; i++) { in stack_print_short_ddb()
181 for (i = 0; i < st->depth; i++) { in stack_sbuf_print_flags()
229 u_int depth) in stack_ktr() argument
239 if (depth == 0 || st->depth < depth) in stack_ktr()
240 depth = st->depth; in stack_ktr()
[all …]
|
| /f-stack/freebsd/contrib/libfdt/ |
| H A D | fdt.c | 184 if (depth) in fdt_next_node()
185 (*depth)++; in fdt_next_node()
189 if (depth && ((--(*depth)) < 0)) in fdt_next_node()
195 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth)) in fdt_next_node()
207 int depth = 0; in fdt_first_subnode() local
209 offset = fdt_next_node(fdt, offset, &depth); in fdt_first_subnode()
210 if (offset < 0 || depth != 1) in fdt_first_subnode()
218 int depth = 1; in fdt_next_subnode() local
225 offset = fdt_next_node(fdt, offset, &depth); in fdt_next_subnode()
226 if (offset < 0 || depth < 1) in fdt_next_subnode()
[all …]
|
| H A D | fdt_ro.c | 162 int depth; in fdt_subnode_offset_namelen() local
166 for (depth = 0; in fdt_subnode_offset_namelen()
169 if ((depth == 1) in fdt_subnode_offset_namelen()
173 if (depth < 0) in fdt_subnode_offset_namelen()
462 int offset, depth, namelen; in fdt_get_path() local
470 for (offset = 0, depth = 0; in fdt_get_path()
473 while (pdepth > depth) { in fdt_get_path()
480 if (pdepth >= depth) { in fdt_get_path()
493 if (pdepth < (depth + 1)) in fdt_get_path()
514 int offset, depth; in fdt_supernode_atdepth_offset() local
[all …]
|
| /f-stack/dpdk/app/test-fib/ |
| H A D | main.c | 120 uint8_t depth; member
174 uint8_t depth; in complete_distrib() local
182 for (depth = 0; depth <= depth_lim; depth++) { in complete_distrib()
202 for (depth = 0; depth <= depth_lim; depth++) { in complete_distrib()
287 tmp.depth = rt[i].depth; in shuffle_rt_4()
291 rt[i].depth = rt[j].depth; in shuffle_rt_4()
295 rt[j].depth = tmp.depth; in shuffle_rt_4()
309 tmp.depth = rt[i].depth; in shuffle_rt_6()
313 rt[i].depth = rt[j].depth; in shuffle_rt_6()
317 rt[j].depth = tmp.depth; in shuffle_rt_6()
[all …]
|
| /f-stack/freebsd/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_mount/ |
| H A D | zfs_mount_006_pos.ksh | 88 typeset -i depth=0
91 while (( depth < MAXDEPTH )); do
92 mtpt=$mtpt/$depth
93 (( depth = depth + 1))
113 while [[ $depth -gt 0 ]] ; do
114 (( depth == MAXDEPTH )) && \
138 (( depth == MAXDEPTH )) && \
142 (( depth = depth - 1 ))
|
| /f-stack/dpdk/examples/ipsec-secgw/ |
| H A D | sp6.c | 355 (depth > 32) ? 32 : depth; in parse_sp6_tokens()
356 depth = (depth > 32) ? (depth - 32) : 0; in parse_sp6_tokens()
363 (depth > 32) ? 32 : depth; in parse_sp6_tokens()
364 depth = (depth > 32) ? (depth - 32) : 0; in parse_sp6_tokens()
371 (depth > 32) ? 32 : depth; in parse_sp6_tokens()
372 depth = (depth > 32) ? (depth - 32) : 0; in parse_sp6_tokens()
379 (depth > 32) ? 32 : depth; in parse_sp6_tokens()
409 (depth > 32) ? 32 : depth; in parse_sp6_tokens()
410 depth = (depth > 32) ? (depth - 32) : 0; in parse_sp6_tokens()
418 depth = (depth > 32) ? (depth - 32) : 0; in parse_sp6_tokens()
[all …]
|
| H A D | rt.c | 22 uint8_t depth; member
28 uint8_t depth; member
78 uint32_t depth = 0; in parse_rt_tokens() local
81 &ip, &depth) == 0, status, in parse_rt_tokens()
89 route_ipv4->depth = (uint8_t)depth; in parse_rt_tokens()
92 uint32_t depth; in parse_rt_tokens() local
95 &ip, &depth) == 0, status, in parse_rt_tokens()
102 route_ipv6->depth = (uint8_t)depth; in parse_rt_tokens()
163 ret = rte_lpm_add(lpm, rt_ip4[i].ip, rt_ip4[i].depth, in rt_init()
171 a, b, c, d, rt_ip4[i].depth, in rt_init()
[all …]
|
| /f-stack/freebsd/contrib/device-tree/Bindings/net/can/ |
| H A D | xilinx_can.txt | 19 - tx-fifo-depth : Can Tx fifo depth (Zynq, Axi CAN).
20 - rx-fifo-depth : Can Rx fifo depth (Zynq, Axi CAN, CAN FD in
37 tx-fifo-depth = <0x40>;
38 rx-fifo-depth = <0x40>;
48 tx-fifo-depth = <0x40>;
49 rx-fifo-depth = <0x40>;
60 rx-fifo-depth = <0x20>;
|
| /f-stack/tools/libxo/tests/xo/ |
| H A D | xo_02.sh | 27 ${XOP} --depth 4 --not-first --wrap d/e/f "$@"
42 ${XOP} --depth 2 'First {:tag} ' value1
43 ${XOP} --depth 2 --continuation 'and then {:tag}\n' value2
52 ${XOP} --depth 1 $NF --open-instance machine
53 ${XOP} --depth 2 "Machine {k:name} has {:memory}\n" $name 55
54 ${XOP} --depth 1 --close-instance machine
|
| /f-stack/dpdk/drivers/net/nfp/nfpcore/ |
| H A D | nfp_mutex.c | 31 uint16_t depth; member
162 mutex->depth = 0; in nfp_cpp_mutex_alloc()
270 printf("\tdepth:%hd]\n", mutex->depth); in nfp_cpp_mutex_lock()
298 if (mutex->depth > 1) { in nfp_cpp_mutex_unlock()
299 mutex->depth--; in nfp_cpp_mutex_unlock()
325 mutex->depth = 0; in nfp_cpp_mutex_unlock()
353 if (mutex->depth > 0) { in nfp_cpp_mutex_trylock()
354 if (mutex->depth == MUTEX_DEPTH_MAX) in nfp_cpp_mutex_trylock()
357 mutex->depth++; in nfp_cpp_mutex_trylock()
410 mutex->depth = 1; in nfp_cpp_mutex_trylock()
[all …]
|