HomeSort by relevance Sort by last modified time
    Searched refs:Pointers (Results 1 - 8 of 8) sorted by null

  /external/llvm/lib/Analysis/
AliasAnalysisEvaluator.cpp 13 // pointers in the function.
144 SetVector<Value *> Pointers;
151 Pointers.insert(I);
155 Pointers.insert(&*I);
165 Pointers.insert(Callee);
170 Pointers.insert(*AI);
177 Pointers.insert(*OI);
183 errs() << "Function: " << F.getName() << ": " << Pointers.size()
184 << " pointers, " << CallSites.size() << " call sites\n";
187 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end()
    [all...]
  /external/llvm/lib/IR/
DataLayout.cpp 360 Alignments == Other.Alignments && Pointers == Other.Pointers;
387 return std::lower_bound(Pointers.begin(), Pointers.end(), AddressSpace,
398 if (I == Pointers.end() || I->AddressSpace != AddrSpace) {
399 Pointers.insert(I, PointerAlignElem::get(AddrSpace, ABIAlign, PrefAlign,
489 Pointers.clear();
544 for (const PointerAlignElem &PI : Pointers) {
586 if (I == Pointers.end() || I->AddressSpace != AS) {
595 if (I == Pointers.end() || I->AddressSpace != AS)
    [all...]
  /external/llvm/include/llvm/IR/
DataLayout.h 118 /// pointers vs. 64-bit pointers by extending LayoutAlignment, but for now,
122 PointersTy Pointers;
196 Pointers = DL.Pointers;
300 /// Return target's alignment for stack-based pointers
319 /// If this function is called with a vector of pointers, then the type size
321 /// vector of pointers.
  /external/llvm/lib/Transforms/Scalar/
DeadStoreElimination.cpp 353 // If the start pointers are the same, we just have to compare sizes to see if
386 // If we can't resolve the same pointers to the same object, then we can't
397 // Okay, we have stores to two completely different pointers. Try to
399 // pointers are equal, then we can reason about the two stores.
405 // If the base pointers still differ, we have two completely different stores.
455 /// trivially removed) but a case where two pointers may alias.
719 // Find all of the alloca'd pointers in the entry block.
745 SmallVector<Value *, 4> Pointers;
746 GetUnderlyingObjects(getStoredPointerOperand(BBI), Pointers);
750 for (SmallVectorImpl<Value *>::iterator I = Pointers.begin()
    [all...]
  /external/javassist/src/main/javassist/bytecode/
CodeIterator.java 1055 Pointers pointers = new Pointers(0, 0, 0, etable, ca); local
1094 Pointers pointers = new Pointers(currentPos, mark, where, etable, ca); local
    [all...]
  /external/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 620 /// check that a group of pointers do not overlap.
627 Pointers.clear();
640 /// Holds the pointers that we need to check.
641 SmallVector<TrackingVH<Value>, 2> Pointers;
648 /// Holds the id of the set of pointers that could be dependent because of a
807 /// variables can be pointers.
818 /// We need to check that all of the pointers in this list are disjoint
    [all...]
  /external/clang/test/SemaCXX/
constant-expression-cxx11.cpp 225 namespace Pointers {
    [all...]
  /external/robolectric/lib/main/
javassist-3.14.0-GA.jar 

Completed in 284 milliseconds