| /Linux-v5.4/include/linux/ |
| 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-v5.4/drivers/acpi/acpica/ |
| 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-v5.4/drivers/net/wireless/broadcom/brcm80211/brcmfmac/ |
| 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-v5.4/net/netfilter/ |
| 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-v5.4/fs/ntfs/ |
| D | attrib.h | 21 * ntfs_attr_search_ctx - used in attribute search functions
22 * @mrec: buffer containing mft record to search
23 * @attr: attribute record in @mrec where to begin/continue search
24 * @is_first: if true ntfs_attr_lookup() begins search with @attr, else after
27 * attribute search functions. Initialize @mrec to point to the mft record to
28 * search, and @attr to point to the first attribute within @mrec (not necessary
32 * If @is_first is 'true', the search begins with @attr. If @is_first is 'false',
33 * the search begins after @attr. This is so that, after the first call to one
34 * of the search attribute functions, we can call the function again, without
35 * any modification of the search context, to automagically get the next
|
| /Linux-v5.4/lib/ |
| 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 …]
|
| 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-v5.4/tools/include/asm-generic/bitops/ |
| D | find.h | 8 * @addr: The address to base the search on
22 * @addr1: The first address to base the search on
23 * @addr2: The second address to base the search on
39 * @addr: The address to base the search on
54 * @addr: The address to start the search at
55 * @size: The maximum number of bits to search
69 * @addr: The address to start the search at
70 * @size: The maximum number of bits to search
|
| /Linux-v5.4/include/asm-generic/bitops/ |
| D | find.h | 8 * @addr: The address to base the search on
22 * @addr1: The first address to base the search on
23 * @addr2: The second address to base the search on
38 * @addr: The address to base the search on
53 * @addr: The address to start the search at
54 * @size: The maximum number of bits to search
64 * @addr: The address to start the search at
65 * @size: The maximum number of bits to search
|
| /Linux-v5.4/drivers/md/bcache/ |
| 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 …]
|
| D | request.c | 468 struct search { struct
493 struct search *s = container_of(cl, struct search, cl); in bch_cache_read_endio() argument
519 struct search *s = container_of(op, struct search, op); in cache_lookup_fn()
584 struct search *s = container_of(cl, struct search, iop.cl); in cache_lookup()
630 struct search *s = container_of(cl, struct search, cl); in request_endio()
646 struct search *s = container_of(cl, struct search, cl); in backing_request_endio()
673 static void bio_complete(struct search *s) in bio_complete()
686 static void do_bio_hook(struct search *s, in do_bio_hook()
708 struct search *s = container_of(cl, struct search, cl); in search_free()
717 mempool_free(s, &s->iop.c->search); in search_free()
[all …]
|
| D | bset.c | 234 /* Auxiliary search trees */
254 * the auxiliar search tree - when we're done searching the bset_float tree we
255 * have this many bytes left that we do a linear search over.
259 * cacheline in the linear search - but the linear search might stop before it
276 /* Space required for the auxiliary search trees */
366 /* Binary tree stuff for auxiliary search trees */
510 * t->tree is a binary search tree in an array; each node corresponds to a key
557 * maintain a full search tree, we just keep a simple lookup table in t->prev.
685 * accelerate bkey search in a btree node (pointed by bset_tree->data in
686 * memory). After search in the auxiliar tree by calling bset_search_tree(),
[all …]
|
| /Linux-v5.4/tools/perf/util/ |
| D | dwarf-aux.h | 64 DIE_FIND_CB_END = 0, /* End of Search */
65 DIE_FIND_CB_CHILD = 1, /* Search only children */
66 DIE_FIND_CB_SIBLING = 2, /* Search only siblings */
67 DIE_FIND_CB_CONTINUE = 3, /* Search children and siblings */
70 /* Search child DIEs */
75 /* Search a non-inlined function including given address */
79 /* Search a non-inlined function with tail call at given address */
83 /* Search the top inlined function including given address */
87 /* Search the deepest inlined function including given address */
|
| /Linux-v5.4/drivers/pci/ |
| D | search.c | 128 * @domain: number of PCI domain to search
153 * @from: Previous PCI bus found, or %NULL for new search.
155 * Iterates through the list of known PCI buses. A new search is
251 * @from: Previous PCI device found in search, or %NULL for new search.
256 * A new search is initiated by passing %NULL as the @from argument. Otherwise
261 * This is an internal function for use by the other search functions in
288 * @from: Previous PCI device found in search, or %NULL for new search.
293 * incremented. Otherwise, %NULL is returned. A new search is initiated by
317 * @from: Previous PCI device found in search, or %NULL for new search.
322 * Otherwise, %NULL is returned. A new search is initiated by passing %NULL
[all …]
|
| /Linux-v5.4/Documentation/security/keys/ |
| 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-v5.4/arch/alpha/kernel/ |
| 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-v5.4/include/drm/ |
| D | drm_mm.h | 58 * enum drm_mm_insert_mode - control search and allocation behaviour
61 * a number of search trees. These trees are oranised by size, by address and
72 * Search for the smallest hole (within the search range) that fits
82 * Search for the lowest hole (address closest to 0, within the search
92 * Search for the highest hole (address closest to U64_MAX, within the
93 * search range) that fits the desired node.
104 * Search for the most recently evicted hole (within the search range)
119 * search method such as DRM_MM_INSERT_HIGH or DRM_MM_INSERT_LOW.
130 * Does not search all holes.
141 * Does not search all holes.
[all …]
|
| /Linux-v5.4/scripts/coccinelle/free/ |
| D | pci_free_consistent.cocci | 13 @search@
39 p1 << search.p1;
40 p2 << search.p2;
47 p1 << search.p1;
48 p2 << search.p2;
|
| D | put_device.cocci | 12 @search exists@
41 p1 << search.p1;
42 p2 << search.p2;
51 p1 << search.p1;
52 p2 << search.p2;
|
| /Linux-v5.4/Documentation/kbuild/ |
| D | kconfig.rst | 11 navigation, search, and other general help text.
178 The Search function searches for kernel configuration symbol
188 For search help, enter / followed by TAB-TAB (to highlight
190 regular expressions (regexes) in the search string, so if you
198 is when the search matches the complete symbol name);
251 You can search either in the menu entry "prompt" strings
254 Use / to begin a search through the menu entries. This does
257 terminate the search mode.
277 The Search function searches for kernel configuration symbol
287 Menu: File, Search, hotplug
[all …]
|
| /Linux-v5.4/Documentation/w1/ |
| 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-v5.4/Documentation/target/ |
| D | tcm_mod_builder.py | 349 if process_fo == 0 and re.search('struct target_core_fabric_ops {', line):
356 # Search for function pointer
357 if not re.search('\(\*', line):
364 # Search for function pointer
365 if not re.search('\(\*', line):
426 if re.search('get_fabric_name', fo):
434 if re.search('get_wwn', fo):
444 if re.search('get_tag', fo):
453 if re.search('tpg_get_inst_index\)\(', fo):
460 if re.search('\*release_cmd\)\(', fo):
[all …]
|
| /Linux-v5.4/fs/cifs/ |
| D | readdir.c | 4 * Directory search handling
57 cifs_dbg(FYI, "end of search\n"); in dump_cifs_file_struct()
391 cifs_dbg(VFS, "search entry %p began after end of SMB %p old entry %p\n", in nxt_dir_entry()
398 cifs_dbg(VFS, "search entry %p extends after end of SMB %p\n", in nxt_dir_entry()
535 whether we can use the cached search results from the previous search */
565 * Find the corresponding entry in the search. Note that the SMB server returns
566 * search entries for . and .. which complicates logic here if we choose to
597 * in search response data which means it is likely . and .. in find_cifs_entry()
606 /* close and restart search */ in find_cifs_entry()
607 cifs_dbg(FYI, "search backing up - close and restart search\n"); in find_cifs_entry()
[all …]
|
| /Linux-v5.4/drivers/w1/ |
| D | w1.c | 38 /* A search stops when w1_max_slave_count devices have been found in that
39 * search. The next search will start over and detect the same set of devices
44 * be read directly skipping the normal slower search process.
49 "maximum number of slaves detected in a search");
407 * doesn't include it and most messages from the bus search don't in w1_atoreg_num()
471 /* It would be nice to do a targeted search one the one-wire bus in w1_master_attribute_store_add()
473 * current search doesn't support that. in w1_master_attribute_store_add()
543 static W1_MASTER_ATTR_RW(search, S_IRUGO | S_IWUSR | S_IWGRP);
938 * w1_search() - Performs a ROM Search & registers any devices found.
939 * @dev: The master device to search
[all …]
|
| /Linux-v5.4/Documentation/power/ |
| D | opp.rst | 11 3. OPP Search Functions
59 -> queries to search/retrieve information ->
126 3. OPP Search Functions
130 to search the OPP list that OPP library internally manages. These search
140 Search for an OPP based on an *exact* frequency and
159 This is the only search function that operates on OPPs which are
163 Search for an available OPP which is *at most* the
174 Search for an available OPP which is *at least* the
249 retrieved using the search functions, the following functions can be used by SoC
369 Search functions:
|
