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

  /external/llvm/include/llvm/Analysis/
DependenceAnalysis.h 13 // Practical Dependence Testing
17 // There's a single entry point that analyzes the dependence between a pair
18 // of memory references in a function, returning either NULL, for no dependence,
19 // or a more-or-less detailed description of the dependence between them.
22 // passes because there's a useful separation of concerns. A dependence exists
35 // Return a set of more precise dependences instead of just one dependence
57 /// Dependence - This class represents a dependence between two memory
60 /// determine anything beyond the existence of a dependence; that is, it
61 /// represents a confused dependence (see also FullDependence). In mos
    [all...]
LoopAccessAnalysis.h 10 // This file defines the interface for the loop memory dependence framework that
94 /// Note: This class will compute a conservative dependence for access to
132 struct Dependence {
133 /// \brief The type of the dependence.
135 // No dependence.
142 // read and write of A[i]), LAA will locally deem the dependence "safe"
147 // queried and the dependence list is complete.
164 /// \brief Index of the source of the dependence in the InstMap vector.
166 /// \brief Index of the destination of the dependence in the InstMap vector.
168 /// \brief The type of the dependence
    [all...]
  /external/llvm/lib/Analysis/
DependenceAnalysis.cpp 14 // Practical Dependence Testing
18 // There's a single entry point that analyzes the dependence between a pair
19 // of memory references in a function, returning either NULL, for no dependence,
20 // or a more-or-less detailed description of the dependence between them.
28 // subscripts. Since Clang linearizes some array subscripts, the dependence
118 "Dependence Analysis", true, true)
123 "Dependence Analysis", true, true)
154 // Used to test the dependence analyzer.
192 // Dependence methods
194 // Returns true if this is an input dependence
    [all...]
LoopAccessAnalysis.cpp 10 // The implementation for the loop memory dependence that was originally
264 // dependence. Not grouping the checks for a[i] and a[i + 9000] allows
419 /// dependence checking.
470 /// We decided that no dependence analysis would be used. Reset the state.
490 /// Set of accesses that need a further dependence check.
504 /// dependence check.
554 // We assign consecutive id to access from different dependence sets.
574 // The id of the dependence set.
584 // Each access has its own dependence set.
598 // dependence set for this alias set
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonVLIWPacketizer.cpp 16 // prune the dependence.
191 // These instructions confuse the dependence analysis. Consider:
195 // Here, Insn 1 will result in the dependence graph not emitting an output
196 // dependence between Insn 0 and Insn 2. This can lead to incorrect
267 // Check for LR dependence.
275 // Check if this is a predicate dependence.
642 if (TempMI == PacketMI) // We don't want to check PacketMI for dependence.
906 Dependence = false;
    [all...]
HexagonVLIWPacketizer.h 23 // Check if there is a dependence between some instruction already in this
25 bool Dependence;
27 // Only check for dependence if there are resources available to
31 // Track MIs with ignored dependence.
  /external/llvm/lib/Transforms/Scalar/
LoopDistribute.cpp 11 // distribute loops that cannot be vectorized due to dependence cycles. It
15 // For dependence analysis, the pass uses the LoopVectorizer's
77 /// \brief Returns whether this partition contains a dependence cycle.
101 // FIXME: We currently don't use control-dependence but simply include all
197 /// \brief Whether this partition contains a dependence cycle.
240 /// dependence cycles.
535 /// number, we know whether any unsafe dependence crosses over a program point.
537 typedef MemoryDepChecker::Dependence Dependence;
554 const SmallVectorImpl<Dependence> &Dependences)
    [all...]
LoopInterchange.cpp 124 // TODO: Handle Flow dependence.Check if it is sufficient to populate
125 // the Dependence Matrix with the direction reversed.
126 DEBUG(dbgs() << "Flow dependence not handled");
130 DEBUG(dbgs() << "Found Anti dependence \n");
151 if (Dir == Dependence::DVEntry::LT ||
152 Dir == Dependence::DVEntry::LE)
154 else if (Dir == Dependence::DVEntry::GT ||
155 Dir == Dependence::DVEntry::GE)
157 else if (Dir == Dependence::DVEntry::EQ)
185 // A loop is moved from index 'from' to an index 'to'. Update the Dependence
    [all...]
LoopLoadElimination.cpp 62 /// \brief Return true if the dependence from the store to the load has a
73 "Should be a known dependence");
82 // dependence wouldn't be valid if these weren't monotonic accesses.
143 if (Dep.Type == MemoryDepChecker::Dependence::Unknown) {
157 assert(Dep.isForward() && "Needs to be a forward dependence");
200 /// LAA will perform dependence analysis here because there are two
224 // as long as they both have a dependence distance of one to the load.

Completed in 181 milliseconds