blob: a432c13f158d7515f7e7aba0fd89173a912ff0c3 [file] [log] [blame]
Leon Clarked91b9f72010-01-27 17:25:45 +00001// Copyright 2010 the V8 project authors. All rights reserved.
Steve Blocka7e24c12009-10-30 11:49:00 +00002// Redistribution and use in source and binary forms, with or without
3// modification, are permitted provided that the following conditions are
4// met:
5//
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.
15//
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.
27
28#ifndef V8_IA32_CODEGEN_IA32_H_
29#define V8_IA32_CODEGEN_IA32_H_
30
Kristian Monsen25f61362010-05-21 11:50:48 +010031#include "ast.h"
Steve Block6ded16b2010-05-10 14:33:55 +010032#include "ic-inl.h"
Kristian Monsen25f61362010-05-21 11:50:48 +010033#include "jump-target-heavy.h"
Steve Block6ded16b2010-05-10 14:33:55 +010034
Steve Blocka7e24c12009-10-30 11:49:00 +000035namespace v8 {
36namespace internal {
37
38// Forward declarations
Leon Clarke4515c472010-02-03 11:58:03 +000039class CompilationInfo;
Steve Blocka7e24c12009-10-30 11:49:00 +000040class DeferredCode;
Ben Murdoch7f4d5bd2010-06-15 11:15:29 +010041class FrameRegisterState;
Steve Blocka7e24c12009-10-30 11:49:00 +000042class RegisterAllocator;
43class RegisterFile;
Ben Murdoch7f4d5bd2010-06-15 11:15:29 +010044class RuntimeCallHelper;
Steve Blocka7e24c12009-10-30 11:49:00 +000045
46enum InitState { CONST_INIT, NOT_CONST_INIT };
47enum TypeofState { INSIDE_TYPEOF, NOT_INSIDE_TYPEOF };
48
49
50// -------------------------------------------------------------------------
51// Reference support
52
Leon Clarked91b9f72010-01-27 17:25:45 +000053// A reference is a C++ stack-allocated object that puts a
54// reference on the virtual frame. The reference may be consumed
Kristian Monsen25f61362010-05-21 11:50:48 +010055// by GetValue, TakeValue and SetValue.
Leon Clarked91b9f72010-01-27 17:25:45 +000056// When the lifetime (scope) of a valid reference ends, it must have
57// been consumed, and be in state UNLOADED.
Steve Blocka7e24c12009-10-30 11:49:00 +000058class Reference BASE_EMBEDDED {
59 public:
60 // The values of the types is important, see size().
Leon Clarked91b9f72010-01-27 17:25:45 +000061 enum Type { UNLOADED = -2, ILLEGAL = -1, SLOT = 0, NAMED = 1, KEYED = 2 };
62 Reference(CodeGenerator* cgen,
63 Expression* expression,
64 bool persist_after_get = false);
Steve Blocka7e24c12009-10-30 11:49:00 +000065 ~Reference();
66
67 Expression* expression() const { return expression_; }
68 Type type() const { return type_; }
69 void set_type(Type value) {
Leon Clarked91b9f72010-01-27 17:25:45 +000070 ASSERT_EQ(ILLEGAL, type_);
Steve Blocka7e24c12009-10-30 11:49:00 +000071 type_ = value;
72 }
73
Leon Clarked91b9f72010-01-27 17:25:45 +000074 void set_unloaded() {
75 ASSERT_NE(ILLEGAL, type_);
76 ASSERT_NE(UNLOADED, type_);
77 type_ = UNLOADED;
78 }
Steve Blocka7e24c12009-10-30 11:49:00 +000079 // The size the reference takes up on the stack.
Leon Clarked91b9f72010-01-27 17:25:45 +000080 int size() const {
81 return (type_ < SLOT) ? 0 : type_;
82 }
Steve Blocka7e24c12009-10-30 11:49:00 +000083
84 bool is_illegal() const { return type_ == ILLEGAL; }
85 bool is_slot() const { return type_ == SLOT; }
86 bool is_property() const { return type_ == NAMED || type_ == KEYED; }
Leon Clarked91b9f72010-01-27 17:25:45 +000087 bool is_unloaded() const { return type_ == UNLOADED; }
Steve Blocka7e24c12009-10-30 11:49:00 +000088
89 // Return the name. Only valid for named property references.
90 Handle<String> GetName();
91
92 // Generate code to push the value of the reference on top of the
93 // expression stack. The reference is expected to be already on top of
Leon Clarked91b9f72010-01-27 17:25:45 +000094 // the expression stack, and it is consumed by the call unless the
95 // reference is for a compound assignment.
96 // If the reference is not consumed, it is left in place under its value.
Steve Blockd0582a62009-12-15 09:54:21 +000097 void GetValue();
Steve Blocka7e24c12009-10-30 11:49:00 +000098
99 // Like GetValue except that the slot is expected to be written to before
Leon Clarked91b9f72010-01-27 17:25:45 +0000100 // being read from again. The value of the reference may be invalidated,
Steve Blocka7e24c12009-10-30 11:49:00 +0000101 // causing subsequent attempts to read it to fail.
Steve Blockd0582a62009-12-15 09:54:21 +0000102 void TakeValue();
Steve Blocka7e24c12009-10-30 11:49:00 +0000103
104 // Generate code to store the value on top of the expression stack in the
105 // reference. The reference is expected to be immediately below the value
Leon Clarked91b9f72010-01-27 17:25:45 +0000106 // on the expression stack. The value is stored in the location specified
107 // by the reference, and is left on top of the stack, after the reference
108 // is popped from beneath it (unloaded).
Steve Blocka7e24c12009-10-30 11:49:00 +0000109 void SetValue(InitState init_state);
110
111 private:
112 CodeGenerator* cgen_;
113 Expression* expression_;
114 Type type_;
Leon Clarked91b9f72010-01-27 17:25:45 +0000115 // Keep the reference on the stack after get, so it can be used by set later.
116 bool persist_after_get_;
Steve Blocka7e24c12009-10-30 11:49:00 +0000117};
118
119
120// -------------------------------------------------------------------------
121// Control destinations.
122
123// A control destination encapsulates a pair of jump targets and a
124// flag indicating which one is the preferred fall-through. The
125// preferred fall-through must be unbound, the other may be already
126// bound (ie, a backward target).
127//
128// The true and false targets may be jumped to unconditionally or
129// control may split conditionally. Unconditional jumping and
130// splitting should be emitted in tail position (as the last thing
131// when compiling an expression) because they can cause either label
132// to be bound or the non-fall through to be jumped to leaving an
133// invalid virtual frame.
134//
135// The labels in the control destination can be extracted and
136// manipulated normally without affecting the state of the
137// destination.
138
139class ControlDestination BASE_EMBEDDED {
140 public:
141 ControlDestination(JumpTarget* true_target,
142 JumpTarget* false_target,
143 bool true_is_fall_through)
144 : true_target_(true_target),
145 false_target_(false_target),
146 true_is_fall_through_(true_is_fall_through),
147 is_used_(false) {
148 ASSERT(true_is_fall_through ? !true_target->is_bound()
149 : !false_target->is_bound());
150 }
151
152 // Accessors for the jump targets. Directly jumping or branching to
153 // or binding the targets will not update the destination's state.
154 JumpTarget* true_target() const { return true_target_; }
155 JumpTarget* false_target() const { return false_target_; }
156
157 // True if the the destination has been jumped to unconditionally or
158 // control has been split to both targets. This predicate does not
159 // test whether the targets have been extracted and manipulated as
160 // raw jump targets.
161 bool is_used() const { return is_used_; }
162
163 // True if the destination is used and the true target (respectively
164 // false target) was the fall through. If the target is backward,
165 // "fall through" included jumping unconditionally to it.
166 bool true_was_fall_through() const {
167 return is_used_ && true_is_fall_through_;
168 }
169
170 bool false_was_fall_through() const {
171 return is_used_ && !true_is_fall_through_;
172 }
173
174 // Emit a branch to one of the true or false targets, and bind the
175 // other target. Because this binds the fall-through target, it
176 // should be emitted in tail position (as the last thing when
177 // compiling an expression).
178 void Split(Condition cc) {
179 ASSERT(!is_used_);
180 if (true_is_fall_through_) {
181 false_target_->Branch(NegateCondition(cc));
182 true_target_->Bind();
183 } else {
184 true_target_->Branch(cc);
185 false_target_->Bind();
186 }
187 is_used_ = true;
188 }
189
190 // Emit an unconditional jump in tail position, to the true target
191 // (if the argument is true) or the false target. The "jump" will
192 // actually bind the jump target if it is forward, jump to it if it
193 // is backward.
194 void Goto(bool where) {
195 ASSERT(!is_used_);
196 JumpTarget* target = where ? true_target_ : false_target_;
197 if (target->is_bound()) {
198 target->Jump();
199 } else {
200 target->Bind();
201 }
202 is_used_ = true;
203 true_is_fall_through_ = where;
204 }
205
206 // Mark this jump target as used as if Goto had been called, but
207 // without generating a jump or binding a label (the control effect
208 // should have already happened). This is used when the left
209 // subexpression of the short-circuit boolean operators are
210 // compiled.
211 void Use(bool where) {
212 ASSERT(!is_used_);
213 ASSERT((where ? true_target_ : false_target_)->is_bound());
214 is_used_ = true;
215 true_is_fall_through_ = where;
216 }
217
218 // Swap the true and false targets but keep the same actual label as
219 // the fall through. This is used when compiling negated
220 // expressions, where we want to swap the targets but preserve the
221 // state.
222 void Invert() {
223 JumpTarget* temp_target = true_target_;
224 true_target_ = false_target_;
225 false_target_ = temp_target;
226
227 true_is_fall_through_ = !true_is_fall_through_;
228 }
229
230 private:
231 // True and false jump targets.
232 JumpTarget* true_target_;
233 JumpTarget* false_target_;
234
235 // Before using the destination: true if the true target is the
236 // preferred fall through, false if the false target is. After
237 // using the destination: true if the true target was actually used
238 // as the fall through, false if the false target was.
239 bool true_is_fall_through_;
240
241 // True if the Split or Goto functions have been called.
242 bool is_used_;
243};
244
245
246// -------------------------------------------------------------------------
247// Code generation state
248
249// The state is passed down the AST by the code generator (and back up, in
250// the form of the state of the jump target pair). It is threaded through
251// the call stack. Constructing a state implicitly pushes it on the owning
252// code generator's stack of states, and destroying one implicitly pops it.
253//
254// The code generator state is only used for expressions, so statements have
255// the initial state.
256
257class CodeGenState BASE_EMBEDDED {
258 public:
259 // Create an initial code generator state. Destroying the initial state
260 // leaves the code generator with a NULL state.
261 explicit CodeGenState(CodeGenerator* owner);
262
263 // Create a code generator state based on a code generator's current
Steve Blockd0582a62009-12-15 09:54:21 +0000264 // state. The new state has its own control destination.
265 CodeGenState(CodeGenerator* owner, ControlDestination* destination);
Steve Blocka7e24c12009-10-30 11:49:00 +0000266
267 // Destroy a code generator state and restore the owning code generator's
268 // previous state.
269 ~CodeGenState();
270
271 // Accessors for the state.
Steve Blocka7e24c12009-10-30 11:49:00 +0000272 ControlDestination* destination() const { return destination_; }
273
274 private:
275 // The owning code generator.
276 CodeGenerator* owner_;
277
Steve Blocka7e24c12009-10-30 11:49:00 +0000278 // A control destination in case the expression has a control-flow
279 // effect.
280 ControlDestination* destination_;
281
282 // The previous state of the owning code generator, restored when
283 // this state is destroyed.
284 CodeGenState* previous_;
285};
286
287
288// -------------------------------------------------------------------------
Leon Clarkee46be812010-01-19 14:06:41 +0000289// Arguments allocation mode.
Steve Blocka7e24c12009-10-30 11:49:00 +0000290
291enum ArgumentsAllocationMode {
292 NO_ARGUMENTS_ALLOCATION,
293 EAGER_ARGUMENTS_ALLOCATION,
294 LAZY_ARGUMENTS_ALLOCATION
295};
296
297
298// -------------------------------------------------------------------------
299// CodeGenerator
300
301class CodeGenerator: public AstVisitor {
302 public:
303 // Takes a function literal, generates code for it. This function should only
304 // be called by compiler.cc.
Andrei Popescu31002712010-02-23 13:46:05 +0000305 static Handle<Code> MakeCode(CompilationInfo* info);
Steve Blocka7e24c12009-10-30 11:49:00 +0000306
Steve Block3ce2e202009-11-05 08:53:23 +0000307 // Printing of AST, etc. as requested by flags.
Andrei Popescu31002712010-02-23 13:46:05 +0000308 static void MakeCodePrologue(CompilationInfo* info);
Steve Block3ce2e202009-11-05 08:53:23 +0000309
310 // Allocate and install the code.
Andrei Popescu31002712010-02-23 13:46:05 +0000311 static Handle<Code> MakeCodeEpilogue(MacroAssembler* masm,
Steve Block3ce2e202009-11-05 08:53:23 +0000312 Code::Flags flags,
Andrei Popescu31002712010-02-23 13:46:05 +0000313 CompilationInfo* info);
Steve Block3ce2e202009-11-05 08:53:23 +0000314
Steve Blocka7e24c12009-10-30 11:49:00 +0000315#ifdef ENABLE_LOGGING_AND_PROFILING
316 static bool ShouldGenerateLog(Expression* type);
317#endif
318
Ben Murdoch7f4d5bd2010-06-15 11:15:29 +0100319 static bool RecordPositions(MacroAssembler* masm,
320 int pos,
321 bool right_here = false);
Steve Block3ce2e202009-11-05 08:53:23 +0000322
Steve Blocka7e24c12009-10-30 11:49:00 +0000323 // Accessors
324 MacroAssembler* masm() { return masm_; }
Steve Blocka7e24c12009-10-30 11:49:00 +0000325 VirtualFrame* frame() const { return frame_; }
Andrei Popescu31002712010-02-23 13:46:05 +0000326 inline Handle<Script> script();
Steve Blocka7e24c12009-10-30 11:49:00 +0000327
328 bool has_valid_frame() const { return frame_ != NULL; }
329
330 // Set the virtual frame to be new_frame, with non-frame register
331 // reference counts given by non_frame_registers. The non-frame
332 // register reference counts of the old frame are returned in
333 // non_frame_registers.
334 void SetFrame(VirtualFrame* new_frame, RegisterFile* non_frame_registers);
335
336 void DeleteFrame();
337
338 RegisterAllocator* allocator() const { return allocator_; }
339
340 CodeGenState* state() { return state_; }
341 void set_state(CodeGenState* state) { state_ = state; }
342
343 void AddDeferred(DeferredCode* code) { deferred_.Add(code); }
344
345 bool in_spilled_code() const { return in_spilled_code_; }
346 void set_in_spilled_code(bool flag) { in_spilled_code_ = flag; }
347
Steve Block6ded16b2010-05-10 14:33:55 +0100348 // If the name is an inline runtime function call return the number of
349 // expected arguments. Otherwise return -1.
350 static int InlineRuntimeCallArgumentsCount(Handle<String> name);
351
Kristian Monsen25f61362010-05-21 11:50:48 +0100352 // Return a position of the element at |index_as_smi| + |additional_offset|
353 // in FixedArray pointer to which is held in |array|. |index_as_smi| is Smi.
354 static Operand FixedArrayElementOperand(Register array,
355 Register index_as_smi,
356 int additional_offset = 0) {
357 int offset = FixedArray::kHeaderSize + additional_offset * kPointerSize;
358 return FieldOperand(array, index_as_smi, times_half_pointer_size, offset);
359 }
360
Steve Blocka7e24c12009-10-30 11:49:00 +0000361 private:
362 // Construction/Destruction
Andrei Popescu31002712010-02-23 13:46:05 +0000363 explicit CodeGenerator(MacroAssembler* masm);
Steve Blocka7e24c12009-10-30 11:49:00 +0000364
365 // Accessors
Andrei Popescu31002712010-02-23 13:46:05 +0000366 inline bool is_eval();
Steve Block6ded16b2010-05-10 14:33:55 +0100367 inline Scope* scope();
Steve Blocka7e24c12009-10-30 11:49:00 +0000368
369 // Generating deferred code.
370 void ProcessDeferred();
371
372 // State
Steve Blocka7e24c12009-10-30 11:49:00 +0000373 ControlDestination* destination() const { return state_->destination(); }
374
Steve Block6ded16b2010-05-10 14:33:55 +0100375 // Control of side-effect-free int32 expression compilation.
376 bool in_safe_int32_mode() { return in_safe_int32_mode_; }
377 void set_in_safe_int32_mode(bool value) { in_safe_int32_mode_ = value; }
378 bool safe_int32_mode_enabled() {
379 return FLAG_safe_int32_compiler && safe_int32_mode_enabled_;
380 }
381 void set_safe_int32_mode_enabled(bool value) {
382 safe_int32_mode_enabled_ = value;
383 }
384 void set_unsafe_bailout(BreakTarget* unsafe_bailout) {
385 unsafe_bailout_ = unsafe_bailout;
386 }
387
388 // Take the Result that is an untagged int32, and convert it to a tagged
389 // Smi or HeapNumber. Remove the untagged_int32 flag from the result.
390 void ConvertInt32ResultToNumber(Result* value);
391 void ConvertInt32ResultToSmi(Result* value);
392
Steve Blocka7e24c12009-10-30 11:49:00 +0000393 // Track loop nesting level.
394 int loop_nesting() const { return loop_nesting_; }
395 void IncrementLoopNesting() { loop_nesting_++; }
396 void DecrementLoopNesting() { loop_nesting_--; }
397
398 // Node visitors.
399 void VisitStatements(ZoneList<Statement*>* statements);
400
401#define DEF_VISIT(type) \
402 void Visit##type(type* node);
403 AST_NODE_LIST(DEF_VISIT)
404#undef DEF_VISIT
405
406 // Visit a statement and then spill the virtual frame if control flow can
407 // reach the end of the statement (ie, it does not exit via break,
408 // continue, return, or throw). This function is used temporarily while
409 // the code generator is being transformed.
410 void VisitAndSpill(Statement* statement);
411
412 // Visit a list of statements and then spill the virtual frame if control
413 // flow can reach the end of the list.
414 void VisitStatementsAndSpill(ZoneList<Statement*>* statements);
415
416 // Main code generation function
Andrei Popescu402d9372010-02-26 13:31:12 +0000417 void Generate(CompilationInfo* info);
Steve Blocka7e24c12009-10-30 11:49:00 +0000418
419 // Generate the return sequence code. Should be called no more than
420 // once per compiled function, immediately after binding the return
421 // target (which can not be done more than once).
422 void GenerateReturnSequence(Result* return_value);
423
424 // Returns the arguments allocation mode.
Andrei Popescu31002712010-02-23 13:46:05 +0000425 ArgumentsAllocationMode ArgumentsMode();
Steve Blocka7e24c12009-10-30 11:49:00 +0000426
427 // Store the arguments object and allocate it if necessary.
428 Result StoreArgumentsObject(bool initial);
429
430 // The following are used by class Reference.
431 void LoadReference(Reference* ref);
Steve Blocka7e24c12009-10-30 11:49:00 +0000432
Steve Block3ce2e202009-11-05 08:53:23 +0000433 static Operand ContextOperand(Register context, int index) {
Steve Blocka7e24c12009-10-30 11:49:00 +0000434 return Operand(context, Context::SlotOffset(index));
435 }
436
437 Operand SlotOperand(Slot* slot, Register tmp);
438
439 Operand ContextSlotOperandCheckExtensions(Slot* slot,
440 Result tmp,
441 JumpTarget* slow);
442
443 // Expressions
Steve Block3ce2e202009-11-05 08:53:23 +0000444 static Operand GlobalObject() {
Steve Blocka7e24c12009-10-30 11:49:00 +0000445 return ContextOperand(esi, Context::GLOBAL_INDEX);
446 }
447
Steve Block6ded16b2010-05-10 14:33:55 +0100448 void LoadCondition(Expression* expr,
Steve Blocka7e24c12009-10-30 11:49:00 +0000449 ControlDestination* destination,
450 bool force_control);
Steve Blockd0582a62009-12-15 09:54:21 +0000451 void Load(Expression* expr);
Steve Blocka7e24c12009-10-30 11:49:00 +0000452 void LoadGlobal();
453 void LoadGlobalReceiver();
454
455 // Generate code to push the value of an expression on top of the frame
456 // and then spill the frame fully to memory. This function is used
457 // temporarily while the code generator is being transformed.
Steve Blockd0582a62009-12-15 09:54:21 +0000458 void LoadAndSpill(Expression* expression);
Steve Blocka7e24c12009-10-30 11:49:00 +0000459
Steve Block6ded16b2010-05-10 14:33:55 +0100460 // Evaluate an expression and place its value on top of the frame,
461 // using, or not using, the side-effect-free expression compiler.
462 void LoadInSafeInt32Mode(Expression* expr, BreakTarget* unsafe_bailout);
463 void LoadWithSafeInt32ModeDisabled(Expression* expr);
464
Steve Blocka7e24c12009-10-30 11:49:00 +0000465 // Read a value from a slot and leave it on top of the expression stack.
Leon Clarkef7060e22010-06-03 12:02:55 +0100466 void LoadFromSlot(Slot* slot, TypeofState typeof_state);
467 void LoadFromSlotCheckForArguments(Slot* slot, TypeofState typeof_state);
Steve Blocka7e24c12009-10-30 11:49:00 +0000468 Result LoadFromGlobalSlotCheckExtensions(Slot* slot,
469 TypeofState typeof_state,
470 JumpTarget* slow);
471
Kristian Monsen25f61362010-05-21 11:50:48 +0100472 // Support for loading from local/global variables and arguments
473 // whose location is known unless they are shadowed by
474 // eval-introduced bindings. Generates no code for unsupported slot
475 // types and therefore expects to fall through to the slow jump target.
476 void EmitDynamicLoadFromSlotFastCase(Slot* slot,
477 TypeofState typeof_state,
478 Result* result,
479 JumpTarget* slow,
480 JumpTarget* done);
481
Steve Blocka7e24c12009-10-30 11:49:00 +0000482 // Store the value on top of the expression stack into a slot, leaving the
483 // value in place.
484 void StoreToSlot(Slot* slot, InitState init_state);
485
Andrei Popescu402d9372010-02-26 13:31:12 +0000486 // Support for compiling assignment expressions.
487 void EmitSlotAssignment(Assignment* node);
488 void EmitNamedPropertyAssignment(Assignment* node);
489 void EmitKeyedPropertyAssignment(Assignment* node);
490
491 // Receiver is passed on the frame and consumed.
492 Result EmitNamedLoad(Handle<String> name, bool is_contextual);
493
494 // If the store is contextual, value is passed on the frame and consumed.
495 // Otherwise, receiver and value are passed on the frame and consumed.
496 Result EmitNamedStore(Handle<String> name, bool is_contextual);
497
498 // Receiver and key are passed on the frame and consumed.
499 Result EmitKeyedLoad();
500
501 // Receiver, key, and value are passed on the frame and consumed.
502 Result EmitKeyedStore(StaticType* key_type);
Leon Clarked91b9f72010-01-27 17:25:45 +0000503
Steve Blocka7e24c12009-10-30 11:49:00 +0000504 // Special code for typeof expressions: Unfortunately, we must
505 // be careful when loading the expression in 'typeof'
506 // expressions. We are not allowed to throw reference errors for
507 // non-existing properties of the global object, so we must make it
508 // look like an explicit property access, instead of an access
509 // through the context chain.
510 void LoadTypeofExpression(Expression* x);
511
512 // Translate the value on top of the frame into control flow to the
513 // control destination.
514 void ToBoolean(ControlDestination* destination);
515
Steve Block6ded16b2010-05-10 14:33:55 +0100516 // Generate code that computes a shortcutting logical operation.
517 void GenerateLogicalBooleanOperation(BinaryOperation* node);
518
519 void GenericBinaryOperation(BinaryOperation* expr,
520 OverwriteMode overwrite_mode);
Steve Blocka7e24c12009-10-30 11:49:00 +0000521
Ben Murdoch7f4d5bd2010-06-15 11:15:29 +0100522 // Emits code sequence that jumps to deferred code if the inputs
523 // are not both smis. Cannot be in MacroAssembler because it takes
524 // advantage of TypeInfo to skip unneeded checks.
525 void JumpIfNotBothSmiUsingTypeInfo(Register left,
526 Register right,
527 Register scratch,
528 TypeInfo left_info,
529 TypeInfo right_info,
530 DeferredCode* deferred);
531
Steve Blocka7e24c12009-10-30 11:49:00 +0000532 // If possible, combine two constant smi values using op to produce
533 // a smi result, and push it on the virtual frame, all at compile time.
534 // Returns true if it succeeds. Otherwise it has no effect.
535 bool FoldConstantSmis(Token::Value op, int left, int right);
536
537 // Emit code to perform a binary operation on a constant
Steve Block6ded16b2010-05-10 14:33:55 +0100538 // smi and a likely smi. Consumes the Result operand.
539 Result ConstantSmiBinaryOperation(BinaryOperation* expr,
Leon Clarked91b9f72010-01-27 17:25:45 +0000540 Result* operand,
541 Handle<Object> constant_operand,
Leon Clarked91b9f72010-01-27 17:25:45 +0000542 bool reversed,
543 OverwriteMode overwrite_mode);
Steve Blocka7e24c12009-10-30 11:49:00 +0000544
545 // Emit code to perform a binary operation on two likely smis.
546 // The code to handle smi arguments is produced inline.
Steve Block6ded16b2010-05-10 14:33:55 +0100547 // Consumes the Results left and right.
548 Result LikelySmiBinaryOperation(BinaryOperation* expr,
Leon Clarked91b9f72010-01-27 17:25:45 +0000549 Result* left,
550 Result* right,
551 OverwriteMode overwrite_mode);
Steve Blocka7e24c12009-10-30 11:49:00 +0000552
Steve Block6ded16b2010-05-10 14:33:55 +0100553
554 // Emit code to perform a binary operation on two untagged int32 values.
555 // The values are on top of the frame, and the result is pushed on the frame.
556 void Int32BinaryOperation(BinaryOperation* node);
557
558
Leon Clarkee46be812010-01-19 14:06:41 +0000559 void Comparison(AstNode* node,
560 Condition cc,
Steve Blocka7e24c12009-10-30 11:49:00 +0000561 bool strict,
562 ControlDestination* destination);
Steve Block6ded16b2010-05-10 14:33:55 +0100563 void GenerateInlineNumberComparison(Result* left_side,
564 Result* right_side,
565 Condition cc,
566 ControlDestination* dest);
Steve Blocka7e24c12009-10-30 11:49:00 +0000567
568 // To prevent long attacker-controlled byte sequences, integer constants
569 // from the JavaScript source are loaded in two parts if they are larger
Steve Block6ded16b2010-05-10 14:33:55 +0100570 // than 17 bits.
571 static const int kMaxSmiInlinedBits = 17;
Steve Blocka7e24c12009-10-30 11:49:00 +0000572 bool IsUnsafeSmi(Handle<Object> value);
Steve Blockd0582a62009-12-15 09:54:21 +0000573 // Load an integer constant x into a register target or into the stack using
Steve Blocka7e24c12009-10-30 11:49:00 +0000574 // at most 16 bits of user-controlled data per assembly operation.
Steve Blockd0582a62009-12-15 09:54:21 +0000575 void MoveUnsafeSmi(Register target, Handle<Object> value);
576 void StoreUnsafeSmiToLocal(int offset, Handle<Object> value);
577 void PushUnsafeSmi(Handle<Object> value);
Steve Blocka7e24c12009-10-30 11:49:00 +0000578
Leon Clarkee46be812010-01-19 14:06:41 +0000579 void CallWithArguments(ZoneList<Expression*>* arguments,
580 CallFunctionFlags flags,
581 int position);
Steve Blocka7e24c12009-10-30 11:49:00 +0000582
Leon Clarked91b9f72010-01-27 17:25:45 +0000583 // An optimized implementation of expressions of the form
584 // x.apply(y, arguments). We call x the applicand and y the receiver.
585 // The optimization avoids allocating an arguments object if possible.
586 void CallApplyLazy(Expression* applicand,
Steve Blocka7e24c12009-10-30 11:49:00 +0000587 Expression* receiver,
588 VariableProxy* arguments,
589 int position);
590
591 void CheckStack();
592
593 struct InlineRuntimeLUT {
594 void (CodeGenerator::*method)(ZoneList<Expression*>*);
595 const char* name;
Steve Block6ded16b2010-05-10 14:33:55 +0100596 int nargs;
Steve Blocka7e24c12009-10-30 11:49:00 +0000597 };
598
599 static InlineRuntimeLUT* FindInlineRuntimeLUT(Handle<String> name);
600 bool CheckForInlineRuntimeCall(CallRuntime* node);
601 static bool PatchInlineRuntimeEntry(Handle<String> name,
602 const InlineRuntimeLUT& new_entry,
603 InlineRuntimeLUT* old_entry);
604
Steve Blocka7e24c12009-10-30 11:49:00 +0000605 void ProcessDeclarations(ZoneList<Declaration*>* declarations);
606
Steve Block3ce2e202009-11-05 08:53:23 +0000607 static Handle<Code> ComputeCallInitialize(int argc, InLoopFlag in_loop);
Steve Blocka7e24c12009-10-30 11:49:00 +0000608
Ben Murdoch7f4d5bd2010-06-15 11:15:29 +0100609 static Handle<Code> ComputeKeyedCallInitialize(int argc, InLoopFlag in_loop);
610
Steve Blocka7e24c12009-10-30 11:49:00 +0000611 // Declare global variables and functions in the given array of
612 // name/value pairs.
613 void DeclareGlobals(Handle<FixedArray> pairs);
614
Steve Block6ded16b2010-05-10 14:33:55 +0100615 // Instantiate the function based on the shared function info.
616 Result InstantiateFunction(Handle<SharedFunctionInfo> function_info);
Steve Blocka7e24c12009-10-30 11:49:00 +0000617
618 // Support for type checks.
619 void GenerateIsSmi(ZoneList<Expression*>* args);
620 void GenerateIsNonNegativeSmi(ZoneList<Expression*>* args);
621 void GenerateIsArray(ZoneList<Expression*>* args);
Andrei Popescu402d9372010-02-26 13:31:12 +0000622 void GenerateIsRegExp(ZoneList<Expression*>* args);
Steve Blockd0582a62009-12-15 09:54:21 +0000623 void GenerateIsObject(ZoneList<Expression*>* args);
624 void GenerateIsFunction(ZoneList<Expression*>* args);
Leon Clarked91b9f72010-01-27 17:25:45 +0000625 void GenerateIsUndetectableObject(ZoneList<Expression*>* args);
Steve Blocka7e24c12009-10-30 11:49:00 +0000626
627 // Support for construct call checks.
628 void GenerateIsConstructCall(ZoneList<Expression*>* args);
629
630 // Support for arguments.length and arguments[?].
631 void GenerateArgumentsLength(ZoneList<Expression*>* args);
Steve Block6ded16b2010-05-10 14:33:55 +0100632 void GenerateArguments(ZoneList<Expression*>* args);
Steve Blocka7e24c12009-10-30 11:49:00 +0000633
634 // Support for accessing the class and value fields of an object.
635 void GenerateClassOf(ZoneList<Expression*>* args);
636 void GenerateValueOf(ZoneList<Expression*>* args);
637 void GenerateSetValueOf(ZoneList<Expression*>* args);
638
639 // Fast support for charCodeAt(n).
Ben Murdoch7f4d5bd2010-06-15 11:15:29 +0100640 void GenerateStringCharCodeAt(ZoneList<Expression*>* args);
Steve Blocka7e24c12009-10-30 11:49:00 +0000641
Steve Block6ded16b2010-05-10 14:33:55 +0100642 // Fast support for string.charAt(n) and string[n].
Ben Murdoch7f4d5bd2010-06-15 11:15:29 +0100643 void GenerateStringCharFromCode(ZoneList<Expression*>* args);
644
645 // Fast support for string.charAt(n) and string[n].
646 void GenerateStringCharAt(ZoneList<Expression*>* args);
Steve Block6ded16b2010-05-10 14:33:55 +0100647
Steve Blocka7e24c12009-10-30 11:49:00 +0000648 // Fast support for object equality testing.
649 void GenerateObjectEquals(ZoneList<Expression*>* args);
650
651 void GenerateLog(ZoneList<Expression*>* args);
652
653 void GenerateGetFramePointer(ZoneList<Expression*>* args);
654
655 // Fast support for Math.random().
Steve Block6ded16b2010-05-10 14:33:55 +0100656 void GenerateRandomHeapNumber(ZoneList<Expression*>* args);
Steve Blocka7e24c12009-10-30 11:49:00 +0000657
Steve Blockd0582a62009-12-15 09:54:21 +0000658 // Fast support for StringAdd.
659 void GenerateStringAdd(ZoneList<Expression*>* args);
660
Leon Clarkee46be812010-01-19 14:06:41 +0000661 // Fast support for SubString.
662 void GenerateSubString(ZoneList<Expression*>* args);
663
664 // Fast support for StringCompare.
665 void GenerateStringCompare(ZoneList<Expression*>* args);
666
667 // Support for direct calls from JavaScript to native RegExp code.
668 void GenerateRegExpExec(ZoneList<Expression*>* args);
669
Steve Block6ded16b2010-05-10 14:33:55 +0100670 void GenerateRegExpConstructResult(ZoneList<Expression*>* args);
671
672 // Support for fast native caches.
673 void GenerateGetFromCache(ZoneList<Expression*>* args);
674
Andrei Popescu402d9372010-02-26 13:31:12 +0000675 // Fast support for number to string.
676 void GenerateNumberToString(ZoneList<Expression*>* args);
677
Steve Block6ded16b2010-05-10 14:33:55 +0100678 // Fast swapping of elements. Takes three expressions, the object and two
679 // indices. This should only be used if the indices are known to be
680 // non-negative and within bounds of the elements array at the call site.
681 void GenerateSwapElements(ZoneList<Expression*>* args);
682
683 // Fast call for custom callbacks.
684 void GenerateCallFunction(ZoneList<Expression*>* args);
685
686 // Fast call to math functions.
687 void GenerateMathPow(ZoneList<Expression*>* args);
Andrei Popescu402d9372010-02-26 13:31:12 +0000688 void GenerateMathSin(ZoneList<Expression*>* args);
689 void GenerateMathCos(ZoneList<Expression*>* args);
Steve Block6ded16b2010-05-10 14:33:55 +0100690 void GenerateMathSqrt(ZoneList<Expression*>* args);
Andrei Popescu402d9372010-02-26 13:31:12 +0000691
Steve Block3ce2e202009-11-05 08:53:23 +0000692 // Simple condition analysis.
693 enum ConditionAnalysis {
694 ALWAYS_TRUE,
695 ALWAYS_FALSE,
696 DONT_KNOW
697 };
698 ConditionAnalysis AnalyzeCondition(Expression* cond);
699
Steve Blocka7e24c12009-10-30 11:49:00 +0000700 // Methods used to indicate which source code is generated for. Source
701 // positions are collected by the assembler and emitted with the relocation
702 // information.
703 void CodeForFunctionPosition(FunctionLiteral* fun);
704 void CodeForReturnPosition(FunctionLiteral* fun);
705 void CodeForStatementPosition(Statement* stmt);
Steve Blockd0582a62009-12-15 09:54:21 +0000706 void CodeForDoWhileConditionPosition(DoWhileStatement* stmt);
Steve Blocka7e24c12009-10-30 11:49:00 +0000707 void CodeForSourcePosition(int pos);
708
Steve Block6ded16b2010-05-10 14:33:55 +0100709 void SetTypeForStackSlot(Slot* slot, TypeInfo info);
710
Steve Blocka7e24c12009-10-30 11:49:00 +0000711#ifdef DEBUG
712 // True if the registers are valid for entry to a block. There should
713 // be no frame-external references to (non-reserved) registers.
714 bool HasValidEntryRegisters();
715#endif
716
Steve Blocka7e24c12009-10-30 11:49:00 +0000717 ZoneList<DeferredCode*> deferred_;
718
719 // Assembler
720 MacroAssembler* masm_; // to generate code
721
Andrei Popescu31002712010-02-23 13:46:05 +0000722 CompilationInfo* info_;
723
Steve Blocka7e24c12009-10-30 11:49:00 +0000724 // Code generation state
Steve Blocka7e24c12009-10-30 11:49:00 +0000725 VirtualFrame* frame_;
726 RegisterAllocator* allocator_;
727 CodeGenState* state_;
728 int loop_nesting_;
Steve Block6ded16b2010-05-10 14:33:55 +0100729 bool in_safe_int32_mode_;
730 bool safe_int32_mode_enabled_;
Steve Blocka7e24c12009-10-30 11:49:00 +0000731
732 // Jump targets.
733 // The target of the return from the function.
734 BreakTarget function_return_;
Steve Block6ded16b2010-05-10 14:33:55 +0100735 // The target of the bailout from a side-effect-free int32 subexpression.
736 BreakTarget* unsafe_bailout_;
Steve Blocka7e24c12009-10-30 11:49:00 +0000737
738 // True if the function return is shadowed (ie, jumping to the target
739 // function_return_ does not jump to the true function return, but rather
740 // to some unlinking code).
741 bool function_return_is_shadowed_;
742
743 // True when we are in code that expects the virtual frame to be fully
744 // spilled. Some virtual frame function are disabled in DEBUG builds when
745 // called from spilled code, because they do not leave the virtual frame
746 // in a spilled state.
747 bool in_spilled_code_;
748
749 static InlineRuntimeLUT kInlineRuntimeLUT[];
750
751 friend class VirtualFrame;
752 friend class JumpTarget;
753 friend class Reference;
754 friend class Result;
Leon Clarke4515c472010-02-03 11:58:03 +0000755 friend class FastCodeGenerator;
Leon Clarked91b9f72010-01-27 17:25:45 +0000756 friend class FullCodeGenerator;
757 friend class FullCodeGenSyntaxChecker;
Steve Blocka7e24c12009-10-30 11:49:00 +0000758
759 friend class CodeGeneratorPatcher; // Used in test-log-stack-tracer.cc
760
761 DISALLOW_COPY_AND_ASSIGN(CodeGenerator);
762};
763
764
Andrei Popescu402d9372010-02-26 13:31:12 +0000765// Compute a transcendental math function natively, or call the
766// TranscendentalCache runtime function.
767class TranscendentalCacheStub: public CodeStub {
768 public:
769 explicit TranscendentalCacheStub(TranscendentalCache::Type type)
770 : type_(type) {}
771 void Generate(MacroAssembler* masm);
772 private:
773 TranscendentalCache::Type type_;
774 Major MajorKey() { return TranscendentalCache; }
775 int MinorKey() { return type_; }
776 Runtime::FunctionId RuntimeFunction();
777 void GenerateOperation(MacroAssembler* masm);
778};
779
780
Steve Blockd0582a62009-12-15 09:54:21 +0000781// Flag that indicates how to generate code for the stub GenericBinaryOpStub.
Steve Blocka7e24c12009-10-30 11:49:00 +0000782enum GenericBinaryFlags {
Steve Block3ce2e202009-11-05 08:53:23 +0000783 NO_GENERIC_BINARY_FLAGS = 0,
784 NO_SMI_CODE_IN_STUB = 1 << 0 // Omit smi code in stub.
Steve Blocka7e24c12009-10-30 11:49:00 +0000785};
786
787
788class GenericBinaryOpStub: public CodeStub {
789 public:
Steve Blockd0582a62009-12-15 09:54:21 +0000790 GenericBinaryOpStub(Token::Value op,
Steve Blocka7e24c12009-10-30 11:49:00 +0000791 OverwriteMode mode,
Andrei Popescu402d9372010-02-26 13:31:12 +0000792 GenericBinaryFlags flags,
Steve Block6ded16b2010-05-10 14:33:55 +0100793 TypeInfo operands_type)
Steve Blockd0582a62009-12-15 09:54:21 +0000794 : op_(op),
Steve Block3ce2e202009-11-05 08:53:23 +0000795 mode_(mode),
796 flags_(flags),
797 args_in_registers_(false),
Leon Clarkee46be812010-01-19 14:06:41 +0000798 args_reversed_(false),
Steve Block6ded16b2010-05-10 14:33:55 +0100799 static_operands_type_(operands_type),
800 runtime_operands_type_(BinaryOpIC::DEFAULT),
801 name_(NULL) {
802 if (static_operands_type_.IsSmi()) {
803 mode_ = NO_OVERWRITE;
804 }
Steve Blockd0582a62009-12-15 09:54:21 +0000805 use_sse3_ = CpuFeatures::IsSupported(SSE3);
Steve Blocka7e24c12009-10-30 11:49:00 +0000806 ASSERT(OpBits::is_valid(Token::NUM_TOKENS));
807 }
808
Steve Block6ded16b2010-05-10 14:33:55 +0100809 GenericBinaryOpStub(int key, BinaryOpIC::TypeInfo runtime_operands_type)
810 : op_(OpBits::decode(key)),
811 mode_(ModeBits::decode(key)),
812 flags_(FlagBits::decode(key)),
813 args_in_registers_(ArgsInRegistersBits::decode(key)),
814 args_reversed_(ArgsReversedBits::decode(key)),
815 use_sse3_(SSE3Bits::decode(key)),
816 static_operands_type_(TypeInfo::ExpandedRepresentation(
817 StaticTypeInfoBits::decode(key))),
818 runtime_operands_type_(runtime_operands_type),
819 name_(NULL) {
820 }
821
Steve Block3ce2e202009-11-05 08:53:23 +0000822 // Generate code to call the stub with the supplied arguments. This will add
823 // code at the call site to prepare arguments either in registers or on the
824 // stack together with the actual call.
825 void GenerateCall(MacroAssembler* masm, Register left, Register right);
826 void GenerateCall(MacroAssembler* masm, Register left, Smi* right);
827 void GenerateCall(MacroAssembler* masm, Smi* left, Register right);
Steve Blocka7e24c12009-10-30 11:49:00 +0000828
Leon Clarked91b9f72010-01-27 17:25:45 +0000829 Result GenerateCall(MacroAssembler* masm,
830 VirtualFrame* frame,
831 Result* left,
832 Result* right);
833
Steve Blocka7e24c12009-10-30 11:49:00 +0000834 private:
835 Token::Value op_;
836 OverwriteMode mode_;
837 GenericBinaryFlags flags_;
Steve Block3ce2e202009-11-05 08:53:23 +0000838 bool args_in_registers_; // Arguments passed in registers not on the stack.
839 bool args_reversed_; // Left and right argument are swapped.
Steve Blocka7e24c12009-10-30 11:49:00 +0000840 bool use_sse3_;
Steve Block6ded16b2010-05-10 14:33:55 +0100841
842 // Number type information of operands, determined by code generator.
843 TypeInfo static_operands_type_;
844
845 // Operand type information determined at runtime.
846 BinaryOpIC::TypeInfo runtime_operands_type_;
847
Leon Clarkee46be812010-01-19 14:06:41 +0000848 char* name_;
Steve Blocka7e24c12009-10-30 11:49:00 +0000849
850 const char* GetName();
851
852#ifdef DEBUG
853 void Print() {
Andrei Popescu402d9372010-02-26 13:31:12 +0000854 PrintF("GenericBinaryOpStub %d (op %s), "
Steve Block6ded16b2010-05-10 14:33:55 +0100855 "(mode %d, flags %d, registers %d, reversed %d, type_info %s)\n",
Andrei Popescu402d9372010-02-26 13:31:12 +0000856 MinorKey(),
Steve Blocka7e24c12009-10-30 11:49:00 +0000857 Token::String(op_),
858 static_cast<int>(mode_),
Steve Block3ce2e202009-11-05 08:53:23 +0000859 static_cast<int>(flags_),
860 static_cast<int>(args_in_registers_),
Andrei Popescu402d9372010-02-26 13:31:12 +0000861 static_cast<int>(args_reversed_),
Steve Block6ded16b2010-05-10 14:33:55 +0100862 static_operands_type_.ToString());
Steve Blocka7e24c12009-10-30 11:49:00 +0000863 }
864#endif
865
Steve Block6ded16b2010-05-10 14:33:55 +0100866 // Minor key encoding in 18 bits RRNNNFRASOOOOOOOMM.
Steve Blocka7e24c12009-10-30 11:49:00 +0000867 class ModeBits: public BitField<OverwriteMode, 0, 2> {};
Andrei Popescu402d9372010-02-26 13:31:12 +0000868 class OpBits: public BitField<Token::Value, 2, 7> {};
869 class SSE3Bits: public BitField<bool, 9, 1> {};
870 class ArgsInRegistersBits: public BitField<bool, 10, 1> {};
871 class ArgsReversedBits: public BitField<bool, 11, 1> {};
872 class FlagBits: public BitField<GenericBinaryFlags, 12, 1> {};
Steve Block6ded16b2010-05-10 14:33:55 +0100873 class StaticTypeInfoBits: public BitField<int, 13, 3> {};
874 class RuntimeTypeInfoBits: public BitField<BinaryOpIC::TypeInfo, 16, 2> {};
Steve Blocka7e24c12009-10-30 11:49:00 +0000875
876 Major MajorKey() { return GenericBinaryOp; }
877 int MinorKey() {
Steve Block6ded16b2010-05-10 14:33:55 +0100878 // Encode the parameters in a unique 18 bit value.
Steve Blocka7e24c12009-10-30 11:49:00 +0000879 return OpBits::encode(op_)
880 | ModeBits::encode(mode_)
881 | FlagBits::encode(flags_)
Steve Block3ce2e202009-11-05 08:53:23 +0000882 | SSE3Bits::encode(use_sse3_)
883 | ArgsInRegistersBits::encode(args_in_registers_)
Andrei Popescu402d9372010-02-26 13:31:12 +0000884 | ArgsReversedBits::encode(args_reversed_)
Steve Block6ded16b2010-05-10 14:33:55 +0100885 | StaticTypeInfoBits::encode(
886 static_operands_type_.ThreeBitRepresentation())
887 | RuntimeTypeInfoBits::encode(runtime_operands_type_);
Steve Blocka7e24c12009-10-30 11:49:00 +0000888 }
Steve Block3ce2e202009-11-05 08:53:23 +0000889
Steve Blocka7e24c12009-10-30 11:49:00 +0000890 void Generate(MacroAssembler* masm);
Steve Block3ce2e202009-11-05 08:53:23 +0000891 void GenerateSmiCode(MacroAssembler* masm, Label* slow);
892 void GenerateLoadArguments(MacroAssembler* masm);
893 void GenerateReturn(MacroAssembler* masm);
Leon Clarked91b9f72010-01-27 17:25:45 +0000894 void GenerateHeapResultAllocation(MacroAssembler* masm, Label* alloc_failure);
Steve Block6ded16b2010-05-10 14:33:55 +0100895 void GenerateRegisterArgsPush(MacroAssembler* masm);
896 void GenerateTypeTransition(MacroAssembler* masm);
Steve Block3ce2e202009-11-05 08:53:23 +0000897
898 bool ArgsInRegistersSupported() {
Leon Clarked91b9f72010-01-27 17:25:45 +0000899 return op_ == Token::ADD || op_ == Token::SUB
900 || op_ == Token::MUL || op_ == Token::DIV;
Steve Block3ce2e202009-11-05 08:53:23 +0000901 }
902 bool IsOperationCommutative() {
903 return (op_ == Token::ADD) || (op_ == Token::MUL);
904 }
905
906 void SetArgsInRegisters() { args_in_registers_ = true; }
907 void SetArgsReversed() { args_reversed_ = true; }
908 bool HasSmiCodeInStub() { return (flags_ & NO_SMI_CODE_IN_STUB) == 0; }
Leon Clarked91b9f72010-01-27 17:25:45 +0000909 bool HasArgsInRegisters() { return args_in_registers_; }
910 bool HasArgsReversed() { return args_reversed_; }
Steve Block6ded16b2010-05-10 14:33:55 +0100911
912 bool ShouldGenerateSmiCode() {
913 return HasSmiCodeInStub() &&
914 runtime_operands_type_ != BinaryOpIC::HEAP_NUMBERS &&
915 runtime_operands_type_ != BinaryOpIC::STRINGS;
916 }
917
918 bool ShouldGenerateFPCode() {
919 return runtime_operands_type_ != BinaryOpIC::STRINGS;
920 }
921
922 virtual int GetCodeKind() { return Code::BINARY_OP_IC; }
923
924 virtual InlineCacheState GetICState() {
925 return BinaryOpIC::ToState(runtime_operands_type_);
926 }
Steve Blocka7e24c12009-10-30 11:49:00 +0000927};
928
929
Steve Block6ded16b2010-05-10 14:33:55 +0100930class StringHelper : public AllStatic {
Leon Clarkee46be812010-01-19 14:06:41 +0000931 public:
932 // Generate code for copying characters using a simple loop. This should only
933 // be used in places where the number of characters is small and the
934 // additional setup and checking in GenerateCopyCharactersREP adds too much
935 // overhead. Copying of overlapping regions is not supported.
Steve Block6ded16b2010-05-10 14:33:55 +0100936 static void GenerateCopyCharacters(MacroAssembler* masm,
937 Register dest,
938 Register src,
939 Register count,
940 Register scratch,
941 bool ascii);
Leon Clarkee46be812010-01-19 14:06:41 +0000942
943 // Generate code for copying characters using the rep movs instruction.
944 // Copies ecx characters from esi to edi. Copying of overlapping regions is
945 // not supported.
Steve Block6ded16b2010-05-10 14:33:55 +0100946 static void GenerateCopyCharactersREP(MacroAssembler* masm,
947 Register dest, // Must be edi.
948 Register src, // Must be esi.
949 Register count, // Must be ecx.
950 Register scratch, // Neither of above.
951 bool ascii);
Andrei Popescu402d9372010-02-26 13:31:12 +0000952
953 // Probe the symbol table for a two character string. If the string is
954 // not found by probing a jump to the label not_found is performed. This jump
955 // does not guarantee that the string is not in the symbol table. If the
956 // string is found the code falls through with the string in register eax.
Steve Block6ded16b2010-05-10 14:33:55 +0100957 static void GenerateTwoCharacterSymbolTableProbe(MacroAssembler* masm,
958 Register c1,
959 Register c2,
960 Register scratch1,
961 Register scratch2,
962 Register scratch3,
963 Label* not_found);
Andrei Popescu402d9372010-02-26 13:31:12 +0000964
965 // Generate string hash.
Steve Block6ded16b2010-05-10 14:33:55 +0100966 static void GenerateHashInit(MacroAssembler* masm,
967 Register hash,
968 Register character,
969 Register scratch);
970 static void GenerateHashAddCharacter(MacroAssembler* masm,
971 Register hash,
972 Register character,
973 Register scratch);
974 static void GenerateHashGetHash(MacroAssembler* masm,
975 Register hash,
976 Register scratch);
977
978 private:
979 DISALLOW_IMPLICIT_CONSTRUCTORS(StringHelper);
Leon Clarkee46be812010-01-19 14:06:41 +0000980};
981
982
Andrei Popescu31002712010-02-23 13:46:05 +0000983// Flag that indicates how to generate code for the stub StringAddStub.
984enum StringAddFlags {
985 NO_STRING_ADD_FLAGS = 0,
986 NO_STRING_CHECK_IN_STUB = 1 << 0 // Omit string check in stub.
987};
988
989
Steve Block6ded16b2010-05-10 14:33:55 +0100990class StringAddStub: public CodeStub {
Steve Blockd0582a62009-12-15 09:54:21 +0000991 public:
992 explicit StringAddStub(StringAddFlags flags) {
993 string_check_ = ((flags & NO_STRING_CHECK_IN_STUB) == 0);
994 }
995
996 private:
997 Major MajorKey() { return StringAdd; }
998 int MinorKey() { return string_check_ ? 0 : 1; }
999
1000 void Generate(MacroAssembler* masm);
1001
Steve Blockd0582a62009-12-15 09:54:21 +00001002 // Should the stub check whether arguments are strings?
1003 bool string_check_;
1004};
1005
1006
Steve Block6ded16b2010-05-10 14:33:55 +01001007class SubStringStub: public CodeStub {
Leon Clarkee46be812010-01-19 14:06:41 +00001008 public:
1009 SubStringStub() {}
1010
1011 private:
1012 Major MajorKey() { return SubString; }
1013 int MinorKey() { return 0; }
1014
1015 void Generate(MacroAssembler* masm);
1016};
1017
1018
Steve Block6ded16b2010-05-10 14:33:55 +01001019class StringCompareStub: public CodeStub {
Leon Clarkee46be812010-01-19 14:06:41 +00001020 public:
1021 explicit StringCompareStub() {
1022 }
1023
1024 // Compare two flat ascii strings and returns result in eax after popping two
1025 // arguments from the stack.
1026 static void GenerateCompareFlatAsciiStrings(MacroAssembler* masm,
1027 Register left,
1028 Register right,
1029 Register scratch1,
1030 Register scratch2,
1031 Register scratch3);
1032
1033 private:
1034 Major MajorKey() { return StringCompare; }
1035 int MinorKey() { return 0; }
1036
1037 void Generate(MacroAssembler* masm);
1038};
1039
1040
Andrei Popescu402d9372010-02-26 13:31:12 +00001041class NumberToStringStub: public CodeStub {
1042 public:
1043 NumberToStringStub() { }
1044
1045 // Generate code to do a lookup in the number string cache. If the number in
1046 // the register object is found in the cache the generated code falls through
1047 // with the result in the result register. The object and the result register
1048 // can be the same. If the number is not found in the cache the code jumps to
1049 // the label not_found with only the content of register object unchanged.
1050 static void GenerateLookupNumberStringCache(MacroAssembler* masm,
1051 Register object,
1052 Register result,
1053 Register scratch1,
1054 Register scratch2,
1055 bool object_is_smi,
1056 Label* not_found);
1057
1058 private:
1059 Major MajorKey() { return NumberToString; }
1060 int MinorKey() { return 0; }
1061
1062 void Generate(MacroAssembler* masm);
1063
1064 const char* GetName() { return "NumberToStringStub"; }
1065
1066#ifdef DEBUG
1067 void Print() {
1068 PrintF("NumberToStringStub\n");
1069 }
1070#endif
1071};
1072
1073
Steve Blocka7e24c12009-10-30 11:49:00 +00001074} } // namespace v8::internal
1075
1076#endif // V8_IA32_CODEGEN_IA32_H_