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