Home
last modified time | relevance | path

Searched refs:search (Results 1 – 25 of 43) sorted by relevance

12

/dpdk/drivers/net/mlx4/
H A Dmeson.build86 # input array for meson member search:
87 # [ "MACRO to define if found", "header for the search",
88 # "symbol to search", "struct member to search" ]
94 # input array for meson symbol search:
95 # [ "MACRO to define if found", "header for the search",
96 # "symbol to search" ]
/dpdk/drivers/net/tap/
H A Dmeson.build21 # input array for meson symbol search:
22 # [ "MACRO to define if found", "header for the search",
23 # "enum/define", "symbol to search" ]
/dpdk/drivers/common/mlx5/linux/
H A Dmeson.build58 # input array for meson member search:
59 # [ "MACRO to define if found", "header for the search",
60 # "symbol to search", "struct member to search" ]
71 # input array for meson symbol search:
72 # [ "MACRO to define if found", "header for the search",
73 # "symbol to search" ]
/dpdk/drivers/crypto/bcmfs/
H A Dbcmfs_device.c175 fsdev_find_all_devs(const char *path, const char *search, in fsdev_find_all_devs() argument
191 if (strstr(entry->d_name, search)) { in fsdev_find_all_devs()
209 fsdev_find_sub_dir(char *path, const char *search, char *output) in fsdev_find_sub_dir() argument
221 if (!strcmp(entry->d_name, search)) { in fsdev_find_sub_dir()
/dpdk/doc/guides/prog_guide/
H A Dpacket_classif_access_ctrl.rst10 The ACL library is used to perform an N-tuple search over a set of rules with multiple categories
37 …erformance reasons - search function processes the first input byte as part of the flow setup and …
76 This is the offset from the beginning of the buffer parameter for the search.
222 In the following example the last element of the search key is 8-bit long.
268 * Next element of search key (Type of Service) is indeed 1 byte long.
300 …This effectively provides a "parallel lookup" by enabling a single search to return multiple resul…
312 …When the search is performed for an input tuple, all fields in that tuple must be in network byte …
367 …xt has finished successfully, it can be used to perform classification - search for a rule with hi…
395 …efault classifier function for a given ACL context or perform particular search using non-default …
H A Dpacket_framework.rst196 …| 4 | Pattern matching search | Lookup key is the packet payload. …
260 instead of having to linearly search the lookup key through all the keys in the table,
261 the search is limited to only the keys stored in a single table bucket.
306 so the key search can be narrowed down from the full set of keys currently in the table
455 and performs the bucket search step of the key lookup operation.
459 and also performs the bucket search step of the key lookup operation.
492 The bucket search logic handles multiple input packets in parallel.
501 The bucket search logic is broken into pipeline stages at the boundary of the next memory access.
528 The bucket search logic is also implemented without using any branch instructions.
699 a non-optimized implementation of the bucket search algorithm is executed.
[all …]
H A Dfib_lib.rst7 The FIB library provides a fast Longest Prefix Match (LPM) search for 32-bit
35 search within FIB. The size of the next hop ID is variable and must be configured
H A Defd_lib.rst147 for the library), then, for each small group, a brute force search to find
332 Focusing on one group that has four keys, :numref:`figure_efd8` depicts the search
347 The insert function will brute force search for all possible values for the
371 slow, because of perfect hash search as previously discussed).
397 the brute force search for the perfect hash terminates with a valid hash
H A Dlpm_lib.rst9 The DPDK LPM library component implements the Longest Prefix Match (LPM) table search method for 32…
87 whether the search process have finished or not respectively.
H A Dlpm6_lib.rst7 The LPM6 (LPM for IPv6) library component implements the Longest Prefix Match (LPM) table search me…
106 and whether the search process have finished or not respectively.
H A Dipsec_lib.rst253 The search key is represented by:
H A Dbuild-sdk-meson.rst180 the EAL, the default search path for drivers will be set to the configured
H A Dtrace_lib.rst210 an interface to search for a particular event.
H A Dmember_lib.rst171 search all set-summaries is a big throughput advantage. In the library, certain
263 sequential search of sub-tables.
H A Drte_flow.rst827 If search is enabled, offset is used as the starting point. The search area
846 | | ``search`` | search pattern from offset (see also ``limit``) |
852 | | ``limit`` | search area limit for start of ``pattern`` |
881 | | | | ``search`` | 1 |
893 | | | | ``search`` | 0 |
905 | | | | ``search`` | 0 |
/dpdk/kernel/linux/
H A Dmeson.build62 # search for '-target' and use the arg that follows
/dpdk/drivers/net/mlx5/
H A Dmlx5_flow_verbs.c468 const enum ibv_flow_spec_type search = eth->type; in flow_verbs_item_vlan_update() local
473 if (hdr->type == search) { in flow_verbs_item_vlan_update()
845 enum ibv_flow_spec_type search, in flow_verbs_item_gre_ip_protocol_update() argument
855 if (hdr->type == search) { in flow_verbs_item_gre_ip_protocol_update()
861 switch (search) { in flow_verbs_item_gre_ip_protocol_update()
/dpdk/drivers/common/cnxk/
H A Droc_npc.h55 uint32_t search : 1; /**< Search pattern from offset. */ member
H A Droc_npc_parse.c91 if (raw_spec->relative == 0 || raw_spec->search || raw_spec->limit || in npc_parse_pre_l2()
/dpdk/doc/guides/nics/
H A Dmvneta.rst65 the search box.
H A Dice.rst20 `https://www.intel.com/content/www/us/en/search.html?ws=text#q=e810&t=Downloads&layout=table`.
/dpdk/lib/ethdev/
H A Drte_flow.h838 uint32_t search:1; /**< Search pattern from offset (see also limit). */ member
850 .search = 1,
H A Drte_flow.c577 .search = src.raw->search, in rte_flow_conv_item_spec()
/dpdk/drivers/net/mvpp2/
H A Dmrvl_flow.c1270 if (mask->search && spec->search) { in mrvl_parse_raw()
/dpdk/doc/guides/freebsd_gsg/
H A Dbuild_dpdk.rst64 may not be in the default search paths for `.pc` files, which means

12