OLD | NEW |
| (Empty) |
1 // Copyright 2009 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 #ifndef V8_X64_REGISTER_ALLOCATOR_X64_INL_H_ | |
29 #define V8_X64_REGISTER_ALLOCATOR_X64_INL_H_ | |
30 | |
31 #include "v8.h" | |
32 | |
33 namespace v8 { | |
34 namespace internal { | |
35 | |
36 // ------------------------------------------------------------------------- | |
37 // RegisterAllocator implementation. | |
38 | |
39 bool RegisterAllocator::IsReserved(Register reg) { | |
40 return reg.is(rsp) || reg.is(rbp) || reg.is(rsi) || | |
41 reg.is(kScratchRegister) || reg.is(kRootRegister) || | |
42 reg.is(kSmiConstantRegister); | |
43 } | |
44 | |
45 | |
46 // The register allocator uses small integers to represent the | |
47 // non-reserved assembler registers. | |
48 int RegisterAllocator::ToNumber(Register reg) { | |
49 ASSERT(reg.is_valid() && !IsReserved(reg)); | |
50 const int kNumbers[] = { | |
51 0, // rax | |
52 2, // rcx | |
53 3, // rdx | |
54 1, // rbx | |
55 -1, // rsp Stack pointer. | |
56 -1, // rbp Frame pointer. | |
57 -1, // rsi Context. | |
58 4, // rdi | |
59 5, // r8 | |
60 6, // r9 | |
61 -1, // r10 Scratch register. | |
62 8, // r11 | |
63 -1, // r12 Smi constant. | |
64 -1, // r13 Roots array. This is callee saved. | |
65 7, // r14 | |
66 9 // r15 | |
67 }; | |
68 return kNumbers[reg.code()]; | |
69 } | |
70 | |
71 | |
72 Register RegisterAllocator::ToRegister(int num) { | |
73 ASSERT(num >= 0 && num < kNumRegisters); | |
74 const Register kRegisters[] = | |
75 { rax, rbx, rcx, rdx, rdi, r8, r9, r14, r11, r15 }; | |
76 return kRegisters[num]; | |
77 } | |
78 | |
79 | |
80 void RegisterAllocator::Initialize() { | |
81 Reset(); | |
82 // The non-reserved rdi register is live on JS function entry. | |
83 Use(rdi); // JS function. | |
84 } | |
85 } } // namespace v8::internal | |
86 | |
87 #endif // V8_X64_REGISTER_ALLOCATOR_X64_INL_H_ | |
OLD | NEW |