HomeSort by: relevance | last modified time | path
    Searched defs:rhs1 (Results 1 - 25 of 76) sorted by relevancy

1 2 3 4

  /src/external/gpl3/gcc.old/dist/gcc/
gimple-walk.cc 214 tree rhs1 = gimple_assign_rhs1 (stmt); local
216 = (is_gimple_reg_type (TREE_TYPE (rhs1)) && !is_gimple_reg (rhs1))
814 /* COND_EXPR and VCOND_EXPR rhs1 argument is a comparison
ccmp.cc 135 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));
gimple-ssa-split-paths.cc 235 tree rhs1 = gimple_assign_rhs1 (stmt1); local
242 && gimple_phi_arg_def (phi, 1) == rhs1)
244 && gimple_phi_arg_def (phi, 0) == rhs1))
tree-ssa-loop-ch.cc 521 tree rhs1 = gimple_assign_rhs1 (stmt); local
525 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1))
526 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (rhs1)))
gimple-match-head.cc 954 tree rhs1 = gimple_assign_rhs1 (stmt); local
955 tree op0 = valueize_op (TREE_OPERAND (rhs1, 0));
960 TREE_OPERAND (rhs1, 1),
961 TREE_OPERAND (rhs1, 2),
962 REF_REVERSE_STORAGE_ORDER (rhs1));
974 tree rhs1 = gimple_assign_rhs1 (stmt); local
975 res_op->set_op (code, type, valueize_op (rhs1));
980 tree rhs1 = valueize_op (gimple_assign_rhs1 (stmt)); local
982 res_op->set_op (code, type, rhs1, rhs2);
987 tree rhs1 = gimple_assign_rhs1 (stmt) local
    [all...]
tree-stdarg.cc 138 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, 0), 1))
212 tree rhs1; local
    [all...]
tree-ssa-threadedge.cc 514 const tree rhs1 = gimple_assign_rhs1 (def_stmt); local
520 rhs1, NE_EXPR, op1,
601 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
610 rhs1, new_cond, rhs2,
tree-ssa-coalesce.cc 908 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...]
tree-ssa.cc 1375 tree rhs1, rhs2; local
1377 rhs1 = gimple_assign_rhs1 (def_stmt);
1379 return (TREE_CODE (rhs1) == SSA_NAME && ssa_undefined_value_p (rhs1))
  /src/external/gpl3/gcc/dist/gcc/
ccmp.cc 137 tree *rhs1, tree *rhs2)
146 *rhs1 = gimple_assign_rhs1 (g);
154 *rhs1 = t;
171 tree rhs1, rhs2; local
173 get_compare_parts(op, &unsignedp, &rcode, &rhs1, &rhs2);
175 rhs1, rhs2, get_rtx_code (code, 0));
gimple-ssa-split-paths.cc 235 tree rhs1 = gimple_assign_rhs1 (stmt1); local
242 && gimple_phi_arg_def (phi, 1) == rhs1)
244 && gimple_phi_arg_def (phi, 0) == rhs1))
gimple-walk.cc 224 tree rhs1 = gimple_assign_rhs1 (stmt); local
226 = (is_gimple_reg_type (TREE_TYPE (rhs1)) && !is_gimple_reg (rhs1))
838 /* COND_EXPR and VCOND_EXPR rhs1 argument is a comparison
gimple-match-exports.cc 743 tree rhs1 = gimple_assign_rhs1 (stmt); local
744 tree op0 = valueize_op (TREE_OPERAND (rhs1, 0));
749 TREE_OPERAND (rhs1, 1),
750 TREE_OPERAND (rhs1, 2),
751 REF_REVERSE_STORAGE_ORDER (rhs1));
763 tree rhs1 = gimple_assign_rhs1 (stmt); local
764 res_op->set_op (code, type, valueize_op (rhs1));
769 tree rhs1 = valueize_op (gimple_assign_rhs1 (stmt)); local
771 res_op->set_op (code, type, rhs1, rhs2);
776 tree rhs1 = gimple_assign_rhs1 (stmt) local
    [all...]
tree-ssa-scopedtables.cc 141 tree rhs1 = gimple_assign_rhs1 (stmt); local
143 if (tree_swap_operands_p (rhs1, rhs2))
144 std::swap (rhs1, rhs2);
145 expr.ops.binary.opnd0 = rhs1;
155 return code == MIN_EXPR ? rhs1 : rhs2;
166 return code == MIN_EXPR ? rhs2 : rhs1;
193 tree rhs1 = gimple_assign_rhs1 (stmt); local
195 if (tree_swap_operands_p (rhs1, rhs2))
196 std::swap (rhs1, rhs2);
197 expr.ops.binary.opnd0 = rhs1;
    [all...]
tree-stdarg.cc 138 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, 0), 1))
212 tree rhs1; local
    [all...]
tree-ssa-loop-ch.cc 1026 tree rhs1 = gimple_assign_rhs1 (stmt); local
1030 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1))
1031 && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (rhs1)))
tree-ssa-threadedge.cc 514 const tree rhs1 = gimple_assign_rhs1 (def_stmt); local
520 rhs1, NE_EXPR, op1,
601 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
610 rhs1, new_cond, rhs2,
tree-ssa-coalesce.cc 921 tree rhs1 = gimple_assign_rhs1 (stmt); local
924 && TREE_CODE (rhs1) == SSA_NAME)
925 live_track_clear_var (live, rhs1);
1116 tree rhs1 = gimple_assign_rhs1 (stmt); local
1118 && gimple_can_coalesce_p (lhs, rhs1))
1121 v2 = SSA_NAME_VERSION (rhs1);
1138 tree rhs1 = gimple_return_retval (as_a <greturn *> (stmt)); local
1139 if (!rhs1)
1145 if (TREE_CODE (rhs1) == SSA_NAME
1146 && gimple_can_coalesce_p (lhs, rhs1))
    [all...]
tree-ssa-loop-ivcanon.cc 233 tree rhs1 = gimple_assign_rhs1 (ass); local
236 && rhs1 == gimple_phi_result (phi)
tree-ssa.cc 1371 tree rhs1, rhs2; local
1373 rhs1 = gimple_assign_rhs1 (def_stmt);
1375 return (TREE_CODE (rhs1) == SSA_NAME && ssa_undefined_value_p (rhs1))
ipa-param-manipulation.cc 927 tree rhs1; local
930 && (rhs1
933 TREE_TYPE (rhs1)))
934 arg = rhs1;
tree-scalar-evolution.cc 602 tree rhs1, tree *evolution_of_loop, int limit);
890 /* Follow the ssa edge into the binary expression RHS0 CODE RHS1.
895 enum tree_code code, tree rhs1,
907 if (TREE_CODE (rhs1) == SSA_NAME)
921 (chrec_convert (type, evol, at_stmt), code, rhs1, at_stmt);
925 (at_stmt, rhs1, evolution_of_loop, limit);
937 else if (TREE_CODE (rhs1) == SSA_NAME)
941 res = follow_ssa_edge_expr (at_stmt, rhs1, evolution_of_loop, limit);
956 /* This case is under the form "opnd0 = rhs0 - rhs1". */
1119 tree type, rhs0, rhs1 = NULL_TREE
1117 tree type, rhs0, rhs1 = NULL_TREE; local
    [all...]
