Home
last modified time | relevance | path

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

123456

/dflybsd-src/contrib/gcc-8.0/gcc/c-family/
H A Dc-ubsan.c57 t = fold_build2 (EQ_EXPR, boolean_type_node, in ubsan_instrument_division()
61 t = fold_build2 (EQ_EXPR, boolean_type_node, in ubsan_instrument_division()
72 tt = fold_build2 (EQ_EXPR, boolean_type_node, unshare_expr (op1), in ubsan_instrument_division()
74 x = fold_build2 (EQ_EXPR, boolean_type_node, op0, in ubsan_instrument_division()
76 x = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, x, tt); in ubsan_instrument_division()
77 t = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, t, x); in ubsan_instrument_division()
132 t = fold_build2 (GT_EXPR, boolean_type_node, t, uprecm1); in ubsan_instrument_shift()
151 tt = fold_build2 (NE_EXPR, boolean_type_node, tt, in ubsan_instrument_shift()
165 tt = fold_build2 (GT_EXPR, boolean_type_node, tt, in ubsan_instrument_shift()
167 x = fold_build2 (LT_EXPR, boolean_type_node, unshare_expr (op0), in ubsan_instrument_shift()
[all …]
/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dtree-ssa-loop-niter.c681 assumption = fold_build2 (EQ_EXPR, boolean_type_node, in number_of_iterations_ne()
684 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in number_of_iterations_ne()
755 assumption = fold_build2 (LE_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
763 noloop = fold_build2 (GT_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
767 noloop = fold_build2 (GT_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
781 assumption = fold_build2 (GE_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
789 noloop = fold_build2 (GT_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
795 noloop = fold_build2 (GT_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
802 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
806 niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
[all …]
H A Dgimple-fold.c515 boolean_type_node, in fold_gimple_cond()
1355 return fold_build2 (EQ_EXPR, boolean_type_node, expr, in canonicalize_bool()
1359 boolean_type_node, in canonicalize_bool()
1374 return fold_build2 (NE_EXPR, boolean_type_node, expr, in canonicalize_bool()
1378 boolean_type_node, in canonicalize_bool()
1702 boolean_type_node, op1a, op1b); in and_comparisons_1()
1715 boolean_type_node, op1a, op1b); in and_comparisons_1()
1748 return fold_build2 (code1, boolean_type_node, op1a, op1b); in and_comparisons_1()
1771 return fold_build2 (code2, boolean_type_node, op2a, op2b); in and_comparisons_1()
1793 return fold_build2 (code2, boolean_type_node, op2a, op2b); in and_comparisons_1()
[all …]
H A Dtree-vect-loop-manip.c1074 fold_build2 (LE_EXPR, boolean_type_node, scalar_loop_iters, in set_prologue_iterations()
1366 fold_build2 (LE_EXPR, boolean_type_node, *first_niters, in slpeel_tree_peel_loop_to_edge()
1374 fold_build2 (LE_EXPR, boolean_type_node, scalar_loop_iters, in slpeel_tree_peel_loop_to_edge()
1377 pre_condition = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, in slpeel_tree_peel_loop_to_edge()
1383 fold_build2 (TRUTH_OR_EXPR, boolean_type_node, in slpeel_tree_peel_loop_to_edge()
1385 fold_build1 (TRUTH_NOT_EXPR, boolean_type_node, in slpeel_tree_peel_loop_to_edge()
1398 fold_build2 (LE_EXPR, boolean_type_node, *first_niters, in slpeel_tree_peel_loop_to_edge()
1440 fold_build2 (EQ_EXPR, boolean_type_node, *first_niters, niters); in slpeel_tree_peel_loop_to_edge()
2358 part_cond_expr = fold_build2 (EQ_EXPR, boolean_type_node, in vect_create_cond_for_align_checks()
2361 *cond_expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in vect_create_cond_for_align_checks()
[all …]
H A Dtree-ssa-loop-manip.c749 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in determine_exit_conditions()
757 assum = fold_build2 (GE_EXPR, boolean_type_node, in determine_exit_conditions()
761 assum = fold_build2 (LE_EXPR, boolean_type_node, in determine_exit_conditions()
764 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond); in determine_exit_conditions()
767 assum = fold_build2 (cmp, boolean_type_node, base, bound); in determine_exit_conditions()
768 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond); in determine_exit_conditions()
H A Dtree-ssa-phiopt.c548 gimple_cond_code (stmt), boolean_type_node, in conditional_replacement()
870 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, in minmax_replacement()
895 if (!integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node, in minmax_replacement()
929 if (!integer_nonzerop (fold_build2 (GE_EXPR, boolean_type_node, in minmax_replacement()
954 if (!integer_nonzerop (fold_build2 (LE_EXPR, boolean_type_node, in minmax_replacement()
H A Dtree-complex.c1113 LT_EXPR, boolean_type_node, t1, t2); in expand_complex_div_wide()
1124 tmp = create_tmp_var (boolean_type_node, NULL); in expand_complex_div_wide()
1135 EQ_EXPR, boolean_type_node, tmp, boolean_true_node); in expand_complex_div_wide()
1369 cr = gimplify_build2 (gsi, code, boolean_type_node, ar, br); in expand_complex_comparison()
1370 ci = gimplify_build2 (gsi, code, boolean_type_node, ai, bi); in expand_complex_comparison()
1373 boolean_type_node, cr, ci); in expand_complex_comparison()
H A Dtree-mudflap.c623 t = build2 (GT_EXPR, boolean_type_node, t, mf_base); in mf_build_check_statement_for()
639 u = build2 (LT_EXPR, boolean_type_node, u, v); in mf_build_check_statement_for()
644 t = build2 (TRUTH_OR_EXPR, boolean_type_node, t, u); in mf_build_check_statement_for()
647 cond = make_rename_temp (boolean_type_node, "__mf_unlikely_cond"); in mf_build_check_statement_for()
H A Dtree-ssa-dom.c247 expr->type = boolean_type_node; in initialize_hash_element()
316 expr->type = boolean_type_node; in initialize_expr_from_cond()
1226 cond->type = boolean_type_node; in build_and_record_new_cond()
1669 tree cond = build2 (code, boolean_type_node, op0, op1); in record_edge_info()
1699 tree cond = build2 (code, boolean_type_node, op0, op1); in record_edge_info()
1924 expr_type = boolean_type_node; in eliminate_redundant_computations()
2348 gimple_cond_code (stmt), boolean_type_node, in optimize_stmt()
2791 boolean_type_node, in propagate_rhs_into_lhs()
H A Dtree-ssa-ifcombine.c342 t = fold_build2 (EQ_EXPR, boolean_type_node, t2, t); in ifcombine_ifandif()
487 t = fold_build2 (NE_EXPR, boolean_type_node, t, in ifcombine_iforif()
H A Dtree-ssa-copy.c126 type_d = boolean_type_node; in may_propagate_copy_into_stmt()
469 boolean_type_node, op0, op1); in copy_prop_visit_cond_stmt()
H A Dtree-call-cdce.c343 tempc = create_tmp_var (boolean_type_node, temp_name2); in gen_one_condition()
346 boolean_type_node, in gen_one_condition()
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dtree-ssa-loop-niter.c1038 cond = fold_build2 (GE_EXPR, boolean_type_node, iv->base, final); in number_of_iterations_ne()
1044 t = fold_build2 (GE_EXPR, boolean_type_node, t, iv->base); in number_of_iterations_ne()
1052 relaxed_cond = fold_build2 (GT_EXPR, boolean_type_node, in number_of_iterations_ne()
1059 cond = fold_build2 (LE_EXPR, boolean_type_node, iv->base, final); in number_of_iterations_ne()
1065 t = fold_build2 (LE_EXPR, boolean_type_node, t, iv->base); in number_of_iterations_ne()
1073 relaxed_cond = fold_build2 (LT_EXPR, boolean_type_node, in number_of_iterations_ne()
1116 assumption = fold_build2 (EQ_EXPR, boolean_type_node, in number_of_iterations_ne()
1119 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in number_of_iterations_ne()
1190 assumption = fold_build2 (LE_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
1198 noloop = fold_build2 (GT_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
[all …]
H A Dtree-ssa-ifcombine.c423 boolean_type_node, t2, t); in ifcombine_ifandif()
502 t = fold_build2 (result_inv ? NE_EXPR : EQ_EXPR, boolean_type_node, t, in ifcombine_ifandif()
571 boolean_type_node, in ifcombine_ifandif()
576 boolean_type_node, in ifcombine_ifandif()
580 TRUTH_AND_EXPR, boolean_type_node, t1, t2); in ifcombine_ifandif()
H A Domp-expand.c1674 t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts()
1691 && ((t = fold_binary (fd->loops[i].cond_code, boolean_type_node, in expand_omp_for_init_counts()
1957 t = fold_build2 (fd->loops[i].cond_code, boolean_type_node, v, t); in extract_omp_for_update_vars()
2102 t1 = fold_build2_loc (loc, GE_EXPR, boolean_type_node, a, in expand_omp_ordered_sink()
2105 t1 = fold_build2_loc (loc, LT_EXPR, boolean_type_node, a, in expand_omp_ordered_sink()
2108 t2 = fold_build2_loc (loc, LT_EXPR, boolean_type_node, a, in expand_omp_ordered_sink()
2111 t2 = fold_build2_loc (loc, GE_EXPR, boolean_type_node, a, in expand_omp_ordered_sink()
2113 t = fold_build2_loc (loc, LT_EXPR, boolean_type_node, in expand_omp_ordered_sink()
2124 t = fold_build3_loc (loc, COND_EXPR, boolean_type_node, in expand_omp_ordered_sink()
2130 t = fold_build2_loc (loc, GE_EXPR, boolean_type_node, a, in expand_omp_ordered_sink()
[all …]
H A Dgimple-fold.c3576 tree host_eq = make_ssa_name (boolean_type_node); in gimple_fold_builtin_acc_on_device()
3582 tree dev_eq = make_ssa_name (boolean_type_node); in gimple_fold_builtin_acc_on_device()
3588 tree result = make_ssa_name (boolean_type_node); in gimple_fold_builtin_acc_on_device()
4421 tree res = maybe_push_res_to_seq (rcode, boolean_type_node, in replace_stmt_with_simplification()
5023 return fold_build2 (EQ_EXPR, boolean_type_node, expr, in canonicalize_bool()
5027 boolean_type_node, in canonicalize_bool()
5042 return fold_build2 (NE_EXPR, boolean_type_node, expr, in canonicalize_bool()
5046 boolean_type_node, in canonicalize_bool()
5418 return fold_build2 (code1, boolean_type_node, op1a, op1b); in and_comparisons_1()
5441 return fold_build2 (code2, boolean_type_node, op2a, op2b); in and_comparisons_1()
[all …]
H A Dtree-vect-loop-manip.c2530 guard_cond = fold_build2 (EQ_EXPR, boolean_type_node, in vect_do_peeling()
2602 guard_cond = fold_build2 (LT_EXPR, boolean_type_node, nitersm1, t); in vect_do_peeling()
2659 guard_cond = fold_build2 (EQ_EXPR, boolean_type_node, in vect_do_peeling()
2726 *cond_expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in vect_create_cond_for_niters_checks()
2739 *cond_expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in chain_cond_expr()
2853 part_cond_expr = fold_build2 (EQ_EXPR, boolean_type_node, in vect_create_cond_for_align_checks()
2873 tree part_cond_expr = fold_build2 (NE_EXPR, boolean_type_node, in vect_create_cond_for_unequal_addrs()
2898 tree part_cond_expr = fold_build2 (GE_EXPR, boolean_type_node, expr, in vect_create_cond_for_lower_bounds()
2986 cond_expr = fold_build2 (GE_EXPR, boolean_type_node, scalar_loop_iters, in vect_loop_versioning()
2991 tree expr = fold_build2 (GE_EXPR, boolean_type_node, scalar_loop_iters, in vect_loop_versioning()
[all …]
H A Dtree-ssa-loop-manip.c1041 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in determine_exit_conditions()
1049 assum = fold_build2 (GE_EXPR, boolean_type_node, in determine_exit_conditions()
1053 assum = fold_build2 (LE_EXPR, boolean_type_node, in determine_exit_conditions()
1056 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond); in determine_exit_conditions()
1059 assum = fold_build2 (cmp, boolean_type_node, base, bound); in determine_exit_conditions()
1060 cond = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, assum, cond); in determine_exit_conditions()
H A Dtree-ssa-dom.c288 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()
540 tree cond = build2 (code, boolean_type_node, op0, op1); in record_edge_info()
564 tree cond = build2 (code, boolean_type_node, op0, op1); in record_edge_info()
1540 expr_type = boolean_type_node; in eliminate_redundant_computations()
2123 gimple_cond_code (stmt), boolean_type_node, in optimize_stmt()
H A Dgimple-builder.c40 ? boolean_type_node in get_expr_type()
H A Dtree-complex.c1164 LT_EXPR, boolean_type_node, t1, t2); in expand_complex_div_wide()
1175 tmp = create_tmp_var (boolean_type_node); in expand_complex_div_wide()
1186 EQ_EXPR, boolean_type_node, tmp, boolean_true_node); in expand_complex_div_wide()
1429 cr = gimplify_build2 (gsi, code, boolean_type_node, ar, br); in expand_complex_comparison()
1430 ci = gimplify_build2 (gsi, code, boolean_type_node, ai, bi); in expand_complex_comparison()
1433 boolean_type_node, cr, ci); in expand_complex_comparison()
H A Dtree-ssa-scopedtables.c159 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;
H A Dtree-ssa-loop-split.c551 tree cond = build2 (guard_code, boolean_type_node, guard_init, border); in split_loop()
553 cond = fold_build1 (TRUTH_NOT_EXPR, boolean_type_node, cond); in split_loop()
/dflybsd-src/contrib/gcc-8.0/gcc/c/
H A Dgimple-parser.c507 ret_type = boolean_type_node; in c_parser_gimple_binary_expression()
511 ret_type = boolean_type_node; in c_parser_gimple_binary_expression()
515 ret_type = boolean_type_node; in c_parser_gimple_binary_expression()
519 ret_type = boolean_type_node; in c_parser_gimple_binary_expression()
523 ret_type = boolean_type_node; in c_parser_gimple_binary_expression()
527 ret_type = boolean_type_node; in c_parser_gimple_binary_expression()
/dflybsd-src/contrib/gcc-8.0/gcc/cp/
H A Dexcept.c270 conv = perform_implicit_conversion_flags (boolean_type_node, cond, in build_must_not_throw_expr()
1105 return build_min (NOEXCEPT_EXPR, boolean_type_node, expr); in finish_noexcept_expr()
1201 expr = perform_implicit_conversion_flags (boolean_type_node, expr, in build_noexcept_spec()

123456