| 49 |
#include <errno.h> |
#include <errno.h> |
| 50 |
|
|
| 51 |
#ifdef SUPPORT_LIBREADLINE |
#ifdef SUPPORT_LIBREADLINE |
| 52 |
|
#ifdef HAVE_UNISTD_H |
| 53 |
#include <unistd.h> |
#include <unistd.h> |
| 54 |
|
#endif |
| 55 |
#include <readline/readline.h> |
#include <readline/readline.h> |
| 56 |
#include <readline/history.h> |
#include <readline/history.h> |
| 57 |
#endif |
#endif |
| 71 |
#define INPUT_MODE "r" |
#define INPUT_MODE "r" |
| 72 |
#define OUTPUT_MODE "wb" |
#define OUTPUT_MODE "wb" |
| 73 |
|
|
| 74 |
|
#ifndef isatty |
| 75 |
|
#define isatty _isatty /* This is what Windows calls them, I'm told, */ |
| 76 |
|
#endif /* though in some environments they seem to */ |
| 77 |
|
/* be already defined, hence the #ifndefs. */ |
| 78 |
|
#ifndef fileno |
| 79 |
|
#define fileno _fileno |
| 80 |
|
#endif |
| 81 |
|
|
| 82 |
|
/* A user sent this fix for Borland Builder 5 under Windows. */ |
| 83 |
|
|
| 84 |
|
#ifdef __BORLANDC__ |
| 85 |
|
#define _setmode(handle, mode) setmode(handle, mode) |
| 86 |
|
#endif |
| 87 |
|
|
| 88 |
|
/* Not Windows */ |
| 89 |
|
|
| 90 |
#else |
#else |
| 91 |
#include <sys/time.h> /* These two includes are needed */ |
#include <sys/time.h> /* These two includes are needed */ |
| 92 |
#include <sys/resource.h> /* for setrlimit(). */ |
#include <sys/resource.h> /* for setrlimit(). */ |
| 107 |
#include "pcre.h" |
#include "pcre.h" |
| 108 |
#include "pcre_internal.h" |
#include "pcre_internal.h" |
| 109 |
|
|
| 110 |
/* We need access to the data tables that PCRE uses. So as not to have to keep |
/* We need access to some of the data tables that PCRE uses. So as not to have |
| 111 |
two copies, we include the source file here, changing the names of the external |
to keep two copies, we include the source file here, changing the names of the |
| 112 |
symbols to prevent clashes. */ |
external symbols to prevent clashes. */ |
| 113 |
|
|
| 114 |
|
#define _pcre_ucp_gentype ucp_gentype |
| 115 |
|
#define _pcre_ucp_typerange ucp_typerange |
| 116 |
#define _pcre_utf8_table1 utf8_table1 |
#define _pcre_utf8_table1 utf8_table1 |
| 117 |
#define _pcre_utf8_table1_size utf8_table1_size |
#define _pcre_utf8_table1_size utf8_table1_size |
| 118 |
#define _pcre_utf8_table2 utf8_table2 |
#define _pcre_utf8_table2 utf8_table2 |
| 119 |
#define _pcre_utf8_table3 utf8_table3 |
#define _pcre_utf8_table3 utf8_table3 |
| 120 |
#define _pcre_utf8_table4 utf8_table4 |
#define _pcre_utf8_table4 utf8_table4 |
| 121 |
|
#define _pcre_utf8_char_sizes utf8_char_sizes |
| 122 |
#define _pcre_utt utt |
#define _pcre_utt utt |
| 123 |
#define _pcre_utt_size utt_size |
#define _pcre_utt_size utt_size |
| 124 |
#define _pcre_utt_names utt_names |
#define _pcre_utt_names utt_names |
| 128 |
|
|
| 129 |
/* We also need the pcre_printint() function for printing out compiled |
/* We also need the pcre_printint() function for printing out compiled |
| 130 |
patterns. This function is in a separate file so that it can be included in |
patterns. This function is in a separate file so that it can be included in |
| 131 |
pcre_compile.c when that module is compiled with debugging enabled. |
pcre_compile.c when that module is compiled with debugging enabled. It needs to |
| 132 |
|
know which case is being compiled. */ |
|
The definition of the macro PRINTABLE, which determines whether to print an |
|
|
output character as-is or as a hex value when showing compiled patterns, is |
|
|
contained in this file. We uses it here also, in cases when the locale has not |
|
|
been explicitly changed, so as to get consistent output from systems that |
|
|
differ in their output from isprint() even in the "C" locale. */ |
|
| 133 |
|
|
| 134 |
|
#define COMPILING_PCRETEST |
| 135 |
#include "pcre_printint.src" |
#include "pcre_printint.src" |
| 136 |
|
|
| 137 |
#define PRINTHEX(c) (locale_set? isprint(c) : PRINTABLE(c)) |
/* The definition of the macro PRINTABLE, which determines whether to print an |
| 138 |
|
output character as-is or as a hex value when showing compiled patterns, is |
| 139 |
|
contained in the printint.src file. We uses it here also, in cases when the |
| 140 |
|
locale has not been explicitly changed, so as to get consistent output from |
| 141 |
|
systems that differ in their output from isprint() even in the "C" locale. */ |
| 142 |
|
|
| 143 |
|
#define PRINTHEX(c) (locale_set? isprint(c) : PRINTABLE(c)) |
| 144 |
|
|
| 145 |
/* It is possible to compile this test program without including support for |
/* It is possible to compile this test program without including support for |
| 146 |
testing the POSIX interface, though this is not available via the standard |
testing the POSIX interface, though this is not available via the standard |
| 191 |
static int show_malloc; |
static int show_malloc; |
| 192 |
static int use_utf8; |
static int use_utf8; |
| 193 |
static size_t gotten_store; |
static size_t gotten_store; |
| 194 |
|
static const unsigned char *last_callout_mark = NULL; |
| 195 |
|
|
| 196 |
/* The buffers grow automatically if very long input lines are encountered. */ |
/* The buffers grow automatically if very long input lines are encountered. */ |
| 197 |
|
|
| 200 |
static uschar *dbuffer = NULL; |
static uschar *dbuffer = NULL; |
| 201 |
static uschar *pbuffer = NULL; |
static uschar *pbuffer = NULL; |
| 202 |
|
|
| 203 |
|
/* Textual explanations for runtime error codes */ |
| 204 |
|
|
| 205 |
|
static const char *errtexts[] = { |
| 206 |
|
NULL, /* 0 is no error */ |
| 207 |
|
NULL, /* NOMATCH is handled specially */ |
| 208 |
|
"NULL argument passed", |
| 209 |
|
"bad option value", |
| 210 |
|
"magic number missing", |
| 211 |
|
"unknown opcode - pattern overwritten?", |
| 212 |
|
"no more memory", |
| 213 |
|
NULL, /* never returned by pcre_exec() or pcre_dfa_exec() */ |
| 214 |
|
"match limit exceeded", |
| 215 |
|
"callout error code", |
| 216 |
|
NULL, /* BADUTF8 is handled specially */ |
| 217 |
|
"bad UTF-8 offset", |
| 218 |
|
NULL, /* PARTIAL is handled specially */ |
| 219 |
|
"not used - internal error", |
| 220 |
|
"internal error - pattern overwritten?", |
| 221 |
|
"bad count value", |
| 222 |
|
"item unsupported for DFA matching", |
| 223 |
|
"backreference condition or recursion test not supported for DFA matching", |
| 224 |
|
"match limit not supported for DFA matching", |
| 225 |
|
"workspace size exceeded in DFA matching", |
| 226 |
|
"too much recursion for DFA matching", |
| 227 |
|
"recursion limit exceeded", |
| 228 |
|
"not used - internal error", |
| 229 |
|
"invalid combination of newline options", |
| 230 |
|
"bad offset value", |
| 231 |
|
NULL, /* SHORTUTF8 is handled specially */ |
| 232 |
|
"nested recursion at the same subject position", |
| 233 |
|
"JIT stack limit reached" |
| 234 |
|
}; |
| 235 |
|
|
| 236 |
|
|
| 237 |
|
/************************************************* |
| 238 |
|
* Alternate character tables * |
| 239 |
|
*************************************************/ |
| 240 |
|
|
| 241 |
|
/* By default, the "tables" pointer when calling PCRE is set to NULL, thereby |
| 242 |
|
using the default tables of the library. However, the T option can be used to |
| 243 |
|
select alternate sets of tables, for different kinds of testing. Note also that |
| 244 |
|
the L (locale) option also adjusts the tables. */ |
| 245 |
|
|
| 246 |
|
/* This is the set of tables distributed as default with PCRE. It recognizes |
| 247 |
|
only ASCII characters. */ |
| 248 |
|
|
| 249 |
|
static const unsigned char tables0[] = { |
| 250 |
|
|
| 251 |
|
/* This table is a lower casing table. */ |
| 252 |
|
|
| 253 |
|
0, 1, 2, 3, 4, 5, 6, 7, |
| 254 |
|
8, 9, 10, 11, 12, 13, 14, 15, |
| 255 |
|
16, 17, 18, 19, 20, 21, 22, 23, |
| 256 |
|
24, 25, 26, 27, 28, 29, 30, 31, |
| 257 |
|
32, 33, 34, 35, 36, 37, 38, 39, |
| 258 |
|
40, 41, 42, 43, 44, 45, 46, 47, |
| 259 |
|
48, 49, 50, 51, 52, 53, 54, 55, |
| 260 |
|
56, 57, 58, 59, 60, 61, 62, 63, |
| 261 |
|
64, 97, 98, 99,100,101,102,103, |
| 262 |
|
104,105,106,107,108,109,110,111, |
| 263 |
|
112,113,114,115,116,117,118,119, |
| 264 |
|
120,121,122, 91, 92, 93, 94, 95, |
| 265 |
|
96, 97, 98, 99,100,101,102,103, |
| 266 |
|
104,105,106,107,108,109,110,111, |
| 267 |
|
112,113,114,115,116,117,118,119, |
| 268 |
|
120,121,122,123,124,125,126,127, |
| 269 |
|
128,129,130,131,132,133,134,135, |
| 270 |
|
136,137,138,139,140,141,142,143, |
| 271 |
|
144,145,146,147,148,149,150,151, |
| 272 |
|
152,153,154,155,156,157,158,159, |
| 273 |
|
160,161,162,163,164,165,166,167, |
| 274 |
|
168,169,170,171,172,173,174,175, |
| 275 |
|
176,177,178,179,180,181,182,183, |
| 276 |
|
184,185,186,187,188,189,190,191, |
| 277 |
|
192,193,194,195,196,197,198,199, |
| 278 |
|
200,201,202,203,204,205,206,207, |
| 279 |
|
208,209,210,211,212,213,214,215, |
| 280 |
|
216,217,218,219,220,221,222,223, |
| 281 |
|
224,225,226,227,228,229,230,231, |
| 282 |
|
232,233,234,235,236,237,238,239, |
| 283 |
|
240,241,242,243,244,245,246,247, |
| 284 |
|
248,249,250,251,252,253,254,255, |
| 285 |
|
|
| 286 |
|
/* This table is a case flipping table. */ |
| 287 |
|
|
| 288 |
|
0, 1, 2, 3, 4, 5, 6, 7, |
| 289 |
|
8, 9, 10, 11, 12, 13, 14, 15, |
| 290 |
|
16, 17, 18, 19, 20, 21, 22, 23, |
| 291 |
|
24, 25, 26, 27, 28, 29, 30, 31, |
| 292 |
|
32, 33, 34, 35, 36, 37, 38, 39, |
| 293 |
|
40, 41, 42, 43, 44, 45, 46, 47, |
| 294 |
|
48, 49, 50, 51, 52, 53, 54, 55, |
| 295 |
|
56, 57, 58, 59, 60, 61, 62, 63, |
| 296 |
|
64, 97, 98, 99,100,101,102,103, |
| 297 |
|
104,105,106,107,108,109,110,111, |
| 298 |
|
112,113,114,115,116,117,118,119, |
| 299 |
|
120,121,122, 91, 92, 93, 94, 95, |
| 300 |
|
96, 65, 66, 67, 68, 69, 70, 71, |
| 301 |
|
72, 73, 74, 75, 76, 77, 78, 79, |
| 302 |
|
80, 81, 82, 83, 84, 85, 86, 87, |
| 303 |
|
88, 89, 90,123,124,125,126,127, |
| 304 |
|
128,129,130,131,132,133,134,135, |
| 305 |
|
136,137,138,139,140,141,142,143, |
| 306 |
|
144,145,146,147,148,149,150,151, |
| 307 |
|
152,153,154,155,156,157,158,159, |
| 308 |
|
160,161,162,163,164,165,166,167, |
| 309 |
|
168,169,170,171,172,173,174,175, |
| 310 |
|
176,177,178,179,180,181,182,183, |
| 311 |
|
184,185,186,187,188,189,190,191, |
| 312 |
|
192,193,194,195,196,197,198,199, |
| 313 |
|
200,201,202,203,204,205,206,207, |
| 314 |
|
208,209,210,211,212,213,214,215, |
| 315 |
|
216,217,218,219,220,221,222,223, |
| 316 |
|
224,225,226,227,228,229,230,231, |
| 317 |
|
232,233,234,235,236,237,238,239, |
| 318 |
|
240,241,242,243,244,245,246,247, |
| 319 |
|
248,249,250,251,252,253,254,255, |
| 320 |
|
|
| 321 |
|
/* This table contains bit maps for various character classes. Each map is 32 |
| 322 |
|
bytes long and the bits run from the least significant end of each byte. The |
| 323 |
|
classes that have their own maps are: space, xdigit, digit, upper, lower, word, |
| 324 |
|
graph, print, punct, and cntrl. Other classes are built from combinations. */ |
| 325 |
|
|
| 326 |
|
0x00,0x3e,0x00,0x00,0x01,0x00,0x00,0x00, |
| 327 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 328 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 329 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 330 |
|
|
| 331 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, |
| 332 |
|
0x7e,0x00,0x00,0x00,0x7e,0x00,0x00,0x00, |
| 333 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 334 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 335 |
|
|
| 336 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, |
| 337 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 338 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 339 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 340 |
|
|
| 341 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 342 |
|
0xfe,0xff,0xff,0x07,0x00,0x00,0x00,0x00, |
| 343 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 344 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 345 |
|
|
| 346 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 347 |
|
0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0x07, |
| 348 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 349 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 350 |
|
|
| 351 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0xff,0x03, |
| 352 |
|
0xfe,0xff,0xff,0x87,0xfe,0xff,0xff,0x07, |
| 353 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 354 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 355 |
|
|
| 356 |
|
0x00,0x00,0x00,0x00,0xfe,0xff,0xff,0xff, |
| 357 |
|
0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, |
| 358 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 359 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 360 |
|
|
| 361 |
|
0x00,0x00,0x00,0x00,0xff,0xff,0xff,0xff, |
| 362 |
|
0xff,0xff,0xff,0xff,0xff,0xff,0xff,0x7f, |
| 363 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 364 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 365 |
|
|
| 366 |
|
0x00,0x00,0x00,0x00,0xfe,0xff,0x00,0xfc, |
| 367 |
|
0x01,0x00,0x00,0xf8,0x01,0x00,0x00,0x78, |
| 368 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 369 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 370 |
|
|
| 371 |
|
0xff,0xff,0xff,0xff,0x00,0x00,0x00,0x00, |
| 372 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80, |
| 373 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 374 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, |
| 375 |
|
|
| 376 |
|
/* This table identifies various classes of character by individual bits: |
| 377 |
|
0x01 white space character |
| 378 |
|
0x02 letter |
| 379 |
|
0x04 decimal digit |
| 380 |
|
0x08 hexadecimal digit |
| 381 |
|
0x10 alphanumeric or '_' |
| 382 |
|
0x80 regular expression metacharacter or binary zero |
| 383 |
|
*/ |
| 384 |
|
|
| 385 |
|
0x80,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 */ |
| 386 |
|
0x00,0x01,0x01,0x00,0x01,0x01,0x00,0x00, /* 8- 15 */ |
| 387 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 */ |
| 388 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */ |
| 389 |
|
0x01,0x00,0x00,0x00,0x80,0x00,0x00,0x00, /* - ' */ |
| 390 |
|
0x80,0x80,0x80,0x80,0x00,0x00,0x80,0x00, /* ( - / */ |
| 391 |
|
0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c, /* 0 - 7 */ |
| 392 |
|
0x1c,0x1c,0x00,0x00,0x00,0x00,0x00,0x80, /* 8 - ? */ |
| 393 |
|
0x00,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /* @ - G */ |
| 394 |
|
0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* H - O */ |
| 395 |
|
0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* P - W */ |
| 396 |
|
0x12,0x12,0x12,0x80,0x80,0x00,0x80,0x10, /* X - _ */ |
| 397 |
|
0x00,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /* ` - g */ |
| 398 |
|
0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* h - o */ |
| 399 |
|
0x12,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* p - w */ |
| 400 |
|
0x12,0x12,0x12,0x80,0x80,0x00,0x00,0x00, /* x -127 */ |
| 401 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */ |
| 402 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */ |
| 403 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */ |
| 404 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */ |
| 405 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */ |
| 406 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */ |
| 407 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */ |
| 408 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */ |
| 409 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */ |
| 410 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */ |
| 411 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */ |
| 412 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */ |
| 413 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */ |
| 414 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */ |
| 415 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */ |
| 416 |
|
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */ |
| 417 |
|
|
| 418 |
|
/* This is a set of tables that came orginally from a Windows user. It seems to |
| 419 |
|
be at least an approximation of ISO 8859. In particular, there are characters |
| 420 |
|
greater than 128 that are marked as spaces, letters, etc. */ |
| 421 |
|
|
| 422 |
|
static const unsigned char tables1[] = { |
| 423 |
|
0,1,2,3,4,5,6,7, |
| 424 |
|
8,9,10,11,12,13,14,15, |
| 425 |
|
16,17,18,19,20,21,22,23, |
| 426 |
|
24,25,26,27,28,29,30,31, |
| 427 |
|
32,33,34,35,36,37,38,39, |
| 428 |
|
40,41,42,43,44,45,46,47, |
| 429 |
|
48,49,50,51,52,53,54,55, |
| 430 |
|
56,57,58,59,60,61,62,63, |
| 431 |
|
64,97,98,99,100,101,102,103, |
| 432 |
|
104,105,106,107,108,109,110,111, |
| 433 |
|
112,113,114,115,116,117,118,119, |
| 434 |
|
120,121,122,91,92,93,94,95, |
| 435 |
|
96,97,98,99,100,101,102,103, |
| 436 |
|
104,105,106,107,108,109,110,111, |
| 437 |
|
112,113,114,115,116,117,118,119, |
| 438 |
|
120,121,122,123,124,125,126,127, |
| 439 |
|
128,129,130,131,132,133,134,135, |
| 440 |
|
136,137,138,139,140,141,142,143, |
| 441 |
|
144,145,146,147,148,149,150,151, |
| 442 |
|
152,153,154,155,156,157,158,159, |
| 443 |
|
160,161,162,163,164,165,166,167, |
| 444 |
|
168,169,170,171,172,173,174,175, |
| 445 |
|
176,177,178,179,180,181,182,183, |
| 446 |
|
184,185,186,187,188,189,190,191, |
| 447 |
|
224,225,226,227,228,229,230,231, |
| 448 |
|
232,233,234,235,236,237,238,239, |
| 449 |
|
240,241,242,243,244,245,246,215, |
| 450 |
|
248,249,250,251,252,253,254,223, |
| 451 |
|
224,225,226,227,228,229,230,231, |
| 452 |
|
232,233,234,235,236,237,238,239, |
| 453 |
|
240,241,242,243,244,245,246,247, |
| 454 |
|
248,249,250,251,252,253,254,255, |
| 455 |
|
0,1,2,3,4,5,6,7, |
| 456 |
|
8,9,10,11,12,13,14,15, |
| 457 |
|
16,17,18,19,20,21,22,23, |
| 458 |
|
24,25,26,27,28,29,30,31, |
| 459 |
|
32,33,34,35,36,37,38,39, |
| 460 |
|
40,41,42,43,44,45,46,47, |
| 461 |
|
48,49,50,51,52,53,54,55, |
| 462 |
|
56,57,58,59,60,61,62,63, |
| 463 |
|
64,97,98,99,100,101,102,103, |
| 464 |
|
104,105,106,107,108,109,110,111, |
| 465 |
|
112,113,114,115,116,117,118,119, |
| 466 |
|
120,121,122,91,92,93,94,95, |
| 467 |
|
96,65,66,67,68,69,70,71, |
| 468 |
|
72,73,74,75,76,77,78,79, |
| 469 |
|
80,81,82,83,84,85,86,87, |
| 470 |
|
88,89,90,123,124,125,126,127, |
| 471 |
|
128,129,130,131,132,133,134,135, |
| 472 |
|
136,137,138,139,140,141,142,143, |
| 473 |
|
144,145,146,147,148,149,150,151, |
| 474 |
|
152,153,154,155,156,157,158,159, |
| 475 |
|
160,161,162,163,164,165,166,167, |
| 476 |
|
168,169,170,171,172,173,174,175, |
| 477 |
|
176,177,178,179,180,181,182,183, |
| 478 |
|
184,185,186,187,188,189,190,191, |
| 479 |
|
224,225,226,227,228,229,230,231, |
| 480 |
|
232,233,234,235,236,237,238,239, |
| 481 |
|
240,241,242,243,244,245,246,215, |
| 482 |
|
248,249,250,251,252,253,254,223, |
| 483 |
|
192,193,194,195,196,197,198,199, |
| 484 |
|
200,201,202,203,204,205,206,207, |
| 485 |
|
208,209,210,211,212,213,214,247, |
| 486 |
|
216,217,218,219,220,221,222,255, |
| 487 |
|
0,62,0,0,1,0,0,0, |
| 488 |
|
0,0,0,0,0,0,0,0, |
| 489 |
|
32,0,0,0,1,0,0,0, |
| 490 |
|
0,0,0,0,0,0,0,0, |
| 491 |
|
0,0,0,0,0,0,255,3, |
| 492 |
|
126,0,0,0,126,0,0,0, |
| 493 |
|
0,0,0,0,0,0,0,0, |
| 494 |
|
0,0,0,0,0,0,0,0, |
| 495 |
|
0,0,0,0,0,0,255,3, |
| 496 |
|
0,0,0,0,0,0,0,0, |
| 497 |
|
0,0,0,0,0,0,12,2, |
| 498 |
|
0,0,0,0,0,0,0,0, |
| 499 |
|
0,0,0,0,0,0,0,0, |
| 500 |
|
254,255,255,7,0,0,0,0, |
| 501 |
|
0,0,0,0,0,0,0,0, |
| 502 |
|
255,255,127,127,0,0,0,0, |
| 503 |
|
0,0,0,0,0,0,0,0, |
| 504 |
|
0,0,0,0,254,255,255,7, |
| 505 |
|
0,0,0,0,0,4,32,4, |
| 506 |
|
0,0,0,128,255,255,127,255, |
| 507 |
|
0,0,0,0,0,0,255,3, |
| 508 |
|
254,255,255,135,254,255,255,7, |
| 509 |
|
0,0,0,0,0,4,44,6, |
| 510 |
|
255,255,127,255,255,255,127,255, |
| 511 |
|
0,0,0,0,254,255,255,255, |
| 512 |
|
255,255,255,255,255,255,255,127, |
| 513 |
|
0,0,0,0,254,255,255,255, |
| 514 |
|
255,255,255,255,255,255,255,255, |
| 515 |
|
0,2,0,0,255,255,255,255, |
| 516 |
|
255,255,255,255,255,255,255,127, |
| 517 |
|
0,0,0,0,255,255,255,255, |
| 518 |
|
255,255,255,255,255,255,255,255, |
| 519 |
|
0,0,0,0,254,255,0,252, |
| 520 |
|
1,0,0,248,1,0,0,120, |
| 521 |
|
0,0,0,0,254,255,255,255, |
| 522 |
|
0,0,128,0,0,0,128,0, |
| 523 |
|
255,255,255,255,0,0,0,0, |
| 524 |
|
0,0,0,0,0,0,0,128, |
| 525 |
|
255,255,255,255,0,0,0,0, |
| 526 |
|
0,0,0,0,0,0,0,0, |
| 527 |
|
128,0,0,0,0,0,0,0, |
| 528 |
|
0,1,1,0,1,1,0,0, |
| 529 |
|
0,0,0,0,0,0,0,0, |
| 530 |
|
0,0,0,0,0,0,0,0, |
| 531 |
|
1,0,0,0,128,0,0,0, |
| 532 |
|
128,128,128,128,0,0,128,0, |
| 533 |
|
28,28,28,28,28,28,28,28, |
| 534 |
|
28,28,0,0,0,0,0,128, |
| 535 |
|
0,26,26,26,26,26,26,18, |
| 536 |
|
18,18,18,18,18,18,18,18, |
| 537 |
|
18,18,18,18,18,18,18,18, |
| 538 |
|
18,18,18,128,128,0,128,16, |
| 539 |
|
0,26,26,26,26,26,26,18, |
| 540 |
|
18,18,18,18,18,18,18,18, |
| 541 |
|
18,18,18,18,18,18,18,18, |
| 542 |
|
18,18,18,128,128,0,0,0, |
| 543 |
|
0,0,0,0,0,1,0,0, |
| 544 |
|
0,0,0,0,0,0,0,0, |
| 545 |
|
0,0,0,0,0,0,0,0, |
| 546 |
|
0,0,0,0,0,0,0,0, |
| 547 |
|
1,0,0,0,0,0,0,0, |
| 548 |
|
0,0,18,0,0,0,0,0, |
| 549 |
|
0,0,20,20,0,18,0,0, |
| 550 |
|
0,20,18,0,0,0,0,0, |
| 551 |
|
18,18,18,18,18,18,18,18, |
| 552 |
|
18,18,18,18,18,18,18,18, |
| 553 |
|
18,18,18,18,18,18,18,0, |
| 554 |
|
18,18,18,18,18,18,18,18, |
| 555 |
|
18,18,18,18,18,18,18,18, |
| 556 |
|
18,18,18,18,18,18,18,18, |
| 557 |
|
18,18,18,18,18,18,18,0, |
| 558 |
|
18,18,18,18,18,18,18,18 |
| 559 |
|
}; |
| 560 |
|
|
| 561 |
|
|
| 562 |
|
|
| 563 |
|
|
| 564 |
|
#ifndef HAVE_STRERROR |
| 565 |
|
/************************************************* |
| 566 |
|
* Provide strerror() for non-ANSI libraries * |
| 567 |
|
*************************************************/ |
| 568 |
|
|
| 569 |
|
/* Some old-fashioned systems still around (e.g. SunOS4) don't have strerror() |
| 570 |
|
in their libraries, but can provide the same facility by this simple |
| 571 |
|
alternative function. */ |
| 572 |
|
|
| 573 |
|
extern int sys_nerr; |
| 574 |
|
extern char *sys_errlist[]; |
| 575 |
|
|
| 576 |
|
char * |
| 577 |
|
strerror(int n) |
| 578 |
|
{ |
| 579 |
|
if (n < 0 || n >= sys_nerr) return "unknown error number"; |
| 580 |
|
return sys_errlist[n]; |
| 581 |
|
} |
| 582 |
|
#endif /* HAVE_STRERROR */ |
| 583 |
|
|
| 584 |
|
|
| 585 |
|
/************************************************* |
| 586 |
|
* JIT memory callback * |
| 587 |
|
*************************************************/ |
| 588 |
|
|
| 589 |
|
static pcre_jit_stack* jit_callback(void *arg) |
| 590 |
|
{ |
| 591 |
|
return (pcre_jit_stack *)arg; |
| 592 |
|
} |
| 593 |
|
|
| 594 |
|
|
| 595 |
/************************************************* |
/************************************************* |
| 622 |
|
|
| 623 |
for (;;) |
for (;;) |
| 624 |
{ |
{ |
| 625 |
int rlen = buffer_size - (here - buffer); |
int rlen = (int)(buffer_size - (here - buffer)); |
| 626 |
|
|
| 627 |
if (rlen > 1000) |
if (rlen > 1000) |
| 628 |
{ |
{ |
| 652 |
/* Read the next line by normal means, prompting if the file is stdin. */ |
/* Read the next line by normal means, prompting if the file is stdin. */ |
| 653 |
|
|
| 654 |
{ |
{ |
| 655 |
if (f == stdin) printf(prompt); |
if (f == stdin) printf("%s", prompt); |
| 656 |
if (fgets((char *)here, rlen, f) == NULL) |
if (fgets((char *)here, rlen, f) == NULL) |
| 657 |
return (here == start)? NULL : start; |
return (here == start)? NULL : start; |
| 658 |
} |
} |
| 972 |
fprintf(outfile, "\n"); |
fprintf(outfile, "\n"); |
| 973 |
first_callout = 0; |
first_callout = 0; |
| 974 |
|
|
| 975 |
|
if (cb->mark != last_callout_mark) |
| 976 |
|
{ |
| 977 |
|
fprintf(outfile, "Latest Mark: %s\n", |
| 978 |
|
(cb->mark == NULL)? "<unset>" : (char *)(cb->mark)); |
| 979 |
|
last_callout_mark = cb->mark; |
| 980 |
|
} |
| 981 |
|
|
| 982 |
if (cb->callout_data != NULL) |
if (cb->callout_data != NULL) |
| 983 |
{ |
{ |
| 984 |
int callout_data = *((int *)(cb->callout_data)); |
int callout_data = *((int *)(cb->callout_data)); |
| 998 |
* Local malloc functions * |
* Local malloc functions * |
| 999 |
*************************************************/ |
*************************************************/ |
| 1000 |
|
|
| 1001 |
/* Alternative malloc function, to test functionality and show the size of the |
/* Alternative malloc function, to test functionality and save the size of a |
| 1002 |
compiled re. */ |
compiled re. The show_malloc variable is set only during matching. */ |
| 1003 |
|
|
| 1004 |
static void *new_malloc(size_t size) |
static void *new_malloc(size_t size) |
| 1005 |
{ |
{ |
| 1017 |
free(block); |
free(block); |
| 1018 |
} |
} |
| 1019 |
|
|
|
|
|
| 1020 |
/* For recursion malloc/free, to test stacking calls */ |
/* For recursion malloc/free, to test stacking calls */ |
| 1021 |
|
|
| 1022 |
static void *stack_malloc(size_t size) |
static void *stack_malloc(size_t size) |
| 1148 |
* Check newline indicator * |
* Check newline indicator * |
| 1149 |
*************************************************/ |
*************************************************/ |
| 1150 |
|
|
| 1151 |
/* This is used both at compile and run-time to check for <xxx> escapes, where |
/* This is used both at compile and run-time to check for <xxx> escapes. Print |
| 1152 |
xxx is LF, CR, CRLF, ANYCRLF, or ANY. Print a message and return 0 if there is |
a message and return 0 if there is no match. |
|
no match. |
|
| 1153 |
|
|
| 1154 |
Arguments: |
Arguments: |
| 1155 |
p points after the leading '<' |
p points after the leading '<' |
| 1197 |
#endif |
#endif |
| 1198 |
printf(" -help show usage information\n"); |
printf(" -help show usage information\n"); |
| 1199 |
printf(" -i show information about compiled patterns\n" |
printf(" -i show information about compiled patterns\n" |
| 1200 |
|
" -M find MATCH_LIMIT minimum for each subject\n" |
| 1201 |
" -m output memory used information\n" |
" -m output memory used information\n" |
| 1202 |
" -o <n> set size of offsets vector to <n>\n"); |
" -o <n> set size of offsets vector to <n>\n"); |
| 1203 |
#if !defined NOPOSIX |
#if !defined NOPOSIX |
| 1205 |
#endif |
#endif |
| 1206 |
printf(" -q quiet: do not output PCRE version number at start\n"); |
printf(" -q quiet: do not output PCRE version number at start\n"); |
| 1207 |
printf(" -S <n> set stack size to <n> megabytes\n"); |
printf(" -S <n> set stack size to <n> megabytes\n"); |
| 1208 |
printf(" -s output store (memory) used information\n" |
printf(" -s force each pattern to be studied at basic level\n" |
| 1209 |
|
" -s+ force each pattern to be studied, using JIT if available\n" |
| 1210 |
" -t time compilation and execution\n"); |
" -t time compilation and execution\n"); |
| 1211 |
printf(" -t <n> time compilation and execution, repeating <n> times\n"); |
printf(" -t <n> time compilation and execution, repeating <n> times\n"); |
| 1212 |
printf(" -tm time execution (matching) only\n"); |
printf(" -tm time execution (matching) only\n"); |
| 1228 |
FILE *infile = stdin; |
FILE *infile = stdin; |
| 1229 |
int options = 0; |
int options = 0; |
| 1230 |
int study_options = 0; |
int study_options = 0; |
| 1231 |
|
int default_find_match_limit = FALSE; |
| 1232 |
int op = 1; |
int op = 1; |
| 1233 |
int timeit = 0; |
int timeit = 0; |
| 1234 |
int timeitm = 0; |
int timeitm = 0; |
| 1235 |
int showinfo = 0; |
int showinfo = 0; |
| 1236 |
int showstore = 0; |
int showstore = 0; |
| 1237 |
|
int force_study = -1; |
| 1238 |
|
int force_study_options = 0; |
| 1239 |
int quiet = 0; |
int quiet = 0; |
| 1240 |
int size_offsets = 45; |
int size_offsets = 45; |
| 1241 |
int size_offsets_max; |
int size_offsets_max; |
| 1249 |
int yield = 0; |
int yield = 0; |
| 1250 |
int stack_size; |
int stack_size; |
| 1251 |
|
|
| 1252 |
|
pcre_jit_stack *jit_stack = NULL; |
| 1253 |
|
|
| 1254 |
|
|
| 1255 |
/* These vectors store, end-to-end, a list of captured substring names. Assume |
/* These vectors store, end-to-end, a list of captured substring names. Assume |
| 1256 |
that 1024 is plenty long enough for the few names we'll be testing. */ |
that 1024 is plenty long enough for the few names we'll be testing. */ |
| 1257 |
|
|
| 1287 |
{ |
{ |
| 1288 |
unsigned char *endptr; |
unsigned char *endptr; |
| 1289 |
|
|
| 1290 |
if (strcmp(argv[op], "-s") == 0 || strcmp(argv[op], "-m") == 0) |
if (strcmp(argv[op], "-m") == 0) showstore = 1; |
| 1291 |
showstore = 1; |
else if (strcmp(argv[op], "-s") == 0) force_study = 0; |
| 1292 |
|
else if (strcmp(argv[op], "-s+") == 0) |
| 1293 |
|
{ |
| 1294 |
|
force_study = 1; |
| 1295 |
|
force_study_options = PCRE_STUDY_JIT_COMPILE; |
| 1296 |
|
} |
| 1297 |
else if (strcmp(argv[op], "-q") == 0) quiet = 1; |
else if (strcmp(argv[op], "-q") == 0) quiet = 1; |
| 1298 |
else if (strcmp(argv[op], "-b") == 0) debug = 1; |
else if (strcmp(argv[op], "-b") == 0) debug = 1; |
| 1299 |
else if (strcmp(argv[op], "-i") == 0) showinfo = 1; |
else if (strcmp(argv[op], "-i") == 0) showinfo = 1; |
| 1300 |
else if (strcmp(argv[op], "-d") == 0) showinfo = debug = 1; |
else if (strcmp(argv[op], "-d") == 0) showinfo = debug = 1; |
| 1301 |
|
else if (strcmp(argv[op], "-M") == 0) default_find_match_limit = TRUE; |
| 1302 |
#if !defined NODFA |
#if !defined NODFA |
| 1303 |
else if (strcmp(argv[op], "-dfa") == 0) all_use_dfa = 1; |
else if (strcmp(argv[op], "-dfa") == 0) all_use_dfa = 1; |
| 1304 |
#endif |
#endif |
| 1327 |
((stack_size = get_value((unsigned char *)argv[op+1], &endptr)), |
((stack_size = get_value((unsigned char *)argv[op+1], &endptr)), |
| 1328 |
*endptr == 0)) |
*endptr == 0)) |
| 1329 |
{ |
{ |
| 1330 |
#if defined(_WIN32) || defined(WIN32) |
#if defined(_WIN32) || defined(WIN32) || defined(__minix) |
| 1331 |
printf("PCRE: -S not supported on this OS\n"); |
printf("PCRE: -S not supported on this OS\n"); |
| 1332 |
exit(1); |
exit(1); |
| 1333 |
#else |
#else |
| 1351 |
else if (strcmp(argv[op], "-C") == 0) |
else if (strcmp(argv[op], "-C") == 0) |
| 1352 |
{ |
{ |
| 1353 |
int rc; |
int rc; |
| 1354 |
|
unsigned long int lrc; |
| 1355 |
printf("PCRE version %s\n", pcre_version()); |
printf("PCRE version %s\n", pcre_version()); |
| 1356 |
printf("Compiled with\n"); |
printf("Compiled with\n"); |
| 1357 |
(void)pcre_config(PCRE_CONFIG_UTF8, &rc); |
(void)pcre_config(PCRE_CONFIG_UTF8, &rc); |
| 1358 |
printf(" %sUTF-8 support\n", rc? "" : "No "); |
printf(" %sUTF-8 support\n", rc? "" : "No "); |
| 1359 |
(void)pcre_config(PCRE_CONFIG_UNICODE_PROPERTIES, &rc); |
(void)pcre_config(PCRE_CONFIG_UNICODE_PROPERTIES, &rc); |
| 1360 |
printf(" %sUnicode properties support\n", rc? "" : "No "); |
printf(" %sUnicode properties support\n", rc? "" : "No "); |
| 1361 |
|
(void)pcre_config(PCRE_CONFIG_JIT, &rc); |
| 1362 |
|
if (rc) |
| 1363 |
|
printf(" Just-in-time compiler support\n"); |
| 1364 |
|
else |
| 1365 |
|
printf(" No just-in-time compiler support\n"); |
| 1366 |
(void)pcre_config(PCRE_CONFIG_NEWLINE, &rc); |
(void)pcre_config(PCRE_CONFIG_NEWLINE, &rc); |
| 1367 |
printf(" Newline sequence is %s\n", (rc == '\r')? "CR" : |
/* Note that these values are always the ASCII values, even |
| 1368 |
(rc == '\n')? "LF" : (rc == ('\r'<<8 | '\n'))? "CRLF" : |
in EBCDIC environments. CR is 13 and NL is 10. */ |
| 1369 |
|
printf(" Newline sequence is %s\n", (rc == 13)? "CR" : |
| 1370 |
|
(rc == 10)? "LF" : (rc == (13<<8 | 10))? "CRLF" : |
| 1371 |
(rc == -2)? "ANYCRLF" : |
(rc == -2)? "ANYCRLF" : |
| 1372 |
(rc == -1)? "ANY" : "???"); |
(rc == -1)? "ANY" : "???"); |
| 1373 |
(void)pcre_config(PCRE_CONFIG_BSR, &rc); |
(void)pcre_config(PCRE_CONFIG_BSR, &rc); |
| 1377 |
printf(" Internal link size = %d\n", rc); |
printf(" Internal link size = %d\n", rc); |
| 1378 |
(void)pcre_config(PCRE_CONFIG_POSIX_MALLOC_THRESHOLD, &rc); |
(void)pcre_config(PCRE_CONFIG_POSIX_MALLOC_THRESHOLD, &rc); |
| 1379 |
printf(" POSIX malloc threshold = %d\n", rc); |
printf(" POSIX malloc threshold = %d\n", rc); |
| 1380 |
(void)pcre_config(PCRE_CONFIG_MATCH_LIMIT, &rc); |
(void)pcre_config(PCRE_CONFIG_MATCH_LIMIT, &lrc); |
| 1381 |
printf(" Default match limit = %d\n", rc); |
printf(" Default match limit = %ld\n", lrc); |
| 1382 |
(void)pcre_config(PCRE_CONFIG_MATCH_LIMIT_RECURSION, &rc); |
(void)pcre_config(PCRE_CONFIG_MATCH_LIMIT_RECURSION, &lrc); |
| 1383 |
printf(" Default recursion depth limit = %d\n", rc); |
printf(" Default recursion depth limit = %ld\n", lrc); |
| 1384 |
(void)pcre_config(PCRE_CONFIG_STACKRECURSE, &rc); |
(void)pcre_config(PCRE_CONFIG_STACKRECURSE, &rc); |
| 1385 |
printf(" Match recursion uses %s\n", rc? "stack" : "heap"); |
printf(" Match recursion uses %s\n", rc? "stack" : "heap"); |
| 1386 |
goto EXIT; |
goto EXIT; |
| 1462 |
#endif |
#endif |
| 1463 |
|
|
| 1464 |
const char *error; |
const char *error; |
| 1465 |
|
unsigned char *markptr; |
| 1466 |
unsigned char *p, *pp, *ppp; |
unsigned char *p, *pp, *ppp; |
| 1467 |
unsigned char *to_file = NULL; |
unsigned char *to_file = NULL; |
| 1468 |
const unsigned char *tables = NULL; |
const unsigned char *tables = NULL; |
| 1469 |
unsigned long int true_size, true_study_size = 0; |
unsigned long int true_size, true_study_size = 0; |
| 1470 |
size_t size, regex_gotten_store; |
size_t size, regex_gotten_store; |
| 1471 |
|
int do_allcaps = 0; |
| 1472 |
|
int do_mark = 0; |
| 1473 |
int do_study = 0; |
int do_study = 0; |
| 1474 |
|
int no_force_study = 0; |
| 1475 |
int do_debug = debug; |
int do_debug = debug; |
| 1476 |
int do_G = 0; |
int do_G = 0; |
| 1477 |
int do_g = 0; |
int do_g = 0; |
| 1478 |
int do_showinfo = showinfo; |
int do_showinfo = showinfo; |
| 1479 |
int do_showrest = 0; |
int do_showrest = 0; |
| 1480 |
|
int do_showcaprest = 0; |
| 1481 |
int do_flip = 0; |
int do_flip = 0; |
| 1482 |
int erroroffset, len, delimiter, poffset; |
int erroroffset, len, delimiter, poffset; |
| 1483 |
|
|
| 1539 |
} |
} |
| 1540 |
} |
} |
| 1541 |
|
|
| 1542 |
fprintf(outfile, "Compiled regex%s loaded from %s\n", |
fprintf(outfile, "Compiled pattern%s loaded from %s\n", |
| 1543 |
do_flip? " (byte-inverted)" : "", p); |
do_flip? " (byte-inverted)" : "", p); |
| 1544 |
|
|
| 1545 |
/* Need to know if UTF-8 for printing data strings */ |
/* Need to know if UTF-8 for printing data strings */ |
| 1547 |
new_info(re, NULL, PCRE_INFO_OPTIONS, &get_options); |
new_info(re, NULL, PCRE_INFO_OPTIONS, &get_options); |
| 1548 |
use_utf8 = (get_options & PCRE_UTF8) != 0; |
use_utf8 = (get_options & PCRE_UTF8) != 0; |
| 1549 |
|
|
| 1550 |
/* Now see if there is any following study data */ |
/* Now see if there is any following study data. */ |
| 1551 |
|
|
| 1552 |
if (true_study_size != 0) |
if (true_study_size != 0) |
| 1553 |
{ |
{ |
| 1563 |
{ |
{ |
| 1564 |
FAIL_READ: |
FAIL_READ: |
| 1565 |
fprintf(outfile, "Failed to read data from %s\n", p); |
fprintf(outfile, "Failed to read data from %s\n", p); |
| 1566 |
if (extra != NULL) new_free(extra); |
if (extra != NULL) pcre_free_study(extra); |
| 1567 |
if (re != NULL) new_free(re); |
if (re != NULL) new_free(re); |
| 1568 |
fclose(f); |
fclose(f); |
| 1569 |
continue; |
continue; |
| 1589 |
} |
} |
| 1590 |
|
|
| 1591 |
pp = p; |
pp = p; |
| 1592 |
poffset = p - buffer; |
poffset = (int)(p - buffer); |
| 1593 |
|
|
| 1594 |
for(;;) |
for(;;) |
| 1595 |
{ |
{ |
| 1629 |
/* Look for options after final delimiter */ |
/* Look for options after final delimiter */ |
| 1630 |
|
|
| 1631 |
options = 0; |
options = 0; |
|
study_options = 0; |
|
| 1632 |
log_store = showstore; /* default from command line */ |
log_store = showstore; /* default from command line */ |
| 1633 |
|
|
| 1634 |
while (*pp != 0) |
while (*pp != 0) |
| 1642 |
case 's': options |= PCRE_DOTALL; break; |
case 's': options |= PCRE_DOTALL; break; |
| 1643 |
case 'x': options |= PCRE_EXTENDED; break; |
case 'x': options |= PCRE_EXTENDED; break; |
| 1644 |
|
|
| 1645 |
case '+': do_showrest = 1; break; |
case '+': |
| 1646 |
|
if (do_showrest) do_showcaprest = 1; else do_showrest = 1; |
| 1647 |
|
break; |
| 1648 |
|
|
| 1649 |
|
case '=': do_allcaps = 1; break; |
| 1650 |
case 'A': options |= PCRE_ANCHORED; break; |
case 'A': options |= PCRE_ANCHORED; break; |
| 1651 |
case 'B': do_debug = 1; break; |
case 'B': do_debug = 1; break; |
| 1652 |
case 'C': options |= PCRE_AUTO_CALLOUT; break; |
case 'C': options |= PCRE_AUTO_CALLOUT; break; |
| 1656 |
case 'G': do_G = 1; break; |
case 'G': do_G = 1; break; |
| 1657 |
case 'I': do_showinfo = 1; break; |
case 'I': do_showinfo = 1; break; |
| 1658 |
case 'J': options |= PCRE_DUPNAMES; break; |
case 'J': options |= PCRE_DUPNAMES; break; |
| 1659 |
|
case 'K': do_mark = 1; break; |
| 1660 |
case 'M': log_store = 1; break; |
case 'M': log_store = 1; break; |
| 1661 |
case 'N': options |= PCRE_NO_AUTO_CAPTURE; break; |
case 'N': options |= PCRE_NO_AUTO_CAPTURE; break; |
| 1662 |
|
|
| 1664 |
case 'P': do_posix = 1; break; |
case 'P': do_posix = 1; break; |
| 1665 |
#endif |
#endif |
| 1666 |
|
|
| 1667 |
case 'S': do_study = 1; break; |
case 'S': |
| 1668 |
|
if (do_study == 0) |
| 1669 |
|
{ |
| 1670 |
|
do_study = 1; |
| 1671 |
|
if (*pp == '+') |
| 1672 |
|
{ |
| 1673 |
|
study_options |= PCRE_STUDY_JIT_COMPILE; |
| 1674 |
|
pp++; |
| 1675 |
|
} |
| 1676 |
|
} |
| 1677 |
|
else |
| 1678 |
|
{ |
| 1679 |
|
do_study = 0; |
| 1680 |
|
no_force_study = 1; |
| 1681 |
|
} |
| 1682 |
|
break; |
| 1683 |
|
|
| 1684 |
case 'U': options |= PCRE_UNGREEDY; break; |
case 'U': options |= PCRE_UNGREEDY; break; |
| 1685 |
|
case 'W': options |= PCRE_UCP; break; |
| 1686 |
case 'X': options |= PCRE_EXTRA; break; |
case 'X': options |= PCRE_EXTRA; break; |
| 1687 |
|
case 'Y': options |= PCRE_NO_START_OPTIMISE; break; |
| 1688 |
case 'Z': debug_lengths = 0; break; |
case 'Z': debug_lengths = 0; break; |
| 1689 |
case '8': options |= PCRE_UTF8; use_utf8 = 1; break; |
case '8': options |= PCRE_UTF8; use_utf8 = 1; break; |
| 1690 |
case '?': options |= PCRE_NO_UTF8_CHECK; break; |
case '?': options |= PCRE_NO_UTF8_CHECK; break; |
| 1691 |
|
|
| 1692 |
|
case 'T': |
| 1693 |
|
switch (*pp++) |
| 1694 |
|
{ |
| 1695 |
|
case '0': tables = tables0; break; |
| 1696 |
|
case '1': tables = tables1; break; |
| 1697 |
|
|
| 1698 |
|
case '\r': |
| 1699 |
|
case '\n': |
| 1700 |
|
case ' ': |
| 1701 |
|
case 0: |
| 1702 |
|
fprintf(outfile, "** Missing table number after /T\n"); |
| 1703 |
|
goto SKIP_DATA; |
| 1704 |
|
|
| 1705 |
|
default: |
| 1706 |
|
fprintf(outfile, "** Bad table number \"%c\" after /T\n", pp[-1]); |
| 1707 |
|
goto SKIP_DATA; |
| 1708 |
|
} |
| 1709 |
|
break; |
| 1710 |
|
|
| 1711 |
case 'L': |
case 'L': |
| 1712 |
ppp = pp; |
ppp = pp; |
| 1713 |
/* The '\r' test here is so that it works on Windows. */ |
/* The '\r' test here is so that it works on Windows. */ |
| 1733 |
|
|
| 1734 |
case '<': |
case '<': |
| 1735 |
{ |
{ |
| 1736 |
if (strncmp((char *)pp, "JS>", 3) == 0) |
if (strncmpic(pp, (uschar *)"JS>", 3) == 0) |
| 1737 |
{ |
{ |
| 1738 |
options |= PCRE_JAVASCRIPT_COMPAT; |
options |= PCRE_JAVASCRIPT_COMPAT; |
| 1739 |
pp += 3; |
pp += 3; |
| 1740 |
} |
} |
| 1741 |
else |
else |
| 1742 |
{ |
{ |
| 1743 |
int x = check_newline(pp, outfile); |
int x = check_newline(pp, outfile); |
| 1744 |
if (x == 0) goto SKIP_DATA; |
if (x == 0) goto SKIP_DATA; |
| 1745 |
options |= x; |
options |= x; |
| 1746 |
while (*pp++ != '>'); |
while (*pp++ != '>'); |
| 1747 |
} |
} |
| 1748 |
} |
} |
| 1749 |
break; |
break; |
| 1750 |
|
|
| 1774 |
if ((options & PCRE_DOTALL) != 0) cflags |= REG_DOTALL; |
if ((options & PCRE_DOTALL) != 0) cflags |= REG_DOTALL; |
| 1775 |
if ((options & PCRE_NO_AUTO_CAPTURE) != 0) cflags |= REG_NOSUB; |
if ((options & PCRE_NO_AUTO_CAPTURE) != 0) cflags |= REG_NOSUB; |
| 1776 |
if ((options & PCRE_UTF8) != 0) cflags |= REG_UTF8; |
if ((options & PCRE_UTF8) != 0) cflags |= REG_UTF8; |
| 1777 |
|
if ((options & PCRE_UCP) != 0) cflags |= REG_UCP; |
| 1778 |
|
if ((options & PCRE_UNGREEDY) != 0) cflags |= REG_UNGREEDY; |
| 1779 |
|
|
| 1780 |
rc = regcomp(&preg, (char *)p, cflags); |
rc = regcomp(&preg, (char *)p, cflags); |
| 1781 |
|
|
| 1796 |
#endif /* !defined NOPOSIX */ |
#endif /* !defined NOPOSIX */ |
| 1797 |
|
|
| 1798 |
{ |
{ |
| 1799 |
|
unsigned long int get_options; |
| 1800 |
|
|
| 1801 |
if (timeit > 0) |
if (timeit > 0) |
| 1802 |
{ |
{ |
| 1803 |
register int i; |
register int i; |
| 1841 |
goto CONTINUE; |
goto CONTINUE; |
| 1842 |
} |
} |
| 1843 |
|
|
| 1844 |
/* Compilation succeeded; print data if required. There are now two |
/* Compilation succeeded. It is now possible to set the UTF-8 option from |
| 1845 |
info-returning functions. The old one has a limited interface and |
within the regex; check for this so that we know how to process the data |
| 1846 |
returns only limited data. Check that it agrees with the newer one. */ |
lines. */ |
| 1847 |
|
|
| 1848 |
|
new_info(re, NULL, PCRE_INFO_OPTIONS, &get_options); |
| 1849 |
|
if ((get_options & PCRE_UTF8) != 0) use_utf8 = 1; |
| 1850 |
|
|
| 1851 |
|
/* Print information if required. There are now two info-returning |
| 1852 |
|
functions. The old one has a limited interface and returns only limited |
| 1853 |
|
data. Check that it agrees with the newer one. */ |
| 1854 |
|
|
| 1855 |
if (log_store) |
if (log_store) |
| 1856 |
fprintf(outfile, "Memory allocation (code space): %d\n", |
fprintf(outfile, "Memory allocation (code space): %d\n", |
| 1864 |
true_size = ((real_pcre *)re)->size; |
true_size = ((real_pcre *)re)->size; |
| 1865 |
regex_gotten_store = gotten_store; |
regex_gotten_store = gotten_store; |
| 1866 |
|
|
| 1867 |
/* If /S was present, study the regexp to generate additional info to |
/* If -s or /S was present, study the regex to generate additional info to |
| 1868 |
help with the matching. */ |
help with the matching, unless the pattern has the SS option, which |
| 1869 |
|
suppresses the effect of /S (used for a few test patterns where studying is |
| 1870 |
|
never sensible). */ |
| 1871 |
|
|
| 1872 |
if (do_study) |
if (do_study || (force_study >= 0 && !no_force_study)) |
| 1873 |
{ |
{ |
| 1874 |
if (timeit > 0) |
if (timeit > 0) |
| 1875 |
{ |
{ |
| 1877 |
clock_t time_taken; |
clock_t time_taken; |
| 1878 |
clock_t start_time = clock(); |
clock_t start_time = clock(); |
| 1879 |
for (i = 0; i < timeit; i++) |
for (i = 0; i < timeit; i++) |
| 1880 |
extra = pcre_study(re, study_options, &error); |
extra = pcre_study(re, study_options | force_study_options, &error); |
| 1881 |
time_taken = clock() - start_time; |
time_taken = clock() - start_time; |
| 1882 |
if (extra != NULL) free(extra); |
if (extra != NULL) pcre_free_study(extra); |
| 1883 |
fprintf(outfile, " Study time %.4f milliseconds\n", |
fprintf(outfile, " Study time %.4f milliseconds\n", |
| 1884 |
(((double)time_taken * 1000.0) / (double)timeit) / |
(((double)time_taken * 1000.0) / (double)timeit) / |
| 1885 |
(double)CLOCKS_PER_SEC); |
(double)CLOCKS_PER_SEC); |
| 1886 |
} |
} |
| 1887 |
extra = pcre_study(re, study_options, &error); |
extra = pcre_study(re, study_options | force_study_options, &error); |
| 1888 |
if (error != NULL) |
if (error != NULL) |
| 1889 |
fprintf(outfile, "Failed to study: %s\n", error); |
fprintf(outfile, "Failed to study: %s\n", error); |
| 1890 |
else if (extra != NULL) |
else if (extra != NULL) |
| 1891 |
true_study_size = ((pcre_study_data *)(extra->study_data))->size; |
true_study_size = ((pcre_study_data *)(extra->study_data))->size; |
| 1892 |
} |
} |
| 1893 |
|
|
| 1894 |
|
/* If /K was present, we set up for handling MARK data. */ |
| 1895 |
|
|
| 1896 |
|
if (do_mark) |
| 1897 |
|
{ |
| 1898 |
|
if (extra == NULL) |
| 1899 |
|
{ |
| 1900 |
|
extra = (pcre_extra *)malloc(sizeof(pcre_extra)); |
| 1901 |
|
extra->flags = 0; |
| 1902 |
|
} |
| 1903 |
|
extra->mark = &markptr; |
| 1904 |
|
extra->flags |= PCRE_EXTRA_MARK; |
| 1905 |
|
} |
| 1906 |
|
|
| 1907 |
/* If the 'F' option was present, we flip the bytes of all the integer |
/* If the 'F' option was present, we flip the bytes of all the integer |
| 1908 |
fields in the regex data block and the study block. This is to make it |
fields in the regex data block and the study block. This is to make it |
| 1909 |
possible to test PCRE's handling of byte-flipped patterns, e.g. those |
possible to test PCRE's handling of byte-flipped patterns, e.g. those |
| 1936 |
{ |
{ |
| 1937 |
pcre_study_data *rsd = (pcre_study_data *)(extra->study_data); |
pcre_study_data *rsd = (pcre_study_data *)(extra->study_data); |
| 1938 |
rsd->size = byteflip(rsd->size, sizeof(rsd->size)); |
rsd->size = byteflip(rsd->size, sizeof(rsd->size)); |
| 1939 |
rsd->options = byteflip(rsd->options, sizeof(rsd->options)); |
rsd->flags = byteflip(rsd->flags, sizeof(rsd->flags)); |
| 1940 |
|
rsd->minlength = byteflip(rsd->minlength, sizeof(rsd->minlength)); |
| 1941 |
} |
} |
| 1942 |
} |
} |
| 1943 |
|
|
| 1951 |
pcre_printint(re, outfile, debug_lengths); |
pcre_printint(re, outfile, debug_lengths); |
| 1952 |
} |
} |
| 1953 |
|
|
| 1954 |
|
/* We already have the options in get_options (see above) */ |
| 1955 |
|
|
| 1956 |
if (do_showinfo) |
if (do_showinfo) |
| 1957 |
{ |
{ |
| 1958 |
unsigned long int get_options, all_options; |
unsigned long int all_options; |
| 1959 |
#if !defined NOINFOCHECK |
#if !defined NOINFOCHECK |
| 1960 |
int old_first_char, old_options, old_count; |
int old_first_char, old_options, old_count; |
| 1961 |
#endif |
#endif |
| 1964 |
int nameentrysize, namecount; |
int nameentrysize, namecount; |
| 1965 |
const uschar *nametable; |
const uschar *nametable; |
| 1966 |
|
|
|
new_info(re, NULL, PCRE_INFO_OPTIONS, &get_options); |
|
| 1967 |
new_info(re, NULL, PCRE_INFO_SIZE, &size); |
new_info(re, NULL, PCRE_INFO_SIZE, &size); |
| 1968 |
new_info(re, NULL, PCRE_INFO_CAPTURECOUNT, &count); |
new_info(re, NULL, PCRE_INFO_CAPTURECOUNT, &count); |
| 1969 |
new_info(re, NULL, PCRE_INFO_BACKREFMAX, &backrefmax); |
new_info(re, NULL, PCRE_INFO_BACKREFMAX, &backrefmax); |
| 2023 |
if (do_flip) all_options = byteflip(all_options, sizeof(all_options)); |
if (do_flip) all_options = byteflip(all_options, sizeof(all_options)); |
| 2024 |
|
|
| 2025 |
if (get_options == 0) fprintf(outfile, "No options\n"); |
if (get_options == 0) fprintf(outfile, "No options\n"); |
| 2026 |
else fprintf(outfile, "Options:%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s\n", |
else fprintf(outfile, "Options:%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s\n", |
| 2027 |
((get_options & PCRE_ANCHORED) != 0)? " anchored" : "", |
((get_options & PCRE_ANCHORED) != 0)? " anchored" : "", |
| 2028 |
((get_options & PCRE_CASELESS) != 0)? " caseless" : "", |
((get_options & PCRE_CASELESS) != 0)? " caseless" : "", |
| 2029 |
((get_options & PCRE_EXTENDED) != 0)? " extended" : "", |
((get_options & PCRE_EXTENDED) != 0)? " extended" : "", |
| 2037 |
((get_options & PCRE_UNGREEDY) != 0)? " ungreedy" : "", |
((get_options & PCRE_UNGREEDY) != 0)? " ungreedy" : "", |
| 2038 |
((get_options & PCRE_NO_AUTO_CAPTURE) != 0)? " no_auto_capture" : "", |
((get_options & PCRE_NO_AUTO_CAPTURE) != 0)? " no_auto_capture" : "", |
| 2039 |
((get_options & PCRE_UTF8) != 0)? " utf8" : "", |
((get_options & PCRE_UTF8) != 0)? " utf8" : "", |
| 2040 |
|
((get_options & PCRE_UCP) != 0)? " ucp" : "", |
| 2041 |
((get_options & PCRE_NO_UTF8_CHECK) != 0)? " no_utf8_check" : "", |
((get_options & PCRE_NO_UTF8_CHECK) != 0)? " no_utf8_check" : "", |
| 2042 |
|
((get_options & PCRE_NO_START_OPTIMIZE) != 0)? " no_start_optimize" : "", |
| 2043 |
((get_options & PCRE_DUPNAMES) != 0)? " dupnames" : ""); |
((get_options & PCRE_DUPNAMES) != 0)? " dupnames" : ""); |
| 2044 |
|
|
| 2045 |
if (jchanged) fprintf(outfile, "Duplicate name status changes\n"); |
if (jchanged) fprintf(outfile, "Duplicate name status changes\n"); |
| 2107 |
/* Don't output study size; at present it is in any case a fixed |
/* Don't output study size; at present it is in any case a fixed |
| 2108 |
value, but it varies, depending on the computer architecture, and |
value, but it varies, depending on the computer architecture, and |
| 2109 |
so messes up the test suite. (And with the /F option, it might be |
so messes up the test suite. (And with the /F option, it might be |
| 2110 |
flipped.) */ |
flipped.) If study was forced by an external -s, don't show this |
| 2111 |
|
information unless -i or -d was also present. This means that, except |
| 2112 |
|
when auto-callouts are involved, the output from runs with and without |
| 2113 |
|
-s should be identical. */ |
| 2114 |
|
|
| 2115 |
if (do_study) |
if (do_study || (force_study >= 0 && showinfo && !no_force_study)) |
| 2116 |
{ |
{ |
| 2117 |
if (extra == NULL) |
if (extra == NULL) |
| 2118 |
fprintf(outfile, "Study returned NULL\n"); |
fprintf(outfile, "Study returned NULL\n"); |
| 2119 |
else |
else |
| 2120 |
{ |
{ |
| 2121 |
uschar *start_bits = NULL; |
uschar *start_bits = NULL; |
| 2122 |
new_info(re, extra, PCRE_INFO_FIRSTTABLE, &start_bits); |
int minlength; |
| 2123 |
|
|
| 2124 |
|
new_info(re, extra, PCRE_INFO_MINLENGTH, &minlength); |
| 2125 |
|
fprintf(outfile, "Subject length lower bound = %d\n", minlength); |
| 2126 |
|
|
| 2127 |
|
new_info(re, extra, PCRE_INFO_FIRSTTABLE, &start_bits); |
| 2128 |
if (start_bits == NULL) |
if (start_bits == NULL) |
| 2129 |
fprintf(outfile, "No starting byte set\n"); |
fprintf(outfile, "No set of starting bytes\n"); |
| 2130 |
else |
else |
| 2131 |
{ |
{ |
| 2132 |
int i; |
int i; |
| 2156 |
fprintf(outfile, "\n"); |
fprintf(outfile, "\n"); |
| 2157 |
} |
} |
| 2158 |
} |
} |
| 2159 |
|
|
| 2160 |
|
/* Show this only if the JIT was set by /S, not by -s. */ |
| 2161 |
|
|
| 2162 |
|
if ((study_options & PCRE_STUDY_JIT_COMPILE) != 0) |
| 2163 |
|
{ |
| 2164 |
|
int jit; |
| 2165 |
|
new_info(re, extra, PCRE_INFO_JIT, &jit); |
| 2166 |
|
if (jit) |
| 2167 |
|
fprintf(outfile, "JIT study was successful\n"); |
| 2168 |
|
else |
| 2169 |
|
#ifdef SUPPORT_JIT |
| 2170 |
|
fprintf(outfile, "JIT study was not successful\n"); |
| 2171 |
|
#else |
| 2172 |
|
fprintf(outfile, "JIT support is not available in this version of PCRE\n"); |
| 2173 |
|
#endif |
| 2174 |
|
} |
| 2175 |
} |
} |
| 2176 |
} |
} |
| 2177 |
|
|
| 2206 |
} |
} |
| 2207 |
else |
else |
| 2208 |
{ |
{ |
| 2209 |
fprintf(outfile, "Compiled regex written to %s\n", to_file); |
fprintf(outfile, "Compiled pattern written to %s\n", to_file); |
| 2210 |
|
|
| 2211 |
|
/* If there is study data, write it. */ |
| 2212 |
|
|
| 2213 |
if (extra != NULL) |
if (extra != NULL) |
| 2214 |
{ |
{ |
| 2215 |
if (fwrite(extra->study_data, 1, true_study_size, f) < |
if (fwrite(extra->study_data, 1, true_study_size, f) < |
| 2219 |
strerror(errno)); |
strerror(errno)); |
| 2220 |
} |
} |
| 2221 |
else fprintf(outfile, "Study data written to %s\n", to_file); |
else fprintf(outfile, "Study data written to %s\n", to_file); |
|
|
|
| 2222 |
} |
} |
| 2223 |
} |
} |
| 2224 |
fclose(f); |
fclose(f); |
| 2225 |
} |
} |
| 2226 |
|
|
| 2227 |
new_free(re); |
new_free(re); |
| 2228 |
if (extra != NULL) new_free(extra); |
if (extra != NULL) pcre_free_study(extra); |
| 2229 |
if (tables != NULL) new_free((void *)tables); |
if (locale_set) |
| 2230 |
|
{ |
| 2231 |
|
new_free((void *)tables); |
| 2232 |
|
setlocale(LC_CTYPE, "C"); |
| 2233 |
|
locale_set = 0; |
| 2234 |
|
} |
| 2235 |
continue; /* With next regex */ |
continue; /* With next regex */ |
| 2236 |
} |
} |
| 2237 |
} /* End of non-POSIX compile */ |
} /* End of non-POSIX compile */ |
| 2248 |
int callout_data_set = 0; |
int callout_data_set = 0; |
| 2249 |
int count, c; |
int count, c; |
| 2250 |
int copystrings = 0; |
int copystrings = 0; |
| 2251 |
int find_match_limit = 0; |
int find_match_limit = default_find_match_limit; |
| 2252 |
int getstrings = 0; |
int getstrings = 0; |
| 2253 |
int getlist = 0; |
int getlist = 0; |
| 2254 |
int gmatched = 0; |
int gmatched = 0; |
| 2255 |
int start_offset = 0; |
int start_offset = 0; |
| 2256 |
|
int start_offset_sign = 1; |
| 2257 |
int g_notempty = 0; |
int g_notempty = 0; |
| 2258 |
int use_dfa = 0; |
int use_dfa = 0; |
| 2259 |
|
|
| 2267 |
|
|
| 2268 |
pcre_callout = callout; |
pcre_callout = callout; |
| 2269 |
first_callout = 1; |
first_callout = 1; |
| 2270 |
|
last_callout_mark = NULL; |
| 2271 |
callout_extra = 0; |
callout_extra = 0; |
| 2272 |
callout_count = 0; |
callout_count = 0; |
| 2273 |
callout_fail_count = 999999; |
callout_fail_count = 999999; |
| 2282 |
{ |
{ |
| 2283 |
if (extend_inputline(infile, buffer + len, "data> ") == NULL) |
if (extend_inputline(infile, buffer + len, "data> ") == NULL) |
| 2284 |
{ |
{ |
| 2285 |
if (len > 0) break; |
if (len > 0) /* Reached EOF without hitting a newline */ |
| 2286 |
|
{ |
| 2287 |
|
fprintf(outfile, "\n"); |
| 2288 |
|
break; |
| 2289 |
|
} |
| 2290 |
done = 1; |
done = 1; |
| 2291 |
goto CONTINUE; |
goto CONTINUE; |
| 2292 |
} |
} |
| 2346 |
{ |
{ |
| 2347 |
unsigned char *pt = p; |
unsigned char *pt = p; |
| 2348 |
c = 0; |
c = 0; |
| 2349 |
while (isxdigit(*(++pt))) |
|
| 2350 |
c = c * 16 + tolower(*pt) - ((isdigit(*pt))? '0' : 'W'); |
/* We used to have "while (isxdigit(*(++pt)))" here, but it fails |
| 2351 |
|
when isxdigit() is a macro that refers to its argument more than |
| 2352 |
|
once. This is banned by the C Standard, but apparently happens in at |
| 2353 |
|
least one MacOS environment. */ |
| 2354 |
|
|
| 2355 |
|
for (pt++; isxdigit(*pt); pt++) |
| 2356 |
|
c = c * 16 + tolower(*pt) - ((isdigit(*pt))? '0' : 'a' - 10); |
| 2357 |
if (*pt == '}') |
if (*pt == '}') |
| 2358 |
{ |
{ |
| 2359 |
unsigned char buff8[8]; |
unsigned char buff8[8]; |
| 2360 |
int ii, utn; |
int ii, utn; |
| 2361 |
utn = ord2utf8(c, buff8); |
if (use_utf8) |
| 2362 |
for (ii = 0; ii < utn - 1; ii++) *q++ = buff8[ii]; |
{ |
| 2363 |
c = buff8[ii]; /* Last byte */ |
utn = ord2utf8(c, buff8); |
| 2364 |
|
for (ii = 0; ii < utn - 1; ii++) *q++ = buff8[ii]; |
| 2365 |
|
c = buff8[ii]; /* Last byte */ |
| 2366 |
|
} |
| 2367 |
|
else |
| 2368 |
|
{ |
| 2369 |
|
if (c > 255) |
| 2370 |
|
fprintf(outfile, "** Character \\x{%x} is greater than 255 and " |
| 2371 |
|
"UTF-8 mode is not enabled.\n" |
| 2372 |
|
"** Truncation will probably give the wrong result.\n", c); |
| 2373 |
|
} |
| 2374 |
p = pt + 1; |
p = pt + 1; |
| 2375 |
break; |
break; |
| 2376 |
} |
} |
| 2383 |
c = 0; |
c = 0; |
| 2384 |
while (i++ < 2 && isxdigit(*p)) |
while (i++ < 2 && isxdigit(*p)) |
| 2385 |
{ |
{ |
| 2386 |
c = c * 16 + tolower(*p) - ((isdigit(*p))? '0' : 'W'); |
c = c * 16 + tolower(*p) - ((isdigit(*p))? '0' : 'a' - 10); |
| 2387 |
p++; |
p++; |
| 2388 |
} |
} |
| 2389 |
break; |
break; |
| 2393 |
continue; |
continue; |
| 2394 |
|
|
| 2395 |
case '>': |
case '>': |
| 2396 |
|
if (*p == '-') |
| 2397 |
|
{ |
| 2398 |
|
start_offset_sign = -1; |
| 2399 |
|
p++; |
| 2400 |
|
} |
| 2401 |
while(isdigit(*p)) start_offset = start_offset * 10 + *p++ - '0'; |
while(isdigit(*p)) start_offset = start_offset * 10 + *p++ - '0'; |
| 2402 |
|
start_offset *= start_offset_sign; |
| 2403 |
continue; |
continue; |
| 2404 |
|
|
| 2405 |
case 'A': /* Option setting */ |
case 'A': /* Option setting */ |
| 2472 |
#endif |
#endif |
| 2473 |
use_dfa = 1; |
use_dfa = 1; |
| 2474 |
continue; |
continue; |
| 2475 |
|
#endif |
| 2476 |
|
|
| 2477 |
|
#if !defined NODFA |
| 2478 |
case 'F': |
case 'F': |
| 2479 |
options |= PCRE_DFA_SHORTEST; |
options |= PCRE_DFA_SHORTEST; |
| 2480 |
continue; |
continue; |
| 2499 |
} |
} |
| 2500 |
continue; |
continue; |
| 2501 |
|
|
| 2502 |
|
case 'J': |
| 2503 |
|
while(isdigit(*p)) n = n * 10 + *p++ - '0'; |
| 2504 |
|
if (extra != NULL |
| 2505 |
|
&& (extra->flags & PCRE_EXTRA_EXECUTABLE_JIT) != 0 |
| 2506 |
|
&& extra->executable_jit != NULL) |
| 2507 |
|
{ |
| 2508 |
|
if (jit_stack != NULL) pcre_jit_stack_free(jit_stack); |
| 2509 |
|
jit_stack = pcre_jit_stack_alloc(1, n * 1024); |
| 2510 |
|
pcre_assign_jit_stack(extra, jit_callback, jit_stack); |
| 2511 |
|
} |
| 2512 |
|
continue; |
| 2513 |
|
|
| 2514 |
case 'L': |
case 'L': |
| 2515 |
getlist = 1; |
getlist = 1; |
| 2516 |
continue; |
continue; |
| 2520 |
continue; |
continue; |
| 2521 |
|
|
| 2522 |
case 'N': |
case 'N': |
| 2523 |
options |= PCRE_NOTEMPTY; |
if ((options & PCRE_NOTEMPTY) != 0) |
| 2524 |
|
options = (options & ~PCRE_NOTEMPTY) | PCRE_NOTEMPTY_ATSTART; |
| 2525 |
|
else |
| 2526 |
|
options |= PCRE_NOTEMPTY; |
| 2527 |
continue; |
continue; |
| 2528 |
|
|
| 2529 |
case 'O': |
case 'O': |
| 2546 |
continue; |
continue; |
| 2547 |
|
|
| 2548 |
case 'P': |
case 'P': |
| 2549 |
options |= PCRE_PARTIAL; |
options |= ((options & PCRE_PARTIAL_SOFT) == 0)? |
| 2550 |
|
PCRE_PARTIAL_SOFT : PCRE_PARTIAL_HARD; |
| 2551 |
continue; |
continue; |
| 2552 |
|
|
| 2553 |
case 'Q': |
case 'Q': |
| 2582 |
show_malloc = 1; |
show_malloc = 1; |
| 2583 |
continue; |
continue; |
| 2584 |
|
|
| 2585 |
|
case 'Y': |
| 2586 |
|
options |= PCRE_NO_START_OPTIMIZE; |
| 2587 |
|
continue; |
| 2588 |
|
|
| 2589 |
case 'Z': |
case 'Z': |
| 2590 |
options |= PCRE_NOTEOL; |
options |= PCRE_NOTEOL; |
| 2591 |
continue; |
continue; |
| 2606 |
*q++ = c; |
*q++ = c; |
| 2607 |
} |
} |
| 2608 |
*q = 0; |
*q = 0; |
| 2609 |
len = q - dbuffer; |
len = (int)(q - dbuffer); |
| 2610 |
|
|
| 2611 |
|
/* Move the data to the end of the buffer so that a read over the end of |
| 2612 |
|
the buffer will be seen by valgrind, even if it doesn't cause a crash. If |
| 2613 |
|
we are using the POSIX interface, we must include the terminating zero. */ |
| 2614 |
|
|
| 2615 |
|
#if !defined NOPOSIX |
| 2616 |
|
if (posix || do_posix) |
| 2617 |
|
{ |
| 2618 |
|
memmove(bptr + buffer_size - len - 1, bptr, len + 1); |
| 2619 |
|
bptr += buffer_size - len - 1; |
| 2620 |
|
} |
| 2621 |
|
else |
| 2622 |
|
#endif |
| 2623 |
|
{ |
| 2624 |
|
memmove(bptr + buffer_size - len, bptr, len); |
| 2625 |
|
bptr += buffer_size - len; |
| 2626 |
|
} |
| 2627 |
|
|
| 2628 |
if ((all_use_dfa || use_dfa) && find_match_limit) |
if ((all_use_dfa || use_dfa) && find_match_limit) |
| 2629 |
{ |
{ |
| 2644 |
pmatch = (regmatch_t *)malloc(sizeof(regmatch_t) * use_size_offsets); |
pmatch = (regmatch_t *)malloc(sizeof(regmatch_t) * use_size_offsets); |
| 2645 |
if ((options & PCRE_NOTBOL) != 0) eflags |= REG_NOTBOL; |
if ((options & PCRE_NOTBOL) != 0) eflags |= REG_NOTBOL; |
| 2646 |
if ((options & PCRE_NOTEOL) != 0) eflags |= REG_NOTEOL; |
if ((options & PCRE_NOTEOL) != 0) eflags |= REG_NOTEOL; |
| 2647 |
|
if ((options & PCRE_NOTEMPTY) != 0) eflags |= REG_NOTEMPTY; |
| 2648 |
|
|
| 2649 |
rc = regexec(&preg, (const char *)bptr, use_size_offsets, pmatch, eflags); |
rc = regexec(&preg, (const char *)bptr, use_size_offsets, pmatch, eflags); |
| 2650 |
|
|
| 2669 |
(void)pchars(dbuffer + pmatch[i].rm_so, |
(void)pchars(dbuffer + pmatch[i].rm_so, |
| 2670 |
pmatch[i].rm_eo - pmatch[i].rm_so, outfile); |
pmatch[i].rm_eo - pmatch[i].rm_so, outfile); |
| 2671 |
fprintf(outfile, "\n"); |
fprintf(outfile, "\n"); |
| 2672 |
if (i == 0 && do_showrest) |
if (do_showcaprest || (i == 0 && do_showrest)) |
| 2673 |
{ |
{ |
| 2674 |
fprintf(outfile, " 0+ "); |
fprintf(outfile, "%2d+ ", (int)i); |
| 2675 |
(void)pchars(dbuffer + pmatch[i].rm_eo, len - pmatch[i].rm_eo, |
(void)pchars(dbuffer + pmatch[i].rm_eo, len - pmatch[i].rm_eo, |
| 2676 |
outfile); |
outfile); |
| 2677 |
fprintf(outfile, "\n"); |
fprintf(outfile, "\n"); |
| 2689 |
|
|
| 2690 |
for (;; gmatched++) /* Loop for /g or /G */ |
for (;; gmatched++) /* Loop for /g or /G */ |
| 2691 |
{ |
{ |
| 2692 |
|
markptr = NULL; |
| 2693 |
|
|
| 2694 |
if (timeitm > 0) |
if (timeitm > 0) |
| 2695 |
{ |
{ |
| 2696 |
register int i; |
register int i; |
| 2702 |
{ |
{ |
| 2703 |
int workspace[1000]; |
int workspace[1000]; |
| 2704 |
for (i = 0; i < timeitm; i++) |
for (i = 0; i < timeitm; i++) |
| 2705 |
count = pcre_dfa_exec(re, NULL, (char *)bptr, len, start_offset, |
count = pcre_dfa_exec(re, extra, (char *)bptr, len, start_offset, |
| 2706 |
options | g_notempty, use_offsets, use_size_offsets, workspace, |
options | g_notempty, use_offsets, use_size_offsets, workspace, |
| 2707 |
sizeof(workspace)/sizeof(int)); |
sizeof(workspace)/sizeof(int)); |
| 2708 |
} |
} |
| 2721 |
|
|
| 2722 |
/* If find_match_limit is set, we want to do repeated matches with |
/* If find_match_limit is set, we want to do repeated matches with |
| 2723 |
varying limits in order to find the minimum value for the match limit and |
varying limits in order to find the minimum value for the match limit and |
| 2724 |
for the recursion limit. */ |
for the recursion limit. The match limits are relevant only to the normal |
| 2725 |
|
running of pcre_exec(), so disable the JIT optimization. This makes it |
| 2726 |
|
possible to run the same set of tests with and without JIT externally |
| 2727 |
|
requested. */ |
| 2728 |
|
|
| 2729 |
if (find_match_limit) |
if (find_match_limit) |
| 2730 |
{ |
{ |
| 2733 |
extra = (pcre_extra *)malloc(sizeof(pcre_extra)); |
extra = (pcre_extra *)malloc(sizeof(pcre_extra)); |
| 2734 |
extra->flags = 0; |
extra->flags = 0; |
| 2735 |
} |
} |
| 2736 |
|
else extra->flags &= ~PCRE_EXTRA_EXECUTABLE_JIT; |
| 2737 |
|
|
| 2738 |
(void)check_match_limit(re, extra, bptr, len, start_offset, |
(void)check_match_limit(re, extra, bptr, len, start_offset, |
| 2739 |
options|g_notempty, use_offsets, use_size_offsets, |
options|g_notempty, use_offsets, use_size_offsets, |
| 2769 |
else if (all_use_dfa || use_dfa) |
else if (all_use_dfa || use_dfa) |
| 2770 |
{ |
{ |
| 2771 |
int workspace[1000]; |
int workspace[1000]; |
| 2772 |
count = pcre_dfa_exec(re, NULL, (char *)bptr, len, start_offset, |
count = pcre_dfa_exec(re, extra, (char *)bptr, len, start_offset, |
| 2773 |
options | g_notempty, use_offsets, use_size_offsets, workspace, |
options | g_notempty, use_offsets, use_size_offsets, workspace, |
| 2774 |
sizeof(workspace)/sizeof(int)); |
sizeof(workspace)/sizeof(int)); |
| 2775 |
if (count == 0) |
if (count == 0) |
| 2817 |
} |
} |
| 2818 |
} |
} |
| 2819 |
|
|
| 2820 |
|
/* do_allcaps requests showing of all captures in the pattern, to check |
| 2821 |
|
unset ones at the end. */ |
| 2822 |
|
|
| 2823 |
|
if (do_allcaps) |
| 2824 |
|
{ |
| 2825 |
|
new_info(re, NULL, PCRE_INFO_CAPTURECOUNT, &count); |
| 2826 |
|
count++; /* Allow for full match */ |
| 2827 |
|
if (count * 2 > use_size_offsets) count = use_size_offsets/2; |
| 2828 |
|
} |
| 2829 |
|
|
| 2830 |
|
/* Output the captured substrings */ |
| 2831 |
|
|
| 2832 |
for (i = 0; i < count * 2; i += 2) |
for (i = 0; i < count * 2; i += 2) |
| 2833 |
{ |
{ |
| 2834 |
if (use_offsets[i] < 0) |
if (use_offsets[i] < 0) |
| 2835 |
|
{ |
| 2836 |
|
if (use_offsets[i] != -1) |
| 2837 |
|
fprintf(outfile, "ERROR: bad negative value %d for offset %d\n", |
| 2838 |
|
use_offsets[i], i); |
| 2839 |
|
if (use_offsets[i+1] != -1) |
| 2840 |
|
fprintf(outfile, "ERROR: bad negative value %d for offset %d\n", |
| 2841 |
|
use_offsets[i+1], i+1); |
| 2842 |
fprintf(outfile, "%2d: <unset>\n", i/2); |
fprintf(outfile, "%2d: <unset>\n", i/2); |
| 2843 |
|
} |
| 2844 |
else |
else |
| 2845 |
{ |
{ |
| 2846 |
fprintf(outfile, "%2d: ", i/2); |
fprintf(outfile, "%2d: ", i/2); |
| 2847 |
(void)pchars(bptr + use_offsets[i], |
(void)pchars(bptr + use_offsets[i], |
| 2848 |
use_offsets[i+1] - use_offsets[i], outfile); |
use_offsets[i+1] - use_offsets[i], outfile); |
| 2849 |
fprintf(outfile, "\n"); |
fprintf(outfile, "\n"); |
| 2850 |
if (i == 0) |
if (do_showcaprest || (i == 0 && do_showrest)) |
| 2851 |
{ |
{ |
| 2852 |
if (do_showrest) |
fprintf(outfile, "%2d+ ", i/2); |
| 2853 |
{ |
(void)pchars(bptr + use_offsets[i+1], len - use_offsets[i+1], |
| 2854 |
fprintf(outfile, " 0+ "); |
outfile); |
| 2855 |
(void)pchars(bptr + use_offsets[i+1], len - use_offsets[i+1], |
fprintf(outfile, "\n"); |
|
outfile); |
|
|
fprintf(outfile, "\n"); |
|
|
} |
|
| 2856 |
} |
} |
| 2857 |
} |
} |
| 2858 |
} |
} |
| 2859 |
|
|
| 2860 |
|
if (markptr != NULL) fprintf(outfile, "MK: %s\n", markptr); |
| 2861 |
|
|
| 2862 |
for (i = 0; i < 32; i++) |
for (i = 0; i < 32; i++) |
| 2863 |
{ |
{ |
| 2864 |
if ((copystrings & (1 << i)) != 0) |
if ((copystrings & (1 << i)) != 0) |
| 2932 |
fprintf(outfile, "%2dL %s\n", i, stringlist[i]); |
fprintf(outfile, "%2dL %s\n", i, stringlist[i]); |
| 2933 |
if (stringlist[i] != NULL) |
if (stringlist[i] != NULL) |
| 2934 |
fprintf(outfile, "string list not terminated by NULL\n"); |
fprintf(outfile, "string list not terminated by NULL\n"); |
|
/* free((void *)stringlist); */ |
|
| 2935 |
pcre_free_substring_list(stringlist); |
pcre_free_substring_list(stringlist); |
| 2936 |
} |
} |
| 2937 |
} |
} |
| 2941 |
|
|
| 2942 |
else if (count == PCRE_ERROR_PARTIAL) |
else if (count == PCRE_ERROR_PARTIAL) |
| 2943 |
{ |
{ |
| 2944 |
fprintf(outfile, "Partial match"); |
if (markptr == NULL) fprintf(outfile, "Partial match"); |
| 2945 |
#if !defined NODFA |
else fprintf(outfile, "Partial match, mark=%s", markptr); |
| 2946 |
if ((all_use_dfa || use_dfa) && use_size_offsets > 2) |
if (use_size_offsets > 1) |
| 2947 |
fprintf(outfile, ": %.*s", use_offsets[1] - use_offsets[0], |
{ |
| 2948 |
bptr + use_offsets[0]); |
fprintf(outfile, ": "); |
| 2949 |
#endif |
pchars(bptr + use_offsets[0], use_offsets[1] - use_offsets[0], |
| 2950 |
|
outfile); |
| 2951 |
|
} |
| 2952 |
fprintf(outfile, "\n"); |
fprintf(outfile, "\n"); |
| 2953 |
break; /* Out of the /g loop */ |
break; /* Out of the /g loop */ |
| 2954 |
} |
} |
| 2958 |
to advance the start offset, and continue. We won't be at the end of the |
to advance the start offset, and continue. We won't be at the end of the |
| 2959 |
string - that was checked before setting g_notempty. |
string - that was checked before setting g_notempty. |
| 2960 |
|
|
| 2961 |
Complication arises in the case when the newline option is "any" or |
Complication arises in the case when the newline convention is "any", |
| 2962 |
"anycrlf". If the previous match was at the end of a line terminated by |
"crlf", or "anycrlf". If the previous match was at the end of a line |
| 2963 |
CRLF, an advance of one character just passes the \r, whereas we should |
terminated by CRLF, an advance of one character just passes the \r, |
| 2964 |
prefer the longer newline sequence, as does the code in pcre_exec(). |
whereas we should prefer the longer newline sequence, as does the code in |
| 2965 |
Fudge the offset value to achieve this. |
pcre_exec(). Fudge the offset value to achieve this. We check for a |
| 2966 |
|
newline setting in the pattern; if none was set, use pcre_config() to |
| 2967 |
|
find the default. |
| 2968 |
|
|
| 2969 |
Otherwise, in the case of UTF-8 matching, the advance must be one |
Otherwise, in the case of UTF-8 matching, the advance must be one |
| 2970 |
character, not one byte. */ |
character, not one byte. */ |
| 2980 |
{ |
{ |
| 2981 |
int d; |
int d; |
| 2982 |
(void)pcre_config(PCRE_CONFIG_NEWLINE, &d); |
(void)pcre_config(PCRE_CONFIG_NEWLINE, &d); |
| 2983 |
obits = (d == '\r')? PCRE_NEWLINE_CR : |
/* Note that these values are always the ASCII ones, even in |
| 2984 |
(d == '\n')? PCRE_NEWLINE_LF : |
EBCDIC environments. CR = 13, NL = 10. */ |
| 2985 |
(d == ('\r'<<8 | '\n'))? PCRE_NEWLINE_CRLF : |
obits = (d == 13)? PCRE_NEWLINE_CR : |
| 2986 |
|
(d == 10)? PCRE_NEWLINE_LF : |
| 2987 |
|
(d == (13<<8 | 10))? PCRE_NEWLINE_CRLF : |
| 2988 |
(d == -2)? PCRE_NEWLINE_ANYCRLF : |
(d == -2)? PCRE_NEWLINE_ANYCRLF : |
| 2989 |
(d == -1)? PCRE_NEWLINE_ANY : 0; |
(d == -1)? PCRE_NEWLINE_ANY : 0; |
| 2990 |
} |
} |
| 2991 |
if (((obits & PCRE_NEWLINE_BITS) == PCRE_NEWLINE_ANY || |
if (((obits & PCRE_NEWLINE_BITS) == PCRE_NEWLINE_ANY || |
| 2992 |
|
(obits & PCRE_NEWLINE_BITS) == PCRE_NEWLINE_CRLF || |
| 2993 |
(obits & PCRE_NEWLINE_BITS) == PCRE_NEWLINE_ANYCRLF) |
(obits & PCRE_NEWLINE_BITS) == PCRE_NEWLINE_ANYCRLF) |
| 2994 |
&& |
&& |
| 2995 |
start_offset < len - 1 && |
start_offset < len - 1 && |
| 3000 |
{ |
{ |
| 3001 |
while (start_offset + onechar < len) |
while (start_offset + onechar < len) |
| 3002 |
{ |
{ |
| 3003 |
int tb = bptr[start_offset+onechar]; |
if ((bptr[start_offset+onechar] & 0xc0) != 0x80) break; |
| 3004 |
if (tb <= 127) break; |
onechar++; |
|
tb &= 0xc0; |
|
|
if (tb != 0 && tb != 0xc0) onechar++; |
|
| 3005 |
} |
} |
| 3006 |
} |
} |
| 3007 |
use_offsets[1] = start_offset + onechar; |
use_offsets[1] = start_offset + onechar; |
| 3008 |
} |
} |
| 3009 |
else |
else |
| 3010 |
{ |
{ |
| 3011 |
if (count == PCRE_ERROR_NOMATCH) |
switch(count) |
| 3012 |
{ |
{ |
| 3013 |
if (gmatched == 0) fprintf(outfile, "No match\n"); |
case PCRE_ERROR_NOMATCH: |
| 3014 |
|
if (gmatched == 0) |
| 3015 |
|
{ |
| 3016 |
|
if (markptr == NULL) fprintf(outfile, "No match\n"); |
| 3017 |
|
else fprintf(outfile, "No match, mark = %s\n", markptr); |
| 3018 |
|
} |
| 3019 |
|
break; |
| 3020 |
|
|
| 3021 |
|
case PCRE_ERROR_BADUTF8: |
| 3022 |
|
case PCRE_ERROR_SHORTUTF8: |
| 3023 |
|
fprintf(outfile, "Error %d (%s UTF-8 string)", count, |
| 3024 |
|
(count == PCRE_ERROR_BADUTF8)? "bad" : "short"); |
| 3025 |
|
if (use_size_offsets >= 2) |
| 3026 |
|
fprintf(outfile, " offset=%d reason=%d", use_offsets[0], |
| 3027 |
|
use_offsets[1]); |
| 3028 |
|
fprintf(outfile, "\n"); |
| 3029 |
|
break; |
| 3030 |
|
|
| 3031 |
|
default: |
| 3032 |
|
if (count < 0 && (-count) < sizeof(errtexts)/sizeof(const char *)) |
| 3033 |
|
fprintf(outfile, "Error %d (%s)\n", count, errtexts[-count]); |
| 3034 |
|
else |
| 3035 |
|
fprintf(outfile, "Error %d (Unexpected value)\n", count); |
| 3036 |
|
break; |
| 3037 |
} |
} |
| 3038 |
else fprintf(outfile, "Error %d\n", count); |
|
| 3039 |
break; /* Out of the /g loop */ |
break; /* Out of the /g loop */ |
| 3040 |
} |
} |
| 3041 |
} |
} |
| 3045 |
if (!do_g && !do_G) break; |
if (!do_g && !do_G) break; |
| 3046 |
|
|
| 3047 |
/* If we have matched an empty string, first check to see if we are at |
/* If we have matched an empty string, first check to see if we are at |
| 3048 |
the end of the subject. If so, the /g loop is over. Otherwise, mimic |
the end of the subject. If so, the /g loop is over. Otherwise, mimic what |
| 3049 |
what Perl's /g options does. This turns out to be rather cunning. First |
Perl's /g options does. This turns out to be rather cunning. First we set |
| 3050 |
we set PCRE_NOTEMPTY and PCRE_ANCHORED and try the match again at the |
PCRE_NOTEMPTY_ATSTART and PCRE_ANCHORED and try the match again at the |
| 3051 |
same point. If this fails (picked up above) we advance to the next |
same point. If this fails (picked up above) we advance to the next |
| 3052 |
character. */ |
character. */ |
| 3053 |
|
|
| 3056 |
if (use_offsets[0] == use_offsets[1]) |
if (use_offsets[0] == use_offsets[1]) |
| 3057 |
{ |
{ |
| 3058 |
if (use_offsets[0] == len) break; |
if (use_offsets[0] == len) break; |
| 3059 |
g_notempty = PCRE_NOTEMPTY | PCRE_ANCHORED; |
g_notempty = PCRE_NOTEMPTY_ATSTART | PCRE_ANCHORED; |
| 3060 |
} |
} |
| 3061 |
|
|
| 3062 |
/* For /g, update the start offset, leaving the rest alone */ |
/* For /g, update the start offset, leaving the rest alone */ |
| 3082 |
#endif |
#endif |
| 3083 |
|
|
| 3084 |
if (re != NULL) new_free(re); |
if (re != NULL) new_free(re); |
| 3085 |
if (extra != NULL) new_free(extra); |
if (extra != NULL) pcre_free_study(extra); |
| 3086 |
if (tables != NULL) |
if (locale_set) |
| 3087 |
{ |
{ |
| 3088 |
new_free((void *)tables); |
new_free((void *)tables); |
| 3089 |
setlocale(LC_CTYPE, "C"); |
setlocale(LC_CTYPE, "C"); |
| 3090 |
locale_set = 0; |
locale_set = 0; |
| 3091 |
} |
} |
| 3092 |
|
if (jit_stack != NULL) |
| 3093 |
|
{ |
| 3094 |
|
pcre_jit_stack_free(jit_stack); |
| 3095 |
|
jit_stack = NULL; |
| 3096 |
|
} |
| 3097 |
} |
} |
| 3098 |
|
|
| 3099 |
if (infile == stdin) fprintf(outfile, "\n"); |
if (infile == stdin) fprintf(outfile, "\n"); |