Ruby: regint.h Source File

Ruby 4.0.6p0 (2026-07-14 revision 03b6d3f8898a28604fe6cb00eae3226b821168f4)

regint.h
1#ifndef ONIGMO_REGINT_H
2#define ONIGMO_REGINT_H
3/**********************************************************************
4 regint.h - Onigmo (Oniguruma-mod) (regular expression library)
5**********************************************************************/
6/*-
7 * Copyright (c) 2002-2013 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
8 * Copyright (c) 2011-2016 K.Takata <kentkt AT csc DOT jp>
9 * All rights reserved.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 */
32
33/* for debug */
34/* #define ONIG_DEBUG_PARSE_TREE */
35/* #define ONIG_DEBUG_COMPILE */
36/* #define ONIG_DEBUG_SEARCH */
37/* #define ONIG_DEBUG_MATCH */
38/* #define ONIG_DEBUG_MATCH_CACHE */
39/* #define ONIG_DEBUG_MEMLEAK */
40/* #define ONIG_DONT_OPTIMIZE */
41
42/* for byte-code statistical data. */
43/* #define ONIG_DEBUG_STATISTICS */
44
45/* enable the match optimization by using a cache. */
46#define USE_MATCH_CACHE
47
48#if defined(ONIG_DEBUG_PARSE_TREE) || defined(ONIG_DEBUG_MATCH) || \
49 defined(ONIG_DEBUG_SEARCH) || defined(ONIG_DEBUG_COMPILE) || \
50 defined(ONIG_DEBUG_STATISTICS) || defined(ONIG_DEBUG_MEMLEAK)
51# ifndef ONIG_DEBUG
52# define ONIG_DEBUG
53# endif
54#endif
55
56/* __POWERPC__ added to accommodate Darwin case. */
57#ifndef UNALIGNED_WORD_ACCESS
58# if defined(__i386) || defined(__i386__) || defined(_M_IX86) || \
59 defined(__x86_64) || defined(__x86_64__) || defined(_M_AMD64) || \
60 defined(__powerpc64__) || defined(__POWERPC__) || defined(__aarch64__) || \
61 defined(__mc68020__)
62# define UNALIGNED_WORD_ACCESS 1
63# else
64# define UNALIGNED_WORD_ACCESS 0
65# endif
66#endif
67
68#if UNALIGNED_WORD_ACCESS
69# define PLATFORM_UNALIGNED_WORD_ACCESS
70#endif
71
72/* config */
73/* spec. config */
74#define USE_NAMED_GROUP
75#define USE_SUBEXP_CALL
76#define USE_PERL_SUBEXP_CALL
77#define USE_CAPITAL_P_NAMED_GROUP
78#define USE_BACKREF_WITH_LEVEL /* \k<name+n>, \k<name-n> */
79#define USE_MONOMANIAC_CHECK_CAPTURES_IN_ENDLESS_REPEAT /* /(?:()|())*\2/ */
80#define USE_NEWLINE_AT_END_OF_STRING_HAS_EMPTY_LINE /* /\n$/ =~ "\n" */
81#define USE_WARNING_REDUNDANT_NESTED_REPEAT_OPERATOR
82/* !!! moved to regenc.h. */ /* #define USE_CRNL_AS_LINE_TERMINATOR */
83#define USE_NO_INVALID_QUANTIFIER
84
85/* internal config */
86/* #define USE_OP_PUSH_OR_JUMP_EXACT */
87#define USE_QTFR_PEEK_NEXT
88#define USE_ST_LIBRARY
89
90#define INIT_MATCH_STACK_SIZE 160
91#define DEFAULT_MATCH_STACK_LIMIT_SIZE 0 /* unlimited */
92#define DEFAULT_PARSE_DEPTH_LIMIT 4096
93
94#define OPT_EXACT_MAXLEN 24
95
96/* check config */
97#if defined(USE_PERL_SUBEXP_CALL) || defined(USE_CAPITAL_P_NAMED_GROUP)
98# if !defined(USE_NAMED_GROUP) || !defined(USE_SUBEXP_CALL)
99# error USE_NAMED_GROUP and USE_SUBEXP_CALL must be defined.
100# endif
101#endif
102
103#if defined(__GNUC__)
104# define ARG_UNUSED __attribute__ ((unused))
105#else
106# define ARG_UNUSED
107#endif
108
109#if !defined(RUBY) && defined(RUBY_EXPORT)
110# define RUBY
111#endif
112#ifdef RUBY
113# ifndef RUBY_DEFINES_H
114# include "ruby/ruby.h"
115# undef xmalloc
116# undef xrealloc
117# undef xcalloc
118# undef xfree
119# endif
120#else /* RUBY */
121# include "config.h"
122# if SIZEOF_LONG_LONG > 0
123# define LONG_LONG long long
124# endif
125#endif /* RUBY */
126
127#include <stdarg.h>
128
129/* */
130/* escape other system UChar definition */
131#ifdef ONIG_ESCAPE_UCHAR_COLLISION
132# undef ONIG_ESCAPE_UCHAR_COLLISION
133#endif
134
135#define USE_WORD_BEGIN_END /* "<": word-begin, ">": word-end */
136#ifdef RUBY
137# undef USE_CAPTURE_HISTORY
138#else
139# define USE_CAPTURE_HISTORY
140#endif
141#define USE_VARIABLE_META_CHARS
142#define USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
143/* #define USE_COMBINATION_EXPLOSION_CHECK */ /* (X*)* */
144
145
146#ifndef xmalloc
147# define xmalloc malloc
148# define xrealloc realloc
149# define xcalloc calloc
150# define xfree free
151#endif
152
153#ifdef RUBY
154
155# define CHECK_INTERRUPT_IN_MATCH_AT do { \
156 msa->counter++; \
157 if (msa->counter >= 128) { \
158 msa->counter = 0; \
159 if (rb_reg_timeout_p(reg, &msa->end_time)) { \
160 goto timeout; \
161 } \
162 rb_thread_check_ints(); \
163 } \
164} while(0)
165# define onig_st_init_table st_init_table
166# define onig_st_init_table_with_size st_init_table_with_size
167# define onig_st_init_numtable st_init_numtable
168# define onig_st_init_numtable_with_size st_init_numtable_with_size
169# define onig_st_init_strtable st_init_strtable
170# define onig_st_init_strtable_with_size st_init_strtable_with_size
171# define onig_st_delete st_delete
172# define onig_st_delete_safe st_delete_safe
173# define onig_st_insert st_insert
174# define onig_st_lookup st_lookup
175# define onig_st_foreach st_foreach
176# define onig_st_add_direct st_add_direct
177# define onig_st_free_table st_free_table
178# define onig_st_cleanup_safe st_cleanup_safe
179# define onig_st_copy st_copy
180# define onig_st_nothing_key_clone st_nothing_key_clone
181# define onig_st_nothing_key_free st_nothing_key_free
182# define onig_st_is_member st_is_member
183
184# define USE_UPPER_CASE_TABLE
185#else /* RUBY */
186
187# define CHECK_INTERRUPT_IN_MATCH_AT
188
189# define st_init_table onig_st_init_table
190# define st_init_table_with_size onig_st_init_table_with_size
191# define st_init_numtable onig_st_init_numtable
192# define st_init_numtable_with_size onig_st_init_numtable_with_size
193# define st_init_strtable onig_st_init_strtable
194# define st_init_strtable_with_size onig_st_init_strtable_with_size
195# define st_delete onig_st_delete
196# define st_delete_safe onig_st_delete_safe
197# define st_insert onig_st_insert
198# define st_lookup onig_st_lookup
199# define st_foreach onig_st_foreach
200# define st_add_direct onig_st_add_direct
201# define st_free_table onig_st_free_table
202# define st_cleanup_safe onig_st_cleanup_safe
203# define st_copy onig_st_copy
204# define st_nothing_key_clone onig_st_nothing_key_clone
205# define st_nothing_key_free onig_st_nothing_key_free
206/* */
207# define onig_st_is_member st_is_member
208
209#endif /* RUBY */
210
211#define STATE_CHECK_STRING_THRESHOLD_LEN 7
212#define STATE_CHECK_BUFF_MAX_SIZE 0x4000
213
214#define xmemset memset
215#define xmemcpy memcpy
216#define xmemmove memmove
217
218#if defined(_WIN32) && !defined(__GNUC__)
219# define xalloca _alloca
220# define xvsnprintf(buf,size,fmt,args) _vsnprintf_s(buf,size,_TRUNCATE,fmt,args)
221# define xsnprintf sprintf_s
222# define xstrcat(dest,src,size) strcat_s(dest,size,src)
223#else
224# define xalloca alloca
225# define xvsnprintf vsnprintf
226# define xsnprintf snprintf
227# define xstrcat(dest,src,size) strcat(dest,src)
228#endif
229
230#if defined(ONIG_DEBUG_MEMLEAK) && defined(_MSC_VER)
231# define _CRTDBG_MAP_ALLOC
232# include <malloc.h>
233# include <crtdbg.h>
234#endif
235
236#include <stdlib.h>
237
238#if defined(HAVE_ALLOCA_H) && (defined(_AIX) || !defined(__GNUC__))
239# include <alloca.h>
240#endif
241
242#include <string.h>
243
244#include <ctype.h>
245#ifdef HAVE_SYS_TYPES_H
246# include <sys/types.h>
247#endif
248
249#ifdef HAVE_STDINT_H
250# include <stdint.h>
251#endif
252
253#ifdef HAVE_INTTYPES_H
254# include <inttypes.h>
255#endif
256
257#include <stddef.h>
258
259#ifdef _WIN32
260# include <malloc.h> /* for alloca() */
261#endif
262
263#ifdef ONIG_DEBUG
264# include <stdio.h>
265#endif
266
267#ifndef PRIdPTR
268# ifdef _WIN64
269# define PRIdPTR "I64d"
270# define PRIuPTR "I64u"
271# define PRIxPTR "I64x"
272# else
273# define PRIdPTR "ld"
274# define PRIuPTR "lu"
275# define PRIxPTR "lx"
276# endif
277#endif
278
279#ifndef PRIdPTRDIFF
280# define PRIdPTRDIFF PRIdPTR
281#endif
282
283#include "regenc.h"
284
285RUBY_SYMBOL_EXPORT_BEGIN
286
287#ifdef MIN
288# undef MIN
289#endif
290#ifdef MAX
291# undef MAX
292#endif
293#define MIN(a,b) (((a)>(b))?(b):(a))
294#define MAX(a,b) (((a)<(b))?(b):(a))
295
296#define IS_NULL(p) (((void*)(p)) == (void*)0)
297#define IS_NOT_NULL(p) (((void*)(p)) != (void*)0)
298#define CHECK_NULL_RETURN(p) if (IS_NULL(p)) return NULL
299#define CHECK_NULL_RETURN_MEMERR(p) if (IS_NULL(p)) return ONIGERR_MEMORY
300#define NULL_UCHARP ((UChar* )0)
301
302#define ONIG_LAST_CODE_POINT (~((OnigCodePoint )0))
303
304#define PLATFORM_GET_INC_ARGUMENTS_ASSERT(val, type) \
305 ((void)sizeof(char[2 * (sizeof(val) == sizeof(type)) - 1]))
306
307#ifdef PLATFORM_UNALIGNED_WORD_ACCESS
308
309# define PLATFORM_GET_INC(val,p,type) do{\
310 PLATFORM_GET_INC_ARGUMENTS_ASSERT(val, type);\
311 val = *(type* )p;\
312 (p) += sizeof(type);\
313} while(0)
314
315#else
316
317# define PLATFORM_GET_INC(val,p,type) do{\
318 PLATFORM_GET_INC_ARGUMENTS_ASSERT(val, type);\
319 type platform_get_value;\
320 xmemcpy(&platform_get_value, (p), sizeof(type));\
321 val = platform_get_value;\
322 (p) += sizeof(type);\
323} while(0)
324
325/* sizeof(OnigCodePoint) */
326# define WORD_ALIGNMENT_SIZE SIZEOF_LONG
327
328# define GET_ALIGNMENT_PAD_SIZE(addr,pad_size) do {\
329 (pad_size) = WORD_ALIGNMENT_SIZE \
330 - ((uintptr_t )(addr) % WORD_ALIGNMENT_SIZE);\
331 if ((pad_size) == WORD_ALIGNMENT_SIZE) (pad_size) = 0;\
332} while (0)
333
334# define ALIGNMENT_RIGHT(addr) do {\
335 (addr) += (WORD_ALIGNMENT_SIZE - 1);\
336 (addr) -= ((uintptr_t )(addr) % WORD_ALIGNMENT_SIZE);\
337} while (0)
338
339#endif /* PLATFORM_UNALIGNED_WORD_ACCESS */
340
341/* stack pop level */
342#define STACK_POP_LEVEL_FREE 0
343#define STACK_POP_LEVEL_MEM_START 1
344#define STACK_POP_LEVEL_ALL 2
345
346/* optimize flags */
347#define ONIG_OPTIMIZE_NONE 0
348#define ONIG_OPTIMIZE_EXACT 1 /* Slow Search */
349#define ONIG_OPTIMIZE_EXACT_BM 2 /* Boyer Moore Search */
350#define ONIG_OPTIMIZE_EXACT_BM_NOT_REV 3 /* BM (applied to a multibyte string) */
351#define ONIG_OPTIMIZE_EXACT_IC 4 /* Slow Search (ignore case) */
352#define ONIG_OPTIMIZE_MAP 5 /* char map */
353#define ONIG_OPTIMIZE_EXACT_BM_IC 6 /* BM (ignore case) */
354#define ONIG_OPTIMIZE_EXACT_BM_NOT_REV_IC 7 /* BM (applied to a multibyte string) (ignore case) */
355
356/* bit status */
357typedef unsigned int BitStatusType;
358
359#define BIT_STATUS_BITS_NUM (sizeof(BitStatusType) * 8)
360#define BIT_STATUS_CLEAR(stats) (stats) = 0
361#define BIT_STATUS_ON_ALL(stats) (stats) = ~((BitStatusType )0)
362#define BIT_STATUS_AT(stats,n) \
363 ((n) < (int )BIT_STATUS_BITS_NUM ? ((stats) & ((BitStatusType )1 << n)) : ((stats) & 1))
364
365#define BIT_STATUS_ON_AT(stats,n) do {\
366 if ((n) < (int )BIT_STATUS_BITS_NUM)\
367 (stats) |= (1 << (n));\
368 else\
369 (stats) |= 1;\
370} while (0)
371
372#define BIT_STATUS_ON_AT_SIMPLE(stats,n) do {\
373 if ((n) < (int )BIT_STATUS_BITS_NUM)\
374 (stats) |= (1 << (n));\
375} while (0)
376
377
378#define INT_MAX_LIMIT ((1UL << (SIZEOF_INT * 8 - 1)) - 1)
379#define LONG_MAX_LIMIT ((1UL << (SIZEOF_LONG * 8 - 1)) - 1)
380
381#define DIGITVAL(code) ((code) - '0')
382#define ODIGITVAL(code) DIGITVAL(code)
383#define XDIGITVAL(enc,code) \
384 (ONIGENC_IS_CODE_DIGIT(enc,code) ? DIGITVAL(code) \
385 : (ONIGENC_IS_CODE_UPPER(enc,code) ? (code) - 'A' + 10 : (code) - 'a' + 10))
386
387#define IS_SINGLELINE(option) ((option) & ONIG_OPTION_SINGLELINE)
388#define IS_MULTILINE(option) ((option) & ONIG_OPTION_MULTILINE)
389#define IS_IGNORECASE(option) ((option) & ONIG_OPTION_IGNORECASE)
390#define IS_EXTEND(option) ((option) & ONIG_OPTION_EXTEND)
391#define IS_FIND_LONGEST(option) ((option) & ONIG_OPTION_FIND_LONGEST)
392#define IS_FIND_NOT_EMPTY(option) ((option) & ONIG_OPTION_FIND_NOT_EMPTY)
393#define IS_FIND_CONDITION(option) ((option) & \
394 (ONIG_OPTION_FIND_LONGEST | ONIG_OPTION_FIND_NOT_EMPTY))
395#define IS_NOTBOL(option) ((option) & ONIG_OPTION_NOTBOL)
396#define IS_NOTEOL(option) ((option) & ONIG_OPTION_NOTEOL)
397#define IS_NOTBOS(option) ((option) & ONIG_OPTION_NOTBOS)
398#define IS_NOTEOS(option) ((option) & ONIG_OPTION_NOTEOS)
399#define IS_ASCII_RANGE(option) ((option) & ONIG_OPTION_ASCII_RANGE)
400#define IS_POSIX_BRACKET_ALL_RANGE(option) ((option) & ONIG_OPTION_POSIX_BRACKET_ALL_RANGE)
401#define IS_WORD_BOUND_ALL_RANGE(option) ((option) & ONIG_OPTION_WORD_BOUND_ALL_RANGE)
402#define IS_NEWLINE_CRLF(option) ((option) & ONIG_OPTION_NEWLINE_CRLF)
403
404/* OP_SET_OPTION is required for these options.
405#define IS_DYNAMIC_OPTION(option) \
406 (((option) & (ONIG_OPTION_MULTILINE | ONIG_OPTION_IGNORECASE)) != 0)
407*/
408/* ignore-case and multibyte status are included in compiled code. */
409#define IS_DYNAMIC_OPTION(option) 0
410
411#define DISABLE_CASE_FOLD_MULTI_CHAR(case_fold_flag) \
412 ((case_fold_flag) & ~INTERNAL_ONIGENC_CASE_FOLD_MULTI_CHAR)
413
414#define REPEAT_INFINITE -1
415#define IS_REPEAT_INFINITE(n) ((n) == REPEAT_INFINITE)
416
417/* bitset */
418#define BITS_PER_BYTE 8
419#define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE)
420#define BITS_IN_ROOM ((int )sizeof(Bits) * BITS_PER_BYTE)
421#define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM)
422
423#ifdef PLATFORM_UNALIGNED_WORD_ACCESS
424typedef unsigned int Bits;
425#else
426typedef unsigned char Bits;
427#endif
428typedef Bits BitSet[BITSET_SIZE];
429typedef Bits* BitSetRef;
430
431#define SIZE_BITSET (int )sizeof(BitSet)
432
433#define BITSET_CLEAR(bs) do {\
434 int i;\
435 for (i = 0; i < BITSET_SIZE; i++) { (bs)[i] = 0; } \
436} while (0)
437
438#define BS_ROOM(bs,pos) (bs)[(int )(pos) / BITS_IN_ROOM]
439#define BS_BIT(pos) (1U << ((int )(pos) % BITS_IN_ROOM))
440
441#define BITSET_AT(bs, pos) (BS_ROOM(bs,pos) & BS_BIT(pos))
442#define BITSET_SET_BIT(bs, pos) BS_ROOM(bs,pos) |= BS_BIT(pos)
443#define BITSET_CLEAR_BIT(bs, pos) BS_ROOM(bs,pos) &= ~(BS_BIT(pos))
444#define BITSET_INVERT_BIT(bs, pos) BS_ROOM(bs,pos) ^= BS_BIT(pos)
445
446/* bytes buffer */
447 typedef struct _BBuf {
448 UChar* p;
449 unsigned int used;
450 unsigned int alloc;
451} BBuf;
452
453#define BBUF_INIT(buf,size) onig_bbuf_init((BBuf* )(buf), (size))
454
455#define BBUF_SIZE_INC(buf,inc) do{\
456 UChar *tmp;\
457 (buf)->alloc += (inc);\
458 tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\
459 if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\
460 (buf)->p = tmp;\
461} while (0)
462
463#define BBUF_EXPAND(buf,low) do{\
464 UChar *tmp;\
465 do { (buf)->alloc *= 2; } while ((buf)->alloc < (unsigned int )low);\
466 tmp = (UChar* )xrealloc((buf)->p, (buf)->alloc);\
467 if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\
468 (buf)->p = tmp;\
469} while (0)
470
471#define BBUF_ENSURE_SIZE(buf,size) do{\
472 unsigned int new_alloc = (buf)->alloc;\
473 while (new_alloc < (unsigned int )(size)) { new_alloc *= 2; }\
474 if ((buf)->alloc != new_alloc) {\
475 UChar *tmp;\
476 tmp = (UChar* )xrealloc((buf)->p, new_alloc);\
477 if (IS_NULL(tmp)) return(ONIGERR_MEMORY);\
478 (buf)->p = tmp;\
479 (buf)->alloc = new_alloc;\
480 }\
481} while (0)
482
483#define BBUF_WRITE(buf,pos,bytes,n) do{\
484 int used = (pos) + (int )(n);\
485 if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\
486 xmemcpy((buf)->p + (pos), (bytes), (n));\
487 if ((buf)->used < (unsigned int )used) (buf)->used = used;\
488} while (0)
489
490#define BBUF_WRITE1(buf,pos,byte) do{\
491 int used = (pos) + 1;\
492 if ((buf)->alloc < (unsigned int )used) BBUF_EXPAND((buf),used);\
493 (buf)->p[(pos)] = (UChar )(byte);\
494 if ((buf)->used < (unsigned int )used) (buf)->used = used;\
495} while (0)
496
497#define BBUF_ADD(buf,bytes,n) BBUF_WRITE((buf),(buf)->used,(bytes),(n))
498#define BBUF_ADD1(buf,byte) BBUF_WRITE1((buf),(buf)->used,(byte))
499#define BBUF_GET_ADD_ADDRESS(buf) ((buf)->p + (buf)->used)
500#define BBUF_GET_OFFSET_POS(buf) ((buf)->used)
501
502/* from < to */
503#define BBUF_MOVE_RIGHT(buf,from,to,n) do {\
504 if ((unsigned int )((to)+(n)) > (buf)->alloc) BBUF_EXPAND((buf),(to) + (n));\
505 xmemmove((buf)->p + (to), (buf)->p + (from), (n));\
506 if ((unsigned int )((to)+(n)) > (buf)->used) (buf)->used = (to) + (n);\
507} while (0)
508
509/* from > to */
510#define BBUF_MOVE_LEFT(buf,from,to,n) do {\
511 xmemmove((buf)->p + (to), (buf)->p + (from), (n));\
512} while (0)
513
514/* from > to */
515#define BBUF_MOVE_LEFT_REDUCE(buf,from,to) do {\
516 xmemmove((buf)->p + (to), (buf)->p + (from), (buf)->used - (from));\
517 (buf)->used -= (from - to);\
518} while (0)
519
520#define BBUF_INSERT(buf,pos,bytes,n) do {\
521 if (pos >= (buf)->used) {\
522 BBUF_WRITE(buf,pos,bytes,n);\
523 }\
524 else {\
525 BBUF_MOVE_RIGHT((buf),(pos),(pos) + (n),((buf)->used - (pos)));\
526 xmemcpy((buf)->p + (pos), (bytes), (n));\
527 }\
528} while (0)
529
530#define BBUF_GET_BYTE(buf, pos) (buf)->p[(pos)]
531
532
533#define ANCHOR_BEGIN_BUF (1<<0)
534#define ANCHOR_BEGIN_LINE (1<<1)
535#define ANCHOR_BEGIN_POSITION (1<<2)
536#define ANCHOR_END_BUF (1<<3)
537#define ANCHOR_SEMI_END_BUF (1<<4)
538#define ANCHOR_END_LINE (1<<5)
539
540#define ANCHOR_WORD_BOUND (1<<6)
541#define ANCHOR_NOT_WORD_BOUND (1<<7)
542#define ANCHOR_WORD_BEGIN (1<<8)
543#define ANCHOR_WORD_END (1<<9)
544#define ANCHOR_PREC_READ (1<<10)
545#define ANCHOR_PREC_READ_NOT (1<<11)
546#define ANCHOR_LOOK_BEHIND (1<<12)
547#define ANCHOR_LOOK_BEHIND_NOT (1<<13)
548
549#define ANCHOR_ANYCHAR_STAR (1<<14) /* ".*" optimize info */
550#define ANCHOR_ANYCHAR_STAR_ML (1<<15) /* ".*" optimize info (multi-line) */
551
552#define ANCHOR_KEEP (1<<16)
553
554/* operation code */
555enum OpCode {
556 OP_FINISH = 0, /* matching process terminator (no more alternative) */
557 OP_END = 1, /* pattern code terminator (success end) */
558
559 OP_EXACT1 = 2, /* single byte, N = 1 */
560 OP_EXACT2, /* single byte, N = 2 */
561 OP_EXACT3, /* single byte, N = 3 */
562 OP_EXACT4, /* single byte, N = 4 */
563 OP_EXACT5, /* single byte, N = 5 */
564 OP_EXACTN, /* single byte */
565 OP_EXACTMB2N1, /* mb-length = 2 N = 1 */
566 OP_EXACTMB2N2, /* mb-length = 2 N = 2 */
567 OP_EXACTMB2N3, /* mb-length = 2 N = 3 */
568 OP_EXACTMB2N, /* mb-length = 2 */
569 OP_EXACTMB3N, /* mb-length = 3 */
570 OP_EXACTMBN, /* other length */
571
572 OP_EXACT1_IC, /* single byte, N = 1, ignore case */
573 OP_EXACTN_IC, /* single byte, ignore case */
574
575 OP_CCLASS,
576 OP_CCLASS_MB,
577 OP_CCLASS_MIX,
578 OP_CCLASS_NOT,
579 OP_CCLASS_MB_NOT,
580 OP_CCLASS_MIX_NOT,
581
582 OP_ANYCHAR, /* "." */
583 OP_ANYCHAR_ML, /* "." multi-line */
584 OP_ANYCHAR_STAR, /* ".*" */
585 OP_ANYCHAR_ML_STAR, /* ".*" multi-line */
586 OP_ANYCHAR_STAR_PEEK_NEXT,
587 OP_ANYCHAR_ML_STAR_PEEK_NEXT,
588
589 OP_WORD,
590 OP_NOT_WORD,
591 OP_WORD_BOUND,
592 OP_NOT_WORD_BOUND,
593 OP_WORD_BEGIN,
594 OP_WORD_END,
595
596 OP_ASCII_WORD,
597 OP_NOT_ASCII_WORD,
598 OP_ASCII_WORD_BOUND,
599 OP_NOT_ASCII_WORD_BOUND,
600 OP_ASCII_WORD_BEGIN,
601 OP_ASCII_WORD_END,
602
603 OP_BEGIN_BUF,
604 OP_END_BUF,
605 OP_BEGIN_LINE,
606 OP_END_LINE,
607 OP_SEMI_END_BUF,
608 OP_BEGIN_POSITION,
609
610 OP_BACKREF1,
611 OP_BACKREF2,
612 OP_BACKREFN,
613 OP_BACKREFN_IC,
614 OP_BACKREF_MULTI,
615 OP_BACKREF_MULTI_IC,
616 OP_BACKREF_WITH_LEVEL, /* \k<xxx+n>, \k<xxx-n> */
617
618 OP_MEMORY_START,
619 OP_MEMORY_START_PUSH, /* push back-tracker to stack */
620 OP_MEMORY_END_PUSH, /* push back-tracker to stack */
621 OP_MEMORY_END_PUSH_REC, /* push back-tracker to stack */
622 OP_MEMORY_END,
623 OP_MEMORY_END_REC, /* push marker to stack */
624
625 OP_KEEP,
626
627 OP_FAIL, /* pop stack and move */
628 OP_JUMP,
629 OP_PUSH,
630 OP_POP,
631 OP_PUSH_OR_JUMP_EXACT1, /* if match exact then push, else jump. */
632 OP_PUSH_IF_PEEK_NEXT, /* if match exact then push, else none. */
633 OP_REPEAT, /* {n,m} */
634 OP_REPEAT_NG, /* {n,m}? (non greedy) */
635 OP_REPEAT_INC,
636 OP_REPEAT_INC_NG, /* non greedy */
637 OP_REPEAT_INC_SG, /* search and get in stack */
638 OP_REPEAT_INC_NG_SG, /* search and get in stack (non greedy) */
639 OP_NULL_CHECK_START, /* null loop checker start */
640 OP_NULL_CHECK_END, /* null loop checker end */
641 OP_NULL_CHECK_END_MEMST, /* null loop checker end (with capture status) */
642 OP_NULL_CHECK_END_MEMST_PUSH, /* with capture status and push check-end */
643
644 OP_PUSH_POS, /* (?=...) start */
645 OP_POP_POS, /* (?=...) end */
646 OP_PUSH_POS_NOT, /* (?!...) start */
647 OP_FAIL_POS, /* (?!...) end */
648 OP_PUSH_STOP_BT, /* (?>...) start */
649 OP_POP_STOP_BT, /* (?>...) end */
650 OP_LOOK_BEHIND, /* (?<=...) start (no needs end opcode) */
651 OP_PUSH_LOOK_BEHIND_NOT, /* (?<!...) start */
652 OP_FAIL_LOOK_BEHIND_NOT, /* (?<!...) end */
653 OP_PUSH_ABSENT_POS, /* (?~...) start */
654 OP_ABSENT, /* (?~...) start of inner loop */
655 OP_ABSENT_END, /* (?~...) end */
656
657 OP_CALL, /* \g<name> */
658 OP_RETURN,
659
660 OP_CONDITION,
661
662 OP_STATE_CHECK_PUSH, /* combination explosion check and push */
663 OP_STATE_CHECK_PUSH_OR_JUMP, /* check ok -> push, else jump */
664 OP_STATE_CHECK, /* check only */
665 OP_STATE_CHECK_ANYCHAR_STAR,
666 OP_STATE_CHECK_ANYCHAR_ML_STAR,
667
668 /* no need: IS_DYNAMIC_OPTION() == 0 */
669 OP_SET_OPTION_PUSH, /* set option and push recover option */
670 OP_SET_OPTION /* set option */
671};
672
673typedef int RelAddrType;
674typedef int AbsAddrType;
675typedef int LengthType;
676typedef int RepeatNumType;
677typedef short int MemNumType;
678typedef short int StateCheckNumType;
679typedef void* PointerType;
680
681#define SIZE_OPCODE 1
682#define SIZE_RELADDR (int )sizeof(RelAddrType)
683#define SIZE_ABSADDR (int )sizeof(AbsAddrType)
684#define SIZE_LENGTH (int )sizeof(LengthType)
685#define SIZE_MEMNUM (int )sizeof(MemNumType)
686#define SIZE_STATE_CHECK_NUM (int )sizeof(StateCheckNumType)
687#define SIZE_REPEATNUM (int )sizeof(RepeatNumType)
688#define SIZE_OPTION (int )sizeof(OnigOptionType)
689#define SIZE_CODE_POINT (int )sizeof(OnigCodePoint)
690#define SIZE_POINTER (int )sizeof(PointerType)
691
692
693#define GET_RELADDR_INC(addr,p) PLATFORM_GET_INC(addr, p, RelAddrType)
694#define GET_ABSADDR_INC(addr,p) PLATFORM_GET_INC(addr, p, AbsAddrType)
695#define GET_LENGTH_INC(len,p) PLATFORM_GET_INC(len, p, LengthType)
696#define GET_MEMNUM_INC(num,p) PLATFORM_GET_INC(num, p, MemNumType)
697#define GET_REPEATNUM_INC(num,p) PLATFORM_GET_INC(num, p, RepeatNumType)
698#define GET_OPTION_INC(option,p) PLATFORM_GET_INC(option, p, OnigOptionType)
699#define GET_POINTER_INC(ptr,p) PLATFORM_GET_INC(ptr, p, PointerType)
700#define GET_STATE_CHECK_NUM_INC(num,p) PLATFORM_GET_INC(num, p, StateCheckNumType)
701
702/* code point's address must be aligned address. */
703#define GET_CODE_POINT(code,p) code = *((OnigCodePoint* )(p))
704#define GET_BYTE_INC(byte,p) do{\
705 byte = *(p);\
706 (p)++;\
707} while(0)
708
709
710/* op-code + arg size */
711#define SIZE_OP_ANYCHAR_STAR SIZE_OPCODE
712#define SIZE_OP_ANYCHAR_STAR_PEEK_NEXT (SIZE_OPCODE + 1)
713#define SIZE_OP_JUMP (SIZE_OPCODE + SIZE_RELADDR)
714#define SIZE_OP_PUSH (SIZE_OPCODE + SIZE_RELADDR)
715#define SIZE_OP_POP SIZE_OPCODE
716#define SIZE_OP_PUSH_OR_JUMP_EXACT1 (SIZE_OPCODE + SIZE_RELADDR + 1)
717#define SIZE_OP_PUSH_IF_PEEK_NEXT (SIZE_OPCODE + SIZE_RELADDR + 1)
718#define SIZE_OP_REPEAT_INC (SIZE_OPCODE + SIZE_MEMNUM)
719#define SIZE_OP_REPEAT_INC_NG (SIZE_OPCODE + SIZE_MEMNUM)
720#define SIZE_OP_PUSH_POS SIZE_OPCODE
721#define SIZE_OP_PUSH_POS_NOT (SIZE_OPCODE + SIZE_RELADDR)
722#define SIZE_OP_POP_POS SIZE_OPCODE
723#define SIZE_OP_FAIL_POS SIZE_OPCODE
724#define SIZE_OP_SET_OPTION (SIZE_OPCODE + SIZE_OPTION)
725#define SIZE_OP_SET_OPTION_PUSH (SIZE_OPCODE + SIZE_OPTION)
726#define SIZE_OP_FAIL SIZE_OPCODE
727#define SIZE_OP_MEMORY_START (SIZE_OPCODE + SIZE_MEMNUM)
728#define SIZE_OP_MEMORY_START_PUSH (SIZE_OPCODE + SIZE_MEMNUM)
729#define SIZE_OP_MEMORY_END_PUSH (SIZE_OPCODE + SIZE_MEMNUM)
730#define SIZE_OP_MEMORY_END_PUSH_REC (SIZE_OPCODE + SIZE_MEMNUM)
731#define SIZE_OP_MEMORY_END (SIZE_OPCODE + SIZE_MEMNUM)
732#define SIZE_OP_MEMORY_END_REC (SIZE_OPCODE + SIZE_MEMNUM)
733#define SIZE_OP_PUSH_STOP_BT SIZE_OPCODE
734#define SIZE_OP_POP_STOP_BT SIZE_OPCODE
735#define SIZE_OP_NULL_CHECK_START (SIZE_OPCODE + SIZE_MEMNUM)
736#define SIZE_OP_NULL_CHECK_END (SIZE_OPCODE + SIZE_MEMNUM)
737#define SIZE_OP_LOOK_BEHIND (SIZE_OPCODE + SIZE_LENGTH)
738#define SIZE_OP_PUSH_LOOK_BEHIND_NOT (SIZE_OPCODE + SIZE_RELADDR + SIZE_LENGTH)
739#define SIZE_OP_FAIL_LOOK_BEHIND_NOT SIZE_OPCODE
740#define SIZE_OP_CALL (SIZE_OPCODE + SIZE_ABSADDR)
741#define SIZE_OP_RETURN SIZE_OPCODE
742#define SIZE_OP_CONDITION (SIZE_OPCODE + SIZE_MEMNUM + SIZE_RELADDR)
743#define SIZE_OP_PUSH_ABSENT_POS SIZE_OPCODE
744#define SIZE_OP_ABSENT (SIZE_OPCODE + SIZE_RELADDR)
745#define SIZE_OP_ABSENT_END SIZE_OPCODE
746
747#ifdef USE_COMBINATION_EXPLOSION_CHECK
748# define SIZE_OP_STATE_CHECK (SIZE_OPCODE + SIZE_STATE_CHECK_NUM)
749# define SIZE_OP_STATE_CHECK_PUSH (SIZE_OPCODE + SIZE_STATE_CHECK_NUM + SIZE_RELADDR)
750# define SIZE_OP_STATE_CHECK_PUSH_OR_JUMP (SIZE_OPCODE + SIZE_STATE_CHECK_NUM + SIZE_RELADDR)
751# define SIZE_OP_STATE_CHECK_ANYCHAR_STAR (SIZE_OPCODE + SIZE_STATE_CHECK_NUM)
752#endif
753
754#define MC_ESC(syn) (syn)->meta_char_table.esc
755#define MC_ANYCHAR(syn) (syn)->meta_char_table.anychar
756#define MC_ANYTIME(syn) (syn)->meta_char_table.anytime
757#define MC_ZERO_OR_ONE_TIME(syn) (syn)->meta_char_table.zero_or_one_time
758#define MC_ONE_OR_MORE_TIME(syn) (syn)->meta_char_table.one_or_more_time
759#define MC_ANYCHAR_ANYTIME(syn) (syn)->meta_char_table.anychar_anytime
760
761#define IS_MC_ESC_CODE(code, syn) \
762 ((code) == MC_ESC(syn) && \
763 !IS_SYNTAX_OP2((syn), ONIG_SYN_OP2_INEFFECTIVE_ESCAPE))
764
765
766#define SYN_POSIX_COMMON_OP \
767 ( ONIG_SYN_OP_DOT_ANYCHAR | ONIG_SYN_OP_POSIX_BRACKET | \
768 ONIG_SYN_OP_DECIMAL_BACKREF | \
769 ONIG_SYN_OP_BRACKET_CC | ONIG_SYN_OP_ASTERISK_ZERO_INF | \
770 ONIG_SYN_OP_LINE_ANCHOR | \
771 ONIG_SYN_OP_ESC_CONTROL_CHARS )
772
773#define SYN_GNU_REGEX_OP \
774 ( ONIG_SYN_OP_DOT_ANYCHAR | ONIG_SYN_OP_BRACKET_CC | \
775 ONIG_SYN_OP_POSIX_BRACKET | ONIG_SYN_OP_DECIMAL_BACKREF | \
776 ONIG_SYN_OP_BRACE_INTERVAL | ONIG_SYN_OP_LPAREN_SUBEXP | \
777 ONIG_SYN_OP_VBAR_ALT | \
778 ONIG_SYN_OP_ASTERISK_ZERO_INF | ONIG_SYN_OP_PLUS_ONE_INF | \
779 ONIG_SYN_OP_QMARK_ZERO_ONE | \
780 ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR | ONIG_SYN_OP_ESC_CAPITAL_G_BEGIN_ANCHOR | \
781 ONIG_SYN_OP_ESC_W_WORD | \
782 ONIG_SYN_OP_ESC_B_WORD_BOUND | ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END | \
783 ONIG_SYN_OP_ESC_S_WHITE_SPACE | ONIG_SYN_OP_ESC_D_DIGIT | \
784 ONIG_SYN_OP_LINE_ANCHOR )
785
786#define SYN_GNU_REGEX_BV \
787 ( ONIG_SYN_CONTEXT_INDEP_ANCHORS | ONIG_SYN_CONTEXT_INDEP_REPEAT_OPS | \
788 ONIG_SYN_CONTEXT_INVALID_REPEAT_OPS | ONIG_SYN_ALLOW_INVALID_INTERVAL | \
789 ONIG_SYN_BACKSLASH_ESCAPE_IN_CC | ONIG_SYN_ALLOW_DOUBLE_RANGE_OP_IN_CC )
790
791
792#define NCCLASS_FLAGS(cc) ((cc)->flags)
793#define NCCLASS_FLAG_SET(cc,flag) (NCCLASS_FLAGS(cc) |= (flag))
794#define NCCLASS_FLAG_CLEAR(cc,flag) (NCCLASS_FLAGS(cc) &= ~(flag))
795#define IS_NCCLASS_FLAG_ON(cc,flag) ((NCCLASS_FLAGS(cc) & (flag)) != 0)
796
797/* cclass node */
798#define FLAG_NCCLASS_NOT (1<<0)
799
800#define NCCLASS_SET_NOT(nd) NCCLASS_FLAG_SET(nd, FLAG_NCCLASS_NOT)
801#define NCCLASS_CLEAR_NOT(nd) NCCLASS_FLAG_CLEAR(nd, FLAG_NCCLASS_NOT)
802#define IS_NCCLASS_NOT(nd) IS_NCCLASS_FLAG_ON(nd, FLAG_NCCLASS_NOT)
803
804 typedef struct {
805 int type;
806 /* struct _Node* next; */
807 /* unsigned int flags; */
808} NodeBase;
809
810 typedef struct {
811 NodeBase base;
812 unsigned int flags;
813 BitSet bs;
814 BBuf* mbuf; /* multi-byte info or NULL */
815} CClassNode;
816
817typedef intptr_t OnigStackIndex;
818
819 typedef struct _OnigStackType {
820 unsigned int type;
821 OnigStackIndex null_check;
822 union {
823 struct {
824 UChar *pcode; /* byte code position */
825 UChar *pstr; /* string position */
826 UChar *pstr_prev; /* previous char position of pstr */
827#ifdef USE_COMBINATION_EXPLOSION_CHECK
828 unsigned int state_check;
829#endif
830 UChar *pkeep; /* keep pattern position */
831 } state;
832 struct {
833 int count; /* for OP_REPEAT_INC, OP_REPEAT_INC_NG */
834 UChar *pcode; /* byte code position (head of repeated target) */
835 int num; /* repeat id */
836 } repeat;
837 struct {
838 OnigStackIndex si; /* index of stack */
839 } repeat_inc;
840 struct {
841 int num; /* memory num */
842 UChar *pstr; /* start/end position */
843 /* Following information is set, if this stack type is MEM-START */
844 OnigStackIndex start; /* prev. info (for backtrack "(...)*" ) */
845 OnigStackIndex end; /* prev. info (for backtrack "(...)*" ) */
846 } mem;
847 struct {
848 int num; /* null check id */
849 UChar *pstr; /* start position */
850 } null_check;
851#ifdef USE_SUBEXP_CALL
852 struct {
853 UChar *ret_addr; /* byte code position */
854 int num; /* null check id */
855 UChar *pstr; /* string position */
856 } call_frame;
857#endif
858 struct {
859 UChar *abs_pstr; /* absent start position */
860 const UChar *end_pstr; /* end position */
861 } absent_pos;
862#ifdef USE_MATCH_CACHE
863 struct {
864 long index; /* index of the match cache buffer */
865 uint8_t mask; /* bit-mask for the match cache buffer */
866 } match_cache_point;
867#endif
868 } u;
869} OnigStackType;
870
871#ifdef USE_MATCH_CACHE
872 typedef struct {
873 UChar *addr;
874 long cache_point;
875 int outer_repeat_mem;
876 long num_cache_points_at_outer_repeat;
877 long num_cache_points_in_outer_repeat;
878 int lookaround_nesting;
879 UChar *match_addr;
880} OnigCacheOpcode;
881#endif
882
883 typedef struct {
884 void* stack_p;
885 size_t stack_n;
886 OnigOptionType options;
887 OnigRegion* region;
888 const UChar* start; /* search start position */
889 const UChar* gpos; /* global position (for \G: BEGIN_POSITION) */
890#ifdef USE_FIND_LONGEST_SEARCH_ALL_OF_RANGE
891 OnigPosition best_len; /* for ONIG_OPTION_FIND_LONGEST */
892 UChar* best_s;
893#endif
894#ifdef USE_COMBINATION_EXPLOSION_CHECK
895 void* state_check_buff;
896 int state_check_buff_size;
897#endif
898 int counter;
899 /* rb_hrtime_t from hrtime.h */
900#ifdef MY_RUBY_BUILD_MAY_TIME_TRAVEL
901 int128_t end_time;
902#else
903 uint64_t end_time;
904#endif
905#ifdef USE_MATCH_CACHE
906 int match_cache_status;
907 long num_fails;
908 long num_cache_opcodes;
909 OnigCacheOpcode* cache_opcodes;
910 long num_cache_points;
911 uint8_t* match_cache_buf;
912#endif
913} OnigMatchArg;
914
915#define NUM_CACHE_OPCODES_UNINIT 1
916#define NUM_CACHE_OPCODES_IMPOSSIBLE -1
917
918#define MATCH_CACHE_STATUS_UNINIT 1
919#define MATCH_CACHE_STATUS_INIT 2
920#define MATCH_CACHE_STATUS_DISABLED -1
921#define MATCH_CACHE_STATUS_ENABLED 0
922
923#define IS_CODE_SB_WORD(enc,code) \
924 (ONIGENC_IS_CODE_ASCII(code) && ONIGENC_IS_CODE_WORD(enc,code))
925
926 typedef struct OnigEndCallListItem {
927 struct OnigEndCallListItem* next;
928 void (*func)(void);
929} OnigEndCallListItemType;
930
931extern void onig_add_end_call(void (*func)(void));
932
933
934#ifdef ONIG_DEBUG
935
936typedef struct {
937 short int opcode;
938 const char* name;
939 short int arg_type;
940} OnigOpInfoType;
941
942extern OnigOpInfoType OnigOpInfo[];
943
944
945extern void onig_print_compiled_byte_code(FILE* f, UChar* bp, UChar* bpend, UChar** nextp, OnigEncoding enc);
946
947# ifdef ONIG_DEBUG_STATISTICS
948extern void onig_statistics_init(void);
949extern void onig_print_statistics(FILE* f);
950# endif
951#endif
952
953#ifndef PRINTF_ARGS
954#define PRINTF_ARGS(func, fmt, vargs) func
955#endif
956
957extern UChar* onig_error_code_to_format(OnigPosition code);
958PRINTF_ARGS(extern void onig_vsnprintf_with_pattern(UChar buf[], int bufsize, OnigEncoding enc, UChar* pat, UChar* pat_end, const char *fmt, va_list args), 6, 0);
959PRINTF_ARGS(extern void onig_snprintf_with_pattern(UChar buf[], int bufsize, OnigEncoding enc, UChar* pat, UChar* pat_end, const char *fmt, ...), 6, 7);
960extern int onig_bbuf_init(BBuf* buf, OnigDistance size);
961extern int onig_compile(regex_t* reg, const UChar* pattern, const UChar* pattern_end, OnigErrorInfo* einfo);
962#ifdef RUBY
963extern int onig_compile_ruby(regex_t* reg, const UChar* pattern, const UChar* pattern_end, OnigErrorInfo* einfo, const char *sourcefile, int sourceline);
964#endif
965extern void onig_transfer(regex_t* to, regex_t* from);
966extern int onig_is_code_in_cc(OnigEncoding enc, OnigCodePoint code, CClassNode* cc);
967extern int onig_is_code_in_cc_len(int enclen, OnigCodePoint code, CClassNode* cc);
968
969/* strend hash */
970typedef void hash_table_type;
971#ifdef RUBY
972# include "ruby/st.h"
973#else
974# include "st.h"
975#endif
976typedef st_data_t hash_data_type;
977
978extern hash_table_type* onig_st_init_strend_table_with_size(st_index_t size);
979extern int onig_st_lookup_strend(hash_table_type* table, const UChar* str_key, const UChar* end_key, hash_data_type *value);
980extern int onig_st_insert_strend(hash_table_type* table, const UChar* str_key, const UChar* end_key, hash_data_type value);
981
982#ifdef RUBY
983extern size_t onig_memsize(const regex_t *reg);
984extern size_t onig_region_memsize(const struct re_registers *regs);
985bool rb_reg_timeout_p(regex_t *reg, void *end_time);
986#endif
987
988RUBY_SYMBOL_EXPORT_END
989
990#endif /* ONIGMO_REGINT_H */
ruby.h
stdarg.h
Defines old _.
_BBuf
Definition regint.h:447
_OnigStackType
Definition regint.h:819
CClassNode
Definition regint.h:810
NodeBase
Definition regint.h:804
OnigCacheOpcode
Definition regint.h:872
OnigEndCallListItem
Definition regint.h:926
OnigErrorInfo
Definition onigmo.h:739
OnigMatchArg
Definition regint.h:883
re_registers
Definition onigmo.h:717