blob: b487ba59d1f3805015e6f1bf1919a31ff4e86d93 [file] [log] [blame]
Steve Blocka7e24c12009-10-30 11:49:00 +00001// Copyright 2006-2008 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
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_ARM_REGEXP_MACRO_ASSEMBLER_ARM_H_
29#define V8_ARM_REGEXP_MACRO_ASSEMBLER_ARM_H_
30
31namespace v8 {
32namespace internal {
33
34
Steve Block6ded16b2010-05-10 14:33:55 +010035#ifdef V8_INTERPRETED_REGEXP
Steve Blocka7e24c12009-10-30 11:49:00 +000036class RegExpMacroAssemblerARM: public RegExpMacroAssembler {
37 public:
38 RegExpMacroAssemblerARM();
39 virtual ~RegExpMacroAssemblerARM();
40};
41
Steve Block6ded16b2010-05-10 14:33:55 +010042#else // V8_INTERPRETED_REGEXP
Steve Blocka7e24c12009-10-30 11:49:00 +000043class RegExpMacroAssemblerARM: public NativeRegExpMacroAssembler {
44 public:
45 RegExpMacroAssemblerARM(Mode mode, int registers_to_save);
46 virtual ~RegExpMacroAssemblerARM();
47 virtual int stack_limit_slack();
48 virtual void AdvanceCurrentPosition(int by);
49 virtual void AdvanceRegister(int reg, int by);
50 virtual void Backtrack();
51 virtual void Bind(Label* label);
52 virtual void CheckAtStart(Label* on_at_start);
Ben Murdochb8e0da22011-05-16 14:20:40 +010053 virtual void CheckCharacter(unsigned c, Label* on_equal);
54 virtual void CheckCharacterAfterAnd(unsigned c,
55 unsigned mask,
Steve Blocka7e24c12009-10-30 11:49:00 +000056 Label* on_equal);
57 virtual void CheckCharacterGT(uc16 limit, Label* on_greater);
58 virtual void CheckCharacterLT(uc16 limit, Label* on_less);
59 virtual void CheckCharacters(Vector<const uc16> str,
60 int cp_offset,
61 Label* on_failure,
62 bool check_end_of_string);
63 // A "greedy loop" is a loop that is both greedy and with a simple
64 // body. It has a particularly simple implementation.
65 virtual void CheckGreedyLoop(Label* on_tos_equals_current_position);
66 virtual void CheckNotAtStart(Label* on_not_at_start);
67 virtual void CheckNotBackReference(int start_reg, Label* on_no_match);
68 virtual void CheckNotBackReferenceIgnoreCase(int start_reg,
69 Label* on_no_match);
70 virtual void CheckNotRegistersEqual(int reg1, int reg2, Label* on_not_equal);
Ben Murdochb8e0da22011-05-16 14:20:40 +010071 virtual void CheckNotCharacter(unsigned c, Label* on_not_equal);
72 virtual void CheckNotCharacterAfterAnd(unsigned c,
73 unsigned mask,
Steve Blocka7e24c12009-10-30 11:49:00 +000074 Label* on_not_equal);
75 virtual void CheckNotCharacterAfterMinusAnd(uc16 c,
76 uc16 minus,
77 uc16 mask,
78 Label* on_not_equal);
79 // Checks whether the given offset from the current position is before
80 // the end of the string.
81 virtual void CheckPosition(int cp_offset, Label* on_outside_input);
82 virtual bool CheckSpecialCharacterClass(uc16 type,
Steve Blocka7e24c12009-10-30 11:49:00 +000083 Label* on_no_match);
84 virtual void Fail();
85 virtual Handle<Object> GetCode(Handle<String> source);
86 virtual void GoTo(Label* label);
87 virtual void IfRegisterGE(int reg, int comparand, Label* if_ge);
88 virtual void IfRegisterLT(int reg, int comparand, Label* if_lt);
89 virtual void IfRegisterEqPos(int reg, Label* if_eq);
90 virtual IrregexpImplementation Implementation();
91 virtual void LoadCurrentCharacter(int cp_offset,
92 Label* on_end_of_input,
93 bool check_bounds = true,
94 int characters = 1);
95 virtual void PopCurrentPosition();
96 virtual void PopRegister(int register_index);
97 virtual void PushBacktrack(Label* label);
98 virtual void PushCurrentPosition();
99 virtual void PushRegister(int register_index,
100 StackCheckFlag check_stack_limit);
101 virtual void ReadCurrentPositionFromRegister(int reg);
102 virtual void ReadStackPointerFromRegister(int reg);
Ben Murdochf87a2032010-10-22 12:50:53 +0100103 virtual void SetCurrentPositionFromEnd(int by);
Steve Blocka7e24c12009-10-30 11:49:00 +0000104 virtual void SetRegister(int register_index, int to);
105 virtual void Succeed();
106 virtual void WriteCurrentPositionToRegister(int reg, int cp_offset);
107 virtual void ClearRegisters(int reg_from, int reg_to);
108 virtual void WriteStackPointerToRegister(int reg);
109
110 // Called from RegExp if the stack-guard is triggered.
111 // If the code object is relocated, the return address is fixed before
112 // returning.
113 static int CheckStackGuardState(Address* return_address,
114 Code* re_code,
115 Address re_frame);
116 private:
117 // Offsets from frame_pointer() of function parameters and stored registers.
118 static const int kFramePointer = 0;
119
120 // Above the frame pointer - Stored registers and stack passed parameters.
121 // Register 4..11.
122 static const int kStoredRegisters = kFramePointer;
123 // Return address (stored from link register, read into pc on return).
124 static const int kReturnAddress = kStoredRegisters + 8 * kPointerSize;
125 // Stack parameters placed by caller.
126 static const int kRegisterOutput = kReturnAddress + kPointerSize;
Leon Clarked91b9f72010-01-27 17:25:45 +0000127 static const int kStackHighEnd = kRegisterOutput + kPointerSize;
Leon Clarkee46be812010-01-19 14:06:41 +0000128 static const int kDirectCall = kStackHighEnd + kPointerSize;
Steve Blocka7e24c12009-10-30 11:49:00 +0000129
130 // Below the frame pointer.
131 // Register parameters stored by setup code.
132 static const int kInputEnd = kFramePointer - kPointerSize;
133 static const int kInputStart = kInputEnd - kPointerSize;
134 static const int kStartIndex = kInputStart - kPointerSize;
135 static const int kInputString = kStartIndex - kPointerSize;
136 // When adding local variables remember to push space for them in
137 // the frame in GetCode.
138 static const int kInputStartMinusOne = kInputString - kPointerSize;
Leon Clarked91b9f72010-01-27 17:25:45 +0000139 static const int kAtStart = kInputStartMinusOne - kPointerSize;
Steve Blocka7e24c12009-10-30 11:49:00 +0000140 // First register address. Following registers are below it on the stack.
Leon Clarked91b9f72010-01-27 17:25:45 +0000141 static const int kRegisterZero = kAtStart - kPointerSize;
Steve Blocka7e24c12009-10-30 11:49:00 +0000142
143 // Initial size of code buffer.
144 static const size_t kRegExpCodeSize = 1024;
145
146 static const int kBacktrackConstantPoolSize = 4;
147
148 // Load a number of characters at the given offset from the
149 // current position, into the current-character register.
150 void LoadCurrentCharacterUnchecked(int cp_offset, int character_count);
151
152 // Check whether preemption has been requested.
153 void CheckPreemption();
154
155 // Check whether we are exceeding the stack limit on the backtrack stack.
156 void CheckStackLimit();
157
158 void EmitBacktrackConstantPool();
159 int GetBacktrackConstantPoolEntry();
160
161
162 // Generate a call to CheckStackGuardState.
163 void CallCheckStackGuardState(Register scratch);
164
165 // The ebp-relative location of a regexp register.
166 MemOperand register_location(int register_index);
167
168 // Register holding the current input position as negative offset from
169 // the end of the string.
170 inline Register current_input_offset() { return r6; }
171
172 // The register containing the current character after LoadCurrentCharacter.
173 inline Register current_character() { return r7; }
174
175 // Register holding address of the end of the input string.
176 inline Register end_of_input_address() { return r10; }
177
178 // Register holding the frame address. Local variables, parameters and
179 // regexp registers are addressed relative to this.
180 inline Register frame_pointer() { return fp; }
181
182 // The register containing the backtrack stack top. Provides a meaningful
183 // name to the register.
184 inline Register backtrack_stackpointer() { return r8; }
185
186 // Register holding pointer to the current code object.
187 inline Register code_pointer() { return r5; }
188
189 // Byte size of chars in the string to match (decided by the Mode argument)
190 inline int char_size() { return static_cast<int>(mode_); }
191
192 // Equivalent to a conditional branch to the label, unless the label
193 // is NULL, in which case it is a conditional Backtrack.
194 void BranchOrBacktrack(Condition condition, Label* to);
195
196 // Call and return internally in the generated code in a way that
197 // is GC-safe (i.e., doesn't leave absolute code addresses on the stack)
198 inline void SafeCall(Label* to, Condition cond = al);
199 inline void SafeReturn();
200 inline void SafeCallTarget(Label* name);
201
202 // Pushes the value of a register on the backtrack stack. Decrements the
203 // stack pointer by a word size and stores the register's value there.
204 inline void Push(Register source);
205
206 // Pops a value from the backtrack stack. Reads the word at the stack pointer
207 // and increments it by a word size.
208 inline void Pop(Register target);
209
Steve Blocka7e24c12009-10-30 11:49:00 +0000210 // Calls a C function and cleans up the frame alignment done by
211 // by FrameAlign. The called function *is* allowed to trigger a garbage
212 // collection, but may not take more than four arguments (no arguments
213 // passed on the stack), and the first argument will be a pointer to the
214 // return address.
215 inline void CallCFunctionUsingStub(ExternalReference function,
216 int num_arguments);
217
218
219 MacroAssembler* masm_;
220
221 // Which mode to generate code for (ASCII or UC16).
222 Mode mode_;
223
224 // One greater than maximal register index actually used.
225 int num_registers_;
226
227 // Number of registers to output at the end (the saved registers
228 // are always 0..num_saved_registers_-1)
229 int num_saved_registers_;
230
231 // Manage a small pre-allocated pool for writing label targets
232 // to for pushing backtrack addresses.
233 int backtrack_constant_pool_offset_;
234 int backtrack_constant_pool_capacity_;
235
236 // Labels used internally.
237 Label entry_label_;
238 Label start_label_;
239 Label success_label_;
240 Label backtrack_label_;
241 Label exit_label_;
242 Label check_preempt_label_;
243 Label stack_overflow_label_;
244};
245
Steve Block6ded16b2010-05-10 14:33:55 +0100246#endif // V8_INTERPRETED_REGEXP
Steve Blocka7e24c12009-10-30 11:49:00 +0000247
248
249}} // namespace v8::internal
250
251#endif // V8_ARM_REGEXP_MACRO_ASSEMBLER_ARM_H_