/dflybsd-src/contrib/gcc-4.7/gcc/ |
H A D | tree-ssa-uncprop.c | 108 : boolean_true_node); in associate_equivalences_with_edges() 114 ? boolean_true_node in associate_equivalences_with_edges() 123 ? boolean_true_node in associate_equivalences_with_edges() 131 : boolean_true_node); in associate_equivalences_with_edges()
|
H A D | tree-ssa-loop-unswitch.c | 175 ? boolean_true_node in simplify_using_entry_checks() 232 gimple_cond_set_condition_from_tree (stmt, boolean_true_node); in tree_unswitch_single_loop()
|
H A D | gimple-fold.c | 1353 return boolean_true_node; in canonicalize_bool() 1370 return boolean_true_node; in canonicalize_bool() 1626 return boolean_true_node; in and_var_with_comparison_1() 1663 return boolean_true_node; in and_var_with_comparison_1() 2011 return boolean_true_node; in or_var_with_comparison_1() 2053 ? boolean_true_node in or_var_with_comparison_1() 2057 ? boolean_true_node in or_var_with_comparison_1() 2078 return boolean_true_node; in or_var_with_comparison_1() 2111 return boolean_true_node; in or_var_with_comparison_1() 2210 return boolean_true_node; in or_comparisons_1() [all …]
|
H A D | tree-ssa-ifcombine.c | 350 gimple_cond_set_condition_from_tree (outer_cond, boolean_true_node); in ifcombine_ifandif() 387 gimple_cond_set_condition_from_tree (outer_cond, boolean_true_node); in ifcombine_ifandif()
|
H A D | tree-streamer.c | 261 && node != boolean_true_node in record_common_node()
|
H A D | tree-ssa-dom.c | 1232 c.value = boolean_true_node; in build_and_record_new_cond() 1339 c.value = boolean_true_node; in record_conditions() 1642 : boolean_true_node); in record_edge_info() 1647 ? boolean_true_node in record_edge_info() 1655 ? boolean_true_node in record_edge_info() 1662 : boolean_true_node); in record_edge_info()
|
H A D | gimple.h | 2680 gimple_cond_set_lhs (gs, boolean_true_node); in gimple_cond_make_false() 2691 gimple_cond_set_lhs (gs, boolean_true_node); in gimple_cond_make_true() 2692 gimple_cond_set_rhs (gs, boolean_true_node); in gimple_cond_make_true() 2706 if (lhs != boolean_true_node && lhs != boolean_false_node) in gimple_cond_true_p() 2709 if (rhs != boolean_true_node && rhs != boolean_false_node) in gimple_cond_true_p() 2731 if (lhs != boolean_true_node && lhs != boolean_false_node) in gimple_cond_false_p() 2734 if (rhs != boolean_true_node && rhs != boolean_false_node) in gimple_cond_false_p() 2757 && gimple_cond_rhs (gs) == boolean_true_node) in gimple_cond_single_var_p()
|
H A D | tree-if-conv.c | 181 set_bb_predicate (bb, boolean_true_node); in init_bb_predicate() 255 || cond == boolean_true_node in is_true_predicate() 1015 cond = boolean_true_node; in predicate_bbs()
|
H A D | tree-ssa-loop-niter.c | 714 tree assumption = boolean_true_node, bound, noloop; in number_of_iterations_lt_to_ne() 896 tree assumption = boolean_true_node, bound, diff; in assert_loop_rolls_lt() 1235 niter->assumptions = boolean_true_node; in number_of_iterations_cond() 1624 return boolean_true_node; in tree_simplify_using_condition_1() 1627 return boolean_true_node; in tree_simplify_using_condition_1() 1893 niter->assumptions = boolean_true_node; in number_of_iterations_exit()
|
H A D | tree-vrp.c | 3610 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_ranges() 3642 return boolean_true_node; in compare_ranges() 3667 return boolean_true_node; in compare_ranges() 3697 return boolean_true_node; in compare_ranges() 3747 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_range_with_value() 3763 return boolean_true_node; in compare_range_with_value() 3778 return boolean_true_node; in compare_range_with_value() 3800 return boolean_true_node; in compare_range_with_value() 3827 return boolean_true_node; in compare_range_with_value() 3981 assertion = gimple_build_assign (n, boolean_true_node); in build_assert_expr_for() [all …]
|
H A D | tree-complex.c | 1135 EQ_EXPR, boolean_type_node, tmp, boolean_true_node); in expand_complex_div_wide() 1393 gimple_cond_set_rhs (stmt, boolean_true_node); in expand_complex_comparison()
|
/dflybsd-src/contrib/gcc-8.0/gcc/cp/ |
H A D | constraint.cc | 1981 if (TREE_VEC_ELT (exprs, i) != boolean_true_node) in satisfy_pack_expansion() 1983 return boolean_true_node; in satisfy_pack_expansion() 2072 return boolean_true_node; in satisfy_expression_constraint() 2090 return boolean_true_node; in satisfy_type_constraint() 2119 return boolean_true_node; in satisfy_implicit_conversion_constraint() 2149 return boolean_true_node; in satisfy_argument_deduction_constraint() 2165 return boolean_true_node; in satisfy_exception_constraint() 2211 if (t0 == boolean_true_node) in satisfy_disjunction() 2212 return boolean_true_node; in satisfy_disjunction() 2303 return boolean_true_node; in satisfy_associated_constraints() [all …]
|
H A D | except.c | 1108 ? boolean_true_node : boolean_false_node); in finish_noexcept_expr() 1209 if (operand_equal_p (expr, boolean_true_node, 0)) in build_noexcept_spec()
|
/dflybsd-src/contrib/gcc-8.0/gcc/ |
H A D | tree-ssa-threadedge.c | 633 return boolean_true_node; in simplify_control_stmt_condition_1() 639 return boolean_true_node; in simplify_control_stmt_condition_1() 660 return boolean_true_node; in simplify_control_stmt_condition_1() 666 return boolean_true_node; in simplify_control_stmt_condition_1() 681 return boolean_true_node; in simplify_control_stmt_condition_1() 696 return boolean_true_node; in simplify_control_stmt_condition_1()
|
H A D | tree-ssa-ifcombine.c | 432 outer_inv ? boolean_false_node : boolean_true_node); in ifcombine_ifandif() 512 outer_inv ? boolean_false_node : boolean_true_node); in ifcombine_ifandif() 600 outer_inv ? boolean_false_node : boolean_true_node); in ifcombine_ifandif()
|
H A D | vr-values.c | 1501 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_ranges() 1526 return boolean_true_node; in compare_ranges() 1551 return boolean_true_node; in compare_ranges() 1577 return boolean_true_node; in compare_ranges() 1620 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_range_with_value() 1633 return boolean_true_node; in compare_range_with_value() 1648 return boolean_true_node; in compare_range_with_value() 1667 return boolean_true_node; in compare_range_with_value() 1686 return boolean_true_node; in compare_range_with_value() 2201 ? boolean_true_node in compare_names()
|
H A D | tree-streamer.c | 290 && node != boolean_true_node in record_common_node()
|
H A D | gimple-fold.c | 5021 return boolean_true_node; in canonicalize_bool() 5038 return boolean_true_node; in canonicalize_bool() 5294 return boolean_true_node; in and_var_with_comparison_1() 5331 return boolean_true_node; in and_var_with_comparison_1() 5681 return boolean_true_node; in or_var_with_comparison_1() 5723 ? boolean_true_node in or_var_with_comparison_1() 5727 ? boolean_true_node in or_var_with_comparison_1() 5748 return boolean_true_node; in or_var_with_comparison_1() 5781 return boolean_true_node; in or_var_with_comparison_1() 5882 return boolean_true_node; in or_comparisons_1() [all …]
|
H A D | tree-ssa-loop-unswitch.c | 251 ? boolean_true_node in simplify_using_entry_checks() 344 boolean_true_node); in tree_unswitch_single_loop()
|
H A D | tree-vectorizer.c | 706 boolean_true_node); in vectorize_loops() 759 fold_loop_internal_call (loop_vectorized_call, boolean_true_node); in vectorize_loops()
|
H A D | tree-if-conv.c | 284 set_bb_predicate (bb, boolean_true_node); in init_bb_predicate() 330 set_bb_predicate (bb, boolean_true_node); in reset_bb_predicate() 365 || cond == boolean_true_node in is_true_predicate() 1319 cond = boolean_true_node; in predicate_bbs()
|
H A D | tree-ssa-loop-niter.c | 1149 tree assumption = boolean_true_node, bound, noloop; in number_of_iterations_lt_to_ne() 1331 tree assumption = boolean_true_node, bound, diff; in assert_loop_rolls_lt() 1685 niter->assumptions = boolean_true_node; in number_of_iterations_cond() 2120 return boolean_true_node; in tree_simplify_using_condition_1() 2123 return boolean_true_node; in tree_simplify_using_condition_1() 2403 niter->assumptions = boolean_true_node; in number_of_iterations_exit_assumptions()
|
H A D | tree-ssa-scopedtables.c | 1100 c.value = val ? boolean_true_node : boolean_false_node; 1190 c.value = boolean_true_node; in record_conditions()
|
H A D | gimple.h | 3608 gimple_cond_set_lhs (gs, boolean_true_node); 3623 if (lhs != boolean_true_node && lhs != boolean_false_node) 3626 if (rhs != boolean_true_node && rhs != boolean_false_node) 3648 if (lhs != boolean_true_node && lhs != boolean_false_node) 3651 if (rhs != boolean_true_node && rhs != boolean_false_node)
|
/dflybsd-src/contrib/gcc-4.7/gcc/cp/ |
H A D | except.c | 1211 ? boolean_true_node : boolean_false_node); in finish_noexcept_expr() 1310 if (operand_equal_p (expr, boolean_true_node, 0)) in build_noexcept_spec()
|