Home
last modified time | relevance | path

Searched refs:initial (Results 1 – 25 of 369) sorted by relevance

12345678910>>...15

/llvm-project/libcxx/test/std/strings/basic.string/string.modifiers/string_replace/
H A Dreplace_with_range.pass.cpp48 StrBuffer initial;
56 // - initial string: empty / one-element / n elements;
64 .initial = "", .from = 0, .to = 0, .input = "", .expected = ""};
67 .initial = "", .from = 0, .to = 0, .input = "a", .expected = "a"};
70 .initial = "", .from = 0, .to = 0, .input = "aeiou", .expected = "aeiou"};
73 .initial = "",
82 .initial = "B", .from = 0, .to = 0, .input = "", .expected = "B"};
85 .initial = "B", .from = 0, .to = 0, .input = "a", .expected = "aB"};
88 .initial = "B", .from = 0, .to = 0, .input = "aeiou", .expected = "aeiouB"};
91 .initial
44 StrBuffer initial; global() member
[all...]
/llvm-project/libcxx/test/std/containers/sequences/
H A Dinsert_range_sequence_containers.h121 .initial = {}, .index = 0, .input = {}, .expected = {}
126 .initial = {}, .index = 0, .input = {}, .expected = {}
131 .initial = {}, .index = 0, .input = {5}, .expected = {5}
134 .initial = {}, .index = 0, .input = "a", .expected = "a"
137 .initial = {}, .index = 0, .input = {true}, .expected = {true}
142 .initial = {}, .index = 0, .input = {5, 3, 1, 7, 9}, .expected = {5, 3, 1, 7, 9}
145 .initial = {}, .index = 0, .input = "aeiou", .expected = "aeiou"
148 .initial = {}, .index = 0, .input = {1, 1, 0, 1, 1}, .expected = {1, 1, 0, 1, 1}
155 .initial = {3}, .index = 0, .input = {}, .expected = {3}
158 .initial = "B", .index = 0, .input = {}, .expected = "B"
[all …]
/llvm-project/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/
H A Dinsert_range_after.pass.cpp60 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
72 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
84 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
98 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
110 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
122 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
134 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
146 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
158 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
172 Container c(test_case.initial.begin(), test_case.initial.end()); in test_sequence_insert_range_after()
[all …]
/llvm-project/lld/test/wasm/
H A Dinitial-heap.test3 ; The initial heap size will be added to the stack size
4 RUN: wasm-ld %t.o -o %t1.wasm --stack-first -z stack-size=65536 --initial-heap=131072
8 RUN: wasm-ld %t.o -o %t2.wasm --stack-first -z stack-size=65536 --initial-heap=4294901760
17 RUN: not wasm-ld %t.o -o %t3.wasm --initial-heap=131073 2>&1 | FileCheck %s --check-prefix NOT-PAGE…
18 RUN: not wasm-ld %t.o -o %t4.wasm --stack-first -z stack-size=65536 --initial-heap=4295032832 2>&1 …
19 RUN: not wasm-ld %t.o -o %t5.wasm --stack-first -z stack-size=131072 --initial-heap=4294901760 2>&1…
20 RUN: not wasm-ld %t.o -o %t6.wasm --stack-first -z stack-size=65536 --initial-heap=131072 --initial…
21 RUN: not wasm-ld %t.o -o %t7.wasm --stack-first -z stack-size=65536 --initial-heap=131072 --max-mem…
23 NOT-PAGE-MULTIPLE: initial heap must be 65536-byte aligned
24 TOO-LARGE-BY-ITSELF: initial heap too large, cannot be greater than 4294901760
[all …]
H A Dimport-memory.test18 # RUN: wasm-ld --import-memory --initial-memory=262144 \
22 # Verify the --initial-memory and --max-memory arguments work with imports
36 # RUN: --initial-memory=262144 --max-memory=327680 -o %t.max.wasm %t.start.o
/llvm-project/libcxx/test/std/containers/
H A Dinsert_range_maps_sets.h73 Buffer<T> initial; member
83 .initial = {}, .input = {}, .expected = {}
88 .initial = {}, .input = {1}, .expected = {1}
92 .initial = {}, .input = {{1, 'a'}}, .expected = {{1, 'a'}}
97 .initial = {}, .input = {5, 1, 3, 8, 6}, .expected = {5, 1, 3, 8, 6}
101 .initial = {}, .input = {{5, 'a'}, {1, 'e'}, {3, 'i'}, {8, 'o'}, {6, 'u'}},
107 .initial = {},
114 .initial = {},
124 .initial = {10}, .input = {}, .expected = {10}
128 .initial = {{10, 'A'}}, .input = {}, .expected = {{10, 'A'}}
[all …]
/llvm-project/clang/test/CodeGen/aarch64-sve-intrinsics/
H A Dacle_sve_adda.c
/llvm-project/lld/test/ELF/
H A Dloongarch-reloc-leb128.s37 .uleb128 w2-w1+116 # initial value: 0x0080
38 .uleb128 w1-w2+141 # initial value: 0x0080
39 .uleb128 w2-w1+16372 # initial value: 0x008080
40 .uleb128 w1-w2+16397 # initial value: 0x008080
41 .uleb128 w2-w1+2097140 # initial value: 0x00808080
42 .uleb128 w1-w2+2097165 # initial value: 0x00808080
45 .uleb128 w2-w1+116 # initial value: 0x0080
46 .uleb128 w1-w2+141 # initial value: 0x0080
47 .uleb128 w2-w1+16372 # initial value: 0x008080
48 .uleb128 w1-w2+16397 # initial value: 0x008080
[all …]
H A Driscv-reloc-leb128.s100 .uleb128 w2-w1+120 # initial value: 0x0180
101 .uleb128 w1-w2+137 # initial value: 0x0181
102 .uleb128 w2-w1+16376 # initial value: 0x018080
103 .uleb128 w1-w2+16393 # initial value: 0x018081
104 .uleb128 w2-w1+2097144 # initial value: 0x01808080
105 .uleb128 w1-w2+2097161 # initial value: 0x01808081
111 .uleb128 w2-w1+120 # initial value: 0x0180
112 .uleb128 w1-w2+137 # initial value: 0x0181
113 .uleb128 w2-w1+16376 # initial value: 0x018080
114 .uleb128 w1-w2+16393 # initial value: 0x018081
[all …]
/llvm-project/libcxx/test/std/input.output/string.streams/istringstream/istringstream.members/
H A Dstr.allocator_propagation.pass.cpp77 const CharT* initial = in test_allocation_is_pilfered() local
82 SS ss = SS(S(initial, &mr1)); in test_allocation_is_pilfered()
84 assert(s == initial); in test_allocation_is_pilfered()
93 src.str(S(initial, &mr1)); in test_allocation_is_pilfered()
97 LIBCPP_ASSERT(ss.view() == std::basic_string_view<CharT>(initial).substr(2, 38)); in test_allocation_is_pilfered()
99 LIBCPP_ASSERT(s == std::basic_string_view<CharT>(initial).substr(2, 38)); in test_allocation_is_pilfered()
107 const CharT* initial = in test_no_foreign_allocations() local
112 auto ss = SS(S(initial, &mr1)); in test_no_foreign_allocations()
121 assert(copied == initial); in test_no_foreign_allocations()
129 assert(moved == initial); in test_no_foreign_allocations()
/llvm-project/libcxx/test/std/input.output/string.streams/stringstream/stringstream.members/
H A Dstr.allocator_propagation.pass.cpp77 const CharT* initial = in test_allocation_is_pilfered() local
82 SS ss = SS(S(initial, &mr1)); in test_allocation_is_pilfered()
84 assert(s == initial); in test_allocation_is_pilfered()
93 src.str(S(initial, &mr1)); in test_allocation_is_pilfered()
97 LIBCPP_ASSERT(ss.view() == std::basic_string_view<CharT>(initial).substr(2, 38)); in test_allocation_is_pilfered()
99 LIBCPP_ASSERT(s == std::basic_string_view<CharT>(initial).substr(2, 38)); in test_allocation_is_pilfered()
107 const CharT* initial = in test_no_foreign_allocations() local
112 auto ss = SS(S(initial, &mr1)); in test_no_foreign_allocations()
121 assert(copied == initial); in test_no_foreign_allocations()
129 assert(moved == initial); in test_no_foreign_allocations()
/llvm-project/libcxx/test/std/containers/sequences/vector.bool/
H A Dappend_range.pass.cpp39 auto initial = v; in test() local
45 assert(v.size() == initial.size() + N); in test()
46 … assert(std::ranges::equal(v.begin(), v.begin() + initial.size(), initial.begin(), initial.end())); in test()
47 …assert(std::ranges::equal(v.begin() + initial.size(), v.end(), std::ranges::begin(in), std::ranges… in test()
H A Dinsert_range.pass.cpp40 auto initial = v; in test()
46 assert(v.size() == initial.size() + N); in test()
47 assert(std::ranges::equal(v.begin(), v.begin() + initial.size(), initial.begin(), initial.end())); in test()
48 assert(std::ranges::equal(v.begin() + initial.size(), v.end(), std::ranges::begin(in), std::ranges::end(in))); in test()
39 auto initial = v; test() local
/llvm-project/libcxx/test/std/containers/container.adaptors/
H A Dpush_range_container_adaptors.h59 .initial = {}, .input = {}, .expected = {}
63 .initial = {}, .input = {5}, .expected = {5}
67 .initial = {}, .input = {5, 3, 1, 7, 9}, .expected = {5, 3, 1, 7, 9}
73 .initial = {3}, .input = {}, .expected = {3}
77 .initial = {3}, .input = {-5}, .expected = {3, -5}
81 .initial = {3}, .input = {-5, -3, -1, -7, -9}, .expected = {3, -5, -3, -1, -7, -9}
87 .initial = {11, 29, 35, 14, 84}, .input = {}, .expected = {11, 29, 35, 14, 84}
91 .initial = {11, 29, 35, 14, 84}, .input = {-5}, .expected = {11, 29, 35, 14, 84, -5}
95 .initial = {11, 29, 35, 14, 84},
101 .initial = {11, 29, 35, 14, 84},
[all …]
/llvm-project/libcxx/test/std/input.output/string.streams/ostringstream/ostringstream.members/
H A Dstr.allocator_propagation.pass.cpp63 const CharT* initial = in test_allocation_is_pilfered() local
68 SS ss = SS(S(initial, &mr1)); in test_allocation_is_pilfered()
70 assert(s == initial); in test_allocation_is_pilfered()
78 const CharT* initial = in test_no_foreign_allocations() local
83 auto ss = SS(S(initial, &mr1)); in test_no_foreign_allocations()
92 assert(copied == initial); in test_no_foreign_allocations()
100 assert(moved == initial); in test_no_foreign_allocations()
/llvm-project/llvm/test/Transforms/SimpleLoopUnswitch/
H A Dexponential-nontrivial-unswitch2.ll8 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=1 \
12 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=8 \
16 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=1 \
20 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=8 \
28 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=1 \
32 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=8 \
36 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=1 \
40 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=8 \
H A Dexponential-nontrivial-unswitch.ll6 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=1 \
10 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=8 \
14 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=1 \
18 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=8 \
27 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=1 \
31 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=1 \
40 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=8 \
44 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=8 \
H A Dexponential-switch-unswitch.ll13 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=1 \
17 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=16 \
21 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=1 \
25 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=16 \
36 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=1 \
45 ; RUN: -unswitch-num-initial-unscaled-candidates=8 -unswitch-siblings-toplevel-div=8 \
H A Dexponential-nontrivial-unswitch-nested.ll6 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=1 \
10 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=16 \
14 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=1 \
18 ; RUN: -unswitch-num-initial-unscaled-candidates=0 -unswitch-siblings-toplevel-div=16 \
30 ; RUN: -unswitch-num-initial-unscaled-candidates=4 -unswitch-siblings-toplevel-div=1 \
38 ; RUN: -unswitch-num-initial-unscaled-candidates=4 -unswitch-siblings-toplevel-div=2 \
/llvm-project/clang-tools-extra/docs/clang-tidy/checks/cert/
H A Dint09-c.rst3 :http-equiv=refresh: 5;URL=../readability/enum-initial-value.html
9 :doc:`readability-enum-initial-value <../readability/enum-initial-value>` for
/llvm-project/llvm/test/TableGen/FixedLenDecoderEmitter/
H A DInitValue.td18 let factor{0} = 0; // zero initial value
27 let factor{0} = 1; // non-zero initial value
36 let factor{32} = 1; // non-zero initial value
/llvm-project/compiler-rt/test/fuzzer/
H A Dset_cover_merge.test11 CHECK1: MERGE-OUTER: 3 files, 3 in the initial corpus
23 CHECK2: MERGE-OUTER: 9 files, 3 in the initial corpus
28 CHECK3: MERGE-OUTER: 12 files, 6 in the initial corpus
49 CHECK_OVERLAP: MERGE-OUTER: 10 files, 1 in the initial corpus
71 CHECK_OVERLAP2: MERGE-OUTER: 10 files, 1 in the initial corpus
/llvm-project/libc/src/string/
H A Dstrspn.cpp19 const char *initial = src;
27 return src - initial;
18 const char *initial = src; global() variable
/llvm-project/llvm/test/CodeGen/Mips/
H A Dtls-models.ll22 ; Non-PIC code can use initial-exec, PIC code has to use general dynamic.
47 ; Non-PIC code can use initial exec, PIC should use local dynamic.
72 ; Non-PIC and PIC code will use initial exec as specified.
83 ; Non-PIC code can use local exec, PIC code use initial exec as specified.
/llvm-project/libcxx/test/libcxx/utilities/utility/mem.res/mem.res.pool/
H A Dunsynchronized_buffer.pass.cpp28 void test_pool_options(std::pmr::pool_options initial, std::pmr::pool_options expected) { in test_pool_options() argument
29 std::pmr::unsynchronized_pool_resource mr(initial, std::pmr::null_memory_resource()); in test_pool_options()
32 std::pmr::synchronized_pool_resource mr2(initial, std::pmr::null_memory_resource()); in test_pool_options()

12345678910>>...15