Ruby  1.9.3p484(2013-11-22revision43786)
regparse.c
Go to the documentation of this file.
1 /* -*- mode:c; c-file-style:"gnu" -*- */
2 /**********************************************************************
3  regparse.c - Oniguruma (regular expression library)
4 **********************************************************************/
5 /*-
6  * Copyright (c) 2002-2008 K.Kosako <sndgk393 AT ybb DOT ne 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 
54  , ( SYN_GNU_REGEX_BV |
64  ,
65  {
66  (OnigCodePoint )'\\' /* esc */
67  , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* anychar '.' */
68  , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* anytime '*' */
69  , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* zero or one time '?' */
70  , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* one or more time '+' */
71  , (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* anychar anytime */
72  }
73 };
74 
76 
77 extern void onig_null_warn(const char* s ARG_UNUSED) { }
78 
79 #ifdef DEFAULT_WARN_FUNCTION
80 static OnigWarnFunc onig_warn = (OnigWarnFunc )DEFAULT_WARN_FUNCTION;
81 #else
82 static OnigWarnFunc onig_warn = onig_null_warn;
83 #endif
84 
85 #ifdef DEFAULT_VERB_WARN_FUNCTION
86 static OnigWarnFunc onig_verb_warn = (OnigWarnFunc )DEFAULT_VERB_WARN_FUNCTION;
87 #else
88 static OnigWarnFunc onig_verb_warn = onig_null_warn;
89 #endif
90 
91 extern void onig_set_warn_func(OnigWarnFunc f)
92 {
93  onig_warn = f;
94 }
95 
96 extern void onig_set_verb_warn_func(OnigWarnFunc f)
97 {
98  onig_verb_warn = f;
99 }
100 
101 static void CC_DUP_WARN(ScanEnv *env);
102 
103 static void
105 {
106  if (IS_NOT_NULL(bbuf)) {
107  if (IS_NOT_NULL(bbuf->p)) xfree(bbuf->p);
108  xfree(bbuf);
109  }
110 }
111 
112 static int
113 bbuf_clone(BBuf** rto, BBuf* from)
114 {
115  int r;
116  BBuf *to;
117 
118  *rto = to = (BBuf* )xmalloc(sizeof(BBuf));
120  r = BBUF_INIT(to, from->alloc);
121  if (r != 0) return r;
122  to->used = from->used;
123  xmemcpy(to->p, from->p, from->used);
124  return 0;
125 }
126 
127 #define BACKREF_REL_TO_ABS(rel_no, env) \
128  ((env)->num_mem + 1 + (rel_no))
129 
130 #define ONOFF(v,f,negative) (negative) ? ((v) &= ~(f)) : ((v) |= (f))
131 
132 #define MBCODE_START_POS(enc) \
133  (OnigCodePoint )(ONIGENC_MBC_MINLEN(enc) > 1 ? 0 : 0x80)
134 
135 #define SET_ALL_MULTI_BYTE_RANGE(enc, pbuf) \
136  add_code_range_to_buf(pbuf, env, MBCODE_START_POS(enc), ~((OnigCodePoint )0))
137 
138 #define ADD_ALL_MULTI_BYTE_RANGE(enc, mbuf) do {\
139  if (! ONIGENC_IS_SINGLEBYTE(enc)) {\
140  r = SET_ALL_MULTI_BYTE_RANGE(enc, &(mbuf));\
141  if (r) return r;\
142  }\
143 } while (0)
144 
145 
146 #define BITSET_SET_BIT_CHKDUP(bs, pos) do { \
147  if (BITSET_AT(bs, pos)) CC_DUP_WARN(env); \
148  BS_ROOM(bs, pos) |= BS_BIT(pos); \
149 } while (0)
150 
151 #define BITSET_IS_EMPTY(bs,empty) do {\
152  int i;\
153  empty = 1;\
154  for (i = 0; i < (int )BITSET_SIZE; i++) {\
155  if ((bs)[i] != 0) {\
156  empty = 0; break;\
157  }\
158  }\
159 } while (0)
160 
161 static void
162 bitset_set_range(ScanEnv *env, BitSetRef bs, int from, int to)
163 {
164  int i;
165  for (i = from; i <= to && i < SINGLE_BYTE_SIZE; i++) {
166  BITSET_SET_BIT_CHKDUP(bs, i);
167  }
168 }
169 
170 #if 0
171 static void
172 bitset_set_all(BitSetRef bs)
173 {
174  int i;
175  for (i = 0; i < BITSET_SIZE; i++) { bs[i] = ~((Bits )0); }
176 }
177 #endif
178 
179 static void
181 {
182  int i;
183  for (i = 0; i < (int )BITSET_SIZE; i++) { bs[i] = ~(bs[i]); }
184 }
185 
186 static void
188 {
189  int i;
190  for (i = 0; i < (int )BITSET_SIZE; i++) { to[i] = ~(from[i]); }
191 }
192 
193 static void
195 {
196  int i;
197  for (i = 0; i < (int )BITSET_SIZE; i++) { dest[i] &= bs[i]; }
198 }
199 
200 static void
202 {
203  int i;
204  for (i = 0; i < (int )BITSET_SIZE; i++) { dest[i] |= bs[i]; }
205 }
206 
207 static void
209 {
210  int i;
211  for (i = 0; i < (int )BITSET_SIZE; i++) { dest[i] = bs[i]; }
212 }
213 
214 extern int
215 onig_strncmp(const UChar* s1, const UChar* s2, int n)
216 {
217  int x;
218 
219  while (n-- > 0) {
220  x = *s2++ - *s1++;
221  if (x) return x;
222  }
223  return 0;
224 }
225 
226 extern void
227 onig_strcpy(UChar* dest, const UChar* src, const UChar* end)
228 {
229  ptrdiff_t len = end - src;
230  if (len > 0) {
231  xmemcpy(dest, src, len);
232  dest[len] = (UChar )0;
233  }
234 }
235 
236 #ifdef USE_NAMED_GROUP
237 static UChar*
239 {
240  ptrdiff_t slen;
241  int term_len, i;
242  UChar *r;
243 
244  slen = end - s;
245  term_len = ONIGENC_MBC_MINLEN(enc);
246 
247  r = (UChar* )xmalloc(slen + term_len);
249  xmemcpy(r, s, slen);
250 
251  for (i = 0; i < term_len; i++)
252  r[slen + i] = (UChar )0;
253 
254  return r;
255 }
256 #endif
257 
258 /* scan pattern methods */
259 #define PEND_VALUE 0
260 
261 #define PFETCH_READY UChar* pfetch_prev
262 #define PEND (p < end ? 0 : 1)
263 #define PUNFETCH p = pfetch_prev
264 #define PINC do { \
265  pfetch_prev = p; \
266  p += enclen(enc, p, end); \
267 } while (0)
268 #define PFETCH(c) do { \
269  c = ((enc->max_enc_len == 1) ? *p : ONIGENC_MBC_TO_CODE(enc, p, end)); \
270  pfetch_prev = p; \
271  p += enclen(enc, p, end); \
272 } while (0)
273 
274 #define PPEEK (p < end ? ONIGENC_MBC_TO_CODE(enc, p, end) : PEND_VALUE)
275 #define PPEEK_IS(c) (PPEEK == (OnigCodePoint )c)
276 
277 static UChar*
278 strcat_capa(UChar* dest, UChar* dest_end, const UChar* src, const UChar* src_end,
279  size_t capa)
280 {
281  UChar* r;
282 
283  if (dest)
284  r = (UChar* )xrealloc(dest, capa + 1);
285  else
286  r = (UChar* )xmalloc(capa + 1);
287 
289  onig_strcpy(r + (dest_end - dest), src, src_end);
290  return r;
291 }
292 
293 /* dest on static area */
294 static UChar*
296  const UChar* src, const UChar* src_end, size_t capa)
297 {
298  UChar* r;
299 
300  r = (UChar* )xmalloc(capa + 1);
302  onig_strcpy(r, dest, dest_end);
303  onig_strcpy(r + (dest_end - dest), src, src_end);
304  return r;
305 }
306 
307 
308 #ifdef USE_ST_LIBRARY
309 
310 #include "ruby/st.h"
311 
312 typedef struct {
313  const UChar* s;
314  const UChar* end;
316 
317 static int
319 {
320  const st_str_end_key *x, *y;
321  const UChar *p, *q;
322  int c;
323 
324  x = (const st_str_end_key *)xp;
325  y = (const st_str_end_key *)yp;
326  if ((x->end - x->s) != (y->end - y->s))
327  return 1;
328 
329  p = x->s;
330  q = y->s;
331  while (p < x->end) {
332  c = (int )*p - (int )*q;
333  if (c != 0) return c;
334 
335  p++; q++;
336  }
337 
338  return 0;
339 }
340 
341 static st_index_t
343 {
344  const st_str_end_key *x = (const st_str_end_key *)xp;
345  const UChar *p;
346  st_index_t val = 0;
347 
348  p = x->s;
349  while (p < x->end) {
350  val = val * 997 + (int )*p++;
351  }
352 
353  return val + (val >> 5);
354 }
355 
356 extern hash_table_type*
358 {
359  static const struct st_hash_type hashType = {
360  str_end_cmp,
361  str_end_hash,
362  };
363 
364  return (hash_table_type* )
365  onig_st_init_table_with_size(&hashType, size);
366 }
367 
368 extern int
370  const UChar* end_key, hash_data_type *value)
371 {
373 
374  key.s = (UChar* )str_key;
375  key.end = (UChar* )end_key;
376 
377  return onig_st_lookup(table, (st_data_t )(&key), value);
378 }
379 
380 extern int
382  const UChar* end_key, hash_data_type value)
383 {
385  int result;
386 
387  key = (st_str_end_key* )xmalloc(sizeof(st_str_end_key));
388  key->s = (UChar* )str_key;
389  key->end = (UChar* )end_key;
390  result = onig_st_insert(table, (st_data_t )key, value);
391  if (result) {
392  xfree(key);
393  }
394  return result;
395 }
396 
397 #endif /* USE_ST_LIBRARY */
398 
399 
400 #ifdef USE_NAMED_GROUP
401 
402 #define INIT_NAME_BACKREFS_ALLOC_NUM 8
403 
404 typedef struct {
406  size_t name_len; /* byte length */
407  int back_num; /* number of backrefs */
410  int* back_refs;
411 } NameEntry;
412 
413 #ifdef USE_ST_LIBRARY
414 
416 typedef st_data_t HashDataType; /* 1.6 st.h doesn't define st_data_t type */
417 
418 #define NAMEBUF_SIZE 24
419 #define NAMEBUF_SIZE_1 25
420 
421 #ifdef ONIG_DEBUG
422 static int
423 i_print_name_entry(UChar* key, NameEntry* e, void* arg)
424 {
425  int i;
426  FILE* fp = (FILE* )arg;
427 
428  fprintf(fp, "%s: ", e->name);
429  if (e->back_num == 0)
430  fputs("-", fp);
431  else if (e->back_num == 1)
432  fprintf(fp, "%d", e->back_ref1);
433  else {
434  for (i = 0; i < e->back_num; i++) {
435  if (i > 0) fprintf(fp, ", ");
436  fprintf(fp, "%d", e->back_refs[i]);
437  }
438  }
439  fputs("\n", fp);
440  return ST_CONTINUE;
441 }
442 
443 extern int
444 onig_print_names(FILE* fp, regex_t* reg)
445 {
446  NameTable* t = (NameTable* )reg->name_table;
447 
448  if (IS_NOT_NULL(t)) {
449  fprintf(fp, "name table\n");
450  onig_st_foreach(t, i_print_name_entry, (HashDataType )fp);
451  fputs("\n", fp);
452  }
453  return 0;
454 }
455 #endif /* ONIG_DEBUG */
456 
457 static int
458 i_free_name_entry(UChar* key, NameEntry* e, void* arg ARG_UNUSED)
459 {
460  xfree(e->name);
461  if (IS_NOT_NULL(e->back_refs)) xfree(e->back_refs);
462  xfree(key);
463  xfree(e);
464  return ST_DELETE;
465 }
466 
467 static int
469 {
470  NameTable* t = (NameTable* )reg->name_table;
471 
472  if (IS_NOT_NULL(t)) {
473  onig_st_foreach(t, i_free_name_entry, 0);
474  }
475  return 0;
476 }
477 
478 extern int
480 {
481  int r;
482  NameTable* t;
483 
484  r = names_clear(reg);
485  if (r) return r;
486 
487  t = (NameTable* )reg->name_table;
488  if (IS_NOT_NULL(t)) onig_st_free_table(t);
489  reg->name_table = (void* )NULL;
490  return 0;
491 }
492 
493 static NameEntry*
494 name_find(regex_t* reg, const UChar* name, const UChar* name_end)
495 {
496  NameEntry* e;
497  NameTable* t = (NameTable* )reg->name_table;
498 
499  e = (NameEntry* )NULL;
500  if (IS_NOT_NULL(t)) {
501  onig_st_lookup_strend(t, name, name_end, (HashDataType* )((void* )(&e)));
502  }
503  return e;
504 }
505 
506 typedef struct {
507  int (*func)(const UChar*, const UChar*,int,int*,regex_t*,void*);
508  regex_t* reg;
509  void* arg;
510  int ret;
512 } INamesArg;
513 
514 static int
516 {
517  int r = (*(arg->func))(e->name,
518  e->name + e->name_len,
519  e->back_num,
520  (e->back_num > 1 ? e->back_refs : &(e->back_ref1)),
521  arg->reg, arg->arg);
522  if (r != 0) {
523  arg->ret = r;
524  return ST_STOP;
525  }
526  return ST_CONTINUE;
527 }
528 
529 extern int
531  int (*func)(const UChar*, const UChar*,int,int*,regex_t*,void*), void* arg)
532 {
533  INamesArg narg;
534  NameTable* t = (NameTable* )reg->name_table;
535 
536  narg.ret = 0;
537  if (IS_NOT_NULL(t)) {
538  narg.func = func;
539  narg.reg = reg;
540  narg.arg = arg;
541  narg.enc = reg->enc; /* should be pattern encoding. */
542  onig_st_foreach(t, i_names, (HashDataType )&narg);
543  }
544  return narg.ret;
545 }
546 
547 static int
549 {
550  int i;
551 
552  if (e->back_num > 1) {
553  for (i = 0; i < e->back_num; i++) {
554  e->back_refs[i] = map[e->back_refs[i]].new_val;
555  }
556  }
557  else if (e->back_num == 1) {
558  e->back_ref1 = map[e->back_ref1].new_val;
559  }
560 
561  return ST_CONTINUE;
562 }
563 
564 extern int
566 {
567  NameTable* t = (NameTable* )reg->name_table;
568 
569  if (IS_NOT_NULL(t)) {
570  onig_st_foreach(t, i_renumber_name, (HashDataType )map);
571  }
572  return 0;
573 }
574 
575 
576 extern int
578 {
579  NameTable* t = (NameTable* )reg->name_table;
580 
581  if (IS_NOT_NULL(t))
582  return (int)t->num_entries;
583  else
584  return 0;
585 }
586 
587 #else /* USE_ST_LIBRARY */
588 
589 #define INIT_NAMES_ALLOC_NUM 8
590 
591 typedef struct {
592  NameEntry* e;
593  int num;
594  int alloc;
595 } NameTable;
596 
597 #ifdef ONIG_DEBUG
598 extern int
599 onig_print_names(FILE* fp, regex_t* reg)
600 {
601  int i, j;
602  NameEntry* e;
603  NameTable* t = (NameTable* )reg->name_table;
604 
605  if (IS_NOT_NULL(t) && t->num > 0) {
606  fprintf(fp, "name table\n");
607  for (i = 0; i < t->num; i++) {
608  e = &(t->e[i]);
609  fprintf(fp, "%s: ", e->name);
610  if (e->back_num == 0) {
611  fputs("-", fp);
612  }
613  else if (e->back_num == 1) {
614  fprintf(fp, "%d", e->back_ref1);
615  }
616  else {
617  for (j = 0; j < e->back_num; j++) {
618  if (j > 0) fprintf(fp, ", ");
619  fprintf(fp, "%d", e->back_refs[j]);
620  }
621  }
622  fputs("\n", fp);
623  }
624  fputs("\n", fp);
625  }
626  return 0;
627 }
628 #endif
629 
630 static int
631 names_clear(regex_t* reg)
632 {
633  int i;
634  NameEntry* e;
635  NameTable* t = (NameTable* )reg->name_table;
636 
637  if (IS_NOT_NULL(t)) {
638  for (i = 0; i < t->num; i++) {
639  e = &(t->e[i]);
640  if (IS_NOT_NULL(e->name)) {
641  xfree(e->name);
642  e->name = NULL;
643  e->name_len = 0;
644  e->back_num = 0;
645  e->back_alloc = 0;
646  if (IS_NOT_NULL(e->back_refs)) xfree(e->back_refs);
647  e->back_refs = (int* )NULL;
648  }
649  }
650  if (IS_NOT_NULL(t->e)) {
651  xfree(t->e);
652  t->e = NULL;
653  }
654  t->num = 0;
655  }
656  return 0;
657 }
658 
659 extern int
661 {
662  int r;
663  NameTable* t;
664 
665  r = names_clear(reg);
666  if (r) return r;
667 
668  t = (NameTable* )reg->name_table;
669  if (IS_NOT_NULL(t)) xfree(t);
670  reg->name_table = NULL;
671  return 0;
672 }
673 
674 static NameEntry*
675 name_find(regex_t* reg, UChar* name, UChar* name_end)
676 {
677  int i, len;
678  NameEntry* e;
679  NameTable* t = (NameTable* )reg->name_table;
680 
681  if (IS_NOT_NULL(t)) {
682  len = name_end - name;
683  for (i = 0; i < t->num; i++) {
684  e = &(t->e[i]);
685  if (len == e->name_len && onig_strncmp(name, e->name, len) == 0)
686  return e;
687  }
688  }
689  return (NameEntry* )NULL;
690 }
691 
692 extern int
694  int (*func)(const UChar*, const UChar*,int,int*,regex_t*,void*), void* arg)
695 {
696  int i, r;
697  NameEntry* e;
698  NameTable* t = (NameTable* )reg->name_table;
699 
700  if (IS_NOT_NULL(t)) {
701  for (i = 0; i < t->num; i++) {
702  e = &(t->e[i]);
703  r = (*func)(e->name, e->name + e->name_len, e->back_num,
704  (e->back_num > 1 ? e->back_refs : &(e->back_ref1)),
705  reg, arg);
706  if (r != 0) return r;
707  }
708  }
709  return 0;
710 }
711 
712 extern int
714 {
715  NameTable* t = (NameTable* )reg->name_table;
716 
717  if (IS_NOT_NULL(t))
718  return t->num;
719  else
720  return 0;
721 }
722 
723 #endif /* else USE_ST_LIBRARY */
724 
725 static int
726 name_add(regex_t* reg, UChar* name, UChar* name_end, int backref, ScanEnv* env)
727 {
728  int alloc;
729  NameEntry* e;
730  NameTable* t = (NameTable* )reg->name_table;
731 
732  if (name_end - name <= 0)
734 
735  e = name_find(reg, name, name_end);
736  if (IS_NULL(e)) {
737 #ifdef USE_ST_LIBRARY
738  if (IS_NULL(t)) {
740  reg->name_table = (void* )t;
741  }
742  e = (NameEntry* )xmalloc(sizeof(NameEntry));
744 
745  e->name = strdup_with_null(reg->enc, name, name_end);
746  if (IS_NULL(e->name)) {
747  xfree(e);
748  return ONIGERR_MEMORY;
749  }
750  onig_st_insert_strend(t, e->name, (e->name + (name_end - name)),
751  (HashDataType )e);
752 
753  e->name_len = name_end - name;
754  e->back_num = 0;
755  e->back_alloc = 0;
756  e->back_refs = (int* )NULL;
757 
758 #else
759 
760  if (IS_NULL(t)) {
761  alloc = INIT_NAMES_ALLOC_NUM;
762  t = (NameTable* )xmalloc(sizeof(NameTable));
764  t->e = NULL;
765  t->alloc = 0;
766  t->num = 0;
767 
768  t->e = (NameEntry* )xmalloc(sizeof(NameEntry) * alloc);
769  if (IS_NULL(t->e)) {
770  xfree(t);
771  return ONIGERR_MEMORY;
772  }
773  t->alloc = alloc;
774  reg->name_table = t;
775  goto clear;
776  }
777  else if (t->num == t->alloc) {
778  int i;
779 
780  alloc = t->alloc * 2;
781  t->e = (NameEntry* )xrealloc(t->e, sizeof(NameEntry) * alloc);
783  t->alloc = alloc;
784 
785  clear:
786  for (i = t->num; i < t->alloc; i++) {
787  t->e[i].name = NULL;
788  t->e[i].name_len = 0;
789  t->e[i].back_num = 0;
790  t->e[i].back_alloc = 0;
791  t->e[i].back_refs = (int* )NULL;
792  }
793  }
794  e = &(t->e[t->num]);
795  t->num++;
796  e->name = strdup_with_null(reg->enc, name, name_end);
797  if (IS_NULL(e->name)) return ONIGERR_MEMORY;
798  e->name_len = name_end - name;
799 #endif
800  }
801 
802  if (e->back_num >= 1 &&
805  name, name_end);
807  }
808 
809  e->back_num++;
810  if (e->back_num == 1) {
811  e->back_ref1 = backref;
812  }
813  else {
814  if (e->back_num == 2) {
816  e->back_refs = (int* )xmalloc(sizeof(int) * alloc);
818  e->back_alloc = alloc;
819  e->back_refs[0] = e->back_ref1;
820  e->back_refs[1] = backref;
821  }
822  else {
823  if (e->back_num > e->back_alloc) {
824  alloc = e->back_alloc * 2;
825  e->back_refs = (int* )xrealloc(e->back_refs, sizeof(int) * alloc);
827  e->back_alloc = alloc;
828  }
829  e->back_refs[e->back_num - 1] = backref;
830  }
831  }
832 
833  return 0;
834 }
835 
836 extern int
838  const UChar* name_end, int** nums)
839 {
840  NameEntry* e = name_find(reg, name, name_end);
841 
843 
844  switch (e->back_num) {
845  case 0:
846  *nums = 0;
847  break;
848  case 1:
849  *nums = &(e->back_ref1);
850  break;
851  default:
852  *nums = e->back_refs;
853  break;
854  }
855  return e->back_num;
856 }
857 
858 extern int
860  const UChar* name_end, OnigRegion *region)
861 {
862  int i, n, *nums;
863 
864  n = onig_name_to_group_numbers(reg, name, name_end, &nums);
865  if (n < 0)
866  return n;
867  else if (n == 0)
868  return ONIGERR_PARSER_BUG;
869  else if (n == 1)
870  return nums[0];
871  else {
872  if (IS_NOT_NULL(region)) {
873  for (i = n - 1; i >= 0; i--) {
874  if (region->beg[nums[i]] != ONIG_REGION_NOTPOS)
875  return nums[i];
876  }
877  }
878  return nums[n - 1];
879  }
880 }
881 
882 #else /* USE_NAMED_GROUP */
883 
884 extern int
885 onig_name_to_group_numbers(regex_t* reg, const UChar* name,
886  const UChar* name_end, int** nums)
887 {
888  return ONIG_NO_SUPPORT_CONFIG;
889 }
890 
891 extern int
892 onig_name_to_backref_number(regex_t* reg, const UChar* name,
893  const UChar* name_end, OnigRegion* region)
894 {
895  return ONIG_NO_SUPPORT_CONFIG;
896 }
897 
898 extern int
900  int (*func)(const UChar*, const UChar*,int,int*,regex_t*,void*), void* arg)
901 {
902  return ONIG_NO_SUPPORT_CONFIG;
903 }
904 
905 extern int
907 {
908  return 0;
909 }
910 #endif /* else USE_NAMED_GROUP */
911 
912 extern int
914 {
916  return 0;
917 
918 #ifdef USE_NAMED_GROUP
919  if (onig_number_of_names(reg) > 0 &&
922  return 0;
923  }
924 #endif
925 
926  return 1;
927 }
928 
929 
930 #define INIT_SCANENV_MEMNODES_ALLOC_SIZE 16
931 
932 static void
934 {
935  int i;
936 
941  env->error = (UChar* )NULL;
942  env->error_end = (UChar* )NULL;
943  env->num_call = 0;
944  env->num_mem = 0;
945 #ifdef USE_NAMED_GROUP
946  env->num_named = 0;
947 #endif
948  env->mem_alloc = 0;
949  env->mem_nodes_dynamic = (Node** )NULL;
950 
951  for (i = 0; i < SCANENV_MEMNODES_SIZE; i++)
952  env->mem_nodes_static[i] = NULL_NODE;
953 
954 #ifdef USE_COMBINATION_EXPLOSION_CHECK
955  env->num_comb_exp_check = 0;
956  env->comb_exp_max_regnum = 0;
957  env->curr_max_regnum = 0;
958  env->has_recursion = 0;
959 #endif
960  env->warnings_flag = 0;
961 }
962 
963 static int
965 {
966  int i, need, alloc;
967  Node** p;
968 
969  need = env->num_mem + 1;
970  if (need >= SCANENV_MEMNODES_SIZE) {
971  if (env->mem_alloc <= need) {
972  if (IS_NULL(env->mem_nodes_dynamic)) {
974  p = (Node** )xmalloc(sizeof(Node*) * alloc);
975  xmemcpy(p, env->mem_nodes_static,
976  sizeof(Node*) * SCANENV_MEMNODES_SIZE);
977  }
978  else {
979  alloc = env->mem_alloc * 2;
980  p = (Node** )xrealloc(env->mem_nodes_dynamic, sizeof(Node*) * alloc);
981  }
983 
984  for (i = env->num_mem + 1; i < alloc; i++)
985  p[i] = NULL_NODE;
986 
987  env->mem_nodes_dynamic = p;
988  env->mem_alloc = alloc;
989  }
990  }
991 
992  env->num_mem++;
993  return env->num_mem;
994 }
995 
996 static int
997 scan_env_set_mem_node(ScanEnv* env, int num, Node* node)
998 {
999  if (env->num_mem >= num)
1000  SCANENV_MEM_NODES(env)[num] = node;
1001  else
1002  return ONIGERR_PARSER_BUG;
1003  return 0;
1004 }
1005 
1006 
1007 #ifdef USE_PARSE_TREE_NODE_RECYCLE
1008 typedef struct _FreeNode {
1009  struct _FreeNode* next;
1010 } FreeNode;
1011 
1012 static FreeNode* FreeNodeList = (FreeNode* )NULL;
1013 #endif
1014 
1015 extern void
1017 {
1018  start:
1019  if (IS_NULL(node)) return ;
1020 
1021  switch (NTYPE(node)) {
1022  case NT_STR:
1023  if (NSTR(node)->capa != 0 &&
1024  IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) {
1025  xfree(NSTR(node)->s);
1026  }
1027  break;
1028 
1029  case NT_LIST:
1030  case NT_ALT:
1031  onig_node_free(NCAR(node));
1032  {
1033  Node* next_node = NCDR(node);
1034 
1035 #ifdef USE_PARSE_TREE_NODE_RECYCLE
1036  {
1037  FreeNode* n = (FreeNode* )node;
1038 
1040  n->next = FreeNodeList;
1041  FreeNodeList = n;
1043  }
1044 #else
1045  xfree(node);
1046 #endif
1047  node = next_node;
1048  goto start;
1049  }
1050  break;
1051 
1052  case NT_CCLASS:
1053  {
1054  CClassNode* cc = NCCLASS(node);
1055 
1056  if (IS_NCCLASS_SHARE(cc)) return ;
1057  if (cc->mbuf)
1058  bbuf_free(cc->mbuf);
1059  }
1060  break;
1061 
1062  case NT_QTFR:
1063  if (NQTFR(node)->target)
1064  onig_node_free(NQTFR(node)->target);
1065  break;
1066 
1067  case NT_ENCLOSE:
1068  if (NENCLOSE(node)->target)
1069  onig_node_free(NENCLOSE(node)->target);
1070  break;
1071 
1072  case NT_BREF:
1073  if (IS_NOT_NULL(NBREF(node)->back_dynamic))
1074  xfree(NBREF(node)->back_dynamic);
1075  break;
1076 
1077  case NT_ANCHOR:
1078  if (NANCHOR(node)->target)
1079  onig_node_free(NANCHOR(node)->target);
1080  break;
1081  }
1082 
1083 #ifdef USE_PARSE_TREE_NODE_RECYCLE
1084  {
1085  FreeNode* n = (FreeNode* )node;
1086 
1088  n->next = FreeNodeList;
1089  FreeNodeList = n;
1091  }
1092 #else
1093  xfree(node);
1094 #endif
1095 }
1096 
1097 #ifdef USE_PARSE_TREE_NODE_RECYCLE
1098 extern int
1100 {
1101  FreeNode* n;
1102 
1103  /* THREAD_ATOMIC_START; */
1104  while (IS_NOT_NULL(FreeNodeList)) {
1105  n = FreeNodeList;
1106  FreeNodeList = FreeNodeList->next;
1107  xfree(n);
1108  }
1109  /* THREAD_ATOMIC_END; */
1110  return 0;
1111 }
1112 #endif
1113 
1114 static Node*
1116 {
1117  Node* node;
1118 
1119 #ifdef USE_PARSE_TREE_NODE_RECYCLE
1121  if (IS_NOT_NULL(FreeNodeList)) {
1122  node = (Node* )FreeNodeList;
1123  FreeNodeList = FreeNodeList->next;
1125  return node;
1126  }
1128 #endif
1129 
1130  node = (Node* )xmalloc(sizeof(Node));
1131  /* xmemset(node, 0, sizeof(Node)); */
1132  return node;
1133 }
1134 
1135 
1136 static void
1138 {
1139  BITSET_CLEAR(cc->bs);
1140  /* cc->base.flags = 0; */
1141  cc->flags = 0;
1142  cc->mbuf = NULL;
1143 }
1144 
1145 static Node*
1147 {
1148  Node* node = node_new();
1149  CHECK_NULL_RETURN(node);
1150 
1151  SET_NTYPE(node, NT_CCLASS);
1152  initialize_cclass(NCCLASS(node));
1153  return node;
1154 }
1155 
1156 static Node*
1158  const OnigCodePoint ranges[])
1159 {
1160  int n, i;
1161  CClassNode* cc;
1162  OnigCodePoint j;
1163 
1164  Node* node = node_new_cclass();
1165  CHECK_NULL_RETURN(node);
1166 
1167  cc = NCCLASS(node);
1168  if (not != 0) NCCLASS_SET_NOT(cc);
1169 
1170  BITSET_CLEAR(cc->bs);
1171  if (sb_out > 0 && IS_NOT_NULL(ranges)) {
1172  n = ONIGENC_CODE_RANGE_NUM(ranges);
1173  for (i = 0; i < n; i++) {
1174  for (j = ONIGENC_CODE_RANGE_FROM(ranges, i);
1175  j <= (OnigCodePoint )ONIGENC_CODE_RANGE_TO(ranges, i); j++) {
1176  if (j >= sb_out) goto sb_end;
1177 
1178  BITSET_SET_BIT(cc->bs, j);
1179  }
1180  }
1181  }
1182 
1183  sb_end:
1184  if (IS_NULL(ranges)) {
1185  is_null:
1186  cc->mbuf = NULL;
1187  }
1188  else {
1189  BBuf* bbuf;
1190 
1191  n = ONIGENC_CODE_RANGE_NUM(ranges);
1192  if (n == 0) goto is_null;
1193 
1194  bbuf = (BBuf* )xmalloc(sizeof(BBuf));
1195  CHECK_NULL_RETURN(bbuf);
1196  bbuf->alloc = n + 1;
1197  bbuf->used = n + 1;
1198  bbuf->p = (UChar* )((void* )ranges);
1199 
1200  cc->mbuf = bbuf;
1201  }
1202 
1203  return node;
1204 }
1205 
1206 static Node*
1207 node_new_ctype(int type, int not)
1208 {
1209  Node* node = node_new();
1210  CHECK_NULL_RETURN(node);
1211 
1212  SET_NTYPE(node, NT_CTYPE);
1213  NCTYPE(node)->ctype = type;
1214  NCTYPE(node)->not = not;
1215  return node;
1216 }
1217 
1218 static Node*
1220 {
1221  Node* node = node_new();
1222  CHECK_NULL_RETURN(node);
1223 
1224  SET_NTYPE(node, NT_CANY);
1225  return node;
1226 }
1227 
1228 static Node*
1229 node_new_list(Node* left, Node* right)
1230 {
1231  Node* node = node_new();
1232  CHECK_NULL_RETURN(node);
1233 
1234  SET_NTYPE(node, NT_LIST);
1235  NCAR(node) = left;
1236  NCDR(node) = right;
1237  return node;
1238 }
1239 
1240 extern Node*
1242 {
1243  return node_new_list(left, right);
1244 }
1245 
1246 extern Node*
1248 {
1249  Node *n;
1250 
1251  n = onig_node_new_list(x, NULL);
1252  if (IS_NULL(n)) return NULL_NODE;
1253 
1254  if (IS_NOT_NULL(list)) {
1255  while (IS_NOT_NULL(NCDR(list)))
1256  list = NCDR(list);
1257 
1258  NCDR(list) = n;
1259  }
1260 
1261  return n;
1262 }
1263 
1264 extern Node*
1266 {
1267  Node* node = node_new();
1268  CHECK_NULL_RETURN(node);
1269 
1270  SET_NTYPE(node, NT_ALT);
1271  NCAR(node) = left;
1272  NCDR(node) = right;
1273  return node;
1274 }
1275 
1276 extern Node*
1278 {
1279  Node* node = node_new();
1280  CHECK_NULL_RETURN(node);
1281 
1282  SET_NTYPE(node, NT_ANCHOR);
1283  NANCHOR(node)->type = type;
1284  NANCHOR(node)->target = NULL;
1285  NANCHOR(node)->char_len = -1;
1286  return node;
1287 }
1288 
1289 static Node*
1290 node_new_backref(int back_num, int* backrefs, int by_name,
1292  int exist_level, int nest_level,
1293 #endif
1294  ScanEnv* env)
1295 {
1296  int i;
1297  Node* node = node_new();
1298 
1299  CHECK_NULL_RETURN(node);
1300 
1301  SET_NTYPE(node, NT_BREF);
1302  NBREF(node)->state = 0;
1303  NBREF(node)->back_num = back_num;
1304  NBREF(node)->back_dynamic = (int* )NULL;
1305  if (by_name != 0)
1306  NBREF(node)->state |= NST_NAME_REF;
1307 
1308 #ifdef USE_BACKREF_WITH_LEVEL
1309  if (exist_level != 0) {
1310  NBREF(node)->state |= NST_NEST_LEVEL;
1311  NBREF(node)->nest_level = nest_level;
1312  }
1313 #endif
1314 
1315  for (i = 0; i < back_num; i++) {
1316  if (backrefs[i] <= env->num_mem &&
1317  IS_NULL(SCANENV_MEM_NODES(env)[backrefs[i]])) {
1318  NBREF(node)->state |= NST_RECURSION; /* /...(\1).../ */
1319  break;
1320  }
1321  }
1322 
1323  if (back_num <= NODE_BACKREFS_SIZE) {
1324  for (i = 0; i < back_num; i++)
1325  NBREF(node)->back_static[i] = backrefs[i];
1326  }
1327  else {
1328  int* p = (int* )xmalloc(sizeof(int) * back_num);
1329  if (IS_NULL(p)) {
1330  onig_node_free(node);
1331  return NULL;
1332  }
1333  NBREF(node)->back_dynamic = p;
1334  for (i = 0; i < back_num; i++)
1335  p[i] = backrefs[i];
1336  }
1337  return node;
1338 }
1339 
1340 #ifdef USE_SUBEXP_CALL
1341 static Node*
1342 node_new_call(UChar* name, UChar* name_end, int gnum)
1343 {
1344  Node* node = node_new();
1345  CHECK_NULL_RETURN(node);
1346 
1347  SET_NTYPE(node, NT_CALL);
1348  NCALL(node)->state = 0;
1349  NCALL(node)->target = NULL_NODE;
1350  NCALL(node)->name = name;
1351  NCALL(node)->name_end = name_end;
1352  NCALL(node)->group_num = gnum; /* call by number if gnum != 0 */
1353  return node;
1354 }
1355 #endif
1356 
1357 static Node*
1358 node_new_quantifier(int lower, int upper, int by_number)
1359 {
1360  Node* node = node_new();
1361  CHECK_NULL_RETURN(node);
1362 
1363  SET_NTYPE(node, NT_QTFR);
1364  NQTFR(node)->state = 0;
1365  NQTFR(node)->target = NULL;
1366  NQTFR(node)->lower = lower;
1367  NQTFR(node)->upper = upper;
1368  NQTFR(node)->greedy = 1;
1369  NQTFR(node)->target_empty_info = NQ_TARGET_ISNOT_EMPTY;
1370  NQTFR(node)->head_exact = NULL_NODE;
1371  NQTFR(node)->next_head_exact = NULL_NODE;
1372  NQTFR(node)->is_refered = 0;
1373  if (by_number != 0)
1374  NQTFR(node)->state |= NST_BY_NUMBER;
1375 
1376 #ifdef USE_COMBINATION_EXPLOSION_CHECK
1377  NQTFR(node)->comb_exp_check_num = 0;
1378 #endif
1379 
1380  return node;
1381 }
1382 
1383 static Node*
1385 {
1386  Node* node = node_new();
1387  CHECK_NULL_RETURN(node);
1388 
1389  SET_NTYPE(node, NT_ENCLOSE);
1390  NENCLOSE(node)->type = type;
1391  NENCLOSE(node)->state = 0;
1392  NENCLOSE(node)->regnum = 0;
1393  NENCLOSE(node)->option = 0;
1394  NENCLOSE(node)->target = NULL;
1395  NENCLOSE(node)->call_addr = -1;
1396  NENCLOSE(node)->opt_count = 0;
1397  return node;
1398 }
1399 
1400 extern Node*
1402 {
1403  return node_new_enclose(type);
1404 }
1405 
1406 static Node*
1408 {
1410  CHECK_NULL_RETURN(node);
1411  if (is_named != 0)
1413 
1414 #ifdef USE_SUBEXP_CALL
1415  NENCLOSE(node)->option = option;
1416 #endif
1417  return node;
1418 }
1419 
1420 static Node*
1422 {
1424  CHECK_NULL_RETURN(node);
1425  NENCLOSE(node)->option = option;
1426  return node;
1427 }
1428 
1429 extern int
1430 onig_node_str_cat(Node* node, const UChar* s, const UChar* end)
1431 {
1432  ptrdiff_t addlen = end - s;
1433 
1434  if (addlen > 0) {
1435  ptrdiff_t len = NSTR(node)->end - NSTR(node)->s;
1436 
1437  if (NSTR(node)->capa > 0 || (len + addlen > NODE_STR_BUF_SIZE - 1)) {
1438  UChar* p;
1439  ptrdiff_t capa = len + addlen + NODE_STR_MARGIN;
1440 
1441  if (capa <= NSTR(node)->capa) {
1442  onig_strcpy(NSTR(node)->s + len, s, end);
1443  }
1444  else {
1445  if (NSTR(node)->s == NSTR(node)->buf)
1446  p = strcat_capa_from_static(NSTR(node)->s, NSTR(node)->end,
1447  s, end, capa);
1448  else
1449  p = strcat_capa(NSTR(node)->s, NSTR(node)->end, s, end, capa);
1450 
1452  NSTR(node)->s = p;
1453  NSTR(node)->capa = (int)capa;
1454  }
1455  }
1456  else {
1457  onig_strcpy(NSTR(node)->s + len, s, end);
1458  }
1459  NSTR(node)->end = NSTR(node)->s + len + addlen;
1460  }
1461 
1462  return 0;
1463 }
1464 
1465 extern int
1466 onig_node_str_set(Node* node, const UChar* s, const UChar* end)
1467 {
1468  onig_node_str_clear(node);
1469  return onig_node_str_cat(node, s, end);
1470 }
1471 
1472 static int
1474 {
1475  UChar s[1];
1476 
1477  s[0] = c;
1478  return onig_node_str_cat(node, s, s + 1);
1479 }
1480 
1481 extern void
1483 {
1484  SET_NTYPE(node, NT_STR);
1485  NSTR(node)->flag = flag;
1486  NSTR(node)->capa = 0;
1487  NSTR(node)->s = NSTR(node)->buf;
1488  NSTR(node)->end = NSTR(node)->buf;
1489 }
1490 
1491 extern void
1493 {
1494  if (NSTR(node)->capa != 0 &&
1495  IS_NOT_NULL(NSTR(node)->s) && NSTR(node)->s != NSTR(node)->buf) {
1496  xfree(NSTR(node)->s);
1497  }
1498 
1499  NSTR(node)->capa = 0;
1500  NSTR(node)->flag = 0;
1501  NSTR(node)->s = NSTR(node)->buf;
1502  NSTR(node)->end = NSTR(node)->buf;
1503 }
1504 
1505 static Node*
1506 node_new_str(const UChar* s, const UChar* end)
1507 {
1508  Node* node = node_new();
1509  CHECK_NULL_RETURN(node);
1510 
1511  SET_NTYPE(node, NT_STR);
1512  NSTR(node)->capa = 0;
1513  NSTR(node)->flag = 0;
1514  NSTR(node)->s = NSTR(node)->buf;
1515  NSTR(node)->end = NSTR(node)->buf;
1516  if (onig_node_str_cat(node, s, end)) {
1517  onig_node_free(node);
1518  return NULL;
1519  }
1520  return node;
1521 }
1522 
1523 extern Node*
1524 onig_node_new_str(const UChar* s, const UChar* end)
1525 {
1526  return node_new_str(s, end);
1527 }
1528 
1529 static Node*
1531 {
1532  Node* node = node_new_str(s, end);
1533  NSTRING_SET_RAW(node);
1534  return node;
1535 }
1536 
1537 static Node*
1539 {
1540  return node_new_str(NULL, NULL);
1541 }
1542 
1543 static Node*
1545 {
1546  UChar p[1];
1547 
1548  p[0] = c;
1549  return node_new_str_raw(p, p + 1);
1550 }
1551 
1552 static Node*
1554 {
1555  const UChar *p;
1556  Node* n = NULL_NODE;
1557 
1558  if (sn->end > sn->s) {
1559  p = onigenc_get_prev_char_head(enc, sn->s, sn->end, sn->end);
1560  if (p && p > sn->s) { /* can be splitted. */
1561  n = node_new_str(p, sn->end);
1562  if ((sn->flag & NSTR_RAW) != 0)
1563  NSTRING_SET_RAW(n);
1564  sn->end = (UChar* )p;
1565  }
1566  }
1567  return n;
1568 }
1569 
1570 static int
1572 {
1573  if (sn->end > sn->s) {
1574  return ((enclen(enc, sn->s, sn->end) < sn->end - sn->s) ? 1 : 0);
1575  }
1576  return 0;
1577 }
1578 
1579 #ifdef USE_PAD_TO_SHORT_BYTE_CHAR
1580 static int
1581 node_str_head_pad(StrNode* sn, int num, UChar val)
1582 {
1584  int i, len;
1585 
1586  len = sn->end - sn->s;
1587  onig_strcpy(buf, sn->s, sn->end);
1588  onig_strcpy(&(sn->s[num]), buf, buf + len);
1589  sn->end += num;
1590 
1591  for (i = 0; i < num; i++) {
1592  sn->s[i] = val;
1593  }
1594 }
1595 #endif
1596 
1597 extern int
1599 {
1600  unsigned int num, val;
1601  OnigCodePoint c;
1602  UChar* p = *src;
1603  PFETCH_READY;
1604 
1605  num = 0;
1606  while (!PEND) {
1607  PFETCH(c);
1608  if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
1609  val = (unsigned int )DIGITVAL(c);
1610  if ((INT_MAX_LIMIT - val) / 10UL < num)
1611  return -1; /* overflow */
1612 
1613  num = num * 10 + val;
1614  }
1615  else {
1616  PUNFETCH;
1617  break;
1618  }
1619  }
1620  *src = p;
1621  return num;
1622 }
1623 
1624 static int
1626  OnigEncoding enc)
1627 {
1628  OnigCodePoint c;
1629  unsigned int num, val;
1630  UChar* p = *src;
1631  PFETCH_READY;
1632 
1633  num = 0;
1634  while (!PEND && maxlen-- != 0) {
1635  PFETCH(c);
1636  if (ONIGENC_IS_CODE_XDIGIT(enc, c)) {
1637  val = (unsigned int )XDIGITVAL(enc,c);
1638  if ((INT_MAX_LIMIT - val) / 16UL < num)
1639  return -1; /* overflow */
1640 
1641  num = (num << 4) + XDIGITVAL(enc,c);
1642  }
1643  else {
1644  PUNFETCH;
1645  break;
1646  }
1647  }
1648  *src = p;
1649  return num;
1650 }
1651 
1652 static int
1653 scan_unsigned_octal_number(UChar** src, UChar* end, int maxlen,
1654  OnigEncoding enc)
1655 {
1656  OnigCodePoint c;
1657  unsigned int num, val;
1658  UChar* p = *src;
1659  PFETCH_READY;
1660 
1661  num = 0;
1662  while (!PEND && maxlen-- != 0) {
1663  PFETCH(c);
1664  if (ONIGENC_IS_CODE_DIGIT(enc, c) && c < '8') {
1665  val = ODIGITVAL(c);
1666  if ((INT_MAX_LIMIT - val) / 8UL < num)
1667  return -1; /* overflow */
1668 
1669  num = (num << 3) + val;
1670  }
1671  else {
1672  PUNFETCH;
1673  break;
1674  }
1675  }
1676  *src = p;
1677  return num;
1678 }
1679 
1680 
1681 #define BBUF_WRITE_CODE_POINT(bbuf,pos,code) \
1682  BBUF_WRITE(bbuf, pos, &(code), SIZE_CODE_POINT)
1683 
1684 /* data format:
1685  [n][from-1][to-1][from-2][to-2] ... [from-n][to-n]
1686  (all data size is OnigCodePoint)
1687  */
1688 static int
1690 {
1691 #define INIT_MULTI_BYTE_RANGE_SIZE (SIZE_CODE_POINT * 5)
1692  int r;
1693  OnigCodePoint n;
1694  BBuf* bbuf;
1695 
1696  bbuf = *pbuf = (BBuf* )xmalloc(sizeof(BBuf));
1697  CHECK_NULL_RETURN_MEMERR(*pbuf);
1699  if (r) return r;
1700 
1701  n = 0;
1702  BBUF_WRITE_CODE_POINT(bbuf, 0, n);
1703  return 0;
1704 }
1705 
1706 static int
1708  int checkdup)
1709 {
1710  int r, inc_n, pos;
1711  int low, high, bound, x;
1712  OnigCodePoint n, *data;
1713  BBuf* bbuf;
1714 
1715  if (from > to) {
1716  n = from; from = to; to = n;
1717  }
1718 
1719  if (IS_NULL(*pbuf)) {
1720  r = new_code_range(pbuf);
1721  if (r) return r;
1722  bbuf = *pbuf;
1723  n = 0;
1724  }
1725  else {
1726  bbuf = *pbuf;
1727  GET_CODE_POINT(n, bbuf->p);
1728  }
1729  data = (OnigCodePoint* )(bbuf->p);
1730  data++;
1731 
1732  for (low = 0, bound = n; low < bound; ) {
1733  x = (low + bound) >> 1;
1734  if (from > data[x*2 + 1])
1735  low = x + 1;
1736  else
1737  bound = x;
1738  }
1739 
1740  for (high = low, bound = n; high < bound; ) {
1741  x = (high + bound) >> 1;
1742  if (to >= data[x*2] - 1)
1743  high = x + 1;
1744  else
1745  bound = x;
1746  }
1747  /* data[(low-1)*2+1] << from <= data[low*2]
1748  * data[(high-1)*2+1] <= to << data[high*2]
1749  */
1750 
1751  inc_n = low + 1 - high;
1752  if (n + inc_n > ONIG_MAX_MULTI_BYTE_RANGES_NUM)
1754 
1755  if (inc_n != 1) {
1756  if (checkdup && from <= data[low*2+1]
1757  && (data[low*2] <= from || data[low*2+1] <= to))
1758  CC_DUP_WARN(env);
1759  if (from > data[low*2])
1760  from = data[low*2];
1761  if (to < data[(high - 1)*2 + 1])
1762  to = data[(high - 1)*2 + 1];
1763  }
1764 
1765  if (inc_n != 0 && (OnigCodePoint )high < n) {
1766  int from_pos = SIZE_CODE_POINT * (1 + high * 2);
1767  int to_pos = SIZE_CODE_POINT * (1 + (low + 1) * 2);
1768  int size = (n - high) * 2 * SIZE_CODE_POINT;
1769 
1770  if (inc_n > 0) {
1771  BBUF_MOVE_RIGHT(bbuf, from_pos, to_pos, size);
1772  }
1773  else {
1774  BBUF_MOVE_LEFT_REDUCE(bbuf, from_pos, to_pos);
1775  }
1776  }
1777 
1778  pos = SIZE_CODE_POINT * (1 + low * 2);
1779  BBUF_ENSURE_SIZE(bbuf, pos + SIZE_CODE_POINT * 2);
1780  BBUF_WRITE_CODE_POINT(bbuf, pos, from);
1781  BBUF_WRITE_CODE_POINT(bbuf, pos + SIZE_CODE_POINT, to);
1782  n += inc_n;
1783  BBUF_WRITE_CODE_POINT(bbuf, 0, n);
1784 
1785  return 0;
1786 }
1787 
1788 static int
1790 {
1791  return add_code_range_to_buf0(pbuf, env, from, to, 1);
1792 }
1793 
1794 static int
1795 add_code_range0(BBuf** pbuf, ScanEnv* env, OnigCodePoint from, OnigCodePoint to, int checkdup)
1796 {
1797  if (from > to) {
1799  return 0;
1800  else
1802  }
1803 
1804  return add_code_range_to_buf0(pbuf, env, from, to, checkdup);
1805 }
1806 
1807 static int
1809 {
1810  return add_code_range0(pbuf, env, from, to, 1);
1811 }
1812 
1813 static int
1815 {
1816  int r, i, n;
1817  OnigCodePoint pre, from, *data, to = 0;
1818 
1819  *pbuf = (BBuf* )NULL;
1820  if (IS_NULL(bbuf)) {
1821  set_all:
1822  return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf);
1823  }
1824 
1825  data = (OnigCodePoint* )(bbuf->p);
1826  GET_CODE_POINT(n, data);
1827  data++;
1828  if (n <= 0) goto set_all;
1829 
1830  r = 0;
1831  pre = MBCODE_START_POS(enc);
1832  for (i = 0; i < n; i++) {
1833  from = data[i*2];
1834  to = data[i*2+1];
1835  if (pre <= from - 1) {
1836  r = add_code_range_to_buf(pbuf, env, pre, from - 1);
1837  if (r != 0) return r;
1838  }
1839  if (to == ~((OnigCodePoint )0)) break;
1840  pre = to + 1;
1841  }
1842  if (to < ~((OnigCodePoint )0)) {
1843  r = add_code_range_to_buf(pbuf, env, to + 1, ~((OnigCodePoint )0));
1844  }
1845  return r;
1846 }
1847 
1848 #define SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2) do {\
1849  BBuf *tbuf; \
1850  int tnot; \
1851  tnot = not1; not1 = not2; not2 = tnot; \
1852  tbuf = bbuf1; bbuf1 = bbuf2; bbuf2 = tbuf; \
1853 } while (0)
1854 
1855 static int
1856 or_code_range_buf(OnigEncoding enc, BBuf* bbuf1, int not1,
1857  BBuf* bbuf2, int not2, BBuf** pbuf, ScanEnv* env)
1858 {
1859  int r;
1860  OnigCodePoint i, n1, *data1;
1861  OnigCodePoint from, to;
1862 
1863  *pbuf = (BBuf* )NULL;
1864  if (IS_NULL(bbuf1) && IS_NULL(bbuf2)) {
1865  if (not1 != 0 || not2 != 0)
1866  return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf);
1867  return 0;
1868  }
1869 
1870  r = 0;
1871  if (IS_NULL(bbuf2))
1872  SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2);
1873 
1874  if (IS_NULL(bbuf1)) {
1875  if (not1 != 0) {
1876  return SET_ALL_MULTI_BYTE_RANGE(enc, pbuf);
1877  }
1878  else {
1879  if (not2 == 0) {
1880  return bbuf_clone(pbuf, bbuf2);
1881  }
1882  else {
1883  return not_code_range_buf(enc, bbuf2, pbuf, env);
1884  }
1885  }
1886  }
1887 
1888  if (not1 != 0)
1889  SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2);
1890 
1891  data1 = (OnigCodePoint* )(bbuf1->p);
1892  GET_CODE_POINT(n1, data1);
1893  data1++;
1894 
1895  if (not2 == 0 && not1 == 0) { /* 1 OR 2 */
1896  r = bbuf_clone(pbuf, bbuf2);
1897  }
1898  else if (not1 == 0) { /* 1 OR (not 2) */
1899  r = not_code_range_buf(enc, bbuf2, pbuf, env);
1900  }
1901  if (r != 0) return r;
1902 
1903  for (i = 0; i < n1; i++) {
1904  from = data1[i*2];
1905  to = data1[i*2+1];
1906  r = add_code_range_to_buf(pbuf, env, from, to);
1907  if (r != 0) return r;
1908  }
1909  return 0;
1910 }
1911 
1912 static int
1914  OnigCodePoint* data, int n)
1915 {
1916  int i, r;
1917  OnigCodePoint from2, to2;
1918 
1919  for (i = 0; i < n; i++) {
1920  from2 = data[i*2];
1921  to2 = data[i*2+1];
1922  if (from2 < from1) {
1923  if (to2 < from1) continue;
1924  else {
1925  from1 = to2 + 1;
1926  }
1927  }
1928  else if (from2 <= to1) {
1929  if (to2 < to1) {
1930  if (from1 <= from2 - 1) {
1931  r = add_code_range_to_buf(pbuf, env, from1, from2-1);
1932  if (r != 0) return r;
1933  }
1934  from1 = to2 + 1;
1935  }
1936  else {
1937  to1 = from2 - 1;
1938  }
1939  }
1940  else {
1941  from1 = from2;
1942  }
1943  if (from1 > to1) break;
1944  }
1945  if (from1 <= to1) {
1946  r = add_code_range_to_buf(pbuf, env, from1, to1);
1947  if (r != 0) return r;
1948  }
1949  return 0;
1950 }
1951 
1952 static int
1953 and_code_range_buf(BBuf* bbuf1, int not1, BBuf* bbuf2, int not2, BBuf** pbuf, ScanEnv* env)
1954 {
1955  int r;
1956  OnigCodePoint i, j, n1, n2, *data1, *data2;
1957  OnigCodePoint from, to, from1, to1, from2, to2;
1958 
1959  *pbuf = (BBuf* )NULL;
1960  if (IS_NULL(bbuf1)) {
1961  if (not1 != 0 && IS_NOT_NULL(bbuf2)) /* not1 != 0 -> not2 == 0 */
1962  return bbuf_clone(pbuf, bbuf2);
1963  return 0;
1964  }
1965  else if (IS_NULL(bbuf2)) {
1966  if (not2 != 0)
1967  return bbuf_clone(pbuf, bbuf1);
1968  return 0;
1969  }
1970 
1971  if (not1 != 0)
1972  SWAP_BBUF_NOT(bbuf1, not1, bbuf2, not2);
1973 
1974  data1 = (OnigCodePoint* )(bbuf1->p);
1975  data2 = (OnigCodePoint* )(bbuf2->p);
1976  GET_CODE_POINT(n1, data1);
1977  GET_CODE_POINT(n2, data2);
1978  data1++;
1979  data2++;
1980 
1981  if (not2 == 0 && not1 == 0) { /* 1 AND 2 */
1982  for (i = 0; i < n1; i++) {
1983  from1 = data1[i*2];
1984  to1 = data1[i*2+1];
1985  for (j = 0; j < n2; j++) {
1986  from2 = data2[j*2];
1987  to2 = data2[j*2+1];
1988  if (from2 > to1) break;
1989  if (to2 < from1) continue;
1990  from = MAX(from1, from2);
1991  to = MIN(to1, to2);
1992  r = add_code_range_to_buf(pbuf, env, from, to);
1993  if (r != 0) return r;
1994  }
1995  }
1996  }
1997  else if (not1 == 0) { /* 1 AND (not 2) */
1998  for (i = 0; i < n1; i++) {
1999  from1 = data1[i*2];
2000  to1 = data1[i*2+1];
2001  r = and_code_range1(pbuf, env, from1, to1, data2, n2);
2002  if (r != 0) return r;
2003  }
2004  }
2005 
2006  return 0;
2007 }
2008 
2009 static int
2011 {
2012  OnigEncoding enc = env->enc;
2013  int r, not1, not2;
2014  BBuf *buf1, *buf2, *pbuf = 0;
2015  BitSetRef bsr1, bsr2;
2016  BitSet bs1, bs2;
2017 
2018  not1 = IS_NCCLASS_NOT(dest);
2019  bsr1 = dest->bs;
2020  buf1 = dest->mbuf;
2021  not2 = IS_NCCLASS_NOT(cc);
2022  bsr2 = cc->bs;
2023  buf2 = cc->mbuf;
2024 
2025  if (not1 != 0) {
2026  bitset_invert_to(bsr1, bs1);
2027  bsr1 = bs1;
2028  }
2029  if (not2 != 0) {
2030  bitset_invert_to(bsr2, bs2);
2031  bsr2 = bs2;
2032  }
2033  bitset_and(bsr1, bsr2);
2034  if (bsr1 != dest->bs) {
2035  bitset_copy(dest->bs, bsr1);
2036  bsr1 = dest->bs;
2037  }
2038  if (not1 != 0) {
2039  bitset_invert(dest->bs);
2040  }
2041 
2042  if (! ONIGENC_IS_SINGLEBYTE(enc)) {
2043  if (not1 != 0 && not2 != 0) {
2044  r = or_code_range_buf(enc, buf1, 0, buf2, 0, &pbuf, env);
2045  }
2046  else {
2047  r = and_code_range_buf(buf1, not1, buf2, not2, &pbuf, env);
2048  if (r == 0 && not1 != 0) {
2049  BBuf *tbuf = 0;
2050  r = not_code_range_buf(enc, pbuf, &tbuf, env);
2051  bbuf_free(pbuf);
2052  pbuf = tbuf;
2053  }
2054  }
2055  if (r != 0) {
2056  bbuf_free(pbuf);
2057  return r;
2058  }
2059 
2060  dest->mbuf = pbuf;
2061  bbuf_free(buf1);
2062  return r;
2063  }
2064  return 0;
2065 }
2066 
2067 static int
2069 {
2070  OnigEncoding enc = env->enc;
2071  int r, not1, not2;
2072  BBuf *buf1, *buf2, *pbuf = 0;
2073  BitSetRef bsr1, bsr2;
2074  BitSet bs1, bs2;
2075 
2076  not1 = IS_NCCLASS_NOT(dest);
2077  bsr1 = dest->bs;
2078  buf1 = dest->mbuf;
2079  not2 = IS_NCCLASS_NOT(cc);
2080  bsr2 = cc->bs;
2081  buf2 = cc->mbuf;
2082 
2083  if (not1 != 0) {
2084  bitset_invert_to(bsr1, bs1);
2085  bsr1 = bs1;
2086  }
2087  if (not2 != 0) {
2088  bitset_invert_to(bsr2, bs2);
2089  bsr2 = bs2;
2090  }
2091  bitset_or(bsr1, bsr2);
2092  if (bsr1 != dest->bs) {
2093  bitset_copy(dest->bs, bsr1);
2094  bsr1 = dest->bs;
2095  }
2096  if (not1 != 0) {
2097  bitset_invert(dest->bs);
2098  }
2099 
2100  if (! ONIGENC_IS_SINGLEBYTE(enc)) {
2101  if (not1 != 0 && not2 != 0) {
2102  r = and_code_range_buf(buf1, 0, buf2, 0, &pbuf, env);
2103  }
2104  else {
2105  r = or_code_range_buf(enc, buf1, not1, buf2, not2, &pbuf, env);
2106  if (r == 0 && not1 != 0) {
2107  BBuf *tbuf = 0;
2108  r = not_code_range_buf(enc, pbuf, &tbuf, env);
2109  bbuf_free(pbuf);
2110  pbuf = tbuf;
2111  }
2112  }
2113  if (r != 0) {
2114  bbuf_free(pbuf);
2115  return r;
2116  }
2117 
2118  dest->mbuf = pbuf;
2119  bbuf_free(buf1);
2120  return r;
2121  }
2122  else
2123  return 0;
2124 }
2125 
2126 static void UNKNOWN_ESC_WARN(ScanEnv *env, int c);
2127 
2128 static int
2130 {
2132  switch (c) {
2133  case 'n': return '\n';
2134  case 't': return '\t';
2135  case 'r': return '\r';
2136  case 'f': return '\f';
2137  case 'a': return '\007';
2138  case 'b': return '\010';
2139  case 'e': return '\033';
2140  case 'v':
2142  return '\v';
2143  break;
2144 
2145  default:
2146  if (('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z'))
2147  UNKNOWN_ESC_WARN(env, c);
2148  break;
2149  }
2150  }
2151  return c;
2152 }
2153 
2154 #if 0 /* no invalid quantifier */
2155 static int
2157 {
2158  switch (NTYPE(node)) {
2159  case NT_ANCHOR:
2160  return 1;
2161  break;
2162 
2163  case NT_ENCLOSE:
2164  /* allow enclosed elements */
2165  /* return is_invalid_quantifier_target(NENCLOSE(node)->target); */
2166  break;
2167 
2168  case NT_LIST:
2169  do {
2170  if (! is_invalid_quantifier_target(NCAR(node))) return 0;
2171  } while (IS_NOT_NULL(node = NCDR(node)));
2172  return 0;
2173  break;
2174 
2175  case NT_ALT:
2176  do {
2177  if (is_invalid_quantifier_target(NCAR(node))) return 1;
2178  } while (IS_NOT_NULL(node = NCDR(node)));
2179  break;
2180 
2181  default:
2182  break;
2183  }
2184  return 0;
2185 }
2186 #else
2187 #define is_invalid_quantifier_target(node) 0
2188 #endif
2189 
2190 /* ?:0, *:1, +:2, ??:3, *?:4, +?:5 */
2191 static int
2193 {
2194  if (q->greedy) {
2195  if (q->lower == 0) {
2196  if (q->upper == 1) return 0;
2197  else if (IS_REPEAT_INFINITE(q->upper)) return 1;
2198  }
2199  else if (q->lower == 1) {
2200  if (IS_REPEAT_INFINITE(q->upper)) return 2;
2201  }
2202  }
2203  else {
2204  if (q->lower == 0) {
2205  if (q->upper == 1) return 3;
2206  else if (IS_REPEAT_INFINITE(q->upper)) return 4;
2207  }
2208  else if (q->lower == 1) {
2209  if (IS_REPEAT_INFINITE(q->upper)) return 5;
2210  }
2211  }
2212  return -1;
2213 }
2214 
2215 
2217  RQ_ASIS = 0, /* as is */
2218  RQ_DEL = 1, /* delete parent */
2219  RQ_A, /* to '*' */
2220  RQ_AQ, /* to '*?' */
2221  RQ_QQ, /* to '??' */
2222  RQ_P_QQ, /* to '+)??' */
2223  RQ_PQ_Q /* to '+?)?' */
2224 };
2225 
2226 static enum ReduceType const ReduceTypeTable[6][6] = {
2227  {RQ_DEL, RQ_A, RQ_A, RQ_QQ, RQ_AQ, RQ_ASIS}, /* '?' */
2228  {RQ_DEL, RQ_DEL, RQ_DEL, RQ_P_QQ, RQ_P_QQ, RQ_DEL}, /* '*' */
2229  {RQ_A, RQ_A, RQ_DEL, RQ_ASIS, RQ_P_QQ, RQ_DEL}, /* '+' */
2230  {RQ_DEL, RQ_AQ, RQ_AQ, RQ_DEL, RQ_AQ, RQ_AQ}, /* '??' */
2231  {RQ_DEL, RQ_DEL, RQ_DEL, RQ_DEL, RQ_DEL, RQ_DEL}, /* '*?' */
2232  {RQ_ASIS, RQ_PQ_Q, RQ_DEL, RQ_AQ, RQ_AQ, RQ_DEL} /* '+?' */
2233 };
2234 
2235 extern void
2237 {
2238  int pnum, cnum;
2239  QtfrNode *p, *c;
2240 
2241  p = NQTFR(pnode);
2242  c = NQTFR(cnode);
2243  pnum = popular_quantifier_num(p);
2244  cnum = popular_quantifier_num(c);
2245  if (pnum < 0 || cnum < 0) return ;
2246 
2247  switch(ReduceTypeTable[cnum][pnum]) {
2248  case RQ_DEL:
2249  *pnode = *cnode;
2250  break;
2251  case RQ_A:
2252  p->target = c->target;
2253  p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 1;
2254  break;
2255  case RQ_AQ:
2256  p->target = c->target;
2257  p->lower = 0; p->upper = REPEAT_INFINITE; p->greedy = 0;
2258  break;
2259  case RQ_QQ:
2260  p->target = c->target;
2261  p->lower = 0; p->upper = 1; p->greedy = 0;
2262  break;
2263  case RQ_P_QQ:
2264  p->target = cnode;
2265  p->lower = 0; p->upper = 1; p->greedy = 0;
2266  c->lower = 1; c->upper = REPEAT_INFINITE; c->greedy = 1;
2267  return ;
2268  break;
2269  case RQ_PQ_Q:
2270  p->target = cnode;
2271  p->lower = 0; p->upper = 1; p->greedy = 1;
2272  c->lower = 1; c->upper = REPEAT_INFINITE; c->greedy = 0;
2273  return ;
2274  break;
2275  case RQ_ASIS:
2276  p->target = cnode;
2277  return ;
2278  break;
2279  }
2280 
2281  c->target = NULL_NODE;
2282  onig_node_free(cnode);
2283 }
2284 
2285 
2287  TK_EOT = 0, /* end of token */
2299  TK_ANYCHAR_ANYTIME, /* SQL '%' == .* */
2305  TK_CHAR_PROPERTY, /* \p{...}, \P{...} */
2306  /* in cc */
2310  TK_CC_AND, /* && */
2312 };
2313 
2314 typedef struct {
2316  int escaped;
2317  int base; /* is number: 8, 16 (used in [....]) */
2319  union {
2321  int c;
2323  int anchor;
2324  int subtype;
2325  struct {
2326  int lower;
2327  int upper;
2328  int greedy;
2330  } repeat;
2331  struct {
2332  int num;
2333  int ref1;
2334  int* refs;
2335  int by_name;
2336 #ifdef USE_BACKREF_WITH_LEVEL
2338  int level; /* \k<name+n> */
2339 #endif
2340  } backref;
2341  struct {
2344  int gnum;
2345  } call;
2346  struct {
2347  int ctype;
2348  int not;
2349  } prop;
2350  } u;
2351 } OnigToken;
2352 
2353 
2354 static int
2356 {
2357  int low, up, syn_allow, non_low = 0;
2358  int r = 0;
2359  OnigCodePoint c;
2360  OnigEncoding enc = env->enc;
2361  UChar* p = *src;
2362  PFETCH_READY;
2363 
2365 
2366  if (PEND) {
2367  if (syn_allow)
2368  return 1; /* "....{" : OK! */
2369  else
2370  return ONIGERR_END_PATTERN_AT_LEFT_BRACE; /* "....{" syntax error */
2371  }
2372 
2373  if (! syn_allow) {
2374  c = PPEEK;
2375  if (c == ')' || c == '(' || c == '|') {
2377  }
2378  }
2379 
2380  low = onig_scan_unsigned_number(&p, end, env->enc);
2381  if (low < 0) return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2382  if (low > ONIG_MAX_REPEAT_NUM)
2384 
2385  if (p == *src) { /* can't read low */
2387  /* allow {,n} as {0,n} */
2388  low = 0;
2389  non_low = 1;
2390  }
2391  else
2392  goto invalid;
2393  }
2394 
2395  if (PEND) goto invalid;
2396  PFETCH(c);
2397  if (c == ',') {
2398  UChar* prev = p;
2399  up = onig_scan_unsigned_number(&p, end, env->enc);
2400  if (up < 0) return ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE;
2401  if (up > ONIG_MAX_REPEAT_NUM)
2403 
2404  if (p == prev) {
2405  if (non_low != 0)
2406  goto invalid;
2407  up = REPEAT_INFINITE; /* {n,} : {n,infinite} */
2408  }
2409  }
2410  else {
2411  if (non_low != 0)
2412  goto invalid;
2413 
2414  PUNFETCH;
2415  up = low; /* {n} : exact n times */
2416  r = 2; /* fixed */
2417  }
2418 
2419  if (PEND) goto invalid;
2420  PFETCH(c);
2422  if (c != MC_ESC(env->syntax)) goto invalid;
2423  PFETCH(c);
2424  }
2425  if (c != '}') goto invalid;
2426 
2427  if (!IS_REPEAT_INFINITE(up) && low > up) {
2429  }
2430 
2431  tok->type = TK_INTERVAL;
2432  tok->u.repeat.lower = low;
2433  tok->u.repeat.upper = up;
2434  *src = p;
2435  return r; /* 0: normal {n,m}, 2: fixed {n} */
2436 
2437  invalid:
2438  if (syn_allow)
2439  return 1; /* OK */
2440  else
2442 }
2443 
2444 /* \M-, \C-, \c, or \... */
2445 static int
2447 {
2448  int v;
2449  OnigCodePoint c;
2450  OnigEncoding enc = env->enc;
2451  UChar* p = *src;
2452  PFETCH_READY;
2453 
2454  if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE;
2455 
2456  PFETCH(c);
2457  switch (c) {
2458  case 'M':
2460  if (PEND) return ONIGERR_END_PATTERN_AT_META;
2461  PFETCH(c);
2462  if (c != '-') return ONIGERR_META_CODE_SYNTAX;
2463  if (PEND) return ONIGERR_END_PATTERN_AT_META;
2464  PFETCH(c);
2465  if (c == MC_ESC(env->syntax)) {
2466  v = fetch_escaped_value(&p, end, env);
2467  if (v < 0) return v;
2468  c = (OnigCodePoint )v;
2469  }
2470  c = ((c & 0xff) | 0x80);
2471  }
2472  else
2473  goto backslash;
2474  break;
2475 
2476  case 'C':
2479  PFETCH(c);
2480  if (c != '-') return ONIGERR_CONTROL_CODE_SYNTAX;
2481  goto control;
2482  }
2483  else
2484  goto backslash;
2485 
2486  case 'c':
2488  control:
2490  PFETCH(c);
2491  if (c == '?') {
2492  c = 0177;
2493  }
2494  else {
2495  if (c == MC_ESC(env->syntax)) {
2496  v = fetch_escaped_value(&p, end, env);
2497  if (v < 0) return v;
2498  c = (OnigCodePoint )v;
2499  }
2500  c &= 0x9f;
2501  }
2502  break;
2503  }
2504  /* fall through */
2505 
2506  default:
2507  {
2508  backslash:
2509  c = conv_backslash_value(c, env);
2510  }
2511  break;
2512  }
2513 
2514  *src = p;
2515  return c;
2516 }
2517 
2518 static int fetch_token(OnigToken* tok, UChar** src, UChar* end, ScanEnv* env);
2519 
2520 static OnigCodePoint
2522 {
2523  switch (start) {
2524  case '<': return (OnigCodePoint )'>'; break;
2525  case '\'': return (OnigCodePoint )'\''; break;
2526  default:
2527  break;
2528  }
2529 
2530  return (OnigCodePoint )0;
2531 }
2532 
2533 #ifdef USE_NAMED_GROUP
2534 #ifdef USE_BACKREF_WITH_LEVEL
2535 /*
2536  \k<name+n>, \k<name-n>
2537  \k<num+n>, \k<num-n>
2538  \k<-num+n>, \k<-num-n>
2539 */
2540 static int
2542  UChar** rname_end, ScanEnv* env,
2543  int* rback_num, int* rlevel)
2544 {
2545  int r, sign, is_num, exist_level;
2546  OnigCodePoint end_code;
2547  OnigCodePoint c = 0;
2548  OnigEncoding enc = env->enc;
2549  UChar *name_end;
2550  UChar *pnum_head;
2551  UChar *p = *src;
2552  PFETCH_READY;
2553 
2554  *rback_num = 0;
2555  is_num = exist_level = 0;
2556  sign = 1;
2557  pnum_head = *src;
2558 
2559  end_code = get_name_end_code_point(start_code);
2560 
2561  name_end = end;
2562  r = 0;
2563  if (PEND) {
2564  return ONIGERR_EMPTY_GROUP_NAME;
2565  }
2566  else {
2567  PFETCH(c);
2568  if (c == end_code)
2569  return ONIGERR_EMPTY_GROUP_NAME;
2570 
2571  if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2572  is_num = 1;
2573  }
2574  else if (c == '-') {
2575  is_num = 2;
2576  sign = -1;
2577  pnum_head = p;
2578  }
2579  else if (!ONIGENC_IS_CODE_WORD(enc, c)) {
2581  }
2582  }
2583 
2584  while (!PEND) {
2585  name_end = p;
2586  PFETCH(c);
2587  if (c == end_code || c == ')' || c == '+' || c == '-') {
2588  if (is_num == 2) r = ONIGERR_INVALID_GROUP_NAME;
2589  break;
2590  }
2591 
2592  if (is_num != 0) {
2593  if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2594  is_num = 1;
2595  }
2596  else {
2598  is_num = 0;
2599  }
2600  }
2601  else if (!ONIGENC_IS_CODE_WORD(enc, c)) {
2603  }
2604  }
2605 
2606  if (r == 0 && c != end_code) {
2607  if (c == '+' || c == '-') {
2608  int level;
2609  int flag = (c == '-' ? -1 : 1);
2610 
2611  PFETCH(c);
2612  if (! ONIGENC_IS_CODE_DIGIT(enc, c)) goto err;
2613  PUNFETCH;
2614  level = onig_scan_unsigned_number(&p, end, enc);
2615  if (level < 0) return ONIGERR_TOO_BIG_NUMBER;
2616  *rlevel = (level * flag);
2617  exist_level = 1;
2618 
2619  PFETCH(c);
2620  if (c == end_code)
2621  goto end;
2622  }
2623 
2624  err:
2626  name_end = end;
2627  }
2628 
2629  end:
2630  if (r == 0) {
2631  if (is_num != 0) {
2632  *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc);
2633  if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER;
2634  else if (*rback_num == 0) goto err;
2635 
2636  *rback_num *= sign;
2637  }
2638 
2639  *rname_end = name_end;
2640  *src = p;
2641  return (exist_level ? 1 : 0);
2642  }
2643  else {
2644  onig_scan_env_set_error_string(env, r, *src, name_end);
2645  return r;
2646  }
2647 }
2648 #endif /* USE_BACKREF_WITH_LEVEL */
2649 
2650 /*
2651  def: 0 -> define name (don't allow number name)
2652  1 -> reference name (allow number name)
2653 */
2654 static int
2655 fetch_name(OnigCodePoint start_code, UChar** src, UChar* end,
2656  UChar** rname_end, ScanEnv* env, int* rback_num, int ref)
2657 {
2658  int r, is_num, sign;
2659  OnigCodePoint end_code;
2660  OnigCodePoint c = 0;
2661  OnigEncoding enc = env->enc;
2662  UChar *name_end;
2663  UChar *pnum_head;
2664  UChar *p = *src;
2665  PFETCH_READY;
2666 
2667  *rback_num = 0;
2668 
2669  end_code = get_name_end_code_point(start_code);
2670 
2671  name_end = end;
2672  pnum_head = *src;
2673  r = 0;
2674  is_num = 0;
2675  sign = 1;
2676  if (PEND) {
2677  return ONIGERR_EMPTY_GROUP_NAME;
2678  }
2679  else {
2680  PFETCH(c);
2681  if (c == end_code)
2682  return ONIGERR_EMPTY_GROUP_NAME;
2683 
2684  if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2685  if (ref == 1)
2686  is_num = 1;
2687  else {
2689  is_num = 0;
2690  }
2691  }
2692  else if (c == '-') {
2693  if (ref == 1) {
2694  is_num = 2;
2695  sign = -1;
2696  pnum_head = p;
2697  }
2698  else {
2700  is_num = 0;
2701  }
2702  }
2703  else if (!ONIGENC_IS_CODE_WORD(enc, c)) {
2705  }
2706  }
2707 
2708  if (r == 0) {
2709  while (!PEND) {
2710  name_end = p;
2711  PFETCH(c);
2712  if (c == end_code || c == ')') {
2713  if (is_num == 2) r = ONIGERR_INVALID_GROUP_NAME;
2714  break;
2715  }
2716 
2717  if (is_num != 0) {
2718  if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2719  is_num = 1;
2720  }
2721  else {
2722  if (!ONIGENC_IS_CODE_WORD(enc, c))
2724  else
2726 
2727  is_num = 0;
2728  }
2729  }
2730  else {
2731  if (!ONIGENC_IS_CODE_WORD(enc, c)) {
2733  }
2734  }
2735  }
2736 
2737  if (c != end_code) {
2739  name_end = end;
2740  }
2741 
2742  if (is_num != 0) {
2743  *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc);
2744  if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER;
2745  else if (*rback_num == 0) {
2747  goto err;
2748  }
2749 
2750  *rback_num *= sign;
2751  }
2752 
2753  *rname_end = name_end;
2754  *src = p;
2755  return 0;
2756  }
2757  else {
2758  while (!PEND) {
2759  name_end = p;
2760  PFETCH(c);
2761  if (c == end_code || c == ')')
2762  break;
2763  }
2764  if (PEND)
2765  name_end = end;
2766 
2767  err:
2768  onig_scan_env_set_error_string(env, r, *src, name_end);
2769  return r;
2770  }
2771 }
2772 #else
2773 static int
2774 fetch_name(OnigCodePoint start_code, UChar** src, UChar* end,
2775  UChar** rname_end, ScanEnv* env, int* rback_num, int ref)
2776 {
2777  int r, is_num, sign;
2778  OnigCodePoint end_code;
2779  OnigCodePoint c = 0;
2780  UChar *name_end;
2781  OnigEncoding enc = env->enc;
2782  UChar *pnum_head;
2783  UChar *p = *src;
2784  PFETCH_READY;
2785 
2786  *rback_num = 0;
2787 
2788  end_code = get_name_end_code_point(start_code);
2789 
2790  *rname_end = name_end = end;
2791  r = 0;
2792  pnum_head = *src;
2793  is_num = 0;
2794  sign = 1;
2795 
2796  if (PEND) {
2797  return ONIGERR_EMPTY_GROUP_NAME;
2798  }
2799  else {
2800  PFETCH(c);
2801  if (c == end_code)
2802  return ONIGERR_EMPTY_GROUP_NAME;
2803 
2804  if (ONIGENC_IS_CODE_DIGIT(enc, c)) {
2805  is_num = 1;
2806  }
2807  else if (c == '-') {
2808  is_num = 2;
2809  sign = -1;
2810  pnum_head = p;
2811  }
2812  else {
2814  }
2815  }
2816 
2817  while (!PEND) {
2818  name_end = p;
2819 
2820  PFETCH(c);
2821  if (c == end_code || c == ')') break;
2822  if (! ONIGENC_IS_CODE_DIGIT(enc, c))
2824  }
2825  if (r == 0 && c != end_code) {
2827  name_end = end;
2828  }
2829 
2830  if (r == 0) {
2831  *rback_num = onig_scan_unsigned_number(&pnum_head, name_end, enc);
2832  if (*rback_num < 0) return ONIGERR_TOO_BIG_NUMBER;
2833  else if (*rback_num == 0) {
2835  goto err;
2836  }
2837  *rback_num *= sign;
2838 
2839  *rname_end = name_end;
2840  *src = p;
2841  return 0;
2842  }
2843  else {
2844  err:
2845  onig_scan_env_set_error_string(env, r, *src, name_end);
2846  return r;
2847  }
2848 }
2849 #endif /* USE_NAMED_GROUP */
2850 
2851 void onig_vsnprintf_with_pattern(UChar buf[], int bufsize, OnigEncoding enc,
2852  UChar* pat, UChar* pat_end, const UChar *fmt, va_list args);
2853 
2854 static void
2855 onig_syntax_warn(ScanEnv *env, const char *fmt, ...)
2856 {
2857  va_list args;
2858  UChar buf[WARN_BUFSIZE];
2859  va_start(args, fmt);
2861  env->pattern, env->pattern_end,
2862  (const UChar *)fmt, args);
2863  va_end(args);
2864  if (env->sourcefile == NULL)
2865  rb_warn("%s", (char *)buf);
2866  else
2867  rb_compile_warn(env->sourcefile, env->sourceline, "%s", (char *)buf);
2868 }
2869 
2870 static void
2872 {
2873  if (onig_warn == onig_null_warn) return ;
2874 
2877  onig_syntax_warn(env, "character class has '%s' without escape", c);
2878  }
2879 }
2880 
2881 static void
2883 {
2884  if (onig_warn == onig_null_warn) return ;
2885 
2886  if (IS_SYNTAX_BV((env)->syntax, ONIG_SYN_WARN_CC_OP_NOT_ESCAPED)) {
2887  onig_syntax_warn(env, "regular expression has '%s' without escape", c);
2888  }
2889 }
2890 
2891 static void
2893 {
2895 
2896  if (IS_SYNTAX_BV((env)->syntax, ONIG_SYN_WARN_CC_DUP) &&
2897  !((env)->warnings_flag & ONIG_SYN_WARN_CC_DUP)) {
2898  (env)->warnings_flag |= ONIG_SYN_WARN_CC_DUP;
2899  onig_syntax_warn(env, "character class has duplicated range");
2900  }
2901 }
2902 
2903 static void
2905 {
2907  onig_syntax_warn(env, "Unknown escape \\%c is ignored", c);
2908 }
2909 
2910 static UChar*
2912  UChar **next, OnigEncoding enc)
2913 {
2914  int i;
2915  OnigCodePoint x;
2916  UChar *q;
2917  UChar *p = from;
2918 
2919  while (p < to) {
2920  x = ONIGENC_MBC_TO_CODE(enc, p, to);
2921  q = p + enclen(enc, p, to);
2922  if (x == s[0]) {
2923  for (i = 1; i < n && q < to; i++) {
2924  x = ONIGENC_MBC_TO_CODE(enc, q, to);
2925  if (x != s[i]) break;
2926  q += enclen(enc, q, to);
2927  }
2928  if (i >= n) {
2929  if (IS_NOT_NULL(next))
2930  *next = q;
2931  return p;
2932  }
2933  }
2934  p = q;
2935  }
2936  return NULL_UCHARP;
2937 }
2938 
2939 static int
2941  OnigCodePoint bad, OnigEncoding enc, const OnigSyntaxType* syn)
2942 {
2943  int i, in_esc;
2944  OnigCodePoint x;
2945  UChar *q;
2946  UChar *p = from;
2947 
2948  in_esc = 0;
2949  while (p < to) {
2950  if (in_esc) {
2951  in_esc = 0;
2952  p += enclen(enc, p, to);
2953  }
2954  else {
2955  x = ONIGENC_MBC_TO_CODE(enc, p, to);
2956  q = p + enclen(enc, p, to);
2957  if (x == s[0]) {
2958  for (i = 1; i < n && q < to; i++) {
2959  x = ONIGENC_MBC_TO_CODE(enc, q, to);
2960  if (x != s[i]) break;
2961  q += enclen(enc, q, to);
2962  }
2963  if (i >= n) return 1;
2964  p += enclen(enc, p, to);
2965  }
2966  else {
2967  x = ONIGENC_MBC_TO_CODE(enc, p, to);
2968  if (x == bad) return 0;
2969  else if (x == MC_ESC(syn)) in_esc = 1;
2970  p = q;
2971  }
2972  }
2973  }
2974  return 0;
2975 }
2976 
2977 static int
2979 {
2980  int num;
2981  OnigCodePoint c, c2;
2982  const OnigSyntaxType* syn = env->syntax;
2983  OnigEncoding enc = env->enc;
2984  UChar* prev;
2985  UChar* p = *src;
2986  PFETCH_READY;
2987 
2988  if (PEND) {
2989  tok->type = TK_EOT;
2990  return tok->type;
2991  }
2992 
2993  PFETCH(c);
2994  tok->type = TK_CHAR;
2995  tok->base = 0;
2996  tok->u.c = c;
2997  tok->escaped = 0;
2998 
2999  if (c == ']') {
3000  tok->type = TK_CC_CLOSE;
3001  }
3002  else if (c == '-') {
3003  tok->type = TK_CC_RANGE;
3004  }
3005  else if (c == MC_ESC(syn)) {
3007  goto end;
3008 
3009  if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE;
3010 
3011  PFETCH(c);
3012  tok->escaped = 1;
3013  tok->u.c = c;
3014  switch (c) {
3015  case 'w':
3016  tok->type = TK_CHAR_TYPE;
3017  tok->u.prop.ctype = ONIGENC_CTYPE_W;
3018  tok->u.prop.not = 0;
3019  break;
3020  case 'W':
3021  tok->type = TK_CHAR_TYPE;
3022  tok->u.prop.ctype = ONIGENC_CTYPE_W;
3023  tok->u.prop.not = 1;
3024  break;
3025  case 'd':
3026  tok->type = TK_CHAR_TYPE;
3027  tok->u.prop.ctype = ONIGENC_CTYPE_D;
3028  tok->u.prop.not = 0;
3029  break;
3030  case 'D':
3031  tok->type = TK_CHAR_TYPE;
3032  tok->u.prop.ctype = ONIGENC_CTYPE_D;
3033  tok->u.prop.not = 1;
3034  break;
3035  case 's':
3036  tok->type = TK_CHAR_TYPE;
3037  tok->u.prop.ctype = ONIGENC_CTYPE_S;
3038  tok->u.prop.not = 0;
3039  break;
3040  case 'S':
3041  tok->type = TK_CHAR_TYPE;
3042  tok->u.prop.ctype = ONIGENC_CTYPE_S;
3043  tok->u.prop.not = 1;
3044  break;
3045  case 'h':
3046  if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3047  tok->type = TK_CHAR_TYPE;
3048  tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3049  tok->u.prop.not = 0;
3050  break;
3051  case 'H':
3052  if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3053  tok->type = TK_CHAR_TYPE;
3054  tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3055  tok->u.prop.not = 1;
3056  break;
3057 
3058  case 'p':
3059  case 'P':
3060  c2 = PPEEK;
3061  if (c2 == '{' &&
3063  PINC;
3064  tok->type = TK_CHAR_PROPERTY;
3065  tok->u.prop.not = (c == 'P' ? 1 : 0);
3066 
3068  PFETCH(c2);
3069  if (c2 == '^') {
3070  tok->u.prop.not = (tok->u.prop.not == 0 ? 1 : 0);
3071  }
3072  else
3073  PUNFETCH;
3074  }
3075  }
3076  else {
3077  onig_syntax_warn(env, "invalid Unicode Property \\%c", c);
3078  }
3079  break;
3080 
3081  case 'x':
3082  if (PEND) break;
3083 
3084  prev = p;
3086  PINC;
3087  num = scan_unsigned_hexadecimal_number(&p, end, 8, enc);
3088  if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3089  if (!PEND) {
3090  c2 = PPEEK;
3091  if (ONIGENC_IS_CODE_XDIGIT(enc, c2))
3093  }
3094 
3095  if (p > prev + enclen(enc, prev, end) && !PEND && (PPEEK_IS('}'))) {
3096  PINC;
3097  tok->type = TK_CODE_POINT;
3098  tok->base = 16;
3099  tok->u.code = (OnigCodePoint )num;
3100  }
3101  else {
3102  /* can't read nothing or invalid format */
3103  p = prev;
3104  }
3105  }
3106  else if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_HEX2)) {
3107  num = scan_unsigned_hexadecimal_number(&p, end, 2, enc);
3108  if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3109  if (p == prev) { /* can't read nothing. */
3110  num = 0; /* but, it's not error */
3111  }
3112  tok->type = TK_RAW_BYTE;
3113  tok->base = 16;
3114  tok->u.c = num;
3115  }
3116  break;
3117 
3118  case 'u':
3119  if (PEND) break;
3120 
3121  prev = p;
3123  num = scan_unsigned_hexadecimal_number(&p, end, 4, enc);
3124  if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3125  if (p == prev) { /* can't read nothing. */
3126  num = 0; /* but, it's not error */
3127  }
3128  tok->type = TK_CODE_POINT;
3129  tok->base = 16;
3130  tok->u.code = (OnigCodePoint )num;
3131  }
3132  break;
3133 
3134  case '0':
3135  case '1': case '2': case '3': case '4': case '5': case '6': case '7':
3137  PUNFETCH;
3138  prev = p;
3139  num = scan_unsigned_octal_number(&p, end, 3, enc);
3140  if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3141  if (p == prev) { /* can't read nothing. */
3142  num = 0; /* but, it's not error */
3143  }
3144  tok->type = TK_RAW_BYTE;
3145  tok->base = 8;
3146  tok->u.c = num;
3147  }
3148  break;
3149 
3150  default:
3151  PUNFETCH;
3152  num = fetch_escaped_value(&p, end, env);
3153  if (num < 0) return num;
3154  if (tok->u.c != num) {
3155  tok->u.code = (OnigCodePoint )num;
3156  tok->type = TK_CODE_POINT;
3157  }
3158  break;
3159  }
3160  }
3161  else if (c == '[') {
3162  if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_POSIX_BRACKET) && (PPEEK_IS(':'))) {
3163  OnigCodePoint send[] = { (OnigCodePoint )':', (OnigCodePoint )']' };
3164  tok->backp = p; /* point at '[' is readed */
3165  PINC;
3166  if (str_exist_check_with_esc(send, 2, p, end,
3167  (OnigCodePoint )']', enc, syn)) {
3168  tok->type = TK_POSIX_BRACKET_OPEN;
3169  }
3170  else {
3171  PUNFETCH;
3172  goto cc_in_cc;
3173  }
3174  }
3175  else {
3176  cc_in_cc:
3178  tok->type = TK_CC_CC_OPEN;
3179  }
3180  else {
3181  CC_ESC_WARN(env, (UChar* )"[");
3182  }
3183  }
3184  }
3185  else if (c == '&') {
3187  !PEND && (PPEEK_IS('&'))) {
3188  PINC;
3189  tok->type = TK_CC_AND;
3190  }
3191  }
3192 
3193  end:
3194  *src = p;
3195  return tok->type;
3196 }
3197 
3198 static int
3200 {
3201  int r, num;
3202  OnigCodePoint c;
3203  OnigEncoding enc = env->enc;
3204  const OnigSyntaxType* syn = env->syntax;
3205  UChar* prev;
3206  UChar* p = *src;
3207  PFETCH_READY;
3208 
3209  start:
3210  if (PEND) {
3211  tok->type = TK_EOT;
3212  return tok->type;
3213  }
3214 
3215  tok->type = TK_STRING;
3216  tok->base = 0;
3217  tok->backp = p;
3218 
3219  PFETCH(c);
3220  if (IS_MC_ESC_CODE(c, syn)) {
3221  if (PEND) return ONIGERR_END_PATTERN_AT_ESCAPE;
3222 
3223  tok->backp = p;
3224  PFETCH(c);
3225 
3226  tok->u.c = c;
3227  tok->escaped = 1;
3228  switch (c) {
3229  case '*':
3231  tok->type = TK_OP_REPEAT;
3232  tok->u.repeat.lower = 0;
3233  tok->u.repeat.upper = REPEAT_INFINITE;
3234  goto greedy_check;
3235  break;
3236 
3237  case '+':
3238  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_PLUS_ONE_INF)) break;
3239  tok->type = TK_OP_REPEAT;
3240  tok->u.repeat.lower = 1;
3241  tok->u.repeat.upper = REPEAT_INFINITE;
3242  goto greedy_check;
3243  break;
3244 
3245  case '?':
3246  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_QMARK_ZERO_ONE)) break;
3247  tok->type = TK_OP_REPEAT;
3248  tok->u.repeat.lower = 0;
3249  tok->u.repeat.upper = 1;
3250  greedy_check:
3251  if (!PEND && PPEEK_IS('?') &&
3253  PFETCH(c);
3254  tok->u.repeat.greedy = 0;
3255  tok->u.repeat.possessive = 0;
3256  }
3257  else {
3258  possessive_check:
3259  if (!PEND && PPEEK_IS('+') &&
3261  tok->type != TK_INTERVAL) ||
3263  tok->type == TK_INTERVAL))) {
3264  PFETCH(c);
3265  tok->u.repeat.greedy = 1;
3266  tok->u.repeat.possessive = 1;
3267  }
3268  else {
3269  tok->u.repeat.greedy = 1;
3270  tok->u.repeat.possessive = 0;
3271  }
3272  }
3273  break;
3274 
3275  case '{':
3276  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_BRACE_INTERVAL)) break;
3277  r = fetch_range_quantifier(&p, end, tok, env);
3278  if (r < 0) return r; /* error */
3279  if (r == 0) goto greedy_check;
3280  else if (r == 2) { /* {n} */
3282  goto possessive_check;
3283 
3284  goto greedy_check;
3285  }
3286  /* r == 1 : normal char */
3287  break;
3288 
3289  case '|':
3290  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_VBAR_ALT)) break;
3291  tok->type = TK_ALT;
3292  break;
3293 
3294  case '(':
3295  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break;
3296  tok->type = TK_SUBEXP_OPEN;
3297  break;
3298 
3299  case ')':
3300  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_LPAREN_SUBEXP)) break;
3301  tok->type = TK_SUBEXP_CLOSE;
3302  break;
3303 
3304  case 'w':
3305  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_W_WORD)) break;
3306  tok->type = TK_CHAR_TYPE;
3307  tok->u.prop.ctype = ONIGENC_CTYPE_W;
3308  tok->u.prop.not = 0;
3309  break;
3310 
3311  case 'W':
3312  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_W_WORD)) break;
3313  tok->type = TK_CHAR_TYPE;
3314  tok->u.prop.ctype = ONIGENC_CTYPE_W;
3315  tok->u.prop.not = 1;
3316  break;
3317 
3318  case 'b':
3319  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_B_WORD_BOUND)) break;
3320  tok->type = TK_ANCHOR;
3321  tok->u.anchor = ANCHOR_WORD_BOUND;
3322  break;
3323 
3324  case 'B':
3325  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_B_WORD_BOUND)) break;
3326  tok->type = TK_ANCHOR;
3328  break;
3329 
3330 #ifdef USE_WORD_BEGIN_END
3331  case '<':
3333  tok->type = TK_ANCHOR;
3334  tok->u.anchor = ANCHOR_WORD_BEGIN;
3335  break;
3336 
3337  case '>':
3339  tok->type = TK_ANCHOR;
3340  tok->u.anchor = ANCHOR_WORD_END;
3341  break;
3342 #endif
3343 
3344  case 's':
3345  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_S_WHITE_SPACE)) break;
3346  tok->type = TK_CHAR_TYPE;
3347  tok->u.prop.ctype = ONIGENC_CTYPE_S;
3348  tok->u.prop.not = 0;
3349  break;
3350 
3351  case 'S':
3352  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_S_WHITE_SPACE)) break;
3353  tok->type = TK_CHAR_TYPE;
3354  tok->u.prop.ctype = ONIGENC_CTYPE_S;
3355  tok->u.prop.not = 1;
3356  break;
3357 
3358  case 'd':
3359  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_D_DIGIT)) break;
3360  tok->type = TK_CHAR_TYPE;
3361  tok->u.prop.ctype = ONIGENC_CTYPE_D;
3362  tok->u.prop.not = 0;
3363  break;
3364 
3365  case 'D':
3366  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_D_DIGIT)) break;
3367  tok->type = TK_CHAR_TYPE;
3368  tok->u.prop.ctype = ONIGENC_CTYPE_D;
3369  tok->u.prop.not = 1;
3370  break;
3371 
3372  case 'h':
3373  if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3374  tok->type = TK_CHAR_TYPE;
3375  tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3376  tok->u.prop.not = 0;
3377  break;
3378 
3379  case 'H':
3380  if (! IS_SYNTAX_OP2(syn, ONIG_SYN_OP2_ESC_H_XDIGIT)) break;
3381  tok->type = TK_CHAR_TYPE;
3382  tok->u.prop.ctype = ONIGENC_CTYPE_XDIGIT;
3383  tok->u.prop.not = 1;
3384  break;
3385 
3386  case 'A':
3387  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break;
3388  begin_buf:
3389  tok->type = TK_ANCHOR;
3390  tok->u.subtype = ANCHOR_BEGIN_BUF;
3391  break;
3392 
3393  case 'Z':
3394  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break;
3395  tok->type = TK_ANCHOR;
3396  tok->u.subtype = ANCHOR_SEMI_END_BUF;
3397  break;
3398 
3399  case 'z':
3400  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR)) break;
3401  end_buf:
3402  tok->type = TK_ANCHOR;
3403  tok->u.subtype = ANCHOR_END_BUF;
3404  break;
3405 
3406  case 'G':
3408  tok->type = TK_ANCHOR;
3410  break;
3411 
3412  case '`':
3414  goto begin_buf;
3415  break;
3416 
3417  case '\'':
3419  goto end_buf;
3420  break;
3421 
3422  case 'x':
3423  if (PEND) break;
3424 
3425  prev = p;
3427  PINC;
3428  num = scan_unsigned_hexadecimal_number(&p, end, 8, enc);
3429  if (num < 0) return ONIGERR_TOO_BIG_WIDE_CHAR_VALUE;
3430  if (!PEND) {
3431  if (ONIGENC_IS_CODE_XDIGIT(enc, PPEEK))
3433  }
3434 
3435  if ((p > prev + enclen(enc, prev, end)) && !PEND && PPEEK_IS('}')) {
3436  PINC;
3437  tok->type = TK_CODE_POINT;
3438  tok->u.code = (OnigCodePoint )num;
3439  }
3440  else {
3441  /* can't read nothing or invalid format */
3442  p = prev;
3443  }
3444  }
3445  else if (IS_SYNTAX_OP(syn, ONIG_SYN_OP_ESC_X_HEX2)) {
3446  num = scan_unsigned_hexadecimal_number(&p, end, 2, enc);
3447  if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3448  if (p == prev) { /* can't read nothing. */
3449  num = 0; /* but, it's not error */
3450  }
3451  tok->type = TK_RAW_BYTE;
3452  tok->base = 16;
3453  tok->u.c = num;
3454  }
3455  break;
3456 
3457  case 'u':
3458  if (PEND) break;
3459 
3460  prev = p;
3462  num = scan_unsigned_hexadecimal_number(&p, end, 4, enc);
3463  if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3464  if (p == prev) { /* can't read nothing. */
3465  num = 0; /* but, it's not error */
3466  }
3467  tok->type = TK_CODE_POINT;
3468  tok->base = 16;
3469  tok->u.code = (OnigCodePoint )num;
3470  }
3471  break;
3472 
3473  case '1': case '2': case '3': case '4':
3474  case '5': case '6': case '7': case '8': case '9':
3475  PUNFETCH;
3476  prev = p;
3477  num = onig_scan_unsigned_number(&p, end, enc);
3478  if (num < 0 || num > ONIG_MAX_BACKREF_NUM) {
3479  goto skip_backref;
3480  }
3481 
3483  (num <= env->num_mem || num <= 9)) { /* This spec. from GNU regex */
3485  if (num > env->num_mem || IS_NULL(SCANENV_MEM_NODES(env)[num]))
3486  return ONIGERR_INVALID_BACKREF;
3487  }
3488 
3489  tok->type = TK_BACKREF;
3490  tok->u.backref.num = 1;
3491  tok->u.backref.ref1 = num;
3492  tok->u.backref.by_name = 0;
3493 #ifdef USE_BACKREF_WITH_LEVEL
3494  tok->u.backref.exist_level = 0;
3495 #endif
3496  break;
3497  }
3498 
3499  skip_backref:
3500  if (c == '8' || c == '9') {
3501  /* normal char */
3502  p = prev; PINC;
3503  break;
3504  }
3505 
3506  p = prev;
3507  /* fall through */
3508  case '0':
3510  prev = p;
3511  num = scan_unsigned_octal_number(&p, end, (c == '0' ? 2:3), enc);
3512  if (num < 0) return ONIGERR_TOO_BIG_NUMBER;
3513  if (p == prev) { /* can't read nothing. */
3514  num = 0; /* but, it's not error */
3515  }
3516  tok->type = TK_RAW_BYTE;
3517  tok->base = 8;
3518  tok->u.c = num;
3519  }
3520  else if (c != '0') {
3521  PINC;
3522  }
3523  break;
3524 
3525 #ifdef USE_NAMED_GROUP
3526  case 'k':
3528  PFETCH(c);
3529  if (c == '<' || c == '\'') {
3530  UChar* name_end;
3531  int* backs;
3532  int back_num;
3533 
3534  prev = p;
3535 
3536 #ifdef USE_BACKREF_WITH_LEVEL
3537  name_end = NULL_UCHARP; /* no need. escape gcc warning. */
3538  r = fetch_name_with_level((OnigCodePoint )c, &p, end, &name_end,
3539  env, &back_num, &tok->u.backref.level);
3540  if (r == 1) tok->u.backref.exist_level = 1;
3541  else tok->u.backref.exist_level = 0;
3542 #else
3543  r = fetch_name(&p, end, &name_end, env, &back_num, 1);
3544 #endif
3545  if (r < 0) return r;
3546 
3547  if (back_num != 0) {
3548  if (back_num < 0) {
3549  back_num = BACKREF_REL_TO_ABS(back_num, env);
3550  if (back_num <= 0)
3551  return ONIGERR_INVALID_BACKREF;
3552  }
3553 
3555  if (back_num > env->num_mem ||
3556  IS_NULL(SCANENV_MEM_NODES(env)[back_num]))
3557  return ONIGERR_INVALID_BACKREF;
3558  }
3559  tok->type = TK_BACKREF;
3560  tok->u.backref.by_name = 0;
3561  tok->u.backref.num = 1;
3562  tok->u.backref.ref1 = back_num;
3563  }
3564  else {
3565  num = onig_name_to_group_numbers(env->reg, prev, name_end, &backs);
3566  if (num <= 0) {
3568  ONIGERR_UNDEFINED_NAME_REFERENCE, prev, name_end);
3570  }
3572  int i;
3573  for (i = 0; i < num; i++) {
3574  if (backs[i] > env->num_mem ||
3575  IS_NULL(SCANENV_MEM_NODES(env)[backs[i]]))
3576  return ONIGERR_INVALID_BACKREF;
3577  }
3578  }
3579 
3580  tok->type = TK_BACKREF;
3581  tok->u.backref.by_name = 1;
3582  if (num == 1) {
3583  tok->u.backref.num = 1;
3584  tok->u.backref.ref1 = backs[0];
3585  }
3586  else {
3587  tok->u.backref.num = num;
3588  tok->u.backref.refs = backs;
3589  }
3590  }
3591  }
3592  else {
3593  PUNFETCH;
3594  onig_syntax_warn(env, "invalid back reference");
3595  }
3596  }
3597  break;
3598 #endif
3599 
3600 #ifdef USE_SUBEXP_CALL
3601  case 'g':
3603  PFETCH(c);
3604  if (c == '<' || c == '\'') {
3605  int gnum;
3606  UChar* name_end;
3607 
3608  prev = p;
3609  r = fetch_name((OnigCodePoint )c, &p, end, &name_end, env, &gnum, 1);
3610  if (r < 0) return r;
3611 
3612  tok->type = TK_CALL;
3613  tok->u.call.name = prev;
3614  tok->u.call.name_end = name_end;
3615  tok->u.call.gnum = gnum;
3616  }
3617  else {
3618  onig_syntax_warn(env, "invalid subexp call");
3619  PUNFETCH;
3620  }
3621  }
3622  break;
3623 #endif
3624 
3625  case 'Q':
3627  tok->type = TK_QUOTE_OPEN;
3628  }
3629  break;
3630 
3631  case 'p':
3632  case 'P':
3633  if (PPEEK_IS('{') &&
3635  PINC;
3636  tok->type = TK_CHAR_PROPERTY;
3637  tok->u.prop.not = (c == 'P' ? 1 : 0);
3638 
3640  PFETCH(c);
3641  if (c == '^') {
3642  tok->u.prop.not = (tok->u.prop.not == 0 ? 1 : 0);
3643  }
3644  else
3645  PUNFETCH;
3646  }
3647  }
3648  else {
3649  onig_syntax_warn(env, "invalid Unicode Property \\%c", c);
3650  }
3651  break;
3652 
3653  default:
3654  PUNFETCH;
3655  num = fetch_escaped_value(&p, end, env);
3656  if (num < 0) return num;
3657  /* set_raw: */
3658  if (tok->u.c != num) {
3659  tok->type = TK_CODE_POINT;
3660  tok->u.code = (OnigCodePoint )num;
3661  }
3662  else { /* string */
3663  p = tok->backp + enclen(enc, tok->backp, end);
3664  }
3665  break;
3666  }
3667  }
3668  else {
3669  tok->u.c = c;
3670  tok->escaped = 0;
3671 
3672 #ifdef USE_VARIABLE_META_CHARS
3673  if ((c != ONIG_INEFFECTIVE_META_CHAR) &&
3675  if (c == MC_ANYCHAR(syn))
3676  goto any_char;
3677  else if (c == MC_ANYTIME(syn))
3678  goto anytime;
3679  else if (c == MC_ZERO_OR_ONE_TIME(syn))
3680  goto zero_or_one_time;
3681  else if (c == MC_ONE_OR_MORE_TIME(syn))
3682  goto one_or_more_time;
3683  else if (c == MC_ANYCHAR_ANYTIME(syn)) {
3684  tok->type = TK_ANYCHAR_ANYTIME;
3685  goto out;
3686  }
3687  }
3688 #endif
3689 
3690  switch (c) {
3691  case '.':
3692  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_DOT_ANYCHAR)) break;
3693 #ifdef USE_VARIABLE_META_CHARS
3694  any_char:
3695 #endif
3696  tok->type = TK_ANYCHAR;
3697  break;
3698 
3699  case '*':
3700  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_ASTERISK_ZERO_INF)) break;
3701 #ifdef USE_VARIABLE_META_CHARS
3702  anytime:
3703 #endif
3704  tok->type = TK_OP_REPEAT;
3705  tok->u.repeat.lower = 0;
3706  tok->u.repeat.upper = REPEAT_INFINITE;
3707  goto greedy_check;
3708  break;
3709 
3710  case '+':
3711  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_PLUS_ONE_INF)) break;
3712 #ifdef USE_VARIABLE_META_CHARS
3713  one_or_more_time:
3714 #endif
3715  tok->type = TK_OP_REPEAT;
3716  tok->u.repeat.lower = 1;
3717  tok->u.repeat.upper = REPEAT_INFINITE;
3718  goto greedy_check;
3719  break;
3720 
3721  case '?':
3722  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_QMARK_ZERO_ONE)) break;
3723 #ifdef USE_VARIABLE_META_CHARS
3724  zero_or_one_time:
3725 #endif
3726  tok->type = TK_OP_REPEAT;
3727  tok->u.repeat.lower = 0;
3728  tok->u.repeat.upper = 1;
3729  goto greedy_check;
3730  break;
3731 
3732  case '{':
3733  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_BRACE_INTERVAL)) break;
3734  r = fetch_range_quantifier(&p, end, tok, env);
3735  if (r < 0) return r; /* error */
3736  if (r == 0) goto greedy_check;
3737  else if (r == 2) { /* {n} */
3739  goto possessive_check;
3740 
3741  goto greedy_check;
3742  }
3743  /* r == 1 : normal char */
3744  break;
3745 
3746  case '|':
3747  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_VBAR_ALT)) break;
3748  tok->type = TK_ALT;
3749  break;
3750 
3751  case '(':
3752  if (PPEEK_IS('?') &&
3754  PINC;
3755  if (PPEEK_IS('#')) {
3756  PFETCH(c);
3757  while (1) {
3758  if (PEND) return ONIGERR_END_PATTERN_IN_GROUP;
3759  PFETCH(c);
3760  if (c == MC_ESC(syn)) {
3761  if (!PEND) PFETCH(c);
3762  }
3763  else {
3764  if (c == ')') break;
3765  }
3766  }
3767  goto start;
3768  }
3769  PUNFETCH;
3770  }
3771 
3772  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break;
3773  tok->type = TK_SUBEXP_OPEN;
3774  break;
3775 
3776  case ')':
3777  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LPAREN_SUBEXP)) break;
3778  tok->type = TK_SUBEXP_CLOSE;
3779  break;
3780 
3781  case '^':
3782  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break;
3783  tok->type = TK_ANCHOR;
3784  tok->u.subtype = (IS_SINGLELINE(env->option)
3786  break;
3787 
3788  case '$':
3789  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_LINE_ANCHOR)) break;
3790  tok->type = TK_ANCHOR;
3791  tok->u.subtype = (IS_SINGLELINE(env->option)
3793  break;
3794 
3795  case '[':
3796  if (! IS_SYNTAX_OP(syn, ONIG_SYN_OP_BRACKET_CC)) break;
3797  tok->type = TK_CC_OPEN;
3798  break;
3799 
3800  case ']':
3801  if (*src > env->pattern) /* /].../ is allowed. */
3803  break;
3804 
3805  case '#':
3806  if (IS_EXTEND(env->option)) {
3807  while (!PEND) {
3808  PFETCH(c);
3809  if (ONIGENC_IS_CODE_NEWLINE(enc, c))
3810  break;
3811  }
3812  goto start;
3813  break;
3814  }
3815  break;
3816 
3817  case ' ': case '\t': case '\n': case '\r': case '\f':
3818  if (IS_EXTEND(env->option))
3819  goto start;
3820  break;
3821 
3822  default:
3823  /* string */
3824  break;
3825  }
3826  }
3827 
3828 #ifdef USE_VARIABLE_META_CHARS
3829  out:
3830 #endif
3831  *src = p;
3832  return tok->type;
3833 }
3834 
3835 static int
3836 add_ctype_to_cc_by_range(CClassNode* cc, int ctype ARG_UNUSED, int not,
3837  ScanEnv* env,
3838  OnigCodePoint sb_out, const OnigCodePoint mbr[])
3839 {
3840  int i, r;
3841  OnigCodePoint j;
3842 
3843  int n = ONIGENC_CODE_RANGE_NUM(mbr);
3844 
3845  if (not == 0) {
3846  for (i = 0; i < n; i++) {
3847  for (j = ONIGENC_CODE_RANGE_FROM(mbr, i);
3848  j <= ONIGENC_CODE_RANGE_TO(mbr, i); j++) {
3849  if (j >= sb_out) {
3850  if (j > ONIGENC_CODE_RANGE_FROM(mbr, i)) {
3851  r = add_code_range_to_buf(&(cc->mbuf), env, j,
3852  ONIGENC_CODE_RANGE_TO(mbr, i));
3853  if (r != 0) return r;
3854  i++;
3855  }
3856 
3857  goto sb_end;
3858  }
3859  BITSET_SET_BIT_CHKDUP(cc->bs, j);
3860  }
3861  }
3862 
3863  sb_end:
3864  for ( ; i < n; i++) {
3865  r = add_code_range_to_buf(&(cc->mbuf), env,
3866  ONIGENC_CODE_RANGE_FROM(mbr, i),
3867  ONIGENC_CODE_RANGE_TO(mbr, i));
3868  if (r != 0) return r;
3869  }
3870  }
3871  else {
3872  OnigCodePoint prev = 0;
3873 
3874  for (i = 0; i < n; i++) {
3875  for (j = prev;
3876  j < ONIGENC_CODE_RANGE_FROM(mbr, i); j++) {
3877  if (j >= sb_out) {
3878  goto sb_end2;
3879  }
3880  BITSET_SET_BIT_CHKDUP(cc->bs, j);
3881  }
3882  prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1;
3883  }
3884  for (j = prev; j < sb_out; j++) {
3885  BITSET_SET_BIT_CHKDUP(cc->bs, j);
3886  }
3887 
3888  sb_end2:
3889  prev = sb_out;
3890 
3891  for (i = 0; i < n; i++) {
3892  if (prev < ONIGENC_CODE_RANGE_FROM(mbr, i)) {
3893  r = add_code_range_to_buf(&(cc->mbuf), env, prev,
3894  ONIGENC_CODE_RANGE_FROM(mbr, i) - 1);
3895  if (r != 0) return r;
3896  }
3897  prev = ONIGENC_CODE_RANGE_TO(mbr, i) + 1;
3898  }
3899  if (prev < 0x7fffffff) {
3900  r = add_code_range_to_buf(&(cc->mbuf), env, prev, 0x7fffffff);
3901  if (r != 0) return r;
3902  }
3903  }
3904 
3905  return 0;
3906 }
3907 
3908 static int
3909 add_ctype_to_cc(CClassNode* cc, int ctype, int not, ScanEnv* env)
3910 {
3911  int c, r;
3912  const OnigCodePoint *ranges;
3913  OnigCodePoint sb_out;
3914  OnigEncoding enc = env->enc;
3915 
3916  switch (ctype) {
3917  case ONIGENC_CTYPE_D:
3918  case ONIGENC_CTYPE_S:
3919  case ONIGENC_CTYPE_W:
3920  ctype ^= ONIGENC_CTYPE_SPECIAL_MASK;
3921  if (not != 0) {
3922  for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
3923  if (! ONIGENC_IS_ASCII_CODE_CTYPE((OnigCodePoint )c, ctype))
3924  BITSET_SET_BIT_CHKDUP(cc->bs, c);
3925  }
3926  ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
3927  }
3928  else {
3929  for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
3931  BITSET_SET_BIT_CHKDUP(cc->bs, c);
3932  }
3933  }
3934  return 0;
3935  break;
3936  }
3937 
3938  r = ONIGENC_GET_CTYPE_CODE_RANGE(enc, ctype, &sb_out, &ranges);
3939  if (r == 0) {
3940  return add_ctype_to_cc_by_range(cc, ctype, not, env, sb_out, ranges);
3941  }
3942  else if (r != ONIG_NO_SUPPORT_CONFIG) {
3943  return r;
3944  }
3945 
3946  r = 0;
3947  switch (ctype) {
3948  case ONIGENC_CTYPE_ALPHA:
3949  case ONIGENC_CTYPE_BLANK:
3950  case ONIGENC_CTYPE_CNTRL:
3951  case ONIGENC_CTYPE_DIGIT:
3952  case ONIGENC_CTYPE_LOWER:
3953  case ONIGENC_CTYPE_PUNCT:
3954  case ONIGENC_CTYPE_SPACE:
3955  case ONIGENC_CTYPE_UPPER:
3956  case ONIGENC_CTYPE_XDIGIT:
3957  case ONIGENC_CTYPE_ASCII:
3958  case ONIGENC_CTYPE_ALNUM:
3959  if (not != 0) {
3960  for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
3961  if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
3962  BITSET_SET_BIT_CHKDUP(cc->bs, c);
3963  }
3964  ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
3965  }
3966  else {
3967  for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
3968  if (ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
3969  BITSET_SET_BIT_CHKDUP(cc->bs, c);
3970  }
3971  }
3972  break;
3973 
3974  case ONIGENC_CTYPE_GRAPH:
3975  case ONIGENC_CTYPE_PRINT:
3976  if (not != 0) {
3977  for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
3978  if (! ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
3979  BITSET_SET_BIT_CHKDUP(cc->bs, c);
3980  }
3981  }
3982  else {
3983  for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
3984  if (ONIGENC_IS_CODE_CTYPE(enc, (OnigCodePoint )c, ctype))
3985  BITSET_SET_BIT_CHKDUP(cc->bs, c);
3986  }
3987  ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
3988  }
3989  break;
3990 
3991  case ONIGENC_CTYPE_WORD:
3992  if (not == 0) {
3993  for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
3994  if (IS_CODE_SB_WORD(enc, c)) BITSET_SET_BIT_CHKDUP(cc->bs, c);
3995  }
3996  ADD_ALL_MULTI_BYTE_RANGE(enc, cc->mbuf);
3997  }
3998  else {
3999  for (c = 0; c < SINGLE_BYTE_SIZE; c++) {
4000  if ((ONIGENC_CODE_TO_MBCLEN(enc, c) > 0) /* check invalid code point */
4001  && ! ONIGENC_IS_CODE_WORD(enc, c))
4002  BITSET_SET_BIT_CHKDUP(cc->bs, c);
4003  }
4004  }
4005  break;
4006 
4007  default:
4008  return ONIGERR_PARSER_BUG;
4009  break;
4010  }
4011 
4012  return r;
4013 }
4014 
4015 static int
4017 {
4018 #define POSIX_BRACKET_CHECK_LIMIT_LENGTH 20
4019 #define POSIX_BRACKET_NAME_MIN_LEN 4
4020 
4021  static const PosixBracketEntryType PBS[] = {
4022  { (UChar* )"alnum", ONIGENC_CTYPE_ALNUM, 5 },
4023  { (UChar* )"alpha", ONIGENC_CTYPE_ALPHA, 5 },
4024  { (UChar* )"blank", ONIGENC_CTYPE_BLANK, 5 },
4025  { (UChar* )"cntrl", ONIGENC_CTYPE_CNTRL, 5 },
4026  { (UChar* )"digit", ONIGENC_CTYPE_DIGIT, 5 },
4027  { (UChar* )"graph", ONIGENC_CTYPE_GRAPH, 5 },
4028  { (UChar* )"lower", ONIGENC_CTYPE_LOWER, 5 },
4029  { (UChar* )"print", ONIGENC_CTYPE_PRINT, 5 },
4030  { (UChar* )"punct", ONIGENC_CTYPE_PUNCT, 5 },
4031  { (UChar* )"space", ONIGENC_CTYPE_SPACE, 5 },
4032  { (UChar* )"upper", ONIGENC_CTYPE_UPPER, 5 },
4033  { (UChar* )"xdigit", ONIGENC_CTYPE_XDIGIT, 6 },
4034  { (UChar* )"ascii", ONIGENC_CTYPE_ASCII, 5 },
4035  { (UChar* )"word", ONIGENC_CTYPE_WORD, 4 },
4036  { (UChar* )NULL, -1, 0 }
4037  };
4038 
4039  const PosixBracketEntryType *pb;
4040  int not, i, r;
4041  OnigCodePoint c;
4042  OnigEncoding enc = env->enc;
4043  UChar *p = *src;
4044  PFETCH_READY;
4045 
4046  if (PPEEK_IS('^')) {
4047  PINC;
4048  not = 1;
4049  }
4050  else
4051  not = 0;
4052 
4053  if (onigenc_strlen(enc, p, end) < POSIX_BRACKET_NAME_MIN_LEN + 3)
4054  goto not_posix_bracket;
4055 
4056  for (pb = PBS; IS_NOT_NULL(pb->name); pb++) {
4057  if (onigenc_with_ascii_strncmp(enc, p, end, pb->name, pb->len) == 0) {
4058  p = (UChar* )onigenc_step(enc, p, end, pb->len);
4059  if (onigenc_with_ascii_strncmp(enc, p, end, (UChar* )":]", 2) != 0)
4061 
4062  r = add_ctype_to_cc(cc, pb->ctype, not, env);
4063  if (r != 0) return r;
4064 
4065  PINC; PINC;
4066  *src = p;
4067  return 0;
4068  }
4069  }
4070 
4071  not_posix_bracket:
4072  c = 0;
4073  i = 0;
4074  while (!PEND && ((c = PPEEK) != ':') && c != ']') {
4075  PINC;
4076  if (++i > POSIX_BRACKET_CHECK_LIMIT_LENGTH) break;
4077  }
4078  if (c == ':' && ! PEND) {
4079  PINC;
4080  if (! PEND) {
4081  PFETCH(c);
4082  if (c == ']')
4084  }
4085  }
4086 
4087  return 1; /* 1: is not POSIX bracket, but no error. */
4088 }
4089 
4090 static int
4092 {
4093  int r;
4094  OnigCodePoint c;
4095  OnigEncoding enc = env->enc;
4096  UChar *prev, *start, *p = *src;
4097  PFETCH_READY;
4098 
4099  r = 0;
4100  start = prev = p;
4101 
4102  while (!PEND) {
4103  prev = p;
4104  PFETCH(c);
4105  if (c == '}') {
4106  r = ONIGENC_PROPERTY_NAME_TO_CTYPE(enc, start, prev);
4107  if (r < 0) break;
4108 
4109  *src = p;
4110  return r;
4111  }
4112  else if (c == '(' || c == ')' || c == '{' || c == '|') {
4114  break;
4115  }
4116  }
4117 
4118  onig_scan_env_set_error_string(env, r, *src, prev);
4119  return r;
4120 }
4121 
4122 static int
4124  ScanEnv* env)
4125 {
4126  int r, ctype;
4127  CClassNode* cc;
4128 
4129  ctype = fetch_char_property_to_ctype(src, end, env);
4130  if (ctype < 0) return ctype;
4131 
4132  *np = node_new_cclass();
4134  cc = NCCLASS(*np);
4135  r = add_ctype_to_cc(cc, ctype, 0, env);
4136  if (r != 0) return r;
4137  if (tok->u.prop.not != 0) NCCLASS_SET_NOT(cc);
4138 
4139  return 0;
4140 }
4141 
4142 
4143 enum CCSTATE {
4148 };
4149 
4154 };
4155 
4156 static int
4158  enum CCSTATE* state, ScanEnv* env)
4159 {
4160  int r;
4161 
4162  if (*state == CCS_RANGE)
4164 
4165  if (*state == CCS_VALUE && *type != CCV_CLASS) {
4166  if (*type == CCV_SB)
4167  BITSET_SET_BIT_CHKDUP(cc->bs, (int )(*vs));
4168  else if (*type == CCV_CODE_POINT) {
4169  r = add_code_range(&(cc->mbuf), env, *vs, *vs);
4170  if (r < 0) return r;
4171  }
4172  }
4173 
4174  *state = CCS_VALUE;
4175  *type = CCV_CLASS;
4176  return 0;
4177 }
4178 
4179 static int
4181  int* vs_israw, int v_israw,
4182  enum CCVALTYPE intype, enum CCVALTYPE* type,
4183  enum CCSTATE* state, ScanEnv* env)
4184 {
4185  int r;
4186 
4187  switch (*state) {
4188  case CCS_VALUE:
4189  if (*type == CCV_SB)
4190  BITSET_SET_BIT_CHKDUP(cc->bs, (int )(*vs));
4191  else if (*type == CCV_CODE_POINT) {
4192  r = add_code_range(&(cc->mbuf), env, *vs, *vs);
4193  if (r < 0) return r;
4194  }
4195  break;
4196 
4197  case CCS_RANGE:
4198  if (intype == *type) {
4199  if (intype == CCV_SB) {
4200  if (*vs > 0xff || v > 0xff)
4202 
4203  if (*vs > v) {
4205  goto ccs_range_end;
4206  else
4208  }
4209  bitset_set_range(env, cc->bs, (int )*vs, (int )v);
4210  }
4211  else {
4212  r = add_code_range(&(cc->mbuf), env, *vs, v);
4213  if (r < 0) return r;
4214  }
4215  }
4216  else {
4217 #if 0
4218  if (intype == CCV_CODE_POINT && *type == CCV_SB) {
4219 #endif
4220  if (*vs > v) {
4222  goto ccs_range_end;
4223  else
4225  }
4226  bitset_set_range(env, cc->bs, (int )*vs, (int )(v < 0xff ? v : 0xff));
4227  r = add_code_range(&(cc->mbuf), env, (OnigCodePoint )*vs, v);
4228  if (r < 0) return r;
4229 #if 0
4230  }
4231  else
4233 #endif
4234  }
4235  ccs_range_end:
4236  *state = CCS_COMPLETE;
4237  break;
4238 
4239  case CCS_COMPLETE:
4240  case CCS_START:
4241  *state = CCS_VALUE;
4242  break;
4243 
4244  default:
4245  break;
4246  }
4247 
4248  *vs_israw = v_israw;
4249  *vs = v;
4250  *type = intype;
4251  return 0;
4252 }
4253 
4254 static int
4255 code_exist_check(OnigCodePoint c, UChar* from, UChar* end, int ignore_escaped,
4256  ScanEnv* env)
4257 {
4258  int in_esc;
4259  OnigCodePoint code;
4260  OnigEncoding enc = env->enc;
4261  UChar* p = from;
4262  PFETCH_READY;
4263 
4264  in_esc = 0;
4265  while (! PEND) {
4266  if (ignore_escaped && in_esc) {
4267  in_esc = 0;
4268  }
4269  else {
4270  PFETCH(code);
4271  if (code == c) return 1;
4272  if (code == MC_ESC(env->syntax)) in_esc = 1;
4273  }
4274  }
4275  return 0;
4276 }
4277 
4278 static int
4280  ScanEnv* env)
4281 {
4282  int r, neg, len, fetched, and_start;
4283  OnigCodePoint v, vs;
4284  UChar *p;
4285  Node* node;
4286  CClassNode *cc, *prev_cc;
4287  CClassNode work_cc;
4288 
4289  enum CCSTATE state;
4290  enum CCVALTYPE val_type, in_type;
4291  int val_israw, in_israw;
4292 
4293  prev_cc = (CClassNode* )NULL;
4294  *np = NULL_NODE;
4295  r = fetch_token_in_cc(tok, src, end, env);
4296  if (r == TK_CHAR && tok->u.c == '^' && tok->escaped == 0) {
4297  neg = 1;
4298  r = fetch_token_in_cc(tok, src, end, env);
4299  }
4300  else {
4301  neg = 0;
4302  }
4303 
4304  if (r < 0) return r;
4305  if (r == TK_CC_CLOSE) {
4306  if (! code_exist_check((OnigCodePoint )']',
4307  *src, env->pattern_end, 1, env))
4308  return ONIGERR_EMPTY_CHAR_CLASS;
4309 
4310  CC_ESC_WARN(env, (UChar* )"]");
4311  r = tok->type = TK_CHAR; /* allow []...] */
4312  }
4313 
4314  *np = node = node_new_cclass();
4316  cc = NCCLASS(node);
4317 
4318  and_start = 0;
4319  state = CCS_START;
4320  p = *src;
4321  while (r != TK_CC_CLOSE) {
4322  fetched = 0;
4323  switch (r) {
4324  case TK_CHAR:
4325  if ((tok->u.code >= SINGLE_BYTE_SIZE) ||
4326  (len = ONIGENC_CODE_TO_MBCLEN(env->enc, tok->u.c)) > 1) {
4327  in_type = CCV_CODE_POINT;
4328  }
4329  else if (len < 0) {
4330  r = len;
4331  goto err;
4332  }
4333  else {
4334  sb_char:
4335  in_type = CCV_SB;
4336  }
4337  v = (OnigCodePoint )tok->u.c;
4338  in_israw = 0;
4339  goto val_entry2;
4340  break;
4341 
4342  case TK_RAW_BYTE:
4343  /* tok->base != 0 : octal or hexadec. */
4344  if (! ONIGENC_IS_SINGLEBYTE(env->enc) && tok->base != 0) {
4346  UChar* bufe = buf + ONIGENC_CODE_TO_MBC_MAXLEN;
4347  UChar* psave = p;
4348  int i, base = tok->base;
4349 
4350  buf[0] = tok->u.c;
4351  for (i = 1; i < ONIGENC_MBC_MAXLEN(env->enc); i++) {
4352  r = fetch_token_in_cc(tok, &p, end, env);
4353  if (r < 0) goto err;
4354  if (r != TK_RAW_BYTE || tok->base != base) {
4355  fetched = 1;
4356  break;
4357  }
4358  buf[i] = tok->u.c;
4359  }
4360 
4361  if (i < ONIGENC_MBC_MINLEN(env->enc)) {
4363  goto err;
4364  }
4365 
4366  len = enclen(env->enc, buf, buf+i);
4367  if (i < len) {
4369  goto err;
4370  }
4371  else if (i > len) { /* fetch back */
4372  p = psave;
4373  for (i = 1; i < len; i++) {
4374  r = fetch_token_in_cc(tok, &p, end, env);
4375  }
4376  fetched = 0;
4377  }
4378 
4379  if (i == 1) {
4380  v = (OnigCodePoint )buf[0];
4381  goto raw_single;
4382  }
4383  else {
4384  v = ONIGENC_MBC_TO_CODE(env->enc, buf, bufe);
4385  in_type = CCV_CODE_POINT;
4386  }
4387  }
4388  else {
4389  v = (OnigCodePoint )tok->u.c;
4390  raw_single:
4391  in_type = CCV_SB;
4392  }
4393  in_israw = 1;
4394  goto val_entry2;
4395  break;
4396 
4397  case TK_CODE_POINT:
4398  v = tok->u.code;
4399  in_israw = 1;
4400  val_entry:
4401  len = ONIGENC_CODE_TO_MBCLEN(env->enc, v);
4402  if (len < 0) {
4403  r = len;
4404  goto err;
4405  }
4406  in_type = (len == 1 ? CCV_SB : CCV_CODE_POINT);
4407  val_entry2:
4408  r = next_state_val(cc, &vs, v, &val_israw, in_israw, in_type, &val_type,
4409  &state, env);
4410  if (r != 0) goto err;
4411  break;
4412 
4413  case TK_POSIX_BRACKET_OPEN:
4414  r = parse_posix_bracket(cc, &p, end, env);
4415  if (r < 0) goto err;
4416  if (r == 1) { /* is not POSIX bracket */
4417  CC_ESC_WARN(env, (UChar* )"[");
4418  p = tok->backp;
4419  v = (OnigCodePoint )tok->u.c;
4420  in_israw = 0;
4421  goto val_entry;
4422  }
4423  goto next_class;
4424  break;
4425 
4426  case TK_CHAR_TYPE:
4427  r = add_ctype_to_cc(cc, tok->u.prop.ctype, tok->u.prop.not, env);
4428  if (r != 0) return r;
4429 
4430  next_class:
4431  r = next_state_class(cc, &vs, &val_type, &state, env);
4432  if (r != 0) goto err;
4433  break;
4434 
4435  case TK_CHAR_PROPERTY:
4436  {
4437  int ctype;
4438 
4439  ctype = fetch_char_property_to_ctype(&p, end, env);
4440  if (ctype < 0) return ctype;
4441  r = add_ctype_to_cc(cc, ctype, tok->u.prop.not, env);
4442  if (r != 0) return r;
4443  goto next_class;
4444  }
4445  break;
4446 
4447  case TK_CC_RANGE:
4448  if (state == CCS_VALUE) {
4449  r = fetch_token_in_cc(tok, &p, end, env);
4450  if (r < 0) goto err;
4451  fetched = 1;
4452  if (r == TK_CC_CLOSE) { /* allow [x-] */
4453  range_end_val:
4454  v = (OnigCodePoint )'-';
4455  in_israw = 0;
4456  goto val_entry;
4457  }
4458  else if (r == TK_CC_AND) {
4459  CC_ESC_WARN(env, (UChar* )"-");
4460  goto range_end_val;
4461  }
4462  state = CCS_RANGE;
4463  }
4464  else if (state == CCS_START) {
4465  /* [-xa] is allowed */
4466  v = (OnigCodePoint )tok->u.c;
4467  in_israw = 0;
4468 
4469  r = fetch_token_in_cc(tok, &p, end, env);
4470  if (r < 0) goto err;
4471  fetched = 1;
4472  /* [--x] or [a&&-x] is warned. */
4473  if (r == TK_CC_RANGE || and_start != 0)
4474  CC_ESC_WARN(env, (UChar* )"-");
4475 
4476  goto val_entry;
4477  }
4478  else if (state == CCS_RANGE) {
4479  CC_ESC_WARN(env, (UChar* )"-");
4480  goto sb_char; /* [!--x] is allowed */
4481  }
4482  else { /* CCS_COMPLETE */
4483  r = fetch_token_in_cc(tok, &p, end, env);
4484  if (r < 0) goto err;
4485  fetched = 1;
4486  if (r == TK_CC_CLOSE) goto range_end_val; /* allow [a-b-] */
4487  else if (r == TK_CC_AND) {
4488  CC_ESC_WARN(env, (UChar* )"-");
4489  goto range_end_val;
4490  }
4491 
4493  CC_ESC_WARN(env, (UChar* )"-");
4494  goto range_end_val; /* [0-9-a] is allowed as [0-9\-a] */
4495  }
4497  goto err;
4498  }
4499  break;
4500 
4501  case TK_CC_CC_OPEN: /* [ */
4502  {
4503  Node *anode;
4504  CClassNode* acc;
4505 
4506  r = parse_char_class(&anode, tok, &p, end, env);
4507  if (r == 0) {
4508  acc = NCCLASS(anode);
4509  r = or_cclass(cc, acc, env);
4510  }
4511  onig_node_free(anode);
4512  if (r != 0) goto err;
4513  }
4514  break;
4515 
4516  case TK_CC_AND: /* && */
4517  {
4518  if (state == CCS_VALUE) {
4519  r = next_state_val(cc, &vs, 0, &val_israw, 0, val_type,
4520  &val_type, &state, env);
4521  if (r != 0) goto err;
4522  }
4523  /* initialize local variables */
4524  and_start = 1;
4525  state = CCS_START;
4526 
4527  if (IS_NOT_NULL(prev_cc)) {
4528  r = and_cclass(prev_cc, cc, env);
4529  if (r != 0) goto err;
4530  bbuf_free(cc->mbuf);
4531  }
4532  else {
4533  prev_cc = cc;
4534  cc = &work_cc;
4535  }
4536  initialize_cclass(cc);
4537  }
4538  break;
4539 
4540  case TK_EOT:
4542  goto err;
4543  break;
4544  default:
4545  r = ONIGERR_PARSER_BUG;
4546  goto err;
4547  break;
4548  }
4549 
4550  if (fetched)
4551  r = tok->type;
4552  else {
4553  r = fetch_token_in_cc(tok, &p, end, env);
4554  if (r < 0) goto err;
4555  }
4556  }
4557 
4558  if (state == CCS_VALUE) {
4559  r = next_state_val(cc, &vs, 0, &val_israw, 0, val_type,
4560  &val_type, &state, env);
4561  if (r != 0) goto err;
4562  }
4563 
4564  if (IS_NOT_NULL(prev_cc)) {
4565  r = and_cclass(prev_cc, cc, env);
4566  if (r != 0) goto err;
4567  bbuf_free(cc->mbuf);
4568  cc = prev_cc;
4569  }
4570 
4571  if (neg != 0)
4572  NCCLASS_SET_NOT(cc);
4573  else
4574  NCCLASS_CLEAR_NOT(cc);
4575  if (IS_NCCLASS_NOT(cc) &&
4577  int is_empty;
4578 
4579  is_empty = (IS_NULL(cc->mbuf) ? 1 : 0);
4580  if (is_empty != 0)
4581  BITSET_IS_EMPTY(cc->bs, is_empty);
4582 
4583  if (is_empty == 0) {
4584 #define NEWLINE_CODE 0x0a
4585 
4587  if (ONIGENC_CODE_TO_MBCLEN(env->enc, NEWLINE_CODE) == 1)
4589  else
4591  }
4592  }
4593  }
4594  *src = p;
4595  return 0;
4596 
4597  err:
4598  if (cc != NCCLASS(*np))
4599  bbuf_free(cc->mbuf);
4600  return r;
4601 }
4602 
4603 static int parse_subexp(Node** top, OnigToken* tok, int term,
4604  UChar** src, UChar* end, ScanEnv* env);
4605 
4606 static int
4607 parse_enclose(Node** np, OnigToken* tok, int term, UChar** src, UChar* end,
4608  ScanEnv* env)
4609 {
4610  int r, num;
4611  Node *target;
4612  OnigOptionType option;
4613  OnigCodePoint c;
4614  OnigEncoding enc = env->enc;
4615 
4616 #ifdef USE_NAMED_GROUP
4617  int list_capture;
4618 #endif
4619 
4620  UChar* p = *src;
4621  PFETCH_READY;
4622 
4623  *np = NULL;
4625 
4626  option = env->option;
4627  if (PPEEK_IS('?') &&
4629  PINC;
4630  if (PEND) return ONIGERR_END_PATTERN_IN_GROUP;
4631 
4632  PFETCH(c);
4633  switch (c) {
4634  case ':': /* (?:...) grouping only */
4635  group:
4636  r = fetch_token(tok, &p, end, env);
4637  if (r < 0) return r;
4638  r = parse_subexp(np, tok, term, &p, end, env);
4639  if (r < 0) return r;
4640  *src = p;
4641  return 1; /* group */
4642  break;
4643 
4644  case '=':
4646  break;
4647  case '!': /* preceding read */
4649  break;
4650  case '>': /* (?>...) stop backtrack */
4652  break;
4653 
4654 #ifdef USE_NAMED_GROUP
4655  case '\'':
4657  goto named_group1;
4658  }
4659  else
4661  break;
4662 #endif
4663 
4664  case '<': /* look behind (?<=...), (?<!...) */
4665  PFETCH(c);
4666  if (c == '=')
4668  else if (c == '!')
4670 #ifdef USE_NAMED_GROUP
4671  else {
4673  UChar *name;
4674  UChar *name_end;
4675 
4676  PUNFETCH;
4677  c = '<';
4678 
4679  named_group1:
4680  list_capture = 0;
4681 
4682  named_group2:
4683  name = p;
4684  r = fetch_name((OnigCodePoint )c, &p, end, &name_end, env, &num, 0);
4685  if (r < 0) return r;
4686 
4687  num = scan_env_add_mem_entry(env);
4688  if (num < 0) return num;
4689  if (list_capture != 0 && num >= (int )BIT_STATUS_BITS_NUM)
4691 
4692  r = name_add(env->reg, name, name_end, num, env);
4693  if (r != 0) return r;
4694  *np = node_new_enclose_memory(env->option, 1);
4696  NENCLOSE(*np)->regnum = num;
4697  if (list_capture != 0)
4699  env->num_named++;
4700  }
4701  else {
4703  }
4704  }
4705 #else
4706  else {
4708  }
4709 #endif
4710  break;
4711 
4712  case '@':
4714 #ifdef USE_NAMED_GROUP
4716  PFETCH(c);
4717  if (c == '<' || c == '\'') {
4718  list_capture = 1;
4719  goto named_group2; /* (?@<name>...) */
4720  }
4721  PUNFETCH;
4722  }
4723 #endif
4724  *np = node_new_enclose_memory(env->option, 0);
4726  num = scan_env_add_mem_entry(env);
4727  if (num < 0) {
4728  onig_node_free(*np);
4729  return num;
4730  }
4731  else if (num >= (int )BIT_STATUS_BITS_NUM) {
4732  onig_node_free(*np);
4734  }
4735  NENCLOSE(*np)->regnum = num;
4737  }
4738  else {
4740  }
4741  break;
4742 
4743 #ifdef USE_POSIXLINE_OPTION
4744  case 'p':
4745 #endif
4746  case '-': case 'i': case 'm': case 's': case 'x':
4747  {
4748  int neg = 0;
4749 
4750  while (1) {
4751  switch (c) {
4752  case ':':
4753  case ')':
4754  break;
4755 
4756  case '-': neg = 1; break;
4757  case 'x': ONOFF(option, ONIG_OPTION_EXTEND, neg); break;
4758  case 'i': ONOFF(option, ONIG_OPTION_IGNORECASE, neg); break;
4759  case 's':
4761  ONOFF(option, ONIG_OPTION_MULTILINE, neg);
4762  }
4763  else
4765  break;
4766 
4767  case 'm':
4769  ONOFF(option, ONIG_OPTION_SINGLELINE, (neg == 0 ? 1 : 0));
4770  }
4771  else if (IS_SYNTAX_OP2(env->syntax, ONIG_SYN_OP2_OPTION_RUBY)) {
4772  ONOFF(option, ONIG_OPTION_MULTILINE, neg);
4773  }
4774  else
4776  break;
4777 #ifdef USE_POSIXLINE_OPTION
4778  case 'p':
4780  break;
4781 #endif
4782  default:
4784  }
4785 
4786  if (c == ')') {
4787  *np = node_new_option(option);
4789  *src = p;
4790  return 2; /* option only */
4791  }
4792  else if (c == ':') {
4793  OnigOptionType prev = env->option;
4794 
4795  env->option = option;
4796  r = fetch_token(tok, &p, end, env);
4797  if (r < 0) return r;
4798  r = parse_subexp(&target, tok, term, &p, end, env);
4799  env->option = prev;
4800  if (r < 0) return r;
4801  *np = node_new_option(option);
4803  NENCLOSE(*np)->target = target;
4804  *src = p;
4805  return 0;
4806  }
4807 
4808  if (PEND) return ONIGERR_END_PATTERN_IN_GROUP;
4809  PFETCH(c);
4810  }
4811  }
4812  break;
4813 
4814  default:
4816  }
4817  }
4818  else {
4820  goto group;
4821 
4822  *np = node_new_enclose_memory(env->option, 0);
4824  num = scan_env_add_mem_entry(env);
4825  if (num < 0) return num;
4826  NENCLOSE(*np)->regnum = num;
4827  }
4828 
4830  r = fetch_token(tok, &p, end, env);
4831  if (r < 0) return r;
4832  r = parse_subexp(&target, tok, term, &p, end, env);
4833  if (r < 0) {
4834  onig_node_free(target);
4835  return r;
4836  }
4837 
4838  if (NTYPE(*np) == NT_ANCHOR)
4839  NANCHOR(*np)->target = target;
4840  else {
4841  NENCLOSE(*np)->target = target;
4842  if (NENCLOSE(*np)->type == ENCLOSE_MEMORY) {
4843  /* Don't move this to previous of parse_subexp() */
4844  r = scan_env_set_mem_node(env, NENCLOSE(*np)->regnum, *np);
4845  if (r != 0) return r;
4846  }
4847  }
4848 
4849  *src = p;
4850  return 0;
4851 }
4852 
4853 static const char* const PopularQStr[] = {
4854  "?", "*", "+", "??", "*?", "+?"
4855 };
4856 
4857 static const char* const ReduceQStr[] = {
4858  "", "", "*", "*?", "??", "+ and ??", "+? and ?"
4859 };
4860 
4861 static int
4862 set_quantifier(Node* qnode, Node* target, int group, ScanEnv* env)
4863 {
4864  QtfrNode* qn;
4865 
4866  qn = NQTFR(qnode);
4867  if (qn->lower == 1 && qn->upper == 1) {
4868  return 1;
4869  }
4870 
4871  switch (NTYPE(target)) {
4872  case NT_STR:
4873  if (! group) {
4874  StrNode* sn = NSTR(target);
4875  if (str_node_can_be_split(sn, env->enc)) {
4876  Node* n = str_node_split_last_char(sn, env->enc);
4877  if (IS_NOT_NULL(n)) {
4878  qn->target = n;
4879  return 2;
4880  }
4881  }
4882  }
4883  break;
4884 
4885  case NT_QTFR:
4886  { /* check redundant double repeat. */
4887  /* verbose warn (?:.?)? etc... but not warn (.?)? etc... */
4888  QtfrNode* qnt = NQTFR(target);
4889  int nestq_num = popular_quantifier_num(qn);
4890  int targetq_num = popular_quantifier_num(qnt);
4891 
4892 #ifdef USE_WARNING_REDUNDANT_NESTED_REPEAT_OPERATOR
4895  UChar buf[WARN_BUFSIZE];
4896 
4897  switch(ReduceTypeTable[targetq_num][nestq_num]) {
4898  case RQ_ASIS:
4899  break;
4900 
4901  case RQ_DEL:
4902  if (onig_verb_warn != onig_null_warn) {
4904  env->pattern, env->pattern_end,
4905  (UChar* )"redundant nested repeat operator");
4906  (*onig_verb_warn)((char* )buf);
4907  }
4908  goto warn_exit;
4909  break;
4910 
4911  default:
4912  if (onig_verb_warn != onig_null_warn) {
4914  env->pattern, env->pattern_end,
4915  (UChar* )"nested repeat operator %s and %s was replaced with '%s'",
4916  PopularQStr[targetq_num], PopularQStr[nestq_num],
4917  ReduceQStr[ReduceTypeTable[targetq_num][nestq_num]]);
4918  (*onig_verb_warn)((char* )buf);
4919  }
4920  goto warn_exit;
4921  break;
4922  }
4923  }
4924 
4925  warn_exit:
4926 #endif
4927  if (targetq_num >= 0) {
4928  if (nestq_num >= 0) {
4929  onig_reduce_nested_quantifier(qnode, target);
4930  goto q_exit;
4931  }
4932  else if (targetq_num == 1 || targetq_num == 2) { /* * or + */
4933  /* (?:a*){n,m}, (?:a+){n,m} => (?:a*){n,n}, (?:a+){n,n} */
4934  if (! IS_REPEAT_INFINITE(qn->upper) && qn->upper > 1 && qn->greedy) {
4935  qn->upper = (qn->lower == 0 ? 1 : qn->lower);
4936  }
4937  }
4938  }
4939  }
4940  break;
4941 
4942  default:
4943  break;
4944  }
4945 
4946  qn->target = target;
4947  q_exit:
4948  return 0;
4949 }
4950 
4951 
4952 #ifdef USE_SHARED_CCLASS_TABLE
4953 
4954 #define THRESHOLD_RANGE_NUM_FOR_SHARE_CCLASS 8
4955 
4956 /* for ctype node hash table */
4957 
4958 typedef struct {
4960  int not;
4961  int type;
4962 } type_cclass_key;
4963 
4965 {
4966  if (x->type != y->type) return 1;
4967  if (x->enc != y->enc) return 1;
4968  if (x->not != y->not) return 1;
4969  return 0;
4970 }
4971 
4973 {
4974  int i, val;
4975  UChar *p;
4976 
4977  val = 0;
4978 
4979  p = (UChar* )&(key->enc);
4980  for (i = 0; i < (int )sizeof(key->enc); i++) {
4981  val = val * 997 + (int )*p++;
4982  }
4983 
4984  p = (UChar* )(&key->type);
4985  for (i = 0; i < (int )sizeof(key->type); i++) {
4986  val = val * 997 + (int )*p++;
4987  }
4988 
4989  val += key->not;
4990  return val + (val >> 5);
4991 }
4992 
4993 static const struct st_hash_type type_type_cclass_hash = {
4996 };
4997 
4999 
5000 
5001 static int
5002 i_free_shared_class(type_cclass_key* key, Node* node, void* arg ARG_UNUSED)
5003 {
5004  if (IS_NOT_NULL(node)) {
5005  CClassNode* cc = NCCLASS(node);
5006  if (IS_NOT_NULL(cc->mbuf)) xfree(cc->mbuf);
5007  xfree(node);
5008  }
5009 
5010  if (IS_NOT_NULL(key)) xfree(key);
5011  return ST_DELETE;
5012 }
5013 
5014 extern int
5016 {
5018  if (IS_NOT_NULL(OnigTypeCClassTable)) {
5019  onig_st_foreach(OnigTypeCClassTable, i_free_shared_class, 0);
5020  onig_st_free_table(OnigTypeCClassTable);
5021  OnigTypeCClassTable = NULL;
5022  }
5024 
5025  return 0;
5026 }
5027 
5028 #endif /* USE_SHARED_CCLASS_TABLE */
5029 
5030 
5031 #ifndef CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
5032 static int
5033 clear_not_flag_cclass(CClassNode* cc, OnigEncoding enc)
5034 {
5035  BBuf *tbuf;
5036  int r;
5037 
5038  if (IS_NCCLASS_NOT(cc)) {
5039  bitset_invert(cc->bs);
5040 
5041  if (! ONIGENC_IS_SINGLEBYTE(enc)) {
5042  r = not_code_range_buf(enc, cc->mbuf, &tbuf);
5043  if (r != 0) return r;
5044 
5045  bbuf_free(cc->mbuf);
5046  cc->mbuf = tbuf;
5047  }
5048 
5049  NCCLASS_CLEAR_NOT(cc);
5050  }
5051 
5052  return 0;
5053 }
5054 #endif /* CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS */
5055 
5056 typedef struct {
5062 
5063 static int
5065  int to_len, void* arg)
5066 {
5067  IApplyCaseFoldArg* iarg;
5068  ScanEnv* env;
5069  CClassNode* cc;
5070  BitSetRef bs;
5071 
5072  iarg = (IApplyCaseFoldArg* )arg;
5073  env = iarg->env;
5074  cc = iarg->cc;
5075  bs = cc->bs;
5076 
5077  if (to_len == 1) {
5078  int is_in = onig_is_code_in_cc(env->enc, from, cc);
5079 #ifdef CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS
5080  if ((is_in != 0 && !IS_NCCLASS_NOT(cc)) ||
5081  (is_in == 0 && IS_NCCLASS_NOT(cc))) {
5082  if (ONIGENC_MBC_MINLEN(env->enc) > 1 || *to >= SINGLE_BYTE_SIZE) {
5083  add_code_range0(&(cc->mbuf), env, *to, *to, 0);
5084  }
5085  else {
5086  BITSET_SET_BIT(bs, *to);
5087  }
5088  }
5089 #else
5090  if (is_in != 0) {
5091  if (ONIGENC_MBC_MINLEN(env->enc) > 1 || *to >= SINGLE_BYTE_SIZE) {
5092  if (IS_NCCLASS_NOT(cc)) clear_not_flag_cclass(cc, env->enc);
5093  add_code_range0(&(cc->mbuf), env, *to, *to, 0);
5094  }
5095  else {
5096  if (IS_NCCLASS_NOT(cc)) {
5097  BITSET_CLEAR_BIT(bs, *to);
5098  }
5099  else
5100  BITSET_SET_BIT(bs, *to);
5101  }
5102  }
5103 #endif /* CASE_FOLD_IS_APPLIED_INSIDE_NEGATIVE_CCLASS */
5104  }
5105  else {
5106  int r, i, len;
5108  Node *snode = NULL_NODE;
5109 
5110  if (onig_is_code_in_cc(env->enc, from, cc)
5112  && !IS_NCCLASS_NOT(cc)
5113 #endif
5114  ) {
5115  for (i = 0; i < to_len; i++) {
5116  len = ONIGENC_CODE_TO_MBC(env->enc, to[i], buf);
5117  if (i == 0) {
5118  snode = onig_node_new_str(buf, buf + len);
5119  CHECK_NULL_RETURN_MEMERR(snode);
5120 
5121  /* char-class expanded multi-char only
5122  compare with string folded at match time. */
5123  NSTRING_SET_AMBIG(snode);
5124  }
5125  else {
5126  r = onig_node_str_cat(snode, buf, buf + len);
5127  if (r < 0) {
5128  onig_node_free(snode);
5129  return r;
5130  }
5131  }
5132  }
5133 
5134  *(iarg->ptail) = onig_node_new_alt(snode, NULL_NODE);
5135  CHECK_NULL_RETURN_MEMERR(*(iarg->ptail));
5136  iarg->ptail = &(NCDR((*(iarg->ptail))));
5137  }
5138  }
5139 
5140  return 0;
5141 }
5142 
5143 static int
5144 parse_exp(Node** np, OnigToken* tok, int term,
5145  UChar** src, UChar* end, ScanEnv* env)
5146 {
5147  int r, len, group = 0;
5148  Node* qn;
5149  Node** targetp;
5150 
5151  *np = NULL;
5152  if (tok->type == (enum TokenSyms )term)
5153  goto end_of_token;
5154 
5155  switch (tok->type) {
5156  case TK_ALT:
5157  case TK_EOT:
5158  end_of_token:
5159  *np = node_new_empty();
5160  return tok->type;
5161 
5162  case TK_SUBEXP_OPEN:
5163  r = parse_enclose(np, tok, TK_SUBEXP_CLOSE, src, end, env);
5164  if (r < 0) return r;
5165  if (r == 1) group = 1;
5166  else if (r == 2) { /* option only */
5167  Node* target;
5168  OnigOptionType prev = env->option;
5169 
5170  env->option = NENCLOSE(*np)->option;
5171  r = fetch_token(tok, src, end, env);
5172  if (r < 0) return r;
5173  r = parse_subexp(&target, tok, term, src, end, env);
5174  env->option = prev;
5175  if (r < 0) {
5176  onig_node_free(target);
5177  return r;
5178  }
5179  NENCLOSE(*np)->target = target;
5180  return tok->type;
5181  }
5182  break;
5183 
5184  case TK_SUBEXP_CLOSE:
5187 
5188  if (tok->escaped) goto tk_raw_byte;
5189  else goto tk_byte;
5190  break;
5191 
5192  case TK_STRING:
5193  tk_byte:
5194  {
5195  *np = node_new_str(tok->backp, *src);
5197 
5198  while (1) {
5199  r = fetch_token(tok, src, end, env);
5200  if (r < 0) return r;
5201  if (r != TK_STRING) break;
5202 
5203  r = onig_node_str_cat(*np, tok->backp, *src);
5204  if (r < 0) return r;
5205  }
5206 
5207  string_end:
5208  targetp = np;
5209  goto repeat;
5210  }
5211  break;
5212 
5213  case TK_RAW_BYTE:
5214  tk_raw_byte:
5215  {
5216  *np = node_new_str_raw_char((UChar )tok->u.c);
5218  len = 1;
5219  while (1) {
5220  if (len >= ONIGENC_MBC_MINLEN(env->enc)) {
5221  if (len == enclen(env->enc, NSTR(*np)->s, NSTR(*np)->end)) {
5222  r = fetch_token(tok, src, end, env);
5223  NSTRING_CLEAR_RAW(*np);
5224  goto string_end;
5225  }
5226  }
5227 
5228  r = fetch_token(tok, src, end, env);
5229  if (r < 0) return r;
5230  if (r != TK_RAW_BYTE) {
5231  /* Don't use this, it is wrong for little endian encodings. */
5232 #ifdef USE_PAD_TO_SHORT_BYTE_CHAR
5233  int rem;
5234  if (len < ONIGENC_MBC_MINLEN(env->enc)) {
5235  rem = ONIGENC_MBC_MINLEN(env->enc) - len;
5236  (void )node_str_head_pad(NSTR(*np), rem, (UChar )0);
5237  if (len + rem == enclen(env->enc, NSTR(*np)->s)) {
5238  NSTRING_CLEAR_RAW(*np);
5239  goto string_end;
5240  }
5241  }
5242 #endif
5244  }
5245 
5246  r = node_str_cat_char(*np, (UChar )tok->u.c);
5247  if (r < 0) return r;
5248 
5249  len++;
5250  }
5251  }
5252  break;
5253 
5254  case TK_CODE_POINT:
5255  {
5257  int num = ONIGENC_CODE_TO_MBC(env->enc, tok->u.code, buf);
5258  if (num < 0) return num;
5259 #ifdef NUMBERED_CHAR_IS_NOT_CASE_AMBIG
5260  *np = node_new_str_raw(buf, buf + num);
5261 #else
5262  *np = node_new_str(buf, buf + num);
5263 #endif
5265  }
5266  break;
5267 
5268  case TK_QUOTE_OPEN:
5269  {
5270  OnigCodePoint end_op[2];
5271  UChar *qstart, *qend, *nextp;
5272 
5273  end_op[0] = (OnigCodePoint )MC_ESC(env->syntax);
5274  end_op[1] = (OnigCodePoint )'E';
5275  qstart = *src;
5276  qend = find_str_position(end_op, 2, qstart, end, &nextp, env->enc);
5277  if (IS_NULL(qend)) {
5278  nextp = qend = end;
5279  }
5280  *np = node_new_str(qstart, qend);
5282  *src = nextp;
5283  }
5284  break;
5285 
5286  case TK_CHAR_TYPE:
5287  {
5288  switch (tok->u.prop.ctype) {
5289  case ONIGENC_CTYPE_D:
5290  case ONIGENC_CTYPE_S:
5291  case ONIGENC_CTYPE_W:
5292  {
5293  CClassNode* cc;
5294  *np = node_new_cclass();
5296  cc = NCCLASS(*np);
5297  add_ctype_to_cc(cc, tok->u.prop.ctype, 0, env);
5298  if (tok->u.prop.not != 0) NCCLASS_SET_NOT(cc);
5299  }
5300  break;
5301 
5302  case ONIGENC_CTYPE_WORD:
5303  *np = node_new_ctype(tok->u.prop.ctype, tok->u.prop.not);
5305  break;
5306 
5307  case ONIGENC_CTYPE_SPACE:
5308  case ONIGENC_CTYPE_DIGIT:
5309  case ONIGENC_CTYPE_XDIGIT:
5310  {
5311  CClassNode* cc;
5312 
5313 #ifdef USE_SHARED_CCLASS_TABLE
5314  const OnigCodePoint *mbr;
5315  OnigCodePoint sb_out;
5316 
5317  r = ONIGENC_GET_CTYPE_CODE_RANGE(env->enc, tok->u.prop.ctype,
5318  &sb_out, &mbr);
5319  if (r == 0 &&
5323  type_cclass_key* new_key;
5324 
5325  key.enc = env->enc;
5326  key.not = tok->u.prop.not;
5327  key.type = tok->u.prop.ctype;
5328 
5330 
5331  if (IS_NULL(OnigTypeCClassTable)) {
5332  OnigTypeCClassTable
5333  = onig_st_init_table_with_size(&type_type_cclass_hash, 10);
5334  if (IS_NULL(OnigTypeCClassTable)) {
5336  return ONIGERR_MEMORY;
5337  }
5338  }
5339  else {
5340  if (onig_st_lookup(OnigTypeCClassTable, (st_data_t )&key,
5341  (st_data_t* )np)) {
5343  break;
5344  }
5345  }
5346 
5347  *np = node_new_cclass_by_codepoint_range(tok->u.prop.not,
5348  sb_out, mbr);
5349  if (IS_NULL(*np)) {
5351  return ONIGERR_MEMORY;
5352  }
5353 
5354  cc = NCCLASS(*np);
5355  NCCLASS_SET_SHARE(cc);
5356  new_key = (type_cclass_key* )xmalloc(sizeof(type_cclass_key));
5357  xmemcpy(new_key, &key, sizeof(type_cclass_key));
5358  onig_st_add_direct(OnigTypeCClassTable, (st_data_t )new_key,
5359  (st_data_t )*np);
5360 
5362  }
5363  else {
5364 #endif
5365  *np = node_new_cclass();
5367  cc = NCCLASS(*np);
5368  add_ctype_to_cc(cc, tok->u.prop.ctype, 0, env);
5369  if (tok->u.prop.not != 0) NCCLASS_SET_NOT(cc);
5370 #ifdef USE_SHARED_CCLASS_TABLE
5371  }
5372 #endif
5373  }
5374  break;
5375 
5376  default:
5377  return ONIGERR_PARSER_BUG;
5378  break;
5379  }
5380  }
5381  break;
5382 
5383  case TK_CHAR_PROPERTY:
5384  r = parse_char_property(np, tok, src, end, env);
5385  if (r != 0) return r;
5386  break;
5387 
5388  case TK_CC_OPEN:
5389  {
5390  CClassNode* cc;
5391 
5392  r = parse_char_class(np, tok, src, end, env);
5393  if (r != 0) return r;
5394 
5395  cc = NCCLASS(*np);
5396  if (IS_IGNORECASE(env->option)) {
5397  IApplyCaseFoldArg iarg;
5398 
5399  iarg.env = env;
5400  iarg.cc = cc;
5401  iarg.alt_root = NULL_NODE;
5402  iarg.ptail = &(iarg.alt_root);
5403 
5405  i_apply_case_fold, &iarg);
5406  if (r != 0) {
5407  onig_node_free(iarg.alt_root);
5408  return r;
5409  }
5410  if (IS_NOT_NULL(iarg.alt_root)) {
5411  Node* work = onig_node_new_alt(*np, iarg.alt_root);
5412  if (IS_NULL(work)) {
5413  onig_node_free(iarg.alt_root);
5414  return ONIGERR_MEMORY;
5415  }
5416  *np = work;
5417  }
5418  }
5419  }
5420  break;
5421 
5422  case TK_ANYCHAR:
5423  *np = node_new_anychar();
5425  break;
5426 
5427  case TK_ANYCHAR_ANYTIME:
5428  *np = node_new_anychar();
5432  NQTFR(qn)->target = *np;
5433  *np = qn;
5434  break;
5435 
5436  case TK_BACKREF:
5437  len = tok->u.backref.num;
5438  *np = node_new_backref(len,
5439  (len > 1 ? tok->u.backref.refs : &(tok->u.backref.ref1)),
5440  tok->u.backref.by_name,
5442  tok->u.backref.exist_level,
5443  tok->u.backref.level,
5444 #endif
5445  env);
5447  break;
5448 
5449 #ifdef USE_SUBEXP_CALL
5450  case TK_CALL:
5451  {
5452  int gnum = tok->u.call.gnum;
5453 
5454  if (gnum < 0) {
5455  gnum = BACKREF_REL_TO_ABS(gnum, env);
5456  if (gnum <= 0)
5457  return ONIGERR_INVALID_BACKREF;
5458  }
5459  *np = node_new_call(tok->u.call.name, tok->u.call.name_end, gnum);
5461  env->num_call++;
5462  }
5463  break;
5464 #endif
5465 
5466  case TK_ANCHOR:
5467  *np = onig_node_new_anchor(tok->u.anchor);
5468  break;
5469 
5470  case TK_OP_REPEAT:
5471  case TK_INTERVAL:
5472  if (IS_SYNTAX_BV(env->syntax, ONIG_SYN_CONTEXT_INDEP_REPEAT_OPS)) {
5475  else
5476  *np = node_new_empty();
5477  }
5478  else {
5479  goto tk_byte;
5480  }
5481  break;
5482 
5483  default:
5484  return ONIGERR_PARSER_BUG;
5485  break;
5486  }
5487 
5488  {
5489  targetp = np;
5490 
5491  re_entry:
5492  r = fetch_token(tok, src, end, env);
5493  if (r < 0) return r;
5494 
5495  repeat:
5496  if (r == TK_OP_REPEAT || r == TK_INTERVAL) {
5497  if (is_invalid_quantifier_target(*targetp))
5499 
5500  qn = node_new_quantifier(tok->u.repeat.lower, tok->u.repeat.upper,
5501  (r == TK_INTERVAL ? 1 : 0));
5503  NQTFR(qn)->greedy = tok->u.repeat.greedy;
5504  r = set_quantifier(qn, *targetp, group, env);
5505  if (r < 0) {
5506  onig_node_free(qn);
5507  return r;
5508  }
5509 
5510  if (tok->u.repeat.possessive != 0) {
5511  Node* en;
5513  if (IS_NULL(en)) {
5514  onig_node_free(qn);
5515  return ONIGERR_MEMORY;
5516  }
5517  NENCLOSE(en)->target = qn;
5518  qn = en;
5519  }
5520 
5521  if (r == 0) {
5522  *targetp = qn;
5523  }
5524  else if (r == 1) {
5525  onig_node_free(qn);
5526  }
5527  else if (r == 2) { /* split case: /abc+/ */
5528  Node *tmp;
5529 
5530  *targetp = node_new_list(*targetp, NULL);
5531  if (IS_NULL(*targetp)) {
5532  onig_node_free(qn);
5533  return ONIGERR_MEMORY;
5534  }
5535  tmp = NCDR(*targetp) = node_new_list(qn, NULL);
5536  if (IS_NULL(tmp)) {
5537  onig_node_free(qn);
5538  return ONIGERR_MEMORY;
5539  }
5540  targetp = &(NCAR(tmp));
5541  }
5542  goto re_entry;
5543  }
5544  }
5545 
5546  return r;
5547 }
5548 
5549 static int
5551  UChar** src, UChar* end, ScanEnv* env)
5552 {
5553  int r;
5554  Node *node, **headp;
5555 
5556  *top = NULL;
5557  r = parse_exp(&node, tok, term, src, end, env);
5558  if (r < 0) {
5559  onig_node_free(node);
5560  return r;
5561  }
5562 
5563  if (r == TK_EOT || r == term || r == TK_ALT) {
5564  *top = node;
5565  }
5566  else {
5567  *top = node_new_list(node, NULL);
5568  headp = &(NCDR(*top));
5569  while (r != TK_EOT && r != term && r != TK_ALT) {
5570  r = parse_exp(&node, tok, term, src, end, env);
5571  if (r < 0) {
5572  onig_node_free(node);
5573  return r;
5574  }
5575 
5576  if (NTYPE(node) == NT_LIST) {
5577  *headp = node;
5578  while (IS_NOT_NULL(NCDR(node))) node = NCDR(node);
5579  headp = &(NCDR(node));
5580  }
5581  else {
5582  *headp = node_new_list(node, NULL);
5583  headp = &(NCDR(*headp));
5584  }
5585  }
5586  }
5587 
5588  return r;
5589 }
5590 
5591 /* term_tok: TK_EOT or TK_SUBEXP_CLOSE */
5592 static int
5594  UChar** src, UChar* end, ScanEnv* env)
5595 {
5596  int r;
5597  Node *node, **headp;
5598 
5599  *top = NULL;
5600  r = parse_branch(&node, tok, term, src, end, env);
5601  if (r < 0) {
5602  onig_node_free(node);
5603  return r;
5604  }
5605 
5606  if (r == term) {
5607  *top = node;
5608  }
5609  else if (r == TK_ALT) {
5610  *top = onig_node_new_alt(node, NULL);
5611  headp = &(NCDR(*top));
5612  while (r == TK_ALT) {
5613  r = fetch_token(tok, src, end, env);
5614  if (r < 0) return r;
5615  r = parse_branch(&node, tok, term, src, end, env);
5616  if (r < 0) {
5617  onig_node_free(node);
5618  return r;
5619  }
5620 
5621  *headp = onig_node_new_alt(node, NULL);
5622  headp = &(NCDR(*headp));
5623  }
5624 
5625  if (tok->type != (enum TokenSyms )term)
5626  goto err;
5627  }
5628  else {
5629  onig_node_free(node);
5630  err:
5631  if (term == TK_SUBEXP_CLOSE)
5633  else
5634  return ONIGERR_PARSER_BUG;
5635  }
5636 
5637  return r;
5638 }
5639 
5640 static int
5641 parse_regexp(Node** top, UChar** src, UChar* end, ScanEnv* env)
5642 {
5643  int r;
5644  OnigToken tok;
5645 
5646  r = fetch_token(&tok, src, end, env);
5647  if (r < 0) return r;
5648  r = parse_subexp(top, &tok, TK_EOT, src, end, env);
5649  if (r < 0) return r;
5650  return 0;
5651 }
5652 
5653 extern int
5654 onig_parse_make_tree(Node** root, const UChar* pattern, const UChar* end,
5655  regex_t* reg, ScanEnv* env)
5656 {
5657  int r;
5658  UChar* p;
5659 
5660 #ifdef USE_NAMED_GROUP
5661  names_clear(reg);
5662 #endif
5663 
5664  scan_env_clear(env);
5665  env->option = reg->options;
5666  env->case_fold_flag = reg->case_fold_flag;
5667  env->enc = reg->enc;
5668  env->syntax = reg->syntax;
5669  env->pattern = (UChar* )pattern;
5670  env->pattern_end = (UChar* )end;
5671  env->reg = reg;
5672 
5673  *root = NULL;
5674  p = (UChar* )pattern;
5675  r = parse_regexp(root, &p, (UChar* )end, env);
5676  reg->num_mem = env->num_mem;
5677  return r;
5678 }
5679 
5680 extern void
5681 onig_scan_env_set_error_string(ScanEnv* env, int ecode ARG_UNUSED,
5682  UChar* arg, UChar* arg_end)
5683 {
5684  env->error = arg;
5685  env->error_end = arg_end;
5686 }
5687