| OLD | NEW |
| (Empty) |
| 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 { namespace internal { | |
| 34 | |
| 35 // ------------------------------------------------------------------------- | |
| 36 // Result implementation. | |
| 37 | |
| 38 void Result::ToRegister() { | |
| 39 ASSERT(is_valid()); | |
| 40 if (is_constant()) { | |
| 41 Result fresh = cgen_->allocator()->Allocate(); | |
| 42 ASSERT(fresh.is_valid()); | |
| 43 if (cgen_->IsUnsafeSmi(handle())) { | |
| 44 cgen_->LoadUnsafeSmi(fresh.reg(), handle()); | |
| 45 } else { | |
| 46 cgen_->masm()->Set(fresh.reg(), Immediate(handle())); | |
| 47 } | |
| 48 // This result becomes a copy of the fresh one. | |
| 49 *this = fresh; | |
| 50 } | |
| 51 ASSERT(is_register()); | |
| 52 } | |
| 53 | |
| 54 | |
| 55 void Result::ToRegister(Register target) { | |
| 56 ASSERT(is_valid()); | |
| 57 if (!is_register() || !reg().is(target)) { | |
| 58 Result fresh = cgen_->allocator()->Allocate(target); | |
| 59 ASSERT(fresh.is_valid()); | |
| 60 if (is_register()) { | |
| 61 cgen_->masm()->mov(fresh.reg(), reg()); | |
| 62 } else { | |
| 63 ASSERT(is_constant()); | |
| 64 if (cgen_->IsUnsafeSmi(handle())) { | |
| 65 cgen_->LoadUnsafeSmi(fresh.reg(), handle()); | |
| 66 } else { | |
| 67 cgen_->masm()->Set(fresh.reg(), Immediate(handle())); | |
| 68 } | |
| 69 } | |
| 70 *this = fresh; | |
| 71 } else if (is_register() && reg().is(target)) { | |
| 72 ASSERT(cgen_->has_valid_frame()); | |
| 73 cgen_->frame()->Spill(target); | |
| 74 ASSERT(cgen_->allocator()->count(target) == 1); | |
| 75 } | |
| 76 ASSERT(is_register()); | |
| 77 ASSERT(reg().is(target)); | |
| 78 } | |
| 79 | |
| 80 | |
| 81 // ------------------------------------------------------------------------- | |
| 82 // RegisterAllocator implementation. | |
| 83 | |
| 84 RegisterFile RegisterAllocator::Reserved() { | |
| 85 RegisterFile reserved; | |
| 86 reserved.Use(esp); | |
| 87 reserved.Use(ebp); | |
| 88 reserved.Use(esi); | |
| 89 return reserved; | |
| 90 } | |
| 91 | |
| 92 | |
| 93 void RegisterAllocator::UnuseReserved(RegisterFile* register_file) { | |
| 94 register_file->ref_counts_[esp.code()] = 0; | |
| 95 register_file->ref_counts_[ebp.code()] = 0; | |
| 96 register_file->ref_counts_[esi.code()] = 0; | |
| 97 } | |
| 98 | |
| 99 | |
| 100 void RegisterAllocator::Initialize() { | |
| 101 Reset(); | |
| 102 // The following register is live on function entry, saved in the | |
| 103 // frame, and available for allocation during execution. | |
| 104 Use(edi); // JS function. | |
| 105 } | |
| 106 | |
| 107 | |
| 108 void RegisterAllocator::Reset() { | |
| 109 registers_.Reset(); | |
| 110 // The following registers are live on function entry and reserved | |
| 111 // during execution. | |
| 112 Use(esp); // Stack pointer. | |
| 113 Use(ebp); // Frame pointer (caller's frame pointer on entry). | |
| 114 Use(esi); // Context (callee's context on entry). | |
| 115 } | |
| 116 | |
| 117 | |
| 118 Result RegisterAllocator::AllocateByteRegisterWithoutSpilling() { | |
| 119 Result result = AllocateWithoutSpilling(); | |
| 120 // Check that the register is a byte register. If not, unuse the | |
| 121 // register if valid and return an invalid result. | |
| 122 if (result.is_valid() && !result.reg().is_byte_register()) { | |
| 123 result.Unuse(); | |
| 124 return Result(cgen_); | |
| 125 } | |
| 126 return result; | |
| 127 } | |
| 128 | |
| 129 | |
| 130 } } // namespace v8::internal | |
| OLD | NEW |