Searched refs:rhs1 (Results 1 - 25 of 99) sorted by relevance

1234

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dgimple-match-head.c916 tree rhs1 = gimple_assign_rhs1 (stmt); local
917 tree op0 = TREE_OPERAND (rhs1, 0);
921 TREE_OPERAND (rhs1, 1),
922 TREE_OPERAND (rhs1, 2),
923 REF_REVERSE_STORAGE_ORDER (rhs1));
942 tree rhs1 = gimple_assign_rhs1 (stmt); local
944 rhs1 = do_valueize (rhs1, top_valueize, valueized);
945 res_op->set_op (code, type, rhs1);
951 tree rhs1 local
963 tree rhs1 = gimple_assign_rhs1 (stmt); local
[all...]
H A Dccmp.c135 tree *rhs1, tree *rhs2)
144 *rhs1 = gimple_assign_rhs1 (g);
152 *rhs1 = 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 Dtree-stdarg.c138 tree rhs1; local
158 rhs1 = gimple_assign_rhs1 (stmt);
161 && TREE_CODE (rhs1) == SSA_NAME)
163 lhs = rhs1;
169 && TREE_CODE (rhs1) == SSA_NAME
173 lhs = rhs1;
178 && TREE_CODE (TREE_OPERAND (rhs1, 0)) == MEM_REF
179 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (rhs1, 0), 0)) == SSA_NAME
180 && tree_fits_uhwi_p (TREE_OPERAND (TREE_OPERAND (rhs1, 0), 1)))
182 ret += tree_to_uhwi (TREE_OPERAND (TREE_OPERAND (rhs1,
212 tree rhs1; local
[all...]
H A Dtree-scalar-evolution.c889 tree type, tree rhs0, enum tree_code code, tree rhs1,
902 if (TREE_CODE (rhs1) == SSA_NAME)
916 code, rhs1, at_stmt);
928 (loop, at_stmt, rhs1, halting_phi,
937 else if (TREE_CODE (rhs1) == SSA_NAME)
946 (loop, at_stmt, rhs1, halting_phi,
958 /* This case is under the form "opnd0 = rhs0 - rhs1". */
1131 tree type, rhs0, rhs1 = NULL_TREE;
1204 rhs1 = gimple_assign_rhs2 (def);
1229 rhs1
885 follow_ssa_edge_binary(class loop *loop, gimple *at_stmt, tree type, tree rhs0, enum tree_code code, tree rhs1, gphi *halting_phi, tree *evolution_of_loop, int limit) argument
1128 tree type, rhs0, rhs1 = NULL_TREE; local
1621 interpret_rhs_expr(class loop *loop, gimple *at_stmt, tree type, tree rhs1, enum tree_code code, tree rhs2) argument
[all...]
H A Dtree-vect-patterns.c2445 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
2446 if (TYPE_MODE (TREE_TYPE (rhs1)) == mode
2447 && TYPE_PRECISION (TREE_TYPE (rhs1))
2449 def = rhs1;
2608 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
2609 if (TYPE_MODE (TREE_TYPE (rhs1)) == TYPE_MODE (TREE_TYPE (oprnd0))
2610 && TYPE_PRECISION (TREE_TYPE (rhs1))
2614 >= TYPE_PRECISION (TREE_TYPE (rhs1)))
2615 def = rhs1;
2619 = build_low_bits_mask (TREE_TYPE (rhs1),
3630 tree rhs1; local
3748 tree itype, cond_expr, rhs1, rhs2, irhs1, irhs2; local
4236 tree lhs = NULL_TREE, rhs1, rhs2, tmp, rhs1_type, rhs2_type; local
[all...]
H A Dtree-ssa-dom.c180 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
183 value = build_zero_cst (TREE_TYPE (rhs1));
184 derive_equivalences (rhs1, value, recursion_limit - 1);
194 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
201 if (TREE_CODE (rhs1) == SSA_NAME)
203 if (ssa_name_has_boolean_range (rhs1))
205 value = build_one_cst (TREE_TYPE (rhs1));
206 derive_equivalences (rhs1, value, recursion_limit - 1);
244 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
249 if (TREE_CODE (rhs1)
269 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
303 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
[all...]
H A Dtree-ssa-math-opts.c2339 tree type1, rhs1; local
2347 rhs1 = rhs;
2350 rhs1 = gimple_assign_rhs1 (stmt);
2352 if (TREE_CODE (rhs1) == INTEGER_CST)
2354 *new_rhs_out = rhs1;
2361 rhs1 = rhs;
2363 type1 = TREE_TYPE (rhs1);
2369 *new_rhs_out = rhs1;
2530 tree lhs, rhs1, rhs2, type, type1, type2; local
2543 if (!is_widening_mult_p (stmt, &type1, &rhs1,
2638 tree lhs, rhs1, rhs2, mult_rhs1, mult_rhs2, add_rhs; local
3339 tree rhs1 = gimple_assign_rhs1 (stmt); local
3417 tree rhs1 = gimple_assign_rhs1 (stmt); local
[all...]
H A Dgimple-ssa-strength-reduction.c729 tree lhs, rhs1, rhs2;
734 rhs1 = gimple_assign_rhs1 (gs);
745 gcc_assert (TREE_CODE (rhs1) != INTEGER_CST);
757 return convert_cost (lhs_mode, TYPE_MODE (TREE_TYPE (rhs1)), speed);
1241 slsr_process_mul (gimple *gs, tree rhs1, tree rhs2, bool speed)
1249 if (rhs1 == rhs2)
1256 c = create_mul_ssa_cand (gs, rhs1, rhs2, speed);
1263 c2 = create_mul_ssa_cand (gs, rhs2, rhs1, speed);
1270 c = create_mul_imm_cand (gs, rhs1, rhs2, speed);
1460 slsr_process_add (gimple *gs, tree rhs1, tre
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
1514 slsr_process_neg(gimple *gs, tree rhs1, bool speed) argument
1598 slsr_process_cast(gimple *gs, tree rhs1, bool speed) argument
1670 slsr_process_copy(gimple *gs, tree rhs1, bool speed) argument
1762 tree rhs1 = NULL_TREE, rhs2 = NULL_TREE; local
2193 tree rhs1, rhs2; local
2741 tree rhs1 = gimple_assign_rhs1 (c->cand_stmt); local
[all...]
H A Dtree-ssa-reassoc.c619 tree rhs1 = gimple_assign_rhs1 (stmt); local
621 if (TREE_CODE (rhs1) == SSA_NAME
622 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (rhs1))
3474 tree rhs1, rhs2; local
3483 rhs1 = gimple_assign_rhs1 (stmt);
3493 rhs1 = gimple_cond_lhs (stmt);
3497 if (TREE_CODE (rhs1) != SSA_NAME
3518 std::swap (rhs1, rhs2);
3528 int *idx = map->get (rhs1);
3608 tree utype = unsigned_type_for (TREE_TYPE (rhs1));
4815 find_insert_point(gimple *stmt, tree rhs1, tree rhs2, bool &insert_before) argument
4839 tree rhs1 = gimple_assign_rhs1 (stmt_to_insert); local
4869 tree rhs1 = gimple_assign_rhs1 (stmt); local
5304 tree rhs1 = gimple_assign_rhs1 (negatedefstmt); local
5378 tree rhs1 = gimple_assign_rhs1 (stmt); local
5483 tree rhs1 = gimple_assign_rhs1 (def_stmt); variable
5640 tree rhs1 = gimple_assign_rhs1 (user); local
5678 tree rhs1 = gimple_assign_rhs1 (user); local
6204 tree rhs1; 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 Dgimple-ssa-split-paths.c234 tree rhs1 = gimple_assign_rhs1 (stmt1); local
241 && gimple_phi_arg_def (phi, 1) == rhs1)
243 && gimple_phi_arg_def (phi, 0) == rhs1))
H A Dgimple-ssa-store-merging.c343 the byte size of rhs1. The highest order byte is set to n->size and the
451 tree rhs1 = gimple_assign_rhs1 (source_stmt1); local
452 if (TREE_CODE (rhs1) == BIT_FIELD_REF
453 && TREE_CODE (TREE_OPERAND (rhs1, 0)) == SSA_NAME)
454 rhs1 = TREE_OPERAND (rhs1, 0);
462 if (rhs1 != rhs2)
585 tree rhs1, rhs2 = NULL; local
592 rhs1 = gimple_assign_rhs1 (stmt);
594 if (find_bswap_or_nop_load (stmt, rhs1,
4150 tree rhs1 = gimple_assign_rhs1 (info->stmt); local
4669 tree rhs1 = gimple_assign_rhs1 (stmt); local
4771 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
4786 tree rhs1, rhs2; local
4860 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
[all...]
H A Dtree-ssa-coalesce.c908 tree rhs1 = gimple_assign_rhs1 (stmt); local
911 && TREE_CODE (rhs1) == SSA_NAME)
912 live_track_clear_var (live, rhs1);
1103 tree rhs1 = gimple_assign_rhs1 (stmt); local
1105 && gimple_can_coalesce_p (lhs, rhs1))
1108 v2 = SSA_NAME_VERSION (rhs1);
1123 tree rhs1 = gimple_return_retval (as_a <greturn *> (stmt)); local
1124 if (!rhs1)
1128 if (TREE_CODE (rhs1) == SSA_NAME
1129 && gimple_can_coalesce_p (lhs, rhs1))
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dccmp.cc135 tree *rhs1, tree *rhs2)
144 *rhs1 = gimple_assign_rhs1 (g);
152 *rhs1 = 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 Dtree-stdarg.cc138 tree rhs1; local
158 rhs1 = gimple_assign_rhs1 (stmt);
161 && TREE_CODE (rhs1) == SSA_NAME)
163 lhs = rhs1;
169 && TREE_CODE (rhs1) == SSA_NAME
173 lhs = rhs1;
178 && TREE_CODE (TREE_OPERAND (rhs1, 0)) == MEM_REF
179 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (rhs1, 0), 0)) == SSA_NAME
180 && tree_fits_uhwi_p (TREE_OPERAND (TREE_OPERAND (rhs1, 0), 1)))
182 ret += tree_to_uhwi (TREE_OPERAND (TREE_OPERAND (rhs1,
212 tree rhs1; local
[all...]
H A Dtree-scalar-evolution.cc889 tree type, tree rhs0, enum tree_code code, tree rhs1,
902 if (TREE_CODE (rhs1) == SSA_NAME)
916 code, rhs1, at_stmt);
928 (loop, at_stmt, rhs1, halting_phi,
937 else if (TREE_CODE (rhs1) == SSA_NAME)
946 (loop, at_stmt, rhs1, halting_phi,
958 /* This case is under the form "opnd0 = rhs0 - rhs1". */
1131 tree type, rhs0, rhs1 = NULL_TREE;
1204 rhs1 = gimple_assign_rhs2 (def);
1229 rhs1
885 follow_ssa_edge_binary(class loop *loop, gimple *at_stmt, tree type, tree rhs0, enum tree_code code, tree rhs1, gphi *halting_phi, tree *evolution_of_loop, int limit) argument
1128 tree type, rhs0, rhs1 = NULL_TREE; local
1621 interpret_rhs_expr(class loop *loop, gimple *at_stmt, tree type, tree rhs1, enum tree_code code, tree rhs2) argument
[all...]
H A Dtree-ssa-dom.cc180 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
183 value = build_zero_cst (TREE_TYPE (rhs1));
184 derive_equivalences (rhs1, value, recursion_limit - 1);
194 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
201 if (TREE_CODE (rhs1) == SSA_NAME)
203 if (ssa_name_has_boolean_range (rhs1))
205 value = build_one_cst (TREE_TYPE (rhs1));
206 derive_equivalences (rhs1, value, recursion_limit - 1);
244 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
249 if (TREE_CODE (rhs1)
269 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
303 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
[all...]
H A Dtree-ssa-math-opts.cc2477 tree type1, rhs1; local
2485 rhs1 = rhs;
2488 rhs1 = gimple_assign_rhs1 (stmt);
2490 if (TREE_CODE (rhs1) == INTEGER_CST)
2492 *new_rhs_out = rhs1;
2499 rhs1 = rhs;
2501 type1 = TREE_TYPE (rhs1);
2507 *new_rhs_out = rhs1;
2668 tree lhs, rhs1, rhs2, type, type1, type2; local
2681 if (!is_widening_mult_p (stmt, &type1, &rhs1,
2785 tree lhs, rhs1, rhs2, mult_rhs1, mult_rhs2, add_rhs; local
3684 tree rhs1 = gimple_assign_rhs1 (stmt); local
[all...]
H A Dgimple-match-head.cc949 tree rhs1 = gimple_assign_rhs1 (stmt); local
950 tree op0 = valueize_op (TREE_OPERAND (rhs1, 0));
952 TREE_OPERAND (rhs1, 1),
953 TREE_OPERAND (rhs1, 2),
954 REF_REVERSE_STORAGE_ORDER (rhs1));
966 tree rhs1 = gimple_assign_rhs1 (stmt); local
967 res_op->set_op (code, type, valueize_op (rhs1));
972 tree rhs1 = valueize_op (gimple_assign_rhs1 (stmt)); local
974 res_op->set_op (code, type, rhs1, rhs2);
979 tree rhs1 local
[all...]
H A Dtree-vect-patterns.cc2800 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
2801 if (TYPE_MODE (TREE_TYPE (rhs1)) == mode
2802 && TYPE_PRECISION (TREE_TYPE (rhs1))
2804 def = rhs1;
2963 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
2964 if (TYPE_MODE (TREE_TYPE (rhs1)) == TYPE_MODE (TREE_TYPE (oprnd0))
2965 && TYPE_PRECISION (TREE_TYPE (rhs1))
2969 >= TYPE_PRECISION (TREE_TYPE (rhs1)))
2970 def = rhs1;
2974 = build_low_bits_mask (TREE_TYPE (rhs1),
3988 tree rhs1; local
4105 tree itype, cond_expr, rhs1, rhs2, irhs1, irhs2; local
4599 tree lhs = NULL_TREE, rhs1, rhs2, tmp, rhs1_type, rhs2_type; local
[all...]
H A Dgimple-ssa-strength-reduction.cc729 tree lhs, rhs1, rhs2;
734 rhs1 = gimple_assign_rhs1 (gs);
745 gcc_assert (TREE_CODE (rhs1) != INTEGER_CST);
757 return convert_cost (lhs_mode, TYPE_MODE (TREE_TYPE (rhs1)), speed);
1240 slsr_process_mul (gimple *gs, tree rhs1, tree rhs2, bool speed)
1248 if (rhs1 == rhs2)
1255 c = create_mul_ssa_cand (gs, rhs1, rhs2, speed);
1262 c2 = create_mul_ssa_cand (gs, rhs2, rhs1, speed);
1269 c = create_mul_imm_cand (gs, rhs1, rhs2, speed);
1459 slsr_process_add (gimple *gs, tree rhs1, tre
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
1513 slsr_process_neg(gimple *gs, tree rhs1, bool speed) argument
1597 slsr_process_cast(gimple *gs, tree rhs1, bool speed) argument
1669 slsr_process_copy(gimple *gs, tree rhs1, bool speed) argument
1761 tree rhs1 = NULL_TREE, rhs2 = NULL_TREE; local
2192 tree rhs1, rhs2; local
2740 tree rhs1 = gimple_assign_rhs1 (c->cand_stmt); local
[all...]
H A Dgimple-ssa-split-paths.cc235 tree rhs1 = gimple_assign_rhs1 (stmt1); local
242 && gimple_phi_arg_def (phi, 1) == rhs1)
244 && gimple_phi_arg_def (phi, 0) == rhs1))
H A Dtree-ssa-coalesce.cc908 tree rhs1 = gimple_assign_rhs1 (stmt); local
911 && TREE_CODE (rhs1) == SSA_NAME)
912 live_track_clear_var (live, rhs1);
1103 tree rhs1 = gimple_assign_rhs1 (stmt); local
1105 && gimple_can_coalesce_p (lhs, rhs1))
1108 v2 = SSA_NAME_VERSION (rhs1);
1123 tree rhs1 = gimple_return_retval (as_a <greturn *> (stmt)); local
1124 if (!rhs1)
1128 if (TREE_CODE (rhs1) == SSA_NAME
1129 && gimple_can_coalesce_p (lhs, rhs1))
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/c-family/
H A Dc-omp.cc219 tree v, tree lhs1, tree rhs1, tree r, bool swapped,
229 || rhs1 == error_mark_node || r == error_mark_node)
330 std::swap (rhs, rhs1);
331 rhs1 = build_binary_op (loc, EQ_EXPR, lhs, rhs1, true);
344 std::swap (rhs, rhs1);
345 rhs1 = build_binary_op (loc, EQ_EXPR, lhs, rhs1, true);
380 if (error_operand_p (rhs1))
382 gcc_assert (TREE_CODE (rhs1)
217 c_finish_omp_atomic(location_t loc, enum tree_code code, enum tree_code opcode, tree lhs, tree rhs, tree v, tree lhs1, tree rhs1, tree r, bool swapped, enum omp_memory_order memory_order, bool weak, bool test) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/gcc/config/nios2/
H A Dnios2.c3636 int lhs, rhs1, rhs2;
3649 for (rhs1 = 0; rhs1 < 4; rhs1++)
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)
4565 *rhs1 = XEXP (SET_SRC (pat), 0);
4658 rtx lhs, rtx rhs1, rt
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 Dnios2.cc3632 int lhs, rhs1, rhs2;
3645 for (rhs1 = 0; rhs1 < 4; rhs1++)
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)
4600 *rhs1 = XEXP (SET_SRC (pat), 0);
4693 rtx lhs, rtx rhs1, rt
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...]

Completed in 357 milliseconds

1234