tree-ssa-dom.cc 184 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
187 value = build_zero_cst (TREE_TYPE (rhs1));
188 derive_equivalences (rhs1, value, recursion_limit - 1);
198 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
205 if (TREE_CODE (rhs1) == SSA_NAME)
207 if (ssa_name_has_boolean_range (rhs1))
209 value = build_one_cst (TREE_TYPE (rhs1));
210 derive_equivalences (rhs1, value, recursion_limit - 1);
247 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
252 if (TREE_CODE (rhs1) == INTEGER_CS
272 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
306 tree rhs1 = gimple_assign_rhs1 (def_stmt); local
    [all...]
tree-ssa-strlen.cc 2855 tree rhs1 = gimple_assign_rhs1 (lendef); local
2856 tree rhstype = TREE_TYPE (rhs1);
2865 return is_strlen_related_p (src, rhs1);
5275 fold_strstr_to_strncmp (tree rhs1, tree rhs2, gimple *stmt)
5277 if (TREE_CODE (rhs1) != SSA_NAME
5284 gimple *g = SSA_NAME_DEF_STMT (rhs1);
5286 && has_single_use (rhs1)
5292 std::swap (rhs1, rhs2);
5512 tree rhs1 = gimple_assign_rhs1 (stmt);
5515 idx = get_stridx (TREE_OPERAND (rhs1, 0), stmt)
    [all...]
  /src/external/gpl3/gcc/dist/gcc/config/aarch64/
aarch64-sve-builtins-base.cc 413 tree rhs1 = gimple_call_arg (f.call, 1); variable
423 rhs2 = f.force_vector (stmts, TREE_TYPE (rhs1), rhs2);
425 return gimple_build_assign (f.lhs, m_code, rhs1, rhs2);

Completed in 41 milliseconds

1 2 3 4