| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| D | 2011-12-19-PostincQuadratic.ll | 4 ; recursive expansion of a quadratic recurrence within for.body7. LSR
13 ; Outer recurrence:
15 ; Inner recurrence:
17 ; Outer step (relative to inner recurrence):
|
| D | lsr-expand-quadratic.ll | 9 ; loop. This recurrence depends on %sub.us, so can't be expanded.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopStrengthReduce/ |
| D | 2011-12-19-PostincQuadratic.ll | 4 ; recursive expansion of a quadratic recurrence within for.body7. LSR
13 ; Outer recurrence:
15 ; Inner recurrence:
17 ; Outer step (relative to inner recurrence):
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
| D | peephole-recurrence.mir | 69 # There is a recurrence formulated around %0, %10, and %3. Check that operands
71 # the recurrence are tied. This will remove redundant copy instruction.
149 # Here a recurrence is formulated around %0, %11, and %3, but operands should
150 # not be commuted because %0 has a use outside of recurrence. This is to
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Analysis/IVUsers/ |
| D | quadradic-exit-value.ll | 34 ; It is valid to fold SCEVUnknown into the recurrence because it
66 ; It is illegal to fold SCEVUnknown (sext.us) into the recurrence
67 ; because it is defined after the loop where this recurrence belongs.
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | 2012-05-29-MulAddRec.ll | 5 ; outer loop. While reducing the recurrence at %mul3, unsigned integer overflow
7 ; the recurrence to be zero, reducing the whole thing to a constant expression.
|
| D | 2011-04-26-FoldAddRec.ll | 2 ; PR9633: Tests that SCEV handles the mul.i2 recurrence being folded to
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Analysis/ScalarEvolution/ |
| D | 2012-05-29-MulAddRec.ll | 5 ; outer loop. While reducing the recurrence at %mul3, unsigned integer overflow
7 ; the recurrence to be zero, reducing the whole thing to a constant expression.
|
| D | 2011-04-26-FoldAddRec.ll | 3 ; PR9633: Tests that SCEV handles the mul.i2 recurrence being folded to
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopIdiom/ |
| D | pr33114.ll | 2 ; Check that we're not crashing while looking at the recurrence variable.
|
| /external/swiftshader/third_party/LLVM/test/Analysis/ScalarEvolution/ |
| D | 2011-04-26-FoldAddRec.ll | 2 ; PR9633: Tests that SCEV handles the mul.i2 recurrence being folded to
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopStrengthReduce/X86/ |
| D | no_superflous_induction_vars.ll | 10 ; expanding the recurrence start value of loop strength reduced values from
|
| D | lsr-expand-quadratic.ll | 18 ; loop. This recurrence depends on %sub.us, so can't be expanded.
|
| /external/llvm/test/Transforms/LoopStrengthReduce/X86/ |
| D | no_superflous_induction_vars.ll | 10 ; expanding the recurrence start value of loop strength reduced values from
|
| /external/swiftshader/third_party/LLVM/test/Transforms/IndVarSimplify/ |
| D | iv-fold.ll | 32 ; a multiple of the recurrence step.
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| D | iv-fold.ll | 32 ; a multiple of the recurrence step.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/IndVarSimplify/ |
| D | iv-fold.ll | 32 ; a multiple of the recurrence step.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Hexagon/ |
| D | swp-large-rec.ll | 6 ; That that we do not pipeline this loop. The recurrence is too large. If
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | loop_dependence.cpp | 140 for (auto recurrence : recurrences) { in CalculateConstantTerm() local
142 recurrence->GetOffset()->AsSEConstantNode()->FoldToSingleValue(); in CalculateConstantTerm()
154 for (SERecurrentNode* recurrence : recurrences) { in CalculateGCDFromCoefficients()
155 auto coefficient = recurrence->GetCoefficient()->AsSEConstantNode(); in CalculateGCDFromCoefficients()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | loop_dependence.cpp | 140 for (auto recurrence : recurrences) { in CalculateConstantTerm() local
142 recurrence->GetOffset()->AsSEConstantNode()->FoldToSingleValue(); in CalculateConstantTerm()
154 for (SERecurrentNode* recurrence : recurrences) { in CalculateGCDFromCoefficients()
155 auto coefficient = recurrence->GetCoefficient()->AsSEConstantNode(); in CalculateGCDFromCoefficients()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopVectorize/X86/ |
| D | uniform-phi.ll | 79 ; Check that first order recurrence phis (%phi32 and %phi64) are not uniform.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopVectorize/ |
| D | first-order-recurrence.ll | 359 ; We vectorize this first order recurrence, by generating two
362 ; the first order recurrence phi is used outside the loop, so we require the phi
405 ; We vectorize this first order recurrence, with a set of insertelements for
407 ; because the shuffle of the first order recurrence will be added after the
|
| /external/python/dateutil/ |
| D | README.rst | 49 * Computing of dates based on very flexible recurrence rules,
|
| /external/skqp/site/dev/testing/ |
| D | skiagold.md | 100 low risk of recurrence
|
| /external/skia/site/dev/testing/ |
| D | skiagold.md | 100 low risk of recurrence
|