/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | ccmp.c | 135 tree *rhs1, tree *rhs2) 145 *rhs2 = gimple_assign_rhs2 (g); 153 *rhs2 = build_zero_cst (TREE_TYPE (t)); 169 tree rhs1, rhs2; local 171 get_compare_parts(op, &unsignedp, &rcode, &rhs1, &rhs2); 173 rhs1, rhs2, get_rtx_code (code, 0)); 134 get_compare_parts(tree t, int *up, rtx_code *rcode, tree *rhs1, tree *rhs2) argument
|
H A D | tree-ssa-dom.c | 181 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 185 value = build_zero_cst (TREE_TYPE (rhs2)); 186 derive_equivalences (rhs2, value, recursion_limit - 1); 195 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 209 if (TREE_CODE (rhs2) == SSA_NAME) 211 if (ssa_name_has_boolean_range (rhs2)) 213 value = build_one_cst (TREE_TYPE (rhs2)); 214 derive_equivalences (rhs2, value, recursion_limit - 1); 245 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 250 && TREE_CODE (rhs2) 270 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 304 tree rhs2 = gimple_assign_rhs2 (def_stmt); local [all...] |
H A D | gimple-ssa-strength-reduction.c | 729 tree lhs, rhs1, rhs2; 740 rhs2 = gimple_assign_rhs2 (gs); 742 if (tree_fits_shwi_p (rhs2)) 743 return mult_by_coeff_cost (tree_to_shwi (rhs2), lhs_mode, speed); 1241 slsr_process_mul (gimple *gs, tree rhs1, tree rhs2, bool speed) 1249 if (rhs1 == rhs2) 1252 if (TREE_CODE (rhs2) == SSA_NAME) 1256 c = create_mul_ssa_cand (gs, rhs1, rhs2, speed); 1263 c2 = create_mul_ssa_cand (gs, rhs2, rhs1, speed); 1267 else if (TREE_CODE (rhs2) 726 tree lhs, rhs1, rhs2; local 1237 slsr_process_mul(gimple *gs, tree rhs1, tree rhs2, bool speed) argument 1456 slsr_process_add(gimple *gs, tree rhs1, tree rhs2, bool speed) argument 1762 tree rhs1 = NULL_TREE, rhs2 = NULL_TREE; local 2193 tree rhs1, rhs2; local 2742 tree rhs2 = gimple_assign_rhs2 (c->cand_stmt); local 3683 tree rhs2; local [all...] |
H A D | tree-ssa-reassoc.c | 620 tree rhs2 = gimple_assign_rhs2 (stmt); local 624 if (rhs2 625 && TREE_CODE (rhs2) == SSA_NAME 626 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (rhs2)) 3474 tree rhs1, rhs2; local 3484 rhs2 = gimple_assign_rhs2 (stmt); 3494 rhs2 = gimple_cond_rhs (stmt); 3498 || rhs2 == NULL_TREE 3499 || TREE_CODE (rhs2) != SSA_NAME) 3518 std::swap (rhs1, rhs2); 4815 find_insert_point(gimple *stmt, tree rhs1, tree rhs2, bool &insert_before) argument 4840 tree rhs2 = gimple_assign_rhs2 (stmt_to_insert); local 4870 tree rhs2 = gimple_assign_rhs2 (stmt); local 5305 tree rhs2 = gimple_assign_rhs2 (negatedefstmt); local 5379 tree rhs2 = gimple_assign_rhs2 (stmt); local 6227 transform_stmt_to_multiply(gimple_stmt_iterator *gsi, gimple *stmt, tree rhs1, tree rhs2) argument 6273 tree lhs, rhs1, rhs2; local [all...] |
H A D | tree-ssa-math-opts.c | 2530 tree lhs, rhs1, rhs2, type, type1, type2; local 2543 if (!is_widening_mult_p (stmt, &type1, &rhs1, &type2, &rhs2)) 2607 rhs2 = build_and_insert_cast (gsi, loc, 2609 (actual_precision, from_unsigned2), rhs2); 2614 if (TREE_CODE (rhs2) == INTEGER_CST) 2615 rhs2 = fold_convert (type2, rhs2); 2618 gimple_assign_set_rhs2 (stmt, rhs2); 2638 tree lhs, rhs1, rhs2, mult_rhs1, mult_rhs2, add_rhs; local 2660 rhs2 3340 tree rhs2 = gimple_assign_rhs2 (stmt); local 3418 tree rhs2 = gimple_assign_rhs2 (stmt); local [all...] |
H A D | gimple-match-head.c | 952 tree rhs2 = gimple_assign_rhs2 (stmt); local 955 rhs2 = do_valueize (rhs2, top_valueize, valueized); 956 res_op->set_op (code, type, rhs1, rhs2); 995 tree rhs2 = gimple_assign_rhs2 (stmt); local 998 rhs2 = do_valueize (rhs2, top_valueize, valueized); 1000 res_op->set_op (code, type, rhs1, rhs2, rhs3);
|
H A D | tree-vect-generic.c | 1114 tree rhs2 = gimple_assign_rhs2 (assign); local 1116 return expand_vector_comparison (gsi, type, rhs1, rhs2, code); 1123 tree rhs2 = gimple_assign_rhs2 (assign); local 1128 || TREE_CODE (rhs2) != VECTOR_CST 1132 ret = expand_vector_divmod (gsi, type, rhs1, rhs2, code); 1642 tree rhs2 = gimple_assign_rhs2 (stmt); 1650 new_rhs = expand_vector_parallel (gsi, do_cond, type, rhs2, rhs3, 1654 rhs2, rhs3, COND_EXPR); 1962 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE; 2017 rhs2 1641 tree rhs2 = gimple_assign_rhs2 (stmt); local 1961 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE; local [all...] |
H A D | gimple-ssa-backprop.c | 790 tree rhs2, tree rhs3) 792 if (!rhs1 && !rhs2 && !rhs3) 798 if (rhs2) 799 gimple_assign_set_rhs2 (assign, rhs2); 789 replace_assign_rhs(gassign *assign, tree lhs, tree rhs1, tree rhs2, tree rhs3) argument
|
H A D | tree-ssa-forwprop.c | 488 tree rhs2 = gimple_assign_rhs2 (stmt); local 493 type, rhs1, rhs2); 502 if (TREE_CODE (rhs2) == SSA_NAME) 503 cfg_changed |= remove_prop_source_from_use (rhs2); 524 tree rhs2 = gimple_cond_rhs (stmt); local 532 rhs1, rhs2); 550 if (TREE_CODE (rhs2) == SSA_NAME) 551 cfg_changed |= remove_prop_source_from_use (rhs2); 560 && integer_zerop (rhs2)) 562 && integer_onep (rhs2)))) 668 tree lhs, rhs, rhs2, array_ref; local [all...] |
H A D | gimple-ssa-store-merging.c | 455 tree rhs2 = gimple_assign_rhs1 (source_stmt2); local 456 if (TREE_CODE (rhs2) == BIT_FIELD_REF 457 && TREE_CODE (TREE_OPERAND (rhs2, 0)) == SSA_NAME) 458 rhs2 = TREE_OPERAND (rhs2, 0); 462 if (rhs1 != rhs2) 585 tree rhs1, rhs2 = NULL; local 642 rhs2 = gimple_assign_rhs2 (stmt); 649 && TREE_CODE (rhs2) == INTEGER_CST)) 676 uint64_t val = int_cst_value (rhs2), mas 4786 tree rhs1, rhs2; local [all...] |
H A D | tree-scalar-evolution.c | 1626 tree type, tree rhs1, enum tree_code code, tree rhs2) 1668 rhs2 = TREE_OPERAND (base, 1); 1672 chrec2 = analyze_scalar_evolution (loop, rhs2); 1674 chrec2 = chrec_convert (TREE_TYPE (rhs2), chrec2, at_stmt); 1709 chrec2 = analyze_scalar_evolution (loop, rhs2); 1711 chrec2 = chrec_convert (TREE_TYPE (rhs2), chrec2, at_stmt); 1719 chrec2 = analyze_scalar_evolution (loop, rhs2); 1740 chrec2 = analyze_scalar_evolution (loop, rhs2); 1791 chrec2 = analyze_scalar_evolution (loop, rhs2); 1815 chrec2 = analyze_scalar_evolution (loop, rhs2); 1621 interpret_rhs_expr(class loop *loop, gimple *at_stmt, tree type, tree rhs1, enum tree_code code, tree rhs2) argument [all...] |
H A D | tree-vect-patterns.c | 3748 tree itype, cond_expr, rhs1, rhs2, irhs1, irhs2; local 3754 rhs2 = gimple_assign_rhs2 (stmt); 3810 def_stmt = SSA_NAME_DEF_STMT (rhs2); 3821 rhs2 = gimple_assign_rhs2 (def_stmt); 3826 irhs2 = *defs.get (rhs2); 3833 irhs2 = *defs.get (rhs2); 3840 rhs2 = gimple_assign_rhs2 (def_stmt); 3852 irhs2 = *defs.get (rhs2); 3892 cond_expr = build2_loc (loc, rhs_code, itype, rhs1, rhs2); 4166 tree rhs2 local 4236 tree lhs = NULL_TREE, rhs1, rhs2, tmp, rhs1_type, rhs2_type; local [all...] |
H A D | tree-ssa-threadedge.c | 616 const tree rhs2 = gimple_assign_rhs2 (def_stmt); local 648 rhs2, NE_EXPR, op1, 705 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 713 rhs1, new_cond, rhs2,
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | ccmp.cc | 135 tree *rhs1, tree *rhs2) 145 *rhs2 = gimple_assign_rhs2 (g); 153 *rhs2 = build_zero_cst (TREE_TYPE (t)); 169 tree rhs1, rhs2; local 171 get_compare_parts(op, &unsignedp, &rcode, &rhs1, &rhs2); 173 rhs1, rhs2, get_rtx_code (code, 0)); 134 get_compare_parts(tree t, int *up, rtx_code *rcode, tree *rhs1, tree *rhs2) argument
|
H A D | tree-ssa-math-opts.cc | 2668 tree lhs, rhs1, rhs2, type, type1, type2; local 2681 if (!is_widening_mult_p (stmt, &type1, &rhs1, &type2, &rhs2)) 2754 rhs2 = build_and_insert_cast (gsi, loc, 2756 (actual_precision, from_unsigned2), rhs2); 2761 if (TREE_CODE (rhs2) == INTEGER_CST) 2762 rhs2 = fold_convert (type2, rhs2); 2765 gimple_assign_set_rhs2 (stmt, rhs2); 2785 tree lhs, rhs1, rhs2, mult_rhs1, mult_rhs2, add_rhs; local 2807 rhs2 3535 tree rhs2 = gimple_assign_rhs2 (div_stmt); local 3685 tree rhs2 = gimple_assign_rhs2 (stmt); local 3916 tree rhs2 = gimple_assign_rhs2 (stmt); local [all...] |
H A D | tree-ssa-dom.cc | 181 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 185 value = build_zero_cst (TREE_TYPE (rhs2)); 186 derive_equivalences (rhs2, value, recursion_limit - 1); 195 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 209 if (TREE_CODE (rhs2) == SSA_NAME) 211 if (ssa_name_has_boolean_range (rhs2)) 213 value = build_one_cst (TREE_TYPE (rhs2)); 214 derive_equivalences (rhs2, value, recursion_limit - 1); 245 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 250 && TREE_CODE (rhs2) 270 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 304 tree rhs2 = gimple_assign_rhs2 (def_stmt); local [all...] |
H A D | gimple-ssa-strength-reduction.cc | 729 tree lhs, rhs1, rhs2; 740 rhs2 = gimple_assign_rhs2 (gs); 742 if (tree_fits_shwi_p (rhs2)) 743 return mult_by_coeff_cost (tree_to_shwi (rhs2), lhs_mode, speed); 1240 slsr_process_mul (gimple *gs, tree rhs1, tree rhs2, bool speed) 1248 if (rhs1 == rhs2) 1251 if (TREE_CODE (rhs2) == SSA_NAME) 1255 c = create_mul_ssa_cand (gs, rhs1, rhs2, speed); 1262 c2 = create_mul_ssa_cand (gs, rhs2, rhs1, speed); 1266 else if (TREE_CODE (rhs2) 726 tree lhs, rhs1, rhs2; local 1236 slsr_process_mul(gimple *gs, tree rhs1, tree rhs2, bool speed) argument 1455 slsr_process_add(gimple *gs, tree rhs1, tree rhs2, bool speed) argument 1761 tree rhs1 = NULL_TREE, rhs2 = NULL_TREE; local 2192 tree rhs1, rhs2; local 2741 tree rhs2 = gimple_assign_rhs2 (c->cand_stmt); local 3682 tree rhs2; local [all...] |
H A D | tree-vect-generic.cc | 1254 tree rhs2 = gimple_assign_rhs2 (assign); local 1256 return expand_vector_comparison (gsi, type, rhs1, rhs2, code, 1264 tree rhs2 = gimple_assign_rhs2 (assign); local 1269 || TREE_CODE (rhs2) != VECTOR_CST 1273 ret = expand_vector_divmod (gsi, type, rhs1, rhs2, code); 1790 tree rhs2 = gimple_assign_rhs2 (stmt); 1798 new_rhs = expand_vector_parallel (gsi, do_cond, type, rhs2, rhs3, 1802 rhs2, rhs3, COND_EXPR, false); 2120 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE; 2174 rhs2 1789 tree rhs2 = gimple_assign_rhs2 (stmt); local 2119 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE; local [all...] |
H A D | tree-ssa-reassoc.cc | 691 tree rhs2 = gimple_assign_rhs2 (stmt); local 693 || (rhs2 && !can_reassociate_op_p (rhs2))) 3781 tree rhs1, rhs2; local 3791 rhs2 = gimple_assign_rhs2 (stmt); 3801 rhs2 = gimple_cond_rhs (stmt); 3805 || rhs2 == NULL_TREE 3806 || TREE_CODE (rhs2) != SSA_NAME) 3825 std::swap (rhs1, rhs2); 3841 Make sure rhs2' 5209 find_insert_point(gimple *stmt, tree rhs1, tree rhs2, bool &insert_before) argument 5234 tree rhs2 = gimple_assign_rhs2 (stmt_to_insert); local 5265 tree rhs2 = gimple_assign_rhs2 (stmt); local 5700 tree rhs2 = gimple_assign_rhs2 (negatedefstmt); local 5774 tree rhs2 = gimple_assign_rhs2 (stmt); local 6645 transform_stmt_to_multiply(gimple_stmt_iterator *gsi, gimple *stmt, tree rhs1, tree rhs2) argument 6691 tree lhs, rhs1, rhs2; local [all...] |
H A D | gimple-ssa-backprop.cc | 790 tree rhs2, tree rhs3) 792 if (!rhs1 && !rhs2 && !rhs3) 798 if (rhs2) 799 gimple_assign_set_rhs2 (assign, rhs2); 789 replace_assign_rhs(gassign *assign, tree lhs, tree rhs1, tree rhs2, tree rhs3) argument
|
H A D | tree-ssa-phiopt.cc | 1675 tree lhs, rhs1, rhs2; local 1681 rhs2 = gimple_assign_rhs2 (assign); 1689 rhs2 = NULL_TREE; 1700 && operand_equal_for_phi_arg_p (rhs2, cond_lhs) 1703 && arg1 == rhs2 1708 && ((operand_equal_for_phi_arg_p (rhs2, cond_lhs) 1709 && absorbing_element_p (code_def, cond_rhs, true, rhs2)) 1712 cond_rhs, false, rhs2)))))) 2401 tree rhs2 = gimple_cond_rhs (cond2); local 2404 if (!operand_equal_p (rhs2, rhs [all...] |
H A D | tree-scalar-evolution.cc | 1626 tree type, tree rhs1, enum tree_code code, tree rhs2) 1668 rhs2 = TREE_OPERAND (base, 1); 1672 chrec2 = analyze_scalar_evolution (loop, rhs2); 1674 chrec2 = chrec_convert (TREE_TYPE (rhs2), chrec2, at_stmt); 1709 chrec2 = analyze_scalar_evolution (loop, rhs2); 1711 chrec2 = chrec_convert (TREE_TYPE (rhs2), chrec2, at_stmt); 1719 chrec2 = analyze_scalar_evolution (loop, rhs2); 1740 chrec2 = analyze_scalar_evolution (loop, rhs2); 1791 chrec2 = analyze_scalar_evolution (loop, rhs2); 1815 chrec2 = analyze_scalar_evolution (loop, rhs2); 1621 interpret_rhs_expr(class loop *loop, gimple *at_stmt, tree type, tree rhs1, enum tree_code code, tree rhs2) argument [all...] |
H A D | tree-ssa-threadedge.cc | 515 const tree rhs2 = gimple_assign_rhs2 (def_stmt); local 546 rhs2, NE_EXPR, op1, 602 tree rhs2 = gimple_assign_rhs2 (def_stmt); local 610 rhs1, new_cond, rhs2,
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/config/nios2/ |
H A D | nios2.c | 3636 int lhs, rhs1, rhs2; 3650 for (rhs2 = 0; rhs2 < 4; rhs2++) 3652 if (rhs1 == 0 && rhs2 != 0) 3657 op[rhs1].type, op[rhs2].type, 3660 op[lhs].c, op[rhs1].c, op[rhs2].c); 4560 split_alu_insn (rtx_insn *insn, rtx *lhs, rtx *rhs1, rtx *rhs2) 4567 *rhs2 = XEXP (SET_SRC (pat), 1); 4658 rtx lhs, rtx rhs1, rtx rhs2) 3628 int lhs, rhs1, rhs2; local 4549 split_alu_insn(rtx_insn *insn, rtx *lhs, rtx *rhs1, rtx *rhs2) argument 4646 nios2_add_insn_classify(rtx_insn *insn ATTRIBUTE_UNUSED, rtx lhs, rtx rhs1, rtx rhs2) argument 4714 rtx pat, lhs, rhs1, rhs2; local [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/config/nios2/ |
H A D | nios2.cc | 3632 int lhs, rhs1, rhs2; 3646 for (rhs2 = 0; rhs2 < 4; rhs2++) 3648 if (rhs1 == 0 && rhs2 != 0) 3653 op[rhs1].type, op[rhs2].type, 3657 op[lhs].c, op[rhs1].c, op[rhs2].c); 4595 split_alu_insn (rtx_insn *insn, rtx *lhs, rtx *rhs1, rtx *rhs2) 4602 *rhs2 = XEXP (SET_SRC (pat), 1); 4693 rtx lhs, rtx rhs1, rtx rhs2) 3624 int lhs, rhs1, rhs2; local 4584 split_alu_insn(rtx_insn *insn, rtx *lhs, rtx *rhs1, rtx *rhs2) argument 4681 nios2_add_insn_classify(rtx_insn *insn ATTRIBUTE_UNUSED, rtx lhs, rtx rhs1, rtx rhs2) argument 4749 rtx pat, lhs, rhs1 = NULL_RTX, rhs2 = NULL_RTX; local [all...] |