| /openbsd-src/gnu/gcc/gcc/ |
| H A D | tree-ssa-phiopt.c | 645 if (cmp == LT_EXPR || cmp == LE_EXPR) in minmax_replacement()
756 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, in minmax_replacement()
840 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, in minmax_replacement()
926 && cond_code != LT_EXPR && cond_code != LE_EXPR) in abs_replacement()
|
| H A D | tree-vrp.c | 921 cmp2 = fold_binary_to_constant (LE_EXPR, boolean_type_node, val, vr->max); in value_inside_range()
1154 else if (cond_code == LE_EXPR || cond_code == LT_EXPR) in extract_range_from_assert()
2681 || comp == LE_EXPR) in compare_ranges()
2712 comp = (comp == GT_EXPR) ? LT_EXPR : LE_EXPR; in compare_ranges()
2773 else if (comp == LT_EXPR || comp == LE_EXPR) in compare_ranges()
2780 || (comp == LE_EXPR && (tst == -1 || tst == 0))) in compare_ranges()
2791 || (comp == LE_EXPR && tst == 1)) in compare_ranges()
2830 || comp == LE_EXPR) in compare_range_with_value()
2877 else if (comp == LT_EXPR || comp == LE_EXPR) in compare_range_with_value()
2884 || (comp == LE_EXPR && (tst == -1 || tst == 0))) in compare_range_with_value()
[all …]
|
| H A D | fold-const.c | 2354 return honor_nans ? UNLE_EXPR : LE_EXPR; in invert_tree_comparison()
2359 case LE_EXPR: in invert_tree_comparison()
2366 return LE_EXPR; in invert_tree_comparison()
2400 return LE_EXPR; in swap_tree_comparison()
2403 case LE_EXPR: in swap_tree_comparison()
2432 case LE_EXPR: in comparison_to_compcode()
2475 return LE_EXPR; in compcode_to_comparison()
3903 case LE_EXPR: in range_binop()
3974 case LT_EXPR: case LE_EXPR: case GE_EXPR: case GT_EXPR: in make_range()
4002 case LE_EXPR: /* + [-, c] */ in make_range()
[all …]
|
| H A D | tree-ssa-loop-niter.c | 235 assumption = fold_build2 (LE_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
311 assumption = fold_build2 (LE_EXPR, boolean_type_node, in assert_no_overflow_lt()
387 assumption = fold_build2 (LE_EXPR, boolean_type_node, in assert_loop_rolls_lt()
665 case LE_EXPR: in number_of_iterations_cond()
1074 case LE_EXPR: in number_of_iterations_exit()
1397 case LE_EXPR: in loop_niter_by_eval()
|
| H A D | tree-ssa-dom.c | 421 || code == LE_EXPR in canonicalize_comparison()
969 ? LE_EXPR : GE_EXPR), in record_conditions()
976 case LE_EXPR: in record_conditions()
1004 build_and_record_new_cond (LE_EXPR, op0, op1, in record_conditions()
|
| H A D | c-omp.c | 258 || TREE_CODE (cond) == LE_EXPR in c_finish_omp_for()
|
| H A D | c-pretty-print.c | 1621 case LE_EXPR: in pp_c_relational_expression()
1629 else if (code == LE_EXPR) in pp_c_relational_expression()
1905 case LE_EXPR: in pp_c_expression()
|
| H A D | dojump.c | 399 case LE_EXPR: in do_jump()
465 tcode2 = LE_EXPR; in do_jump()
|
| H A D | c-common.c | 1978 case LE_EXPR: in binary_op_error()
2086 case LE_EXPR: in shorten_compare()
2090 code = LE_EXPR; in shorten_compare()
2192 else if (code == LE_EXPR) in shorten_compare()
2229 case LE_EXPR: in shorten_compare()
2473 case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR: in c_common_truthvalue_conversion()
|
| H A D | tree-pretty-print.c | 1206 case LE_EXPR: in dump_generic_node()
2146 case LE_EXPR: in op_prio()
2276 case LE_EXPR: in op_symbol_1()
|
| H A D | tree-ssa-loop-manip.c | 752 assum = fold_build2 (LE_EXPR, boolean_type_node, in determine_exit_conditions()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/ |
| H A D | fold-const.c | 1688 return LE_EXPR;
1693 case LE_EXPR:
1715 return LE_EXPR;
1718 case LE_EXPR:
1740 case LE_EXPR:
1768 return LE_EXPR;
2868 case LE_EXPR:
2940 case LT_EXPR: case LE_EXPR: case GE_EXPR: case GT_EXPR:
2968 case LE_EXPR: /* + [-, c] */
3144 && integer_onep (range_binop (LE_EXPR, integer_type_node,
[all …]
|
| H A D | c-pretty-print.c | 936 case LE_EXPR:
944 else if (code == LE_EXPR)
1189 case LE_EXPR:
|
| H A D | c-common.c | 2255 case LE_EXPR:
2368 case LE_EXPR:
2372 code = LE_EXPR;
2471 else if (code == LE_EXPR)
2508 case LE_EXPR:
2775 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
3908 return expand_unordered_cmp (function, params, UNLE_EXPR, LE_EXPR);
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/execute/ |
| H A D | 20000914-1.c | 101 LE_EXPR, enumerator
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/cp/ |
| H A D | dump.c | 167 case LE_EXPR:
|
| H A D | operators.def | 120 DEF_SIMPLE_OPERATOR ("<=", LE_EXPR, "le", 2)
|
| H A D | call.c | 1904 case LE_EXPR:
2197 case LE_EXPR:
3777 case LE_EXPR:
3831 case LE_EXPR:
|
| /openbsd-src/gnu/gcc/gcc/cp/ |
| H A D | dump.c | 164 case LE_EXPR: in dump_op()
|
| H A D | operators.def | 122 DEF_SIMPLE_OPERATOR ("<=", LE_EXPR, "le", 2)
|
| H A D | call.c | 1808 case LE_EXPR: in add_builtin_candidate()
2099 case LE_EXPR: in add_builtin_candidates()
3863 case LE_EXPR: in build_new_op()
3928 case LE_EXPR: in build_new_op()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/java/ |
| H A D | typeck.c | 93 build (LE_EXPR, boolean_type_node, expr,
|
| H A D | check-init.c | 846 case LE_EXPR:
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/f/ |
| H A D | com.c | 697 cond = ffecom_2 (LE_EXPR, integer_type_node, element, high); in ffecom_subscript_check_()
699 cond = ffecom_2 (LE_EXPR, integer_type_node, low, element); in ffecom_subscript_check_()
705 cond = ffecom_2 (LE_EXPR, integer_type_node, in ffecom_subscript_check_()
712 ffecom_2 (LE_EXPR, integer_type_node, in ffecom_subscript_check_()
1599 case LE_EXPR: in ffecom_overlap_()
1685 t = ffecom_2 (LE_EXPR, integer_type_node, in ffecom_overlap_()
1702 t = ffecom_2 (LE_EXPR, integer_type_node, in ffecom_overlap_()
3593 code = LE_EXPR; in ffecom_expr_()
8928 case LE_EXPR: in ffecom_tree_canonize_ref_()
14800 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
|
| /openbsd-src/gnu/usr.bin/gcc/contrib/ |
| H A D | paranoia.cc | 241 bool operator <= (const real_c_float &b) const { return cmp(LE_EXPR, b); } in operator <=()
392 case LE_EXPR: in cmp()
|