| /freebsd-12.1/contrib/gcc/ |
| H A D | tree-ssa-uncprop.c | 128 : boolean_true_node); in associate_equivalences_with_edges() 134 ? boolean_true_node in associate_equivalences_with_edges() 143 ? boolean_true_node in associate_equivalences_with_edges() 151 : boolean_true_node); in associate_equivalences_with_edges()
|
| H A D | tree-ssa-loop-unswitch.c | 163 ? boolean_true_node in simplify_using_entry_checks() 234 COND_EXPR_COND (stmt) = boolean_true_node; in tree_unswitch_single_loop()
|
| H A D | tree-ssa-loop-ivcanon.c | 215 do_exit = boolean_true_node; in try_unroll_loop_completely() 219 dont_exit = boolean_true_node; in try_unroll_loop_completely() 508 do_exit = boolean_true_node; in remove_empty_loop()
|
| H A D | tree-ssa-loop-niter.c | 218 tree assumption = boolean_true_node, bound, noloop; in number_of_iterations_lt_to_ne() 354 tree assumption = boolean_true_node, bound, diff; in assert_loop_rolls_lt() 564 niter->assumptions = boolean_true_node; in number_of_iterations_cond() 567 niter->additional_info = boolean_true_node; in number_of_iterations_cond() 859 return boolean_true_node; in tree_simplify_using_condition_1() 862 return boolean_true_node; in tree_simplify_using_condition_1() 1116 niter->additional_info = boolean_true_node; in number_of_iterations_exit() 1138 niter->assumptions = boolean_true_node; in number_of_iterations_exit() 1818 boolean_true_node, stmt); in infer_loop_bounds_from_undefined()
|
| H A D | tree-vrp.c | 852 if (t == boolean_true_node) in compare_values_warnv() 857 if (t == boolean_true_node) in compare_values_warnv() 928 return cmp1 == boolean_true_node && cmp2 == boolean_true_node; in value_inside_range() 2736 return boolean_true_node; in compare_ranges() 2761 return boolean_true_node; in compare_ranges() 2791 return boolean_true_node; in compare_ranges() 2857 return boolean_true_node; in compare_range_with_value() 2872 return boolean_true_node; in compare_range_with_value() 2894 return boolean_true_node; in compare_range_with_value() 2921 return boolean_true_node; in compare_range_with_value() [all …]
|
| H A D | tree-ssa-dom.c | 929 *p = boolean_true_node; in build_and_record_new_cond() 1065 edge_info->cond_equivalences[1] = boolean_true_node; in record_conditions() 1363 : boolean_true_node); in record_edge_info() 1368 ? boolean_true_node in record_edge_info() 1376 ? boolean_true_node in record_edge_info() 1383 : boolean_true_node); in record_edge_info()
|
| H A D | tree-ssa-loop-manip.c | 701 tree cond = boolean_true_node, assum; in determine_exit_conditions() 870 : boolean_true_node); in tree_unroll_loop()
|
| H A D | tree-ssa-threadedge.c | 304 if (cond == boolean_true_node) in record_temporary_equivalences_from_stmts_at_dest()
|
| H A D | tree-if-conv.c | 621 if (prev_cond == boolean_true_node || !prev_cond) in add_to_dst_predicate_list()
|
| H A D | c-pretty-print.c | 889 else if (b == boolean_true_node) in pp_c_bool_constant()
|
| H A D | tree-data-ref.c | 931 if (sign == boolean_true_node) in estimate_niter_from_size_of_data() 949 record_estimate (loop, estimation, boolean_true_node, stmt); in estimate_niter_from_size_of_data()
|
| H A D | gimplify.c | 3685 fold_convert (type, boolean_true_node), in gimplify_boolean_expr() 4217 boolean_true_node); in gimple_push_cleanup()
|
| H A D | tree.h | 3440 #define boolean_true_node global_trees[TI_BOOLEAN_TRUE] macro
|
| H A D | tree-cfg.c | 449 COND_EXPR_COND (stmt) = boolean_true_node; in fold_cond_expr_cond()
|
| H A D | c-common.c | 4116 tree true_res = boolean_true_node; in boolean_increment()
|
| H A D | tree.c | 6573 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node); in build_common_tree_nodes_2()
|
| H A D | c-parser.c | 7547 if (c == boolean_true_node) in c_parser_omp_clause_num_threads()
|
| H A D | fold-const.c | 5898 return value ? boolean_true_node : boolean_false_node; in constant_boolean_node()
|
| H A D | ChangeLog-2003 | 12856 (boolean_true_node, boolean_false_node): Likewise. 12862 (truthvalue_true_node): Renamed from boolean_true_node.
|
| H A D | ChangeLog-2005 | 11801 of boolean_false_node/boolean_true_node.
|
| /freebsd-12.1/contrib/gcc/cp/ |
| H A D | init.c | 1995 begin = get_target_expr (boolean_true_node); in build_new_1()
|
| H A D | semantics.c | 535 *cond_p = boolean_true_node; in simplify_loop_decl_cond()
|
| H A D | decl.c | 3204 truthvalue_true_node = boolean_true_node; in cxx_init_decl_processing() 6265 (init, build2 (MODIFY_EXPR, void_type_node, flag, boolean_true_node)); in expand_static_init()
|
| H A D | ChangeLog-1995 | 3495 * various: Use boolean_type_node, boolean_true_node,
|
| H A D | parser.c | 3244 return boolean_true_node; in cp_parser_primary_expression()
|