Ruby 4.1.0dev (2026-08-15 revision cfb2ed7c723c5435f630fd70897273db032b0bcc)
regparse.c (cfb2ed7c723c5435f630fd70897273db032b0bcc)
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
1573#if 0
1574extern void
1575onig_node_conv_to_str_node(Node* node, int flag)
1576{
1577 SET_NTYPE(node, NT_STR);
1578 NSTR(node)->flag = flag;
1579 NSTR(node)->capa = 0;
1580 NSTR(node)->s = NSTR(node)->buf;
1581 NSTR(node)->end = NSTR(node)->buf;
1582}
1583#endif
1584
1585extern void
1586onig_node_str_clear(Node* node)
1587{
1588 if (NSTR(node)->capa != 0 &&
1589 IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) {
1590 xfree(NSTR(node)->s);
1591 }
1592
1593 NSTR(node)->capa = 0;
1594 NSTR(node)->flag = 0;
1595 NSTR(node)->s = NSTR(node)->buf;
1596 NSTR(node)->end = NSTR(node)->buf;
1597}
1598
1599static Node*
1600node_new_str(const UChar* s, const UChar* end)
1601{
1602 Node* node = node_new();
1603 CHECK_NULL_RETURN(node);
1604
1605 SET_NTYPE(node, NT_STR);
1606 NSTR(node)->capa = 0;
1607 NSTR(node)->flag = 0;
1608 NSTR(node)->s = NSTR(node)->buf;
1609 NSTR(node)->end = NSTR(node)->buf;
1610 if (onig_node_str_cat(node, s, end)) {
1611 onig_node_free(node);
1612 return NULL;
1613 }
1614 return node;
1615}
1616
1617extern Node*
1618onig_node_new_str(const UChar* s, const UChar* end)
1619{
1620 return node_new_str(s, end);
1621}
1622
1623static Node*
1624node_new_str_raw(UChar* s, UChar* end)
1625{
1626 Node* node = node_new_str(s, end);
1627 if (IS_NOT_NULL(node))
1628 NSTRING_SET_RAW(node);
1629 return node;
1630}
1631
1632static Node*
1633node_new_empty(void)
1634{
1635 return node_new_str(NULL, NULL);
1636}
1637
1638static Node*
1639node_new_str_raw_char(UChar c)
1640{
1641 UChar p[1];
1642
1643 p[0] = c;
1644 return node_new_str_raw(p, p + 1);
1645}
1646
1647static Node*
1648str_node_split_last_char(StrNode* sn, OnigEncoding enc)
1649{
1650 const UChar *p;
1651 Node* n = NULL_NODE;
1652
1653 if (sn->end > sn->s) {
1654 p = onigenc_get_prev_char_head(enc, sn->s, sn->end, sn->end);
1655 if (p && p > sn->s) { /* can be split. */
1656 n = node_new_str(p, sn->end);
1657 if (IS_NOT_NULL(n) && (sn->flag & NSTR_RAW) != 0)
1658 NSTRING_SET_RAW(n);
1659 sn->end = (UChar* )p;
1660 }
1661 }
1662 return n;
1663}
1664
1665static int
1666str_node_can_be_split(StrNode* sn, OnigEncoding enc)
1667{
1668 if (sn->end > sn->s) {
1669 return ((enclen(enc, sn->s, sn->end) < sn->end - sn->s) ? 1 : 0);
1670 }
1671 return 0;
1672}
1673
1674#ifdef USE_PAD_TO_SHORT_BYTE_CHAR
1675static int
1676node_str_head_pad(StrNode* sn, int num, UChar val)
1677{
1678 UChar buf[NODE_STR_BUF_SIZE];
1679 int i, len;
1680
1681 len = sn->end - sn->s;
1682 onig_strcpy(buf, sn->s, sn->end);
1683 onig_strcpy(&(sn->s[num]), buf, buf + len);
1684 sn->end += num;
1685
1686 for (i = 0; i < num; i++) {
1687 sn->s[i] = val;
1688 }
1689}
1690#endif
1691
1692extern int
1693onig_scan_unsigned_number(UChar** src, const UChar* end, OnigEncoding enc)
1694{
1695 unsigned int num, val;
1696 OnigCodePoint c;
1697 UChar* p = *src;
1698 PFETCH_READY;
1699
1700 num = 0;
1701 while (!PEND) {
1702 PFETCH(c);
1703 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
1704 val = (unsigned int )DIGITVAL(c);
1705 if ((INT_MAX_LIMIT - val) / 10UL < num)
1706 return -1; /* overflow */
1707
1708 num = num * 10 + val;
1709 }
1710 else {
1711 PUNFETCH;
1712 break;
1713 }
1714 }
1715 *src = p;
1716 return num;
1717}
1718
1719static int
1720scan_unsigned_hexadecimal_number(UChar** src, UChar* end, int minlen,
1721 int maxlen, OnigEncoding enc)
1722{
1723 OnigCodePoint c;
1724 unsigned int num, val;
1725 int restlen;
1726 UChar* p = *src;
1727 PFETCH_READY;
1728
1729 restlen = maxlen - minlen;
1730 num = 0;
1731 while (!PEND && maxlen-- != 0) {
1732 PFETCH(c);
1733 if (ONIGENC_IS_CODE_XDIGIT(enc, c)) {
1734 val = (unsigned int )XDIGITVAL(enc,c);
1735 if ((INT_MAX_LIMIT - val) / 16UL < num)
1736 return -1; /* overflow */
1737
1738 num = (num << 4) + XDIGITVAL(enc,c);
1739 }
1740 else {
1741 PUNFETCH;
1742 maxlen++;
1743 break;
1744 }
1745 }
1746 if (maxlen > restlen)
1747 return -2; /* not enough digits */
1748 *src = p;
1749 return num;
1750}
1751
1752static int
1753scan_unsigned_octal_number(UChar** src, UChar* end, int maxlen,
1754 OnigEncoding enc)
1755{
1756 OnigCodePoint c;
1757 unsigned int num, val;
1758 UChar* p = *src;
1759 PFETCH_READY;
1760
1761 num = 0;
1762 while (!PEND && maxlen-- != 0) {
1763 PFETCH(c);
1764 if (ONIGENC_IS_CODE_DIGIT(enc, c) && c < '8') {
1765 val = ODIGITVAL(c);
1766 if ((INT_MAX_LIMIT - val) / 8UL < num)
1767 return -1; /* overflow */
1768
1769 num = (num << 3) + val;
1770 }
1771 else {
1772 PUNFETCH;
1773 break;
1774 }
1775 }
1776 *src = p;
1777 return num;
1778}
1779
1780
1781#define BBUF_WRITE_CODE_POINT(bbuf,pos,code) \
1782 BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT)
1783
1784/* data format:
1785 [n][from-1][to-1][from-2][to-2] ... [from-n][to-n]
1786 (all data size is OnigCodePoint)
1787 */
1788static int
1789new_code_range(BBuf** pbuf)
1790{
1791#define INIT_MULTI_BYTE_RANGE_SIZE (SIZE_CODE_POINT * 5)
1792 int r;
1793 OnigCodePoint n;
1794 BBuf* bbuf;
1795
1796 bbuf = *pbuf = (BBuf* )xmalloc(sizeof(BBuf));
1797 CHECK_NULL_RETURN_MEMERR(*pbuf);
1798 r = BBUF_INIT(*pbuf, INIT_MULTI_BYTE_RANGE_SIZE);
1799 if (r) return r;
1800
1801 n = 0;
1802 BBUF_WRITE_CODE_POINT(bbuf, 0, n);
1803 return 0;
1804}
1805
1806static int
1807add_code_range_to_buf0(BBuf** pbuf, ScanEnv* env, OnigCodePoint from, OnigCodePoint to,
1808 int checkdup)
1809{
1810 int r, inc_n, pos;
1811 OnigCodePoint low, high, bound, x;
1812 OnigCodePoint n, *data;
1813 BBuf* bbuf;
1814
1815 if (from > to) {
1816 n = from; from = to; to = n;
1817 }
1818
1819 if (IS_NULL(*pbuf)) {
1820 r = new_code_range(pbuf);
1821 if (r) return r;
1822 bbuf = *pbuf;
1823 n = 0;
1824 }
1825 else {
1826 bbuf = *pbuf;
1827 GET_CODE_POINT(n, bbuf->p);
1828 }
1829 data = (OnigCodePoint* )(bbuf->p);
1830 data++;
1831
1832 bound = (from == 0) ? 0 : n;
1833 for (low = 0; low < bound; ) {
1834 x = (low + bound) >> 1;
1835 if (from - 1 > data[x*2 + 1])
1836 low = x + 1;
1837 else
1838 bound = x;
1839 }
1840
1841 high = (to == ONIG_LAST_CODE_POINT) ? n : low;
1842 for (bound = n; high < bound; ) {
1843 x = (high + bound) >> 1;
1844 if (to + 1 >= data[x*2])
1845 high = x + 1;
1846 else
1847 bound = x;
1848 }
1849 /* data[(low-1)*2+1] << from <= data[low*2]
1850 * data[(high-1)*2+1] <= to << data[high*2]
1851 */
1852
1853 inc_n = low + 1 - high;
1854 if (n + inc_n > ONIG_MAX_MULTI_BYTE_RANGES_NUM)
1855 return ONIGERR_TOO_MANY_MULTI_BYTE_RANGES;
1856
1857 if (inc_n != 1) {
1858 if (checkdup && from <= data[low*2+1]
1859 && (data[low*2] <= from || data[low*2+1] <= to))
1860 CC_DUP_WARN(env, from, to);
1861 if (from > data[low*2])
1862 from = data[low*2];
1863 if (to < data[(high - 1)*2 + 1])
1864 to = data[(high - 1)*2 + 1];
1865 }
1866
1867 if (inc_n != 0) {
1868 int from_pos = SIZE_CODE_POINT * (1 + high * 2);
1869 int to_pos = SIZE_CODE_POINT * (1 + (low + 1) * 2);
1870
1871 if (inc_n > 0) {
1872 if (high < n) {
1873 int size = (n - high) * 2 * SIZE_CODE_POINT;
1874 BBUF_MOVE_RIGHT(bbuf, from_pos, to_pos, size);
1875 }
1876 }
1877 else {
1878 BBUF_MOVE_LEFT_REDUCE(bbuf, from_pos, to_pos);
1879 }
1880 }
1881
1882 pos = SIZE_CODE_POINT * (1 + low * 2);
1883 BBUF_ENSURE_SIZE(bbuf, pos + SIZE_CODE_POINT * 2);
1884 BBUF_WRITE_CODE_POINT(bbuf, pos, from);
1885 BBUF_WRITE_CODE_POINT(bbuf, pos + SIZE_CODE_POINT, to);
1886 n += inc_n;
1887 BBUF_WRITE_CODE_POINT(bbuf, 0, n);
1888
1889 return 0;
1890}
1891
1892static int
1893add_code_range_to_buf(BBuf** pbuf, ScanEnv* env, OnigCodePoint from, OnigCodePoint to)
1894{
1895 return add_code_range_to_buf0(pbuf, env, from, to, 1);
1896}
1897
1898static int
1899add_code_range0(BBuf** pbuf, ScanEnv* env, OnigCodePoint from, OnigCodePoint to, int checkdup)
1900{
1901 if (from > to) {
1902 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC))
1903 return 0;
1904 else
1905 return ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS;
1906 }
1907
1908 return add_code_range_to_buf0(pbuf, env, from, to, checkdup);
1909}
1910
1911static int
1912add_code_range(BBuf** pbuf, ScanEnv* env, OnigCodePoint from, OnigCodePoint to)
1913{
1914 return add_code_range0(pbuf, env, from, to, 1);
1915}
1916
1917static int
1918not_code_range_buf(OnigEncoding enc, BBuf* bbuf, BBuf** pbuf, ScanEnv* env)
1919{
1920 int r, i, n;
1921 OnigCodePoint pre, from, *data, to = 0;
1922
1923 *pbuf = (BBuf* )NULL;
1924 if (IS_NULL(bbuf)) {
1925 set_all:
1926 return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf);
1927 }
1928
1929 data = (OnigCodePoint* )(bbuf->p);
1930 GET_CODE_POINT(n, data);
1931 data++;
1932 if (n <= 0) goto set_all;
1933
1934 r = 0;
1935 pre = MBCODE_START_POS(enc);
1936 for (i = 0; i < n; i++) {
1937 from = data[i*2];
1938 to = data[i*2+1];
1939 if (pre <= from - 1) {
1940 r = add_code_range_to_buf(pbuf, env, pre, from - 1);
1941 if (r != 0) return r;
1942 }
1943 if (to == ONIG_LAST_CODE_POINT) break;
1944 pre = to + 1;
1945 }
1946 if (to < ONIG_LAST_CODE_POINT) {
1947 r = add_code_range_to_buf(pbuf, env, to + 1, ONIG_LAST_CODE_POINT);
1948 }
1949 return r;
1950}
1951
1952#define SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2) do {\
1953 BBuf *tbuf; \
1954 int tnot; \
1955 tnot = not1; not1 = not2; not2 = tnot; \
1956 tbuf = bbuf1; bbuf1 = bbuf2; bbuf2 = tbuf; \
1957} while (0)
1958
1959static int
1960or_code_range_buf(OnigEncoding enc, BBuf* bbuf1, int not1,
1961 BBuf* bbuf2, int not2, BBuf** pbuf, ScanEnv* env)
1962{
1963 int r;
1964 OnigCodePoint i, n1, *data1;
1965 OnigCodePoint from, to;
1966
1967 *pbuf = (BBuf* )NULL;
1968 if (IS_NULL(bbuf1) && IS_NULL(bbuf2)) {
1969 if (not1 != 0 || not2 != 0)
1970 return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf);
1971 return 0;
1972 }
1973
1974 r = 0;
1975 if (IS_NULL(bbuf2))
1976 SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2);
1977
1978 if (IS_NULL(bbuf1)) {
1979 if (not1 != 0) {
1980 return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf);
1981 }
1982 else {
1983 if (not2 == 0) {
1984 return bbuf_clone(pbuf, bbuf2);
1985 }
1986 else {
1987 return not_code_range_buf(enc, bbuf2, pbuf, env);
1988 }
1989 }
1990 }
1991
1992 if (not1 != 0)
1993 SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2);
1994
1995 data1 = (OnigCodePoint* )(bbuf1->p);
1996 GET_CODE_POINT(n1, data1);
1997 data1++;
1998
1999 if (not2 == 0 && not1 == 0) { /* 1 OR 2 */
2000 r = bbuf_clone(pbuf, bbuf2);
2001 }
2002 else if (not1 == 0) { /* 1 OR (not 2) */
2003 r = not_code_range_buf(enc, bbuf2, pbuf, env);
2004 }
2005 if (r != 0) return r;
2006
2007 for (i = 0; i < n1; i++) {
2008 from = data1[i*2];
2009 to = data1[i*2+1];
2010 r = add_code_range_to_buf(pbuf, env, from, to);
2011 if (r != 0) return r;
2012 }
2013 return 0;
2014}
2015
2016static int
2017and_code_range1(BBuf** pbuf, ScanEnv* env, OnigCodePoint from1, OnigCodePoint to1,
2018 OnigCodePoint* data, int n)
2019{
2020 int i, r;
2021 OnigCodePoint from2, to2;
2022
2023 for (i = 0; i < n; i++) {
2024 from2 = data[i*2];
2025 to2 = data[i*2+1];
2026 if (from2 < from1) {
2027 if (to2 < from1) continue;
2028 else {
2029 from1 = to2 + 1;
2030 }
2031 }
2032 else if (from2 <= to1) {
2033 if (to2 < to1) {
2034 if (from1 <= from2 - 1) {
2035 r = add_code_range_to_buf(pbuf, env, from1, from2-1);
2036 if (r != 0) return r;
2037 }
2038 from1 = to2 + 1;
2039 }
2040 else {
2041 to1 = from2 - 1;
2042 }
2043 }
2044 else {
2045 from1 = from2;
2046 }
2047 if (from1 > to1) break;
2048 }
2049 if (from1 <= to1) {
2050 r = add_code_range_to_buf(pbuf, env, from1, to1);
2051 if (r != 0) return r;
2052 }
2053 return 0;
2054}
2055
2056static int
2057and_code_range_buf(BBuf* bbuf1, int not1, BBuf* bbuf2, int not2, BBuf** pbuf, ScanEnv* env)
2058{
2059 int r;
2060 OnigCodePoint i, j, n1, n2, *data1, *data2;
2061 OnigCodePoint from, to, from1, to1, from2, to2;
2062
2063 *pbuf = (BBuf* )NULL;
2064 if (IS_NULL(bbuf1)) {
2065 if (not1 != 0 && IS_NOT_NULL(bbuf2)) /* not1 != 0 -> not2 == 0 */
2066 return bbuf_clone(pbuf, bbuf2);
2067 return 0;
2068 }
2069 else if (IS_NULL(bbuf2)) {
2070 if (not2 != 0)
2071 return bbuf_clone(pbuf, bbuf1);
2072 return 0;
2073 }
2074
2075 if (not1 != 0)
2076 SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2);
2077
2078 data1 = (OnigCodePoint* )(bbuf1->p);
2079 data2 = (OnigCodePoint* )(bbuf2->p);
2080 GET_CODE_POINT(n1, data1);
2081 GET_CODE_POINT(n2, data2);
2082 data1++;
2083 data2++;
2084
2085 if (not2 == 0 && not1 == 0) { /* 1 AND 2 */
2086 for (i = 0; i < n1; i++) {
2087 from1 = data1[i*2];
2088 to1 = data1[i*2+1];
2089 for (j = 0; j < n2; j++) {
2090 from2 = data2[j*2];
2091 to2 = data2[j*2+1];
2092 if (from2 > to1) break;
2093 if (to2 < from1) continue;
2094 from = MAX(from1, from2);
2095 to = MIN(to1, to2);
2096 r = add_code_range_to_buf(pbuf, env, from, to);
2097 if (r != 0) return r;
2098 }
2099 }
2100 }
2101 else if (not1 == 0) { /* 1 AND (not 2) */
2102 for (i = 0; i < n1; i++) {
2103 from1 = data1[i*2];
2104 to1 = data1[i*2+1];
2105 r = and_code_range1(pbuf, env, from1, to1, data2, n2);
2106 if (r != 0) return r;
2107 }
2108 }
2109
2110 return 0;
2111}
2112
2113static int
2114and_cclass(CClassNode* dest, CClassNode* cc, ScanEnv* env)
2115{
2116 OnigEncoding enc = env->enc;
2117 int r, not1, not2;
2118 BBuf *buf1, *buf2, *pbuf = 0;
2119 BitSetRef bsr1, bsr2;
2120 BitSet bs1, bs2;
2121
2122 not1 = IS_NCCLASS_NOT(dest);
2123 bsr1 = dest->bs;
2124 buf1 = dest->mbuf;
2125 not2 = IS_NCCLASS_NOT(cc);
2126 bsr2 = cc->bs;
2127 buf2 = cc->mbuf;
2128
2129 if (not1 != 0) {
2130 bitset_invert_to(bsr1, bs1);
2131 bsr1 = bs1;
2132 }
2133 if (not2 != 0) {
2134 bitset_invert_to(bsr2, bs2);
2135 bsr2 = bs2;
2136 }
2137 bitset_and(bsr1, bsr2);
2138 if (bsr1 != dest->bs) {
2139 bitset_copy(dest->bs, bsr1);
2140 bsr1 = dest->bs;
2141 }
2142 if (not1 != 0) {
2143 bitset_invert(dest->bs);
2144 }
2145
2146 if (! ONIGENC_IS_SINGLEBYTE(enc)) {
2147 if (not1 != 0 && not2 != 0) {
2148 r = or_code_range_buf(enc, buf1, 0, buf2, 0, &pbuf, env);
2149 }
2150 else {
2151 r = and_code_range_buf(buf1, not1, buf2, not2, &pbuf, env);
2152 if (r == 0 && not1 != 0) {
2153 BBuf *tbuf = 0;
2154 r = not_code_range_buf(enc, pbuf, &tbuf, env);
2155 bbuf_free(pbuf);
2156 pbuf = tbuf;
2157 }
2158 }
2159 if (r != 0) {
2160 bbuf_free(pbuf);
2161 return r;
2162 }
2163
2164 dest->mbuf = pbuf;
2165 bbuf_free(buf1);
2166 return r;
2167 }
2168 return 0;
2169}
2170
2171static int
2172or_cclass(CClassNode* dest, CClassNode* cc, ScanEnv* env)
2173{
2174 OnigEncoding enc = env->enc;
2175 int r, not1, not2;
2176 BBuf *buf1, *buf2, *pbuf = 0;
2177 BitSetRef bsr1, bsr2;
2178 BitSet bs1, bs2;
2179
2180 not1 = IS_NCCLASS_NOT(dest);
2181 bsr1 = dest->bs;
2182 buf1 = dest->mbuf;
2183 not2 = IS_NCCLASS_NOT(cc);
2184 bsr2 = cc->bs;
2185 buf2 = cc->mbuf;
2186
2187 if (not1 != 0) {
2188 bitset_invert_to(bsr1, bs1);
2189 bsr1 = bs1;
2190 }
2191 if (not2 != 0) {
2192 bitset_invert_to(bsr2, bs2);
2193 bsr2 = bs2;
2194 }
2195 bitset_or(bsr1, bsr2);
2196 if (bsr1 != dest->bs) {
2197 bitset_copy(dest->bs, bsr1);
2198 bsr1 = dest->bs;
2199 }
2200 if (not1 != 0) {
2201 bitset_invert(dest->bs);
2202 }
2203
2204 if (! ONIGENC_IS_SINGLEBYTE(enc)) {
2205 if (not1 != 0 && not2 != 0) {
2206 r = and_code_range_buf(buf1, 0, buf2, 0, &pbuf, env);
2207 }
2208 else {
2209 r = or_code_range_buf(enc, buf1, not1, buf2, not2, &pbuf, env);
2210 if (r == 0 && not1 != 0) {
2211 BBuf *tbuf = 0;
2212 r = not_code_range_buf(enc, pbuf, &tbuf, env);
2213 bbuf_free(pbuf);
2214 pbuf = tbuf;
2215 }
2216 }
2217 if (r != 0) {
2218 bbuf_free(pbuf);
2219 return r;
2220 }
2221
2222 dest->mbuf = pbuf;
2223 bbuf_free(buf1);
2224 return r;
2225 }
2226 else
2227 return 0;
2228}
2229
2230static void UNKNOWN_ESC_WARN(ScanEnv *env, int c);
2231
2232static OnigCodePoint
2233conv_backslash_value(OnigCodePoint c, ScanEnv* env)
2234{
2235 if (IS_SYNTAX_OP(env->syntax, ONIG_SYN_OP_ESC_CONTROL_CHARS)) {
2236 switch (c) {
2237 case 'n': return '\n';
2238 case 't': return '\t';
2239 case 'r': return '\r';
2240 case 'f': return '\f';
2241 case 'a': return '\007';
2242 case 'b': return '\010';
2243 case 'e': return '\033';
2244 case 'v':
2245 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ESC_V_VTAB))
2246 return '\v';
2247 break;
2248
2249 default:
2250 if (('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z'))
2251 UNKNOWN_ESC_WARN(env, c);
2252 break;
2253 }
2254 }
2255 return c;
2256}
2257
2258#ifdef USE_NO_INVALID_QUANTIFIER
2259# define is_invalid_quantifier_target(node) 0
2260#else
2261static int
2262is_invalid_quantifier_target(Node* node)
2263{
2264 switch (NTYPE(node)) {
2265 case NT_ANCHOR:
2266 return 1;
2267 break;
2268
2269 case NT_ENCLOSE:
2270 /* allow enclosed elements */
2271 /* return is_invalid_quantifier_target(NENCLOSE(node)->target); */
2272 break;
2273
2274 case NT_LIST:
2275 do {
2276 if (! is_invalid_quantifier_target(NCAR(node))) return 0;
2277 } while (IS_NOT_NULL(node = NCDR(node)));
2278 return 0;
2279 break;
2280
2281 case NT_ALT:
2282 do {
2283 if (is_invalid_quantifier_target(NCAR(node))) return 1;
2284 } while (IS_NOT_NULL(node = NCDR(node)));
2285 break;
2286
2287 default:
2288 break;
2289 }
2290 return 0;
2291}
2292#endif
2293
2294/* ?:0, *:1, +:2, ??:3, *?:4, +?:5 */
2295static int
2296popular_quantifier_num(QtfrNode* q)
2297{
2298 if (q->greedy) {
2299 if (q->lower == 0) {
2300 if (q->upper == 1) return 0;
2301 else if (IS_REPEAT_INFINITE(q->upper)) return 1;
2302 }
2303 else if (q->lower == 1) {
2304 if (IS_REPEAT_INFINITE(q->upper)) return 2;
2305 }
2306 }
2307 else {
2308 if (q->lower == 0) {
2309 if (q->upper == 1) return 3;
2310 else if (IS_REPEAT_INFINITE(q->upper)) return 4;
2311 }
2312 else if (q->lower == 1) {
2313 if (IS_REPEAT_INFINITE(q->upper)) return 5;
2314 }
2315 }
2316 return -1;
2317}
2318
2319
2320enum ReduceType {
2321 RQ_ASIS = 0, /* as is */
2322 RQ_DEL = 1, /* delete parent */
2323 RQ_A, /* to '*' */
2324 RQ_AQ, /* to '*?' */
2325 RQ_QQ, /* to '??' */
2326 RQ_P_QQ, /* to '+)??' */
2327};
2328
2329static enum ReduceType const ReduceTypeTable[6][6] = {
2330/* '?', '*', '+', '??', '*?', '+?' p / c */
2331 {RQ_DEL, RQ_A, RQ_A, RQ_QQ, RQ_AQ, RQ_ASIS}, /* '?' */
2332 {RQ_DEL, RQ_DEL, RQ_DEL, RQ_P_QQ, RQ_P_QQ, RQ_DEL}, /* '*' */
2333 {RQ_A, RQ_A, RQ_DEL, RQ_ASIS, RQ_P_QQ, RQ_DEL}, /* '+' */
2334 {RQ_DEL, RQ_AQ, RQ_AQ, RQ_DEL, RQ_AQ, RQ_AQ}, /* '??' */
2335 {RQ_DEL, RQ_DEL, RQ_DEL, RQ_DEL, RQ_DEL, RQ_DEL}, /* '*?' */
2336 {RQ_ASIS, RQ_ASIS, RQ_ASIS, RQ_AQ, RQ_AQ, RQ_DEL} /* '+?' */
2337};
2338
2339extern void
2340onig_reduce_nested_quantifier(Node* pnode, Node* cnode)
2341{
2342 int pnum, cnum;
2343 QtfrNode *p, *c;
2344
2345 p = NQTFR(pnode);
2346 c = NQTFR(cnode);
2347 pnum = popular_quantifier_num(p);
2348 cnum = popular_quantifier_num(c);
2349 if (pnum < 0 || cnum < 0) return ;
2350
2351 switch (ReduceTypeTable[cnum][pnum]) {
2352 case RQ_DEL:
2353 *pnode = *cnode;
2354 break;
2355 case RQ_A:
2356 p->target = c->target;
2357 p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 1;
2358 break;
2359 case RQ_AQ:
2360 p->target = c->target;
2361 p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 0;
2362 break;
2363 case RQ_QQ:
2364 p->target = c->target;
2365 p->lower = 0; p->upper = 1; p->greedy = 0;
2366 break;
2367 case RQ_P_QQ:
2368 p->target = cnode;
2369 p->lower = 0; p->upper = 1; p->greedy = 0;
2370 c->lower = 1; c->upper = REPEAT_INFINITE; c->greedy = 1;
2371 return ;
2372 break;
2373 case RQ_ASIS:
2374 p->target = cnode;
2375 return ;
2376 break;
2377 }
2378
2379 c->target = NULL_NODE;
2380 onig_node_free(cnode);
2381}
2382
2383
2384enum TokenSyms {
2385 TK_EOT = 0, /* end of token */
2386 TK_RAW_BYTE = 1,
2387 TK_CHAR,
2388 TK_STRING,
2389 TK_CODE_POINT,
2390 TK_ANYCHAR,
2391 TK_CHAR_TYPE,
2392 TK_BACKREF,
2393 TK_CALL,
2394 TK_ANCHOR,
2395 TK_OP_REPEAT,
2396 TK_INTERVAL,
2397 TK_ANYCHAR_ANYTIME, /* SQL '%' == .* */
2398 TK_ALT,
2399 TK_SUBEXP_OPEN,
2400 TK_SUBEXP_CLOSE,
2401 TK_CC_OPEN,
2402 TK_QUOTE_OPEN,
2403 TK_CHAR_PROPERTY, /* \p{...}, \P{...} */
2404 TK_LINEBREAK,
2405 TK_EXTENDED_GRAPHEME_CLUSTER,
2406 TK_KEEP,
2407 /* in cc */
2408 TK_CC_CLOSE,
2409 TK_CC_RANGE,
2410 TK_POSIX_BRACKET_OPEN,
2411 TK_CC_AND, /* && */
2412 TK_CC_CC_OPEN /* [ */
2413};
2414
2415typedef struct {
2416 enum TokenSyms type;
2417 int escaped;
2418 int base; /* is number: 8, 16 (used in [....]) */
2419 UChar* backp;
2420 union {
2421 UChar* s;
2422 int c;
2423 OnigCodePoint code;
2424 struct {
2425 int subtype;
2426 int ascii_range;
2427 } anchor;
2428 struct {
2429 int lower;
2430 int upper;
2431 int greedy;
2432 int possessive;
2433 } repeat;
2434 struct {
2435 int num;
2436 int ref1;
2437 int* refs;
2438 int by_name;
2439#ifdef USE_BACKREF_WITH_LEVEL
2440 int exist_level;
2441 int level; /* \k<name+n> */
2442#endif
2443 } backref;
2444 struct {
2445 UChar* name;
2446 UChar* name_end;
2447 int gnum;
2448 int rel;
2449 } call;
2450 struct {
2451 int ctype;
2452 int not;
2453 } prop;
2454 } u;
2455} OnigToken;
2456
2457
2458static int
2459fetch_range_quantifier(UChar** src, UChar* end, OnigToken* tok, ScanEnv* env)
2460{
2461 int low, up, syn_allow, non_low = 0;
2462 int r = 0;
2463 OnigCodePoint c;
2464 OnigEncoding enc = env->enc;
2465 UChar* p = *src;
2466 PFETCH_READY;
2467
2468 syn_allow = IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_INVALID_INTERVAL);
2469
2470 if (PEND) {
2471 if (syn_allow)
2472 return 1; /* "....{" : OK! */
2473 else
2474 return ONIGERR_END_PATTERN_AT_LEFT_BRACE; /* "....{" syntax error */
2475 }
2476
2477 if (! syn_allow) {
2478 c = PPEEK;
2479 if (c == ')' || c == '(' || c == '|') {
2480 return ONIGERR_END_PATTERN_AT_LEFT_BRACE;
2481 }
2482 }
2483
2484 low = onig_scan_unsigned_number(&p, end, env->enc);
2485 if (low < 0) return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2486 if (low > ONIG_MAX_REPEAT_NUM)
2487 return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2488
2489 if (p == *src) { /* can't read low */
2490 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_INTERVAL_LOW_ABBREV)) {
2491 /* allow {,n} as {0,n} */
2492 low = 0;
2493 non_low = 1;
2494 }
2495 else
2496 goto invalid;
2497 }
2498
2499 if (PEND) goto invalid;
2500 PFETCH(c);
2501 if (c == ',') {
2502 UChar* prev = p;
2503 up = onig_scan_unsigned_number(&p, end, env->enc);
2504 if (up < 0) return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2505 if (up > ONIG_MAX_REPEAT_NUM)
2506 return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2507
2508 if (p == prev) {
2509 if (non_low != 0)
2510 goto invalid;
2511 up = REPEAT_INFINITE; /* {n,} : {n,infinite} */
2512 }
2513 }
2514 else {
2515 if (non_low != 0)
2516 goto invalid;
2517
2518 PUNFETCH;
2519 up = low; /* {n} : exact n times */
2520 r = 2; /* fixed */
2521 }
2522
2523 if (PEND) goto invalid;
2524 PFETCH(c);
2525 if (IS_SYNTAX_OP(env->syntax, ONIG_SYN_OP_ESC_BRACE_INTERVAL)) {
2526 if (c != MC_ESC(env->syntax)) goto invalid;
2527 if (PEND) goto invalid;
2528 PFETCH(c);
2529 }
2530 if (c != '}') goto invalid;
2531
2532 if (!IS_REPEAT_INFINITE(up) && low > up) {
2533 return ONIGERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE;
2534 }
2535
2536 tok->type = TK_INTERVAL;
2537 tok->u.repeat.lower = low;
2538 tok->u.repeat.upper = up;
2539 *src = p;
2540 return r; /* 0: normal {n,m}, 2: fixed {n} */
2541
2542 invalid:
2543 if (syn_allow)
2544 return 1; /* OK */
2545 else
2546 return ONIGERR_INVALID_REPEAT_RANGE_PATTERN;
2547}
2548
2549/* \M-, \C-, \c, or \... */
2550static int
2551fetch_escaped_value(UChar** src, UChar* end, ScanEnv* env, OnigCodePoint* val)
2552{
2553 int v;
2554 OnigCodePoint c;
2555 OnigEncoding enc = env->enc;
2556 UChar* p = *src;
2557
2558 if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE;
2559
2560 PFETCH_S(c);
2561 switch (c) {
2562 case 'M':
2563 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ESC_CAPITAL_M_BAR_META)) {
2564 if (PEND) return ONIGERR_END_PATTERN_AT_META;
2565 PFETCH_S(c);
2566 if (c != '-') return ONIGERR_META_CODE_SYNTAX;
2567 if (PEND) return ONIGERR_END_PATTERN_AT_META;
2568 PFETCH_S(c);
2569 if (c == MC_ESC(env->syntax)) {
2570 v = fetch_escaped_value(&p, end, env, &c);
2571 if (v < 0) return v;
2572 }
2573 c = ((c & 0xff) | 0x80);
2574 }
2575 else
2576 goto backslash;
2577 break;
2578
2579 case 'C':
2580 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ESC_CAPITAL_C_BAR_CONTROL)) {
2581 if (PEND) return ONIGERR_END_PATTERN_AT_CONTROL;
2582 PFETCH_S(c);
2583 if (c != '-') return ONIGERR_CONTROL_CODE_SYNTAX;
2584 goto control;
2585 }
2586 else
2587 goto backslash;
2588
2589 case 'c':
2590 if (IS_SYNTAX_OP(env->syntax, ONIG_SYN_OP_ESC_C_CONTROL)) {
2591 control:
2592 if (PEND) return ONIGERR_END_PATTERN_AT_CONTROL;
2593 PFETCH_S(c);
2594 if (c == '?') {
2595 c = 0177;
2596 }
2597 else {
2598 if (c == MC_ESC(env->syntax)) {
2599 v = fetch_escaped_value(&p, end, env, &c);
2600 if (v < 0) return v;
2601 }
2602 c &= 0x9f;
2603 }
2604 break;
2605 }
2606 /* fall through */
2607
2608 default:
2609 {
2610 backslash:
2611 c = conv_backslash_value(c, env);
2612 }
2613 break;
2614 }
2615
2616 *src = p;
2617 *val = c;
2618 return 0;
2619}
2620
2621static int fetch_token(OnigToken* tok, UChar** src, UChar* end, ScanEnv* env);
2622
2623static OnigCodePoint
2624get_name_end_code_point(OnigCodePoint start)
2625{
2626 switch (start) {
2627 case '<': return (OnigCodePoint )'>'; break;
2628 case '\'': return (OnigCodePoint )'\''; break;
2629 case '(': return (OnigCodePoint )')'; break;
2630 case '{': return (OnigCodePoint )'}'; break;
2631 default:
2632 break;
2633 }
2634
2635 return (OnigCodePoint )0;
2636}
2637
2638#ifdef USE_NAMED_GROUP
2639# ifdef RUBY
2640# define ONIGENC_IS_CODE_NAME(enc, c) TRUE
2641# else
2642# define ONIGENC_IS_CODE_NAME(enc, c) ONIGENC_IS_CODE_WORD(enc, c)
2643# endif
2644
2645# ifdef USE_BACKREF_WITH_LEVEL
2646/*
2647 \k<name+n>, \k<name-n>
2648 \k<num+n>, \k<num-n>
2649 \k<-num+n>, \k<-num-n>
2650*/
2651static int
2652fetch_name_with_level(OnigCodePoint start_code, UChar** src, UChar* end,
2653 UChar** rname_end, ScanEnv* env,
2654 int* rback_num, int* rlevel)
2655{
2656 int r, sign, is_num, exist_level;
2657 OnigCodePoint end_code;
2658 OnigCodePoint c = 0;
2659 OnigEncoding enc = env->enc;
2660 UChar *name_end;
2661 UChar *pnum_head;
2662 UChar *p = *src;
2663 PFETCH_READY;
2664
2665 *rback_num = 0;
2666 is_num = exist_level = 0;
2667 sign = 1;
2668 pnum_head = *src;
2669
2670 end_code = get_name_end_code_point(start_code);
2671
2672 name_end = end;
2673 r = 0;
2674 if (PEND) {
2675 return ONIGERR_EMPTY_GROUP_NAME;
2676 }
2677 else {
2678 PFETCH(c);
2679 if (c == end_code)
2680 return ONIGERR_EMPTY_GROUP_NAME;
2681
2682 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2683 is_num = 1;
2684 }
2685 else if (c == '-') {
2686 is_num = 2;
2687 sign = -1;
2688 pnum_head = p;
2689 }
2690 else if (!ONIGENC_IS_CODE_NAME(enc, c)) {
2691 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2692 }
2693 }
2694
2695 while (!PEND) {
2696 name_end = p;
2697 PFETCH(c);
2698 if (c == end_code || c == ')' || c == '+' || c == '-') {
2699 if (is_num == 2) r = ONIGERR_INVALID_GROUP_NAME;
2700 break;
2701 }
2702
2703 if (is_num != 0) {
2704 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2705 is_num = 1;
2706 }
2707 else {
2708 r = ONIGERR_INVALID_GROUP_NAME;
2709 is_num = 0;
2710 }
2711 }
2712 else if (!ONIGENC_IS_CODE_NAME(enc, c)) {
2713 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2714 }
2715 }
2716
2717 if (r == 0 && c != end_code) {
2718 if (c == '+' || c == '-') {
2719 int level;
2720 int flag = (c == '-' ? -1 : 1);
2721
2722 if (PEND) {
2723 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2724 goto end;
2725 }
2726 PFETCH(c);
2727 if (! ONIGENC_IS_CODE_DIGIT(enc, c)) goto err;
2728 PUNFETCH;
2729 level = onig_scan_unsigned_number(&p, end, enc);
2730 if (level < 0) return ONIGERR_TOO_BIG_NUMBER;
2731 *rlevel = (level * flag);
2732 exist_level = 1;
2733
2734 if (!PEND) {
2735 PFETCH(c);
2736 if (c == end_code)
2737 goto end;
2738 }
2739 }
2740
2741 err:
2742 r = ONIGERR_INVALID_GROUP_NAME;
2743 name_end = end;
2744 }
2745
2746 end:
2747 if (r == 0) {
2748 if (is_num != 0) {
2749 *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc);
2750 if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER;
2751 else if (*rback_num == 0) goto err;
2752
2753 *rback_num *= sign;
2754 }
2755
2756 *rname_end = name_end;
2757 *src = p;
2758 return (exist_level ? 1 : 0);
2759 }
2760 else {
2761 onig_scan_env_set_error_string(env, r, *src, name_end);
2762 return r;
2763 }
2764}
2765# endif /* USE_BACKREF_WITH_LEVEL */
2766
2767/*
2768 ref: 0 -> define name (don't allow number name)
2769 1 -> reference name (allow number name)
2770*/
2771static int
2772fetch_name(OnigCodePoint start_code, UChar** src, UChar* end,
2773 UChar** rname_end, ScanEnv* env, int* rback_num, int ref)
2774{
2775 int r, is_num, sign;
2776 OnigCodePoint end_code;
2777 OnigCodePoint c = 0;
2778 OnigEncoding enc = env->enc;
2779 UChar *name_end;
2780 UChar *pnum_head;
2781 UChar *p = *src;
2782
2783 *rback_num = 0;
2784
2785 end_code = get_name_end_code_point(start_code);
2786
2787 name_end = end;
2788 pnum_head = *src;
2789 r = 0;
2790 is_num = 0;
2791 sign = 1;
2792 if (PEND) {
2793 return ONIGERR_EMPTY_GROUP_NAME;
2794 }
2795 else {
2796 PFETCH_S(c);
2797 if (c == end_code)
2798 return ONIGERR_EMPTY_GROUP_NAME;
2799
2800 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2801 if (ref == 1)
2802 is_num = 1;
2803 else {
2804 r = ONIGERR_INVALID_GROUP_NAME;
2805 is_num = 0;
2806 }
2807 }
2808 else if (c == '-') {
2809 if (ref == 1) {
2810 is_num = 2;
2811 sign = -1;
2812 pnum_head = p;
2813 }
2814 else {
2815 r = ONIGERR_INVALID_GROUP_NAME;
2816 is_num = 0;
2817 }
2818 }
2819 else if (!ONIGENC_IS_CODE_NAME(enc, c)) {
2820 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2821 }
2822 }
2823
2824 if (r == 0) {
2825 while (!PEND) {
2826 name_end = p;
2827 PFETCH_S(c);
2828 if (c == end_code || c == ')') {
2829 if (is_num == 2) {
2830 r = ONIGERR_INVALID_GROUP_NAME;
2831 goto teardown;
2832 }
2833 break;
2834 }
2835
2836 if (is_num != 0) {
2837 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2838 is_num = 1;
2839 }
2840 else {
2841 if (!ONIGENC_IS_CODE_WORD(enc, c))
2842 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2843 else
2844 r = ONIGERR_INVALID_GROUP_NAME;
2845 goto teardown;
2846 }
2847 }
2848 else {
2849 if (!ONIGENC_IS_CODE_NAME(enc, c)) {
2850 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2851 goto teardown;
2852 }
2853 }
2854 }
2855
2856 if (c != end_code) {
2857 r = ONIGERR_INVALID_GROUP_NAME;
2858 name_end = end;
2859 goto err;
2860 }
2861
2862 if (is_num != 0) {
2863 *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc);
2864 if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER;
2865 else if (*rback_num == 0) {
2866 r = ONIGERR_INVALID_GROUP_NAME;
2867 goto err;
2868 }
2869
2870 *rback_num *= sign;
2871 }
2872
2873 *rname_end = name_end;
2874 *src = p;
2875 return 0;
2876 }
2877 else {
2878teardown:
2879 while (!PEND) {
2880 name_end = p;
2881 PFETCH_S(c);
2882 if (c == end_code || c == ')')
2883 break;
2884 }
2885 if (PEND)
2886 name_end = end;
2887
2888 err:
2889 onig_scan_env_set_error_string(env, r, *src, name_end);
2890 return r;
2891 }
2892}
2893#else
2894static int
2895fetch_name(OnigCodePoint start_code, UChar** src, UChar* end,
2896 UChar** rname_end, ScanEnv* env, int* rback_num, int ref)
2897{
2898 int r, is_num, sign;
2899 OnigCodePoint end_code;
2900 OnigCodePoint c = 0;
2901 UChar *name_end;
2902 OnigEncoding enc = env->enc;
2903 UChar *pnum_head;
2904 UChar *p = *src;
2905 PFETCH_READY;
2906
2907 *rback_num = 0;
2908
2909 end_code = get_name_end_code_point(start_code);
2910
2911 *rname_end = name_end = end;
2912 r = 0;
2913 pnum_head = *src;
2914 is_num = 0;
2915 sign = 1;
2916
2917 if (PEND) {
2918 return ONIGERR_EMPTY_GROUP_NAME;
2919 }
2920 else {
2921 PFETCH(c);
2922 if (c == end_code)
2923 return ONIGERR_EMPTY_GROUP_NAME;
2924
2925 if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2926 is_num = 1;
2927 }
2928 else if (c == '-') {
2929 is_num = 2;
2930 sign = -1;
2931 pnum_head = p;
2932 }
2933 else {
2934 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2935 }
2936 }
2937
2938 while (!PEND) {
2939 name_end = p;
2940
2941 PFETCH(c);
2942 if (c == end_code || c == ')') break;
2943 if (! ONIGENC_IS_CODE_DIGIT(enc, c))
2944 r = ONIGERR_INVALID_CHAR_IN_GROUP_NAME;
2945 }
2946 if (r == 0 && c != end_code) {
2947 r = ONIGERR_INVALID_GROUP_NAME;
2948 name_end = end;
2949 }
2950
2951 if (r == 0) {
2952 *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc);
2953 if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER;
2954 else if (*rback_num == 0) {
2955 r = ONIGERR_INVALID_GROUP_NAME;
2956 goto err;
2957 }
2958 *rback_num *= sign;
2959
2960 *rname_end = name_end;
2961 *src = p;
2962 return 0;
2963 }
2964 else {
2965 err:
2966 onig_scan_env_set_error_string(env, r, *src, name_end);
2967 return r;
2968 }
2969}
2970#endif /* USE_NAMED_GROUP */
2971
2972
2973#ifdef PRINTF_ARGS
2974PRINTF_ARGS(static void onig_syntax_warn(ScanEnv *env, const char *fmt, ...), 2, 3);
2975#endif
2976
2977static void
2978onig_syntax_warn(ScanEnv *env, const char *fmt, ...)
2979{
2980 va_list args;
2981 UChar buf[WARN_BUFSIZE];
2982 va_start(args, fmt);
2983 onig_vsnprintf_with_pattern(buf, WARN_BUFSIZE, env->enc,
2984 env->pattern, env->pattern_end,
2985 fmt, args);
2986 va_end(args);
2987#ifdef RUBY
2988 if (env->sourcefile == NULL)
2989 rb_warn("%s", (char *)buf);
2990 else
2991 rb_compile_warn(env->sourcefile, env->sourceline, "%s", (char *)buf);
2992#else
2993 (*onig_warn)((char* )buf);
2994#endif
2995}
2996
2997static void
2998CC_ESC_WARN(ScanEnv *env, UChar *c)
2999{
3000 if (onig_warn == onig_null_warn) return ;
3001
3002 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_WARN_CC_OP_NOT_ESCAPED) &&
3003 IS_SYNTAX_BV(env->syntax, ONIG_SYN_BACKSLASH_ESCAPE_IN_CC)) {
3004 onig_syntax_warn(env, "character class has '%s' without escape", c);
3005 }
3006}
3007
3008static void
3009CLOSE_BRACKET_WITHOUT_ESC_WARN(ScanEnv* env, UChar* c)
3010{
3011 if (onig_warn == onig_null_warn) return ;
3012
3013 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_WARN_CC_OP_NOT_ESCAPED)) {
3014 onig_syntax_warn(env, "regular expression has '%s' without escape", c);
3015 }
3016}
3017
3018#ifndef RTEST
3019# define RTEST(v) 1
3020#endif
3021
3022static void
3023CC_DUP_WARN(ScanEnv *env, OnigCodePoint from ARG_UNUSED, OnigCodePoint to ARG_UNUSED)
3024{
3025 if (onig_warn == onig_null_warn || !RTEST(ruby_verbose)) return ;
3026
3027 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_WARN_CC_DUP) &&
3028 !(env->warnings_flag & ONIG_SYN_WARN_CC_DUP)) {
3029#ifdef WARN_ALL_CC_DUP
3030 onig_syntax_warn(env, "character class has duplicated range: %04x-%04x", from, to);
3031#else
3032 env->warnings_flag |= ONIG_SYN_WARN_CC_DUP;
3033 onig_syntax_warn(env, "character class has duplicated range");
3034#endif
3035 }
3036}
3037
3038static void
3039UNKNOWN_ESC_WARN(ScanEnv *env, int c)
3040{
3041 if (onig_warn == onig_null_warn || !RTEST(ruby_verbose)) return ;
3042 onig_syntax_warn(env, "Unknown escape \\%c is ignored", c);
3043}
3044
3045static UChar*
3046find_str_position(OnigCodePoint s[], int n, UChar* from, UChar* to,
3047 UChar **next, OnigEncoding enc)
3048{
3049 int i;
3050 OnigCodePoint x;
3051 UChar *q;
3052 UChar *p = from;
3053
3054 while (p < to) {
3055 x = ONIGENC_MBC_TO_CODE(enc, p, to);
3056 q = p + enclen(enc, p, to);
3057 if (x == s[0]) {
3058 for (i = 1; i < n && q < to; i++) {
3059 x = ONIGENC_MBC_TO_CODE(enc, q, to);
3060 if (x != s[i]) break;
3061 q += enclen(enc, q, to);
3062 }
3063 if (i >= n) {
3064 if (IS_NOT_NULL(next))
3065 *next = q;
3066 return p;
3067 }
3068 }
3069 p = q;
3070 }
3071 return NULL_UCHARP;
3072}
3073
3074static int
3075str_exist_check_with_esc(OnigCodePoint s[], int n, UChar* from, UChar* to,
3076 OnigCodePoint bad, OnigEncoding enc, const OnigSyntaxType* syn)
3077{
3078 int i, in_esc;
3079 OnigCodePoint x;
3080 UChar *q;
3081 UChar *p = from;
3082
3083 in_esc = 0;
3084 while (p < to) {
3085 if (in_esc) {
3086 in_esc = 0;
3087 p += enclen(enc, p, to);
3088 }
3089 else {
3090 x = ONIGENC_MBC_TO_CODE(enc, p, to);
3091 q = p + enclen(enc, p, to);
3092 if (x == s[0]) {
3093 for (i = 1; i < n && q < to; i++) {
3094 x = ONIGENC_MBC_TO_CODE(enc, q, to);
3095 if (x != s[i]) break;
3096 q += enclen(enc, q, to);
3097 }
3098 if (i >= n) return 1;
3099 p += enclen(enc, p, to);
3100 }
3101 else {
3102 x = ONIGENC_MBC_TO_CODE(enc, p, to);
3103 if (x == bad) return 0;
3104 else if (x == MC_ESC(syn)) in_esc = 1;
3105 p = q;
3106 }
3107 }
3108 }
3109 return 0;
3110}
3111
3112static int
3113fetch_token_in_cc(OnigToken* tok, UChar** src, UChar* end, ScanEnv* env)
3114{
3115 int num;
3116 OnigCodePoint c, c2;
3117 const OnigSyntaxType* syn = env->syntax;
3118 OnigEncoding enc = env->enc;
3119 UChar* prev;
3120 UChar* p = *src;
3121 PFETCH_READY;
3122
3123 if (PEND) {
3124 tok->type = TK_EOT;
3125 return tok->type;
3126 }
3127
3128 PFETCH(c);
3129 tok->type = TK_CHAR;
3130 tok->base = 0;
3131 tok->u.c = c;
3132 tok->escaped = 0;
3133
3134 if (c == ']') {
3135 tok->type = TK_CC_CLOSE;
3136 }
3137 else if (c == '-') {
3138 tok->type = TK_CC_RANGE;
3139 }
3140 else if (c == MC_ESC(syn)) {
3141 if (! IS_SYNTAX_BV(syn, ONIG_SYN_BACKSLASH_ESCAPE_IN_CC))
3142 goto end;
3143
3144 if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE;
3145
3146 PFETCH(c);
3147 tok->escaped = 1;
3148 tok->u.c = c;
3149 switch (c) {
3150 case 'w':
3151 tok->type = TK_CHAR_TYPE;
3152 tok->u.prop.ctype = ONIGENC_CTYPE_WORD;
3153 tok->u.prop.not = 0;
3154 break;
3155 case 'W':
3156 tok->type = TK_CHAR_TYPE;
3157 tok->u.prop.ctype = ONIGENC_CTYPE_WORD;
3158 tok->u.prop.not = 1;
3159 break;
3160 case 'd':
3161 tok->type = TK_CHAR_TYPE;
3162 tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT;
3163 tok->u.prop.not = 0;
3164 break;
3165 case 'D':
3166 tok->type = TK_CHAR_TYPE;
3167 tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT;
3168 tok->u.prop.not = 1;
3169 break;
3170 case 's':
3171 tok->type = TK_CHAR_TYPE;
3172 tok->u.prop.ctype = ONIGENC_CTYPE_SPACE;
3173 tok->u.prop.not = 0;
3174 break;
3175 case 'S':
3176 tok->type = TK_CHAR_TYPE;
3177 tok->u.prop.ctype = ONIGENC_CTYPE_SPACE;
3178 tok->u.prop.not = 1;
3179 break;
3180 case 'h':
3181 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3182 tok->type = TK_CHAR_TYPE;
3183 tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3184 tok->u.prop.not = 0;
3185 break;
3186 case 'H':
3187 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3188 tok->type = TK_CHAR_TYPE;
3189 tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3190 tok->u.prop.not = 1;
3191 break;
3192
3193 case 'p':
3194 case 'P':
3195 if (PEND) break;
3196
3197 c2 = PPEEK;
3198 if (c2 == '{' &&
3199 IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY)) {
3200 PINC;
3201 tok->type = TK_CHAR_PROPERTY;
3202 tok->u.prop.not = (c == 'P' ? 1 : 0);
3203
3204 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT)) {
3205 PFETCH(c2);
3206 if (c2 == '^') {
3207 tok->u.prop.not = (tok->u.prop.not == 0 ? 1 : 0);
3208 }
3209 else
3210 PUNFETCH;
3211 }
3212 }
3213 else {
3214 onig_syntax_warn(env, "invalid Unicode Property \\%c", c);
3215 }
3216 break;
3217
3218 case 'x':
3219 if (PEND) break;
3220
3221 prev = p;
3222 if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_BRACE_HEX8)) {
3223 PINC;
3224 num = scan_unsigned_hexadecimal_number(&p, end, 0, 8, enc);
3225 if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3226 if (!PEND) {
3227 c2 = PPEEK;
3228 if (ONIGENC_IS_CODE_XDIGIT(enc, c2))
3229 return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE;
3230 }
3231
3232 if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) {
3233 PINC;
3234 tok->type = TK_CODE_POINT;
3235 tok->base = 16;
3236 tok->u.code = (OnigCodePoint )num;
3237 }
3238 else {
3239 /* can't read nothing or invalid format */
3240 p = prev;
3241 }
3242 }
3243 else if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_HEX2)) {
3244 num = scan_unsigned_hexadecimal_number(&p, end, 0, 2, enc);
3245 if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3246 if (p == prev) { /* can't read nothing. */
3247 num = 0; /* but, it's not error */
3248 }
3249 tok->type = TK_RAW_BYTE;
3250 tok->base = 16;
3251 tok->u.c = num;
3252 }
3253 break;
3254
3255 case 'u':
3256 if (PEND) break;
3257
3258 prev = p;
3259 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_U_HEX4)) {
3260 num = scan_unsigned_hexadecimal_number(&p, end, 4, 4, enc);
3261 if (num < -1) return ONIGERR_TOO_SHORT_DIGITS;
3262 else if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3263 if (p == prev) { /* can't read nothing. */
3264 num = 0; /* but, it's not error */
3265 }
3266 tok->type = TK_CODE_POINT;
3267 tok->base = 16;
3268 tok->u.code = (OnigCodePoint )num;
3269 }
3270 break;
3271
3272 case 'o':
3273 if (PEND) break;
3274
3275 prev = p;
3276 if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_O_BRACE_OCTAL)) {
3277 PINC;
3278 num = scan_unsigned_octal_number(&p, end, 11, enc);
3279 if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3280 if (!PEND) {
3281 c2 = PPEEK;
3282 if (ONIGENC_IS_CODE_DIGIT(enc, c2) && c2 < '8')
3283 return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE;
3284 }
3285
3286 if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) {
3287 PINC;
3288 tok->type = TK_CODE_POINT;
3289 tok->base = 8;
3290 tok->u.code = (OnigCodePoint )num;
3291 }
3292 else {
3293 /* can't read nothing or invalid format */
3294 p = prev;
3295 }
3296 }
3297 break;
3298
3299 case '0':
3300 case '1': case '2': case '3': case '4': case '5': case '6': case '7':
3301 if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_OCTAL3)) {
3302 PUNFETCH;
3303 prev = p;
3304 num = scan_unsigned_octal_number(&p, end, 3, enc);
3305 if (num < 0 || 0xff < num) return ONIGERR_TOO_BIG_NUMBER;
3306 if (p == prev) { /* can't read nothing. */
3307 num = 0; /* but, it's not error */
3308 }
3309 tok->type = TK_RAW_BYTE;
3310 tok->base = 8;
3311 tok->u.c = num;
3312 }
3313 break;
3314
3315 default:
3316 PUNFETCH;
3317 num = fetch_escaped_value(&p, end, env, &c2);
3318 if (num < 0) return num;
3319 if ((OnigCodePoint )tok->u.c != c2) {
3320 tok->u.code = (OnigCodePoint )c2;
3321 tok->type = TK_CODE_POINT;
3322 }
3323 break;
3324 }
3325 }
3326 else if (c == '[') {
3327 if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_POSIX_BRACKET) && (PPEEK_IS(':'))) {
3328 OnigCodePoint send[] = { (OnigCodePoint )':', (OnigCodePoint )']' };
3329 tok->backp = p; /* point at '[' is read */
3330 PINC;
3331 if (str_exist_check_with_esc(send, 2, p, end,
3332 (OnigCodePoint )']', enc, syn)) {
3333 tok->type = TK_POSIX_BRACKET_OPEN;
3334 }
3335 else {
3336 PUNFETCH;
3337 goto cc_in_cc;
3338 }
3339 }
3340 else {
3341 cc_in_cc:
3342 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_CCLASS_SET_OP)) {
3343 tok->type = TK_CC_CC_OPEN;
3344 }
3345 else {
3346 CC_ESC_WARN(env, (UChar* )"[");
3347 }
3348 }
3349 }
3350 else if (c == '&') {
3351 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_CCLASS_SET_OP) &&
3352 !PEND && (PPEEK_IS('&'))) {
3353 PINC;
3354 tok->type = TK_CC_AND;
3355 }
3356 }
3357
3358 end:
3359 *src = p;
3360 return tok->type;
3361}
3362
3363#ifdef USE_NAMED_GROUP
3364static int
3365fetch_named_backref_token(OnigCodePoint c, OnigToken* tok, UChar** src,
3366 UChar* end, ScanEnv* env)
3367{
3368 int r, num;
3369 const OnigSyntaxType* syn = env->syntax;
3370 UChar* prev;
3371 UChar* p = *src;
3372 UChar* name_end;
3373 int* backs;
3374 int back_num;
3375
3376 prev = p;
3377
3378# ifdef USE_BACKREF_WITH_LEVEL
3379 name_end = NULL_UCHARP; /* no need. escape gcc warning. */
3380 r = fetch_name_with_level(c, &p, end, &name_end,
3381 env, &back_num, &tok->u.backref.level);
3382 if (r == 1) tok->u.backref.exist_level = 1;
3383 else tok->u.backref.exist_level = 0;
3384# else
3385 r = fetch_name(&p, end, &name_end, env, &back_num, 1);
3386# endif
3387 if (r < 0) return r;
3388
3389 if (back_num != 0) {
3390 if (back_num < 0) {
3391 back_num = BACKREF_REL_TO_ABS(back_num, env);
3392 if (back_num <= 0)
3393 return ONIGERR_INVALID_BACKREF;
3394 }
3395
3396 if (IS_SYNTAX_BV(syn, ONIG_SYN_STRICT_CHECK_BACKREF)) {
3397 if (back_num > env->num_mem ||
3398 IS_NULL(SCANENV_MEM_NODES(env)[back_num]))
3399 return ONIGERR_INVALID_BACKREF;
3400 }
3401 tok->type = TK_BACKREF;
3402 tok->u.backref.by_name = 0;
3403 tok->u.backref.num = 1;
3404 tok->u.backref.ref1 = back_num;
3405 }
3406 else {
3407 num = onig_name_to_group_numbers(env->reg, prev, name_end, &backs);
3408 if (num <= 0) {
3409 onig_scan_env_set_error_string(env,
3410 ONIGERR_UNDEFINED_NAME_REFERENCE, prev, name_end);
3411 return ONIGERR_UNDEFINED_NAME_REFERENCE;
3412 }
3413 if (IS_SYNTAX_BV(syn, ONIG_SYN_STRICT_CHECK_BACKREF)) {
3414 int i;
3415 for (i = 0; i < num; i++) {
3416 if (backs[i] > env->num_mem ||
3417 IS_NULL(SCANENV_MEM_NODES(env)[backs[i]]))
3418 return ONIGERR_INVALID_BACKREF;
3419 }
3420 }
3421
3422 tok->type = TK_BACKREF;
3423 tok->u.backref.by_name = 1;
3424 if (num == 1 || IS_SYNTAX_BV(syn, ONIG_SYN_USE_LEFT_MOST_NAMED_GROUP)) {
3425 tok->u.backref.num = 1;
3426 tok->u.backref.ref1 = backs[0];
3427 }
3428 else {
3429 tok->u.backref.num = num;
3430 tok->u.backref.refs = backs;
3431 }
3432 }
3433 *src = p;
3434 return 0;
3435}
3436#endif
3437
3438static int
3439fetch_token(OnigToken* tok, UChar** src, UChar* end, ScanEnv* env)
3440{
3441 int r, num;
3442 OnigCodePoint c;
3443 OnigEncoding enc = env->enc;
3444 const OnigSyntaxType* syn = env->syntax;
3445 UChar* prev;
3446 UChar* p = *src;
3447 PFETCH_READY;
3448
3449 start:
3450 if (PEND) {
3451 tok->type = TK_EOT;
3452 return tok->type;
3453 }
3454
3455 tok->type = TK_STRING;
3456 tok->base = 0;
3457 tok->backp = p;
3458
3459 PFETCH(c);
3460 if (IS_MC_ESC_CODE(c, syn)) {
3461 if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE;
3462
3463 tok->backp = p;
3464 PFETCH(c);
3465
3466 tok->u.c = c;
3467 tok->escaped = 1;
3468 switch (c) {
3469 case '*':
3470 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_ASTERISK_ZERO_INF)) break;
3471 tok->type = TK_OP_REPEAT;
3472 tok->u.repeat.lower = 0;
3473 tok->u.repeat.upper = REPEAT_INFINITE;
3474 goto greedy_check;
3475 break;
3476
3477 case '+':
3478 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_PLUS_ONE_INF)) break;
3479 tok->type = TK_OP_REPEAT;
3480 tok->u.repeat.lower = 1;
3481 tok->u.repeat.upper = REPEAT_INFINITE;
3482 goto greedy_check;
3483 break;
3484
3485 case '?':
3486 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_QMARK_ZERO_ONE)) break;
3487 tok->type = TK_OP_REPEAT;
3488 tok->u.repeat.lower = 0;
3489 tok->u.repeat.upper = 1;
3490 greedy_check:
3491 if (!PEND && PPEEK_IS('?') &&
3492 IS_SYNTAX_OP(syn, ONIG_SYN_OP_QMARK_NON_GREEDY)) {
3493 PFETCH(c);
3494 tok->u.repeat.greedy = 0;
3495 tok->u.repeat.possessive = 0;
3496 }
3497 else {
3498 possessive_check:
3499 if (!PEND && PPEEK_IS('+') &&
3500 ((IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_PLUS_POSSESSIVE_REPEAT) &&
3501 tok->type != TK_INTERVAL) ||
3502 (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_PLUS_POSSESSIVE_INTERVAL) &&
3503 tok->type == TK_INTERVAL))) {
3504 PFETCH(c);
3505 tok->u.repeat.greedy = 1;
3506 tok->u.repeat.possessive = 1;
3507 }
3508 else {
3509 tok->u.repeat.greedy = 1;
3510 tok->u.repeat.possessive = 0;
3511 }
3512 }
3513 break;
3514
3515 case '{':
3516 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_BRACE_INTERVAL)) break;
3517 r = fetch_range_quantifier(&p, end, tok, env);
3518 if (r < 0) return r; /* error */
3519 if (r == 0) goto greedy_check;
3520 else if (r == 2) { /* {n} */
3521 if (IS_SYNTAX_BV(syn, ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY))
3522 goto possessive_check;
3523
3524 goto greedy_check;
3525 }
3526 /* r == 1 : normal char */
3527 break;
3528
3529 case '|':
3530 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_VBAR_ALT)) break;
3531 tok->type = TK_ALT;
3532 break;
3533
3534 case '(':
3535 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break;
3536 tok->type = TK_SUBEXP_OPEN;
3537 break;
3538
3539 case ')':
3540 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break;
3541 tok->type = TK_SUBEXP_CLOSE;
3542 break;
3543
3544 case 'w':
3545 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_W_WORD)) break;
3546 tok->type = TK_CHAR_TYPE;
3547 tok->u.prop.ctype = ONIGENC_CTYPE_WORD;
3548 tok->u.prop.not = 0;
3549 break;
3550
3551 case 'W':
3552 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_W_WORD)) break;
3553 tok->type = TK_CHAR_TYPE;
3554 tok->u.prop.ctype = ONIGENC_CTYPE_WORD;
3555 tok->u.prop.not = 1;
3556 break;
3557
3558 case 'b':
3559 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_B_WORD_BOUND)) break;
3560 tok->type = TK_ANCHOR;
3561 tok->u.anchor.subtype = ANCHOR_WORD_BOUND;
3562 tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option)
3563 && ! IS_WORD_BOUND_ALL_RANGE(env->option);
3564 break;
3565
3566 case 'B':
3567 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_B_WORD_BOUND)) break;
3568 tok->type = TK_ANCHOR;
3569 tok->u.anchor.subtype = ANCHOR_NOT_WORD_BOUND;
3570 tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option)
3571 && ! IS_WORD_BOUND_ALL_RANGE(env->option);
3572 break;
3573
3574#ifdef USE_WORD_BEGIN_END
3575 case '<':
3576 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END)) break;
3577 tok->type = TK_ANCHOR;
3578 tok->u.anchor.subtype = ANCHOR_WORD_BEGIN;
3579 tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option);
3580 break;
3581
3582 case '>':
3583 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END)) break;
3584 tok->type = TK_ANCHOR;
3585 tok->u.anchor.subtype = ANCHOR_WORD_END;
3586 tok->u.anchor.ascii_range = IS_ASCII_RANGE(env->option);
3587 break;
3588#endif
3589
3590 case 's':
3591 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_S_WHITE_SPACE)) break;
3592 tok->type = TK_CHAR_TYPE;
3593 tok->u.prop.ctype = ONIGENC_CTYPE_SPACE;
3594 tok->u.prop.not = 0;
3595 break;
3596
3597 case 'S':
3598 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_S_WHITE_SPACE)) break;
3599 tok->type = TK_CHAR_TYPE;
3600 tok->u.prop.ctype = ONIGENC_CTYPE_SPACE;
3601 tok->u.prop.not = 1;
3602 break;
3603
3604 case 'd':
3605 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_D_DIGIT)) break;
3606 tok->type = TK_CHAR_TYPE;
3607 tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT;
3608 tok->u.prop.not = 0;
3609 break;
3610
3611 case 'D':
3612 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_D_DIGIT)) break;
3613 tok->type = TK_CHAR_TYPE;
3614 tok->u.prop.ctype = ONIGENC_CTYPE_DIGIT;
3615 tok->u.prop.not = 1;
3616 break;
3617
3618 case 'h':
3619 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3620 tok->type = TK_CHAR_TYPE;
3621 tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3622 tok->u.prop.not = 0;
3623 break;
3624
3625 case 'H':
3626 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3627 tok->type = TK_CHAR_TYPE;
3628 tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3629 tok->u.prop.not = 1;
3630 break;
3631
3632 case 'A':
3633 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break;
3634 begin_buf:
3635 tok->type = TK_ANCHOR;
3636 tok->u.anchor.subtype = ANCHOR_BEGIN_BUF;
3637 break;
3638
3639 case 'Z':
3640 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break;
3641 tok->type = TK_ANCHOR;
3642 tok->u.anchor.subtype = ANCHOR_SEMI_END_BUF;
3643 break;
3644
3645 case 'z':
3646 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break;
3647 end_buf:
3648 tok->type = TK_ANCHOR;
3649 tok->u.anchor.subtype = ANCHOR_END_BUF;
3650 break;
3651
3652 case 'G':
3653 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_CAPITAL_G_BEGIN_ANCHOR)) break;
3654 tok->type = TK_ANCHOR;
3655 tok->u.anchor.subtype = ANCHOR_BEGIN_POSITION;
3656 break;
3657
3658 case '`':
3659 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_GNU_BUF_ANCHOR)) break;
3660 goto begin_buf;
3661 break;
3662
3663 case '\'':
3664 if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_GNU_BUF_ANCHOR)) break;
3665 goto end_buf;
3666 break;
3667
3668 case 'x':
3669 if (PEND) break;
3670
3671 prev = p;
3672 if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_BRACE_HEX8)) {
3673 PINC;
3674 num = scan_unsigned_hexadecimal_number(&p, end, 0, 8, enc);
3675 if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3676 if (!PEND) {
3677 if (ONIGENC_IS_CODE_XDIGIT(enc, PPEEK))
3678 return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE;
3679 }
3680
3681 if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) {
3682 PINC;
3683 tok->type = TK_CODE_POINT;
3684 tok->u.code = (OnigCodePoint )num;
3685 }
3686 else {
3687 /* can't read nothing or invalid format */
3688 p = prev;
3689 }
3690 }
3691 else if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_HEX2)) {
3692 num = scan_unsigned_hexadecimal_number(&p, end, 0, 2, enc);
3693 if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3694 if (p == prev) { /* can't read nothing. */
3695 num = 0; /* but, it's not error */
3696 }
3697 tok->type = TK_RAW_BYTE;
3698 tok->base = 16;
3699 tok->u.c = num;
3700 }
3701 break;
3702
3703 case 'u':
3704 if (PEND) break;
3705
3706 prev = p;
3707 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_U_HEX4)) {
3708 num = scan_unsigned_hexadecimal_number(&p, end, 4, 4, enc);
3709 if (num < -1) return ONIGERR_TOO_SHORT_DIGITS;
3710 else if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3711 if (p == prev) { /* can't read nothing. */
3712 num = 0; /* but, it's not error */
3713 }
3714 tok->type = TK_CODE_POINT;
3715 tok->base = 16;
3716 tok->u.code = (OnigCodePoint )num;
3717 }
3718 break;
3719
3720 case 'o':
3721 if (PEND) break;
3722
3723 prev = p;
3724 if (PPEEK_IS('{') && IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_O_BRACE_OCTAL)) {
3725 PINC;
3726 num = scan_unsigned_octal_number(&p, end, 11, enc);
3727 if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3728 if (!PEND) {
3729 OnigCodePoint c = PPEEK;
3730 if (ONIGENC_IS_CODE_DIGIT(enc, c) && c < '8')
3731 return ONIGERR_TOO_LONG_WIDE_CHAR_VALUE;
3732 }
3733
3734 if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) {
3735 PINC;
3736 tok->type = TK_CODE_POINT;
3737 tok->u.code = (OnigCodePoint )num;
3738 }
3739 else {
3740 /* can't read nothing or invalid format */
3741 p = prev;
3742 }
3743 }
3744 break;
3745
3746 case '1': case '2': case '3': case '4':
3747 case '5': case '6': case '7': case '8': case '9':
3748 PUNFETCH;
3749 prev = p;
3750 num = onig_scan_unsigned_number(&p, end, enc);
3751 if (num < 0 || num > ONIG_MAX_BACKREF_NUM) {
3752 goto skip_backref;
3753 }
3754
3755 if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_DECIMAL_BACKREF) &&
3756 (num <= env->num_mem || num <= 9)) { /* This spec. from GNU regex */
3757 if (IS_SYNTAX_BV(syn, ONIG_SYN_STRICT_CHECK_BACKREF)) {
3758 if (num > env->num_mem || IS_NULL(SCANENV_MEM_NODES(env)[num]))
3759 return ONIGERR_INVALID_BACKREF;
3760 }
3761
3762 tok->type = TK_BACKREF;
3763 tok->u.backref.num = 1;
3764 tok->u.backref.ref1 = num;
3765 tok->u.backref.by_name = 0;
3766#ifdef USE_BACKREF_WITH_LEVEL
3767 tok->u.backref.exist_level = 0;
3768#endif
3769 break;
3770 }
3771
3772 skip_backref:
3773 if (c == '8' || c == '9') {
3774 /* normal char */
3775 p = prev; PINC;
3776 break;
3777 }
3778
3779 p = prev;
3780 /* fall through */
3781 case '0':
3782 if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_OCTAL3)) {
3783 prev = p;
3784 num = scan_unsigned_octal_number(&p, end, (c == '0' ? 2:3), enc);
3785 if (num < 0 || 0xff < num) return ONIGERR_TOO_BIG_NUMBER;
3786 if (p == prev) { /* can't read nothing. */
3787 num = 0; /* but, it's not error */
3788 }
3789 tok->type = TK_RAW_BYTE;
3790 tok->base = 8;
3791 tok->u.c = num;
3792 }
3793 else if (c != '0') {
3794 PINC;
3795 }
3796 break;
3797
3798#ifdef USE_NAMED_GROUP
3799 case 'k':
3800 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_K_NAMED_BACKREF)) {
3801 PFETCH(c);
3802 if (c == '<' || c == '\'') {
3803 r = fetch_named_backref_token(c, tok, &p, end, env);
3804 if (r < 0) return r;
3805 }
3806 else {
3807 PUNFETCH;
3808 onig_syntax_warn(env, "invalid back reference");
3809 }
3810 }
3811 break;
3812#endif
3813
3814#if defined(USE_SUBEXP_CALL) || defined(USE_NAMED_GROUP)
3815 case 'g':
3816# ifdef USE_NAMED_GROUP
3817 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_G_BRACE_BACKREF)) {
3818 PFETCH(c);
3819 if (c == '{') {
3820 r = fetch_named_backref_token(c, tok, &p, end, env);
3821 if (r < 0) return r;
3822 }
3823 else
3824 PUNFETCH;
3825 }
3826# endif
3827# ifdef USE_SUBEXP_CALL
3828 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_G_SUBEXP_CALL)) {
3829 PFETCH(c);
3830 if (c == '<' || c == '\'') {
3831 int gnum = -1, rel = 0;
3832 UChar* name_end;
3833 OnigCodePoint cnext;
3834
3835 cnext = PPEEK;
3836 if (cnext == '0') {
3837 PINC;
3838 if (PPEEK_IS(get_name_end_code_point(c))) { /* \g<0>, \g'0' */
3839 PINC;
3840 name_end = p;
3841 gnum = 0;
3842 }
3843 }
3844 else if (cnext == '+') {
3845 PINC;
3846 rel = 1;
3847 }
3848 prev = p;
3849 if (gnum < 0) {
3850 r = fetch_name((OnigCodePoint )c, &p, end, &name_end, env, &gnum, 1);
3851 if (r < 0) return r;
3852 }
3853
3854 tok->type = TK_CALL;
3855 tok->u.call.name = prev;
3856 tok->u.call.name_end = name_end;
3857 tok->u.call.gnum = gnum;
3858 tok->u.call.rel = rel;
3859 }
3860 else {
3861 onig_syntax_warn(env, "invalid subexp call");
3862 PUNFETCH;
3863 }
3864 }
3865# endif
3866 break;
3867#endif
3868
3869 case 'Q':
3870 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_Q_QUOTE)) {
3871 tok->type = TK_QUOTE_OPEN;
3872 }
3873 break;
3874
3875 case 'p':
3876 case 'P':
3877 if (PPEEK_IS('{') &&
3878 IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY)) {
3879 PINC;
3880 tok->type = TK_CHAR_PROPERTY;
3881 tok->u.prop.not = (c == 'P' ? 1 : 0);
3882
3883 if (!PEND && IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT)) {
3884 PFETCH(c);
3885 if (c == '^') {
3886 tok->u.prop.not = (tok->u.prop.not == 0 ? 1 : 0);
3887 }
3888 else
3889 PUNFETCH;
3890 }
3891 }
3892 else {
3893 onig_syntax_warn(env, "invalid Unicode Property \\%c", c);
3894 }
3895 break;
3896
3897 case 'R':
3898 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_R_LINEBREAK)) {
3899 tok->type = TK_LINEBREAK;
3900 }
3901 break;
3902
3903 case 'X':
3904 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_X_EXTENDED_GRAPHEME_CLUSTER)) {
3905 tok->type = TK_EXTENDED_GRAPHEME_CLUSTER;
3906 }
3907 break;
3908
3909 case 'K':
3910 if (IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_CAPITAL_K_KEEP)) {
3911 tok->type = TK_KEEP;
3912 }
3913 break;
3914
3915 default:
3916 {
3917 OnigCodePoint c2;
3918
3919 PUNFETCH;
3920 num = fetch_escaped_value(&p, end, env, &c2);
3921 if (num < 0) return num;
3922 /* set_raw: */
3923 if ((OnigCodePoint )tok->u.c != c2) {
3924 tok->type = TK_CODE_POINT;
3925 tok->u.code = (OnigCodePoint )c2;
3926 }
3927 else { /* string */
3928 p = tok->backp + enclen(enc, tok->backp, end);
3929 }
3930 }
3931 break;
3932 }
3933 }
3934 else {
3935 tok->u.c = c;
3936 tok->escaped = 0;
3937
3938#ifdef USE_VARIABLE_META_CHARS
3939 if ((c != ONIG_INEFFECTIVE_META_CHAR) &&
3940 IS_SYNTAX_OP(syn, ONIG_SYN_OP_VARIABLE_META_CHARACTERS)) {
3941 if (c == MC_ANYCHAR(syn))
3942 goto any_char;
3943 else if (c == MC_ANYTIME(syn))
3944 goto anytime;
3945 else if (c == MC_ZERO_OR_ONE_TIME(syn))
3946 goto zero_or_one_time;
3947 else if (c == MC_ONE_OR_MORE_TIME(syn))
3948 goto one_or_more_time;
3949 else if (c == MC_ANYCHAR_ANYTIME(syn)) {
3950 tok->type = TK_ANYCHAR_ANYTIME;
3951 goto out;
3952 }
3953 }
3954#endif
3955
3956 switch (c) {
3957 case '.':
3958 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_DOT_ANYCHAR)) break;
3959#ifdef USE_VARIABLE_META_CHARS
3960 any_char:
3961#endif
3962 tok->type = TK_ANYCHAR;
3963 break;
3964
3965 case '*':
3966 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ASTERISK_ZERO_INF)) break;
3967#ifdef USE_VARIABLE_META_CHARS
3968 anytime:
3969#endif
3970 tok->type = TK_OP_REPEAT;
3971 tok->u.repeat.lower = 0;
3972 tok->u.repeat.upper = REPEAT_INFINITE;
3973 goto greedy_check;
3974 break;
3975
3976 case '+':
3977 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_PLUS_ONE_INF)) break;
3978#ifdef USE_VARIABLE_META_CHARS
3979 one_or_more_time:
3980#endif
3981 tok->type = TK_OP_REPEAT;
3982 tok->u.repeat.lower = 1;
3983 tok->u.repeat.upper = REPEAT_INFINITE;
3984 goto greedy_check;
3985 break;
3986
3987 case '?':
3988 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_QMARK_ZERO_ONE)) break;
3989#ifdef USE_VARIABLE_META_CHARS
3990 zero_or_one_time:
3991#endif
3992 tok->type = TK_OP_REPEAT;
3993 tok->u.repeat.lower = 0;
3994 tok->u.repeat.upper = 1;
3995 goto greedy_check;
3996 break;
3997
3998 case '{':
3999 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_BRACE_INTERVAL)) break;
4000 r = fetch_range_quantifier(&p, end, tok, env);
4001 if (r < 0) return r; /* error */
4002 if (r == 0) goto greedy_check;
4003 else if (r == 2) { /* {n} */
4004 if (IS_SYNTAX_BV(syn, ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY))
4005 goto possessive_check;
4006
4007 goto greedy_check;
4008 }
4009 /* r == 1 : normal char */
4010 break;
4011
4012 case '|':
4013 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_VBAR_ALT)) break;
4014 tok->type = TK_ALT;
4015 break;
4016
4017 case '(':
4018 if (PPEEK_IS('?') &&
4019 IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_QMARK_GROUP_EFFECT)) {
4020 PINC;
4021 if (PPEEK_IS('#')) {
4022 PFETCH(c);
4023 while (1) {
4024 if (PEND) return ONIGERR_END_PATTERN_IN_GROUP;
4025 PFETCH(c);
4026 if (c == MC_ESC(syn)) {
4027 if (!PEND) PFETCH(c);
4028 }
4029 else {
4030 if (c == ')') break;
4031 }
4032 }
4033 goto start;
4034 }
4035#ifdef USE_PERL_SUBEXP_CALL
4036 /* (?&name), (?n), (?R), (?0), (?+n), (?-n) */
4037 c = PPEEK;
4038 if ((c == '&' || c == 'R' || ONIGENC_IS_CODE_DIGIT(enc, c)) &&
4039 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_SUBEXP_CALL)) {
4040 /* (?&name), (?n), (?R), (?0) */
4041 int gnum;
4042 UChar *name;
4043 UChar *name_end;
4044
4045 if (c == 'R' || c == '0') {
4046 PINC; /* skip 'R' / '0' */
4047 if (!PPEEK_IS(')')) {
4048 r = ONIGERR_INVALID_GROUP_NAME;
4049 onig_scan_env_set_error_string(env, r, p - 1, p + 1);
4050 return r;
4051 }
4052 PINC; /* skip ')' */
4053 name_end = name = p;
4054 gnum = 0;
4055 }
4056 else {
4057 int numref = 1;
4058 if (c == '&') { /* (?&name) */
4059 PINC;
4060 numref = 0; /* don't allow number name */
4061 }
4062 name = p;
4063 r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &gnum, numref);
4064 if (r < 0) return r;
4065 }
4066
4067 tok->type = TK_CALL;
4068 tok->u.call.name = name;
4069 tok->u.call.name_end = name_end;
4070 tok->u.call.gnum = gnum;
4071 tok->u.call.rel = 0;
4072 break;
4073 }
4074 else if ((c == '-' || c == '+') &&
4075 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_SUBEXP_CALL)) {
4076 /* (?+n), (?-n) */
4077 int gnum;
4078 UChar *name;
4079 UChar *name_end;
4080 OnigCodePoint cnext;
4081 PFETCH_READY;
4082
4083 PINC; /* skip '-' / '+' */
4084 cnext = PPEEK;
4085 if (ONIGENC_IS_CODE_DIGIT(enc, cnext)) {
4086 if (c == '-') PUNFETCH;
4087 name = p;
4088 r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &gnum, 1);
4089 if (r < 0) return r;
4090
4091 tok->type = TK_CALL;
4092 tok->u.call.name = name;
4093 tok->u.call.name_end = name_end;
4094 tok->u.call.gnum = gnum;
4095 tok->u.call.rel = 1;
4096 break;
4097 }
4098 }
4099#endif /* USE_PERL_SUBEXP_CALL */
4100#ifdef USE_CAPITAL_P_NAMED_GROUP
4101 if (PPEEK_IS('P') &&
4102 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_CAPITAL_P_NAMED_GROUP)) {
4103 int gnum;
4104 UChar *name;
4105 UChar *name_end;
4106 PFETCH_READY;
4107
4108 PINC; /* skip 'P' */
4109 if (PEND) return ONIGERR_UNDEFINED_GROUP_OPTION;
4110 PFETCH(c);
4111 if (c == '=') { /* (?P=name): backref */
4112 r = fetch_named_backref_token((OnigCodePoint )'(', tok, &p, end, env);
4113 if (r < 0) return r;
4114 break;
4115 }
4116 else if (c == '>') { /* (?P>name): subexp call */
4117 name = p;
4118 r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &gnum, 0);
4119 if (r < 0) return r;
4120
4121 tok->type = TK_CALL;
4122 tok->u.call.name = name;
4123 tok->u.call.name_end = name_end;
4124 tok->u.call.gnum = gnum;
4125 tok->u.call.rel = 0;
4126 break;
4127 }
4128 }
4129#endif /* USE_CAPITAL_P_NAMED_GROUP */
4130 PUNFETCH;
4131 }
4132
4133 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break;
4134 tok->type = TK_SUBEXP_OPEN;
4135 break;
4136
4137 case ')':
4138 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break;
4139 tok->type = TK_SUBEXP_CLOSE;
4140 break;
4141
4142 case '^':
4143 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break;
4144 tok->type = TK_ANCHOR;
4145 tok->u.anchor.subtype = (IS_SINGLELINE(env->option)
4146 ? ANCHOR_BEGIN_BUF : ANCHOR_BEGIN_LINE);
4147 break;
4148
4149 case '$':
4150 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break;
4151 tok->type = TK_ANCHOR;
4152 tok->u.anchor.subtype = (IS_SINGLELINE(env->option)
4153 ? ANCHOR_SEMI_END_BUF : ANCHOR_END_LINE);
4154 break;
4155
4156 case '[':
4157 if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_BRACKET_CC)) break;
4158 tok->type = TK_CC_OPEN;
4159 break;
4160
4161 case ']':
4162 if (*src > env->pattern) /* /].../ is allowed. */
4163 CLOSE_BRACKET_WITHOUT_ESC_WARN(env, (UChar* )"]");
4164 break;
4165
4166 case '#':
4167 if (IS_EXTEND(env->option)) {
4168 while (!PEND) {
4169 PFETCH(c);
4170 if (ONIGENC_IS_CODE_NEWLINE(enc, c))
4171 break;
4172 }
4173 goto start;
4174 break;
4175 }
4176 break;
4177
4178 case ' ': case '\t': case '\n': case '\r': case '\f':
4179 if (IS_EXTEND(env->option))
4180 goto start;
4181 break;
4182
4183 default:
4184 /* string */
4185 break;
4186 }
4187 }
4188
4189#ifdef USE_VARIABLE_META_CHARS
4190 out:
4191#endif
4192 *src = p;
4193 return tok->type;
4194}
4195
4196static int
4197add_ctype_to_cc_by_range(CClassNode* cc, int ctype ARG_UNUSED, int not,
4198 ScanEnv* env,
4199 OnigCodePoint sb_out, const OnigCodePoint mbr[])
4200{
4201 int i, r;
4202 OnigCodePoint j;
4203
4204 int n = ONIGENC_CODE_RANGE_NUM(mbr);
4205
4206 if (not == 0) {
4207 for (i = 0; i < n; i++) {
4208 for (j = ONIGENC_CODE_RANGE_FROM(mbr, i);
4209 j <= ONIGENC_CODE_RANGE_TO(mbr, i); j++) {
4210 if (j >= sb_out) {
4211 if (j > ONIGENC_CODE_RANGE_FROM(mbr, i)) {
4212 r = add_code_range_to_buf(&(cc->mbuf), env, j,
4213 ONIGENC_CODE_RANGE_TO(mbr, i));
4214 if (r != 0) return r;
4215 i++;
4216 }
4217
4218 goto sb_end;
4219 }
4220 BITSET_SET_BIT_CHKDUP(cc->bs, j);
4221 }
4222 }
4223
4224 sb_end:
4225 for ( ; i < n; i++) {
4226 r = add_code_range_to_buf(&(cc->mbuf), env,
4227 ONIGENC_CODE_RANGE_FROM(mbr, i),
4228 ONIGENC_CODE_RANGE_TO(mbr, i));
4229 if (r != 0) return r;
4230 }
4231 }
4232 else {
4233 OnigCodePoint prev = 0;
4234
4235 for (i = 0; i < n; i++) {
4236 for (j = prev;
4237 j < ONIGENC_CODE_RANGE_FROM(mbr, i); j++) {
4238 if (j >= sb_out) {
4239 goto sb_end2;
4240 }
4241 BITSET_SET_BIT_CHKDUP(cc->bs, j);
4242 }
4243 prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1;
4244 }
4245 for (j = prev; j < sb_out; j++) {
4246 BITSET_SET_BIT_CHKDUP(cc->bs, j);
4247 }
4248
4249 sb_end2:
4250 prev = sb_out;
4251
4252 for (i = 0; i < n; i++) {
4253 if (prev < ONIGENC_CODE_RANGE_FROM(mbr, i)) {
4254 r = add_code_range_to_buf(&(cc->mbuf), env, prev,
4255 ONIGENC_CODE_RANGE_FROM(mbr, i) - 1);
4256 if (r != 0) return r;
4257 }
4258 prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1;
4259 }
4260 if (prev < 0x7fffffff) {
4261 r = add_code_range_to_buf(&(cc->mbuf), env, prev, 0x7fffffff);
4262 if (r != 0) return r;
4263 }
4264 }
4265
4266 return 0;
4267}
4268
4269static int
4270add_ctype_to_cc(CClassNode* cc, int ctype, int not, int ascii_range, ScanEnv* env)
4271{
4272 int maxcode;
4273 int c, r;
4274 const OnigCodePoint *ranges;
4275 OnigCodePoint sb_out;
4276 OnigEncoding enc = env->enc;
4277
4278 r = ONIGENC_GET_CTYPE_CODE_RANGE(enc, ctype, &sb_out, &ranges);
4279 if (r == 0) {
4280 if (ascii_range) {
4281 CClassNode ccwork;
4282 initialize_cclass(&ccwork);
4283 r = add_ctype_to_cc_by_range(&ccwork, ctype, not, env, sb_out,
4284 ranges);
4285 if (r == 0) {
4286 if (not) {
4287 r = add_code_range_to_buf0(&(ccwork.mbuf), env, 0x80, ONIG_LAST_CODE_POINT, FALSE);
4288 }
4289 else {
4290 CClassNode ccascii;
4291 initialize_cclass(&ccascii);
4292 if (ONIGENC_MBC_MINLEN(env->enc) > 1) {
4293 r = add_code_range(&(ccascii.mbuf), env, 0x00, 0x7F);
4294 }
4295 else {
4296 bitset_set_range(env, ccascii.bs, 0x00, 0x7F);
4297 r = 0;
4298 }
4299 if (r == 0) {
4300 r = and_cclass(&ccwork, &ccascii, env);
4301 }
4302 if (IS_NOT_NULL(ccascii.mbuf)) bbuf_free(ccascii.mbuf);
4303 }
4304 if (r == 0) {
4305 r = or_cclass(cc, &ccwork, env);
4306 }
4307 if (IS_NOT_NULL(ccwork.mbuf)) bbuf_free(ccwork.mbuf);
4308 }
4309 }
4310 else {
4311 r = add_ctype_to_cc_by_range(cc, ctype, not, env, sb_out, ranges);
4312 }
4313 return r;
4314 }
4315 else if (r != ONIG_NO_SUPPORT_CONFIG) {
4316 return r;
4317 }
4318
4319 maxcode = ascii_range ? 0x80 : SINGLE_BYTE_SIZE;
4320 r = 0;
4321 switch (ctype) {
4322 case ONIGENC_CTYPE_ALPHA:
4323 case ONIGENC_CTYPE_BLANK:
4324 case ONIGENC_CTYPE_CNTRL:
4325 case ONIGENC_CTYPE_DIGIT:
4326 case ONIGENC_CTYPE_LOWER:
4327 case ONIGENC_CTYPE_PUNCT:
4328 case ONIGENC_CTYPE_SPACE:
4329 case ONIGENC_CTYPE_UPPER:
4330 case ONIGENC_CTYPE_XDIGIT:
4331 case ONIGENC_CTYPE_ASCII:
4332 case ONIGENC_CTYPE_ALNUM:
4333 if (not != 0) {
4334 for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
4335 if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
4336 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4337 }
4338 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4339 }
4340 else {
4341 for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
4342 if (ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
4343 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4344 }
4345 }
4346 break;
4347
4348 case ONIGENC_CTYPE_GRAPH:
4349 case ONIGENC_CTYPE_PRINT:
4350 if (not != 0) {
4351 for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
4352 if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype)
4353 || c >= maxcode)
4354 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4355 }
4356 if (ascii_range)
4357 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4358 }
4359 else {
4360 for (c = 0; c < maxcode; c++) {
4361 if (ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
4362 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4363 }
4364 if (! ascii_range)
4365 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4366 }
4367 break;
4368
4369 case ONIGENC_CTYPE_WORD:
4370 if (not == 0) {
4371 for (c = 0; c < maxcode; c++) {
4372 if (ONIGENC_IS_CODE_WORD(enc, c)) BITSET_SET_BIT_CHKDUP(cc->bs, c);
4373 }
4374 if (! ascii_range)
4375 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4376 }
4377 else {
4378 for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
4379 if ((ONIGENC_CODE_TO_MBCLEN(enc, c) > 0) /* check invalid code point */
4380 && (! ONIGENC_IS_CODE_WORD(enc, c) || c >= maxcode))
4381 BITSET_SET_BIT_CHKDUP(cc->bs, c);
4382 }
4383 if (ascii_range)
4384 ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
4385 }
4386 break;
4387
4388 default:
4389 return ONIGERR_PARSER_BUG;
4390 break;
4391 }
4392
4393 return r;
4394}
4395
4396static int
4397parse_posix_bracket(CClassNode* cc, CClassNode* asc_cc,
4398 UChar** src, UChar* end, ScanEnv* env)
4399{
4400#define POSIX_BRACKET_CHECK_LIMIT_LENGTH 20
4401#define POSIX_BRACKET_NAME_MIN_LEN 4
4402
4403 static const PosixBracketEntryType PBS[] = {
4404 POSIX_BRACKET_ENTRY_INIT("alnum", ONIGENC_CTYPE_ALNUM),
4405 POSIX_BRACKET_ENTRY_INIT("alpha", ONIGENC_CTYPE_ALPHA),
4406 POSIX_BRACKET_ENTRY_INIT("blank", ONIGENC_CTYPE_BLANK),
4407 POSIX_BRACKET_ENTRY_INIT("cntrl", ONIGENC_CTYPE_CNTRL),
4408 POSIX_BRACKET_ENTRY_INIT("digit", ONIGENC_CTYPE_DIGIT),
4409 POSIX_BRACKET_ENTRY_INIT("graph", ONIGENC_CTYPE_GRAPH),
4410 POSIX_BRACKET_ENTRY_INIT("lower", ONIGENC_CTYPE_LOWER),
4411 POSIX_BRACKET_ENTRY_INIT("print", ONIGENC_CTYPE_PRINT),
4412 POSIX_BRACKET_ENTRY_INIT("punct", ONIGENC_CTYPE_PUNCT),
4413 POSIX_BRACKET_ENTRY_INIT("space", ONIGENC_CTYPE_SPACE),
4414 POSIX_BRACKET_ENTRY_INIT("upper", ONIGENC_CTYPE_UPPER),
4415 POSIX_BRACKET_ENTRY_INIT("xdigit", ONIGENC_CTYPE_XDIGIT),
4416 POSIX_BRACKET_ENTRY_INIT("ascii", ONIGENC_CTYPE_ASCII),
4417 POSIX_BRACKET_ENTRY_INIT("word", ONIGENC_CTYPE_WORD),
4418 };
4419
4420 const PosixBracketEntryType *pb;
4421 int not, i, r;
4422 int ascii_range;
4423 OnigCodePoint c;
4424 OnigEncoding enc = env->enc;
4425 UChar *p = *src;
4426
4427 if (PPEEK_IS('^')) {
4428 PINC_S;
4429 not = 1;
4430 }
4431 else
4432 not = 0;
4433
4434 if (onigenc_strlen(enc, p, end) < POSIX_BRACKET_NAME_MIN_LEN + 3)
4435 goto not_posix_bracket;
4436
4437 ascii_range = IS_ASCII_RANGE(env->option) &&
4438 ! IS_POSIX_BRACKET_ALL_RANGE(env->option);
4439 for (pb = PBS; pb < PBS + numberof(PBS); pb++) {
4440 if (onigenc_with_ascii_strncmp(enc, p, end, pb->name, pb->len) == 0) {
4441 p = (UChar* )onigenc_step(enc, p, end, pb->len);
4442 if (onigenc_with_ascii_strncmp(enc, p, end, (UChar* )":]", 2) != 0)
4443 return ONIGERR_INVALID_POSIX_BRACKET_TYPE;
4444
4445 r = add_ctype_to_cc(cc, pb->ctype, not, ascii_range, env);
4446 if (r != 0) return r;
4447
4448 if (IS_NOT_NULL(asc_cc)) {
4449 if (pb->ctype != ONIGENC_CTYPE_WORD &&
4450 pb->ctype != ONIGENC_CTYPE_ASCII &&
4451 !ascii_range)
4452 r = add_ctype_to_cc(asc_cc, pb->ctype, not, ascii_range, env);
4453 if (r != 0) return r;
4454 }
4455
4456 PINC_S; PINC_S;
4457 *src = p;
4458 return 0;
4459 }
4460 }
4461
4462 not_posix_bracket:
4463 c = 0;
4464 i = 0;
4465 while (!PEND && ((c = PPEEK) != ':') && c != ']') {
4466 PINC_S;
4467 if (++i > POSIX_BRACKET_CHECK_LIMIT_LENGTH) break;
4468 }
4469 if (c == ':' && ! PEND) {
4470 PINC_S;
4471 if (! PEND) {
4472 PFETCH_S(c);
4473 if (c == ']')
4474 return ONIGERR_INVALID_POSIX_BRACKET_TYPE;
4475 }
4476 }
4477
4478 return 1; /* 1: is not POSIX bracket, but no error. */
4479}
4480
4481static int
4482fetch_char_property_to_ctype(UChar** src, UChar* end, ScanEnv* env)
4483{
4484 int r;
4485 OnigCodePoint c;
4486 OnigEncoding enc = env->enc;
4487 UChar *prev, *start, *p = *src;
4488
4489 r = ONIGERR_INVALID_CHAR_PROPERTY_NAME;
4490 start = prev = p;
4491
4492 while (!PEND) {
4493 prev = p;
4494 PFETCH_S(c);
4495 if (c == '}') {
4496 r = ONIGENC_PROPERTY_NAME_TO_CTYPE(enc, start, prev);
4497 if (r < 0) break;
4498
4499 *src = p;
4500 return r;
4501 }
4502 else if (c == '(' || c == ')' || c == '{' || c == '|') {
4503 break;
4504 }
4505 }
4506
4507 onig_scan_env_set_error_string(env, r, *src, prev);
4508 return r;
4509}
4510
4511static int cclass_case_fold(Node** np, CClassNode* cc, CClassNode* asc_cc, ScanEnv* env);
4512
4513static int
4514parse_char_property(Node** np, OnigToken* tok, UChar** src, UChar* end,
4515 ScanEnv* env)
4516{
4517 int r, ctype;
4518 CClassNode* cc;
4519
4520 ctype = fetch_char_property_to_ctype(src, end, env);
4521 if (ctype < 0) return ctype;
4522
4523 *np = node_new_cclass();
4524 CHECK_NULL_RETURN_MEMERR(*np);
4525 cc = NCCLASS(*np);
4526 r = add_ctype_to_cc(cc, ctype, 0, 0, env);
4527 if (r != 0) return r;
4528 if (tok->u.prop.not != 0) NCCLASS_SET_NOT(cc);
4529
4530 if (IS_IGNORECASE(env->option)) {
4531 if (ctype != ONIGENC_CTYPE_ASCII)
4532 r = cclass_case_fold(np, cc, cc, env);
4533 }
4534 return r;
4535}
4536
4537
4538enum CCSTATE {
4539 CCS_VALUE,
4540 CCS_RANGE,
4541 CCS_COMPLETE,
4542 CCS_START
4543};
4544
4545enum CCVALTYPE {
4546 CCV_SB,
4547 CCV_CODE_POINT,
4548 CCV_CLASS
4549};
4550
4551static int
4552next_state_class(CClassNode* cc, CClassNode* asc_cc,
4553 OnigCodePoint* vs, enum CCVALTYPE* type,
4554 enum CCSTATE* state, ScanEnv* env)
4555{
4556 int r;
4557
4558 if (*state == CCS_RANGE)
4559 return ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE;
4560
4561 if (*state == CCS_VALUE && *type != CCV_CLASS) {
4562 if (*type == CCV_SB) {
4563 BITSET_SET_BIT_CHKDUP(cc->bs, (int )(*vs));
4564 if (IS_NOT_NULL(asc_cc))
4565 BITSET_SET_BIT(asc_cc->bs, (int )(*vs));
4566 }
4567 else if (*type == CCV_CODE_POINT) {
4568 r = add_code_range(&(cc->mbuf), env, *vs, *vs);
4569 if (r < 0) return r;
4570 if (IS_NOT_NULL(asc_cc)) {
4571 r = add_code_range0(&(asc_cc->mbuf), env, *vs, *vs, 0);
4572 if (r < 0) return r;
4573 }
4574 }
4575 }
4576
4577 *state = CCS_VALUE;
4578 *type = CCV_CLASS;
4579 return 0;
4580}
4581
4582static int
4583next_state_val(CClassNode* cc, CClassNode* asc_cc,
4584 OnigCodePoint *from, OnigCodePoint to,
4585 int* from_israw, int to_israw,
4586 enum CCVALTYPE intype, enum CCVALTYPE* type,
4587 enum CCSTATE* state, ScanEnv* env)
4588{
4589 int r;
4590
4591 switch (*state) {
4592 case CCS_VALUE:
4593 if (*type == CCV_SB) {
4594 BITSET_SET_BIT_CHKDUP(cc->bs, (int )(*from));
4595 if (IS_NOT_NULL(asc_cc))
4596 BITSET_SET_BIT(asc_cc->bs, (int )(*from));
4597 }
4598 else if (*type == CCV_CODE_POINT) {
4599 r = add_code_range(&(cc->mbuf), env, *from, *from);
4600 if (r < 0) return r;
4601 if (IS_NOT_NULL(asc_cc)) {
4602 r = add_code_range0(&(asc_cc->mbuf), env, *from, *from, 0);
4603 if (r < 0) return r;
4604 }
4605 }
4606 break;
4607
4608 case CCS_RANGE:
4609 if (intype == *type) {
4610 if (intype == CCV_SB) {
4611 if (*from > 0xff || to > 0xff)
4612 return ONIGERR_INVALID_CODE_POINT_VALUE;
4613
4614 if (*from > to) {
4615 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC))
4616 goto ccs_range_end;
4617 else
4618 return ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS;
4619 }
4620 bitset_set_range(env, cc->bs, (int )*from, (int )to);
4621 if (IS_NOT_NULL(asc_cc))
4622 bitset_set_range(env, asc_cc->bs, (int )*from, (int )to);
4623 }
4624 else {
4625 r = add_code_range(&(cc->mbuf), env, *from, to);
4626 if (r < 0) return r;
4627 if (IS_NOT_NULL(asc_cc)) {
4628 r = add_code_range0(&(asc_cc->mbuf), env, *from, to, 0);
4629 if (r < 0) return r;
4630 }
4631 }
4632 }
4633 else {
4634 if (*from > to) {
4635 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC))
4636 goto ccs_range_end;
4637 else
4638 return ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS;
4639 }
4640 bitset_set_range(env, cc->bs, (int )*from, (int )(to < 0xff ? to : 0xff));
4641 r = add_code_range(&(cc->mbuf), env, (OnigCodePoint )*from, to);
4642 if (r < 0) return r;
4643 if (IS_NOT_NULL(asc_cc)) {
4644 bitset_set_range(env, asc_cc->bs, (int )*from, (int )(to < 0xff ? to : 0xff));
4645 r = add_code_range0(&(asc_cc->mbuf), env, (OnigCodePoint )*from, to, 0);
4646 if (r < 0) return r;
4647 }
4648 }
4649 ccs_range_end:
4650 *state = CCS_COMPLETE;
4651 break;
4652
4653 case CCS_COMPLETE:
4654 case CCS_START:
4655 *state = CCS_VALUE;
4656 break;
4657
4658 default:
4659 break;
4660 }
4661
4662 *from_israw = to_israw;
4663 *from = to;
4664 *type = intype;
4665 return 0;
4666}
4667
4668static int
4669code_exist_check(OnigCodePoint c, UChar* from, UChar* end, int ignore_escaped,
4670 ScanEnv* env)
4671{
4672 int in_esc;
4673 OnigCodePoint code;
4674 OnigEncoding enc = env->enc;
4675 UChar* p = from;
4676
4677 in_esc = 0;
4678 while (! PEND) {
4679 if (ignore_escaped && in_esc) {
4680 in_esc = 0;
4681 }
4682 else {
4683 PFETCH_S(code);
4684 if (code == c) return 1;
4685 if (code == MC_ESC(env->syntax)) in_esc = 1;
4686 }
4687 }
4688 return 0;
4689}
4690
4691static int
4692parse_char_class(Node** np, Node** asc_np, OnigToken* tok, UChar** src, UChar* end,
4693 ScanEnv* env)
4694{
4695 int r, neg, len, fetched, and_start;
4696 OnigCodePoint v, vs;
4697 UChar *p;
4698 Node* node;
4699 Node* asc_node;
4700 CClassNode *cc, *prev_cc;
4701 CClassNode *asc_cc, *asc_prev_cc;
4702 CClassNode work_cc, asc_work_cc;
4703
4704 enum CCSTATE state;
4705 enum CCVALTYPE val_type, in_type;
4706 int val_israw, in_israw;
4707
4708 *np = *asc_np = NULL_NODE;
4709 env->parse_depth++;
4710 if (env->parse_depth > ParseDepthLimit)
4711 return ONIGERR_PARSE_DEPTH_LIMIT_OVER;
4712 prev_cc = asc_prev_cc = (CClassNode* )NULL;
4713 r = fetch_token_in_cc(tok, src, end, env);
4714 if (r == TK_CHAR && tok->u.c == '^' && tok->escaped == 0) {
4715 neg = 1;
4716 r = fetch_token_in_cc(tok, src, end, env);
4717 }
4718 else {
4719 neg = 0;
4720 }
4721
4722 if (r < 0) return r;
4723 if (r == TK_CC_CLOSE) {
4724 if (! code_exist_check((OnigCodePoint )']',
4725 *src, env->pattern_end, 1, env))
4726 return ONIGERR_EMPTY_CHAR_CLASS;
4727
4728 CC_ESC_WARN(env, (UChar* )"]");
4729 r = tok->type = TK_CHAR; /* allow []...] */
4730 }
4731
4732 *np = node = node_new_cclass();
4733 CHECK_NULL_RETURN_MEMERR(node);
4734 cc = NCCLASS(node);
4735
4736 if (IS_IGNORECASE(env->option)) {
4737 *asc_np = asc_node = node_new_cclass();
4738 CHECK_NULL_RETURN_MEMERR(asc_node);
4739 asc_cc = NCCLASS(asc_node);
4740 }
4741 else {
4742 asc_node = NULL_NODE;
4743 asc_cc = NULL;
4744 }
4745
4746 and_start = 0;
4747 state = CCS_START;
4748 p = *src;
4749 while (r != TK_CC_CLOSE) {
4750 fetched = 0;
4751 switch (r) {
4752 case TK_CHAR:
4753 if ((tok->u.code >= SINGLE_BYTE_SIZE) ||
4754 (len = ONIGENC_CODE_TO_MBCLEN(env->enc, tok->u.c)) > 1) {
4755 in_type = CCV_CODE_POINT;
4756 }
4757 else if (len < 0) {
4758 r = len;
4759 goto err;
4760 }
4761 else {
4762 sb_char:
4763 in_type = CCV_SB;
4764 }
4765 v = (OnigCodePoint )tok->u.c;
4766 in_israw = 0;
4767 goto val_entry2;
4768 break;
4769
4770 case TK_RAW_BYTE:
4771 /* tok->base != 0 : octal or hexadec. */
4772 if (! ONIGENC_IS_SINGLEBYTE(env->enc) && tok->base != 0) {
4773 UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN];
4774 UChar* bufe = buf + ONIGENC_CODE_TO_MBC_MAXLEN;
4775 UChar* psave = p;
4776 int i, base = tok->base;
4777
4778 buf[0] = (UChar )tok->u.c;
4779 for (i = 1; i < ONIGENC_MBC_MAXLEN(env->enc); i++) {
4780 r = fetch_token_in_cc(tok, &p, end, env);
4781 if (r < 0) goto err;
4782 if (r != TK_RAW_BYTE || tok->base != base) {
4783 fetched = 1;
4784 break;
4785 }
4786 buf[i] = (UChar )tok->u.c;
4787 }
4788
4789 if (i < ONIGENC_MBC_MINLEN(env->enc)) {
4790 r = ONIGERR_TOO_SHORT_MULTI_BYTE_STRING;
4791 goto err;
4792 }
4793
4794 len = enclen(env->enc, buf, buf + i);
4795 if (i < len) {
4796 r = ONIGERR_TOO_SHORT_MULTI_BYTE_STRING;
4797 goto err;
4798 }
4799 else if (i > len) { /* fetch back */
4800 p = psave;
4801 for (i = 1; i < len; i++) {
4802 (void)fetch_token_in_cc(tok, &p, end, env);
4803 /* no need to check the return value (already checked above) */
4804 }
4805 fetched = 0;
4806 }
4807
4808 if (i == 1) {
4809 v = (OnigCodePoint )buf[0];
4810 goto raw_single;
4811 }
4812 else {
4813 v = ONIGENC_MBC_TO_CODE(env->enc, buf, bufe);
4814 in_type = CCV_CODE_POINT;
4815 }
4816 }
4817 else {
4818 v = (OnigCodePoint )tok->u.c;
4819 raw_single:
4820 in_type = CCV_SB;
4821 }
4822 in_israw = 1;
4823 goto val_entry2;
4824 break;
4825
4826 case TK_CODE_POINT:
4827 v = tok->u.code;
4828 in_israw = 1;
4829 val_entry:
4830 len = ONIGENC_CODE_TO_MBCLEN(env->enc, v);
4831 if (len < 0) {
4832 r = len;
4833 goto err;
4834 }
4835 in_type = (len == 1 ? CCV_SB : CCV_CODE_POINT);
4836 val_entry2:
4837 r = next_state_val(cc, asc_cc, &vs, v, &val_israw, in_israw, in_type, &val_type,
4838 &state, env);
4839 if (r != 0) goto err;
4840 break;
4841
4842 case TK_POSIX_BRACKET_OPEN:
4843 r = parse_posix_bracket(cc, asc_cc, &p, end, env);
4844 if (r < 0) goto err;
4845 if (r == 1) { /* is not POSIX bracket */
4846 CC_ESC_WARN(env, (UChar* )"[");
4847 p = tok->backp;
4848 v = (OnigCodePoint )tok->u.c;
4849 in_israw = 0;
4850 goto val_entry;
4851 }
4852 goto next_class;
4853 break;
4854
4855 case TK_CHAR_TYPE:
4856 r = add_ctype_to_cc(cc, tok->u.prop.ctype, tok->u.prop.not,
4857 IS_ASCII_RANGE(env->option), env);
4858 if (r != 0) return r;
4859 if (IS_NOT_NULL(asc_cc)) {
4860 if (tok->u.prop.ctype != ONIGENC_CTYPE_WORD)
4861 r = add_ctype_to_cc(asc_cc, tok->u.prop.ctype, tok->u.prop.not,
4862 IS_ASCII_RANGE(env->option), env);
4863 if (r != 0) return r;
4864 }
4865
4866 next_class:
4867 r = next_state_class(cc, asc_cc, &vs, &val_type, &state, env);
4868 if (r != 0) goto err;
4869 break;
4870
4871 case TK_CHAR_PROPERTY:
4872 {
4873 int ctype;
4874
4875 ctype = fetch_char_property_to_ctype(&p, end, env);
4876 if (ctype < 0) return ctype;
4877 r = add_ctype_to_cc(cc, ctype, tok->u.prop.not, 0, env);
4878 if (r != 0) return r;
4879 if (IS_NOT_NULL(asc_cc)) {
4880 if (ctype != ONIGENC_CTYPE_ASCII)
4881 r = add_ctype_to_cc(asc_cc, ctype, tok->u.prop.not, 0, env);
4882 if (r != 0) return r;
4883 }
4884 goto next_class;
4885 }
4886 break;
4887
4888 case TK_CC_RANGE:
4889 if (state == CCS_VALUE) {
4890 r = fetch_token_in_cc(tok, &p, end, env);
4891 if (r < 0) goto err;
4892 fetched = 1;
4893 if (r == TK_CC_CLOSE) { /* allow [x-] */
4894 range_end_val:
4895 v = (OnigCodePoint )'-';
4896 in_israw = 0;
4897 goto val_entry;
4898 }
4899 else if (r == TK_CC_AND) {
4900 CC_ESC_WARN(env, (UChar* )"-");
4901 goto range_end_val;
4902 }
4903
4904 if (val_type == CCV_CLASS) {
4905 r = ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS;
4906 goto err;
4907 }
4908
4909 state = CCS_RANGE;
4910 }
4911 else if (state == CCS_START) {
4912 /* [-xa] is allowed */
4913 v = (OnigCodePoint )tok->u.c;
4914 in_israw = 0;
4915
4916 r = fetch_token_in_cc(tok, &p, end, env);
4917 if (r < 0) goto err;
4918 fetched = 1;
4919 /* [--x] or [a&&-x] is warned. */
4920 if (r == TK_CC_RANGE || and_start != 0)
4921 CC_ESC_WARN(env, (UChar* )"-");
4922
4923 goto val_entry;
4924 }
4925 else if (state == CCS_RANGE) {
4926 CC_ESC_WARN(env, (UChar* )"-");
4927 goto sb_char; /* [!--x] is allowed */
4928 }
4929 else { /* CCS_COMPLETE */
4930 r = fetch_token_in_cc(tok, &p, end, env);
4931 if (r < 0) goto err;
4932 fetched = 1;
4933 if (r == TK_CC_CLOSE) goto range_end_val; /* allow [a-b-] */
4934 else if (r == TK_CC_AND) {
4935 CC_ESC_WARN(env, (UChar* )"-");
4936 goto range_end_val;
4937 }
4938
4939 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_DOUBLE_RANGE_OP_IN_CC)) {
4940 CC_ESC_WARN(env, (UChar* )"-");
4941 goto range_end_val; /* [0-9-a] is allowed as [0-9\-a] */
4942 }
4943 r = ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS;
4944 goto err;
4945 }
4946 break;
4947
4948 case TK_CC_CC_OPEN: /* [ */
4949 {
4950 Node *anode, *aasc_node;
4951 CClassNode* acc;
4952
4953 r = parse_char_class(&anode, &aasc_node, tok, &p, end, env);
4954 if (r == 0) {
4955 acc = NCCLASS(anode);
4956 r = or_cclass(cc, acc, env);
4957 }
4958 if (r == 0 && IS_NOT_NULL(aasc_node)) {
4959 acc = NCCLASS(aasc_node);
4960 r = or_cclass(asc_cc, acc, env);
4961 }
4962 onig_node_free(anode);
4963 onig_node_free(aasc_node);
4964 if (r != 0) goto err;
4965 }
4966 break;
4967
4968 case TK_CC_AND: /* && */
4969 {
4970 if (state == CCS_VALUE) {
4971 r = next_state_val(cc, asc_cc, &vs, 0, &val_israw, 0, val_type,
4972 &val_type, &state, env);
4973 if (r != 0) goto err;
4974 }
4975 /* initialize local variables */
4976 and_start = 1;
4977 state = CCS_START;
4978
4979 if (IS_NOT_NULL(prev_cc)) {
4980 r = and_cclass(prev_cc, cc, env);
4981 if (r != 0) goto err;
4982 bbuf_free(cc->mbuf);
4983 if (IS_NOT_NULL(asc_cc)) {
4984 r = and_cclass(asc_prev_cc, asc_cc, env);
4985 if (r != 0) goto err;
4986 bbuf_free(asc_cc->mbuf);
4987 }
4988 }
4989 else {
4990 prev_cc = cc;
4991 cc = &work_cc;
4992 if (IS_NOT_NULL(asc_cc)) {
4993 asc_prev_cc = asc_cc;
4994 asc_cc = &asc_work_cc;
4995 }
4996 }
4997 initialize_cclass(cc);
4998 if (IS_NOT_NULL(asc_cc))
4999 initialize_cclass(asc_cc);
5000 }
5001 break;
5002
5003 case TK_EOT:
5004 r = ONIGERR_PREMATURE_END_OF_CHAR_CLASS;
5005 goto err;
5006 break;
5007 default:
5008 r = ONIGERR_PARSER_BUG;
5009 goto err;
5010 break;
5011 }
5012
5013 if (fetched)
5014 r = tok->type;
5015 else {
5016 r = fetch_token_in_cc(tok, &p, end, env);
5017 if (r < 0) goto err;
5018 }
5019 }
5020
5021 if (state == CCS_VALUE) {
5022 r = next_state_val(cc, asc_cc, &vs, 0, &val_israw, 0, val_type,
5023 &val_type, &state, env);
5024 if (r != 0) goto err;
5025 }
5026
5027 if (IS_NOT_NULL(prev_cc)) {
5028 r = and_cclass(prev_cc, cc, env);
5029 if (r != 0) goto err;
5030 bbuf_free(cc->mbuf);
5031 cc = prev_cc;
5032 if (IS_NOT_NULL(asc_cc)) {
5033 r = and_cclass(asc_prev_cc, asc_cc, env);
5034 if (r != 0) goto err;
5035 bbuf_free(asc_cc->mbuf);
5036 asc_cc = asc_prev_cc;
5037 }
5038 }
5039
5040 if (neg != 0) {
5041 NCCLASS_SET_NOT(cc);
5042 if (IS_NOT_NULL(asc_cc))
5043 NCCLASS_SET_NOT(asc_cc);
5044 }
5045 else {
5046 NCCLASS_CLEAR_NOT(cc);
5047 if (IS_NOT_NULL(asc_cc))
5048 NCCLASS_CLEAR_NOT(asc_cc);
5049 }
5050 if (IS_NCCLASS_NOT(cc) &&
5051 IS_SYNTAX_BV(env->syntax, ONIG_SYN_NOT_NEWLINE_IN_NEGATIVE_CC)) {
5052 int is_empty;
5053
5054 is_empty = (IS_NULL(cc->mbuf) ? 1 : 0);
5055 if (is_empty != 0)
5056 BITSET_IS_EMPTY(cc->bs, is_empty);
5057
5058 if (is_empty == 0) {
5059#define NEWLINE_CODE 0x0a
5060
5061 if (ONIGENC_IS_CODE_NEWLINE(env->enc, NEWLINE_CODE)) {
5062 if (ONIGENC_CODE_TO_MBCLEN(env->enc, NEWLINE_CODE) == 1)
5063 BITSET_SET_BIT_CHKDUP(cc->bs, NEWLINE_CODE);
5064 else {
5065 r = add_code_range(&(cc->mbuf), env, NEWLINE_CODE, NEWLINE_CODE);
5066 if (r < 0) goto err;
5067 }
5068 }
5069 }
5070 }
5071 *src = p;
5072 env->parse_depth--;
5073 return 0;
5074
5075 err:
5076 if (cc != NCCLASS(*np))
5077 bbuf_free(cc->mbuf);
5078 if (IS_NOT_NULL(asc_cc) && (asc_cc != NCCLASS(*asc_np)))
5079 bbuf_free(asc_cc->mbuf);
5080 return r;
5081}
5082
5083static int parse_subexp(Node** top, OnigToken* tok, int term,
5084 UChar** src, UChar* end, ScanEnv* env);
5085
5086static int
5087parse_enclose(Node** np, OnigToken* tok, int term, UChar** src, UChar* end,
5088 ScanEnv* env)
5089{
5090 int r = 0, num;
5091 Node *target, *work1 = NULL, *work2 = NULL;
5092 OnigOptionType option;
5093 OnigCodePoint c;
5094 OnigEncoding enc = env->enc;
5095
5096#ifdef USE_NAMED_GROUP
5097 int list_capture;
5098#endif
5099
5100 UChar* p = *src;
5101 PFETCH_READY;
5102
5103 *np = NULL;
5104 if (PEND) return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS;
5105
5106 option = env->option;
5107 if (PPEEK_IS('?') &&
5108 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_GROUP_EFFECT)) {
5109 PINC;
5110 if (PEND) return ONIGERR_END_PATTERN_IN_GROUP;
5111
5112 PFETCH(c);
5113 switch (c) {
5114 case ':': /* (?:...) grouping only */
5115 group:
5116 r = fetch_token(tok, &p, end, env);
5117 if (r < 0) return r;
5118 r = parse_subexp(np, tok, term, &p, end, env);
5119 if (r < 0) return r;
5120 *src = p;
5121 return 1; /* group */
5122 break;
5123
5124 case '=':
5125 *np = onig_node_new_anchor(ANCHOR_PREC_READ);
5126 break;
5127 case '!': /* preceding read */
5128 *np = onig_node_new_anchor(ANCHOR_PREC_READ_NOT);
5129 break;
5130 case '>': /* (?>...) stop backtrack */
5131 *np = node_new_enclose(ENCLOSE_STOP_BACKTRACK);
5132 break;
5133 case '~': /* (?~...) absent operator */
5134 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_TILDE_ABSENT)) {
5135 *np = node_new_enclose(ENCLOSE_ABSENT);
5136 }
5137 else {
5138 return ONIGERR_UNDEFINED_GROUP_OPTION;
5139 }
5140 break;
5141
5142#ifdef USE_NAMED_GROUP
5143 case '\'':
5144 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) {
5145 goto named_group1;
5146 }
5147 else
5148 return ONIGERR_UNDEFINED_GROUP_OPTION;
5149 break;
5150
5151# ifdef USE_CAPITAL_P_NAMED_GROUP
5152 case 'P': /* (?P<name>...) */
5153 if (!PEND &&
5154 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_CAPITAL_P_NAMED_GROUP)) {
5155 PFETCH(c);
5156 if (c == '<') goto named_group1;
5157 }
5158 return ONIGERR_UNDEFINED_GROUP_OPTION;
5159 break;
5160# endif
5161#endif
5162
5163 case '<': /* look behind (?<=...), (?<!...) */
5164 if (PEND) return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS;
5165 PFETCH(c);
5166 if (c == '=')
5167 *np = onig_node_new_anchor(ANCHOR_LOOK_BEHIND);
5168 else if (c == '!')
5169 *np = onig_node_new_anchor(ANCHOR_LOOK_BEHIND_NOT);
5170#ifdef USE_NAMED_GROUP
5171 else { /* (?<name>...) */
5172 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) {
5173 UChar *name;
5174 UChar *name_end;
5175
5176 PUNFETCH;
5177 c = '<';
5178
5179 named_group1:
5180 list_capture = 0;
5181
5182# ifdef USE_CAPTURE_HISTORY
5183 named_group2:
5184# endif
5185 name = p;
5186 r = fetch_name((OnigCodePoint )c, &p, end, &name_end, env, &num, 0);
5187 if (r < 0) return r;
5188
5189 num = scan_env_add_mem_entry(env);
5190 if (num < 0) return num;
5191 if (list_capture != 0 && num >= (int )BIT_STATUS_BITS_NUM)
5192 return ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY;
5193
5194 r = name_add(env->reg, name, name_end, num, env);
5195 if (r != 0) return r;
5196 *np = node_new_enclose_memory(env->option, 1);
5197 CHECK_NULL_RETURN_MEMERR(*np);
5198 NENCLOSE(*np)->regnum = num;
5199 if (list_capture != 0)
5200 BIT_STATUS_ON_AT_SIMPLE(env->capture_history, num);
5201 env->num_named++;
5202 }
5203 else {
5204 return ONIGERR_UNDEFINED_GROUP_OPTION;
5205 }
5206 }
5207#else
5208 else {
5209 return ONIGERR_UNDEFINED_GROUP_OPTION;
5210 }
5211#endif
5212 break;
5213
5214#ifdef USE_CAPTURE_HISTORY
5215 case '@':
5216 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_ATMARK_CAPTURE_HISTORY)) {
5217# ifdef USE_NAMED_GROUP
5218 if (!PEND &&
5219 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP)) {
5220 PFETCH(c);
5221 if (c == '<' || c == '\'') {
5222 list_capture = 1;
5223 goto named_group2; /* (?@<name>...) */
5224 }
5225 PUNFETCH;
5226 }
5227# endif
5228 *np = node_new_enclose_memory(env->option, 0);
5229 CHECK_NULL_RETURN_MEMERR(*np);
5230 num = scan_env_add_mem_entry(env);
5231 if (num < 0) return num;
5232 if (num >= (int )BIT_STATUS_BITS_NUM)
5233 return ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY;
5234
5235 NENCLOSE(*np)->regnum = num;
5236 BIT_STATUS_ON_AT_SIMPLE(env->capture_history, num);
5237 }
5238 else {
5239 return ONIGERR_UNDEFINED_GROUP_OPTION;
5240 }
5241 break;
5242#endif /* USE_CAPTURE_HISTORY */
5243
5244 case '(': /* conditional expression: (?(cond)yes), (?(cond)yes|no) */
5245 if (!PEND &&
5246 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_LPAREN_CONDITION)) {
5247 UChar *name = NULL;
5248 UChar *name_end;
5249 PFETCH(c);
5250 if (ONIGENC_IS_CODE_DIGIT(enc, c)) { /* (n) */
5251 PUNFETCH;
5252 r = fetch_name((OnigCodePoint )'(', &p, end, &name_end, env, &num, 1);
5253 if (r < 0) return r;
5254#if 0
5255 /* Relative number is not currently supported. (same as Perl) */
5256 if (num < 0) {
5257 num = BACKREF_REL_TO_ABS(num, env);
5258 if (num <= 0)
5259 return ONIGERR_INVALID_BACKREF;
5260 }
5261#endif
5262 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_STRICT_CHECK_BACKREF)) {
5263 if (num > env->num_mem ||
5264 IS_NULL(SCANENV_MEM_NODES(env)[num]))
5265 return ONIGERR_INVALID_BACKREF;
5266 }
5267 }
5268#ifdef USE_NAMED_GROUP
5269 else if (c == '<' || c == '\'') { /* (<name>), ('name') */
5270 name = p;
5271 r = fetch_named_backref_token(c, tok, &p, end, env);
5272 if (r < 0) return r;
5273 if (!PPEEK_IS(')')) return ONIGERR_UNDEFINED_GROUP_OPTION;
5274 PINC;
5275
5276 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_USE_LEFT_MOST_NAMED_GROUP)) {
5277 num = tok->u.backref.ref1;
5278 }
5279 else {
5280 /* FIXME:
5281 * Use left most named group for now. This is the same as Perl.
5282 * However this should use the same strategy as normal back-
5283 * references on Ruby syntax; search right to left. */
5284 int len = tok->u.backref.num;
5285 num = len > 1 ? tok->u.backref.refs[0] : tok->u.backref.ref1;
5286 }
5287 }
5288#endif
5289 else
5290 return ONIGERR_INVALID_CONDITION_PATTERN;
5291 *np = node_new_enclose(ENCLOSE_CONDITION);
5292 CHECK_NULL_RETURN_MEMERR(*np);
5293 NENCLOSE(*np)->regnum = num;
5294 if (IS_NOT_NULL(name)) NENCLOSE(*np)->state |= NST_NAME_REF;
5295 }
5296 else
5297 return ONIGERR_UNDEFINED_GROUP_OPTION;
5298 break;
5299
5300#if 0
5301 case '|': /* branch reset: (?|...) */
5302 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_QMARK_VBAR_BRANCH_RESET)) {
5303 /* TODO */
5304 }
5305 else
5306 return ONIGERR_UNDEFINED_GROUP_OPTION;
5307 break;
5308#endif
5309
5310 case '^': /* loads default options */
5311 if (!PEND && IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) {
5312 /* d-imsx */
5313 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1);
5314 ONOFF(option, ONIG_OPTION_IGNORECASE, 1);
5315 ONOFF(option, ONIG_OPTION_SINGLELINE, 0);
5316 ONOFF(option, ONIG_OPTION_MULTILINE, 1);
5317 ONOFF(option, ONIG_OPTION_EXTEND, 1);
5318 PFETCH(c);
5319 }
5320#if 0
5321 else if (!PEND && IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) {
5322 /* d-imx */
5323 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0);
5324 ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 0);
5325 ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 0);
5326 ONOFF(option, ONIG_OPTION_IGNORECASE, 1);
5327 ONOFF(option, ONIG_OPTION_MULTILINE, 1);
5328 ONOFF(option, ONIG_OPTION_EXTEND, 1);
5329 PFETCH(c);
5330 }
5331#endif
5332 else {
5333 return ONIGERR_UNDEFINED_GROUP_OPTION;
5334 }
5335 /* fall through */
5336#ifdef USE_POSIXLINE_OPTION
5337 case 'p':
5338#endif
5339 case '-': case 'i': case 'm': case 's': case 'x':
5340 case 'a': case 'd': case 'l': case 'u':
5341 {
5342 int neg = 0;
5343
5344 while (1) {
5345 switch (c) {
5346 case ':':
5347 case ')':
5348 break;
5349
5350 case '-': neg = 1; break;
5351 case 'x': ONOFF(option, ONIG_OPTION_EXTEND, neg); break;
5352 case 'i': ONOFF(option, ONIG_OPTION_IGNORECASE, neg); break;
5353 case 's':
5354 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) {
5355 ONOFF(option, ONIG_OPTION_MULTILINE, neg);
5356 }
5357 else
5358 return ONIGERR_UNDEFINED_GROUP_OPTION;
5359 break;
5360
5361 case 'm':
5362 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL)) {
5363 ONOFF(option, ONIG_OPTION_SINGLELINE, (neg == 0 ? 1 : 0));
5364 }
5365 else if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) {
5366 ONOFF(option, ONIG_OPTION_MULTILINE, neg);
5367 }
5368 else
5369 return ONIGERR_UNDEFINED_GROUP_OPTION;
5370 break;
5371#ifdef USE_POSIXLINE_OPTION
5372 case 'p':
5373 ONOFF(option, ONIG_OPTION_MULTILINE|ONIG_OPTION_SINGLELINE, neg);
5374 break;
5375#endif
5376
5377 case 'a': /* limits \d, \s, \w and POSIX brackets to ASCII range */
5378 if ((IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) ||
5379 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) &&
5380 (neg == 0)) {
5381 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0);
5382 ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 1);
5383 ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 1);
5384 }
5385 else
5386 return ONIGERR_UNDEFINED_GROUP_OPTION;
5387 break;
5388
5389 case 'u':
5390 if ((IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) ||
5391 IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) &&
5392 (neg == 0)) {
5393 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1);
5394 ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 1);
5395 ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 1);
5396 }
5397 else
5398 return ONIGERR_UNDEFINED_GROUP_OPTION;
5399 break;
5400
5401 case 'd':
5402 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) &&
5403 (neg == 0)) {
5404 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1);
5405 }
5406 else if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY) &&
5407 (neg == 0)) {
5408 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 0);
5409 ONOFF(option, ONIG_OPTION_POSIX_BRACKET_ALL_RANGE, 0);
5410 ONOFF(option, ONIG_OPTION_WORD_BOUND_ALL_RANGE, 0);
5411 }
5412 else
5413 return ONIGERR_UNDEFINED_GROUP_OPTION;
5414 break;
5415
5416 case 'l':
5417 if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_PERL) && (neg == 0)) {
5418 ONOFF(option, ONIG_OPTION_ASCII_RANGE, 1);
5419 }
5420 else
5421 return ONIGERR_UNDEFINED_GROUP_OPTION;
5422 break;
5423
5424 default:
5425 return ONIGERR_UNDEFINED_GROUP_OPTION;
5426 }
5427
5428 if (c == ')') {
5429 *np = node_new_option(option);
5430 CHECK_NULL_RETURN_MEMERR(*np);
5431 *src = p;
5432 return 2; /* option only */
5433 }
5434 else if (c == ':') {
5435 OnigOptionType prev = env->option;
5436
5437 env->option = option;
5438 r = fetch_token(tok, &p, end, env);
5439 if (r < 0) {
5440 env->option = prev;
5441 return r;
5442 }
5443 r = parse_subexp(&target, tok, term, &p, end, env);
5444 env->option = prev;
5445 if (r < 0) return r;
5446 *np = node_new_option(option);
5447 CHECK_NULL_RETURN_MEMERR(*np);
5448 NENCLOSE(*np)->target = target;
5449 *src = p;
5450 return 0;
5451 }
5452
5453 if (PEND) return ONIGERR_END_PATTERN_IN_GROUP;
5454 PFETCH(c);
5455 }
5456 }
5457 break;
5458
5459 default:
5460 return ONIGERR_UNDEFINED_GROUP_OPTION;
5461 }
5462 }
5463 else {
5464 if (ONIG_IS_OPTION_ON(env->option, ONIG_OPTION_DONT_CAPTURE_GROUP))
5465 goto group;
5466
5467 *np = node_new_enclose_memory(env->option, 0);
5468 CHECK_NULL_RETURN_MEMERR(*np);
5469 num = scan_env_add_mem_entry(env);
5470 if (num < 0) return num;
5471 NENCLOSE(*np)->regnum = num;
5472 }
5473
5474 CHECK_NULL_RETURN_MEMERR(*np);
5475 r = fetch_token(tok, &p, end, env);
5476 if (r < 0) return r;
5477 r = parse_subexp(&target, tok, term, &p, end, env);
5478 if (r < 0) {
5479 onig_node_free(target);
5480 return r;
5481 }
5482
5483 if (NTYPE(*np) == NT_ANCHOR)
5484 NANCHOR(*np)->target = target;
5485 else {
5486 NENCLOSE(*np)->target = target;
5487 if (NENCLOSE(*np)->type == ENCLOSE_MEMORY) {
5488 /* Don't move this to previous of parse_subexp() */
5489 r = scan_env_set_mem_node(env, NENCLOSE(*np)->regnum, *np);
5490 if (r != 0) return r;
5491 }
5492 else if (NENCLOSE(*np)->type == ENCLOSE_CONDITION) {
5493 if (NTYPE(target) != NT_ALT) {
5494 /* convert (?(cond)yes) to (?(cond)yes|empty) */
5495 work1 = node_new_empty();
5496 if (IS_NULL(work1)) goto err;
5497 work2 = onig_node_new_alt(work1, NULL_NODE);
5498 if (IS_NULL(work2)) goto err;
5499 work1 = onig_node_new_alt(target, work2);
5500 if (IS_NULL(work1)) goto err;
5501 NENCLOSE(*np)->target = work1;
5502 }
5503 }
5504 }
5505
5506 *src = p;
5507 return 0;
5508
5509 err:
5510 onig_node_free(work1);
5511 onig_node_free(work2);
5512 onig_node_free(*np);
5513 *np = NULL;
5514 return ONIGERR_MEMORY;
5515}
5516
5517static const char* const PopularQStr[] = {
5518 "?", "*", "+", "??", "*?", "+?"
5519};
5520
5521static const char* const ReduceQStr[] = {
5522 "", "", "*", "*?", "??", "+ and ??", "+? and ?"
5523};
5524
5525static int
5526set_quantifier(Node* qnode, Node* target, int group, ScanEnv* env)
5527{
5528 QtfrNode* qn;
5529
5530 qn = NQTFR(qnode);
5531 if (qn->lower == 1 && qn->upper == 1) {
5532 return 1;
5533 }
5534
5535 switch (NTYPE(target)) {
5536 case NT_STR:
5537 if (! group) {
5538 StrNode* sn = NSTR(target);
5539 if (str_node_can_be_split(sn, env->enc)) {
5540 Node* n = str_node_split_last_char(sn, env->enc);
5541 if (IS_NOT_NULL(n)) {
5542 qn->target = n;
5543 return 2;
5544 }
5545 }
5546 }
5547 break;
5548
5549 case NT_QTFR:
5550 { /* check redundant double repeat. */
5551 /* verbose warn (?:.?)? etc... but not warn (.?)? etc... */
5552 QtfrNode* qnt = NQTFR(target);
5553 int nestq_num = popular_quantifier_num(qn);
5554 int targetq_num = popular_quantifier_num(qnt);
5555
5556#ifdef USE_WARNING_REDUNDANT_NESTED_REPEAT_OPERATOR
5557 if (nestq_num >= 0 && targetq_num >= 0 &&
5558 IS_SYNTAX_BV(env->syntax, ONIG_SYN_WARN_REDUNDANT_NESTED_REPEAT)) {
5559 switch (ReduceTypeTable[targetq_num][nestq_num]) {
5560 case RQ_ASIS:
5561 break;
5562
5563 case RQ_DEL:
5564 if (onig_warn != onig_null_warn) {
5565 onig_syntax_warn(env, "regular expression has redundant nested repeat operator '%s'",
5566 PopularQStr[targetq_num]);
5567 }
5568 goto warn_exit;
5569 break;
5570
5571 default:
5572 if (onig_warn != onig_null_warn) {
5573 onig_syntax_warn(env, "nested repeat operator '%s' and '%s' was replaced with '%s' in regular expression",
5574 PopularQStr[targetq_num], PopularQStr[nestq_num],
5575 ReduceQStr[ReduceTypeTable[targetq_num][nestq_num]]);
5576 }
5577 goto warn_exit;
5578 break;
5579 }
5580 }
5581
5582 warn_exit:
5583#endif
5584 if (targetq_num >= 0) {
5585 if (nestq_num >= 0) {
5586 onig_reduce_nested_quantifier(qnode, target);
5587 goto q_exit;
5588 }
5589 else if (targetq_num == 1 || targetq_num == 2) { /* * or + */
5590 /* (?:a*){n,m}, (?:a+){n,m} => (?:a*){n,n}, (?:a+){n,n} */
5591 if (! IS_REPEAT_INFINITE(qn->upper) && qn->upper > 1 && qn->greedy) {
5592 qn->upper = (qn->lower == 0 ? 1 : qn->lower);
5593 }
5594 }
5595 }
5596 }
5597 break;
5598
5599 default:
5600 break;
5601 }
5602
5603 qn->target = target;
5604 q_exit:
5605 return 0;
5606}
5607
5608
5609#ifndef CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
5610static int
5611clear_not_flag_cclass(CClassNode* cc, OnigEncoding enc)
5612{
5613 BBuf *tbuf;
5614 int r;
5615
5616 if (IS_NCCLASS_NOT(cc)) {
5617 bitset_invert(cc->bs);
5618
5619 if (! ONIGENC_IS_SINGLEBYTE(enc)) {
5620 r = not_code_range_buf(enc, cc->mbuf, &tbuf);
5621 if (r != 0) return r;
5622
5623 bbuf_free(cc->mbuf);
5624 cc->mbuf = tbuf;
5625 }
5626
5627 NCCLASS_CLEAR_NOT(cc);
5628 }
5629
5630 return 0;
5631}
5632#endif /* CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS */
5633
5634static inline bool
5635is_singlebyte_range(OnigCodePoint code, OnigEncoding enc)
5636{
5637 /* single byte encoding */
5638 if (ONIGENC_MBC_MAXLEN(enc) == 1) {
5639 return true;
5640 }
5641
5642 /* wide char encoding */
5643 if (ONIGENC_MBC_MINLEN(enc) > 1) {
5644 return false;
5645 }
5646
5647 return (code < 0x80);
5648}
5649
5650typedef struct {
5651 ScanEnv* env;
5652 CClassNode* cc;
5653 CClassNode* asc_cc;
5654 Node* alt_root;
5655 Node** ptail;
5657
5658static int
5659i_apply_case_fold(OnigCodePoint from, OnigCodePoint to[],
5660 int to_len, void* arg)
5661{
5662 IApplyCaseFoldArg* iarg;
5663 ScanEnv* env;
5664 CClassNode* cc;
5665 CClassNode* asc_cc;
5666 BitSetRef bs;
5667 int add_flag, r;
5668
5669 iarg = (IApplyCaseFoldArg* )arg;
5670 env = iarg->env;
5671 cc = iarg->cc;
5672 asc_cc = iarg->asc_cc;
5673 bs = cc->bs;
5674
5675 if (IS_NULL(asc_cc)) {
5676 add_flag = 0;
5677 }
5678 else if (ONIGENC_IS_ASCII_CODE(from) == ONIGENC_IS_ASCII_CODE(*to)) {
5679 add_flag = 1;
5680 }
5681 else {
5682 add_flag = onig_is_code_in_cc(env->enc, from, asc_cc);
5683 if (IS_NCCLASS_NOT(asc_cc))
5684 add_flag = !add_flag;
5685 }
5686
5687 if (to_len == 1) {
5688 int is_in = onig_is_code_in_cc(env->enc, from, cc);
5689#ifdef CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
5690 if ((is_in != 0 && !IS_NCCLASS_NOT(cc)) ||
5691 (is_in == 0 && IS_NCCLASS_NOT(cc))) {
5692 if (add_flag) {
5693 if (is_singlebyte_range(*to, env->enc)) {
5694 BITSET_SET_BIT(bs, *to);
5695 }
5696 else {
5697 r = add_code_range0(&(cc->mbuf), env, *to, *to, 0);
5698 if (r < 0) return r;
5699 }
5700 }
5701 }
5702#else
5703 if (is_in != 0) {
5704 if (add_flag) {
5705 if (is_singlebyte_range(*to, env->enc)) {
5706 if (IS_NCCLASS_NOT(cc)) {
5707 BITSET_CLEAR_BIT(bs, *to);
5708 }
5709 else {
5710 BITSET_SET_BIT(bs, *to);
5711 }
5712 }
5713 else {
5714 if (IS_NCCLASS_NOT(cc)) clear_not_flag_cclass(cc, env->enc);
5715 r = add_code_range0(&(cc->mbuf), env, *to, *to, 0);
5716 if (r < 0) return r;
5717 }
5718 }
5719 }
5720#endif /* CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS */
5721 }
5722 else {
5723 int r, i, len;
5724 UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN];
5725 Node *snode = NULL_NODE;
5726
5727 if (onig_is_code_in_cc(env->enc, from, cc)
5728#ifdef CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
5729 && !IS_NCCLASS_NOT(cc)
5730#endif
5731 ) {
5732 for (i = 0; i < to_len; i++) {
5733 len = ONIGENC_CODE_TO_MBC(env->enc, to[i], buf);
5734 if (i == 0) {
5735 snode = onig_node_new_str(buf, buf + len);
5736 CHECK_NULL_RETURN_MEMERR(snode);
5737
5738 /* char-class expanded multi-char only
5739 compare with string folded at match time. */
5740 NSTRING_SET_AMBIG(snode);
5741 }
5742 else {
5743 r = onig_node_str_cat(snode, buf, buf + len);
5744 if (r < 0) {
5745 onig_node_free(snode);
5746 return r;
5747 }
5748 }
5749 }
5750
5751 *(iarg->ptail) = onig_node_new_alt(snode, NULL_NODE);
5752 CHECK_NULL_RETURN_MEMERR(*(iarg->ptail));
5753 iarg->ptail = &(NCDR((*(iarg->ptail))));
5754 }
5755 }
5756
5757 return 0;
5758}
5759
5760static int
5761cclass_case_fold(Node** np, CClassNode* cc, CClassNode* asc_cc, ScanEnv* env)
5762{
5763 int r;
5764 IApplyCaseFoldArg iarg;
5765
5766 iarg.env = env;
5767 iarg.cc = cc;
5768 iarg.asc_cc = asc_cc;
5769 iarg.alt_root = NULL_NODE;
5770 iarg.ptail = &(iarg.alt_root);
5771
5772 r = ONIGENC_APPLY_ALL_CASE_FOLD(env->enc, env->case_fold_flag,
5773 i_apply_case_fold, &iarg);
5774 if (r != 0) {
5775 onig_node_free(iarg.alt_root);
5776 return r;
5777 }
5778 if (IS_NOT_NULL(iarg.alt_root)) {
5779 Node* work = onig_node_new_alt(*np, iarg.alt_root);
5780 if (IS_NULL(work)) {
5781 onig_node_free(iarg.alt_root);
5782 return ONIGERR_MEMORY;
5783 }
5784 *np = work;
5785 }
5786 return r;
5787}
5788
5789static int
5790node_linebreak(Node** np, ScanEnv* env)
5791{
5792 /* same as (?>\x0D\x0A|[\x0A-\x0D\x{85}\x{2028}\x{2029}]) */
5793 Node* left = NULL;
5794 Node* right = NULL;
5795 Node* target1 = NULL;
5796 Node* target2 = NULL;
5797 CClassNode* cc;
5798 int num1, num2, r;
5799 UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN * 2];
5800
5801 /* \x0D\x0A */
5802 num1 = ONIGENC_CODE_TO_MBC(env->enc, 0x0D, buf);
5803 if (num1 < 0) return num1;
5804 num2 = ONIGENC_CODE_TO_MBC(env->enc, 0x0A, buf + num1);
5805 if (num2 < 0) return num2;
5806 left = node_new_str_raw(buf, buf + num1 + num2);
5807 if (IS_NULL(left)) goto err;
5808
5809 /* [\x0A-\x0D] or [\x0A-\x0D\x{85}\x{2028}\x{2029}] */
5810 right = node_new_cclass();
5811 if (IS_NULL(right)) goto err;
5812 cc = NCCLASS(right);
5813 if (ONIGENC_MBC_MINLEN(env->enc) > 1) {
5814 r = add_code_range(&(cc->mbuf), env, 0x0A, 0x0D);
5815 if (r != 0) goto err;
5816 }
5817 else {
5818 bitset_set_range(env, cc->bs, 0x0A, 0x0D);
5819 }
5820
5821 /* TODO: move this block to enc/unicode.c */
5822 if (ONIGENC_IS_UNICODE(env->enc)) {
5823 /* UTF-8, UTF-16BE/LE, UTF-32BE/LE */
5824 r = add_code_range(&(cc->mbuf), env, 0x85, 0x85);
5825 if (r != 0) goto err;
5826 r = add_code_range(&(cc->mbuf), env, 0x2028, 0x2029);
5827 if (r != 0) goto err;
5828 }
5829
5830 /* ...|... */
5831 target1 = onig_node_new_alt(right, NULL_NODE);
5832 if (IS_NULL(target1)) goto err;
5833 right = NULL;
5834 target2 = onig_node_new_alt(left, target1);
5835 if (IS_NULL(target2)) goto err;
5836 left = NULL;
5837 target1 = NULL;
5838
5839 /* (?>...) */
5840 *np = node_new_enclose(ENCLOSE_STOP_BACKTRACK);
5841 if (IS_NULL(*np)) goto err;
5842 NENCLOSE(*np)->target = target2;
5843 return ONIG_NORMAL;
5844
5845 err:
5846 onig_node_free(left);
5847 onig_node_free(right);
5848 onig_node_free(target1);
5849 onig_node_free(target2);
5850 return ONIGERR_MEMORY;
5851}
5852
5853static int
5854propname2ctype(ScanEnv* env, const char* propname)
5855{
5856 UChar* name = (UChar* )propname;
5857 UChar* name_end = name + strlen(propname);
5858 int ctype = env->enc->property_name_to_ctype(ONIG_ENCODING_ASCII,
5859 name, name_end);
5860 if (ctype < 0) {
5861 onig_scan_env_set_error_string(env, ctype, name, name_end);
5862 }
5863 return ctype;
5864}
5865
5866static int
5867add_property_to_cc(CClassNode* cc, const char* propname, int not, ScanEnv* env)
5868{
5869 int ctype = propname2ctype(env, propname);
5870 if (ctype < 0) return ctype;
5871 return add_ctype_to_cc(cc, ctype, not, 0, env);
5872}
5873
5874/*
5875 * helper methods for node_extended_grapheme_cluster (/\X/)
5876 */
5877static int
5878create_property_node(Node **np, ScanEnv* env, const char* propname)
5879{
5880 int r;
5881 CClassNode* cc;
5882
5883 *np = node_new_cclass();
5884 if (IS_NULL(*np)) return ONIGERR_MEMORY;
5885 cc = NCCLASS(*np);
5886 r = add_property_to_cc(cc, propname, 0, env);
5887 if (r != 0)
5888 onig_node_free(*np);
5889 return r;
5890}
5891
5892static int
5893quantify_node(Node **np, int lower, int upper)
5894{
5895 Node* tmp = node_new_quantifier(lower, upper, 0);
5896 if (IS_NULL(tmp)) return ONIGERR_MEMORY;
5897 NQTFR(tmp)->target = *np;
5898 *np = tmp;
5899 return 0;
5900}
5901
5902static int
5903quantify_property_node(Node **np, ScanEnv* env, const char* propname, char repetitions)
5904{
5905 int r;
5906 int lower = 0;
5907 int upper = REPEAT_INFINITE;
5908
5909 r = create_property_node(np, env, propname);
5910 if (r != 0) return r;
5911 switch (repetitions) {
5912 case '?': upper = 1; break;
5913 case '+': lower = 1; break;
5914 case '*': break;
5915 case '2': lower = upper = 2; break;
5916 default : return ONIGERR_PARSER_BUG;
5917 }
5918 return quantify_node(np, lower, upper);
5919}
5920
5921#define LIST 0
5922#define ALT 1
5923
5924/* IMPORTANT: Make sure node_array ends with NULL_NODE */
5925static int
5926create_node_from_array(int kind, Node **np, Node **node_array)
5927{
5928 Node* tmp = NULL_NODE;
5929 int i = 0;
5930
5931 while (node_array[i] != NULL_NODE) i++;
5932 while (--i >= 0) {
5933 *np = kind==LIST ? node_new_list(node_array[i], tmp)
5934 : onig_node_new_alt(node_array[i], tmp);
5935 if (IS_NULL(*np)) {
5936 while (i >= 0) {
5937 onig_node_free(node_array[i]);
5938 node_array[i--] = NULL_NODE;
5939 }
5940 onig_node_free(tmp);
5941 return ONIGERR_MEMORY;
5942 }
5943 else
5944 node_array[i] = NULL_NODE;
5945 tmp = *np;
5946 }
5947 return 0;
5948}
5949
5950#define R_ERR(call) r=(call);if(r!=0)goto err
5951
5952/* Memory layout for common node array:
5953 * The main purpose is to be able to easily free all leftover nodes
5954 * after an error. As a side effect, we share some memory.
5955 *
5956 * The layout is as shown below (each line corresponds to one call of
5957 * create_node_from_array()). Because create_node_from_array sets all
5958 * nodes of the source to NULL_NODE, we can overlap the target array
5959 * as long as we do not override the actual target location.
5960 *
5961 * Target Array name Index
5962 *
5963 * node_array 0 1 2 3 4 5 6 7 8 9 A B C D E F G H
5964 * top_alts alts[5] 0 1 2 3 4*
5965 * alts+2 list[4] 0 1 2 3*
5966 * list+1 core_alts[8] 0 1 2 3 4 5 6 7*
5967 * core_alts+0 H_list[4] 0 1 2 3*
5968 * H_list+1 H_alt2[4] 0 1 2 3*
5969 * H_alt2+1 H_list2[3] 0 1 2*
5970 * core_alts+4 XP_list[3] 0 1 2*
5971 * XP_list+1 Ex_list[4] 0 1 2 3*
5972 * core_alts+5 CC_list[3] 0 1 2*
5973 * CC_list+1 CC_inner_list[5] 0 1 2 3 4*
5974 */
5975#define NODE_COMMON_SIZE 18
5976
5977static int
5978node_extended_grapheme_cluster(Node** np, ScanEnv* env)
5979{
5980 Node* tmp = NULL;
5981 Node* np1 = NULL;
5982 Node* top_alt = NULL;
5983 int r = 0;
5984 int num1;
5985 int i;
5986 int any_target_position;
5987 UChar buf[ONIGENC_CODE_TO_MBC_MAXLEN * 2];
5988 OnigOptionType option;
5989 /* node_common is function-global so that we can free all nodes
5990 * in case of error. Unused slots are set to NULL_NODE at all times. */
5991 Node *node_common[NODE_COMMON_SIZE];
5992 Node **alts = node_common+0; /* size: 5 */
5993
5994 for (i=0; i<NODE_COMMON_SIZE; i++)
5995 node_common[i] = NULL_NODE;
5996
5997 /* CRLF, common for both Unicode and non-Unicode */
5998 /* \x0D\x0A */
5999 r = ONIGENC_CODE_TO_MBC(env->enc, 0x0D, buf);
6000 if (r < 0) goto err;
6001 num1 = r;
6002 r = ONIGENC_CODE_TO_MBC(env->enc, 0x0A, buf + num1);
6003 if (r < 0) goto err;
6004 alts[0] = node_new_str_raw(buf, buf + num1 + r);
6005 if (IS_NULL(alts[0])) goto err;
6006
6007#ifdef USE_UNICODE_PROPERTIES
6008 if (ONIGENC_IS_UNICODE(env->enc)) { /* UTF-8, UTF-16BE/LE, UTF-32BE/LE */
6009 CClassNode* cc;
6010
6011 if (propname2ctype(env, "Grapheme_Cluster_Break=Extend") < 0) goto err;
6012 /* Unicode 11.0.0
6013 * CRLF (already done)
6014 * | [Control CR LF]
6015 * | precore* core postcore*
6016 * | . (to catch invalid stuff, because this seems to be spec for String#grapheme_clusters) */
6017
6018 /* [Control CR LF] (CR and LF are not in the spec, but this is a conformed fix) */
6019 alts[1] = node_new_cclass();
6020 if (IS_NULL(alts[1])) goto err;
6021 cc = NCCLASS(alts[1]);
6022 R_ERR(add_property_to_cc(cc, "Grapheme_Cluster_Break=Control", 0, env));
6023 if (ONIGENC_MBC_MINLEN(env->enc) > 1) { /* UTF-16/UTF-32 */
6024 R_ERR(add_code_range(&(cc->mbuf), env, 0x000A, 0x000A)); /* CR */
6025 R_ERR(add_code_range(&(cc->mbuf), env, 0x000D, 0x000D)); /* LF */
6026 }
6027 else {
6028 BITSET_SET_BIT(cc->bs, 0x0a);
6029 BITSET_SET_BIT(cc->bs, 0x0d);
6030 }
6031
6032 /* precore* core postcore* */
6033 {
6034 Node **list = alts + 3; /* size: 4 */
6035
6036 /* precore*; precore := Prepend */
6037 R_ERR(quantify_property_node(list+0, env, "Grapheme_Cluster_Break=Prepend", '*'));
6038
6039 /* core := hangul-syllable
6040 * | ri-sequence
6041 * | xpicto-sequence
6042 * | conjunctCluster
6043 * | [^Control CR LF] */
6044 {
6045 Node **core_alts = list + 2; /* size: 8 */
6046
6047 /* hangul-syllable :=
6048 * L* (V+ | LV V* | LVT) T*
6049 * | L+
6050 * | T+ */
6051 /* hangul-syllable is an alternative (would be called H_alt)
6052 * inside an alternative, but we flatten it into core_alts */
6053
6054 /* L* (V+ | LV V* | LVT) T* */
6055 {
6056 Node **H_list = core_alts + 1; /* size: 4 */
6057 R_ERR(quantify_property_node(H_list+0, env, "Grapheme_Cluster_Break=L", '*'));
6058
6059 /* V+ | LV V* | LVT */
6060 {
6061 Node **H_alt2 = H_list + 2; /* size: 4 */
6062 R_ERR(quantify_property_node(H_alt2+0, env, "Grapheme_Cluster_Break=V", '+'));
6063
6064 /* LV V* */
6065 {
6066 Node **H_list2 = H_alt2 + 2; /* size: 3 */
6067
6068 R_ERR(create_property_node(H_list2+0, env, "Grapheme_Cluster_Break=LV"));
6069 R_ERR(quantify_property_node(H_list2+1, env, "Grapheme_Cluster_Break=V", '*'));
6070 R_ERR(create_node_from_array(LIST, H_alt2+1, H_list2));
6071 }
6072
6073 R_ERR(create_property_node(H_alt2+2, env, "Grapheme_Cluster_Break=LVT"));
6074 R_ERR(create_node_from_array(ALT, H_list+1, H_alt2));
6075 }
6076
6077 R_ERR(quantify_property_node(H_list+2, env, "Grapheme_Cluster_Break=T", '*'));
6078 R_ERR(create_node_from_array(LIST, core_alts+0, H_list));
6079 }
6080
6081 R_ERR(quantify_property_node(core_alts+1, env, "Grapheme_Cluster_Break=L", '+'));
6082 R_ERR(quantify_property_node(core_alts+2, env, "Grapheme_Cluster_Break=T", '+'));
6083 /* end of hangul-syllable */
6084
6085 /* ri-sequence := RI RI */
6086 R_ERR(quantify_property_node(core_alts+3, env, "Regional_Indicator", '2'));
6087
6088 /* xpicto-sequence := \p{Extended_Pictographic} (Extend* ZWJ \p{Extended_Pictographic})* */
6089 {
6090 Node **XP_list = core_alts + 5; /* size: 3 */
6091 R_ERR(create_property_node(XP_list+0, env, "Extended_Pictographic"));
6092
6093 /* (Extend* ZWJ \p{Extended_Pictographic})* */
6094 {
6095 Node **Ex_list = XP_list + 2; /* size: 4 */
6096 /* assert(Ex_list+4 == node_common+NODE_COMMON_SIZE); */
6097 R_ERR(quantify_property_node(Ex_list+0, env, "Grapheme_Cluster_Break=Extend", '*'));
6098
6099 /* ZWJ (ZERO WIDTH JOINER) */
6100 r = ONIGENC_CODE_TO_MBC(env->enc, 0x200D, buf);
6101 if (r < 0) goto err;
6102 Ex_list[1] = node_new_str_raw(buf, buf + r);
6103 if (IS_NULL(Ex_list[1])) goto err;
6104
6105 R_ERR(create_property_node(Ex_list+2, env, "Extended_Pictographic"));
6106 R_ERR(create_node_from_array(LIST, XP_list+1, Ex_list));
6107 }
6108 R_ERR(quantify_node(XP_list+1, 0, REPEAT_INFINITE)); /* TODO: Check about node freeing */
6109
6110 R_ERR(create_node_from_array(LIST, core_alts+4, XP_list));
6111 }
6112
6113 /* conjunctCluster := \p{InCB=Consonant} ([\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Linker} [\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Consonant})+ */
6114 {
6115 // \p{InCB=Consonant}
6116 Node **CC_list = core_alts + 6; /* size: 3 */
6117 R_ERR(create_property_node(CC_list+0, env, "InCB=Consonant"));
6118
6119 {
6120 Node **CC_inner_list = CC_list + 2; /* size: 5 */
6121 {
6122 // [\p{InCB=Extend} \p{InCB=Linker}]*
6123 R_ERR(create_property_node(CC_inner_list+0, env, "InCB=Extend"));
6124 R_ERR(add_property_to_cc(NCCLASS(CC_inner_list[0]), "InCB=Linker", 0, env));
6125 R_ERR(quantify_node(CC_inner_list+0, 0, REPEAT_INFINITE));
6126 }
6127
6128 // \p{InCB=Linker}
6129 R_ERR(create_property_node(CC_inner_list+1, env, "InCB=Linker"));
6130
6131 {
6132 // [\p{InCB=Extend} \p{InCB=Linker}]*
6133 R_ERR(create_property_node(CC_inner_list+2, env, "InCB=Extend"));
6134 R_ERR(add_property_to_cc(NCCLASS(CC_inner_list[2]), "InCB=Linker", 0, env));
6135 R_ERR(quantify_node(CC_inner_list+2, 0, REPEAT_INFINITE));
6136 }
6137
6138 // \p{InCB=Consonant}
6139 R_ERR(create_property_node(CC_inner_list+3, env, "InCB=Consonant"));
6140
6141 // ([\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Linker} [\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Consonant})
6142 R_ERR(create_node_from_array(LIST, CC_list+1, CC_inner_list));
6143
6144 // (...)+
6145 R_ERR(quantify_node(CC_list+1, 1, REPEAT_INFINITE));
6146 }
6147
6148 // \p{InCB=Consonant} ([\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Linker} [\p{InCB=Extend} \p{InCB=Linker}]* \p{InCB=Consonant})+
6149 R_ERR(create_node_from_array(LIST, core_alts+5, CC_list));
6150 }
6151
6152 /* [^Control CR LF] */
6153 core_alts[6] = node_new_cclass();
6154 if (IS_NULL(core_alts[6])) goto err;
6155 cc = NCCLASS(core_alts[6]);
6156 if (ONIGENC_MBC_MINLEN(env->enc) > 1) { /* UTF-16/UTF-32 */
6157 BBuf *inverted_buf = NULL;
6158
6159 /* TODO: fix false warning */
6160 const int dup_not_warned = env->warnings_flag | ~ONIG_SYN_WARN_CC_DUP;
6161 env->warnings_flag |= ONIG_SYN_WARN_CC_DUP;
6162
6163 /* Start with a positive buffer and invert at the end.
6164 * Otherwise, adding single-character ranges work the wrong way. */
6165 R_ERR(add_property_to_cc(cc, "Grapheme_Cluster_Break=Control", 0, env));
6166 R_ERR(add_code_range(&(cc->mbuf), env, 0x000A, 0x000A)); /* CR */
6167 R_ERR(add_code_range(&(cc->mbuf), env, 0x000D, 0x000D)); /* LF */
6168 R_ERR(not_code_range_buf(env->enc, cc->mbuf, &inverted_buf, env));
6169 bbuf_free(cc->mbuf);
6170 cc->mbuf = inverted_buf;
6171
6172 env->warnings_flag &= dup_not_warned; /* TODO: fix false warning */
6173 }
6174 else {
6175 R_ERR(add_property_to_cc(cc, "Grapheme_Cluster_Break=Control", 1, env));
6176 BITSET_CLEAR_BIT(cc->bs, 0x0a);
6177 BITSET_CLEAR_BIT(cc->bs, 0x0d);
6178 }
6179
6180 R_ERR(create_node_from_array(ALT, list+1, core_alts));
6181 }
6182
6183 /* postcore*; postcore = [Extend ZWJ SpacingMark] */
6184 R_ERR(create_property_node(list+2, env, "Grapheme_Cluster_Break=Extend"));
6185 cc = NCCLASS(list[2]);
6186 R_ERR(add_property_to_cc(cc, "Grapheme_Cluster_Break=SpacingMark", 0, env));
6187 R_ERR(add_code_range(&(cc->mbuf), env, 0x200D, 0x200D));
6188 R_ERR(quantify_node(list+2, 0, REPEAT_INFINITE));
6189
6190 R_ERR(create_node_from_array(LIST, alts+2, list));
6191 }
6192
6193 any_target_position = 3;
6194 }
6195 else
6196#endif /* USE_UNICODE_PROPERTIES */
6197 {
6198 any_target_position = 1;
6199 }
6200
6201 /* PerlSyntax: (?s:.), RubySyntax: (?m:.), common for both Unicode and non-Unicode */
6202 /* Not in Unicode spec (UAX #29), but added to catch invalid stuff,
6203 * because this is Ruby spec for String#grapheme_clusters. */
6204 np1 = node_new_anychar();
6205 if (IS_NULL(np1)) goto err;
6206
6207 option = env->option;
6208 ONOFF(option, ONIG_OPTION_MULTILINE, 0);
6209 tmp = node_new_option(option);
6210 if (IS_NULL(tmp)) goto err;
6211 NENCLOSE(tmp)->target = np1;
6212 alts[any_target_position] = tmp;
6213 np1 = NULL;
6214
6215 R_ERR(create_node_from_array(ALT, &top_alt, alts));
6216
6217 /* (?>): For efficiency, because there is no text piece
6218 * that is not in a grapheme cluster, and there is only one way
6219 * to split a string into grapheme clusters. */
6220 tmp = node_new_enclose(ENCLOSE_STOP_BACKTRACK);
6221 if (IS_NULL(tmp)) goto err;
6222 NENCLOSE(tmp)->target = top_alt;
6223 np1 = tmp;
6224
6225#ifdef USE_UNICODE_PROPERTIES
6226 if (ONIGENC_IS_UNICODE(env->enc)) {
6227 /* Don't ignore case. */
6228 option = env->option;
6229 ONOFF(option, ONIG_OPTION_IGNORECASE, 1);
6230 *np = node_new_option(option);
6231 if (IS_NULL(*np)) goto err;
6232 NENCLOSE(*np)->target = np1;
6233 }
6234 else
6235#endif
6236 {
6237 *np = np1;
6238 }
6239 return ONIG_NORMAL;
6240
6241 err:
6242 onig_node_free(np1);
6243 for (i=0; i<NODE_COMMON_SIZE; i++)
6244 onig_node_free(node_common[i]);
6245 return (r == 0) ? ONIGERR_MEMORY : r;
6246}
6247#undef R_ERR
6248
6249static int
6250countbits(unsigned int bits)
6251{
6252 bits = (bits & 0x55555555) + ((bits >> 1) & 0x55555555);
6253 bits = (bits & 0x33333333) + ((bits >> 2) & 0x33333333);
6254 bits = (bits & 0x0f0f0f0f) + ((bits >> 4) & 0x0f0f0f0f);
6255 bits = (bits & 0x00ff00ff) + ((bits >> 8) & 0x00ff00ff);
6256 return (bits & 0x0000ffff) + ((bits >>16) & 0x0000ffff);
6257}
6258
6259static int
6260is_onechar_cclass(CClassNode* cc, OnigCodePoint* code)
6261{
6262 const OnigCodePoint not_found = ONIG_LAST_CODE_POINT;
6263 OnigCodePoint c = not_found;
6264 int i;
6265 BBuf *bbuf = cc->mbuf;
6266
6267 if (IS_NCCLASS_NOT(cc)) return 0;
6268
6269 /* check bbuf */
6270 if (IS_NOT_NULL(bbuf)) {
6271 OnigCodePoint n, *data;
6272 GET_CODE_POINT(n, bbuf->p);
6273 data = (OnigCodePoint* )(bbuf->p) + 1;
6274 if ((n == 1) && (data[0] == data[1])) {
6275 /* only one char found in the bbuf, save the code point. */
6276 c = data[0];
6277 if (((c < SINGLE_BYTE_SIZE) && BITSET_AT(cc->bs, c))) {
6278 /* skip if c is included in the bitset */
6279 c = not_found;
6280 }
6281 }
6282 else {
6283 return 0; /* the bbuf contains multiple chars */
6284 }
6285 }
6286
6287 /* check bitset */
6288 for (i = 0; i < BITSET_SIZE; i++) {
6289 Bits b1 = cc->bs[i];
6290 if (b1 != 0) {
6291 if (((b1 & (b1 - 1)) == 0) && (c == not_found)) {
6292 c = BITS_IN_ROOM * i + countbits(b1 - 1);
6293 }
6294 else {
6295 return 0; /* the character class contains multiple chars */
6296 }
6297 }
6298 }
6299
6300 if (c != not_found) {
6301 *code = c;
6302 return 1;
6303 }
6304
6305 /* the character class contains no char. */
6306 return 0;
6307}
6308
6309
6310static int
6311parse_exp(Node** np, OnigToken* tok, int term,
6312 UChar** src, UChar* end, ScanEnv* env)
6313{
6314 int r, len, group = 0;
6315 Node* qn;
6316 Node** targetp;
6317 unsigned int parse_depth;
6318
6319 *np = NULL;
6320 if (tok->type == (enum TokenSyms )term)
6321 goto end_of_token;
6322
6323 parse_depth = env->parse_depth;
6324
6325 switch (tok->type) {
6326 case TK_ALT:
6327 case TK_EOT:
6328 end_of_token:
6329 *np = node_new_empty();
6330 return tok->type;
6331 break;
6332
6333 case TK_SUBEXP_OPEN:
6334 r = parse_enclose(np, tok, TK_SUBEXP_CLOSE, src, end, env);
6335 if (r < 0) return r;
6336 if (r == 1) group = 1;
6337 else if (r == 2) { /* option only */
6338 Node* target;
6339 OnigOptionType prev = env->option;
6340
6341 env->option = NENCLOSE(*np)->option;
6342 r = fetch_token(tok, src, end, env);
6343 if (r < 0) {
6344 env->option = prev;
6345 return r;
6346 }
6347 r = parse_subexp(&target, tok, term, src, end, env);
6348 env->option = prev;
6349 if (r < 0) {
6350 onig_node_free(target);
6351 return r;
6352 }
6353 NENCLOSE(*np)->target = target;
6354 return tok->type;
6355 }
6356 break;
6357
6358 case TK_SUBEXP_CLOSE:
6359 if (! IS_SYNTAX_BV(env->syntax, ONIG_SYN_ALLOW_UNMATCHED_CLOSE_SUBEXP))
6360 return ONIGERR_UNMATCHED_CLOSE_PARENTHESIS;
6361
6362 if (tok->escaped) goto tk_raw_byte;
6363 else goto tk_byte;
6364 break;
6365
6366 case TK_LINEBREAK:
6367 r = node_linebreak(np, env);
6368 if (r < 0) return r;
6369 break;
6370
6371 case TK_EXTENDED_GRAPHEME_CLUSTER:
6372 r = node_extended_grapheme_cluster(np, env);
6373 if (r < 0) return r;
6374 break;
6375
6376 case TK_KEEP:
6377 *np = onig_node_new_anchor(ANCHOR_KEEP);
6378 CHECK_NULL_RETURN_MEMERR(*np);
6379 break;
6380
6381 case TK_STRING:
6382 tk_byte:
6383 {
6384 *np = node_new_str(tok->backp, *src);
6385 CHECK_NULL_RETURN_MEMERR(*np);
6386
6387 string_loop:
6388 while (1) {
6389 r = fetch_token(tok, src, end, env);
6390 if (r < 0) return r;
6391 if (r == TK_STRING) {
6392 r = onig_node_str_cat(*np, tok->backp, *src);
6393 }
6394#ifndef NUMBERED_CHAR_IS_NOT_CASE_AMBIG
6395 else if (r == TK_CODE_POINT) {
6396 r = node_str_cat_codepoint(*np, env->enc, tok->u.code);
6397 }
6398#endif
6399 else {
6400 break;
6401 }
6402 if (r < 0) return r;
6403 }
6404
6405 string_end:
6406 targetp = np;
6407 goto repeat;
6408 }
6409 break;
6410
6411 case TK_RAW_BYTE:
6412 tk_raw_byte:
6413 {
6414 *np = node_new_str_raw_char((UChar )tok->u.c);
6415 CHECK_NULL_RETURN_MEMERR(*np);
6416 len = 1;
6417 while (1) {
6418 if (len >= ONIGENC_MBC_MINLEN(env->enc)) {
6419 if (len == enclen(env->enc, NSTR(*np)->s, NSTR(*np)->end)) {
6420 r = fetch_token(tok, src, end, env);
6421 NSTRING_CLEAR_RAW(*np);
6422 goto string_end;
6423 }
6424 }
6425
6426 r = fetch_token(tok, src, end, env);
6427 if (r < 0) return r;
6428 if (r != TK_RAW_BYTE) {
6429 /* Don't use this, it is wrong for little endian encodings. */
6430#ifdef USE_PAD_TO_SHORT_BYTE_CHAR
6431 int rem;
6432 if (len < ONIGENC_MBC_MINLEN(env->enc)) {
6433 rem = ONIGENC_MBC_MINLEN(env->enc) - len;
6434 (void )node_str_head_pad(NSTR(*np), rem, (UChar )0);
6435 if (len + rem == enclen(env->enc, NSTR(*np)->s)) {
6436 NSTRING_CLEAR_RAW(*np);
6437 goto string_end;
6438 }
6439 }
6440#endif
6441 return ONIGERR_TOO_SHORT_MULTI_BYTE_STRING;
6442 }
6443
6444 r = node_str_cat_char(*np, (UChar )tok->u.c);
6445 if (r < 0) return r;
6446
6447 len++;
6448 }
6449 }
6450 break;
6451
6452 case TK_CODE_POINT:
6453 {
6454 *np = node_new_empty();
6455 CHECK_NULL_RETURN_MEMERR(*np);
6456 r = node_str_cat_codepoint(*np, env->enc, tok->u.code);
6457 if (r != 0) return r;
6458#ifdef NUMBERED_CHAR_IS_NOT_CASE_AMBIG
6459 NSTRING_SET_RAW(*np);
6460#else
6461 goto string_loop;
6462#endif
6463 }
6464 break;
6465
6466 case TK_QUOTE_OPEN:
6467 {
6468 OnigCodePoint end_op[2];
6469 UChar *qstart, *qend, *nextp;
6470
6471 end_op[0] = (OnigCodePoint )MC_ESC(env->syntax);
6472 end_op[1] = (OnigCodePoint )'E';
6473 qstart = *src;
6474 qend = find_str_position(end_op, 2, qstart, end, &nextp, env->enc);
6475 if (IS_NULL(qend)) {
6476 nextp = qend = end;
6477 }
6478 *np = node_new_str(qstart, qend);
6479 CHECK_NULL_RETURN_MEMERR(*np);
6480 *src = nextp;
6481 }
6482 break;
6483
6484 case TK_CHAR_TYPE:
6485 {
6486 switch (tok->u.prop.ctype) {
6487 case ONIGENC_CTYPE_WORD:
6488 *np = node_new_ctype(tok->u.prop.ctype, tok->u.prop.not,
6489 IS_ASCII_RANGE(env->option));
6490 CHECK_NULL_RETURN_MEMERR(*np);
6491 break;
6492
6493 case ONIGENC_CTYPE_SPACE:
6494 case ONIGENC_CTYPE_DIGIT:
6495 case ONIGENC_CTYPE_XDIGIT:
6496 {
6497 CClassNode* cc;
6498
6499 *np = node_new_cclass();
6500 CHECK_NULL_RETURN_MEMERR(*np);
6501 cc = NCCLASS(*np);
6502 r = add_ctype_to_cc(cc, tok->u.prop.ctype, 0,
6503 IS_ASCII_RANGE(env->option), env);
6504 if (r != 0) return r;
6505 if (tok->u.prop.not != 0) NCCLASS_SET_NOT(cc);
6506 }
6507 break;
6508
6509 default:
6510 return ONIGERR_PARSER_BUG;
6511 break;
6512 }
6513 }
6514 break;
6515
6516 case TK_CHAR_PROPERTY:
6517 r = parse_char_property(np, tok, src, end, env);
6518 if (r != 0) return r;
6519 break;
6520
6521 case TK_CC_OPEN:
6522 {
6523 Node *asc_node;
6524 CClassNode* cc;
6525 OnigCodePoint code;
6526
6527 r = parse_char_class(np, &asc_node, tok, src, end, env);
6528 if (r != 0) {
6529 onig_node_free(asc_node);
6530 return r;
6531 }
6532
6533 cc = NCCLASS(*np);
6534 if (is_onechar_cclass(cc, &code)) {
6535 onig_node_free(*np);
6536 onig_node_free(asc_node);
6537 *np = node_new_empty();
6538 CHECK_NULL_RETURN_MEMERR(*np);
6539 r = node_str_cat_codepoint(*np, env->enc, code);
6540 if (r != 0) return r;
6541 goto string_loop;
6542 }
6543 if (IS_IGNORECASE(env->option)) {
6544 r = cclass_case_fold(np, cc, NCCLASS(asc_node), env);
6545 if (r != 0) {
6546 onig_node_free(asc_node);
6547 return r;
6548 }
6549 }
6550 onig_node_free(asc_node);
6551 }
6552 break;
6553
6554 case TK_ANYCHAR:
6555 *np = node_new_anychar();
6556 CHECK_NULL_RETURN_MEMERR(*np);
6557 break;
6558
6559 case TK_ANYCHAR_ANYTIME:
6560 *np = node_new_anychar();
6561 CHECK_NULL_RETURN_MEMERR(*np);
6562 qn = node_new_quantifier(0, REPEAT_INFINITE, 0);
6563 CHECK_NULL_RETURN_MEMERR(qn);
6564 NQTFR(qn)->target = *np;
6565 *np = qn;
6566 break;
6567
6568 case TK_BACKREF:
6569 len = tok->u.backref.num;
6570 *np = node_new_backref(len,
6571 (len > 1 ? tok->u.backref.refs : &(tok->u.backref.ref1)),
6572 tok->u.backref.by_name,
6573#ifdef USE_BACKREF_WITH_LEVEL
6574 tok->u.backref.exist_level,
6575 tok->u.backref.level,
6576#endif
6577 env);
6578 CHECK_NULL_RETURN_MEMERR(*np);
6579 break;
6580
6581#ifdef USE_SUBEXP_CALL
6582 case TK_CALL:
6583 {
6584 int gnum = tok->u.call.gnum;
6585
6586 if (gnum < 0 || tok->u.call.rel != 0) {
6587 if (gnum > 0) gnum--;
6588 gnum = BACKREF_REL_TO_ABS(gnum, env);
6589 if (gnum <= 0)
6590 return ONIGERR_INVALID_BACKREF;
6591 }
6592 *np = node_new_call(tok->u.call.name, tok->u.call.name_end, gnum);
6593 CHECK_NULL_RETURN_MEMERR(*np);
6594 env->num_call++;
6595 }
6596 break;
6597#endif
6598
6599 case TK_ANCHOR:
6600 *np = onig_node_new_anchor(tok->u.anchor.subtype);
6601 CHECK_NULL_RETURN_MEMERR(*np);
6602 NANCHOR(*np)->ascii_range = tok->u.anchor.ascii_range;
6603 break;
6604
6605 case TK_OP_REPEAT:
6606 case TK_INTERVAL:
6607 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_CONTEXT_INDEP_REPEAT_OPS)) {
6608 if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_CONTEXT_INVALID_REPEAT_OPS))
6609 return ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED;
6610 else
6611 *np = node_new_empty();
6612 }
6613 else {
6614 goto tk_byte;
6615 }
6616 break;
6617
6618 default:
6619 return ONIGERR_PARSER_BUG;
6620 break;
6621 }
6622
6623 {
6624 targetp = np;
6625
6626 re_entry:
6627 r = fetch_token(tok, src, end, env);
6628 if (r < 0) return r;
6629
6630 repeat:
6631 if (r == TK_OP_REPEAT || r == TK_INTERVAL) {
6632 if (is_invalid_quantifier_target(*targetp))
6633 return ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID;
6634
6635 parse_depth++;
6636 if (parse_depth > ParseDepthLimit)
6637 return ONIGERR_PARSE_DEPTH_LIMIT_OVER;
6638
6639 qn = node_new_quantifier(tok->u.repeat.lower, tok->u.repeat.upper,
6640 (r == TK_INTERVAL ? 1 : 0));
6641 CHECK_NULL_RETURN_MEMERR(qn);
6642 NQTFR(qn)->greedy = tok->u.repeat.greedy;
6643 r = set_quantifier(qn, *targetp, group, env);
6644 if (r < 0) {
6645 onig_node_free(qn);
6646 return r;
6647 }
6648
6649 if (tok->u.repeat.possessive != 0) {
6650 Node* en;
6651 en = node_new_enclose(ENCLOSE_STOP_BACKTRACK);
6652 if (IS_NULL(en)) {
6653 onig_node_free(qn);
6654 return ONIGERR_MEMORY;
6655 }
6656 NENCLOSE(en)->target = qn;
6657 qn = en;
6658 }
6659
6660 if (r == 0) {
6661 *targetp = qn;
6662 }
6663 else if (r == 1) {
6664 onig_node_free(qn);
6665 }
6666 else if (r == 2) { /* split case: /abc+/ */
6667 Node *tmp;
6668
6669 *targetp = node_new_list(*targetp, NULL);
6670 if (IS_NULL(*targetp)) {
6671 onig_node_free(qn);
6672 return ONIGERR_MEMORY;
6673 }
6674 tmp = NCDR(*targetp) = node_new_list(qn, NULL);
6675 if (IS_NULL(tmp)) {
6676 onig_node_free(qn);
6677 return ONIGERR_MEMORY;
6678 }
6679 targetp = &(NCAR(tmp));
6680 }
6681 goto re_entry;
6682 }
6683 }
6684
6685 return r;
6686}
6687
6688static int
6689parse_branch(Node** top, OnigToken* tok, int term,
6690 UChar** src, UChar* end, ScanEnv* env)
6691{
6692 int r;
6693 Node *node, **headp;
6694
6695 *top = NULL;
6696 r = parse_exp(&node, tok, term, src, end, env);
6697 if (r < 0) {
6698 onig_node_free(node);
6699 return r;
6700 }
6701
6702 if (r == TK_EOT || r == term || r == TK_ALT) {
6703 *top = node;
6704 }
6705 else {
6706 *top = node_new_list(node, NULL);
6707 headp = &(NCDR(*top));
6708 while (r != TK_EOT && r != term && r != TK_ALT) {
6709 r = parse_exp(&node, tok, term, src, end, env);
6710 if (r < 0) {
6711 onig_node_free(node);
6712 return r;
6713 }
6714
6715 if (NTYPE(node) == NT_LIST) {
6716 *headp = node;
6717 while (IS_NOT_NULL(NCDR(node))) node = NCDR(node);
6718 headp = &(NCDR(node));
6719 }
6720 else {
6721 *headp = node_new_list(node, NULL);
6722 headp = &(NCDR(*headp));
6723 }
6724 }
6725 }
6726
6727 return r;
6728}
6729
6730/* term_tok: TK_EOT or TK_SUBEXP_CLOSE */
6731static int
6732parse_subexp(Node** top, OnigToken* tok, int term,
6733 UChar** src, UChar* end, ScanEnv* env)
6734{
6735 int r;
6736 Node *node, *topnode, **headp;
6737
6738 *top = NULL;
6739 env->parse_depth++;
6740 if (env->parse_depth > ParseDepthLimit)
6741 return ONIGERR_PARSE_DEPTH_LIMIT_OVER;
6742 r = parse_branch(&node, tok, term, src, end, env);
6743 if (r < 0) {
6744 onig_node_free(node);
6745 return r;
6746 }
6747
6748 if (r == term) {
6749 *top = node;
6750 }
6751 else if (r == TK_ALT) {
6752 topnode = onig_node_new_alt(node, NULL);
6753 headp = &(NCDR(topnode));
6754 while (r == TK_ALT) {
6755 r = fetch_token(tok, src, end, env);
6756 if (r < 0) {
6757 onig_node_free(topnode);
6758 return r;
6759 }
6760 r = parse_branch(&node, tok, term, src, end, env);
6761 if (r < 0) {
6762 onig_node_free(topnode);
6763 return r;
6764 }
6765
6766 *headp = onig_node_new_alt(node, NULL);
6767 headp = &(NCDR(*headp));
6768 }
6769
6770 if (tok->type != (enum TokenSyms )term) {
6771 onig_node_free(topnode);
6772 goto err;
6773 }
6774 *top = topnode;
6775 }
6776 else {
6777 onig_node_free(node);
6778 err:
6779 if (term == TK_SUBEXP_CLOSE)
6780 return ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS;
6781 else
6782 return ONIGERR_PARSER_BUG;
6783 }
6784
6785 env->parse_depth--;
6786 return r;
6787}
6788
6789static int
6790parse_regexp(Node** top, UChar** src, UChar* end, ScanEnv* env)
6791{
6792 int r;
6793 OnigToken tok;
6794
6795 r = fetch_token(&tok, src, end, env);
6796 if (r < 0) return r;
6797 r = parse_subexp(top, &tok, TK_EOT, src, end, env);
6798 if (r < 0) return r;
6799
6800#ifdef USE_SUBEXP_CALL
6801 if (env->num_call > 0) {
6802 /* Capture the pattern itself. It is used for (?R), (?0) and \g<0>. */
6803 const int num = 0;
6804 Node* np;
6805 np = node_new_enclose_memory(env->option, 0);
6806 CHECK_NULL_RETURN_MEMERR(np);
6807 NENCLOSE(np)->regnum = num;
6808 NENCLOSE(np)->target = *top;
6809 r = scan_env_set_mem_node(env, num, np);
6810 if (r != 0) {
6811 onig_node_free(np);
6812 return r;
6813 }
6814 *top = np;
6815 }
6816#endif
6817 return 0;
6818}
6819
6820extern int
6821onig_parse_make_tree(Node** root, const UChar* pattern, const UChar* end,
6822 regex_t* reg, ScanEnv* env)
6823{
6824 int r;
6825 UChar* p;
6826
6827#ifdef USE_NAMED_GROUP
6828 names_clear(reg);
6829#endif
6830
6831 scan_env_clear(env);
6832 env->option = reg->options;
6833 env->case_fold_flag = reg->case_fold_flag;
6834 env->enc = reg->enc;
6835 env->syntax = reg->syntax;
6836 env->pattern = (UChar* )pattern;
6837 env->pattern_end = (UChar* )end;
6838 env->reg = reg;
6839
6840 *root = NULL;
6841 p = (UChar* )pattern;
6842 r = parse_regexp(root, &p, (UChar* )end, env);
6843 reg->num_mem = env->num_mem;
6844 return r;
6845}
6846
6847extern void
6848onig_scan_env_set_error_string(ScanEnv* env, int ecode ARG_UNUSED,
6849 UChar* arg, UChar* arg_end)
6850{
6851 env->error = arg;
6852 env->error_end = arg_end;
6853}
#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:468
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
Definition st.h:79