Home
last modified time | relevance | path

Searched refs:entry_size (Results 1 – 25 of 27) sorted by relevance

12

/dpdk/lib/table/
H A Drte_table_hash_cuckoo.c33 uint32_t entry_size; member
80 uint32_t entry_size) in rte_table_hash_cuckoo_create() argument
93 RTE_CACHE_LINE_ROUNDUP(p->n_keys * entry_size); in rte_table_hash_cuckoo_create()
127 t->entry_size = entry_size; in rte_table_hash_cuckoo_create()
175 memcpy(existing_entry, entry, t->entry_size); in rte_table_hash_cuckoo_entry_add()
189 new_entry = &t->memory[pos * t->entry_size]; in rte_table_hash_cuckoo_entry_add()
190 memcpy(new_entry, entry, t->entry_size); in rte_table_hash_cuckoo_entry_add()
219 memcpy(entry, entry_ptr, t->entry_size); in rte_table_hash_cuckoo_entry_delete()
221 memset(&t->memory[pos * t->entry_size], 0, t->entry_size); in rte_table_hash_cuckoo_entry_delete()
264 * t->entry_size]; in rte_table_hash_cuckoo_lookup()
[all …]
H A Drte_table_lpm_ipv6.c35 uint32_t entry_size; member
75 if (p->entry_unique_size > entry_size) { in rte_table_lpm_ipv6_create()
85 entry_size = RTE_ALIGN(entry_size, sizeof(uint64_t)); in rte_table_lpm_ipv6_create()
88 nht_size = RTE_TABLE_LPM_MAX_NEXT_HOPS * entry_size; in rte_table_lpm_ipv6_create()
112 lpm->entry_size = entry_size; in rte_table_lpm_ipv6_create()
159 uint8_t *nht_entry = &lpm->nht[i * lpm->entry_size]; in nht_find_existing()
220 nht_entry = &lpm->nht[nht_pos * lpm->entry_size]; in rte_table_lpm_ipv6_entry_add()
221 memcpy(nht_entry, entry, lpm->entry_size); in rte_table_lpm_ipv6_entry_add()
295 memcpy(entry, &lpm->nht[nht_pos * lpm->entry_size], in rte_table_lpm_ipv6_entry_delete()
296 lpm->entry_size); in rte_table_lpm_ipv6_entry_delete()
[all …]
H A Drte_table_lpm.c38 uint32_t entry_size; member
78 if (p->entry_unique_size > entry_size) { in rte_table_lpm_create()
88 entry_size = RTE_ALIGN(entry_size, sizeof(uint64_t)); in rte_table_lpm_create()
91 nht_size = RTE_TABLE_LPM_MAX_NEXT_HOPS * entry_size; in rte_table_lpm_create()
115 lpm->entry_size = entry_size; in rte_table_lpm_create()
162 uint8_t *nht_entry = &lpm->nht[i * lpm->entry_size]; in nht_find_existing()
223 nht_entry = &lpm->nht[nht_pos * lpm->entry_size]; in rte_table_lpm_entry_add()
224 memcpy(nht_entry, entry, lpm->entry_size); in rte_table_lpm_entry_add()
294 memcpy(entry, &lpm->nht[nht_pos * lpm->entry_size], in rte_table_lpm_entry_delete()
295 lpm->entry_size); in rte_table_lpm_entry_delete()
[all …]
H A Drte_table_array.c32 uint32_t entry_size; member
44 rte_table_array_create(void *params, int socket_id, uint32_t entry_size) in rte_table_array_create() argument
59 total_cl_size += (p->n_entries * entry_size + in rte_table_array_create()
71 t->entry_size = entry_size; in rte_table_array_create()
132 table_entry = &t->array[k->pos * t->entry_size]; in rte_table_array_entry_add()
133 memcpy(table_entry, entry, t->entry_size); in rte_table_array_entry_add()
163 t->entry_size]; in rte_table_array_lookup()
174 t->entry_size]; in rte_table_array_lookup()
H A Drte_table_acl.c40 uint32_t entry_size; member
56 uint32_t entry_size) in rte_table_acl_create() argument
87 entry_size = RTE_ALIGN(entry_size, sizeof(uint64_t)); in rte_table_acl_create()
131 acl->entry_size = entry_size; in rte_table_acl_create()
286 *entry_ptr = &acl->memory[i * acl->entry_size]; in rte_table_acl_entry_add()
287 memcpy(*entry_ptr, entry, acl->entry_size); in rte_table_acl_entry_add()
325 memcpy(*entry_ptr, entry, acl->entry_size); in rte_table_acl_entry_add()
406 memcpy(entry, &acl->memory[pos * acl->entry_size], in rte_table_acl_entry_delete()
407 acl->entry_size); in rte_table_acl_entry_delete()
707 acl->entry_size); in rte_table_acl_entry_delete_bulk()
[all …]
H A Drte_table_hash_key8.c67 uint32_t entry_size; member
172 KEYS_PER_BUCKET * entry_size); in rte_table_hash_create_key8_lru()
200 f->entry_size = entry_size; in rte_table_hash_create_key8_lru()
264 memcpy(bucket_data, entry, f->entry_size); in rte_table_hash_entry_add_key8_lru()
293 memcpy(&bucket->data[pos * f->entry_size], entry, f->entry_size); in rte_table_hash_entry_add_key8_lru()
374 KEYS_PER_BUCKET * entry_size); in rte_table_hash_create_key8_ext()
404 f->entry_size = entry_size; in rte_table_hash_create_key8_ext()
470 f->entry_size]; in rte_table_hash_entry_add_key8_ext()
490 f->entry_size]; in rte_table_hash_entry_add_key8_ext()
552 f->entry_size]; in rte_table_hash_entry_delete_key8_ext()
[all …]
H A Drte_table_hash_key16.c71 uint32_t entry_size; member
146 uint32_t entry_size) in rte_table_hash_create_key16_lru() argument
180 KEYS_PER_BUCKET * entry_size); in rte_table_hash_create_key16_lru()
207 f->entry_size = entry_size; in rte_table_hash_create_key16_lru()
306 memcpy(&bucket->data[pos * f->entry_size], entry, f->entry_size); in rte_table_hash_entry_add_key16_lru()
357 uint32_t entry_size) in rte_table_hash_create_key16_ext() argument
389 KEYS_PER_BUCKET * entry_size); in rte_table_hash_create_key16_ext()
417 f->entry_size = entry_size; in rte_table_hash_create_key16_ext()
485 f->entry_size]; in rte_table_hash_entry_add_key16_ext()
503 f->entry_size]; in rte_table_hash_entry_add_key16_ext()
[all …]
H A Drte_table_hash_key32.c71 uint32_t entry_size; member
150 uint32_t entry_size) in rte_table_hash_create_key32_lru() argument
184 KEYS_PER_BUCKET * entry_size); in rte_table_hash_create_key32_lru()
211 f->entry_size = entry_size; in rte_table_hash_create_key32_lru()
314 memcpy(&bucket->data[pos * f->entry_size], entry, f->entry_size); in rte_table_hash_entry_add_key32_lru()
366 uint32_t entry_size) in rte_table_hash_create_key32_ext() argument
398 KEYS_PER_BUCKET * entry_size); in rte_table_hash_create_key32_ext()
427 f->entry_size = entry_size; in rte_table_hash_create_key32_ext()
499 f->entry_size]; in rte_table_hash_entry_add_key32_ext()
519 f->entry_size]; in rte_table_hash_entry_add_key32_ext()
[all …]
H A Drte_table_hash_lru.c53 uint32_t entry_size; member
142 rte_table_hash_lru_create(void *params, int socket_id, uint32_t entry_size) in rte_table_hash_lru_create() argument
154 (!rte_is_power_of_2(entry_size)) || in rte_table_hash_lru_create()
185 data_sz = RTE_CACHE_LINE_ROUNDUP(p->n_keys * entry_size); in rte_table_hash_lru_create()
214 t->entry_size = entry_size; in rte_table_hash_lru_create()
224 t->data_size_shl = __builtin_ctzl(entry_size); in rte_table_hash_lru_create()
299 memcpy(data, entry, t->entry_size); in rte_table_hash_lru_entry_add()
329 memcpy(data, entry, t->entry_size); in rte_table_hash_lru_entry_add()
348 memcpy(data, entry, t->entry_size); in rte_table_hash_lru_entry_add()
387 memcpy(entry, data, t->entry_size); in rte_table_hash_lru_entry_delete()
H A Drte_table_hash_ext.c72 uint32_t entry_size; member
165 rte_table_hash_ext_create(void *params, int socket_id, uint32_t entry_size) in rte_table_hash_ext_create() argument
177 (!rte_is_power_of_2(entry_size)) || in rte_table_hash_ext_create()
209 data_sz = RTE_CACHE_LINE_ROUNDUP(p->n_keys * entry_size); in rte_table_hash_ext_create()
236 t->entry_size = entry_size; in rte_table_hash_ext_create()
247 t->data_size_shl = __builtin_ctzl(entry_size); in rte_table_hash_ext_create()
325 memcpy(data, entry, t->entry_size); in rte_table_hash_ext_entry_add()
358 memcpy(data, entry, t->entry_size); in rte_table_hash_ext_entry_add()
389 memcpy(data, entry, t->entry_size); in rte_table_hash_ext_entry_add()
431 memcpy(entry, data, t->entry_size); in rte_table_hash_ext_entry_delete()
H A Drte_table.h53 uint32_t entry_size);
H A Drte_table_stub.c32 __rte_unused uint32_t entry_size) in rte_table_stub_create() argument
/dpdk/app/test/
H A Dtest_table_tables.c298 uint32_t entry_size = sizeof(entry); in test_table_lpm() local
306 .entry_unique_size = entry_size, in test_table_lpm()
341 lpm_params.entry_unique_size = entry_size; in test_table_lpm()
464 uint32_t entry_size = sizeof(entry); in test_table_lpm_ipv6() local
471 .entry_unique_size = entry_size, in test_table_lpm_ipv6()
906 uint32_t entry_size = 1; in test_table_hash_cuckoo() local
927 0, entry_size); in test_table_hash_cuckoo()
935 0, entry_size); in test_table_hash_cuckoo()
943 0, entry_size); in test_table_hash_cuckoo()
951 0, entry_size); in test_table_hash_cuckoo()
[all …]
/dpdk/drivers/net/bnxt/tf_core/
H A Dtf_em_common.c374 uint32_t entry_size, in tf_em_size_page_tbl_lvl() argument
383 data_size = (uint64_t)num_entries * entry_size; in tf_em_size_page_tbl_lvl()
425 if (!tbl->entry_size && !tbl->num_entries) in tf_em_size_table()
429 if (!tbl->entry_size || !tbl->num_entries) in tf_em_size_table()
440 num_entries = tbl->num_entries / tbl->entry_size; in tf_em_size_table()
453 tbl->entry_size, in tf_em_size_table()
460 tbl->type, (uint64_t)num_entries * tbl->entry_size, in tf_em_size_table()
635 tbl_scope_cb->em_ctx_info[TF_DIR_RX].em_tables[TF_KEY0_TABLE].entry_size = in tf_em_validate_num_entries()
640 tbl_scope_cb->em_ctx_info[TF_DIR_RX].em_tables[TF_KEY1_TABLE].entry_size = in tf_em_validate_num_entries()
664 tbl_scope_cb->em_ctx_info[TF_DIR_TX].em_tables[TF_KEY0_TABLE].entry_size = in tf_em_validate_num_entries()
[all …]
H A Dtf_em_host.c299 if (tbl->num_entries != 0 && tbl->entry_size != 0) { in tf_em_ctx_unreg()
335 if (tbl->num_entries && tbl->entry_size) { in tf_em_ctx_reg()
500 em_tables[TF_RECORD_TABLE].entry_size); in tf_em_ext_alloc()
H A Ddpool.h306 uint32_t entry_size,
H A Ddpool.c85 uint32_t entry_size, in dpool_defrag() argument
170 largest_free_size >= entry_size) in dpool_defrag()
H A Dtf_msg.c1116 if (tbl->num_entries && tbl->entry_size) { in tf_msg_ext_em_ctxt_mem_alloc()
1118 mem_size_k = (tbl->num_entries / TF_KILOBYTE) * tbl->entry_size; in tf_msg_ext_em_ctxt_mem_alloc()
/dpdk/lib/flow_classify/
H A Drte_flow_classify.c26 uint32_t entry_size; member
376 uint32_t entry_size; in rte_flow_classify_table_create() local
385 entry_size = sizeof(struct rte_flow_classify_table_entry); in rte_flow_classify_table_create()
389 entry_size); in rte_flow_classify_table_create()
405 table->entry_size = entry_size; in rte_flow_classify_table_create()
/dpdk/lib/pipeline/
H A Drte_pipeline.c84 uint32_t entry_size; member
331 uint32_t entry_size, id; in rte_pipeline_table_create() local
343 entry_size = sizeof(struct rte_pipeline_table_entry) + in rte_pipeline_table_create()
346 "PIPELINE", entry_size, RTE_CACHE_LINE_SIZE, p->socket_id); in rte_pipeline_table_create()
355 entry_size); in rte_pipeline_table_create()
371 table->entry_size = entry_size; in rte_pipeline_table_create()
438 memcpy(table->default_entry, default_entry, table->entry_size); in rte_pipeline_table_default_entry_add()
468 memcpy(entry, table->default_entry, table->entry_size); in rte_pipeline_table_default_entry_delete()
471 memset(table->default_entry, 0, table->entry_size); in rte_pipeline_table_default_entry_delete()
/dpdk/drivers/net/bnxt/hcapi/cfa/
H A Dhcapi_cfa_defs.h204 uint32_t entry_size; member
/dpdk/drivers/net/qede/base/
H A Decore_hsi_debug_tools.h488 u8 entry_size /* size of registers entry (in dwords) */; member
/dpdk/doc/guides/prog_guide/
H A Dpacket_framework.rst562 …| 4 | Data array | n_keys | entry_size (configurable) | Key val…
835 …| | | | 64 + 4 x entry_size | …
840 …| | | | 128 + 4 x entry_size | …
846 …| | | | 64 + 4 x entry_size | …
851 …| | | | 128 + 4 x entry_size | …
883 …| 4 | Data [0 .. 3] | 4 x entry_size | Full key values (key data) associated with keys 0 .. 3.…
H A Dflow_classify_lib.rst199 uint32_t entry_size;
/dpdk/drivers/net/qede/
H A Dqede_debug.c3608 reg->entry_size; in qed_idle_chk_dump_failure()
3615 reg_hdr->size = reg->entry_size; in qed_idle_chk_dump_failure()
3793 reg->entry_size > 1 ? in qed_idle_chk_dump_rule_entries()
3794 OSAL_ROUNDUP_POW_OF_TWO(reg->entry_size) : in qed_idle_chk_dump_rule_entries()
3801 if (next_reg_offset + reg->entry_size >= in qed_idle_chk_dump_rule_entries()
3813 reg->entry_size, in qed_idle_chk_dump_rule_entries()

12