/[pcre]/code/trunk/pcre_jit_compile.c
ViewVC logotype

Contents of /code/trunk/pcre_jit_compile.c

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1414 - (show annotations)
Sun Dec 22 16:27:35 2013 UTC (5 years, 10 months ago) by zherczeg
File MIME type: text/plain
File size: 313157 byte(s)
Error occurred while calculating annotation data.
A new flag is set, when property checks are present in an XCLASS.
1 /*************************************************
2 * Perl-Compatible Regular Expressions *
3 *************************************************/
4
5 /* PCRE is a library of functions to support regular expressions whose syntax
6 and semantics are as close as possible to those of the Perl 5 language.
7
8 Written by Philip Hazel
9 Copyright (c) 1997-2013 University of Cambridge
10
11 The machine code generator part (this module) was written by Zoltan Herczeg
12 Copyright (c) 2010-2013
13
14 -----------------------------------------------------------------------------
15 Redistribution and use in source and binary forms, with or without
16 modification, are permitted provided that the following conditions are met:
17
18 * Redistributions of source code must retain the above copyright notice,
19 this list of conditions and the following disclaimer.
20
21 * Redistributions in binary form must reproduce the above copyright
22 notice, this list of conditions and the following disclaimer in the
23 documentation and/or other materials provided with the distribution.
24
25 * Neither the name of the University of Cambridge nor the names of its
26 contributors may be used to endorse or promote products derived from
27 this software without specific prior written permission.
28
29 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
30 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
33 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
34 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
35 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
36 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
37 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
38 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
39 POSSIBILITY OF SUCH DAMAGE.
40 -----------------------------------------------------------------------------
41 */
42
43 #ifdef HAVE_CONFIG_H
44 #include "config.h"
45 #endif
46
47 #include "pcre_internal.h"
48
49 #if defined SUPPORT_JIT
50
51 /* All-in-one: Since we use the JIT compiler only from here,
52 we just include it. This way we don't need to touch the build
53 system files. */
54
55 #define SLJIT_MALLOC(size) (PUBL(malloc))(size)
56 #define SLJIT_FREE(ptr) (PUBL(free))(ptr)
57 #define SLJIT_CONFIG_AUTO 1
58 #define SLJIT_CONFIG_STATIC 1
59 #define SLJIT_VERBOSE 0
60 #define SLJIT_DEBUG 0
61
62 #include "sljit/sljitLir.c"
63
64 #if defined SLJIT_CONFIG_UNSUPPORTED && SLJIT_CONFIG_UNSUPPORTED
65 #error Unsupported architecture
66 #endif
67
68 /* Defines for debugging purposes. */
69
70 /* 1 - Use unoptimized capturing brackets.
71 2 - Enable capture_last_ptr (includes option 1). */
72 /* #define DEBUG_FORCE_UNOPTIMIZED_CBRAS 2 */
73
74 /* 1 - Always have a control head. */
75 /* #define DEBUG_FORCE_CONTROL_HEAD 1 */
76
77 /* Allocate memory for the regex stack on the real machine stack.
78 Fast, but limited size. */
79 #define MACHINE_STACK_SIZE 32768
80
81 /* Growth rate for stack allocated by the OS. Should be the multiply
82 of page size. */
83 #define STACK_GROWTH_RATE 8192
84
85 /* Enable to check that the allocation could destroy temporaries. */
86 #if defined SLJIT_DEBUG && SLJIT_DEBUG
87 #define DESTROY_REGISTERS 1
88 #endif
89
90 /*
91 Short summary about the backtracking mechanism empolyed by the jit code generator:
92
93 The code generator follows the recursive nature of the PERL compatible regular
94 expressions. The basic blocks of regular expressions are condition checkers
95 whose execute different commands depending on the result of the condition check.
96 The relationship between the operators can be horizontal (concatenation) and
97 vertical (sub-expression) (See struct backtrack_common for more details).
98
99 'ab' - 'a' and 'b' regexps are concatenated
100 'a+' - 'a' is the sub-expression of the '+' operator
101
102 The condition checkers are boolean (true/false) checkers. Machine code is generated
103 for the checker itself and for the actions depending on the result of the checker.
104 The 'true' case is called as the matching path (expected path), and the other is called as
105 the 'backtrack' path. Branch instructions are expesive for all CPUs, so we avoid taken
106 branches on the matching path.
107
108 Greedy star operator (*) :
109 Matching path: match happens.
110 Backtrack path: match failed.
111 Non-greedy star operator (*?) :
112 Matching path: no need to perform a match.
113 Backtrack path: match is required.
114
115 The following example shows how the code generated for a capturing bracket
116 with two alternatives. Let A, B, C, D are arbirary regular expressions, and
117 we have the following regular expression:
118
119 A(B|C)D
120
121 The generated code will be the following:
122
123 A matching path
124 '(' matching path (pushing arguments to the stack)
125 B matching path
126 ')' matching path (pushing arguments to the stack)
127 D matching path
128 return with successful match
129
130 D backtrack path
131 ')' backtrack path (If we arrived from "C" jump to the backtrack of "C")
132 B backtrack path
133 C expected path
134 jump to D matching path
135 C backtrack path
136 A backtrack path
137
138 Notice, that the order of backtrack code paths are the opposite of the fast
139 code paths. In this way the topmost value on the stack is always belong
140 to the current backtrack code path. The backtrack path must check
141 whether there is a next alternative. If so, it needs to jump back to
142 the matching path eventually. Otherwise it needs to clear out its own stack
143 frame and continue the execution on the backtrack code paths.
144 */
145
146 /*
147 Saved stack frames:
148
149 Atomic blocks and asserts require reloading the values of private data
150 when the backtrack mechanism performed. Because of OP_RECURSE, the data
151 are not necessarly known in compile time, thus we need a dynamic restore
152 mechanism.
153
154 The stack frames are stored in a chain list, and have the following format:
155 ([ capturing bracket offset ][ start value ][ end value ])+ ... [ 0 ] [ previous head ]
156
157 Thus we can restore the private data to a particular point in the stack.
158 */
159
160 typedef struct jit_arguments {
161 /* Pointers first. */
162 struct sljit_stack *stack;
163 const pcre_uchar *str;
164 const pcre_uchar *begin;
165 const pcre_uchar *end;
166 int *offsets;
167 pcre_uchar *uchar_ptr;
168 pcre_uchar *mark_ptr;
169 void *callout_data;
170 /* Everything else after. */
171 pcre_uint32 limit_match;
172 int real_offset_count;
173 int offset_count;
174 pcre_uint8 notbol;
175 pcre_uint8 noteol;
176 pcre_uint8 notempty;
177 pcre_uint8 notempty_atstart;
178 } jit_arguments;
179
180 typedef struct executable_functions {
181 void *executable_funcs[JIT_NUMBER_OF_COMPILE_MODES];
182 PUBL(jit_callback) callback;
183 void *userdata;
184 pcre_uint32 top_bracket;
185 pcre_uint32 limit_match;
186 sljit_uw executable_sizes[JIT_NUMBER_OF_COMPILE_MODES];
187 } executable_functions;
188
189 typedef struct jump_list {
190 struct sljit_jump *jump;
191 struct jump_list *next;
192 } jump_list;
193
194 typedef struct stub_list {
195 struct sljit_jump *start;
196 struct sljit_label *quit;
197 struct stub_list *next;
198 } stub_list;
199
200 enum frame_types {
201 no_frame = -1,
202 no_stack = -2
203 };
204
205 enum control_types {
206 type_mark = 0,
207 type_then_trap = 1
208 };
209
210 typedef int (SLJIT_CALL *jit_function)(jit_arguments *args);
211
212 /* The following structure is the key data type for the recursive
213 code generator. It is allocated by compile_matchingpath, and contains
214 the arguments for compile_backtrackingpath. Must be the first member
215 of its descendants. */
216 typedef struct backtrack_common {
217 /* Concatenation stack. */
218 struct backtrack_common *prev;
219 jump_list *nextbacktracks;
220 /* Internal stack (for component operators). */
221 struct backtrack_common *top;
222 jump_list *topbacktracks;
223 /* Opcode pointer. */
224 pcre_uchar *cc;
225 } backtrack_common;
226
227 typedef struct assert_backtrack {
228 backtrack_common common;
229 jump_list *condfailed;
230 /* Less than 0 if a frame is not needed. */
231 int framesize;
232 /* Points to our private memory word on the stack. */
233 int private_data_ptr;
234 /* For iterators. */
235 struct sljit_label *matchingpath;
236 } assert_backtrack;
237
238 typedef struct bracket_backtrack {
239 backtrack_common common;
240 /* Where to coninue if an alternative is successfully matched. */
241 struct sljit_label *alternative_matchingpath;
242 /* For rmin and rmax iterators. */
243 struct sljit_label *recursive_matchingpath;
244 /* For greedy ? operator. */
245 struct sljit_label *zero_matchingpath;
246 /* Contains the branches of a failed condition. */
247 union {
248 /* Both for OP_COND, OP_SCOND. */
249 jump_list *condfailed;
250 assert_backtrack *assert;
251 /* For OP_ONCE. Less than 0 if not needed. */
252 int framesize;
253 } u;
254 /* Points to our private memory word on the stack. */
255 int private_data_ptr;
256 } bracket_backtrack;
257
258 typedef struct bracketpos_backtrack {
259 backtrack_common common;
260 /* Points to our private memory word on the stack. */
261 int private_data_ptr;
262 /* Reverting stack is needed. */
263 int framesize;
264 /* Allocated stack size. */
265 int stacksize;
266 } bracketpos_backtrack;
267
268 typedef struct braminzero_backtrack {
269 backtrack_common common;
270 struct sljit_label *matchingpath;
271 } braminzero_backtrack;
272
273 typedef struct iterator_backtrack {
274 backtrack_common common;
275 /* Next iteration. */
276 struct sljit_label *matchingpath;
277 } iterator_backtrack;
278
279 typedef struct recurse_entry {
280 struct recurse_entry *next;
281 /* Contains the function entry. */
282 struct sljit_label *entry;
283 /* Collects the calls until the function is not created. */
284 jump_list *calls;
285 /* Points to the starting opcode. */
286 sljit_sw start;
287 } recurse_entry;
288
289 typedef struct recurse_backtrack {
290 backtrack_common common;
291 BOOL inlined_pattern;
292 } recurse_backtrack;
293
294 #define OP_THEN_TRAP OP_TABLE_LENGTH
295
296 typedef struct then_trap_backtrack {
297 backtrack_common common;
298 /* If then_trap is not NULL, this structure contains the real
299 then_trap for the backtracking path. */
300 struct then_trap_backtrack *then_trap;
301 /* Points to the starting opcode. */
302 sljit_sw start;
303 /* Exit point for the then opcodes of this alternative. */
304 jump_list *quit;
305 /* Frame size of the current alternative. */
306 int framesize;
307 } then_trap_backtrack;
308
309 #define MAX_RANGE_SIZE 6
310
311 typedef struct compiler_common {
312 /* The sljit ceneric compiler. */
313 struct sljit_compiler *compiler;
314 /* First byte code. */
315 pcre_uchar *start;
316 /* Maps private data offset to each opcode. */
317 sljit_si *private_data_ptrs;
318 /* Tells whether the capturing bracket is optimized. */
319 pcre_uint8 *optimized_cbracket;
320 /* Tells whether the starting offset is a target of then. */
321 pcre_uint8 *then_offsets;
322 /* Current position where a THEN must jump. */
323 then_trap_backtrack *then_trap;
324 /* Starting offset of private data for capturing brackets. */
325 int cbra_ptr;
326 /* Output vector starting point. Must be divisible by 2. */
327 int ovector_start;
328 /* Last known position of the requested byte. */
329 int req_char_ptr;
330 /* Head of the last recursion. */
331 int recursive_head_ptr;
332 /* First inspected character for partial matching. */
333 int start_used_ptr;
334 /* Starting pointer for partial soft matches. */
335 int hit_start;
336 /* End pointer of the first line. */
337 int first_line_end;
338 /* Points to the marked string. */
339 int mark_ptr;
340 /* Recursive control verb management chain. */
341 int control_head_ptr;
342 /* Points to the last matched capture block index. */
343 int capture_last_ptr;
344 /* Points to the starting position of the current match. */
345 int start_ptr;
346
347 /* Flipped and lower case tables. */
348 const pcre_uint8 *fcc;
349 sljit_sw lcc;
350 /* Mode can be PCRE_STUDY_JIT_COMPILE and others. */
351 int mode;
352 /* \K is found in the pattern. */
353 BOOL has_set_som;
354 /* (*SKIP:arg) is found in the pattern. */
355 BOOL has_skip_arg;
356 /* (*THEN) is found in the pattern. */
357 BOOL has_then;
358 /* Needs to know the start position anytime. */
359 BOOL needs_start_ptr;
360 /* Currently in recurse or negative assert. */
361 BOOL local_exit;
362 /* Currently in a positive assert. */
363 BOOL positive_assert;
364 /* Newline control. */
365 int nltype;
366 int newline;
367 int bsr_nltype;
368 /* Dollar endonly. */
369 int endonly;
370 /* Tables. */
371 sljit_sw ctypes;
372 int digits[2 + MAX_RANGE_SIZE];
373 /* Named capturing brackets. */
374 pcre_uchar *name_table;
375 sljit_sw name_count;
376 sljit_sw name_entry_size;
377
378 /* Labels and jump lists. */
379 struct sljit_label *partialmatchlabel;
380 struct sljit_label *quit_label;
381 struct sljit_label *forced_quit_label;
382 struct sljit_label *accept_label;
383 stub_list *stubs;
384 recurse_entry *entries;
385 recurse_entry *currententry;
386 jump_list *partialmatch;
387 jump_list *quit;
388 jump_list *positive_assert_quit;
389 jump_list *forced_quit;
390 jump_list *accept;
391 jump_list *calllimit;
392 jump_list *stackalloc;
393 jump_list *revertframes;
394 jump_list *wordboundary;
395 jump_list *anynewline;
396 jump_list *hspace;
397 jump_list *vspace;
398 jump_list *casefulcmp;
399 jump_list *caselesscmp;
400 jump_list *reset_match;
401 BOOL jscript_compat;
402 #ifdef SUPPORT_UTF
403 BOOL utf;
404 #ifdef SUPPORT_UCP
405 BOOL use_ucp;
406 #endif
407 #ifndef COMPILE_PCRE32
408 jump_list *utfreadchar;
409 #endif
410 #ifdef COMPILE_PCRE8
411 jump_list *utfreadtype8;
412 #endif
413 #endif /* SUPPORT_UTF */
414 #ifdef SUPPORT_UCP
415 jump_list *getucd;
416 #endif
417 } compiler_common;
418
419 /* For byte_sequence_compare. */
420
421 typedef struct compare_context {
422 int length;
423 int sourcereg;
424 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
425 int ucharptr;
426 union {
427 sljit_si asint;
428 sljit_uh asushort;
429 #if defined COMPILE_PCRE8
430 sljit_ub asbyte;
431 sljit_ub asuchars[4];
432 #elif defined COMPILE_PCRE16
433 sljit_uh asuchars[2];
434 #elif defined COMPILE_PCRE32
435 sljit_ui asuchars[1];
436 #endif
437 } c;
438 union {
439 sljit_si asint;
440 sljit_uh asushort;
441 #if defined COMPILE_PCRE8
442 sljit_ub asbyte;
443 sljit_ub asuchars[4];
444 #elif defined COMPILE_PCRE16
445 sljit_uh asuchars[2];
446 #elif defined COMPILE_PCRE32
447 sljit_ui asuchars[1];
448 #endif
449 } oc;
450 #endif
451 } compare_context;
452
453 /* Undefine sljit macros. */
454 #undef CMP
455
456 /* Used for accessing the elements of the stack. */
457 #define STACK(i) ((-(i) - 1) * (int)sizeof(sljit_sw))
458
459 #define TMP1 SLJIT_SCRATCH_REG1
460 #define TMP2 SLJIT_SCRATCH_REG3
461 #define TMP3 SLJIT_TEMPORARY_EREG2
462 #define STR_PTR SLJIT_SAVED_REG1
463 #define STR_END SLJIT_SAVED_REG2
464 #define STACK_TOP SLJIT_SCRATCH_REG2
465 #define STACK_LIMIT SLJIT_SAVED_REG3
466 #define ARGUMENTS SLJIT_SAVED_EREG1
467 #define COUNT_MATCH SLJIT_SAVED_EREG2
468 #define RETURN_ADDR SLJIT_TEMPORARY_EREG1
469
470 /* Local space layout. */
471 /* These two locals can be used by the current opcode. */
472 #define LOCALS0 (0 * sizeof(sljit_sw))
473 #define LOCALS1 (1 * sizeof(sljit_sw))
474 /* Two local variables for possessive quantifiers (char1 cannot use them). */
475 #define POSSESSIVE0 (2 * sizeof(sljit_sw))
476 #define POSSESSIVE1 (3 * sizeof(sljit_sw))
477 /* Max limit of recursions. */
478 #define LIMIT_MATCH (4 * sizeof(sljit_sw))
479 /* The output vector is stored on the stack, and contains pointers
480 to characters. The vector data is divided into two groups: the first
481 group contains the start / end character pointers, and the second is
482 the start pointers when the end of the capturing group has not yet reached. */
483 #define OVECTOR_START (common->ovector_start)
484 #define OVECTOR(i) (OVECTOR_START + (i) * (sljit_sw)sizeof(sljit_sw))
485 #define OVECTOR_PRIV(i) (common->cbra_ptr + (i) * (sljit_sw)sizeof(sljit_sw))
486 #define PRIVATE_DATA(cc) (common->private_data_ptrs[(cc) - common->start])
487
488 #if defined COMPILE_PCRE8
489 #define MOV_UCHAR SLJIT_MOV_UB
490 #define MOVU_UCHAR SLJIT_MOVU_UB
491 #elif defined COMPILE_PCRE16
492 #define MOV_UCHAR SLJIT_MOV_UH
493 #define MOVU_UCHAR SLJIT_MOVU_UH
494 #elif defined COMPILE_PCRE32
495 #define MOV_UCHAR SLJIT_MOV_UI
496 #define MOVU_UCHAR SLJIT_MOVU_UI
497 #else
498 #error Unsupported compiling mode
499 #endif
500
501 /* Shortcuts. */
502 #define DEFINE_COMPILER \
503 struct sljit_compiler *compiler = common->compiler
504 #define OP1(op, dst, dstw, src, srcw) \
505 sljit_emit_op1(compiler, (op), (dst), (dstw), (src), (srcw))
506 #define OP2(op, dst, dstw, src1, src1w, src2, src2w) \
507 sljit_emit_op2(compiler, (op), (dst), (dstw), (src1), (src1w), (src2), (src2w))
508 #define LABEL() \
509 sljit_emit_label(compiler)
510 #define JUMP(type) \
511 sljit_emit_jump(compiler, (type))
512 #define JUMPTO(type, label) \
513 sljit_set_label(sljit_emit_jump(compiler, (type)), (label))
514 #define JUMPHERE(jump) \
515 sljit_set_label((jump), sljit_emit_label(compiler))
516 #define SET_LABEL(jump, label) \
517 sljit_set_label((jump), (label))
518 #define CMP(type, src1, src1w, src2, src2w) \
519 sljit_emit_cmp(compiler, (type), (src1), (src1w), (src2), (src2w))
520 #define CMPTO(type, src1, src1w, src2, src2w, label) \
521 sljit_set_label(sljit_emit_cmp(compiler, (type), (src1), (src1w), (src2), (src2w)), (label))
522 #define OP_FLAGS(op, dst, dstw, src, srcw, type) \
523 sljit_emit_op_flags(compiler, (op), (dst), (dstw), (src), (srcw), (type))
524 #define GET_LOCAL_BASE(dst, dstw, offset) \
525 sljit_get_local_base(compiler, (dst), (dstw), (offset))
526
527 static pcre_uchar* bracketend(pcre_uchar* cc)
528 {
529 SLJIT_ASSERT((*cc >= OP_ASSERT && *cc <= OP_ASSERTBACK_NOT) || (*cc >= OP_ONCE && *cc <= OP_SCOND));
530 do cc += GET(cc, 1); while (*cc == OP_ALT);
531 SLJIT_ASSERT(*cc >= OP_KET && *cc <= OP_KETRPOS);
532 cc += 1 + LINK_SIZE;
533 return cc;
534 }
535
536 /* Functions whose might need modification for all new supported opcodes:
537 next_opcode
538 check_opcode_types
539 set_private_data_ptrs
540 get_framesize
541 init_frame
542 get_private_data_copy_length
543 copy_private_data
544 compile_matchingpath
545 compile_backtrackingpath
546 */
547
548 static pcre_uchar *next_opcode(compiler_common *common, pcre_uchar *cc)
549 {
550 SLJIT_UNUSED_ARG(common);
551 switch(*cc)
552 {
553 case OP_SOD:
554 case OP_SOM:
555 case OP_SET_SOM:
556 case OP_NOT_WORD_BOUNDARY:
557 case OP_WORD_BOUNDARY:
558 case OP_NOT_DIGIT:
559 case OP_DIGIT:
560 case OP_NOT_WHITESPACE:
561 case OP_WHITESPACE:
562 case OP_NOT_WORDCHAR:
563 case OP_WORDCHAR:
564 case OP_ANY:
565 case OP_ALLANY:
566 case OP_NOTPROP:
567 case OP_PROP:
568 case OP_ANYNL:
569 case OP_NOT_HSPACE:
570 case OP_HSPACE:
571 case OP_NOT_VSPACE:
572 case OP_VSPACE:
573 case OP_EXTUNI:
574 case OP_EODN:
575 case OP_EOD:
576 case OP_CIRC:
577 case OP_CIRCM:
578 case OP_DOLL:
579 case OP_DOLLM:
580 case OP_CRSTAR:
581 case OP_CRMINSTAR:
582 case OP_CRPLUS:
583 case OP_CRMINPLUS:
584 case OP_CRQUERY:
585 case OP_CRMINQUERY:
586 case OP_CRRANGE:
587 case OP_CRMINRANGE:
588 case OP_CRPOSSTAR:
589 case OP_CRPOSPLUS:
590 case OP_CRPOSQUERY:
591 case OP_CRPOSRANGE:
592 case OP_CLASS:
593 case OP_NCLASS:
594 case OP_REF:
595 case OP_REFI:
596 case OP_DNREF:
597 case OP_DNREFI:
598 case OP_RECURSE:
599 case OP_CALLOUT:
600 case OP_ALT:
601 case OP_KET:
602 case OP_KETRMAX:
603 case OP_KETRMIN:
604 case OP_KETRPOS:
605 case OP_REVERSE:
606 case OP_ASSERT:
607 case OP_ASSERT_NOT:
608 case OP_ASSERTBACK:
609 case OP_ASSERTBACK_NOT:
610 case OP_ONCE:
611 case OP_ONCE_NC:
612 case OP_BRA:
613 case OP_BRAPOS:
614 case OP_CBRA:
615 case OP_CBRAPOS:
616 case OP_COND:
617 case OP_SBRA:
618 case OP_SBRAPOS:
619 case OP_SCBRA:
620 case OP_SCBRAPOS:
621 case OP_SCOND:
622 case OP_CREF:
623 case OP_DNCREF:
624 case OP_RREF:
625 case OP_DNRREF:
626 case OP_DEF:
627 case OP_BRAZERO:
628 case OP_BRAMINZERO:
629 case OP_BRAPOSZERO:
630 case OP_PRUNE:
631 case OP_SKIP:
632 case OP_THEN:
633 case OP_COMMIT:
634 case OP_FAIL:
635 case OP_ACCEPT:
636 case OP_ASSERT_ACCEPT:
637 case OP_CLOSE:
638 case OP_SKIPZERO:
639 return cc + PRIV(OP_lengths)[*cc];
640
641 case OP_CHAR:
642 case OP_CHARI:
643 case OP_NOT:
644 case OP_NOTI:
645 case OP_STAR:
646 case OP_MINSTAR:
647 case OP_PLUS:
648 case OP_MINPLUS:
649 case OP_QUERY:
650 case OP_MINQUERY:
651 case OP_UPTO:
652 case OP_MINUPTO:
653 case OP_EXACT:
654 case OP_POSSTAR:
655 case OP_POSPLUS:
656 case OP_POSQUERY:
657 case OP_POSUPTO:
658 case OP_STARI:
659 case OP_MINSTARI:
660 case OP_PLUSI:
661 case OP_MINPLUSI:
662 case OP_QUERYI:
663 case OP_MINQUERYI:
664 case OP_UPTOI:
665 case OP_MINUPTOI:
666 case OP_EXACTI:
667 case OP_POSSTARI:
668 case OP_POSPLUSI:
669 case OP_POSQUERYI:
670 case OP_POSUPTOI:
671 case OP_NOTSTAR:
672 case OP_NOTMINSTAR:
673 case OP_NOTPLUS:
674 case OP_NOTMINPLUS:
675 case OP_NOTQUERY:
676 case OP_NOTMINQUERY:
677 case OP_NOTUPTO:
678 case OP_NOTMINUPTO:
679 case OP_NOTEXACT:
680 case OP_NOTPOSSTAR:
681 case OP_NOTPOSPLUS:
682 case OP_NOTPOSQUERY:
683 case OP_NOTPOSUPTO:
684 case OP_NOTSTARI:
685 case OP_NOTMINSTARI:
686 case OP_NOTPLUSI:
687 case OP_NOTMINPLUSI:
688 case OP_NOTQUERYI:
689 case OP_NOTMINQUERYI:
690 case OP_NOTUPTOI:
691 case OP_NOTMINUPTOI:
692 case OP_NOTEXACTI:
693 case OP_NOTPOSSTARI:
694 case OP_NOTPOSPLUSI:
695 case OP_NOTPOSQUERYI:
696 case OP_NOTPOSUPTOI:
697 cc += PRIV(OP_lengths)[*cc];
698 #ifdef SUPPORT_UTF
699 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
700 #endif
701 return cc;
702
703 /* Special cases. */
704 case OP_TYPESTAR:
705 case OP_TYPEMINSTAR:
706 case OP_TYPEPLUS:
707 case OP_TYPEMINPLUS:
708 case OP_TYPEQUERY:
709 case OP_TYPEMINQUERY:
710 case OP_TYPEUPTO:
711 case OP_TYPEMINUPTO:
712 case OP_TYPEEXACT:
713 case OP_TYPEPOSSTAR:
714 case OP_TYPEPOSPLUS:
715 case OP_TYPEPOSQUERY:
716 case OP_TYPEPOSUPTO:
717 return cc + PRIV(OP_lengths)[*cc] - 1;
718
719 case OP_ANYBYTE:
720 #ifdef SUPPORT_UTF
721 if (common->utf) return NULL;
722 #endif
723 return cc + 1;
724
725 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
726 case OP_XCLASS:
727 return cc + GET(cc, 1);
728 #endif
729
730 case OP_MARK:
731 case OP_PRUNE_ARG:
732 case OP_SKIP_ARG:
733 case OP_THEN_ARG:
734 return cc + 1 + 2 + cc[1];
735
736 default:
737 /* All opcodes are supported now! */
738 SLJIT_ASSERT_STOP();
739 return NULL;
740 }
741 }
742
743 static BOOL check_opcode_types(compiler_common *common, pcre_uchar *cc, pcre_uchar *ccend)
744 {
745 int count;
746 pcre_uchar *slot;
747
748 /* Calculate important variables (like stack size) and checks whether all opcodes are supported. */
749 while (cc < ccend)
750 {
751 switch(*cc)
752 {
753 case OP_SET_SOM:
754 common->has_set_som = TRUE;
755 cc += 1;
756 break;
757
758 case OP_REF:
759 case OP_REFI:
760 common->optimized_cbracket[GET2(cc, 1)] = 0;
761 cc += 1 + IMM2_SIZE;
762 break;
763
764 case OP_CBRAPOS:
765 case OP_SCBRAPOS:
766 common->optimized_cbracket[GET2(cc, 1 + LINK_SIZE)] = 0;
767 cc += 1 + LINK_SIZE + IMM2_SIZE;
768 break;
769
770 case OP_COND:
771 case OP_SCOND:
772 /* Only AUTO_CALLOUT can insert this opcode. We do
773 not intend to support this case. */
774 if (cc[1 + LINK_SIZE] == OP_CALLOUT)
775 return FALSE;
776 cc += 1 + LINK_SIZE;
777 break;
778
779 case OP_CREF:
780 common->optimized_cbracket[GET2(cc, 1)] = 0;
781 cc += 1 + IMM2_SIZE;
782 break;
783
784 case OP_DNREF:
785 case OP_DNREFI:
786 case OP_DNCREF:
787 count = GET2(cc, 1 + IMM2_SIZE);
788 slot = common->name_table + GET2(cc, 1) * common->name_entry_size;
789 while (count-- > 0)
790 {
791 common->optimized_cbracket[GET2(slot, 0)] = 0;
792 slot += common->name_entry_size;
793 }
794 cc += 1 + 2 * IMM2_SIZE;
795 break;
796
797 case OP_RECURSE:
798 /* Set its value only once. */
799 if (common->recursive_head_ptr == 0)
800 {
801 common->recursive_head_ptr = common->ovector_start;
802 common->ovector_start += sizeof(sljit_sw);
803 }
804 cc += 1 + LINK_SIZE;
805 break;
806
807 case OP_CALLOUT:
808 if (common->capture_last_ptr == 0)
809 {
810 common->capture_last_ptr = common->ovector_start;
811 common->ovector_start += sizeof(sljit_sw);
812 }
813 cc += 2 + 2 * LINK_SIZE;
814 break;
815
816 case OP_THEN_ARG:
817 common->has_then = TRUE;
818 common->control_head_ptr = 1;
819 /* Fall through. */
820
821 case OP_PRUNE_ARG:
822 common->needs_start_ptr = TRUE;
823 /* Fall through. */
824
825 case OP_MARK:
826 if (common->mark_ptr == 0)
827 {
828 common->mark_ptr = common->ovector_start;
829 common->ovector_start += sizeof(sljit_sw);
830 }
831 cc += 1 + 2 + cc[1];
832 break;
833
834 case OP_THEN:
835 common->has_then = TRUE;
836 common->control_head_ptr = 1;
837 /* Fall through. */
838
839 case OP_PRUNE:
840 case OP_SKIP:
841 common->needs_start_ptr = TRUE;
842 cc += 1;
843 break;
844
845 case OP_SKIP_ARG:
846 common->control_head_ptr = 1;
847 common->has_skip_arg = TRUE;
848 cc += 1 + 2 + cc[1];
849 break;
850
851 default:
852 cc = next_opcode(common, cc);
853 if (cc == NULL)
854 return FALSE;
855 break;
856 }
857 }
858 return TRUE;
859 }
860
861 static int get_class_iterator_size(pcre_uchar *cc)
862 {
863 switch(*cc)
864 {
865 case OP_CRSTAR:
866 case OP_CRPLUS:
867 return 2;
868
869 case OP_CRMINSTAR:
870 case OP_CRMINPLUS:
871 case OP_CRQUERY:
872 case OP_CRMINQUERY:
873 return 1;
874
875 case OP_CRRANGE:
876 case OP_CRMINRANGE:
877 if (GET2(cc, 1) == GET2(cc, 1 + IMM2_SIZE))
878 return 0;
879 return 2;
880
881 default:
882 return 0;
883 }
884 }
885
886 static BOOL detect_repeat(compiler_common *common, pcre_uchar *begin)
887 {
888 pcre_uchar *end = bracketend(begin);
889 pcre_uchar *next;
890 pcre_uchar *next_end;
891 pcre_uchar *max_end;
892 pcre_uchar type;
893 sljit_sw length = end - begin;
894 int min, max, i;
895
896 /* Detect fixed iterations first. */
897 if (end[-(1 + LINK_SIZE)] != OP_KET)
898 return FALSE;
899
900 /* Already detected repeat. */
901 if (common->private_data_ptrs[end - common->start - LINK_SIZE] != 0)
902 return TRUE;
903
904 next = end;
905 min = 1;
906 while (1)
907 {
908 if (*next != *begin)
909 break;
910 next_end = bracketend(next);
911 if (next_end - next != length || memcmp(begin, next, IN_UCHARS(length)) != 0)
912 break;
913 next = next_end;
914 min++;
915 }
916
917 if (min == 2)
918 return FALSE;
919
920 max = 0;
921 max_end = next;
922 if (*next == OP_BRAZERO || *next == OP_BRAMINZERO)
923 {
924 type = *next;
925 while (1)
926 {
927 if (next[0] != type || next[1] != OP_BRA || next[2 + LINK_SIZE] != *begin)
928 break;
929 next_end = bracketend(next + 2 + LINK_SIZE);
930 if (next_end - next != (length + 2 + LINK_SIZE) || memcmp(begin, next + 2 + LINK_SIZE, IN_UCHARS(length)) != 0)
931 break;
932 next = next_end;
933 max++;
934 }
935
936 if (next[0] == type && next[1] == *begin && max >= 1)
937 {
938 next_end = bracketend(next + 1);
939 if (next_end - next == (length + 1) && memcmp(begin, next + 1, IN_UCHARS(length)) == 0)
940 {
941 for (i = 0; i < max; i++, next_end += 1 + LINK_SIZE)
942 if (*next_end != OP_KET)
943 break;
944
945 if (i == max)
946 {
947 common->private_data_ptrs[max_end - common->start - LINK_SIZE] = next_end - max_end;
948 common->private_data_ptrs[max_end - common->start - LINK_SIZE + 1] = (type == OP_BRAZERO) ? OP_UPTO : OP_MINUPTO;
949 /* +2 the original and the last. */
950 common->private_data_ptrs[max_end - common->start - LINK_SIZE + 2] = max + 2;
951 if (min == 1)
952 return TRUE;
953 min--;
954 max_end -= (1 + LINK_SIZE) + GET(max_end, -LINK_SIZE);
955 }
956 }
957 }
958 }
959
960 if (min >= 3)
961 {
962 common->private_data_ptrs[end - common->start - LINK_SIZE] = max_end - end;
963 common->private_data_ptrs[end - common->start - LINK_SIZE + 1] = OP_EXACT;
964 common->private_data_ptrs[end - common->start - LINK_SIZE + 2] = min;
965 return TRUE;
966 }
967
968 return FALSE;
969 }
970
971 #define CASE_ITERATOR_PRIVATE_DATA_1 \
972 case OP_MINSTAR: \
973 case OP_MINPLUS: \
974 case OP_QUERY: \
975 case OP_MINQUERY: \
976 case OP_MINSTARI: \
977 case OP_MINPLUSI: \
978 case OP_QUERYI: \
979 case OP_MINQUERYI: \
980 case OP_NOTMINSTAR: \
981 case OP_NOTMINPLUS: \
982 case OP_NOTQUERY: \
983 case OP_NOTMINQUERY: \
984 case OP_NOTMINSTARI: \
985 case OP_NOTMINPLUSI: \
986 case OP_NOTQUERYI: \
987 case OP_NOTMINQUERYI:
988
989 #define CASE_ITERATOR_PRIVATE_DATA_2A \
990 case OP_STAR: \
991 case OP_PLUS: \
992 case OP_STARI: \
993 case OP_PLUSI: \
994 case OP_NOTSTAR: \
995 case OP_NOTPLUS: \
996 case OP_NOTSTARI: \
997 case OP_NOTPLUSI:
998
999 #define CASE_ITERATOR_PRIVATE_DATA_2B \
1000 case OP_UPTO: \
1001 case OP_MINUPTO: \
1002 case OP_UPTOI: \
1003 case OP_MINUPTOI: \
1004 case OP_NOTUPTO: \
1005 case OP_NOTMINUPTO: \
1006 case OP_NOTUPTOI: \
1007 case OP_NOTMINUPTOI:
1008
1009 #define CASE_ITERATOR_TYPE_PRIVATE_DATA_1 \
1010 case OP_TYPEMINSTAR: \
1011 case OP_TYPEMINPLUS: \
1012 case OP_TYPEQUERY: \
1013 case OP_TYPEMINQUERY:
1014
1015 #define CASE_ITERATOR_TYPE_PRIVATE_DATA_2A \
1016 case OP_TYPESTAR: \
1017 case OP_TYPEPLUS:
1018
1019 #define CASE_ITERATOR_TYPE_PRIVATE_DATA_2B \
1020 case OP_TYPEUPTO: \
1021 case OP_TYPEMINUPTO:
1022
1023 static void set_private_data_ptrs(compiler_common *common, int *private_data_start, pcre_uchar *ccend)
1024 {
1025 pcre_uchar *cc = common->start;
1026 pcre_uchar *alternative;
1027 pcre_uchar *end = NULL;
1028 int private_data_ptr = *private_data_start;
1029 int space, size, bracketlen;
1030
1031 while (cc < ccend)
1032 {
1033 space = 0;
1034 size = 0;
1035 bracketlen = 0;
1036 if (private_data_ptr > SLJIT_MAX_LOCAL_SIZE)
1037 return;
1038
1039 if (*cc == OP_ONCE || *cc == OP_ONCE_NC || *cc == OP_BRA || *cc == OP_CBRA || *cc == OP_COND)
1040 if (detect_repeat(common, cc))
1041 {
1042 /* These brackets are converted to repeats, so no global
1043 based single character repeat is allowed. */
1044 if (cc >= end)
1045 end = bracketend(cc);
1046 }
1047
1048 switch(*cc)
1049 {
1050 case OP_KET:
1051 if (common->private_data_ptrs[cc + 1 - common->start] != 0)
1052 {
1053 common->private_data_ptrs[cc - common->start] = private_data_ptr;
1054 private_data_ptr += sizeof(sljit_sw);
1055 cc += common->private_data_ptrs[cc + 1 - common->start];
1056 }
1057 cc += 1 + LINK_SIZE;
1058 break;
1059
1060 case OP_ASSERT:
1061 case OP_ASSERT_NOT:
1062 case OP_ASSERTBACK:
1063 case OP_ASSERTBACK_NOT:
1064 case OP_ONCE:
1065 case OP_ONCE_NC:
1066 case OP_BRAPOS:
1067 case OP_SBRA:
1068 case OP_SBRAPOS:
1069 case OP_SCOND:
1070 common->private_data_ptrs[cc - common->start] = private_data_ptr;
1071 private_data_ptr += sizeof(sljit_sw);
1072 bracketlen = 1 + LINK_SIZE;
1073 break;
1074
1075 case OP_CBRAPOS:
1076 case OP_SCBRAPOS:
1077 common->private_data_ptrs[cc - common->start] = private_data_ptr;
1078 private_data_ptr += sizeof(sljit_sw);
1079 bracketlen = 1 + LINK_SIZE + IMM2_SIZE;
1080 break;
1081
1082 case OP_COND:
1083 /* Might be a hidden SCOND. */
1084 alternative = cc + GET(cc, 1);
1085 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN)
1086 {
1087 common->private_data_ptrs[cc - common->start] = private_data_ptr;
1088 private_data_ptr += sizeof(sljit_sw);
1089 }
1090 bracketlen = 1 + LINK_SIZE;
1091 break;
1092
1093 case OP_BRA:
1094 bracketlen = 1 + LINK_SIZE;
1095 break;
1096
1097 case OP_CBRA:
1098 case OP_SCBRA:
1099 bracketlen = 1 + LINK_SIZE + IMM2_SIZE;
1100 break;
1101
1102 CASE_ITERATOR_PRIVATE_DATA_1
1103 space = 1;
1104 size = -2;
1105 break;
1106
1107 CASE_ITERATOR_PRIVATE_DATA_2A
1108 space = 2;
1109 size = -2;
1110 break;
1111
1112 CASE_ITERATOR_PRIVATE_DATA_2B
1113 space = 2;
1114 size = -(2 + IMM2_SIZE);
1115 break;
1116
1117 CASE_ITERATOR_TYPE_PRIVATE_DATA_1
1118 space = 1;
1119 size = 1;
1120 break;
1121
1122 CASE_ITERATOR_TYPE_PRIVATE_DATA_2A
1123 if (cc[1] != OP_ANYNL && cc[1] != OP_EXTUNI)
1124 space = 2;
1125 size = 1;
1126 break;
1127
1128 CASE_ITERATOR_TYPE_PRIVATE_DATA_2B
1129 if (cc[1 + IMM2_SIZE] != OP_ANYNL && cc[1 + IMM2_SIZE] != OP_EXTUNI)
1130 space = 2;
1131 size = 1 + IMM2_SIZE;
1132 break;
1133
1134 case OP_CLASS:
1135 case OP_NCLASS:
1136 size += 1 + 32 / sizeof(pcre_uchar);
1137 space = get_class_iterator_size(cc + size);
1138 break;
1139
1140 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
1141 case OP_XCLASS:
1142 size = GET(cc, 1);
1143 space = get_class_iterator_size(cc + size);
1144 break;
1145 #endif
1146
1147 default:
1148 cc = next_opcode(common, cc);
1149 SLJIT_ASSERT(cc != NULL);
1150 break;
1151 }
1152
1153 /* Character iterators, which are not inside a repeated bracket,
1154 gets a private slot instead of allocating it on the stack. */
1155 if (space > 0 && cc >= end)
1156 {
1157 common->private_data_ptrs[cc - common->start] = private_data_ptr;
1158 private_data_ptr += sizeof(sljit_sw) * space;
1159 }
1160
1161 if (size != 0)
1162 {
1163 if (size < 0)
1164 {
1165 cc += -size;
1166 #ifdef SUPPORT_UTF
1167 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
1168 #endif
1169 }
1170 else
1171 cc += size;
1172 }
1173
1174 if (bracketlen > 0)
1175 {
1176 if (cc >= end)
1177 {
1178 end = bracketend(cc);
1179 if (end[-1 - LINK_SIZE] == OP_KET)
1180 end = NULL;
1181 }
1182 cc += bracketlen;
1183 }
1184 }
1185 *private_data_start = private_data_ptr;
1186 }
1187
1188 /* Returns with a frame_types (always < 0) if no need for frame. */
1189 static int get_framesize(compiler_common *common, pcre_uchar *cc, pcre_uchar *ccend, BOOL recursive, BOOL* needs_control_head)
1190 {
1191 int length = 0;
1192 int possessive = 0;
1193 BOOL stack_restore = FALSE;
1194 BOOL setsom_found = recursive;
1195 BOOL setmark_found = recursive;
1196 /* The last capture is a local variable even for recursions. */
1197 BOOL capture_last_found = FALSE;
1198
1199 #if defined DEBUG_FORCE_CONTROL_HEAD && DEBUG_FORCE_CONTROL_HEAD
1200 SLJIT_ASSERT(common->control_head_ptr != 0);
1201 *needs_control_head = TRUE;
1202 #else
1203 *needs_control_head = FALSE;
1204 #endif
1205
1206 if (ccend == NULL)
1207 {
1208 ccend = bracketend(cc) - (1 + LINK_SIZE);
1209 if (!recursive && (*cc == OP_CBRAPOS || *cc == OP_SCBRAPOS))
1210 {
1211 possessive = length = (common->capture_last_ptr != 0) ? 5 : 3;
1212 /* This is correct regardless of common->capture_last_ptr. */
1213 capture_last_found = TRUE;
1214 }
1215 cc = next_opcode(common, cc);
1216 }
1217
1218 SLJIT_ASSERT(cc != NULL);
1219 while (cc < ccend)
1220 switch(*cc)
1221 {
1222 case OP_SET_SOM:
1223 SLJIT_ASSERT(common->has_set_som);
1224 stack_restore = TRUE;
1225 if (!setsom_found)
1226 {
1227 length += 2;
1228 setsom_found = TRUE;
1229 }
1230 cc += 1;
1231 break;
1232
1233 case OP_MARK:
1234 case OP_PRUNE_ARG:
1235 case OP_THEN_ARG:
1236 SLJIT_ASSERT(common->mark_ptr != 0);
1237 stack_restore = TRUE;
1238 if (!setmark_found)
1239 {
1240 length += 2;
1241 setmark_found = TRUE;
1242 }
1243 if (common->control_head_ptr != 0)
1244 *needs_control_head = TRUE;
1245 cc += 1 + 2 + cc[1];
1246 break;
1247
1248 case OP_RECURSE:
1249 stack_restore = TRUE;
1250 if (common->has_set_som && !setsom_found)
1251 {
1252 length += 2;
1253 setsom_found = TRUE;
1254 }
1255 if (common->mark_ptr != 0 && !setmark_found)
1256 {
1257 length += 2;
1258 setmark_found = TRUE;
1259 }
1260 if (common->capture_last_ptr != 0 && !capture_last_found)
1261 {
1262 length += 2;
1263 capture_last_found = TRUE;
1264 }
1265 cc += 1 + LINK_SIZE;
1266 break;
1267
1268 case OP_CBRA:
1269 case OP_CBRAPOS:
1270 case OP_SCBRA:
1271 case OP_SCBRAPOS:
1272 stack_restore = TRUE;
1273 if (common->capture_last_ptr != 0 && !capture_last_found)
1274 {
1275 length += 2;
1276 capture_last_found = TRUE;
1277 }
1278 length += 3;
1279 cc += 1 + LINK_SIZE + IMM2_SIZE;
1280 break;
1281
1282 default:
1283 stack_restore = TRUE;
1284 /* Fall through. */
1285
1286 case OP_NOT_WORD_BOUNDARY:
1287 case OP_WORD_BOUNDARY:
1288 case OP_NOT_DIGIT:
1289 case OP_DIGIT:
1290 case OP_NOT_WHITESPACE:
1291 case OP_WHITESPACE:
1292 case OP_NOT_WORDCHAR:
1293 case OP_WORDCHAR:
1294 case OP_ANY:
1295 case OP_ALLANY:
1296 case OP_ANYBYTE:
1297 case OP_NOTPROP:
1298 case OP_PROP:
1299 case OP_ANYNL:
1300 case OP_NOT_HSPACE:
1301 case OP_HSPACE:
1302 case OP_NOT_VSPACE:
1303 case OP_VSPACE:
1304 case OP_EXTUNI:
1305 case OP_EODN:
1306 case OP_EOD:
1307 case OP_CIRC:
1308 case OP_CIRCM:
1309 case OP_DOLL:
1310 case OP_DOLLM:
1311 case OP_CHAR:
1312 case OP_CHARI:
1313 case OP_NOT:
1314 case OP_NOTI:
1315
1316 case OP_EXACT:
1317 case OP_POSSTAR:
1318 case OP_POSPLUS:
1319 case OP_POSQUERY:
1320 case OP_POSUPTO:
1321
1322 case OP_EXACTI:
1323 case OP_POSSTARI:
1324 case OP_POSPLUSI:
1325 case OP_POSQUERYI:
1326 case OP_POSUPTOI:
1327
1328 case OP_NOTEXACT:
1329 case OP_NOTPOSSTAR:
1330 case OP_NOTPOSPLUS:
1331 case OP_NOTPOSQUERY:
1332 case OP_NOTPOSUPTO:
1333
1334 case OP_NOTEXACTI:
1335 case OP_NOTPOSSTARI:
1336 case OP_NOTPOSPLUSI:
1337 case OP_NOTPOSQUERYI:
1338 case OP_NOTPOSUPTOI:
1339
1340 case OP_TYPEEXACT:
1341 case OP_TYPEPOSSTAR:
1342 case OP_TYPEPOSPLUS:
1343 case OP_TYPEPOSQUERY:
1344 case OP_TYPEPOSUPTO:
1345
1346 case OP_CLASS:
1347 case OP_NCLASS:
1348 case OP_XCLASS:
1349
1350 cc = next_opcode(common, cc);
1351 SLJIT_ASSERT(cc != NULL);
1352 break;
1353 }
1354
1355 /* Possessive quantifiers can use a special case. */
1356 if (SLJIT_UNLIKELY(possessive == length))
1357 return stack_restore ? no_frame : no_stack;
1358
1359 if (length > 0)
1360 return length + 1;
1361 return stack_restore ? no_frame : no_stack;
1362 }
1363
1364 static void init_frame(compiler_common *common, pcre_uchar *cc, pcre_uchar *ccend, int stackpos, int stacktop, BOOL recursive)
1365 {
1366 DEFINE_COMPILER;
1367 BOOL setsom_found = recursive;
1368 BOOL setmark_found = recursive;
1369 /* The last capture is a local variable even for recursions. */
1370 BOOL capture_last_found = FALSE;
1371 int offset;
1372
1373 /* >= 1 + shortest item size (2) */
1374 SLJIT_UNUSED_ARG(stacktop);
1375 SLJIT_ASSERT(stackpos >= stacktop + 2);
1376
1377 stackpos = STACK(stackpos);
1378 if (ccend == NULL)
1379 {
1380 ccend = bracketend(cc) - (1 + LINK_SIZE);
1381 if (recursive || (*cc != OP_CBRAPOS && *cc != OP_SCBRAPOS))
1382 cc = next_opcode(common, cc);
1383 }
1384
1385 SLJIT_ASSERT(cc != NULL);
1386 while (cc < ccend)
1387 switch(*cc)
1388 {
1389 case OP_SET_SOM:
1390 SLJIT_ASSERT(common->has_set_som);
1391 if (!setsom_found)
1392 {
1393 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0));
1394 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, SLJIT_IMM, -OVECTOR(0));
1395 stackpos += (int)sizeof(sljit_sw);
1396 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, TMP1, 0);
1397 stackpos += (int)sizeof(sljit_sw);
1398 setsom_found = TRUE;
1399 }
1400 cc += 1;
1401 break;
1402
1403 case OP_MARK:
1404 case OP_PRUNE_ARG:
1405 case OP_THEN_ARG:
1406 SLJIT_ASSERT(common->mark_ptr != 0);
1407 if (!setmark_found)
1408 {
1409 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mark_ptr);
1410 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, SLJIT_IMM, -common->mark_ptr);
1411 stackpos += (int)sizeof(sljit_sw);
1412 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, TMP1, 0);
1413 stackpos += (int)sizeof(sljit_sw);
1414 setmark_found = TRUE;
1415 }
1416 cc += 1 + 2 + cc[1];
1417 break;
1418
1419 case OP_RECURSE:
1420 if (common->has_set_som && !setsom_found)
1421 {
1422 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0));
1423 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, SLJIT_IMM, -OVECTOR(0));
1424 stackpos += (int)sizeof(sljit_sw);
1425 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, TMP1, 0);
1426 stackpos += (int)sizeof(sljit_sw);
1427 setsom_found = TRUE;
1428 }
1429 if (common->mark_ptr != 0 && !setmark_found)
1430 {
1431 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mark_ptr);
1432 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, SLJIT_IMM, -common->mark_ptr);
1433 stackpos += (int)sizeof(sljit_sw);
1434 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, TMP1, 0);
1435 stackpos += (int)sizeof(sljit_sw);
1436 setmark_found = TRUE;
1437 }
1438 if (common->capture_last_ptr != 0 && !capture_last_found)
1439 {
1440 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->capture_last_ptr);
1441 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, SLJIT_IMM, -common->capture_last_ptr);
1442 stackpos += (int)sizeof(sljit_sw);
1443 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, TMP1, 0);
1444 stackpos += (int)sizeof(sljit_sw);
1445 capture_last_found = TRUE;
1446 }
1447 cc += 1 + LINK_SIZE;
1448 break;
1449
1450 case OP_CBRA:
1451 case OP_CBRAPOS:
1452 case OP_SCBRA:
1453 case OP_SCBRAPOS:
1454 if (common->capture_last_ptr != 0 && !capture_last_found)
1455 {
1456 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->capture_last_ptr);
1457 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, SLJIT_IMM, -common->capture_last_ptr);
1458 stackpos += (int)sizeof(sljit_sw);
1459 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, TMP1, 0);
1460 stackpos += (int)sizeof(sljit_sw);
1461 capture_last_found = TRUE;
1462 }
1463 offset = (GET2(cc, 1 + LINK_SIZE)) << 1;
1464 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, SLJIT_IMM, OVECTOR(offset));
1465 stackpos += (int)sizeof(sljit_sw);
1466 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
1467 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
1468 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, TMP1, 0);
1469 stackpos += (int)sizeof(sljit_sw);
1470 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, TMP2, 0);
1471 stackpos += (int)sizeof(sljit_sw);
1472
1473 cc += 1 + LINK_SIZE + IMM2_SIZE;
1474 break;
1475
1476 default:
1477 cc = next_opcode(common, cc);
1478 SLJIT_ASSERT(cc != NULL);
1479 break;
1480 }
1481
1482 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackpos, SLJIT_IMM, 0);
1483 SLJIT_ASSERT(stackpos == STACK(stacktop));
1484 }
1485
1486 static SLJIT_INLINE int get_private_data_copy_length(compiler_common *common, pcre_uchar *cc, pcre_uchar *ccend, BOOL needs_control_head)
1487 {
1488 int private_data_length = needs_control_head ? 3 : 2;
1489 int size;
1490 pcre_uchar *alternative;
1491 /* Calculate the sum of the private machine words. */
1492 while (cc < ccend)
1493 {
1494 size = 0;
1495 switch(*cc)
1496 {
1497 case OP_KET:
1498 if (PRIVATE_DATA(cc) != 0)
1499 private_data_length++;
1500 cc += 1 + LINK_SIZE;
1501 break;
1502
1503 case OP_ASSERT:
1504 case OP_ASSERT_NOT:
1505 case OP_ASSERTBACK:
1506 case OP_ASSERTBACK_NOT:
1507 case OP_ONCE:
1508 case OP_ONCE_NC:
1509 case OP_BRAPOS:
1510 case OP_SBRA:
1511 case OP_SBRAPOS:
1512 case OP_SCOND:
1513 private_data_length++;
1514 cc += 1 + LINK_SIZE;
1515 break;
1516
1517 case OP_CBRA:
1518 case OP_SCBRA:
1519 if (common->optimized_cbracket[GET2(cc, 1 + LINK_SIZE)] == 0)
1520 private_data_length++;
1521 cc += 1 + LINK_SIZE + IMM2_SIZE;
1522 break;
1523
1524 case OP_CBRAPOS:
1525 case OP_SCBRAPOS:
1526 private_data_length += 2;
1527 cc += 1 + LINK_SIZE + IMM2_SIZE;
1528 break;
1529
1530 case OP_COND:
1531 /* Might be a hidden SCOND. */
1532 alternative = cc + GET(cc, 1);
1533 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN)
1534 private_data_length++;
1535 cc += 1 + LINK_SIZE;
1536 break;
1537
1538 CASE_ITERATOR_PRIVATE_DATA_1
1539 if (PRIVATE_DATA(cc))
1540 private_data_length++;
1541 cc += 2;
1542 #ifdef SUPPORT_UTF
1543 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
1544 #endif
1545 break;
1546
1547 CASE_ITERATOR_PRIVATE_DATA_2A
1548 if (PRIVATE_DATA(cc))
1549 private_data_length += 2;
1550 cc += 2;
1551 #ifdef SUPPORT_UTF
1552 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
1553 #endif
1554 break;
1555
1556 CASE_ITERATOR_PRIVATE_DATA_2B
1557 if (PRIVATE_DATA(cc))
1558 private_data_length += 2;
1559 cc += 2 + IMM2_SIZE;
1560 #ifdef SUPPORT_UTF
1561 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
1562 #endif
1563 break;
1564
1565 CASE_ITERATOR_TYPE_PRIVATE_DATA_1
1566 if (PRIVATE_DATA(cc))
1567 private_data_length++;
1568 cc += 1;
1569 break;
1570
1571 CASE_ITERATOR_TYPE_PRIVATE_DATA_2A
1572 if (PRIVATE_DATA(cc))
1573 private_data_length += 2;
1574 cc += 1;
1575 break;
1576
1577 CASE_ITERATOR_TYPE_PRIVATE_DATA_2B
1578 if (PRIVATE_DATA(cc))
1579 private_data_length += 2;
1580 cc += 1 + IMM2_SIZE;
1581 break;
1582
1583 case OP_CLASS:
1584 case OP_NCLASS:
1585 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
1586 case OP_XCLASS:
1587 size = (*cc == OP_XCLASS) ? GET(cc, 1) : 1 + 32 / (int)sizeof(pcre_uchar);
1588 #else
1589 size = 1 + 32 / (int)sizeof(pcre_uchar);
1590 #endif
1591 if (PRIVATE_DATA(cc))
1592 private_data_length += get_class_iterator_size(cc + size);
1593 cc += size;
1594 break;
1595
1596 default:
1597 cc = next_opcode(common, cc);
1598 SLJIT_ASSERT(cc != NULL);
1599 break;
1600 }
1601 }
1602 SLJIT_ASSERT(cc == ccend);
1603 return private_data_length;
1604 }
1605
1606 static void copy_private_data(compiler_common *common, pcre_uchar *cc, pcre_uchar *ccend,
1607 BOOL save, int stackptr, int stacktop, BOOL needs_control_head)
1608 {
1609 DEFINE_COMPILER;
1610 int srcw[2];
1611 int count, size;
1612 BOOL tmp1next = TRUE;
1613 BOOL tmp1empty = TRUE;
1614 BOOL tmp2empty = TRUE;
1615 pcre_uchar *alternative;
1616 enum {
1617 start,
1618 loop,
1619 end
1620 } status;
1621
1622 status = save ? start : loop;
1623 stackptr = STACK(stackptr - 2);
1624 stacktop = STACK(stacktop - 1);
1625
1626 if (!save)
1627 {
1628 stackptr += (needs_control_head ? 2 : 1) * sizeof(sljit_sw);
1629 if (stackptr < stacktop)
1630 {
1631 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), stackptr);
1632 stackptr += sizeof(sljit_sw);
1633 tmp1empty = FALSE;
1634 }
1635 if (stackptr < stacktop)
1636 {
1637 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(STACK_TOP), stackptr);
1638 stackptr += sizeof(sljit_sw);
1639 tmp2empty = FALSE;
1640 }
1641 /* The tmp1next must be TRUE in either way. */
1642 }
1643
1644 do
1645 {
1646 count = 0;
1647 switch(status)
1648 {
1649 case start:
1650 SLJIT_ASSERT(save && common->recursive_head_ptr != 0);
1651 count = 1;
1652 srcw[0] = common->recursive_head_ptr;
1653 if (needs_control_head)
1654 {
1655 SLJIT_ASSERT(common->control_head_ptr != 0);
1656 count = 2;
1657 srcw[1] = common->control_head_ptr;
1658 }
1659 status = loop;
1660 break;
1661
1662 case loop:
1663 if (cc >= ccend)
1664 {
1665 status = end;
1666 break;
1667 }
1668
1669 switch(*cc)
1670 {
1671 case OP_KET:
1672 if (PRIVATE_DATA(cc) != 0)
1673 {
1674 count = 1;
1675 srcw[0] = PRIVATE_DATA(cc);
1676 }
1677 cc += 1 + LINK_SIZE;
1678 break;
1679
1680 case OP_ASSERT:
1681 case OP_ASSERT_NOT:
1682 case OP_ASSERTBACK:
1683 case OP_ASSERTBACK_NOT:
1684 case OP_ONCE:
1685 case OP_ONCE_NC:
1686 case OP_BRAPOS:
1687 case OP_SBRA:
1688 case OP_SBRAPOS:
1689 case OP_SCOND:
1690 count = 1;
1691 srcw[0] = PRIVATE_DATA(cc);
1692 SLJIT_ASSERT(srcw[0] != 0);
1693 cc += 1 + LINK_SIZE;
1694 break;
1695
1696 case OP_CBRA:
1697 case OP_SCBRA:
1698 if (common->optimized_cbracket[GET2(cc, 1 + LINK_SIZE)] == 0)
1699 {
1700 count = 1;
1701 srcw[0] = OVECTOR_PRIV(GET2(cc, 1 + LINK_SIZE));
1702 }
1703 cc += 1 + LINK_SIZE + IMM2_SIZE;
1704 break;
1705
1706 case OP_CBRAPOS:
1707 case OP_SCBRAPOS:
1708 count = 2;
1709 srcw[0] = PRIVATE_DATA(cc);
1710 srcw[1] = OVECTOR_PRIV(GET2(cc, 1 + LINK_SIZE));
1711 SLJIT_ASSERT(srcw[0] != 0 && srcw[1] != 0);
1712 cc += 1 + LINK_SIZE + IMM2_SIZE;
1713 break;
1714
1715 case OP_COND:
1716 /* Might be a hidden SCOND. */
1717 alternative = cc + GET(cc, 1);
1718 if (*alternative == OP_KETRMAX || *alternative == OP_KETRMIN)
1719 {
1720 count = 1;
1721 srcw[0] = PRIVATE_DATA(cc);
1722 SLJIT_ASSERT(srcw[0] != 0);
1723 }
1724 cc += 1 + LINK_SIZE;
1725 break;
1726
1727 CASE_ITERATOR_PRIVATE_DATA_1
1728 if (PRIVATE_DATA(cc))
1729 {
1730 count = 1;
1731 srcw[0] = PRIVATE_DATA(cc);
1732 }
1733 cc += 2;
1734 #ifdef SUPPORT_UTF
1735 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
1736 #endif
1737 break;
1738
1739 CASE_ITERATOR_PRIVATE_DATA_2A
1740 if (PRIVATE_DATA(cc))
1741 {
1742 count = 2;
1743 srcw[0] = PRIVATE_DATA(cc);
1744 srcw[1] = PRIVATE_DATA(cc) + sizeof(sljit_sw);
1745 }
1746 cc += 2;
1747 #ifdef SUPPORT_UTF
1748 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
1749 #endif
1750 break;
1751
1752 CASE_ITERATOR_PRIVATE_DATA_2B
1753 if (PRIVATE_DATA(cc))
1754 {
1755 count = 2;
1756 srcw[0] = PRIVATE_DATA(cc);
1757 srcw[1] = PRIVATE_DATA(cc) + sizeof(sljit_sw);
1758 }
1759 cc += 2 + IMM2_SIZE;
1760 #ifdef SUPPORT_UTF
1761 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
1762 #endif
1763 break;
1764
1765 CASE_ITERATOR_TYPE_PRIVATE_DATA_1
1766 if (PRIVATE_DATA(cc))
1767 {
1768 count = 1;
1769 srcw[0] = PRIVATE_DATA(cc);
1770 }
1771 cc += 1;
1772 break;
1773
1774 CASE_ITERATOR_TYPE_PRIVATE_DATA_2A
1775 if (PRIVATE_DATA(cc))
1776 {
1777 count = 2;
1778 srcw[0] = PRIVATE_DATA(cc);
1779 srcw[1] = srcw[0] + sizeof(sljit_sw);
1780 }
1781 cc += 1;
1782 break;
1783
1784 CASE_ITERATOR_TYPE_PRIVATE_DATA_2B
1785 if (PRIVATE_DATA(cc))
1786 {
1787 count = 2;
1788 srcw[0] = PRIVATE_DATA(cc);
1789 srcw[1] = srcw[0] + sizeof(sljit_sw);
1790 }
1791 cc += 1 + IMM2_SIZE;
1792 break;
1793
1794 case OP_CLASS:
1795 case OP_NCLASS:
1796 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
1797 case OP_XCLASS:
1798 size = (*cc == OP_XCLASS) ? GET(cc, 1) : 1 + 32 / (int)sizeof(pcre_uchar);
1799 #else
1800 size = 1 + 32 / (int)sizeof(pcre_uchar);
1801 #endif
1802 if (PRIVATE_DATA(cc))
1803 switch(get_class_iterator_size(cc + size))
1804 {
1805 case 1:
1806 count = 1;
1807 srcw[0] = PRIVATE_DATA(cc);
1808 break;
1809
1810 case 2:
1811 count = 2;
1812 srcw[0] = PRIVATE_DATA(cc);
1813 srcw[1] = srcw[0] + sizeof(sljit_sw);
1814 break;
1815
1816 default:
1817 SLJIT_ASSERT_STOP();
1818 break;
1819 }
1820 cc += size;
1821 break;
1822
1823 default:
1824 cc = next_opcode(common, cc);
1825 SLJIT_ASSERT(cc != NULL);
1826 break;
1827 }
1828 break;
1829
1830 case end:
1831 SLJIT_ASSERT_STOP();
1832 break;
1833 }
1834
1835 while (count > 0)
1836 {
1837 count--;
1838 if (save)
1839 {
1840 if (tmp1next)
1841 {
1842 if (!tmp1empty)
1843 {
1844 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackptr, TMP1, 0);
1845 stackptr += sizeof(sljit_sw);
1846 }
1847 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), srcw[count]);
1848 tmp1empty = FALSE;
1849 tmp1next = FALSE;
1850 }
1851 else
1852 {
1853 if (!tmp2empty)
1854 {
1855 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackptr, TMP2, 0);
1856 stackptr += sizeof(sljit_sw);
1857 }
1858 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), srcw[count]);
1859 tmp2empty = FALSE;
1860 tmp1next = TRUE;
1861 }
1862 }
1863 else
1864 {
1865 if (tmp1next)
1866 {
1867 SLJIT_ASSERT(!tmp1empty);
1868 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), srcw[count], TMP1, 0);
1869 tmp1empty = stackptr >= stacktop;
1870 if (!tmp1empty)
1871 {
1872 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), stackptr);
1873 stackptr += sizeof(sljit_sw);
1874 }
1875 tmp1next = FALSE;
1876 }
1877 else
1878 {
1879 SLJIT_ASSERT(!tmp2empty);
1880 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), srcw[count], TMP2, 0);
1881 tmp2empty = stackptr >= stacktop;
1882 if (!tmp2empty)
1883 {
1884 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(STACK_TOP), stackptr);
1885 stackptr += sizeof(sljit_sw);
1886 }
1887 tmp1next = TRUE;
1888 }
1889 }
1890 }
1891 }
1892 while (status != end);
1893
1894 if (save)
1895 {
1896 if (tmp1next)
1897 {
1898 if (!tmp1empty)
1899 {
1900 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackptr, TMP1, 0);
1901 stackptr += sizeof(sljit_sw);
1902 }
1903 if (!tmp2empty)
1904 {
1905 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackptr, TMP2, 0);
1906 stackptr += sizeof(sljit_sw);
1907 }
1908 }
1909 else
1910 {
1911 if (!tmp2empty)
1912 {
1913 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackptr, TMP2, 0);
1914 stackptr += sizeof(sljit_sw);
1915 }
1916 if (!tmp1empty)
1917 {
1918 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), stackptr, TMP1, 0);
1919 stackptr += sizeof(sljit_sw);
1920 }
1921 }
1922 }
1923 SLJIT_ASSERT(cc == ccend && stackptr == stacktop && (save || (tmp1empty && tmp2empty)));
1924 }
1925
1926 static SLJIT_INLINE pcre_uchar *set_then_offsets(compiler_common *common, pcre_uchar *cc, pcre_uint8 *current_offset)
1927 {
1928 pcre_uchar *end = bracketend(cc);
1929 BOOL has_alternatives = cc[GET(cc, 1)] == OP_ALT;
1930
1931 /* Assert captures then. */
1932 if (*cc >= OP_ASSERT && *cc <= OP_ASSERTBACK_NOT)
1933 current_offset = NULL;
1934 /* Conditional block does not. */
1935 if (*cc == OP_COND || *cc == OP_SCOND)
1936 has_alternatives = FALSE;
1937
1938 cc = next_opcode(common, cc);
1939 if (has_alternatives)
1940 current_offset = common->then_offsets + (cc - common->start);
1941
1942 while (cc < end)
1943 {
1944 if ((*cc >= OP_ASSERT && *cc <= OP_ASSERTBACK_NOT) || (*cc >= OP_ONCE && *cc <= OP_SCOND))
1945 cc = set_then_offsets(common, cc, current_offset);
1946 else
1947 {
1948 if (*cc == OP_ALT && has_alternatives)
1949 current_offset = common->then_offsets + (cc + 1 + LINK_SIZE - common->start);
1950 if (*cc >= OP_THEN && *cc <= OP_THEN_ARG && current_offset != NULL)
1951 *current_offset = 1;
1952 cc = next_opcode(common, cc);
1953 }
1954 }
1955
1956 return end;
1957 }
1958
1959 #undef CASE_ITERATOR_PRIVATE_DATA_1
1960 #undef CASE_ITERATOR_PRIVATE_DATA_2A
1961 #undef CASE_ITERATOR_PRIVATE_DATA_2B
1962 #undef CASE_ITERATOR_TYPE_PRIVATE_DATA_1
1963 #undef CASE_ITERATOR_TYPE_PRIVATE_DATA_2A
1964 #undef CASE_ITERATOR_TYPE_PRIVATE_DATA_2B
1965
1966 static SLJIT_INLINE BOOL is_powerof2(unsigned int value)
1967 {
1968 return (value & (value - 1)) == 0;
1969 }
1970
1971 static SLJIT_INLINE void set_jumps(jump_list *list, struct sljit_label *label)
1972 {
1973 while (list)
1974 {
1975 /* sljit_set_label is clever enough to do nothing
1976 if either the jump or the label is NULL. */
1977 SET_LABEL(list->jump, label);
1978 list = list->next;
1979 }
1980 }
1981
1982 static SLJIT_INLINE void add_jump(struct sljit_compiler *compiler, jump_list **list, struct sljit_jump* jump)
1983 {
1984 jump_list *list_item = sljit_alloc_memory(compiler, sizeof(jump_list));
1985 if (list_item)
1986 {
1987 list_item->next = *list;
1988 list_item->jump = jump;
1989 *list = list_item;
1990 }
1991 }
1992
1993 static void add_stub(compiler_common *common, struct sljit_jump *start)
1994 {
1995 DEFINE_COMPILER;
1996 stub_list* list_item = sljit_alloc_memory(compiler, sizeof(stub_list));
1997
1998 if (list_item)
1999 {
2000 list_item->start = start;
2001 list_item->quit = LABEL();
2002 list_item->next = common->stubs;
2003 common->stubs = list_item;
2004 }
2005 }
2006
2007 static void flush_stubs(compiler_common *common)
2008 {
2009 DEFINE_COMPILER;
2010 stub_list* list_item = common->stubs;
2011
2012 while (list_item)
2013 {
2014 JUMPHERE(list_item->start);
2015 add_jump(compiler, &common->stackalloc, JUMP(SLJIT_FAST_CALL));
2016 JUMPTO(SLJIT_JUMP, list_item->quit);
2017 list_item = list_item->next;
2018 }
2019 common->stubs = NULL;
2020 }
2021
2022 static SLJIT_INLINE void count_match(compiler_common *common)
2023 {
2024 DEFINE_COMPILER;
2025
2026 OP2(SLJIT_SUB | SLJIT_SET_E, COUNT_MATCH, 0, COUNT_MATCH, 0, SLJIT_IMM, 1);
2027 add_jump(compiler, &common->calllimit, JUMP(SLJIT_C_ZERO));
2028 }
2029
2030 static SLJIT_INLINE void allocate_stack(compiler_common *common, int size)
2031 {
2032 /* May destroy all locals and registers except TMP2. */
2033 DEFINE_COMPILER;
2034
2035 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, size * sizeof(sljit_sw));
2036 #ifdef DESTROY_REGISTERS
2037 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, 12345);
2038 OP1(SLJIT_MOV, TMP3, 0, TMP1, 0);
2039 OP1(SLJIT_MOV, RETURN_ADDR, 0, TMP1, 0);
2040 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, TMP1, 0);
2041 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, TMP1, 0);
2042 #endif
2043 add_stub(common, CMP(SLJIT_C_GREATER, STACK_TOP, 0, STACK_LIMIT, 0));
2044 }
2045
2046 static SLJIT_INLINE void free_stack(compiler_common *common, int size)
2047 {
2048 DEFINE_COMPILER;
2049 OP2(SLJIT_SUB, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, size * sizeof(sljit_sw));
2050 }
2051
2052 static SLJIT_INLINE void reset_ovector(compiler_common *common, int length)
2053 {
2054 DEFINE_COMPILER;
2055 struct sljit_label *loop;
2056 int i;
2057
2058 /* At this point we can freely use all temporary registers. */
2059 SLJIT_ASSERT(length > 1);
2060 /* TMP1 returns with begin - 1. */
2061 OP2(SLJIT_SUB, SLJIT_SCRATCH_REG1, 0, SLJIT_MEM1(SLJIT_SAVED_REG1), SLJIT_OFFSETOF(jit_arguments, begin), SLJIT_IMM, IN_UCHARS(1));
2062 if (length < 8)
2063 {
2064 for (i = 1; i < length; i++)
2065 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(i), SLJIT_SCRATCH_REG1, 0);
2066 }
2067 else
2068 {
2069 GET_LOCAL_BASE(SLJIT_SCRATCH_REG2, 0, OVECTOR_START);
2070 OP1(SLJIT_MOV, SLJIT_SCRATCH_REG3, 0, SLJIT_IMM, length - 1);
2071 loop = LABEL();
2072 OP1(SLJIT_MOVU, SLJIT_MEM1(SLJIT_SCRATCH_REG2), sizeof(sljit_sw), SLJIT_SCRATCH_REG1, 0);
2073 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_SCRATCH_REG3, 0, SLJIT_SCRATCH_REG3, 0, SLJIT_IMM, 1);
2074 JUMPTO(SLJIT_C_NOT_ZERO, loop);
2075 }
2076 }
2077
2078 static SLJIT_INLINE void do_reset_match(compiler_common *common, int length)
2079 {
2080 DEFINE_COMPILER;
2081 struct sljit_label *loop;
2082 int i;
2083
2084 SLJIT_ASSERT(length > 1);
2085 /* OVECTOR(1) contains the "string begin - 1" constant. */
2086 if (length > 2)
2087 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1));
2088 if (length < 8)
2089 {
2090 for (i = 2; i < length; i++)
2091 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(i), TMP1, 0);
2092 }
2093 else
2094 {
2095 GET_LOCAL_BASE(TMP2, 0, OVECTOR_START + sizeof(sljit_sw));
2096 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_IMM, length - 2);
2097 loop = LABEL();
2098 OP1(SLJIT_MOVU, SLJIT_MEM1(TMP2), sizeof(sljit_sw), TMP1, 0);
2099 OP2(SLJIT_SUB | SLJIT_SET_E, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, 1);
2100 JUMPTO(SLJIT_C_NOT_ZERO, loop);
2101 }
2102
2103 OP1(SLJIT_MOV, STACK_TOP, 0, ARGUMENTS, 0);
2104 if (common->mark_ptr != 0)
2105 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mark_ptr, SLJIT_IMM, 0);
2106 if (common->control_head_ptr != 0)
2107 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr, SLJIT_IMM, 0);
2108 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(STACK_TOP), SLJIT_OFFSETOF(jit_arguments, stack));
2109 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_ptr);
2110 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(STACK_TOP), SLJIT_OFFSETOF(struct sljit_stack, base));
2111 }
2112
2113 static sljit_sw SLJIT_CALL do_search_mark(sljit_sw *current, const pcre_uchar *skip_arg)
2114 {
2115 while (current != NULL)
2116 {
2117 switch (current[-2])
2118 {
2119 case type_then_trap:
2120 break;
2121
2122 case type_mark:
2123 if (STRCMP_UC_UC(skip_arg, (pcre_uchar *)current[-3]) == 0)
2124 return current[-4];
2125 break;
2126
2127 default:
2128 SLJIT_ASSERT_STOP();
2129 break;
2130 }
2131 current = (sljit_sw*)current[-1];
2132 }
2133 return -1;
2134 }
2135
2136 static SLJIT_INLINE void copy_ovector(compiler_common *common, int topbracket)
2137 {
2138 DEFINE_COMPILER;
2139 struct sljit_label *loop;
2140 struct sljit_jump *early_quit;
2141
2142 /* At this point we can freely use all registers. */
2143 OP1(SLJIT_MOV, SLJIT_SAVED_REG3, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1));
2144 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1), STR_PTR, 0);
2145
2146 OP1(SLJIT_MOV, SLJIT_SCRATCH_REG1, 0, ARGUMENTS, 0);
2147 if (common->mark_ptr != 0)
2148 OP1(SLJIT_MOV, SLJIT_SCRATCH_REG3, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mark_ptr);
2149 OP1(SLJIT_MOV_SI, SLJIT_SCRATCH_REG2, 0, SLJIT_MEM1(SLJIT_SCRATCH_REG1), SLJIT_OFFSETOF(jit_arguments, offset_count));
2150 if (common->mark_ptr != 0)
2151 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_SCRATCH_REG1), SLJIT_OFFSETOF(jit_arguments, mark_ptr), SLJIT_SCRATCH_REG3, 0);
2152 OP2(SLJIT_SUB, SLJIT_SCRATCH_REG3, 0, SLJIT_MEM1(SLJIT_SCRATCH_REG1), SLJIT_OFFSETOF(jit_arguments, offsets), SLJIT_IMM, sizeof(int));
2153 OP1(SLJIT_MOV, SLJIT_SCRATCH_REG1, 0, SLJIT_MEM1(SLJIT_SCRATCH_REG1), SLJIT_OFFSETOF(jit_arguments, begin));
2154 GET_LOCAL_BASE(SLJIT_SAVED_REG1, 0, OVECTOR_START);
2155 /* Unlikely, but possible */
2156 early_quit = CMP(SLJIT_C_EQUAL, SLJIT_SCRATCH_REG2, 0, SLJIT_IMM, 0);
2157 loop = LABEL();
2158 OP2(SLJIT_SUB, SLJIT_SAVED_REG2, 0, SLJIT_MEM1(SLJIT_SAVED_REG1), 0, SLJIT_SCRATCH_REG1, 0);
2159 OP2(SLJIT_ADD, SLJIT_SAVED_REG1, 0, SLJIT_SAVED_REG1, 0, SLJIT_IMM, sizeof(sljit_sw));
2160 /* Copy the integer value to the output buffer */
2161 #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
2162 OP2(SLJIT_ASHR, SLJIT_SAVED_REG2, 0, SLJIT_SAVED_REG2, 0, SLJIT_IMM, UCHAR_SHIFT);
2163 #endif
2164 OP1(SLJIT_MOVU_SI, SLJIT_MEM1(SLJIT_SCRATCH_REG3), sizeof(int), SLJIT_SAVED_REG2, 0);
2165 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_SCRATCH_REG2, 0, SLJIT_SCRATCH_REG2, 0, SLJIT_IMM, 1);
2166 JUMPTO(SLJIT_C_NOT_ZERO, loop);
2167 JUMPHERE(early_quit);
2168
2169 /* Calculate the return value, which is the maximum ovector value. */
2170 if (topbracket > 1)
2171 {
2172 GET_LOCAL_BASE(SLJIT_SCRATCH_REG1, 0, OVECTOR_START + topbracket * 2 * sizeof(sljit_sw));
2173 OP1(SLJIT_MOV, SLJIT_SCRATCH_REG2, 0, SLJIT_IMM, topbracket + 1);
2174
2175 /* OVECTOR(0) is never equal to SLJIT_SAVED_REG3. */
2176 loop = LABEL();
2177 OP1(SLJIT_MOVU, SLJIT_SCRATCH_REG3, 0, SLJIT_MEM1(SLJIT_SCRATCH_REG1), -(2 * (sljit_sw)sizeof(sljit_sw)));
2178 OP2(SLJIT_SUB, SLJIT_SCRATCH_REG2, 0, SLJIT_SCRATCH_REG2, 0, SLJIT_IMM, 1);
2179 CMPTO(SLJIT_C_EQUAL, SLJIT_SCRATCH_REG3, 0, SLJIT_SAVED_REG3, 0, loop);
2180 OP1(SLJIT_MOV, SLJIT_RETURN_REG, 0, SLJIT_SCRATCH_REG2, 0);
2181 }
2182 else
2183 OP1(SLJIT_MOV, SLJIT_RETURN_REG, 0, SLJIT_IMM, 1);
2184 }
2185
2186 static SLJIT_INLINE void return_with_partial_match(compiler_common *common, struct sljit_label *quit)
2187 {
2188 DEFINE_COMPILER;
2189 struct sljit_jump *jump;
2190
2191 SLJIT_COMPILE_ASSERT(STR_END == SLJIT_SAVED_REG2, str_end_must_be_saved_reg2);
2192 SLJIT_ASSERT(common->start_used_ptr != 0 && common->start_ptr != 0
2193 && (common->mode == JIT_PARTIAL_SOFT_COMPILE ? common->hit_start != 0 : common->hit_start == 0));
2194
2195 OP1(SLJIT_MOV, SLJIT_SCRATCH_REG2, 0, ARGUMENTS, 0);
2196 OP1(SLJIT_MOV, SLJIT_RETURN_REG, 0, SLJIT_IMM, PCRE_ERROR_PARTIAL);
2197 OP1(SLJIT_MOV_SI, SLJIT_SCRATCH_REG3, 0, SLJIT_MEM1(SLJIT_SCRATCH_REG2), SLJIT_OFFSETOF(jit_arguments, real_offset_count));
2198 CMPTO(SLJIT_C_SIG_LESS, SLJIT_SCRATCH_REG3, 0, SLJIT_IMM, 2, quit);
2199
2200 /* Store match begin and end. */
2201 OP1(SLJIT_MOV, SLJIT_SAVED_REG1, 0, SLJIT_MEM1(SLJIT_SCRATCH_REG2), SLJIT_OFFSETOF(jit_arguments, begin));
2202 OP1(SLJIT_MOV, SLJIT_SCRATCH_REG2, 0, SLJIT_MEM1(SLJIT_SCRATCH_REG2), SLJIT_OFFSETOF(jit_arguments, offsets));
2203
2204 jump = CMP(SLJIT_C_SIG_LESS, SLJIT_SCRATCH_REG3, 0, SLJIT_IMM, 3);
2205 OP2(SLJIT_SUB, SLJIT_SCRATCH_REG3, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mode == JIT_PARTIAL_HARD_COMPILE ? common->start_ptr : (common->hit_start + (int)sizeof(sljit_sw)), SLJIT_SAVED_REG1, 0);
2206 #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
2207 OP2(SLJIT_ASHR, SLJIT_SCRATCH_REG3, 0, SLJIT_SCRATCH_REG3, 0, SLJIT_IMM, UCHAR_SHIFT);
2208 #endif
2209 OP1(SLJIT_MOV_SI, SLJIT_MEM1(SLJIT_SCRATCH_REG2), 2 * sizeof(int), SLJIT_SCRATCH_REG3, 0);
2210 JUMPHERE(jump);
2211
2212 OP1(SLJIT_MOV, SLJIT_SCRATCH_REG3, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mode == JIT_PARTIAL_HARD_COMPILE ? common->start_used_ptr : common->hit_start);
2213 OP2(SLJIT_SUB, SLJIT_SAVED_REG2, 0, STR_END, 0, SLJIT_SAVED_REG1, 0);
2214 #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
2215 OP2(SLJIT_ASHR, SLJIT_SAVED_REG2, 0, SLJIT_SAVED_REG2, 0, SLJIT_IMM, UCHAR_SHIFT);
2216 #endif
2217 OP1(SLJIT_MOV_SI, SLJIT_MEM1(SLJIT_SCRATCH_REG2), sizeof(int), SLJIT_SAVED_REG2, 0);
2218
2219 OP2(SLJIT_SUB, SLJIT_SCRATCH_REG3, 0, SLJIT_SCRATCH_REG3, 0, SLJIT_SAVED_REG1, 0);
2220 #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
2221 OP2(SLJIT_ASHR, SLJIT_SCRATCH_REG3, 0, SLJIT_SCRATCH_REG3, 0, SLJIT_IMM, UCHAR_SHIFT);
2222 #endif
2223 OP1(SLJIT_MOV_SI, SLJIT_MEM1(SLJIT_SCRATCH_REG2), 0, SLJIT_SCRATCH_REG3, 0);
2224
2225 JUMPTO(SLJIT_JUMP, quit);
2226 }
2227
2228 static SLJIT_INLINE void check_start_used_ptr(compiler_common *common)
2229 {
2230 /* May destroy TMP1. */
2231 DEFINE_COMPILER;
2232 struct sljit_jump *jump;
2233
2234 if (common->mode == JIT_PARTIAL_SOFT_COMPILE)
2235 {
2236 /* The value of -1 must be kept for start_used_ptr! */
2237 OP2(SLJIT_ADD, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_used_ptr, SLJIT_IMM, 1);
2238 /* Jumps if start_used_ptr < STR_PTR, or start_used_ptr == -1. Although overwriting
2239 is not necessary if start_used_ptr == STR_PTR, it does not hurt as well. */
2240 jump = CMP(SLJIT_C_LESS_EQUAL, TMP1, 0, STR_PTR, 0);
2241 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_used_ptr, STR_PTR, 0);
2242 JUMPHERE(jump);
2243 }
2244 else if (common->mode == JIT_PARTIAL_HARD_COMPILE)
2245 {
2246 jump = CMP(SLJIT_C_LESS_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_used_ptr, STR_PTR, 0);
2247 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_used_ptr, STR_PTR, 0);
2248 JUMPHERE(jump);
2249 }
2250 }
2251
2252 static SLJIT_INLINE BOOL char_has_othercase(compiler_common *common, pcre_uchar* cc)
2253 {
2254 /* Detects if the character has an othercase. */
2255 unsigned int c;
2256
2257 #ifdef SUPPORT_UTF
2258 if (common->utf)
2259 {
2260 GETCHAR(c, cc);
2261 if (c > 127)
2262 {
2263 #ifdef SUPPORT_UCP
2264 return c != UCD_OTHERCASE(c);
2265 #else
2266 return FALSE;
2267 #endif
2268 }
2269 #ifndef COMPILE_PCRE8
2270 return common->fcc[c] != c;
2271 #endif
2272 }
2273 else
2274 #endif
2275 c = *cc;
2276 return MAX_255(c) ? common->fcc[c] != c : FALSE;
2277 }
2278
2279 static SLJIT_INLINE unsigned int char_othercase(compiler_common *common, unsigned int c)
2280 {
2281 /* Returns with the othercase. */
2282 #ifdef SUPPORT_UTF
2283 if (common->utf && c > 127)
2284 {
2285 #ifdef SUPPORT_UCP
2286 return UCD_OTHERCASE(c);
2287 #else
2288 return c;
2289 #endif
2290 }
2291 #endif
2292 return TABLE_GET(c, common->fcc, c);
2293 }
2294
2295 static unsigned int char_get_othercase_bit(compiler_common *common, pcre_uchar* cc)
2296 {
2297 /* Detects if the character and its othercase has only 1 bit difference. */
2298 unsigned int c, oc, bit;
2299 #if defined SUPPORT_UTF && defined COMPILE_PCRE8
2300 int n;
2301 #endif
2302
2303 #ifdef SUPPORT_UTF
2304 if (common->utf)
2305 {
2306 GETCHAR(c, cc);
2307 if (c <= 127)
2308 oc = common->fcc[c];
2309 else
2310 {
2311 #ifdef SUPPORT_UCP
2312 oc = UCD_OTHERCASE(c);
2313 #else
2314 oc = c;
2315 #endif
2316 }
2317 }
2318 else
2319 {
2320 c = *cc;
2321 oc = TABLE_GET(c, common->fcc, c);
2322 }
2323 #else
2324 c = *cc;
2325 oc = TABLE_GET(c, common->fcc, c);
2326 #endif
2327
2328 SLJIT_ASSERT(c != oc);
2329
2330 bit = c ^ oc;
2331 /* Optimized for English alphabet. */
2332 if (c <= 127 && bit == 0x20)
2333 return (0 << 8) | 0x20;
2334
2335 /* Since c != oc, they must have at least 1 bit difference. */
2336 if (!is_powerof2(bit))
2337 return 0;
2338
2339 #if defined COMPILE_PCRE8
2340
2341 #ifdef SUPPORT_UTF
2342 if (common->utf && c > 127)
2343 {
2344 n = GET_EXTRALEN(*cc);
2345 while ((bit & 0x3f) == 0)
2346 {
2347 n--;
2348 bit >>= 6;
2349 }
2350 return (n << 8) | bit;
2351 }
2352 #endif /* SUPPORT_UTF */
2353 return (0 << 8) | bit;
2354
2355 #elif defined COMPILE_PCRE16 || defined COMPILE_PCRE32
2356
2357 #ifdef SUPPORT_UTF
2358 if (common->utf && c > 65535)
2359 {
2360 if (bit >= (1 << 10))
2361 bit >>= 10;
2362 else
2363 return (bit < 256) ? ((2 << 8) | bit) : ((3 << 8) | (bit >> 8));
2364 }
2365 #endif /* SUPPORT_UTF */
2366 return (bit < 256) ? ((0 << 8) | bit) : ((1 << 8) | (bit >> 8));
2367
2368 #endif /* COMPILE_PCRE[8|16|32] */
2369 }
2370
2371 static void check_partial(compiler_common *common, BOOL force)
2372 {
2373 /* Checks whether a partial matching is occurred. Does not modify registers. */
2374 DEFINE_COMPILER;
2375 struct sljit_jump *jump = NULL;
2376
2377 SLJIT_ASSERT(!force || common->mode != JIT_COMPILE);
2378
2379 if (common->mode == JIT_COMPILE)
2380 return;
2381
2382 if (!force)
2383 jump = CMP(SLJIT_C_GREATER_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_used_ptr, STR_PTR, 0);
2384 else if (common->mode == JIT_PARTIAL_SOFT_COMPILE)
2385 jump = CMP(SLJIT_C_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_used_ptr, SLJIT_IMM, -1);
2386
2387 if (common->mode == JIT_PARTIAL_SOFT_COMPILE)
2388 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->hit_start, SLJIT_IMM, 0);
2389 else
2390 {
2391 if (common->partialmatchlabel != NULL)
2392 JUMPTO(SLJIT_JUMP, common->partialmatchlabel);
2393 else
2394 add_jump(compiler, &common->partialmatch, JUMP(SLJIT_JUMP));
2395 }
2396
2397 if (jump != NULL)
2398 JUMPHERE(jump);
2399 }
2400
2401 static void check_str_end(compiler_common *common, jump_list **end_reached)
2402 {
2403 /* Does not affect registers. Usually used in a tight spot. */
2404 DEFINE_COMPILER;
2405 struct sljit_jump *jump;
2406
2407 if (common->mode == JIT_COMPILE)
2408 {
2409 add_jump(compiler, end_reached, CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0));
2410 return;
2411 }
2412
2413 jump = CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0);
2414 if (common->mode == JIT_PARTIAL_SOFT_COMPILE)
2415 {
2416 add_jump(compiler, end_reached, CMP(SLJIT_C_GREATER_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_used_ptr, STR_PTR, 0));
2417 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->hit_start, SLJIT_IMM, 0);
2418 add_jump(compiler, end_reached, JUMP(SLJIT_JUMP));
2419 }
2420 else
2421 {
2422 add_jump(compiler, end_reached, CMP(SLJIT_C_GREATER_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_used_ptr, STR_PTR, 0));
2423 if (common->partialmatchlabel != NULL)
2424 JUMPTO(SLJIT_JUMP, common->partialmatchlabel);
2425 else
2426 add_jump(compiler, &common->partialmatch, JUMP(SLJIT_JUMP));
2427 }
2428 JUMPHERE(jump);
2429 }
2430
2431 static void detect_partial_match(compiler_common *common, jump_list **backtracks)
2432 {
2433 DEFINE_COMPILER;
2434 struct sljit_jump *jump;
2435
2436 if (common->mode == JIT_COMPILE)
2437 {
2438 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0));
2439 return;
2440 }
2441
2442 /* Partial matching mode. */
2443 jump = CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0);
2444 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), common->start_used_ptr, STR_PTR, 0));
2445 if (common->mode == JIT_PARTIAL_SOFT_COMPILE)
2446 {
2447 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->hit_start, SLJIT_IMM, 0);
2448 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
2449 }
2450 else
2451 {
2452 if (common->partialmatchlabel != NULL)
2453 JUMPTO(SLJIT_JUMP, common->partialmatchlabel);
2454 else
2455 add_jump(compiler, &common->partialmatch, JUMP(SLJIT_JUMP));
2456 }
2457 JUMPHERE(jump);
2458 }
2459
2460 static void read_char(compiler_common *common)
2461 {
2462 /* Reads the character into TMP1, updates STR_PTR.
2463 Does not check STR_END. TMP2 Destroyed. */
2464 DEFINE_COMPILER;
2465 #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2466 struct sljit_jump *jump;
2467 #endif
2468
2469 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
2470 #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2471 if (common->utf)
2472 {
2473 #if defined COMPILE_PCRE8
2474 jump = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xc0);
2475 #elif defined COMPILE_PCRE16
2476 jump = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xd800);
2477 #endif /* COMPILE_PCRE[8|16] */
2478 add_jump(compiler, &common->utfreadchar, JUMP(SLJIT_FAST_CALL));
2479 JUMPHERE(jump);
2480 }
2481 #endif /* SUPPORT_UTF && !COMPILE_PCRE32 */
2482 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2483 }
2484
2485 static void peek_char(compiler_common *common)
2486 {
2487 /* Reads the character into TMP1, keeps STR_PTR.
2488 Does not check STR_END. TMP2 Destroyed. */
2489 DEFINE_COMPILER;
2490 #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2491 struct sljit_jump *jump;
2492 #endif
2493
2494 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
2495 #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2496 if (common->utf)
2497 {
2498 #if defined COMPILE_PCRE8
2499 jump = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xc0);
2500 #elif defined COMPILE_PCRE16
2501 jump = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xd800);
2502 #endif /* COMPILE_PCRE[8|16] */
2503 add_jump(compiler, &common->utfreadchar, JUMP(SLJIT_FAST_CALL));
2504 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
2505 JUMPHERE(jump);
2506 }
2507 #endif /* SUPPORT_UTF && !COMPILE_PCRE32 */
2508 }
2509
2510 static void read_char8_type(compiler_common *common)
2511 {
2512 /* Reads the character type into TMP1, updates STR_PTR. Does not check STR_END. */
2513 DEFINE_COMPILER;
2514 #if defined SUPPORT_UTF || defined COMPILE_PCRE16 || defined COMPILE_PCRE32
2515 struct sljit_jump *jump;
2516 #endif
2517
2518 #ifdef SUPPORT_UTF
2519 if (common->utf)
2520 {
2521 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), 0);
2522 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2523 #if defined COMPILE_PCRE8
2524 /* This can be an extra read in some situations, but hopefully
2525 it is needed in most cases. */
2526 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP2), common->ctypes);
2527 jump = CMP(SLJIT_C_LESS, TMP2, 0, SLJIT_IMM, 0xc0);
2528 add_jump(compiler, &common->utfreadtype8, JUMP(SLJIT_FAST_CALL));
2529 JUMPHERE(jump);
2530 #elif defined COMPILE_PCRE16
2531 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, 0);
2532 jump = CMP(SLJIT_C_GREATER, TMP2, 0, SLJIT_IMM, 255);
2533 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP2), common->ctypes);
2534 JUMPHERE(jump);
2535 /* Skip low surrogate if necessary. */
2536 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 0xfc00);
2537 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP2, 0, SLJIT_IMM, 0xd800);
2538 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
2539 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, 1);
2540 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
2541 #elif defined COMPILE_PCRE32
2542 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, 0);
2543 jump = CMP(SLJIT_C_GREATER, TMP2, 0, SLJIT_IMM, 255);
2544 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP2), common->ctypes);
2545 JUMPHERE(jump);
2546 #endif /* COMPILE_PCRE[8|16|32] */
2547 return;
2548 }
2549 #endif /* SUPPORT_UTF */
2550 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), 0);
2551 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2552 #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
2553 /* The ctypes array contains only 256 values. */
2554 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, 0);
2555 jump = CMP(SLJIT_C_GREATER, TMP2, 0, SLJIT_IMM, 255);
2556 #endif
2557 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP2), common->ctypes);
2558 #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
2559 JUMPHERE(jump);
2560 #endif
2561 }
2562
2563 static void skip_char_back(compiler_common *common)
2564 {
2565 /* Goes one character back. Affects STR_PTR and TMP1. Does not check begin. */
2566 DEFINE_COMPILER;
2567 #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2568 #if defined COMPILE_PCRE8
2569 struct sljit_label *label;
2570
2571 if (common->utf)
2572 {
2573 label = LABEL();
2574 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), -IN_UCHARS(1));
2575 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2576 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0xc0);
2577 CMPTO(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, 0x80, label);
2578 return;
2579 }
2580 #elif defined COMPILE_PCRE16
2581 if (common->utf)
2582 {
2583 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), -IN_UCHARS(1));
2584 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2585 /* Skip low surrogate if necessary. */
2586 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0xfc00);
2587 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xdc00);
2588 OP_FLAGS(SLJIT_MOV, TMP1, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
2589 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
2590 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
2591 return;
2592 }
2593 #endif /* COMPILE_PCRE[8|16] */
2594 #endif /* SUPPORT_UTF && !COMPILE_PCRE32 */
2595 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2596 }
2597
2598 static void check_newlinechar(compiler_common *common, int nltype, jump_list **backtracks, BOOL jumpiftrue)
2599 {
2600 /* Character comes in TMP1. Checks if it is a newline. TMP2 may be destroyed. */
2601 DEFINE_COMPILER;
2602
2603 if (nltype == NLTYPE_ANY)
2604 {
2605 add_jump(compiler, &common->anynewline, JUMP(SLJIT_FAST_CALL));
2606 add_jump(compiler, backtracks, JUMP(jumpiftrue ? SLJIT_C_NOT_ZERO : SLJIT_C_ZERO));
2607 }
2608 else if (nltype == NLTYPE_ANYCRLF)
2609 {
2610 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, CHAR_CR);
2611 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
2612 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, CHAR_NL);
2613 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
2614 add_jump(compiler, backtracks, JUMP(jumpiftrue ? SLJIT_C_NOT_ZERO : SLJIT_C_ZERO));
2615 }
2616 else
2617 {
2618 SLJIT_ASSERT(nltype == NLTYPE_FIXED && common->newline < 256);
2619 add_jump(compiler, backtracks, CMP(jumpiftrue ? SLJIT_C_EQUAL : SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, common->newline));
2620 }
2621 }
2622
2623 #ifdef SUPPORT_UTF
2624
2625 #if defined COMPILE_PCRE8
2626 static void do_utfreadchar(compiler_common *common)
2627 {
2628 /* Fast decoding a UTF-8 character. TMP1 contains the first byte
2629 of the character (>= 0xc0). Return char value in TMP1, length - 1 in TMP2. */
2630 DEFINE_COMPILER;
2631 struct sljit_jump *jump;
2632
2633 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
2634 /* Searching for the first zero. */
2635 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x20);
2636 jump = JUMP(SLJIT_C_NOT_ZERO);
2637 /* Two byte sequence. */
2638 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
2639 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2640 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x1f);
2641 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 6);
2642 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 0x3f);
2643 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, TMP2, 0);
2644 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, IN_UCHARS(1));
2645 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
2646 JUMPHERE(jump);
2647
2648 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x10);
2649 jump = JUMP(SLJIT_C_NOT_ZERO);
2650 /* Three byte sequence. */
2651 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
2652 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x0f);
2653 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 12);
2654 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 0x3f);
2655 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, 6);
2656 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, TMP2, 0);
2657 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(2));
2658 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(2));
2659 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 0x3f);
2660 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, TMP2, 0);
2661 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, IN_UCHARS(2));
2662 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
2663 JUMPHERE(jump);
2664
2665 /* Four byte sequence. */
2666 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
2667 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x07);
2668 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 18);
2669 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 0x3f);
2670 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, 12);
2671 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, TMP2, 0);
2672 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(2));
2673 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 0x3f);
2674 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, 6);
2675 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, TMP2, 0);
2676 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(3));
2677 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(3));
2678 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 0x3f);
2679 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, TMP2, 0);
2680 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, IN_UCHARS(3));
2681 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
2682 }
2683
2684 static void do_utfreadtype8(compiler_common *common)
2685 {
2686 /* Fast decoding a UTF-8 character type. TMP2 contains the first byte
2687 of the character (>= 0xc0). Return value in TMP1. */
2688 DEFINE_COMPILER;
2689 struct sljit_jump *jump;
2690 struct sljit_jump *compare;
2691
2692 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
2693
2694 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP2, 0, SLJIT_IMM, 0x20);
2695 jump = JUMP(SLJIT_C_NOT_ZERO);
2696 /* Two byte sequence. */
2697 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
2698 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2699 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 0x1f);
2700 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, 6);
2701 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x3f);
2702 OP2(SLJIT_OR, TMP2, 0, TMP2, 0, TMP1, 0);
2703 compare = CMP(SLJIT_C_GREATER, TMP2, 0, SLJIT_IMM, 255);
2704 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP2), common->ctypes);
2705 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
2706
2707 JUMPHERE(compare);
2708 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, 0);
2709 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
2710 JUMPHERE(jump);
2711
2712 /* We only have types for characters less than 256. */
2713 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP2), (sljit_sw)PRIV(utf8_table4) - 0xc0);
2714 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
2715 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, 0);
2716 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
2717 }
2718
2719 #elif defined COMPILE_PCRE16
2720
2721 static void do_utfreadchar(compiler_common *common)
2722 {
2723 /* Fast decoding a UTF-16 character. TMP1 contains the first 16 bit char
2724 of the character (>= 0xd800). Return char value in TMP1, length - 1 in TMP2. */
2725 DEFINE_COMPILER;
2726 struct sljit_jump *jump;
2727
2728 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
2729 jump = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xdc00);
2730 /* Do nothing, only return. */
2731 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
2732
2733 JUMPHERE(jump);
2734 /* Combine two 16 bit characters. */
2735 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
2736 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2737 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x3ff);
2738 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 10);
2739 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 0x3ff);
2740 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, TMP2, 0);
2741 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, IN_UCHARS(1));
2742 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x10000);
2743 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
2744 }
2745
2746 #endif /* COMPILE_PCRE[8|16] */
2747
2748 #endif /* SUPPORT_UTF */
2749
2750 #ifdef SUPPORT_UCP
2751
2752 /* UCD_BLOCK_SIZE must be 128 (see the assert below). */
2753 #define UCD_BLOCK_MASK 127
2754 #define UCD_BLOCK_SHIFT 7
2755
2756 static void do_getucd(compiler_common *common)
2757 {
2758 /* Search the UCD record for the character comes in TMP1.
2759 Returns chartype in TMP1 and UCD offset in TMP2. */
2760 DEFINE_COMPILER;
2761
2762 SLJIT_ASSERT(UCD_BLOCK_SIZE == 128 && sizeof(ucd_record) == 8);
2763
2764 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
2765 OP2(SLJIT_LSHR, TMP2, 0, TMP1, 0, SLJIT_IMM, UCD_BLOCK_SHIFT);
2766 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP2), (sljit_sw)PRIV(ucd_stage1));
2767 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, UCD_BLOCK_MASK);
2768 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, UCD_BLOCK_SHIFT);
2769 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, TMP2, 0);
2770 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, (sljit_sw)PRIV(ucd_stage2));
2771 OP1(SLJIT_MOV_UH, TMP2, 0, SLJIT_MEM2(TMP2, TMP1), 1);
2772 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, (sljit_sw)PRIV(ucd_records) + SLJIT_OFFSETOF(ucd_record, chartype));
2773 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM2(TMP1, TMP2), 3);
2774 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
2775 }
2776 #endif
2777
2778 static SLJIT_INLINE struct sljit_label *mainloop_entry(compiler_common *common, BOOL hascrorlf, BOOL firstline)
2779 {
2780 DEFINE_COMPILER;
2781 struct sljit_label *mainloop;
2782 struct sljit_label *newlinelabel = NULL;
2783 struct sljit_jump *start;
2784 struct sljit_jump *end = NULL;
2785 struct sljit_jump *nl = NULL;
2786 #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2787 struct sljit_jump *singlechar;
2788 #endif
2789 jump_list *newline = NULL;
2790 BOOL newlinecheck = FALSE;
2791 BOOL readuchar = FALSE;
2792
2793 if (!(hascrorlf || firstline) && (common->nltype == NLTYPE_ANY ||
2794 common->nltype == NLTYPE_ANYCRLF || common->newline > 255))
2795 newlinecheck = TRUE;
2796
2797 if (firstline)
2798 {
2799 /* Search for the end of the first line. */
2800 SLJIT_ASSERT(common->first_line_end != 0);
2801 OP1(SLJIT_MOV, TMP3, 0, STR_PTR, 0);
2802
2803 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
2804 {
2805 mainloop = LABEL();
2806 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2807 end = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2808 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(-1));
2809 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
2810 CMPTO(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff, mainloop);
2811 CMPTO(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, common->newline & 0xff, mainloop);
2812 JUMPHERE(end);
2813 OP2(SLJIT_SUB, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2814 }
2815 else
2816 {
2817 end = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2818 mainloop = LABEL();
2819 /* Continual stores does not cause data dependency. */
2820 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end, STR_PTR, 0);
2821 read_char(common);
2822 check_newlinechar(common, common->nltype, &newline, TRUE);
2823 CMPTO(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0, mainloop);
2824 JUMPHERE(end);
2825 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end, STR_PTR, 0);
2826 set_jumps(newline, LABEL());
2827 }
2828
2829 OP1(SLJIT_MOV, STR_PTR, 0, TMP3, 0);
2830 }
2831
2832 start = JUMP(SLJIT_JUMP);
2833
2834 if (newlinecheck)
2835 {
2836 newlinelabel = LABEL();
2837 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2838 end = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2839 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
2840 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, common->newline & 0xff);
2841 OP_FLAGS(SLJIT_MOV, TMP1, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
2842 #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
2843 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, UCHAR_SHIFT);
2844 #endif
2845 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
2846 nl = JUMP(SLJIT_JUMP);
2847 }
2848
2849 mainloop = LABEL();
2850
2851 /* Increasing the STR_PTR here requires one less jump in the most common case. */
2852 #ifdef SUPPORT_UTF
2853 if (common->utf) readuchar = TRUE;
2854 #endif
2855 if (newlinecheck) readuchar = TRUE;
2856
2857 if (readuchar)
2858 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
2859
2860 if (newlinecheck)
2861 CMPTO(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff, newlinelabel);
2862
2863 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2864 #if defined SUPPORT_UTF && !defined COMPILE_PCRE32
2865 #if defined COMPILE_PCRE8
2866 if (common->utf)
2867 {
2868 singlechar = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xc0);
2869 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_sw)PRIV(utf8_table4) - 0xc0);
2870 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
2871 JUMPHERE(singlechar);
2872 }
2873 #elif defined COMPILE_PCRE16
2874 if (common->utf)
2875 {
2876 singlechar = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xd800);
2877 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0xfc00);
2878 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xd800);
2879 OP_FLAGS(SLJIT_MOV, TMP1, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
2880 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
2881 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
2882 JUMPHERE(singlechar);
2883 }
2884 #endif /* COMPILE_PCRE[8|16] */
2885 #endif /* SUPPORT_UTF && !COMPILE_PCRE32 */
2886 JUMPHERE(start);
2887
2888 if (newlinecheck)
2889 {
2890 JUMPHERE(end);
2891 JUMPHERE(nl);
2892 }
2893
2894 return mainloop;
2895 }
2896
2897 #define MAX_N_CHARS 3
2898
2899 static SLJIT_INLINE BOOL fast_forward_first_n_chars(compiler_common *common, BOOL firstline)
2900 {
2901 DEFINE_COMPILER;
2902 struct sljit_label *start;
2903 struct sljit_jump *quit;
2904 pcre_uint32 chars[MAX_N_CHARS * 2];
2905 pcre_uchar *cc = common->start + 1 + LINK_SIZE;
2906 int location = 0;
2907 pcre_int32 len, c, bit, caseless;
2908 int must_stop;
2909
2910 /* We do not support alternatives now. */
2911 if (*(common->start + GET(common->start, 1)) == OP_ALT)
2912 return FALSE;
2913
2914 while (TRUE)
2915 {
2916 caseless = 0;
2917 must_stop = 1;
2918 switch(*cc)
2919 {
2920 case OP_CHAR:
2921 must_stop = 0;
2922 cc++;
2923 break;
2924
2925 case OP_CHARI:
2926 caseless = 1;
2927 must_stop = 0;
2928 cc++;
2929 break;
2930
2931 case OP_SOD:
2932 case OP_SOM:
2933 case OP_SET_SOM:
2934 case OP_NOT_WORD_BOUNDARY:
2935 case OP_WORD_BOUNDARY:
2936 case OP_EODN:
2937 case OP_EOD:
2938 case OP_CIRC:
2939 case OP_CIRCM:
2940 case OP_DOLL:
2941 case OP_DOLLM:
2942 /* Zero width assertions. */
2943 cc++;
2944 continue;
2945
2946 case OP_PLUS:
2947 case OP_MINPLUS:
2948 case OP_POSPLUS:
2949 cc++;
2950 break;
2951
2952 case OP_EXACT:
2953 cc += 1 + IMM2_SIZE;
2954 break;
2955
2956 case OP_PLUSI:
2957 case OP_MINPLUSI:
2958 case OP_POSPLUSI:
2959 caseless = 1;
2960 cc++;
2961 break;
2962
2963 case OP_EXACTI:
2964 caseless = 1;
2965 cc += 1 + IMM2_SIZE;
2966 break;
2967
2968 default:
2969 must_stop = 2;
2970 break;
2971 }
2972
2973 if (must_stop == 2)
2974 break;
2975
2976 len = 1;
2977 #ifdef SUPPORT_UTF
2978 if (common->utf && HAS_EXTRALEN(cc[0])) len += GET_EXTRALEN(cc[0]);
2979 #endif
2980
2981 if (caseless && char_has_othercase(common, cc))
2982 {
2983 caseless = char_get_othercase_bit(common, cc);
2984 if (caseless == 0)
2985 return FALSE;
2986 #ifdef COMPILE_PCRE8
2987 caseless = ((caseless & 0xff) << 8) | (len - (caseless >> 8));
2988 #else
2989 if ((caseless & 0x100) != 0)
2990 caseless = ((caseless & 0xff) << 16) | (len - (caseless >> 9));
2991 else
2992 caseless = ((caseless & 0xff) << 8) | (len - (caseless >> 9));
2993 #endif
2994 }
2995 else
2996 caseless = 0;
2997
2998 while (len > 0 && location < MAX_N_CHARS * 2)
2999 {
3000 c = *cc;
3001 bit = 0;
3002 if (len == (caseless & 0xff))
3003 {
3004 bit = caseless >> 8;
3005 c |= bit;
3006 }
3007
3008 chars[location] = c;
3009 chars[location + 1] = bit;
3010
3011 len--;
3012 location += 2;
3013 cc++;
3014 }
3015
3016 if (location >= MAX_N_CHARS * 2 || must_stop != 0)
3017 break;
3018 }
3019
3020 /* At least two characters are required. */
3021 if (location < 2 * 2)
3022 return FALSE;
3023
3024 if (firstline)
3025 {
3026 SLJIT_ASSERT(common->first_line_end != 0);
3027 OP1(SLJIT_MOV, TMP3, 0, STR_END, 0);
3028 OP2(SLJIT_SUB, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end, SLJIT_IMM, IN_UCHARS((location >> 1) - 1));
3029 }
3030 else
3031 OP2(SLJIT_SUB, STR_END, 0, STR_END, 0, SLJIT_IMM, IN_UCHARS((location >> 1) - 1));
3032
3033 start = LABEL();
3034 quit = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
3035
3036 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
3037 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
3038 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3039 if (chars[1] != 0)
3040 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, chars[1]);
3041 CMPTO(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, chars[0], start);
3042 if (location > 2 * 2)
3043 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
3044 if (chars[3] != 0)
3045 OP2(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_IMM, chars[3]);
3046 CMPTO(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, chars[2], start);
3047 if (location > 2 * 2)
3048 {
3049 if (chars[5] != 0)
3050 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, chars[5]);
3051 CMPTO(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, chars[4], start);
3052 }
3053 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3054
3055 JUMPHERE(quit);
3056
3057 if (firstline)
3058 OP1(SLJIT_MOV, STR_END, 0, TMP3, 0);
3059 else
3060 OP2(SLJIT_ADD, STR_END, 0, STR_END, 0, SLJIT_IMM, IN_UCHARS((location >> 1) - 1));
3061 return TRUE;
3062 }
3063
3064 #undef MAX_N_CHARS
3065
3066 static SLJIT_INLINE void fast_forward_first_char(compiler_common *common, pcre_uchar first_char, BOOL caseless, BOOL firstline)
3067 {
3068 DEFINE_COMPILER;
3069 struct sljit_label *start;
3070 struct sljit_jump *quit;
3071 struct sljit_jump *found;
3072 pcre_uchar oc, bit;
3073
3074 if (firstline)
3075 {
3076 SLJIT_ASSERT(common->first_line_end != 0);
3077 OP1(SLJIT_MOV, TMP3, 0, STR_END, 0);
3078 OP1(SLJIT_MOV, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end);
3079 }
3080
3081 start = LABEL();
3082 quit = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
3083 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
3084
3085 oc = first_char;
3086 if (caseless)
3087 {
3088 oc = TABLE_GET(first_char, common->fcc, first_char);
3089 #if defined SUPPORT_UCP && !(defined COMPILE_PCRE8)
3090 if (first_char > 127 && common->utf)
3091 oc = UCD_OTHERCASE(first_char);
3092 #endif
3093 }
3094 if (first_char == oc)
3095 found = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, first_char);
3096 else
3097 {
3098 bit = first_char ^ oc;
3099 if (is_powerof2(bit))
3100 {
3101 OP2(SLJIT_OR, TMP2, 0, TMP1, 0, SLJIT_IMM, bit);
3102 found = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, first_char | bit);
3103 }
3104 else
3105 {
3106 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, first_char);
3107 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
3108 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, oc);
3109 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3110 found = JUMP(SLJIT_C_NOT_ZERO);
3111 }
3112 }
3113
3114 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3115 JUMPTO(SLJIT_JUMP, start);
3116 JUMPHERE(found);
3117 JUMPHERE(quit);
3118
3119 if (firstline)
3120 OP1(SLJIT_MOV, STR_END, 0, TMP3, 0);
3121 }
3122
3123 static SLJIT_INLINE void fast_forward_newline(compiler_common *common, BOOL firstline)
3124 {
3125 DEFINE_COMPILER;
3126 struct sljit_label *loop;
3127 struct sljit_jump *lastchar;
3128 struct sljit_jump *firstchar;
3129 struct sljit_jump *quit;
3130 struct sljit_jump *foundcr = NULL;
3131 struct sljit_jump *notfoundnl;
3132 jump_list *newline = NULL;
3133
3134 if (firstline)
3135 {
3136 SLJIT_ASSERT(common->first_line_end != 0);
3137 OP1(SLJIT_MOV, TMP3, 0, STR_END, 0);
3138 OP1(SLJIT_MOV, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end);
3139 }
3140
3141 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
3142 {
3143 lastchar = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
3144 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
3145 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, str));
3146 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
3147 firstchar = CMP(SLJIT_C_LESS_EQUAL, STR_PTR, 0, TMP2, 0);
3148
3149 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, IN_UCHARS(2));
3150 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, STR_PTR, 0, TMP1, 0);
3151 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_GREATER_EQUAL);
3152 #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
3153 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, UCHAR_SHIFT);
3154 #endif
3155 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
3156
3157 loop = LABEL();
3158 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3159 quit = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
3160 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(-2));
3161 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(-1));
3162 CMPTO(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff, loop);
3163 CMPTO(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, common->newline & 0xff, loop);
3164
3165 JUMPHERE(quit);
3166 JUMPHERE(firstchar);
3167 JUMPHERE(lastchar);
3168
3169 if (firstline)
3170 OP1(SLJIT_MOV, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0);
3171 return;
3172 }
3173
3174 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
3175 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, str));
3176 firstchar = CMP(SLJIT_C_LESS_EQUAL, STR_PTR, 0, TMP2, 0);
3177 skip_char_back(common);
3178
3179 loop = LABEL();
3180 read_char(common);
3181 lastchar = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
3182 if (common->nltype == NLTYPE_ANY || common->nltype == NLTYPE_ANYCRLF)
3183 foundcr = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_CR);
3184 check_newlinechar(common, common->nltype, &newline, FALSE);
3185 set_jumps(newline, loop);
3186
3187 if (common->nltype == NLTYPE_ANY || common->nltype == NLTYPE_ANYCRLF)
3188 {
3189 quit = JUMP(SLJIT_JUMP);
3190 JUMPHERE(foundcr);
3191 notfoundnl = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
3192 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
3193 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, CHAR_NL);
3194 OP_FLAGS(SLJIT_MOV, TMP1, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
3195 #if defined COMPILE_PCRE16 || defined COMPILE_PCRE32
3196 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, UCHAR_SHIFT);
3197 #endif
3198 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
3199 JUMPHERE(notfoundnl);
3200 JUMPHERE(quit);
3201 }
3202 JUMPHERE(lastchar);
3203 JUMPHERE(firstchar);
3204
3205 if (firstline)
3206 OP1(SLJIT_MOV, STR_END, 0, TMP3, 0);
3207 }
3208
3209 static BOOL check_class_ranges(compiler_common *common, const pcre_uint8 *bits, BOOL nclass, BOOL invert, jump_list **backtracks);
3210
3211 static SLJIT_INLINE void fast_forward_start_bits(compiler_common *common, pcre_uint8 *start_bits, BOOL firstline)
3212 {
3213 DEFINE_COMPILER;
3214 struct sljit_label *start;
3215 struct sljit_jump *quit;
3216 struct sljit_jump *found = NULL;
3217 jump_list *matches = NULL;
3218 #ifndef COMPILE_PCRE8
3219 struct sljit_jump *jump;
3220 #endif
3221
3222 if (firstline)
3223 {
3224 SLJIT_ASSERT(common->first_line_end != 0);
3225 OP1(SLJIT_MOV, RETURN_ADDR, 0, STR_END, 0);
3226 OP1(SLJIT_MOV, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end);
3227 }
3228
3229 start = LABEL();
3230 quit = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
3231 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
3232 #ifdef SUPPORT_UTF
3233 if (common->utf)
3234 OP1(SLJIT_MOV, TMP3, 0, TMP1, 0);
3235 #endif
3236
3237 if (!check_class_ranges(common, start_bits, (start_bits[31] & 0x80) != 0, TRUE, &matches))
3238 {
3239 #ifndef COMPILE_PCRE8
3240 jump = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 255);
3241 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, 255);
3242 JUMPHERE(jump);
3243 #endif
3244 OP2(SLJIT_AND, TMP2, 0, TMP1, 0, SLJIT_IMM, 0x7);
3245 OP2(SLJIT_LSHR, TMP1, 0, TMP1, 0, SLJIT_IMM, 3);
3246 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_sw)start_bits);
3247 OP2(SLJIT_SHL, TMP2, 0, SLJIT_IMM, 1, TMP2, 0);
3248 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, TMP2, 0);
3249 found = JUMP(SLJIT_C_NOT_ZERO);
3250 }
3251
3252 #ifdef SUPPORT_UTF
3253 if (common->utf)
3254 OP1(SLJIT_MOV, TMP1, 0, TMP3, 0);
3255 #endif
3256 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3257 #ifdef SUPPORT_UTF
3258 #if defined COMPILE_PCRE8
3259 if (common->utf)
3260 {
3261 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xc0, start);
3262 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_sw)PRIV(utf8_table4) - 0xc0);
3263 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
3264 }
3265 #elif defined COMPILE_PCRE16
3266 if (common->utf)
3267 {
3268 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xd800, start);
3269 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0xfc00);
3270 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xd800);
3271 OP_FLAGS(SLJIT_MOV, TMP1, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
3272 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
3273 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
3274 }
3275 #endif /* COMPILE_PCRE[8|16] */
3276 #endif /* SUPPORT_UTF */
3277 JUMPTO(SLJIT_JUMP, start);
3278 if (found != NULL)
3279 JUMPHERE(found);
3280 if (matches != NULL)
3281 set_jumps(matches, LABEL());
3282 JUMPHERE(quit);
3283
3284 if (firstline)
3285 OP1(SLJIT_MOV, STR_END, 0, RETURN_ADDR, 0);
3286 }
3287
3288 static SLJIT_INLINE struct sljit_jump *search_requested_char(compiler_common *common, pcre_uchar req_char, BOOL caseless, BOOL has_firstchar)
3289 {
3290 DEFINE_COMPILER;
3291 struct sljit_label *loop;
3292 struct sljit_jump *toolong;
3293 struct sljit_jump *alreadyfound;
3294 struct sljit_jump *found;
3295 struct sljit_jump *foundoc = NULL;
3296 struct sljit_jump *notfound;
3297 pcre_uint32 oc, bit;
3298
3299 SLJIT_ASSERT(common->req_char_ptr != 0);
3300 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->req_char_ptr);
3301 OP2(SLJIT_ADD, TMP1, 0, STR_PTR, 0, SLJIT_IMM, REQ_BYTE_MAX);
3302 toolong = CMP(SLJIT_C_LESS, TMP1, 0, STR_END, 0);
3303 alreadyfound = CMP(SLJIT_C_LESS, STR_PTR, 0, TMP2, 0);
3304
3305 if (has_firstchar)
3306 OP2(SLJIT_ADD, TMP1, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3307 else
3308 OP1(SLJIT_MOV, TMP1, 0, STR_PTR, 0);
3309
3310 loop = LABEL();
3311 notfound = CMP(SLJIT_C_GREATER_EQUAL, TMP1, 0, STR_END, 0);
3312
3313 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(TMP1), 0);
3314 oc = req_char;
3315 if (caseless)
3316 {
3317 oc = TABLE_GET(req_char, common->fcc, req_char);
3318 #if defined SUPPORT_UCP && !(defined COMPILE_PCRE8)
3319 if (req_char > 127 && common->utf)
3320 oc = UCD_OTHERCASE(req_char);
3321 #endif
3322 }
3323 if (req_char == oc)
3324 found = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, req_char);
3325 else
3326 {
3327 bit = req_char ^ oc;
3328 if (is_powerof2(bit))
3329 {
3330 OP2(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_IMM, bit);
3331 found = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, req_char | bit);
3332 }
3333 else
3334 {
3335 found = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, req_char);
3336 foundoc = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, oc);
3337 }
3338 }
3339 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, IN_UCHARS(1));
3340 JUMPTO(SLJIT_JUMP, loop);
3341
3342 JUMPHERE(found);
3343 if (foundoc)
3344 JUMPHERE(foundoc);
3345 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->req_char_ptr, TMP1, 0);
3346 JUMPHERE(alreadyfound);
3347 JUMPHERE(toolong);
3348 return notfound;
3349 }
3350
3351 static void do_revertframes(compiler_common *common)
3352 {
3353 DEFINE_COMPILER;
3354 struct sljit_jump *jump;
3355 struct sljit_label *mainloop;
3356
3357 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3358 OP1(SLJIT_MOV, TMP1, 0, STACK_TOP, 0);
3359 GET_LOCAL_BASE(TMP3, 0, 0);
3360
3361 /* Drop frames until we reach STACK_TOP. */
3362 mainloop = LABEL();
3363 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), 0);
3364 OP2(SLJIT_SUB | SLJIT_SET_S, SLJIT_UNUSED, 0, TMP2, 0, SLJIT_IMM, 0);
3365 jump = JUMP(SLJIT_C_SIG_LESS_EQUAL);
3366
3367 OP2(SLJIT_ADD, TMP2, 0, TMP2, 0, TMP3, 0);
3368 OP1(SLJIT_MOV, SLJIT_MEM1(TMP2), 0, SLJIT_MEM1(TMP1), sizeof(sljit_sw));
3369 OP1(SLJIT_MOV, SLJIT_MEM1(TMP2), sizeof(sljit_sw), SLJIT_MEM1(TMP1), 2 * sizeof(sljit_sw));
3370 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 3 * sizeof(sljit_sw));
3371 JUMPTO(SLJIT_JUMP, mainloop);
3372
3373 JUMPHERE(jump);
3374 jump = JUMP(SLJIT_C_SIG_LESS);
3375 /* End of dropping frames. */
3376 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3377
3378 JUMPHERE(jump);
3379 OP1(SLJIT_NEG, TMP2, 0, TMP2, 0);
3380 OP2(SLJIT_ADD, TMP2, 0, TMP2, 0, TMP3, 0);
3381 OP1(SLJIT_MOV, SLJIT_MEM1(TMP2), 0, SLJIT_MEM1(TMP1), sizeof(sljit_sw));
3382 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 2 * sizeof(sljit_sw));
3383 JUMPTO(SLJIT_JUMP, mainloop);
3384 }
3385
3386 static void check_wordboundary(compiler_common *common)
3387 {
3388 DEFINE_COMPILER;
3389 struct sljit_jump *skipread;
3390 jump_list *skipread_list = NULL;
3391 #if !(defined COMPILE_PCRE8) || defined SUPPORT_UTF
3392 struct sljit_jump *jump;
3393 #endif
3394
3395 SLJIT_COMPILE_ASSERT(ctype_word == 0x10, ctype_word_must_be_16);
3396
3397 sljit_emit_fast_enter(compiler, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
3398 /* Get type of the previous char, and put it to LOCALS1. */
3399 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
3400 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
3401 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, SLJIT_IMM, 0);
3402 skipread = CMP(SLJIT_C_LESS_EQUAL, STR_PTR, 0, TMP1, 0);
3403 skip_char_back(common);
3404 check_start_used_ptr(common);
3405 read_char(common);
3406
3407 /* Testing char type. */
3408 #ifdef SUPPORT_UCP
3409 if (common->use_ucp)
3410 {
3411 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 1);
3412 jump = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_UNDERSCORE);
3413 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
3414 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ucp_Ll);
3415 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ucp_Lu - ucp_Ll);
3416 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_LESS_EQUAL);
3417 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ucp_Nd - ucp_Ll);
3418 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ucp_No - ucp_Nd);
3419 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_LESS_EQUAL);
3420 JUMPHERE(jump);
3421 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, TMP2, 0);
3422 }
3423 else
3424 #endif
3425 {
3426 #ifndef COMPILE_PCRE8
3427 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3428 #elif defined SUPPORT_UTF
3429 /* Here LOCALS1 has already been zeroed. */
3430 jump = NULL;
3431 if (common->utf)
3432 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3433 #endif /* COMPILE_PCRE8 */
3434 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), common->ctypes);
3435 OP2(SLJIT_LSHR, TMP1, 0, TMP1, 0, SLJIT_IMM, 4 /* ctype_word */);
3436 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
3437 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, TMP1, 0);
3438 #ifndef COMPILE_PCRE8
3439 JUMPHERE(jump);
3440 #elif defined SUPPORT_UTF
3441 if (jump != NULL)
3442 JUMPHERE(jump);
3443 #endif /* COMPILE_PCRE8 */
3444 }
3445 JUMPHERE(skipread);
3446
3447 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 0);
3448 check_str_end(common, &skipread_list);
3449 peek_char(common);
3450
3451 /* Testing char type. This is a code duplication. */
3452 #ifdef SUPPORT_UCP
3453 if (common->use_ucp)
3454 {
3455 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 1);
3456 jump = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_UNDERSCORE);
3457 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
3458 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ucp_Ll);
3459 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ucp_Lu - ucp_Ll);
3460 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_LESS_EQUAL);
3461 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ucp_Nd - ucp_Ll);
3462 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ucp_No - ucp_Nd);
3463 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_LESS_EQUAL);
3464 JUMPHERE(jump);
3465 }
3466 else
3467 #endif
3468 {
3469 #ifndef COMPILE_PCRE8
3470 /* TMP2 may be destroyed by peek_char. */
3471 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 0);
3472 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3473 #elif defined SUPPORT_UTF
3474 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 0);
3475 jump = NULL;
3476 if (common->utf)
3477 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3478 #endif
3479 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP1), common->ctypes);
3480 OP2(SLJIT_LSHR, TMP2, 0, TMP2, 0, SLJIT_IMM, 4 /* ctype_word */);
3481 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 1);
3482 #ifndef COMPILE_PCRE8
3483 JUMPHERE(jump);
3484 #elif defined SUPPORT_UTF
3485 if (jump != NULL)
3486 JUMPHERE(jump);
3487 #endif /* COMPILE_PCRE8 */
3488 }
3489 set_jumps(skipread_list, LABEL());
3490
3491 OP2(SLJIT_XOR | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1);
3492 sljit_emit_fast_return(compiler, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
3493 }
3494
3495 /*
3496 range format:
3497
3498 ranges[0] = length of the range (max MAX_RANGE_SIZE, -1 means invalid range).
3499 ranges[1] = first bit (0 or 1)
3500 ranges[2-length] = position of the bit change (when the current bit is not equal to the previous)
3501 */
3502
3503 static BOOL check_ranges(compiler_common *common, int *ranges, jump_list **backtracks, BOOL readch)
3504 {
3505 DEFINE_COMPILER;
3506 struct sljit_jump *jump;
3507
3508 if (ranges[0] < 0)
3509 return FALSE;
3510
3511 switch(ranges[0])
3512 {
3513 case 1:
3514 if (readch)
3515 read_char(common);
3516 add_jump(compiler, backtracks, CMP(ranges[1] == 0 ? SLJIT_C_LESS : SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, ranges[2]));
3517 return TRUE;
3518
3519 case 2:
3520 if (readch)
3521 read_char(common);
3522 if (ranges[2] + 1 != ranges[3])
3523 {
3524 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ranges[2]);
3525 add_jump(compiler, backtracks, CMP(ranges[1] != 0 ? SLJIT_C_LESS : SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, ranges[3] - ranges[2]));
3526 }
3527 else
3528 add_jump(compiler, backtracks, CMP(ranges[1] != 0 ? SLJIT_C_EQUAL : SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, ranges[2]));
3529 return TRUE;
3530
3531 case 3:
3532 if (readch)
3533 read_char(common);
3534 if (ranges[1] != 0)
3535 {
3536 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, ranges[4]));
3537 if (ranges[2] + 1 != ranges[3])
3538 {
3539 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ranges[2]);
3540 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, ranges[3] - ranges[2]));
3541 }
3542 else
3543 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, ranges[2]));
3544 }
3545 else
3546 {
3547 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, ranges[2]));
3548 if (ranges[3] + 1 != ranges[4])
3549 {
3550 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ranges[3]);
3551 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, ranges[4] - ranges[3]));
3552 }
3553 else
3554 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, ranges[3]));
3555 }
3556 return TRUE;
3557
3558 case 4:
3559 if (ranges[2] + 1 == ranges[3] && ranges[4] + 1 == ranges[5])
3560 {
3561 if (readch)
3562 read_char(common);
3563 if (ranges[1] != 0)
3564 {
3565 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, ranges[2]));
3566 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, ranges[4]));
3567 }
3568 else
3569 {
3570 jump = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, ranges[2]);
3571 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, ranges[4]));
3572 JUMPHERE(jump);
3573 }
3574 return TRUE;
3575 }
3576 if ((ranges[3] - ranges[2]) == (ranges[5] - ranges[4]) && is_powerof2(ranges[4] - ranges[2]))
3577 {
3578 if (readch)
3579 read_char(common);
3580 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, ranges[4] - ranges[2]);
3581 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ranges[4]);
3582 add_jump(compiler, backtracks, CMP(ranges[1] != 0 ? SLJIT_C_LESS : SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, ranges[5] - ranges[4]));
3583 return TRUE;
3584 }
3585 return FALSE;
3586
3587 default:
3588 return FALSE;
3589 }
3590 }
3591
3592 static void get_ctype_ranges(compiler_common *common, int flag, int *ranges)
3593 {
3594 int i, bit, length;
3595 const pcre_uint8 *ctypes = (const pcre_uint8*)common->ctypes;
3596
3597 bit = ctypes[0] & flag;
3598 ranges[0] = -1;
3599 ranges[1] = bit != 0 ? 1 : 0;
3600 length = 0;
3601
3602 for (i = 1; i < 256; i++)
3603 if ((ctypes[i] & flag) != bit)
3604 {
3605 if (length >= MAX_RANGE_SIZE)
3606 return;
3607 ranges[2 + length] = i;
3608 length++;
3609 bit ^= flag;
3610 }
3611
3612 if (bit != 0)
3613 {
3614 if (length >= MAX_RANGE_SIZE)
3615 return;
3616 ranges[2 + length] = 256;
3617 length++;
3618 }
3619 ranges[0] = length;
3620 }
3621
3622 static BOOL check_class_ranges(compiler_common *common, const pcre_uint8 *bits, BOOL nclass, BOOL invert, jump_list **backtracks)
3623 {
3624 int ranges[2 + MAX_RANGE_SIZE];
3625 pcre_uint8 bit, cbit, all;
3626 int i, byte, length = 0;
3627
3628 bit = bits[0] & 0x1;
3629 ranges[1] = !invert ? bit : (bit ^ 0x1);
3630 /* All bits will be zero or one (since bit is zero or one). */
3631 all = -bit;
3632
3633 for (i = 0; i < 256; )
3634 {
3635 byte = i >> 3;
3636 if ((i & 0x7) == 0 && bits[byte] == all)
3637 i += 8;
3638 else
3639 {
3640 cbit = (bits[byte] >> (i & 0x7)) & 0x1;
3641 if (cbit != bit)
3642 {
3643 if (length >= MAX_RANGE_SIZE)
3644 return FALSE;
3645 ranges[2 + length] = i;
3646 length++;
3647 bit = cbit;
3648 all = -cbit;
3649 }
3650 i++;
3651 }
3652 }
3653
3654 if (((bit == 0) && nclass) || ((bit == 1) && !nclass))
3655 {
3656 if (length >= MAX_RANGE_SIZE)
3657 return FALSE;
3658 ranges[2 + length] = 256;
3659 length++;
3660 }
3661 ranges[0] = length;
3662
3663 return check_ranges(common, ranges, backtracks, FALSE);
3664 }
3665
3666 static void check_anynewline(compiler_common *common)
3667 {
3668 /* Check whether TMP1 contains a newline character. TMP2 destroyed. */
3669 DEFINE_COMPILER;
3670
3671 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3672
3673 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x0a);
3674 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x0d - 0x0a);
3675 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_LESS_EQUAL);
3676 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x85 - 0x0a);
3677 #if defined SUPPORT_UTF || defined COMPILE_PCRE16 || defined COMPILE_PCRE32
3678 #ifdef COMPILE_PCRE8
3679 if (common->utf)
3680 {
3681 #endif
3682 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3683 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x1);
3684 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x2029 - 0x0a);
3685 #ifdef COMPILE_PCRE8
3686 }
3687 #endif
3688 #endif /* SUPPORT_UTF || COMPILE_PCRE16 || COMPILE_PCRE32 */
3689 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3690 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3691 }
3692
3693 static void check_hspace(compiler_common *common)
3694 {
3695 /* Check whether TMP1 contains a newline character. TMP2 destroyed. */
3696 DEFINE_COMPILER;
3697
3698 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3699
3700 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x09);
3701 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
3702 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x20);
3703 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3704 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xa0);
3705 #if defined SUPPORT_UTF || defined COMPILE_PCRE16 || defined COMPILE_PCRE32
3706 #ifdef COMPILE_PCRE8
3707 if (common->utf)
3708 {
3709 #endif
3710 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3711 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x1680);
3712 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3713 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x180e);
3714 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3715 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x2000);
3716 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x200A - 0x2000);
3717 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_LESS_EQUAL);
3718 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x202f - 0x2000);
3719 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3720 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x205f - 0x2000);
3721 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3722 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x3000 - 0x2000);
3723 #ifdef COMPILE_PCRE8
3724 }
3725 #endif
3726 #endif /* SUPPORT_UTF || COMPILE_PCRE16 || COMPILE_PCRE32 */
3727 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3728
3729 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3730 }
3731
3732 static void check_vspace(compiler_common *common)
3733 {
3734 /* Check whether TMP1 contains a newline character. TMP2 destroyed. */
3735 DEFINE_COMPILER;
3736
3737 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3738
3739 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x0a);
3740 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x0d - 0x0a);
3741 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_LESS_EQUAL);
3742 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x85 - 0x0a);
3743 #if defined SUPPORT_UTF || defined COMPILE_PCRE16 || defined COMPILE_PCRE32
3744 #ifdef COMPILE_PCRE8
3745 if (common->utf)
3746 {
3747 #endif
3748 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3749 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x1);
3750 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x2029 - 0x0a);
3751 #ifdef COMPILE_PCRE8
3752 }
3753 #endif
3754 #endif /* SUPPORT_UTF || COMPILE_PCRE16 || COMPILE_PCRE32 */
3755 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
3756
3757 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3758 }
3759
3760 #define CHAR1 STR_END
3761 #define CHAR2 STACK_TOP
3762
3763 static void do_casefulcmp(compiler_common *common)
3764 {
3765 DEFINE_COMPILER;
3766 struct sljit_jump *jump;
3767 struct sljit_label *label;
3768
3769 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3770 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
3771 OP1(SLJIT_MOV, TMP3, 0, CHAR1, 0);
3772 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, CHAR2, 0);
3773 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, IN_UCHARS(1));
3774 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3775
3776 label = LABEL();
3777 OP1(MOVU_UCHAR, CHAR1, 0, SLJIT_MEM1(TMP1), IN_UCHARS(1));
3778 OP1(MOVU_UCHAR, CHAR2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
3779 jump = CMP(SLJIT_C_NOT_EQUAL, CHAR1, 0, CHAR2, 0);
3780 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_IMM, IN_UCHARS(1));
3781 JUMPTO(SLJIT_C_NOT_ZERO, label);
3782
3783 JUMPHERE(jump);
3784 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3785 OP1(SLJIT_MOV, CHAR1, 0, TMP3, 0);
3786 OP1(SLJIT_MOV, CHAR2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
3787 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3788 }
3789
3790 #define LCC_TABLE STACK_LIMIT
3791
3792 static void do_caselesscmp(compiler_common *common)
3793 {
3794 DEFINE_COMPILER;
3795 struct sljit_jump *jump;
3796 struct sljit_label *label;
3797
3798 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3799 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
3800
3801 OP1(SLJIT_MOV, TMP3, 0, LCC_TABLE, 0);
3802 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, CHAR1, 0);
3803 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, CHAR2, 0);
3804 OP1(SLJIT_MOV, LCC_TABLE, 0, SLJIT_IMM, common->lcc);
3805 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, IN_UCHARS(1));
3806 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3807
3808 label = LABEL();
3809 OP1(MOVU_UCHAR, CHAR1, 0, SLJIT_MEM1(TMP1), IN_UCHARS(1));
3810 OP1(MOVU_UCHAR, CHAR2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
3811 #ifndef COMPILE_PCRE8
3812 jump = CMP(SLJIT_C_GREATER, CHAR1, 0, SLJIT_IMM, 255);
3813 #endif
3814 OP1(SLJIT_MOV_UB, CHAR1, 0, SLJIT_MEM2(LCC_TABLE, CHAR1), 0);
3815 #ifndef COMPILE_PCRE8
3816 JUMPHERE(jump);
3817 jump = CMP(SLJIT_C_GREATER, CHAR2, 0, SLJIT_IMM, 255);
3818 #endif
3819 OP1(SLJIT_MOV_UB, CHAR2, 0, SLJIT_MEM2(LCC_TABLE, CHAR2), 0);
3820 #ifndef COMPILE_PCRE8
3821 JUMPHERE(jump);
3822 #endif
3823 jump = CMP(SLJIT_C_NOT_EQUAL, CHAR1, 0, CHAR2, 0);
3824 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_IMM, IN_UCHARS(1));
3825 JUMPTO(SLJIT_C_NOT_ZERO, label);
3826
3827 JUMPHERE(jump);
3828 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3829 OP1(SLJIT_MOV, LCC_TABLE, 0, TMP3, 0);
3830 OP1(SLJIT_MOV, CHAR1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
3831 OP1(SLJIT_MOV, CHAR2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1);
3832 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3833 }
3834
3835 #undef LCC_TABLE
3836 #undef CHAR1
3837 #undef CHAR2
3838
3839 #if defined SUPPORT_UTF && defined SUPPORT_UCP
3840
3841 static const pcre_uchar * SLJIT_CALL do_utf_caselesscmp(pcre_uchar *src1, jit_arguments *args, pcre_uchar *end1)
3842 {
3843 /* This function would be ineffective to do in JIT level. */
3844 pcre_uint32 c1, c2;
3845 const pcre_uchar *src2 = args->uchar_ptr;
3846 const pcre_uchar *end2 = args->end;
3847 const ucd_record *ur;
3848 const pcre_uint32 *pp;
3849
3850 while (src1 < end1)
3851 {
3852 if (src2 >= end2)
3853 return (pcre_uchar*)1;
3854 GETCHARINC(c1, src1);
3855 GETCHARINC(c2, src2);
3856 ur = GET_UCD(c2);
3857 if (c1 != c2 && c1 != c2 + ur->other_case)
3858 {
3859 pp = PRIV(ucd_caseless_sets) + ur->caseset;
3860 for (;;)
3861 {
3862 if (c1 < *pp) return NULL;
3863 if (c1 == *pp++) break;
3864 }
3865 }
3866 }
3867 return src2;
3868 }
3869
3870 #endif /* SUPPORT_UTF && SUPPORT_UCP */
3871
3872 static pcre_uchar *byte_sequence_compare(compiler_common *common, BOOL caseless, pcre_uchar *cc,
3873 compare_context* context, jump_list **backtracks)
3874 {
3875 DEFINE_COMPILER;
3876 unsigned int othercasebit = 0;
3877 pcre_uchar *othercasechar = NULL;
3878 #ifdef SUPPORT_UTF
3879 int utflength;
3880 #endif
3881
3882 if (caseless && char_has_othercase(common, cc))
3883 {
3884 othercasebit = char_get_othercase_bit(common, cc);
3885 SLJIT_ASSERT(othercasebit);
3886 /* Extracting bit difference info. */
3887 #if defined COMPILE_PCRE8
3888 othercasechar = cc + (othercasebit >> 8);
3889 othercasebit &= 0xff;
3890 #elif defined COMPILE_PCRE16 || defined COMPILE_PCRE32
3891 /* Note that this code only handles characters in the BMP. If there
3892 ever are characters outside the BMP whose othercase differs in only one
3893 bit from itself (there currently are none), this code will need to be
3894 revised for COMPILE_PCRE32. */
3895 othercasechar = cc + (othercasebit >> 9);
3896 if ((othercasebit & 0x100) != 0)
3897 othercasebit = (othercasebit & 0xff) << 8;
3898 else
3899 othercasebit &= 0xff;
3900 #endif /* COMPILE_PCRE[8|16|32] */
3901 }
3902
3903 if (context->sourcereg == -1)
3904 {
3905 #if defined COMPILE_PCRE8
3906 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
3907 if (context->length >= 4)
3908 OP1(SLJIT_MOV_SI, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3909 else if (context->length >= 2)
3910 OP1(SLJIT_MOV_UH, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3911 else
3912 #endif
3913 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3914 #elif defined COMPILE_PCRE16
3915 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
3916 if (context->length >= 4)
3917 OP1(SLJIT_MOV_SI, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3918 else
3919 #endif
3920 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3921 #elif defined COMPILE_PCRE32
3922 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3923 #endif /* COMPILE_PCRE[8|16|32] */
3924 context->sourcereg = TMP2;
3925 }
3926
3927 #ifdef SUPPORT_UTF
3928 utflength = 1;
3929 if (common->utf && HAS_EXTRALEN(*cc))
3930 utflength += GET_EXTRALEN(*cc);
3931
3932 do
3933 {
3934 #endif
3935
3936 context->length -= IN_UCHARS(1);
3937 #if (defined SLJIT_UNALIGNED && SLJIT_UNALIGNED) && (defined COMPILE_PCRE8 || defined COMPILE_PCRE16)
3938
3939 /* Unaligned read is supported. */
3940 if (othercasebit != 0 && othercasechar == cc)
3941 {
3942 context->c.asuchars[context->ucharptr] = *cc | othercasebit;
3943 context->oc.asuchars[context->ucharptr] = othercasebit;
3944 }
3945 else
3946 {
3947 context->c.asuchars[context->ucharptr] = *cc;
3948 context->oc.asuchars[context->ucharptr] = 0;
3949 }
3950 context->ucharptr++;
3951
3952 #if defined COMPILE_PCRE8
3953 if (context->ucharptr >= 4 || context->length == 0 || (context->ucharptr == 2 && context->length == 1))
3954 #else
3955 if (context->ucharptr >= 2 || context->length == 0)
3956 #endif
3957 {
3958 if (context->length >= 4)
3959 OP1(SLJIT_MOV_SI, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
3960 else if (context->length >= 2)
3961 OP1(SLJIT_MOV_UH, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
3962 #if defined COMPILE_PCRE8
3963 else if (context->length >= 1)
3964 OP1(SLJIT_MOV_UB, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
3965 #endif /* COMPILE_PCRE8 */
3966 context->sourcereg = context->sourcereg == TMP1 ? TMP2 : TMP1;
3967
3968 switch(context->ucharptr)
3969 {
3970 case 4 / sizeof(pcre_uchar):
3971 if (context->oc.asint != 0)
3972 OP2(SLJIT_OR, context->sourcereg, 0, context->sourcereg, 0, SLJIT_IMM, context->oc.asint);
3973 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, context->c.asint | context->oc.asint));
3974 break;
3975
3976 case 2 / sizeof(pcre_uchar):
3977 if (context->oc.asushort != 0)
3978 OP2(SLJIT_OR, context->sourcereg, 0, context->sourcereg, 0, SLJIT_IMM, context->oc.asushort);
3979 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, context->c.asushort | context->oc.asushort));
3980 break;
3981
3982 #ifdef COMPILE_PCRE8
3983 case 1:
3984 if (context->oc.asbyte != 0)
3985 OP2(SLJIT_OR, context->sourcereg, 0, context->sourcereg, 0, SLJIT_IMM, context->oc.asbyte);
3986 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, context->c.asbyte | context->oc.asbyte));
3987 break;
3988 #endif
3989
3990 default:
3991 SLJIT_ASSERT_STOP();
3992 break;
3993 }
3994 context->ucharptr = 0;
3995 }
3996
3997 #else
3998
3999 /* Unaligned read is unsupported or in 32 bit mode. */
4000 if (context->length >= 1)
4001 OP1(MOV_UCHAR, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
4002
4003 context->sourcereg = context->sourcereg == TMP1 ? TMP2 : TMP1;
4004
4005 if (othercasebit != 0 && othercasechar == cc)
4006 {
4007 OP2(SLJIT_OR, context->sourcereg, 0, context->sourcereg, 0, SLJIT_IMM, othercasebit);
4008 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, *cc | othercasebit));
4009 }
4010 else
4011 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, *cc));
4012
4013 #endif
4014
4015 cc++;
4016 #ifdef SUPPORT_UTF
4017 utflength--;
4018 }
4019 while (utflength > 0);
4020 #endif
4021
4022 return cc;
4023 }
4024
4025 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
4026
4027 #define SET_TYPE_OFFSET(value) \
4028 if ((value) != typeoffset) \
4029 { \
4030 if ((value) > typeoffset) \
4031 OP2(SLJIT_SUB, typereg, 0, typereg, 0, SLJIT_IMM, (value) - typeoffset); \
4032 else \
4033 OP2(SLJIT_ADD, typereg, 0, typereg, 0, SLJIT_IMM, typeoffset - (value)); \
4034 } \
4035 typeoffset = (value);
4036
4037 #define SET_CHAR_OFFSET(value) \
4038 if ((value) != charoffset) \
4039 { \
4040 if ((value) > charoffset) \
4041 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, (value) - charoffset); \
4042 else \
4043 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, charoffset - (value)); \
4044 } \
4045 charoffset = (value);
4046
4047 static void compile_xclass_matchingpath(compiler_common *common, pcre_uchar *cc, jump_list **backtracks)
4048 {
4049 DEFINE_COMPILER;
4050 jump_list *found = NULL;
4051 jump_list **list = (cc[0] & XCL_NOT) == 0 ? &found : backtracks;
4052 pcre_int32 c, charoffset;
4053 struct sljit_jump *jump = NULL;
4054 pcre_uchar *ccbegin;
4055 int compares, invertcmp, numberofcmps;
4056
4057 #ifdef SUPPORT_UCP
4058 BOOL needstype = FALSE, needsscript = FALSE, needschar = FALSE;
4059 BOOL charsaved = FALSE;
4060 int typereg = TMP1, scriptreg = TMP1;
4061 const pcre_uint32 *other_cases;
4062 pcre_int32 typeoffset;
4063 #endif
4064
4065 /* Although SUPPORT_UTF must be defined, we are
4066 not necessary in utf mode even in 8 bit mode. */
4067 detect_partial_match(common, backtracks);
4068 read_char(common);
4069
4070 cc++;
4071 if ((cc[-1] & XCL_HASPROP) == 0)
4072 {
4073 if ((cc[-1] & XCL_MAP) != 0)
4074 {
4075 OP1(SLJIT_MOV, TMP3, 0, TMP1, 0);
4076 #ifdef SUPPORT_UCP
4077 charsaved = TRUE;
4078 #endif
4079 if (!check_class_ranges(common, (const pcre_uint8 *)cc, TRUE, FALSE, backtracks))
4080 {
4081 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
4082
4083 OP2(SLJIT_AND, TMP2, 0, TMP1, 0, SLJIT_IMM, 0x7);
4084 OP2(SLJIT_LSHR, TMP1, 0, TMP1, 0, SLJIT_IMM, 3);
4085 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_sw)cc);
4086 OP2(SLJIT_SHL, TMP2, 0, SLJIT_IMM, 1, TMP2, 0);
4087 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, TMP2, 0);
4088 add_jump(compiler, &found, JUMP(SLJIT_C_NOT_ZERO));
4089 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
4090
4091 JUMPHERE(jump);
4092 }
4093 else
4094 add_jump(compiler, &found, CMP(SLJIT_C_LESS_EQUAL, TMP3, 0, SLJIT_IMM, 0xff));
4095
4096 OP1(SLJIT_MOV, TMP1, 0, TMP3, 0);
4097 cc += 32 / sizeof(pcre_uchar);
4098 }
4099 else
4100 add_jump(compiler, (cc[-1] & XCL_NOT) == 0 ? backtracks : &found, CMP(SLJIT_C_LESS_EQUAL, TMP1, 0, SLJIT_IMM, 0xff));
4101 }
4102 else if ((cc[-1] & XCL_MAP) != 0)
4103 {
4104 OP1(SLJIT_MOV, TMP3, 0, TMP1, 0);
4105 #ifdef SUPPORT_UCP
4106 charsaved = TRUE;
4107 #endif
4108 if (!check_class_ranges(common, (const pcre_uint8 *)cc, FALSE, TRUE, list))
4109 {
4110 #ifdef COMPILE_PCRE8
4111 SLJIT_ASSERT(common->utf);
4112 #endif
4113 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
4114
4115 OP2(SLJIT_AND, TMP2, 0, TMP1, 0, SLJIT_IMM, 0x7);
4116 OP2(SLJIT_LSHR, TMP1, 0, TMP1, 0, SLJIT_IMM, 3);
4117 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_sw)cc);
4118 OP2(SLJIT_SHL, TMP2, 0, SLJIT_IMM, 1, TMP2, 0);
4119 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, TMP2, 0);
4120 add_jump(compiler, list, JUMP(SLJIT_C_NOT_ZERO));
4121
4122 JUMPHERE(jump);
4123 }
4124
4125 OP1(SLJIT_MOV, TMP1, 0, TMP3, 0);
4126 cc += 32 / sizeof(pcre_uchar);
4127 }
4128
4129 /* Scanning the necessary info. */
4130 ccbegin = cc;
4131 compares = 0;
4132 while (*cc != XCL_END)
4133 {
4134 compares++;
4135 if (*cc == XCL_SINGLE)
4136 {
4137 cc += 2;
4138 #ifdef SUPPORT_UTF
4139 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
4140 #endif
4141 #ifdef SUPPORT_UCP
4142 needschar = TRUE;
4143 #endif
4144 }
4145 else if (*cc == XCL_RANGE)
4146 {
4147 cc += 2;
4148 #ifdef SUPPORT_UTF
4149 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
4150 #endif
4151 cc++;
4152 #ifdef SUPPORT_UTF
4153 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
4154 #endif
4155 #ifdef SUPPORT_UCP
4156 needschar = TRUE;
4157 #endif
4158 }
4159 #ifdef SUPPORT_UCP
4160 else
4161 {
4162 SLJIT_ASSERT(*cc == XCL_PROP || *cc == XCL_NOTPROP);
4163 cc++;
4164 switch(*cc)
4165 {
4166 case PT_ANY:
4167 break;
4168
4169 case PT_LAMP:
4170 case PT_GC:
4171 case PT_PC:
4172 case PT_ALNUM:
4173 needstype = TRUE;
4174 break;
4175
4176 case PT_SC:
4177 needsscript = TRUE;
4178 break;
4179
4180 case PT_SPACE:
4181 case PT_PXSPACE:
4182 case PT_WORD:
4183 case PT_PXGRAPH:
4184 case PT_PXPRINT:
4185 case PT_PXPUNCT:
4186 needstype = TRUE;
4187 needschar = TRUE;
4188 break;
4189
4190 case PT_CLIST:
4191 case PT_UCNC:
4192 needschar = TRUE;
4193 break;
4194
4195 default:
4196 SLJIT_ASSERT_STOP();
4197 break;
4198 }
4199 cc += 2;
4200 }
4201 #endif
4202 }
4203
4204 #ifdef SUPPORT_UCP
4205 /* Simple register allocation. TMP1 is preferred if possible. */
4206 if (needstype || needsscript)
4207 {
4208 if (needschar && !charsaved)
4209 OP1(SLJIT_MOV, TMP3, 0, TMP1, 0);
4210 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
4211 if (needschar)
4212 {
4213 if (needstype)
4214 {
4215 OP1(SLJIT_MOV, RETURN_ADDR, 0, TMP1, 0);
4216 typereg = RETURN_ADDR;
4217 }
4218
4219 if (needsscript)
4220 scriptreg = TMP3;
4221 OP1(SLJIT_MOV, TMP1, 0, TMP3, 0);
4222 }
4223 else if (needstype && needsscript)
4224 scriptreg = TMP3;
4225 /* In all other cases only one of them was specified, and that can goes to TMP1. */
4226
4227 if (needsscript)
4228 {
4229 if (scriptreg == TMP1)
4230 {
4231 OP1(SLJIT_MOV, scriptreg, 0, SLJIT_IMM, (sljit_sw)PRIV(ucd_records) + SLJIT_OFFSETOF(ucd_record, script));
4232 OP1(SLJIT_MOV_UB, scriptreg, 0, SLJIT_MEM2(scriptreg, TMP2), 3);
4233 }
4234 else
4235 {
4236 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, 3);
4237 OP2(SLJIT_ADD, TMP2, 0, TMP2, 0, SLJIT_IMM, (sljit_sw)PRIV(ucd_records) + SLJIT_OFFSETOF(ucd_record, script));
4238 OP1(SLJIT_MOV_UB, scriptreg, 0, SLJIT_MEM1(TMP2), 0);
4239 }
4240 }
4241 }
4242 #endif
4243
4244 /* Generating code. */
4245 cc = ccbegin;
4246 charoffset = 0;
4247 numberofcmps = 0;
4248 #ifdef SUPPORT_UCP
4249 typeoffset = 0;
4250 #endif
4251
4252 while (*cc != XCL_END)
4253 {
4254 compares--;
4255 invertcmp = (compares == 0 && list != backtracks);
4256 jump = NULL;
4257
4258 if (*cc == XCL_SINGLE)
4259 {
4260 cc ++;
4261 #ifdef SUPPORT_UTF
4262 if (common->utf)
4263 {
4264 GETCHARINC(c, cc);
4265 }
4266 else
4267 #endif
4268 c = *cc++;
4269
4270 if (numberofcmps < 3 && (*cc == XCL_SINGLE || *cc == XCL_RANGE))
4271 {
4272 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c - charoffset);
4273 OP_FLAGS(numberofcmps == 0 ? SLJIT_MOV : SLJIT_OR, TMP2, 0, numberofcmps == 0 ? SLJIT_UNUSED : TMP2, 0, SLJIT_C_EQUAL);
4274 numberofcmps++;
4275 }
4276 else if (numberofcmps > 0)
4277 {
4278 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c - charoffset);
4279 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4280 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
4281 numberofcmps = 0;
4282 }
4283 else
4284 {
4285 jump = CMP(SLJIT_C_EQUAL ^ invertcmp, TMP1, 0, SLJIT_IMM, c - charoffset);
4286 numberofcmps = 0;
4287 }
4288 }
4289 else if (*cc == XCL_RANGE)
4290 {
4291 cc ++;
4292 #ifdef SUPPORT_UTF
4293 if (common->utf)
4294 {
4295 GETCHARINC(c, cc);
4296 }
4297 else
4298 #endif
4299 c = *cc++;
4300 SET_CHAR_OFFSET(c);
4301 #ifdef SUPPORT_UTF
4302 if (common->utf)
4303 {
4304 GETCHARINC(c, cc);
4305 }
4306 else
4307 #endif
4308 c = *cc++;
4309 if (numberofcmps < 3 && (*cc == XCL_SINGLE || *cc == XCL_RANGE))
4310 {
4311 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c - charoffset);
4312 OP_FLAGS(numberofcmps == 0 ? SLJIT_MOV : SLJIT_OR, TMP2, 0, numberofcmps == 0 ? SLJIT_UNUSED : TMP2, 0, SLJIT_C_LESS_EQUAL);
4313 numberofcmps++;
4314 }
4315 else if (numberofcmps > 0)
4316 {
4317 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c - charoffset);
4318 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_LESS_EQUAL);
4319 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
4320 numberofcmps = 0;
4321 }
4322 else
4323 {
4324 jump = CMP(SLJIT_C_LESS_EQUAL ^ invertcmp, TMP1, 0, SLJIT_IMM, c - charoffset);
4325 numberofcmps = 0;
4326 }
4327 }
4328 #ifdef SUPPORT_UCP
4329 else
4330 {
4331 if (*cc == XCL_NOTPROP)
4332 invertcmp ^= 0x1;
4333 cc++;
4334 switch(*cc)
4335 {
4336 case PT_ANY:
4337 if (list != backtracks)
4338 {
4339 if ((cc[-1] == XCL_NOTPROP && compares > 0) || (cc[-1] == XCL_PROP && compares == 0))
4340 continue;
4341 }
4342 else if (cc[-1] == XCL_NOTPROP)
4343 continue;
4344 jump = JUMP(SLJIT_JUMP);
4345 break;
4346
4347 case PT_LAMP:
4348 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Lu - typeoffset);
4349 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
4350 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Ll - typeoffset);
4351 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4352 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Lt - typeoffset);
4353 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4354 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
4355 break;
4356
4357 case PT_GC:
4358 c = PRIV(ucp_typerange)[(int)cc[1] * 2];
4359 SET_TYPE_OFFSET(c);
4360 jump = CMP(SLJIT_C_LESS_EQUAL ^ invertcmp, typereg, 0, SLJIT_IMM, PRIV(ucp_typerange)[(int)cc[1] * 2 + 1] - c);
4361 break;
4362
4363 case PT_PC:
4364 jump = CMP(SLJIT_C_EQUAL ^ invertcmp, typereg, 0, SLJIT_IMM, (int)cc[1] - typeoffset);
4365 break;
4366
4367 case PT_SC:
4368 jump = CMP(SLJIT_C_EQUAL ^ invertcmp, scriptreg, 0, SLJIT_IMM, (int)cc[1]);
4369 break;
4370
4371 case PT_SPACE:
4372 case PT_PXSPACE:
4373 SET_CHAR_OFFSET(9);
4374 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xd - 0x9);
4375 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_LESS_EQUAL);
4376
4377 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x85 - 0x9);
4378 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4379
4380 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x180e - 0x9);
4381 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4382
4383 SET_TYPE_OFFSET(ucp_Zl);
4384 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Zs - ucp_Zl);
4385 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_LESS_EQUAL);
4386 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
4387 break;
4388
4389 case PT_WORD:
4390 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, CHAR_UNDERSCORE - charoffset);
4391 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
4392 /* Fall through. */
4393
4394 case PT_ALNUM:
4395 SET_TYPE_OFFSET(ucp_Ll);
4396 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Lu - ucp_Ll);
4397 OP_FLAGS((*cc == PT_ALNUM) ? SLJIT_MOV : SLJIT_OR, TMP2, 0, (*cc == PT_ALNUM) ? SLJIT_UNUSED : TMP2, 0, SLJIT_C_LESS_EQUAL);
4398 SET_TYPE_OFFSET(ucp_Nd);
4399 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_No - ucp_Nd);
4400 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_LESS_EQUAL);
4401 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
4402 break;
4403
4404 case PT_CLIST:
4405 other_cases = PRIV(ucd_caseless_sets) + cc[1];
4406
4407 /* At least three characters are required.
4408 Otherwise this case would be handled by the normal code path. */
4409 SLJIT_ASSERT(other_cases[0] != NOTACHAR && other_cases[1] != NOTACHAR && other_cases[2] != NOTACHAR);
4410 SLJIT_ASSERT(other_cases[0] < other_cases[1] && other_cases[1] < other_cases[2]);
4411
4412 /* Optimizing character pairs, if their difference is power of 2. */
4413 if (is_powerof2(other_cases[1] ^ other_cases[0]))
4414 {
4415 if (charoffset == 0)
4416 OP2(SLJIT_OR, TMP2, 0, TMP1, 0, SLJIT_IMM, other_cases[1] ^ other_cases[0]);
4417 else
4418 {
4419 OP2(SLJIT_ADD, TMP2, 0, TMP1, 0, SLJIT_IMM, (sljit_sw)charoffset);
4420 OP2(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_IMM, other_cases[1] ^ other_cases[0]);
4421 }
4422 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP2, 0, SLJIT_IMM, other_cases[1]);
4423 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
4424 other_cases += 2;
4425 }
4426 else if (is_powerof2(other_cases[2] ^ other_cases[1]))
4427 {
4428 if (charoffset == 0)
4429 OP2(SLJIT_OR, TMP2, 0, TMP1, 0, SLJIT_IMM, other_cases[2] ^ other_cases[1]);
4430 else
4431 {
4432 OP2(SLJIT_ADD, TMP2, 0, TMP1, 0, SLJIT_IMM, (sljit_sw)charoffset);
4433 OP2(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_IMM, other_cases[1] ^ other_cases[0]);
4434 }
4435 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP2, 0, SLJIT_IMM, other_cases[2]);
4436 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
4437
4438 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, other_cases[0] - charoffset);
4439 OP_FLAGS(SLJIT_OR | ((other_cases[3] == NOTACHAR) ? SLJIT_SET_E : 0), TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4440
4441 other_cases += 3;
4442 }
4443 else
4444 {
4445 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, *other_cases++ - charoffset);
4446 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
4447 }
4448
4449 while (*other_cases != NOTACHAR)
4450 {
4451 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, *other_cases++ - charoffset);
4452 OP_FLAGS(SLJIT_OR | ((*other_cases == NOTACHAR) ? SLJIT_SET_E : 0), TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4453 }
4454 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
4455 break;
4456
4457 case PT_UCNC:
4458 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, CHAR_DOLLAR_SIGN - charoffset);
4459 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
4460 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, CHAR_COMMERCIAL_AT - charoffset);
4461 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4462 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, CHAR_GRAVE_ACCENT - charoffset);
4463 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4464
4465 SET_CHAR_OFFSET(0xa0);
4466 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xd7ff - charoffset);
4467 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_LESS_EQUAL);
4468 SET_CHAR_OFFSET(0);
4469 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xe000 - 0);
4470 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_GREATER_EQUAL);
4471 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
4472 break;
4473
4474 case PT_PXGRAPH:
4475 /* C and Z groups are the farthest two groups. */
4476 SET_TYPE_OFFSET(ucp_Ll);
4477 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_So - ucp_Ll);
4478 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_GREATER);
4479
4480 jump = CMP(SLJIT_C_NOT_EQUAL, typereg, 0, SLJIT_IMM, ucp_Cf - ucp_Ll);
4481
4482 /* In case of ucp_Cf, we overwrite the result. */
4483 SET_CHAR_OFFSET(0x2066);
4484 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x2069 - 0x2066);
4485 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_LESS_EQUAL);
4486
4487 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x061c - 0x2066);
4488 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4489
4490 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x180e - 0x2066);
4491 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4492
4493 JUMPHERE(jump);
4494 jump = CMP(SLJIT_C_ZERO ^ invertcmp, TMP2, 0, SLJIT_IMM, 0);
4495 break;
4496
4497 case PT_PXPRINT:
4498 /* C and Z groups are the farthest two groups. */
4499 SET_TYPE_OFFSET(ucp_Ll);
4500 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_So - ucp_Ll);
4501 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_GREATER);
4502
4503 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Zs - ucp_Ll);
4504 OP_FLAGS(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_C_NOT_EQUAL);
4505
4506 jump = CMP(SLJIT_C_NOT_EQUAL, typereg, 0, SLJIT_IMM, ucp_Cf - ucp_Ll);
4507
4508 /* In case of ucp_Cf, we overwrite the result. */
4509 SET_CHAR_OFFSET(0x2066);
4510 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x2069 - 0x2066);
4511 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_LESS_EQUAL);
4512
4513 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x061c - 0x2066);
4514 OP_FLAGS(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4515
4516 JUMPHERE(jump);
4517 jump = CMP(SLJIT_C_ZERO ^ invertcmp, TMP2, 0, SLJIT_IMM, 0);
4518 break;
4519
4520 case PT_PXPUNCT:
4521 SET_TYPE_OFFSET(ucp_Sc);
4522 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_So - ucp_Sc);
4523 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_LESS_EQUAL);
4524
4525 SET_CHAR_OFFSET(0);
4526 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xff);
4527 OP_FLAGS(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_C_LESS_EQUAL);
4528
4529 SET_TYPE_OFFSET(ucp_Pc);
4530 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Ps - ucp_Pc);
4531 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_LESS_EQUAL);
4532 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
4533 break;
4534 }
4535 cc += 2;
4536 }
4537 #endif
4538
4539 if (jump != NULL)
4540 add_jump(compiler, compares > 0 ? list : backtracks, jump);
4541 }
4542
4543 if (found != NULL)
4544 set_jumps(found, LABEL());
4545 }
4546
4547 #undef SET_TYPE_OFFSET
4548 #undef SET_CHAR_OFFSET
4549
4550 #endif
4551
4552 static pcre_uchar *compile_char1_matchingpath(compiler_common *common, pcre_uchar type, pcre_uchar *cc, jump_list **backtracks)
4553 {
4554 DEFINE_COMPILER;
4555 int length;
4556 unsigned int c, oc, bit;
4557 compare_context context;
4558 struct sljit_jump *jump[4];
4559 jump_list *end_list;
4560 #ifdef SUPPORT_UTF
4561 struct sljit_label *label;
4562 #ifdef SUPPORT_UCP
4563 pcre_uchar propdata[5];
4564 #endif
4565 #endif
4566
4567 switch(type)
4568 {
4569 case OP_SOD:
4570 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
4571 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
4572 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, TMP1, 0));
4573 return cc;
4574
4575 case OP_SOM:
4576 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
4577 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, str));
4578 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, TMP1, 0));
4579 return cc;
4580
4581 case OP_NOT_WORD_BOUNDARY:
4582 case OP_WORD_BOUNDARY:
4583 add_jump(compiler, &common->wordboundary, JUMP(SLJIT_FAST_CALL));
4584 add_jump(compiler, backtracks, JUMP(type == OP_NOT_WORD_BOUNDARY ? SLJIT_C_NOT_ZERO : SLJIT_C_ZERO));
4585 return cc;
4586
4587 case OP_NOT_DIGIT:
4588 case OP_DIGIT:
4589 /* Digits are usually 0-9, so it is worth to optimize them. */
4590 if (common->digits[0] == -2)
4591 get_ctype_ranges(common, ctype_digit, common->digits);
4592 detect_partial_match(common, backtracks);
4593 /* Flip the starting bit in the negative case. */
4594 if (type == OP_NOT_DIGIT)
4595 common->digits[1] ^= 1;
4596 if (!check_ranges(common, common->digits, backtracks, TRUE))
4597 {
4598 read_char8_type(common);
4599 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ctype_digit);
4600 add_jump(compiler, backtracks, JUMP(type == OP_DIGIT ? SLJIT_C_ZERO : SLJIT_C_NOT_ZERO));
4601 }
4602 if (type == OP_NOT_DIGIT)
4603 common->digits[1] ^= 1;
4604 return cc;
4605
4606 case OP_NOT_WHITESPACE:
4607 case OP_WHITESPACE:
4608 detect_partial_match(common, backtracks);
4609 read_char8_type(common);
4610 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ctype_space);
4611 add_jump(compiler, backtracks, JUMP(type == OP_WHITESPACE ? SLJIT_C_ZERO : SLJIT_C_NOT_ZERO));
4612 return cc;
4613
4614 case OP_NOT_WORDCHAR:
4615 case OP_WORDCHAR:
4616 detect_partial_match(common, backtracks);
4617 read_char8_type(common);
4618 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ctype_word);
4619 add_jump(compiler, backtracks, JUMP(type == OP_WORDCHAR ? SLJIT_C_ZERO : SLJIT_C_NOT_ZERO));
4620 return cc;
4621
4622 case OP_ANY:
4623 detect_partial_match(common, backtracks);
4624 read_char(common);
4625 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
4626 {
4627 jump[0] = CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff);
4628 end_list = NULL;
4629 if (common->mode != JIT_PARTIAL_HARD_COMPILE)
4630 add_jump(compiler, &end_list, CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0));
4631 else
4632 check_str_end(common, &end_list);
4633
4634 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
4635 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, common->newline & 0xff));
4636 set_jumps(end_list, LABEL());
4637 JUMPHERE(jump[0]);
4638 }
4639 else
4640 check_newlinechar(common, common->nltype, backtracks, TRUE);
4641 return cc;
4642
4643 case OP_ALLANY:
4644 detect_partial_match(common, backtracks);
4645 #ifdef SUPPORT_UTF
4646 if (common->utf)
4647 {
4648 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
4649 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4650 #if defined COMPILE_PCRE8 || defined COMPILE_PCRE16
4651 #if defined COMPILE_PCRE8
4652 jump[0] = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xc0);
4653 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_sw)PRIV(utf8_table4) - 0xc0);
4654 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
4655 #elif defined COMPILE_PCRE16
4656 jump[0] = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xd800);
4657 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0xfc00);
4658 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xd800);
4659 OP_FLAGS(SLJIT_MOV, TMP1, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
4660 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
4661 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
4662 #endif
4663 JUMPHERE(jump[0]);
4664 #endif /* COMPILE_PCRE[8|16] */
4665 return cc;
4666 }
4667 #endif
4668 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4669 return cc;
4670
4671 case OP_ANYBYTE:
4672 detect_partial_match(common, backtracks);
4673 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4674 return cc;
4675
4676 #ifdef SUPPORT_UTF
4677 #ifdef SUPPORT_UCP
4678 case OP_NOTPROP:
4679 case OP_PROP:
4680 propdata[0] = XCL_HASPROP;
4681 propdata[1] = type == OP_NOTPROP ? XCL_NOTPROP : XCL_PROP;
4682 propdata[2] = cc[0];
4683 propdata[3] = cc[1];
4684 propdata[4] = XCL_END;
4685 compile_xclass_matchingpath(common, propdata, backtracks);
4686 return cc + 2;
4687 #endif
4688 #endif
4689
4690 case OP_ANYNL:
4691 detect_partial_match(common, backtracks);
4692 read_char(common);
4693 jump[0] = CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_CR);
4694 /* We don't need to handle soft partial matching case. */
4695 end_list = NULL;
4696 if (common->mode != JIT_PARTIAL_HARD_COMPILE)
4697 add_jump(compiler, &end_list, CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0));
4698 else
4699 check_str_end(common, &end_list);
4700 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
4701 jump[1] = CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_NL);
4702 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4703 jump[2] = JUMP(SLJIT_JUMP);
4704 JUMPHERE(jump[0]);
4705 check_newlinechar(common, common->bsr_nltype, backtracks, FALSE);
4706 set_jumps(end_list, LABEL());
4707 JUMPHERE(jump[1]);
4708 JUMPHERE(jump[2]);
4709 return cc;
4710
4711 case OP_NOT_HSPACE:
4712 case OP_HSPACE:
4713 detect_partial_match(common, backtracks);
4714 read_char(common);
4715 add_jump(compiler, &common->hspace, JUMP(SLJIT_FAST_CALL));
4716 add_jump(compiler, backtracks, JUMP(type == OP_NOT_HSPACE ? SLJIT_C_NOT_ZERO : SLJIT_C_ZERO));
4717 return cc;
4718
4719 case OP_NOT_VSPACE:
4720 case OP_VSPACE:
4721 detect_partial_match(common, backtracks);
4722 read_char(common);
4723 add_jump(compiler, &common->vspace, JUMP(SLJIT_FAST_CALL));
4724 add_jump(compiler, backtracks, JUMP(type == OP_NOT_VSPACE ? SLJIT_C_NOT_ZERO : SLJIT_C_ZERO));
4725 return cc;
4726
4727 #ifdef SUPPORT_UCP
4728 case OP_EXTUNI:
4729 detect_partial_match(common, backtracks);
4730 read_char(common);
4731 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
4732 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, (sljit_sw)PRIV(ucd_records) + SLJIT_OFFSETOF(ucd_record, gbprop));
4733 /* Optimize register allocation: use a real register. */
4734 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, STACK_TOP, 0);
4735 OP1(SLJIT_MOV_UB, STACK_TOP, 0, SLJIT_MEM2(TMP1, TMP2), 3);
4736
4737 label = LABEL();
4738 jump[0] = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
4739 OP1(SLJIT_MOV, TMP3, 0, STR_PTR, 0);
4740 read_char(common);
4741 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
4742 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, (sljit_sw)PRIV(ucd_records) + SLJIT_OFFSETOF(ucd_record, gbprop));
4743 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM2(TMP1, TMP2), 3);
4744
4745 OP2(SLJIT_SHL, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, 2);
4746 OP1(SLJIT_MOV_UI, TMP1, 0, SLJIT_MEM1(STACK_TOP), (sljit_sw)PRIV(ucp_gbtable));
4747 OP1(SLJIT_MOV, STACK_TOP, 0, TMP2, 0);
4748 OP2(SLJIT_SHL, TMP2, 0, SLJIT_IMM, 1, TMP2, 0);
4749 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, TMP2, 0);
4750 JUMPTO(SLJIT_C_NOT_ZERO, label);
4751
4752 OP1(SLJIT_MOV, STR_PTR, 0, TMP3, 0);
4753 JUMPHERE(jump[0]);
4754 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
4755
4756 if (common->mode == JIT_PARTIAL_HARD_COMPILE)
4757 {
4758 jump[0] = CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0);
4759 /* Since we successfully read a char above, partial matching must occure. */
4760 check_partial(common, TRUE);
4761 JUMPHERE(jump[0]);
4762 }
4763 return cc;
4764 #endif
4765
4766 case OP_EODN:
4767 /* Requires rather complex checks. */
4768 jump[0] = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
4769 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
4770 {
4771 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(2));
4772 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
4773 if (common->mode == JIT_COMPILE)
4774 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, STR_END, 0));
4775 else
4776 {
4777 jump[1] = CMP(SLJIT_C_EQUAL, TMP2, 0, STR_END, 0);
4778 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP2, 0, STR_END, 0);
4779 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_LESS);
4780 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff);
4781 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_NOT_EQUAL);
4782 add_jump(compiler, backtracks, JUMP(SLJIT_C_NOT_EQUAL));
4783 check_partial(common, TRUE);
4784 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
4785 JUMPHERE(jump[1]);
4786 }
4787 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
4788 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff));
4789 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, common->newline & 0xff));
4790 }
4791 else if (common->nltype == NLTYPE_FIXED)
4792 {
4793 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4794 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
4795 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, STR_END, 0));
4796 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, common->newline));
4797 }
4798 else
4799 {
4800 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
4801 jump[1] = CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_CR);
4802 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(2));
4803 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP2, 0, STR_END, 0);
4804 jump[2] = JUMP(SLJIT_C_GREATER);
4805 add_jump(compiler, backtracks, JUMP(SLJIT_C_LESS));
4806 /* Equal. */
4807 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
4808 jump[3] = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_NL);
4809 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
4810
4811 JUMPHERE(jump[1]);
4812 if (common->nltype == NLTYPE_ANYCRLF)
4813 {
4814 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4815 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, TMP2, 0, STR_END, 0));
4816 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_NL));
4817 }
4818 else
4819 {
4820 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, STR_PTR, 0);
4821 read_char(common);
4822 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, STR_END, 0));
4823 add_jump(compiler, &common->anynewline, JUMP(SLJIT_FAST_CALL));
4824 add_jump(compiler, backtracks, JUMP(SLJIT_C_ZERO));
4825 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1);
4826 }
4827 JUMPHERE(jump[2]);
4828 JUMPHERE(jump[3]);
4829 }
4830 JUMPHERE(jump[0]);
4831 check_partial(common, FALSE);
4832 return cc;
4833
4834 case OP_EOD:
4835 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0));
4836 check_partial(common, FALSE);
4837 return cc;
4838
4839 case OP_CIRC:
4840 OP1(SLJIT_MOV, TMP2, 0, ARGUMENTS, 0);
4841 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, begin));
4842 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER, STR_PTR, 0, TMP1, 0));
4843 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, notbol));
4844 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4845 return cc;
4846
4847 case OP_CIRCM:
4848 OP1(SLJIT_MOV, TMP2, 0, ARGUMENTS, 0);
4849 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, begin));
4850 jump[1] = CMP(SLJIT_C_GREATER, STR_PTR, 0, TMP1, 0);
4851 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, notbol));
4852 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4853 jump[0] = JUMP(SLJIT_JUMP);
4854 JUMPHERE(jump[1]);
4855
4856 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0));
4857 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
4858 {
4859 OP2(SLJIT_SUB, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(2));
4860 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, TMP2, 0, TMP1, 0));
4861 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(-2));
4862 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(-1));
4863 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff));
4864 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, common->newline & 0xff));
4865 }
4866 else
4867 {
4868 skip_char_back(common);
4869 read_char(common);
4870 check_newlinechar(common, common->nltype, backtracks, FALSE);
4871 }
4872 JUMPHERE(jump[0]);
4873 return cc;
4874
4875 case OP_DOLL:
4876 OP1(SLJIT_MOV, TMP2, 0, ARGUMENTS, 0);
4877 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, noteol));
4878 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4879
4880 if (!common->endonly)
4881 compile_char1_matchingpath(common, OP_EODN, cc, backtracks);
4882 else
4883 {
4884 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0));
4885 check_partial(common, FALSE);
4886 }
4887 return cc;
4888
4889 case OP_DOLLM:
4890 jump[1] = CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0);
4891 OP1(SLJIT_MOV, TMP2, 0, ARGUMENTS, 0);
4892 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, noteol));
4893 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4894 check_partial(common, FALSE);
4895 jump[0] = JUMP(SLJIT_JUMP);
4896 JUMPHERE(jump[1]);
4897
4898 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
4899 {
4900 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(2));
4901 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
4902 if (common->mode == JIT_COMPILE)
4903 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER, TMP2, 0, STR_END, 0));
4904 else
4905 {
4906 jump[1] = CMP(SLJIT_C_LESS_EQUAL, TMP2, 0, STR_END, 0);
4907 /* STR_PTR = STR_END - IN_UCHARS(1) */
4908 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff));
4909 check_partial(common, TRUE);
4910 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
4911 JUMPHERE(jump[1]);
4912 }
4913
4914 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
4915 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff));
4916 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, common->newline & 0xff));
4917 }
4918 else
4919 {
4920 peek_char(common);
4921 check_newlinechar(common, common->nltype, backtracks, FALSE);
4922 }
4923 JUMPHERE(jump[0]);
4924 return cc;
4925
4926 case OP_CHAR:
4927 case OP_CHARI:
4928 length = 1;
4929 #ifdef SUPPORT_UTF
4930 if (common->utf && HAS_EXTRALEN(*cc)) length += GET_EXTRALEN(*cc);
4931 #endif
4932 if (common->mode == JIT_COMPILE && (type == OP_CHAR || !char_has_othercase(common, cc) || char_get_othercase_bit(common, cc) != 0))
4933 {
4934 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(length));
4935 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER, STR_PTR, 0, STR_END, 0));
4936
4937 context.length = IN_UCHARS(length);
4938 context.sourcereg = -1;
4939 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
4940 context.ucharptr = 0;
4941 #endif
4942 return byte_sequence_compare(common, type == OP_CHARI, cc, &context, backtracks);
4943 }
4944 detect_partial_match(common, backtracks);
4945 read_char(common);
4946 #ifdef SUPPORT_UTF
4947 if (common->utf)
4948 {
4949 GETCHAR(c, cc);
4950 }
4951 else
4952 #endif
4953 c = *cc;
4954 if (type == OP_CHAR || !char_has_othercase(common, cc))
4955 {
4956 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, c));
4957 return cc + length;
4958 }
4959 oc = char_othercase(common, c);
4960 bit = c ^ oc;
4961 if (is_powerof2(bit))
4962 {
4963 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, bit);
4964 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, c | bit));
4965 return cc + length;
4966 }
4967 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c);
4968 OP_FLAGS(SLJIT_MOV, TMP2, 0, SLJIT_UNUSED, 0, SLJIT_C_EQUAL);
4969 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, oc);
4970 OP_FLAGS(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_C_EQUAL);
4971 add_jump(compiler, backtracks, JUMP(SLJIT_C_ZERO));
4972 return cc + length;
4973
4974 case OP_NOT:
4975 case OP_NOTI:
4976 detect_partial_match(common, backtracks);
4977 length = 1;
4978 #ifdef SUPPORT_UTF
4979 if (common->utf)
4980 {
4981 #ifdef COMPILE_PCRE8
4982 c = *cc;
4983 if (c < 128)
4984 {
4985 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
4986 if (type == OP_NOT || !char_has_othercase(common, cc))
4987 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, c));
4988 else
4989 {
4990 /* Since UTF8 code page is fixed, we know that c is in [a-z] or [A-Z] range. */
4991 OP2(SLJIT_OR, TMP2, 0, TMP1, 0, SLJIT_IMM, 0x20);
4992 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, c | 0x20));
4993 }
4994 /* Skip the variable-length character. */
4995 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4996 jump[0] = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xc0);
4997 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_sw)PRIV(utf8_table4) - 0xc0);
4998 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
4999 JUMPHERE(jump[0]);
5000 return cc + 1;
5001 }
5002 else
5003 #endif /* COMPILE_PCRE8 */
5004 {
5005 GETCHARLEN(c, cc, length);
5006 read_char(common);
5007 }
5008 }
5009 else
5010 #endif /* SUPPORT_UTF */
5011 {
5012 read_char(common);
5013 c = *cc;
5014 }
5015
5016 if (type == OP_NOT || !char_has_othercase(common, cc))
5017 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, c));
5018 else
5019 {
5020 oc = char_othercase(common, c);
5021 bit = c ^ oc;
5022 if (is_powerof2(bit))
5023 {
5024 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, bit);
5025 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, c | bit));
5026 }
5027 else
5028 {
5029 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, c));
5030 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, oc));
5031 }
5032 }
5033 return cc + length;
5034
5035 case OP_CLASS:
5036 case OP_NCLASS:
5037 detect_partial_match(common, backtracks);
5038 read_char(common);
5039 if (check_class_ranges(common, (const pcre_uint8 *)cc, type == OP_NCLASS, FALSE, backtracks))
5040 return cc + 32 / sizeof(pcre_uchar);
5041
5042 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
5043 jump[0] = NULL;
5044 #ifdef COMPILE_PCRE8
5045 /* This check only affects 8 bit mode. In other modes, we
5046 always need to compare the value with 255. */
5047 if (common->utf)
5048 #endif /* COMPILE_PCRE8 */
5049 {
5050 jump[0] = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
5051 if (type == OP_CLASS)
5052 {
5053 add_jump(compiler, backtracks, jump[0]);
5054 jump[0] = NULL;
5055 }
5056 }
5057 #endif /* SUPPORT_UTF || !COMPILE_PCRE8 */
5058 OP2(SLJIT_AND, TMP2, 0, TMP1, 0, SLJIT_IMM, 0x7);
5059 OP2(SLJIT_LSHR, TMP1, 0, TMP1, 0, SLJIT_IMM, 3);
5060 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_sw)cc);
5061 OP2(SLJIT_SHL, TMP2, 0, SLJIT_IMM, 1, TMP2, 0);
5062 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, TMP2, 0);
5063 add_jump(compiler, backtracks, JUMP(SLJIT_C_ZERO));
5064 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
5065 if (jump[0] != NULL)
5066 JUMPHERE(jump[0]);
5067 #endif /* SUPPORT_UTF || !COMPILE_PCRE8 */
5068 return cc + 32 / sizeof(pcre_uchar);
5069
5070 #if defined SUPPORT_UTF || defined COMPILE_PCRE16 || defined COMPILE_PCRE32
5071 case OP_XCLASS:
5072 compile_xclass_matchingpath(common, cc + LINK_SIZE, backtracks);
5073 return cc + GET(cc, 0) - 1;
5074 #endif
5075
5076 case OP_REVERSE:
5077 length = GET(cc, 0);
5078 if (length == 0)
5079 return cc + LINK_SIZE;
5080 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
5081 #ifdef SUPPORT_UTF
5082 if (common->utf)
5083 {
5084 OP1(SLJIT_MOV, TMP3, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
5085 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, length);
5086 label = LABEL();
5087 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS_EQUAL, STR_PTR, 0, TMP3, 0));
5088 skip_char_back(common);
5089 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_IMM, 1);
5090 JUMPTO(SLJIT_C_NOT_ZERO, label);
5091 }
5092 else
5093 #endif
5094 {
5095 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
5096 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(length));
5097 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, STR_PTR, 0, TMP1, 0));
5098 }
5099 check_start_used_ptr(common);
5100 return cc + LINK_SIZE;
5101 }
5102 SLJIT_ASSERT_STOP();
5103 return cc;
5104 }
5105
5106 static SLJIT_INLINE pcre_uchar *compile_charn_matchingpath(compiler_common *common, pcre_uchar *cc, pcre_uchar *ccend, jump_list **backtracks)
5107 {
5108 /* This function consumes at least one input character. */
5109 /* To decrease the number of length checks, we try to concatenate the fixed length character sequences. */
5110 DEFINE_COMPILER;
5111 pcre_uchar *ccbegin = cc;
5112 compare_context context;
5113 int size;
5114
5115 context.length = 0;
5116 do
5117 {
5118 if (cc >= ccend)
5119 break;
5120
5121 if (*cc == OP_CHAR)
5122 {
5123 size = 1;
5124 #ifdef SUPPORT_UTF
5125 if (common->utf && HAS_EXTRALEN(cc[1]))
5126 size += GET_EXTRALEN(cc[1]);
5127 #endif
5128 }
5129 else if (*cc == OP_CHARI)
5130 {
5131 size = 1;
5132 #ifdef SUPPORT_UTF
5133 if (common->utf)
5134 {
5135 if (char_has_othercase(common, cc + 1) && char_get_othercase_bit(common, cc + 1) == 0)
5136 size = 0;
5137 else if (HAS_EXTRALEN(cc[1]))
5138 size += GET_EXTRALEN(cc[1]);
5139 }
5140 else
5141 #endif
5142 if (char_has_othercase(common, cc + 1) && char_get_othercase_bit(common, cc + 1) == 0)
5143 size = 0;
5144 }
5145 else
5146 size = 0;
5147
5148 cc += 1 + size;
5149 context.length += IN_UCHARS(size);
5150 }
5151 while (size > 0 && context.length <= 128);
5152
5153 cc = ccbegin;
5154 if (context.length > 0)
5155 {
5156 /* We have a fixed-length byte sequence. */
5157 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, context.length);
5158 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER, STR_PTR, 0, STR_END, 0));
5159
5160 context.sourcereg = -1;
5161 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
5162 context.ucharptr = 0;
5163 #endif
5164 do cc = byte_sequence_compare(common, *cc == OP_CHARI, cc + 1, &context, backtracks); while (context.length > 0);
5165 return cc;
5166 }
5167
5168 /* A non-fixed length character will be checked if length == 0. */
5169 return compile_char1_matchingpath(common, *cc, cc + 1, backtracks);
5170 }
5171
5172 /* Forward definitions. */
5173 static void compile_matchingpath(compiler_common *, pcre_uchar *, pcre_uchar *, backtrack_common *);
5174 static void compile_backtrackingpath(compiler_common *, struct backtrack_common *);
5175
5176 #define PUSH_BACKTRACK(size, ccstart, error) \
5177 do \
5178 { \
5179 backtrack = sljit_alloc_memory(compiler, (size)); \
5180 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler))) \
5181 return error; \
5182 memset(backtrack, 0, size); \
5183 backtrack->prev = parent->top; \
5184 backtrack->cc = (ccstart); \
5185 parent->top = backtrack; \
5186 } \
5187 while (0)
5188
5189 #define PUSH_BACKTRACK_NOVALUE(size, ccstart) \
5190 do \
5191 { \
5192 backtrack = sljit_alloc_memory(compiler, (size)); \
5193 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler))) \
5194 return; \
5195 memset(backtrack, 0, size); \
5196 backtrack->prev = parent->top; \
5197 backtrack->cc = (ccstart); \
5198 parent->top = backtrack; \
5199 } \
5200 while (0)
5201
5202 #define BACKTRACK_AS(type) ((type *)backtrack)
5203
5204 static void compile_dnref_search(compiler_common *common, pcre_uchar *cc, jump_list **backtracks)
5205 {
5206 /* The OVECTOR offset goes to TMP2. */
5207 DEFINE_COMPILER;
5208 int count = GET2(cc, 1 + IMM2_SIZE);
5209 pcre_uchar *slot = common->name_table + GET2(cc, 1) * common->name_entry_size;
5210 unsigned int offset;
5211 jump_list *found = NULL;
5212
5213 SLJIT_ASSERT(*cc == OP_DNREF || *cc == OP_DNREFI);
5214
5215 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1));
5216
5217 count--;
5218 while (count-- > 0)
5219 {
5220 offset = GET2(slot, 0) << 1;
5221 GET_LOCAL_BASE(TMP2, 0, OVECTOR(offset));
5222 add_jump(compiler, &found, CMP(SLJIT_C_NOT_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset), TMP1, 0));
5223 slot += common->name_entry_size;
5224 }
5225
5226 offset = GET2(slot, 0) << 1;
5227 GET_LOCAL_BASE(TMP2, 0, OVECTOR(offset));
5228 if (backtracks != NULL && !common->jscript_compat)
5229 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset), TMP1, 0));
5230
5231 set_jumps(found, LABEL());
5232 }
5233
5234 static void compile_ref_matchingpath(compiler_common *common, pcre_uchar *cc, jump_list **backtracks, BOOL withchecks, BOOL emptyfail)
5235 {
5236 DEFINE_COMPILER;
5237 BOOL ref = (*cc == OP_REF || *cc == OP_REFI);
5238 int offset = 0;
5239 struct sljit_jump *jump = NULL;
5240 struct sljit_jump *partial;
5241 struct sljit_jump *nopartial;
5242
5243 if (ref)
5244 {
5245 offset = GET2(cc, 1) << 1;
5246 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
5247 /* OVECTOR(1) contains the "string begin - 1" constant. */
5248 if (withchecks && !common->jscript_compat)
5249 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1)));
5250 }
5251 else
5252 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), 0);
5253
5254 #if defined SUPPORT_UTF && defined SUPPORT_UCP
5255 if (common->utf && *cc == OP_REFI)
5256 {
5257 SLJIT_ASSERT(TMP1 == SLJIT_SCRATCH_REG1 && STACK_TOP == SLJIT_SCRATCH_REG2 && TMP2 == SLJIT_SCRATCH_REG3);
5258 if (ref)
5259 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
5260 else
5261 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP2), sizeof(sljit_sw));
5262
5263 if (withchecks)
5264 jump = CMP(SLJIT_C_EQUAL, TMP1, 0, TMP2, 0);
5265
5266 /* Needed to save important temporary registers. */
5267 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, STACK_TOP, 0);
5268 OP1(SLJIT_MOV, SLJIT_SCRATCH_REG2, 0, ARGUMENTS, 0);
5269 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_SCRATCH_REG2), SLJIT_OFFSETOF(jit_arguments, uchar_ptr), STR_PTR, 0);
5270 sljit_emit_ijump(compiler, SLJIT_CALL3, SLJIT_IMM, SLJIT_FUNC_OFFSET(do_utf_caselesscmp));
5271 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
5272 if (common->mode == JIT_COMPILE)
5273 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS_EQUAL, SLJIT_RETURN_REG, 0, SLJIT_IMM, 1));
5274 else
5275 {
5276 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, SLJIT_RETURN_REG, 0, SLJIT_IMM, 0));
5277 nopartial = CMP(SLJIT_C_NOT_EQUAL, SLJIT_RETURN_REG, 0, SLJIT_IMM, 1);
5278 check_partial(common, FALSE);
5279 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
5280 JUMPHERE(nopartial);
5281 }
5282 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_RETURN_REG, 0);
5283 }
5284 else
5285 #endif /* SUPPORT_UTF && SUPPORT_UCP */
5286 {
5287 if (ref)
5288 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1), TMP1, 0);
5289 else
5290 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, SLJIT_MEM1(TMP2), sizeof(sljit_sw), TMP1, 0);
5291
5292 if (withchecks)
5293 jump = JUMP(SLJIT_C_ZERO);
5294
5295 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
5296 partial = CMP(SLJIT_C_GREATER, STR_PTR, 0, STR_END, 0);
5297 if (common->mode == JIT_COMPILE)
5298 add_jump(compiler, backtracks, partial);
5299
5300 add_jump(compiler, *cc == OP_REF ? &common->casefulcmp : &common->caselesscmp, JUMP(SLJIT_FAST_CALL));
5301 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
5302
5303 if (common->mode != JIT_COMPILE)
5304 {
5305 nopartial = JUMP(SLJIT_JUMP);
5306 JUMPHERE(partial);
5307 /* TMP2 -= STR_END - STR_PTR */
5308 OP2(SLJIT_SUB, TMP2, 0, TMP2, 0, STR_PTR, 0);
5309 OP2(SLJIT_ADD, TMP2, 0, TMP2, 0, STR_END, 0);
5310 partial = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, 0);
5311 OP1(SLJIT_MOV, STR_PTR, 0, STR_END, 0);
5312 add_jump(compiler, *cc == OP_REF ? &common->casefulcmp : &common->caselesscmp, JUMP(SLJIT_FAST_CALL));
5313 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
5314 JUMPHERE(partial);
5315 check_partial(common, FALSE);
5316 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
5317 JUMPHERE(nopartial);
5318 }
5319 }
5320
5321 if (jump != NULL)
5322 {
5323 if (emptyfail)
5324 add_jump(compiler, backtracks, jump);
5325 else
5326 JUMPHERE(jump);
5327 }
5328 }
5329
5330 static SLJIT_INLINE pcre_uchar *compile_ref_iterator_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
5331 {
5332 DEFINE_COMPILER;
5333 BOOL ref = (*cc == OP_REF || *cc == OP_REFI);
5334 backtrack_common *backtrack;
5335 pcre_uchar type;
5336 int offset = 0;
5337 struct sljit_label *label;
5338 struct sljit_jump *zerolength;
5339 struct sljit_jump *jump = NULL;
5340 pcre_uchar *ccbegin = cc;
5341 int min = 0, max = 0;
5342 BOOL minimize;
5343
5344 PUSH_BACKTRACK(sizeof(iterator_backtrack), cc, NULL);
5345
5346 if (ref)
5347 offset = GET2(cc, 1) << 1;
5348 else
5349 cc += IMM2_SIZE;
5350 type = cc[1 + IMM2_SIZE];
5351
5352 SLJIT_COMPILE_ASSERT((OP_CRSTAR & 0x1) == 0, crstar_opcode_must_be_even);
5353 minimize = (type & 0x1) != 0;
5354 switch(type)
5355 {
5356 case OP_CRSTAR:
5357 case OP_CRMINSTAR:
5358 min = 0;
5359 max = 0;
5360 cc += 1 + IMM2_SIZE + 1;
5361 break;
5362 case OP_CRPLUS:
5363 case OP_CRMINPLUS:
5364 min = 1;
5365 max = 0;
5366 cc += 1 + IMM2_SIZE + 1;
5367 break;
5368 case OP_CRQUERY:
5369 case OP_CRMINQUERY:
5370 min = 0;
5371 max = 1;
5372 cc += 1 + IMM2_SIZE + 1;
5373 break;
5374 case OP_CRRANGE:
5375 case OP_CRMINRANGE:
5376 min = GET2(cc, 1 + IMM2_SIZE + 1);
5377 max = GET2(cc, 1 + IMM2_SIZE + 1 + IMM2_SIZE);
5378 cc += 1 + IMM2_SIZE + 1 + 2 * IMM2_SIZE;
5379 break;
5380 default:
5381 SLJIT_ASSERT_STOP();
5382 break;
5383 }
5384
5385 if (!minimize)
5386 {
5387 if (min == 0)
5388 {
5389 allocate_stack(common, 2);
5390 if (ref)
5391 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
5392 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5393 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, 0);
5394 /* Temporary release of STR_PTR. */
5395 OP2(SLJIT_SUB, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_sw));
5396 /* Handles both invalid and empty cases. Since the minimum repeat,
5397 is zero the invalid case is basically the same as an empty case. */
5398 if (ref)
5399 zerolength = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
5400 else
5401 {
5402 compile_dnref_search(common, ccbegin, NULL);
5403 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), 0);
5404 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1, TMP2, 0);
5405 zerolength = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(TMP2), sizeof(sljit_sw));
5406 }
5407 /* Restore if not zero length. */
5408 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_sw));
5409 }
5410 else
5411 {
5412 allocate_stack(common, 1);
5413 if (ref)
5414 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
5415 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5416 if (ref)
5417 {
5418 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1)));
5419 zerolength = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
5420 }
5421 else
5422 {
5423 compile_dnref_search(common, ccbegin, &backtrack->topbacktracks);
5424 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), 0);
5425 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1, TMP2, 0);
5426 zerolength = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(TMP2), sizeof(sljit_sw));
5427 }
5428 }
5429
5430 if (min > 1 || max > 1)
5431 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0, SLJIT_IMM, 0);
5432
5433 label = LABEL();
5434 if (!ref)
5435 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1);
5436 compile_ref_matchingpath(common, ccbegin, &backtrack->topbacktracks, FALSE, FALSE);
5437
5438 if (min > 1 || max > 1)
5439 {
5440 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0);
5441 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
5442 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0, TMP1, 0);
5443 if (min > 1)
5444 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, min, label);
5445 if (max > 1)
5446 {
5447 jump = CMP(SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, max);
5448 allocate_stack(common, 1);
5449 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5450 JUMPTO(SLJIT_JUMP, label);
5451 JUMPHERE(jump);
5452 }
5453 }
5454
5455 if (max == 0)
5456 {
5457 /* Includes min > 1 case as well. */
5458 allocate_stack(common, 1);
5459 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5460 JUMPTO(SLJIT_JUMP, label);
5461 }
5462
5463 JUMPHERE(zerolength);
5464 BACKTRACK_AS(iterator_backtrack)->matchingpath = LABEL();
5465
5466 count_match(common);
5467 return cc;
5468 }
5469
5470 allocate_stack(common, ref ? 2 : 3);
5471 if (ref)
5472 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
5473 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5474 if (type != OP_CRMINSTAR)
5475 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, 0);
5476
5477 if (min == 0)
5478 {
5479 /* Handles both invalid and empty cases. Since the minimum repeat,
5480 is zero the invalid case is basically the same as an empty case. */
5481 if (ref)
5482 zerolength = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
5483 else
5484 {
5485 compile_dnref_search(common, ccbegin, NULL);
5486 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), 0);
5487 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(2), TMP2, 0);
5488 zerolength = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(TMP2), sizeof(sljit_sw));
5489 }
5490 /* Length is non-zero, we can match real repeats. */
5491 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5492 jump = JUMP(SLJIT_JUMP);
5493 }
5494 else
5495 {
5496 if (ref)
5497 {
5498 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1)));
5499 zerolength = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
5500 }
5501 else
5502 {
5503 compile_dnref_search(common, ccbegin, &backtrack->topbacktracks);
5504 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), 0);
5505 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(2), TMP2, 0);
5506 zerolength = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(TMP2), sizeof(sljit_sw));
5507 }
5508 }
5509
5510 BACKTRACK_AS(iterator_backtrack)->matchingpath = LABEL();
5511 if (max > 0)
5512 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_GREATER_EQUAL, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, max));
5513
5514 if (!ref)
5515 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(STACK_TOP), STACK(2));
5516 compile_ref_matchingpath(common, ccbegin, &backtrack->topbacktracks, TRUE, TRUE);
5517 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5518
5519 if (min > 1)
5520 {
5521 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), STACK(1));
5522 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
5523 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP1, 0);
5524 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, min, BACKTRACK_AS(iterator_backtrack)->matchingpath);
5525 }
5526 else if (max > 0)
5527 OP2(SLJIT_ADD, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, 1);
5528
5529 if (jump != NULL)
5530 JUMPHERE(jump);
5531 JUMPHERE(zerolength);
5532
5533 count_match(common);
5534 return cc;
5535 }
5536
5537 static SLJIT_INLINE pcre_uchar *compile_recurse_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
5538 {
5539 DEFINE_COMPILER;
5540 backtrack_common *backtrack;
5541 recurse_entry *entry = common->entries;
5542 recurse_entry *prev = NULL;
5543 sljit_sw start = GET(cc, 1);
5544 pcre_uchar *start_cc;
5545 BOOL needs_control_head;
5546
5547 PUSH_BACKTRACK(sizeof(recurse_backtrack), cc, NULL);
5548
5549 /* Inlining simple patterns. */
5550 if (get_framesize(common, common->start + start, NULL, TRUE, &needs_control_head) == no_stack)
5551 {
5552 start_cc = common->start + start;
5553 compile_matchingpath(common, next_opcode(common, start_cc), bracketend(start_cc) - (1 + LINK_SIZE), backtrack);
5554 BACKTRACK_AS(recurse_backtrack)->inlined_pattern = TRUE;
5555 return cc + 1 + LINK_SIZE;
5556 }
5557
5558 while (entry != NULL)
5559 {
5560 if (entry->start == start)
5561 break;
5562 prev = entry;
5563 entry = entry->next;
5564 }
5565
5566 if (entry == NULL)
5567 {
5568 entry = sljit_alloc_memory(compiler, sizeof(recurse_entry));
5569 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
5570 return NULL;
5571 entry->next = NULL;
5572 entry->entry = NULL;
5573 entry->calls = NULL;
5574 entry->start = start;
5575
5576 if (prev != NULL)
5577 prev->next = entry;
5578 else
5579 common->entries = entry;
5580 }
5581
5582 if (common->has_set_som && common->mark_ptr != 0)
5583 {
5584 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0));
5585 allocate_stack(common, 2);
5586 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mark_ptr);
5587 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
5588 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP1, 0);
5589 }
5590 else if (common->has_set_som || common->mark_ptr != 0)
5591 {
5592 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->has_set_som ? (int)(OVECTOR(0)) : common->mark_ptr);
5593 allocate_stack(common, 1);
5594 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
5595 }
5596
5597 if (entry->entry == NULL)
5598 add_jump(compiler, &entry->calls, JUMP(SLJIT_FAST_CALL));
5599 else
5600 JUMPTO(SLJIT_FAST_CALL, entry->entry);
5601 /* Leave if the match is failed. */
5602 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, 0));
5603 return cc + 1 + LINK_SIZE;
5604 }
5605
5606 static int SLJIT_CALL do_callout(struct jit_arguments* arguments, PUBL(callout_block) *callout_block, pcre_uchar **jit_ovector)
5607 {
5608 const pcre_uchar *begin = arguments->begin;
5609 int *offset_vector = arguments->offsets;
5610 int offset_count = arguments->offset_count;
5611 int i;
5612
5613 if (PUBL(callout) == NULL)
5614 return 0;
5615
5616 callout_block->version = 2;
5617 callout_block->callout_data = arguments->callout_data;
5618
5619 /* Offsets in subject. */
5620 callout_block->subject_length = arguments->end - arguments->begin;
5621 callout_block->start_match = (pcre_uchar*)callout_block->subject - arguments->begin;
5622 callout_block->current_position = (pcre_uchar*)callout_block->offset_vector - arguments->begin;
5623 #if defined COMPILE_PCRE8
5624 callout_block->subject = (PCRE_SPTR)begin;
5625 #elif defined COMPILE_PCRE16
5626 callout_block->subject = (PCRE_SPTR16)begin;
5627 #elif defined COMPILE_PCRE32
5628 callout_block->subject = (PCRE_SPTR32)begin;
5629 #endif
5630
5631 /* Convert and copy the JIT offset vector to the offset_vector array. */
5632 callout_block->capture_top = 0;
5633 callout_block->offset_vector = offset_vector;
5634 for (i = 2; i < offset_count; i += 2)
5635 {
5636 offset_vector[i] = jit_ovector[i] - begin;
5637 offset_vector[i + 1] = jit_ovector[i + 1] - begin;
5638 if (jit_ovector[i] >= begin)
5639 callout_block->capture_top = i;
5640 }
5641
5642 callout_block->capture_top = (callout_block->capture_top >> 1) + 1;
5643 if (offset_count > 0)
5644 offset_vector[0] = -1;
5645 if (offset_count > 1)
5646 offset_vector[1] = -1;
5647 return (*PUBL(callout))(callout_block);
5648 }
5649
5650 /* Aligning to 8 byte. */
5651 #define CALLOUT_ARG_SIZE \
5652 (((int)sizeof(PUBL(callout_block)) + 7) & ~7)
5653
5654 #define CALLOUT_ARG_OFFSET(arg) \
5655 (-CALLOUT_ARG_SIZE + SLJIT_OFFSETOF(PUBL(callout_block), arg))
5656
5657 static SLJIT_INLINE pcre_uchar *compile_callout_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
5658 {
5659 DEFINE_COMPILER;
5660 backtrack_common *backtrack;
5661
5662 PUSH_BACKTRACK(sizeof(backtrack_common), cc, NULL);
5663
5664 allocate_stack(common, CALLOUT_ARG_SIZE / sizeof(sljit_sw));
5665
5666 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->capture_last_ptr);
5667 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
5668 SLJIT_ASSERT(common->capture_last_ptr != 0);
5669 OP1(SLJIT_MOV_SI, SLJIT_MEM1(STACK_TOP), CALLOUT_ARG_OFFSET(callout_number), SLJIT_IMM, cc[1]);
5670 OP1(SLJIT_MOV_SI, SLJIT_MEM1(STACK_TOP), CALLOUT_ARG_OFFSET(capture_last), TMP2, 0);
5671
5672 /* These pointer sized fields temporarly stores internal variables. */
5673 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0));
5674 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), CALLOUT_ARG_OFFSET(offset_vector), STR_PTR, 0);
5675 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), CALLOUT_ARG_OFFSET(subject), TMP2, 0);
5676
5677 if (common->mark_ptr != 0)
5678 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, mark_ptr));
5679 OP1(SLJIT_MOV_SI, SLJIT_MEM1(STACK_TOP), CALLOUT_ARG_OFFSET(pattern_position), SLJIT_IMM, GET(cc, 2));
5680 OP1(SLJIT_MOV_SI, SLJIT_MEM1(STACK_TOP), CALLOUT_ARG_OFFSET(next_item_length), SLJIT_IMM, GET(cc, 2 + LINK_SIZE));
5681 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), CALLOUT_ARG_OFFSET(mark), (common->mark_ptr != 0) ? TMP2 : SLJIT_IMM, 0);
5682
5683 /* Needed to save important temporary registers. */
5684 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, STACK_TOP, 0);
5685 OP2(SLJIT_SUB, SLJIT_SCRATCH_REG2, 0, STACK_TOP, 0, SLJIT_IMM, CALLOUT_ARG_SIZE);
5686 GET_LOCAL_BASE(SLJIT_SCRATCH_REG3, 0, OVECTOR_START);
5687 sljit_emit_ijump(compiler, SLJIT_CALL3, SLJIT_IMM, SLJIT_FUNC_OFFSET(do_callout));
5688 OP1(SLJIT_MOV_SI, SLJIT_RETURN_REG, 0, SLJIT_RETURN_REG, 0);
5689 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
5690 free_stack(common, CALLOUT_ARG_SIZE / sizeof(sljit_sw));
5691
5692 /* Check return value. */
5693 OP2(SLJIT_SUB | SLJIT_SET_S, SLJIT_UNUSED, 0, SLJIT_RETURN_REG, 0, SLJIT_IMM, 0);
5694 add_jump(compiler, &backtrack->topbacktracks, JUMP(SLJIT_C_SIG_GREATER));
5695 if (common->forced_quit_label == NULL)
5696 add_jump(compiler, &common->forced_quit, JUMP(SLJIT_C_SIG_LESS));
5697 else
5698 JUMPTO(SLJIT_C_SIG_LESS, common->forced_quit_label);
5699 return cc + 2 + 2 * LINK_SIZE;
5700 }
5701
5702 #undef CALLOUT_ARG_SIZE
5703 #undef CALLOUT_ARG_OFFSET
5704
5705 static pcre_uchar *compile_assert_matchingpath(compiler_common *common, pcre_uchar *cc, assert_backtrack *backtrack, BOOL conditional)
5706 {
5707 DEFINE_COMPILER;
5708 int framesize;
5709 int extrasize;
5710 BOOL needs_control_head;
5711 int private_data_ptr;
5712 backtrack_common altbacktrack;
5713 pcre_uchar *ccbegin;
5714 pcre_uchar opcode;
5715 pcre_uchar bra = OP_BRA;
5716 jump_list *tmp = NULL;
5717 jump_list **target = (conditional) ? &backtrack->condfailed : &backtrack->common.topbacktracks;
5718 jump_list **found;
5719 /* Saving previous accept variables. */
5720 BOOL save_local_exit = common->local_exit;
5721 BOOL save_positive_assert = common->positive_assert;
5722 then_trap_backtrack *save_then_trap = common->then_trap;
5723 struct sljit_label *save_quit_label = common->quit_label;
5724 struct sljit_label *save_accept_label = common->accept_label;
5725 jump_list *save_quit = common->quit;
5726 jump_list *save_positive_assert_quit = common->positive_assert_quit;
5727 jump_list *save_accept = common->accept;
5728 struct sljit_jump *jump;
5729 struct sljit_jump *brajump = NULL;
5730
5731 /* Assert captures then. */
5732 common->then_trap = NULL;
5733
5734 if (*cc == OP_BRAZERO || *cc == OP_BRAMINZERO)
5735 {
5736 SLJIT_ASSERT(!conditional);
5737 bra = *cc;
5738 cc++;
5739 }
5740 private_data_ptr = PRIVATE_DATA(cc);
5741 SLJIT_ASSERT(private_data_ptr != 0);
5742 framesize = get_framesize(common, cc, NULL, FALSE, &needs_control_head);
5743 backtrack->framesize = framesize;
5744 backtrack->private_data_ptr = private_data_ptr;
5745 opcode = *cc;
5746 SLJIT_ASSERT(opcode >= OP_ASSERT && opcode <= OP_ASSERTBACK_NOT);
5747 found = (opcode == OP_ASSERT || opcode == OP_ASSERTBACK) ? &tmp : target;
5748 ccbegin = cc;
5749 cc += GET(cc, 1);
5750
5751 if (bra == OP_BRAMINZERO)
5752 {
5753 /* This is a braminzero backtrack path. */
5754 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5755 free_stack(common, 1);
5756 brajump = CMP(SLJIT_C_EQUAL, STR_PTR, 0, SLJIT_IMM, 0);
5757 }
5758
5759 if (framesize < 0)
5760 {
5761 extrasize = needs_control_head ? 2 : 1;
5762 if (framesize == no_frame)
5763 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STACK_TOP, 0);
5764 allocate_stack(common, extrasize);
5765 if (needs_control_head)
5766 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr);
5767 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5768 if (needs_control_head)
5769 {
5770 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr, SLJIT_IMM, 0);
5771 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP1, 0);
5772 }
5773 }
5774 else
5775 {
5776 extrasize = needs_control_head ? 3 : 2;
5777 allocate_stack(common, framesize + extrasize);
5778 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5779 OP2(SLJIT_SUB, TMP2, 0, STACK_TOP, 0, SLJIT_IMM, (framesize + extrasize) * sizeof(sljit_sw));
5780 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP2, 0);
5781 if (needs_control_head)
5782 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr);
5783 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5784 if (needs_control_head)
5785 {
5786 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(2), TMP1, 0);
5787 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP2, 0);
5788 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr, SLJIT_IMM, 0);
5789 }
5790 else
5791 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP1, 0);
5792 init_frame(common, ccbegin, NULL, framesize + extrasize - 1, extrasize, FALSE);
5793 }
5794
5795 memset(&altbacktrack, 0, sizeof(backtrack_common));
5796 if (opcode == OP_ASSERT_NOT || opcode == OP_ASSERTBACK_NOT)
5797 {
5798 /* Negative assert is stronger than positive assert. */
5799 common->local_exit = TRUE;
5800 common->quit_label = NULL;
5801 common->quit = NULL;
5802 common->positive_assert = FALSE;
5803 }
5804 else
5805 common->positive_assert = TRUE;
5806 common->positive_assert_quit = NULL;
5807
5808 while (1)
5809 {
5810 common->accept_label = NULL;
5811 common->accept = NULL;
5812 altbacktrack.top = NULL;
5813 altbacktrack.topbacktracks = NULL;
5814
5815 if (*ccbegin == OP_ALT)
5816 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5817
5818 altbacktrack.cc = ccbegin;
5819 compile_matchingpath(common, ccbegin + 1 + LINK_SIZE, cc, &altbacktrack);
5820 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
5821 {
5822 if (opcode == OP_ASSERT_NOT || opcode == OP_ASSERTBACK_NOT)
5823 {
5824 common->local_exit = save_local_exit;
5825 common->quit_label = save_quit_label;
5826 common->quit = save_quit;
5827 }
5828 common->positive_assert = save_positive_assert;
5829 common->then_trap = save_then_trap;
5830 common->accept_label = save_accept_label;
5831 common->positive_assert_quit = save_positive_assert_quit;
5832 common->accept = save_accept;
5833 return NULL;
5834 }
5835 common->accept_label = LABEL();
5836 if (common->accept != NULL)
5837 set_jumps(common->accept, common->accept_label);
5838
5839 /* Reset stack. */
5840 if (framesize < 0)
5841 {
5842 if (framesize == no_frame)
5843 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5844 else
5845 free_stack(common, extrasize);
5846 if (needs_control_head)
5847 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr, SLJIT_MEM1(STACK_TOP), 0);
5848 }
5849 else
5850 {
5851 if ((opcode != OP_ASSERT_NOT && opcode != OP_ASSERTBACK_NOT) || conditional)
5852 {
5853 /* We don't need to keep the STR_PTR, only the previous private_data_ptr. */
5854 OP2(SLJIT_ADD, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_IMM, (framesize + 1) * sizeof(sljit_sw));
5855 if (needs_control_head)
5856 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr, SLJIT_MEM1(STACK_TOP), 0);
5857 }
5858 else
5859 {
5860 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5861 if (needs_control_head)
5862 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr, SLJIT_MEM1(STACK_TOP), (framesize + 1) * sizeof(sljit_sw));
5863 add_jump(compiler, &common->revertframes, JUMP(SLJIT_FAST_CALL));
5864 }
5865 }
5866
5867 if (opcode == OP_ASSERT_NOT || opcode == OP_ASSERTBACK_NOT)
5868 {
5869 /* We know that STR_PTR was stored on the top of the stack. */
5870 if (conditional)
5871 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), needs_control_head ? sizeof(sljit_sw) : 0);
5872 else if (bra == OP_BRAZERO)
5873 {
5874 if (framesize < 0)
5875 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), (extrasize - 1) * sizeof(sljit_sw));
5876 else
5877 {
5878 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), framesize * sizeof(sljit_sw));
5879 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), (framesize + extrasize - 1) * sizeof(sljit_sw));
5880 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP1, 0);
5881 }
5882 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_sw));
5883 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5884 }
5885 else if (framesize >= 0)
5886 {
5887 /* For OP_BRA and OP_BRAMINZERO. */
5888 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_MEM1(STACK_TOP), framesize * sizeof(sljit_sw));
5889 }
5890 }
5891 add_jump(compiler, found, JUMP(SLJIT_JUMP));
5892
5893 compile_backtrackingpath(common, altbacktrack.top);
5894 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
5895 {
5896 if (opcode == OP_ASSERT_NOT || opcode == OP_ASSERTBACK_NOT)
5897 {
5898 common->local_exit = save_local_exit;
5899 common->quit_label = save_quit_label;
5900 common->quit = save_quit;
5901 }
5902 common->positive_assert = save_positive_assert;
5903 common->then_trap = save_then_trap;
5904 common->accept_label = save_accept_label;
5905 common->positive_assert_quit = save_positive_assert_quit;
5906 common->accept = save_accept;
5907 return NULL;
5908 }
5909 set_jumps(altbacktrack.topbacktracks, LABEL());
5910
5911 if (*cc != OP_ALT)
5912 break;
5913
5914 ccbegin = cc;
5915 cc += GET(cc, 1);
5916 }
5917
5918 if (opcode == OP_ASSERT_NOT || opcode == OP_ASSERTBACK_NOT)
5919 {
5920 SLJIT_ASSERT(common->positive_assert_quit == NULL);
5921 /* Makes the check less complicated below. */
5922 common->positive_assert_quit = common->quit;
5923 }
5924
5925 /* None of them matched. */
5926 if (common->positive_assert_quit != NULL)
5927 {
5928 jump = JUMP(SLJIT_JUMP);
5929 set_jumps(common->positive_assert_quit, LABEL());
5930 SLJIT_ASSERT(framesize != no_stack);
5931 if (framesize < 0)
5932 OP2(SLJIT_ADD, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_IMM, extrasize * sizeof(sljit_sw));
5933 else
5934 {
5935 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5936 add_jump(compiler, &common->revertframes, JUMP(SLJIT_FAST_CALL));
5937 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, (framesize + extrasize) * sizeof(sljit_sw));
5938 }
5939 JUMPHERE(jump);
5940 }
5941
5942 if (needs_control_head)
5943 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr, SLJIT_MEM1(STACK_TOP), STACK(1));
5944
5945 if (opcode == OP_ASSERT || opcode == OP_ASSERTBACK)
5946 {
5947 /* Assert is failed. */
5948 if (conditional || bra == OP_BRAZERO)
5949 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5950
5951 if (framesize < 0)
5952 {
5953 /* The topmost item should be 0. */
5954 if (bra == OP_BRAZERO)
5955 {
5956 if (extrasize == 2)
5957 free_stack(common, 1);
5958 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5959 }
5960 else
5961 free_stack(common, extrasize);
5962 }
5963 else
5964 {
5965 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), STACK(extrasize - 1));
5966 /* The topmost item should be 0. */
5967 if (bra == OP_BRAZERO)
5968 {
5969 free_stack(common, framesize + extrasize - 1);
5970 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5971 }
5972 else
5973 free_stack(common, framesize + extrasize);
5974 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP1, 0);
5975 }
5976 jump = JUMP(SLJIT_JUMP);
5977 if (bra != OP_BRAZERO)
5978 add_jump(compiler, target, jump);
5979
5980 /* Assert is successful. */
5981 set_jumps(tmp, LABEL());
5982 if (framesize < 0)
5983 {
5984 /* We know that STR_PTR was stored on the top of the stack. */
5985 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), (extrasize - 1) * sizeof(sljit_sw));
5986 /* Keep the STR_PTR on the top of the stack. */
5987 if (bra == OP_BRAZERO)
5988 {
5989 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_sw));
5990 if (extrasize == 2)
5991 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5992 }
5993 else if (bra == OP_BRAMINZERO)
5994 {
5995 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_sw));
5996 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5997 }
5998 }
5999 else
6000 {
6001 if (bra == OP_BRA)
6002 {
6003 /* We don't need to keep the STR_PTR, only the previous private_data_ptr. */
6004 OP2(SLJIT_ADD, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_IMM, (framesize + 1) * sizeof(sljit_sw));
6005 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), (extrasize - 2) * sizeof(sljit_sw));
6006 }
6007 else
6008 {
6009 /* We don't need to keep the STR_PTR, only the previous private_data_ptr. */
6010 OP2(SLJIT_ADD, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_IMM, (framesize + 2) * sizeof(sljit_sw));
6011 if (extrasize == 2)
6012 {
6013 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
6014 if (bra == OP_BRAMINZERO)
6015 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
6016 }
6017 else
6018 {
6019 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), 0);
6020 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), bra == OP_BRAZERO ? STR_PTR : SLJIT_IMM, 0);
6021 }
6022 }
6023 }
6024
6025 if (bra == OP_BRAZERO)
6026 {
6027 backtrack->matchingpath = LABEL();
6028 SET_LABEL(jump, backtrack->matchingpath);
6029 }
6030 else if (bra == OP_BRAMINZERO)
6031 {
6032 JUMPTO(SLJIT_JUMP, backtrack->matchingpath);
6033 JUMPHERE(brajump);
6034 if (framesize >= 0)
6035 {
6036 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6037 add_jump(compiler, &common->revertframes, JUMP(SLJIT_FAST_CALL));
6038 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_MEM1(STACK_TOP), framesize * sizeof(sljit_sw));
6039 }
6040 set_jumps(backtrack->common.topbacktracks, LABEL());
6041 }
6042 }
6043 else
6044 {
6045 /* AssertNot is successful. */
6046 if (framesize < 0)
6047 {
6048 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
6049 if (bra != OP_BRA)
6050 {
6051 if (extrasize == 2)
6052 free_stack(common, 1);
6053 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
6054 }
6055 else
6056 free_stack(common, extrasize);
6057 }
6058 else
6059 {
6060 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
6061 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), STACK(extrasize - 1));
6062 /* The topmost item should be 0. */
6063 if (bra != OP_BRA)
6064 {
6065 free_stack(common, framesize + extrasize - 1);
6066 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
6067 }
6068 else
6069 free_stack(common, framesize + extrasize);
6070 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP1, 0);
6071 }
6072
6073 if (bra == OP_BRAZERO)
6074 backtrack->matchingpath = LABEL();
6075 else if (bra == OP_BRAMINZERO)
6076 {
6077 JUMPTO(SLJIT_JUMP, backtrack->matchingpath);
6078 JUMPHERE(brajump);
6079 }
6080
6081 if (bra != OP_BRA)
6082 {
6083 SLJIT_ASSERT(found == &backtrack->common.topbacktracks);
6084 set_jumps(backtrack->common.topbacktracks, LABEL());
6085 backtrack->common.topbacktracks = NULL;
6086 }
6087 }
6088
6089 if (opcode == OP_ASSERT_NOT || opcode == OP_ASSERTBACK_NOT)
6090 {
6091 common->local_exit = save_local_exit;
6092 common->quit_label = save_quit_label;
6093 common->quit = save_quit;
6094 }
6095 common->positive_assert = save_positive_assert;
6096 common->then_trap = save_then_trap;
6097 common->accept_label = save_accept_label;
6098 common->positive_assert_quit = save_positive_assert_quit;
6099 common->accept = save_accept;
6100 return cc + 1 + LINK_SIZE;
6101 }
6102
6103 static SLJIT_INLINE void match_once_common(compiler_common *common, pcre_uchar ket, int framesize, int private_data_ptr, BOOL has_alternatives, BOOL needs_control_head)
6104 {
6105 DEFINE_COMPILER;
6106 int stacksize;
6107
6108 if (framesize < 0)
6109 {
6110 if (framesize == no_frame)
6111 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6112 else
6113 {
6114 stacksize = needs_control_head ? 1 : 0;
6115 if (ket != OP_KET || has_alternatives)
6116 stacksize++;
6117 free_stack(common, stacksize);
6118 }
6119
6120 if (needs_control_head)
6121 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), (ket != OP_KET || has_alternatives) ? sizeof(sljit_sw) : 0);
6122
6123 /* TMP2 which is set here used by OP_KETRMAX below. */
6124 if (ket == OP_KETRMAX)
6125 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(STACK_TOP), 0);
6126 else if (ket == OP_KETRMIN)
6127 {
6128 /* Move the STR_PTR to the private_data_ptr. */
6129 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_MEM1(STACK_TOP), 0);
6130 }
6131 }
6132 else
6133 {
6134 stacksize = (ket != OP_KET || has_alternatives) ? 2 : 1;
6135 OP2(SLJIT_ADD, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_IMM, (framesize + stacksize) * sizeof(sljit_sw));
6136 if (needs_control_head)
6137 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), 0);
6138
6139 if (ket == OP_KETRMAX)
6140 {
6141 /* TMP2 which is set here used by OP_KETRMAX below. */
6142 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
6143 }
6144 }
6145 if (needs_control_head)
6146 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr, TMP1, 0);
6147 }
6148
6149 static SLJIT_INLINE int match_capture_common(compiler_common *common, int stacksize, int offset, int private_data_ptr)
6150 {
6151 DEFINE_COMPILER;
6152
6153 if (common->capture_last_ptr != 0)
6154 {
6155 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->capture_last_ptr);
6156 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->capture_last_ptr, SLJIT_IMM, offset >> 1);
6157 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), TMP1, 0);
6158 stacksize++;
6159 }
6160 if (common->optimized_cbracket[offset >> 1] == 0)
6161 {
6162 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
6163 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
6164 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), TMP1, 0);
6165 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6166 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize + 1), TMP2, 0);
6167 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1), STR_PTR, 0);
6168 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset), TMP1, 0);
6169 stacksize += 2;
6170 }
6171 return stacksize;
6172 }
6173
6174 /*
6175 Handling bracketed expressions is probably the most complex part.
6176
6177 Stack layout naming characters:
6178 S - Push the current STR_PTR
6179 0 - Push a 0 (NULL)
6180 A - Push the current STR_PTR. Needed for restoring the STR_PTR
6181 before the next alternative. Not pushed if there are no alternatives.
6182 M - Any values pushed by the current alternative. Can be empty, or anything.
6183 C - Push the previous OVECTOR(i), OVECTOR(i+1) and OVECTOR_PRIV(i) to the stack.
6184 L - Push the previous local (pointed by localptr) to the stack
6185 () - opional values stored on the stack
6186 ()* - optonal, can be stored multiple times
6187
6188 The following list shows the regular expression templates, their PCRE byte codes
6189 and stack layout supported by pcre-sljit.
6190
6191 (?:) OP_BRA | OP_KET A M
6192 () OP_CBRA | OP_KET C M
6193 (?:)+ OP_BRA | OP_KETRMAX 0 A M S ( A M S )*
6194 OP_SBRA | OP_KETRMAX 0 L M S ( L M S )*
6195 (?:)+? OP_BRA | OP_KETRMIN 0 A M S ( A M S )*
6196 OP_SBRA | OP_KETRMIN 0 L M S ( L M S )*
6197 ()+ OP_CBRA | OP_KETRMAX 0 C M S ( C M S )*
6198 OP_SCBRA | OP_KETRMAX 0 C M S ( C M S )*
6199 ()+? OP_CBRA | OP_KETRMIN 0 C M S ( C M S )*
6200 OP_SCBRA | OP_KETRMIN 0 C M S ( C M S )*
6201 (?:)? OP_BRAZERO | OP_BRA | OP_KET S ( A M 0 )
6202 (?:)?? OP_BRAMINZERO | OP_BRA | OP_KET S ( A M 0 )
6203 ()? OP_BRAZERO | OP_CBRA | OP_KET S ( C M 0 )
6204 ()?? OP_BRAMINZERO | OP_CBRA | OP_KET S ( C M 0 )
6205 (?:)* OP_BRAZERO | OP_BRA | OP_KETRMAX S 0 ( A M S )*
6206 OP_BRAZERO | OP_SBRA | OP_KETRMAX S 0 ( L M S )*
6207 (?:)*? OP_BRAMINZERO | OP_BRA | OP_KETRMIN S 0 ( A M S )*
6208 OP_BRAMINZERO | OP_SBRA | OP_KETRMIN S 0 ( L M S )*
6209 ()* OP_BRAZERO | OP_CBRA | OP_KETRMAX S 0 ( C M S )*
6210 OP_BRAZERO | OP_SCBRA | OP_KETRMAX S 0 ( C M S )*
6211 ()*? OP_BRAMINZERO | OP_CBRA | OP_KETRMIN S 0 ( C M S )*
6212 OP_BRAMINZERO | OP_SCBRA | OP_KETRMIN S 0 ( C M S )*
6213
6214
6215 Stack layout naming characters:
6216 A - Push the alternative index (starting from 0) on the stack.
6217 Not pushed if there is no alternatives.
6218 M - Any values pushed by the current alternative. Can be empty, or anything.
6219
6220 The next list shows the possible content of a bracket:
6221 (|) OP_*BRA | OP_ALT ... M A
6222 (?()|) OP_*COND | OP_ALT M A
6223 (?>|) OP_ONCE | OP_ALT ... [stack trace] M A
6224 (?>|) OP_ONCE_NC | OP_ALT ... [stack trace] M A
6225 Or nothing, if trace is unnecessary
6226 */
6227
6228 static pcre_uchar *compile_bracket_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
6229 {
6230 DEFINE_COMPILER;
6231 backtrack_common *backtrack;
6232 pcre_uchar opcode;
6233 int private_data_ptr = 0;
6234 int offset = 0;
6235 int i, stacksize;
6236 int repeat_ptr = 0, repeat_length = 0;
6237 int repeat_type = 0, repeat_count = 0;
6238 pcre_uchar *ccbegin;
6239 pcre_uchar *matchingpath;
6240 pcre_uchar *slot;
6241 pcre_uchar bra = OP_BRA;
6242 pcre_uchar ket;
6243 assert_backtrack *assert;
6244 BOOL has_alternatives;
6245 BOOL needs_control_head = FALSE;
6246 struct sljit_jump *jump;
6247 struct sljit_jump *skip;
6248 struct sljit_label *rmax_label = NULL;
6249 struct sljit_jump *braminzero = NULL;
6250
6251 PUSH_BACKTRACK(sizeof(bracket_backtrack), cc, NULL);
6252
6253 if (*cc == OP_BRAZERO || *cc == OP_BRAMINZERO)
6254 {
6255 bra = *cc;
6256 cc++;
6257 opcode = *cc;
6258 }
6259
6260 opcode = *cc;
6261 ccbegin = cc;
6262 matchingpath = bracketend(cc) - 1 - LINK_SIZE;
6263 ket = *matchingpath;
6264 if (ket == OP_KET && PRIVATE_DATA(matchingpath) != 0)
6265 {
6266 repeat_ptr = PRIVATE_DATA(matchingpath);
6267 repeat_length = PRIVATE_DATA(matchingpath + 1);
6268 repeat_type = PRIVATE_DATA(matchingpath + 2);
6269 repeat_count = PRIVATE_DATA(matchingpath + 3);
6270 SLJIT_ASSERT(repeat_length != 0 && repeat_type != 0 && repeat_count != 0);
6271 if (repeat_type == OP_UPTO)
6272 ket = OP_KETRMAX;
6273 if (repeat_type == OP_MINUPTO)
6274 ket = OP_KETRMIN;
6275 }
6276
6277 if ((opcode == OP_COND || opcode == OP_SCOND) && cc[1 + LINK_SIZE] == OP_DEF)
6278 {
6279 /* Drop this bracket_backtrack. */
6280 parent->top = backtrack->prev;
6281 return matchingpath + 1 + LINK_SIZE + repeat_length;
6282 }
6283
6284 matchingpath = ccbegin + 1 + LINK_SIZE;
6285 SLJIT_ASSERT(ket == OP_KET || ket == OP_KETRMAX || ket == OP_KETRMIN);
6286 SLJIT_ASSERT(!((bra == OP_BRAZERO && ket == OP_KETRMIN) || (bra == OP_BRAMINZERO && ket == OP_KETRMAX)));
6287 cc += GET(cc, 1);
6288
6289 has_alternatives = *cc == OP_ALT;
6290 if (SLJIT_UNLIKELY(opcode == OP_COND || opcode == OP_SCOND))
6291 has_alternatives = (*matchingpath == OP_RREF || *matchingpath == OP_DNRREF) ? FALSE : TRUE;
6292
6293 if (SLJIT_UNLIKELY(opcode == OP_COND) && (*cc == OP_KETRMAX || *cc == OP_KETRMIN))
6294 opcode = OP_SCOND;
6295 if (SLJIT_UNLIKELY(opcode == OP_ONCE_NC))
6296 opcode = OP_ONCE;
6297
6298 if (opcode == OP_CBRA || opcode == OP_SCBRA)
6299 {
6300 /* Capturing brackets has a pre-allocated space. */
6301 offset = GET2(ccbegin, 1 + LINK_SIZE);
6302 if (common->optimized_cbracket[offset] == 0)
6303 {
6304 private_data_ptr = OVECTOR_PRIV(offset);
6305 offset <<= 1;
6306 }
6307 else
6308 {
6309 offset <<= 1;
6310 private_data_ptr = OVECTOR(offset);
6311 }
6312 BACKTRACK_AS(bracket_backtrack)->private_data_ptr = private_data_ptr;
6313 matchingpath += IMM2_SIZE;
6314 }
6315 else if (opcode == OP_ONCE || opcode == OP_SBRA || opcode == OP_SCOND)
6316 {
6317 /* Other brackets simply allocate the next entry. */
6318 private_data_ptr = PRIVATE_DATA(ccbegin);
6319 SLJIT_ASSERT(private_data_ptr != 0);
6320 BACKTRACK_AS(bracket_backtrack)->private_data_ptr = private_data_ptr;
6321 if (opcode == OP_ONCE)
6322 BACKTRACK_AS(bracket_backtrack)->u.framesize = get_framesize(common, ccbegin, NULL, FALSE, &needs_control_head);
6323 }
6324
6325 /* Instructions before the first alternative. */
6326 stacksize = 0;
6327 if (ket == OP_KETRMAX || (ket == OP_KETRMIN && bra != OP_BRAMINZERO))
6328 stacksize++;
6329 if (bra == OP_BRAZERO)
6330 stacksize++;
6331
6332 if (stacksize > 0)
6333 allocate_stack(common, stacksize);
6334
6335 stacksize = 0;
6336 if (ket == OP_KETRMAX || (ket == OP_KETRMIN && bra != OP_BRAMINZERO))
6337 {
6338 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), SLJIT_IMM, 0);
6339 stacksize++;
6340 }
6341
6342 if (bra == OP_BRAZERO)
6343 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), STR_PTR, 0);
6344
6345 if (bra == OP_BRAMINZERO)
6346 {
6347 /* This is a backtrack path! (Since the try-path of OP_BRAMINZERO matches to the empty string) */
6348 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
6349 if (ket != OP_KETRMIN)
6350 {
6351 free_stack(common, 1);
6352 braminzero = CMP(SLJIT_C_EQUAL, STR_PTR, 0, SLJIT_IMM, 0);
6353 }
6354 else
6355 {
6356 if (opcode == OP_ONCE || opcode >= OP_SBRA)
6357 {
6358 jump = CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, SLJIT_IMM, 0);
6359 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(1));
6360 /* Nothing stored during the first run. */
6361 skip = JUMP(SLJIT_JUMP);
6362 JUMPHERE(jump);
6363 /* Checking zero-length iteration. */
6364 if (opcode != OP_ONCE || BACKTRACK_AS(bracket_backtrack)->u.framesize < 0)
6365 {
6366 /* When we come from outside, private_data_ptr contains the previous STR_PTR. */
6367 braminzero = CMP(SLJIT_C_EQUAL, STR_PTR, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6368 }
6369 else
6370 {
6371 /* Except when the whole stack frame must be saved. */
6372 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6373 braminzero = CMP(SLJIT_C_EQUAL, STR_PTR, 0, SLJIT_MEM1(TMP1), (BACKTRACK_AS(bracket_backtrack)->u.framesize + 1) * sizeof(sljit_sw));
6374 }
6375 JUMPHERE(skip);
6376 }
6377 else
6378 {
6379 jump = CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, SLJIT_IMM, 0);
6380 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(1));
6381 JUMPHERE(jump);
6382 }
6383 }
6384 }
6385
6386 if (repeat_type != 0)
6387 {
6388 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), repeat_ptr, SLJIT_IMM, repeat_count);
6389 if (repeat_type == OP_EXACT)
6390 rmax_label = LABEL();
6391 }
6392
6393 if (ket == OP_KETRMIN)
6394 BACKTRACK_AS(bracket_backtrack)->recursive_matchingpath = LABEL();
6395
6396 if (ket == OP_KETRMAX)
6397 {
6398 rmax_label = LABEL();
6399 if (has_alternatives && opcode != OP_ONCE && opcode < OP_SBRA && repeat_type == 0)
6400 BACKTRACK_AS(bracket_backtrack)->alternative_matchingpath = rmax_label;
6401 }
6402
6403 /* Handling capturing brackets and alternatives. */
6404 if (opcode == OP_ONCE)
6405 {
6406 stacksize = 0;
6407 if (needs_control_head)
6408 {
6409 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->control_head_ptr);
6410 stacksize++;
6411 }
6412
6413 if (BACKTRACK_AS(bracket_backtrack)->u.framesize < 0)
6414 {
6415 /* Neither capturing brackets nor recursions are found in the block. */
6416 if (ket == OP_KETRMIN)
6417 {
6418 stacksize += 2;
6419 if (!needs_control_head)
6420 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6421 }
6422 else
6423 {
6424 if (BACKTRACK_AS(bracket_backtrack)->u.framesize == no_frame)
6425 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STACK_TOP, 0);
6426 if (ket == OP_KETRMAX || has_alternatives)
6427 stacksize++;
6428 }
6429
6430 if (stacksize > 0)
6431 allocate_stack(common, stacksize);
6432
6433 stacksize = 0;
6434 if (needs_control_head)
6435 {
6436 stacksize++;
6437 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
6438 }
6439
6440 if (ket == OP_KETRMIN)
6441 {
6442 if (needs_control_head)
6443 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6444 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), STR_PTR, 0);
6445 if (BACKTRACK_AS(bracket_backtrack)->u.framesize == no_frame)
6446 OP2(SLJIT_SUB, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STACK_TOP, 0, SLJIT_IMM, needs_control_head ? (2 * sizeof(sljit_sw)) : sizeof(sljit_sw));
6447 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize + 1), TMP2, 0);
6448 }
6449 else if (ket == OP_KETRMAX || has_alternatives)
6450 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), STR_PTR, 0);
6451 }
6452 else
6453 {
6454 if (ket != OP_KET || has_alternatives)
6455 stacksize++;
6456
6457 stacksize += BACKTRACK_AS(bracket_backtrack)->u.framesize + 1;
6458 allocate_stack(common, stacksize);
6459
6460 if (needs_control_head)
6461 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
6462
6463 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6464 OP2(SLJIT_SUB, TMP2, 0, STACK_TOP, 0, SLJIT_IMM, stacksize * sizeof(sljit_sw));
6465
6466 stacksize = needs_control_head ? 1 : 0;
6467 if (ket != OP_KET || has_alternatives)
6468 {
6469 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), STR_PTR, 0);
6470 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP2, 0);
6471 stacksize++;
6472 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), TMP1, 0);
6473 }
6474 else
6475 {
6476 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP2, 0);
6477 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), TMP1, 0);
6478 }
6479 init_frame(common, ccbegin, NULL, BACKTRACK_AS(bracket_backtrack)->u.framesize + stacksize, stacksize + 1, FALSE);
6480 }
6481 }
6482 else if (opcode == OP_CBRA || opcode == OP_SCBRA)
6483 {
6484 /* Saving the previous values. */
6485 if (common->optimized_cbracket[offset >> 1] != 0)
6486 {
6487 SLJIT_ASSERT(private_data_ptr == OVECTOR(offset));
6488 allocate_stack(common, 2);
6489 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6490 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr + sizeof(sljit_sw));
6491 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STR_PTR, 0);
6492 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP1, 0);
6493 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP2, 0);
6494 }
6495 else
6496 {
6497 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6498 allocate_stack(common, 1);
6499 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STR_PTR, 0);
6500 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
6501 }
6502 }
6503 else if (opcode == OP_SBRA || opcode == OP_SCOND)
6504 {
6505 /* Saving the previous value. */
6506 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6507 allocate_stack(common, 1);
6508 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STR_PTR, 0);
6509 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
6510 }
6511 else if (has_alternatives)
6512 {
6513 /* Pushing the starting string pointer. */
6514 allocate_stack(common, 1);
6515 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
6516 }
6517
6518 /* Generating code for the first alternative. */
6519 if (opcode == OP_COND || opcode == OP_SCOND)
6520 {
6521 if (*matchingpath == OP_CREF)
6522 {
6523 SLJIT_ASSERT(has_alternatives);
6524 add_jump(compiler, &(BACKTRACK_AS(bracket_backtrack)->u.condfailed),
6525 CMP(SLJIT_C_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(GET2(matchingpath, 1) << 1), SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1)));
6526 matchingpath += 1 + IMM2_SIZE;
6527 }
6528 else if (*matchingpath == OP_DNCREF)
6529 {
6530 SLJIT_ASSERT(has_alternatives);
6531
6532 i = GET2(matchingpath, 1 + IMM2_SIZE);
6533 slot = common->name_table + GET2(matchingpath, 1) * common->name_entry_size;
6534 OP1(SLJIT_MOV, TMP3, 0, STR_PTR, 0);
6535 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1));
6536 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(GET2(slot, 0) << 1), TMP1, 0);
6537 slot += common->name_entry_size;
6538 i--;
6539 while (i-- > 0)
6540 {
6541 OP2(SLJIT_SUB, STR_PTR, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(GET2(slot, 0) << 1), TMP1, 0);
6542 OP2(SLJIT_OR | SLJIT_SET_E, TMP2, 0, TMP2, 0, STR_PTR, 0);
6543 slot += common->name_entry_size;
6544 }
6545 OP1(SLJIT_MOV, STR_PTR, 0, TMP3, 0);
6546 add_jump(compiler, &(BACKTRACK_AS(bracket_backtrack)->u.condfailed), JUMP(SLJIT_C_ZERO));
6547 matchingpath += 1 + 2 * IMM2_SIZE;
6548 }
6549 else if (*matchingpath == OP_RREF || *matchingpath == OP_DNRREF)
6550 {
6551 /* Never has other case. */
6552 BACKTRACK_AS(bracket_backtrack)->u.condfailed = NULL;
6553 SLJIT_ASSERT(!has_alternatives);
6554
6555 if (*matchingpath == OP_RREF)
6556 {
6557 stacksize = GET2(matchingpath, 1);
6558 if (common->currententry == NULL)
6559 stacksize = 0;
6560 else if (stacksize == RREF_ANY)
6561 stacksize = 1;
6562 else if (common->currententry->start == 0)
6563 stacksize = stacksize == 0;
6564 else
6565 stacksize = stacksize == (int)GET2(common->start, common->currententry->start + 1 + LINK_SIZE);
6566
6567 if (stacksize != 0)
6568 matchingpath += 1 + IMM2_SIZE;
6569 }
6570 else
6571 {
6572 if (common->currententry == NULL || common->currententry->start == 0)
6573 stacksize = 0;
6574 else
6575 {
6576 stacksize = GET2(matchingpath, 1 + IMM2_SIZE);
6577 slot = common->name_table + GET2(matchingpath, 1) * common->name_entry_size;
6578 i = (int)GET2(common->start, common->currententry->start + 1 + LINK_SIZE);
6579 while (stacksize > 0)
6580 {
6581 if ((int)GET2(slot, 0) == i)
6582 break;
6583 slot += common->name_entry_size;
6584 stacksize--;
6585 }
6586 }
6587
6588 if (stacksize != 0)
6589 matchingpath += 1 + 2 * IMM2_SIZE;
6590 }
6591
6592 /* The stacksize == 0 is a common "else" case. */
6593 if (stacksize == 0)
6594 {
6595 if (*cc == OP_ALT)
6596 {
6597 matchingpath = cc + 1 + LINK_SIZE;
6598 cc += GET(cc, 1);
6599 }
6600 else
6601 matchingpath = cc;
6602 }
6603 }
6604 else
6605 {
6606 SLJIT_ASSERT(has_alternatives && *matchingpath >= OP_ASSERT && *matchingpath <= OP_ASSERTBACK_NOT);
6607 /* Similar code as PUSH_BACKTRACK macro. */
6608 assert = sljit_alloc_memory(compiler, sizeof(assert_backtrack));
6609 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
6610 return NULL;
6611 memset(assert, 0, sizeof(assert_backtrack));
6612 assert->common.cc = matchingpath;
6613 BACKTRACK_AS(bracket_backtrack)->u.assert = assert;
6614 matchingpath = compile_assert_matchingpath(common, matchingpath, assert, TRUE);
6615 }
6616 }
6617
6618 compile_matchingpath(common, matchingpath, cc, backtrack);
6619 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
6620 return NULL;
6621
6622 if (opcode == OP_ONCE)
6623 match_once_common(common, ket, BACKTRACK_AS(bracket_backtrack)->u.framesize, private_data_ptr, has_alternatives, needs_control_head);
6624
6625 stacksize = 0;
6626 if (repeat_type == OP_MINUPTO)
6627 {
6628 /* We need to preserve the counter. TMP2 will be used below. */
6629 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), repeat_ptr);
6630 stacksize++;
6631 }
6632 if (ket != OP_KET || bra != OP_BRA)
6633 stacksize++;
6634 if (offset != 0)
6635 {
6636 if (common->capture_last_ptr != 0)
6637 stacksize++;
6638 if (common->optimized_cbracket[offset >> 1] == 0)
6639 stacksize += 2;
6640 }
6641 if (has_alternatives && opcode != OP_ONCE)
6642 stacksize++;
6643
6644 if (stacksize > 0)
6645 allocate_stack(common, stacksize);
6646
6647 stacksize = 0;
6648 if (repeat_type == OP_MINUPTO)
6649 {
6650 /* TMP2 was set above. */
6651 OP2(SLJIT_SUB, SLJIT_MEM1(STACK_TOP), STACK(stacksize), TMP2, 0, SLJIT_IMM, 1);
6652 stacksize++;
6653 }
6654
6655 if (ket != OP_KET || bra != OP_BRA)
6656 {
6657 if (ket != OP_KET)
6658 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), STR_PTR, 0);
6659 else
6660 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), SLJIT_IMM, 0);
6661 stacksize++;
6662 }
6663
6664 if (offset != 0)
6665 stacksize = match_capture_common(common, stacksize, offset, private_data_ptr);
6666
6667 if (has_alternatives)
6668 {
6669 if (opcode != OP_ONCE)
6670 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), SLJIT_IMM, 0);
6671 if (ket != OP_KETRMAX)
6672 BACKTRACK_AS(bracket_backtrack)->alternative_matchingpath = LABEL();
6673 }
6674
6675 /* Must be after the matchingpath label. */
6676 if (offset != 0 && common->optimized_cbracket[offset >> 1] != 0)
6677 {
6678 SLJIT_ASSERT(private_data_ptr == OVECTOR(offset + 0));
6679 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1), STR_PTR, 0);
6680 }
6681
6682 if (ket == OP_KETRMAX)
6683 {
6684 if (repeat_type != 0)
6685 {
6686 if (has_alternatives)
6687 BACKTRACK_AS(bracket_backtrack)->alternative_matchingpath = LABEL();
6688 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_MEM1(SLJIT_LOCALS_REG), repeat_ptr, SLJIT_MEM1(SLJIT_LOCALS_REG), repeat_ptr, SLJIT_IMM, 1);
6689 JUMPTO(SLJIT_C_NOT_ZERO, rmax_label);
6690 /* Drop STR_PTR for greedy plus quantifier. */
6691 if (opcode != OP_ONCE)
6692 free_stack(common, 1);
6693 }
6694 else if (opcode == OP_ONCE || opcode >= OP_SBRA)
6695 {
6696 if (has_alternatives)
6697 BACKTRACK_AS(bracket_backtrack)->alternative_matchingpath = LABEL();
6698 /* Checking zero-length iteration. */
6699 if (opcode != OP_ONCE)
6700 {
6701 CMPTO(SLJIT_C_NOT_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STR_PTR, 0, rmax_label);
6702 /* Drop STR_PTR for greedy plus quantifier. */
6703 if (bra != OP_BRAZERO)
6704 free_stack(common, 1);
6705 }
6706 else
6707 /* TMP2 must contain the starting STR_PTR. */
6708 CMPTO(SLJIT_C_NOT_EQUAL, TMP2, 0, STR_PTR, 0, rmax_label);
6709 }
6710 else
6711 JUMPTO(SLJIT_JUMP, rmax_label);
6712 BACKTRACK_AS(bracket_backtrack)->recursive_matchingpath = LABEL();
6713 }
6714
6715 if (repeat_type == OP_EXACT)
6716 {
6717 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_MEM1(SLJIT_LOCALS_REG), repeat_ptr, SLJIT_MEM1(SLJIT_LOCALS_REG), repeat_ptr, SLJIT_IMM, 1);
6718 JUMPTO(SLJIT_C_NOT_ZERO, rmax_label);
6719 }
6720 else if (repeat_type == OP_UPTO)
6721 {
6722 /* We need to preserve the counter. */
6723 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), repeat_ptr);
6724 allocate_stack(common, 1);
6725 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
6726 }
6727
6728 if (bra == OP_BRAZERO)