1226 lines
32 KiB
C
1226 lines
32 KiB
C
/*************************************************
|
|
* PCRE testing program *
|
|
*************************************************/
|
|
|
|
#include <ctype.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
#include <locale.h>
|
|
|
|
/* Use the internal info for displaying the results of pcre_study(). */
|
|
|
|
#include "internal.h"
|
|
|
|
/* It is possible to compile this test program without including support for
|
|
testing the POSIX interface, though this is not available via the standard
|
|
Makefile. */
|
|
|
|
#if !defined NOPOSIX
|
|
#include "pcreposix.h"
|
|
#endif
|
|
|
|
#ifndef CLOCKS_PER_SEC
|
|
#ifdef CLK_TCK
|
|
#define CLOCKS_PER_SEC CLK_TCK
|
|
#else
|
|
#define CLOCKS_PER_SEC 100
|
|
#endif
|
|
#endif
|
|
|
|
#define LOOPREPEAT 20000
|
|
|
|
|
|
static FILE *outfile;
|
|
static int log_store = 0;
|
|
static size_t gotten_store;
|
|
|
|
|
|
|
|
static int utf8_table1[] = {
|
|
0x0000007f, 0x000007ff, 0x0000ffff, 0x001fffff, 0x03ffffff, 0x7fffffff};
|
|
|
|
static int utf8_table2[] = {
|
|
0, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc};
|
|
|
|
static int utf8_table3[] = {
|
|
0xff, 0x1f, 0x0f, 0x07, 0x03, 0x01};
|
|
|
|
|
|
/*************************************************
|
|
* Convert character value to UTF-8 *
|
|
*************************************************/
|
|
|
|
/* This function takes an integer value in the range 0 - 0x7fffffff
|
|
and encodes it as a UTF-8 character in 0 to 6 bytes.
|
|
|
|
Arguments:
|
|
cvalue the character value
|
|
buffer pointer to buffer for result - at least 6 bytes long
|
|
|
|
Returns: number of characters placed in the buffer
|
|
-1 if input character is negative
|
|
0 if input character is positive but too big (only when
|
|
int is longer than 32 bits)
|
|
*/
|
|
|
|
static int
|
|
ord2utf8(int cvalue, unsigned char *buffer)
|
|
{
|
|
register int i, j;
|
|
for (i = 0; i < sizeof(utf8_table1)/sizeof(int); i++)
|
|
if (cvalue <= utf8_table1[i]) break;
|
|
if (i >= sizeof(utf8_table1)/sizeof(int)) return 0;
|
|
if (cvalue < 0) return -1;
|
|
*buffer++ = utf8_table2[i] | (cvalue & utf8_table3[i]);
|
|
cvalue >>= 6 - i;
|
|
for (j = 0; j < i; j++)
|
|
{
|
|
*buffer++ = 0x80 | (cvalue & 0x3f);
|
|
cvalue >>= 6;
|
|
}
|
|
return i + 1;
|
|
}
|
|
|
|
|
|
/*************************************************
|
|
* Convert UTF-8 string to value *
|
|
*************************************************/
|
|
|
|
/* This function takes one or more bytes that represents a UTF-8 character,
|
|
and returns the value of the character.
|
|
|
|
Argument:
|
|
buffer a pointer to the byte vector
|
|
vptr a pointer to an int to receive the value
|
|
|
|
Returns: > 0 => the number of bytes consumed
|
|
-6 to 0 => malformed UTF-8 character at offset = (-return)
|
|
*/
|
|
|
|
int
|
|
utf82ord(unsigned char *buffer, int *vptr)
|
|
{
|
|
int c = *buffer++;
|
|
int d = c;
|
|
int i, j, s;
|
|
|
|
for (i = -1; i < 6; i++) /* i is number of additional bytes */
|
|
{
|
|
if ((d & 0x80) == 0) break;
|
|
d <<= 1;
|
|
}
|
|
|
|
if (i == -1) { *vptr = c; return 1; } /* ascii character */
|
|
if (i == 0 || i == 6) return 0; /* invalid UTF-8 */
|
|
|
|
/* i now has a value in the range 1-5 */
|
|
|
|
d = c & utf8_table3[i];
|
|
s = 6 - i;
|
|
|
|
for (j = 0; j < i; j++)
|
|
{
|
|
c = *buffer++;
|
|
if ((c & 0xc0) != 0x80) return -(j+1);
|
|
d |= (c & 0x3f) << s;
|
|
s += 6;
|
|
}
|
|
|
|
/* Check that encoding was the correct unique one */
|
|
|
|
for (j = 0; j < sizeof(utf8_table1)/sizeof(int); j++)
|
|
if (d <= utf8_table1[j]) break;
|
|
if (j != i) return -(i+1);
|
|
|
|
/* Valid value */
|
|
|
|
*vptr = d;
|
|
return i+1;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Debugging function to print the internal form of the regex. This is the same
|
|
code as contained in pcre.c under the DEBUG macro. */
|
|
|
|
static const char *OP_names[] = {
|
|
"End", "\\A", "\\B", "\\b", "\\D", "\\d",
|
|
"\\S", "\\s", "\\W", "\\w", "\\Z", "\\z",
|
|
"Opt", "^", "$", "Any", "chars", "not",
|
|
"*", "*?", "+", "+?", "?", "??", "{", "{", "{",
|
|
"*", "*?", "+", "+?", "?", "??", "{", "{", "{",
|
|
"*", "*?", "+", "+?", "?", "??", "{", "{", "{",
|
|
"*", "*?", "+", "+?", "?", "??", "{", "{",
|
|
"class", "Ref", "Recurse",
|
|
"Alt", "Ket", "KetRmax", "KetRmin", "Assert", "Assert not",
|
|
"AssertB", "AssertB not", "Reverse", "Once", "Cond", "Cref",
|
|
"Brazero", "Braminzero", "Bra"
|
|
};
|
|
|
|
|
|
static void print_internals(pcre *re)
|
|
{
|
|
unsigned char *code = ((real_pcre *)re)->code;
|
|
|
|
fprintf(outfile, "------------------------------------------------------------------\n");
|
|
|
|
for(;;)
|
|
{
|
|
int c;
|
|
int charlength;
|
|
|
|
fprintf(outfile, "%3d ", (int)(code - ((real_pcre *)re)->code));
|
|
|
|
if (*code >= OP_BRA)
|
|
{
|
|
fprintf(outfile, "%3d Bra %d", (code[1] << 8) + code[2], *code - OP_BRA);
|
|
code += 2;
|
|
}
|
|
|
|
else switch(*code)
|
|
{
|
|
case OP_END:
|
|
fprintf(outfile, " %s\n", OP_names[*code]);
|
|
fprintf(outfile, "------------------------------------------------------------------\n");
|
|
return;
|
|
|
|
case OP_OPT:
|
|
fprintf(outfile, " %.2x %s", code[1], OP_names[*code]);
|
|
code++;
|
|
break;
|
|
|
|
case OP_COND:
|
|
fprintf(outfile, "%3d Cond", (code[1] << 8) + code[2]);
|
|
code += 2;
|
|
break;
|
|
|
|
case OP_CREF:
|
|
fprintf(outfile, " %.2d %s", code[1], OP_names[*code]);
|
|
code++;
|
|
break;
|
|
|
|
case OP_CHARS:
|
|
charlength = *(++code);
|
|
fprintf(outfile, "%3d ", charlength);
|
|
while (charlength-- > 0)
|
|
if (isprint(c = *(++code))) fprintf(outfile, "%c", c);
|
|
else fprintf(outfile, "\\x%02x", c);
|
|
break;
|
|
|
|
case OP_KETRMAX:
|
|
case OP_KETRMIN:
|
|
case OP_ALT:
|
|
case OP_KET:
|
|
case OP_ASSERT:
|
|
case OP_ASSERT_NOT:
|
|
case OP_ASSERTBACK:
|
|
case OP_ASSERTBACK_NOT:
|
|
case OP_ONCE:
|
|
fprintf(outfile, "%3d %s", (code[1] << 8) + code[2], OP_names[*code]);
|
|
code += 2;
|
|
break;
|
|
|
|
case OP_REVERSE:
|
|
fprintf(outfile, "%3d %s", (code[1] << 8) + code[2], OP_names[*code]);
|
|
code += 2;
|
|
break;
|
|
|
|
case OP_STAR:
|
|
case OP_MINSTAR:
|
|
case OP_PLUS:
|
|
case OP_MINPLUS:
|
|
case OP_QUERY:
|
|
case OP_MINQUERY:
|
|
case OP_TYPESTAR:
|
|
case OP_TYPEMINSTAR:
|
|
case OP_TYPEPLUS:
|
|
case OP_TYPEMINPLUS:
|
|
case OP_TYPEQUERY:
|
|
case OP_TYPEMINQUERY:
|
|
if (*code >= OP_TYPESTAR)
|
|
fprintf(outfile, " %s", OP_names[code[1]]);
|
|
else if (isprint(c = code[1])) fprintf(outfile, " %c", c);
|
|
else fprintf(outfile, " \\x%02x", c);
|
|
fprintf(outfile, "%s", OP_names[*code++]);
|
|
break;
|
|
|
|
case OP_EXACT:
|
|
case OP_UPTO:
|
|
case OP_MINUPTO:
|
|
if (isprint(c = code[3])) fprintf(outfile, " %c{", c);
|
|
else fprintf(outfile, " \\x%02x{", c);
|
|
if (*code != OP_EXACT) fprintf(outfile, ",");
|
|
fprintf(outfile, "%d}", (code[1] << 8) + code[2]);
|
|
if (*code == OP_MINUPTO) fprintf(outfile, "?");
|
|
code += 3;
|
|
break;
|
|
|
|
case OP_TYPEEXACT:
|
|
case OP_TYPEUPTO:
|
|
case OP_TYPEMINUPTO:
|
|
fprintf(outfile, " %s{", OP_names[code[3]]);
|
|
if (*code != OP_TYPEEXACT) fprintf(outfile, "0,");
|
|
fprintf(outfile, "%d}", (code[1] << 8) + code[2]);
|
|
if (*code == OP_TYPEMINUPTO) fprintf(outfile, "?");
|
|
code += 3;
|
|
break;
|
|
|
|
case OP_NOT:
|
|
if (isprint(c = *(++code))) fprintf(outfile, " [^%c]", c);
|
|
else fprintf(outfile, " [^\\x%02x]", c);
|
|
break;
|
|
|
|
case OP_NOTSTAR:
|
|
case OP_NOTMINSTAR:
|
|
case OP_NOTPLUS:
|
|
case OP_NOTMINPLUS:
|
|
case OP_NOTQUERY:
|
|
case OP_NOTMINQUERY:
|
|
if (isprint(c = code[1])) fprintf(outfile, " [^%c]", c);
|
|
else fprintf(outfile, " [^\\x%02x]", c);
|
|
fprintf(outfile, "%s", OP_names[*code++]);
|
|
break;
|
|
|
|
case OP_NOTEXACT:
|
|
case OP_NOTUPTO:
|
|
case OP_NOTMINUPTO:
|
|
if (isprint(c = code[3])) fprintf(outfile, " [^%c]{", c);
|
|
else fprintf(outfile, " [^\\x%02x]{", c);
|
|
if (*code != OP_NOTEXACT) fprintf(outfile, ",");
|
|
fprintf(outfile, "%d}", (code[1] << 8) + code[2]);
|
|
if (*code == OP_NOTMINUPTO) fprintf(outfile, "?");
|
|
code += 3;
|
|
break;
|
|
|
|
case OP_REF:
|
|
fprintf(outfile, " \\%d", *(++code));
|
|
code++;
|
|
goto CLASS_REF_REPEAT;
|
|
|
|
case OP_CLASS:
|
|
{
|
|
int i, min, max;
|
|
code++;
|
|
fprintf(outfile, " [");
|
|
|
|
for (i = 0; i < 256; i++)
|
|
{
|
|
if ((code[i/8] & (1 << (i&7))) != 0)
|
|
{
|
|
int j;
|
|
for (j = i+1; j < 256; j++)
|
|
if ((code[j/8] & (1 << (j&7))) == 0) break;
|
|
if (i == '-' || i == ']') fprintf(outfile, "\\");
|
|
if (isprint(i)) fprintf(outfile, "%c", i); else fprintf(outfile, "\\x%02x", i);
|
|
if (--j > i)
|
|
{
|
|
fprintf(outfile, "-");
|
|
if (j == '-' || j == ']') fprintf(outfile, "\\");
|
|
if (isprint(j)) fprintf(outfile, "%c", j); else fprintf(outfile, "\\x%02x", j);
|
|
}
|
|
i = j;
|
|
}
|
|
}
|
|
fprintf(outfile, "]");
|
|
code += 32;
|
|
|
|
CLASS_REF_REPEAT:
|
|
|
|
switch(*code)
|
|
{
|
|
case OP_CRSTAR:
|
|
case OP_CRMINSTAR:
|
|
case OP_CRPLUS:
|
|
case OP_CRMINPLUS:
|
|
case OP_CRQUERY:
|
|
case OP_CRMINQUERY:
|
|
fprintf(outfile, "%s", OP_names[*code]);
|
|
break;
|
|
|
|
case OP_CRRANGE:
|
|
case OP_CRMINRANGE:
|
|
min = (code[1] << 8) + code[2];
|
|
max = (code[3] << 8) + code[4];
|
|
if (max == 0) fprintf(outfile, "{%d,}", min);
|
|
else fprintf(outfile, "{%d,%d}", min, max);
|
|
if (*code == OP_CRMINRANGE) fprintf(outfile, "?");
|
|
code += 4;
|
|
break;
|
|
|
|
default:
|
|
code--;
|
|
}
|
|
}
|
|
break;
|
|
|
|
/* Anything else is just a one-node item */
|
|
|
|
default:
|
|
fprintf(outfile, " %s", OP_names[*code]);
|
|
break;
|
|
}
|
|
|
|
code++;
|
|
fprintf(outfile, "\n");
|
|
}
|
|
}
|
|
|
|
|
|
|
|
/* Character string printing function. A "normal" and a UTF-8 version. */
|
|
|
|
static void pchars(unsigned char *p, int length, int utf8)
|
|
{
|
|
int c;
|
|
while (length-- > 0)
|
|
{
|
|
if (utf8)
|
|
{
|
|
int rc = utf82ord(p, &c);
|
|
if (rc > 0)
|
|
{
|
|
length -= rc - 1;
|
|
p += rc;
|
|
if (c < 256 && isprint(c)) fprintf(outfile, "%c", c);
|
|
else fprintf(outfile, "\\x{%02x}", c);
|
|
continue;
|
|
}
|
|
}
|
|
|
|
/* Not UTF-8, or malformed UTF-8 */
|
|
|
|
if (isprint(c = *(p++))) fprintf(outfile, "%c", c);
|
|
else fprintf(outfile, "\\x%02x", c);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
/* Alternative malloc function, to test functionality and show the size of the
|
|
compiled re. */
|
|
|
|
static void *new_malloc(size_t size)
|
|
{
|
|
gotten_store = size;
|
|
if (log_store)
|
|
fprintf(outfile, "Memory allocation (code space): %d\n",
|
|
(int)((int)size - offsetof(real_pcre, code[0])));
|
|
return malloc(size);
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Get one piece of information from the pcre_fullinfo() function */
|
|
|
|
static void new_info(pcre *re, pcre_extra *study, int option, void *ptr)
|
|
{
|
|
int rc;
|
|
if ((rc = pcre_fullinfo(re, study, option, ptr)) < 0)
|
|
fprintf(outfile, "Error %d from pcre_fullinfo(%d)\n", rc, option);
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Read lines from named file or stdin and write to named file or stdout; lines
|
|
consist of a regular expression, in delimiters and optionally followed by
|
|
options, followed by a set of test data, terminated by an empty line. */
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
FILE *infile = stdin;
|
|
int options = 0;
|
|
int study_options = 0;
|
|
int op = 1;
|
|
int timeit = 0;
|
|
int showinfo = 0;
|
|
int showstore = 0;
|
|
int posix = 0;
|
|
int debug = 0;
|
|
int done = 0;
|
|
unsigned char buffer[30000];
|
|
unsigned char dbuffer[1024];
|
|
|
|
/* Static so that new_malloc can use it. */
|
|
|
|
outfile = stdout;
|
|
|
|
/* Scan options */
|
|
|
|
while (argc > 1 && argv[op][0] == '-')
|
|
{
|
|
if (strcmp(argv[op], "-s") == 0 || strcmp(argv[op], "-m") == 0)
|
|
showstore = 1;
|
|
else if (strcmp(argv[op], "-t") == 0) timeit = 1;
|
|
else if (strcmp(argv[op], "-i") == 0) showinfo = 1;
|
|
else if (strcmp(argv[op], "-d") == 0) showinfo = debug = 1;
|
|
else if (strcmp(argv[op], "-p") == 0) posix = 1;
|
|
else
|
|
{
|
|
printf("*** Unknown option %s\n", argv[op]);
|
|
printf("Usage: pcretest [-d] [-i] [-p] [-s] [-t] [<input> [<output>]]\n");
|
|
printf(" -d debug: show compiled code; implies -i\n"
|
|
" -i show information about compiled pattern\n"
|
|
" -p use POSIX interface\n"
|
|
" -s output store information\n"
|
|
" -t time compilation and execution\n");
|
|
return 1;
|
|
}
|
|
op++;
|
|
argc--;
|
|
}
|
|
|
|
/* Sort out the input and output files */
|
|
|
|
if (argc > 1)
|
|
{
|
|
infile = fopen(argv[op], "r");
|
|
if (infile == NULL)
|
|
{
|
|
printf("** Failed to open %s\n", argv[op]);
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
if (argc > 2)
|
|
{
|
|
outfile = fopen(argv[op+1], "w");
|
|
if (outfile == NULL)
|
|
{
|
|
printf("** Failed to open %s\n", argv[op+1]);
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
/* Set alternative malloc function */
|
|
|
|
pcre_malloc = new_malloc;
|
|
|
|
/* Heading line, then prompt for first regex if stdin */
|
|
|
|
fprintf(outfile, "PCRE version %s\n\n", pcre_version());
|
|
|
|
/* Main loop */
|
|
|
|
while (!done)
|
|
{
|
|
pcre *re = NULL;
|
|
pcre_extra *extra = NULL;
|
|
|
|
#if !defined NOPOSIX /* There are still compilers that require no indent */
|
|
regex_t preg;
|
|
int do_posix = 0;
|
|
#endif
|
|
|
|
const char *error;
|
|
unsigned char *p, *pp, *ppp;
|
|
unsigned const char *tables = NULL;
|
|
int do_study = 0;
|
|
int do_debug = debug;
|
|
int do_G = 0;
|
|
int do_g = 0;
|
|
int do_showinfo = showinfo;
|
|
int do_showrest = 0;
|
|
int utf8 = 0;
|
|
int erroroffset, len, delimiter;
|
|
|
|
if (infile == stdin) printf(" re> ");
|
|
if (fgets((char *)buffer, sizeof(buffer), infile) == NULL) break;
|
|
if (infile != stdin) fprintf(outfile, "%s", (char *)buffer);
|
|
|
|
p = buffer;
|
|
while (isspace(*p)) p++;
|
|
if (*p == 0) continue;
|
|
|
|
/* Get the delimiter and seek the end of the pattern; if is isn't
|
|
complete, read more. */
|
|
|
|
delimiter = *p++;
|
|
|
|
if (isalnum(delimiter) || delimiter == '\\')
|
|
{
|
|
fprintf(outfile, "** Delimiter must not be alphameric or \\\n");
|
|
goto SKIP_DATA;
|
|
}
|
|
|
|
pp = p;
|
|
|
|
for(;;)
|
|
{
|
|
while (*pp != 0)
|
|
{
|
|
if (*pp == '\\' && pp[1] != 0) pp++;
|
|
else if (*pp == delimiter) break;
|
|
pp++;
|
|
}
|
|
if (*pp != 0) break;
|
|
|
|
len = sizeof(buffer) - (pp - buffer);
|
|
if (len < 256)
|
|
{
|
|
fprintf(outfile, "** Expression too long - missing delimiter?\n");
|
|
goto SKIP_DATA;
|
|
}
|
|
|
|
if (infile == stdin) printf(" > ");
|
|
if (fgets((char *)pp, len, infile) == NULL)
|
|
{
|
|
fprintf(outfile, "** Unexpected EOF\n");
|
|
done = 1;
|
|
goto CONTINUE;
|
|
}
|
|
if (infile != stdin) fprintf(outfile, "%s", (char *)pp);
|
|
}
|
|
|
|
/* If the first character after the delimiter is backslash, make
|
|
the pattern end with backslash. This is purely to provide a way
|
|
of testing for the error message when a pattern ends with backslash. */
|
|
|
|
if (pp[1] == '\\') *pp++ = '\\';
|
|
|
|
/* Terminate the pattern at the delimiter */
|
|
|
|
*pp++ = 0;
|
|
|
|
/* Look for options after final delimiter */
|
|
|
|
options = 0;
|
|
study_options = 0;
|
|
log_store = showstore; /* default from command line */
|
|
|
|
while (*pp != 0)
|
|
{
|
|
switch (*pp++)
|
|
{
|
|
case 'g': do_g = 1; break;
|
|
case 'i': options |= PCRE_CASELESS; break;
|
|
case 'm': options |= PCRE_MULTILINE; break;
|
|
case 's': options |= PCRE_DOTALL; break;
|
|
case 'x': options |= PCRE_EXTENDED; break;
|
|
|
|
case '+': do_showrest = 1; break;
|
|
case 'A': options |= PCRE_ANCHORED; break;
|
|
case 'D': do_debug = do_showinfo = 1; break;
|
|
case 'E': options |= PCRE_DOLLAR_ENDONLY; break;
|
|
case 'G': do_G = 1; break;
|
|
case 'I': do_showinfo = 1; break;
|
|
case 'M': log_store = 1; break;
|
|
|
|
#if !defined NOPOSIX
|
|
case 'P': do_posix = 1; break;
|
|
#endif
|
|
|
|
case 'S': do_study = 1; break;
|
|
case 'U': options |= PCRE_UNGREEDY; break;
|
|
case 'X': options |= PCRE_EXTRA; break;
|
|
case '8': options |= PCRE_UTF8; utf8 = 1; break;
|
|
|
|
case 'L':
|
|
ppp = pp;
|
|
while (*ppp != '\n' && *ppp != ' ') ppp++;
|
|
*ppp = 0;
|
|
if (setlocale(LC_CTYPE, (const char *)pp) == NULL)
|
|
{
|
|
fprintf(outfile, "** Failed to set locale \"%s\"\n", pp);
|
|
goto SKIP_DATA;
|
|
}
|
|
tables = pcre_maketables();
|
|
pp = ppp;
|
|
break;
|
|
|
|
case '\n': case ' ': break;
|
|
default:
|
|
fprintf(outfile, "** Unknown option '%c'\n", pp[-1]);
|
|
goto SKIP_DATA;
|
|
}
|
|
}
|
|
|
|
/* Handle compiling via the POSIX interface, which doesn't support the
|
|
timing, showing, or debugging options, nor the ability to pass over
|
|
local character tables. */
|
|
|
|
#if !defined NOPOSIX
|
|
if (posix || do_posix)
|
|
{
|
|
int rc;
|
|
int cflags = 0;
|
|
if ((options & PCRE_CASELESS) != 0) cflags |= REG_ICASE;
|
|
if ((options & PCRE_MULTILINE) != 0) cflags |= REG_NEWLINE;
|
|
rc = regcomp(&preg, (char *)p, cflags);
|
|
|
|
/* Compilation failed; go back for another re, skipping to blank line
|
|
if non-interactive. */
|
|
|
|
if (rc != 0)
|
|
{
|
|
(void)regerror(rc, &preg, (char *)buffer, sizeof(buffer));
|
|
fprintf(outfile, "Failed: POSIX code %d: %s\n", rc, buffer);
|
|
goto SKIP_DATA;
|
|
}
|
|
}
|
|
|
|
/* Handle compiling via the native interface */
|
|
|
|
else
|
|
#endif /* !defined NOPOSIX */
|
|
|
|
{
|
|
if (timeit)
|
|
{
|
|
register int i;
|
|
clock_t time_taken;
|
|
clock_t start_time = clock();
|
|
for (i = 0; i < LOOPREPEAT; i++)
|
|
{
|
|
re = pcre_compile((char *)p, options, &error, &erroroffset, tables);
|
|
if (re != NULL) free(re);
|
|
}
|
|
time_taken = clock() - start_time;
|
|
fprintf(outfile, "Compile time %.3f milliseconds\n",
|
|
((double)time_taken * 1000.0) /
|
|
((double)LOOPREPEAT * (double)CLOCKS_PER_SEC));
|
|
}
|
|
|
|
re = pcre_compile((char *)p, options, &error, &erroroffset, tables);
|
|
|
|
/* Compilation failed; go back for another re, skipping to blank line
|
|
if non-interactive. */
|
|
|
|
if (re == NULL)
|
|
{
|
|
fprintf(outfile, "Failed: %s at offset %d\n", error, erroroffset);
|
|
SKIP_DATA:
|
|
if (infile != stdin)
|
|
{
|
|
for (;;)
|
|
{
|
|
if (fgets((char *)buffer, sizeof(buffer), infile) == NULL)
|
|
{
|
|
done = 1;
|
|
goto CONTINUE;
|
|
}
|
|
len = (int)strlen((char *)buffer);
|
|
while (len > 0 && isspace(buffer[len-1])) len--;
|
|
if (len == 0) break;
|
|
}
|
|
fprintf(outfile, "\n");
|
|
}
|
|
goto CONTINUE;
|
|
}
|
|
|
|
/* Compilation succeeded; print data if required. There are now two
|
|
info-returning functions. The old one has a limited interface and
|
|
returns only limited data. Check that it agrees with the newer one. */
|
|
|
|
if (do_showinfo)
|
|
{
|
|
int old_first_char, old_options, old_count;
|
|
int count, backrefmax, first_char, need_char;
|
|
size_t size;
|
|
|
|
if (do_debug) print_internals(re);
|
|
|
|
new_info(re, NULL, PCRE_INFO_OPTIONS, &options);
|
|
new_info(re, NULL, PCRE_INFO_SIZE, &size);
|
|
new_info(re, NULL, PCRE_INFO_CAPTURECOUNT, &count);
|
|
new_info(re, NULL, PCRE_INFO_BACKREFMAX, &backrefmax);
|
|
new_info(re, NULL, PCRE_INFO_FIRSTCHAR, &first_char);
|
|
new_info(re, NULL, PCRE_INFO_LASTLITERAL, &need_char);
|
|
|
|
old_count = pcre_info(re, &old_options, &old_first_char);
|
|
if (count < 0) fprintf(outfile,
|
|
"Error %d from pcre_info()\n", count);
|
|
else
|
|
{
|
|
if (old_count != count) fprintf(outfile,
|
|
"Count disagreement: pcre_fullinfo=%d pcre_info=%d\n", count,
|
|
old_count);
|
|
|
|
if (old_first_char != first_char) fprintf(outfile,
|
|
"First char disagreement: pcre_fullinfo=%d pcre_info=%d\n",
|
|
first_char, old_first_char);
|
|
|
|
if (old_options != options) fprintf(outfile,
|
|
"Options disagreement: pcre_fullinfo=%d pcre_info=%d\n", options,
|
|
old_options);
|
|
}
|
|
|
|
if (size != gotten_store) fprintf(outfile,
|
|
"Size disagreement: pcre_fullinfo=%d call to malloc for %d\n",
|
|
size, gotten_store);
|
|
|
|
fprintf(outfile, "Capturing subpattern count = %d\n", count);
|
|
if (backrefmax > 0)
|
|
fprintf(outfile, "Max back reference = %d\n", backrefmax);
|
|
if (options == 0) fprintf(outfile, "No options\n");
|
|
else fprintf(outfile, "Options:%s%s%s%s%s%s%s%s%s\n",
|
|
((options & PCRE_ANCHORED) != 0)? " anchored" : "",
|
|
((options & PCRE_CASELESS) != 0)? " caseless" : "",
|
|
((options & PCRE_EXTENDED) != 0)? " extended" : "",
|
|
((options & PCRE_MULTILINE) != 0)? " multiline" : "",
|
|
((options & PCRE_DOTALL) != 0)? " dotall" : "",
|
|
((options & PCRE_DOLLAR_ENDONLY) != 0)? " dollar_endonly" : "",
|
|
((options & PCRE_EXTRA) != 0)? " extra" : "",
|
|
((options & PCRE_UNGREEDY) != 0)? " ungreedy" : "",
|
|
((options & PCRE_UTF8) != 0)? " utf8" : "");
|
|
|
|
if (((((real_pcre *)re)->options) & PCRE_ICHANGED) != 0)
|
|
fprintf(outfile, "Case state changes\n");
|
|
|
|
if (first_char == -1)
|
|
{
|
|
fprintf(outfile, "First char at start or follows \\n\n");
|
|
}
|
|
else if (first_char < 0)
|
|
{
|
|
fprintf(outfile, "No first char\n");
|
|
}
|
|
else
|
|
{
|
|
if (isprint(first_char))
|
|
fprintf(outfile, "First char = \'%c\'\n", first_char);
|
|
else
|
|
fprintf(outfile, "First char = %d\n", first_char);
|
|
}
|
|
|
|
if (need_char < 0)
|
|
{
|
|
fprintf(outfile, "No need char\n");
|
|
}
|
|
else
|
|
{
|
|
if (isprint(need_char))
|
|
fprintf(outfile, "Need char = \'%c\'\n", need_char);
|
|
else
|
|
fprintf(outfile, "Need char = %d\n", need_char);
|
|
}
|
|
}
|
|
|
|
/* If /S was present, study the regexp to generate additional info to
|
|
help with the matching. */
|
|
|
|
if (do_study)
|
|
{
|
|
if (timeit)
|
|
{
|
|
register int i;
|
|
clock_t time_taken;
|
|
clock_t start_time = clock();
|
|
for (i = 0; i < LOOPREPEAT; i++)
|
|
extra = pcre_study(re, study_options, &error);
|
|
time_taken = clock() - start_time;
|
|
if (extra != NULL) free(extra);
|
|
fprintf(outfile, " Study time %.3f milliseconds\n",
|
|
((double)time_taken * 1000.0)/
|
|
((double)LOOPREPEAT * (double)CLOCKS_PER_SEC));
|
|
}
|
|
|
|
extra = pcre_study(re, study_options, &error);
|
|
if (error != NULL)
|
|
fprintf(outfile, "Failed to study: %s\n", error);
|
|
else if (extra == NULL)
|
|
fprintf(outfile, "Study returned NULL\n");
|
|
|
|
else if (do_showinfo)
|
|
{
|
|
uschar *start_bits = NULL;
|
|
new_info(re, extra, PCRE_INFO_FIRSTTABLE, &start_bits);
|
|
if (start_bits == NULL)
|
|
fprintf(outfile, "No starting character set\n");
|
|
else
|
|
{
|
|
int i;
|
|
int c = 24;
|
|
fprintf(outfile, "Starting character set: ");
|
|
for (i = 0; i < 256; i++)
|
|
{
|
|
if ((start_bits[i/8] & (1<<(i%8))) != 0)
|
|
{
|
|
if (c > 75)
|
|
{
|
|
fprintf(outfile, "\n ");
|
|
c = 2;
|
|
}
|
|
if (isprint(i) && i != ' ')
|
|
{
|
|
fprintf(outfile, "%c ", i);
|
|
c += 2;
|
|
}
|
|
else
|
|
{
|
|
fprintf(outfile, "\\x%02x ", i);
|
|
c += 5;
|
|
}
|
|
}
|
|
}
|
|
fprintf(outfile, "\n");
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Read data lines and test them */
|
|
|
|
for (;;)
|
|
{
|
|
unsigned char *q;
|
|
unsigned char *bptr = dbuffer;
|
|
int count, c;
|
|
int copystrings = 0;
|
|
int getstrings = 0;
|
|
int getlist = 0;
|
|
int gmatched = 0;
|
|
int start_offset = 0;
|
|
int g_notempty = 0;
|
|
int offsets[45];
|
|
int size_offsets = sizeof(offsets)/sizeof(int);
|
|
|
|
options = 0;
|
|
|
|
if (infile == stdin) printf("data> ");
|
|
if (fgets((char *)buffer, sizeof(buffer), infile) == NULL)
|
|
{
|
|
done = 1;
|
|
goto CONTINUE;
|
|
}
|
|
if (infile != stdin) fprintf(outfile, "%s", (char *)buffer);
|
|
|
|
len = (int)strlen((char *)buffer);
|
|
while (len > 0 && isspace(buffer[len-1])) len--;
|
|
buffer[len] = 0;
|
|
if (len == 0) break;
|
|
|
|
p = buffer;
|
|
while (isspace(*p)) p++;
|
|
|
|
q = dbuffer;
|
|
while ((c = *p++) != 0)
|
|
{
|
|
int i = 0;
|
|
int n = 0;
|
|
if (c == '\\') switch ((c = *p++))
|
|
{
|
|
case 'a': c = 7; break;
|
|
case 'b': c = '\b'; break;
|
|
case 'e': c = 27; break;
|
|
case 'f': c = '\f'; break;
|
|
case 'n': c = '\n'; break;
|
|
case 'r': c = '\r'; break;
|
|
case 't': c = '\t'; break;
|
|
case 'v': c = '\v'; break;
|
|
|
|
case '0': case '1': case '2': case '3':
|
|
case '4': case '5': case '6': case '7':
|
|
c -= '0';
|
|
while (i++ < 2 && isdigit(*p) && *p != '8' && *p != '9')
|
|
c = c * 8 + *p++ - '0';
|
|
break;
|
|
|
|
case 'x':
|
|
|
|
/* Handle \x{..} specially - new Perl thing for utf8 */
|
|
|
|
if (*p == '{')
|
|
{
|
|
unsigned char *pt = p;
|
|
c = 0;
|
|
while (isxdigit(*(++pt)))
|
|
c = c * 16 + tolower(*pt) - ((isdigit(*pt))? '0' : 'W');
|
|
if (*pt == '}')
|
|
{
|
|
unsigned char buffer[8];
|
|
int ii, utn;
|
|
utn = ord2utf8(c, buffer);
|
|
for (ii = 0; ii < utn - 1; ii++) *q++ = buffer[ii];
|
|
c = buffer[ii]; /* Last byte */
|
|
p = pt + 1;
|
|
break;
|
|
}
|
|
/* Not correct form; fall through */
|
|
}
|
|
|
|
/* Ordinary \x */
|
|
|
|
c = 0;
|
|
while (i++ < 2 && isxdigit(*p))
|
|
{
|
|
c = c * 16 + tolower(*p) - ((isdigit(*p))? '0' : 'W');
|
|
p++;
|
|
}
|
|
break;
|
|
|
|
case 0: /* Allows for an empty line */
|
|
p--;
|
|
continue;
|
|
|
|
case 'A': /* Option setting */
|
|
options |= PCRE_ANCHORED;
|
|
continue;
|
|
|
|
case 'B':
|
|
options |= PCRE_NOTBOL;
|
|
continue;
|
|
|
|
case 'C':
|
|
while(isdigit(*p)) n = n * 10 + *p++ - '0';
|
|
copystrings |= 1 << n;
|
|
continue;
|
|
|
|
case 'G':
|
|
while(isdigit(*p)) n = n * 10 + *p++ - '0';
|
|
getstrings |= 1 << n;
|
|
continue;
|
|
|
|
case 'L':
|
|
getlist = 1;
|
|
continue;
|
|
|
|
case 'N':
|
|
options |= PCRE_NOTEMPTY;
|
|
continue;
|
|
|
|
case 'O':
|
|
while(isdigit(*p)) n = n * 10 + *p++ - '0';
|
|
if (n <= (int)(sizeof(offsets)/sizeof(int))) size_offsets = n;
|
|
continue;
|
|
|
|
case 'Z':
|
|
options |= PCRE_NOTEOL;
|
|
continue;
|
|
}
|
|
*q++ = c;
|
|
}
|
|
*q = 0;
|
|
len = q - dbuffer;
|
|
|
|
/* Handle matching via the POSIX interface, which does not
|
|
support timing. */
|
|
|
|
#if !defined NOPOSIX
|
|
if (posix || do_posix)
|
|
{
|
|
int rc;
|
|
int eflags = 0;
|
|
regmatch_t pmatch[sizeof(offsets)/sizeof(int)];
|
|
if ((options & PCRE_NOTBOL) != 0) eflags |= REG_NOTBOL;
|
|
if ((options & PCRE_NOTEOL) != 0) eflags |= REG_NOTEOL;
|
|
|
|
rc = regexec(&preg, (const char *)bptr, size_offsets, pmatch, eflags);
|
|
|
|
if (rc != 0)
|
|
{
|
|
(void)regerror(rc, &preg, (char *)buffer, sizeof(buffer));
|
|
fprintf(outfile, "No match: POSIX code %d: %s\n", rc, buffer);
|
|
}
|
|
else
|
|
{
|
|
size_t i;
|
|
for (i = 0; i < size_offsets; i++)
|
|
{
|
|
if (pmatch[i].rm_so >= 0)
|
|
{
|
|
fprintf(outfile, "%2d: ", (int)i);
|
|
pchars(dbuffer + pmatch[i].rm_so,
|
|
pmatch[i].rm_eo - pmatch[i].rm_so, utf8);
|
|
fprintf(outfile, "\n");
|
|
if (i == 0 && do_showrest)
|
|
{
|
|
fprintf(outfile, " 0+ ");
|
|
pchars(dbuffer + pmatch[i].rm_eo, len - pmatch[i].rm_eo, utf8);
|
|
fprintf(outfile, "\n");
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Handle matching via the native interface - repeats for /g and /G */
|
|
|
|
else
|
|
#endif /* !defined NOPOSIX */
|
|
|
|
for (;; gmatched++) /* Loop for /g or /G */
|
|
{
|
|
if (timeit)
|
|
{
|
|
register int i;
|
|
clock_t time_taken;
|
|
clock_t start_time = clock();
|
|
for (i = 0; i < LOOPREPEAT; i++)
|
|
count = pcre_exec(re, extra, (char *)bptr, len,
|
|
start_offset, options | g_notempty, offsets, size_offsets);
|
|
time_taken = clock() - start_time;
|
|
fprintf(outfile, "Execute time %.3f milliseconds\n",
|
|
((double)time_taken * 1000.0)/
|
|
((double)LOOPREPEAT * (double)CLOCKS_PER_SEC));
|
|
}
|
|
|
|
count = pcre_exec(re, extra, (char *)bptr, len,
|
|
start_offset, options | g_notempty, offsets, size_offsets);
|
|
|
|
if (count == 0)
|
|
{
|
|
fprintf(outfile, "Matched, but too many substrings\n");
|
|
count = size_offsets/3;
|
|
}
|
|
|
|
/* Matched */
|
|
|
|
if (count >= 0)
|
|
{
|
|
int i;
|
|
for (i = 0; i < count * 2; i += 2)
|
|
{
|
|
if (offsets[i] < 0)
|
|
fprintf(outfile, "%2d: <unset>\n", i/2);
|
|
else
|
|
{
|
|
fprintf(outfile, "%2d: ", i/2);
|
|
pchars(bptr + offsets[i], offsets[i+1] - offsets[i], utf8);
|
|
fprintf(outfile, "\n");
|
|
if (i == 0)
|
|
{
|
|
if (do_showrest)
|
|
{
|
|
fprintf(outfile, " 0+ ");
|
|
pchars(bptr + offsets[i+1], len - offsets[i+1], utf8);
|
|
fprintf(outfile, "\n");
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
for (i = 0; i < 32; i++)
|
|
{
|
|
if ((copystrings & (1 << i)) != 0)
|
|
{
|
|
char copybuffer[16];
|
|
int rc = pcre_copy_substring((char *)bptr, offsets, count,
|
|
i, copybuffer, sizeof(copybuffer));
|
|
if (rc < 0)
|
|
fprintf(outfile, "copy substring %d failed %d\n", i, rc);
|
|
else
|
|
fprintf(outfile, "%2dC %s (%d)\n", i, copybuffer, rc);
|
|
}
|
|
}
|
|
|
|
for (i = 0; i < 32; i++)
|
|
{
|
|
if ((getstrings & (1 << i)) != 0)
|
|
{
|
|
const char *substring;
|
|
int rc = pcre_get_substring((char *)bptr, offsets, count,
|
|
i, &substring);
|
|
if (rc < 0)
|
|
fprintf(outfile, "get substring %d failed %d\n", i, rc);
|
|
else
|
|
{
|
|
fprintf(outfile, "%2dG %s (%d)\n", i, substring, rc);
|
|
/* free((void *)substring); */
|
|
pcre_free_substring(substring);
|
|
}
|
|
}
|
|
}
|
|
|
|
if (getlist)
|
|
{
|
|
const char **stringlist;
|
|
int rc = pcre_get_substring_list((char *)bptr, offsets, count,
|
|
&stringlist);
|
|
if (rc < 0)
|
|
fprintf(outfile, "get substring list failed %d\n", rc);
|
|
else
|
|
{
|
|
for (i = 0; i < count; i++)
|
|
fprintf(outfile, "%2dL %s\n", i, stringlist[i]);
|
|
if (stringlist[i] != NULL)
|
|
fprintf(outfile, "string list not terminated by NULL\n");
|
|
/* free((void *)stringlist); */
|
|
pcre_free_substring_list(stringlist);
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Failed to match. If this is a /g or /G loop and we previously set
|
|
g_notempty after a null match, this is not necessarily the end.
|
|
We want to advance the start offset, and continue. Fudge the offset
|
|
values to achieve this. We won't be at the end of the string - that
|
|
was checked before setting g_notempty. */
|
|
|
|
else
|
|
{
|
|
if (g_notempty != 0)
|
|
{
|
|
offsets[0] = start_offset;
|
|
offsets[1] = start_offset + 1;
|
|
}
|
|
else
|
|
{
|
|
if (gmatched == 0) /* Error if no previous matches */
|
|
{
|
|
if (count == -1) fprintf(outfile, "No match\n");
|
|
else fprintf(outfile, "Error %d\n", count);
|
|
}
|
|
break; /* Out of the /g loop */
|
|
}
|
|
}
|
|
|
|
/* If not /g or /G we are done */
|
|
|
|
if (!do_g && !do_G) break;
|
|
|
|
/* If we have matched an empty string, first check to see if we are at
|
|
the end of the subject. If so, the /g loop is over. Otherwise, mimic
|
|
what Perl's /g options does. This turns out to be rather cunning. First
|
|
we set PCRE_NOTEMPTY and PCRE_ANCHORED and try the match again at the
|
|
same point. If this fails (picked up above) we advance to the next
|
|
character. */
|
|
|
|
g_notempty = 0;
|
|
if (offsets[0] == offsets[1])
|
|
{
|
|
if (offsets[0] == len) break;
|
|
g_notempty = PCRE_NOTEMPTY | PCRE_ANCHORED;
|
|
}
|
|
|
|
/* For /g, update the start offset, leaving the rest alone */
|
|
|
|
if (do_g) start_offset = offsets[1];
|
|
|
|
/* For /G, update the pointer and length */
|
|
|
|
else
|
|
{
|
|
bptr += offsets[1];
|
|
len -= offsets[1];
|
|
}
|
|
} /* End of loop for /g and /G */
|
|
} /* End of loop for data lines */
|
|
|
|
CONTINUE:
|
|
|
|
#if !defined NOPOSIX
|
|
if (posix || do_posix) regfree(&preg);
|
|
#endif
|
|
|
|
if (re != NULL) free(re);
|
|
if (extra != NULL) free(extra);
|
|
if (tables != NULL)
|
|
{
|
|
free((void *)tables);
|
|
setlocale(LC_CTYPE, "C");
|
|
}
|
|
}
|
|
|
|
fprintf(outfile, "\n");
|
|
return 0;
|
|
}
|
|
|
|
/* End */
|