Home
last modified time | relevance | path

Searched refs:boolean_true_node (Results 1 – 25 of 42) sorted by relevance

12

/openbsd/gnu/gcc/gcc/
H A Dtree-ssa-uncprop.c128 : 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 Dtree-ssa-loop-unswitch.c163 ? boolean_true_node in simplify_using_entry_checks()
234 COND_EXPR_COND (stmt) = boolean_true_node; in tree_unswitch_single_loop()
H A Dtree-ssa-loop-ivcanon.c215 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 Dtree-ssa-loop-niter.c218 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 Dtree-vrp.c852 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()
2730 return boolean_true_node; in compare_ranges()
2755 return boolean_true_node; in compare_ranges()
2785 return boolean_true_node; in compare_ranges()
2851 return boolean_true_node; in compare_range_with_value()
2866 return boolean_true_node; in compare_range_with_value()
2888 return boolean_true_node; in compare_range_with_value()
2915 return boolean_true_node; in compare_range_with_value()
[all …]
H A Dtree-ssa-dom.c929 *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 Dtree-ssa-loop-manip.c701 tree cond = boolean_true_node, assum; in determine_exit_conditions()
870 : boolean_true_node); in tree_unroll_loop()
H A Dtree-ssa-threadedge.c304 if (cond == boolean_true_node) in record_temporary_equivalences_from_stmts_at_dest()
H A Dtree-if-conv.c621 if (prev_cond == boolean_true_node || !prev_cond) in add_to_dst_predicate_list()
H A Dc-pretty-print.c865 else if (b == boolean_true_node) in pp_c_bool_constant()
H A Dtree-data-ref.c931 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 Dgimplify.c3685 fold_convert (type, boolean_true_node), in gimplify_boolean_expr()
4217 boolean_true_node); in gimple_push_cleanup()
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dc-common.c2450 val = boolean_true_node;
2460 val = boolean_true_node;
2467 val = boolean_true_node;
2474 val = boolean_true_node;
2481 val = boolean_true_node;
2524 if (val == boolean_true_node)
2596 value = boolean_true_node;
2792 return real_zerop (expr) ? boolean_false_node : boolean_true_node;
2803 TREE_OPERAND (expr, 0), boolean_true_node);
2805 return boolean_true_node;
[all …]
H A Dc-parse.in608 skip_evaluation += $1 == boolean_true_node; }
610 { skip_evaluation -= $1 == boolean_true_node;
617 { skip_evaluation += (($1 == boolean_true_node)
620 { skip_evaluation -= $1 == boolean_true_node;
629 skip_evaluation += $1 == boolean_true_node; }
631 { skip_evaluation -= $1 == boolean_true_node;
H A Dc-common.h195 #define boolean_true_node c_global_trees[CTI_BOOLEAN_TRUE] macro
H A Dc-pretty-print.c382 else if (b == boolean_true_node)
/openbsd/gnu/usr.bin/gcc/gcc/java/
H A Dcheck-init.c339 boolean_true_node, TREE_OPERAND (exp, 1),
608 && (DECL_INITIAL (decl) == boolean_true_node
H A Dexpr.c169 return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
172 return real_zerop (expr) ? boolean_false_node : boolean_true_node;
1805 *init_test_decl, boolean_true_node));
3497 if (DECL_INITIAL (ite->value) == boolean_true_node)
3498 rhs = boolean_true_node;
H A Dlex.c1606 boolean_true_node : boolean_false_node));
H A Ddecl.c520 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node); in java_init_decl_processing()
H A Djava-tree.h555 #define boolean_true_node \ macro
/openbsd/gnu/usr.bin/gcc/gcc/cp/
H A Dsemantics.c334 WHILE_COND (while_stmt) = boolean_true_node;
H A Dmangle.c2110 else if (value == boolean_true_node)
H A Derror.c1495 else if (t == boolean_true_node)
/openbsd/gnu/gcc/gcc/cp/
H A Dinit.c1995 begin = get_target_expr (boolean_true_node); in build_new_1()

12