source: webkit/trunk/JavaScriptCore/jit/JIT.cpp@ 59064

Last change on this file since 59064 was 59064, checked in by [email protected], 15 years ago

2010-05-09 Geoffrey Garen <​[email protected]>

Reviewed by Oliver Hunt.

Reserve a large-ish initial capacity for Lexer::m_buffer16.

SunSpider says 0.3% faster.

m_buffer16 is used when parsing complex strings -- for example, strings
with escape sequences in them. These kinds of strings can be really long,
and we want to avoid repeatedly copying as we grow m_buffer16.

The net memory cost is quite low, since it's proporitional to source
code we already have in memory, and we throw away m_buffer16 right when
we're done parsing.

  • parser/Lexer.cpp: (JSC::Lexer::Lexer): No need to reserve initial capacity in our constructor, since setCode will be called before we're asked to lex anything. (JSC::Lexer::setCode): Reserve enough space to lex half the source code as a complex string without having to copy. (JSC::Lexer::clear): No need to reserve initial capacity here either, since setCode will be called before we're asked to lex anything.

2010-05-09 Oliver Hunt <​[email protected]>

Reviewed by Gavin Barraclough.

REGRESSION(r57955): RegExp literals should not actually be cached, so r57955 should be rolled out.
​https://bugs.webkit.org/show_bug.cgi?id=38828

Replace incorrect test for caching regexp literals with ones that tests that they are not cached.

  • fast/js/regexp-literals-are-constants-expected.txt: Removed.
  • fast/js/regexp-literals-are-constants.html: Removed.
  • fast/js/regexp-literals-arent-constants-expected.txt: Added.
  • fast/js/regexp-literals-arent-constants.html: Added.
  • fast/js/script-tests/regexp-literals-are-constants.js: Removed.
  • fast/js/script-tests/regexp-literals-arent-constants.js: Added. (test1): (returnRegExpLiteral): (returnConditionalRegExpLiteral):
