Lines Matching defs:dest
90 void PhiResolver::emit_move(LIR_Opr src, LIR_Opr dest) {
92 assert(dest->is_valid(), "");
93 __ move(src, dest);
97 void PhiResolver::move_temp_to(LIR_Opr dest) {
99 emit_move(_temp, dest);
118 void PhiResolver::move(ResolveNode* src, ResolveNode* dest) {
119 if (!dest->visited()) {
120 dest->set_visited();
121 for (int i = dest->no_of_destinations()-1; i >= 0; i --) {
122 move(dest, dest->destination_at(i));
124 } else if (!dest->start_node()) {
127 _loop = dest;
130 } // else dest is a start node
132 if (!dest->assigned()) {
133 if (_loop == dest) {
134 move_temp_to(dest->operand());
135 dest->set_assigned();
137 emit_move(src->operand(), dest->operand());
138 dest->set_assigned();
191 void PhiResolver::move(LIR_Opr src, LIR_Opr dest) {
192 assert(dest->is_virtual(), "");
193 // tty->print("move "); src->print(); tty->print(" to "); dest->print(); tty->cr();
195 assert(dest->is_valid(), "");
197 source->append(destination_node(dest));
891 // src and dest positions are the same, or dst is zero so assume
2378 BlockBegin* dest = one_range->sux();
2381 __ branch(lir_cond_equal, T_INT, dest);
2384 __ branch(lir_cond_equal, T_INT, dest);
2386 __ branch(lir_cond_equal, T_INT, dest);
2392 __ branch(lir_cond_lessEqual, T_INT, dest);
2593 LIR_Opr dest = new_register(t);
2594 __ move(src, dest);
2603 local->set_operand(dest);
2604 _instruction_for_operand.at_put_grow(dest->vreg_number(), local, NULL);