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