1 // Copyright 2008 the V8 project authors. All rights reserved. 2 // Redistribution and use in source and binary forms, with or without 3 // modification, are permitted provided that the following conditions are 4 // met: 5 // 6 // * Redistributions of source code must retain the above copyright 7 // notice, this list of conditions and the following disclaimer. 8 // * Redistributions in binary form must reproduce the above 9 // copyright notice, this list of conditions and the following 10 // disclaimer in the documentation and/or other materials provided 11 // with the distribution. 12 // * Neither the name of Google Inc. nor the names of its 13 // contributors may be used to endorse or promote products derived 14 // from this software without specific prior written permission. 15 // 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 28 #include "v8.h" 29 30 #include "codegen-inl.h" 31 #include "register-allocator-inl.h" 32 33 namespace v8 { 34 namespace internal { 35 36 // ------------------------------------------------------------------------- 37 // Result implementation. 38 39 void Result::ToRegister() { 40 ASSERT(is_valid()); 41 if (is_constant()) { 42 Result fresh = CodeGeneratorScope::Current()->allocator()->Allocate(); 43 ASSERT(fresh.is_valid()); 44 if (CodeGeneratorScope::Current()->IsUnsafeSmi(handle())) { 45 CodeGeneratorScope::Current()->MoveUnsafeSmi(fresh.reg(), handle()); 46 } else { 47 CodeGeneratorScope::Current()->masm()->Set(fresh.reg(), 48 Immediate(handle())); 49 } 50 // This result becomes a copy of the fresh one. 51 *this = fresh; 52 } 53 ASSERT(is_register()); 54 } 55 56 57 void Result::ToRegister(Register target) { 58 ASSERT(is_valid()); 59 if (!is_register() || !reg().is(target)) { 60 Result fresh = CodeGeneratorScope::Current()->allocator()->Allocate(target); 61 ASSERT(fresh.is_valid()); 62 if (is_register()) { 63 CodeGeneratorScope::Current()->masm()->mov(fresh.reg(), reg()); 64 } else { 65 ASSERT(is_constant()); 66 if (CodeGeneratorScope::Current()->IsUnsafeSmi(handle())) { 67 CodeGeneratorScope::Current()->MoveUnsafeSmi(fresh.reg(), handle()); 68 } else { 69 CodeGeneratorScope::Current()->masm()->Set(fresh.reg(), 70 Immediate(handle())); 71 } 72 } 73 *this = fresh; 74 } else if (is_register() && reg().is(target)) { 75 ASSERT(CodeGeneratorScope::Current()->has_valid_frame()); 76 CodeGeneratorScope::Current()->frame()->Spill(target); 77 ASSERT(CodeGeneratorScope::Current()->allocator()->count(target) == 1); 78 } 79 ASSERT(is_register()); 80 ASSERT(reg().is(target)); 81 } 82 83 84 // ------------------------------------------------------------------------- 85 // RegisterAllocator implementation. 86 87 Result RegisterAllocator::AllocateByteRegisterWithoutSpilling() { 88 Result result = AllocateWithoutSpilling(); 89 // Check that the register is a byte register. If not, unuse the 90 // register if valid and return an invalid result. 91 if (result.is_valid() && !result.reg().is_byte_register()) { 92 result.Unuse(); 93 return Result(); 94 } 95 return result; 96 } 97 98 99 } } // namespace v8::internal 100