HomeSort by relevance Sort by last modified time
    Searched defs:V2 (Results 1 - 25 of 58) sorted by null

1 2 3

  /external/clang/test/CodeGenCXX/
weak-extern-typeinfo.cpp 28 class V2 : public virtual V1 {
32 void V2::foo() { }
vtable-layout-abi-examples.cpp 210 struct V2 : virtual V1 {
211 int v2; member in struct:Test3::V2
232 // CHECK-7-NEXT: -- (Test3::V2, 32) vtable address --
236 // CHECK-8: Construction vtable for ('Test3::V2', 32) in 'Test3::C' (9 entries).
240 // CHECK-8-NEXT: 3 | Test3::V2 RTTI
241 // CHECK-8-NEXT: -- (Test3::V2, 32) vtable address --
242 // CHECK-8-NEXT: 4 | void Test3::V2::f()
245 // CHECK-8-NEXT: 7 | Test3::V2 RTTI
247 // CHECK-8-NEXT: 8 | void Test3::V2::f()
249 struct C : virtual V1, virtual V2 {
    [all...]
vtt-layout.cpp 31 class V2 : public B1, public B2, public virtual V1 { int i; };
34 class C2 : public virtual V3, virtual V2 { int i; };
50 class V2 : public B1, public B2, public virtual V1 { int i; };
53 class C2 : public virtual V3, virtual V2 { int i; };
thunks.cpp 50 struct V2 : virtual V1 { };
59 virtual V2 *f();
63 V2 *B::f() { return 0; }
  /external/eigen/test/eigen2/
eigen2_smallvectors.cpp 14 typedef Matrix<Scalar, 1, 2> V2;
21 V2 v2(x1, x2);
24 VERIFY_IS_APPROX(x1, v2.x());
27 VERIFY_IS_APPROX(x2, v2.y());
  /external/chromium_org/content/browser/dom_storage/
dom_storage_database.h 73 V2
86 // Creates the database table at V2. Returns true if the table was created
  /external/eigen/test/
smallvectors.cpp 15 typedef Matrix<Scalar, 1, 2> V2;
23 V2 v2(x1, x2);
26 VERIFY_IS_APPROX(x1, v2.x());
29 VERIFY_IS_APPROX(x2, v2.y());
  /external/llvm/unittests/ADT/
TinyPtrVectorTest.cpp 42 VectorT V2;
66 V2.clear();
67 appendValues(V2, Values2);
155 TypeParam Copy2(this->V2);
158 this->expectValues(this->V2, this->testArray(0));
168 this->V = this->V2;
170 this->expectValues(this->V2, this->testArray(0));
172 this->V = std::move(this->V2);
177 this->V = this->V2;
179 this->expectValues(this->V2, this->testArray(0))
    [all...]
IntrusiveRefCntPtrTest.cpp 23 VirtualRefCounted *V2 = new VirtualRefCounted(*V1);
24 IntrusiveRefCntPtr<VirtualRefCounted> R2 = V2;
  /external/chromium_org/third_party/skia/src/sfnt/
SkOTTable_OS_2.h 34 struct V2 : SkOTTableOS2_V2 { } v2; member in union:SkOTTableOS2::Version
48 SK_COMPILE_ASSERT(sizeof(SkOTTableOS2::Version::V2) == 96, sizeof_SkOTTableOS2__V2_not_96);
  /external/llvm/lib/Support/
FileUtilities.cpp 86 double V1 = 0.0, V2 = 0.0;
105 V2 = strtod(F2P, const_cast<char**>(&F2NumEnd));
123 V2 = strtod(&StrTmp[0], const_cast<char**>(&F2NumEnd));
140 if (AbsTolerance < std::abs(V1-V2)) {
143 if (V2)
144 Diff = std::abs(V1/V2 - 1.0);
146 Diff = std::abs(V2/V1 - 1.0);
152 << "Compared: " << V1 << " and " << V2 << '\n'
153 << "abs. diff = " << std::abs(V1-V2) << " rel.diff = " << Diff << '\n'
StringMap.cpp 160 StringMapEntryBase *V2 = RemoveKey(StringRef(VStr, V->getKeyLength()));
161 (void)V2;
162 assert(V == V2 && "Didn't find key?");
  /external/llvm/utils/TableGen/
DAGISelEmitter.cpp 86 MVT::SimpleValueType V1 = LHSSrc->getType(0), V2 = RHSSrc->getType(0);
87 if (MVT(V1).isVector() != MVT(V2).isVector())
88 return MVT(V2).isVector();
90 if (MVT(V1).isFloatingPoint() != MVT(V2).isFloatingPoint())
91 return MVT(V2).isFloatingPoint();
  /external/skia/src/sfnt/
SkOTTable_OS_2.h 34 struct V2 : SkOTTableOS2_V2 { } v2; member in union:SkOTTableOS2::Version
48 SK_COMPILE_ASSERT(sizeof(SkOTTableOS2::Version::V2) == 96, sizeof_SkOTTableOS2__V2_not_96);
  /external/llvm/unittests/Support/
AlignOfTest.cpp 71 struct V2 { int x; virtual ~V2(); };
73 struct V4 : virtual V2 { int y; virtual ~V4(); };
76 struct V7 : virtual V2, virtual V6 { virtual ~V7(); };
82 V2::~V2() {}
128 [AlignOf<V2>::Alignment > 0]
168 EXPECT_LE(alignOf<V1>(), alignOf<V2>());
246 EXPECT_EQ(alignOf<V2>(), alignOf<AlignedCharArrayUnion<V2> >());
    [all...]
  /external/clang/test/Sema/
const-eval.c 62 static struct a V2 = (struct a)(struct a){ 1, 2};
  /external/llvm/lib/Target/Hexagon/
HexagonSubtarget.h 36 V1, V2, V3, V4, V5
55 bool hasV2TOps () const { return HexagonArchVersion >= V2; }
56 bool hasV2TOpsOnly () const { return HexagonArchVersion == V2; }
66 bool isSubtargetV2() const { return HexagonArchVersion == V2;}
  /external/llvm/unittests/Analysis/
ScalarEvolutionTest.cpp 50 Value *V2 = new GlobalVariable(M, Ty, false, GlobalValue::ExternalLinkage, Init, "V2");
58 const SCEV *S2 = SE.getSCEV(V2);
78 EXPECT_EQ(cast<SCEVUnknown>(M2->getOperand(1))->getValue(), V2);
81 V2->replaceAllUsesWith(V1);
  /external/llvm/unittests/IR/
MetadataTest.cpp 136 Value *const V2 = C2;
138 MDNode *n2 = MDNode::get(Context, V2);
  /external/llvm/unittests/Transforms/Utils/
Cloning.cpp 33 Value *V2 = V1->clone();
35 Clones.insert(V2);
36 return cast<T>(V2);
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/
R600KernelParameters.cpp 170 Value* V2 = dyn_cast<Value>(*I);
172 if (V2) {
173 if (IsIndirect(V2, Visited)) {
303 Value* V2 = dyn_cast<Value>(Users[i]);
305 if (V2) {
306 Propagate(V2, Name, IsIndirect);
  /external/llvm/lib/Analysis/
AliasAnalysisEvaluator.cpp 92 const Value *V2, const Module *M) {
98 WriteAsOperand(os2, V2, true, M);
130 const Value *V2, const Module *M) {
133 << " <-> " << *V2 << '\n';
  /external/llvm/lib/Target/Mips/
Mips16ISelDAGToDAG.cpp 75 unsigned V0, V1, V2, GlobalBaseReg = MipsFI->getGlobalBaseReg();
81 V2 = RegInfo.createVirtualRegister(RC);
87 BuildMI(MBB, I, DL, TII.get(Mips::SllX16), V2).addReg(V0).addImm(16);
89 .addReg(V1).addReg(V2);
  /external/llvm/lib/Target/NVPTX/
NVPTXUtilities.cpp 360 const Value *V2 = V->stripPointerCasts();
361 if (V2 != V && processed.find(V2) != processed.end())
363 processed.insert(V2);
365 V = V2;
377 if (V != V2 && processed.find(V) != processed.end())
  /external/llvm/lib/Transforms/InstCombine/
InstCombineLoadStoreAlloca.cpp 415 // load (select (Cond, &V1, &V2)) --> select(Cond, load &V1, load &V2).
421 LoadInst *V2 = Builder->CreateLoad(SI->getOperand(2),
424 V2->setAlignment(Align);
425 return SelectInst::Create(SI->getCondition(), V1, V2);
685 /// if () { *P = v1; } else { *P = v2 }
689 /// *P = v1; if () { *P = v2; }

Completed in 400 milliseconds

1 2 3