| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 11 matching lines...) Expand all Loading... |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include "v8.h" | 28 #include "v8.h" |
| 29 | 29 |
| 30 #include "codegen-inl.h" | 30 #include "codegen-inl.h" |
| 31 #include "fast-codegen.h" | 31 #include "fast-codegen.h" |
| 32 #include "scopes.h" |
| 32 | 33 |
| 33 namespace v8 { | 34 namespace v8 { |
| 34 namespace internal { | 35 namespace internal { |
| 35 | 36 |
| 36 #define __ ACCESS_MASM(masm()) | 37 #define __ ACCESS_MASM(masm()) |
| 37 | 38 |
| 38 Register FastCodeGenerator::accumulator0() { return rax; } | 39 Register FastCodeGenerator::accumulator0() { return rax; } |
| 39 Register FastCodeGenerator::accumulator1() { return rdx; } | 40 Register FastCodeGenerator::accumulator1() { return rdx; } |
| 40 Register FastCodeGenerator::scratch0() { return rcx; } | 41 Register FastCodeGenerator::scratch0() { return rcx; } |
| 41 Register FastCodeGenerator::scratch1() { return rdi; } | 42 Register FastCodeGenerator::scratch1() { return rdi; } |
| (...skipping 139 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 181 // If we didn't bailout, the result (in fact, both inputs too) is known to | 182 // If we didn't bailout, the result (in fact, both inputs too) is known to |
| 182 // be a smi. | 183 // be a smi. |
| 183 set_as_smi(accumulator0()); | 184 set_as_smi(accumulator0()); |
| 184 set_as_smi(accumulator1()); | 185 set_as_smi(accumulator1()); |
| 185 } | 186 } |
| 186 | 187 |
| 187 | 188 |
| 188 void FastCodeGenerator::Generate(CompilationInfo* compilation_info) { | 189 void FastCodeGenerator::Generate(CompilationInfo* compilation_info) { |
| 189 ASSERT(info_ == NULL); | 190 ASSERT(info_ == NULL); |
| 190 info_ = compilation_info; | 191 info_ = compilation_info; |
| 192 Comment cmnt(masm_, "[ function compiled by fast code generator"); |
| 191 | 193 |
| 192 // Save the caller's frame pointer and set up our own. | 194 // Save the caller's frame pointer and set up our own. |
| 193 Comment prologue_cmnt(masm(), ";; Prologue"); | 195 Comment prologue_cmnt(masm(), ";; Prologue"); |
| 194 __ push(rbp); | 196 __ push(rbp); |
| 195 __ movq(rbp, rsp); | 197 __ movq(rbp, rsp); |
| 196 __ push(rsi); // Context. | 198 __ push(rsi); // Context. |
| 197 __ push(rdi); // Closure. | 199 __ push(rdi); // Closure. |
| 198 // Note that we keep a live register reference to esi (context) at this | 200 // Note that we keep a live register reference to esi (context) at this |
| 199 // point. | 201 // point. |
| 200 | 202 |
| (...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 235 __ movq(rsp, rbp); | 237 __ movq(rsp, rbp); |
| 236 __ pop(rbp); | 238 __ pop(rbp); |
| 237 __ ret((scope()->num_parameters() + 1) * kPointerSize); | 239 __ ret((scope()->num_parameters() + 1) * kPointerSize); |
| 238 } | 240 } |
| 239 | 241 |
| 240 | 242 |
| 241 #undef __ | 243 #undef __ |
| 242 | 244 |
| 243 | 245 |
| 244 } } // namespace v8::internal | 246 } } // namespace v8::internal |
| OLD | NEW |