Home
last modified time | relevance | path

Searched refs:boolean_type_node (Results 1 – 25 of 76) sorted by relevance

1234

/openbsd-src/gnu/gcc/gcc/
H A Dtree-ssa-loop-niter.c189 assumption = fold_build2 (EQ_EXPR, boolean_type_node, in number_of_iterations_ne()
192 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in number_of_iterations_ne()
235 assumption = fold_build2 (LE_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
240 noloop = fold_build2 (GT_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
254 assumption = fold_build2 (GE_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
259 noloop = fold_build2 (GT_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
266 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
270 niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
311 assumption = fold_build2 (LE_EXPR, boolean_type_node, in assert_no_overflow_lt()
332 assumption = fold_build2 (GE_EXPR, boolean_type_node, in assert_no_overflow_lt()
[all …]
H A Dtree-ssa-loop-manip.c740 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in determine_exit_conditions()
748 assum = fold_build2 (GE_EXPR, boolean_type_node, in determine_exit_conditions()
752 assum = fold_build2 (LE_EXPR, boolean_type_node, in determine_exit_conditions()
755 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond); in determine_exit_conditions()
758 assum = fold_build2 (cmp, boolean_type_node, base, bound); in determine_exit_conditions()
759 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond); in determine_exit_conditions()
948 exit_if = build_if_stmt (build2 (exit_cmp, boolean_type_node, ctr_after, in tree_unroll_loop()
H A Dtree-if-conv.c600 cond = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, in add_to_predicate_list()
645 tmp = build2 (TRUTH_AND_EXPR, boolean_type_node, in add_to_dst_predicate_list()
647 tmp_stmt = ifc_temp_var (boolean_type_node, tmp); in add_to_dst_predicate_list()
740 *cond = build2 (TRUTH_AND_EXPR, boolean_type_node, in find_phi_replacement_condition()
759 *cond = build2 (TRUTH_AND_EXPR, boolean_type_node, in find_phi_replacement_condition()
H A Dtree-ssa-forwprop.c251 new_cond = build2 (cond_code, boolean_type_node, op0, t); in forward_propagate_into_cond_1()
293 boolean_type_node, op0, op1); in forward_propagate_into_cond_1()
341 new_cond = build2 (new_code, boolean_type_node, def_rhs, in forward_propagate_into_cond_1()
394 new_cond = build2 (new_code, boolean_type_node, new_arg, in forward_propagate_into_cond_1()
H A Dtree-ssa-phiopt.c756 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, in minmax_replacement()
781 if (!integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node, in minmax_replacement()
815 if (!integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node, in minmax_replacement()
840 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, in minmax_replacement()
H A Dtree-mudflap.c603 t = build2 (GT_EXPR, boolean_type_node, t, mf_base); in mf_build_check_statement_for()
619 u = build2 (LT_EXPR, boolean_type_node, u, v); in mf_build_check_statement_for()
624 t = build2 (TRUTH_OR_EXPR, boolean_type_node, t, u); in mf_build_check_statement_for()
625 cond = create_tmp_var (boolean_type_node, "__mf_unlikely_cond"); in mf_build_check_statement_for()
626 t = build2 (MODIFY_EXPR, boolean_type_node, cond, t); in mf_build_check_statement_for()
H A Dvalue-prof.c199 build2 (NE_EXPR, boolean_type_node, tmp1, tmpv), in tree_divmod_fixed_value()
365 build2 (NE_EXPR, boolean_type_node, in tree_mod_pow2()
526 build2 (LT_EXPR, boolean_type_node, result, tmp1), in tree_mod_subtract()
541 build2 (LT_EXPR, boolean_type_node, result, tmp1), in tree_mod_subtract()
H A Dtree-vectorizer.c792 cond = build2 (GE_EXPR, boolean_type_node, indx_after_incr, niters); in slpeel_make_loop_iterate_ntimes()
798 cond = build2 (LT_EXPR, boolean_type_node, indx_after_incr, niters); in slpeel_make_loop_iterate_ntimes()
1164 fold_build2 (LE_EXPR, boolean_type_node, first_niters, in slpeel_tree_peel_loop_to_edge()
1204 fold_build2 (EQ_EXPR, boolean_type_node, first_niters, niters); in slpeel_tree_peel_loop_to_edge()
H A Dtree-complex.c1051 cond = fold_build2 (LT_EXPR, boolean_type_node, t1, t2); in expand_complex_div_wide()
1297 cr = gimplify_build2 (bsi, code, boolean_type_node, ar, br); in expand_complex_comparison()
1298 ci = gimplify_build2 (bsi, code, boolean_type_node, ai, bi); in expand_complex_comparison()
1301 boolean_type_node, cr, ci); in expand_complex_comparison()
H A Dtree-vrp.c851 t = fold_binary (LT_EXPR, boolean_type_node, val1, val2); in compare_values_warnv()
856 t = fold_binary (GT_EXPR, boolean_type_node, val1, val2); in compare_values_warnv()
861 t = fold_binary (NE_EXPR, boolean_type_node, val1, val2); in compare_values_warnv()
914 cmp1 = fold_binary_to_constant (GE_EXPR, boolean_type_node, val, vr->min); in value_inside_range()
921 cmp2 = fold_binary_to_constant (LE_EXPR, boolean_type_node, val, vr->max); in value_inside_range()
3724 cond = build2 (loc->comp_code, boolean_type_node, name, loc->val); in process_assert_insertions_for()
5131 = build2 (EQ_EXPR, boolean_type_node, op0, new); in simplify_cond_using_ranges()
5159 = build2 (NE_EXPR, boolean_type_node, op0, new); in simplify_cond_using_ranges()
5274 dummy = build2 (EQ_EXPR, boolean_type_node, NULL, NULL); in identify_jump_threads()
H A Domp-low.c1823 x = build2 (NE_EXPR, boolean_type_node, x, in lower_rec_input_clauses()
2696 t = build2 (fd->cond_code, boolean_type_node, fd->v, iend); in expand_omp_for_generic()
2856 t = build2 (GE_EXPR, boolean_type_node, s0, e0); in expand_omp_for_static_nochunk()
2890 t = build2 (fd->cond_code, boolean_type_node, fd->v, e); in expand_omp_for_static_nochunk()
3042 t = build2 (LT_EXPR, boolean_type_node, s0, n); in expand_omp_for_static_chunk()
3075 t = build2 (fd->cond_code, boolean_type_node, fd->v, e); in expand_omp_for_static_chunk()
3750 t = build2 (EQ_EXPR, boolean_type_node, ctx->receiver_decl, in lower_omp_single_copy()
3843 x = build2 (EQ_EXPR, boolean_type_node, x, integer_zero_node); in lower_omp_master()
4021 cond = build2 (cond_code, boolean_type_node, fd->v, fd->n2); in lower_omp_for_lastprivate()
H A Dtree-ssa-loop-ivcanon.c108 COND_EXPR_COND (cond) = build2 (cmp, boolean_type_node, in create_canonical_iv()
/openbsd-src/gnu/usr.bin/gcc/gcc/java/
H A Dtypeck.c88 build (NE_EXPR, boolean_type_node, expr, expr),
93 build (LE_EXPR, boolean_type_node, expr,
99 build (GE_EXPR, boolean_type_node, expr,
450 if (type == boolean_type_node)
494 case 'Z': (*ptr)++; return boolean_type_node;
H A Dexpr.c184 return fold (build (COND_EXPR, boolean_type_node, TREE_OPERAND (expr, 0),
196 return fold (build (NE_EXPR, boolean_type_node, expr, boolean_false_node));
620 case 4: return boolean_type_node;
638 if (type == boolean_type_node)
721 build (EQ_EXPR, boolean_type_node, expr, null_pointer_node),
767 test = fold (build (GE_EXPR, boolean_type_node,
888 if (indexed_type == byte_type_node && elt_type == boolean_type_node )
889 return boolean_type_node;
1411 boolean_type_node, arg1, arg2));
1412 tree ifexp2 = fold ( build (EQ_EXPR, boolean_type_node, arg1, arg2));
[all …]
H A Ddecl.c514 boolean_type_node = make_node (BOOLEAN_TYPE); in java_init_decl_processing()
515 TYPE_PRECISION (boolean_type_node) = 1; in java_init_decl_processing()
516 fixup_unsigned_type (boolean_type_node); in java_init_decl_processing()
518 boolean_type_node)); in java_init_decl_processing()
519 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node); in java_init_decl_processing()
520 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node); in java_init_decl_processing()
529 = push_promoted_type ("promoted_boolean", boolean_type_node); in java_init_decl_processing()
868 build_function_type (boolean_type_node, t), in java_init_decl_processing()
H A Dparse.c15863 TREE_TYPE (node) = boolean_type_node;
17226 TREE_TYPE (node) = boolean_type_node;
17296 prom_type = boolean_type_node;
17322 TREE_TYPE (node) = boolean_type_node;
17335 prom_type = boolean_type_node;
17351 TREE_TYPE (node) = boolean_type_node;
17358 prom_type = boolean_type_node;
17409 TREE_TYPE (node) = boolean_type_node;
17413 prom_type = boolean_type_node;
17941 TREE_TYPE (node) = boolean_type_node;
[all …]
H A Dparse.y12298 TREE_TYPE (node) = boolean_type_node;
13661 TREE_TYPE (node) = boolean_type_node;
13731 prom_type = boolean_type_node;
13757 TREE_TYPE (node) = boolean_type_node;
13770 prom_type = boolean_type_node;
13786 TREE_TYPE (node) = boolean_type_node;
13793 prom_type = boolean_type_node;
13844 TREE_TYPE (node) = boolean_type_node;
13848 prom_type = boolean_type_node;
14376 TREE_TYPE (node) = boolean_type_node;
[all …]
/openbsd-src/gnu/gcc/gcc/cp/
H A Drtti.c305 cond = cp_convert (boolean_type_node, TREE_OPERAND (exp, 0)); in build_typeid()
448 build2 (EQ_EXPR, boolean_type_node, test, in ifnonnull()
1382 &boolean_type_node, in emit_support_tinfos()
H A Dtypeck.c3198 result_type = boolean_type_node; in build_binary_op()
3281 build_type = boolean_type_node; in build_binary_op()
3353 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1); in build_binary_op()
3390 build_type = boolean_type_node; in build_binary_op()
3602 return cp_convert (boolean_type_node, val); in build_binary_op()
3941 t = perform_implicit_conversion (boolean_type_node, expr); in condition_conversion()
3942 t = fold_build_cleanup_point_expr (boolean_type_node, t); in condition_conversion()
4062 arg = perform_implicit_conversion (boolean_type_node, arg); in build_unary_op()
4228 if (same_type_p (declared_type, boolean_type_node)) in build_unary_op()
5599 boolean_type_node, in build_modify_expr()
H A Dinit.c800 build2 (EQ_EXPR, boolean_type_node, in expand_virtual_init()
2252 build2 (EQ_EXPR, boolean_type_node, tbase, in build_vec_delete_1()
2314 fold_build2 (NE_EXPR, boolean_type_node, base, in build_vec_delete_1()
2568 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator, in build_vec_init()
/openbsd-src/gnu/usr.bin/gcc/gcc/cp/
H A Drtti.c273 cond = cp_convert (boolean_type_node, TREE_OPERAND (exp, 0));
423 build (EQ_EXPR, boolean_type_node, test, integer_zero_node),
1374 &boolean_type_node, in emit_support_tinfos()
H A Dinit.c812 build (EQ_EXPR, boolean_type_node,
2602 build (EQ_EXPR, boolean_type_node, base, tbase)),
2658 fold (build (NE_EXPR, boolean_type_node, base,
2901 finish_if_stmt_cond (build (NE_EXPR, boolean_type_node,
2974 finish_do_stmt (build (NE_EXPR, boolean_type_node,
H A Dtypeck.c3183 result_type = boolean_type_node;
3261 build_type = boolean_type_node;
3330 e2 = build (EQ_EXPR, boolean_type_node, pfn0, pfn1);
3357 build_type = boolean_type_node;
3534 return cp_convert (boolean_type_node, val);
3888 t = perform_implicit_conversion (boolean_type_node, expr);
3889 t = fold (build1 (CLEANUP_POINT_EXPR, boolean_type_node, t));
4010 arg = cp_convert (boolean_type_node, arg);
4168 if (TREE_TYPE (arg) == boolean_type_node)
/openbsd-src/gnu/gcc/gcc/config/xtensa/
H A Dxtensa.c2240 t = build2 (GT_EXPR, boolean_type_node, ndx, t); in xtensa_gimplify_va_arg_expr()
2270 t = build2 (GT_EXPR, boolean_type_node, orig_ndx, t); in xtensa_gimplify_va_arg_expr()
2308 t = fold_build2 (GE_EXPR, boolean_type_node, type_size, t); in xtensa_gimplify_va_arg_expr()
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dc-common.c2626 *restype_ptr = boolean_type_node;
2782 TREE_TYPE (expr) = boolean_type_node;
2802 return build (COMPOUND_EXPR, boolean_type_node,
2826 return build (COMPOUND_EXPR, boolean_type_node, TREE_OPERAND (expr, 1),
2833 return fold (build (COND_EXPR, boolean_type_node, TREE_OPERAND (expr, 0),
2877 && TREE_TYPE (expr) != boolean_type_node)
2879 return build1 (NOP_EXPR, boolean_type_node, expr);

1234