Home
last modified time | relevance | path

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

12345

/netbsd/src/external/gpl3/gcc/dist/gcc/
Dtree-ssa-loop-niter.cc1069 cond = fold_build2 (GE_EXPR, boolean_type_node, iv->base, final); in number_of_iterations_ne()
1075 t = fold_build2 (GE_EXPR, boolean_type_node, t, iv->base); in number_of_iterations_ne()
1079 relaxed_cond = fold_build2 (GT_EXPR, boolean_type_node, t, in number_of_iterations_ne()
1086 cond = fold_build2 (LE_EXPR, boolean_type_node, iv->base, final); in number_of_iterations_ne()
1092 t = fold_build2 (LE_EXPR, boolean_type_node, t, iv->base); in number_of_iterations_ne()
1096 relaxed_cond = fold_build2 (LT_EXPR, boolean_type_node, t, in number_of_iterations_ne()
1131 assumption = fold_build2 (EQ_EXPR, boolean_type_node, in number_of_iterations_ne()
1134 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in number_of_iterations_ne()
1212 assumption = fold_build2 (LE_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
1220 noloop = fold_build2 (GT_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
[all …]
Dtree-ssa-ifcombine.cc435 boolean_type_node, t2, t); in ifcombine_ifandif()
520 t = fold_build2 (result_inv ? NE_EXPR : EQ_EXPR, boolean_type_node, t, in ifcombine_ifandif()
569 if (!(t = maybe_fold_and_comparisons (boolean_type_node, inner_cond_code, in ifcombine_ifandif()
590 boolean_type_node, in ifcombine_ifandif()
595 boolean_type_node, in ifcombine_ifandif()
599 TRUTH_AND_EXPR, boolean_type_node, t1, t2); in ifcombine_ifandif()
Dtree-vect-loop-manip.cc2863 guard_cond = fold_build2 (EQ_EXPR, boolean_type_node, in vect_do_peeling()
2964 guard_cond = fold_build2 (LT_EXPR, boolean_type_node, nitersm1, t); in vect_do_peeling()
3021 guard_cond = fold_build2 (EQ_EXPR, boolean_type_node, in vect_do_peeling()
3166 *cond_expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in vect_create_cond_for_niters_checks()
3179 *cond_expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in chain_cond_expr()
3295 part_cond_expr = fold_build2 (EQ_EXPR, boolean_type_node, in vect_create_cond_for_align_checks()
3316 tree part_cond_expr = fold_build2 (NE_EXPR, boolean_type_node, in vect_create_cond_for_unequal_addrs()
3342 tree part_cond_expr = fold_build2 (GE_EXPR, boolean_type_node, expr, in vect_create_cond_for_lower_bounds()
3435 cond_expr = fold_build2 (GE_EXPR, boolean_type_node, scalar_loop_iters, in vect_loop_versioning()
3440 tree expr = fold_build2 (GE_EXPR, boolean_type_node, scalar_loop_iters, in vect_loop_versioning()
[all …]
Dtree-ssa-loop-manip.cc1062 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in determine_exit_conditions()
1070 assum = fold_build2 (GE_EXPR, boolean_type_node, in determine_exit_conditions()
1074 assum = fold_build2 (LE_EXPR, boolean_type_node, in determine_exit_conditions()
1077 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond); in determine_exit_conditions()
1080 assum = fold_build2 (cmp, boolean_type_node, base, bound); in determine_exit_conditions()
1081 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond); in determine_exit_conditions()
Dtree-ssa-dom.cc288 tree cond = build2 (EQ_EXPR, boolean_type_node, in derive_equivalences()
318 tree cond = build2 (code, boolean_type_node, in derive_equivalences()
366 tree cond = build2 (code, boolean_type_node, in derive_equivalences()
541 tree cond = build2 (code, boolean_type_node, op0, op1); in record_edge_info()
565 tree cond = build2 (code, boolean_type_node, op0, op1); in record_edge_info()
1644 expr_type = boolean_type_node; in eliminate_redundant_computations()
2306 gimple_cond_code (stmt), boolean_type_node, in optimize_stmt()
Domp-expand.cc1852 t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts()
1880 && ((t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts()
2633 tree tem = fold_build2 (LT_EXPR, boolean_type_node, t, in expand_omp_for_init_vars()
3266 t = fold_build2 (fd->loops[i].cond_code, boolean_type_node, v, t); in extract_omp_for_update_vars()
3412 t1 = fold_build2_loc (loc, GE_EXPR, boolean_type_node, a, in expand_omp_ordered_sink()
3415 t1 = fold_build2_loc (loc, LT_EXPR, boolean_type_node, a, in expand_omp_ordered_sink()
3418 t2 = fold_build2_loc (loc, LT_EXPR, boolean_type_node, a, in expand_omp_ordered_sink()
3421 t2 = fold_build2_loc (loc, GE_EXPR, boolean_type_node, a, in expand_omp_ordered_sink()
3423 t = fold_build2_loc (loc, LT_EXPR, boolean_type_node, in expand_omp_ordered_sink()
3434 t = fold_build3_loc (loc, COND_EXPR, boolean_type_node, in expand_omp_ordered_sink()
[all …]
Dgimple-builder.cc40 ? boolean_type_node in get_expr_type()
Dvalue-range.cc2473 r0 = range_zero (boolean_type_node); in range_tests_misc()
2474 ASSERT_TRUE (r0 == int_range<1> (build_zero_cst (boolean_type_node), in range_tests_misc()
2475 build_zero_cst (boolean_type_node))); in range_tests_misc()
2477 ASSERT_TRUE (r0 == int_range<1> (build_one_cst (boolean_type_node), in range_tests_misc()
2478 build_one_cst (boolean_type_node))); in range_tests_misc()
2520 ASSERT_TRUE (wi::max_value (TYPE_PRECISION (boolean_type_node), in range_tests_misc()
2521 TYPE_SIGN (boolean_type_node)) in range_tests_misc()
2522 == wi::uhwi (1, TYPE_PRECISION (boolean_type_node))); in range_tests_misc()
Domp-general.cc589 t = fold_binary (loop->cond_code, boolean_type_node, in omp_extract_for_data()
591 tree t2 = fold_binary (loop->cond_code, boolean_type_node, in omp_extract_for_data()
636 t2 = fold_binary (loop->cond_code, boolean_type_node, in omp_extract_for_data()
654 boolean_type_node, t3, t4); in omp_extract_for_data()
668 boolean_type_node, t3, t4); in omp_extract_for_data()
689 boolean_type_node, t3, t4); in omp_extract_for_data()
703 boolean_type_node, t3, t4); in omp_extract_for_data()
725 t = fold_binary (loop->cond_code, boolean_type_node, in omp_extract_for_data()
2923 dims = tree_cons (build_int_cst (boolean_type_node, ix >= level), in oacc_build_routine_dims()
Dtree-ssa-scopedtables.cc151 expr.type = boolean_type_node; in simplify_binary_operation()
747 expr->type = boolean_type_node; in expr_hash_elt()
1061 expr->type = boolean_type_node; in initialize_expr_from_cond()
1094 cond->type = boolean_type_node; in build_and_record_new_cond()
Dtree-ssa-phiopt.cc890 tree cond = build2_loc (loc, comp_code, boolean_type_node, in gimple_simplify_phiopt()
921 comp_code, boolean_type_node, in gimple_simplify_phiopt()
1491 tree t = build2 (NE_EXPR, boolean_type_node, in value_replacement()
2020 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, in minmax_replacement()
2051 if (!integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node, in minmax_replacement()
2091 if (!integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node, in minmax_replacement()
2118 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, in minmax_replacement()
2679 tree t = build2 (one_cmp, boolean_type_node, lhs1, rhs2); in spaceship_replacement()
2685 t = build2 (EQ_EXPR, boolean_type_node, lhs1, rhs2); in spaceship_replacement()
Dgimple-range-fold.h73 type = boolean_type_node; in gimple_range_type()
Dtree-if-conv.cc446 tree t = maybe_fold_or_comparisons (boolean_type_node, code1, op1a, op1b, in fold_or_predicates()
452 return fold_build2_loc (loc, TRUTH_OR_EXPR, boolean_type_node, c1, c2); in fold_or_predicates()
584 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in add_to_dst_predicate_list()
1318 boolean_type_node, in predicate_bbs()
1331 c2 = build1_loc (loc, TRUTH_NOT_EXPR, boolean_type_node, in predicate_bbs()
2568 boolean_type_node, in predicate_statements()
2915 tree cond = make_ssa_name (boolean_type_node); in version_loop_for_if_conversion()
Dubsan.cc1199 t = gimple_build (&seq, loc, GE_EXPR, boolean_type_node, in ubsan_expand_ptr_ifn()
1919 t = fold_build2 (UNLE_EXPR, boolean_type_node, expr, min); in ubsan_instrument_float_cast()
1920 tt = fold_build2 (UNGE_EXPR, boolean_type_node, expr, max); in ubsan_instrument_float_cast()
1924 t = fold_build2 (LE_EXPR, boolean_type_node, expr, min); in ubsan_instrument_float_cast()
1925 tt = fold_build2 (GE_EXPR, boolean_type_node, expr, max); in ubsan_instrument_float_cast()
1927 t = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, t, tt); in ubsan_instrument_float_cast()
Dtree-streamer.cc289 gcc_checking_assert (node != boolean_type_node in record_common_node()
Dtree-ssa-sccvn.cc489 boolean_type_node, ops); in VN_INFO()
499 boolean_type_node, ops); in VN_INFO()
7362 vn_nary_op_insert_pieces_predicated (2, NE_EXPR, boolean_type_node, in insert_related_predicates_on_edge()
7364 vn_nary_op_insert_pieces_predicated (2, LE_EXPR, boolean_type_node, in insert_related_predicates_on_edge()
7367 vn_nary_op_insert_pieces_predicated (2, GT_EXPR, boolean_type_node, in insert_related_predicates_on_edge()
7369 vn_nary_op_insert_pieces_predicated (2, EQ_EXPR, boolean_type_node, in insert_related_predicates_on_edge()
7374 vn_nary_op_insert_pieces_predicated (2, NE_EXPR, boolean_type_node, in insert_related_predicates_on_edge()
7376 vn_nary_op_insert_pieces_predicated (2, GE_EXPR, boolean_type_node, in insert_related_predicates_on_edge()
7379 vn_nary_op_insert_pieces_predicated (2, LT_EXPR, boolean_type_node, in insert_related_predicates_on_edge()
7381 vn_nary_op_insert_pieces_predicated (2, EQ_EXPR, boolean_type_node, in insert_related_predicates_on_edge()
[all …]
Dtree-data-ref.cc2046 ifn, boolean_type_node, in create_ifn_alias_checks()
2319 tree part_cond_expr = fold_build2 (GT_EXPR, boolean_type_node, subject, in create_intersect_range_checks_index()
2322 *cond_expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in create_intersect_range_checks_index()
2377 tree neg_step = fold_build2 (LT_EXPR, boolean_type_node, in create_waw_or_war_checks()
2487 *cond_expr = fold_build2 (GT_EXPR, boolean_type_node, subject, limit); in create_waw_or_war_checks()
2557 tree neg_step = fold_build2 (LT_EXPR, boolean_type_node, in get_segment_min_max()
2642 = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, in create_intersect_range_checks()
2643 fold_build2 (cmp_code, boolean_type_node, seg_a_max, seg_b_min), in create_intersect_range_checks()
2644 fold_build2 (cmp_code, boolean_type_node, seg_b_max, seg_a_min)); in create_intersect_range_checks()
2675 *cond_expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in create_runtime_alias_checks()
[all …]
Dtree-call-cdce.cc433 tempc = create_tmp_var (boolean_type_node, temp_name2); in gen_one_condition()
436 boolean_type_node, in gen_one_condition()
/netbsd/src/external/gpl3/gcc/dist/gcc/config/arm/
Darm-mve-builtins.cc97 if (eltype == boolean_type_node) in register_builtin_types()
142 if (scalar_types[type] == boolean_type_node in register_builtin_tuple_types()
Darm-mve-builtins.def25 DEF_MVE_TYPE (mve_pred16_t, boolean_type_node)
/netbsd/src/external/gpl3/gcc/dist/gcc/cp/
Dcoroutines.cc1064 else if (same_type_p (susp_return_type, boolean_type_node)) in build_co_await()
1688 ready_cond = cp_convert (boolean_type_node, ready_cond, in expand_one_await_expression()
1694 = build1_loc (loc, CLEANUP_POINT_EXPR, boolean_type_node, ready_cond); in expand_one_await_expression()
1728 suspend = build1_loc (loc, TRUTH_NOT_EXPR, boolean_type_node, suspend); in expand_one_await_expression()
1730 = build1_loc (loc, CLEANUP_POINT_EXPR, boolean_type_node, suspend); in expand_one_await_expression()
2955 boolean_type_node); in handle_nested_conditionals()
2964 tree set_flag = build2 (INIT_EXPR, boolean_type_node, in handle_nested_conditionals()
2967 = build2 (COMPOUND_EXPR, boolean_type_node, n->init, set_flag); in handle_nested_conditionals()
3299 cond = build1 (TRUTH_NOT_EXPR, boolean_type_node, cond); in expand_one_truth_if()
3301 = build3_loc (sloc, COND_EXPR, boolean_type_node, in expand_one_truth_if()
[all …]
Dexcept.cc291 conv = perform_implicit_conversion_flags (boolean_type_node, cond, in build_must_not_throw_expr()
1162 return build_min (NOEXCEPT_EXPR, boolean_type_node, expr); in finish_noexcept_expr()
1306 current_retval_sentinel = create_temporary_var (boolean_type_node); in maybe_set_retval_sentinel()
1311 return build2 (MODIFY_EXPR, boolean_type_node, in maybe_set_retval_sentinel()
1368 tree clear = build2 (MODIFY_EXPR, boolean_type_node, in maybe_splice_retval_cleanup()
Dconstraint.cc1339 TREE_TYPE (tmpl) = boolean_type_node; in build_function_check()
1361 TREE_TYPE (tmpl) = boolean_type_node; in build_function_check()
1364 tree id = build2 (TEMPLATE_ID_EXPR, boolean_type_node, tmpl, args); in build_function_check()
1370 TREE_TYPE (call) = boolean_type_node; in build_function_check()
1389 return build2 (TEMPLATE_ID_EXPR, boolean_type_node, tmpl, args); in build_variable_check()
1404 return build2 (TEMPLATE_ID_EXPR, boolean_type_node, tmpl, args); in build_standard_check()
2830 boolean_type_node)); in satisfaction_value()
2976 if (!same_type_p (TREE_TYPE (result), boolean_type_node)) in satisfy_atom()
3373 tree r = build_min (REQUIRES_EXPR, boolean_type_node, parms, reqs, NULL_TREE); in finish_requires_expr()
3755 if (!same_type_p (TREE_TYPE (result), boolean_type_node)) in diagnose_atomic_constraint()
Dmethod.cc1114 comp = fold_build2 (LT_EXPR, boolean_type_node, op1, op0); in genericize_spaceship()
1130 comp = fold_build2 (LT_EXPR, boolean_type_node, op0, op1); in genericize_spaceship()
1142 comp = fold_build2 (EQ_EXPR, boolean_type_node, op0, op1); in genericize_spaceship()
1176 && !same_type_p (TREE_TYPE (TREE_TYPE (fn)), boolean_type_node)) in early_check_defaulted_comparison()
1489 rettype = boolean_type_node; in build_comparison_op()
1651 finish_for_cond (build2 (LE_EXPR, boolean_type_node, idx, in build_comparison_op()
1732 tree neg = build1 (TRUTH_NOT_EXPR, boolean_type_node, comp); in build_comparison_op()
2991 TREE_TYPE (fn) = change_return_type (boolean_type_node, TREE_TYPE (fn)); in implicitly_declare_fn()
Drtti.cc368 cond = cp_convert (boolean_type_node, exp, complain); in build_typeid()
550 tree cond = build2 (NE_EXPR, boolean_type_node, test, null_ptr); in build_if_nonnull()
1593 &boolean_type_node, in emit_support_tinfos()

12345