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

  /external/llvm/include/llvm/IR/
DataLayout.h 109 /// pointers vs. 64-bit pointers by extending LayoutAlignment, but for now,
112 DenseMap<unsigned, PointerAlignElem> Pointers;
180 Pointers(DL.Pointers),
241 DenseMap<unsigned, PointerAlignElem>::const_iterator val = Pointers.find(AS);
242 if (val == Pointers.end()) {
243 val = Pointers.find(0);
248 /// Return target's alignment for stack-based pointers
252 DenseMap<unsigned, PointerAlignElem>::const_iterator val = Pointers.find(AS)
    [all...]
  /external/llvm/lib/Analysis/
AliasAnalysisEvaluator.cpp 13 // pointers in the function.
145 SetVector<Value *> Pointers;
152 Pointers.insert(I);
156 Pointers.insert(&*I);
166 Pointers.insert(Callee);
171 Pointers.insert(*AI);
178 Pointers.insert(*OI);
184 errs() << "Function: " << F.getName() << ": " << Pointers.size()
185 << " pointers, " << CallSites.size() << " call sites\n";
188 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end()
    [all...]
  /external/llvm/lib/IR/
DataLayout.cpp 342 DenseMap<unsigned,PointerAlignElem>::iterator val = Pointers.find(addr_space);
343 if (val == Pointers.end()) {
344 Pointers[addr_space] = PointerAlignElem::get(addr_space,
478 pib = Pointers.begin(), pie = Pointers.end();
485 const PointerAlignElem &PI = Pointers.find(*asb)->second;
  /external/llvm/lib/Transforms/Scalar/
DeadStoreElimination.cpp 347 // If the start pointers are the same, we just have to compare sizes to see if
384 // If we can't resolve the same pointers to the same object, then we can't
395 // Okay, we have stores to two completely different pointers. Try to
397 // pointers are equal, then we can reason about the two stores.
403 // If the base pointers still differ, we have two completely different stores.
453 /// trivially removed) but a case where two pointers may alias.
733 // Find all of the alloca'd pointers in the entry block.
759 SmallVector<Value *, 4> Pointers;
760 GetUnderlyingObjects(getStoredPointerOperand(BBI), Pointers);
764 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 450 // check that a group of pointers do not overlap.
457 Pointers.clear();
468 /// Holds the pointers that we need to check.
469 SmallVector<TrackingVH<Value>, 2> Pointers;
476 /// Holds the id of the set of pointers that could be dependent because of a
610 /// variables can be pointers.
621 /// 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 732 milliseconds