14e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray/* 24e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * Copyright (C) 2014 The Android Open Source Project 34e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * 44e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * Licensed under the Apache License, Version 2.0 (the "License"); 54e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * you may not use this file except in compliance with the License. 64e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * You may obtain a copy of the License at 74e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * 84e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * http://www.apache.org/licenses/LICENSE-2.0 94e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * 104e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * Unless required by applicable law or agreed to in writing, software 114e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * distributed under the License is distributed on an "AS IS" BASIS, 124e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 134e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * See the License for the specific language governing permissions and 144e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray * limitations under the License. 154e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray */ 164e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 174e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray#include "parallel_move_resolver.h" 184e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray#include "nodes.h" 194e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray#include "locations.h" 204e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 214e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffraynamespace art { 224e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 234e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffrayvoid ParallelMoveResolver::EmitNativeCode(HParallelMove* parallel_move) { 244e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray DCHECK(moves_.IsEmpty()); 254e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // Build up a worklist of moves. 264e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray BuildInitialMoveList(parallel_move); 274e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 284e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray for (size_t i = 0; i < moves_.Size(); ++i) { 294e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray const MoveOperands& move = *moves_.Get(i); 304e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // Skip constants to perform them last. They don't block other moves 314e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // and skipping such moves with register destinations keeps those 324e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // registers free for the whole algorithm. 334e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray if (!move.IsEliminated() && !move.GetSource().IsConstant()) { 344e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray PerformMove(i); 354e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 364e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 374e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 384e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // Perform the moves with constant sources. 394e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray for (size_t i = 0; i < moves_.Size(); ++i) { 404e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray const MoveOperands& move = *moves_.Get(i); 414e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray if (!move.IsEliminated()) { 424e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray DCHECK(move.GetSource().IsConstant()); 434e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray EmitMove(i); 444e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 454e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 464e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 474e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray moves_.Reset(); 484e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray} 494e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 504e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 514e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffrayvoid ParallelMoveResolver::BuildInitialMoveList(HParallelMove* parallel_move) { 524e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // Perform a linear sweep of the moves to add them to the initial list of 534e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // moves to perform, ignoring any move that is redundant (the source is 544e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // the same as the destination, the destination is ignored and 554e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // unallocated, or the move was already eliminated). 564e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray for (size_t i = 0; i < parallel_move->NumMoves(); ++i) { 574e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray MoveOperands* move = parallel_move->MoveOperandsAt(i); 584e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray if (!move->IsRedundant()) { 594e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray moves_.Add(move); 604e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 614e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 624e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray} 634e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 644e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 654e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffrayvoid ParallelMoveResolver::PerformMove(size_t index) { 664e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // Each call to this function performs a move and deletes it from the move 674e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // graph. We first recursively perform any move blocking this one. We 684e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // mark a move as "pending" on entry to PerformMove in order to detect 694e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // cycles in the move graph. We use operand swaps to resolve cycles, 704e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // which means that a call to PerformMove could change any source operand 714e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // in the move graph. 724e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 734e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray DCHECK(!moves_.Get(index)->IsPending()); 744e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray DCHECK(!moves_.Get(index)->IsRedundant()); 754e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 764e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // Clear this move's destination to indicate a pending move. The actual 774e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // destination is saved in a stack-allocated local. Recursion may allow 784e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // multiple moves to be pending. 794e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray DCHECK(!moves_.Get(index)->GetSource().IsInvalid()); 804e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray Location destination = moves_.Get(index)->MarkPending(); 814e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 824e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // Perform a depth-first traversal of the move graph to resolve 834e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // dependencies. Any unperformed, unpending move with a source the same 844e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // as this one's destination blocks this one so recursively perform all 854e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // such moves. 864e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray for (size_t i = 0; i < moves_.Size(); ++i) { 874e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray const MoveOperands& other_move = *moves_.Get(i); 884e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray if (other_move.Blocks(destination) && !other_move.IsPending()) { 894e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // Though PerformMove can change any source operand in the move graph, 904e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // this call cannot create a blocking move via a swap (this loop does 914e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // not miss any). Assume there is a non-blocking move with source A 924e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // and this move is blocked on source B and there is a swap of A and 934e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // B. Then A and B must be involved in the same cycle (or they would 944e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // not be swapped). Since this move's destination is B and there is 954e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // only a single incoming edge to an operand, this move must also be 964e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // involved in the same cycle. In that case, the blocking move will 974e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // be created but will be "pending" when we return from PerformMove. 984e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray PerformMove(i); 994e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 1004e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 1014e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray MoveOperands* move = moves_.Get(index); 1024e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 1034e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // We are about to resolve this move and don't need it marked as 1044e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // pending, so restore its destination. 1054e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray move->ClearPending(destination); 1064e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 1074e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // This move's source may have changed due to swaps to resolve cycles and 1084e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // so it may now be the last move in the cycle. If so remove it. 1094e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray if (move->GetSource().Equals(destination)) { 1104e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray move->Eliminate(); 1114e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray return; 1124e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 1134e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 1144e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // The move may be blocked on a (at most one) pending move, in which case 1154e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // we have a cycle. Search for such a blocking move and perform a swap to 1164e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // resolve it. 1174e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray bool do_swap = false; 1184e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray for (size_t i = 0; i < moves_.Size(); ++i) { 1194e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray const MoveOperands& other_move = *moves_.Get(i); 1204e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray if (other_move.Blocks(destination)) { 1214e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray DCHECK(other_move.IsPending()); 1224e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray do_swap = true; 1234e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray break; 1244e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 1254e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 1264e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 1274e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray if (do_swap) { 1284e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray EmitSwap(index); 1294e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // Any unperformed (including pending) move with a source of either 1304e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // this move's source or destination needs to have their source 1314e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // changed to reflect the state of affairs after the swap. 1324e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray Location source = move->GetSource(); 1334e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray Location destination = move->GetDestination(); 1344e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray move->Eliminate(); 1354e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray for (size_t i = 0; i < moves_.Size(); ++i) { 1364e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray const MoveOperands& other_move = *moves_.Get(i); 1374e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray if (other_move.Blocks(source)) { 1384e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray moves_.Get(i)->SetSource(destination); 1394e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } else if (other_move.Blocks(destination)) { 1404e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray moves_.Get(i)->SetSource(source); 1414e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 1424e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 1434e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } else { 1444e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray // This move is not blocked. 1454e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray EmitMove(index); 1464e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray move->Eliminate(); 1474e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray } 1484e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray} 1494e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray 15086dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffraybool ParallelMoveResolver::IsScratchLocation(Location loc) { 15186dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray for (size_t i = 0; i < moves_.Size(); ++i) { 15286dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray if (moves_.Get(i)->Blocks(loc)) { 15386dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray return false; 15486dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } 15586dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } 15686dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 15786dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray for (size_t i = 0; i < moves_.Size(); ++i) { 15886dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray if (moves_.Get(i)->GetDestination().Equals(loc)) { 15986dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray return true; 16086dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } 16186dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } 16286dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 16386dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray return false; 16486dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray} 16586dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 166e27f31a81636ad74bd3376ee39cf215941b85c0eNicolas Geoffrayint ParallelMoveResolver::AllocateScratchRegister(int blocked, 167e27f31a81636ad74bd3376ee39cf215941b85c0eNicolas Geoffray int register_count, 168e27f31a81636ad74bd3376ee39cf215941b85c0eNicolas Geoffray int if_scratch, 169e27f31a81636ad74bd3376ee39cf215941b85c0eNicolas Geoffray bool* spilled) { 170e27f31a81636ad74bd3376ee39cf215941b85c0eNicolas Geoffray DCHECK_NE(blocked, if_scratch); 17186dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray int scratch = -1; 17286dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray for (int reg = 0; reg < register_count; ++reg) { 17386dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray if ((blocked != reg) && 17486dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray IsScratchLocation(Location::RegisterLocation(ManagedRegister(reg)))) { 17586dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray scratch = reg; 17686dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray break; 17786dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } 17886dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } 17986dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 18086dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray if (scratch == -1) { 18186dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray *spilled = true; 182e27f31a81636ad74bd3376ee39cf215941b85c0eNicolas Geoffray scratch = if_scratch; 18386dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } else { 18486dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray *spilled = false; 18586dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } 18686dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 18786dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray return scratch; 18886dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray} 18986dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 19086dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 19186dbb9a12119273039ce272b41c809fa548b37b6Nicolas GeoffrayParallelMoveResolver::ScratchRegisterScope::ScratchRegisterScope( 192e27f31a81636ad74bd3376ee39cf215941b85c0eNicolas Geoffray ParallelMoveResolver* resolver, int blocked, int if_scratch, int number_of_registers) 19386dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray : resolver_(resolver), 19486dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray reg_(kNoRegister), 19586dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray spilled_(false) { 196e27f31a81636ad74bd3376ee39cf215941b85c0eNicolas Geoffray reg_ = resolver_->AllocateScratchRegister(blocked, number_of_registers, if_scratch, &spilled_); 19786dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 19886dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray if (spilled_) { 19986dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray resolver->SpillScratch(reg_); 20086dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } 20186dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray} 20286dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 20386dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 20486dbb9a12119273039ce272b41c809fa548b37b6Nicolas GeoffrayParallelMoveResolver::ScratchRegisterScope::~ScratchRegisterScope() { 20586dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray if (spilled_) { 20686dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray resolver_->RestoreScratch(reg_); 20786dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray } 20886dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray} 20986dbb9a12119273039ce272b41c809fa548b37b6Nicolas Geoffray 2104e3d23aa1523718ea1fdf3a32516d2f9d81e84feNicolas Geoffray} // namespace art 211