| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-loop-versioning.cc | 227 /* The outermost loop that can handle all the version checks
229 class loop *outermost; member in class:__anon13735::loop_info
539 m_loops[i].outermost = get_loop (m_fn, 0);
620 Keep track of the outermost loop that can handle all versioning
622 class loop *outermost local
624 if (loop_depth (li.outermost) < loop_depth (outermost))
625 li.outermost = outermost;
631 if (outermost == loop
[all...] |
| graphite-sese-to-poly.cc | 934 int i, outermost = -1; local
942 outermost = i;
945 return outermost;
|
| gimple-loop-versioning.cc | 227 /* The outermost loop that can handle all the version checks
229 class loop *outermost; member in class:__anon13735::loop_info
539 m_loops[i].outermost = get_loop (m_fn, 0);
620 Keep track of the outermost loop that can handle all versioning
622 class loop *outermost local
624 if (loop_depth (li.outermost) < loop_depth (outermost))
625 li.outermost = outermost;
631 if (outermost == loop
[all...] |
| graphite-sese-to-poly.cc | 934 int i, outermost = -1; local
942 outermost = i;
945 return outermost;
|
| gimple-loop-interchange.cc | 64 2) From innermost to outermost loop, this pass tries to interchange
69 loop to the outermost position. For loop pair <loop_i, loop_j>
975 not need to be preserved in interchanging the outermost two loops
1370 outermost loop that access strides can be computed successfully for
1611 The overall effect is to push inner loop to outermost level in whole
2008 class loop *outermost = loops_for_fn (cfun)->tree_root; local
2010 /* Find loop nest from the innermost loop. The outermost is the innermost
2013 && flow_loop_nested_p (outermost, loop))
2015 if (!proper_loop_form_for_interchange (loop, &outermost))
2077 /* Try to compute data dependences with the outermost loop stripped. *
[all...] |
| gimple-loop-interchange.cc | 64 2) From innermost to outermost loop, this pass tries to interchange
69 loop to the outermost position. For loop pair <loop_i, loop_j>
975 not need to be preserved in interchanging the outermost two loops
1370 outermost loop that access strides can be computed successfully for
1611 The overall effect is to push inner loop to outermost level in whole
2008 class loop *outermost = loops_for_fn (cfun)->tree_root; local
2010 /* Find loop nest from the innermost loop. The outermost is the innermost
2013 && flow_loop_nested_p (outermost, loop))
2015 if (!proper_loop_form_for_interchange (loop, &outermost))
2077 /* Try to compute data dependences with the outermost loop stripped. *
[all...] |
| omp-offload.cc | 586 unsigned outer_mask = mask & (~mask + 1); // Outermost partitioning
1050 /* Create an outermost, dummy OpenACC loop for offloaded function
1573 unsigned outermost = least_bit_hwi (this_mask); local
1575 if (outermost && outermost <= outer_mask)
1584 outer->flags && outer->flags < outermost;
1590 this_mask &= ~outermost;
1652 /* Allocate outermost and non-innermost loops at the outermost
1656 /* Find the first outermost available partition. *
[all...] |
| tree-ssa-loop-im.cc | 80 class loop *max_loop; /* The outermost loop in that the statement
87 /* The outermost loop for that we are sure
152 /* coldest outermost loop for given loop. */
269 /* The outermost loop for which execution of the header guarantees that the
520 /* Suppose that operand DEF is used inside the LOOP. Returns the outermost
522 other operands, i.e. the outermost loop enclosing LOOP in that the value
563 Find the outermost loop enclosing LOOP in that value of DEF is invariant
694 /* Finds the outermost loop between OUTER and LOOP in that the memory reference
773 /* Determine the outermost loop to that it is possible to hoist a statement
775 the outermost loop in that the value computed by STMT is invariant
1117 class loop *outermost = ALWAYS_EXECUTED_IN (bb); local
[all...] |
| omp-offload.cc | 586 unsigned outer_mask = mask & (~mask + 1); // Outermost partitioning
1050 /* Create an outermost, dummy OpenACC loop for offloaded function
1573 unsigned outermost = least_bit_hwi (this_mask); local
1575 if (outermost && outermost <= outer_mask)
1584 outer->flags && outer->flags < outermost;
1590 this_mask &= ~outermost;
1652 /* Allocate outermost and non-innermost loops at the outermost
1656 /* Find the first outermost available partition. *
[all...] |
| tree-ssa-loop-im.cc | 80 class loop *max_loop; /* The outermost loop in that the statement
87 /* The outermost loop for that we are sure
152 /* coldest outermost loop for given loop. */
269 /* The outermost loop for which execution of the header guarantees that the
520 /* Suppose that operand DEF is used inside the LOOP. Returns the outermost
522 other operands, i.e. the outermost loop enclosing LOOP in that the value
563 Find the outermost loop enclosing LOOP in that value of DEF is invariant
694 /* Finds the outermost loop between OUTER and LOOP in that the memory reference
773 /* Determine the outermost loop to that it is possible to hoist a statement
775 the outermost loop in that the value computed by STMT is invariant
1117 class loop *outermost = ALWAYS_EXECUTED_IN (bb); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-loop-versioning.cc | 227 /* The outermost loop that can handle all the version checks
229 class loop *outermost; member in class:__anon16164::loop_info
539 m_loops[i].outermost = get_loop (m_fn, 0);
620 Keep track of the outermost loop that can handle all versioning
622 class loop *outermost local
624 if (loop_depth (li.outermost) < loop_depth (outermost))
625 li.outermost = outermost;
631 if (outermost == loop
[all...] |
| graphite-sese-to-poly.cc | 932 int i, outermost = -1; local
940 outermost = i;
943 return outermost;
|
| gimple-loop-versioning.cc | 227 /* The outermost loop that can handle all the version checks
229 class loop *outermost; member in class:__anon16164::loop_info
539 m_loops[i].outermost = get_loop (m_fn, 0);
620 Keep track of the outermost loop that can handle all versioning
622 class loop *outermost local
624 if (loop_depth (li.outermost) < loop_depth (outermost))
625 li.outermost = outermost;
631 if (outermost == loop
[all...] |
| graphite-sese-to-poly.cc | 932 int i, outermost = -1; local
940 outermost = i;
943 return outermost;
|
| gimple-loop-interchange.cc | 64 2) From innermost to outermost loop, this pass tries to interchange
69 loop to the outermost position. For loop pair <loop_i, loop_j>
973 not need to be preserved in interchanging the outermost two loops
1368 outermost loop that access strides can be computed successfully for
1609 The overall effect is to push inner loop to outermost level in whole
2006 class loop *outermost = loops_for_fn (cfun)->tree_root; local
2008 /* Find loop nest from the innermost loop. The outermost is the innermost
2011 && flow_loop_nested_p (outermost, loop))
2013 if (!proper_loop_form_for_interchange (loop, &outermost))
2075 /* Try to compute data dependences with the outermost loop stripped. *
[all...] |
| omp-offload.cc | 556 unsigned outer_mask = mask & (~mask + 1); // Outermost partitioning
1020 /* Create an outermost, dummy OpenACC loop for offloaded function
1543 unsigned outermost = least_bit_hwi (this_mask); local
1545 if (outermost && outermost <= outer_mask)
1554 outer->flags && outer->flags < outermost;
1560 this_mask &= ~outermost;
1622 /* Allocate outermost and non-innermost loops at the outermost
1626 /* Find the first outermost available partition. *
[all...] |
| gimple-loop-interchange.cc | 64 2) From innermost to outermost loop, this pass tries to interchange
69 loop to the outermost position. For loop pair <loop_i, loop_j>
973 not need to be preserved in interchanging the outermost two loops
1368 outermost loop that access strides can be computed successfully for
1609 The overall effect is to push inner loop to outermost level in whole
2006 class loop *outermost = loops_for_fn (cfun)->tree_root; local
2008 /* Find loop nest from the innermost loop. The outermost is the innermost
2011 && flow_loop_nested_p (outermost, loop))
2013 if (!proper_loop_form_for_interchange (loop, &outermost))
2075 /* Try to compute data dependences with the outermost loop stripped. *
[all...] |
| omp-offload.cc | 556 unsigned outer_mask = mask & (~mask + 1); // Outermost partitioning
1020 /* Create an outermost, dummy OpenACC loop for offloaded function
1543 unsigned outermost = least_bit_hwi (this_mask); local
1545 if (outermost && outermost <= outer_mask)
1554 outer->flags && outer->flags < outermost;
1560 this_mask &= ~outermost;
1622 /* Allocate outermost and non-innermost loops at the outermost
1626 /* Find the first outermost available partition. *
[all...] |
| tree-ssa-loop-im.cc | 78 class loop *max_loop; /* The outermost loop in that the statement
85 /* The outermost loop for that we are sure
150 /* coldest outermost loop for given loop. */
267 /* The outermost loop for which execution of the header guarantees that the
500 /* Suppose that operand DEF is used inside the LOOP. Returns the outermost
502 other operands, i.e. the outermost loop enclosing LOOP in that the value
543 Find the outermost loop enclosing LOOP in that value of DEF is invariant
665 /* Finds the outermost loop between OUTER and LOOP in that the memory reference
744 /* Determine the outermost loop to that it is possible to hoist a statement
746 the outermost loop in that the value computed by STMT is invariant
1072 class loop *outermost = ALWAYS_EXECUTED_IN (bb); local
[all...] |
| tree-ssa-loop-im.cc | 78 class loop *max_loop; /* The outermost loop in that the statement
85 /* The outermost loop for that we are sure
150 /* coldest outermost loop for given loop. */
267 /* The outermost loop for which execution of the header guarantees that the
500 /* Suppose that operand DEF is used inside the LOOP. Returns the outermost
502 other operands, i.e. the outermost loop enclosing LOOP in that the value
543 Find the outermost loop enclosing LOOP in that value of DEF is invariant
665 /* Finds the outermost loop between OUTER and LOOP in that the memory reference
744 /* Determine the outermost loop to that it is possible to hoist a statement
746 the outermost loop in that the value computed by STMT is invariant
1072 class loop *outermost = ALWAYS_EXECUTED_IN (bb); local
[all...] |
| tree-vect-loop-manip.cc | 3520 /* Compute the outermost loop cond_expr and cond_expr_stmt_list are
3522 class loop *outermost = outermost_invariant_loop_for_expr (loop, cond_expr); local
3533 && flow_bb_inside_loop_p (outermost, def_bb))
3534 outermost = superloop_at_depth (loop, bb_loop_depth (def_bb) + 1);
3537 /* Search for the outermost loop we can version. Avoid versioning of
3540 if (flow_loop_nested_p (outermost, loop))
3545 outermost->num);
3546 if (outermost->num == 0)
3547 outermost = superloop_at_depth (loop, 1);
3549 while (loop_to_version != outermost
[all...] |
| tree-vect-loop-manip.cc | 3520 /* Compute the outermost loop cond_expr and cond_expr_stmt_list are
3522 class loop *outermost = outermost_invariant_loop_for_expr (loop, cond_expr); local
3533 && flow_bb_inside_loop_p (outermost, def_bb))
3534 outermost = superloop_at_depth (loop, bb_loop_depth (def_bb) + 1);
3537 /* Search for the outermost loop we can version. Avoid versioning of
3540 if (flow_loop_nested_p (outermost, loop))
3545 outermost->num);
3546 if (outermost->num == 0)
3547 outermost = superloop_at_depth (loop, 1);
3549 while (loop_to_version != outermost
[all...] |
