Home
last modified time | relevance | path

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

12345678910>>...17

/llvm-project-15.0.7/libcxx/test/std/re/re.const/re.matchflag/
H A Dmatch_multiline.pass.cpp54 search(pat, basic, target, true); in main()
56 search(pat, awk, target, true); in main()
57 search(pat, grep, target, true); in main()
58 search(pat, egrep, target, true); in main()
74 search(pat, awk, target, false); in main()
75 search(pat, grep, target, false); in main()
92 search(pat, awk, target, false); in main()
111 search(pat, awk, target, true); in main()
112 search(pat, grep, target, true); in main()
129 search(pat, awk, target, false); in main()
[all …]
/llvm-project-15.0.7/clang/test/Preprocessor/
H A Dsearch-path-usage.m6 // RUN: -I%S/Inputs/search-path-usage/a \
7 // RUN: -I%S/Inputs/search-path-usage/a_next \
14 // expected-remark-re {{search path used: '{{.*}}/search-path-usage/a'}} \
15 // expected-remark-re@#a-include-next {{search path used: '{{.*}}/search-path-usage/a_next'}}
17 // expected-remark-re {{search path used: '{{.*}}/search-path-usage/d'}}
28 // expected-remark-re {{search path used: '{{.*}}/search-path-usage/FwA'}}
39 // expected-remark-re {{search path used: '{{.*}}/search-path-usage/b'}}
51 // expected-remark {{search path used: '/d'}}
62 // expected-remark-re {{search path used: '{{.*}}/search-path-usage/b'}}
76 // expected-remark-re {{search path used: '{{.*}}/search-path-usage/d'}}
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch.pass.cpp42 && (std::search(std::begin(ic), std::end(ic), MySearcherC()) == std::begin(ic)) in test_constexpr()
78 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); in test()
79 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); in test()
81 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); in test()
84 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia)); in test()
87 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia)); in test()
89 assert(std::search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa)) == Iter1(ia+1)); in test()
93 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1)); in test()
95 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2)) == Iter1(ib+1)); in test()
116 assert(std::search(Iter(ua), Iter(ua), Iter(ua), Iter(ua)) == Iter(ua)); in adl_test()
[all …]
H A Dsearch_pred.pass.cpp29 return (std::search(std::begin(ic), std::end(ic), std::begin(ia), std::end(ia), eq) == ic+3) in test_constexpr()
30 … && (std::search(std::begin(ic), std::end(ic), std::begin(ib), std::end(ib), eq) == std::end(ic)) in test_constexpr()
52 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); in test()
55 … assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia)); in test()
58 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1… in test()
61 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia)); in test()
70 assert(std::search(Iter1(ia), Iter1(ia), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia)); in test()
79 … assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), count_equal()) == Iter1(ia)); in test()
85 …assert(std::search(Iter1(ia), Iter1(ia+1), Iter2(ia), Iter2(ia+sa), count_equal()) == Iter1(ia+1)); in test()
91 …assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), count_equal()) == Iter1(ib+1)); in test()
[all …]
H A Dranges.search.pass.cpp37 std::ranges::search(first1, last1, first2, last2);
53 std::ranges::search(range1, range2);
102 auto ret = std::ranges::search(range1, range2); in test_iterators()
121 auto ret = std::ranges::search(range1, range2); in test_iterators()
140 auto ret = std::ranges::search(range1, range2); in test_iterators()
159 auto ret = std::ranges::search(range1, range2); in test_iterators()
178 auto ret = std::ranges::search(range1, range2); in test_iterators()
197 auto ret = std::ranges::search(range1, range2); in test_iterators()
216 auto ret = std::ranges::search(range1, range2); in test_iterators()
235 auto ret = std::ranges::search(range1, range2); in test_iterators()
[all …]
/llvm-project-15.0.7/openmp/tools/analyzer/
H A Danalyzer.py13 match = re.search(r"([0-9]+) bytes cmem\[0\]", usages)
16 match = re.search(r"([0-9]+) bytes smem", usages)
19 match = re.search(r"[Uu]sed ([0-9]+) registers", usages)
23 match = expr.search(fn)
29 match = expr.search(fn)
41 remarks = [line for line in stderr.split('\n') if re.search(r"^remark:", line)]
42 …ptxas = '\n'.join([line.split(':')[1].strip() for line in stderr.split('\n') if re.search(r"^ptxas…
43 …nvlink = '\n'.join([line.split(':')[1].strip() for line in stderr.split('\n') if re.search(r"^nvli…
/llvm-project-15.0.7/llvm/utils/
H A Dupdate_test_prefix.py12 r = re.search('no check strings found with (?:prefix|prefixes) \'([^:]+)', s)
22 … t = re.search('-?-check-(?:prefix|prefixes)=([^ ]+)\s+-?-check-(?:prefix|prefixes)=([^ ]+)', s)
25 … t = re.search('-?-check-(?:prefix|prefixes)=([^ ]+)\s+-?-check-(?:prefix|prefixes)=([^ ]+)', s)
31 t = re.search('Assertions have been autogenerated by (.*)', s)
37 if re.search('\n(?:-+)\n', s) or re.search('\n[+-].*(?<!RUN):', s):
H A DDSAextract.py64 if not arrowexp.search(buffer):
69 if regexp.search(buffer):
97 if arrowexp.search(buffer):
106 elif nodeexp.search(buffer): #this is a node line
H A Dupdate_cc_test_checks.py58 def parse_clang_ast_json(node, loc, search): argument
105 if search is None:
106 search = spell
108 ret[int(line)-1].append((spell, mangled, search))
252 m = common.TRIPLE_ARG_RE.search(commands[0])
379 for spell, mangled, search in line2func_list[idx]:
386 if mangled in added or search not in line:
388 if args.functions is None or any(re.search(regex, spell) for regex in args.functions):
/llvm-project-15.0.7/lld/test/MachO/
H A Dsyslibroot.test8 CHECK-NONEXISTENT-SYSLIBROOT: Library search paths:
9 CHECK-NONEXISTENT-SYSLIBROOT-NEXT: Framework search paths:
17 CHECK-SYSLIBROOT: Library search paths:
25 CHECK-ABSOLUTE-PATH-REROOTED: Library search paths:
32 CHECK-PATH-WITHOUT-REROOT: Library search paths:
40 CHECK-SYSLIBROOT-MATRIX: Library search paths:
48 CHECK-SYSLIBROOT-IGNORED: Library search paths:
57 CHECK-SYSLIBROOT-FRAMEWORK: Framework search paths:
67 CHECK-SYSLIBROOT-FRAMEWORK-MATRIX: Framework search paths:
76 CHECK-SYSLIBROOT-FRAMEWORK-IGNORED: Framework search paths:
H A Dsearch-paths.test5 CHECK: Library search paths:
8 CHECK-NEXT: Framework search paths:
14 CHECK_Z: Library search paths:
16 CHECK_Z-NEXT: Framework search paths:
H A Dsearch-paths-darwin.test7 CHECK: Library search paths:
10 CHECK: Framework search paths:
16 CHECK_Z: Library search paths:
18 CHECK_Z-NEXT: Framework search paths:
/llvm-project-15.0.7/clang/test/Driver/
H A Drocm-detect.hip25 // RUN: --print-rocm-search-dirs %s 2>&1 \
34 // RUN: --print-rocm-search-dirs %s 2>&1 \
45 // RUN: -target x86_64-linux-gnu --cuda-gpu-arch=gfx900 --print-rocm-search-dirs %s 2>&1 \
78 // ROCM-ENV: ROCm installation search path: {{.*}}/Inputs/rocm
80 // ROCM-REL: ROCm installation search path: {{.*}}/opt/rocm
81 // ROCM-REL: ROCm installation search path: {{.*}}/opt/rocm-3.10.0
83 // SPACK: ROCm installation search path (Spack 4.0.0): [[DIR:.*]]
84 // SPACK: ROCm installation search path: [[CLANG:.*]]
85 // SPACK: ROCm installation search path: [[DIR]]/llvm-amdgpu-4.0.0-ieagcs7inf7runpyfvepqkurasoglq4z
86 // SPACK: ROCm installation search path: [[DIR]]/llvm-amdgpu-4.0.0-ieagcs7inf7runpyfvepqkurasoglq4z…
[all …]
/llvm-project-15.0.7/lldb/unittests/Expression/
H A DClangExpressionDeclMapTest.cpp91 NameSearchContext search(*target_ast, decls, name, dc); in TEST_F() local
93 decl_map->FindExternalVisibleDecls(search); in TEST_F()
114 NameSearchContext search(*target_ast, decls, name, dc); in TEST_F() local
117 decl_map->FindExternalVisibleDecls(search); in TEST_F()
/llvm-project-15.0.7/llvm/test/Assembler/
H A D2002-08-19-BytecodeReader.ll10 @search = external global %CHESS_POSITION ; <%CHESS_POSITION*> [#uses=2]
13 …%reg1321 = getelementptr %CHESS_POSITION, %CHESS_POSITION* @search, i64 0, i32 1 ; <i32*> [#uses=…
15 …%reg1801 = getelementptr %CHESS_POSITION, %CHESS_POSITION* @search, i64 0, i32 0 ; <i32*> [#uses=…
/llvm-project-15.0.7/flang/test/Evaluate/
H A Dtest_folding.py96 m = re.search(r"(\w*)(?=, PARAMETER).*init:(.*)", line)
106 m = re.search(r"\.false\._.$", line)
111 m = re.search(r"[^:]*:(\d*):\d*: (.*)", line)
118 m = re.search(r"(?:!WARN:)(.*)", line)
/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A D2007-04-30-CombinerCrash.ll6 @search = external global %struct.CHESS_POSITION ; <%struct.CHESS_POSITION*> [#uses=…
12 …64, i64* getelementptr (%struct.CHESS_POSITION, %struct.CHESS_POSITION* @search, i32 0, i32 7) …
13 …64, i64* getelementptr (%struct.CHESS_POSITION, %struct.CHESS_POSITION* @search, i32 0, i32 0) …
14 …64, i64* getelementptr (%struct.CHESS_POSITION, %struct.CHESS_POSITION* @search, i32 0, i32 1) …
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dfix-sgpr-copies.mir65 # GCN-LABEL: name: legalize-operand-search-each-def-once
68 name: legalize-operand-search-each-def-once
89 # result in an endless search.
90 # GCN-LABEL: name: process-phi-search-each-use-once
93 name: process-phi-search-each-use-once
/llvm-project-15.0.7/lldb/docs/use/
H A Dpython.rst41 Enter search word: love
43 Enter search word: sun
45 Enter search word: Romeo
47 Enter search word: ^D
153 ready to do the actual search; lines 12-25 are the actual depth-first search.
454 search word, we see:
510 search trees, based on the example search tree defined in
552 # Main depth first search
702 binary search tree. */
725 /* Given a binary search tree and a word, search for the word
[all …]
/llvm-project-15.0.7/llvm/utils/lit/lit/
H A Ddiscovery.py44 ts, relative = search(parent)
70 def search(path): function
91 ts, relative = search(item)
100 parent = search(path_in_suite[:-1])
118 def search(path_in_suite): function
125 return search(path_in_suite)
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/
H A Dfind_end.pass.cpp56 auto expected = search(b, e, bsub, esub, pred); in operator ()()
57 auto actual = search(exec, b, e, bsub, esub); in operator ()()
60 actual = search(exec, b, e, bsub, esub, pred); in operator ()()
104 … search(exec, first_iter, first_iter, second_iter, second_iter, non_const(std::equal_to<T>())); in operator ()()
/llvm-project-15.0.7/openmp/runtime/test/affinity/format/
H A Dcheck.py21 match = re.search('{}: NO_OUTPUT'.format(self.prefix), line)
25 match = re.search('{}: num_threads=([0-9]+) (.*)$'.format(self.prefix), line)
51 if re.search(c, line) is not None:
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/
H A Dadd_new_check.py188 match = re.search('#include "(.*)"', line)
203 match = re.search('registerCheck<(.*)> *\( *(?:"([^"]*)")?', line)
212 match = re.search(' *"([^"]*)"', line)
355 matches = re.search('registerCheck<([^>:]*)>\(\s*"([^"]*)"\s*\)', stmt)
372 matches = re.search('\s+' + check_class_name + '::' + ctor_pattern, code)
381 matches = re.search(' ' + ctor_pattern, code)
432 match = re.search('.*:orphan:.*', content)
438 match = re.search('.*:http-equiv=refresh: \d+;URL=(.*).html(.*)',
466 redirect_parts = re.search('^\.\./([^/]*)/([^/]*)$', match.group(1))
/llvm-project-15.0.7/llvm/include/llvm/TableGen/
H A DSearchableTable.td17 // 2. (Generic) Tables and search indices. By instantiating the GenericTable
21 // Both a primary key and additional secondary keys / search indices can also
54 // external search indices.
106 // (Optional) Name of the primary key search function.
113 // Define a record derived from this class to generate an additional search
118 // Table that this search index refers to.
126 // search. This is convenient for tables that add extended data for a subset
/llvm-project-15.0.7/libcxx/test/std/experimental/algorithms/alg.search/
H A Dsearch.pass.cpp41 …static_assert((std::is_same<RI, decltype(std::experimental::search(RI(), RI(), MySearcher()))>::va… in main()
44 assert(it == std::experimental::search(it, it, MySearcher())); in main()

12345678910>>...17