HomeSort by: relevance | last modified time | path
    Searched defs:assumption (Results 1 - 4 of 4) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
loop-iv.cc 2298 rtx assumption, may_not_xform; local
2444 assumption = simplify_gen_relational (EQ, SImode, mode, tmp,
2446 if (assumption == const_true_rtx)
2454 assumption = simplify_gen_relational (EQ, SImode, mode, tmp,
2456 if (assumption == const_true_rtx)
2462 if (assumption != const0_rtx)
2464 alloc_EXPR_LIST (0, assumption, desc->noloop_assumptions);
2564 completely senseless. This is OK, as we would need this assumption
2608 assumption = simplify_gen_relational (reverse_condition (cond),
2610 if (assumption == const_true_rtx
    [all...]
tree-ssa-loop-niter.cc 977 tree s, c, d, bits, assumption, tmp, bound; local
1116 assumption = fold_build2 (FLOOR_MOD_EXPR, niter_type, c, d);
1117 assumption = fold_build2 (EQ_EXPR, boolean_type_node,
1118 assumption, build_int_cst (niter_type, 0));
1119 if (!integer_nonzerop (assumption))
1121 niter->assumptions, assumption);
1156 tree assumption = boolean_true_node, bound, noloop; local
1197 assumption = fold_build2 (LE_EXPR, boolean_type_node,
1199 if (integer_zerop (assumption))
1212 assumption = fold_build2 (GE_EXPR, boolean_type_node
1249 tree bound, d, assumption, diff; local
1318 tree assumption = boolean_true_node, bound, diff; local
1696 tree assumption; local
3188 tree assumption = fold_build2 (LE_EXPR, boolean_type_node, niter->niter, local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
loop-iv.cc 2314 rtx assumption, may_not_xform; local
2460 assumption = simplify_gen_relational (EQ, SImode, mode, tmp,
2462 if (assumption == const_true_rtx)
2470 assumption = simplify_gen_relational (EQ, SImode, mode, tmp,
2472 if (assumption == const_true_rtx)
2478 if (assumption != const0_rtx)
2480 alloc_EXPR_LIST (0, assumption, desc->noloop_assumptions);
2580 completely senseless. This is OK, as we would need this assumption
2624 assumption = simplify_gen_relational (reverse_condition (cond),
2626 if (assumption == const_true_rtx
    [all...]
tree-ssa-loop-niter.cc 989 tree s, c, d, bits, assumption, tmp, bound; local
1130 assumption = fold_build2 (FLOOR_MOD_EXPR, niter_type, c, d);
1131 assumption = fold_build2 (EQ_EXPR, boolean_type_node,
1132 assumption, build_int_cst (niter_type, 0));
1133 if (!integer_nonzerop (assumption))
1135 niter->assumptions, assumption);
1171 tree assumption = boolean_true_node, bound, noloop; local
1212 assumption = fold_build2 (LE_EXPR, boolean_type_node,
1214 if (integer_zerop (assumption))
1227 assumption = fold_build2 (GE_EXPR, boolean_type_node
1267 tree bound, d, assumption, diff; local
1336 tree assumption = boolean_true_node, bound, diff; local
1714 tree assumption; local
2587 tree assumption = fold_build2 (LE_EXPR, boolean_type_node, niter->niter, local
    [all...]

Completed in 36 milliseconds