diff --git a/.gitignore b/.gitignore deleted file mode 100644 index bfea1e8..0000000 --- a/.gitignore +++ /dev/null @@ -1,10 +0,0 @@ -*.[oa] -*~ -*.so.* -*.so -*.src.rock -ChangeLog -*.zip -release-notes -/*.rockspec -/luarocks diff --git a/ChangeLog.old b/ChangeLog.old deleted file mode 100644 index f463d1c..0000000 --- a/ChangeLog.old +++ /dev/null @@ -1,845 +0,0 @@ -2010-07-06 Shmuel Zeigerman - - * lonig.c: casts to suppress compiler warnings. - -2010-07-05 Shmuel Zeigerman - - * lpcre_f.c: added flags up to PCRE version 8.10. - -2010-01-19 Shmuel Zeigerman - - * several files: luaL_typerror renamed to luaL_typeerror (as in Lua 5.2). - * common.h: added a macro for handling luaL_typeerror and luaL_typerror. - -2009-11-29 Shmuel Zeigerman - - * ltre.c: changes to adapt to TRE 0.8 - 1) #include (was: ). - 2) added tre_ prefix to all TRE functions. - -2009-11-08 Shmuel Zeigerman - - * lpcre_f.c: added flags up to PCRE version 8.00. - -2008-08-04 Shmuel Zeigerman - - * onig.c: making 'locale' and 'syntax' case sensitive again. - * onig_f.c: enclose all flags definitions into #ifdef's. - -2008-07-30 Reuben Thomas - - * Fixes in make files and docs. Testing on Linux. - -2008-07-30 Shmuel Zeigerman - - * Place each binding in separate directory: - src/posix, src/pcre, src/tre, src/oniguruma. - -2008-07-27 Shmuel Zeigerman - - * Initial binding of Oniguruma library. - -2008-06-22 Shmuel Zeigerman - - * test/luatest.lua: a fix; did not work with 'strict'. - -2008-06-14 Shmuel Zeigerman - - * algo.h: [API extension; suggested by Reuben Thomas] - all functions receiving string-type regex accept a compiled regex too. - If this is the case, cf and lo arguments are ignored (should be - either supplied as nils or omitted). - * algo.h: update version string to "Lrexlib 2.4.0". - -2008-05-09 Shmuel Zeigerman - - * lpcre_f.c: added new flag from PCRE-7.7. - -2008-03-28 Shmuel Zeigerman - * algo.h, lpcre.h, lposix.h, ltre.h: add two new methods (find and match). - * algo.h: rename functions: - checkarg_tfind --> checkarg_find_method; - generic_tfind --> generic_find_method; - checkarg_find_f --> checkarg_find_func; - generic_find --> generic_find_func; - -2008-03-25 Shmuel Zeigerman - * algo.h (plainfind_func): optimize for speed. - * algo.h (plainfind_func): treat empty patterns as valid. - * test/common_sets.lua (set_f_plainfind): add tests with empty patterns. - -2008-01-12 Shmuel Zeigerman - * test/luatest.lua: refactoring. - -2007-12-27 Shmuel Zeigerman - * test/runtest.lua: add new command-line switch -d that - will prepend to package.cpath. - * Makefile: add -d../src to testing commands, for testing the freshly built - libraries rather than the installed ones. - -2007-12-25 Shmuel Zeigerman - * test/common_sets.lua, test/spencer_sets.lua, test/pcre_sets.lua, - test/pcre_sets2.lua: - move tests with NULs in subject from common_sets.lua into other set - files. - -2007-12-19 Shmuel Zeigerman - - * Makefile: [fix] remove TRE-related parts (reported by Christian Wiese). - * Makefile: separate PCRE and POSIX targets (suggested by Hisham Muhammad). - * src/common.mak: express "ld" and "-shared" via variables (suggested by - Hisham Muhammad). - * src/algo.h: update version string to "Lrexlib 2.2.2". - -2007-11-09 Shmuel Zeigerman - - * 4 source files: refactoring (ALG_GETCFLAGS redefined). - -2007-10-25 Shmuel Zeigerman - - * algo.h: version string updated to "Lrexlib 2.2.1". - -2007-09-25 Shmuel Zeigerman - - * lpcre_f.c: added new flags from PCRE-7.4. - -2007-09-20 Shmuel Zeigerman - - * algo.h (generic_tfind): bugfix. - - * common_sets.lua (set_m_exec): one test added. - -2007-08-29 Shmuel Zeigerman - - * lpcre_f.c: added new flags from PCRE-7.3. - -2007-06-10 Shmuel Zeigerman - - * makefiles for Windows/MinGW: - * .a files are not needed anymore - * added test and install targets - -2007-06-08 Shmuel Zeigerman - - * algo_t.h: file removed; its contents moved to common.h. - -2007-05-03 Shmuel Zeigerman - - * lpcre.c (settables): removed API function. - -2007-05-02 Shmuel Zeigerman - - * algo_t.h: new file added, for making struct definitions visible to - the file parts lying above the line #include algo.h. - - * lpcre.c: [API extension]: cflags may be specified by a string. - -2007-04-30 Shmuel Zeigerman - - * lpcre.c (REX_OPENLIB, OPTLOCALE, compile_regex): bugfix: "tables" - userdata could be garbage-collected before the "regex" userdata - that was using it. - - * lpcre_f.c: added a new flag from PCRE-7.1. - -2007-04-21 Shmuel Zeigerman - - * test/luatest.lua (eq): no more relying on tostring producing unique - strings for different tables. - -2007-04-20 Shmuel Zeigerman - - * ltre.c (get_int_field, set_int_field): moved to common.c. - -2007-04-19 Reuben Thomas - - * Add build system support for TRE on POSIX systems. - -2007-04-18 Reuben Thomas - - * lpcre.c, lposix.c, ltre.c, algo.h: Fix some compiler warnings. - -2007-04-17 Shmuel Zeigerman - - * : the metatable for regex userdata is the C-functions - environment (not kept in the lua_State registry anymore). - * lpcre.c: the metatable for 'pcre_tables' userdata is kept at index 1 - of the C-functions environment. - -2007-04-14 Shmuel Zeigerman - - * lpcre.h (maketables): new API function (PCRE only). - -2007-04-13 Shmuel Zeigerman - - * algo.h (gmatch_iter, split_iter): bugfix: was improper detection - of a "no advance" situation. - * algo.h (split_iter): bugfix: if the subject ends with a separator, - there must be an additional pass giving an empty section. - * test/common_sets.lua: test results adjusted for bugfix in 'split'. - * test/pcre_sets.lua: gmatch tests added (testing "retry" feature). - -2007-04-12 Shmuel Zeigerman - - * algo.h, lpcre.c (USE_RETRY): new macro. Changed gsub and gmatch - behavior under PCRE when a "no advance" situation occurs. - * test/pcre_sets2.lua: test results adjusted for the change in gsub - behavior. - -2007-04-11 Shmuel Zeigerman - - * lpcre.c (settables): new API function (PCRE only). - * test/pcre_sets.lua: locale tests added. - -2007-03-19 Shmuel Zeigerman - - * algo.h, lpcre.c, lposix.c, ltre.c: improved userdata check - (detects bad userdata error prior to calling methods; - prevents crashes). - -2007-03-10 Shmuel Zeigerman - - * algo.h: many functions added. - * lpcre.c, lposix.c, ltre.c: many functions removed. - -2007-03-09 Shmuel Zeigerman - - * algo.h: new file added -- to contain the code of common algorithms. - * It is, in fact, a C-file. - * gsub, match, find: functions added - - * lpcre.c, lposix.c, ltre.c (gsub, match, find): functions removed. - -2007-03-07 Shmuel Zeigerman - - * lposix.c (REX_NSUB_BASE1): macro added, to facilitate building for - Tom Lord's library. - -2007-03-06 Shmuel Zeigerman - - * lposix.c, ltre.c (gmatch, split, gsub): bugfixes: - incorrect processing of patterns anchored at the beginning. - Was cured that way: if (offset > 0) eflags |= REG_NOTBOL; - - * test/common_sets.lua: test cases added. - -2007-03-05 Shmuel Zeigerman - - * lpcre.c (gsub): bugfix: - Test: { {"abcd", "\\b", "%1"}, {"abcd", 2, 2} }. - - * test/pcre_sets2.lua: a test case added. - -2007-03-03 Shmuel Zeigerman - - * lpcre.c, lposix.c, ltre.c (gsub): [API change]: - gsub returns 3 values; the 3-rd is number of replacements made. - - * test/*.lua: corrected tests for gsub (after API change). - -2007-03-02 Shmuel Zeigerman - - * test/common_sets.lua: added new tests for gsub (after API change). - -2007-03-01 Shmuel Zeigerman - - * lpcre.c, lposix.c, ltre.c (gsub): [API change]: - a) 2-nd return of rep() is ignored --> API-compatible with string.gsub - b) argument `n' can be a function --> API extension wrt string.gsub - - * common.h (REX_VERSION): updated to "2.2.0 beta". - -2007-02-23 Shmuel Zeigerman - - * lpcre.c, lpcre_f.c: - * added #ifdef's to do named subpatterns only if PCRE_MAJOR >= 4, - otherwise it wouldn't compile for PCRE 3.x [bugreport by Zhao Zhiguo]. - * same #ifdef for Lpcre_config function. - -2007-02-20 Shmuel Zeigerman - - * ltre.c (aexec, atfind, have_backrefs, have_approx): new methods. - aexec --> exec + approximate matching; - atfind --> tfind + approximate matching; - have_backrefs --> binding of tre_have_backrefs; - have_approx --> binding of tre_have_approx; - -2007-02-18 Shmuel Zeigerman - - * ltre.c: all uses of regexec replaced by regnexec. - * test/common_sets.lua: added tests with nuls in the subject. - -2007-02-17 Shmuel Zeigerman - - * ltre.c: new file added (started the binding of the TRE regex library). - * test/posix_sets.lua: added tests with nuls in the subject or/and - the pattern. - -2007-02-12 Shmuel Zeigerman - - * all sources (match, find, tfind, exec, dfa_exec): [API change] - in case of ordinary non-match, only a nil is returned; - other non-match cases generate an error. - - * test suite and the manual: updated to reflect the above API change. - - * all sources (gmatch, split, gsub): [bugfix] - if during repeated matching pcre_exec/regexec returns a value that - means neither match nor no-match, then an error is generated. - - * common.h (REX_VERSION): updated to "2.1.0". - -2007-01-29 Shmuel Zeigerman - - * lposix.c (checkarg_find_f): [bugfix] incorrect default for eflags. - * lposix.c (generic_find): [bugfix] dereferencing uninitialized pointer. - * common.h (REX_VERSION): updated to "2.0.2". - -2007-01-27 Reuben Thomas - - * lpcre.c, lposix.c (gsub): [bugfix] - - it was incorrectly assumed that the value on Lua stack was a string; - - luaL_error was used where lua_error was more appropriate; - -2007-01-18 Shmuel Zeigerman - - * lpcre.c (gsub): [API change undone]. - * all source files: refactoring. - -2007-01-14 Shmuel Zeigerman - - * lpcre.c (gsub): [API change]: - a) 2-nd return of rep() is ignored --> API-compatible with string.gsub - b) argument `n' can be a function --> API extension wrt string.gsub - -2007-01-13 Shmuel Zeigerman - - * lpcre.c, lposix.c: refactoring. - * common.c, common.h: refactoring. - * common.h (REX_VERSION): a new #define. - * lpcre.c, lposix.c (REX_OPENLIB): using REX_VERSION. - -2007-01-12 Shmuel Zeigerman - - * common.h, common.c: a nasty bug fixed. - * lpcre.c, lposix.c: version updated to 2.0.1. - -2007-01-10 Shmuel Zeigerman - - * lpcre.c, lposix.c: refactoring. - -2007-01-08 Shmuel Zeigerman - - * lpcre.c, lposix.c: refactoring. - -2007-01-04 Reuben Thomas - - * Add a top-level Makefile with all, clean and test targets. - * Split src/*.mak common parts into src/common.mak. - -2007-01-04 Shmuel Zeigerman - - * lpcre.c (Lpcre_gsub): unnecessary (though harmless) assignment removed. - * test/runtest.lua: extended the command-line interface. - * most files: the copyright notice changed to reference LICENSE file. - -2007-01-02 Shmuel Zeigerman - - * common.c (CheckFunction, OptFunction): functions removed. - * lpcre.c (put_integer): function removed. - -2006-12-31 Shmuel Zeigerman - - * common.c (udata_tostring): function removed. - * lpcre.c (Lpcre_tostring): added handling of deleted userdatum. - * lposix.c (Posix_tostring): added handling of deleted userdatum. - * lpcre.c: [API change] method `exec' now supports "named subpatterns". - * test/all_test.lua: renamed to runtest.lua. - -2006-12-30 Shmuel Zeigerman - - * lpcre.c: [API change] `versionPCRE' renamed to `version'. - -2006-12-29 Shmuel Zeigerman - - * lpcre.c: [API change] removed support of PCRE callout. - * test/pcre_sets.lua: removed testing of PCRE callout. - -2006-12-27 Shmuel Zeigerman - - * lpcre_f.c (config): [API change] the function accepts one optional - argument (a table), like the `flags' function. - -2006-12-26 Shmuel Zeigerman - - * lpcre.c, lposix.c (gsub): [API change] method become function. - * test/*.lua: modifying tests to reflect methods become functions. - * lua/rex.lua: file deleted. - * lpcre.c (luaopen_rex_pcre): changed the condition for validating - run-time PCRE version. - * lpcre_f.c: added new flags for support of PCRE 7.0. - * lpcre.c, lposix.c (checkarg_gsub): if the 3-rd argument is of type - "number" then it is converted to string (as in string.gsub). - -2006-12-25 Shmuel Zeigerman - - * lpcre.c, lposix.c (match, find, gmatch, split): [API change] - methods become functions. - -2006-12-23 Shmuel Zeigerman - - * test/*.lua: refactoring. - -2006-12-22 Shmuel Zeigerman - - * lpcre.c, lposix.c (tfind and exec): [API change] - the return value of the underlying pcre_exec/regexec call - is not added in the case of successfull match. - * lpcre.c, lposix.c (gtfind): [API change] method removed. - * lpcre.c, lposix.c: Lrexlib 2.0 beta -> Lrexlib 2.0. - * test/luatest.lua (eq): bugfix. - * lua/*.lua: deleted all lua files except for rex.lua. - * lua/rex.lua: fully rewritten; now contains wrappers for all methods. - -2006-12-21 Shmuel Zeigerman - - * test/*.lua: added tests for `split' method. - * test/luatest.lua (print_results): function added. - * test/common_sets.lua: file added. - -2006-12-19 Shmuel Zeigerman - - * lpcre.lua: `split' method added. - * lposix.lua: `split' method added. - * test/framework.lua: renamed to luatest.lua. - -2006-12-15 Shmuel Zeigerman - - * test/*.lua: refactoring. - -2006-12-11 Shmuel Zeigerman - - * test/*.lua: refactoring; deleting files; adding new files. - -2006-12-10 Shmuel Zeigerman - - * lpcre.c, lposix.c: gmatch bug fixed. Test case added. - * lpcre.c, lposix.c: gtfind bug fixed. Test case added. - -2006-12-09 Shmuel Zeigerman - - * lua/gsub_test.lua, gsub_tstpsx.lua: 2 files deleted. - * lua/posix_sets.lua, pcre_sets.lua, framework.lua, all_test.lua: - 4 files added. - * lpcre.c, lposix.c, common.c, common.h: - an API alteration in gsub and gtfind methods: if a non-positive number - is supplied as the 'n' parameter, then no iterations are done. - Test cases added to *.lua test files. - -2006-12-07 Shmuel Zeigerman - - * lpcre.c, lposix.c (gsub): if parameter rep is a function, - and its 2-nd return value (if present) is a string "break", - then gsub immediately returns. - * test/*.lua: refactoring. - -2006-12-06 Shmuel Zeigerman - - * lpcre.c, lposix.c: refactoring. - -2006-12-05 Shmuel Zeigerman - - * lposix.c: cosmetics. - -2006-12-04 Shmuel Zeigerman - - * lpcre.c, lposix.c: introduced new macros: CAP_BEG, CAP_END and CAP_LEN. - * lpcre.c, lpcre_f.c, lposix.c: refactoring. - -2006-12-03 Shmuel Zeigerman - - * lpcre.c (Lpcre_gsub_func): an improvement. - * lposix.c (posix_gsub_func): an improvement. - * lpcre.c, lposix.c (gmatch, match, find): functions removed. - * lpcre.c, lposix.c: method tgfind renamed to gtfind. - * lpcre.c, lposix.c: gsub function become method. - * test/posix_test.lua, pcre_test.lua: removed tests for removed functions. - -2006-12-02 Shmuel Zeigerman - - * common.c, common.h (TBuffer): moved here from lpcre.c. - * common.c, common.h (TFreeList): helper class created. - * lpcre.c (Lpcre_gsub_func): many changes. - * lposix.c (posix_gsub_func): added function gsub. - * test/gsub_test.lua: added testing for the new written-in-C gsub. - * test/gsub_tstpsx.lua: file added. - * test/rex_.lua: file deleted. - -2006-12-01 Shmuel Zeigerman - - * lpcre.c (TBuffer): helper class created. - * lpcre.c (Lpcre_gsub_func): many changes. - -2006-11-30 Shmuel Zeigerman - - * lpcre.c (TExecData): struct renamed to TCallout. - * lpcre.c (LpcreSetExecData): function renamed to SetupCallout. - * lpcre.c (Lpcre_gsub_func): added function gsub. - -2006-11-29 Shmuel Zeigerman - - * test/*.lua: refactoring. - * lpcre.c, lposix.c: refactoring. - * lpcre.c, lposix.c (oldmatch): renamed to tfind. - * lpcre.c, lposix.c (oldgmatch): renamed to tgfind. - * */*.lua: renamed: oldmatch -> tfind; oldgmatch -> tgfind. - -2006-11-28 Shmuel Zeigerman - - * lpcre.c (Lpcre_dfa_exec): one Lmalloc call instead of two. - -2006-11-27 Shmuel Zeigerman - - * common.c (plainfind_func): rewritten to not use memicmp - * test/*.lua: every test returns number of failures - -2006-11-26 Shmuel Zeigerman - - * lpcre.c, lposix.c: all Check_arg_* functions renamed to Checkarg_* - * lpcre.c (Lpcre_dfa_exec): added 2 arguments to dfa_exec - * common.h (DIM): macro removed - * test/pcre_test.lua: tests for dfa_exec method added - -2006-11-25 Shmuel Zeigerman - - * lpcre.c, lposix.c: alpha -> beta. - * lpcre_f.c: file added (was: part of lpcre.c). - * rex_pcre.mak: updated due to the new file lpcre_f.c - * *.mak: version updated to 2.0 - * test/all_test.lua: file added. - * test/posix_test.lua, test/pcre_test.lua: made modules. - * test/posix_test.lua: tests added. - * test/*.lua: refactoring. - * lua/generic_gsub.lua: refactoring. - -2006-11-23 Shmuel Zeigerman - - * test/*.lua: refactoring. - * lua/rex.lua, lua/rex_.lua (gsub): 6th and 7th arguments swapped. - -2006-11-22 Shmuel Zeigerman - - * lpcre.c (Check_arg_findmatch_func): 5th and 6th arguments swapped. - * lpcre.c (Check_arg_gmatch_func): 4th and 5th arguments swapped. - * test/posix_test.lua: file added. - * lposix.c: 2 bugs fixed. - -2006-11-21 Shmuel Zeigerman - - * test/pcre_test.lua: "named subpatterns" tests added. - -2006-11-20 Shmuel Zeigerman - - * common.c, common.h (plainfind_func): function added. - * lpcre.c, lposix.c (rex.plainfind): new function (from Lua side). - * test/framework.lua: file added. - * test/pcre_test.lua: file added. - -2006-11-19 Shmuel Zeigerman - - * lpcre.c (Lpcre_config): new function (pcre.config from Lua side). - * lpcre.c: callout handling improved. - -2006-11-18 Shmuel Zeigerman - - * lpcre.c, lposix.c: old 'gmatch' method put back; renamed into 'oldgmatch'. - -2006-11-17 Shmuel Zeigerman - - * windows/bcc32/make_bcc.mak: deleted -DCOMPAT51, added -D$(CMDLINE) - -2006-11-16 Shmuel Zeigerman - - * gsub_test.lua (PatternLua2Pcre): function renamed into 'pat2pcre'. - * lua/pat2pcre.lua: file added (was part of gsub_test.lua). - -2006-11-15 Shmuel Zeigerman - - * lpcre.c, lposix.c: Lua API has changed: - * 'match' method renamed to 'oldmatch' - * added (as much as possible) Lua string library API compatible: - 'find', 'match' and 'gmatch' - each one being a function/method pair. - * lpcre.c (newPCRE, flagsPCRE): functions removed. - * lposix.c (newPOSIX, flagsPOSIX): functions removed. - * lpcre.c, lposix.c: added literal rex._VERSION. - * rex.lua: deleted everything except gsub. - * rex.lua (gsub): rex.oldmatch is used instead of rex.match. - * generic_gsub.lua: rex.oldmatch is used instead of rex.match. - * test/test1.lua: file added - -2006-11-12 Shmuel Zeigerman - - * rex.lua (r:gmatch): metamethod added. - * lpcre.c (Lpcre_maketables): function API simplified. - * lpcre.c (Lpcre_getargs): function removed. - * lpcre.c (LpcreGetExecParams): renamed from LpcreProcessExecParams. - -2006-11-09 Shmuel Zeigerman - - * lua/bit.lua: file removed. - -2006-11-05 Shmuel Zeigerman - - * rex.lua (gsub): a few structural optimizations. - * rex.lua (gmatch): a bugfix. - * rex.lua: tests deleted from the file. - * gsub.lua: renamed into 'generic_gsub.lua'; made a module. - * new_gsub.lua: file deleted. - * lua/bit.lua: file added. - -2006-11-04 Reuben Thomas - - * rex.lua (gmatch): function rewritten to be compatible with - string.gmatch. - * find.lua: file deleted. - * lpcre.c (Lpcre_gmatch): function deleted. - * lposix.c (posix_gmatch): function deleted. - -2006-11-04 Shmuel Zeigerman - - * gsub.lua, new_gsub.lua, gsub_test.lua, rex.lua: bugfixes. - -2006-10-18 Shmuel Zeigerman - - * [Windows] DLL builds need lua5.1.dll rather than lua51.dll. - -2006-10-02 Shmuel Zeigerman - - * Support of Lua 5.0 was dropped. - -2006-09-03 Shmuel Zeigerman - - * common.h (REX_LIB_API): renamed into REX_API. - * common.h (flags_pair): renamed into flag_pair. - * common.h, lpcre.h, lposix.h (REX_REGISTER): renamed into rex_register. - * lpcre.h (luaopen_rex_pcre): error message text changed. - * lposix.c (posix_handle, posix_typename): - string literals are prefixed by $(REX_LIBNAME). - [ This makes possible using multiple rex_posix libraries - at a time by one lua_State. ] - * lpcre.c (pcre_handle, pcre_typename): - string literals are prefixed by $(REX_LIBNAME). - [ This makes possible using multiple rex_pcre libraries - at a time by one lua_State. ] - * added directory test/Spencer (containing test.lua). - * test/Spencer/test.lua: file returns a function. - -2006-08-27 Shmuel Zeigerman - - * (local) merge with the version put into CVS by R.Thomas. - * common.h: added conditional #define's for lua_pushinteger and - lua_tointeger (needed to compile with Lua 5.0). - -2006-08-18 Shmuel Zeigerman - - * common.c, lpcre.c, lposix.c: lua_pushnumber replaced with - lua_pushinteger where appropriate (in many places). - * lpcre.c (put_number): function renamed into put_integer. - -2006-06-17 Shmuel Zeigerman - - * lpcre.c (TPcreExecParam): `use_callout' struct member was eliminated. - Instead, a special value of function reference (LUA_NOREF) is used. - -2006-04-01 Reuben Thomas - - * lpcre.c, common.c: Remove trailing whitespace. - * lpcre.c (Lpcre_gmatch): Remove unnecessary limit variable. - -2006-02-17 Shmuel Zeigerman - - * common.c, common.h (L_lua_error): function deleted. - * common.c, lpcre.c, lposix.c: luaL_error used in place of L_lua_error. - * lposix.c (posix2): struct renamed into TPosix. - * lposix.c (posix_comp): lua_newuserdata() used instead of Lmalloc(). - -2005-12-26 Shmuel Zeigerman - - * Separate makefiles for POSIX and PCRE. No config file. - -2005-11-28 Shmuel Zeigerman - - * common.h (REXLIB_API): macro renamed into REX_LIB_API. - * lposix.c (LREXLIB_POSIX_EXT): macro renamed into REX_POSIX_EXT. - -2005-11-26 Shmuel Zeigerman - - * common.h (LUAL_REGISTER): macro renamed into REX_REGISTER. - * lpcre.c (LUAOPEN_LIB): macro renamed into REX_OPENLIB. - * lpcre.c (LIBNAME): macro renamed into REX_LIBNAME. - -2005-11-15 Shmuel Zeigerman - - * common.c, common.h, lposix.c, lpcre.c: new files (lrexlib.c was - splitted); POSIX and PCRE parts now live in their own - separate files. - * common.h (REXLIB_API): new macro. - * lposix.c (LREXLIB_POSIX): macro removed. - * lposix.c (LUAOPEN_LIB, LIBNAME): new macros. - * lposix.c (rexlib): Lua-side functions flagsPOSIX and newPOSIX - now have aliases (flags and new, correspondently). - * lpcre.c (LREXLIB_PCRE): macro removed. - * lpcre.c (LUAOPEN_LIB, LIBNAME): new macros. - * lpcre.c (rexlib): Lua-side functions flagsPCRE and newPCRE now - have aliases (flags and new, correspondently). - * lpcre.c (Lpcre_vers): function renamed into Lpcre_version. - -2005-11-12 Shmuel Zeigerman - - * lrexlib.c (LUAL_REGISTER): new macro. - -2005-11-10 Shmuel Zeigerman - - * lrexlib.c (posix_match_generic): return (on Lua-side) an - additional value (the return code of regexec). - * lrexlib.c (Lpcre_match_generic): return (on Lua-side) an - additional value (the return code of pcre_exec). - * lrexlib.c (Lpcre_dfa_exec): return (on Lua-side) an additional - value (the return code of pcre_dfa_exec). - -2005-10-29 Shmuel Zeigerman - - * lrexlib.c (get_flags): the function now accepts one parameter - from the Lua stack (a table). Was: no parameters. (This - affects the Lua-side functions: flagsPOSIX and - flagsPCRE). - * lrexlib.c (LREXLIB_POSIX_EXT): it's now possible to force-define - this macro at compile time, bypassing the automatic - detection. - * lrexlib.c: added new POSIX flags (error values). - * lrexlib.c (LpcreProcessParams): renamed into - LpcreProcessExecParams. - * lrexlib.c: added all missing PCRE flags starting from PCRE - version 4. - -2005-10-25 Shmuel Zeigerman - - * lrexlib.c (DIM): new macro. - * lrexlib.c (pcre2): renamed into TPcre. - * lrexlib.c (TPcreExecParam): new struct. - * lrexlib.c (LpcreProcessParams): new function. - * lrexlib.c (Lpcre_dfa_exec): new function. Lua-side: dfa_exec. - * lrexlib.c (Lpcre_dfa_restart): new function. Lua-side: dfa_restart. - -2005-10-23 Shmuel Zeigerman - - * lrexlib.c (TPcreCalloutData): new struct. - * lrexlib.c (Lpcre_callout): new function. - * lrexlib.c (Lpcre_match_generic): PCRE callout support added. - * lrexlib.c: added new PCRE flags (from PCRE versions 5 and 6). - * lrexlib.c (put_number): new helper function. - -2005-05-27 Shmuel Zeigerman - - * lrexlib.c: updated to work with Compat-5.1. - -2004-12-18 Shmuel Zeigerman - - * lrexlib.c (regex_tostring): error handling added. - * lrexlib.c (regex_tostring): renamed into udata_tostring. - * lrexlib.c (regex_get_flags): renamed into get_flags. - * lrexlib.c (Lpcre_comp): pattern offset included in error message. - * lrexlib.c (Lpcre_comp): error check added after pcre_study call. - * lrexlib.c (Lpcre_push_substrings): eliminated inserting nil - values into the matches table (not a bug, redundancy). - * lrexlib.c (Lpcre_push_substrings): lua_rawset call instead of - lua_settable. - * lrexlib.c: all stack buffers used for message formatting changed - in size from 128 to 256 bytes. - -2004-11-17 Nick Gammon - - * lrexlib.c (pcre2): new member pcre2.extra. - * lrexlib.c (Lpcre_comp): pcre_study call added. - * lrexlib.c (Lpcre_push_matches, Lpcre_push_substrings, - Lpcre_push_offsets): function signatures changed. - * lrexlib.c (Lpcre_push_substrings): added support for "named - subpatterns". - -2004-09-15 Shmuel Zeigerman - - * gsub.lua (is_odd): Function removed; math.mod used instead. - -2004-08-24 Shmuel Zeigerman - - * ChangeLog: File added. - * NEWS: File added. - -2004-08-12 Shmuel Zeigerman - - * lrexlib.c (posix_exec, Lpcre_exec): New C functions, that - correspond to the new lua function 'r:exec'. - * lrexlib.c (posix_tostring, Lpcre_tostring): New C functions, - that correspond to the new lua function 'r:__tostring'. - * lrexlib.c: A table returned by r:match() as its 3rd result has - no "n" index set anymore. - * lrexlib.c (LREXLIB_POSIX_EXT): New macro. - * lrexlib.c (PCRE_LOCALE_SUPPORT): Macro removed. - * lrexlib.c (posix_push_matches, Lpcre_push_matches): Functions - became typedef's. - * lrexlib.c (posix_match_generic, Lpcre_match_generic) - (posix_push_substrings, Lpcre_push_substrings) - (posix_push_offsets, Lpcre_push_offsets): New functions. - * gsub.lua: File added. - -2004-08-11 Reuben Thomas - - * config: Many changes. - * Makefile: Many changes. - -2004-08-11 Shmuel Zeigerman - - * config: File added + many changes. - * Makefile: Many changes. - -2004-07-15 Shmuel Zeigerman - - * lrexlib.c (posix_get_flags, Lpcre_get_flags, Lpcre_vers): New C - functions, that correspond to new lua functions - 'flagsPOSIX', 'flagsPCRE', 'versionPCRE'. - * lrexlib.c: Lua functions 'newPCRE' and 'newPOSIX' accept an - optional 2nd argument ("compilation flags"). - * lrexlib.c: Lua function 'newPCRE' accepts an optional 3rd - argument ("locale") - but only if the macro - PCRE_LOCALE_SUPPORT was defined at the compilation time. - * lrexlib.c: Lua function 'r:match' accepts optional 2nd and 3rd - arguments ("startoffset" and "execution flags"). - * lrexlib.c: Lua function 'r:gmatch' accepts an optional 2nd - argument ("execution flags"). - * lrexlib.c (posix_gmatch, Lpcre_gmatch): If a user-defined lua - function passed as the 2nd parameter returns true value, - then lua function 'r:gmatch' returns. - * lrexlib.c (posix_push_matches, Lpcre_push_matches): The table of - substring matches contains false in the positions - correspondent to non-matched subpatterns. - * lrexlib.c: Static functions that began with 'pcre' were renamed - to begin with 'Lpcre'. - * lrexlib.c (posix_getargs, Lpcre_getargs): - Fixed - allocated memory was not freed. - Fixed - removed redundant calls of lua_checkstack. - * lrexlib.c: Allocation/freeing memory moved from matching - operations to pattern-compiling and garbage-collecting - ones. - * lrexlib.c (posix_match, posix_gmatch, Lpcre_match, Lpcre_gmatch): - luaL_checkudata is used in checking of userdata-type - parameter. - * lrexlib.c: Removed conditional compilation controlled by the - macro REG_BASIC. - * lrexlib.c (posix_comp): The following invalid ANSI C89 code: - size_t sz = ; char errbuf[sz]; - made valid with the use of malloc/free. - * lrexlib.c (Lpcre_gmatch): Keeping 'subject' and 'length' - unchanged while updating 'startoffset'. - * lbitlib.c: File removed. - * Makefile: Removed parts related to lbitlib.c. - * make_bcc.mak: File added. diff --git a/LICENSE b/LICENSE deleted file mode 100644 index cfd2df4..0000000 --- a/LICENSE +++ /dev/null @@ -1,27 +0,0 @@ -License of Lrexlib release --------------------------- - -Copyright (C) Reuben Thomas 2000-2020 -Copyright (C) Shmuel Zeigerman 2004-2020 - -Permission is hereby granted, free of charge, to any person -obtaining a copy of this software and associated -documentation files (the "Software"), to deal in the -Software without restriction, including without limitation -the rights to use, copy, modify, merge, publish, distribute, -sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, -subject to the following conditions: - -The above copyright notice and this permission notice shall -be included in all copies or substantial portions of the -Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY -KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE -WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR -PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS -OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR -OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE -SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. diff --git a/Makefile b/Makefile deleted file mode 100644 index adba455..0000000 --- a/Makefile +++ /dev/null @@ -1,54 +0,0 @@ -# Makefile for lrexlib - -VERSION = 2.9.1 -PROJECT = lrexlib -PROJECT_VERSIONED = $(PROJECT)-$(VERSION) - -# Commands -LUA = lua -LUAROCKS = luarocks -CP = cp -a -RM = rm -f -RST2HTML = rst2html -REGNAMES = gnu pcre pcre2 posix oniguruma tre -LUAROCKS_COMMAND = make - - -.SUFFIXES: .txt .html - -HTML = doc/index.html doc/manual.html - -.txt.html: - $(RST2HTML) --stylesheet-path=doc/lrexlib.css --link-stylesheet --initial-header-level=2 --date --time $< $@ - -build: - $(MAKE) install LUAROCKS="$(LUAROCKS) --tree=luarocks" - -install: rockspecs - for i in *.rockspec; do \ - $(LUAROCKS) $(LUAROCKS_COMMAND) $$i; \ - done - -rockspecs: - rm -f *.rockspec - $(LUA) mkrockspecs.lua $(PROJECT) $(VERSION) - -doc/index.txt: README.rst - $(CP) $< $@ - -check: build - for i in $(REGNAMES); do \ - LUA_PATH="test/?.lua;$(LUA_PATH);" $(LUA) test/runtest.lua -dsrc/$$i $$i; \ - done - -clean: - $(RM) $(HTML) doc/index.txt *.rockspec - -release: check - agrep -d 'Release' $(VERSION) NEWS | tail -n +3 | head -n -2 > release-notes && \ - git diff --exit-code && \ - git tag -a -m "Release tag" rel-`echo $(VERSION) | sed -e 's/\./-/g'` && \ - git push && git push --tags && \ - $(MAKE) build LUAROCKS_COMMAND=build && \ - woger lua package=$(PROJECT) package_name=$(PROJECT) version=$(VERSION) description="Lua binding for regex libraries" notes=release-notes home="`$(LUA) -e'version="'$(VERSION)'"; flavour="none"; t = require "rockspecs"; print(t.default.description.homepage)'`" - rm -f release-notes diff --git a/NEWS b/NEWS deleted file mode 100644 index 02a7b3c..0000000 --- a/NEWS +++ /dev/null @@ -1,189 +0,0 @@ -2020-08-07 Release 2.9.1 - - * Add Lua 5.4 support - -2017-11-07 Release 2.9.0 - - * Add PCRE2 support. - -2015-02-26 Release 2.8.0 - - * Add Lua 5.3 support - * No longer return empty matches adjacent to previous non-empty match. - -2013-01-08 Release 2.7.2 - - * Fixed the use of alternative allocators, and a memory leak. - * Simplify the build system further. - * Change rockspec to build from git now that github no longer - supports downloads. - -2012-10-18 Release 2.7.1 - - * Fixed Lua 5.1 compatibility, broken in 2.7.0. - * Added ability to specify no replacement to gsub with a nil or - false replacement argument. - -2012-10-04 Release 2.7.0 - - * Added support for searching raw memory buffers (e.g. made with - alien). - * Fixed possible invalid code generation in C (thanks, Michael - Tautschnig). - * Generate LuaRock rockspecs for all modules. - * Greatly simplify UNIX build system, relying on LuaRocks. - * Allow POSIX REG_STARTEND to be used on any system supporting it. - * Add a test set for POSIX regex engine (thanks, Enrico Tassi). - * Simplify some code. - * Always use Lua state memory allocator. - -2012-04-13 Release 2.6.0 - - * Added support for Lua 5.2. - -2010-12-15 Release 2.5.3 - - * Bug fix to rex.split. - * Support for new flags in PCRE 8.11. - -2010-11-10 Release 2.5.2 - - * Important bug fix (thanks to Enrico Tassi for the report) - affecting platforms with certain alignment requirements. - * Improved build system for Windows. - * Minor improvements to the manual. - -2010-10-04 Release 2.5.1 - - * Minor improvements and fixes, no changes to library code. - - -2010-10-03 Release 2.5.0 - - * Added bindings of the TRE and GNU regex APIs. - - * Improved and simplified the build system. - - -2008-08-04 Release 2.4.0 - - * All functions receiving string-type regex accept a compiled regex too. - - * Added binding of the Oniguruma library. - - -2008-05-31 Release 2.3.0 - - * Added methods: find and match. - - -2007-12-29 Release 2.2.2 - - * Makefiles fixed. - - -2007-10-25 Release 2.2.1 - - * Added new PCRE constants up to version 7.4. - - * 1 bugfix. - - -2007-06-19 Release 2.2.0 - - * gsub API extension: allow the 4-th argument to be a function. - - * Added functions: maketables (PCRE). - - * Improved algorithm for global searches (PCRE; retry after empty match). - - * cflags may be specified by a string (PCRE). - - * Bugfixes. - - -2007-02-13 Release 2.1.0 - - * Improved error handling. - - * A minor change in API. - - -2007-01-30 Release 2.0.2 - - * 3 bugfixes. - - * Corrections in the Reference Manual. - - -2007-01-12 Release 2.0.1 - - * Bugfix in memory deallocation. - - -2007-01-05 Release 2.0 - - * Added functions: match, find, gmatch, gsub, split, config, plainfind. - - * Added methods: dfa_exec. - - * Removed methods: gmatch. - - * Renamed functions: - newPCRE, newPOSIX --> new. - flagsPCRE, flagsPOSIX --> flags. - versionPCRE --> version. - - * Renamed methods: match --> tfind. - - * Added test suite. - - * Added reference manual. - - -2004-12-19 Release 1.19 - - * Added support for PCRE "named subpatterns" (thanks to Nick Gammon). - - * Several minor improvements. - - -2004-08-25 Release 1.18 - - * New lua function 'r:exec'. - - * New lua function 'r:__tostring'. - - * A table returned by r:match() as its 3rd result has no "n" index - set anymore. Use table.getn instead. - - * Fixed the bug preventing compilation with the "basic" POSIX - regexp library. - - * Makefile improved. - - * Added file gsub.lua containing function 'generic_gsub'. - - -2004-07-16 Release 17 - - * New lua functions 'flagsPOSIX', 'flagsPCRE', 'versionPCRE'. - - * Lua functions 'newPCRE' and 'newPOSIX' accept an optional - 2nd argument ("compilation flags"). - - * Lua function 'newPCRE' accepts an optional 3rd argument - ("locale"). - - * Lua function 'r:match' accepts optional 2nd and 3rd - arguments ("startoffset" and "execution flags"). - - * Lua function 'r:gmatch' accepts an optional 2nd argument - ("execution flags"). - - * If a user-defined function passed to r:gmatch() as its - 2nd parameter returns true value, then r:gmatch() returns. - - * The table of substring matches contains false in the positions - correspondent to non-matched subpatterns. - diff --git a/bin/linux32/clib/rex_pcre2.so b/bin/linux32/clib/rex_pcre2.so new file mode 100755 index 0000000..df6dc2d Binary files /dev/null and b/bin/linux32/clib/rex_pcre2.so differ diff --git a/bin/linux32/libpcre2-8.a b/bin/linux32/libpcre2-8.a new file mode 100644 index 0000000..a686322 Binary files /dev/null and b/bin/linux32/libpcre2-8.a differ diff --git a/bin/linux32/libpcre2-posix.a b/bin/linux32/libpcre2-posix.a new file mode 100644 index 0000000..c4bc9b2 Binary files /dev/null and b/bin/linux32/libpcre2-posix.a differ diff --git a/bin/linux32/librex_pcre2.a b/bin/linux32/librex_pcre2.a new file mode 100644 index 0000000..dd16f93 Binary files /dev/null and b/bin/linux32/librex_pcre2.a differ diff --git a/bin/linux64/clib/rex_pcre2.so b/bin/linux64/clib/rex_pcre2.so new file mode 100755 index 0000000..1c9c9c5 Binary files /dev/null and b/bin/linux64/clib/rex_pcre2.so differ diff --git a/bin/linux64/libpcre2-8.a b/bin/linux64/libpcre2-8.a new file mode 100644 index 0000000..c45f13b Binary files /dev/null and b/bin/linux64/libpcre2-8.a differ diff --git a/bin/linux64/libpcre2-posix.a b/bin/linux64/libpcre2-posix.a new file mode 100644 index 0000000..078e1d3 Binary files /dev/null and b/bin/linux64/libpcre2-posix.a differ diff --git a/bin/linux64/librex_pcre2.a b/bin/linux64/librex_pcre2.a new file mode 100644 index 0000000..f5390ab Binary files /dev/null and b/bin/linux64/librex_pcre2.a differ diff --git a/bin/mingw32/clib/rex_pcre2.dll b/bin/mingw32/clib/rex_pcre2.dll new file mode 100755 index 0000000..3be77f2 Binary files /dev/null and b/bin/mingw32/clib/rex_pcre2.dll differ diff --git a/bin/mingw32/pcre2-8.a b/bin/mingw32/pcre2-8.a new file mode 100755 index 0000000..8c6dfb2 Binary files /dev/null and b/bin/mingw32/pcre2-8.a differ diff --git a/bin/mingw32/pcre2-posix.a b/bin/mingw32/pcre2-posix.a new file mode 100755 index 0000000..313dda8 Binary files /dev/null and b/bin/mingw32/pcre2-posix.a differ diff --git a/bin/mingw32/rex_pcre2.a b/bin/mingw32/rex_pcre2.a new file mode 100644 index 0000000..f8be1c0 Binary files /dev/null and b/bin/mingw32/rex_pcre2.a differ diff --git a/bin/mingw64/clib/rex_pcre2.dll b/bin/mingw64/clib/rex_pcre2.dll new file mode 100755 index 0000000..c8eb4a7 Binary files /dev/null and b/bin/mingw64/clib/rex_pcre2.dll differ diff --git a/bin/mingw64/pcre2-8.a b/bin/mingw64/pcre2-8.a new file mode 100755 index 0000000..1cff13c Binary files /dev/null and b/bin/mingw64/pcre2-8.a differ diff --git a/bin/mingw64/pcre2-posix.a b/bin/mingw64/pcre2-posix.a new file mode 100755 index 0000000..636eb41 Binary files /dev/null and b/bin/mingw64/pcre2-posix.a differ diff --git a/bin/mingw64/rex_pcre2.a b/bin/mingw64/rex_pcre2.a new file mode 100644 index 0000000..41b2df7 Binary files /dev/null and b/bin/mingw64/rex_pcre2.a differ diff --git a/bin/osx64/clib/rex_pcre2.so b/bin/osx64/clib/rex_pcre2.so new file mode 100755 index 0000000..4c91409 Binary files /dev/null and b/bin/osx64/clib/rex_pcre2.so differ diff --git a/bin/osx64/libpcre2-8.a b/bin/osx64/libpcre2-8.a new file mode 100644 index 0000000..01de733 Binary files /dev/null and b/bin/osx64/libpcre2-8.a differ diff --git a/bin/osx64/libpcre2-posix.a b/bin/osx64/libpcre2-posix.a new file mode 100644 index 0000000..936233f Binary files /dev/null and b/bin/osx64/libpcre2-posix.a differ diff --git a/bin/osx64/librex_pcre2.a b/bin/osx64/librex_pcre2.a new file mode 100644 index 0000000..c2f760d Binary files /dev/null and b/bin/osx64/librex_pcre2.a differ diff --git a/csrc/rex_pcre2/COPYING b/csrc/rex_pcre2/COPYING new file mode 100644 index 0000000..c233950 --- /dev/null +++ b/csrc/rex_pcre2/COPYING @@ -0,0 +1,5 @@ +PCRE2 LICENCE + +Please see the file LICENCE in the PCRE2 distribution for licensing details. + +End diff --git a/csrc/rex_pcre2/HACKING b/csrc/rex_pcre2/HACKING new file mode 100644 index 0000000..f99616a --- /dev/null +++ b/csrc/rex_pcre2/HACKING @@ -0,0 +1,826 @@ +Technical Notes about PCRE2 +--------------------------- + +These are very rough technical notes that record potentially useful information +about PCRE2 internals. PCRE2 is a library based on the original PCRE library, +but with a revised (and incompatible) API. To avoid confusion, the original +library is referred to as PCRE1 below. For information about testing PCRE2, see +the pcre2test documentation and the comment at the head of the RunTest file. + +PCRE1 releases were up to 8.3x when PCRE2 was developed, and later bug fix +releases remain in the 8.xx series. PCRE2 releases started at 10.00 to avoid +confusion with PCRE1. + + +Historical note 1 +----------------- + +Many years ago I implemented some regular expression functions to an algorithm +suggested by Martin Richards. The rather simple patterns were not Unix-like in +form, and were quite restricted in what they could do by comparison with Perl. +The interesting part about the algorithm was that the amount of space required +to hold the compiled form of an expression was known in advance. The code to +apply an expression did not operate by backtracking, as the original Henry +Spencer code and current PCRE2 and Perl code does, but instead checked all +possibilities simultaneously by keeping a list of current states and checking +all of them as it advanced through the subject string. In the terminology of +Jeffrey Friedl's book, it was a "DFA algorithm", though it was not a +traditional Finite State Machine (FSM). When the pattern was all used up, all +remaining states were possible matches, and the one matching the longest subset +of the subject string was chosen. This did not necessarily maximize the +individual wild portions of the pattern, as is expected in Unix and Perl-style +regular expressions. + + +Historical note 2 +----------------- + +By contrast, the code originally written by Henry Spencer (which was +subsequently heavily modified for Perl) compiles the expression twice: once in +a dummy mode in order to find out how much store will be needed, and then for +real. (The Perl version probably doesn't do this any more; I'm talking about +the original library.) The execution function operates by backtracking and +maximizing (or, optionally, minimizing, in Perl) the amount of the subject that +matches individual wild portions of the pattern. This is an "NFA algorithm" in +Friedl's terminology. + + +OK, here's the real stuff +------------------------- + +For the set of functions that formed the original PCRE1 library in 1997 (which +are unrelated to those mentioned above), I tried at first to invent an +algorithm that used an amount of store bounded by a multiple of the number of +characters in the pattern, to save on compiling time. However, because of the +greater complexity in Perl regular expressions, I couldn't do this, even though +the then current Perl 5.004 patterns were much simpler than those supported +nowadays. In any case, a first pass through the pattern is helpful for other +reasons. + + +Support for 16-bit and 32-bit data strings +------------------------------------------- + +The PCRE2 library can be compiled in any combination of 8-bit, 16-bit or 32-bit +modes, creating up to three different libraries. In the description that +follows, the word "short" is used for a 16-bit data quantity, and the phrase +"code unit" is used for a quantity that is a byte in 8-bit mode, a short in +16-bit mode and a 32-bit word in 32-bit mode. The names of PCRE2 functions are +given in generic form, without the _8, _16, or _32 suffix. + + +Computing the memory requirement: how it was +-------------------------------------------- + +Up to and including release 6.7, PCRE1 worked by running a very degenerate +first pass to calculate a maximum memory requirement, and then a second pass to +do the real compile - which might use a bit less than the predicted amount of +memory. The idea was that this would turn out faster than the Henry Spencer +code because the first pass is degenerate and the second pass can just store +stuff straight into memory, which it knows is big enough. + + +Computing the memory requirement: how it is +------------------------------------------- + +By the time I was working on a potential 6.8 release, the degenerate first pass +had become very complicated and hard to maintain. Indeed one of the early +things I did for 6.8 was to fix Yet Another Bug in the memory computation. Then +I had a flash of inspiration as to how I could run the real compile function in +a "fake" mode that enables it to compute how much memory it would need, while +in most cases only ever using a small amount of working memory, and without too +many tests of the mode that might slow it down. So I refactored the compiling +functions to work this way. This got rid of about 600 lines of source and made +further maintenance and development easier. As this was such a major change, I +never released 6.8, instead upping the number to 7.0 (other quite major changes +were also present in the 7.0 release). + +A side effect of this work was that the previous limit of 200 on the nesting +depth of parentheses was removed. However, there was a downside: compiling ran +more slowly than before (30% or more, depending on the pattern) because it now +did a full analysis of the pattern. My hope was that this would not be a big +issue, and in the event, nobody has commented on it. + +At release 8.34, a limit on the nesting depth of parentheses was re-introduced +(default 250, settable at build time) so as to put a limit on the amount of +system stack used by the compile function, which uses recursive function calls +for nested parenthesized groups. This is a safety feature for environments with +small stacks where the patterns are provided by users. + + +Yet another pattern scan +------------------------ + +History repeated itself for PCRE2 release 10.20. A number of bugs relating to +named subpatterns had been discovered by fuzzers. Most of these were related to +the handling of forward references when it was not known if the named group was +unique. (References to non-unique names use a different opcode and more +memory.) The use of duplicate group numbers (the (?| facility) also caused +issues. + +To get around these problems I adopted a new approach by adding a third pass +over the pattern (really a "pre-pass"), which did nothing other than identify +all the named subpatterns and their corresponding group numbers. This means +that the actual compile (both the memory-computing dummy run and the real +compile) has full knowledge of group names and numbers throughout. Several +dozen lines of messy code were eliminated, though the new pre-pass was not +short. In particular, parsing and skipping over [] classes is complicated. + +While working on 10.22 I realized that I could simplify yet again by moving +more of the parsing into the pre-pass, thus avoiding doing it in two places, so +after 10.22 was released, the code underwent yet another big refactoring. This +is how it is from 10.23 onwards: + +The function called parse_regex() scans the pattern characters, parsing them +into literal data and meta characters. It converts escapes such as \x{123} +into literals, handles \Q...\E, and skips over comments and non-significant +white space. The result of the scanning is put into a vector of 32-bit unsigned +integers. Values less than 0x80000000 are literal data. Higher values represent +meta-characters. The top 16-bits of such values identify the meta-character, +and these are given names such as META_CAPTURE. The lower 16-bits are available +for data, for example, the capturing group number. The only situation in which +literal data values greater than 0x7fffffff can appear is when the 32-bit +library is running in non-UTF mode. This is handled by having a special +meta-character that is followed by the 32-bit data value. + +The size of the parsed pattern vector, when auto-callouts are not enabled, is +bounded by the length of the pattern (with one exception). The code is written +so that each item in the pattern uses no more vector elements than the number +of code units in the item itself. The exception is the aforementioned large +32-bit number handling. For this reason, 32-bit non-UTF patterns are scanned in +advance to check for such values. When auto-callouts are enabled, the generous +assumption is made that there will be a callout for each pattern code unit +(which of course is only actually true if all code units are literals) plus one +at the end. There is a default parsed pattern vector on the system stack, but +if this is not big enough, heap memory is used. + +As before, the actual compiling function is run twice, the first time to +determine the amount of memory needed for the final compiled pattern. It +now processes the parsed pattern vector, not the pattern itself, although some +of the parsed items refer to strings in the pattern - for example, group +names. As escapes and comments have already been processed, the code is a bit +simpler than before. + +Most errors can be diagnosed during the parsing scan. For those that cannot +(for example, "lookbehind assertion is not fixed length"), the parsed code +contains offsets into the pattern so that the actual compiling code can +report where errors are. + + +The elements of the parsed pattern vector +----------------------------------------- + +The word "offset" below means a code unit offset into the pattern. When +PCRE2_SIZE (which is usually size_t) is no bigger than uint32_t, an offset is +stored in a single parsed pattern element. Otherwise (typically on 64-bit +systems) it occupies two elements. The following meta items occupy just one +element, with no data: + +META_ACCEPT (*ACCEPT) +META_ASTERISK * +META_ASTERISK_PLUS *+ +META_ASTERISK_QUERY *? +META_ATOMIC (?> start of atomic group +META_CIRCUMFLEX ^ metacharacter +META_CLASS [ start of non-empty class +META_CLASS_EMPTY [] empty class - only with PCRE2_ALLOW_EMPTY_CLASS +META_CLASS_EMPTY_NOT [^] negative empty class - ditto +META_CLASS_END ] end of non-empty class +META_CLASS_NOT [^ start non-empty negative class +META_COMMIT (*COMMIT) +META_COND_ASSERT (?(?assertion) +META_DOLLAR $ metacharacter +META_DOT . metacharacter +META_END End of pattern (this value is 0x80000000) +META_FAIL (*FAIL) +META_KET ) closing parenthesis +META_LOOKAHEAD (?= start of lookahead +META_LOOKAHEADNOT (?! start of negative lookahead +META_NOCAPTURE (?: no capture parens +META_PLUS + +META_PLUS_PLUS ++ +META_PLUS_QUERY +? +META_PRUNE (*PRUNE) - no argument +META_QUERY ? +META_QUERY_PLUS ?+ +META_QUERY_QUERY ?? +META_RANGE_ESCAPED hyphen in class range with at least one escape +META_RANGE_LITERAL hyphen in class range defined literally +META_SKIP (*SKIP) - no argument +META_THEN (*THEN) - no argument + +The two RANGE values occur only in character classes. They are positioned +between two literals that define the start and end of the range. In an EBCDIC +evironment it is necessary to know whether either of the range values was +specified as an escape. In an ASCII/Unicode environment the distinction is not +relevant. + +The following have data in the lower 16 bits, and may be followed by other data +elements: + +META_ALT | alternation +META_BACKREF back reference +META_CAPTURE start of capturing group +META_ESCAPE non-literal escape sequence +META_RECURSE recursion call + +If the data for META_ALT is non-zero, it is inside a lookbehind, and the data +is the length of its branch, for which OP_REVERSE must be generated. + +META_BACKREF, META_CAPTURE, and META_RECURSE have the capture group number as +their data in the lower 16 bits of the element. + +META_BACKREF is followed by an offset if the back reference group number is 10 +or more. The offsets of the first ocurrences of references to groups whose +numbers are less than 10 are put in cb->small_ref_offset[] (only the first +occurrence is useful). On 64-bit systems this avoids using more than two parsed +pattern elements for items such as \3. The offset is used when an error occurs +because the reference is to a non-existent group. + +META_RECURSE is always followed by an offset, for use in error messages. + +META_ESCAPE has an ESC_xxx value as its data. For ESC_P and ESC_p, the next +element contains the 16-bit type and data property values, packed together. +ESC_g and ESC_k are used only for named references - numerical ones are turned +into META_RECURSE or META_BACKREF as appropriate. ESC_g and ESC_k are followed +by a length and an offset into the pattern to specify the name. + +The following have one data item that follows in the next vector element: + +META_BIGVALUE Next is a literal >= META_END +META_OPTIONS (?i) and friends (data is new option bits) +META_POSIX POSIX class item (data identifies the class) +META_POSIX_NEG negative POSIX class item (ditto) + +The following are followed by a length element, then a number of character code +values (which should match with the length): + +META_MARK (*MARK:xxxx) +META_COMMIT_ARG )*COMMIT:xxxx) +META_PRUNE_ARG (*PRUNE:xxx) +META_SKIP_ARG (*SKIP:xxxx) +META_THEN_ARG (*THEN:xxxx) + +The following are followed by a length element, then an offset in the pattern +that identifies the name: + +META_COND_NAME (?() or (?('name') or (?(name) +META_COND_RNAME (?(R&name) +META_COND_RNUMBER (?(Rdigits) +META_RECURSE_BYNAME (?&name) +META_BACKREF_BYNAME \k'name' + +META_COND_RNUMBER is used for names that start with R and continue with digits, +because this is an ambiguous case. It could be a back reference to a group with +that name, or it could be a recursion test on a numbered group. + +This one is followed by an offset, for use in error messages, then a number: + +META_COND_NUMBER (?([+-]digits) + +The following is followed just by an offset, for use in error messages: + +META_COND_DEFINE (?(DEFINE) + +The following are also followed just by an offset, but also the lower 16 bits +of the main word contain the length of the first branch of the lookbehind +group; this is used when generating OP_REVERSE for that branch. + +META_LOOKBEHIND (?<= +META_LOOKBEHINDNOT (?' and 1 for '>='; +the next two are the major and minor numbers: + +META_COND_VERSION (?(VERSIONx.y) + +Callouts are converted into one of two items: + +META_CALLOUT_NUMBER (?C with numerical argument +META_CALLOUT_STRING (?C with string argument + +In both cases, the next two elements contain the offset and length of the next +item in the pattern. Then there is either one callout number, or a length and +an offset for the string argument. The length includes both delimiters. + + +Traditional matching function +----------------------------- + +The "traditional", and original, matching function is called pcre2_match(), and +it implements an NFA algorithm, similar to the original Henry Spencer algorithm +and the way that Perl works. This is not surprising, since it is intended to be +as compatible with Perl as possible. This is the function most users of PCRE2 +will use most of the time. If PCRE2 is compiled with just-in-time (JIT) +support, and studying a compiled pattern with JIT is successful, the JIT code +is run instead of the normal pcre2_match() code, but the result is the same. + + +Supplementary matching function +------------------------------- + +There is also a supplementary matching function called pcre2_dfa_match(). This +implements a DFA matching algorithm that searches simultaneously for all +possible matches that start at one point in the subject string. (Going back to +my roots: see Historical Note 1 above.) This function intreprets the same +compiled pattern data as pcre2_match(); however, not all the facilities are +available, and those that are do not always work in quite the same way. See the +user documentation for details. + +The algorithm that is used for pcre2_dfa_match() is not a traditional FSM, +because it may have a number of states active at one time. More work would be +needed at compile time to produce a traditional FSM where only one state is +ever active at once. I believe some other regex matchers work this way. JIT +support is not available for this kind of matching. + + +Changeable options +------------------ + +The /i, /m, or /s options (PCRE2_CASELESS, PCRE2_MULTILINE, PCRE2_DOTALL, and +others) may be changed in the middle of patterns by items such as (?i). Their +processing is handled entirely at compile time by generating different opcodes +for the different settings. The runtime functions do not need to keep track of +an option's state. + +PCRE2_DUPNAMES, PCRE2_EXTENDED, PCRE2_EXTENDED_MORE, and PCRE2_NO_AUTO_CAPTURE +are tracked and processed during the parsing pre-pass. The others are handled +from META_OPTIONS items during the main compile phase. + + +Format of compiled patterns +--------------------------- + +The compiled form of a pattern is a vector of unsigned code units (bytes in +8-bit mode, shorts in 16-bit mode, 32-bit words in 32-bit mode), containing +items of variable length. The first code unit in an item contains an opcode, +and the length of the item is either implicit in the opcode or contained in the +data that follows it. + +In many cases listed below, LINK_SIZE data values are specified for offsets +within the compiled pattern. LINK_SIZE always specifies a number of bytes. The +default value for LINK_SIZE is 2, except for the 32-bit library, where it can +only be 4. The 8-bit library can be compiled to used 3-byte or 4-byte values, +and the 16-bit library can be compiled to use 4-byte values, though this +impairs performance. Specifing a LINK_SIZE larger than 2 for these libraries is +necessary only when patterns whose compiled length is greater than 65535 code +units are going to be processed. When a LINK_SIZE value uses more than one code +unit, the most significant unit is first. + +In this description, we assume the "normal" compilation options. Data values +that are counts (e.g. quantifiers) are always two bytes long in 8-bit mode +(most significant byte first), and one code unit in 16-bit and 32-bit modes. + + +Opcodes with no following data +------------------------------ + +These items are all just one unit long: + + OP_END end of pattern + OP_ANY match any one character other than newline + OP_ALLANY match any one character, including newline + OP_ANYBYTE match any single code unit, even in UTF-8/16 mode + OP_SOD match start of data: \A + OP_SOM, start of match (subject + offset): \G + OP_SET_SOM, set start of match (\K) + OP_CIRC ^ (start of data) + OP_CIRCM ^ multiline mode (start of data or after newline) + OP_NOT_WORD_BOUNDARY \W + OP_WORD_BOUNDARY \w + OP_NOT_DIGIT \D + OP_DIGIT \d + OP_NOT_HSPACE \H + OP_HSPACE \h + OP_NOT_WHITESPACE \S + OP_WHITESPACE \s + OP_NOT_VSPACE \V + OP_VSPACE \v + OP_NOT_WORDCHAR \W + OP_WORDCHAR \w + OP_EODN match end of data or newline at end: \Z + OP_EOD match end of data: \z + OP_DOLL $ (end of data, or before final newline) + OP_DOLLM $ multiline mode (end of data or before newline) + OP_EXTUNI match an extended Unicode grapheme cluster + OP_ANYNL match any Unicode newline sequence + + OP_ASSERT_ACCEPT ) + OP_ACCEPT ) These are Perl 5.10's "backtracking control + OP_COMMIT ) verbs". If OP_ACCEPT is inside capturing + OP_FAIL ) parentheses, it may be preceded by one or more + OP_PRUNE ) OP_CLOSE, each followed by a number that + OP_SKIP ) indicates which parentheses must be closed. + OP_THEN ) + +OP_ASSERT_ACCEPT is used when (*ACCEPT) is encountered within an assertion. +This ends the assertion, not the entire pattern match. The assertion (?!) is +always optimized to OP_FAIL. + +OP_ALLANY is used for '.' when PCRE2_DOTALL is set. It is also used for \C in +non-UTF modes and in UTF-32 mode (since one code unit still equals one +character). Another use is for [^] when empty classes are permitted +(PCRE2_ALLOW_EMPTY_CLASS is set). + + +Backtracking control verbs +-------------------------- + +Verbs with no arguments generate opcodes with no following data (as listed +in the section above). + +(*MARK:NAME) generates OP_MARK followed by the mark name, preceded by a +length in one code unit, and followed by a binary zero. The name length is +limited by the size of the code unit. + +(*ACCEPT:NAME) and (*FAIL:NAME) are compiled as (*MARK:NAME)(*ACCEPT) and +(*MARK:NAME)(*FAIL) respectively. + +For (*COMMIT:NAME), (*PRUNE:NAME), (*SKIP:NAME), and (*THEN:NAME), the opcodes +OP_COMMIT_ARG, OP_PRUNE_ARG, OP_SKIP_ARG, and OP_THEN_ARG are used, with the +name following in the same format as for OP_MARK. + + +Matching literal characters +--------------------------- + +The OP_CHAR opcode is followed by a single character that is to be matched +casefully. For caseless matching of characters that have at most two +case-equivalent code points, OP_CHARI is used. In UTF-8 or UTF-16 modes, the +character may be more than one code unit long. In UTF-32 mode, characters are +always exactly one code unit long. + +If there is only one character in a character class, OP_CHAR or OP_CHARI is +used for a positive class, and OP_NOT or OP_NOTI for a negative one (that is, +for something like [^a]). + +Caseless matching (positive or negative) of characters that have more than two +case-equivalent code points (which is possible only in UTF mode) is handled by +compiling a Unicode property item (see below), with the pseudo-property +PT_CLIST. The value of this property is an offset in a vector called +"ucd_caseless_sets" which identifies the start of a short list of equivalent +characters, terminated by the value NOTACHAR (0xffffffff). + + +Repeating single characters +--------------------------- + +The common repeats (*, +, ?), when applied to a single character, use the +following opcodes, which come in caseful and caseless versions: + + Caseful Caseless + OP_STAR OP_STARI + OP_MINSTAR OP_MINSTARI + OP_POSSTAR OP_POSSTARI + OP_PLUS OP_PLUSI + OP_MINPLUS OP_MINPLUSI + OP_POSPLUS OP_POSPLUSI + OP_QUERY OP_QUERYI + OP_MINQUERY OP_MINQUERYI + OP_POSQUERY OP_POSQUERYI + +Each opcode is followed by the character that is to be repeated. In ASCII or +UTF-32 modes, these are two-code-unit items; in UTF-8 or UTF-16 modes, the +length is variable. Those with "MIN" in their names are the minimizing +versions. Those with "POS" in their names are possessive versions. Other kinds +of repeat make use of these opcodes: + + Caseful Caseless + OP_UPTO OP_UPTOI + OP_MINUPTO OP_MINUPTOI + OP_POSUPTO OP_POSUPTOI + OP_EXACT OP_EXACTI + +Each of these is followed by a count and then the repeated character. The count +is two bytes long in 8-bit mode (most significant byte first), or one code unit +in 16-bit and 32-bit modes. + +OP_UPTO matches from 0 to the given number. A repeat with a non-zero minimum +and a fixed maximum is coded as an OP_EXACT followed by an OP_UPTO (or +OP_MINUPTO or OPT_POSUPTO). + +Another set of matching repeating opcodes (called OP_NOTSTAR, OP_NOTSTARI, +etc.) are used for repeated, negated, single-character classes such as [^a]*. +The normal single-character opcodes (OP_STAR, etc.) are used for repeated +positive single-character classes. + + +Repeating character types +------------------------- + +Repeats of things like \d are done exactly as for single characters, except +that instead of a character, the opcode for the type (e.g. OP_DIGIT) is stored +in the next code unit. The opcodes are: + + OP_TYPESTAR + OP_TYPEMINSTAR + OP_TYPEPOSSTAR + OP_TYPEPLUS + OP_TYPEMINPLUS + OP_TYPEPOSPLUS + OP_TYPEQUERY + OP_TYPEMINQUERY + OP_TYPEPOSQUERY + OP_TYPEUPTO + OP_TYPEMINUPTO + OP_TYPEPOSUPTO + OP_TYPEEXACT + + +Match by Unicode property +------------------------- + +OP_PROP and OP_NOTPROP are used for positive and negative matches of a +character by testing its Unicode property (the \p and \P escape sequences). +Each is followed by two code units that encode the desired property as a type +and a value. The types are a set of #defines of the form PT_xxx, and the values +are enumerations of the form ucp_xx, defined in the pcre2_ucp.h source file. +The value is relevant only for PT_GC (General Category), PT_PC (Particular +Category), PT_SC (Script), and the pseudo-property PT_CLIST, which is used to +identify a list of case-equivalent characters when there are three or more. + +Repeats of these items use the OP_TYPESTAR etc. set of opcodes, followed by +three code units: OP_PROP or OP_NOTPROP, and then the desired property type and +value. + + +Character classes +----------------- + +If there is only one character in a class, OP_CHAR or OP_CHARI is used for a +positive class, and OP_NOT or OP_NOTI for a negative one (that is, for +something like [^a]), except when caselessly matching a character that has more +than two case-equivalent code points (which can happen only in UTF mode). In +this case a Unicode property item is used, as described above in "Matching +literal characters". + +A set of repeating opcodes (called OP_NOTSTAR etc.) are used for repeated, +negated, single-character classes. The normal single-character opcodes +(OP_STAR, etc.) are used for repeated positive single-character classes. + +When there is more than one character in a class, and all the code points are +less than 256, OP_CLASS is used for a positive class, and OP_NCLASS for a +negative one. In either case, the opcode is followed by a 32-byte (16-short, +8-word) bit map containing a 1 bit for every character that is acceptable. The +bits are counted from the least significant end of each unit. In caseless mode, +bits for both cases are set. + +The reason for having both OP_CLASS and OP_NCLASS is so that, in UTF-8 and +16-bit and 32-bit modes, subject characters with values greater than 255 can be +handled correctly. For OP_CLASS they do not match, whereas for OP_NCLASS they +do. + +For classes containing characters with values greater than 255 or that contain +\p or \P, OP_XCLASS is used. It optionally uses a bit map if any acceptable +code points are less than 256, followed by a list of pairs (for a range) and/or +single characters and/or properties. In caseless mode, all equivalent +characters are explicitly listed. + +OP_XCLASS is followed by a LINK_SIZE value containing the total length of the +opcode and its data. This is followed by a code unit containing flag bits: +XCL_NOT indicates that this is a negative class, and XCL_MAP indicates that a +bit map is present. There follows the bit map, if XCL_MAP is set, and then a +sequence of items coded as follows: + + XCL_END marks the end of the list + XCL_SINGLE one character follows + XCL_RANGE two characters follow + XCL_PROP a Unicode property (type, value) follows + XCL_NOTPROP a Unicode property (type, value) follows + +If a range starts with a code point less than 256 and ends with one greater +than 255, it is split into two ranges, with characters less than 256 being +indicated in the bit map, and the rest with XCL_RANGE. + +When XCL_NOT is set, the bit map, if present, contains bits for characters that +are allowed (exactly as for OP_NCLASS), but the list of items that follow it +specifies characters and properties that are not allowed. + + +Back references +--------------- + +OP_REF (caseful) or OP_REFI (caseless) is followed by a count containing the +reference number when the reference is to a unique capturing group (either by +number or by name). When named groups are used, there may be more than one +group with the same name. In this case, a reference to such a group by name +generates OP_DNREF or OP_DNREFI. These are followed by two counts: the index +(not the byte offset) in the group name table of the first entry for the +required name, followed by the number of groups with the same name. The +matching code can then search for the first one that is set. + + +Repeating character classes and back references +----------------------------------------------- + +Single-character classes are handled specially (see above). This section +applies to other classes and also to back references. In both cases, the repeat +information follows the base item. The matching code looks at the following +opcode to see if it is one of these: + + OP_CRSTAR + OP_CRMINSTAR + OP_CRPOSSTAR + OP_CRPLUS + OP_CRMINPLUS + OP_CRPOSPLUS + OP_CRQUERY + OP_CRMINQUERY + OP_CRPOSQUERY + OP_CRRANGE + OP_CRMINRANGE + OP_CRPOSRANGE + +All but the last three are single-code-unit items, with no data. The range +opcodes are followed by the minimum and maximum repeat counts. + + +Brackets and alternation +------------------------ + +A pair of non-capturing round brackets is wrapped round each expression at +compile time, so alternation always happens in the context of brackets. + +[Note for North Americans: "bracket" to some English speakers, including +myself, can be round, square, curly, or pointy. Hence this usage rather than +"parentheses".] + +Non-capturing brackets use the opcode OP_BRA, capturing brackets use OP_CBRA. A +bracket opcode is followed by a LINK_SIZE value which gives the offset to the +next alternative OP_ALT or, if there aren't any branches, to the terminating +opcode. Each OP_ALT is followed by a LINK_SIZE value giving the offset to the +next one, or to the final opcode. For capturing brackets, the bracket number is +a count that immediately follows the offset. + +There are several opcodes that mark the end of a subpattern group. OP_KET is +used for subpatterns that do not repeat indefinitely, OP_KETRMIN and +OP_KETRMAX are used for indefinite repetitions, minimally or maximally +respectively, and OP_KETRPOS for possessive repetitions (see below for more +details). All four are followed by a LINK_SIZE value giving (as a positive +number) the offset back to the matching bracket opcode. + +If a subpattern is quantified such that it is permitted to match zero times, it +is preceded by one of OP_BRAZERO, OP_BRAMINZERO, or OP_SKIPZERO. These are +single-unit opcodes that tell the matcher that skipping the following +subpattern entirely is a valid match. In the case of the first two, not +skipping the pattern is also valid (greedy and non-greedy). The third is used +when a pattern has the quantifier {0,0}. It cannot be entirely discarded, +because it may be called as a subroutine from elsewhere in the pattern. + +A subpattern with an indefinite maximum repetition is replicated in the +compiled data its minimum number of times (or once with OP_BRAZERO if the +minimum is zero), with the final copy terminating with OP_KETRMIN or OP_KETRMAX +as appropriate. + +A subpattern with a bounded maximum repetition is replicated in a nested +fashion up to the maximum number of times, with OP_BRAZERO or OP_BRAMINZERO +before each replication after the minimum, so that, for example, (abc){2,5} is +compiled as (abc)(abc)((abc)((abc)(abc)?)?)?, except that each bracketed group +has the same number. + +When a repeated subpattern has an unbounded upper limit, it is checked to see +whether it could match an empty string. If this is the case, the opcode in the +final replication is changed to OP_SBRA or OP_SCBRA. This tells the matcher +that it needs to check for matching an empty string when it hits OP_KETRMIN or +OP_KETRMAX, and if so, to break the loop. + + +Possessive brackets +------------------- + +When a repeated group (capturing or non-capturing) is marked as possessive by +the "+" notation, e.g. (abc)++, different opcodes are used. Their names all +have POS on the end, e.g. OP_BRAPOS instead of OP_BRA and OP_SCBRAPOS instead +of OP_SCBRA. The end of such a group is marked by OP_KETRPOS. If the minimum +repetition is zero, the group is preceded by OP_BRAPOSZERO. + + +Once-only (atomic) groups +------------------------- + +These are just like other subpatterns, but they start with the opcode OP_ONCE. +The check for matching an empty string in an unbounded repeat is handled +entirely at runtime, so there is just this one opcode for atomic groups. + + +Assertions +---------- + +Forward assertions are also just like other subpatterns, but starting with one +of the opcodes OP_ASSERT or OP_ASSERT_NOT. Backward assertions use the opcodes +OP_ASSERTBACK and OP_ASSERTBACK_NOT, and the first opcode inside the assertion +is OP_REVERSE, followed by a count of the number of characters to move back the +pointer in the subject string. In ASCII or UTF-32 mode, the count is also the +number of code units, but in UTF-8/16 mode each character may occupy more than +one code unit. A separate count is present in each alternative of a lookbehind +assertion, allowing them to have different (but fixed) lengths. + + +Conditional subpatterns +----------------------- + +These are like other subpatterns, but they start with the opcode OP_COND, or +OP_SCOND for one that might match an empty string in an unbounded repeat. + +If the condition is a back reference, this is stored at the start of the +subpattern using the opcode OP_CREF followed by a count containing the +reference number, provided that the reference is to a unique capturing group. +If the reference was by name and there is more than one group with that name, +OP_DNCREF is used instead. It is followed by two counts: the index in the group +names table, and the number of groups with the same name. The allows the +matcher to check if any group with the given name is set. + +If the condition is "in recursion" (coded as "(?(R)"), or "in recursion of +group x" (coded as "(?(Rx)"), the group number is stored at the start of the +subpattern using the opcode OP_RREF (with a value of RREF_ANY (0xffff) for "the +whole pattern") or OP_DNRREF (with data as for OP_DNCREF). + +For a DEFINE condition, OP_FALSE is used (with no associated data). During +compilation, however, a DEFINE condition is coded as OP_DEFINE so that, when +the conditional group is complete, there can be a check to ensure that it +contains only one top-level branch. Once this has happened, the opcode is +changed to OP_FALSE, so the matcher never sees OP_DEFINE. + +There is a special PCRE2-specific condition of the form (VERSION[>]=x.y), which +tests the PCRE2 version number. This compiles into one of the opcodes OP_TRUE +or OP_FALSE. + +If a condition is not a back reference, recursion test, DEFINE, or VERSION, it +must start with a parenthesized assertion, whose opcode normally immediately +follows OP_COND or OP_SCOND. However, if automatic callouts are enabled, a +callout is inserted immediately before the assertion. It is also possible to +insert a manual callout at this point. Only assertion conditions may have +callouts preceding the condition. + +A condition that is the negative assertion (?!) is optimized to OP_FAIL in all +parts of the pattern, so this is another opcode that may appear as a condition. +It is treated the same as OP_FALSE. + + +Recursion +--------- + +Recursion either matches the current pattern, or some subexpression. The opcode +OP_RECURSE is followed by a LINK_SIZE value that is the offset to the starting +bracket from the start of the whole pattern. OP_RECURSE is also used for +"subroutine" calls, even though they are not strictly a recursion. Up till +release 10.30 recursions were treated as atomic groups, making them +incompatible with Perl (but PCRE had them well before Perl did). From 10.30, +backtracking into recursions is supported. + +Repeated recursions used to be wrapped inside OP_ONCE brackets, which not only +forced no backtracking, but also allowed repetition to be handled as for other +bracketed groups. From 10.30 onwards, repeated recursions are duplicated for +their minimum repetitions, and then wrapped in non-capturing brackets for the +remainder. For example, (?1){3} is treated as (?1)(?1)(?1), and (?1){2,4} is +treated as (?1)(?1)(?:(?1)){0,2}. + + +Callouts +-------- + +A callout may have either a numerical argument or a string argument. These use +OP_CALLOUT or OP_CALLOUT_STR, respectively. In each case these are followed by +two LINK_SIZE values giving the offset in the pattern string to the start of +the following item, and another count giving the length of this item. These +values make it possible for pcre2test to output useful tracing information +using callouts. + +In the case of a numeric callout, after these two values there is a single code +unit containing the callout number, in the range 0-255, with 255 being used for +callouts that are automatically inserted as a result of the PCRE2_AUTO_CALLOUT +option. Thus, this opcode item is of fixed length: + + [OP_CALLOUT] [PATTERN_OFFSET] [PATTERN_LENGTH] [NUMBER] + +For callouts with string arguments, OP_CALLOUT_STR has three more data items: +a LINK_SIZE value giving the complete length of the entire opcode item, a +LINK_SIZE item containing the offset within the pattern string to the start of +the string argument, and the string itself, preceded by its starting delimiter +and followed by a binary zero. When a callout function is called, a pointer to +the actual string is passed, but the delimiter can be accessed as string[-1] if +the application needs it. In the 8-bit library, the callout in /X(?C'abc')Y/ is +compiled as the following bytes (decimal numbers represent binary values): + + [OP_CALLOUT_STR] [0] [10] [0] [1] [0] [14] [0] [5] ['] [a] [b] [c] [0] + -------- ------- -------- ------- + | | | | + ------- LINK_SIZE items ------ + +Opcode table checking +--------------------- + +The last opcode that is defined in pcre2_internal.h is OP_TABLE_LENGTH. This is +not a real opcode, but is used to check at compile time that tables indexed by +opcode are the correct length, in order to catch updating errors. + +Philip Hazel +20 July 2018 diff --git a/csrc/rex_pcre2/LICENCE b/csrc/rex_pcre2/LICENCE new file mode 100644 index 0000000..142b3b3 --- /dev/null +++ b/csrc/rex_pcre2/LICENCE @@ -0,0 +1,94 @@ +PCRE2 LICENCE +------------- + +PCRE2 is a library of functions to support regular expressions whose syntax +and semantics are as close as possible to those of the Perl 5 language. + +Releases 10.00 and above of PCRE2 are distributed under the terms of the "BSD" +licence, as specified below, with one exemption for certain binary +redistributions. The documentation for PCRE2, supplied in the "doc" directory, +is distributed under the same terms as the software itself. The data in the +testdata directory is not copyrighted and is in the public domain. + +The basic library functions are written in C and are freestanding. Also +included in the distribution is a just-in-time compiler that can be used to +optimize pattern matching. This is an optional feature that can be omitted when +the library is built. + + +THE BASIC LIBRARY FUNCTIONS +--------------------------- + +Written by: Philip Hazel +Email local part: ph10 +Email domain: cam.ac.uk + +University of Cambridge Computing Service, +Cambridge, England. + +Copyright (c) 1997-2019 University of Cambridge +All rights reserved. + + +PCRE2 JUST-IN-TIME COMPILATION SUPPORT +-------------------------------------- + +Written by: Zoltan Herczeg +Email local part: hzmester +Email domain: freemail.hu + +Copyright(c) 2010-2019 Zoltan Herczeg +All rights reserved. + + +STACK-LESS JUST-IN-TIME COMPILER +-------------------------------- + +Written by: Zoltan Herczeg +Email local part: hzmester +Email domain: freemail.hu + +Copyright(c) 2009-2019 Zoltan Herczeg +All rights reserved. + + +THE "BSD" LICENCE +----------------- + +Redistribution and use in source and binary forms, with or without +modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notices, + this list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright + notices, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + * Neither the name of the University of Cambridge nor the names of any + contributors may be used to endorse or promote products derived from this + software without specific prior written permission. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE +POSSIBILITY OF SUCH DAMAGE. + + +EXEMPTION FOR BINARY LIBRARY-LIKE PACKAGES +------------------------------------------ + +The second condition in the BSD licence (covering binary redistributions) does +not apply all the way down a chain of software. If binary package A includes +PCRE2, it must respect the condition, but if package B is software that +includes package A, the condition is not imposed on package B unless it uses +PCRE2 independently. + +End diff --git a/csrc/rex_pcre2/NEWS b/csrc/rex_pcre2/NEWS new file mode 100644 index 0000000..bd0df86 --- /dev/null +++ b/csrc/rex_pcre2/NEWS @@ -0,0 +1,296 @@ +News about PCRE2 releases +------------------------- + + +Version 10.33-RC1 16-April-2019 +------------------------------- + +Yet more bugfixes, tidies, and a few enhancements, summarized here (see +ChangeLog for the full list): + +1. Callouts from pcre2_substitute() are now available. + +2. The POSIX functions are now all called pcre2_regcomp() etc., with wrapper +functions that use the standard POSIX names. However, in pcre2posix.h the POSIX +names are defined as macros. This should help avoid linking with the wrong +library in some environments, while still exporting the POSIX names for +pre-existing programs that use them. + +3. Some new options: + + (a) PCRE2_EXTRA_ESCAPED_CR_IS_LF makes \r behave as \n. + + (b) PCRE2_EXTRA_ALT_BSUX enables support for ECMAScript 6's \u{hh...} + construct. + + (c) PCRE2_COPY_MATCHED_SUBJECT causes a copy of a matched subject to be + made, instead of just remembering a pointer. + +4. Some new Perl features: + + (a) Perl 5.28's experimental alphabetic names for atomic groups and + lookaround assertions, for example, (*pla:...) and (*atomic:...). + + (b) The new Perl "script run" features (*script_run:...) and + (*atomic_script_run:...) aka (*sr:...) and (*asr:...). + + (c) When PCRE2_UTF is set, allow non-ASCII letters and decimal digits in + capture group names. + +5. --disable-percent-zt disables the use of %zu and %td in formatting strings +in pcre2test. They were already automatically disabled for VC and older C +compilers. + +6. Some changes related to callouts in pcre2grep: + + (a) Support for running an external program under VMS has been added, in + addition to Windows and fork() support. + + (b) --disable-pcre2grep-callout-fork restricts the callout support in + to the inbuilt echo facility. + + +Version 10.32 10-September-2018 +------------------------------- + +This is another mainly bugfix and tidying release with a few minor +enhancements. These are the main ones: + +1. pcre2grep now supports the inclusion of binary zeros in patterns that are +read from files via the -f option. + +2. ./configure now supports --enable-jit=auto, which automatically enables JIT +if the hardware supports it. + +3. In pcre2_dfa_match(), internal recursive calls no longer use the stack for +local workspace and local ovectors. Instead, an initial block of stack is +reserved, but if this is insufficient, heap memory is used. The heap limit +parameter now applies to pcre2_dfa_match(). + +4. Updated to Unicode version 11.0.0. + +5. (*ACCEPT:ARG), (*FAIL:ARG), and (*COMMIT:ARG) are now supported. + +6. Added support for \N{U+dddd}, but only in Unicode mode. + +7. Added support for (?^) to unset all imnsx options. + + +Version 10.31 12-February-2018 +------------------------------ + +This is mainly a bugfix and tidying release (see ChangeLog for full details). +However, there are some minor enhancements. + +1. New pcre2_config() options: PCRE2_CONFIG_NEVER_BACKSLASH_C and +PCRE2_CONFIG_COMPILED_WIDTHS. + +2. New pcre2_pattern_info() option PCRE2_INFO_EXTRAOPTIONS to retrieve the +extra compile time options. + +3. There are now public names for all the pcre2_compile() error numbers. + +4. Added PCRE2_CALLOUT_STARTMATCH and PCRE2_CALLOUT_BACKTRACK bits to a new +field callout_flags in callout blocks. + + +Version 10.30 14-August-2017 +---------------------------- + +The full list of changes that includes bugfixes and tidies is, as always, in +ChangeLog. These are the most important new features: + +1. The main interpreter, pcre2_match(), has been refactored into a new version +that does not use recursive function calls (and therefore the system stack) for +remembering backtracking positions. This makes --disable-stack-for-recursion a +NOOP. The new implementation allows backtracking into recursive group calls in +patterns, making it more compatible with Perl, and also fixes some other +previously hard-to-do issues. For patterns that have a lot of backtracking, the +heap is now used, and there is an explicit limit on the amount, settable by +pcre2_set_heap_limit() or (*LIMIT_HEAP=xxx). The "recursion limit" is retained, +but is renamed as "depth limit" (though the old names remain for +compatibility). + +There is also a change in the way callouts from pcre2_match() are handled. The +offset_vector field in the callout block is no longer a pointer to the +actual ovector that was passed to the matching function in the match data +block. Instead it points to an internal ovector of a size large enough to hold +all possible captured substrings in the pattern. + +2. The new option PCRE2_ENDANCHORED insists that a pattern match must end at +the end of the subject. + +3. The new option PCRE2_EXTENDED_MORE implements Perl's /xx feature, and +pcre2test is upgraded to support it. Setting within the pattern by (?xx) is +also supported. + +4. (?n) can be used to set PCRE2_NO_AUTO_CAPTURE, because Perl now has this. + +5. Additional compile options in the compile context are now available, and the +first two are: PCRE2_EXTRA_ALLOW_SURROGATE_ESCAPES and +PCRE2_EXTRA_BAD_ESCAPE_IS_LITERAL. + +6. The newline type PCRE2_NEWLINE_NUL is now available. + +7. The match limit value now also applies to pcre2_dfa_match() as there are +patterns that can use up a lot of resources without necessarily recursing very +deeply. + +8. The option REG_PEND (a GNU extension) is now available for the POSIX +wrapper. Also there is a new option PCRE2_LITERAL which is used to support +REG_NOSPEC. + +9. PCRE2_EXTRA_MATCH_LINE and PCRE2_EXTRA_MATCH_WORD are implemented for the +benefit of pcre2grep, and pcre2grep's -F, -w, and -x options are re-implemented +using PCRE2_LITERAL, PCRE2_EXTRA_MATCH_WORD, and PCRE2_EXTRA_MATCH_LINE. This +is tidier and also fixes some bugs. + +10. The Unicode tables are upgraded from Unicode 8.0.0 to Unicode 10.0.0. + +11. There are some experimental functions for converting foreign patterns +(globs and POSIX patterns) into PCRE2 patterns. + + +Version 10.23 14-February-2017 +------------------------------ + +1. ChangeLog has the details of a lot of bug fixes and tidies. + +2. There has been a major re-factoring of the pcre2_compile.c file. Most syntax +checking is now done in the pre-pass that identifies capturing groups. This has +reduced the amount of duplication and made the code tidier. While doing this, +some minor bugs and Perl incompatibilities were fixed (see ChangeLog for +details.) + +3. Back references are now permitted in lookbehind assertions when there are +no duplicated group numbers (that is, (?| has not been used), and, if the +reference is by name, there is only one group of that name. The referenced +group must, of course be of fixed length. + +4. \g{+} (e.g. \g{+2} ) is now supported. It is a "forward back +reference" and can be useful in repetitions (compare \g{-} ). Perl does +not recognize this syntax. + +5. pcre2grep now automatically expands its buffer up to a maximum set by +--max-buffer-size. + +6. The -t option (grand total) has been added to pcre2grep. + +7. A new function called pcre2_code_copy_with_tables() exists to copy a +compiled pattern along with a private copy of the character tables that is +uses. + +8. A user supplied a number of patches to upgrade pcre2grep under Windows and +tidy the code. + +9. Several updates have been made to pcre2test and test scripts (see +ChangeLog). + + +Version 10.22 29-July-2016 +-------------------------- + +1. ChangeLog has the details of a number of bug fixes. + +2. The POSIX wrapper function regcomp() did not used to support back references +and subroutine calls if called with the REG_NOSUB option. It now does. + +3. A new function, pcre2_code_copy(), is added, to make a copy of a compiled +pattern. + +4. Support for string callouts is added to pcre2grep. + +5. Added the PCRE2_NO_JIT option to pcre2_match(). + +6. The pcre2_get_error_message() function now returns with a negative error +code if the error number it is given is unknown. + +7. Several updates have been made to pcre2test and test scripts (see +ChangeLog). + + +Version 10.21 12-January-2016 +----------------------------- + +1. Many bugs have been fixed. A large number of them were provoked only by very +strange pattern input, and were discovered by fuzzers. Some others were +discovered by code auditing. See ChangeLog for details. + +2. The Unicode tables have been updated to Unicode version 8.0.0. + +3. For Perl compatibility in EBCDIC environments, ranges such as a-z in a +class, where both values are literal letters in the same case, omit the +non-letter EBCDIC code points within the range. + +4. There have been a number of enhancements to the pcre2_substitute() function, +giving more flexibility to replacement facilities. It is now also possible to +cause the function to return the needed buffer size if the one given is too +small. + +5. The PCRE2_ALT_VERBNAMES option causes the "name" parts of special verbs such +as (*THEN:name) to be processed for backslashes and to take note of +PCRE2_EXTENDED. + +6. PCRE2_INFO_HASBACKSLASHC makes it possible for a client to find out if a +pattern uses \C, and --never-backslash-C makes it possible to compile a version +PCRE2 in which the use of \C is always forbidden. + +7. A limit to the length of pattern that can be handled can now be set by +calling pcre2_set_max_pattern_length(). + +8. When matching an unanchored pattern, a match can be required to begin within +a given number of code units after the start of the subject by calling +pcre2_set_offset_limit(). + +9. The pcre2test program has been extended to test new facilities, and it can +now run the tests when LF on its own is not a valid newline sequence. + +10. The RunTest script has also been updated to enable more tests to be run. + +11. There have been some minor performance enhancements. + + +Version 10.20 30-June-2015 +-------------------------- + +1. Callouts with string arguments and the pcre2_callout_enumerate() function +have been implemented. + +2. The PCRE2_NEVER_BACKSLASH_C option, which locks out the use of \C, is added. + +3. The PCRE2_ALT_CIRCUMFLEX option lets ^ match after a newline at the end of a +subject in multiline mode. + +4. The way named subpatterns are handled has been refactored. The previous +approach had several bugs. + +5. The handling of \c in EBCDIC environments has been changed to conform to the +perlebcdic document. This is an incompatible change. + +6. Bugs have been mended, many of them discovered by fuzzers. + + +Version 10.10 06-March-2015 +--------------------------- + +1. Serialization and de-serialization functions have been added to the API, +making it possible to save and restore sets of compiled patterns, though +restoration must be done in the same environment that was used for compilation. + +2. The (*NO_JIT) feature has been added; this makes it possible for a pattern +creator to specify that JIT is not to be used. + +3. A number of bugs have been fixed. In particular, bugs that caused building +on Windows using CMake to fail have been mended. + + +Version 10.00 05-January-2015 +----------------------------- + +Version 10.00 is the first release of PCRE2, a revised API for the PCRE +library. Changes prior to 10.00 are logged in the ChangeLog file for the old +API, up to item 20 for release 8.36. New programs are recommended to use the +new library. Programs that use the original (PCRE1) API will need changing +before linking with the new library. + +**** diff --git a/README.rst b/csrc/rex_pcre2/README.rst similarity index 85% rename from README.rst rename to csrc/rex_pcre2/README.rst index a846740..2b58ff7 100644 --- a/README.rst +++ b/csrc/rex_pcre2/README.rst @@ -8,8 +8,8 @@ Lrexlib (POSIX_, PCRE_, PCRE2_, GNU_, TRE_ and Oniguruma_) to Lua_ >= 5.1. The bindings for TRE and Oniguruma are not currently complete. -**Lrexlib** is copyright Reuben Thomas 2000-2020 and copyright Shmuel -Zeigerman 2004-2020, and is released under the same license as Lua, +**Lrexlib** is copyright Reuben Thomas 2000-2017 and copyright Shmuel +Zeigerman 2004-2017, and is released under the same license as Lua, the MIT_ license (otherwise known as the revised BSD license). There is no warranty. @@ -50,7 +50,7 @@ Links - `LuaForge Project Page`_ - Download_ -.. _License: http://rrthomas.github.io/lrexlib/license.html -.. _Reference Manual: http://rrthomas.github.io/lrexlib/manual.html +.. _License: http://rrthomas.github.com/lrexlib/license.html +.. _Reference Manual: http://rrthomas.github.com/lrexlib/manual.html .. _LuaForge Project Page: http://luaforge.net/projects/lrexlib/ .. _Download: https://github.com/rrthomas/lrexlib/downloads diff --git a/csrc/rex_pcre2/WHAT b/csrc/rex_pcre2/WHAT new file mode 100644 index 0000000..efe01ae --- /dev/null +++ b/csrc/rex_pcre2/WHAT @@ -0,0 +1,2 @@ +lrexlib 2.1.0 from https://github.com/rrthomas/lrexlib +pcre2 10.34-RC1 2019-04-22 from https://www.pcre.org/ (BSD License) diff --git a/csrc/rex_pcre2/build-linux32.sh b/csrc/rex_pcre2/build-linux32.sh new file mode 100755 index 0000000..755091b --- /dev/null +++ b/csrc/rex_pcre2/build-linux32.sh @@ -0,0 +1,2 @@ +P=linux32 C="-m32 -fPIC" L="-m32 -s -static-libgcc ../../bin/$P/libpcre2-8.a ../../bin/$P/libpcre2-posix.a" \ + D=rex_pcre2.so A=librex_pcre2.a ./build.sh diff --git a/csrc/rex_pcre2/build-linux64.sh b/csrc/rex_pcre2/build-linux64.sh new file mode 100755 index 0000000..e9e9212 --- /dev/null +++ b/csrc/rex_pcre2/build-linux64.sh @@ -0,0 +1,2 @@ +P=linux64 C="-fPIC" L="-s -static-libgcc ../../bin/$P/libpcre2-8.a ../../bin/$P/libpcre2-posix.a" \ + D=rex_pcre2.so A=librex_pcre2.a ./build.sh diff --git a/csrc/rex_pcre2/build-mingw32.sh b/csrc/rex_pcre2/build-mingw32.sh new file mode 100755 index 0000000..7ad7364 --- /dev/null +++ b/csrc/rex_pcre2/build-mingw32.sh @@ -0,0 +1,3 @@ +[ `uname` = Linux ] && { export X=i686-w64-mingw32-; } +P=mingw32 C="-fPIC" L="-s -static-libgcc ../../bin/$P/pcre2-8.a ../../bin/$P/pcre2-posix.a ../../bin/$P/luajit.a" \ + D=rex_pcre2.dll A=rex_pcre2.a ./build.sh diff --git a/csrc/rex_pcre2/build-mingw64.sh b/csrc/rex_pcre2/build-mingw64.sh new file mode 100755 index 0000000..1b5ae47 --- /dev/null +++ b/csrc/rex_pcre2/build-mingw64.sh @@ -0,0 +1,3 @@ +[ `uname` = Linux ] && { export X=x86_64-w64-mingw32-; } +P=mingw64 C="-fPIC" L="-s -static-libgcc ../../bin/$P/pcre2-8.a ../../bin/$P/pcre2-posix.a ../../bin/$P/luajit.a" \ + D=rex_pcre2.dll A=rex_pcre2.a ./build.sh diff --git a/csrc/rex_pcre2/build-osx64.sh b/csrc/rex_pcre2/build-osx64.sh new file mode 100755 index 0000000..64eda51 --- /dev/null +++ b/csrc/rex_pcre2/build-osx64.sh @@ -0,0 +1,3 @@ +[ `uname` = Linux ] && { export X=x86_64-apple-darwin19-; export CC=clang; } +P=osx64 C="-arch x86_64 -fPIC" L="-arch x86_64 ../../bin/$P/libpcre2-8.a ../../bin/$P/libpcre2-posix.a -undefined dynamic_lookup" \ + D=rex_pcre2.so A=librex_pcre2.a ./build.sh diff --git a/csrc/rex_pcre2/build.sh b/csrc/rex_pcre2/build.sh new file mode 100755 index 0000000..1f93122 --- /dev/null +++ b/csrc/rex_pcre2/build.sh @@ -0,0 +1,9 @@ +[ "$CC" ] || CC=gcc +mkdir -p ../../bin/$P/clib +CD="-Isrc -Ipcre2/$P -I../lua-headers -DPCRE2_CODE_UNIT_WIDTH=8 -DVERSION=\"2.9.0\"" +${X}${CC} -c -O2 $C $CD src/*.c +${X}${CC} -c -O2 $C $CD src/pcre2/*.c +${X}${CC} *.o -shared -o ../../bin/$P/clib/$D $L +rm -f ../../bin/$P/$A +${X}ar rcs ../../bin/$P/$A *.o +rm *.o diff --git a/csrc/rex_pcre2/pcre2/linux32/config.h b/csrc/rex_pcre2/pcre2/linux32/config.h new file mode 100644 index 0000000..0f5e836 --- /dev/null +++ b/csrc/rex_pcre2/pcre2/linux32/config.h @@ -0,0 +1,54 @@ +/* config.h for CMake builds */ + +#define HAVE_DIRENT_H 1 +#define HAVE_INTTYPES_H 1 +#define HAVE_STDINT_H 1 +#define HAVE_STRERROR 1 +#define HAVE_SYS_STAT_H 1 +#define HAVE_SYS_TYPES_H 1 +#define HAVE_UNISTD_H 1 +/* #undef HAVE_WINDOWS_H */ + +#define HAVE_BCOPY 1 +#define HAVE_MEMMOVE 1 + +#define PCRE2_STATIC 1 + +#define SUPPORT_PCRE2_8 1 +/* #undef SUPPORT_PCRE2_16 */ +/* #undef SUPPORT_PCRE2_32 */ +/* #undef PCRE2_DEBUG */ +/* #undef DISABLE_PERCENT_ZT */ + +#define SUPPORT_LIBBZ2 1 +/* #undef SUPPORT_LIBEDIT */ +/* #undef SUPPORT_LIBREADLINE */ +#define SUPPORT_LIBZ 1 + +/* #undef SUPPORT_JIT */ +/* #undef SLJIT_PROT_EXECUTABLE_ALLOCATOR */ +#define SUPPORT_PCRE2GREP_JIT 1 +#define SUPPORT_PCRE2GREP_CALLOUT 1 +#define SUPPORT_PCRE2GREP_CALLOUT_FORK 1 +#define SUPPORT_UNICODE 1 +/* #undef SUPPORT_VALGRIND */ + +/* #undef BSR_ANYCRLF */ +/* #undef EBCDIC */ +/* #undef EBCDIC_NL25 */ +/* #undef HEAP_MATCH_RECURSE */ +/* #undef NEVER_BACKSLASH_C */ + +#define LINK_SIZE 2 +#define HEAP_LIMIT 20000000 +#define MATCH_LIMIT 10000000 +#define MATCH_LIMIT_DEPTH MATCH_LIMIT +#define NEWLINE_DEFAULT 2 +#define PARENS_NEST_LIMIT 250 +#define PCRE2GREP_BUFSIZE 20480 +#define PCRE2GREP_MAX_BUFSIZE 1048576 + +#define MAX_NAME_SIZE 32 +#define MAX_NAME_COUNT 10000 + +/* end config.h for CMake builds */ diff --git a/csrc/rex_pcre2/pcre2/linux32/pcre2.h b/csrc/rex_pcre2/pcre2/linux32/pcre2.h new file mode 100644 index 0000000..0833161 --- /dev/null +++ b/csrc/rex_pcre2/pcre2/linux32/pcre2.h @@ -0,0 +1,981 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This is the public header file for the PCRE library, second API, to be +#included by applications that call PCRE2 functions. + + Copyright (c) 2016-2019 University of Cambridge + +----------------------------------------------------------------------------- +Redistribution and use in source and binary forms, with or without +modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + * Neither the name of the University of Cambridge nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE +POSSIBILITY OF SUCH DAMAGE. +----------------------------------------------------------------------------- +*/ + +#ifndef PCRE2_H_IDEMPOTENT_GUARD +#define PCRE2_H_IDEMPOTENT_GUARD + +/* The current PCRE version information. */ + +#define PCRE2_MAJOR 10 +#define PCRE2_MINOR 34 +#define PCRE2_PRERELEASE -RC1 +#define PCRE2_DATE 2019-04-22 + +/* When an application links to a PCRE DLL in Windows, the symbols that are +imported have to be identified as such. When building PCRE2, the appropriate +export setting is defined in pcre2_internal.h, which includes this file. So we +don't change existing definitions of PCRE2_EXP_DECL. */ + +#if defined(_WIN32) && !defined(PCRE2_STATIC) +# ifndef PCRE2_EXP_DECL +# define PCRE2_EXP_DECL extern __declspec(dllimport) +# endif +#endif + +/* By default, we use the standard "extern" declarations. */ + +#ifndef PCRE2_EXP_DECL +# ifdef __cplusplus +# define PCRE2_EXP_DECL extern "C" +# else +# define PCRE2_EXP_DECL extern +# endif +#endif + +/* When compiling with the MSVC compiler, it is sometimes necessary to include +a "calling convention" before exported function names. (This is secondhand +information; I know nothing about MSVC myself). For example, something like + + void __cdecl function(....) + +might be needed. In order so make this easy, all the exported functions have +PCRE2_CALL_CONVENTION just before their names. It is rarely needed; if not +set, we ensure here that it has no effect. */ + +#ifndef PCRE2_CALL_CONVENTION +#define PCRE2_CALL_CONVENTION +#endif + +/* Have to include limits.h, stdlib.h, and inttypes.h to ensure that size_t and +uint8_t, UCHAR_MAX, etc are defined. Some systems that do have inttypes.h do +not have stdint.h, which is why we use inttypes.h, which according to the C +standard is a superset of stdint.h. If none of these headers are available, +the relevant values must be provided by some other means. */ + +#include +#include +#include + +/* Allow for C++ users compiling this directly. */ + +#ifdef __cplusplus +extern "C" { +#endif + +/* The following option bits can be passed to pcre2_compile(), pcre2_match(), +or pcre2_dfa_match(). PCRE2_NO_UTF_CHECK affects only the function to which it +is passed. Put these bits at the most significant end of the options word so +others can be added next to them */ + +#define PCRE2_ANCHORED 0x80000000u +#define PCRE2_NO_UTF_CHECK 0x40000000u +#define PCRE2_ENDANCHORED 0x20000000u + +/* The following option bits can be passed only to pcre2_compile(). However, +they may affect compilation, JIT compilation, and/or interpretive execution. +The following tags indicate which: + +C alters what is compiled by pcre2_compile() +J alters what is compiled by pcre2_jit_compile() +M is inspected during pcre2_match() execution +D is inspected during pcre2_dfa_match() execution +*/ + +#define PCRE2_ALLOW_EMPTY_CLASS 0x00000001u /* C */ +#define PCRE2_ALT_BSUX 0x00000002u /* C */ +#define PCRE2_AUTO_CALLOUT 0x00000004u /* C */ +#define PCRE2_CASELESS 0x00000008u /* C */ +#define PCRE2_DOLLAR_ENDONLY 0x00000010u /* J M D */ +#define PCRE2_DOTALL 0x00000020u /* C */ +#define PCRE2_DUPNAMES 0x00000040u /* C */ +#define PCRE2_EXTENDED 0x00000080u /* C */ +#define PCRE2_FIRSTLINE 0x00000100u /* J M D */ +#define PCRE2_MATCH_UNSET_BACKREF 0x00000200u /* C J M */ +#define PCRE2_MULTILINE 0x00000400u /* C */ +#define PCRE2_NEVER_UCP 0x00000800u /* C */ +#define PCRE2_NEVER_UTF 0x00001000u /* C */ +#define PCRE2_NO_AUTO_CAPTURE 0x00002000u /* C */ +#define PCRE2_NO_AUTO_POSSESS 0x00004000u /* C */ +#define PCRE2_NO_DOTSTAR_ANCHOR 0x00008000u /* C */ +#define PCRE2_NO_START_OPTIMIZE 0x00010000u /* J M D */ +#define PCRE2_UCP 0x00020000u /* C J M D */ +#define PCRE2_UNGREEDY 0x00040000u /* C */ +#define PCRE2_UTF 0x00080000u /* C J M D */ +#define PCRE2_NEVER_BACKSLASH_C 0x00100000u /* C */ +#define PCRE2_ALT_CIRCUMFLEX 0x00200000u /* J M D */ +#define PCRE2_ALT_VERBNAMES 0x00400000u /* C */ +#define PCRE2_USE_OFFSET_LIMIT 0x00800000u /* J M D */ +#define PCRE2_EXTENDED_MORE 0x01000000u /* C */ +#define PCRE2_LITERAL 0x02000000u /* C */ +#define PCRE2_MATCH_INVALID_UTF 0x04000000u /* J M D */ + +/* An additional compile options word is available in the compile context. */ + +#define PCRE2_EXTRA_ALLOW_SURROGATE_ESCAPES 0x00000001u /* C */ +#define PCRE2_EXTRA_BAD_ESCAPE_IS_LITERAL 0x00000002u /* C */ +#define PCRE2_EXTRA_MATCH_WORD 0x00000004u /* C */ +#define PCRE2_EXTRA_MATCH_LINE 0x00000008u /* C */ +#define PCRE2_EXTRA_ESCAPED_CR_IS_LF 0x00000010u /* C */ +#define PCRE2_EXTRA_ALT_BSUX 0x00000020u /* C */ + +/* These are for pcre2_jit_compile(). */ + +#define PCRE2_JIT_COMPLETE 0x00000001u /* For full matching */ +#define PCRE2_JIT_PARTIAL_SOFT 0x00000002u +#define PCRE2_JIT_PARTIAL_HARD 0x00000004u +#define PCRE2_JIT_INVALID_UTF 0x00000100u + +/* These are for pcre2_match(), pcre2_dfa_match(), pcre2_jit_match(), and +pcre2_substitute(). Some are allowed only for one of the functions, and in +these cases it is noted below. Note that PCRE2_ANCHORED, PCRE2_ENDANCHORED and +PCRE2_NO_UTF_CHECK can also be passed to these functions (though +pcre2_jit_match() ignores the latter since it bypasses all sanity checks). */ + +#define PCRE2_NOTBOL 0x00000001u +#define PCRE2_NOTEOL 0x00000002u +#define PCRE2_NOTEMPTY 0x00000004u /* ) These two must be kept */ +#define PCRE2_NOTEMPTY_ATSTART 0x00000008u /* ) adjacent to each other. */ +#define PCRE2_PARTIAL_SOFT 0x00000010u +#define PCRE2_PARTIAL_HARD 0x00000020u +#define PCRE2_DFA_RESTART 0x00000040u /* pcre2_dfa_match() only */ +#define PCRE2_DFA_SHORTEST 0x00000080u /* pcre2_dfa_match() only */ +#define PCRE2_SUBSTITUTE_GLOBAL 0x00000100u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_EXTENDED 0x00000200u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNSET_EMPTY 0x00000400u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNKNOWN_UNSET 0x00000800u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_OVERFLOW_LENGTH 0x00001000u /* pcre2_substitute() only */ +#define PCRE2_NO_JIT 0x00002000u /* Not for pcre2_dfa_match() */ +#define PCRE2_COPY_MATCHED_SUBJECT 0x00004000u + +/* Options for pcre2_pattern_convert(). */ + +#define PCRE2_CONVERT_UTF 0x00000001u +#define PCRE2_CONVERT_NO_UTF_CHECK 0x00000002u +#define PCRE2_CONVERT_POSIX_BASIC 0x00000004u +#define PCRE2_CONVERT_POSIX_EXTENDED 0x00000008u +#define PCRE2_CONVERT_GLOB 0x00000010u +#define PCRE2_CONVERT_GLOB_NO_WILD_SEPARATOR 0x00000030u +#define PCRE2_CONVERT_GLOB_NO_STARSTAR 0x00000050u + +/* Newline and \R settings, for use in compile contexts. The newline values +must be kept in step with values set in config.h and both sets must all be +greater than zero. */ + +#define PCRE2_NEWLINE_CR 1 +#define PCRE2_NEWLINE_LF 2 +#define PCRE2_NEWLINE_CRLF 3 +#define PCRE2_NEWLINE_ANY 4 +#define PCRE2_NEWLINE_ANYCRLF 5 +#define PCRE2_NEWLINE_NUL 6 + +#define PCRE2_BSR_UNICODE 1 +#define PCRE2_BSR_ANYCRLF 2 + +/* Error codes for pcre2_compile(). Some of these are also used by +pcre2_pattern_convert(). */ + +#define PCRE2_ERROR_END_BACKSLASH 101 +#define PCRE2_ERROR_END_BACKSLASH_C 102 +#define PCRE2_ERROR_UNKNOWN_ESCAPE 103 +#define PCRE2_ERROR_QUANTIFIER_OUT_OF_ORDER 104 +#define PCRE2_ERROR_QUANTIFIER_TOO_BIG 105 +#define PCRE2_ERROR_MISSING_SQUARE_BRACKET 106 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_CLASS 107 +#define PCRE2_ERROR_CLASS_RANGE_ORDER 108 +#define PCRE2_ERROR_QUANTIFIER_INVALID 109 +#define PCRE2_ERROR_INTERNAL_UNEXPECTED_REPEAT 110 +#define PCRE2_ERROR_INVALID_AFTER_PARENS_QUERY 111 +#define PCRE2_ERROR_POSIX_CLASS_NOT_IN_CLASS 112 +#define PCRE2_ERROR_POSIX_NO_SUPPORT_COLLATING 113 +#define PCRE2_ERROR_MISSING_CLOSING_PARENTHESIS 114 +#define PCRE2_ERROR_BAD_SUBPATTERN_REFERENCE 115 +#define PCRE2_ERROR_NULL_PATTERN 116 +#define PCRE2_ERROR_BAD_OPTIONS 117 +#define PCRE2_ERROR_MISSING_COMMENT_CLOSING 118 +#define PCRE2_ERROR_PARENTHESES_NEST_TOO_DEEP 119 +#define PCRE2_ERROR_PATTERN_TOO_LARGE 120 +#define PCRE2_ERROR_HEAP_FAILED 121 +#define PCRE2_ERROR_UNMATCHED_CLOSING_PARENTHESIS 122 +#define PCRE2_ERROR_INTERNAL_CODE_OVERFLOW 123 +#define PCRE2_ERROR_MISSING_CONDITION_CLOSING 124 +#define PCRE2_ERROR_LOOKBEHIND_NOT_FIXED_LENGTH 125 +#define PCRE2_ERROR_ZERO_RELATIVE_REFERENCE 126 +#define PCRE2_ERROR_TOO_MANY_CONDITION_BRANCHES 127 +#define PCRE2_ERROR_CONDITION_ASSERTION_EXPECTED 128 +#define PCRE2_ERROR_BAD_RELATIVE_REFERENCE 129 +#define PCRE2_ERROR_UNKNOWN_POSIX_CLASS 130 +#define PCRE2_ERROR_INTERNAL_STUDY_ERROR 131 +#define PCRE2_ERROR_UNICODE_NOT_SUPPORTED 132 +#define PCRE2_ERROR_PARENTHESES_STACK_CHECK 133 +#define PCRE2_ERROR_CODE_POINT_TOO_BIG 134 +#define PCRE2_ERROR_LOOKBEHIND_TOO_COMPLICATED 135 +#define PCRE2_ERROR_LOOKBEHIND_INVALID_BACKSLASH_C 136 +#define PCRE2_ERROR_UNSUPPORTED_ESCAPE_SEQUENCE 137 +#define PCRE2_ERROR_CALLOUT_NUMBER_TOO_BIG 138 +#define PCRE2_ERROR_MISSING_CALLOUT_CLOSING 139 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_VERB 140 +#define PCRE2_ERROR_UNRECOGNIZED_AFTER_QUERY_P 141 +#define PCRE2_ERROR_MISSING_NAME_TERMINATOR 142 +#define PCRE2_ERROR_DUPLICATE_SUBPATTERN_NAME 143 +#define PCRE2_ERROR_INVALID_SUBPATTERN_NAME 144 +#define PCRE2_ERROR_UNICODE_PROPERTIES_UNAVAILABLE 145 +#define PCRE2_ERROR_MALFORMED_UNICODE_PROPERTY 146 +#define PCRE2_ERROR_UNKNOWN_UNICODE_PROPERTY 147 +#define PCRE2_ERROR_SUBPATTERN_NAME_TOO_LONG 148 +#define PCRE2_ERROR_TOO_MANY_NAMED_SUBPATTERNS 149 +#define PCRE2_ERROR_CLASS_INVALID_RANGE 150 +#define PCRE2_ERROR_OCTAL_BYTE_TOO_BIG 151 +#define PCRE2_ERROR_INTERNAL_OVERRAN_WORKSPACE 152 +#define PCRE2_ERROR_INTERNAL_MISSING_SUBPATTERN 153 +#define PCRE2_ERROR_DEFINE_TOO_MANY_BRANCHES 154 +#define PCRE2_ERROR_BACKSLASH_O_MISSING_BRACE 155 +#define PCRE2_ERROR_INTERNAL_UNKNOWN_NEWLINE 156 +#define PCRE2_ERROR_BACKSLASH_G_SYNTAX 157 +#define PCRE2_ERROR_PARENS_QUERY_R_MISSING_CLOSING 158 +/* Error 159 is obsolete and should now never occur */ +#define PCRE2_ERROR_VERB_ARGUMENT_NOT_ALLOWED 159 +#define PCRE2_ERROR_VERB_UNKNOWN 160 +#define PCRE2_ERROR_SUBPATTERN_NUMBER_TOO_BIG 161 +#define PCRE2_ERROR_SUBPATTERN_NAME_EXPECTED 162 +#define PCRE2_ERROR_INTERNAL_PARSED_OVERFLOW 163 +#define PCRE2_ERROR_INVALID_OCTAL 164 +#define PCRE2_ERROR_SUBPATTERN_NAMES_MISMATCH 165 +#define PCRE2_ERROR_MARK_MISSING_ARGUMENT 166 +#define PCRE2_ERROR_INVALID_HEXADECIMAL 167 +#define PCRE2_ERROR_BACKSLASH_C_SYNTAX 168 +#define PCRE2_ERROR_BACKSLASH_K_SYNTAX 169 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_LOOKBEHINDS 170 +#define PCRE2_ERROR_BACKSLASH_N_IN_CLASS 171 +#define PCRE2_ERROR_CALLOUT_STRING_TOO_LONG 172 +#define PCRE2_ERROR_UNICODE_DISALLOWED_CODE_POINT 173 +#define PCRE2_ERROR_UTF_IS_DISABLED 174 +#define PCRE2_ERROR_UCP_IS_DISABLED 175 +#define PCRE2_ERROR_VERB_NAME_TOO_LONG 176 +#define PCRE2_ERROR_BACKSLASH_U_CODE_POINT_TOO_BIG 177 +#define PCRE2_ERROR_MISSING_OCTAL_OR_HEX_DIGITS 178 +#define PCRE2_ERROR_VERSION_CONDITION_SYNTAX 179 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_AUTO_POSSESS 180 +#define PCRE2_ERROR_CALLOUT_NO_STRING_DELIMITER 181 +#define PCRE2_ERROR_CALLOUT_BAD_STRING_DELIMITER 182 +#define PCRE2_ERROR_BACKSLASH_C_CALLER_DISABLED 183 +#define PCRE2_ERROR_QUERY_BARJX_NEST_TOO_DEEP 184 +#define PCRE2_ERROR_BACKSLASH_C_LIBRARY_DISABLED 185 +#define PCRE2_ERROR_PATTERN_TOO_COMPLICATED 186 +#define PCRE2_ERROR_LOOKBEHIND_TOO_LONG 187 +#define PCRE2_ERROR_PATTERN_STRING_TOO_LONG 188 +#define PCRE2_ERROR_INTERNAL_BAD_CODE 189 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_IN_SKIP 190 +#define PCRE2_ERROR_NO_SURROGATES_IN_UTF16 191 +#define PCRE2_ERROR_BAD_LITERAL_OPTIONS 192 +#define PCRE2_ERROR_SUPPORTED_ONLY_IN_UNICODE 193 +#define PCRE2_ERROR_INVALID_HYPHEN_IN_OPTIONS 194 +#define PCRE2_ERROR_ALPHA_ASSERTION_UNKNOWN 195 +#define PCRE2_ERROR_SCRIPT_RUN_NOT_AVAILABLE 196 +#define PCRE2_ERROR_TOO_MANY_CAPTURES 197 + + +/* "Expected" matching error codes: no match and partial match. */ + +#define PCRE2_ERROR_NOMATCH (-1) +#define PCRE2_ERROR_PARTIAL (-2) + +/* Error codes for UTF-8 validity checks */ + +#define PCRE2_ERROR_UTF8_ERR1 (-3) +#define PCRE2_ERROR_UTF8_ERR2 (-4) +#define PCRE2_ERROR_UTF8_ERR3 (-5) +#define PCRE2_ERROR_UTF8_ERR4 (-6) +#define PCRE2_ERROR_UTF8_ERR5 (-7) +#define PCRE2_ERROR_UTF8_ERR6 (-8) +#define PCRE2_ERROR_UTF8_ERR7 (-9) +#define PCRE2_ERROR_UTF8_ERR8 (-10) +#define PCRE2_ERROR_UTF8_ERR9 (-11) +#define PCRE2_ERROR_UTF8_ERR10 (-12) +#define PCRE2_ERROR_UTF8_ERR11 (-13) +#define PCRE2_ERROR_UTF8_ERR12 (-14) +#define PCRE2_ERROR_UTF8_ERR13 (-15) +#define PCRE2_ERROR_UTF8_ERR14 (-16) +#define PCRE2_ERROR_UTF8_ERR15 (-17) +#define PCRE2_ERROR_UTF8_ERR16 (-18) +#define PCRE2_ERROR_UTF8_ERR17 (-19) +#define PCRE2_ERROR_UTF8_ERR18 (-20) +#define PCRE2_ERROR_UTF8_ERR19 (-21) +#define PCRE2_ERROR_UTF8_ERR20 (-22) +#define PCRE2_ERROR_UTF8_ERR21 (-23) + +/* Error codes for UTF-16 validity checks */ + +#define PCRE2_ERROR_UTF16_ERR1 (-24) +#define PCRE2_ERROR_UTF16_ERR2 (-25) +#define PCRE2_ERROR_UTF16_ERR3 (-26) + +/* Error codes for UTF-32 validity checks */ + +#define PCRE2_ERROR_UTF32_ERR1 (-27) +#define PCRE2_ERROR_UTF32_ERR2 (-28) + +/* Miscellaneous error codes for pcre2[_dfa]_match(), substring extraction +functions, context functions, and serializing functions. They are in numerical +order. Originally they were in alphabetical order too, but now that PCRE2 is +released, the numbers must not be changed. */ + +#define PCRE2_ERROR_BADDATA (-29) +#define PCRE2_ERROR_MIXEDTABLES (-30) /* Name was changed */ +#define PCRE2_ERROR_BADMAGIC (-31) +#define PCRE2_ERROR_BADMODE (-32) +#define PCRE2_ERROR_BADOFFSET (-33) +#define PCRE2_ERROR_BADOPTION (-34) +#define PCRE2_ERROR_BADREPLACEMENT (-35) +#define PCRE2_ERROR_BADUTFOFFSET (-36) +#define PCRE2_ERROR_CALLOUT (-37) /* Never used by PCRE2 itself */ +#define PCRE2_ERROR_DFA_BADRESTART (-38) +#define PCRE2_ERROR_DFA_RECURSE (-39) +#define PCRE2_ERROR_DFA_UCOND (-40) +#define PCRE2_ERROR_DFA_UFUNC (-41) +#define PCRE2_ERROR_DFA_UITEM (-42) +#define PCRE2_ERROR_DFA_WSSIZE (-43) +#define PCRE2_ERROR_INTERNAL (-44) +#define PCRE2_ERROR_JIT_BADOPTION (-45) +#define PCRE2_ERROR_JIT_STACKLIMIT (-46) +#define PCRE2_ERROR_MATCHLIMIT (-47) +#define PCRE2_ERROR_NOMEMORY (-48) +#define PCRE2_ERROR_NOSUBSTRING (-49) +#define PCRE2_ERROR_NOUNIQUESUBSTRING (-50) +#define PCRE2_ERROR_NULL (-51) +#define PCRE2_ERROR_RECURSELOOP (-52) +#define PCRE2_ERROR_DEPTHLIMIT (-53) +#define PCRE2_ERROR_RECURSIONLIMIT (-53) /* Obsolete synonym */ +#define PCRE2_ERROR_UNAVAILABLE (-54) +#define PCRE2_ERROR_UNSET (-55) +#define PCRE2_ERROR_BADOFFSETLIMIT (-56) +#define PCRE2_ERROR_BADREPESCAPE (-57) +#define PCRE2_ERROR_REPMISSINGBRACE (-58) +#define PCRE2_ERROR_BADSUBSTITUTION (-59) +#define PCRE2_ERROR_BADSUBSPATTERN (-60) +#define PCRE2_ERROR_TOOMANYREPLACE (-61) +#define PCRE2_ERROR_BADSERIALIZEDDATA (-62) +#define PCRE2_ERROR_HEAPLIMIT (-63) +#define PCRE2_ERROR_CONVERT_SYNTAX (-64) +#define PCRE2_ERROR_INTERNAL_DUPMATCH (-65) +#define PCRE2_ERROR_DFA_UINVALID_UTF (-66) + + +/* Request types for pcre2_pattern_info() */ + +#define PCRE2_INFO_ALLOPTIONS 0 +#define PCRE2_INFO_ARGOPTIONS 1 +#define PCRE2_INFO_BACKREFMAX 2 +#define PCRE2_INFO_BSR 3 +#define PCRE2_INFO_CAPTURECOUNT 4 +#define PCRE2_INFO_FIRSTCODEUNIT 5 +#define PCRE2_INFO_FIRSTCODETYPE 6 +#define PCRE2_INFO_FIRSTBITMAP 7 +#define PCRE2_INFO_HASCRORLF 8 +#define PCRE2_INFO_JCHANGED 9 +#define PCRE2_INFO_JITSIZE 10 +#define PCRE2_INFO_LASTCODEUNIT 11 +#define PCRE2_INFO_LASTCODETYPE 12 +#define PCRE2_INFO_MATCHEMPTY 13 +#define PCRE2_INFO_MATCHLIMIT 14 +#define PCRE2_INFO_MAXLOOKBEHIND 15 +#define PCRE2_INFO_MINLENGTH 16 +#define PCRE2_INFO_NAMECOUNT 17 +#define PCRE2_INFO_NAMEENTRYSIZE 18 +#define PCRE2_INFO_NAMETABLE 19 +#define PCRE2_INFO_NEWLINE 20 +#define PCRE2_INFO_DEPTHLIMIT 21 +#define PCRE2_INFO_RECURSIONLIMIT 21 /* Obsolete synonym */ +#define PCRE2_INFO_SIZE 22 +#define PCRE2_INFO_HASBACKSLASHC 23 +#define PCRE2_INFO_FRAMESIZE 24 +#define PCRE2_INFO_HEAPLIMIT 25 +#define PCRE2_INFO_EXTRAOPTIONS 26 + +/* Request types for pcre2_config(). */ + +#define PCRE2_CONFIG_BSR 0 +#define PCRE2_CONFIG_JIT 1 +#define PCRE2_CONFIG_JITTARGET 2 +#define PCRE2_CONFIG_LINKSIZE 3 +#define PCRE2_CONFIG_MATCHLIMIT 4 +#define PCRE2_CONFIG_NEWLINE 5 +#define PCRE2_CONFIG_PARENSLIMIT 6 +#define PCRE2_CONFIG_DEPTHLIMIT 7 +#define PCRE2_CONFIG_RECURSIONLIMIT 7 /* Obsolete synonym */ +#define PCRE2_CONFIG_STACKRECURSE 8 /* Obsolete */ +#define PCRE2_CONFIG_UNICODE 9 +#define PCRE2_CONFIG_UNICODE_VERSION 10 +#define PCRE2_CONFIG_VERSION 11 +#define PCRE2_CONFIG_HEAPLIMIT 12 +#define PCRE2_CONFIG_NEVER_BACKSLASH_C 13 +#define PCRE2_CONFIG_COMPILED_WIDTHS 14 + + +/* Types for code units in patterns and subject strings. */ + +typedef uint8_t PCRE2_UCHAR8; +typedef uint16_t PCRE2_UCHAR16; +typedef uint32_t PCRE2_UCHAR32; + +typedef const PCRE2_UCHAR8 *PCRE2_SPTR8; +typedef const PCRE2_UCHAR16 *PCRE2_SPTR16; +typedef const PCRE2_UCHAR32 *PCRE2_SPTR32; + +/* The PCRE2_SIZE type is used for all string lengths and offsets in PCRE2, +including pattern offsets for errors and subject offsets after a match. We +define special values to indicate zero-terminated strings and unset offsets in +the offset vector (ovector). */ + +#define PCRE2_SIZE size_t +#define PCRE2_SIZE_MAX SIZE_MAX +#define PCRE2_ZERO_TERMINATED (~(PCRE2_SIZE)0) +#define PCRE2_UNSET (~(PCRE2_SIZE)0) + +/* Generic types for opaque structures and JIT callback functions. These +declarations are defined in a macro that is expanded for each width later. */ + +#define PCRE2_TYPES_LIST \ +struct pcre2_real_general_context; \ +typedef struct pcre2_real_general_context pcre2_general_context; \ +\ +struct pcre2_real_compile_context; \ +typedef struct pcre2_real_compile_context pcre2_compile_context; \ +\ +struct pcre2_real_match_context; \ +typedef struct pcre2_real_match_context pcre2_match_context; \ +\ +struct pcre2_real_convert_context; \ +typedef struct pcre2_real_convert_context pcre2_convert_context; \ +\ +struct pcre2_real_code; \ +typedef struct pcre2_real_code pcre2_code; \ +\ +struct pcre2_real_match_data; \ +typedef struct pcre2_real_match_data pcre2_match_data; \ +\ +struct pcre2_real_jit_stack; \ +typedef struct pcre2_real_jit_stack pcre2_jit_stack; \ +\ +typedef pcre2_jit_stack *(*pcre2_jit_callback)(void *); + + +/* The structures for passing out data via callout functions. We use structures +so that new fields can be added on the end in future versions, without changing +the API of the function, thereby allowing old clients to work without +modification. Define the generic versions in a macro; the width-specific +versions are generated from this macro below. */ + +/* Flags for the callout_flags field. These are cleared after a callout. */ + +#define PCRE2_CALLOUT_STARTMATCH 0x00000001u /* Set for each bumpalong */ +#define PCRE2_CALLOUT_BACKTRACK 0x00000002u /* Set after a backtrack */ + +#define PCRE2_STRUCTURE_LIST \ +typedef struct pcre2_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + uint32_t capture_top; /* Max current capture */ \ + uint32_t capture_last; /* Most recently closed capture */ \ + PCRE2_SIZE *offset_vector; /* The offset vector */ \ + PCRE2_SPTR mark; /* Pointer to current mark or NULL */ \ + PCRE2_SPTR subject; /* The subject being matched */ \ + PCRE2_SIZE subject_length; /* The length of the subject */ \ + PCRE2_SIZE start_match; /* Offset to start of this match attempt */ \ + PCRE2_SIZE current_position; /* Where we currently are in the subject */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + /* ------------------- Added for Version 1 -------------------------- */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------- Added for Version 2 -------------------------- */ \ + uint32_t callout_flags; /* See above for list */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_block; \ +\ +typedef struct pcre2_callout_enumerate_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_enumerate_block; \ +\ +typedef struct pcre2_substitute_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SPTR input; /* Pointer to input subject string */ \ + PCRE2_SPTR output; /* Pointer to output buffer */ \ + PCRE2_SIZE output_offsets[2]; /* Changed portion of the output */ \ + PCRE2_SIZE *ovector; /* Pointer to current ovector */ \ + uint32_t oveccount; /* Count of pairs set in ovector */ \ + uint32_t subscount; /* Substitution number */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_substitute_callout_block; + + +/* List the generic forms of all other functions in macros, which will be +expanded for each width below. Start with functions that give general +information. */ + +#define PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION pcre2_config(uint32_t, void *); + + +/* Functions for manipulating contexts. */ + +#define PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_copy(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_create(void *(*)(PCRE2_SIZE, void *), \ + void (*)(void *, void *), void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_general_context_free(pcre2_general_context *); + +#define PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_copy(pcre2_compile_context *); \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_create(pcre2_general_context *);\ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_compile_context_free(pcre2_compile_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_bsr(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_character_tables(pcre2_compile_context *, const unsigned char *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_extra_options(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_max_pattern_length(pcre2_compile_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_newline(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_parens_nest_limit(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_recursion_guard(pcre2_compile_context *, \ + int (*)(uint32_t, void *), void *); + +#define PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_copy(pcre2_match_context *); \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_context_free(pcre2_match_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_callout(pcre2_match_context *, \ + int (*)(pcre2_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_substitute_callout(pcre2_match_context *, \ + int (*)(pcre2_substitute_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_depth_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_heap_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_match_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_offset_limit(pcre2_match_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_memory_management(pcre2_match_context *, \ + void *(*)(PCRE2_SIZE, void *), void (*)(void *, void *), void *); + +#define PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_copy(pcre2_convert_context *); \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_convert_context_free(pcre2_convert_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_escape(pcre2_convert_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_separator(pcre2_convert_context *, uint32_t); + + +/* Functions concerned with compiling a pattern to PCRE internal code. */ + +#define PCRE2_COMPILE_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_compile(PCRE2_SPTR, PCRE2_SIZE, uint32_t, int *, PCRE2_SIZE *, \ + pcre2_compile_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_code_free(pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy(const pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy_with_tables(const pcre2_code *); + + +/* Functions that give information about a compiled pattern. */ + +#define PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_info(const pcre2_code *, uint32_t, void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_callout_enumerate(const pcre2_code *, \ + int (*)(pcre2_callout_enumerate_block *, void *), void *); + + +/* Functions for running a match and inspecting the result. */ + +#define PCRE2_MATCH_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create(uint32_t, pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create_from_pattern(const pcre2_code *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_dfa_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, int *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_data_free(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SPTR PCRE2_CALL_CONVENTION \ + pcre2_get_mark(pcre2_match_data *); \ +PCRE2_EXP_DECL uint32_t PCRE2_CALL_CONVENTION \ + pcre2_get_ovector_count(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + *pcre2_get_ovector_pointer(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + pcre2_get_startchar(pcre2_match_data *); + + +/* Convenience functions for handling matched substrings. */ + +#define PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_free(PCRE2_UCHAR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_bynumber(pcre2_match_data *, uint32_t, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_nametable_scan(const pcre2_code *, PCRE2_SPTR, PCRE2_SPTR *, \ + PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_number_from_name(const pcre2_code *, PCRE2_SPTR); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_list_free(PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_list_get(pcre2_match_data *, PCRE2_UCHAR ***, PCRE2_SIZE **); + +/* Functions for serializing / deserializing compiled patterns. */ + +#define PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_encode(const pcre2_code **, int32_t, uint8_t **, \ + PCRE2_SIZE *, pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_decode(pcre2_code **, int32_t, const uint8_t *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_get_number_of_codes(const uint8_t *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_serialize_free(uint8_t *); + + +/* Convenience function for match + substitute. */ + +#define PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substitute(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, PCRE2_SPTR, \ + PCRE2_SIZE, PCRE2_UCHAR *, PCRE2_SIZE *); + + +/* Functions for converting pattern source strings. */ + +#define PCRE2_CONVERT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_convert(PCRE2_SPTR, PCRE2_SIZE, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *, pcre2_convert_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_converted_pattern_free(PCRE2_UCHAR *); + + +/* Functions for JIT processing */ + +#define PCRE2_JIT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_compile(pcre2_code *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_free_unused_memory(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_jit_stack PCRE2_CALL_CONVENTION \ + *pcre2_jit_stack_create(PCRE2_SIZE, PCRE2_SIZE, pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_assign(pcre2_match_context *, pcre2_jit_callback, void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_free(pcre2_jit_stack *); + + +/* Other miscellaneous functions. */ + +#define PCRE2_OTHER_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_get_error_message(int, PCRE2_UCHAR *, PCRE2_SIZE); \ +PCRE2_EXP_DECL const uint8_t PCRE2_CALL_CONVENTION \ + *pcre2_maketables(pcre2_general_context *); \ + + +/* Define macros that generate width-specific names from generic versions. The +three-level macro scheme is necessary to get the macros expanded when we want +them to be. First we get the width from PCRE2_LOCAL_WIDTH, which is used for +generating three versions of everything below. After that, PCRE2_SUFFIX will be +re-defined to use PCRE2_CODE_UNIT_WIDTH, for use when macros such as +pcre2_compile are called by application code. */ + +#define PCRE2_JOIN(a,b) a ## b +#define PCRE2_GLUE(a,b) PCRE2_JOIN(a,b) +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a,PCRE2_LOCAL_WIDTH) + + +/* Data types */ + +#define PCRE2_UCHAR PCRE2_SUFFIX(PCRE2_UCHAR) +#define PCRE2_SPTR PCRE2_SUFFIX(PCRE2_SPTR) + +#define pcre2_code PCRE2_SUFFIX(pcre2_code_) +#define pcre2_jit_callback PCRE2_SUFFIX(pcre2_jit_callback_) +#define pcre2_jit_stack PCRE2_SUFFIX(pcre2_jit_stack_) + +#define pcre2_real_code PCRE2_SUFFIX(pcre2_real_code_) +#define pcre2_real_general_context PCRE2_SUFFIX(pcre2_real_general_context_) +#define pcre2_real_compile_context PCRE2_SUFFIX(pcre2_real_compile_context_) +#define pcre2_real_convert_context PCRE2_SUFFIX(pcre2_real_convert_context_) +#define pcre2_real_match_context PCRE2_SUFFIX(pcre2_real_match_context_) +#define pcre2_real_jit_stack PCRE2_SUFFIX(pcre2_real_jit_stack_) +#define pcre2_real_match_data PCRE2_SUFFIX(pcre2_real_match_data_) + + +/* Data blocks */ + +#define pcre2_callout_block PCRE2_SUFFIX(pcre2_callout_block_) +#define pcre2_callout_enumerate_block PCRE2_SUFFIX(pcre2_callout_enumerate_block_) +#define pcre2_substitute_callout_block PCRE2_SUFFIX(pcre2_substitute_callout_block_) +#define pcre2_general_context PCRE2_SUFFIX(pcre2_general_context_) +#define pcre2_compile_context PCRE2_SUFFIX(pcre2_compile_context_) +#define pcre2_convert_context PCRE2_SUFFIX(pcre2_convert_context_) +#define pcre2_match_context PCRE2_SUFFIX(pcre2_match_context_) +#define pcre2_match_data PCRE2_SUFFIX(pcre2_match_data_) + + +/* Functions: the complete list in alphabetical order */ + +#define pcre2_callout_enumerate PCRE2_SUFFIX(pcre2_callout_enumerate_) +#define pcre2_code_copy PCRE2_SUFFIX(pcre2_code_copy_) +#define pcre2_code_copy_with_tables PCRE2_SUFFIX(pcre2_code_copy_with_tables_) +#define pcre2_code_free PCRE2_SUFFIX(pcre2_code_free_) +#define pcre2_compile PCRE2_SUFFIX(pcre2_compile_) +#define pcre2_compile_context_copy PCRE2_SUFFIX(pcre2_compile_context_copy_) +#define pcre2_compile_context_create PCRE2_SUFFIX(pcre2_compile_context_create_) +#define pcre2_compile_context_free PCRE2_SUFFIX(pcre2_compile_context_free_) +#define pcre2_config PCRE2_SUFFIX(pcre2_config_) +#define pcre2_convert_context_copy PCRE2_SUFFIX(pcre2_convert_context_copy_) +#define pcre2_convert_context_create PCRE2_SUFFIX(pcre2_convert_context_create_) +#define pcre2_convert_context_free PCRE2_SUFFIX(pcre2_convert_context_free_) +#define pcre2_converted_pattern_free PCRE2_SUFFIX(pcre2_converted_pattern_free_) +#define pcre2_dfa_match PCRE2_SUFFIX(pcre2_dfa_match_) +#define pcre2_general_context_copy PCRE2_SUFFIX(pcre2_general_context_copy_) +#define pcre2_general_context_create PCRE2_SUFFIX(pcre2_general_context_create_) +#define pcre2_general_context_free PCRE2_SUFFIX(pcre2_general_context_free_) +#define pcre2_get_error_message PCRE2_SUFFIX(pcre2_get_error_message_) +#define pcre2_get_mark PCRE2_SUFFIX(pcre2_get_mark_) +#define pcre2_get_ovector_pointer PCRE2_SUFFIX(pcre2_get_ovector_pointer_) +#define pcre2_get_ovector_count PCRE2_SUFFIX(pcre2_get_ovector_count_) +#define pcre2_get_startchar PCRE2_SUFFIX(pcre2_get_startchar_) +#define pcre2_jit_compile PCRE2_SUFFIX(pcre2_jit_compile_) +#define pcre2_jit_match PCRE2_SUFFIX(pcre2_jit_match_) +#define pcre2_jit_free_unused_memory PCRE2_SUFFIX(pcre2_jit_free_unused_memory_) +#define pcre2_jit_stack_assign PCRE2_SUFFIX(pcre2_jit_stack_assign_) +#define pcre2_jit_stack_create PCRE2_SUFFIX(pcre2_jit_stack_create_) +#define pcre2_jit_stack_free PCRE2_SUFFIX(pcre2_jit_stack_free_) +#define pcre2_maketables PCRE2_SUFFIX(pcre2_maketables_) +#define pcre2_match PCRE2_SUFFIX(pcre2_match_) +#define pcre2_match_context_copy PCRE2_SUFFIX(pcre2_match_context_copy_) +#define pcre2_match_context_create PCRE2_SUFFIX(pcre2_match_context_create_) +#define pcre2_match_context_free PCRE2_SUFFIX(pcre2_match_context_free_) +#define pcre2_match_data_create PCRE2_SUFFIX(pcre2_match_data_create_) +#define pcre2_match_data_create_from_pattern PCRE2_SUFFIX(pcre2_match_data_create_from_pattern_) +#define pcre2_match_data_free PCRE2_SUFFIX(pcre2_match_data_free_) +#define pcre2_pattern_convert PCRE2_SUFFIX(pcre2_pattern_convert_) +#define pcre2_pattern_info PCRE2_SUFFIX(pcre2_pattern_info_) +#define pcre2_serialize_decode PCRE2_SUFFIX(pcre2_serialize_decode_) +#define pcre2_serialize_encode PCRE2_SUFFIX(pcre2_serialize_encode_) +#define pcre2_serialize_free PCRE2_SUFFIX(pcre2_serialize_free_) +#define pcre2_serialize_get_number_of_codes PCRE2_SUFFIX(pcre2_serialize_get_number_of_codes_) +#define pcre2_set_bsr PCRE2_SUFFIX(pcre2_set_bsr_) +#define pcre2_set_callout PCRE2_SUFFIX(pcre2_set_callout_) +#define pcre2_set_character_tables PCRE2_SUFFIX(pcre2_set_character_tables_) +#define pcre2_set_compile_extra_options PCRE2_SUFFIX(pcre2_set_compile_extra_options_) +#define pcre2_set_compile_recursion_guard PCRE2_SUFFIX(pcre2_set_compile_recursion_guard_) +#define pcre2_set_depth_limit PCRE2_SUFFIX(pcre2_set_depth_limit_) +#define pcre2_set_glob_escape PCRE2_SUFFIX(pcre2_set_glob_escape_) +#define pcre2_set_glob_separator PCRE2_SUFFIX(pcre2_set_glob_separator_) +#define pcre2_set_heap_limit PCRE2_SUFFIX(pcre2_set_heap_limit_) +#define pcre2_set_match_limit PCRE2_SUFFIX(pcre2_set_match_limit_) +#define pcre2_set_max_pattern_length PCRE2_SUFFIX(pcre2_set_max_pattern_length_) +#define pcre2_set_newline PCRE2_SUFFIX(pcre2_set_newline_) +#define pcre2_set_parens_nest_limit PCRE2_SUFFIX(pcre2_set_parens_nest_limit_) +#define pcre2_set_offset_limit PCRE2_SUFFIX(pcre2_set_offset_limit_) +#define pcre2_set_substitute_callout PCRE2_SUFFIX(pcre2_set_substitute_callout_) +#define pcre2_substitute PCRE2_SUFFIX(pcre2_substitute_) +#define pcre2_substring_copy_byname PCRE2_SUFFIX(pcre2_substring_copy_byname_) +#define pcre2_substring_copy_bynumber PCRE2_SUFFIX(pcre2_substring_copy_bynumber_) +#define pcre2_substring_free PCRE2_SUFFIX(pcre2_substring_free_) +#define pcre2_substring_get_byname PCRE2_SUFFIX(pcre2_substring_get_byname_) +#define pcre2_substring_get_bynumber PCRE2_SUFFIX(pcre2_substring_get_bynumber_) +#define pcre2_substring_length_byname PCRE2_SUFFIX(pcre2_substring_length_byname_) +#define pcre2_substring_length_bynumber PCRE2_SUFFIX(pcre2_substring_length_bynumber_) +#define pcre2_substring_list_get PCRE2_SUFFIX(pcre2_substring_list_get_) +#define pcre2_substring_list_free PCRE2_SUFFIX(pcre2_substring_list_free_) +#define pcre2_substring_nametable_scan PCRE2_SUFFIX(pcre2_substring_nametable_scan_) +#define pcre2_substring_number_from_name PCRE2_SUFFIX(pcre2_substring_number_from_name_) + +/* Keep this old function name for backwards compatibility */ +#define pcre2_set_recursion_limit PCRE2_SUFFIX(pcre2_set_recursion_limit_) + +/* Keep this obsolete function for backwards compatibility: it is now a noop. */ +#define pcre2_set_recursion_memory_management PCRE2_SUFFIX(pcre2_set_recursion_memory_management_) + +/* Now generate all three sets of width-specific structures and function +prototypes. */ + +#define PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS \ +PCRE2_TYPES_LIST \ +PCRE2_STRUCTURE_LIST \ +PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_FUNCTIONS \ +PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_FUNCTIONS \ +PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_MATCH_FUNCTIONS \ +PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_JIT_FUNCTIONS \ +PCRE2_OTHER_FUNCTIONS + +#define PCRE2_LOCAL_WIDTH 8 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 16 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 32 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +/* Undefine the list macros; they are no longer needed. */ + +#undef PCRE2_TYPES_LIST +#undef PCRE2_STRUCTURE_LIST +#undef PCRE2_GENERAL_INFO_FUNCTIONS +#undef PCRE2_GENERAL_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_CONTEXT_FUNCTIONS +#undef PCRE2_CONVERT_CONTEXT_FUNCTIONS +#undef PCRE2_MATCH_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_FUNCTIONS +#undef PCRE2_PATTERN_INFO_FUNCTIONS +#undef PCRE2_MATCH_FUNCTIONS +#undef PCRE2_SUBSTRING_FUNCTIONS +#undef PCRE2_SERIALIZE_FUNCTIONS +#undef PCRE2_SUBSTITUTE_FUNCTION +#undef PCRE2_JIT_FUNCTIONS +#undef PCRE2_OTHER_FUNCTIONS +#undef PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS + +/* PCRE2_CODE_UNIT_WIDTH must be defined. If it is 8, 16, or 32, redefine +PCRE2_SUFFIX to use it. If it is 0, undefine the other macros and make +PCRE2_SUFFIX a no-op. Otherwise, generate an error. */ + +#undef PCRE2_SUFFIX +#ifndef PCRE2_CODE_UNIT_WIDTH +#error PCRE2_CODE_UNIT_WIDTH must be defined before including pcre2.h. +#error Use 8, 16, or 32; or 0 for a multi-width application. +#else /* PCRE2_CODE_UNIT_WIDTH is defined */ +#if PCRE2_CODE_UNIT_WIDTH == 8 || \ + PCRE2_CODE_UNIT_WIDTH == 16 || \ + PCRE2_CODE_UNIT_WIDTH == 32 +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a, PCRE2_CODE_UNIT_WIDTH) +#elif PCRE2_CODE_UNIT_WIDTH == 0 +#undef PCRE2_JOIN +#undef PCRE2_GLUE +#define PCRE2_SUFFIX(a) a +#else +#error PCRE2_CODE_UNIT_WIDTH must be 0, 8, 16, or 32. +#endif +#endif /* PCRE2_CODE_UNIT_WIDTH is defined */ + +#ifdef __cplusplus +} /* extern "C" */ +#endif + +#endif /* PCRE2_H_IDEMPOTENT_GUARD */ + +/* End of pcre2.h */ diff --git a/csrc/rex_pcre2/pcre2/linux32/pcre2_chartables.c b/csrc/rex_pcre2/pcre2/linux32/pcre2_chartables.c new file mode 100644 index 0000000..0e07edb --- /dev/null +++ b/csrc/rex_pcre2/pcre2/linux32/pcre2_chartables.c @@ -0,0 +1,198 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This file was automatically written by the dftables auxiliary +program. It contains character tables that are used when no external +tables are passed to PCRE2 by the application that calls it. The tables +are used only for characters whose code values are less than 256. */ + +/*The dftables program (which is distributed with PCRE2) can be used to +build alternative versions of this file. This is necessary if you are +running in an EBCDIC environment, or if you want to default to a different +encoding, for example ISO-8859-1. When dftables is run, it creates these +tables in the current locale. This happens automatically if PCRE2 is +configured with --enable-rebuild-chartables. */ + +/* The following #include is present because without it gcc 4.x may remove +the array definition from the final binary if PCRE2 is built into a static +library and dead code stripping is activated. This leads to link errors. +Pulling in the header ensures that the array gets flagged as "someone +outside this compilation unit might reference this" and so it will always +be supplied to the linker. */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "pcre2_internal.h" + +const uint8_t PRIV(default_tables)[] = { + +/* This table is a lower casing table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table is a case flipping table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 65, 66, 67, 68, 69, 70, 71, + 72, 73, 74, 75, 76, 77, 78, 79, + 80, 81, 82, 83, 84, 85, 86, 87, + 88, 89, 90,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table contains bit maps for various character classes. Each map is 32 +bytes long and the bits run from the least significant end of each byte. The +classes that have their own maps are: space, xdigit, digit, upper, lower, word, +graph print, punct, and cntrl. Other classes are built from combinations. */ + + 0x00,0x3e,0x00,0x00,0x01,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x7e,0x00,0x00,0x00,0x7e,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0xfe,0xff,0xff,0x07,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0xfe,0xff,0xff,0x87,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xff,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0x00,0xfc, + 0x01,0x00,0x00,0xf8,0x01,0x00,0x00,0x78, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0xff,0xff,0xff,0xff,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + +/* This table identifies various classes of character by individual bits: + 0x01 white space character + 0x02 letter + 0x04 lower case letter + 0x08 decimal digit + 0x10 alphanumeric or '_' +*/ + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 */ + 0x00,0x01,0x01,0x01,0x01,0x01,0x00,0x00, /* 8- 15 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */ + 0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - ' */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ( - / */ + 0x18,0x18,0x18,0x18,0x18,0x18,0x18,0x18, /* 0 - 7 */ + 0x18,0x18,0x00,0x00,0x00,0x00,0x00,0x00, /* 8 - ? */ + 0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* @ - G */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* H - O */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* P - W */ + 0x12,0x12,0x12,0x00,0x00,0x00,0x00,0x10, /* X - _ */ + 0x00,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* ` - g */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* h - o */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* p - w */ + 0x16,0x16,0x16,0x00,0x00,0x00,0x00,0x00, /* x -127 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */ + +/* End of pcre2_chartables.c */ diff --git a/csrc/rex_pcre2/pcre2/linux64/config.h b/csrc/rex_pcre2/pcre2/linux64/config.h new file mode 100644 index 0000000..0f5e836 --- /dev/null +++ b/csrc/rex_pcre2/pcre2/linux64/config.h @@ -0,0 +1,54 @@ +/* config.h for CMake builds */ + +#define HAVE_DIRENT_H 1 +#define HAVE_INTTYPES_H 1 +#define HAVE_STDINT_H 1 +#define HAVE_STRERROR 1 +#define HAVE_SYS_STAT_H 1 +#define HAVE_SYS_TYPES_H 1 +#define HAVE_UNISTD_H 1 +/* #undef HAVE_WINDOWS_H */ + +#define HAVE_BCOPY 1 +#define HAVE_MEMMOVE 1 + +#define PCRE2_STATIC 1 + +#define SUPPORT_PCRE2_8 1 +/* #undef SUPPORT_PCRE2_16 */ +/* #undef SUPPORT_PCRE2_32 */ +/* #undef PCRE2_DEBUG */ +/* #undef DISABLE_PERCENT_ZT */ + +#define SUPPORT_LIBBZ2 1 +/* #undef SUPPORT_LIBEDIT */ +/* #undef SUPPORT_LIBREADLINE */ +#define SUPPORT_LIBZ 1 + +/* #undef SUPPORT_JIT */ +/* #undef SLJIT_PROT_EXECUTABLE_ALLOCATOR */ +#define SUPPORT_PCRE2GREP_JIT 1 +#define SUPPORT_PCRE2GREP_CALLOUT 1 +#define SUPPORT_PCRE2GREP_CALLOUT_FORK 1 +#define SUPPORT_UNICODE 1 +/* #undef SUPPORT_VALGRIND */ + +/* #undef BSR_ANYCRLF */ +/* #undef EBCDIC */ +/* #undef EBCDIC_NL25 */ +/* #undef HEAP_MATCH_RECURSE */ +/* #undef NEVER_BACKSLASH_C */ + +#define LINK_SIZE 2 +#define HEAP_LIMIT 20000000 +#define MATCH_LIMIT 10000000 +#define MATCH_LIMIT_DEPTH MATCH_LIMIT +#define NEWLINE_DEFAULT 2 +#define PARENS_NEST_LIMIT 250 +#define PCRE2GREP_BUFSIZE 20480 +#define PCRE2GREP_MAX_BUFSIZE 1048576 + +#define MAX_NAME_SIZE 32 +#define MAX_NAME_COUNT 10000 + +/* end config.h for CMake builds */ diff --git a/csrc/rex_pcre2/pcre2/linux64/pcre2.h b/csrc/rex_pcre2/pcre2/linux64/pcre2.h new file mode 100644 index 0000000..0833161 --- /dev/null +++ b/csrc/rex_pcre2/pcre2/linux64/pcre2.h @@ -0,0 +1,981 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This is the public header file for the PCRE library, second API, to be +#included by applications that call PCRE2 functions. + + Copyright (c) 2016-2019 University of Cambridge + +----------------------------------------------------------------------------- +Redistribution and use in source and binary forms, with or without +modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + * Neither the name of the University of Cambridge nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE +POSSIBILITY OF SUCH DAMAGE. +----------------------------------------------------------------------------- +*/ + +#ifndef PCRE2_H_IDEMPOTENT_GUARD +#define PCRE2_H_IDEMPOTENT_GUARD + +/* The current PCRE version information. */ + +#define PCRE2_MAJOR 10 +#define PCRE2_MINOR 34 +#define PCRE2_PRERELEASE -RC1 +#define PCRE2_DATE 2019-04-22 + +/* When an application links to a PCRE DLL in Windows, the symbols that are +imported have to be identified as such. When building PCRE2, the appropriate +export setting is defined in pcre2_internal.h, which includes this file. So we +don't change existing definitions of PCRE2_EXP_DECL. */ + +#if defined(_WIN32) && !defined(PCRE2_STATIC) +# ifndef PCRE2_EXP_DECL +# define PCRE2_EXP_DECL extern __declspec(dllimport) +# endif +#endif + +/* By default, we use the standard "extern" declarations. */ + +#ifndef PCRE2_EXP_DECL +# ifdef __cplusplus +# define PCRE2_EXP_DECL extern "C" +# else +# define PCRE2_EXP_DECL extern +# endif +#endif + +/* When compiling with the MSVC compiler, it is sometimes necessary to include +a "calling convention" before exported function names. (This is secondhand +information; I know nothing about MSVC myself). For example, something like + + void __cdecl function(....) + +might be needed. In order so make this easy, all the exported functions have +PCRE2_CALL_CONVENTION just before their names. It is rarely needed; if not +set, we ensure here that it has no effect. */ + +#ifndef PCRE2_CALL_CONVENTION +#define PCRE2_CALL_CONVENTION +#endif + +/* Have to include limits.h, stdlib.h, and inttypes.h to ensure that size_t and +uint8_t, UCHAR_MAX, etc are defined. Some systems that do have inttypes.h do +not have stdint.h, which is why we use inttypes.h, which according to the C +standard is a superset of stdint.h. If none of these headers are available, +the relevant values must be provided by some other means. */ + +#include +#include +#include + +/* Allow for C++ users compiling this directly. */ + +#ifdef __cplusplus +extern "C" { +#endif + +/* The following option bits can be passed to pcre2_compile(), pcre2_match(), +or pcre2_dfa_match(). PCRE2_NO_UTF_CHECK affects only the function to which it +is passed. Put these bits at the most significant end of the options word so +others can be added next to them */ + +#define PCRE2_ANCHORED 0x80000000u +#define PCRE2_NO_UTF_CHECK 0x40000000u +#define PCRE2_ENDANCHORED 0x20000000u + +/* The following option bits can be passed only to pcre2_compile(). However, +they may affect compilation, JIT compilation, and/or interpretive execution. +The following tags indicate which: + +C alters what is compiled by pcre2_compile() +J alters what is compiled by pcre2_jit_compile() +M is inspected during pcre2_match() execution +D is inspected during pcre2_dfa_match() execution +*/ + +#define PCRE2_ALLOW_EMPTY_CLASS 0x00000001u /* C */ +#define PCRE2_ALT_BSUX 0x00000002u /* C */ +#define PCRE2_AUTO_CALLOUT 0x00000004u /* C */ +#define PCRE2_CASELESS 0x00000008u /* C */ +#define PCRE2_DOLLAR_ENDONLY 0x00000010u /* J M D */ +#define PCRE2_DOTALL 0x00000020u /* C */ +#define PCRE2_DUPNAMES 0x00000040u /* C */ +#define PCRE2_EXTENDED 0x00000080u /* C */ +#define PCRE2_FIRSTLINE 0x00000100u /* J M D */ +#define PCRE2_MATCH_UNSET_BACKREF 0x00000200u /* C J M */ +#define PCRE2_MULTILINE 0x00000400u /* C */ +#define PCRE2_NEVER_UCP 0x00000800u /* C */ +#define PCRE2_NEVER_UTF 0x00001000u /* C */ +#define PCRE2_NO_AUTO_CAPTURE 0x00002000u /* C */ +#define PCRE2_NO_AUTO_POSSESS 0x00004000u /* C */ +#define PCRE2_NO_DOTSTAR_ANCHOR 0x00008000u /* C */ +#define PCRE2_NO_START_OPTIMIZE 0x00010000u /* J M D */ +#define PCRE2_UCP 0x00020000u /* C J M D */ +#define PCRE2_UNGREEDY 0x00040000u /* C */ +#define PCRE2_UTF 0x00080000u /* C J M D */ +#define PCRE2_NEVER_BACKSLASH_C 0x00100000u /* C */ +#define PCRE2_ALT_CIRCUMFLEX 0x00200000u /* J M D */ +#define PCRE2_ALT_VERBNAMES 0x00400000u /* C */ +#define PCRE2_USE_OFFSET_LIMIT 0x00800000u /* J M D */ +#define PCRE2_EXTENDED_MORE 0x01000000u /* C */ +#define PCRE2_LITERAL 0x02000000u /* C */ +#define PCRE2_MATCH_INVALID_UTF 0x04000000u /* J M D */ + +/* An additional compile options word is available in the compile context. */ + +#define PCRE2_EXTRA_ALLOW_SURROGATE_ESCAPES 0x00000001u /* C */ +#define PCRE2_EXTRA_BAD_ESCAPE_IS_LITERAL 0x00000002u /* C */ +#define PCRE2_EXTRA_MATCH_WORD 0x00000004u /* C */ +#define PCRE2_EXTRA_MATCH_LINE 0x00000008u /* C */ +#define PCRE2_EXTRA_ESCAPED_CR_IS_LF 0x00000010u /* C */ +#define PCRE2_EXTRA_ALT_BSUX 0x00000020u /* C */ + +/* These are for pcre2_jit_compile(). */ + +#define PCRE2_JIT_COMPLETE 0x00000001u /* For full matching */ +#define PCRE2_JIT_PARTIAL_SOFT 0x00000002u +#define PCRE2_JIT_PARTIAL_HARD 0x00000004u +#define PCRE2_JIT_INVALID_UTF 0x00000100u + +/* These are for pcre2_match(), pcre2_dfa_match(), pcre2_jit_match(), and +pcre2_substitute(). Some are allowed only for one of the functions, and in +these cases it is noted below. Note that PCRE2_ANCHORED, PCRE2_ENDANCHORED and +PCRE2_NO_UTF_CHECK can also be passed to these functions (though +pcre2_jit_match() ignores the latter since it bypasses all sanity checks). */ + +#define PCRE2_NOTBOL 0x00000001u +#define PCRE2_NOTEOL 0x00000002u +#define PCRE2_NOTEMPTY 0x00000004u /* ) These two must be kept */ +#define PCRE2_NOTEMPTY_ATSTART 0x00000008u /* ) adjacent to each other. */ +#define PCRE2_PARTIAL_SOFT 0x00000010u +#define PCRE2_PARTIAL_HARD 0x00000020u +#define PCRE2_DFA_RESTART 0x00000040u /* pcre2_dfa_match() only */ +#define PCRE2_DFA_SHORTEST 0x00000080u /* pcre2_dfa_match() only */ +#define PCRE2_SUBSTITUTE_GLOBAL 0x00000100u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_EXTENDED 0x00000200u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNSET_EMPTY 0x00000400u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNKNOWN_UNSET 0x00000800u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_OVERFLOW_LENGTH 0x00001000u /* pcre2_substitute() only */ +#define PCRE2_NO_JIT 0x00002000u /* Not for pcre2_dfa_match() */ +#define PCRE2_COPY_MATCHED_SUBJECT 0x00004000u + +/* Options for pcre2_pattern_convert(). */ + +#define PCRE2_CONVERT_UTF 0x00000001u +#define PCRE2_CONVERT_NO_UTF_CHECK 0x00000002u +#define PCRE2_CONVERT_POSIX_BASIC 0x00000004u +#define PCRE2_CONVERT_POSIX_EXTENDED 0x00000008u +#define PCRE2_CONVERT_GLOB 0x00000010u +#define PCRE2_CONVERT_GLOB_NO_WILD_SEPARATOR 0x00000030u +#define PCRE2_CONVERT_GLOB_NO_STARSTAR 0x00000050u + +/* Newline and \R settings, for use in compile contexts. The newline values +must be kept in step with values set in config.h and both sets must all be +greater than zero. */ + +#define PCRE2_NEWLINE_CR 1 +#define PCRE2_NEWLINE_LF 2 +#define PCRE2_NEWLINE_CRLF 3 +#define PCRE2_NEWLINE_ANY 4 +#define PCRE2_NEWLINE_ANYCRLF 5 +#define PCRE2_NEWLINE_NUL 6 + +#define PCRE2_BSR_UNICODE 1 +#define PCRE2_BSR_ANYCRLF 2 + +/* Error codes for pcre2_compile(). Some of these are also used by +pcre2_pattern_convert(). */ + +#define PCRE2_ERROR_END_BACKSLASH 101 +#define PCRE2_ERROR_END_BACKSLASH_C 102 +#define PCRE2_ERROR_UNKNOWN_ESCAPE 103 +#define PCRE2_ERROR_QUANTIFIER_OUT_OF_ORDER 104 +#define PCRE2_ERROR_QUANTIFIER_TOO_BIG 105 +#define PCRE2_ERROR_MISSING_SQUARE_BRACKET 106 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_CLASS 107 +#define PCRE2_ERROR_CLASS_RANGE_ORDER 108 +#define PCRE2_ERROR_QUANTIFIER_INVALID 109 +#define PCRE2_ERROR_INTERNAL_UNEXPECTED_REPEAT 110 +#define PCRE2_ERROR_INVALID_AFTER_PARENS_QUERY 111 +#define PCRE2_ERROR_POSIX_CLASS_NOT_IN_CLASS 112 +#define PCRE2_ERROR_POSIX_NO_SUPPORT_COLLATING 113 +#define PCRE2_ERROR_MISSING_CLOSING_PARENTHESIS 114 +#define PCRE2_ERROR_BAD_SUBPATTERN_REFERENCE 115 +#define PCRE2_ERROR_NULL_PATTERN 116 +#define PCRE2_ERROR_BAD_OPTIONS 117 +#define PCRE2_ERROR_MISSING_COMMENT_CLOSING 118 +#define PCRE2_ERROR_PARENTHESES_NEST_TOO_DEEP 119 +#define PCRE2_ERROR_PATTERN_TOO_LARGE 120 +#define PCRE2_ERROR_HEAP_FAILED 121 +#define PCRE2_ERROR_UNMATCHED_CLOSING_PARENTHESIS 122 +#define PCRE2_ERROR_INTERNAL_CODE_OVERFLOW 123 +#define PCRE2_ERROR_MISSING_CONDITION_CLOSING 124 +#define PCRE2_ERROR_LOOKBEHIND_NOT_FIXED_LENGTH 125 +#define PCRE2_ERROR_ZERO_RELATIVE_REFERENCE 126 +#define PCRE2_ERROR_TOO_MANY_CONDITION_BRANCHES 127 +#define PCRE2_ERROR_CONDITION_ASSERTION_EXPECTED 128 +#define PCRE2_ERROR_BAD_RELATIVE_REFERENCE 129 +#define PCRE2_ERROR_UNKNOWN_POSIX_CLASS 130 +#define PCRE2_ERROR_INTERNAL_STUDY_ERROR 131 +#define PCRE2_ERROR_UNICODE_NOT_SUPPORTED 132 +#define PCRE2_ERROR_PARENTHESES_STACK_CHECK 133 +#define PCRE2_ERROR_CODE_POINT_TOO_BIG 134 +#define PCRE2_ERROR_LOOKBEHIND_TOO_COMPLICATED 135 +#define PCRE2_ERROR_LOOKBEHIND_INVALID_BACKSLASH_C 136 +#define PCRE2_ERROR_UNSUPPORTED_ESCAPE_SEQUENCE 137 +#define PCRE2_ERROR_CALLOUT_NUMBER_TOO_BIG 138 +#define PCRE2_ERROR_MISSING_CALLOUT_CLOSING 139 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_VERB 140 +#define PCRE2_ERROR_UNRECOGNIZED_AFTER_QUERY_P 141 +#define PCRE2_ERROR_MISSING_NAME_TERMINATOR 142 +#define PCRE2_ERROR_DUPLICATE_SUBPATTERN_NAME 143 +#define PCRE2_ERROR_INVALID_SUBPATTERN_NAME 144 +#define PCRE2_ERROR_UNICODE_PROPERTIES_UNAVAILABLE 145 +#define PCRE2_ERROR_MALFORMED_UNICODE_PROPERTY 146 +#define PCRE2_ERROR_UNKNOWN_UNICODE_PROPERTY 147 +#define PCRE2_ERROR_SUBPATTERN_NAME_TOO_LONG 148 +#define PCRE2_ERROR_TOO_MANY_NAMED_SUBPATTERNS 149 +#define PCRE2_ERROR_CLASS_INVALID_RANGE 150 +#define PCRE2_ERROR_OCTAL_BYTE_TOO_BIG 151 +#define PCRE2_ERROR_INTERNAL_OVERRAN_WORKSPACE 152 +#define PCRE2_ERROR_INTERNAL_MISSING_SUBPATTERN 153 +#define PCRE2_ERROR_DEFINE_TOO_MANY_BRANCHES 154 +#define PCRE2_ERROR_BACKSLASH_O_MISSING_BRACE 155 +#define PCRE2_ERROR_INTERNAL_UNKNOWN_NEWLINE 156 +#define PCRE2_ERROR_BACKSLASH_G_SYNTAX 157 +#define PCRE2_ERROR_PARENS_QUERY_R_MISSING_CLOSING 158 +/* Error 159 is obsolete and should now never occur */ +#define PCRE2_ERROR_VERB_ARGUMENT_NOT_ALLOWED 159 +#define PCRE2_ERROR_VERB_UNKNOWN 160 +#define PCRE2_ERROR_SUBPATTERN_NUMBER_TOO_BIG 161 +#define PCRE2_ERROR_SUBPATTERN_NAME_EXPECTED 162 +#define PCRE2_ERROR_INTERNAL_PARSED_OVERFLOW 163 +#define PCRE2_ERROR_INVALID_OCTAL 164 +#define PCRE2_ERROR_SUBPATTERN_NAMES_MISMATCH 165 +#define PCRE2_ERROR_MARK_MISSING_ARGUMENT 166 +#define PCRE2_ERROR_INVALID_HEXADECIMAL 167 +#define PCRE2_ERROR_BACKSLASH_C_SYNTAX 168 +#define PCRE2_ERROR_BACKSLASH_K_SYNTAX 169 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_LOOKBEHINDS 170 +#define PCRE2_ERROR_BACKSLASH_N_IN_CLASS 171 +#define PCRE2_ERROR_CALLOUT_STRING_TOO_LONG 172 +#define PCRE2_ERROR_UNICODE_DISALLOWED_CODE_POINT 173 +#define PCRE2_ERROR_UTF_IS_DISABLED 174 +#define PCRE2_ERROR_UCP_IS_DISABLED 175 +#define PCRE2_ERROR_VERB_NAME_TOO_LONG 176 +#define PCRE2_ERROR_BACKSLASH_U_CODE_POINT_TOO_BIG 177 +#define PCRE2_ERROR_MISSING_OCTAL_OR_HEX_DIGITS 178 +#define PCRE2_ERROR_VERSION_CONDITION_SYNTAX 179 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_AUTO_POSSESS 180 +#define PCRE2_ERROR_CALLOUT_NO_STRING_DELIMITER 181 +#define PCRE2_ERROR_CALLOUT_BAD_STRING_DELIMITER 182 +#define PCRE2_ERROR_BACKSLASH_C_CALLER_DISABLED 183 +#define PCRE2_ERROR_QUERY_BARJX_NEST_TOO_DEEP 184 +#define PCRE2_ERROR_BACKSLASH_C_LIBRARY_DISABLED 185 +#define PCRE2_ERROR_PATTERN_TOO_COMPLICATED 186 +#define PCRE2_ERROR_LOOKBEHIND_TOO_LONG 187 +#define PCRE2_ERROR_PATTERN_STRING_TOO_LONG 188 +#define PCRE2_ERROR_INTERNAL_BAD_CODE 189 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_IN_SKIP 190 +#define PCRE2_ERROR_NO_SURROGATES_IN_UTF16 191 +#define PCRE2_ERROR_BAD_LITERAL_OPTIONS 192 +#define PCRE2_ERROR_SUPPORTED_ONLY_IN_UNICODE 193 +#define PCRE2_ERROR_INVALID_HYPHEN_IN_OPTIONS 194 +#define PCRE2_ERROR_ALPHA_ASSERTION_UNKNOWN 195 +#define PCRE2_ERROR_SCRIPT_RUN_NOT_AVAILABLE 196 +#define PCRE2_ERROR_TOO_MANY_CAPTURES 197 + + +/* "Expected" matching error codes: no match and partial match. */ + +#define PCRE2_ERROR_NOMATCH (-1) +#define PCRE2_ERROR_PARTIAL (-2) + +/* Error codes for UTF-8 validity checks */ + +#define PCRE2_ERROR_UTF8_ERR1 (-3) +#define PCRE2_ERROR_UTF8_ERR2 (-4) +#define PCRE2_ERROR_UTF8_ERR3 (-5) +#define PCRE2_ERROR_UTF8_ERR4 (-6) +#define PCRE2_ERROR_UTF8_ERR5 (-7) +#define PCRE2_ERROR_UTF8_ERR6 (-8) +#define PCRE2_ERROR_UTF8_ERR7 (-9) +#define PCRE2_ERROR_UTF8_ERR8 (-10) +#define PCRE2_ERROR_UTF8_ERR9 (-11) +#define PCRE2_ERROR_UTF8_ERR10 (-12) +#define PCRE2_ERROR_UTF8_ERR11 (-13) +#define PCRE2_ERROR_UTF8_ERR12 (-14) +#define PCRE2_ERROR_UTF8_ERR13 (-15) +#define PCRE2_ERROR_UTF8_ERR14 (-16) +#define PCRE2_ERROR_UTF8_ERR15 (-17) +#define PCRE2_ERROR_UTF8_ERR16 (-18) +#define PCRE2_ERROR_UTF8_ERR17 (-19) +#define PCRE2_ERROR_UTF8_ERR18 (-20) +#define PCRE2_ERROR_UTF8_ERR19 (-21) +#define PCRE2_ERROR_UTF8_ERR20 (-22) +#define PCRE2_ERROR_UTF8_ERR21 (-23) + +/* Error codes for UTF-16 validity checks */ + +#define PCRE2_ERROR_UTF16_ERR1 (-24) +#define PCRE2_ERROR_UTF16_ERR2 (-25) +#define PCRE2_ERROR_UTF16_ERR3 (-26) + +/* Error codes for UTF-32 validity checks */ + +#define PCRE2_ERROR_UTF32_ERR1 (-27) +#define PCRE2_ERROR_UTF32_ERR2 (-28) + +/* Miscellaneous error codes for pcre2[_dfa]_match(), substring extraction +functions, context functions, and serializing functions. They are in numerical +order. Originally they were in alphabetical order too, but now that PCRE2 is +released, the numbers must not be changed. */ + +#define PCRE2_ERROR_BADDATA (-29) +#define PCRE2_ERROR_MIXEDTABLES (-30) /* Name was changed */ +#define PCRE2_ERROR_BADMAGIC (-31) +#define PCRE2_ERROR_BADMODE (-32) +#define PCRE2_ERROR_BADOFFSET (-33) +#define PCRE2_ERROR_BADOPTION (-34) +#define PCRE2_ERROR_BADREPLACEMENT (-35) +#define PCRE2_ERROR_BADUTFOFFSET (-36) +#define PCRE2_ERROR_CALLOUT (-37) /* Never used by PCRE2 itself */ +#define PCRE2_ERROR_DFA_BADRESTART (-38) +#define PCRE2_ERROR_DFA_RECURSE (-39) +#define PCRE2_ERROR_DFA_UCOND (-40) +#define PCRE2_ERROR_DFA_UFUNC (-41) +#define PCRE2_ERROR_DFA_UITEM (-42) +#define PCRE2_ERROR_DFA_WSSIZE (-43) +#define PCRE2_ERROR_INTERNAL (-44) +#define PCRE2_ERROR_JIT_BADOPTION (-45) +#define PCRE2_ERROR_JIT_STACKLIMIT (-46) +#define PCRE2_ERROR_MATCHLIMIT (-47) +#define PCRE2_ERROR_NOMEMORY (-48) +#define PCRE2_ERROR_NOSUBSTRING (-49) +#define PCRE2_ERROR_NOUNIQUESUBSTRING (-50) +#define PCRE2_ERROR_NULL (-51) +#define PCRE2_ERROR_RECURSELOOP (-52) +#define PCRE2_ERROR_DEPTHLIMIT (-53) +#define PCRE2_ERROR_RECURSIONLIMIT (-53) /* Obsolete synonym */ +#define PCRE2_ERROR_UNAVAILABLE (-54) +#define PCRE2_ERROR_UNSET (-55) +#define PCRE2_ERROR_BADOFFSETLIMIT (-56) +#define PCRE2_ERROR_BADREPESCAPE (-57) +#define PCRE2_ERROR_REPMISSINGBRACE (-58) +#define PCRE2_ERROR_BADSUBSTITUTION (-59) +#define PCRE2_ERROR_BADSUBSPATTERN (-60) +#define PCRE2_ERROR_TOOMANYREPLACE (-61) +#define PCRE2_ERROR_BADSERIALIZEDDATA (-62) +#define PCRE2_ERROR_HEAPLIMIT (-63) +#define PCRE2_ERROR_CONVERT_SYNTAX (-64) +#define PCRE2_ERROR_INTERNAL_DUPMATCH (-65) +#define PCRE2_ERROR_DFA_UINVALID_UTF (-66) + + +/* Request types for pcre2_pattern_info() */ + +#define PCRE2_INFO_ALLOPTIONS 0 +#define PCRE2_INFO_ARGOPTIONS 1 +#define PCRE2_INFO_BACKREFMAX 2 +#define PCRE2_INFO_BSR 3 +#define PCRE2_INFO_CAPTURECOUNT 4 +#define PCRE2_INFO_FIRSTCODEUNIT 5 +#define PCRE2_INFO_FIRSTCODETYPE 6 +#define PCRE2_INFO_FIRSTBITMAP 7 +#define PCRE2_INFO_HASCRORLF 8 +#define PCRE2_INFO_JCHANGED 9 +#define PCRE2_INFO_JITSIZE 10 +#define PCRE2_INFO_LASTCODEUNIT 11 +#define PCRE2_INFO_LASTCODETYPE 12 +#define PCRE2_INFO_MATCHEMPTY 13 +#define PCRE2_INFO_MATCHLIMIT 14 +#define PCRE2_INFO_MAXLOOKBEHIND 15 +#define PCRE2_INFO_MINLENGTH 16 +#define PCRE2_INFO_NAMECOUNT 17 +#define PCRE2_INFO_NAMEENTRYSIZE 18 +#define PCRE2_INFO_NAMETABLE 19 +#define PCRE2_INFO_NEWLINE 20 +#define PCRE2_INFO_DEPTHLIMIT 21 +#define PCRE2_INFO_RECURSIONLIMIT 21 /* Obsolete synonym */ +#define PCRE2_INFO_SIZE 22 +#define PCRE2_INFO_HASBACKSLASHC 23 +#define PCRE2_INFO_FRAMESIZE 24 +#define PCRE2_INFO_HEAPLIMIT 25 +#define PCRE2_INFO_EXTRAOPTIONS 26 + +/* Request types for pcre2_config(). */ + +#define PCRE2_CONFIG_BSR 0 +#define PCRE2_CONFIG_JIT 1 +#define PCRE2_CONFIG_JITTARGET 2 +#define PCRE2_CONFIG_LINKSIZE 3 +#define PCRE2_CONFIG_MATCHLIMIT 4 +#define PCRE2_CONFIG_NEWLINE 5 +#define PCRE2_CONFIG_PARENSLIMIT 6 +#define PCRE2_CONFIG_DEPTHLIMIT 7 +#define PCRE2_CONFIG_RECURSIONLIMIT 7 /* Obsolete synonym */ +#define PCRE2_CONFIG_STACKRECURSE 8 /* Obsolete */ +#define PCRE2_CONFIG_UNICODE 9 +#define PCRE2_CONFIG_UNICODE_VERSION 10 +#define PCRE2_CONFIG_VERSION 11 +#define PCRE2_CONFIG_HEAPLIMIT 12 +#define PCRE2_CONFIG_NEVER_BACKSLASH_C 13 +#define PCRE2_CONFIG_COMPILED_WIDTHS 14 + + +/* Types for code units in patterns and subject strings. */ + +typedef uint8_t PCRE2_UCHAR8; +typedef uint16_t PCRE2_UCHAR16; +typedef uint32_t PCRE2_UCHAR32; + +typedef const PCRE2_UCHAR8 *PCRE2_SPTR8; +typedef const PCRE2_UCHAR16 *PCRE2_SPTR16; +typedef const PCRE2_UCHAR32 *PCRE2_SPTR32; + +/* The PCRE2_SIZE type is used for all string lengths and offsets in PCRE2, +including pattern offsets for errors and subject offsets after a match. We +define special values to indicate zero-terminated strings and unset offsets in +the offset vector (ovector). */ + +#define PCRE2_SIZE size_t +#define PCRE2_SIZE_MAX SIZE_MAX +#define PCRE2_ZERO_TERMINATED (~(PCRE2_SIZE)0) +#define PCRE2_UNSET (~(PCRE2_SIZE)0) + +/* Generic types for opaque structures and JIT callback functions. These +declarations are defined in a macro that is expanded for each width later. */ + +#define PCRE2_TYPES_LIST \ +struct pcre2_real_general_context; \ +typedef struct pcre2_real_general_context pcre2_general_context; \ +\ +struct pcre2_real_compile_context; \ +typedef struct pcre2_real_compile_context pcre2_compile_context; \ +\ +struct pcre2_real_match_context; \ +typedef struct pcre2_real_match_context pcre2_match_context; \ +\ +struct pcre2_real_convert_context; \ +typedef struct pcre2_real_convert_context pcre2_convert_context; \ +\ +struct pcre2_real_code; \ +typedef struct pcre2_real_code pcre2_code; \ +\ +struct pcre2_real_match_data; \ +typedef struct pcre2_real_match_data pcre2_match_data; \ +\ +struct pcre2_real_jit_stack; \ +typedef struct pcre2_real_jit_stack pcre2_jit_stack; \ +\ +typedef pcre2_jit_stack *(*pcre2_jit_callback)(void *); + + +/* The structures for passing out data via callout functions. We use structures +so that new fields can be added on the end in future versions, without changing +the API of the function, thereby allowing old clients to work without +modification. Define the generic versions in a macro; the width-specific +versions are generated from this macro below. */ + +/* Flags for the callout_flags field. These are cleared after a callout. */ + +#define PCRE2_CALLOUT_STARTMATCH 0x00000001u /* Set for each bumpalong */ +#define PCRE2_CALLOUT_BACKTRACK 0x00000002u /* Set after a backtrack */ + +#define PCRE2_STRUCTURE_LIST \ +typedef struct pcre2_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + uint32_t capture_top; /* Max current capture */ \ + uint32_t capture_last; /* Most recently closed capture */ \ + PCRE2_SIZE *offset_vector; /* The offset vector */ \ + PCRE2_SPTR mark; /* Pointer to current mark or NULL */ \ + PCRE2_SPTR subject; /* The subject being matched */ \ + PCRE2_SIZE subject_length; /* The length of the subject */ \ + PCRE2_SIZE start_match; /* Offset to start of this match attempt */ \ + PCRE2_SIZE current_position; /* Where we currently are in the subject */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + /* ------------------- Added for Version 1 -------------------------- */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------- Added for Version 2 -------------------------- */ \ + uint32_t callout_flags; /* See above for list */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_block; \ +\ +typedef struct pcre2_callout_enumerate_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_enumerate_block; \ +\ +typedef struct pcre2_substitute_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SPTR input; /* Pointer to input subject string */ \ + PCRE2_SPTR output; /* Pointer to output buffer */ \ + PCRE2_SIZE output_offsets[2]; /* Changed portion of the output */ \ + PCRE2_SIZE *ovector; /* Pointer to current ovector */ \ + uint32_t oveccount; /* Count of pairs set in ovector */ \ + uint32_t subscount; /* Substitution number */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_substitute_callout_block; + + +/* List the generic forms of all other functions in macros, which will be +expanded for each width below. Start with functions that give general +information. */ + +#define PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION pcre2_config(uint32_t, void *); + + +/* Functions for manipulating contexts. */ + +#define PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_copy(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_create(void *(*)(PCRE2_SIZE, void *), \ + void (*)(void *, void *), void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_general_context_free(pcre2_general_context *); + +#define PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_copy(pcre2_compile_context *); \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_create(pcre2_general_context *);\ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_compile_context_free(pcre2_compile_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_bsr(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_character_tables(pcre2_compile_context *, const unsigned char *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_extra_options(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_max_pattern_length(pcre2_compile_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_newline(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_parens_nest_limit(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_recursion_guard(pcre2_compile_context *, \ + int (*)(uint32_t, void *), void *); + +#define PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_copy(pcre2_match_context *); \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_context_free(pcre2_match_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_callout(pcre2_match_context *, \ + int (*)(pcre2_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_substitute_callout(pcre2_match_context *, \ + int (*)(pcre2_substitute_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_depth_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_heap_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_match_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_offset_limit(pcre2_match_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_memory_management(pcre2_match_context *, \ + void *(*)(PCRE2_SIZE, void *), void (*)(void *, void *), void *); + +#define PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_copy(pcre2_convert_context *); \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_convert_context_free(pcre2_convert_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_escape(pcre2_convert_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_separator(pcre2_convert_context *, uint32_t); + + +/* Functions concerned with compiling a pattern to PCRE internal code. */ + +#define PCRE2_COMPILE_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_compile(PCRE2_SPTR, PCRE2_SIZE, uint32_t, int *, PCRE2_SIZE *, \ + pcre2_compile_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_code_free(pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy(const pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy_with_tables(const pcre2_code *); + + +/* Functions that give information about a compiled pattern. */ + +#define PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_info(const pcre2_code *, uint32_t, void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_callout_enumerate(const pcre2_code *, \ + int (*)(pcre2_callout_enumerate_block *, void *), void *); + + +/* Functions for running a match and inspecting the result. */ + +#define PCRE2_MATCH_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create(uint32_t, pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create_from_pattern(const pcre2_code *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_dfa_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, int *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_data_free(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SPTR PCRE2_CALL_CONVENTION \ + pcre2_get_mark(pcre2_match_data *); \ +PCRE2_EXP_DECL uint32_t PCRE2_CALL_CONVENTION \ + pcre2_get_ovector_count(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + *pcre2_get_ovector_pointer(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + pcre2_get_startchar(pcre2_match_data *); + + +/* Convenience functions for handling matched substrings. */ + +#define PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_free(PCRE2_UCHAR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_bynumber(pcre2_match_data *, uint32_t, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_nametable_scan(const pcre2_code *, PCRE2_SPTR, PCRE2_SPTR *, \ + PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_number_from_name(const pcre2_code *, PCRE2_SPTR); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_list_free(PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_list_get(pcre2_match_data *, PCRE2_UCHAR ***, PCRE2_SIZE **); + +/* Functions for serializing / deserializing compiled patterns. */ + +#define PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_encode(const pcre2_code **, int32_t, uint8_t **, \ + PCRE2_SIZE *, pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_decode(pcre2_code **, int32_t, const uint8_t *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_get_number_of_codes(const uint8_t *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_serialize_free(uint8_t *); + + +/* Convenience function for match + substitute. */ + +#define PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substitute(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, PCRE2_SPTR, \ + PCRE2_SIZE, PCRE2_UCHAR *, PCRE2_SIZE *); + + +/* Functions for converting pattern source strings. */ + +#define PCRE2_CONVERT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_convert(PCRE2_SPTR, PCRE2_SIZE, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *, pcre2_convert_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_converted_pattern_free(PCRE2_UCHAR *); + + +/* Functions for JIT processing */ + +#define PCRE2_JIT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_compile(pcre2_code *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_free_unused_memory(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_jit_stack PCRE2_CALL_CONVENTION \ + *pcre2_jit_stack_create(PCRE2_SIZE, PCRE2_SIZE, pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_assign(pcre2_match_context *, pcre2_jit_callback, void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_free(pcre2_jit_stack *); + + +/* Other miscellaneous functions. */ + +#define PCRE2_OTHER_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_get_error_message(int, PCRE2_UCHAR *, PCRE2_SIZE); \ +PCRE2_EXP_DECL const uint8_t PCRE2_CALL_CONVENTION \ + *pcre2_maketables(pcre2_general_context *); \ + + +/* Define macros that generate width-specific names from generic versions. The +three-level macro scheme is necessary to get the macros expanded when we want +them to be. First we get the width from PCRE2_LOCAL_WIDTH, which is used for +generating three versions of everything below. After that, PCRE2_SUFFIX will be +re-defined to use PCRE2_CODE_UNIT_WIDTH, for use when macros such as +pcre2_compile are called by application code. */ + +#define PCRE2_JOIN(a,b) a ## b +#define PCRE2_GLUE(a,b) PCRE2_JOIN(a,b) +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a,PCRE2_LOCAL_WIDTH) + + +/* Data types */ + +#define PCRE2_UCHAR PCRE2_SUFFIX(PCRE2_UCHAR) +#define PCRE2_SPTR PCRE2_SUFFIX(PCRE2_SPTR) + +#define pcre2_code PCRE2_SUFFIX(pcre2_code_) +#define pcre2_jit_callback PCRE2_SUFFIX(pcre2_jit_callback_) +#define pcre2_jit_stack PCRE2_SUFFIX(pcre2_jit_stack_) + +#define pcre2_real_code PCRE2_SUFFIX(pcre2_real_code_) +#define pcre2_real_general_context PCRE2_SUFFIX(pcre2_real_general_context_) +#define pcre2_real_compile_context PCRE2_SUFFIX(pcre2_real_compile_context_) +#define pcre2_real_convert_context PCRE2_SUFFIX(pcre2_real_convert_context_) +#define pcre2_real_match_context PCRE2_SUFFIX(pcre2_real_match_context_) +#define pcre2_real_jit_stack PCRE2_SUFFIX(pcre2_real_jit_stack_) +#define pcre2_real_match_data PCRE2_SUFFIX(pcre2_real_match_data_) + + +/* Data blocks */ + +#define pcre2_callout_block PCRE2_SUFFIX(pcre2_callout_block_) +#define pcre2_callout_enumerate_block PCRE2_SUFFIX(pcre2_callout_enumerate_block_) +#define pcre2_substitute_callout_block PCRE2_SUFFIX(pcre2_substitute_callout_block_) +#define pcre2_general_context PCRE2_SUFFIX(pcre2_general_context_) +#define pcre2_compile_context PCRE2_SUFFIX(pcre2_compile_context_) +#define pcre2_convert_context PCRE2_SUFFIX(pcre2_convert_context_) +#define pcre2_match_context PCRE2_SUFFIX(pcre2_match_context_) +#define pcre2_match_data PCRE2_SUFFIX(pcre2_match_data_) + + +/* Functions: the complete list in alphabetical order */ + +#define pcre2_callout_enumerate PCRE2_SUFFIX(pcre2_callout_enumerate_) +#define pcre2_code_copy PCRE2_SUFFIX(pcre2_code_copy_) +#define pcre2_code_copy_with_tables PCRE2_SUFFIX(pcre2_code_copy_with_tables_) +#define pcre2_code_free PCRE2_SUFFIX(pcre2_code_free_) +#define pcre2_compile PCRE2_SUFFIX(pcre2_compile_) +#define pcre2_compile_context_copy PCRE2_SUFFIX(pcre2_compile_context_copy_) +#define pcre2_compile_context_create PCRE2_SUFFIX(pcre2_compile_context_create_) +#define pcre2_compile_context_free PCRE2_SUFFIX(pcre2_compile_context_free_) +#define pcre2_config PCRE2_SUFFIX(pcre2_config_) +#define pcre2_convert_context_copy PCRE2_SUFFIX(pcre2_convert_context_copy_) +#define pcre2_convert_context_create PCRE2_SUFFIX(pcre2_convert_context_create_) +#define pcre2_convert_context_free PCRE2_SUFFIX(pcre2_convert_context_free_) +#define pcre2_converted_pattern_free PCRE2_SUFFIX(pcre2_converted_pattern_free_) +#define pcre2_dfa_match PCRE2_SUFFIX(pcre2_dfa_match_) +#define pcre2_general_context_copy PCRE2_SUFFIX(pcre2_general_context_copy_) +#define pcre2_general_context_create PCRE2_SUFFIX(pcre2_general_context_create_) +#define pcre2_general_context_free PCRE2_SUFFIX(pcre2_general_context_free_) +#define pcre2_get_error_message PCRE2_SUFFIX(pcre2_get_error_message_) +#define pcre2_get_mark PCRE2_SUFFIX(pcre2_get_mark_) +#define pcre2_get_ovector_pointer PCRE2_SUFFIX(pcre2_get_ovector_pointer_) +#define pcre2_get_ovector_count PCRE2_SUFFIX(pcre2_get_ovector_count_) +#define pcre2_get_startchar PCRE2_SUFFIX(pcre2_get_startchar_) +#define pcre2_jit_compile PCRE2_SUFFIX(pcre2_jit_compile_) +#define pcre2_jit_match PCRE2_SUFFIX(pcre2_jit_match_) +#define pcre2_jit_free_unused_memory PCRE2_SUFFIX(pcre2_jit_free_unused_memory_) +#define pcre2_jit_stack_assign PCRE2_SUFFIX(pcre2_jit_stack_assign_) +#define pcre2_jit_stack_create PCRE2_SUFFIX(pcre2_jit_stack_create_) +#define pcre2_jit_stack_free PCRE2_SUFFIX(pcre2_jit_stack_free_) +#define pcre2_maketables PCRE2_SUFFIX(pcre2_maketables_) +#define pcre2_match PCRE2_SUFFIX(pcre2_match_) +#define pcre2_match_context_copy PCRE2_SUFFIX(pcre2_match_context_copy_) +#define pcre2_match_context_create PCRE2_SUFFIX(pcre2_match_context_create_) +#define pcre2_match_context_free PCRE2_SUFFIX(pcre2_match_context_free_) +#define pcre2_match_data_create PCRE2_SUFFIX(pcre2_match_data_create_) +#define pcre2_match_data_create_from_pattern PCRE2_SUFFIX(pcre2_match_data_create_from_pattern_) +#define pcre2_match_data_free PCRE2_SUFFIX(pcre2_match_data_free_) +#define pcre2_pattern_convert PCRE2_SUFFIX(pcre2_pattern_convert_) +#define pcre2_pattern_info PCRE2_SUFFIX(pcre2_pattern_info_) +#define pcre2_serialize_decode PCRE2_SUFFIX(pcre2_serialize_decode_) +#define pcre2_serialize_encode PCRE2_SUFFIX(pcre2_serialize_encode_) +#define pcre2_serialize_free PCRE2_SUFFIX(pcre2_serialize_free_) +#define pcre2_serialize_get_number_of_codes PCRE2_SUFFIX(pcre2_serialize_get_number_of_codes_) +#define pcre2_set_bsr PCRE2_SUFFIX(pcre2_set_bsr_) +#define pcre2_set_callout PCRE2_SUFFIX(pcre2_set_callout_) +#define pcre2_set_character_tables PCRE2_SUFFIX(pcre2_set_character_tables_) +#define pcre2_set_compile_extra_options PCRE2_SUFFIX(pcre2_set_compile_extra_options_) +#define pcre2_set_compile_recursion_guard PCRE2_SUFFIX(pcre2_set_compile_recursion_guard_) +#define pcre2_set_depth_limit PCRE2_SUFFIX(pcre2_set_depth_limit_) +#define pcre2_set_glob_escape PCRE2_SUFFIX(pcre2_set_glob_escape_) +#define pcre2_set_glob_separator PCRE2_SUFFIX(pcre2_set_glob_separator_) +#define pcre2_set_heap_limit PCRE2_SUFFIX(pcre2_set_heap_limit_) +#define pcre2_set_match_limit PCRE2_SUFFIX(pcre2_set_match_limit_) +#define pcre2_set_max_pattern_length PCRE2_SUFFIX(pcre2_set_max_pattern_length_) +#define pcre2_set_newline PCRE2_SUFFIX(pcre2_set_newline_) +#define pcre2_set_parens_nest_limit PCRE2_SUFFIX(pcre2_set_parens_nest_limit_) +#define pcre2_set_offset_limit PCRE2_SUFFIX(pcre2_set_offset_limit_) +#define pcre2_set_substitute_callout PCRE2_SUFFIX(pcre2_set_substitute_callout_) +#define pcre2_substitute PCRE2_SUFFIX(pcre2_substitute_) +#define pcre2_substring_copy_byname PCRE2_SUFFIX(pcre2_substring_copy_byname_) +#define pcre2_substring_copy_bynumber PCRE2_SUFFIX(pcre2_substring_copy_bynumber_) +#define pcre2_substring_free PCRE2_SUFFIX(pcre2_substring_free_) +#define pcre2_substring_get_byname PCRE2_SUFFIX(pcre2_substring_get_byname_) +#define pcre2_substring_get_bynumber PCRE2_SUFFIX(pcre2_substring_get_bynumber_) +#define pcre2_substring_length_byname PCRE2_SUFFIX(pcre2_substring_length_byname_) +#define pcre2_substring_length_bynumber PCRE2_SUFFIX(pcre2_substring_length_bynumber_) +#define pcre2_substring_list_get PCRE2_SUFFIX(pcre2_substring_list_get_) +#define pcre2_substring_list_free PCRE2_SUFFIX(pcre2_substring_list_free_) +#define pcre2_substring_nametable_scan PCRE2_SUFFIX(pcre2_substring_nametable_scan_) +#define pcre2_substring_number_from_name PCRE2_SUFFIX(pcre2_substring_number_from_name_) + +/* Keep this old function name for backwards compatibility */ +#define pcre2_set_recursion_limit PCRE2_SUFFIX(pcre2_set_recursion_limit_) + +/* Keep this obsolete function for backwards compatibility: it is now a noop. */ +#define pcre2_set_recursion_memory_management PCRE2_SUFFIX(pcre2_set_recursion_memory_management_) + +/* Now generate all three sets of width-specific structures and function +prototypes. */ + +#define PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS \ +PCRE2_TYPES_LIST \ +PCRE2_STRUCTURE_LIST \ +PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_FUNCTIONS \ +PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_FUNCTIONS \ +PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_MATCH_FUNCTIONS \ +PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_JIT_FUNCTIONS \ +PCRE2_OTHER_FUNCTIONS + +#define PCRE2_LOCAL_WIDTH 8 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 16 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 32 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +/* Undefine the list macros; they are no longer needed. */ + +#undef PCRE2_TYPES_LIST +#undef PCRE2_STRUCTURE_LIST +#undef PCRE2_GENERAL_INFO_FUNCTIONS +#undef PCRE2_GENERAL_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_CONTEXT_FUNCTIONS +#undef PCRE2_CONVERT_CONTEXT_FUNCTIONS +#undef PCRE2_MATCH_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_FUNCTIONS +#undef PCRE2_PATTERN_INFO_FUNCTIONS +#undef PCRE2_MATCH_FUNCTIONS +#undef PCRE2_SUBSTRING_FUNCTIONS +#undef PCRE2_SERIALIZE_FUNCTIONS +#undef PCRE2_SUBSTITUTE_FUNCTION +#undef PCRE2_JIT_FUNCTIONS +#undef PCRE2_OTHER_FUNCTIONS +#undef PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS + +/* PCRE2_CODE_UNIT_WIDTH must be defined. If it is 8, 16, or 32, redefine +PCRE2_SUFFIX to use it. If it is 0, undefine the other macros and make +PCRE2_SUFFIX a no-op. Otherwise, generate an error. */ + +#undef PCRE2_SUFFIX +#ifndef PCRE2_CODE_UNIT_WIDTH +#error PCRE2_CODE_UNIT_WIDTH must be defined before including pcre2.h. +#error Use 8, 16, or 32; or 0 for a multi-width application. +#else /* PCRE2_CODE_UNIT_WIDTH is defined */ +#if PCRE2_CODE_UNIT_WIDTH == 8 || \ + PCRE2_CODE_UNIT_WIDTH == 16 || \ + PCRE2_CODE_UNIT_WIDTH == 32 +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a, PCRE2_CODE_UNIT_WIDTH) +#elif PCRE2_CODE_UNIT_WIDTH == 0 +#undef PCRE2_JOIN +#undef PCRE2_GLUE +#define PCRE2_SUFFIX(a) a +#else +#error PCRE2_CODE_UNIT_WIDTH must be 0, 8, 16, or 32. +#endif +#endif /* PCRE2_CODE_UNIT_WIDTH is defined */ + +#ifdef __cplusplus +} /* extern "C" */ +#endif + +#endif /* PCRE2_H_IDEMPOTENT_GUARD */ + +/* End of pcre2.h */ diff --git a/csrc/rex_pcre2/pcre2/linux64/pcre2_chartables.c b/csrc/rex_pcre2/pcre2/linux64/pcre2_chartables.c new file mode 100644 index 0000000..0e07edb --- /dev/null +++ b/csrc/rex_pcre2/pcre2/linux64/pcre2_chartables.c @@ -0,0 +1,198 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This file was automatically written by the dftables auxiliary +program. It contains character tables that are used when no external +tables are passed to PCRE2 by the application that calls it. The tables +are used only for characters whose code values are less than 256. */ + +/*The dftables program (which is distributed with PCRE2) can be used to +build alternative versions of this file. This is necessary if you are +running in an EBCDIC environment, or if you want to default to a different +encoding, for example ISO-8859-1. When dftables is run, it creates these +tables in the current locale. This happens automatically if PCRE2 is +configured with --enable-rebuild-chartables. */ + +/* The following #include is present because without it gcc 4.x may remove +the array definition from the final binary if PCRE2 is built into a static +library and dead code stripping is activated. This leads to link errors. +Pulling in the header ensures that the array gets flagged as "someone +outside this compilation unit might reference this" and so it will always +be supplied to the linker. */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "pcre2_internal.h" + +const uint8_t PRIV(default_tables)[] = { + +/* This table is a lower casing table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table is a case flipping table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 65, 66, 67, 68, 69, 70, 71, + 72, 73, 74, 75, 76, 77, 78, 79, + 80, 81, 82, 83, 84, 85, 86, 87, + 88, 89, 90,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table contains bit maps for various character classes. Each map is 32 +bytes long and the bits run from the least significant end of each byte. The +classes that have their own maps are: space, xdigit, digit, upper, lower, word, +graph print, punct, and cntrl. Other classes are built from combinations. */ + + 0x00,0x3e,0x00,0x00,0x01,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x7e,0x00,0x00,0x00,0x7e,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0xfe,0xff,0xff,0x07,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0xfe,0xff,0xff,0x87,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xff,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0x00,0xfc, + 0x01,0x00,0x00,0xf8,0x01,0x00,0x00,0x78, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0xff,0xff,0xff,0xff,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + +/* This table identifies various classes of character by individual bits: + 0x01 white space character + 0x02 letter + 0x04 lower case letter + 0x08 decimal digit + 0x10 alphanumeric or '_' +*/ + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 */ + 0x00,0x01,0x01,0x01,0x01,0x01,0x00,0x00, /* 8- 15 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */ + 0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - ' */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ( - / */ + 0x18,0x18,0x18,0x18,0x18,0x18,0x18,0x18, /* 0 - 7 */ + 0x18,0x18,0x00,0x00,0x00,0x00,0x00,0x00, /* 8 - ? */ + 0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* @ - G */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* H - O */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* P - W */ + 0x12,0x12,0x12,0x00,0x00,0x00,0x00,0x10, /* X - _ */ + 0x00,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* ` - g */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* h - o */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* p - w */ + 0x16,0x16,0x16,0x00,0x00,0x00,0x00,0x00, /* x -127 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */ + +/* End of pcre2_chartables.c */ diff --git a/csrc/rex_pcre2/pcre2/mingw32/config.h b/csrc/rex_pcre2/pcre2/mingw32/config.h new file mode 100755 index 0000000..190ddef --- /dev/null +++ b/csrc/rex_pcre2/pcre2/mingw32/config.h @@ -0,0 +1,54 @@ +/* config.h for CMake builds */ + +#define HAVE_DIRENT_H 1 +#define HAVE_INTTYPES_H 1 +#define HAVE_STDINT_H 1 +#define HAVE_STRERROR 1 +#define HAVE_SYS_STAT_H 1 +#define HAVE_SYS_TYPES_H 1 +#define HAVE_UNISTD_H 1 +#define HAVE_WINDOWS_H 1 + +/* #undef HAVE_BCOPY */ +#define HAVE_MEMMOVE 1 + +#define PCRE2_STATIC 1 + +#define SUPPORT_PCRE2_8 1 +/* #undef SUPPORT_PCRE2_16 */ +/* #undef SUPPORT_PCRE2_32 */ +/* #undef PCRE2_DEBUG */ +/* #undef DISABLE_PERCENT_ZT */ + +#define SUPPORT_LIBBZ2 1 +/* #undef SUPPORT_LIBEDIT */ +#define SUPPORT_LIBREADLINE 1 +#define SUPPORT_LIBZ 1 + +/* #undef SUPPORT_JIT */ +/* #undef SLJIT_PROT_EXECUTABLE_ALLOCATOR */ +#define SUPPORT_PCRE2GREP_JIT 1 +#define SUPPORT_PCRE2GREP_CALLOUT 1 +#define SUPPORT_PCRE2GREP_CALLOUT_FORK 1 +#define SUPPORT_UNICODE 1 +/* #undef SUPPORT_VALGRIND */ + +/* #undef BSR_ANYCRLF */ +/* #undef EBCDIC */ +/* #undef EBCDIC_NL25 */ +/* #undef HEAP_MATCH_RECURSE */ +/* #undef NEVER_BACKSLASH_C */ + +#define LINK_SIZE 2 +#define HEAP_LIMIT 20000000 +#define MATCH_LIMIT 10000000 +#define MATCH_LIMIT_DEPTH MATCH_LIMIT +#define NEWLINE_DEFAULT 2 +#define PARENS_NEST_LIMIT 250 +#define PCRE2GREP_BUFSIZE 20480 +#define PCRE2GREP_MAX_BUFSIZE 1048576 + +#define MAX_NAME_SIZE 32 +#define MAX_NAME_COUNT 10000 + +/* end config.h for CMake builds */ diff --git a/csrc/rex_pcre2/pcre2/mingw32/pcre2.h b/csrc/rex_pcre2/pcre2/mingw32/pcre2.h new file mode 100755 index 0000000..32a9b9e --- /dev/null +++ b/csrc/rex_pcre2/pcre2/mingw32/pcre2.h @@ -0,0 +1,981 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This is the public header file for the PCRE library, second API, to be +#included by applications that call PCRE2 functions. + + Copyright (c) 2016-2019 University of Cambridge + +----------------------------------------------------------------------------- +Redistribution and use in source and binary forms, with or without +modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + * Neither the name of the University of Cambridge nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE +POSSIBILITY OF SUCH DAMAGE. +----------------------------------------------------------------------------- +*/ + +#ifndef PCRE2_H_IDEMPOTENT_GUARD +#define PCRE2_H_IDEMPOTENT_GUARD + +/* The current PCRE version information. */ + +#define PCRE2_MAJOR 10 +#define PCRE2_MINOR 34 +#define PCRE2_PRERELEASE -RC1 +#define PCRE2_DATE 2019-04-22 + +/* When an application links to a PCRE DLL in Windows, the symbols that are +imported have to be identified as such. When building PCRE2, the appropriate +export setting is defined in pcre2_internal.h, which includes this file. So we +don't change existing definitions of PCRE2_EXP_DECL. */ + +#if defined(_WIN32) && !defined(PCRE2_STATIC) +# ifndef PCRE2_EXP_DECL +# define PCRE2_EXP_DECL extern __declspec(dllimport) +# endif +#endif + +/* By default, we use the standard "extern" declarations. */ + +#ifndef PCRE2_EXP_DECL +# ifdef __cplusplus +# define PCRE2_EXP_DECL extern "C" +# else +# define PCRE2_EXP_DECL extern +# endif +#endif + +/* When compiling with the MSVC compiler, it is sometimes necessary to include +a "calling convention" before exported function names. (This is secondhand +information; I know nothing about MSVC myself). For example, something like + + void __cdecl function(....) + +might be needed. In order so make this easy, all the exported functions have +PCRE2_CALL_CONVENTION just before their names. It is rarely needed; if not +set, we ensure here that it has no effect. */ + +#ifndef PCRE2_CALL_CONVENTION +#define PCRE2_CALL_CONVENTION +#endif + +/* Have to include limits.h, stdlib.h, and inttypes.h to ensure that size_t and +uint8_t, UCHAR_MAX, etc are defined. Some systems that do have inttypes.h do +not have stdint.h, which is why we use inttypes.h, which according to the C +standard is a superset of stdint.h. If none of these headers are available, +the relevant values must be provided by some other means. */ + +#include +#include +#include + +/* Allow for C++ users compiling this directly. */ + +#ifdef __cplusplus +extern "C" { +#endif + +/* The following option bits can be passed to pcre2_compile(), pcre2_match(), +or pcre2_dfa_match(). PCRE2_NO_UTF_CHECK affects only the function to which it +is passed. Put these bits at the most significant end of the options word so +others can be added next to them */ + +#define PCRE2_ANCHORED 0x80000000u +#define PCRE2_NO_UTF_CHECK 0x40000000u +#define PCRE2_ENDANCHORED 0x20000000u + +/* The following option bits can be passed only to pcre2_compile(). However, +they may affect compilation, JIT compilation, and/or interpretive execution. +The following tags indicate which: + +C alters what is compiled by pcre2_compile() +J alters what is compiled by pcre2_jit_compile() +M is inspected during pcre2_match() execution +D is inspected during pcre2_dfa_match() execution +*/ + +#define PCRE2_ALLOW_EMPTY_CLASS 0x00000001u /* C */ +#define PCRE2_ALT_BSUX 0x00000002u /* C */ +#define PCRE2_AUTO_CALLOUT 0x00000004u /* C */ +#define PCRE2_CASELESS 0x00000008u /* C */ +#define PCRE2_DOLLAR_ENDONLY 0x00000010u /* J M D */ +#define PCRE2_DOTALL 0x00000020u /* C */ +#define PCRE2_DUPNAMES 0x00000040u /* C */ +#define PCRE2_EXTENDED 0x00000080u /* C */ +#define PCRE2_FIRSTLINE 0x00000100u /* J M D */ +#define PCRE2_MATCH_UNSET_BACKREF 0x00000200u /* C J M */ +#define PCRE2_MULTILINE 0x00000400u /* C */ +#define PCRE2_NEVER_UCP 0x00000800u /* C */ +#define PCRE2_NEVER_UTF 0x00001000u /* C */ +#define PCRE2_NO_AUTO_CAPTURE 0x00002000u /* C */ +#define PCRE2_NO_AUTO_POSSESS 0x00004000u /* C */ +#define PCRE2_NO_DOTSTAR_ANCHOR 0x00008000u /* C */ +#define PCRE2_NO_START_OPTIMIZE 0x00010000u /* J M D */ +#define PCRE2_UCP 0x00020000u /* C J M D */ +#define PCRE2_UNGREEDY 0x00040000u /* C */ +#define PCRE2_UTF 0x00080000u /* C J M D */ +#define PCRE2_NEVER_BACKSLASH_C 0x00100000u /* C */ +#define PCRE2_ALT_CIRCUMFLEX 0x00200000u /* J M D */ +#define PCRE2_ALT_VERBNAMES 0x00400000u /* C */ +#define PCRE2_USE_OFFSET_LIMIT 0x00800000u /* J M D */ +#define PCRE2_EXTENDED_MORE 0x01000000u /* C */ +#define PCRE2_LITERAL 0x02000000u /* C */ +#define PCRE2_MATCH_INVALID_UTF 0x04000000u /* J M D */ + +/* An additional compile options word is available in the compile context. */ + +#define PCRE2_EXTRA_ALLOW_SURROGATE_ESCAPES 0x00000001u /* C */ +#define PCRE2_EXTRA_BAD_ESCAPE_IS_LITERAL 0x00000002u /* C */ +#define PCRE2_EXTRA_MATCH_WORD 0x00000004u /* C */ +#define PCRE2_EXTRA_MATCH_LINE 0x00000008u /* C */ +#define PCRE2_EXTRA_ESCAPED_CR_IS_LF 0x00000010u /* C */ +#define PCRE2_EXTRA_ALT_BSUX 0x00000020u /* C */ + +/* These are for pcre2_jit_compile(). */ + +#define PCRE2_JIT_COMPLETE 0x00000001u /* For full matching */ +#define PCRE2_JIT_PARTIAL_SOFT 0x00000002u +#define PCRE2_JIT_PARTIAL_HARD 0x00000004u +#define PCRE2_JIT_INVALID_UTF 0x00000100u + +/* These are for pcre2_match(), pcre2_dfa_match(), pcre2_jit_match(), and +pcre2_substitute(). Some are allowed only for one of the functions, and in +these cases it is noted below. Note that PCRE2_ANCHORED, PCRE2_ENDANCHORED and +PCRE2_NO_UTF_CHECK can also be passed to these functions (though +pcre2_jit_match() ignores the latter since it bypasses all sanity checks). */ + +#define PCRE2_NOTBOL 0x00000001u +#define PCRE2_NOTEOL 0x00000002u +#define PCRE2_NOTEMPTY 0x00000004u /* ) These two must be kept */ +#define PCRE2_NOTEMPTY_ATSTART 0x00000008u /* ) adjacent to each other. */ +#define PCRE2_PARTIAL_SOFT 0x00000010u +#define PCRE2_PARTIAL_HARD 0x00000020u +#define PCRE2_DFA_RESTART 0x00000040u /* pcre2_dfa_match() only */ +#define PCRE2_DFA_SHORTEST 0x00000080u /* pcre2_dfa_match() only */ +#define PCRE2_SUBSTITUTE_GLOBAL 0x00000100u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_EXTENDED 0x00000200u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNSET_EMPTY 0x00000400u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNKNOWN_UNSET 0x00000800u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_OVERFLOW_LENGTH 0x00001000u /* pcre2_substitute() only */ +#define PCRE2_NO_JIT 0x00002000u /* Not for pcre2_dfa_match() */ +#define PCRE2_COPY_MATCHED_SUBJECT 0x00004000u + +/* Options for pcre2_pattern_convert(). */ + +#define PCRE2_CONVERT_UTF 0x00000001u +#define PCRE2_CONVERT_NO_UTF_CHECK 0x00000002u +#define PCRE2_CONVERT_POSIX_BASIC 0x00000004u +#define PCRE2_CONVERT_POSIX_EXTENDED 0x00000008u +#define PCRE2_CONVERT_GLOB 0x00000010u +#define PCRE2_CONVERT_GLOB_NO_WILD_SEPARATOR 0x00000030u +#define PCRE2_CONVERT_GLOB_NO_STARSTAR 0x00000050u + +/* Newline and \R settings, for use in compile contexts. The newline values +must be kept in step with values set in config.h and both sets must all be +greater than zero. */ + +#define PCRE2_NEWLINE_CR 1 +#define PCRE2_NEWLINE_LF 2 +#define PCRE2_NEWLINE_CRLF 3 +#define PCRE2_NEWLINE_ANY 4 +#define PCRE2_NEWLINE_ANYCRLF 5 +#define PCRE2_NEWLINE_NUL 6 + +#define PCRE2_BSR_UNICODE 1 +#define PCRE2_BSR_ANYCRLF 2 + +/* Error codes for pcre2_compile(). Some of these are also used by +pcre2_pattern_convert(). */ + +#define PCRE2_ERROR_END_BACKSLASH 101 +#define PCRE2_ERROR_END_BACKSLASH_C 102 +#define PCRE2_ERROR_UNKNOWN_ESCAPE 103 +#define PCRE2_ERROR_QUANTIFIER_OUT_OF_ORDER 104 +#define PCRE2_ERROR_QUANTIFIER_TOO_BIG 105 +#define PCRE2_ERROR_MISSING_SQUARE_BRACKET 106 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_CLASS 107 +#define PCRE2_ERROR_CLASS_RANGE_ORDER 108 +#define PCRE2_ERROR_QUANTIFIER_INVALID 109 +#define PCRE2_ERROR_INTERNAL_UNEXPECTED_REPEAT 110 +#define PCRE2_ERROR_INVALID_AFTER_PARENS_QUERY 111 +#define PCRE2_ERROR_POSIX_CLASS_NOT_IN_CLASS 112 +#define PCRE2_ERROR_POSIX_NO_SUPPORT_COLLATING 113 +#define PCRE2_ERROR_MISSING_CLOSING_PARENTHESIS 114 +#define PCRE2_ERROR_BAD_SUBPATTERN_REFERENCE 115 +#define PCRE2_ERROR_NULL_PATTERN 116 +#define PCRE2_ERROR_BAD_OPTIONS 117 +#define PCRE2_ERROR_MISSING_COMMENT_CLOSING 118 +#define PCRE2_ERROR_PARENTHESES_NEST_TOO_DEEP 119 +#define PCRE2_ERROR_PATTERN_TOO_LARGE 120 +#define PCRE2_ERROR_HEAP_FAILED 121 +#define PCRE2_ERROR_UNMATCHED_CLOSING_PARENTHESIS 122 +#define PCRE2_ERROR_INTERNAL_CODE_OVERFLOW 123 +#define PCRE2_ERROR_MISSING_CONDITION_CLOSING 124 +#define PCRE2_ERROR_LOOKBEHIND_NOT_FIXED_LENGTH 125 +#define PCRE2_ERROR_ZERO_RELATIVE_REFERENCE 126 +#define PCRE2_ERROR_TOO_MANY_CONDITION_BRANCHES 127 +#define PCRE2_ERROR_CONDITION_ASSERTION_EXPECTED 128 +#define PCRE2_ERROR_BAD_RELATIVE_REFERENCE 129 +#define PCRE2_ERROR_UNKNOWN_POSIX_CLASS 130 +#define PCRE2_ERROR_INTERNAL_STUDY_ERROR 131 +#define PCRE2_ERROR_UNICODE_NOT_SUPPORTED 132 +#define PCRE2_ERROR_PARENTHESES_STACK_CHECK 133 +#define PCRE2_ERROR_CODE_POINT_TOO_BIG 134 +#define PCRE2_ERROR_LOOKBEHIND_TOO_COMPLICATED 135 +#define PCRE2_ERROR_LOOKBEHIND_INVALID_BACKSLASH_C 136 +#define PCRE2_ERROR_UNSUPPORTED_ESCAPE_SEQUENCE 137 +#define PCRE2_ERROR_CALLOUT_NUMBER_TOO_BIG 138 +#define PCRE2_ERROR_MISSING_CALLOUT_CLOSING 139 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_VERB 140 +#define PCRE2_ERROR_UNRECOGNIZED_AFTER_QUERY_P 141 +#define PCRE2_ERROR_MISSING_NAME_TERMINATOR 142 +#define PCRE2_ERROR_DUPLICATE_SUBPATTERN_NAME 143 +#define PCRE2_ERROR_INVALID_SUBPATTERN_NAME 144 +#define PCRE2_ERROR_UNICODE_PROPERTIES_UNAVAILABLE 145 +#define PCRE2_ERROR_MALFORMED_UNICODE_PROPERTY 146 +#define PCRE2_ERROR_UNKNOWN_UNICODE_PROPERTY 147 +#define PCRE2_ERROR_SUBPATTERN_NAME_TOO_LONG 148 +#define PCRE2_ERROR_TOO_MANY_NAMED_SUBPATTERNS 149 +#define PCRE2_ERROR_CLASS_INVALID_RANGE 150 +#define PCRE2_ERROR_OCTAL_BYTE_TOO_BIG 151 +#define PCRE2_ERROR_INTERNAL_OVERRAN_WORKSPACE 152 +#define PCRE2_ERROR_INTERNAL_MISSING_SUBPATTERN 153 +#define PCRE2_ERROR_DEFINE_TOO_MANY_BRANCHES 154 +#define PCRE2_ERROR_BACKSLASH_O_MISSING_BRACE 155 +#define PCRE2_ERROR_INTERNAL_UNKNOWN_NEWLINE 156 +#define PCRE2_ERROR_BACKSLASH_G_SYNTAX 157 +#define PCRE2_ERROR_PARENS_QUERY_R_MISSING_CLOSING 158 +/* Error 159 is obsolete and should now never occur */ +#define PCRE2_ERROR_VERB_ARGUMENT_NOT_ALLOWED 159 +#define PCRE2_ERROR_VERB_UNKNOWN 160 +#define PCRE2_ERROR_SUBPATTERN_NUMBER_TOO_BIG 161 +#define PCRE2_ERROR_SUBPATTERN_NAME_EXPECTED 162 +#define PCRE2_ERROR_INTERNAL_PARSED_OVERFLOW 163 +#define PCRE2_ERROR_INVALID_OCTAL 164 +#define PCRE2_ERROR_SUBPATTERN_NAMES_MISMATCH 165 +#define PCRE2_ERROR_MARK_MISSING_ARGUMENT 166 +#define PCRE2_ERROR_INVALID_HEXADECIMAL 167 +#define PCRE2_ERROR_BACKSLASH_C_SYNTAX 168 +#define PCRE2_ERROR_BACKSLASH_K_SYNTAX 169 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_LOOKBEHINDS 170 +#define PCRE2_ERROR_BACKSLASH_N_IN_CLASS 171 +#define PCRE2_ERROR_CALLOUT_STRING_TOO_LONG 172 +#define PCRE2_ERROR_UNICODE_DISALLOWED_CODE_POINT 173 +#define PCRE2_ERROR_UTF_IS_DISABLED 174 +#define PCRE2_ERROR_UCP_IS_DISABLED 175 +#define PCRE2_ERROR_VERB_NAME_TOO_LONG 176 +#define PCRE2_ERROR_BACKSLASH_U_CODE_POINT_TOO_BIG 177 +#define PCRE2_ERROR_MISSING_OCTAL_OR_HEX_DIGITS 178 +#define PCRE2_ERROR_VERSION_CONDITION_SYNTAX 179 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_AUTO_POSSESS 180 +#define PCRE2_ERROR_CALLOUT_NO_STRING_DELIMITER 181 +#define PCRE2_ERROR_CALLOUT_BAD_STRING_DELIMITER 182 +#define PCRE2_ERROR_BACKSLASH_C_CALLER_DISABLED 183 +#define PCRE2_ERROR_QUERY_BARJX_NEST_TOO_DEEP 184 +#define PCRE2_ERROR_BACKSLASH_C_LIBRARY_DISABLED 185 +#define PCRE2_ERROR_PATTERN_TOO_COMPLICATED 186 +#define PCRE2_ERROR_LOOKBEHIND_TOO_LONG 187 +#define PCRE2_ERROR_PATTERN_STRING_TOO_LONG 188 +#define PCRE2_ERROR_INTERNAL_BAD_CODE 189 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_IN_SKIP 190 +#define PCRE2_ERROR_NO_SURROGATES_IN_UTF16 191 +#define PCRE2_ERROR_BAD_LITERAL_OPTIONS 192 +#define PCRE2_ERROR_SUPPORTED_ONLY_IN_UNICODE 193 +#define PCRE2_ERROR_INVALID_HYPHEN_IN_OPTIONS 194 +#define PCRE2_ERROR_ALPHA_ASSERTION_UNKNOWN 195 +#define PCRE2_ERROR_SCRIPT_RUN_NOT_AVAILABLE 196 +#define PCRE2_ERROR_TOO_MANY_CAPTURES 197 + + +/* "Expected" matching error codes: no match and partial match. */ + +#define PCRE2_ERROR_NOMATCH (-1) +#define PCRE2_ERROR_PARTIAL (-2) + +/* Error codes for UTF-8 validity checks */ + +#define PCRE2_ERROR_UTF8_ERR1 (-3) +#define PCRE2_ERROR_UTF8_ERR2 (-4) +#define PCRE2_ERROR_UTF8_ERR3 (-5) +#define PCRE2_ERROR_UTF8_ERR4 (-6) +#define PCRE2_ERROR_UTF8_ERR5 (-7) +#define PCRE2_ERROR_UTF8_ERR6 (-8) +#define PCRE2_ERROR_UTF8_ERR7 (-9) +#define PCRE2_ERROR_UTF8_ERR8 (-10) +#define PCRE2_ERROR_UTF8_ERR9 (-11) +#define PCRE2_ERROR_UTF8_ERR10 (-12) +#define PCRE2_ERROR_UTF8_ERR11 (-13) +#define PCRE2_ERROR_UTF8_ERR12 (-14) +#define PCRE2_ERROR_UTF8_ERR13 (-15) +#define PCRE2_ERROR_UTF8_ERR14 (-16) +#define PCRE2_ERROR_UTF8_ERR15 (-17) +#define PCRE2_ERROR_UTF8_ERR16 (-18) +#define PCRE2_ERROR_UTF8_ERR17 (-19) +#define PCRE2_ERROR_UTF8_ERR18 (-20) +#define PCRE2_ERROR_UTF8_ERR19 (-21) +#define PCRE2_ERROR_UTF8_ERR20 (-22) +#define PCRE2_ERROR_UTF8_ERR21 (-23) + +/* Error codes for UTF-16 validity checks */ + +#define PCRE2_ERROR_UTF16_ERR1 (-24) +#define PCRE2_ERROR_UTF16_ERR2 (-25) +#define PCRE2_ERROR_UTF16_ERR3 (-26) + +/* Error codes for UTF-32 validity checks */ + +#define PCRE2_ERROR_UTF32_ERR1 (-27) +#define PCRE2_ERROR_UTF32_ERR2 (-28) + +/* Miscellaneous error codes for pcre2[_dfa]_match(), substring extraction +functions, context functions, and serializing functions. They are in numerical +order. Originally they were in alphabetical order too, but now that PCRE2 is +released, the numbers must not be changed. */ + +#define PCRE2_ERROR_BADDATA (-29) +#define PCRE2_ERROR_MIXEDTABLES (-30) /* Name was changed */ +#define PCRE2_ERROR_BADMAGIC (-31) +#define PCRE2_ERROR_BADMODE (-32) +#define PCRE2_ERROR_BADOFFSET (-33) +#define PCRE2_ERROR_BADOPTION (-34) +#define PCRE2_ERROR_BADREPLACEMENT (-35) +#define PCRE2_ERROR_BADUTFOFFSET (-36) +#define PCRE2_ERROR_CALLOUT (-37) /* Never used by PCRE2 itself */ +#define PCRE2_ERROR_DFA_BADRESTART (-38) +#define PCRE2_ERROR_DFA_RECURSE (-39) +#define PCRE2_ERROR_DFA_UCOND (-40) +#define PCRE2_ERROR_DFA_UFUNC (-41) +#define PCRE2_ERROR_DFA_UITEM (-42) +#define PCRE2_ERROR_DFA_WSSIZE (-43) +#define PCRE2_ERROR_INTERNAL (-44) +#define PCRE2_ERROR_JIT_BADOPTION (-45) +#define PCRE2_ERROR_JIT_STACKLIMIT (-46) +#define PCRE2_ERROR_MATCHLIMIT (-47) +#define PCRE2_ERROR_NOMEMORY (-48) +#define PCRE2_ERROR_NOSUBSTRING (-49) +#define PCRE2_ERROR_NOUNIQUESUBSTRING (-50) +#define PCRE2_ERROR_NULL (-51) +#define PCRE2_ERROR_RECURSELOOP (-52) +#define PCRE2_ERROR_DEPTHLIMIT (-53) +#define PCRE2_ERROR_RECURSIONLIMIT (-53) /* Obsolete synonym */ +#define PCRE2_ERROR_UNAVAILABLE (-54) +#define PCRE2_ERROR_UNSET (-55) +#define PCRE2_ERROR_BADOFFSETLIMIT (-56) +#define PCRE2_ERROR_BADREPESCAPE (-57) +#define PCRE2_ERROR_REPMISSINGBRACE (-58) +#define PCRE2_ERROR_BADSUBSTITUTION (-59) +#define PCRE2_ERROR_BADSUBSPATTERN (-60) +#define PCRE2_ERROR_TOOMANYREPLACE (-61) +#define PCRE2_ERROR_BADSERIALIZEDDATA (-62) +#define PCRE2_ERROR_HEAPLIMIT (-63) +#define PCRE2_ERROR_CONVERT_SYNTAX (-64) +#define PCRE2_ERROR_INTERNAL_DUPMATCH (-65) +#define PCRE2_ERROR_DFA_UINVALID_UTF (-66) + + +/* Request types for pcre2_pattern_info() */ + +#define PCRE2_INFO_ALLOPTIONS 0 +#define PCRE2_INFO_ARGOPTIONS 1 +#define PCRE2_INFO_BACKREFMAX 2 +#define PCRE2_INFO_BSR 3 +#define PCRE2_INFO_CAPTURECOUNT 4 +#define PCRE2_INFO_FIRSTCODEUNIT 5 +#define PCRE2_INFO_FIRSTCODETYPE 6 +#define PCRE2_INFO_FIRSTBITMAP 7 +#define PCRE2_INFO_HASCRORLF 8 +#define PCRE2_INFO_JCHANGED 9 +#define PCRE2_INFO_JITSIZE 10 +#define PCRE2_INFO_LASTCODEUNIT 11 +#define PCRE2_INFO_LASTCODETYPE 12 +#define PCRE2_INFO_MATCHEMPTY 13 +#define PCRE2_INFO_MATCHLIMIT 14 +#define PCRE2_INFO_MAXLOOKBEHIND 15 +#define PCRE2_INFO_MINLENGTH 16 +#define PCRE2_INFO_NAMECOUNT 17 +#define PCRE2_INFO_NAMEENTRYSIZE 18 +#define PCRE2_INFO_NAMETABLE 19 +#define PCRE2_INFO_NEWLINE 20 +#define PCRE2_INFO_DEPTHLIMIT 21 +#define PCRE2_INFO_RECURSIONLIMIT 21 /* Obsolete synonym */ +#define PCRE2_INFO_SIZE 22 +#define PCRE2_INFO_HASBACKSLASHC 23 +#define PCRE2_INFO_FRAMESIZE 24 +#define PCRE2_INFO_HEAPLIMIT 25 +#define PCRE2_INFO_EXTRAOPTIONS 26 + +/* Request types for pcre2_config(). */ + +#define PCRE2_CONFIG_BSR 0 +#define PCRE2_CONFIG_JIT 1 +#define PCRE2_CONFIG_JITTARGET 2 +#define PCRE2_CONFIG_LINKSIZE 3 +#define PCRE2_CONFIG_MATCHLIMIT 4 +#define PCRE2_CONFIG_NEWLINE 5 +#define PCRE2_CONFIG_PARENSLIMIT 6 +#define PCRE2_CONFIG_DEPTHLIMIT 7 +#define PCRE2_CONFIG_RECURSIONLIMIT 7 /* Obsolete synonym */ +#define PCRE2_CONFIG_STACKRECURSE 8 /* Obsolete */ +#define PCRE2_CONFIG_UNICODE 9 +#define PCRE2_CONFIG_UNICODE_VERSION 10 +#define PCRE2_CONFIG_VERSION 11 +#define PCRE2_CONFIG_HEAPLIMIT 12 +#define PCRE2_CONFIG_NEVER_BACKSLASH_C 13 +#define PCRE2_CONFIG_COMPILED_WIDTHS 14 + + +/* Types for code units in patterns and subject strings. */ + +typedef uint8_t PCRE2_UCHAR8; +typedef uint16_t PCRE2_UCHAR16; +typedef uint32_t PCRE2_UCHAR32; + +typedef const PCRE2_UCHAR8 *PCRE2_SPTR8; +typedef const PCRE2_UCHAR16 *PCRE2_SPTR16; +typedef const PCRE2_UCHAR32 *PCRE2_SPTR32; + +/* The PCRE2_SIZE type is used for all string lengths and offsets in PCRE2, +including pattern offsets for errors and subject offsets after a match. We +define special values to indicate zero-terminated strings and unset offsets in +the offset vector (ovector). */ + +#define PCRE2_SIZE size_t +#define PCRE2_SIZE_MAX SIZE_MAX +#define PCRE2_ZERO_TERMINATED (~(PCRE2_SIZE)0) +#define PCRE2_UNSET (~(PCRE2_SIZE)0) + +/* Generic types for opaque structures and JIT callback functions. These +declarations are defined in a macro that is expanded for each width later. */ + +#define PCRE2_TYPES_LIST \ +struct pcre2_real_general_context; \ +typedef struct pcre2_real_general_context pcre2_general_context; \ +\ +struct pcre2_real_compile_context; \ +typedef struct pcre2_real_compile_context pcre2_compile_context; \ +\ +struct pcre2_real_match_context; \ +typedef struct pcre2_real_match_context pcre2_match_context; \ +\ +struct pcre2_real_convert_context; \ +typedef struct pcre2_real_convert_context pcre2_convert_context; \ +\ +struct pcre2_real_code; \ +typedef struct pcre2_real_code pcre2_code; \ +\ +struct pcre2_real_match_data; \ +typedef struct pcre2_real_match_data pcre2_match_data; \ +\ +struct pcre2_real_jit_stack; \ +typedef struct pcre2_real_jit_stack pcre2_jit_stack; \ +\ +typedef pcre2_jit_stack *(*pcre2_jit_callback)(void *); + + +/* The structures for passing out data via callout functions. We use structures +so that new fields can be added on the end in future versions, without changing +the API of the function, thereby allowing old clients to work without +modification. Define the generic versions in a macro; the width-specific +versions are generated from this macro below. */ + +/* Flags for the callout_flags field. These are cleared after a callout. */ + +#define PCRE2_CALLOUT_STARTMATCH 0x00000001u /* Set for each bumpalong */ +#define PCRE2_CALLOUT_BACKTRACK 0x00000002u /* Set after a backtrack */ + +#define PCRE2_STRUCTURE_LIST \ +typedef struct pcre2_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + uint32_t capture_top; /* Max current capture */ \ + uint32_t capture_last; /* Most recently closed capture */ \ + PCRE2_SIZE *offset_vector; /* The offset vector */ \ + PCRE2_SPTR mark; /* Pointer to current mark or NULL */ \ + PCRE2_SPTR subject; /* The subject being matched */ \ + PCRE2_SIZE subject_length; /* The length of the subject */ \ + PCRE2_SIZE start_match; /* Offset to start of this match attempt */ \ + PCRE2_SIZE current_position; /* Where we currently are in the subject */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + /* ------------------- Added for Version 1 -------------------------- */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------- Added for Version 2 -------------------------- */ \ + uint32_t callout_flags; /* See above for list */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_block; \ +\ +typedef struct pcre2_callout_enumerate_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_enumerate_block; \ +\ +typedef struct pcre2_substitute_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SPTR input; /* Pointer to input subject string */ \ + PCRE2_SPTR output; /* Pointer to output buffer */ \ + PCRE2_SIZE output_offsets[2]; /* Changed portion of the output */ \ + PCRE2_SIZE *ovector; /* Pointer to current ovector */ \ + uint32_t oveccount; /* Count of pairs set in ovector */ \ + uint32_t subscount; /* Substitution number */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_substitute_callout_block; + + +/* List the generic forms of all other functions in macros, which will be +expanded for each width below. Start with functions that give general +information. */ + +#define PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION pcre2_config(uint32_t, void *); + + +/* Functions for manipulating contexts. */ + +#define PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_copy(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_create(void *(*)(PCRE2_SIZE, void *), \ + void (*)(void *, void *), void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_general_context_free(pcre2_general_context *); + +#define PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_copy(pcre2_compile_context *); \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_create(pcre2_general_context *);\ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_compile_context_free(pcre2_compile_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_bsr(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_character_tables(pcre2_compile_context *, const unsigned char *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_extra_options(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_max_pattern_length(pcre2_compile_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_newline(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_parens_nest_limit(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_recursion_guard(pcre2_compile_context *, \ + int (*)(uint32_t, void *), void *); + +#define PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_copy(pcre2_match_context *); \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_context_free(pcre2_match_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_callout(pcre2_match_context *, \ + int (*)(pcre2_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_substitute_callout(pcre2_match_context *, \ + int (*)(pcre2_substitute_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_depth_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_heap_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_match_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_offset_limit(pcre2_match_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_memory_management(pcre2_match_context *, \ + void *(*)(PCRE2_SIZE, void *), void (*)(void *, void *), void *); + +#define PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_copy(pcre2_convert_context *); \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_convert_context_free(pcre2_convert_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_escape(pcre2_convert_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_separator(pcre2_convert_context *, uint32_t); + + +/* Functions concerned with compiling a pattern to PCRE internal code. */ + +#define PCRE2_COMPILE_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_compile(PCRE2_SPTR, PCRE2_SIZE, uint32_t, int *, PCRE2_SIZE *, \ + pcre2_compile_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_code_free(pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy(const pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy_with_tables(const pcre2_code *); + + +/* Functions that give information about a compiled pattern. */ + +#define PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_info(const pcre2_code *, uint32_t, void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_callout_enumerate(const pcre2_code *, \ + int (*)(pcre2_callout_enumerate_block *, void *), void *); + + +/* Functions for running a match and inspecting the result. */ + +#define PCRE2_MATCH_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create(uint32_t, pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create_from_pattern(const pcre2_code *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_dfa_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, int *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_data_free(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SPTR PCRE2_CALL_CONVENTION \ + pcre2_get_mark(pcre2_match_data *); \ +PCRE2_EXP_DECL uint32_t PCRE2_CALL_CONVENTION \ + pcre2_get_ovector_count(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + *pcre2_get_ovector_pointer(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + pcre2_get_startchar(pcre2_match_data *); + + +/* Convenience functions for handling matched substrings. */ + +#define PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_free(PCRE2_UCHAR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_bynumber(pcre2_match_data *, uint32_t, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_nametable_scan(const pcre2_code *, PCRE2_SPTR, PCRE2_SPTR *, \ + PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_number_from_name(const pcre2_code *, PCRE2_SPTR); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_list_free(PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_list_get(pcre2_match_data *, PCRE2_UCHAR ***, PCRE2_SIZE **); + +/* Functions for serializing / deserializing compiled patterns. */ + +#define PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_encode(const pcre2_code **, int32_t, uint8_t **, \ + PCRE2_SIZE *, pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_decode(pcre2_code **, int32_t, const uint8_t *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_get_number_of_codes(const uint8_t *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_serialize_free(uint8_t *); + + +/* Convenience function for match + substitute. */ + +#define PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substitute(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, PCRE2_SPTR, \ + PCRE2_SIZE, PCRE2_UCHAR *, PCRE2_SIZE *); + + +/* Functions for converting pattern source strings. */ + +#define PCRE2_CONVERT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_convert(PCRE2_SPTR, PCRE2_SIZE, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *, pcre2_convert_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_converted_pattern_free(PCRE2_UCHAR *); + + +/* Functions for JIT processing */ + +#define PCRE2_JIT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_compile(pcre2_code *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_free_unused_memory(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_jit_stack PCRE2_CALL_CONVENTION \ + *pcre2_jit_stack_create(PCRE2_SIZE, PCRE2_SIZE, pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_assign(pcre2_match_context *, pcre2_jit_callback, void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_free(pcre2_jit_stack *); + + +/* Other miscellaneous functions. */ + +#define PCRE2_OTHER_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_get_error_message(int, PCRE2_UCHAR *, PCRE2_SIZE); \ +PCRE2_EXP_DECL const uint8_t PCRE2_CALL_CONVENTION \ + *pcre2_maketables(pcre2_general_context *); \ + + +/* Define macros that generate width-specific names from generic versions. The +three-level macro scheme is necessary to get the macros expanded when we want +them to be. First we get the width from PCRE2_LOCAL_WIDTH, which is used for +generating three versions of everything below. After that, PCRE2_SUFFIX will be +re-defined to use PCRE2_CODE_UNIT_WIDTH, for use when macros such as +pcre2_compile are called by application code. */ + +#define PCRE2_JOIN(a,b) a ## b +#define PCRE2_GLUE(a,b) PCRE2_JOIN(a,b) +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a,PCRE2_LOCAL_WIDTH) + + +/* Data types */ + +#define PCRE2_UCHAR PCRE2_SUFFIX(PCRE2_UCHAR) +#define PCRE2_SPTR PCRE2_SUFFIX(PCRE2_SPTR) + +#define pcre2_code PCRE2_SUFFIX(pcre2_code_) +#define pcre2_jit_callback PCRE2_SUFFIX(pcre2_jit_callback_) +#define pcre2_jit_stack PCRE2_SUFFIX(pcre2_jit_stack_) + +#define pcre2_real_code PCRE2_SUFFIX(pcre2_real_code_) +#define pcre2_real_general_context PCRE2_SUFFIX(pcre2_real_general_context_) +#define pcre2_real_compile_context PCRE2_SUFFIX(pcre2_real_compile_context_) +#define pcre2_real_convert_context PCRE2_SUFFIX(pcre2_real_convert_context_) +#define pcre2_real_match_context PCRE2_SUFFIX(pcre2_real_match_context_) +#define pcre2_real_jit_stack PCRE2_SUFFIX(pcre2_real_jit_stack_) +#define pcre2_real_match_data PCRE2_SUFFIX(pcre2_real_match_data_) + + +/* Data blocks */ + +#define pcre2_callout_block PCRE2_SUFFIX(pcre2_callout_block_) +#define pcre2_callout_enumerate_block PCRE2_SUFFIX(pcre2_callout_enumerate_block_) +#define pcre2_substitute_callout_block PCRE2_SUFFIX(pcre2_substitute_callout_block_) +#define pcre2_general_context PCRE2_SUFFIX(pcre2_general_context_) +#define pcre2_compile_context PCRE2_SUFFIX(pcre2_compile_context_) +#define pcre2_convert_context PCRE2_SUFFIX(pcre2_convert_context_) +#define pcre2_match_context PCRE2_SUFFIX(pcre2_match_context_) +#define pcre2_match_data PCRE2_SUFFIX(pcre2_match_data_) + + +/* Functions: the complete list in alphabetical order */ + +#define pcre2_callout_enumerate PCRE2_SUFFIX(pcre2_callout_enumerate_) +#define pcre2_code_copy PCRE2_SUFFIX(pcre2_code_copy_) +#define pcre2_code_copy_with_tables PCRE2_SUFFIX(pcre2_code_copy_with_tables_) +#define pcre2_code_free PCRE2_SUFFIX(pcre2_code_free_) +#define pcre2_compile PCRE2_SUFFIX(pcre2_compile_) +#define pcre2_compile_context_copy PCRE2_SUFFIX(pcre2_compile_context_copy_) +#define pcre2_compile_context_create PCRE2_SUFFIX(pcre2_compile_context_create_) +#define pcre2_compile_context_free PCRE2_SUFFIX(pcre2_compile_context_free_) +#define pcre2_config PCRE2_SUFFIX(pcre2_config_) +#define pcre2_convert_context_copy PCRE2_SUFFIX(pcre2_convert_context_copy_) +#define pcre2_convert_context_create PCRE2_SUFFIX(pcre2_convert_context_create_) +#define pcre2_convert_context_free PCRE2_SUFFIX(pcre2_convert_context_free_) +#define pcre2_converted_pattern_free PCRE2_SUFFIX(pcre2_converted_pattern_free_) +#define pcre2_dfa_match PCRE2_SUFFIX(pcre2_dfa_match_) +#define pcre2_general_context_copy PCRE2_SUFFIX(pcre2_general_context_copy_) +#define pcre2_general_context_create PCRE2_SUFFIX(pcre2_general_context_create_) +#define pcre2_general_context_free PCRE2_SUFFIX(pcre2_general_context_free_) +#define pcre2_get_error_message PCRE2_SUFFIX(pcre2_get_error_message_) +#define pcre2_get_mark PCRE2_SUFFIX(pcre2_get_mark_) +#define pcre2_get_ovector_pointer PCRE2_SUFFIX(pcre2_get_ovector_pointer_) +#define pcre2_get_ovector_count PCRE2_SUFFIX(pcre2_get_ovector_count_) +#define pcre2_get_startchar PCRE2_SUFFIX(pcre2_get_startchar_) +#define pcre2_jit_compile PCRE2_SUFFIX(pcre2_jit_compile_) +#define pcre2_jit_match PCRE2_SUFFIX(pcre2_jit_match_) +#define pcre2_jit_free_unused_memory PCRE2_SUFFIX(pcre2_jit_free_unused_memory_) +#define pcre2_jit_stack_assign PCRE2_SUFFIX(pcre2_jit_stack_assign_) +#define pcre2_jit_stack_create PCRE2_SUFFIX(pcre2_jit_stack_create_) +#define pcre2_jit_stack_free PCRE2_SUFFIX(pcre2_jit_stack_free_) +#define pcre2_maketables PCRE2_SUFFIX(pcre2_maketables_) +#define pcre2_match PCRE2_SUFFIX(pcre2_match_) +#define pcre2_match_context_copy PCRE2_SUFFIX(pcre2_match_context_copy_) +#define pcre2_match_context_create PCRE2_SUFFIX(pcre2_match_context_create_) +#define pcre2_match_context_free PCRE2_SUFFIX(pcre2_match_context_free_) +#define pcre2_match_data_create PCRE2_SUFFIX(pcre2_match_data_create_) +#define pcre2_match_data_create_from_pattern PCRE2_SUFFIX(pcre2_match_data_create_from_pattern_) +#define pcre2_match_data_free PCRE2_SUFFIX(pcre2_match_data_free_) +#define pcre2_pattern_convert PCRE2_SUFFIX(pcre2_pattern_convert_) +#define pcre2_pattern_info PCRE2_SUFFIX(pcre2_pattern_info_) +#define pcre2_serialize_decode PCRE2_SUFFIX(pcre2_serialize_decode_) +#define pcre2_serialize_encode PCRE2_SUFFIX(pcre2_serialize_encode_) +#define pcre2_serialize_free PCRE2_SUFFIX(pcre2_serialize_free_) +#define pcre2_serialize_get_number_of_codes PCRE2_SUFFIX(pcre2_serialize_get_number_of_codes_) +#define pcre2_set_bsr PCRE2_SUFFIX(pcre2_set_bsr_) +#define pcre2_set_callout PCRE2_SUFFIX(pcre2_set_callout_) +#define pcre2_set_character_tables PCRE2_SUFFIX(pcre2_set_character_tables_) +#define pcre2_set_compile_extra_options PCRE2_SUFFIX(pcre2_set_compile_extra_options_) +#define pcre2_set_compile_recursion_guard PCRE2_SUFFIX(pcre2_set_compile_recursion_guard_) +#define pcre2_set_depth_limit PCRE2_SUFFIX(pcre2_set_depth_limit_) +#define pcre2_set_glob_escape PCRE2_SUFFIX(pcre2_set_glob_escape_) +#define pcre2_set_glob_separator PCRE2_SUFFIX(pcre2_set_glob_separator_) +#define pcre2_set_heap_limit PCRE2_SUFFIX(pcre2_set_heap_limit_) +#define pcre2_set_match_limit PCRE2_SUFFIX(pcre2_set_match_limit_) +#define pcre2_set_max_pattern_length PCRE2_SUFFIX(pcre2_set_max_pattern_length_) +#define pcre2_set_newline PCRE2_SUFFIX(pcre2_set_newline_) +#define pcre2_set_parens_nest_limit PCRE2_SUFFIX(pcre2_set_parens_nest_limit_) +#define pcre2_set_offset_limit PCRE2_SUFFIX(pcre2_set_offset_limit_) +#define pcre2_set_substitute_callout PCRE2_SUFFIX(pcre2_set_substitute_callout_) +#define pcre2_substitute PCRE2_SUFFIX(pcre2_substitute_) +#define pcre2_substring_copy_byname PCRE2_SUFFIX(pcre2_substring_copy_byname_) +#define pcre2_substring_copy_bynumber PCRE2_SUFFIX(pcre2_substring_copy_bynumber_) +#define pcre2_substring_free PCRE2_SUFFIX(pcre2_substring_free_) +#define pcre2_substring_get_byname PCRE2_SUFFIX(pcre2_substring_get_byname_) +#define pcre2_substring_get_bynumber PCRE2_SUFFIX(pcre2_substring_get_bynumber_) +#define pcre2_substring_length_byname PCRE2_SUFFIX(pcre2_substring_length_byname_) +#define pcre2_substring_length_bynumber PCRE2_SUFFIX(pcre2_substring_length_bynumber_) +#define pcre2_substring_list_get PCRE2_SUFFIX(pcre2_substring_list_get_) +#define pcre2_substring_list_free PCRE2_SUFFIX(pcre2_substring_list_free_) +#define pcre2_substring_nametable_scan PCRE2_SUFFIX(pcre2_substring_nametable_scan_) +#define pcre2_substring_number_from_name PCRE2_SUFFIX(pcre2_substring_number_from_name_) + +/* Keep this old function name for backwards compatibility */ +#define pcre2_set_recursion_limit PCRE2_SUFFIX(pcre2_set_recursion_limit_) + +/* Keep this obsolete function for backwards compatibility: it is now a noop. */ +#define pcre2_set_recursion_memory_management PCRE2_SUFFIX(pcre2_set_recursion_memory_management_) + +/* Now generate all three sets of width-specific structures and function +prototypes. */ + +#define PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS \ +PCRE2_TYPES_LIST \ +PCRE2_STRUCTURE_LIST \ +PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_FUNCTIONS \ +PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_FUNCTIONS \ +PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_MATCH_FUNCTIONS \ +PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_JIT_FUNCTIONS \ +PCRE2_OTHER_FUNCTIONS + +#define PCRE2_LOCAL_WIDTH 8 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 16 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 32 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +/* Undefine the list macros; they are no longer needed. */ + +#undef PCRE2_TYPES_LIST +#undef PCRE2_STRUCTURE_LIST +#undef PCRE2_GENERAL_INFO_FUNCTIONS +#undef PCRE2_GENERAL_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_CONTEXT_FUNCTIONS +#undef PCRE2_CONVERT_CONTEXT_FUNCTIONS +#undef PCRE2_MATCH_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_FUNCTIONS +#undef PCRE2_PATTERN_INFO_FUNCTIONS +#undef PCRE2_MATCH_FUNCTIONS +#undef PCRE2_SUBSTRING_FUNCTIONS +#undef PCRE2_SERIALIZE_FUNCTIONS +#undef PCRE2_SUBSTITUTE_FUNCTION +#undef PCRE2_JIT_FUNCTIONS +#undef PCRE2_OTHER_FUNCTIONS +#undef PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS + +/* PCRE2_CODE_UNIT_WIDTH must be defined. If it is 8, 16, or 32, redefine +PCRE2_SUFFIX to use it. If it is 0, undefine the other macros and make +PCRE2_SUFFIX a no-op. Otherwise, generate an error. */ + +#undef PCRE2_SUFFIX +#ifndef PCRE2_CODE_UNIT_WIDTH +#error PCRE2_CODE_UNIT_WIDTH must be defined before including pcre2.h. +#error Use 8, 16, or 32; or 0 for a multi-width application. +#else /* PCRE2_CODE_UNIT_WIDTH is defined */ +#if PCRE2_CODE_UNIT_WIDTH == 8 || \ + PCRE2_CODE_UNIT_WIDTH == 16 || \ + PCRE2_CODE_UNIT_WIDTH == 32 +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a, PCRE2_CODE_UNIT_WIDTH) +#elif PCRE2_CODE_UNIT_WIDTH == 0 +#undef PCRE2_JOIN +#undef PCRE2_GLUE +#define PCRE2_SUFFIX(a) a +#else +#error PCRE2_CODE_UNIT_WIDTH must be 0, 8, 16, or 32. +#endif +#endif /* PCRE2_CODE_UNIT_WIDTH is defined */ + +#ifdef __cplusplus +} /* extern "C" */ +#endif + +#endif /* PCRE2_H_IDEMPOTENT_GUARD */ + +/* End of pcre2.h */ diff --git a/csrc/rex_pcre2/pcre2/mingw32/pcre2_chartables.c b/csrc/rex_pcre2/pcre2/mingw32/pcre2_chartables.c new file mode 100755 index 0000000..0e07edb --- /dev/null +++ b/csrc/rex_pcre2/pcre2/mingw32/pcre2_chartables.c @@ -0,0 +1,198 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This file was automatically written by the dftables auxiliary +program. It contains character tables that are used when no external +tables are passed to PCRE2 by the application that calls it. The tables +are used only for characters whose code values are less than 256. */ + +/*The dftables program (which is distributed with PCRE2) can be used to +build alternative versions of this file. This is necessary if you are +running in an EBCDIC environment, or if you want to default to a different +encoding, for example ISO-8859-1. When dftables is run, it creates these +tables in the current locale. This happens automatically if PCRE2 is +configured with --enable-rebuild-chartables. */ + +/* The following #include is present because without it gcc 4.x may remove +the array definition from the final binary if PCRE2 is built into a static +library and dead code stripping is activated. This leads to link errors. +Pulling in the header ensures that the array gets flagged as "someone +outside this compilation unit might reference this" and so it will always +be supplied to the linker. */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "pcre2_internal.h" + +const uint8_t PRIV(default_tables)[] = { + +/* This table is a lower casing table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table is a case flipping table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 65, 66, 67, 68, 69, 70, 71, + 72, 73, 74, 75, 76, 77, 78, 79, + 80, 81, 82, 83, 84, 85, 86, 87, + 88, 89, 90,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table contains bit maps for various character classes. Each map is 32 +bytes long and the bits run from the least significant end of each byte. The +classes that have their own maps are: space, xdigit, digit, upper, lower, word, +graph print, punct, and cntrl. Other classes are built from combinations. */ + + 0x00,0x3e,0x00,0x00,0x01,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x7e,0x00,0x00,0x00,0x7e,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0xfe,0xff,0xff,0x07,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0xfe,0xff,0xff,0x87,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xff,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0x00,0xfc, + 0x01,0x00,0x00,0xf8,0x01,0x00,0x00,0x78, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0xff,0xff,0xff,0xff,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + +/* This table identifies various classes of character by individual bits: + 0x01 white space character + 0x02 letter + 0x04 lower case letter + 0x08 decimal digit + 0x10 alphanumeric or '_' +*/ + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 */ + 0x00,0x01,0x01,0x01,0x01,0x01,0x00,0x00, /* 8- 15 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */ + 0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - ' */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ( - / */ + 0x18,0x18,0x18,0x18,0x18,0x18,0x18,0x18, /* 0 - 7 */ + 0x18,0x18,0x00,0x00,0x00,0x00,0x00,0x00, /* 8 - ? */ + 0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* @ - G */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* H - O */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* P - W */ + 0x12,0x12,0x12,0x00,0x00,0x00,0x00,0x10, /* X - _ */ + 0x00,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* ` - g */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* h - o */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* p - w */ + 0x16,0x16,0x16,0x00,0x00,0x00,0x00,0x00, /* x -127 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */ + +/* End of pcre2_chartables.c */ diff --git a/csrc/rex_pcre2/pcre2/mingw64/config.h b/csrc/rex_pcre2/pcre2/mingw64/config.h new file mode 100755 index 0000000..190ddef --- /dev/null +++ b/csrc/rex_pcre2/pcre2/mingw64/config.h @@ -0,0 +1,54 @@ +/* config.h for CMake builds */ + +#define HAVE_DIRENT_H 1 +#define HAVE_INTTYPES_H 1 +#define HAVE_STDINT_H 1 +#define HAVE_STRERROR 1 +#define HAVE_SYS_STAT_H 1 +#define HAVE_SYS_TYPES_H 1 +#define HAVE_UNISTD_H 1 +#define HAVE_WINDOWS_H 1 + +/* #undef HAVE_BCOPY */ +#define HAVE_MEMMOVE 1 + +#define PCRE2_STATIC 1 + +#define SUPPORT_PCRE2_8 1 +/* #undef SUPPORT_PCRE2_16 */ +/* #undef SUPPORT_PCRE2_32 */ +/* #undef PCRE2_DEBUG */ +/* #undef DISABLE_PERCENT_ZT */ + +#define SUPPORT_LIBBZ2 1 +/* #undef SUPPORT_LIBEDIT */ +#define SUPPORT_LIBREADLINE 1 +#define SUPPORT_LIBZ 1 + +/* #undef SUPPORT_JIT */ +/* #undef SLJIT_PROT_EXECUTABLE_ALLOCATOR */ +#define SUPPORT_PCRE2GREP_JIT 1 +#define SUPPORT_PCRE2GREP_CALLOUT 1 +#define SUPPORT_PCRE2GREP_CALLOUT_FORK 1 +#define SUPPORT_UNICODE 1 +/* #undef SUPPORT_VALGRIND */ + +/* #undef BSR_ANYCRLF */ +/* #undef EBCDIC */ +/* #undef EBCDIC_NL25 */ +/* #undef HEAP_MATCH_RECURSE */ +/* #undef NEVER_BACKSLASH_C */ + +#define LINK_SIZE 2 +#define HEAP_LIMIT 20000000 +#define MATCH_LIMIT 10000000 +#define MATCH_LIMIT_DEPTH MATCH_LIMIT +#define NEWLINE_DEFAULT 2 +#define PARENS_NEST_LIMIT 250 +#define PCRE2GREP_BUFSIZE 20480 +#define PCRE2GREP_MAX_BUFSIZE 1048576 + +#define MAX_NAME_SIZE 32 +#define MAX_NAME_COUNT 10000 + +/* end config.h for CMake builds */ diff --git a/csrc/rex_pcre2/pcre2/mingw64/pcre2.h b/csrc/rex_pcre2/pcre2/mingw64/pcre2.h new file mode 100755 index 0000000..32a9b9e --- /dev/null +++ b/csrc/rex_pcre2/pcre2/mingw64/pcre2.h @@ -0,0 +1,981 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This is the public header file for the PCRE library, second API, to be +#included by applications that call PCRE2 functions. + + Copyright (c) 2016-2019 University of Cambridge + +----------------------------------------------------------------------------- +Redistribution and use in source and binary forms, with or without +modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + * Neither the name of the University of Cambridge nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE +POSSIBILITY OF SUCH DAMAGE. +----------------------------------------------------------------------------- +*/ + +#ifndef PCRE2_H_IDEMPOTENT_GUARD +#define PCRE2_H_IDEMPOTENT_GUARD + +/* The current PCRE version information. */ + +#define PCRE2_MAJOR 10 +#define PCRE2_MINOR 34 +#define PCRE2_PRERELEASE -RC1 +#define PCRE2_DATE 2019-04-22 + +/* When an application links to a PCRE DLL in Windows, the symbols that are +imported have to be identified as such. When building PCRE2, the appropriate +export setting is defined in pcre2_internal.h, which includes this file. So we +don't change existing definitions of PCRE2_EXP_DECL. */ + +#if defined(_WIN32) && !defined(PCRE2_STATIC) +# ifndef PCRE2_EXP_DECL +# define PCRE2_EXP_DECL extern __declspec(dllimport) +# endif +#endif + +/* By default, we use the standard "extern" declarations. */ + +#ifndef PCRE2_EXP_DECL +# ifdef __cplusplus +# define PCRE2_EXP_DECL extern "C" +# else +# define PCRE2_EXP_DECL extern +# endif +#endif + +/* When compiling with the MSVC compiler, it is sometimes necessary to include +a "calling convention" before exported function names. (This is secondhand +information; I know nothing about MSVC myself). For example, something like + + void __cdecl function(....) + +might be needed. In order so make this easy, all the exported functions have +PCRE2_CALL_CONVENTION just before their names. It is rarely needed; if not +set, we ensure here that it has no effect. */ + +#ifndef PCRE2_CALL_CONVENTION +#define PCRE2_CALL_CONVENTION +#endif + +/* Have to include limits.h, stdlib.h, and inttypes.h to ensure that size_t and +uint8_t, UCHAR_MAX, etc are defined. Some systems that do have inttypes.h do +not have stdint.h, which is why we use inttypes.h, which according to the C +standard is a superset of stdint.h. If none of these headers are available, +the relevant values must be provided by some other means. */ + +#include +#include +#include + +/* Allow for C++ users compiling this directly. */ + +#ifdef __cplusplus +extern "C" { +#endif + +/* The following option bits can be passed to pcre2_compile(), pcre2_match(), +or pcre2_dfa_match(). PCRE2_NO_UTF_CHECK affects only the function to which it +is passed. Put these bits at the most significant end of the options word so +others can be added next to them */ + +#define PCRE2_ANCHORED 0x80000000u +#define PCRE2_NO_UTF_CHECK 0x40000000u +#define PCRE2_ENDANCHORED 0x20000000u + +/* The following option bits can be passed only to pcre2_compile(). However, +they may affect compilation, JIT compilation, and/or interpretive execution. +The following tags indicate which: + +C alters what is compiled by pcre2_compile() +J alters what is compiled by pcre2_jit_compile() +M is inspected during pcre2_match() execution +D is inspected during pcre2_dfa_match() execution +*/ + +#define PCRE2_ALLOW_EMPTY_CLASS 0x00000001u /* C */ +#define PCRE2_ALT_BSUX 0x00000002u /* C */ +#define PCRE2_AUTO_CALLOUT 0x00000004u /* C */ +#define PCRE2_CASELESS 0x00000008u /* C */ +#define PCRE2_DOLLAR_ENDONLY 0x00000010u /* J M D */ +#define PCRE2_DOTALL 0x00000020u /* C */ +#define PCRE2_DUPNAMES 0x00000040u /* C */ +#define PCRE2_EXTENDED 0x00000080u /* C */ +#define PCRE2_FIRSTLINE 0x00000100u /* J M D */ +#define PCRE2_MATCH_UNSET_BACKREF 0x00000200u /* C J M */ +#define PCRE2_MULTILINE 0x00000400u /* C */ +#define PCRE2_NEVER_UCP 0x00000800u /* C */ +#define PCRE2_NEVER_UTF 0x00001000u /* C */ +#define PCRE2_NO_AUTO_CAPTURE 0x00002000u /* C */ +#define PCRE2_NO_AUTO_POSSESS 0x00004000u /* C */ +#define PCRE2_NO_DOTSTAR_ANCHOR 0x00008000u /* C */ +#define PCRE2_NO_START_OPTIMIZE 0x00010000u /* J M D */ +#define PCRE2_UCP 0x00020000u /* C J M D */ +#define PCRE2_UNGREEDY 0x00040000u /* C */ +#define PCRE2_UTF 0x00080000u /* C J M D */ +#define PCRE2_NEVER_BACKSLASH_C 0x00100000u /* C */ +#define PCRE2_ALT_CIRCUMFLEX 0x00200000u /* J M D */ +#define PCRE2_ALT_VERBNAMES 0x00400000u /* C */ +#define PCRE2_USE_OFFSET_LIMIT 0x00800000u /* J M D */ +#define PCRE2_EXTENDED_MORE 0x01000000u /* C */ +#define PCRE2_LITERAL 0x02000000u /* C */ +#define PCRE2_MATCH_INVALID_UTF 0x04000000u /* J M D */ + +/* An additional compile options word is available in the compile context. */ + +#define PCRE2_EXTRA_ALLOW_SURROGATE_ESCAPES 0x00000001u /* C */ +#define PCRE2_EXTRA_BAD_ESCAPE_IS_LITERAL 0x00000002u /* C */ +#define PCRE2_EXTRA_MATCH_WORD 0x00000004u /* C */ +#define PCRE2_EXTRA_MATCH_LINE 0x00000008u /* C */ +#define PCRE2_EXTRA_ESCAPED_CR_IS_LF 0x00000010u /* C */ +#define PCRE2_EXTRA_ALT_BSUX 0x00000020u /* C */ + +/* These are for pcre2_jit_compile(). */ + +#define PCRE2_JIT_COMPLETE 0x00000001u /* For full matching */ +#define PCRE2_JIT_PARTIAL_SOFT 0x00000002u +#define PCRE2_JIT_PARTIAL_HARD 0x00000004u +#define PCRE2_JIT_INVALID_UTF 0x00000100u + +/* These are for pcre2_match(), pcre2_dfa_match(), pcre2_jit_match(), and +pcre2_substitute(). Some are allowed only for one of the functions, and in +these cases it is noted below. Note that PCRE2_ANCHORED, PCRE2_ENDANCHORED and +PCRE2_NO_UTF_CHECK can also be passed to these functions (though +pcre2_jit_match() ignores the latter since it bypasses all sanity checks). */ + +#define PCRE2_NOTBOL 0x00000001u +#define PCRE2_NOTEOL 0x00000002u +#define PCRE2_NOTEMPTY 0x00000004u /* ) These two must be kept */ +#define PCRE2_NOTEMPTY_ATSTART 0x00000008u /* ) adjacent to each other. */ +#define PCRE2_PARTIAL_SOFT 0x00000010u +#define PCRE2_PARTIAL_HARD 0x00000020u +#define PCRE2_DFA_RESTART 0x00000040u /* pcre2_dfa_match() only */ +#define PCRE2_DFA_SHORTEST 0x00000080u /* pcre2_dfa_match() only */ +#define PCRE2_SUBSTITUTE_GLOBAL 0x00000100u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_EXTENDED 0x00000200u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNSET_EMPTY 0x00000400u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNKNOWN_UNSET 0x00000800u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_OVERFLOW_LENGTH 0x00001000u /* pcre2_substitute() only */ +#define PCRE2_NO_JIT 0x00002000u /* Not for pcre2_dfa_match() */ +#define PCRE2_COPY_MATCHED_SUBJECT 0x00004000u + +/* Options for pcre2_pattern_convert(). */ + +#define PCRE2_CONVERT_UTF 0x00000001u +#define PCRE2_CONVERT_NO_UTF_CHECK 0x00000002u +#define PCRE2_CONVERT_POSIX_BASIC 0x00000004u +#define PCRE2_CONVERT_POSIX_EXTENDED 0x00000008u +#define PCRE2_CONVERT_GLOB 0x00000010u +#define PCRE2_CONVERT_GLOB_NO_WILD_SEPARATOR 0x00000030u +#define PCRE2_CONVERT_GLOB_NO_STARSTAR 0x00000050u + +/* Newline and \R settings, for use in compile contexts. The newline values +must be kept in step with values set in config.h and both sets must all be +greater than zero. */ + +#define PCRE2_NEWLINE_CR 1 +#define PCRE2_NEWLINE_LF 2 +#define PCRE2_NEWLINE_CRLF 3 +#define PCRE2_NEWLINE_ANY 4 +#define PCRE2_NEWLINE_ANYCRLF 5 +#define PCRE2_NEWLINE_NUL 6 + +#define PCRE2_BSR_UNICODE 1 +#define PCRE2_BSR_ANYCRLF 2 + +/* Error codes for pcre2_compile(). Some of these are also used by +pcre2_pattern_convert(). */ + +#define PCRE2_ERROR_END_BACKSLASH 101 +#define PCRE2_ERROR_END_BACKSLASH_C 102 +#define PCRE2_ERROR_UNKNOWN_ESCAPE 103 +#define PCRE2_ERROR_QUANTIFIER_OUT_OF_ORDER 104 +#define PCRE2_ERROR_QUANTIFIER_TOO_BIG 105 +#define PCRE2_ERROR_MISSING_SQUARE_BRACKET 106 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_CLASS 107 +#define PCRE2_ERROR_CLASS_RANGE_ORDER 108 +#define PCRE2_ERROR_QUANTIFIER_INVALID 109 +#define PCRE2_ERROR_INTERNAL_UNEXPECTED_REPEAT 110 +#define PCRE2_ERROR_INVALID_AFTER_PARENS_QUERY 111 +#define PCRE2_ERROR_POSIX_CLASS_NOT_IN_CLASS 112 +#define PCRE2_ERROR_POSIX_NO_SUPPORT_COLLATING 113 +#define PCRE2_ERROR_MISSING_CLOSING_PARENTHESIS 114 +#define PCRE2_ERROR_BAD_SUBPATTERN_REFERENCE 115 +#define PCRE2_ERROR_NULL_PATTERN 116 +#define PCRE2_ERROR_BAD_OPTIONS 117 +#define PCRE2_ERROR_MISSING_COMMENT_CLOSING 118 +#define PCRE2_ERROR_PARENTHESES_NEST_TOO_DEEP 119 +#define PCRE2_ERROR_PATTERN_TOO_LARGE 120 +#define PCRE2_ERROR_HEAP_FAILED 121 +#define PCRE2_ERROR_UNMATCHED_CLOSING_PARENTHESIS 122 +#define PCRE2_ERROR_INTERNAL_CODE_OVERFLOW 123 +#define PCRE2_ERROR_MISSING_CONDITION_CLOSING 124 +#define PCRE2_ERROR_LOOKBEHIND_NOT_FIXED_LENGTH 125 +#define PCRE2_ERROR_ZERO_RELATIVE_REFERENCE 126 +#define PCRE2_ERROR_TOO_MANY_CONDITION_BRANCHES 127 +#define PCRE2_ERROR_CONDITION_ASSERTION_EXPECTED 128 +#define PCRE2_ERROR_BAD_RELATIVE_REFERENCE 129 +#define PCRE2_ERROR_UNKNOWN_POSIX_CLASS 130 +#define PCRE2_ERROR_INTERNAL_STUDY_ERROR 131 +#define PCRE2_ERROR_UNICODE_NOT_SUPPORTED 132 +#define PCRE2_ERROR_PARENTHESES_STACK_CHECK 133 +#define PCRE2_ERROR_CODE_POINT_TOO_BIG 134 +#define PCRE2_ERROR_LOOKBEHIND_TOO_COMPLICATED 135 +#define PCRE2_ERROR_LOOKBEHIND_INVALID_BACKSLASH_C 136 +#define PCRE2_ERROR_UNSUPPORTED_ESCAPE_SEQUENCE 137 +#define PCRE2_ERROR_CALLOUT_NUMBER_TOO_BIG 138 +#define PCRE2_ERROR_MISSING_CALLOUT_CLOSING 139 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_VERB 140 +#define PCRE2_ERROR_UNRECOGNIZED_AFTER_QUERY_P 141 +#define PCRE2_ERROR_MISSING_NAME_TERMINATOR 142 +#define PCRE2_ERROR_DUPLICATE_SUBPATTERN_NAME 143 +#define PCRE2_ERROR_INVALID_SUBPATTERN_NAME 144 +#define PCRE2_ERROR_UNICODE_PROPERTIES_UNAVAILABLE 145 +#define PCRE2_ERROR_MALFORMED_UNICODE_PROPERTY 146 +#define PCRE2_ERROR_UNKNOWN_UNICODE_PROPERTY 147 +#define PCRE2_ERROR_SUBPATTERN_NAME_TOO_LONG 148 +#define PCRE2_ERROR_TOO_MANY_NAMED_SUBPATTERNS 149 +#define PCRE2_ERROR_CLASS_INVALID_RANGE 150 +#define PCRE2_ERROR_OCTAL_BYTE_TOO_BIG 151 +#define PCRE2_ERROR_INTERNAL_OVERRAN_WORKSPACE 152 +#define PCRE2_ERROR_INTERNAL_MISSING_SUBPATTERN 153 +#define PCRE2_ERROR_DEFINE_TOO_MANY_BRANCHES 154 +#define PCRE2_ERROR_BACKSLASH_O_MISSING_BRACE 155 +#define PCRE2_ERROR_INTERNAL_UNKNOWN_NEWLINE 156 +#define PCRE2_ERROR_BACKSLASH_G_SYNTAX 157 +#define PCRE2_ERROR_PARENS_QUERY_R_MISSING_CLOSING 158 +/* Error 159 is obsolete and should now never occur */ +#define PCRE2_ERROR_VERB_ARGUMENT_NOT_ALLOWED 159 +#define PCRE2_ERROR_VERB_UNKNOWN 160 +#define PCRE2_ERROR_SUBPATTERN_NUMBER_TOO_BIG 161 +#define PCRE2_ERROR_SUBPATTERN_NAME_EXPECTED 162 +#define PCRE2_ERROR_INTERNAL_PARSED_OVERFLOW 163 +#define PCRE2_ERROR_INVALID_OCTAL 164 +#define PCRE2_ERROR_SUBPATTERN_NAMES_MISMATCH 165 +#define PCRE2_ERROR_MARK_MISSING_ARGUMENT 166 +#define PCRE2_ERROR_INVALID_HEXADECIMAL 167 +#define PCRE2_ERROR_BACKSLASH_C_SYNTAX 168 +#define PCRE2_ERROR_BACKSLASH_K_SYNTAX 169 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_LOOKBEHINDS 170 +#define PCRE2_ERROR_BACKSLASH_N_IN_CLASS 171 +#define PCRE2_ERROR_CALLOUT_STRING_TOO_LONG 172 +#define PCRE2_ERROR_UNICODE_DISALLOWED_CODE_POINT 173 +#define PCRE2_ERROR_UTF_IS_DISABLED 174 +#define PCRE2_ERROR_UCP_IS_DISABLED 175 +#define PCRE2_ERROR_VERB_NAME_TOO_LONG 176 +#define PCRE2_ERROR_BACKSLASH_U_CODE_POINT_TOO_BIG 177 +#define PCRE2_ERROR_MISSING_OCTAL_OR_HEX_DIGITS 178 +#define PCRE2_ERROR_VERSION_CONDITION_SYNTAX 179 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_AUTO_POSSESS 180 +#define PCRE2_ERROR_CALLOUT_NO_STRING_DELIMITER 181 +#define PCRE2_ERROR_CALLOUT_BAD_STRING_DELIMITER 182 +#define PCRE2_ERROR_BACKSLASH_C_CALLER_DISABLED 183 +#define PCRE2_ERROR_QUERY_BARJX_NEST_TOO_DEEP 184 +#define PCRE2_ERROR_BACKSLASH_C_LIBRARY_DISABLED 185 +#define PCRE2_ERROR_PATTERN_TOO_COMPLICATED 186 +#define PCRE2_ERROR_LOOKBEHIND_TOO_LONG 187 +#define PCRE2_ERROR_PATTERN_STRING_TOO_LONG 188 +#define PCRE2_ERROR_INTERNAL_BAD_CODE 189 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_IN_SKIP 190 +#define PCRE2_ERROR_NO_SURROGATES_IN_UTF16 191 +#define PCRE2_ERROR_BAD_LITERAL_OPTIONS 192 +#define PCRE2_ERROR_SUPPORTED_ONLY_IN_UNICODE 193 +#define PCRE2_ERROR_INVALID_HYPHEN_IN_OPTIONS 194 +#define PCRE2_ERROR_ALPHA_ASSERTION_UNKNOWN 195 +#define PCRE2_ERROR_SCRIPT_RUN_NOT_AVAILABLE 196 +#define PCRE2_ERROR_TOO_MANY_CAPTURES 197 + + +/* "Expected" matching error codes: no match and partial match. */ + +#define PCRE2_ERROR_NOMATCH (-1) +#define PCRE2_ERROR_PARTIAL (-2) + +/* Error codes for UTF-8 validity checks */ + +#define PCRE2_ERROR_UTF8_ERR1 (-3) +#define PCRE2_ERROR_UTF8_ERR2 (-4) +#define PCRE2_ERROR_UTF8_ERR3 (-5) +#define PCRE2_ERROR_UTF8_ERR4 (-6) +#define PCRE2_ERROR_UTF8_ERR5 (-7) +#define PCRE2_ERROR_UTF8_ERR6 (-8) +#define PCRE2_ERROR_UTF8_ERR7 (-9) +#define PCRE2_ERROR_UTF8_ERR8 (-10) +#define PCRE2_ERROR_UTF8_ERR9 (-11) +#define PCRE2_ERROR_UTF8_ERR10 (-12) +#define PCRE2_ERROR_UTF8_ERR11 (-13) +#define PCRE2_ERROR_UTF8_ERR12 (-14) +#define PCRE2_ERROR_UTF8_ERR13 (-15) +#define PCRE2_ERROR_UTF8_ERR14 (-16) +#define PCRE2_ERROR_UTF8_ERR15 (-17) +#define PCRE2_ERROR_UTF8_ERR16 (-18) +#define PCRE2_ERROR_UTF8_ERR17 (-19) +#define PCRE2_ERROR_UTF8_ERR18 (-20) +#define PCRE2_ERROR_UTF8_ERR19 (-21) +#define PCRE2_ERROR_UTF8_ERR20 (-22) +#define PCRE2_ERROR_UTF8_ERR21 (-23) + +/* Error codes for UTF-16 validity checks */ + +#define PCRE2_ERROR_UTF16_ERR1 (-24) +#define PCRE2_ERROR_UTF16_ERR2 (-25) +#define PCRE2_ERROR_UTF16_ERR3 (-26) + +/* Error codes for UTF-32 validity checks */ + +#define PCRE2_ERROR_UTF32_ERR1 (-27) +#define PCRE2_ERROR_UTF32_ERR2 (-28) + +/* Miscellaneous error codes for pcre2[_dfa]_match(), substring extraction +functions, context functions, and serializing functions. They are in numerical +order. Originally they were in alphabetical order too, but now that PCRE2 is +released, the numbers must not be changed. */ + +#define PCRE2_ERROR_BADDATA (-29) +#define PCRE2_ERROR_MIXEDTABLES (-30) /* Name was changed */ +#define PCRE2_ERROR_BADMAGIC (-31) +#define PCRE2_ERROR_BADMODE (-32) +#define PCRE2_ERROR_BADOFFSET (-33) +#define PCRE2_ERROR_BADOPTION (-34) +#define PCRE2_ERROR_BADREPLACEMENT (-35) +#define PCRE2_ERROR_BADUTFOFFSET (-36) +#define PCRE2_ERROR_CALLOUT (-37) /* Never used by PCRE2 itself */ +#define PCRE2_ERROR_DFA_BADRESTART (-38) +#define PCRE2_ERROR_DFA_RECURSE (-39) +#define PCRE2_ERROR_DFA_UCOND (-40) +#define PCRE2_ERROR_DFA_UFUNC (-41) +#define PCRE2_ERROR_DFA_UITEM (-42) +#define PCRE2_ERROR_DFA_WSSIZE (-43) +#define PCRE2_ERROR_INTERNAL (-44) +#define PCRE2_ERROR_JIT_BADOPTION (-45) +#define PCRE2_ERROR_JIT_STACKLIMIT (-46) +#define PCRE2_ERROR_MATCHLIMIT (-47) +#define PCRE2_ERROR_NOMEMORY (-48) +#define PCRE2_ERROR_NOSUBSTRING (-49) +#define PCRE2_ERROR_NOUNIQUESUBSTRING (-50) +#define PCRE2_ERROR_NULL (-51) +#define PCRE2_ERROR_RECURSELOOP (-52) +#define PCRE2_ERROR_DEPTHLIMIT (-53) +#define PCRE2_ERROR_RECURSIONLIMIT (-53) /* Obsolete synonym */ +#define PCRE2_ERROR_UNAVAILABLE (-54) +#define PCRE2_ERROR_UNSET (-55) +#define PCRE2_ERROR_BADOFFSETLIMIT (-56) +#define PCRE2_ERROR_BADREPESCAPE (-57) +#define PCRE2_ERROR_REPMISSINGBRACE (-58) +#define PCRE2_ERROR_BADSUBSTITUTION (-59) +#define PCRE2_ERROR_BADSUBSPATTERN (-60) +#define PCRE2_ERROR_TOOMANYREPLACE (-61) +#define PCRE2_ERROR_BADSERIALIZEDDATA (-62) +#define PCRE2_ERROR_HEAPLIMIT (-63) +#define PCRE2_ERROR_CONVERT_SYNTAX (-64) +#define PCRE2_ERROR_INTERNAL_DUPMATCH (-65) +#define PCRE2_ERROR_DFA_UINVALID_UTF (-66) + + +/* Request types for pcre2_pattern_info() */ + +#define PCRE2_INFO_ALLOPTIONS 0 +#define PCRE2_INFO_ARGOPTIONS 1 +#define PCRE2_INFO_BACKREFMAX 2 +#define PCRE2_INFO_BSR 3 +#define PCRE2_INFO_CAPTURECOUNT 4 +#define PCRE2_INFO_FIRSTCODEUNIT 5 +#define PCRE2_INFO_FIRSTCODETYPE 6 +#define PCRE2_INFO_FIRSTBITMAP 7 +#define PCRE2_INFO_HASCRORLF 8 +#define PCRE2_INFO_JCHANGED 9 +#define PCRE2_INFO_JITSIZE 10 +#define PCRE2_INFO_LASTCODEUNIT 11 +#define PCRE2_INFO_LASTCODETYPE 12 +#define PCRE2_INFO_MATCHEMPTY 13 +#define PCRE2_INFO_MATCHLIMIT 14 +#define PCRE2_INFO_MAXLOOKBEHIND 15 +#define PCRE2_INFO_MINLENGTH 16 +#define PCRE2_INFO_NAMECOUNT 17 +#define PCRE2_INFO_NAMEENTRYSIZE 18 +#define PCRE2_INFO_NAMETABLE 19 +#define PCRE2_INFO_NEWLINE 20 +#define PCRE2_INFO_DEPTHLIMIT 21 +#define PCRE2_INFO_RECURSIONLIMIT 21 /* Obsolete synonym */ +#define PCRE2_INFO_SIZE 22 +#define PCRE2_INFO_HASBACKSLASHC 23 +#define PCRE2_INFO_FRAMESIZE 24 +#define PCRE2_INFO_HEAPLIMIT 25 +#define PCRE2_INFO_EXTRAOPTIONS 26 + +/* Request types for pcre2_config(). */ + +#define PCRE2_CONFIG_BSR 0 +#define PCRE2_CONFIG_JIT 1 +#define PCRE2_CONFIG_JITTARGET 2 +#define PCRE2_CONFIG_LINKSIZE 3 +#define PCRE2_CONFIG_MATCHLIMIT 4 +#define PCRE2_CONFIG_NEWLINE 5 +#define PCRE2_CONFIG_PARENSLIMIT 6 +#define PCRE2_CONFIG_DEPTHLIMIT 7 +#define PCRE2_CONFIG_RECURSIONLIMIT 7 /* Obsolete synonym */ +#define PCRE2_CONFIG_STACKRECURSE 8 /* Obsolete */ +#define PCRE2_CONFIG_UNICODE 9 +#define PCRE2_CONFIG_UNICODE_VERSION 10 +#define PCRE2_CONFIG_VERSION 11 +#define PCRE2_CONFIG_HEAPLIMIT 12 +#define PCRE2_CONFIG_NEVER_BACKSLASH_C 13 +#define PCRE2_CONFIG_COMPILED_WIDTHS 14 + + +/* Types for code units in patterns and subject strings. */ + +typedef uint8_t PCRE2_UCHAR8; +typedef uint16_t PCRE2_UCHAR16; +typedef uint32_t PCRE2_UCHAR32; + +typedef const PCRE2_UCHAR8 *PCRE2_SPTR8; +typedef const PCRE2_UCHAR16 *PCRE2_SPTR16; +typedef const PCRE2_UCHAR32 *PCRE2_SPTR32; + +/* The PCRE2_SIZE type is used for all string lengths and offsets in PCRE2, +including pattern offsets for errors and subject offsets after a match. We +define special values to indicate zero-terminated strings and unset offsets in +the offset vector (ovector). */ + +#define PCRE2_SIZE size_t +#define PCRE2_SIZE_MAX SIZE_MAX +#define PCRE2_ZERO_TERMINATED (~(PCRE2_SIZE)0) +#define PCRE2_UNSET (~(PCRE2_SIZE)0) + +/* Generic types for opaque structures and JIT callback functions. These +declarations are defined in a macro that is expanded for each width later. */ + +#define PCRE2_TYPES_LIST \ +struct pcre2_real_general_context; \ +typedef struct pcre2_real_general_context pcre2_general_context; \ +\ +struct pcre2_real_compile_context; \ +typedef struct pcre2_real_compile_context pcre2_compile_context; \ +\ +struct pcre2_real_match_context; \ +typedef struct pcre2_real_match_context pcre2_match_context; \ +\ +struct pcre2_real_convert_context; \ +typedef struct pcre2_real_convert_context pcre2_convert_context; \ +\ +struct pcre2_real_code; \ +typedef struct pcre2_real_code pcre2_code; \ +\ +struct pcre2_real_match_data; \ +typedef struct pcre2_real_match_data pcre2_match_data; \ +\ +struct pcre2_real_jit_stack; \ +typedef struct pcre2_real_jit_stack pcre2_jit_stack; \ +\ +typedef pcre2_jit_stack *(*pcre2_jit_callback)(void *); + + +/* The structures for passing out data via callout functions. We use structures +so that new fields can be added on the end in future versions, without changing +the API of the function, thereby allowing old clients to work without +modification. Define the generic versions in a macro; the width-specific +versions are generated from this macro below. */ + +/* Flags for the callout_flags field. These are cleared after a callout. */ + +#define PCRE2_CALLOUT_STARTMATCH 0x00000001u /* Set for each bumpalong */ +#define PCRE2_CALLOUT_BACKTRACK 0x00000002u /* Set after a backtrack */ + +#define PCRE2_STRUCTURE_LIST \ +typedef struct pcre2_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + uint32_t capture_top; /* Max current capture */ \ + uint32_t capture_last; /* Most recently closed capture */ \ + PCRE2_SIZE *offset_vector; /* The offset vector */ \ + PCRE2_SPTR mark; /* Pointer to current mark or NULL */ \ + PCRE2_SPTR subject; /* The subject being matched */ \ + PCRE2_SIZE subject_length; /* The length of the subject */ \ + PCRE2_SIZE start_match; /* Offset to start of this match attempt */ \ + PCRE2_SIZE current_position; /* Where we currently are in the subject */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + /* ------------------- Added for Version 1 -------------------------- */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------- Added for Version 2 -------------------------- */ \ + uint32_t callout_flags; /* See above for list */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_block; \ +\ +typedef struct pcre2_callout_enumerate_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_enumerate_block; \ +\ +typedef struct pcre2_substitute_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SPTR input; /* Pointer to input subject string */ \ + PCRE2_SPTR output; /* Pointer to output buffer */ \ + PCRE2_SIZE output_offsets[2]; /* Changed portion of the output */ \ + PCRE2_SIZE *ovector; /* Pointer to current ovector */ \ + uint32_t oveccount; /* Count of pairs set in ovector */ \ + uint32_t subscount; /* Substitution number */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_substitute_callout_block; + + +/* List the generic forms of all other functions in macros, which will be +expanded for each width below. Start with functions that give general +information. */ + +#define PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION pcre2_config(uint32_t, void *); + + +/* Functions for manipulating contexts. */ + +#define PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_copy(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_create(void *(*)(PCRE2_SIZE, void *), \ + void (*)(void *, void *), void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_general_context_free(pcre2_general_context *); + +#define PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_copy(pcre2_compile_context *); \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_create(pcre2_general_context *);\ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_compile_context_free(pcre2_compile_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_bsr(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_character_tables(pcre2_compile_context *, const unsigned char *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_extra_options(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_max_pattern_length(pcre2_compile_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_newline(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_parens_nest_limit(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_recursion_guard(pcre2_compile_context *, \ + int (*)(uint32_t, void *), void *); + +#define PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_copy(pcre2_match_context *); \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_context_free(pcre2_match_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_callout(pcre2_match_context *, \ + int (*)(pcre2_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_substitute_callout(pcre2_match_context *, \ + int (*)(pcre2_substitute_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_depth_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_heap_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_match_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_offset_limit(pcre2_match_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_memory_management(pcre2_match_context *, \ + void *(*)(PCRE2_SIZE, void *), void (*)(void *, void *), void *); + +#define PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_copy(pcre2_convert_context *); \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_convert_context_free(pcre2_convert_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_escape(pcre2_convert_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_separator(pcre2_convert_context *, uint32_t); + + +/* Functions concerned with compiling a pattern to PCRE internal code. */ + +#define PCRE2_COMPILE_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_compile(PCRE2_SPTR, PCRE2_SIZE, uint32_t, int *, PCRE2_SIZE *, \ + pcre2_compile_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_code_free(pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy(const pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy_with_tables(const pcre2_code *); + + +/* Functions that give information about a compiled pattern. */ + +#define PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_info(const pcre2_code *, uint32_t, void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_callout_enumerate(const pcre2_code *, \ + int (*)(pcre2_callout_enumerate_block *, void *), void *); + + +/* Functions for running a match and inspecting the result. */ + +#define PCRE2_MATCH_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create(uint32_t, pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create_from_pattern(const pcre2_code *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_dfa_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, int *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_data_free(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SPTR PCRE2_CALL_CONVENTION \ + pcre2_get_mark(pcre2_match_data *); \ +PCRE2_EXP_DECL uint32_t PCRE2_CALL_CONVENTION \ + pcre2_get_ovector_count(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + *pcre2_get_ovector_pointer(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + pcre2_get_startchar(pcre2_match_data *); + + +/* Convenience functions for handling matched substrings. */ + +#define PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_free(PCRE2_UCHAR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_bynumber(pcre2_match_data *, uint32_t, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_nametable_scan(const pcre2_code *, PCRE2_SPTR, PCRE2_SPTR *, \ + PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_number_from_name(const pcre2_code *, PCRE2_SPTR); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_list_free(PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_list_get(pcre2_match_data *, PCRE2_UCHAR ***, PCRE2_SIZE **); + +/* Functions for serializing / deserializing compiled patterns. */ + +#define PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_encode(const pcre2_code **, int32_t, uint8_t **, \ + PCRE2_SIZE *, pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_decode(pcre2_code **, int32_t, const uint8_t *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_get_number_of_codes(const uint8_t *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_serialize_free(uint8_t *); + + +/* Convenience function for match + substitute. */ + +#define PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substitute(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, PCRE2_SPTR, \ + PCRE2_SIZE, PCRE2_UCHAR *, PCRE2_SIZE *); + + +/* Functions for converting pattern source strings. */ + +#define PCRE2_CONVERT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_convert(PCRE2_SPTR, PCRE2_SIZE, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *, pcre2_convert_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_converted_pattern_free(PCRE2_UCHAR *); + + +/* Functions for JIT processing */ + +#define PCRE2_JIT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_compile(pcre2_code *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_free_unused_memory(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_jit_stack PCRE2_CALL_CONVENTION \ + *pcre2_jit_stack_create(PCRE2_SIZE, PCRE2_SIZE, pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_assign(pcre2_match_context *, pcre2_jit_callback, void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_free(pcre2_jit_stack *); + + +/* Other miscellaneous functions. */ + +#define PCRE2_OTHER_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_get_error_message(int, PCRE2_UCHAR *, PCRE2_SIZE); \ +PCRE2_EXP_DECL const uint8_t PCRE2_CALL_CONVENTION \ + *pcre2_maketables(pcre2_general_context *); \ + + +/* Define macros that generate width-specific names from generic versions. The +three-level macro scheme is necessary to get the macros expanded when we want +them to be. First we get the width from PCRE2_LOCAL_WIDTH, which is used for +generating three versions of everything below. After that, PCRE2_SUFFIX will be +re-defined to use PCRE2_CODE_UNIT_WIDTH, for use when macros such as +pcre2_compile are called by application code. */ + +#define PCRE2_JOIN(a,b) a ## b +#define PCRE2_GLUE(a,b) PCRE2_JOIN(a,b) +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a,PCRE2_LOCAL_WIDTH) + + +/* Data types */ + +#define PCRE2_UCHAR PCRE2_SUFFIX(PCRE2_UCHAR) +#define PCRE2_SPTR PCRE2_SUFFIX(PCRE2_SPTR) + +#define pcre2_code PCRE2_SUFFIX(pcre2_code_) +#define pcre2_jit_callback PCRE2_SUFFIX(pcre2_jit_callback_) +#define pcre2_jit_stack PCRE2_SUFFIX(pcre2_jit_stack_) + +#define pcre2_real_code PCRE2_SUFFIX(pcre2_real_code_) +#define pcre2_real_general_context PCRE2_SUFFIX(pcre2_real_general_context_) +#define pcre2_real_compile_context PCRE2_SUFFIX(pcre2_real_compile_context_) +#define pcre2_real_convert_context PCRE2_SUFFIX(pcre2_real_convert_context_) +#define pcre2_real_match_context PCRE2_SUFFIX(pcre2_real_match_context_) +#define pcre2_real_jit_stack PCRE2_SUFFIX(pcre2_real_jit_stack_) +#define pcre2_real_match_data PCRE2_SUFFIX(pcre2_real_match_data_) + + +/* Data blocks */ + +#define pcre2_callout_block PCRE2_SUFFIX(pcre2_callout_block_) +#define pcre2_callout_enumerate_block PCRE2_SUFFIX(pcre2_callout_enumerate_block_) +#define pcre2_substitute_callout_block PCRE2_SUFFIX(pcre2_substitute_callout_block_) +#define pcre2_general_context PCRE2_SUFFIX(pcre2_general_context_) +#define pcre2_compile_context PCRE2_SUFFIX(pcre2_compile_context_) +#define pcre2_convert_context PCRE2_SUFFIX(pcre2_convert_context_) +#define pcre2_match_context PCRE2_SUFFIX(pcre2_match_context_) +#define pcre2_match_data PCRE2_SUFFIX(pcre2_match_data_) + + +/* Functions: the complete list in alphabetical order */ + +#define pcre2_callout_enumerate PCRE2_SUFFIX(pcre2_callout_enumerate_) +#define pcre2_code_copy PCRE2_SUFFIX(pcre2_code_copy_) +#define pcre2_code_copy_with_tables PCRE2_SUFFIX(pcre2_code_copy_with_tables_) +#define pcre2_code_free PCRE2_SUFFIX(pcre2_code_free_) +#define pcre2_compile PCRE2_SUFFIX(pcre2_compile_) +#define pcre2_compile_context_copy PCRE2_SUFFIX(pcre2_compile_context_copy_) +#define pcre2_compile_context_create PCRE2_SUFFIX(pcre2_compile_context_create_) +#define pcre2_compile_context_free PCRE2_SUFFIX(pcre2_compile_context_free_) +#define pcre2_config PCRE2_SUFFIX(pcre2_config_) +#define pcre2_convert_context_copy PCRE2_SUFFIX(pcre2_convert_context_copy_) +#define pcre2_convert_context_create PCRE2_SUFFIX(pcre2_convert_context_create_) +#define pcre2_convert_context_free PCRE2_SUFFIX(pcre2_convert_context_free_) +#define pcre2_converted_pattern_free PCRE2_SUFFIX(pcre2_converted_pattern_free_) +#define pcre2_dfa_match PCRE2_SUFFIX(pcre2_dfa_match_) +#define pcre2_general_context_copy PCRE2_SUFFIX(pcre2_general_context_copy_) +#define pcre2_general_context_create PCRE2_SUFFIX(pcre2_general_context_create_) +#define pcre2_general_context_free PCRE2_SUFFIX(pcre2_general_context_free_) +#define pcre2_get_error_message PCRE2_SUFFIX(pcre2_get_error_message_) +#define pcre2_get_mark PCRE2_SUFFIX(pcre2_get_mark_) +#define pcre2_get_ovector_pointer PCRE2_SUFFIX(pcre2_get_ovector_pointer_) +#define pcre2_get_ovector_count PCRE2_SUFFIX(pcre2_get_ovector_count_) +#define pcre2_get_startchar PCRE2_SUFFIX(pcre2_get_startchar_) +#define pcre2_jit_compile PCRE2_SUFFIX(pcre2_jit_compile_) +#define pcre2_jit_match PCRE2_SUFFIX(pcre2_jit_match_) +#define pcre2_jit_free_unused_memory PCRE2_SUFFIX(pcre2_jit_free_unused_memory_) +#define pcre2_jit_stack_assign PCRE2_SUFFIX(pcre2_jit_stack_assign_) +#define pcre2_jit_stack_create PCRE2_SUFFIX(pcre2_jit_stack_create_) +#define pcre2_jit_stack_free PCRE2_SUFFIX(pcre2_jit_stack_free_) +#define pcre2_maketables PCRE2_SUFFIX(pcre2_maketables_) +#define pcre2_match PCRE2_SUFFIX(pcre2_match_) +#define pcre2_match_context_copy PCRE2_SUFFIX(pcre2_match_context_copy_) +#define pcre2_match_context_create PCRE2_SUFFIX(pcre2_match_context_create_) +#define pcre2_match_context_free PCRE2_SUFFIX(pcre2_match_context_free_) +#define pcre2_match_data_create PCRE2_SUFFIX(pcre2_match_data_create_) +#define pcre2_match_data_create_from_pattern PCRE2_SUFFIX(pcre2_match_data_create_from_pattern_) +#define pcre2_match_data_free PCRE2_SUFFIX(pcre2_match_data_free_) +#define pcre2_pattern_convert PCRE2_SUFFIX(pcre2_pattern_convert_) +#define pcre2_pattern_info PCRE2_SUFFIX(pcre2_pattern_info_) +#define pcre2_serialize_decode PCRE2_SUFFIX(pcre2_serialize_decode_) +#define pcre2_serialize_encode PCRE2_SUFFIX(pcre2_serialize_encode_) +#define pcre2_serialize_free PCRE2_SUFFIX(pcre2_serialize_free_) +#define pcre2_serialize_get_number_of_codes PCRE2_SUFFIX(pcre2_serialize_get_number_of_codes_) +#define pcre2_set_bsr PCRE2_SUFFIX(pcre2_set_bsr_) +#define pcre2_set_callout PCRE2_SUFFIX(pcre2_set_callout_) +#define pcre2_set_character_tables PCRE2_SUFFIX(pcre2_set_character_tables_) +#define pcre2_set_compile_extra_options PCRE2_SUFFIX(pcre2_set_compile_extra_options_) +#define pcre2_set_compile_recursion_guard PCRE2_SUFFIX(pcre2_set_compile_recursion_guard_) +#define pcre2_set_depth_limit PCRE2_SUFFIX(pcre2_set_depth_limit_) +#define pcre2_set_glob_escape PCRE2_SUFFIX(pcre2_set_glob_escape_) +#define pcre2_set_glob_separator PCRE2_SUFFIX(pcre2_set_glob_separator_) +#define pcre2_set_heap_limit PCRE2_SUFFIX(pcre2_set_heap_limit_) +#define pcre2_set_match_limit PCRE2_SUFFIX(pcre2_set_match_limit_) +#define pcre2_set_max_pattern_length PCRE2_SUFFIX(pcre2_set_max_pattern_length_) +#define pcre2_set_newline PCRE2_SUFFIX(pcre2_set_newline_) +#define pcre2_set_parens_nest_limit PCRE2_SUFFIX(pcre2_set_parens_nest_limit_) +#define pcre2_set_offset_limit PCRE2_SUFFIX(pcre2_set_offset_limit_) +#define pcre2_set_substitute_callout PCRE2_SUFFIX(pcre2_set_substitute_callout_) +#define pcre2_substitute PCRE2_SUFFIX(pcre2_substitute_) +#define pcre2_substring_copy_byname PCRE2_SUFFIX(pcre2_substring_copy_byname_) +#define pcre2_substring_copy_bynumber PCRE2_SUFFIX(pcre2_substring_copy_bynumber_) +#define pcre2_substring_free PCRE2_SUFFIX(pcre2_substring_free_) +#define pcre2_substring_get_byname PCRE2_SUFFIX(pcre2_substring_get_byname_) +#define pcre2_substring_get_bynumber PCRE2_SUFFIX(pcre2_substring_get_bynumber_) +#define pcre2_substring_length_byname PCRE2_SUFFIX(pcre2_substring_length_byname_) +#define pcre2_substring_length_bynumber PCRE2_SUFFIX(pcre2_substring_length_bynumber_) +#define pcre2_substring_list_get PCRE2_SUFFIX(pcre2_substring_list_get_) +#define pcre2_substring_list_free PCRE2_SUFFIX(pcre2_substring_list_free_) +#define pcre2_substring_nametable_scan PCRE2_SUFFIX(pcre2_substring_nametable_scan_) +#define pcre2_substring_number_from_name PCRE2_SUFFIX(pcre2_substring_number_from_name_) + +/* Keep this old function name for backwards compatibility */ +#define pcre2_set_recursion_limit PCRE2_SUFFIX(pcre2_set_recursion_limit_) + +/* Keep this obsolete function for backwards compatibility: it is now a noop. */ +#define pcre2_set_recursion_memory_management PCRE2_SUFFIX(pcre2_set_recursion_memory_management_) + +/* Now generate all three sets of width-specific structures and function +prototypes. */ + +#define PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS \ +PCRE2_TYPES_LIST \ +PCRE2_STRUCTURE_LIST \ +PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_FUNCTIONS \ +PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_FUNCTIONS \ +PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_MATCH_FUNCTIONS \ +PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_JIT_FUNCTIONS \ +PCRE2_OTHER_FUNCTIONS + +#define PCRE2_LOCAL_WIDTH 8 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 16 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 32 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +/* Undefine the list macros; they are no longer needed. */ + +#undef PCRE2_TYPES_LIST +#undef PCRE2_STRUCTURE_LIST +#undef PCRE2_GENERAL_INFO_FUNCTIONS +#undef PCRE2_GENERAL_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_CONTEXT_FUNCTIONS +#undef PCRE2_CONVERT_CONTEXT_FUNCTIONS +#undef PCRE2_MATCH_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_FUNCTIONS +#undef PCRE2_PATTERN_INFO_FUNCTIONS +#undef PCRE2_MATCH_FUNCTIONS +#undef PCRE2_SUBSTRING_FUNCTIONS +#undef PCRE2_SERIALIZE_FUNCTIONS +#undef PCRE2_SUBSTITUTE_FUNCTION +#undef PCRE2_JIT_FUNCTIONS +#undef PCRE2_OTHER_FUNCTIONS +#undef PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS + +/* PCRE2_CODE_UNIT_WIDTH must be defined. If it is 8, 16, or 32, redefine +PCRE2_SUFFIX to use it. If it is 0, undefine the other macros and make +PCRE2_SUFFIX a no-op. Otherwise, generate an error. */ + +#undef PCRE2_SUFFIX +#ifndef PCRE2_CODE_UNIT_WIDTH +#error PCRE2_CODE_UNIT_WIDTH must be defined before including pcre2.h. +#error Use 8, 16, or 32; or 0 for a multi-width application. +#else /* PCRE2_CODE_UNIT_WIDTH is defined */ +#if PCRE2_CODE_UNIT_WIDTH == 8 || \ + PCRE2_CODE_UNIT_WIDTH == 16 || \ + PCRE2_CODE_UNIT_WIDTH == 32 +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a, PCRE2_CODE_UNIT_WIDTH) +#elif PCRE2_CODE_UNIT_WIDTH == 0 +#undef PCRE2_JOIN +#undef PCRE2_GLUE +#define PCRE2_SUFFIX(a) a +#else +#error PCRE2_CODE_UNIT_WIDTH must be 0, 8, 16, or 32. +#endif +#endif /* PCRE2_CODE_UNIT_WIDTH is defined */ + +#ifdef __cplusplus +} /* extern "C" */ +#endif + +#endif /* PCRE2_H_IDEMPOTENT_GUARD */ + +/* End of pcre2.h */ diff --git a/csrc/rex_pcre2/pcre2/mingw64/pcre2_chartables.c b/csrc/rex_pcre2/pcre2/mingw64/pcre2_chartables.c new file mode 100755 index 0000000..0e07edb --- /dev/null +++ b/csrc/rex_pcre2/pcre2/mingw64/pcre2_chartables.c @@ -0,0 +1,198 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This file was automatically written by the dftables auxiliary +program. It contains character tables that are used when no external +tables are passed to PCRE2 by the application that calls it. The tables +are used only for characters whose code values are less than 256. */ + +/*The dftables program (which is distributed with PCRE2) can be used to +build alternative versions of this file. This is necessary if you are +running in an EBCDIC environment, or if you want to default to a different +encoding, for example ISO-8859-1. When dftables is run, it creates these +tables in the current locale. This happens automatically if PCRE2 is +configured with --enable-rebuild-chartables. */ + +/* The following #include is present because without it gcc 4.x may remove +the array definition from the final binary if PCRE2 is built into a static +library and dead code stripping is activated. This leads to link errors. +Pulling in the header ensures that the array gets flagged as "someone +outside this compilation unit might reference this" and so it will always +be supplied to the linker. */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "pcre2_internal.h" + +const uint8_t PRIV(default_tables)[] = { + +/* This table is a lower casing table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table is a case flipping table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 65, 66, 67, 68, 69, 70, 71, + 72, 73, 74, 75, 76, 77, 78, 79, + 80, 81, 82, 83, 84, 85, 86, 87, + 88, 89, 90,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table contains bit maps for various character classes. Each map is 32 +bytes long and the bits run from the least significant end of each byte. The +classes that have their own maps are: space, xdigit, digit, upper, lower, word, +graph print, punct, and cntrl. Other classes are built from combinations. */ + + 0x00,0x3e,0x00,0x00,0x01,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x7e,0x00,0x00,0x00,0x7e,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0xfe,0xff,0xff,0x07,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0xfe,0xff,0xff,0x87,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xff,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0x00,0xfc, + 0x01,0x00,0x00,0xf8,0x01,0x00,0x00,0x78, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0xff,0xff,0xff,0xff,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + +/* This table identifies various classes of character by individual bits: + 0x01 white space character + 0x02 letter + 0x04 lower case letter + 0x08 decimal digit + 0x10 alphanumeric or '_' +*/ + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 */ + 0x00,0x01,0x01,0x01,0x01,0x01,0x00,0x00, /* 8- 15 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */ + 0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - ' */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ( - / */ + 0x18,0x18,0x18,0x18,0x18,0x18,0x18,0x18, /* 0 - 7 */ + 0x18,0x18,0x00,0x00,0x00,0x00,0x00,0x00, /* 8 - ? */ + 0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* @ - G */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* H - O */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* P - W */ + 0x12,0x12,0x12,0x00,0x00,0x00,0x00,0x10, /* X - _ */ + 0x00,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* ` - g */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* h - o */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* p - w */ + 0x16,0x16,0x16,0x00,0x00,0x00,0x00,0x00, /* x -127 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */ + +/* End of pcre2_chartables.c */ diff --git a/csrc/rex_pcre2/pcre2/osx64/config.h b/csrc/rex_pcre2/pcre2/osx64/config.h new file mode 100644 index 0000000..72d1e8f --- /dev/null +++ b/csrc/rex_pcre2/pcre2/osx64/config.h @@ -0,0 +1,54 @@ +/* config.h for CMake builds */ + +#define HAVE_DIRENT_H 1 +#define HAVE_INTTYPES_H 1 +#define HAVE_STDINT_H 1 +#define HAVE_STRERROR 1 +#define HAVE_SYS_STAT_H 1 +#define HAVE_SYS_TYPES_H 1 +#define HAVE_UNISTD_H 1 +/* #undef HAVE_WINDOWS_H */ + +#define HAVE_BCOPY 1 +#define HAVE_MEMMOVE 1 + +#define PCRE2_STATIC 1 + +#define SUPPORT_PCRE2_8 1 +/* #undef SUPPORT_PCRE2_16 */ +/* #undef SUPPORT_PCRE2_32 */ +/* #undef PCRE2_DEBUG */ +/* #undef DISABLE_PERCENT_ZT */ + +#define SUPPORT_LIBBZ2 1 +/* #undef SUPPORT_LIBEDIT */ +#define SUPPORT_LIBREADLINE 1 +#define SUPPORT_LIBZ 1 + +/* #undef SUPPORT_JIT */ +/* #undef SLJIT_PROT_EXECUTABLE_ALLOCATOR */ +#define SUPPORT_PCRE2GREP_JIT 1 +#define SUPPORT_PCRE2GREP_CALLOUT 1 +#define SUPPORT_PCRE2GREP_CALLOUT_FORK 1 +#define SUPPORT_UNICODE 1 +/* #undef SUPPORT_VALGRIND */ + +/* #undef BSR_ANYCRLF */ +/* #undef EBCDIC */ +/* #undef EBCDIC_NL25 */ +/* #undef HEAP_MATCH_RECURSE */ +/* #undef NEVER_BACKSLASH_C */ + +#define LINK_SIZE 2 +#define HEAP_LIMIT 20000000 +#define MATCH_LIMIT 10000000 +#define MATCH_LIMIT_DEPTH MATCH_LIMIT +#define NEWLINE_DEFAULT 2 +#define PARENS_NEST_LIMIT 250 +#define PCRE2GREP_BUFSIZE 20480 +#define PCRE2GREP_MAX_BUFSIZE 1048576 + +#define MAX_NAME_SIZE 32 +#define MAX_NAME_COUNT 10000 + +/* end config.h for CMake builds */ diff --git a/csrc/rex_pcre2/pcre2/osx64/pcre2.h b/csrc/rex_pcre2/pcre2/osx64/pcre2.h new file mode 100644 index 0000000..0833161 --- /dev/null +++ b/csrc/rex_pcre2/pcre2/osx64/pcre2.h @@ -0,0 +1,981 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This is the public header file for the PCRE library, second API, to be +#included by applications that call PCRE2 functions. + + Copyright (c) 2016-2019 University of Cambridge + +----------------------------------------------------------------------------- +Redistribution and use in source and binary forms, with or without +modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + * Neither the name of the University of Cambridge nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE +POSSIBILITY OF SUCH DAMAGE. +----------------------------------------------------------------------------- +*/ + +#ifndef PCRE2_H_IDEMPOTENT_GUARD +#define PCRE2_H_IDEMPOTENT_GUARD + +/* The current PCRE version information. */ + +#define PCRE2_MAJOR 10 +#define PCRE2_MINOR 34 +#define PCRE2_PRERELEASE -RC1 +#define PCRE2_DATE 2019-04-22 + +/* When an application links to a PCRE DLL in Windows, the symbols that are +imported have to be identified as such. When building PCRE2, the appropriate +export setting is defined in pcre2_internal.h, which includes this file. So we +don't change existing definitions of PCRE2_EXP_DECL. */ + +#if defined(_WIN32) && !defined(PCRE2_STATIC) +# ifndef PCRE2_EXP_DECL +# define PCRE2_EXP_DECL extern __declspec(dllimport) +# endif +#endif + +/* By default, we use the standard "extern" declarations. */ + +#ifndef PCRE2_EXP_DECL +# ifdef __cplusplus +# define PCRE2_EXP_DECL extern "C" +# else +# define PCRE2_EXP_DECL extern +# endif +#endif + +/* When compiling with the MSVC compiler, it is sometimes necessary to include +a "calling convention" before exported function names. (This is secondhand +information; I know nothing about MSVC myself). For example, something like + + void __cdecl function(....) + +might be needed. In order so make this easy, all the exported functions have +PCRE2_CALL_CONVENTION just before their names. It is rarely needed; if not +set, we ensure here that it has no effect. */ + +#ifndef PCRE2_CALL_CONVENTION +#define PCRE2_CALL_CONVENTION +#endif + +/* Have to include limits.h, stdlib.h, and inttypes.h to ensure that size_t and +uint8_t, UCHAR_MAX, etc are defined. Some systems that do have inttypes.h do +not have stdint.h, which is why we use inttypes.h, which according to the C +standard is a superset of stdint.h. If none of these headers are available, +the relevant values must be provided by some other means. */ + +#include +#include +#include + +/* Allow for C++ users compiling this directly. */ + +#ifdef __cplusplus +extern "C" { +#endif + +/* The following option bits can be passed to pcre2_compile(), pcre2_match(), +or pcre2_dfa_match(). PCRE2_NO_UTF_CHECK affects only the function to which it +is passed. Put these bits at the most significant end of the options word so +others can be added next to them */ + +#define PCRE2_ANCHORED 0x80000000u +#define PCRE2_NO_UTF_CHECK 0x40000000u +#define PCRE2_ENDANCHORED 0x20000000u + +/* The following option bits can be passed only to pcre2_compile(). However, +they may affect compilation, JIT compilation, and/or interpretive execution. +The following tags indicate which: + +C alters what is compiled by pcre2_compile() +J alters what is compiled by pcre2_jit_compile() +M is inspected during pcre2_match() execution +D is inspected during pcre2_dfa_match() execution +*/ + +#define PCRE2_ALLOW_EMPTY_CLASS 0x00000001u /* C */ +#define PCRE2_ALT_BSUX 0x00000002u /* C */ +#define PCRE2_AUTO_CALLOUT 0x00000004u /* C */ +#define PCRE2_CASELESS 0x00000008u /* C */ +#define PCRE2_DOLLAR_ENDONLY 0x00000010u /* J M D */ +#define PCRE2_DOTALL 0x00000020u /* C */ +#define PCRE2_DUPNAMES 0x00000040u /* C */ +#define PCRE2_EXTENDED 0x00000080u /* C */ +#define PCRE2_FIRSTLINE 0x00000100u /* J M D */ +#define PCRE2_MATCH_UNSET_BACKREF 0x00000200u /* C J M */ +#define PCRE2_MULTILINE 0x00000400u /* C */ +#define PCRE2_NEVER_UCP 0x00000800u /* C */ +#define PCRE2_NEVER_UTF 0x00001000u /* C */ +#define PCRE2_NO_AUTO_CAPTURE 0x00002000u /* C */ +#define PCRE2_NO_AUTO_POSSESS 0x00004000u /* C */ +#define PCRE2_NO_DOTSTAR_ANCHOR 0x00008000u /* C */ +#define PCRE2_NO_START_OPTIMIZE 0x00010000u /* J M D */ +#define PCRE2_UCP 0x00020000u /* C J M D */ +#define PCRE2_UNGREEDY 0x00040000u /* C */ +#define PCRE2_UTF 0x00080000u /* C J M D */ +#define PCRE2_NEVER_BACKSLASH_C 0x00100000u /* C */ +#define PCRE2_ALT_CIRCUMFLEX 0x00200000u /* J M D */ +#define PCRE2_ALT_VERBNAMES 0x00400000u /* C */ +#define PCRE2_USE_OFFSET_LIMIT 0x00800000u /* J M D */ +#define PCRE2_EXTENDED_MORE 0x01000000u /* C */ +#define PCRE2_LITERAL 0x02000000u /* C */ +#define PCRE2_MATCH_INVALID_UTF 0x04000000u /* J M D */ + +/* An additional compile options word is available in the compile context. */ + +#define PCRE2_EXTRA_ALLOW_SURROGATE_ESCAPES 0x00000001u /* C */ +#define PCRE2_EXTRA_BAD_ESCAPE_IS_LITERAL 0x00000002u /* C */ +#define PCRE2_EXTRA_MATCH_WORD 0x00000004u /* C */ +#define PCRE2_EXTRA_MATCH_LINE 0x00000008u /* C */ +#define PCRE2_EXTRA_ESCAPED_CR_IS_LF 0x00000010u /* C */ +#define PCRE2_EXTRA_ALT_BSUX 0x00000020u /* C */ + +/* These are for pcre2_jit_compile(). */ + +#define PCRE2_JIT_COMPLETE 0x00000001u /* For full matching */ +#define PCRE2_JIT_PARTIAL_SOFT 0x00000002u +#define PCRE2_JIT_PARTIAL_HARD 0x00000004u +#define PCRE2_JIT_INVALID_UTF 0x00000100u + +/* These are for pcre2_match(), pcre2_dfa_match(), pcre2_jit_match(), and +pcre2_substitute(). Some are allowed only for one of the functions, and in +these cases it is noted below. Note that PCRE2_ANCHORED, PCRE2_ENDANCHORED and +PCRE2_NO_UTF_CHECK can also be passed to these functions (though +pcre2_jit_match() ignores the latter since it bypasses all sanity checks). */ + +#define PCRE2_NOTBOL 0x00000001u +#define PCRE2_NOTEOL 0x00000002u +#define PCRE2_NOTEMPTY 0x00000004u /* ) These two must be kept */ +#define PCRE2_NOTEMPTY_ATSTART 0x00000008u /* ) adjacent to each other. */ +#define PCRE2_PARTIAL_SOFT 0x00000010u +#define PCRE2_PARTIAL_HARD 0x00000020u +#define PCRE2_DFA_RESTART 0x00000040u /* pcre2_dfa_match() only */ +#define PCRE2_DFA_SHORTEST 0x00000080u /* pcre2_dfa_match() only */ +#define PCRE2_SUBSTITUTE_GLOBAL 0x00000100u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_EXTENDED 0x00000200u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNSET_EMPTY 0x00000400u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_UNKNOWN_UNSET 0x00000800u /* pcre2_substitute() only */ +#define PCRE2_SUBSTITUTE_OVERFLOW_LENGTH 0x00001000u /* pcre2_substitute() only */ +#define PCRE2_NO_JIT 0x00002000u /* Not for pcre2_dfa_match() */ +#define PCRE2_COPY_MATCHED_SUBJECT 0x00004000u + +/* Options for pcre2_pattern_convert(). */ + +#define PCRE2_CONVERT_UTF 0x00000001u +#define PCRE2_CONVERT_NO_UTF_CHECK 0x00000002u +#define PCRE2_CONVERT_POSIX_BASIC 0x00000004u +#define PCRE2_CONVERT_POSIX_EXTENDED 0x00000008u +#define PCRE2_CONVERT_GLOB 0x00000010u +#define PCRE2_CONVERT_GLOB_NO_WILD_SEPARATOR 0x00000030u +#define PCRE2_CONVERT_GLOB_NO_STARSTAR 0x00000050u + +/* Newline and \R settings, for use in compile contexts. The newline values +must be kept in step with values set in config.h and both sets must all be +greater than zero. */ + +#define PCRE2_NEWLINE_CR 1 +#define PCRE2_NEWLINE_LF 2 +#define PCRE2_NEWLINE_CRLF 3 +#define PCRE2_NEWLINE_ANY 4 +#define PCRE2_NEWLINE_ANYCRLF 5 +#define PCRE2_NEWLINE_NUL 6 + +#define PCRE2_BSR_UNICODE 1 +#define PCRE2_BSR_ANYCRLF 2 + +/* Error codes for pcre2_compile(). Some of these are also used by +pcre2_pattern_convert(). */ + +#define PCRE2_ERROR_END_BACKSLASH 101 +#define PCRE2_ERROR_END_BACKSLASH_C 102 +#define PCRE2_ERROR_UNKNOWN_ESCAPE 103 +#define PCRE2_ERROR_QUANTIFIER_OUT_OF_ORDER 104 +#define PCRE2_ERROR_QUANTIFIER_TOO_BIG 105 +#define PCRE2_ERROR_MISSING_SQUARE_BRACKET 106 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_CLASS 107 +#define PCRE2_ERROR_CLASS_RANGE_ORDER 108 +#define PCRE2_ERROR_QUANTIFIER_INVALID 109 +#define PCRE2_ERROR_INTERNAL_UNEXPECTED_REPEAT 110 +#define PCRE2_ERROR_INVALID_AFTER_PARENS_QUERY 111 +#define PCRE2_ERROR_POSIX_CLASS_NOT_IN_CLASS 112 +#define PCRE2_ERROR_POSIX_NO_SUPPORT_COLLATING 113 +#define PCRE2_ERROR_MISSING_CLOSING_PARENTHESIS 114 +#define PCRE2_ERROR_BAD_SUBPATTERN_REFERENCE 115 +#define PCRE2_ERROR_NULL_PATTERN 116 +#define PCRE2_ERROR_BAD_OPTIONS 117 +#define PCRE2_ERROR_MISSING_COMMENT_CLOSING 118 +#define PCRE2_ERROR_PARENTHESES_NEST_TOO_DEEP 119 +#define PCRE2_ERROR_PATTERN_TOO_LARGE 120 +#define PCRE2_ERROR_HEAP_FAILED 121 +#define PCRE2_ERROR_UNMATCHED_CLOSING_PARENTHESIS 122 +#define PCRE2_ERROR_INTERNAL_CODE_OVERFLOW 123 +#define PCRE2_ERROR_MISSING_CONDITION_CLOSING 124 +#define PCRE2_ERROR_LOOKBEHIND_NOT_FIXED_LENGTH 125 +#define PCRE2_ERROR_ZERO_RELATIVE_REFERENCE 126 +#define PCRE2_ERROR_TOO_MANY_CONDITION_BRANCHES 127 +#define PCRE2_ERROR_CONDITION_ASSERTION_EXPECTED 128 +#define PCRE2_ERROR_BAD_RELATIVE_REFERENCE 129 +#define PCRE2_ERROR_UNKNOWN_POSIX_CLASS 130 +#define PCRE2_ERROR_INTERNAL_STUDY_ERROR 131 +#define PCRE2_ERROR_UNICODE_NOT_SUPPORTED 132 +#define PCRE2_ERROR_PARENTHESES_STACK_CHECK 133 +#define PCRE2_ERROR_CODE_POINT_TOO_BIG 134 +#define PCRE2_ERROR_LOOKBEHIND_TOO_COMPLICATED 135 +#define PCRE2_ERROR_LOOKBEHIND_INVALID_BACKSLASH_C 136 +#define PCRE2_ERROR_UNSUPPORTED_ESCAPE_SEQUENCE 137 +#define PCRE2_ERROR_CALLOUT_NUMBER_TOO_BIG 138 +#define PCRE2_ERROR_MISSING_CALLOUT_CLOSING 139 +#define PCRE2_ERROR_ESCAPE_INVALID_IN_VERB 140 +#define PCRE2_ERROR_UNRECOGNIZED_AFTER_QUERY_P 141 +#define PCRE2_ERROR_MISSING_NAME_TERMINATOR 142 +#define PCRE2_ERROR_DUPLICATE_SUBPATTERN_NAME 143 +#define PCRE2_ERROR_INVALID_SUBPATTERN_NAME 144 +#define PCRE2_ERROR_UNICODE_PROPERTIES_UNAVAILABLE 145 +#define PCRE2_ERROR_MALFORMED_UNICODE_PROPERTY 146 +#define PCRE2_ERROR_UNKNOWN_UNICODE_PROPERTY 147 +#define PCRE2_ERROR_SUBPATTERN_NAME_TOO_LONG 148 +#define PCRE2_ERROR_TOO_MANY_NAMED_SUBPATTERNS 149 +#define PCRE2_ERROR_CLASS_INVALID_RANGE 150 +#define PCRE2_ERROR_OCTAL_BYTE_TOO_BIG 151 +#define PCRE2_ERROR_INTERNAL_OVERRAN_WORKSPACE 152 +#define PCRE2_ERROR_INTERNAL_MISSING_SUBPATTERN 153 +#define PCRE2_ERROR_DEFINE_TOO_MANY_BRANCHES 154 +#define PCRE2_ERROR_BACKSLASH_O_MISSING_BRACE 155 +#define PCRE2_ERROR_INTERNAL_UNKNOWN_NEWLINE 156 +#define PCRE2_ERROR_BACKSLASH_G_SYNTAX 157 +#define PCRE2_ERROR_PARENS_QUERY_R_MISSING_CLOSING 158 +/* Error 159 is obsolete and should now never occur */ +#define PCRE2_ERROR_VERB_ARGUMENT_NOT_ALLOWED 159 +#define PCRE2_ERROR_VERB_UNKNOWN 160 +#define PCRE2_ERROR_SUBPATTERN_NUMBER_TOO_BIG 161 +#define PCRE2_ERROR_SUBPATTERN_NAME_EXPECTED 162 +#define PCRE2_ERROR_INTERNAL_PARSED_OVERFLOW 163 +#define PCRE2_ERROR_INVALID_OCTAL 164 +#define PCRE2_ERROR_SUBPATTERN_NAMES_MISMATCH 165 +#define PCRE2_ERROR_MARK_MISSING_ARGUMENT 166 +#define PCRE2_ERROR_INVALID_HEXADECIMAL 167 +#define PCRE2_ERROR_BACKSLASH_C_SYNTAX 168 +#define PCRE2_ERROR_BACKSLASH_K_SYNTAX 169 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_LOOKBEHINDS 170 +#define PCRE2_ERROR_BACKSLASH_N_IN_CLASS 171 +#define PCRE2_ERROR_CALLOUT_STRING_TOO_LONG 172 +#define PCRE2_ERROR_UNICODE_DISALLOWED_CODE_POINT 173 +#define PCRE2_ERROR_UTF_IS_DISABLED 174 +#define PCRE2_ERROR_UCP_IS_DISABLED 175 +#define PCRE2_ERROR_VERB_NAME_TOO_LONG 176 +#define PCRE2_ERROR_BACKSLASH_U_CODE_POINT_TOO_BIG 177 +#define PCRE2_ERROR_MISSING_OCTAL_OR_HEX_DIGITS 178 +#define PCRE2_ERROR_VERSION_CONDITION_SYNTAX 179 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_AUTO_POSSESS 180 +#define PCRE2_ERROR_CALLOUT_NO_STRING_DELIMITER 181 +#define PCRE2_ERROR_CALLOUT_BAD_STRING_DELIMITER 182 +#define PCRE2_ERROR_BACKSLASH_C_CALLER_DISABLED 183 +#define PCRE2_ERROR_QUERY_BARJX_NEST_TOO_DEEP 184 +#define PCRE2_ERROR_BACKSLASH_C_LIBRARY_DISABLED 185 +#define PCRE2_ERROR_PATTERN_TOO_COMPLICATED 186 +#define PCRE2_ERROR_LOOKBEHIND_TOO_LONG 187 +#define PCRE2_ERROR_PATTERN_STRING_TOO_LONG 188 +#define PCRE2_ERROR_INTERNAL_BAD_CODE 189 +#define PCRE2_ERROR_INTERNAL_BAD_CODE_IN_SKIP 190 +#define PCRE2_ERROR_NO_SURROGATES_IN_UTF16 191 +#define PCRE2_ERROR_BAD_LITERAL_OPTIONS 192 +#define PCRE2_ERROR_SUPPORTED_ONLY_IN_UNICODE 193 +#define PCRE2_ERROR_INVALID_HYPHEN_IN_OPTIONS 194 +#define PCRE2_ERROR_ALPHA_ASSERTION_UNKNOWN 195 +#define PCRE2_ERROR_SCRIPT_RUN_NOT_AVAILABLE 196 +#define PCRE2_ERROR_TOO_MANY_CAPTURES 197 + + +/* "Expected" matching error codes: no match and partial match. */ + +#define PCRE2_ERROR_NOMATCH (-1) +#define PCRE2_ERROR_PARTIAL (-2) + +/* Error codes for UTF-8 validity checks */ + +#define PCRE2_ERROR_UTF8_ERR1 (-3) +#define PCRE2_ERROR_UTF8_ERR2 (-4) +#define PCRE2_ERROR_UTF8_ERR3 (-5) +#define PCRE2_ERROR_UTF8_ERR4 (-6) +#define PCRE2_ERROR_UTF8_ERR5 (-7) +#define PCRE2_ERROR_UTF8_ERR6 (-8) +#define PCRE2_ERROR_UTF8_ERR7 (-9) +#define PCRE2_ERROR_UTF8_ERR8 (-10) +#define PCRE2_ERROR_UTF8_ERR9 (-11) +#define PCRE2_ERROR_UTF8_ERR10 (-12) +#define PCRE2_ERROR_UTF8_ERR11 (-13) +#define PCRE2_ERROR_UTF8_ERR12 (-14) +#define PCRE2_ERROR_UTF8_ERR13 (-15) +#define PCRE2_ERROR_UTF8_ERR14 (-16) +#define PCRE2_ERROR_UTF8_ERR15 (-17) +#define PCRE2_ERROR_UTF8_ERR16 (-18) +#define PCRE2_ERROR_UTF8_ERR17 (-19) +#define PCRE2_ERROR_UTF8_ERR18 (-20) +#define PCRE2_ERROR_UTF8_ERR19 (-21) +#define PCRE2_ERROR_UTF8_ERR20 (-22) +#define PCRE2_ERROR_UTF8_ERR21 (-23) + +/* Error codes for UTF-16 validity checks */ + +#define PCRE2_ERROR_UTF16_ERR1 (-24) +#define PCRE2_ERROR_UTF16_ERR2 (-25) +#define PCRE2_ERROR_UTF16_ERR3 (-26) + +/* Error codes for UTF-32 validity checks */ + +#define PCRE2_ERROR_UTF32_ERR1 (-27) +#define PCRE2_ERROR_UTF32_ERR2 (-28) + +/* Miscellaneous error codes for pcre2[_dfa]_match(), substring extraction +functions, context functions, and serializing functions. They are in numerical +order. Originally they were in alphabetical order too, but now that PCRE2 is +released, the numbers must not be changed. */ + +#define PCRE2_ERROR_BADDATA (-29) +#define PCRE2_ERROR_MIXEDTABLES (-30) /* Name was changed */ +#define PCRE2_ERROR_BADMAGIC (-31) +#define PCRE2_ERROR_BADMODE (-32) +#define PCRE2_ERROR_BADOFFSET (-33) +#define PCRE2_ERROR_BADOPTION (-34) +#define PCRE2_ERROR_BADREPLACEMENT (-35) +#define PCRE2_ERROR_BADUTFOFFSET (-36) +#define PCRE2_ERROR_CALLOUT (-37) /* Never used by PCRE2 itself */ +#define PCRE2_ERROR_DFA_BADRESTART (-38) +#define PCRE2_ERROR_DFA_RECURSE (-39) +#define PCRE2_ERROR_DFA_UCOND (-40) +#define PCRE2_ERROR_DFA_UFUNC (-41) +#define PCRE2_ERROR_DFA_UITEM (-42) +#define PCRE2_ERROR_DFA_WSSIZE (-43) +#define PCRE2_ERROR_INTERNAL (-44) +#define PCRE2_ERROR_JIT_BADOPTION (-45) +#define PCRE2_ERROR_JIT_STACKLIMIT (-46) +#define PCRE2_ERROR_MATCHLIMIT (-47) +#define PCRE2_ERROR_NOMEMORY (-48) +#define PCRE2_ERROR_NOSUBSTRING (-49) +#define PCRE2_ERROR_NOUNIQUESUBSTRING (-50) +#define PCRE2_ERROR_NULL (-51) +#define PCRE2_ERROR_RECURSELOOP (-52) +#define PCRE2_ERROR_DEPTHLIMIT (-53) +#define PCRE2_ERROR_RECURSIONLIMIT (-53) /* Obsolete synonym */ +#define PCRE2_ERROR_UNAVAILABLE (-54) +#define PCRE2_ERROR_UNSET (-55) +#define PCRE2_ERROR_BADOFFSETLIMIT (-56) +#define PCRE2_ERROR_BADREPESCAPE (-57) +#define PCRE2_ERROR_REPMISSINGBRACE (-58) +#define PCRE2_ERROR_BADSUBSTITUTION (-59) +#define PCRE2_ERROR_BADSUBSPATTERN (-60) +#define PCRE2_ERROR_TOOMANYREPLACE (-61) +#define PCRE2_ERROR_BADSERIALIZEDDATA (-62) +#define PCRE2_ERROR_HEAPLIMIT (-63) +#define PCRE2_ERROR_CONVERT_SYNTAX (-64) +#define PCRE2_ERROR_INTERNAL_DUPMATCH (-65) +#define PCRE2_ERROR_DFA_UINVALID_UTF (-66) + + +/* Request types for pcre2_pattern_info() */ + +#define PCRE2_INFO_ALLOPTIONS 0 +#define PCRE2_INFO_ARGOPTIONS 1 +#define PCRE2_INFO_BACKREFMAX 2 +#define PCRE2_INFO_BSR 3 +#define PCRE2_INFO_CAPTURECOUNT 4 +#define PCRE2_INFO_FIRSTCODEUNIT 5 +#define PCRE2_INFO_FIRSTCODETYPE 6 +#define PCRE2_INFO_FIRSTBITMAP 7 +#define PCRE2_INFO_HASCRORLF 8 +#define PCRE2_INFO_JCHANGED 9 +#define PCRE2_INFO_JITSIZE 10 +#define PCRE2_INFO_LASTCODEUNIT 11 +#define PCRE2_INFO_LASTCODETYPE 12 +#define PCRE2_INFO_MATCHEMPTY 13 +#define PCRE2_INFO_MATCHLIMIT 14 +#define PCRE2_INFO_MAXLOOKBEHIND 15 +#define PCRE2_INFO_MINLENGTH 16 +#define PCRE2_INFO_NAMECOUNT 17 +#define PCRE2_INFO_NAMEENTRYSIZE 18 +#define PCRE2_INFO_NAMETABLE 19 +#define PCRE2_INFO_NEWLINE 20 +#define PCRE2_INFO_DEPTHLIMIT 21 +#define PCRE2_INFO_RECURSIONLIMIT 21 /* Obsolete synonym */ +#define PCRE2_INFO_SIZE 22 +#define PCRE2_INFO_HASBACKSLASHC 23 +#define PCRE2_INFO_FRAMESIZE 24 +#define PCRE2_INFO_HEAPLIMIT 25 +#define PCRE2_INFO_EXTRAOPTIONS 26 + +/* Request types for pcre2_config(). */ + +#define PCRE2_CONFIG_BSR 0 +#define PCRE2_CONFIG_JIT 1 +#define PCRE2_CONFIG_JITTARGET 2 +#define PCRE2_CONFIG_LINKSIZE 3 +#define PCRE2_CONFIG_MATCHLIMIT 4 +#define PCRE2_CONFIG_NEWLINE 5 +#define PCRE2_CONFIG_PARENSLIMIT 6 +#define PCRE2_CONFIG_DEPTHLIMIT 7 +#define PCRE2_CONFIG_RECURSIONLIMIT 7 /* Obsolete synonym */ +#define PCRE2_CONFIG_STACKRECURSE 8 /* Obsolete */ +#define PCRE2_CONFIG_UNICODE 9 +#define PCRE2_CONFIG_UNICODE_VERSION 10 +#define PCRE2_CONFIG_VERSION 11 +#define PCRE2_CONFIG_HEAPLIMIT 12 +#define PCRE2_CONFIG_NEVER_BACKSLASH_C 13 +#define PCRE2_CONFIG_COMPILED_WIDTHS 14 + + +/* Types for code units in patterns and subject strings. */ + +typedef uint8_t PCRE2_UCHAR8; +typedef uint16_t PCRE2_UCHAR16; +typedef uint32_t PCRE2_UCHAR32; + +typedef const PCRE2_UCHAR8 *PCRE2_SPTR8; +typedef const PCRE2_UCHAR16 *PCRE2_SPTR16; +typedef const PCRE2_UCHAR32 *PCRE2_SPTR32; + +/* The PCRE2_SIZE type is used for all string lengths and offsets in PCRE2, +including pattern offsets for errors and subject offsets after a match. We +define special values to indicate zero-terminated strings and unset offsets in +the offset vector (ovector). */ + +#define PCRE2_SIZE size_t +#define PCRE2_SIZE_MAX SIZE_MAX +#define PCRE2_ZERO_TERMINATED (~(PCRE2_SIZE)0) +#define PCRE2_UNSET (~(PCRE2_SIZE)0) + +/* Generic types for opaque structures and JIT callback functions. These +declarations are defined in a macro that is expanded for each width later. */ + +#define PCRE2_TYPES_LIST \ +struct pcre2_real_general_context; \ +typedef struct pcre2_real_general_context pcre2_general_context; \ +\ +struct pcre2_real_compile_context; \ +typedef struct pcre2_real_compile_context pcre2_compile_context; \ +\ +struct pcre2_real_match_context; \ +typedef struct pcre2_real_match_context pcre2_match_context; \ +\ +struct pcre2_real_convert_context; \ +typedef struct pcre2_real_convert_context pcre2_convert_context; \ +\ +struct pcre2_real_code; \ +typedef struct pcre2_real_code pcre2_code; \ +\ +struct pcre2_real_match_data; \ +typedef struct pcre2_real_match_data pcre2_match_data; \ +\ +struct pcre2_real_jit_stack; \ +typedef struct pcre2_real_jit_stack pcre2_jit_stack; \ +\ +typedef pcre2_jit_stack *(*pcre2_jit_callback)(void *); + + +/* The structures for passing out data via callout functions. We use structures +so that new fields can be added on the end in future versions, without changing +the API of the function, thereby allowing old clients to work without +modification. Define the generic versions in a macro; the width-specific +versions are generated from this macro below. */ + +/* Flags for the callout_flags field. These are cleared after a callout. */ + +#define PCRE2_CALLOUT_STARTMATCH 0x00000001u /* Set for each bumpalong */ +#define PCRE2_CALLOUT_BACKTRACK 0x00000002u /* Set after a backtrack */ + +#define PCRE2_STRUCTURE_LIST \ +typedef struct pcre2_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + uint32_t capture_top; /* Max current capture */ \ + uint32_t capture_last; /* Most recently closed capture */ \ + PCRE2_SIZE *offset_vector; /* The offset vector */ \ + PCRE2_SPTR mark; /* Pointer to current mark or NULL */ \ + PCRE2_SPTR subject; /* The subject being matched */ \ + PCRE2_SIZE subject_length; /* The length of the subject */ \ + PCRE2_SIZE start_match; /* Offset to start of this match attempt */ \ + PCRE2_SIZE current_position; /* Where we currently are in the subject */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + /* ------------------- Added for Version 1 -------------------------- */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------- Added for Version 2 -------------------------- */ \ + uint32_t callout_flags; /* See above for list */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_block; \ +\ +typedef struct pcre2_callout_enumerate_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SIZE pattern_position; /* Offset to next item in the pattern */ \ + PCRE2_SIZE next_item_length; /* Length of next item in the pattern */ \ + uint32_t callout_number; /* Number compiled into pattern */ \ + PCRE2_SIZE callout_string_offset; /* Offset to string within pattern */ \ + PCRE2_SIZE callout_string_length; /* Length of string compiled into pattern */ \ + PCRE2_SPTR callout_string; /* String compiled into pattern */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_callout_enumerate_block; \ +\ +typedef struct pcre2_substitute_callout_block { \ + uint32_t version; /* Identifies version of block */ \ + /* ------------------------ Version 0 ------------------------------- */ \ + PCRE2_SPTR input; /* Pointer to input subject string */ \ + PCRE2_SPTR output; /* Pointer to output buffer */ \ + PCRE2_SIZE output_offsets[2]; /* Changed portion of the output */ \ + PCRE2_SIZE *ovector; /* Pointer to current ovector */ \ + uint32_t oveccount; /* Count of pairs set in ovector */ \ + uint32_t subscount; /* Substitution number */ \ + /* ------------------------------------------------------------------ */ \ +} pcre2_substitute_callout_block; + + +/* List the generic forms of all other functions in macros, which will be +expanded for each width below. Start with functions that give general +information. */ + +#define PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION pcre2_config(uint32_t, void *); + + +/* Functions for manipulating contexts. */ + +#define PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_copy(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_general_context PCRE2_CALL_CONVENTION \ + *pcre2_general_context_create(void *(*)(PCRE2_SIZE, void *), \ + void (*)(void *, void *), void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_general_context_free(pcre2_general_context *); + +#define PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_copy(pcre2_compile_context *); \ +PCRE2_EXP_DECL pcre2_compile_context PCRE2_CALL_CONVENTION \ + *pcre2_compile_context_create(pcre2_general_context *);\ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_compile_context_free(pcre2_compile_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_bsr(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_character_tables(pcre2_compile_context *, const unsigned char *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_extra_options(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_max_pattern_length(pcre2_compile_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_newline(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_parens_nest_limit(pcre2_compile_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_compile_recursion_guard(pcre2_compile_context *, \ + int (*)(uint32_t, void *), void *); + +#define PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_copy(pcre2_match_context *); \ +PCRE2_EXP_DECL pcre2_match_context PCRE2_CALL_CONVENTION \ + *pcre2_match_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_context_free(pcre2_match_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_callout(pcre2_match_context *, \ + int (*)(pcre2_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_substitute_callout(pcre2_match_context *, \ + int (*)(pcre2_substitute_callout_block *, void *), void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_depth_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_heap_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_match_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_offset_limit(pcre2_match_context *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_limit(pcre2_match_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_recursion_memory_management(pcre2_match_context *, \ + void *(*)(PCRE2_SIZE, void *), void (*)(void *, void *), void *); + +#define PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_copy(pcre2_convert_context *); \ +PCRE2_EXP_DECL pcre2_convert_context PCRE2_CALL_CONVENTION \ + *pcre2_convert_context_create(pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_convert_context_free(pcre2_convert_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_escape(pcre2_convert_context *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_set_glob_separator(pcre2_convert_context *, uint32_t); + + +/* Functions concerned with compiling a pattern to PCRE internal code. */ + +#define PCRE2_COMPILE_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_compile(PCRE2_SPTR, PCRE2_SIZE, uint32_t, int *, PCRE2_SIZE *, \ + pcre2_compile_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_code_free(pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy(const pcre2_code *); \ +PCRE2_EXP_DECL pcre2_code PCRE2_CALL_CONVENTION \ + *pcre2_code_copy_with_tables(const pcre2_code *); + + +/* Functions that give information about a compiled pattern. */ + +#define PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_info(const pcre2_code *, uint32_t, void *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_callout_enumerate(const pcre2_code *, \ + int (*)(pcre2_callout_enumerate_block *, void *), void *); + + +/* Functions for running a match and inspecting the result. */ + +#define PCRE2_MATCH_FUNCTIONS \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create(uint32_t, pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_match_data PCRE2_CALL_CONVENTION \ + *pcre2_match_data_create_from_pattern(const pcre2_code *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_dfa_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, int *, PCRE2_SIZE); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_match_data_free(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SPTR PCRE2_CALL_CONVENTION \ + pcre2_get_mark(pcre2_match_data *); \ +PCRE2_EXP_DECL uint32_t PCRE2_CALL_CONVENTION \ + pcre2_get_ovector_count(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + *pcre2_get_ovector_pointer(pcre2_match_data *); \ +PCRE2_EXP_DECL PCRE2_SIZE PCRE2_CALL_CONVENTION \ + pcre2_get_startchar(pcre2_match_data *); + + +/* Convenience functions for handling matched substrings. */ + +#define PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_copy_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR *, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_free(PCRE2_UCHAR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_get_bynumber(pcre2_match_data *, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_byname(pcre2_match_data *, PCRE2_SPTR, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_length_bynumber(pcre2_match_data *, uint32_t, PCRE2_SIZE *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_nametable_scan(const pcre2_code *, PCRE2_SPTR, PCRE2_SPTR *, \ + PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_number_from_name(const pcre2_code *, PCRE2_SPTR); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_substring_list_free(PCRE2_SPTR *); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substring_list_get(pcre2_match_data *, PCRE2_UCHAR ***, PCRE2_SIZE **); + +/* Functions for serializing / deserializing compiled patterns. */ + +#define PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_encode(const pcre2_code **, int32_t, uint8_t **, \ + PCRE2_SIZE *, pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_decode(pcre2_code **, int32_t, const uint8_t *, \ + pcre2_general_context *); \ +PCRE2_EXP_DECL int32_t PCRE2_CALL_CONVENTION \ + pcre2_serialize_get_number_of_codes(const uint8_t *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_serialize_free(uint8_t *); + + +/* Convenience function for match + substitute. */ + +#define PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_substitute(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *, PCRE2_SPTR, \ + PCRE2_SIZE, PCRE2_UCHAR *, PCRE2_SIZE *); + + +/* Functions for converting pattern source strings. */ + +#define PCRE2_CONVERT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_pattern_convert(PCRE2_SPTR, PCRE2_SIZE, uint32_t, PCRE2_UCHAR **, \ + PCRE2_SIZE *, pcre2_convert_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_converted_pattern_free(PCRE2_UCHAR *); + + +/* Functions for JIT processing */ + +#define PCRE2_JIT_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_compile(pcre2_code *, uint32_t); \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_jit_match(const pcre2_code *, PCRE2_SPTR, PCRE2_SIZE, PCRE2_SIZE, \ + uint32_t, pcre2_match_data *, pcre2_match_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_free_unused_memory(pcre2_general_context *); \ +PCRE2_EXP_DECL pcre2_jit_stack PCRE2_CALL_CONVENTION \ + *pcre2_jit_stack_create(PCRE2_SIZE, PCRE2_SIZE, pcre2_general_context *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_assign(pcre2_match_context *, pcre2_jit_callback, void *); \ +PCRE2_EXP_DECL void PCRE2_CALL_CONVENTION \ + pcre2_jit_stack_free(pcre2_jit_stack *); + + +/* Other miscellaneous functions. */ + +#define PCRE2_OTHER_FUNCTIONS \ +PCRE2_EXP_DECL int PCRE2_CALL_CONVENTION \ + pcre2_get_error_message(int, PCRE2_UCHAR *, PCRE2_SIZE); \ +PCRE2_EXP_DECL const uint8_t PCRE2_CALL_CONVENTION \ + *pcre2_maketables(pcre2_general_context *); \ + + +/* Define macros that generate width-specific names from generic versions. The +three-level macro scheme is necessary to get the macros expanded when we want +them to be. First we get the width from PCRE2_LOCAL_WIDTH, which is used for +generating three versions of everything below. After that, PCRE2_SUFFIX will be +re-defined to use PCRE2_CODE_UNIT_WIDTH, for use when macros such as +pcre2_compile are called by application code. */ + +#define PCRE2_JOIN(a,b) a ## b +#define PCRE2_GLUE(a,b) PCRE2_JOIN(a,b) +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a,PCRE2_LOCAL_WIDTH) + + +/* Data types */ + +#define PCRE2_UCHAR PCRE2_SUFFIX(PCRE2_UCHAR) +#define PCRE2_SPTR PCRE2_SUFFIX(PCRE2_SPTR) + +#define pcre2_code PCRE2_SUFFIX(pcre2_code_) +#define pcre2_jit_callback PCRE2_SUFFIX(pcre2_jit_callback_) +#define pcre2_jit_stack PCRE2_SUFFIX(pcre2_jit_stack_) + +#define pcre2_real_code PCRE2_SUFFIX(pcre2_real_code_) +#define pcre2_real_general_context PCRE2_SUFFIX(pcre2_real_general_context_) +#define pcre2_real_compile_context PCRE2_SUFFIX(pcre2_real_compile_context_) +#define pcre2_real_convert_context PCRE2_SUFFIX(pcre2_real_convert_context_) +#define pcre2_real_match_context PCRE2_SUFFIX(pcre2_real_match_context_) +#define pcre2_real_jit_stack PCRE2_SUFFIX(pcre2_real_jit_stack_) +#define pcre2_real_match_data PCRE2_SUFFIX(pcre2_real_match_data_) + + +/* Data blocks */ + +#define pcre2_callout_block PCRE2_SUFFIX(pcre2_callout_block_) +#define pcre2_callout_enumerate_block PCRE2_SUFFIX(pcre2_callout_enumerate_block_) +#define pcre2_substitute_callout_block PCRE2_SUFFIX(pcre2_substitute_callout_block_) +#define pcre2_general_context PCRE2_SUFFIX(pcre2_general_context_) +#define pcre2_compile_context PCRE2_SUFFIX(pcre2_compile_context_) +#define pcre2_convert_context PCRE2_SUFFIX(pcre2_convert_context_) +#define pcre2_match_context PCRE2_SUFFIX(pcre2_match_context_) +#define pcre2_match_data PCRE2_SUFFIX(pcre2_match_data_) + + +/* Functions: the complete list in alphabetical order */ + +#define pcre2_callout_enumerate PCRE2_SUFFIX(pcre2_callout_enumerate_) +#define pcre2_code_copy PCRE2_SUFFIX(pcre2_code_copy_) +#define pcre2_code_copy_with_tables PCRE2_SUFFIX(pcre2_code_copy_with_tables_) +#define pcre2_code_free PCRE2_SUFFIX(pcre2_code_free_) +#define pcre2_compile PCRE2_SUFFIX(pcre2_compile_) +#define pcre2_compile_context_copy PCRE2_SUFFIX(pcre2_compile_context_copy_) +#define pcre2_compile_context_create PCRE2_SUFFIX(pcre2_compile_context_create_) +#define pcre2_compile_context_free PCRE2_SUFFIX(pcre2_compile_context_free_) +#define pcre2_config PCRE2_SUFFIX(pcre2_config_) +#define pcre2_convert_context_copy PCRE2_SUFFIX(pcre2_convert_context_copy_) +#define pcre2_convert_context_create PCRE2_SUFFIX(pcre2_convert_context_create_) +#define pcre2_convert_context_free PCRE2_SUFFIX(pcre2_convert_context_free_) +#define pcre2_converted_pattern_free PCRE2_SUFFIX(pcre2_converted_pattern_free_) +#define pcre2_dfa_match PCRE2_SUFFIX(pcre2_dfa_match_) +#define pcre2_general_context_copy PCRE2_SUFFIX(pcre2_general_context_copy_) +#define pcre2_general_context_create PCRE2_SUFFIX(pcre2_general_context_create_) +#define pcre2_general_context_free PCRE2_SUFFIX(pcre2_general_context_free_) +#define pcre2_get_error_message PCRE2_SUFFIX(pcre2_get_error_message_) +#define pcre2_get_mark PCRE2_SUFFIX(pcre2_get_mark_) +#define pcre2_get_ovector_pointer PCRE2_SUFFIX(pcre2_get_ovector_pointer_) +#define pcre2_get_ovector_count PCRE2_SUFFIX(pcre2_get_ovector_count_) +#define pcre2_get_startchar PCRE2_SUFFIX(pcre2_get_startchar_) +#define pcre2_jit_compile PCRE2_SUFFIX(pcre2_jit_compile_) +#define pcre2_jit_match PCRE2_SUFFIX(pcre2_jit_match_) +#define pcre2_jit_free_unused_memory PCRE2_SUFFIX(pcre2_jit_free_unused_memory_) +#define pcre2_jit_stack_assign PCRE2_SUFFIX(pcre2_jit_stack_assign_) +#define pcre2_jit_stack_create PCRE2_SUFFIX(pcre2_jit_stack_create_) +#define pcre2_jit_stack_free PCRE2_SUFFIX(pcre2_jit_stack_free_) +#define pcre2_maketables PCRE2_SUFFIX(pcre2_maketables_) +#define pcre2_match PCRE2_SUFFIX(pcre2_match_) +#define pcre2_match_context_copy PCRE2_SUFFIX(pcre2_match_context_copy_) +#define pcre2_match_context_create PCRE2_SUFFIX(pcre2_match_context_create_) +#define pcre2_match_context_free PCRE2_SUFFIX(pcre2_match_context_free_) +#define pcre2_match_data_create PCRE2_SUFFIX(pcre2_match_data_create_) +#define pcre2_match_data_create_from_pattern PCRE2_SUFFIX(pcre2_match_data_create_from_pattern_) +#define pcre2_match_data_free PCRE2_SUFFIX(pcre2_match_data_free_) +#define pcre2_pattern_convert PCRE2_SUFFIX(pcre2_pattern_convert_) +#define pcre2_pattern_info PCRE2_SUFFIX(pcre2_pattern_info_) +#define pcre2_serialize_decode PCRE2_SUFFIX(pcre2_serialize_decode_) +#define pcre2_serialize_encode PCRE2_SUFFIX(pcre2_serialize_encode_) +#define pcre2_serialize_free PCRE2_SUFFIX(pcre2_serialize_free_) +#define pcre2_serialize_get_number_of_codes PCRE2_SUFFIX(pcre2_serialize_get_number_of_codes_) +#define pcre2_set_bsr PCRE2_SUFFIX(pcre2_set_bsr_) +#define pcre2_set_callout PCRE2_SUFFIX(pcre2_set_callout_) +#define pcre2_set_character_tables PCRE2_SUFFIX(pcre2_set_character_tables_) +#define pcre2_set_compile_extra_options PCRE2_SUFFIX(pcre2_set_compile_extra_options_) +#define pcre2_set_compile_recursion_guard PCRE2_SUFFIX(pcre2_set_compile_recursion_guard_) +#define pcre2_set_depth_limit PCRE2_SUFFIX(pcre2_set_depth_limit_) +#define pcre2_set_glob_escape PCRE2_SUFFIX(pcre2_set_glob_escape_) +#define pcre2_set_glob_separator PCRE2_SUFFIX(pcre2_set_glob_separator_) +#define pcre2_set_heap_limit PCRE2_SUFFIX(pcre2_set_heap_limit_) +#define pcre2_set_match_limit PCRE2_SUFFIX(pcre2_set_match_limit_) +#define pcre2_set_max_pattern_length PCRE2_SUFFIX(pcre2_set_max_pattern_length_) +#define pcre2_set_newline PCRE2_SUFFIX(pcre2_set_newline_) +#define pcre2_set_parens_nest_limit PCRE2_SUFFIX(pcre2_set_parens_nest_limit_) +#define pcre2_set_offset_limit PCRE2_SUFFIX(pcre2_set_offset_limit_) +#define pcre2_set_substitute_callout PCRE2_SUFFIX(pcre2_set_substitute_callout_) +#define pcre2_substitute PCRE2_SUFFIX(pcre2_substitute_) +#define pcre2_substring_copy_byname PCRE2_SUFFIX(pcre2_substring_copy_byname_) +#define pcre2_substring_copy_bynumber PCRE2_SUFFIX(pcre2_substring_copy_bynumber_) +#define pcre2_substring_free PCRE2_SUFFIX(pcre2_substring_free_) +#define pcre2_substring_get_byname PCRE2_SUFFIX(pcre2_substring_get_byname_) +#define pcre2_substring_get_bynumber PCRE2_SUFFIX(pcre2_substring_get_bynumber_) +#define pcre2_substring_length_byname PCRE2_SUFFIX(pcre2_substring_length_byname_) +#define pcre2_substring_length_bynumber PCRE2_SUFFIX(pcre2_substring_length_bynumber_) +#define pcre2_substring_list_get PCRE2_SUFFIX(pcre2_substring_list_get_) +#define pcre2_substring_list_free PCRE2_SUFFIX(pcre2_substring_list_free_) +#define pcre2_substring_nametable_scan PCRE2_SUFFIX(pcre2_substring_nametable_scan_) +#define pcre2_substring_number_from_name PCRE2_SUFFIX(pcre2_substring_number_from_name_) + +/* Keep this old function name for backwards compatibility */ +#define pcre2_set_recursion_limit PCRE2_SUFFIX(pcre2_set_recursion_limit_) + +/* Keep this obsolete function for backwards compatibility: it is now a noop. */ +#define pcre2_set_recursion_memory_management PCRE2_SUFFIX(pcre2_set_recursion_memory_management_) + +/* Now generate all three sets of width-specific structures and function +prototypes. */ + +#define PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS \ +PCRE2_TYPES_LIST \ +PCRE2_STRUCTURE_LIST \ +PCRE2_GENERAL_INFO_FUNCTIONS \ +PCRE2_GENERAL_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_CONTEXT_FUNCTIONS \ +PCRE2_CONVERT_FUNCTIONS \ +PCRE2_MATCH_CONTEXT_FUNCTIONS \ +PCRE2_COMPILE_FUNCTIONS \ +PCRE2_PATTERN_INFO_FUNCTIONS \ +PCRE2_MATCH_FUNCTIONS \ +PCRE2_SUBSTRING_FUNCTIONS \ +PCRE2_SERIALIZE_FUNCTIONS \ +PCRE2_SUBSTITUTE_FUNCTION \ +PCRE2_JIT_FUNCTIONS \ +PCRE2_OTHER_FUNCTIONS + +#define PCRE2_LOCAL_WIDTH 8 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 16 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +#define PCRE2_LOCAL_WIDTH 32 +PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS +#undef PCRE2_LOCAL_WIDTH + +/* Undefine the list macros; they are no longer needed. */ + +#undef PCRE2_TYPES_LIST +#undef PCRE2_STRUCTURE_LIST +#undef PCRE2_GENERAL_INFO_FUNCTIONS +#undef PCRE2_GENERAL_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_CONTEXT_FUNCTIONS +#undef PCRE2_CONVERT_CONTEXT_FUNCTIONS +#undef PCRE2_MATCH_CONTEXT_FUNCTIONS +#undef PCRE2_COMPILE_FUNCTIONS +#undef PCRE2_PATTERN_INFO_FUNCTIONS +#undef PCRE2_MATCH_FUNCTIONS +#undef PCRE2_SUBSTRING_FUNCTIONS +#undef PCRE2_SERIALIZE_FUNCTIONS +#undef PCRE2_SUBSTITUTE_FUNCTION +#undef PCRE2_JIT_FUNCTIONS +#undef PCRE2_OTHER_FUNCTIONS +#undef PCRE2_TYPES_STRUCTURES_AND_FUNCTIONS + +/* PCRE2_CODE_UNIT_WIDTH must be defined. If it is 8, 16, or 32, redefine +PCRE2_SUFFIX to use it. If it is 0, undefine the other macros and make +PCRE2_SUFFIX a no-op. Otherwise, generate an error. */ + +#undef PCRE2_SUFFIX +#ifndef PCRE2_CODE_UNIT_WIDTH +#error PCRE2_CODE_UNIT_WIDTH must be defined before including pcre2.h. +#error Use 8, 16, or 32; or 0 for a multi-width application. +#else /* PCRE2_CODE_UNIT_WIDTH is defined */ +#if PCRE2_CODE_UNIT_WIDTH == 8 || \ + PCRE2_CODE_UNIT_WIDTH == 16 || \ + PCRE2_CODE_UNIT_WIDTH == 32 +#define PCRE2_SUFFIX(a) PCRE2_GLUE(a, PCRE2_CODE_UNIT_WIDTH) +#elif PCRE2_CODE_UNIT_WIDTH == 0 +#undef PCRE2_JOIN +#undef PCRE2_GLUE +#define PCRE2_SUFFIX(a) a +#else +#error PCRE2_CODE_UNIT_WIDTH must be 0, 8, 16, or 32. +#endif +#endif /* PCRE2_CODE_UNIT_WIDTH is defined */ + +#ifdef __cplusplus +} /* extern "C" */ +#endif + +#endif /* PCRE2_H_IDEMPOTENT_GUARD */ + +/* End of pcre2.h */ diff --git a/csrc/rex_pcre2/pcre2/osx64/pcre2_chartables.c b/csrc/rex_pcre2/pcre2/osx64/pcre2_chartables.c new file mode 100644 index 0000000..0e07edb --- /dev/null +++ b/csrc/rex_pcre2/pcre2/osx64/pcre2_chartables.c @@ -0,0 +1,198 @@ +/************************************************* +* Perl-Compatible Regular Expressions * +*************************************************/ + +/* This file was automatically written by the dftables auxiliary +program. It contains character tables that are used when no external +tables are passed to PCRE2 by the application that calls it. The tables +are used only for characters whose code values are less than 256. */ + +/*The dftables program (which is distributed with PCRE2) can be used to +build alternative versions of this file. This is necessary if you are +running in an EBCDIC environment, or if you want to default to a different +encoding, for example ISO-8859-1. When dftables is run, it creates these +tables in the current locale. This happens automatically if PCRE2 is +configured with --enable-rebuild-chartables. */ + +/* The following #include is present because without it gcc 4.x may remove +the array definition from the final binary if PCRE2 is built into a static +library and dead code stripping is activated. This leads to link errors. +Pulling in the header ensures that the array gets flagged as "someone +outside this compilation unit might reference this" and so it will always +be supplied to the linker. */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "pcre2_internal.h" + +const uint8_t PRIV(default_tables)[] = { + +/* This table is a lower casing table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table is a case flipping table. */ + + 0, 1, 2, 3, 4, 5, 6, 7, + 8, 9, 10, 11, 12, 13, 14, 15, + 16, 17, 18, 19, 20, 21, 22, 23, + 24, 25, 26, 27, 28, 29, 30, 31, + 32, 33, 34, 35, 36, 37, 38, 39, + 40, 41, 42, 43, 44, 45, 46, 47, + 48, 49, 50, 51, 52, 53, 54, 55, + 56, 57, 58, 59, 60, 61, 62, 63, + 64, 97, 98, 99,100,101,102,103, + 104,105,106,107,108,109,110,111, + 112,113,114,115,116,117,118,119, + 120,121,122, 91, 92, 93, 94, 95, + 96, 65, 66, 67, 68, 69, 70, 71, + 72, 73, 74, 75, 76, 77, 78, 79, + 80, 81, 82, 83, 84, 85, 86, 87, + 88, 89, 90,123,124,125,126,127, + 128,129,130,131,132,133,134,135, + 136,137,138,139,140,141,142,143, + 144,145,146,147,148,149,150,151, + 152,153,154,155,156,157,158,159, + 160,161,162,163,164,165,166,167, + 168,169,170,171,172,173,174,175, + 176,177,178,179,180,181,182,183, + 184,185,186,187,188,189,190,191, + 192,193,194,195,196,197,198,199, + 200,201,202,203,204,205,206,207, + 208,209,210,211,212,213,214,215, + 216,217,218,219,220,221,222,223, + 224,225,226,227,228,229,230,231, + 232,233,234,235,236,237,238,239, + 240,241,242,243,244,245,246,247, + 248,249,250,251,252,253,254,255, + +/* This table contains bit maps for various character classes. Each map is 32 +bytes long and the bits run from the least significant end of each byte. The +classes that have their own maps are: space, xdigit, digit, upper, lower, word, +graph print, punct, and cntrl. Other classes are built from combinations. */ + + 0x00,0x3e,0x00,0x00,0x01,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x7e,0x00,0x00,0x00,0x7e,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0xfe,0xff,0xff,0x07,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, + 0xfe,0xff,0xff,0x87,0xfe,0xff,0xff,0x07, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xff,0xff,0xff,0xff, + 0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0x00,0x00,0x00,0x00,0xfe,0xff,0x00,0xfc, + 0x01,0x00,0x00,0xf8,0x01,0x00,0x00,0x78, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + + 0xff,0xff,0xff,0xff,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, + +/* This table identifies various classes of character by individual bits: + 0x01 white space character + 0x02 letter + 0x04 lower case letter + 0x08 decimal digit + 0x10 alphanumeric or '_' +*/ + + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 */ + 0x00,0x01,0x01,0x01,0x01,0x01,0x00,0x00, /* 8- 15 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */ + 0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - ' */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ( - / */ + 0x18,0x18,0x18,0x18,0x18,0x18,0x18,0x18, /* 0 - 7 */ + 0x18,0x18,0x00,0x00,0x00,0x00,0x00,0x00, /* 8 - ? */ + 0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* @ - G */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* H - O */ + 0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* P - W */ + 0x12,0x12,0x12,0x00,0x00,0x00,0x00,0x10, /* X - _ */ + 0x00,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* ` - g */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* h - o */ + 0x16,0x16,0x16,0x16,0x16,0x16,0x16,0x16, /* p - w */ + 0x16,0x16,0x16,0x00,0x00,0x00,0x00,0x00, /* x -127 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */ + 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */ + +/* End of pcre2_chartables.c */ diff --git a/src/algo.h b/csrc/rex_pcre2/src/algo.h similarity index 97% rename from src/algo.h rename to csrc/rex_pcre2/src/algo.h index 800fd31..8e24cf0 100644 --- a/src/algo.h +++ b/csrc/rex_pcre2/src/algo.h @@ -56,7 +56,7 @@ static int OptLimit (lua_State *L, int pos) { static int get_startoffset(lua_State *L, int stackpos, size_t len) { - int startoffset = (int)luaL_optinteger(L, stackpos, 1); + int startoffset = luaL_optint(L, stackpos, 1); if(startoffset > 0) startoffset--; else if(startoffset < 0) { @@ -155,7 +155,7 @@ static void checkarg_gsub (lua_State *L, TArgComp *argC, TArgExec *argE) { argE->funcpos2 = 4; argE->maxmatch = OptLimit (L, 4); argC->cflags = ALG_GETCFLAGS (L, 5); - argE->eflags = (int)luaL_optinteger (L, 6, ALG_EFLAGS_DFLT); + argE->eflags = luaL_optint (L, 6, ALG_EFLAGS_DFLT); ALG_GETCARGS (L, 7, argC); } @@ -165,7 +165,7 @@ static void checkarg_count (lua_State *L, TArgComp *argC, TArgExec *argE) { check_subject (L, 1, argE); check_pattern (L, 2, argC); argC->cflags = ALG_GETCFLAGS (L, 3); - argE->eflags = (int)luaL_optinteger (L, 4, ALG_EFLAGS_DFLT); + argE->eflags = luaL_optint (L, 4, ALG_EFLAGS_DFLT); ALG_GETCARGS (L, 5, argC); } @@ -177,7 +177,7 @@ static void checkarg_find_func (lua_State *L, TArgComp *argC, TArgExec *argE) { check_pattern (L, 2, argC); argE->startoffset = get_startoffset (L, 3, argE->textlen); argC->cflags = ALG_GETCFLAGS (L, 4); - argE->eflags = (int)luaL_optinteger (L, 5, ALG_EFLAGS_DFLT); + argE->eflags = luaL_optint (L, 5, ALG_EFLAGS_DFLT); ALG_GETCARGS (L, 6, argC); } @@ -188,7 +188,7 @@ static void checkarg_gmatch_split (lua_State *L, TArgComp *argC, TArgExec *argE) check_subject (L, 1, argE); check_pattern (L, 2, argC); argC->cflags = ALG_GETCFLAGS (L, 3); - argE->eflags = (int)luaL_optinteger (L, 4, ALG_EFLAGS_DFLT); + argE->eflags = luaL_optint (L, 4, ALG_EFLAGS_DFLT); ALG_GETCARGS (L, 5, argC); } @@ -201,7 +201,7 @@ static void checkarg_find_method (lua_State *L, TArgExec *argE, TUserdata **ud) *ud = check_ud (L); check_subject (L, 2, argE); argE->startoffset = get_startoffset (L, 3, argE->textlen); - argE->eflags = (int)luaL_optinteger (L, 4, ALG_EFLAGS_DFLT); + argE->eflags = luaL_optint (L, 4, ALG_EFLAGS_DFLT); } @@ -241,16 +241,16 @@ static int algf_gsub (lua_State *L) { freelist_init (&freelist); /*------------------------------------------------------------------*/ if (argE.reptype == LUA_TSTRING) { - buffer_init (&BufRep, 256, L, &freelist); + buffer_init_rex (&BufRep, 256, L, &freelist); BUFFERZ_PUTREPSTRING (&BufRep, argE.funcpos, ALG_NSUB(ud)); } /*------------------------------------------------------------------*/ if (argE.maxmatch == GSUB_CONDITIONAL) { - buffer_init (&BufTemp, 1024, L, &freelist); + buffer_init_rex (&BufTemp, 1024, L, &freelist); pBuf = &BufTemp; } /*------------------------------------------------------------------*/ - buffer_init (&BufOut, 1024, L, &freelist); + buffer_init_rex (&BufOut, 1024, L, &freelist); while ((argE.maxmatch < 0 || n_match < argE.maxmatch) && st <= (int)argE.textlen) { int from, to, res; int curr_subst = 0; diff --git a/src/common.c b/csrc/rex_pcre2/src/common.c similarity index 99% rename from src/common.c rename to csrc/rex_pcre2/src/common.c index d878627..7c5f299 100644 --- a/src/common.c +++ b/csrc/rex_pcre2/src/common.c @@ -125,7 +125,7 @@ void freelist_free (TFreeList *fl) { enum { ID_NUMBER, ID_STRING }; -void buffer_init (TBuffer *buf, size_t sz, lua_State *L, TFreeList *fl) { +void buffer_init_rex (TBuffer *buf, size_t sz, lua_State *L, TFreeList *fl) { buf->arr = (char*) Lmalloc(L, sz); if (!buf->arr) { freelist_free (fl); diff --git a/src/common.h b/csrc/rex_pcre2/src/common.h similarity index 97% rename from src/common.h rename to csrc/rex_pcre2/src/common.h index 41d968e..8157237 100644 --- a/src/common.h +++ b/csrc/rex_pcre2/src/common.h @@ -75,7 +75,7 @@ void freelist_init (TFreeList *fl); void freelist_add (TFreeList *fl, TBuffer *buf); void freelist_free (TFreeList *fl); -void buffer_init (TBuffer *buf, size_t sz, lua_State *L, TFreeList *fl); +void buffer_init_rex (TBuffer *buf, size_t sz, lua_State *L, TFreeList *fl); void buffer_free (TBuffer *buf); void buffer_clear (TBuffer *buf); void buffer_addbuffer (TBuffer *trg, TBuffer *src); diff --git a/src/pcre2/lpcre2.c b/csrc/rex_pcre2/src/pcre2/lpcre2.c similarity index 95% rename from src/pcre2/lpcre2.c rename to csrc/rex_pcre2/src/pcre2/lpcre2.c index eba529c..ac055b9 100644 --- a/src/pcre2/lpcre2.c +++ b/csrc/rex_pcre2/src/pcre2/lpcre2.c @@ -6,6 +6,7 @@ #include #include #include +#include #include #include "lua.h" @@ -136,9 +137,9 @@ static void checkarg_dfa_exec (lua_State *L, TArgExec *argE, TPcre2 **ud) { *ud = check_ud (L); argE->text = luaL_checklstring (L, 2, &argE->textlen); argE->startoffset = get_startoffset (L, 3, argE->textlen); - argE->eflags = (int)luaL_optinteger (L, 4, ALG_EFLAGS_DFLT); - argE->ovecsize = (size_t)luaL_optinteger (L, 5, 100); - argE->wscount = (size_t)luaL_optinteger (L, 6, 50); + argE->eflags = luaL_optint (L, 4, ALG_EFLAGS_DFLT); + argE->ovecsize = luaL_optint (L, 5, 100); + argE->wscount = luaL_optint (L, 6, 50); } static void push_chartables_meta (lua_State *L) { @@ -377,7 +378,7 @@ static int Lpcre2_version (lua_State *L) { //### TODO: write tests for this method. static int Lpcre2_jit_compile (lua_State *L) { TPcre2 *ud = check_ud (L); - uint32_t options = (uint32_t) luaL_optinteger (L, 2, PCRE2_JIT_COMPLETE); + uint32_t options = (uint32_t) luaL_optint (L, 2, PCRE2_JIT_COMPLETE); int errcode = pcre2_jit_compile (ud->pr, options); if (errcode == 0) { lua_pushboolean(L, 1); diff --git a/src/pcre2/lpcre2_f.c b/csrc/rex_pcre2/src/pcre2/lpcre2_f.c similarity index 99% rename from src/pcre2/lpcre2_f.c rename to csrc/rex_pcre2/src/pcre2/lpcre2_f.c index d326c5c..fca3f81 100644 --- a/src/pcre2/lpcre2_f.c +++ b/csrc/rex_pcre2/src/pcre2/lpcre2_f.c @@ -1,6 +1,7 @@ /* lpcre2_f.c - Lua binding of PCRE2 library */ /* See Copyright Notice in the file LICENSE */ +#include #include #include "lua.h" #include "lauxlib.h" diff --git a/doc/.gitignore b/doc/.gitignore deleted file mode 100755 index cf8dde6..0000000 --- a/doc/.gitignore +++ /dev/null @@ -1,3 +0,0 @@ -index.txt -index.html -manual.html diff --git a/doc/SciTE.properties b/doc/SciTE.properties deleted file mode 100644 index ea14e76..0000000 --- a/doc/SciTE.properties +++ /dev/null @@ -1,4 +0,0 @@ -eol.mode=LF - -command.compile.*.txt=make -B $(FileName).html -command.build.*.txt=make diff --git a/doc/html4css1.css b/doc/html4css1.css deleted file mode 100644 index 5e1c216..0000000 --- a/doc/html4css1.css +++ /dev/null @@ -1,279 +0,0 @@ -/* -:Author: David Goodger -:Contact: goodger@users.sourceforge.net -:Date: $Date: 2006/01/21 03:17:49 $ -:Revision: $Revision: 1.1 $ -:Copyright: This stylesheet has been placed in the public domain. - -Default cascading style sheet for the HTML output of Docutils. - -See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to -customize this style sheet. -*/ - -/* used to remove borders from tables and images */ -.borderless, table.borderless td, table.borderless th { - border: 0 } - -table.borderless td, table.borderless th { - /* Override padding for "table.docutils td" with "! important". - The right padding separates the table cells. */ - padding: 0 0.5em 0 0 ! important } - -.first { - /* Override more specific margin styles with "! important". */ - margin-top: 0 ! important } - -.last, .with-subtitle { - margin-bottom: 0 ! important } - -.hidden { - display: none } - -a.toc-backref { - text-decoration: none ; - color: black } - -blockquote.epigraph { - margin: 2em 5em ; } - -dl.docutils dd { - margin-bottom: 0.5em } - -/* Uncomment (and remove this text!) to get bold-faced definition list terms -dl.docutils dt { - font-weight: bold } -*/ - -div.abstract { - margin: 2em 5em } - -div.abstract p.topic-title { - font-weight: bold ; - text-align: center } - -div.admonition, div.attention, div.caution, div.danger, div.error, -div.hint, div.important, div.note, div.tip, div.warning { - margin: 2em ; - border: medium outset ; - padding: 1em } - -div.admonition p.admonition-title, div.hint p.admonition-title, -div.important p.admonition-title, div.note p.admonition-title, -div.tip p.admonition-title { - font-weight: bold ; - font-family: sans-serif } - -div.attention p.admonition-title, div.caution p.admonition-title, -div.danger p.admonition-title, div.error p.admonition-title, -div.warning p.admonition-title { - color: red ; - font-weight: bold ; - font-family: sans-serif } - -/* Uncomment (and remove this text!) to get reduced vertical space in - compound paragraphs. -div.compound .compound-first, div.compound .compound-middle { - margin-bottom: 0.5em } - -div.compound .compound-last, div.compound .compound-middle { - margin-top: 0.5em } -*/ - -div.dedication { - margin: 2em 5em ; - text-align: center ; - font-style: italic } - -div.dedication p.topic-title { - font-weight: bold ; - font-style: normal } - -div.figure { - margin-left: 2em ; - margin-right: 2em } - -div.footer, div.header { - clear: both; - font-size: smaller } - -div.line-block { - display: block ; - margin-top: 1em ; - margin-bottom: 1em } - -div.line-block div.line-block { - margin-top: 0 ; - margin-bottom: 0 ; - margin-left: 1.5em } - -div.sidebar { - margin-left: 1em ; - border: medium outset ; - padding: 1em ; - background-color: #ffffee ; - width: 40% ; - float: right ; - clear: right } - -div.sidebar p.rubric { - font-family: sans-serif ; - font-size: medium } - -div.system-messages { - margin: 5em } - -div.system-messages h1 { - color: red } - -div.system-message { - border: medium outset ; - padding: 1em } - -div.system-message p.system-message-title { - color: red ; - font-weight: bold } - -div.topic { - margin: 2em } - -h1.section-subtitle, h2.section-subtitle, h3.section-subtitle, -h4.section-subtitle, h5.section-subtitle, h6.section-subtitle { - margin-top: 0.4em } - -h1.title { - text-align: center } - -h2.subtitle { - text-align: center } - -hr.docutils { - width: 75% } - -img.align-left { - clear: left } - -img.align-right { - clear: right } - -ol.simple, ul.simple { - margin-bottom: 1em } - -ol.arabic { - list-style: decimal } - -ol.loweralpha { - list-style: lower-alpha } - -ol.upperalpha { - list-style: upper-alpha } - -ol.lowerroman { - list-style: lower-roman } - -ol.upperroman { - list-style: upper-roman } - -p.attribution { - text-align: right ; - margin-left: 50% } - -p.caption { - font-style: italic } - -p.credits { - font-style: italic ; - font-size: smaller } - -p.label { - white-space: nowrap } - -p.rubric { - font-weight: bold ; - font-size: larger ; - color: maroon ; - text-align: center } - -p.sidebar-title { - font-family: sans-serif ; - font-weight: bold ; - font-size: larger } - -p.sidebar-subtitle { - font-family: sans-serif ; - font-weight: bold } - -p.topic-title { - font-weight: bold } - -pre.address { - margin-bottom: 0 ; - margin-top: 0 ; - font-family: serif ; - font-size: 100% } - -pre.literal-block, pre.doctest-block { - margin-left: 2em ; - margin-right: 2em ; - background-color: #eeeeee } - -span.classifier { - font-family: sans-serif ; - font-style: oblique } - -span.classifier-delimiter { - font-family: sans-serif ; - font-weight: bold } - -span.interpreted { - font-family: sans-serif } - -span.option { - white-space: nowrap } - -span.pre { - white-space: pre } - -span.problematic { - color: red } - -span.section-subtitle { - /* font-size relative to parent (h1..h6 element) */ - font-size: 80% } - -table.citation { - border-left: solid 1px gray; - margin-left: 1px } - -table.docinfo { - margin: 2em 4em } - -table.docutils { - margin-top: 0.5em ; - margin-bottom: 0.5em } - -table.footnote { - border-left: solid 1px black; - margin-left: 1px } - -table.docutils td, table.docutils th, -table.docinfo td, table.docinfo th { - padding-left: 0.5em ; - padding-right: 0.5em ; - vertical-align: top } - -table.docutils th.field-name, table.docinfo th.docinfo-name { - font-weight: bold ; - text-align: left ; - white-space: nowrap ; - padding-left: 0 } - -h1 tt.docutils, h2 tt.docutils, h3 tt.docutils, -h4 tt.docutils, h5 tt.docutils, h6 tt.docutils { - font-size: 100% } - -tt.docutils { - background-color: #eeeeee } - -ul.auto-toc { - list-style-type: none } diff --git a/doc/license.html b/doc/license.html deleted file mode 100644 index 13b4595..0000000 --- a/doc/license.html +++ /dev/null @@ -1,20 +0,0 @@ - - - -Lrexlib: The License - - - -

Lrexlib

-

Copyright © Reuben Thomas 2000-2020
-Copyright © Shmuel Zeigerman 2004-2020 - -

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: - -

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. - -

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - - - - diff --git a/doc/lrexlib.css b/doc/lrexlib.css deleted file mode 100644 index 98f7565..0000000 --- a/doc/lrexlib.css +++ /dev/null @@ -1,33 +0,0 @@ -/* -:Author: Shmuel Zeigerman -:Contact: shmuz at actcom co il -:Copyright: This stylesheet has been placed in the public domain. - -[Optionally place a description here.] -*/ - -@import url(html4css1.css); - -hr.docutils { - width: 100% -} - -.funcdef { - font-weight: bold ; - font-size: 100% -} - -body { - margin-left: 1em ; - margin-right: 1em ; - font-family: "Verdana", sans-serif ; -} - -table { - border-spacing: 0; -} - -tr { - margin: 0; - padding: 0; -} diff --git a/doc/manual.txt b/doc/manual.txt deleted file mode 100644 index 545372c..0000000 --- a/doc/manual.txt +++ /dev/null @@ -1,1073 +0,0 @@ -.. role:: funcdef(literal) - -Lrexlib Reference Manual -======================== - -.. contents:: Table of Contents - ------------------------------------------------------------- - -**Lrexlib** builds into shared libraries called by default *rex_posix.so*, -*rex_pcre.so*, *rex_pcre2.so*, *rex_gnu.so*, *rex_tre.so* and *rex_onig.so*, -which can be used with *require*. - ------------------------------------------------------------- - -Notes -~~~~~ - -1. Most functions and methods in Lrexlib have mandatory and optional arguments. - There are no dependencies between arguments in Lrexlib's functions and - methods. Any optional argument can be supplied as ``nil`` (or omitted if it - is a trailing argument), the library will then use the default value for that - argument. - -2. This document uses the following syntax for optional arguments: they are - bracketed separately, and commas are left outside brackets, e.g.:: - - MyFunc (arg1, arg2, [arg3], [arg4]) - -3. Throughout this document (unless it causes ambiguity), the identifier **rex** - is used in place of either *rex_posix*, *rex_pcre*, *rex_pcre2*, *rex_gnu*, - *rex_onig* or *rex_tre*, which are the default namespaces for the corresponding - libraries. - -4. All functions that take a regular expression pattern as an argument will - generate an error if that pattern is found invalid by the regex library. - -5. All functions that take a string-type regex argument accept a compiled regex - too. In this case, the cf_ and larg_ arguments are ignored (should - be either supplied as nils or omitted). - -6. All functions that take a string-type subject accept a table or userdata that - has a ``topointer`` method and ``__len`` metamethod, and take the subject to - be a block of memory starting at the address returned by - ``subject:topointer()`` and of length ``#subject``. This works with buffers - objects from the alien library (https://github.com/mascarenhas/alien). Note - that special attention is needed with POSIX regex libraries that do not - support ``REG_STARTEND``, and hence need NUL-terminated subjects: the NUL is - not included in the string length, so alien buffers must be wrapped to report - a length that excludes the NUL. - -.. _cf: - -7. The default value for *compilation flags* (*cf*) that Lrexlib uses when - the parameter is not supplied or ``nil`` is: - - * ``REG_EXTENDED`` for POSIX and TRE - * ``0`` for PCRE and PCRE2 - * ``ONIG_OPTION_NONE`` for Oniguruma - * ``SYNTAX_POSIX_EXTENDED`` for GNU - - **PCRE**, **PCRE2**, **Oniguruma**: *cf* may also be supplied as a string, - whose characters stand for compilation flags. Combinations of the following - characters (case sensitive) are supported: - - =============== ================== ================== ============================== - **Character** **PCRE flag** **PCRE2 flag** **Oniguruma flag** - =============== ================== ================== ============================== - **i** PCRE_CASELESS PCRE2_CASELESS ONIG_OPTION_IGNORECASE - **m** PCRE_MULTILINE PCRE2_MULTILINE ONIG_OPTION_NEGATE_SINGLELINE - **s** PCRE_DOTALL PCRE2_DOTALL ONIG_OPTION_MULTILINE - **x** PCRE_EXTENDED PCRE2_EXTENDED ONIG_OPTION_EXTEND - **U** PCRE_UNGREEDY PCRE2_UNGREEDY n/a - **X** PCRE_EXTRA n/a n/a - =============== ================== ================== ============================== - -.. _ef: - -8. The default value for *execution flags* (*ef*) that Lrexlib uses when - the parameter is not supplied or ``nil``, is: - - * ``0`` for standard POSIX regex library - * ``REG_STARTEND`` for those POSIX regex libraries that support it, e.g. Spencer's - * ``0`` for PCRE, PCRE2, Oniguruma and TRE - -.. _larg: - -9. The notation *larg...* is used to indicate optional library-specific - arguments, which are documented in the ``new`` method of each library. - -10. In the functions searching for multiple matches (``gmatch``, ``gsub``, - ``split``, ``count``) every empty match adjacent to the previous match - is discarded, e.g. ``rex.count("abc",".*")`` will return 1. - ------------------------------------------------------------- - -Functions and methods common to all bindings -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -match ------ - -:funcdef:`rex.match (subj, patt, [init], [cf], [ef], [larg...])` - -or - -:funcdef:`r:match (subj, [init], [ef])` - -The function searches for the first match of the regexp *patt* in the string -*subj*, starting from offset *init*, subject to flags *cf* and *ef*. - - +---------+-------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===============================+========+=============+ - | r |regex object produced by new |userdata| n/a | - +---------+-------------------------------+--------+-------------+ - | subj | subject | string | n/a | - +---------+-------------------------------+--------+-------------+ - | patt |regular expression pattern |string | n/a | - | | |or | | - | | |userdata| | - +---------+-------------------------------+--------+-------------+ - | [init] |start offset in the subject | number | 1 | - | |(can be negative) | | | - +---------+-------------------------------+--------+-------------+ - | [cf] |compilation flags (bitwise OR) | number | cf_ | - +---------+-------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +---------+-------------------------------+--------+-------------+ - |[larg...]|library-specific arguments | | | - +---------+-------------------------------+--------+-------------+ - -**Returns on success:** - 1. All substring matches ("captures"), in the order they appear in the - pattern. ``false`` is returned for sub-patterns that did not participate in - the match. If the pattern specified no captures then the whole matched - substring is returned. - -**Returns on failure:** - 1. ``nil`` - ------------------------------------------------------------- - -find ----- - -:funcdef:`rex.find (subj, patt, [init], [cf], [ef], [larg...])` - -or - -:funcdef:`r:find (subj, [init], [ef])` - -The function searches for the first match of the regexp *patt* in the string -*subj*, starting from offset *init*, subject to flags *cf* and *ef*. - - +---------+-------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===============================+========+=============+ - | r |regex object produced by new |userdata| n/a | - +---------+-------------------------------+--------+-------------+ - | subj |subject | string | n/a | - +---------+-------------------------------+--------+-------------+ - | patt |regular expression pattern |string | n/a | - | | |or | | - | | |userdata| | - +---------+-------------------------------+--------+-------------+ - | [init] |start offset in the subject | number | 1 | - | |(can be negative) | | | - +---------+-------------------------------+--------+-------------+ - | [cf] |compilation flags (bitwise OR) | number | cf_ | - +---------+-------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +---------+-------------------------------+--------+-------------+ - |[larg...]|library-specific arguments | | | - +---------+-------------------------------+--------+-------------+ - -**Returns on success:** - 1. The start point of the match (a number). - 2. The end point of the match (a number). - 3. All substring matches ("captures"), in the order they appear in the - pattern. ``false`` is returned for sub-patterns that did not participate in - the match. - -**Returns on failure:** - 1. ``nil`` - ------------------------------------------------------------- - -gmatch ------- - -:funcdef:`rex.gmatch (subj, patt, [cf], [ef], [larg...])` - -The function is intended for use in the *generic for* Lua construct. -It returns an iterator for repeated matching of the pattern *patt* in -the string *subj*, subject to flags *cf* and *ef*. - - +---------+-------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===============================+========+=============+ - | subj |subject |string | n/a | - +---------+-------------------------------+--------+-------------+ - | patt |regular expression pattern |string | n/a | - | | |or | | - | | |userdata| | - +---------+-------------------------------+--------+-------------+ - | [cf] |compilation flags (bitwise OR) |number | cf_ | - +---------+-------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) |number | ef_ | - +---------+-------------------------------+--------+-------------+ - |[larg...]|library-specific arguments | | | - +---------+-------------------------------+--------+-------------+ - -The iterator function is called by Lua. On every iteration (that is, on every -match), it returns all captures in the order they appear in the pattern (or the -entire match if the pattern specified no captures). The iteration will continue -till the subject fails to match. - ------------------------------------------------------------- - -gsub ----- - -:funcdef:`rex.gsub (subj, patt, repl, [n], [cf], [ef], [larg...])` - -This function searches for all matches of the pattern *patt* in the string -*subj* and replaces them according to the parameters *repl* and *n* (see details -below). - - +---------+-----------------------------------+--------------------------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===================================+==========================+=============+ - | subj |subject | string | n/a | - +---------+-----------------------------------+--------------------------+-------------+ - | patt |regular expression pattern |string or userdata | n/a | - +---------+-----------------------------------+--------------------------+-------------+ - | repl |substitution source |string, function or table | n/a | - +---------+-----------------------------------+--------------------------+-------------+ - | [n] |maximum number of matches to search| number or function | ``nil`` | - | |for, or control function, or nil | | | - +---------+-----------------------------------+--------------------------+-------------+ - | [cf] |compilation flags (bitwise OR) | number | cf_ | - +---------+-----------------------------------+--------------------------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +---------+-----------------------------------+--------------------------+-------------+ - |[larg...]|library-specific arguments | | | - +---------+-----------------------------------+--------------------------+-------------+ - -**Returns:** - 1. The subject string with the substitutions made. - 2. Number of matches found. - 3. Number of substitutions made. - -**Details:** - The parameter *repl* can be either a string, a function or a table. - On each match made, it is converted into a value *repl_out* that may be used - for the replacement. - - *repl_out* is generated differently depending on the type of *repl*: - - 1. If *repl* is a *string* then it is treated as a template for substitution, - where the %X occurences in *repl* are handled in a special way, depending - on the value of the character X: - - * if X represents a digit, then each %X occurence is substituted by the - value of the X-th submatch (capture), with the following cases handled - specially: - - * each %0 is substituted by the entire match - * if the pattern contains no captures, then each %1 is substituted by the - entire match - * any other %X where X is greater than the number of captures in the - pattern will generate an error ("invalid capture index") - * if the pattern does contain a capture with number X but that capture - didn't participate in the match, then %X is substituted by an empty - string - - * if X is any non-digit character then %X is substituted by X - - All parts of *repl* other than %X are copied to *repl_out* verbatim. - - 2. If *repl* is a *function* then it is called on each match with the - submatches passed as parameters (if there are no submatches then the entire - match is passed as the only parameter). *repl_out* is the return value of - the *repl* call, and is interpreted as follows: - - * if it is a string or a number (coerced to a string), then the replacement - value is that string; - * if it is a ``nil`` or a ``false``, then no replacement is to be done; - - 3. If *repl* is a table then *repl_out* is *repl* [m1], where m1 is the first - submatch (or the entire match if there are no submatches), following the - same rules as for the return value of *repl* call, described in the above - paragraph. - - Note: Under some circumstances, the value of *repl_out* may be ignored; see - below_. - - gsub behaves differently depending on the type of *n*: - - 1. If *n* is a *number* then it is treated as the maximum number of matches - to search for (an omitted or ``nil`` value means an unlimited number of - matches). On each match, the replacement value is the *repl_out* string - (see above). - -.. _below: - - 2. If *n* is a function, then it is called on each match, after *repl_out* is - produced (so if *repl* is a function, it will be called prior to the *n* - call). - - *n* receives 3 arguments and returns 2 values. Its arguments are: - - 1. The start offset of the match (a number) - 2. The end offset of the match (a number) - 3. *repl_out* - - The type of its first return controls the replacement produced by gsub for - the current match: - - * ``true`` -- replace/don't replace, according to *repl_out*; - * ``nil``/``false`` -- don't replace; - * a string (or a number coerced to a string) -- replace by that string; - - The type of its second return controls gsub behavior after the current - match is handled: - - * ``nil``/``false`` -- no changes: *n* will be called on the next match; - * ``true`` -- search for an unlimited number of matches; *n* will not be - called again; - * a number -- maximum number of matches to search for, beginning from the - next match; *n* will not be called again; - ------------------------------------------------------------- - -split ------ - -:funcdef:`rex.split (subj, sep, [cf], [ef], [larg...])` - -The function is intended for use in the *generic for* Lua construct. -It is used for splitting a subject string *subj* into parts (*sections*). -The *sep* parameter is a regular expression pattern representing -**separators** between the sections. - -The function returns an iterator for repeated matching of the pattern *sep* in -the string *subj*, subject to flags *cf* and *ef*. - - +---------+-------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===============================+========+=============+ - | subj |subject |string | n/a | - +---------+-------------------------------+--------+-------------+ - | sep |separator (regular expression |string | n/a | - | |pattern) |or | | - | | |userdata| | - +---------+-------------------------------+--------+-------------+ - | [cf] |compilation flags (bitwise OR) |number | cf_ | - +---------+-------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) |number | ef_ | - +---------+-------------------------------+--------+-------------+ - |[larg...]|library-specific arguments | | | - +---------+-------------------------------+--------+-------------+ - -**On every iteration pass, the iterator returns:** - - 1. A subject section (can be an empty string), followed by - 2. All captures in the order they appear in the *sep* pattern (or the entire - match if the *sep* pattern specified no captures). If there is no match - (this can occur only in the last iteration), then nothing is returned after - the subject section. - -The iteration will continue till the end of the subject. Unlike gmatch_, there -will always be at least one iteration pass, even if there are no matches in the -subject. - ------------------------------------------------------------- - -count ------ - -:funcdef:`rex.count (subj, patt, [cf], [ef], [larg...])` - -This function counts matches of the pattern *patt* in the string *subj*. - - +---------+-----------------------------------+--------------------------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===================================+==========================+=============+ - | subj |subject | string | n/a | - +---------+-----------------------------------+--------------------------+-------------+ - | patt |regular expression pattern |string or userdata | n/a | - +---------+-----------------------------------+--------------------------+-------------+ - | [cf] |compilation flags (bitwise OR) | number | cf_ | - +---------+-----------------------------------+--------------------------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +---------+-----------------------------------+--------------------------+-------------+ - |[larg...]|library-specific arguments | | | - +---------+-----------------------------------+--------------------------+-------------+ - -**Returns:** - 1. Number of matches found. - ------------------------------------------------------------- - -flags ------ - -:funcdef:`rex.flags ([tb])` - -This function returns a table containing the numeric values of the constants -defined by the used regex library, with the keys being the (string) names of the -constants. If the table argument *tb* is supplied then it is used as the output -table, otherwise a new table is created. - -The constants contained in the returned table can then be used in most functions -and methods where *compilation flags* or *execution flags* can be specified. -They can also be used for comparing with return codes of some functions and -methods for determining the reason of failure. For details, see the relevant -regex library's documentation. - - +---------+--------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+================================+========+=============+ - | [tb] |a table for placing results into| table | ``nil`` | - +---------+--------------------------------+--------+-------------+ - -**Returns:** - 1. A table filled with the results. - -**Notes:** -The keys in the `tb` table are formed from the names of the corresponding -constants in the used library. They are formed as follows: - -* **POSIX**, **TRE**: prefix REG\_ is omitted, e.g. REG_ICASE becomes ``"ICASE"``. -* **PCRE:** prefix PCRE\_ is omitted, e.g. PCRE_CASELESS becomes ``"CASELESS"``. -* **PCRE2:** prefix PCRE2\_ is omitted, e.g. PCRE2_CASELESS becomes ``"CASELESS"``. -* **Oniguruma:** names of constants are converted to strings with no alteration, - but for ONIG_OPTION_xxx constants, alias strings are created additionally, - e.g., the value of ONIG_OPTION_IGNORECASE constant becomes accessible via - either of two keys: ``"ONIG_OPTION_IGNORECASE"`` and ``"IGNORECASE"``. -* **GNU**: the GNU library provides the flags ``not_bol``, which stops a - beginning-of-line anchor from matching at the start of a string, ``not_eol``, - which stops an end-of-line anchor from matching at the end of a string, and - ``backward`` which causes the search to be performed backwards (that is, the - pattern is matched from positions starting at the end of the string; however, - the matches themselves are still made forwards), as well as the RE_xxx syntax - specifiers (as defined in regex.h), omitting the RE\_ prefix. For example, - RE_SYNTAX_GREP becomes ``SYNTAX_GREP`` in Lua. - ------------------------------------------------------------- - -new ---- - -:funcdef:`rex.new (patt, [cf], [larg...])` - -The function compiles regular expression *patt* into a regular expression object -whose internal representation is corresponding to the library used. The returned -result then can be used by the methods, e.g. `tfind`_, `exec`_, etc. Regular -expression objects are automatically garbage collected. See the library-specific -documentation below for details of the library-specific arguments *larg...*, if -any. - - +---------+-------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===============================+========+=============+ - | patt |regular expression pattern | string | n/a | - +---------+-------------------------------+--------+-------------+ - | [cf] |compilation flags (bitwise OR) | number | cf_ | - +---------+-------------------------------+--------+-------------+ - |[larg...]|library-specific arguments | | | - +---------+-------------------------------+--------+-------------+ - -**Returns:** - 1. Compiled regular expression (a userdata). - ------------------------------------------------------------- - -tfind ------ - -:funcdef:`r:tfind (subj, [init], [ef])` - -The method searches for the first match of the compiled regexp *r* in the -string *subj*, starting from offset *init*, subject to execution flags *ef*. - - +---------+-----------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===================================+========+=============+ - | r |regex object produced by new |userdata| n/a | - +---------+-----------------------------------+--------+-------------+ - | subj |subject | string | n/a | - +---------+-----------------------------------+--------+-------------+ - | [init] |start offset in the subject | number | 1 | - | |(can be negative) | | | - +---------+-----------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +---------+-----------------------------------+--------+-------------+ - -**Returns on success:** - 1. The start point of the match (a number). - 2. The end point of the match (a number). - 3. Substring matches ("captures" in Lua terminology) are returned as a third - result, in a table. This table contains ``false`` in the positions where the - corresponding sub-pattern did not participate in the match. - - 1. **PCRE**, **PCRE2**, **Oniguruma**: if *named subpatterns* are used then - the table also contains substring matches keyed by their correspondent - subpattern names (strings). - -**Returns on failure:** - 1. ``nil`` - ------------------------------------------------------------- - -exec ----- - -:funcdef:`r:exec (subj, [init], [ef])` - -The method searches for the first match of the compiled regexp *r* in the -string *subj*, starting from offset *init*, subject to execution flags *ef*. - - +---------+-----------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===================================+========+=============+ - | r |regex object produced by new |userdata| n/a | - +---------+-----------------------------------+--------+-------------+ - | subj |subject | string | n/a | - +---------+-----------------------------------+--------+-------------+ - | [init] |start offset in the subject | number | 1 | - | |(can be negative) | | | - +---------+-----------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +---------+-----------------------------------+--------+-------------+ - -**Returns on success:** - 1. The start point of the first match (a number). - 2. The end point of the first match (a number). - 3. The offsets of substring matches ("captures" in Lua terminology) are - returned as a third result, in a table. This table contains ``false`` in the - positions where the corresponding sub-pattern did not participate in the - match. - - 1. **PCRE**, **PCRE2**, **Oniguruma**: if *named subpatterns* are used then - the table also contains substring matches keyed by their correspondent - subpattern names (strings). - -**Returns on failure:** - 1. ``nil`` - -**Example:** - If the whole match is at offsets 10,20 and substring matches are at offsets - 12,14 and 16,19 then the function returns the following: 10, 20, - { 12,14,16,19 }. - ------------------------------------------------------------- - -PCRE-only functions and methods -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -new ---- - -:funcdef:`rex.new (patt, [cf], [lo])` - -The locale (*lo*) can be either a string (e.g., "French_France.1252"), or a -userdata obtained from a call to maketables__. The default value, used when -the parameter is not supplied or ``nil``, is the built-in PCRE set of character -tables. - -__ maketables_pcre_ - ------------------------------------------------------------- - -fullinfo --------- - -[See *pcre_fullinfo* in the PCRE docs.] - -:funcdef:`r:fullinfo ()` - -This function returns a table containing information about the compiled pattern. -The keys are strings formed in the following way: -``PCRE_INFO_CAPTURECOUNT`` -> ``"CAPTURECOUNT"``. The values are numbers. - ------------------------------------------------------------- - -.. _dfa_exec_pcre: - -dfa_exec --------- - -[PCRE 6.0 and later. See *pcre_dfa_exec* in the PCRE docs.] - -:funcdef:`r:dfa_exec (subj, [init], [ef], [ovecsize], [wscount])` - -The method matches a compiled regular expression *r* against a given subject -string *subj*, using a DFA matching algorithm. - - +----------+-------------------------------------+--------+-------------+ - |Parameter | Description | Type |Default Value| - +==========+=====================================+========+=============+ - | r |regex object produced by new |userdata| n/a | - +----------+-------------------------------------+--------+-------------+ - | subj |subject | string | n/a | - +----------+-------------------------------------+--------+-------------+ - | [init] |start offset in the subject | number | 1 | - | |(can be negative) | | | - +----------+-------------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +----------+-------------------------------------+--------+-------------+ - |[ovecsize]|size of the array for result offsets | number | 100 | - +----------+-------------------------------------+--------+-------------+ - |[wscount] |number of elements in the working | number | 50 | - | |space array | | | - +----------+-------------------------------------+--------+-------------+ - -**Returns on success (either full or partial match):** - 1. The start point of the matches found (a number). - 2. A table containing the end points of the matches found, the longer matches - first. - 3. The return value of the underlying *pcre_dfa_exec* call (a number). - -**Returns on failure (no match):** - 1. ``nil`` - -**Example:** - If there are 3 matches found starting at offset 10 and ending at offsets 15, 20 - and 25 then the function returns the following: 10, { 25,20,15 }, 3. - ------------------------------------------------------------- - -.. _maketables_pcre: - -maketables ----------- - -[See *pcre_maketables* in the PCRE docs.] - -:funcdef:`rex_pcre.maketables ()` - -Creates a set of character tables corresponding to the current locale and -returns it as a userdata. The returned value can be passed to any Lrexlib -function accepting the *locale* parameter. - ------------------------------------------------------------- - -config ------- - -[PCRE 4.0 and later. See *pcre_config* in the PCRE docs.] - -:funcdef:`rex_pcre.config ([tb])` - -This function returns a table containing the values of the configuration -parameters used at PCRE library build-time. Those parameters (numbers) are -keyed by their names (strings). If the table argument *tb* is supplied then it -is used as the output table, else a new table is created. - ------------------------------------------------------------- - -.. _version: - -version -------- - -[See *pcre_version* in the PCRE docs.] - -:funcdef:`rex_pcre.version ()` - -This function returns a string containing the version of the used PCRE library -and its release date. - ------------------------------------------------------------- - -PCRE2-only functions and methods -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -new ---- - -:funcdef:`rex.new (patt, [cf], [lo])` - -The locale (*lo*) can be either a string (e.g., "French_France.1252"), or a -userdata obtained from a call to maketables__. The default value, used when -the parameter is not supplied or ``nil``, is the built-in PCRE2 set of character -tables. - -__ maketables_pcre2_ - ------------------------------------------------------------- - -patterninfo ------------ - -[See *pcre2_patterninfo* in the PCRE2 docs.] - -:funcdef:`r:patterninfo ()` - -This function returns a table containing information about the compiled pattern. -The keys are strings formed in the following way: -``PCRE2_INFO_CAPTURECOUNT`` -> ``"CAPTURECOUNT"``. The values are numbers. - ------------------------------------------------------------- - -dfa_exec --------- - -[See *pcre2_dfa_exec* in the PCRE2 docs.] - -:funcdef:`r:dfa_exec (subj, [init], [ef], [ovecsize], [wscount])` - -The method matches a compiled regular expression *r* against a given subject -string *subj*, using a DFA matching algorithm. - - +----------+-------------------------------------+--------+-------------+ - |Parameter | Description | Type |Default Value| - +==========+=====================================+========+=============+ - | r |regex object produced by new |userdata| n/a | - +----------+-------------------------------------+--------+-------------+ - | subj |subject | string | n/a | - +----------+-------------------------------------+--------+-------------+ - | [init] |start offset in the subject | number | 1 | - | |(can be negative) | | | - +----------+-------------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +----------+-------------------------------------+--------+-------------+ - |[ovecsize]|size of the array for result offsets | number | 100 | - +----------+-------------------------------------+--------+-------------+ - |[wscount] |number of elements in the working | number | 50 | - | |space array | | | - +----------+-------------------------------------+--------+-------------+ - -**Returns on success (either full or partial match):** - 1. The start point of the matches found (a number). - 2. A table containing the end points of the matches found, the longer matches - first. - 3. The return value of the underlying *pcre_dfa_exec* call (a number). - -**Returns on failure (no match):** - 1. ``nil`` - -**Example:** - If there are 3 matches found starting at offset 10 and ending at offsets 15, 20 - and 25 then the function returns the following: 10, { 25,20,15 }, 3. - ------------------------------------------------------------- - -jit_compile ------------ - -[See *pcre2_jit_compile* in the PCRE2 docs.] - -:funcdef:`r:jit_compile ([options])` - -Parameter *options* is a number (a bitwise OR of separate options; -it defaults to ``PCRE2_JIT_COMPLETE``). - -The method returns ``true`` on success or ``false`` + error message string on failure. - ------------------------------------------------------------- - -.. _maketables_pcre2: - -maketables ----------- - -[See *pcre2_maketables* in the PCRE2 docs.] - -:funcdef:`rex_pcre2.maketables ()` - -Creates a set of character tables corresponding to the current locale and -returns it as a userdata. The returned value can be passed to any Lrexlib -function accepting the *locale* parameter. - ------------------------------------------------------------- - -config ------- - -[See *pcre2_config* in the PCRE2 docs.] - -:funcdef:`rex_pcre2.config ([tb])` - -This function returns a table containing the values of the configuration -parameters used at PCRE2 library build-time. Those parameters (numbers) are -keyed by their names (strings). If the table argument *tb* is supplied then it -is used as the output table, else a new table is created. - ------------------------------------------------------------- - -version -------- - -[See *pcre2_config(PCRE2_CONFIG_VERSION)* in the PCRE2 docs.] - -:funcdef:`rex_pcre2.version ()` - -This function returns a string containing the version of the used PCRE2 library -and its release date. - ------------------------------------------------------------- - -GNU-only functions and methods -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -new ---- - -:funcdef:`rex.new (patt, [cf], [tr])` - -If the compilation flags (*cf*) are not supplied or ``nil``, the default syntax -is ``SYNTAX_POSIX_EXTENDED``. Note that this is not the same as passing a value -of zero, which is the same as ``SYNTAX_EMACS``. - -The *translation* parameter (*tr*) is a map of eight-bit character codes (0 to -255 inclusive) to 8-bit characters (strings). If this parameter is given, the -pattern is translated at compilation time, and each string to be matched is -translated when it is being matched. - - -Oniguruma-only functions and methods -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -new ---- - -:funcdef:`rex.new (patt, [cf], [enc], [syn])` - -The *encoding* parameter (*enc*) must be one of the predefined strings that are -formed from the ONIG_ENCODING_xxx identifiers defined in oniguruma.h, by means -of omitting the ONIG_ENCODING\_ part. For example, ONIG_ENCODING_UTF8 becomes -``"UTF8"`` on the Lua side. The default value, used when the parameter is not -supplied or ``nil``, is ``"ASCII"``. - -If the caller-supplied value of this parameter is not one of the predefined -"encoding" string set, an error is raised. - -The *syntax* parameter (*syn*) must be one of the predefined strings that are -formed from the ONIG_SYNTAX_xxx identifiers defined in oniguruma.h, by means of -omitting the ONIG_SYNTAX\_ part. For example, ONIG_SYNTAX_JAVA becomes -``"JAVA"`` on the Lua side. The default value, used when the parameter is not -supplied or ``nil``, is either ``"RUBY"`` (at start-up), or the value set by the -last setdefaultsyntax_ call. - -If the caller-supplied value of `syntax` parameter is not one of the predefined -"syntax" string set, an error is raised. - -setdefaultsyntax ----------------- - -:funcdef:`rex_onig.setdefaultsyntax (syntax)` - -This function sets the default syntax for the Oniguruma library, according to the -value of the string syntax. The specified syntax will be further used for -interpreting string regex patterns by all relevant functions, unless the *syntax* -argument is passed to those functions explicitly. - -**Returns:** nothing - -**Examples:** - - 1. ``rex_onig.setdefaultsyntax ("ASIS") -- use plain text syntax as the default`` - 2. ``rex_onig.setdefaultsyntax ("PERL") -- use PERL regex syntax as the default`` - ------------------------------------------------------------- - -version -------- - -[See *onig_version* in the Oniguruma docs.] - -:funcdef:`rex_onig.version ()` - -This function returns a string containing the version of the used Oniguruma -library. - ------------------------------------------------------------- - -capturecount ------------- - -[See *onig_number_of_captures* in the Oniguruma docs.] - -:funcdef:`r:capturecount ()` - -Returns the number of captures in the pattern. - ------------------------------------------------------------- - -TRE-only functions and methods -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -new ---- - -:funcdef:`rex.new (patt, [cf])` - -atfind -------- - -:funcdef:`r:atfind (subj, params, [init], [ef])` - -The method searches for the first match of the compiled regexp *r* in the -string *subj*, starting from offset *init*, subject to execution flags *ef*. - - +---------+-----------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===================================+========+=============+ - | r |regex object produced by new |userdata| n/a | - +---------+-----------------------------------+--------+-------------+ - | subj |subject | string | n/a | - +---------+-----------------------------------+--------+-------------+ - | params |Approximate matching parameters. | table |n/a | - | |The values are integers. | | | - | |The valid string key values are: | |(Default | - | |``cost_ins``, ``cost_del``, | |value for | - | |``cost_subst``, ``max_cost``, | |a missing | - | |``max_ins``, ``max_del``, | |field is 0) | - | |``max_subst``, ``max_err`` | | | - +---------+-----------------------------------+--------+-------------+ - | [init] |start offset in the subject | number | 1 | - | |(can be negative) | | | - +---------+-----------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +---------+-----------------------------------+--------+-------------+ - -**Returns on success:** - 1. The start point of the match (a number). - 2. The end point of the match (a number). - 3. Substring matches ("captures" in Lua terminology) are returned as a third - result, in the array part of a table. Positions where the corresponding - sub-pattern did not participate in the match contain ``false``. - The hash part of the table contains additional information on the match, - in the following fields: ``cost``, ``num_ins``, ``num_del`` and ``num_subst``. - -**Returns on failure:** - 1. ``nil`` - ------------------------------------------------------------- - -aexec ------- - -:funcdef:`r:aexec (subj, params, [init], [ef])` - -The method searches for the first match of the compiled regexp *r* in the -string *subj*, starting from offset *init*, subject to execution flags *ef*. - - +---------+-----------------------------------+--------+-------------+ - |Parameter| Description | Type |Default Value| - +=========+===================================+========+=============+ - | r |regex object produced by new |userdata| n/a | - +---------+-----------------------------------+--------+-------------+ - | subj |subject | string | n/a | - +---------+-----------------------------------+--------+-------------+ - | params |Approximate matching parameters. | table |n/a | - | |The values are integers. | | | - | |The valid string key values are: | |(Default | - | |``cost_ins``, ``cost_del``, | |value for | - | |``cost_subst``, ``max_cost``, | |a missing | - | |``max_ins``, ``max_del``, | |field is 0) | - | |``max_subst``, ``max_err`` | | | - +---------+-----------------------------------+--------+-------------+ - | [init] |start offset in the subject | number | 1 | - | |(can be negative) | | | - +---------+-----------------------------------+--------+-------------+ - | [ef] |execution flags (bitwise OR) | number | ef_ | - +---------+-----------------------------------+--------+-------------+ - -**Returns on success:** - 1. The start point of the first match (a number). - 2. The end point of the first match (a number). - 3. The offsets of substring matches ("captures" in Lua terminology) are - returned as a third result, in the array part of a table. Positions where - the corresponding sub-pattern did not participate in the match contain - ``false``. The hash part of the table contains additional information on - the match, in the following fields: ``cost``, ``num_ins``, ``num_del`` and - ``num_subst``. - -**Returns on failure:** - 1. ``nil`` - ------------------------------------------------------------- - -have_approx ------------- - -:funcdef:`r:have_approx ()` - -The method returns ``true`` if the compiled pattern uses approximate matching, -and ``false`` if not. - ------------------------------------------------------------- - -have_backrefs --------------- - -:funcdef:`r:have_backrefs ()` - -The method returns ``true`` if the compiled pattern has back references, -and ``false`` if not. - ------------------------------------------------------------- - -config ------- - -[See *tre_config* in the TRE docs.] - -:funcdef:`rex_tre.config ([tb])` - -This function returns a table containing the values of the configuration -parameters used at TRE library build-time. Those parameters are -keyed by their names. If the table argument *tb* is supplied then it -is used as the output table, else a new table is created. - ------------------------------------------------------------- - -rex_tre.version ---------------- - -[See *tre_version* in the TRE docs.] - -:funcdef:`rex_tre.version ()` - -This function returns a string containing the version of the used TRE library. - ------------------------------------------------------------- - -Incompatibilities with previous versions -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ - -**Incompatibilities between versions 2.8 and 2.7:** - - 1. In the functions searching for multiple matches every empty match adjacent - to the previous match is discarded. - -**Incompatibilities between versions 2.6 and 2.5:** - - 1. Removed function ``plainfind``. - #. Global variables (e.g. *rex_posix*, *rex_pcre*, etc.) are not created - by default. This can be changed at the stage of compilation by adding - ``-DREX_CREATEGLOBALVAR`` to ``CFLAGS``. - -**Incompatibilities between versions 2.2 and 2.1:** - - 1. gsub_: a special "break" return of *repl* function is deprecated. - #. (PCRE) gsub_, gmatch_: after finding an empty match at the current - position, the functions try to find a non-empty match anchored to the same - position. - -**Incompatibilities between versions 2.1 and 2.0:** - - 1. match_, find_, tfind_, exec_, dfa_exec__: only one value (a ``nil``) is - returned when the subject does not match the pattern. Any other failure - generates an error. - -__ dfa_exec_pcre_ - -**Incompatibilities between versions 2.0 and 1.19:** - - 1. Lua 5.1 is required - #. Functions ``newPCRE`` and ``newPOSIX`` renamed to new - #. Functions ``flagsPCRE`` and ``flagsPOSIX`` renamed to flags_ - #. Function ``versionPCRE`` renamed to version_ - #. Method ``match`` renamed to tfind_ - #. Method ``gmatch`` removed (similar functionality is provided by function - gmatch_) - #. Methods tfind_ and exec_: 2 values are returned on failure - #. (PCRE) exec_: the returned table may additionally contain *named - subpatterns* diff --git a/mkrockspecs.lua b/mkrockspecs.lua deleted file mode 100644 index 3087222..0000000 --- a/mkrockspecs.lua +++ /dev/null @@ -1,50 +0,0 @@ --- Generate rockspecs from a prototype with variants - -local tree = require "std.tree" - -if select ("#", ...) < 2 then - io.stderr:write "Usage: mkrockspecs PACKAGE VERSION\n" - os.exit () -end - -package_name = select (1, ...) -version = select (2, ...) - -function format (x, indent) - indent = indent or "" - if type (x) == "table" then - local s = "{\n" - for i, v in pairs (x) do - if type (i) ~= "number" then - s = s..indent..i.." = "..format (v, indent.." ")..",\n" - end - end - for i, v in ipairs (x) do - s = s..indent..format (v, indent.." ")..",\n" - end - return s..indent:sub (1, -3).."}" - elseif type (x) == "string" then - return string.format ("%q", x) - else - return tostring (x) - end -end - -flavour = "" -- a global, visible in loadfile -for f, spec in pairs (loadfile ("rockspecs.lua") ()) do - if f ~= "default" then - local specfile = package_name.."-"..(f ~= "" and f:lower ().."-" or "")..version.."-1.rockspec" - h = io.open (specfile, "w") - assert (h) - flavour = f - local specs = loadfile ("rockspecs.lua") () -- reload to get current flavour interpolated - local spec = tree.merge (tree (specs.default), tree (specs[f])) - local s = "" - for i, v in pairs (spec) do - s = s..i.." = "..format (v, " ").."\n" - end - h:write (s) - h:close () - os.execute ("luarocks lint " .. specfile) - end -end diff --git a/test/common_sets.lua b/rex_common_sets_test.lua similarity index 99% rename from test/common_sets.lua rename to rex_common_sets_test.lua index b259efc..2ff7341 100644 --- a/test/common_sets.lua +++ b/rex_common_sets_test.lua @@ -3,7 +3,7 @@ -- This file should contain only test sets that behave identically -- when being run with pcre or posix regex libraries. -local luatest = require "luatest" +local luatest = require "rex_lua_test" local N = luatest.NT local unpack = unpack or table.unpack diff --git a/test/luatest.lua b/rex_lua_test.lua similarity index 100% rename from test/luatest.lua rename to rex_lua_test.lua diff --git a/test/pat2pcre.lua b/rex_pat2pcre_test.lua similarity index 100% rename from test/pat2pcre.lua rename to rex_pat2pcre_test.lua diff --git a/test/pcre_sets2.lua b/rex_pcre_sets2_test.lua similarity index 99% rename from test/pcre_sets2.lua rename to rex_pcre_sets2_test.lua index 3f56f8e..f73338a 100644 --- a/test/pcre_sets2.lua +++ b/rex_pcre_sets2_test.lua @@ -1,6 +1,6 @@ -- See Copyright Notice in the file LICENSE -local pat2pcre = require "pat2pcre" +local pat2pcre = require "rex_pat2pcre_test" local unpack = unpack or table.unpack local function get_gsub (lib) diff --git a/test/pcre_sets.lua b/rex_pcre_sets_test.lua similarity index 99% rename from test/pcre_sets.lua rename to rex_pcre_sets_test.lua index 1e0bc06..eb5817d 100644 --- a/test/pcre_sets.lua +++ b/rex_pcre_sets_test.lua @@ -1,6 +1,6 @@ -- See Copyright Notice in the file LICENSE -local luatest = require "luatest" +local luatest = require "rex_lua_test" local N = luatest.NT local unpack = unpack or table.unpack diff --git a/rex_run_test.lua b/rex_run_test.lua new file mode 100644 index 0000000..56fa53a --- /dev/null +++ b/rex_run_test.lua @@ -0,0 +1,58 @@ +-- See Copyright Notice in the file LICENSE + +local luatest = require "rex_lua_test" +local glue = require "glue" + +-- returns: number of failures +local function test_library (libname, setfile, verbose, use_alien) + if verbose then + print (("[lib: %s; file: %s]"):format (libname, setfile)) + end + local lib = require (libname) + local f = require (setfile) + local sets = f (libname) + + local newmembuffer = lib._newmembuffer + if not newmembuffer then + io.stderr:write ("Warning: cannot run tests with buffer subjects\n") + end + + local n = 0 -- number of failures + for _, set in ipairs (sets) do + if verbose then + print (set.Name or "Unnamed set") + end + local err = luatest.test_set (set, lib, newmembuffer) + if verbose then + if glue.count(err) == 0 then + print (" Test successful") + end + for _,v in ipairs (err) do + print (" Test " .. v.i) + luatest.print_results (v, " ") + end + end + n = n + #err + end + if verbose then + print "" + end + return n +end + +local avail_tests = { + pcre2 = { lib = "rex_pcre2", "rex_common_sets_test", "rex_pcre_sets_test", "rex_pcre_sets2_test", }, +} + +do + local verbose, nerr, ntest = true, 0, 0 + -- do tests + for _, test in pairs (avail_tests) do + package.loaded[test.lib] = nil -- to force-reload the tested library + for _, setfile in ipairs (test) do + nerr = nerr + test_library (test.lib, setfile, verbose) + ntest = ntest + 1 + end + end + print ("Total number of failures: " .. nerr .. " of " .. ntest) +end diff --git a/rockspecs.lua b/rockspecs.lua deleted file mode 100644 index 9677174..0000000 --- a/rockspecs.lua +++ /dev/null @@ -1,157 +0,0 @@ --- Rockspec data - --- Variables to be interpolated: --- --- flavour: regex library --- version - -local flavours = {"PCRE", "PCRE2", "POSIX", "oniguruma", "TRE", "GNU"} -local version_dashed = version:gsub ("%.", "-") --- FIXME: PCRE2 define should be only in PCRE2 rockspec -local defines = {"VERSION=\""..version.."\"", - "PCRE2_CODE_UNIT_WIDTH=8"} - --- FIXME: When Lua 5.1 support is dropped, use an env argument with --- loadfile instead of wrapping in a table -return { - -default = { - package = "Lrexlib-"..flavour, - version = version.."-1", - source = { - url = "git+https://github.com/rrthomas/lrexlib.git", - tag = "rel-"..version_dashed, - }, - description = { - summary = "Regular expression library binding ("..flavour.." flavour).", - detailed = [[ -Lrexlib is a regular expression library for Lua 5.1-5.4, which -provides bindings for several regular expression libraries. -This rock provides the ]]..flavour..[[ bindings.]], - homepage = "https://github.com/rrthomas/lrexlib", - license = "MIT/X11" - }, - dependencies = { - "lua >= 5.1" - }, -}, - -PCRE = { - external_dependencies = { - PCRE = { - header = "pcre.h", - library = "pcre" - } - }, - build = { - type = "builtin", - modules = { - rex_pcre = { - defines = defines, - sources = {"src/common.c", "src/pcre/lpcre.c", "src/pcre/lpcre_f.c"}, - libraries = {"pcre"}, - incdirs = {"$(PCRE_INCDIR)"}, - libdirs = {"$(PCRE_LIBDIR)"} - } - } - } -}, - -PCRE2 = { - external_dependencies = { - PCRE2 = { - header = "pcre2.h", - library = "pcre2-8" - } - }, - build = { - type = "builtin", - modules = { - rex_pcre2 = { - defines = defines, - sources = {"src/common.c", "src/pcre2/lpcre2.c", "src/pcre2/lpcre2_f.c"}, - libraries = {"pcre2-8"}, - incdirs = {"$(PCRE2_INCDIR)"}, - libdirs = {"$(PCRE2_LIBDIR)"} - } - } - } -}, - -POSIX = { - external_dependencies = { - POSIX = { - header = "regex.h", - } - }, - build = { - type = "builtin", - modules = { - rex_posix = { - defines = defines, - sources = {"src/common.c", "src/posix/lposix.c"} - } - } - } -}, - -oniguruma = { - external_dependencies = { - ONIG = { - header = "oniguruma.h", - library = "onig" - } - }, - build = { - type = "builtin", - modules = { - rex_onig = { - defines = defines, - sources = {"src/common.c", "src/oniguruma/lonig.c", "src/oniguruma/lonig_f.c"}, - libraries = {"onig"}, - incdirs = {"$(ONIG_INCDIR)"}, - libdirs = {"$(ONIG_LIBDIR)"} - } - } - } -}, - -TRE = { - external_dependencies = { - TRE = { - header = "tre/tre.h", - library = "tre" - } - }, - build = { - type = "builtin", - modules = { - rex_tre = { - defines = defines, - sources = {"src/common.c", "src/tre/ltre.c" --[[, "src/tre/tre_w.c"]]}, - libraries = {"tre"}, - incdirs = {"$(TRE_INCDIR)"}, - libdirs = {"$(TRE_LIBDIR)"} - } - } - } -}, - -GNU = { - external_dependencies = { - GNU = { - header = "regex.h", - } - }, - build = { - type = "builtin", - modules = { - rex_gnu = { - defines = defines, - sources = {"src/common.c", "src/gnu/lgnu.c"} - } - } - } -}, - -} -- close wrapper table diff --git a/src/gnu/lgnu.c b/src/gnu/lgnu.c deleted file mode 100644 index a18508c..0000000 --- a/src/gnu/lgnu.c +++ /dev/null @@ -1,314 +0,0 @@ -/* lgnu.c - Lua binding of GNU regular expressions library */ -/* See Copyright Notice in the file LICENSE */ - -#include -#include -#include -#include "lua.h" -#include "lauxlib.h" -#include "../common.h" - -#define _GNU_SOURCE -#ifndef __USE_GNU -# define __USE_GNU -#endif -#ifndef REX_GNU_INCLUDE -# include -#else -# include REX_GNU_INCLUDE -#endif - -/* These 2 settings may be redefined from the command-line or the makefile. - * They should be kept in sync between themselves and with the target name. - */ -#ifndef REX_LIBNAME -# define REX_LIBNAME "rex_gnu" -#endif -#ifndef REX_OPENLIB -# define REX_OPENLIB luaopen_rex_gnu -#endif - -#define REX_TYPENAME REX_LIBNAME"_regex" - -#define ALG_CFLAGS_DFLT RE_SYNTAX_POSIX_EXTENDED -#define ALG_EFLAGS_DFLT 0 - -#define ALG_GETCFLAGS(L,pos) (int)luaL_optinteger(L, pos, ALG_CFLAGS_DFLT) - -static const unsigned char *gettranslate (lua_State *L, int pos); -#define ALG_GETCARGS(L,pos,argC) argC->translate = gettranslate (L, pos) - -#define ALG_NOMATCH(res) ((res) == -1 || (res) == -2) -#define ALG_ISMATCH(res) ((res) >= 0) -#define ALG_SUBBEG(ud,n) ud->match.start[n] -#define ALG_SUBEND(ud,n) ud->match.end[n] -#define ALG_SUBLEN(ud,n) (ALG_SUBEND(ud,n) - ALG_SUBBEG(ud,n)) -#define ALG_SUBVALID(ud,n) (ALG_SUBBEG(ud,n) >= 0) -#define ALG_NSUB(ud) ((int)ud->r.re_nsub) - -#define ALG_PUSHSUB(L,ud,text,n) \ - lua_pushlstring (L, (text) + ALG_SUBBEG(ud,n), ALG_SUBLEN(ud,n)) - -#define ALG_PUSHSUB_OR_FALSE(L,ud,text,n) \ - (ALG_SUBVALID(ud,n) ? (void) ALG_PUSHSUB (L,ud,text,n) : lua_pushboolean (L,0)) - -#define ALG_PUSHSTART(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBBEG(ud,n) + 1) -#define ALG_PUSHEND(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBEND(ud,n)) -#define ALG_PUSHOFFSETS(L,ud,offs,n) \ - (ALG_PUSHSTART(L,ud,offs,n), ALG_PUSHEND(L,ud,offs,n)) - -#define ALG_BASE(st) (st) - -typedef struct { - struct re_pattern_buffer r; - struct re_registers match; - int freed; - const char * errmsg; -} TGnu; - -#define TUserdata TGnu - -#include "../algo.h" - -/* Functions - ****************************************************************************** - */ - -/* Execution flags, which we need to simulate as GNU does not use flags for this. */ -#define GNU_NOTBOL 1 -#define GNU_NOTEOL 2 -#define GNU_BACKWARD 4 - -static int generate_error (lua_State *L, const TUserdata *ud, int errcode) { - const char *errmsg; - switch (errcode) { - case 0: - errmsg = ud->errmsg; - break; - case -1: - errmsg = "no match"; - break; - case -2: - errmsg = "internal error in GNU regex"; - break; - default: - errmsg = "unknown error"; - } - return luaL_error (L, "%s", errmsg); -} - -#define ALG_TRANSLATE_SIZE (UCHAR_MAX + 1) -static const unsigned char *gettranslate (lua_State *L, int pos) { - unsigned i; - const unsigned char *translate; - - if (lua_isnoneornil (L, pos)) - return NULL; - - translate = (const unsigned char *) malloc (ALG_TRANSLATE_SIZE); - if (!translate) - luaL_error (L, "malloc failed"); - memset ((unsigned char *) translate, 0, ALG_TRANSLATE_SIZE); /* initialize all members to 0 */ - for (i = 0; i <= UCHAR_MAX; i++) { - lua_pushinteger (L, i); - lua_gettable (L, pos); - if (lua_tostring (L, -1)) - ((unsigned char *) translate)[i] = *lua_tostring (L, -1); - lua_pop (L, 1); - } - return translate; -} - -static void seteflags (TGnu *ud, TArgExec *argE) { - ud->r.not_bol = (argE->eflags & GNU_NOTBOL) != 0; - ud->r.not_eol = (argE->eflags & GNU_NOTEOL) != 0; -} - -static int compile_regex (lua_State *L, const TArgComp *argC, TGnu **pud) { - const char *res; - TGnu *ud; - int ret; - - ud = (TGnu *)lua_newuserdata (L, sizeof (TGnu)); - memset (ud, 0, sizeof (TGnu)); /* initialize all members to 0 */ - - re_set_syntax (argC->cflags); - - /* translate table is never written to, so this cast is safe */ - ud->r.translate = (unsigned char *) argC->translate; - - res = re_compile_pattern (argC->pattern, argC->patlen, &ud->r); - if (res != NULL) { - ud->errmsg = res; - ret = generate_error (L, ud, 0); - } else { - lua_pushvalue (L, ALG_ENVIRONINDEX); - lua_setmetatable (L, -2); - - if (pud) *pud = ud; - ret = 1; - } - - return ret; -} - -static int gmatch_exec (TUserdata *ud, TArgExec *argE) { - seteflags (ud, argE); - if (argE->startoffset > 0) - ud->r.not_bol = 1; - argE->text += argE->startoffset; - argE->textlen -= argE->startoffset; - if (argE->eflags & GNU_BACKWARD) - return re_search (&ud->r, argE->text, argE->textlen, argE->textlen, -argE->textlen, &ud->match); - else - return re_search (&ud->r, argE->text, argE->textlen, 0, argE->textlen, &ud->match); -} - -static void gmatch_pushsubject (lua_State *L, TArgExec *argE) { - lua_pushlstring (L, argE->text, argE->textlen); -} - -static int findmatch_exec (TGnu *ud, TArgExec *argE) { - argE->text += argE->startoffset; - argE->textlen -= argE->startoffset; - seteflags (ud, argE); - if (argE->eflags & GNU_BACKWARD) - return re_search (&ud->r, argE->text, argE->textlen, argE->textlen, -argE->textlen, &ud->match); - else - return re_search (&ud->r, argE->text, argE->textlen, 0, argE->textlen, &ud->match); -} - -static int gsub_exec (TGnu *ud, TArgExec *argE, int st) { - seteflags (ud, argE); - if (st > 0) - ud->r.not_bol = 1; - if (argE->eflags & GNU_BACKWARD) - return re_search (&ud->r, argE->text + st, argE->textlen - st, argE->textlen - st, -(argE->textlen - st), &ud->match); - else - return re_search (&ud->r, argE->text + st, argE->textlen - st, 0, argE->textlen - st, &ud->match); -} - -static int split_exec (TGnu *ud, TArgExec *argE, int offset) { - seteflags (ud, argE); - if (offset > 0) - ud->r.not_bol = 1; - if (argE->eflags & GNU_BACKWARD) - return re_search (&ud->r, argE->text + offset, argE->textlen - offset, argE->textlen - offset, -(argE->textlen - offset), &ud->match); - else - return re_search (&ud->r, argE->text + offset, argE->textlen - offset, 0, argE->textlen - offset, &ud->match); -} - -static int Gnu_gc (lua_State *L) { - TGnu *ud = check_ud (L); - if (ud->freed == 0) { /* precaution against "manual" __gc calling */ - ud->freed = 1; - regfree (&ud->r); - free (ud->match.start); - free (ud->match.end); - } - return 0; -} - -static int Gnu_tostring (lua_State *L) { - TGnu *ud = check_ud (L); - if (ud->freed == 0) - lua_pushfstring (L, "%s (%p)", REX_TYPENAME, (void*)ud); - else - lua_pushfstring (L, "%s (deleted)", REX_TYPENAME); - return 1; -} - -static flag_pair gnu_flags[] = -{ - { "not_bol", GNU_NOTBOL }, - { "not_eol", GNU_NOTEOL }, - { "backward", GNU_BACKWARD }, -/*---------------------------------------------------------------------------*/ - { NULL, 0 } -}; - -static flag_pair gnu_syntax_flags[] = { - /* Syntax flag sets. */ - { "SYNTAX_EMACS", RE_SYNTAX_EMACS }, - { "SYNTAX_AWK", RE_SYNTAX_AWK }, - { "SYNTAX_GNU_AWK", RE_SYNTAX_GNU_AWK }, - { "SYNTAX_POSIX_AWK", RE_SYNTAX_POSIX_AWK }, - { "SYNTAX_POSIX_AWK", RE_SYNTAX_POSIX_AWK }, - { "SYNTAX_EGREP", RE_SYNTAX_EGREP }, - { "SYNTAX_POSIX_EGREP", RE_SYNTAX_POSIX_EGREP }, - { "SYNTAX_ED", RE_SYNTAX_ED }, - { "SYNTAX_SED", RE_SYNTAX_SED }, - { "SYNTAX_POSIX_AWK", RE_SYNTAX_POSIX_AWK }, - { "SYNTAX_GREP", RE_SYNTAX_GREP }, - { "SYNTAX_POSIX_BASIC", RE_SYNTAX_POSIX_BASIC }, - { "SYNTAX_POSIX_MINIMAL_BASIC", RE_SYNTAX_POSIX_MINIMAL_BASIC }, - { "SYNTAX_POSIX_EXTENDED", RE_SYNTAX_POSIX_EXTENDED }, - { "SYNTAX_POSIX_MINIMAL_EXTENDED", RE_SYNTAX_POSIX_MINIMAL_EXTENDED }, - - /* Individual syntax flags. */ - { "BACKSLASH_ESCAPE_IN_LISTS", RE_BACKSLASH_ESCAPE_IN_LISTS }, - { "BK_PLUS_QM", RE_BK_PLUS_QM }, - { "CHAR_CLASSES", RE_CHAR_CLASSES }, - { "CONTEXT_INDEP_ANCHORS", RE_CONTEXT_INDEP_ANCHORS }, - { "CONTEXT_INDEP_OPS", RE_CONTEXT_INDEP_OPS }, - { "CONTEXT_INVALID_OPS", RE_CONTEXT_INVALID_OPS }, - { "DOT_NEWLINE", RE_DOT_NEWLINE }, - { "DOT_NOT_NULL", RE_DOT_NOT_NULL }, - { "HAT_LISTS_NOT_NEWLINE", RE_HAT_LISTS_NOT_NEWLINE }, - { "INTERVALS", RE_INTERVALS }, - { "LIMITED_OPS", RE_LIMITED_OPS }, - { "NEWLINE_ALT", RE_NEWLINE_ALT }, - { "NO_BK_BRACES", RE_NO_BK_BRACES }, - { "NO_BK_PARENS", RE_NO_BK_PARENS }, - { "NO_BK_REFS", RE_NO_BK_REFS }, - { "NO_BK_VBAR", RE_NO_BK_VBAR }, - { "NO_EMPTY_RANGES", RE_NO_EMPTY_RANGES }, - { "UNMATCHED_RIGHT_PAREN_ORD", RE_UNMATCHED_RIGHT_PAREN_ORD }, - { "NO_POSIX_BACKTRACKING", RE_NO_POSIX_BACKTRACKING }, - { "NO_GNU_OPS", RE_NO_GNU_OPS }, - { "DEBUG", RE_DEBUG }, - { "INVALID_INTERVAL_ORD", RE_INVALID_INTERVAL_ORD }, - { "ICASE", RE_ICASE }, - { "CARET_ANCHORS_HERE", RE_CARET_ANCHORS_HERE }, - { "CONTEXT_INVALID_DUP", RE_CONTEXT_INVALID_DUP }, - { "NO_SUB", RE_NO_SUB }, -#ifdef RE_PLAIN - { "PLAIN", RE_PLAIN }, -#endif -/*---------------------------------------------------------------------------*/ - { NULL, 0 } -}; - -static int Gnu_get_flags (lua_State *L) { - const flag_pair* fps[] = { gnu_flags, gnu_syntax_flags, NULL }; - return get_flags (L, fps); -} - -static const luaL_Reg r_methods[] = { - { "exec", algm_exec }, - { "tfind", algm_tfind }, /* old match */ - { "find", algm_find }, - { "match", algm_match }, - { "__gc", Gnu_gc }, - { "__tostring", Gnu_tostring }, - { NULL, NULL} -}; - -static const luaL_Reg r_functions[] = { - { "match", algf_match }, - { "find", algf_find }, - { "gmatch", algf_gmatch }, - { "gsub", algf_gsub }, - { "count", algf_count }, - { "split", algf_split }, - { "new", algf_new }, - { "flags", Gnu_get_flags }, - { NULL, NULL } -}; - -/* Open the library */ -REX_API int REX_OPENLIB (lua_State *L) -{ - alg_register(L, r_methods, r_functions, "GNU regexes"); - return 1; -} diff --git a/src/oniguruma/lonig.c b/src/oniguruma/lonig.c deleted file mode 100644 index ea7c236..0000000 --- a/src/oniguruma/lonig.c +++ /dev/null @@ -1,378 +0,0 @@ -/* lonig.c - Lua binding of Oniguruma library */ -/* See Copyright Notice in the file LICENSE */ - -#include -#include -#include -#include -#include - -#include "lua.h" -#include "lauxlib.h" -#include "../common.h" - -extern int LOnig_get_flags (lua_State *L); - -/* These 2 settings may be redefined from the command-line or the makefile. - * They should be kept in sync between themselves and with the target name. - */ -#ifndef REX_LIBNAME -# define REX_LIBNAME "rex_onig" -#endif -#ifndef REX_OPENLIB -# define REX_OPENLIB luaopen_rex_onig -#endif - -#define REX_TYPENAME REX_LIBNAME"_regex" - -#define ALG_CFLAGS_DFLT ONIG_OPTION_NONE -#define ALG_EFLAGS_DFLT 0 - -static int getcflags (lua_State *L, int pos); -#define ALG_GETCFLAGS(L,pos) getcflags(L, pos) - -static void checkarg_compile (lua_State *L, int pos, TArgComp *argC); -#define ALG_GETCARGS(a,b,c) checkarg_compile(a,b,c) - -#define ALG_NOMATCH(res) ((res) == ONIG_MISMATCH) -#define ALG_ISMATCH(res) ((res) >= 0) -#define ALG_SUBBEG(ud,n) ud->region->beg[n] -#define ALG_SUBEND(ud,n) ud->region->end[n] -#define ALG_SUBLEN(ud,n) (ALG_SUBEND(ud,n) - ALG_SUBBEG(ud,n)) -#define ALG_SUBVALID(ud,n) (ALG_SUBBEG(ud,n) >= 0) -#define ALG_NSUB(ud) onig_number_of_captures(ud->reg) - -#define ALG_PUSHSUB(L,ud,text,n) \ - lua_pushlstring (L, (text) + ALG_SUBBEG(ud,n), ALG_SUBLEN(ud,n)) - -#define ALG_PUSHSUB_OR_FALSE(L,ud,text,n) \ - (ALG_SUBVALID(ud,n) ? (void) ALG_PUSHSUB (L,ud,text,n) : lua_pushboolean (L,0)) - -#define ALG_PUSHSTART(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBBEG(ud,n) + 1) -#define ALG_PUSHEND(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBEND(ud,n)) -#define ALG_PUSHOFFSETS(L,ud,offs,n) \ - (ALG_PUSHSTART(L,ud,offs,n), ALG_PUSHEND(L,ud,offs,n)) - -#define ALG_BASE(st) 0 -#define ALG_PULL - -typedef struct { - regex_t *reg; - OnigRegion *region; - OnigErrorInfo einfo; -} TOnig; - -#define TUserdata TOnig - -static void do_named_subpatterns (lua_State *L, TOnig *ud, const char *text); -# define DO_NAMED_SUBPATTERNS do_named_subpatterns - -#include "../algo.h" - -#define CUC const unsigned char* - -/* Functions - ****************************************************************************** - */ - -static int getcflags (lua_State *L, int pos) { - switch (lua_type (L, pos)) { - case LUA_TNONE: - case LUA_TNIL: - return ALG_CFLAGS_DFLT; - case LUA_TNUMBER: - return lua_tointeger (L, pos); - case LUA_TSTRING: { - const char *s = lua_tostring (L, pos); - int res = 0, ch; - while ((ch = *s++) != '\0') { - if (ch == 'i') res |= ONIG_OPTION_IGNORECASE; - else if (ch == 'm') res |= ONIG_OPTION_NEGATE_SINGLELINE; - else if (ch == 's') res |= ONIG_OPTION_MULTILINE; - else if (ch == 'x') res |= ONIG_OPTION_EXTEND; - /* else if (ch == 'U') res |= PCRE_UNGREEDY; */ - /* else if (ch == 'X') res |= PCRE_EXTRA; */ - } - return res; - } - default: - return luaL_typerror (L, pos, "number or string"); - } -} - -static int generate_error (lua_State *L, const TOnig *ud, int errcode) { - char buf [ONIG_MAX_ERROR_MESSAGE_LEN]; - onig_error_code_to_str((unsigned char*) buf, errcode, &ud->einfo); - return luaL_error(L, buf); -} - -typedef struct { - const char * name; - void * value; -} EncPair; - -/* ATTENTION: - This array must always be kept alphabetically sorted, as it's used in the - binary search, so take care when manually inserting new elements. - */ -static EncPair Encodings[] = { - { "ASCII", ONIG_ENCODING_ASCII }, - { "BIG5", ONIG_ENCODING_BIG5 }, - { "CP1251", ONIG_ENCODING_CP1251 }, - { "EUC_CN", ONIG_ENCODING_EUC_CN }, - { "EUC_JP", ONIG_ENCODING_EUC_JP }, - { "EUC_KR", ONIG_ENCODING_EUC_KR }, - { "EUC_TW", ONIG_ENCODING_EUC_TW }, - { "GB18030", ONIG_ENCODING_GB18030 }, - { "ISO_8859_1", ONIG_ENCODING_ISO_8859_1 }, - { "ISO_8859_10", ONIG_ENCODING_ISO_8859_10 }, - { "ISO_8859_11", ONIG_ENCODING_ISO_8859_11 }, - { "ISO_8859_13", ONIG_ENCODING_ISO_8859_13 }, - { "ISO_8859_14", ONIG_ENCODING_ISO_8859_14 }, - { "ISO_8859_15", ONIG_ENCODING_ISO_8859_15 }, - { "ISO_8859_16", ONIG_ENCODING_ISO_8859_16 }, - { "ISO_8859_2", ONIG_ENCODING_ISO_8859_2 }, - { "ISO_8859_3", ONIG_ENCODING_ISO_8859_3 }, - { "ISO_8859_4", ONIG_ENCODING_ISO_8859_4 }, - { "ISO_8859_5", ONIG_ENCODING_ISO_8859_5 }, - { "ISO_8859_6", ONIG_ENCODING_ISO_8859_6 }, - { "ISO_8859_7", ONIG_ENCODING_ISO_8859_7 }, - { "ISO_8859_8", ONIG_ENCODING_ISO_8859_8 }, - { "ISO_8859_9", ONIG_ENCODING_ISO_8859_9 }, -/*{ "KOI8", ONIG_ENCODING_KOI8 }, */ - { "KOI8_R", ONIG_ENCODING_KOI8_R }, - { "SJIS", ONIG_ENCODING_SJIS }, - { "UNDEF", ONIG_ENCODING_UNDEF }, - { "UTF16_BE", ONIG_ENCODING_UTF16_BE }, - { "UTF16_LE", ONIG_ENCODING_UTF16_LE }, - { "UTF32_BE", ONIG_ENCODING_UTF32_BE }, - { "UTF32_LE", ONIG_ENCODING_UTF32_LE }, - { "UTF8", ONIG_ENCODING_UTF8 }, -}; - -/* ATTENTION: - This array must always be kept alphabetically sorted, as it's used in the - binary search, so take care when manually inserting new elements. - */ -static EncPair Syntaxes[] = { - { "ASIS", ONIG_SYNTAX_ASIS }, -/*{ "DEFAULT", ONIG_SYNTAX_DEFAULT }, */ - { "EMACS", ONIG_SYNTAX_EMACS }, - { "GNU_REGEX", ONIG_SYNTAX_GNU_REGEX }, - { "GREP", ONIG_SYNTAX_GREP }, - { "JAVA", ONIG_SYNTAX_JAVA }, - { "PERL", ONIG_SYNTAX_PERL }, - { "PERL_NG", ONIG_SYNTAX_PERL_NG }, - { "POSIX_BASIC", ONIG_SYNTAX_POSIX_BASIC }, - { "POSIX_EXTENDED", ONIG_SYNTAX_POSIX_EXTENDED }, - { "RUBY", ONIG_SYNTAX_RUBY }, -}; - -static int fcmp(const void *p1, const void *p2) { - return strcmp(((EncPair*)p1)->name, ((EncPair*)p2)->name); -} - -static const char *getlocale (lua_State *L, int pos) { - EncPair key, *found; - if ((key.name = luaL_optstring(L, pos, NULL)) == NULL) - return (const char*)ONIG_ENCODING_ASCII; - found = (EncPair*) bsearch(&key, Encodings, sizeof(Encodings)/sizeof(EncPair), - sizeof(EncPair), fcmp); - if (found == NULL) - luaL_argerror(L, pos, "invalid or unsupported encoding string"); - return (const char*)found->value; -} - -static void *getsyntax (lua_State *L, int pos) { - EncPair key, *found; - if ((key.name = luaL_optstring(L, pos, NULL)) == NULL) - return ONIG_SYNTAX_DEFAULT; - found = (EncPair*) bsearch(&key, Syntaxes, sizeof(Syntaxes)/sizeof(EncPair), - sizeof(EncPair), fcmp); - if (found == NULL) - luaL_argerror(L, pos, "invalid or unsupported syntax string"); - return found->value; -} - -static void checkarg_compile (lua_State *L, int pos, TArgComp *argC) { - argC->locale = getlocale (L, pos); - argC->syntax = getsyntax (L, pos + 1); -} - -/* - rex.setdefaultsyntax (syntax) - @param syntax: one of the predefined strings listed in array 'Syntaxes' - @return: nothing -*/ -static int LOnig_setdefaultsyntax (lua_State *L) { - (void)luaL_checkstring(L, 1); - onig_set_default_syntax((OnigSyntaxType*) getsyntax(L, 1)); - return 0; -} - -static int compile_regex (lua_State *L, const TArgComp *argC, TOnig **pud) { - TOnig *ud; - int r; - - ud = (TOnig*)lua_newuserdata (L, sizeof (TOnig)); - memset (ud, 0, sizeof (TOnig)); /* initialize all members to 0 */ - lua_pushvalue (L, ALG_ENVIRONINDEX); - lua_setmetatable (L, -2); - - r = onig_new(&ud->reg, (CUC)argC->pattern, (CUC)argC->pattern + argC->patlen, - argC->cflags, (OnigEncoding)argC->locale, (OnigSyntaxType*)argC->syntax, - &ud->einfo); - if (r != ONIG_NORMAL) - return generate_error(L, ud, r); - - if ((ud->region = onig_region_new()) == NULL) - return luaL_error(L, "`onig_region_new' failed"); - - if (pud) *pud = ud; - return 1; -} - -typedef struct { - lua_State *L; - TOnig *ud; - const char *text; -} TNameArg; - -static int name_callback (const UChar *name, const UChar *name_end, - int ngroups, int *groupnumlist, regex_t *reg, void *arg) -{ - (void) ngroups; - (void) groupnumlist; - TNameArg *A = (TNameArg*)arg; - int num = onig_name_to_backref_number(reg, name, name_end, A->ud->region); - lua_pushlstring (A->L, (const char*)name, name_end - name); - ALG_PUSHSUB_OR_FALSE (A->L, A->ud, A->text, num); - lua_rawset (A->L, -3); - return 0; -} - -/* the target table must be on lua stack top */ -static void do_named_subpatterns (lua_State *L, TOnig *ud, const char *text) { - if (onig_number_of_names (ud->reg) > 0) { - TNameArg A = { L, ud, text }; - onig_foreach_name(ud->reg, name_callback, &A); - } -} - -static int findmatch_exec (TUserdata *ud, TArgExec *argE) { - const char *end = argE->text + argE->textlen; - onig_region_clear(ud->region); - return onig_search (ud->reg, (CUC)argE->text, (CUC)end, - (CUC)argE->text + argE->startoffset, (CUC)end, - ud->region, argE->eflags); -} - -static void gmatch_pushsubject (lua_State *L, TArgExec *argE) { - lua_pushlstring (L, argE->text, argE->textlen); -} - -static int gmatch_exec (TOnig *ud, TArgExec *argE) { - return findmatch_exec(ud, argE); -} - -static int gsub_exec (TOnig *ud, TArgExec *argE, int st) { - const char *end = argE->text + argE->textlen; - onig_region_clear(ud->region); - return onig_search (ud->reg, (CUC)argE->text, (CUC)end, (CUC)argE->text + st, - (CUC)end, ud->region, argE->eflags); -} - -static int split_exec (TOnig *ud, TArgExec *argE, int st) { - return gsub_exec(ud, argE, st); -} - -static int LOnig_capturecount (lua_State *L) { - TOnig *ud = check_ud(L); - lua_pushinteger(L, onig_number_of_captures(ud->reg)); - return 1; -} - -static int LOnig_gc (lua_State *L) { - TOnig *ud = check_ud (L); - if (ud->reg) { /* precaution against "manual" __gc calling */ - onig_free (ud->reg); - ud->reg = NULL; - } - if (ud->region) { - onig_region_free (ud->region, 1); - ud->region = NULL; - } - return 0; -} - -static int LOnig_tostring (lua_State *L) { - TOnig *ud = check_ud (L); - if (ud->reg) - lua_pushfstring (L, "%s (%p)", REX_TYPENAME, (void*)ud); - else - lua_pushfstring (L, "%s (deleted)", REX_TYPENAME); - return 1; -} - -static int LOnig_version (lua_State *L) { - lua_pushstring (L, onig_version ()); - return 1; -} - -static int LOnig_internal_test (lua_State *L) { - unsigned int i; - for (i=1; i= 0) { - lua_pushboolean(L, 0); - lua_pushstring(L, "Array 'Encodings' is not properly sorted."); - return 2; - } - } - for (i=1; i= 0) { - lua_pushboolean(L, 0); - lua_pushstring(L, "Array 'Syntaxes' is not properly sorted."); - return 2; - } - } - lua_pushboolean(L, 1); - return 1; -} - -static const luaL_Reg r_methods[] = { - { "exec", algm_exec }, - { "tfind", algm_tfind }, /* old name: match */ - { "find", algm_find }, - { "match", algm_match }, - { "capturecount", LOnig_capturecount }, - { "__gc", LOnig_gc }, - { "__tostring", LOnig_tostring }, - { NULL, NULL } -}; - -static const luaL_Reg r_functions[] = { - { "match", algf_match }, - { "find", algf_find }, - { "gmatch", algf_gmatch }, - { "gsub", algf_gsub }, - { "count", algf_count }, - { "split", algf_split }, - { "new", algf_new }, - { "flags", LOnig_get_flags }, - { "version", LOnig_version }, - { "setdefaultsyntax", LOnig_setdefaultsyntax }, - { "internal_test", LOnig_internal_test }, - { NULL, NULL } -}; - -/* Open the library */ -REX_API int REX_OPENLIB (lua_State *L) { - if (ONIGURUMA_VERSION_MAJOR > atoi (onig_version ())) { - return luaL_error (L, "%s requires at least version %d of Oniguruma library", - REX_LIBNAME, (int)ONIGURUMA_VERSION_MAJOR); - } - onig_init(); - onig_set_default_syntax(ONIG_SYNTAX_RUBY); - alg_register(L, r_methods, r_functions, "Oniguruma"); - return 1; -} diff --git a/src/oniguruma/lonig_f.c b/src/oniguruma/lonig_f.c deleted file mode 100644 index 18db995..0000000 --- a/src/oniguruma/lonig_f.c +++ /dev/null @@ -1,540 +0,0 @@ -/* lonig_f.c - Lua binding of Oniguruma library */ -/* See Copyright Notice in the file LICENSE */ - -#include -#include -#include -#include "../common.h" - -static flag_pair onig_flags[] = { -#ifdef ONIG_INFINITE_DISTANCE - { "ONIG_INFINITE_DISTANCE", ONIG_INFINITE_DISTANCE }, -#endif -#ifdef ONIG_NREGION - { "ONIG_NREGION", ONIG_NREGION }, -#endif -#ifdef ONIG_MAX_BACKREF_NUM - { "ONIG_MAX_BACKREF_NUM", ONIG_MAX_BACKREF_NUM }, -#endif -#ifdef ONIG_MAX_REPEAT_NUM - { "ONIG_MAX_REPEAT_NUM", ONIG_MAX_REPEAT_NUM }, -#endif -#ifdef ONIG_MAX_MULTI_BYTE_RANGES_NUM - { "ONIG_MAX_MULTI_BYTE_RANGES_NUM", ONIG_MAX_MULTI_BYTE_RANGES_NUM }, -#endif -#ifdef ONIG_MAX_ERROR_MESSAGE_LEN - { "ONIG_MAX_ERROR_MESSAGE_LEN", ONIG_MAX_ERROR_MESSAGE_LEN }, -#endif -#ifdef ONIG_OPTION_DEFAULT - { "ONIG_OPTION_DEFAULT", ONIG_OPTION_DEFAULT }, - { "DEFAULT", ONIG_OPTION_DEFAULT }, -#endif -#ifdef ONIG_OPTION_NONE - { "ONIG_OPTION_NONE", ONIG_OPTION_NONE }, - { "NONE", ONIG_OPTION_NONE }, -#endif -#ifdef ONIG_OPTION_IGNORECASE - { "ONIG_OPTION_IGNORECASE", ONIG_OPTION_IGNORECASE }, - { "IGNORECASE", ONIG_OPTION_IGNORECASE }, -#endif -#ifdef ONIG_OPTION_EXTEND - { "ONIG_OPTION_EXTEND", ONIG_OPTION_EXTEND }, - { "EXTEND", ONIG_OPTION_EXTEND }, -#endif -#ifdef ONIG_OPTION_MULTILINE - { "ONIG_OPTION_MULTILINE", ONIG_OPTION_MULTILINE }, - { "MULTILINE", ONIG_OPTION_MULTILINE }, -#endif -#ifdef ONIG_OPTION_SINGLELINE - { "ONIG_OPTION_SINGLELINE", ONIG_OPTION_SINGLELINE }, - { "SINGLELINE", ONIG_OPTION_SINGLELINE }, -#endif -#ifdef ONIG_OPTION_FIND_LONGEST - { "ONIG_OPTION_FIND_LONGEST", ONIG_OPTION_FIND_LONGEST }, - { "FIND_LONGEST", ONIG_OPTION_FIND_LONGEST }, -#endif -#ifdef ONIG_OPTION_FIND_NOT_EMPTY - { "ONIG_OPTION_FIND_NOT_EMPTY", ONIG_OPTION_FIND_NOT_EMPTY }, - { "FIND_NOT_EMPTY", ONIG_OPTION_FIND_NOT_EMPTY }, -#endif -#ifdef ONIG_OPTION_NEGATE_SINGLELINE - { "ONIG_OPTION_NEGATE_SINGLELINE", ONIG_OPTION_NEGATE_SINGLELINE }, - { "NEGATE_SINGLELINE", ONIG_OPTION_NEGATE_SINGLELINE }, -#endif -#ifdef ONIG_OPTION_DONT_CAPTURE_GROUP - { "ONIG_OPTION_DONT_CAPTURE_GROUP", ONIG_OPTION_DONT_CAPTURE_GROUP }, - { "DONT_CAPTURE_GROUP", ONIG_OPTION_DONT_CAPTURE_GROUP }, -#endif -#ifdef ONIG_OPTION_CAPTURE_GROUP - { "ONIG_OPTION_CAPTURE_GROUP", ONIG_OPTION_CAPTURE_GROUP }, - { "CAPTURE_GROUP", ONIG_OPTION_CAPTURE_GROUP }, -#endif -#ifdef ONIG_OPTION_NOTBOL - { "ONIG_OPTION_NOTBOL", ONIG_OPTION_NOTBOL }, - { "NOTBOL", ONIG_OPTION_NOTBOL }, -#endif -#ifdef ONIG_OPTION_NOTEOL - { "ONIG_OPTION_NOTEOL", ONIG_OPTION_NOTEOL }, - { "NOTEOL", ONIG_OPTION_NOTEOL }, -#endif -#ifdef ONIG_OPTION_POSIX_REGION - { "ONIG_OPTION_POSIX_REGION", ONIG_OPTION_POSIX_REGION }, - { "POSIX_REGION", ONIG_OPTION_POSIX_REGION }, -#endif -#ifdef ONIG_OPTION_MAXBIT - { "ONIG_OPTION_MAXBIT", ONIG_OPTION_MAXBIT }, - { "MAXBIT", ONIG_OPTION_MAXBIT }, -#endif -#ifdef ONIG_SYN_OP_VARIABLE_META_CHARACTERS - { "ONIG_SYN_OP_VARIABLE_META_CHARACTERS", ONIG_SYN_OP_VARIABLE_META_CHARACTERS }, -#endif -#ifdef ONIG_SYN_OP_DOT_ANYCHAR - { "ONIG_SYN_OP_DOT_ANYCHAR", ONIG_SYN_OP_DOT_ANYCHAR }, -#endif -#ifdef ONIG_SYN_OP_ASTERISK_ZERO_INF - { "ONIG_SYN_OP_ASTERISK_ZERO_INF", ONIG_SYN_OP_ASTERISK_ZERO_INF }, -#endif -#ifdef ONIG_SYN_OP_ESC_ASTERISK_ZERO_INF - { "ONIG_SYN_OP_ESC_ASTERISK_ZERO_INF", ONIG_SYN_OP_ESC_ASTERISK_ZERO_INF }, -#endif -#ifdef ONIG_SYN_OP_PLUS_ONE_INF - { "ONIG_SYN_OP_PLUS_ONE_INF", ONIG_SYN_OP_PLUS_ONE_INF }, -#endif -#ifdef ONIG_SYN_OP_ESC_PLUS_ONE_INF - { "ONIG_SYN_OP_ESC_PLUS_ONE_INF", ONIG_SYN_OP_ESC_PLUS_ONE_INF }, -#endif -#ifdef ONIG_SYN_OP_QMARK_ZERO_ONE - { "ONIG_SYN_OP_QMARK_ZERO_ONE", ONIG_SYN_OP_QMARK_ZERO_ONE }, -#endif -#ifdef ONIG_SYN_OP_ESC_QMARK_ZERO_ONE - { "ONIG_SYN_OP_ESC_QMARK_ZERO_ONE", ONIG_SYN_OP_ESC_QMARK_ZERO_ONE }, -#endif -#ifdef ONIG_SYN_OP_BRACE_INTERVAL - { "ONIG_SYN_OP_BRACE_INTERVAL", ONIG_SYN_OP_BRACE_INTERVAL }, -#endif -#ifdef ONIG_SYN_OP_ESC_BRACE_INTERVAL - { "ONIG_SYN_OP_ESC_BRACE_INTERVAL", ONIG_SYN_OP_ESC_BRACE_INTERVAL }, -#endif -#ifdef ONIG_SYN_OP_VBAR_ALT - { "ONIG_SYN_OP_VBAR_ALT", ONIG_SYN_OP_VBAR_ALT }, -#endif -#ifdef ONIG_SYN_OP_ESC_VBAR_ALT - { "ONIG_SYN_OP_ESC_VBAR_ALT", ONIG_SYN_OP_ESC_VBAR_ALT }, -#endif -#ifdef ONIG_SYN_OP_LPAREN_SUBEXP - { "ONIG_SYN_OP_LPAREN_SUBEXP", ONIG_SYN_OP_LPAREN_SUBEXP }, -#endif -#ifdef ONIG_SYN_OP_ESC_LPAREN_SUBEXP - { "ONIG_SYN_OP_ESC_LPAREN_SUBEXP", ONIG_SYN_OP_ESC_LPAREN_SUBEXP }, -#endif -#ifdef ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR - { "ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR", ONIG_SYN_OP_ESC_AZ_BUF_ANCHOR }, -#endif -#ifdef ONIG_SYN_OP_ESC_CAPITAL_G_BEGIN_ANCHOR - { "ONIG_SYN_OP_ESC_CAPITAL_G_BEGIN_ANCHOR", ONIG_SYN_OP_ESC_CAPITAL_G_BEGIN_ANCHOR }, -#endif -#ifdef ONIG_SYN_OP_DECIMAL_BACKREF - { "ONIG_SYN_OP_DECIMAL_BACKREF", ONIG_SYN_OP_DECIMAL_BACKREF }, -#endif -#ifdef ONIG_SYN_OP_BRACKET_CC - { "ONIG_SYN_OP_BRACKET_CC", ONIG_SYN_OP_BRACKET_CC }, -#endif -#ifdef ONIG_SYN_OP_ESC_W_WORD - { "ONIG_SYN_OP_ESC_W_WORD", ONIG_SYN_OP_ESC_W_WORD }, -#endif -#ifdef ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END - { "ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END", ONIG_SYN_OP_ESC_LTGT_WORD_BEGIN_END }, -#endif -#ifdef ONIG_SYN_OP_ESC_B_WORD_BOUND - { "ONIG_SYN_OP_ESC_B_WORD_BOUND", ONIG_SYN_OP_ESC_B_WORD_BOUND }, -#endif -#ifdef ONIG_SYN_OP_ESC_S_WHITE_SPACE - { "ONIG_SYN_OP_ESC_S_WHITE_SPACE", ONIG_SYN_OP_ESC_S_WHITE_SPACE }, -#endif -#ifdef ONIG_SYN_OP_ESC_D_DIGIT - { "ONIG_SYN_OP_ESC_D_DIGIT", ONIG_SYN_OP_ESC_D_DIGIT }, -#endif -#ifdef ONIG_SYN_OP_LINE_ANCHOR - { "ONIG_SYN_OP_LINE_ANCHOR", ONIG_SYN_OP_LINE_ANCHOR }, -#endif -#ifdef ONIG_SYN_OP_POSIX_BRACKET - { "ONIG_SYN_OP_POSIX_BRACKET", ONIG_SYN_OP_POSIX_BRACKET }, -#endif -#ifdef ONIG_SYN_OP_QMARK_NON_GREEDY - { "ONIG_SYN_OP_QMARK_NON_GREEDY", ONIG_SYN_OP_QMARK_NON_GREEDY }, -#endif -#ifdef ONIG_SYN_OP_ESC_CONTROL_CHARS - { "ONIG_SYN_OP_ESC_CONTROL_CHARS", ONIG_SYN_OP_ESC_CONTROL_CHARS }, -#endif -#ifdef ONIG_SYN_OP_ESC_C_CONTROL - { "ONIG_SYN_OP_ESC_C_CONTROL", ONIG_SYN_OP_ESC_C_CONTROL }, -#endif -#ifdef ONIG_SYN_OP_ESC_OCTAL3 - { "ONIG_SYN_OP_ESC_OCTAL3", ONIG_SYN_OP_ESC_OCTAL3 }, -#endif -#ifdef ONIG_SYN_OP_ESC_X_HEX2 - { "ONIG_SYN_OP_ESC_X_HEX2", ONIG_SYN_OP_ESC_X_HEX2 }, -#endif -#ifdef ONIG_SYN_OP_ESC_X_BRACE_HEX8 - { "ONIG_SYN_OP_ESC_X_BRACE_HEX8", ONIG_SYN_OP_ESC_X_BRACE_HEX8 }, -#endif -#ifdef ONIG_SYN_OP2_ESC_CAPITAL_Q_QUOTE - { "ONIG_SYN_OP2_ESC_CAPITAL_Q_QUOTE", ONIG_SYN_OP2_ESC_CAPITAL_Q_QUOTE }, -#endif -#ifdef ONIG_SYN_OP2_QMARK_GROUP_EFFECT - { "ONIG_SYN_OP2_QMARK_GROUP_EFFECT", ONIG_SYN_OP2_QMARK_GROUP_EFFECT }, -#endif -#ifdef ONIG_SYN_OP2_OPTION_PERL - { "ONIG_SYN_OP2_OPTION_PERL", ONIG_SYN_OP2_OPTION_PERL }, -#endif -#ifdef ONIG_SYN_OP2_OPTION_RUBY - { "ONIG_SYN_OP2_OPTION_RUBY", ONIG_SYN_OP2_OPTION_RUBY }, -#endif -#ifdef ONIG_SYN_OP2_PLUS_POSSESSIVE_REPEAT - { "ONIG_SYN_OP2_PLUS_POSSESSIVE_REPEAT", ONIG_SYN_OP2_PLUS_POSSESSIVE_REPEAT }, -#endif -#ifdef ONIG_SYN_OP2_PLUS_POSSESSIVE_INTERVAL - { "ONIG_SYN_OP2_PLUS_POSSESSIVE_INTERVAL", ONIG_SYN_OP2_PLUS_POSSESSIVE_INTERVAL }, -#endif -#ifdef ONIG_SYN_OP2_CCLASS_SET_OP - { "ONIG_SYN_OP2_CCLASS_SET_OP", ONIG_SYN_OP2_CCLASS_SET_OP }, -#endif -#ifdef ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP - { "ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP", ONIG_SYN_OP2_QMARK_LT_NAMED_GROUP }, -#endif -#ifdef ONIG_SYN_OP2_ESC_K_NAMED_BACKREF - { "ONIG_SYN_OP2_ESC_K_NAMED_BACKREF", ONIG_SYN_OP2_ESC_K_NAMED_BACKREF }, -#endif -#ifdef ONIG_SYN_OP2_ESC_G_SUBEXP_CALL - { "ONIG_SYN_OP2_ESC_G_SUBEXP_CALL", ONIG_SYN_OP2_ESC_G_SUBEXP_CALL }, -#endif -#ifdef ONIG_SYN_OP2_ATMARK_CAPTURE_HISTORY - { "ONIG_SYN_OP2_ATMARK_CAPTURE_HISTORY", ONIG_SYN_OP2_ATMARK_CAPTURE_HISTORY }, -#endif -#ifdef ONIG_SYN_OP2_ESC_CAPITAL_C_BAR_CONTROL - { "ONIG_SYN_OP2_ESC_CAPITAL_C_BAR_CONTROL", ONIG_SYN_OP2_ESC_CAPITAL_C_BAR_CONTROL }, -#endif -#ifdef ONIG_SYN_OP2_ESC_CAPITAL_M_BAR_META - { "ONIG_SYN_OP2_ESC_CAPITAL_M_BAR_META", ONIG_SYN_OP2_ESC_CAPITAL_M_BAR_META }, -#endif -#ifdef ONIG_SYN_OP2_ESC_V_VTAB - { "ONIG_SYN_OP2_ESC_V_VTAB", ONIG_SYN_OP2_ESC_V_VTAB }, -#endif -#ifdef ONIG_SYN_OP2_ESC_U_HEX4 - { "ONIG_SYN_OP2_ESC_U_HEX4", ONIG_SYN_OP2_ESC_U_HEX4 }, -#endif -#ifdef ONIG_SYN_OP2_ESC_GNU_BUF_ANCHOR - { "ONIG_SYN_OP2_ESC_GNU_BUF_ANCHOR", ONIG_SYN_OP2_ESC_GNU_BUF_ANCHOR }, -#endif -#ifdef ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY - { "ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY", ONIG_SYN_OP2_ESC_P_BRACE_CHAR_PROPERTY }, -#endif -#ifdef ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT - { "ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT", ONIG_SYN_OP2_ESC_P_BRACE_CIRCUMFLEX_NOT }, -#endif -#ifdef ONIG_SYN_OP2_ESC_H_XDIGIT - { "ONIG_SYN_OP2_ESC_H_XDIGIT", ONIG_SYN_OP2_ESC_H_XDIGIT }, -#endif -#ifdef ONIG_SYN_OP2_INEFFECTIVE_ESCAPE - { "ONIG_SYN_OP2_INEFFECTIVE_ESCAPE", ONIG_SYN_OP2_INEFFECTIVE_ESCAPE }, -#endif -#ifdef ONIG_SYN_CONTEXT_INDEP_ANCHORS - { "ONIG_SYN_CONTEXT_INDEP_ANCHORS", ONIG_SYN_CONTEXT_INDEP_ANCHORS }, -#endif -#ifdef ONIG_SYN_CONTEXT_INDEP_REPEAT_OPS - { "ONIG_SYN_CONTEXT_INDEP_REPEAT_OPS", ONIG_SYN_CONTEXT_INDEP_REPEAT_OPS }, -#endif -#ifdef ONIG_SYN_CONTEXT_INVALID_REPEAT_OPS - { "ONIG_SYN_CONTEXT_INVALID_REPEAT_OPS", ONIG_SYN_CONTEXT_INVALID_REPEAT_OPS }, -#endif -#ifdef ONIG_SYN_ALLOW_UNMATCHED_CLOSE_SUBEXP - { "ONIG_SYN_ALLOW_UNMATCHED_CLOSE_SUBEXP", ONIG_SYN_ALLOW_UNMATCHED_CLOSE_SUBEXP }, -#endif -#ifdef ONIG_SYN_ALLOW_INVALID_INTERVAL - { "ONIG_SYN_ALLOW_INVALID_INTERVAL", ONIG_SYN_ALLOW_INVALID_INTERVAL }, -#endif -#ifdef ONIG_SYN_ALLOW_INTERVAL_LOW_ABBREV - { "ONIG_SYN_ALLOW_INTERVAL_LOW_ABBREV", ONIG_SYN_ALLOW_INTERVAL_LOW_ABBREV }, -#endif -#ifdef ONIG_SYN_STRICT_CHECK_BACKREF - { "ONIG_SYN_STRICT_CHECK_BACKREF", ONIG_SYN_STRICT_CHECK_BACKREF }, -#endif -#ifdef ONIG_SYN_DIFFERENT_LEN_ALT_LOOK_BEHIND - { "ONIG_SYN_DIFFERENT_LEN_ALT_LOOK_BEHIND", ONIG_SYN_DIFFERENT_LEN_ALT_LOOK_BEHIND }, -#endif -#ifdef ONIG_SYN_CAPTURE_ONLY_NAMED_GROUP - { "ONIG_SYN_CAPTURE_ONLY_NAMED_GROUP", ONIG_SYN_CAPTURE_ONLY_NAMED_GROUP }, -#endif -#ifdef ONIG_SYN_ALLOW_MULTIPLEX_DEFINITION_NAME - { "ONIG_SYN_ALLOW_MULTIPLEX_DEFINITION_NAME", ONIG_SYN_ALLOW_MULTIPLEX_DEFINITION_NAME }, -#endif -#ifdef ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY - { "ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY", ONIG_SYN_FIXED_INTERVAL_IS_GREEDY_ONLY }, -#endif -#ifdef ONIG_SYN_NOT_NEWLINE_IN_NEGATIVE_CC - { "ONIG_SYN_NOT_NEWLINE_IN_NEGATIVE_CC", ONIG_SYN_NOT_NEWLINE_IN_NEGATIVE_CC }, -#endif -#ifdef ONIG_SYN_BACKSLASH_ESCAPE_IN_CC - { "ONIG_SYN_BACKSLASH_ESCAPE_IN_CC", ONIG_SYN_BACKSLASH_ESCAPE_IN_CC }, -#endif -#ifdef ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC - { "ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC", ONIG_SYN_ALLOW_EMPTY_RANGE_IN_CC }, -#endif -#ifdef ONIG_SYN_ALLOW_DOUBLE_RANGE_OP_IN_CC - { "ONIG_SYN_ALLOW_DOUBLE_RANGE_OP_IN_CC", ONIG_SYN_ALLOW_DOUBLE_RANGE_OP_IN_CC }, -#endif -#ifdef ONIG_SYN_WARN_CC_OP_NOT_ESCAPED - { "ONIG_SYN_WARN_CC_OP_NOT_ESCAPED", ONIG_SYN_WARN_CC_OP_NOT_ESCAPED }, -#endif -#ifdef ONIG_SYN_WARN_REDUNDANT_NESTED_REPEAT - { "ONIG_SYN_WARN_REDUNDANT_NESTED_REPEAT", ONIG_SYN_WARN_REDUNDANT_NESTED_REPEAT }, -#endif -#ifdef ONIG_META_CHAR_ESCAPE - { "ONIG_META_CHAR_ESCAPE", ONIG_META_CHAR_ESCAPE }, -#endif -#ifdef ONIG_META_CHAR_ANYCHAR - { "ONIG_META_CHAR_ANYCHAR", ONIG_META_CHAR_ANYCHAR }, -#endif -#ifdef ONIG_META_CHAR_ANYTIME - { "ONIG_META_CHAR_ANYTIME", ONIG_META_CHAR_ANYTIME }, -#endif -#ifdef ONIG_META_CHAR_ZERO_OR_ONE_TIME - { "ONIG_META_CHAR_ZERO_OR_ONE_TIME", ONIG_META_CHAR_ZERO_OR_ONE_TIME }, -#endif -#ifdef ONIG_META_CHAR_ONE_OR_MORE_TIME - { "ONIG_META_CHAR_ONE_OR_MORE_TIME", ONIG_META_CHAR_ONE_OR_MORE_TIME }, -#endif -#ifdef ONIG_META_CHAR_ANYCHAR_ANYTIME - { "ONIG_META_CHAR_ANYCHAR_ANYTIME", ONIG_META_CHAR_ANYCHAR_ANYTIME }, -#endif -#ifdef ONIG_INEFFECTIVE_META_CHAR - { "ONIG_INEFFECTIVE_META_CHAR", ONIG_INEFFECTIVE_META_CHAR }, -#endif -#ifdef ONIG_NORMAL - { "ONIG_NORMAL", ONIG_NORMAL }, -#endif -#ifdef ONIG_MISMATCH - { "ONIG_MISMATCH", ONIG_MISMATCH }, -#endif -#ifdef ONIG_NO_SUPPORT_CONFIG - { "ONIG_NO_SUPPORT_CONFIG", ONIG_NO_SUPPORT_CONFIG }, -#endif -#ifdef ONIG_MAX_CAPTURE_HISTORY_GROUP - { "ONIG_MAX_CAPTURE_HISTORY_GROUP", ONIG_MAX_CAPTURE_HISTORY_GROUP }, -#endif -#ifdef ONIG_TRAVERSE_CALLBACK_AT_FIRST - { "ONIG_TRAVERSE_CALLBACK_AT_FIRST", ONIG_TRAVERSE_CALLBACK_AT_FIRST }, -#endif -#ifdef ONIG_TRAVERSE_CALLBACK_AT_LAST - { "ONIG_TRAVERSE_CALLBACK_AT_LAST", ONIG_TRAVERSE_CALLBACK_AT_LAST }, -#endif -#ifdef ONIG_TRAVERSE_CALLBACK_AT_BOTH - { "ONIG_TRAVERSE_CALLBACK_AT_BOTH", ONIG_TRAVERSE_CALLBACK_AT_BOTH }, -#endif -#ifdef ONIG_REGION_NOTPOS - { "ONIG_REGION_NOTPOS", ONIG_REGION_NOTPOS }, -#endif -#ifdef ONIG_CHAR_TABLE_SIZE - { "ONIG_CHAR_TABLE_SIZE", ONIG_CHAR_TABLE_SIZE }, -#endif -#ifdef ONIG_STATE_NORMAL - { "ONIG_STATE_NORMAL", ONIG_STATE_NORMAL }, -#endif -#ifdef ONIG_STATE_SEARCHING - { "ONIG_STATE_SEARCHING", ONIG_STATE_SEARCHING }, -#endif -#ifdef ONIG_STATE_COMPILING - { "ONIG_STATE_COMPILING", ONIG_STATE_COMPILING }, -#endif -#ifdef ONIG_STATE_MODIFY - { "ONIG_STATE_MODIFY", ONIG_STATE_MODIFY }, -#endif - { NULL, 0 } -}; - -static flag_pair onig_error_flags[] = { -#ifdef ONIGERR_MEMORY - { "ONIGERR_MEMORY", ONIGERR_MEMORY }, -#endif -#ifdef ONIGERR_TYPE_BUG - { "ONIGERR_TYPE_BUG", ONIGERR_TYPE_BUG }, -#endif -#ifdef ONIGERR_PARSER_BUG - { "ONIGERR_PARSER_BUG", ONIGERR_PARSER_BUG }, -#endif -#ifdef ONIGERR_STACK_BUG - { "ONIGERR_STACK_BUG", ONIGERR_STACK_BUG }, -#endif -#ifdef ONIGERR_UNDEFINED_BYTECODE - { "ONIGERR_UNDEFINED_BYTECODE", ONIGERR_UNDEFINED_BYTECODE }, -#endif -#ifdef ONIGERR_UNEXPECTED_BYTECODE - { "ONIGERR_UNEXPECTED_BYTECODE", ONIGERR_UNEXPECTED_BYTECODE }, -#endif -#ifdef ONIGERR_MATCH_STACK_LIMIT_OVER - { "ONIGERR_MATCH_STACK_LIMIT_OVER", ONIGERR_MATCH_STACK_LIMIT_OVER }, -#endif -#ifdef ONIGERR_DEFAULT_ENCODING_IS_NOT_SETTED - { "ONIGERR_DEFAULT_ENCODING_IS_NOT_SETTED", ONIGERR_DEFAULT_ENCODING_IS_NOT_SETTED }, -#endif -#ifdef ONIGERR_SPECIFIED_ENCODING_CANT_CONVERT_TO_WIDE_CHAR - { "ONIGERR_SPECIFIED_ENCODING_CANT_CONVERT_TO_WIDE_CHAR", ONIGERR_SPECIFIED_ENCODING_CANT_CONVERT_TO_WIDE_CHAR }, -#endif -#ifdef ONIGERR_INVALID_ARGUMENT - { "ONIGERR_INVALID_ARGUMENT", ONIGERR_INVALID_ARGUMENT }, -#endif -#ifdef ONIGERR_END_PATTERN_AT_LEFT_BRACE - { "ONIGERR_END_PATTERN_AT_LEFT_BRACE", ONIGERR_END_PATTERN_AT_LEFT_BRACE }, -#endif -#ifdef ONIGERR_END_PATTERN_AT_LEFT_BRACKET - { "ONIGERR_END_PATTERN_AT_LEFT_BRACKET", ONIGERR_END_PATTERN_AT_LEFT_BRACKET }, -#endif -#ifdef ONIGERR_EMPTY_CHAR_CLASS - { "ONIGERR_EMPTY_CHAR_CLASS", ONIGERR_EMPTY_CHAR_CLASS }, -#endif -#ifdef ONIGERR_PREMATURE_END_OF_CHAR_CLASS - { "ONIGERR_PREMATURE_END_OF_CHAR_CLASS", ONIGERR_PREMATURE_END_OF_CHAR_CLASS }, -#endif -#ifdef ONIGERR_END_PATTERN_AT_ESCAPE - { "ONIGERR_END_PATTERN_AT_ESCAPE", ONIGERR_END_PATTERN_AT_ESCAPE }, -#endif -#ifdef ONIGERR_END_PATTERN_AT_META - { "ONIGERR_END_PATTERN_AT_META", ONIGERR_END_PATTERN_AT_META }, -#endif -#ifdef ONIGERR_END_PATTERN_AT_CONTROL - { "ONIGERR_END_PATTERN_AT_CONTROL", ONIGERR_END_PATTERN_AT_CONTROL }, -#endif -#ifdef ONIGERR_META_CODE_SYNTAX - { "ONIGERR_META_CODE_SYNTAX", ONIGERR_META_CODE_SYNTAX }, -#endif -#ifdef ONIGERR_CONTROL_CODE_SYNTAX - { "ONIGERR_CONTROL_CODE_SYNTAX", ONIGERR_CONTROL_CODE_SYNTAX }, -#endif -#ifdef ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE - { "ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE", ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE }, -#endif -#ifdef ONIGERR_CHAR_CLASS_VALUE_AT_START_OF_RANGE - { "ONIGERR_CHAR_CLASS_VALUE_AT_START_OF_RANGE", ONIGERR_CHAR_CLASS_VALUE_AT_START_OF_RANGE }, -#endif -#ifdef ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS - { "ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS", ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS }, -#endif -#ifdef ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED - { "ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED", ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED }, -#endif -#ifdef ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID - { "ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID", ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID }, -#endif -#ifdef ONIGERR_NESTED_REPEAT_OPERATOR - { "ONIGERR_NESTED_REPEAT_OPERATOR", ONIGERR_NESTED_REPEAT_OPERATOR }, -#endif -#ifdef ONIGERR_UNMATCHED_CLOSE_PARENTHESIS - { "ONIGERR_UNMATCHED_CLOSE_PARENTHESIS", ONIGERR_UNMATCHED_CLOSE_PARENTHESIS }, -#endif -#ifdef ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS - { "ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS", ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS }, -#endif -#ifdef ONIGERR_END_PATTERN_IN_GROUP - { "ONIGERR_END_PATTERN_IN_GROUP", ONIGERR_END_PATTERN_IN_GROUP }, -#endif -#ifdef ONIGERR_UNDEFINED_GROUP_OPTION - { "ONIGERR_UNDEFINED_GROUP_OPTION", ONIGERR_UNDEFINED_GROUP_OPTION }, -#endif -#ifdef ONIGERR_INVALID_POSIX_BRACKET_TYPE - { "ONIGERR_INVALID_POSIX_BRACKET_TYPE", ONIGERR_INVALID_POSIX_BRACKET_TYPE }, -#endif -#ifdef ONIGERR_INVALID_LOOK_BEHIND_PATTERN - { "ONIGERR_INVALID_LOOK_BEHIND_PATTERN", ONIGERR_INVALID_LOOK_BEHIND_PATTERN }, -#endif -#ifdef ONIGERR_INVALID_REPEAT_RANGE_PATTERN - { "ONIGERR_INVALID_REPEAT_RANGE_PATTERN", ONIGERR_INVALID_REPEAT_RANGE_PATTERN }, -#endif -#ifdef ONIGERR_TOO_BIG_NUMBER - { "ONIGERR_TOO_BIG_NUMBER", ONIGERR_TOO_BIG_NUMBER }, -#endif -#ifdef ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE - { "ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE", ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE }, -#endif -#ifdef ONIGERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE - { "ONIGERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE", ONIGERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE }, -#endif -#ifdef ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS - { "ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS", ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS }, -#endif -#ifdef ONIGERR_MISMATCH_CODE_LENGTH_IN_CLASS_RANGE - { "ONIGERR_MISMATCH_CODE_LENGTH_IN_CLASS_RANGE", ONIGERR_MISMATCH_CODE_LENGTH_IN_CLASS_RANGE }, -#endif -#ifdef ONIGERR_TOO_MANY_MULTI_BYTE_RANGES - { "ONIGERR_TOO_MANY_MULTI_BYTE_RANGES", ONIGERR_TOO_MANY_MULTI_BYTE_RANGES }, -#endif -#ifdef ONIGERR_TOO_SHORT_MULTI_BYTE_STRING - { "ONIGERR_TOO_SHORT_MULTI_BYTE_STRING", ONIGERR_TOO_SHORT_MULTI_BYTE_STRING }, -#endif -#ifdef ONIGERR_TOO_BIG_BACKREF_NUMBER - { "ONIGERR_TOO_BIG_BACKREF_NUMBER", ONIGERR_TOO_BIG_BACKREF_NUMBER }, -#endif -#ifdef ONIGERR_INVALID_BACKREF - { "ONIGERR_INVALID_BACKREF", ONIGERR_INVALID_BACKREF }, -#endif -#ifdef ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED - { "ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED", ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED }, -#endif -#ifdef ONIGERR_TOO_LONG_WIDE_CHAR_VALUE - { "ONIGERR_TOO_LONG_WIDE_CHAR_VALUE", ONIGERR_TOO_LONG_WIDE_CHAR_VALUE }, -#endif -#ifdef ONIGERR_EMPTY_GROUP_NAME - { "ONIGERR_EMPTY_GROUP_NAME", ONIGERR_EMPTY_GROUP_NAME }, -#endif -#ifdef ONIGERR_INVALID_GROUP_NAME - { "ONIGERR_INVALID_GROUP_NAME", ONIGERR_INVALID_GROUP_NAME }, -#endif -#ifdef ONIGERR_INVALID_CHAR_IN_GROUP_NAME - { "ONIGERR_INVALID_CHAR_IN_GROUP_NAME", ONIGERR_INVALID_CHAR_IN_GROUP_NAME }, -#endif -#ifdef ONIGERR_UNDEFINED_NAME_REFERENCE - { "ONIGERR_UNDEFINED_NAME_REFERENCE", ONIGERR_UNDEFINED_NAME_REFERENCE }, -#endif -#ifdef ONIGERR_UNDEFINED_GROUP_REFERENCE - { "ONIGERR_UNDEFINED_GROUP_REFERENCE", ONIGERR_UNDEFINED_GROUP_REFERENCE }, -#endif -#ifdef ONIGERR_MULTIPLEX_DEFINED_NAME - { "ONIGERR_MULTIPLEX_DEFINED_NAME", ONIGERR_MULTIPLEX_DEFINED_NAME }, -#endif -#ifdef ONIGERR_MULTIPLEX_DEFINITION_NAME_CALL - { "ONIGERR_MULTIPLEX_DEFINITION_NAME_CALL", ONIGERR_MULTIPLEX_DEFINITION_NAME_CALL }, -#endif -#ifdef ONIGERR_NEVER_ENDING_RECURSION - { "ONIGERR_NEVER_ENDING_RECURSION", ONIGERR_NEVER_ENDING_RECURSION }, -#endif -#ifdef ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY - { "ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY", ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY }, -#endif -#ifdef ONIGERR_INVALID_CHAR_PROPERTY_NAME - { "ONIGERR_INVALID_CHAR_PROPERTY_NAME", ONIGERR_INVALID_CHAR_PROPERTY_NAME }, -#endif -#ifdef ONIGERR_INVALID_CODE_POINT_VALUE - { "ONIGERR_INVALID_CODE_POINT_VALUE", ONIGERR_INVALID_CODE_POINT_VALUE }, -#endif -#ifdef ONIGERR_INVALID_WIDE_CHAR_VALUE - { "ONIGERR_INVALID_WIDE_CHAR_VALUE", ONIGERR_INVALID_WIDE_CHAR_VALUE }, -#endif -#ifdef ONIGERR_TOO_BIG_WIDE_CHAR_VALUE - { "ONIGERR_TOO_BIG_WIDE_CHAR_VALUE", ONIGERR_TOO_BIG_WIDE_CHAR_VALUE }, -#endif -#ifdef ONIGERR_NOT_SUPPORTED_ENCODING_COMBINATION - { "ONIGERR_NOT_SUPPORTED_ENCODING_COMBINATION", ONIGERR_NOT_SUPPORTED_ENCODING_COMBINATION }, -#endif -#ifdef ONIGERR_INVALID_COMBINATION_OF_OPTIONS - { "ONIGERR_INVALID_COMBINATION_OF_OPTIONS", ONIGERR_INVALID_COMBINATION_OF_OPTIONS }, -#endif -#ifdef ONIGERR_OVER_THREAD_PASS_LIMIT_COUNT - { "ONIGERR_OVER_THREAD_PASS_LIMIT_COUNT", ONIGERR_OVER_THREAD_PASS_LIMIT_COUNT }, -#endif - { NULL, 0 } -}; - -int LOnig_get_flags (lua_State *L) { - const flag_pair* fps[] = { onig_flags, onig_error_flags, NULL }; - return get_flags (L, fps); -} - diff --git a/src/pcre/lpcre.c b/src/pcre/lpcre.c deleted file mode 100644 index 4ecd3b0..0000000 --- a/src/pcre/lpcre.c +++ /dev/null @@ -1,485 +0,0 @@ -/* lpcre.c - Lua binding of PCRE library */ -/* See Copyright Notice in the file LICENSE */ - -#include -#include -#include -#include -#include -#include - -#include "lua.h" -#include "lauxlib.h" -#include "../common.h" - -extern int Lpcre_get_flags (lua_State *L); -extern int Lpcre_config (lua_State *L); -extern flag_pair pcre_error_flags[]; - -/* These 2 settings may be redefined from the command-line or the makefile. - * They should be kept in sync between themselves and with the target name. - */ -#ifndef REX_LIBNAME -# define REX_LIBNAME "rex_pcre" -#endif -#ifndef REX_OPENLIB -# define REX_OPENLIB luaopen_rex_pcre -#endif - -#define REX_TYPENAME REX_LIBNAME"_regex" - -#define ALG_CFLAGS_DFLT 0 -#define ALG_EFLAGS_DFLT 0 - -static int getcflags (lua_State *L, int pos); -#define ALG_GETCFLAGS(L,pos) getcflags(L, pos) - -static void checkarg_compile (lua_State *L, int pos, TArgComp *argC); -#define ALG_GETCARGS(a,b,c) checkarg_compile(a,b,c) - -#define ALG_NOMATCH(res) ((res) == PCRE_ERROR_NOMATCH) -#define ALG_ISMATCH(res) ((res) >= 0) -#define ALG_SUBBEG(ud,n) ud->match[n+n] -#define ALG_SUBEND(ud,n) ud->match[n+n+1] -#define ALG_SUBLEN(ud,n) (ALG_SUBEND(ud,n) - ALG_SUBBEG(ud,n)) -#define ALG_SUBVALID(ud,n) (ALG_SUBBEG(ud,n) >= 0) -#define ALG_NSUB(ud) ((int)ud->ncapt) - -#define ALG_PUSHSUB(L,ud,text,n) \ - lua_pushlstring (L, (text) + ALG_SUBBEG(ud,n), ALG_SUBLEN(ud,n)) - -#define ALG_PUSHSUB_OR_FALSE(L,ud,text,n) \ - (ALG_SUBVALID(ud,n) ? (void) ALG_PUSHSUB (L,ud,text,n) : lua_pushboolean (L,0)) - -#define ALG_PUSHSTART(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBBEG(ud,n) + 1) -#define ALG_PUSHEND(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBEND(ud,n)) -#define ALG_PUSHOFFSETS(L,ud,offs,n) \ - (ALG_PUSHSTART(L,ud,offs,n), ALG_PUSHEND(L,ud,offs,n)) - -#define ALG_BASE(st) 0 -#define ALG_PULL - -typedef struct { - pcre * pr; - pcre_extra * extra; - int * match; - int ncapt; - const unsigned char * tables; - int freed; -} TPcre; - -#define TUserdata TPcre - -#if PCRE_MAJOR >= 4 -static void do_named_subpatterns (lua_State *L, TPcre *ud, const char *text); -# define DO_NAMED_SUBPATTERNS do_named_subpatterns -#endif - -#include "../algo.h" - -/* Locations of the 2 permanent tables in the function environment */ -#define INDEX_CHARTABLES_META 1 /* chartables type's metatable */ -#define INDEX_CHARTABLES_LINK 2 /* link chartables to compiled regex */ - -const char chartables_typename[] = "chartables"; - -/* Functions - ****************************************************************************** - */ - -static int getcflags (lua_State *L, int pos) { - switch (lua_type (L, pos)) { - case LUA_TNONE: - case LUA_TNIL: - return ALG_CFLAGS_DFLT; - case LUA_TNUMBER: - return lua_tointeger (L, pos); - case LUA_TSTRING: { - const char *s = lua_tostring (L, pos); - int res = 0, ch; - while ((ch = *s++) != '\0') { - if (ch == 'i') res |= PCRE_CASELESS; - else if (ch == 'm') res |= PCRE_MULTILINE; - else if (ch == 's') res |= PCRE_DOTALL; - else if (ch == 'x') res |= PCRE_EXTENDED; - else if (ch == 'U') res |= PCRE_UNGREEDY; - else if (ch == 'X') res |= PCRE_EXTRA; - } - return res; - } - default: - return luaL_typerror (L, pos, "number or string"); - } -} - -static int generate_error (lua_State *L, const TPcre *ud, int errcode) { - const char *key = get_flag_key (pcre_error_flags, errcode); - (void) ud; - if (key) - return luaL_error (L, "error PCRE_%s", key); - else - return luaL_error (L, "PCRE error code %d", errcode); -} - -#if PCRE_MAJOR >= 6 -/* method r:dfa_exec (s, [st], [ef], [ovecsize], [wscount]) */ -static void checkarg_dfa_exec (lua_State *L, TArgExec *argE, TPcre **ud) { - *ud = check_ud (L); - argE->text = luaL_checklstring (L, 2, &argE->textlen); - argE->startoffset = get_startoffset (L, 3, argE->textlen); - argE->eflags = (int)luaL_optinteger (L, 4, ALG_EFLAGS_DFLT); - argE->ovecsize = (size_t)luaL_optinteger (L, 5, 100); - argE->wscount = (size_t)luaL_optinteger (L, 6, 50); -} -#endif - -static void push_chartables_meta (lua_State *L) { - lua_pushinteger (L, INDEX_CHARTABLES_META); - lua_rawget (L, ALG_ENVIRONINDEX); -} - -static int Lpcre_maketables (lua_State *L) { - *(const void**)lua_newuserdata (L, sizeof(void*)) = pcre_maketables(); - push_chartables_meta (L); - lua_setmetatable (L, -2); - return 1; -} - -static void **check_chartables (lua_State *L, int pos) { - void **q; - /* Compare the metatable against the C function environment. */ - if (lua_getmetatable(L, pos)) { - push_chartables_meta (L); - if (lua_rawequal(L, -1, -2) && - (q = (void **)lua_touserdata(L, pos)) != NULL) { - lua_pop(L, 2); - return q; - } - } - luaL_argerror(L, pos, lua_pushfstring (L, "not a %s", chartables_typename)); - return NULL; -} - -static int chartables_gc (lua_State *L) { - void **ud = check_chartables (L, 1); - if (*ud) { - pcre_free (*ud); - *ud = NULL; - } - return 0; -} - -static int chartables_tostring (lua_State *L) { - void **ud = check_chartables (L, 1); - lua_pushfstring (L, "%s (%p)", chartables_typename, ud); - return 1; -} - -static void checkarg_compile (lua_State *L, int pos, TArgComp *argC) { - argC->locale = NULL; - argC->tables = NULL; - if (!lua_isnoneornil (L, pos)) { - if (lua_isstring (L, pos)) - argC->locale = lua_tostring (L, pos); - else { - argC->tablespos = pos; - argC->tables = (const unsigned char*) *check_chartables (L, pos); - } - } -} - -static int compile_regex (lua_State *L, const TArgComp *argC, TPcre **pud) { - const char *error; - int erroffset; - TPcre *ud; - const unsigned char *tables = NULL; - - ud = (TPcre*)lua_newuserdata (L, sizeof (TPcre)); - memset (ud, 0, sizeof (TPcre)); /* initialize all members to 0 */ - lua_pushvalue (L, ALG_ENVIRONINDEX); - lua_setmetatable (L, -2); - - if (argC->locale) { - char old_locale[256]; - strcpy (old_locale, setlocale (LC_CTYPE, NULL)); /* store the locale */ - if (NULL == setlocale (LC_CTYPE, argC->locale)) /* set new locale */ - return luaL_error (L, "cannot set locale"); - ud->tables = tables = pcre_maketables (); /* make tables with new locale */ - setlocale (LC_CTYPE, old_locale); /* restore the old locale */ - } - else if (argC->tables) { - tables = argC->tables; - lua_pushinteger (L, INDEX_CHARTABLES_LINK); - lua_rawget (L, ALG_ENVIRONINDEX); - lua_pushvalue (L, -2); - lua_pushvalue (L, argC->tablespos); - lua_rawset (L, -3); - lua_pop (L, 1); - } - - ud->pr = pcre_compile (argC->pattern, argC->cflags, &error, &erroffset, tables); - if (!ud->pr) - return luaL_error (L, "%s (pattern offset: %d)", error, erroffset + 1); - - ud->extra = pcre_study (ud->pr, 0, &error); - if (error) return luaL_error (L, "%s", error); - - pcre_fullinfo (ud->pr, ud->extra, PCRE_INFO_CAPTURECOUNT, &ud->ncapt); - /* need (2 ints per capture, plus one for substring match) * 3/2 */ - ud->match = (int *) Lmalloc (L, (ALG_NSUB(ud) + 1) * 3 * sizeof (int)); - if (!ud->match) - luaL_error (L, "malloc failed"); - - if (pud) *pud = ud; - return 1; -} - -#if PCRE_MAJOR >= 4 -/* the target table must be on lua stack top */ -static void do_named_subpatterns (lua_State *L, TPcre *ud, const char *text) { - int i, namecount, name_entry_size; - unsigned char *name_table, *tabptr; - - /* do named subpatterns - NJG */ - pcre_fullinfo (ud->pr, ud->extra, PCRE_INFO_NAMECOUNT, &namecount); - if (namecount <= 0) - return; - pcre_fullinfo (ud->pr, ud->extra, PCRE_INFO_NAMETABLE, &name_table); - pcre_fullinfo (ud->pr, ud->extra, PCRE_INFO_NAMEENTRYSIZE, &name_entry_size); - tabptr = name_table; - for (i = 0; i < namecount; i++) { - int n = (tabptr[0] << 8) | tabptr[1]; /* number of the capturing parenthesis */ - if (n > 0 && n <= ALG_NSUB(ud)) { /* check range */ - lua_pushstring (L, (char *)tabptr + 2); /* name of the capture, zero terminated */ - ALG_PUSHSUB_OR_FALSE (L, ud, text, n); - lua_rawset (L, -3); - } - tabptr += name_entry_size; - } -} -#endif /* #if PCRE_MAJOR >= 4 */ - -#if PCRE_MAJOR >= 6 -static int Lpcre_dfa_exec (lua_State *L) -{ - TArgExec argE; - TPcre *ud; - int res; - int *buf, *ovector, *wspace; - size_t bufsize; - - checkarg_dfa_exec (L, &argE, &ud); - bufsize = (argE.ovecsize + argE.wscount) * sizeof(int); - buf = (int*) Lmalloc (L, bufsize); - if (!buf) - luaL_error (L, "malloc failed"); - ovector = buf; - wspace = buf + argE.ovecsize; - - res = pcre_dfa_exec (ud->pr, ud->extra, argE.text, (int)argE.textlen, - argE.startoffset, argE.eflags, ovector, argE.ovecsize, wspace, argE.wscount); - - if (ALG_ISMATCH (res) || res == PCRE_ERROR_PARTIAL) { - int i; - int max = (res>0) ? res : (res==0) ? (int)argE.ovecsize/2 : 1; - lua_pushinteger (L, ovector[0] + 1); /* 1-st return value */ - lua_newtable (L); /* 2-nd return value */ - for (i=0; i= 6 */ - -static int gmatch_exec (TUserdata *ud, TArgExec *argE) { - return pcre_exec (ud->pr, ud->extra, argE->text, argE->textlen, - argE->startoffset, argE->eflags, ud->match, (ALG_NSUB(ud) + 1) * 3); -} - -static void gmatch_pushsubject (lua_State *L, TArgExec *argE) { - lua_pushlstring (L, argE->text, argE->textlen); -} - -static int findmatch_exec (TPcre *ud, TArgExec *argE) { - return pcre_exec (ud->pr, ud->extra, argE->text, argE->textlen, - argE->startoffset, argE->eflags, ud->match, (ALG_NSUB(ud) + 1) * 3); -} - -static int gsub_exec (TPcre *ud, TArgExec *argE, int st) { - return pcre_exec (ud->pr, ud->extra, argE->text, argE->textlen, - st, argE->eflags, ud->match, (ALG_NSUB(ud) + 1) * 3); -} - -static int split_exec (TPcre *ud, TArgExec *argE, int offset) { - return pcre_exec (ud->pr, ud->extra, argE->text, argE->textlen, offset, - argE->eflags, ud->match, (ALG_NSUB(ud) + 1) * 3); -} - -static int Lpcre_gc (lua_State *L) { - TPcre *ud = check_ud (L); - if (ud->freed == 0) { /* precaution against "manual" __gc calling */ - ud->freed = 1; - if (ud->pr) pcre_free (ud->pr); - if (ud->extra) pcre_free (ud->extra); - if (ud->tables) pcre_free ((void *)ud->tables); - Lfree (L, ud->match, (ALG_NSUB(ud) + 1) * 3 * sizeof (int)); - } - return 0; -} - -static int Lpcre_tostring (lua_State *L) { - TPcre *ud = check_ud (L); - if (ud->freed == 0) - lua_pushfstring (L, "%s (%p)", REX_TYPENAME, (void*)ud); - else - lua_pushfstring (L, "%s (deleted)", REX_TYPENAME); - return 1; -} - -static int Lpcre_version (lua_State *L) { - lua_pushstring (L, pcre_version ()); - return 1; -} - -#define SET_INFO_FIELD(L,ud,what,name,valtype) { \ - valtype val; \ - if (0 == pcre_fullinfo (ud->pr, ud->extra, what, &val)) { \ - lua_pushnumber (L, val); \ - lua_setfield (L, -2, name); \ - } \ -} - -static int Lpcre_fullinfo (lua_State *L) { - TPcre *ud = check_ud (L); - lua_newtable(L); - - SET_INFO_FIELD (L, ud, PCRE_INFO_BACKREFMAX, "BACKREFMAX", int) - SET_INFO_FIELD (L, ud, PCRE_INFO_CAPTURECOUNT, "CAPTURECOUNT", int) - SET_INFO_FIELD (L, ud, PCRE_INFO_FIRSTBYTE, "FIRSTBYTE", int) - SET_INFO_FIELD (L, ud, PCRE_INFO_HASCRORLF, "HASCRORLF", int) - SET_INFO_FIELD (L, ud, PCRE_INFO_JCHANGED, "JCHANGED", int) -#ifdef PCRE_INFO_JIT - SET_INFO_FIELD (L, ud, PCRE_INFO_JIT, "JIT", int) -#endif -#ifdef PCRE_INFO_JITSIZE - SET_INFO_FIELD (L, ud, PCRE_INFO_JITSIZE, "JITSIZE", size_t); -#endif -#ifdef PCRE_INFO_MATCH_EMPTY - SET_INFO_FIELD (L, ud, PCRE_INFO_MATCH_EMPTY, "MATCH_EMPTY", int) -#endif -#ifdef PCRE_INFO_MATCHLIMIT - SET_INFO_FIELD (L, ud, PCRE_INFO_MATCHLIMIT, "MATCHLIMIT", uint32_t) -#endif -#ifdef PCRE_INFO_MAXLOOKBEHIND - SET_INFO_FIELD (L, ud, PCRE_INFO_MAXLOOKBEHIND, "MAXLOOKBEHIND", int) /* int ? */ -#endif -#ifdef PCRE_INFO_MINLENGTH - SET_INFO_FIELD (L, ud, PCRE_INFO_MINLENGTH, "MINLENGTH", int) -#endif - SET_INFO_FIELD (L, ud, PCRE_INFO_OKPARTIAL, "OKPARTIAL", int) - SET_INFO_FIELD (L, ud, PCRE_INFO_OPTIONS, "OPTIONS", unsigned long) -#ifdef PCRE_INFO_RECURSIONLIMIT - SET_INFO_FIELD (L, ud, PCRE_INFO_RECURSIONLIMIT, "RECURSIONLIMIT", uint32_t) -#endif - SET_INFO_FIELD (L, ud, PCRE_INFO_SIZE, "SIZE", size_t) - SET_INFO_FIELD (L, ud, PCRE_INFO_STUDYSIZE, "STUDYSIZE", size_t) -#ifdef PCRE_INFO_FIRSTCHARACTERFLAGS - SET_INFO_FIELD (L, ud, PCRE_INFO_FIRSTCHARACTERFLAGS, "FIRSTCHARACTERFLAGS", int) -#endif -#ifdef PCRE_INFO_FIRSTCHARACTER - SET_INFO_FIELD (L, ud, PCRE_INFO_FIRSTCHARACTER, "FIRSTCHARACTER", uint32_t) -#endif -#ifdef PCRE_INFO_REQUIREDCHARFLAGS - SET_INFO_FIELD (L, ud, PCRE_INFO_REQUIREDCHARFLAGS, "REQUIREDCHARFLAGS", int) -#endif -#ifdef PCRE_INFO_REQUIREDCHAR - SET_INFO_FIELD (L, ud, PCRE_INFO_REQUIREDCHAR, "REQUIREDCHAR", uint32_t) -#endif - - return 1; -} - -static const luaL_Reg chartables_meta[] = { - { "__gc", chartables_gc }, - { "__tostring", chartables_tostring }, - { NULL, NULL } -}; - -static const luaL_Reg r_methods[] = { - { "exec", algm_exec }, - { "tfind", algm_tfind }, /* old name: match */ - { "find", algm_find }, - { "match", algm_match }, -#if PCRE_MAJOR >= 6 - { "dfa_exec", Lpcre_dfa_exec }, -#endif - { "fullinfo", Lpcre_fullinfo }, - { "__gc", Lpcre_gc }, - { "__tostring", Lpcre_tostring }, - { NULL, NULL } -}; - -static const luaL_Reg r_functions[] = { - { "match", algf_match }, - { "find", algf_find }, - { "gmatch", algf_gmatch }, - { "gsub", algf_gsub }, - { "count", algf_count }, - { "split", algf_split }, - { "new", algf_new }, - { "flags", Lpcre_get_flags }, - { "version", Lpcre_version }, - { "maketables", Lpcre_maketables }, -#if PCRE_MAJOR >= 4 - { "config", Lpcre_config }, -#endif - { NULL, NULL } -}; - -/* Open the library */ -REX_API int REX_OPENLIB (lua_State *L) { - if (PCRE_MAJOR > atoi (pcre_version ())) { - return luaL_error (L, "%s requires at least version %d of PCRE library", - REX_LIBNAME, (int)PCRE_MAJOR); - } - - alg_register(L, r_methods, r_functions, "PCRE"); - - /* create a table and register it as a metatable for "chartables" userdata */ - lua_newtable (L); - lua_pushliteral (L, "access denied"); - lua_setfield (L, -2, "__metatable"); -#if LUA_VERSION_NUM == 501 - luaL_register (L, NULL, chartables_meta); - lua_rawseti (L, LUA_ENVIRONINDEX, INDEX_CHARTABLES_META); -#else - lua_pushvalue(L, -3); - luaL_setfuncs (L, chartables_meta, 1); - lua_rawseti (L, -3, INDEX_CHARTABLES_META); -#endif - - /* create a table for connecting "chartables" userdata to "regex" userdata */ - lua_newtable (L); - lua_pushliteral (L, "k"); /* weak keys */ - lua_setfield (L, -2, "__mode"); - lua_pushvalue (L, -1); /* setmetatable (tb, tb) */ - lua_setmetatable (L, -2); -#if LUA_VERSION_NUM == 501 - lua_rawseti (L, LUA_ENVIRONINDEX, INDEX_CHARTABLES_LINK); -#else - lua_rawseti (L, -3, INDEX_CHARTABLES_LINK); -#endif - - return 1; -} diff --git a/src/pcre/lpcre_f.c b/src/pcre/lpcre_f.c deleted file mode 100644 index 0b4883d..0000000 --- a/src/pcre/lpcre_f.c +++ /dev/null @@ -1,228 +0,0 @@ -/* lpcre.c - PCRE regular expression library */ -/* See Copyright Notice in the file LICENSE */ - -#include -#include "lua.h" -#include "lauxlib.h" -#include "../common.h" - -#define VERSION_PCRE (PCRE_MAJOR*100 + PCRE_MINOR) - -static flag_pair pcre_flags[] = { - { "MAJOR", PCRE_MAJOR }, - { "MINOR", PCRE_MINOR }, -/*---------------------------------------------------------------------------*/ - { "CASELESS", PCRE_CASELESS }, - { "MULTILINE", PCRE_MULTILINE }, - { "DOTALL", PCRE_DOTALL }, - { "EXTENDED", PCRE_EXTENDED }, - { "ANCHORED", PCRE_ANCHORED }, - { "DOLLAR_ENDONLY", PCRE_DOLLAR_ENDONLY }, - { "EXTRA", PCRE_EXTRA }, - { "NOTBOL", PCRE_NOTBOL }, - { "NOTEOL", PCRE_NOTEOL }, - { "UNGREEDY", PCRE_UNGREEDY }, - { "NOTEMPTY", PCRE_NOTEMPTY }, - { "UTF8", PCRE_UTF8 }, -#if VERSION_PCRE >= 400 - { "NO_AUTO_CAPTURE", PCRE_NO_AUTO_CAPTURE }, - { "NO_UTF8_CHECK", PCRE_NO_UTF8_CHECK }, -#endif -#if VERSION_PCRE >= 500 - { "AUTO_CALLOUT", PCRE_AUTO_CALLOUT }, - { "PARTIAL", PCRE_PARTIAL }, -#endif -#ifdef PCRE_PARTIAL_SOFT - { "PARTIAL_SOFT", PCRE_PARTIAL_SOFT }, -#endif -#if VERSION_PCRE >= 600 - { "DFA_SHORTEST", PCRE_DFA_SHORTEST }, - { "DFA_RESTART", PCRE_DFA_RESTART }, - { "FIRSTLINE", PCRE_FIRSTLINE }, -#endif -#if VERSION_PCRE >= 607 - { "DUPNAMES", PCRE_DUPNAMES }, - { "NEWLINE_CR", PCRE_NEWLINE_CR }, - { "NEWLINE_LF", PCRE_NEWLINE_LF }, - { "NEWLINE_CRLF", PCRE_NEWLINE_CRLF }, -#endif -#if VERSION_PCRE >= 700 - { "NEWLINE_ANY", PCRE_NEWLINE_ANY }, -#endif -#if VERSION_PCRE >= 701 - { "NEWLINE_ANYCRLF", PCRE_NEWLINE_ANYCRLF }, -#endif -#if VERSION_PCRE >= 704 - { "BSR_ANYCRLF", PCRE_BSR_ANYCRLF }, - { "BSR_UNICODE", PCRE_BSR_UNICODE }, -#endif -#if VERSION_PCRE >= 707 - { "JAVASCRIPT_COMPAT", PCRE_JAVASCRIPT_COMPAT }, -#endif -#ifdef PCRE_NO_START_OPTIMIZE - { "NO_START_OPTIMIZE", PCRE_NO_START_OPTIMIZE }, -#endif -#ifdef PCRE_NO_START_OPTIMISE - { "NO_START_OPTIMISE", PCRE_NO_START_OPTIMISE }, -#endif -#ifdef PCRE_PARTIAL_HARD - { "PARTIAL_HARD", PCRE_PARTIAL_HARD }, -#endif -#ifdef PCRE_NOTEMPTY_ATSTART - { "NOTEMPTY_ATSTART", PCRE_NOTEMPTY_ATSTART }, -#endif -#ifdef PCRE_UCP - { "UCP", PCRE_UCP }, -#endif -/*---------------------------------------------------------------------------*/ - { "INFO_OPTIONS", PCRE_INFO_OPTIONS }, - { "INFO_SIZE", PCRE_INFO_SIZE }, - { "INFO_CAPTURECOUNT", PCRE_INFO_CAPTURECOUNT }, - { "INFO_BACKREFMAX", PCRE_INFO_BACKREFMAX }, -#if VERSION_PCRE >= 400 - { "INFO_FIRSTBYTE", PCRE_INFO_FIRSTBYTE }, -#endif - { "INFO_FIRSTCHAR", PCRE_INFO_FIRSTCHAR }, - { "INFO_FIRSTTABLE", PCRE_INFO_FIRSTTABLE }, - { "INFO_LASTLITERAL", PCRE_INFO_LASTLITERAL }, -#if VERSION_PCRE >= 400 - { "INFO_NAMEENTRYSIZE", PCRE_INFO_NAMEENTRYSIZE }, - { "INFO_NAMECOUNT", PCRE_INFO_NAMECOUNT }, - { "INFO_NAMETABLE", PCRE_INFO_NAMETABLE }, - { "INFO_STUDYSIZE", PCRE_INFO_STUDYSIZE }, -#endif -#if VERSION_PCRE >= 500 - { "INFO_DEFAULT_TABLES", PCRE_INFO_DEFAULT_TABLES }, -#endif -#ifdef PCRE_INFO_OKPARTIAL - { "INFO_OKPARTIAL", PCRE_INFO_OKPARTIAL }, -#endif -#ifdef PCRE_INFO_JCHANGED - { "INFO_JCHANGED", PCRE_INFO_JCHANGED }, -#endif -#ifdef PCRE_INFO_HASCRORLF - { "INFO_HASCRORLF", PCRE_INFO_HASCRORLF }, -#endif -#ifdef PCRE_INFO_MINLENGTH - { "INFO_MINLENGTH", PCRE_INFO_MINLENGTH }, -#endif -#ifdef PCRE_INFO_JIT - { "INFO_JIT", PCRE_INFO_JIT }, -#endif -#ifdef PCRE_INFO_JITSIZE - { "INFO_JITSIZE", PCRE_INFO_JITSIZE }, -#endif -/*---------------------------------------------------------------------------*/ -#if VERSION_PCRE >= 400 - { "EXTRA_STUDY_DATA", PCRE_EXTRA_STUDY_DATA }, - { "EXTRA_MATCH_LIMIT", PCRE_EXTRA_MATCH_LIMIT }, - { "EXTRA_CALLOUT_DATA", PCRE_EXTRA_CALLOUT_DATA }, -#endif -#if VERSION_PCRE >= 500 - { "EXTRA_TABLES", PCRE_EXTRA_TABLES }, -#endif -#ifdef PCRE_EXTRA_MATCH_LIMIT_RECURSION - { "EXTRA_MATCH_LIMIT_RECURSION", PCRE_EXTRA_MATCH_LIMIT_RECURSION }, -#endif -#ifdef PCRE_EXTRA_MARK - { "EXTRA_MARK", PCRE_EXTRA_MARK }, -#endif -/*---------------------------------------------------------------------------*/ - { NULL, 0 } -}; - -flag_pair pcre_error_flags[] = { - { "ERROR_NOMATCH", PCRE_ERROR_NOMATCH }, - { "ERROR_NULL", PCRE_ERROR_NULL }, - { "ERROR_BADOPTION", PCRE_ERROR_BADOPTION }, - { "ERROR_BADMAGIC", PCRE_ERROR_BADMAGIC }, -#if VERSION_PCRE >= 700 - { "ERROR_UNKNOWN_OPCODE", PCRE_ERROR_UNKNOWN_OPCODE }, -#endif - { "ERROR_UNKNOWN_NODE", PCRE_ERROR_UNKNOWN_NODE }, - { "ERROR_NOMEMORY", PCRE_ERROR_NOMEMORY }, - { "ERROR_NOSUBSTRING", PCRE_ERROR_NOSUBSTRING }, -#if VERSION_PCRE >= 400 - { "ERROR_MATCHLIMIT", PCRE_ERROR_MATCHLIMIT }, - { "ERROR_CALLOUT", PCRE_ERROR_CALLOUT }, - { "ERROR_BADUTF8", PCRE_ERROR_BADUTF8 }, - { "ERROR_BADUTF8_OFFSET", PCRE_ERROR_BADUTF8_OFFSET }, -#endif -#if VERSION_PCRE >= 500 - { "ERROR_PARTIAL", PCRE_ERROR_PARTIAL }, - { "ERROR_BADPARTIAL", PCRE_ERROR_BADPARTIAL }, - { "ERROR_INTERNAL", PCRE_ERROR_INTERNAL }, - { "ERROR_BADCOUNT", PCRE_ERROR_BADCOUNT }, -#endif -#if VERSION_PCRE >= 600 - { "ERROR_DFA_UITEM", PCRE_ERROR_DFA_UITEM }, - { "ERROR_DFA_UCOND", PCRE_ERROR_DFA_UCOND }, - { "ERROR_DFA_UMLIMIT", PCRE_ERROR_DFA_UMLIMIT }, - { "ERROR_DFA_WSSIZE", PCRE_ERROR_DFA_WSSIZE }, - { "ERROR_DFA_RECURSE", PCRE_ERROR_DFA_RECURSE }, -#endif -#if VERSION_PCRE >= 607 - { "ERROR_RECURSIONLIMIT", PCRE_ERROR_RECURSIONLIMIT }, -#endif -#if VERSION_PCRE >= 700 - { "ERROR_BADNEWLINE", PCRE_ERROR_BADNEWLINE }, -#endif -#ifdef PCRE_ERROR_NULLWSLIMIT - { "ERROR_NULLWSLIMIT", PCRE_ERROR_NULLWSLIMIT }, -#endif -#ifdef PCRE_ERROR_BADOFFSET - { "ERROR_BADOFFSET", PCRE_ERROR_BADOFFSET }, -#endif -#ifdef PCRE_ERROR_SHORTUTF8 - { "ERROR_SHORTUTF8", PCRE_ERROR_SHORTUTF8 }, -#endif -#ifdef PCRE_ERROR_RECURSELOOP - { "ERROR_RECURSELOOP", PCRE_ERROR_RECURSELOOP }, -#endif -/*---------------------------------------------------------------------------*/ - { NULL, 0 } -}; - -#if VERSION_PCRE >= 400 -static flag_pair pcre_config_flags[] = { - { "CONFIG_UTF8", PCRE_CONFIG_UTF8 }, - { "CONFIG_NEWLINE", PCRE_CONFIG_NEWLINE }, - { "CONFIG_LINK_SIZE", PCRE_CONFIG_LINK_SIZE }, - { "CONFIG_POSIX_MALLOC_THRESHOLD", PCRE_CONFIG_POSIX_MALLOC_THRESHOLD }, - { "CONFIG_MATCH_LIMIT", PCRE_CONFIG_MATCH_LIMIT }, - { "CONFIG_STACKRECURSE", PCRE_CONFIG_STACKRECURSE }, -#if VERSION_PCRE >= 500 - { "CONFIG_UNICODE_PROPERTIES", PCRE_CONFIG_UNICODE_PROPERTIES }, -#endif -#if VERSION_PCRE >= 650 - { "CONFIG_MATCH_LIMIT_RECURSION", PCRE_CONFIG_MATCH_LIMIT_RECURSION }, -#endif -#if VERSION_PCRE >= 704 - { "CONFIG_BSR", PCRE_CONFIG_BSR }, -#endif -/*---------------------------------------------------------------------------*/ - { NULL, 0 } -}; - -int Lpcre_config (lua_State *L) { - int val; - flag_pair *fp; - if (lua_istable (L, 1)) - lua_settop (L, 1); - else - lua_newtable (L); - for (fp = pcre_config_flags; fp->key; ++fp) { - if (0 == pcre_config (fp->val, &val)) { - lua_pushinteger (L, val); - lua_setfield (L, -2, fp->key); - } - } - return 1; -} -#endif /* #if VERSION_PCRE >= 400 */ - -int Lpcre_get_flags (lua_State *L) { - const flag_pair* fps[] = { pcre_flags, pcre_error_flags, NULL }; - return get_flags (L, fps); -} - diff --git a/src/posix/lposix.c b/src/posix/lposix.c deleted file mode 100644 index bc87c4f..0000000 --- a/src/posix/lposix.c +++ /dev/null @@ -1,278 +0,0 @@ -/* lposix.c - Lua binding of POSIX regular expressions library */ -/* See Copyright Notice in the file LICENSE */ - -#include -#include -#include -#include "lua.h" -#include "lauxlib.h" -#include "../common.h" - -#ifndef REX_POSIX_INCLUDE -# include -#else -# include REX_POSIX_INCLUDE -#endif - -/* These 2 settings may be redefined from the command-line or the makefile. - * They should be kept in sync between themselves and with the target name. - */ -#ifndef REX_LIBNAME -# define REX_LIBNAME "rex_posix" -#endif -#ifndef REX_OPENLIB -# define REX_OPENLIB luaopen_rex_posix -#endif - -#define REX_TYPENAME REX_LIBNAME"_regex" - -/* Test if regex.h corresponds to the extended POSIX library, i.e. H. Spencer's. - This test may not work as intended if regex.h introduced REG_BASIC, etc. - via enum rather than #define. - If that's the case, add -DREX_POSIX_EXT in the makefile/command line. - The same applies to REG_STARTEND. -*/ -#ifndef REX_POSIX_EXT -# if defined(REG_BASIC) && defined(REG_STARTEND) -# define REX_POSIX_EXT -# endif -#endif - -#define ALG_CFLAGS_DFLT REG_EXTENDED -#ifdef REG_STARTEND -# define ALG_EFLAGS_DFLT REG_STARTEND -#else -# define ALG_EFLAGS_DFLT 0 -#endif - -#define ALG_NOMATCH(res) ((res) == REG_NOMATCH) -#define ALG_ISMATCH(res) ((res) == 0) -#define ALG_SUBBEG(ud,n) ud->match[n].rm_so -#define ALG_SUBEND(ud,n) ud->match[n].rm_eo -#define ALG_SUBLEN(ud,n) (ALG_SUBEND(ud,n) - ALG_SUBBEG(ud,n)) -#define ALG_SUBVALID(ud,n) (ALG_SUBBEG(ud,n) >= 0) -#ifdef REX_NSUB_BASE1 -# define ALG_NSUB(ud) ((int)ud->r.re_nsub - 1) -#else -# define ALG_NSUB(ud) ((int)ud->r.re_nsub) -#endif - -#define ALG_PUSHSUB(L,ud,text,n) \ - lua_pushlstring (L, (text) + ALG_SUBBEG(ud,n), ALG_SUBLEN(ud,n)) - -#define ALG_PUSHSUB_OR_FALSE(L,ud,text,n) \ - (ALG_SUBVALID(ud,n) ? (void) ALG_PUSHSUB (L,ud,text,n) : lua_pushboolean (L,0)) - -#define ALG_PUSHSTART(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBBEG(ud,n) + 1) -#define ALG_PUSHEND(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBEND(ud,n)) -#define ALG_PUSHOFFSETS(L,ud,offs,n) \ - (ALG_PUSHSTART(L,ud,offs,n), ALG_PUSHEND(L,ud,offs,n)) - -#define ALG_BASE(st) (st) -#define ALG_GETCFLAGS(L,pos) (int)luaL_optinteger(L, pos, ALG_CFLAGS_DFLT) - -typedef struct { - regex_t r; - regmatch_t * match; - int freed; -} TPosix; - -#define TUserdata TPosix - -#include "../algo.h" - -/* Functions - ****************************************************************************** - */ - -static int generate_error (lua_State *L, const TPosix *ud, int errcode) { - char errbuf[80]; - regerror (errcode, &ud->r, errbuf, sizeof (errbuf)); - return luaL_error (L, "%s", errbuf); -} - -static int compile_regex (lua_State *L, const TArgComp *argC, TPosix **pud) { - int res; - TPosix *ud; - - ud = (TPosix *)lua_newuserdata (L, sizeof (TPosix)); - memset (ud, 0, sizeof (TPosix)); /* initialize all members to 0 */ - -#ifdef REX_POSIX_EXT - if (argC->cflags & REG_PEND) - ud->r.re_endp = argC->pattern + argC->patlen; -#endif - - res = regcomp (&ud->r, argC->pattern, argC->cflags); - if (res != 0) - return generate_error (L, ud, res); - - if (argC->cflags & REG_NOSUB) - ud->r.re_nsub = 0; - ud->match = (regmatch_t *) Lmalloc (L, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); - if (!ud->match) - luaL_error (L, "malloc failed"); - lua_pushvalue (L, ALG_ENVIRONINDEX); - lua_setmetatable (L, -2); - - if (pud) *pud = ud; - return 1; -} - -static int gmatch_exec (TUserdata *ud, TArgExec *argE) { - if (argE->startoffset > 0) - argE->eflags |= REG_NOTBOL; - -#ifdef REG_STARTEND - if (argE->eflags & REG_STARTEND) { - ALG_SUBBEG(ud,0) = 0; - ALG_SUBEND(ud,0) = argE->textlen - argE->startoffset; - } -#endif - - argE->text += argE->startoffset; - return regexec (&ud->r, argE->text, ALG_NSUB(ud) + 1, ud->match, argE->eflags); -} - -static void gmatch_pushsubject (lua_State *L, TArgExec *argE) { -#ifdef REG_STARTEND - if (argE->eflags & REG_STARTEND) - lua_pushlstring (L, argE->text, argE->textlen); - else -#endif - lua_pushstring (L, argE->text); -} - -static int findmatch_exec (TPosix *ud, TArgExec *argE) { -#ifdef REG_STARTEND - if (argE->eflags & REG_STARTEND) { - ud->match[0].rm_so = argE->startoffset; - ud->match[0].rm_eo = argE->textlen; - argE->startoffset = 0; - } - else -#endif - argE->text += argE->startoffset; - return regexec (&ud->r, argE->text, ALG_NSUB(ud) + 1, ud->match, argE->eflags); -} - -static int gsub_exec (TPosix *ud, TArgExec *argE, int st) { -#ifdef REG_STARTEND - if(argE->eflags & REG_STARTEND) { - ALG_SUBBEG(ud,0) = 0; - ALG_SUBEND(ud,0) = argE->textlen - st; - } -#endif - if (st > 0) - argE->eflags |= REG_NOTBOL; - return regexec (&ud->r, argE->text+st, ALG_NSUB(ud)+1, ud->match, argE->eflags); -} - -static int split_exec (TPosix *ud, TArgExec *argE, int offset) { -#ifdef REG_STARTEND - if (argE->eflags & REG_STARTEND) { - ALG_SUBBEG(ud,0) = 0; - ALG_SUBEND(ud,0) = argE->textlen - offset; - } -#endif - if (offset > 0) - argE->eflags |= REG_NOTBOL; - - return regexec (&ud->r, argE->text + offset, ALG_NSUB(ud) + 1, ud->match, argE->eflags); -} - -static int Posix_gc (lua_State *L) { - TPosix *ud = check_ud (L); - if (ud->freed == 0) { /* precaution against "manual" __gc calling */ - ud->freed = 1; - regfree (&ud->r); - Lfree (L, ud->match, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); - } - return 0; -} - -static int Posix_tostring (lua_State *L) { - TPosix *ud = check_ud (L); - if (ud->freed == 0) - lua_pushfstring (L, "%s (%p)", REX_TYPENAME, (void*)ud); - else - lua_pushfstring (L, "%s (deleted)", REX_TYPENAME); - return 1; -} - -static flag_pair posix_flags[] = -{ -#ifdef REX_POSIX_EXT - { "BASIC", REG_BASIC }, - { "NOSPEC", REG_NOSPEC }, - { "PEND", REG_PEND }, -#endif -#ifdef REG_STARTEND - { "STARTEND", REG_STARTEND }, -#endif - { "EXTENDED", REG_EXTENDED }, - { "ICASE", REG_ICASE }, - { "NOSUB", REG_NOSUB }, - { "NEWLINE", REG_NEWLINE }, - { "NOTBOL", REG_NOTBOL }, - { "NOTEOL", REG_NOTEOL }, -/*---------------------------------------------------------------------------*/ - { NULL, 0 } -}; - -static flag_pair posix_error_flags[] = { - { "NOMATCH", REG_NOMATCH }, - { "BADPAT", REG_BADPAT }, - { "ECOLLATE", REG_ECOLLATE }, - { "ECTYPE", REG_ECTYPE }, - { "EESCAPE", REG_EESCAPE }, - { "ESUBREG", REG_ESUBREG }, - { "EBRACK", REG_EBRACK }, - { "EPAREN", REG_EPAREN }, - { "EBRACE", REG_EBRACE }, - { "BADBR", REG_BADBR }, - { "ERANGE", REG_ERANGE }, - { "ESPACE", REG_ESPACE }, - { "BADRPT", REG_BADRPT }, -#ifdef REX_POSIX_EXT - { "EMPTY", REG_EMPTY }, - { "ASSERT", REG_ASSERT }, - { "INVARG", REG_INVARG }, -#endif -/*---------------------------------------------------------------------------*/ - { NULL, 0 } -}; - -static int Posix_get_flags (lua_State *L) { - const flag_pair* fps[] = { posix_flags, posix_error_flags, NULL }; - return get_flags (L, fps); -} - -static const luaL_Reg r_methods[] = { - { "exec", algm_exec }, - { "tfind", algm_tfind }, /* old match */ - { "find", algm_find }, - { "match", algm_match }, - { "__gc", Posix_gc }, - { "__tostring", Posix_tostring }, - { NULL, NULL} -}; - -static const luaL_Reg r_functions[] = { - { "match", algf_match }, - { "find", algf_find }, - { "gmatch", algf_gmatch }, - { "gsub", algf_gsub }, - { "count", algf_count }, - { "split", algf_split }, - { "new", algf_new }, - { "flags", Posix_get_flags }, - { NULL, NULL } -}; - -/* Open the library */ -REX_API int REX_OPENLIB (lua_State *L) -{ - alg_register(L, r_methods, r_functions, "POSIX regexes"); - return 1; -} diff --git a/src/tre/ltre.c b/src/tre/ltre.c deleted file mode 100644 index a3aef82..0000000 --- a/src/tre/ltre.c +++ /dev/null @@ -1,351 +0,0 @@ -/* ltre.c - Lua binding of TRE regular expressions library */ -/* See Copyright Notice in the file LICENSE */ - -#include -#include -#include -#include "lua.h" -#include "lauxlib.h" -#include "../common.h" -extern void add_wide_lib (lua_State *L); - -#include - -/* These 2 settings may be redefined from the command-line or the makefile. - * They should be kept in sync between themselves and with the target name. - */ -#ifndef REX_LIBNAME -# define REX_LIBNAME "rex_tre" -#endif -#ifndef REX_OPENLIB -# define REX_OPENLIB luaopen_rex_tre -#endif - -#define REX_TYPENAME REX_LIBNAME"_regex" - -#define ALG_CFLAGS_DFLT REG_EXTENDED -#define ALG_EFLAGS_DFLT 0 - -#define ALG_NOMATCH(res) ((res) == REG_NOMATCH) -#define ALG_ISMATCH(res) ((res) == 0) -#define ALG_SUBBEG(ud,n) ud->match[n].rm_so -#define ALG_SUBEND(ud,n) ud->match[n].rm_eo -#define ALG_SUBLEN(ud,n) (ALG_SUBEND(ud,n) - ALG_SUBBEG(ud,n)) -#define ALG_SUBVALID(ud,n) (ALG_SUBBEG(ud,n) >= 0) -#define ALG_NSUB(ud) ((int)ud->r.re_nsub) - -#define ALG_PUSHSUB(L,ud,text,n) \ - lua_pushlstring (L, (text) + ALG_SUBBEG(ud,n), ALG_SUBLEN(ud,n)) - -#define ALG_PUSHSUB_OR_FALSE(L,ud,text,n) \ - (ALG_SUBVALID(ud,n) ? (void) ALG_PUSHSUB (L,ud,text,n) : lua_pushboolean (L,0)) - -#define ALG_PUSHSTART(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBBEG(ud,n) + 1) -#define ALG_PUSHEND(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBEND(ud,n)) -#define ALG_PUSHOFFSETS(L,ud,offs,n) \ - (ALG_PUSHSTART(L,ud,offs,n), ALG_PUSHEND(L,ud,offs,n)) - -#define ALG_BASE(st) (st) -#define ALG_GETCFLAGS(L,pos) (int)luaL_optinteger(L, pos, ALG_CFLAGS_DFLT) - -typedef struct { - regex_t r; - regmatch_t * match; - int freed; -} TPosix; - -#define TUserdata TPosix - -#include "../algo.h" - -/* Functions - ****************************************************************************** - */ - -static void checkarg_regaparams (lua_State *L, int stackpos, regaparams_t *argP) { - if (lua_type (L, stackpos) != LUA_TTABLE) /* allow for userdata? */ - luaL_argerror (L, stackpos, "table expected"); - lua_pushvalue (L, stackpos); - argP->cost_ins = get_int_field (L, "cost_ins"); - argP->cost_del = get_int_field (L, "cost_del"); - argP->cost_subst = get_int_field (L, "cost_subst"); - argP->max_cost = get_int_field (L, "max_cost"); - argP->max_ins = get_int_field (L, "max_ins"); - argP->max_del = get_int_field (L, "max_del"); - argP->max_subst = get_int_field (L, "max_subst"); - argP->max_err = get_int_field (L, "max_err"); - lua_pop (L, 1); -} - -/* method r:atfind (s, params, [st], [ef]) */ -/* method r:aexec (s, params, [st], [ef]) */ -static void checkarg_atfind (lua_State *L, TArgExec *argE, TPosix **ud, - regaparams_t *argP) { - *ud = check_ud (L); - argE->text = luaL_checklstring (L, 2, &argE->textlen); - checkarg_regaparams (L, 3, argP); - argE->startoffset = get_startoffset (L, 4, argE->textlen); - argE->eflags = (int)luaL_optinteger (L, 5, ALG_EFLAGS_DFLT); -} - -static int generate_error (lua_State *L, const TPosix *ud, int errcode) { - char errbuf[80]; - tre_regerror (errcode, &ud->r, errbuf, sizeof (errbuf)); - return luaL_error (L, "%s", errbuf); -} - -static int compile_regex (lua_State *L, const TArgComp *argC, TPosix **pud) { - int res; - TPosix *ud; - - ud = (TPosix *)lua_newuserdata (L, sizeof (TPosix)); - memset (ud, 0, sizeof (TPosix)); /* initialize all members to 0 */ - - res = tre_regncomp (&ud->r, argC->pattern, argC->patlen, argC->cflags); - if (res != 0) - return generate_error (L, ud, res); - - if (argC->cflags & REG_NOSUB) - ud->r.re_nsub = 0; - ud->match = (regmatch_t *) Lmalloc (L, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); - if (!ud->match) - luaL_error (L, "malloc failed"); - lua_pushvalue (L, ALG_ENVIRONINDEX); - lua_setmetatable (L, -2); - - if (pud) *pud = ud; - return 1; -} - -static int generic_atfind (lua_State *L, int tfind) { - int res; - TArgExec argE; - TPosix *ud; - regaparams_t argP; - regamatch_t res_match; - - checkarg_atfind (L, &argE, &ud, &argP); - if (argE.startoffset > (int)argE.textlen) - return lua_pushnil(L), 1; - - argE.text += argE.startoffset; - res_match.nmatch = ALG_NSUB(ud) + 1; - res_match.pmatch = ud->match; - - /* execute the search */ - res = tre_reganexec (&ud->r, argE.text, argE.textlen - argE.startoffset, - &res_match, argP, argE.eflags); - if (ALG_ISMATCH (res)) { - ALG_PUSHOFFSETS (L, ud, argE.startoffset, 0); - if (tfind) - push_substring_table (L, ud, argE.text); - else - push_offset_table (L, ud, argE.startoffset); - /* set values in the dictionary part of the table */ - set_int_field (L, "cost", res_match.cost); - set_int_field (L, "num_ins", res_match.num_ins); - set_int_field (L, "num_del", res_match.num_del); - set_int_field (L, "num_subst", res_match.num_subst); - return 3; - } - else if (ALG_NOMATCH (res)) - return lua_pushnil (L), 1; - else - return generate_error (L, ud, res); -} - -static int Ltre_atfind (lua_State *L) { - return generic_atfind (L, 1); -} - -static int Ltre_aexec (lua_State *L) { - return generic_atfind (L, 0); -} - -static int gmatch_exec (TUserdata *ud, TArgExec *argE) { - if (argE->startoffset > 0) - argE->eflags |= REG_NOTBOL; - argE->text += argE->startoffset; - return tre_regnexec (&ud->r, argE->text, argE->textlen - argE->startoffset, - ALG_NSUB(ud) + 1, ud->match, argE->eflags); -} - -static void gmatch_pushsubject (lua_State *L, TArgExec *argE) { - lua_pushlstring (L, argE->text, argE->textlen); -} - -static int findmatch_exec (TPosix *ud, TArgExec *argE) { - argE->text += argE->startoffset; - return tre_regnexec (&ud->r, argE->text, argE->textlen - argE->startoffset, - ALG_NSUB(ud) + 1, ud->match, argE->eflags); -} - -static int gsub_exec (TPosix *ud, TArgExec *argE, int st) { - if (st > 0) - argE->eflags |= REG_NOTBOL; - return tre_regnexec (&ud->r, argE->text+st, argE->textlen-st, ALG_NSUB(ud)+1, - ud->match, argE->eflags); -} - -static int split_exec (TPosix *ud, TArgExec *argE, int offset) { - if (offset > 0) - argE->eflags |= REG_NOTBOL; - return tre_regnexec (&ud->r, argE->text + offset, argE->textlen - offset, - ALG_NSUB(ud) + 1, ud->match, argE->eflags); -} - -static int Ltre_have_backrefs (lua_State *L) { - TPosix *ud = check_ud (L); - lua_pushboolean (L, tre_have_backrefs (&ud->r)); - return 1; -} - -static int Ltre_have_approx (lua_State *L) { - TPosix *ud = check_ud (L); - lua_pushboolean (L, tre_have_approx (&ud->r)); - return 1; -} - -static int Ltre_gc (lua_State *L) { - TPosix *ud = check_ud (L); - if (ud->freed == 0) { /* precaution against "manual" __gc calling */ - ud->freed = 1; - tre_regfree (&ud->r); - Lfree (L, ud->match, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); - } - return 0; -} - -static int Ltre_tostring (lua_State *L) { - TPosix *ud = check_ud (L); - if (ud->freed == 0) - lua_pushfstring (L, "%s (%p)", REX_TYPENAME, (void*)ud); - else - lua_pushfstring (L, "%s (deleted)", REX_TYPENAME); - return 1; -} - -static flag_pair tre_flags[] = -{ - { "BASIC", REG_BASIC }, - { "NOSPEC", REG_NOSPEC }, - { "EXTENDED", REG_EXTENDED }, - { "ICASE", REG_ICASE }, - { "NOSUB", REG_NOSUB }, - { "NEWLINE", REG_NEWLINE }, - { "NOTBOL", REG_NOTBOL }, - { "NOTEOL", REG_NOTEOL }, - /* TRE-specific flags */ - { "LITERAL", REG_LITERAL }, - { "RIGHT_ASSOC", REG_RIGHT_ASSOC }, - { "UNGREEDY", REG_UNGREEDY }, - { "APPROX_MATCHER", REG_APPROX_MATCHER }, - { "BACKTRACKING_MATCHER", REG_BACKTRACKING_MATCHER }, -/*---------------------------------------------------------------------------*/ - { NULL, 0 } -}; - -static flag_pair tre_error_flags[] = { - { "OK", REG_OK }, /* TRE-specific */ - { "NOMATCH", REG_NOMATCH }, - { "BADPAT", REG_BADPAT }, - { "ECOLLATE", REG_ECOLLATE }, - { "ECTYPE", REG_ECTYPE }, - { "EESCAPE", REG_EESCAPE }, - { "ESUBREG", REG_ESUBREG }, - { "EBRACK", REG_EBRACK }, - { "EPAREN", REG_EPAREN }, - { "EBRACE", REG_EBRACE }, - { "BADBR", REG_BADBR }, - { "ERANGE", REG_ERANGE }, - { "ESPACE", REG_ESPACE }, - { "BADRPT", REG_BADRPT }, -/*---------------------------------------------------------------------------*/ - { NULL, 0 } -}; - -/* config. flags with integer value */ -static flag_pair tre_config_flags_int[] = { - { "CONFIG_APPROX", TRE_CONFIG_APPROX }, - { "CONFIG_WCHAR", TRE_CONFIG_WCHAR }, - { "CONFIG_MULTIBYTE", TRE_CONFIG_MULTIBYTE }, - { "CONFIG_SYSTEM_ABI", TRE_CONFIG_SYSTEM_ABI }, - { NULL, 0 } -}; - -/* config. flags with string value */ -static flag_pair tre_config_flags_str[] = { - { "CONFIG_VERSION", TRE_CONFIG_VERSION }, - { NULL, 0 } -}; - -static int Ltre_get_flags (lua_State *L) { - const flag_pair* fps[] = { tre_flags, tre_error_flags, NULL }; - return get_flags (L, fps); -} - -static int Ltre_config (lua_State *L) { - int intval; - const char *strval; - flag_pair *fp; - if (lua_istable (L, 1)) - lua_settop (L, 1); - else - lua_newtable (L); - for (fp = tre_config_flags_int; fp->key; ++fp) { - if (0 == tre_config (fp->val, &intval)) { - lua_pushinteger (L, intval); - lua_setfield (L, -2, fp->key); - } - } - for (fp = tre_config_flags_str; fp->key; ++fp) { - if (0 == tre_config (fp->val, &strval)) { - lua_pushstring (L, strval); - lua_setfield (L, -2, fp->key); - } - } - return 1; -} - -static int Ltre_version (lua_State *L) { - lua_pushstring (L, tre_version ()); - return 1; -} - -static const luaL_Reg r_methods[] = { - { "exec", algm_exec }, - { "find", algm_find }, - { "match", algm_match }, - { "tfind", algm_tfind }, - { "aexec", Ltre_aexec }, - { "atfind", Ltre_atfind }, - { "have_approx", Ltre_have_approx }, - { "have_backrefs", Ltre_have_backrefs }, - { "__gc", Ltre_gc }, - { "__tostring", Ltre_tostring }, - { NULL, NULL} -}; - -static const luaL_Reg r_functions[] = { - { "new", algf_new }, - { "find", algf_find }, - { "gmatch", algf_gmatch }, - { "gsub", algf_gsub }, - { "count", algf_count }, - { "match", algf_match }, - { "split", algf_split }, - { "config", Ltre_config }, - { "flags", Ltre_get_flags }, - { "version", Ltre_version }, - { NULL, NULL } -}; - -/* Open the library */ -REX_API int REX_OPENLIB (lua_State *L) -{ - alg_register(L, r_methods, r_functions, "TRE regexes"); -#ifdef REX_ADDWIDECHARFUNCS - add_wide_lib (L); -#endif - return 1; -} diff --git a/src/tre/ltre_w.c b/src/tre/ltre_w.c deleted file mode 100644 index 252167b..0000000 --- a/src/tre/ltre_w.c +++ /dev/null @@ -1,274 +0,0 @@ -/* ltre.c - Lua binding of TRE regular expressions library */ -/* See Copyright Notice in the file LICENSE */ - -#include -#include -#include -#include "lua.h" -#include "lauxlib.h" -#include "../common.h" - -#include - -void bufferZ_putrepstringW (TBuffer *BufRep, int reppos, int nsub); - -/* These 2 settings may be redefined from the command-line or the makefile. - * They should be kept in sync between themselves and with the target name. - */ -#ifndef REX_LIBNAME -# define REX_LIBNAME "rex_tre" -#endif -#ifndef REX_OPENLIB -# define REX_OPENLIB luaopen_rex_tre -#endif - -#define REX_TYPENAME REX_LIBNAME"_regex" - -#define ALG_CFLAGS_DFLT REG_EXTENDED -#define ALG_EFLAGS_DFLT 0 -#define ALG_CHARSIZE 2 -#define BUFFERZ_PUTREPSTRING bufferZ_putrepstringW - -#define ALG_NOMATCH(res) ((res) == REG_NOMATCH) -#define ALG_ISMATCH(res) ((res) == 0) -#define ALG_SUBBEG(ud,n) (ALG_CHARSIZE * ud->match[n].rm_so) -#define ALG_SUBEND(ud,n) (ALG_CHARSIZE * ud->match[n].rm_eo) -#define ALG_SUBLEN(ud,n) (ALG_SUBEND(ud,n) - ALG_SUBBEG(ud,n)) -#define ALG_SUBVALID(ud,n) (ALG_SUBBEG(ud,n) >= 0) -#define ALG_NSUB(ud) ((int)ud->r.re_nsub) - -#define ALG_PUSHSUB(L,ud,text,n) \ - lua_pushlstring (L, (text) + ALG_SUBBEG(ud,n), ALG_SUBLEN(ud,n)) - -#define ALG_PUSHSUB_OR_FALSE(L,ud,text,n) \ - (ALG_SUBVALID(ud,n) ? (void) ALG_PUSHSUB (L,ud,text,n) : lua_pushboolean (L,0)) - -#define ALG_PUSHSTART(L,ud,offs,n) lua_pushinteger(L, ((offs) + ALG_SUBBEG(ud,n))/ALG_CHARSIZE + 1) -#define ALG_PUSHEND(L,ud,offs,n) lua_pushinteger(L, ((offs) + ALG_SUBEND(ud,n))/ALG_CHARSIZE) -#define ALG_PUSHOFFSETS(L,ud,offs,n) \ - (ALG_PUSHSTART(L,ud,offs,n), ALG_PUSHEND(L,ud,offs,n)) - -#define ALG_BASE(st) (st) -#define ALG_GETCFLAGS(L,pos) (int)luaL_optinteger(L, pos, ALG_CFLAGS_DFLT) - -typedef struct { - regex_t r; - regmatch_t * match; - int freed; -} TPosix; - -#define TUserdata TPosix - -#include "../algo.h" - -/* Functions - ****************************************************************************** - */ - -static void checkarg_regaparams (lua_State *L, int stackpos, regaparams_t *argP) { - if (lua_type (L, stackpos) != LUA_TTABLE) /* allow for userdata? */ - luaL_argerror (L, stackpos, "table expected"); - lua_pushvalue (L, stackpos); - argP->cost_ins = get_int_field (L, "cost_ins"); - argP->cost_del = get_int_field (L, "cost_del"); - argP->cost_subst = get_int_field (L, "cost_subst"); - argP->max_cost = get_int_field (L, "max_cost"); - argP->max_ins = get_int_field (L, "max_ins"); - argP->max_del = get_int_field (L, "max_del"); - argP->max_subst = get_int_field (L, "max_subst"); - argP->max_err = get_int_field (L, "max_err"); - lua_pop (L, 1); -} - -/* method r:atfind (s, params, [st], [ef]) */ -/* method r:aexec (s, params, [st], [ef]) */ -static void checkarg_atfind (lua_State *L, TArgExec *argE, TPosix **ud, - regaparams_t *argP) { - *ud = check_ud (L); - argE->text = luaL_checklstring (L, 2, &argE->textlen); - checkarg_regaparams (L, 3, argP); - argE->startoffset = get_startoffset (L, 4, argE->textlen); - argE->eflags = (int)luaL_optinteger (L, 5, ALG_EFLAGS_DFLT); -} - -static int generate_error (lua_State *L, const TPosix *ud, int errcode) { - char errbuf[80]; - tre_regerror (errcode, &ud->r, errbuf, sizeof (errbuf)); - return luaL_error (L, "%s", errbuf); -} - -static int compile_regex (lua_State *L, const TArgComp *argC, TPosix **pud) { - int res; - TPosix *ud; - - ud = (TPosix *)lua_newuserdata (L, sizeof (TPosix)); - memset (ud, 0, sizeof (TPosix)); /* initialize all members to 0 */ - - res = tre_regwncomp (&ud->r, (const wchar_t*)argC->pattern, argC->patlen/ALG_CHARSIZE, argC->cflags); - if (res != 0) - return generate_error (L, ud, res); - - if (argC->cflags & REG_NOSUB) - ud->r.re_nsub = 0; - ud->match = (regmatch_t *) Lmalloc (L, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); - if (!ud->match) - luaL_error (L, "malloc failed"); - lua_pushvalue (L, ALG_ENVIRONINDEX); - lua_setmetatable (L, -2); - - if (pud) *pud = ud; - return 1; -} - -static int generic_atfind (lua_State *L, int tfind) { - int res; - TArgExec argE; - TPosix *ud; - regaparams_t argP; - regamatch_t res_match; - - checkarg_atfind (L, &argE, &ud, &argP); - if (argE.startoffset > (int)argE.textlen) - return lua_pushnil(L), 1; - - argE.text += argE.startoffset; - res_match.nmatch = ALG_NSUB(ud) + 1; - res_match.pmatch = ud->match; - - /* execute the search */ - res = tre_regawnexec (&ud->r, (const wchar_t*)argE.text, - (argE.textlen - argE.startoffset)/ALG_CHARSIZE, &res_match, argP, argE.eflags); - if (ALG_ISMATCH (res)) { - ALG_PUSHOFFSETS (L, ud, argE.startoffset, 0); - if (tfind) - push_substring_table (L, ud, argE.text); - else - push_offset_table (L, ud, argE.startoffset); - /* set values in the dictionary part of the table */ - set_int_field (L, "cost", res_match.cost); - set_int_field (L, "num_ins", res_match.num_ins); - set_int_field (L, "num_del", res_match.num_del); - set_int_field (L, "num_subst", res_match.num_subst); - return 3; - } - else if (ALG_NOMATCH (res)) - return lua_pushnil (L), 1; - else - return generate_error (L, ud, res); -} - -static int Ltre_atfind (lua_State *L) { - return generic_atfind (L, 1); -} - -static int Ltre_aexec (lua_State *L) { - return generic_atfind (L, 0); -} - -static int gmatch_exec (TUserdata *ud, TArgExec *argE) { - if (argE->startoffset > 0) - argE->eflags |= REG_NOTBOL; - argE->text += argE->startoffset; - return tre_regwnexec (&ud->r, (const wchar_t*)argE->text, (argE->textlen - argE->startoffset)/ALG_CHARSIZE, - ALG_NSUB(ud) + 1, ud->match, argE->eflags); -} - -static void gmatch_pushsubject (lua_State *L, TArgExec *argE) { - lua_pushlstring (L, argE->text, argE->textlen); -} - -static int findmatch_exec (TPosix *ud, TArgExec *argE) { - argE->text += argE->startoffset; - return tre_regwnexec (&ud->r, (const wchar_t*)argE->text, (argE->textlen - argE->startoffset)/ALG_CHARSIZE, - ALG_NSUB(ud) + 1, ud->match, argE->eflags); -} - -static int gsub_exec (TPosix *ud, TArgExec *argE, int st) { - if (st > 0) - argE->eflags |= REG_NOTBOL; - return tre_regwnexec (&ud->r, (const wchar_t*)(argE->text+st), (argE->textlen-st)/ALG_CHARSIZE, ALG_NSUB(ud)+1, - ud->match, argE->eflags); -} - -static int split_exec (TPosix *ud, TArgExec *argE, int offset) { - if (offset > 0) - argE->eflags |= REG_NOTBOL; - return tre_regwnexec (&ud->r, (const wchar_t*)(argE->text + offset), (argE->textlen - offset)/ALG_CHARSIZE, - ALG_NSUB(ud) + 1, ud->match, argE->eflags); -} - -static const luaL_Reg r_methods[] = { - { "wexec", algm_exec }, - { "wfind", algm_find }, - { "wmatch", algm_match }, - { "wtfind", algm_tfind }, - { "waexec", Ltre_aexec }, - { "watfind", Ltre_atfind }, - { NULL, NULL} -}; - -static const luaL_Reg r_functions[] = { - { "wnew", algf_new }, - { "wfind", algf_find }, - { "wgmatch", algf_gmatch }, - { "wgsub", algf_gsub }, - { "wcount", algf_count }, - { "wmatch", algf_match }, - { "wsplit", algf_split }, - { NULL, NULL } -}; - -/* Add the library */ -void add_wide_lib (lua_State *L) -{ - (void)alg_register; - lua_pushvalue(L, -2); -#if LUA_VERSION_NUM == 501 - luaL_register(L, NULL, r_methods); - lua_pop(L, 1); - luaL_register(L, NULL, r_functions); -#else - lua_pushvalue(L, -1); - luaL_setfuncs(L, r_methods, 1); - luaL_setfuncs(L, r_functions, 1); -#endif -} - -/* 1. When called repeatedly on the same TBuffer, its existing data - is discarded and overwritten by the new data. - 2. The TBuffer's array is never shrunk by this function. -*/ -void bufferZ_putrepstringW (TBuffer *BufRep, int reppos, int nsub) { - wchar_t dbuf[] = { 0, 0 }; - size_t replen; - const wchar_t *p = (const wchar_t*) lua_tolstring (BufRep->L, reppos, &replen); - replen /= sizeof(wchar_t); - const wchar_t *end = p + replen; - BufRep->top = 0; - while (p < end) { - const wchar_t *q; - for (q = p; q < end && *q != L'%'; ++q) - {} - if (q != p) - bufferZ_addlstring (BufRep, p, (q - p) * sizeof(wchar_t)); - if (q < end) { - if (++q < end) { /* skip % */ - if (iswdigit (*q)) { - int num; - *dbuf = *q; - num = wcstol (dbuf, NULL, 10); - if (num == 1 && nsub == 0) - num = 0; - else if (num > nsub) { - freelist_free (BufRep->freelist); - luaL_error (BufRep->L, "invalid capture index"); - } - bufferZ_addnum (BufRep, num); - } - else bufferZ_addlstring (BufRep, q, 1 * sizeof(wchar_t)); - } - p = q + 1; - } - else break; - } -} diff --git a/test/README b/test/README deleted file mode 100644 index 100a276..0000000 --- a/test/README +++ /dev/null @@ -1,7 +0,0 @@ -To test Lrexlib, execute the following command line: - - lua ./runtest.lua [-a] [-v] LIBRARY... - --a use the external "Alien" library for "buffer subject" tests, - rather than the internal function --v gives verbose output diff --git a/test/emacs_sets.lua b/test/emacs_sets.lua deleted file mode 100644 index 57d87b4..0000000 --- a/test/emacs_sets.lua +++ /dev/null @@ -1,54 +0,0 @@ --- See Copyright Notice in the file LICENSE - -local luatest = require "luatest" -local N = luatest.NT -local unpack = unpack or table.unpack - -local function norm(a) return a==nil and N or a end - -local function set_f_gmatch (lib, flg) - -- gmatch (s, p, [cf], [ef]) - local function test_gmatch (subj, patt) - local out, guard = {}, 10 - for a, b in lib.gmatch (subj, patt, flg.SYNTAX_EMACS, nil) do - table.insert (out, { norm(a), norm(b) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function gmatch", - Func = test_gmatch, - --{ subj patt results } - { {("abcd"):rep(3), "\\(.\\)b.\\(d\\)"}, {{"a","d"},{"a","d"},{"a","d"}} }, - } -end - -local function set_f_split (lib, flg) - -- split (s, p, [cf], [ef]) - local function test_split (subj, patt) - local out, guard = {}, 10 - for a, b, c in lib.split (subj, patt, flg.SYNTAX_EMACS, nil) do - table.insert (out, { norm(a), norm(b), norm(c) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function split", - Func = test_split, - --{ subj patt results } - { {"ab<78>c", "<\\(.\\)\\(.\\)>"}, {{"ab","7","8"}, {"c",N,N}, } }, - } -end - -return function (libname) - local lib = require (libname) - local flags = lib.flags () - return { - set_f_gmatch (lib, flags), - set_f_split (lib, flags), - } -end diff --git a/test/gnu_sets.lua b/test/gnu_sets.lua deleted file mode 100644 index 19f1d49..0000000 --- a/test/gnu_sets.lua +++ /dev/null @@ -1,52 +0,0 @@ --- See Copyright Notice in the file LICENSE - -local luatest = require "luatest" -local N = luatest.NT -local unpack = unpack or table.unpack - -local function norm(a) return a==nil and N or a end - -local function set_f_gmatch (lib, flg) - local downcase = {} - for i = 0, 255 do -- 255 == UCHAR_MAX - downcase[i] = string.gsub(string.char (i), ".", function (s) return string.lower(s) end) - end - -- gmatch (s, p, [cf], [ef], [tr]) - local function test_gmatch (subj, patt) - local out, guard = {}, 10 - for a, b in lib.gmatch (subj, patt, nil, nil, downcase) do - table.insert (out, { norm(a), norm(b) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function gmatch", - Func = test_gmatch, - --{ subj patt results } - { {"abA", "a"}, {{"a",N}, {"A",N} } }, - } -end - -local function set_f_match (lib, flg) -return { - Name = "Function match", - Func = lib.match, - --{subj, patt, st,cf,ef}, { results } - { {"abcd", ".+", 5}, { N } }, -- failing st - { {"abc", "^abc"}, {"abc" } }, -- anchor - { {"abc", "^abc", N,N,flg.not_bol}, { N } }, -- anchor + ef - { {"abc", "abc$", N,N,flg.not_eol}, { N } }, -- anchor + ef - { {"cabcaab", "ca+b", N,N,flg.backward}, {"caab" } }, -- reverse search -} -end - -return function (libname) - local lib = require (libname) - local flags = lib.flags () - return { - set_f_match (lib, flags), - set_f_gmatch (lib), - } -end diff --git a/test/oniguruma_sets.lua b/test/oniguruma_sets.lua deleted file mode 100644 index a3b300f..0000000 --- a/test/oniguruma_sets.lua +++ /dev/null @@ -1,177 +0,0 @@ --- See Copyright Notice in the file LICENSE - -local luatest = require "luatest" -local N = luatest.NT -local unpack = unpack or table.unpack - -local function norm(a) return a==nil and N or a end - -local function fill (n, m) - local t = {} - for i = n, m, -1 do table.insert (t, i) end - return t -end - -local function set_named_subpatterns (lib, flg) - return { - Name = "Named Subpatterns", - Func = function (subj, methodname, patt, name1, name2) - local r = lib.new (patt) - local _,_,caps = r[methodname] (r, subj) - return norm(caps[name1]), norm(caps[name2]) - end, - --{} N.B. subject is always first element - { {"abcd", "tfind", "(?.)b.(?d)", "dog", "cat"}, {"a","d"} }, - { {"abcd", "exec", "(?.)b.(?d)", "dog", "cat"}, {"a","d"} }, - } -end - -local function set_f_find (lib, flg) - local cp1251 = - "ÀÁÂÃÄŨÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÜÛÚÝÞßàáâãäå¸æçèéêëìíîïðñòóôõö÷øùüûúýþÿ" - local loc = "CP1251" - return { - Name = "Function find", - Func = lib.find, - --{subj, patt, st,cf,ef,lo}, { results } - { {"abcd", ".+", 5}, { N } }, -- failing st - { {"abcd", ".*?"}, { 1,0 } }, -- non-greedy - { {"abc", "aBC", N,flg.IGNORECASE}, { 1,3 } }, -- cf - { {"abc", "aBC", N,"i" }, { 1,3 } }, -- cf - { {cp1251, "[[:upper:]]+", N,N,N, loc}, { 1,33} }, -- locale - { {cp1251, "[[:lower:]]+", N,N,N, loc}, {34,66} }, -- locale - { {cp1251, "\\w+", N,N,N, loc}, {1, 66} }, -- locale -} -end - -local function set_f_match (lib, flg) - return { - Name = "Function match", - Func = lib.match, - --{subj, patt, st,cf,ef,lo}, { results } - { {"abcd", ".+", 5}, { N }}, -- failing st - { {"abcd", ".*?"}, { "" }}, -- non-greedy - { {"abc", "aBC", N,flg.IGNORECASE}, {"abc" }}, -- cf - { {"abc", "aBC", N,"i" }, {"abc" }}, -- cf -} -end - -local function set_f_gmatch (lib, flg) - -- gmatch (s, p, [cf], [ef]) - local pCSV = "[^,]*" - local F = false - local function test_gmatch (subj, patt) - local out, guard = {}, 10 - for a, b in lib.gmatch (subj, patt) do - table.insert (out, { norm(a), norm(b) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function gmatch", - Func = test_gmatch, - --{ subj patt results } - { {"a\0c", "." }, {{"a",N},{"\0",N},{"c",N}} },--nuls in subj - { {"", pCSV}, {{"",N}} }, - { {"12", pCSV}, {{"12",N}} }, - { {",", pCSV}, {{"", N},{"", N}} }, - { {"12,,45", pCSV}, {{"12",N},{"",N},{"45",N}} }, - { {",,12,45,,ab,", pCSV}, {{"",N},{"",N},{"12",N},{"45",N},{"",N},{"ab",N},{"",N}} }, - { {"12345", "(.)(.)"}, {{"1","2"},{"3","4"}} }, - { {"12345", "(.)(.?)"}, {{"1","2"},{"3","4"},{"5",""}} }, - } -end - -local function set_f_split (lib, flg) - -- split (s, p, [cf], [ef]) - local function test_split (subj, patt) - local out, guard = {}, 10 - for a, b, c in lib.split (subj, patt) do - table.insert (out, { norm(a), norm(b), norm(c) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function split", - Func = test_split, - --{ subj patt results } - { {"a,\0,c", ","}, {{"a",",",N},{"\0",",",N},{"c",N,N}, } },--nuls in subj - { {"ab", "$"}, {{"ab","",N}, {"",N,N} } }, - { {"ab", "^|$"}, {{"", "", N}, {"ab","",N}, {"",N,N} } }, - { {"ab45ab","(?<=ab).*?"}, {{"ab","",N}, {"45ab","",N}, {"",N,N} } }, - { {"ab", "\\b"}, {{"", "", N}, {"ab","",N}, {"",N,N} } }, - { {"ab", ".*" }, {{"","ab",N}, {"",N,N} } }, - { {"ab", ".*?" }, {{"","",N}, {"a","",N}, {"b","",N}, {"",N,N} } }, - { {"ab;de", ";*" }, {{"","",N},{"a","",N},{"b",";",N},{"d","",N},{"e","",N},{"",N,N} }}, - } -end - -local function set_f_internal_test (lib, flg) - return { - Name = "Function internal_test", - Func = lib.internal_test, - --{ params results } - { {""}, {true} }, - } -end - -local function set_m_exec (lib, flg) - return { - Name = "Method exec", - Method = "exec", ---{patt,cf,lo}, {subj,st,ef} { results } - { {".+"}, {"abcd",5}, { N } }, -- failing st - { {".*?"}, {"abcd"}, {1,0,{}} }, -- non-greedy - { {"aBC",flg.IGNORECASE}, {"abc"}, {1,3,{}} }, -- cf - { {"aBC","i" }, {"abc"}, {1,3,{}} }, -- cf -} -end - -local function set_m_tfind (lib, flg) - return { - Name = "Method tfind", - Method = "tfind", ---{patt,cf,lo}, {subj,st,ef} { results } - { {".+"}, {"abcd",5}, { N } }, -- failing st - { {".*?"}, {"abcd"}, {1,0,{}} }, -- non-greedy - { {"aBC",flg.IGNORECASE}, {"abc"}, {1,3,{}} }, -- cf - { {"aBC","i" }, {"abc"}, {1,3,{}} }, -- cf -} -end - -local function set_m_capturecount (lib, flg) - return { - Name = "Method capturecount", - Method = "capturecount", ---{patt,cf,lo}, {subj,st,ef} { results } - { {"a"}, {}, { 0 } }, - { {"(a)"}, {}, { 1 } }, - { {"(a)(a)"}, {}, { 2 } }, - { {"((a)a)"}, {}, { 2 } }, - { {"((?i)a)(?:a)"}, {}, { 1 } }, -} -end - -return function (libname) - local lib = require (libname) - local flags = lib.flags () - local sets = { - set_f_internal_test (lib, flags), - set_f_match (lib, flags), - set_f_find (lib, flags), - set_f_gmatch (lib, flags), - set_f_split (lib, flags), - set_m_exec (lib, flags), - set_m_tfind (lib, flags), - set_m_capturecount (lib, flags), - } - local MAJOR = tonumber(lib.version():match("%d+")) - if MAJOR >= 0 then - table.insert (sets, set_named_subpatterns (lib, flags)) - end - return sets -end diff --git a/test/posix_sets.lua b/test/posix_sets.lua deleted file mode 100644 index 15a7bba..0000000 --- a/test/posix_sets.lua +++ /dev/null @@ -1,63 +0,0 @@ --- See Copyright Notice in the file LICENSE - -local luatest = require "luatest" -local N = luatest.NT - -local function set_f_find (lib, flg) -return { - Name = "Function find", - Func = lib.find, - --{subj, patt, st,cf,ef}, { results } - { {"abcd", ".+", 5}, { N } }, -- failing st - { {"abc", "aBC", N, flg.ICASE}, { 1,3 } }, -- cf - { {"abc", "^abc"}, { 1,3 } }, -- anchor - { {"abc", "^abc", N,N,flg.NOTBOL}, { N } }, -- anchor + ef -} -end - -local function set_f_match (lib, flg) -return { - Name = "Function match", - Func = lib.match, - --{subj, patt, st,cf,ef}, { results } - { {"abcd", ".+", 5}, { N } }, -- failing st - { {"abc", "aBC", N, flg.ICASE}, {"abc" } }, -- cf - { {"abc", "^abc"}, {"abc" } }, -- anchor - { {"abc", "^abc", N,N,flg.NOTBOL}, { N } }, -- anchor + ef -} -end - -local function set_m_exec (lib, flg) -return { - Name = "Method exec", - Method = "exec", --- {patt,cf}, {subj,st,ef} { results } - { {".+"}, {"abcd",5}, { N } }, -- failing st - { {"aBC",flg.ICASE}, {"abc"}, {1,3,{}} }, -- cf - { {"^abc"}, {"abc"}, {1,3,{}} }, -- anchor - { {"^abc"}, {"abc",N,flg.NOTBOL}, { N } }, -- anchor + ef -} -end - -local function set_m_tfind (lib, flg) -return { - Name = "Method tfind", - Method = "tfind", --- {patt,cf}, {subj,st,ef} { results } - { {".+"}, {"abcd",5}, { N } }, -- failing st - { {"aBC",flg.ICASE}, {"abc"}, {1,3,{}} }, -- cf - { {"^abc"}, {"abc"}, {1,3,{}} }, -- anchor - { {"^abc"}, {"abc",N,flg.NOTBOL}, { N } }, -- anchor + ef -} -end - -return function (libname) - local lib = require (libname) - local flags = lib.flags () - return { - set_f_match (lib, flags), - set_f_find (lib, flags), - set_m_exec (lib, flags), - set_m_tfind (lib, flags), - } -end diff --git a/test/runtest.lua b/test/runtest.lua deleted file mode 100644 index fe7d053..0000000 --- a/test/runtest.lua +++ /dev/null @@ -1,116 +0,0 @@ --- See Copyright Notice in the file LICENSE - -do - local path = "./?.lua;" - if package.path:sub(1, #path) ~= path then - package.path = path .. package.path - end -end -local luatest = require "luatest" - -local function newalienbuffer (str) - local alien = require "alien" - local buf = alien.buffer (#str) - if #str > 0 then - alien.memmove (buf:topointer (), str, #str) - end - return buf -end - --- returns: number of failures -local function test_library (libname, setfile, verbose, use_alien) - if verbose then - print (("[lib: %s; file: %s]"):format (libname, setfile)) - end - local lib = require (libname) - local f = require (setfile) - local sets = f (libname) - - local newmembuffer = use_alien and newalienbuffer or lib._newmembuffer - if newmembuffer then - if libname == "rex_posix" and not lib.flags ().STARTEND then - newmembuffer = nil - io.stderr:write ("Cannot run posix tests with buffer subjects without REG_STARTEND\n") - end - else - io.stderr:write ("Warning: cannot run tests with buffer subjects\n") - end - - local n = 0 -- number of failures - for _, set in ipairs (sets) do - if verbose then - print (set.Name or "Unnamed set") - end - local err = luatest.test_set (set, lib, newmembuffer) - if verbose then - for _,v in ipairs (err) do - print (" Test " .. v.i) - luatest.print_results (v, " ") - end - end - n = n + #err - end - if verbose then - print "" - end - return n -end - -local avail_tests = { - posix = { lib = "rex_posix", "common_sets", "posix_sets" }, - gnu = { lib = "rex_gnu", "common_sets", "emacs_sets", "gnu_sets" }, - oniguruma = { lib = "rex_onig", "common_sets", "oniguruma_sets", }, - pcre = { lib = "rex_pcre", "common_sets", "pcre_sets", "pcre_sets2", }, - pcre2 = { lib = "rex_pcre2", "common_sets", "pcre_sets", "pcre_sets2", }, - spencer = { lib = "rex_spencer", "common_sets", "posix_sets", "spencer_sets" }, - tre = { lib = "rex_tre", "common_sets", "posix_sets", "spencer_sets", --[["tre_sets"]] }, -} - -do - local verbose, tests, nerr = false, {}, 0 - local dir - local use_alien - -- check arguments - for i = 1, select ("#", ...) do - local arg = select (i, ...) - if arg:sub(1,1) == "-" then - if arg == "-v" then - verbose = true - elseif arg == "-a" then - use_alien = true - elseif arg:sub(1,2) == "-d" then - dir = arg:sub(3) - else - error ("invalid argument: [" .. arg .. "]") - end - else - if avail_tests[arg] then - tests[#tests+1] = avail_tests[arg] - else - error ("invalid argument: [" .. arg .. "]") - end - end - end - assert (#tests > 0, "no library specified") - -- give priority to libraries located in the specified directory - if dir then - dir = dir:gsub("[/\\]+$", "") - for _, ext in ipairs {"dll", "so", "dylib"} do - if package.cpath:match ("%?%." .. ext) then - local cpath = dir .. "/?." .. ext .. ";" - if package.cpath:sub(1, #cpath) ~= cpath then - package.cpath = cpath .. package.cpath - end - break - end - end - end - -- do tests - for _, test in ipairs (tests) do - package.loaded[test.lib] = nil -- to force-reload the tested library - for _, setfile in ipairs (test) do - nerr = nerr + test_library (test.lib, setfile, verbose, use_alien) - end - end - print ("Total number of failures: " .. nerr) -end diff --git a/test/scite.properties b/test/scite.properties deleted file mode 100644 index b50db54..0000000 --- a/test/scite.properties +++ /dev/null @@ -1,2 +0,0 @@ -eol.mode=LF - diff --git a/test/spencer_sets.lua b/test/spencer_sets.lua deleted file mode 100644 index 183b509..0000000 --- a/test/spencer_sets.lua +++ /dev/null @@ -1,116 +0,0 @@ --- See Copyright Notice in the file LICENSE - -local luatest = require "luatest" -local N = luatest.NT -local unpack = unpack or table.unpack - -local function norm(a) return a==nil and N or a end - -local function get_gsub (lib) - return lib.gsub or - function (subj, pattern, repl, n) - return lib.new (pattern) : gsub (subj, repl, n) - end -end - -local function set_f_gsub1 (lib, flg) - local subj, pat = "abcdef", "[abef]+" - return { - Name = "Function gsub, set1", - Func = get_gsub (lib), - --{ s, p, f, n, res1, res2, res3 }, - { {"a\0c", ".", "#" }, {"###", 3, 3} }, -- subj contains nuls - } -end - -local function set_f_find (lib, flg) -return { - Name = "Function find", - Func = lib.find, - --{subj, patt, st,cf,ef}, { results } - { {"a\0c", ".+"}, { 1,3 } }, -- subj contains nul - { {"a\0c", "a\0c", N,flg.PEND}, { 1,3 } }, -- subj and patt contain nul -} -end - -local function set_f_match (lib, flg) -return { - Name = "Function match", - Func = lib.match, - --{subj, patt, st,cf,ef}, { results } - { {"a\0c", ".+"}, {"a\0c"} }, -- subj contains nul - { {"a\0c", "a\0c", N,flg.PEND}, {"a\0c"} }, -- subj and patt contain nul -} -end - -local function set_f_gmatch (lib, flg) - -- gmatch (s, p, [cf], [ef]) - local function test_gmatch (subj, patt) - local out, guard = {}, 10 - for a, b in lib.gmatch (subj, patt) do - table.insert (out, { norm(a), norm(b) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function gmatch", - Func = test_gmatch, - --{ subj patt results } - { {"a\0c", "." }, {{"a",N},{"\0",N},{"c",N}} },--nuls in subj - } -end - -local function set_f_split (lib, flg) - -- split (s, p, [cf], [ef]) - local function test_split (subj, patt) - local out, guard = {}, 10 - for a, b, c in lib.split (subj, patt) do - table.insert (out, { norm(a), norm(b), norm(c) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function split", - Func = test_split, - --{ subj patt results } - { {"a,\0,c", ","}, {{"a",",",N},{"\0",",",N},{"c",N,N}, } },--nuls in subj - } -end - -local function set_m_exec (lib, flg) -return { - Name = "Method exec", - Method = "exec", --- {patt,cf}, {subj,st,ef} { results } - { {".+"}, {"a\0c"}, {1,3,{}} }, -- subj contains nul - { {"a\0c",flg.PEND}, {"a\0c"}, {1,3,{}} }, -- subj and patt contain nul -} -end - -local function set_m_tfind (lib, flg) -return { - Name = "Method tfind", - Method = "tfind", --- {patt,cf}, {subj,st,ef} { results } - { {".+"}, {"a\0c"}, {1,3,{}} }, -- subj contains nul - { {"a\0c",flg.PEND}, {"a\0c"}, {1,3,{}} }, -- subj and patt contain nul -} -end - -return function (libname) - local lib = require (libname) - local flags = lib.flags () - return { - set_f_match (lib, flags), - set_f_find (lib, flags), - set_f_gmatch (lib, flags), - set_f_gsub1 (lib, flags), - set_m_exec (lib, flags), - set_m_tfind (lib, flags), - } -end - diff --git a/test/tre_sets.lua b/test/tre_sets.lua deleted file mode 100644 index 7043333..0000000 --- a/test/tre_sets.lua +++ /dev/null @@ -1,354 +0,0 @@ --- See Copyright Notice in the file LICENSE - --- This file should contain only test sets that behave identically --- when being run with pcre or posix regex libraries. - -local luatest = require "luatest" -local N = luatest.NT -local unpack = unpack or table.unpack - -local L = function(s) return (string.gsub(s, ".", "%0\0")) end - -local function norm(a) return a==nil and N or a end - -local function get_wgsub (lib) - return lib.wgsub or - function (subj, pattern, repl, n) - return lib.wnew (pattern) : wgsub (subj, repl, n) - end -end - -local function set_f_wgmatch (lib, flg) - -- gmatch (s, p, [cf], [ef]) - local function test_wgmatch (subj, patt) - local out, guard = {}, 10 - for a, b in lib.wgmatch (subj, patt) do - table.insert (out, { norm(a), norm(b) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function wgmatch", - Func = test_wgmatch, - --{ subj patt results } - { {L"ab", lib.wnew(L".")}, {{L"a",N}, {L"b",N} } }, - { {(L"abcd"):rep(3), L"(.)b.(d)"}, {{L"a",L"d"},{L"a",L"d"},{L"a",L"d"}} }, - { {L"abcd", L".*" }, {{L"abcd",N},{L"",N} } },--zero-length match - { {L"abc", L"^." }, {{L"a",N}} },--anchored pattern - } -end - -local function set_f_wsplit (lib, flg) - -- split (s, p, [cf], [ef]) - local function test_wsplit (subj, patt) - local out, guard = {}, 10 - for a, b, c in lib.wsplit (subj, patt) do - table.insert (out, { norm(a), norm(b), norm(c) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function wsplit", - Func = test_wsplit, - --{ subj patt results } - { {L"ab", lib.wnew(L",")}, {{L"ab",N,N}, } }, - { {L"ab", L","}, {{L"ab",N,N}, } }, - { {L",", L","}, {{L"",L",",N}, {L"", N, N}, } }, - { {L",,", L","}, {{L"",L",",N}, {L"",L",",N}, {L"",N,N} } }, - { {L"a,b", L","}, {{L"a",L",",N}, {L"b",N,N}, } }, - { {L",a,b", L","}, {{L"",L",",N}, {L"a",L",",N}, {L"b",N,N}} }, - { {L"a,b,", L","}, {{L"a",L",",N}, {L"b",L",",N}, {L"",N,N} } }, - { {L"a,,b", L","}, {{L"a",L",",N}, {L"",L",",N}, {L"b",N,N}} }, - { {L"ab<78>c", L"<(.)(.)>"}, {{L"ab",L"7",L"8"}, {L"c",N,N}, } }, - { {L"abc", L"^."}, {{L"", L"a",N}, {L"bc",N,N}, } },--anchored pattern - { {L"abc", L"^"}, {{L"", L"", N}, {L"abc",N,N}, } }, --- { {"abc", "$"}, {{"abc","",N}, {"",N,N}, } }, --- { {"abc", "^|$"}, {{"", "", N}, {"abc","",N},{"",N,N},} }, - } -end - -local function set_f_wfind (lib, flg) - return { - Name = "Function wfind", - Func = lib.wfind, - -- {subj, patt, st}, { results } - { {L"abcd", lib.wnew(L".+")}, { 1,4 } }, -- [none] - { {L"abcd", L".+"}, { 1,4 } }, -- [none] - { {L"abcd", L".+", 2}, { 2,4 } }, -- positive st - { {L"abcd", L".+", -2}, { 3,4 } }, -- negative st - { {L"abcd", L".*"}, { 1,4 } }, -- [none] - { {L"abc", L"bc"}, { 2,3 } }, -- [none] - { {L"abcd", L"(.)b.(d)"}, { 1,4,L"a",L"d" }}, -- [captures] - } -end - -local function set_f_wmatch (lib, flg) - return { - Name = "Function wmatch", - Func = lib.wmatch, - -- {subj, patt, st}, { results } - { {L"abcd", lib.wnew(L".+")}, {L"abcd"} }, -- [none] - { {L"abcd", L".+"}, {L"abcd"} }, -- [none] - { {L"abcd", L".+", 2}, {L"bcd"} }, -- positive st - { {L"abcd", L".+", -2}, {L"cd"} }, -- negative st - { {L"abcd", L".*"}, {L"abcd"} }, -- [none] - { {L"abc", L"bc"}, {L"bc"} }, -- [none] - { {L"abcd", L"(.)b.(d)"}, {L"a",L"d"} }, -- [captures] - } -end - -local function set_m_wexec (lib, flg) - return { - Name = "Method wexec", - Method = "wexec", - --{patt}, {subj, st} { results } - { {L".+"}, {L"abcd"}, {1,4,{}} }, -- [none] - { {L".+"}, {L"abcd",2}, {2,4,{}} }, -- positive st - { {L".+"}, {L"abcd",-2}, {3,4,{}} }, -- negative st - { {L".*"}, {L"abcd"}, {1,4,{}} }, -- [none] - { {L"bc"}, {L"abc"}, {2,3,{}} }, -- [none] - { {L "(.)b.(d)"}, {L"abcd"}, {1,4,{1,1,4,4}}},--[captures] - { {L"(a+)6+(b+)"}, {L"Taa66bbT",2}, {2,7,{2,3,6,7}}},--[st+captures] - } -end - -local function set_m_waexec (lib, flg) - return { - Name = "Method waexec", - Method = "waexec", - --{patt}, {subj, st} { results } - { {L".+"}, {L"abcd",{}}, {1,4,{}} }, -- [none] - { {L".+"}, {L"abcd",{},2}, {2,4,{}} }, -- positive st - { {L".+"}, {L"abcd",{},-2}, {3,4,{}} }, -- negative st - { {L".*"}, {L"abcd",{}}, {1,4,{}} }, -- [none] - { {L"bc"}, {L"abc", {}}, {2,3,{}} }, -- [none] - { {L "(.)b.(d)"}, {L"abcd",{}}, {1,4,{1,1,4,4}}},--[captures] - { {L"(a+)6+(b+)"}, {L"Taa66bbT",{},2}, {2,7,{2,3,6,7}}},--[st+captures] - } -end - -local function set_m_wtfind (lib, flg) - return { - Name = "Method wtfind", - Method = "wtfind", - --{patt}, {subj, st} { results } - { {L".+"}, {L"abcd"}, {1,4,{}} }, -- [none] - { {L".+"}, {L"abcd",2}, {2,4,{}} }, -- positive st - { {L".+"}, {L"abcd",-2}, {3,4,{}} }, -- negative st - { {L".*"}, {L"abcd"}, {1,4,{}} }, -- [none] - { {L"bc"}, {L"abc"}, {2,3,{}} }, -- [none] - { {L"(.)b.(d)"}, {L"abcd"}, {1,4,{L"a",L"d"}}},--[captures] - } -end - -local function set_m_watfind (lib, flg) - return { - Name = "Method watfind", - Method = "watfind", - --{patt}, {subj, st} { results } - { {L".+"}, {L"abcd",{}}, {1,4,{}} }, -- [none] - { {L".+"}, {L"abcd",{},2}, {2,4,{}} }, -- positive st - { {L".+"}, {L"abcd",{},-2}, {3,4,{}} }, -- negative st - { {L".*"}, {L"abcd",{}}, {1,4,{}} }, -- [none] - { {L"bc"}, {L"abc", {}}, {2,3,{}} }, -- [none] - { {L"(.)b.(d)"}, {L"abcd",{}}, {1,4,{L"a",L"d"}}},--[captures] - } -end - -local function set_m_wfind (lib, flg) - return { - Name = "Method wfind", - Method = "wfind", - --{patt}, {subj, st} { results } - { {L".+"}, {L"abcd"}, {1,4} }, -- [none] - { {L".+"}, {L"abcd",2}, {2,4} }, -- positive st - { {L".+"}, {L"abcd",-2}, {3,4} }, -- negative st - { {L".*"}, {L"abcd"}, {1,4} }, -- [none] - { {L"bc"}, {L"abc"}, {2,3} }, -- [none] - { {L"(.)b.(d)"}, {L"abcd"}, {1,4,L"a",L"d"}},--[captures] - } -end - -local function set_m_wmatch (lib, flg) - return { - Name = "Method wmatch", - Method = "wmatch", - --{patt}, {subj, st} { results } - { {L".+"}, {L"abcd"}, {L"abcd"} }, -- [none] - { {L".+"}, {L"abcd",2}, {L"bcd" } }, -- positive st - { {L".+"}, {L"abcd",-2}, {L"cd" } }, -- negative st - { {L".*"}, {L"abcd"}, {L"abcd"} }, -- [none] - { {L"bc"}, {L"abc"}, {L"bc" } }, -- [none] - {{ L"(.)b.(d)"}, {L"abcd"}, {L"a",L"d"} }, --[captures] - } -end - -local function set_f_wgsub1 (lib, flg) - local subj, pat = L"abcdef", L"[abef]+" - local cpat = lib.wnew(pat) - return { - Name = "Function wgsub, set1", - Func = get_wgsub (lib), - --{ s, p, f, n, res1, res2, res3 }, - { {subj, cpat, L"", 0}, {subj, 0, 0} }, -- test "n" + empty_replace - { {subj, pat, L"", 0}, {subj, 0, 0} }, -- test "n" + empty_replace - { {subj, pat, L"", -1}, {subj, 0, 0} }, -- test "n" + empty_replace - { {subj, pat, L"", 1}, {L"cdef", 1, 1} }, - { {subj, pat, L"", 2}, {L"cd", 2, 2} }, - { {subj, pat, L"", 3}, {L"cd", 2, 2} }, - { {subj, pat, L"" }, {L"cd", 2, 2} }, - { {subj, pat, L"#", 0}, {subj, 0, 0} }, -- test "n" + non-empty_replace - { {subj, pat, L"#", 1}, {L"#cdef", 1, 1} }, - { {subj, pat, L"#", 2}, {L"#cd#", 2, 2} }, - { {subj, pat, L"#", 3}, {L"#cd#", 2, 2} }, - { {subj, pat, L"#" }, {L"#cd#", 2, 2} }, - { {L"abc", L"^.",L"#" }, {L"#bc", 1, 1} }, -- anchored pattern - } -end - -local function set_f_wgsub2 (lib, flg) - local subj, pat = L"abc", L"([ac])" - return { - Name = "Function wgsub, set2", - Func = get_wgsub (lib), - --{ s, p, f, n, res1, res2, res3 }, - { {subj, pat, L"<%1>" }, {L"b", 2, 2} }, -- test non-escaped chars in f - { {subj, pat, L"%<%1%>" }, {L"b", 2, 2} }, -- test escaped chars in f - { {subj, pat, L"" }, {L"b", 2, 2} }, -- test empty replace - { {subj, pat, L"1" }, {L"1b1", 2, 2} }, -- test odd and even %'s in f - { {subj, pat, L"%1" }, {L"abc", 2, 2} }, - { {subj, pat, L"%%1" }, {L"%1b%1", 2, 2} }, - { {subj, pat, L"%%%1" }, {L"%ab%c", 2, 2} }, - { {subj, pat, L"%%%%1" }, {L"%%1b%%1", 2, 2} }, - { {subj, pat, L"%%%%%1" }, {L"%%ab%%c", 2, 2} }, - } -end - -local function set_f_wgsub3 (lib, flg) - return { - Name = "Function wgsub, set3", - Func = get_wgsub (lib), - --{ s, p, f, n, res1,res2,res3 }, - { {L"abc", L"a", L"%0" }, {L"abc", 1, 1} }, -- test (in)valid capture index - { {L"abc", L"a", L"%1" }, {L"abc", 1, 1} }, - { {L"abc", L"[ac]", L"%1" }, {L"abc", 2, 2} }, - { {L"abc", L"(a)", L"%1" }, {L"abc", 1, 1} }, - { {L"abc", L"(a)", L"%2" }, "invalid capture index" }, - } -end - -local function set_f_wgsub4 (lib, flg) - return { - Name = "Function wgsub, set4", - Func = get_wgsub (lib), - --{ s, p, f, n, res1, res2, res3 }, - { {L"a2c3", L".", L"#" }, {L"####", 4, 4} }, -- test . - { {L"a2c3", L".+", L"#" }, {L"#", 1, 1} }, -- test .+ - { {L"a2c3", L".*", L"#" }, {L"##", 2, 2} }, -- test .* - { {L"/* */ */", L"\\/\\*(.*)\\*\\/", L"#" }, {L"#", 1, 1} }, - { {L"a2c3", L"[0-9]", L"#" }, {L"a#c#", 2, 2} }, -- test %d - { {L"a2c3", L"[^0-9]", L"#" }, {L"#2#3", 2, 2} }, -- test %D - { {L"a \t\nb", L"[ \t\n]", L"#" }, {L"a###b", 3, 3} }, -- test %s - { {L"a \t\nb", L"[^ \t\n]", L"#" }, {L"# \t\n#", 2, 2} }, -- test %S - } -end - -local function set_f_wgsub5 (lib, flg) - local function frep1 () end -- returns nothing - local function frep2 () return L"#" end -- ignores arguments - local function frep3 (...) return table.concat({...}, L",") end -- "normal" - local function frep4 () return {} end -- invalid return type - local function frep5 () return L"7", L"a" end -- 2-nd return is "a" - local function frep6 () return L"7", "break" end -- 2-nd return is "break" - local subj = L"a2c3" - return { - Name = "Function wgsub, set5", - Func = get_wgsub (lib), - --{ s, p, f, n, res1, res2, res3 }, - { {subj, L"a(.)c(.)", frep1 }, {subj, 1, 0} }, - { {subj, L"a(.)c(.)", frep2 }, {L"#", 1, 1} }, - { {subj, L"a(.)c(.)", frep3 }, {L"2,3", 1, 1} }, - { {subj, L"a.c.", frep3 }, {subj, 1, 1} }, - { {subj, L"z*", frep1 }, {subj, 5, 0} }, - { {subj, L"z*", frep2 }, {L"#a#2#c#3#", 5, 5} }, - { {subj, L"z*", frep3 }, {subj, 5, 5} }, - { {subj, subj, frep4 }, "invalid return type" }, - { {L"abc",L".", frep5 }, {L"777", 3, 3} }, - { {L"abc",L".", frep6 }, {L"777", 3, 3} }, - } -end - -local function set_f_wgsub6 (lib, flg) - local tab1, tab2, tab3 = {}, { [L"2"] = 56 }, { [L"2"] = {} } - local subj = L"a2c3" - return { - Name = "Function wgsub, set6", - Func = get_wgsub (lib), - --{ s, p, f, n, res1,res2,res3 }, - { {subj, L"a(.)c(.)", tab1 }, {subj, 1, 0} }, - { {subj, L"a(.)c(.)", tab2 }, {"56", 1, 1} }, - { {subj, L"a(.)c(.)", tab3 }, "invalid replacement type" }, - { {subj, L"a.c.", tab1 }, {subj, 1, 0} }, - { {subj, L"a.c.", tab2 }, {subj, 1, 0} }, - { {subj, L"a.c.", tab3 }, {subj, 1, 0} }, - } -end - -local function set_f_wgsub8 (lib, flg) - local subj, patt, repl = L"abcdef", L"..", L"*" - return { - Name = "Function wgsub, set8", - Func = get_wgsub (lib), - --{ s, p, f, n, res1, res2, res3 }, - { {subj, patt, repl, function() end }, {L"abcdef", 3, 0} }, - { {subj, patt, repl, function() return nil end }, {L"abcdef", 3, 0} }, - { {subj, patt, repl, function() return false end }, {L"abcdef", 3, 0} }, - { {subj, patt, repl, function() return true end }, {L"***", 3, 3} }, - { {subj, patt, repl, function() return {} end }, {L"***", 3, 3} }, - { {subj, patt, repl, function() return L"#" end }, {L"###", 3, 3} }, - { {subj, patt, repl, function() return 57 end }, {"575757", 3, 3} }, - { {subj, patt, repl, function (from) return from end }, {"135", 3, 3} }, - { {subj, patt, repl, function (from, to) return to end }, {"246", 3, 3} }, - { {subj, patt, repl, function (from,to,rep) return rep end }, - {L"***", 3, 3} }, - { {subj, patt, repl, function (from, to, rep) return rep..to..from end }, - {L"*".."21"..L"*".."43"..L"*".."65", 3, 3} }, - { {subj, patt, repl, function() return nil end }, {L"abcdef", 3, 0} }, - { {subj, patt, repl, function() return nil, nil end }, {L"abcdef", 3, 0} }, - { {subj, patt, repl, function() return nil, false end }, {L"abcdef", 3, 0} }, - { {subj, patt, repl, function() return nil, true end }, {L"ab**", 3, 2} }, - { {subj, patt, repl, function() return true, true end }, {L"***", 3, 3} }, - { {subj, patt, repl, function() return nil, 0 end }, {L"abcdef", 1, 0} }, - { {subj, patt, repl, function() return true, 0 end }, {L"*cdef", 1, 1} }, - { {subj, patt, repl, function() return nil, 1 end }, {L"ab*ef", 2, 1} }, - { {subj, patt, repl, function() return true, 1 end }, {L"**ef", 2, 2} }, - } -end - -return function (libname) - local lib = require (libname) - lib.new = lib.wnew - return { - set_f_wgmatch (lib), - set_f_wsplit (lib), - set_f_wfind (lib), - set_f_wmatch (lib), - set_m_wexec (lib), - set_m_waexec (lib), - set_m_wtfind (lib), - set_m_watfind (lib), - set_m_wfind (lib), - set_m_wmatch (lib), - set_f_wgsub1 (lib), - set_f_wgsub2 (lib), - set_f_wgsub3 (lib), - set_f_wgsub4 (lib), - set_f_wgsub5 (lib), - set_f_wgsub6 (lib), - set_f_wgsub8 (lib), - } -end diff --git a/windows/mingw/Makefile b/windows/mingw/Makefile deleted file mode 100644 index 9a8a997..0000000 --- a/windows/mingw/Makefile +++ /dev/null @@ -1,35 +0,0 @@ -# Makefile for lrexlib - -ifeq ($(DIRBIT),64) -MKFILES = \ - rex_onig.mak \ - rex_pcre.mak \ - rex_pcre2.mak \ - rex_tre.mak -else -MKFILES = \ - rex_gnu.mak \ - rex_onig.mak \ - rex_pcre.mak \ - rex_pcre2.mak \ - rex_spencer.mak \ - rex_tre.mak -endif - -LOOP = @for %%d in ($(MKFILES)) do $(MAKE) -f %%d - -all: build test - -build: - $(LOOP) - -test: - $(LOOP) test - -install: - $(LOOP) install - -clean: - del *.o *.def *.dll - -.PHONY: all build test install clean diff --git a/windows/mingw/_mingw.mak b/windows/mingw/_mingw.mak deleted file mode 100644 index 3d99877..0000000 --- a/windows/mingw/_mingw.mak +++ /dev/null @@ -1,81 +0,0 @@ -# Use with GNU Make. - -# Lrexlib version -VERSION = 2.9.1 - -# User Settings ------------------------------------------------------------ - -# Target Lua version (51 for Lua 5.1, etc.) -LUAVERSION = 51 -LUADOTVERSION = $(subst 5,5.,$(LUAVERSION)) - -# Target bitness: 32 or 64 -DIRBIT = 32 -# GCC location (GCC32 and GCC64 are defined environment variables) -PATH = $(GCC$(DIRBIT)) - -# INSTALLPATH : Path to install the built DLL. -# LUADLL : Lua DLL to link to (.dll should be omitted). -# LUAEXE : Lua interpreter. -# LUAINC : Path of Lua include files. -# LIBPATH : Path of lua51.dll, lua52.dll, pcre.dll, etc. - -INSTALLPATH = S:\Progr\Exe\lib$(DIRBIT)\lua\$(LUADOTVERSION) -LUADLL = lua$(LUAVERSION) -LUAINC = $(PATH_SYSTEM)\include\lua\$(LUADOTVERSION) -LIBPATH = $(CROOT)\Programs\EXE$(DIRBIT) - -ifeq ($(LUAVERSION),51) - LUAEXE = $(LIBPATH)\lua.exe - CREATEGLOBAL = -DREX_CREATEGLOBALVAR -else - LUAEXE = $(LIBPATH)\lua$(LUAVERSION).exe -endif -# -------------------------------------------------------------------------- - -BIN = $(PROJECT).dll -BININSTALL = $(INSTALLPATH)\$(BIN) -CC = gcc -AR = ar rcu -RANLIB = ranlib -CFLAGS = -W -Wall -O2 $(INCS) -DREX_OPENLIB=luaopen_$(PROJECT) \ - -DREX_LIBNAME=\"$(PROJECT)\" -DVERSION=\"$(VERSION)\" \ - -m$(DIRBIT) $(CREATEGLOBAL) $(MYCFLAGS) -DEFFILE = $(PROJECT).def -EXPORTED = luaopen_$(PROJECT) -INCS = -I$(LUAINC) $(MYINCS) -LIBS = -l$(LUADLL) -m$(DIRBIT) -s $(MYLIBS) -SRCPATH = ..\..\src -TESTPATH = ..\..\test - -.PHONY: all install test vtest clean - -vpath %.c $(SRCPATH);$(SRCPATH)\$(PROJDIR) -vpath %.h $(SRCPATH);$(SRCPATH)\$(PROJDIR) - -all: $(BIN) - -clean: - del $(OBJ) $(BIN) $(DEFFILE) - -install: $(BININSTALL) - -test: - cd $(TESTPATH) && $(LUAEXE) runtest.lua $(TESTNAME) -d$(CURDIR) - -vtest: - cd $(TESTPATH) && $(LUAEXE) runtest.lua -v $(TESTNAME) -d$(CURDIR) - -$(BIN): $(OBJ) $(DEFFILE) - $(CC) $(DEFFILE) $(OBJ) -L$(LIBPATH) $(LIBS) -o $@ -shared - -lib$(PROJECT)$(LUAVERSION).a: $(OBJ) - $(AR) $@ $? - $(RANLIB) $@ - -$(DEFFILE): - echo EXPORTS > $@ - for %%d in ($(EXPORTED)) do echo %%d>> $@ - -$(BININSTALL): $(BIN) - copy /Y $< $@ diff --git a/windows/mingw/docs.mak b/windows/mingw/docs.mak deleted file mode 100644 index 7c813aa..0000000 --- a/windows/mingw/docs.mak +++ /dev/null @@ -1,13 +0,0 @@ -# Documentation Makefile - -APP = rst2html.py -CP = "copy /y" -RM = del -IDX = ..\README.rst - -ALLVAR = APP=$(APP) CP=$(CP) RM=$(RM) IDX=$(IDX) - -.PHONY: all clean - -all clean: - cd ..\..\doc && $(MAKE) $(ALLVAR) $@ diff --git a/windows/mingw/rex_gnu.mak b/windows/mingw/rex_gnu.mak deleted file mode 100644 index 1cc953b..0000000 --- a/windows/mingw/rex_gnu.mak +++ /dev/null @@ -1,18 +0,0 @@ -# Project: rex_gnu - -# User Settings ------------------------------------------------------------ -# path of GNU include files -REGEXINC = $(PATH_WORK)\system\include\gnuregex -# -------------------------------------------------------------------------- - -PROJECT = rex_gnu -MYINCS = -I$(REGEXINC) -MYLIBS = -lregex2 -OBJ = lgnu.o common.o -PROJDIR = gnu -TESTNAME = gnu - -include _mingw.mak - -lgnu.o : common.h algo.h -common.o : common.h diff --git a/windows/mingw/rex_onig.mak b/windows/mingw/rex_onig.mak deleted file mode 100644 index fa73cf7..0000000 --- a/windows/mingw/rex_onig.mak +++ /dev/null @@ -1,19 +0,0 @@ -# Project: rex_onig - -# User Settings ------------------------------------------------------------ -# path of Oniguruma include files -REGEXINC = $(PATH_WORK)\system\include\oniguruma -# -------------------------------------------------------------------------- - -PROJECT = rex_onig -MYINCS = -I$(REGEXINC) -MYLIBS = -lonig -Wl,--enable-auto-import -OBJ = lonig.o lonig_f.o common.o -PROJDIR = oniguruma -TESTNAME = oniguruma - -include _mingw.mak - -lonig.o : common.h algo.h -lonig_f.o : common.h -common.o : common.h diff --git a/windows/mingw/rex_pcre.mak b/windows/mingw/rex_pcre.mak deleted file mode 100644 index 5c5edce..0000000 --- a/windows/mingw/rex_pcre.mak +++ /dev/null @@ -1,19 +0,0 @@ -# Project: rex_pcre - -# User Settings ------------------------------------------------------------ -# path of PCRE include files -REGEXINC = $(PATH_WORK)\system\include\pcre -# -------------------------------------------------------------------------- - -PROJECT = rex_pcre -MYINCS = -I$(REGEXINC) -MYLIBS = -lpcre -OBJ = lpcre.o lpcre_f.o common.o -PROJDIR = pcre -TESTNAME = pcre - -include _mingw.mak - -lpcre.o : common.h algo.h -lpcre_f.o : common.h -common.o : common.h diff --git a/windows/mingw/rex_pcre2.mak b/windows/mingw/rex_pcre2.mak deleted file mode 100644 index ce88b25..0000000 --- a/windows/mingw/rex_pcre2.mak +++ /dev/null @@ -1,20 +0,0 @@ -# Project: rex_pcre2 - -# User Settings ------------------------------------------------------------ -# path of PCRE2 include files -REGEXINC = $(PATH_WORK)\system\include\pcre2 -# -------------------------------------------------------------------------- - -PROJECT = rex_pcre2 -MYINCS = -I$(REGEXINC) -MYCFLAGS = -DPCRE2_CODE_UNIT_WIDTH=8 -MYLIBS = -lpcre2 -OBJ = lpcre2.o lpcre2_f.o common.o -PROJDIR = pcre2 -TESTNAME = pcre2 - -include _mingw.mak - -lpcre2.o : common.h algo.h -lpcre2_f.o : common.h -common.o : common.h diff --git a/windows/mingw/rex_spencer.mak b/windows/mingw/rex_spencer.mak deleted file mode 100644 index 611e064..0000000 --- a/windows/mingw/rex_spencer.mak +++ /dev/null @@ -1,18 +0,0 @@ -# Project: rex_spencer - -# User Settings ------------------------------------------------------------ -# path of Spencer's include files -REGEXINC = $(PATH_WORK)\system\include\rxspencer -# -------------------------------------------------------------------------- - -PROJECT = rex_spencer -MYINCS = -I$(REGEXINC) -MYLIBS = -lrxspencer -OBJ = lposix.o common.o -PROJDIR = posix -TESTNAME = spencer - -include _mingw.mak - -lposix.o : common.h algo.h -common.o : common.h diff --git a/windows/mingw/rex_tre.mak b/windows/mingw/rex_tre.mak deleted file mode 100644 index b470254..0000000 --- a/windows/mingw/rex_tre.mak +++ /dev/null @@ -1,26 +0,0 @@ -# Project: rex_tre - -# User Settings ------------------------------------------------------------ -# path of TRE include files -REGEXINC = $(PATH_WORK)\system\include -# -------------------------------------------------------------------------- - -PROJECT = rex_tre -MYINCS = -I$(REGEXINC) -MYLIBS = -ltre -OBJ = ltre.o common.o -PROJDIR = tre -TESTNAME = tre - -# Uncomment the following line to add wide-character functions (in alpha state). -# ADDWIDECHARFUNCS = 1 -ifdef ADDWIDECHARFUNCS - OBJ += ltre_w.o - MYCFLAGS += -DREX_ADDWIDECHARFUNCS -endif - -include _mingw.mak - -ltre.o : common.h algo.h -ltre_w.o : common.h algo.h -common.o : common.h