Home
last modified time | relevance | path

Searched refs:input (Results 1 – 25 of 2808) sorted by relevance

12345678910>>...113

/llvm-project-15.0.7/llvm/test/tools/llvm-profdata/
H A Dinvalid-profdata.test1 RUN: echo ":ir" > %t.input
2 RUN: echo "_ZN6Thread5StartEv" >> %t.input
3 RUN: echo "# Func Hash:" >> %t.input
4 RUN: echo "288793635542036872" >> %t.input
5 RUN: echo "# Num Counters:" >> %t.input
6 RUN: echo "3" >> %t.input
7 RUN: echo "# Counter Values:" >> %t.input
8 RUN: echo "0" >> %t.input
9 RUN: echo "12" >> %t.input
10 RUN: echo "12" >> %t.input
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DVersionTuple.cpp43 if (input.empty()) in parseInt()
46 char next = input[0]; in parseInt()
47 input = input.substr(1); in parseInt()
53 next = input[0]; in parseInt()
56 input = input.substr(1); in parseInt()
70 if (input.empty()) { in tryParse()
76 if (input[0] != '.') in tryParse()
78 input = input.substr(1); in tryParse()
90 input = input.substr(1); in tryParse()
102 input = input.substr(1); in tryParse()
[all …]
/llvm-project-15.0.7/clang/test/Sema/
H A Dformat-strings-enum-fixed-type.cpp18 void test(TestEnum input) { in test() argument
22 printf("%hd", input); // no-warning in test()
26 printf("%d", input); // no-warning in test()
36 void testLong(LongEnum input) { in testLong() argument
40 printf("%lu", input); in testLong()
52 printf("%hd", input); // no-warning in testUnderlyingTypedef()
56 printf("%d", input); // no-warning in testUnderlyingTypedef()
69 printf("%d", input); // no-warning in testTypedefChain()
78 void testChar(CharEnum input) { in testChar() argument
83 printf("%hd", input); in testChar()
[all …]
H A Darm_inline_asm_constraints.c13 : [ constant ] "j"(-1), [ input ] "r"(i) in test_j()
21 : [ constant ] "j"(0), [ input ] "r"(i) in test_j()
53 : [ constant ] "I"(-1), [ input ] "r"(i) in test_I()
58 : [ constant ] "I"(0), [ input ] "r"(i) in test_I()
63 : [ constant ] "I"(255), [ input ] "r"(i) in test_I()
68 : [ constant ] "I"(256), [ input ] "r"(i) in test_I()
107 : [ constant ] "J"(-1), [ input ] "r"(i) in test_J()
113 : [ constant ] "J"(0), [ input ] "r"(i) in test_J()
164 : [ constant ] "L"(7), [ input ] "r"(i) in test_L()
169 : [ constant ] "L"(8), [ input ] "r"(i) in test_L()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/StraightLineStrengthReduce/
H A Dslsr-gep.ll6 ; foo(input[0]);
7 ; foo(input[s]);
8 ; foo(input[s * 2]);
10 ; p0 = &input[0];
18 ; v0 = input[0];
22 ; v1 = input[s];
36 ; foo(input[0]);
40 ; p0 = &input[0];
48 ; v0 = input[0];
52 ; v1 = input[s];
[all …]
/llvm-project-15.0.7/libcxx/test/libcxx/localization/locale.categories/
H A D__scan_keyword.pass.cpp49 const char* in = input; in main()
52 std::string* k = std::__scan_keyword(in, input+sizeof(input)-1, in main()
56 assert(in == input+1); in main()
64 std::string* k = std::__scan_keyword(in, input+sizeof(input)-1, in main()
68 assert(in == input+2); in main()
76 std::string* k = std::__scan_keyword(in, input+sizeof(input)-1, in main()
80 assert(in == input+3); in main()
88 std::string* k = std::__scan_keyword(in, input+sizeof(input)-1, in main()
92 assert(in == input+3); in main()
100 std::string* k = std::__scan_keyword(in, input+sizeof(input)-1, in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/
H A Dmake_heap.pass.cpp36 T input[] = {3, 4, 1, 2, 5}; in test() local
37 std::make_heap(Iter(input), Iter(input + 5)); in test()
38 assert(std::is_heap(input, input + 5)); in test()
39 std::pop_heap(input, input + 5); assert(input[4] == 5); in test()
40 std::pop_heap(input, input + 4); assert(input[3] == 4); in test()
41 std::pop_heap(input, input + 3); assert(input[2] == 3); in test()
42 std::pop_heap(input, input + 2); assert(input[1] == 2); in test()
43 std::pop_heap(input, input + 1); assert(input[0] == 1); in test()
H A Dmake_heap_comp.pass.cpp37 T input[] = {3, 4, 1, 2, 5}; in test() local
38 std::make_heap(Iter(input), Iter(input + 5), std::greater<T>()); in test()
39 assert(std::is_heap(input, input + 5, std::greater<T>())); in test()
40 std::pop_heap(input, input + 5, std::greater<T>()); assert(input[4] == 1); in test()
41 std::pop_heap(input, input + 4, std::greater<T>()); assert(input[3] == 2); in test()
42 std::pop_heap(input, input + 3, std::greater<T>()); assert(input[2] == 3); in test()
43 std::pop_heap(input, input + 2, std::greater<T>()); assert(input[1] == 4); in test()
44 std::pop_heap(input, input + 1, std::greater<T>()); assert(input[0] == 5); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/
H A Dnth_element.pass.cpp45 T input[] = {3,1,4,1,5,9,2}; in test() local
46 std::nth_element(Iter(input), Iter(input+4), Iter(input+7)); in test()
47 assert(input[4] == 4); in test()
48 assert(input[5] + input[6] == 5 + 9); in test()
52 T input[] = {0, 1, 2, 3, 4, 5, 7, 6}; in test() local
53 std::nth_element(Iter(input), Iter(input + 6), Iter(input + 8)); in test()
54 assert(input[6] == 6); in test()
55 assert(input[7] == 7); in test()
60 std::nth_element(Iter(input), Iter(input + 1), Iter(input + 8)); in test()
61 assert(input[0] == 0); in test()
[all …]
H A Dnth_element_comp.pass.cpp46 T input[] = {3,1,4,1,5,9,2}; in test() local
47 std::nth_element(Iter(input), Iter(input+4), Iter(input+7), std::greater<T>()); in test()
48 assert(input[4] == 2); in test()
49 assert(input[5] + input[6] == 1 + 1); in test()
53 T input[] = {0, 1, 2, 3, 4, 5, 7, 6}; in test() local
54 std::nth_element(Iter(input), Iter(input + 6), Iter(input + 8), std::greater<T>()); in test()
55 assert(input[6] == 1); in test()
56 assert(input[7] == 0); in test()
61 std::nth_element(Iter(input), Iter(input + 1), Iter(input + 8), std::greater<T>()); in test()
62 assert(input[0] == 7); in test()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/
H A Dpush_heap.pass.cpp36 T input[] = {1, 3, 2, 5, 4}; in test() local
37 std::push_heap(Iter(input), Iter(input + 1)); assert(input[0] == 1); in test()
38 std::push_heap(Iter(input), Iter(input + 2)); assert(input[0] == 3); in test()
39 std::push_heap(Iter(input), Iter(input + 3)); assert(input[0] == 3); in test()
40 std::push_heap(Iter(input), Iter(input + 4)); assert(input[0] == 5); in test()
41 std::push_heap(Iter(input), Iter(input + 5)); assert(input[0] == 5); in test()
42 assert(std::is_heap(input, input + 5)); in test()
H A Dpush_heap_comp.pass.cpp36 T input[] = {5, 3, 4, 1, 2}; in test() local
37 std::push_heap(Iter(input), Iter(input + 1), std::greater<T>()); assert(input[0] == 5); in test()
38 std::push_heap(Iter(input), Iter(input + 2), std::greater<T>()); assert(input[0] == 3); in test()
39 std::push_heap(Iter(input), Iter(input + 3), std::greater<T>()); assert(input[0] == 3); in test()
40 std::push_heap(Iter(input), Iter(input + 4), std::greater<T>()); assert(input[0] == 1); in test()
41 std::push_heap(Iter(input), Iter(input + 5), std::greater<T>()); assert(input[0] == 1); in test()
42 assert(std::is_heap(input, input + 5, std::greater<T>())); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/
H A Dpop_heap.pass.cpp39 T input[] = {5, 4, 1, 2, 3}; in test() local
40 assert(std::is_heap(input, input + 5)); in test()
41 std::pop_heap(Iter(input), Iter(input + 5)); assert(input[4] == 5); in test()
42 std::pop_heap(Iter(input), Iter(input + 4)); assert(input[3] == 4); in test()
43 std::pop_heap(Iter(input), Iter(input + 3)); assert(input[2] == 3); in test()
44 std::pop_heap(Iter(input), Iter(input + 2)); assert(input[1] == 2); in test()
45 std::pop_heap(Iter(input), Iter(input + 1)); assert(input[0] == 1); in test()
H A Dpop_heap_comp.pass.cpp39 T input[] = {1, 2, 5, 4, 3}; in test() local
40 assert(std::is_heap(input, input + 5, std::greater<T>())); in test()
41 std::pop_heap(Iter(input), Iter(input + 5), std::greater<T>()); assert(input[4] == 1); in test()
42 std::pop_heap(Iter(input), Iter(input + 4), std::greater<T>()); assert(input[3] == 2); in test()
43 std::pop_heap(Iter(input), Iter(input + 3), std::greater<T>()); assert(input[2] == 3); in test()
44 std::pop_heap(Iter(input), Iter(input + 2), std::greater<T>()); assert(input[1] == 4); in test()
45 std::pop_heap(Iter(input), Iter(input + 1), std::greater<T>()); assert(input[0] == 5); in test()
/llvm-project-15.0.7/clang/test/Analysis/
H A Denum-cast-out-of-range.cpp161 void rangeConstrained1(int input) { in rangeConstrained1() argument
162 if (input > -5 && input < 5) in rangeConstrained1()
166 void rangeConstrained2(int input) { in rangeConstrained2() argument
167 if (input < -5) in rangeConstrained2()
171 void rangeConstrained3(int input) { in rangeConstrained3() argument
172 if (input >= -2 && input <= -1) in rangeConstrained3()
176 void rangeConstrained4(int input) { in rangeConstrained4() argument
177 if (input >= -2 && input <= 1) in rangeConstrained4()
182 if (input >= 1 && input <= 2) in rangeConstrained5()
187 if (input >= 2 && input <= 4) in rangeConstrained6()
[all …]
H A Dpr22954.c27 memcpy(a0.s1, input, 4); in f0()
41 memcpy(a1.s1, input, 4); in f1()
55 memcpy(a2.s1, input, 4); in f2()
70 memcpy(dest, input, 4); in f3()
95 memcpy(dest, input, 4); in f4()
115 memcpy(a0.s1, input, 4); in f5()
140 memcpy(dest, input, 4); in f8()
150 memcpy(dest, input, 4); in f9()
161 memcpy(dest, input, 4); in f10()
305 char input[100] = {3}; in f18() local
[all …]
/llvm-project-15.0.7/llvm/test/FileCheck/dump-input/
H A Denable.txt2 ; Create the check file, good input, and bad input.
18 ; Check -dump-input=<bad value>.
33 ; Check -dump-input=help.
38 ; RUN: FileCheck -input-file %t.err -color %t.check -dump-input=help \
46 ; Check -dump-input=never.
95 ; Check -dump-input=fail.
162 ; RUN: -match-full-lines -dump-input=fail -dump-input=fail -v \
174 ; RUN: -dump-input=help -dump-input=always \
180 ; RUN: -match-full-lines -dump-input=always -dump-input=fail \
187 ; RUN: -match-full-lines -dump-input=fail -dump-input=never -v \
[all …]
H A Dcontext.txt8 ; - S: At the start of the input.
10 ; - E: At the end of the input.
162 ; Check -dump-input-context=<bad value>.
178 ; Check -dump-input-context explicit values.
184 ; RUN: -dump-input-context=0 \
217 ; Make sure all is fine when -dump-input-context is far larger than the input.
247 ; RUN: -dump-input-context=1 -dump-input-context=1 \
256 ; RUN: -dump-input-context=0 -dump-input-context=1 \
261 ; RUN: -dump-input-context=1 -dump-input-context=0 \
284 ; elided input lines are considered.
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/SPIRV/Transforms/
H A Dgl-canonicalize.mlir7 %0 = spv.FOrdLessThan %min, %input : f32
8 %mid = spv.Select %0, %input, %min : i1, f32
22 %0 = spv.FOrdLessThan %input, %min : f32
23 %mid = spv.Select %0, %min, %input : i1, f32
24 %1 = spv.FOrdLessThan %max, %input : f32
67 %0 = spv.SLessThan %min, %input : si32
82 %0 = spv.SLessThan %input, %min : si32
84 %1 = spv.SLessThan %max, %input : si32
127 %0 = spv.ULessThan %min, %input : i32
142 %0 = spv.ULessThan %input, %min : i32
[all …]
/llvm-project-15.0.7/llvm/test/DebugInfo/
H A Dsymbolize-filter-markup-color.test3 RUN: echo -e "\033[1mbold\033[0mreset" > %t.input
4 RUN: echo -e "\033[1mboldnoreset" >> %t.input
5 RUN: echo -e "resetafternewline" >> %t.input
6 RUN: echo -e "\033[30mcolor\033[0m" >> %t.input
7 RUN: echo -e "\033[31mcolor\033[0m" >> %t.input
8 RUN: echo -e "\033[32mcolor\033[0m" >> %t.input
9 RUN: echo -e "\033[33mcolor\033[0m" >> %t.input
10 RUN: echo -e "\033[34mcolor\033[0m" >> %t.input
11 RUN: echo -e "\033[35mcolor\033[0m" >> %t.input
12 RUN: echo -e "\033[36mcolor\033[0m" >> %t.input
[all …]
/llvm-project-15.0.7/clang/test/CodeGenOpenCL/
H A Dkernels-have-spir-cc-by-default.cl32 output[0] = input.a;
40 output[0] = (int)input.a;
41 output[1] = (int)input.b;
49 output[0] = input.elementA;
50 output[1] = input.elementB;
51 output[2] = (int)input.elementC;
52 output[3] = (int)input.elementD;
53 output[4] = (int)input.elementE;
62 // CHECK: i64 %input.coerce0, i64 %input.coerce1, i32* nocapture noundef writeonly %output
63 output[0] = (int)input.a;
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/
H A Dranges.remove_if.pass.cpp58 std::array<int, N> input; member
66 auto input = d.input; in test() local
68 auto first = Iter(input.data()); in test()
69 auto last = Sent(Iter(input.data() + input.size())); in test()
74 assert(base(ret.begin()) == input.data() + M); in test()
75 assert(base(ret.end()) == input.data() + N); in test()
80 auto input = d.input; in test() local
81 auto range = std::ranges::subrange(Iter(input.data()), Sent(Iter(input.data() + input.size()))); in test()
87 assert(base(ret.begin()) == input.data() + M); in test()
88 assert(base(ret.end()) == input.data() + N); in test()
[all …]
H A Dranges.remove.pass.cpp54 std::array<int, N> input; member
62 auto input = d.input; in test() local
65 std::ranges::remove(Iter(input.data()), Sent(Iter(input.data() + input.size())), d.val); in test()
67 assert(base(ret.begin()) == input.data() + M); in test()
68 assert(base(ret.end()) == input.data() + N); in test()
73 auto input = d.input; in test() local
74 auto range = std::ranges::subrange(Iter(input.data()), Sent(Iter(input.data() + input.size()))); in test()
78 assert(base(ret.begin()) == input.data() + M); in test()
79 assert(base(ret.end()) == input.data() + N); in test()
91 test<Iter, Sent, 1, 0>({.input = {1}, .expected = {}, .val = 1}); in tests()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.shift/
H A Dshift_right.pass.cpp47 T input[] = { 0, 1, 2 }; in test() local
49 Iter b = Iter(std::begin(input)); in test()
50 Iter e = Iter(std::end(input)); in test()
57 T input[] = { 0, 1, 2 }; in test() local
59 Iter b = Iter(std::begin(input)); in test()
60 Iter e = Iter(std::end(input)); in test()
67 Iter b = Iter(std::begin(input)); in test()
68 Iter e = Iter(std::end(input)); in test()
76 Iter e = Iter(std::end(input)); in test()
86 Iter e = Iter(std::end(input)); in test()
[all …]
H A Dshift_left.pass.cpp47 T input[] = { 0, 1, 2 }; in test() local
49 Iter b = Iter(std::begin(input)); in test()
50 Iter e = Iter(std::end(input)); in test()
58 T input[] = { 0, 1, 2 }; in test() local
60 Iter b = Iter(std::begin(input)); in test()
61 Iter e = Iter(std::end(input)); in test()
68 Iter b = Iter(std::begin(input)); in test()
69 Iter e = Iter(std::end(input)); in test()
77 Iter e = Iter(std::end(input)); in test()
87 Iter e = Iter(std::end(input)); in test()
[all …]

12345678910>>...113