HomeSort by: relevance | last modified time | path
    Searched defs:Accesses (Results 1 - 9 of 9) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMHazardRecognizer.h 48 SmallVector<MachineInstr *, 8> Accesses;
ARMBaseInstrInfo.cpp 1343 SmallVector<const MachineMemOperand *, 1> Accesses;
1344 if (MI.mayStore() && hasStoreToStackSlot(MI, Accesses) &&
1345 Accesses.size() == 1) {
1347 cast<FixedStackPseudoSourceValue>(Accesses.front()->getPseudoValue())
1586 SmallVector<const MachineMemOperand *, 1> Accesses;
1587 if (MI.mayLoad() && hasLoadFromStackSlot(MI, Accesses) &&
1588 Accesses.size() == 1) {
1590 cast<FixedStackPseudoSourceValue>(Accesses.front()->getPseudoValue())
6432 // Walk over the basic block and fix up all the stack accesses.
  /src/sys/external/bsd/acpica/dist/executer/
exprep.c 109 UINT32 Accesses;
159 Accesses = FieldEndOffset - FieldStartOffset;
165 "Field Start %u, Field End %u -- requires %u accesses\n",
166 FieldStartOffset, FieldEndOffset, Accesses));
170 if (Accesses <= 1)
183 if (Accesses < MinimumAccesses)
185 MinimumAccesses = Accesses;
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/UninitializedObject/
UninitializedObjectChecker.cpp 562 auto Accesses = match(stmt(hasDescendant(FieldAccessM)), *MethodBody, AC);
563 if (Accesses.empty())
565 const auto *FirstAccess = Accesses[0].getNodeAs<MemberExpr>("access");
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopAccessAnalysis.h 53 /// Checks memory dependences among accesses to the same underlying
63 /// on the program order of memory accesses to determine their safety.
64 /// At the moment we will only deem accesses as safe for:
85 /// * Zero distances and all accesses have the same size.
91 /// Set of potential dependent memory accesses.
182 Accesses[MemAccessInfo(Ptr, true)].push_back(AccessIdx);
191 Accesses[MemAccessInfo(Ptr, false)].push_back(AccessIdx);
196 /// Check whether the dependencies between the accesses are safe.
215 /// the accesses safely with.
272 DenseMap<MemAccessInfo, std::vector<unsigned> > Accesses;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopDistribute.cpp 630 AccessesType::const_iterator begin() const { return Accesses.begin(); }
631 AccessesType::const_iterator end() const { return Accesses.end(); }
636 Accesses.append(Instructions.begin(), Instructions.end());
644 ++Accesses[Dep.Source].NumUnsafeDependencesStartOrEnd;
645 --Accesses[Dep.Destination].NumUnsafeDependencesStartOrEnd;
652 AccessesType Accesses;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LoopAccessAnalysis.cpp 70 #define DEBUG_TYPE "loop-accesses"
111 /// accesses in code like the following.
334 // the accesses are safe.
346 // accesses to the same underlying object. This cannot happen unless
372 // and add them to the overall solution. We use the order in which accesses
386 // Because DepCands is constructed by visiting accesses in the order in
482 OS.indent(Depth) << "Grouped accesses:\n";
498 /// Analyses memory accesses in a loop.
518 Accesses.insert(MemAccessInfo(Ptr, false));
527 Accesses.insert(MemAccessInfo(Ptr, true))
    [all...]
MemorySSA.cpp 472 // We do have accesses that claim they're optimized, but could be optimized
1022 /// A MemorySSAWalker that does AA walks to disambiguate accesses. It no
1107 AccessList *Accesses = It->second.get();
1108 auto *Phi = cast<MemoryPhi>(&Accesses->front());
1131 AccessList *Accesses = It->second.get();
1132 for (MemoryAccess &L : *Accesses) {
1148 /// We walk the dominator tree in preorder, renaming accesses, and then filling
1153 assert(Root && "Trying to rename accesses in an unreachable block");
1197 /// This handles unreachable block accesses by deleting phi nodes in
1215 AccessList *Accesses = It->second.get()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
AttributorAttributes.cpp 1600 // We need to follow common pointer manipulation uses to the accesses they
1733 /// valid accesses.
1942 // that accesses memory through a pointer operand,
2689 // If the argument is readnone we are done as there are no accesses via the
3721 // We need to follow common pointer manipulation uses to the accesses they
5346 // TODO: We can additionally analyze the accesses in the callee to create
6583 if (const AccessSet *Accesses = AccessKind2Accesses[Idx])
6584 for (const AccessInfo &AI : *Accesses)
6609 /// effect with the pointer it accesses (if any).
6636 /// value of NO_LOCAL_MEM, to the accesses encountered for this memory kind
    [all...]

Completed in 50 milliseconds