| /src/external/gpl3/gcc/dist/gcc/ |
| ccmp.cc | 137 tree *rhs1, tree *rhs2)
147 *rhs2 = gimple_assign_rhs2 (g);
155 *rhs2 = build_zero_cst (TREE_TYPE (t));
171 tree rhs1, rhs2; local
173 get_compare_parts(op, &unsignedp, &rcode, &rhs1, &rhs2);
175 rhs1, rhs2, get_rtx_code (code, 0));
|
| gimple-match-exports.cc | 770 tree rhs2 = valueize_op (gimple_assign_rhs2 (stmt)); local
771 res_op->set_op (code, type, rhs1, rhs2);
781 tree rhs2 = valueize_op (gimple_assign_rhs2 (stmt)); local
783 res_op->set_op (code, type, rhs1, rhs2, rhs3);
|
| tree-ssa-scopedtables.cc | 142 tree rhs2 = gimple_assign_rhs2 (stmt); local
143 if (tree_swap_operands_p (rhs1, rhs2))
144 std::swap (rhs1, rhs2);
146 expr.ops.binary.opnd1 = rhs2;
155 return code == MIN_EXPR ? rhs1 : rhs2;
166 return code == MIN_EXPR ? rhs2 : rhs1;
194 tree rhs2 = gimple_assign_rhs2 (stmt); local
195 if (tree_swap_operands_p (rhs1, rhs2))
196 std::swap (rhs1, rhs2);
198 expr.ops.binary.opnd1 = rhs2;
[all...] |
| gimple-range-gori.cc | 1487 tree rhs2 = gimple_assign_rhs2 (cond_def); local
1489 Value_Range cr (TREE_TYPE (rhs2));
1491 src.get_operand (cr, rhs2);
|
| 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,
|
| tree-ssa.cc | 1371 tree rhs1, rhs2; local
1374 rhs2 = gimple_assign_rhs2 (def_stmt);
1376 || (TREE_CODE (rhs2) == SSA_NAME && ssa_undefined_value_p (rhs2));
|
| tree-ssa-dom.cc | 185 tree rhs2 = gimple_assign_rhs2 (def_stmt); local
189 value = build_zero_cst (TREE_TYPE (rhs2));
190 derive_equivalences (rhs2, value, recursion_limit - 1);
199 tree rhs2 = gimple_assign_rhs2 (def_stmt); local
213 if (TREE_CODE (rhs2) == SSA_NAME)
215 if (ssa_name_has_boolean_range (rhs2))
217 value = build_one_cst (TREE_TYPE (rhs2));
218 derive_equivalences (rhs2, value, recursion_limit - 1);
248 tree rhs2 = gimple_assign_rhs2 (def_stmt); local
253 && TREE_CODE (rhs2) == SSA_NAME
273 tree rhs2 = gimple_assign_rhs2 (def_stmt); local
307 tree rhs2 = gimple_assign_rhs2 (def_stmt); local
[all...] |
| tree-vect-generic.cc | 1229 tree rhs2 = gimple_assign_rhs2 (assign); local
1231 return expand_vector_comparison (gsi, type, rhs1, rhs2, code,
1239 tree rhs2 = gimple_assign_rhs2 (assign); local
1244 || TREE_CODE (rhs2) != VECTOR_CST
1248 ret = expand_vector_divmod (gsi, type, rhs1, rhs2, code);
1775 tree rhs2 = gimple_assign_rhs2 (stmt);
1783 new_rhs = expand_vector_parallel (gsi, do_cond, type, rhs2, rhs3,
1787 rhs2, rhs3, COND_EXPR, false);
1794 return a tree_code, RHS1 and RHS2 instead of a tree. */
2104 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE
1774 tree rhs2 = gimple_assign_rhs2 (stmt); local
2103 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE; local
[all...] |
| vr-values.cc | 1863 tree rhs2 = gimple_assign_rhs2 (stmt); local
1884 && TREE_CODE (rhs2) == SSA_NAME)
1885 || (TREE_CODE (rhs2) == INTEGER_CST
1895 if (TREE_CODE (rhs2) == SSA_NAME
1896 && two_valued_val_range_p (rhs2, &val1, &val2, stmt))
1901 cmp_var = rhs2;
1906 /* Optimize [VAL1, VAL2] OP RHS2. */
1907 new_rhs1 = int_const_binop (rhs_code, val1, rhs2);
1908 new_rhs2 = int_const_binop (rhs_code, val2, rhs2);
|
| gimple-ssa-strength-reduction.cc | 730 tree lhs, rhs1, rhs2;
741 rhs2 = gimple_assign_rhs2 (gs);
743 if (tree_fits_shwi_p (rhs2))
744 return mult_by_coeff_cost (tree_to_shwi (rhs2), lhs_mode, speed);
1242 slsr_process_mul (gimple *gs, tree rhs1, tree rhs2, bool speed)
1250 if (rhs1 == rhs2)
1253 if (TREE_CODE (rhs2) == SSA_NAME)
1256 assuming RHS1 is the base expression and RHS2 is the stride. */
1257 c = create_mul_ssa_cand (gs, rhs1, rhs2, speed);
1263 is the stride and RHS2 is the base expression. *
727 tree lhs, rhs1, rhs2; local
1763 tree rhs1 = NULL_TREE, rhs2 = NULL_TREE; local
2194 tree rhs1, rhs2; local
2743 tree rhs2 = gimple_assign_rhs2 (c->cand_stmt); local
3684 tree rhs2; local
[all...] |
| tree-ssa-ccp.cc | 2034 the values RHS1 and RHS2 yielding type TYPE. */
2037 bit_value_binop (enum tree_code code, tree type, tree rhs1, tree rhs2)
2040 ccp_prop_value_t r2val = get_value_for_expr (rhs2, true);
2060 TYPE_PRECISION (TREE_TYPE (rhs2))) == -1);
2064 TYPE_SIGN (TREE_TYPE (rhs2)), TYPE_PRECISION (TREE_TYPE (rhs2)),
2068 if (code == MULT_EXPR && rhs1 == rhs2 && TYPE_PRECISION (type) > 1)
2350 tree rhs2 = gimple_cond_rhs (stmt); local
2353 val = bit_value_binop (code, TREE_TYPE (rhs1), rhs1, rhs2);
|
| tree-ssa-forwprop.cc | 493 tree rhs2 = gimple_assign_rhs2 (stmt); local
498 type, rhs1, rhs2);
507 if (TREE_CODE (rhs2) == SSA_NAME)
508 cfg_changed |= remove_prop_source_from_use (rhs2);
527 tree rhs2 = gimple_cond_rhs (stmt); local
535 rhs1, rhs2);
553 if (TREE_CODE (rhs2) == SSA_NAME)
554 cfg_changed |= remove_prop_source_from_use (rhs2);
563 && integer_zerop (rhs2))
565 && integer_onep (rhs2))))
607 tree lhs, rhs, rhs2, array_ref; local
3761 tree rhs2; local
[all...] |
| tree-ssa-loop-niter.cc | 3504 tree rhs2 = gimple_assign_rhs2 (stmt); local
3507 else if (TREE_CODE (rhs2) == SSA_NAME)
3508 rhs2 = get_val_for (rhs2, base);
3512 TREE_TYPE (gimple_assign_lhs (stmt)), rhs1, rhs2);
|
| tree-ssa-phiopt.cc | 1594 tree lhs, rhs1, rhs2; local
1600 rhs2 = gimple_assign_rhs2 (assign);
1608 rhs2 = NULL_TREE;
1619 && operand_equal_for_phi_arg_p (rhs2, cond_lhs)
1622 && arg1 == rhs2
1627 && ((operand_equal_for_phi_arg_p (rhs2, cond_lhs)
1628 && absorbing_element_p (code_def, cond_rhs, true, rhs2))
1631 cond_rhs, false, rhs2))))))
2538 tree rhs2 = gimple_cond_rhs (cond2); local
2541 if (!operand_equal_p (rhs2, rhs1, 0)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| 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));
|
| gimple-match-head.cc | 981 tree rhs2 = valueize_op (gimple_assign_rhs2 (stmt)); local
982 res_op->set_op (code, type, rhs1, rhs2);
992 tree rhs2 = valueize_op (gimple_assign_rhs2 (stmt)); local
994 res_op->set_op (code, type, rhs1, rhs2, rhs3);
|
| 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,
|
| tree-ssa.cc | 1375 tree rhs1, rhs2; local
1378 rhs2 = gimple_assign_rhs2 (def_stmt);
1380 || (TREE_CODE (rhs2) == SSA_NAME && ssa_undefined_value_p (rhs2));
|
| 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) == SSA_NAME
270 tree rhs2 = gimple_assign_rhs2 (def_stmt); local
304 tree rhs2 = gimple_assign_rhs2 (def_stmt); local
[all...] |
| tree-ssa-phiopt.cc | 112 *p = RHS2;
121 condtmp = PHI <RHS1, RHS2>
1690 tree lhs, rhs1, rhs2; local
1696 rhs2 = gimple_assign_rhs2 (assign);
1704 rhs2 = NULL_TREE;
1715 && operand_equal_for_phi_arg_p (rhs2, cond_lhs)
1718 && arg1 == rhs2
1723 && ((operand_equal_for_phi_arg_p (rhs2, cond_lhs)
1724 && absorbing_element_p (code_def, cond_rhs, true, rhs2))
1727 cond_rhs, false, rhs2))))))
2420 tree rhs2 = gimple_cond_rhs (cond2); local
[all...] |
| tree-vect-generic.cc | 1262 tree rhs2 = gimple_assign_rhs2 (assign); local
1264 return expand_vector_comparison (gsi, type, rhs1, rhs2, code,
1272 tree rhs2 = gimple_assign_rhs2 (assign); local
1277 || TREE_CODE (rhs2) != VECTOR_CST
1281 ret = expand_vector_divmod (gsi, type, rhs1, rhs2, code);
1803 tree rhs2 = gimple_assign_rhs2 (stmt);
1811 new_rhs = expand_vector_parallel (gsi, do_cond, type, rhs2, rhs3,
1815 rhs2, rhs3, COND_EXPR, false);
1822 return a tree_code, RHS1 and RHS2 instead of a tree. */
2132 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE
1802 tree rhs2 = gimple_assign_rhs2 (stmt); local
2131 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE; local
[all...] |
| gimple-ssa-strength-reduction.cc | 730 tree lhs, rhs1, rhs2;
741 rhs2 = gimple_assign_rhs2 (gs);
743 if (tree_fits_shwi_p (rhs2))
744 return mult_by_coeff_cost (tree_to_shwi (rhs2), lhs_mode, speed);
1242 slsr_process_mul (gimple *gs, tree rhs1, tree rhs2, bool speed)
1250 if (rhs1 == rhs2)
1253 if (TREE_CODE (rhs2) == SSA_NAME)
1256 assuming RHS1 is the base expression and RHS2 is the stride. */
1257 c = create_mul_ssa_cand (gs, rhs1, rhs2, speed);
1263 is the stride and RHS2 is the base expression. *
727 tree lhs, rhs1, rhs2; local
1763 tree rhs1 = NULL_TREE, rhs2 = NULL_TREE; local
2194 tree rhs1, rhs2; local
2743 tree rhs2 = gimple_assign_rhs2 (c->cand_stmt); local
3684 tree rhs2; local
[all...] |
| tree-ssa-ccp.cc | 2016 the values RHS1 and RHS2 yielding type TYPE. */
2019 bit_value_binop (enum tree_code code, tree type, tree rhs1, tree rhs2)
2022 ccp_prop_value_t r2val = get_value_for_expr (rhs2, true);
2042 TYPE_PRECISION (TREE_TYPE (rhs2))) == -1);
2046 TYPE_SIGN (TREE_TYPE (rhs2)), TYPE_PRECISION (TREE_TYPE (rhs2)),
2050 if (code == MULT_EXPR && rhs1 == rhs2 && TYPE_PRECISION (type) > 1)
2332 tree rhs2 = gimple_cond_rhs (stmt); local
2335 val = bit_value_binop (code, TREE_TYPE (rhs1), rhs1, rhs2);
|
| /src/external/gpl3/gcc/dist/gcc/config/aarch64/ |
| aarch64-sve-builtins-base.cc | 414 tree rhs2 = gimple_call_arg (f.call, 2); variable
423 rhs2 = f.force_vector (stmts, TREE_TYPE (rhs1), rhs2);
425 return gimple_build_assign (f.lhs, m_code, rhs1, rhs2);
|
| /src/external/gpl3/gcc.old/dist/gcc/config/aarch64/ |
| aarch64-sve-builtins-base.cc | 391 tree rhs2 = gimple_call_arg (f.call, 2); variable
400 rhs2 = f.force_vector (stmts, TREE_TYPE (rhs1), rhs2);
402 return gimple_build_assign (f.lhs, m_code, rhs1, rhs2);
|
