| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 10 matching lines...) Expand all Loading... |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 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 "lithium-allocator-inl.h" | 30 #include "lithium-allocator-inl.h" |
| 31 #include "a64/lithium-a64.h" | 31 #include "arm64/lithium-arm64.h" |
| 32 #include "a64/lithium-codegen-a64.h" | 32 #include "arm64/lithium-codegen-arm64.h" |
| 33 #include "hydrogen-osr.h" | 33 #include "hydrogen-osr.h" |
| 34 | 34 |
| 35 namespace v8 { | 35 namespace v8 { |
| 36 namespace internal { | 36 namespace internal { |
| 37 | 37 |
| 38 | 38 |
| 39 #define DEFINE_COMPILE(type) \ | 39 #define DEFINE_COMPILE(type) \ |
| 40 void L##type::CompileToNative(LCodeGen* generator) { \ | 40 void L##type::CompileToNative(LCodeGen* generator) { \ |
| 41 generator->Do##type(this); \ | 41 generator->Do##type(this); \ |
| 42 } | 42 } |
| (...skipping 2406 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2449 LOperand* temp1 = TempRegister(); | 2449 LOperand* temp1 = TempRegister(); |
| 2450 LOperand* temp2 = TempRegister(); | 2450 LOperand* temp2 = TempRegister(); |
| 2451 LOperand* temp3 = TempRegister(); | 2451 LOperand* temp3 = TempRegister(); |
| 2452 LMathExp* result = new(zone()) LMathExp(input, double_temp1, | 2452 LMathExp* result = new(zone()) LMathExp(input, double_temp1, |
| 2453 temp1, temp2, temp3); | 2453 temp1, temp2, temp3); |
| 2454 return DefineAsRegister(result); | 2454 return DefineAsRegister(result); |
| 2455 } | 2455 } |
| 2456 case kMathFloor: { | 2456 case kMathFloor: { |
| 2457 ASSERT(instr->representation().IsInteger32()); | 2457 ASSERT(instr->representation().IsInteger32()); |
| 2458 ASSERT(instr->value()->representation().IsDouble()); | 2458 ASSERT(instr->value()->representation().IsDouble()); |
| 2459 // TODO(jbramley): A64 can easily handle a double argument with frintm, | 2459 // TODO(jbramley): ARM64 can easily handle a double argument with frintm, |
| 2460 // but we're never asked for it here. At the moment, we fall back to the | 2460 // but we're never asked for it here. At the moment, we fall back to the |
| 2461 // runtime if the result doesn't fit, like the other architectures. | 2461 // runtime if the result doesn't fit, like the other architectures. |
| 2462 LOperand* input = UseRegisterAtStart(instr->value()); | 2462 LOperand* input = UseRegisterAtStart(instr->value()); |
| 2463 LMathFloor* result = new(zone()) LMathFloor(input); | 2463 LMathFloor* result = new(zone()) LMathFloor(input); |
| 2464 return AssignEnvironment(AssignPointerMap(DefineAsRegister(result))); | 2464 return AssignEnvironment(AssignPointerMap(DefineAsRegister(result))); |
| 2465 } | 2465 } |
| 2466 case kMathLog: { | 2466 case kMathLog: { |
| 2467 ASSERT(instr->representation().IsDouble()); | 2467 ASSERT(instr->representation().IsDouble()); |
| 2468 ASSERT(instr->value()->representation().IsDouble()); | 2468 ASSERT(instr->value()->representation().IsDouble()); |
| 2469 LOperand* input = UseFixedDouble(instr->value(), d0); | 2469 LOperand* input = UseFixedDouble(instr->value(), d0); |
| (...skipping 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2561 | 2561 |
| 2562 LInstruction* LChunkBuilder::DoWrapReceiver(HWrapReceiver* instr) { | 2562 LInstruction* LChunkBuilder::DoWrapReceiver(HWrapReceiver* instr) { |
| 2563 LOperand* receiver = UseRegister(instr->receiver()); | 2563 LOperand* receiver = UseRegister(instr->receiver()); |
| 2564 LOperand* function = UseRegister(instr->function()); | 2564 LOperand* function = UseRegister(instr->function()); |
| 2565 LWrapReceiver* result = new(zone()) LWrapReceiver(receiver, function); | 2565 LWrapReceiver* result = new(zone()) LWrapReceiver(receiver, function); |
| 2566 return AssignEnvironment(DefineAsRegister(result)); | 2566 return AssignEnvironment(DefineAsRegister(result)); |
| 2567 } | 2567 } |
| 2568 | 2568 |
| 2569 | 2569 |
| 2570 } } // namespace v8::internal | 2570 } } // namespace v8::internal |
| OLD | NEW |