| OLD | NEW |
| 1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 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 "register-allocator-inl.h" | 31 #include "register-allocator-inl.h" |
| 32 #include "virtual-frame-inl.h" |
| 32 | 33 |
| 33 namespace v8 { | 34 namespace v8 { |
| 34 namespace internal { | 35 namespace internal { |
| 35 | 36 |
| 36 // ------------------------------------------------------------------------- | 37 // ------------------------------------------------------------------------- |
| 37 // Result implementation. | 38 // Result implementation. |
| 38 | 39 |
| 39 void Result::ToRegister() { | 40 void Result::ToRegister() { |
| 40 ASSERT(is_valid()); | 41 ASSERT(is_valid()); |
| 41 if (is_constant()) { | 42 if (is_constant()) { |
| 42 Result fresh = CodeGeneratorScope::Current()->allocator()->Allocate(); | 43 Result fresh = CodeGeneratorScope::Current()->allocator()->Allocate(); |
| 43 ASSERT(fresh.is_valid()); | 44 ASSERT(fresh.is_valid()); |
| 44 if (CodeGeneratorScope::Current()->IsUnsafeSmi(handle())) { | 45 if (CodeGeneratorScope::Current()->IsUnsafeSmi(handle())) { |
| 45 CodeGeneratorScope::Current()->MoveUnsafeSmi(fresh.reg(), handle()); | 46 CodeGeneratorScope::Current()->MoveUnsafeSmi(fresh.reg(), handle()); |
| 46 } else { | 47 } else { |
| 47 CodeGeneratorScope::Current()->masm()->Set(fresh.reg(), | 48 CodeGeneratorScope::Current()->masm()->Set(fresh.reg(), |
| 48 Immediate(handle())); | 49 Immediate(handle())); |
| 49 } | 50 } |
| 50 // This result becomes a copy of the fresh one. | 51 // This result becomes a copy of the fresh one. |
| 52 fresh.set_number_info(number_info()); |
| 51 *this = fresh; | 53 *this = fresh; |
| 52 } | 54 } |
| 53 ASSERT(is_register()); | 55 ASSERT(is_register()); |
| 54 } | 56 } |
| 55 | 57 |
| 56 | 58 |
| 57 void Result::ToRegister(Register target) { | 59 void Result::ToRegister(Register target) { |
| 58 ASSERT(is_valid()); | 60 ASSERT(is_valid()); |
| 59 if (!is_register() || !reg().is(target)) { | 61 if (!is_register() || !reg().is(target)) { |
| 60 Result fresh = CodeGeneratorScope::Current()->allocator()->Allocate(target); | 62 Result fresh = CodeGeneratorScope::Current()->allocator()->Allocate(target); |
| (...skipping 29 matching lines...) Expand all Loading... |
| 90 // register if valid and return an invalid result. | 92 // register if valid and return an invalid result. |
| 91 if (result.is_valid() && !result.reg().is_byte_register()) { | 93 if (result.is_valid() && !result.reg().is_byte_register()) { |
| 92 result.Unuse(); | 94 result.Unuse(); |
| 93 return Result(); | 95 return Result(); |
| 94 } | 96 } |
| 95 return result; | 97 return result; |
| 96 } | 98 } |
| 97 | 99 |
| 98 | 100 |
| 99 } } // namespace v8::internal | 101 } } // namespace v8::internal |
| OLD | NEW |