HomeSort by: relevance | last modified time | path
    Searched refs:Pointers (Results 1 - 15 of 15) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/AST/Interp/
InterpBlock.cpp 24 if (Pointers)
25 Pointers->Prev = P;
26 P->Next = Pointers;
28 Pointers = P;
34 if (Pointers == P)
35 Pointers = P->Next;
43 if (Pointers == nullptr && IsDead)
56 if (Pointers == From)
57 Pointers = To;
73 // Transfer pointers
    [all...]
InterpBlock.h 50 /// Checks if the block has any live pointers.
51 bool hasPointers() const { return Pointers; }
94 /// Start of the chain of pointers.
95 Pointer *Pointers = nullptr;
111 /// whenever pointers become dead.
133 /// Actual block storing data and tracking pointers.
  /src/external/apache2/llvm/dist/libcxx/benchmarks/
allocation.bench.cpp 101 std::vector<void*> Pointers(NumAllocs);
102 for (auto& p : Pointers) {
106 void** Data = Pointers.data();
107 void** const End = Pointers.data() + Pointers.size();
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
AliasAnalysisEvaluator.cpp 102 SetVector<Value *> Pointers;
109 Pointers.insert(&I);
113 Pointers.insert(&Inst);
122 Pointers.insert(Callee);
126 Pointers.insert(DataOp);
132 Pointers.insert(Op);
138 errs() << "Function: " << F.getName() << ": " << Pointers.size()
139 << " pointers, " << Calls.size() << " call sites\n";
142 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end()
    [all...]
LoopAccessAnalysis.cpp 173 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
174 Low(RtCheck.Pointers[Index].Start) {
233 Pointers.emplace_back(Ptr, ScStart, ScEnd, WritePtr, DepSetId, ASId, Sc);
283 const SCEV *Start = RtCheck.Pointers[Index].Start;
284 const SCEV *End = RtCheck.Pointers[Index].End;
313 // - We know that pointers in the same equivalence class share
315 // that we can compare pointers
316 // - We wouldn't be able to merge two pointers for which we need
318 // conveniently built such that no two pointers in the same
330 // If we need to check two pointers to the same underlying objec
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/IR/
DataLayout.cpp 545 Alignments == Other.Alignments && Pointers == Other.Pointers;
589 auto I = lower_bound(Pointers, AddressSpace,
593 if (I != Pointers.end() && I->AddressSpace == AddressSpace)
597 assert(Pointers[0].AddressSpace == 0);
598 return Pointers[0];
608 auto I = lower_bound(Pointers, AddrSpace,
612 if (I == Pointers.end() || I->AddressSpace != AddrSpace) {
613 Pointers.insert(I, PointerAlignElem::get(AddrSpace, ABIAlign, PrefAlign,
662 Pointers.clear()
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopAccessAnalysis.h 58 /// different underlying pointers. Clients, such as the loop vectorizer, will
337 /// A grouping of pointers. A single memcheck is required between
356 /// pointers in this group.
359 /// pointers in this group.
361 /// Indices of all the pointers that constitute this grouping.
365 /// A memcheck which made up of a pair of grouped pointers.
371 /// that a group of pointers do not overlap.
387 /// Holds the id of the set of pointers that could be dependent because of a
408 Pointers.clear();
422 bool empty() const { return Pointers.empty();
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
DataLayout.h 163 PointersTy Pointers;
170 /// Pointers in these address spaces are non-integral, and don't have a
223 Pointers = DL.Pointers;
281 /// Returns the alignment of function pointers, which may or may not be
365 /// Return target's alignment for stack-based pointers
381 /// Return the address spaces containing non-integral pointers. Pointers in
420 /// If this function is called with a vector of pointers, then the type size
422 /// vector of pointers
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/
PrettyTypeDumper.cpp 207 if (opts::pretty::Pointers)
208 dumpSymbolCategory<PDBSymbolTypePointer>(Printer, Exe, *this, "Pointers");
llvm-pdbutil.h 87 extern llvm::cl::opt<bool> Pointers;
llvm-pdbutil.cpp 180 static cl::opt<bool> Pointers("pointers", cl::desc("Dump enum types"),
246 cl::opt<bool> Pointers("pointers", cl::desc("Display pointer types"),
1024 if (opts::diadump::Pointers)
1203 opts::pretty::Funcsigs || opts::pretty::Pointers ||
1535 opts::pretty::Pointers = true;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopDistribute.cpp 509 unsigned N = RtPtrCheck->Pointers.size();
512 Value *Ptr = RtPtrCheck->Pointers[I].PointerValue;
514 LAI.getInstructionsForAccess(Ptr, RtPtrCheck->Pointers[I].IsWritePtr);
900 /// Filter out checks between pointers from the same partition.
902 /// \p PtrToPartition contains the partition number for pointers. Partition
915 // Only include this check if there is a pair of pointers
916 // that require checking and the pointers fall into
921 // that each pair of pointers within the two groups need
925 // because there is a pair of pointers between the two
927 // pair whose pointers fall into different partitions.
    [all...]
DeadStoreElimination.cpp 346 // Pointers.
953 // If the start pointers are the same, we just have to compare sizes to see if
975 // If we can't resolve the same pointers to the same object, then we can't
986 // Okay, we have stores to two completely different pointers. Try to
988 // pointers are equal, then we can reason about the two stores.
994 // If the base pointers still differ, we have two completely different stores.
1738 SmallVector<const Value *, 4> Pointers;
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGOpenMPRuntime.cpp 2351 /// Given an array of pointers to variables, project the address of a
7090 /// descriptor_dim pointers and use args_size as dims. Used when we have
7151 /// clauses, including base pointers, pointers, sizes, map types, user-defined
7163 MapValuesArrayTy Pointers;
7174 Pointers.append(CurInfo.Pointers.begin(), CurInfo.Pointers.end());
7434 /// Generate the base pointers, section pointers, sizes, map type bits, an
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LoopUtils.cpp 1149 // If an SCEV expression subsumed multiple pointers, its expansion could
1154 // producing an expression involving multiple pointers. Until then, we must
1179 // If the GEP base pointer is a vector of pointers, abort.
1588 // TODO: Add helper to retrieve pointers to CG.
1589 Value *Ptr = CG->RtCheck.Pointers[CG->Members[0]].PointerValue;
1623 /// lower bounds for both pointers in the check.
1668 // Check if two pointers (A and B) conflict where conflict is computed as:
1675 "Trying to bounds check pointers with different address spaces");

Completed in 65 milliseconds