Home
last modified time | relevance | path

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

12

/freebsd-12.1/contrib/gcc/
H A Dtree-ssa-loop-niter.c189 assumption = fold_build2 (EQ_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()
369 assumption = fold_build2 (GE_EXPR, boolean_type_node, in assert_loop_rolls_lt()
387 assumption = fold_build2 (LE_EXPR, boolean_type_node, in assert_loop_rolls_lt()
513 assumption = fold_build2 (NE_EXPR, boolean_type_node, in number_of_iterations_le()
516 assumption = fold_build2 (NE_EXPR, boolean_type_node, in number_of_iterations_le()
939 boolean_type_node, in simplify_using_initial_conditions()
[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()
3730 cond = build2 (loc->comp_code, boolean_type_node, name, loc->val); in process_assert_insertions_for()
5137 = build2 (EQ_EXPR, boolean_type_node, op0, new); in simplify_cond_using_ranges()
5165 = build2 (NE_EXPR, boolean_type_node, op0, new); in simplify_cond_using_ranges()
5280 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()
H A Dtree-ssa-copy.c651 tree folded_cond = fold_binary (TREE_CODE (cond), boolean_type_node, in copy_prop_visit_cond_stmt()
H A Dtree.c6531 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE); in build_common_tree_nodes()
6532 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE); in build_common_tree_nodes()
6533 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1); in build_common_tree_nodes()
6534 TYPE_PRECISION (boolean_type_node) = 1; in build_common_tree_nodes()
6572 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node); in build_common_tree_nodes_2()
6573 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node); in build_common_tree_nodes_2()
H A Dlambda-code.c1918 boolean_type_node, in lambda_loopnest_to_gcc_loopnest()
2506 build2 (NE_EXPR, boolean_type_node, in perfect_nestify()
2556 boolean_type_node, in perfect_nestify()
H A Dtree-ssa-dom.c566 tree dummy_cond = build2 (NE_EXPR, boolean_type_node, in dom_thread_across_edge()
927 *p = build2 (new_code, boolean_type_node, op0, op1); in build_and_record_new_cond()
H A Dgimplify.c2397 TREE_TYPE (expr) = boolean_type_node; in gimple_boolify()
2403 return fold_convert (boolean_type_node, expr); in gimple_boolify()
2790 build2 (EQ_EXPR, boolean_type_node, in gimplify_init_ctor_eval_range()
4213 tree flag = create_tmp_var (boolean_type_node, "cleanup"); in gimple_push_cleanup()
5276 build2 (NE_EXPR, boolean_type_node, oldival, oldival2), in gimplify_omp_atomic_pipeline()
H A Dbuiltin-types.def69 DEF_PRIMITIVE_TYPE (BT_BOOL, boolean_type_node)
/freebsd-12.1/contrib/gcc/cp/
H A Drtti.c306 cond = cp_convert (boolean_type_node, TREE_OPERAND (exp, 0)); in build_typeid()
449 build2 (EQ_EXPR, boolean_type_node, test, in ifnonnull()
1383 &boolean_type_node, in emit_support_tinfos()
H A Dtypeck.c3318 result_type = boolean_type_node; in build_binary_op()
3401 build_type = boolean_type_node; in build_binary_op()
3480 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1); in build_binary_op()
3517 build_type = boolean_type_node; in build_binary_op()
3729 return cp_convert (boolean_type_node, val); in build_binary_op()
4074 t = perform_implicit_conversion (boolean_type_node, expr); in condition_conversion()
4075 t = fold_build_cleanup_point_expr (boolean_type_node, t); in condition_conversion()
4361 if (same_type_p (declared_type, boolean_type_node)) in build_unary_op()
5765 boolean_type_node, in build_modify_expr()
6516 && type == boolean_type_node in convert_for_assignment()
[all …]
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()
2570 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator, in build_vec_init()
H A Dcall.c1587 t = implicit_conversion (boolean_type_node, argtypes[2], args[2], in build_builtin_candidate()
2092 (candidates, fnname, boolean_type_node, in add_builtin_candidates()
2099 (candidates, fnname, boolean_type_node, in add_builtin_candidates()
2100 boolean_type_node, args, argtypes, flags); in add_builtin_candidates()
3230 arg1 = perform_implicit_conversion (boolean_type_node, arg1); in build_conditional_expr()
5295 build2 (EQ_EXPR, boolean_type_node, in build_special_member_call()
H A Dcp-gimplify.c884 t = build2 (NE_EXPR, boolean_type_node, p1, end1); in cxx_omp_clause_apply_fn()
H A Dmethod.c500 cond = cp_convert (boolean_type_node, t); in use_thunk()
H A Dcvt.c1230 if (type == boolean_type_node) in type_promotes_to()

12