| /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
38 * @list: list to search
54 * struct ts_config - search configuration
57 * @get_next_block: callback to fetch the next block to search in
58 * @finish: callback to finalize a search
69 * @conf: search configuration
[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/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/tools/docs/ |
| H A D | get_abi.py | 95 """Initialize an argparse subparser for ABI search"""
100 parser = subparsers.add_parser("search",
102 description="Search ABI using a regular expression")
105 help="Case-insensitive search pattern for the ABI symbol")
122 The search logic tries to minimize the number of regular expressions to
123 search per each symbol.
128 On experimental tests, if the number of ABI symbols to search per devnode
150 parser.add_argument("-s", "--search-string",
151 help="search string regular expression to limit symbol search")
162 help="Don't actually search for undefined. "
|
| /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
330 * @from: Previous PCI device found in search, or %NULL for new search.
335 * incremented. Otherwise, %NULL is returned. A new search is initiated by
353 * @from: Previous PCI device found in search, or %NULL for new search.
358 * Otherwise, %NULL is returned. A new search is initiated by passing %NULL
[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/tools/perf/util/ |
| H A D | dwarf-aux.h | 72 DIE_FIND_CB_END = 0, /* End of Search */
73 DIE_FIND_CB_CHILD = 1, /* Search only children */
74 DIE_FIND_CB_SIBLING = 2, /* Search only siblings */
75 DIE_FIND_CB_CONTINUE = 3, /* Search children and siblings */
78 /* Search child DIEs */
83 /* Search a non-inlined function including given address */
87 /* Search a non-inlined function with tail call at given address */
91 /* Search the top inlined function including given address */
95 /* Search the deepest inlined function including given address */
99 /* Search a non-inlined function by name and returns its return type */
|
| /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/drivers/md/bcache/ |
| H A D | bset.c | 236 /* Auxiliary search trees */
256 * the auxiliar search tree - when we're done searching the bset_float tree we
257 * have this many bytes left that we do a linear search over.
261 * cacheline in the linear search - but the linear search might stop before it
278 /* Space required for the auxiliary search trees */
365 /* Binary tree stuff for auxiliary search trees */
509 * t->tree is a binary search tree in an array; each node corresponds to a key
556 * maintain a full search tree, we just keep a simple lookup table in t->prev.
683 * accelerate bkey search in a btree node (pointed by bset_tree->data in
684 * memory). After search in the auxiliar tree by calling bset_search_tree(),
[all …]
|
| H A D | request.c | 477 struct search { struct
503 struct search *s = container_of(cl, struct search, cl); in bch_cache_read_endio() argument
529 struct search *s = container_of(op, struct search, op); in cache_lookup_fn()
594 closure_type(s, struct search, iop.cl); in CLOSURE_CALLBACK()
640 struct search *s = container_of(cl, struct search, cl); in request_endio()
656 struct search *s = container_of(cl, struct search, cl); in backing_request_endio()
683 static void bio_complete(struct search *s) in bio_complete()
696 static void do_bio_hook(struct search *s, in do_bio_hook()
717 closure_type(s, struct search, cl); in CLOSURE_CALLBACK()
726 mempool_free(s, &s->iop.c->search); in CLOSURE_CALLBACK()
[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/tools/testing/selftests/ftrace/test.d/ftrace/ |
| H A D | fgraph-multi-filter.tc | 44 search=$1
47 if [ -z "$search" ]; then
50 grep $search enabled_functions | wc -l
52 grep $search enabled_functions | grep $vsearch| wc -l
78 search=$2
81 cnt=`function_count $search $vsearch`
|
| /linux/tools/lib/python/kdoc/ |
| H A D | kdoc_parser.py | 124 # class that ensures that delimiters after a search are properly
201 for search, subst in xforms:
202 text = search.sub(subst, text)
539 while arg_expr.search(args):
561 elif KernRe(r'\(.+\)\s*\(').search(arg):
577 elif KernRe(r'\(.+\)\s*\[').search(arg):
624 elif bitfield_re.search(param):
640 not known_sections.search(section):
659 if not return_type or KernRe(r'void\s*\w*\s*$').search(return_type):
681 if r.search(proto):
[all …]
|
| H A D | kdoc_re.py | 70 def search(self, string): member in KernRe
72 Handles a re.search storing its results
75 self.last_match = self.regex.search(string)
118 string search STRUCT_GROUP(),
128 will ignore the search string.
214 def search(self, regex, line): member in NestedMatch
216 This is similar to re.search:
|
| /linux/tools/perf/pmu-events/ |
| H A D | pmu-events.h | 99 * Search for a table and entry matching with pmu__name_wildcard_match or any
101 * success/continue the search while non-zero means to terminate. The special
103 * the tables which doesn't terminate the search of all tables.
116 * Search for a table and entry matching with pmu__name_wildcard_match or any
118 * success/continue the search while non-zero means to terminate. The special
120 * of the tables which doesn't terminate the search of all tables.
|
| /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 | 500 struct spectral_search_fft_report *search, in ath11k_spectral_pull_search() argument
503 report->timestamp = __le32_to_cpu(search->timestamp); in ath11k_spectral_pull_search()
505 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
507 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
509 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
511 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
513 __le32_to_cpu(search->info0)); in ath11k_spectral_pull_search()
515 __le32_to_cpu(search->info1)); in ath11k_spectral_pull_search()
517 __le32_to_cpu(search->info1)); in ath11k_spectral_pull_search()
519 __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 …]
|