Ruby 4.0.10p0 (2026-11-19 revision a704b7cd95a42cc0cf5f307137bf3aac0285b915)
regparse.c
1/**********************************************************************
2 regparse.c - Onigmo (Oniguruma-mod) (regular expression library)
3**********************************************************************/
4/*-
5 * Copyright (c) 2002-2008 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
6 * Copyright (c) 2011-2016 K.Takata <kentkt AT csc DOT jp>
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 * SUCH DAMAGE.
29 */
30
31// Suppress some false-positive compiler warnings
32#if defined(__GNUC__) && __GNUC__ >= 12
33#pragma GCC diagnostic ignored "-Warray-bounds"
34#pragma GCC diagnostic ignored "-Wstringop-overflow"
35#pragma GCC diagnostic ignored "-Wrestrict"
36#endif
37
38#include "regparse.h"
39#include <stdarg.h>
40#include "internal/sanitizers.h"
41
42#define WARN_BUFSIZE 256
43
44#define CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
45
46
47const OnigSyntaxType OnigSyntaxRuby = {
48 (( SYN_GNU_REGEX_OP | ONIG_SYN_OP_QMARK_NON_GREEDY |
49 ONIG_SYN_OP_ESC_OCTAL3 | ONIG_SYN_OP_ESC_X_HEX2 |
50 ONIG_SYN_OP_ESC_X_BRACE_HEX8 | ONIG_SYN_OP_ESC_CONTROL_CHARS |
51 ONIG_SYN_OP_ESC_C_CONTROL )
52 & ~ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END )
53 , ( ONIG_SYN_OP2_QMARK_GROUP_EFFECT |
54 ONIG_SYN_OP2_OPTION_RUBY |
55 ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP | ONIG_SYN_OP2_ESC_K_NAMED_BACKREF |
56 ONIG_SYN_OP2_ESC_G_SUBEXP_CALL |
57 ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY |
58 ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT |
59 ONIG_SYN_OP2_PLUS_POSSESSIVE_REPEAT |
60 ONIG_SYN_OP2_CCLASS_SET_OP | ONIG_SYN_OP2_ESC_CAPITAL_C_BAR_CONTROL |
61 ONIG_SYN_OP2_ESC_CAPITAL_M_BAR_META | ONIG_SYN_OP2_ESC_V_VTAB |
62 ONIG_SYN_OP2_ESC_H_XDIGIT |
63#ifndef RUBY
64 ONIG_SYN_OP2_ESC_U_HEX4 |
65#endif
66 ONIG_SYN_OP2_ESC_CAPITAL_X_EXTENDED_GRAPHEME_CLUSTER |
67 ONIG_SYN_OP2_QMARK_LPAREN_CONDITION |
68 ONIG_SYN_OP2_ESC_CAPITAL_R_LINEBREAK |
69 ONIG_SYN_OP2_ESC_CAPITAL_K_KEEP |
70 ONIG_SYN_OP2_QMARK_TILDE_ABSENT )
71 , ( SYN_GNU_REGEX_BV |
72 ONIG_SYN_ALLOW_INTERVAL_LOW_ABBREV |
73 ONIG_SYN_DIFFERENT_LEN_ALT_LOOK_BEHIND |
74 ONIG_SYN_CAPTURE_ONLY_NAMED_GROUP |
75 ONIG_SYN_ALLOW_MULTIPLEX_DEFINITION_NAME |
76 ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY |
77 ONIG_SYN_WARN_CC_OP_NOT_ESCAPED |
78 ONIG_SYN_WARN_CC_DUP |
79 ONIG_SYN_WARN_REDUNDANT_NESTED_REPEAT )
80 , ( ONIG_OPTION_ASCII_RANGE | ONIG_OPTION_POSIX_BRACKET_ALL_RANGE |
81 ONIG_OPTION_WORD_BOUND_ALL_RANGE )
82 ,
83 {
84 (OnigCodePoint )'\\' /* esc */
85 , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* anychar '.' */
86 , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* anytime '*' */
87 , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* zero or one time '?' */
88 , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* one or more time '+' */
89 , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* anychar anytime */
90 }
91};
92
93const OnigSyntaxType* OnigDefaultSyntax = ONIG_SYNTAX_RUBY;
94
95extern void onig_null_warn(const char* s ARG_UNUSED) { }
96
97#ifdef DEFAULT_WARN_FUNCTION
98static OnigWarnFunc onig_warn = (OnigWarnFunc )DEFAULT_WARN_FUNCTION;
99#else
100static OnigWarnFunc onig_warn = onig_null_warn;
101#endif
102
103#ifdef DEFAULT_VERB_WARN_FUNCTION
104static OnigWarnFunc onig_verb_warn = (OnigWarnFunc )DEFAULT_VERB_WARN_FUNCTION;
105#else
106static OnigWarnFunc onig_verb_warn = onig_null_warn;
107#endif
108
109extern void onig_set_warn_func(OnigWarnFunc f)
110{
111 onig_warn = f;
112}
113
114extern void onig_set_verb_warn_func(OnigWarnFunc f)
115{
116 onig_verb_warn = f;
117}
118
119static void CC_DUP_WARN(ScanEnv *env, OnigCodePoint from, OnigCodePoint to);
120
121
122static unsigned int ParseDepthLimit = DEFAULT_PARSE_DEPTH_LIMIT;
123
124extern unsigned int
125onig_get_parse_depth_limit(void)
126{
127 return ParseDepthLimit;
128}
129
130extern int
131onig_set_parse_depth_limit(unsigned int depth)
132{
133 if (depth == 0)
134 ParseDepthLimit = DEFAULT_PARSE_DEPTH_LIMIT;
135 else
136 ParseDepthLimit = depth;
137 return 0;
138}
139
140
141static void
142bbuf_free(BBuf* bbuf)
143{
144 if (IS_NOT_NULL(bbuf)) {
145 xfree(bbuf->p);
146 xfree(bbuf);
147 }
148}
149
150static int
151bbuf_clone(BBuf** rto, BBuf* from)
152{
153 int r;
154 BBuf *to;
155
156 *rto = to = (BBuf* )xmalloc(sizeof(BBuf));
157 CHECK_NULL_RETURN_MEMERR(to);
158 r = BBUF_INIT(to, from->alloc);
159 if (r != 0) return r;
160 to->used = from->used;
161 xmemcpy(to->p, from->p, from->used);
162 return 0;
163}
164
165#define BACKREF_REL_TO_ABS(rel_no, env) \
166 ((env)->num_mem + 1 + (rel_no))
167
168#define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f))
169
170#define MBCODE_START_POS(enc) \
171 (OnigCodePoint )(ONIGENC_MBC_MINLEN(enc) > 1 ? 0 : 0x80)
172
173#define SET_ALL_MULTI_BYTE_RANGE(enc, pbuf) \
174 add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ONIG_LAST_CODE_POINT)
175
176#define ADD_ALL_MULTI_BYTE_RANGE(enc, mbuf) do {\
177 if (! ONIGENC_IS_SINGLEBYTE(enc)) {\
178 r = SET_ALL_MULTI_BYTE_RANGE(enc, &(mbuf));\
179 if (r) return r;\
180 }\
181} while (0)
182
183
184#define BITSET_SET_BIT_CHKDUP(bs, pos) do { \
185 if (BITSET_AT(bs, pos)) CC_DUP_WARN(env, pos, pos); \
186 BS_ROOM(bs, pos) |= BS_BIT(pos); \
187} while (0)
188
189#define BITSET_IS_EMPTY(bs,empty) do {\
190 int i;\
191 empty = 1;\
192 for (i = 0; i < BITSET_SIZE; i++) {\
193 if ((bs)[i] != 0) {\
194 empty = 0; break;\
195 }\
196 }\
197} while (0)
198
199static void
200bitset_set_range(ScanEnv *env, BitSetRef bs, int from, int to)
201{
202 int i;
203 for (i = from; i <= to && i < SINGLE_BYTE_SIZE; i++) {
204 BITSET_SET_BIT_CHKDUP(bs, i);
205 }
206}
207
208#if 0
209static void
210bitset_set_all(BitSetRef bs)
211{
212 int i;
213 for (i = 0; i < BITSET_SIZE; i++) { bs[i] = ~((Bits )0); }
214}
215#endif
216
217static void
218bitset_invert(BitSetRef bs)
219{
220 int i;
221 for (i = 0; i < BITSET_SIZE; i++) { bs[i] = ~(bs[i]); }
222}
223
224static void
225bitset_invert_to(BitSetRef from, BitSetRef to)
226{
227 int i;
228 for (i = 0; i < BITSET_SIZE; i++) { to[i] = ~(from[i]); }
229}
230
231static void
232bitset_and(BitSetRef dest, BitSetRef bs)
233{
234 int i;
235 for (i = 0; i < BITSET_SIZE; i++) { dest[i] &= bs[i]; }
236}
237
238static void
239bitset_or(BitSetRef dest, BitSetRef bs)
240{
241 int i;
242 for (i = 0; i < BITSET_SIZE; i++) { dest[i] |= bs[i]; }
243}
244
245static void
246bitset_copy(BitSetRef dest, BitSetRef bs)
247{
248 int i;
249 for (i = 0; i < BITSET_SIZE; i++) { dest[i] = bs[i]; }
250}
251
252#if defined(USE_NAMED_GROUP) && !defined(USE_ST_LIBRARY)
253extern int
254onig_strncmp(const UChar* s1, const UChar* s2, size_t n)
255{
256 int x;
257
258 while (n-- > 0) {
259 x = *s2++ - *s1++;
260 if (x) return x;
261 }
262 return 0;
263}
264#endif
265
266extern void
267onig_strcpy(UChar* dest, const UChar* src, const UChar* end)
268{
269 ptrdiff_t len = end - src;
270 if (len > 0) {
271 xmemcpy(dest, src, len);
272 dest[len] = (UChar )0;
273 }
274}
275
276#ifdef USE_NAMED_GROUP
277static UChar*
278strdup_with_null(OnigEncoding enc, const UChar* s, const UChar* end)
279{
280 ptrdiff_t slen;
281 int term_len, i;
282 UChar *r;
283
284 slen = end - s;
285 term_len = ONIGENC_MBC_MINLEN(enc);
286
287 r = (UChar* )xmalloc(slen + term_len);
288 CHECK_NULL_RETURN(r);
289 xmemcpy(r, s, slen);
290
291 for (i = 0; i < term_len; i++)
292 r[slen + i] = (UChar )0;
293
294 return r;
295}
296#endif
297
298/* scan pattern methods */
299#define PEND_VALUE 0
300
301#ifdef __GNUC__
302/* get rid of Wunused-but-set-variable and Wuninitialized */
303# define PFETCH_READY UChar* pfetch_prev = NULL; (void)pfetch_prev
304#else
305# define PFETCH_READY UChar* pfetch_prev
306#endif
307#define PEND (p < end ? 0 : 1)
308#define PUNFETCH p = pfetch_prev
309#define PINC do { \
310 pfetch_prev = p; \
311 p += enclen(enc, p, end); \
312} while (0)
313#define PFETCH(c) do { \
314 c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \
315 pfetch_prev = p; \
316 p += enclen(enc, p, end); \
317} while (0)
318
319#define PINC_S do { \
320 p += enclen(enc, p, end); \
321} while (0)
322#define PFETCH_S(c) do { \
323 c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \
324 p += enclen(enc, p, end); \
325} while (0)
326
327#define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE)
328#define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c)
329
330static UChar*
331strcat_capa(UChar* dest, UChar* dest_end, const UChar* src, const UChar* src_end,
332 size_t capa)
333{
334 UChar* r;
335
336 if (dest)
337 r = (UChar* )xrealloc(dest, capa + 1);
338 else
339 r = (UChar* )xmalloc(capa + 1);
340
341 CHECK_NULL_RETURN(r);
342 onig_strcpy(r + (dest_end - dest), src, src_end);
343 return r;
344}
345
346/* dest on static area */
347static UChar*
348strcat_capa_from_static(UChar* dest, UChar* dest_end,
349 const UChar* src, const UChar* src_end, size_t capa)
350{
351 UChar* r;
352
353 r = (UChar* )xmalloc(capa + 1);
354 CHECK_NULL_RETURN(r);
355 onig_strcpy(r, dest, dest_end);
356 onig_strcpy(r + (dest_end - dest), src, src_end);
357 return r;
358}
359
360
361#ifdef USE_ST_LIBRARY
362
363# ifdef RUBY
364# include "ruby/st.h"
365# else
366# include "st.h"
367# endif
368
369typedef struct {
370 const UChar* s;
371 const UChar* end;
373
374static int
375str_end_cmp(st_data_t xp, st_data_t yp)
376{
377 const st_str_end_key *x, *y;
378 const UChar *p, *q;
379 int c;
380
381 x = (const st_str_end_key *)xp;
382 y = (const st_str_end_key *)yp;
383 if ((x->end - x->s) != (y->end - y->s))
384 return 1;
385
386 p = x->s;
387 q = y->s;
388 while (p < x->end) {
389 c = (int )*p - (int )*q;
390 if (c != 0) return c;
391
392 p++; q++;
393 }
394
395 return 0;
396}
397
398NO_SANITIZE("unsigned-integer-overflow", static st_index_t str_end_hash(st_data_t xp));
399
400static st_index_t
401str_end_hash(st_data_t xp)
402{
403 const st_str_end_key *x = (const st_str_end_key *)xp;
404 const UChar *p;
405 st_index_t val = 0;
406
407 p = x->s;
408 while (p < x->end) {
409 val = val * 997 + (int )*p++;
410 }
411
412 return val + (val >> 5);
413}
414
415extern hash_table_type*
416onig_st_init_strend_table_with_size(st_index_t size)
417{
418 static const struct st_hash_type hashType = {
419 str_end_cmp,
420 str_end_hash,
421 };
422
423 return (hash_table_type* )
424 onig_st_init_table_with_size(&hashType, size);
425}
426
427extern int
428onig_st_lookup_strend(hash_table_type* table, const UChar* str_key,
429 const UChar* end_key, hash_data_type *value)
430{
431 st_str_end_key key;
432
433 key.s = (UChar* )str_key;
434 key.end = (UChar* )end_key;
435
436 return onig_st_lookup(table, (st_data_t )(&key), value);
437}
438
439extern int
440onig_st_insert_strend(hash_table_type* table, const UChar* str_key,
441 const UChar* end_key, hash_data_type value)
442{
443 st_str_end_key* key;
444 int result;
445
446 key = (st_str_end_key* )xmalloc(sizeof(st_str_end_key));
447 key->s = (UChar* )str_key;
448 key->end = (UChar* )end_key;
449 result = onig_st_insert(table, (st_data_t )key, value);
450 if (result) {
451 xfree(key);
452 }
453 return result;
454}
455
456#endif /* USE_ST_LIBRARY */
457
458
459#ifdef USE_NAMED_GROUP
460
461# define INIT_NAME_BACKREFS_ALLOC_NUM 8
462
463typedef struct {
464 UChar* name;
465 size_t name_len; /* byte length */
466 int back_num; /* number of backrefs */
467 int back_alloc;
468 int back_ref1;
469 int* back_refs;
470} NameEntry;
471
472# ifdef USE_ST_LIBRARY
473
474typedef st_table NameTable;
475typedef st_data_t HashDataType; /* 1.6 st.h doesn't define st_data_t type */
476
477# ifdef ONIG_DEBUG
478static int
479i_print_name_entry(HashDataType key_, HashDataType e_, HashDataType arg_)
480{
481 NameEntry* e = (NameEntry *)e_;
482 void* arg = (void *)arg_;
483 int i;
484 FILE* fp = (FILE* )arg;
485
486 fprintf(fp, "%s: ", e->name);
487 if (e->back_num == 0)
488 fputs("-", fp);
489 else if (e->back_num == 1)
490 fprintf(fp, "%d", e->back_ref1);
491 else {
492 for (i = 0; i < e->back_num; i++) {
493 if (i > 0) fprintf(fp, ", ");
494 fprintf(fp, "%d", e->back_refs[i]);
495 }
496 }
497 fputs("\n", fp);
498 return ST_CONTINUE;
499}
500
501extern int
502onig_print_names(FILE* fp, regex_t* reg)
503{
504 NameTable* t = (NameTable* )reg->name_table;
505
506 if (IS_NOT_NULL(t)) {
507 fprintf(fp, "name table\n");
508 onig_st_foreach(t, i_print_name_entry, (HashDataType )fp);
509 fputs("\n", fp);
510 }
511 return 0;
512}
513# endif /* ONIG_DEBUG */
514
515static int
516i_free_name_entry(HashDataType key_, HashDataType e_, HashDataType arg_ ARG_UNUSED)
517{
518 UChar* key = (UChar *)key_;
519 NameEntry* e = (NameEntry *)e_;
520 xfree(e->name);
521 xfree(e->back_refs);
522 xfree(key);
523 xfree(e);
524 return ST_DELETE;
525}
526
527static int
528names_clear(regex_t* reg)
529{
530 NameTable* t = (NameTable* )reg->name_table;
531
532 if (IS_NOT_NULL(t)) {
533 onig_st_foreach(t, i_free_name_entry, 0);
534 }
535 return 0;
536}
537
538extern int
539onig_names_free(regex_t* reg)
540{
541 int r;
542 NameTable* t;
543
544 r = names_clear(reg);
545 if (r) return r;
546
547 t = (NameTable* )reg->name_table;
548 if (IS_NOT_NULL(t)) onig_st_free_table(t);
549 reg->name_table = (void* )NULL;
550 return 0;
551}
552
553static int
554copy_named_captures_iter(const OnigUChar *name, const OnigUChar *name_end,
555 int back_num, int *back_refs, OnigRegex regex, void *arg)
556{
557 NameTable *copy_table = (NameTable *)arg;
558 NameEntry *entry_copy = (NameEntry* )xmalloc(sizeof(NameEntry));
559 if (IS_NULL(entry_copy)) return -1;
560
561 entry_copy->name_len = name_end - name;
562 entry_copy->back_num = back_num;
563 entry_copy->back_alloc = back_num;
564 entry_copy->back_ref1 = back_refs[0];
565 entry_copy->back_refs = xmalloc(back_num * (sizeof(int*)));
566 if (IS_NULL(entry_copy->back_refs)) {
567 xfree(entry_copy);
568 return -1;
569 }
570 memcpy(entry_copy->back_refs, back_refs, back_num * sizeof(back_refs[0]));
571
572 UChar *new_name = strdup_with_null(regex->enc, name, name_end);
573 if (IS_NULL(new_name)) {
574 xfree(entry_copy->back_refs);
575 xfree(entry_copy);
576 return -1;
577 }
578 entry_copy->name = new_name;
579
580 if (onig_st_insert_strend(copy_table, new_name, (new_name + entry_copy->name_len), (hash_data_type)entry_copy)) {
581 xfree(entry_copy->name);
582 xfree(entry_copy->back_refs);
583 xfree(entry_copy);
584 return -1;
585 }
586 return 0;
587}
588
589extern int
590onig_names_copy(regex_t* reg, regex_t* oreg)
591{
592 NameTable* table = oreg->name_table;
593 if (table) {
594 NameTable * t = onig_st_init_strend_table_with_size(onig_number_of_names(oreg));
595 CHECK_NULL_RETURN_MEMERR(t);
596 if (onig_foreach_name(oreg, copy_named_captures_iter, (void*)t)) {
597 onig_st_free_table(t);
598 return ONIGERR_MEMORY;
599 }
600 reg->name_table = t;
601 }
602 return 0;
603}
604
605static NameEntry*
606name_find(regex_t* reg, const UChar* name, const UChar* name_end)
607{
608 NameEntry* e;
609 NameTable* t = (NameTable* )reg->name_table;
610
611 e = (NameEntry* )NULL;
612 if (IS_NOT_NULL(t)) {
613 onig_st_lookup_strend(t, name, name_end, (HashDataType* )((void* )(&e)));
614 }
615 return e;
616}
617
618typedef struct {
619 int (*func)(const UChar*, const UChar*,int,int*,regex_t*,void*);
620 regex_t* reg;
621 void* arg;
622 int ret;
623 OnigEncoding enc;
624} INamesArg;
625
626static int
627i_names(HashDataType key_ ARG_UNUSED, HashDataType e_, HashDataType arg_)
628{
629 NameEntry* e = (NameEntry *)e_;
630 INamesArg* arg = (INamesArg *)arg_;
631 int r = (*(arg->func))(e->name,
632 e->name + e->name_len,
633 e->back_num,
634 (e->back_num > 1 ? e->back_refs : &(e->back_ref1)),
635 arg->reg, arg->arg);
636 if (r != 0) {
637 arg->ret = r;
638 return ST_STOP;
639 }
640 return ST_CONTINUE;
641}
642
643extern int
644onig_foreach_name(regex_t* reg,
645 int (*func)(const UChar*, const UChar*,int,int*,regex_t*,void*), void* arg)
646{
647 INamesArg narg;
648 NameTable* t = (NameTable* )reg->name_table;
649
650 narg.ret = 0;
651 if (IS_NOT_NULL(t)) {
652 narg.func = func;
653 narg.reg = reg;
654 narg.arg = arg;
655 narg.enc = reg->enc; /* should be pattern encoding. */
656 onig_st_foreach(t, i_names, (HashDataType )&narg);
657 }
658 return narg.ret;
659}
660
661static int
662i_renumber_name(HashDataType key_ ARG_UNUSED, HashDataType e_, HashDataType map_)
663{
664 NameEntry* e = (NameEntry *)e_;
665 GroupNumRemap* map = (GroupNumRemap *)map_;
666 int i;
667
668 if (e->back_num > 1) {
669 for (i = 0; i < e->back_num; i++) {
670 e->back_refs[i] = map[e->back_refs[i]].new_val;
671 }
672 }
673 else if (e->back_num == 1) {
674 e->back_ref1 = map[e->back_ref1].new_val;
675 }
676
677 return ST_CONTINUE;
678}
679
680extern int
681onig_renumber_name_table(regex_t* reg, GroupNumRemap* map)
682{
683 NameTable* t = (NameTable* )reg->name_table;
684
685 if (IS_NOT_NULL(t)) {
686 onig_st_foreach(t, i_renumber_name, (HashDataType )map);
687 }
688 return 0;
689}
690
691
692extern int
693onig_number_of_names(const regex_t* reg)
694{
695 NameTable* t = (NameTable* )reg->name_table;
696
697 if (IS_NOT_NULL(t))
698 return (int )t->num_entries;
699 else
700 return 0;
701}
702
703# else /* USE_ST_LIBRARY */
704
705# define INIT_NAMES_ALLOC_NUM 8
706
707typedef struct {
708 NameEntry* e;
709 int num;
710 int alloc;
711} NameTable;
712
713# ifdef ONIG_DEBUG
714extern int
715onig_print_names(FILE* fp, regex_t* reg)
716{
717 int i, j;
718 NameEntry* e;
719 NameTable* t = (NameTable* )reg->name_table;
720
721 if (IS_NOT_NULL(t) && t->num > 0) {
722 fprintf(fp, "name table\n");
723 for (i = 0; i < t->num; i++) {
724 e = &(t->e[i]);
725 fprintf(fp, "%s: ", e->name);
726 if (e->back_num == 0) {
727 fputs("-", fp);
728 }
729 else if (e->back_num == 1) {
730 fprintf(fp, "%d", e->back_ref1);
731 }
732 else {
733 for (j = 0; j < e->back_num; j++) {
734 if (j > 0) fprintf(fp, ", ");
735 fprintf(fp, "%d", e->back_refs[j]);
736 }
737 }
738 fputs("\n", fp);
739 }
740 fputs("\n", fp);
741 }
742 return 0;
743}
744# endif
745
746static int
747names_clear(regex_t* reg)
748{
749 int i;
750 NameEntry* e;
751 NameTable* t = (NameTable* )reg->name_table;
752
753 if (IS_NOT_NULL(t)) {
754 for (i = 0; i < t->num; i++) {
755 e = &(t->e[i]);
756 if (IS_NOT_NULL(e->name)) {
757 xfree(e->name);
758 e->name = NULL;
759 e->name_len = 0;
760 e->back_num = 0;
761 e->back_alloc = 0;
762 xfree(e->back_refs);
763 e->back_refs = (int* )NULL;
764 }
765 }
766
767 xfree(t->e);
768 t->e = NULL;
769 t->num = 0;
770 }
771 return 0;
772}
773
774extern int
775onig_names_free(regex_t* reg)
776{
777 int r;
778 NameTable* t;
779
780 r = names_clear(reg);
781 if (r) return r;
782
783 t = (NameTable* )reg->name_table;
784 xfree(t);
785 reg->name_table = NULL;
786 return 0;
787}
788
789extern int
790onig_names_copy(regex_t* reg, regex_t* oreg)
791{
792 NameTable* ot = oreg->name_table;
793 if (ot) {
794 OnigEncoding enc = oreg->enc;
795 int i, num = ot->num;
796 NameTable* t = xmalloc(sizeof(*t));
797 CHECK_NULL_RETURN_MEMERR(t);
798 *t = *ot;
799 t->e = xmalloc(t->alloc * sizeof(t->e[0]));
800 if (IS_NULL(t->e)) {
801 xfree(t);
802 return ONIGERR_MEMORY;
803 }
804 t->num = 0;
805 reg->name_table = t;
806 for (i = 0; i < num; t->num = ++i) {
807 NameEntry* oe = &(ot->e[i]);
808 NameEntry* e = &(t->e[i]);
809 *e = *oe;
810 e->name = NULL;
811 e->back_refs = NULL;
812 e->name = strdup_with_null(enc, oe->name, oe->name + e->name_len);
813 if (IS_NULL(e->name)) {
814 onig_names_free(reg);
815 return ONIGERR_MEMORY;
816 }
817 e->back_refs = xmalloc(e->back_alloc * sizeof(e->back_refs[0]));
818 if (IS_NULL(e->back_refs)) {
819 xfree(e->name);
820 onig_names_free(reg);
821 return ONIGERR_MEMORY;
822 }
823 memcpy(e->back_refs, oe->back_refs, e->back_num * sizeof(e->back_refs[0]));
824 e->back_ref1 = e->back_refs[0];
825 }
826 }
827 return 0;
828}
829
830static NameEntry*
831name_find(regex_t* reg, const UChar* name, const UChar* name_end)
832{
833 int i;
834 size_t len;
835 NameEntry* e;
836 NameTable* t = (NameTable* )reg->name_table;
837
838 if (IS_NOT_NULL(t)) {
839 len = name_end - name;
840 for (i = 0; i < t->num; i++) {
841 e = &(t->e[i]);
842 if (len == e->name_len && onig_strncmp(name, e->name, len) == 0)
843 return e;
844 }
845 }
846 return (NameEntry* )NULL;
847}
848
849extern int
850onig_foreach_name(regex_t* reg,
851 int (*func)(const UChar*, const UChar*,int,int*,regex_t*,void*), void* arg)
852{
853 int i, r;
854 NameEntry* e;
855 NameTable* t = (NameTable* )reg->name_table;
856
857 if (IS_NOT_NULL(t)) {
858 for (i = 0; i < t->num; i++) {
859 e = &(t->e[i]);
860 r = (*func)(e->name, e->name + e->name_len, e->back_num,
861 (e->back_num > 1 ? e->back_refs : &(e->back_ref1)),
862 reg, arg);
863 if (r != 0) return r;
864 }
865 }
866 return 0;
867}
868
869extern int
870onig_renumber_name_table(regex_t* reg, GroupNumRemap* map)
871{
872 int i, j;
873 NameEntry* e;
874 NameTable* t = (NameTable* )reg->name_table;
875
876 if (IS_NOT_NULL(t)) {
877 for (i = 0; i < t->num; i++) {
878 e = &(t->e[i]);
879
880 if (e->back_num > 1) {
881 for (j = 0; j < e->back_num; j++) {
882 e->back_refs[j] = map[e->back_refs[j]].new_val;
883 }
884 }
885 else if (e->back_num == 1) {
886 e->back_ref1 = map[e->back_ref1].new_val;
887 }
888 }
889 }
890 return 0;
891}
892
893extern int
894onig_number_of_names(const regex_t* reg)
895{
896 NameTable* t = (NameTable* )reg->name_table;
897
898 if (IS_NOT_NULL(t))
899 return t->num;
900 else
901 return 0;
902}
903
904# endif /* else USE_ST_LIBRARY */
905
906static int
907name_add(regex_t* reg, UChar* name, UChar* name_end, int backref, ScanEnv* env)
908{
909 int alloc;
910 NameEntry* e;
911 NameTable* t = (NameTable* )reg->name_table;
912
913 if (name_end - name <= 0)
914 return ONIGERR_EMPTY_GROUP_NAME;
915
916 e = name_find(reg, name, name_end);
917 if (IS_NULL(e)) {
918# ifdef USE_ST_LIBRARY
919 if (IS_NULL(t)) {
920 t = onig_st_init_strend_table_with_size(5);
921 reg->name_table = (void* )t;
922 }
923 e = (NameEntry* )xmalloc(sizeof(NameEntry));
924 CHECK_NULL_RETURN_MEMERR(e);
925
926 e->name = strdup_with_null(reg->enc, name, name_end);
927 if (IS_NULL(e->name)) {
928 xfree(e);
929 return ONIGERR_MEMORY;
930 }
931 onig_st_insert_strend(t, e->name, (e->name + (name_end - name)),
932 (HashDataType )e);
933
934 e->name_len = name_end - name;
935 e->back_num = 0;
936 e->back_alloc = 0;
937 e->back_refs = (int* )NULL;
938
939# else
940
941 if (IS_NULL(t)) {
942 alloc = INIT_NAMES_ALLOC_NUM;
943 t = (NameTable* )xmalloc(sizeof(NameTable));
944 CHECK_NULL_RETURN_MEMERR(t);
945 t->e = NULL;
946 t->alloc = 0;
947 t->num = 0;
948
949 t->e = (NameEntry* )xmalloc(sizeof(NameEntry) * alloc);
950 if (IS_NULL(t->e)) {
951 xfree(t);
952 return ONIGERR_MEMORY;
953 }
954 t->alloc = alloc;
955 reg->name_table = t;
956 goto clear;
957 }
958 else if (t->num == t->alloc) {
959 int i;
960 NameEntry* p;
961
962 alloc = t->alloc * 2;
963 p = (NameEntry* )xrealloc(t->e, sizeof(NameEntry) * alloc);
964 CHECK_NULL_RETURN_MEMERR(p);
965 t->e = p;
966 t->alloc = alloc;
967
968 clear:
969 for (i = t->num; i < t->alloc; i++) {
970 t->e[i].name = NULL;
971 t->e[i].name_len = 0;
972 t->e[i].back_num = 0;
973 t->e[i].back_alloc = 0;
974 t->e[i].back_refs = (int* )NULL;
975 }
976 }
977 e = &(t->e[t->num]);
978 t->num++;
979 e->name = strdup_with_null(reg->enc, name, name_end);
980 if (IS_NULL(e->name)) return ONIGERR_MEMORY;
981 e->name_len = name_end - name;
982# endif
983 }
984
985 if (e->back_num >= 1 &&
986 ! IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_MULTIPLEX_DEFINITION_NAME)) {
987 onig_scan_env_set_error_string(env, ONIGERR_MULTIPLEX_DEFINED_NAME,
988 name, name_end);
989 return ONIGERR_MULTIPLEX_DEFINED_NAME;
990 }
991
992 e->back_num++;
993 if (e->back_num == 1) {
994 e->back_ref1 = backref;
995 }
996 else {
997 if (e->back_num == 2) {
998 alloc = INIT_NAME_BACKREFS_ALLOC_NUM;
999 e->back_refs = (int* )xmalloc(sizeof(int) * alloc);
1000 CHECK_NULL_RETURN_MEMERR(e->back_refs);
1001 e->back_alloc = alloc;
1002 e->back_refs[0] = e->back_ref1;
1003 e->back_refs[1] = backref;
1004 }
1005 else {
1006 if (e->back_num > e->back_alloc) {
1007 int* p;
1008 alloc = e->back_alloc * 2;
1009 p = (int* )xrealloc(e->back_refs, sizeof(int) * alloc);
1010 CHECK_NULL_RETURN_MEMERR(p);
1011 e->back_refs = p;
1012 e->back_alloc = alloc;
1013 }
1014 e->back_refs[e->back_num - 1] = backref;
1015 }
1016 }
1017
1018 return 0;
1019}
1020
1021extern int
1022onig_name_to_group_numbers(regex_t* reg, const UChar* name,
1023 const UChar* name_end, int** nums)
1024{
1025 NameEntry* e = name_find(reg, name, name_end);
1026
1027 if (IS_NULL(e)) return ONIGERR_UNDEFINED_NAME_REFERENCE;
1028
1029 switch (e->back_num) {
1030 case 0:
1031 *nums = 0;
1032 break;
1033 case 1:
1034 *nums = &(e->back_ref1);
1035 break;
1036 default:
1037 *nums = e->back_refs;
1038 break;
1039 }
1040 return e->back_num;
1041}
1042
1043extern int
1044onig_name_to_backref_number(regex_t* reg, const UChar* name,
1045 const UChar* name_end, const OnigRegion *region)
1046{
1047 int i, n, *nums;
1048
1049 n = onig_name_to_group_numbers(reg, name, name_end, &nums);
1050 if (n < 0)
1051 return n;
1052 else if (n == 0)
1053 return ONIGERR_PARSER_BUG;
1054 else if (n == 1)
1055 return nums[0];
1056 else {
1057 if (IS_NOT_NULL(region)) {
1058 for (i = n - 1; i >= 0; i--) {
1059 if (region->beg[nums[i]] != ONIG_REGION_NOTPOS)
1060 return nums[i];
1061 }
1062 }
1063 return nums[n - 1];
1064 }
1065}
1066
1067#else /* USE_NAMED_GROUP */
1068
1069extern int
1070onig_name_to_group_numbers(regex_t* reg, const UChar* name,
1071 const UChar* name_end, int** nums)
1072{
1073 return ONIG_NO_SUPPORT_CONFIG;
1074}
1075
1076extern int
1077onig_name_to_backref_number(regex_t* reg, const UChar* name,
1078 const UChar* name_end, const OnigRegion* region)
1079{
1080 return ONIG_NO_SUPPORT_CONFIG;
1081}
1082
1083extern int
1084onig_foreach_name(regex_t* reg,
1085 int (*func)(const UChar*, const UChar*,int,int*,regex_t*,void*), void* arg)
1086{
1087 return ONIG_NO_SUPPORT_CONFIG;
1088}
1089
1090extern int
1091onig_number_of_names(const regex_t* reg)
1092{
1093 return 0;
1094}
1095
1096extern int
1097onig_names_copy(regex_t* reg, regex_t* oreg)
1098{
1099 return 0;
1100}
1101#endif /* else USE_NAMED_GROUP */
1102
1103extern int
1104onig_noname_group_capture_is_active(const regex_t* reg)
1105{
1106 if (ONIG_IS_OPTION_ON(reg->options, ONIG_OPTION_DONT_CAPTURE_GROUP))
1107 return 0;
1108
1109#ifdef USE_NAMED_GROUP
1110 if (onig_number_of_names(reg) > 0 &&
1111 IS_SYNTAX_BV(reg->syntax, ONIG_SYN_CAPTURE_ONLY_NAMED_GROUP) &&
1112 !ONIG_IS_OPTION_ON(reg->options, ONIG_OPTION_CAPTURE_GROUP)) {
1113 return 0;
1114 }
1115#endif
1116
1117 return 1;
1118}
1119
1120
1121#define INIT_SCANENV_MEMNODES_ALLOC_SIZE 16
1122
1123static void
1124scan_env_clear(ScanEnv* env)
1125{
1126 int i;
1127
1128 BIT_STATUS_CLEAR(env->capture_history);
1129 BIT_STATUS_CLEAR(env->bt_mem_start);
1130 BIT_STATUS_CLEAR(env->bt_mem_end);
1131 BIT_STATUS_CLEAR(env->backrefed_mem);
1132 env->error = (UChar* )NULL;
1133 env->error_end = (UChar* )NULL;
1134 env->num_call = 0;
1135 env->num_mem = 0;
1136#ifdef USE_NAMED_GROUP
1137 env->num_named = 0;
1138#endif
1139 env->mem_alloc = 0;
1140 env->mem_nodes_dynamic = (Node** )NULL;
1141
1142 for (i = 0; i < SCANENV_MEMNODES_SIZE; i++)
1143 env->mem_nodes_static[i] = NULL_NODE;
1144
1145#ifdef USE_COMBINATION_EXPLOSION_CHECK
1146 env->num_comb_exp_check = 0;
1147 env->comb_exp_max_regnum = 0;
1148 env->curr_max_regnum = 0;
1149 env->has_recursion = 0;
1150#endif
1151 env->parse_depth = 0;
1152 env->warnings_flag = 0;
1153}
1154
1155static int
1156scan_env_add_mem_entry(ScanEnv* env)
1157{
1158 int i, need, alloc;
1159 Node** p;
1160
1161 need = env->num_mem + 1;
1162 if (need > ONIG_MAX_CAPTURE_GROUP_NUM)
1163 return ONIGERR_TOO_MANY_CAPTURE_GROUPS;
1164 if (need >= SCANENV_MEMNODES_SIZE) {
1165 if (env->mem_alloc <= need) {
1166 if (IS_NULL(env->mem_nodes_dynamic)) {
1167 alloc = INIT_SCANENV_MEMNODES_ALLOC_SIZE;
1168 p = (Node** )xmalloc(sizeof(Node*) * alloc);
1169 CHECK_NULL_RETURN_MEMERR(p);
1170 xmemcpy(p, env->mem_nodes_static,
1171 sizeof(Node*) * SCANENV_MEMNODES_SIZE);
1172 }
1173 else {
1174 alloc = env->mem_alloc * 2;
1175 p = (Node** )xrealloc(env->mem_nodes_dynamic, sizeof(Node*) * alloc);
1176 CHECK_NULL_RETURN_MEMERR(p);
1177 }
1178
1179 for (i = env->num_mem + 1; i < alloc; i++)
1180 p[i] = NULL_NODE;
1181
1182 env->mem_nodes_dynamic = p;
1183 env->mem_alloc = alloc;
1184 }
1185 }
1186
1187 env->num_mem++;
1188 return env->num_mem;
1189}
1190
1191static int
1192scan_env_set_mem_node(ScanEnv* env, int num, Node* node)
1193{
1194 if (env->num_mem >= num)
1195 SCANENV_MEM_NODES(env)[num] = node;
1196 else
1197 return ONIGERR_PARSER_BUG;
1198 return 0;
1199}
1200
1201
1202extern void
1203onig_node_free(Node* node)
1204{
1205 start:
1206 if (IS_NULL(node)) return ;
1207
1208 switch (NTYPE(node)) {
1209 case NT_STR:
1210 if (NSTR(node)->capa != 0 &&
1211 IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) {
1212 xfree(NSTR(node)->s);
1213 }
1214 break;
1215
1216 case NT_LIST:
1217 case NT_ALT:
1218 onig_node_free(NCAR(node));
1219 {
1220 Node* next_node = NCDR(node);
1221
1222 xfree(node);
1223 node = next_node;
1224 goto start;
1225 }
1226 break;
1227
1228 case NT_CCLASS:
1229 {
1230 CClassNode* cc = NCCLASS(node);
1231
1232 bbuf_free(cc->mbuf);
1233 }
1234 break;
1235
1236 case NT_QTFR:
1237 onig_node_free(NQTFR(node)->target);
1238 break;
1239
1240 case NT_ENCLOSE:
1241 onig_node_free(NENCLOSE(node)->target);
1242 break;
1243
1244 case NT_BREF:
1245 xfree(NBREF(node)->back_dynamic);
1246 break;
1247
1248 case NT_ANCHOR:
1249 onig_node_free(NANCHOR(node)->target);
1250 break;
1251 }
1252
1253 xfree(node);
1254}
1255
1256static Node*
1257node_new(void)
1258{
1259 Node* node;
1260
1261 node = (Node* )xmalloc(sizeof(Node));
1262 /* xmemset(node, 0, sizeof(Node)); */
1263 return node;
1264}
1265
1266static void
1267initialize_cclass(CClassNode* cc)
1268{
1269 BITSET_CLEAR(cc->bs);
1270 /* cc->base.flags = 0; */
1271 cc->flags = 0;
1272 cc->mbuf = NULL;
1273}
1274
1275static Node*
1276node_new_cclass(void)
1277{
1278 Node* node = node_new();
1279 CHECK_NULL_RETURN(node);
1280
1281 SET_NTYPE(node, NT_CCLASS);
1282 initialize_cclass(NCCLASS(node));
1283 return node;
1284}
1285
1286static Node*
1287node_new_ctype(int type, int not, int ascii_range)
1288{
1289 Node* node = node_new();
1290 CHECK_NULL_RETURN(node);
1291
1292 SET_NTYPE(node, NT_CTYPE);
1293 NCTYPE(node)->ctype = type;
1294 NCTYPE(node)->not = not;
1295 NCTYPE(node)->ascii_range = ascii_range;
1296 return node;
1297}
1298
1299static Node*
1300node_new_anychar(void)
1301{
1302 Node* node = node_new();
1303 CHECK_NULL_RETURN(node);
1304
1305 SET_NTYPE(node, NT_CANY);
1306 return node;
1307}
1308
1309static Node*
1310node_new_list(Node* left, Node* right)
1311{
1312 Node* node = node_new();
1313 CHECK_NULL_RETURN(node);
1314
1315 SET_NTYPE(node, NT_LIST);
1316 NCAR(node) = left;
1317 NCDR(node) = right;
1318 return node;
1319}
1320
1321extern Node*
1322onig_node_new_list(Node* left, Node* right)
1323{
1324 return node_new_list(left, right);
1325}
1326
1327extern Node*
1328onig_node_list_add(Node* list, Node* x)
1329{
1330 Node *n;
1331
1332 n = onig_node_new_list(x, NULL);
1333 if (IS_NULL(n)) return NULL_NODE;
1334
1335 if (IS_NOT_NULL(list)) {
1336 while (IS_NOT_NULL(NCDR(list)))
1337 list = NCDR(list);
1338
1339 NCDR(list) = n;
1340 }
1341
1342 return n;
1343}
1344
1345extern Node*
1346onig_node_new_alt(Node* left, Node* right)
1347{
1348 Node* node = node_new();
1349 CHECK_NULL_RETURN(node);
1350
1351 SET_NTYPE(node, NT_ALT);
1352 NCAR(node) = left;
1353 NCDR(node) = right;
1354 return node;
1355}
1356
1357extern Node*
1358onig_node_new_anchor(int type)
1359{
1360 Node* node = node_new();
1361 CHECK_NULL_RETURN(node);
1362
1363 SET_NTYPE(node, NT_ANCHOR);
1364 NANCHOR(node)->type = type;
1365 NANCHOR(node)->target = NULL;
1366 NANCHOR(node)->char_len = -1;
1367 NANCHOR(node)->ascii_range = 0;
1368 return node;
1369}
1370
1371static Node*
1372node_new_backref(int back_num, int* backrefs, int by_name,
1373#ifdef USE_BACKREF_WITH_LEVEL
1374 int exist_level, int nest_level,
1375#endif
1376 ScanEnv* env)
1377{
1378 int i;
1379 Node* node = node_new();
1380
1381 CHECK_NULL_RETURN(node);
1382
1383 SET_NTYPE(node, NT_BREF);
1384 NBREF(node)->state = 0;
1385 NBREF(node)->back_num = back_num;
1386 NBREF(node)->back_dynamic = (int* )NULL;
1387 if (by_name != 0)
1388 NBREF(node)->state |= NST_NAME_REF;
1389
1390#ifdef USE_BACKREF_WITH_LEVEL
1391 if (exist_level != 0) {
1392 NBREF(node)->state |= NST_NEST_LEVEL;
1393 NBREF(node)->nest_level = nest_level;
1394 }
1395#endif
1396
1397 for (i = 0; i < back_num; i++) {
1398 if (backrefs[i] <= env->num_mem &&
1399 IS_NULL(SCANENV_MEM_NODES(env)[backrefs[i]])) {
1400 NBREF(node)->state |= NST_RECURSION; /* /...(\1).../ */
1401 break;
1402 }
1403 }
1404
1405 if (back_num <= NODE_BACKREFS_SIZE) {
1406 for (i = 0; i < back_num; i++)
1407 NBREF(node)->back_static[i] = backrefs[i];
1408 }
1409 else {
1410 int* p = (int* )xmalloc(sizeof(int) * back_num);
1411 if (IS_NULL(p)) {
1412 onig_node_free(node);
1413 return NULL;
1414 }
1415 NBREF(node)->back_dynamic = p;
1416 for (i = 0; i < back_num; i++)
1417 p[i] = backrefs[i];
1418 }
1419 return node;
1420}
1421
1422#ifdef USE_SUBEXP_CALL
1423static Node*
1424node_new_call(UChar* name, UChar* name_end, int gnum)
1425{
1426 Node* node = node_new();
1427 CHECK_NULL_RETURN(node);
1428
1429 SET_NTYPE(node, NT_CALL);
1430 NCALL(node)->state = 0;
1431 NCALL(node)->target = NULL_NODE;
1432 NCALL(node)->name = name;
1433 NCALL(node)->name_end = name_end;
1434 NCALL(node)->group_num = gnum; /* call by number if gnum != 0 */
1435 return node;
1436}
1437#endif
1438
1439static Node*
1440node_new_quantifier(int lower, int upper, int by_number)
1441{
1442 Node* node = node_new();
1443 CHECK_NULL_RETURN(node);
1444
1445 SET_NTYPE(node, NT_QTFR);
1446 NQTFR(node)->state = 0;
1447 NQTFR(node)->target = NULL;
1448 NQTFR(node)->lower = lower;
1449 NQTFR(node)->upper = upper;
1450 NQTFR(node)->greedy = 1;
1451 NQTFR(node)->target_empty_info = NQ_TARGET_ISNOT_EMPTY;
1452 NQTFR(node)->head_exact = NULL_NODE;
1453 NQTFR(node)->next_head_exact = NULL_NODE;
1454 NQTFR(node)->is_referred = 0;
1455 if (by_number != 0)
1456 NQTFR(node)->state |= NST_BY_NUMBER;
1457
1458#ifdef USE_COMBINATION_EXPLOSION_CHECK
1459 NQTFR(node)->comb_exp_check_num = 0;
1460#endif
1461
1462 return node;
1463}
1464
1465static Node*
1466node_new_enclose(int type)
1467{
1468 Node* node = node_new();
1469 CHECK_NULL_RETURN(node);
1470
1471 SET_NTYPE(node, NT_ENCLOSE);
1472 NENCLOSE(node)->type = type;
1473 NENCLOSE(node)->state = 0;
1474 NENCLOSE(node)->regnum = 0;
1475 NENCLOSE(node)->option = 0;
1476 NENCLOSE(node)->target = NULL;
1477 NENCLOSE(node)->call_addr = -1;
1478 NENCLOSE(node)->opt_count = 0;
1479 return node;
1480}
1481
1482extern Node*
1483onig_node_new_enclose(int type)
1484{
1485 return node_new_enclose(type);
1486}
1487
1488static Node*
1489node_new_enclose_memory(OnigOptionType option, int is_named)
1490{
1491 Node* node = node_new_enclose(ENCLOSE_MEMORY);
1492 CHECK_NULL_RETURN(node);
1493 if (is_named != 0)
1494 SET_ENCLOSE_STATUS(node, NST_NAMED_GROUP);
1495
1496#ifdef USE_SUBEXP_CALL
1497 NENCLOSE(node)->option = option;
1498#endif
1499 return node;
1500}
1501
1502static Node*
1503node_new_option(OnigOptionType option)
1504{
1505 Node* node = node_new_enclose(ENCLOSE_OPTION);
1506 CHECK_NULL_RETURN(node);
1507 NENCLOSE(node)->option = option;
1508 return node;
1509}
1510
1511extern int
1512onig_node_str_cat(Node* node, const UChar* s, const UChar* end)
1513{
1514 ptrdiff_t addlen = end - s;
1515
1516 if (addlen > 0) {
1517 ptrdiff_t len = NSTR(node)->end - NSTR(node)->s;
1518
1519 if (NSTR(node)->capa > 0 || (len + addlen > NODE_STR_BUF_SIZE - 1)) {
1520 UChar* p;
1521 ptrdiff_t capa = len + addlen + NODE_STR_MARGIN;
1522
1523 if (capa <= NSTR(node)->capa) {
1524 onig_strcpy(NSTR(node)->s + len, s, end);
1525 }
1526 else {
1527 if (NSTR(node)->s == NSTR(node)->buf)
1528 p = strcat_capa_from_static(NSTR(node)->s, NSTR(node)->end,
1529 s, end, capa);
1530 else
1531 p = strcat_capa(NSTR(node)->s, NSTR(node)->end, s, end, capa);
1532
1533 CHECK_NULL_RETURN_MEMERR(p);
1534 NSTR(node)->s = p;
1535 NSTR(node)->capa = (int )capa;
1536 }
1537 }
1538 else {
1539 onig_strcpy(NSTR(node)->s + len, s, end);
1540 }
1541 NSTR(node)->end = NSTR(node)->s + len + addlen;
1542 }
1543
1544 return 0;
1545}
1546
1547extern int
1548onig_node_str_set(Node* node, const UChar* s, const UChar* end)
1549{
1550 onig_node_str_clear(node);
1551 return onig_node_str_cat(node, s, end);
1552}
1553
1554static int
1555node_str_cat_char(Node* node, UChar c)
1556{
1557 UChar s[1];
1558
1559 s[0] = c;
1560 return onig_node_str_cat(node, s, s + 1);
1561}
1562
1563static int
1564node_str_cat_codepoint(Node* node, OnigEncoding enc, OnigCodePoint c)
1565{
1566 UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN];
1567 int num = ONIGENC_CODE_TO_MBC(enc, c, buf);
1568 if (num < 0) return num;
1569 return onig_node_str_cat(node, buf, buf + num);
1570}
1571
1572static int
1573check_code_point(OnigCodePoint code, OnigEncoding enc)
1574{
1575 if (ONIGENC_IS_UNICODE(enc) &&
1576 (code > 0x10ffff || (code >= 0xd800 && code <= 0xdfff)))
1577 return ONIGERR_INVALID_CODE_POINT_VALUE;
1578 return 0;
1579}
1580
1581#if 0
1582extern void
1583onig_node_conv_to_str_node(Node* node, int flag)
1584{
1585 SET_NTYPE(node, NT_STR);
1586 NSTR(node)->flag = flag;
1587 NSTR(node)->capa = 0;
1588 NSTR(node)->s = NSTR(node)->buf;
1589 NSTR(node)->end = NSTR(node)->buf;
1590}
1591#endif
1592
1593extern void
1594onig_node_str_clear(Node* node)
1595{
1596 if (NSTR(node)->capa != 0 &&
1597 IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) {
1598 xfree(NSTR(node)->s);
1599 }
1600
1601 NSTR(node)->capa = 0;
1602 NSTR(node)->flag = 0;
1603 NSTR(node)->s = NSTR(node)->buf;
1604 NSTR(node)->end = NSTR(node)->buf;
1605}
1606
1607static Node*
1608node_new_str(const UChar* s, const UChar* end)
1609{
1610 Node* node = node_new();
1611 CHECK_NULL_RETURN(node);
1612
1613 SET_NTYPE(node, NT_STR);
1614 NSTR(node)->capa = 0;
1615 NSTR(node)->flag = 0;
1616 NSTR(node)->s = NSTR(node)->buf;
1617 NSTR(node)->end = NSTR(node)->buf;
1618 if (onig_node_str_cat(node, s, end)) {
1619 onig_node_free(node);
1620 return NULL;
1621 }
1622 return node;
1623}
1624
1625extern Node*
1626onig_node_new_str(const UChar* s, const UChar* end)
1627{
1628 return node_new_str(s, end);
1629}
1630
1631static Node*
1632node_new_str_raw(UChar* s, UChar* end)
1633{
1634 Node* node = node_new_str(s, end);
1635 if (IS_NOT_NULL(node))
1636 NSTRING_SET_RAW(node);
1637 return node;
1638}
1639
1640static Node*
1641node_new_empty(void)
1642{
1643 return node_new_str(NULL, NULL);
1644}
1645
1646static Node*
1647node_new_str_raw_char(UChar c)
1648{
1649 UChar p[1];
1650
1651 p[0] = c;
1652 return node_new_str_raw(p, p + 1);
1653}
1654
1655static Node*
1656str_node_split_last_char(StrNode* sn, OnigEncoding enc)
1657{
1658 const UChar *p;
1659 Node* n = NULL_NODE;
1660
1661 if (sn->end > sn->s) {
1662 p = onigenc_get_prev_char_head(enc, sn->s, sn->end, sn->end);
1663 if (p && p > sn->s) { /* can be split. */
1664 n = node_new_str(p, sn->end);
1665 if (IS_NOT_NULL(n) && (sn->flag & NSTR_RAW) != 0)
1666 NSTRING_SET_RAW(n);
1667 sn->end = (UChar* )p;
1668 }
1669 }
1670 return n;
1671}
1672
1673static int
1674str_node_can_be_split(StrNode* sn, OnigEncoding enc)
1675{
1676 if (sn->end > sn->s) {
1677 return ((enclen(enc, sn->s, sn->end) < sn->end - sn->s) ? 1 : 0);
1678 }
1679 return 0;
1680}
1681
1682#ifdef USE_PAD_TO_SHORT_BYTE_CHAR
1683static int
1684node_str_head_pad(StrNode* sn, int num, UChar val)
1685{
1686 UChar buf[NODE_STR_BUF_SIZE];
1687 int i, len;
1688
1689 len = sn->end - sn->s;
1690 onig_strcpy(buf, sn->s, sn->end);
1691 onig_strcpy(&(sn->s[num]), buf, buf + len);
1692 sn->end += num;
1693
1694 for (i = 0; i < num; i++) {
1695 sn->s[i] = val;
1696 }
1697}
1698#endif
1699
1700extern int
1701onig_scan_unsigned_number(UChar** src, const UChar* end, OnigEncoding enc)
1702{
1703 unsigned int num, val;
1704 OnigCodePoint c;
1705 UChar* p = *src;
1706 PFETCH_READY;
1707
1708 num = 0;
1709 while (!PEND) {
1710 PFETCH(c);
1711 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
1712 val = (unsigned int )DIGITVAL(c);
1713 if ((INT_MAX_LIMIT - val) / 10UL < num)
1714 return -1; /* overflow */
1715
1716 num = num * 10 + val;
1717 }
1718 else {
1719 PUNFETCH;
1720 break;
1721 }
1722 }
1723 *src = p;
1724 return num;
1725}
1726
1727static int
1728scan_unsigned_hexadecimal_number(UChar** src, UChar* end, int minlen,
1729 int maxlen, OnigEncoding enc)
1730{
1731 OnigCodePoint c;
1732 unsigned int num, val;
1733 int restlen;
1734 UChar* p = *src;
1735 PFETCH_READY;
1736
1737 restlen = maxlen - minlen;
1738 num = 0;
1739 while (!PEND && maxlen-- != 0) {
1740 PFETCH(c);
1741 if (ONIGENC_IS_CODE_XDIGIT(enc, c)) {
1742 val = (unsigned int )XDIGITVAL(enc,c);
1743 if ((INT_MAX_LIMIT - val) / 16UL < num)
1744 return -1; /* overflow */
1745
1746 num = (num << 4) + XDIGITVAL(enc,c);
1747 }
1748 else {
1749 PUNFETCH;
1750 maxlen++;
1751 break;
1752 }
1753 }
1754 if (maxlen > restlen)
1755 return -2; /* not enough digits */
1756 *src = p;
1757 return num;
1758}
1759
1760static int
1761scan_unsigned_octal_number(UChar** src, UChar* end, int maxlen,
1762 OnigEncoding enc)
1763{
1764 OnigCodePoint c;
1765 unsigned int num, val;
1766 UChar* p = *src;
1767 PFETCH_READY;
1768
1769 num = 0;
1770 while (!PEND && maxlen-- != 0) {
1771 PFETCH(c);
1772 if (ONIGENC_IS_CODE_DIGIT(enc, c) && c < '8') {
1773 val = ODIGITVAL(c);
1774 if ((INT_MAX_LIMIT - val) / 8UL < num)
1775 return -1; /* overflow */
1776
1777 num = (num << 3) + val;
1778 }
1779 else {
1780 PUNFETCH;
1781 break;
1782 }
1783 }
1784 *src = p;
1785 return num;
1786}
1787
1788
1789#define BBUF_WRITE_CODE_POINT(bbuf,pos,code) \
1790 BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT)
1791
1792/* data format:
1793 [n][from-1][to-1][from-2][to-2] ... [from-n][to-n]
1794 (all data size is OnigCodePoint)
1795 */
1796static int
1797new_code_range(BBuf** pbuf)
1798{
1799#define INIT_MULTI_BYTE_RANGE_SIZE (SIZE_CODE_POINT * 5)
1800 int r;
1801 OnigCodePoint n;
1802 BBuf* bbuf;
1803
1804 bbuf = *pbuf = (BBuf* )xmalloc(sizeof(BBuf));
1805 CHECK_NULL_RETURN_MEMERR(*pbuf);
1806 r = BBUF_INIT(*pbuf, INIT_MULTI_BYTE_RANGE_SIZE);
1807 if (r) return r;
1808
1809 n = 0;
1810 BBUF_WRITE_CODE_POINT(bbuf, 0, n);
1811 return 0;
1812}
1813
1814static int
1815add_code_range_to_buf0(BBuf** pbuf, ScanEnv* env, OnigCodePoint from, OnigCodePoint to,
1816 int checkdup)
1817{
1818 int r, inc_n, pos;
1819 OnigCodePoint low, high, bound, x;
1820 OnigCodePoint n, *data;
1821 BBuf* bbuf;
1822
1823 if (from > to) {
1824 n = from; from = to; to = n;
1825 }
1826
1827 if (IS_NULL(*pbuf)) {
1828 r = new_code_range(pbuf);
1829 if (r) return r;
1830 bbuf = *pbuf;
1831 n = 0;
1832 }
1833 else {
1834 bbuf = *pbuf;
1835 GET_CODE_POINT(n, bbuf->p);
1836 }
1837 data = (OnigCodePoint* )(bbuf->p);
1838 data++;
1839
1840 bound = (from == 0) ? 0 : n;
1841 for (low = 0; low < bound; ) {
1842 x = (low + bound) >> 1;
1843 if (from - 1 > data[x*2 + 1])
1844 low = x + 1;
1845 else
1846 bound = x;
1847 }
1848
1849 high = (to == ONIG_LAST_CODE_POINT) ? n : low;
1850 for (bound = n; high < bound; ) {
1851 x = (high + bound) >> 1;
1852 if (to + 1 >= data[x*2])
1853 high = x + 1;
1854 else
1855 bound = x;
1856 }
1857 /* data[(low-1)*2+1] << from <= data[low*2]
1858 * data[(high-1)*2+1] <= to << data[high*2]
1859 */
1860
1861 inc_n = low + 1 - high;
1862 if (n + inc_n > ONIG_MAX_MULTI_BYTE_RANGES_NUM)
1863 return ONIGERR_TOO_MANY_MULTI_BYTE_RANGES;
1864
1865 if (inc_n != 1) {
1866 if (checkdup && from <= data[low*2+1]
1867 && (data[low*2] <= from || data[low*2+1] <= to))
1868 CC_DUP_WARN(env, from, to);
1869 if (from > data[low*2])
1870 from = data[low*2];
1871 if (to < data[(high - 1)*2 + 1])
1872 to = data[(high - 1)*2 + 1];
1873 }
1874
1875 if (inc_n != 0) {
1876 int from_pos = SIZE_CODE_POINT * (1 + high * 2);
1877 int to_pos = SIZE_CODE_POINT * (1 + (low + 1) * 2);
1878
1879 if (inc_n > 0) {
1880 if (high < n) {
1881 int size = (n - high) * 2 * SIZE_CODE_POINT;
1882 BBUF_MOVE_RIGHT(bbuf, from_pos, to_pos, size);
1883 }
1884 }
1885 else {
1886 BBUF_MOVE_LEFT_REDUCE(bbuf, from_pos, to_pos);
1887 }
1888 }
1889
1890 pos = SIZE_CODE_POINT * (1 + low * 2);
1891 BBUF_ENSURE_SIZE(bbuf, pos + SIZE_CODE_POINT * 2);
1892 BBUF_WRITE_CODE_POINT(bbuf, pos, from);
1893 BBUF_WRITE_CODE_POINT(bbuf, pos + SIZE_CODE_POINT, to);
1894 n += inc_n;
1895 BBUF_WRITE_CODE_POINT(bbuf, 0, n);
1896
1897 return 0;
1898}
1899
1900static int
1901add_code_range_to_buf(BBuf** pbuf, ScanEnv* env, OnigCodePoint from, OnigCodePoint to)
1902{
1903 return add_code_range_to_buf0(pbuf, env, from, to, 1);
1904}
1905
1906static int
1907add_code_range0(BBuf** pbuf, ScanEnv* env, OnigCodePoint from, OnigCodePoint to, int checkdup)
1908{
1909 if (from > to) {
1910 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC))
1911 return 0;
1912 else
1913 return ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS;
1914 }
1915
1916 return add_code_range_to_buf0(pbuf, env, from, to, checkdup);
1917}
1918
1919static int
1920add_code_range(BBuf** pbuf, ScanEnv* env, OnigCodePoint from, OnigCodePoint to)
1921{
1922 return add_code_range0(pbuf, env, from, to, 1);
1923}
1924
1925static int
1926not_code_range_buf(OnigEncoding enc, BBuf* bbuf, BBuf** pbuf, ScanEnv* env)
1927{
1928 int r, i, n;
1929 OnigCodePoint pre, from, *data, to = 0;
1930
1931 *pbuf = (BBuf* )NULL;
1932 if (IS_NULL(bbuf)) {
1933 set_all:
1934 return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf);
1935 }
1936
1937 data = (OnigCodePoint* )(bbuf->p);
1938 GET_CODE_POINT(n, data);
1939 data++;
1940 if (n <= 0) goto set_all;
1941
1942 r = 0;
1943 pre = MBCODE_START_POS(enc);
1944 for (i = 0; i < n; i++) {
1945 from = data[i*2];
1946 to = data[i*2+1];
1947 if (pre <= from - 1) {
1948 r = add_code_range_to_buf(pbuf, env, pre, from - 1);
1949 if (r != 0) return r;
1950 }
1951 if (to == ONIG_LAST_CODE_POINT) break;
1952 pre = to + 1;
1953 }
1954 if (to < ONIG_LAST_CODE_POINT) {
1955 r = add_code_range_to_buf(pbuf, env, to + 1, ONIG_LAST_CODE_POINT);
1956 }
1957 return r;
1958}
1959
1960#define SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2) do {\
1961 BBuf *tbuf; \
1962 int tnot; \
1963 tnot = not1; not1 = not2; not2 = tnot; \
1964 tbuf = bbuf1; bbuf1 = bbuf2; bbuf2 = tbuf; \
1965} while (0)
1966
1967static int
1968or_code_range_buf(OnigEncoding enc, BBuf* bbuf1, int not1,
1969 BBuf* bbuf2, int not2, BBuf** pbuf, ScanEnv* env)
1970{
1971 int r;
1972 OnigCodePoint i, n1, *data1;
1973 OnigCodePoint from, to;
1974
1975 *pbuf = (BBuf* )NULL;
1976 if (IS_NULL(bbuf1) && IS_NULL(bbuf2)) {
1977 if (not1 != 0 || not2 != 0)
1978 return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf);
1979 return 0;
1980 }
1981
1982 r = 0;
1983 if (IS_NULL(bbuf2))
1984 SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2);
1985
1986 if (IS_NULL(bbuf1)) {
1987 if (not1 != 0) {
1988 return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf);
1989 }
1990 else {
1991 if (not2 == 0) {
1992 return bbuf_clone(pbuf, bbuf2);
1993 }
1994 else {
1995 return not_code_range_buf(enc, bbuf2, pbuf, env);
1996 }
1997 }
1998 }
1999
2000 if (not1 != 0)
2001 SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2);
2002
2003 data1 = (OnigCodePoint* )(bbuf1->p);
2004 GET_CODE_POINT(n1, data1);
2005 data1++;
2006
2007 if (not2 == 0 && not1 == 0) { /* 1 OR 2 */
2008 r = bbuf_clone(pbuf, bbuf2);
2009 }
2010 else if (not1 == 0) { /* 1 OR (not 2) */
2011 r = not_code_range_buf(enc, bbuf2, pbuf, env);
2012 }
2013 if (r != 0) return r;
2014
2015 for (i = 0; i < n1; i++) {
2016 from = data1[i*2];
2017 to = data1[i*2+1];
2018 r = add_code_range_to_buf(pbuf, env, from, to);
2019 if (r != 0) return r;
2020 }
2021 return 0;
2022}
2023
2024static int
2025and_code_range1(BBuf** pbuf, ScanEnv* env, OnigCodePoint from1, OnigCodePoint to1,
2026 OnigCodePoint* data, int n)
2027{
2028 int i, r;
2029 OnigCodePoint from2, to2;
2030
2031 for (i = 0; i < n; i++) {
2032 from2 = data[i*2];
2033 to2 = data[i*2+1];
2034 if (from2 < from1) {
2035 if (to2 < from1) continue;
2036 else {
2037 from1 = to2 + 1;
2038 }
2039 }
2040 else if (from2 <= to1) {
2041 if (to2 < to1) {
2042 if (from1 <= from2 - 1) {
2043 r = add_code_range_to_buf(pbuf, env, from1, from2-1);
2044 if (r != 0) return r;
2045 }
2046 from1 = to2 + 1;
2047 }
2048 else {
2049 to1 = from2 - 1;
2050 }
2051 }
2052 else {
2053 from1 = from2;
2054 }
2055 if (from1 > to1) break;
2056 }
2057 if (from1 <= to1) {
2058 r = add_code_range_to_buf(pbuf, env, from1, to1);
2059 if (r != 0) return r;
2060 }
2061 return 0;
2062}
2063
2064static int
2065and_code_range_buf(BBuf* bbuf1, int not1, BBuf* bbuf2, int not2, BBuf** pbuf, ScanEnv* env)
2066{
2067 int r;
2068 OnigCodePoint i, j, n1, n2, *data1, *data2;
2069 OnigCodePoint from, to, from1, to1, from2, to2;
2070
2071 *pbuf = (BBuf* )NULL;
2072 if (IS_NULL(bbuf1)) {
2073 if (not1 != 0 && IS_NOT_NULL(bbuf2)) /* not1 != 0 -> not2 == 0 */
2074 return bbuf_clone(pbuf, bbuf2);
2075 return 0;
2076 }
2077 else if (IS_NULL(bbuf2)) {
2078 if (not2 != 0)
2079 return bbuf_clone(pbuf, bbuf1);
2080 return 0;
2081 }
2082
2083 if (not1 != 0)
2084 SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2);
2085
2086 data1 = (OnigCodePoint* )(bbuf1->p);
2087 data2 = (OnigCodePoint* )(bbuf2->p);
2088 GET_CODE_POINT(n1, data1);
2089 GET_CODE_POINT(n2, data2);
2090 data1++;
2091 data2++;
2092
2093 if (not2 == 0 && not1 == 0) { /* 1 AND 2 */
2094 for (i = 0; i < n1; i++) {
2095 from1 = data1[i*2];
2096 to1 = data1[i*2+1];
2097 for (j = 0; j < n2; j++) {
2098 from2 = data2[j*2];
2099 to2 = data2[j*2+1];
2100 if (from2 > to1) break;
2101 if (to2 < from1) continue;
2102 from = MAX(from1, from2);
2103 to = MIN(to1, to2);
2104 r = add_code_range_to_buf(pbuf, env, from, to);
2105 if (r != 0) return r;
2106 }
2107 }
2108 }
2109 else if (not1 == 0) { /* 1 AND (not 2) */
2110 for (i = 0; i < n1; i++) {
2111 from1 = data1[i*2];
2112 to1 = data1[i*2+1];
2113 r = and_code_range1(pbuf, env, from1, to1, data2, n2);
2114 if (r != 0) return r;
2115 }
2116 }
2117
2118 return 0;
2119}
2120
2121static int
2122and_cclass(CClassNode* dest, CClassNode* cc, ScanEnv* env)
2123{
2124 OnigEncoding enc = env->enc;
2125 int r, not1, not2;
2126 BBuf *buf1, *buf2, *pbuf = 0;
2127 BitSetRef bsr1, bsr2;
2128 BitSet bs1, bs2;
2129
2130 not1 = IS_NCCLASS_NOT(dest);
2131 bsr1 = dest->bs;
2132 buf1 = dest->mbuf;
2133 not2 = IS_NCCLASS_NOT(cc);
2134 bsr2 = cc->bs;
2135 buf2 = cc->mbuf;
2136
2137 if (not1 != 0) {
2138 bitset_invert_to(bsr1, bs1);
2139 bsr1 = bs1;
2140 }
2141 if (not2 != 0) {
2142 bitset_invert_to(bsr2, bs2);
2143 bsr2 = bs2;
2144 }
2145 bitset_and(bsr1, bsr2);
2146 if (bsr1 != dest->bs) {
2147 bitset_copy(dest->bs, bsr1);
2148 bsr1 = dest->bs;
2149 }
2150 if (not1 != 0) {
2151 bitset_invert(dest->bs);
2152 }
2153
2154 if (! ONIGENC_IS_SINGLEBYTE(enc)) {
2155 if (not1 != 0 && not2 != 0) {
2156 r = or_code_range_buf(enc, buf1, 0, buf2, 0, &pbuf, env);
2157 }
2158 else {
2159 r = and_code_range_buf(buf1, not1, buf2, not2, &pbuf, env);
2160 if (r == 0 && not1 != 0) {
2161 BBuf *tbuf = 0;
2162 r = not_code_range_buf(enc, pbuf, &tbuf, env);
2163 bbuf_free(pbuf);
2164 pbuf = tbuf;
2165 }
2166 }
2167 if (r != 0) {
2168 bbuf_free(pbuf);
2169 return r;
2170 }
2171
2172 dest->mbuf = pbuf;
2173 bbuf_free(buf1);
2174 return r;
2175 }
2176 return 0;
2177}
2178
2179static int
2180or_cclass(CClassNode* dest, CClassNode* cc, ScanEnv* env)
2181{
2182 OnigEncoding enc = env->enc;
2183 int r, not1, not2;
2184 BBuf *buf1, *buf2, *pbuf = 0;
2185 BitSetRef bsr1, bsr2;
2186 BitSet bs1, bs2;
2187
2188 not1 = IS_NCCLASS_NOT(dest);
2189 bsr1 = dest->bs;
2190 buf1 = dest->mbuf;
2191 not2 = IS_NCCLASS_NOT(cc);
2192 bsr2 = cc->bs;
2193 buf2 = cc->mbuf;
2194
2195 if (not1 != 0) {
2196 bitset_invert_to(bsr1, bs1);
2197 bsr1 = bs1;
2198 }
2199 if (not2 != 0) {
2200 bitset_invert_to(bsr2, bs2);
2201 bsr2 = bs2;
2202 }
2203 bitset_or(bsr1, bsr2);
2204 if (bsr1 != dest->bs) {
2205 bitset_copy(dest->bs, bsr1);
2206 bsr1 = dest->bs;
2207 }
2208 if (not1 != 0) {
2209 bitset_invert(dest->bs);
2210 }
2211
2212 if (! ONIGENC_IS_SINGLEBYTE(enc)) {
2213 if (not1 != 0 && not2 != 0) {
2214 r = and_code_range_buf(buf1, 0, buf2, 0, &pbuf, env);
2215 }
2216 else {
2217 r = or_code_range_buf(enc, buf1, not1, buf2, not2, &pbuf, env);
2218 if (r == 0 && not1 != 0) {
2219 BBuf *tbuf = 0;
2220 r = not_code_range_buf(enc, pbuf, &tbuf, env);
2221 bbuf_free(pbuf);
2222 pbuf = tbuf;
2223 }
2224 }
2225 if (r != 0) {
2226 bbuf_free(pbuf);
2227 return r;
2228 }
2229
2230 dest->mbuf = pbuf;
2231 bbuf_free(buf1);
2232 return r;
2233 }
2234 else
2235 return 0;
2236}
2237
2238static void UNKNOWN_ESC_WARN(ScanEnv *env, int c);
2239
2240static OnigCodePoint
2241conv_backslash_value(OnigCodePoint c, ScanEnv* env)
2242{
2243 if (IS_SYNTAX_OP(env->syntax, ONIG_SYN_OP_ESC_CONTROL_CHARS)) {
2244 switch (c) {
2245 case 'n': return '\n';
2246 case 't': return '\t';
2247 case 'r': return '\r';
2248 case 'f': return '\f';
2249 case 'a': return '\007';
2250 case 'b': return '\010';
2251 case 'e': return '\033';
2252 case 'v':
2253 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ESC_V_VTAB))
2254 return '\v';
2255 break;
2256
2257 default:
2258 if (('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z'))
2259 UNKNOWN_ESC_WARN(env, c);
2260 break;
2261 }
2262 }
2263 return c;
2264}
2265
2266#ifdef USE_NO_INVALID_QUANTIFIER
2267# define is_invalid_quantifier_target(node) 0
2268#else
2269static int
2270is_invalid_quantifier_target(Node* node)
2271{
2272 switch (NTYPE(node)) {
2273 case NT_ANCHOR:
2274 return 1;
2275 break;
2276
2277 case NT_ENCLOSE:
2278 /* allow enclosed elements */
2279 /* return is_invalid_quantifier_target(NENCLOSE(node)->target); */
2280 break;
2281
2282 case NT_LIST:
2283 do {
2284 if (! is_invalid_quantifier_target(NCAR(node))) return 0;
2285 } while (IS_NOT_NULL(node = NCDR(node)));
2286 return 0;
2287 break;
2288
2289 case NT_ALT:
2290 do {
2291 if (is_invalid_quantifier_target(NCAR(node))) return 1;
2292 } while (IS_NOT_NULL(node = NCDR(node)));
2293 break;
2294
2295 default:
2296 break;
2297 }
2298 return 0;
2299}
2300#endif
2301
2302/* ?:0, *:1, +:2, ??:3, *?:4, +?:5 */
2303static int
2304popular_quantifier_num(QtfrNode* q)
2305{
2306 if (q->greedy) {
2307 if (q->lower == 0) {
2308 if (q->upper == 1) return 0;
2309 else if (IS_REPEAT_INFINITE(q->upper)) return 1;
2310 }
2311 else if (q->lower == 1) {
2312 if (IS_REPEAT_INFINITE(q->upper)) return 2;
2313 }
2314 }
2315 else {
2316 if (q->lower == 0) {
2317 if (q->upper == 1) return 3;
2318 else if (IS_REPEAT_INFINITE(q->upper)) return 4;
2319 }
2320 else if (q->lower == 1) {
2321 if (IS_REPEAT_INFINITE(q->upper)) return 5;
2322 }
2323 }
2324 return -1;
2325}
2326
2327
2328enum ReduceType {
2329 RQ_ASIS = 0, /* as is */
2330 RQ_DEL = 1, /* delete parent */
2331 RQ_A, /* to '*' */
2332 RQ_AQ, /* to '*?' */
2333 RQ_QQ, /* to '??' */
2334 RQ_P_QQ, /* to '+)??' */
2335};
2336
2337static enum ReduceType const ReduceTypeTable[6][6] = {
2338/* '?', '*', '+', '??', '*?', '+?' p / c */
2339 {RQ_DEL, RQ_A, RQ_A, RQ_QQ, RQ_AQ, RQ_ASIS}, /* '?' */
2340 {RQ_DEL, RQ_DEL, RQ_DEL, RQ_P_QQ, RQ_P_QQ, RQ_DEL}, /* '*' */
2341 {RQ_A, RQ_A, RQ_DEL, RQ_ASIS, RQ_P_QQ, RQ_DEL}, /* '+' */
2342 {RQ_DEL, RQ_AQ, RQ_AQ, RQ_DEL, RQ_AQ, RQ_AQ}, /* '??' */
2343 {RQ_DEL, RQ_DEL, RQ_DEL, RQ_DEL, RQ_DEL, RQ_DEL}, /* '*?' */
2344 {RQ_ASIS, RQ_ASIS, RQ_ASIS, RQ_AQ, RQ_AQ, RQ_DEL} /* '+?' */
2345};
2346
2347extern void
2348onig_reduce_nested_quantifier(Node* pnode, Node* cnode)
2349{
2350 int pnum, cnum;
2351 QtfrNode *p, *c;
2352
2353 p = NQTFR(pnode);
2354 c = NQTFR(cnode);
2355 pnum = popular_quantifier_num(p);
2356 cnum = popular_quantifier_num(c);
2357 if (pnum < 0 || cnum < 0) return ;
2358
2359 switch (ReduceTypeTable[cnum][pnum]) {
2360 case RQ_DEL:
2361 *pnode = *cnode;
2362 break;
2363 case RQ_A:
2364 p->target = c->target;
2365 p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 1;
2366 break;
2367 case RQ_AQ:
2368 p->target = c->target;
2369 p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 0;
2370 break;
2371 case RQ_QQ:
2372 p->target = c->target;
2373 p->lower = 0; p->upper = 1; p->greedy = 0;
2374 break;
2375 case RQ_P_QQ:
2376 p->target = cnode;
2377 p->lower = 0; p->upper = 1; p->greedy = 0;
2378 c->lower = 1; c->upper = REPEAT_INFINITE; c->greedy = 1;
2379 return ;
2380 break;
2381 case RQ_ASIS:
2382 p->target = cnode;
2383 return ;
2384 break;
2385 }
2386
2387 c->target = NULL_NODE;
2388 onig_node_free(cnode);
2389}
2390
2391
2392enum TokenSyms {
2393 TK_EOT = 0, /* end of token */
2394 TK_RAW_BYTE = 1,
2395 TK_CHAR,
2396 TK_STRING,
2397 TK_CODE_POINT,
2398 TK_ANYCHAR,
2399 TK_CHAR_TYPE,
2400 TK_BACKREF,
2401 TK_CALL,
2402 TK_ANCHOR,
2403 TK_OP_REPEAT,
2404 TK_INTERVAL,
2405 TK_ANYCHAR_ANYTIME, /* SQL '%' == .* */
2406 TK_ALT,
2407 TK_SUBEXP_OPEN,
2408 TK_SUBEXP_CLOSE,
2409 TK_CC_OPEN,
2410 TK_QUOTE_OPEN,
2411 TK_CHAR_PROPERTY, /* \p{...}, \P{...} */
2412 TK_LINEBREAK,
2413 TK_EXTENDED_GRAPHEME_CLUSTER,
2414 TK_KEEP,
2415 /* in cc */
2416 TK_CC_CLOSE,
2417 TK_CC_RANGE,
2418 TK_POSIX_BRACKET_OPEN,
2419 TK_CC_AND, /* && */
2420 TK_CC_CC_OPEN /* [ */
2421};
2422
2423typedef struct {
2424 enum TokenSyms type;
2425 int escaped;
2426 int base; /* is number: 8, 16 (used in [....]) */
2427 UChar* backp;
2428 union {
2429 UChar* s;
2430 int c;
2431 OnigCodePoint code;
2432 struct {
2433 int subtype;
2434 int ascii_range;
2435 } anchor;
2436 struct {
2437 int lower;
2438 int upper;
2439 int greedy;
2440 int possessive;
2441 } repeat;
2442 struct {
2443 int num;
2444 int ref1;
2445 int* refs;
2446 int by_name;
2447#ifdef USE_BACKREF_WITH_LEVEL
2448 int exist_level;
2449 int level; /* \k<name+n> */
2450#endif
2451 } backref;
2452 struct {
2453 UChar* name;
2454 UChar* name_end;
2455 int gnum;
2456 int rel;
2457 } call;
2458 struct {
2459 int ctype;
2460 int not;
2461 } prop;
2462 } u;
2463} OnigToken;
2464
2465
2466static int
2467fetch_range_quantifier(UChar** src, UChar* end, OnigToken* tok, ScanEnv* env)
2468{
2469 int low, up, syn_allow, non_low = 0;
2470 int r = 0;
2471 OnigCodePoint c;
2472 OnigEncoding enc = env->enc;
2473 UChar* p = *src;
2474 PFETCH_READY;
2475
2476 syn_allow = IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_INVALID_INTERVAL);
2477
2478 if (PEND) {
2479 if (syn_allow)
2480 return 1; /* "....{" : OK! */
2481 else
2482 return ONIGERR_END_PATTERN_AT_LEFT_BRACE; /* "....{" syntax error */
2483 }
2484
2485 if (! syn_allow) {
2486 c = PPEEK;
2487 if (c == ')' || c == '(' || c == '|') {
2488 return ONIGERR_END_PATTERN_AT_LEFT_BRACE;
2489 }
2490 }
2491
2492 low = onig_scan_unsigned_number(&p, end, env->enc);
2493 if (low < 0) return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2494 if (low > ONIG_MAX_REPEAT_NUM)
2495 return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2496
2497 if (p == *src) { /* can't read low */
2498 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_INTERVAL_LOW_ABBREV)) {
2499 /* allow {,n} as {0,n} */
2500 low = 0;
2501 non_low = 1;
2502 }
2503 else
2504 goto invalid;
2505 }
2506
2507 if (PEND) goto invalid;
2508 PFETCH(c);
2509 if (c == ',') {
2510 UChar* prev = p;
2511 up = onig_scan_unsigned_number(&p, end, env->enc);
2512 if (up < 0) return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2513 if (up > ONIG_MAX_REPEAT_NUM)
2514 return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2515
2516 if (p == prev) {
2517 if (non_low != 0)
2518 goto invalid;
2519 up = REPEAT_INFINITE; /* {n,} : {n,infinite} */
2520 }
2521 }
2522 else {
2523 if (non_low != 0)
2524 goto invalid;
2525
2526 PUNFETCH;
2527 up = low; /* {n} : exact n times */
2528 r = 2; /* fixed */
2529 }
2530
2531 if (PEND) goto invalid;
2532 PFETCH(c);
2533 if (IS_SYNTAX_OP(env->syntax, ONIG_SYN_OP_ESC_BRACE_INTERVAL)) {
2534 if (c != MC_ESC(env->syntax)) goto invalid;
2535 if (PEND) goto invalid;
2536 PFETCH(c);
2537 }
2538 if (c != '}') goto invalid;
2539
2540 if (!IS_REPEAT_INFINITE(up) && low > up) {
2541 return ONIGERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE;
2542 }
2543
2544 tok->type = TK_INTERVAL;
2545 tok->u.repeat.lower = low;
2546 tok->u.repeat.upper = up;
2547 *src = p;
2548 return r; /* 0: normal {n,m}, 2: fixed {n} */
2549
2550 invalid:
2551 if (syn_allow)
2552 return 1; /* OK */
2553 else
2554 return ONIGERR_INVALID_REPEAT_RANGE_PATTERN;
2555}
2556
2557/* \M-, \C-, \c, or \... */
2558static int
2559fetch_escaped_value(UChar** src, UChar* end, ScanEnv* env, OnigCodePoint* val)
2560{
2561 int v;
2562 OnigCodePoint c;
2563 OnigEncoding enc = env->enc;
2564 UChar* p = *src;
2565
2566 if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE;
2567
2568 PFETCH_S(c);
2569 switch (c) {
2570 case 'M':
2571 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ESC_CAPITAL_M_BAR_META)) {
2572 if (PEND) return ONIGERR_END_PATTERN_AT_META;
2573 PFETCH_S(c);
2574 if (c != '-') return ONIGERR_META_CODE_SYNTAX;
2575 if (PEND) return ONIGERR_END_PATTERN_AT_META;
2576 PFETCH_S(c);
2577 if (c == MC_ESC(env->syntax)) {
2578 v = fetch_escaped_value(&p, end, env, &c);
2579 if (v < 0) return v;
2580 }
2581 c = ((c & 0xff) | 0x80);
2582 }
2583 else
2584 goto backslash;
2585 break;
2586
2587 case 'C':
2588 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ESC_CAPITAL_C_BAR_CONTROL)) {
2589 if (PEND) return ONIGERR_END_PATTERN_AT_CONTROL;
2590 PFETCH_S(c);
2591 if (c != '-') return ONIGERR_CONTROL_CODE_SYNTAX;
2592 goto control;
2593 }
2594 else
2595 goto backslash;
2596
2597 case 'c':
2598 if (IS_SYNTAX_OP(env->syntax, ONIG_SYN_OP_ESC_C_CONTROL)) {
2599 control:
2600 if (PEND) return ONIGERR_END_PATTERN_AT_CONTROL;
2601 PFETCH_S(c);
2602 if (c == '?') {
2603 c = 0177;
2604 }
2605 else {
2606 if (c == MC_ESC(env->syntax)) {
2607 v = fetch_escaped_value(&p, end, env, &c);
2608 if (v < 0) return v;
2609 }
2610 c &= 0x9f;
2611 }
2612 break;
2613 }
2614 /* fall through */
2615
2616 default:
2617 {
2618 backslash:
2619 c = conv_backslash_value(c, env);
2620 }
2621 break;
2622 }
2623
2624 *src = p;
2625 *val = c;
2626 return 0;
2627}
2628
2629static int fetch_token(OnigToken* tok, UChar** src, UChar* end, ScanEnv* env);
2630
2631static OnigCodePoint
2632get_name_end_code_point(OnigCodePoint start)
2633{
2634 switch (start) {
2635 case '<': return (OnigCodePoint )'>'; break;
2636 case '\'': return (OnigCodePoint )'\''; break;
2637 case '(': return (OnigCodePoint )')'; break;
2638 case '{': return (OnigCodePoint )'}'; break;
2639 default:
2640 break;
2641 }
2642
2643 return (OnigCodePoint )0;
2644}
2645
2646#ifdef USE_NAMED_GROUP
2647# ifdef RUBY
2648# define ONIGENC_IS_CODE_NAME(enc, c) TRUE
2649# else
2650# define ONIGENC_IS_CODE_NAME(enc, c) ONIGENC_IS_CODE_WORD(enc, c)
2651# endif
2652
2653# ifdef USE_BACKREF_WITH_LEVEL
2654/*
2655 \k<name+n>, \k<name-n>
2656 \k<num+n>, \k<num-n>
2657 \k<-num+n>, \k<-num-n>
2658*/
2659static int
2660fetch_name_with_level(OnigCodePoint start_code, UChar** src, UChar* end,
2661 UChar** rname_end, ScanEnv* env,
2662 int* rback_num, int* rlevel)
2663{
2664 int r, sign, is_num, exist_level;
2665 OnigCodePoint end_code;
2666 OnigCodePoint c = 0;
2667 OnigEncoding enc = env->enc;
2668 UChar *name_end;
2669 UChar *pnum_head;
2670 UChar *p = *src;
2671 PFETCH_READY;
2672
2673 *rback_num = 0;
2674 is_num = exist_level = 0;
2675 sign = 1;
2676 pnum_head = *src;
2677
2678 end_code = get_name_end_code_point(start_code);
2679
2680 name_end = end;
2681 r = 0;
2682 if (PEND) {
2683 return ONIGERR_EMPTY_GROUP_NAME;
2684 }
2685 else {
2686 PFETCH(c);
2687 if (c == end_code)
2688 return ONIGERR_EMPTY_GROUP_NAME;
2689
2690 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2691 is_num = 1;
2692 }
2693 else if (c == '-') {
2694 is_num = 2;
2695 sign = -1;
2696 pnum_head = p;
2697 }
2698 else if (!ONIGENC_IS_CODE_NAME(enc, c)) {
2699 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2700 }
2701 }
2702
2703 while (!PEND) {
2704 name_end = p;
2705 PFETCH(c);
2706 if (c == end_code || c == ')' || c == '+' || c == '-') {
2707 if (is_num == 2) r = ONIGERR_INVALID_GROUP_NAME;
2708 break;
2709 }
2710
2711 if (is_num != 0) {
2712 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2713 is_num = 1;
2714 }
2715 else {
2716 r = ONIGERR_INVALID_GROUP_NAME;
2717 is_num = 0;
2718 }
2719 }
2720 else if (!ONIGENC_IS_CODE_NAME(enc, c)) {
2721 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2722 }
2723 }
2724
2725 if (r == 0 && c != end_code) {
2726 if (c == '+' || c == '-') {
2727 int level;
2728 int flag = (c == '-' ? -1 : 1);
2729
2730 if (PEND) {
2731 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2732 goto end;
2733 }
2734 PFETCH(c);
2735 if (! ONIGENC_IS_CODE_DIGIT(enc, c)) goto err;
2736 PUNFETCH;
2737 level = onig_scan_unsigned_number(&p, end, enc);
2738 if (level < 0) return ONIGERR_TOO_BIG_NUMBER;
2739 *rlevel = (level * flag);
2740 exist_level = 1;
2741
2742 if (!PEND) {
2743 PFETCH(c);
2744 if (c == end_code)
2745 goto end;
2746 }
2747 }
2748
2749 err:
2750 r = ONIGERR_INVALID_GROUP_NAME;
2751 name_end = end;
2752 }
2753
2754 end:
2755 if (r == 0) {
2756 if (is_num != 0) {
2757 *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc);
2758 if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER;
2759 else if (*rback_num == 0) goto err;
2760
2761 *rback_num *= sign;
2762 }
2763
2764 *rname_end = name_end;
2765 *src = p;
2766 return (exist_level ? 1 : 0);
2767 }
2768 else {
2769 onig_scan_env_set_error_string(env, r, *src, name_end);
2770 return r;
2771 }
2772}
2773# endif /* USE_BACKREF_WITH_LEVEL */
2774
2775/*
2776 ref: 0 -> define name (don't allow number name)
2777 1 -> reference name (allow number name)
2778*/
2779static int
2780fetch_name(OnigCodePoint start_code, UChar** src, UChar* end,
2781 UChar** rname_end, ScanEnv* env, int* rback_num, int ref)
2782{
2783 int r, is_num, sign;
2784 OnigCodePoint end_code;
2785 OnigCodePoint c = 0;
2786 OnigEncoding enc = env->enc;
2787 UChar *name_end;
2788 UChar *pnum_head;
2789 UChar *p = *src;
2790
2791 *rback_num = 0;
2792
2793 end_code = get_name_end_code_point(start_code);
2794
2795 name_end = end;
2796 pnum_head = *src;
2797 r = 0;
2798 is_num = 0;
2799 sign = 1;
2800 if (PEND) {
2801 return ONIGERR_EMPTY_GROUP_NAME;
2802 }
2803 else {
2804 PFETCH_S(c);
2805 if (c == end_code)
2806 return ONIGERR_EMPTY_GROUP_NAME;
2807
2808 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2809 if (ref == 1)
2810 is_num = 1;
2811 else {
2812 r = ONIGERR_INVALID_GROUP_NAME;
2813 is_num = 0;
2814 }
2815 }
2816 else if (c == '-') {
2817 if (ref == 1) {
2818 is_num = 2;
2819 sign = -1;
2820 pnum_head = p;
2821 }
2822 else {
2823 r = ONIGERR_INVALID_GROUP_NAME;
2824 is_num = 0;
2825 }
2826 }
2827 else if (!ONIGENC_IS_CODE_NAME(enc, c)) {
2828 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2829 }
2830 }
2831
2832 if (r == 0) {
2833 while (!PEND) {
2834 name_end = p;
2835 PFETCH_S(c);
2836 if (c == end_code || c == ')') {
2837 if (is_num == 2) {
2838 r = ONIGERR_INVALID_GROUP_NAME;
2839 goto teardown;
2840 }
2841 break;
2842 }
2843
2844 if (is_num != 0) {
2845 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2846 is_num = 1;
2847 }
2848 else {
2849 if (!ONIGENC_IS_CODE_WORD(enc, c))
2850 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2851 else
2852 r = ONIGERR_INVALID_GROUP_NAME;
2853 goto teardown;
2854 }
2855 }
2856 else {
2857 if (!ONIGENC_IS_CODE_NAME(enc, c)) {
2858 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2859 goto teardown;
2860 }
2861 }
2862 }
2863
2864 if (c != end_code) {
2865 r = ONIGERR_INVALID_GROUP_NAME;
2866 name_end = end;
2867 goto err;
2868 }
2869
2870 if (is_num != 0) {
2871 *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc);
2872 if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER;
2873 else if (*rback_num == 0) {
2874 r = ONIGERR_INVALID_GROUP_NAME;
2875 goto err;
2876 }
2877
2878 *rback_num *= sign;
2879 }
2880
2881 *rname_end = name_end;
2882 *src = p;
2883 return 0;
2884 }
2885 else {
2886teardown:
2887 while (!PEND) {
2888 name_end = p;
2889 PFETCH_S(c);
2890 if (c == end_code || c == ')')
2891 break;
2892 }
2893 if (PEND)
2894 name_end = end;
2895
2896 err:
2897 onig_scan_env_set_error_string(env, r, *src, name_end);
2898 return r;
2899 }
2900}
2901#else
2902static int
2903fetch_name(OnigCodePoint start_code, UChar** src, UChar* end,
2904 UChar** rname_end, ScanEnv* env, int* rback_num, int ref)
2905{
2906 int r, is_num, sign;
2907 OnigCodePoint end_code;
2908 OnigCodePoint c = 0;
2909 UChar *name_end;
2910 OnigEncoding enc = env->enc;
2911 UChar *pnum_head;
2912 UChar *p = *src;
2913 PFETCH_READY;
2914
2915 *rback_num = 0;
2916
2917 end_code = get_name_end_code_point(start_code);
2918
2919 *rname_end = name_end = end;
2920 r = 0;
2921 pnum_head = *src;
2922 is_num = 0;
2923 sign = 1;
2924
2925 if (PEND) {
2926 return ONIGERR_EMPTY_GROUP_NAME;
2927 }
2928 else {
2929 PFETCH(c);
2930 if (c == end_code)
2931 return ONIGERR_EMPTY_GROUP_NAME;
2932
2933 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2934 is_num = 1;
2935 }
2936 else if (c == '-') {
2937 is_num = 2;
2938 sign = -1;
2939 pnum_head = p;
2940 }
2941 else {
2942 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2943 }
2944 }
2945
2946 while (!PEND) {
2947 name_end = p;
2948
2949 PFETCH(c);
2950 if (c == end_code || c == ')') break;
2951 if (! ONIGENC_IS_CODE_DIGIT(enc, c))
2952 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2953 }
2954 if (r == 0 && c != end_code) {
2955 r = ONIGERR_INVALID_GROUP_NAME;
2956 name_end = end;
2957 }
2958
2959 if (r == 0) {
2960 *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc);
2961 if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER;
2962 else if (*rback_num == 0) {
2963 r = ONIGERR_INVALID_GROUP_NAME;
2964 goto err;
2965 }
2966 *rback_num *= sign;
2967
2968 *rname_end = name_end;
2969 *src = p;
2970 return 0;
2971 }
2972 else {
2973 err:
2974 onig_scan_env_set_error_string(env, r, *src, name_end);
2975 return r;
2976 }
2977}
2978#endif /* USE_NAMED_GROUP */
2979
2980
2981#ifdef PRINTF_ARGS
2982PRINTF_ARGS(static void onig_syntax_warn(ScanEnv *env, const char *fmt, ...), 2, 3);
2983#endif
2984
2985static void
2986onig_syntax_warn(ScanEnv *env, const char *fmt, ...)
2987{
2988 va_list args;
2989 UChar buf[WARN_BUFSIZE];
2990 va_start(args, fmt);
2991 onig_vsnprintf_with_pattern(buf, WARN_BUFSIZE, env->enc,
2992 env->pattern, env->pattern_end,
2993 fmt, args);
2994 va_end(args);
2995#ifdef RUBY
2996 if (env->sourcefile == NULL)
2997 rb_warn("%s", (char *)buf);
2998 else
2999 rb_compile_warn(env->sourcefile, env->sourceline, "%s", (char *)buf);
3000#else
3001 (*onig_warn)((char* )buf);
3002#endif
3003}
3004
3005static void
3006CC_ESC_WARN(ScanEnv *env, UChar *c)
3007{
3008 if (onig_warn == onig_null_warn) return ;
3009
3010 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_WARN_CC_OP_NOT_ESCAPED) &&
3011 IS_SYNTAX_BV(env->syntax, ONIG_SYN_BACKSLASH_ESCAPE_IN_CC)) {
3012 onig_syntax_warn(env, "character class has '%s' without escape", c);
3013 }
3014}
3015
3016static void
3017CLOSE_BRACKET_WITHOUT_ESC_WARN(ScanEnv* env, UChar* c)
3018{
3019 if (onig_warn == onig_null_warn) return ;
3020
3021 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_WARN_CC_OP_NOT_ESCAPED)) {
3022 onig_syntax_warn(env, "regular expression has '%s' without escape", c);
3023 }
3024}
3025
3026#ifndef RTEST
3027# define RTEST(v) 1
3028#endif
3029
3030static void
3031CC_DUP_WARN(ScanEnv *env, OnigCodePoint from ARG_UNUSED, OnigCodePoint to ARG_UNUSED)
3032{
3033 if (onig_warn == onig_null_warn || !RTEST(ruby_verbose)) return ;
3034
3035 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_WARN_CC_DUP) &&
3036 !(env->warnings_flag & ONIG_SYN_WARN_CC_DUP)) {
3037#ifdef WARN_ALL_CC_DUP
3038 onig_syntax_warn(env, "character class has duplicated range: %04x-%04x", from, to);
3039#else
3040 env->warnings_flag |= ONIG_SYN_WARN_CC_DUP;
3041 onig_syntax_warn(env, "character class has duplicated range");
3042#endif
3043 }
3044}
3045
3046static void
3047UNKNOWN_ESC_WARN(ScanEnv *env, int c)
3048{
3049 if (onig_warn == onig_null_warn || !RTEST(ruby_verbose)) return ;
3050 onig_syntax_warn(env, "Unknown escape \\%c is ignored", c);
3051}
3052
3053static UChar*
3054find_str_position(OnigCodePoint s[], int n, UChar* from, UChar* to,
3055 UChar **next, OnigEncoding enc)
3056{
3057 int i;
3058 OnigCodePoint x;
3059 UChar *q;
3060 UChar *p = from;
3061
3062 while (p < to) {
3063 x = ONIGENC_MBC_TO_CODE(enc, p, to);
3064 q = p + enclen(enc, p, to);
3065 if (x == s[0]) {
3066 for (i = 1; i < n && q < to; i++) {
3067 x = ONIGENC_MBC_TO_CODE(enc, q, to);
3068 if (x != s[i]) break;
3069 q += enclen(enc, q, to);
3070 }
3071 if (i >= n) {
3072 if (IS_NOT_NULL(next))
3073 *next = q;
3074 return p;
3075 }
3076 }
3077 p = q;
3078 }
3079 return NULL_UCHARP;
3080}
3081
3082static int
3083str_exist_check_with_esc(OnigCodePoint s[], int n, UChar* from, UChar* to,
3084 OnigCodePoint bad, OnigEncoding enc, const OnigSyntaxType* syn)
3085{
3086 int i, in_esc;
3087 OnigCodePoint x;
3088 UChar *q;
3089 UChar *p = from;
3090
3091 in_esc = 0;
3092 while (p < to) {
3093 if (in_esc) {
3094 in_esc = 0;
3095 p += enclen(enc, p, to);
3096 }
3097 else {
3098 x = ONIGENC_MBC_TO_CODE(enc, p, to);
3099 q = p + enclen(enc, p, to);
3100 if (x == s[0]) {
3101 for (i = 1; i < n && q < to; i++) {
3102 x = ONIGENC_MBC_TO_CODE(enc, q, to);
3103 if (x != s[i]) break;
3104 q += enclen(enc, q, to);
3105 }
3106 if (i >= n) return 1;
3107 p += enclen(enc, p, to);
3108 }
3109 else {
3110 x = ONIGENC_MBC_TO_CODE(enc, p, to);
3111 if (x == bad) return 0;
3112 else if (x == MC_ESC(syn)) in_esc = 1;
3113 p = q;
3114 }
3115 }
3116 }
3117 return 0;
3118}
3119
3120static int
3121fetch_token_in_cc(OnigToken* tok, UChar** src, UChar* end, ScanEnv* env)
3122{
3123 int num;
3124 OnigCodePoint c, c2;
3125 const OnigSyntaxType* syn = env->syntax;
3126 OnigEncoding enc = env->enc;
3127 UChar* prev;
3128 UChar* p = *src;
3129 PFETCH_READY;
3130
3131 if (PEND) {
3132 tok->type = TK_EOT;
3133 return tok->type;
3134 }
3135
3136 PFETCH(c);
3137 tok->type = TK_CHAR;
3138 tok->base = 0;
3139 tok->u.c = c;
3140 tok->escaped = 0;
3141
3142 if (c == ']') {
3143 tok->type = TK_CC_CLOSE;
3144 }
3145 else if (c == '-') {
3146 tok->type = TK_CC_RANGE;
3147 }
3148 else if (c == MC_ESC(syn)) {
3149 if (! IS_SYNTAX_BV(syn, ONIG_SYN_BACKSLASH_ESCAPE_IN_CC))
3150 goto end;
3151
3152 if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE;
3153
3154 PFETCH(c);
3155 tok->escaped = 1;
3156 tok->u.c = c;
3157 switch (c) {
3158 case 'w':
3159 tok->type = TK_CHAR_TYPE;
3160 tok->u.prop.ctype = ONIGENC_CTYPE_WORD;
3161 tok->u.prop.not = 0;
3162 break;
3163 case 'W':
3164 tok->type = TK_CHAR_TYPE;
3165 tok->u.prop.ctype = ONIGENC_CTYPE_WORD;
3166 tok->u.prop.not = 1;
3167 break;
3168 case 'd':
3169 tok->type = TK_CHAR_TYPE;
3170 tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT;
3171 tok->u.prop.not = 0;
3172 break;
3173 case 'D':
3174 tok->type = TK_CHAR_TYPE;
3175 tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT;
3176 tok->u.prop.not = 1;
3177 break;
3178 case 's':
3179 tok->type = TK_CHAR_TYPE;
3180 tok->u.prop.ctype = ONIGENC_CTYPE_SPACE;
3181 tok->u.prop.not = 0;
3182 break;
3183 case 'S':
3184 tok->type = TK_CHAR_TYPE;
3185 tok->u.prop.ctype = ONIGENC_CTYPE_SPACE;
3186 tok->u.prop.not = 1;
3187 break;
3188 case 'h':
3189 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3190 tok->type = TK_CHAR_TYPE;
3191 tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3192 tok->u.prop.not = 0;
3193 break;
3194 case 'H':
3195 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3196 tok->type = TK_CHAR_TYPE;
3197 tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3198 tok->u.prop.not = 1;
3199 break;
3200
3201 case 'p':
3202 case 'P':
3203 if (PEND) break;
3204
3205 c2 = PPEEK;
3206 if (c2 == '{' &&
3207 IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY)) {
3208 PINC;
3209 tok->type = TK_CHAR_PROPERTY;
3210 tok->u.prop.not = (c == 'P' ? 1 : 0);
3211
3212 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT)) {
3213 PFETCH(c2);
3214 if (c2 == '^') {
3215 tok->u.prop.not = (tok->u.prop.not == 0 ? 1 : 0);
3216 }
3217 else
3218 PUNFETCH;
3219 }
3220 }
3221 else {
3222 onig_syntax_warn(env, "invalid Unicode Property \\%c", c);
3223 }
3224 break;
3225
3226 case 'x':
3227 if (PEND) break;
3228
3229 prev = p;
3230 if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_BRACE_HEX8)) {
3231 PINC;
3232 num = scan_unsigned_hexadecimal_number(&p, end, 0, 8, enc);
3233 if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3234 if (!PEND) {
3235 c2 = PPEEK;
3236 if (ONIGENC_IS_CODE_XDIGIT(enc, c2))
3237 return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE;
3238 }
3239
3240 if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) {
3241 PINC;
3242 tok->type = TK_CODE_POINT;
3243 tok->base = 16;
3244 tok->u.code = (OnigCodePoint )num;
3245 }
3246 else {
3247 /* can't read nothing or invalid format */
3248 p = prev;
3249 }
3250 }
3251 else if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_HEX2)) {
3252 num = scan_unsigned_hexadecimal_number(&p, end, 0, 2, enc);
3253 if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3254 if (p == prev) { /* can't read nothing. */
3255 num = 0; /* but, it's not error */
3256 }
3257 tok->type = TK_RAW_BYTE;
3258 tok->base = 16;
3259 tok->u.c = num;
3260 }
3261 break;
3262
3263 case 'u':
3264 if (PEND) break;
3265
3266 prev = p;
3267 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_U_HEX4)) {
3268 num = scan_unsigned_hexadecimal_number(&p, end, 4, 4, enc);
3269 if (num < -1) return ONIGERR_TOO_SHORT_DIGITS;
3270 else if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3271 if (p == prev) { /* can't read nothing. */
3272 num = 0; /* but, it's not error */
3273 }
3274 tok->type = TK_CODE_POINT;
3275 tok->base = 16;
3276 tok->u.code = (OnigCodePoint )num;
3277 }
3278 break;
3279
3280 case 'o':
3281 if (PEND) break;
3282
3283 prev = p;
3284 if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_O_BRACE_OCTAL)) {
3285 PINC;
3286 num = scan_unsigned_octal_number(&p, end, 11, enc);
3287 if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3288 if (!PEND) {
3289 c2 = PPEEK;
3290 if (ONIGENC_IS_CODE_DIGIT(enc, c2) && c2 < '8')
3291 return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE;
3292 }
3293
3294 if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) {
3295 PINC;
3296 tok->type = TK_CODE_POINT;
3297 tok->base = 8;
3298 tok->u.code = (OnigCodePoint )num;
3299 }
3300 else {
3301 /* can't read nothing or invalid format */
3302 p = prev;
3303 }
3304 }
3305 break;
3306
3307 case '0':
3308 case '1': case '2': case '3': case '4': case '5': case '6': case '7':
3309 if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_OCTAL3)) {
3310 PUNFETCH;
3311 prev = p;
3312 num = scan_unsigned_octal_number(&p, end, 3, enc);
3313 if (num < 0 || 0xff < num) return ONIGERR_TOO_BIG_NUMBER;
3314 if (p == prev) { /* can't read nothing. */
3315 num = 0; /* but, it's not error */
3316 }
3317 tok->type = TK_RAW_BYTE;
3318 tok->base = 8;
3319 tok->u.c = num;
3320 }
3321 break;
3322
3323 default:
3324 PUNFETCH;
3325 num = fetch_escaped_value(&p, end, env, &c2);
3326 if (num < 0) return num;
3327 if ((OnigCodePoint )tok->u.c != c2) {
3328 tok->u.code = (OnigCodePoint )c2;
3329 tok->type = TK_CODE_POINT;
3330 }
3331 break;
3332 }
3333 }
3334 else if (c == '[') {
3335 if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_POSIX_BRACKET) && (PPEEK_IS(':'))) {
3336 OnigCodePoint send[] = { (OnigCodePoint )':', (OnigCodePoint )']' };
3337 tok->backp = p; /* point at '[' is read */
3338 PINC;
3339 if (str_exist_check_with_esc(send, 2, p, end,
3340 (OnigCodePoint )']', enc, syn)) {
3341 tok->type = TK_POSIX_BRACKET_OPEN;
3342 }
3343 else {
3344 PUNFETCH;
3345 goto cc_in_cc;
3346 }
3347 }
3348 else {
3349 cc_in_cc:
3350 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_CCLASS_SET_OP)) {
3351 tok->type = TK_CC_CC_OPEN;
3352 }
3353 else {
3354 CC_ESC_WARN(env, (UChar* )"[");
3355 }
3356 }
3357 }
3358 else if (c == '&') {
3359 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_CCLASS_SET_OP) &&
3360 !PEND && (PPEEK_IS('&'))) {
3361 PINC;
3362 tok->type = TK_CC_AND;
3363 }
3364 }
3365
3366 end:
3367 *src = p;
3368 return tok->type;
3369}
3370
3371#ifdef USE_NAMED_GROUP
3372static int
3373fetch_named_backref_token(OnigCodePoint c, OnigToken* tok, UChar** src,
3374 UChar* end, ScanEnv* env)
3375{
3376 int r, num;
3377 const OnigSyntaxType* syn = env->syntax;
3378 UChar* prev;
3379 UChar* p = *src;
3380 UChar* name_end;
3381 int* backs;
3382 int back_num;
3383
3384 prev = p;
3385
3386# ifdef USE_BACKREF_WITH_LEVEL
3387 name_end = NULL_UCHARP; /* no need. escape gcc warning. */
3388 r = fetch_name_with_level(c, &p, end, &name_end,
3389 env, &back_num, &tok->u.backref.level);
3390 if (r == 1) tok->u.backref.exist_level = 1;
3391 else tok->u.backref.exist_level = 0;
3392# else
3393 r = fetch_name(&p, end, &name_end, env, &back_num, 1);
3394# endif
3395 if (r < 0) return r;
3396
3397 if (back_num != 0) {
3398 if (back_num < 0) {
3399 back_num = BACKREF_REL_TO_ABS(back_num, env);
3400 if (back_num <= 0)
3401 return ONIGERR_INVALID_BACKREF;
3402 }
3403
3404 if (IS_SYNTAX_BV(syn, ONIG_SYN_STRICT_CHECK_BACKREF)) {
3405 if (back_num > env->num_mem ||
3406 IS_NULL(SCANENV_MEM_NODES(env)[back_num]))
3407 return ONIGERR_INVALID_BACKREF;
3408 }
3409 tok->type = TK_BACKREF;
3410 tok->u.backref.by_name = 0;
3411 tok->u.backref.num = 1;
3412 tok->u.backref.ref1 = back_num;
3413 }
3414 else {
3415 num = onig_name_to_group_numbers(env->reg, prev, name_end, &backs);
3416 if (num <= 0) {
3417 onig_scan_env_set_error_string(env,
3418 ONIGERR_UNDEFINED_NAME_REFERENCE, prev, name_end);
3419 return ONIGERR_UNDEFINED_NAME_REFERENCE;
3420 }
3421 if (IS_SYNTAX_BV(syn, ONIG_SYN_STRICT_CHECK_BACKREF)) {
3422 int i;
3423 for (i = 0; i < num; i++) {
3424 if (backs[i] > env->num_mem ||
3425 IS_NULL(SCANENV_MEM_NODES(env)[backs[i]]))
3426 return ONIGERR_INVALID_BACKREF;
3427 }
3428 }
3429
3430 tok->type = TK_BACKREF;
3431 tok->u.backref.by_name = 1;
3432 if (num == 1 || IS_SYNTAX_BV(syn, ONIG_SYN_USE_LEFT_MOST_NAMED_GROUP)) {
3433 tok->u.backref.num = 1;
3434 tok->u.backref.ref1 = backs[0];
3435 }
3436 else {
3437 tok->u.backref.num = num;
3438 tok->u.backref.refs = backs;
3439 }
3440 }
3441 *src = p;
3442 return 0;
3443}
3444#endif
3445
3446static int
3447fetch_token(OnigToken* tok, UChar** src, UChar* end, ScanEnv* env)
3448{
3449 int r, num;
3450 OnigCodePoint c;
3451 OnigEncoding enc = env->enc;
3452 const OnigSyntaxType* syn = env->syntax;
3453 UChar* prev;
3454 UChar* p = *src;
3455 PFETCH_READY;
3456
3457 start:
3458 if (PEND) {
3459 tok->type = TK_EOT;
3460 return tok->type;
3461 }
3462
3463 tok->type = TK_STRING;
3464 tok->base = 0;
3465 tok->backp = p;
3466
3467 PFETCH(c);
3468 if (IS_MC_ESC_CODE(c, syn)) {
3469 if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE;
3470
3471 tok->backp = p;
3472 PFETCH(c);
3473
3474 tok->u.c = c;
3475 tok->escaped = 1;
3476 switch (c) {
3477 case '*':
3478 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_ASTERISK_ZERO_INF)) break;
3479 tok->type = TK_OP_REPEAT;
3480 tok->u.repeat.lower = 0;
3481 tok->u.repeat.upper = REPEAT_INFINITE;
3482 goto greedy_check;
3483 break;
3484
3485 case '+':
3486 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_PLUS_ONE_INF)) break;
3487 tok->type = TK_OP_REPEAT;
3488 tok->u.repeat.lower = 1;
3489 tok->u.repeat.upper = REPEAT_INFINITE;
3490 goto greedy_check;
3491 break;
3492
3493 case '?':
3494 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_QMARK_ZERO_ONE)) break;
3495 tok->type = TK_OP_REPEAT;
3496 tok->u.repeat.lower = 0;
3497 tok->u.repeat.upper = 1;
3498 greedy_check:
3499 if (!PEND && PPEEK_IS('?') &&
3500 IS_SYNTAX_OP(syn, ONIG_SYN_OP_QMARK_NON_GREEDY)) {
3501 PFETCH(c);
3502 tok->u.repeat.greedy = 0;
3503 tok->u.repeat.possessive = 0;
3504 }
3505 else {
3506 possessive_check:
3507 if (!PEND && PPEEK_IS('+') &&
3508 ((IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_PLUS_POSSESSIVE_REPEAT) &&
3509 tok->type != TK_INTERVAL) ||
3510 (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_PLUS_POSSESSIVE_INTERVAL) &&
3511 tok->type == TK_INTERVAL))) {
3512 PFETCH(c);
3513 tok->u.repeat.greedy = 1;
3514 tok->u.repeat.possessive = 1;
3515 }
3516 else {
3517 tok->u.repeat.greedy = 1;
3518 tok->u.repeat.possessive = 0;
3519 }
3520 }
3521 break;
3522
3523 case '{':
3524 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_BRACE_INTERVAL)) break;
3525 r = fetch_range_quantifier(&p, end, tok, env);
3526 if (r < 0) return r; /* error */
3527 if (r == 0) goto greedy_check;
3528 else if (r == 2) { /* {n} */
3529 if (IS_SYNTAX_BV(syn, ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY))
3530 goto possessive_check;
3531
3532 goto greedy_check;
3533 }
3534 /* r == 1 : normal char */
3535 break;
3536
3537 case '|':
3538 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_VBAR_ALT)) break;
3539 tok->type = TK_ALT;
3540 break;
3541
3542 case '(':
3543 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break;
3544 tok->type = TK_SUBEXP_OPEN;
3545 break;
3546
3547 case ')':
3548 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break;
3549 tok->type = TK_SUBEXP_CLOSE;
3550 break;
3551
3552 case 'w':
3553 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_W_WORD)) break;
3554 tok->type = TK_CHAR_TYPE;
3555 tok->u.prop.ctype = ONIGENC_CTYPE_WORD;
3556 tok->u.prop.not = 0;
3557 break;
3558
3559 case 'W':
3560 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_W_WORD)) break;
3561 tok->type = TK_CHAR_TYPE;
3562 tok->u.prop.ctype = ONIGENC_CTYPE_WORD;
3563 tok->u.prop.not = 1;
3564 break;
3565
3566 case 'b':
3567 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_B_WORD_BOUND)) break;
3568 tok->type = TK_ANCHOR;
3569 tok->u.anchor.subtype = ANCHOR_WORD_BOUND;
3570 tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option)
3571 && ! IS_WORD_BOUND_ALL_RANGE(env->option);
3572 break;
3573
3574 case 'B':
3575 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_B_WORD_BOUND)) break;
3576 tok->type = TK_ANCHOR;
3577 tok->u.anchor.subtype = ANCHOR_NOT_WORD_BOUND;
3578 tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option)
3579 && ! IS_WORD_BOUND_ALL_RANGE(env->option);
3580 break;
3581
3582#ifdef USE_WORD_BEGIN_END
3583 case '<':
3584 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END)) break;
3585 tok->type = TK_ANCHOR;
3586 tok->u.anchor.subtype = ANCHOR_WORD_BEGIN;
3587 tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option);
3588 break;
3589
3590 case '>':
3591 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END)) break;
3592 tok->type = TK_ANCHOR;
3593 tok->u.anchor.subtype = ANCHOR_WORD_END;
3594 tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option);
3595 break;
3596#endif
3597
3598 case 's':
3599 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_S_WHITE_SPACE)) break;
3600 tok->type = TK_CHAR_TYPE;
3601 tok->u.prop.ctype = ONIGENC_CTYPE_SPACE;
3602 tok->u.prop.not = 0;
3603 break;
3604
3605 case 'S':
3606 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_S_WHITE_SPACE)) break;
3607 tok->type = TK_CHAR_TYPE;
3608 tok->u.prop.ctype = ONIGENC_CTYPE_SPACE;
3609 tok->u.prop.not = 1;
3610 break;
3611
3612 case 'd':
3613 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_D_DIGIT)) break;
3614 tok->type = TK_CHAR_TYPE;
3615 tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT;
3616 tok->u.prop.not = 0;
3617 break;
3618
3619 case 'D':
3620 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_D_DIGIT)) break;
3621 tok->type = TK_CHAR_TYPE;
3622 tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT;
3623 tok->u.prop.not = 1;
3624 break;
3625
3626 case 'h':
3627 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3628 tok->type = TK_CHAR_TYPE;
3629 tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3630 tok->u.prop.not = 0;
3631 break;
3632
3633 case 'H':
3634 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3635 tok->type = TK_CHAR_TYPE;
3636 tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3637 tok->u.prop.not = 1;
3638 break;
3639
3640 case 'A':
3641 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break;
3642 begin_buf:
3643 tok->type = TK_ANCHOR;
3644 tok->u.anchor.subtype = ANCHOR_BEGIN_BUF;
3645 break;
3646
3647 case 'Z':
3648 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break;
3649 tok->type = TK_ANCHOR;
3650 tok->u.anchor.subtype = ANCHOR_SEMI_END_BUF;
3651 break;
3652
3653 case 'z':
3654 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break;
3655 end_buf:
3656 tok->type = TK_ANCHOR;
3657 tok->u.anchor.subtype = ANCHOR_END_BUF;
3658 break;
3659
3660 case 'G':
3661 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_CAPITAL_G_BEGIN_ANCHOR)) break;
3662 tok->type = TK_ANCHOR;
3663 tok->u.anchor.subtype = ANCHOR_BEGIN_POSITION;
3664 break;
3665
3666 case '`':
3667 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_GNU_BUF_ANCHOR)) break;
3668 goto begin_buf;
3669 break;
3670
3671 case '\'':
3672 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_GNU_BUF_ANCHOR)) break;
3673 goto end_buf;
3674 break;
3675
3676 case 'x':
3677 if (PEND) break;
3678
3679 prev = p;
3680 if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_BRACE_HEX8)) {
3681 PINC;
3682 num = scan_unsigned_hexadecimal_number(&p, end, 0, 8, enc);
3683 if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3684 if (!PEND) {
3685 if (ONIGENC_IS_CODE_XDIGIT(enc, PPEEK))
3686 return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE;
3687 }
3688
3689 if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) {
3690 PINC;
3691 tok->type = TK_CODE_POINT;
3692 tok->u.code = (OnigCodePoint )num;
3693 }
3694 else {
3695 /* can't read nothing or invalid format */
3696 p = prev;
3697 }
3698 }
3699 else if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_HEX2)) {
3700 num = scan_unsigned_hexadecimal_number(&p, end, 0, 2, enc);
3701 if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3702 if (p == prev) { /* can't read nothing. */
3703 num = 0; /* but, it's not error */
3704 }
3705 tok->type = TK_RAW_BYTE;
3706 tok->base = 16;
3707 tok->u.c = num;
3708 }
3709 break;
3710
3711 case 'u':
3712 if (PEND) break;
3713
3714 prev = p;
3715 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_U_HEX4)) {
3716 num = scan_unsigned_hexadecimal_number(&p, end, 4, 4, enc);
3717 if (num < -1) return ONIGERR_TOO_SHORT_DIGITS;
3718 else if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3719 if (p == prev) { /* can't read nothing. */
3720 num = 0; /* but, it's not error */
3721 }
3722 tok->type = TK_CODE_POINT;
3723 tok->base = 16;
3724 tok->u.code = (OnigCodePoint )num;
3725 }
3726 break;
3727
3728 case 'o':
3729 if (PEND) break;
3730
3731 prev = p;
3732 if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_O_BRACE_OCTAL)) {
3733 PINC;
3734 num = scan_unsigned_octal_number(&p, end, 11, enc);
3735 if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3736 if (!PEND) {
3737 OnigCodePoint c = PPEEK;
3738 if (ONIGENC_IS_CODE_DIGIT(enc, c) && c < '8')
3739 return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE;
3740 }
3741
3742 if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) {
3743 PINC;
3744 tok->type = TK_CODE_POINT;
3745 tok->u.code = (OnigCodePoint )num;
3746 }
3747 else {
3748 /* can't read nothing or invalid format */
3749 p = prev;
3750 }
3751 }
3752 break;
3753
3754 case '1': case '2': case '3': case '4':
3755 case '5': case '6': case '7': case '8': case '9':
3756 PUNFETCH;
3757 prev = p;
3758 num = onig_scan_unsigned_number(&p, end, enc);
3759 if (num < 0 || num > ONIG_MAX_BACKREF_NUM) {
3760 goto skip_backref;
3761 }
3762
3763 if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_DECIMAL_BACKREF) &&
3764 (num <= env->num_mem || num <= 9)) { /* This spec. from GNU regex */
3765 if (IS_SYNTAX_BV(syn, ONIG_SYN_STRICT_CHECK_BACKREF)) {
3766 if (num > env->num_mem || IS_NULL(SCANENV_MEM_NODES(env)[num]))
3767 return ONIGERR_INVALID_BACKREF;
3768 }
3769
3770 tok->type = TK_BACKREF;
3771 tok->u.backref.num = 1;
3772 tok->u.backref.ref1 = num;
3773 tok->u.backref.by_name = 0;
3774#ifdef USE_BACKREF_WITH_LEVEL
3775 tok->u.backref.exist_level = 0;
3776#endif
3777 break;
3778 }
3779
3780 skip_backref:
3781 if (c == '8' || c == '9') {
3782 /* normal char */
3783 p = prev; PINC;
3784 break;
3785 }
3786
3787 p = prev;
3788 /* fall through */
3789 case '0':
3790 if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_OCTAL3)) {
3791 prev = p;
3792 num = scan_unsigned_octal_number(&p, end, (c == '0' ? 2:3), enc);
3793 if (num < 0 || 0xff < num) return ONIGERR_TOO_BIG_NUMBER;
3794 if (p == prev) { /* can't read nothing. */
3795 num = 0; /* but, it's not error */
3796 }
3797 tok->type = TK_RAW_BYTE;
3798 tok->base = 8;
3799 tok->u.c = num;
3800 }
3801 else if (c != '0') {
3802 PINC;
3803 }
3804 break;
3805
3806#ifdef USE_NAMED_GROUP
3807 case 'k':
3808 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_K_NAMED_BACKREF)) {
3809 PFETCH(c);
3810 if (c == '<' || c == '\'') {
3811 r = fetch_named_backref_token(c, tok, &p, end, env);
3812 if (r < 0) return r;
3813 }
3814 else {
3815 PUNFETCH;
3816 onig_syntax_warn(env, "invalid back reference");
3817 }
3818 }
3819 break;
3820#endif
3821
3822#if defined(USE_SUBEXP_CALL) || defined(USE_NAMED_GROUP)
3823 case 'g':
3824# ifdef USE_NAMED_GROUP
3825 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_G_BRACE_BACKREF)) {
3826 PFETCH(c);
3827 if (c == '{') {
3828 r = fetch_named_backref_token(c, tok, &p, end, env);
3829 if (r < 0) return r;
3830 }
3831 else
3832 PUNFETCH;
3833 }
3834# endif
3835# ifdef USE_SUBEXP_CALL
3836 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_G_SUBEXP_CALL)) {
3837 PFETCH(c);
3838 if (c == '<' || c == '\'') {
3839 int gnum = -1, rel = 0;
3840 UChar* name_end;
3841 OnigCodePoint cnext;
3842
3843 cnext = PPEEK;
3844 if (cnext == '0') {
3845 PINC;
3846 if (PPEEK_IS(get_name_end_code_point(c))) { /* \g<0>, \g'0' */
3847 PINC;
3848 name_end = p;
3849 gnum = 0;
3850 }
3851 }
3852 else if (cnext == '+') {
3853 PINC;
3854 rel = 1;
3855 }
3856 prev = p;
3857 if (gnum < 0) {
3858 r = fetch_name((OnigCodePoint )c, &p, end, &name_end, env, &gnum, 1);
3859 if (r < 0) return r;
3860 }
3861
3862 tok->type = TK_CALL;
3863 tok->u.call.name = prev;
3864 tok->u.call.name_end = name_end;
3865 tok->u.call.gnum = gnum;
3866 tok->u.call.rel = rel;
3867 }
3868 else {
3869 onig_syntax_warn(env, "invalid subexp call");
3870 PUNFETCH;
3871 }
3872 }
3873# endif
3874 break;
3875#endif
3876
3877 case 'Q':
3878 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_Q_QUOTE)) {
3879 tok->type = TK_QUOTE_OPEN;
3880 }
3881 break;
3882
3883 case 'p':
3884 case 'P':
3885 if (PPEEK_IS('{') &&
3886 IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY)) {
3887 PINC;
3888 tok->type = TK_CHAR_PROPERTY;
3889 tok->u.prop.not = (c == 'P' ? 1 : 0);
3890
3891 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT)) {
3892 PFETCH(c);
3893 if (c == '^') {
3894 tok->u.prop.not = (tok->u.prop.not == 0 ? 1 : 0);
3895 }
3896 else
3897 PUNFETCH;
3898 }
3899 }
3900 else {
3901 onig_syntax_warn(env, "invalid Unicode Property \\%c", c);
3902 }
3903 break;
3904
3905 case 'R':
3906 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_R_LINEBREAK)) {
3907 tok->type = TK_LINEBREAK;
3908 }
3909 break;
3910
3911 case 'X':
3912 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_X_EXTENDED_GRAPHEME_CLUSTER)) {
3913 tok->type = TK_EXTENDED_GRAPHEME_CLUSTER;
3914 }
3915 break;
3916
3917 case 'K':
3918 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_K_KEEP)) {
3919 tok->type = TK_KEEP;
3920 }
3921 break;
3922
3923 default:
3924 {
3925 OnigCodePoint c2;
3926
3927 PUNFETCH;
3928 num = fetch_escaped_value(&p, end, env, &c2);
3929 if (num < 0) return num;
3930 /* set_raw: */
3931 if ((OnigCodePoint )tok->u.c != c2) {
3932 tok->type = TK_CODE_POINT;
3933 tok->u.code = (OnigCodePoint )c2;
3934 }
3935 else { /* string */
3936 p = tok->backp + enclen(enc, tok->backp, end);
3937 }
3938 }
3939 break;
3940 }
3941 }
3942 else {
3943 tok->u.c = c;
3944 tok->escaped = 0;
3945
3946#ifdef USE_VARIABLE_META_CHARS
3947 if ((c != ONIG_INEFFECTIVE_META_CHAR) &&
3948 IS_SYNTAX_OP(syn, ONIG_SYN_OP_VARIABLE_META_CHARACTERS)) {
3949 if (c == MC_ANYCHAR(syn))
3950 goto any_char;
3951 else if (c == MC_ANYTIME(syn))
3952 goto anytime;
3953 else if (c == MC_ZERO_OR_ONE_TIME(syn))
3954 goto zero_or_one_time;
3955 else if (c == MC_ONE_OR_MORE_TIME(syn))
3956 goto one_or_more_time;
3957 else if (c == MC_ANYCHAR_ANYTIME(syn)) {
3958 tok->type = TK_ANYCHAR_ANYTIME;
3959 goto out;
3960 }
3961 }
3962#endif
3963
3964 switch (c) {
3965 case '.':
3966 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_DOT_ANYCHAR)) break;
3967#ifdef USE_VARIABLE_META_CHARS
3968 any_char:
3969#endif
3970 tok->type = TK_ANYCHAR;
3971 break;
3972
3973 case '*':
3974 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ASTERISK_ZERO_INF)) break;
3975#ifdef USE_VARIABLE_META_CHARS
3976 anytime:
3977#endif
3978 tok->type = TK_OP_REPEAT;
3979 tok->u.repeat.lower = 0;
3980 tok->u.repeat.upper = REPEAT_INFINITE;
3981 goto greedy_check;
3982 break;
3983
3984 case '+':
3985 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_PLUS_ONE_INF)) break;
3986#ifdef USE_VARIABLE_META_CHARS
3987 one_or_more_time:
3988#endif
3989 tok->type = TK_OP_REPEAT;
3990 tok->u.repeat.lower = 1;
3991 tok->u.repeat.upper = REPEAT_INFINITE;
3992 goto greedy_check;
3993 break;
3994
3995 case '?':
3996 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_QMARK_ZERO_ONE)) break;
3997#ifdef USE_VARIABLE_META_CHARS
3998 zero_or_one_time:
3999#endif
4000 tok->type = TK_OP_REPEAT;
4001 tok->u.repeat.lower = 0;
4002 tok->u.repeat.upper = 1;
4003 goto greedy_check;
4004 break;
4005
4006 case '{':
4007 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_BRACE_INTERVAL)) break;
4008 r = fetch_range_quantifier(&p, end, tok, env);
4009 if (r < 0) return r; /* error */
4010 if (r == 0) goto greedy_check;
4011 else if (r == 2) { /* {n} */
4012 if (IS_SYNTAX_BV(syn, ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY))
4013 goto possessive_check;
4014
4015 goto greedy_check;
4016 }
4017 /* r == 1 : normal char */
4018 break;
4019
4020 case '|':
4021 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_VBAR_ALT)) break;
4022 tok->type = TK_ALT;
4023 break;
4024
4025 case '(':
4026 if (PPEEK_IS('?') &&
4027 IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_QMARK_GROUP_EFFECT)) {
4028 PINC;
4029 if (PPEEK_IS('#')) {
4030 PFETCH(c);
4031 while (1) {
4032 if (PEND) return ONIGERR_END_PATTERN_IN_GROUP;
4033 PFETCH(c);
4034 if (c == MC_ESC(syn)) {
4035 if (!PEND) PFETCH(c);
4036 }
4037 else {
4038 if (c == ')') break;
4039 }
4040 }
4041 goto start;
4042 }
4043#ifdef USE_PERL_SUBEXP_CALL
4044 /* (?&name), (?n), (?R), (?0), (?+n), (?-n) */
4045 c = PPEEK;
4046 if ((c == '&' || c == 'R' || ONIGENC_IS_CODE_DIGIT(enc, c)) &&
4047 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_SUBEXP_CALL)) {
4048 /* (?&name), (?n), (?R), (?0) */
4049 int gnum;
4050 UChar *name;
4051 UChar *name_end;
4052
4053 if (c == 'R' || c == '0') {
4054 PINC; /* skip 'R' / '0' */
4055 if (!PPEEK_IS(')')) {
4056 r = ONIGERR_INVALID_GROUP_NAME;
4057 onig_scan_env_set_error_string(env, r, p - 1, p + 1);
4058 return r;
4059 }
4060 PINC; /* skip ')' */
4061 name_end = name = p;
4062 gnum = 0;
4063 }
4064 else {
4065 int numref = 1;
4066 if (c == '&') { /* (?&name) */
4067 PINC;
4068 numref = 0; /* don't allow number name */
4069 }
4070 name = p;
4071 r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &gnum, numref);
4072 if (r < 0) return r;
4073 }
4074
4075 tok->type = TK_CALL;
4076 tok->u.call.name = name;
4077 tok->u.call.name_end = name_end;
4078 tok->u.call.gnum = gnum;
4079 tok->u.call.rel = 0;
4080 break;
4081 }
4082 else if ((c == '-' || c == '+') &&
4083 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_SUBEXP_CALL)) {
4084 /* (?+n), (?-n) */
4085 int gnum;
4086 UChar *name;
4087 UChar *name_end;
4088 OnigCodePoint cnext;
4089 PFETCH_READY;
4090
4091 PINC; /* skip '-' / '+' */
4092 cnext = PPEEK;
4093 if (ONIGENC_IS_CODE_DIGIT(enc, cnext)) {
4094 if (c == '-') PUNFETCH;
4095 name = p;
4096 r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &gnum, 1);
4097 if (r < 0) return r;
4098
4099 tok->type = TK_CALL;
4100 tok->u.call.name = name;
4101 tok->u.call.name_end = name_end;
4102 tok->u.call.gnum = gnum;
4103 tok->u.call.rel = 1;
4104 break;
4105 }
4106 }
4107#endif /* USE_PERL_SUBEXP_CALL */
4108#ifdef USE_CAPITAL_P_NAMED_GROUP
4109 if (PPEEK_IS('P') &&
4110 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_CAPITAL_P_NAMED_GROUP)) {
4111 int gnum;
4112 UChar *name;
4113 UChar *name_end;
4114 PFETCH_READY;
4115
4116 PINC; /* skip 'P' */
4117 if (PEND) return ONIGERR_UNDEFINED_GROUP_OPTION;
4118 PFETCH(c);
4119 if (c == '=') { /* (?P=name): backref */
4120 r = fetch_named_backref_token((OnigCodePoint )'(', tok, &p, end, env);
4121 if (r < 0) return r;
4122 break;
4123 }
4124 else if (c == '>') { /* (?P>name): subexp call */
4125 name = p;
4126 r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &gnum, 0);
4127 if (r < 0) return r;
4128
4129 tok->type = TK_CALL;
4130 tok->u.call.name = name;
4131 tok->u.call.name_end = name_end;
4132 tok->u.call.gnum = gnum;
4133 tok->u.call.rel = 0;
4134 break;
4135 }
4136 }
4137#endif /* USE_CAPITAL_P_NAMED_GROUP */
4138 PUNFETCH;
4139 }
4140
4141 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break;
4142 tok->type = TK_SUBEXP_OPEN;
4143 break;
4144
4145 case ')':
4146 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break;
4147 tok->type = TK_SUBEXP_CLOSE;
4148 break;
4149
4150 case '^':
4151 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break;
4152 tok->type = TK_ANCHOR;
4153 tok->u.anchor.subtype = (IS_SINGLELINE(env->option)
4154 ? ANCHOR_BEGIN_BUF : ANCHOR_BEGIN_LINE);
4155 break;
4156
4157 case '$':
4158 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break;
4159 tok->type = TK_ANCHOR;
4160 tok->u.anchor.subtype = (IS_SINGLELINE(env->option)
4161 ? ANCHOR_SEMI_END_BUF : ANCHOR_END_LINE);
4162 break;
4163
4164 case '[':
4165 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_BRACKET_CC)) break;
4166 tok->type = TK_CC_OPEN;
4167 break;
4168
4169 case ']':
4170 if (*src > env->pattern) /* /].../ is allowed. */
4171 CLOSE_BRACKET_WITHOUT_ESC_WARN(env, (UChar* )"]");
4172 break;
4173
4174 case '#':
4175 if (IS_EXTEND(env->option)) {
4176 while (!PEND) {
4177 PFETCH(c);
4178 if (ONIGENC_IS_CODE_NEWLINE(enc, c))
4179 break;
4180 }
4181 goto start;
4182 break;
4183 }
4184 break;
4185
4186 case ' ': case '\t': case '\n': case '\r': case '\f':
4187 if (IS_EXTEND(env->option))
4188 goto start;
4189 break;
4190
4191 default:
4192 /* string */
4193 break;
4194 }
4195 }
4196
4197#ifdef USE_VARIABLE_META_CHARS
4198 out:
4199#endif
4200 *src = p;
4201 return tok->type;
4202}
4203
4204static int
4205add_ctype_to_cc_by_range(CClassNode* cc, int ctype ARG_UNUSED, int not,
4206 ScanEnv* env,
4207 OnigCodePoint sb_out, const OnigCodePoint mbr[])
4208{
4209 int i, r;
4210 OnigCodePoint j;
4211
4212 int n = ONIGENC_CODE_RANGE_NUM(mbr);
4213
4214 if (not == 0) {
4215 for (i = 0; i < n; i++) {
4216 for (j = ONIGENC_CODE_RANGE_FROM(mbr, i);
4217 j <= ONIGENC_CODE_RANGE_TO(mbr, i); j++) {
4218 if (j >= sb_out) {
4219 if (j > ONIGENC_CODE_RANGE_FROM(mbr, i)) {
4220 r = add_code_range_to_buf(&(cc->mbuf), env, j,
4221 ONIGENC_CODE_RANGE_TO(mbr, i));
4222 if (r != 0) return r;
4223 i++;
4224 }
4225
4226 goto sb_end;
4227 }
4228 BITSET_SET_BIT_CHKDUP(cc->bs, j);
4229 }
4230 }
4231
4232 sb_end:
4233 for ( ; i < n; i++) {
4234 r = add_code_range_to_buf(&(cc->mbuf), env,
4235 ONIGENC_CODE_RANGE_FROM(mbr, i),
4236 ONIGENC_CODE_RANGE_TO(mbr, i));
4237 if (r != 0) return r;
4238 }
4239 }
4240 else {
4241 OnigCodePoint prev = 0;
4242
4243 for (i = 0; i < n; i++) {
4244 for (j = prev;
4245 j < ONIGENC_CODE_RANGE_FROM(mbr, i); j++) {
4246 if (j >= sb_out) {
4247 goto sb_end2;
4248 }
4249 BITSET_SET_BIT_CHKDUP(cc->bs, j);
4250 }
4251 prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1;
4252 }
4253 for (j = prev; j < sb_out; j++) {
4254 BITSET_SET_BIT_CHKDUP(cc->bs, j);
4255 }
4256
4257 sb_end2:
4258 prev = sb_out;
4259
4260 for (i = 0; i < n; i++) {
4261 if (prev < ONIGENC_CODE_RANGE_FROM(mbr, i)) {
4262 r = add_code_range_to_buf(&(cc->mbuf), env, prev,
4263 ONIGENC_CODE_RANGE_FROM(mbr, i) - 1);
4264 if (r != 0) return r;
4265 }
4266 prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1;
4267 }
4268 if (prev < 0x7fffffff) {
4269 r = add_code_range_to_buf(&(cc->mbuf), env, prev, 0x7fffffff);
4270 if (r != 0) return r;
4271 }
4272 }
4273
4274 return 0;
4275}
4276
4277static int
4278add_ctype_to_cc(CClassNode* cc, int ctype, int not, int ascii_range, ScanEnv* env)
4279{
4280 int maxcode;
4281 int c, r;
4282 const OnigCodePoint *ranges;
4283 OnigCodePoint sb_out;
4284 OnigEncoding enc = env->enc;
4285
4286 r = ONIGENC_GET_CTYPE_CODE_RANGE(enc, ctype, &sb_out, &ranges);
4287 if (r == 0) {
4288 if (ascii_range) {
4289 CClassNode ccwork;
4290 initialize_cclass(&ccwork);
4291 r = add_ctype_to_cc_by_range(&ccwork, ctype, not, env, sb_out,
4292 ranges);
4293 if (r == 0) {
4294 if (not) {
4295 r = add_code_range_to_buf0(&(ccwork.mbuf), env, 0x80, ONIG_LAST_CODE_POINT, FALSE);
4296 }
4297 else {
4298 CClassNode ccascii;
4299 initialize_cclass(&ccascii);
4300 if (ONIGENC_MBC_MINLEN(env->enc) > 1) {
4301 r = add_code_range(&(ccascii.mbuf), env, 0x00, 0x7F);
4302 }
4303 else {
4304 bitset_set_range(env, ccascii.bs, 0x00, 0x7F);
4305 r = 0;
4306 }
4307 if (r == 0) {
4308 r = and_cclass(&ccwork, &ccascii, env);
4309 }
4310 if (IS_NOT_NULL(ccascii.mbuf)) bbuf_free(ccascii.mbuf);
4311 }
4312 if (r == 0) {
4313 r = or_cclass(cc, &ccwork, env);
4314 }
4315 if (IS_NOT_NULL(ccwork.mbuf)) bbuf_free(ccwork.mbuf);
4316 }
4317 }
4318 else {
4319 r = add_ctype_to_cc_by_range(cc, ctype, not, env, sb_out, ranges);
4320 }
4321 return r;
4322 }
4323 else if (r != ONIG_NO_SUPPORT_CONFIG) {
4324 return r;
4325 }
4326
4327 maxcode = ascii_range ? 0x80 : SINGLE_BYTE_SIZE;
4328 r = 0;
4329 switch (ctype) {
4330 case ONIGENC_CTYPE_ALPHA:
4331 case ONIGENC_CTYPE_BLANK:
4332 case ONIGENC_CTYPE_CNTRL:
4333 case ONIGENC_CTYPE_DIGIT:
4334 case ONIGENC_CTYPE_LOWER:
4335 case ONIGENC_CTYPE_PUNCT:
4336 case ONIGENC_CTYPE_SPACE:
4337 case ONIGENC_CTYPE_UPPER:
4338 case ONIGENC_CTYPE_XDIGIT:
4339 case ONIGENC_CTYPE_ASCII:
4340 case ONIGENC_CTYPE_ALNUM:
4341 if (not != 0) {
4342 for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
4343 if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
4344 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4345 }
4346 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4347 }
4348 else {
4349 for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
4350 if (ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
4351 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4352 }
4353 }
4354 break;
4355
4356 case ONIGENC_CTYPE_GRAPH:
4357 case ONIGENC_CTYPE_PRINT:
4358 if (not != 0) {
4359 for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
4360 if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype)
4361 || c >= maxcode)
4362 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4363 }
4364 if (ascii_range)
4365 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4366 }
4367 else {
4368 for (c = 0; c < maxcode; c++) {
4369 if (ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
4370 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4371 }
4372 if (! ascii_range)
4373 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4374 }
4375 break;
4376
4377 case ONIGENC_CTYPE_WORD:
4378 if (not == 0) {
4379 for (c = 0; c < maxcode; c++) {
4380 if (ONIGENC_IS_CODE_WORD(enc, c)) BITSET_SET_BIT_CHKDUP(cc->bs, c);
4381 }
4382 if (! ascii_range)
4383 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4384 }
4385 else {
4386 for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
4387 if ((ONIGENC_CODE_TO_MBCLEN(enc, c) > 0) /* check invalid code point */
4388 && (! ONIGENC_IS_CODE_WORD(enc, c) || c >= maxcode))
4389 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4390 }
4391 if (ascii_range)
4392 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4393 }
4394 break;
4395
4396 default:
4397 return ONIGERR_PARSER_BUG;
4398 break;
4399 }
4400
4401 return r;
4402}
4403
4404static int
4405parse_posix_bracket(CClassNode* cc, CClassNode* asc_cc,
4406 UChar** src, UChar* end, ScanEnv* env)
4407{
4408#define POSIX_BRACKET_CHECK_LIMIT_LENGTH 20
4409#define POSIX_BRACKET_NAME_MIN_LEN 4
4410
4411 static const PosixBracketEntryType PBS[] = {
4412 POSIX_BRACKET_ENTRY_INIT("alnum", ONIGENC_CTYPE_ALNUM),
4413 POSIX_BRACKET_ENTRY_INIT("alpha", ONIGENC_CTYPE_ALPHA),
4414 POSIX_BRACKET_ENTRY_INIT("blank", ONIGENC_CTYPE_BLANK),
4415 POSIX_BRACKET_ENTRY_INIT("cntrl", ONIGENC_CTYPE_CNTRL),
4416 POSIX_BRACKET_ENTRY_INIT("digit", ONIGENC_CTYPE_DIGIT),
4417 POSIX_BRACKET_ENTRY_INIT("graph", ONIGENC_CTYPE_GRAPH),
4418 POSIX_BRACKET_ENTRY_INIT("lower", ONIGENC_CTYPE_LOWER),
4419 POSIX_BRACKET_ENTRY_INIT("print", ONIGENC_CTYPE_PRINT),
4420 POSIX_BRACKET_ENTRY_INIT("punct", ONIGENC_CTYPE_PUNCT),
4421 POSIX_BRACKET_ENTRY_INIT("space", ONIGENC_CTYPE_SPACE),
4422 POSIX_BRACKET_ENTRY_INIT("upper", ONIGENC_CTYPE_UPPER),
4423 POSIX_BRACKET_ENTRY_INIT("xdigit", ONIGENC_CTYPE_XDIGIT),
4424 POSIX_BRACKET_ENTRY_INIT("ascii", ONIGENC_CTYPE_ASCII),
4425 POSIX_BRACKET_ENTRY_INIT("word", ONIGENC_CTYPE_WORD),
4426 };
4427
4428 const PosixBracketEntryType *pb;
4429 int not, i, r;
4430 int ascii_range;
4431 OnigCodePoint c;
4432 OnigEncoding enc = env->enc;
4433 UChar *p = *src;
4434
4435 if (PPEEK_IS('^')) {
4436 PINC_S;
4437 not = 1;
4438 }
4439 else
4440 not = 0;
4441
4442 if (onigenc_strlen(enc, p, end) < POSIX_BRACKET_NAME_MIN_LEN + 3)
4443 goto not_posix_bracket;
4444
4445 ascii_range = IS_ASCII_RANGE(env->option) &&
4446 ! IS_POSIX_BRACKET_ALL_RANGE(env->option);
4447 for (pb = PBS; pb < PBS + numberof(PBS); pb++) {
4448 if (onigenc_with_ascii_strncmp(enc, p, end, pb->name, pb->len) == 0) {
4449 p = (UChar* )onigenc_step(enc, p, end, pb->len);
4450 if (onigenc_with_ascii_strncmp(enc, p, end, (UChar* )":]", 2) != 0)
4451 return ONIGERR_INVALID_POSIX_BRACKET_TYPE;
4452
4453 r = add_ctype_to_cc(cc, pb->ctype, not, ascii_range, env);
4454 if (r != 0) return r;
4455
4456 if (IS_NOT_NULL(asc_cc)) {
4457 if (pb->ctype != ONIGENC_CTYPE_WORD &&
4458 pb->ctype != ONIGENC_CTYPE_ASCII &&
4459 !ascii_range)
4460 r = add_ctype_to_cc(asc_cc, pb->ctype, not, ascii_range, env);
4461 if (r != 0) return r;
4462 }
4463
4464 PINC_S; PINC_S;
4465 *src = p;
4466 return 0;
4467 }
4468 }
4469
4470 not_posix_bracket:
4471 c = 0;
4472 i = 0;
4473 while (!PEND && ((c = PPEEK) != ':') && c != ']') {
4474 PINC_S;
4475 if (++i > POSIX_BRACKET_CHECK_LIMIT_LENGTH) break;
4476 }
4477 if (c == ':' && ! PEND) {
4478 PINC_S;
4479 if (! PEND) {
4480 PFETCH_S(c);
4481 if (c == ']')
4482 return ONIGERR_INVALID_POSIX_BRACKET_TYPE;
4483 }
4484 }
4485
4486 return 1; /* 1: is not POSIX bracket, but no error. */
4487}
4488
4489static int
4490fetch_char_property_to_ctype(UChar** src, UChar* end, ScanEnv* env)
4491{
4492 int r;
4493 OnigCodePoint c;
4494 OnigEncoding enc = env->enc;
4495 UChar *prev, *start, *p = *src;
4496
4497 r = ONIGERR_INVALID_CHAR_PROPERTY_NAME;
4498 start = prev = p;
4499
4500 while (!PEND) {
4501 prev = p;
4502 PFETCH_S(c);
4503 if (c == '}') {
4504 r = ONIGENC_PROPERTY_NAME_TO_CTYPE(enc, start, prev);
4505 if (r < 0) break;
4506
4507 *src = p;
4508 return r;
4509 }
4510 else if (c == '(' || c == ')' || c == '{' || c == '|') {
4511 break;
4512 }
4513 }
4514
4515 onig_scan_env_set_error_string(env, r, *src, prev);
4516 return r;
4517}
4518
4519static int cclass_case_fold(Node** np, CClassNode* cc, CClassNode* asc_cc, ScanEnv* env);
4520
4521static int
4522parse_char_property(Node** np, OnigToken* tok, UChar** src, UChar* end,
4523 ScanEnv* env)
4524{
4525 int r, ctype;
4526 CClassNode* cc;
4527
4528 ctype = fetch_char_property_to_ctype(src, end, env);
4529 if (ctype < 0) return ctype;
4530
4531 *np = node_new_cclass();
4532 CHECK_NULL_RETURN_MEMERR(*np);
4533 cc = NCCLASS(*np);
4534 r = add_ctype_to_cc(cc, ctype, 0, 0, env);
4535 if (r != 0) return r;
4536 if (tok->u.prop.not != 0) NCCLASS_SET_NOT(cc);
4537
4538 if (IS_IGNORECASE(env->option)) {
4539 if (ctype != ONIGENC_CTYPE_ASCII)
4540 r = cclass_case_fold(np, cc, cc, env);
4541 }
4542 return r;
4543}
4544
4545
4546enum CCSTATE {
4547 CCS_VALUE,
4548 CCS_RANGE,
4549 CCS_COMPLETE,
4550 CCS_START
4551};
4552
4553enum CCVALTYPE {
4554 CCV_SB,
4555 CCV_CODE_POINT,
4556 CCV_CLASS
4557};
4558
4559static int
4560next_state_class(CClassNode* cc, CClassNode* asc_cc,
4561 OnigCodePoint* vs, enum CCVALTYPE* type,
4562 enum CCSTATE* state, ScanEnv* env)
4563{
4564 int r;
4565
4566 if (*state == CCS_RANGE)
4567 return ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE;
4568
4569 if (*state == CCS_VALUE && *type != CCV_CLASS) {
4570 if (*type == CCV_SB) {
4571 BITSET_SET_BIT_CHKDUP(cc->bs, (int )(*vs));
4572 if (IS_NOT_NULL(asc_cc))
4573 BITSET_SET_BIT(asc_cc->bs, (int )(*vs));
4574 }
4575 else if (*type == CCV_CODE_POINT) {
4576 r = add_code_range(&(cc->mbuf), env, *vs, *vs);
4577 if (r < 0) return r;
4578 if (IS_NOT_NULL(asc_cc)) {
4579 r = add_code_range0(&(asc_cc->mbuf), env, *vs, *vs, 0);
4580 if (r < 0) return r;
4581 }
4582 }
4583 }
4584
4585 *state = CCS_VALUE;
4586 *type = CCV_CLASS;
4587 return 0;
4588}
4589
4590static int
4591next_state_val(CClassNode* cc, CClassNode* asc_cc,
4592 OnigCodePoint *from, OnigCodePoint to,
4593 int* from_israw, int to_israw,
4594 enum CCVALTYPE intype, enum CCVALTYPE* type,
4595 enum CCSTATE* state, ScanEnv* env)
4596{
4597 int r;
4598
4599 switch (*state) {
4600 case CCS_VALUE:
4601 if (*type == CCV_SB) {
4602 BITSET_SET_BIT_CHKDUP(cc->bs, (int )(*from));
4603 if (IS_NOT_NULL(asc_cc))
4604 BITSET_SET_BIT(asc_cc->bs, (int )(*from));
4605 }
4606 else if (*type == CCV_CODE_POINT) {
4607 r = add_code_range(&(cc->mbuf), env, *from, *from);
4608 if (r < 0) return r;
4609 if (IS_NOT_NULL(asc_cc)) {
4610 r = add_code_range0(&(asc_cc->mbuf), env, *from, *from, 0);
4611 if (r < 0) return r;
4612 }
4613 }
4614 break;
4615
4616 case CCS_RANGE:
4617 if (intype == *type) {
4618 if (intype == CCV_SB) {
4619 if (*from > 0xff || to > 0xff)
4620 return ONIGERR_INVALID_CODE_POINT_VALUE;
4621
4622 if (*from > to) {
4623 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC))
4624 goto ccs_range_end;
4625 else
4626 return ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS;
4627 }
4628 bitset_set_range(env, cc->bs, (int )*from, (int )to);
4629 if (IS_NOT_NULL(asc_cc))
4630 bitset_set_range(env, asc_cc->bs, (int )*from, (int )to);
4631 }
4632 else {
4633 r = add_code_range(&(cc->mbuf), env, *from, to);
4634 if (r < 0) return r;
4635 if (IS_NOT_NULL(asc_cc)) {
4636 r = add_code_range0(&(asc_cc->mbuf), env, *from, to, 0);
4637 if (r < 0) return r;
4638 }
4639 }
4640 }
4641 else {
4642 if (*from > to) {
4643 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC))
4644 goto ccs_range_end;
4645 else
4646 return ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS;
4647 }
4648 bitset_set_range(env, cc->bs, (int )*from, (int )(to < 0xff ? to : 0xff));
4649 r = add_code_range(&(cc->mbuf), env, (OnigCodePoint )*from, to);
4650 if (r < 0) return r;
4651 if (IS_NOT_NULL(asc_cc)) {
4652 bitset_set_range(env, asc_cc->bs, (int )*from, (int )(to < 0xff ? to : 0xff));
4653 r = add_code_range0(&(asc_cc->mbuf), env, (OnigCodePoint )*from, to, 0);
4654 if (r < 0) return r;
4655 }
4656 }
4657 ccs_range_end:
4658 *state = CCS_COMPLETE;
4659 break;
4660
4661 case CCS_COMPLETE:
4662 case CCS_START:
4663 *state = CCS_VALUE;
4664 break;
4665
4666 default:
4667 break;
4668 }
4669
4670 *from_israw = to_israw;
4671 *from = to;
4672 *type = intype;
4673 return 0;
4674}
4675
4676static int
4677code_exist_check(OnigCodePoint c, UChar* from, UChar* end, int ignore_escaped,
4678 ScanEnv* env)
4679{
4680 int in_esc;
4681 OnigCodePoint code;
4682 OnigEncoding enc = env->enc;
4683 UChar* p = from;
4684
4685 in_esc = 0;
4686 while (! PEND) {
4687 if (ignore_escaped && in_esc) {
4688 in_esc = 0;
4689 }
4690 else {
4691 PFETCH_S(code);
4692 if (code == c) return 1;
4693 if (code == MC_ESC(env->syntax)) in_esc = 1;
4694 }
4695 }
4696 return 0;
4697}
4698
4699static int
4700parse_char_class(Node** np, Node** asc_np, OnigToken* tok, UChar** src, UChar* end,
4701 ScanEnv* env)
4702{
4703 int r, neg, len, fetched, and_start;
4704 OnigCodePoint v, vs;
4705 UChar *p;
4706 Node* node;
4707 Node* asc_node;
4708 CClassNode *cc, *prev_cc;
4709 CClassNode *asc_cc, *asc_prev_cc;
4710 CClassNode work_cc, asc_work_cc;
4711
4712 enum CCSTATE state;
4713 enum CCVALTYPE val_type, in_type;
4714 int val_israw, in_israw;
4715
4716 *np = *asc_np = NULL_NODE;
4717 env->parse_depth++;
4718 if (env->parse_depth > ParseDepthLimit)
4719 return ONIGERR_PARSE_DEPTH_LIMIT_OVER;
4720 prev_cc = asc_prev_cc = (CClassNode* )NULL;
4721 r = fetch_token_in_cc(tok, src, end, env);
4722 if (r == TK_CHAR && tok->u.c == '^' && tok->escaped == 0) {
4723 neg = 1;
4724 r = fetch_token_in_cc(tok, src, end, env);
4725 }
4726 else {
4727 neg = 0;
4728 }
4729
4730 if (r < 0) return r;
4731 if (r == TK_CC_CLOSE) {
4732 if (! code_exist_check((OnigCodePoint )']',
4733 *src, env->pattern_end, 1, env))
4734 return ONIGERR_EMPTY_CHAR_CLASS;
4735
4736 CC_ESC_WARN(env, (UChar* )"]");
4737 r = tok->type = TK_CHAR; /* allow []...] */
4738 }
4739
4740 *np = node = node_new_cclass();
4741 CHECK_NULL_RETURN_MEMERR(node);
4742 cc = NCCLASS(node);
4743
4744 if (IS_IGNORECASE(env->option)) {
4745 *asc_np = asc_node = node_new_cclass();
4746 CHECK_NULL_RETURN_MEMERR(asc_node);
4747 asc_cc = NCCLASS(asc_node);
4748 }
4749 else {
4750 asc_node = NULL_NODE;
4751 asc_cc = NULL;
4752 }
4753
4754 and_start = 0;
4755 state = CCS_START;
4756 p = *src;
4757 while (r != TK_CC_CLOSE) {
4758 fetched = 0;
4759 switch (r) {
4760 case TK_CHAR:
4761 if ((tok->u.code >= SINGLE_BYTE_SIZE) ||
4762 (len = ONIGENC_CODE_TO_MBCLEN(env->enc, tok->u.c)) > 1) {
4763 in_type = CCV_CODE_POINT;
4764 }
4765 else if (len < 0) {
4766 r = len;
4767 goto err;
4768 }
4769 else {
4770 sb_char:
4771 in_type = CCV_SB;
4772 }
4773 v = (OnigCodePoint )tok->u.c;
4774 in_israw = 0;
4775 goto val_entry2;
4776 break;
4777
4778 case TK_RAW_BYTE:
4779 /* tok->base != 0 : octal or hexadec. */
4780 if (! ONIGENC_IS_SINGLEBYTE(env->enc) && tok->base != 0) {
4781 UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN];
4782 UChar* psave = p;
4783 int i, base = tok->base;
4784
4785 buf[0] = (UChar )tok->u.c;
4786 for (i = 1; i < ONIGENC_MBC_MAXLEN(env->enc); i++) {
4787 r = fetch_token_in_cc(tok, &p, end, env);
4788 if (r < 0) goto err;
4789 if (r != TK_RAW_BYTE || tok->base != base) {
4790 fetched = 1;
4791 break;
4792 }
4793 buf[i] = (UChar )tok->u.c;
4794 }
4795
4796 if (i < ONIGENC_MBC_MINLEN(env->enc)) {
4797 r = ONIGERR_TOO_SHORT_MULTI_BYTE_STRING;
4798 goto err;
4799 }
4800
4801 len = ONIGENC_PRECISE_MBC_ENC_LEN(env->enc, buf, buf + i);
4802 if (! ONIGENC_MBCLEN_CHARFOUND_P(len)) {
4803 r = ONIGENC_MBCLEN_NEEDMORE_P(len) ?
4804 ONIGERR_TOO_SHORT_MULTI_BYTE_STRING : ONIGERR_INVALID_CODE_POINT_VALUE;
4805 goto err;
4806 }
4807 else if (i > len) { /* fetch back */
4808 p = psave;
4809 for (i = 1; i < len; i++) {
4810 (void)fetch_token_in_cc(tok, &p, end, env);
4811 /* no need to check the return value (already checked above) */
4812 }
4813 fetched = 0;
4814 }
4815
4816 if (i == 1) {
4817 v = (OnigCodePoint )buf[0];
4818 goto raw_single;
4819 }
4820 else {
4821 v = ONIGENC_MBC_TO_CODE(env->enc, buf, buf + len);
4822 in_type = CCV_CODE_POINT;
4823 }
4824 }
4825 else {
4826 v = (OnigCodePoint )tok->u.c;
4827 raw_single:
4828 in_type = CCV_SB;
4829 }
4830 in_israw = 1;
4831 goto val_entry2;
4832 break;
4833
4834 case TK_CODE_POINT:
4835 v = tok->u.code;
4836 r = check_code_point(v, env->enc);
4837 if (r != 0) goto err;
4838 in_israw = 1;
4839 val_entry:
4840 len = ONIGENC_CODE_TO_MBCLEN(env->enc, v);
4841 if (len < 0) {
4842 r = len;
4843 goto err;
4844 }
4845 in_type = (len == 1 ? CCV_SB : CCV_CODE_POINT);
4846 val_entry2:
4847 r = next_state_val(cc, asc_cc, &vs, v, &val_israw, in_israw, in_type, &val_type,
4848 &state, env);
4849 if (r != 0) goto err;
4850 break;
4851
4852 case TK_POSIX_BRACKET_OPEN:
4853 r = parse_posix_bracket(cc, asc_cc, &p, end, env);
4854 if (r < 0) goto err;
4855 if (r == 1) { /* is not POSIX bracket */
4856 CC_ESC_WARN(env, (UChar* )"[");
4857 p = tok->backp;
4858 v = (OnigCodePoint )tok->u.c;
4859 in_israw = 0;
4860 goto val_entry;
4861 }
4862 goto next_class;
4863 break;
4864
4865 case TK_CHAR_TYPE:
4866 r = add_ctype_to_cc(cc, tok->u.prop.ctype, tok->u.prop.not,
4867 IS_ASCII_RANGE(env->option), env);
4868 if (r != 0) goto err;
4869 if (IS_NOT_NULL(asc_cc)) {
4870 if (tok->u.prop.ctype != ONIGENC_CTYPE_WORD)
4871 r = add_ctype_to_cc(asc_cc, tok->u.prop.ctype, tok->u.prop.not,
4872 IS_ASCII_RANGE(env->option), env);
4873 if (r != 0) goto err;
4874 }
4875
4876 next_class:
4877 r = next_state_class(cc, asc_cc, &vs, &val_type, &state, env);
4878 if (r != 0) goto err;
4879 break;
4880
4881 case TK_CHAR_PROPERTY:
4882 {
4883 int ctype;
4884
4885 ctype = fetch_char_property_to_ctype(&p, end, env);
4886 if (ctype < 0) {
4887 r = ctype;
4888 goto err;
4889 }
4890 r = add_ctype_to_cc(cc, ctype, tok->u.prop.not, 0, env);
4891 if (r != 0) goto err;
4892 if (IS_NOT_NULL(asc_cc)) {
4893 if (ctype != ONIGENC_CTYPE_ASCII)
4894 r = add_ctype_to_cc(asc_cc, ctype, tok->u.prop.not, 0, env);
4895 if (r != 0) goto err;
4896 }
4897 goto next_class;
4898 }
4899 break;
4900
4901 case TK_CC_RANGE:
4902 if (state == CCS_VALUE) {
4903 r = fetch_token_in_cc(tok, &p, end, env);
4904 if (r < 0) goto err;
4905 fetched = 1;
4906 if (r == TK_CC_CLOSE) { /* allow [x-] */
4907 range_end_val:
4908 v = (OnigCodePoint )'-';
4909 in_israw = 0;
4910 goto val_entry;
4911 }
4912 else if (r == TK_CC_AND) {
4913 CC_ESC_WARN(env, (UChar* )"-");
4914 goto range_end_val;
4915 }
4916
4917 if (val_type == CCV_CLASS) {
4918 r = ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS;
4919 goto err;
4920 }
4921
4922 state = CCS_RANGE;
4923 }
4924 else if (state == CCS_START) {
4925 /* [-xa] is allowed */
4926 v = (OnigCodePoint )tok->u.c;
4927 in_israw = 0;
4928
4929 r = fetch_token_in_cc(tok, &p, end, env);
4930 if (r < 0) goto err;
4931 fetched = 1;
4932 /* [--x] or [a&&-x] is warned. */
4933 if (r == TK_CC_RANGE || and_start != 0)
4934 CC_ESC_WARN(env, (UChar* )"-");
4935
4936 goto val_entry;
4937 }
4938 else if (state == CCS_RANGE) {
4939 CC_ESC_WARN(env, (UChar* )"-");
4940 goto sb_char; /* [!--x] is allowed */
4941 }
4942 else { /* CCS_COMPLETE */
4943 r = fetch_token_in_cc(tok, &p, end, env);
4944 if (r < 0) goto err;
4945 fetched = 1;
4946 if (r == TK_CC_CLOSE) goto range_end_val; /* allow [a-b-] */
4947 else if (r == TK_CC_AND) {
4948 CC_ESC_WARN(env, (UChar* )"-");
4949 goto range_end_val;
4950 }
4951
4952 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_DOUBLE_RANGE_OP_IN_CC)) {
4953 CC_ESC_WARN(env, (UChar* )"-");
4954 goto range_end_val; /* [0-9-a] is allowed as [0-9\-a] */
4955 }
4956 r = ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS;
4957 goto err;
4958 }
4959 break;
4960
4961 case TK_CC_CC_OPEN: /* [ */
4962 {
4963 Node *anode, *aasc_node;
4964 CClassNode* acc;
4965
4966 r = parse_char_class(&anode, &aasc_node, tok, &p, end, env);
4967 if (r == 0) {
4968 acc = NCCLASS(anode);
4969 r = or_cclass(cc, acc, env);
4970 }
4971 if (r == 0 && IS_NOT_NULL(aasc_node)) {
4972 acc = NCCLASS(aasc_node);
4973 r = or_cclass(asc_cc, acc, env);
4974 }
4975 onig_node_free(anode);
4976 onig_node_free(aasc_node);
4977 if (r != 0) goto err;
4978 }
4979 break;
4980
4981 case TK_CC_AND: /* && */
4982 {
4983 if (state == CCS_VALUE) {
4984 r = next_state_val(cc, asc_cc, &vs, 0, &val_israw, 0, val_type,
4985 &val_type, &state, env);
4986 if (r != 0) goto err;
4987 }
4988 /* initialize local variables */
4989 and_start = 1;
4990 state = CCS_START;
4991
4992 if (IS_NOT_NULL(prev_cc)) {
4993 r = and_cclass(prev_cc, cc, env);
4994 if (r != 0) goto err;
4995 bbuf_free(cc->mbuf);
4996 cc->mbuf = NULL;
4997 if (IS_NOT_NULL(asc_cc)) {
4998 r = and_cclass(asc_prev_cc, asc_cc, env);
4999 if (r != 0) goto err;
5000 bbuf_free(asc_cc->mbuf);
5001 }
5002 }
5003 else {
5004 prev_cc = cc;
5005 cc = &work_cc;
5006 if (IS_NOT_NULL(asc_cc)) {
5007 asc_prev_cc = asc_cc;
5008 asc_cc = &asc_work_cc;
5009 }
5010 }
5011 initialize_cclass(cc);
5012 if (IS_NOT_NULL(asc_cc))
5013 initialize_cclass(asc_cc);
5014 }
5015 break;
5016
5017 case TK_EOT:
5018 r = ONIGERR_PREMATURE_END_OF_CHAR_CLASS;
5019 goto err;
5020 break;
5021 default:
5022 r = ONIGERR_PARSER_BUG;
5023 goto err;
5024 break;
5025 }
5026
5027 if (fetched)
5028 r = tok->type;
5029 else {
5030 r = fetch_token_in_cc(tok, &p, end, env);
5031 if (r < 0) goto err;
5032 }
5033 }
5034
5035 if (state == CCS_VALUE) {
5036 r = next_state_val(cc, asc_cc, &vs, 0, &val_israw, 0, val_type,
5037 &val_type, &state, env);
5038 if (r != 0) goto err;
5039 }
5040
5041 if (IS_NOT_NULL(prev_cc)) {
5042 r = and_cclass(prev_cc, cc, env);
5043 if (r != 0) goto err;
5044 bbuf_free(cc->mbuf);
5045 cc = prev_cc;
5046 if (IS_NOT_NULL(asc_cc)) {
5047 r = and_cclass(asc_prev_cc, asc_cc, env);
5048 if (r != 0) goto err;
5049 bbuf_free(asc_cc->mbuf);
5050 asc_cc = asc_prev_cc;
5051 }
5052 }
5053
5054 if (neg != 0) {
5055 NCCLASS_SET_NOT(cc);
5056 if (IS_NOT_NULL(asc_cc))
5057 NCCLASS_SET_NOT(asc_cc);
5058 }
5059 else {
5060 NCCLASS_CLEAR_NOT(cc);
5061 if (IS_NOT_NULL(asc_cc))
5062 NCCLASS_CLEAR_NOT(asc_cc);
5063 }
5064 if (IS_NCCLASS_NOT(cc) &&
5065 IS_SYNTAX_BV(env->syntax, ONIG_SYN_NOT_NEWLINE_IN_NEGATIVE_CC)) {
5066 int is_empty;
5067
5068 is_empty = (IS_NULL(cc->mbuf) ? 1 : 0);
5069 if (is_empty != 0)
5070 BITSET_IS_EMPTY(cc->bs, is_empty);
5071
5072 if (is_empty == 0) {
5073#define NEWLINE_CODE 0x0a
5074
5075 if (ONIGENC_IS_CODE_NEWLINE(env->enc, NEWLINE_CODE)) {
5076 if (ONIGENC_CODE_TO_MBCLEN(env->enc, NEWLINE_CODE) == 1)
5077 BITSET_SET_BIT_CHKDUP(cc->bs, NEWLINE_CODE);
5078 else {
5079 r = add_code_range(&(cc->mbuf), env, NEWLINE_CODE, NEWLINE_CODE);
5080 if (r < 0) goto err;
5081 }
5082 }
5083 }
5084 }
5085 *src = p;
5086 env->parse_depth--;
5087 return 0;
5088
5089 err:
5090 if (cc != NCCLASS(*np))
5091 bbuf_free(cc->mbuf);
5092 if (IS_NOT_NULL(asc_cc) && (asc_cc != NCCLASS(*asc_np)))
5093 bbuf_free(asc_cc->mbuf);
5094 return r;
5095}
5096
5097static int parse_subexp(Node** top, OnigToken* tok, int term,
5098 UChar** src, UChar* end, ScanEnv* env);
5099
5100static int
5101parse_enclose(Node** np, OnigToken* tok, int term, UChar** src, UChar* end,
5102 ScanEnv* env)
5103{
5104 int r = 0, num;
5105 Node *target, *work1 = NULL, *work2 = NULL;
5106 OnigOptionType option;
5107 OnigCodePoint c;
5108 OnigEncoding enc = env->enc;
5109
5110#ifdef USE_NAMED_GROUP
5111 int list_capture;
5112#endif
5113
5114 UChar* p = *src;
5115 PFETCH_READY;
5116
5117 *np = NULL;
5118 if (PEND) return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS;
5119
5120 option = env->option;
5121 if (PPEEK_IS('?') &&
5122 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_GROUP_EFFECT)) {
5123 PINC;
5124 if (PEND) return ONIGERR_END_PATTERN_IN_GROUP;
5125
5126 PFETCH(c);
5127 switch (c) {
5128 case ':': /* (?:...) grouping only */
5129 group:
5130 r = fetch_token(tok, &p, end, env);
5131 if (r < 0) return r;
5132 r = parse_subexp(np, tok, term, &p, end, env);
5133 if (r < 0) return r;
5134 *src = p;
5135 return 1; /* group */
5136 break;
5137
5138 case '=':
5139 *np = onig_node_new_anchor(ANCHOR_PREC_READ);
5140 break;
5141 case '!': /* preceding read */
5142 *np = onig_node_new_anchor(ANCHOR_PREC_READ_NOT);
5143 break;
5144 case '>': /* (?>...) stop backtrack */
5145 *np = node_new_enclose(ENCLOSE_STOP_BACKTRACK);
5146 break;
5147 case '~': /* (?~...) absent operator */
5148 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_TILDE_ABSENT)) {
5149 *np = node_new_enclose(ENCLOSE_ABSENT);
5150 }
5151 else {
5152 return ONIGERR_UNDEFINED_GROUP_OPTION;
5153 }
5154 break;
5155
5156#ifdef USE_NAMED_GROUP
5157 case '\'':
5158 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) {
5159 goto named_group1;
5160 }
5161 else
5162 return ONIGERR_UNDEFINED_GROUP_OPTION;
5163 break;
5164
5165# ifdef USE_CAPITAL_P_NAMED_GROUP
5166 case 'P': /* (?P<name>...) */
5167 if (!PEND &&
5168 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_CAPITAL_P_NAMED_GROUP)) {
5169 PFETCH(c);
5170 if (c == '<') goto named_group1;
5171 }
5172 return ONIGERR_UNDEFINED_GROUP_OPTION;
5173 break;
5174# endif
5175#endif
5176
5177 case '<': /* look behind (?<=...), (?<!...) */
5178 if (PEND) return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS;
5179 PFETCH(c);
5180 if (c == '=')
5181 *np = onig_node_new_anchor(ANCHOR_LOOK_BEHIND);
5182 else if (c == '!')
5183 *np = onig_node_new_anchor(ANCHOR_LOOK_BEHIND_NOT);
5184#ifdef USE_NAMED_GROUP
5185 else { /* (?<name>...) */
5186 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) {
5187 UChar *name;
5188 UChar *name_end;
5189
5190 PUNFETCH;
5191 c = '<';
5192
5193 named_group1:
5194 list_capture = 0;
5195
5196# ifdef USE_CAPTURE_HISTORY
5197 named_group2:
5198# endif
5199 name = p;
5200 r = fetch_name((OnigCodePoint )c, &p, end, &name_end, env, &num, 0);
5201 if (r < 0) return r;
5202
5203 num = scan_env_add_mem_entry(env);
5204 if (num < 0) return num;
5205 if (list_capture != 0 && num >= (int )BIT_STATUS_BITS_NUM)
5206 return ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY;
5207
5208 r = name_add(env->reg, name, name_end, num, env);
5209 if (r != 0) return r;
5210 *np = node_new_enclose_memory(env->option, 1);
5211 CHECK_NULL_RETURN_MEMERR(*np);
5212 NENCLOSE(*np)->regnum = num;
5213 if (list_capture != 0)
5214 BIT_STATUS_ON_AT_SIMPLE(env->capture_history, num);
5215 env->num_named++;
5216 }
5217 else {
5218 return ONIGERR_UNDEFINED_GROUP_OPTION;
5219 }
5220 }
5221#else
5222 else {
5223 return ONIGERR_UNDEFINED_GROUP_OPTION;
5224 }
5225#endif
5226 break;
5227
5228#ifdef USE_CAPTURE_HISTORY
5229 case '@':
5230 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ATMARK_CAPTURE_HISTORY)) {
5231# ifdef USE_NAMED_GROUP
5232 if (!PEND &&
5233 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) {
5234 PFETCH(c);
5235 if (c == '<' || c == '\'') {
5236 list_capture = 1;
5237 goto named_group2; /* (?@<name>...) */
5238 }
5239 PUNFETCH;
5240 }
5241# endif
5242 *np = node_new_enclose_memory(env->option, 0);
5243 CHECK_NULL_RETURN_MEMERR(*np);
5244 num = scan_env_add_mem_entry(env);
5245 if (num < 0) return num;
5246 if (num >= (int )BIT_STATUS_BITS_NUM)
5247 return ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY;
5248
5249 NENCLOSE(*np)->regnum = num;
5250 BIT_STATUS_ON_AT_SIMPLE(env->capture_history, num);
5251 }
5252 else {
5253 return ONIGERR_UNDEFINED_GROUP_OPTION;
5254 }
5255 break;
5256#endif /* USE_CAPTURE_HISTORY */
5257
5258 case '(': /* conditional expression: (?(cond)yes), (?(cond)yes|no) */
5259 if (!PEND &&
5260 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LPAREN_CONDITION)) {
5261 UChar *name = NULL;
5262 UChar *name_end;
5263 PFETCH(c);
5264 if (ONIGENC_IS_CODE_DIGIT(enc, c)) { /* (n) */
5265 PUNFETCH;
5266 r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &num, 1);
5267 if (r < 0) return r;
5268#if 0
5269 /* Relative number is not currently supported. (same as Perl) */
5270 if (num < 0) {
5271 num = BACKREF_REL_TO_ABS(num, env);
5272 if (num <= 0)
5273 return ONIGERR_INVALID_BACKREF;
5274 }
5275#endif
5276 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_STRICT_CHECK_BACKREF)) {
5277 if (num > env->num_mem ||
5278 IS_NULL(SCANENV_MEM_NODES(env)[num]))
5279 return ONIGERR_INVALID_BACKREF;
5280 }
5281 }
5282#ifdef USE_NAMED_GROUP
5283 else if (c == '<' || c == '\'') { /* (<name>), ('name') */
5284 name = p;
5285 r = fetch_named_backref_token(c, tok, &p, end, env);
5286 if (r < 0) return r;
5287 if (!PPEEK_IS(')')) return ONIGERR_UNDEFINED_GROUP_OPTION;
5288 PINC;
5289
5290 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_USE_LEFT_MOST_NAMED_GROUP)) {
5291 num = tok->u.backref.ref1;
5292 }
5293 else {
5294 /* FIXME:
5295 * Use left most named group for now. This is the same as Perl.
5296 * However this should use the same strategy as normal back-
5297 * references on Ruby syntax; search right to left. */
5298 int len = tok->u.backref.num;
5299 num = len > 1 ? tok->u.backref.refs[0] : tok->u.backref.ref1;
5300 }
5301 }
5302#endif
5303 else
5304 return ONIGERR_INVALID_CONDITION_PATTERN;
5305 *np = node_new_enclose(ENCLOSE_CONDITION);
5306 CHECK_NULL_RETURN_MEMERR(*np);
5307 NENCLOSE(*np)->regnum = num;
5308 if (IS_NOT_NULL(name)) NENCLOSE(*np)->state |= NST_NAME_REF;
5309 }
5310 else
5311 return ONIGERR_UNDEFINED_GROUP_OPTION;
5312 break;
5313
5314#if 0
5315 case '|': /* branch reset: (?|...) */
5316 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_VBAR_BRANCH_RESET)) {
5317 /* TODO */
5318 }
5319 else
5320 return ONIGERR_UNDEFINED_GROUP_OPTION;
5321 break;
5322#endif
5323
5324 case '^': /* loads default options */
5325 if (!PEND && IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) {
5326 /* d-imsx */
5327 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1);
5328 ONOFF(option, ONIG_OPTION_IGNORECASE, 1);
5329 ONOFF(option, ONIG_OPTION_SINGLELINE, 0);
5330 ONOFF(option, ONIG_OPTION_MULTILINE, 1);
5331 ONOFF(option, ONIG_OPTION_EXTEND, 1);
5332 PFETCH(c);
5333 }
5334#if 0
5335 else if (!PEND && IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) {
5336 /* d-imx */
5337 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0);
5338 ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 0);
5339 ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 0);
5340 ONOFF(option, ONIG_OPTION_IGNORECASE, 1);
5341 ONOFF(option, ONIG_OPTION_MULTILINE, 1);
5342 ONOFF(option, ONIG_OPTION_EXTEND, 1);
5343 PFETCH(c);
5344 }
5345#endif
5346 else {
5347 return ONIGERR_UNDEFINED_GROUP_OPTION;
5348 }
5349 /* fall through */
5350#ifdef USE_POSIXLINE_OPTION
5351 case 'p':
5352#endif
5353 case '-': case 'i': case 'm': case 's': case 'x':
5354 case 'a': case 'd': case 'l': case 'u':
5355 {
5356 int neg = 0;
5357
5358 while (1) {
5359 switch (c) {
5360 case ':':
5361 case ')':
5362 break;
5363
5364 case '-': neg = 1; break;
5365 case 'x': ONOFF(option, ONIG_OPTION_EXTEND, neg); break;
5366 case 'i': ONOFF(option, ONIG_OPTION_IGNORECASE, neg); break;
5367 case 's':
5368 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) {
5369 ONOFF(option, ONIG_OPTION_MULTILINE, neg);
5370 }
5371 else
5372 return ONIGERR_UNDEFINED_GROUP_OPTION;
5373 break;
5374
5375 case 'm':
5376 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) {
5377 ONOFF(option, ONIG_OPTION_SINGLELINE, (neg == 0 ? 1 : 0));
5378 }
5379 else if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) {
5380 ONOFF(option, ONIG_OPTION_MULTILINE, neg);
5381 }
5382 else
5383 return ONIGERR_UNDEFINED_GROUP_OPTION;
5384 break;
5385#ifdef USE_POSIXLINE_OPTION
5386 case 'p':
5387 ONOFF(option, ONIG_OPTION_MULTILINE|ONIG_OPTION_SINGLELINE, neg);
5388 break;
5389#endif
5390
5391 case 'a': /* limits \d, \s, \w and POSIX brackets to ASCII range */
5392 if ((IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) ||
5393 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) &&
5394 (neg == 0)) {
5395 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0);
5396 ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 1);
5397 ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 1);
5398 }
5399 else
5400 return ONIGERR_UNDEFINED_GROUP_OPTION;
5401 break;
5402
5403 case 'u':
5404 if ((IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) ||
5405 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) &&
5406 (neg == 0)) {
5407 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1);
5408 ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 1);
5409 ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 1);
5410 }
5411 else
5412 return ONIGERR_UNDEFINED_GROUP_OPTION;
5413 break;
5414
5415 case 'd':
5416 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) &&
5417 (neg == 0)) {
5418 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1);
5419 }
5420 else if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY) &&
5421 (neg == 0)) {
5422 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0);
5423 ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 0);
5424 ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 0);
5425 }
5426 else
5427 return ONIGERR_UNDEFINED_GROUP_OPTION;
5428 break;
5429
5430 case 'l':
5431 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) && (neg == 0)) {
5432 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1);
5433 }
5434 else
5435 return ONIGERR_UNDEFINED_GROUP_OPTION;
5436 break;
5437
5438 default:
5439 return ONIGERR_UNDEFINED_GROUP_OPTION;
5440 }
5441
5442 if (c == ')') {
5443 *np = node_new_option(option);
5444 CHECK_NULL_RETURN_MEMERR(*np);
5445 *src = p;
5446 return 2; /* option only */
5447 }
5448 else if (c == ':') {
5449 OnigOptionType prev = env->option;
5450
5451 env->option = option;
5452 r = fetch_token(tok, &p, end, env);
5453 if (r < 0) {
5454 env->option = prev;
5455 return r;
5456 }
5457 r = parse_subexp(&target, tok, term, &p, end, env);
5458 env->option = prev;
5459 if (r < 0) return r;
5460 *np = node_new_option(option);
5461 CHECK_NULL_RETURN_MEMERR(*np);
5462 NENCLOSE(*np)->target = target;
5463 *src = p;
5464 return 0;
5465 }
5466
5467 if (PEND) return ONIGERR_END_PATTERN_IN_GROUP;
5468 PFETCH(c);
5469 }
5470 }
5471 break;
5472
5473 default:
5474 return ONIGERR_UNDEFINED_GROUP_OPTION;
5475 }
5476 }
5477 else {
5478 if (ONIG_IS_OPTION_ON(env->option, ONIG_OPTION_DONT_CAPTURE_GROUP))
5479 goto group;
5480
5481 *np = node_new_enclose_memory(env->option, 0);
5482 CHECK_NULL_RETURN_MEMERR(*np);
5483 num = scan_env_add_mem_entry(env);
5484 if (num < 0) return num;
5485 NENCLOSE(*np)->regnum = num;
5486 }
5487
5488 CHECK_NULL_RETURN_MEMERR(*np);
5489 r = fetch_token(tok, &p, end, env);
5490 if (r < 0) return r;
5491 r = parse_subexp(&target, tok, term, &p, end, env);
5492 if (r < 0) {
5493 onig_node_free(target);
5494 return r;
5495 }
5496
5497 if (NTYPE(*np) == NT_ANCHOR)
5498 NANCHOR(*np)->target = target;
5499 else {
5500 NENCLOSE(*np)->target = target;
5501 if (NENCLOSE(*np)->type == ENCLOSE_MEMORY) {
5502 /* Don't move this to previous of parse_subexp() */
5503 r = scan_env_set_mem_node(env, NENCLOSE(*np)->regnum, *np);
5504 if (r != 0) return r;
5505 }
5506 else if (NENCLOSE(*np)->type == ENCLOSE_CONDITION) {
5507 if (NTYPE(target) != NT_ALT) {
5508 /* convert (?(cond)yes) to (?(cond)yes|empty) */
5509 work1 = node_new_empty();
5510 if (IS_NULL(work1)) goto err;
5511 work2 = onig_node_new_alt(work1, NULL_NODE);
5512 if (IS_NULL(work2)) goto err;
5513 work1 = onig_node_new_alt(target, work2);
5514 if (IS_NULL(work1)) goto err;
5515 NENCLOSE(*np)->target = work1;
5516 }
5517 }
5518 }
5519
5520 *src = p;
5521 return 0;
5522
5523 err:
5524 onig_node_free(work1);
5525 onig_node_free(work2);
5526 onig_node_free(*np);
5527 *np = NULL;
5528 return ONIGERR_MEMORY;
5529}
5530
5531static const char* const PopularQStr[] = {
5532 "?", "*", "+", "??", "*?", "+?"
5533};
5534
5535static const char* const ReduceQStr[] = {
5536 "", "", "*", "*?", "??", "+ and ??", "+? and ?"
5537};
5538
5539static int
5540set_quantifier(Node* qnode, Node* target, int group, ScanEnv* env)
5541{
5542 QtfrNode* qn;
5543
5544 qn = NQTFR(qnode);
5545 if (qn->lower == 1 && qn->upper == 1) {
5546 return 1;
5547 }
5548
5549 switch (NTYPE(target)) {
5550 case NT_STR:
5551 if (! group) {
5552 StrNode* sn = NSTR(target);
5553 if (str_node_can_be_split(sn, env->enc)) {
5554 Node* n = str_node_split_last_char(sn, env->enc);
5555 if (IS_NOT_NULL(n)) {
5556 qn->target = n;
5557 return 2;
5558 }
5559 }
5560 }
5561 break;
5562
5563 case NT_QTFR:
5564 { /* check redundant double repeat. */
5565 /* verbose warn (?:.?)? etc... but not warn (.?)? etc... */
5566 QtfrNode* qnt = NQTFR(target);
5567 int nestq_num = popular_quantifier_num(qn);
5568 int targetq_num = popular_quantifier_num(qnt);
5569
5570#ifdef USE_WARNING_REDUNDANT_NESTED_REPEAT_OPERATOR
5571 if (nestq_num >= 0 && targetq_num >= 0 &&
5572 IS_SYNTAX_BV(env->syntax, ONIG_SYN_WARN_REDUNDANT_NESTED_REPEAT)) {
5573 switch (ReduceTypeTable[targetq_num][nestq_num]) {
5574 case RQ_ASIS:
5575 break;
5576
5577 case RQ_DEL:
5578 if (onig_warn != onig_null_warn) {
5579 onig_syntax_warn(env, "regular expression has redundant nested repeat operator '%s'",
5580 PopularQStr[targetq_num]);
5581 }
5582 goto warn_exit;
5583 break;
5584
5585 default:
5586 if (onig_warn != onig_null_warn) {
5587 onig_syntax_warn(env, "nested repeat operator '%s' and '%s' was replaced with '%s' in regular expression",
5588 PopularQStr[targetq_num], PopularQStr[nestq_num],
5589 ReduceQStr[ReduceTypeTable[targetq_num][nestq_num]]);
5590 }
5591 goto warn_exit;
5592 break;
5593 }
5594 }
5595
5596 warn_exit:
5597#endif
5598 if (targetq_num >= 0) {
5599 if (nestq_num >= 0) {
5600 onig_reduce_nested_quantifier(qnode, target);
5601 goto q_exit;
5602 }
5603 else if (targetq_num == 1 || targetq_num == 2) { /* * or + */
5604 /* (?:a*){n,m}, (?:a+){n,m} => (?:a*){n,n}, (?:a+){n,n} */
5605 if (! IS_REPEAT_INFINITE(qn->upper) && qn->upper > 1 && qn->greedy) {
5606 qn->upper = (qn->lower == 0 ? 1 : qn->lower);
5607 }
5608 }
5609 }
5610 }
5611 break;
5612
5613 default:
5614 break;
5615 }
5616
5617 qn->target = target;
5618 q_exit:
5619 return 0;
5620}
5621
5622
5623#ifndef CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
5624static int
5625clear_not_flag_cclass(CClassNode* cc, OnigEncoding enc)
5626{
5627 BBuf *tbuf;
5628 int r;
5629
5630 if (IS_NCCLASS_NOT(cc)) {
5631 bitset_invert(cc->bs);
5632
5633 if (! ONIGENC_IS_SINGLEBYTE(enc)) {
5634 r = not_code_range_buf(enc, cc->mbuf, &tbuf);
5635 if (r != 0) return r;
5636
5637 bbuf_free(cc->mbuf);
5638 cc->mbuf = tbuf;
5639 }
5640
5641 NCCLASS_CLEAR_NOT(cc);
5642 }
5643
5644 return 0;
5645}
5646#endif /* CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS */
5647
5648static inline bool
5649is_singlebyte_range(OnigCodePoint code, OnigEncoding enc)
5650{
5651 /* single byte encoding */
5652 if (ONIGENC_MBC_MAXLEN(enc) == 1) {
5653 return true;
5654 }
5655
5656 /* wide char encoding */
5657 if (ONIGENC_MBC_MINLEN(enc) > 1) {
5658 return false;
5659 }
5660
5661 return (code < 0x80);
5662}
5663
5664typedef struct {
5665 ScanEnv* env;
5666 CClassNode* cc;
5667 CClassNode* asc_cc;
5668 Node* alt_root;
5669 Node** ptail;
5671
5672static int
5673i_apply_case_fold(OnigCodePoint from, OnigCodePoint to[],
5674 int to_len, void* arg)
5675{
5676 IApplyCaseFoldArg* iarg;
5677 ScanEnv* env;
5678 CClassNode* cc;
5679 CClassNode* asc_cc;
5680 BitSetRef bs;
5681 int add_flag, r;
5682
5683 iarg = (IApplyCaseFoldArg* )arg;
5684 env = iarg->env;
5685 cc = iarg->cc;
5686 asc_cc = iarg->asc_cc;
5687 bs = cc->bs;
5688
5689 if (IS_NULL(asc_cc)) {
5690 add_flag = 0;
5691 }
5692 else if (ONIGENC_IS_ASCII_CODE(from) == ONIGENC_IS_ASCII_CODE(*to)) {
5693 add_flag = 1;
5694 }
5695 else {
5696 add_flag = onig_is_code_in_cc(env->enc, from, asc_cc);
5697 if (IS_NCCLASS_NOT(asc_cc))
5698 add_flag = !add_flag;
5699 }
5700
5701 if (to_len == 1) {
5702 int is_in = onig_is_code_in_cc(env->enc, from, cc);
5703#ifdef CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
5704 if ((is_in != 0 && !IS_NCCLASS_NOT(cc)) ||
5705 (is_in == 0 && IS_NCCLASS_NOT(cc))) {
5706 if (add_flag) {
5707 if (is_singlebyte_range(*to, env->enc)) {
5708 BITSET_SET_BIT(bs, *to);
5709 }
5710 else {
5711 r = add_code_range0(&(cc->mbuf), env, *to, *to, 0);
5712 if (r < 0) return r;
5713 }
5714 }
5715 }
5716#else
5717 if (is_in != 0) {
5718 if (add_flag) {
5719 if (is_singlebyte_range(*to, env->enc)) {
5720 if (IS_NCCLASS_NOT(cc)) {
5721 BITSET_CLEAR_BIT(bs, *to);
5722 }
5723 else {
5724 BITSET_SET_BIT(bs, *to);
5725 }
5726 }
5727 else {
5728 if (IS_NCCLASS_NOT(cc)) clear_not_flag_cclass(cc, env->enc);
5729 r = add_code_range0(&(cc->mbuf), env, *to, *to, 0);
5730 if (r < 0) return r;
5731 }
5732 }
5733 }
5734#endif /* CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS */
5735 }
5736 else {
5737 int r, i, len;
5738 UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN];
5739 Node *snode = NULL_NODE;
5740
5741 if (onig_is_code_in_cc(env->enc, from, cc)
5742#ifdef CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
5743 && !IS_NCCLASS_NOT(cc)
5744#endif
5745 ) {
5746 for (i = 0; i < to_len; i++) {
5747 len = ONIGENC_CODE_TO_MBC(env->enc, to[i], buf);
5748 if (i == 0) {
5749 snode = onig_node_new_str(buf, buf + len);
5750 CHECK_NULL_RETURN_MEMERR(snode);
5751
5752 /* char-class expanded multi-char only
5753 compare with string folded at match time. */
5754 NSTRING_SET_AMBIG(snode);
5755 }
5756 else {
5757 r = onig_node_str_cat(snode, buf, buf + len);
5758 if (r < 0) {
5759 onig_node_free(snode);
5760 return r;
5761 }
5762 }
5763 }
5764
5765 *(iarg->ptail) = onig_node_new_alt(snode, NULL_NODE);
5766 CHECK_NULL_RETURN_MEMERR(*(iarg->ptail));
5767 iarg->ptail = &(NCDR((*(iarg->ptail))));
5768 }
5769 }
5770
5771 return 0;
5772}
5773
5774static int
5775cclass_case_fold(Node** np, CClassNode* cc, CClassNode* asc_cc, ScanEnv* env)
5776{
5777 int r;
5778 IApplyCaseFoldArg iarg;
5779
5780 iarg.env = env;
5781 iarg.cc = cc;
5782 iarg.asc_cc = asc_cc;
5783 iarg.alt_root = NULL_NODE;
5784 iarg.ptail = &(iarg.alt_root);
5785
5786 r = ONIGENC_APPLY_ALL_CASE_FOLD(env->enc, env->case_fold_flag,
5787 i_apply_case_fold, &iarg);
5788 if (r != 0) {
5789 onig_node_free(iarg.alt_root);
5790 return r;
5791 }
5792 if (IS_NOT_NULL(iarg.alt_root)) {
5793 Node* work = onig_node_new_alt(*np, iarg.alt_root);
5794 if (IS_NULL(work)) {
5795 onig_node_free(iarg.alt_root);
5796 return ONIGERR_MEMORY;
5797 }
5798 *np = work;
5799 }
5800 return r;
5801}
5802
5803static int
5804node_linebreak(Node** np, ScanEnv* env)
5805{
5806 /* same as (?>\x0D\x0A|[\x0A-\x0D\x{85}\x{2028}\x{2029}]) */
5807 Node* left = NULL;
5808 Node* right = NULL;
5809 Node* target1 = NULL;
5810 Node* target2 = NULL;
5811 CClassNode* cc;
5812 int num1, num2, r;
5813 UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN * 2];
5814
5815 /* \x0D\x0A */
5816 num1 = ONIGENC_CODE_TO_MBC(env->enc, 0x0D, buf);
5817 if (num1 < 0) return num1;
5818 num2 = ONIGENC_CODE_TO_MBC(env->enc, 0x0A, buf + num1);
5819 if (num2 < 0) return num2;
5820 left = node_new_str_raw(buf, buf + num1 + num2);
5821 if (IS_NULL(left)) goto err;
5822
5823 /* [\x0A-\x0D] or [\x0A-\x0D\x{85}\x{2028}\x{2029}] */
5824 right = node_new_cclass();
5825 if (IS_NULL(right)) goto err;
5826 cc = NCCLASS(right);
5827 if (ONIGENC_MBC_MINLEN(env->enc) > 1) {
5828 r = add_code_range(&(cc->mbuf), env, 0x0A, 0x0D);
5829 if (r != 0) goto err;
5830 }
5831 else {
5832 bitset_set_range(env, cc->bs, 0x0A, 0x0D);
5833 }
5834
5835 /* TODO: move this block to enc/unicode.c */
5836 if (ONIGENC_IS_UNICODE(env->enc)) {
5837 /* UTF-8, UTF-16BE/LE, UTF-32BE/LE */
5838 r = add_code_range(&(cc->mbuf), env, 0x85, 0x85);
5839 if (r != 0) goto err;
5840 r = add_code_range(&(cc->mbuf), env, 0x2028, 0x2029);
5841 if (r != 0) goto err;
5842 }
5843
5844 /* ...|... */
5845 target1 = onig_node_new_alt(right, NULL_NODE);
5846 if (IS_NULL(target1)) goto err;
5847 right = NULL;
5848 target2 = onig_node_new_alt(left, target1);
5849 if (IS_NULL(target2)) goto err;
5850 left = NULL;
5851 target1 = NULL;
5852
5853 /* (?>...) */
5854 *np = node_new_enclose(ENCLOSE_STOP_BACKTRACK);
5855 if (IS_NULL(*np)) goto err;
5856 NENCLOSE(*np)->target = target2;
5857 return ONIG_NORMAL;
5858
5859 err:
5860 onig_node_free(left);
5861 onig_node_free(right);
5862 onig_node_free(target1);
5863 onig_node_free(target2);
5864 return ONIGERR_MEMORY;
5865}
5866
5867static int
5868propname2ctype(ScanEnv* env, const char* propname)
5869{
5870 UChar* name = (UChar* )propname;
5871 UChar* name_end = name + strlen(propname);
5872 int ctype = env->enc->property_name_to_ctype(ONIG_ENCODING_ASCII,
5873 name, name_end);
5874 if (ctype < 0) {
5875 onig_scan_env_set_error_string(env, ctype, name, name_end);
5876 }
5877 return ctype;
5878}
5879
5880static int
5881add_property_to_cc(CClassNode* cc, const char* propname, int not, ScanEnv* env)
5882{
5883 int ctype = propname2ctype(env, propname);
5884 if (ctype < 0) return ctype;
5885 return add_ctype_to_cc(cc, ctype, not, 0, env);
5886}
5887
5888/*
5889 * helper methods for node_extended_grapheme_cluster (/\X/)
5890 */
5891static int
5892create_property_node(Node **np, ScanEnv* env, const char* propname)
5893{
5894 int r;
5895 CClassNode* cc;
5896
5897 *np = node_new_cclass();
5898 if (IS_NULL(*np)) return ONIGERR_MEMORY;
5899 cc = NCCLASS(*np);
5900 r = add_property_to_cc(cc, propname, 0, env);
5901 if (r != 0)
5902 onig_node_free(*np);
5903 return r;
5904}
5905
5906static int
5907quantify_node(Node **np, int lower, int upper)
5908{
5909 Node* tmp = node_new_quantifier(lower, upper, 0);
5910 if (IS_NULL(tmp)) return ONIGERR_MEMORY;
5911 NQTFR(tmp)->target = *np;
5912 *np = tmp;
5913 return 0;
5914}
5915
5916static int
5917quantify_property_node(Node **np, ScanEnv* env, const char* propname, char repetitions)
5918{
5919 int r;
5920 int lower = 0;
5921 int upper = REPEAT_INFINITE;
5922
5923 r = create_property_node(np, env, propname);
5924 if (r != 0) return r;
5925 switch (repetitions) {
5926 case '?': upper = 1; break;
5927 case '+': lower = 1; break;
5928 case '*': break;
5929 case '2': lower = upper = 2; break;
5930 default : return ONIGERR_PARSER_BUG;
5931 }
5932 return quantify_node(np, lower, upper);
5933}
5934
5935#define LIST 0
5936#define ALT 1
5937
5938/* IMPORTANT: Make sure node_array ends with NULL_NODE */
5939static int
5940create_node_from_array(int kind, Node **np, Node **node_array)
5941{
5942 Node* tmp = NULL_NODE;
5943 int i = 0;
5944
5945 while (node_array[i] != NULL_NODE) i++;
5946 while (--i >= 0) {
5947 *np = kind==LIST ? node_new_list(node_array[i], tmp)
5948 : onig_node_new_alt(node_array[i], tmp);
5949 if (IS_NULL(*np)) {
5950 while (i >= 0) {
5951 onig_node_free(node_array[i]);
5952 node_array[i--] = NULL_NODE;
5953 }
5954 onig_node_free(tmp);
5955 return ONIGERR_MEMORY;
5956 }
5957 else
5958 node_array[i] = NULL_NODE;
5959 tmp = *np;
5960 }
5961 return 0;
5962}
5963
5964#define R_ERR(call) r=(call);if(r!=0)goto err
5965
5966/* Memory layout for common node array:
5967 * The main purpose is to be able to easily free all leftover nodes
5968 * after an error. As a side effect, we share some memory.
5969 *
5970 * The layout is as shown below (each line corresponds to one call of
5971 * create_node_from_array()). Because create_node_from_array sets all
5972 * nodes of the source to NULL_NODE, we can overlap the target array
5973 * as long as we do not override the actual target location.
5974 *
5975 * Target Array name Index
5976 *
5977 * node_array 0 1 2 3 4 5 6 7 8 9 A B C D E F G H
5978 * top_alts alts[5] 0 1 2 3 4*
5979 * alts+2 list[4] 0 1 2 3*
5980 * list+1 core_alts[8] 0 1 2 3 4 5 6 7*
5981 * core_alts+0 H_list[4] 0 1 2 3*
5982 * H_list+1 H_alt2[4] 0 1 2 3*
5983 * H_alt2+1 H_list2[3] 0 1 2*
5984 * core_alts+4 XP_list[3] 0 1 2*
5985 * XP_list+1 Ex_list[4] 0 1 2 3*
5986 * core_alts+5 CC_list[3] 0 1 2*
5987 * CC_list+1 CC_inner_list[5] 0 1 2 3 4*
5988 */
5989#define NODE_COMMON_SIZE 18
5990
5991static int
5992node_extended_grapheme_cluster(Node** np, ScanEnv* env)
5993{
5994 Node* tmp = NULL;
5995 Node* np1 = NULL;
5996 Node* top_alt = NULL;
5997 int r = 0;
5998 int num1;
5999 int i;
6000 int any_target_position;
6001 UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN * 2];
6002 OnigOptionType option;
6003 /* node_common is function-global so that we can free all nodes
6004 * in case of error. Unused slots are set to NULL_NODE at all times. */
6005 Node *node_common[NODE_COMMON_SIZE];
6006 Node **alts = node_common+0; /* size: 5 */
6007
6008 for (i=0; i<NODE_COMMON_SIZE; i++)
6009 node_common[i] = NULL_NODE;
6010
6011 /* CRLF, common for both Unicode and non-Unicode */
6012 /* \x0D\x0A */
6013 r = ONIGENC_CODE_TO_MBC(env->enc, 0x0D, buf);
6014 if (r < 0) goto err;
6015 num1 = r;
6016 r = ONIGENC_CODE_TO_MBC(env->enc, 0x0A, buf + num1);
6017 if (r < 0) goto err;
6018 alts[0] = node_new_str_raw(buf, buf + num1 + r);
6019 if (IS_NULL(alts[0])) goto err;
6020
6021#ifdef USE_UNICODE_PROPERTIES
6022 if (ONIGENC_IS_UNICODE(env->enc)) { /* UTF-8, UTF-16BE/LE, UTF-32BE/LE */
6023 CClassNode* cc;
6024
6025 if (propname2ctype(env, "Grapheme_Cluster_Break=Extend") < 0) goto err;
6026 /* Unicode 11.0.0
6027 * CRLF (already done)
6028 * | [Control CR LF]
6029 * | precore* core postcore*
6030 * | . (to catch invalid stuff, because this seems to be spec for String#grapheme_clusters) */
6031
6032 /* [Control CR LF] (CR and LF are not in the spec, but this is a conformed fix) */
6033 alts[1] = node_new_cclass();
6034 if (IS_NULL(alts[1])) goto err;
6035 cc = NCCLASS(alts[1]);
6036 R_ERR(add_property_to_cc(cc, "Grapheme_Cluster_Break=Control", 0, env));
6037 if (ONIGENC_MBC_MINLEN(env->enc) > 1) { /* UTF-16/UTF-32 */
6038 R_ERR(add_code_range(&(cc->mbuf), env, 0x000A, 0x000A)); /* CR */
6039 R_ERR(add_code_range(&(cc->mbuf), env, 0x000D, 0x000D)); /* LF */
6040 }
6041 else {
6042 BITSET_SET_BIT(cc->bs, 0x0a);
6043 BITSET_SET_BIT(cc->bs, 0x0d);
6044 }
6045
6046 /* precore* core postcore* */
6047 {
6048 Node **list = alts + 3; /* size: 4 */
6049
6050 /* precore*; precore := Prepend */
6051 R_ERR(quantify_property_node(list+0, env, "Grapheme_Cluster_Break=Prepend", '*'));
6052
6053 /* core := hangul-syllable
6054 * | ri-sequence
6055 * | xpicto-sequence
6056 * | conjunctCluster
6057 * | [^Control CR LF] */
6058 {
6059 Node **core_alts = list + 2; /* size: 8 */
6060
6061 /* hangul-syllable :=
6062 * L* (V+ | LV V* | LVT) T*
6063 * | L+
6064 * | T+ */
6065 /* hangul-syllable is an alternative (would be called H_alt)
6066 * inside an alternative, but we flatten it into core_alts */
6067
6068 /* L* (V+ | LV V* | LVT) T* */
6069 {
6070 Node **H_list = core_alts + 1; /* size: 4 */
6071 R_ERR(quantify_property_node(H_list+0, env, "Grapheme_Cluster_Break=L", '*'));
6072
6073 /* V+ | LV V* | LVT */
6074 {
6075 Node **H_alt2 = H_list + 2; /* size: 4 */
6076 R_ERR(quantify_property_node(H_alt2+0, env, "Grapheme_Cluster_Break=V", '+'));
6077
6078 /* LV V* */
6079 {
6080 Node **H_list2 = H_alt2 + 2; /* size: 3 */
6081
6082 R_ERR(create_property_node(H_list2+0, env, "Grapheme_Cluster_Break=LV"));
6083 R_ERR(quantify_property_node(H_list2+1, env, "Grapheme_Cluster_Break=V", '*'));
6084 R_ERR(create_node_from_array(LIST, H_alt2+1, H_list2));
6085 }
6086
6087 R_ERR(create_property_node(H_alt2+2, env, "Grapheme_Cluster_Break=LVT"));
6088 R_ERR(create_node_from_array(ALT, H_list+1, H_alt2));
6089 }
6090
6091 R_ERR(quantify_property_node(H_list+2, env, "Grapheme_Cluster_Break=T", '*'));
6092 R_ERR(create_node_from_array(LIST, core_alts+0, H_list));
6093 }
6094
6095 R_ERR(quantify_property_node(core_alts+1, env, "Grapheme_Cluster_Break=L", '+'));
6096 R_ERR(quantify_property_node(core_alts+2, env, "Grapheme_Cluster_Break=T", '+'));
6097 /* end of hangul-syllable */
6098
6099 /* ri-sequence := RI RI */
6100 R_ERR(quantify_property_node(core_alts+3, env, "Regional_Indicator", '2'));
6101
6102 /* xpicto-sequence := \p{Extended_Pictographic} (Extend* ZWJ \p{Extended_Pictographic})* */
6103 {
6104 Node **XP_list = core_alts + 5; /* size: 3 */
6105 R_ERR(create_property_node(XP_list+0, env, "Extended_Pictographic"));
6106
6107 /* (Extend* ZWJ \p{Extended_Pictographic})* */
6108 {
6109 Node **Ex_list = XP_list + 2; /* size: 4 */
6110 /* assert(Ex_list+4 == node_common+NODE_COMMON_SIZE); */
6111 R_ERR(quantify_property_node(Ex_list+0, env, "Grapheme_Cluster_Break=Extend", '*'));
6112
6113 /* ZWJ (ZERO WIDTH JOINER) */
6114 r = ONIGENC_CODE_TO_MBC(env->enc, 0x200D, buf);
6115 if (r < 0) goto err;
6116 Ex_list[1] = node_new_str_raw(buf, buf + r);
6117 if (IS_NULL(Ex_list[1])) goto err;
6118
6119 R_ERR(create_property_node(Ex_list+2, env, "Extended_Pictographic"));
6120 R_ERR(create_node_from_array(LIST, XP_list+1, Ex_list));
6121 }
6122 R_ERR(quantify_node(XP_list+1, 0, REPEAT_INFINITE)); /* TODO: Check about node freeing */
6123
6124 R_ERR(create_node_from_array(LIST, core_alts+4, XP_list));
6125 }
6126
6127 /* conjunctCluster := \p{InCB=Consonant} ([\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Linker} [\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Consonant})+ */
6128 {
6129 // \p{InCB=Consonant}
6130 Node **CC_list = core_alts + 6; /* size: 3 */
6131 R_ERR(create_property_node(CC_list+0, env, "InCB=Consonant"));
6132
6133 {
6134 Node **CC_inner_list = CC_list + 2; /* size: 5 */
6135 {
6136 // [\p{InCB=Extend} \p{InCB=Linker}]*
6137 R_ERR(create_property_node(CC_inner_list+0, env, "InCB=Extend"));
6138 R_ERR(add_property_to_cc(NCCLASS(CC_inner_list[0]), "InCB=Linker", 0, env));
6139 R_ERR(quantify_node(CC_inner_list+0, 0, REPEAT_INFINITE));
6140 }
6141
6142 // \p{InCB=Linker}
6143 R_ERR(create_property_node(CC_inner_list+1, env, "InCB=Linker"));
6144
6145 {
6146 // [\p{InCB=Extend} \p{InCB=Linker}]*
6147 R_ERR(create_property_node(CC_inner_list+2, env, "InCB=Extend"));
6148 R_ERR(add_property_to_cc(NCCLASS(CC_inner_list[2]), "InCB=Linker", 0, env));
6149 R_ERR(quantify_node(CC_inner_list+2, 0, REPEAT_INFINITE));
6150 }
6151
6152 // \p{InCB=Consonant}
6153 R_ERR(create_property_node(CC_inner_list+3, env, "InCB=Consonant"));
6154
6155 // ([\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Linker} [\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Consonant})
6156 R_ERR(create_node_from_array(LIST, CC_list+1, CC_inner_list));
6157
6158 // (...)+
6159 R_ERR(quantify_node(CC_list+1, 1, REPEAT_INFINITE));
6160 }
6161
6162 // \p{InCB=Consonant} ([\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Linker} [\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Consonant})+
6163 R_ERR(create_node_from_array(LIST, core_alts+5, CC_list));
6164 }
6165
6166 /* [^Control CR LF] */
6167 core_alts[6] = node_new_cclass();
6168 if (IS_NULL(core_alts[6])) goto err;
6169 cc = NCCLASS(core_alts[6]);
6170 if (ONIGENC_MBC_MINLEN(env->enc) > 1) { /* UTF-16/UTF-32 */
6171 BBuf *inverted_buf = NULL;
6172
6173 /* TODO: fix false warning */
6174 const int dup_not_warned = env->warnings_flag | ~ONIG_SYN_WARN_CC_DUP;
6175 env->warnings_flag |= ONIG_SYN_WARN_CC_DUP;
6176
6177 /* Start with a positive buffer and invert at the end.
6178 * Otherwise, adding single-character ranges work the wrong way. */
6179 R_ERR(add_property_to_cc(cc, "Grapheme_Cluster_Break=Control", 0, env));
6180 R_ERR(add_code_range(&(cc->mbuf), env, 0x000A, 0x000A)); /* CR */
6181 R_ERR(add_code_range(&(cc->mbuf), env, 0x000D, 0x000D)); /* LF */
6182 R_ERR(not_code_range_buf(env->enc, cc->mbuf, &inverted_buf, env));
6183 bbuf_free(cc->mbuf);
6184 cc->mbuf = inverted_buf;
6185
6186 env->warnings_flag &= dup_not_warned; /* TODO: fix false warning */
6187 }
6188 else {
6189 R_ERR(add_property_to_cc(cc, "Grapheme_Cluster_Break=Control", 1, env));
6190 BITSET_CLEAR_BIT(cc->bs, 0x0a);
6191 BITSET_CLEAR_BIT(cc->bs, 0x0d);
6192 }
6193
6194 R_ERR(create_node_from_array(ALT, list+1, core_alts));
6195 }
6196
6197 /* postcore*; postcore = [Extend ZWJ SpacingMark] */
6198 R_ERR(create_property_node(list+2, env, "Grapheme_Cluster_Break=Extend"));
6199 cc = NCCLASS(list[2]);
6200 R_ERR(add_property_to_cc(cc, "Grapheme_Cluster_Break=SpacingMark", 0, env));
6201 R_ERR(add_code_range(&(cc->mbuf), env, 0x200D, 0x200D));
6202 R_ERR(quantify_node(list+2, 0, REPEAT_INFINITE));
6203
6204 R_ERR(create_node_from_array(LIST, alts+2, list));
6205 }
6206
6207 any_target_position = 3;
6208 }
6209 else
6210#endif /* USE_UNICODE_PROPERTIES */
6211 {
6212 any_target_position = 1;
6213 }
6214
6215 /* PerlSyntax: (?s:.), RubySyntax: (?m:.), common for both Unicode and non-Unicode */
6216 /* Not in Unicode spec (UAX #29), but added to catch invalid stuff,
6217 * because this is Ruby spec for String#grapheme_clusters. */
6218 np1 = node_new_anychar();
6219 if (IS_NULL(np1)) goto err;
6220
6221 option = env->option;
6222 ONOFF(option, ONIG_OPTION_MULTILINE, 0);
6223 tmp = node_new_option(option);
6224 if (IS_NULL(tmp)) goto err;
6225 NENCLOSE(tmp)->target = np1;
6226 alts[any_target_position] = tmp;
6227 np1 = NULL;
6228
6229 R_ERR(create_node_from_array(ALT, &top_alt, alts));
6230
6231 /* (?>): For efficiency, because there is no text piece
6232 * that is not in a grapheme cluster, and there is only one way
6233 * to split a string into grapheme clusters. */
6234 tmp = node_new_enclose(ENCLOSE_STOP_BACKTRACK);
6235 if (IS_NULL(tmp)) goto err;
6236 NENCLOSE(tmp)->target = top_alt;
6237 np1 = tmp;
6238
6239#ifdef USE_UNICODE_PROPERTIES
6240 if (ONIGENC_IS_UNICODE(env->enc)) {
6241 /* Don't ignore case. */
6242 option = env->option;
6243 ONOFF(option, ONIG_OPTION_IGNORECASE, 1);
6244 *np = node_new_option(option);
6245 if (IS_NULL(*np)) goto err;
6246 NENCLOSE(*np)->target = np1;
6247 }
6248 else
6249#endif
6250 {
6251 *np = np1;
6252 }
6253 return ONIG_NORMAL;
6254
6255 err:
6256 onig_node_free(np1);
6257 for (i=0; i<NODE_COMMON_SIZE; i++)
6258 onig_node_free(node_common[i]);
6259 return (r == 0) ? ONIGERR_MEMORY : r;
6260}
6261#undef R_ERR
6262
6263static int
6264countbits(unsigned int bits)
6265{
6266 bits = (bits & 0x55555555) + ((bits >> 1) & 0x55555555);
6267 bits = (bits & 0x33333333) + ((bits >> 2) & 0x33333333);
6268 bits = (bits & 0x0f0f0f0f) + ((bits >> 4) & 0x0f0f0f0f);
6269 bits = (bits & 0x00ff00ff) + ((bits >> 8) & 0x00ff00ff);
6270 return (bits & 0x0000ffff) + ((bits >>16) & 0x0000ffff);
6271}
6272
6273static int
6274is_onechar_cclass(CClassNode* cc, OnigCodePoint* code)
6275{
6276 const OnigCodePoint not_found = ONIG_LAST_CODE_POINT;
6277 OnigCodePoint c = not_found;
6278 int i;
6279 BBuf *bbuf = cc->mbuf;
6280
6281 if (IS_NCCLASS_NOT(cc)) return 0;
6282
6283 /* check bbuf */
6284 if (IS_NOT_NULL(bbuf)) {
6285 OnigCodePoint n, *data;
6286 GET_CODE_POINT(n, bbuf->p);
6287 data = (OnigCodePoint* )(bbuf->p) + 1;
6288 if ((n == 1) && (data[0] == data[1])) {
6289 /* only one char found in the bbuf, save the code point. */
6290 c = data[0];
6291 if (((c < SINGLE_BYTE_SIZE) && BITSET_AT(cc->bs, c))) {
6292 /* skip if c is included in the bitset */
6293 c = not_found;
6294 }
6295 }
6296 else {
6297 return 0; /* the bbuf contains multiple chars */
6298 }
6299 }
6300
6301 /* check bitset */
6302 for (i = 0; i < BITSET_SIZE; i++) {
6303 Bits b1 = cc->bs[i];
6304 if (b1 != 0) {
6305 if (((b1 & (b1 - 1)) == 0) && (c == not_found)) {
6306 c = BITS_IN_ROOM * i + countbits(b1 - 1);
6307 }
6308 else {
6309 return 0; /* the character class contains multiple chars */
6310 }
6311 }
6312 }
6313
6314 if (c != not_found) {
6315 *code = c;
6316 return 1;
6317 }
6318
6319 /* the character class contains no char. */
6320 return 0;
6321}
6322
6323
6324static int
6325parse_exp(Node** np, OnigToken* tok, int term,
6326 UChar** src, UChar* end, ScanEnv* env)
6327{
6328 int r, len, group = 0;
6329 Node* qn;
6330 Node** targetp;
6331 unsigned int parse_depth;
6332
6333 *np = NULL;
6334 if (tok->type == (enum TokenSyms )term)
6335 goto end_of_token;
6336
6337 parse_depth = env->parse_depth;
6338
6339 switch (tok->type) {
6340 case TK_ALT:
6341 case TK_EOT:
6342 end_of_token:
6343 *np = node_new_empty();
6344 return tok->type;
6345 break;
6346
6347 case TK_SUBEXP_OPEN:
6348 r = parse_enclose(np, tok, TK_SUBEXP_CLOSE, src, end, env);
6349 if (r < 0) return r;
6350 if (r == 1) group = 1;
6351 else if (r == 2) { /* option only */
6352 Node* target;
6353 OnigOptionType prev = env->option;
6354
6355 env->option = NENCLOSE(*np)->option;
6356 r = fetch_token(tok, src, end, env);
6357 if (r < 0) {
6358 env->option = prev;
6359 return r;
6360 }
6361 r = parse_subexp(&target, tok, term, src, end, env);
6362 env->option = prev;
6363 if (r < 0) {
6364 onig_node_free(target);
6365 return r;
6366 }
6367 NENCLOSE(*np)->target = target;
6368 return tok->type;
6369 }
6370 break;
6371
6372 case TK_SUBEXP_CLOSE:
6373 if (! IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_UNMATCHED_CLOSE_SUBEXP))
6374 return ONIGERR_UNMATCHED_CLOSE_PARENTHESIS;
6375
6376 if (tok->escaped) goto tk_raw_byte;
6377 else goto tk_byte;
6378 break;
6379
6380 case TK_LINEBREAK:
6381 r = node_linebreak(np, env);
6382 if (r < 0) return r;
6383 break;
6384
6385 case TK_EXTENDED_GRAPHEME_CLUSTER:
6386 r = node_extended_grapheme_cluster(np, env);
6387 if (r < 0) return r;
6388 break;
6389
6390 case TK_KEEP:
6391 *np = onig_node_new_anchor(ANCHOR_KEEP);
6392 CHECK_NULL_RETURN_MEMERR(*np);
6393 break;
6394
6395 case TK_STRING:
6396 tk_byte:
6397 {
6398 *np = node_new_str(tok->backp, *src);
6399 CHECK_NULL_RETURN_MEMERR(*np);
6400
6401 string_loop:
6402 while (1) {
6403 r = fetch_token(tok, src, end, env);
6404 if (r < 0) return r;
6405 if (r == TK_STRING) {
6406 r = onig_node_str_cat(*np, tok->backp, *src);
6407 }
6408#ifndef NUMBERED_CHAR_IS_NOT_CASE_AMBIG
6409 else if (r == TK_CODE_POINT) {
6410 r = check_code_point(tok->u.code, env->enc);
6411 if (r != 0) return r;
6412 r = node_str_cat_codepoint(*np, env->enc, tok->u.code);
6413 }
6414#endif
6415 else {
6416 break;
6417 }
6418 if (r < 0) return r;
6419 }
6420
6421 string_end:
6422 targetp = np;
6423 goto repeat;
6424 }
6425 break;
6426
6427 case TK_RAW_BYTE:
6428 tk_raw_byte:
6429 {
6430 *np = node_new_str_raw_char((UChar )tok->u.c);
6431 CHECK_NULL_RETURN_MEMERR(*np);
6432 len = 1;
6433 while (1) {
6434 if (len >= ONIGENC_MBC_MINLEN(env->enc)) {
6435 int n = ONIGENC_IS_SINGLEBYTE(env->enc) ? 1 :
6436 ONIGENC_PRECISE_MBC_ENC_LEN(env->enc, NSTR(*np)->s, NSTR(*np)->end);
6437 if (n == len) {
6438 r = fetch_token(tok, src, end, env);
6439 NSTRING_CLEAR_RAW(*np);
6440 goto string_end;
6441 }
6442 if (! ONIGENC_MBCLEN_NEEDMORE_P(n))
6443 return ONIGERR_INVALID_CODE_POINT_VALUE;
6444 }
6445
6446 r = fetch_token(tok, src, end, env);
6447 if (r < 0) return r;
6448 if (r != TK_RAW_BYTE) {
6449 /* Don't use this, it is wrong for little endian encodings. */
6450#ifdef USE_PAD_TO_SHORT_BYTE_CHAR
6451 int rem;
6452 if (len < ONIGENC_MBC_MINLEN(env->enc)) {
6453 rem = ONIGENC_MBC_MINLEN(env->enc) - len;
6454 (void )node_str_head_pad(NSTR(*np), rem, (UChar )0);
6455 if (len + rem == enclen(env->enc, NSTR(*np)->s)) {
6456 NSTRING_CLEAR_RAW(*np);
6457 goto string_end;
6458 }
6459 }
6460#endif
6461 return ONIGERR_TOO_SHORT_MULTI_BYTE_STRING;
6462 }
6463
6464 r = node_str_cat_char(*np, (UChar )tok->u.c);
6465 if (r < 0) return r;
6466
6467 len++;
6468 }
6469 }
6470 break;
6471
6472 case TK_CODE_POINT:
6473 {
6474 r = check_code_point(tok->u.code, env->enc);
6475 if (r != 0) return r;
6476 *np = node_new_empty();
6477 CHECK_NULL_RETURN_MEMERR(*np);
6478 r = node_str_cat_codepoint(*np, env->enc, tok->u.code);
6479 if (r != 0) return r;
6480#ifdef NUMBERED_CHAR_IS_NOT_CASE_AMBIG
6481 NSTRING_SET_RAW(*np);
6482#else
6483 goto string_loop;
6484#endif
6485 }
6486 break;
6487
6488 case TK_QUOTE_OPEN:
6489 {
6490 OnigCodePoint end_op[2];
6491 UChar *qstart, *qend, *nextp;
6492
6493 end_op[0] = (OnigCodePoint )MC_ESC(env->syntax);
6494 end_op[1] = (OnigCodePoint )'E';
6495 qstart = *src;
6496 qend = find_str_position(end_op, 2, qstart, end, &nextp, env->enc);
6497 if (IS_NULL(qend)) {
6498 nextp = qend = end;
6499 }
6500 *np = node_new_str(qstart, qend);
6501 CHECK_NULL_RETURN_MEMERR(*np);
6502 *src = nextp;
6503 }
6504 break;
6505
6506 case TK_CHAR_TYPE:
6507 {
6508 switch (tok->u.prop.ctype) {
6509 case ONIGENC_CTYPE_WORD:
6510 *np = node_new_ctype(tok->u.prop.ctype, tok->u.prop.not,
6511 IS_ASCII_RANGE(env->option));
6512 CHECK_NULL_RETURN_MEMERR(*np);
6513 break;
6514
6515 case ONIGENC_CTYPE_SPACE:
6516 case ONIGENC_CTYPE_DIGIT:
6517 case ONIGENC_CTYPE_XDIGIT:
6518 {
6519 CClassNode* cc;
6520
6521 *np = node_new_cclass();
6522 CHECK_NULL_RETURN_MEMERR(*np);
6523 cc = NCCLASS(*np);
6524 r = add_ctype_to_cc(cc, tok->u.prop.ctype, 0,
6525 IS_ASCII_RANGE(env->option), env);
6526 if (r != 0) return r;
6527 if (tok->u.prop.not != 0) NCCLASS_SET_NOT(cc);
6528 }
6529 break;
6530
6531 default:
6532 return ONIGERR_PARSER_BUG;
6533 break;
6534 }
6535 }
6536 break;
6537
6538 case TK_CHAR_PROPERTY:
6539 r = parse_char_property(np, tok, src, end, env);
6540 if (r != 0) return r;
6541 break;
6542
6543 case TK_CC_OPEN:
6544 {
6545 Node *asc_node;
6546 CClassNode* cc;
6547 OnigCodePoint code;
6548
6549 r = parse_char_class(np, &asc_node, tok, src, end, env);
6550 if (r != 0) {
6551 onig_node_free(asc_node);
6552 return r;
6553 }
6554
6555 cc = NCCLASS(*np);
6556 if (is_onechar_cclass(cc, &code)) {
6557 onig_node_free(*np);
6558 onig_node_free(asc_node);
6559 *np = node_new_empty();
6560 CHECK_NULL_RETURN_MEMERR(*np);
6561 r = node_str_cat_codepoint(*np, env->enc, code);
6562 if (r != 0) return r;
6563 goto string_loop;
6564 }
6565 if (IS_IGNORECASE(env->option)) {
6566 r = cclass_case_fold(np, cc, NCCLASS(asc_node), env);
6567 if (r != 0) {
6568 onig_node_free(asc_node);
6569 return r;
6570 }
6571 }
6572 onig_node_free(asc_node);
6573 }
6574 break;
6575
6576 case TK_ANYCHAR:
6577 *np = node_new_anychar();
6578 CHECK_NULL_RETURN_MEMERR(*np);
6579 break;
6580
6581 case TK_ANYCHAR_ANYTIME:
6582 *np = node_new_anychar();
6583 CHECK_NULL_RETURN_MEMERR(*np);
6584 qn = node_new_quantifier(0, REPEAT_INFINITE, 0);
6585 CHECK_NULL_RETURN_MEMERR(qn);
6586 NQTFR(qn)->target = *np;
6587 *np = qn;
6588 break;
6589
6590 case TK_BACKREF:
6591 len = tok->u.backref.num;
6592 *np = node_new_backref(len,
6593 (len > 1 ? tok->u.backref.refs : &(tok->u.backref.ref1)),
6594 tok->u.backref.by_name,
6595#ifdef USE_BACKREF_WITH_LEVEL
6596 tok->u.backref.exist_level,
6597 tok->u.backref.level,
6598#endif
6599 env);
6600 CHECK_NULL_RETURN_MEMERR(*np);
6601 break;
6602
6603#ifdef USE_SUBEXP_CALL
6604 case TK_CALL:
6605 {
6606 int gnum = tok->u.call.gnum;
6607
6608 if (gnum < 0 || tok->u.call.rel != 0) {
6609 if (gnum > 0) gnum--;
6610 gnum = BACKREF_REL_TO_ABS(gnum, env);
6611 if (gnum <= 0)
6612 return ONIGERR_INVALID_BACKREF;
6613 }
6614 *np = node_new_call(tok->u.call.name, tok->u.call.name_end, gnum);
6615 CHECK_NULL_RETURN_MEMERR(*np);
6616 env->num_call++;
6617 }
6618 break;
6619#endif
6620
6621 case TK_ANCHOR:
6622 *np = onig_node_new_anchor(tok->u.anchor.subtype);
6623 CHECK_NULL_RETURN_MEMERR(*np);
6624 NANCHOR(*np)->ascii_range = tok->u.anchor.ascii_range;
6625 break;
6626
6627 case TK_OP_REPEAT:
6628 case TK_INTERVAL:
6629 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_CONTEXT_INDEP_REPEAT_OPS)) {
6630 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_CONTEXT_INVALID_REPEAT_OPS))
6631 return ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED;
6632 else
6633 *np = node_new_empty();
6634 }
6635 else {
6636 goto tk_byte;
6637 }
6638 break;
6639
6640 default:
6641 return ONIGERR_PARSER_BUG;
6642 break;
6643 }
6644
6645 {
6646 targetp = np;
6647
6648 re_entry:
6649 r = fetch_token(tok, src, end, env);
6650 if (r < 0) return r;
6651
6652 repeat:
6653 if (r == TK_OP_REPEAT || r == TK_INTERVAL) {
6654 if (is_invalid_quantifier_target(*targetp))
6655 return ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID;
6656
6657 parse_depth++;
6658 if (parse_depth > ParseDepthLimit)
6659 return ONIGERR_PARSE_DEPTH_LIMIT_OVER;
6660
6661 qn = node_new_quantifier(tok->u.repeat.lower, tok->u.repeat.upper,
6662 (r == TK_INTERVAL ? 1 : 0));
6663 CHECK_NULL_RETURN_MEMERR(qn);
6664 NQTFR(qn)->greedy = tok->u.repeat.greedy;
6665 r = set_quantifier(qn, *targetp, group, env);
6666 if (r < 0) {
6667 onig_node_free(qn);
6668 return r;
6669 }
6670
6671 if (tok->u.repeat.possessive != 0) {
6672 Node* en;
6673 en = node_new_enclose(ENCLOSE_STOP_BACKTRACK);
6674 if (IS_NULL(en)) {
6675 onig_node_free(qn);
6676 return ONIGERR_MEMORY;
6677 }
6678 NENCLOSE(en)->target = qn;
6679 qn = en;
6680 }
6681
6682 if (r == 0) {
6683 *targetp = qn;
6684 }
6685 else if (r == 1) {
6686 onig_node_free(qn);
6687 }
6688 else if (r == 2) { /* split case: /abc+/ */
6689 Node *tmp;
6690
6691 *targetp = node_new_list(*targetp, NULL);
6692 if (IS_NULL(*targetp)) {
6693 onig_node_free(qn);
6694 return ONIGERR_MEMORY;
6695 }
6696 tmp = NCDR(*targetp) = node_new_list(qn, NULL);
6697 if (IS_NULL(tmp)) {
6698 onig_node_free(qn);
6699 return ONIGERR_MEMORY;
6700 }
6701 targetp = &(NCAR(tmp));
6702 }
6703 goto re_entry;
6704 }
6705 }
6706
6707 return r;
6708}
6709
6710static int
6711parse_branch(Node** top, OnigToken* tok, int term,
6712 UChar** src, UChar* end, ScanEnv* env)
6713{
6714 int r;
6715 Node *node, **headp;
6716
6717 *top = NULL;
6718 r = parse_exp(&node, tok, term, src, end, env);
6719 if (r < 0) {
6720 onig_node_free(node);
6721 return r;
6722 }
6723
6724 if (r == TK_EOT || r == term || r == TK_ALT) {
6725 *top = node;
6726 }
6727 else {
6728 *top = node_new_list(node, NULL);
6729 headp = &(NCDR(*top));
6730 while (r != TK_EOT && r != term && r != TK_ALT) {
6731 r = parse_exp(&node, tok, term, src, end, env);
6732 if (r < 0) {
6733 onig_node_free(node);
6734 return r;
6735 }
6736
6737 if (NTYPE(node) == NT_LIST) {
6738 *headp = node;
6739 while (IS_NOT_NULL(NCDR(node))) node = NCDR(node);
6740 headp = &(NCDR(node));
6741 }
6742 else {
6743 *headp = node_new_list(node, NULL);
6744 headp = &(NCDR(*headp));
6745 }
6746 }
6747 }
6748
6749 return r;
6750}
6751
6752/* term_tok: TK_EOT or TK_SUBEXP_CLOSE */
6753static int
6754parse_subexp(Node** top, OnigToken* tok, int term,
6755 UChar** src, UChar* end, ScanEnv* env)
6756{
6757 int r;
6758 Node *node, *topnode, **headp;
6759
6760 *top = NULL;
6761 env->parse_depth++;
6762 if (env->parse_depth > ParseDepthLimit)
6763 return ONIGERR_PARSE_DEPTH_LIMIT_OVER;
6764 r = parse_branch(&node, tok, term, src, end, env);
6765 if (r < 0) {
6766 onig_node_free(node);
6767 return r;
6768 }
6769
6770 if (r == term) {
6771 *top = node;
6772 }
6773 else if (r == TK_ALT) {
6774 topnode = onig_node_new_alt(node, NULL);
6775 headp = &(NCDR(topnode));
6776 while (r == TK_ALT) {
6777 r = fetch_token(tok, src, end, env);
6778 if (r < 0) {
6779 onig_node_free(topnode);
6780 return r;
6781 }
6782 r = parse_branch(&node, tok, term, src, end, env);
6783 if (r < 0) {
6784 /* the failed branch is not linked into topnode yet: free both */
6785 onig_node_free(node);
6786 onig_node_free(topnode);
6787 return r;
6788 }
6789
6790 *headp = onig_node_new_alt(node, NULL);
6791 headp = &(NCDR(*headp));
6792 }
6793
6794 if (tok->type != (enum TokenSyms )term) {
6795 onig_node_free(topnode);
6796 goto err;
6797 }
6798 *top = topnode;
6799 }
6800 else {
6801 onig_node_free(node);
6802 err:
6803 if (term == TK_SUBEXP_CLOSE)
6804 return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS;
6805 else
6806 return ONIGERR_PARSER_BUG;
6807 }
6808
6809 env->parse_depth--;
6810 return r;
6811}
6812
6813static int
6814parse_regexp(Node** top, UChar** src, UChar* end, ScanEnv* env)
6815{
6816 int r;
6817 OnigToken tok;
6818
6819 r = fetch_token(&tok, src, end, env);
6820 if (r < 0) return r;
6821 r = parse_subexp(top, &tok, TK_EOT, src, end, env);
6822 if (r < 0) return r;
6823
6824#ifdef USE_SUBEXP_CALL
6825 if (env->num_call > 0) {
6826 /* Capture the pattern itself. It is used for (?R), (?0) and \g<0>. */
6827 const int num = 0;
6828 Node* np;
6829 np = node_new_enclose_memory(env->option, 0);
6830 CHECK_NULL_RETURN_MEMERR(np);
6831 NENCLOSE(np)->regnum = num;
6832 NENCLOSE(np)->target = *top;
6833 r = scan_env_set_mem_node(env, num, np);
6834 if (r != 0) {
6835 onig_node_free(np);
6836 return r;
6837 }
6838 *top = np;
6839 }
6840#endif
6841 return 0;
6842}
6843
6844extern int
6845onig_parse_make_tree(Node** root, const UChar* pattern, const UChar* end,
6846 regex_t* reg, ScanEnv* env)
6847{
6848 int r;
6849 UChar* p;
6850
6851#ifdef USE_NAMED_GROUP
6852 names_clear(reg);
6853#endif
6854
6855 scan_env_clear(env);
6856 env->option = reg->options;
6857 env->case_fold_flag = reg->case_fold_flag;
6858 env->enc = reg->enc;
6859 env->syntax = reg->syntax;
6860 env->pattern = (UChar* )pattern;
6861 env->pattern_end = (UChar* )end;
6862 env->reg = reg;
6863
6864 *root = NULL;
6865 p = (UChar* )pattern;
6866 r = parse_regexp(root, &p, (UChar* )end, env);
6867 reg->num_mem = env->num_mem;
6868 return r;
6869}
6870
6871extern void
6872onig_scan_env_set_error_string(ScanEnv* env, int ecode ARG_UNUSED,
6873 UChar* arg, UChar* arg_end)
6874{
6875 env->error = arg;
6876 env->error_end = arg_end;
6877}
#define xfree
Old name of ruby_xfree.
Definition xmalloc.h:58
#define xrealloc
Old name of ruby_xrealloc.
Definition xmalloc.h:56
#define xmalloc
Old name of ruby_xmalloc.
Definition xmalloc.h:53
#define ruby_verbose
This variable controls whether the interpreter is in debug mode.
Definition error.h:475
void rb_warn(const char *fmt,...)
Identical to rb_warning(), except it reports unless $VERBOSE is nil.
Definition error.c:466
#define RUBY
Asserts that the compilation unit includes Ruby's CAPI.
Definition defines.h:85
int capa
Designed capacity of the buffer.
Definition io.h:11
int len
Length of the buffer.
Definition io.h:8
VALUE type(ANYARGS)
ANYARGS-ed function type.
#define RTEST
This is an old name of RB_TEST.
Defines old _.
Definition regparse.c:463
Definition regenc.h:119