| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 115 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 126 info_->function()->name()->IsEqualTo(CStrVector(FLAG_stop_at))) { | 126 info_->function()->name()->IsEqualTo(CStrVector(FLAG_stop_at))) { |
| 127 __ int3(); | 127 __ int3(); |
| 128 } | 128 } |
| 129 #endif | 129 #endif |
| 130 | 130 |
| 131 // Strict mode functions need to replace the receiver with undefined | 131 // Strict mode functions need to replace the receiver with undefined |
| 132 // when called as functions (without an explicit receiver | 132 // when called as functions (without an explicit receiver |
| 133 // object). rcx is zero for method calls and non-zero for function | 133 // object). rcx is zero for method calls and non-zero for function |
| 134 // calls. | 134 // calls. |
| 135 if (!info_->is_classic_mode() || info_->is_native()) { | 135 if (!info_->is_classic_mode() || info_->is_native()) { |
| 136 Label begin; |
| 137 __ bind(&begin); |
| 136 Label ok; | 138 Label ok; |
| 137 __ testq(rcx, rcx); | 139 __ testq(rcx, rcx); |
| 138 __ j(zero, &ok, Label::kNear); | 140 __ j(zero, &ok, Label::kNear); |
| 139 // +1 for return address. | 141 // +1 for return address. |
| 140 int receiver_offset = (scope()->num_parameters() + 1) * kPointerSize; | 142 int receiver_offset = (scope()->num_parameters() + 1) * kPointerSize; |
| 141 __ LoadRoot(kScratchRegister, Heap::kUndefinedValueRootIndex); | 143 __ LoadRoot(kScratchRegister, Heap::kUndefinedValueRootIndex); |
| 142 __ movq(Operand(rsp, receiver_offset), kScratchRegister); | 144 __ movq(Operand(rsp, receiver_offset), kScratchRegister); |
| 143 __ bind(&ok); | 145 __ bind(&ok); |
| 146 ASSERT_EQ(kSizeOfOptimizedStrictModePrologue, ok.pos() - begin.pos()); |
| 144 } | 147 } |
| 145 | 148 |
| 146 __ push(rbp); // Caller's frame pointer. | 149 __ push(rbp); // Caller's frame pointer. |
| 147 __ movq(rbp, rsp); | 150 __ movq(rbp, rsp); |
| 148 __ push(rsi); // Callee's context. | 151 __ push(rsi); // Callee's context. |
| 149 __ push(rdi); // Callee's JS function. | 152 __ push(rdi); // Callee's JS function. |
| 150 | 153 |
| 151 // Reserve space for the stack slots needed by the code. | 154 // Reserve space for the stack slots needed by the code. |
| 152 int slots = GetStackSlotCount(); | 155 int slots = GetStackSlotCount(); |
| 153 if (slots > 0) { | 156 if (slots > 0) { |
| (...skipping 5190 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5344 FixedArray::kHeaderSize - kPointerSize)); | 5347 FixedArray::kHeaderSize - kPointerSize)); |
| 5345 __ bind(&done); | 5348 __ bind(&done); |
| 5346 } | 5349 } |
| 5347 | 5350 |
| 5348 | 5351 |
| 5349 #undef __ | 5352 #undef __ |
| 5350 | 5353 |
| 5351 } } // namespace v8::internal | 5354 } } // namespace v8::internal |
| 5352 | 5355 |
| 5353 #endif // V8_TARGET_ARCH_X64 | 5356 #endif // V8_TARGET_ARCH_X64 |
| OLD | NEW |