Home
last modified time | relevance | path

Searched refs:n_bits (Results 1 – 8 of 8) sorted by relevance

/f-stack/freebsd/contrib/ck/include/
H A Dck_bitmap.h118 unsigned int n_bits; member
155 return bitmap->n_bits; in ck_bitmap_bits()
228 if (src->n_bits < dst->n_bits) in ck_bitmap_union()
320 limit = bitmap->n_bits; in ck_bitmap_empty()
351 limit = bitmap->n_bits; in ck_bitmap_full()
382 limit = bitmap->n_bits; in ck_bitmap_count()
409 if (limit > x->n_bits) in ck_bitmap_count_intersect()
410 limit = x->n_bits; in ck_bitmap_count_intersect()
412 if (limit > y->n_bits) in ck_bitmap_count_intersect()
413 limit = y->n_bits; in ck_bitmap_count_intersect()
[all …]
/f-stack/dpdk/lib/librte_eal/include/
H A Drte_bitmap.h97 __rte_bitmap_get_memory_footprint(uint32_t n_bits, in __rte_bitmap_get_memory_footprint() argument
148 rte_bitmap_get_memory_footprint(uint32_t n_bits) { in rte_bitmap_get_memory_footprint() argument
150 if (n_bits == 0) { in rte_bitmap_get_memory_footprint()
154 return __rte_bitmap_get_memory_footprint(n_bits, NULL, NULL, NULL, NULL); in rte_bitmap_get_memory_footprint()
170 rte_bitmap_init(uint32_t n_bits, uint8_t *mem, uint32_t mem_size) in rte_bitmap_init() argument
177 if (n_bits == 0) { in rte_bitmap_init()
185 size = __rte_bitmap_get_memory_footprint(n_bits, in rte_bitmap_init()
255 rte_bitmap_init_with_all_set(uint32_t n_bits, uint8_t *mem, uint32_t mem_size) in rte_bitmap_init_with_all_set() argument
263 if (!n_bits || !mem || (((uintptr_t) mem) & RTE_CACHE_LINE_MASK)) in rte_bitmap_init_with_all_set()
266 size = __rte_bitmap_get_memory_footprint(n_bits, in rte_bitmap_init_with_all_set()
[all …]
/f-stack/dpdk/lib/librte_pipeline/
H A Drte_swx_pipeline.c1088 dst->n_bits = src->n_bits; in rte_swx_pipeline_struct_type_register()
1091 st->n_bits += src->n_bits; in rte_swx_pipeline_struct_type_register()
2460 instr->io.io.n_bits = f->n_bits; in instr_rx_translate()
2522 instr->io.io.n_bits = f->n_bits; in instr_tx_translate()
4807 instr->jmp.a.n_bits = fa->n_bits; in instr_jmp_eq_translate()
4810 instr->jmp.b.n_bits = fb->n_bits; in instr_jmp_eq_translate()
4825 instr->jmp.a.n_bits = fa->n_bits; in instr_jmp_eq_translate()
4879 instr->jmp.a.n_bits = fa->n_bits; in instr_jmp_neq_translate()
4936 instr->jmp.a.n_bits = fa->n_bits; in instr_jmp_lt_translate()
4993 instr->jmp.a.n_bits = fa->n_bits; in instr_jmp_gt_translate()
[all …]
H A Drte_swx_ctl.c25 #define field_ntoh(val, n_bits) (ntoh64((val) << (64 - n_bits))) argument
26 #define field_hton(val, n_bits) (hton64((val) << (64 - n_bits))) argument
28 #define field_ntoh(val, n_bits) (val) argument
29 #define field_hton(val, n_bits) (val) argument
163 size = f->n_bits / 8; in table_params_get()
787 a->data_size += info->n_bits; in rte_swx_ctl_pipeline_create()
1411 val = field_hton(val, mf->n_bits); in rte_swx_ctl_pipeline_table_entry_read()
1416 mf->n_bits / 8); in rte_swx_ctl_pipeline_table_entry_read()
1456 val = field_hton(val, arg->n_bits); in rte_swx_ctl_pipeline_table_entry_read()
1461 arg->n_bits / 8); in rte_swx_ctl_pipeline_table_entry_read()
[all …]
H A Drte_swx_ctl.h162 uint32_t n_bits; member
249 uint32_t n_bits; member
H A Drte_swx_pipeline_spec.c174 uint32_t n_bits; in struct_block_parse() local
201 n_bits = strtoul(p, &p, 0); in struct_block_parse()
203 !n_bits || in struct_block_parse()
204 (n_bits % 8) || in struct_block_parse()
205 (n_bits > 64)) { in struct_block_parse()
237 s->fields[s->n_fields].n_bits = n_bits; in struct_block_parse()
H A Drte_swx_pipeline.h288 uint32_t n_bits; member
/f-stack/dpdk/doc/guides/prog_guide/
H A Dpacket_framework.rst320 considering *n_bits* as the number of bits set in *bucket_mask = n_buckets - 1*,
321 this means that all the keys that end up in the same hash table bucket have the lower *n_bits* of t…