The data contained in this repository can be downloaded to your computer using one of several clients.
Please see the documentation of your version control software client for more information.
Please select the desired protocol below to get the URL.
This URL has Read-Only access.
main_repo / deps / v8 / src / regexp-macro-assembler-irregexp.cc @ 40c0f755
History | View | Annotate | Download (12.9 KB)
1 |
// Copyright 2008-2009 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 |
#include "v8.h" |
29 |
#include "ast.h" |
30 |
#include "bytecodes-irregexp.h" |
31 |
#include "regexp-macro-assembler.h" |
32 |
#include "regexp-macro-assembler-irregexp.h" |
33 |
#include "regexp-macro-assembler-irregexp-inl.h" |
34 |
|
35 |
|
36 |
namespace v8 { namespace internal { |
37 |
|
38 |
|
39 |
RegExpMacroAssemblerIrregexp::RegExpMacroAssemblerIrregexp(Vector<byte> buffer) |
40 |
: buffer_(buffer), |
41 |
pc_(0),
|
42 |
own_buffer_(false),
|
43 |
advance_current_end_(kInvalidPC) { |
44 |
} |
45 |
|
46 |
|
47 |
RegExpMacroAssemblerIrregexp::~RegExpMacroAssemblerIrregexp() { |
48 |
if (backtrack_.is_linked()) backtrack_.Unuse();
|
49 |
} |
50 |
|
51 |
|
52 |
RegExpMacroAssemblerIrregexp::IrregexpImplementation |
53 |
RegExpMacroAssemblerIrregexp::Implementation() { |
54 |
return kBytecodeImplementation;
|
55 |
} |
56 |
|
57 |
|
58 |
void RegExpMacroAssemblerIrregexp::Bind(Label* l) {
|
59 |
advance_current_end_ = kInvalidPC; |
60 |
ASSERT(!l->is_bound()); |
61 |
if (l->is_linked()) {
|
62 |
int pos = l->pos();
|
63 |
while (pos != 0) { |
64 |
int fixup = pos;
|
65 |
pos = *reinterpret_cast<int32_t*>(buffer_.start() + fixup);
|
66 |
*reinterpret_cast<uint32_t*>(buffer_.start() + fixup) = pc_;
|
67 |
} |
68 |
} |
69 |
l->bind_to(pc_); |
70 |
} |
71 |
|
72 |
|
73 |
void RegExpMacroAssemblerIrregexp::EmitOrLink(Label* l) {
|
74 |
if (l == NULL) l = &backtrack_; |
75 |
if (l->is_bound()) {
|
76 |
Emit32(l->pos()); |
77 |
} else {
|
78 |
int pos = 0; |
79 |
if (l->is_linked()) {
|
80 |
pos = l->pos(); |
81 |
} |
82 |
l->link_to(pc_); |
83 |
Emit32(pos); |
84 |
} |
85 |
} |
86 |
|
87 |
|
88 |
void RegExpMacroAssemblerIrregexp::PopRegister(int register_index) { |
89 |
ASSERT(register_index >= 0);
|
90 |
ASSERT(register_index <= kMaxRegister); |
91 |
Emit(BC_POP_REGISTER, register_index); |
92 |
} |
93 |
|
94 |
|
95 |
void RegExpMacroAssemblerIrregexp::PushRegister(
|
96 |
int register_index,
|
97 |
StackCheckFlag check_stack_limit) { |
98 |
ASSERT(register_index >= 0);
|
99 |
ASSERT(register_index <= kMaxRegister); |
100 |
Emit(BC_PUSH_REGISTER, register_index); |
101 |
} |
102 |
|
103 |
|
104 |
void RegExpMacroAssemblerIrregexp::WriteCurrentPositionToRegister(
|
105 |
int register_index, int cp_offset) { |
106 |
ASSERT(register_index >= 0);
|
107 |
ASSERT(register_index <= kMaxRegister); |
108 |
Emit(BC_SET_REGISTER_TO_CP, register_index); |
109 |
Emit32(cp_offset); // Current position offset.
|
110 |
} |
111 |
|
112 |
|
113 |
void RegExpMacroAssemblerIrregexp::ClearRegisters(int reg_from, int reg_to) { |
114 |
ASSERT(reg_from <= reg_to); |
115 |
for (int reg = reg_from; reg <= reg_to; reg++) { |
116 |
SetRegister(reg, -1);
|
117 |
} |
118 |
} |
119 |
|
120 |
|
121 |
void RegExpMacroAssemblerIrregexp::ReadCurrentPositionFromRegister(
|
122 |
int register_index) {
|
123 |
ASSERT(register_index >= 0);
|
124 |
ASSERT(register_index <= kMaxRegister); |
125 |
Emit(BC_SET_CP_TO_REGISTER, register_index); |
126 |
} |
127 |
|
128 |
|
129 |
void RegExpMacroAssemblerIrregexp::WriteStackPointerToRegister(
|
130 |
int register_index) {
|
131 |
ASSERT(register_index >= 0);
|
132 |
ASSERT(register_index <= kMaxRegister); |
133 |
Emit(BC_SET_REGISTER_TO_SP, register_index); |
134 |
} |
135 |
|
136 |
|
137 |
void RegExpMacroAssemblerIrregexp::ReadStackPointerFromRegister(
|
138 |
int register_index) {
|
139 |
ASSERT(register_index >= 0);
|
140 |
ASSERT(register_index <= kMaxRegister); |
141 |
Emit(BC_SET_SP_TO_REGISTER, register_index); |
142 |
} |
143 |
|
144 |
|
145 |
void RegExpMacroAssemblerIrregexp::SetRegister(int register_index, int to) { |
146 |
ASSERT(register_index >= 0);
|
147 |
ASSERT(register_index <= kMaxRegister); |
148 |
Emit(BC_SET_REGISTER, register_index); |
149 |
Emit32(to); |
150 |
} |
151 |
|
152 |
|
153 |
void RegExpMacroAssemblerIrregexp::AdvanceRegister(int register_index, int by) { |
154 |
ASSERT(register_index >= 0);
|
155 |
ASSERT(register_index <= kMaxRegister); |
156 |
Emit(BC_ADVANCE_REGISTER, register_index); |
157 |
Emit32(by); |
158 |
} |
159 |
|
160 |
|
161 |
void RegExpMacroAssemblerIrregexp::PopCurrentPosition() {
|
162 |
Emit(BC_POP_CP, 0);
|
163 |
} |
164 |
|
165 |
|
166 |
void RegExpMacroAssemblerIrregexp::PushCurrentPosition() {
|
167 |
Emit(BC_PUSH_CP, 0);
|
168 |
} |
169 |
|
170 |
|
171 |
void RegExpMacroAssemblerIrregexp::Backtrack() {
|
172 |
Emit(BC_POP_BT, 0);
|
173 |
} |
174 |
|
175 |
|
176 |
void RegExpMacroAssemblerIrregexp::GoTo(Label* l) {
|
177 |
if (advance_current_end_ == pc_) {
|
178 |
// Combine advance current and goto.
|
179 |
pc_ = advance_current_start_; |
180 |
Emit(BC_ADVANCE_CP_AND_GOTO, advance_current_offset_); |
181 |
EmitOrLink(l); |
182 |
advance_current_end_ = kInvalidPC; |
183 |
} else {
|
184 |
// Regular goto.
|
185 |
Emit(BC_GOTO, 0);
|
186 |
EmitOrLink(l); |
187 |
} |
188 |
} |
189 |
|
190 |
|
191 |
void RegExpMacroAssemblerIrregexp::PushBacktrack(Label* l) {
|
192 |
Emit(BC_PUSH_BT, 0);
|
193 |
EmitOrLink(l); |
194 |
} |
195 |
|
196 |
|
197 |
void RegExpMacroAssemblerIrregexp::Succeed() {
|
198 |
Emit(BC_SUCCEED, 0);
|
199 |
} |
200 |
|
201 |
|
202 |
void RegExpMacroAssemblerIrregexp::Fail() {
|
203 |
Emit(BC_FAIL, 0);
|
204 |
} |
205 |
|
206 |
|
207 |
void RegExpMacroAssemblerIrregexp::AdvanceCurrentPosition(int by) { |
208 |
ASSERT(by >= kMinCPOffset); |
209 |
ASSERT(by <= kMaxCPOffset); |
210 |
advance_current_start_ = pc_; |
211 |
advance_current_offset_ = by; |
212 |
Emit(BC_ADVANCE_CP, by); |
213 |
advance_current_end_ = pc_; |
214 |
} |
215 |
|
216 |
|
217 |
void RegExpMacroAssemblerIrregexp::CheckGreedyLoop(
|
218 |
Label* on_tos_equals_current_position) { |
219 |
Emit(BC_CHECK_GREEDY, 0);
|
220 |
EmitOrLink(on_tos_equals_current_position); |
221 |
} |
222 |
|
223 |
|
224 |
void RegExpMacroAssemblerIrregexp::LoadCurrentCharacter(int cp_offset, |
225 |
Label* on_failure, |
226 |
bool check_bounds,
|
227 |
int characters) {
|
228 |
ASSERT(cp_offset >= kMinCPOffset); |
229 |
ASSERT(cp_offset <= kMaxCPOffset); |
230 |
int bytecode;
|
231 |
if (check_bounds) {
|
232 |
if (characters == 4) { |
233 |
bytecode = BC_LOAD_4_CURRENT_CHARS; |
234 |
} else if (characters == 2) { |
235 |
bytecode = BC_LOAD_2_CURRENT_CHARS; |
236 |
} else {
|
237 |
ASSERT(characters == 1);
|
238 |
bytecode = BC_LOAD_CURRENT_CHAR; |
239 |
} |
240 |
} else {
|
241 |
if (characters == 4) { |
242 |
bytecode = BC_LOAD_4_CURRENT_CHARS_UNCHECKED; |
243 |
} else if (characters == 2) { |
244 |
bytecode = BC_LOAD_2_CURRENT_CHARS_UNCHECKED; |
245 |
} else {
|
246 |
ASSERT(characters == 1);
|
247 |
bytecode = BC_LOAD_CURRENT_CHAR_UNCHECKED; |
248 |
} |
249 |
} |
250 |
Emit(bytecode, cp_offset); |
251 |
if (check_bounds) EmitOrLink(on_failure);
|
252 |
} |
253 |
|
254 |
|
255 |
void RegExpMacroAssemblerIrregexp::CheckCharacterLT(uc16 limit,
|
256 |
Label* on_less) { |
257 |
Emit(BC_CHECK_LT, limit); |
258 |
EmitOrLink(on_less); |
259 |
} |
260 |
|
261 |
|
262 |
void RegExpMacroAssemblerIrregexp::CheckCharacterGT(uc16 limit,
|
263 |
Label* on_greater) { |
264 |
Emit(BC_CHECK_GT, limit); |
265 |
EmitOrLink(on_greater); |
266 |
} |
267 |
|
268 |
|
269 |
void RegExpMacroAssemblerIrregexp::CheckCharacter(uint32_t c, Label* on_equal) {
|
270 |
if (c > MAX_FIRST_ARG) {
|
271 |
Emit(BC_CHECK_4_CHARS, 0);
|
272 |
Emit32(c); |
273 |
} else {
|
274 |
Emit(BC_CHECK_CHAR, c); |
275 |
} |
276 |
EmitOrLink(on_equal); |
277 |
} |
278 |
|
279 |
|
280 |
void RegExpMacroAssemblerIrregexp::CheckAtStart(Label* on_at_start) {
|
281 |
Emit(BC_CHECK_AT_START, 0);
|
282 |
EmitOrLink(on_at_start); |
283 |
} |
284 |
|
285 |
|
286 |
void RegExpMacroAssemblerIrregexp::CheckNotAtStart(Label* on_not_at_start) {
|
287 |
Emit(BC_CHECK_NOT_AT_START, 0);
|
288 |
EmitOrLink(on_not_at_start); |
289 |
} |
290 |
|
291 |
|
292 |
void RegExpMacroAssemblerIrregexp::CheckNotCharacter(uint32_t c,
|
293 |
Label* on_not_equal) { |
294 |
if (c > MAX_FIRST_ARG) {
|
295 |
Emit(BC_CHECK_NOT_4_CHARS, 0);
|
296 |
Emit32(c); |
297 |
} else {
|
298 |
Emit(BC_CHECK_NOT_CHAR, c); |
299 |
} |
300 |
EmitOrLink(on_not_equal); |
301 |
} |
302 |
|
303 |
|
304 |
void RegExpMacroAssemblerIrregexp::CheckCharacterAfterAnd(
|
305 |
uint32_t c, |
306 |
uint32_t mask, |
307 |
Label* on_equal) { |
308 |
if (c > MAX_FIRST_ARG) {
|
309 |
Emit(BC_AND_CHECK_4_CHARS, 0);
|
310 |
Emit32(c); |
311 |
} else {
|
312 |
Emit(BC_AND_CHECK_CHAR, c); |
313 |
} |
314 |
Emit32(mask); |
315 |
EmitOrLink(on_equal); |
316 |
} |
317 |
|
318 |
|
319 |
void RegExpMacroAssemblerIrregexp::CheckNotCharacterAfterAnd(
|
320 |
uint32_t c, |
321 |
uint32_t mask, |
322 |
Label* on_not_equal) { |
323 |
if (c > MAX_FIRST_ARG) {
|
324 |
Emit(BC_AND_CHECK_NOT_4_CHARS, 0);
|
325 |
Emit32(c); |
326 |
} else {
|
327 |
Emit(BC_AND_CHECK_NOT_CHAR, c); |
328 |
} |
329 |
Emit32(mask); |
330 |
EmitOrLink(on_not_equal); |
331 |
} |
332 |
|
333 |
|
334 |
void RegExpMacroAssemblerIrregexp::CheckNotCharacterAfterMinusAnd(
|
335 |
uc16 c, |
336 |
uc16 minus, |
337 |
uc16 mask, |
338 |
Label* on_not_equal) { |
339 |
Emit(BC_MINUS_AND_CHECK_NOT_CHAR, c); |
340 |
Emit16(minus); |
341 |
Emit16(mask); |
342 |
EmitOrLink(on_not_equal); |
343 |
} |
344 |
|
345 |
|
346 |
void RegExpMacroAssemblerIrregexp::CheckNotBackReference(int start_reg, |
347 |
Label* on_not_equal) { |
348 |
ASSERT(start_reg >= 0);
|
349 |
ASSERT(start_reg <= kMaxRegister); |
350 |
Emit(BC_CHECK_NOT_BACK_REF, start_reg); |
351 |
EmitOrLink(on_not_equal); |
352 |
} |
353 |
|
354 |
|
355 |
void RegExpMacroAssemblerIrregexp::CheckNotBackReferenceIgnoreCase(
|
356 |
int start_reg,
|
357 |
Label* on_not_equal) { |
358 |
ASSERT(start_reg >= 0);
|
359 |
ASSERT(start_reg <= kMaxRegister); |
360 |
Emit(BC_CHECK_NOT_BACK_REF_NO_CASE, start_reg); |
361 |
EmitOrLink(on_not_equal); |
362 |
} |
363 |
|
364 |
|
365 |
void RegExpMacroAssemblerIrregexp::CheckNotRegistersEqual(int reg1, |
366 |
int reg2,
|
367 |
Label* on_not_equal) { |
368 |
ASSERT(reg1 >= 0);
|
369 |
ASSERT(reg1 <= kMaxRegister); |
370 |
Emit(BC_CHECK_NOT_REGS_EQUAL, reg1); |
371 |
Emit32(reg2); |
372 |
EmitOrLink(on_not_equal); |
373 |
} |
374 |
|
375 |
|
376 |
void RegExpMacroAssemblerIrregexp::CheckBitmap(uc16 start,
|
377 |
Label* bitmap, |
378 |
Label* on_zero) { |
379 |
UNIMPLEMENTED(); |
380 |
} |
381 |
|
382 |
|
383 |
void RegExpMacroAssemblerIrregexp::DispatchHalfNibbleMap(
|
384 |
uc16 start, |
385 |
Label* half_nibble_map, |
386 |
const Vector<Label*>& table) {
|
387 |
UNIMPLEMENTED(); |
388 |
} |
389 |
|
390 |
|
391 |
void RegExpMacroAssemblerIrregexp::DispatchByteMap(
|
392 |
uc16 start, |
393 |
Label* byte_map, |
394 |
const Vector<Label*>& table) {
|
395 |
UNIMPLEMENTED(); |
396 |
} |
397 |
|
398 |
|
399 |
void RegExpMacroAssemblerIrregexp::DispatchHighByteMap(
|
400 |
byte start, |
401 |
Label* byte_map, |
402 |
const Vector<Label*>& table) {
|
403 |
UNIMPLEMENTED(); |
404 |
} |
405 |
|
406 |
|
407 |
void RegExpMacroAssemblerIrregexp::CheckCharacters(
|
408 |
Vector<const uc16> str,
|
409 |
int cp_offset,
|
410 |
Label* on_failure, |
411 |
bool check_end_of_string) {
|
412 |
ASSERT(cp_offset >= kMinCPOffset); |
413 |
ASSERT(cp_offset + str.length() - 1 <= kMaxCPOffset);
|
414 |
// It is vital that this loop is backwards due to the unchecked character
|
415 |
// load below.
|
416 |
for (int i = str.length() - 1; i >= 0; i--) { |
417 |
if (check_end_of_string && i == str.length() - 1) { |
418 |
Emit(BC_LOAD_CURRENT_CHAR, cp_offset + i); |
419 |
EmitOrLink(on_failure); |
420 |
} else {
|
421 |
Emit(BC_LOAD_CURRENT_CHAR_UNCHECKED, cp_offset + i); |
422 |
} |
423 |
Emit(BC_CHECK_NOT_CHAR, str[i]); |
424 |
EmitOrLink(on_failure); |
425 |
} |
426 |
} |
427 |
|
428 |
|
429 |
void RegExpMacroAssemblerIrregexp::IfRegisterLT(int register_index, |
430 |
int comparand,
|
431 |
Label* on_less_than) { |
432 |
ASSERT(register_index >= 0);
|
433 |
ASSERT(register_index <= kMaxRegister); |
434 |
Emit(BC_CHECK_REGISTER_LT, register_index); |
435 |
Emit32(comparand); |
436 |
EmitOrLink(on_less_than); |
437 |
} |
438 |
|
439 |
|
440 |
void RegExpMacroAssemblerIrregexp::IfRegisterGE(int register_index, |
441 |
int comparand,
|
442 |
Label* on_greater_or_equal) { |
443 |
ASSERT(register_index >= 0);
|
444 |
ASSERT(register_index <= kMaxRegister); |
445 |
Emit(BC_CHECK_REGISTER_GE, register_index); |
446 |
Emit32(comparand); |
447 |
EmitOrLink(on_greater_or_equal); |
448 |
} |
449 |
|
450 |
|
451 |
void RegExpMacroAssemblerIrregexp::IfRegisterEqPos(int register_index, |
452 |
Label* on_eq) { |
453 |
ASSERT(register_index >= 0);
|
454 |
ASSERT(register_index <= kMaxRegister); |
455 |
Emit(BC_CHECK_REGISTER_EQ_POS, register_index); |
456 |
EmitOrLink(on_eq); |
457 |
} |
458 |
|
459 |
|
460 |
Handle<Object> RegExpMacroAssemblerIrregexp::GetCode(Handle<String> source) { |
461 |
Bind(&backtrack_); |
462 |
Emit(BC_POP_BT, 0);
|
463 |
Handle<ByteArray> array = Factory::NewByteArray(length()); |
464 |
Copy(array->GetDataStartAddress()); |
465 |
return array;
|
466 |
} |
467 |
|
468 |
|
469 |
int RegExpMacroAssemblerIrregexp::length() {
|
470 |
return pc_;
|
471 |
} |
472 |
|
473 |
|
474 |
void RegExpMacroAssemblerIrregexp::Copy(Address a) {
|
475 |
memcpy(a, buffer_.start(), length()); |
476 |
} |
477 |
|
478 |
|
479 |
void RegExpMacroAssemblerIrregexp::Expand() {
|
480 |
bool old_buffer_was_our_own = own_buffer_;
|
481 |
Vector<byte> old_buffer = buffer_; |
482 |
buffer_ = Vector<byte>::New(old_buffer.length() * 2);
|
483 |
own_buffer_ = true;
|
484 |
memcpy(buffer_.start(), old_buffer.start(), old_buffer.length()); |
485 |
if (old_buffer_was_our_own) {
|
486 |
old_buffer.Dispose(); |
487 |
} |
488 |
} |
489 |
|
490 |
|
491 |
} } // namespace v8::internal
|