/prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
loopbce.go | 4 ind *Value // induction variable 15 // findIndVar finds induction variables in a function. 44 var ind, max *Value // induction, and maximum 60 // Check that the induction variable is a phi that depends on itself. 72 // Not a recognized induction variable. 91 // Up to now we extracted the induction variable (ind), 99 // We need to prove that the induction variable is incremented 102 // as an induction variable. 126 // We can only guarantee that the loops runs within limits of induction variable 142 b.Func.Config.Warnl(b.Line, "Induction variable with minimum %d and increment %d", min.AuxInt, inc.AuxInt [all...] |
/prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
loopbce.go | 4 ind *Value // induction variable 15 // findIndVar finds induction variables in a function. 44 var ind, max *Value // induction, and maximum 60 // Check that the induction variable is a phi that depends on itself. 72 // Not a recognized induction variable. 91 // Up to now we extracted the induction variable (ind), 99 // We need to prove that the induction variable is incremented 102 // as an induction variable. 126 // We can only guarantee that the loops runs within limits of induction variable 142 b.Func.Config.Warnl(b.Line, "Induction variable with minimum %d and increment %d", min.AuxInt, inc.AuxInt [all...] |
/art/compiler/optimizing/ |
induction_var_analysis.cc | 111 // Detects sequence variables (generalized induction variables) during an outer to inner 186 // Type of induction. 285 // Singleton is wrap-around induction if all internal links have the same meaning. 350 InductionInfo* induction = SolvePhi(phi, /*input_index*/ 1, /*adjust_input_size*/ 0); local 351 if (induction != nullptr) { 352 switch (induction->induction_class) { 354 // Construct combined stride of the linear induction. 355 induction = CreateInduction(kLinear, kNop, induction, initial, /*fetch*/ nullptr, type_); 362 AssignInfo(loop, phi, induction); [all...] |
induction_var_analysis.h | 28 * Induction variable analysis. This class does not have a direct public API. 29 * Instead, the results of induction variable analysis can be queried through 33 * "Beyond Induction Variables: Detecting and Classifying Sequences Using a Demand-Driven SSA Form" 84 * Defines a detected induction as: 160 InductionInfo* RotatePeriodicInduction(InductionInfo* induction, InductionInfo* last); 257 * to the induction information for that instruction in that loop. 262 * Preserves induction cycle information for each loop-phi.
|
induction_var_range.h | 26 * of induction variable analysis in the constructor and provides a public API to obtain 28 * The public API also provides a few general-purpose utility methods related to induction. 58 explicit InductionVarRange(HInductionVarAnalysis* induction); 116 * Returns true if induction analysis is able to generate code for last value of 130 * Updates all matching fetches with the given replacement in all induction information 136 * Incrementally updates induction information for just the given loop. 159 * Checks if the given instruction is a unit stride induction inside the closest enveloping 187 * Returns true if exact or upper/lower bound on the given induction 194 /** Returns whether induction information can be obtained. */ 314 /** Results of prior induction variable analysis. * [all...] |
optimizing_compiler.cc | 777 HInductionVarAnalysis* induction = new (arena) HInductionVarAnalysis(graph); local 778 BoundsCheckElimination* bce = new (arena) BoundsCheckElimination(graph, *side_effects1, induction); 779 HLoopOptimization* loop = new (arena) HLoopOptimization(graph, driver, induction); 815 induction, [all...] |
bounds_check_elimination_test.cc | 53 HInductionVarAnalysis induction(graph_); 54 induction.Run(); 56 BoundsCheckElimination(graph_, side_effects, &induction).Run(); [all...] |
/prebuilts/go/darwin-x86/src/math/ |
sqrt.go | 68 // One may easily use induction to prove (4) and (5).
|
/prebuilts/go/darwin-x86/src/runtime/ |
sqrt.go | 73 // One may easily use induction to prove (4) and (5).
|
/prebuilts/go/darwin-x86/test/ |
loopbce.go | 8 for i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 16 for i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 25 for i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 34 for _, i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 42 for i := 1; i < len(a); i++ { // ERROR "Induction variable with minimum 1 and increment 1$" 50 for i := 0; i < len(a); i += 2 { // ERROR "Induction variable with minimum 0 and increment 2$" 58 for i := -10; i < len(a); i += 2 { // ERROR "Induction variable with minimum -10 and increment 2$" 65 for i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 73 for i := 0; i < len(a); i++ { // ERROR "Induction variable with minimum 0 and increment 1$" 81 for i := 0; len(a) > i; i++ { // ERROR "Induction variable with minimum 0 and increment 1$ [all...] |
/prebuilts/go/linux-x86/src/math/ |
sqrt.go | 68 // One may easily use induction to prove (4) and (5).
|
/prebuilts/go/linux-x86/src/runtime/ |
sqrt.go | 73 // One may easily use induction to prove (4) and (5).
|
/prebuilts/go/linux-x86/test/ |
loopbce.go | 8 for i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 16 for i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 25 for i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 34 for _, i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 42 for i := 1; i < len(a); i++ { // ERROR "Induction variable with minimum 1 and increment 1$" 50 for i := 0; i < len(a); i += 2 { // ERROR "Induction variable with minimum 0 and increment 2$" 58 for i := -10; i < len(a); i += 2 { // ERROR "Induction variable with minimum -10 and increment 2$" 65 for i := range a { // ERROR "Induction variable with minimum 0 and increment 1$" 73 for i := 0; i < len(a); i++ { // ERROR "Induction variable with minimum 0 and increment 1$" 81 for i := 0; len(a) > i; i++ { // ERROR "Induction variable with minimum 0 and increment 1$ [all...] |
/external/libvorbis/doc/ |
07-floor1.tex | 30 \item the induction step chooses a point x_new within an existing 41 \item the induction step repeats, using a list of x values specified in
|
/prebuilts/gcc/darwin-x86/aarch64/aarch64-linux-android-4.9/bin/ |
aarch64-linux-android-gcc-4.9.x | [all...] |
/prebuilts/gcc/darwin-x86/x86/x86_64-linux-android-4.9/bin/ |
x86_64-linux-android-gcc-4.9.x | [all...] |
/prebuilts/gcc/linux-x86/aarch64/aarch64-linux-android-4.9/bin/ |
aarch64-linux-android-gcc-4.9.x | [all...] |
/prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.9/bin/ |
arm-linux-androideabi-gcc-4.9.x | [all...] |
/prebuilts/gcc/linux-x86/mips/mips64el-linux-android-4.9/bin/ |
mips64el-linux-android-gcc-4.9.x | [all...] |
/prebuilts/gcc/linux-x86/x86/x86_64-linux-android-4.9/bin/ |
x86_64-linux-android-gcc-4.9.x | [all...] |