| Index: src/x64/codegen-x64.h
|
| ===================================================================
|
| --- src/x64/codegen-x64.h (revision 3964)
|
| +++ src/x64/codegen-x64.h (working copy)
|
| @@ -343,7 +343,7 @@
|
|
|
| // Accessors
|
| inline bool is_eval();
|
| - Scope* scope();
|
| + inline Scope* scope();
|
|
|
| // Generating deferred code.
|
| void ProcessDeferred();
|
| @@ -547,6 +547,9 @@
|
| // Fast support for charCodeAt(n).
|
| void GenerateFastCharCodeAt(ZoneList<Expression*>* args);
|
|
|
| + // Fast support for string.charAt(n) and string[n].
|
| + void GenerateCharFromCode(ZoneList<Expression*>* args);
|
| +
|
| // Fast support for object equality testing.
|
| void GenerateObjectEquals(ZoneList<Expression*>* args);
|
|
|
| @@ -572,10 +575,16 @@
|
| // Fast support for number to string.
|
| void GenerateNumberToString(ZoneList<Expression*>* args);
|
|
|
| + // Fast support for Math.pow().
|
| + void GenerateMathPow(ZoneList<Expression*>* args);
|
| +
|
| // Fast call to math functions.
|
| void GenerateMathSin(ZoneList<Expression*>* args);
|
| void GenerateMathCos(ZoneList<Expression*>* args);
|
|
|
| + // Fast case for sqrt
|
| + void GenerateMathSqrt(ZoneList<Expression*>* args);
|
| +
|
| // Simple condition analysis.
|
| enum ConditionAnalysis {
|
| ALWAYS_TRUE,
|
| @@ -655,7 +664,7 @@
|
| GenericBinaryOpStub(Token::Value op,
|
| OverwriteMode mode,
|
| GenericBinaryFlags flags,
|
| - NumberInfo::Type operands_type = NumberInfo::kUnknown)
|
| + NumberInfo operands_type = NumberInfo::Unknown())
|
| : op_(op),
|
| mode_(mode),
|
| flags_(flags),
|
| @@ -687,7 +696,7 @@
|
| bool args_reversed_; // Left and right argument are swapped.
|
| bool use_sse3_;
|
| char* name_;
|
| - NumberInfo::Type operands_type_;
|
| + NumberInfo operands_type_;
|
|
|
| const char* GetName();
|
|
|
| @@ -701,7 +710,7 @@
|
| static_cast<int>(flags_),
|
| static_cast<int>(args_in_registers_),
|
| static_cast<int>(args_reversed_),
|
| - NumberInfo::ToString(operands_type_));
|
| + operands_type_.ToString());
|
| }
|
| #endif
|
|
|
| @@ -712,7 +721,7 @@
|
| class ArgsInRegistersBits: public BitField<bool, 10, 1> {};
|
| class ArgsReversedBits: public BitField<bool, 11, 1> {};
|
| class FlagBits: public BitField<GenericBinaryFlags, 12, 1> {};
|
| - class NumberInfoBits: public BitField<NumberInfo::Type, 13, 3> {};
|
| + class NumberInfoBits: public BitField<int, 13, 3> {};
|
|
|
| Major MajorKey() { return GenericBinaryOp; }
|
| int MinorKey() {
|
| @@ -723,7 +732,7 @@
|
| | SSE3Bits::encode(use_sse3_)
|
| | ArgsInRegistersBits::encode(args_in_registers_)
|
| | ArgsReversedBits::encode(args_reversed_)
|
| - | NumberInfoBits::encode(operands_type_);
|
| + | NumberInfoBits::encode(operands_type_.ThreeBitRepresentation());
|
| }
|
|
|
| void Generate(MacroAssembler* masm);
|
| @@ -767,6 +776,33 @@
|
| Register src, // Must be rsi.
|
| Register count, // Must be rcx.
|
| bool ascii);
|
| +
|
| +
|
| + // Probe the symbol table for a two character string. If the string is
|
| + // not found by probing a jump to the label not_found is performed. This jump
|
| + // does not guarantee that the string is not in the symbol table. If the
|
| + // string is found the code falls through with the string in register rax.
|
| + void GenerateTwoCharacterSymbolTableProbe(MacroAssembler* masm,
|
| + Register c1,
|
| + Register c2,
|
| + Register scratch1,
|
| + Register scratch2,
|
| + Register scratch3,
|
| + Register scratch4,
|
| + Label* not_found);
|
| +
|
| + // Generate string hash.
|
| + void GenerateHashInit(MacroAssembler* masm,
|
| + Register hash,
|
| + Register character,
|
| + Register scratch);
|
| + void GenerateHashAddCharacter(MacroAssembler* masm,
|
| + Register hash,
|
| + Register character,
|
| + Register scratch);
|
| + void GenerateHashGetHash(MacroAssembler* masm,
|
| + Register hash,
|
| + Register scratch);
|
| };
|
|
|
|
|
|
|