/netbsd-src/external/gpl3/gcc/dist/gcc/ |
H A D | gimple-range-edge.cc | 62 r = int_range<2> (boolean_true_node, boolean_true_node); in gcond_edge_range()
|
H A D | tree-ssa-threadedge.cc | 531 return boolean_true_node; in simplify_control_stmt_condition_1() 537 return boolean_true_node; in simplify_control_stmt_condition_1() 557 return boolean_true_node; in simplify_control_stmt_condition_1() 563 return boolean_true_node; in simplify_control_stmt_condition_1() 578 return boolean_true_node; in simplify_control_stmt_condition_1() 593 return boolean_true_node; in simplify_control_stmt_condition_1()
|
H A D | tree-ssa-ifcombine.cc | 444 outer_inv ? boolean_false_node : boolean_true_node); in ifcombine_ifandif() 530 outer_inv ? boolean_false_node : boolean_true_node); in ifcombine_ifandif() 625 outer_inv ? boolean_false_node : boolean_true_node); in ifcombine_ifandif()
|
H A D | vr-values.cc | 1433 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_ranges() 1458 return boolean_true_node; in compare_ranges() 1483 return boolean_true_node; in compare_ranges() 1509 return boolean_true_node; in compare_ranges() 1552 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_range_with_value() 1565 return boolean_true_node; in compare_range_with_value() 1580 return boolean_true_node; in compare_range_with_value() 1599 return boolean_true_node; in compare_range_with_value() 1618 return boolean_true_node; in compare_range_with_value() 2129 ? boolean_true_node in compare_names() [all …]
|
H A D | tree-ssa-threadbackward.cc | 325 int_range<2> true_range (boolean_true_node, boolean_true_node); in find_taken_edge_cond()
|
H A D | tree-streamer.cc | 290 && node != boolean_true_node in record_common_node()
|
H A D | tree-ssa-loop-unswitch.cc | 251 ? boolean_true_node in simplify_using_entry_checks() 349 boolean_true_node); in tree_unswitch_single_loop()
|
H A D | tree-ssa-loop-ch.cc | 73 desired_static_value = boolean_true_node; in entry_loop_condition_is_static()
|
H A D | tree-ssa-loop-niter.cc | 1171 tree assumption = boolean_true_node, bound, noloop; in number_of_iterations_lt_to_ne() 1353 tree assumption = boolean_true_node, bound, diff; in assert_loop_rolls_lt() 1844 niter->assumptions = boolean_true_node; in number_of_iterations_cond() 2331 return boolean_true_node; in tree_simplify_using_condition_1() 2334 return boolean_true_node; in tree_simplify_using_condition_1() 2621 niter->assumptions = boolean_true_node; in number_of_iterations_exit_assumptions() 2829 niter->assumptions = boolean_true_node; in number_of_iterations_popcount()
|
/netbsd-src/external/gpl3/gcc.old/dist/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 | 438 outer_inv ? boolean_false_node : boolean_true_node); in ifcombine_ifandif() 518 outer_inv ? boolean_false_node : boolean_true_node); in ifcombine_ifandif() 612 outer_inv ? boolean_false_node : boolean_true_node); in ifcombine_ifandif()
|
H A D | vr-values.c | 1539 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_ranges() 1564 return boolean_true_node; in compare_ranges() 1589 return boolean_true_node; in compare_ranges() 1615 return boolean_true_node; in compare_ranges() 1658 return (comp == NE_EXPR) ? boolean_true_node : boolean_false_node; in compare_range_with_value() 1671 return boolean_true_node; in compare_range_with_value() 1686 return boolean_true_node; in compare_range_with_value() 1705 return boolean_true_node; in compare_range_with_value() 1724 return boolean_true_node; in compare_range_with_value() 2236 ? boolean_true_node in compare_names() [all …]
|
H A D | tree-streamer.c | 290 && node != boolean_true_node in record_common_node()
|
H A D | tree-ssa-loop-unswitch.c | 250 ? boolean_true_node in simplify_using_entry_checks() 343 boolean_true_node); in tree_unswitch_single_loop()
|
H A D | tree-vectorizer.c | 952 boolean_true_node); in try_vectorize_loop_1() 1009 fold_loop_internal_call (loop_vectorized_call, boolean_true_node); in try_vectorize_loop_1()
|
H A D | tree-ssa-loop-niter.c | 1159 tree assumption = boolean_true_node, bound, noloop; in number_of_iterations_lt_to_ne() 1341 tree assumption = boolean_true_node, bound, diff; in assert_loop_rolls_lt() 1751 niter->assumptions = boolean_true_node; in number_of_iterations_cond() 2226 return boolean_true_node; in tree_simplify_using_condition_1() 2229 return boolean_true_node; in tree_simplify_using_condition_1() 2516 niter->assumptions = boolean_true_node; in number_of_iterations_exit_assumptions() 2706 niter->assumptions = boolean_true_node; in number_of_iterations_popcount()
|
/netbsd-src/external/gpl3/gcc/dist/gcc/cp/ |
H A D | constraint.cc | 1962 return boolean_true_node; in tsubst_simple_requirement() 2002 return boolean_true_node; in tsubst_type_requirement() 2116 return boolean_true_node; in tsubst_compound_requirement() 2126 if (result == boolean_true_node) in tsubst_nested_requirement() 2127 return boolean_true_node; in tsubst_nested_requirement() 2282 tree result = boolean_true_node; in tsubst_requires_expr() 2783 if (lhs == boolean_true_node || lhs == error_mark_node) in satisfy_disjunction() 2787 if (rhs == boolean_true_node || rhs == error_mark_node) in satisfy_disjunction() 2825 if (t == error_mark_node || t == boolean_true_node || t == boolean_false_node) in satisfaction_value() 2834 return boolean_true_node; in satisfaction_value() [all …]
|
H A D | except.cc | 1165 ? boolean_true_node : boolean_false_node); in finish_noexcept_expr() 1264 if (operand_equal_p (expr, boolean_true_node, 0)) in build_noexcept_spec() 1312 current_retval_sentinel, boolean_true_node); in maybe_set_retval_sentinel()
|
H A D | coroutines.cc | 2965 flag, boolean_true_node); in handle_nested_conditionals() 3297 tree fixed = needs_not ? boolean_true_node : boolean_false_node; in expand_one_truth_if() 3532 FOR_COND (for_stmt) = boolean_true_node; in await_statement_walker() 3600 WHILE_COND (while_stmt) = boolean_true_node; in await_statement_walker() 3629 DO_COND (do_stmt) = boolean_true_node; in await_statement_walker() 4254 boolean_true_node); in coro_rewrite_function_body() 4807 r = build2 (INIT_EXPR, boolean_type_node, fnf_x, boolean_true_node); in morph_fn_to_coro() 4915 boolean_true_node, boolean_type_node); in morph_fn_to_coro() 4960 INIT_EXPR, fn_start, boolean_true_node, in morph_fn_to_coro() 5066 INIT_EXPR, fn_start, boolean_true_node, in morph_fn_to_coro()
|
/netbsd-src/external/gpl3/gcc.old/dist/gcc/cp/ |
H A D | constraint.cc | 2030 if (result != boolean_true_node) in tsubst_nested_requirement() 2189 return boolean_true_node; in tsubst_requires_expr() 2469 if (lhs == boolean_true_node) in satisfy_disjunction() 2470 return boolean_true_node; in satisfy_disjunction() 2472 if (rhs != boolean_true_node && info.noisy ()) in satisfy_disjunction() 2503 if (t == error_mark_node || t == boolean_true_node || t == boolean_false_node) in satisfaction_value() 2507 return boolean_true_node; in satisfaction_value() 2700 return boolean_true_node; in satisfy_associated_constraints() 2705 return boolean_true_node; in satisfy_associated_constraints() 2790 tree result = boolean_true_node; in satisfy_declaration_constraints() [all …]
|
H A D | except.c | 1217 ? boolean_true_node : boolean_false_node); in finish_noexcept_expr() 1314 if (operand_equal_p (expr, boolean_true_node, 0)) in build_noexcept_spec() 1362 current_retval_sentinel, boolean_true_node); in maybe_set_retval_sentinel()
|
H A D | coroutines.cc | 3116 flag, boolean_true_node); in handle_nested_conditionals() 3448 tree fixed = needs_not ? boolean_true_node : boolean_false_node; in expand_one_truth_if() 3687 FOR_COND (for_stmt) = boolean_true_node; in await_statement_walker() 3750 WHILE_COND (while_stmt) = boolean_true_node; in await_statement_walker() 3779 DO_COND (do_stmt) = boolean_true_node; in await_statement_walker() 4218 boolean_true_node); in coro_rewrite_function_body() 4876 r = build2 (INIT_EXPR, boolean_type_node, fnf_x, boolean_true_node); in morph_fn_to_coro() 5008 boolean_true_node, boolean_type_node); in morph_fn_to_coro() 5052 INIT_EXPR, fn_start, boolean_true_node, in morph_fn_to_coro() 5166 INIT_EXPR, fn_start, boolean_true_node, in morph_fn_to_coro()
|
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/ |
H A D | svalue.cc | 865 if (comparison == boolean_true_node) in eval_condition() 1567 if (iter_gt_base == boolean_true_node) in get_direction() 1572 if (iter_lt_base == boolean_true_node) in get_direction() 1608 if (base_op_rhs == boolean_true_node) in eval_condition_without_cm() 1622 if (base_op_rhs == boolean_true_node) in eval_condition_without_cm() 1635 if (base_le_rhs == boolean_true_node) in eval_condition_without_cm() 1648 if (base_le_rhs == boolean_true_node) in eval_condition_without_cm()
|
/netbsd-src/external/gpl3/gcc.old/dist/gcc/d/ |
H A D | d-convert.cc | 136 : boolean_true_node; in d_truthvalue_conversion() 140 ? boolean_true_node in d_truthvalue_conversion() 151 return boolean_true_node; in d_truthvalue_conversion()
|
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
H A D | constraint-manager.cc | 152 if (comparison == boolean_true_node) in constrained_to_single_element() 937 if (eq == boolean_true_node) in get_or_add_equiv_class() 974 if (lt == boolean_true_node) in get_or_add_equiv_class() 1020 if (comparison == boolean_true_node) in eval_condition()
|