Home
last modified time | relevance | path

Searched refs:pb (Results 1 – 7 of 7) sorted by relevance

/dpdk/lib/hash/
H A Drte_jhash.h82 uint32_t *pb, unsigned check_align) in __rte_jhash_2hashes() argument
88 c += *pb; in __rte_jhash_2hashes()
141 *pb = b; in __rte_jhash_2hashes()
209 *pb = b; in __rte_jhash_2hashes()
217 *pb = b; in __rte_jhash_2hashes()
236 rte_jhash_2hashes(const void *key, uint32_t length, uint32_t *pc, uint32_t *pb) in rte_jhash_2hashes() argument
238 __rte_jhash_2hashes(key, length, pc, pb, 1); in rte_jhash_2hashes()
257 rte_jhash_32b_2hashes(const uint32_t *k, uint32_t length, uint32_t *pc, uint32_t *pb) in rte_jhash_32b_2hashes() argument
259 __rte_jhash_2hashes((const void *) k, (length << 2), pc, pb, 0); in rte_jhash_32b_2hashes()
/dpdk/lib/flow_classify/
H A Drte_flow_classify_parse.c83 const struct rte_flow_item *pb = pattern, *pe = pattern; in classify_pattern_skip_void_item() local
87 pb = classify_find_first_item(pb, false); in classify_pattern_skip_void_item()
88 if (pb->type == RTE_FLOW_ITEM_TYPE_END) { in classify_pattern_skip_void_item()
89 pe = pb; in classify_pattern_skip_void_item()
94 pe = classify_find_first_item(pb + 1, true); in classify_pattern_skip_void_item()
96 cpy_count = pe - pb; in classify_pattern_skip_void_item()
97 rte_memcpy(items, pb, sizeof(struct rte_flow_item) * cpy_count); in classify_pattern_skip_void_item()
102 pb = pe; in classify_pattern_skip_void_item()
/dpdk/drivers/net/iavf/
H A Diavf_generic_flow.c1976 const struct rte_flow_item *pb = pattern, *pe = pattern; in iavf_pattern_skip_void_item() local
1980 pb = iavf_find_first_item(pb, false); in iavf_pattern_skip_void_item()
1981 if (pb->type == RTE_FLOW_ITEM_TYPE_END) { in iavf_pattern_skip_void_item()
1982 pe = pb; in iavf_pattern_skip_void_item()
1987 pe = iavf_find_first_item(pb + 1, true); in iavf_pattern_skip_void_item()
1989 cpy_count = pe - pb; in iavf_pattern_skip_void_item()
1990 rte_memcpy(items, pb, sizeof(struct rte_flow_item) * cpy_count); in iavf_pattern_skip_void_item()
1997 pb = pe + 1; in iavf_pattern_skip_void_item()
/dpdk/drivers/net/ice/
H A Dice_generic_flow.c2075 const struct rte_flow_item *pb = pattern, *pe = pattern; in ice_pattern_skip_void_item() local
2079 pb = ice_find_first_item(pb, false); in ice_pattern_skip_void_item()
2080 if (pb->type == RTE_FLOW_ITEM_TYPE_END) { in ice_pattern_skip_void_item()
2081 pe = pb; in ice_pattern_skip_void_item()
2086 pe = ice_find_first_item(pb + 1, true); in ice_pattern_skip_void_item()
2088 cpy_count = pe - pb; in ice_pattern_skip_void_item()
2089 rte_memcpy(items, pb, sizeof(struct rte_flow_item) * cpy_count); in ice_pattern_skip_void_item()
2097 pb = pe + 1; in ice_pattern_skip_void_item()
/dpdk/drivers/net/i40e/
H A Di40e_flow.c1907 const struct rte_flow_item *pb = pattern, *pe = pattern; in i40e_pattern_skip_void_item() local
1911 pb = i40e_find_first_item(pb, false); in i40e_pattern_skip_void_item()
1912 if (pb->type == RTE_FLOW_ITEM_TYPE_END) { in i40e_pattern_skip_void_item()
1913 pe = pb; in i40e_pattern_skip_void_item()
1918 pe = i40e_find_first_item(pb + 1, true); in i40e_pattern_skip_void_item()
1920 cpy_count = pe - pb; in i40e_pattern_skip_void_item()
1921 rte_memcpy(items, pb, sizeof(struct rte_flow_item) * cpy_count); in i40e_pattern_skip_void_item()
1926 pb = pe; in i40e_pattern_skip_void_item()
1930 pb = pe + 1; in i40e_pattern_skip_void_item()
/dpdk/doc/guides/nics/
H A Dmemif.rst110 | C2S rings | S2C rings | packet buffer 0 | . | pb ((1 << pmd->run.log2_ring_size)*(c2s + s2c))-1 |
/dpdk/doc/guides/prog_guide/
H A Dqos_framework.rst1545 Initial Drop Probability (pb), Actual Drop probability (pa) Computed Using