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

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LoopCacheAnalysis.cpp 128 for (const SCEV *Subscript : R.Subscripts)
129 OS << "[" << *Subscript << "]";
187 << "No spacial reuse, difference between subscript:\n\t"
382 return all_of(Subscripts, [&](const SCEV *Subscript) {
383 return isSimpleAddRecurrence(*Subscript, *L);
400 bool allCoeffForLoopAreZero = all_of(Subscripts, [&](const SCEV *Subscript) {
401 return isCoeffForLoopZeroOrInvariant(*Subscript, L);
411 for (const SCEV *Subscript : Subscripts) {
412 if (Subscript == LastSubscript)
414 if (!isCoeffForLoopZeroOrInvariant(*Subscript, L)
    [all...]
DependenceAnalysis.cpp 22 // coupled RDIV subscripts and lacks a multi-subscript MIV test.
35 // Some non-linear subscript pairs can be handled by the GCD test
78 STATISTIC(SeparableSubscriptPairs, "Separable subscript pairs");
79 STATISTIC(CoupledSubscriptPairs, "Coupled subscript pairs");
80 STATISTIC(NonlinearSubscriptPairs, "Nonlinear subscript pairs");
119 "dependence vectors for languages that allow the subscript of one "
245 // if no subscript in the source or destination mention the induction
283 // if no subscript in the source or destination mention the induction
814 void DependenceInfo::unifySubscriptType(ArrayRef<Subscript *> Pairs) {
821 for (Subscript *Pair : Pairs)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DependenceAnalysis.h 177 /// if no subscript in the source or destination mention the induction
258 /// if no subscript in the source or destination mention the induction
342 /// Subscript - This private struct represents a pair of subscripts from
344 /// vector of them to guide subscript partitioning.
345 struct Subscript {
526 /// Makes sure all subscript pairs share the same integer type by
528 /// Sign-extending a subscript is safe because getelementptr assumes the
530 void unifySubscriptType(ArrayRef<Subscript *> Pairs);
532 /// removeMatchingExtensions - Examines a subscript pair.
536 void removeMatchingExtensions(Subscript *Pair)
    [all...]
LoopCacheAnalysis.h 57 assert(SubNum < getNumSubscripts() && "Invalid subscript number");
112 /// loop \p L in the given \p Subscript is zero or is loop invariant in \p L.
113 bool isCoeffForLoopZeroOrInvariant(const SCEV &Subscript,
116 /// Verify that the given \p Subscript is 'well formed' (must be a simple add
118 bool isSimpleAddRecurrence(const SCEV &Subscript, const Loop &L) const;
134 /// The subscript (indexes) of the memory reference.
149 /// 3. they refer to the same array, and the subscript in their innermost
231 /// induction variable is used only in the reference subscript associated
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/RetainCountChecker/
RetainCountDiagnostics.cpp 251 os << "Subscript";
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGDebugInfo.cpp 747 llvm::Metadata *Subscript = DBuilder.getOrCreateSubrange(
749 llvm::DINodeArray SubscriptArray = DBuilder.getOrCreateArray(Subscript);
806 llvm::Metadata *Subscript = DBuilder.getOrCreateSubrange(
808 llvm::DINodeArray SubscriptArray = DBuilder.getOrCreateArray(Subscript);
2864 llvm::Metadata *Subscript;
2868 Subscript = DBuilder.getOrCreateSubrange(
2875 Subscript = DBuilder.getOrCreateSubrange(
2879 llvm::DINodeArray SubscriptArray = DBuilder.getOrCreateArray(Subscript);

Completed in 22 milliseconds