Home
last modified time | relevance | path

Searched refs:boolean_false_node (Results 1 – 25 of 59) sorted by relevance

123

/dflybsd-src/contrib/gcc-8.0/gcc/cp/
H A Dconstraint.cc1975 return boolean_false_node; in satisfy_pack_expansion()
1982 return boolean_false_node; in satisfy_pack_expansion()
2007 return boolean_false_node; in satisfy_predicate_constraint()
2018 return boolean_false_node; in satisfy_predicate_constraint()
2038 return boolean_false_node; in satisfy_check_constraint()
2047 return memoize_concept_satisfaction (tmpl, args, boolean_false_node); in satisfy_check_constraint()
2069 return boolean_false_node; in satisfy_expression_constraint()
2071 return boolean_false_node; in satisfy_expression_constraint()
2087 return boolean_false_node; in satisfy_type_constraint()
2089 return boolean_false_node; in satisfy_type_constraint()
[all …]
H A Dexcept.c1108 ? boolean_true_node : boolean_false_node); in finish_noexcept_expr()
1213 gcc_checking_assert (operand_equal_p (expr, boolean_false_node, 0)); in build_noexcept_spec()
/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dtree-ssa-uncprop.c107 ? boolean_false_node in associate_equivalences_with_edges()
115 : boolean_false_node); in associate_equivalences_with_edges()
124 : boolean_false_node); in associate_equivalences_with_edges()
130 ? boolean_false_node in associate_equivalences_with_edges()
H A Dtree-ssa-loop-unswitch.c176 : boolean_false_node); in simplify_using_entry_checks()
238 gimple_cond_set_condition_from_tree (stmt, boolean_false_node); in tree_unswitch_single_loop()
H A Dgimple-fold.c1351 return boolean_false_node; in canonicalize_bool()
1372 return boolean_false_node; in canonicalize_bool()
1550 return boolean_false_node; in and_var_with_comparison_1()
1592 ? boolean_false_node in and_var_with_comparison_1()
1596 ? boolean_false_node in and_var_with_comparison_1()
1619 return boolean_false_node; in and_var_with_comparison_1()
1649 return boolean_false_node; in and_var_with_comparison_1()
1750 return boolean_false_node; in and_comparisons_1()
1773 return boolean_false_node; in and_comparisons_1()
1843 return boolean_false_node; in and_comparisons_1()
[all …]
H A Dtree-ssa-ifcombine.c496 gimple_cond_set_condition_from_tree (outer_cond, boolean_false_node); in ifcombine_iforif()
535 gimple_cond_set_condition_from_tree (outer_cond, boolean_false_node); in ifcombine_iforif()
H A Dtree-streamer.c262 && node != boolean_false_node); in record_common_node()
H A Dtree-vrp.c3610 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_ranges()
3644 return boolean_false_node; in compare_ranges()
3651 return boolean_false_node; in compare_ranges()
3679 return boolean_false_node; in compare_ranges()
3708 return boolean_false_node; in compare_ranges()
3747 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_range_with_value()
3765 return boolean_false_node; in compare_range_with_value()
3769 return boolean_false_node; in compare_range_with_value()
3784 return boolean_false_node; in compare_range_with_value()
3810 return boolean_false_node; in compare_range_with_value()
[all …]
H A Dtree-ssa-dom.c1348 c.value = boolean_false_node; in record_conditions()
1641 ? boolean_false_node in record_edge_info()
1648 : boolean_false_node); in record_edge_info()
1656 : boolean_false_node); in record_edge_info()
1661 ? boolean_false_node in record_edge_info()
H A Dgimple.h2681 gimple_cond_set_rhs (gs, boolean_false_node); in gimple_cond_make_false()
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()
2753 && gimple_cond_rhs (gs) == boolean_false_node) in gimple_cond_single_var_p()
H A Dtree-ssa-loop-niter.c761 noloop = boolean_false_node; in number_of_iterations_lt_to_ne()
787 noloop = boolean_false_node; in number_of_iterations_lt_to_ne()
1236 niter->may_be_zero = boolean_false_node; in number_of_iterations_cond()
1816 niter->assumptions = boolean_false_node; in number_of_iterations_exit()
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dtree-ssa-threadedge.c630 return boolean_false_node; in simplify_control_stmt_condition_1()
642 return boolean_false_node; in simplify_control_stmt_condition_1()
657 return boolean_false_node; in simplify_control_stmt_condition_1()
669 return boolean_false_node; in simplify_control_stmt_condition_1()
684 return boolean_false_node; in simplify_control_stmt_condition_1()
693 return boolean_false_node; in simplify_control_stmt_condition_1()
H A Dtree-ssa-ifcombine.c432 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 Dtree-vectorizer.c546 fold_loop_internal_call (g, boolean_false_node); in set_uid_loop_bbs()
801 fold_loop_internal_call (g, boolean_false_node); in vectorize_loops()
810 fold_loop_internal_call (g, boolean_false_node); in vectorize_loops()
H A Dvr-values.c1501 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_ranges()
1528 return boolean_false_node; in compare_ranges()
1535 return boolean_false_node; in compare_ranges()
1563 return boolean_false_node; in compare_ranges()
1583 return boolean_false_node; in compare_ranges()
1620 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_range_with_value()
1635 return boolean_false_node; in compare_range_with_value()
1639 return boolean_false_node; in compare_range_with_value()
1654 return boolean_false_node; in compare_range_with_value()
1673 return boolean_false_node; in compare_range_with_value()
[all …]
H A Dtree-streamer.c291 && node != boolean_false_node); in record_common_node()
H A Dgimple-fold.c5019 return boolean_false_node; in canonicalize_bool()
5040 return boolean_false_node; in canonicalize_bool()
5218 return boolean_false_node; in and_var_with_comparison_1()
5260 ? boolean_false_node in and_var_with_comparison_1()
5264 ? boolean_false_node in and_var_with_comparison_1()
5287 return boolean_false_node; in and_var_with_comparison_1()
5317 return boolean_false_node; in and_var_with_comparison_1()
5420 return boolean_false_node; in and_comparisons_1()
5443 return boolean_false_node; in and_comparisons_1()
5513 return boolean_false_node; in and_comparisons_1()
[all …]
H A Dtree-ssa-loop-unswitch.c252 : boolean_false_node); in simplify_using_entry_checks()
351 boolean_false_node); in tree_unswitch_single_loop()
H A Dgimple.h3597 gimple_cond_set_lhs (gs, boolean_false_node);
3598 gimple_cond_set_rhs (gs, boolean_false_node);
3609 gimple_cond_set_rhs (gs, boolean_false_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)
H A Dtree-if-conv.c355 && (cond == boolean_false_node in is_false_predicate()
1443 IFC_DR (dr)->rw_predicate = boolean_false_node; in if_convertible_loop_p_1()
1444 IFC_DR (dr)->w_predicate = boolean_false_node; in if_convertible_loop_p_1()
1445 IFC_DR (dr)->base_w_predicate = boolean_false_node; in if_convertible_loop_p_1()
H A Dtree-ssa-scopedtables.c1100 c.value = val ? boolean_true_node : boolean_false_node;
1199 c.value = boolean_false_node; in record_conditions()
H A Dtree-ssa-loop-niter.c1034 tree t, cond, new_c, relaxed_cond = boolean_false_node; in number_of_iterations_ne()
1196 noloop = boolean_false_node; in number_of_iterations_lt_to_ne()
1222 noloop = boolean_false_node; in number_of_iterations_lt_to_ne()
1686 niter->may_be_zero = boolean_false_node; in number_of_iterations_cond()
2320 niter->assumptions = boolean_false_node; in number_of_iterations_exit_assumptions()
H A Dtree-ssa-loop-im.c1852 stmt = gimple_build_cond (NE_EXPR, flag, boolean_false_node, in execute_sm_if_changed()
2016 load = gimple_build_assign (store_flag, boolean_false_node); in execute_sm()
H A Dtree-ssa-reassoc.c2099 low = exp ? build_int_cst (TREE_TYPE (exp), 0) : boolean_false_node; in init_range_entry()
2500 ? boolean_false_node : boolean_true_node); in update_range_test()
3311 ? boolean_false_node : boolean_true_node); in optimize_range_tests_var_bound()
4128 || rhs != boolean_false_node in maybe_optimize_range_tests()
4283 gimple_cond_set_rhs (cond_stmt, boolean_false_node); in maybe_optimize_range_tests()
/dflybsd-src/contrib/gcc-4.7/gcc/cp/
H A Dexcept.c1211 ? boolean_true_node : boolean_false_node); in finish_noexcept_expr()
1314 gcc_checking_assert (operand_equal_p (expr, boolean_false_node, 0)); in build_noexcept_spec()

123