blob: 58e9e939f561b3f875ff238b897ace00add2ecac [file] [log] [blame]
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001// Copyright 2014 the V8 project authors. All rights reserved.
2// Use of this source code is governed by a BSD-style license that can be
3// found in the LICENSE file.
4
5#include "src/v8.h"
6
7#include "src/codegen.h"
8#include "src/deoptimizer.h"
9#include "src/full-codegen.h"
10#include "src/safepoint-table.h"
11
12namespace v8 {
13namespace internal {
14
15const int Deoptimizer::table_entry_size_ = 8;
16
17
18int Deoptimizer::patch_size() {
19#if V8_TARGET_ARCH_PPC64
20 const int kCallInstructionSizeInWords = 7;
21#else
22 const int kCallInstructionSizeInWords = 4;
23#endif
24 return kCallInstructionSizeInWords * Assembler::kInstrSize;
25}
26
27
28void Deoptimizer::PatchCodeForDeoptimization(Isolate* isolate, Code* code) {
29 Address code_start_address = code->instruction_start();
30
31 // Invalidate the relocation information, as it will become invalid by the
32 // code patching below, and is not needed any more.
33 code->InvalidateRelocation();
34
35 if (FLAG_zap_code_space) {
36 // Fail hard and early if we enter this code object again.
37 byte* pointer = code->FindCodeAgeSequence();
38 if (pointer != NULL) {
39 pointer += kNoCodeAgeSequenceLength;
40 } else {
41 pointer = code->instruction_start();
42 }
43 CodePatcher patcher(pointer, 1);
44 patcher.masm()->bkpt(0);
45
46 DeoptimizationInputData* data =
47 DeoptimizationInputData::cast(code->deoptimization_data());
48 int osr_offset = data->OsrPcOffset()->value();
49 if (osr_offset > 0) {
50 CodePatcher osr_patcher(code->instruction_start() + osr_offset, 1);
51 osr_patcher.masm()->bkpt(0);
52 }
53 }
54
55 DeoptimizationInputData* deopt_data =
56 DeoptimizationInputData::cast(code->deoptimization_data());
57#ifdef DEBUG
58 Address prev_call_address = NULL;
59#endif
60 // For each LLazyBailout instruction insert a call to the corresponding
61 // deoptimization entry.
62 for (int i = 0; i < deopt_data->DeoptCount(); i++) {
63 if (deopt_data->Pc(i)->value() == -1) continue;
64 Address call_address = code_start_address + deopt_data->Pc(i)->value();
65 Address deopt_entry = GetDeoptimizationEntry(isolate, i, LAZY);
66 // We need calls to have a predictable size in the unoptimized code, but
67 // this is optimized code, so we don't have to have a predictable size.
68 int call_size_in_bytes = MacroAssembler::CallSizeNotPredictableCodeSize(
69 deopt_entry, kRelocInfo_NONEPTR);
70 int call_size_in_words = call_size_in_bytes / Assembler::kInstrSize;
71 DCHECK(call_size_in_bytes % Assembler::kInstrSize == 0);
72 DCHECK(call_size_in_bytes <= patch_size());
73 CodePatcher patcher(call_address, call_size_in_words);
74 patcher.masm()->Call(deopt_entry, kRelocInfo_NONEPTR);
75 DCHECK(prev_call_address == NULL ||
76 call_address >= prev_call_address + patch_size());
77 DCHECK(call_address + patch_size() <= code->instruction_end());
78#ifdef DEBUG
79 prev_call_address = call_address;
80#endif
81 }
82}
83
84
85void Deoptimizer::FillInputFrame(Address tos, JavaScriptFrame* frame) {
86 // Set the register values. The values are not important as there are no
87 // callee saved registers in JavaScript frames, so all registers are
88 // spilled. Registers fp and sp are set to the correct values though.
89
90 for (int i = 0; i < Register::kNumRegisters; i++) {
91 input_->SetRegister(i, i * 4);
92 }
93 input_->SetRegister(sp.code(), reinterpret_cast<intptr_t>(frame->sp()));
94 input_->SetRegister(fp.code(), reinterpret_cast<intptr_t>(frame->fp()));
95 for (int i = 0; i < DoubleRegister::NumAllocatableRegisters(); i++) {
96 input_->SetDoubleRegister(i, 0.0);
97 }
98
99 // Fill the frame content from the actual data on the frame.
100 for (unsigned i = 0; i < input_->GetFrameSize(); i += kPointerSize) {
101 input_->SetFrameSlot(
102 i, reinterpret_cast<intptr_t>(Memory::Address_at(tos + i)));
103 }
104}
105
106
107void Deoptimizer::SetPlatformCompiledStubRegisters(
108 FrameDescription* output_frame, CodeStubDescriptor* descriptor) {
109 ApiFunction function(descriptor->deoptimization_handler());
110 ExternalReference xref(&function, ExternalReference::BUILTIN_CALL, isolate_);
111 intptr_t handler = reinterpret_cast<intptr_t>(xref.address());
112 int params = descriptor->GetHandlerParameterCount();
113 output_frame->SetRegister(r3.code(), params);
114 output_frame->SetRegister(r4.code(), handler);
115}
116
117
118void Deoptimizer::CopyDoubleRegisters(FrameDescription* output_frame) {
119 for (int i = 0; i < DoubleRegister::kMaxNumRegisters; ++i) {
120 double double_value = input_->GetDoubleRegister(i);
121 output_frame->SetDoubleRegister(i, double_value);
122 }
123}
124
125
126bool Deoptimizer::HasAlignmentPadding(JSFunction* function) {
127 // There is no dynamic alignment padding on PPC in the input frame.
128 return false;
129}
130
131
132#define __ masm()->
133
134// This code tries to be close to ia32 code so that any changes can be
135// easily ported.
136void Deoptimizer::EntryGenerator::Generate() {
137 GeneratePrologue();
138
139 // Unlike on ARM we don't save all the registers, just the useful ones.
140 // For the rest, there are gaps on the stack, so the offsets remain the same.
141 const int kNumberOfRegisters = Register::kNumRegisters;
142
143 RegList restored_regs = kJSCallerSaved | kCalleeSaved;
144 RegList saved_regs = restored_regs | sp.bit();
145
146 const int kDoubleRegsSize =
147 kDoubleSize * DoubleRegister::kMaxNumAllocatableRegisters;
148
149 // Save all FPU registers before messing with them.
150 __ subi(sp, sp, Operand(kDoubleRegsSize));
151 for (int i = 0; i < DoubleRegister::kMaxNumAllocatableRegisters; ++i) {
152 DoubleRegister fpu_reg = DoubleRegister::FromAllocationIndex(i);
153 int offset = i * kDoubleSize;
154 __ stfd(fpu_reg, MemOperand(sp, offset));
155 }
156
157 // Push saved_regs (needed to populate FrameDescription::registers_).
158 // Leave gaps for other registers.
159 __ subi(sp, sp, Operand(kNumberOfRegisters * kPointerSize));
160 for (int16_t i = kNumberOfRegisters - 1; i >= 0; i--) {
161 if ((saved_regs & (1 << i)) != 0) {
162 __ StoreP(ToRegister(i), MemOperand(sp, kPointerSize * i));
163 }
164 }
165
166 const int kSavedRegistersAreaSize =
167 (kNumberOfRegisters * kPointerSize) + kDoubleRegsSize;
168
169 // Get the bailout id from the stack.
170 __ LoadP(r5, MemOperand(sp, kSavedRegistersAreaSize));
171
172 // Get the address of the location in the code object (r6) (return
173 // address for lazy deoptimization) and compute the fp-to-sp delta in
174 // register r7.
175 __ mflr(r6);
176 // Correct one word for bailout id.
177 __ addi(r7, sp, Operand(kSavedRegistersAreaSize + (1 * kPointerSize)));
178 __ sub(r7, fp, r7);
179
180 // Allocate a new deoptimizer object.
181 // Pass six arguments in r3 to r8.
182 __ PrepareCallCFunction(6, r8);
183 __ LoadP(r3, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset));
184 __ li(r4, Operand(type())); // bailout type,
185 // r5: bailout id already loaded.
186 // r6: code address or 0 already loaded.
187 // r7: Fp-to-sp delta.
188 __ mov(r8, Operand(ExternalReference::isolate_address(isolate())));
189 // Call Deoptimizer::New().
190 {
191 AllowExternalCallThatCantCauseGC scope(masm());
192 __ CallCFunction(ExternalReference::new_deoptimizer_function(isolate()), 6);
193 }
194
195 // Preserve "deoptimizer" object in register r3 and get the input
196 // frame descriptor pointer to r4 (deoptimizer->input_);
197 __ LoadP(r4, MemOperand(r3, Deoptimizer::input_offset()));
198
199 // Copy core registers into FrameDescription::registers_[kNumRegisters].
200 DCHECK(Register::kNumRegisters == kNumberOfRegisters);
201 for (int i = 0; i < kNumberOfRegisters; i++) {
202 int offset = (i * kPointerSize) + FrameDescription::registers_offset();
203 __ LoadP(r5, MemOperand(sp, i * kPointerSize));
204 __ StoreP(r5, MemOperand(r4, offset));
205 }
206
207 int double_regs_offset = FrameDescription::double_registers_offset();
208 // Copy VFP registers to
209 // double_registers_[DoubleRegister::kNumAllocatableRegisters]
210 for (int i = 0; i < DoubleRegister::NumAllocatableRegisters(); ++i) {
211 int dst_offset = i * kDoubleSize + double_regs_offset;
212 int src_offset = i * kDoubleSize + kNumberOfRegisters * kPointerSize;
213 __ lfd(d0, MemOperand(sp, src_offset));
214 __ stfd(d0, MemOperand(r4, dst_offset));
215 }
216
217 // Remove the bailout id and the saved registers from the stack.
218 __ addi(sp, sp, Operand(kSavedRegistersAreaSize + (1 * kPointerSize)));
219
220 // Compute a pointer to the unwinding limit in register r5; that is
221 // the first stack slot not part of the input frame.
222 __ LoadP(r5, MemOperand(r4, FrameDescription::frame_size_offset()));
223 __ add(r5, r5, sp);
224
225 // Unwind the stack down to - but not including - the unwinding
226 // limit and copy the contents of the activation frame to the input
227 // frame description.
228 __ addi(r6, r4, Operand(FrameDescription::frame_content_offset()));
229 Label pop_loop;
230 Label pop_loop_header;
231 __ b(&pop_loop_header);
232 __ bind(&pop_loop);
233 __ pop(r7);
234 __ StoreP(r7, MemOperand(r6, 0));
235 __ addi(r6, r6, Operand(kPointerSize));
236 __ bind(&pop_loop_header);
237 __ cmp(r5, sp);
238 __ bne(&pop_loop);
239
240 // Compute the output frame in the deoptimizer.
241 __ push(r3); // Preserve deoptimizer object across call.
242 // r3: deoptimizer object; r4: scratch.
243 __ PrepareCallCFunction(1, r4);
244 // Call Deoptimizer::ComputeOutputFrames().
245 {
246 AllowExternalCallThatCantCauseGC scope(masm());
247 __ CallCFunction(
248 ExternalReference::compute_output_frames_function(isolate()), 1);
249 }
250 __ pop(r3); // Restore deoptimizer object (class Deoptimizer).
251
252 // Replace the current (input) frame with the output frames.
253 Label outer_push_loop, inner_push_loop, outer_loop_header, inner_loop_header;
254 // Outer loop state: r7 = current "FrameDescription** output_",
255 // r4 = one past the last FrameDescription**.
256 __ lwz(r4, MemOperand(r3, Deoptimizer::output_count_offset()));
257 __ LoadP(r7, MemOperand(r3, Deoptimizer::output_offset())); // r7 is output_.
258 __ ShiftLeftImm(r4, r4, Operand(kPointerSizeLog2));
259 __ add(r4, r7, r4);
260 __ b(&outer_loop_header);
261
262 __ bind(&outer_push_loop);
263 // Inner loop state: r5 = current FrameDescription*, r6 = loop index.
264 __ LoadP(r5, MemOperand(r7, 0)); // output_[ix]
265 __ LoadP(r6, MemOperand(r5, FrameDescription::frame_size_offset()));
266 __ b(&inner_loop_header);
267
268 __ bind(&inner_push_loop);
269 __ addi(r6, r6, Operand(-sizeof(intptr_t)));
270 __ add(r9, r5, r6);
271 __ LoadP(r9, MemOperand(r9, FrameDescription::frame_content_offset()));
272 __ push(r9);
273
274 __ bind(&inner_loop_header);
275 __ cmpi(r6, Operand::Zero());
276 __ bne(&inner_push_loop); // test for gt?
277
278 __ addi(r7, r7, Operand(kPointerSize));
279 __ bind(&outer_loop_header);
280 __ cmp(r7, r4);
281 __ blt(&outer_push_loop);
282
283 __ LoadP(r4, MemOperand(r3, Deoptimizer::input_offset()));
284 for (int i = 0; i < DoubleRegister::kMaxNumAllocatableRegisters; ++i) {
285 const DoubleRegister dreg = DoubleRegister::FromAllocationIndex(i);
286 int src_offset = i * kDoubleSize + double_regs_offset;
287 __ lfd(dreg, MemOperand(r4, src_offset));
288 }
289
290 // Push state, pc, and continuation from the last output frame.
291 __ LoadP(r9, MemOperand(r5, FrameDescription::state_offset()));
292 __ push(r9);
293 __ LoadP(r9, MemOperand(r5, FrameDescription::pc_offset()));
294 __ push(r9);
295 __ LoadP(r9, MemOperand(r5, FrameDescription::continuation_offset()));
296 __ push(r9);
297
298 // Restore the registers from the last output frame.
299 DCHECK(!(ip.bit() & restored_regs));
300 __ mr(ip, r5);
301 for (int i = kNumberOfRegisters - 1; i >= 0; i--) {
302 int offset = (i * kPointerSize) + FrameDescription::registers_offset();
303 if ((restored_regs & (1 << i)) != 0) {
304 __ LoadP(ToRegister(i), MemOperand(ip, offset));
305 }
306 }
307
308 __ InitializeRootRegister();
309
310 __ pop(ip); // get continuation, leave pc on stack
311 __ pop(r0);
312 __ mtlr(r0);
313 __ Jump(ip);
314 __ stop("Unreachable.");
315}
316
317
318void Deoptimizer::TableEntryGenerator::GeneratePrologue() {
319 Assembler::BlockTrampolinePoolScope block_trampoline_pool(masm());
320
321 // Create a sequence of deoptimization entries.
322 // Note that registers are still live when jumping to an entry.
323 Label done;
324 for (int i = 0; i < count(); i++) {
325 int start = masm()->pc_offset();
326 USE(start);
327 __ li(ip, Operand(i));
328 __ b(&done);
329 DCHECK(masm()->pc_offset() - start == table_entry_size_);
330 }
331 __ bind(&done);
332 __ push(ip);
333}
334
335
336void FrameDescription::SetCallerPc(unsigned offset, intptr_t value) {
337 SetFrameSlot(offset, value);
338}
339
340
341void FrameDescription::SetCallerFp(unsigned offset, intptr_t value) {
342 SetFrameSlot(offset, value);
343}
344
345
346void FrameDescription::SetCallerConstantPool(unsigned offset, intptr_t value) {
347#if V8_OOL_CONSTANT_POOL
348 DCHECK(FLAG_enable_ool_constant_pool);
349 SetFrameSlot(offset, value);
350#else
351 // No out-of-line constant pool support.
352 UNREACHABLE();
353#endif
354}
355
356
357#undef __
358}
359} // namespace v8::internal