Home
last modified time | relevance | path

Searched refs:num_tables (Results 1 – 4 of 4) sorted by relevance

/dpdk/lib/flow_classify/
H A Drte_flow_classify.c47 uint32_t num_tables; member
312 for (i = 0; i < cls->num_tables; i++) { in rte_flow_classifier_free()
360 if (cls->num_tables == RTE_FLOW_CLASSIFY_TABLE_MAX) { in rte_table_check_params()
397 table = &cls->tables[cls->num_tables]; in rte_flow_classify_table_create()
399 cls->num_tables++; in rte_flow_classify_table_create()
533 for (i = 0; i < cls->num_tables; i++) { in rte_flow_classify_table_entry_add()
570 for (i = 0; i < cls->num_tables; i++) { in rte_flow_classify_table_entry_delete()
652 for (i = 0; i < cls->num_tables; i++) { in rte_flow_classifier_query()
/dpdk/lib/pipeline/
H A Drte_pipeline.c115 uint32_t num_tables; member
220 p->num_tables = 0; in rte_pipeline_create()
339 id = p->num_tables; in rte_pipeline_table_create()
363 p->num_tables++; in rte_pipeline_table_create()
415 if (table_id >= p->num_tables) { in rte_pipeline_table_default_entry_add()
458 if (table_id >= p->num_tables) { in rte_pipeline_table_default_entry_delete()
505 if (table_id >= p->num_tables) { in rte_pipeline_table_entry_add()
560 if (table_id >= p->num_tables) { in rte_pipeline_table_entry_delete()
606 if (table_id >= p->num_tables) { in rte_pipeline_table_entry_add_bulk()
665 if (table_id >= p->num_tables) { in rte_pipeline_table_entry_delete_bulk()
[all …]
/dpdk/app/test/
H A Dtest_table.h178 uint32_t num_tables; member
/dpdk/doc/guides/prog_guide/
H A Dflow_classify_lib.rst220 uint32_t num_tables;