Home
last modified time | relevance | path

Searched refs:store (Results 1 – 25 of 60) sorted by relevance

123

/dpdk/devtools/
H A Dget-maintainer.sh21 Also refer to devtools/load-devel-config to store your configuration.
/dpdk/doc/guides/prog_guide/
H A Drib_lib.rst7 The Routing Information Base (RIB) library provides a data store for routing information.
16 RIB implements a key-value store for routing information.
52 * The size of the extension block within each node. This space is used to store
H A Dwriting_efficient_code.rst73 Modern memory controllers have several memory channels that can load or store data in parallel.
220 store operation can use RELEASE memory order.
229 be written with RELEASE memory order. This ensures that the store to guard
230 variable is observable only after the store to payload is observable.
234 can be read with RELAXED memory order. This ensures that, if the store to
235 guard variable is observable, the store to payload is also observable.
H A Defd_lib.rst24 advantages: first, because it uses perfect hashing it does not store the
89 target. The flow table (e.g. DPDK RTE Hash Library) will simply store
105 is the storage requirement, since the flow table need to store keys,
116 flow-table based schemes (because EFD doesn't store the key as explained
151 doesn't store the key itself, the size of the EFD table is independent
221 not store the keys and is used for lookups) will be allocated and
335 table will store a 16 bit hash index and 16 bit lookup table per group
H A Drcu_lib.rst175 does not have to store the token or the reference to the deleted resource. The
200 #. Has to store a reference to the deleted resources in a FIFO
204 can create a FIFO to store the references to deleted resources using ``rte_rcu_qsbr_dq_create()``.
230 …ll use. It should call ``rte_rcu_qsbr_dq_create()`` to create the FIFO to store the references to …
H A Doverview.rst112 A pool is identified by name and uses a ring to store free objects.
122 that may be used by the DPDK application to store message buffers.
H A Dgraph_lib.rst81 It is memory allocated by the library to store the node-specific context
116 The dynamic array to store the downstream nodes connected to this node. Downstream
329 Graph object consists of a header, circular buffer to store the pending
330 stream when walking over the graph, and variable-length memory to store
H A Dbpf_lib.rst40 and must not be used to store the data across these instructions.
H A Dgeneric_segmentation_offload_lib.rst179 used to store the GSO segments' packet headers.
187 buffers. However, since indirect mbufs simply store a pointer, the
232 #. Allocate space in which to store the output GSO segments. If the amount of
H A Dgeneric_receive_offload_lib.rst118 If can't find a "neighbor", store the packet into its "flow". If can't
119 find a matched "flow", insert a new "flow" and store the packet into the
H A Dip_fragment_reassembly_lib.rst87 …b) Delete a timed-out entry, free mbufs associated with it mbufs and store a new entry with specif…
H A Dhash_lib.rst47 …/ lookup entry with key and data: A data is provided as input for add. Add allows the user to store
132 to store that key in the hash table, therefore only the entries within those two buckets need to be…
184 …set, the hash table implementation still uses the same Cuckoo Hash algorithm to store the keys into
H A Dlpm6_lib.rst23 One tbl8 consumes 1 kb of memory. As a recommendation, 65536 tbl8s should be sufficient to store
78 to store every possible IPv6 rule, we would need a table with 2^128 entries.
H A Dfib_lib.rst91 Note that all available bits except one are used to store the actual next hop ID.
/dpdk/doc/guides/eventdevs/
H A Dcnxk.rst127 Chunks are used to store event timers, a chunk can be visualised as an array
129 store events. TIM traverses the list of chunks and enqueues the event timers
H A Ddsw.rst63 store them in an internal buffer in the source port.
/dpdk/
H A Dmeson.build56 # able to be included in any file. We also store a global array of include dirs
/dpdk/doc/guides/sample_app_ug/
H A Dip_reassembly.rst26 The Longest Prefix Match (LPM for IPv4, LPM6 for IPv6) table is used to store/lookup an outgoing po…
185 …#. Delete a timed-out entry, free mbufs associated with it mbufs and store a new entry with speci…
H A Dip_frag.rst28 The Longest Prefix Match (LPM for IPv4, LPM6 for IPv6) table is used to store/lookup an outgoing po…
/dpdk/doc/guides/cryptodevs/
H A Ddpaa_sec.rst31 queues, queue portals to store and to enqueue/dequeue data to the hardware SEC.
H A Ddpaa2_sec.rst32 queues, queue portals to store and to enqueue/dequeue data to the hardware SEC.
/dpdk/drivers/net/ixgbe/base/
H A Dixgbe_x550.c2177 u32 store[FW_PHY_ACT_DATA_COUNT] = { 0 }; in ixgbe_reset_phy_fw() local
2183 rc = ixgbe_fw_phy_activity(hw, FW_PHY_ACT_PHY_SW_RESET, &store); in ixgbe_reset_phy_fw()
2186 memset(store, 0, sizeof(store)); in ixgbe_reset_phy_fw()
2188 rc = ixgbe_fw_phy_activity(hw, FW_PHY_ACT_INIT_PHY, &store); in ixgbe_reset_phy_fw()
2201 u32 store[FW_PHY_ACT_DATA_COUNT] = { 0 }; in ixgbe_check_overtemp_fw() local
2204 rc = ixgbe_fw_phy_activity(hw, FW_PHY_ACT_GET_LINK_INFO, &store); in ixgbe_check_overtemp_fw()
2208 if (store[0] & FW_PHY_ACT_GET_LINK_INFO_TEMP) { in ixgbe_check_overtemp_fw()
/dpdk/doc/guides/tools/
H A Dcomp_perf.rst75 ``--seg-sz N``: size of segment to store the data (default: 2048)
/dpdk/doc/guides/nics/
H A Dfm10k.rst29 It improves load/store bandwidth efficiency of L1 data cache by using a wider
H A Dnetvsc.rst56 store it in a shell variable:

123