34# undef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
36# define USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
39#ifndef USE_TOKEN_THREADED_VM
41# define USE_TOKEN_THREADED_VM 1
43# define USE_TOKEN_THREADED_VM 0
48# define ENC_DUMMY_FLAG (1<<24)
50rb_enc_asciicompat(OnigEncoding enc)
52 return ONIGENC_MBC_MINLEN(enc)==1 && !((enc)->ruby_encoding_index & ENC_DUMMY_FLAG);
54# undef ONIGENC_IS_MBC_ASCII_WORD
55# define ONIGENC_IS_MBC_ASCII_WORD(enc,s,end) \
56 (rb_enc_asciicompat(enc) ? (ISALNUM(*s) || *s=='_') : \
57 onigenc_ascii_is_code_ctype( \
58 ONIGENC_MBC_TO_CODE(enc,s,end),ONIGENC_CTYPE_WORD,enc))
61#ifdef USE_CRNL_AS_LINE_TERMINATOR
62# define ONIGENC_IS_MBC_CRNL(enc,p,end) \
63 (ONIGENC_MBC_TO_CODE(enc,p,end) == 13 && \
64 ONIGENC_MBC_TO_CODE(enc,(p+enclen(enc,p,end)),end) == 10)
65# define ONIGENC_IS_MBC_NEWLINE_EX(enc,p,start,end,option,check_prev) \
66 is_mbc_newline_ex((enc),(p),(start),(end),(option),(check_prev))
68is_mbc_newline_ex(OnigEncoding enc,
const UChar *p,
const UChar *start,
69 const UChar *end, OnigOptionType option,
int check_prev)
71 if (IS_NEWLINE_CRLF(option)) {
72 if (ONIGENC_MBC_TO_CODE(enc, p, end) == 0x0a) {
74 const UChar *prev = onigenc_get_prev_char_head(enc, start, p, end);
75 if ((prev != NULL) && ONIGENC_MBC_TO_CODE(enc, prev, end) == 0x0d)
84 const UChar *pnext = p + enclen(enc, p, end);
86 ONIGENC_MBC_TO_CODE(enc, p, end) == 0x0d &&
87 ONIGENC_MBC_TO_CODE(enc, pnext, end) == 0x0a)
89 if (ONIGENC_IS_MBC_NEWLINE(enc, p, end))
95 return ONIGENC_IS_MBC_NEWLINE(enc, p, end);
99# define ONIGENC_IS_MBC_NEWLINE_EX(enc,p,start,end,option,check_prev) \
100 ONIGENC_IS_MBC_NEWLINE((enc), (p), (end))
103#ifdef USE_CAPTURE_HISTORY
104static void history_tree_free(OnigCaptureTreeNode* node);
107history_tree_clear(OnigCaptureTreeNode* node)
111 if (IS_NOT_NULL(node)) {
112 for (i = 0; i < node->num_childs; i++) {
113 if (IS_NOT_NULL(node->childs[i])) {
114 history_tree_free(node->childs[i]);
117 for (i = 0; i < node->allocated; i++) {
118 node->childs[i] = (OnigCaptureTreeNode* )0;
120 node->num_childs = 0;
121 node->beg = ONIG_REGION_NOTPOS;
122 node->end = ONIG_REGION_NOTPOS;
125 node->childs = (OnigCaptureTreeNode** )0;
130history_tree_free(OnigCaptureTreeNode* node)
132 history_tree_clear(node);
137history_root_free(OnigRegion* r)
139 if (IS_NOT_NULL(r->history_root)) {
140 history_tree_free(r->history_root);
141 r->history_root = (OnigCaptureTreeNode* )0;
145static OnigCaptureTreeNode*
146history_node_new(
void)
148 OnigCaptureTreeNode* node;
150 node = (OnigCaptureTreeNode* )
xmalloc(
sizeof(OnigCaptureTreeNode));
151 CHECK_NULL_RETURN(node);
152 node->childs = (OnigCaptureTreeNode** )0;
154 node->num_childs = 0;
156 node->beg = ONIG_REGION_NOTPOS;
157 node->end = ONIG_REGION_NOTPOS;
163history_tree_add_child(OnigCaptureTreeNode* parent, OnigCaptureTreeNode* child)
165# define HISTORY_TREE_INIT_ALLOC_SIZE 8
167 if (parent->num_childs >= parent->allocated) {
170 if (IS_NULL(parent->childs)) {
171 n = HISTORY_TREE_INIT_ALLOC_SIZE;
173 (OnigCaptureTreeNode** )
xmalloc(
sizeof(OnigCaptureTreeNode*) * n);
174 CHECK_NULL_RETURN_MEMERR(parent->childs);
177 OnigCaptureTreeNode** tmp;
178 n = parent->allocated * 2;
180 (OnigCaptureTreeNode** )
xrealloc(parent->childs,
181 sizeof(OnigCaptureTreeNode*) * n);
183 history_tree_clear(parent);
184 return ONIGERR_MEMORY;
186 parent->childs = tmp;
188 for (i = parent->allocated; i < n; i++) {
189 parent->childs[i] = (OnigCaptureTreeNode* )0;
191 parent->allocated = n;
194 parent->childs[parent->num_childs] = child;
195 parent->num_childs++;
199static OnigCaptureTreeNode*
200history_tree_clone(OnigCaptureTreeNode* node)
203 OnigCaptureTreeNode *clone, *child;
205 clone = history_node_new();
206 CHECK_NULL_RETURN(clone);
208 clone->beg = node->beg;
209 clone->end = node->end;
210 for (i = 0; i < node->num_childs; i++) {
211 child = history_tree_clone(node->childs[i]);
212 if (IS_NULL(child)) {
213 history_tree_free(clone);
214 return (OnigCaptureTreeNode* )0;
216 r = history_tree_add_child(clone, child);
218 history_tree_free(child);
219 history_tree_free(clone);
220 return (OnigCaptureTreeNode* )0;
227extern OnigCaptureTreeNode*
228onig_get_capture_tree(OnigRegion* region)
230 return region->history_root;
234#ifdef USE_MATCH_CACHE
261static OnigPosition count_num_cache_opcodes_inner(
263 MemNumType current_repeat_mem,
int lookaround_nesting,
264 UChar** pp,
long* num_cache_opcodes_ptr
268 UChar* pend = reg->p + reg->used;
270 MemNumType repeat_mem;
271 OnigEncoding enc = reg->enc;
272 long num_cache_opcodes = *num_cache_opcodes_ptr;
281 case OP_EXACT1: p++;
break;
282 case OP_EXACT2: p += 2;
break;
283 case OP_EXACT3: p += 3;
break;
284 case OP_EXACT4: p += 4;
break;
285 case OP_EXACT5: p += 5;
break;
287 GET_LENGTH_INC(
len, p); p +=
len;
break;
288 case OP_EXACTMB2N1: p += 2;
break;
289 case OP_EXACTMB2N2: p += 4;
break;
290 case OP_EXACTMB2N3: p += 6;
break;
292 GET_LENGTH_INC(
len, p); p +=
len * 2;
break;
294 GET_LENGTH_INC(
len, p); p +=
len * 3;
break;
298 GET_LENGTH_INC(mb_len, p);
299 GET_LENGTH_INC(
len, p);
305 len = enclen(enc, p, pend); p +=
len;
break;
307 GET_LENGTH_INC(
len, p); p +=
len;
break;
311 p += SIZE_BITSET;
break;
313 case OP_CCLASS_MB_NOT:
314 GET_LENGTH_INC(
len, p); p +=
len;
break;
316 case OP_CCLASS_MIX_NOT:
318 GET_LENGTH_INC(
len, p);
325 case OP_ANYCHAR_STAR:
326 case OP_ANYCHAR_ML_STAR:
327 num_cache_opcodes++;
break;
328 case OP_ANYCHAR_STAR_PEEK_NEXT:
329 case OP_ANYCHAR_ML_STAR_PEEK_NEXT:
330 p++; num_cache_opcodes++;
break;
335 case OP_NOT_WORD_BOUND:
341 case OP_NOT_ASCII_WORD:
342 case OP_ASCII_WORD_BOUND:
343 case OP_NOT_ASCII_WORD_BOUND:
344 case OP_ASCII_WORD_BEGIN:
345 case OP_ASCII_WORD_END:
352 case OP_SEMI_END_BUF:
353 case OP_BEGIN_POSITION:
360 case OP_BACKREF_MULTI:
361 case OP_BACKREF_MULTI_IC:
362 case OP_BACKREF_WITH_LEVEL:
365 case OP_MEMORY_START:
366 case OP_MEMORY_START_PUSH:
367 case OP_MEMORY_END_PUSH:
368 case OP_MEMORY_END_PUSH_REC:
370 case OP_MEMORY_END_REC:
373 if (lookaround_nesting != 0) {
392 case OP_PUSH_OR_JUMP_EXACT1:
393 case OP_PUSH_IF_PEEK_NEXT:
394 p += SIZE_RELADDR + 1; num_cache_opcodes++;
break;
397 if (current_repeat_mem != -1) {
401 GET_MEMNUM_INC(repeat_mem, p);
403 if (reg->repeat_range[repeat_mem].lower == 0 && reg->repeat_range[repeat_mem].upper == 0) {
404 long dummy_num_cache_opcodes = 0;
405 result = count_num_cache_opcodes_inner(reg, repeat_mem, lookaround_nesting, &p, &dummy_num_cache_opcodes);
406 if (result < 0 || dummy_num_cache_opcodes < 0) {
410 if (reg->repeat_range[repeat_mem].lower == 0) {
413 result = count_num_cache_opcodes_inner(reg, repeat_mem, lookaround_nesting, &p, &num_cache_opcodes);
414 if (result < 0 || num_cache_opcodes < 0) {
418 if (repeat_range->lower < repeat_range->upper) {
424 case OP_REPEAT_INC_NG:
425 GET_MEMNUM_INC(repeat_mem, p);
426 if (repeat_mem != current_repeat_mem) {
431 case OP_REPEAT_INC_SG:
432 case OP_REPEAT_INC_NG_SG:
434 case OP_NULL_CHECK_START:
437 case OP_NULL_CHECK_END:
438 case OP_NULL_CHECK_END_MEMST_PUSH:
441 case OP_NULL_CHECK_END_MEMST:
446 if (lookaround_nesting < 0) {
450 result = count_num_cache_opcodes_inner(reg, current_repeat_mem, lookaround_nesting + 1, &p, &num_cache_opcodes);
451 if (result < 0 || num_cache_opcodes < 0) {
455 case OP_PUSH_POS_NOT:
456 if (lookaround_nesting < 0) {
461 result = count_num_cache_opcodes_inner(reg, current_repeat_mem, lookaround_nesting + 1, &p, &num_cache_opcodes);
462 if (result < 0 || num_cache_opcodes < 0) {
466 case OP_PUSH_LOOK_BEHIND_NOT:
467 if (lookaround_nesting < 0) {
473 result = count_num_cache_opcodes_inner(reg, current_repeat_mem, lookaround_nesting + 1, &p, &num_cache_opcodes);
474 if (result < 0 || num_cache_opcodes < 0) {
478 case OP_PUSH_STOP_BT:
479 if (lookaround_nesting != 0) {
483 result = count_num_cache_opcodes_inner(reg, current_repeat_mem, -1, &p, &num_cache_opcodes);
484 if (result < 0 || num_cache_opcodes < 0) {
490 case OP_FAIL_LOOK_BEHIND_NOT:
497 case OP_PUSH_ABSENT_POS:
509 case OP_STATE_CHECK_PUSH:
510 case OP_STATE_CHECK_PUSH_OR_JUMP:
512 case OP_STATE_CHECK_ANYCHAR_STAR:
513 case OP_STATE_CHECK_ANYCHAR_ML_STAR:
516 case OP_SET_OPTION_PUSH:
528 *num_cache_opcodes_ptr = num_cache_opcodes;
532 *num_cache_opcodes_ptr = num_cache_opcodes;
536 *num_cache_opcodes_ptr = NUM_CACHE_OPCODES_IMPOSSIBLE;
540 return ONIGERR_UNDEFINED_BYTECODE;
545count_num_cache_opcodes(
const regex_t* reg,
long* num_cache_opcodes_ptr)
548 *num_cache_opcodes_ptr = 0;
549 OnigPosition result = count_num_cache_opcodes_inner(reg, -1, 0, &p, num_cache_opcodes_ptr);
550 if (result == 0 && *num_cache_opcodes_ptr >= 0 && p != reg->p + reg->used) {
551 return ONIGERR_UNDEFINED_BYTECODE;
558init_cache_opcodes_inner(
560 MemNumType current_repeat_mem,
int lookaround_nesting,
561 OnigCacheOpcode** cache_opcodes_ptr, UChar** pp,
long* num_cache_points_ptr
565 UChar* pend = reg->p + reg->used;
568 MemNumType repeat_mem;
569 OnigEncoding enc = reg->enc;
570 long cache_point = *num_cache_points_ptr;
574# define INC_CACHE_OPCODES if (cache_opcodes != NULL) {\
575 cache_opcodes->addr = pbegin;\
576 cache_opcodes->cache_point = cache_point;\
577 cache_opcodes->outer_repeat_mem = current_repeat_mem;\
578 cache_opcodes->num_cache_points_at_outer_repeat = 0;\
579 cache_opcodes->num_cache_points_in_outer_repeat = 0;\
580 cache_opcodes->num_cache_points_of_outer_repeat_inc = 0;\
581 cache_opcodes->lookaround_nesting = lookaround_nesting;\
582 cache_opcodes->match_addr = NULL;\
583 cache_point += lookaround_nesting != 0 ? 2 : 1;\
594 case OP_EXACT1: p++;
break;
595 case OP_EXACT2: p += 2;
break;
596 case OP_EXACT3: p += 3;
break;
597 case OP_EXACT4: p += 4;
break;
598 case OP_EXACT5: p += 5;
break;
600 GET_LENGTH_INC(
len, p); p +=
len;
break;
601 case OP_EXACTMB2N1: p += 2;
break;
602 case OP_EXACTMB2N2: p += 4;
break;
603 case OP_EXACTMB2N3: p += 6;
break;
605 GET_LENGTH_INC(
len, p); p +=
len * 2;
break;
607 GET_LENGTH_INC(
len, p); p +=
len * 3;
break;
611 GET_LENGTH_INC(mb_len, p);
612 GET_LENGTH_INC(
len, p);
618 len = enclen(enc, p, pend); p +=
len;
break;
620 GET_LENGTH_INC(
len, p); p +=
len;
break;
624 p += SIZE_BITSET;
break;
626 case OP_CCLASS_MB_NOT:
627 GET_LENGTH_INC(
len, p); p +=
len;
break;
629 case OP_CCLASS_MIX_NOT:
631 GET_LENGTH_INC(
len, p);
638 case OP_ANYCHAR_STAR:
639 case OP_ANYCHAR_ML_STAR:
642 case OP_ANYCHAR_STAR_PEEK_NEXT:
643 case OP_ANYCHAR_ML_STAR_PEEK_NEXT:
651 case OP_NOT_WORD_BOUND:
657 case OP_NOT_ASCII_WORD:
658 case OP_ASCII_WORD_BOUND:
659 case OP_NOT_ASCII_WORD_BOUND:
660 case OP_ASCII_WORD_BEGIN:
661 case OP_ASCII_WORD_END:
668 case OP_SEMI_END_BUF:
669 case OP_BEGIN_POSITION:
676 case OP_BACKREF_MULTI:
677 case OP_BACKREF_MULTI_IC:
678 case OP_BACKREF_WITH_LEVEL:
679 goto unexpected_bytecode_error;
681 case OP_MEMORY_START:
682 case OP_MEMORY_START_PUSH:
683 case OP_MEMORY_END_PUSH:
684 case OP_MEMORY_END_PUSH_REC:
686 case OP_MEMORY_END_REC:
688 if (lookaround_nesting != 0) {
689 goto unexpected_bytecode_error;
707 case OP_PUSH_OR_JUMP_EXACT1:
708 case OP_PUSH_IF_PEEK_NEXT:
709 p += SIZE_RELADDR + 1;
714 GET_MEMNUM_INC(repeat_mem, p);
716 if (reg->repeat_range[repeat_mem].lower == 0 && reg->repeat_range[repeat_mem].upper == 0) {
717 long dummy_num_cache_points = 0;
719 result = init_cache_opcodes_inner(reg, repeat_mem, lookaround_nesting, &dummy_cache_opcodes, &p, &dummy_num_cache_points);
724 if (reg->repeat_range[repeat_mem].lower == 0) {
728 long num_cache_points_in_repeat = 0;
729 long num_cache_points_at_repeat = cache_point;
731 result = init_cache_opcodes_inner(reg, repeat_mem, lookaround_nesting, &cache_opcodes, &p, &num_cache_points_in_repeat);
736 if (repeat_range->lower < repeat_range->upper) {
737 MemNumType outer_repeat_mem = current_repeat_mem;
738 long outer_cache_point = cache_point;
739 pbegin = p - SIZE_OP_REPEAT_INC;
740 current_repeat_mem = repeat_mem;
741 cache_point = num_cache_points_in_repeat;
743 current_repeat_mem = outer_repeat_mem;
744 cache_point = outer_cache_point;
746 int repeat_bounds = repeat_range->upper == 0x7fffffff ? 1 : repeat_range->upper - repeat_range->lower;
747 cache_point += num_cache_points_in_repeat * repeat_range->lower + (num_cache_points_in_repeat + (lookaround_nesting != 0 ? 2 : 1)) * repeat_bounds;
748 for (; cache_opcodes_in_repeat < cache_opcodes; cache_opcodes_in_repeat++) {
749 cache_opcodes_in_repeat->num_cache_points_at_outer_repeat = num_cache_points_at_repeat;
750 cache_opcodes_in_repeat->num_cache_points_in_outer_repeat = num_cache_points_in_repeat;
751 cache_opcodes_in_repeat->num_cache_points_of_outer_repeat_inc = lookaround_nesting != 0 ? 2 : 1;
757 case OP_REPEAT_INC_NG:
760 case OP_REPEAT_INC_SG:
761 case OP_REPEAT_INC_NG_SG:
762 goto unexpected_bytecode_error;
763 case OP_NULL_CHECK_START:
766 case OP_NULL_CHECK_END:
767 case OP_NULL_CHECK_END_MEMST_PUSH:
770 case OP_NULL_CHECK_END_MEMST:
778 result = init_cache_opcodes_inner(reg, current_repeat_mem, lookaround_nesting + 1, &cache_opcodes, &p, &cache_point);
782 UChar* match_addr = p - 1;
783 for (; cache_opcodes_in_lookaround < cache_opcodes; cache_opcodes_in_lookaround++) {
784 if (cache_opcodes_in_lookaround->match_addr == NULL) {
785 cache_opcodes_in_lookaround->match_addr = match_addr;
790 case OP_PUSH_POS_NOT:
793 case OP_PUSH_LOOK_BEHIND_NOT:
797 case OP_PUSH_STOP_BT:
800 result = init_cache_opcodes_inner(reg, current_repeat_mem, -1, &cache_opcodes, &p, &cache_point);
804 UChar* match_addr = p - 1;
805 for (; cache_opcodes_in_atomic < cache_opcodes; cache_opcodes_in_atomic++) {
806 if (cache_opcodes_in_atomic->match_addr == NULL) {
807 cache_opcodes_in_atomic->match_addr = match_addr;
814 case OP_FAIL_LOOK_BEHIND_NOT:
823 goto unexpected_bytecode_error;
827 goto unexpected_bytecode_error;
830 goto unexpected_bytecode_error;
832 case OP_STATE_CHECK_PUSH:
833 case OP_STATE_CHECK_PUSH_OR_JUMP:
835 case OP_STATE_CHECK_ANYCHAR_STAR:
836 case OP_STATE_CHECK_ANYCHAR_ML_STAR:
837 goto unexpected_bytecode_error;
839 case OP_SET_OPTION_PUSH:
850 *cache_opcodes_ptr = cache_opcodes;
852 *num_cache_points_ptr = cache_point;
858unexpected_bytecode_error:
859 return ONIGERR_UNEXPECTED_BYTECODE;
862 return ONIGERR_UNDEFINED_BYTECODE;
867init_cache_opcodes(
const regex_t* reg,
OnigCacheOpcode* cache_opcodes_ptr,
long* num_cache_points_ptr)
870 *num_cache_points_ptr = 0;
871 OnigPosition result = init_cache_opcodes_inner(reg, -1, 0, &cache_opcodes_ptr, &p, num_cache_points_ptr);
872 if (result == 0 && p != reg->p + reg->used) {
873 return ONIGERR_UNDEFINED_BYTECODE;
880count_num_cache_opcodes(regex_t* reg,
long* num_cache_opcodes)
882 *num_cache_opcodes = NUM_CACHE_OPCODES_IMPOSSIBLE;
888onig_check_linear_time(OnigRegexType* reg)
890 long num_cache_opcodes = 0;
891 count_num_cache_opcodes(reg, &num_cache_opcodes);
892 return num_cache_opcodes != NUM_CACHE_OPCODES_IMPOSSIBLE;
896onig_region_clear(OnigRegion* region)
900 for (i = 0; i < region->num_regs; i++) {
901 region->beg[i] = region->end[i] = ONIG_REGION_NOTPOS;
903#ifdef USE_CAPTURE_HISTORY
904 history_root_free(region);
909onig_region_resize(OnigRegion* region,
int n)
913 if (n < ONIG_NREGION)
916 if (region->allocated == 0) {
917 region->beg = (OnigPosition* )
xmalloc(n *
sizeof(OnigPosition));
918 region->end = (OnigPosition* )
xmalloc(n *
sizeof(OnigPosition));
919 if (region->beg == 0 || region->end == 0)
922 region->allocated = n;
924 else if (region->allocated < n) {
927 tmp = (OnigPosition* )
xrealloc(region->beg, n *
sizeof(OnigPosition));
931 tmp = (OnigPosition* )
xrealloc(region->end, n *
sizeof(OnigPosition));
936 region->allocated = n;
939 region->num_regs = num_regs;
947 region->allocated = 0;
948 region->num_regs = 0;
949 return ONIGERR_MEMORY;
953onig_region_resize_clear(OnigRegion* region,
int n)
957 r = onig_region_resize(region, n);
958 if (r != 0)
return r;
959 onig_region_clear(region);
964onig_region_set(OnigRegion* region,
int at,
int beg,
int end)
966 if (at < 0)
return ONIGERR_INVALID_ARGUMENT;
968 if (at >= region->allocated) {
969 int r = onig_region_resize(region, at + 1);
973 region->beg[at] = beg;
974 region->end[at] = end;
979onig_region_init(OnigRegion* region)
981 region->num_regs = 0;
982 region->allocated = 0;
983 region->beg = (OnigPosition* )0;
984 region->end = (OnigPosition* )0;
985#ifdef USE_CAPTURE_HISTORY
986 region->history_root = (OnigCaptureTreeNode* )0;
995 r = (OnigRegion* )
xmalloc(
sizeof(OnigRegion));
1002onig_region_free(OnigRegion* r,
int free_self)
1005 if (r->allocated > 0) {
1009#ifdef USE_CAPTURE_HISTORY
1010 history_root_free(r);
1016 memset(r, 0,
sizeof(OnigRegion));
1022onig_region_copy(OnigRegion* to,
const OnigRegion* from)
1024#define RREGC_SIZE (sizeof(int) * from->num_regs)
1027 if (to == from)
return;
1029 r = onig_region_resize(to, from->num_regs);
1032 for (i = 0; i < from->num_regs; i++) {
1033 to->beg[i] = from->beg[i];
1034 to->end[i] = from->end[i];
1036 to->num_regs = from->num_regs;
1038#ifdef USE_CAPTURE_HISTORY
1039 history_root_free(to);
1041 if (IS_NOT_NULL(from->history_root)) {
1042 to->history_root = history_tree_clone(from->history_root);
1049#define INVALID_STACK_INDEX -1
1053#define STK_ALT 0x0001
1054#define STK_LOOK_BEHIND_NOT 0x0002
1055#define STK_POS_NOT 0x0003
1057#define STK_MEM_START 0x0100
1058#define STK_MEM_END 0x8200
1059#define STK_REPEAT_INC 0x0300
1060#define STK_STATE_CHECK_MARK 0x1000
1062#define STK_NULL_CHECK_START 0x3000
1063#define STK_NULL_CHECK_END 0x5000
1064#define STK_MEM_END_MARK 0x8400
1065#define STK_POS 0x0500
1066#define STK_STOP_BT 0x0600
1067#define STK_REPEAT 0x0700
1068#define STK_CALL_FRAME 0x0800
1069#define STK_RETURN 0x0900
1070#define STK_VOID 0x0a00
1071#define STK_ABSENT_POS 0x0b00
1072#define STK_ABSENT 0x0c00
1073#define STK_MATCH_CACHE_POINT 0x0d00
1074#define STK_ATOMIC_MATCH_CACHE_POINT 0x0e00
1077#define STK_MASK_POP_USED 0x00ff
1078#define STK_MASK_TO_VOID_TARGET 0x10ff
1079#define STK_MASK_MEM_END_OR_MARK 0x8000
1081#ifdef USE_MATCH_CACHE
1082#define MATCH_ARG_INIT_MATCH_CACHE(msa) do {\
1083 (msa).match_cache_status = MATCH_CACHE_STATUS_UNINIT;\
1084 (msa).num_fails = 0;\
1085 (msa).num_cache_opcodes = NUM_CACHE_OPCODES_UNINIT;\
1086 (msa).cache_opcodes = (OnigCacheOpcode*)NULL;\
1087 (msa).num_cache_points = 0;\
1088 (msa).match_cache_buf = (uint8_t*)NULL;\
1090#define MATCH_ARG_FREE_MATCH_CACHE(msa) do {\
1091 xfree((msa).cache_opcodes);\
1092 xfree((msa).match_cache_buf);\
1093 (msa).cache_opcodes = (OnigCacheOpcode*)NULL;\
1094 (msa).match_cache_buf = (uint8_t*)NULL;\
1097#define MATCH_ARG_INIT_MATCH_CACHE(msa)
1098#define MATCH_ARG_FREE_MATCH_CACHE(msa)
1101#ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
1102# define MATCH_ARG_INIT(msa, arg_option, arg_region, arg_start, arg_gpos) do {\
1103 (msa).stack_p = (void* )0;\
1104 (msa).options = (arg_option);\
1105 (msa).region = (arg_region);\
1106 (msa).start = (arg_start);\
1107 (msa).gpos = (arg_gpos);\
1108 (msa).best_len = ONIG_MISMATCH;\
1110 (msa).end_time = 0;\
1111 MATCH_ARG_INIT_MATCH_CACHE(msa);\
1114# define MATCH_ARG_INIT(msa, arg_option, arg_region, arg_start, arg_gpos) do {\
1115 (msa).stack_p = (void* )0;\
1116 (msa).options = (arg_option);\
1117 (msa).region = (arg_region);\
1118 (msa).start = (arg_start);\
1119 (msa).gpos = (arg_gpos);\
1121 (msa).end_time = 0;\
1122 MATCH_ARG_INIT_MATCH_CACHE(msa);\
1126#ifdef USE_COMBINATION_EXPLOSION_CHECK
1128# define STATE_CHECK_BUFF_MALLOC_THRESHOLD_SIZE 16
1130# define STATE_CHECK_BUFF_INIT(msa, str_len, offset, state_num) do { \
1131 if ((state_num) > 0 && str_len >= STATE_CHECK_STRING_THRESHOLD_LEN) {\
1132 unsigned int size = (unsigned int )(((str_len) + 1) * (state_num) + 7) >> 3;\
1133 offset = ((offset) * (state_num)) >> 3;\
1134 if (size > 0 && offset < size && size < STATE_CHECK_BUFF_MAX_SIZE) {\
1135 if (size >= STATE_CHECK_BUFF_MALLOC_THRESHOLD_SIZE) {\
1136 (msa).state_check_buff = (void* )xmalloc(size);\
1137 CHECK_NULL_RETURN_MEMERR((msa).state_check_buff);\
1140 (msa).state_check_buff = (void* )xalloca(size);\
1141 xmemset(((char* )((msa).state_check_buff)+(offset)), 0, \
1142 (size_t )(size - (offset))); \
1143 (msa).state_check_buff_size = size;\
1146 (msa).state_check_buff = (void* )0;\
1147 (msa).state_check_buff_size = 0;\
1151 (msa).state_check_buff = (void* )0;\
1152 (msa).state_check_buff_size = 0;\
1156# define MATCH_ARG_FREE(msa) do {\
1157 xfree((msa).stack_p);\
1158 if ((msa).state_check_buff_size >= STATE_CHECK_BUFF_MALLOC_THRESHOLD_SIZE) { \
1159 xfree((msa).state_check_buff);\
1161 MATCH_ARG_FREE_MATCH_CACHE(msa);\
1164# define MATCH_ARG_FREE(msa) do {\
1165 xfree((msa).stack_p);\
1166 MATCH_ARG_FREE_MATCH_CACHE(msa);\
1172#define MAX_PTR_NUM 100
1174#define STACK_INIT(alloc_addr, heap_addr, ptr_num, stack_num) do {\
1175 if (ptr_num > MAX_PTR_NUM) {\
1176 alloc_addr = (char* )xmalloc(sizeof(OnigStackIndex) * (ptr_num));\
1177 heap_addr = alloc_addr;\
1178 if (msa->stack_p) {\
1179 stk_alloc = (OnigStackType* )(msa->stack_p);\
1180 stk_base = stk_alloc;\
1182 stk_end = stk_base + msa->stack_n;\
1185 stk_alloc = (OnigStackType* )xalloca(sizeof(OnigStackType) * (stack_num));\
1186 stk_base = stk_alloc;\
1188 stk_end = stk_base + (stack_num);\
1191 else if (msa->stack_p) {\
1192 alloc_addr = (char* )xalloca(sizeof(OnigStackIndex) * (ptr_num));\
1194 stk_alloc = (OnigStackType* )(msa->stack_p);\
1195 stk_base = stk_alloc;\
1197 stk_end = stk_base + msa->stack_n;\
1200 alloc_addr = (char* )xalloca(sizeof(OnigStackIndex) * (ptr_num)\
1201 + sizeof(OnigStackType) * (stack_num));\
1203 stk_alloc = (OnigStackType* )(alloc_addr + sizeof(OnigStackIndex) * (ptr_num));\
1204 stk_base = stk_alloc;\
1206 stk_end = stk_base + (stack_num);\
1210#define STACK_SAVE do{\
1211 if (stk_base != stk_alloc) {\
1212 msa->stack_p = stk_base;\
1213 msa->stack_n = stk_end - stk_base; \
1217static unsigned int MatchStackLimitSize = DEFAULT_MATCH_STACK_LIMIT_SIZE;
1220onig_get_match_stack_limit_size(
void)
1222 return MatchStackLimitSize;
1226onig_set_match_stack_limit_size(
unsigned int size)
1228 MatchStackLimitSize = size;
1233stack_double(OnigStackType** arg_stk_base, OnigStackType** arg_stk_end,
1234 OnigStackType** arg_stk, OnigStackType* stk_alloc,
OnigMatchArg* msa)
1237 OnigStackType *x, *stk_base, *stk_end, *stk;
1239 stk_base = *arg_stk_base;
1240 stk_end = *arg_stk_end;
1243 n = stk_end - stk_base;
1244 if (stk_base == stk_alloc && IS_NULL(msa->stack_p)) {
1245 x = (OnigStackType* )
xmalloc(
sizeof(OnigStackType) * n * 2);
1248 return ONIGERR_MEMORY;
1250 xmemcpy(x, stk_base, n *
sizeof(OnigStackType));
1254 unsigned int limit_size = MatchStackLimitSize;
1256 if (limit_size != 0 && n > limit_size) {
1257 if ((
unsigned int )(stk_end - stk_base) == limit_size)
1258 return ONIGERR_MATCH_STACK_LIMIT_OVER;
1262 x = (OnigStackType* )
xrealloc(stk_base,
sizeof(OnigStackType) * n);
1265 return ONIGERR_MEMORY;
1268 *arg_stk = x + (stk - stk_base);
1270 *arg_stk_end = x + n;
1274#define STACK_ENSURE(n) do {\
1275 if (stk_end - stk < (n)) {\
1276 int r = stack_double(&stk_base, &stk_end, &stk, stk_alloc, msa);\
1279 xfree(xmalloc_base);\
1285#define STACK_AT(index) (stk_base + (index))
1286#define GET_STACK_INDEX(stk) ((stk) - stk_base)
1288#define STACK_PUSH_TYPE(stack_type) do {\
1290 stk->type = (stack_type);\
1291 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1295#define IS_TO_VOID_TARGET(stk) (((stk)->type & STK_MASK_TO_VOID_TARGET) != 0)
1297#ifdef USE_COMBINATION_EXPLOSION_CHECK
1298# define STATE_CHECK_POS(s,snum) \
1299 (((s) - str) * num_comb_exp_check + ((snum) - 1))
1300# define STATE_CHECK_VAL(v,snum) do {\
1301 if (state_check_buff != NULL) {\
1302 ptrdiff_t x = STATE_CHECK_POS(s,snum);\
1303 (v) = state_check_buff[x/8] & (1<<(x%8));\
1309# define ELSE_IF_STATE_CHECK_MARK(stk) \
1310 else if ((stk)->type == STK_STATE_CHECK_MARK) { \
1311 ptrdiff_t x = STATE_CHECK_POS(stk->u.state.pstr, stk->u.state.state_check);\
1312 state_check_buff[x/8] |= (1<<(x%8)); \
1315# define STACK_PUSH(stack_type,pat,s,sprev,keep) do {\
1317 stk->type = (stack_type);\
1318 stk->u.state.pcode = (pat);\
1319 stk->u.state.pstr = (s);\
1320 stk->u.state.pstr_prev = (sprev);\
1321 stk->u.state.state_check = 0;\
1322 stk->u.state.pkeep = (keep);\
1326# define STACK_PUSH_ENSURED(stack_type,pat) do {\
1327 stk->type = (stack_type);\
1328 stk->u.state.pcode = (pat);\
1329 stk->u.state.state_check = 0;\
1333# define STACK_PUSH_ALT_WITH_STATE_CHECK(pat,s,sprev,snum,keep) do {\
1335 stk->type = STK_ALT;\
1336 stk->u.state.pcode = (pat);\
1337 stk->u.state.pstr = (s);\
1338 stk->u.state.pstr_prev = (sprev);\
1339 stk->u.state.state_check = ((state_check_buff != NULL) ? (snum) : 0);\
1340 stk->u.state.pkeep = (keep);\
1344# define STACK_PUSH_STATE_CHECK(s,snum) do {\
1345 if (state_check_buff != NULL) {\
1347 stk->type = STK_STATE_CHECK_MARK;\
1348 stk->u.state.pstr = (s);\
1349 stk->u.state.state_check = (snum);\
1356# define ELSE_IF_STATE_CHECK_MARK(stk)
1358# define STACK_PUSH(stack_type,pat,s,sprev,keep) do {\
1360 stk->type = (stack_type);\
1361 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1362 stk->u.state.pcode = (pat);\
1363 stk->u.state.pstr = (s);\
1364 stk->u.state.pstr_prev = (sprev);\
1365 stk->u.state.pkeep = (keep);\
1369# define STACK_PUSH_ENSURED(stack_type,pat) do {\
1370 stk->type = (stack_type);\
1371 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1372 stk->u.state.pcode = (pat);\
1377#define STACK_PUSH_ALT(pat,s,sprev,keep) STACK_PUSH(STK_ALT,pat,s,sprev,keep)
1378#define STACK_PUSH_POS(s,sprev,keep) STACK_PUSH(STK_POS,NULL_UCHARP,s,sprev,keep)
1379#define STACK_PUSH_POS_NOT(pat,s,sprev,keep) STACK_PUSH(STK_POS_NOT,pat,s,sprev,keep)
1380#define STACK_PUSH_ABSENT STACK_PUSH_TYPE(STK_ABSENT)
1381#define STACK_PUSH_STOP_BT STACK_PUSH_TYPE(STK_STOP_BT)
1382#define STACK_PUSH_LOOK_BEHIND_NOT(pat,s,sprev,keep) \
1383 STACK_PUSH(STK_LOOK_BEHIND_NOT,pat,s,sprev,keep)
1385#define STACK_PUSH_REPEAT(id, pat) do {\
1387 stk->type = STK_REPEAT;\
1388 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1389 stk->u.repeat.num = (id);\
1390 stk->u.repeat.pcode = (pat);\
1391 stk->u.repeat.count = 0;\
1395#define STACK_PUSH_REPEAT_INC(sindex) do {\
1397 stk->type = STK_REPEAT_INC;\
1398 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1399 stk->u.repeat_inc.si = (sindex);\
1403#define STACK_PUSH_MEM_START(mnum, s) do {\
1405 stk->type = STK_MEM_START;\
1406 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1407 stk->u.mem.num = (mnum);\
1408 stk->u.mem.pstr = (s);\
1409 stk->u.mem.start = mem_start_stk[mnum];\
1410 stk->u.mem.end = mem_end_stk[mnum];\
1411 mem_start_stk[mnum] = GET_STACK_INDEX(stk);\
1412 mem_end_stk[mnum] = INVALID_STACK_INDEX;\
1416#define STACK_PUSH_MEM_END(mnum, s) do {\
1418 stk->type = STK_MEM_END;\
1419 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1420 stk->u.mem.num = (mnum);\
1421 stk->u.mem.pstr = (s);\
1422 stk->u.mem.start = mem_start_stk[mnum];\
1423 stk->u.mem.end = mem_end_stk[mnum];\
1424 mem_end_stk[mnum] = GET_STACK_INDEX(stk);\
1428#define STACK_PUSH_MEM_END_MARK(mnum) do {\
1430 stk->type = STK_MEM_END_MARK;\
1431 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1432 stk->u.mem.num = (mnum);\
1436#define STACK_GET_MEM_START(mnum, k) do {\
1439 while (k > stk_base) {\
1441 if ((k->type & STK_MASK_MEM_END_OR_MARK) != 0 \
1442 && k->u.mem.num == (mnum)) {\
1445 else if (k->type == STK_MEM_START && k->u.mem.num == (mnum)) {\
1446 if (level == 0) break;\
1452#define STACK_GET_MEM_RANGE(k, mnum, start, end) do {\
1455 if (k->type == STK_MEM_START && k->u.mem.num == (mnum)) {\
1456 if (level == 0) (start) = k->u.mem.pstr;\
1459 else if (k->type == STK_MEM_END && k->u.mem.num == (mnum)) {\
1462 (end) = k->u.mem.pstr;\
1470#define STACK_PUSH_NULL_CHECK_START(cnum, s) do {\
1472 stk->type = STK_NULL_CHECK_START;\
1473 stk->null_check = (OnigStackIndex)(stk - stk_base);\
1474 stk->u.null_check.num = (cnum);\
1475 stk->u.null_check.pstr = (s);\
1479#define STACK_PUSH_NULL_CHECK_END(cnum) do {\
1481 stk->type = STK_NULL_CHECK_END;\
1482 stk->null_check = (OnigStackIndex)(stk - stk_base);\
1483 stk->u.null_check.num = (cnum);\
1487#define STACK_PUSH_CALL_FRAME(pat) do {\
1489 stk->type = STK_CALL_FRAME;\
1490 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1491 stk->u.call_frame.ret_addr = (pat);\
1495#define STACK_PUSH_RETURN do {\
1497 stk->type = STK_RETURN;\
1498 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1502#define STACK_PUSH_ABSENT_POS(start, end) do {\
1504 stk->type = STK_ABSENT_POS;\
1505 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1506 stk->u.absent_pos.abs_pstr = (start);\
1507 stk->u.absent_pos.end_pstr = (end);\
1511#define STACK_PUSH_MATCH_CACHE_POINT(match_cache_point_index, match_cache_point_mask) do {\
1513 stk->type = STK_MATCH_CACHE_POINT;\
1514 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1515 stk->u.match_cache_point.index = (match_cache_point_index);\
1516 stk->u.match_cache_point.mask = (match_cache_point_mask);\
1522# define STACK_BASE_CHECK(p, at) \
1523 if ((p) < stk_base) {\
1524 fprintf(stderr, "at %s\n", at);\
1528# define STACK_BASE_CHECK(p, at)
1531#ifdef ONIG_DEBUG_MATCH_CACHE
1532# define MATCH_CACHE_DEBUG_MEMOIZE(stkp) fprintf(stderr, "MATCH CACHE: memoize (index=%td mask=%d)\n", stkp->u.match_cache_point.index, stkp->u.match_cache_point.mask);
1534# define MATCH_CACHE_DEBUG_MEMOIZE(stkp) ((void) 0)
1537#ifdef USE_MATCH_CACHE
1538# define INC_NUM_FAILS msa->num_fails++
1539# define MEMOIZE_MATCH_CACHE_POINT do {\
1540 if (stk->type == STK_MATCH_CACHE_POINT) {\
1541 msa->match_cache_buf[stk->u.match_cache_point.index] |= stk->u.match_cache_point.mask;\
1542 MATCH_CACHE_DEBUG_MEMOIZE(stk);\
1544 else if (stk->type == STK_ATOMIC_MATCH_CACHE_POINT) {\
1545 memoize_extended_match_cache_point(msa->match_cache_buf, stk->u.match_cache_point.index, stk->u.match_cache_point.mask);\
1546 MATCH_CACHE_DEBUG_MEMOIZE(stkp);\
1549# define MEMOIZE_LOOKAROUND_MATCH_CACHE_POINT(stkp) do {\
1550 if (stkp->type == STK_MATCH_CACHE_POINT) {\
1551 stkp->type = STK_VOID;\
1552 memoize_extended_match_cache_point(msa->match_cache_buf, stkp->u.match_cache_point.index, stkp->u.match_cache_point.mask);\
1553 MATCH_CACHE_DEBUG_MEMOIZE(stkp);\
1556# define MEMOIZE_ATOMIC_MATCH_CACHE_POINT do {\
1557 if (stk->type == STK_MATCH_CACHE_POINT) {\
1558 memoize_extended_match_cache_point(msa->match_cache_buf, stk->u.match_cache_point.index, stk->u.match_cache_point.mask);\
1559 MATCH_CACHE_DEBUG_MEMOIZE(stkp);\
1563# define INC_NUM_FAILS ((void) 0)
1564# define MEMOIZE_MATCH_CACHE_POINT ((void) 0)
1565# define MEMOIZE_LOOKAROUND_MATCH_CACHE_POINT(stkp) ((void) 0)
1568#define STACK_POP_ONE do {\
1570 STACK_BASE_CHECK(stk, "STACK_POP_ONE"); \
1573#define STACK_POP do {\
1574 switch (pop_level) {\
1575 case STACK_POP_LEVEL_FREE:\
1578 STACK_BASE_CHECK(stk, "STACK_POP"); \
1579 if ((stk->type & STK_MASK_POP_USED) != 0) break;\
1580 ELSE_IF_STATE_CHECK_MARK(stk);\
1581 MEMOIZE_MATCH_CACHE_POINT;\
1584 case STACK_POP_LEVEL_MEM_START:\
1587 STACK_BASE_CHECK(stk, "STACK_POP 2"); \
1588 if ((stk->type & STK_MASK_POP_USED) != 0) break;\
1589 else if (stk->type == STK_MEM_START) {\
1590 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1591 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1593 ELSE_IF_STATE_CHECK_MARK(stk);\
1594 MEMOIZE_MATCH_CACHE_POINT;\
1600 STACK_BASE_CHECK(stk, "STACK_POP 3"); \
1601 if ((stk->type & STK_MASK_POP_USED) != 0) break;\
1602 else if (stk->type == STK_MEM_START) {\
1603 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1604 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1606 else if (stk->type == STK_REPEAT_INC) {\
1607 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
1609 else if (stk->type == STK_MEM_END) {\
1610 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1611 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1613 ELSE_IF_STATE_CHECK_MARK(stk);\
1614 MEMOIZE_MATCH_CACHE_POINT;\
1620#define STACK_POP_TIL_POS_NOT do {\
1623 STACK_BASE_CHECK(stk, "STACK_POP_TIL_POS_NOT"); \
1624 if (stk->type == STK_POS_NOT) break;\
1625 else if (stk->type == STK_MEM_START) {\
1626 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1627 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1629 else if (stk->type == STK_REPEAT_INC) {\
1630 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
1632 else if (stk->type == STK_MEM_END) {\
1633 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1634 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1636 else if (IS_TO_VOID_TARGET(stk)) {\
1639 ELSE_IF_STATE_CHECK_MARK(stk);\
1640 MEMOIZE_LOOKAROUND_MATCH_CACHE_POINT(stk);\
1644#define STACK_POP_TIL_LOOK_BEHIND_NOT do {\
1647 STACK_BASE_CHECK(stk, "STACK_POP_TIL_LOOK_BEHIND_NOT"); \
1648 if (stk->type == STK_LOOK_BEHIND_NOT) break;\
1649 else if (stk->type == STK_MEM_START) {\
1650 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1651 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1653 else if (stk->type == STK_REPEAT_INC) {\
1654 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
1656 else if (stk->type == STK_MEM_END) {\
1657 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1658 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1660 ELSE_IF_STATE_CHECK_MARK(stk);\
1664#define STACK_POP_TIL_ABSENT do {\
1667 STACK_BASE_CHECK(stk, "STACK_POP_TIL_ABSENT"); \
1668 if (stk->type == STK_ABSENT) break;\
1669 else if (stk->type == STK_MEM_START) {\
1670 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1671 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1673 else if (stk->type == STK_REPEAT_INC) {\
1674 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
1676 else if (stk->type == STK_MEM_END) {\
1677 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1678 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1680 ELSE_IF_STATE_CHECK_MARK(stk);\
1684#define STACK_POP_ABSENT_POS(start, end) do {\
1686 STACK_BASE_CHECK(stk, "STACK_POP_ABSENT_POS"); \
1687 (start) = stk->u.absent_pos.abs_pstr;\
1688 (end) = stk->u.absent_pos.end_pstr;\
1691#define STACK_POS_END(k) do {\
1695 STACK_BASE_CHECK(k, "STACK_POS_END"); \
1696 if (IS_TO_VOID_TARGET(k)) {\
1698 k->type = STK_VOID;\
1700 else if (k->type == STK_POS) {\
1701 k->type = STK_VOID;\
1704 MEMOIZE_LOOKAROUND_MATCH_CACHE_POINT(k);\
1708#define STACK_STOP_BT_END do {\
1709 OnigStackType *k = stk;\
1712 STACK_BASE_CHECK(k, "STACK_STOP_BT_END"); \
1713 if (IS_TO_VOID_TARGET(k)) {\
1715 k->type = STK_VOID;\
1717 else if (k->type == STK_STOP_BT) {\
1718 k->type = STK_VOID;\
1721 else if (k->type == STK_MATCH_CACHE_POINT) {\
1722 k->type = STK_ATOMIC_MATCH_CACHE_POINT;\
1727#define STACK_STOP_BT_FAIL do {\
1730 STACK_BASE_CHECK(stk, "STACK_STOP_BT_END"); \
1731 if (stk->type == STK_STOP_BT) {\
1732 stk->type = STK_VOID;\
1735 MEMOIZE_ATOMIC_MATCH_CACHE_POINT;\
1739#define STACK_NULL_CHECK(isnull,id,s) do {\
1740 OnigStackType* k = STACK_AT((stk-1)->null_check)+1;\
1743 STACK_BASE_CHECK(k, "STACK_NULL_CHECK"); \
1744 if (k->type == STK_NULL_CHECK_START) {\
1745 if (k->u.null_check.num == (id)) {\
1746 (isnull) = (k->u.null_check.pstr == (s));\
1753#define STACK_NULL_CHECK_REC(isnull,id,s) do {\
1755 OnigStackType* k = STACK_AT((stk-1)->null_check)+1;\
1758 STACK_BASE_CHECK(k, "STACK_NULL_CHECK_REC"); \
1759 if (k->type == STK_NULL_CHECK_START) {\
1760 if (k->u.null_check.num == (id)) {\
1762 (isnull) = (k->u.null_check.pstr == (s));\
1768 else if (k->type == STK_NULL_CHECK_END) {\
1774#define STACK_NULL_CHECK_MEMST(isnull,id,s,reg) do {\
1775 OnigStackType* k = STACK_AT((stk-1)->null_check)+1;\
1778 STACK_BASE_CHECK(k, "STACK_NULL_CHECK_MEMST"); \
1779 if (k->type == STK_NULL_CHECK_START) {\
1780 if (k->u.null_check.num == (id)) {\
1781 if (k->u.null_check.pstr != (s)) {\
1789 if (k->type == STK_MEM_START) {\
1790 if (k->u.mem.end == INVALID_STACK_INDEX) {\
1791 (isnull) = 0; break;\
1793 if (BIT_STATUS_AT(reg->bt_mem_end, k->u.mem.num))\
1794 endp = STACK_AT(k->u.mem.end)->u.mem.pstr;\
1796 endp = (UChar* )k->u.mem.end;\
1797 if (STACK_AT(k->u.mem.start)->u.mem.pstr != endp) {\
1798 (isnull) = 0; break;\
1800 else if (endp != s) {\
1813#define STACK_NULL_CHECK_MEMST_REC(isnull,id,s,reg) do {\
1815 OnigStackType* k = STACK_AT((stk-1)->null_check)+1;\
1818 STACK_BASE_CHECK(k, "STACK_NULL_CHECK_MEMST_REC"); \
1819 if (k->type == STK_NULL_CHECK_START) {\
1820 if (k->u.null_check.num == (id)) {\
1822 if (k->u.null_check.pstr != (s)) {\
1830 if (k->type == STK_MEM_START) {\
1831 if (k->u.mem.end == INVALID_STACK_INDEX) {\
1832 (isnull) = 0; break;\
1834 if (BIT_STATUS_AT(reg->bt_mem_end, k->u.mem.num))\
1835 endp = STACK_AT(k->u.mem.end)->u.mem.pstr;\
1837 endp = (UChar* )k->u.mem.end;\
1838 if (STACK_AT(k->u.mem.start)->u.mem.pstr != endp) {\
1839 (isnull) = 0; break;\
1841 else if (endp != s) {\
1855 else if (k->type == STK_NULL_CHECK_END) {\
1856 if (k->u.null_check.num == (id)) level++;\
1861#define STACK_GET_REPEAT(id, k) do {\
1866 STACK_BASE_CHECK(k, "STACK_GET_REPEAT"); \
1867 if (k->type == STK_REPEAT) {\
1869 if (k->u.repeat.num == (id)) {\
1874 else if (k->type == STK_CALL_FRAME) level--;\
1875 else if (k->type == STK_RETURN) level++;\
1879#define STACK_RETURN(addr) do {\
1881 OnigStackType* k = stk;\
1884 STACK_BASE_CHECK(k, "STACK_RETURN"); \
1885 if (k->type == STK_CALL_FRAME) {\
1887 (addr) = k->u.call_frame.ret_addr;\
1892 else if (k->type == STK_RETURN)\
1898#define STRING_CMP(s1,s2,len) do {\
1899 while (len-- > 0) {\
1900 if (*s1++ != *s2++) goto fail;\
1904#define STRING_CMP_IC(case_fold_flag,s1,ps2,len,text_end) do {\
1905 if (string_cmp_ic(encode, case_fold_flag, s1, ps2, len, text_end) == 0) \
1909static int string_cmp_ic(OnigEncoding enc,
int case_fold_flag,
1910 UChar* s1, UChar** ps2, OnigDistance mblen,
const UChar* text_end)
1912 UChar buf1[ONIGENC_MBC_CASE_FOLD_MAXLEN];
1913 UChar buf2[ONIGENC_MBC_CASE_FOLD_MAXLEN];
1914 UChar *p1, *p2, *end1, *s2;
1920 if (s2 >= text_end)
return 0;
1921 len1 = ONIGENC_MBC_CASE_FOLD(enc, case_fold_flag, &s1, text_end, buf1);
1922 len2 = ONIGENC_MBC_CASE_FOLD(enc, case_fold_flag, &s2, text_end, buf2);
1923 if (len1 != len2)
return 0;
1926 while (len1-- > 0) {
1927 if (*p1 != *p2)
return 0;
1937#define STRING_CMP_VALUE(s1,s2,len,is_fail) do {\
1939 while (len-- > 0) {\
1940 if (*s1++ != *s2++) {\
1941 is_fail = 1; break;\
1946#define STRING_CMP_VALUE_IC(case_fold_flag,s1,ps2,len,text_end,is_fail) do {\
1947 if (string_cmp_ic(encode, case_fold_flag, s1, ps2, len, text_end) == 0) \
1954#define IS_EMPTY_STR (str == end)
1955#define ON_STR_BEGIN(s) ((s) == str)
1956#define ON_STR_END(s) ((s) == end)
1957#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
1958# define DATA_ENSURE_CHECK1 (s < right_range)
1959# define DATA_ENSURE_CHECK(n) (s + (n) <= right_range)
1960# define DATA_ENSURE(n) if (s + (n) > right_range) goto fail
1961# define DATA_ENSURE_CONTINUE(n) if (s + (n) > right_range) continue
1962# define ABSENT_END_POS right_range
1964# define DATA_ENSURE_CHECK1 (s < end)
1965# define DATA_ENSURE_CHECK(n) (s + (n) <= end)
1966# define DATA_ENSURE(n) if (s + (n) > end) goto fail
1967# define DATA_ENSURE_CONTINUE(n) if (s + (n) > end) continue
1968# define ABSENT_END_POS end
1971int onigenc_mbclen_approximate(
const OnigUChar* p,
const OnigUChar* e,
const struct OnigEncodingTypeST* enc);
1974enclen_approx(OnigEncoding enc,
const OnigUChar* p,
const OnigUChar* e)
1976 if (enc->max_enc_len == enc->min_enc_len) {
1977 return (p < e ? enc->min_enc_len : 0);
1980 return onigenc_mbclen_approximate(p, e, enc);
1985#ifdef USE_CAPTURE_HISTORY
1987make_capture_history_tree(OnigCaptureTreeNode* node, OnigStackType** kp,
1988 OnigStackType* stk_top, UChar* str, regex_t* reg)
1991 OnigCaptureTreeNode* child;
1992 OnigStackType* k = *kp;
1994 while (k < stk_top) {
1995 if (k->type == STK_MEM_START) {
1997 if (n <= ONIG_MAX_CAPTURE_HISTORY_GROUP &&
1998 BIT_STATUS_AT(reg->capture_history, n) != 0) {
1999 child = history_node_new();
2000 CHECK_NULL_RETURN_MEMERR(child);
2002 child->beg = k->u.mem.pstr - str;
2003 r = history_tree_add_child(node, child);
2005 history_tree_free(child);
2009 r = make_capture_history_tree(child, kp, stk_top, str, reg);
2010 if (r != 0)
return r;
2013 child->end = k->u.mem.pstr - str;
2016 else if (k->type == STK_MEM_END) {
2017 if (k->u.mem.num == node->group) {
2018 node->end = k->u.mem.pstr - str;
2030#ifdef USE_BACKREF_WITH_LEVEL
2032mem_is_in_memp(
int mem,
int num, UChar* memp)
2037 for (i = 0; i < num; i++) {
2038 GET_MEMNUM_INC(m, memp);
2039 if (mem == (
int )m)
return 1;
2044static int backref_match_at_nested_level(regex_t* reg,
2045 OnigStackType* top, OnigStackType* stk_base,
2046 int ignore_case,
int case_fold_flag,
2047 int nest,
int mem_num, UChar* memp, UChar** s,
const UChar* send)
2049 UChar *ss, *p, *pstart, *pend = NULL_UCHARP;
2056 while (k >= stk_base) {
2057 if (k->type == STK_CALL_FRAME) {
2060 else if (k->type == STK_RETURN) {
2063 else if (level == nest) {
2064 if (k->type == STK_MEM_START) {
2065 if (mem_is_in_memp(k->u.mem.num, mem_num, memp)) {
2066 pstart = k->u.mem.pstr;
2067 if (pend != NULL_UCHARP) {
2068 if (pend - pstart > send - *s)
return 0;
2072 if (ignore_case != 0) {
2073 if (string_cmp_ic(reg->enc, case_fold_flag,
2074 pstart, &ss, pend - pstart, send) == 0)
2079 if (*p++ != *ss++)
return 0;
2088 else if (k->type == STK_MEM_END) {
2089 if (mem_is_in_memp(k->u.mem.num, mem_num, memp)) {
2090 pend = k->u.mem.pstr;
2102#ifdef ONIG_DEBUG_STATISTICS
2105# include <windows.h>
2106static LARGE_INTEGER ts, te, freq;
2107# define GETTIME(t) QueryPerformanceCounter(&(t))
2108# define TIMEDIFF(te,ts) (unsigned long )(((te).QuadPart - (ts).QuadPart) \
2109 * 1000000 / freq.QuadPart)
2112# define USE_TIMEOFDAY
2114# ifdef USE_TIMEOFDAY
2115# ifdef HAVE_SYS_TIME_H
2116# include <sys/time.h>
2118# ifdef HAVE_UNISTD_H
2122# define GETTIME(t) gettimeofday(&(t), (struct timezone* )0)
2123# define TIMEDIFF(te,ts) (((te).tv_usec - (ts).tv_usec) + \
2124 (((te).tv_sec - (ts).tv_sec)*1000000))
2126# ifdef HAVE_SYS_TIMES_H
2127# include <sys/times.h>
2129static struct tms ts, te;
2130# define GETTIME(t) times(&(t))
2131# define TIMEDIFF(te,ts) ((te).tms_utime - (ts).tms_utime)
2136static int OpCounter[256];
2137static int OpPrevCounter[256];
2138static unsigned long OpTime[256];
2139static int OpCurr = OP_FINISH;
2140static int OpPrevTarget = OP_FAIL;
2141static int MaxStackDepth = 0;
2143# define MOP_IN(opcode) do {\
2144 if (opcode == OpPrevTarget) OpPrevCounter[OpCurr]++;\
2146 OpCounter[opcode]++;\
2150# define MOP_OUT do {\
2152 OpTime[OpCurr] += TIMEDIFF(te, ts);\
2156onig_statistics_init(
void)
2159 for (i = 0; i < 256; i++) {
2160 OpCounter[i] = OpPrevCounter[i] = 0; OpTime[i] = 0;
2164 QueryPerformanceFrequency(&freq);
2169onig_print_statistics(FILE* f)
2172 fprintf(f,
" count prev time\n");
2173 for (i = 0; OnigOpInfo[i].opcode >= 0; i++) {
2174 fprintf(f,
"%8d: %8d: %10lu: %s\n",
2175 OpCounter[i], OpPrevCounter[i], OpTime[i], OnigOpInfo[i].name);
2177 fprintf(f,
"\nmax stack depth: %d\n", MaxStackDepth);
2180# define STACK_INC do {\
2182 if (stk - stk_base > MaxStackDepth) \
2183 MaxStackDepth = stk - stk_base;\
2187# define STACK_INC stk++
2189# define MOP_IN(opcode)
2194#ifdef ONIG_DEBUG_MATCH
2196stack_type_str(
int stack_type)
2198 switch (stack_type) {
2199 case STK_ALT:
return "Alt ";
2200 case STK_LOOK_BEHIND_NOT:
return "LBNot ";
2201 case STK_POS_NOT:
return "PosNot";
2202 case STK_MEM_START:
return "MemS ";
2203 case STK_MEM_END:
return "MemE ";
2204 case STK_REPEAT_INC:
return "RepInc";
2205 case STK_STATE_CHECK_MARK:
return "StChMk";
2206 case STK_NULL_CHECK_START:
return "NulChS";
2207 case STK_NULL_CHECK_END:
return "NulChE";
2208 case STK_MEM_END_MARK:
return "MemEMk";
2209 case STK_POS:
return "Pos ";
2210 case STK_STOP_BT:
return "StopBt";
2211 case STK_REPEAT:
return "Rep ";
2212 case STK_CALL_FRAME:
return "Call ";
2213 case STK_RETURN:
return "Ret ";
2214 case STK_VOID:
return "Void ";
2215 case STK_ABSENT_POS:
return "AbsPos";
2216 case STK_ABSENT:
return "Absent";
2217 case STK_MATCH_CACHE_POINT:
return "MCache";
2218 default:
return " ";
2222#ifdef USE_MATCH_CACHE
2225bsearch_cache_opcodes(
const OnigCacheOpcode *cache_opcodes,
long num_cache_opcodes,
const UChar* p)
2227 long l = 0, r = num_cache_opcodes - 1, m = 0;
2231 if (cache_opcodes[m].addr == p)
break;
2232 if (cache_opcodes[m].addr < p) l = m + 1;
2239find_cache_point(regex_t* reg,
const OnigCacheOpcode* cache_opcodes,
long num_cache_opcodes,
const UChar* p,
const OnigStackType *stk,
const OnigStackIndex *repeat_stk,
const OnigCacheOpcode **cache_opcode_ptr)
2244 const OnigStackType *stkp;
2246 int is_inc = *p == OP_REPEAT_INC || *p == OP_REPEAT_INC_NG;
2248 long num_cache_points_at_outer_repeat;
2249 long num_cache_points_in_outer_repeat;
2250 long num_cache_points_of_outer_repeat_inc;
2252 m = bsearch_cache_opcodes(cache_opcodes, num_cache_opcodes, p);
2254 if (!(0 <= m && m < num_cache_opcodes && cache_opcodes[m].addr == p)) {
2258 cache_opcode = &cache_opcodes[m];
2259 *cache_opcode_ptr = &cache_opcodes[m];
2260 cache_point = cache_opcode->cache_point;
2261 if (cache_opcode->outer_repeat_mem == -1) {
2265 num_cache_points_at_outer_repeat = cache_opcode->num_cache_points_at_outer_repeat;
2266 num_cache_points_in_outer_repeat = cache_opcode->num_cache_points_in_outer_repeat;
2267 num_cache_points_of_outer_repeat_inc = cache_opcode->num_cache_points_of_outer_repeat_inc;
2269 range = ®->repeat_range[cache_opcode->outer_repeat_mem];
2271 stkp = &stk[repeat_stk[cache_opcode->outer_repeat_mem]];
2272 count = is_inc ? stkp->u.repeat.count - 1 : stkp->u.repeat.count;
2274 if (count < range->lower) {
2275 return num_cache_points_at_outer_repeat +
2276 num_cache_points_in_outer_repeat * count +
2280 if (range->upper == 0x7fffffff) {
2281 return num_cache_points_at_outer_repeat +
2282 num_cache_points_in_outer_repeat * (range->lower - (is_inc ? 1 : 0)) + (is_inc ? 0 : num_cache_points_of_outer_repeat_inc) +
2286 return num_cache_points_at_outer_repeat +
2287 num_cache_points_in_outer_repeat * (range->lower - 1) +
2288 (num_cache_points_in_outer_repeat + num_cache_points_of_outer_repeat_inc) * (count - range->lower + 1) +
2293check_extended_match_cache_point(uint8_t *match_cache_buf, OnigPosition match_cache_point_index, uint8_t match_cache_point_mask)
2295 if (match_cache_point_mask & 0x80) {
2296 return (match_cache_buf[match_cache_point_index + 1] & 0x01) > 0;
2299 return (match_cache_buf[match_cache_point_index] & (match_cache_point_mask << 1)) > 0;
2304memoize_extended_match_cache_point(uint8_t *match_cache_buf, OnigPosition match_cache_point_index, uint8_t match_cache_point_mask)
2306 match_cache_buf[match_cache_point_index] |= match_cache_point_mask;
2307 if (match_cache_point_mask & 0x80) {
2308 match_cache_buf[match_cache_point_index + 1] |= 0x01;
2311 match_cache_buf[match_cache_point_index] |= match_cache_point_mask << 1;
2320match_at(regex_t* reg,
const UChar* str,
const UChar* end,
2321#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
2322 const UChar* right_range,
2326 static const UChar FinishCode[] = { OP_FINISH };
2328 int i, num_mem, pop_level;
2329 ptrdiff_t n, best_len;
2330 LengthType tlen, tlen2;
2333 OnigOptionType option = reg->options;
2334 OnigEncoding encode = reg->enc;
2335 OnigCaseFoldType case_fold_flag = reg->case_fold_flag;
2336 UChar *s, *q, *sbegin;
2341 char *xmalloc_base = NULL;
2342 OnigStackType *stk_alloc, *stk_base = NULL, *stk, *stk_end;
2343 OnigStackType *stkp;
2345 OnigStackIndex *repeat_stk;
2346 OnigStackIndex *mem_start_stk, *mem_end_stk;
2347#ifdef USE_COMBINATION_EXPLOSION_CHECK
2349 unsigned char* state_check_buff = msa->state_check_buff;
2350 int num_comb_exp_check = reg->num_comb_exp_check;
2353#if USE_TOKEN_THREADED_VM
2355# define VM_LOOP JUMP;
2357# define CASE(x) L_##x: sbegin = s; OPCODE_EXEC_HOOK;
2358# define DEFAULT L_DEFAULT:
2359# define NEXT sprev = sbegin; JUMP
2360# define JUMP pbegin = p; RB_GNUC_EXTENSION_BLOCK(goto *oplabels[*p++])
2386 &&L_OP_CCLASS_MB_NOT,
2387 &&L_OP_CCLASS_MIX_NOT,
2391 &&L_OP_ANYCHAR_STAR,
2392 &&L_OP_ANYCHAR_ML_STAR,
2393 &&L_OP_ANYCHAR_STAR_PEEK_NEXT,
2394 &&L_OP_ANYCHAR_ML_STAR_PEEK_NEXT,
2399 &&L_OP_NOT_WORD_BOUND,
2400# ifdef USE_WORD_BEGIN_END
2408 &&L_OP_NOT_ASCII_WORD,
2409 &&L_OP_ASCII_WORD_BOUND,
2410 &&L_OP_NOT_ASCII_WORD_BOUND,
2411# ifdef USE_WORD_BEGIN_END
2412 &&L_OP_ASCII_WORD_BEGIN,
2413 &&L_OP_ASCII_WORD_END,
2423 &&L_OP_SEMI_END_BUF,
2424 &&L_OP_BEGIN_POSITION,
2430 &&L_OP_BACKREF_MULTI,
2431 &&L_OP_BACKREF_MULTI_IC,
2432# ifdef USE_BACKREF_WITH_LEVEL
2433 &&L_OP_BACKREF_WITH_LEVEL,
2437 &&L_OP_MEMORY_START,
2438 &&L_OP_MEMORY_START_PUSH,
2439 &&L_OP_MEMORY_END_PUSH,
2440# ifdef USE_SUBEXP_CALL
2441 &&L_OP_MEMORY_END_PUSH_REC,
2446# ifdef USE_SUBEXP_CALL
2447 &&L_OP_MEMORY_END_REC,
2458# ifdef USE_OP_PUSH_OR_JUMP_EXACT
2459 &&L_OP_PUSH_OR_JUMP_EXACT1,
2463 &&L_OP_PUSH_IF_PEEK_NEXT,
2467 &&L_OP_REPEAT_INC_NG,
2468 &&L_OP_REPEAT_INC_SG,
2469 &&L_OP_REPEAT_INC_NG_SG,
2470 &&L_OP_NULL_CHECK_START,
2471 &&L_OP_NULL_CHECK_END,
2472# ifdef USE_MONOMANIAC_CHECK_CAPTURES_IN_ENDLESS_REPEAT
2473 &&L_OP_NULL_CHECK_END_MEMST,
2477# ifdef USE_SUBEXP_CALL
2478 &&L_OP_NULL_CHECK_END_MEMST_PUSH,
2485 &&L_OP_PUSH_POS_NOT,
2487 &&L_OP_PUSH_STOP_BT,
2490 &&L_OP_PUSH_LOOK_BEHIND_NOT,
2491 &&L_OP_FAIL_LOOK_BEHIND_NOT,
2492 &&L_OP_PUSH_ABSENT_POS,
2496# ifdef USE_SUBEXP_CALL
2505# ifdef USE_COMBINATION_EXPLOSION_CHECK
2506 &&L_OP_STATE_CHECK_PUSH,
2507 &&L_OP_STATE_CHECK_PUSH_OR_JUMP,
2514# ifdef USE_COMBINATION_EXPLOSION_CHECK
2515 &&L_OP_STATE_CHECK_ANYCHAR_STAR,
2516 &&L_OP_STATE_CHECK_ANYCHAR_ML_STAR,
2523 &&L_OP_SET_OPTION_PUSH,
2539# define VM_LOOP_END } sprev = sbegin; }
2540# define CASE(x) case x:
2541# define DEFAULT default:
2543# define JUMP continue; break
2547#ifdef USE_SUBEXP_CALL
2550# define ADD_NUMMEM 1
2553# define ADD_NUMMEM 0
2556 n = reg->num_repeat + (reg->num_mem + ADD_NUMMEM) * 2;
2558 STACK_INIT(alloca_base, xmalloc_base, n, INIT_MATCH_STACK_SIZE);
2559 pop_level = reg->stack_pop_level;
2560 num_mem = reg->num_mem;
2561 repeat_stk = (OnigStackIndex* )alloca_base;
2563 mem_start_stk = (OnigStackIndex* )(repeat_stk + reg->num_repeat);
2564 mem_end_stk = mem_start_stk + (num_mem + ADD_NUMMEM);
2566 OnigStackIndex *pp = mem_start_stk;
2567 for (; pp < repeat_stk + n; pp += 2) {
2568 pp[0] = INVALID_STACK_INDEX;
2569 pp[1] = INVALID_STACK_INDEX;
2572#ifndef USE_SUBEXP_CALL
2579#ifdef ONIG_DEBUG_MATCH
2580 fprintf(stderr,
"match_at: str: %"PRIuPTR
" (%p), end: %"PRIuPTR
" (%p), start: %"PRIuPTR
" (%p), sprev: %"PRIuPTR
" (%p)\n",
2581 (uintptr_t )str, str, (uintptr_t )end, end, (uintptr_t )sstart, sstart, (uintptr_t )sprev, sprev);
2582 fprintf(stderr,
"size: %d, start offset: %d\n",
2583 (
int )(end - str), (
int )(sstart - str));
2584 fprintf(stderr,
"\n ofs> str stk:type addr:opcode\n");
2587 STACK_PUSH_ENSURED(STK_ALT, (UChar* )FinishCode);
2588 best_len = ONIG_MISMATCH;
2589 s = (UChar* )sstart;
2590 pkeep = (UChar* )sstart;
2593#ifdef ONIG_DEBUG_MATCH
2594# define OPCODE_EXEC_HOOK \
2596 UChar *op, *q, *bp, buf[50]; \
2598 op = p - OP_OFFSET; \
2599 fprintf(stderr, "%4"PRIdPTR"> \"", (*op == OP_FINISH) ? (ptrdiff_t )-1 : s - str); \
2602 if (*op != OP_FINISH) { \
2603 for (i = 0; i < 7 && q < end; i++) { \
2604 len = enclen(encode, q, end); \
2605 while (len-- > 0) *bp++ = *q++; \
2607 if (q < end) { xmemcpy(bp, "...", 3); bp += 3; } \
2609 xmemcpy(bp, "\"", 1); bp += 1; \
2611 fputs((char* )buf, stderr); \
2612 for (i = 0; i < 20 - (bp - buf); i++) fputc(' ', stderr); \
2613 fprintf(stderr, "%4"PRIdPTR":%s %4"PRIdPTR":", \
2614 stk - stk_base - 1, \
2615 (stk > stk_base) ? stack_type_str(stk[-1].type) : " ", \
2616 (op == FinishCode) ? (ptrdiff_t )-1 : op - reg->p); \
2617 onig_print_compiled_byte_code(stderr, op, reg->p+reg->used, NULL, encode); \
2618 fprintf(stderr, "\n"); \
2621# define OPCODE_EXEC_HOOK ((void) 0)
2624#ifdef USE_MATCH_CACHE
2625#ifdef ONIG_DEBUG_MATCH_CACHE
2626#define MATCH_CACHE_DEBUG fprintf(stderr, "MATCH CACHE: cache %td (p=%p index=%td mask=%d)\n", match_cache_point, pbegin, match_cache_point_index, match_cache_point_mask)
2627#define MATCH_CACHE_DEBUG_HIT fprintf(stderr, "MATCH CACHE: cache hit\n")
2629#define MATCH_CACHE_DEBUG ((void) 0)
2630#define MATCH_CACHE_DEBUG_HIT ((void) 0)
2633#define MATCH_CACHE_HIT ((void) 0)
2635# define CHECK_MATCH_CACHE do {\
2636 if (msa->match_cache_status == MATCH_CACHE_STATUS_ENABLED) {\
2637 const OnigCacheOpcode *cache_opcode;\
2638 long cache_point = find_cache_point(reg, msa->cache_opcodes, msa->num_cache_opcodes, pbegin, stk_base, repeat_stk, &cache_opcode);\
2639 if (cache_point >= 0) {\
2640 OnigPosition match_cache_point = msa->num_cache_points * (OnigPosition)(s - str) + cache_point;\
2641 OnigPosition match_cache_point_index = match_cache_point >> 3;\
2642 uint8_t match_cache_point_mask = 1 << (match_cache_point & 7);\
2644 if (msa->match_cache_buf[match_cache_point_index] & match_cache_point_mask) {\
2645 MATCH_CACHE_DEBUG_HIT; MATCH_CACHE_HIT;\
2646 if (cache_opcode->lookaround_nesting == 0) goto fail;\
2647 else if (cache_opcode->lookaround_nesting < 0) {\
2648 if (check_extended_match_cache_point(msa->match_cache_buf, match_cache_point_index, match_cache_point_mask)) {\
2649 STACK_STOP_BT_FAIL;\
2655 if (check_extended_match_cache_point(msa->match_cache_buf, match_cache_point_index, match_cache_point_mask)) {\
2656 p = cache_opcode->match_addr;\
2663 STACK_PUSH_MATCH_CACHE_POINT(match_cache_point_index, match_cache_point_mask);\
2668# define CHECK_MATCH_CACHE ((void) 0)
2672 CASE(OP_END) MOP_IN(OP_END);
2676#ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
2677 if (IS_FIND_LONGEST(option)) {
2678 if (n > msa->best_len) {
2680 msa->best_s = (UChar* )sstart;
2687 region = msa->region;
2689 region->beg[0] = ((pkeep > s) ? s : pkeep) - str;
2690 region->end[0] = s - str;
2691 for (i = 1; i <= num_mem; i++) {
2692 if (mem_end_stk[i] != INVALID_STACK_INDEX) {
2693 if (BIT_STATUS_AT(reg->bt_mem_start, i))
2694 region->beg[i] = STACK_AT(mem_start_stk[i])->u.mem.pstr - str;
2696 region->beg[i] = (UChar* )((
void* )mem_start_stk[i]) - str;
2698 region->end[i] = (BIT_STATUS_AT(reg->bt_mem_end, i)
2699 ? STACK_AT(mem_end_stk[i])->u.mem.pstr
2700 : (UChar* )((
void* )mem_end_stk[i])) - str;
2703 region->beg[i] = region->end[i] = ONIG_REGION_NOTPOS;
2707#ifdef USE_CAPTURE_HISTORY
2708 if (reg->capture_history != 0) {
2710 OnigCaptureTreeNode* node;
2712 if (IS_NULL(region->history_root)) {
2713 region->history_root = node = history_node_new();
2714 CHECK_NULL_RETURN_MEMERR(node);
2717 node = region->history_root;
2718 history_tree_clear(node);
2722 node->beg = ((pkeep > s) ? s : pkeep) - str;
2723 node->end = s - str;
2726 r = make_capture_history_tree(region->history_root, &stkp,
2727 stk, (UChar* )str, reg);
2737#ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
2742 if (IS_FIND_CONDITION(option)) {
2743 if (IS_FIND_NOT_EMPTY(option) && s == sstart) {
2744 best_len = ONIG_MISMATCH;
2747 if (IS_FIND_LONGEST(option) && DATA_ENSURE_CHECK1) {
2755 CASE(OP_EXACT1) MOP_IN(OP_EXACT1);
2757 if (*p != *s)
goto fail;
2762 CASE(OP_EXACT1_IC) MOP_IN(OP_EXACT1_IC);
2765 UChar *q, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN];
2768 len = ONIGENC_MBC_CASE_FOLD(encode,
2773 if (
len != enclen(encode, p, reg->p + reg->used))
goto fail;
2785 CASE(OP_EXACT2) MOP_IN(OP_EXACT2);
2787 if (*p != *s)
goto fail;
2789 if (*p != *s)
goto fail;
2795 CASE(OP_EXACT3) MOP_IN(OP_EXACT3);
2797 if (*p != *s)
goto fail;
2799 if (*p != *s)
goto fail;
2801 if (*p != *s)
goto fail;
2807 CASE(OP_EXACT4) MOP_IN(OP_EXACT4);
2809 if (*p != *s)
goto fail;
2811 if (*p != *s)
goto fail;
2813 if (*p != *s)
goto fail;
2815 if (*p != *s)
goto fail;
2821 CASE(OP_EXACT5) MOP_IN(OP_EXACT5);
2823 if (*p != *s)
goto fail;
2825 if (*p != *s)
goto fail;
2827 if (*p != *s)
goto fail;
2829 if (*p != *s)
goto fail;
2831 if (*p != *s)
goto fail;
2837 CASE(OP_EXACTN) MOP_IN(OP_EXACTN);
2838 GET_LENGTH_INC(tlen, p);
2840 while (tlen-- > 0) {
2841 if (*p++ != *s++)
goto fail;
2847 CASE(OP_EXACTN_IC) MOP_IN(OP_EXACTN_IC);
2850 UChar *q, *endp, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN];
2852 GET_LENGTH_INC(tlen, p);
2858 len = ONIGENC_MBC_CASE_FOLD(encode,
2863 if (
len > endp - p)
goto fail;
2866 if (*p != *q)
goto fail;
2875 CASE(OP_EXACTMB2N1) MOP_IN(OP_EXACTMB2N1);
2877 if (*p != *s)
goto fail;
2879 if (*p != *s)
goto fail;
2884 CASE(OP_EXACTMB2N2) MOP_IN(OP_EXACTMB2N2);
2886 if (*p != *s)
goto fail;
2888 if (*p != *s)
goto fail;
2891 if (*p != *s)
goto fail;
2893 if (*p != *s)
goto fail;
2898 CASE(OP_EXACTMB2N3) MOP_IN(OP_EXACTMB2N3);
2900 if (*p != *s)
goto fail;
2902 if (*p != *s)
goto fail;
2904 if (*p != *s)
goto fail;
2906 if (*p != *s)
goto fail;
2909 if (*p != *s)
goto fail;
2911 if (*p != *s)
goto fail;
2916 CASE(OP_EXACTMB2N) MOP_IN(OP_EXACTMB2N);
2917 GET_LENGTH_INC(tlen, p);
2918 DATA_ENSURE(tlen * 2);
2919 while (tlen-- > 0) {
2920 if (*p != *s)
goto fail;
2922 if (*p != *s)
goto fail;
2929 CASE(OP_EXACTMB3N) MOP_IN(OP_EXACTMB3N);
2930 GET_LENGTH_INC(tlen, p);
2931 DATA_ENSURE(tlen * 3);
2932 while (tlen-- > 0) {
2933 if (*p != *s)
goto fail;
2935 if (*p != *s)
goto fail;
2937 if (*p != *s)
goto fail;
2944 CASE(OP_EXACTMBN) MOP_IN(OP_EXACTMBN);
2945 GET_LENGTH_INC(tlen, p);
2946 GET_LENGTH_INC(tlen2, p);
2949 while (tlen2-- > 0) {
2950 if (*p != *s)
goto fail;
2957 CASE(OP_CCLASS) MOP_IN(OP_CCLASS);
2959 if (BITSET_AT(((BitSetRef )p), *s) == 0)
goto fail;
2961 s += enclen(encode, s, end);
2965 CASE(OP_CCLASS_MB) MOP_IN(OP_CCLASS_MB);
2966 if (! ONIGENC_IS_MBC_HEAD(encode, s, end))
goto fail;
2969 GET_LENGTH_INC(tlen, p);
2976 mb_len = enclen_approx(encode, s, end);
2977 DATA_ENSURE(mb_len);
2980 code = ONIGENC_MBC_TO_CODE(encode, ss, s);
2982#ifdef PLATFORM_UNALIGNED_WORD_ACCESS
2983 if (! onig_is_in_code_range(p, code))
goto fail;
2987 if (! onig_is_in_code_range(q, code))
goto fail;
2994 CASE(OP_CCLASS_MIX) MOP_IN(OP_CCLASS_MIX);
2996 if (ONIGENC_IS_MBC_HEAD(encode, s, end)) {
3001 if (BITSET_AT(((BitSetRef )p), *s) == 0)
3005 GET_LENGTH_INC(tlen, p);
3012 CASE(OP_CCLASS_NOT) MOP_IN(OP_CCLASS_NOT);
3014 if (BITSET_AT(((BitSetRef )p), *s) != 0)
goto fail;
3016 s += enclen(encode, s, end);
3020 CASE(OP_CCLASS_MB_NOT) MOP_IN(OP_CCLASS_MB_NOT);
3022 if (! ONIGENC_IS_MBC_HEAD(encode, s, end)) {
3024 GET_LENGTH_INC(tlen, p);
3026 goto cc_mb_not_success;
3030 GET_LENGTH_INC(tlen, p);
3034 int mb_len = enclen(encode, s, end);
3036 if (! DATA_ENSURE_CHECK(mb_len)) {
3040 goto cc_mb_not_success;
3045 code = ONIGENC_MBC_TO_CODE(encode, ss, s);
3047#ifdef PLATFORM_UNALIGNED_WORD_ACCESS
3048 if (onig_is_in_code_range(p, code))
goto fail;
3052 if (onig_is_in_code_range(q, code))
goto fail;
3061 CASE(OP_CCLASS_MIX_NOT) MOP_IN(OP_CCLASS_MIX_NOT);
3063 if (ONIGENC_IS_MBC_HEAD(encode, s, end)) {
3068 if (BITSET_AT(((BitSetRef )p), *s) != 0)
3072 GET_LENGTH_INC(tlen, p);
3079 CASE(OP_ANYCHAR) MOP_IN(OP_ANYCHAR);
3081 n = enclen_approx(encode, s, end);
3083 if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 0))
goto fail;
3088 CASE(OP_ANYCHAR_ML) MOP_IN(OP_ANYCHAR_ML);
3090 n = enclen_approx(encode, s, end);
3096 CASE(OP_ANYCHAR_STAR) MOP_IN(OP_ANYCHAR_STAR);
3097 while (DATA_ENSURE_CHECK1) {
3099 STACK_PUSH_ALT(p, s, sprev, pkeep);
3100 n = enclen_approx(encode, s, end);
3102 if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 0))
goto fail;
3109 CASE(OP_ANYCHAR_ML_STAR) MOP_IN(OP_ANYCHAR_ML_STAR);
3110 while (DATA_ENSURE_CHECK1) {
3112 STACK_PUSH_ALT(p, s, sprev, pkeep);
3113 n = enclen_approx(encode, s, end);
3127 CASE(OP_ANYCHAR_STAR_PEEK_NEXT) MOP_IN(OP_ANYCHAR_STAR_PEEK_NEXT);
3128 while (DATA_ENSURE_CHECK1) {
3131 STACK_PUSH_ALT(p + 1, s, sprev, pkeep);
3133#ifdef USE_MATCH_CACHE
3139 n = enclen_approx(encode, s, end);
3141 if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 0))
goto fail;
3149 CASE(OP_ANYCHAR_ML_STAR_PEEK_NEXT)MOP_IN(OP_ANYCHAR_ML_STAR_PEEK_NEXT);
3150 while (DATA_ENSURE_CHECK1) {
3153 STACK_PUSH_ALT(p + 1, s, sprev, pkeep);
3155#ifdef USE_MATCH_CACHE
3161 n = enclen_approx(encode, s, end);
3176#ifdef USE_COMBINATION_EXPLOSION_CHECK
3177 CASE(OP_STATE_CHECK_ANYCHAR_STAR) MOP_IN(OP_STATE_CHECK_ANYCHAR_STAR);
3178 GET_STATE_CHECK_NUM_INC(mem, p);
3179 while (DATA_ENSURE_CHECK1) {
3180 STATE_CHECK_VAL(scv, mem);
3183 STACK_PUSH_ALT_WITH_STATE_CHECK(p, s, sprev, mem, pkeep);
3184 n = enclen_approx(encode, s, end);
3186 if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 0))
goto fail;
3193 CASE(OP_STATE_CHECK_ANYCHAR_ML_STAR)
3194 MOP_IN(OP_STATE_CHECK_ANYCHAR_ML_STAR);
3196 GET_STATE_CHECK_NUM_INC(mem, p);
3197 while (DATA_ENSURE_CHECK1) {
3198 STATE_CHECK_VAL(scv, mem);
3201 STACK_PUSH_ALT_WITH_STATE_CHECK(p, s, sprev, mem, pkeep);
3202 n = enclen_approx(encode, s, end);
3217 CASE(OP_WORD) MOP_IN(OP_WORD);
3219 if (! ONIGENC_IS_MBC_WORD(encode, s, end))
3222 s += enclen(encode, s, end);
3226 CASE(OP_ASCII_WORD) MOP_IN(OP_ASCII_WORD);
3228 if (! ONIGENC_IS_MBC_ASCII_WORD(encode, s, end))
3231 s += enclen(encode, s, end);
3235 CASE(OP_NOT_WORD) MOP_IN(OP_NOT_WORD);
3237 if (ONIGENC_IS_MBC_WORD(encode, s, end))
3240 s += enclen(encode, s, end);
3244 CASE(OP_NOT_ASCII_WORD) MOP_IN(OP_NOT_ASCII_WORD);
3246 if (ONIGENC_IS_MBC_ASCII_WORD(encode, s, end))
3249 s += enclen(encode, s, end);
3253 CASE(OP_WORD_BOUND) MOP_IN(OP_WORD_BOUND);
3254 if (ON_STR_BEGIN(s)) {
3256 if (! ONIGENC_IS_MBC_WORD(encode, s, end))
3259 else if (ON_STR_END(s)) {
3260 if (! ONIGENC_IS_MBC_WORD(encode, sprev, end))
3264 if (ONIGENC_IS_MBC_WORD(encode, s, end)
3265 == ONIGENC_IS_MBC_WORD(encode, sprev, end))
3271 CASE(OP_ASCII_WORD_BOUND) MOP_IN(OP_ASCII_WORD_BOUND);
3272 if (ON_STR_BEGIN(s)) {
3274 if (! ONIGENC_IS_MBC_ASCII_WORD(encode, s, end))
3277 else if (ON_STR_END(s)) {
3278 if (! ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end))
3282 if (ONIGENC_IS_MBC_ASCII_WORD(encode, s, end)
3283 == ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end))
3289 CASE(OP_NOT_WORD_BOUND) MOP_IN(OP_NOT_WORD_BOUND);
3290 if (ON_STR_BEGIN(s)) {
3291 if (DATA_ENSURE_CHECK1 && ONIGENC_IS_MBC_WORD(encode, s, end))
3294 else if (ON_STR_END(s)) {
3295 if (ONIGENC_IS_MBC_WORD(encode, sprev, end))
3299 if (ONIGENC_IS_MBC_WORD(encode, s, end)
3300 != ONIGENC_IS_MBC_WORD(encode, sprev, end))
3306 CASE(OP_NOT_ASCII_WORD_BOUND) MOP_IN(OP_NOT_ASCII_WORD_BOUND);
3307 if (ON_STR_BEGIN(s)) {
3308 if (DATA_ENSURE_CHECK1 && ONIGENC_IS_MBC_ASCII_WORD(encode, s, end))
3311 else if (ON_STR_END(s)) {
3312 if (ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end))
3316 if (ONIGENC_IS_MBC_ASCII_WORD(encode, s, end)
3317 != ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end))
3323#ifdef USE_WORD_BEGIN_END
3324 CASE(OP_WORD_BEGIN) MOP_IN(OP_WORD_BEGIN);
3325 if (DATA_ENSURE_CHECK1 && ONIGENC_IS_MBC_WORD(encode, s, end)) {
3326 if (ON_STR_BEGIN(s) || !ONIGENC_IS_MBC_WORD(encode, sprev, end)) {
3333 CASE(OP_ASCII_WORD_BEGIN) MOP_IN(OP_ASCII_WORD_BEGIN);
3334 if (DATA_ENSURE_CHECK1 && ONIGENC_IS_MBC_ASCII_WORD(encode, s, end)) {
3335 if (ON_STR_BEGIN(s) || !ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end)) {
3342 CASE(OP_WORD_END) MOP_IN(OP_WORD_END);
3343 if (!ON_STR_BEGIN(s) && ONIGENC_IS_MBC_WORD(encode, sprev, end)) {
3344 if (ON_STR_END(s) || !ONIGENC_IS_MBC_WORD(encode, s, end)) {
3351 CASE(OP_ASCII_WORD_END) MOP_IN(OP_ASCII_WORD_END);
3352 if (!ON_STR_BEGIN(s) && ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end)) {
3353 if (ON_STR_END(s) || !ONIGENC_IS_MBC_ASCII_WORD(encode, s, end)) {
3361 CASE(OP_BEGIN_BUF) MOP_IN(OP_BEGIN_BUF);
3362 if (! ON_STR_BEGIN(s))
goto fail;
3363 if (IS_NOTBOS(msa->options))
goto fail;
3368 CASE(OP_END_BUF) MOP_IN(OP_END_BUF);
3369 if (! ON_STR_END(s))
goto fail;
3370 if (IS_NOTEOS(msa->options))
goto fail;
3375 CASE(OP_BEGIN_LINE) MOP_IN(OP_BEGIN_LINE);
3376 if (ON_STR_BEGIN(s)) {
3377 if (IS_NOTBOL(msa->options))
goto fail;
3381 else if (ONIGENC_IS_MBC_NEWLINE(encode, sprev, end)
3382#ifdef USE_CRNL_AS_LINE_TERMINATOR
3383 && !(IS_NEWLINE_CRLF(option)
3384 && ONIGENC_IS_MBC_CRNL(encode, sprev, end))
3386 && !ON_STR_END(s)) {
3392 CASE(OP_END_LINE) MOP_IN(OP_END_LINE);
3393 if (ON_STR_END(s)) {
3394#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
3395 if (IS_EMPTY_STR || !ONIGENC_IS_MBC_NEWLINE_EX(encode, sprev, str, end, option, 1)) {
3397 if (IS_NOTEOL(msa->options))
goto fail;
3400#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
3404 else if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 1)) {
3410 CASE(OP_SEMI_END_BUF) MOP_IN(OP_SEMI_END_BUF);
3411 if (ON_STR_END(s)) {
3412#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
3413 if (IS_EMPTY_STR || !ONIGENC_IS_MBC_NEWLINE_EX(encode, sprev, str, end, option, 1)) {
3415 if (IS_NOTEOL(msa->options))
goto fail;
3418#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
3422 else if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 1)) {
3423 UChar* ss = s + enclen(encode, s, end);
3424 if (ON_STR_END(ss)) {
3428#ifdef USE_CRNL_AS_LINE_TERMINATOR
3429 else if (IS_NEWLINE_CRLF(option)
3430 && ONIGENC_IS_MBC_CRNL(encode, s, end)) {
3431 ss += enclen(encode, ss, end);
3432 if (ON_STR_END(ss)) {
3441 CASE(OP_BEGIN_POSITION) MOP_IN(OP_BEGIN_POSITION);
3448 CASE(OP_MEMORY_START_PUSH) MOP_IN(OP_MEMORY_START_PUSH);
3449 GET_MEMNUM_INC(mem, p);
3450 STACK_PUSH_MEM_START(mem, s);
3454 CASE(OP_MEMORY_START) MOP_IN(OP_MEMORY_START);
3455 GET_MEMNUM_INC(mem, p);
3456 mem_start_stk[mem] = (OnigStackIndex )((
void* )s);
3457 mem_end_stk[mem] = INVALID_STACK_INDEX;
3461 CASE(OP_MEMORY_END_PUSH) MOP_IN(OP_MEMORY_END_PUSH);
3462 GET_MEMNUM_INC(mem, p);
3463 STACK_PUSH_MEM_END(mem, s);
3467 CASE(OP_MEMORY_END) MOP_IN(OP_MEMORY_END);
3468 GET_MEMNUM_INC(mem, p);
3469 mem_end_stk[mem] = (OnigStackIndex )((
void* )s);
3473 CASE(OP_KEEP) MOP_IN(OP_KEEP);
3478#ifdef USE_SUBEXP_CALL
3479 CASE(OP_MEMORY_END_PUSH_REC) MOP_IN(OP_MEMORY_END_PUSH_REC);
3480 GET_MEMNUM_INC(mem, p);
3481 STACK_GET_MEM_START(mem, stkp);
3482 mem_start_stk[mem] = GET_STACK_INDEX(stkp);
3483 STACK_PUSH_MEM_END(mem, s);
3487 CASE(OP_MEMORY_END_REC) MOP_IN(OP_MEMORY_END_REC);
3488 GET_MEMNUM_INC(mem, p);
3489 mem_end_stk[mem] = (OnigStackIndex )((
void* )s);
3490 STACK_GET_MEM_START(mem, stkp);
3492 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3493 mem_start_stk[mem] = GET_STACK_INDEX(stkp);
3495 mem_start_stk[mem] = (OnigStackIndex )((
void* )stkp->u.mem.pstr);
3497 STACK_PUSH_MEM_END_MARK(mem);
3502 CASE(OP_BACKREF1) MOP_IN(OP_BACKREF1);
3506 CASE(OP_BACKREF2) MOP_IN(OP_BACKREF2);
3510 CASE(OP_BACKREFN) MOP_IN(OP_BACKREFN);
3511 GET_MEMNUM_INC(mem, p);
3515 UChar *pstart, *pend;
3519 if (mem > num_mem)
goto fail;
3520 if (mem_end_stk[mem] == INVALID_STACK_INDEX)
goto fail;
3521 if (mem_start_stk[mem] == INVALID_STACK_INDEX)
goto fail;
3523 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3524 pstart = STACK_AT(mem_start_stk[mem])->u.mem.pstr;
3526 pstart = (UChar* )((
void* )mem_start_stk[mem]);
3528 pend = (BIT_STATUS_AT(reg->bt_mem_end, mem)
3529 ? STACK_AT(mem_end_stk[mem])->u.mem.pstr
3530 : (UChar* )((
void* )mem_end_stk[mem]));
3534 STRING_CMP(pstart, s, n);
3535 while (sprev + (
len = enclen_approx(encode, sprev, end)) < s)
3542 CASE(OP_BACKREFN_IC) MOP_IN(OP_BACKREFN_IC);
3543 GET_MEMNUM_INC(mem, p);
3546 UChar *pstart, *pend;
3550 if (mem > num_mem)
goto fail;
3551 if (mem_end_stk[mem] == INVALID_STACK_INDEX)
goto fail;
3552 if (mem_start_stk[mem] == INVALID_STACK_INDEX)
goto fail;
3554 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3555 pstart = STACK_AT(mem_start_stk[mem])->u.mem.pstr;
3557 pstart = (UChar* )((
void* )mem_start_stk[mem]);
3559 pend = (BIT_STATUS_AT(reg->bt_mem_end, mem)
3560 ? STACK_AT(mem_end_stk[mem])->u.mem.pstr
3561 : (UChar* )((
void* )mem_end_stk[mem]));
3565 STRING_CMP_IC(case_fold_flag, pstart, &s, n, end);
3566 while (sprev + (
len = enclen_approx(encode, sprev, end)) < s)
3574 CASE(OP_BACKREF_MULTI) MOP_IN(OP_BACKREF_MULTI);
3577 UChar *pstart, *pend, *swork;
3579 GET_LENGTH_INC(tlen, p);
3580 for (i = 0; i < tlen; i++) {
3581 GET_MEMNUM_INC(mem, p);
3583 if (mem_end_stk[mem] == INVALID_STACK_INDEX)
continue;
3584 if (mem_start_stk[mem] == INVALID_STACK_INDEX)
continue;
3586 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3587 pstart = STACK_AT(mem_start_stk[mem])->u.mem.pstr;
3589 pstart = (UChar* )((
void* )mem_start_stk[mem]);
3591 pend = (BIT_STATUS_AT(reg->bt_mem_end, mem)
3592 ? STACK_AT(mem_end_stk[mem])->u.mem.pstr
3593 : (UChar* )((
void* )mem_end_stk[mem]));
3595 DATA_ENSURE_CONTINUE(n);
3598 STRING_CMP_VALUE(pstart, swork, n, is_fail);
3599 if (is_fail)
continue;
3601 while (sprev + (
len = enclen_approx(encode, sprev, end)) < s)
3604 p += (SIZE_MEMNUM * (tlen - i - 1));
3607 if (i == tlen)
goto fail;
3613 CASE(OP_BACKREF_MULTI_IC) MOP_IN(OP_BACKREF_MULTI_IC);
3616 UChar *pstart, *pend, *swork;
3618 GET_LENGTH_INC(tlen, p);
3619 for (i = 0; i < tlen; i++) {
3620 GET_MEMNUM_INC(mem, p);
3622 if (mem_end_stk[mem] == INVALID_STACK_INDEX)
continue;
3623 if (mem_start_stk[mem] == INVALID_STACK_INDEX)
continue;
3625 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3626 pstart = STACK_AT(mem_start_stk[mem])->u.mem.pstr;
3628 pstart = (UChar* )((
void* )mem_start_stk[mem]);
3630 pend = (BIT_STATUS_AT(reg->bt_mem_end, mem)
3631 ? STACK_AT(mem_end_stk[mem])->u.mem.pstr
3632 : (UChar* )((
void* )mem_end_stk[mem]));
3634 DATA_ENSURE_CONTINUE(n);
3637 STRING_CMP_VALUE_IC(case_fold_flag, pstart, &swork, n, end, is_fail);
3638 if (is_fail)
continue;
3640 while (sprev + (
len = enclen(encode, sprev, end)) < s)
3643 p += (SIZE_MEMNUM * (tlen - i - 1));
3646 if (i == tlen)
goto fail;
3651#ifdef USE_BACKREF_WITH_LEVEL
3652 CASE(OP_BACKREF_WITH_LEVEL)
3658 GET_OPTION_INC(ic, p);
3659 GET_LENGTH_INC(level, p);
3660 GET_LENGTH_INC(tlen, p);
3663 if (backref_match_at_nested_level(reg, stk, stk_base, ic,
3664 case_fold_flag, (
int )level, (
int )tlen, p, &s, end)) {
3665 while (sprev + (
len = enclen(encode, sprev, end)) < s)
3668 p += (SIZE_MEMNUM * tlen);
3680 CASE(OP_SET_OPTION_PUSH) MOP_IN(OP_SET_OPTION_PUSH);
3681 GET_OPTION_INC(option, p);
3682 STACK_PUSH_ALT(p, s, sprev, pkeep);
3683 p += SIZE_OP_SET_OPTION + SIZE_OP_FAIL;
3687 CASE(OP_SET_OPTION) MOP_IN(OP_SET_OPTION);
3688 GET_OPTION_INC(option, p);
3693 CASE(OP_NULL_CHECK_START) MOP_IN(OP_NULL_CHECK_START);
3694 GET_MEMNUM_INC(mem, p);
3695 STACK_PUSH_NULL_CHECK_START(mem, s);
3699 CASE(OP_NULL_CHECK_END) MOP_IN(OP_NULL_CHECK_END);
3703 GET_MEMNUM_INC(mem, p);
3704 STACK_NULL_CHECK(isnull, mem, s);
3706#ifdef ONIG_DEBUG_MATCH
3707 fprintf(stderr,
"NULL_CHECK_END: skip id:%d, s:%"PRIuPTR
" (%p)\n",
3708 (
int )mem, (uintptr_t )s, s);
3718 case OP_REPEAT_INC_NG:
3719 case OP_REPEAT_INC_SG:
3720 case OP_REPEAT_INC_NG_SG:
3724 goto unexpected_bytecode_error;
3732#ifdef USE_MONOMANIAC_CHECK_CAPTURES_IN_ENDLESS_REPEAT
3733 CASE(OP_NULL_CHECK_END_MEMST) MOP_IN(OP_NULL_CHECK_END_MEMST);
3737 GET_MEMNUM_INC(mem, p);
3738 STACK_NULL_CHECK_MEMST(isnull, mem, s, reg);
3740# ifdef ONIG_DEBUG_MATCH
3741 fprintf(stderr,
"NULL_CHECK_END_MEMST: skip id:%d, s:%"PRIuPTR
" (%p)\n",
3742 (
int )mem, (uintptr_t )s, s);
3744 if (isnull == -1)
goto fail;
3745 goto null_check_found;
3752#ifdef USE_SUBEXP_CALL
3753 CASE(OP_NULL_CHECK_END_MEMST_PUSH)
3754 MOP_IN(OP_NULL_CHECK_END_MEMST_PUSH);
3758 GET_MEMNUM_INC(mem, p);
3759# ifdef USE_MONOMANIAC_CHECK_CAPTURES_IN_ENDLESS_REPEAT
3760 STACK_NULL_CHECK_MEMST_REC(isnull, mem, s, reg);
3762 STACK_NULL_CHECK_REC(isnull, mem, s);
3765# ifdef ONIG_DEBUG_MATCH
3766 fprintf(stderr,
"NULL_CHECK_END_MEMST_PUSH: skip id:%d, s:%"PRIuPTR
" (%p)\n",
3767 (
int )mem, (uintptr_t )s, s);
3769 if (isnull == -1)
goto fail;
3770 goto null_check_found;
3773 STACK_PUSH_NULL_CHECK_END(mem);
3780 CASE(OP_JUMP) MOP_IN(OP_JUMP);
3781 GET_RELADDR_INC(addr, p);
3784 CHECK_INTERRUPT_IN_MATCH_AT;
3787 CASE(OP_PUSH) MOP_IN(OP_PUSH);
3788 GET_RELADDR_INC(addr, p);
3790 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
3794#ifdef USE_COMBINATION_EXPLOSION_CHECK
3795 CASE(OP_STATE_CHECK_PUSH) MOP_IN(OP_STATE_CHECK_PUSH);
3796 GET_STATE_CHECK_NUM_INC(mem, p);
3797 STATE_CHECK_VAL(scv, mem);
3800 GET_RELADDR_INC(addr, p);
3801 STACK_PUSH_ALT_WITH_STATE_CHECK(p + addr, s, sprev, mem, pkeep);
3805 CASE(OP_STATE_CHECK_PUSH_OR_JUMP) MOP_IN(OP_STATE_CHECK_PUSH_OR_JUMP);
3806 GET_STATE_CHECK_NUM_INC(mem, p);
3807 GET_RELADDR_INC(addr, p);
3808 STATE_CHECK_VAL(scv, mem);
3813 STACK_PUSH_ALT_WITH_STATE_CHECK(p + addr, s, sprev, mem, pkeep);
3818 CASE(OP_STATE_CHECK) MOP_IN(OP_STATE_CHECK);
3819 GET_STATE_CHECK_NUM_INC(mem, p);
3820 STATE_CHECK_VAL(scv, mem);
3823 STACK_PUSH_STATE_CHECK(s, mem);
3828 CASE(OP_POP) MOP_IN(OP_POP);
3830#ifdef USE_MATCH_CACHE
3838#ifdef USE_OP_PUSH_OR_JUMP_EXACT
3839 CASE(OP_PUSH_OR_JUMP_EXACT1) MOP_IN(OP_PUSH_OR_JUMP_EXACT1);
3840 GET_RELADDR_INC(addr, p);
3841 if (*p == *s && DATA_ENSURE_CHECK1) {
3844 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
3853 CASE(OP_PUSH_IF_PEEK_NEXT) MOP_IN(OP_PUSH_IF_PEEK_NEXT);
3854 GET_RELADDR_INC(addr, p);
3858 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
3867 CASE(OP_REPEAT) MOP_IN(OP_REPEAT);
3869 GET_MEMNUM_INC(mem, p);
3870 GET_RELADDR_INC(addr, p);
3873 repeat_stk[mem] = GET_STACK_INDEX(stk);
3874 STACK_PUSH_REPEAT(mem, p);
3876 if (reg->repeat_range[mem].lower == 0) {
3878 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
3884 CASE(OP_REPEAT_NG) MOP_IN(OP_REPEAT_NG);
3886 GET_MEMNUM_INC(mem, p);
3887 GET_RELADDR_INC(addr, p);
3890 repeat_stk[mem] = GET_STACK_INDEX(stk);
3891 STACK_PUSH_REPEAT(mem, p);
3893 if (reg->repeat_range[mem].lower == 0) {
3895 STACK_PUSH_ALT(p, s, sprev, pkeep);
3902 CASE(OP_REPEAT_INC) MOP_IN(OP_REPEAT_INC);
3903 GET_MEMNUM_INC(mem, p);
3904 si = repeat_stk[mem];
3905 stkp = STACK_AT(si);
3908 stkp->u.repeat.count++;
3909 if (stkp->u.repeat.count >= reg->repeat_range[mem].upper) {
3912 else if (stkp->u.repeat.count >= reg->repeat_range[mem].lower) {
3913#ifdef USE_MATCH_CACHE
3914 if (*pbegin == OP_REPEAT_INC) {
3915#undef MATCH_CACHE_HIT
3916#define MATCH_CACHE_HIT stkp->u.repeat.count--;
3918#undef MATCH_CACHE_HIT
3919#define MATCH_CACHE_HIT ((void) 0)
3922 STACK_PUSH_ALT(p, s, sprev, pkeep);
3923 p = STACK_AT(si)->u.repeat.pcode;
3926 p = stkp->u.repeat.pcode;
3928 STACK_PUSH_REPEAT_INC(si);
3930 CHECK_INTERRUPT_IN_MATCH_AT;
3933 CASE(OP_REPEAT_INC_SG) MOP_IN(OP_REPEAT_INC_SG);
3934 GET_MEMNUM_INC(mem, p);
3935 STACK_GET_REPEAT(mem, stkp);
3936 si = GET_STACK_INDEX(stkp);
3939 CASE(OP_REPEAT_INC_NG) MOP_IN(OP_REPEAT_INC_NG);
3940 GET_MEMNUM_INC(mem, p);
3941 si = repeat_stk[mem];
3942 stkp = STACK_AT(si);
3945 stkp->u.repeat.count++;
3946 if (stkp->u.repeat.count < reg->repeat_range[mem].upper) {
3947 if (stkp->u.repeat.count >= reg->repeat_range[mem].lower) {
3948 UChar* pcode = stkp->u.repeat.pcode;
3950 STACK_PUSH_REPEAT_INC(si);
3951 if (*pbegin == OP_REPEAT_INC_NG) {
3954 STACK_PUSH_ALT(pcode, s, sprev, pkeep);
3957 p = stkp->u.repeat.pcode;
3958 STACK_PUSH_REPEAT_INC(si);
3961 else if (stkp->u.repeat.count == reg->repeat_range[mem].upper) {
3962 STACK_PUSH_REPEAT_INC(si);
3965 CHECK_INTERRUPT_IN_MATCH_AT;
3968 CASE(OP_REPEAT_INC_NG_SG) MOP_IN(OP_REPEAT_INC_NG_SG);
3969 GET_MEMNUM_INC(mem, p);
3970 STACK_GET_REPEAT(mem, stkp);
3971 si = GET_STACK_INDEX(stkp);
3974 CASE(OP_PUSH_POS) MOP_IN(OP_PUSH_POS);
3975 STACK_PUSH_POS(s, sprev, pkeep);
3979 CASE(OP_POP_POS) MOP_IN(OP_POP_POS);
3981 STACK_POS_END(stkp);
3982 s = stkp->u.state.pstr;
3983 sprev = stkp->u.state.pstr_prev;
3988 CASE(OP_PUSH_POS_NOT) MOP_IN(OP_PUSH_POS_NOT);
3989 GET_RELADDR_INC(addr, p);
3990 STACK_PUSH_POS_NOT(p + addr, s, sprev, pkeep);
3994 CASE(OP_FAIL_POS) MOP_IN(OP_FAIL_POS);
3995 STACK_POP_TIL_POS_NOT;
3998 CASE(OP_PUSH_STOP_BT) MOP_IN(OP_PUSH_STOP_BT);
4003 CASE(OP_POP_STOP_BT) MOP_IN(OP_POP_STOP_BT);
4008 CASE(OP_LOOK_BEHIND) MOP_IN(OP_LOOK_BEHIND);
4009 GET_LENGTH_INC(tlen, p);
4010 s = (UChar* )ONIGENC_STEP_BACK(encode, str, s, end, (
int )tlen);
4011 if (IS_NULL(s))
goto fail;
4012 sprev = (UChar* )onigenc_get_prev_char_head(encode, str, s, end);
4016 CASE(OP_PUSH_LOOK_BEHIND_NOT) MOP_IN(OP_PUSH_LOOK_BEHIND_NOT);
4017 GET_RELADDR_INC(addr, p);
4018 GET_LENGTH_INC(tlen, p);
4019 q = (UChar* )ONIGENC_STEP_BACK(encode, str, s, end, (
int )tlen);
4027 STACK_PUSH_LOOK_BEHIND_NOT(p + addr, s, sprev, pkeep);
4029 sprev = (UChar* )onigenc_get_prev_char_head(encode, str, s, end);
4034 CASE(OP_FAIL_LOOK_BEHIND_NOT) MOP_IN(OP_FAIL_LOOK_BEHIND_NOT);
4035 STACK_POP_TIL_LOOK_BEHIND_NOT;
4038 CASE(OP_PUSH_ABSENT_POS) MOP_IN(OP_PUSH_ABSENT_POS);
4040 STACK_PUSH_ABSENT_POS(s, ABSENT_END_POS);
4044 CASE(OP_ABSENT) MOP_IN(OP_ABSENT);
4046 const UChar* aend = ABSENT_END_POS;
4048 UChar* selfp = p - 1;
4050 STACK_POP_ABSENT_POS(absent, ABSENT_END_POS);
4051 GET_RELADDR_INC(addr, p);
4052#ifdef ONIG_DEBUG_MATCH
4053 fprintf(stderr,
"ABSENT: s:%p, end:%p, absent:%p, aend:%p\n", s, end, absent, aend);
4055 if ((absent > aend) && (s > absent)) {
4061 else if ((s >= aend) && (s > absent)) {
4071 else if (s == end) {
4077 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
4078 n = enclen(encode, s, end);
4079 STACK_PUSH_ABSENT_POS(absent, ABSENT_END_POS);
4080 STACK_PUSH_ALT(selfp, s + n, s, pkeep);
4082 ABSENT_END_POS = aend;
4088 CASE(OP_ABSENT_END) MOP_IN(OP_ABSENT_END);
4091 if (sprev < ABSENT_END_POS)
4092 ABSENT_END_POS = sprev;
4093#ifdef ONIG_DEBUG_MATCH
4094 fprintf(stderr,
"ABSENT_END: end:%p\n", ABSENT_END_POS);
4096 STACK_POP_TIL_ABSENT;
4099#ifdef USE_SUBEXP_CALL
4100 CASE(OP_CALL) MOP_IN(OP_CALL);
4101 GET_ABSADDR_INC(addr, p);
4102 STACK_PUSH_CALL_FRAME(p);
4107 CASE(OP_RETURN) MOP_IN(OP_RETURN);
4114 CASE(OP_CONDITION) MOP_IN(OP_CONDITION);
4115 GET_MEMNUM_INC(mem, p);
4116 GET_RELADDR_INC(addr, p);
4117 if ((mem > num_mem) ||
4118 (mem_end_stk[mem] == INVALID_STACK_INDEX) ||
4119 (mem_start_stk[mem] == INVALID_STACK_INDEX)) {
4136 p = stk->u.state.pcode;
4137 s = stk->u.state.pstr;
4138 sprev = stk->u.state.pstr_prev;
4139 pkeep = stk->u.state.pkeep;
4141#ifdef USE_MATCH_CACHE
4143 msa->match_cache_status != MATCH_CACHE_STATUS_DISABLED &&
4144 ++msa->num_fails >= (OnigPosition)(end - str) * msa->num_cache_opcodes
4146 if (msa->match_cache_status == MATCH_CACHE_STATUS_UNINIT) {
4147 msa->match_cache_status = MATCH_CACHE_STATUS_INIT;
4148 OnigPosition r = count_num_cache_opcodes(reg, &msa->num_cache_opcodes);
4149 if (r < 0)
goto bytecode_error;
4151 if (msa->num_cache_opcodes == NUM_CACHE_OPCODES_IMPOSSIBLE || msa->num_cache_opcodes == 0) {
4152 msa->match_cache_status = MATCH_CACHE_STATUS_DISABLED;
4153 goto fail_match_cache;
4155 if (msa->num_fails < (OnigPosition)(end - str) * msa->num_cache_opcodes) {
4156 goto fail_match_cache;
4158 if (msa->cache_opcodes == NULL) {
4159 msa->match_cache_status = MATCH_CACHE_STATUS_ENABLED;
4161 if (cache_opcodes == NULL) {
4164 OnigPosition r = init_cache_opcodes(reg, cache_opcodes, &msa->num_cache_points);
4166 if (r == ONIGERR_UNEXPECTED_BYTECODE)
goto unexpected_bytecode_error;
4167 else goto bytecode_error;
4169 msa->cache_opcodes = cache_opcodes;
4170#ifdef ONIG_DEBUG_MATCH_CACHE
4171 fprintf(stderr,
"MATCH CACHE: #cache opcodes = %ld\n", msa->num_cache_opcodes);
4172 fprintf(stderr,
"MATCH CACHE: #cache points = %ld\n", msa->num_cache_points);
4173 fprintf(stderr,
"MATCH CACHE: cache opcodes (%p):\n", msa->cache_opcodes);
4174 for (
int i = 0; i < msa->num_cache_opcodes; i++) {
4175 fprintf(stderr,
"MATCH CACHE: [%p] cache_point=%ld outer_repeat_mem=%d num_cache_opcodes_at_outer_repeat=%ld num_cache_opcodes_in_outer_repeat=%ld lookaround_nesting=%d match_addr=%p\n", msa->cache_opcodes[i].addr, msa->cache_opcodes[i].cache_point, msa->cache_opcodes[i].outer_repeat_mem, msa->cache_opcodes[i].num_cache_points_at_outer_repeat, msa->cache_opcodes[i].num_cache_points_in_outer_repeat, msa->cache_opcodes[i].lookaround_nesting, msa->cache_opcodes[i].match_addr);
4179 if (msa->match_cache_buf == NULL) {
4180 size_t length = (end - str) + 1;
4181 size_t num_match_cache_points = (size_t)msa->num_cache_points * length;
4182#ifdef ONIG_DEBUG_MATCH_CACHE
4183 fprintf(stderr,
"MATCH CACHE: #match cache points = %zu (length = %zu)\n", num_match_cache_points, length);
4186 if (num_match_cache_points / length != (
size_t)msa->num_cache_points) {
4189 if (num_match_cache_points >= (
size_t)PTRDIFF_MAX) {
4192 size_t match_cache_buf_length = (num_match_cache_points >> 3) + (num_match_cache_points & 7 ? 1 : 0) + 1;
4193 uint8_t* match_cache_buf = (uint8_t*)
xmalloc(match_cache_buf_length *
sizeof(uint8_t));
4194 if (match_cache_buf == NULL) {
4197 xmemset(match_cache_buf, 0, match_cache_buf_length *
sizeof(uint8_t));
4198 msa->match_cache_buf = match_cache_buf;
4204#ifdef USE_COMBINATION_EXPLOSION_CHECK
4205 if (stk->u.state.state_check != 0) {
4206 stk->type = STK_STATE_CHECK_MARK;
4212 CHECK_INTERRUPT_IN_MATCH_AT;
4216 goto bytecode_error;
4221 xfree(xmalloc_base);
4227 xfree(xmalloc_base);
4228 return ONIGERR_STACK_BUG;
4233 xfree(xmalloc_base);
4234 return ONIGERR_UNDEFINED_BYTECODE;
4236 unexpected_bytecode_error:
4238 xfree(xmalloc_base);
4239 return ONIGERR_UNEXPECTED_BYTECODE;
4243 xfree(xmalloc_base);
4244 return ONIGERR_TIMEOUT;
4246#ifdef USE_MATCH_CACHE
4249 xfree(xmalloc_base);
4250 return ONIGERR_MEMORY;
4256slow_search(OnigEncoding enc, UChar* target, UChar* target_end,
4257 const UChar* text,
const UChar* text_end, UChar* text_range)
4259 UChar *t, *p, *s, *end;
4261 end = (UChar* )text_end;
4262 end -= target_end - target - 1;
4263 if (end > text_range)
4268 if (enc->max_enc_len == enc->min_enc_len) {
4269 int n = enc->max_enc_len;
4272 if (*s == *target) {
4275 if (target_end == t || memcmp(t, p, target_end - t) == 0)
4280 return (UChar* )NULL;
4283 if (*s == *target) {
4286 if (target_end == t || memcmp(t, p, target_end - t) == 0)
4289 s += enclen(enc, s, text_end);
4292 return (UChar* )NULL;
4296str_lower_case_match(OnigEncoding enc,
int case_fold_flag,
4297 const UChar* t,
const UChar* tend,
4298 const UChar* p,
const UChar* end)
4301 UChar *q, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN];
4304 lowlen = ONIGENC_MBC_CASE_FOLD(enc, case_fold_flag, &p, end, lowbuf);
4305 if (tend - t < lowlen)
return 0;
4307 while (lowlen > 0) {
4308 if (*t++ != *q++)
return 0;
4317slow_search_ic(OnigEncoding enc,
int case_fold_flag,
4318 UChar* target, UChar* target_end,
4319 const UChar* text,
const UChar* text_end, UChar* text_range)
4323 end = (UChar* )text_end;
4324 end -= target_end - target - 1;
4325 if (end > text_range)
4331 if (str_lower_case_match(enc, case_fold_flag, target, target_end,
4335 s += enclen(enc, s, text_end);
4338 return (UChar* )NULL;
4342slow_search_backward(OnigEncoding enc, UChar* target, UChar* target_end,
4343 const UChar* text,
const UChar* adjust_text,
4344 const UChar* text_end,
const UChar* text_start)
4348 s = (UChar* )text_end;
4349 s -= (target_end - target);
4351 s = (UChar* )text_start;
4353 s = ONIGENC_LEFT_ADJUST_CHAR_HEAD(enc, adjust_text, s, text_end);
4356 if (*s == *target) {
4359 while (t < target_end) {
4364 if (t == target_end)
4367 s = (UChar* )onigenc_get_prev_char_head(enc, adjust_text, s, text_end);
4370 return (UChar* )NULL;
4374slow_search_backward_ic(OnigEncoding enc,
int case_fold_flag,
4375 UChar* target, UChar* target_end,
4376 const UChar* text,
const UChar* adjust_text,
4377 const UChar* text_end,
const UChar* text_start)
4381 s = (UChar* )text_end;
4382 s -= (target_end - target);
4384 s = (UChar* )text_start;
4386 s = ONIGENC_LEFT_ADJUST_CHAR_HEAD(enc, adjust_text, s, text_end);
4389 if (str_lower_case_match(enc, case_fold_flag,
4390 target, target_end, s, text_end))
4393 s = (UChar* )onigenc_get_prev_char_head(enc, adjust_text, s, text_end);
4396 return (UChar* )NULL;
4401bm_search_notrev(regex_t* reg,
const UChar* target,
const UChar* target_end,
4402 const UChar* text,
const UChar* text_end,
4403 const UChar* text_range)
4405 const UChar *s, *se, *t, *p, *end;
4407 ptrdiff_t skip, tlen1;
4408 OnigEncoding enc = reg->enc;
4410# ifdef ONIG_DEBUG_SEARCH
4411 fprintf(stderr,
"bm_search_notrev: text: %"PRIuPTR
" (%p), text_end: %"PRIuPTR
" (%p), text_range: %"PRIuPTR
" (%p)\n",
4412 (uintptr_t )text, text, (uintptr_t )text_end, text_end, (uintptr_t )text_range, text_range);
4415 tail = target_end - 1;
4416 tlen1 = tail - target;
4418 if (end + tlen1 > text_end)
4419 end = text_end - tlen1;
4427 if (t == target)
return (UChar* )s;
4430 if (s + 1 >= end)
break;
4431 skip = reg->map[se[1]];
4434 s += enclen(enc, s, end);
4435 }
while ((s - t) < skip && s < end);
4438 return (UChar* )NULL;
4443bm_search(regex_t* reg,
const UChar* target,
const UChar* target_end,
4444 const UChar* text,
const UChar* text_end,
const UChar* text_range)
4446 const UChar *s, *t, *p, *end;
4450# ifdef ONIG_DEBUG_SEARCH
4451 fprintf(stderr,
"bm_search: text: %"PRIuPTR
" (%p), text_end: %"PRIuPTR
" (%p), text_range: %"PRIuPTR
" (%p)\n",
4452 (uintptr_t )text, text, (uintptr_t )text_end, text_end, (uintptr_t )text_range, text_range);
4455 tail = target_end - 1;
4456 tlen1 = tail - target;
4457 end = text_range + tlen1;
4466 if (t == target)
return (UChar* )p;
4469 if (s + 1 >= end)
break;
4470 s += reg->map[s[1]];
4473 return (UChar* )NULL;
4478bm_search_notrev_ic(regex_t* reg,
const UChar* target,
const UChar* target_end,
4479 const UChar* text,
const UChar* text_end,
4480 const UChar* text_range)
4482 const UChar *s, *se, *t, *end;
4484 ptrdiff_t skip, tlen1;
4485 OnigEncoding enc = reg->enc;
4486 int case_fold_flag = reg->case_fold_flag;
4488# ifdef ONIG_DEBUG_SEARCH
4489 fprintf(stderr,
"bm_search_notrev_ic: text: %"PRIuPTR
" (%p), text_end: %"PRIuPTR
" (%p), text_range: %"PRIuPTR
" (%p)\n",
4490 (uintptr_t )text, text, (uintptr_t )text_end, text_end, (uintptr_t )text_range, text_range);
4493 tail = target_end - 1;
4494 tlen1 = tail - target;
4496 if (end + tlen1 > text_end)
4497 end = text_end - tlen1;
4503 if (str_lower_case_match(enc, case_fold_flag, target, target_end,
4506 if (s + 1 >= end)
break;
4507 skip = reg->map[se[1]];
4510 s += enclen(enc, s, end);
4511 }
while ((s - t) < skip && s < end);
4514 return (UChar* )NULL;
4519bm_search_ic(regex_t* reg,
const UChar* target,
const UChar* target_end,
4520 const UChar* text,
const UChar* text_end,
const UChar* text_range)
4522 const UChar *s, *p, *end;
4525 OnigEncoding enc = reg->enc;
4526 int case_fold_flag = reg->case_fold_flag;
4528# ifdef ONIG_DEBUG_SEARCH
4529 fprintf(stderr,
"bm_search_ic: text: %"PRIuPTR
" (%p), text_end: %"PRIuPTR
" (%p), text_range: %"PRIuPTR
" (%p)\n",
4530 (uintptr_t )text, text, (uintptr_t )text_end, text_end, (uintptr_t )text_range, text_range);
4533 tail = target_end - 1;
4534 tlen1 = tail - target;
4535 end = text_range + tlen1;
4542 if (str_lower_case_match(enc, case_fold_flag, target, target_end,
4545 if (s + 1 >= end)
break;
4546 s += reg->map[s[1]];
4549 return (UChar* )NULL;
4553map_search(OnigEncoding enc, UChar map[],
4554 const UChar* text,
const UChar* text_range,
const UChar* text_end)
4556 const UChar *s = text;
4558 while (s < text_range) {
4559 if (map[*s])
return (UChar* )s;
4561 s += enclen(enc, s, text_end);
4563 return (UChar* )NULL;
4567map_search_backward(OnigEncoding enc, UChar map[],
4568 const UChar* text,
const UChar* adjust_text,
4569 const UChar* text_start,
const UChar* text_end)
4571 const UChar *s = text_start;
4574 if (map[*s])
return (UChar* )s;
4576 s = onigenc_get_prev_char_head(enc, adjust_text, s, text_end);
4578 return (UChar* )NULL;
4582onig_match(regex_t* reg,
const UChar* str,
const UChar* end,
const UChar* at, OnigRegion* region,
4583 OnigOptionType option)
4589 MATCH_ARG_INIT(msa, option, region, at, at);
4590#ifdef USE_COMBINATION_EXPLOSION_CHECK
4592 ptrdiff_t offset = at - str;
4593 STATE_CHECK_BUFF_INIT(msa, end - str, offset, reg->num_comb_exp_check);
4598 r = onig_region_resize_clear(region, reg->num_mem + 1);
4604 prev = (UChar* )onigenc_get_prev_char_head(reg->enc, str, at, end);
4605 r = match_at(reg, str, end,
4606#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
4612 MATCH_ARG_FREE(msa);
4617forward_search_range(regex_t* reg,
const UChar* str,
const UChar* end, UChar* s,
4618 UChar* range, UChar** low, UChar** high, UChar** low_prev)
4620 UChar *p, *pprev = (UChar* )NULL;
4621 size_t input_len = end - str;
4623#ifdef ONIG_DEBUG_SEARCH
4624 fprintf(stderr,
"forward_search_range: str: %"PRIuPTR
" (%p), end: %"PRIuPTR
" (%p), s: %"PRIuPTR
" (%p), range: %"PRIuPTR
" (%p)\n",
4625 (uintptr_t )str, str, (uintptr_t )end, end, (uintptr_t )s, s, (uintptr_t )range, range);
4628 if (reg->dmin > input_len) {
4633 if (reg->dmin != 0) {
4634 if ((OnigDistance)(end - p) <= reg->dmin)
return 0;
4635 if (ONIGENC_IS_SINGLEBYTE(reg->enc)) {
4639 UChar *q = p + reg->dmin;
4641 while (p < q) p += enclen(reg->enc, p, end);
4646 switch (reg->optimize) {
4647 case ONIG_OPTIMIZE_EXACT:
4648 p = slow_search(reg->enc, reg->exact, reg->exact_end, p, end, range);
4650 case ONIG_OPTIMIZE_EXACT_IC:
4651 p = slow_search_ic(reg->enc, reg->case_fold_flag,
4652 reg->exact, reg->exact_end, p, end, range);
4655 case ONIG_OPTIMIZE_EXACT_BM:
4656 p = bm_search(reg, reg->exact, reg->exact_end, p, end, range);
4659 case ONIG_OPTIMIZE_EXACT_BM_NOT_REV:
4660 p = bm_search_notrev(reg, reg->exact, reg->exact_end, p, end, range);
4663 case ONIG_OPTIMIZE_EXACT_BM_IC:
4664 p = bm_search_ic(reg, reg->exact, reg->exact_end, p, end, range);
4667 case ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC:
4668 p = bm_search_notrev_ic(reg, reg->exact, reg->exact_end, p, end, range);
4671 case ONIG_OPTIMIZE_MAP:
4672 p = map_search(reg->enc, reg->map, p, range, end);
4676 if (p && p < range) {
4677 if ((OnigDistance)(p - s) < reg->dmin) {
4680 p += enclen(reg->enc, p, end);
4684 if (reg->sub_anchor) {
4687 switch (reg->sub_anchor) {
4688 case ANCHOR_BEGIN_LINE:
4689 if (!ON_STR_BEGIN(p)) {
4690 prev = onigenc_get_prev_char_head(reg->enc,
4691 (pprev ? pprev : str), p, end);
4692 if (!ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 0))
4697 case ANCHOR_END_LINE:
4698 if (ON_STR_END(p)) {
4699#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
4700 prev = (UChar* )onigenc_get_prev_char_head(reg->enc,
4701 (pprev ? pprev : str), p);
4702 if (prev && ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 1))
4706 else if (! ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, p, str, end, reg->options, 1))
4712 if (reg->dmax == 0) {
4716 *low_prev = onigenc_get_prev_char_head(reg->enc, s, p, end);
4718 *low_prev = onigenc_get_prev_char_head(reg->enc,
4719 (pprev ? pprev : str), p, end);
4724 if (reg->dmax != ONIG_INFINITE_DISTANCE) {
4725 if ((OnigDistance)(p - str) < reg->dmax) {
4726 *low = (UChar* )str;
4728 *low_prev = onigenc_get_prev_char_head(reg->enc, str, *low, end);
4731 *low = p - reg->dmax;
4733 *low = onigenc_get_right_adjust_char_head_with_prev(reg->enc, s,
4734 *low, end, (
const UChar** )low_prev);
4735 if (low_prev && IS_NULL(*low_prev))
4736 *low_prev = onigenc_get_prev_char_head(reg->enc, s, *low, end);
4740 *low_prev = onigenc_get_prev_char_head(reg->enc,
4741 (pprev ? pprev : str), *low, end);
4746 if ((OnigDistance)(p - str) < reg->dmin)
4747 *high = (UChar* )str;
4749 *high = p - reg->dmin;
4752#ifdef ONIG_DEBUG_SEARCH
4754 "forward_search_range success: low: %"PRIdPTR
", high: %"PRIdPTR
", dmin: %"PRIdPTR
", dmax: %"PRIdPTR
"\n",
4755 *low - str, *high - str, reg->dmin, reg->dmax);
4763#define BM_BACKWARD_SEARCH_LENGTH_THRESHOLD 100
4766backward_search_range(regex_t* reg,
const UChar* str,
const UChar* end,
4767 UChar* s,
const UChar* range, UChar* adjrange,
4768 UChar** low, UChar** high)
4771 size_t input_len = end - str;
4773 if (reg->dmin > input_len) {
4780 switch (reg->optimize) {
4781 case ONIG_OPTIMIZE_EXACT:
4783 p = slow_search_backward(reg->enc, reg->exact, reg->exact_end,
4784 range, adjrange, end, p);
4787 case ONIG_OPTIMIZE_EXACT_IC:
4788 case ONIG_OPTIMIZE_EXACT_BM_IC:
4789 case ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC:
4790 p = slow_search_backward_ic(reg->enc, reg->case_fold_flag,
4791 reg->exact, reg->exact_end,
4792 range, adjrange, end, p);
4795 case ONIG_OPTIMIZE_EXACT_BM:
4796 case ONIG_OPTIMIZE_EXACT_BM_NOT_REV:
4800 case ONIG_OPTIMIZE_MAP:
4801 p = map_search_backward(reg->enc, reg->map, range, adjrange, p, end);
4806 if (reg->sub_anchor) {
4809 switch (reg->sub_anchor) {
4810 case ANCHOR_BEGIN_LINE:
4811 if (!ON_STR_BEGIN(p)) {
4812 prev = onigenc_get_prev_char_head(reg->enc, str, p, end);
4813 if (!ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 0)) {
4820 case ANCHOR_END_LINE:
4821 if (ON_STR_END(p)) {
4822#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
4823 prev = onigenc_get_prev_char_head(reg->enc, adjrange, p);
4824 if (IS_NULL(prev))
goto fail;
4825 if (ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 1)) {
4831 else if (! ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, p, str, end, reg->options, 1)) {
4832 p = onigenc_get_prev_char_head(reg->enc, adjrange, p, end);
4833 if (IS_NULL(p))
goto fail;
4840 if (reg->dmax != ONIG_INFINITE_DISTANCE) {
4841 if ((OnigDistance)(p - str) < reg->dmax)
4842 *low = (UChar* )str;
4844 *low = p - reg->dmax;
4846 if (reg->dmin != 0) {
4847 if ((OnigDistance)(p - str) < reg->dmin)
4848 *high = (UChar* )str;
4850 *high = p - reg->dmin;
4856 *high = onigenc_get_right_adjust_char_head(reg->enc, adjrange, *high, end);
4859#ifdef ONIG_DEBUG_SEARCH
4860 fprintf(stderr,
"backward_search_range: low: %d, high: %d\n",
4861 (
int )(*low - str), (
int )(*high - str));
4867#ifdef ONIG_DEBUG_SEARCH
4868 fprintf(stderr,
"backward_search_range: fail.\n");
4875onig_search(regex_t* reg,
const UChar* str,
const UChar* end,
4876 const UChar* start,
const UChar* range, OnigRegion* region, OnigOptionType option)
4878 return onig_search_gpos(reg, str, end, start, start, range, region, option);
4882onig_search_gpos(regex_t* reg,
const UChar* str,
const UChar* end,
4883 const UChar* global_pos,
4884 const UChar* start,
const UChar* range, OnigRegion* region, OnigOptionType option)
4889#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
4890 const UChar *orig_start = start;
4891 const UChar *orig_range = range;
4894#ifdef ONIG_DEBUG_SEARCH
4896 "onig_search (entry point): str: %"PRIuPTR
" (%p), end: %"PRIuPTR
", start: %"PRIuPTR
", range: %"PRIuPTR
"\n",
4897 (uintptr_t )str, str, end - str, start - str, range - str);
4901 r = onig_region_resize_clear(region, reg->num_mem + 1);
4902 if (r)
goto finish_no_msa;
4905 if (start > end || start < str)
goto mismatch_no_msa;
4908#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
4909# ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
4910# define MATCH_AND_RETURN_CHECK(upper_range) \
4911 r = match_at(reg, str, end, (upper_range), s, prev, &msa); \
4913 case ONIG_MISMATCH: \
4915 case ONIGERR_TIMEOUT: \
4919 if (! IS_FIND_LONGEST(reg->options)) { \
4926# define MATCH_AND_RETURN_CHECK(upper_range) \
4927 r = match_at(reg, str, end, (upper_range), s, prev, &msa); \
4929 case ONIG_MISMATCH: \
4931 case ONIGERR_TIMEOUT: \
4941# ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
4942# define MATCH_AND_RETURN_CHECK(none) \
4943 r = match_at(reg, str, end, s, prev, &msa);\
4945 case ONIG_MISMATCH: \
4947 case ONIGERR_TIMEOUT: \
4951 if (! IS_FIND_LONGEST(reg->options)) { \
4958# define MATCH_AND_RETURN_CHECK(none) \
4959 r = match_at(reg, str, end, s, prev, &msa);\
4961 case ONIG_MISMATCH: \
4963 case ONIGERR_TIMEOUT: \
4976 if (reg->anchor != 0 && str < end) {
4977 UChar *min_semi_end, *max_semi_end;
4979 if (reg->anchor & ANCHOR_BEGIN_POSITION) {
4984 if (global_pos > start)
4986 if (global_pos < range)
4987 range = global_pos + 1;
4995 else if (reg->anchor & ANCHOR_BEGIN_BUF) {
4997 if (range > start) {
4998 if (start != str)
goto mismatch_no_msa;
5007 goto mismatch_no_msa;
5010 else if (reg->anchor & ANCHOR_END_BUF) {
5011 min_semi_end = max_semi_end = (UChar* )end;
5014 if ((OnigDistance)(max_semi_end - str) < reg->anchor_dmin)
5015 goto mismatch_no_msa;
5017 if (range > start) {
5018 if ((OnigDistance)(min_semi_end - start) > reg->anchor_dmax) {
5019 start = min_semi_end - reg->anchor_dmax;
5021 start = onigenc_get_right_adjust_char_head(reg->enc, str, start, end);
5023 if ((OnigDistance)(max_semi_end - (range - 1)) < reg->anchor_dmin) {
5024 if ((OnigDistance)(max_semi_end - str + 1) < reg->anchor_dmin)
5025 goto mismatch_no_msa;
5027 range = max_semi_end - reg->anchor_dmin + 1;
5028 if (start >= range)
goto mismatch_no_msa;
5031 if (start > range)
goto mismatch_no_msa;
5036 if ((OnigDistance)(min_semi_end - range) > reg->anchor_dmax) {
5037 range = min_semi_end - reg->anchor_dmax;
5039 if ((OnigDistance)(max_semi_end - start) < reg->anchor_dmin) {
5040 if ((OnigDistance)(max_semi_end - str) < reg->anchor_dmin)
5041 goto mismatch_no_msa;
5043 start = max_semi_end - reg->anchor_dmin;
5044 start = ONIGENC_LEFT_ADJUST_CHAR_HEAD(reg->enc, str, start, end);
5047 if (range > start)
goto mismatch_no_msa;
5050 else if (reg->anchor & ANCHOR_SEMI_END_BUF) {
5051 UChar* pre_end = ONIGENC_STEP_BACK(reg->enc, str, end, end, 1);
5053 max_semi_end = (UChar* )end;
5054 if (ONIGENC_IS_MBC_NEWLINE(reg->enc, pre_end, end)) {
5055 min_semi_end = pre_end;
5057#ifdef USE_CRNL_AS_LINE_TERMINATOR
5058 pre_end = ONIGENC_STEP_BACK(reg->enc, str, pre_end, end, 1);
5059 if (IS_NOT_NULL(pre_end) &&
5060 IS_NEWLINE_CRLF(reg->options) &&
5061 ONIGENC_IS_MBC_CRNL(reg->enc, pre_end, end)) {
5062 min_semi_end = pre_end;
5065 if (min_semi_end > str && start <= min_semi_end) {
5070 min_semi_end = (UChar* )end;
5074 else if ((reg->anchor & ANCHOR_ANYCHAR_STAR_ML) && range > start) {
5075 goto begin_position;
5078 else if (str == end) {
5079 static const UChar address_for_empty_string[] =
"";
5081#ifdef ONIG_DEBUG_SEARCH
5082 fprintf(stderr,
"onig_search: empty string.\n");
5085 if (reg->threshold_len == 0) {
5086 start = end = str = address_for_empty_string;
5088 prev = (UChar* )NULL;
5090 MATCH_ARG_INIT(msa, option, region, start, start);
5091#ifdef USE_COMBINATION_EXPLOSION_CHECK
5092 msa.state_check_buff = (
void* )0;
5093 msa.state_check_buff_size = 0;
5095 MATCH_AND_RETURN_CHECK(end);
5098 goto mismatch_no_msa;
5101#ifdef ONIG_DEBUG_SEARCH
5102 fprintf(stderr,
"onig_search(apply anchor): end: %d, start: %d, range: %d\n",
5103 (
int )(end - str), (
int )(start - str), (
int )(range - str));
5106 MATCH_ARG_INIT(msa, option, region, start, global_pos);
5107#ifdef USE_COMBINATION_EXPLOSION_CHECK
5109 ptrdiff_t offset = (MIN(start, range) - str);
5110 STATE_CHECK_BUFF_INIT(msa, end - str, offset, reg->num_comb_exp_check);
5115 if (range > start) {
5117 prev = onigenc_get_prev_char_head(reg->enc, str, s, end);
5119 prev = (UChar* )NULL;
5121 if (reg->optimize != ONIG_OPTIMIZE_NONE) {
5122 UChar *sch_range, *low, *high, *low_prev;
5124 if (reg->dmax != 0) {
5125 if (reg->dmax == ONIG_INFINITE_DISTANCE)
5126 sch_range = (UChar* )end;
5128 if ((OnigDistance)(end - range) < reg->dmax)
5129 sch_range = (UChar* )end;
5131 sch_range = (UChar* )range + reg->dmax;
5136 sch_range = (UChar* )range;
5138 if ((end - start) < reg->threshold_len)
5141 if (reg->dmax != ONIG_INFINITE_DISTANCE) {
5143 if (! forward_search_range(reg, str, end, s, sch_range,
5144 &low, &high, &low_prev))
goto mismatch;
5150 MATCH_AND_RETURN_CHECK(orig_range);
5152 s += enclen(reg->enc, s, end);
5154 }
while (s < range);
5158 if (! forward_search_range(reg, str, end, s, sch_range,
5159 &low, &high, (UChar** )NULL))
goto mismatch;
5161 if ((reg->anchor & ANCHOR_ANYCHAR_STAR) != 0) {
5163 MATCH_AND_RETURN_CHECK(orig_range);
5165 s += enclen(reg->enc, s, end);
5167 if ((reg->anchor & (ANCHOR_LOOK_BEHIND | ANCHOR_PREC_READ_NOT)) == 0) {
5168 while (!ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 0)
5171 s += enclen(reg->enc, s, end);
5174 }
while (s < range);
5181 MATCH_AND_RETURN_CHECK(orig_range);
5183 s += enclen(reg->enc, s, end);
5184 }
while (s < range);
5187 MATCH_AND_RETURN_CHECK(orig_range);
5191 if (reg->optimize != ONIG_OPTIMIZE_NONE) {
5192 UChar *low, *high, *adjrange, *sch_start;
5193 const UChar *min_range;
5196 adjrange = ONIGENC_LEFT_ADJUST_CHAR_HEAD(reg->enc, str, range, end);
5198 adjrange = (UChar* )end;
5200 if ((OnigDistance)(end - range) > reg->dmin)
5201 min_range = range + reg->dmin;
5205 if (reg->dmax != ONIG_INFINITE_DISTANCE &&
5206 end - range >= reg->threshold_len) {
5208 if ((OnigDistance)(end - s) > reg->dmax)
5209 sch_start = s + reg->dmax;
5211 sch_start = (UChar* )end;
5213 if (backward_search_range(reg, str, end, sch_start, min_range, adjrange,
5221 prev = onigenc_get_prev_char_head(reg->enc, str, s, end);
5222 MATCH_AND_RETURN_CHECK(orig_start);
5225 }
while (s >= range);
5229 if (end - range < reg->threshold_len)
goto mismatch;
5231 if (reg->dmax != 0) {
5232 if (reg->dmax == ONIG_INFINITE_DISTANCE)
5233 sch_start = (UChar* )end;
5235 if ((OnigDistance)(end - s) > reg->dmax) {
5236 sch_start = s + reg->dmax;
5237 sch_start = ONIGENC_LEFT_ADJUST_CHAR_HEAD(reg->enc,
5238 start, sch_start, end);
5240 sch_start = (UChar* )end;
5244 sch_start = (UChar* )s;
5246 if (backward_search_range(reg, str, end, sch_start, min_range, adjrange,
5247 &low, &high) <= 0)
goto mismatch;
5252 prev = onigenc_get_prev_char_head(reg->enc, str, s, end);
5253 MATCH_AND_RETURN_CHECK(orig_start);
5255 }
while (s >= range);
5259#ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
5260 if (IS_FIND_LONGEST(reg->options)) {
5261 if (msa.best_len >= 0) {
5270 MATCH_ARG_FREE(msa);
5274 if (IS_FIND_NOT_EMPTY(reg->options) && region) {
5275 onig_region_clear(region);
5279 if (r != ONIG_MISMATCH)
5280 fprintf(stderr,
"onig_search: error %"PRIdPTRDIFF
"\n", r);
5288 if (r != ONIG_MISMATCH)
5289 fprintf(stderr,
"onig_search: error %"PRIdPTRDIFF
"\n", r);
5294 MATCH_ARG_FREE(msa);
5298 MATCH_ARG_FREE(msa);
5299 return ONIGERR_TIMEOUT;
5303onig_scan(regex_t* reg,
const UChar* str,
const UChar* end,
5304 OnigRegion* region, OnigOptionType option,
5305 int (*scan_callback)(OnigPosition, OnigPosition, OnigRegion*,
void*),
5316 r = onig_search(reg, str, end, start, end, region, option);
5318 rs = scan_callback(n, r, region, callback_arg);
5323 if (region->end[0] == start - str) {
5324 if (start >= end)
break;
5325 start += enclen(reg->enc, start, end);
5328 start = str + region->end[0];
5333 else if (r == ONIG_MISMATCH) {
5345onig_get_encoding(
const regex_t* reg)
5350extern OnigOptionType
5351onig_get_options(
const regex_t* reg)
5353 return reg->options;
5356extern OnigCaseFoldType
5357onig_get_case_fold_flag(
const regex_t* reg)
5359 return reg->case_fold_flag;
5363onig_get_syntax(
const regex_t* reg)
5369onig_number_of_captures(
const regex_t* reg)
5371 return reg->num_mem;
5375onig_number_of_capture_histories(
const regex_t* reg)
5377#ifdef USE_CAPTURE_HISTORY
5381 for (i = 0; i <= ONIG_MAX_CAPTURE_HISTORY_GROUP; i++) {
5382 if (BIT_STATUS_AT(reg->capture_history, i) != 0)
5392onig_copy_encoding(OnigEncodingType *to, OnigEncoding from)
#define RB_GNUC_EXTENSION
This is expanded to nothing for non-GCC compilers.
#define xfree
Old name of ruby_xfree.
#define xrealloc
Old name of ruby_xrealloc.
#define xmalloc
Old name of ruby_xmalloc.
int len
Length of the buffer.