Home
last modified time | relevance | path

Searched refs:tables (Results 1 – 25 of 46) sorted by relevance

12

/dpdk/lib/pipeline/
H A Drte_swx_ctl.c143 struct table *tables; member
190 struct table *table = &ctl->tables[i]; in table_find()
732 if (!ctl->tables) in table_free()
750 free(ctl->tables); in table_free()
751 ctl->tables = NULL; in table_free()
1248 if (!ctl->tables) in rte_swx_ctl_pipeline_create()
1252 struct table *t = &ctl->tables[i]; in rte_swx_ctl_pipeline_create()
1262 struct table *t = &ctl->tables[i]; in rte_swx_ctl_pipeline_create()
1466 table_id = table - ctl->tables; in rte_swx_ctl_pipeline_table_entry_add()
1580 table_id = table - ctl->tables; in rte_swx_ctl_pipeline_table_entry_delete()
[all …]
H A Drte_pipeline.c110 struct rte_table tables[RTE_PIPELINE_TABLE_MAX]; member
250 struct rte_table *table = &p->tables[i]; in rte_pipeline_free()
340 table = &p->tables[id]; in rte_pipeline_table_create()
421 table = &p->tables[table_id]; in rte_pipeline_table_default_entry_add()
464 table = &p->tables[table_id]; in rte_pipeline_table_default_entry_delete()
511 table = &p->tables[table_id]; in rte_pipeline_table_entry_add()
566 table = &p->tables[table_id]; in rte_pipeline_table_entry_delete()
612 table = &p->tables[table_id]; in rte_pipeline_table_entry_add_bulk()
671 table = &p->tables[table_id]; in rte_pipeline_table_entry_delete_bulk()
1345 table = &p->tables[table_id]; in rte_pipeline_run()
[all …]
/dpdk/examples/pipeline/examples/
H A Dlearner.spec4 ; The learner tables are very useful for learning and connection tracking.
6 ; As opposed to regular tables, which are read-only for the data plane, the learner tables can be
H A Dfib.spec5 ; data plane copy of the routing table. The VRF support allows for multiple logical routing tables
/dpdk/doc/guides/prog_guide/
H A Dpacket_framework.rst36 through the set of tables in a tree-like topology.
167 …| | | Typically used to implement flow classification tables, ARP cac…
259 Hash tables are important because the key lookup operation is optimized for speed:
707 (for extendable bucket hash tables only) is relatively small.
941 #. For extendable bucket hash tables only,
958 #. The set of tables;
962 …ut ports are connected with the output ports through tree-like topologies of interconnected tables.
970 output ports and tables have been created.
981 …Different tables can have entries (including default table entry) connected to the same output por…
1020 tables and output ports through the pipeline.
[all …]
H A Dgeneric_receive_offload_lib.rst66 by ``rte_gro_ctx_create()``. ``rte_gro_ctx_create()`` allocates tables
72 either merged with the existed packets in the tables or inserted into the
73 tables. Finally, applications use ``rte_gro_timeout_flush()`` to flush
74 packets from the tables, when they want to get the GROed packets.
H A Dflow_classify_lib.rst19 The library is table agnostic and can use the following tables:
188 /** elements (tables) should be allocated */
217 /* classifier tables */
218 struct rte_cls_table tables[RTE_FLOW_CLASSIFY_TABLE_MAX];
H A Dlpm6_lib.rst69 * A number of tables, configurable by the user through the API, with 2^8 entries
72 while the rest of the tables, called tbl8s,
81 By splitting the process in different tables/levels and limiting the number of tbl8s,
108 Both types of tables share the same structure.
H A Dhash_lib.rst65 The example hash tables in the L2/L3 Forwarding sample applications define which port to forward a …
122 The hash table has two main tables:
185 the first and second tables. However, in the very unlikely event that a key can't be inserted after…
210 See the tables below showing example entry distribution as table utilization increases.
258 Last values on the tables above are the average maximum table
H A Defd_lib.rst17 use storage metadata tables to forward I/O requests to the correct back end
19 flows to signatures in flow tables to send incoming packets to their
107 millions of flow keys. Large tables will usually not fit in
130 thereby consumes much less space than conventional flow-based tables.
H A Dthread_safety_dpdk_functions.rst31 Another alternative to locking would be to create multiple instances of these tables allowing each …
H A Dlpm_lib.rst54 * A number of tables (RTE_LPM_TBL8_NUM_GROUPS) with 2^8 entries.
65 By splitting the process in two different tables/levels and limiting the number of tbl8s,
H A Dfib_lib.rst119 By splitting the process into two different tables/levels and limiting the number of tbl8s,
/dpdk/lib/flow_classify/
H A Drte_flow_classify.c45 struct rte_cls_table tables[RTE_FLOW_CLASSIFY_TABLE_MAX]; member
313 struct rte_cls_table *table = &cls->tables[i]; in rte_flow_classifier_free()
397 table = &cls->tables[cls->num_tables]; in rte_flow_classify_table_create()
534 struct rte_cls_table *table = &cls->tables[i]; in rte_flow_classify_table_entry_add()
571 struct rte_cls_table *table = &cls->tables[i]; in rte_flow_classify_table_entry_delete()
653 struct rte_cls_table *table = &cls->tables[i]; in rte_flow_classifier_query()
/dpdk/drivers/net/ixgbe/
H A Dmeson.build28 cflags += ['-fno-asynchronous-unwind-tables']
/dpdk/drivers/net/ice/base/
H A Dmeson.build44 cflags += ['-fno-asynchronous-unwind-tables']
/dpdk/
H A D.gitignore4 # ignore generated documentation tables
/dpdk/drivers/net/iavf/
H A Dmeson.build25 cflags += ['-fno-asynchronous-unwind-tables']
/dpdk/drivers/net/ice/
H A Dmeson.build24 cflags += ['-fno-asynchronous-unwind-tables']
/dpdk/drivers/net/i40e/
H A Dmeson.build31 cflags += ['-fno-asynchronous-unwind-tables']
/dpdk/app/test/
H A Dtest_table.h175 struct rte_table tables[64]; member
/dpdk/doc/guides/sample_app_ug/
H A Dip_pipeline.rst14 of input/output ports, tables and actions in a modular way. Multiple pipelines can be inter-connect…
18 one or several pipelines. The possibilities of creating pipelines out of ports, tables and actions,…
29 …tion profiles: used to define the actions to be executed by pipeline input/output ports and tables.
30 …* Pipeline components: input/output ports, tables, pipelines, mapping of pipelines to execution th…
H A Dtest_pipeline.rst60 The hash tables are pre-populated with 16 million keys.
61 For hash tables, the following parameters can be selected:
H A Dpipeline.rst15 The CLI can also be used to update the pipeline tables or poll the pipeline statistics.
H A Dip_frag.rst46 global l3fwd_ipv4_route_array and l3fwd_ipv6_route_array tables.

12