| /linux/include/linux/ |
| H A D | textsearch.h | 19 * struct ts_state - search state
30 * struct ts_ops - search module operations
31 * @name: name of search algorithm
32 * @init: initialization function to prepare a search
34 * @destroy: destroy algorithm specific parts of a search configuration
53 * struct ts_config - search configuration
56 * @get_next_block: callback to fetch the next block to search in
57 * @finish: callback to finalize a search
68 * @conf: search configuration
69 * @state: search state
[all …]
|
| /linux/drivers/acpi/acpica/ |
| H A D | nssearch.c | 4 * Module Name: nssearch - Namespace search
30 * PARAMETERS: target_name - Ascii ACPI name to search for
31 * parent_node - Starting node where search will begin
37 * DESCRIPTION: Search a single level of the namespace. Performs a
38 * simple search of the specified level, and does not add
39 * entries or search parents.
46 * could be easily modified to support any improved search
47 * algorithm. However, the linear search was chosen for simplicity
53 * the linear search seems to be sufficient, as there would seem to be
54 * little value in improving the search.
[all …]
|
| /linux/drivers/net/wireless/broadcom/brcm80211/brcmfmac/ |
| H A D | flowring.c | 45 struct brcmf_flowring_tdls_entry *search; in brcmf_flowring_is_tdls_mac() local
47 search = flow->tdls_entry; in brcmf_flowring_is_tdls_mac()
49 while (search) { in brcmf_flowring_is_tdls_mac()
50 if (memcmp(search->mac, mac, ETH_ALEN) == 0) in brcmf_flowring_is_tdls_mac()
52 search = search->next; in brcmf_flowring_is_tdls_mac()
388 struct brcmf_flowring_tdls_entry *search; in brcmf_flowring_detach() local
397 search = flow->tdls_entry; in brcmf_flowring_detach()
398 while (search) { in brcmf_flowring_detach()
399 remove = search; in brcmf_flowring_detach()
400 search = search->next; in brcmf_flowring_detach()
[all …]
|
| /linux/net/netfilter/ |
| H A D | nf_conntrack_amanda.c | 62 } search[] __read_mostly = { variable
119 search[SEARCH_CONNECT].ts); in amanda_help()
122 start += dataoff + search[SEARCH_CONNECT].len; in amanda_help()
125 search[SEARCH_NEWLINE].ts); in amanda_help()
131 off = skb_find_text(skb, start, stop, search[i].ts); in amanda_help()
134 off += start + search[i].len; in amanda_help()
207 for (i = 0; i < ARRAY_SIZE(search); i++) in nf_conntrack_amanda_fini()
208 textsearch_destroy(search[i].ts); in nf_conntrack_amanda_fini()
217 for (i = 0; i < ARRAY_SIZE(search); i++) { in nf_conntrack_amanda_init()
218 search[i].ts = textsearch_prepare(ts_algo, search[i].string, in nf_conntrack_amanda_init()
[all …]
|
| /linux/lib/ |
| H A D | textsearch.c | 3 * lib/textsearch.c Generic text search interface
16 * both linear and non-linear data. Individual search algorithms are
38 * (1) User configures a search by calling textsearch_prepare() specifying
39 * the search parameters such as the pattern and algorithm name.
40 * (2) Core requests the algorithm to allocate and initialize a search
42 * (3) User starts the search(es) by calling textsearch_find() or
45 * (4) Core eventually resets the search offset and forwards the find()
57 * Before a search can be performed, a configuration must be created
66 * The actual search is performed by either calling
219 * textsearch_find_continuous - search a pattern in continuous/linear data
[all …]
|
| H A D | bsearch.c | 3 * A generic implementation of binary search for the Linux kernel
14 * bsearch - binary search an array of elements
16 * @base: pointer to first element to search
21 * This function does a binary search on the given array. The
|
| /linux/drivers/pci/ |
| H A D | search.c | 134 * @domain: number of PCI domain to search
159 * @from: Previous PCI bus found, or %NULL for new search.
161 * Iterates through the list of known PCI buses. A new search is
255 * @from: Previous PCI device found in search, or %NULL for new search.
260 * A new search is initiated by passing %NULL as the @from argument. Otherwise
265 * This is an internal function for use by the other search functions in
291 * @from: Previous PCI device found in search, or %NULL for new search.
296 * incremented. Otherwise, %NULL is returned. A new search is initiated by
320 * @from: Previous PCI device found in search, or %NULL for new search.
325 * Otherwise, %NULL is returned. A new search is initiated by passing %NULL
[all …]
|
| /linux/drivers/md/bcache/ |
| H A D | bset.h | 47 * We implement code here for creating and maintaining auxiliary search trees
54 * to search entire btree nodes and iterate over them in sorted order.
58 * point (if you pass it a search key) or the start of the btree node.
60 * AUXILIARY SEARCH TREES:
62 * Since keys are variable length, we can't use a binary search on a bset - we
73 * set; they index one key every BSET_CACHELINE bytes, and then a linear search
77 * into, we construct a binary search tree in an array - traversing a binary
78 * search tree in an array gives excellent locality of reference and is very
88 * Nodes in the auxiliary search tree must contain both a key to compare against
93 * search tree corresponds to precisely BSET_CACHELINE bytes in the set. We have
[all …]
|
| H A D | bset.c | 240 /* Auxiliary search trees */
260 * the auxiliar search tree - when we're done searching the bset_float tree we
261 * have this many bytes left that we do a linear search over.
265 * cacheline in the linear search - but the linear search might stop before it
282 /* Space required for the auxiliary search trees */
369 /* Binary tree stuff for auxiliary search trees */
513 * t->tree is a binary search tree in an array; each node corresponds to a key
560 * maintain a full search tree, we just keep a simple lookup table in t->prev.
687 * accelerate bkey search in a btree node (pointed by bset_tree->data in
688 * memory). After search in the auxiliar tree by calling bset_search_tree(),
[all …]
|
| /linux/fs/bcachefs/ |
| H A D | bset.h | 47 * We implement code here for creating and maintaining auxiliary search trees
54 * to search entire btree nodes and iterate over them in sorted order.
58 * point (if you pass it a search key) or the start of the btree node.
60 * AUXILIARY SEARCH TREES:
62 * Since keys are variable length, we can't use a binary search on a bset - we
73 * set; they index one key every BSET_CACHELINE bytes, and then a linear search
77 * into, we construct a binary search tree in an array - traversing a binary
78 * search tree in an array gives excellent locality of reference and is very
88 * Nodes in the auxiliary search tree must contain both a key to compare against
93 * search tree corresponds to precisely BSET_CACHELINE bytes in the set. We have
[all …]
|
| H A D | eytzinger.h | 19 * search over an array. Binary search is a worst case scenario for branch
246 /* return greatest node <= @search, or -1 if not found */
248 cmp_func_t cmp, const void *search) in eytzinger0_find_le() argument
257 n = eytzinger0_child(i, cmp(base + i * size, search) <= 0); in eytzinger0_find_le()
262 * @i was greater than @search, return previous node: in eytzinger0_find_le()
274 cmp_func_t cmp, const void *search) in eytzinger0_find_gt() argument
276 ssize_t idx = eytzinger0_find_le(base, nr, size, cmp, search); in eytzinger0_find_gt()
279 * if eytitzinger0_find_le() returned -1 - no element was <= search - we in eytzinger0_find_gt()
290 cmp_func_t cmp, const void *search) in eytzinger0_find_ge() argument
292 ssize_t idx = eytzinger0_find_le(base, nr, size, cmp, search); in eytzinger0_find_ge()
[all …]
|
| H A D | bset.c | 295 /* Auxiliary search trees */
394 /* Binary tree stuff for auxiliary search trees */
399 * t->tree is a binary search tree in an array; each node corresponds to a key
478 * maintain a full search tree, we just keep a simple lookup table in t->prev.
1044 struct bpos *search) in bset_search_write_set() argument
1051 if (bpos_lt(rw_aux_tree(b, t)[m].k, *search)) in bset_search_write_set()
1094 const struct bpos *search, in bset_search_tree() argument
1121 cmp = bkey_cmp_p_or_unp(b, k, packed_search, search); in bset_search_tree()
1148 struct bpos *search, in __bch2_bset_search() argument
1153 * First, we search for a cacheline, then lastly we do a linear search in __bch2_bset_search()
[all …]
|
| /linux/tools/include/linux/ |
| H A D | find.h | 25 * @addr: The address to base the search on
53 * @addr1: The first address to base the search on
54 * @addr2: The second address to base the search on
83 * @addr: The address to base the search on
111 * @addr: The address to start the search at
112 * @size: The maximum number of bits to search
133 * @addr1: The first address to base the search on
134 * @addr2: The second address to base the search on
158 * @addr: The address to start the search at
159 * @size: The maximum number of bits to search
|
| /linux/Documentation/kbuild/ |
| H A D | kconfig.rst | 11 navigation, search, and other general help text.
168 The Search function searches for kernel configuration symbol
178 For search help, enter / followed by TAB-TAB (to highlight
180 regular expressions (regexes) in the search string, so if you
188 is when the search matches the complete symbol name);
202 search results after exiting this new menu.
240 You can search either in the menu entry "prompt" strings
243 Use / to begin a search through the menu entries. This does
246 terminate the search mode.
253 current search results after exiting this new menu.
[all …]
|
| /linux/Documentation/security/keys/ |
| H A D | request-key.rst | 105 search notes that the session keyring has auth key V in its bottom level.
107 This will permit it to then search the keyrings of process A with the
149 The Search Algorithm
152 A search of any particular keyring proceeds in the following fashion:
155 firstly calls key_permission(SEARCH) on the keyring it's starting with,
156 if this denies permission, it doesn't search further.
159 matches the criteria specified, calls key_permission(SEARCH) on it to see
161 not, the search continues, and the error code is retained if of higher
165 searching. It calls key_permission(SEARCH) on each keyring, and if this
206 EACCES/EPERM are only returned on a direct search of a specific keyring where
[all …]
|
| /linux/drivers/acpi/ |
| H A D | nhlt.c | 80 * acpi_nhlt_tb_find_endpoint - Search a NHLT table for an endpoint.
81 * @tb: the table to search.
88 * value to ignore the parameter during the search.
107 * acpi_nhlt_find_endpoint - Search all NHLT tables for an endpoint.
114 * value to ignore the parameter during the search.
128 * acpi_nhlt_endpoint_find_fmtcfg - Search endpoint's formats configuration space
130 * @ep: the endpoint to search.
161 * acpi_nhlt_tb_find_fmtcfg - Search a NHLT table for a specific format.
162 * @tb: the table to search.
174 * value to ignore the parameter during the search.
[all …]
|
| /linux/arch/alpha/kernel/ |
| H A D | gct.c | 14 gct6_find_nodes(gct6_node *node, gct6_search_struct *search) in gct6_find_nodes() argument
25 /* Check against the search struct. */ in gct6_find_nodes()
26 for (wanted = search; in gct6_find_nodes()
41 status |= gct6_find_nodes(GCT_NODE_PTR(node->next), search); in gct6_find_nodes()
45 status |= gct6_find_nodes(GCT_NODE_PTR(node->child), search); in gct6_find_nodes()
|
| /linux/tools/perf/util/ |
| H A D | dwarf-aux.h | 73 DIE_FIND_CB_END = 0, /* End of Search */
74 DIE_FIND_CB_CHILD = 1, /* Search only children */
75 DIE_FIND_CB_SIBLING = 2, /* Search only siblings */
76 DIE_FIND_CB_CONTINUE = 3, /* Search children and siblings */
79 /* Search child DIEs */
84 /* Search a non-inlined function including given address */
88 /* Search a non-inlined function with tail call at given address */
92 /* Search the top inlined function including given address */
96 /* Search the deepest inlined function including given address */
100 /* Search
[all...] |
| /linux/include/drm/ |
| H A D | drm_mm.h | 60 * enum drm_mm_insert_mode - control search and allocation behaviour
63 * a number of search trees. These trees are oranised by size, by address and
74 * Search for the smallest hole (within the search range) that fits
84 * Search for the lowest hole (address closest to 0, within the search
94 * Search for the highest hole (address closest to U64_MAX, within the
95 * search range) that fits the desired node.
106 * Search for the most recently evicted hole (within the search range)
121 * search method such as DRM_MM_INSERT_HIGH or DRM_MM_INSERT_LOW.
132 * Does not search all holes.
143 * Does not search all holes.
[all …]
|
| /linux/scripts/coccinelle/free/ |
| H A D | put_device.cocci | 12 @search exists@
40 p1 << search.p1;
41 p2 << search.p2;
50 p1 << search.p1;
51 p2 << search.p2;
|
| H A D | pci_free_consistent.cocci | 13 @search@
39 p1 << search.p1;
40 p2 << search.p2;
47 p1 << search.p1;
48 p2 << search.p2;
|
| /linux/drivers/net/wireless/ath/ath12k/ |
| H A D | rx_desc.h | 217 * if flow search fails.
221 * hash from Common Parser if flow search fails.
226 * flow search fails
250 * SA search with mcast_echo_check = 1) shall be performed
255 * If set, WDS learning detection based on SA search and notification
257 * field in address search failure cache-only entry should
276 * PPE routing even if RXOLE CCE or flow search indicate 'Use_PPE'
393 * that No AST entry was found or NO AST search was performed
528 * entries within the max search count.
532 * search in the address search table due to timeout.
[all …]
|
| /linux/Documentation/w1/ |
| H A D | w1-netlink.rst | 11 is found either due to automatic or requested search.
33 device (search/alarm search)
51 W1_CMD_SEARCH - search command
52 W1_CMD_ALARM_SEARCH - alarm search command
100 W1 search and alarm search commands.
202 read/write/search commands for all master/slave devices found on the bus.
|
| /linux/drivers/net/wireless/ath/ath11k/ |
| H A D | spectral.c | 499 struct spectral_search_fft_report *search, in ath11k_spectral_pull_search() argument
502 report->timestamp = __le32_to_cpu(search->timestamp); in ath11k_spectral_pull_search()
504 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
506 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
508 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
510 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
512 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
514 __le32_to_cpu(search->info1)); in ath11k_spectral_pull_search()
516 __le32_to_cpu(search->info1)); in ath11k_spectral_pull_search()
518 __le32_to_cpu(search->info2)); in ath11k_spectral_pull_search()
[all …]
|
| /linux/drivers/w1/ |
| H A D | w1.c | 40 /* A search stops when w1_max_slave_count devices have been found in that
41 * search. The next search will start over and detect the same set of devices
46 * be read directly skipping the normal slower search process.
51 "maximum number of slaves detected in a search");
399 * doesn't include it and most messages from the bus search don't in w1_atoreg_num()
463 /* It would be nice to do a targeted search one the one-wire bus in w1_master_attribute_store_add()
465 * current search doesn't support that. in w1_master_attribute_store_add()
535 static W1_MASTER_ATTR_RW(search, S_IRUGO | S_IWUSR | S_IWGRP);
962 * w1_search() - Performs a ROM Search & registers any devices found.
963 * @dev: The master device to search
[all …]
|