| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-loop-interchange.cc | 1 /* Loop interchange.
45 /* This pass performs loop interchange: for example, the loop nest
59 This pass implements loop interchange in the following steps:
64 2) From innermost to outermost loop, this pass tries to interchange
65 each loop pair. For above case, it firstly tries to interchange
67 Then it tries to interchange <loop_j, loop_i> and loop nest becomes
71 3) Check if data dependence relations are valid for loop interchange.
74 6) Interchange the two loops by mapping induction variables.
85 interchanged. This is the minimum stride ratio for loop interchange
172 /* Loop candidate for interchange. *
1605 tree_loop_interchange::interchange (vec<data_reference_p> datarefs, function in class:tree_loop_interchange
[all...] |
| gimple-loop-interchange.cc | 1 /* Loop interchange.
45 /* This pass performs loop interchange: for example, the loop nest
59 This pass implements loop interchange in the following steps:
64 2) From innermost to outermost loop, this pass tries to interchange
65 each loop pair. For above case, it firstly tries to interchange
67 Then it tries to interchange <loop_j, loop_i> and loop nest becomes
71 3) Check if data dependence relations are valid for loop interchange.
74 6) Interchange the two loops by mapping induction variables.
85 interchanged. This is the minimum stride ratio for loop interchange
172 /* Loop candidate for interchange. *
1605 tree_loop_interchange::interchange (vec<data_reference_p> datarefs, function in class:tree_loop_interchange
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-loop-interchange.cc | 1 /* Loop interchange.
45 /* This pass performs loop interchange: for example, the loop nest
59 This pass implements loop interchange in the following steps:
64 2) From innermost to outermost loop, this pass tries to interchange
65 each loop pair. For above case, it firstly tries to interchange
67 Then it tries to interchange <loop_j, loop_i> and loop nest becomes
71 3) Check if data dependence relations are valid for loop interchange.
74 6) Interchange the two loops by mapping induction variables.
85 interchanged. This is the minimum stride ratio for loop interchange
172 /* Loop candidate for interchange. *
1603 tree_loop_interchange::interchange (vec<data_reference_p> datarefs, function in class:tree_loop_interchange
[all...] |
| gimple-loop-interchange.cc | 1 /* Loop interchange.
45 /* This pass performs loop interchange: for example, the loop nest
59 This pass implements loop interchange in the following steps:
64 2) From innermost to outermost loop, this pass tries to interchange
65 each loop pair. For above case, it firstly tries to interchange
67 Then it tries to interchange <loop_j, loop_i> and loop nest becomes
71 3) Check if data dependence relations are valid for loop interchange.
74 6) Interchange the two loops by mapping induction variables.
85 interchanged. This is the minimum stride ratio for loop interchange
172 /* Loop candidate for interchange. *
1603 tree_loop_interchange::interchange (vec<data_reference_p> datarefs, function in class:tree_loop_interchange
[all...] |
