Home
last modified time | relevance | path

Searched refs:elements (Results 1 – 25 of 32) sorted by relevance

12

/dpdk/drivers/net/i40e/base/
H A Di40e_diag.c92 i40e_reg_list[i].elements = hw->func_caps.num_tx_qp; in i40e_diag_reg_test()
99 i40e_reg_list[i].elements = in i40e_diag_reg_test()
104 for (j = 0; j < i40e_reg_list[i].elements && in i40e_diag_reg_test()
H A Di40e_diag.h20 u32 elements; /* number of elements if array */ member
/dpdk/doc/guides/prog_guide/
H A Dmember_lib.rst22 set-summary rather than operating on a "full-blown" complete list of elements:
24 elements themselves, and secondly checking an element membership (or other
26 original full-blown complete list of elements.
37 include a list of elements while a complete list requires too much space
132 membership of elements is checked against the BF. The example discussed
211 probability. Furthermore, if elements are allowed to be
226 elements, which can be expensive. However, if we allow new elements to overwrite
227 or evict existing elements (as a cache typically does), then the resulting
235 elements, the set-summary can keep track of the most recent elements
236 (i.e. active) as a cache typically does. Old inactive elements (infrequently
[all …]
H A Dstack_lib.rst45 The lock-free stack consists of a linked list of elements, each containing a
57 The lock-free pop operation first reserves one or more list elements by
63 The linked list elements themselves are maintained in a lock-free LIFO, and are
65 fixed maximum depth, these elements do not need to be dynamically created.
H A Deventdev.rst77 The rte_event_vector struct contains a vector of elements defined by the event
81 * ``nb_elem`` - The number of elements held within the vector.
88 * ``uint64_t *u64s[0]`` - An array of uint64_t elements.
90 The size of the event vector is related to the total number of elements it is
95 cache size, number of elements in each ``rte_event_vector`` and socket id.
H A Dring_lib.rst16 * Objects can be pointers or elements of multiple of 4 byte size
113 The prod_next local variable points to the next element of the table, or several elements after in …
166 The cons_next local variable points to the next element of the table, or several elements after in …
220 or several elements after in the case of bulk enqueue.
H A Dgeneric_segmentation_offload_lib.rst78 the elements produced by the API are also called 'segments', for clarity the
189 pool, containing smaller elements, for the indirect pool.
H A Denv_abstraction_layer.rst906 Example of a malloc heap and malloc elements within the malloc library
925 previous and next elements. Due to the fact that hugepage memory can come and
926 go, neighboring malloc elements may not necessarily be adjacent in memory.
955 * free_list - this is a structure pointing to previous and next elements in
974 Dirty elements only appear with ``--huge-unlink=never``.
1028 on the free list just has its size value adjusted, and the next/previous elements
1069 and next elements. These next and previous elements are then checked to see if
H A Dwriting_efficient_code.rst103 meaning that it is possible to read several elements from the ring with only one costly atomic oper…
114 /* Process as many elements as can be dequeued. */
H A Dfib_lib.rst96 The main elements of the dataplane struct for the DIR-24-8 algorithm are:
H A Doverview.rst87 The *core components* are a set of libraries that provide all the elements needed
H A Dflow_classify_lib.rst188 /** elements (tables) should be allocated */
H A Dlpm_lib.rst50 The main data structure is built using the following elements:
H A Dlpm6_lib.rst65 The main data structure is built using the following elements:
H A Dhash_lib.rst201 As mentioned above, Cuckoo hash implementation pushes elements out of their bucket,
/dpdk/doc/guides/tools/
H A Dproc_info.rst69 The iter-mempool parameter iterates and displays mempool elements specified
70 by name. For invalid or no mempool name no elements are displayed.
/dpdk/drivers/net/qede/
H A Dqede_debug.c6690 struct reg_fifo_element *elements; in qed_parse_reg_fifo_dump() local
6744 elements[i].data, in qed_parse_reg_fifo_dump()
6745 (u32)GET_FIELD(elements[i].data, in qed_parse_reg_fifo_dump()
6750 (u32)GET_FIELD(elements[i].data, in qed_parse_reg_fifo_dump()
6753 (u32)GET_FIELD(elements[i].data, in qed_parse_reg_fifo_dump()
6918 struct igu_fifo_element *elements; in qed_parse_igu_fifo_dump() local
6974 struct protection_override_element *elements; in qed_parse_protection_override_dump() local
7005 u32 address = GET_FIELD(elements[i].data, in qed_parse_protection_override_dump()
7014 (u32)GET_FIELD(elements[i].data, in qed_parse_protection_override_dump()
7016 (u32)GET_FIELD(elements[i].data, in qed_parse_protection_override_dump()
[all …]
/dpdk/doc/guides/rel_notes/
H A Drelease_16_07.rst83 Scatter-gather elements is set to the maximum value the NIC supports.
85 * Improved jumbo frames support, by dynamically setting RX scatter gather elements
H A Drelease_17_05.rst329 the number elements remaining in the ring after dequeue.
332 operate on multiple packets now return the number of elements enqueued
H A Drelease_2_1.rst774 incorrectly only checking the first 16 elements of the array instead of
983 Compute Engine allows up to 16K elements in ring.
/dpdk/doc/guides/sample_app_ug/
H A Dqos_scheduler.rst81 * B = Size (in number of elements) of each of the software rings used
/dpdk/doc/guides/contributing/
H A Ddocumentation.rst700 /** Number of elements in the elt_pa array. */
716 /** Number of elements in the elt_pa array. */
H A Dcoding_style.rst250 * Enum types should be prefixed with ``rte_`` and the elements by a suitable prefix [generally star…
343 DPDK also provides an optimized way to store elements in lockless rings.
1101 …* For a small number of list entries, generally 3 or fewer, all elements may be put on a single li…
/dpdk/doc/guides/rawdevs/
H A Dioat.rst232 informs the device hardware of the elements enqueued on the ring, and the
/dpdk/doc/guides/testpmd_app_ug/
H A Drun_app.rst509 Set the number of maximum elements of the FIFO queue to be created

12