Home
last modified time | relevance | path

Searched refs:bits_t (Results 1 – 3 of 3) sorted by relevance

/f-stack/dpdk/lib/librte_acl/
H A Dacl.h26 typedef int bits_t; typedef
28 #define RTE_ACL_BIT_SET_SIZE ((UINT8_MAX + 1) / (sizeof(bits_t) * CHAR_BIT))
31 bits_t bits[RTE_ACL_BIT_SET_SIZE];
H A Dacl_gen.c135 if (bits->bits[n / (sizeof(bits_t) * CHAR_BIT)] & in acl_node_fill_dfa()
136 (1U << (n % (sizeof(bits_t) * CHAR_BIT)))) { in acl_node_fill_dfa()
165 if (bits->bits[n / (sizeof(bits_t) * 8)] & in acl_count_sequential_groups()
166 (1U << (n % (sizeof(bits_t) * 8)))) { in acl_count_sequential_groups()
177 if (bits->bits[n / (sizeof(bits_t) * 8)] & in acl_count_sequential_groups()
178 (1U << (n % (sizeof(bits_t) * CHAR_BIT)))) { in acl_count_sequential_groups()
H A Dacl_bld.c217 acl_include(struct rte_acl_bitset *dst, struct rte_acl_bitset *src, bits_t mask) in acl_include()
234 bits_t all_bits = 0; in acl_exclude()
322 bitset.bits[n / (sizeof(bits_t) * 8)] |= in acl_add_ptr_range()
323 1U << (n % (sizeof(bits_t) * CHAR_BIT)); in acl_add_ptr_range()
345 bitset->bits[n / (sizeof(bits_t) * 8)] |= in acl_gen_mask()
346 1U << (n % (sizeof(bits_t) * CHAR_BIT)); in acl_gen_mask()
362 bits_t intersect_bits = 0; in acl_intersect_type()
363 bits_t a_superset = 0; in acl_intersect_type()
364 bits_t b_superset = 0; in acl_intersect_type()