Home
last modified time | relevance | path

Searched refs:lookup (Results 1 – 25 of 56) sorted by relevance

123

/dpdk/doc/guides/prog_guide/
H A Dfib_lib.rst45 * ``rte_fib_lookup_bulk()``: Provides a bulk Longest Prefix Match (LPM) lookup function
77 algorithm that trades memory usage for improved LPM lookup speed.
78 This algorithm allows the lookup operation to be performed using only a single
80 match rule has a depth larger than 24, the lookup operation will require two
102 The lookup algorithms logic can be seen in :numref:`figure_dir_24_8_alg`:
113 to a rule stored in the tbl24 we might need to continue the lookup process in the second level.
120 we can greatly reduce memory consumption while maintaining a very good lookup speed.
121 This method generally results in one memory access per lookup.
127 * 1 bit indicating if the lookup should proceed inside the tbl8.
140 corresponding to a given prefix without having to perform an additional lookup.
H A Dpacket_framework.rst27 with the logic of each stage glued around a lookup table.
38 one of the table entries (on lookup hit) or the default table entry (on lookup miss)
190 …| | | The table lookup operation selects the ACL that is matched by t…
239 …| | | lookup operation for each packet: a set bit signifies lookup hit for the c…
242 …| | | For each lookup hit packet, the lookup operation also returns a pointer to…
276 #. *lookup key*: When no value is currently associated with *key*, then this operation returns vo…
451 The key lookup operation is split between two CPU cores.
457 #. **Key signature computed on lookup ("do-sig" version).**
704 …executing the non-optimized version, some of these packets may produce a lookup hit or lookup miss.
773 …umref:`table_qos_29`, the lookup tables for *match* and *match_many* can be collapsed into a singl…
[all …]
H A Defd_lib.rst25 key itself and hence lookup performance is not dependent on the key
98 As shown in :numref:`figure_efd3`, when doing a lookup, the flow-table
108 the CPU cache, and hence, the lookup performance is degraded because of
131 The lookup operation is very simple, similar to a computational-based
132 scheme: given an input key the lookup operation is reduced to hashing
150 It should be mentioned that, since the online lookup table for EFD
152 of the key size and hence EFD lookup performance which is almost
229 socket as where the lookup thread is running.
260 function calls per key, it is always recommended to use a bulk lookup
262 lookup function. ``rte_efd_lookup_bulk()`` is the bulk lookup function,
[all …]
H A Dlpm_lib.rst44 The algorithm allows the lookup operation to be performed with typically a single memory read acces…
46 the lookup operation requires two memory read accesses.
47 Therefore, the performance of the LPM lookup operation is greatly influenced by
59 we might need to continue the lookup process in the second level.
84 The first field can either contain a number indicating the tbl8 in which the lookup process should …
107 without having to actually perform a lookup.
123 (meaning the lookup process ends at this point, since this is the longest prefix that matches).
132 (meaning the lookup process must continue since the rule hasn't been explored completely).
142 By doing this we ensure that during the lookup process, if a rule matching the IP address exists,
174 the tbl8 group entries. This might result in incorrect lookup results.
[all …]
H A Dlpm6_lib.rst59 The algorithm allows the lookup operation to be performed with a number of memory accesses
75 or the subsequent tbl8s we might need to continue the lookup process in deeper levels of the tree.
82 we can greatly reduce memory consumption while maintaining a very good lookup speed (one memory acc…
102 The first field can either contain a number indicating the tbl8 in which the lookup process should …
114 without having to actually perform a lookup.
129 and the external entry flag to 0 (meaning the lookup process ends at this point,
140 (meaning the lookup process must continue since the rule hasn't been explored completely).
154 By doing this we ensure that during the lookup process, if a rule matching the IP address exists,
165 The lookup process is much simpler and quicker. In this case:
176 * Repeat the process until either we find an invalid entry (lookup miss) or a valid entry with th…
H A Dhash_lib.rst10 The DPDK provides a Hash Library for creating hash table for fast lookup.
40 …then the position of the entry is returned, otherwise (i.e., lookup miss) a negative value is retu…
44 * Add / lookup / delete entry with key and precomputed hash: Both the key and its precomputed has…
47 * Add / lookup entry with key and data: A data is provided as input for add. Add allows the user …
138 delete, and lookup operations is reduced to the entries in those buckets (it is very likely that en…
147 Example of lookup:
157 Like lookup, the primary and secondary buckets are identified. If there is an empty entry in
176 Similar to lookup, the key is searched in its primary and secondary buckets. If the key is found, t…
189 In case of lookup for a certain key, as before, the primary bucket is searched for a match and then…
297 …If the returned position is valid (flow lookup hit), use the returned position to access the flow …
[all …]
H A Dipsec_lib.rst202 The key type reflects a set of tuple fields that will be used for lookup of the SA.
229 to eliminate byteswap on lookup
250 Library provides lookup by the given {SPI,DIP,SIP} tuple of
282 As an example, lookup related code could look like that:
H A Dgraph_lib.rst12 create, lookup, dump and destroy on graph and node operations such as clone,
100 gives the ID as ``rte_node_t`` type. Both ID or Name shall be used lookup the
102 lookup functions.
372 This node is an intermediate node that does LPM lookup for the received
375 On successful LPM lookup, the result contains the ``next_node`` id and
378 On LPM lookup failure, objects are redirected to pkt_drop node.
H A Dmember_lib.rst120 lookup and full element comparison. The advantage of using a BF is to simplify
122 small bit-vector, which can be easily optimized. Hence the lookup throughput
124 lookup with element comparison.
170 filters with sequential lookup of each BF. However, being able to concurrently
271 insertion, deletion, and lookup.
330 set-summary structure for their first match. Each key lookup returns as soon as the first match is …
356 set-summary structure for multiple matches, each key lookup returns ALL the matches (possibly more
/dpdk/doc/guides/sample_app_ug/
H A Dtest_pipeline.rst101 … | The default table rule (used in the case of a lookup |
104 … | At run time, core A is creating the following lookup |
106 … | core B to use for table lookup: …
124 … | The default table rule (used in the case of a lookup |
127 … | At run time, core A is creating the following lookup |
129 … | B to use for table lookup: …
147 … | The default table rule (used in the case of a lookup |
150 … | At run time, core A is creating the following lookup |
152 … | Lpmcore B to use for table lookup: …
179 … | The default table rule (used in the case of a lookup |
[all …]
H A Dl3_forward.rst25 The lookup method is hash-based, LPM-based or FIB-based
27 When the selected lookup method is hash-based,
31 The hash lookup key is represented by a DiffServ 5-tuple composed of the following fields read from…
35 When the selected lookup method is LPM or FIB based,
40 The LPM and FIB lookup keys are represented by the destination IP address field
43 returned by the LPM or FIB lookup.
68 [--lookup LOOKUP_METHOD]
96 * ``--lookup:`` Optional, select the lookup method.
132 legacy flag, please use ``--lookup=em`` instead.
135 legacy flag, please use ``--lookup=lpm`` instead.
[all …]
H A Dl3_forward_graph.rst22 Difference is that forwarding logic starting from Rx, followed by LPM lookup,
27 The lookup method is as per implementation of ``ip4_lookup`` graph node.
29 the LPM lookup. The set of LPM rules used by the application is statically
196 node if LPM lookup succeeds. ``ip4_rewrite`` node then will update Ethernet header
H A Dl3_forward_access_ctrl.rst25 performs a lookup in the rule database to figure out whether the packets should be dropped (in the …
30 an exact match algorithm to perform forwarding port lookup,
31 while this application uses the ACL library to perform both ACL and route entry lookup.
71 When performing a lookup, the library assumes the input is in MSB or Big Endian order.
214 …* Lookup: Checks that the packet type is supported (IPv4/IPv6) and performs a 5-tuple lookup ove…
298 * The --alg=scalar option specifies the performing of rule lookup with a scalar function.
H A Dip_frag.rst28 The Longest Prefix Match (LPM for IPv4, LPM6 for IPv6) table is used to store/lookup an outgoing po…
48 … is, the identification of the output interface for the packet) is taken as a result of LPM lookup.
H A Dipv4_multicast.rst23 The lookup method is the Four-byte Key (FBK) hash-based method.
24 The lookup table is composed of pairs of destination IPv4 address (the FBK)
/dpdk/lib/fib/
H A Drte_fib.c43 rte_fib_lookup_fn_t lookup; /**< FIB lookup function */ member
101 fib->lookup = dummy_lookup; in init_dataplane()
108 fib->lookup = dir24_8_get_lookup_fn(fib->dp, in init_dataplane()
141 (next_hops == NULL) || (fib->lookup == NULL)), -EINVAL); in rte_fib_lookup_bulk()
143 fib->lookup(fib->dp, ips, next_hops, n); in rte_fib_lookup_bulk()
331 fib->lookup = fn; in rte_fib_select_lookup()
H A Drte_fib6.c43 rte_fib6_lookup_fn_t lookup; /**< FIB lookup function */ member
101 fib->lookup = dummy_lookup; in init_dataplane()
108 fib->lookup = trie_get_lookup_fn(fib->dp, RTE_FIB6_LOOKUP_DEFAULT); in init_dataplane()
143 (next_hops == NULL) || (fib->lookup == NULL), -EINVAL); in rte_fib6_lookup_bulk()
144 fib->lookup(fib->dp, ips, next_hops, n); in rte_fib6_lookup_bulk()
332 fib->lookup = fn; in rte_fib6_select_lookup()
/dpdk/drivers/net/nfp/nfpcore/
H A Dnfp_hwinfo.c181 nfp_hwinfo_lookup(struct nfp_hwinfo *hwinfo, const char *lookup) in nfp_hwinfo_lookup() argument
185 if (!hwinfo || !lookup) in nfp_hwinfo_lookup()
194 if (strcmp(key, lookup) == 0) in nfp_hwinfo_lookup()
H A Dnfp_hwinfo.h83 const char *nfp_hwinfo_lookup(struct nfp_hwinfo *hwinfo, const char *lookup);
/dpdk/examples/pipeline/examples/
H A Dlearner.spec8 ; takes place by having the default action (i.e. the table action which is executed on lookup miss)
9 ; explicitly add to the table with a specific action the key that just missed the lookup operation.
84 // Add the current lookup key to the table with fwd_action as the key action. The action
/dpdk/lib/eal/common/
H A Deal_common_trace_points.c61 lib.eal.memzone.lookup)
/dpdk/examples/ip_pipeline/examples/
H A Dflow_crypto.cli10 ; +-----------> SINK0 (flow lookup miss)
H A Dflow.cli14 ; +-----------> SINK0 (flow lookup miss)
/dpdk/app/test-sad/
H A Dmain.c511 lookup(void *arg) in lookup() function
660 rte_eal_mp_remote_launch(lookup, sad, SKIP_MAIN); in main()
662 lookup(sad); in main()
/dpdk/doc/guides/nics/
H A Ddpaa.rst275 Hash and exact match lookup
283 frame. There is a provision to setup exact match lookup too where field

123