Searched refs:RTE_LPM_MAX_DEPTH (Results 1 – 5 of 5) sorted by relevance
76 uint32_t a[RTE_LPM_MAX_DEPTH];77 uint32_t b[RTE_LPM_MAX_DEPTH];78 uint32_t c[RTE_LPM_MAX_DEPTH];264 ptr_rule->ip = (start << (RTE_LPM_MAX_DEPTH - depth)) in generate_random_rule_prefix()313 for (depth = 1; depth <= RTE_LPM_MAX_DEPTH; depth++) { in generate_large_route_rule_table()
63 if ((depth == 0) || (depth > RTE_LPM_MAX_DEPTH)) \103 return 1 << (RTE_LPM_MAX_DEPTH - depth); in depth_to_range()342 for (i = RTE_LPM_MAX_DEPTH; i > depth; i--) {380 for (i = depth; i < RTE_LPM_MAX_DEPTH; i++) {698 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM_MAX_DEPTH)) in rte_lpm_add()752 (depth < 1) || (depth > RTE_LPM_MAX_DEPTH))1044 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM_MAX_DEPTH)) { in rte_lpm_delete()
35 #define RTE_LPM_MAX_DEPTH 32 macro137 struct rte_lpm_rule_info rule_info[RTE_LPM_MAX_DEPTH]; /**< Rule info table. */
65 struct rte_lpm_rule_info rule_info[RTE_LPM_MAX_DEPTH];78 if ((depth == 0) || (depth > RTE_LPM_MAX_DEPTH)) \118 return 1 << (RTE_LPM_MAX_DEPTH - depth); in depth_to_range()421 for (i = RTE_LPM_MAX_DEPTH; i > depth; i--) { in rule_add()459 for (i = depth; i < RTE_LPM_MAX_DEPTH; i++) { in rule_delete()814 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM_MAX_DEPTH)) in rte_lpm_add()867 (depth < 1) || (depth > RTE_LPM_MAX_DEPTH)) in rte_lpm_is_rule_present()1160 if ((lpm == NULL) || (depth < 1) || (depth > RTE_LPM_MAX_DEPTH)) { in rte_lpm_delete()
34 #define RTE_LPM_MAX_DEPTH 32 macro