| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-loop.h | 46 tree may_be_zero; /* The boolean expression. If it evaluates to true, member in class:tree_niter_desc
52 may_be_zero == false), more precisely the number
|
| tree-ssa-loop-ivcanon.cc | 622 || !integer_zerop (niter.may_be_zero)
734 edge exit, tree niter, bool may_be_zero,
953 if (may_be_zero)
1094 edge exit, tree niter, bool may_be_zero,
1200 if (may_be_zero)
1237 bool may_be_zero = false; local
1246 may_be_zero
1247 = niter_desc.may_be_zero && !integer_zerop (niter_desc.may_be_zero);
1251 /* For non-constant niter fold may_be_zero into niter again. *
[all...] |
| tree-scalar-evolution.cc | 2826 tree may_be_zero;
2835 may_be_zero = NULL_TREE;
2845 may_be_zero = niter_desc.may_be_zero;
2850 || !may_be_zero
2851 || integer_zerop (may_be_zero))
2853 else if (integer_nonzerop (may_be_zero))
2856 else if (COMPARISON_CLASS_P (may_be_zero))
2857 res = fold_build3 (COND_EXPR, TREE_TYPE (res), may_be_zero,
2821 tree may_be_zero; local
|
| tree-ssa-loop-niter.cc | 1231 niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,
1232 niter->may_be_zero,
1430 niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,
1431 niter->may_be_zero, mbz);
1444 tree step, num, assumptions, may_be_zero, span; local
1447 may_be_zero = fold_build2 (LE_EXPR, boolean_type_node, iv1->base, iv0->base);
1448 if (integer_onep (may_be_zero))
1481 may_be_zero = fold_build2 (EQ_EXPR, boolean_type_node,
1529 niter->may_be_zero = may_be_zero;
2155 tree may_be_zero = boolean_false_node; local
2538 tree may_be_zero = boolean_false_node; local
[all...] |
| tree-ssa-loop-ivopts.cc | 80 2) Add one doloop dedicated IV cand {(may_be_zero ? 1 : (niter + 1)), +, -1},
1502 if (!integer_zerop (niter->may_be_zero))
1505 print_generic_expr (dump_file, niter->may_be_zero, TDF_SLIM);
4439 /* See add_iv_candidate_for_doloop, for doloop may_be_zero case, we
5367 mbz = niter->may_be_zero;
5515 may_be_zero set or not. */
5539 TODO: we could also calculate the value MAY_BE_ZERO ? 0 : NITER and
5542 if (!integer_zerop (desc->may_be_zero))
5829 - Base is (may_be_zero ? 1 : (niter + 1)).
5842 tree may_be_zero = niter_desc->may_be_zero local
[all...] |
| tree-vect-loop.cc | 865 tree niter_assumptions, niter, may_be_zero; local
894 may_be_zero = NULL_TREE;
900 may_be_zero = niter_desc.may_be_zero;
903 if (may_be_zero && integer_zerop (may_be_zero))
904 may_be_zero = NULL_TREE;
906 if (may_be_zero)
908 if (COMPARISON_CLASS_P (may_be_zero))
910 /* Try to combine may_be_zero with assumptions, this can simplif
992 tree may_be_zero = niter_desc.may_be_zero; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-loop.h | 46 tree may_be_zero; /* The boolean expression. If it evaluates to true, member in class:tree_niter_desc
52 may_be_zero == false), more precisely the number
|
| tree-ssa-loop-ivcanon.cc | 578 || !integer_zerop (niter.may_be_zero)
688 edge exit, tree niter, bool may_be_zero,
907 if (may_be_zero)
992 edge exit, tree niter, bool may_be_zero,
1098 if (may_be_zero)
1172 bool may_be_zero = false; local
1181 may_be_zero
1182 = niter_desc.may_be_zero && !integer_zerop (niter_desc.may_be_zero);
1188 /* For non-constant niter fold may_be_zero into niter again. *
[all...] |
| tree-scalar-evolution.cc | 2801 tree may_be_zero;
2810 may_be_zero = NULL_TREE;
2820 may_be_zero = niter_desc.may_be_zero;
2825 || !may_be_zero
2826 || integer_zerop (may_be_zero))
2828 else if (integer_nonzerop (may_be_zero))
2831 else if (COMPARISON_CLASS_P (may_be_zero))
2832 res = fold_build3 (COND_EXPR, TREE_TYPE (res), may_be_zero,
2796 tree may_be_zero; local
|
| tree-ssa-loop-niter.cc | 1246 niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,
1247 niter->may_be_zero,
1448 niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,
1449 niter->may_be_zero, mbz);
1462 tree step, num, assumptions, may_be_zero, span; local
1465 may_be_zero = fold_build2 (LE_EXPR, boolean_type_node, iv1->base, iv0->base);
1466 if (integer_onep (may_be_zero))
1499 may_be_zero = fold_build2 (EQ_EXPR, boolean_type_node,
1547 niter->may_be_zero = may_be_zero;
2816 tree may_be_zero = fold_build2 (EQ_EXPR, boolean_type_node, src, local
[all...] |
| tree-ssa-loop-ivopts.cc | 80 2) Add one doloop dedicated IV cand {(may_be_zero ? 1 : (niter + 1)), +, -1},
1500 if (!integer_zerop (niter->may_be_zero))
1503 print_generic_expr (dump_file, niter->may_be_zero, TDF_SLIM);
4398 /* See add_iv_candidate_for_doloop, for doloop may_be_zero case, we
5318 mbz = niter->may_be_zero;
5466 may_be_zero set or not. */
5489 TODO: we could also calculate the value MAY_BE_ZERO ? 0 : NITER and
5492 if (!integer_zerop (desc->may_be_zero))
5779 - Base is (may_be_zero ? 1 : (niter + 1)).
5792 tree may_be_zero = niter_desc->may_be_zero local
[all...] |
| tree-vect-loop.cc | 734 tree niter_assumptions, niter, may_be_zero; local
745 may_be_zero = NULL_TREE;
751 may_be_zero = niter_desc.may_be_zero;
754 if (may_be_zero && integer_zerop (may_be_zero))
755 may_be_zero = NULL_TREE;
757 if (may_be_zero)
759 if (COMPARISON_CLASS_P (may_be_zero))
761 /* Try to combine may_be_zero with assumptions, this can simplif
[all...] |