File size: 23.1 KB
Line 
1/*
2 * Copyright (C) 2008, 2009 Apple Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24 */
25
26#include "config.h"
27#include "JIT.h"
28
29// This probably does not belong here; adding here for now as a quick Windows build fix.
30#if ENABLE(ASSEMBLER) && CPU(X86) && !OS(MAC_OS_X)
31#include "MacroAssembler.h"
32JSC::MacroAssemblerX86Common::SSE2CheckState JSC::MacroAssemblerX86Common::s_sse2CheckState = NotCheckedSSE2;
33#endif
34
35#if ENABLE(JIT)
36
37#include "CodeBlock.h"
38#include "Interpreter.h"
39#include "JITInlineMethods.h"
40#include "JITStubCall.h"
41#include "JSArray.h"
42#include "JSFunction.h"
43#include "LinkBuffer.h"
44#include "RepatchBuffer.h"
45#include "ResultType.h"
46#include "SamplingTool.h"
47
48#ifndef NDEBUG
49#include <stdio.h>
50#endif
51
52using namespace std;
53
54namespace JSC {
55
56void ctiPatchNearCallByReturnAddress(CodeBlock* codeblock, ReturnAddressPtr returnAddress, MacroAssemblerCodePtr newCalleeFunction)
57{
58 RepatchBuffer repatchBuffer(codeblock);
59 repatchBuffer.relinkNearCallerToTrampoline(returnAddress, newCalleeFunction);
60}
61
62void ctiPatchCallByReturnAddress(CodeBlock* codeblock, ReturnAddressPtr returnAddress, MacroAssemblerCodePtr newCalleeFunction)
63{
64 RepatchBuffer repatchBuffer(codeblock);
65 repatchBuffer.relinkCallerToTrampoline(returnAddress, newCalleeFunction);
66}
67
68void ctiPatchCallByReturnAddress(CodeBlock* codeblock, ReturnAddressPtr returnAddress, FunctionPtr newCalleeFunction)
69{
70 RepatchBuffer repatchBuffer(codeblock);
71 repatchBuffer.relinkCallerToFunction(returnAddress, newCalleeFunction);
72}
73
74JIT::JIT(JSGlobalData* globalData, CodeBlock* codeBlock)
75 : m_interpreter(globalData->interpreter)
76 , m_globalData(globalData)
77 , m_codeBlock(codeBlock)
78 , m_labels(codeBlock ? codeBlock->instructions().size() : 0)
79 , m_propertyAccessCompilationInfo(codeBlock ? codeBlock->numberOfStructureStubInfos() : 0)
80 , m_callStructureStubCompilationInfo(codeBlock ? codeBlock->numberOfCallLinkInfos() : 0)
81 , m_bytecodeIndex((unsigned)-1)
82#if USE(JSVALUE32_64)
83 , m_jumpTargetIndex(0)
84 , m_mappedBytecodeIndex((unsigned)-1)
85 , m_mappedVirtualRegisterIndex((unsigned)-1)
86 , m_mappedTag((RegisterID)-1)
87 , m_mappedPayload((RegisterID)-1)
88#else
89 , m_lastResultBytecodeRegister(std::numeric_limits<int>::max())
90 , m_jumpTargetsPosition(0)
91#endif
92{
93}
94
95#if USE(JSVALUE32_64)
96void JIT::emitTimeoutCheck()
97{
98 Jump skipTimeout = branchSub32(NonZero, Imm32(1), timeoutCheckRegister);
99 JITStubCall stubCall(this, cti_timeout_check);
100 stubCall.addArgument(regT1, regT0); // save last result registers.
101 stubCall.call(timeoutCheckRegister);
102 stubCall.getArgument(0, regT1, regT0); // reload last result registers.
103 skipTimeout.link(this);
104}
105#else
106void JIT::emitTimeoutCheck()
107{
108 Jump skipTimeout = branchSub32(NonZero, Imm32(1), timeoutCheckRegister);
109 JITStubCall(this, cti_timeout_check).call(timeoutCheckRegister);
110 skipTimeout.link(this);
111
112 killLastResultRegister();
113}
114#endif
115
116#define NEXT_OPCODE(name) \
117 m_bytecodeIndex += OPCODE_LENGTH(name); \
118 break;
119
120#if USE(JSVALUE32_64)
121#define DEFINE_BINARY_OP(name) \
122 case name: { \
123 JITStubCall stubCall(this, cti_##name); \
124 stubCall.addArgument(currentInstruction[2].u.operand); \
125 stubCall.addArgument(currentInstruction[3].u.operand); \
126 stubCall.call(currentInstruction[1].u.operand); \
127 NEXT_OPCODE(name); \
128 }
129
130#define DEFINE_UNARY_OP(name) \
131 case name: { \
132 JITStubCall stubCall(this, cti_##name); \
133 stubCall.addArgument(currentInstruction[2].u.operand); \
134 stubCall.call(currentInstruction[1].u.operand); \
135 NEXT_OPCODE(name); \
136 }
137
138#else // USE(JSVALUE32_64)
139
140#define DEFINE_BINARY_OP(name) \
141 case name: { \
142 JITStubCall stubCall(this, cti_##name); \
143 stubCall.addArgument(currentInstruction[2].u.operand, regT2); \
144 stubCall.addArgument(currentInstruction[3].u.operand, regT2); \
145 stubCall.call(currentInstruction[1].u.operand); \
146 NEXT_OPCODE(name); \
147 }
148
149#define DEFINE_UNARY_OP(name) \
150 case name: { \
151 JITStubCall stubCall(this, cti_##name); \
152 stubCall.addArgument(currentInstruction[2].u.operand, regT2); \
153 stubCall.call(currentInstruction[1].u.operand); \
154 NEXT_OPCODE(name); \
155 }
156#endif // USE(JSVALUE32_64)
157
158#define DEFINE_OP(name) \
159 case name: { \
160 emit_##name(currentInstruction); \
161 NEXT_OPCODE(name); \
162 }
163
164#define DEFINE_SLOWCASE_OP(name) \
165 case name: { \
166 emitSlow_##name(currentInstruction, iter); \
167 NEXT_OPCODE(name); \
168 }
169
170void JIT::privateCompileMainPass()
171{
172 Instruction* instructionsBegin = m_codeBlock->instructions().begin();
173 unsigned instructionCount = m_codeBlock->instructions().size();
174
175 m_propertyAccessInstructionIndex = 0;
176 m_globalResolveInfoIndex = 0;
177 m_callLinkInfoIndex = 0;
178
179 for (m_bytecodeIndex = 0; m_bytecodeIndex < instructionCount; ) {
180 Instruction* currentInstruction = instructionsBegin + m_bytecodeIndex;
181 ASSERT_WITH_MESSAGE(m_interpreter->isOpcode(currentInstruction->u.opcode), "privateCompileMainPass gone bad @ %d", m_bytecodeIndex);
182
183#if ENABLE(OPCODE_SAMPLING)
184 if (m_bytecodeIndex > 0) // Avoid the overhead of sampling op_enter twice.
185 sampleInstruction(currentInstruction);
186#endif
187
188#if !USE(JSVALUE32_64)
189 if (m_labels[m_bytecodeIndex].isUsed())
190 killLastResultRegister();
191#endif
192
193 m_labels[m_bytecodeIndex] = label();
194
195 switch (m_interpreter->getOpcodeID(currentInstruction->u.opcode)) {
196 DEFINE_BINARY_OP(op_del_by_val)
197#if USE(JSVALUE32)
198 DEFINE_BINARY_OP(op_div)
199#endif
200 DEFINE_BINARY_OP(op_in)
201 DEFINE_BINARY_OP(op_less)
202 DEFINE_BINARY_OP(op_lesseq)
203 DEFINE_UNARY_OP(op_is_boolean)
204 DEFINE_UNARY_OP(op_is_function)
205 DEFINE_UNARY_OP(op_is_number)
206 DEFINE_UNARY_OP(op_is_object)
207 DEFINE_UNARY_OP(op_is_string)
208 DEFINE_UNARY_OP(op_is_undefined)
209#if !USE(JSVALUE32_64)
210 DEFINE_UNARY_OP(op_negate)
211#endif
212 DEFINE_UNARY_OP(op_typeof)
213
214 DEFINE_OP(op_add)
215 DEFINE_OP(op_bitand)
216 DEFINE_OP(op_bitnot)
217 DEFINE_OP(op_bitor)
218 DEFINE_OP(op_bitxor)
219 DEFINE_OP(op_call)
220 DEFINE_OP(op_call_eval)
221 DEFINE_OP(op_call_varargs)
222 DEFINE_OP(op_catch)
223 DEFINE_OP(op_construct)
224 DEFINE_OP(op_construct_verify)
225 DEFINE_OP(op_convert_this)
226 DEFINE_OP(op_init_arguments)
227 DEFINE_OP(op_create_arguments)
228 DEFINE_OP(op_debug)
229 DEFINE_OP(op_del_by_id)
230#if !USE(JSVALUE32)
231 DEFINE_OP(op_div)
232#endif
233 DEFINE_OP(op_end)
234 DEFINE_OP(op_enter)
235 DEFINE_OP(op_enter_with_activation)
236 DEFINE_OP(op_eq)
237 DEFINE_OP(op_eq_null)
238 DEFINE_OP(op_get_by_id)
239 DEFINE_OP(op_get_by_val)
240 DEFINE_OP(op_get_by_pname)
241 DEFINE_OP(op_get_global_var)
242 DEFINE_OP(op_get_pnames)
243 DEFINE_OP(op_get_scoped_var)
244 DEFINE_OP(op_instanceof)
245 DEFINE_OP(op_jeq_null)
246 DEFINE_OP(op_jfalse)
247 DEFINE_OP(op_jmp)
248 DEFINE_OP(op_jmp_scopes)
249 DEFINE_OP(op_jneq_null)
250 DEFINE_OP(op_jneq_ptr)
251 DEFINE_OP(op_jnless)
252 DEFINE_OP(op_jless)
253 DEFINE_OP(op_jlesseq)
254 DEFINE_OP(op_jnlesseq)
255 DEFINE_OP(op_jsr)
256 DEFINE_OP(op_jtrue)
257 DEFINE_OP(op_load_varargs)
258 DEFINE_OP(op_loop)
259 DEFINE_OP(op_loop_if_less)
260 DEFINE_OP(op_loop_if_lesseq)
261 DEFINE_OP(op_loop_if_true)
262 DEFINE_OP(op_loop_if_false)
263 DEFINE_OP(op_lshift)
264 DEFINE_OP(op_method_check)
265 DEFINE_OP(op_mod)
266 DEFINE_OP(op_mov)
267 DEFINE_OP(op_mul)
268#if USE(JSVALUE32_64)
269 DEFINE_OP(op_negate)
270#endif
271 DEFINE_OP(op_neq)
272 DEFINE_OP(op_neq_null)
273 DEFINE_OP(op_new_array)
274 DEFINE_OP(op_new_error)
275 DEFINE_OP(op_new_func)
276 DEFINE_OP(op_new_func_exp)
277 DEFINE_OP(op_new_object)
278 DEFINE_OP(op_new_regexp)
279 DEFINE_OP(op_next_pname)
280 DEFINE_OP(op_not)
281 DEFINE_OP(op_nstricteq)
282 DEFINE_OP(op_pop_scope)
283 DEFINE_OP(op_post_dec)
284 DEFINE_OP(op_post_inc)
285 DEFINE_OP(op_pre_dec)
286 DEFINE_OP(op_pre_inc)
287 DEFINE_OP(op_profile_did_call)
288 DEFINE_OP(op_profile_will_call)
289 DEFINE_OP(op_push_new_scope)
290 DEFINE_OP(op_push_scope)
291 DEFINE_OP(op_put_by_id)
292 DEFINE_OP(op_put_by_index)
293 DEFINE_OP(op_put_by_val)
294 DEFINE_OP(op_put_getter)
295 DEFINE_OP(op_put_global_var)
296 DEFINE_OP(op_put_scoped_var)
297 DEFINE_OP(op_put_setter)
298 DEFINE_OP(op_resolve)
299 DEFINE_OP(op_resolve_base)
300 DEFINE_OP(op_resolve_global)
301 DEFINE_OP(op_resolve_global_dynamic)
302 DEFINE_OP(op_resolve_skip)
303 DEFINE_OP(op_resolve_with_base)
304 DEFINE_OP(op_ret)
305 DEFINE_OP(op_rshift)
306 DEFINE_OP(op_urshift)
307 DEFINE_OP(op_sret)
308 DEFINE_OP(op_strcat)
309 DEFINE_OP(op_stricteq)
310 DEFINE_OP(op_sub)
311 DEFINE_OP(op_switch_char)
312 DEFINE_OP(op_switch_imm)
313 DEFINE_OP(op_switch_string)
314 DEFINE_OP(op_tear_off_activation)
315 DEFINE_OP(op_tear_off_arguments)
316 DEFINE_OP(op_throw)
317 DEFINE_OP(op_to_jsnumber)
318 DEFINE_OP(op_to_primitive)
319
320 case op_get_array_length:
321 case op_get_by_id_chain:
322 case op_get_by_id_generic:
323 case op_get_by_id_proto:
324 case op_get_by_id_proto_list:
325 case op_get_by_id_self:
326 case op_get_by_id_self_list:
327 case op_get_by_id_getter_chain:
328 case op_get_by_id_getter_proto:
329 case op_get_by_id_getter_proto_list:
330 case op_get_by_id_getter_self:
331 case op_get_by_id_getter_self_list:
332 case op_get_by_id_custom_chain:
333 case op_get_by_id_custom_proto:
334 case op_get_by_id_custom_proto_list:
335 case op_get_by_id_custom_self:
336 case op_get_by_id_custom_self_list:
337 case op_get_string_length:
338 case op_put_by_id_generic:
339 case op_put_by_id_replace:
340 case op_put_by_id_transition:
341 ASSERT_NOT_REACHED();
342 }
343 }
344
345 ASSERT(m_propertyAccessInstructionIndex == m_codeBlock->numberOfStructureStubInfos());
346 ASSERT(m_callLinkInfoIndex == m_codeBlock->numberOfCallLinkInfos());
347
348#ifndef NDEBUG
349 // Reset this, in order to guard its use with ASSERTs.
350 m_bytecodeIndex = (unsigned)-1;
351#endif
352}
353
354
355void JIT::privateCompileLinkPass()
356{
357 unsigned jmpTableCount = m_jmpTable.size();
358 for (unsigned i = 0; i < jmpTableCount; ++i)
359 m_jmpTable[i].from.linkTo(m_labels[m_jmpTable[i].toBytecodeIndex], this);
360 m_jmpTable.clear();
361}
362
363void JIT::privateCompileSlowCases()
364{
365 Instruction* instructionsBegin = m_codeBlock->instructions().begin();
366
367 m_propertyAccessInstructionIndex = 0;
368 m_globalResolveInfoIndex = 0;
369 m_callLinkInfoIndex = 0;
370
371 for (Vector<SlowCaseEntry>::iterator iter = m_slowCases.begin(); iter != m_slowCases.end();) {
372#if !USE(JSVALUE32_64)
373 killLastResultRegister();
374#endif
375
376 m_bytecodeIndex = iter->to;
377#ifndef NDEBUG
378 unsigned firstTo = m_bytecodeIndex;
379#endif
380 Instruction* currentInstruction = instructionsBegin + m_bytecodeIndex;
381
382 switch (m_interpreter->getOpcodeID(currentInstruction->u.opcode)) {
383 DEFINE_SLOWCASE_OP(op_add)
384 DEFINE_SLOWCASE_OP(op_bitand)
385 DEFINE_SLOWCASE_OP(op_bitnot)
386 DEFINE_SLOWCASE_OP(op_bitor)
387 DEFINE_SLOWCASE_OP(op_bitxor)
388 DEFINE_SLOWCASE_OP(op_call)
389 DEFINE_SLOWCASE_OP(op_call_eval)
390 DEFINE_SLOWCASE_OP(op_call_varargs)
391 DEFINE_SLOWCASE_OP(op_construct)
392 DEFINE_SLOWCASE_OP(op_construct_verify)
393 DEFINE_SLOWCASE_OP(op_convert_this)
394#if !USE(JSVALUE32)
395 DEFINE_SLOWCASE_OP(op_div)
396#endif
397 DEFINE_SLOWCASE_OP(op_eq)
398 DEFINE_SLOWCASE_OP(op_get_by_id)
399 DEFINE_SLOWCASE_OP(op_get_by_val)
400 DEFINE_SLOWCASE_OP(op_get_by_pname)
401 DEFINE_SLOWCASE_OP(op_instanceof)
402 DEFINE_SLOWCASE_OP(op_jfalse)
403 DEFINE_SLOWCASE_OP(op_jnless)
404 DEFINE_SLOWCASE_OP(op_jless)
405 DEFINE_SLOWCASE_OP(op_jlesseq)
406 DEFINE_SLOWCASE_OP(op_jnlesseq)
407 DEFINE_SLOWCASE_OP(op_jtrue)
408 DEFINE_SLOWCASE_OP(op_loop_if_less)
409 DEFINE_SLOWCASE_OP(op_loop_if_lesseq)
410 DEFINE_SLOWCASE_OP(op_loop_if_true)
411 DEFINE_SLOWCASE_OP(op_loop_if_false)
412 DEFINE_SLOWCASE_OP(op_lshift)
413 DEFINE_SLOWCASE_OP(op_method_check)
414 DEFINE_SLOWCASE_OP(op_mod)
415 DEFINE_SLOWCASE_OP(op_mul)
416#if USE(JSVALUE32_64)
417 DEFINE_SLOWCASE_OP(op_negate)
418#endif
419 DEFINE_SLOWCASE_OP(op_neq)
420 DEFINE_SLOWCASE_OP(op_not)
421 DEFINE_SLOWCASE_OP(op_nstricteq)
422 DEFINE_SLOWCASE_OP(op_post_dec)
423 DEFINE_SLOWCASE_OP(op_post_inc)
424 DEFINE_SLOWCASE_OP(op_pre_dec)
425 DEFINE_SLOWCASE_OP(op_pre_inc)
426 DEFINE_SLOWCASE_OP(op_put_by_id)
427 DEFINE_SLOWCASE_OP(op_put_by_val)
428 DEFINE_SLOWCASE_OP(op_resolve_global)
429 DEFINE_SLOWCASE_OP(op_resolve_global_dynamic)
430 DEFINE_SLOWCASE_OP(op_rshift)
431 DEFINE_SLOWCASE_OP(op_urshift)
432 DEFINE_SLOWCASE_OP(op_stricteq)
433 DEFINE_SLOWCASE_OP(op_sub)
434 DEFINE_SLOWCASE_OP(op_to_jsnumber)
435 DEFINE_SLOWCASE_OP(op_to_primitive)
436 default:
437 ASSERT_NOT_REACHED();
438 }
439
440 ASSERT_WITH_MESSAGE(iter == m_slowCases.end() || firstTo != iter->to,"Not enough jumps linked in slow case codegen.");
441 ASSERT_WITH_MESSAGE(firstTo == (iter - 1)->to, "Too many jumps linked in slow case codegen.");
442
443 emitJumpSlowToHot(jump(), 0);
444 }
445
446#if ENABLE(JIT_OPTIMIZE_PROPERTY_ACCESS)
447 ASSERT(m_propertyAccessInstructionIndex == m_codeBlock->numberOfStructureStubInfos());
448#endif
449 ASSERT(m_callLinkInfoIndex == m_codeBlock->numberOfCallLinkInfos());
450
451#ifndef NDEBUG
452 // Reset this, in order to guard its use with ASSERTs.
453 m_bytecodeIndex = (unsigned)-1;
454#endif
455}
456
457JITCode JIT::privateCompile()
458{
459 sampleCodeBlock(m_codeBlock);
460#if ENABLE(OPCODE_SAMPLING)
461 sampleInstruction(m_codeBlock->instructions().begin());
462#endif
463
464 // Could use a pop_m, but would need to offset the following instruction if so.
465 preserveReturnAddressAfterCall(regT2);
466 emitPutToCallFrameHeader(regT2, RegisterFile::ReturnPC);
467
468 Jump slowRegisterFileCheck;
469 Label afterRegisterFileCheck;
470 if (m_codeBlock->codeType() == FunctionCode) {
471 // In the case of a fast linked call, we do not set this up in the caller.
472 emitPutImmediateToCallFrameHeader(m_codeBlock, RegisterFile::CodeBlock);
473
474 peek(regT0, OBJECT_OFFSETOF(JITStackFrame, registerFile) / sizeof (void*));
475 addPtr(Imm32(m_codeBlock->m_numCalleeRegisters * sizeof(Register)), callFrameRegister, regT1);
476
477 slowRegisterFileCheck = branchPtr(Above, regT1, Address(regT0, OBJECT_OFFSETOF(RegisterFile, m_end)));
478 afterRegisterFileCheck = label();
479 }
480
481 privateCompileMainPass();
482 privateCompileLinkPass();
483 privateCompileSlowCases();
484
485 if (m_codeBlock->codeType() == FunctionCode) {
486 slowRegisterFileCheck.link(this);
487 m_bytecodeIndex = 0;
488 JITStubCall(this, cti_register_file_check).call();
489#ifndef NDEBUG
490 m_bytecodeIndex = (unsigned)-1; // Reset this, in order to guard its use with ASSERTs.
491#endif
492 jump(afterRegisterFileCheck);
493 }
494
495 ASSERT(m_jmpTable.isEmpty());
496
497 LinkBuffer patchBuffer(this, m_globalData->executableAllocator.poolForSize(m_assembler.size()));
498
499 // Translate vPC offsets into addresses in JIT generated code, for switch tables.
500 for (unsigned i = 0; i < m_switches.size(); ++i) {
501 SwitchRecord record = m_switches[i];
502 unsigned bytecodeIndex = record.bytecodeIndex;
503
504 if (record.type != SwitchRecord::String) {
505 ASSERT(record.type == SwitchRecord::Immediate || record.type == SwitchRecord::Character);
506 ASSERT(record.jumpTable.simpleJumpTable->branchOffsets.size() == record.jumpTable.simpleJumpTable->ctiOffsets.size());
507
508 record.jumpTable.simpleJumpTable->ctiDefault = patchBuffer.locationOf(m_labels[bytecodeIndex + record.defaultOffset]);
509
510 for (unsigned j = 0; j < record.jumpTable.simpleJumpTable->branchOffsets.size(); ++j) {
511 unsigned offset = record.jumpTable.simpleJumpTable->branchOffsets[j];
512 record.jumpTable.simpleJumpTable->ctiOffsets[j] = offset ? patchBuffer.locationOf(m_labels[bytecodeIndex + offset]) : record.jumpTable.simpleJumpTable->ctiDefault;
513 }
514 } else {
515 ASSERT(record.type == SwitchRecord::String);
516
517 record.jumpTable.stringJumpTable->ctiDefault = patchBuffer.locationOf(m_labels[bytecodeIndex + record.defaultOffset]);
518
519 StringJumpTable::StringOffsetTable::iterator end = record.jumpTable.stringJumpTable->offsetTable.end();
520 for (StringJumpTable::StringOffsetTable::iterator it = record.jumpTable.stringJumpTable->offsetTable.begin(); it != end; ++it) {
521 unsigned offset = it->second.branchOffset;
522 it->second.ctiOffset = offset ? patchBuffer.locationOf(m_labels[bytecodeIndex + offset]) : record.jumpTable.stringJumpTable->ctiDefault;
523 }
524 }
525 }
526
527 for (size_t i = 0; i < m_codeBlock->numberOfExceptionHandlers(); ++i) {
528 HandlerInfo& handler = m_codeBlock->exceptionHandler(i);
529 handler.nativeCode = patchBuffer.locationOf(m_labels[handler.target]);
530 }
531
532 for (Vector<CallRecord>::iterator iter = m_calls.begin(); iter != m_calls.end(); ++iter) {
533 if (iter->to)
534 patchBuffer.link(iter->from, FunctionPtr(iter->to));
535 }
536
537 if (m_codeBlock->hasExceptionInfo()) {
538 m_codeBlock->callReturnIndexVector().reserveCapacity(m_calls.size());
539 for (Vector<CallRecord>::iterator iter = m_calls.begin(); iter != m_calls.end(); ++iter)
540 m_codeBlock->callReturnIndexVector().append(CallReturnOffsetToBytecodeIndex(patchBuffer.returnAddressOffset(iter->from), iter->bytecodeIndex));
541 }
542
543 // Link absolute addresses for jsr
544 for (Vector<JSRInfo>::iterator iter = m_jsrSites.begin(); iter != m_jsrSites.end(); ++iter)
545 patchBuffer.patch(iter->storeLocation, patchBuffer.locationOf(iter->target).executableAddress());
546
547#if ENABLE(JIT_OPTIMIZE_PROPERTY_ACCESS)
548 for (unsigned i = 0; i < m_codeBlock->numberOfStructureStubInfos(); ++i) {
549 StructureStubInfo& info = m_codeBlock->structureStubInfo(i);
550 info.callReturnLocation = patchBuffer.locationOf(m_propertyAccessCompilationInfo[i].callReturnLocation);
551 info.hotPathBegin = patchBuffer.locationOf(m_propertyAccessCompilationInfo[i].hotPathBegin);
552 }
553#endif
554#if ENABLE(JIT_OPTIMIZE_CALL)
555 for (unsigned i = 0; i < m_codeBlock->numberOfCallLinkInfos(); ++i) {
556 CallLinkInfo& info = m_codeBlock->callLinkInfo(i);
557 info.ownerCodeBlock = m_codeBlock;
558 info.callReturnLocation = patchBuffer.locationOfNearCall(m_callStructureStubCompilationInfo[i].callReturnLocation);
559 info.hotPathBegin = patchBuffer.locationOf(m_callStructureStubCompilationInfo[i].hotPathBegin);
560 info.hotPathOther = patchBuffer.locationOfNearCall(m_callStructureStubCompilationInfo[i].hotPathOther);
561 }
562#endif
563 unsigned methodCallCount = m_methodCallCompilationInfo.size();
564 m_codeBlock->addMethodCallLinkInfos(methodCallCount);
565 for (unsigned i = 0; i < methodCallCount; ++i) {
566 MethodCallLinkInfo& info = m_codeBlock->methodCallLinkInfo(i);
567 info.structureLabel = patchBuffer.locationOf(m_methodCallCompilationInfo[i].structureToCompare);
568 info.callReturnLocation = m_codeBlock->structureStubInfo(m_methodCallCompilationInfo[i].propertyAccessIndex).callReturnLocation;
569 }
570
571 return patchBuffer.finalizeCode();
572}
573
574#if !USE(JSVALUE32_64)
575void JIT::emitGetVariableObjectRegister(RegisterID variableObject, int index, RegisterID dst)
576{
577 loadPtr(Address(variableObject, OBJECT_OFFSETOF(JSVariableObject, d)), dst);
578 loadPtr(Address(dst, OBJECT_OFFSETOF(JSVariableObject::JSVariableObjectData, registers)), dst);
579 loadPtr(Address(dst, index * sizeof(Register)), dst);
580}
581
582void JIT::emitPutVariableObjectRegister(RegisterID src, RegisterID variableObject, int index)
583{
584 loadPtr(Address(variableObject, OBJECT_OFFSETOF(JSVariableObject, d)), variableObject);
585 loadPtr(Address(variableObject, OBJECT_OFFSETOF(JSVariableObject::JSVariableObjectData, registers)), variableObject);
586 storePtr(src, Address(variableObject, index * sizeof(Register)));
587}
588#endif
589
590#if ENABLE(JIT_OPTIMIZE_CALL)
591void JIT::unlinkCall(CallLinkInfo* callLinkInfo)
592{
593 // When the JSFunction is deleted the pointer embedded in the instruction stream will no longer be valid
594 // (and, if a new JSFunction happened to be constructed at the same location, we could get a false positive
595 // match). Reset the check so it no longer matches.
596 RepatchBuffer repatchBuffer(callLinkInfo->ownerCodeBlock);
597#if USE(JSVALUE32_64)
598 repatchBuffer.repatch(callLinkInfo->hotPathBegin, 0);
599#else
600 repatchBuffer.repatch(callLinkInfo->hotPathBegin, JSValue::encode(JSValue()));
601#endif
602}
603
604void JIT::linkCall(JSFunction* callee, CodeBlock* callerCodeBlock, CodeBlock* calleeCodeBlock, JITCode& code, CallLinkInfo* callLinkInfo, int callerArgCount, JSGlobalData* globalData)
605{
606 RepatchBuffer repatchBuffer(callerCodeBlock);
607
608 // Currently we only link calls with the exact number of arguments.
609 // If this is a native call calleeCodeBlock is null so the number of parameters is unimportant
610 if (!calleeCodeBlock || (callerArgCount == calleeCodeBlock->m_numParameters)) {
611 ASSERT(!callLinkInfo->isLinked());
612
613 if (calleeCodeBlock)
614 calleeCodeBlock->addCaller(callLinkInfo);
615
616 repatchBuffer.repatch(callLinkInfo->hotPathBegin, callee);
617 repatchBuffer.relink(callLinkInfo->hotPathOther, code.addressForCall());
618 }
619
620 // patch the call so we do not continue to try to link.
621 repatchBuffer.relink(callLinkInfo->callReturnLocation, globalData->jitStubs.ctiVirtualCall());
622}
623#endif // ENABLE(JIT_OPTIMIZE_CALL)
624
625} // namespace JSC
626
627#endif // ENABLE(JIT)
Note: See TracBrowser for help on using the repository browser.