Searched refs:search (Results 1 - 25 of 113) sorted by relevance

12345

/linux-master/scripts/dummy-tools/
H A Dld12 search="$1"
17 if [ "$search" = "$1" ]; then
H A Dnm12 search="$1"
17 if [ "$search" = "$1" ]; then
H A Dobjcopy12 search="$1"
17 if [ "$search" = "$1" ]; then
H A Dgcc39 search="$1"
44 if [ "$search" = "$1" ]; then
/linux-master/arch/alpha/kernel/
H A Dgct.c14 gct6_find_nodes(gct6_node *node, gct6_search_struct *search) argument
25 /* Check against the search struct. */
26 for (wanted = search;
41 status |= gct6_find_nodes(GCT_NODE_PTR(node->next), search);
45 status |= gct6_find_nodes(GCT_NODE_PTR(node->child), search);
/linux-master/tools/net/ynl/
H A Dynl-regen.sh7 search=
12 -p ) search=$2; shift 2 ;;
18 pushd ${search:-$KDIR} >>/dev/null
/linux-master/net/netfilter/
H A Dnf_conntrack_amanda.c62 } search[] __read_mostly = {
119 search[SEARCH_CONNECT].ts);
122 start += dataoff + search[SEARCH_CONNECT].len;
125 search[SEARCH_NEWLINE].ts);
131 off = skb_find_text(skb, start, stop, search[i].ts);
134 off += start + search[i].len;
207 for (i = 0; i < ARRAY_SIZE(search); i++)
208 textsearch_destroy(search[i].ts);
217 for (i = 0; i < ARRAY_SIZE(search); i++) {
218 search[
[all...]
H A Dnf_conntrack_ftp.c71 } search[IP_CT_DIR_MAX][2] = { variable in typeref:struct:ftp_search
445 for (i = 0; i < ARRAY_SIZE(search[dir]); i++) {
447 search[dir][i].pattern,
448 search[dir][i].plen,
449 search[dir][i].skip,
450 search[dir][i].term,
453 search[dir][i].getnum);
462 search[dir][i].pattern);
523 ret = nf_nat_ftp(skb, ctinfo, search[dir][i].ftptype,
/linux-master/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 Dheaderdep.pl76 sub search { subroutine
96 my $path = search($header);
H A DMakefile.lib54 suffix-search = $(strip $(foreach s, $3, $($(1:%$(strip $2)=%$s))))
56 multi-search = $(sort $(foreach m, $1, $(if $(call suffix-search, $m, $2, $3 -), $m)))
58 real-search = $(foreach m, $1, $(if $(call suffix-search, $m, $2, $3 -), $(call suffix-search, $m, $2, $3), $m))
61 multi-obj-y := $(call multi-search, $(obj-y), .o, -objs -y)
62 multi-obj-m := $(call multi-search, $(obj-m), .o, -objs -y -m)
67 real-obj-y := $(call real-search, $(obj-y), .o, -objs -y)
68 real-obj-m := $(call real-search,
[all...]
/linux-master/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dflowring.c45 struct brcmf_flowring_tdls_entry *search; local
47 search = flow->tdls_entry;
49 while (search) {
50 if (memcmp(search->mac, mac, ETH_ALEN) == 0)
52 search = search->next;
388 struct brcmf_flowring_tdls_entry *search; local
397 search = flow->tdls_entry;
398 while (search) {
399 remove = search;
437 struct brcmf_flowring_tdls_entry *search; local
481 struct brcmf_flowring_tdls_entry *search; local
[all...]
/linux-master/drivers/md/bcache/
H A Drequest.c463 struct search { struct
489 struct search *s = container_of(cl, struct search, cl);
515 struct search *s = container_of(op, struct search, op);
580 closure_type(s, struct search, iop.cl);
626 struct search *s = container_of(cl, struct search, cl);
642 struct search *s = container_of(cl, struct search, c
[all...]
/linux-master/Documentation/trace/postprocess/
H A Ddecode_msr.py22 m = re.search(r'(read|write)_msr:\s+([0-9a-f]+)', j)
/linux-master/arch/alpha/lib/
H A Dstrcat.S39 and $2, 0xf0, $3 # binary search for that set bit
H A Dstrchr.S22 zapnot a1, 1, a1 # e0 : zero extend the search character
24 sll a1, 8, t5 # e0 : replicate the search character
56 and t0, 0xf0, t2 # e0 : binary search for that set bit
H A Dstrncat.S44 and $2, 0xf0, $3 # binary search for that set bit
/linux-master/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-master/fs/bcachefs/
H A Deytzinger.h19 * search over an array. Binary search is a worst case scenario for branch
244 /* return greatest node <= @search, or -1 if not found */
246 cmp_func_t cmp, const void *search)
255 n = eytzinger0_child(i, cmp(base + i * size, search) <= 0);
260 * @i was greater than @search, return previous node:
272 cmp_func_t cmp, const void *search)
274 ssize_t idx = eytzinger0_find_le(base, nr, size, cmp, search);
277 * if eytitzinger0_find_le() returned -1 - no element was <= search - we
287 #define eytzinger0_find(base, nr, size, _cmp, search) \
245 eytzinger0_find_le(void *base, size_t nr, size_t size, cmp_func_t cmp, const void *search) argument
271 eytzinger0_find_gt(void *base, size_t nr, size_t size, cmp_func_t cmp, const void *search) argument
[all...]
H A Dreplicas.c226 struct bch_replicas_entry_v1 *search)
228 int idx, entry_size = replicas_entry_bytes(search);
233 verify_replicas_entry(search);
237 entry_cmp, search);
244 struct bch_replicas_entry_v1 *search)
246 bch2_replicas_entry_sort(search);
248 return __replicas_entry_idx(&c->replicas, search);
252 struct bch_replicas_entry_v1 *search)
254 return __replicas_entry_idx(r, search) >= 0;
258 struct bch_replicas_entry_v1 *search)
225 __replicas_entry_idx(struct bch_replicas_cpu *r, struct bch_replicas_entry_v1 *search) argument
243 bch2_replicas_entry_idx(struct bch_fs *c, struct bch_replicas_entry_v1 *search) argument
251 __replicas_has_entry(struct bch_replicas_cpu *r, struct bch_replicas_entry_v1 *search) argument
257 bch2_replicas_marked(struct bch_fs *c, struct bch_replicas_entry_v1 *search) argument
[all...]
/linux-master/drivers/net/wireless/ath/ath11k/
H A Dspectral.c499 struct spectral_search_fft_report *search,
502 report->timestamp = __le32_to_cpu(search->timestamp);
504 __le32_to_cpu(search->info0));
506 __le32_to_cpu(search->info0));
508 __le32_to_cpu(search->info0));
510 __le32_to_cpu(search->info0));
512 __le32_to_cpu(search->info0));
514 __le32_to_cpu(search->info1));
516 __le32_to_cpu(search->info1));
518 __le32_to_cpu(search
498 ath11k_spectral_pull_search(struct ath11k *ar, struct spectral_search_fft_report *search, struct ath11k_spectral_search_report *report) argument
575 struct ath11k_spectral_search_report search; local
[all...]
/linux-master/tools/crypto/tcrypt/
H A Dtcrypt_speed_compare.py59 match = re.search(pattern, line)
71 match = re.search(pattern_operations, line)
80 match = re.search(pattern_cycles, line)
/linux-master/tools/testing/selftests/bpf/
H A Dverify_sig_setup.sh58 keyctl unlink $(keyctl search @s asymmetric ebpf_testing_key) @s
59 keyctl unlink $(keyctl search @s keyring ebpf_testing_keyring) @s
/linux-master/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-master/drivers/regulator/
H A Dof_regulator.c463 struct device_node *search, *child; local
470 search = of_get_child_by_name(dev->of_node,
473 search = of_node_get(dev->of_node);
475 if (!strcmp(desc->of_match, search->name))
476 return search;
479 if (!search) {
485 for_each_available_child_of_node(search, child) {
495 of_node_put(search);
504 of_node_put(search);
742 * @np: device node to search fo
[all...]

Completed in 537 milliseconds

12345