Searched refs:stages (Results 1 – 17 of 17) sorted by relevance
| /dpdk/app/test/ |
| H A D | test_graph_perf.c | 318 uint32_t stages, uint16_t nodes_per_stage, in graph_init() argument 350 (nb_srcs + nb_sinks + stages * nodes_per_stage)); in graph_init() 357 (nb_srcs + nb_sinks + stages * nodes_per_stage)); in graph_init() 375 node_map = malloc(sizeof(rte_node_t *) * stages + in graph_init() 376 sizeof(rte_node_t) * nodes_per_stage * stages); in graph_init() 383 for (i = 0; i < stages; i++) { in graph_init() 385 (rte_node_t *)(node_map + stages) + nodes_per_stage * i; in graph_init() 419 for (i = 0; i < stages - 1; i++) { in graph_init() 540 node_map[stages - 1][i]); in graph_init() 563 count = rte_node_edge_update(node_map[stages - 1][i], 0, in graph_init()
|
| /dpdk/drivers/event/opdl/ |
| H A D | opdl_ring.c | 121 struct opdl_stage *stages; member 131 return &t->stages[0]; in input_stage() 775 return opdl_stage_available(&t->stages[0]); in opdl_ring_available() 888 &t->stages[i].shared; in add_dep() 950 t->stages = st; in opdl_ring_create() 1105 s = &t->stages[t->num_stages]; in opdl_stage_add() 1206 const struct opdl_stage *s = &t->stages[i]; in opdl_ring_dump() 1237 rte_free(t->stages[i].deps); in opdl_ring_free() 1238 rte_free(t->stages[i].dep_tracking); in opdl_ring_free() 1241 rte_free(t->stages); in opdl_ring_free()
|
| /dpdk/doc/guides/howto/ |
| H A D | debug_troubleshoot.rst | 8 stages making use of single or multiple threads. Applications can use poll mode 21 the root cause through step by step debug at various stages. 34 primary process, with various processing stages running on multiple cores. The 203 * Heavy processing cycles at single or multiple processing stages. 205 * Cache is spread due to the increased stages in the pipeline. 220 #. Lower performance between the pipeline processing stages can be 362 * Check for event stages if the events are looped back into the same queue.
|
| /dpdk/doc/guides/tools/ |
| H A D | testeventdev.rst | 82 determines the number of stages used in the test application. 386 number of stages as mentioned in :numref:`table_eventdev_perf_queue_test`. 389 stages through the ``--wlcores``, ``--plcores`` and the ``--stlist`` application 396 Based on the number of stages to process(selected through ``--stlist``), 620 and number of stages as mentioned in :numref:`table_eventdev_pipeline_queue_test`. 622 The user can choose the number of workers and number of stages through the 633 Based on the number of stages to process(selected through ``--stlist``), 747 and number of stages as mentioned in :numref:`table_eventdev_pipeline_atq_test`.
|
| /dpdk/doc/guides/sample_app_ug/ |
| H A D | eventdev_pipeline.rst | 13 configured for various numbers worker cores, stages,queue depths and cycles per 42 * ``-s4``: 4 atomic stages
|
| H A D | pipeline.rst | 96 Application stages
|
| H A D | ip_pipeline.rst | 110 Application stages
|
| /dpdk/drivers/raw/ifpga/base/ |
| H A D | opae_spi.h | 56 u8 stages:2; member
|
| /dpdk/doc/guides/prog_guide/ |
| H A D | overview.rst | 35 This allows work to be performed in stages and may allow more efficient use of code on cores.
|
| H A D | packet_framework.rst | 26 Packet processing applications are frequently structured as pipelines of multiple stages, 493 It is built as a pipeline of several stages (3 or 4), with each pipeline stage handling two differe… 501 The bucket search logic is broken into pipeline stages at the boundary of the next memory access. 517 By splitting the processing into several stages that are executed on different packets (the packets… 607 :numref:`figure_figure35` and :numref:`table_qos_27` detail the bucket search pipeline stages (eith…
|
| H A D | eventdev.rst | 174 Sample eventdev usage, with RX, two atomic stages and a single-link to TX.
|
| H A D | qos_framework.rst | 409 The only other work available is to execute different stages of the enqueue sequence of operations … 412 …tes a pipelined implementation for the enqueue operation with 4 pipeline stages and each stage exe… 1474 The calculation of the drop probability occurs in two stages.
|
| /dpdk/doc/guides/rel_notes/ |
| H A D | release_18_02.rst | 152 The pipeline case can be used to simulate various stages in a real world 155 across the stages of the pipeline.
|
| H A D | release_21_05.rst | 217 the events across multiple stages.
|
| /dpdk/doc/guides/contributing/ |
| H A D | vulnerability.rst | 41 In order to reduce the disclosure of a vulnerability in the early stages,
|
| /dpdk/doc/guides/nics/ |
| H A D | ice.rst | 90 ``priority``. Currently, we support two stages: priority = 0 or !0. Flows with
|
| H A D | bnxt.rst | 682 either as a single rte_flow request or a combination of two stages.
|