2008-11-25 11:07:48 +00:00
|
|
|
// Copyright 2008 the V8 project authors. All rights reserved.
|
|
|
|
// Redistribution and use in source and binary forms, with or without
|
|
|
|
// modification, are permitted provided that the following conditions are
|
|
|
|
// met:
|
|
|
|
//
|
|
|
|
// * Redistributions of source code must retain the above copyright
|
|
|
|
// notice, this list of conditions and the following disclaimer.
|
|
|
|
// * Redistributions in binary form must reproduce the above
|
|
|
|
// copyright notice, this list of conditions and the following
|
|
|
|
// disclaimer in the documentation and/or other materials provided
|
|
|
|
// with the distribution.
|
|
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived
|
|
|
|
// from this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
#ifndef REGEXP_MACRO_ASSEMBLER_IA32_H_
|
|
|
|
#define REGEXP_MACRO_ASSEMBLER_IA32_H_
|
|
|
|
|
|
|
|
namespace v8 { namespace internal {
|
|
|
|
|
|
|
|
class RegExpMacroAssemblerIA32: public RegExpMacroAssembler {
|
|
|
|
public:
|
2008-11-26 13:54:08 +00:00
|
|
|
// Type of input string to generate code for.
|
2008-12-12 10:49:00 +00:00
|
|
|
enum Mode { ASCII = 1, UC16 = 2 };
|
|
|
|
enum Result { EXCEPTION = -1, FAILURE = 0, SUCCESS = 1 };
|
2008-11-26 13:54:08 +00:00
|
|
|
|
2008-11-25 13:13:02 +00:00
|
|
|
RegExpMacroAssemblerIA32(Mode mode, int registers_to_save);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual ~RegExpMacroAssemblerIA32();
|
2009-01-12 13:05:23 +00:00
|
|
|
virtual int stack_limit_slack();
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual void AdvanceCurrentPosition(int by);
|
|
|
|
virtual void AdvanceRegister(int reg, int by);
|
|
|
|
virtual void Backtrack();
|
|
|
|
virtual void Bind(Label* label);
|
2009-01-19 18:56:47 +00:00
|
|
|
virtual void CheckAtStart(Label* on_at_start);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual void CheckBitmap(uc16 start, Label* bitmap, Label* on_zero);
|
2008-12-19 12:02:34 +00:00
|
|
|
virtual void CheckCharacter(uint32_t c, Label* on_equal);
|
|
|
|
virtual void CheckCharacterAfterAnd(uint32_t c,
|
|
|
|
uint32_t mask,
|
|
|
|
Label* on_equal);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual void CheckCharacterGT(uc16 limit, Label* on_greater);
|
|
|
|
virtual void CheckCharacterLT(uc16 limit, Label* on_less);
|
|
|
|
virtual void CheckCharacters(Vector<const uc16> str,
|
|
|
|
int cp_offset,
|
2008-12-08 09:22:12 +00:00
|
|
|
Label* on_failure,
|
|
|
|
bool check_end_of_string);
|
2009-01-12 13:05:23 +00:00
|
|
|
// A "greedy loop" is a loop that is both greedy and with a simple
|
|
|
|
// body. It has a particularly simple implementation.
|
2008-12-08 09:22:12 +00:00
|
|
|
virtual void CheckGreedyLoop(Label* on_tos_equals_current_position);
|
2008-11-28 11:48:22 +00:00
|
|
|
virtual void CheckNotAtStart(Label* on_not_at_start);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual void CheckNotBackReference(int start_reg, Label* on_no_match);
|
2008-11-27 07:27:08 +00:00
|
|
|
virtual void CheckNotBackReferenceIgnoreCase(int start_reg,
|
|
|
|
Label* on_no_match);
|
2008-11-28 08:53:53 +00:00
|
|
|
virtual void CheckNotRegistersEqual(int reg1, int reg2, Label* on_not_equal);
|
2008-12-19 12:02:34 +00:00
|
|
|
virtual void CheckNotCharacter(uint32_t c, Label* on_not_equal);
|
|
|
|
virtual void CheckNotCharacterAfterAnd(uint32_t c,
|
|
|
|
uint32_t mask,
|
|
|
|
Label* on_not_equal);
|
|
|
|
virtual void CheckNotCharacterAfterMinusAnd(uc16 c,
|
|
|
|
uc16 minus,
|
|
|
|
uc16 mask,
|
|
|
|
Label* on_not_equal);
|
2009-01-26 13:04:49 +00:00
|
|
|
// Checks whether the given offset from the current position is before
|
|
|
|
// the end of the string.
|
|
|
|
virtual void CheckPosition(int cp_offset, Label* on_outside_input);
|
2009-01-02 12:23:17 +00:00
|
|
|
virtual bool CheckSpecialCharacterClass(uc16 type,
|
|
|
|
int cp_offset,
|
|
|
|
bool check_offset,
|
|
|
|
Label* on_no_match);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual void DispatchByteMap(uc16 start,
|
|
|
|
Label* byte_map,
|
|
|
|
const Vector<Label*>& destinations);
|
|
|
|
virtual void DispatchHalfNibbleMap(uc16 start,
|
|
|
|
Label* half_nibble_map,
|
|
|
|
const Vector<Label*>& destinations);
|
|
|
|
virtual void DispatchHighByteMap(byte start,
|
|
|
|
Label* byte_map,
|
|
|
|
const Vector<Label*>& destinations);
|
|
|
|
virtual void EmitOrLink(Label* label);
|
|
|
|
virtual void Fail();
|
2008-12-08 09:22:12 +00:00
|
|
|
virtual Handle<Object> GetCode(Handle<String> source);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual void GoTo(Label* label);
|
|
|
|
virtual void IfRegisterGE(int reg, int comparand, Label* if_ge);
|
|
|
|
virtual void IfRegisterLT(int reg, int comparand, Label* if_lt);
|
2009-01-08 12:40:47 +00:00
|
|
|
virtual void IfRegisterEqPos(int reg, Label* if_eq);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual IrregexpImplementation Implementation();
|
2008-12-19 12:02:34 +00:00
|
|
|
virtual void LoadCurrentCharacter(int cp_offset,
|
|
|
|
Label* on_end_of_input,
|
|
|
|
bool check_bounds = true,
|
|
|
|
int characters = 1);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual void PopCurrentPosition();
|
|
|
|
virtual void PopRegister(int register_index);
|
|
|
|
virtual void PushBacktrack(Label* label);
|
|
|
|
virtual void PushCurrentPosition();
|
2009-01-12 13:05:23 +00:00
|
|
|
virtual void PushRegister(int register_index,
|
|
|
|
StackCheckFlag check_stack_limit);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual void ReadCurrentPositionFromRegister(int reg);
|
|
|
|
virtual void ReadStackPointerFromRegister(int reg);
|
|
|
|
virtual void SetRegister(int register_index, int to);
|
|
|
|
virtual void Succeed();
|
2008-12-08 09:22:12 +00:00
|
|
|
virtual void WriteCurrentPositionToRegister(int reg, int cp_offset);
|
2009-01-26 14:38:17 +00:00
|
|
|
virtual void ClearRegisters(int reg_from, int reg_to);
|
2008-11-25 11:07:48 +00:00
|
|
|
virtual void WriteStackPointerToRegister(int reg);
|
2008-11-26 13:54:08 +00:00
|
|
|
|
2009-01-12 13:05:23 +00:00
|
|
|
static Result Execute(Code* code,
|
|
|
|
Address* input,
|
|
|
|
int start_offset,
|
|
|
|
int end_offset,
|
|
|
|
int* output,
|
|
|
|
bool at_start);
|
2008-12-01 09:57:14 +00:00
|
|
|
|
2008-11-25 11:07:48 +00:00
|
|
|
private:
|
2009-01-13 10:16:02 +00:00
|
|
|
// Offsets from ebp of function parameters and stored registers.
|
|
|
|
static const int kFramePointer = 0;
|
|
|
|
// Above the frame pointer - function parameters and return address.
|
|
|
|
static const int kReturn_eip = kFramePointer + kPointerSize;
|
|
|
|
static const int kInputBuffer = kReturn_eip + kPointerSize;
|
|
|
|
static const int kInputStartOffset = kInputBuffer + kPointerSize;
|
|
|
|
static const int kInputEndOffset = kInputStartOffset + kPointerSize;
|
|
|
|
static const int kRegisterOutput = kInputEndOffset + kPointerSize;
|
|
|
|
static const int kAtStart = kRegisterOutput + kPointerSize;
|
|
|
|
static const int kStackHighEnd = kAtStart + kPointerSize;
|
|
|
|
// Below the frame pointer - local stack variables.
|
2009-01-14 11:32:23 +00:00
|
|
|
// When adding local variables remember to push space for them in
|
|
|
|
// the frame in GetCode.
|
2009-01-13 10:16:02 +00:00
|
|
|
static const int kBackup_esi = kFramePointer - kPointerSize;
|
|
|
|
static const int kBackup_edi = kBackup_esi - kPointerSize;
|
|
|
|
static const int kBackup_ebx = kBackup_edi - kPointerSize;
|
2009-01-14 11:32:23 +00:00
|
|
|
static const int kInputStartMinusOne = kBackup_ebx - kPointerSize;
|
2009-01-13 10:16:02 +00:00
|
|
|
// First register address. Following registers are below it on the stack.
|
2009-01-14 11:32:23 +00:00
|
|
|
static const int kRegisterZero = kInputStartMinusOne - kPointerSize;
|
2008-11-25 11:07:48 +00:00
|
|
|
|
2008-11-26 13:54:08 +00:00
|
|
|
// Initial size of code buffer.
|
|
|
|
static const size_t kRegExpCodeSize = 1024;
|
|
|
|
// Initial size of constant buffers allocated during compilation.
|
|
|
|
static const int kRegExpConstantsSize = 256;
|
2008-12-05 09:18:55 +00:00
|
|
|
|
2008-12-16 14:21:00 +00:00
|
|
|
// Compares two-byte strings case insensitively.
|
2009-01-12 13:05:23 +00:00
|
|
|
// Called from generated RegExp code.
|
2008-12-05 09:18:55 +00:00
|
|
|
static int CaseInsensitiveCompareUC16(uc16** buffer,
|
|
|
|
int byte_offset1,
|
|
|
|
int byte_offset2,
|
|
|
|
size_t byte_length);
|
2008-11-26 13:54:08 +00:00
|
|
|
|
2009-01-12 13:05:23 +00:00
|
|
|
// Load a number of characters at the given offset from the
|
|
|
|
// current position, into the current-character register.
|
|
|
|
void LoadCurrentCharacterUnchecked(int cp_offset, int character_count);
|
2008-12-19 12:02:34 +00:00
|
|
|
|
2009-01-12 13:05:23 +00:00
|
|
|
// Check whether preemption has been requested.
|
|
|
|
void CheckPreemption();
|
|
|
|
|
|
|
|
// Check whether we are exceeding the stack limit on the backtrack stack.
|
2009-01-02 12:23:17 +00:00
|
|
|
void CheckStackLimit();
|
|
|
|
|
2008-12-12 10:49:00 +00:00
|
|
|
// Called from RegExp if the stack-guard is triggered.
|
|
|
|
// If the code object is relocated, the return address is fixed before
|
|
|
|
// returning.
|
|
|
|
static int CheckStackGuardState(Address return_address, Code* re_code);
|
|
|
|
|
2009-01-12 13:05:23 +00:00
|
|
|
// Called from RegExp if the backtrack stack limit is hit.
|
2009-02-12 13:07:58 +00:00
|
|
|
// Tries to expand the stack. Returns the new stack-pointer if
|
|
|
|
// successful, and updates the stack_top address, or returns 0 if unable
|
|
|
|
// to grow the stack.
|
2009-01-12 13:05:23 +00:00
|
|
|
// This function must not trigger a garbage collection.
|
2009-02-12 13:07:58 +00:00
|
|
|
static Address GrowStack(Address stack_pointer, Address* stack_top);
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2008-11-25 11:07:48 +00:00
|
|
|
// The ebp-relative location of a regexp register.
|
|
|
|
Operand register_location(int register_index);
|
|
|
|
|
2008-12-01 09:57:14 +00:00
|
|
|
// The register containing the current character after LoadCurrentCharacter.
|
2009-01-12 13:05:23 +00:00
|
|
|
inline Register current_character() { return edx; }
|
|
|
|
|
|
|
|
// The register containing the backtrack stack top. Provides a meaningful
|
|
|
|
// name to the register.
|
|
|
|
inline Register backtrack_stackpointer() { return ecx; }
|
2008-12-01 09:57:14 +00:00
|
|
|
|
2008-11-25 11:07:48 +00:00
|
|
|
// Byte size of chars in the string to match (decided by the Mode argument)
|
2009-01-13 09:23:26 +00:00
|
|
|
inline int char_size() { return static_cast<int>(mode_); }
|
2008-11-25 11:07:48 +00:00
|
|
|
|
|
|
|
// Equivalent to a conditional branch to the label, unless the label
|
|
|
|
// is NULL, in which case it is a conditional Backtrack.
|
2009-01-12 13:05:23 +00:00
|
|
|
void BranchOrBacktrack(Condition condition, Label* to, Hint hint = no_hint);
|
2008-11-25 11:07:48 +00:00
|
|
|
|
|
|
|
// Load the address of a "constant buffer" (a slice of a byte array)
|
|
|
|
// into a register. The address is computed from the ByteArray* address
|
|
|
|
// and an offset. Uses no extra registers.
|
|
|
|
void LoadConstantBufferAddress(Register reg, ArraySlice* buffer);
|
|
|
|
|
2008-12-12 10:49:00 +00:00
|
|
|
// Call and return internally in the generated code in a way that
|
|
|
|
// is GC-safe (i.e., doesn't leave absolute code addresses on the stack)
|
2009-01-12 13:05:23 +00:00
|
|
|
inline void SafeCall(Label* to);
|
|
|
|
inline void SafeReturn();
|
|
|
|
|
|
|
|
// Pushes the value of a register on the backtrack stack. Decrements the
|
|
|
|
// stack pointer (ecx) by a word size and stores the register's value there.
|
|
|
|
inline void Push(Register source);
|
|
|
|
|
|
|
|
// Pushes a value on the backtrack stack. Decrements the stack pointer (ecx)
|
|
|
|
// by a word size and stores the value there.
|
|
|
|
inline void Push(Immediate value);
|
|
|
|
|
|
|
|
// Pops a value from the backtrack stack. Reads the word at the stack pointer
|
|
|
|
// (ecx) and increments it by a word size.
|
|
|
|
inline void Pop(Register target);
|
2008-12-12 10:49:00 +00:00
|
|
|
|
|
|
|
// Before calling a C-function from generated code, align arguments on stack.
|
|
|
|
// After aligning the frame, arguments must be stored in esp[0], esp[4],
|
|
|
|
// etc., not pushed. The argument count assumes all arguments are word sized.
|
2009-01-12 13:05:23 +00:00
|
|
|
// Some compilers/platforms require the stack to be aligned when calling
|
|
|
|
// C++ code.
|
2009-01-22 09:05:00 +00:00
|
|
|
// Needs a scratch register to do some arithmetic. This register will be
|
|
|
|
// trashed.
|
|
|
|
inline void FrameAlign(int num_arguments, Register scratch);
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2008-12-12 10:49:00 +00:00
|
|
|
// Calls a C function and cleans up the space for arguments allocated
|
|
|
|
// by FrameAlign. The called function is not allowed to trigger a garbage
|
|
|
|
// collection, since that might move the code and invalidate the return
|
2009-01-12 13:05:23 +00:00
|
|
|
// address (unless this is somehow accounted for).
|
|
|
|
inline void CallCFunction(Address function_address, int num_arguments);
|
2008-12-12 10:49:00 +00:00
|
|
|
|
2008-11-25 11:07:48 +00:00
|
|
|
MacroAssembler* masm_;
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2008-11-26 13:54:08 +00:00
|
|
|
// Constant buffer provider. Allocates external storage for storing
|
|
|
|
// constants.
|
2008-11-25 11:07:48 +00:00
|
|
|
ByteArrayProvider constants_;
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2009-01-13 09:23:26 +00:00
|
|
|
// Which mode to generate code for (ASCII or UC16).
|
2008-11-25 11:07:48 +00:00
|
|
|
Mode mode_;
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2008-11-25 11:07:48 +00:00
|
|
|
// One greater than maximal register index actually used.
|
|
|
|
int num_registers_;
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2008-11-25 11:07:48 +00:00
|
|
|
// Number of registers to output at the end (the saved registers
|
|
|
|
// are always 0..num_saved_registers_-1)
|
|
|
|
int num_saved_registers_;
|
2009-01-12 13:05:23 +00:00
|
|
|
|
2008-11-26 13:54:08 +00:00
|
|
|
// Labels used internally.
|
2008-11-25 11:07:48 +00:00
|
|
|
Label entry_label_;
|
|
|
|
Label start_label_;
|
|
|
|
Label success_label_;
|
2008-12-19 12:08:29 +00:00
|
|
|
Label backtrack_label_;
|
2008-11-25 11:07:48 +00:00
|
|
|
Label exit_label_;
|
2008-12-12 10:49:00 +00:00
|
|
|
Label check_preempt_label_;
|
2009-01-12 13:05:23 +00:00
|
|
|
Label stack_overflow_label_;
|
|
|
|
|
2008-11-25 11:07:48 +00:00
|
|
|
// Handle used to represent the generated code object itself.
|
|
|
|
Handle<Object> self_;
|
|
|
|
};
|
|
|
|
|
2008-11-26 13:54:08 +00:00
|
|
|
}} // namespace v8::internal
|
2008-11-25 11:07:48 +00:00
|
|
|
|
|
|
|
#endif /* REGEXP_MACRO_ASSEMBLER_IA32_H_ */
|