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->lookaround_nesting = lookaround_nesting;\
581 cache_opcodes->match_addr = NULL;\
582 cache_point += lookaround_nesting != 0 ? 2 : 1;\
593 case OP_EXACT1: p++;
break;
594 case OP_EXACT2: p += 2;
break;
595 case OP_EXACT3: p += 3;
break;
596 case OP_EXACT4: p += 4;
break;
597 case OP_EXACT5: p += 5;
break;
599 GET_LENGTH_INC(
len, p); p +=
len;
break;
600 case OP_EXACTMB2N1: p += 2;
break;
601 case OP_EXACTMB2N2: p += 4;
break;
602 case OP_EXACTMB2N3: p += 6;
break;
604 GET_LENGTH_INC(
len, p); p +=
len * 2;
break;
606 GET_LENGTH_INC(
len, p); p +=
len * 3;
break;
610 GET_LENGTH_INC(mb_len, p);
611 GET_LENGTH_INC(
len, p);
617 len = enclen(enc, p, pend); p +=
len;
break;
619 GET_LENGTH_INC(
len, p); p +=
len;
break;
623 p += SIZE_BITSET;
break;
625 case OP_CCLASS_MB_NOT:
626 GET_LENGTH_INC(
len, p); p +=
len;
break;
628 case OP_CCLASS_MIX_NOT:
630 GET_LENGTH_INC(
len, p);
637 case OP_ANYCHAR_STAR:
638 case OP_ANYCHAR_ML_STAR:
641 case OP_ANYCHAR_STAR_PEEK_NEXT:
642 case OP_ANYCHAR_ML_STAR_PEEK_NEXT:
650 case OP_NOT_WORD_BOUND:
656 case OP_NOT_ASCII_WORD:
657 case OP_ASCII_WORD_BOUND:
658 case OP_NOT_ASCII_WORD_BOUND:
659 case OP_ASCII_WORD_BEGIN:
660 case OP_ASCII_WORD_END:
667 case OP_SEMI_END_BUF:
668 case OP_BEGIN_POSITION:
675 case OP_BACKREF_MULTI:
676 case OP_BACKREF_MULTI_IC:
677 case OP_BACKREF_WITH_LEVEL:
678 goto unexpected_bytecode_error;
680 case OP_MEMORY_START:
681 case OP_MEMORY_START_PUSH:
682 case OP_MEMORY_END_PUSH:
683 case OP_MEMORY_END_PUSH_REC:
685 case OP_MEMORY_END_REC:
687 if (lookaround_nesting != 0) {
688 goto unexpected_bytecode_error;
706 case OP_PUSH_OR_JUMP_EXACT1:
707 case OP_PUSH_IF_PEEK_NEXT:
708 p += SIZE_RELADDR + 1;
713 GET_MEMNUM_INC(repeat_mem, p);
715 if (reg->repeat_range[repeat_mem].lower == 0 && reg->repeat_range[repeat_mem].upper == 0) {
716 long dummy_num_cache_points = 0;
718 result = init_cache_opcodes_inner(reg, repeat_mem, lookaround_nesting, &dummy_cache_opcodes, &p, &dummy_num_cache_points);
723 if (reg->repeat_range[repeat_mem].lower == 0) {
727 long num_cache_points_in_repeat = 0;
728 long num_cache_points_at_repeat = cache_point;
730 result = init_cache_opcodes_inner(reg, repeat_mem, lookaround_nesting, &cache_opcodes, &p, &num_cache_points_in_repeat);
735 if (repeat_range->lower < repeat_range->upper) {
737 cache_point -= lookaround_nesting != 0 ? 2 : 1;
739 int repeat_bounds = repeat_range->upper == 0x7fffffff ? 1 : repeat_range->upper - repeat_range->lower;
740 cache_point += num_cache_points_in_repeat * repeat_range->lower + (num_cache_points_in_repeat + (lookaround_nesting != 0 ? 2 : 1)) * repeat_bounds;
741 for (; cache_opcodes_in_repeat < cache_opcodes; cache_opcodes_in_repeat++) {
742 cache_opcodes_in_repeat->num_cache_points_at_outer_repeat = num_cache_points_at_repeat;
743 cache_opcodes_in_repeat->num_cache_points_in_outer_repeat = num_cache_points_in_repeat;
749 case OP_REPEAT_INC_NG:
752 case OP_REPEAT_INC_SG:
753 case OP_REPEAT_INC_NG_SG:
754 goto unexpected_bytecode_error;
755 case OP_NULL_CHECK_START:
758 case OP_NULL_CHECK_END:
759 case OP_NULL_CHECK_END_MEMST_PUSH:
762 case OP_NULL_CHECK_END_MEMST:
770 result = init_cache_opcodes_inner(reg, current_repeat_mem, lookaround_nesting + 1, &cache_opcodes, &p, &cache_point);
774 UChar* match_addr = p - 1;
775 for (; cache_opcodes_in_lookaround < cache_opcodes; cache_opcodes_in_lookaround++) {
776 if (cache_opcodes_in_lookaround->match_addr == NULL) {
777 cache_opcodes_in_lookaround->match_addr = match_addr;
782 case OP_PUSH_POS_NOT:
785 case OP_PUSH_LOOK_BEHIND_NOT:
789 case OP_PUSH_STOP_BT:
792 result = init_cache_opcodes_inner(reg, current_repeat_mem, -1, &cache_opcodes, &p, &cache_point);
796 UChar* match_addr = p - 1;
797 for (; cache_opcodes_in_atomic < cache_opcodes; cache_opcodes_in_atomic++) {
798 if (cache_opcodes_in_atomic->match_addr == NULL) {
799 cache_opcodes_in_atomic->match_addr = match_addr;
806 case OP_FAIL_LOOK_BEHIND_NOT:
815 goto unexpected_bytecode_error;
819 goto unexpected_bytecode_error;
822 goto unexpected_bytecode_error;
824 case OP_STATE_CHECK_PUSH:
825 case OP_STATE_CHECK_PUSH_OR_JUMP:
827 case OP_STATE_CHECK_ANYCHAR_STAR:
828 case OP_STATE_CHECK_ANYCHAR_ML_STAR:
829 goto unexpected_bytecode_error;
831 case OP_SET_OPTION_PUSH:
842 *cache_opcodes_ptr = cache_opcodes;
844 *num_cache_points_ptr = cache_point;
850unexpected_bytecode_error:
851 return ONIGERR_UNEXPECTED_BYTECODE;
854 return ONIGERR_UNDEFINED_BYTECODE;
859init_cache_opcodes(
const regex_t* reg,
OnigCacheOpcode* cache_opcodes_ptr,
long* num_cache_points_ptr)
862 *num_cache_points_ptr = 0;
863 OnigPosition result = init_cache_opcodes_inner(reg, -1, 0, &cache_opcodes_ptr, &p, num_cache_points_ptr);
864 if (result == 0 && p != reg->p + reg->used) {
865 return ONIGERR_UNDEFINED_BYTECODE;
872count_num_cache_opcodes(regex_t* reg,
long* num_cache_opcodes)
874 *num_cache_opcodes = NUM_CACHE_OPCODES_IMPOSSIBLE;
880onig_check_linear_time(OnigRegexType* reg)
882 long num_cache_opcodes = 0;
883 count_num_cache_opcodes(reg, &num_cache_opcodes);
884 return num_cache_opcodes != NUM_CACHE_OPCODES_IMPOSSIBLE;
888onig_region_clear(OnigRegion* region)
892 for (i = 0; i < region->num_regs; i++) {
893 region->beg[i] = region->end[i] = ONIG_REGION_NOTPOS;
895#ifdef USE_CAPTURE_HISTORY
896 history_root_free(region);
901onig_region_resize(OnigRegion* region,
int n)
905 if (n < ONIG_NREGION)
908 if (region->allocated == 0) {
909 region->beg = (OnigPosition* )
xmalloc(n *
sizeof(OnigPosition));
910 region->end = (OnigPosition* )
xmalloc(n *
sizeof(OnigPosition));
911 if (region->beg == 0 || region->end == 0)
914 region->allocated = n;
916 else if (region->allocated < n) {
919 tmp = (OnigPosition* )
xrealloc(region->beg, n *
sizeof(OnigPosition));
923 tmp = (OnigPosition* )
xrealloc(region->end, n *
sizeof(OnigPosition));
928 region->allocated = n;
931 region->num_regs = num_regs;
939 region->allocated = 0;
940 region->num_regs = 0;
941 return ONIGERR_MEMORY;
945onig_region_resize_clear(OnigRegion* region,
int n)
949 r = onig_region_resize(region, n);
950 if (r != 0)
return r;
951 onig_region_clear(region);
956onig_region_set(OnigRegion* region,
int at,
int beg,
int end)
958 if (at < 0)
return ONIGERR_INVALID_ARGUMENT;
960 if (at >= region->allocated) {
961 int r = onig_region_resize(region, at + 1);
965 region->beg[at] = beg;
966 region->end[at] = end;
971onig_region_init(OnigRegion* region)
973 region->num_regs = 0;
974 region->allocated = 0;
975 region->beg = (OnigPosition* )0;
976 region->end = (OnigPosition* )0;
977#ifdef USE_CAPTURE_HISTORY
978 region->history_root = (OnigCaptureTreeNode* )0;
987 r = (OnigRegion* )
xmalloc(
sizeof(OnigRegion));
994onig_region_free(OnigRegion* r,
int free_self)
997 if (r->allocated > 0) {
1001#ifdef USE_CAPTURE_HISTORY
1002 history_root_free(r);
1008 memset(r, 0,
sizeof(OnigRegion));
1014onig_region_copy(OnigRegion* to,
const OnigRegion* from)
1016#define RREGC_SIZE (sizeof(int) * from->num_regs)
1019 if (to == from)
return;
1021 r = onig_region_resize(to, from->num_regs);
1024 for (i = 0; i < from->num_regs; i++) {
1025 to->beg[i] = from->beg[i];
1026 to->end[i] = from->end[i];
1028 to->num_regs = from->num_regs;
1030#ifdef USE_CAPTURE_HISTORY
1031 history_root_free(to);
1033 if (IS_NOT_NULL(from->history_root)) {
1034 to->history_root = history_tree_clone(from->history_root);
1041#define INVALID_STACK_INDEX -1
1045#define STK_ALT 0x0001
1046#define STK_LOOK_BEHIND_NOT 0x0002
1047#define STK_POS_NOT 0x0003
1049#define STK_MEM_START 0x0100
1050#define STK_MEM_END 0x8200
1051#define STK_REPEAT_INC 0x0300
1052#define STK_STATE_CHECK_MARK 0x1000
1054#define STK_NULL_CHECK_START 0x3000
1055#define STK_NULL_CHECK_END 0x5000
1056#define STK_MEM_END_MARK 0x8400
1057#define STK_POS 0x0500
1058#define STK_STOP_BT 0x0600
1059#define STK_REPEAT 0x0700
1060#define STK_CALL_FRAME 0x0800
1061#define STK_RETURN 0x0900
1062#define STK_VOID 0x0a00
1063#define STK_ABSENT_POS 0x0b00
1064#define STK_ABSENT 0x0c00
1065#define STK_MATCH_CACHE_POINT 0x0d00
1066#define STK_ATOMIC_MATCH_CACHE_POINT 0x0e00
1069#define STK_MASK_POP_USED 0x00ff
1070#define STK_MASK_TO_VOID_TARGET 0x10ff
1071#define STK_MASK_MEM_END_OR_MARK 0x8000
1073#ifdef USE_MATCH_CACHE
1074#define MATCH_ARG_INIT_MATCH_CACHE(msa) do {\
1075 (msa).match_cache_status = MATCH_CACHE_STATUS_UNINIT;\
1076 (msa).num_fails = 0;\
1077 (msa).num_cache_opcodes = NUM_CACHE_OPCODES_UNINIT;\
1078 (msa).cache_opcodes = (OnigCacheOpcode*)NULL;\
1079 (msa).num_cache_points = 0;\
1080 (msa).match_cache_buf = (uint8_t*)NULL;\
1082#define MATCH_ARG_FREE_MATCH_CACHE(msa) do {\
1083 xfree((msa).cache_opcodes);\
1084 xfree((msa).match_cache_buf);\
1085 (msa).cache_opcodes = (OnigCacheOpcode*)NULL;\
1086 (msa).match_cache_buf = (uint8_t*)NULL;\
1089#define MATCH_ARG_INIT_MATCH_CACHE(msa)
1090#define MATCH_ARG_FREE_MATCH_CACHE(msa)
1093#ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
1094# define MATCH_ARG_INIT(msa, arg_option, arg_region, arg_start, arg_gpos) do {\
1095 (msa).stack_p = (void* )0;\
1096 (msa).options = (arg_option);\
1097 (msa).region = (arg_region);\
1098 (msa).start = (arg_start);\
1099 (msa).gpos = (arg_gpos);\
1100 (msa).best_len = ONIG_MISMATCH;\
1102 (msa).end_time = 0;\
1103 MATCH_ARG_INIT_MATCH_CACHE(msa);\
1106# define MATCH_ARG_INIT(msa, arg_option, arg_region, arg_start, arg_gpos) do {\
1107 (msa).stack_p = (void* )0;\
1108 (msa).options = (arg_option);\
1109 (msa).region = (arg_region);\
1110 (msa).start = (arg_start);\
1111 (msa).gpos = (arg_gpos);\
1113 (msa).end_time = 0;\
1114 MATCH_ARG_INIT_MATCH_CACHE(msa);\
1118#ifdef USE_COMBINATION_EXPLOSION_CHECK
1120# define STATE_CHECK_BUFF_MALLOC_THRESHOLD_SIZE 16
1122# define STATE_CHECK_BUFF_INIT(msa, str_len, offset, state_num) do { \
1123 if ((state_num) > 0 && str_len >= STATE_CHECK_STRING_THRESHOLD_LEN) {\
1124 unsigned int size = (unsigned int )(((str_len) + 1) * (state_num) + 7) >> 3;\
1125 offset = ((offset) * (state_num)) >> 3;\
1126 if (size > 0 && offset < size && size < STATE_CHECK_BUFF_MAX_SIZE) {\
1127 if (size >= STATE_CHECK_BUFF_MALLOC_THRESHOLD_SIZE) {\
1128 (msa).state_check_buff = (void* )xmalloc(size);\
1129 CHECK_NULL_RETURN_MEMERR((msa).state_check_buff);\
1132 (msa).state_check_buff = (void* )xalloca(size);\
1133 xmemset(((char* )((msa).state_check_buff)+(offset)), 0, \
1134 (size_t )(size - (offset))); \
1135 (msa).state_check_buff_size = size;\
1138 (msa).state_check_buff = (void* )0;\
1139 (msa).state_check_buff_size = 0;\
1143 (msa).state_check_buff = (void* )0;\
1144 (msa).state_check_buff_size = 0;\
1148# define MATCH_ARG_FREE(msa) do {\
1149 xfree((msa).stack_p);\
1150 if ((msa).state_check_buff_size >= STATE_CHECK_BUFF_MALLOC_THRESHOLD_SIZE) { \
1151 xfree((msa).state_check_buff);\
1153 MATCH_ARG_FREE_MATCH_CACHE(msa);\
1156# define MATCH_ARG_FREE(msa) do {\
1157 xfree((msa).stack_p);\
1158 MATCH_ARG_FREE_MATCH_CACHE(msa);\
1164#define MAX_PTR_NUM 100
1166#define STACK_INIT(alloc_addr, heap_addr, ptr_num, stack_num) do {\
1167 if (ptr_num > MAX_PTR_NUM) {\
1168 alloc_addr = (char* )xmalloc(sizeof(OnigStackIndex) * (ptr_num));\
1169 heap_addr = alloc_addr;\
1170 if (msa->stack_p) {\
1171 stk_alloc = (OnigStackType* )(msa->stack_p);\
1172 stk_base = stk_alloc;\
1174 stk_end = stk_base + msa->stack_n;\
1177 stk_alloc = (OnigStackType* )xalloca(sizeof(OnigStackType) * (stack_num));\
1178 stk_base = stk_alloc;\
1180 stk_end = stk_base + (stack_num);\
1183 else if (msa->stack_p) {\
1184 alloc_addr = (char* )xalloca(sizeof(OnigStackIndex) * (ptr_num));\
1186 stk_alloc = (OnigStackType* )(msa->stack_p);\
1187 stk_base = stk_alloc;\
1189 stk_end = stk_base + msa->stack_n;\
1192 alloc_addr = (char* )xalloca(sizeof(OnigStackIndex) * (ptr_num)\
1193 + sizeof(OnigStackType) * (stack_num));\
1195 stk_alloc = (OnigStackType* )(alloc_addr + sizeof(OnigStackIndex) * (ptr_num));\
1196 stk_base = stk_alloc;\
1198 stk_end = stk_base + (stack_num);\
1202#define STACK_SAVE do{\
1203 if (stk_base != stk_alloc) {\
1204 msa->stack_p = stk_base;\
1205 msa->stack_n = stk_end - stk_base; \
1209static unsigned int MatchStackLimitSize = DEFAULT_MATCH_STACK_LIMIT_SIZE;
1212onig_get_match_stack_limit_size(
void)
1214 return MatchStackLimitSize;
1218onig_set_match_stack_limit_size(
unsigned int size)
1220 MatchStackLimitSize = size;
1225stack_double(OnigStackType** arg_stk_base, OnigStackType** arg_stk_end,
1226 OnigStackType** arg_stk, OnigStackType* stk_alloc,
OnigMatchArg* msa)
1229 OnigStackType *x, *stk_base, *stk_end, *stk;
1231 stk_base = *arg_stk_base;
1232 stk_end = *arg_stk_end;
1235 n = stk_end - stk_base;
1236 if (stk_base == stk_alloc && IS_NULL(msa->stack_p)) {
1237 x = (OnigStackType* )
xmalloc(
sizeof(OnigStackType) * n * 2);
1240 return ONIGERR_MEMORY;
1242 xmemcpy(x, stk_base, n *
sizeof(OnigStackType));
1246 unsigned int limit_size = MatchStackLimitSize;
1248 if (limit_size != 0 && n > limit_size) {
1249 if ((
unsigned int )(stk_end - stk_base) == limit_size)
1250 return ONIGERR_MATCH_STACK_LIMIT_OVER;
1254 x = (OnigStackType* )
xrealloc(stk_base,
sizeof(OnigStackType) * n);
1257 return ONIGERR_MEMORY;
1260 *arg_stk = x + (stk - stk_base);
1262 *arg_stk_end = x + n;
1266#define STACK_ENSURE(n) do {\
1267 if (stk_end - stk < (n)) {\
1268 int r = stack_double(&stk_base, &stk_end, &stk, stk_alloc, msa);\
1271 xfree(xmalloc_base);\
1277#define STACK_AT(index) (stk_base + (index))
1278#define GET_STACK_INDEX(stk) ((stk) - stk_base)
1280#define STACK_PUSH_TYPE(stack_type) do {\
1282 stk->type = (stack_type);\
1283 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1287#define IS_TO_VOID_TARGET(stk) (((stk)->type & STK_MASK_TO_VOID_TARGET) != 0)
1289#ifdef USE_COMBINATION_EXPLOSION_CHECK
1290# define STATE_CHECK_POS(s,snum) \
1291 (((s) - str) * num_comb_exp_check + ((snum) - 1))
1292# define STATE_CHECK_VAL(v,snum) do {\
1293 if (state_check_buff != NULL) {\
1294 ptrdiff_t x = STATE_CHECK_POS(s,snum);\
1295 (v) = state_check_buff[x/8] & (1<<(x%8));\
1301# define ELSE_IF_STATE_CHECK_MARK(stk) \
1302 else if ((stk)->type == STK_STATE_CHECK_MARK) { \
1303 ptrdiff_t x = STATE_CHECK_POS(stk->u.state.pstr, stk->u.state.state_check);\
1304 state_check_buff[x/8] |= (1<<(x%8)); \
1307# define STACK_PUSH(stack_type,pat,s,sprev,keep) do {\
1309 stk->type = (stack_type);\
1310 stk->u.state.pcode = (pat);\
1311 stk->u.state.pstr = (s);\
1312 stk->u.state.pstr_prev = (sprev);\
1313 stk->u.state.state_check = 0;\
1314 stk->u.state.pkeep = (keep);\
1318# define STACK_PUSH_ENSURED(stack_type,pat) do {\
1319 stk->type = (stack_type);\
1320 stk->u.state.pcode = (pat);\
1321 stk->u.state.state_check = 0;\
1325# define STACK_PUSH_ALT_WITH_STATE_CHECK(pat,s,sprev,snum,keep) do {\
1327 stk->type = STK_ALT;\
1328 stk->u.state.pcode = (pat);\
1329 stk->u.state.pstr = (s);\
1330 stk->u.state.pstr_prev = (sprev);\
1331 stk->u.state.state_check = ((state_check_buff != NULL) ? (snum) : 0);\
1332 stk->u.state.pkeep = (keep);\
1336# define STACK_PUSH_STATE_CHECK(s,snum) do {\
1337 if (state_check_buff != NULL) {\
1339 stk->type = STK_STATE_CHECK_MARK;\
1340 stk->u.state.pstr = (s);\
1341 stk->u.state.state_check = (snum);\
1348# define ELSE_IF_STATE_CHECK_MARK(stk)
1350# define STACK_PUSH(stack_type,pat,s,sprev,keep) do {\
1352 stk->type = (stack_type);\
1353 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1354 stk->u.state.pcode = (pat);\
1355 stk->u.state.pstr = (s);\
1356 stk->u.state.pstr_prev = (sprev);\
1357 stk->u.state.pkeep = (keep);\
1361# define STACK_PUSH_ENSURED(stack_type,pat) do {\
1362 stk->type = (stack_type);\
1363 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1364 stk->u.state.pcode = (pat);\
1369#define STACK_PUSH_ALT(pat,s,sprev,keep) STACK_PUSH(STK_ALT,pat,s,sprev,keep)
1370#define STACK_PUSH_POS(s,sprev,keep) STACK_PUSH(STK_POS,NULL_UCHARP,s,sprev,keep)
1371#define STACK_PUSH_POS_NOT(pat,s,sprev,keep) STACK_PUSH(STK_POS_NOT,pat,s,sprev,keep)
1372#define STACK_PUSH_ABSENT STACK_PUSH_TYPE(STK_ABSENT)
1373#define STACK_PUSH_STOP_BT STACK_PUSH_TYPE(STK_STOP_BT)
1374#define STACK_PUSH_LOOK_BEHIND_NOT(pat,s,sprev,keep) \
1375 STACK_PUSH(STK_LOOK_BEHIND_NOT,pat,s,sprev,keep)
1377#define STACK_PUSH_REPEAT(id, pat) do {\
1379 stk->type = STK_REPEAT;\
1380 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1381 stk->u.repeat.num = (id);\
1382 stk->u.repeat.pcode = (pat);\
1383 stk->u.repeat.count = 0;\
1387#define STACK_PUSH_REPEAT_INC(sindex) do {\
1389 stk->type = STK_REPEAT_INC;\
1390 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1391 stk->u.repeat_inc.si = (sindex);\
1395#define STACK_PUSH_MEM_START(mnum, s) do {\
1397 stk->type = STK_MEM_START;\
1398 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1399 stk->u.mem.num = (mnum);\
1400 stk->u.mem.pstr = (s);\
1401 stk->u.mem.start = mem_start_stk[mnum];\
1402 stk->u.mem.end = mem_end_stk[mnum];\
1403 mem_start_stk[mnum] = GET_STACK_INDEX(stk);\
1404 mem_end_stk[mnum] = INVALID_STACK_INDEX;\
1408#define STACK_PUSH_MEM_END(mnum, s) do {\
1410 stk->type = STK_MEM_END;\
1411 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1412 stk->u.mem.num = (mnum);\
1413 stk->u.mem.pstr = (s);\
1414 stk->u.mem.start = mem_start_stk[mnum];\
1415 stk->u.mem.end = mem_end_stk[mnum];\
1416 mem_end_stk[mnum] = GET_STACK_INDEX(stk);\
1420#define STACK_PUSH_MEM_END_MARK(mnum) do {\
1422 stk->type = STK_MEM_END_MARK;\
1423 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1424 stk->u.mem.num = (mnum);\
1428#define STACK_GET_MEM_START(mnum, k) do {\
1431 while (k > stk_base) {\
1433 if ((k->type & STK_MASK_MEM_END_OR_MARK) != 0 \
1434 && k->u.mem.num == (mnum)) {\
1437 else if (k->type == STK_MEM_START && k->u.mem.num == (mnum)) {\
1438 if (level == 0) break;\
1444#define STACK_GET_MEM_RANGE(k, mnum, start, end) do {\
1447 if (k->type == STK_MEM_START && k->u.mem.num == (mnum)) {\
1448 if (level == 0) (start) = k->u.mem.pstr;\
1451 else if (k->type == STK_MEM_END && k->u.mem.num == (mnum)) {\
1454 (end) = k->u.mem.pstr;\
1462#define STACK_PUSH_NULL_CHECK_START(cnum, s) do {\
1464 stk->type = STK_NULL_CHECK_START;\
1465 stk->null_check = (OnigStackIndex)(stk - stk_base);\
1466 stk->u.null_check.num = (cnum);\
1467 stk->u.null_check.pstr = (s);\
1471#define STACK_PUSH_NULL_CHECK_END(cnum) do {\
1473 stk->type = STK_NULL_CHECK_END;\
1474 stk->null_check = (OnigStackIndex)(stk - stk_base);\
1475 stk->u.null_check.num = (cnum);\
1479#define STACK_PUSH_CALL_FRAME(pat) do {\
1481 stk->type = STK_CALL_FRAME;\
1482 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1483 stk->u.call_frame.ret_addr = (pat);\
1487#define STACK_PUSH_RETURN do {\
1489 stk->type = STK_RETURN;\
1490 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1494#define STACK_PUSH_ABSENT_POS(start, end) do {\
1496 stk->type = STK_ABSENT_POS;\
1497 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1498 stk->u.absent_pos.abs_pstr = (start);\
1499 stk->u.absent_pos.end_pstr = (end);\
1503#define STACK_PUSH_MATCH_CACHE_POINT(match_cache_point_index, match_cache_point_mask) do {\
1505 stk->type = STK_MATCH_CACHE_POINT;\
1506 stk->null_check = stk == stk_base ? 0 : (stk-1)->null_check;\
1507 stk->u.match_cache_point.index = (match_cache_point_index);\
1508 stk->u.match_cache_point.mask = (match_cache_point_mask);\
1514# define STACK_BASE_CHECK(p, at) \
1515 if ((p) < stk_base) {\
1516 fprintf(stderr, "at %s\n", at);\
1520# define STACK_BASE_CHECK(p, at)
1523#ifdef ONIG_DEBUG_MATCH_CACHE
1524# 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);
1526# define MATCH_CACHE_DEBUG_MEMOIZE(stkp) ((void) 0)
1529#ifdef USE_MATCH_CACHE
1530# define INC_NUM_FAILS msa->num_fails++
1531# define MEMOIZE_MATCH_CACHE_POINT do {\
1532 if (stk->type == STK_MATCH_CACHE_POINT) {\
1533 msa->match_cache_buf[stk->u.match_cache_point.index] |= stk->u.match_cache_point.mask;\
1534 MATCH_CACHE_DEBUG_MEMOIZE(stk);\
1536 else if (stk->type == STK_ATOMIC_MATCH_CACHE_POINT) {\
1537 memoize_extended_match_cache_point(msa->match_cache_buf, stk->u.match_cache_point.index, stk->u.match_cache_point.mask);\
1538 MATCH_CACHE_DEBUG_MEMOIZE(stkp);\
1541# define MEMOIZE_LOOKAROUND_MATCH_CACHE_POINT(stkp) do {\
1542 if (stkp->type == STK_MATCH_CACHE_POINT) {\
1543 stkp->type = STK_VOID;\
1544 memoize_extended_match_cache_point(msa->match_cache_buf, stkp->u.match_cache_point.index, stkp->u.match_cache_point.mask);\
1545 MATCH_CACHE_DEBUG_MEMOIZE(stkp);\
1548# define MEMOIZE_ATOMIC_MATCH_CACHE_POINT do {\
1549 if (stk->type == STK_MATCH_CACHE_POINT) {\
1550 memoize_extended_match_cache_point(msa->match_cache_buf, stk->u.match_cache_point.index, stk->u.match_cache_point.mask);\
1551 MATCH_CACHE_DEBUG_MEMOIZE(stkp);\
1555# define INC_NUM_FAILS ((void) 0)
1556# define MEMOIZE_MATCH_CACHE_POINT ((void) 0)
1557# define MEMOIZE_LOOKAROUND_MATCH_CACHE_POINT(stkp) ((void) 0)
1560#define STACK_POP_ONE do {\
1562 STACK_BASE_CHECK(stk, "STACK_POP_ONE"); \
1565#define STACK_POP do {\
1566 switch (pop_level) {\
1567 case STACK_POP_LEVEL_FREE:\
1570 STACK_BASE_CHECK(stk, "STACK_POP"); \
1571 if ((stk->type & STK_MASK_POP_USED) != 0) break;\
1572 ELSE_IF_STATE_CHECK_MARK(stk);\
1573 MEMOIZE_MATCH_CACHE_POINT;\
1576 case STACK_POP_LEVEL_MEM_START:\
1579 STACK_BASE_CHECK(stk, "STACK_POP 2"); \
1580 if ((stk->type & STK_MASK_POP_USED) != 0) break;\
1581 else if (stk->type == STK_MEM_START) {\
1582 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1583 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1585 ELSE_IF_STATE_CHECK_MARK(stk);\
1586 MEMOIZE_MATCH_CACHE_POINT;\
1592 STACK_BASE_CHECK(stk, "STACK_POP 3"); \
1593 if ((stk->type & STK_MASK_POP_USED) != 0) break;\
1594 else if (stk->type == STK_MEM_START) {\
1595 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1596 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1598 else if (stk->type == STK_REPEAT_INC) {\
1599 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
1601 else if (stk->type == STK_MEM_END) {\
1602 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1603 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1605 ELSE_IF_STATE_CHECK_MARK(stk);\
1606 MEMOIZE_MATCH_CACHE_POINT;\
1612#define STACK_POP_TIL_POS_NOT do {\
1615 STACK_BASE_CHECK(stk, "STACK_POP_TIL_POS_NOT"); \
1616 if (stk->type == STK_POS_NOT) break;\
1617 else if (stk->type == STK_MEM_START) {\
1618 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1619 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1621 else if (stk->type == STK_REPEAT_INC) {\
1622 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
1624 else if (stk->type == STK_MEM_END) {\
1625 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1626 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1628 else if (IS_TO_VOID_TARGET(stk)) {\
1631 ELSE_IF_STATE_CHECK_MARK(stk);\
1632 MEMOIZE_LOOKAROUND_MATCH_CACHE_POINT(stk);\
1636#define STACK_POP_TIL_LOOK_BEHIND_NOT do {\
1639 STACK_BASE_CHECK(stk, "STACK_POP_TIL_LOOK_BEHIND_NOT"); \
1640 if (stk->type == STK_LOOK_BEHIND_NOT) break;\
1641 else if (stk->type == STK_MEM_START) {\
1642 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1643 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1645 else if (stk->type == STK_REPEAT_INC) {\
1646 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
1648 else if (stk->type == STK_MEM_END) {\
1649 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1650 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1652 ELSE_IF_STATE_CHECK_MARK(stk);\
1656#define STACK_POP_TIL_ABSENT do {\
1659 STACK_BASE_CHECK(stk, "STACK_POP_TIL_ABSENT"); \
1660 if (stk->type == STK_ABSENT) break;\
1661 else if (stk->type == STK_MEM_START) {\
1662 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1663 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1665 else if (stk->type == STK_REPEAT_INC) {\
1666 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
1668 else if (stk->type == STK_MEM_END) {\
1669 mem_start_stk[stk->u.mem.num] = stk->u.mem.start;\
1670 mem_end_stk[stk->u.mem.num] = stk->u.mem.end;\
1672 ELSE_IF_STATE_CHECK_MARK(stk);\
1676#define STACK_POP_ABSENT_POS(start, end) do {\
1678 STACK_BASE_CHECK(stk, "STACK_POP_ABSENT_POS"); \
1679 (start) = stk->u.absent_pos.abs_pstr;\
1680 (end) = stk->u.absent_pos.end_pstr;\
1683#define STACK_POS_END(k) do {\
1687 STACK_BASE_CHECK(k, "STACK_POS_END"); \
1688 if (IS_TO_VOID_TARGET(k)) {\
1690 k->type = STK_VOID;\
1692 else if (k->type == STK_POS) {\
1693 k->type = STK_VOID;\
1696 MEMOIZE_LOOKAROUND_MATCH_CACHE_POINT(k);\
1700#define STACK_STOP_BT_END do {\
1701 OnigStackType *k = stk;\
1704 STACK_BASE_CHECK(k, "STACK_STOP_BT_END"); \
1705 if (IS_TO_VOID_TARGET(k)) {\
1707 k->type = STK_VOID;\
1709 else if (k->type == STK_STOP_BT) {\
1710 k->type = STK_VOID;\
1713 else if (k->type == STK_MATCH_CACHE_POINT) {\
1714 k->type = STK_ATOMIC_MATCH_CACHE_POINT;\
1719#define STACK_STOP_BT_FAIL do {\
1722 STACK_BASE_CHECK(stk, "STACK_STOP_BT_END"); \
1723 if (stk->type == STK_STOP_BT) {\
1724 stk->type = STK_VOID;\
1727 MEMOIZE_ATOMIC_MATCH_CACHE_POINT;\
1731#define STACK_NULL_CHECK(isnull,id,s) do {\
1732 OnigStackType* k = STACK_AT((stk-1)->null_check)+1;\
1735 STACK_BASE_CHECK(k, "STACK_NULL_CHECK"); \
1736 if (k->type == STK_NULL_CHECK_START) {\
1737 if (k->u.null_check.num == (id)) {\
1738 (isnull) = (k->u.null_check.pstr == (s));\
1745#define STACK_NULL_CHECK_REC(isnull,id,s) do {\
1747 OnigStackType* k = STACK_AT((stk-1)->null_check)+1;\
1750 STACK_BASE_CHECK(k, "STACK_NULL_CHECK_REC"); \
1751 if (k->type == STK_NULL_CHECK_START) {\
1752 if (k->u.null_check.num == (id)) {\
1754 (isnull) = (k->u.null_check.pstr == (s));\
1760 else if (k->type == STK_NULL_CHECK_END) {\
1766#define STACK_NULL_CHECK_MEMST(isnull,id,s,reg) do {\
1767 OnigStackType* k = STACK_AT((stk-1)->null_check)+1;\
1770 STACK_BASE_CHECK(k, "STACK_NULL_CHECK_MEMST"); \
1771 if (k->type == STK_NULL_CHECK_START) {\
1772 if (k->u.null_check.num == (id)) {\
1773 if (k->u.null_check.pstr != (s)) {\
1781 if (k->type == STK_MEM_START) {\
1782 if (k->u.mem.end == INVALID_STACK_INDEX) {\
1783 (isnull) = 0; break;\
1785 if (BIT_STATUS_AT(reg->bt_mem_end, k->u.mem.num))\
1786 endp = STACK_AT(k->u.mem.end)->u.mem.pstr;\
1788 endp = (UChar* )k->u.mem.end;\
1789 if (STACK_AT(k->u.mem.start)->u.mem.pstr != endp) {\
1790 (isnull) = 0; break;\
1792 else if (endp != s) {\
1805#define STACK_NULL_CHECK_MEMST_REC(isnull,id,s,reg) do {\
1807 OnigStackType* k = STACK_AT((stk-1)->null_check)+1;\
1810 STACK_BASE_CHECK(k, "STACK_NULL_CHECK_MEMST_REC"); \
1811 if (k->type == STK_NULL_CHECK_START) {\
1812 if (k->u.null_check.num == (id)) {\
1814 if (k->u.null_check.pstr != (s)) {\
1822 if (k->type == STK_MEM_START) {\
1823 if (k->u.mem.end == INVALID_STACK_INDEX) {\
1824 (isnull) = 0; break;\
1826 if (BIT_STATUS_AT(reg->bt_mem_end, k->u.mem.num))\
1827 endp = STACK_AT(k->u.mem.end)->u.mem.pstr;\
1829 endp = (UChar* )k->u.mem.end;\
1830 if (STACK_AT(k->u.mem.start)->u.mem.pstr != endp) {\
1831 (isnull) = 0; break;\
1833 else if (endp != s) {\
1847 else if (k->type == STK_NULL_CHECK_END) {\
1848 if (k->u.null_check.num == (id)) level++;\
1853#define STACK_GET_REPEAT(id, k) do {\
1858 STACK_BASE_CHECK(k, "STACK_GET_REPEAT"); \
1859 if (k->type == STK_REPEAT) {\
1861 if (k->u.repeat.num == (id)) {\
1866 else if (k->type == STK_CALL_FRAME) level--;\
1867 else if (k->type == STK_RETURN) level++;\
1871#define STACK_RETURN(addr) do {\
1873 OnigStackType* k = stk;\
1876 STACK_BASE_CHECK(k, "STACK_RETURN"); \
1877 if (k->type == STK_CALL_FRAME) {\
1879 (addr) = k->u.call_frame.ret_addr;\
1884 else if (k->type == STK_RETURN)\
1890#define STRING_CMP(s1,s2,len) do {\
1891 while (len-- > 0) {\
1892 if (*s1++ != *s2++) goto fail;\
1896#define STRING_CMP_IC(case_fold_flag,s1,ps2,len,text_end) do {\
1897 if (string_cmp_ic(encode, case_fold_flag, s1, ps2, len, text_end) == 0) \
1901static int string_cmp_ic(OnigEncoding enc,
int case_fold_flag,
1902 UChar* s1, UChar** ps2, OnigDistance mblen,
const UChar* text_end)
1904 UChar buf1[ONIGENC_MBC_CASE_FOLD_MAXLEN];
1905 UChar buf2[ONIGENC_MBC_CASE_FOLD_MAXLEN];
1906 UChar *p1, *p2, *end1, *s2;
1912 if (s2 >= text_end)
return 0;
1913 len1 = ONIGENC_MBC_CASE_FOLD(enc, case_fold_flag, &s1, text_end, buf1);
1914 len2 = ONIGENC_MBC_CASE_FOLD(enc, case_fold_flag, &s2, text_end, buf2);
1915 if (len1 != len2)
return 0;
1918 while (len1-- > 0) {
1919 if (*p1 != *p2)
return 0;
1929#define STRING_CMP_VALUE(s1,s2,len,is_fail) do {\
1931 while (len-- > 0) {\
1932 if (*s1++ != *s2++) {\
1933 is_fail = 1; break;\
1938#define STRING_CMP_VALUE_IC(case_fold_flag,s1,ps2,len,text_end,is_fail) do {\
1939 if (string_cmp_ic(encode, case_fold_flag, s1, ps2, len, text_end) == 0) \
1946#define IS_EMPTY_STR (str == end)
1947#define ON_STR_BEGIN(s) ((s) == str)
1948#define ON_STR_END(s) ((s) == end)
1949#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
1950# define DATA_ENSURE_CHECK1 (s < right_range)
1951# define DATA_ENSURE_CHECK(n) (s + (n) <= right_range)
1952# define DATA_ENSURE(n) if (s + (n) > right_range) goto fail
1953# define DATA_ENSURE_CONTINUE(n) if (s + (n) > right_range) continue
1954# define ABSENT_END_POS right_range
1956# define DATA_ENSURE_CHECK1 (s < end)
1957# define DATA_ENSURE_CHECK(n) (s + (n) <= end)
1958# define DATA_ENSURE(n) if (s + (n) > end) goto fail
1959# define DATA_ENSURE_CONTINUE(n) if (s + (n) > end) continue
1960# define ABSENT_END_POS end
1963int onigenc_mbclen_approximate(
const OnigUChar* p,
const OnigUChar* e,
const struct OnigEncodingTypeST* enc);
1966enclen_approx(OnigEncoding enc,
const OnigUChar* p,
const OnigUChar* e)
1968 if (enc->max_enc_len == enc->min_enc_len) {
1969 return (p < e ? enc->min_enc_len : 0);
1972 return onigenc_mbclen_approximate(p, e, enc);
1977#ifdef USE_CAPTURE_HISTORY
1979make_capture_history_tree(OnigCaptureTreeNode* node, OnigStackType** kp,
1980 OnigStackType* stk_top, UChar* str, regex_t* reg)
1983 OnigCaptureTreeNode* child;
1984 OnigStackType* k = *kp;
1986 while (k < stk_top) {
1987 if (k->type == STK_MEM_START) {
1989 if (n <= ONIG_MAX_CAPTURE_HISTORY_GROUP &&
1990 BIT_STATUS_AT(reg->capture_history, n) != 0) {
1991 child = history_node_new();
1992 CHECK_NULL_RETURN_MEMERR(child);
1994 child->beg = k->u.mem.pstr - str;
1995 r = history_tree_add_child(node, child);
1997 history_tree_free(child);
2001 r = make_capture_history_tree(child, kp, stk_top, str, reg);
2002 if (r != 0)
return r;
2005 child->end = k->u.mem.pstr - str;
2008 else if (k->type == STK_MEM_END) {
2009 if (k->u.mem.num == node->group) {
2010 node->end = k->u.mem.pstr - str;
2022#ifdef USE_BACKREF_WITH_LEVEL
2024mem_is_in_memp(
int mem,
int num, UChar* memp)
2029 for (i = 0; i < num; i++) {
2030 GET_MEMNUM_INC(m, memp);
2031 if (mem == (
int )m)
return 1;
2036static int backref_match_at_nested_level(regex_t* reg,
2037 OnigStackType* top, OnigStackType* stk_base,
2038 int ignore_case,
int case_fold_flag,
2039 int nest,
int mem_num, UChar* memp, UChar** s,
const UChar* send)
2041 UChar *ss, *p, *pstart, *pend = NULL_UCHARP;
2048 while (k >= stk_base) {
2049 if (k->type == STK_CALL_FRAME) {
2052 else if (k->type == STK_RETURN) {
2055 else if (level == nest) {
2056 if (k->type == STK_MEM_START) {
2057 if (mem_is_in_memp(k->u.mem.num, mem_num, memp)) {
2058 pstart = k->u.mem.pstr;
2059 if (pend != NULL_UCHARP) {
2060 if (pend - pstart > send - *s)
return 0;
2064 if (ignore_case != 0) {
2065 if (string_cmp_ic(reg->enc, case_fold_flag,
2066 pstart, &ss, pend - pstart, send) == 0)
2071 if (*p++ != *ss++)
return 0;
2080 else if (k->type == STK_MEM_END) {
2081 if (mem_is_in_memp(k->u.mem.num, mem_num, memp)) {
2082 pend = k->u.mem.pstr;
2094#ifdef ONIG_DEBUG_STATISTICS
2097# include <windows.h>
2098static LARGE_INTEGER ts, te, freq;
2099# define GETTIME(t) QueryPerformanceCounter(&(t))
2100# define TIMEDIFF(te,ts) (unsigned long )(((te).QuadPart - (ts).QuadPart) \
2101 * 1000000 / freq.QuadPart)
2104# define USE_TIMEOFDAY
2106# ifdef USE_TIMEOFDAY
2107# ifdef HAVE_SYS_TIME_H
2108# include <sys/time.h>
2110# ifdef HAVE_UNISTD_H
2114# define GETTIME(t) gettimeofday(&(t), (struct timezone* )0)
2115# define TIMEDIFF(te,ts) (((te).tv_usec - (ts).tv_usec) + \
2116 (((te).tv_sec - (ts).tv_sec)*1000000))
2118# ifdef HAVE_SYS_TIMES_H
2119# include <sys/times.h>
2121static struct tms ts, te;
2122# define GETTIME(t) times(&(t))
2123# define TIMEDIFF(te,ts) ((te).tms_utime - (ts).tms_utime)
2128static int OpCounter[256];
2129static int OpPrevCounter[256];
2130static unsigned long OpTime[256];
2131static int OpCurr = OP_FINISH;
2132static int OpPrevTarget = OP_FAIL;
2133static int MaxStackDepth = 0;
2135# define MOP_IN(opcode) do {\
2136 if (opcode == OpPrevTarget) OpPrevCounter[OpCurr]++;\
2138 OpCounter[opcode]++;\
2142# define MOP_OUT do {\
2144 OpTime[OpCurr] += TIMEDIFF(te, ts);\
2148onig_statistics_init(
void)
2151 for (i = 0; i < 256; i++) {
2152 OpCounter[i] = OpPrevCounter[i] = 0; OpTime[i] = 0;
2156 QueryPerformanceFrequency(&freq);
2161onig_print_statistics(FILE* f)
2164 fprintf(f,
" count prev time\n");
2165 for (i = 0; OnigOpInfo[i].opcode >= 0; i++) {
2166 fprintf(f,
"%8d: %8d: %10lu: %s\n",
2167 OpCounter[i], OpPrevCounter[i], OpTime[i], OnigOpInfo[i].name);
2169 fprintf(f,
"\nmax stack depth: %d\n", MaxStackDepth);
2172# define STACK_INC do {\
2174 if (stk - stk_base > MaxStackDepth) \
2175 MaxStackDepth = stk - stk_base;\
2179# define STACK_INC stk++
2181# define MOP_IN(opcode)
2186#ifdef ONIG_DEBUG_MATCH
2188stack_type_str(
int stack_type)
2190 switch (stack_type) {
2191 case STK_ALT:
return "Alt ";
2192 case STK_LOOK_BEHIND_NOT:
return "LBNot ";
2193 case STK_POS_NOT:
return "PosNot";
2194 case STK_MEM_START:
return "MemS ";
2195 case STK_MEM_END:
return "MemE ";
2196 case STK_REPEAT_INC:
return "RepInc";
2197 case STK_STATE_CHECK_MARK:
return "StChMk";
2198 case STK_NULL_CHECK_START:
return "NulChS";
2199 case STK_NULL_CHECK_END:
return "NulChE";
2200 case STK_MEM_END_MARK:
return "MemEMk";
2201 case STK_POS:
return "Pos ";
2202 case STK_STOP_BT:
return "StopBt";
2203 case STK_REPEAT:
return "Rep ";
2204 case STK_CALL_FRAME:
return "Call ";
2205 case STK_RETURN:
return "Ret ";
2206 case STK_VOID:
return "Void ";
2207 case STK_ABSENT_POS:
return "AbsPos";
2208 case STK_ABSENT:
return "Absent";
2209 case STK_MATCH_CACHE_POINT:
return "MCache";
2210 default:
return " ";
2214#ifdef USE_MATCH_CACHE
2217bsearch_cache_opcodes(
const OnigCacheOpcode *cache_opcodes,
long num_cache_opcodes,
const UChar* p)
2219 long l = 0, r = num_cache_opcodes - 1, m = 0;
2223 if (cache_opcodes[m].addr == p)
break;
2224 if (cache_opcodes[m].addr < p) l = m + 1;
2231find_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)
2236 const OnigStackType *stkp;
2238 int is_inc = *p == OP_REPEAT_INC || *p == OP_REPEAT_INC_NG;
2240 long num_cache_points_at_outer_repeat;
2241 long num_cache_points_in_outer_repeat;
2243 m = bsearch_cache_opcodes(cache_opcodes, num_cache_opcodes, p);
2245 if (!(0 <= m && m < num_cache_opcodes && cache_opcodes[m].addr == p)) {
2249 cache_opcode = &cache_opcodes[m];
2250 *cache_opcode_ptr = &cache_opcodes[m];
2251 cache_point = cache_opcode->cache_point;
2252 if (cache_opcode->outer_repeat_mem == -1) {
2256 num_cache_points_at_outer_repeat = cache_opcode->num_cache_points_at_outer_repeat;
2257 num_cache_points_in_outer_repeat = cache_opcode->num_cache_points_in_outer_repeat;
2259 range = ®->repeat_range[cache_opcode->outer_repeat_mem];
2261 stkp = &stk[repeat_stk[cache_opcode->outer_repeat_mem]];
2262 count = is_inc ? stkp->u.repeat.count - 1 : stkp->u.repeat.count;
2264 if (count < range->lower) {
2265 return num_cache_points_at_outer_repeat +
2266 num_cache_points_in_outer_repeat * count +
2270 if (range->upper == 0x7fffffff) {
2271 return num_cache_points_at_outer_repeat +
2272 num_cache_points_in_outer_repeat * (range->lower - (is_inc ? 1 : 0)) + (is_inc ? 0 : 1) +
2276 return num_cache_points_at_outer_repeat +
2277 num_cache_points_in_outer_repeat * (range->lower - 1) +
2278 (num_cache_points_in_outer_repeat + 1) * (count - range->lower + 1) +
2283check_extended_match_cache_point(uint8_t *match_cache_buf, OnigPosition match_cache_point_index, uint8_t match_cache_point_mask)
2285 if (match_cache_point_mask & 0x80) {
2286 return (match_cache_buf[match_cache_point_index + 1] & 0x01) > 0;
2289 return (match_cache_buf[match_cache_point_index] & (match_cache_point_mask << 1)) > 0;
2294memoize_extended_match_cache_point(uint8_t *match_cache_buf, OnigPosition match_cache_point_index, uint8_t match_cache_point_mask)
2296 match_cache_buf[match_cache_point_index] |= match_cache_point_mask;
2297 if (match_cache_point_mask & 0x80) {
2298 match_cache_buf[match_cache_point_index + 1] |= 0x01;
2301 match_cache_buf[match_cache_point_index] |= match_cache_point_mask << 1;
2310match_at(regex_t* reg,
const UChar* str,
const UChar* end,
2311#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
2312 const UChar* right_range,
2316 static const UChar FinishCode[] = { OP_FINISH };
2318 int i, num_mem, pop_level;
2319 ptrdiff_t n, best_len;
2320 LengthType tlen, tlen2;
2323 OnigOptionType option = reg->options;
2324 OnigEncoding encode = reg->enc;
2325 OnigCaseFoldType case_fold_flag = reg->case_fold_flag;
2326 UChar *s, *q, *sbegin;
2331 char *xmalloc_base = NULL;
2332 OnigStackType *stk_alloc, *stk_base = NULL, *stk, *stk_end;
2333 OnigStackType *stkp;
2335 OnigStackIndex *repeat_stk;
2336 OnigStackIndex *mem_start_stk, *mem_end_stk;
2337#ifdef USE_COMBINATION_EXPLOSION_CHECK
2339 unsigned char* state_check_buff = msa->state_check_buff;
2340 int num_comb_exp_check = reg->num_comb_exp_check;
2343#if USE_TOKEN_THREADED_VM
2345# define VM_LOOP JUMP;
2347# define CASE(x) L_##x: sbegin = s; OPCODE_EXEC_HOOK;
2348# define DEFAULT L_DEFAULT:
2349# define NEXT sprev = sbegin; JUMP
2350# define JUMP pbegin = p; RB_GNUC_EXTENSION_BLOCK(goto *oplabels[*p++])
2376 &&L_OP_CCLASS_MB_NOT,
2377 &&L_OP_CCLASS_MIX_NOT,
2381 &&L_OP_ANYCHAR_STAR,
2382 &&L_OP_ANYCHAR_ML_STAR,
2383 &&L_OP_ANYCHAR_STAR_PEEK_NEXT,
2384 &&L_OP_ANYCHAR_ML_STAR_PEEK_NEXT,
2389 &&L_OP_NOT_WORD_BOUND,
2390# ifdef USE_WORD_BEGIN_END
2398 &&L_OP_NOT_ASCII_WORD,
2399 &&L_OP_ASCII_WORD_BOUND,
2400 &&L_OP_NOT_ASCII_WORD_BOUND,
2401# ifdef USE_WORD_BEGIN_END
2402 &&L_OP_ASCII_WORD_BEGIN,
2403 &&L_OP_ASCII_WORD_END,
2413 &&L_OP_SEMI_END_BUF,
2414 &&L_OP_BEGIN_POSITION,
2420 &&L_OP_BACKREF_MULTI,
2421 &&L_OP_BACKREF_MULTI_IC,
2422# ifdef USE_BACKREF_WITH_LEVEL
2423 &&L_OP_BACKREF_WITH_LEVEL,
2427 &&L_OP_MEMORY_START,
2428 &&L_OP_MEMORY_START_PUSH,
2429 &&L_OP_MEMORY_END_PUSH,
2430# ifdef USE_SUBEXP_CALL
2431 &&L_OP_MEMORY_END_PUSH_REC,
2436# ifdef USE_SUBEXP_CALL
2437 &&L_OP_MEMORY_END_REC,
2448# ifdef USE_OP_PUSH_OR_JUMP_EXACT
2449 &&L_OP_PUSH_OR_JUMP_EXACT1,
2453 &&L_OP_PUSH_IF_PEEK_NEXT,
2457 &&L_OP_REPEAT_INC_NG,
2458 &&L_OP_REPEAT_INC_SG,
2459 &&L_OP_REPEAT_INC_NG_SG,
2460 &&L_OP_NULL_CHECK_START,
2461 &&L_OP_NULL_CHECK_END,
2462# ifdef USE_MONOMANIAC_CHECK_CAPTURES_IN_ENDLESS_REPEAT
2463 &&L_OP_NULL_CHECK_END_MEMST,
2467# ifdef USE_SUBEXP_CALL
2468 &&L_OP_NULL_CHECK_END_MEMST_PUSH,
2475 &&L_OP_PUSH_POS_NOT,
2477 &&L_OP_PUSH_STOP_BT,
2480 &&L_OP_PUSH_LOOK_BEHIND_NOT,
2481 &&L_OP_FAIL_LOOK_BEHIND_NOT,
2482 &&L_OP_PUSH_ABSENT_POS,
2486# ifdef USE_SUBEXP_CALL
2495# ifdef USE_COMBINATION_EXPLOSION_CHECK
2496 &&L_OP_STATE_CHECK_PUSH,
2497 &&L_OP_STATE_CHECK_PUSH_OR_JUMP,
2504# ifdef USE_COMBINATION_EXPLOSION_CHECK
2505 &&L_OP_STATE_CHECK_ANYCHAR_STAR,
2506 &&L_OP_STATE_CHECK_ANYCHAR_ML_STAR,
2513 &&L_OP_SET_OPTION_PUSH,
2529# define VM_LOOP_END } sprev = sbegin; }
2530# define CASE(x) case x:
2531# define DEFAULT default:
2533# define JUMP continue; break
2537#ifdef USE_SUBEXP_CALL
2540# define ADD_NUMMEM 1
2543# define ADD_NUMMEM 0
2546 n = reg->num_repeat + (reg->num_mem + ADD_NUMMEM) * 2;
2548 STACK_INIT(alloca_base, xmalloc_base, n, INIT_MATCH_STACK_SIZE);
2549 pop_level = reg->stack_pop_level;
2550 num_mem = reg->num_mem;
2551 repeat_stk = (OnigStackIndex* )alloca_base;
2553 mem_start_stk = (OnigStackIndex* )(repeat_stk + reg->num_repeat);
2554 mem_end_stk = mem_start_stk + (num_mem + ADD_NUMMEM);
2556 OnigStackIndex *pp = mem_start_stk;
2557 for (; pp < repeat_stk + n; pp += 2) {
2558 pp[0] = INVALID_STACK_INDEX;
2559 pp[1] = INVALID_STACK_INDEX;
2562#ifndef USE_SUBEXP_CALL
2569#ifdef ONIG_DEBUG_MATCH
2570 fprintf(stderr,
"match_at: str: %"PRIuPTR
" (%p), end: %"PRIuPTR
" (%p), start: %"PRIuPTR
" (%p), sprev: %"PRIuPTR
" (%p)\n",
2571 (uintptr_t )str, str, (uintptr_t )end, end, (uintptr_t )sstart, sstart, (uintptr_t )sprev, sprev);
2572 fprintf(stderr,
"size: %d, start offset: %d\n",
2573 (
int )(end - str), (
int )(sstart - str));
2574 fprintf(stderr,
"\n ofs> str stk:type addr:opcode\n");
2577 STACK_PUSH_ENSURED(STK_ALT, (UChar* )FinishCode);
2578 best_len = ONIG_MISMATCH;
2579 s = (UChar* )sstart;
2580 pkeep = (UChar* )sstart;
2583#ifdef ONIG_DEBUG_MATCH
2584# define OPCODE_EXEC_HOOK \
2586 UChar *op, *q, *bp, buf[50]; \
2588 op = p - OP_OFFSET; \
2589 fprintf(stderr, "%4"PRIdPTR"> \"", (*op == OP_FINISH) ? (ptrdiff_t )-1 : s - str); \
2592 if (*op != OP_FINISH) { \
2593 for (i = 0; i < 7 && q < end; i++) { \
2594 len = enclen(encode, q, end); \
2595 while (len-- > 0) *bp++ = *q++; \
2597 if (q < end) { xmemcpy(bp, "...", 3); bp += 3; } \
2599 xmemcpy(bp, "\"", 1); bp += 1; \
2601 fputs((char* )buf, stderr); \
2602 for (i = 0; i < 20 - (bp - buf); i++) fputc(' ', stderr); \
2603 fprintf(stderr, "%4"PRIdPTR":%s %4"PRIdPTR":", \
2604 stk - stk_base - 1, \
2605 (stk > stk_base) ? stack_type_str(stk[-1].type) : " ", \
2606 (op == FinishCode) ? (ptrdiff_t )-1 : op - reg->p); \
2607 onig_print_compiled_byte_code(stderr, op, reg->p+reg->used, NULL, encode); \
2608 fprintf(stderr, "\n"); \
2611# define OPCODE_EXEC_HOOK ((void) 0)
2614#ifdef USE_MATCH_CACHE
2615#ifdef ONIG_DEBUG_MATCH_CACHE
2616#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)
2617#define MATCH_CACHE_DEBUG_HIT fprintf(stderr, "MATCH CACHE: cache hit\n")
2619#define MATCH_CACHE_DEBUG ((void) 0)
2620#define MATCH_CACHE_DEBUG_HIT ((void) 0)
2623#define MATCH_CACHE_HIT ((void) 0)
2625# define CHECK_MATCH_CACHE do {\
2626 if (msa->match_cache_status == MATCH_CACHE_STATUS_ENABLED) {\
2627 const OnigCacheOpcode *cache_opcode;\
2628 long cache_point = find_cache_point(reg, msa->cache_opcodes, msa->num_cache_opcodes, pbegin, stk_base, repeat_stk, &cache_opcode);\
2629 if (cache_point >= 0) {\
2630 OnigPosition match_cache_point = msa->num_cache_points * (OnigPosition)(s - str) + cache_point;\
2631 OnigPosition match_cache_point_index = match_cache_point >> 3;\
2632 uint8_t match_cache_point_mask = 1 << (match_cache_point & 7);\
2634 if (msa->match_cache_buf[match_cache_point_index] & match_cache_point_mask) {\
2635 MATCH_CACHE_DEBUG_HIT; MATCH_CACHE_HIT;\
2636 if (cache_opcode->lookaround_nesting == 0) goto fail;\
2637 else if (cache_opcode->lookaround_nesting < 0) {\
2638 if (check_extended_match_cache_point(msa->match_cache_buf, match_cache_point_index, match_cache_point_mask)) {\
2639 STACK_STOP_BT_FAIL;\
2645 if (check_extended_match_cache_point(msa->match_cache_buf, match_cache_point_index, match_cache_point_mask)) {\
2646 p = cache_opcode->match_addr;\
2653 STACK_PUSH_MATCH_CACHE_POINT(match_cache_point_index, match_cache_point_mask);\
2658# define CHECK_MATCH_CACHE ((void) 0)
2662 CASE(OP_END) MOP_IN(OP_END);
2666#ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
2667 if (IS_FIND_LONGEST(option)) {
2668 if (n > msa->best_len) {
2670 msa->best_s = (UChar* )sstart;
2677 region = msa->region;
2679 region->beg[0] = ((pkeep > s) ? s : pkeep) - str;
2680 region->end[0] = s - str;
2681 for (i = 1; i <= num_mem; i++) {
2682 if (mem_end_stk[i] != INVALID_STACK_INDEX) {
2683 if (BIT_STATUS_AT(reg->bt_mem_start, i))
2684 region->beg[i] = STACK_AT(mem_start_stk[i])->u.mem.pstr - str;
2686 region->beg[i] = (UChar* )((
void* )mem_start_stk[i]) - str;
2688 region->end[i] = (BIT_STATUS_AT(reg->bt_mem_end, i)
2689 ? STACK_AT(mem_end_stk[i])->u.mem.pstr
2690 : (UChar* )((
void* )mem_end_stk[i])) - str;
2693 region->beg[i] = region->end[i] = ONIG_REGION_NOTPOS;
2697#ifdef USE_CAPTURE_HISTORY
2698 if (reg->capture_history != 0) {
2700 OnigCaptureTreeNode* node;
2702 if (IS_NULL(region->history_root)) {
2703 region->history_root = node = history_node_new();
2704 CHECK_NULL_RETURN_MEMERR(node);
2707 node = region->history_root;
2708 history_tree_clear(node);
2712 node->beg = ((pkeep > s) ? s : pkeep) - str;
2713 node->end = s - str;
2716 r = make_capture_history_tree(region->history_root, &stkp,
2717 stk, (UChar* )str, reg);
2727#ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
2732 if (IS_FIND_CONDITION(option)) {
2733 if (IS_FIND_NOT_EMPTY(option) && s == sstart) {
2734 best_len = ONIG_MISMATCH;
2737 if (IS_FIND_LONGEST(option) && DATA_ENSURE_CHECK1) {
2745 CASE(OP_EXACT1) MOP_IN(OP_EXACT1);
2747 if (*p != *s)
goto fail;
2752 CASE(OP_EXACT1_IC) MOP_IN(OP_EXACT1_IC);
2755 UChar *q, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN];
2758 len = ONIGENC_MBC_CASE_FOLD(encode,
2763 if (
len != enclen(encode, p, reg->p + reg->used))
goto fail;
2775 CASE(OP_EXACT2) MOP_IN(OP_EXACT2);
2777 if (*p != *s)
goto fail;
2779 if (*p != *s)
goto fail;
2785 CASE(OP_EXACT3) MOP_IN(OP_EXACT3);
2787 if (*p != *s)
goto fail;
2789 if (*p != *s)
goto fail;
2791 if (*p != *s)
goto fail;
2797 CASE(OP_EXACT4) MOP_IN(OP_EXACT4);
2799 if (*p != *s)
goto fail;
2801 if (*p != *s)
goto fail;
2803 if (*p != *s)
goto fail;
2805 if (*p != *s)
goto fail;
2811 CASE(OP_EXACT5) MOP_IN(OP_EXACT5);
2813 if (*p != *s)
goto fail;
2815 if (*p != *s)
goto fail;
2817 if (*p != *s)
goto fail;
2819 if (*p != *s)
goto fail;
2821 if (*p != *s)
goto fail;
2827 CASE(OP_EXACTN) MOP_IN(OP_EXACTN);
2828 GET_LENGTH_INC(tlen, p);
2830 while (tlen-- > 0) {
2831 if (*p++ != *s++)
goto fail;
2837 CASE(OP_EXACTN_IC) MOP_IN(OP_EXACTN_IC);
2840 UChar *q, *endp, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN];
2842 GET_LENGTH_INC(tlen, p);
2848 len = ONIGENC_MBC_CASE_FOLD(encode,
2853 if (
len > endp - p)
goto fail;
2856 if (*p != *q)
goto fail;
2865 CASE(OP_EXACTMB2N1) MOP_IN(OP_EXACTMB2N1);
2867 if (*p != *s)
goto fail;
2869 if (*p != *s)
goto fail;
2874 CASE(OP_EXACTMB2N2) MOP_IN(OP_EXACTMB2N2);
2876 if (*p != *s)
goto fail;
2878 if (*p != *s)
goto fail;
2881 if (*p != *s)
goto fail;
2883 if (*p != *s)
goto fail;
2888 CASE(OP_EXACTMB2N3) MOP_IN(OP_EXACTMB2N3);
2890 if (*p != *s)
goto fail;
2892 if (*p != *s)
goto fail;
2894 if (*p != *s)
goto fail;
2896 if (*p != *s)
goto fail;
2899 if (*p != *s)
goto fail;
2901 if (*p != *s)
goto fail;
2906 CASE(OP_EXACTMB2N) MOP_IN(OP_EXACTMB2N);
2907 GET_LENGTH_INC(tlen, p);
2908 DATA_ENSURE(tlen * 2);
2909 while (tlen-- > 0) {
2910 if (*p != *s)
goto fail;
2912 if (*p != *s)
goto fail;
2919 CASE(OP_EXACTMB3N) MOP_IN(OP_EXACTMB3N);
2920 GET_LENGTH_INC(tlen, p);
2921 DATA_ENSURE(tlen * 3);
2922 while (tlen-- > 0) {
2923 if (*p != *s)
goto fail;
2925 if (*p != *s)
goto fail;
2927 if (*p != *s)
goto fail;
2934 CASE(OP_EXACTMBN) MOP_IN(OP_EXACTMBN);
2935 GET_LENGTH_INC(tlen, p);
2936 GET_LENGTH_INC(tlen2, p);
2939 while (tlen2-- > 0) {
2940 if (*p != *s)
goto fail;
2947 CASE(OP_CCLASS) MOP_IN(OP_CCLASS);
2949 if (BITSET_AT(((BitSetRef )p), *s) == 0)
goto fail;
2951 s += enclen(encode, s, end);
2955 CASE(OP_CCLASS_MB) MOP_IN(OP_CCLASS_MB);
2956 if (! ONIGENC_IS_MBC_HEAD(encode, s, end))
goto fail;
2959 GET_LENGTH_INC(tlen, p);
2966 mb_len = enclen_approx(encode, s, end);
2967 DATA_ENSURE(mb_len);
2970 code = ONIGENC_MBC_TO_CODE(encode, ss, s);
2972#ifdef PLATFORM_UNALIGNED_WORD_ACCESS
2973 if (! onig_is_in_code_range(p, code))
goto fail;
2977 if (! onig_is_in_code_range(q, code))
goto fail;
2984 CASE(OP_CCLASS_MIX) MOP_IN(OP_CCLASS_MIX);
2986 if (ONIGENC_IS_MBC_HEAD(encode, s, end)) {
2991 if (BITSET_AT(((BitSetRef )p), *s) == 0)
2995 GET_LENGTH_INC(tlen, p);
3002 CASE(OP_CCLASS_NOT) MOP_IN(OP_CCLASS_NOT);
3004 if (BITSET_AT(((BitSetRef )p), *s) != 0)
goto fail;
3006 s += enclen(encode, s, end);
3010 CASE(OP_CCLASS_MB_NOT) MOP_IN(OP_CCLASS_MB_NOT);
3012 if (! ONIGENC_IS_MBC_HEAD(encode, s, end)) {
3014 GET_LENGTH_INC(tlen, p);
3016 goto cc_mb_not_success;
3020 GET_LENGTH_INC(tlen, p);
3024 int mb_len = enclen(encode, s, end);
3026 if (! DATA_ENSURE_CHECK(mb_len)) {
3030 goto cc_mb_not_success;
3035 code = ONIGENC_MBC_TO_CODE(encode, ss, s);
3037#ifdef PLATFORM_UNALIGNED_WORD_ACCESS
3038 if (onig_is_in_code_range(p, code))
goto fail;
3042 if (onig_is_in_code_range(q, code))
goto fail;
3051 CASE(OP_CCLASS_MIX_NOT) MOP_IN(OP_CCLASS_MIX_NOT);
3053 if (ONIGENC_IS_MBC_HEAD(encode, s, end)) {
3058 if (BITSET_AT(((BitSetRef )p), *s) != 0)
3062 GET_LENGTH_INC(tlen, p);
3069 CASE(OP_ANYCHAR) MOP_IN(OP_ANYCHAR);
3071 n = enclen_approx(encode, s, end);
3073 if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 0))
goto fail;
3078 CASE(OP_ANYCHAR_ML) MOP_IN(OP_ANYCHAR_ML);
3080 n = enclen_approx(encode, s, end);
3086 CASE(OP_ANYCHAR_STAR) MOP_IN(OP_ANYCHAR_STAR);
3087 while (DATA_ENSURE_CHECK1) {
3089 STACK_PUSH_ALT(p, s, sprev, pkeep);
3090 n = enclen_approx(encode, s, end);
3092 if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 0))
goto fail;
3099 CASE(OP_ANYCHAR_ML_STAR) MOP_IN(OP_ANYCHAR_ML_STAR);
3100 while (DATA_ENSURE_CHECK1) {
3102 STACK_PUSH_ALT(p, s, sprev, pkeep);
3103 n = enclen_approx(encode, s, end);
3117 CASE(OP_ANYCHAR_STAR_PEEK_NEXT) MOP_IN(OP_ANYCHAR_STAR_PEEK_NEXT);
3118 while (DATA_ENSURE_CHECK1) {
3121 STACK_PUSH_ALT(p + 1, s, sprev, pkeep);
3123#ifdef USE_MATCH_CACHE
3129 n = enclen_approx(encode, s, end);
3131 if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 0))
goto fail;
3139 CASE(OP_ANYCHAR_ML_STAR_PEEK_NEXT)MOP_IN(OP_ANYCHAR_ML_STAR_PEEK_NEXT);
3140 while (DATA_ENSURE_CHECK1) {
3143 STACK_PUSH_ALT(p + 1, s, sprev, pkeep);
3145#ifdef USE_MATCH_CACHE
3151 n = enclen_approx(encode, s, end);
3166#ifdef USE_COMBINATION_EXPLOSION_CHECK
3167 CASE(OP_STATE_CHECK_ANYCHAR_STAR) MOP_IN(OP_STATE_CHECK_ANYCHAR_STAR);
3168 GET_STATE_CHECK_NUM_INC(mem, p);
3169 while (DATA_ENSURE_CHECK1) {
3170 STATE_CHECK_VAL(scv, mem);
3173 STACK_PUSH_ALT_WITH_STATE_CHECK(p, s, sprev, mem, pkeep);
3174 n = enclen_approx(encode, s, end);
3176 if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 0))
goto fail;
3183 CASE(OP_STATE_CHECK_ANYCHAR_ML_STAR)
3184 MOP_IN(OP_STATE_CHECK_ANYCHAR_ML_STAR);
3186 GET_STATE_CHECK_NUM_INC(mem, p);
3187 while (DATA_ENSURE_CHECK1) {
3188 STATE_CHECK_VAL(scv, mem);
3191 STACK_PUSH_ALT_WITH_STATE_CHECK(p, s, sprev, mem, pkeep);
3192 n = enclen_approx(encode, s, end);
3207 CASE(OP_WORD) MOP_IN(OP_WORD);
3209 if (! ONIGENC_IS_MBC_WORD(encode, s, end))
3212 s += enclen(encode, s, end);
3216 CASE(OP_ASCII_WORD) MOP_IN(OP_ASCII_WORD);
3218 if (! ONIGENC_IS_MBC_ASCII_WORD(encode, s, end))
3221 s += enclen(encode, s, end);
3225 CASE(OP_NOT_WORD) MOP_IN(OP_NOT_WORD);
3227 if (ONIGENC_IS_MBC_WORD(encode, s, end))
3230 s += enclen(encode, s, end);
3234 CASE(OP_NOT_ASCII_WORD) MOP_IN(OP_NOT_ASCII_WORD);
3236 if (ONIGENC_IS_MBC_ASCII_WORD(encode, s, end))
3239 s += enclen(encode, s, end);
3243 CASE(OP_WORD_BOUND) MOP_IN(OP_WORD_BOUND);
3244 if (ON_STR_BEGIN(s)) {
3246 if (! ONIGENC_IS_MBC_WORD(encode, s, end))
3249 else if (ON_STR_END(s)) {
3250 if (! ONIGENC_IS_MBC_WORD(encode, sprev, end))
3254 if (ONIGENC_IS_MBC_WORD(encode, s, end)
3255 == ONIGENC_IS_MBC_WORD(encode, sprev, end))
3261 CASE(OP_ASCII_WORD_BOUND) MOP_IN(OP_ASCII_WORD_BOUND);
3262 if (ON_STR_BEGIN(s)) {
3264 if (! ONIGENC_IS_MBC_ASCII_WORD(encode, s, end))
3267 else if (ON_STR_END(s)) {
3268 if (! ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end))
3272 if (ONIGENC_IS_MBC_ASCII_WORD(encode, s, end)
3273 == ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end))
3279 CASE(OP_NOT_WORD_BOUND) MOP_IN(OP_NOT_WORD_BOUND);
3280 if (ON_STR_BEGIN(s)) {
3281 if (DATA_ENSURE_CHECK1 && ONIGENC_IS_MBC_WORD(encode, s, end))
3284 else if (ON_STR_END(s)) {
3285 if (ONIGENC_IS_MBC_WORD(encode, sprev, end))
3289 if (ONIGENC_IS_MBC_WORD(encode, s, end)
3290 != ONIGENC_IS_MBC_WORD(encode, sprev, end))
3296 CASE(OP_NOT_ASCII_WORD_BOUND) MOP_IN(OP_NOT_ASCII_WORD_BOUND);
3297 if (ON_STR_BEGIN(s)) {
3298 if (DATA_ENSURE_CHECK1 && ONIGENC_IS_MBC_ASCII_WORD(encode, s, end))
3301 else if (ON_STR_END(s)) {
3302 if (ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end))
3306 if (ONIGENC_IS_MBC_ASCII_WORD(encode, s, end)
3307 != ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end))
3313#ifdef USE_WORD_BEGIN_END
3314 CASE(OP_WORD_BEGIN) MOP_IN(OP_WORD_BEGIN);
3315 if (DATA_ENSURE_CHECK1 && ONIGENC_IS_MBC_WORD(encode, s, end)) {
3316 if (ON_STR_BEGIN(s) || !ONIGENC_IS_MBC_WORD(encode, sprev, end)) {
3323 CASE(OP_ASCII_WORD_BEGIN) MOP_IN(OP_ASCII_WORD_BEGIN);
3324 if (DATA_ENSURE_CHECK1 && ONIGENC_IS_MBC_ASCII_WORD(encode, s, end)) {
3325 if (ON_STR_BEGIN(s) || !ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end)) {
3332 CASE(OP_WORD_END) MOP_IN(OP_WORD_END);
3333 if (!ON_STR_BEGIN(s) && ONIGENC_IS_MBC_WORD(encode, sprev, end)) {
3334 if (ON_STR_END(s) || !ONIGENC_IS_MBC_WORD(encode, s, end)) {
3341 CASE(OP_ASCII_WORD_END) MOP_IN(OP_ASCII_WORD_END);
3342 if (!ON_STR_BEGIN(s) && ONIGENC_IS_MBC_ASCII_WORD(encode, sprev, end)) {
3343 if (ON_STR_END(s) || !ONIGENC_IS_MBC_ASCII_WORD(encode, s, end)) {
3351 CASE(OP_BEGIN_BUF) MOP_IN(OP_BEGIN_BUF);
3352 if (! ON_STR_BEGIN(s))
goto fail;
3353 if (IS_NOTBOS(msa->options))
goto fail;
3358 CASE(OP_END_BUF) MOP_IN(OP_END_BUF);
3359 if (! ON_STR_END(s))
goto fail;
3360 if (IS_NOTEOS(msa->options))
goto fail;
3365 CASE(OP_BEGIN_LINE) MOP_IN(OP_BEGIN_LINE);
3366 if (ON_STR_BEGIN(s)) {
3367 if (IS_NOTBOL(msa->options))
goto fail;
3371 else if (ONIGENC_IS_MBC_NEWLINE(encode, sprev, end)
3372#ifdef USE_CRNL_AS_LINE_TERMINATOR
3373 && !(IS_NEWLINE_CRLF(option)
3374 && ONIGENC_IS_MBC_CRNL(encode, sprev, end))
3376 && !ON_STR_END(s)) {
3382 CASE(OP_END_LINE) MOP_IN(OP_END_LINE);
3383 if (ON_STR_END(s)) {
3384#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
3385 if (IS_EMPTY_STR || !ONIGENC_IS_MBC_NEWLINE_EX(encode, sprev, str, end, option, 1)) {
3387 if (IS_NOTEOL(msa->options))
goto fail;
3390#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
3394 else if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 1)) {
3400 CASE(OP_SEMI_END_BUF) MOP_IN(OP_SEMI_END_BUF);
3401 if (ON_STR_END(s)) {
3402#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
3403 if (IS_EMPTY_STR || !ONIGENC_IS_MBC_NEWLINE_EX(encode, sprev, str, end, option, 1)) {
3405 if (IS_NOTEOL(msa->options))
goto fail;
3408#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
3412 else if (ONIGENC_IS_MBC_NEWLINE_EX(encode, s, str, end, option, 1)) {
3413 UChar* ss = s + enclen(encode, s, end);
3414 if (ON_STR_END(ss)) {
3418#ifdef USE_CRNL_AS_LINE_TERMINATOR
3419 else if (IS_NEWLINE_CRLF(option)
3420 && ONIGENC_IS_MBC_CRNL(encode, s, end)) {
3421 ss += enclen(encode, ss, end);
3422 if (ON_STR_END(ss)) {
3431 CASE(OP_BEGIN_POSITION) MOP_IN(OP_BEGIN_POSITION);
3438 CASE(OP_MEMORY_START_PUSH) MOP_IN(OP_MEMORY_START_PUSH);
3439 GET_MEMNUM_INC(mem, p);
3440 STACK_PUSH_MEM_START(mem, s);
3444 CASE(OP_MEMORY_START) MOP_IN(OP_MEMORY_START);
3445 GET_MEMNUM_INC(mem, p);
3446 mem_start_stk[mem] = (OnigStackIndex )((
void* )s);
3447 mem_end_stk[mem] = INVALID_STACK_INDEX;
3451 CASE(OP_MEMORY_END_PUSH) MOP_IN(OP_MEMORY_END_PUSH);
3452 GET_MEMNUM_INC(mem, p);
3453 STACK_PUSH_MEM_END(mem, s);
3457 CASE(OP_MEMORY_END) MOP_IN(OP_MEMORY_END);
3458 GET_MEMNUM_INC(mem, p);
3459 mem_end_stk[mem] = (OnigStackIndex )((
void* )s);
3463 CASE(OP_KEEP) MOP_IN(OP_KEEP);
3468#ifdef USE_SUBEXP_CALL
3469 CASE(OP_MEMORY_END_PUSH_REC) MOP_IN(OP_MEMORY_END_PUSH_REC);
3470 GET_MEMNUM_INC(mem, p);
3471 STACK_GET_MEM_START(mem, stkp);
3472 mem_start_stk[mem] = GET_STACK_INDEX(stkp);
3473 STACK_PUSH_MEM_END(mem, s);
3477 CASE(OP_MEMORY_END_REC) MOP_IN(OP_MEMORY_END_REC);
3478 GET_MEMNUM_INC(mem, p);
3479 mem_end_stk[mem] = (OnigStackIndex )((
void* )s);
3480 STACK_GET_MEM_START(mem, stkp);
3482 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3483 mem_start_stk[mem] = GET_STACK_INDEX(stkp);
3485 mem_start_stk[mem] = (OnigStackIndex )((
void* )stkp->u.mem.pstr);
3487 STACK_PUSH_MEM_END_MARK(mem);
3492 CASE(OP_BACKREF1) MOP_IN(OP_BACKREF1);
3496 CASE(OP_BACKREF2) MOP_IN(OP_BACKREF2);
3500 CASE(OP_BACKREFN) MOP_IN(OP_BACKREFN);
3501 GET_MEMNUM_INC(mem, p);
3505 UChar *pstart, *pend;
3509 if (mem > num_mem)
goto fail;
3510 if (mem_end_stk[mem] == INVALID_STACK_INDEX)
goto fail;
3511 if (mem_start_stk[mem] == INVALID_STACK_INDEX)
goto fail;
3513 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3514 pstart = STACK_AT(mem_start_stk[mem])->u.mem.pstr;
3516 pstart = (UChar* )((
void* )mem_start_stk[mem]);
3518 pend = (BIT_STATUS_AT(reg->bt_mem_end, mem)
3519 ? STACK_AT(mem_end_stk[mem])->u.mem.pstr
3520 : (UChar* )((
void* )mem_end_stk[mem]));
3524 STRING_CMP(pstart, s, n);
3525 while (sprev + (
len = enclen_approx(encode, sprev, end)) < s)
3532 CASE(OP_BACKREFN_IC) MOP_IN(OP_BACKREFN_IC);
3533 GET_MEMNUM_INC(mem, p);
3536 UChar *pstart, *pend;
3540 if (mem > num_mem)
goto fail;
3541 if (mem_end_stk[mem] == INVALID_STACK_INDEX)
goto fail;
3542 if (mem_start_stk[mem] == INVALID_STACK_INDEX)
goto fail;
3544 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3545 pstart = STACK_AT(mem_start_stk[mem])->u.mem.pstr;
3547 pstart = (UChar* )((
void* )mem_start_stk[mem]);
3549 pend = (BIT_STATUS_AT(reg->bt_mem_end, mem)
3550 ? STACK_AT(mem_end_stk[mem])->u.mem.pstr
3551 : (UChar* )((
void* )mem_end_stk[mem]));
3555 STRING_CMP_IC(case_fold_flag, pstart, &s, n, end);
3556 while (sprev + (
len = enclen_approx(encode, sprev, end)) < s)
3564 CASE(OP_BACKREF_MULTI) MOP_IN(OP_BACKREF_MULTI);
3567 UChar *pstart, *pend, *swork;
3569 GET_LENGTH_INC(tlen, p);
3570 for (i = 0; i < tlen; i++) {
3571 GET_MEMNUM_INC(mem, p);
3573 if (mem_end_stk[mem] == INVALID_STACK_INDEX)
continue;
3574 if (mem_start_stk[mem] == INVALID_STACK_INDEX)
continue;
3576 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3577 pstart = STACK_AT(mem_start_stk[mem])->u.mem.pstr;
3579 pstart = (UChar* )((
void* )mem_start_stk[mem]);
3581 pend = (BIT_STATUS_AT(reg->bt_mem_end, mem)
3582 ? STACK_AT(mem_end_stk[mem])->u.mem.pstr
3583 : (UChar* )((
void* )mem_end_stk[mem]));
3585 DATA_ENSURE_CONTINUE(n);
3588 STRING_CMP_VALUE(pstart, swork, n, is_fail);
3589 if (is_fail)
continue;
3591 while (sprev + (
len = enclen_approx(encode, sprev, end)) < s)
3594 p += (SIZE_MEMNUM * (tlen - i - 1));
3597 if (i == tlen)
goto fail;
3603 CASE(OP_BACKREF_MULTI_IC) MOP_IN(OP_BACKREF_MULTI_IC);
3606 UChar *pstart, *pend, *swork;
3608 GET_LENGTH_INC(tlen, p);
3609 for (i = 0; i < tlen; i++) {
3610 GET_MEMNUM_INC(mem, p);
3612 if (mem_end_stk[mem] == INVALID_STACK_INDEX)
continue;
3613 if (mem_start_stk[mem] == INVALID_STACK_INDEX)
continue;
3615 if (BIT_STATUS_AT(reg->bt_mem_start, mem))
3616 pstart = STACK_AT(mem_start_stk[mem])->u.mem.pstr;
3618 pstart = (UChar* )((
void* )mem_start_stk[mem]);
3620 pend = (BIT_STATUS_AT(reg->bt_mem_end, mem)
3621 ? STACK_AT(mem_end_stk[mem])->u.mem.pstr
3622 : (UChar* )((
void* )mem_end_stk[mem]));
3624 DATA_ENSURE_CONTINUE(n);
3627 STRING_CMP_VALUE_IC(case_fold_flag, pstart, &swork, n, end, is_fail);
3628 if (is_fail)
continue;
3630 while (sprev + (
len = enclen(encode, sprev, end)) < s)
3633 p += (SIZE_MEMNUM * (tlen - i - 1));
3636 if (i == tlen)
goto fail;
3641#ifdef USE_BACKREF_WITH_LEVEL
3642 CASE(OP_BACKREF_WITH_LEVEL)
3648 GET_OPTION_INC(ic, p);
3649 GET_LENGTH_INC(level, p);
3650 GET_LENGTH_INC(tlen, p);
3653 if (backref_match_at_nested_level(reg, stk, stk_base, ic,
3654 case_fold_flag, (
int )level, (
int )tlen, p, &s, end)) {
3655 while (sprev + (
len = enclen(encode, sprev, end)) < s)
3658 p += (SIZE_MEMNUM * tlen);
3670 CASE(OP_SET_OPTION_PUSH) MOP_IN(OP_SET_OPTION_PUSH);
3671 GET_OPTION_INC(option, p);
3672 STACK_PUSH_ALT(p, s, sprev, pkeep);
3673 p += SIZE_OP_SET_OPTION + SIZE_OP_FAIL;
3677 CASE(OP_SET_OPTION) MOP_IN(OP_SET_OPTION);
3678 GET_OPTION_INC(option, p);
3683 CASE(OP_NULL_CHECK_START) MOP_IN(OP_NULL_CHECK_START);
3684 GET_MEMNUM_INC(mem, p);
3685 STACK_PUSH_NULL_CHECK_START(mem, s);
3689 CASE(OP_NULL_CHECK_END) MOP_IN(OP_NULL_CHECK_END);
3693 GET_MEMNUM_INC(mem, p);
3694 STACK_NULL_CHECK(isnull, mem, s);
3696#ifdef ONIG_DEBUG_MATCH
3697 fprintf(stderr,
"NULL_CHECK_END: skip id:%d, s:%"PRIuPTR
" (%p)\n",
3698 (
int )mem, (uintptr_t )s, s);
3708 case OP_REPEAT_INC_NG:
3709 case OP_REPEAT_INC_SG:
3710 case OP_REPEAT_INC_NG_SG:
3714 goto unexpected_bytecode_error;
3722#ifdef USE_MONOMANIAC_CHECK_CAPTURES_IN_ENDLESS_REPEAT
3723 CASE(OP_NULL_CHECK_END_MEMST) MOP_IN(OP_NULL_CHECK_END_MEMST);
3727 GET_MEMNUM_INC(mem, p);
3728 STACK_NULL_CHECK_MEMST(isnull, mem, s, reg);
3730# ifdef ONIG_DEBUG_MATCH
3731 fprintf(stderr,
"NULL_CHECK_END_MEMST: skip id:%d, s:%"PRIuPTR
" (%p)\n",
3732 (
int )mem, (uintptr_t )s, s);
3734 if (isnull == -1)
goto fail;
3735 goto null_check_found;
3742#ifdef USE_SUBEXP_CALL
3743 CASE(OP_NULL_CHECK_END_MEMST_PUSH)
3744 MOP_IN(OP_NULL_CHECK_END_MEMST_PUSH);
3748 GET_MEMNUM_INC(mem, p);
3749# ifdef USE_MONOMANIAC_CHECK_CAPTURES_IN_ENDLESS_REPEAT
3750 STACK_NULL_CHECK_MEMST_REC(isnull, mem, s, reg);
3752 STACK_NULL_CHECK_REC(isnull, mem, s);
3755# ifdef ONIG_DEBUG_MATCH
3756 fprintf(stderr,
"NULL_CHECK_END_MEMST_PUSH: skip id:%d, s:%"PRIuPTR
" (%p)\n",
3757 (
int )mem, (uintptr_t )s, s);
3759 if (isnull == -1)
goto fail;
3760 goto null_check_found;
3763 STACK_PUSH_NULL_CHECK_END(mem);
3770 CASE(OP_JUMP) MOP_IN(OP_JUMP);
3771 GET_RELADDR_INC(addr, p);
3774 CHECK_INTERRUPT_IN_MATCH_AT;
3777 CASE(OP_PUSH) MOP_IN(OP_PUSH);
3778 GET_RELADDR_INC(addr, p);
3780 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
3784#ifdef USE_COMBINATION_EXPLOSION_CHECK
3785 CASE(OP_STATE_CHECK_PUSH) MOP_IN(OP_STATE_CHECK_PUSH);
3786 GET_STATE_CHECK_NUM_INC(mem, p);
3787 STATE_CHECK_VAL(scv, mem);
3790 GET_RELADDR_INC(addr, p);
3791 STACK_PUSH_ALT_WITH_STATE_CHECK(p + addr, s, sprev, mem, pkeep);
3795 CASE(OP_STATE_CHECK_PUSH_OR_JUMP) MOP_IN(OP_STATE_CHECK_PUSH_OR_JUMP);
3796 GET_STATE_CHECK_NUM_INC(mem, p);
3797 GET_RELADDR_INC(addr, p);
3798 STATE_CHECK_VAL(scv, mem);
3803 STACK_PUSH_ALT_WITH_STATE_CHECK(p + addr, s, sprev, mem, pkeep);
3808 CASE(OP_STATE_CHECK) MOP_IN(OP_STATE_CHECK);
3809 GET_STATE_CHECK_NUM_INC(mem, p);
3810 STATE_CHECK_VAL(scv, mem);
3813 STACK_PUSH_STATE_CHECK(s, mem);
3818 CASE(OP_POP) MOP_IN(OP_POP);
3820#ifdef USE_MATCH_CACHE
3828#ifdef USE_OP_PUSH_OR_JUMP_EXACT
3829 CASE(OP_PUSH_OR_JUMP_EXACT1) MOP_IN(OP_PUSH_OR_JUMP_EXACT1);
3830 GET_RELADDR_INC(addr, p);
3831 if (*p == *s && DATA_ENSURE_CHECK1) {
3834 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
3843 CASE(OP_PUSH_IF_PEEK_NEXT) MOP_IN(OP_PUSH_IF_PEEK_NEXT);
3844 GET_RELADDR_INC(addr, p);
3848 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
3857 CASE(OP_REPEAT) MOP_IN(OP_REPEAT);
3859 GET_MEMNUM_INC(mem, p);
3860 GET_RELADDR_INC(addr, p);
3863 repeat_stk[mem] = GET_STACK_INDEX(stk);
3864 STACK_PUSH_REPEAT(mem, p);
3866 if (reg->repeat_range[mem].lower == 0) {
3868 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
3874 CASE(OP_REPEAT_NG) MOP_IN(OP_REPEAT_NG);
3876 GET_MEMNUM_INC(mem, p);
3877 GET_RELADDR_INC(addr, p);
3880 repeat_stk[mem] = GET_STACK_INDEX(stk);
3881 STACK_PUSH_REPEAT(mem, p);
3883 if (reg->repeat_range[mem].lower == 0) {
3885 STACK_PUSH_ALT(p, s, sprev, pkeep);
3892 CASE(OP_REPEAT_INC) MOP_IN(OP_REPEAT_INC);
3893 GET_MEMNUM_INC(mem, p);
3894 si = repeat_stk[mem];
3895 stkp = STACK_AT(si);
3898 stkp->u.repeat.count++;
3899 if (stkp->u.repeat.count >= reg->repeat_range[mem].upper) {
3902 else if (stkp->u.repeat.count >= reg->repeat_range[mem].lower) {
3903#ifdef USE_MATCH_CACHE
3904 if (*pbegin == OP_REPEAT_INC) {
3905#undef MATCH_CACHE_HIT
3906#define MATCH_CACHE_HIT stkp->u.repeat.count--;
3908#undef MATCH_CACHE_HIT
3909#define MATCH_CACHE_HIT ((void) 0)
3912 STACK_PUSH_ALT(p, s, sprev, pkeep);
3913 p = STACK_AT(si)->u.repeat.pcode;
3916 p = stkp->u.repeat.pcode;
3918 STACK_PUSH_REPEAT_INC(si);
3920 CHECK_INTERRUPT_IN_MATCH_AT;
3923 CASE(OP_REPEAT_INC_SG) MOP_IN(OP_REPEAT_INC_SG);
3924 GET_MEMNUM_INC(mem, p);
3925 STACK_GET_REPEAT(mem, stkp);
3926 si = GET_STACK_INDEX(stkp);
3929 CASE(OP_REPEAT_INC_NG) MOP_IN(OP_REPEAT_INC_NG);
3930 GET_MEMNUM_INC(mem, p);
3931 si = repeat_stk[mem];
3932 stkp = STACK_AT(si);
3935 stkp->u.repeat.count++;
3936 if (stkp->u.repeat.count < reg->repeat_range[mem].upper) {
3937 if (stkp->u.repeat.count >= reg->repeat_range[mem].lower) {
3938 UChar* pcode = stkp->u.repeat.pcode;
3940 STACK_PUSH_REPEAT_INC(si);
3941 if (*pbegin == OP_REPEAT_INC_NG) {
3944 STACK_PUSH_ALT(pcode, s, sprev, pkeep);
3947 p = stkp->u.repeat.pcode;
3948 STACK_PUSH_REPEAT_INC(si);
3951 else if (stkp->u.repeat.count == reg->repeat_range[mem].upper) {
3952 STACK_PUSH_REPEAT_INC(si);
3955 CHECK_INTERRUPT_IN_MATCH_AT;
3958 CASE(OP_REPEAT_INC_NG_SG) MOP_IN(OP_REPEAT_INC_NG_SG);
3959 GET_MEMNUM_INC(mem, p);
3960 STACK_GET_REPEAT(mem, stkp);
3961 si = GET_STACK_INDEX(stkp);
3964 CASE(OP_PUSH_POS) MOP_IN(OP_PUSH_POS);
3965 STACK_PUSH_POS(s, sprev, pkeep);
3969 CASE(OP_POP_POS) MOP_IN(OP_POP_POS);
3971 STACK_POS_END(stkp);
3972 s = stkp->u.state.pstr;
3973 sprev = stkp->u.state.pstr_prev;
3978 CASE(OP_PUSH_POS_NOT) MOP_IN(OP_PUSH_POS_NOT);
3979 GET_RELADDR_INC(addr, p);
3980 STACK_PUSH_POS_NOT(p + addr, s, sprev, pkeep);
3984 CASE(OP_FAIL_POS) MOP_IN(OP_FAIL_POS);
3985 STACK_POP_TIL_POS_NOT;
3988 CASE(OP_PUSH_STOP_BT) MOP_IN(OP_PUSH_STOP_BT);
3993 CASE(OP_POP_STOP_BT) MOP_IN(OP_POP_STOP_BT);
3998 CASE(OP_LOOK_BEHIND) MOP_IN(OP_LOOK_BEHIND);
3999 GET_LENGTH_INC(tlen, p);
4000 s = (UChar* )ONIGENC_STEP_BACK(encode, str, s, end, (
int )tlen);
4001 if (IS_NULL(s))
goto fail;
4002 sprev = (UChar* )onigenc_get_prev_char_head(encode, str, s, end);
4006 CASE(OP_PUSH_LOOK_BEHIND_NOT) MOP_IN(OP_PUSH_LOOK_BEHIND_NOT);
4007 GET_RELADDR_INC(addr, p);
4008 GET_LENGTH_INC(tlen, p);
4009 q = (UChar* )ONIGENC_STEP_BACK(encode, str, s, end, (
int )tlen);
4017 STACK_PUSH_LOOK_BEHIND_NOT(p + addr, s, sprev, pkeep);
4019 sprev = (UChar* )onigenc_get_prev_char_head(encode, str, s, end);
4024 CASE(OP_FAIL_LOOK_BEHIND_NOT) MOP_IN(OP_FAIL_LOOK_BEHIND_NOT);
4025 STACK_POP_TIL_LOOK_BEHIND_NOT;
4028 CASE(OP_PUSH_ABSENT_POS) MOP_IN(OP_PUSH_ABSENT_POS);
4030 STACK_PUSH_ABSENT_POS(s, ABSENT_END_POS);
4034 CASE(OP_ABSENT) MOP_IN(OP_ABSENT);
4036 const UChar* aend = ABSENT_END_POS;
4038 UChar* selfp = p - 1;
4040 STACK_POP_ABSENT_POS(absent, ABSENT_END_POS);
4041 GET_RELADDR_INC(addr, p);
4042#ifdef ONIG_DEBUG_MATCH
4043 fprintf(stderr,
"ABSENT: s:%p, end:%p, absent:%p, aend:%p\n", s, end, absent, aend);
4045 if ((absent > aend) && (s > absent)) {
4051 else if ((s >= aend) && (s > absent)) {
4061 else if (s == end) {
4067 STACK_PUSH_ALT(p + addr, s, sprev, pkeep);
4068 n = enclen(encode, s, end);
4069 STACK_PUSH_ABSENT_POS(absent, ABSENT_END_POS);
4070 STACK_PUSH_ALT(selfp, s + n, s, pkeep);
4072 ABSENT_END_POS = aend;
4078 CASE(OP_ABSENT_END) MOP_IN(OP_ABSENT_END);
4081 if (sprev < ABSENT_END_POS)
4082 ABSENT_END_POS = sprev;
4083#ifdef ONIG_DEBUG_MATCH
4084 fprintf(stderr,
"ABSENT_END: end:%p\n", ABSENT_END_POS);
4086 STACK_POP_TIL_ABSENT;
4089#ifdef USE_SUBEXP_CALL
4090 CASE(OP_CALL) MOP_IN(OP_CALL);
4091 GET_ABSADDR_INC(addr, p);
4092 STACK_PUSH_CALL_FRAME(p);
4097 CASE(OP_RETURN) MOP_IN(OP_RETURN);
4104 CASE(OP_CONDITION) MOP_IN(OP_CONDITION);
4105 GET_MEMNUM_INC(mem, p);
4106 GET_RELADDR_INC(addr, p);
4107 if ((mem > num_mem) ||
4108 (mem_end_stk[mem] == INVALID_STACK_INDEX) ||
4109 (mem_start_stk[mem] == INVALID_STACK_INDEX)) {
4126 p = stk->u.state.pcode;
4127 s = stk->u.state.pstr;
4128 sprev = stk->u.state.pstr_prev;
4129 pkeep = stk->u.state.pkeep;
4131#ifdef USE_MATCH_CACHE
4133 msa->match_cache_status != MATCH_CACHE_STATUS_DISABLED &&
4134 ++msa->num_fails >= (OnigPosition)(end - str) * msa->num_cache_opcodes
4136 if (msa->match_cache_status == MATCH_CACHE_STATUS_UNINIT) {
4137 msa->match_cache_status = MATCH_CACHE_STATUS_INIT;
4138 OnigPosition r = count_num_cache_opcodes(reg, &msa->num_cache_opcodes);
4139 if (r < 0)
goto bytecode_error;
4141 if (msa->num_cache_opcodes == NUM_CACHE_OPCODES_IMPOSSIBLE || msa->num_cache_opcodes == 0) {
4142 msa->match_cache_status = MATCH_CACHE_STATUS_DISABLED;
4143 goto fail_match_cache;
4145 if (msa->num_fails < (OnigPosition)(end - str) * msa->num_cache_opcodes) {
4146 goto fail_match_cache;
4148 if (msa->cache_opcodes == NULL) {
4149 msa->match_cache_status = MATCH_CACHE_STATUS_ENABLED;
4151 if (cache_opcodes == NULL) {
4154 OnigPosition r = init_cache_opcodes(reg, cache_opcodes, &msa->num_cache_points);
4156 if (r == ONIGERR_UNEXPECTED_BYTECODE)
goto unexpected_bytecode_error;
4157 else goto bytecode_error;
4159 msa->cache_opcodes = cache_opcodes;
4160#ifdef ONIG_DEBUG_MATCH_CACHE
4161 fprintf(stderr,
"MATCH CACHE: #cache opcodes = %ld\n", msa->num_cache_opcodes);
4162 fprintf(stderr,
"MATCH CACHE: #cache points = %ld\n", msa->num_cache_points);
4163 fprintf(stderr,
"MATCH CACHE: cache opcodes (%p):\n", msa->cache_opcodes);
4164 for (
int i = 0; i < msa->num_cache_opcodes; i++) {
4165 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);
4169 if (msa->match_cache_buf == NULL) {
4170 size_t length = (end - str) + 1;
4171 size_t num_match_cache_points = (size_t)msa->num_cache_points * length;
4172#ifdef ONIG_DEBUG_MATCH_CACHE
4173 fprintf(stderr,
"MATCH CACHE: #match cache points = %zu (length = %zu)\n", num_match_cache_points, length);
4176 if (num_match_cache_points / length != (
size_t)msa->num_cache_points) {
4179 if (num_match_cache_points >= (
size_t)PTRDIFF_MAX) {
4182 size_t match_cache_buf_length = (num_match_cache_points >> 3) + (num_match_cache_points & 7 ? 1 : 0) + 1;
4183 uint8_t* match_cache_buf = (uint8_t*)
xmalloc(match_cache_buf_length *
sizeof(uint8_t));
4184 if (match_cache_buf == NULL) {
4187 xmemset(match_cache_buf, 0, match_cache_buf_length *
sizeof(uint8_t));
4188 msa->match_cache_buf = match_cache_buf;
4194#ifdef USE_COMBINATION_EXPLOSION_CHECK
4195 if (stk->u.state.state_check != 0) {
4196 stk->type = STK_STATE_CHECK_MARK;
4202 CHECK_INTERRUPT_IN_MATCH_AT;
4206 goto bytecode_error;
4211 xfree(xmalloc_base);
4217 xfree(xmalloc_base);
4218 return ONIGERR_STACK_BUG;
4223 xfree(xmalloc_base);
4224 return ONIGERR_UNDEFINED_BYTECODE;
4226 unexpected_bytecode_error:
4228 xfree(xmalloc_base);
4229 return ONIGERR_UNEXPECTED_BYTECODE;
4233 xfree(xmalloc_base);
4234 return ONIGERR_TIMEOUT;
4236#ifdef USE_MATCH_CACHE
4239 xfree(xmalloc_base);
4240 return ONIGERR_MEMORY;
4246slow_search(OnigEncoding enc, UChar* target, UChar* target_end,
4247 const UChar* text,
const UChar* text_end, UChar* text_range)
4249 UChar *t, *p, *s, *end;
4251 end = (UChar* )text_end;
4252 end -= target_end - target - 1;
4253 if (end > text_range)
4258 if (enc->max_enc_len == enc->min_enc_len) {
4259 int n = enc->max_enc_len;
4262 if (*s == *target) {
4265 if (target_end == t || memcmp(t, p, target_end - t) == 0)
4270 return (UChar* )NULL;
4273 if (*s == *target) {
4276 if (target_end == t || memcmp(t, p, target_end - t) == 0)
4279 s += enclen(enc, s, text_end);
4282 return (UChar* )NULL;
4286str_lower_case_match(OnigEncoding enc,
int case_fold_flag,
4287 const UChar* t,
const UChar* tend,
4288 const UChar* p,
const UChar* end)
4291 UChar *q, lowbuf[ONIGENC_MBC_CASE_FOLD_MAXLEN];
4294 lowlen = ONIGENC_MBC_CASE_FOLD(enc, case_fold_flag, &p, end, lowbuf);
4295 if (tend - t < lowlen)
return 0;
4297 while (lowlen > 0) {
4298 if (*t++ != *q++)
return 0;
4307slow_search_ic(OnigEncoding enc,
int case_fold_flag,
4308 UChar* target, UChar* target_end,
4309 const UChar* text,
const UChar* text_end, UChar* text_range)
4313 end = (UChar* )text_end;
4314 end -= target_end - target - 1;
4315 if (end > text_range)
4321 if (str_lower_case_match(enc, case_fold_flag, target, target_end,
4325 s += enclen(enc, s, text_end);
4328 return (UChar* )NULL;
4332slow_search_backward(OnigEncoding enc, UChar* target, UChar* target_end,
4333 const UChar* text,
const UChar* adjust_text,
4334 const UChar* text_end,
const UChar* text_start)
4338 s = (UChar* )text_end;
4339 s -= (target_end - target);
4341 s = (UChar* )text_start;
4343 s = ONIGENC_LEFT_ADJUST_CHAR_HEAD(enc, adjust_text, s, text_end);
4346 if (*s == *target) {
4349 while (t < target_end) {
4354 if (t == target_end)
4357 s = (UChar* )onigenc_get_prev_char_head(enc, adjust_text, s, text_end);
4360 return (UChar* )NULL;
4364slow_search_backward_ic(OnigEncoding enc,
int case_fold_flag,
4365 UChar* target, UChar* target_end,
4366 const UChar* text,
const UChar* adjust_text,
4367 const UChar* text_end,
const UChar* text_start)
4371 s = (UChar* )text_end;
4372 s -= (target_end - target);
4374 s = (UChar* )text_start;
4376 s = ONIGENC_LEFT_ADJUST_CHAR_HEAD(enc, adjust_text, s, text_end);
4379 if (str_lower_case_match(enc, case_fold_flag,
4380 target, target_end, s, text_end))
4383 s = (UChar* )onigenc_get_prev_char_head(enc, adjust_text, s, text_end);
4386 return (UChar* )NULL;
4391bm_search_notrev(regex_t* reg,
const UChar* target,
const UChar* target_end,
4392 const UChar* text,
const UChar* text_end,
4393 const UChar* text_range)
4395 const UChar *s, *se, *t, *p, *end;
4397 ptrdiff_t skip, tlen1;
4398 OnigEncoding enc = reg->enc;
4400# ifdef ONIG_DEBUG_SEARCH
4401 fprintf(stderr,
"bm_search_notrev: text: %"PRIuPTR
" (%p), text_end: %"PRIuPTR
" (%p), text_range: %"PRIuPTR
" (%p)\n",
4402 (uintptr_t )text, text, (uintptr_t )text_end, text_end, (uintptr_t )text_range, text_range);
4405 tail = target_end - 1;
4406 tlen1 = tail - target;
4408 if (end + tlen1 > text_end)
4409 end = text_end - tlen1;
4417 if (t == target)
return (UChar* )s;
4420 if (s + 1 >= end)
break;
4421 skip = reg->map[se[1]];
4424 s += enclen(enc, s, end);
4425 }
while ((s - t) < skip && s < end);
4428 return (UChar* )NULL;
4433bm_search(regex_t* reg,
const UChar* target,
const UChar* target_end,
4434 const UChar* text,
const UChar* text_end,
const UChar* text_range)
4436 const UChar *s, *t, *p, *end;
4440# ifdef ONIG_DEBUG_SEARCH
4441 fprintf(stderr,
"bm_search: text: %"PRIuPTR
" (%p), text_end: %"PRIuPTR
" (%p), text_range: %"PRIuPTR
" (%p)\n",
4442 (uintptr_t )text, text, (uintptr_t )text_end, text_end, (uintptr_t )text_range, text_range);
4445 tail = target_end - 1;
4446 tlen1 = tail - target;
4447 end = text_range + tlen1;
4456 if (t == target)
return (UChar* )p;
4459 if (s + 1 >= end)
break;
4460 s += reg->map[s[1]];
4463 return (UChar* )NULL;
4468bm_search_notrev_ic(regex_t* reg,
const UChar* target,
const UChar* target_end,
4469 const UChar* text,
const UChar* text_end,
4470 const UChar* text_range)
4472 const UChar *s, *se, *t, *end;
4474 ptrdiff_t skip, tlen1;
4475 OnigEncoding enc = reg->enc;
4476 int case_fold_flag = reg->case_fold_flag;
4478# ifdef ONIG_DEBUG_SEARCH
4479 fprintf(stderr,
"bm_search_notrev_ic: text: %"PRIuPTR
" (%p), text_end: %"PRIuPTR
" (%p), text_range: %"PRIuPTR
" (%p)\n",
4480 (uintptr_t )text, text, (uintptr_t )text_end, text_end, (uintptr_t )text_range, text_range);
4483 tail = target_end - 1;
4484 tlen1 = tail - target;
4486 if (end + tlen1 > text_end)
4487 end = text_end - tlen1;
4493 if (str_lower_case_match(enc, case_fold_flag, target, target_end,
4496 if (s + 1 >= end)
break;
4497 skip = reg->map[se[1]];
4500 s += enclen(enc, s, end);
4501 }
while ((s - t) < skip && s < end);
4504 return (UChar* )NULL;
4509bm_search_ic(regex_t* reg,
const UChar* target,
const UChar* target_end,
4510 const UChar* text,
const UChar* text_end,
const UChar* text_range)
4512 const UChar *s, *p, *end;
4515 OnigEncoding enc = reg->enc;
4516 int case_fold_flag = reg->case_fold_flag;
4518# ifdef ONIG_DEBUG_SEARCH
4519 fprintf(stderr,
"bm_search_ic: text: %"PRIuPTR
" (%p), text_end: %"PRIuPTR
" (%p), text_range: %"PRIuPTR
" (%p)\n",
4520 (uintptr_t )text, text, (uintptr_t )text_end, text_end, (uintptr_t )text_range, text_range);
4523 tail = target_end - 1;
4524 tlen1 = tail - target;
4525 end = text_range + tlen1;
4532 if (str_lower_case_match(enc, case_fold_flag, target, target_end,
4535 if (s + 1 >= end)
break;
4536 s += reg->map[s[1]];
4539 return (UChar* )NULL;
4543map_search(OnigEncoding enc, UChar map[],
4544 const UChar* text,
const UChar* text_range,
const UChar* text_end)
4546 const UChar *s = text;
4548 while (s < text_range) {
4549 if (map[*s])
return (UChar* )s;
4551 s += enclen(enc, s, text_end);
4553 return (UChar* )NULL;
4557map_search_backward(OnigEncoding enc, UChar map[],
4558 const UChar* text,
const UChar* adjust_text,
4559 const UChar* text_start,
const UChar* text_end)
4561 const UChar *s = text_start;
4564 if (map[*s])
return (UChar* )s;
4566 s = onigenc_get_prev_char_head(enc, adjust_text, s, text_end);
4568 return (UChar* )NULL;
4572onig_match(regex_t* reg,
const UChar* str,
const UChar* end,
const UChar* at, OnigRegion* region,
4573 OnigOptionType option)
4579 MATCH_ARG_INIT(msa, option, region, at, at);
4580#ifdef USE_COMBINATION_EXPLOSION_CHECK
4582 ptrdiff_t offset = at - str;
4583 STATE_CHECK_BUFF_INIT(msa, end - str, offset, reg->num_comb_exp_check);
4588 r = onig_region_resize_clear(region, reg->num_mem + 1);
4594 prev = (UChar* )onigenc_get_prev_char_head(reg->enc, str, at, end);
4595 r = match_at(reg, str, end,
4596#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
4602 MATCH_ARG_FREE(msa);
4607forward_search_range(regex_t* reg,
const UChar* str,
const UChar* end, UChar* s,
4608 UChar* range, UChar** low, UChar** high, UChar** low_prev)
4610 UChar *p, *pprev = (UChar* )NULL;
4611 size_t input_len = end - str;
4613#ifdef ONIG_DEBUG_SEARCH
4614 fprintf(stderr,
"forward_search_range: str: %"PRIuPTR
" (%p), end: %"PRIuPTR
" (%p), s: %"PRIuPTR
" (%p), range: %"PRIuPTR
" (%p)\n",
4615 (uintptr_t )str, str, (uintptr_t )end, end, (uintptr_t )s, s, (uintptr_t )range, range);
4618 if (reg->dmin > input_len) {
4623 if (reg->dmin != 0) {
4624 if ((OnigDistance)(end - p) <= reg->dmin)
return 0;
4625 if (ONIGENC_IS_SINGLEBYTE(reg->enc)) {
4629 UChar *q = p + reg->dmin;
4631 while (p < q) p += enclen(reg->enc, p, end);
4636 switch (reg->optimize) {
4637 case ONIG_OPTIMIZE_EXACT:
4638 p = slow_search(reg->enc, reg->exact, reg->exact_end, p, end, range);
4640 case ONIG_OPTIMIZE_EXACT_IC:
4641 p = slow_search_ic(reg->enc, reg->case_fold_flag,
4642 reg->exact, reg->exact_end, p, end, range);
4645 case ONIG_OPTIMIZE_EXACT_BM:
4646 p = bm_search(reg, reg->exact, reg->exact_end, p, end, range);
4649 case ONIG_OPTIMIZE_EXACT_BM_NOT_REV:
4650 p = bm_search_notrev(reg, reg->exact, reg->exact_end, p, end, range);
4653 case ONIG_OPTIMIZE_EXACT_BM_IC:
4654 p = bm_search_ic(reg, reg->exact, reg->exact_end, p, end, range);
4657 case ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC:
4658 p = bm_search_notrev_ic(reg, reg->exact, reg->exact_end, p, end, range);
4661 case ONIG_OPTIMIZE_MAP:
4662 p = map_search(reg->enc, reg->map, p, range, end);
4666 if (p && p < range) {
4667 if ((OnigDistance)(p - s) < reg->dmin) {
4670 p += enclen(reg->enc, p, end);
4674 if (reg->sub_anchor) {
4677 switch (reg->sub_anchor) {
4678 case ANCHOR_BEGIN_LINE:
4679 if (!ON_STR_BEGIN(p)) {
4680 prev = onigenc_get_prev_char_head(reg->enc,
4681 (pprev ? pprev : str), p, end);
4682 if (!ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 0))
4687 case ANCHOR_END_LINE:
4688 if (ON_STR_END(p)) {
4689#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
4690 prev = (UChar* )onigenc_get_prev_char_head(reg->enc,
4691 (pprev ? pprev : str), p);
4692 if (prev && ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 1))
4696 else if (! ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, p, str, end, reg->options, 1))
4702 if (reg->dmax == 0) {
4706 *low_prev = onigenc_get_prev_char_head(reg->enc, s, p, end);
4708 *low_prev = onigenc_get_prev_char_head(reg->enc,
4709 (pprev ? pprev : str), p, end);
4714 if (reg->dmax != ONIG_INFINITE_DISTANCE) {
4715 if ((OnigDistance)(p - str) < reg->dmax) {
4716 *low = (UChar* )str;
4718 *low_prev = onigenc_get_prev_char_head(reg->enc, str, *low, end);
4721 *low = p - reg->dmax;
4723 *low = onigenc_get_right_adjust_char_head_with_prev(reg->enc, s,
4724 *low, end, (
const UChar** )low_prev);
4725 if (low_prev && IS_NULL(*low_prev))
4726 *low_prev = onigenc_get_prev_char_head(reg->enc, s, *low, end);
4730 *low_prev = onigenc_get_prev_char_head(reg->enc,
4731 (pprev ? pprev : str), *low, end);
4736 if ((OnigDistance)(p - str) < reg->dmin)
4737 *high = (UChar* )str;
4739 *high = p - reg->dmin;
4742#ifdef ONIG_DEBUG_SEARCH
4744 "forward_search_range success: low: %"PRIdPTR
", high: %"PRIdPTR
", dmin: %"PRIdPTR
", dmax: %"PRIdPTR
"\n",
4745 *low - str, *high - str, reg->dmin, reg->dmax);
4753#define BM_BACKWARD_SEARCH_LENGTH_THRESHOLD 100
4756backward_search_range(regex_t* reg,
const UChar* str,
const UChar* end,
4757 UChar* s,
const UChar* range, UChar* adjrange,
4758 UChar** low, UChar** high)
4761 size_t input_len = end - str;
4763 if (reg->dmin > input_len) {
4770 switch (reg->optimize) {
4771 case ONIG_OPTIMIZE_EXACT:
4773 p = slow_search_backward(reg->enc, reg->exact, reg->exact_end,
4774 range, adjrange, end, p);
4777 case ONIG_OPTIMIZE_EXACT_IC:
4778 case ONIG_OPTIMIZE_EXACT_BM_IC:
4779 case ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC:
4780 p = slow_search_backward_ic(reg->enc, reg->case_fold_flag,
4781 reg->exact, reg->exact_end,
4782 range, adjrange, end, p);
4785 case ONIG_OPTIMIZE_EXACT_BM:
4786 case ONIG_OPTIMIZE_EXACT_BM_NOT_REV:
4790 case ONIG_OPTIMIZE_MAP:
4791 p = map_search_backward(reg->enc, reg->map, range, adjrange, p, end);
4796 if (reg->sub_anchor) {
4799 switch (reg->sub_anchor) {
4800 case ANCHOR_BEGIN_LINE:
4801 if (!ON_STR_BEGIN(p)) {
4802 prev = onigenc_get_prev_char_head(reg->enc, str, p, end);
4803 if (!ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 0)) {
4810 case ANCHOR_END_LINE:
4811 if (ON_STR_END(p)) {
4812#ifndef USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE
4813 prev = onigenc_get_prev_char_head(reg->enc, adjrange, p);
4814 if (IS_NULL(prev))
goto fail;
4815 if (ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 1)) {
4821 else if (! ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, p, str, end, reg->options, 1)) {
4822 p = onigenc_get_prev_char_head(reg->enc, adjrange, p, end);
4823 if (IS_NULL(p))
goto fail;
4830 if (reg->dmax != ONIG_INFINITE_DISTANCE) {
4831 if ((OnigDistance)(p - str) < reg->dmax)
4832 *low = (UChar* )str;
4834 *low = p - reg->dmax;
4836 if (reg->dmin != 0) {
4837 if ((OnigDistance)(p - str) < reg->dmin)
4838 *high = (UChar* )str;
4840 *high = p - reg->dmin;
4846 *high = onigenc_get_right_adjust_char_head(reg->enc, adjrange, *high, end);
4849#ifdef ONIG_DEBUG_SEARCH
4850 fprintf(stderr,
"backward_search_range: low: %d, high: %d\n",
4851 (
int )(*low - str), (
int )(*high - str));
4857#ifdef ONIG_DEBUG_SEARCH
4858 fprintf(stderr,
"backward_search_range: fail.\n");
4865onig_search(regex_t* reg,
const UChar* str,
const UChar* end,
4866 const UChar* start,
const UChar* range, OnigRegion* region, OnigOptionType option)
4868 return onig_search_gpos(reg, str, end, start, start, range, region, option);
4872onig_search_gpos(regex_t* reg,
const UChar* str,
const UChar* end,
4873 const UChar* global_pos,
4874 const UChar* start,
const UChar* range, OnigRegion* region, OnigOptionType option)
4879#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
4880 const UChar *orig_start = start;
4881 const UChar *orig_range = range;
4884#ifdef ONIG_DEBUG_SEARCH
4886 "onig_search (entry point): str: %"PRIuPTR
" (%p), end: %"PRIuPTR
", start: %"PRIuPTR
", range: %"PRIuPTR
"\n",
4887 (uintptr_t )str, str, end - str, start - str, range - str);
4891 r = onig_region_resize_clear(region, reg->num_mem + 1);
4892 if (r)
goto finish_no_msa;
4895 if (start > end || start < str)
goto mismatch_no_msa;
4898#ifdef USE_MATCH_RANGE_MUST_BE_INSIDE_OF_SPECIFIED_RANGE
4899# ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
4900# define MATCH_AND_RETURN_CHECK(upper_range) \
4901 r = match_at(reg, str, end, (upper_range), s, prev, &msa); \
4903 case ONIG_MISMATCH: \
4905 case ONIGERR_TIMEOUT: \
4909 if (! IS_FIND_LONGEST(reg->options)) { \
4916# define MATCH_AND_RETURN_CHECK(upper_range) \
4917 r = match_at(reg, str, end, (upper_range), s, prev, &msa); \
4919 case ONIG_MISMATCH: \
4921 case ONIGERR_TIMEOUT: \
4931# ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
4932# define MATCH_AND_RETURN_CHECK(none) \
4933 r = match_at(reg, str, end, s, prev, &msa);\
4935 case ONIG_MISMATCH: \
4937 case ONIGERR_TIMEOUT: \
4941 if (! IS_FIND_LONGEST(reg->options)) { \
4948# define MATCH_AND_RETURN_CHECK(none) \
4949 r = match_at(reg, str, end, s, prev, &msa);\
4951 case ONIG_MISMATCH: \
4953 case ONIGERR_TIMEOUT: \
4966 if (reg->anchor != 0 && str < end) {
4967 UChar *min_semi_end, *max_semi_end;
4969 if (reg->anchor & ANCHOR_BEGIN_POSITION) {
4974 if (global_pos > start)
4976 if (global_pos < range)
4977 range = global_pos + 1;
4985 else if (reg->anchor & ANCHOR_BEGIN_BUF) {
4987 if (range > start) {
4988 if (start != str)
goto mismatch_no_msa;
4997 goto mismatch_no_msa;
5000 else if (reg->anchor & ANCHOR_END_BUF) {
5001 min_semi_end = max_semi_end = (UChar* )end;
5004 if ((OnigDistance)(max_semi_end - str) < reg->anchor_dmin)
5005 goto mismatch_no_msa;
5007 if (range > start) {
5008 if ((OnigDistance)(min_semi_end - start) > reg->anchor_dmax) {
5009 start = min_semi_end - reg->anchor_dmax;
5011 start = onigenc_get_right_adjust_char_head(reg->enc, str, start, end);
5013 if ((OnigDistance)(max_semi_end - (range - 1)) < reg->anchor_dmin) {
5014 if ((OnigDistance)(max_semi_end - str + 1) < reg->anchor_dmin)
5015 goto mismatch_no_msa;
5017 range = max_semi_end - reg->anchor_dmin + 1;
5018 if (start >= range)
goto mismatch_no_msa;
5021 if (start > range)
goto mismatch_no_msa;
5026 if ((OnigDistance)(min_semi_end - range) > reg->anchor_dmax) {
5027 range = min_semi_end - reg->anchor_dmax;
5029 if ((OnigDistance)(max_semi_end - start) < reg->anchor_dmin) {
5030 if ((OnigDistance)(max_semi_end - str) < reg->anchor_dmin)
5031 goto mismatch_no_msa;
5033 start = max_semi_end - reg->anchor_dmin;
5034 start = ONIGENC_LEFT_ADJUST_CHAR_HEAD(reg->enc, str, start, end);
5037 if (range > start)
goto mismatch_no_msa;
5040 else if (reg->anchor & ANCHOR_SEMI_END_BUF) {
5041 UChar* pre_end = ONIGENC_STEP_BACK(reg->enc, str, end, end, 1);
5043 max_semi_end = (UChar* )end;
5044 if (ONIGENC_IS_MBC_NEWLINE(reg->enc, pre_end, end)) {
5045 min_semi_end = pre_end;
5047#ifdef USE_CRNL_AS_LINE_TERMINATOR
5048 pre_end = ONIGENC_STEP_BACK(reg->enc, str, pre_end, end, 1);
5049 if (IS_NOT_NULL(pre_end) &&
5050 IS_NEWLINE_CRLF(reg->options) &&
5051 ONIGENC_IS_MBC_CRNL(reg->enc, pre_end, end)) {
5052 min_semi_end = pre_end;
5055 if (min_semi_end > str && start <= min_semi_end) {
5060 min_semi_end = (UChar* )end;
5064 else if ((reg->anchor & ANCHOR_ANYCHAR_STAR_ML) && range > start) {
5065 goto begin_position;
5068 else if (str == end) {
5069 static const UChar address_for_empty_string[] =
"";
5071#ifdef ONIG_DEBUG_SEARCH
5072 fprintf(stderr,
"onig_search: empty string.\n");
5075 if (reg->threshold_len == 0) {
5076 start = end = str = address_for_empty_string;
5078 prev = (UChar* )NULL;
5080 MATCH_ARG_INIT(msa, option, region, start, start);
5081#ifdef USE_COMBINATION_EXPLOSION_CHECK
5082 msa.state_check_buff = (
void* )0;
5083 msa.state_check_buff_size = 0;
5085 MATCH_AND_RETURN_CHECK(end);
5088 goto mismatch_no_msa;
5091#ifdef ONIG_DEBUG_SEARCH
5092 fprintf(stderr,
"onig_search(apply anchor): end: %d, start: %d, range: %d\n",
5093 (
int )(end - str), (
int )(start - str), (
int )(range - str));
5096 MATCH_ARG_INIT(msa, option, region, start, global_pos);
5097#ifdef USE_COMBINATION_EXPLOSION_CHECK
5099 ptrdiff_t offset = (MIN(start, range) - str);
5100 STATE_CHECK_BUFF_INIT(msa, end - str, offset, reg->num_comb_exp_check);
5105 if (range > start) {
5107 prev = onigenc_get_prev_char_head(reg->enc, str, s, end);
5109 prev = (UChar* )NULL;
5111 if (reg->optimize != ONIG_OPTIMIZE_NONE) {
5112 UChar *sch_range, *low, *high, *low_prev;
5114 if (reg->dmax != 0) {
5115 if (reg->dmax == ONIG_INFINITE_DISTANCE)
5116 sch_range = (UChar* )end;
5118 if ((OnigDistance)(end - range) < reg->dmax)
5119 sch_range = (UChar* )end;
5121 sch_range = (UChar* )range + reg->dmax;
5126 sch_range = (UChar* )range;
5128 if ((end - start) < reg->threshold_len)
5131 if (reg->dmax != ONIG_INFINITE_DISTANCE) {
5133 if (! forward_search_range(reg, str, end, s, sch_range,
5134 &low, &high, &low_prev))
goto mismatch;
5140 MATCH_AND_RETURN_CHECK(orig_range);
5142 s += enclen(reg->enc, s, end);
5144 }
while (s < range);
5148 if (! forward_search_range(reg, str, end, s, sch_range,
5149 &low, &high, (UChar** )NULL))
goto mismatch;
5151 if ((reg->anchor & ANCHOR_ANYCHAR_STAR) != 0) {
5153 MATCH_AND_RETURN_CHECK(orig_range);
5155 s += enclen(reg->enc, s, end);
5157 if ((reg->anchor & (ANCHOR_LOOK_BEHIND | ANCHOR_PREC_READ_NOT)) == 0) {
5158 while (!ONIGENC_IS_MBC_NEWLINE_EX(reg->enc, prev, str, end, reg->options, 0)
5161 s += enclen(reg->enc, s, end);
5164 }
while (s < range);
5171 MATCH_AND_RETURN_CHECK(orig_range);
5173 s += enclen(reg->enc, s, end);
5174 }
while (s < range);
5177 MATCH_AND_RETURN_CHECK(orig_range);
5181 if (reg->optimize != ONIG_OPTIMIZE_NONE) {
5182 UChar *low, *high, *adjrange, *sch_start;
5183 const UChar *min_range;
5186 adjrange = ONIGENC_LEFT_ADJUST_CHAR_HEAD(reg->enc, str, range, end);
5188 adjrange = (UChar* )end;
5190 if ((OnigDistance)(end - range) > reg->dmin)
5191 min_range = range + reg->dmin;
5195 if (reg->dmax != ONIG_INFINITE_DISTANCE &&
5196 end - range >= reg->threshold_len) {
5198 if ((OnigDistance)(end - s) > reg->dmax)
5199 sch_start = s + reg->dmax;
5201 sch_start = (UChar* )end;
5203 if (backward_search_range(reg, str, end, sch_start, min_range, adjrange,
5211 prev = onigenc_get_prev_char_head(reg->enc, str, s, end);
5212 MATCH_AND_RETURN_CHECK(orig_start);
5215 }
while (s >= range);
5219 if (end - range < reg->threshold_len)
goto mismatch;
5221 if (reg->dmax != 0) {
5222 if (reg->dmax == ONIG_INFINITE_DISTANCE)
5223 sch_start = (UChar* )end;
5225 if ((OnigDistance)(end - s) > reg->dmax) {
5226 sch_start = s + reg->dmax;
5227 sch_start = ONIGENC_LEFT_ADJUST_CHAR_HEAD(reg->enc,
5228 start, sch_start, end);
5230 sch_start = (UChar* )end;
5234 sch_start = (UChar* )s;
5236 if (backward_search_range(reg, str, end, sch_start, min_range, adjrange,
5237 &low, &high) <= 0)
goto mismatch;
5242 prev = onigenc_get_prev_char_head(reg->enc, str, s, end);
5243 MATCH_AND_RETURN_CHECK(orig_start);
5245 }
while (s >= range);
5249#ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
5250 if (IS_FIND_LONGEST(reg->options)) {
5251 if (msa.best_len >= 0) {
5260 MATCH_ARG_FREE(msa);
5264 if (IS_FIND_NOT_EMPTY(reg->options) && region) {
5265 onig_region_clear(region);
5269 if (r != ONIG_MISMATCH)
5270 fprintf(stderr,
"onig_search: error %"PRIdPTRDIFF
"\n", r);
5278 if (r != ONIG_MISMATCH)
5279 fprintf(stderr,
"onig_search: error %"PRIdPTRDIFF
"\n", r);
5284 MATCH_ARG_FREE(msa);
5288 MATCH_ARG_FREE(msa);
5289 return ONIGERR_TIMEOUT;
5293onig_scan(regex_t* reg,
const UChar* str,
const UChar* end,
5294 OnigRegion* region, OnigOptionType option,
5295 int (*scan_callback)(OnigPosition, OnigPosition, OnigRegion*,
void*),
5306 r = onig_search(reg, str, end, start, end, region, option);
5308 rs = scan_callback(n, r, region, callback_arg);
5313 if (region->end[0] == start - str) {
5314 if (start >= end)
break;
5315 start += enclen(reg->enc, start, end);
5318 start = str + region->end[0];
5323 else if (r == ONIG_MISMATCH) {
5335onig_get_encoding(
const regex_t* reg)
5340extern OnigOptionType
5341onig_get_options(
const regex_t* reg)
5343 return reg->options;
5346extern OnigCaseFoldType
5347onig_get_case_fold_flag(
const regex_t* reg)
5349 return reg->case_fold_flag;
5353onig_get_syntax(
const regex_t* reg)
5359onig_number_of_captures(
const regex_t* reg)
5361 return reg->num_mem;
5365onig_number_of_capture_histories(
const regex_t* reg)
5367#ifdef USE_CAPTURE_HISTORY
5371 for (i = 0; i <= ONIG_MAX_CAPTURE_HISTORY_GROUP; i++) {
5372 if (BIT_STATUS_AT(reg->capture_history, i) != 0)
5382onig_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.