1 // Copyright 2010 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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.
28 #ifndef V8_ARM_CODEGEN_ARM_H_
29 #define V8_ARM_CODEGEN_ARM_H_
32 #include "code-stubs-arm.h"
38 // Forward declarations
39 class CompilationInfo;
42 class RegisterAllocator;
45 enum InitState { CONST_INIT, NOT_CONST_INIT };
46 enum TypeofState { INSIDE_TYPEOF, NOT_INSIDE_TYPEOF };
47 enum GenerateInlineSmi { DONT_GENERATE_INLINE_SMI, GENERATE_INLINE_SMI };
48 enum WriteBarrierCharacter { UNLIKELY_SMI, LIKELY_SMI, NEVER_NEWSPACE };
51 // -------------------------------------------------------------------------
54 // A reference is a C++ stack-allocated object that puts a
55 // reference on the virtual frame. The reference may be consumed
56 // by GetValue, TakeValue, SetValue, and Codegen::UnloadReference.
57 // When the lifetime (scope) of a valid reference ends, it must have
58 // been consumed, and be in state UNLOADED.
59 class Reference BASE_EMBEDDED {
61 // The values of the types is important, see size().
62 enum Type { UNLOADED = -2, ILLEGAL = -1, SLOT = 0, NAMED = 1, KEYED = 2 };
63 Reference(CodeGenerator* cgen,
64 Expression* expression,
65 bool persist_after_get = false);
68 Expression* expression() const { return expression_; }
69 Type type() const { return type_; }
70 void set_type(Type value) {
71 ASSERT_EQ(ILLEGAL, type_);
76 ASSERT_NE(ILLEGAL, type_);
77 ASSERT_NE(UNLOADED, type_);
80 // The size the reference takes up on the stack.
82 return (type_ < SLOT) ? 0 : type_;
85 bool is_illegal() const { return type_ == ILLEGAL; }
86 bool is_slot() const { return type_ == SLOT; }
87 bool is_property() const { return type_ == NAMED || type_ == KEYED; }
88 bool is_unloaded() const { return type_ == UNLOADED; }
90 // Return the name. Only valid for named property references.
91 Handle<String> GetName();
93 // Generate code to push the value of the reference on top of the
94 // expression stack. The reference is expected to be already on top of
95 // the expression stack, and it is consumed by the call unless the
96 // reference is for a compound assignment.
97 // If the reference is not consumed, it is left in place under its value.
100 // Generate code to store the value on top of the expression stack in the
101 // reference. The reference is expected to be immediately below the value
102 // on the expression stack. The value is stored in the location specified
103 // by the reference, and is left on top of the stack, after the reference
104 // is popped from beneath it (unloaded).
105 void SetValue(InitState init_state, WriteBarrierCharacter wb);
107 // This is in preparation for something that uses the reference on the stack.
108 // If we need this reference afterwards get then dup it now. Otherwise mark
110 inline void DupIfPersist();
113 CodeGenerator* cgen_;
114 Expression* expression_;
116 // Keep the reference on the stack after get, so it can be used by set later.
117 bool persist_after_get_;
121 // -------------------------------------------------------------------------
122 // Code generation state
124 // The state is passed down the AST by the code generator (and back up, in
125 // the form of the state of the label pair). It is threaded through the
126 // call stack. Constructing a state implicitly pushes it on the owning code
127 // generator's stack of states, and destroying one implicitly pops it.
129 class CodeGenState BASE_EMBEDDED {
131 // Create an initial code generator state. Destroying the initial state
132 // leaves the code generator with a NULL state.
133 explicit CodeGenState(CodeGenerator* owner);
135 // Destroy a code generator state and restore the owning code generator's
137 virtual ~CodeGenState();
139 virtual JumpTarget* true_target() const { return NULL; }
140 virtual JumpTarget* false_target() const { return NULL; }
143 inline CodeGenerator* owner() { return owner_; }
144 inline CodeGenState* previous() const { return previous_; }
147 CodeGenerator* owner_;
148 CodeGenState* previous_;
152 class ConditionCodeGenState : public CodeGenState {
154 // Create a code generator state based on a code generator's current
155 // state. The new state has its own pair of branch labels.
156 ConditionCodeGenState(CodeGenerator* owner,
157 JumpTarget* true_target,
158 JumpTarget* false_target);
160 virtual JumpTarget* true_target() const { return true_target_; }
161 virtual JumpTarget* false_target() const { return false_target_; }
164 JumpTarget* true_target_;
165 JumpTarget* false_target_;
169 class TypeInfoCodeGenState : public CodeGenState {
171 TypeInfoCodeGenState(CodeGenerator* owner,
174 ~TypeInfoCodeGenState();
176 virtual JumpTarget* true_target() const { return previous()->true_target(); }
177 virtual JumpTarget* false_target() const {
178 return previous()->false_target();
183 TypeInfo old_type_info_;
187 // -------------------------------------------------------------------------
188 // Arguments allocation mode
190 enum ArgumentsAllocationMode {
191 NO_ARGUMENTS_ALLOCATION,
192 EAGER_ARGUMENTS_ALLOCATION,
193 LAZY_ARGUMENTS_ALLOCATION
197 // Different nop operations are used by the code generator to detect certain
198 // states of the generated code.
199 enum NopMarkerTypes {
201 PROPERTY_ACCESS_INLINED
205 // -------------------------------------------------------------------------
208 class CodeGenerator: public AstVisitor {
210 static bool MakeCode(CompilationInfo* info);
212 // Printing of AST, etc. as requested by flags.
213 static void MakeCodePrologue(CompilationInfo* info);
215 // Allocate and install the code.
216 static Handle<Code> MakeCodeEpilogue(MacroAssembler* masm,
218 CompilationInfo* info);
220 #ifdef ENABLE_LOGGING_AND_PROFILING
221 static bool ShouldGenerateLog(Expression* type);
224 static void SetFunctionInfo(Handle<JSFunction> fun,
225 FunctionLiteral* lit,
227 Handle<Script> script);
229 static bool RecordPositions(MacroAssembler* masm,
231 bool right_here = false);
234 MacroAssembler* masm() { return masm_; }
235 VirtualFrame* frame() const { return frame_; }
236 inline Handle<Script> script();
238 bool has_valid_frame() const { return frame_ != NULL; }
240 // Set the virtual frame to be new_frame, with non-frame register
241 // reference counts given by non_frame_registers. The non-frame
242 // register reference counts of the old frame are returned in
243 // non_frame_registers.
244 void SetFrame(VirtualFrame* new_frame, RegisterFile* non_frame_registers);
248 RegisterAllocator* allocator() const { return allocator_; }
250 CodeGenState* state() { return state_; }
251 void set_state(CodeGenState* state) { state_ = state; }
253 TypeInfo type_info(Slot* slot) {
254 int index = NumberOfSlot(slot);
255 if (index == kInvalidSlotNumber) return TypeInfo::Unknown();
256 return (*type_info_)[index];
259 TypeInfo set_type_info(Slot* slot, TypeInfo info) {
260 int index = NumberOfSlot(slot);
261 ASSERT(index >= kInvalidSlotNumber);
262 if (index != kInvalidSlotNumber) {
263 TypeInfo previous_value = (*type_info_)[index];
264 (*type_info_)[index] = info;
265 return previous_value;
267 return TypeInfo::Unknown();
270 void AddDeferred(DeferredCode* code) { deferred_.Add(code); }
272 // Constants related to patching of inlined load/store.
273 static int GetInlinedKeyedLoadInstructionsAfterPatch() {
274 return FLAG_debug_code ? 32 : 13;
276 static const int kInlinedKeyedStoreInstructionsAfterPatch = 5;
277 static int GetInlinedNamedStoreInstructionsAfterPatch() {
278 ASSERT(inlined_write_barrier_size_ != -1);
279 return inlined_write_barrier_size_ + 4;
283 // Type of a member function that generates inline code for a native function.
284 typedef void (CodeGenerator::*InlineFunctionGenerator)
285 (ZoneList<Expression*>*);
287 static const InlineFunctionGenerator kInlineFunctionGenerators[];
289 // Construction/Destruction
290 explicit CodeGenerator(MacroAssembler* masm);
293 inline bool is_eval();
294 inline Scope* scope();
296 // Generating deferred code.
297 void ProcessDeferred();
299 static const int kInvalidSlotNumber = -1;
301 int NumberOfSlot(Slot* slot);
304 bool has_cc() const { return cc_reg_ != al; }
305 JumpTarget* true_target() const { return state_->true_target(); }
306 JumpTarget* false_target() const { return state_->false_target(); }
308 // Track loop nesting level.
309 int loop_nesting() const { return loop_nesting_; }
310 void IncrementLoopNesting() { loop_nesting_++; }
311 void DecrementLoopNesting() { loop_nesting_--; }
314 void VisitStatements(ZoneList<Statement*>* statements);
316 #define DEF_VISIT(type) \
317 void Visit##type(type* node);
318 AST_NODE_LIST(DEF_VISIT)
321 // Main code generation function
322 void Generate(CompilationInfo* info);
324 // Generate the return sequence code. Should be called no more than
325 // once per compiled function, immediately after binding the return
326 // target (which can not be done more than once). The return value should
328 void GenerateReturnSequence();
330 // Returns the arguments allocation mode.
331 ArgumentsAllocationMode ArgumentsMode();
333 // Store the arguments object and allocate it if necessary.
334 void StoreArgumentsObject(bool initial);
336 // The following are used by class Reference.
337 void LoadReference(Reference* ref);
338 void UnloadReference(Reference* ref);
340 MemOperand SlotOperand(Slot* slot, Register tmp);
342 MemOperand ContextSlotOperandCheckExtensions(Slot* slot,
348 void LoadCondition(Expression* x,
349 JumpTarget* true_target,
350 JumpTarget* false_target,
352 void Load(Expression* expr);
354 void LoadGlobalReceiver(Register scratch);
356 // Read a value from a slot and leave it on top of the expression stack.
357 void LoadFromSlot(Slot* slot, TypeofState typeof_state);
358 void LoadFromSlotCheckForArguments(Slot* slot, TypeofState state);
360 // Store the value on top of the stack to a slot.
361 void StoreToSlot(Slot* slot, InitState init_state);
363 // Support for compiling assignment expressions.
364 void EmitSlotAssignment(Assignment* node);
365 void EmitNamedPropertyAssignment(Assignment* node);
366 void EmitKeyedPropertyAssignment(Assignment* node);
368 // Load a named property, returning it in r0. The receiver is passed on the
369 // stack, and remains there.
370 void EmitNamedLoad(Handle<String> name, bool is_contextual);
372 // Store to a named property. If the store is contextual, value is passed on
373 // the frame and consumed. Otherwise, receiver and value are passed on the
374 // frame and consumed. The result is returned in r0.
375 void EmitNamedStore(Handle<String> name, bool is_contextual);
377 // Load a keyed property, leaving it in r0. The receiver and key are
378 // passed on the stack, and remain there.
379 void EmitKeyedLoad();
381 // Store a keyed property. Key and receiver are on the stack and the value is
382 // in r0. Result is returned in r0.
383 void EmitKeyedStore(StaticType* key_type, WriteBarrierCharacter wb_info);
385 void LoadFromGlobalSlotCheckExtensions(Slot* slot,
386 TypeofState typeof_state,
389 // Support for loading from local/global variables and arguments
390 // whose location is known unless they are shadowed by
391 // eval-introduced bindings. Generates no code for unsupported slot
392 // types and therefore expects to fall through to the slow jump target.
393 void EmitDynamicLoadFromSlotFastCase(Slot* slot,
394 TypeofState typeof_state,
398 // Special code for typeof expressions: Unfortunately, we must
399 // be careful when loading the expression in 'typeof'
400 // expressions. We are not allowed to throw reference errors for
401 // non-existing properties of the global object, so we must make it
402 // look like an explicit property access, instead of an access
403 // through the context chain.
404 void LoadTypeofExpression(Expression* x);
406 void ToBoolean(JumpTarget* true_target, JumpTarget* false_target);
408 // Generate code that computes a shortcutting logical operation.
409 void GenerateLogicalBooleanOperation(BinaryOperation* node);
411 void GenericBinaryOperation(Token::Value op,
412 OverwriteMode overwrite_mode,
413 GenerateInlineSmi inline_smi,
415 GenericBinaryOpStub::kUnknownIntValue);
416 void Comparison(Condition cc,
419 bool strict = false);
421 void SmiOperation(Token::Value op,
422 Handle<Object> value,
426 void CallWithArguments(ZoneList<Expression*>* arguments,
427 CallFunctionFlags flags,
430 // An optimized implementation of expressions of the form
431 // x.apply(y, arguments). We call x the applicand and y the receiver.
432 // The optimization avoids allocating an arguments object if possible.
433 void CallApplyLazy(Expression* applicand,
434 Expression* receiver,
435 VariableProxy* arguments,
439 void Branch(bool if_true, JumpTarget* target);
442 bool CheckForInlineRuntimeCall(CallRuntime* node);
444 static Handle<Code> ComputeLazyCompile(int argc);
445 void ProcessDeclarations(ZoneList<Declaration*>* declarations);
447 // Declare global variables and functions in the given array of
449 void DeclareGlobals(Handle<FixedArray> pairs);
451 // Instantiate the function based on the shared function info.
452 void InstantiateFunction(Handle<SharedFunctionInfo> function_info,
455 // Support for type checks.
456 void GenerateIsSmi(ZoneList<Expression*>* args);
457 void GenerateIsNonNegativeSmi(ZoneList<Expression*>* args);
458 void GenerateIsArray(ZoneList<Expression*>* args);
459 void GenerateIsRegExp(ZoneList<Expression*>* args);
460 void GenerateIsObject(ZoneList<Expression*>* args);
461 void GenerateIsSpecObject(ZoneList<Expression*>* args);
462 void GenerateIsFunction(ZoneList<Expression*>* args);
463 void GenerateIsUndetectableObject(ZoneList<Expression*>* args);
464 void GenerateIsStringWrapperSafeForDefaultValueOf(
465 ZoneList<Expression*>* args);
467 // Support for construct call checks.
468 void GenerateIsConstructCall(ZoneList<Expression*>* args);
470 // Support for arguments.length and arguments[?].
471 void GenerateArgumentsLength(ZoneList<Expression*>* args);
472 void GenerateArguments(ZoneList<Expression*>* args);
474 // Support for accessing the class and value fields of an object.
475 void GenerateClassOf(ZoneList<Expression*>* args);
476 void GenerateValueOf(ZoneList<Expression*>* args);
477 void GenerateSetValueOf(ZoneList<Expression*>* args);
479 // Fast support for charCodeAt(n).
480 void GenerateStringCharCodeAt(ZoneList<Expression*>* args);
482 // Fast support for string.charAt(n) and string[n].
483 void GenerateStringCharFromCode(ZoneList<Expression*>* args);
485 // Fast support for string.charAt(n) and string[n].
486 void GenerateStringCharAt(ZoneList<Expression*>* args);
488 // Fast support for object equality testing.
489 void GenerateObjectEquals(ZoneList<Expression*>* args);
491 void GenerateLog(ZoneList<Expression*>* args);
493 // Fast support for Math.random().
494 void GenerateRandomHeapNumber(ZoneList<Expression*>* args);
496 // Fast support for StringAdd.
497 void GenerateStringAdd(ZoneList<Expression*>* args);
499 // Fast support for SubString.
500 void GenerateSubString(ZoneList<Expression*>* args);
502 // Fast support for StringCompare.
503 void GenerateStringCompare(ZoneList<Expression*>* args);
505 // Support for direct calls from JavaScript to native RegExp code.
506 void GenerateRegExpExec(ZoneList<Expression*>* args);
508 void GenerateRegExpConstructResult(ZoneList<Expression*>* args);
510 // Support for fast native caches.
511 void GenerateGetFromCache(ZoneList<Expression*>* args);
513 // Fast support for number to string.
514 void GenerateNumberToString(ZoneList<Expression*>* args);
516 // Fast swapping of elements.
517 void GenerateSwapElements(ZoneList<Expression*>* args);
519 // Fast call for custom callbacks.
520 void GenerateCallFunction(ZoneList<Expression*>* args);
522 // Fast call to math functions.
523 void GenerateMathPow(ZoneList<Expression*>* args);
524 void GenerateMathSin(ZoneList<Expression*>* args);
525 void GenerateMathCos(ZoneList<Expression*>* args);
526 void GenerateMathSqrt(ZoneList<Expression*>* args);
528 void GenerateIsRegExpEquivalent(ZoneList<Expression*>* args);
530 void GenerateHasCachedArrayIndex(ZoneList<Expression*>* args);
531 void GenerateGetCachedArrayIndex(ZoneList<Expression*>* args);
532 void GenerateFastAsciiArrayJoin(ZoneList<Expression*>* args);
534 // Simple condition analysis.
535 enum ConditionAnalysis {
540 ConditionAnalysis AnalyzeCondition(Expression* cond);
542 // Methods used to indicate which source code is generated for. Source
543 // positions are collected by the assembler and emitted with the relocation
545 void CodeForFunctionPosition(FunctionLiteral* fun);
546 void CodeForReturnPosition(FunctionLiteral* fun);
547 void CodeForStatementPosition(Statement* node);
548 void CodeForDoWhileConditionPosition(DoWhileStatement* stmt);
549 void CodeForSourcePosition(int pos);
552 // True if the registers are valid for entry to a block.
553 bool HasValidEntryRegisters();
556 List<DeferredCode*> deferred_;
559 MacroAssembler* masm_; // to generate code
561 CompilationInfo* info_;
563 // Code generation state
564 VirtualFrame* frame_;
565 RegisterAllocator* allocator_;
567 CodeGenState* state_;
570 Vector<TypeInfo>* type_info_;
573 BreakTarget function_return_;
575 // True if the function return is shadowed (ie, jumping to the target
576 // function_return_ does not jump to the true function return, but rather
577 // to some unlinking code).
578 bool function_return_is_shadowed_;
580 // Size of inlined write barriers generated by EmitNamedStore.
581 static int inlined_write_barrier_size_;
583 friend class VirtualFrame;
584 friend class JumpTarget;
585 friend class Reference;
586 friend class FastCodeGenerator;
587 friend class FullCodeGenerator;
588 friend class FullCodeGenSyntaxChecker;
590 DISALLOW_COPY_AND_ASSIGN(CodeGenerator);
594 } } // namespace v8::internal
596 #endif // V8_ARM_CODEGEN_ARM_H_