Home
last modified time | relevance | path

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

12345678910

/linux/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dflowring.c45 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 Dnf_conntrack_amanda.c62 } 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 …]
H A Dnf_conntrack_ftp.c71 } search[IP_CT_DIR_MAX][2] = { variable
445 for (i = 0; i < ARRAY_SIZE(search[dir]); i++) { in help()
447 search[dir][i].pattern, in help()
448 search[dir][i].plen, in help()
449 search[dir][i].skip, in help()
450 search[dir][i].term, in help()
453 search[dir][i].getnum); in help()
462 search[dir][i].pattern); in help()
523 ret = nf_nat_ftp(skb, ctinfo, search[dir][i].ftptype, in help()
/linux/scripts/
H A Ddocumentation-file-ref-check199 my $search = $new;
200 $search =~ s,^.*/,,;
201 $f = qx(find Documentation/devicetree/ -iname "*$search*") if ($search);
204 $search =~ s/^.*,//;
205 $f = qx(find Documentation/devicetree/ -iname "*$search*") if ($search);
H A DMakefile.lib49 suffix-search = $(strip $(foreach s, $3, $($(1:%$(strip $2)=%$s))))
51 multi-search = $(sort $(foreach m, $1, $(if $(call suffix-search, $m, $2, $3 -), $m)))
53 real-search = $(foreach m, $1, $(if $(call suffix-search, $m, $2, $3 -), $(call suffix-search, $m, …
56 multi-obj-y := $(call multi-search, $(obj-y), .o, -objs -y)
57 multi-obj-m := $(call multi-search, $(obj-m), .o, -objs -y -m)
62 real-obj-y := $(call real-search, $(obj-y), .o, -objs -y)
63 real-obj-m := $(call real-search, $(obj-m), .o, -objs -y -m)
95 $(if $(filter $*.o, $(call suffix-search, $m, .o, -objs -y -m)),$(m:.o=))))
298 $(addprefix $(obj)/, $(call suffix-search, $(patsubst $(obj)/%,%,$m), $2, $3))))
/linux/fs/bcachefs/
H A Deytzinger.h248 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()
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()
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()
294 if (idx < nr && !cmp(base + idx * size, search)) in eytzinger0_find_ge()
300 #define eytzinger0_find(base, nr, size, _cmp, search) \ argument
303 const void *_search = (search); \
H A Dbtree_write_buffer.h52 struct btree_write_buffered_key search; in bch2_accounting_key_to_wb() local
53 search.btree = btree; in bch2_accounting_key_to_wb()
54 search.k.k.p = k->k.p; in bch2_accounting_key_to_wb()
58 wb_key_cmp, &search); in bch2_accounting_key_to_wb()
H A Dreplicas.c246 struct bch_replicas_entry_v1 *search) in __replicas_entry_idx() argument
248 int idx, entry_size = replicas_entry_bytes(search); in __replicas_entry_idx()
255 entry_cmp, search); in __replicas_entry_idx()
262 struct bch_replicas_entry_v1 *search) in bch2_replicas_entry_idx() argument
264 bch2_replicas_entry_sort(search); in bch2_replicas_entry_idx()
266 return __replicas_entry_idx(&c->replicas, search); in bch2_replicas_entry_idx()
270 struct bch_replicas_entry_v1 *search) in __replicas_has_entry() argument
272 return __replicas_entry_idx(r, search) >= 0; in __replicas_has_entry()
276 struct bch_replicas_entry_v1 *search) in bch2_replicas_marked_locked() argument
278 verify_replicas_entry(search); in bch2_replicas_marked_locked()
[all …]
H A Dbset.c1044 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
1171 return bset_search_write_set(b, t, search); in __bch2_bset_search()
1173 return bset_search_tree(b, t, search, lossy_packed_search); in __bch2_bset_search()
1182 struct bpos *search, in bch2_bset_search_linear() argument
1190 lossy_packed_search, search) < 0) in bch2_bset_search_linear()
1195 bkey_iter_pos_cmp(b, m, search) < 0) in bch2_bset_search_linear()
[all …]
/linux/arch/alpha/kernel/
H A Dgct.c14 gct6_find_nodes(gct6_node *node, gct6_search_struct *search) in gct6_find_nodes() argument
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/scripts/coccinelle/free/
H A Dput_device.cocci12 @search exists@
40 p1 << search.p1;
41 p2 << search.p2;
50 p1 << search.p1;
51 p2 << search.p2;
H A Dpci_free_consistent.cocci13 @search@
39 p1 << search.p1;
40 p2 << search.p2;
47 p1 << search.p1;
48 p2 << search.p2;
/linux/drivers/net/wireless/ath/ath11k/
H A Dspectral.c499 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/tools/net/ynl/
H A Dynl-regen.sh7 search=
12 -p ) search=$2; shift 2 ;;
18 pushd ${search:-$KDIR} >>/dev/null
/linux/Documentation/sphinx/
H A Dmaintainers_include.py73 if re.search('^[A-Z0-9]', line):
81 m = re.search(pat, line)
93 m = re.search(r"\s(\S):\s", line)
97 m = re.search(r"\*([^\*]+)\*", line)
/linux/drivers/w1/
H A DKconfig25 either due to automatic or requested search.
26 2. Userspace commands. Includes read/write and search/alarm search commands.
/linux/scripts/dummy-tools/
H A Dnm12 search="$1"
17 if [ "$search" = "$1" ]; then
H A Dobjcopy12 search="$1"
17 if [ "$search" = "$1" ]; then
H A Dld12 search="$1"
17 if [ "$search" = "$1" ]; then
/linux/Documentation/ABI/testing/
H A Dsysfs-bus-iio-adc-envelope-detector7 voltage input signal by a binary search using the output
26 dac instead of zero. The envelope detector will search
38 step of the binary search for the input peak level. Needs
/linux/drivers/md/bcache/
H A Dutil.h412 #define RB_SEARCH(root, search, member, cmp) \ argument
415 typeof(&(search)) this, ret = NULL; \
419 this = container_of(n, typeof(search), member); \
420 res = cmp(&(search), this); \
432 #define RB_GREATER(root, search, member, cmp) \ argument
435 typeof(&(search)) this, ret = NULL; \
439 this = container_of(n, typeof(search), member); \
440 res = cmp(&(search), this); \
/linux/Documentation/kbuild/
H A Dkconfig.rst11 navigation, search, and other general help text.
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.
285 You can also enter a different search string without having
[all …]
/linux/scripts/coccinelle/api/alloc/
H A Dalloc_cast.cocci49 if m.search(t) != None:
72 if m.search(t) != None:
109 if m.search(t) != None:
119 if m.search(t) != None:
/linux/tools/testing/selftests/tc-testing/plugin-lib/
H A DvalgrindPlugin.py131 def_mo = self.definitely_lost_re.search(content)
132 ind_mo = self.indirectly_lost_re.search(content)
133 pos_mo = self.possibly_lost_re.search(content)
134 nle_mo = self.non_leak_error_re.search(content)
/linux/drivers/regulator/
H A Dof_regulator.c465 struct device_node *search, *child; in regulator_of_get_init_node() local
472 search = of_get_child_by_name(dev->of_node, in regulator_of_get_init_node()
475 search = of_node_get(dev->of_node); in regulator_of_get_init_node()
477 if (!strcmp(desc->of_match, search->name)) in regulator_of_get_init_node()
478 return search; in regulator_of_get_init_node()
481 if (!search) { in regulator_of_get_init_node()
487 for_each_available_child_of_node(search, child) { in regulator_of_get_init_node()
497 of_node_put(search); in regulator_of_get_init_node()
506 of_node_put(search); in regulator_of_get_init_node()

12345678910