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