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