/[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 1040 - (show annotations)
Sun Sep 16 06:52:27 2012 UTC (7 years, 1 month ago) by zherczeg
File MIME type: text/plain
File size: 255869 byte(s)
Error occurred while calculating annotation data.
Improving the first n character searches.
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 #define MAX_N_CHARS 3
2567
2568 static SLJIT_INLINE BOOL fast_forward_first_n_chars(compiler_common *common, BOOL firstline)
2569 {
2570 DEFINE_COMPILER;
2571 struct sljit_label *start;
2572 struct sljit_jump *quit;
2573 pcre_int32 chars[MAX_N_CHARS * 2];
2574 pcre_uchar *cc = common->start + 1 + IMM2_SIZE;
2575 int location = 0;
2576 pcre_int32 len, c, bit, caseless;
2577 int must_stop;
2578
2579 /* We do not support alternatives now. */
2580 if (*(common->start + GET(common->start, 1)) == OP_ALT)
2581 return FALSE;
2582
2583 while (TRUE)
2584 {
2585 caseless = 0;
2586 must_stop = 1;
2587 switch(*cc)
2588 {
2589 case OP_CHAR:
2590 must_stop = 0;
2591 cc++;
2592 break;
2593
2594 case OP_CHARI:
2595 caseless = 1;
2596 must_stop = 0;
2597 cc++;
2598 break;
2599
2600 case OP_SOD:
2601 case OP_SOM:
2602 case OP_SET_SOM:
2603 case OP_NOT_WORD_BOUNDARY:
2604 case OP_WORD_BOUNDARY:
2605 case OP_EODN:
2606 case OP_EOD:
2607 case OP_CIRC:
2608 case OP_CIRCM:
2609 case OP_DOLL:
2610 case OP_DOLLM:
2611 /* Zero width assertions. */
2612 cc++;
2613 continue;
2614
2615 case OP_PLUS:
2616 case OP_MINPLUS:
2617 case OP_POSPLUS:
2618 cc++;
2619 break;
2620
2621 case OP_EXACT:
2622 cc += 1 + IMM2_SIZE;
2623 break;
2624
2625 case OP_PLUSI:
2626 case OP_MINPLUSI:
2627 case OP_POSPLUSI:
2628 caseless = 1;
2629 cc++;
2630 break;
2631
2632 case OP_EXACTI:
2633 caseless = 1;
2634 cc += 1 + IMM2_SIZE;
2635 break;
2636
2637 default:
2638 must_stop = 2;
2639 break;
2640 }
2641
2642 if (must_stop == 2)
2643 break;
2644
2645 len = 1;
2646 #ifdef SUPPORT_UTF
2647 if (common->utf && HAS_EXTRALEN(cc[0])) len += GET_EXTRALEN(cc[0]);
2648 #endif
2649
2650 if (caseless && char_has_othercase(common, cc))
2651 {
2652 caseless = char_get_othercase_bit(common, cc);
2653 if (caseless == 0)
2654 return FALSE;
2655 #ifdef COMPILE_PCRE8
2656 caseless = ((caseless & 0xff) << 8) | (len - (caseless >> 8));
2657 #else
2658 if ((caseless & 0x100) != 0)
2659 caseless = ((caseless & 0xff) << 16) | (len - (caseless >> 9));
2660 else
2661 caseless = ((caseless & 0xff) << 8) | (len - (caseless >> 9));
2662 #endif
2663 }
2664 else
2665 caseless = 0;
2666
2667 while (len > 0 && location < MAX_N_CHARS * 2)
2668 {
2669 c = *cc;
2670 bit = 0;
2671 if (len == (caseless & 0xff))
2672 {
2673 bit = caseless >> 8;
2674 c |= bit;
2675 }
2676
2677 chars[location] = c;
2678 chars[location + 1] = bit;
2679
2680 len--;
2681 location += 2;
2682 cc++;
2683 }
2684
2685 if (location >= MAX_N_CHARS * 2 || must_stop != 0)
2686 break;
2687 }
2688
2689 /* At least two characters are required. */
2690 if (location < 2 * 2)
2691 return FALSE;
2692
2693 if (firstline)
2694 {
2695 SLJIT_ASSERT(common->first_line_end != 0);
2696 OP1(SLJIT_MOV, TMP3, 0, STR_END, 0);
2697 OP2(SLJIT_SUB, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end, SLJIT_IMM, (location >> 1) - 1);
2698 }
2699 else
2700 OP2(SLJIT_SUB, STR_END, 0, STR_END, 0, SLJIT_IMM, (location >> 1) - 1);
2701
2702 start = LABEL();
2703 quit = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2704
2705 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
2706 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
2707 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2708 if (chars[1] != 0)
2709 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, chars[1]);
2710 CMPTO(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, chars[0], start);
2711 if (location > 2 * 2)
2712 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
2713 if (chars[3] != 0)
2714 OP2(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_IMM, chars[3]);
2715 CMPTO(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, chars[2], start);
2716 if (location > 2 * 2)
2717 {
2718 if (chars[5] != 0)
2719 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, chars[5]);
2720 CMPTO(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, chars[4], start);
2721 }
2722 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2723
2724 JUMPHERE(quit);
2725
2726 if (firstline)
2727 OP1(SLJIT_MOV, STR_END, 0, TMP3, 0);
2728 else
2729 OP2(SLJIT_ADD, STR_END, 0, STR_END, 0, SLJIT_IMM, (location >> 1) - 1);
2730 return TRUE;
2731 }
2732
2733 #undef MAX_N_CHARS
2734
2735 static SLJIT_INLINE void fast_forward_first_char(compiler_common *common, pcre_uchar first_char, BOOL caseless, BOOL firstline)
2736 {
2737 DEFINE_COMPILER;
2738 struct sljit_label *start;
2739 struct sljit_jump *quit;
2740 struct sljit_jump *found;
2741 pcre_uchar oc, bit;
2742
2743 if (firstline)
2744 {
2745 SLJIT_ASSERT(common->first_line_end != 0);
2746 OP1(SLJIT_MOV, TMP3, 0, STR_END, 0);
2747 OP1(SLJIT_MOV, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end);
2748 }
2749
2750 start = LABEL();
2751 quit = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2752 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
2753
2754 oc = first_char;
2755 if (caseless)
2756 {
2757 oc = TABLE_GET(first_char, common->fcc, first_char);
2758 #if defined SUPPORT_UCP && !(defined COMPILE_PCRE8)
2759 if (first_char > 127 && common->utf)
2760 oc = UCD_OTHERCASE(first_char);
2761 #endif
2762 }
2763 if (first_char == oc)
2764 found = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, first_char);
2765 else
2766 {
2767 bit = first_char ^ oc;
2768 if (ispowerof2(bit))
2769 {
2770 OP2(SLJIT_OR, TMP2, 0, TMP1, 0, SLJIT_IMM, bit);
2771 found = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, first_char | bit);
2772 }
2773 else
2774 {
2775 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, first_char);
2776 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_EQUAL);
2777 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, oc);
2778 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_EQUAL);
2779 found = JUMP(SLJIT_C_NOT_ZERO);
2780 }
2781 }
2782
2783 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2784 JUMPTO(SLJIT_JUMP, start);
2785 JUMPHERE(found);
2786 JUMPHERE(quit);
2787
2788 if (firstline)
2789 OP1(SLJIT_MOV, STR_END, 0, TMP3, 0);
2790 }
2791
2792 static SLJIT_INLINE void fast_forward_newline(compiler_common *common, BOOL firstline)
2793 {
2794 DEFINE_COMPILER;
2795 struct sljit_label *loop;
2796 struct sljit_jump *lastchar;
2797 struct sljit_jump *firstchar;
2798 struct sljit_jump *quit;
2799 struct sljit_jump *foundcr = NULL;
2800 struct sljit_jump *notfoundnl;
2801 jump_list *newline = NULL;
2802
2803 if (firstline)
2804 {
2805 SLJIT_ASSERT(common->first_line_end != 0);
2806 OP1(SLJIT_MOV, TMP3, 0, STR_END, 0);
2807 OP1(SLJIT_MOV, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end);
2808 }
2809
2810 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
2811 {
2812 lastchar = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2813 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
2814 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, str));
2815 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
2816 firstchar = CMP(SLJIT_C_LESS_EQUAL, STR_PTR, 0, TMP2, 0);
2817
2818 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, IN_UCHARS(2));
2819 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, STR_PTR, 0, TMP1, 0);
2820 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_GREATER_EQUAL);
2821 #ifdef COMPILE_PCRE16
2822 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, 1);
2823 #endif
2824 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
2825
2826 loop = LABEL();
2827 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2828 quit = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2829 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(-2));
2830 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(-1));
2831 CMPTO(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff, loop);
2832 CMPTO(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, common->newline & 0xff, loop);
2833
2834 JUMPHERE(quit);
2835 JUMPHERE(firstchar);
2836 JUMPHERE(lastchar);
2837
2838 if (firstline)
2839 OP1(SLJIT_MOV, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0);
2840 return;
2841 }
2842
2843 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
2844 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, str));
2845 firstchar = CMP(SLJIT_C_LESS_EQUAL, STR_PTR, 0, TMP2, 0);
2846 skip_char_back(common);
2847
2848 loop = LABEL();
2849 read_char(common);
2850 lastchar = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2851 if (common->nltype == NLTYPE_ANY || common->nltype == NLTYPE_ANYCRLF)
2852 foundcr = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_CR);
2853 check_newlinechar(common, common->nltype, &newline, FALSE);
2854 set_jumps(newline, loop);
2855
2856 if (common->nltype == NLTYPE_ANY || common->nltype == NLTYPE_ANYCRLF)
2857 {
2858 quit = JUMP(SLJIT_JUMP);
2859 JUMPHERE(foundcr);
2860 notfoundnl = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2861 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
2862 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, CHAR_NL);
2863 COND_VALUE(SLJIT_MOV, TMP1, 0, SLJIT_C_EQUAL);
2864 #ifdef COMPILE_PCRE16
2865 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
2866 #endif
2867 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
2868 JUMPHERE(notfoundnl);
2869 JUMPHERE(quit);
2870 }
2871 JUMPHERE(lastchar);
2872 JUMPHERE(firstchar);
2873
2874 if (firstline)
2875 OP1(SLJIT_MOV, STR_END, 0, TMP3, 0);
2876 }
2877
2878 static SLJIT_INLINE void fast_forward_start_bits(compiler_common *common, sljit_uw start_bits, BOOL firstline)
2879 {
2880 DEFINE_COMPILER;
2881 struct sljit_label *start;
2882 struct sljit_jump *quit;
2883 struct sljit_jump *found;
2884 #ifndef COMPILE_PCRE8
2885 struct sljit_jump *jump;
2886 #endif
2887
2888 if (firstline)
2889 {
2890 SLJIT_ASSERT(common->first_line_end != 0);
2891 OP1(SLJIT_MOV, RETURN_ADDR, 0, STR_END, 0);
2892 OP1(SLJIT_MOV, STR_END, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->first_line_end);
2893 }
2894
2895 start = LABEL();
2896 quit = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
2897 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
2898 #ifdef SUPPORT_UTF
2899 if (common->utf)
2900 OP1(SLJIT_MOV, TMP3, 0, TMP1, 0);
2901 #endif
2902 #ifndef COMPILE_PCRE8
2903 jump = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 255);
2904 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, 255);
2905 JUMPHERE(jump);
2906 #endif
2907 OP2(SLJIT_AND, TMP2, 0, TMP1, 0, SLJIT_IMM, 0x7);
2908 OP2(SLJIT_LSHR, TMP1, 0, TMP1, 0, SLJIT_IMM, 3);
2909 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), start_bits);
2910 OP2(SLJIT_SHL, TMP2, 0, SLJIT_IMM, 1, TMP2, 0);
2911 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, TMP2, 0);
2912 found = JUMP(SLJIT_C_NOT_ZERO);
2913
2914 #ifdef SUPPORT_UTF
2915 if (common->utf)
2916 OP1(SLJIT_MOV, TMP1, 0, TMP3, 0);
2917 #endif
2918 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2919 #if defined SUPPORT_UTF && defined COMPILE_PCRE8
2920 if (common->utf)
2921 {
2922 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xc0, start);
2923 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_w)PRIV(utf8_table4) - 0xc0);
2924 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
2925 }
2926 #endif
2927 #if defined SUPPORT_UTF && defined COMPILE_PCRE16
2928 if (common->utf)
2929 {
2930 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xd800, start);
2931 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0xfc00);
2932 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xd800);
2933 COND_VALUE(SLJIT_MOV, TMP1, 0, SLJIT_C_EQUAL);
2934 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
2935 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
2936 }
2937 #endif
2938 JUMPTO(SLJIT_JUMP, start);
2939 JUMPHERE(found);
2940 JUMPHERE(quit);
2941
2942 if (firstline)
2943 OP1(SLJIT_MOV, STR_END, 0, RETURN_ADDR, 0);
2944 }
2945
2946 static SLJIT_INLINE struct sljit_jump *search_requested_char(compiler_common *common, pcre_uchar req_char, BOOL caseless, BOOL has_firstchar)
2947 {
2948 DEFINE_COMPILER;
2949 struct sljit_label *loop;
2950 struct sljit_jump *toolong;
2951 struct sljit_jump *alreadyfound;
2952 struct sljit_jump *found;
2953 struct sljit_jump *foundoc = NULL;
2954 struct sljit_jump *notfound;
2955 pcre_uchar oc, bit;
2956
2957 SLJIT_ASSERT(common->req_char_ptr != 0);
2958 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->req_char_ptr);
2959 OP2(SLJIT_ADD, TMP1, 0, STR_PTR, 0, SLJIT_IMM, REQ_BYTE_MAX);
2960 toolong = CMP(SLJIT_C_LESS, TMP1, 0, STR_END, 0);
2961 alreadyfound = CMP(SLJIT_C_LESS, STR_PTR, 0, TMP2, 0);
2962
2963 if (has_firstchar)
2964 OP2(SLJIT_ADD, TMP1, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
2965 else
2966 OP1(SLJIT_MOV, TMP1, 0, STR_PTR, 0);
2967
2968 loop = LABEL();
2969 notfound = CMP(SLJIT_C_GREATER_EQUAL, TMP1, 0, STR_END, 0);
2970
2971 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(TMP1), 0);
2972 oc = req_char;
2973 if (caseless)
2974 {
2975 oc = TABLE_GET(req_char, common->fcc, req_char);
2976 #if defined SUPPORT_UCP && !(defined COMPILE_PCRE8)
2977 if (req_char > 127 && common->utf)
2978 oc = UCD_OTHERCASE(req_char);
2979 #endif
2980 }
2981 if (req_char == oc)
2982 found = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, req_char);
2983 else
2984 {
2985 bit = req_char ^ oc;
2986 if (ispowerof2(bit))
2987 {
2988 OP2(SLJIT_OR, TMP2, 0, TMP2, 0, SLJIT_IMM, bit);
2989 found = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, req_char | bit);
2990 }
2991 else
2992 {
2993 found = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, req_char);
2994 foundoc = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, oc);
2995 }
2996 }
2997 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, IN_UCHARS(1));
2998 JUMPTO(SLJIT_JUMP, loop);
2999
3000 JUMPHERE(found);
3001 if (foundoc)
3002 JUMPHERE(foundoc);
3003 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->req_char_ptr, TMP1, 0);
3004 JUMPHERE(alreadyfound);
3005 JUMPHERE(toolong);
3006 return notfound;
3007 }
3008
3009 static void do_revertframes(compiler_common *common)
3010 {
3011 DEFINE_COMPILER;
3012 struct sljit_jump *jump;
3013 struct sljit_label *mainloop;
3014
3015 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3016 OP1(SLJIT_MOV, TMP1, 0, STACK_TOP, 0);
3017 GET_LOCAL_BASE(TMP3, 0, 0);
3018
3019 /* Drop frames until we reach STACK_TOP. */
3020 mainloop = LABEL();
3021 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), 0);
3022 jump = CMP(SLJIT_C_SIG_LESS_EQUAL, TMP2, 0, SLJIT_IMM, frame_end);
3023 OP2(SLJIT_ADD, TMP2, 0, TMP2, 0, TMP3, 0);
3024 OP1(SLJIT_MOV, SLJIT_MEM1(TMP2), 0, SLJIT_MEM1(TMP1), sizeof(sljit_w));
3025 OP1(SLJIT_MOV, SLJIT_MEM1(TMP2), sizeof(sljit_w), SLJIT_MEM1(TMP1), 2 * sizeof(sljit_w));
3026 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 3 * sizeof(sljit_w));
3027 JUMPTO(SLJIT_JUMP, mainloop);
3028
3029 JUMPHERE(jump);
3030 jump = CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, frame_end);
3031 /* End of dropping frames. */
3032 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3033
3034 JUMPHERE(jump);
3035 jump = CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, frame_setstrbegin);
3036 /* Set string begin. */
3037 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), sizeof(sljit_w));
3038 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 2 * sizeof(sljit_w));
3039 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0), TMP2, 0);
3040 JUMPTO(SLJIT_JUMP, mainloop);
3041
3042 JUMPHERE(jump);
3043 if (common->mark_ptr != 0)
3044 {
3045 jump = CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, frame_setmark);
3046 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), sizeof(sljit_w));
3047 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 2 * sizeof(sljit_w));
3048 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mark_ptr, TMP2, 0);
3049 JUMPTO(SLJIT_JUMP, mainloop);
3050
3051 JUMPHERE(jump);
3052 }
3053
3054 /* Unknown command. */
3055 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 2 * sizeof(sljit_w));
3056 JUMPTO(SLJIT_JUMP, mainloop);
3057 }
3058
3059 static void check_wordboundary(compiler_common *common)
3060 {
3061 DEFINE_COMPILER;
3062 struct sljit_jump *skipread;
3063 #if !(defined COMPILE_PCRE8) || defined SUPPORT_UTF
3064 struct sljit_jump *jump;
3065 #endif
3066
3067 SLJIT_COMPILE_ASSERT(ctype_word == 0x10, ctype_word_must_be_16);
3068
3069 sljit_emit_fast_enter(compiler, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
3070 /* Get type of the previous char, and put it to LOCALS1. */
3071 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
3072 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
3073 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, SLJIT_IMM, 0);
3074 skipread = CMP(SLJIT_C_LESS_EQUAL, STR_PTR, 0, TMP1, 0);
3075 skip_char_back(common);
3076 check_start_used_ptr(common);
3077 read_char(common);
3078
3079 /* Testing char type. */
3080 #ifdef SUPPORT_UCP
3081 if (common->use_ucp)
3082 {
3083 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 1);
3084 jump = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_UNDERSCORE);
3085 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
3086 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ucp_Ll);
3087 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ucp_Lu - ucp_Ll);
3088 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_LESS_EQUAL);
3089 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ucp_Nd - ucp_Ll);
3090 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ucp_No - ucp_Nd);
3091 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_LESS_EQUAL);
3092 JUMPHERE(jump);
3093 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, TMP2, 0);
3094 }
3095 else
3096 #endif
3097 {
3098 #ifndef COMPILE_PCRE8
3099 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3100 #elif defined SUPPORT_UTF
3101 /* Here LOCALS1 has already been zeroed. */
3102 jump = NULL;
3103 if (common->utf)
3104 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3105 #endif /* COMPILE_PCRE8 */
3106 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), common->ctypes);
3107 OP2(SLJIT_LSHR, TMP1, 0, TMP1, 0, SLJIT_IMM, 4 /* ctype_word */);
3108 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
3109 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, TMP1, 0);
3110 #ifndef COMPILE_PCRE8
3111 JUMPHERE(jump);
3112 #elif defined SUPPORT_UTF
3113 if (jump != NULL)
3114 JUMPHERE(jump);
3115 #endif /* COMPILE_PCRE8 */
3116 }
3117 JUMPHERE(skipread);
3118
3119 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 0);
3120 skipread = check_str_end(common);
3121 peek_char(common);
3122
3123 /* Testing char type. This is a code duplication. */
3124 #ifdef SUPPORT_UCP
3125 if (common->use_ucp)
3126 {
3127 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 1);
3128 jump = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_UNDERSCORE);
3129 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
3130 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ucp_Ll);
3131 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ucp_Lu - ucp_Ll);
3132 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_LESS_EQUAL);
3133 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ucp_Nd - ucp_Ll);
3134 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ucp_No - ucp_Nd);
3135 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_LESS_EQUAL);
3136 JUMPHERE(jump);
3137 }
3138 else
3139 #endif
3140 {
3141 #ifndef COMPILE_PCRE8
3142 /* TMP2 may be destroyed by peek_char. */
3143 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 0);
3144 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3145 #elif defined SUPPORT_UTF
3146 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 0);
3147 jump = NULL;
3148 if (common->utf)
3149 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3150 #endif
3151 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP1), common->ctypes);
3152 OP2(SLJIT_LSHR, TMP2, 0, TMP2, 0, SLJIT_IMM, 4 /* ctype_word */);
3153 OP2(SLJIT_AND, TMP2, 0, TMP2, 0, SLJIT_IMM, 1);
3154 #ifndef COMPILE_PCRE8
3155 JUMPHERE(jump);
3156 #elif defined SUPPORT_UTF
3157 if (jump != NULL)
3158 JUMPHERE(jump);
3159 #endif /* COMPILE_PCRE8 */
3160 }
3161 JUMPHERE(skipread);
3162
3163 OP2(SLJIT_XOR | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1);
3164 sljit_emit_fast_return(compiler, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
3165 }
3166
3167 /*
3168 range format:
3169
3170 ranges[0] = length of the range (max MAX_RANGE_SIZE, -1 means invalid range).
3171 ranges[1] = first bit (0 or 1)
3172 ranges[2-length] = position of the bit change (when the current bit is not equal to the previous)
3173 */
3174
3175 static BOOL check_ranges(compiler_common *common, int *ranges, jump_list **backtracks, BOOL readch)
3176 {
3177 DEFINE_COMPILER;
3178 struct sljit_jump *jump;
3179
3180 if (ranges[0] < 0)
3181 return FALSE;
3182
3183 switch(ranges[0])
3184 {
3185 case 1:
3186 if (readch)
3187 read_char(common);
3188 add_jump(compiler, backtracks, CMP(ranges[1] == 0 ? SLJIT_C_LESS : SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, ranges[2]));
3189 return TRUE;
3190
3191 case 2:
3192 if (readch)
3193 read_char(common);
3194 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ranges[2]);
3195 add_jump(compiler, backtracks, CMP(ranges[1] != 0 ? SLJIT_C_LESS : SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, ranges[3] - ranges[2]));
3196 return TRUE;
3197
3198 case 4:
3199 if (ranges[2] + 1 == ranges[3] && ranges[4] + 1 == ranges[5])
3200 {
3201 if (readch)
3202 read_char(common);
3203 if (ranges[1] != 0)
3204 {
3205 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, ranges[2]));
3206 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, ranges[4]));
3207 }
3208 else
3209 {
3210 jump = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, ranges[2]);
3211 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, ranges[4]));
3212 JUMPHERE(jump);
3213 }
3214 return TRUE;
3215 }
3216 if ((ranges[3] - ranges[2]) == (ranges[5] - ranges[4]) && ispowerof2(ranges[4] - ranges[2]))
3217 {
3218 if (readch)
3219 read_char(common);
3220 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, ranges[4] - ranges[2]);
3221 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, ranges[4]);
3222 add_jump(compiler, backtracks, CMP(ranges[1] != 0 ? SLJIT_C_LESS : SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, ranges[5] - ranges[4]));
3223 return TRUE;
3224 }
3225 return FALSE;
3226
3227 default:
3228 return FALSE;
3229 }
3230 }
3231
3232 static void get_ctype_ranges(compiler_common *common, int flag, int *ranges)
3233 {
3234 int i, bit, length;
3235 const pcre_uint8 *ctypes = (const pcre_uint8*)common->ctypes;
3236
3237 bit = ctypes[0] & flag;
3238 ranges[0] = -1;
3239 ranges[1] = bit != 0 ? 1 : 0;
3240 length = 0;
3241
3242 for (i = 1; i < 256; i++)
3243 if ((ctypes[i] & flag) != bit)
3244 {
3245 if (length >= MAX_RANGE_SIZE)
3246 return;
3247 ranges[2 + length] = i;
3248 length++;
3249 bit ^= flag;
3250 }
3251
3252 if (bit != 0)
3253 {
3254 if (length >= MAX_RANGE_SIZE)
3255 return;
3256 ranges[2 + length] = 256;
3257 length++;
3258 }
3259 ranges[0] = length;
3260 }
3261
3262 static BOOL check_class_ranges(compiler_common *common, const pcre_uint8 *bits, BOOL nclass, jump_list **backtracks)
3263 {
3264 int ranges[2 + MAX_RANGE_SIZE];
3265 pcre_uint8 bit, cbit, all;
3266 int i, byte, length = 0;
3267
3268 bit = bits[0] & 0x1;
3269 ranges[1] = bit;
3270 /* Can be 0 or 255. */
3271 all = -bit;
3272
3273 for (i = 0; i < 256; )
3274 {
3275 byte = i >> 3;
3276 if ((i & 0x7) == 0 && bits[byte] == all)
3277 i += 8;
3278 else
3279 {
3280 cbit = (bits[byte] >> (i & 0x7)) & 0x1;
3281 if (cbit != bit)
3282 {
3283 if (length >= MAX_RANGE_SIZE)
3284 return FALSE;
3285 ranges[2 + length] = i;
3286 length++;
3287 bit = cbit;
3288 all = -cbit;
3289 }
3290 i++;
3291 }
3292 }
3293
3294 if (((bit == 0) && nclass) || ((bit == 1) && !nclass))
3295 {
3296 if (length >= MAX_RANGE_SIZE)
3297 return FALSE;
3298 ranges[2 + length] = 256;
3299 length++;
3300 }
3301 ranges[0] = length;
3302
3303 return check_ranges(common, ranges, backtracks, FALSE);
3304 }
3305
3306 static void check_anynewline(compiler_common *common)
3307 {
3308 /* Check whether TMP1 contains a newline character. TMP2 destroyed. */
3309 DEFINE_COMPILER;
3310
3311 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3312
3313 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x0a);
3314 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x0d - 0x0a);
3315 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_LESS_EQUAL);
3316 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x85 - 0x0a);
3317 #if defined SUPPORT_UTF || defined COMPILE_PCRE16
3318 #ifdef COMPILE_PCRE8
3319 if (common->utf)
3320 {
3321 #endif
3322 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_EQUAL);
3323 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x1);
3324 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x2029 - 0x0a);
3325 #ifdef COMPILE_PCRE8
3326 }
3327 #endif
3328 #endif /* SUPPORT_UTF || COMPILE_PCRE16 */
3329 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_EQUAL);
3330 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3331 }
3332
3333 static void check_hspace(compiler_common *common)
3334 {
3335 /* Check whether TMP1 contains a newline character. TMP2 destroyed. */
3336 DEFINE_COMPILER;
3337
3338 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3339
3340 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x09);
3341 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_EQUAL);
3342 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x20);
3343 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_EQUAL);
3344 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xa0);
3345 #if defined SUPPORT_UTF || defined COMPILE_PCRE16
3346 #ifdef COMPILE_PCRE8
3347 if (common->utf)
3348 {
3349 #endif
3350 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_EQUAL);
3351 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x1680);
3352 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_EQUAL);
3353 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x180e);
3354 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_EQUAL);
3355 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x2000);
3356 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x200A - 0x2000);
3357 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_LESS_EQUAL);
3358 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x202f - 0x2000);
3359 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_EQUAL);
3360 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x205f - 0x2000);
3361 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_EQUAL);
3362 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x3000 - 0x2000);
3363 #ifdef COMPILE_PCRE8
3364 }
3365 #endif
3366 #endif /* SUPPORT_UTF || COMPILE_PCRE16 */
3367 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_EQUAL);
3368
3369 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3370 }
3371
3372 static void check_vspace(compiler_common *common)
3373 {
3374 /* Check whether TMP1 contains a newline character. TMP2 destroyed. */
3375 DEFINE_COMPILER;
3376
3377 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3378
3379 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x0a);
3380 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x0d - 0x0a);
3381 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_LESS_EQUAL);
3382 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x85 - 0x0a);
3383 #if defined SUPPORT_UTF || defined COMPILE_PCRE16
3384 #ifdef COMPILE_PCRE8
3385 if (common->utf)
3386 {
3387 #endif
3388 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_EQUAL);
3389 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, 0x1);
3390 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0x2029 - 0x0a);
3391 #ifdef COMPILE_PCRE8
3392 }
3393 #endif
3394 #endif /* SUPPORT_UTF || COMPILE_PCRE16 */
3395 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_EQUAL);
3396
3397 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3398 }
3399
3400 #define CHAR1 STR_END
3401 #define CHAR2 STACK_TOP
3402
3403 static void do_casefulcmp(compiler_common *common)
3404 {
3405 DEFINE_COMPILER;
3406 struct sljit_jump *jump;
3407 struct sljit_label *label;
3408
3409 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3410 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
3411 OP1(SLJIT_MOV, TMP3, 0, CHAR1, 0);
3412 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, CHAR2, 0);
3413 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, IN_UCHARS(1));
3414 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3415
3416 label = LABEL();
3417 OP1(MOVU_UCHAR, CHAR1, 0, SLJIT_MEM1(TMP1), IN_UCHARS(1));
3418 OP1(MOVU_UCHAR, CHAR2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
3419 jump = CMP(SLJIT_C_NOT_EQUAL, CHAR1, 0, CHAR2, 0);
3420 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_IMM, IN_UCHARS(1));
3421 JUMPTO(SLJIT_C_NOT_ZERO, label);
3422
3423 JUMPHERE(jump);
3424 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3425 OP1(SLJIT_MOV, CHAR1, 0, TMP3, 0);
3426 OP1(SLJIT_MOV, CHAR2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
3427 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3428 }
3429
3430 #define LCC_TABLE STACK_LIMIT
3431
3432 static void do_caselesscmp(compiler_common *common)
3433 {
3434 DEFINE_COMPILER;
3435 struct sljit_jump *jump;
3436 struct sljit_label *label;
3437
3438 sljit_emit_fast_enter(compiler, RETURN_ADDR, 0);
3439 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
3440
3441 OP1(SLJIT_MOV, TMP3, 0, LCC_TABLE, 0);
3442 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, CHAR1, 0);
3443 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, CHAR2, 0);
3444 OP1(SLJIT_MOV, LCC_TABLE, 0, SLJIT_IMM, common->lcc);
3445 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, IN_UCHARS(1));
3446 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3447
3448 label = LABEL();
3449 OP1(MOVU_UCHAR, CHAR1, 0, SLJIT_MEM1(TMP1), IN_UCHARS(1));
3450 OP1(MOVU_UCHAR, CHAR2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
3451 #ifndef COMPILE_PCRE8
3452 jump = CMP(SLJIT_C_GREATER, CHAR1, 0, SLJIT_IMM, 255);
3453 #endif
3454 OP1(SLJIT_MOV_UB, CHAR1, 0, SLJIT_MEM2(LCC_TABLE, CHAR1), 0);
3455 #ifndef COMPILE_PCRE8
3456 JUMPHERE(jump);
3457 jump = CMP(SLJIT_C_GREATER, CHAR2, 0, SLJIT_IMM, 255);
3458 #endif
3459 OP1(SLJIT_MOV_UB, CHAR2, 0, SLJIT_MEM2(LCC_TABLE, CHAR2), 0);
3460 #ifndef COMPILE_PCRE8
3461 JUMPHERE(jump);
3462 #endif
3463 jump = CMP(SLJIT_C_NOT_EQUAL, CHAR1, 0, CHAR2, 0);
3464 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_IMM, IN_UCHARS(1));
3465 JUMPTO(SLJIT_C_NOT_ZERO, label);
3466
3467 JUMPHERE(jump);
3468 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
3469 OP1(SLJIT_MOV, LCC_TABLE, 0, TMP3, 0);
3470 OP1(SLJIT_MOV, CHAR1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
3471 OP1(SLJIT_MOV, CHAR2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1);
3472 sljit_emit_fast_return(compiler, RETURN_ADDR, 0);
3473 }
3474
3475 #undef LCC_TABLE
3476 #undef CHAR1
3477 #undef CHAR2
3478
3479 #if defined SUPPORT_UTF && defined SUPPORT_UCP
3480
3481 static const pcre_uchar *SLJIT_CALL do_utf_caselesscmp(pcre_uchar *src1, jit_arguments *args, pcre_uchar *end1)
3482 {
3483 /* This function would be ineffective to do in JIT level. */
3484 int c1, c2;
3485 const pcre_uchar *src2 = args->uchar_ptr;
3486 const pcre_uchar *end2 = args->end;
3487
3488 while (src1 < end1)
3489 {
3490 if (src2 >= end2)
3491 return (pcre_uchar*)1;
3492 GETCHARINC(c1, src1);
3493 GETCHARINC(c2, src2);
3494 if (c1 != c2 && c1 != UCD_OTHERCASE(c2)) return NULL;
3495 }
3496 return src2;
3497 }
3498
3499 #endif /* SUPPORT_UTF && SUPPORT_UCP */
3500
3501 static pcre_uchar *byte_sequence_compare(compiler_common *common, BOOL caseless, pcre_uchar *cc,
3502 compare_context* context, jump_list **backtracks)
3503 {
3504 DEFINE_COMPILER;
3505 unsigned int othercasebit = 0;
3506 pcre_uchar *othercasechar = NULL;
3507 #ifdef SUPPORT_UTF
3508 int utflength;
3509 #endif
3510
3511 if (caseless && char_has_othercase(common, cc))
3512 {
3513 othercasebit = char_get_othercase_bit(common, cc);
3514 SLJIT_ASSERT(othercasebit);
3515 /* Extracting bit difference info. */
3516 #ifdef COMPILE_PCRE8
3517 othercasechar = cc + (othercasebit >> 8);
3518 othercasebit &= 0xff;
3519 #else
3520 #ifdef COMPILE_PCRE16
3521 othercasechar = cc + (othercasebit >> 9);
3522 if ((othercasebit & 0x100) != 0)
3523 othercasebit = (othercasebit & 0xff) << 8;
3524 else
3525 othercasebit &= 0xff;
3526 #endif
3527 #endif
3528 }
3529
3530 if (context->sourcereg == -1)
3531 {
3532 #ifdef COMPILE_PCRE8
3533 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
3534 if (context->length >= 4)
3535 OP1(SLJIT_MOV_SI, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3536 else if (context->length >= 2)
3537 OP1(SLJIT_MOV_UH, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3538 else
3539 #endif
3540 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3541 #else
3542 #ifdef COMPILE_PCRE16
3543 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
3544 if (context->length >= 4)
3545 OP1(SLJIT_MOV_SI, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3546 else
3547 #endif
3548 OP1(SLJIT_MOV_UH, TMP1, 0, SLJIT_MEM1(STR_PTR), -context->length);
3549 #endif
3550 #endif /* COMPILE_PCRE8 */
3551 context->sourcereg = TMP2;
3552 }
3553
3554 #ifdef SUPPORT_UTF
3555 utflength = 1;
3556 if (common->utf && HAS_EXTRALEN(*cc))
3557 utflength += GET_EXTRALEN(*cc);
3558
3559 do
3560 {
3561 #endif
3562
3563 context->length -= IN_UCHARS(1);
3564 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
3565
3566 /* Unaligned read is supported. */
3567 if (othercasebit != 0 && othercasechar == cc)
3568 {
3569 context->c.asuchars[context->ucharptr] = *cc | othercasebit;
3570 context->oc.asuchars[context->ucharptr] = othercasebit;
3571 }
3572 else
3573 {
3574 context->c.asuchars[context->ucharptr] = *cc;
3575 context->oc.asuchars[context->ucharptr] = 0;
3576 }
3577 context->ucharptr++;
3578
3579 #ifdef COMPILE_PCRE8
3580 if (context->ucharptr >= 4 || context->length == 0 || (context->ucharptr == 2 && context->length == 1))
3581 #else
3582 if (context->ucharptr >= 2 || context->length == 0)
3583 #endif
3584 {
3585 if (context->length >= 4)
3586 OP1(SLJIT_MOV_SI, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
3587 #ifdef COMPILE_PCRE8
3588 else if (context->length >= 2)
3589 OP1(SLJIT_MOV_UH, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
3590 else if (context->length >= 1)
3591 OP1(SLJIT_MOV_UB, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
3592 #else
3593 else if (context->length >= 2)
3594 OP1(SLJIT_MOV_UH, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
3595 #endif
3596 context->sourcereg = context->sourcereg == TMP1 ? TMP2 : TMP1;
3597
3598 switch(context->ucharptr)
3599 {
3600 case 4 / sizeof(pcre_uchar):
3601 if (context->oc.asint != 0)
3602 OP2(SLJIT_OR, context->sourcereg, 0, context->sourcereg, 0, SLJIT_IMM, context->oc.asint);
3603 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, context->c.asint | context->oc.asint));
3604 break;
3605
3606 case 2 / sizeof(pcre_uchar):
3607 if (context->oc.asushort != 0)
3608 OP2(SLJIT_OR, context->sourcereg, 0, context->sourcereg, 0, SLJIT_IMM, context->oc.asushort);
3609 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, context->c.asushort | context->oc.asushort));
3610 break;
3611
3612 #ifdef COMPILE_PCRE8
3613 case 1:
3614 if (context->oc.asbyte != 0)
3615 OP2(SLJIT_OR, context->sourcereg, 0, context->sourcereg, 0, SLJIT_IMM, context->oc.asbyte);
3616 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, context->c.asbyte | context->oc.asbyte));
3617 break;
3618 #endif
3619
3620 default:
3621 SLJIT_ASSERT_STOP();
3622 break;
3623 }
3624 context->ucharptr = 0;
3625 }
3626
3627 #else
3628
3629 /* Unaligned read is unsupported. */
3630 #ifdef COMPILE_PCRE8
3631 if (context->length > 0)
3632 OP1(SLJIT_MOV_UB, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
3633 #else
3634 if (context->length > 0)
3635 OP1(SLJIT_MOV_UH, context->sourcereg, 0, SLJIT_MEM1(STR_PTR), -context->length);
3636 #endif
3637 context->sourcereg = context->sourcereg == TMP1 ? TMP2 : TMP1;
3638
3639 if (othercasebit != 0 && othercasechar == cc)
3640 {
3641 OP2(SLJIT_OR, context->sourcereg, 0, context->sourcereg, 0, SLJIT_IMM, othercasebit);
3642 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, *cc | othercasebit));
3643 }
3644 else
3645 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, context->sourcereg, 0, SLJIT_IMM, *cc));
3646
3647 #endif
3648
3649 cc++;
3650 #ifdef SUPPORT_UTF
3651 utflength--;
3652 }
3653 while (utflength > 0);
3654 #endif
3655
3656 return cc;
3657 }
3658
3659 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
3660
3661 #define SET_TYPE_OFFSET(value) \
3662 if ((value) != typeoffset) \
3663 { \
3664 if ((value) > typeoffset) \
3665 OP2(SLJIT_SUB, typereg, 0, typereg, 0, SLJIT_IMM, (value) - typeoffset); \
3666 else \
3667 OP2(SLJIT_ADD, typereg, 0, typereg, 0, SLJIT_IMM, typeoffset - (value)); \
3668 } \
3669 typeoffset = (value);
3670
3671 #define SET_CHAR_OFFSET(value) \
3672 if ((value) != charoffset) \
3673 { \
3674 if ((value) > charoffset) \
3675 OP2(SLJIT_SUB, TMP1, 0, TMP1, 0, SLJIT_IMM, (value) - charoffset); \
3676 else \
3677 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, charoffset - (value)); \
3678 } \
3679 charoffset = (value);
3680
3681 static void compile_xclass_matchingpath(compiler_common *common, pcre_uchar *cc, jump_list **backtracks)
3682 {
3683 DEFINE_COMPILER;
3684 jump_list *found = NULL;
3685 jump_list **list = (*cc & XCL_NOT) == 0 ? &found : backtracks;
3686 unsigned int c;
3687 int compares;
3688 struct sljit_jump *jump = NULL;
3689 pcre_uchar *ccbegin;
3690 #ifdef SUPPORT_UCP
3691 BOOL needstype = FALSE, needsscript = FALSE, needschar = FALSE;
3692 BOOL charsaved = FALSE;
3693 int typereg = TMP1, scriptreg = TMP1;
3694 unsigned int typeoffset;
3695 #endif
3696 int invertcmp, numberofcmps;
3697 unsigned int charoffset;
3698
3699 /* Although SUPPORT_UTF must be defined, we are
3700 not necessary in utf mode even in 8 bit mode. */
3701 detect_partial_match(common, backtracks);
3702 read_char(common);
3703
3704 if ((*cc++ & XCL_MAP) != 0)
3705 {
3706 OP1(SLJIT_MOV, TMP3, 0, TMP1, 0);
3707 #ifndef COMPILE_PCRE8
3708 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3709 #elif defined SUPPORT_UTF
3710 if (common->utf)
3711 jump = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
3712 #endif
3713
3714 if (!check_class_ranges(common, (const pcre_uint8 *)cc, TRUE, list))
3715 {
3716 OP2(SLJIT_AND, TMP2, 0, TMP1, 0, SLJIT_IMM, 0x7);
3717 OP2(SLJIT_LSHR, TMP1, 0, TMP1, 0, SLJIT_IMM, 3);
3718 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_w)cc);
3719 OP2(SLJIT_SHL, TMP2, 0, SLJIT_IMM, 1, TMP2, 0);
3720 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, TMP2, 0);
3721 add_jump(compiler, list, JUMP(SLJIT_C_NOT_ZERO));
3722 }
3723
3724 #ifndef COMPILE_PCRE8
3725 JUMPHERE(jump);
3726 #elif defined SUPPORT_UTF
3727 if (common->utf)
3728 JUMPHERE(jump);
3729 #endif
3730 OP1(SLJIT_MOV, TMP1, 0, TMP3, 0);
3731 #ifdef SUPPORT_UCP
3732 charsaved = TRUE;
3733 #endif
3734 cc += 32 / sizeof(pcre_uchar);
3735 }
3736
3737 /* Scanning the necessary info. */
3738 ccbegin = cc;
3739 compares = 0;
3740 while (*cc != XCL_END)
3741 {
3742 compares++;
3743 if (*cc == XCL_SINGLE)
3744 {
3745 cc += 2;
3746 #ifdef SUPPORT_UTF
3747 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
3748 #endif
3749 #ifdef SUPPORT_UCP
3750 needschar = TRUE;
3751 #endif
3752 }
3753 else if (*cc == XCL_RANGE)
3754 {
3755 cc += 2;
3756 #ifdef SUPPORT_UTF
3757 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
3758 #endif
3759 cc++;
3760 #ifdef SUPPORT_UTF
3761 if (common->utf && HAS_EXTRALEN(cc[-1])) cc += GET_EXTRALEN(cc[-1]);
3762 #endif
3763 #ifdef SUPPORT_UCP
3764 needschar = TRUE;
3765 #endif
3766 }
3767 #ifdef SUPPORT_UCP
3768 else
3769 {
3770 SLJIT_ASSERT(*cc == XCL_PROP || *cc == XCL_NOTPROP);
3771 cc++;
3772 switch(*cc)
3773 {
3774 case PT_ANY:
3775 break;
3776
3777 case PT_LAMP:
3778 case PT_GC:
3779 case PT_PC:
3780 case PT_ALNUM:
3781 needstype = TRUE;
3782 break;
3783
3784 case PT_SC:
3785 needsscript = TRUE;
3786 break;
3787
3788 case PT_SPACE:
3789 case PT_PXSPACE:
3790 case PT_WORD:
3791 needstype = TRUE;
3792 needschar = TRUE;
3793 break;
3794
3795 default:
3796 SLJIT_ASSERT_STOP();
3797 break;
3798 }
3799 cc += 2;
3800 }
3801 #endif
3802 }
3803
3804 #ifdef SUPPORT_UCP
3805 /* Simple register allocation. TMP1 is preferred if possible. */
3806 if (needstype || needsscript)
3807 {
3808 if (needschar && !charsaved)
3809 OP1(SLJIT_MOV, TMP3, 0, TMP1, 0);
3810 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
3811 if (needschar)
3812 {
3813 if (needstype)
3814 {
3815 OP1(SLJIT_MOV, RETURN_ADDR, 0, TMP1, 0);
3816 typereg = RETURN_ADDR;
3817 }
3818
3819 if (needsscript)
3820 scriptreg = TMP3;
3821 OP1(SLJIT_MOV, TMP1, 0, TMP3, 0);
3822 }
3823 else if (needstype && needsscript)
3824 scriptreg = TMP3;
3825 /* In all other cases only one of them was specified, and that can goes to TMP1. */
3826
3827 if (needsscript)
3828 {
3829 if (scriptreg == TMP1)
3830 {
3831 OP1(SLJIT_MOV, scriptreg, 0, SLJIT_IMM, (sljit_w)PRIV(ucd_records) + SLJIT_OFFSETOF(ucd_record, script));
3832 OP1(SLJIT_MOV_UB, scriptreg, 0, SLJIT_MEM2(scriptreg, TMP2), 3);
3833 }
3834 else
3835 {
3836 OP2(SLJIT_SHL, TMP2, 0, TMP2, 0, SLJIT_IMM, 3);
3837 OP2(SLJIT_ADD, TMP2, 0, TMP2, 0, SLJIT_IMM, (sljit_w)PRIV(ucd_records) + SLJIT_OFFSETOF(ucd_record, script));
3838 OP1(SLJIT_MOV_UB, scriptreg, 0, SLJIT_MEM1(TMP2), 0);
3839 }
3840 }
3841 }
3842 #endif
3843
3844 /* Generating code. */
3845 cc = ccbegin;
3846 charoffset = 0;
3847 numberofcmps = 0;
3848 #ifdef SUPPORT_UCP
3849 typeoffset = 0;
3850 #endif
3851
3852 while (*cc != XCL_END)
3853 {
3854 compares--;
3855 invertcmp = (compares == 0 && list != backtracks);
3856 jump = NULL;
3857
3858 if (*cc == XCL_SINGLE)
3859 {
3860 cc ++;
3861 #ifdef SUPPORT_UTF
3862 if (common->utf)
3863 {
3864 GETCHARINC(c, cc);
3865 }
3866 else
3867 #endif
3868 c = *cc++;
3869
3870 if (numberofcmps < 3 && (*cc == XCL_SINGLE || *cc == XCL_RANGE))
3871 {
3872 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c - charoffset);
3873 COND_VALUE(numberofcmps == 0 ? SLJIT_MOV : SLJIT_OR, TMP2, 0, SLJIT_C_EQUAL);
3874 numberofcmps++;
3875 }
3876 else if (numberofcmps > 0)
3877 {
3878 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c - charoffset);
3879 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_EQUAL);
3880 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
3881 numberofcmps = 0;
3882 }
3883 else
3884 {
3885 jump = CMP(SLJIT_C_EQUAL ^ invertcmp, TMP1, 0, SLJIT_IMM, c - charoffset);
3886 numberofcmps = 0;
3887 }
3888 }
3889 else if (*cc == XCL_RANGE)
3890 {
3891 cc ++;
3892 #ifdef SUPPORT_UTF
3893 if (common->utf)
3894 {
3895 GETCHARINC(c, cc);
3896 }
3897 else
3898 #endif
3899 c = *cc++;
3900 SET_CHAR_OFFSET(c);
3901 #ifdef SUPPORT_UTF
3902 if (common->utf)
3903 {
3904 GETCHARINC(c, cc);
3905 }
3906 else
3907 #endif
3908 c = *cc++;
3909 if (numberofcmps < 3 && (*cc == XCL_SINGLE || *cc == XCL_RANGE))
3910 {
3911 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c - charoffset);
3912 COND_VALUE(numberofcmps == 0 ? SLJIT_MOV : SLJIT_OR, TMP2, 0, SLJIT_C_LESS_EQUAL);
3913 numberofcmps++;
3914 }
3915 else if (numberofcmps > 0)
3916 {
3917 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c - charoffset);
3918 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_LESS_EQUAL);
3919 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
3920 numberofcmps = 0;
3921 }
3922 else
3923 {
3924 jump = CMP(SLJIT_C_LESS_EQUAL ^ invertcmp, TMP1, 0, SLJIT_IMM, c - charoffset);
3925 numberofcmps = 0;
3926 }
3927 }
3928 #ifdef SUPPORT_UCP
3929 else
3930 {
3931 if (*cc == XCL_NOTPROP)
3932 invertcmp ^= 0x1;
3933 cc++;
3934 switch(*cc)
3935 {
3936 case PT_ANY:
3937 if (list != backtracks)
3938 {
3939 if ((cc[-1] == XCL_NOTPROP && compares > 0) || (cc[-1] == XCL_PROP && compares == 0))
3940 continue;
3941 }
3942 else if (cc[-1] == XCL_NOTPROP)
3943 continue;
3944 jump = JUMP(SLJIT_JUMP);
3945 break;
3946
3947 case PT_LAMP:
3948 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Lu - typeoffset);
3949 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_EQUAL);
3950 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Ll - typeoffset);
3951 COND_VALUE(SLJIT_OR, TMP2, 0, SLJIT_C_EQUAL);
3952 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Lt - typeoffset);
3953 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_EQUAL);
3954 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
3955 break;
3956
3957 case PT_GC:
3958 c = PRIV(ucp_typerange)[(int)cc[1] * 2];
3959 SET_TYPE_OFFSET(c);
3960 jump = CMP(SLJIT_C_LESS_EQUAL ^ invertcmp, typereg, 0, SLJIT_IMM, PRIV(ucp_typerange)[(int)cc[1] * 2 + 1] - c);
3961 break;
3962
3963 case PT_PC:
3964 jump = CMP(SLJIT_C_EQUAL ^ invertcmp, typereg, 0, SLJIT_IMM, (int)cc[1] - typeoffset);
3965 break;
3966
3967 case PT_SC:
3968 jump = CMP(SLJIT_C_EQUAL ^ invertcmp, scriptreg, 0, SLJIT_IMM, (int)cc[1]);
3969 break;
3970
3971 case PT_SPACE:
3972 case PT_PXSPACE:
3973 if (*cc == PT_SPACE)
3974 {
3975 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, 0);
3976 jump = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, 11 - charoffset);
3977 }
3978 SET_CHAR_OFFSET(9);
3979 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 13 - 9);
3980 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_LESS_EQUAL);
3981 if (*cc == PT_SPACE)
3982 JUMPHERE(jump);
3983
3984 SET_TYPE_OFFSET(ucp_Zl);
3985 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Zs - ucp_Zl);
3986 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_LESS_EQUAL);
3987 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
3988 break;
3989
3990 case PT_WORD:
3991 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, CHAR_UNDERSCORE - charoffset);
3992 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_EQUAL);
3993 /* ... fall through */
3994
3995 case PT_ALNUM:
3996 SET_TYPE_OFFSET(ucp_Ll);
3997 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_Lu - ucp_Ll);
3998 COND_VALUE((*cc == PT_ALNUM) ? SLJIT_MOV : SLJIT_OR, TMP2, 0, SLJIT_C_LESS_EQUAL);
3999 SET_TYPE_OFFSET(ucp_Nd);
4000 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, typereg, 0, SLJIT_IMM, ucp_No - ucp_Nd);
4001 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_LESS_EQUAL);
4002 jump = JUMP(SLJIT_C_NOT_ZERO ^ invertcmp);
4003 break;
4004 }
4005 cc += 2;
4006 }
4007 #endif
4008
4009 if (jump != NULL)
4010 add_jump(compiler, compares > 0 ? list : backtracks, jump);
4011 }
4012
4013 if (found != NULL)
4014 set_jumps(found, LABEL());
4015 }
4016
4017 #undef SET_TYPE_OFFSET
4018 #undef SET_CHAR_OFFSET
4019
4020 #endif
4021
4022 static pcre_uchar *compile_char1_matchingpath(compiler_common *common, pcre_uchar type, pcre_uchar *cc, jump_list **backtracks)
4023 {
4024 DEFINE_COMPILER;
4025 int length;
4026 unsigned int c, oc, bit;
4027 compare_context context;
4028 struct sljit_jump *jump[4];
4029 #ifdef SUPPORT_UTF
4030 struct sljit_label *label;
4031 #ifdef SUPPORT_UCP
4032 pcre_uchar propdata[5];
4033 #endif
4034 #endif
4035
4036 switch(type)
4037 {
4038 case OP_SOD:
4039 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
4040 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
4041 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, TMP1, 0));
4042 return cc;
4043
4044 case OP_SOM:
4045 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
4046 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, str));
4047 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, TMP1, 0));
4048 return cc;
4049
4050 case OP_NOT_WORD_BOUNDARY:
4051 case OP_WORD_BOUNDARY:
4052 add_jump(compiler, &common->wordboundary, JUMP(SLJIT_FAST_CALL));
4053 add_jump(compiler, backtracks, JUMP(type == OP_NOT_WORD_BOUNDARY ? SLJIT_C_NOT_ZERO : SLJIT_C_ZERO));
4054 return cc;
4055
4056 case OP_NOT_DIGIT:
4057 case OP_DIGIT:
4058 /* Digits are usually 0-9, so it is worth to optimize them. */
4059 if (common->digits[0] == -2)
4060 get_ctype_ranges(common, ctype_digit, common->digits);
4061 detect_partial_match(common, backtracks);
4062 /* Flip the starting bit in the negative case. */
4063 if (type == OP_NOT_DIGIT)
4064 common->digits[1] ^= 1;
4065 if (!check_ranges(common, common->digits, backtracks, TRUE))
4066 {
4067 read_char8_type(common);
4068 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ctype_digit);
4069 add_jump(compiler, backtracks, JUMP(type == OP_DIGIT ? SLJIT_C_ZERO : SLJIT_C_NOT_ZERO));
4070 }
4071 if (type == OP_NOT_DIGIT)
4072 common->digits[1] ^= 1;
4073 return cc;
4074
4075 case OP_NOT_WHITESPACE:
4076 case OP_WHITESPACE:
4077 detect_partial_match(common, backtracks);
4078 read_char8_type(common);
4079 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ctype_space);
4080 add_jump(compiler, backtracks, JUMP(type == OP_WHITESPACE ? SLJIT_C_ZERO : SLJIT_C_NOT_ZERO));
4081 return cc;
4082
4083 case OP_NOT_WORDCHAR:
4084 case OP_WORDCHAR:
4085 detect_partial_match(common, backtracks);
4086 read_char8_type(common);
4087 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, ctype_word);
4088 add_jump(compiler, backtracks, JUMP(type == OP_WORDCHAR ? SLJIT_C_ZERO : SLJIT_C_NOT_ZERO));
4089 return cc;
4090
4091 case OP_ANY:
4092 detect_partial_match(common, backtracks);
4093 read_char(common);
4094 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
4095 {
4096 jump[0] = CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff);
4097 if (common->mode != JIT_PARTIAL_HARD_COMPILE)
4098 jump[1] = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
4099 else
4100 jump[1] = check_str_end(common);
4101
4102 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
4103 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, common->newline & 0xff));
4104 if (jump[1] != NULL)
4105 JUMPHERE(jump[1]);
4106 JUMPHERE(jump[0]);
4107 }
4108 else
4109 check_newlinechar(common, common->nltype, backtracks, TRUE);
4110 return cc;
4111
4112 case OP_ALLANY:
4113 detect_partial_match(common, backtracks);
4114 #ifdef SUPPORT_UTF
4115 if (common->utf)
4116 {
4117 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
4118 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4119 #ifdef COMPILE_PCRE8
4120 jump[0] = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xc0);
4121 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_w)PRIV(utf8_table4) - 0xc0);
4122 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
4123 #else /* COMPILE_PCRE8 */
4124 #ifdef COMPILE_PCRE16
4125 jump[0] = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xd800);
4126 OP2(SLJIT_AND, TMP1, 0, TMP1, 0, SLJIT_IMM, 0xfc00);
4127 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, 0xd800);
4128 COND_VALUE(SLJIT_MOV, TMP1, 0, SLJIT_C_EQUAL);
4129 OP2(SLJIT_SHL, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
4130 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
4131 #endif /* COMPILE_PCRE16 */
4132 #endif /* COMPILE_PCRE8 */
4133 JUMPHERE(jump[0]);
4134 return cc;
4135 }
4136 #endif
4137 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4138 return cc;
4139
4140 case OP_ANYBYTE:
4141 detect_partial_match(common, backtracks);
4142 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4143 return cc;
4144
4145 #ifdef SUPPORT_UTF
4146 #ifdef SUPPORT_UCP
4147 case OP_NOTPROP:
4148 case OP_PROP:
4149 propdata[0] = 0;
4150 propdata[1] = type == OP_NOTPROP ? XCL_NOTPROP : XCL_PROP;
4151 propdata[2] = cc[0];
4152 propdata[3] = cc[1];
4153 propdata[4] = XCL_END;
4154 compile_xclass_matchingpath(common, propdata, backtracks);
4155 return cc + 2;
4156 #endif
4157 #endif
4158
4159 case OP_ANYNL:
4160 detect_partial_match(common, backtracks);
4161 read_char(common);
4162 jump[0] = CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_CR);
4163 /* We don't need to handle soft partial matching case. */
4164 if (common->mode != JIT_PARTIAL_HARD_COMPILE)
4165 jump[1] = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
4166 else
4167 jump[1] = check_str_end(common);
4168 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
4169 jump[2] = CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_NL);
4170 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4171 jump[3] = JUMP(SLJIT_JUMP);
4172 JUMPHERE(jump[0]);
4173 check_newlinechar(common, common->bsr_nltype, backtracks, FALSE);
4174 JUMPHERE(jump[1]);
4175 JUMPHERE(jump[2]);
4176 JUMPHERE(jump[3]);
4177 return cc;
4178
4179 case OP_NOT_HSPACE:
4180 case OP_HSPACE:
4181 detect_partial_match(common, backtracks);
4182 read_char(common);
4183 add_jump(compiler, &common->hspace, JUMP(SLJIT_FAST_CALL));
4184 add_jump(compiler, backtracks, JUMP(type == OP_NOT_HSPACE ? SLJIT_C_NOT_ZERO : SLJIT_C_ZERO));
4185 return cc;
4186
4187 case OP_NOT_VSPACE:
4188 case OP_VSPACE:
4189 detect_partial_match(common, backtracks);
4190 read_char(common);
4191 add_jump(compiler, &common->vspace, JUMP(SLJIT_FAST_CALL));
4192 add_jump(compiler, backtracks, JUMP(type == OP_NOT_VSPACE ? SLJIT_C_NOT_ZERO : SLJIT_C_ZERO));
4193 return cc;
4194
4195 #ifdef SUPPORT_UCP
4196 case OP_EXTUNI:
4197 detect_partial_match(common, backtracks);
4198 read_char(common);
4199 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
4200 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, (sljit_w)PRIV(ucd_records) + SLJIT_OFFSETOF(ucd_record, gbprop));
4201 /* Optimize register allocation: use a real register. */
4202 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, STACK_TOP, 0);
4203 OP1(SLJIT_MOV_UB, STACK_TOP, 0, SLJIT_MEM2(TMP1, TMP2), 3);
4204
4205 label = LABEL();
4206 jump[0] = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
4207 OP1(SLJIT_MOV, TMP3, 0, STR_PTR, 0);
4208 read_char(common);
4209 add_jump(compiler, &common->getucd, JUMP(SLJIT_FAST_CALL));
4210 OP1(SLJIT_MOV, TMP1, 0, SLJIT_IMM, (sljit_w)PRIV(ucd_records) + SLJIT_OFFSETOF(ucd_record, gbprop));
4211 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM2(TMP1, TMP2), 3);
4212
4213 OP2(SLJIT_SHL, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, 2);
4214 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), (sljit_w)PRIV(ucp_gbtable));
4215 OP1(SLJIT_MOV, STACK_TOP, 0, TMP2, 0);
4216 OP2(SLJIT_SHL, TMP2, 0, SLJIT_IMM, 1, TMP2, 0);
4217 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, TMP2, 0);
4218 JUMPTO(SLJIT_C_NOT_ZERO, label);
4219
4220 OP1(SLJIT_MOV, STR_PTR, 0, TMP3, 0);
4221 JUMPHERE(jump[0]);
4222 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
4223
4224 if (common->mode == JIT_PARTIAL_HARD_COMPILE)
4225 {
4226 jump[0] = CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0);
4227 /* Since we successfully read a char above, partial matching must occure. */
4228 check_partial(common, TRUE);
4229 JUMPHERE(jump[0]);
4230 }
4231 return cc;
4232 #endif
4233
4234 case OP_EODN:
4235 /* Requires rather complex checks. */
4236 jump[0] = CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0);
4237 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
4238 {
4239 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(2));
4240 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
4241 if (common->mode == JIT_COMPILE)
4242 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, STR_END, 0));
4243 else
4244 {
4245 jump[1] = CMP(SLJIT_C_EQUAL, TMP2, 0, STR_END, 0);
4246 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP2, 0, STR_END, 0);
4247 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_LESS);
4248 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff);
4249 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_NOT_EQUAL);
4250 add_jump(compiler, backtracks, JUMP(SLJIT_C_NOT_EQUAL));
4251 check_partial(common, TRUE);
4252 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
4253 JUMPHERE(jump[1]);
4254 }
4255 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
4256 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff));
4257 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, common->newline & 0xff));
4258 }
4259 else if (common->nltype == NLTYPE_FIXED)
4260 {
4261 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4262 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
4263 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, STR_END, 0));
4264 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, common->newline));
4265 }
4266 else
4267 {
4268 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
4269 jump[1] = CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_CR);
4270 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(2));
4271 OP2(SLJIT_SUB | SLJIT_SET_U, SLJIT_UNUSED, 0, TMP2, 0, STR_END, 0);
4272 jump[2] = JUMP(SLJIT_C_GREATER);
4273 add_jump(compiler, backtracks, JUMP(SLJIT_C_LESS));
4274 /* Equal. */
4275 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
4276 jump[3] = CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_NL);
4277 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
4278
4279 JUMPHERE(jump[1]);
4280 if (common->nltype == NLTYPE_ANYCRLF)
4281 {
4282 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4283 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, TMP2, 0, STR_END, 0));
4284 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, CHAR_NL));
4285 }
4286 else
4287 {
4288 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, STR_PTR, 0);
4289 read_char(common);
4290 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, STR_END, 0));
4291 add_jump(compiler, &common->anynewline, JUMP(SLJIT_FAST_CALL));
4292 add_jump(compiler, backtracks, JUMP(SLJIT_C_ZERO));
4293 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1);
4294 }
4295 JUMPHERE(jump[2]);
4296 JUMPHERE(jump[3]);
4297 }
4298 JUMPHERE(jump[0]);
4299 check_partial(common, FALSE);
4300 return cc;
4301
4302 case OP_EOD:
4303 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0));
4304 check_partial(common, FALSE);
4305 return cc;
4306
4307 case OP_CIRC:
4308 OP1(SLJIT_MOV, TMP2, 0, ARGUMENTS, 0);
4309 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, begin));
4310 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER, STR_PTR, 0, TMP1, 0));
4311 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, notbol));
4312 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4313 return cc;
4314
4315 case OP_CIRCM:
4316 OP1(SLJIT_MOV, TMP2, 0, ARGUMENTS, 0);
4317 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, begin));
4318 jump[1] = CMP(SLJIT_C_GREATER, STR_PTR, 0, TMP1, 0);
4319 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, notbol));
4320 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4321 jump[0] = JUMP(SLJIT_JUMP);
4322 JUMPHERE(jump[1]);
4323
4324 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER_EQUAL, STR_PTR, 0, STR_END, 0));
4325 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
4326 {
4327 OP2(SLJIT_SUB, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(2));
4328 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, TMP2, 0, TMP1, 0));
4329 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(-2));
4330 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(-1));
4331 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff));
4332 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, common->newline & 0xff));
4333 }
4334 else
4335 {
4336 skip_char_back(common);
4337 read_char(common);
4338 check_newlinechar(common, common->nltype, backtracks, FALSE);
4339 }
4340 JUMPHERE(jump[0]);
4341 return cc;
4342
4343 case OP_DOLL:
4344 OP1(SLJIT_MOV, TMP2, 0, ARGUMENTS, 0);
4345 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, noteol));
4346 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4347
4348 if (!common->endonly)
4349 compile_char1_matchingpath(common, OP_EODN, cc, backtracks);
4350 else
4351 {
4352 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0));
4353 check_partial(common, FALSE);
4354 }
4355 return cc;
4356
4357 case OP_DOLLM:
4358 jump[1] = CMP(SLJIT_C_LESS, STR_PTR, 0, STR_END, 0);
4359 OP1(SLJIT_MOV, TMP2, 0, ARGUMENTS, 0);
4360 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP2), SLJIT_OFFSETOF(jit_arguments, noteol));
4361 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4362 check_partial(common, FALSE);
4363 jump[0] = JUMP(SLJIT_JUMP);
4364 JUMPHERE(jump[1]);
4365
4366 if (common->nltype == NLTYPE_FIXED && common->newline > 255)
4367 {
4368 OP2(SLJIT_ADD, TMP2, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(2));
4369 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(0));
4370 if (common->mode == JIT_COMPILE)
4371 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER, TMP2, 0, STR_END, 0));
4372 else
4373 {
4374 jump[1] = CMP(SLJIT_C_LESS_EQUAL, TMP2, 0, STR_END, 0);
4375 /* STR_PTR = STR_END - IN_UCHARS(1) */
4376 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff));
4377 check_partial(common, TRUE);
4378 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
4379 JUMPHERE(jump[1]);
4380 }
4381
4382 OP1(MOV_UCHAR, TMP2, 0, SLJIT_MEM1(STR_PTR), IN_UCHARS(1));
4383 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, (common->newline >> 8) & 0xff));
4384 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, common->newline & 0xff));
4385 }
4386 else
4387 {
4388 peek_char(common);
4389 check_newlinechar(common, common->nltype, backtracks, FALSE);
4390 }
4391 JUMPHERE(jump[0]);
4392 return cc;
4393
4394 case OP_CHAR:
4395 case OP_CHARI:
4396 length = 1;
4397 #ifdef SUPPORT_UTF
4398 if (common->utf && HAS_EXTRALEN(*cc)) length += GET_EXTRALEN(*cc);
4399 #endif
4400 if (common->mode == JIT_COMPILE && (type == OP_CHAR || !char_has_othercase(common, cc) || char_get_othercase_bit(common, cc) != 0))
4401 {
4402 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(length));
4403 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER, STR_PTR, 0, STR_END, 0));
4404
4405 context.length = IN_UCHARS(length);
4406 context.sourcereg = -1;
4407 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
4408 context.ucharptr = 0;
4409 #endif
4410 return byte_sequence_compare(common, type == OP_CHARI, cc, &context, backtracks);
4411 }
4412 detect_partial_match(common, backtracks);
4413 read_char(common);
4414 #ifdef SUPPORT_UTF
4415 if (common->utf)
4416 {
4417 GETCHAR(c, cc);
4418 }
4419 else
4420 #endif
4421 c = *cc;
4422 if (type == OP_CHAR || !char_has_othercase(common, cc))
4423 {
4424 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, c));
4425 return cc + length;
4426 }
4427 oc = char_othercase(common, c);
4428 bit = c ^ oc;
4429 if (ispowerof2(bit))
4430 {
4431 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, bit);
4432 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP1, 0, SLJIT_IMM, c | bit));
4433 return cc + length;
4434 }
4435 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, c);
4436 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_EQUAL);
4437 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_IMM, oc);
4438 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_EQUAL);
4439 add_jump(compiler, backtracks, JUMP(SLJIT_C_ZERO));
4440 return cc + length;
4441
4442 case OP_NOT:
4443 case OP_NOTI:
4444 detect_partial_match(common, backtracks);
4445 length = 1;
4446 #ifdef SUPPORT_UTF
4447 if (common->utf)
4448 {
4449 #ifdef COMPILE_PCRE8
4450 c = *cc;
4451 if (c < 128)
4452 {
4453 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(STR_PTR), 0);
4454 if (type == OP_NOT || !char_has_othercase(common, cc))
4455 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, c));
4456 else
4457 {
4458 /* Since UTF8 code page is fixed, we know that c is in [a-z] or [A-Z] range. */
4459 OP2(SLJIT_OR, TMP2, 0, TMP1, 0, SLJIT_IMM, 0x20);
4460 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, c | 0x20));
4461 }
4462 /* Skip the variable-length character. */
4463 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(1));
4464 jump[0] = CMP(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, 0xc0);
4465 OP1(MOV_UCHAR, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_w)PRIV(utf8_table4) - 0xc0);
4466 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP1, 0);
4467 JUMPHERE(jump[0]);
4468 return cc + 1;
4469 }
4470 else
4471 #endif /* COMPILE_PCRE8 */
4472 {
4473 GETCHARLEN(c, cc, length);
4474 read_char(common);
4475 }
4476 }
4477 else
4478 #endif /* SUPPORT_UTF */
4479 {
4480 read_char(common);
4481 c = *cc;
4482 }
4483
4484 if (type == OP_NOT || !char_has_othercase(common, cc))
4485 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, c));
4486 else
4487 {
4488 oc = char_othercase(common, c);
4489 bit = c ^ oc;
4490 if (ispowerof2(bit))
4491 {
4492 OP2(SLJIT_OR, TMP1, 0, TMP1, 0, SLJIT_IMM, bit);
4493 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, c | bit));
4494 }
4495 else
4496 {
4497 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, c));
4498 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, oc));
4499 }
4500 }
4501 return cc + length;
4502
4503 case OP_CLASS:
4504 case OP_NCLASS:
4505 detect_partial_match(common, backtracks);
4506 read_char(common);
4507 if (check_class_ranges(common, (const pcre_uint8 *)cc, type == OP_NCLASS, backtracks))
4508 return cc + 32 / sizeof(pcre_uchar);
4509
4510 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
4511 jump[0] = NULL;
4512 #ifdef COMPILE_PCRE8
4513 /* This check only affects 8 bit mode. In other modes, we
4514 always need to compare the value with 255. */
4515 if (common->utf)
4516 #endif /* COMPILE_PCRE8 */
4517 {
4518 jump[0] = CMP(SLJIT_C_GREATER, TMP1, 0, SLJIT_IMM, 255);
4519 if (type == OP_CLASS)
4520 {
4521 add_jump(compiler, backtracks, jump[0]);
4522 jump[0] = NULL;
4523 }
4524 }
4525 #endif /* SUPPORT_UTF || !COMPILE_PCRE8 */
4526 OP2(SLJIT_AND, TMP2, 0, TMP1, 0, SLJIT_IMM, 0x7);
4527 OP2(SLJIT_LSHR, TMP1, 0, TMP1, 0, SLJIT_IMM, 3);
4528 OP1(SLJIT_MOV_UB, TMP1, 0, SLJIT_MEM1(TMP1), (sljit_w)cc);
4529 OP2(SLJIT_SHL, TMP2, 0, SLJIT_IMM, 1, TMP2, 0);
4530 OP2(SLJIT_AND | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, TMP2, 0);
4531 add_jump(compiler, backtracks, JUMP(SLJIT_C_ZERO));
4532 #if defined SUPPORT_UTF || !defined COMPILE_PCRE8
4533 if (jump[0] != NULL)
4534 JUMPHERE(jump[0]);
4535 #endif /* SUPPORT_UTF || !COMPILE_PCRE8 */
4536 return cc + 32 / sizeof(pcre_uchar);
4537
4538 #if defined SUPPORT_UTF || defined COMPILE_PCRE16
4539 case OP_XCLASS:
4540 compile_xclass_matchingpath(common, cc + LINK_SIZE, backtracks);
4541 return cc + GET(cc, 0) - 1;
4542 #endif
4543
4544 case OP_REVERSE:
4545 length = GET(cc, 0);
4546 if (length == 0)
4547 return cc + LINK_SIZE;
4548 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
4549 #ifdef SUPPORT_UTF
4550 if (common->utf)
4551 {
4552 OP1(SLJIT_MOV, TMP3, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
4553 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, length);
4554 label = LABEL();
4555 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS_EQUAL, STR_PTR, 0, TMP3, 0));
4556 skip_char_back(common);
4557 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, TMP2, 0, SLJIT_IMM, 1);
4558 JUMPTO(SLJIT_C_NOT_ZERO, label);
4559 }
4560 else
4561 #endif
4562 {
4563 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, begin));
4564 OP2(SLJIT_SUB, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, IN_UCHARS(length));
4565 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS, STR_PTR, 0, TMP1, 0));
4566 }
4567 check_start_used_ptr(common);
4568 return cc + LINK_SIZE;
4569 }
4570 SLJIT_ASSERT_STOP();
4571 return cc;
4572 }
4573
4574 static SLJIT_INLINE pcre_uchar *compile_charn_matchingpath(compiler_common *common, pcre_uchar *cc, pcre_uchar *ccend, jump_list **backtracks)
4575 {
4576 /* This function consumes at least one input character. */
4577 /* To decrease the number of length checks, we try to concatenate the fixed length character sequences. */
4578 DEFINE_COMPILER;
4579 pcre_uchar *ccbegin = cc;
4580 compare_context context;
4581 int size;
4582
4583 context.length = 0;
4584 do
4585 {
4586 if (cc >= ccend)
4587 break;
4588
4589 if (*cc == OP_CHAR)
4590 {
4591 size = 1;
4592 #ifdef SUPPORT_UTF
4593 if (common->utf && HAS_EXTRALEN(cc[1]))
4594 size += GET_EXTRALEN(cc[1]);
4595 #endif
4596 }
4597 else if (*cc == OP_CHARI)
4598 {
4599 size = 1;
4600 #ifdef SUPPORT_UTF
4601 if (common->utf)
4602 {
4603 if (char_has_othercase(common, cc + 1) && char_get_othercase_bit(common, cc + 1) == 0)
4604 size = 0;
4605 else if (HAS_EXTRALEN(cc[1]))
4606 size += GET_EXTRALEN(cc[1]);
4607 }
4608 else
4609 #endif
4610 if (char_has_othercase(common, cc + 1) && char_get_othercase_bit(common, cc + 1) == 0)
4611 size = 0;
4612 }
4613 else
4614 size = 0;
4615
4616 cc += 1 + size;
4617 context.length += IN_UCHARS(size);
4618 }
4619 while (size > 0 && context.length <= 128);
4620
4621 cc = ccbegin;
4622 if (context.length > 0)
4623 {
4624 /* We have a fixed-length byte sequence. */
4625 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, SLJIT_IMM, context.length);
4626 add_jump(compiler, backtracks, CMP(SLJIT_C_GREATER, STR_PTR, 0, STR_END, 0));
4627
4628 context.sourcereg = -1;
4629 #if defined SLJIT_UNALIGNED && SLJIT_UNALIGNED
4630 context.ucharptr = 0;
4631 #endif
4632 do cc = byte_sequence_compare(common, *cc == OP_CHARI, cc + 1, &context, backtracks); while (context.length > 0);
4633 return cc;
4634 }
4635
4636 /* A non-fixed length character will be checked if length == 0. */
4637 return compile_char1_matchingpath(common, *cc, cc + 1, backtracks);
4638 }
4639
4640 static struct sljit_jump *compile_ref_checks(compiler_common *common, pcre_uchar *cc, jump_list **backtracks)
4641 {
4642 DEFINE_COMPILER;
4643 int offset = GET2(cc, 1) << 1;
4644
4645 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
4646 if (!common->jscript_compat)
4647 {
4648 if (backtracks == NULL)
4649 {
4650 /* OVECTOR(1) contains the "string begin - 1" constant. */
4651 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1));
4652 COND_VALUE(SLJIT_MOV, TMP2, 0, SLJIT_C_EQUAL);
4653 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_UNUSED, 0, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
4654 COND_VALUE(SLJIT_OR | SLJIT_SET_E, TMP2, 0, SLJIT_C_EQUAL);
4655 return JUMP(SLJIT_C_NOT_ZERO);
4656 }
4657 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1)));
4658 }
4659 return CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
4660 }
4661
4662 /* Forward definitions. */
4663 static void compile_matchingpath(compiler_common *, pcre_uchar *, pcre_uchar *, backtrack_common *);
4664 static void compile_backtrackingpath(compiler_common *, struct backtrack_common *);
4665
4666 #define PUSH_BACKTRACK(size, ccstart, error) \
4667 do \
4668 { \
4669 backtrack = sljit_alloc_memory(compiler, (size)); \
4670 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler))) \
4671 return error; \
4672 memset(backtrack, 0, size); \
4673 backtrack->prev = parent->top; \
4674 backtrack->cc = (ccstart); \
4675 parent->top = backtrack; \
4676 } \
4677 while (0)
4678
4679 #define PUSH_BACKTRACK_NOVALUE(size, ccstart) \
4680 do \
4681 { \
4682 backtrack = sljit_alloc_memory(compiler, (size)); \
4683 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler))) \
4684 return; \
4685 memset(backtrack, 0, size); \
4686 backtrack->prev = parent->top; \
4687 backtrack->cc = (ccstart); \
4688 parent->top = backtrack; \
4689 } \
4690 while (0)
4691
4692 #define BACKTRACK_AS(type) ((type *)backtrack)
4693
4694 static pcre_uchar *compile_ref_matchingpath(compiler_common *common, pcre_uchar *cc, jump_list **backtracks, BOOL withchecks, BOOL emptyfail)
4695 {
4696 DEFINE_COMPILER;
4697 int offset = GET2(cc, 1) << 1;
4698 struct sljit_jump *jump = NULL;
4699 struct sljit_jump *partial;
4700 struct sljit_jump *nopartial;
4701
4702 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
4703 /* OVECTOR(1) contains the "string begin - 1" constant. */
4704 if (withchecks && !common->jscript_compat)
4705 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1)));
4706
4707 #if defined SUPPORT_UTF && defined SUPPORT_UCP
4708 if (common->utf && *cc == OP_REFI)
4709 {
4710 SLJIT_ASSERT(TMP1 == SLJIT_TEMPORARY_REG1 && STACK_TOP == SLJIT_TEMPORARY_REG2 && TMP2 == SLJIT_TEMPORARY_REG3);
4711 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
4712 if (withchecks)
4713 jump = CMP(SLJIT_C_EQUAL, TMP1, 0, TMP2, 0);
4714
4715 /* Needed to save important temporary registers. */
4716 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, STACK_TOP, 0);
4717 OP1(SLJIT_MOV, SLJIT_TEMPORARY_REG2, 0, ARGUMENTS, 0);
4718 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_TEMPORARY_REG2), SLJIT_OFFSETOF(jit_arguments, uchar_ptr), STR_PTR, 0);
4719 sljit_emit_ijump(compiler, SLJIT_CALL3, SLJIT_IMM, SLJIT_FUNC_OFFSET(do_utf_caselesscmp));
4720 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0);
4721 if (common->mode == JIT_COMPILE)
4722 add_jump(compiler, backtracks, CMP(SLJIT_C_LESS_EQUAL, SLJIT_RETURN_REG, 0, SLJIT_IMM, 1));
4723 else
4724 {
4725 add_jump(compiler, backtracks, CMP(SLJIT_C_EQUAL, SLJIT_RETURN_REG, 0, SLJIT_IMM, 0));
4726 nopartial = CMP(SLJIT_C_NOT_EQUAL, SLJIT_RETURN_REG, 0, SLJIT_IMM, 1);
4727 check_partial(common, FALSE);
4728 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
4729 JUMPHERE(nopartial);
4730 }
4731 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_RETURN_REG, 0);
4732 }
4733 else
4734 #endif /* SUPPORT_UTF && SUPPORT_UCP */
4735 {
4736 OP2(SLJIT_SUB | SLJIT_SET_E, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1), TMP1, 0);
4737 if (withchecks)
4738 jump = JUMP(SLJIT_C_ZERO);
4739
4740 OP2(SLJIT_ADD, STR_PTR, 0, STR_PTR, 0, TMP2, 0);
4741 partial = CMP(SLJIT_C_GREATER, STR_PTR, 0, STR_END, 0);
4742 if (common->mode == JIT_COMPILE)
4743 add_jump(compiler, backtracks, partial);
4744
4745 add_jump(compiler, *cc == OP_REF ? &common->casefulcmp : &common->caselesscmp, JUMP(SLJIT_FAST_CALL));
4746 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4747
4748 if (common->mode != JIT_COMPILE)
4749 {
4750 nopartial = JUMP(SLJIT_JUMP);
4751 JUMPHERE(partial);
4752 /* TMP2 -= STR_END - STR_PTR */
4753 OP2(SLJIT_SUB, TMP2, 0, TMP2, 0, STR_PTR, 0);
4754 OP2(SLJIT_ADD, TMP2, 0, TMP2, 0, STR_END, 0);
4755 partial = CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, 0);
4756 OP1(SLJIT_MOV, STR_PTR, 0, STR_END, 0);
4757 add_jump(compiler, *cc == OP_REF ? &common->casefulcmp : &common->caselesscmp, JUMP(SLJIT_FAST_CALL));
4758 add_jump(compiler, backtracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
4759 JUMPHERE(partial);
4760 check_partial(common, FALSE);
4761 add_jump(compiler, backtracks, JUMP(SLJIT_JUMP));
4762 JUMPHERE(nopartial);
4763 }
4764 }
4765
4766 if (jump != NULL)
4767 {
4768 if (emptyfail)
4769 add_jump(compiler, backtracks, jump);
4770 else
4771 JUMPHERE(jump);
4772 }
4773 return cc + 1 + IMM2_SIZE;
4774 }
4775
4776 static SLJIT_INLINE pcre_uchar *compile_ref_iterator_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
4777 {
4778 DEFINE_COMPILER;
4779 backtrack_common *backtrack;
4780 pcre_uchar type;
4781 struct sljit_label *label;
4782 struct sljit_jump *zerolength;
4783 struct sljit_jump *jump = NULL;
4784 pcre_uchar *ccbegin = cc;
4785 int min = 0, max = 0;
4786 BOOL minimize;
4787
4788 PUSH_BACKTRACK(sizeof(iterator_backtrack), cc, NULL);
4789
4790 type = cc[1 + IMM2_SIZE];
4791 minimize = (type & 0x1) != 0;
4792 switch(type)
4793 {
4794 case OP_CRSTAR:
4795 case OP_CRMINSTAR:
4796 min = 0;
4797 max = 0;
4798 cc += 1 + IMM2_SIZE + 1;
4799 break;
4800 case OP_CRPLUS:
4801 case OP_CRMINPLUS:
4802 min = 1;
4803 max = 0;
4804 cc += 1 + IMM2_SIZE + 1;
4805 break;
4806 case OP_CRQUERY:
4807 case OP_CRMINQUERY:
4808 min = 0;
4809 max = 1;
4810 cc += 1 + IMM2_SIZE + 1;
4811 break;
4812 case OP_CRRANGE:
4813 case OP_CRMINRANGE:
4814 min = GET2(cc, 1 + IMM2_SIZE + 1);
4815 max = GET2(cc, 1 + IMM2_SIZE + 1 + IMM2_SIZE);
4816 cc += 1 + IMM2_SIZE + 1 + 2 * IMM2_SIZE;
4817 break;
4818 default:
4819 SLJIT_ASSERT_STOP();
4820 break;
4821 }
4822
4823 if (!minimize)
4824 {
4825 if (min == 0)
4826 {
4827 allocate_stack(common, 2);
4828 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
4829 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, 0);
4830 /* Temporary release of STR_PTR. */
4831 OP2(SLJIT_SUB, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_w));
4832 zerolength = compile_ref_checks(common, ccbegin, NULL);
4833 /* Restore if not zero length. */
4834 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_w));
4835 }
4836 else
4837 {
4838 allocate_stack(common, 1);
4839 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
4840 zerolength = compile_ref_checks(common, ccbegin, &backtrack->topbacktracks);
4841 }
4842
4843 if (min > 1 || max > 1)
4844 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0, SLJIT_IMM, 0);
4845
4846 label = LABEL();
4847 compile_ref_matchingpath(common, ccbegin, &backtrack->topbacktracks, FALSE, FALSE);
4848
4849 if (min > 1 || max > 1)
4850 {
4851 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0);
4852 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
4853 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0, TMP1, 0);
4854 if (min > 1)
4855 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, min, label);
4856 if (max > 1)
4857 {
4858 jump = CMP(SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, max);
4859 allocate_stack(common, 1);
4860 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
4861 JUMPTO(SLJIT_JUMP, label);
4862 JUMPHERE(jump);
4863 }
4864 }
4865
4866 if (max == 0)
4867 {
4868 /* Includes min > 1 case as well. */
4869 allocate_stack(common, 1);
4870 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
4871 JUMPTO(SLJIT_JUMP, label);
4872 }
4873
4874 JUMPHERE(zerolength);
4875 BACKTRACK_AS(iterator_backtrack)->matchingpath = LABEL();
4876
4877 decrease_call_count(common);
4878 return cc;
4879 }
4880
4881 allocate_stack(common, 2);
4882 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
4883 if (type != OP_CRMINSTAR)
4884 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, 0);
4885
4886 if (min == 0)
4887 {
4888 zerolength = compile_ref_checks(common, ccbegin, NULL);
4889 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
4890 jump = JUMP(SLJIT_JUMP);
4891 }
4892 else
4893 zerolength = compile_ref_checks(common, ccbegin, &backtrack->topbacktracks);
4894
4895 BACKTRACK_AS(iterator_backtrack)->matchingpath = LABEL();
4896 if (max > 0)
4897 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_GREATER_EQUAL, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, max));
4898
4899 compile_ref_matchingpath(common, ccbegin, &backtrack->topbacktracks, TRUE, TRUE);
4900 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
4901
4902 if (min > 1)
4903 {
4904 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), STACK(1));
4905 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
4906 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP1, 0);
4907 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, min, BACKTRACK_AS(iterator_backtrack)->matchingpath);
4908 }
4909 else if (max > 0)
4910 OP2(SLJIT_ADD, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, 1);
4911
4912 if (jump != NULL)
4913 JUMPHERE(jump);
4914 JUMPHERE(zerolength);
4915
4916 decrease_call_count(common);
4917 return cc;
4918 }
4919
4920 static SLJIT_INLINE pcre_uchar *compile_recurse_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
4921 {
4922 DEFINE_COMPILER;
4923 backtrack_common *backtrack;
4924 recurse_entry *entry = common->entries;
4925 recurse_entry *prev = NULL;
4926 int start = GET(cc, 1);
4927
4928 PUSH_BACKTRACK(sizeof(recurse_backtrack), cc, NULL);
4929 while (entry != NULL)
4930 {
4931 if (entry->start == start)
4932 break;
4933 prev = entry;
4934 entry = entry->next;
4935 }
4936
4937 if (entry == NULL)
4938 {
4939 entry = sljit_alloc_memory(compiler, sizeof(recurse_entry));
4940 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
4941 return NULL;
4942 entry->next = NULL;
4943 entry->entry = NULL;
4944 entry->calls = NULL;
4945 entry->start = start;
4946
4947 if (prev != NULL)
4948 prev->next = entry;
4949 else
4950 common->entries = entry;
4951 }
4952
4953 if (common->has_set_som && common->mark_ptr != 0)
4954 {
4955 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0));
4956 allocate_stack(common, 2);
4957 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mark_ptr);
4958 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
4959 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP1, 0);
4960 }
4961 else if (common->has_set_som || common->mark_ptr != 0)
4962 {
4963 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->has_set_som ? (int)(OVECTOR(0)) : common->mark_ptr);
4964 allocate_stack(common, 1);
4965 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
4966 }
4967
4968 if (entry->entry == NULL)
4969 add_jump(compiler, &entry->calls, JUMP(SLJIT_FAST_CALL));
4970 else
4971 JUMPTO(SLJIT_FAST_CALL, entry->entry);
4972 /* Leave if the match is failed. */
4973 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_EQUAL, TMP1, 0, SLJIT_IMM, 0));
4974 return cc + 1 + LINK_SIZE;
4975 }
4976
4977 static pcre_uchar *compile_assert_matchingpath(compiler_common *common, pcre_uchar *cc, assert_backtrack *backtrack, BOOL conditional)
4978 {
4979 DEFINE_COMPILER;
4980 int framesize;
4981 int private_data_ptr;
4982 backtrack_common altbacktrack;
4983 pcre_uchar *ccbegin;
4984 pcre_uchar opcode;
4985 pcre_uchar bra = OP_BRA;
4986 jump_list *tmp = NULL;
4987 jump_list **target = (conditional) ? &backtrack->condfailed : &backtrack->common.topbacktracks;
4988 jump_list **found;
4989 /* Saving previous accept variables. */
4990 struct sljit_label *save_quitlabel = common->quitlabel;
4991 struct sljit_label *save_acceptlabel = common->acceptlabel;
4992 jump_list *save_quit = common->quit;
4993 jump_list *save_accept = common->accept;
4994 struct sljit_jump *jump;
4995 struct sljit_jump *brajump = NULL;
4996
4997 if (*cc == OP_BRAZERO || *cc == OP_BRAMINZERO)
4998 {
4999 SLJIT_ASSERT(!conditional);
5000 bra = *cc;
5001 cc++;
5002 }
5003 private_data_ptr = PRIVATE_DATA(cc);
5004 SLJIT_ASSERT(private_data_ptr != 0);
5005 framesize = get_framesize(common, cc, FALSE);
5006 backtrack->framesize = framesize;
5007 backtrack->private_data_ptr = private_data_ptr;
5008 opcode = *cc;
5009 SLJIT_ASSERT(opcode >= OP_ASSERT && opcode <= OP_ASSERTBACK_NOT);
5010 found = (opcode == OP_ASSERT || opcode == OP_ASSERTBACK) ? &tmp : target;
5011 ccbegin = cc;
5012 cc += GET(cc, 1);
5013
5014 if (bra == OP_BRAMINZERO)
5015 {
5016 /* This is a braminzero backtrack path. */
5017 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5018 free_stack(common, 1);
5019 brajump = CMP(SLJIT_C_EQUAL, STR_PTR, 0, SLJIT_IMM, 0);
5020 }
5021
5022 if (framesize < 0)
5023 {
5024 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STACK_TOP, 0);
5025 allocate_stack(common, 1);
5026 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5027 }
5028 else
5029 {
5030 allocate_stack(common, framesize + 2);
5031 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5032 OP2(SLJIT_SUB, TMP2, 0, STACK_TOP, 0, SLJIT_IMM, -STACK(framesize + 1));
5033 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP2, 0);
5034 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5035 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP1, 0);
5036 init_frame(common, ccbegin, framesize + 1, 2, FALSE);
5037 }
5038
5039 memset(&altbacktrack, 0, sizeof(backtrack_common));
5040 common->quitlabel = NULL;
5041 common->quit = NULL;
5042 while (1)
5043 {
5044 common->acceptlabel = NULL;
5045 common->accept = NULL;
5046 altbacktrack.top = NULL;
5047 altbacktrack.topbacktracks = NULL;
5048
5049 if (*ccbegin == OP_ALT)
5050 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5051
5052 altbacktrack.cc = ccbegin;
5053 compile_matchingpath(common, ccbegin + 1 + LINK_SIZE, cc, &altbacktrack);
5054 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
5055 {
5056 common->quitlabel = save_quitlabel;
5057 common->acceptlabel = save_acceptlabel;
5058 common->quit = save_quit;
5059 common->accept = save_accept;
5060 return NULL;
5061 }
5062 common->acceptlabel = LABEL();
5063 if (common->accept != NULL)
5064 set_jumps(common->accept, common->acceptlabel);
5065
5066 /* Reset stack. */
5067 if (framesize < 0)
5068 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5069 else {
5070 if ((opcode != OP_ASSERT_NOT && opcode != OP_ASSERTBACK_NOT) || conditional)
5071 {
5072 /* We don't need to keep the STR_PTR, only the previous private_data_ptr. */
5073 OP2(SLJIT_ADD, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_IMM, (framesize + 1) * sizeof(sljit_w));
5074 }
5075 else
5076 {
5077 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5078 add_jump(compiler, &common->revertframes, JUMP(SLJIT_FAST_CALL));
5079 }
5080 }
5081
5082 if (opcode == OP_ASSERT_NOT || opcode == OP_ASSERTBACK_NOT)
5083 {
5084 /* We know that STR_PTR was stored on the top of the stack. */
5085 if (conditional)
5086 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), 0);
5087 else if (bra == OP_BRAZERO)
5088 {
5089 if (framesize < 0)
5090 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), 0);
5091 else
5092 {
5093 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), framesize * sizeof(sljit_w));
5094 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), (framesize + 1) * sizeof(sljit_w));
5095 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP1, 0);
5096 }
5097 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_w));
5098 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5099 }
5100 else if (framesize >= 0)
5101 {
5102 /* For OP_BRA and OP_BRAMINZERO. */
5103 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_MEM1(STACK_TOP), framesize * sizeof(sljit_w));
5104 }
5105 }
5106 add_jump(compiler, found, JUMP(SLJIT_JUMP));
5107
5108 compile_backtrackingpath(common, altbacktrack.top);
5109 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
5110 {
5111 common->quitlabel = save_quitlabel;
5112 common->acceptlabel = save_acceptlabel;
5113 common->quit = save_quit;
5114 common->accept = save_accept;
5115 return NULL;
5116 }
5117 set_jumps(altbacktrack.topbacktracks, LABEL());
5118
5119 if (*cc != OP_ALT)
5120 break;
5121
5122 ccbegin = cc;
5123 cc += GET(cc, 1);
5124 }
5125 /* None of them matched. */
5126 if (common->quit != NULL)
5127 set_jumps(common->quit, LABEL());
5128
5129 if (opcode == OP_ASSERT || opcode == OP_ASSERTBACK)
5130 {
5131 /* Assert is failed. */
5132 if (conditional || bra == OP_BRAZERO)
5133 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5134
5135 if (framesize < 0)
5136 {
5137 /* The topmost item should be 0. */
5138 if (bra == OP_BRAZERO)
5139 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5140 else
5141 free_stack(common, 1);
5142 }
5143 else
5144 {
5145 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), STACK(1));
5146 /* The topmost item should be 0. */
5147 if (bra == OP_BRAZERO)
5148 {
5149 free_stack(common, framesize + 1);
5150 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5151 }
5152 else
5153 free_stack(common, framesize + 2);
5154 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP1, 0);
5155 }
5156 jump = JUMP(SLJIT_JUMP);
5157 if (bra != OP_BRAZERO)
5158 add_jump(compiler, target, jump);
5159
5160 /* Assert is successful. */
5161 set_jumps(tmp, LABEL());
5162 if (framesize < 0)
5163 {
5164 /* We know that STR_PTR was stored on the top of the stack. */
5165 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), 0);
5166 /* Keep the STR_PTR on the top of the stack. */
5167 if (bra == OP_BRAZERO)
5168 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_w));
5169 else if (bra == OP_BRAMINZERO)
5170 {
5171 OP2(SLJIT_ADD, STACK_TOP, 0, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_w));
5172 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5173 }
5174 }
5175 else
5176 {
5177 if (bra == OP_BRA)
5178 {
5179 /* We don't need to keep the STR_PTR, only the previous private_data_ptr. */
5180 OP2(SLJIT_ADD, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_IMM, (framesize + 1) * sizeof(sljit_w));
5181 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), 0);
5182 }
5183 else
5184 {
5185 /* We don't need to keep the STR_PTR, only the previous private_data_ptr. */
5186 OP2(SLJIT_ADD, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_IMM, (framesize + 2) * sizeof(sljit_w));
5187 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5188 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), bra == OP_BRAZERO ? STR_PTR : SLJIT_IMM, 0);
5189 }
5190 }
5191
5192 if (bra == OP_BRAZERO)
5193 {
5194 backtrack->matchingpath = LABEL();
5195 sljit_set_label(jump, backtrack->matchingpath);
5196 }
5197 else if (bra == OP_BRAMINZERO)
5198 {
5199 JUMPTO(SLJIT_JUMP, backtrack->matchingpath);
5200 JUMPHERE(brajump);
5201 if (framesize >= 0)
5202 {
5203 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5204 add_jump(compiler, &common->revertframes, JUMP(SLJIT_FAST_CALL));
5205 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_MEM1(STACK_TOP), framesize * sizeof(sljit_w));
5206 }
5207 set_jumps(backtrack->common.topbacktracks, LABEL());
5208 }
5209 }
5210 else
5211 {
5212 /* AssertNot is successful. */
5213 if (framesize < 0)
5214 {
5215 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5216 if (bra != OP_BRA)
5217 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5218 else
5219 free_stack(common, 1);
5220 }
5221 else
5222 {
5223 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5224 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), STACK(1));
5225 /* The topmost item should be 0. */
5226 if (bra != OP_BRA)
5227 {
5228 free_stack(common, framesize + 1);
5229 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
5230 }
5231 else
5232 free_stack(common, framesize + 2);
5233 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP1, 0);
5234 }
5235
5236 if (bra == OP_BRAZERO)
5237 backtrack->matchingpath = LABEL();
5238 else if (bra == OP_BRAMINZERO)
5239 {
5240 JUMPTO(SLJIT_JUMP, backtrack->matchingpath);
5241 JUMPHERE(brajump);
5242 }
5243
5244 if (bra != OP_BRA)
5245 {
5246 SLJIT_ASSERT(found == &backtrack->common.topbacktracks);
5247 set_jumps(backtrack->common.topbacktracks, LABEL());
5248 backtrack->common.topbacktracks = NULL;
5249 }
5250 }
5251
5252 common->quitlabel = save_quitlabel;
5253 common->acceptlabel = save_acceptlabel;
5254 common->quit = save_quit;
5255 common->accept = save_accept;
5256 return cc + 1 + LINK_SIZE;
5257 }
5258
5259 static sljit_w SLJIT_CALL do_searchovector(sljit_w refno, sljit_w* locals, pcre_uchar *name_table)
5260 {
5261 int condition = FALSE;
5262 pcre_uchar *slotA = name_table;
5263 pcre_uchar *slotB;
5264 sljit_w name_count = locals[LOCALS0 / sizeof(sljit_w)];
5265 sljit_w name_entry_size = locals[LOCALS1 / sizeof(sljit_w)];
5266 sljit_w no_capture;
5267 int i;
5268
5269 locals += refno & 0xff;
5270 refno >>= 8;
5271 no_capture = locals[1];
5272
5273 for (i = 0; i < name_count; i++)
5274 {
5275 if (GET2(slotA, 0) == refno) break;
5276 slotA += name_entry_size;
5277 }
5278
5279 if (i < name_count)
5280 {
5281 /* Found a name for the number - there can be only one; duplicate names
5282 for different numbers are allowed, but not vice versa. First scan down
5283 for duplicates. */
5284
5285 slotB = slotA;
5286 while (slotB > name_table)
5287 {
5288 slotB -= name_entry_size;
5289 if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)
5290 {
5291 condition = locals[GET2(slotB, 0) << 1] != no_capture;
5292 if (condition) break;
5293 }
5294 else break;
5295 }
5296
5297 /* Scan up for duplicates */
5298 if (!condition)
5299 {
5300 slotB = slotA;
5301 for (i++; i < name_count; i++)
5302 {
5303 slotB += name_entry_size;
5304 if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)
5305 {
5306 condition = locals[GET2(slotB, 0) << 1] != no_capture;
5307 if (condition) break;
5308 }
5309 else break;
5310 }
5311 }
5312 }
5313 return condition;
5314 }
5315
5316 static sljit_w SLJIT_CALL do_searchgroups(sljit_w recno, sljit_w* locals, pcre_uchar *name_table)
5317 {
5318 int condition = FALSE;
5319 pcre_uchar *slotA = name_table;
5320 pcre_uchar *slotB;
5321 sljit_w name_count = locals[LOCALS0 / sizeof(sljit_w)];
5322 sljit_w name_entry_size = locals[LOCALS1 / sizeof(sljit_w)];
5323 sljit_w group_num = locals[POSSESSIVE0 / sizeof(sljit_w)];
5324 int i;
5325
5326 for (i = 0; i < name_count; i++)
5327 {
5328 if (GET2(slotA, 0) == recno) break;
5329 slotA += name_entry_size;
5330 }
5331
5332 if (i < name_count)
5333 {
5334 /* Found a name for the number - there can be only one; duplicate
5335 names for different numbers are allowed, but not vice versa. First
5336 scan down for duplicates. */
5337
5338 slotB = slotA;
5339 while (slotB > name_table)
5340 {
5341 slotB -= name_entry_size;
5342 if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)
5343 {
5344 condition = GET2(slotB, 0) == group_num;
5345 if (condition) break;
5346 }
5347 else break;
5348 }
5349
5350 /* Scan up for duplicates */
5351 if (!condition)
5352 {
5353 slotB = slotA;
5354 for (i++; i < name_count; i++)
5355 {
5356 slotB += name_entry_size;
5357 if (STRCMP_UC_UC(slotA + IMM2_SIZE, slotB + IMM2_SIZE) == 0)
5358 {
5359 condition = GET2(slotB, 0) == group_num;
5360 if (condition) break;
5361 }
5362 else break;
5363 }
5364 }
5365 }
5366 return condition;
5367 }
5368
5369 /*
5370 Handling bracketed expressions is probably the most complex part.
5371
5372 Stack layout naming characters:
5373 S - Push the current STR_PTR
5374 0 - Push a 0 (NULL)
5375 A - Push the current STR_PTR. Needed for restoring the STR_PTR
5376 before the next alternative. Not pushed if there are no alternatives.
5377 M - Any values pushed by the current alternative. Can be empty, or anything.
5378 C - Push the previous OVECTOR(i), OVECTOR(i+1) and OVECTOR_PRIV(i) to the stack.
5379 L - Push the previous local (pointed by localptr) to the stack
5380 () - opional values stored on the stack
5381 ()* - optonal, can be stored multiple times
5382
5383 The following list shows the regular expression templates, their PCRE byte codes
5384 and stack layout supported by pcre-sljit.
5385
5386 (?:) OP_BRA | OP_KET A M
5387 () OP_CBRA | OP_KET C M
5388 (?:)+ OP_BRA | OP_KETRMAX 0 A M S ( A M S )*
5389 OP_SBRA | OP_KETRMAX 0 L M S ( L M S )*
5390 (?:)+? OP_BRA | OP_KETRMIN 0 A M S ( A M S )*
5391 OP_SBRA | OP_KETRMIN 0 L M S ( L M S )*
5392 ()+ OP_CBRA | OP_KETRMAX 0 C M S ( C M S )*
5393 OP_SCBRA | OP_KETRMAX 0 C M S ( C M S )*
5394 ()+? OP_CBRA | OP_KETRMIN 0 C M S ( C M S )*
5395 OP_SCBRA | OP_KETRMIN 0 C M S ( C M S )*
5396 (?:)? OP_BRAZERO | OP_BRA | OP_KET S ( A M 0 )
5397 (?:)?? OP_BRAMINZERO | OP_BRA | OP_KET S ( A M 0 )
5398 ()? OP_BRAZERO | OP_CBRA | OP_KET S ( C M 0 )
5399 ()?? OP_BRAMINZERO | OP_CBRA | OP_KET S ( C M 0 )
5400 (?:)* OP_BRAZERO | OP_BRA | OP_KETRMAX S 0 ( A M S )*
5401 OP_BRAZERO | OP_SBRA | OP_KETRMAX S 0 ( L M S )*
5402 (?:)*? OP_BRAMINZERO | OP_BRA | OP_KETRMIN S 0 ( A M S )*
5403 OP_BRAMINZERO | OP_SBRA | OP_KETRMIN S 0 ( L M S )*
5404 ()* OP_BRAZERO | OP_CBRA | OP_KETRMAX S 0 ( C M S )*
5405 OP_BRAZERO | OP_SCBRA | OP_KETRMAX S 0 ( C M S )*
5406 ()*? OP_BRAMINZERO | OP_CBRA | OP_KETRMIN S 0 ( C M S )*
5407 OP_BRAMINZERO | OP_SCBRA | OP_KETRMIN S 0 ( C M S )*
5408
5409
5410 Stack layout naming characters:
5411 A - Push the alternative index (starting from 0) on the stack.
5412 Not pushed if there is no alternatives.
5413 M - Any values pushed by the current alternative. Can be empty, or anything.
5414
5415 The next list shows the possible content of a bracket:
5416 (|) OP_*BRA | OP_ALT ... M A
5417 (?()|) OP_*COND | OP_ALT M A
5418 (?>|) OP_ONCE | OP_ALT ... [stack trace] M A
5419 (?>|) OP_ONCE_NC | OP_ALT ... [stack trace] M A
5420 Or nothing, if trace is unnecessary
5421 */
5422
5423 static pcre_uchar *compile_bracket_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
5424 {
5425 DEFINE_COMPILER;
5426 backtrack_common *backtrack;
5427 pcre_uchar opcode;
5428 int private_data_ptr = 0;
5429 int offset = 0;
5430 int stacksize;
5431 pcre_uchar *ccbegin;
5432 pcre_uchar *matchingpath;
5433 pcre_uchar bra = OP_BRA;
5434 pcre_uchar ket;
5435 assert_backtrack *assert;
5436 BOOL has_alternatives;
5437 struct sljit_jump *jump;
5438 struct sljit_jump *skip;
5439 struct sljit_label *rmaxlabel = NULL;
5440 struct sljit_jump *braminzerojump = NULL;
5441
5442 PUSH_BACKTRACK(sizeof(bracket_backtrack), cc, NULL);
5443
5444 if (*cc == OP_BRAZERO || *cc == OP_BRAMINZERO)
5445 {
5446 bra = *cc;
5447 cc++;
5448 opcode = *cc;
5449 }
5450
5451 opcode = *cc;
5452 ccbegin = cc;
5453 matchingpath = ccbegin + 1 + LINK_SIZE;
5454
5455 if ((opcode == OP_COND || opcode == OP_SCOND) && cc[1 + LINK_SIZE] == OP_DEF)
5456 {
5457 /* Drop this bracket_backtrack. */
5458 parent->top = backtrack->prev;
5459 return bracketend(cc);
5460 }
5461
5462 ket = *(bracketend(cc) - 1 - LINK_SIZE);
5463 SLJIT_ASSERT(ket == OP_KET || ket == OP_KETRMAX || ket == OP_KETRMIN);
5464 SLJIT_ASSERT(!((bra == OP_BRAZERO && ket == OP_KETRMIN) || (bra == OP_BRAMINZERO && ket == OP_KETRMAX)));
5465 cc += GET(cc, 1);
5466
5467 has_alternatives = *cc == OP_ALT;
5468 if (SLJIT_UNLIKELY(opcode == OP_COND) || SLJIT_UNLIKELY(opcode == OP_SCOND))
5469 {
5470 has_alternatives = (*matchingpath == OP_RREF) ? FALSE : TRUE;
5471 if (*matchingpath == OP_NRREF)
5472 {
5473 stacksize = GET2(matchingpath, 1);
5474 if (common->currententry == NULL || stacksize == RREF_ANY)
5475 has_alternatives = FALSE;
5476 else if (common->currententry->start == 0)
5477 has_alternatives = stacksize != 0;
5478 else
5479 has_alternatives = stacksize != GET2(common->start, common->currententry->start + 1 + LINK_SIZE);
5480 }
5481 }
5482
5483 if (SLJIT_UNLIKELY(opcode == OP_COND) && (*cc == OP_KETRMAX || *cc == OP_KETRMIN))
5484 opcode = OP_SCOND;
5485 if (SLJIT_UNLIKELY(opcode == OP_ONCE_NC))
5486 opcode = OP_ONCE;
5487
5488 if (opcode == OP_CBRA || opcode == OP_SCBRA)
5489 {
5490 /* Capturing brackets has a pre-allocated space. */
5491 offset = GET2(ccbegin, 1 + LINK_SIZE);
5492 if (common->optimized_cbracket[offset] == 0)
5493 {
5494 private_data_ptr = OVECTOR_PRIV(offset);
5495 offset <<= 1;
5496 }
5497 else
5498 {
5499 offset <<= 1;
5500 private_data_ptr = OVECTOR(offset);
5501 }
5502 BACKTRACK_AS(bracket_backtrack)->private_data_ptr = private_data_ptr;
5503 matchingpath += IMM2_SIZE;
5504 }
5505 else if (opcode == OP_ONCE || opcode == OP_SBRA || opcode == OP_SCOND)
5506 {
5507 /* Other brackets simply allocate the next entry. */
5508 private_data_ptr = PRIVATE_DATA(ccbegin);
5509 SLJIT_ASSERT(private_data_ptr != 0);
5510 BACKTRACK_AS(bracket_backtrack)->private_data_ptr = private_data_ptr;
5511 if (opcode == OP_ONCE)
5512 BACKTRACK_AS(bracket_backtrack)->u.framesize = get_framesize(common, ccbegin, FALSE);
5513 }
5514
5515 /* Instructions before the first alternative. */
5516 stacksize = 0;
5517 if ((ket == OP_KETRMAX) || (ket == OP_KETRMIN && bra != OP_BRAMINZERO))
5518 stacksize++;
5519 if (bra == OP_BRAZERO)
5520 stacksize++;
5521
5522 if (stacksize > 0)
5523 allocate_stack(common, stacksize);
5524
5525 stacksize = 0;
5526 if ((ket == OP_KETRMAX) || (ket == OP_KETRMIN && bra != OP_BRAMINZERO))
5527 {
5528 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), SLJIT_IMM, 0);
5529 stacksize++;
5530 }
5531
5532 if (bra == OP_BRAZERO)
5533 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), STR_PTR, 0);
5534
5535 if (bra == OP_BRAMINZERO)
5536 {
5537 /* This is a backtrack path! (Since the try-path of OP_BRAMINZERO matches to the empty string) */
5538 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5539 if (ket != OP_KETRMIN)
5540 {
5541 free_stack(common, 1);
5542 braminzerojump = CMP(SLJIT_C_EQUAL, STR_PTR, 0, SLJIT_IMM, 0);
5543 }
5544 else
5545 {
5546 if (opcode == OP_ONCE || opcode >= OP_SBRA)
5547 {
5548 jump = CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, SLJIT_IMM, 0);
5549 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(1));
5550 /* Nothing stored during the first run. */
5551 skip = JUMP(SLJIT_JUMP);
5552 JUMPHERE(jump);
5553 /* Checking zero-length iteration. */
5554 if (opcode != OP_ONCE || BACKTRACK_AS(bracket_backtrack)->u.framesize < 0)
5555 {
5556 /* When we come from outside, private_data_ptr contains the previous STR_PTR. */
5557 braminzerojump = CMP(SLJIT_C_EQUAL, STR_PTR, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5558 }
5559 else
5560 {
5561 /* Except when the whole stack frame must be saved. */
5562 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5563 braminzerojump = CMP(SLJIT_C_EQUAL, STR_PTR, 0, SLJIT_MEM1(TMP1), (BACKTRACK_AS(bracket_backtrack)->u.framesize + 1) * sizeof(sljit_w));
5564 }
5565 JUMPHERE(skip);
5566 }
5567 else
5568 {
5569 jump = CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, SLJIT_IMM, 0);
5570 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(1));
5571 JUMPHERE(jump);
5572 }
5573 }
5574 }
5575
5576 if (ket == OP_KETRMIN)
5577 BACKTRACK_AS(bracket_backtrack)->recursive_matchingpath = LABEL();
5578
5579 if (ket == OP_KETRMAX)
5580 {
5581 rmaxlabel = LABEL();
5582 if (has_alternatives && opcode != OP_ONCE && opcode < OP_SBRA)
5583 BACKTRACK_AS(bracket_backtrack)->alternative_matchingpath = rmaxlabel;
5584 }
5585
5586 /* Handling capturing brackets and alternatives. */
5587 if (opcode == OP_ONCE)
5588 {
5589 if (BACKTRACK_AS(bracket_backtrack)->u.framesize < 0)
5590 {
5591 /* Neither capturing brackets nor recursions are not found in the block. */
5592 if (ket == OP_KETRMIN)
5593 {
5594 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5595 allocate_stack(common, 2);
5596 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5597 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP2, 0);
5598 OP2(SLJIT_SUB, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STACK_TOP, 0, SLJIT_IMM, sizeof(sljit_w));
5599 }
5600 else if (ket == OP_KETRMAX || has_alternatives)
5601 {
5602 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STACK_TOP, 0);
5603 allocate_stack(common, 1);
5604 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5605 }
5606 else
5607 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STACK_TOP, 0);
5608 }
5609 else
5610 {
5611 if (ket == OP_KETRMIN || ket == OP_KETRMAX || has_alternatives)
5612 {
5613 allocate_stack(common, BACKTRACK_AS(bracket_backtrack)->u.framesize + 2);
5614 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5615 OP2(SLJIT_SUB, TMP2, 0, STACK_TOP, 0, SLJIT_IMM, -STACK(BACKTRACK_AS(bracket_backtrack)->u.framesize + 1));
5616 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5617 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP2, 0);
5618 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP1, 0);
5619 init_frame(common, ccbegin, BACKTRACK_AS(bracket_backtrack)->u.framesize + 1, 2, FALSE);
5620 }
5621 else
5622 {
5623 allocate_stack(common, BACKTRACK_AS(bracket_backtrack)->u.framesize + 1);
5624 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5625 OP2(SLJIT_SUB, TMP2, 0, STACK_TOP, 0, SLJIT_IMM, -STACK(BACKTRACK_AS(bracket_backtrack)->u.framesize));
5626 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP2, 0);
5627 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP1, 0);
5628 init_frame(common, ccbegin, BACKTRACK_AS(bracket_backtrack)->u.framesize, 1, FALSE);
5629 }
5630 }
5631 }
5632 else if (opcode == OP_CBRA || opcode == OP_SCBRA)
5633 {
5634 /* Saving the previous values. */
5635 if (common->optimized_cbracket[offset >> 1] == 0)
5636 {
5637 allocate_stack(common, 3);
5638 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
5639 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
5640 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP1, 0);
5641 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5642 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP2, 0);
5643 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STR_PTR, 0);
5644 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(2), TMP1, 0);
5645 }
5646 else
5647 {
5648 SLJIT_ASSERT(private_data_ptr == OVECTOR(offset));
5649 allocate_stack(common, 2);
5650 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5651 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr + sizeof(sljit_w));
5652 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STR_PTR, 0);
5653 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP1, 0);
5654 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP2, 0);
5655 }
5656 }
5657 else if (opcode == OP_SBRA || opcode == OP_SCOND)
5658 {
5659 /* Saving the previous value. */
5660 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5661 allocate_stack(common, 1);
5662 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STR_PTR, 0);
5663 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
5664 }
5665 else if (has_alternatives)
5666 {
5667 /* Pushing the starting string pointer. */
5668 allocate_stack(common, 1);
5669 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5670 }
5671
5672 /* Generating code for the first alternative. */
5673 if (opcode == OP_COND || opcode == OP_SCOND)
5674 {
5675 if (*matchingpath == OP_CREF)
5676 {
5677 SLJIT_ASSERT(has_alternatives);
5678 add_jump(compiler, &(BACKTRACK_AS(bracket_backtrack)->u.condfailed),
5679 CMP(SLJIT_C_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(GET2(matchingpath, 1) << 1), SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1)));
5680 matchingpath += 1 + IMM2_SIZE;
5681 }
5682 else if (*matchingpath == OP_NCREF)
5683 {
5684 SLJIT_ASSERT(has_alternatives);
5685 stacksize = GET2(matchingpath, 1);
5686 jump = CMP(SLJIT_C_NOT_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(stacksize << 1), SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(1));
5687
5688 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1, STACK_TOP, 0);
5689 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, SLJIT_IMM, common->name_count);
5690 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, SLJIT_IMM, common->name_entry_size);
5691 OP1(SLJIT_MOV, SLJIT_TEMPORARY_REG1, 0, SLJIT_IMM, (stacksize << 8) | (common->ovector_start / sizeof(sljit_w)));
5692 GET_LOCAL_BASE(SLJIT_TEMPORARY_REG2, 0, 0);
5693 OP1(SLJIT_MOV, SLJIT_TEMPORARY_REG3, 0, SLJIT_IMM, common->name_table);
5694 sljit_emit_ijump(compiler, SLJIT_CALL3, SLJIT_IMM, SLJIT_FUNC_OFFSET(do_searchovector));
5695 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1);
5696 add_jump(compiler, &(BACKTRACK_AS(bracket_backtrack)->u.condfailed), CMP(SLJIT_C_EQUAL, SLJIT_TEMPORARY_REG1, 0, SLJIT_IMM, 0));
5697
5698 JUMPHERE(jump);
5699 matchingpath += 1 + IMM2_SIZE;
5700 }
5701 else if (*matchingpath == OP_RREF || *matchingpath == OP_NRREF)
5702 {
5703 /* Never has other case. */
5704 BACKTRACK_AS(bracket_backtrack)->u.condfailed = NULL;
5705
5706 stacksize = GET2(matchingpath, 1);
5707 if (common->currententry == NULL)
5708 stacksize = 0;
5709 else if (stacksize == RREF_ANY)
5710 stacksize = 1;
5711 else if (common->currententry->start == 0)
5712 stacksize = stacksize == 0;
5713 else
5714 stacksize = stacksize == GET2(common->start, common->currententry->start + 1 + LINK_SIZE);
5715
5716 if (*matchingpath == OP_RREF || stacksize || common->currententry == NULL)
5717 {
5718 SLJIT_ASSERT(!has_alternatives);
5719 if (stacksize != 0)
5720 matchingpath += 1 + IMM2_SIZE;
5721 else
5722 {
5723 if (*cc == OP_ALT)
5724 {
5725 matchingpath = cc + 1 + LINK_SIZE;
5726 cc += GET(cc, 1);
5727 }
5728 else
5729 matchingpath = cc;
5730 }
5731 }
5732 else
5733 {
5734 SLJIT_ASSERT(has_alternatives);
5735
5736 stacksize = GET2(matchingpath, 1);
5737 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1, STACK_TOP, 0);
5738 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS0, SLJIT_IMM, common->name_count);
5739 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), LOCALS1, SLJIT_IMM, common->name_entry_size);
5740 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0, SLJIT_IMM, GET2(common->start, common->currententry->start + 1 + LINK_SIZE));
5741 OP1(SLJIT_MOV, SLJIT_TEMPORARY_REG1, 0, SLJIT_IMM, stacksize);
5742 GET_LOCAL_BASE(SLJIT_TEMPORARY_REG2, 0, 0);
5743 OP1(SLJIT_MOV, SLJIT_TEMPORARY_REG3, 0, SLJIT_IMM, common->name_table);
5744 sljit_emit_ijump(compiler, SLJIT_CALL3, SLJIT_IMM, SLJIT_FUNC_OFFSET(do_searchgroups));
5745 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1);
5746 add_jump(compiler, &(BACKTRACK_AS(bracket_backtrack)->u.condfailed), CMP(SLJIT_C_EQUAL, SLJIT_TEMPORARY_REG1, 0, SLJIT_IMM, 0));
5747 matchingpath += 1 + IMM2_SIZE;
5748 }
5749 }
5750 else
5751 {
5752 SLJIT_ASSERT(has_alternatives && *matchingpath >= OP_ASSERT && *matchingpath <= OP_ASSERTBACK_NOT);
5753 /* Similar code as PUSH_BACKTRACK macro. */
5754 assert = sljit_alloc_memory(compiler, sizeof(assert_backtrack));
5755 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
5756 return NULL;
5757 memset(assert, 0, sizeof(assert_backtrack));
5758 assert->common.cc = matchingpath;
5759 BACKTRACK_AS(bracket_backtrack)->u.assert = assert;
5760 matchingpath = compile_assert_matchingpath(common, matchingpath, assert, TRUE);
5761 }
5762 }
5763
5764 compile_matchingpath(common, matchingpath, cc, backtrack);
5765 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
5766 return NULL;
5767
5768 if (opcode == OP_ONCE)
5769 {
5770 if (BACKTRACK_AS(bracket_backtrack)->u.framesize < 0)
5771 {
5772 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5773 /* TMP2 which is set here used by OP_KETRMAX below. */
5774 if (ket == OP_KETRMAX)
5775 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(STACK_TOP), 0);
5776 else if (ket == OP_KETRMIN)
5777 {
5778 /* Move the STR_PTR to the private_data_ptr. */
5779 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_MEM1(STACK_TOP), 0);
5780 }
5781 }
5782 else
5783 {
5784 stacksize = (ket == OP_KETRMIN || ket == OP_KETRMAX || has_alternatives) ? 2 : 1;
5785 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));
5786 if (ket == OP_KETRMAX)
5787 {
5788 /* TMP2 which is set here used by OP_KETRMAX below. */
5789 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
5790 }
5791 }
5792 }
5793
5794 stacksize = 0;
5795 if (ket != OP_KET || bra != OP_BRA)
5796 stacksize++;
5797 if (has_alternatives && opcode != OP_ONCE)
5798 stacksize++;
5799
5800 if (stacksize > 0)
5801 allocate_stack(common, stacksize);
5802
5803 stacksize = 0;
5804 if (ket != OP_KET)
5805 {
5806 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), STR_PTR, 0);
5807 stacksize++;
5808 }
5809 else if (bra != OP_BRA)
5810 {
5811 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), SLJIT_IMM, 0);
5812 stacksize++;
5813 }
5814
5815 if (has_alternatives)
5816 {
5817 if (opcode != OP_ONCE)
5818 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize), SLJIT_IMM, 0);
5819 if (ket != OP_KETRMAX)
5820 BACKTRACK_AS(bracket_backtrack)->alternative_matchingpath = LABEL();
5821 }
5822
5823 /* Must be after the matchingpath label. */
5824 if (offset != 0)
5825 {
5826 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5827 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1), STR_PTR, 0);
5828 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 0), TMP1, 0);
5829 }
5830
5831 if (ket == OP_KETRMAX)
5832 {
5833 if (opcode == OP_ONCE || opcode >= OP_SBRA)
5834 {
5835 if (has_alternatives)
5836 BACKTRACK_AS(bracket_backtrack)->alternative_matchingpath = LABEL();
5837 /* Checking zero-length iteration. */
5838 if (opcode != OP_ONCE)
5839 {
5840 CMPTO(SLJIT_C_NOT_EQUAL, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STR_PTR, 0, rmaxlabel);
5841 /* Drop STR_PTR for greedy plus quantifier. */
5842 if (bra != OP_BRAZERO)
5843 free_stack(common, 1);
5844 }
5845 else
5846 /* TMP2 must contain the starting STR_PTR. */
5847 CMPTO(SLJIT_C_NOT_EQUAL, TMP2, 0, STR_PTR, 0, rmaxlabel);
5848 }
5849 else
5850 JUMPTO(SLJIT_JUMP, rmaxlabel);
5851 BACKTRACK_AS(bracket_backtrack)->recursive_matchingpath = LABEL();
5852 }
5853
5854 if (bra == OP_BRAZERO)
5855 BACKTRACK_AS(bracket_backtrack)->zero_matchingpath = LABEL();
5856
5857 if (bra == OP_BRAMINZERO)
5858 {
5859 /* This is a backtrack path! (From the viewpoint of OP_BRAMINZERO) */
5860 JUMPTO(SLJIT_JUMP, ((braminzero_backtrack *)parent)->matchingpath);
5861 if (braminzerojump != NULL)
5862 {
5863 JUMPHERE(braminzerojump);
5864 /* We need to release the end pointer to perform the
5865 backtrack for the zero-length iteration. When
5866 framesize is < 0, OP_ONCE will do the release itself. */
5867 if (opcode == OP_ONCE && BACKTRACK_AS(bracket_backtrack)->u.framesize >= 0)
5868 {
5869 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5870 add_jump(compiler, &common->revertframes, JUMP(SLJIT_FAST_CALL));
5871 }
5872 else if (ket == OP_KETRMIN && opcode != OP_ONCE)
5873 free_stack(common, 1);
5874 }
5875 /* Continue to the normal backtrack. */
5876 }
5877
5878 if ((ket != OP_KET && bra != OP_BRAMINZERO) || bra == OP_BRAZERO)
5879 decrease_call_count(common);
5880
5881 /* Skip the other alternatives. */
5882 while (*cc == OP_ALT)
5883 cc += GET(cc, 1);
5884 cc += 1 + LINK_SIZE;
5885 return cc;
5886 }
5887
5888 static pcre_uchar *compile_bracketpos_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
5889 {
5890 DEFINE_COMPILER;
5891 backtrack_common *backtrack;
5892 pcre_uchar opcode;
5893 int private_data_ptr;
5894 int cbraprivptr = 0;
5895 int framesize;
5896 int stacksize;
5897 int offset = 0;
5898 BOOL zero = FALSE;
5899 pcre_uchar *ccbegin = NULL;
5900 int stack;
5901 struct sljit_label *loop = NULL;
5902 struct jump_list *emptymatch = NULL;
5903
5904 PUSH_BACKTRACK(sizeof(bracketpos_backtrack), cc, NULL);
5905 if (*cc == OP_BRAPOSZERO)
5906 {
5907 zero = TRUE;
5908 cc++;
5909 }
5910
5911 opcode = *cc;
5912 private_data_ptr = PRIVATE_DATA(cc);
5913 SLJIT_ASSERT(private_data_ptr != 0);
5914 BACKTRACK_AS(bracketpos_backtrack)->private_data_ptr = private_data_ptr;
5915 switch(opcode)
5916 {
5917 case OP_BRAPOS:
5918 case OP_SBRAPOS:
5919 ccbegin = cc + 1 + LINK_SIZE;
5920 break;
5921
5922 case OP_CBRAPOS:
5923 case OP_SCBRAPOS:
5924 offset = GET2(cc, 1 + LINK_SIZE);
5925 /* This case cannot be optimized in the same was as
5926 normal capturing brackets. */
5927 SLJIT_ASSERT(common->optimized_cbracket[offset] == 0);
5928 cbraprivptr = OVECTOR_PRIV(offset);
5929 offset <<= 1;
5930 ccbegin = cc + 1 + LINK_SIZE + IMM2_SIZE;
5931 break;
5932
5933 default:
5934 SLJIT_ASSERT_STOP();
5935 break;
5936 }
5937
5938 framesize = get_framesize(common, cc, FALSE);
5939 BACKTRACK_AS(bracketpos_backtrack)->framesize = framesize;
5940 if (framesize < 0)
5941 {
5942 stacksize = (opcode == OP_CBRAPOS || opcode == OP_SCBRAPOS) ? 2 : 1;
5943 if (!zero)
5944 stacksize++;
5945 BACKTRACK_AS(bracketpos_backtrack)->stacksize = stacksize;
5946 allocate_stack(common, stacksize);
5947 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, STACK_TOP, 0);
5948
5949 if (opcode == OP_CBRAPOS || opcode == OP_SCBRAPOS)
5950 {
5951 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset));
5952 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1));
5953 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP1, 0);
5954 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), TMP2, 0);
5955 }
5956 else
5957 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
5958
5959 if (!zero)
5960 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize - 1), SLJIT_IMM, 1);
5961 }
5962 else
5963 {
5964 stacksize = framesize + 1;
5965 if (!zero)
5966 stacksize++;
5967 if (opcode == OP_BRAPOS || opcode == OP_SBRAPOS)
5968 stacksize++;
5969 BACKTRACK_AS(bracketpos_backtrack)->stacksize = stacksize;
5970 allocate_stack(common, stacksize);
5971
5972 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
5973 OP2(SLJIT_SUB, TMP2, 0, STACK_TOP, 0, SLJIT_IMM, -STACK(stacksize - 1));
5974 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, TMP2, 0);
5975 stack = 0;
5976 if (!zero)
5977 {
5978 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 1);
5979 stack++;
5980 }
5981 if (opcode == OP_BRAPOS || opcode == OP_SBRAPOS)
5982 {
5983 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stack), STR_PTR, 0);
5984 stack++;
5985 }
5986 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stack), TMP1, 0);
5987 init_frame(common, cc, stacksize - 1, stacksize - framesize, FALSE);
5988 }
5989
5990 if (opcode == OP_CBRAPOS || opcode == OP_SCBRAPOS)
5991 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), cbraprivptr, STR_PTR, 0);
5992
5993 loop = LABEL();
5994 while (*cc != OP_KETRPOS)
5995 {
5996 backtrack->top = NULL;
5997 backtrack->topbacktracks = NULL;
5998 cc += GET(cc, 1);
5999
6000 compile_matchingpath(common, ccbegin, cc, backtrack);
6001 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
6002 return NULL;
6003
6004 if (framesize < 0)
6005 {
6006 OP1(SLJIT_MOV, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6007
6008 if (opcode == OP_CBRAPOS || opcode == OP_SCBRAPOS)
6009 {
6010 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), cbraprivptr);
6011 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1), STR_PTR, 0);
6012 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), cbraprivptr, STR_PTR, 0);
6013 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset), TMP1, 0);
6014 }
6015 else
6016 {
6017 if (opcode == OP_SBRAPOS)
6018 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
6019 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
6020 }
6021
6022 if (opcode == OP_SBRAPOS || opcode == OP_SCBRAPOS)
6023 add_jump(compiler, &emptymatch, CMP(SLJIT_C_EQUAL, TMP1, 0, STR_PTR, 0));
6024
6025 if (!zero)
6026 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize - 1), SLJIT_IMM, 0);
6027 }
6028 else
6029 {
6030 if (opcode == OP_CBRAPOS || opcode == OP_SCBRAPOS)
6031 {
6032 OP2(SLJIT_ADD, STACK_TOP, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr, SLJIT_IMM, stacksize * sizeof(sljit_w));
6033 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), cbraprivptr);
6034 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1), STR_PTR, 0);
6035 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), cbraprivptr, STR_PTR, 0);
6036 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset), TMP1, 0);
6037 }
6038 else
6039 {
6040 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6041 OP2(SLJIT_ADD, STACK_TOP, 0, TMP2, 0, SLJIT_IMM, stacksize * sizeof(sljit_w));
6042 if (opcode == OP_SBRAPOS)
6043 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(TMP2), (framesize + 1) * sizeof(sljit_w));
6044 OP1(SLJIT_MOV, SLJIT_MEM1(TMP2), (framesize + 1) * sizeof(sljit_w), STR_PTR, 0);
6045 }
6046
6047 if (opcode == OP_SBRAPOS || opcode == OP_SCBRAPOS)
6048 add_jump(compiler, &emptymatch, CMP(SLJIT_C_EQUAL, TMP1, 0, STR_PTR, 0));
6049
6050 if (!zero)
6051 {
6052 if (framesize < 0)
6053 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(stacksize - 1), SLJIT_IMM, 0);
6054 else
6055 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
6056 }
6057 }
6058 JUMPTO(SLJIT_JUMP, loop);
6059 flush_stubs(common);
6060
6061 compile_backtrackingpath(common, backtrack->top);
6062 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler)))
6063 return NULL;
6064 set_jumps(backtrack->topbacktracks, LABEL());
6065
6066 if (framesize < 0)
6067 {
6068 if (opcode == OP_CBRAPOS || opcode == OP_SCBRAPOS)
6069 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), cbraprivptr);
6070 else
6071 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
6072 }
6073 else
6074 {
6075 if (opcode == OP_CBRAPOS || opcode == OP_SCBRAPOS)
6076 {
6077 /* Last alternative. */
6078 if (*cc == OP_KETRPOS)
6079 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6080 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), cbraprivptr);
6081 }
6082 else
6083 {
6084 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), private_data_ptr);
6085 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(TMP2), (framesize + 1) * sizeof(sljit_w));
6086 }
6087 }
6088
6089 if (*cc == OP_KETRPOS)
6090 break;
6091 ccbegin = cc + 1 + LINK_SIZE;
6092 }
6093
6094 backtrack->topbacktracks = NULL;
6095 if (!zero)
6096 {
6097 if (framesize < 0)
6098 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_NOT_EQUAL, SLJIT_MEM1(STACK_TOP), STACK(stacksize - 1), SLJIT_IMM, 0));
6099 else /* TMP2 is set to [private_data_ptr] above. */
6100 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_NOT_EQUAL, SLJIT_MEM1(TMP2), (stacksize - 1) * sizeof(sljit_w), SLJIT_IMM, 0));
6101 }
6102
6103 /* None of them matched. */
6104 set_jumps(emptymatch, LABEL());
6105 decrease_call_count(common);
6106 return cc + 1 + LINK_SIZE;
6107 }
6108
6109 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)
6110 {
6111 int class_len;
6112
6113 *opcode = *cc;
6114 if (*opcode >= OP_STAR && *opcode <= OP_POSUPTO)
6115 {
6116 cc++;
6117 *type = OP_CHAR;
6118 }
6119 else if (*opcode >= OP_STARI && *opcode <= OP_POSUPTOI)
6120 {
6121 cc++;
6122 *type = OP_CHARI;
6123 *opcode -= OP_STARI - OP_STAR;
6124 }
6125 else if (*opcode >= OP_NOTSTAR && *opcode <= OP_NOTPOSUPTO)
6126 {
6127 cc++;
6128 *type = OP_NOT;
6129 *opcode -= OP_NOTSTAR - OP_STAR;
6130 }
6131 else if (*opcode >= OP_NOTSTARI && *opcode <= OP_NOTPOSUPTOI)
6132 {
6133 cc++;
6134 *type = OP_NOTI;
6135 *opcode -= OP_NOTSTARI - OP_STAR;
6136 }
6137 else if (*opcode >= OP_TYPESTAR && *opcode <= OP_TYPEPOSUPTO)
6138 {
6139 cc++;
6140 *opcode -= OP_TYPESTAR - OP_STAR;
6141 *type = 0;
6142 }
6143 else
6144 {
6145 SLJIT_ASSERT(*opcode >= OP_CLASS || *opcode <= OP_XCLASS);
6146 *type = *opcode;
6147 cc++;
6148 class_len = (*type < OP_XCLASS) ? (int)(1 + (32 / sizeof(pcre_uchar))) : GET(cc, 0);
6149 *opcode = cc[class_len - 1];
6150 if (*opcode >= OP_CRSTAR && *opcode <= OP_CRMINQUERY)
6151 {
6152 *opcode -= OP_CRSTAR - OP_STAR;
6153 if (end != NULL)
6154 *end = cc + class_len;
6155 }
6156 else
6157 {
6158 SLJIT_ASSERT(*opcode == OP_CRRANGE || *opcode == OP_CRMINRANGE);
6159 *arg1 = GET2(cc, (class_len + IMM2_SIZE));
6160 *arg2 = GET2(cc, class_len);
6161
6162 if (*arg2 == 0)
6163 {
6164 SLJIT_ASSERT(*arg1 != 0);
6165 *opcode = (*opcode == OP_CRRANGE) ? OP_UPTO : OP_MINUPTO;
6166 }
6167 if (*arg1 == *arg2)
6168 *opcode = OP_EXACT;
6169
6170 if (end != NULL)
6171 *end = cc + class_len + 2 * IMM2_SIZE;
6172 }
6173 return cc;
6174 }
6175
6176 if (*opcode == OP_UPTO || *opcode == OP_MINUPTO || *opcode == OP_EXACT || *opcode == OP_POSUPTO)
6177 {
6178 *arg1 = GET2(cc, 0);
6179 cc += IMM2_SIZE;
6180 }
6181
6182 if (*type == 0)
6183 {
6184 *type = *cc;
6185 if (end != NULL)
6186 *end = next_opcode(common, cc);
6187 cc++;
6188 return cc;
6189 }
6190
6191 if (end != NULL)
6192 {
6193 *end = cc + 1;
6194 #ifdef SUPPORT_UTF
6195 if (common->utf && HAS_EXTRALEN(*cc)) *end += GET_EXTRALEN(*cc);
6196 #endif
6197 }
6198 return cc;
6199 }
6200
6201 static pcre_uchar *compile_iterator_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
6202 {
6203 DEFINE_COMPILER;
6204 backtrack_common *backtrack;
6205 pcre_uchar opcode;
6206 pcre_uchar type;
6207 int arg1 = -1, arg2 = -1;
6208 pcre_uchar* end;
6209 jump_list *nomatch = NULL;
6210 struct sljit_jump *jump = NULL;
6211 struct sljit_label *label;
6212 int private_data_ptr = PRIVATE_DATA(cc);
6213 int base = (private_data_ptr == 0) ? SLJIT_MEM1(STACK_TOP) : SLJIT_MEM1(SLJIT_LOCALS_REG);
6214 int offset0 = (private_data_ptr == 0) ? STACK(0) : private_data_ptr;
6215 int offset1 = (private_data_ptr == 0) ? STACK(1) : private_data_ptr + (int)sizeof(sljit_w);
6216 int tmp_base, tmp_offset;
6217
6218 PUSH_BACKTRACK(sizeof(iterator_backtrack), cc, NULL);
6219
6220 cc = get_iterator_parameters(common, cc, &opcode, &type, &arg1, &arg2, &end);
6221
6222 switch (type)
6223 {
6224 case OP_NOT_DIGIT:
6225 case OP_DIGIT:
6226 case OP_NOT_WHITESPACE:
6227 case OP_WHITESPACE:
6228 case OP_NOT_WORDCHAR:
6229 case OP_WORDCHAR:
6230 case OP_ANY:
6231 case OP_ALLANY:
6232 case OP_ANYBYTE:
6233 case OP_ANYNL:
6234 case OP_NOT_HSPACE:
6235 case OP_HSPACE:
6236 case OP_NOT_VSPACE:
6237 case OP_VSPACE:
6238 case OP_CHAR:
6239 case OP_CHARI:
6240 case OP_NOT:
6241 case OP_NOTI:
6242 case OP_CLASS:
6243 case OP_NCLASS:
6244 tmp_base = TMP3;
6245 tmp_offset = 0;
6246 break;
6247
6248 default:
6249 SLJIT_ASSERT_STOP();
6250 /* Fall through. */
6251
6252 case OP_EXTUNI:
6253 case OP_XCLASS:
6254 case OP_NOTPROP:
6255 case OP_PROP:
6256 tmp_base = SLJIT_MEM1(SLJIT_LOCALS_REG);
6257 tmp_offset = POSSESSIVE0;
6258 break;
6259 }
6260
6261 switch(opcode)
6262 {
6263 case OP_STAR:
6264 case OP_PLUS:
6265 case OP_UPTO:
6266 case OP_CRRANGE:
6267 if (type == OP_ANYNL || type == OP_EXTUNI)
6268 {
6269 SLJIT_ASSERT(private_data_ptr == 0);
6270 if (opcode == OP_STAR || opcode == OP_UPTO)
6271 {
6272 allocate_stack(common, 2);
6273 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
6274 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), SLJIT_IMM, 0);
6275 }
6276 else
6277 {
6278 allocate_stack(common, 1);
6279 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
6280 }
6281
6282 if (opcode == OP_UPTO || opcode == OP_CRRANGE)
6283 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0, SLJIT_IMM, 0);
6284
6285 label = LABEL();
6286 compile_char1_matchingpath(common, type, cc, &backtrack->topbacktracks);
6287 if (opcode == OP_UPTO || opcode == OP_CRRANGE)
6288 {
6289 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0);
6290 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
6291 if (opcode == OP_CRRANGE && arg2 > 0)
6292 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, arg2, label);
6293 if (opcode == OP_UPTO || (opcode == OP_CRRANGE && arg1 > 0))
6294 jump = CMP(SLJIT_C_GREATER_EQUAL, TMP1, 0, SLJIT_IMM, arg1);
6295 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE0, TMP1, 0);
6296 }
6297
6298 /* We cannot use TMP3 because of this allocate_stack. */
6299 allocate_stack(common, 1);
6300 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
6301 JUMPTO(SLJIT_JUMP, label);
6302 if (jump != NULL)
6303 JUMPHERE(jump);
6304 }
6305 else
6306 {
6307 if (opcode == OP_PLUS)
6308 compile_char1_matchingpath(common, type, cc, &backtrack->topbacktracks);
6309 if (private_data_ptr == 0)
6310 allocate_stack(common, 2);
6311 OP1(SLJIT_MOV, base, offset0, STR_PTR, 0);
6312 if (opcode <= OP_PLUS)
6313 OP1(SLJIT_MOV, base, offset1, STR_PTR, 0);
6314 else
6315 OP1(SLJIT_MOV, base, offset1, SLJIT_IMM, 1);
6316 label = LABEL();
6317 compile_char1_matchingpath(common, type, cc, &nomatch);
6318 OP1(SLJIT_MOV, base, offset0, STR_PTR, 0);
6319 if (opcode <= OP_PLUS)
6320 JUMPTO(SLJIT_JUMP, label);
6321 else if (opcode == OP_CRRANGE && arg1 == 0)
6322 {
6323 OP2(SLJIT_ADD, base, offset1, base, offset1, SLJIT_IMM, 1);
6324 JUMPTO(SLJIT_JUMP, label);
6325 }
6326 else
6327 {
6328 OP1(SLJIT_MOV, TMP1, 0, base, offset1);
6329 OP2(SLJIT_ADD, TMP1, 0, TMP1, 0, SLJIT_IMM, 1);
6330 OP1(SLJIT_MOV, base, offset1, TMP1, 0);
6331 CMPTO(SLJIT_C_LESS, TMP1, 0, SLJIT_IMM, arg1 + 1, label);
6332 }
6333 set_jumps(nomatch, LABEL());
6334 if (opcode == OP_CRRANGE)
6335 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_LESS, base, offset1, SLJIT_IMM, arg2 + 1));
6336 OP1(SLJIT_MOV, STR_PTR, 0, base, offset0);
6337 }
6338 BACKTRACK_AS(iterator_backtrack)->matchingpath = LABEL();
6339 break;
6340
6341 case OP_MINSTAR:
6342 case OP_MINPLUS:
6343 if (opcode == OP_MINPLUS)
6344 compile_char1_matchingpath(common, type, cc, &backtrack->topbacktracks);
6345 if (private_data_ptr == 0)
6346 allocate_stack(common, 1);
6347 OP1(SLJIT_MOV, base, offset0, STR_PTR, 0);
6348 BACKTRACK_AS(iterator_backtrack)->matchingpath = LABEL();
6349 break;
6350
6351 case OP_MINUPTO:
6352 case OP_CRMINRANGE:
6353 if (private_data_ptr == 0)
6354 allocate_stack(common, 2);
6355 OP1(SLJIT_MOV, base, offset0, STR_PTR, 0);
6356 OP1(SLJIT_MOV, base, offset1, SLJIT_IMM, 1);
6357 if (opcode == OP_CRMINRANGE)
6358 add_jump(compiler, &backtrack->topbacktracks, JUMP(SLJIT_JUMP));
6359 BACKTRACK_AS(iterator_backtrack)->matchingpath = LABEL();
6360 break;
6361
6362 case OP_QUERY:
6363 case OP_MINQUERY:
6364 if (private_data_ptr == 0)
6365 allocate_stack(common, 1);
6366 OP1(SLJIT_MOV, base, offset0, STR_PTR, 0);
6367 if (opcode == OP_QUERY)
6368 compile_char1_matchingpath(common, type, cc, &backtrack->topbacktracks);
6369 BACKTRACK_AS(iterator_backtrack)->matchingpath = LABEL();
6370 break;
6371
6372 case OP_EXACT:
6373 OP1(SLJIT_MOV, tmp_base, tmp_offset, SLJIT_IMM, arg1);
6374 label = LABEL();
6375 compile_char1_matchingpath(common, type, cc, &backtrack->topbacktracks);
6376 OP2(SLJIT_SUB | SLJIT_SET_E, tmp_base, tmp_offset, tmp_base, tmp_offset, SLJIT_IMM, 1);
6377 JUMPTO(SLJIT_C_NOT_ZERO, label);
6378 break;
6379
6380 case OP_POSSTAR:
6381 case OP_POSPLUS:
6382 case OP_POSUPTO:
6383 if (opcode == OP_POSPLUS)
6384 compile_char1_matchingpath(common, type, cc, &backtrack->topbacktracks);
6385 if (opcode == OP_POSUPTO)
6386 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1, SLJIT_IMM, arg1);
6387 OP1(SLJIT_MOV, tmp_base, tmp_offset, STR_PTR, 0);
6388 label = LABEL();
6389 compile_char1_matchingpath(common, type, cc, &nomatch);
6390 OP1(SLJIT_MOV, tmp_base, tmp_offset, STR_PTR, 0);
6391 if (opcode != OP_POSUPTO)
6392 JUMPTO(SLJIT_JUMP, label);
6393 else
6394 {
6395 OP2(SLJIT_SUB | SLJIT_SET_E, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1, SLJIT_MEM1(SLJIT_LOCALS_REG), POSSESSIVE1, SLJIT_IMM, 1);
6396 JUMPTO(SLJIT_C_NOT_ZERO, label);
6397 }
6398 set_jumps(nomatch, LABEL());
6399 OP1(SLJIT_MOV, STR_PTR, 0, tmp_base, tmp_offset);
6400 break;
6401
6402 case OP_POSQUERY:
6403 OP1(SLJIT_MOV, tmp_base, tmp_offset, STR_PTR, 0);
6404 compile_char1_matchingpath(common, type, cc, &nomatch);
6405 OP1(SLJIT_MOV, tmp_base, tmp_offset, STR_PTR, 0);
6406 set_jumps(nomatch, LABEL());
6407 OP1(SLJIT_MOV, STR_PTR, 0, tmp_base, tmp_offset);
6408 break;
6409
6410 default:
6411 SLJIT_ASSERT_STOP();
6412 break;
6413 }
6414
6415 decrease_call_count(common);
6416 return end;
6417 }
6418
6419 static SLJIT_INLINE pcre_uchar *compile_fail_accept_matchingpath(compiler_common *common, pcre_uchar *cc, backtrack_common *parent)
6420 {
6421 DEFINE_COMPILER;
6422 backtrack_common *backtrack;
6423
6424 PUSH_BACKTRACK(sizeof(bracket_backtrack), cc, NULL);
6425
6426 if (*cc == OP_FAIL)
6427 {
6428 add_jump(compiler, &backtrack->topbacktracks, JUMP(SLJIT_JUMP));
6429 return cc + 1;
6430 }
6431
6432 if (*cc == OP_ASSERT_ACCEPT || common->currententry != NULL)
6433 {
6434 /* No need to check notempty conditions. */
6435 if (common->acceptlabel == NULL)
6436 add_jump(compiler, &common->accept, JUMP(SLJIT_JUMP));
6437 else
6438 JUMPTO(SLJIT_JUMP, common->acceptlabel);
6439 return cc + 1;
6440 }
6441
6442 if (common->acceptlabel == NULL)
6443 add_jump(compiler, &common->accept, CMP(SLJIT_C_NOT_EQUAL, STR_PTR, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0)));
6444 else
6445 CMPTO(SLJIT_C_NOT_EQUAL, STR_PTR, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0), common->acceptlabel);
6446 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
6447 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, notempty));
6448 add_jump(compiler, &backtrack->topbacktracks, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, SLJIT_IMM, 0));
6449 OP1(SLJIT_MOV_UB, TMP2, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, notempty_atstart));
6450 if (common->acceptlabel == NULL)
6451 add_jump(compiler, &common->accept, CMP(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, 0));
6452 else
6453 CMPTO(SLJIT_C_EQUAL, TMP2, 0, SLJIT_IMM, 0, common->acceptlabel);
6454 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, str));
6455 if (common->acceptlabel == NULL)
6456 add_jump(compiler, &common->accept, CMP(SLJIT_C_NOT_EQUAL, TMP2, 0, STR_PTR, 0));
6457 else
6458 CMPTO(SLJIT_C_NOT_EQUAL, TMP2, 0, STR_PTR, 0, common->acceptlabel);
6459 add_jump(compiler, &backtrack->topbacktracks, JUMP(SLJIT_JUMP));
6460 return cc + 1;
6461 }
6462
6463 static SLJIT_INLINE pcre_uchar *compile_close_matchingpath(compiler_common *common, pcre_uchar *cc)
6464 {
6465 DEFINE_COMPILER;
6466 int offset = GET2(cc, 1);
6467 BOOL optimized_cbracket = common->optimized_cbracket[offset] != 0;
6468
6469 /* Data will be discarded anyway... */
6470 if (common->currententry != NULL)
6471 return cc + 1 + IMM2_SIZE;
6472
6473 if (!optimized_cbracket)
6474 OP1(SLJIT_MOV, TMP1, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR_PRIV(offset));
6475 offset <<= 1;
6476 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset + 1), STR_PTR, 0);
6477 if (!optimized_cbracket)
6478 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(offset), TMP1, 0);
6479 return cc + 1 + IMM2_SIZE;
6480 }
6481
6482 static void compile_matchingpath(compiler_common *common, pcre_uchar *cc, pcre_uchar *ccend, backtrack_common *parent)
6483 {
6484 DEFINE_COMPILER;
6485 backtrack_common *backtrack;
6486
6487 while (cc < ccend)
6488 {
6489 switch(*cc)
6490 {
6491 case OP_SOD:
6492 case OP_SOM:
6493 case OP_NOT_WORD_BOUNDARY:
6494 case OP_WORD_BOUNDARY:
6495 case OP_NOT_DIGIT:
6496 case OP_DIGIT:
6497 case OP_NOT_WHITESPACE:
6498 case OP_WHITESPACE:
6499 case OP_NOT_WORDCHAR:
6500 case OP_WORDCHAR:
6501 case OP_ANY:
6502 case OP_ALLANY:
6503 case OP_ANYBYTE:
6504 case OP_NOTPROP:
6505 case OP_PROP:
6506 case OP_ANYNL:
6507 case OP_NOT_HSPACE:
6508 case OP_HSPACE:
6509 case OP_NOT_VSPACE:
6510 case OP_VSPACE:
6511 case OP_EXTUNI:
6512 case OP_EODN:
6513 case OP_EOD:
6514 case OP_CIRC:
6515 case OP_CIRCM:
6516 case OP_DOLL:
6517 case OP_DOLLM:
6518 case OP_NOT:
6519 case OP_NOTI:
6520 case OP_REVERSE:
6521 cc = compile_char1_matchingpath(common, *cc, cc + 1, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks);
6522 break;
6523
6524 case OP_SET_SOM:
6525 PUSH_BACKTRACK_NOVALUE(sizeof(backtrack_common), cc);
6526 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0));
6527 allocate_stack(common, 1);
6528 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), OVECTOR(0), STR_PTR, 0);
6529 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
6530 cc++;
6531 break;
6532
6533 case OP_CHAR:
6534 case OP_CHARI:
6535 if (common->mode == JIT_COMPILE)
6536 cc = compile_charn_matchingpath(common, cc, ccend, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks);
6537 else
6538 cc = compile_char1_matchingpath(common, *cc, cc + 1, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks);
6539 break;
6540
6541 case OP_STAR:
6542 case OP_MINSTAR:
6543 case OP_PLUS:
6544 case OP_MINPLUS:
6545 case OP_QUERY:
6546 case OP_MINQUERY:
6547 case OP_UPTO:
6548 case OP_MINUPTO:
6549 case OP_EXACT:
6550 case OP_POSSTAR:
6551 case OP_POSPLUS:
6552 case OP_POSQUERY:
6553 case OP_POSUPTO:
6554 case OP_STARI:
6555 case OP_MINSTARI:
6556 case OP_PLUSI:
6557 case OP_MINPLUSI:
6558 case OP_QUERYI:
6559 case OP_MINQUERYI:
6560 case OP_UPTOI:
6561 case OP_MINUPTOI:
6562 case OP_EXACTI:
6563 case OP_POSSTARI:
6564 case OP_POSPLUSI:
6565 case OP_POSQUERYI:
6566 case OP_POSUPTOI:
6567 case OP_NOTSTAR:
6568 case OP_NOTMINSTAR:
6569 case OP_NOTPLUS:
6570 case OP_NOTMINPLUS:
6571 case OP_NOTQUERY:
6572 case OP_NOTMINQUERY:
6573 case OP_NOTUPTO:
6574 case OP_NOTMINUPTO:
6575 case OP_NOTEXACT:
6576 case OP_NOTPOSSTAR:
6577 case OP_NOTPOSPLUS:
6578 case OP_NOTPOSQUERY:
6579 case OP_NOTPOSUPTO:
6580 case OP_NOTSTARI:
6581 case OP_NOTMINSTARI:
6582 case OP_NOTPLUSI:
6583 case OP_NOTMINPLUSI:
6584 case OP_NOTQUERYI:
6585 case OP_NOTMINQUERYI:
6586 case OP_NOTUPTOI:
6587 case OP_NOTMINUPTOI:
6588 case OP_NOTEXACTI:
6589 case OP_NOTPOSSTARI:
6590 case OP_NOTPOSPLUSI:
6591 case OP_NOTPOSQUERYI:
6592 case OP_NOTPOSUPTOI:
6593 case OP_TYPESTAR:
6594 case OP_TYPEMINSTAR:
6595 case OP_TYPEPLUS:
6596 case OP_TYPEMINPLUS:
6597 case OP_TYPEQUERY:
6598 case OP_TYPEMINQUERY:
6599 case OP_TYPEUPTO:
6600 case OP_TYPEMINUPTO:
6601 case OP_TYPEEXACT:
6602 case OP_TYPEPOSSTAR:
6603 case OP_TYPEPOSPLUS:
6604 case OP_TYPEPOSQUERY:
6605 case OP_TYPEPOSUPTO:
6606 cc = compile_iterator_matchingpath(common, cc, parent);
6607 break;
6608
6609 case OP_CLASS:
6610 case OP_NCLASS:
6611 if (cc[1 + (32 / sizeof(pcre_uchar))] >= OP_CRSTAR && cc[1 + (32 / sizeof(pcre_uchar))] <= OP_CRMINRANGE)
6612 cc = compile_iterator_matchingpath(common, cc, parent);
6613 else
6614 cc = compile_char1_matchingpath(common, *cc, cc + 1, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks);
6615 break;
6616
6617 #if defined SUPPORT_UTF || defined COMPILE_PCRE16
6618 case OP_XCLASS:
6619 if (*(cc + GET(cc, 1)) >= OP_CRSTAR && *(cc + GET(cc, 1)) <= OP_CRMINRANGE)
6620 cc = compile_iterator_matchingpath(common, cc, parent);
6621 else
6622 cc = compile_char1_matchingpath(common, *cc, cc + 1, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks);
6623 break;
6624 #endif
6625
6626 case OP_REF:
6627 case OP_REFI:
6628 if (cc[1 + IMM2_SIZE] >= OP_CRSTAR && cc[1 + IMM2_SIZE] <= OP_CRMINRANGE)
6629 cc = compile_ref_iterator_matchingpath(common, cc, parent);
6630 else
6631 cc = compile_ref_matchingpath(common, cc, parent->top != NULL ? &parent->top->nextbacktracks : &parent->topbacktracks, TRUE, FALSE);
6632 break;
6633
6634 case OP_RECURSE:
6635 cc = compile_recurse_matchingpath(common, cc, parent);
6636 break;
6637
6638 case OP_ASSERT:
6639 case OP_ASSERT_NOT:
6640 case OP_ASSERTBACK:
6641 case OP_ASSERTBACK_NOT:
6642 PUSH_BACKTRACK_NOVALUE(sizeof(assert_backtrack), cc);
6643 cc = compile_assert_matchingpath(common, cc, BACKTRACK_AS(assert_backtrack), FALSE);
6644 break;
6645
6646 case OP_BRAMINZERO:
6647 PUSH_BACKTRACK_NOVALUE(sizeof(braminzero_backtrack), cc);
6648 cc = bracketend(cc + 1);
6649 if (*(cc - 1 - LINK_SIZE) != OP_KETRMIN)
6650 {
6651 allocate_stack(common, 1);
6652 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), STR_PTR, 0);
6653 }
6654 else
6655 {
6656 allocate_stack(common, 2);
6657 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), SLJIT_IMM, 0);
6658 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(1), STR_PTR, 0);
6659 }
6660 BACKTRACK_AS(braminzero_backtrack)->matchingpath = LABEL();
6661 if (cc[1] > OP_ASSERTBACK_NOT)
6662 decrease_call_count(common);
6663 break;
6664
6665 case OP_ONCE:
6666 case OP_ONCE_NC:
6667 case OP_BRA:
6668 case OP_CBRA:
6669 case OP_COND:
6670 case OP_SBRA:
6671 case OP_SCBRA:
6672 case OP_SCOND:
6673 cc = compile_bracket_matchingpath(common, cc, parent);
6674 break;
6675
6676 case OP_BRAZERO:
6677 if (cc[1] > OP_ASSERTBACK_NOT)
6678 cc = compile_bracket_matchingpath(common, cc, parent);
6679 else
6680 {
6681 PUSH_BACKTRACK_NOVALUE(sizeof(assert_backtrack), cc);
6682 cc = compile_assert_matchingpath(common, cc, BACKTRACK_AS(assert_backtrack), FALSE);
6683 }
6684 break;
6685
6686 case OP_BRAPOS:
6687 case OP_CBRAPOS:
6688 case OP_SBRAPOS:
6689 case OP_SCBRAPOS:
6690 case OP_BRAPOSZERO:
6691 cc = compile_bracketpos_matchingpath(common, cc, parent);
6692 break;
6693
6694 case OP_MARK:
6695 PUSH_BACKTRACK_NOVALUE(sizeof(backtrack_common), cc);
6696 SLJIT_ASSERT(common->mark_ptr != 0);
6697 OP1(SLJIT_MOV, TMP2, 0, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mark_ptr);
6698 allocate_stack(common, 1);
6699 OP1(SLJIT_MOV, TMP1, 0, ARGUMENTS, 0);
6700 OP1(SLJIT_MOV, SLJIT_MEM1(STACK_TOP), STACK(0), TMP2, 0);
6701 OP1(SLJIT_MOV, TMP2, 0, SLJIT_IMM, (sljit_w)(cc + 2));
6702 OP1(SLJIT_MOV, SLJIT_MEM1(SLJIT_LOCALS_REG), common->mark_ptr, TMP2, 0);
6703 OP1(SLJIT_MOV, SLJIT_MEM1(TMP1), SLJIT_OFFSETOF(jit_arguments, mark_ptr), TMP2, 0);
6704 cc += 1 + 2 + cc[1];
6705 break;
6706
6707 case OP_COMMIT:
6708 PUSH_BACKTRACK_NOVALUE(sizeof(backtrack_common), cc);
6709 cc += 1;
6710 break;
6711
6712 case OP_FAIL:
6713 case OP_ACCEPT:
6714 case OP_ASSERT_ACCEPT:
6715 cc = compile_fail_accept_matchingpath(common, cc, parent);
6716 break;
6717
6718 case OP_CLOSE:
6719 cc = compile_close_matchingpath(common, cc);
6720 break;
6721
6722 case OP_SKIPZERO:
6723 cc = bracketend(cc + 1);
6724 break;
6725
6726 default:
6727 SLJIT_ASSERT_STOP();
6728 return;
6729 }
6730 if (cc == NULL)
6731 return;
6732 }
6733 SLJIT_ASSERT(cc == ccend);
6734 }
6735
6736 #undef PUSH_BACKTRACK
6737 #undef PUSH_BACKTRACK_NOVALUE
6738 #undef BACKTRACK_AS
6739
6740 #define COMPILE_BACKTRACKINGPATH(current) \
6741 do \
6742 { \
6743 compile_backtrackingpath(common, (current)); \
6744 if (SLJIT_UNLIKELY(sljit_get_compiler_error(compiler))) \
6745 return; \
6746 } \
6747 while (0)
6748
6749 #define CURRENT_AS(type) ((type *)current)
6750
6751 static void compile_iterator_backtrackingpath(compiler_common *common, struct backtrack_common *current)
6752 {
6753 DEFINE_COMPILER;
6754 pcre_uchar *cc = current->cc;
6755 pcre_uchar opcode;
6756 pcre_uchar type;
6757 int arg1 = -1, arg2 = -1;
6758 struct sljit_label *label = NULL;
6759 struct sljit_jump *jump = NULL;
6760 jump_list *jumplist = NULL;
6761 int private_data_ptr = PRIVATE_DATA(cc);
6762 int base = (private_data_ptr == 0) ? SLJIT_MEM1(STACK_TOP) : SLJIT_MEM1(SLJIT_LOCALS_REG);
6763 int offset0 = (private_data_ptr == 0) ? STACK(0) : private_data_ptr;
6764 int offset1 = (private_data_ptr == 0) ? STACK(1) : private_data_ptr + (int)sizeof(sljit_w);
6765
6766 cc = get_iterator_parameters(common, cc, &opcode, &type, &arg1, &arg2, NULL);
6767
6768 switch(opcode)
6769 {
6770 case OP_STAR:
6771 case OP_PLUS:
6772 case OP_UPTO:
6773 case OP_CRRANGE:
6774 if (type == OP_ANYNL || type == OP_EXTUNI)
6775 {
6776 SLJIT_ASSERT(private_data_ptr == 0);
6777 set_jumps(current->topbacktracks, LABEL());
6778 OP1(SLJIT_MOV, STR_PTR, 0, SLJIT_MEM1(STACK_TOP), STACK(0));
6779