Home
last modified time | relevance | path

Searched refs:V2 (Results 1 – 25 of 834) sorted by relevance

12345678910>>...34

/external/llvm-project/clang/test/Analysis/
Dmismatched-iterator.cpp14 void good_insert3(std::vector<int> &V1, std::vector<int> &V2) { in good_insert3() argument
15 V1.insert(V1.cbegin(), V2.cbegin(), V2.cend()); // no-warning in good_insert3()
47 void good_find_first_of(std::vector<int> &V1, std::vector<int> &V2) { in good_find_first_of() argument
48 std::find_first_of(V1.cbegin(), V1.cend(), V2.cbegin(), V2.cend()); // no-warning in good_find_first_of()
51 void good_copy(std::vector<int> &V1, std::vector<int> &V2, int n) { in good_copy() argument
52 std::copy(V1.cbegin(), V1.cend(), V2.begin()); // no-warning in good_copy()
55 void bad_insert1(std::vector<int> &V1, std::vector<int> &V2, int n) { in bad_insert1() argument
56 …V2.insert(V1.cbegin(), n); // expected-warning{{Container accessed using foreign iterator argument… in bad_insert1()
59 void bad_insert2(std::vector<int> &V1, std::vector<int> &V2, int len, int n) { in bad_insert2() argument
60 …V2.insert(V1.cbegin(), len, n); // expected-warning{{Container accessed using foreign iterator arg… in bad_insert2()
[all …]
Dptr-sort.cpp12 std::vector<int *> V2 = {&a, &b}; in PointerSorting() local
22 …std::is_sorted(V2.begin(), V2.end()); // expected-warning {{Sorting pointer-like elements can resu… in PointerSorting()
24 …std::nth_element(V2.begin(), V2.begin() + 1, V2.end()); // expected-warning {{Sorting pointer-like… in PointerSorting()
26 …std::partial_sort(V2.begin(), V2.begin() + 1, V2.end()); // expected-warning {{Sorting pointer-lik… in PointerSorting()
28 …std::sort(V2.begin(), V2.end()); // expected-warning {{Sorting pointer-like elements can result in… in PointerSorting()
30 …std::stable_sort(V2.begin(), V2.end()); // expected-warning {{Sorting pointer-like elements can re… in PointerSorting()
32 …std::partition(V2.begin(), V2.end(), f); // expected-warning {{Sorting pointer-like elements can r… in PointerSorting()
34 …std::stable_partition(V2.begin(), V2.end(), g); // expected-warning {{Sorting pointer-like element… in PointerSorting()
Dcontainer-modeling.cpp43 void move_assignment(std::vector<int> &V1, std::vector<int> &V2) { in move_assignment() argument
46 V2.cbegin(); in move_assignment()
47 V2.cend(); in move_assignment()
50 long B2 = clang_analyzer_container_begin(V2); in move_assignment()
51 long E2 = clang_analyzer_container_end(V2); in move_assignment()
52 V1 = std::move(V2); in move_assignment()
55 clang_analyzer_eval(clang_analyzer_container_end(V2) == E2); // expected-warning{{TRUE}} in move_assignment()
210 void push_back1(std::vector<int> &V1, std::vector<int> &V2, int n) { in push_back1() argument
213 V2.cbegin(); in push_back1()
214 V2.cend(); in push_back1()
[all …]
Dstl-algorithm-modeling.cpp132 void test_find_first_of1(std::vector<int> V1, std::vector<int> V2) { in test_find_first_of1() argument
135 const auto i3 = return_any_iterator(V2.begin()); in test_find_first_of1()
136 const auto i4 = return_any_iterator(V2.begin()); in test_find_first_of1()
153 void test_find_first_of2(std::vector<int> V1, std::vector<int> V2) { in test_find_first_of2() argument
156 const auto i3 = return_any_iterator(V2.begin()); in test_find_first_of2()
157 const auto i4 = return_any_iterator(V2.begin()); in test_find_first_of2()
175 void test_find_first_of3(std::vector<int> V1, std::vector<int> V2) { in test_find_first_of3() argument
178 const auto i3 = return_any_iterator(V2.begin()); in test_find_first_of3()
179 const auto i4 = return_any_iterator(V2.begin()); in test_find_first_of3()
196 void test_find_first_of4(std::vector<int> V1, std::vector<int> V2) { in test_find_first_of4() argument
[all …]
Dstl-algorithm-modeling-aggressive-std-find-modeling.cpp145 void test_find_first_of1(std::vector<int> V1, std::vector<int> V2) { in test_find_first_of1() argument
148 const auto i3 = return_any_iterator(V2.begin()); in test_find_first_of1()
149 const auto i4 = return_any_iterator(V2.begin()); in test_find_first_of1()
168 void test_find_first_of2(std::vector<int> V1, std::vector<int> V2) { in test_find_first_of2() argument
171 const auto i3 = return_any_iterator(V2.begin()); in test_find_first_of2()
172 const auto i4 = return_any_iterator(V2.begin()); in test_find_first_of2()
192 void test_find_first_of3(std::vector<int> V1, std::vector<int> V2) { in test_find_first_of3() argument
195 const auto i3 = return_any_iterator(V2.begin()); in test_find_first_of3()
196 const auto i4 = return_any_iterator(V2.begin()); in test_find_first_of3()
215 void test_find_first_of4(std::vector<int> V1, std::vector<int> V2) { in test_find_first_of4() argument
[all …]
/external/llvm-project/llvm/test/CodeGen/AMDGPU/
Dllvm.amdgcn.workgroup.id.ll1 … -verify-machineinstrs < %s | FileCheck -check-prefix=ALL -check-prefix=CO-V2 -check-prefix=CI-HSA…
2 … -verify-machineinstrs < %s | FileCheck -check-prefix=ALL -check-prefix=CO-V2 -check-prefix=VI-HSA…
5 …own-mesa3d -mcpu=tahiti -verify-machineinstrs < %s | FileCheck -check-prefixes=ALL,CO-V2,SI-MESA %s
6 …nown-mesa3d -mcpu=tonga -verify-machineinstrs < %s | FileCheck -check-prefixes=ALL,CO-V2,VI-MESA %s
14 ; CO-V2: .amd_kernel_code_t
15 ; CO-V2: user_sgpr_count = 6
16 ; CO-V2: enable_sgpr_workgroup_id_x = 1
17 ; CO-V2: enable_sgpr_workgroup_id_y = 0
18 ; CO-V2: enable_sgpr_workgroup_id_z = 0
19 ; CO-V2: enable_sgpr_workgroup_info = 0
[all …]
/external/llvm-project/llvm/test/CodeGen/AMDGPU/GlobalISel/
Dllvm.amdgcn.workgroup.id.ll1 … -verify-machineinstrs < %s | FileCheck -check-prefix=ALL -check-prefix=CO-V2 -check-prefix=CI-HSA…
2 … -verify-machineinstrs < %s | FileCheck -check-prefix=ALL -check-prefix=CO-V2 -check-prefix=VI-HSA…
5 …own-mesa3d -mcpu=hawaii -verify-machineinstrs < %s | FileCheck -check-prefixes=ALL,CO-V2,SI-MESA %s
6 …nown-mesa3d -mcpu=tonga -verify-machineinstrs < %s | FileCheck -check-prefixes=ALL,CO-V2,VI-MESA %s
14 ; CO-V2: .amd_kernel_code_t
15 ; CO-V2: user_sgpr_count = 6
16 ; CO-V2: enable_sgpr_workgroup_id_x = 1
17 ; CO-V2: enable_sgpr_workgroup_id_y = 0
18 ; CO-V2: enable_sgpr_workgroup_id_z = 0
19 ; CO-V2: enable_sgpr_workgroup_info = 0
[all …]
/external/flatbuffers/tests/evolution_test/
Devolution_v2_generated.h10 namespace V2 {
98 template<> struct UnionTraits<Evolution::V2::TableA> {
102 template<> struct UnionTraits<Evolution::V2::TableB> {
106 template<> struct UnionTraits<Evolution::V2::TableC> {
205 return Evolution::V2::CreateTableA(
308 return Evolution::V2::CreateTableC(
331 Evolution::V2::Union c_type() const {
332 return static_cast<Evolution::V2::Union>(GetField<uint8_t>(VT_C_TYPE, 0));
338 const Evolution::V2::TableA *c_as_TableA() const {
339 …return c_type() == Evolution::V2::Union::TableA ? static_cast<const Evolution::V2::TableA *>(c()) …
[all …]
/external/llvm/unittests/ADT/
DTinyPtrVectorTest.cpp40 VectorT V2; member in __anon7f28eeea0111::TinyPtrVectorTest
64 V2.clear(); in setVectors()
65 appendValues(V2, Values2); in setVectors()
153 TypeParam Copy2(this->V2); in TYPED_TEST()
156 this->expectValues(this->V2, this->testArray(0)); in TYPED_TEST()
164 this->V = this->V2; in TYPED_TEST()
166 this->expectValues(this->V2, this->testArray(0)); in TYPED_TEST()
167 this->V = std::move(this->V2); in TYPED_TEST()
171 this->V = this->V2; in TYPED_TEST()
173 this->expectValues(this->V2, this->testArray(0)); in TYPED_TEST()
[all …]
/external/llvm-project/llvm/unittests/ADT/
DTinyPtrVectorTest.cpp42 VectorT V2; member in __anon82b971980111::TinyPtrVectorTest
68 V2.clear(); in setVectors()
69 appendValues(V2, Values2); in setVectors()
157 TypeParam Copy2(this->V2); in TYPED_TEST()
160 this->expectValues(this->V2, this->testArray(0)); in TYPED_TEST()
174 this->V = this->V2; in TYPED_TEST()
176 this->expectValues(this->V2, this->testArray(0)); in TYPED_TEST()
177 this->V = std::move(this->V2); in TYPED_TEST()
181 this->V = this->V2; in TYPED_TEST()
183 this->expectValues(this->V2, this->testArray(0)); in TYPED_TEST()
[all …]
/external/clang/lib/StaticAnalyzer/Core/
DBasicValueFactory.cpp147 const llvm::APSInt& V1, const llvm::APSInt& V2) { in evalAPSInt() argument
154 return &getValue( V1 * V2 ); in evalAPSInt()
157 if (V2 == 0) // Avoid division by zero in evalAPSInt()
159 return &getValue( V1 / V2 ); in evalAPSInt()
162 if (V2 == 0) // Avoid division by zero in evalAPSInt()
164 return &getValue( V1 % V2 ); in evalAPSInt()
167 return &getValue( V1 + V2 ); in evalAPSInt()
170 return &getValue( V1 - V2 ); in evalAPSInt()
179 if (V2.isSigned() && V2.isNegative()) in evalAPSInt()
182 uint64_t Amt = V2.getZExtValue(); in evalAPSInt()
[all …]
/external/llvm-project/clang/lib/StaticAnalyzer/Core/
DBasicValueFactory.cpp205 const llvm::APSInt& V1, const llvm::APSInt& V2) { in evalAPSInt() argument
211 return &getValue( V1 * V2 ); in evalAPSInt()
214 if (V2 == 0) // Avoid division by zero in evalAPSInt()
216 return &getValue( V1 / V2 ); in evalAPSInt()
219 if (V2 == 0) // Avoid division by zero in evalAPSInt()
221 return &getValue( V1 % V2 ); in evalAPSInt()
224 return &getValue( V1 + V2 ); in evalAPSInt()
227 return &getValue( V1 - V2 ); in evalAPSInt()
233 if (V2.isSigned() && V2.isNegative()) in evalAPSInt()
236 uint64_t Amt = V2.getZExtValue(); in evalAPSInt()
[all …]
/external/llvm-project/llvm/test/Object/
Dnm-tapi.test5 RUN: | FileCheck %s -check-prefix V2
18 V2: /u/l/libfoo.dylib (for architecture armv7):
19 V2-NEXT: 00000000 S _sym1
20 V2-NEXT: 00000000 S _sym2
21 V2-NEXT: 00000000 S _sym3
22 V2: /u/l/libfoo.dylib (for architecture armv7s):
23 V2-NEXT: 00000000 S _sym1
24 V2-NEXT: 00000000 S _sym2
25 V2-NEXT: 00000000 S _sym3
26 V2: /u/l/libfoo.dylib (for architecture arm64):
[all …]
/external/opencensus-java/impl_core/src/test/java/io/opencensus/implcore/tags/
DTagContextImplTest.java56 private static final TagValue V2 = TagValue.create("v2"); field in TagContextImplTest
68 TagContextImpl tags = new TagContextImpl(ImmutableMap.of(K1, V1, K2, V2)); in getTags_nonEmpty()
69 assertThat(tags.getTags()).containsExactly(K1, V1, K2, V2); in getTags_nonEmpty()
75 assertThat(((TagContextImpl) tagger.toBuilder(tags).put(K2, V2).build()).getTags()) in put_newKey()
76 .containsExactly(K1, V1, K2, V2); in put_newKey()
82 assertThat(((TagContextImpl) tagger.toBuilder(tags).put(K1, V2).build()).getTags()) in put_existingKey()
83 .containsExactly(K1, V2); in put_existingKey()
92 builder.put(null, V2); in put_nullKey()
106 TagContext tags = new TagContextImpl(ImmutableMap.of(K1, V1, K2, V2)); in remove_existingKey()
108 .containsExactly(K2, V2); in remove_existingKey()
[all …]
/external/mesa3d/src/amd/addrlib/src/
Daddrinterface.cpp1156 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeSurfaceInfo()
1189 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeSurfaceAddrFromCoord()
1222 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeSurfaceCoordFromAddr()
1260 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeHtileInfo()
1293 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeHtileAddrFromCoord()
1327 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeHtileCoordFromAddr()
1366 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeCmaskInfo()
1399 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeCmaskAddrFromCoord()
1433 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeCmaskCoordFromAddr()
1471 V2::Lib* pLib = V2::Lib::GetLib(hLib); in Addr2ComputeFmaskInfo()
[all …]
/external/dagger2/java/dagger/producers/internal/
DAbstractMapProducer.java35 abstract class AbstractMapProducer<K, V, V2> extends AbstractProducer<Map<K, V2>> {
48 public abstract static class Builder<K, V, V2> {
64 Builder<K, V, V2> put(K key, Producer<V> producerOfValue) { in put()
72 Builder<K, V, V2> put(K key, Provider<V> providerOfValue) { in put()
80 Builder<K, V, V2> putAll(Producer<Map<K, V2>> mapOfProducers) { in putAll()
83 DelegateProducer<Map<K, V2>> asDelegateProducer = (DelegateProducer) mapOfProducers; in putAll()
/external/guava/android/guava/src/com/google/common/collect/
DTables.java319 public static <R, C, V1, V2> Table<R, C, V2> transformValues( in transformValues()
320 Table<R, C, V1> fromTable, Function<? super V1, V2> function) { in transformValues()
324 private static class TransformedTable<R, C, V1, V2> extends AbstractTable<R, C, V2> {
326 final Function<? super V1, V2> function;
328 TransformedTable(Table<R, C, V1> fromTable, Function<? super V1, V2> function) { in TransformedTable()
339 public V2 get(Object rowKey, Object columnKey) { in get()
356 public V2 put(R rowKey, C columnKey, V2 value) { in put()
361 public void putAll(Table<? extends R, ? extends C, ? extends V2> table) { in putAll()
366 public V2 remove(Object rowKey, Object columnKey) { in remove()
373 public Map<C, V2> row(R rowKey) { in row()
[all …]
/external/guava/android/guava/src/com/google/common/util/concurrent/
DClosingFuture.java467 public static <V1, V2> Combiner2<V1, V2> whenAllSucceed( in whenAllSucceed()
468 ClosingFuture<V1> future1, ClosingFuture<V2> future2) { in whenAllSucceed()
482 public static <V1, V2, V3> Combiner3<V1, V2, V3> whenAllSucceed( in whenAllSucceed()
483 ClosingFuture<V1> future1, ClosingFuture<V2> future2, ClosingFuture<V3> future3) { in whenAllSucceed()
497 public static <V1, V2, V3, V4> Combiner4<V1, V2, V3, V4> whenAllSucceed( in whenAllSucceed()
499 ClosingFuture<V2> future2, in whenAllSucceed()
515 public static <V1, V2, V3, V4, V5> Combiner5<V1, V2, V3, V4, V5> whenAllSucceed( in whenAllSucceed()
517 ClosingFuture<V2> future2, in whenAllSucceed()
1327 public static final class Combiner2<V1 extends Object, V2 extends Object> extends Combiner {
1337 public interface ClosingFunction2<V1 extends Object, V2 extends Object, U extends Object> {
[all …]
/external/guava/guava/src/com/google/common/util/concurrent/
DClosingFuture.java466 public static <V1, V2> Combiner2<V1, V2> whenAllSucceed( in whenAllSucceed()
467 ClosingFuture<V1> future1, ClosingFuture<V2> future2) { in whenAllSucceed()
481 public static <V1, V2, V3> Combiner3<V1, V2, V3> whenAllSucceed( in whenAllSucceed()
482 ClosingFuture<V1> future1, ClosingFuture<V2> future2, ClosingFuture<V3> future3) { in whenAllSucceed()
496 public static <V1, V2, V3, V4> Combiner4<V1, V2, V3, V4> whenAllSucceed( in whenAllSucceed()
498 ClosingFuture<V2> future2, in whenAllSucceed()
514 public static <V1, V2, V3, V4, V5> Combiner5<V1, V2, V3, V4, V5> whenAllSucceed( in whenAllSucceed()
516 ClosingFuture<V2> future2, in whenAllSucceed()
1325 public static final class Combiner2<V1 extends @Nullable Object, V2 extends @Nullable Object>
1338 V1 extends @Nullable Object, V2 extends @Nullable Object, U extends @Nullable Object> {
[all …]
/external/dagger2/java/dagger/internal/
DAbstractMapFactory.java34 abstract class AbstractMapFactory<K, V, V2> implements Factory<Map<K, V2>> {
47 public abstract static class Builder<K, V, V2> {
63 Builder<K, V, V2> put(K key, Provider<V> providerOfValue) { in put()
68 Builder<K, V, V2> putAll(Provider<Map<K, V2>> mapOfProviders) { in putAll()
71 DelegateFactory<Map<K, V2>> asDelegateFactory = (DelegateFactory) mapOfProviders; in putAll()
/external/llvm/test/CodeGen/PowerPC/
Dvec_perf_shuffle.ll5 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
6 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 undef, i32 undef, i32 7, i32…
12 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
13 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 3, i32 0, i32 undef, i32 5 >…
19 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
20 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 3, i32 undef, i32 7, i32 3 >…
26 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
27 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 3, i32 7, i32 7, i32 4 > ; …
33 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
34 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 4, i32 4, i32 5, i32 0 > ; …
/external/llvm-project/llvm/test/CodeGen/PowerPC/
Dvec_perf_shuffle.ll5 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
6 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 undef, i32 undef, i32 7, i32…
12 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
13 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 3, i32 0, i32 undef, i32 5 >…
19 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
20 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 3, i32 undef, i32 7, i32 3 >…
26 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
27 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 3, i32 7, i32 7, i32 4 > ; …
33 %V2 = load <4 x float>, <4 x float>* %P2 ; <<4 x float>> [#uses=1]
34 …%V3 = shufflevector <4 x float> %V1, <4 x float> %V2, <4 x i32> < i32 4, i32 4, i32 5, i32 0 > ; …
/external/llvm-project/llvm/test/CodeGen/BPF/
Dsetcc.ll2 ; RUN: llc -march=bpfel -mcpu=v2 < %s | FileCheck --check-prefix=CHECK-V2 %s
12 ; CHECK-V2: if r1 == 0
22 ; CHECK-V2: if r1 != 0
31 ; CHECK-V2: if r1 != r2
40 ; CHECK-V2: if r1 == r2
49 ; CHECK-V2: if r1 > r2
58 ; CHECK-V2: if r1 >= r2
67 ; CHECK-V2: if r1 < r2
76 ; CHECK-V2: if r1 <= r2
85 ; CHECK-V2: if r1 s> r2
[all …]
/external/llvm-project/llvm/test/MC/AArch64/
Darmv8a-fpmul.s13 FMLAL V0.2S, V1.2H, V2.2H
14 FMLSL V0.2S, V1.2H, V2.2H
15 FMLAL V0.4S, V1.4H, V2.4H
16 FMLSL V0.4S, V1.4H, V2.4H
17 FMLAL2 V0.2S, V1.2H, V2.2H
18 FMLSL2 V0.2S, V1.2H, V2.2H
19 FMLAL2 V0.4S, V1.4H, V2.4H
20 FMLSL2 V0.4S, V1.4H, V2.4H
/external/llvm-project/llvm/test/CodeGen/Hexagon/autohvx/
Dwiden-ext.ll7 ; CHECK: v[[V1:[0-9]+]]:[[V2:[0-9]+]].h = vunpack(v[[V0]].b)
9 ; CHECK: if (q[[Q0]]) vmem(r1+#0) = v[[V2]]
20 ; CHECK: v[[V1:[0-9]+]]:[[V2:[0-9]+]].h = vunpack(v[[V0]].b)
21 ; CHECK: v[[V3:[0-9]+]]:[[V4:[0-9]+]].w = vunpack(v[[V2]].h)
33 ; CHECK: v[[V1:[0-9]+]]:[[V2:[0-9]+]].h = vunpack(v[[V0]].b)
34 ; CHECK: vmem(r1+#0) = v[[V2]]
45 ; CHECK: v[[V1:[0-9]+]]:[[V2:[0-9]+]].h = vunpack(v[[V0]].b)
46 ; CHECK: v[[V3:[0-9]+]]:[[V4:[0-9]+]].w = vunpack(v[[V2]].h)
60 ; CHECK: v[[V1:[0-9]+]]:[[V2:[0-9]+]].w = vunpack(v[[V0]].h)
62 ; CHECK: if (q[[Q0]]) vmem(r1+#0) = v[[V2]]
[all …]

12345678910>>...34