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