| 6 |
and semantics are as close as possible to those of the Perl 5 language. |
and semantics are as close as possible to those of the Perl 5 language. |
| 7 |
|
|
| 8 |
Written by Philip Hazel |
Written by Philip Hazel |
| 9 |
Copyright (c) 1997-2010 University of Cambridge |
Copyright (c) 1997-2011 University of Cambridge |
| 10 |
|
|
| 11 |
----------------------------------------------------------------------------- |
----------------------------------------------------------------------------- |
| 12 |
Redistribution and use in source and binary forms, with or without |
Redistribution and use in source and binary forms, with or without |
| 261 |
cbit_xdigit,-1, 0 /* xdigit */ |
cbit_xdigit,-1, 0 /* xdigit */ |
| 262 |
}; |
}; |
| 263 |
|
|
| 264 |
/* Table of substitutes for \d etc when PCRE_UCP is set. The POSIX class |
/* Table of substitutes for \d etc when PCRE_UCP is set. The POSIX class |
| 265 |
substitutes must be in the order of the names, defined above, and there are |
substitutes must be in the order of the names, defined above, and there are |
| 266 |
both positive and negative cases. NULL means no substitute. */ |
both positive and negative cases. NULL means no substitute. */ |
| 267 |
|
|
| 268 |
#ifdef SUPPORT_UCP |
#ifdef SUPPORT_UCP |
| 272 |
(uschar *)"\\P{Xsp}", /* \S */ /* NOTE: Xsp is Perl space */ |
(uschar *)"\\P{Xsp}", /* \S */ /* NOTE: Xsp is Perl space */ |
| 273 |
(uschar *)"\\p{Xsp}", /* \s */ |
(uschar *)"\\p{Xsp}", /* \s */ |
| 274 |
(uschar *)"\\P{Xwd}", /* \W */ |
(uschar *)"\\P{Xwd}", /* \W */ |
| 275 |
(uschar *)"\\p{Xwd}" /* \w */ |
(uschar *)"\\p{Xwd}" /* \w */ |
| 276 |
}; |
}; |
| 277 |
|
|
| 278 |
static const uschar *posix_substitutes[] = { |
static const uschar *posix_substitutes[] = { |
| 279 |
(uschar *)"\\p{L}", /* alpha */ |
(uschar *)"\\p{L}", /* alpha */ |
| 280 |
(uschar *)"\\p{Ll}", /* lower */ |
(uschar *)"\\p{Ll}", /* lower */ |
| 281 |
(uschar *)"\\p{Lu}", /* upper */ |
(uschar *)"\\p{Lu}", /* upper */ |
| 282 |
(uschar *)"\\p{Xan}", /* alnum */ |
(uschar *)"\\p{Xan}", /* alnum */ |
| 283 |
NULL, /* ascii */ |
NULL, /* ascii */ |
| 284 |
(uschar *)"\\h", /* blank */ |
(uschar *)"\\h", /* blank */ |
| 285 |
NULL, /* cntrl */ |
NULL, /* cntrl */ |
| 289 |
NULL, /* punct */ |
NULL, /* punct */ |
| 290 |
(uschar *)"\\p{Xps}", /* space */ /* NOTE: Xps is POSIX space */ |
(uschar *)"\\p{Xps}", /* space */ /* NOTE: Xps is POSIX space */ |
| 291 |
(uschar *)"\\p{Xwd}", /* word */ |
(uschar *)"\\p{Xwd}", /* word */ |
| 292 |
NULL, /* xdigit */ |
NULL, /* xdigit */ |
| 293 |
/* Negated cases */ |
/* Negated cases */ |
| 294 |
(uschar *)"\\P{L}", /* ^alpha */ |
(uschar *)"\\P{L}", /* ^alpha */ |
| 295 |
(uschar *)"\\P{Ll}", /* ^lower */ |
(uschar *)"\\P{Ll}", /* ^lower */ |
| 296 |
(uschar *)"\\P{Lu}", /* ^upper */ |
(uschar *)"\\P{Lu}", /* ^upper */ |
| 297 |
(uschar *)"\\P{Xan}", /* ^alnum */ |
(uschar *)"\\P{Xan}", /* ^alnum */ |
| 298 |
NULL, /* ^ascii */ |
NULL, /* ^ascii */ |
| 299 |
(uschar *)"\\H", /* ^blank */ |
(uschar *)"\\H", /* ^blank */ |
| 300 |
NULL, /* ^cntrl */ |
NULL, /* ^cntrl */ |
| 304 |
NULL, /* ^punct */ |
NULL, /* ^punct */ |
| 305 |
(uschar *)"\\P{Xps}", /* ^space */ /* NOTE: Xps is POSIX space */ |
(uschar *)"\\P{Xps}", /* ^space */ /* NOTE: Xps is POSIX space */ |
| 306 |
(uschar *)"\\P{Xwd}", /* ^word */ |
(uschar *)"\\P{Xwd}", /* ^word */ |
| 307 |
NULL /* ^xdigit */ |
NULL /* ^xdigit */ |
| 308 |
}; |
}; |
| 309 |
#define POSIX_SUBSIZE (sizeof(posix_substitutes)/sizeof(uschar *)) |
#define POSIX_SUBSIZE (sizeof(posix_substitutes)/sizeof(uschar *)) |
| 310 |
#endif |
#endif |
| 311 |
|
|
| 312 |
#define STRING(a) # a |
#define STRING(a) # a |
| 313 |
#define XSTRING(s) STRING(s) |
#define XSTRING(s) STRING(s) |
| 407 |
/* 65 */ |
/* 65 */ |
| 408 |
"different names for subpatterns of the same number are not allowed\0" |
"different names for subpatterns of the same number are not allowed\0" |
| 409 |
"(*MARK) must have an argument\0" |
"(*MARK) must have an argument\0" |
| 410 |
"this version of PCRE is not compiled with PCRE_UCP support\0" |
"this version of PCRE is not compiled with PCRE_UCP support\0" |
| 411 |
|
"\\c must be followed by an ASCII character\0" |
| 412 |
; |
; |
| 413 |
|
|
| 414 |
/* Table to identify digits and hex digits. This is used when compiling |
/* Table to identify digits and hex digits. This is used when compiling |
| 842 |
break; |
break; |
| 843 |
|
|
| 844 |
/* For \c, a following letter is upper-cased; then the 0x40 bit is flipped. |
/* For \c, a following letter is upper-cased; then the 0x40 bit is flipped. |
| 845 |
This coding is ASCII-specific, but then the whole concept of \cx is |
An error is given if the byte following \c is not an ASCII character. This |
| 846 |
|
coding is ASCII-specific, but then the whole concept of \cx is |
| 847 |
ASCII-specific. (However, an EBCDIC equivalent has now been added.) */ |
ASCII-specific. (However, an EBCDIC equivalent has now been added.) */ |
| 848 |
|
|
| 849 |
case CHAR_c: |
case CHAR_c: |
| 853 |
*errorcodeptr = ERR2; |
*errorcodeptr = ERR2; |
| 854 |
break; |
break; |
| 855 |
} |
} |
| 856 |
|
#ifndef EBCDIC /* ASCII/UTF-8 coding */ |
| 857 |
#ifndef EBCDIC /* ASCII/UTF-8 coding */ |
if (c > 127) /* Excludes all non-ASCII in either mode */ |
| 858 |
|
{ |
| 859 |
|
*errorcodeptr = ERR68; |
| 860 |
|
break; |
| 861 |
|
} |
| 862 |
if (c >= CHAR_a && c <= CHAR_z) c -= 32; |
if (c >= CHAR_a && c <= CHAR_z) c -= 32; |
| 863 |
c ^= 0x40; |
c ^= 0x40; |
| 864 |
#else /* EBCDIC coding */ |
#else /* EBCDIC coding */ |
| 865 |
if (c >= CHAR_a && c <= CHAR_z) c += 64; |
if (c >= CHAR_a && c <= CHAR_z) c += 64; |
| 866 |
c ^= 0xC0; |
c ^= 0xC0; |
| 867 |
#endif |
#endif |
| 1105 |
start at a parenthesis. It scans along a pattern's text looking for capturing |
start at a parenthesis. It scans along a pattern's text looking for capturing |
| 1106 |
subpatterns, and counting them. If it finds a named pattern that matches the |
subpatterns, and counting them. If it finds a named pattern that matches the |
| 1107 |
name it is given, it returns its number. Alternatively, if the name is NULL, it |
name it is given, it returns its number. Alternatively, if the name is NULL, it |
| 1108 |
returns when it reaches a given numbered subpattern. We know that if (?P< is |
returns when it reaches a given numbered subpattern. Recursion is used to keep |
| 1109 |
encountered, the name will be terminated by '>' because that is checked in the |
track of subpatterns that reset the capturing group numbers - the (?| feature. |
| 1110 |
first pass. Recursion is used to keep track of subpatterns that reset the |
|
| 1111 |
capturing group numbers - the (?| feature. |
This function was originally called only from the second pass, in which we know |
| 1112 |
|
that if (?< or (?' or (?P< is encountered, the name will be correctly |
| 1113 |
|
terminated because that is checked in the first pass. There is now one call to |
| 1114 |
|
this function in the first pass, to check for a recursive back reference by |
| 1115 |
|
name (so that we can make the whole group atomic). In this case, we need check |
| 1116 |
|
only up to the current position in the pattern, and that is still OK because |
| 1117 |
|
and previous occurrences will have been checked. To make this work, the test |
| 1118 |
|
for "end of pattern" is a check against cd->end_pattern in the main loop, |
| 1119 |
|
instead of looking for a binary zero. This means that the special first-pass |
| 1120 |
|
call can adjust cd->end_pattern temporarily. (Checks for binary zero while |
| 1121 |
|
processing items within the loop are OK, because afterwards the main loop will |
| 1122 |
|
terminate.) |
| 1123 |
|
|
| 1124 |
Arguments: |
Arguments: |
| 1125 |
ptrptr address of the current character pointer (updated) |
ptrptr address of the current character pointer (updated) |
| 1127 |
name name to seek, or NULL if seeking a numbered subpattern |
name name to seek, or NULL if seeking a numbered subpattern |
| 1128 |
lorn name length, or subpattern number if name is NULL |
lorn name length, or subpattern number if name is NULL |
| 1129 |
xmode TRUE if we are in /x mode |
xmode TRUE if we are in /x mode |
| 1130 |
|
utf8 TRUE if we are in UTF-8 mode |
| 1131 |
count pointer to the current capturing subpattern number (updated) |
count pointer to the current capturing subpattern number (updated) |
| 1132 |
|
|
| 1133 |
Returns: the number of the named subpattern, or -1 if not found |
Returns: the number of the named subpattern, or -1 if not found |
| 1135 |
|
|
| 1136 |
static int |
static int |
| 1137 |
find_parens_sub(uschar **ptrptr, compile_data *cd, const uschar *name, int lorn, |
find_parens_sub(uschar **ptrptr, compile_data *cd, const uschar *name, int lorn, |
| 1138 |
BOOL xmode, int *count) |
BOOL xmode, BOOL utf8, int *count) |
| 1139 |
{ |
{ |
| 1140 |
uschar *ptr = *ptrptr; |
uschar *ptr = *ptrptr; |
| 1141 |
int start_count = *count; |
int start_count = *count; |
| 1147 |
|
|
| 1148 |
if (ptr[0] == CHAR_LEFT_PARENTHESIS) |
if (ptr[0] == CHAR_LEFT_PARENTHESIS) |
| 1149 |
{ |
{ |
| 1150 |
if (ptr[1] == CHAR_QUESTION_MARK && |
/* Handle specials such as (*SKIP) or (*UTF8) etc. */ |
| 1151 |
ptr[2] == CHAR_VERTICAL_LINE) |
|
| 1152 |
|
if (ptr[1] == CHAR_ASTERISK) ptr += 2; |
| 1153 |
|
|
| 1154 |
|
/* Handle a normal, unnamed capturing parenthesis. */ |
| 1155 |
|
|
| 1156 |
|
else if (ptr[1] != CHAR_QUESTION_MARK) |
| 1157 |
|
{ |
| 1158 |
|
*count += 1; |
| 1159 |
|
if (name == NULL && *count == lorn) return *count; |
| 1160 |
|
ptr++; |
| 1161 |
|
} |
| 1162 |
|
|
| 1163 |
|
/* All cases now have (? at the start. Remember when we are in a group |
| 1164 |
|
where the parenthesis numbers are duplicated. */ |
| 1165 |
|
|
| 1166 |
|
else if (ptr[2] == CHAR_VERTICAL_LINE) |
| 1167 |
{ |
{ |
| 1168 |
ptr += 3; |
ptr += 3; |
| 1169 |
dup_parens = TRUE; |
dup_parens = TRUE; |
| 1170 |
} |
} |
| 1171 |
|
|
| 1172 |
/* Handle a normal, unnamed capturing parenthesis */ |
/* Handle comments; all characters are allowed until a ket is reached. */ |
| 1173 |
|
|
| 1174 |
else if (ptr[1] != CHAR_QUESTION_MARK && ptr[1] != CHAR_ASTERISK) |
else if (ptr[2] == CHAR_NUMBER_SIGN) |
| 1175 |
{ |
{ |
| 1176 |
*count += 1; |
for (ptr += 3; *ptr != 0; ptr++) if (*ptr == CHAR_RIGHT_PARENTHESIS) break; |
| 1177 |
if (name == NULL && *count == lorn) return *count; |
goto FAIL_EXIT; |
|
ptr++; |
|
| 1178 |
} |
} |
| 1179 |
|
|
| 1180 |
/* Handle a condition. If it is an assertion, just carry on so that it |
/* Handle a condition. If it is an assertion, just carry on so that it |
| 1181 |
is processed as normal. If not, skip to the closing parenthesis of the |
is processed as normal. If not, skip to the closing parenthesis of the |
| 1182 |
condition (there can't be any nested parens. */ |
condition (there can't be any nested parens). */ |
| 1183 |
|
|
| 1184 |
else if (ptr[2] == CHAR_LEFT_PARENTHESIS) |
else if (ptr[2] == CHAR_LEFT_PARENTHESIS) |
| 1185 |
{ |
{ |
| 1191 |
} |
} |
| 1192 |
} |
} |
| 1193 |
|
|
| 1194 |
/* We have either (? or (* and not a condition */ |
/* Start with (? but not a condition. */ |
| 1195 |
|
|
| 1196 |
else |
else |
| 1197 |
{ |
{ |
| 1220 |
} |
} |
| 1221 |
|
|
| 1222 |
/* Past any initial parenthesis handling, scan for parentheses or vertical |
/* Past any initial parenthesis handling, scan for parentheses or vertical |
| 1223 |
bars. */ |
bars. Stop if we get to cd->end_pattern. Note that this is important for the |
| 1224 |
|
first-pass call when this value is temporarily adjusted to stop at the current |
| 1225 |
|
position. So DO NOT change this to a test for binary zero. */ |
| 1226 |
|
|
| 1227 |
for (; *ptr != 0; ptr++) |
for (; ptr < cd->end_pattern; ptr++) |
| 1228 |
{ |
{ |
| 1229 |
/* Skip over backslashed characters and also entire \Q...\E */ |
/* Skip over backslashed characters and also entire \Q...\E */ |
| 1230 |
|
|
| 1298 |
|
|
| 1299 |
if (xmode && *ptr == CHAR_NUMBER_SIGN) |
if (xmode && *ptr == CHAR_NUMBER_SIGN) |
| 1300 |
{ |
{ |
| 1301 |
while (*(++ptr) != 0 && *ptr != CHAR_NL) {}; |
ptr++; |
| 1302 |
|
while (*ptr != 0) |
| 1303 |
|
{ |
| 1304 |
|
if (IS_NEWLINE(ptr)) { ptr += cd->nllen - 1; break; } |
| 1305 |
|
ptr++; |
| 1306 |
|
#ifdef SUPPORT_UTF8 |
| 1307 |
|
if (utf8) while ((*ptr & 0xc0) == 0x80) ptr++; |
| 1308 |
|
#endif |
| 1309 |
|
} |
| 1310 |
if (*ptr == 0) goto FAIL_EXIT; |
if (*ptr == 0) goto FAIL_EXIT; |
| 1311 |
continue; |
continue; |
| 1312 |
} |
} |
| 1315 |
|
|
| 1316 |
if (*ptr == CHAR_LEFT_PARENTHESIS) |
if (*ptr == CHAR_LEFT_PARENTHESIS) |
| 1317 |
{ |
{ |
| 1318 |
int rc = find_parens_sub(&ptr, cd, name, lorn, xmode, count); |
int rc = find_parens_sub(&ptr, cd, name, lorn, xmode, utf8, count); |
| 1319 |
if (rc > 0) return rc; |
if (rc > 0) return rc; |
| 1320 |
if (*ptr == 0) goto FAIL_EXIT; |
if (*ptr == 0) goto FAIL_EXIT; |
| 1321 |
} |
} |
| 1323 |
else if (*ptr == CHAR_RIGHT_PARENTHESIS) |
else if (*ptr == CHAR_RIGHT_PARENTHESIS) |
| 1324 |
{ |
{ |
| 1325 |
if (dup_parens && *count < hwm_count) *count = hwm_count; |
if (dup_parens && *count < hwm_count) *count = hwm_count; |
| 1326 |
*ptrptr = ptr; |
goto FAIL_EXIT; |
|
return -1; |
|
| 1327 |
} |
} |
| 1328 |
|
|
| 1329 |
else if (*ptr == CHAR_VERTICAL_LINE && dup_parens) |
else if (*ptr == CHAR_VERTICAL_LINE && dup_parens) |
| 1361 |
name name to seek, or NULL if seeking a numbered subpattern |
name name to seek, or NULL if seeking a numbered subpattern |
| 1362 |
lorn name length, or subpattern number if name is NULL |
lorn name length, or subpattern number if name is NULL |
| 1363 |
xmode TRUE if we are in /x mode |
xmode TRUE if we are in /x mode |
| 1364 |
|
utf8 TRUE if we are in UTF-8 mode |
| 1365 |
|
|
| 1366 |
Returns: the number of the found subpattern, or -1 if not found |
Returns: the number of the found subpattern, or -1 if not found |
| 1367 |
*/ |
*/ |
| 1368 |
|
|
| 1369 |
static int |
static int |
| 1370 |
find_parens(compile_data *cd, const uschar *name, int lorn, BOOL xmode) |
find_parens(compile_data *cd, const uschar *name, int lorn, BOOL xmode, |
| 1371 |
|
BOOL utf8) |
| 1372 |
{ |
{ |
| 1373 |
uschar *ptr = (uschar *)cd->start_pattern; |
uschar *ptr = (uschar *)cd->start_pattern; |
| 1374 |
int count = 0; |
int count = 0; |
| 1381 |
|
|
| 1382 |
for (;;) |
for (;;) |
| 1383 |
{ |
{ |
| 1384 |
rc = find_parens_sub(&ptr, cd, name, lorn, xmode, &count); |
rc = find_parens_sub(&ptr, cd, name, lorn, xmode, utf8, &count); |
| 1385 |
if (rc > 0 || *ptr++ == 0) break; |
if (rc > 0 || *ptr++ == 0) break; |
| 1386 |
} |
} |
| 1387 |
|
|
| 1754 |
case OP_MARK: |
case OP_MARK: |
| 1755 |
case OP_PRUNE_ARG: |
case OP_PRUNE_ARG: |
| 1756 |
case OP_SKIP_ARG: |
case OP_SKIP_ARG: |
|
case OP_THEN_ARG: |
|
| 1757 |
code += code[1]; |
code += code[1]; |
| 1758 |
break; |
break; |
| 1759 |
|
|
| 1760 |
|
case OP_THEN_ARG: |
| 1761 |
|
code += code[1+LINK_SIZE]; |
| 1762 |
|
break; |
| 1763 |
} |
} |
| 1764 |
|
|
| 1765 |
/* Add in the fixed length from the table */ |
/* Add in the fixed length from the table */ |
| 1860 |
case OP_MARK: |
case OP_MARK: |
| 1861 |
case OP_PRUNE_ARG: |
case OP_PRUNE_ARG: |
| 1862 |
case OP_SKIP_ARG: |
case OP_SKIP_ARG: |
|
case OP_THEN_ARG: |
|
| 1863 |
code += code[1]; |
code += code[1]; |
| 1864 |
break; |
break; |
| 1865 |
|
|
| 1866 |
|
case OP_THEN_ARG: |
| 1867 |
|
code += code[1+LINK_SIZE]; |
| 1868 |
|
break; |
| 1869 |
} |
} |
| 1870 |
|
|
| 1871 |
/* Add in the fixed length from the table */ |
/* Add in the fixed length from the table */ |
| 2141 |
case OP_MARK: |
case OP_MARK: |
| 2142 |
case OP_PRUNE_ARG: |
case OP_PRUNE_ARG: |
| 2143 |
case OP_SKIP_ARG: |
case OP_SKIP_ARG: |
|
case OP_THEN_ARG: |
|
| 2144 |
code += code[1]; |
code += code[1]; |
| 2145 |
break; |
break; |
| 2146 |
|
|
| 2147 |
|
case OP_THEN_ARG: |
| 2148 |
|
code += code[1+LINK_SIZE]; |
| 2149 |
|
break; |
| 2150 |
|
|
| 2151 |
/* None of the remaining opcodes are required to match a character. */ |
/* None of the remaining opcodes are required to match a character. */ |
| 2152 |
|
|
| 2153 |
default: |
default: |
| 2368 |
{ |
{ |
| 2369 |
*code++ = OP_CALLOUT; |
*code++ = OP_CALLOUT; |
| 2370 |
*code++ = 255; |
*code++ = 255; |
| 2371 |
PUT(code, 0, ptr - cd->start_pattern); /* Pattern offset */ |
PUT(code, 0, (int)(ptr - cd->start_pattern)); /* Pattern offset */ |
| 2372 |
PUT(code, LINK_SIZE, 0); /* Default length */ |
PUT(code, LINK_SIZE, 0); /* Default length */ |
| 2373 |
return code + 2*LINK_SIZE; |
return code + 2*LINK_SIZE; |
| 2374 |
} |
} |
| 2375 |
|
|
| 2394 |
static void |
static void |
| 2395 |
complete_callout(uschar *previous_callout, const uschar *ptr, compile_data *cd) |
complete_callout(uschar *previous_callout, const uschar *ptr, compile_data *cd) |
| 2396 |
{ |
{ |
| 2397 |
int length = ptr - cd->start_pattern - GET(previous_callout, 2); |
int length = (int)(ptr - cd->start_pattern - GET(previous_callout, 2)); |
| 2398 |
PUT(previous_callout, 2 + LINK_SIZE, length); |
PUT(previous_callout, 2 + LINK_SIZE, length); |
| 2399 |
} |
} |
| 2400 |
|
|
| 2444 |
|
|
| 2445 |
return TRUE; |
return TRUE; |
| 2446 |
} |
} |
| 2447 |
|
|
| 2448 |
|
|
| 2449 |
|
|
| 2450 |
|
/************************************************* |
| 2451 |
|
* Check a character and a property * |
| 2452 |
|
*************************************************/ |
| 2453 |
|
|
| 2454 |
|
/* This function is called by check_auto_possessive() when a property item |
| 2455 |
|
is adjacent to a fixed character. |
| 2456 |
|
|
| 2457 |
|
Arguments: |
| 2458 |
|
c the character |
| 2459 |
|
ptype the property type |
| 2460 |
|
pdata the data for the type |
| 2461 |
|
negated TRUE if it's a negated property (\P or \p{^) |
| 2462 |
|
|
| 2463 |
|
Returns: TRUE if auto-possessifying is OK |
| 2464 |
|
*/ |
| 2465 |
|
|
| 2466 |
|
static BOOL |
| 2467 |
|
check_char_prop(int c, int ptype, int pdata, BOOL negated) |
| 2468 |
|
{ |
| 2469 |
|
const ucd_record *prop = GET_UCD(c); |
| 2470 |
|
switch(ptype) |
| 2471 |
|
{ |
| 2472 |
|
case PT_LAMP: |
| 2473 |
|
return (prop->chartype == ucp_Lu || |
| 2474 |
|
prop->chartype == ucp_Ll || |
| 2475 |
|
prop->chartype == ucp_Lt) == negated; |
| 2476 |
|
|
| 2477 |
|
case PT_GC: |
| 2478 |
|
return (pdata == _pcre_ucp_gentype[prop->chartype]) == negated; |
| 2479 |
|
|
| 2480 |
|
case PT_PC: |
| 2481 |
|
return (pdata == prop->chartype) == negated; |
| 2482 |
|
|
| 2483 |
|
case PT_SC: |
| 2484 |
|
return (pdata == prop->script) == negated; |
| 2485 |
|
|
| 2486 |
|
/* These are specials */ |
| 2487 |
|
|
| 2488 |
|
case PT_ALNUM: |
| 2489 |
|
return (_pcre_ucp_gentype[prop->chartype] == ucp_L || |
| 2490 |
|
_pcre_ucp_gentype[prop->chartype] == ucp_N) == negated; |
| 2491 |
|
|
| 2492 |
|
case PT_SPACE: /* Perl space */ |
| 2493 |
|
return (_pcre_ucp_gentype[prop->chartype] == ucp_Z || |
| 2494 |
|
c == CHAR_HT || c == CHAR_NL || c == CHAR_FF || c == CHAR_CR) |
| 2495 |
|
== negated; |
| 2496 |
|
|
| 2497 |
|
case PT_PXSPACE: /* POSIX space */ |
| 2498 |
|
return (_pcre_ucp_gentype[prop->chartype] == ucp_Z || |
| 2499 |
|
c == CHAR_HT || c == CHAR_NL || c == CHAR_VT || |
| 2500 |
|
c == CHAR_FF || c == CHAR_CR) |
| 2501 |
|
== negated; |
| 2502 |
|
|
| 2503 |
|
case PT_WORD: |
| 2504 |
|
return (_pcre_ucp_gentype[prop->chartype] == ucp_L || |
| 2505 |
|
_pcre_ucp_gentype[prop->chartype] == ucp_N || |
| 2506 |
|
c == CHAR_UNDERSCORE) == negated; |
| 2507 |
|
} |
| 2508 |
|
return FALSE; |
| 2509 |
|
} |
| 2510 |
#endif /* SUPPORT_UCP */ |
#endif /* SUPPORT_UCP */ |
| 2511 |
|
|
| 2512 |
|
|
| 2520 |
sense to automatically possessify the repeated item. |
sense to automatically possessify the repeated item. |
| 2521 |
|
|
| 2522 |
Arguments: |
Arguments: |
| 2523 |
op_code the repeated op code |
previous pointer to the repeated opcode |
|
this data for this item, depends on the opcode |
|
| 2524 |
utf8 TRUE in UTF-8 mode |
utf8 TRUE in UTF-8 mode |
|
utf8_char used for utf8 character bytes, NULL if not relevant |
|
| 2525 |
ptr next character in pattern |
ptr next character in pattern |
| 2526 |
options options bits |
options options bits |
| 2527 |
cd contains pointers to tables etc. |
cd contains pointers to tables etc. |
| 2530 |
*/ |
*/ |
| 2531 |
|
|
| 2532 |
static BOOL |
static BOOL |
| 2533 |
check_auto_possessive(int op_code, int item, BOOL utf8, uschar *utf8_char, |
check_auto_possessive(const uschar *previous, BOOL utf8, const uschar *ptr, |
| 2534 |
const uschar *ptr, int options, compile_data *cd) |
int options, compile_data *cd) |
| 2535 |
{ |
{ |
| 2536 |
int next; |
int c, next; |
| 2537 |
|
int op_code = *previous++; |
| 2538 |
|
|
| 2539 |
/* Skip whitespace and comments in extended mode */ |
/* Skip whitespace and comments in extended mode */ |
| 2540 |
|
|
| 2545 |
while ((cd->ctypes[*ptr] & ctype_space) != 0) ptr++; |
while ((cd->ctypes[*ptr] & ctype_space) != 0) ptr++; |
| 2546 |
if (*ptr == CHAR_NUMBER_SIGN) |
if (*ptr == CHAR_NUMBER_SIGN) |
| 2547 |
{ |
{ |
| 2548 |
while (*(++ptr) != 0) |
ptr++; |
| 2549 |
|
while (*ptr != 0) |
| 2550 |
|
{ |
| 2551 |
if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; } |
if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; } |
| 2552 |
|
ptr++; |
| 2553 |
|
#ifdef SUPPORT_UTF8 |
| 2554 |
|
if (utf8) while ((*ptr & 0xc0) == 0x80) ptr++; |
| 2555 |
|
#endif |
| 2556 |
|
} |
| 2557 |
} |
} |
| 2558 |
else break; |
else break; |
| 2559 |
} |
} |
| 2589 |
while ((cd->ctypes[*ptr] & ctype_space) != 0) ptr++; |
while ((cd->ctypes[*ptr] & ctype_space) != 0) ptr++; |
| 2590 |
if (*ptr == CHAR_NUMBER_SIGN) |
if (*ptr == CHAR_NUMBER_SIGN) |
| 2591 |
{ |
{ |
| 2592 |
while (*(++ptr) != 0) |
ptr++; |
| 2593 |
|
while (*ptr != 0) |
| 2594 |
|
{ |
| 2595 |
if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; } |
if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; } |
| 2596 |
|
ptr++; |
| 2597 |
|
#ifdef SUPPORT_UTF8 |
| 2598 |
|
if (utf8) while ((*ptr & 0xc0) == 0x80) ptr++; |
| 2599 |
|
#endif |
| 2600 |
|
} |
| 2601 |
} |
} |
| 2602 |
else break; |
else break; |
| 2603 |
} |
} |
| 2609 |
strncmp((char *)ptr, STR_LEFT_CURLY_BRACKET STR_0 STR_COMMA, 3) == 0) |
strncmp((char *)ptr, STR_LEFT_CURLY_BRACKET STR_0 STR_COMMA, 3) == 0) |
| 2610 |
return FALSE; |
return FALSE; |
| 2611 |
|
|
| 2612 |
/* Now compare the next item with the previous opcode. If the previous is a |
/* Now compare the next item with the previous opcode. First, handle cases when |
| 2613 |
positive single character match, "item" either contains the character or, if |
the next item is a character. */ |
|
"item" is greater than 127 in utf8 mode, the character's bytes are in |
|
|
utf8_char. */ |
|
|
|
|
|
|
|
|
/* Handle cases when the next item is a character. */ |
|
| 2614 |
|
|
| 2615 |
if (next >= 0) switch(op_code) |
if (next >= 0) switch(op_code) |
| 2616 |
{ |
{ |
| 2617 |
case OP_CHAR: |
case OP_CHAR: |
| 2618 |
#ifdef SUPPORT_UTF8 |
#ifdef SUPPORT_UTF8 |
| 2619 |
if (utf8 && item > 127) { GETCHAR(item, utf8_char); } |
GETCHARTEST(c, previous); |
| 2620 |
#else |
#else |
| 2621 |
(void)(utf8_char); /* Keep compiler happy by referencing function argument */ |
c = *previous; |
| 2622 |
#endif |
#endif |
| 2623 |
return item != next; |
return c != next; |
| 2624 |
|
|
| 2625 |
/* For CHARNC (caseless character) we must check the other case. If we have |
/* For CHARNC (caseless character) we must check the other case. If we have |
| 2626 |
Unicode property support, we can use it to test the other case of |
Unicode property support, we can use it to test the other case of |
| 2628 |
|
|
| 2629 |
case OP_CHARNC: |
case OP_CHARNC: |
| 2630 |
#ifdef SUPPORT_UTF8 |
#ifdef SUPPORT_UTF8 |
| 2631 |
if (utf8 && item > 127) { GETCHAR(item, utf8_char); } |
GETCHARTEST(c, previous); |
| 2632 |
|
#else |
| 2633 |
|
c = *previous; |
| 2634 |
#endif |
#endif |
| 2635 |
if (item == next) return FALSE; |
if (c == next) return FALSE; |
| 2636 |
#ifdef SUPPORT_UTF8 |
#ifdef SUPPORT_UTF8 |
| 2637 |
if (utf8) |
if (utf8) |
| 2638 |
{ |
{ |
| 2643 |
#else |
#else |
| 2644 |
othercase = NOTACHAR; |
othercase = NOTACHAR; |
| 2645 |
#endif |
#endif |
| 2646 |
return (unsigned int)item != othercase; |
return (unsigned int)c != othercase; |
| 2647 |
} |
} |
| 2648 |
else |
else |
| 2649 |
#endif /* SUPPORT_UTF8 */ |
#endif /* SUPPORT_UTF8 */ |
| 2650 |
return (item != cd->fcc[next]); /* Non-UTF-8 mode */ |
return (c != cd->fcc[next]); /* Non-UTF-8 mode */ |
| 2651 |
|
|
| 2652 |
/* For OP_NOT, "item" must be a single-byte character. */ |
/* For OP_NOT, its data is always a single-byte character. */ |
| 2653 |
|
|
| 2654 |
case OP_NOT: |
case OP_NOT: |
| 2655 |
if (item == next) return TRUE; |
if ((c = *previous) == next) return TRUE; |
| 2656 |
if ((options & PCRE_CASELESS) == 0) return FALSE; |
if ((options & PCRE_CASELESS) == 0) return FALSE; |
| 2657 |
#ifdef SUPPORT_UTF8 |
#ifdef SUPPORT_UTF8 |
| 2658 |
if (utf8) |
if (utf8) |
| 2664 |
#else |
#else |
| 2665 |
othercase = NOTACHAR; |
othercase = NOTACHAR; |
| 2666 |
#endif |
#endif |
| 2667 |
return (unsigned int)item == othercase; |
return (unsigned int)c == othercase; |
| 2668 |
} |
} |
| 2669 |
else |
else |
| 2670 |
#endif /* SUPPORT_UTF8 */ |
#endif /* SUPPORT_UTF8 */ |
| 2671 |
return (item == cd->fcc[next]); /* Non-UTF-8 mode */ |
return (c == cd->fcc[next]); /* Non-UTF-8 mode */ |
| 2672 |
|
|
| 2673 |
/* Note that OP_DIGIT etc. are generated only when PCRE_UCP is *not* set. |
/* Note that OP_DIGIT etc. are generated only when PCRE_UCP is *not* set. |
| 2674 |
When it is set, \d etc. are converted into OP_(NOT_)PROP codes. */ |
When it is set, \d etc. are converted into OP_(NOT_)PROP codes. */ |
| 2675 |
|
|
| 2676 |
case OP_DIGIT: |
case OP_DIGIT: |
| 2677 |
return next > 127 || (cd->ctypes[next] & ctype_digit) == 0; |
return next > 127 || (cd->ctypes[next] & ctype_digit) == 0; |
| 2736 |
return op_code != OP_NOT_VSPACE; |
return op_code != OP_NOT_VSPACE; |
| 2737 |
} |
} |
| 2738 |
|
|
| 2739 |
|
#ifdef SUPPORT_UCP |
| 2740 |
|
case OP_PROP: |
| 2741 |
|
return check_char_prop(next, previous[0], previous[1], FALSE); |
| 2742 |
|
|
| 2743 |
|
case OP_NOTPROP: |
| 2744 |
|
return check_char_prop(next, previous[0], previous[1], TRUE); |
| 2745 |
|
#endif |
| 2746 |
|
|
| 2747 |
default: |
default: |
| 2748 |
return FALSE; |
return FALSE; |
| 2749 |
} |
} |
| 2750 |
|
|
| 2751 |
|
|
| 2752 |
/* Handle the case when the next item is \d, \s, etc. Note that when PCRE_UCP |
/* Handle the case when the next item is \d, \s, etc. Note that when PCRE_UCP |
| 2753 |
is set, \d turns into ESC_du rather than ESC_d, etc., so ESC_d etc. are |
is set, \d turns into ESC_du rather than ESC_d, etc., so ESC_d etc. are |
| 2754 |
generated only when PCRE_UCP is *not* set, that is, when only ASCII |
generated only when PCRE_UCP is *not* set, that is, when only ASCII |
| 2755 |
characteristics are recognized. */ |
characteristics are recognized. Similarly, the opcodes OP_DIGIT etc. are |
| 2756 |
|
replaced by OP_PROP codes when PCRE_UCP is set. */ |
| 2757 |
|
|
| 2758 |
switch(op_code) |
switch(op_code) |
| 2759 |
{ |
{ |
| 2760 |
case OP_CHAR: |
case OP_CHAR: |
| 2761 |
case OP_CHARNC: |
case OP_CHARNC: |
| 2762 |
#ifdef SUPPORT_UTF8 |
#ifdef SUPPORT_UTF8 |
| 2763 |
if (utf8 && item > 127) { GETCHAR(item, utf8_char); } |
GETCHARTEST(c, previous); |
| 2764 |
|
#else |
| 2765 |
|
c = *previous; |
| 2766 |
#endif |
#endif |
| 2767 |
switch(-next) |
switch(-next) |
| 2768 |
{ |
{ |
| 2769 |
case ESC_d: |
case ESC_d: |
| 2770 |
return item > 127 || (cd->ctypes[item] & ctype_digit) == 0; |
return c > 127 || (cd->ctypes[c] & ctype_digit) == 0; |
| 2771 |
|
|
| 2772 |
case ESC_D: |
case ESC_D: |
| 2773 |
return item <= 127 && (cd->ctypes[item] & ctype_digit) != 0; |
return c <= 127 && (cd->ctypes[c] & ctype_digit) != 0; |
| 2774 |
|
|
| 2775 |
case ESC_s: |
case ESC_s: |
| 2776 |
return item > 127 || (cd->ctypes[item] & ctype_space) == 0; |
return c > 127 || (cd->ctypes[c] & ctype_space) == 0; |
| 2777 |
|
|
| 2778 |
case ESC_S: |
case ESC_S: |
| 2779 |
return item <= 127 && (cd->ctypes[item] & ctype_space) != 0; |
return c <= 127 && (cd->ctypes[c] & ctype_space) != 0; |
| 2780 |
|
|
| 2781 |
case ESC_w: |
case ESC_w: |
| 2782 |
return item > 127 || (cd->ctypes[item] & ctype_word) == 0; |
return c > 127 || (cd->ctypes[c] & ctype_word) == 0; |
| 2783 |
|
|
| 2784 |
case ESC_W: |
case ESC_W: |
| 2785 |
return item <= 127 && (cd->ctypes[item] & ctype_word) != 0; |
return c <= 127 && (cd->ctypes[c] & ctype_word) != 0; |
| 2786 |
|
|
| 2787 |
case ESC_h: |
case ESC_h: |
| 2788 |
case ESC_H: |
case ESC_H: |
| 2789 |
switch(item) |
switch(c) |
| 2790 |
{ |
{ |
| 2791 |
case 0x09: |
case 0x09: |
| 2792 |
case 0x20: |
case 0x20: |
| 2814 |
|
|
| 2815 |
case ESC_v: |
case ESC_v: |
| 2816 |
case ESC_V: |
case ESC_V: |
| 2817 |
switch(item) |
switch(c) |
| 2818 |
{ |
{ |
| 2819 |
case 0x0a: |
case 0x0a: |
| 2820 |
case 0x0b: |
case 0x0b: |
| 2828 |
return -next == ESC_v; |
return -next == ESC_v; |
| 2829 |
} |
} |
| 2830 |
|
|
| 2831 |
|
/* When PCRE_UCP is set, these values get generated for \d etc. Find |
| 2832 |
|
their substitutions and process them. The result will always be either |
| 2833 |
|
-ESC_p or -ESC_P. Then fall through to process those values. */ |
| 2834 |
|
|
| 2835 |
|
#ifdef SUPPORT_UCP |
| 2836 |
|
case ESC_du: |
| 2837 |
|
case ESC_DU: |
| 2838 |
|
case ESC_wu: |
| 2839 |
|
case ESC_WU: |
| 2840 |
|
case ESC_su: |
| 2841 |
|
case ESC_SU: |
| 2842 |
|
{ |
| 2843 |
|
int temperrorcode = 0; |
| 2844 |
|
ptr = substitutes[-next - ESC_DU]; |
| 2845 |
|
next = check_escape(&ptr, &temperrorcode, 0, options, FALSE); |
| 2846 |
|
if (temperrorcode != 0) return FALSE; |
| 2847 |
|
ptr++; /* For compatibility */ |
| 2848 |
|
} |
| 2849 |
|
/* Fall through */ |
| 2850 |
|
|
| 2851 |
|
case ESC_p: |
| 2852 |
|
case ESC_P: |
| 2853 |
|
{ |
| 2854 |
|
int ptype, pdata, errorcodeptr; |
| 2855 |
|
BOOL negated; |
| 2856 |
|
|
| 2857 |
|
ptr--; /* Make ptr point at the p or P */ |
| 2858 |
|
ptype = get_ucp(&ptr, &negated, &pdata, &errorcodeptr); |
| 2859 |
|
if (ptype < 0) return FALSE; |
| 2860 |
|
ptr++; /* Point past the final curly ket */ |
| 2861 |
|
|
| 2862 |
|
/* If the property item is optional, we have to give up. (When generated |
| 2863 |
|
from \d etc by PCRE_UCP, this test will have been applied much earlier, |
| 2864 |
|
to the original \d etc. At this point, ptr will point to a zero byte. */ |
| 2865 |
|
|
| 2866 |
|
if (*ptr == CHAR_ASTERISK || *ptr == CHAR_QUESTION_MARK || |
| 2867 |
|
strncmp((char *)ptr, STR_LEFT_CURLY_BRACKET STR_0 STR_COMMA, 3) == 0) |
| 2868 |
|
return FALSE; |
| 2869 |
|
|
| 2870 |
|
/* Do the property check. */ |
| 2871 |
|
|
| 2872 |
|
return check_char_prop(c, ptype, pdata, (next == -ESC_P) != negated); |
| 2873 |
|
} |
| 2874 |
|
#endif |
| 2875 |
|
|
| 2876 |
default: |
default: |
| 2877 |
return FALSE; |
return FALSE; |
| 2878 |
} |
} |
| 2879 |
|
|
| 2880 |
|
/* In principle, support for Unicode properties should be integrated here as |
| 2881 |
|
well. It means re-organizing the above code so as to get hold of the property |
| 2882 |
|
values before switching on the op-code. However, I wonder how many patterns |
| 2883 |
|
combine ASCII \d etc with Unicode properties? (Note that if PCRE_UCP is set, |
| 2884 |
|
these op-codes are never generated.) */ |
| 2885 |
|
|
| 2886 |
case OP_DIGIT: |
case OP_DIGIT: |
| 2887 |
return next == -ESC_D || next == -ESC_s || next == -ESC_W || |
return next == -ESC_D || next == -ESC_s || next == -ESC_W || |
| 2888 |
next == -ESC_h || next == -ESC_v || next == -ESC_R; |
next == -ESC_h || next == -ESC_v || next == -ESC_R; |
| 2897 |
return next == -ESC_s || next == -ESC_h || next == -ESC_v; |
return next == -ESC_s || next == -ESC_h || next == -ESC_v; |
| 2898 |
|
|
| 2899 |
case OP_HSPACE: |
case OP_HSPACE: |
| 2900 |
return next == -ESC_S || next == -ESC_H || next == -ESC_d || |
return next == -ESC_S || next == -ESC_H || next == -ESC_d || |
| 2901 |
next == -ESC_w || next == -ESC_v || next == -ESC_R; |
next == -ESC_w || next == -ESC_v || next == -ESC_R; |
| 2902 |
|
|
| 2903 |
case OP_NOT_HSPACE: |
case OP_NOT_HSPACE: |
| 2904 |
return next == -ESC_h; |
return next == -ESC_h; |
| 2905 |
|
|
| 2906 |
/* Can't have \S in here because VT matches \S (Perl anomaly) */ |
/* Can't have \S in here because VT matches \S (Perl anomaly) */ |
| 2907 |
case OP_ANYNL: |
case OP_ANYNL: |
| 2908 |
case OP_VSPACE: |
case OP_VSPACE: |
| 2909 |
return next == -ESC_V || next == -ESC_d || next == -ESC_w; |
return next == -ESC_V || next == -ESC_d || next == -ESC_w; |
| 2910 |
|
|
| 2912 |
return next == -ESC_v || next == -ESC_R; |
return next == -ESC_v || next == -ESC_R; |
| 2913 |
|
|
| 2914 |
case OP_WORDCHAR: |
case OP_WORDCHAR: |
| 2915 |
return next == -ESC_W || next == -ESC_s || next == -ESC_h || |
return next == -ESC_W || next == -ESC_s || next == -ESC_h || |
| 2916 |
next == -ESC_v || next == -ESC_R; |
next == -ESC_v || next == -ESC_R; |
| 2917 |
|
|
| 2918 |
case OP_NOT_WORDCHAR: |
case OP_NOT_WORDCHAR: |
| 3048 |
|
|
| 3049 |
c = *ptr; |
c = *ptr; |
| 3050 |
|
|
| 3051 |
/* If we are at the end of a nested substitution, revert to the outer level |
/* If we are at the end of a nested substitution, revert to the outer level |
| 3052 |
string. Nesting only happens one level deep. */ |
string. Nesting only happens one level deep. */ |
| 3053 |
|
|
| 3054 |
if (c == 0 && nestptr != NULL) |
if (c == 0 && nestptr != NULL) |
| 3088 |
goto FAILED; |
goto FAILED; |
| 3089 |
} |
} |
| 3090 |
|
|
| 3091 |
*lengthptr += code - last_code; |
*lengthptr += (int)(code - last_code); |
| 3092 |
DPRINTF(("length=%d added %d c=%c\n", *lengthptr, code - last_code, c)); |
DPRINTF(("length=%d added %d c=%c\n", *lengthptr, code - last_code, c)); |
| 3093 |
|
|
| 3094 |
/* If "previous" is set and it is not at the start of the work space, move |
/* If "previous" is set and it is not at the start of the work space, move |
| 3170 |
if ((cd->ctypes[c] & ctype_space) != 0) continue; |
if ((cd->ctypes[c] & ctype_space) != 0) continue; |
| 3171 |
if (c == CHAR_NUMBER_SIGN) |
if (c == CHAR_NUMBER_SIGN) |
| 3172 |
{ |
{ |
| 3173 |
while (*(++ptr) != 0) |
ptr++; |
| 3174 |
|
while (*ptr != 0) |
| 3175 |
{ |
{ |
| 3176 |
if (IS_NEWLINE(ptr)) { ptr += cd->nllen - 1; break; } |
if (IS_NEWLINE(ptr)) { ptr += cd->nllen - 1; break; } |
| 3177 |
|
ptr++; |
| 3178 |
|
#ifdef SUPPORT_UTF8 |
| 3179 |
|
if (utf8) while ((*ptr & 0xc0) == 0x80) ptr++; |
| 3180 |
|
#endif |
| 3181 |
} |
} |
| 3182 |
if (*ptr != 0) continue; |
if (*ptr != 0) continue; |
| 3183 |
|
|
| 3211 |
*errorcodeptr = ERR20; |
*errorcodeptr = ERR20; |
| 3212 |
goto FAILED; |
goto FAILED; |
| 3213 |
} |
} |
| 3214 |
*lengthptr += code - last_code; /* To include callout length */ |
*lengthptr += (int)(code - last_code); /* To include callout length */ |
| 3215 |
DPRINTF((">> end branch\n")); |
DPRINTF((">> end branch\n")); |
| 3216 |
} |
} |
| 3217 |
return TRUE; |
return TRUE; |
| 3360 |
{ /* Braces are required because the */ |
{ /* Braces are required because the */ |
| 3361 |
GETCHARLEN(c, ptr, ptr); /* macro generates multiple statements */ |
GETCHARLEN(c, ptr, ptr); /* macro generates multiple statements */ |
| 3362 |
} |
} |
| 3363 |
|
|
| 3364 |
/* In the pre-compile phase, accumulate the length of any UTF-8 extra |
/* In the pre-compile phase, accumulate the length of any UTF-8 extra |
| 3365 |
data and reset the pointer. This is so that very large classes that |
data and reset the pointer. This is so that very large classes that |
| 3366 |
contain a zillion UTF-8 characters no longer overwrite the work space |
contain a zillion UTF-8 characters no longer overwrite the work space |
| 3416 |
ptr++; |
ptr++; |
| 3417 |
} |
} |
| 3418 |
|
|
| 3419 |
posix_class = check_posix_name(ptr, tempptr - ptr); |
posix_class = check_posix_name(ptr, (int)(tempptr - ptr)); |
| 3420 |
if (posix_class < 0) |
if (posix_class < 0) |
| 3421 |
{ |
{ |
| 3422 |
*errorcodeptr = ERR30; |
*errorcodeptr = ERR30; |
| 3429 |
|
|
| 3430 |
if ((options & PCRE_CASELESS) != 0 && posix_class <= 2) |
if ((options & PCRE_CASELESS) != 0 && posix_class <= 2) |
| 3431 |
posix_class = 0; |
posix_class = 0; |
| 3432 |
|
|
| 3433 |
/* When PCRE_UCP is set, some of the POSIX classes are converted to |
/* When PCRE_UCP is set, some of the POSIX classes are converted to |
| 3434 |
different escape sequences that use Unicode properties. */ |
different escape sequences that use Unicode properties. */ |
| 3435 |
|
|
| 3436 |
#ifdef SUPPORT_UCP |
#ifdef SUPPORT_UCP |
| 3437 |
if ((options & PCRE_UCP) != 0) |
if ((options & PCRE_UCP) != 0) |
| 3438 |
{ |
{ |
| 3439 |
int pc = posix_class + ((local_negate)? POSIX_SUBSIZE/2 : 0); |
int pc = posix_class + ((local_negate)? POSIX_SUBSIZE/2 : 0); |
| 3440 |
if (posix_substitutes[pc] != NULL) |
if (posix_substitutes[pc] != NULL) |
| 3441 |
{ |
{ |
| 3442 |
nestptr = tempptr + 1; |
nestptr = tempptr + 1; |
| 3443 |
ptr = posix_substitutes[pc] - 1; |
ptr = posix_substitutes[pc] - 1; |
| 3444 |
continue; |
continue; |
| 3445 |
} |
} |
| 3446 |
} |
} |
| 3447 |
#endif |
#endif |
| 3448 |
/* In the non-UCP case, we build the bit map for the POSIX class in a |
/* In the non-UCP case, we build the bit map for the POSIX class in a |
| 3449 |
chunk of local store because we may be adding and subtracting from it, |
chunk of local store because we may be adding and subtracting from it, |
| 3450 |
and we don't want to subtract bits that may be in the main map already. |
and we don't want to subtract bits that may be in the main map already. |
| 3531 |
case ESC_SU: |
case ESC_SU: |
| 3532 |
nestptr = ptr; |
nestptr = ptr; |
| 3533 |
ptr = substitutes[-c - ESC_DU] - 1; /* Just before substitute */ |
ptr = substitutes[-c - ESC_DU] - 1; /* Just before substitute */ |
| 3534 |
class_charcount -= 2; /* Undo! */ |
class_charcount -= 2; /* Undo! */ |
| 3535 |
continue; |
continue; |
| 3536 |
#endif |
#endif |
| 3537 |
case ESC_d: |
case ESC_d: |
| 3552 |
for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_word]; |
for (c = 0; c < 32; c++) classbits[c] |= ~cbits[c+cbit_word]; |
| 3553 |
continue; |
continue; |
| 3554 |
|
|
| 3555 |
|
/* Perl 5.004 onwards omits VT from \s, but we must preserve it |
| 3556 |
|
if it was previously set by something earlier in the character |
| 3557 |
|
class. */ |
| 3558 |
|
|
| 3559 |
case ESC_s: |
case ESC_s: |
| 3560 |
for (c = 0; c < 32; c++) classbits[c] |= cbits[c+cbit_space]; |
classbits[0] |= cbits[cbit_space]; |
| 3561 |
classbits[1] &= ~0x08; /* Perl 5.004 onwards omits VT from \s */ |
classbits[1] |= cbits[cbit_space+1] & ~0x08; |
| 3562 |
|
for (c = 2; c < 32; c++) classbits[c] |= cbits[c+cbit_space]; |
| 3563 |
continue; |
continue; |
| 3564 |
|
|
| 3565 |
case ESC_S: |
case ESC_S: |
| 3987 |
can cause firstbyte to be set. Otherwise, there can be no first char if |
can cause firstbyte to be set. Otherwise, there can be no first char if |
| 3988 |
this item is first, whatever repeat count may follow. In the case of |
this item is first, whatever repeat count may follow. In the case of |
| 3989 |
reqbyte, save the previous value for reinstating. */ |
reqbyte, save the previous value for reinstating. */ |
| 3990 |
|
|
| 3991 |
#ifdef SUPPORT_UTF8 |
#ifdef SUPPORT_UTF8 |
| 3992 |
if (class_charcount == 1 && !class_utf8 && |
if (class_charcount == 1 && !class_utf8 && |
| 3993 |
(!utf8 || !negate_class || class_lastchar < 128)) |
(!utf8 || !negate_class || class_lastchar < 128)) |
| 4067 |
} |
} |
| 4068 |
#endif |
#endif |
| 4069 |
|
|
| 4070 |
/* If there are no characters > 255, or they are all to be included or |
/* If there are no characters > 255, or they are all to be included or |
| 4071 |
excluded, set the opcode to OP_CLASS or OP_NCLASS, depending on whether the |
excluded, set the opcode to OP_CLASS or OP_NCLASS, depending on whether the |
| 4072 |
whole class was negated and whether there were negative specials such as \S |
whole class was negated and whether there were negative specials such as \S |
| 4073 |
(non-UCP) in the class. Then copy the 32-byte map into the code vector, |
(non-UCP) in the class. Then copy the 32-byte map into the code vector, |
| 4195 |
|
|
| 4196 |
if (!possessive_quantifier && |
if (!possessive_quantifier && |
| 4197 |
repeat_max < 0 && |
repeat_max < 0 && |
| 4198 |
check_auto_possessive(*previous, c, utf8, utf8_char, ptr + 1, |
check_auto_possessive(previous, utf8, ptr + 1, options, cd)) |
|
options, cd)) |
|
| 4199 |
{ |
{ |
| 4200 |
repeat_type = 0; /* Force greedy */ |
repeat_type = 0; /* Force greedy */ |
| 4201 |
possessive_quantifier = TRUE; |
possessive_quantifier = TRUE; |
| 4216 |
c = previous[1]; |
c = previous[1]; |
| 4217 |
if (!possessive_quantifier && |
if (!possessive_quantifier && |
| 4218 |
repeat_max < 0 && |
repeat_max < 0 && |
| 4219 |
check_auto_possessive(OP_NOT, c, utf8, NULL, ptr + 1, options, cd)) |
check_auto_possessive(previous, utf8, ptr + 1, options, cd)) |
| 4220 |
{ |
{ |
| 4221 |
repeat_type = 0; /* Force greedy */ |
repeat_type = 0; /* Force greedy */ |
| 4222 |
possessive_quantifier = TRUE; |
possessive_quantifier = TRUE; |
| 4240 |
|
|
| 4241 |
if (!possessive_quantifier && |
if (!possessive_quantifier && |
| 4242 |
repeat_max < 0 && |
repeat_max < 0 && |
| 4243 |
check_auto_possessive(c, 0, utf8, NULL, ptr + 1, options, cd)) |
check_auto_possessive(previous, utf8, ptr + 1, options, cd)) |
| 4244 |
{ |
{ |
| 4245 |
repeat_type = 0; /* Force greedy */ |
repeat_type = 0; /* Force greedy */ |
| 4246 |
possessive_quantifier = TRUE; |
possessive_quantifier = TRUE; |
| 4450 |
{ |
{ |
| 4451 |
register int i; |
register int i; |
| 4452 |
int ketoffset = 0; |
int ketoffset = 0; |
| 4453 |
int len = code - previous; |
int len = (int)(code - previous); |
| 4454 |
uschar *bralink = NULL; |
uschar *bralink = NULL; |
| 4455 |
|
|
| 4456 |
/* Repeating a DEFINE group is pointless */ |
/* Repeating a DEFINE group is pointless */ |
| 4471 |
{ |
{ |
| 4472 |
register uschar *ket = previous; |
register uschar *ket = previous; |
| 4473 |
do ket += GET(ket, 1); while (*ket != OP_KET); |
do ket += GET(ket, 1); while (*ket != OP_KET); |
| 4474 |
ketoffset = code - ket; |
ketoffset = (int)(code - ket); |
| 4475 |
} |
} |
| 4476 |
|
|
| 4477 |
/* The case of a zero minimum is special because of the need to stick |
/* The case of a zero minimum is special because of the need to stick |
| 4539 |
/* We chain together the bracket offset fields that have to be |
/* We chain together the bracket offset fields that have to be |
| 4540 |
filled in later when the ends of the brackets are reached. */ |
filled in later when the ends of the brackets are reached. */ |
| 4541 |
|
|
| 4542 |
offset = (bralink == NULL)? 0 : previous - bralink; |
offset = (bralink == NULL)? 0 : (int)(previous - bralink); |
| 4543 |
bralink = previous; |
bralink = previous; |
| 4544 |
PUTINC(previous, 0, offset); |
PUTINC(previous, 0, offset); |
| 4545 |
} |
} |
| 4648 |
{ |
{ |
| 4649 |
int offset; |
int offset; |
| 4650 |
*code++ = OP_BRA; |
*code++ = OP_BRA; |
| 4651 |
offset = (bralink == NULL)? 0 : code - bralink; |
offset = (bralink == NULL)? 0 : (int)(code - bralink); |
| 4652 |
bralink = code; |
bralink = code; |
| 4653 |
PUTINC(code, 0, offset); |
PUTINC(code, 0, offset); |
| 4654 |
} |
} |
| 4669 |
while (bralink != NULL) |
while (bralink != NULL) |
| 4670 |
{ |
{ |
| 4671 |
int oldlinkoffset; |
int oldlinkoffset; |
| 4672 |
int offset = code - bralink + 1; |
int offset = (int)(code - bralink + 1); |
| 4673 |
uschar *bra = code - offset; |
uschar *bra = code - offset; |
| 4674 |
oldlinkoffset = GET(bra, 1); |
oldlinkoffset = GET(bra, 1); |
| 4675 |
bralink = (oldlinkoffset == 0)? NULL : bralink - oldlinkoffset; |
bralink = (oldlinkoffset == 0)? NULL : bralink - oldlinkoffset; |
| 4757 |
#endif |
#endif |
| 4758 |
} |
} |
| 4759 |
|
|
| 4760 |
len = code - tempcode; |
len = (int)(code - tempcode); |
| 4761 |
if (len > 0) switch (*tempcode) |
if (len > 0) switch (*tempcode) |
| 4762 |
{ |
{ |
| 4763 |
case OP_STAR: *tempcode = OP_POSSTAR; break; |
case OP_STAR: *tempcode = OP_POSSTAR; break; |
| 4826 |
const uschar *arg = NULL; |
const uschar *arg = NULL; |
| 4827 |
previous = NULL; |
previous = NULL; |
| 4828 |
while ((cd->ctypes[*++ptr] & ctype_letter) != 0) {}; |
while ((cd->ctypes[*++ptr] & ctype_letter) != 0) {}; |
| 4829 |
namelen = ptr - name; |
namelen = (int)(ptr - name); |
| 4830 |
|
|
| 4831 |
if (*ptr == CHAR_COLON) |
if (*ptr == CHAR_COLON) |
| 4832 |
{ |
{ |
| 4833 |
arg = ++ptr; |
arg = ++ptr; |
| 4834 |
while ((cd->ctypes[*ptr] & (ctype_letter|ctype_digit)) != 0 |
while ((cd->ctypes[*ptr] & (ctype_letter|ctype_digit)) != 0 |
| 4835 |
|| *ptr == '_') ptr++; |
|| *ptr == '_') ptr++; |
| 4836 |
arglen = ptr - arg; |
arglen = (int)(ptr - arg); |
| 4837 |
} |
} |
| 4838 |
|
|
| 4839 |
if (*ptr != CHAR_RIGHT_PARENTHESIS) |
if (*ptr != CHAR_RIGHT_PARENTHESIS) |
| 4871 |
*errorcodeptr = ERR66; |
*errorcodeptr = ERR66; |
| 4872 |
goto FAILED; |
goto FAILED; |
| 4873 |
} |
} |
| 4874 |
*code++ = verbs[i].op; |
*code = verbs[i].op; |
| 4875 |
|
if (*code++ == OP_THEN) |
| 4876 |
|
{ |
| 4877 |
|
PUT(code, 0, code - bcptr->current_branch - 1); |
| 4878 |
|
code += LINK_SIZE; |
| 4879 |
|
} |
| 4880 |
} |
} |
| 4881 |
|
|
| 4882 |
else |
else |
| 4886 |
*errorcodeptr = ERR59; |
*errorcodeptr = ERR59; |
| 4887 |
goto FAILED; |
goto FAILED; |
| 4888 |
} |
} |
| 4889 |
*code++ = verbs[i].op_arg; |
*code = verbs[i].op_arg; |
| 4890 |
|
if (*code++ == OP_THEN_ARG) |
| 4891 |
|
{ |
| 4892 |
|
PUT(code, 0, code - bcptr->current_branch - 1); |
| 4893 |
|
code += LINK_SIZE; |
| 4894 |
|
} |
| 4895 |
*code++ = arglen; |
*code++ = arglen; |
| 4896 |
memcpy(code, arg, arglen); |
memcpy(code, arg, arglen); |
| 4897 |
code += arglen; |
code += arglen; |
| 5024 |
recno * 10 + *ptr - CHAR_0 : -1; |
recno * 10 + *ptr - CHAR_0 : -1; |
| 5025 |
ptr++; |
ptr++; |
| 5026 |
} |
} |
| 5027 |
namelen = ptr - name; |
namelen = (int)(ptr - name); |
| 5028 |
|
|
| 5029 |
if ((terminator > 0 && *ptr++ != terminator) || |
if ((terminator > 0 && *ptr++ != terminator) || |
| 5030 |
*ptr++ != CHAR_RIGHT_PARENTHESIS) |
*ptr++ != CHAR_RIGHT_PARENTHESIS) |
| 5085 |
/* Search the pattern for a forward reference */ |
/* Search the pattern for a forward reference */ |
| 5086 |
|
|
| 5087 |
else if ((i = find_parens(cd, name, namelen, |
else if ((i = find_parens(cd, name, namelen, |
| 5088 |
(options & PCRE_EXTENDED) != 0)) > 0) |
(options & PCRE_EXTENDED) != 0, utf8)) > 0) |
| 5089 |
{ |
{ |
| 5090 |
PUT2(code, 2+LINK_SIZE, i); |
PUT2(code, 2+LINK_SIZE, i); |
| 5091 |
code[1+LINK_SIZE]++; |
code[1+LINK_SIZE]++; |
| 5220 |
goto FAILED; |
goto FAILED; |
| 5221 |
} |
} |
| 5222 |
*code++ = n; |
*code++ = n; |
| 5223 |
PUT(code, 0, ptr - cd->start_pattern + 1); /* Pattern offset */ |
PUT(code, 0, (int)(ptr - cd->start_pattern + 1)); /* Pattern offset */ |
| 5224 |
PUT(code, LINK_SIZE, 0); /* Default length */ |
PUT(code, LINK_SIZE, 0); /* Default length */ |
| 5225 |
code += 2 * LINK_SIZE; |
code += 2 * LINK_SIZE; |
| 5226 |
} |
} |
| 5227 |
previous = NULL; |
previous = NULL; |
| 5254 |
name = ++ptr; |
name = ++ptr; |
| 5255 |
|
|
| 5256 |
while ((cd->ctypes[*ptr] & ctype_word) != 0) ptr++; |
while ((cd->ctypes[*ptr] & ctype_word) != 0) ptr++; |
| 5257 |
namelen = ptr - name; |
namelen = (int)(ptr - name); |
| 5258 |
|
|
| 5259 |
/* In the pre-compile phase, just do a syntax check. */ |
/* In the pre-compile phase, just do a syntax check. */ |
| 5260 |
|
|
| 5384 |
NAMED_REF_OR_RECURSE: |
NAMED_REF_OR_RECURSE: |
| 5385 |
name = ++ptr; |
name = ++ptr; |
| 5386 |
while ((cd->ctypes[*ptr] & ctype_word) != 0) ptr++; |
while ((cd->ctypes[*ptr] & ctype_word) != 0) ptr++; |
| 5387 |
namelen = ptr - name; |
namelen = (int)(ptr - name); |
| 5388 |
|
|
| 5389 |
/* In the pre-compile phase, do a syntax check and set a dummy |
/* In the pre-compile phase, do a syntax check. We used to just set |
| 5390 |
reference number. */ |
a dummy reference number, because it was not used in the first pass. |
| 5391 |
|
However, with the change of recursive back references to be atomic, |
| 5392 |
|
we have to look for the number so that this state can be identified, as |
| 5393 |
|
otherwise the incorrect length is computed. If it's not a backwards |
| 5394 |
|
reference, the dummy number will do. */ |
| 5395 |
|
|
| 5396 |
if (lengthptr != NULL) |
if (lengthptr != NULL) |
| 5397 |
{ |
{ |
| 5398 |
|
const uschar *temp; |
| 5399 |
|
|
| 5400 |
if (namelen == 0) |
if (namelen == 0) |
| 5401 |
{ |
{ |
| 5402 |
*errorcodeptr = ERR62; |
*errorcodeptr = ERR62; |
| 5412 |
*errorcodeptr = ERR48; |
*errorcodeptr = ERR48; |
| 5413 |
goto FAILED; |
goto FAILED; |
| 5414 |
} |
} |
| 5415 |
recno = 0; |
|
| 5416 |
|
/* The name table does not exist in the first pass, so we cannot |
| 5417 |
|
do a simple search as in the code below. Instead, we have to scan the |
| 5418 |
|
pattern to find the number. It is important that we scan it only as |
| 5419 |
|
far as we have got because the syntax of named subpatterns has not |
| 5420 |
|
been checked for the rest of the pattern, and find_parens() assumes |
| 5421 |
|
correct syntax. In any case, it's a waste of resources to scan |
| 5422 |
|
further. We stop the scan at the current point by temporarily |
| 5423 |
|
adjusting the value of cd->endpattern. */ |
| 5424 |
|
|
| 5425 |
|
temp = cd->end_pattern; |
| 5426 |
|
cd->end_pattern = ptr; |
| 5427 |
|
recno = find_parens(cd, name, namelen, |
| 5428 |
|
(options & PCRE_EXTENDED) != 0, utf8); |
| 5429 |
|
cd->end_pattern = temp; |
| 5430 |
|
if (recno < 0) recno = 0; /* Forward ref; set dummy number */ |
| 5431 |
} |
} |
| 5432 |
|
|
| 5433 |
/* In the real compile, seek the name in the table. We check the name |
/* In the real compile, seek the name in the table. We check the name |
| 5452 |
} |
} |
| 5453 |
else if ((recno = /* Forward back reference */ |
else if ((recno = /* Forward back reference */ |
| 5454 |
find_parens(cd, name, namelen, |
find_parens(cd, name, namelen, |
| 5455 |
(options & PCRE_EXTENDED) != 0)) <= 0) |
(options & PCRE_EXTENDED) != 0, utf8)) <= 0) |
| 5456 |
{ |
{ |
| 5457 |
*errorcodeptr = ERR15; |
*errorcodeptr = ERR15; |
| 5458 |
goto FAILED; |
goto FAILED; |
| 5563 |
if (called == NULL) |
if (called == NULL) |
| 5564 |
{ |
{ |
| 5565 |
if (find_parens(cd, NULL, recno, |
if (find_parens(cd, NULL, recno, |
| 5566 |
(options & PCRE_EXTENDED) != 0) < 0) |
(options & PCRE_EXTENDED) != 0, utf8) < 0) |
| 5567 |
{ |
{ |
| 5568 |
*errorcodeptr = ERR15; |
*errorcodeptr = ERR15; |
| 5569 |
goto FAILED; |
goto FAILED; |
| 5574 |
of the group. */ |
of the group. */ |
| 5575 |
|
|
| 5576 |
called = cd->start_code + recno; |
called = cd->start_code + recno; |
| 5577 |
PUTINC(cd->hwm, 0, code + 2 + LINK_SIZE - cd->start_code); |
PUTINC(cd->hwm, 0, (int)(code + 2 + LINK_SIZE - cd->start_code)); |
| 5578 |
} |
} |
| 5579 |
|
|
| 5580 |
/* If not a forward reference, and the subpattern is still open, |
/* If not a forward reference, and the subpattern is still open, |
| 5598 |
code += 1 + LINK_SIZE; |
code += 1 + LINK_SIZE; |
| 5599 |
|
|
| 5600 |
*code = OP_RECURSE; |
*code = OP_RECURSE; |
| 5601 |
PUT(code, 1, called - cd->start_code); |
PUT(code, 1, (int)(called - cd->start_code)); |
| 5602 |
code += 1 + LINK_SIZE; |
code += 1 + LINK_SIZE; |
| 5603 |
|
|
| 5604 |
*code = OP_KET; |
*code = OP_KET; |
| 5902 |
|
|
| 5903 |
/* ===================================================================*/ |
/* ===================================================================*/ |
| 5904 |
/* Handle metasequences introduced by \. For ones like \d, the ESC_ values |
/* Handle metasequences introduced by \. For ones like \d, the ESC_ values |
| 5905 |
are arranged to be the negation of the corresponding OP_values in the |
are arranged to be the negation of the corresponding OP_values in the |
| 5906 |
default case when PCRE_UCP is not set. For the back references, the values |
default case when PCRE_UCP is not set. For the back references, the values |
| 5907 |
are ESC_REF plus the reference number. Only back references and those types |
are ESC_REF plus the reference number. Only back references and those types |
| 5908 |
that consume a character may be repeated. We can test for values between |
that consume a character may be repeated. We can test for values between |
| 6080 |
ptr = substitutes[-c - ESC_DU] - 1; /* Just before substitute */ |
ptr = substitutes[-c - ESC_DU] - 1; /* Just before substitute */ |
| 6081 |
} |
} |
| 6082 |
else |
else |
| 6083 |
#endif |
#endif |
| 6084 |
{ |
{ |
| 6085 |
previous = (-c > ESC_b && -c < ESC_Z)? code : NULL; |
previous = (-c > ESC_b && -c < ESC_Z)? code : NULL; |
| 6086 |
*code++ = -c; |
*code++ = -c; |
| 6087 |
} |
} |
| 6088 |
} |
} |
| 6089 |
continue; |
continue; |
| 6090 |
} |
} |
| 6416 |
{ |
{ |
| 6417 |
if (lengthptr == NULL) |
if (lengthptr == NULL) |
| 6418 |
{ |
{ |
| 6419 |
int branch_length = code - last_branch; |
int branch_length = (int)(code - last_branch); |
| 6420 |
do |
do |
| 6421 |
{ |
{ |
| 6422 |
int prev_length = GET(last_branch, 1); |
int prev_length = GET(last_branch, 1); |
| 6430 |
/* Fill in the ket */ |
/* Fill in the ket */ |
| 6431 |
|
|
| 6432 |
*code = OP_KET; |
*code = OP_KET; |
| 6433 |
PUT(code, 1, code - start_bracket); |
PUT(code, 1, (int)(code - start_bracket)); |
| 6434 |
code += 1 + LINK_SIZE; |
code += 1 + LINK_SIZE; |
| 6435 |
|
|
| 6436 |
/* If it was a capturing subpattern, check to see if it contained any |
/* If it was a capturing subpattern, check to see if it contained any |
| 6445 |
code - start_bracket); |
code - start_bracket); |
| 6446 |
*start_bracket = OP_ONCE; |
*start_bracket = OP_ONCE; |
| 6447 |
code += 1 + LINK_SIZE; |
code += 1 + LINK_SIZE; |
| 6448 |
PUT(start_bracket, 1, code - start_bracket); |
PUT(start_bracket, 1, (int)(code - start_bracket)); |
| 6449 |
*code = OP_KET; |
*code = OP_KET; |
| 6450 |
PUT(code, 1, code - start_bracket); |
PUT(code, 1, (int)(code - start_bracket)); |
| 6451 |
code += 1 + LINK_SIZE; |
code += 1 + LINK_SIZE; |
| 6452 |
length += 2 + 2*LINK_SIZE; |
length += 2 + 2*LINK_SIZE; |
| 6453 |
} |
} |
| 6502 |
else |
else |
| 6503 |
{ |
{ |
| 6504 |
*code = OP_ALT; |
*code = OP_ALT; |
| 6505 |
PUT(code, 1, code - last_branch); |
PUT(code, 1, (int)(code - last_branch)); |
| 6506 |
bc.current_branch = last_branch = code; |
bc.current_branch = last_branch = code; |
| 6507 |
code += 1 + LINK_SIZE; |
code += 1 + LINK_SIZE; |
| 6508 |
} |
} |
| 6893 |
{ skipatstart += 7; options |= PCRE_UTF8; continue; } |
{ skipatstart += 7; options |= PCRE_UTF8; continue; } |
| 6894 |
else if (strncmp((char *)(ptr+skipatstart+2), STRING_UCP_RIGHTPAR, 4) == 0) |
else if (strncmp((char *)(ptr+skipatstart+2), STRING_UCP_RIGHTPAR, 4) == 0) |
| 6895 |
{ skipatstart += 6; options |= PCRE_UCP; continue; } |
{ skipatstart += 6; options |= PCRE_UCP; continue; } |
| 6896 |
|
else if (strncmp((char *)(ptr+skipatstart+2), STRING_NO_START_OPT_RIGHTPAR, 13) == 0) |
| 6897 |
|
{ skipatstart += 15; options |= PCRE_NO_START_OPTIMIZE; continue; } |
| 6898 |
|
|
| 6899 |
if (strncmp((char *)(ptr+skipatstart+2), STRING_CR_RIGHTPAR, 3) == 0) |
if (strncmp((char *)(ptr+skipatstart+2), STRING_CR_RIGHTPAR, 3) == 0) |
| 6900 |
{ skipatstart += 5; newnl = PCRE_NEWLINE_CR; } |
{ skipatstart += 5; newnl = PCRE_NEWLINE_CR; } |
| 6918 |
options = (options & ~(PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) | newbsr; |
options = (options & ~(PCRE_BSR_ANYCRLF|PCRE_BSR_UNICODE)) | newbsr; |
| 6919 |
else break; |
else break; |
| 6920 |
} |
} |
| 6921 |
|
|
| 6922 |
utf8 = (options & PCRE_UTF8) != 0; |
utf8 = (options & PCRE_UTF8) != 0; |
| 6923 |
|
|
| 6924 |
/* Can't support UTF8 unless PCRE has been compiled to include the code. */ |
/* Can't support UTF8 unless PCRE has been compiled to include the code. The |
| 6925 |
|
return of an error code from _pcre_valid_utf8() is a new feature, introduced in |
| 6926 |
|
release 8.13. The only use we make of it here is to adjust the offset value to |
| 6927 |
|
the end of the string for a short string error, for compatibility with previous |
| 6928 |
|
versions. */ |
| 6929 |
|
|
| 6930 |
#ifdef SUPPORT_UTF8 |
#ifdef SUPPORT_UTF8 |
| 6931 |
if (utf8 && (options & PCRE_NO_UTF8_CHECK) == 0 && |
if (utf8 && (options & PCRE_NO_UTF8_CHECK) == 0 && |
| 6932 |
(*erroroffset = _pcre_valid_utf8((USPTR)pattern, -1)) >= 0) |
(*erroroffset = _pcre_valid_utf8((USPTR)pattern, -1, &errorcode)) >= 0) |
| 6933 |
{ |
{ |
| 6934 |
errorcode = ERR44; |
errorcode = ERR44; |
| 6935 |
goto PCRE_EARLY_ERROR_RETURN2; |
goto PCRE_EARLY_ERROR_RETURN2; |
| 6948 |
if ((options & PCRE_UCP) != 0) |
if ((options & PCRE_UCP) != 0) |
| 6949 |
{ |
{ |
| 6950 |
errorcode = ERR67; |
errorcode = ERR67; |
| 6951 |
goto PCRE_EARLY_ERROR_RETURN; |
goto PCRE_EARLY_ERROR_RETURN; |
| 6952 |
} |
} |
| 6953 |
#endif |
#endif |
| 6954 |
|
|
| 6955 |
/* Check validity of \R options. */ |
/* Check validity of \R options. */ |
| 7080 |
pointers. */ |
pointers. */ |
| 7081 |
|
|
| 7082 |
re->magic_number = MAGIC_NUMBER; |
re->magic_number = MAGIC_NUMBER; |
| 7083 |
re->size = size; |
re->size = (int)size; |
| 7084 |
re->options = cd->external_options; |
re->options = cd->external_options; |
| 7085 |
re->flags = cd->external_flags; |
re->flags = cd->external_flags; |
| 7086 |
re->dummy1 = 0; |
re->dummy1 = 0; |
| 7151 |
recno = GET(codestart, offset); |
recno = GET(codestart, offset); |
| 7152 |
groupptr = _pcre_find_bracket(codestart, utf8, recno); |
groupptr = _pcre_find_bracket(codestart, utf8, recno); |
| 7153 |
if (groupptr == NULL) errorcode = ERR53; |
if (groupptr == NULL) errorcode = ERR53; |
| 7154 |
else PUT(((uschar *)codestart), offset, groupptr - codestart); |
else PUT(((uschar *)codestart), offset, (int)(groupptr - codestart)); |
| 7155 |
} |
} |
| 7156 |
|
|
| 7157 |
/* Give an error if there's back reference to a non-existent capturing |
/* Give an error if there's back reference to a non-existent capturing |
| 7206 |
{ |
{ |
| 7207 |
(pcre_free)(re); |
(pcre_free)(re); |
| 7208 |
PCRE_EARLY_ERROR_RETURN: |
PCRE_EARLY_ERROR_RETURN: |
| 7209 |
*erroroffset = ptr - (const uschar *)pattern; |
*erroroffset = (int)(ptr - (const uschar *)pattern); |
| 7210 |
PCRE_EARLY_ERROR_RETURN2: |
PCRE_EARLY_ERROR_RETURN2: |
| 7211 |
*errorptr = find_error_text(errorcode); |
*errorptr = find_error_text(errorcode); |
| 7212 |
if (errorcodeptr != NULL) *errorcodeptr = errorcode; |
if (errorcodeptr != NULL) *errorcodeptr = errorcode; |