Home
last modified time | relevance | path

Searched refs:invert_tree_comparison (Results 1 – 25 of 33) sorted by relevance

12

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dtree-ssa-uninit.c662 tc = invert_tree_comparison (tc, false); in get_cmp_code()
699 cmpc = invert_tree_comparison (cmpc, false); in is_value_included_in()
1174 cond_code = invert_tree_comparison (cond_code, false); in normalize_cond()
1250 cond1_code = invert_tree_comparison (cond1_code, false); in is_gcond_subset_of()
1252 cond2_code = invert_tree_comparison (cond2_code, false); in is_gcond_subset_of()
1493 code1 = invert_tree_comparison (code1, false); in is_pred_expr_subset_of()
1495 code2 = invert_tree_comparison (code2, false); in is_pred_expr_subset_of()
H A Dgimple-fold.c1358 return fold_build2 (invert_tree_comparison (TREE_CODE (expr), false), in canonicalize_bool()
1436 invert_tree_comparison (c, false), in same_bool_comparison_p()
1514 invert_tree_comparison (code2, false), in and_var_with_comparison()
1975 invert_tree_comparison (code2, false), in or_var_with_comparison()
H A Dtree-ssa-loop-niter.c438 cmp = invert_tree_comparison (cmp, false); in bound_difference()
1824 code = invert_tree_comparison (code, false); in number_of_iterations_exit()
2203 cmp = invert_tree_comparison (cmp, false); in loop_niter_by_eval()
H A Dtree-if-conv.c293 : invert_tree_comparison (code, HONOR_NANS (TYPE_MODE (type))); in parse_predicate()
H A Dtree-ssa-tail-merge.c1117 code2 = invert_tree_comparison (code2, honor_nans); in gimple_equal_p()
H A Dipa-inline-analysis.c320 && cc1->code == invert_tree_comparison in add_clause()
1452 = invert_tree_comparison (code, in set_cond_stmt_execution_predicate()
H A Dtree-vrp.c4299 comp_code = invert_tree_comparison (comp_code, 0); in extract_code_and_val_from_cond_with_ops()
4527 code = invert_tree_comparison (code, false); in register_edge_assert_for_1()
7171 cond_code = invert_tree_comparison (cond_code, false); in simplify_cond_using_ranges()
H A Dtree-ssa-forwprop.c1198 inv_code = invert_tree_comparison (gimple_assign_rhs_code (stmt), nans); in forward_propagate_comparison()
H A Dfold-const.c2125 invert_tree_comparison (enum tree_code code, bool honor_nans) in invert_tree_comparison() function
3076 code = invert_tree_comparison (code, HONOR_NANS (TYPE_MODE (op_type))); in fold_truth_not_expr()
5053 inv_code = invert_tree_comparison (code, HONOR_NANS (TYPE_MODE (type))); in merge_truthop_with_opposite_arm()
5537 invert_tree_comparison (code, false), in optimize_minmax_comparison()
16036 code = invert_tree_comparison (code, false); in fold_relational_const()
H A Dgraphite-sese-to-poly.c1274 code = invert_tree_comparison (code, false); in add_conditions_to_domain()
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dtree-ssa-uninit.c996 tc = invert_tree_comparison (tc, false); in get_cmp_code()
1031 cmpc = invert_tree_comparison (cmpc, false); in is_value_included_in()
1424 c2 = invert_tree_comparison (x2.cond_code, false); in pred_equal_p()
1485 code1 = invert_tree_comparison (code1, false); in is_pred_expr_subset_of()
1488 code2 = invert_tree_comparison (code2, false); in is_pred_expr_subset_of()
1610 c2 = invert_tree_comparison (x2.cond_code, false); in pred_neg_p()
H A Dtree-ssa-ifcombine.c540 inner_cond_code = invert_tree_comparison (inner_cond_code, in ifcombine_ifandif()
545 outer_cond_code = invert_tree_comparison (outer_cond_code, in ifcombine_ifandif()
H A Dgimple-ssa-warn-alloca.c165 cond_code = invert_tree_comparison (cond_code, false); in alloca_call_type_by_arg()
H A Dfold-const.h126 extern enum tree_code invert_tree_comparison (enum tree_code, bool);
H A Dipa-predicate.c121 && cc1->code == invert_tree_comparison (cc2->code, in add_clause()
H A Dtree-ssa-loop-niter.c442 cmp = invert_tree_comparison (cmp, false); in determine_value_range()
778 cmp = invert_tree_comparison (cmp, false); in bound_difference()
2334 code = invert_tree_comparison (code, false); in number_of_iterations_exit_assumptions()
2718 cmp = invert_tree_comparison (cmp, false); in loop_niter_by_eval()
H A Dtree-ssa-threadedge.c709 new_cond = invert_tree_comparison (new_cond, false); in simplify_control_stmt_condition_1()
H A Dtree-ssa-tail-merge.c1200 code2 = invert_tree_comparison (code2, honor_nans); in gimple_equal_p()
H A Dgimple-fold.c5026 return fold_build2 (invert_tree_comparison (TREE_CODE (expr), false), in canonicalize_bool()
5104 invert_tree_comparison (c, false), in same_bool_comparison_p()
5182 invert_tree_comparison (code2, false), in and_var_with_comparison()
5645 invert_tree_comparison (code2, false), in or_var_with_comparison()
H A Dmatch.pd2874 && invert_tree_comparison
2883 && invert_tree_comparison
2944 operator using invert_tree_comparison we have to simulate
2959 invert_tree_comparison will tell us. But we can't use
2962 (with { enum tree_code ic = invert_tree_comparison
2970 (with { enum tree_code ic = invert_tree_comparison
H A Dtree-vect-slp.c547 code = invert_tree_comparison (TREE_CODE (cond), honor_nans); in vect_get_and_check_slp_defs()
940 invert_code = invert_tree_comparison (cond_code, honor_nans); in vect_build_slp_tree_1()
H A Dtree-ssa-reassoc.c3133 ccode = invert_tree_comparison (ccode, false); in optimize_range_tests_var_bound()
3252 ccode = invert_tree_comparison (ccode, false); in optimize_range_tests_var_bound()
3471 cmp = invert_tree_comparison (cmp, false); in ovce_extract_ops()
H A Dtree-ssa-sccvn.c3001 else if (code1 == invert_tree_comparison (code2, HONOR_NANS (lhs2))) in cond_stmts_equal_p()
3003 else if (code1 == invert_tree_comparison in cond_stmts_equal_p()
4909 code = invert_tree_comparison (code, HONOR_NANS (lhs)); in before_dom_children()
H A Dtree-if-conv.c403 : invert_tree_comparison (code, HONOR_NANS (type)); in parse_predicate()
H A Dtree-vrp.c3022 comp_code = invert_tree_comparison (comp_code, 0); in extract_code_and_val_from_cond_with_ops()
3820 code = invert_tree_comparison (code, false); in register_edge_assert_for_1()

12