sourcemod-central: tools/pcre/pcre_compile.c@d2d467bf1b5a (annotated)

dvander@2762	1	/*************************************************
dvander@2762	2	* Perl-Compatible Regular Expressions *
dvander@2762	3	*************************************************/
dvander@2762	4
dvander@2762	5	/* PCRE is a library of functions to support regular expressions whose syntax
dvander@2762	6	and semantics are as close as possible to those of the Perl 5 language.
dvander@2762	7
dvander@2762	8	Written by Philip Hazel
dvander@2762	9	Copyright (c) 1997-2009 University of Cambridge
dvander@2762	10
dvander@2762	11	-----------------------------------------------------------------------------
dvander@2762	12	Redistribution and use in source and binary forms, with or without
dvander@2762	13	modification, are permitted provided that the following conditions are met:
dvander@2762	14
dvander@2762	15	* Redistributions of source code must retain the above copyright notice,
dvander@2762	16	this list of conditions and the following disclaimer.
dvander@2762	17
dvander@2762	18	* Redistributions in binary form must reproduce the above copyright
dvander@2762	19	notice, this list of conditions and the following disclaimer in the
dvander@2762	20	documentation and/or other materials provided with the distribution.
dvander@2762	21
dvander@2762	22	* Neither the name of the University of Cambridge nor the names of its
dvander@2762	23	contributors may be used to endorse or promote products derived from
dvander@2762	24	this software without specific prior written permission.
dvander@2762	25
dvander@2762	26	THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
dvander@2762	27	AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
dvander@2762	28	IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
dvander@2762	29	ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
dvander@2762	30	LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
dvander@2762	31	CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
dvander@2762	32	SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
dvander@2762	33	INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
dvander@2762	34	CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
dvander@2762	35	ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
dvander@2762	36	POSSIBILITY OF SUCH DAMAGE.
dvander@2762	37	-----------------------------------------------------------------------------
dvander@2762	38	*/
dvander@2762	39
dvander@2762	40
dvander@2762	41	/* This module contains the external function pcre_compile(), along with
dvander@2762	42	supporting internal functions that are not used by other modules. */
dvander@2762	43
dvander@2762	44
dvander@2762	45	#ifdef HAVE_CONFIG_H
dvander@2762	46	#include "config.h"
dvander@2762	47	#endif
dvander@2762	48
dvander@2762	49	#define NLBLOCK cd /* Block containing newline information */
dvander@2762	50	#define PSSTART start_pattern /* Field containing processed string start */
dvander@2762	51	#define PSEND end_pattern /* Field containing processed string end */
dvander@2762	52
dvander@2762	53	#include "pcre_internal.h"
dvander@2762	54
dvander@2762	55
dvander@2762	56	/* When DEBUG is defined, we need the pcre_printint() function, which is also
dvander@2762	57	used by pcretest. DEBUG is not defined when building a production library. */
dvander@2762	58
dvander@2762	59	#ifdef DEBUG
dvander@2762	60	#include "pcre_printint.src"
dvander@2762	61	#endif
dvander@2762	62
dvander@2762	63
dvander@2762	64	/* Macro for setting individual bits in class bitmaps. */
dvander@2762	65
dvander@2762	66	#define SETBIT(a,b) a[b/8] \|= (1 << (b%8))
dvander@2762	67
dvander@2762	68	/* Maximum length value to check against when making sure that the integer that
dvander@2762	69	holds the compiled pattern length does not overflow. We make it a bit less than
dvander@2762	70	INT_MAX to allow for adding in group terminating bytes, so that we don't have
dvander@2762	71	to check them every time. */
dvander@2762	72
dvander@2762	73	#define OFLOW_MAX (INT_MAX - 20)
dvander@2762	74
dvander@2762	75
dvander@2762	76	/*************************************************
dvander@2762	77	* Code parameters and static tables *
dvander@2762	78	*************************************************/
dvander@2762	79
dvander@2762	80	/* This value specifies the size of stack workspace that is used during the
dvander@2762	81	first pre-compile phase that determines how much memory is required. The regex
dvander@2762	82	is partly compiled into this space, but the compiled parts are discarded as
dvander@2762	83	soon as they can be, so that hopefully there will never be an overrun. The code
dvander@2762	84	does, however, check for an overrun. The largest amount I've seen used is 218,
dvander@2762	85	so this number is very generous.
dvander@2762	86
dvander@2762	87	The same workspace is used during the second, actual compile phase for
dvander@2762	88	remembering forward references to groups so that they can be filled in at the
dvander@2762	89	end. Each entry in this list occupies LINK_SIZE bytes, so even when LINK_SIZE
dvander@2762	90	is 4 there is plenty of room. */
dvander@2762	91
dvander@2762	92	#define COMPILE_WORK_SIZE (4096)
dvander@2762	93
dvander@2762	94
dvander@2762	95	/* Table for handling escaped characters in the range '0'-'z'. Positive returns
dvander@2762	96	are simple data values; negative values are for special things like \d and so
dvander@2762	97	on. Zero means further processing is needed (for things like \x), or the escape
dvander@2762	98	is invalid. */
dvander@2762	99
dvander@2762	100	#ifndef EBCDIC
dvander@2762	101
dvander@2762	102	/* This is the "normal" table for ASCII systems or for EBCDIC systems running
dvander@2762	103	in UTF-8 mode. */
dvander@2762	104
dvander@2762	105	static const short int escapes[] = {
dvander@2762	106	0, 0,
dvander@2762	107	0, 0,
dvander@2762	108	0, 0,
dvander@2762	109	0, 0,
dvander@2762	110	0, 0,
dvander@2762	111	CHAR_COLON, CHAR_SEMICOLON,
dvander@2762	112	CHAR_LESS_THAN_SIGN, CHAR_EQUALS_SIGN,
dvander@2762	113	CHAR_GREATER_THAN_SIGN, CHAR_QUESTION_MARK,
dvander@2762	114	CHAR_COMMERCIAL_AT, -ESC_A,
dvander@2762	115	-ESC_B, -ESC_C,
dvander@2762	116	-ESC_D, -ESC_E,
dvander@2762	117	0, -ESC_G,
dvander@2762	118	-ESC_H, 0,
dvander@2762	119	0, -ESC_K,
dvander@2762	120	0, 0,
dvander@2762	121	0, 0,
dvander@2762	122	-ESC_P, -ESC_Q,
dvander@2762	123	-ESC_R, -ESC_S,
dvander@2762	124	0, 0,
dvander@2762	125	-ESC_V, -ESC_W,
dvander@2762	126	-ESC_X, 0,
dvander@2762	127	-ESC_Z, CHAR_LEFT_SQUARE_BRACKET,
dvander@2762	128	CHAR_BACKSLASH, CHAR_RIGHT_SQUARE_BRACKET,
dvander@2762	129	CHAR_CIRCUMFLEX_ACCENT, CHAR_UNDERSCORE,
dvander@2762	130	CHAR_GRAVE_ACCENT, 7,
dvander@2762	131	-ESC_b, 0,
dvander@2762	132	-ESC_d, ESC_e,
dvander@2762	133	ESC_f, 0,
dvander@2762	134	-ESC_h, 0,
dvander@2762	135	0, -ESC_k,
dvander@2762	136	0, 0,
dvander@2762	137	ESC_n, 0,
dvander@2762	138	-ESC_p, 0,
dvander@2762	139	ESC_r, -ESC_s,
dvander@2762	140	ESC_tee, 0,
dvander@2762	141	-ESC_v, -ESC_w,
dvander@2762	142	0, 0,
dvander@2762	143	-ESC_z
dvander@2762	144	};
dvander@2762	145
dvander@2762	146	#else
dvander@2762	147
dvander@2762	148	/* This is the "abnormal" table for EBCDIC systems without UTF-8 support. */
dvander@2762	149
dvander@2762	150	static const short int escapes[] = {
dvander@2762	151	/* 48 */ 0, 0, 0, '.', '<', '(', '+', '\|',
dvander@2762	152	/* 50 */ '&', 0, 0, 0, 0, 0, 0, 0,
dvander@2762	153	/* 58 / 0, 0, '!', '$', '', ')', ';', '~',
dvander@2762	154	/* 60 */ '-', '/', 0, 0, 0, 0, 0, 0,
dvander@2762	155	/* 68 */ 0, 0, '\|', ',', '%', '_', '>', '?',
dvander@2762	156	/* 70 */ 0, 0, 0, 0, 0, 0, 0, 0,
dvander@2762	157	/* 78 */ 0, '`', ':', '#', '@', '\'', '=', '"',
dvander@2762	158	/* 80 */ 0, 7, -ESC_b, 0, -ESC_d, ESC_e, ESC_f, 0,
dvander@2762	159	/* 88 */-ESC_h, 0, 0, '{', 0, 0, 0, 0,
dvander@2762	160	/* 90 */ 0, 0, -ESC_k, 'l', 0, ESC_n, 0, -ESC_p,
dvander@2762	161	/* 98 */ 0, ESC_r, 0, '}', 0, 0, 0, 0,
dvander@2762	162	/* A0 */ 0, '~', -ESC_s, ESC_tee, 0,-ESC_v, -ESC_w, 0,
dvander@2762	163	/* A8 */ 0,-ESC_z, 0, 0, 0, '[', 0, 0,
dvander@2762	164	/* B0 */ 0, 0, 0, 0, 0, 0, 0, 0,
dvander@2762	165	/* B8 */ 0, 0, 0, 0, 0, ']', '=', '-',
dvander@2762	166	/* C0 */ '{',-ESC_A, -ESC_B, -ESC_C, -ESC_D,-ESC_E, 0, -ESC_G,
dvander@2762	167	/* C8 */-ESC_H, 0, 0, 0, 0, 0, 0, 0,
dvander@2762	168	/* D0 */ '}', 0, -ESC_K, 0, 0, 0, 0, -ESC_P,
dvander@2762	169	/* D8 */-ESC_Q,-ESC_R, 0, 0, 0, 0, 0, 0,
dvander@2762	170	/* E0 */ '\\', 0, -ESC_S, 0, 0,-ESC_V, -ESC_W, -ESC_X,
dvander@2762	171	/* E8 */ 0,-ESC_Z, 0, 0, 0, 0, 0, 0,
dvander@2762	172	/* F0 */ 0, 0, 0, 0, 0, 0, 0, 0,
dvander@2762	173	/* F8 */ 0, 0, 0, 0, 0, 0, 0, 0
dvander@2762	174	};
dvander@2762	175	#endif
dvander@2762	176
dvander@2762	177
dvander@2762	178	/* Table of special "verbs" like (*PRUNE). This is a short table, so it is
dvander@2762	179	searched linearly. Put all the names into a single string, in order to reduce
dvander@2762	180	the number of relocations when a shared library is dynamically linked. The
dvander@2762	181	string is built from string macros so that it works in UTF-8 mode on EBCDIC
dvander@2762	182	platforms. */
dvander@2762	183
dvander@2762	184	typedef struct verbitem {
dvander@2762	185	int len;
dvander@2762	186	int op;
dvander@2762	187	} verbitem;
dvander@2762	188
dvander@2762	189	static const char verbnames[] =
dvander@2762	190	STRING_ACCEPT0
dvander@2762	191	STRING_COMMIT0
dvander@2762	192	STRING_F0
dvander@2762	193	STRING_FAIL0
dvander@2762	194	STRING_PRUNE0
dvander@2762	195	STRING_SKIP0
dvander@2762	196	STRING_THEN;
dvander@2762	197
dvander@2762	198	static const verbitem verbs[] = {
dvander@2762	199	{ 6, OP_ACCEPT },
dvander@2762	200	{ 6, OP_COMMIT },
dvander@2762	201	{ 1, OP_FAIL },
dvander@2762	202	{ 4, OP_FAIL },
dvander@2762	203	{ 5, OP_PRUNE },
dvander@2762	204	{ 4, OP_SKIP },
dvander@2762	205	{ 4, OP_THEN }
dvander@2762	206	};
dvander@2762	207
dvander@2762	208	static const int verbcount = sizeof(verbs)/sizeof(verbitem);
dvander@2762	209
dvander@2762	210
dvander@2762	211	/* Tables of names of POSIX character classes and their lengths. The names are
dvander@2762	212	now all in a single string, to reduce the number of relocations when a shared
dvander@2762	213	library is dynamically loaded. The list of lengths is terminated by a zero
dvander@2762	214	length entry. The first three must be alpha, lower, upper, as this is assumed
dvander@2762	215	for handling case independence. */
dvander@2762	216
dvander@2762	217	static const char posix_names[] =
dvander@2762	218	STRING_alpha0 STRING_lower0 STRING_upper0 STRING_alnum0
dvander@2762	219	STRING_ascii0 STRING_blank0 STRING_cntrl0 STRING_digit0
dvander@2762	220	STRING_graph0 STRING_print0 STRING_punct0 STRING_space0
dvander@2762	221	STRING_word0 STRING_xdigit;
dvander@2762	222
dvander@2762	223	static const uschar posix_name_lengths[] = {
dvander@2762	224	5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 6, 0 };
dvander@2762	225
dvander@2762	226	/* Table of class bit maps for each POSIX class. Each class is formed from a
dvander@2762	227	base map, with an optional addition or removal of another map. Then, for some
dvander@2762	228	classes, there is some additional tweaking: for [:blank:] the vertical space
dvander@2762	229	characters are removed, and for [:alpha:] and [:alnum:] the underscore
dvander@2762	230	character is removed. The triples in the table consist of the base map offset,
dvander@2762	231	second map offset or -1 if no second map, and a non-negative value for map
dvander@2762	232	addition or a negative value for map subtraction (if there are two maps). The
dvander@2762	233	absolute value of the third field has these meanings: 0 => no tweaking, 1 =>
dvander@2762	234	remove vertical space characters, 2 => remove underscore. */
dvander@2762	235
dvander@2762	236	static const int posix_class_maps[] = {
dvander@2762	237	cbit_word, cbit_digit, -2, /* alpha */
dvander@2762	238	cbit_lower, -1, 0, /* lower */
dvander@2762	239	cbit_upper, -1, 0, /* upper */
dvander@2762	240	cbit_word, -1, 2, /* alnum - word without underscore */
dvander@2762	241	cbit_print, cbit_cntrl, 0, /* ascii */
dvander@2762	242	cbit_space, -1, 1, /* blank - a GNU extension */
dvander@2762	243	cbit_cntrl, -1, 0, /* cntrl */
dvander@2762	244	cbit_digit, -1, 0, /* digit */
dvander@2762	245	cbit_graph, -1, 0, /* graph */
dvander@2762	246	cbit_print, -1, 0, /* print */
dvander@2762	247	cbit_punct, -1, 0, /* punct */
dvander@2762	248	cbit_space, -1, 0, /* space */
dvander@2762	249	cbit_word, -1, 0, /* word - a Perl extension */
dvander@2762	250	cbit_xdigit,-1, 0 /* xdigit */
dvander@2762	251	};
dvander@2762	252
dvander@2762	253
dvander@2762	254	#define STRING(a) # a
dvander@2762	255	#define XSTRING(s) STRING(s)
dvander@2762	256
dvander@2762	257	/* The texts of compile-time error messages. These are "char *" because they
dvander@2762	258	are passed to the outside world. Do not ever re-use any error number, because
dvander@2762	259	they are documented. Always add a new error instead. Messages marked DEAD below
dvander@2762	260	are no longer used. This used to be a table of strings, but in order to reduce
dvander@2762	261	the number of relocations needed when a shared library is loaded dynamically,
dvander@2762	262	it is now one long string. We cannot use a table of offsets, because the
dvander@2762	263	lengths of inserts such as XSTRING(MAX_NAME_SIZE) are not known. Instead, we
dvander@2762	264	simply count through to the one we want - this isn't a performance issue
dvander@2762	265	because these strings are used only when there is a compilation error. */
dvander@2762	266
dvander@2762	267	static const char error_texts[] =
dvander@2762	268	"no error\0"
dvander@2762	269	"\\ at end of pattern\0"
dvander@2762	270	"\\c at end of pattern\0"
dvander@2762	271	"unrecognized character follows \\\0"
dvander@2762	272	"numbers out of order in {} quantifier\0"
dvander@2762	273	/* 5 */
dvander@2762	274	"number too big in {} quantifier\0"
dvander@2762	275	"missing terminating ] for character class\0"
dvander@2762	276	"invalid escape sequence in character class\0"
dvander@2762	277	"range out of order in character class\0"
dvander@2762	278	"nothing to repeat\0"
dvander@2762	279	/* 10 */
dvander@2762	280	"operand of unlimited repeat could match the empty string\0" / DEAD /
dvander@2762	281	"internal error: unexpected repeat\0"
dvander@2762	282	"unrecognized character after (? or (?-\0"
dvander@2762	283	"POSIX named classes are supported only within a class\0"
dvander@2762	284	"missing )\0"
dvander@2762	285	/* 15 */
dvander@2762	286	"reference to non-existent subpattern\0"
dvander@2762	287	"erroffset passed as NULL\0"
dvander@2762	288	"unknown option bit(s) set\0"
dvander@2762	289	"missing ) after comment\0"
dvander@2762	290	"parentheses nested too deeply\0" / DEAD /
dvander@2762	291	/* 20 */
dvander@2762	292	"regular expression is too large\0"
dvander@2762	293	"failed to get memory\0"
dvander@2762	294	"unmatched parentheses\0"
dvander@2762	295	"internal error: code overflow\0"
dvander@2762	296	"unrecognized character after (?<\0"
dvander@2762	297	/* 25 */
dvander@2762	298	"lookbehind assertion is not fixed length\0"
dvander@2762	299	"malformed number or name after (?(\0"
dvander@2762	300	"conditional group contains more than two branches\0"
dvander@2762	301	"assertion expected after (?(\0"
dvander@2762	302	"(?R or (?[+-]digits must be followed by )\0"
dvander@2762	303	/* 30 */
dvander@2762	304	"unknown POSIX class name\0"
dvander@2762	305	"POSIX collating elements are not supported\0"
dvander@2762	306	"this version of PCRE is not compiled with PCRE_UTF8 support\0"
dvander@2762	307	"spare error\0" / DEAD /
dvander@2762	308	"character value in \\x{...} sequence is too large\0"
dvander@2762	309	/* 35 */
dvander@2762	310	"invalid condition (?(0)\0"
dvander@2762	311	"\\C not allowed in lookbehind assertion\0"
dvander@2762	312	"PCRE does not support \\L, \\l, \\N, \\U, or \\u\0"
dvander@2762	313	"number after (?C is > 255\0"
dvander@2762	314	"closing ) for (?C expected\0"
dvander@2762	315	/* 40 */
dvander@2762	316	"recursive call could loop indefinitely\0"
dvander@2762	317	"unrecognized character after (?P\0"
dvander@2762	318	"syntax error in subpattern name (missing terminator)\0"
dvander@2762	319	"two named subpatterns have the same name\0"
dvander@2762	320	"invalid UTF-8 string\0"
dvander@2762	321	/* 45 */
dvander@2762	322	"support for \\P, \\p, and \\X has not been compiled\0"
dvander@2762	323	"malformed \\P or \\p sequence\0"
dvander@2762	324	"unknown property name after \\P or \\p\0"
dvander@2762	325	"subpattern name is too long (maximum " XSTRING(MAX_NAME_SIZE) " characters)\0"
dvander@2762	326	"too many named subpatterns (maximum " XSTRING(MAX_NAME_COUNT) ")\0"
dvander@2762	327	/* 50 */
dvander@2762	328	"repeated subpattern is too long\0" / DEAD /
dvander@2762	329	"octal value is greater than \\377 (not in UTF-8 mode)\0"
dvander@2762	330	"internal error: overran compiling workspace\0"
dvander@2762	331	"internal error: previously-checked referenced subpattern not found\0"
dvander@2762	332	"DEFINE group contains more than one branch\0"
dvander@2762	333	/* 55 */
dvander@2762	334	"repeating a DEFINE group is not allowed\0"
dvander@2762	335	"inconsistent NEWLINE options\0"
dvander@2762	336	"\\g is not followed by a braced, angle-bracketed, or quoted name/number or by a plain number\0"
dvander@2762	337	"a numbered reference must not be zero\0"
dvander@2762	338	"(*VERB) with an argument is not supported\0"
dvander@2762	339	/* 60 */
dvander@2762	340	"(*VERB) not recognized\0"
dvander@2762	341	"number is too big\0"
dvander@2762	342	"subpattern name expected\0"
dvander@2762	343	"digit expected after (?+\0"
dvander@2762	344	"] is an invalid data character in JavaScript compatibility mode";
dvander@2762	345
dvander@2762	346
dvander@2762	347	/* Table to identify digits and hex digits. This is used when compiling
dvander@2762	348	patterns. Note that the tables in chartables are dependent on the locale, and
dvander@2762	349	may mark arbitrary characters as digits - but the PCRE compiling code expects
dvander@2762	350	to handle only 0-9, a-z, and A-Z as digits when compiling. That is why we have
dvander@2762	351	a private table here. It costs 256 bytes, but it is a lot faster than doing
dvander@2762	352	character value tests (at least in some simple cases I timed), and in some
dvander@2762	353	applications one wants PCRE to compile efficiently as well as match
dvander@2762	354	efficiently.
dvander@2762	355
dvander@2762	356	For convenience, we use the same bit definitions as in chartables:
dvander@2762	357
dvander@2762	358	0x04 decimal digit
dvander@2762	359	0x08 hexadecimal digit
dvander@2762	360
dvander@2762	361	Then we can use ctype_digit and ctype_xdigit in the code. */
dvander@2762	362
dvander@2762	363	#ifndef EBCDIC
dvander@2762	364
dvander@2762	365	/* This is the "normal" case, for ASCII systems, and EBCDIC systems running in
dvander@2762	366	UTF-8 mode. */
dvander@2762	367
dvander@2762	368	static const unsigned char digitab[] =
dvander@2762	369	{
dvander@2762	370	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 */
dvander@2762	371	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 8- 15 */
dvander@2762	372	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 */
dvander@2762	373	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */
dvander@2762	374	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - ' */
dvander@2762	375	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ( - / */
dvander@2762	376	0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c, /* 0 - 7 */
dvander@2762	377	0x0c,0x0c,0x00,0x00,0x00,0x00,0x00,0x00, /* 8 - ? */
dvander@2762	378	0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /* @ - G */
dvander@2762	379	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* H - O */
dvander@2762	380	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* P - W */
dvander@2762	381	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* X - _ */
dvander@2762	382	0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /* ` - g */
dvander@2762	383	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* h - o */
dvander@2762	384	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* p - w */
dvander@2762	385	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* x -127 */
dvander@2762	386	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 128-135 */
dvander@2762	387	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 136-143 */
dvander@2762	388	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144-151 */
dvander@2762	389	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 152-159 */
dvander@2762	390	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160-167 */
dvander@2762	391	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 168-175 */
dvander@2762	392	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 176-183 */
dvander@2762	393	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
dvander@2762	394	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 192-199 */
dvander@2762	395	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 200-207 */
dvander@2762	396	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 208-215 */
dvander@2762	397	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 216-223 */
dvander@2762	398	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 224-231 */
dvander@2762	399	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 232-239 */
dvander@2762	400	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 240-247 */
dvander@2762	401	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00};/* 248-255 */
dvander@2762	402
dvander@2762	403	#else
dvander@2762	404
dvander@2762	405	/* This is the "abnormal" case, for EBCDIC systems not running in UTF-8 mode. */
dvander@2762	406
dvander@2762	407	static const unsigned char digitab[] =
dvander@2762	408	{
dvander@2762	409	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 0- 7 0 */
dvander@2762	410	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 8- 15 */
dvander@2762	411	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 16- 23 10 */
dvander@2762	412	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */
dvander@2762	413	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 32- 39 20 */
dvander@2762	414	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 40- 47 */
dvander@2762	415	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 48- 55 30 */
dvander@2762	416	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 56- 63 */
dvander@2762	417	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - 71 40 */
dvander@2762	418	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 72- \| */
dvander@2762	419	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* & - 87 50 */
dvander@2762	420	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 88- 95 */
dvander@2762	421	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - -103 60 */
dvander@2762	422	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 104- ? */
dvander@2762	423	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 112-119 70 */
dvander@2762	424	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 120- " */
dvander@2762	425	0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /* 128- g 80 */
dvander@2762	426	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* h -143 */
dvander@2762	427	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 144- p 90 */
dvander@2762	428	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* q -159 */
dvander@2762	429	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 160- x A0 */
dvander@2762	430	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* y -175 */
dvander@2762	431	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ^ -183 B0 */
dvander@2762	432	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
dvander@2762	433	0x00,0x08,0x08,0x08,0x08,0x08,0x08,0x00, /* { - G C0 */
dvander@2762	434	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* H -207 */
dvander@2762	435	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* } - P D0 */
dvander@2762	436	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* Q -223 */
dvander@2762	437	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* \ - X E0 */
dvander@2762	438	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* Y -239 */
dvander@2762	439	0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c, /* 0 - 7 F0 */
dvander@2762	440	0x0c,0x0c,0x00,0x00,0x00,0x00,0x00,0x00};/* 8 -255 */
dvander@2762	441
dvander@2762	442	static const unsigned char ebcdic_chartab[] = { /* chartable partial dup */
dvander@2762	443	0x80,0x00,0x00,0x00,0x00,0x01,0x00,0x00, /* 0- 7 */
dvander@2762	444	0x00,0x00,0x00,0x00,0x01,0x01,0x00,0x00, /* 8- 15 */
dvander@2762	445	0x00,0x00,0x00,0x00,0x00,0x01,0x00,0x00, /* 16- 23 */
dvander@2762	446	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 24- 31 */
dvander@2762	447	0x00,0x00,0x00,0x00,0x00,0x01,0x00,0x00, /* 32- 39 */
dvander@2762	448	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 40- 47 */
dvander@2762	449	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 48- 55 */
dvander@2762	450	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 56- 63 */
dvander@2762	451	0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - 71 */
dvander@2762	452	0x00,0x00,0x00,0x80,0x00,0x80,0x80,0x80, /* 72- \| */
dvander@2762	453	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* & - 87 */
dvander@2762	454	0x00,0x00,0x00,0x80,0x80,0x80,0x00,0x00, /* 88- 95 */
dvander@2762	455	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* - -103 */
dvander@2762	456	0x00,0x00,0x00,0x00,0x00,0x10,0x00,0x80, /* 104- ? */
dvander@2762	457	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 112-119 */
dvander@2762	458	0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* 120- " */
dvander@2762	459	0x00,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /* 128- g */
dvander@2762	460	0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* h -143 */
dvander@2762	461	0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* 144- p */
dvander@2762	462	0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* q -159 */
dvander@2762	463	0x00,0x00,0x12,0x12,0x12,0x12,0x12,0x12, /* 160- x */
dvander@2762	464	0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* y -175 */
dvander@2762	465	0x80,0x00,0x00,0x00,0x00,0x00,0x00,0x00, /* ^ -183 */
dvander@2762	466	0x00,0x00,0x80,0x00,0x00,0x00,0x00,0x00, /* 184-191 */
dvander@2762	467	0x80,0x1a,0x1a,0x1a,0x1a,0x1a,0x1a,0x12, /* { - G */
dvander@2762	468	0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* H -207 */
dvander@2762	469	0x00,0x12,0x12,0x12,0x12,0x12,0x12,0x12, /* } - P */
dvander@2762	470	0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* Q -223 */
dvander@2762	471	0x00,0x00,0x12,0x12,0x12,0x12,0x12,0x12, /* \ - X */
dvander@2762	472	0x12,0x12,0x00,0x00,0x00,0x00,0x00,0x00, /* Y -239 */
dvander@2762	473	0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c,0x1c, /* 0 - 7 */
dvander@2762	474	0x1c,0x1c,0x00,0x00,0x00,0x00,0x00,0x00};/* 8 -255 */
dvander@2762	475	#endif
dvander@2762	476
dvander@2762	477
dvander@2762	478	/* Definition to allow mutual recursion */
dvander@2762	479
dvander@2762	480	static BOOL
dvander@2762	481	compile_regex(int, int, uschar , const uschar , int *, BOOL, BOOL, int,
dvander@2762	482	int , int , branch_chain , compile_data , int *);
dvander@2762	483
dvander@2762	484
dvander@2762	485
dvander@2762	486	/*************************************************
dvander@2762	487	* Find an error text *
dvander@2762	488	*************************************************/
dvander@2762	489
dvander@2762	490	/* The error texts are now all in one long string, to save on relocations. As
dvander@2762	491	some of the text is of unknown length, we can't use a table of offsets.
dvander@2762	492	Instead, just count through the strings. This is not a performance issue
dvander@2762	493	because it happens only when there has been a compilation error.
dvander@2762	494
dvander@2762	495	Argument: the error number
dvander@2762	496	Returns: pointer to the error string
dvander@2762	497	*/
dvander@2762	498
dvander@2762	499	static const char *
dvander@2762	500	find_error_text(int n)
dvander@2762	501	{
dvander@2762	502	const char *s = error_texts;
dvander@2762	503	for (; n > 0; n--) while (*s++ != 0) {};
dvander@2762	504	return s;
dvander@2762	505	}
dvander@2762	506
dvander@2762	507
dvander@2762	508	/*************************************************
dvander@2762	509	* Handle escapes *
dvander@2762	510	*************************************************/
dvander@2762	511
dvander@2762	512	/* This function is called when a \ has been encountered. It either returns a
dvander@2762	513	positive value for a simple escape such as \n, or a negative value which
dvander@2762	514	encodes one of the more complicated things such as \d. A backreference to group
dvander@2762	515	n is returned as -(ESC_REF + n); ESC_REF is the highest ESC_xxx macro. When
dvander@2762	516	UTF-8 is enabled, a positive value greater than 255 may be returned. On entry,
dvander@2762	517	ptr is pointing at the \. On exit, it is on the final character of the escape
dvander@2762	518	sequence.
dvander@2762	519
dvander@2762	520	Arguments:
dvander@2762	521	ptrptr points to the pattern position pointer
dvander@2762	522	errorcodeptr points to the errorcode variable
dvander@2762	523	bracount number of previous extracting brackets
dvander@2762	524	options the options bits
dvander@2762	525	isclass TRUE if inside a character class
dvander@2762	526
dvander@2762	527	Returns: zero or positive => a data character
dvander@2762	528	negative => a special escape sequence
dvander@2762	529	on error, errorcodeptr is set
dvander@2762	530	*/
dvander@2762	531
dvander@2762	532	static int
dvander@2762	533	check_escape(const uschar *ptrptr, int errorcodeptr, int bracount,
dvander@2762	534	int options, BOOL isclass)
dvander@2762	535	{
dvander@2762	536	BOOL utf8 = (options & PCRE_UTF8) != 0;
dvander@2762	537	const uschar ptr = ptrptr + 1;
dvander@2762	538	int c, i;
dvander@2762	539
dvander@2762	540	GETCHARINCTEST(c, ptr); /* Get character value, increment pointer */
dvander@2762	541	ptr--; /* Set pointer back to the last byte */
dvander@2762	542
dvander@2762	543	/* If backslash is at the end of the pattern, it's an error. */
dvander@2762	544
dvander@2762	545	if (c == 0) *errorcodeptr = ERR1;
dvander@2762	546
dvander@2762	547	/* Non-alphanumerics are literals. For digits or letters, do an initial lookup
dvander@2762	548	in a table. A non-zero result is something that can be returned immediately.
dvander@2762	549	Otherwise further processing may be required. */
dvander@2762	550
dvander@2762	551	#ifndef EBCDIC /* ASCII/UTF-8 coding */
dvander@2762	552	else if (c < CHAR_0 \|\| c > CHAR_z) {} /* Not alphanumeric */
dvander@2762	553	else if ((i = escapes[c - CHAR_0]) != 0) c = i;
dvander@2762	554
dvander@2762	555	#else /* EBCDIC coding */
dvander@2762	556	else if (c < 'a' \|\| (ebcdic_chartab[c] & 0x0E) == 0) {} /* Not alphanumeric */
dvander@2762	557	else if ((i = escapes[c - 0x48]) != 0) c = i;
dvander@2762	558	#endif
dvander@2762	559
dvander@2762	560	/* Escapes that need further processing, or are illegal. */
dvander@2762	561
dvander@2762	562	else
dvander@2762	563	{
dvander@2762	564	const uschar *oldptr;
dvander@2762	565	BOOL braced, negated;
dvander@2762	566
dvander@2762	567	switch (c)
dvander@2762	568	{
dvander@2762	569	/* A number of Perl escapes are not handled by PCRE. We give an explicit
dvander@2762	570	error. */
dvander@2762	571
dvander@2762	572	case CHAR_l:
dvander@2762	573	case CHAR_L:
dvander@2762	574	case CHAR_N:
dvander@2762	575	case CHAR_u:
dvander@2762	576	case CHAR_U:
dvander@2762	577	*errorcodeptr = ERR37;
dvander@2762	578	break;
dvander@2762	579
dvander@2762	580	/* \g must be followed by one of a number of specific things:
dvander@2762	581
dvander@2762	582	(1) A number, either plain or braced. If positive, it is an absolute
dvander@2762	583	backreference. If negative, it is a relative backreference. This is a Perl
dvander@2762	584	5.10 feature.
dvander@2762	585
dvander@2762	586	(2) Perl 5.10 also supports \g{name} as a reference to a named group. This
dvander@2762	587	is part of Perl's movement towards a unified syntax for back references. As
dvander@2762	588	this is synonymous with \k{name}, we fudge it up by pretending it really
dvander@2762	589	was \k.
dvander@2762	590
dvander@2762	591	(3) For Oniguruma compatibility we also support \g followed by a name or a
dvander@2762	592	number either in angle brackets or in single quotes. However, these are
dvander@2762	593	(possibly recursive) subroutine calls, _not_ backreferences. Just return
dvander@2762	594	the -ESC_g code (cf \k). */
dvander@2762	595
dvander@2762	596	case CHAR_g:
dvander@2762	597	if (ptr[1] == CHAR_LESS_THAN_SIGN \|\| ptr[1] == CHAR_APOSTROPHE)
dvander@2762	598	{
dvander@2762	599	c = -ESC_g;
dvander@2762	600	break;
dvander@2762	601	}
dvander@2762	602
dvander@2762	603	/* Handle the Perl-compatible cases */
dvander@2762	604
dvander@2762	605	if (ptr[1] == CHAR_LEFT_CURLY_BRACKET)
dvander@2762	606	{
dvander@2762	607	const uschar *p;
dvander@2762	608	for (p = ptr+2; p != 0 && p != CHAR_RIGHT_CURLY_BRACKET; p++)
dvander@2762	609	if (p != CHAR_MINUS && (digitab[p] & ctype_digit) == 0) break;
dvander@2762	610	if (p != 0 && p != CHAR_RIGHT_CURLY_BRACKET)
dvander@2762	611	{
dvander@2762	612	c = -ESC_k;
dvander@2762	613	break;
dvander@2762	614	}
dvander@2762	615	braced = TRUE;
dvander@2762	616	ptr++;
dvander@2762	617	}
dvander@2762	618	else braced = FALSE;
dvander@2762	619
dvander@2762	620	if (ptr[1] == CHAR_MINUS)
dvander@2762	621	{
dvander@2762	622	negated = TRUE;
dvander@2762	623	ptr++;
dvander@2762	624	}
dvander@2762	625	else negated = FALSE;
dvander@2762	626
dvander@2762	627	c = 0;
dvander@2762	628	while ((digitab[ptr[1]] & ctype_digit) != 0)
dvander@2762	629	c = c * 10 + *(++ptr) - CHAR_0;
dvander@2762	630
dvander@2762	631	if (c < 0) /* Integer overflow */
dvander@2762	632	{
dvander@2762	633	*errorcodeptr = ERR61;
dvander@2762	634	break;
dvander@2762	635	}
dvander@2762	636
dvander@2762	637	if (braced && *(++ptr) != CHAR_RIGHT_CURLY_BRACKET)
dvander@2762	638	{
dvander@2762	639	*errorcodeptr = ERR57;
dvander@2762	640	break;
dvander@2762	641	}
dvander@2762	642
dvander@2762	643	if (c == 0)
dvander@2762	644	{
dvander@2762	645	*errorcodeptr = ERR58;
dvander@2762	646	break;
dvander@2762	647	}
dvander@2762	648
dvander@2762	649	if (negated)
dvander@2762	650	{
dvander@2762	651	if (c > bracount)
dvander@2762	652	{
dvander@2762	653	*errorcodeptr = ERR15;
dvander@2762	654	break;
dvander@2762	655	}
dvander@2762	656	c = bracount - (c - 1);
dvander@2762	657	}
dvander@2762	658
dvander@2762	659	c = -(ESC_REF + c);
dvander@2762	660	break;
dvander@2762	661
dvander@2762	662	/* The handling of escape sequences consisting of a string of digits
dvander@2762	663	starting with one that is not zero is not straightforward. By experiment,
dvander@2762	664	the way Perl works seems to be as follows:
dvander@2762	665
dvander@2762	666	Outside a character class, the digits are read as a decimal number. If the
dvander@2762	667	number is less than 10, or if there are that many previous extracting
dvander@2762	668	left brackets, then it is a back reference. Otherwise, up to three octal
dvander@2762	669	digits are read to form an escaped byte. Thus \123 is likely to be octal
dvander@2762	670	123 (cf \0123, which is octal 012 followed by the literal 3). If the octal
dvander@2762	671	value is greater than 377, the least significant 8 bits are taken. Inside a
dvander@2762	672	character class, \ followed by a digit is always an octal number. */
dvander@2762	673
dvander@2762	674	case CHAR_1: case CHAR_2: case CHAR_3: case CHAR_4: case CHAR_5:
dvander@2762	675	case CHAR_6: case CHAR_7: case CHAR_8: case CHAR_9:
dvander@2762	676
dvander@2762	677	if (!isclass)
dvander@2762	678	{
dvander@2762	679	oldptr = ptr;
dvander@2762	680	c -= CHAR_0;
dvander@2762	681	while ((digitab[ptr[1]] & ctype_digit) != 0)
dvander@2762	682	c = c * 10 + *(++ptr) - CHAR_0;
dvander@2762	683	if (c < 0) /* Integer overflow */
dvander@2762	684	{
dvander@2762	685	*errorcodeptr = ERR61;
dvander@2762	686	break;
dvander@2762	687	}
dvander@2762	688	if (c < 10 \|\| c <= bracount)
dvander@2762	689	{
dvander@2762	690	c = -(ESC_REF + c);
dvander@2762	691	break;
dvander@2762	692	}
dvander@2762	693	ptr = oldptr; /* Put the pointer back and fall through */
dvander@2762	694	}
dvander@2762	695
dvander@2762	696	/* Handle an octal number following \. If the first digit is 8 or 9, Perl
dvander@2762	697	generates a binary zero byte and treats the digit as a following literal.
dvander@2762	698	Thus we have to pull back the pointer by one. */
dvander@2762	699
dvander@2762	700	if ((c = *ptr) >= CHAR_8)
dvander@2762	701	{
dvander@2762	702	ptr--;
dvander@2762	703	c = 0;
dvander@2762	704	break;
dvander@2762	705	}
dvander@2762	706
dvander@2762	707	/* \0 always starts an octal number, but we may drop through to here with a
dvander@2762	708	larger first octal digit. The original code used just to take the least
dvander@2762	709	significant 8 bits of octal numbers (I think this is what early Perls used
dvander@2762	710	to do). Nowadays we allow for larger numbers in UTF-8 mode, but no more
dvander@2762	711	than 3 octal digits. */
dvander@2762	712
dvander@2762	713	case CHAR_0:
dvander@2762	714	c -= CHAR_0;
dvander@2762	715	while(i++ < 2 && ptr[1] >= CHAR_0 && ptr[1] <= CHAR_7)
dvander@2762	716	c = c * 8 + *(++ptr) - CHAR_0;
dvander@2762	717	if (!utf8 && c > 255) *errorcodeptr = ERR51;
dvander@2762	718	break;
dvander@2762	719
dvander@2762	720	/* \x is complicated. \x{ddd} is a character number which can be greater
dvander@2762	721	than 0xff in utf8 mode, but only if the ddd are hex digits. If not, { is
dvander@2762	722	treated as a data character. */
dvander@2762	723
dvander@2762	724	case CHAR_x:
dvander@2762	725	if (ptr[1] == CHAR_LEFT_CURLY_BRACKET)
dvander@2762	726	{
dvander@2762	727	const uschar *pt = ptr + 2;
dvander@2762	728	int count = 0;
dvander@2762	729
dvander@2762	730	c = 0;
dvander@2762	731	while ((digitab[*pt] & ctype_xdigit) != 0)
dvander@2762	732	{
dvander@2762	733	register int cc = *pt++;
dvander@2762	734	if (c == 0 && cc == CHAR_0) continue; /* Leading zeroes */
dvander@2762	735	count++;
dvander@2762	736
dvander@2762	737	#ifndef EBCDIC /* ASCII/UTF-8 coding */
dvander@2762	738	if (cc >= CHAR_a) cc -= 32; /* Convert to upper case */
dvander@2762	739	c = (c << 4) + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));
dvander@2762	740	#else /* EBCDIC coding */
dvander@2762	741	if (cc >= CHAR_a && cc <= CHAR_z) cc += 64; /* Convert to upper case */
dvander@2762	742	c = (c << 4) + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));
dvander@2762	743	#endif
dvander@2762	744	}
dvander@2762	745
dvander@2762	746	if (*pt == CHAR_RIGHT_CURLY_BRACKET)
dvander@2762	747	{
dvander@2762	748	if (c < 0 \|\| count > (utf8? 8 : 2)) *errorcodeptr = ERR34;
dvander@2762	749	ptr = pt;
dvander@2762	750	break;
dvander@2762	751	}
dvander@2762	752
dvander@2762	753	/* If the sequence of hex digits does not end with '}', then we don't
dvander@2762	754	recognize this construct; fall through to the normal \x handling. */
dvander@2762	755	}
dvander@2762	756
dvander@2762	757	/* Read just a single-byte hex-defined char */
dvander@2762	758
dvander@2762	759	c = 0;
dvander@2762	760	while (i++ < 2 && (digitab[ptr[1]] & ctype_xdigit) != 0)
dvander@2762	761	{
dvander@2762	762	int cc; /* Some compilers don't like */
dvander@2762	763	cc = (++ptr); / ++ in initializers */
dvander@2762	764	#ifndef EBCDIC /* ASCII/UTF-8 coding */
dvander@2762	765	if (cc >= CHAR_a) cc -= 32; /* Convert to upper case */
dvander@2762	766	c = c * 16 + cc - ((cc < CHAR_A)? CHAR_0 : (CHAR_A - 10));
dvander@2762	767	#else /* EBCDIC coding */
dvander@2762	768	if (cc <= CHAR_z) cc += 64; /* Convert to upper case */
dvander@2762	769	c = c * 16 + cc - ((cc >= CHAR_0)? CHAR_0 : (CHAR_A - 10));
dvander@2762	770	#endif
dvander@2762	771	}
dvander@2762	772	break;
dvander@2762	773
dvander@2762	774	/* For \c, a following letter is upper-cased; then the 0x40 bit is flipped.
dvander@2762	775	This coding is ASCII-specific, but then the whole concept of \cx is
dvander@2762	776	ASCII-specific. (However, an EBCDIC equivalent has now been added.) */
dvander@2762	777
dvander@2762	778	case CHAR_c:
dvander@2762	779	c = *(++ptr);
dvander@2762	780	if (c == 0)
dvander@2762	781	{
dvander@2762	782	*errorcodeptr = ERR2;
dvander@2762	783	break;
dvander@2762	784	}
dvander@2762	785
dvander@2762	786	#ifndef EBCDIC /* ASCII/UTF-8 coding */
dvander@2762	787	if (c >= CHAR_a && c <= CHAR_z) c -= 32;
dvander@2762	788	c ^= 0x40;
dvander@2762	789	#else /* EBCDIC coding */
dvander@2762	790	if (c >= CHAR_a && c <= CHAR_z) c += 64;
dvander@2762	791	c ^= 0xC0;
dvander@2762	792	#endif
dvander@2762	793	break;
dvander@2762	794
dvander@2762	795	/* PCRE_EXTRA enables extensions to Perl in the matter of escapes. Any
dvander@2762	796	other alphanumeric following \ is an error if PCRE_EXTRA was set;
dvander@2762	797	otherwise, for Perl compatibility, it is a literal. This code looks a bit
dvander@2762	798	odd, but there used to be some cases other than the default, and there may
dvander@2762	799	be again in future, so I haven't "optimized" it. */
dvander@2762	800
dvander@2762	801	default:
dvander@2762	802	if ((options & PCRE_EXTRA) != 0) switch(c)
dvander@2762	803	{
dvander@2762	804	default:
dvander@2762	805	*errorcodeptr = ERR3;
dvander@2762	806	break;
dvander@2762	807	}
dvander@2762	808	break;
dvander@2762	809	}
dvander@2762	810	}
dvander@2762	811
dvander@2762	812	*ptrptr = ptr;
dvander@2762	813	return c;
dvander@2762	814	}
dvander@2762	815
dvander@2762	816
dvander@2762	817
dvander@2762	818	#ifdef SUPPORT_UCP
dvander@2762	819	/*************************************************
dvander@2762	820	* Handle \P and \p *
dvander@2762	821	*************************************************/
dvander@2762	822
dvander@2762	823	/* This function is called after \P or \p has been encountered, provided that
dvander@2762	824	PCRE is compiled with support for Unicode properties. On entry, ptrptr is
dvander@2762	825	pointing at the P or p. On exit, it is pointing at the final character of the
dvander@2762	826	escape sequence.
dvander@2762	827
dvander@2762	828	Argument:
dvander@2762	829	ptrptr points to the pattern position pointer
dvander@2762	830	negptr points to a boolean that is set TRUE for negation else FALSE
dvander@2762	831	dptr points to an int that is set to the detailed property value
dvander@2762	832	errorcodeptr points to the error code variable
dvander@2762	833
dvander@2762	834	Returns: type value from ucp_type_table, or -1 for an invalid type
dvander@2762	835	*/
dvander@2762	836
dvander@2762	837	static int
dvander@2762	838	get_ucp(const uschar *ptrptr, BOOL negptr, int dptr, int errorcodeptr)
dvander@2762	839	{
dvander@2762	840	int c, i, bot, top;
dvander@2762	841	const uschar ptr = ptrptr;
dvander@2762	842	char name[32];
dvander@2762	843
dvander@2762	844	c = *(++ptr);
dvander@2762	845	if (c == 0) goto ERROR_RETURN;
dvander@2762	846
dvander@2762	847	*negptr = FALSE;
dvander@2762	848
dvander@2762	849	/* \P or \p can be followed by a name in {}, optionally preceded by ^ for
dvander@2762	850	negation. */
dvander@2762	851
dvander@2762	852	if (c == CHAR_LEFT_CURLY_BRACKET)
dvander@2762	853	{
dvander@2762	854	if (ptr[1] == CHAR_CIRCUMFLEX_ACCENT)
dvander@2762	855	{
dvander@2762	856	*negptr = TRUE;
dvander@2762	857	ptr++;
dvander@2762	858	}
dvander@2762	859	for (i = 0; i < (int)sizeof(name) - 1; i++)
dvander@2762	860	{
dvander@2762	861	c = *(++ptr);
dvander@2762	862	if (c == 0) goto ERROR_RETURN;
dvander@2762	863	if (c == CHAR_RIGHT_CURLY_BRACKET) break;
dvander@2762	864	name[i] = c;
dvander@2762	865	}
dvander@2762	866	if (c != CHAR_RIGHT_CURLY_BRACKET) goto ERROR_RETURN;
dvander@2762	867	name[i] = 0;
dvander@2762	868	}
dvander@2762	869
dvander@2762	870	/* Otherwise there is just one following character */
dvander@2762	871
dvander@2762	872	else
dvander@2762	873	{
dvander@2762	874	name[0] = c;
dvander@2762	875	name[1] = 0;
dvander@2762	876	}
dvander@2762	877
dvander@2762	878	*ptrptr = ptr;
dvander@2762	879
dvander@2762	880	/* Search for a recognized property name using binary chop */
dvander@2762	881
dvander@2762	882	bot = 0;
dvander@2762	883	top = _pcre_utt_size;
dvander@2762	884
dvander@2762	885	while (bot < top)
dvander@2762	886	{
dvander@2762	887	i = (bot + top) >> 1;
dvander@2762	888	c = strcmp(name, _pcre_utt_names + _pcre_utt[i].name_offset);
dvander@2762	889	if (c == 0)
dvander@2762	890	{
dvander@2762	891	*dptr = _pcre_utt[i].value;
dvander@2762	892	return _pcre_utt[i].type;
dvander@2762	893	}
dvander@2762	894	if (c > 0) bot = i + 1; else top = i;
dvander@2762	895	}
dvander@2762	896
dvander@2762	897	*errorcodeptr = ERR47;
dvander@2762	898	*ptrptr = ptr;
dvander@2762	899	return -1;
dvander@2762	900
dvander@2762	901	ERROR_RETURN:
dvander@2762	902	*errorcodeptr = ERR46;
dvander@2762	903	*ptrptr = ptr;
dvander@2762	904	return -1;
dvander@2762	905	}
dvander@2762	906	#endif
dvander@2762	907
dvander@2762	908
dvander@2762	909
dvander@2762	910
dvander@2762	911	/*************************************************
dvander@2762	912	* Check for counted repeat *
dvander@2762	913	*************************************************/
dvander@2762	914
dvander@2762	915	/* This function is called when a '{' is encountered in a place where it might
dvander@2762	916	start a quantifier. It looks ahead to see if it really is a quantifier or not.
dvander@2762	917	It is only a quantifier if it is one of the forms {ddd} {ddd,} or {ddd,ddd}
dvander@2762	918	where the ddds are digits.
dvander@2762	919
dvander@2762	920	Arguments:
dvander@2762	921	p pointer to the first char after '{'
dvander@2762	922
dvander@2762	923	Returns: TRUE or FALSE
dvander@2762	924	*/
dvander@2762	925
dvander@2762	926	static BOOL
dvander@2762	927	is_counted_repeat(const uschar *p)
dvander@2762	928	{
dvander@2762	929	if ((digitab[*p++] & ctype_digit) == 0) return FALSE;
dvander@2762	930	while ((digitab[*p] & ctype_digit) != 0) p++;
dvander@2762	931	if (*p == CHAR_RIGHT_CURLY_BRACKET) return TRUE;
dvander@2762	932
dvander@2762	933	if (*p++ != CHAR_COMMA) return FALSE;
dvander@2762	934	if (*p == CHAR_RIGHT_CURLY_BRACKET) return TRUE;
dvander@2762	935
dvander@2762	936	if ((digitab[*p++] & ctype_digit) == 0) return FALSE;
dvander@2762	937	while ((digitab[*p] & ctype_digit) != 0) p++;
dvander@2762	938
dvander@2762	939	return (*p == CHAR_RIGHT_CURLY_BRACKET);
dvander@2762	940	}
dvander@2762	941
dvander@2762	942
dvander@2762	943
dvander@2762	944	/*************************************************
dvander@2762	945	* Read repeat counts *
dvander@2762	946	*************************************************/
dvander@2762	947
dvander@2762	948	/* Read an item of the form {n,m} and return the values. This is called only
dvander@2762	949	after is_counted_repeat() has confirmed that a repeat-count quantifier exists,
dvander@2762	950	so the syntax is guaranteed to be correct, but we need to check the values.
dvander@2762	951
dvander@2762	952	Arguments:
dvander@2762	953	p pointer to first char after '{'
dvander@2762	954	minp pointer to int for min
dvander@2762	955	maxp pointer to int for max
dvander@2762	956	returned as -1 if no max
dvander@2762	957	errorcodeptr points to error code variable
dvander@2762	958
dvander@2762	959	Returns: pointer to '}' on success;
dvander@2762	960	current ptr on error, with errorcodeptr set non-zero
dvander@2762	961	*/
dvander@2762	962
dvander@2762	963	static const uschar *
dvander@2762	964	read_repeat_counts(const uschar p, int minp, int maxp, int errorcodeptr)
dvander@2762	965	{
dvander@2762	966	int min = 0;
dvander@2762	967	int max = -1;
dvander@2762	968
dvander@2762	969	/* Read the minimum value and do a paranoid check: a negative value indicates
dvander@2762	970	an integer overflow. */
dvander@2762	971
dvander@2762	972	while ((digitab[p] & ctype_digit) != 0) min = min 10 + *p++ - CHAR_0;
dvander@2762	973	if (min < 0 \|\| min > 65535)
dvander@2762	974	{
dvander@2762	975	*errorcodeptr = ERR5;
dvander@2762	976	return p;
dvander@2762	977	}
dvander@2762	978
dvander@2762	979	/* Read the maximum value if there is one, and again do a paranoid on its size.
dvander@2762	980	Also, max must not be less than min. */
dvander@2762	981
dvander@2762	982	if (*p == CHAR_RIGHT_CURLY_BRACKET) max = min; else
dvander@2762	983	{
dvander@2762	984	if (*(++p) != CHAR_RIGHT_CURLY_BRACKET)
dvander@2762	985	{
dvander@2762	986	max = 0;
dvander@2762	987	while((digitab[p] & ctype_digit) != 0) max = max 10 + *p++ - CHAR_0;
dvander@2762	988	if (max < 0 \|\| max > 65535)
dvander@2762	989	{
dvander@2762	990	*errorcodeptr = ERR5;
dvander@2762	991	return p;
dvander@2762	992	}
dvander@2762	993	if (max < min)
dvander@2762	994	{
dvander@2762	995	*errorcodeptr = ERR4;
dvander@2762	996	return p;
dvander@2762	997	}
dvander@2762	998	}
dvander@2762	999	}
dvander@2762	1000
dvander@2762	1001	/* Fill in the required variables, and pass back the pointer to the terminating
dvander@2762	1002	'}'. */
dvander@2762	1003
dvander@2762	1004	*minp = min;
dvander@2762	1005	*maxp = max;
dvander@2762	1006	return p;
dvander@2762	1007	}
dvander@2762	1008
dvander@2762	1009
dvander@2762	1010
dvander@2762	1011	/*************************************************
dvander@2762	1012	* Subroutine for finding forward reference *
dvander@2762	1013	*************************************************/
dvander@2762	1014
dvander@2762	1015	/* This recursive function is called only from find_parens() below. The
dvander@2762	1016	top-level call starts at the beginning of the pattern. All other calls must
dvander@2762	1017	start at a parenthesis. It scans along a pattern's text looking for capturing
dvander@2762	1018	subpatterns, and counting them. If it finds a named pattern that matches the
dvander@2762	1019	name it is given, it returns its number. Alternatively, if the name is NULL, it
dvander@2762	1020	returns when it reaches a given numbered subpattern. We know that if (?P< is
dvander@2762	1021	encountered, the name will be terminated by '>' because that is checked in the
dvander@2762	1022	first pass. Recursion is used to keep track of subpatterns that reset the
dvander@2762	1023	capturing group numbers - the (?\| feature.
dvander@2762	1024
dvander@2762	1025	Arguments:
dvander@2762	1026	ptrptr address of the current character pointer (updated)
dvander@2762	1027	cd compile background data
dvander@2762	1028	name name to seek, or NULL if seeking a numbered subpattern
dvander@2762	1029	lorn name length, or subpattern number if name is NULL
dvander@2762	1030	xmode TRUE if we are in /x mode
dvander@2762	1031	count pointer to the current capturing subpattern number (updated)
dvander@2762	1032
dvander@2762	1033	Returns: the number of the named subpattern, or -1 if not found
dvander@2762	1034	*/
dvander@2762	1035
dvander@2762	1036	static int
dvander@2762	1037	find_parens_sub(uschar *ptrptr, compile_data cd, const uschar *name, int lorn,
dvander@2762	1038	BOOL xmode, int *count)
dvander@2762	1039	{
dvander@2762	1040	uschar ptr = ptrptr;
dvander@2762	1041	int start_count = *count;
dvander@2762	1042	int hwm_count = start_count;
dvander@2762	1043	BOOL dup_parens = FALSE;
dvander@2762	1044
dvander@2762	1045	/* If the first character is a parenthesis, check on the type of group we are
dvander@2762	1046	dealing with. The very first call may not start with a parenthesis. */
dvander@2762	1047
dvander@2762	1048	if (ptr[0] == CHAR_LEFT_PARENTHESIS)
dvander@2762	1049	{
dvander@2762	1050	if (ptr[1] == CHAR_QUESTION_MARK &&
dvander@2762	1051	ptr[2] == CHAR_VERTICAL_LINE)
dvander@2762	1052	{
dvander@2762	1053	ptr += 3;
dvander@2762	1054	dup_parens = TRUE;
dvander@2762	1055	}
dvander@2762	1056
dvander@2762	1057	/* Handle a normal, unnamed capturing parenthesis */
dvander@2762	1058
dvander@2762	1059	else if (ptr[1] != CHAR_QUESTION_MARK && ptr[1] != CHAR_ASTERISK)
dvander@2762	1060	{
dvander@2762	1061	*count += 1;
dvander@2762	1062	if (name == NULL && count == lorn) return count;
dvander@2762	1063	ptr++;
dvander@2762	1064	}
dvander@2762	1065
dvander@2762	1066	/* Handle a condition. If it is an assertion, just carry on so that it
dvander@2762	1067	is processed as normal. If not, skip to the closing parenthesis of the
dvander@2762	1068	condition (there can't be any nested parens. */
dvander@2762	1069
dvander@2762	1070	else if (ptr[2] == CHAR_LEFT_PARENTHESIS)
dvander@2762	1071	{
dvander@2762	1072	ptr += 2;
dvander@2762	1073	if (ptr[1] != CHAR_QUESTION_MARK)
dvander@2762	1074	{
dvander@2762	1075	while (ptr != 0 && ptr != CHAR_RIGHT_PARENTHESIS) ptr++;
dvander@2762	1076	if (*ptr != 0) ptr++;
dvander@2762	1077	}
dvander@2762	1078	}
dvander@2762	1079
dvander@2762	1080	/* We have either (? or (* and not a condition */
dvander@2762	1081
dvander@2762	1082	else
dvander@2762	1083	{
dvander@2762	1084	ptr += 2;
dvander@2762	1085	if (ptr == CHAR_P) ptr++; / Allow optional P */
dvander@2762	1086
dvander@2762	1087	/* We have to disambiguate (?<! and (?<= from (?<name> for named groups */
dvander@2762	1088
dvander@2762	1089	if ((*ptr == CHAR_LESS_THAN_SIGN && ptr[1] != CHAR_EXCLAMATION_MARK &&
dvander@2762	1090	ptr[1] != CHAR_EQUALS_SIGN) \|\| *ptr == CHAR_APOSTROPHE)
dvander@2762	1091	{
dvander@2762	1092	int term;
dvander@2762	1093	const uschar *thisname;
dvander@2762	1094	*count += 1;
dvander@2762	1095	if (name == NULL && count == lorn) return count;
dvander@2762	1096	term = *ptr++;
dvander@2762	1097	if (term == CHAR_LESS_THAN_SIGN) term = CHAR_GREATER_THAN_SIGN;
dvander@2762	1098	thisname = ptr;
dvander@2762	1099	while (*ptr != term) ptr++;
dvander@2762	1100	if (name != NULL && lorn == ptr - thisname &&
dvander@2762	1101	strncmp((const char )name, (const char )thisname, lorn) == 0)
dvander@2762	1102	return *count;
dvander@2762	1103	}
dvander@2762	1104	}
dvander@2762	1105	}
dvander@2762	1106
dvander@2762	1107	/* Past any initial parenthesis handling, scan for parentheses or vertical
dvander@2762	1108	bars. */
dvander@2762	1109
dvander@2762	1110	for (; *ptr != 0; ptr++)
dvander@2762	1111	{
dvander@2762	1112	/* Skip over backslashed characters and also entire \Q...\E */
dvander@2762	1113
dvander@2762	1114	if (*ptr == CHAR_BACKSLASH)
dvander@2762	1115	{
dvander@2762	1116	if (*(++ptr) == 0) goto FAIL_EXIT;
dvander@2762	1117	if (*ptr == CHAR_Q) for (;;)
dvander@2762	1118	{
dvander@2762	1119	while ((++ptr) != 0 && ptr != CHAR_BACKSLASH) {};
dvander@2762	1120	if (*ptr == 0) goto FAIL_EXIT;
dvander@2762	1121	if (*(++ptr) == CHAR_E) break;
dvander@2762	1122	}
dvander@2762	1123	continue;
dvander@2762	1124	}
dvander@2762	1125
dvander@2762	1126	/* Skip over character classes; this logic must be similar to the way they
dvander@2762	1127	are handled for real. If the first character is '^', skip it. Also, if the
dvander@2762	1128	first few characters (either before or after ^) are \Q\E or \E we skip them
dvander@2762	1129	too. This makes for compatibility with Perl. Note the use of STR macros to
dvander@2762	1130	encode "Q\\E" so that it works in UTF-8 on EBCDIC platforms. */
dvander@2762	1131
dvander@2762	1132	if (*ptr == CHAR_LEFT_SQUARE_BRACKET)
dvander@2762	1133	{
dvander@2762	1134	BOOL negate_class = FALSE;
dvander@2762	1135	for (;;)
dvander@2762	1136	{
dvander@2762	1137	int c = *(++ptr);
dvander@2762	1138	if (c == CHAR_BACKSLASH)
dvander@2762	1139	{
dvander@2762	1140	if (ptr[1] == CHAR_E)
dvander@2762	1141	ptr++;
dvander@2762	1142	else if (strncmp((const char *)ptr+1,
dvander@2762	1143	STR_Q STR_BACKSLASH STR_E, 3) == 0)
dvander@2762	1144	ptr += 3;
dvander@2762	1145	else
dvander@2762	1146	break;
dvander@2762	1147	}
dvander@2762	1148	else if (!negate_class && c == CHAR_CIRCUMFLEX_ACCENT)
dvander@2762	1149	negate_class = TRUE;
dvander@2762	1150	else break;
dvander@2762	1151	}
dvander@2762	1152
dvander@2762	1153	/* If the next character is ']', it is a data character that must be
dvander@2762	1154	skipped, except in JavaScript compatibility mode. */
dvander@2762	1155
dvander@2762	1156	if (ptr[1] == CHAR_RIGHT_SQUARE_BRACKET &&
dvander@2762	1157	(cd->external_options & PCRE_JAVASCRIPT_COMPAT) == 0)
dvander@2762	1158	ptr++;
dvander@2762	1159
dvander@2762	1160	while (*(++ptr) != CHAR_RIGHT_SQUARE_BRACKET)
dvander@2762	1161	{
dvander@2762	1162	if (*ptr == 0) return -1;
dvander@2762	1163	if (*ptr == CHAR_BACKSLASH)
dvander@2762	1164	{
dvander@2762	1165	if (*(++ptr) == 0) goto FAIL_EXIT;
dvander@2762	1166	if (*ptr == CHAR_Q) for (;;)
dvander@2762	1167	{
dvander@2762	1168	while ((++ptr) != 0 && ptr != CHAR_BACKSLASH) {};
dvander@2762	1169	if (*ptr == 0) goto FAIL_EXIT;
dvander@2762	1170	if (*(++ptr) == CHAR_E) break;
dvander@2762	1171	}
dvander@2762	1172	continue;
dvander@2762	1173	}
dvander@2762	1174	}
dvander@2762	1175	continue;
dvander@2762	1176	}
dvander@2762	1177
dvander@2762	1178	/* Skip comments in /x mode */
dvander@2762	1179
dvander@2762	1180	if (xmode && *ptr == CHAR_NUMBER_SIGN)
dvander@2762	1181	{
dvander@2762	1182	while ((++ptr) != 0 && ptr != CHAR_NL) {};
dvander@2762	1183	if (*ptr == 0) goto FAIL_EXIT;
dvander@2762	1184	continue;
dvander@2762	1185	}
dvander@2762	1186
dvander@2762	1187	/* Check for the special metacharacters */
dvander@2762	1188
dvander@2762	1189	if (*ptr == CHAR_LEFT_PARENTHESIS)
dvander@2762	1190	{
dvander@2762	1191	int rc = find_parens_sub(&ptr, cd, name, lorn, xmode, count);
dvander@2762	1192	if (rc > 0) return rc;
dvander@2762	1193	if (*ptr == 0) goto FAIL_EXIT;
dvander@2762	1194	}
dvander@2762	1195
dvander@2762	1196	else if (*ptr == CHAR_RIGHT_PARENTHESIS)
dvander@2762	1197	{
dvander@2762	1198	if (dup_parens && count < hwm_count) count = hwm_count;
dvander@2762	1199	*ptrptr = ptr;
dvander@2762	1200	return -1;
dvander@2762	1201	}
dvander@2762	1202
dvander@2762	1203	else if (*ptr == CHAR_VERTICAL_LINE && dup_parens)
dvander@2762	1204	{
dvander@2762	1205	if (count > hwm_count) hwm_count = count;
dvander@2762	1206	*count = start_count;
dvander@2762	1207	}
dvander@2762	1208	}
dvander@2762	1209
dvander@2762	1210	FAIL_EXIT:
dvander@2762	1211	*ptrptr = ptr;
dvander@2762	1212	return -1;
dvander@2762	1213	}
dvander@2762	1214
dvander@2762	1215
dvander@2762	1216
dvander@2762	1217
dvander@2762	1218	/*************************************************
dvander@2762	1219	* Find forward referenced subpattern *
dvander@2762	1220	*************************************************/
dvander@2762	1221
dvander@2762	1222	/* This function scans along a pattern's text looking for capturing
dvander@2762	1223	subpatterns, and counting them. If it finds a named pattern that matches the
dvander@2762	1224	name it is given, it returns its number. Alternatively, if the name is NULL, it
dvander@2762	1225	returns when it reaches a given numbered subpattern. This is used for forward
dvander@2762	1226	references to subpatterns. We used to be able to start this scan from the
dvander@2762	1227	current compiling point, using the current count value from cd->bracount, and
dvander@2762	1228	do it all in a single loop, but the addition of the possibility of duplicate
dvander@2762	1229	subpattern numbers means that we have to scan from the very start, in order to
dvander@2762	1230	take account of such duplicates, and to use a recursive function to keep track
dvander@2762	1231	of the different types of group.
dvander@2762	1232
dvander@2762	1233	Arguments:
dvander@2762	1234	cd compile background data
dvander@2762	1235	name name to seek, or NULL if seeking a numbered subpattern
dvander@2762	1236	lorn name length, or subpattern number if name is NULL
dvander@2762	1237	xmode TRUE if we are in /x mode
dvander@2762	1238
dvander@2762	1239	Returns: the number of the found subpattern, or -1 if not found
dvander@2762	1240	*/
dvander@2762	1241
dvander@2762	1242	static int
dvander@2762	1243	find_parens(compile_data cd, const uschar name, int lorn, BOOL xmode)
dvander@2762	1244	{
dvander@2762	1245	uschar ptr = (uschar )cd->start_pattern;
dvander@2762	1246	int count = 0;
dvander@2762	1247	int rc;
dvander@2762	1248
dvander@2762	1249	/* If the pattern does not start with an opening parenthesis, the first call
dvander@2762	1250	to find_parens_sub() will scan right to the end (if necessary). However, if it
dvander@2762	1251	does start with a parenthesis, find_parens_sub() will return when it hits the
dvander@2762	1252	matching closing parens. That is why we have to have a loop. */
dvander@2762	1253
dvander@2762	1254	for (;;)
dvander@2762	1255	{
dvander@2762	1256	rc = find_parens_sub(&ptr, cd, name, lorn, xmode, &count);
dvander@2762	1257	if (rc > 0 \|\| *ptr++ == 0) break;
dvander@2762	1258	}
dvander@2762	1259
dvander@2762	1260	return rc;
dvander@2762	1261	}
dvander@2762	1262
dvander@2762	1263
dvander@2762	1264
dvander@2762	1265
dvander@2762	1266	/*************************************************
dvander@2762	1267	* Find first significant op code *
dvander@2762	1268	*************************************************/
dvander@2762	1269
dvander@2762	1270	/* This is called by several functions that scan a compiled expression looking
dvander@2762	1271	for a fixed first character, or an anchoring op code etc. It skips over things
dvander@2762	1272	that do not influence this. For some calls, a change of option is important.
dvander@2762	1273	For some calls, it makes sense to skip negative forward and all backward
dvander@2762	1274	assertions, and also the \b assertion; for others it does not.
dvander@2762	1275
dvander@2762	1276	Arguments:
dvander@2762	1277	code pointer to the start of the group
dvander@2762	1278	options pointer to external options
dvander@2762	1279	optbit the option bit whose changing is significant, or
dvander@2762	1280	zero if none are
dvander@2762	1281	skipassert TRUE if certain assertions are to be skipped
dvander@2762	1282
dvander@2762	1283	Returns: pointer to the first significant opcode
dvander@2762	1284	*/
dvander@2762	1285
dvander@2762	1286	static const uschar*
dvander@2762	1287	first_significant_code(const uschar code, int options, int optbit,
dvander@2762	1288	BOOL skipassert)
dvander@2762	1289	{
dvander@2762	1290	for (;;)
dvander@2762	1291	{
dvander@2762	1292	switch ((int)*code)
dvander@2762	1293	{
dvander@2762	1294	case OP_OPT:
dvander@2762	1295	if (optbit > 0 && ((int)code[1] & optbit) != (*options & optbit))
dvander@2762	1296	*options = (int)code[1];
dvander@2762	1297	code += 2;
dvander@2762	1298	break;
dvander@2762	1299
dvander@2762	1300	case OP_ASSERT_NOT:
dvander@2762	1301	case OP_ASSERTBACK:
dvander@2762	1302	case OP_ASSERTBACK_NOT:
dvander@2762	1303	if (!skipassert) return code;
dvander@2762	1304	do code += GET(code, 1); while (*code == OP_ALT);
dvander@2762	1305	code += _pcre_OP_lengths[*code];
dvander@2762	1306	break;
dvander@2762	1307
dvander@2762	1308	case OP_WORD_BOUNDARY:
dvander@2762	1309	case OP_NOT_WORD_BOUNDARY:
dvander@2762	1310	if (!skipassert) return code;
dvander@2762	1311	/* Fall through */
dvander@2762	1312
dvander@2762	1313	case OP_CALLOUT:
dvander@2762	1314	case OP_CREF:
dvander@2762	1315	case OP_RREF:
dvander@2762	1316	case OP_DEF:
dvander@2762	1317	code += _pcre_OP_lengths[*code];
dvander@2762	1318	break;
dvander@2762	1319
dvander@2762	1320	default:
dvander@2762	1321	return code;
dvander@2762	1322	}
dvander@2762	1323	}
dvander@2762	1324	/* Control never reaches here */
dvander@2762	1325	}
dvander@2762	1326
dvander@2762	1327
dvander@2762	1328
dvander@2762	1329
dvander@2762	1330	/*************************************************
dvander@2762	1331	* Find the fixed length of a pattern *
dvander@2762	1332	*************************************************/
dvander@2762	1333
dvander@2762	1334	/* Scan a pattern and compute the fixed length of subject that will match it,
dvander@2762	1335	if the length is fixed. This is needed for dealing with backward assertions.
dvander@2762	1336	In UTF8 mode, the result is in characters rather than bytes.
dvander@2762	1337
dvander@2762	1338	Arguments:
dvander@2762	1339	code points to the start of the pattern (the bracket)
dvander@2762	1340	options the compiling options
dvander@2762	1341
dvander@2762	1342	Returns: the fixed length, or -1 if there is no fixed length,
dvander@2762	1343	or -2 if \C was encountered
dvander@2762	1344	*/
dvander@2762	1345
dvander@2762	1346	static int
dvander@2762	1347	find_fixedlength(uschar *code, int options)
dvander@2762	1348	{
dvander@2762	1349	int length = -1;
dvander@2762	1350
dvander@2762	1351	register int branchlength = 0;
dvander@2762	1352	register uschar *cc = code + 1 + LINK_SIZE;
dvander@2762	1353
dvander@2762	1354	/* Scan along the opcodes for this branch. If we get to the end of the
dvander@2762	1355	branch, check the length against that of the other branches. */
dvander@2762	1356
dvander@2762	1357	for (;;)
dvander@2762	1358	{
dvander@2762	1359	int d;
dvander@2762	1360	register int op = *cc;
dvander@2762	1361	switch (op)
dvander@2762	1362	{
dvander@2762	1363	case OP_CBRA:
dvander@2762	1364	case OP_BRA:
dvander@2762	1365	case OP_ONCE:
dvander@2762	1366	case OP_COND:
dvander@2762	1367	d = find_fixedlength(cc + ((op == OP_CBRA)? 2:0), options);
dvander@2762	1368	if (d < 0) return d;
dvander@2762	1369	branchlength += d;
dvander@2762	1370	do cc += GET(cc, 1); while (*cc == OP_ALT);
dvander@2762	1371	cc += 1 + LINK_SIZE;
dvander@2762	1372	break;
dvander@2762	1373
dvander@2762	1374	/* Reached end of a branch; if it's a ket it is the end of a nested
dvander@2762	1375	call. If it's ALT it is an alternation in a nested call. If it is
dvander@2762	1376	END it's the end of the outer call. All can be handled by the same code. */
dvander@2762	1377
dvander@2762	1378	case OP_ALT:
dvander@2762	1379	case OP_KET:
dvander@2762	1380	case OP_KETRMAX:
dvander@2762	1381	case OP_KETRMIN:
dvander@2762	1382	case OP_END:
dvander@2762	1383	if (length < 0) length = branchlength;
dvander@2762	1384	else if (length != branchlength) return -1;
dvander@2762	1385	if (*cc != OP_ALT) return length;
dvander@2762	1386	cc += 1 + LINK_SIZE;
dvander@2762	1387	branchlength = 0;
dvander@2762	1388	break;
dvander@2762	1389
dvander@2762	1390	/* Skip over assertive subpatterns */
dvander@2762	1391
dvander@2762	1392	case OP_ASSERT:
dvander@2762	1393	case OP_ASSERT_NOT:
dvander@2762	1394	case OP_ASSERTBACK:
dvander@2762	1395	case OP_ASSERTBACK_NOT:
dvander@2762	1396	do cc += GET(cc, 1); while (*cc == OP_ALT);
dvander@2762	1397	/* Fall through */
dvander@2762	1398
dvander@2762	1399	/* Skip over things that don't match chars */
dvander@2762	1400
dvander@2762	1401	case OP_REVERSE:
dvander@2762	1402	case OP_CREF:
dvander@2762	1403	case OP_RREF:
dvander@2762	1404	case OP_DEF:
dvander@2762	1405	case OP_OPT:
dvander@2762	1406	case OP_CALLOUT:
dvander@2762	1407	case OP_SOD:
dvander@2762	1408	case OP_SOM:
dvander@2762	1409	case OP_EOD:
dvander@2762	1410	case OP_EODN:
dvander@2762	1411	case OP_CIRC:
dvander@2762	1412	case OP_DOLL:
dvander@2762	1413	case OP_NOT_WORD_BOUNDARY:
dvander@2762	1414	case OP_WORD_BOUNDARY:
dvander@2762	1415	cc += _pcre_OP_lengths[*cc];
dvander@2762	1416	break;
dvander@2762	1417
dvander@2762	1418	/* Handle literal characters */
dvander@2762	1419
dvander@2762	1420	case OP_CHAR:
dvander@2762	1421	case OP_CHARNC:
dvander@2762	1422	case OP_NOT:
dvander@2762	1423	branchlength++;
dvander@2762	1424	cc += 2;
dvander@2762	1425	#ifdef SUPPORT_UTF8
dvander@2762	1426	if ((options & PCRE_UTF8) != 0)
dvander@2762	1427	{
dvander@2762	1428	while ((*cc & 0xc0) == 0x80) cc++;
dvander@2762	1429	}
dvander@2762	1430	#endif
dvander@2762	1431	break;
dvander@2762	1432
dvander@2762	1433	/* Handle exact repetitions. The count is already in characters, but we
dvander@2762	1434	need to skip over a multibyte character in UTF8 mode. */
dvander@2762	1435
dvander@2762	1436	case OP_EXACT:
dvander@2762	1437	branchlength += GET2(cc,1);
dvander@2762	1438	cc += 4;
dvander@2762	1439	#ifdef SUPPORT_UTF8
dvander@2762	1440	if ((options & PCRE_UTF8) != 0)
dvander@2762	1441	{
dvander@2762	1442	while((*cc & 0x80) == 0x80) cc++;
dvander@2762	1443	}
dvander@2762	1444	#endif
dvander@2762	1445	break;
dvander@2762	1446
dvander@2762	1447	case OP_TYPEEXACT:
dvander@2762	1448	branchlength += GET2(cc,1);
dvander@2762	1449	if (cc[3] == OP_PROP \|\| cc[3] == OP_NOTPROP) cc += 2;
dvander@2762	1450	cc += 4;
dvander@2762	1451	break;
dvander@2762	1452
dvander@2762	1453	/* Handle single-char matchers */
dvander@2762	1454
dvander@2762	1455	case OP_PROP:
dvander@2762	1456	case OP_NOTPROP:
dvander@2762	1457	cc += 2;
dvander@2762	1458	/* Fall through */
dvander@2762	1459
dvander@2762	1460	case OP_NOT_DIGIT:
dvander@2762	1461	case OP_DIGIT:
dvander@2762	1462	case OP_NOT_WHITESPACE:
dvander@2762	1463	case OP_WHITESPACE:
dvander@2762	1464	case OP_NOT_WORDCHAR:
dvander@2762	1465	case OP_WORDCHAR:
dvander@2762	1466	case OP_ANY:
dvander@2762	1467	case OP_ALLANY:
dvander@2762	1468	branchlength++;
dvander@2762	1469	cc++;
dvander@2762	1470	break;
dvander@2762	1471
dvander@2762	1472	/* The single-byte matcher isn't allowed */
dvander@2762	1473
dvander@2762	1474	case OP_ANYBYTE:
dvander@2762	1475	return -2;
dvander@2762	1476
dvander@2762	1477	/* Check a class for variable quantification */
dvander@2762	1478
dvander@2762	1479	#ifdef SUPPORT_UTF8
dvander@2762	1480	case OP_XCLASS:
dvander@2762	1481	cc += GET(cc, 1) - 33;
dvander@2762	1482	/* Fall through */
dvander@2762	1483	#endif
dvander@2762	1484
dvander@2762	1485	case OP_CLASS:
dvander@2762	1486	case OP_NCLASS:
dvander@2762	1487	cc += 33;
dvander@2762	1488
dvander@2762	1489	switch (*cc)
dvander@2762	1490	{
dvander@2762	1491	case OP_CRSTAR:
dvander@2762	1492	case OP_CRMINSTAR:
dvander@2762	1493	case OP_CRQUERY:
dvander@2762	1494	case OP_CRMINQUERY:
dvander@2762	1495	return -1;
dvander@2762	1496
dvander@2762	1497	case OP_CRRANGE:
dvander@2762	1498	case OP_CRMINRANGE:
dvander@2762	1499	if (GET2(cc,1) != GET2(cc,3)) return -1;
dvander@2762	1500	branchlength += GET2(cc,1);
dvander@2762	1501	cc += 5;
dvander@2762	1502	break;
dvander@2762	1503
dvander@2762	1504	default:
dvander@2762	1505	branchlength++;
dvander@2762	1506	}
dvander@2762	1507	break;
dvander@2762	1508
dvander@2762	1509	/* Anything else is variable length */
dvander@2762	1510
dvander@2762	1511	default:
dvander@2762	1512	return -1;
dvander@2762	1513	}
dvander@2762	1514	}
dvander@2762	1515	/* Control never gets here */
dvander@2762	1516	}
dvander@2762	1517
dvander@2762	1518
dvander@2762	1519
dvander@2762	1520
dvander@2762	1521	/*************************************************
dvander@2762	1522	* Scan compiled regex for numbered bracket *
dvander@2762	1523	*************************************************/
dvander@2762	1524
dvander@2762	1525	/* This little function scans through a compiled pattern until it finds a
dvander@2762	1526	capturing bracket with the given number.
dvander@2762	1527
dvander@2762	1528	Arguments:
dvander@2762	1529	code points to start of expression
dvander@2762	1530	utf8 TRUE in UTF-8 mode
dvander@2762	1531	number the required bracket number
dvander@2762	1532
dvander@2762	1533	Returns: pointer to the opcode for the bracket, or NULL if not found
dvander@2762	1534	*/
dvander@2762	1535
dvander@2762	1536	static const uschar *
dvander@2762	1537	find_bracket(const uschar *code, BOOL utf8, int number)
dvander@2762	1538	{
dvander@2762	1539	for (;;)
dvander@2762	1540	{
dvander@2762	1541	register int c = *code;
dvander@2762	1542	if (c == OP_END) return NULL;
dvander@2762	1543
dvander@2762	1544	/* XCLASS is used for classes that cannot be represented just by a bit
dvander@2762	1545	map. This includes negated single high-valued characters. The length in
dvander@2762	1546	the table is zero; the actual length is stored in the compiled code. */
dvander@2762	1547
dvander@2762	1548	if (c == OP_XCLASS) code += GET(code, 1);
dvander@2762	1549
dvander@2762	1550	/* Handle capturing bracket */
dvander@2762	1551
dvander@2762	1552	else if (c == OP_CBRA)
dvander@2762	1553	{
dvander@2762	1554	int n = GET2(code, 1+LINK_SIZE);
dvander@2762	1555	if (n == number) return (uschar *)code;
dvander@2762	1556	code += _pcre_OP_lengths[c];
dvander@2762	1557	}
dvander@2762	1558
dvander@2762	1559	/* Otherwise, we can get the item's length from the table, except that for
dvander@2762	1560	repeated character types, we have to test for \p and \P, which have an extra
dvander@2762	1561	two bytes of parameters. */
dvander@2762	1562
dvander@2762	1563	else
dvander@2762	1564	{
dvander@2762	1565	switch(c)
dvander@2762	1566	{
dvander@2762	1567	case OP_TYPESTAR:
dvander@2762	1568	case OP_TYPEMINSTAR:
dvander@2762	1569	case OP_TYPEPLUS:
dvander@2762	1570	case OP_TYPEMINPLUS:
dvander@2762	1571	case OP_TYPEQUERY:
dvander@2762	1572	case OP_TYPEMINQUERY:
dvander@2762	1573	case OP_TYPEPOSSTAR:
dvander@2762	1574	case OP_TYPEPOSPLUS:
dvander@2762	1575	case OP_TYPEPOSQUERY:
dvander@2762	1576	if (code[1] == OP_PROP \|\| code[1] == OP_NOTPROP) code += 2;
dvander@2762	1577	break;
dvander@2762	1578
dvander@2762	1579	case OP_TYPEUPTO:
dvander@2762	1580	case OP_TYPEMINUPTO:
dvander@2762	1581	case OP_TYPEEXACT:
dvander@2762	1582	case OP_TYPEPOSUPTO:
dvander@2762	1583	if (code[3] == OP_PROP \|\| code[3] == OP_NOTPROP) code += 2;
dvander@2762	1584	break;
dvander@2762	1585	}
dvander@2762	1586
dvander@2762	1587	/* Add in the fixed length from the table */
dvander@2762	1588
dvander@2762	1589	code += _pcre_OP_lengths[c];
dvander@2762	1590
dvander@2762	1591	/* In UTF-8 mode, opcodes that are followed by a character may be followed by
dvander@2762	1592	a multi-byte character. The length in the table is a minimum, so we have to
dvander@2762	1593	arrange to skip the extra bytes. */
dvander@2762	1594
dvander@2762	1595	#ifdef SUPPORT_UTF8
dvander@2762	1596	if (utf8) switch(c)
dvander@2762	1597	{
dvander@2762	1598	case OP_CHAR:
dvander@2762	1599	case OP_CHARNC:
dvander@2762	1600	case OP_EXACT:
dvander@2762	1601	case OP_UPTO:
dvander@2762	1602	case OP_MINUPTO:
dvander@2762	1603	case OP_POSUPTO:
dvander@2762	1604	case OP_STAR:
dvander@2762	1605	case OP_MINSTAR:
dvander@2762	1606	case OP_POSSTAR:
dvander@2762	1607	case OP_PLUS:
dvander@2762	1608	case OP_MINPLUS:
dvander@2762	1609	case OP_POSPLUS:
dvander@2762	1610	case OP_QUERY:
dvander@2762	1611	case OP_MINQUERY:
dvander@2762	1612	case OP_POSQUERY:
dvander@2762	1613	if (code[-1] >= 0xc0) code += _pcre_utf8_table4[code[-1] & 0x3f];
dvander@2762	1614	break;
dvander@2762	1615	}
dvander@2762	1616	#else
dvander@2762	1617	(void)(utf8); /* Keep compiler happy by referencing function argument */
dvander@2762	1618	#endif
dvander@2762	1619	}
dvander@2762	1620	}
dvander@2762	1621	}
dvander@2762	1622
dvander@2762	1623
dvander@2762	1624
dvander@2762	1625	/*************************************************
dvander@2762	1626	* Scan compiled regex for recursion reference *
dvander@2762	1627	*************************************************/
dvander@2762	1628
dvander@2762	1629	/* This little function scans through a compiled pattern until it finds an
dvander@2762	1630	instance of OP_RECURSE.
dvander@2762	1631
dvander@2762	1632	Arguments:
dvander@2762	1633	code points to start of expression
dvander@2762	1634	utf8 TRUE in UTF-8 mode
dvander@2762	1635
dvander@2762	1636	Returns: pointer to the opcode for OP_RECURSE, or NULL if not found
dvander@2762	1637	*/
dvander@2762	1638
dvander@2762	1639	static const uschar *
dvander@2762	1640	find_recurse(const uschar *code, BOOL utf8)
dvander@2762	1641	{
dvander@2762	1642	for (;;)
dvander@2762	1643	{
dvander@2762	1644	register int c = *code;
dvander@2762	1645	if (c == OP_END) return NULL;
dvander@2762	1646	if (c == OP_RECURSE) return code;
dvander@2762	1647
dvander@2762	1648	/* XCLASS is used for classes that cannot be represented just by a bit
dvander@2762	1649	map. This includes negated single high-valued characters. The length in
dvander@2762	1650	the table is zero; the actual length is stored in the compiled code. */
dvander@2762	1651
dvander@2762	1652	if (c == OP_XCLASS) code += GET(code, 1);
dvander@2762	1653
dvander@2762	1654	/* Otherwise, we can get the item's length from the table, except that for
dvander@2762	1655	repeated character types, we have to test for \p and \P, which have an extra
dvander@2762	1656	two bytes of parameters. */
dvander@2762	1657
dvander@2762	1658	else
dvander@2762	1659	{
dvander@2762	1660	switch(c)
dvander@2762	1661	{
dvander@2762	1662	case OP_TYPESTAR:
dvander@2762	1663	case OP_TYPEMINSTAR:
dvander@2762	1664	case OP_TYPEPLUS:
dvander@2762	1665	case OP_TYPEMINPLUS:
dvander@2762	1666	case OP_TYPEQUERY:
dvander@2762	1667	case OP_TYPEMINQUERY:
dvander@2762	1668	case OP_TYPEPOSSTAR:
dvander@2762	1669	case OP_TYPEPOSPLUS:
dvander@2762	1670	case OP_TYPEPOSQUERY:
dvander@2762	1671	if (code[1] == OP_PROP \|\| code[1] == OP_NOTPROP) code += 2;
dvander@2762	1672	break;
dvander@2762	1673
dvander@2762	1674	case OP_TYPEPOSUPTO:
dvander@2762	1675	case OP_TYPEUPTO:
dvander@2762	1676	case OP_TYPEMINUPTO:
dvander@2762	1677	case OP_TYPEEXACT:
dvander@2762	1678	if (code[3] == OP_PROP \|\| code[3] == OP_NOTPROP) code += 2;
dvander@2762	1679	break;
dvander@2762	1680	}
dvander@2762	1681
dvander@2762	1682	/* Add in the fixed length from the table */
dvander@2762	1683
dvander@2762	1684	code += _pcre_OP_lengths[c];
dvander@2762	1685
dvander@2762	1686	/* In UTF-8 mode, opcodes that are followed by a character may be followed
dvander@2762	1687	by a multi-byte character. The length in the table is a minimum, so we have
dvander@2762	1688	to arrange to skip the extra bytes. */
dvander@2762	1689
dvander@2762	1690	#ifdef SUPPORT_UTF8
dvander@2762	1691	if (utf8) switch(c)
dvander@2762	1692	{
dvander@2762	1693	case OP_CHAR:
dvander@2762	1694	case OP_CHARNC:
dvander@2762	1695	case OP_EXACT:
dvander@2762	1696	case OP_UPTO:
dvander@2762	1697	case OP_MINUPTO:
dvander@2762	1698	case OP_POSUPTO:
dvander@2762	1699	case OP_STAR:
dvander@2762	1700	case OP_MINSTAR:
dvander@2762	1701	case OP_POSSTAR:
dvander@2762	1702	case OP_PLUS:
dvander@2762	1703	case OP_MINPLUS:
dvander@2762	1704	case OP_POSPLUS:
dvander@2762	1705	case OP_QUERY:
dvander@2762	1706	case OP_MINQUERY:
dvander@2762	1707	case OP_POSQUERY:
dvander@2762	1708	if (code[-1] >= 0xc0) code += _pcre_utf8_table4[code[-1] & 0x3f];
dvander@2762	1709	break;
dvander@2762	1710	}
dvander@2762	1711	#else
dvander@2762	1712	(void)(utf8); /* Keep compiler happy by referencing function argument */
dvander@2762	1713	#endif
dvander@2762	1714	}
dvander@2762	1715	}
dvander@2762	1716	}
dvander@2762	1717
dvander@2762	1718
dvander@2762	1719
dvander@2762	1720	/*************************************************
dvander@2762	1721	* Scan compiled branch for non-emptiness *
dvander@2762	1722	*************************************************/
dvander@2762	1723
dvander@2762	1724	/* This function scans through a branch of a compiled pattern to see whether it
dvander@2762	1725	can match the empty string or not. It is called from could_be_empty()
dvander@2762	1726	below and from compile_branch() when checking for an unlimited repeat of a
dvander@2762	1727	group that can match nothing. Note that first_significant_code() skips over
dvander@2762	1728	backward and negative forward assertions when its final argument is TRUE. If we
dvander@2762	1729	hit an unclosed bracket, we return "empty" - this means we've struck an inner
dvander@2762	1730	bracket whose current branch will already have been scanned.
dvander@2762	1731
dvander@2762	1732	Arguments:
dvander@2762	1733	code points to start of search
dvander@2762	1734	endcode points to where to stop
dvander@2762	1735	utf8 TRUE if in UTF8 mode
dvander@2762	1736
dvander@2762	1737	Returns: TRUE if what is matched could be empty
dvander@2762	1738	*/
dvander@2762	1739
dvander@2762	1740	static BOOL
dvander@2762	1741	could_be_empty_branch(const uschar code, const uschar endcode, BOOL utf8)
dvander@2762	1742	{
dvander@2762	1743	register int c;
dvander@2762	1744	for (code = first_significant_code(code + _pcre_OP_lengths[*code], NULL, 0, TRUE);
dvander@2762	1745	code < endcode;
dvander@2762	1746	code = first_significant_code(code + _pcre_OP_lengths[c], NULL, 0, TRUE))
dvander@2762	1747	{
dvander@2762	1748	const uschar *ccode;
dvander@2762	1749
dvander@2762	1750	c = *code;
dvander@2762	1751
dvander@2762	1752	/* Skip over forward assertions; the other assertions are skipped by
dvander@2762	1753	first_significant_code() with a TRUE final argument. */
dvander@2762	1754
dvander@2762	1755	if (c == OP_ASSERT)
dvander@2762	1756	{
dvander@2762	1757	do code += GET(code, 1); while (*code == OP_ALT);
dvander@2762	1758	c = *code;
dvander@2762	1759	continue;
dvander@2762	1760	}
dvander@2762	1761
dvander@2762	1762	/* Groups with zero repeats can of course be empty; skip them. */
dvander@2762	1763
dvander@2762	1764	if (c == OP_BRAZERO \|\| c == OP_BRAMINZERO \|\| c == OP_SKIPZERO)
dvander@2762	1765	{
dvander@2762	1766	code += _pcre_OP_lengths[c];
dvander@2762	1767	do code += GET(code, 1); while (*code == OP_ALT);
dvander@2762	1768	c = *code;
dvander@2762	1769	continue;
dvander@2762	1770	}
dvander@2762	1771
dvander@2762	1772	/* For other groups, scan the branches. */
dvander@2762	1773
dvander@2762	1774	if (c == OP_BRA \|\| c == OP_CBRA \|\| c == OP_ONCE \|\| c == OP_COND)
dvander@2762	1775	{
dvander@2762	1776	BOOL empty_branch;
dvander@2762	1777	if (GET(code, 1) == 0) return TRUE; /* Hit unclosed bracket */
dvander@2762	1778
dvander@2762	1779	/* If a conditional group has only one branch, there is a second, implied,
dvander@2762	1780	empty branch, so just skip over the conditional, because it could be empty.
dvander@2762	1781	Otherwise, scan the individual branches of the group. */
dvander@2762	1782
dvander@2762	1783	if (c == OP_COND && code[GET(code, 1)] != OP_ALT)
dvander@2762	1784	code += GET(code, 1);
dvander@2762	1785	else
dvander@2762	1786	{
dvander@2762	1787	empty_branch = FALSE;
dvander@2762	1788	do
dvander@2762	1789	{
dvander@2762	1790	if (!empty_branch && could_be_empty_branch(code, endcode, utf8))
dvander@2762	1791	empty_branch = TRUE;
dvander@2762	1792	code += GET(code, 1);
dvander@2762	1793	}
dvander@2762	1794	while (*code == OP_ALT);
dvander@2762	1795	if (!empty_branch) return FALSE; /* All branches are non-empty */
dvander@2762	1796	}
dvander@2762	1797
dvander@2762	1798	c = *code;
dvander@2762	1799	continue;
dvander@2762	1800	}
dvander@2762	1801
dvander@2762	1802	/* Handle the other opcodes */
dvander@2762	1803
dvander@2762	1804	switch (c)
dvander@2762	1805	{
dvander@2762	1806	/* Check for quantifiers after a class. XCLASS is used for classes that
dvander@2762	1807	cannot be represented just by a bit map. This includes negated single
dvander@2762	1808	high-valued characters. The length in _pcre_OP_lengths[] is zero; the
dvander@2762	1809	actual length is stored in the compiled code, so we must update "code"
dvander@2762	1810	here. */
dvander@2762	1811
dvander@2762	1812	#ifdef SUPPORT_UTF8
dvander@2762	1813	case OP_XCLASS:
dvander@2762	1814	ccode = code += GET(code, 1);
dvander@2762	1815	goto CHECK_CLASS_REPEAT;
dvander@2762	1816	#endif
dvander@2762	1817
dvander@2762	1818	case OP_CLASS:
dvander@2762	1819	case OP_NCLASS:
dvander@2762	1820	ccode = code + 33;
dvander@2762	1821
dvander@2762	1822	#ifdef SUPPORT_UTF8
dvander@2762	1823	CHECK_CLASS_REPEAT:
dvander@2762	1824	#endif
dvander@2762	1825
dvander@2762	1826	switch (*ccode)
dvander@2762	1827	{
dvander@2762	1828	case OP_CRSTAR: /* These could be empty; continue */
dvander@2762	1829	case OP_CRMINSTAR:
dvander@2762	1830	case OP_CRQUERY:
dvander@2762	1831	case OP_CRMINQUERY:
dvander@2762	1832	break;
dvander@2762	1833
dvander@2762	1834	default: /* Non-repeat => class must match */
dvander@2762	1835	case OP_CRPLUS: /* These repeats aren't empty */
dvander@2762	1836	case OP_CRMINPLUS:
dvander@2762	1837	return FALSE;
dvander@2762	1838
dvander@2762	1839	case OP_CRRANGE:
dvander@2762	1840	case OP_CRMINRANGE:
dvander@2762	1841	if (GET2(ccode, 1) > 0) return FALSE; /* Minimum > 0 */
dvander@2762	1842	break;
dvander@2762	1843	}
dvander@2762	1844	break;
dvander@2762	1845
dvander@2762	1846	/* Opcodes that must match a character */
dvander@2762	1847
dvander@2762	1848	case OP_PROP:
dvander@2762	1849	case OP_NOTPROP:
dvander@2762	1850	case OP_EXTUNI:
dvander@2762	1851	case OP_NOT_DIGIT:
dvander@2762	1852	case OP_DIGIT:
dvander@2762	1853	case OP_NOT_WHITESPACE:
dvander@2762	1854	case OP_WHITESPACE:
dvander@2762	1855	case OP_NOT_WORDCHAR:
dvander@2762	1856	case OP_WORDCHAR:
dvander@2762	1857	case OP_ANY:
dvander@2762	1858	case OP_ALLANY:
dvander@2762	1859	case OP_ANYBYTE:
dvander@2762	1860	case OP_CHAR:
dvander@2762	1861	case OP_CHARNC:
dvander@2762	1862	case OP_NOT:
dvander@2762	1863	case OP_PLUS:
dvander@2762	1864	case OP_MINPLUS:
dvander@2762	1865	case OP_POSPLUS:
dvander@2762	1866	case OP_EXACT:
dvander@2762	1867	case OP_NOTPLUS:
dvander@2762	1868	case OP_NOTMINPLUS:
dvander@2762	1869	case OP_NOTPOSPLUS:
dvander@2762	1870	case OP_NOTEXACT:
dvander@2762	1871	case OP_TYPEPLUS:
dvander@2762	1872	case OP_TYPEMINPLUS:
dvander@2762	1873	case OP_TYPEPOSPLUS:
dvander@2762	1874	case OP_TYPEEXACT:
dvander@2762	1875	return FALSE;
dvander@2762	1876
dvander@2762	1877	/* These are going to continue, as they may be empty, but we have to
dvander@2762	1878	fudge the length for the \p and \P cases. */
dvander@2762	1879
dvander@2762	1880	case OP_TYPESTAR:
dvander@2762	1881	case OP_TYPEMINSTAR:
dvander@2762	1882	case OP_TYPEPOSSTAR:
dvander@2762	1883	case OP_TYPEQUERY:
dvander@2762	1884	case OP_TYPEMINQUERY:
dvander@2762	1885	case OP_TYPEPOSQUERY:
dvander@2762	1886	if (code[1] == OP_PROP \|\| code[1] == OP_NOTPROP) code += 2;
dvander@2762	1887	break;
dvander@2762	1888
dvander@2762	1889	/* Same for these */
dvander@2762	1890
dvander@2762	1891	case OP_TYPEUPTO:
dvander@2762	1892	case OP_TYPEMINUPTO:
dvander@2762	1893	case OP_TYPEPOSUPTO:
dvander@2762	1894	if (code[3] == OP_PROP \|\| code[3] == OP_NOTPROP) code += 2;
dvander@2762	1895	break;
dvander@2762	1896
dvander@2762	1897	/* End of branch */
dvander@2762	1898
dvander@2762	1899	case OP_KET:
dvander@2762	1900	case OP_KETRMAX:
dvander@2762	1901	case OP_KETRMIN:
dvander@2762	1902	case OP_ALT:
dvander@2762	1903	return TRUE;
dvander@2762	1904
dvander@2762	1905	/* In UTF-8 mode, STAR, MINSTAR, POSSTAR, QUERY, MINQUERY, POSQUERY, UPTO,
dvander@2762	1906	MINUPTO, and POSUPTO may be followed by a multibyte character */
dvander@2762	1907
dvander@2762	1908	#ifdef SUPPORT_UTF8
dvander@2762	1909	case OP_STAR:
dvander@2762	1910	case OP_MINSTAR:
dvander@2762	1911	case OP_POSSTAR:
dvander@2762	1912	case OP_QUERY:
dvander@2762	1913	case OP_MINQUERY:
dvander@2762	1914	case OP_POSQUERY:
dvander@2762	1915	case OP_UPTO:
dvander@2762	1916	case OP_MINUPTO:
dvander@2762	1917	case OP_POSUPTO:
dvander@2762	1918	if (utf8) while ((code[2] & 0xc0) == 0x80) code++;
dvander@2762	1919	break;
dvander@2762	1920	#endif
dvander@2762	1921	}
dvander@2762	1922	}
dvander@2762	1923
dvander@2762	1924	return TRUE;
dvander@2762	1925	}
dvander@2762	1926
dvander@2762	1927
dvander@2762	1928
dvander@2762	1929	/*************************************************
dvander@2762	1930	* Scan compiled regex for non-emptiness *
dvander@2762	1931	*************************************************/
dvander@2762	1932
dvander@2762	1933	/* This function is called to check for left recursive calls. We want to check
dvander@2762	1934	the current branch of the current pattern to see if it could match the empty
dvander@2762	1935	string. If it could, we must look outwards for branches at other levels,
dvander@2762	1936	stopping when we pass beyond the bracket which is the subject of the recursion.
dvander@2762	1937
dvander@2762	1938	Arguments:
dvander@2762	1939	code points to start of the recursion
dvander@2762	1940	endcode points to where to stop (current RECURSE item)
dvander@2762	1941	bcptr points to the chain of current (unclosed) branch starts
dvander@2762	1942	utf8 TRUE if in UTF-8 mode
dvander@2762	1943
dvander@2762	1944	Returns: TRUE if what is matched could be empty
dvander@2762	1945	*/
dvander@2762	1946
dvander@2762	1947	static BOOL
dvander@2762	1948	could_be_empty(const uschar code, const uschar endcode, branch_chain *bcptr,
dvander@2762	1949	BOOL utf8)
dvander@2762	1950	{
dvander@2762	1951	while (bcptr != NULL && bcptr->current >= code)
dvander@2762	1952	{
dvander@2762	1953	if (!could_be_empty_branch(bcptr->current, endcode, utf8)) return FALSE;
dvander@2762	1954	bcptr = bcptr->outer;
dvander@2762	1955	}
dvander@2762	1956	return TRUE;
dvander@2762	1957	}
dvander@2762	1958
dvander@2762	1959
dvander@2762	1960
dvander@2762	1961	/*************************************************
dvander@2762	1962	* Check for POSIX class syntax *
dvander@2762	1963	*************************************************/
dvander@2762	1964
dvander@2762	1965	/* This function is called when the sequence "[:" or "[." or "[=" is
dvander@2762	1966	encountered in a character class. It checks whether this is followed by a
dvander@2762	1967	sequence of characters terminated by a matching ":]" or ".]" or "=]". If we
dvander@2762	1968	reach an unescaped ']' without the special preceding character, return FALSE.
dvander@2762	1969
dvander@2762	1970	Originally, this function only recognized a sequence of letters between the
dvander@2762	1971	terminators, but it seems that Perl recognizes any sequence of characters,
dvander@2762	1972	though of course unknown POSIX names are subsequently rejected. Perl gives an
dvander@2762	1973	"Unknown POSIX class" error for [:f\oo:] for example, where previously PCRE
dvander@2762	1974	didn't consider this to be a POSIX class. Likewise for [:1234:].
dvander@2762	1975
dvander@2762	1976	The problem in trying to be exactly like Perl is in the handling of escapes. We
dvander@2762	1977	have to be sure that [abc[:x\]pqr] is not treated as containing a POSIX
dvander@2762	1978	class, but [abc[:x\]pqr:]] is (so that an error can be generated). The code
dvander@2762	1979	below handles the special case of \], but does not try to do any other escape
dvander@2762	1980	processing. This makes it different from Perl for cases such as [:l\ower:]
dvander@2762	1981	where Perl recognizes it as the POSIX class "lower" but PCRE does not recognize
dvander@2762	1982	"l\ower". This is a lesser evil that not diagnosing bad classes when Perl does,
dvander@2762	1983	I think.
dvander@2762	1984
dvander@2762	1985	Arguments:
dvander@2762	1986	ptr pointer to the initial [
dvander@2762	1987	endptr where to return the end pointer
dvander@2762	1988
dvander@2762	1989	Returns: TRUE or FALSE
dvander@2762	1990	*/
dvander@2762	1991
dvander@2762	1992	static BOOL
dvander@2762	1993	check_posix_syntax(const uschar ptr, const uschar *endptr)
dvander@2762	1994	{
dvander@2762	1995	int terminator; /* Don't combine these lines; the Solaris cc */
dvander@2762	1996	terminator = (++ptr); / compiler warns about "non-constant" initializer. */
dvander@2762	1997	for (++ptr; *ptr != 0; ptr++)
dvander@2762	1998	{
dvander@2762	1999	if (*ptr == CHAR_BACKSLASH && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET) ptr++; else
dvander@2762	2000	{
dvander@2762	2001	if (*ptr == CHAR_RIGHT_SQUARE_BRACKET) return FALSE;
dvander@2762	2002	if (*ptr == terminator && ptr[1] == CHAR_RIGHT_SQUARE_BRACKET)
dvander@2762	2003	{
dvander@2762	2004	*endptr = ptr;
dvander@2762	2005	return TRUE;
dvander@2762	2006	}
dvander@2762	2007	}
dvander@2762	2008	}
dvander@2762	2009	return FALSE;
dvander@2762	2010	}
dvander@2762	2011
dvander@2762	2012
dvander@2762	2013
dvander@2762	2014
dvander@2762	2015	/*************************************************
dvander@2762	2016	* Check POSIX class name *
dvander@2762	2017	*************************************************/
dvander@2762	2018
dvander@2762	2019	/* This function is called to check the name given in a POSIX-style class entry
dvander@2762	2020	such as [:alnum:].
dvander@2762	2021
dvander@2762	2022	Arguments:
dvander@2762	2023	ptr points to the first letter
dvander@2762	2024	len the length of the name
dvander@2762	2025
dvander@2762	2026	Returns: a value representing the name, or -1 if unknown
dvander@2762	2027	*/
dvander@2762	2028
dvander@2762	2029	static int
dvander@2762	2030	check_posix_name(const uschar *ptr, int len)
dvander@2762	2031	{
dvander@2762	2032	const char *pn = posix_names;
dvander@2762	2033	register int yield = 0;
dvander@2762	2034	while (posix_name_lengths[yield] != 0)
dvander@2762	2035	{
dvander@2762	2036	if (len == posix_name_lengths[yield] &&
dvander@2762	2037	strncmp((const char *)ptr, pn, len) == 0) return yield;
dvander@2762	2038	pn += posix_name_lengths[yield] + 1;
dvander@2762	2039	yield++;
dvander@2762	2040	}
dvander@2762	2041	return -1;
dvander@2762	2042	}
dvander@2762	2043
dvander@2762	2044
dvander@2762	2045	/*************************************************
dvander@2762	2046	* Adjust OP_RECURSE items in repeated group *
dvander@2762	2047	*************************************************/
dvander@2762	2048
dvander@2762	2049	/* OP_RECURSE items contain an offset from the start of the regex to the group
dvander@2762	2050	that is referenced. This means that groups can be replicated for fixed
dvander@2762	2051	repetition simply by copying (because the recursion is allowed to refer to
dvander@2762	2052	earlier groups that are outside the current group). However, when a group is
dvander@2762	2053	optional (i.e. the minimum quantifier is zero), OP_BRAZERO or OP_SKIPZERO is
dvander@2762	2054	inserted before it, after it has been compiled. This means that any OP_RECURSE
dvander@2762	2055	items within it that refer to the group itself or any contained groups have to
dvander@2762	2056	have their offsets adjusted. That one of the jobs of this function. Before it
dvander@2762	2057	is called, the partially compiled regex must be temporarily terminated with
dvander@2762	2058	OP_END.
dvander@2762	2059
dvander@2762	2060	This function has been extended with the possibility of forward references for
dvander@2762	2061	recursions and subroutine calls. It must also check the list of such references
dvander@2762	2062	for the group we are dealing with. If it finds that one of the recursions in
dvander@2762	2063	the current group is on this list, it adjusts the offset in the list, not the
dvander@2762	2064	value in the reference (which is a group number).
dvander@2762	2065
dvander@2762	2066	Arguments:
dvander@2762	2067	group points to the start of the group
dvander@2762	2068	adjust the amount by which the group is to be moved
dvander@2762	2069	utf8 TRUE in UTF-8 mode
dvander@2762	2070	cd contains pointers to tables etc.
dvander@2762	2071	save_hwm the hwm forward reference pointer at the start of the group
dvander@2762	2072
dvander@2762	2073	Returns: nothing
dvander@2762	2074	*/
dvander@2762	2075
dvander@2762	2076	static void
dvander@2762	2077	adjust_recurse(uschar group, int adjust, BOOL utf8, compile_data cd,
dvander@2762	2078	uschar *save_hwm)
dvander@2762	2079	{
dvander@2762	2080	uschar *ptr = group;
dvander@2762	2081
dvander@2762	2082	while ((ptr = (uschar *)find_recurse(ptr, utf8)) != NULL)
dvander@2762	2083	{
dvander@2762	2084	int offset;
dvander@2762	2085	uschar *hc;
dvander@2762	2086
dvander@2762	2087	/* See if this recursion is on the forward reference list. If so, adjust the
dvander@2762	2088	reference. */
dvander@2762	2089
dvander@2762	2090	for (hc = save_hwm; hc < cd->hwm; hc += LINK_SIZE)
dvander@2762	2091	{
dvander@2762	2092	offset = GET(hc, 0);
dvander@2762	2093	if (cd->start_code + offset == ptr + 1)
dvander@2762	2094	{
dvander@2762	2095	PUT(hc, 0, offset + adjust);
dvander@2762	2096	break;
dvander@2762	2097	}
dvander@2762	2098	}
dvander@2762	2099
dvander@2762	2100	/* Otherwise, adjust the recursion offset if it's after the start of this
dvander@2762	2101	group. */
dvander@2762	2102
dvander@2762	2103	if (hc >= cd->hwm)
dvander@2762	2104	{
dvander@2762	2105	offset = GET(ptr, 1);
dvander@2762	2106	if (cd->start_code + offset >= group) PUT(ptr, 1, offset + adjust);
dvander@2762	2107	}
dvander@2762	2108
dvander@2762	2109	ptr += 1 + LINK_SIZE;
dvander@2762	2110	}
dvander@2762	2111	}
dvander@2762	2112
dvander@2762	2113
dvander@2762	2114
dvander@2762	2115	/*************************************************
dvander@2762	2116	* Insert an automatic callout point *
dvander@2762	2117	*************************************************/
dvander@2762	2118
dvander@2762	2119	/* This function is called when the PCRE_AUTO_CALLOUT option is set, to insert
dvander@2762	2120	callout points before each pattern item.
dvander@2762	2121
dvander@2762	2122	Arguments:
dvander@2762	2123	code current code pointer
dvander@2762	2124	ptr current pattern pointer
dvander@2762	2125	cd pointers to tables etc
dvander@2762	2126
dvander@2762	2127	Returns: new code pointer
dvander@2762	2128	*/
dvander@2762	2129
dvander@2762	2130	static uschar *
dvander@2762	2131	auto_callout(uschar code, const uschar ptr, compile_data *cd)
dvander@2762	2132	{
dvander@2762	2133	*code++ = OP_CALLOUT;
dvander@2762	2134	*code++ = 255;
dvander@2762	2135	PUT(code, 0, ptr - cd->start_pattern); /* Pattern offset */
dvander@2762	2136	PUT(code, LINK_SIZE, 0); /* Default length */
dvander@2762	2137	return code + 2*LINK_SIZE;
dvander@2762	2138	}
dvander@2762	2139
dvander@2762	2140
dvander@2762	2141
dvander@2762	2142	/*************************************************
dvander@2762	2143	* Complete a callout item *
dvander@2762	2144	*************************************************/
dvander@2762	2145
dvander@2762	2146	/* A callout item contains the length of the next item in the pattern, which
dvander@2762	2147	we can't fill in till after we have reached the relevant point. This is used
dvander@2762	2148	for both automatic and manual callouts.
dvander@2762	2149
dvander@2762	2150	Arguments:
dvander@2762	2151	previous_callout points to previous callout item
dvander@2762	2152	ptr current pattern pointer
dvander@2762	2153	cd pointers to tables etc
dvander@2762	2154
dvander@2762	2155	Returns: nothing
dvander@2762	2156	*/
dvander@2762	2157
dvander@2762	2158	static void
dvander@2762	2159	complete_callout(uschar previous_callout, const uschar ptr, compile_data *cd)
dvander@2762	2160	{
dvander@2762	2161	int length = ptr - cd->start_pattern - GET(previous_callout, 2);
dvander@2762	2162	PUT(previous_callout, 2 + LINK_SIZE, length);
dvander@2762	2163	}
dvander@2762	2164
dvander@2762	2165
dvander@2762	2166
dvander@2762	2167	#ifdef SUPPORT_UCP
dvander@2762	2168	/*************************************************
dvander@2762	2169	* Get othercase range *
dvander@2762	2170	*************************************************/
dvander@2762	2171
dvander@2762	2172	/* This function is passed the start and end of a class range, in UTF-8 mode
dvander@2762	2173	with UCP support. It searches up the characters, looking for internal ranges of
dvander@2762	2174	characters in the "other" case. Each call returns the next one, updating the
dvander@2762	2175	start address.
dvander@2762	2176
dvander@2762	2177	Arguments:
dvander@2762	2178	cptr points to starting character value; updated
dvander@2762	2179	d end value
dvander@2762	2180	ocptr where to put start of othercase range
dvander@2762	2181	odptr where to put end of othercase range
dvander@2762	2182
dvander@2762	2183	Yield: TRUE when range returned; FALSE when no more
dvander@2762	2184	*/
dvander@2762	2185
dvander@2762	2186	static BOOL
dvander@2762	2187	get_othercase_range(unsigned int cptr, unsigned int d, unsigned int ocptr,
dvander@2762	2188	unsigned int *odptr)
dvander@2762	2189	{
dvander@2762	2190	unsigned int c, othercase, next;
dvander@2762	2191
dvander@2762	2192	for (c = *cptr; c <= d; c++)
dvander@2762	2193	{ if ((othercase = UCD_OTHERCASE(c)) != c) break; }
dvander@2762	2194
dvander@2762	2195	if (c > d) return FALSE;
dvander@2762	2196
dvander@2762	2197	*ocptr = othercase;
dvander@2762	2198	next = othercase + 1;
dvander@2762	2199
dvander@2762	2200	for (++c; c <= d; c++)
dvander@2762	2201	{
dvander@2762	2202	if (UCD_OTHERCASE(c) != next) break;
dvander@2762	2203	next++;
dvander@2762	2204	}
dvander@2762	2205
dvander@2762	2206	*odptr = next - 1;
dvander@2762	2207	*cptr = c;
dvander@2762	2208
dvander@2762	2209	return TRUE;
dvander@2762	2210	}
dvander@2762	2211	#endif /* SUPPORT_UCP */
dvander@2762	2212
dvander@2762	2213
dvander@2762	2214
dvander@2762	2215	/*************************************************
dvander@2762	2216	* Check if auto-possessifying is possible *
dvander@2762	2217	*************************************************/
dvander@2762	2218
dvander@2762	2219	/* This function is called for unlimited repeats of certain items, to see
dvander@2762	2220	whether the next thing could possibly match the repeated item. If not, it makes
dvander@2762	2221	sense to automatically possessify the repeated item.
dvander@2762	2222
dvander@2762	2223	Arguments:
dvander@2762	2224	op_code the repeated op code
dvander@2762	2225	this data for this item, depends on the opcode
dvander@2762	2226	utf8 TRUE in UTF-8 mode
dvander@2762	2227	utf8_char used for utf8 character bytes, NULL if not relevant
dvander@2762	2228	ptr next character in pattern
dvander@2762	2229	options options bits
dvander@2762	2230	cd contains pointers to tables etc.
dvander@2762	2231
dvander@2762	2232	Returns: TRUE if possessifying is wanted
dvander@2762	2233	*/
dvander@2762	2234
dvander@2762	2235	static BOOL
dvander@2762	2236	check_auto_possessive(int op_code, int item, BOOL utf8, uschar *utf8_char,
dvander@2762	2237	const uschar ptr, int options, compile_data cd)
dvander@2762	2238	{
dvander@2762	2239	int next;
dvander@2762	2240
dvander@2762	2241	/* Skip whitespace and comments in extended mode */
dvander@2762	2242
dvander@2762	2243	if ((options & PCRE_EXTENDED) != 0)
dvander@2762	2244	{
dvander@2762	2245	for (;;)
dvander@2762	2246	{
dvander@2762	2247	while ((cd->ctypes[*ptr] & ctype_space) != 0) ptr++;
dvander@2762	2248	if (*ptr == CHAR_NUMBER_SIGN)
dvander@2762	2249	{
dvander@2762	2250	while (*(++ptr) != 0)
dvander@2762	2251	if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; }
dvander@2762	2252	}
dvander@2762	2253	else break;
dvander@2762	2254	}
dvander@2762	2255	}
dvander@2762	2256
dvander@2762	2257	/* If the next item is one that we can handle, get its value. A non-negative
dvander@2762	2258	value is a character, a negative value is an escape value. */
dvander@2762	2259
dvander@2762	2260	if (*ptr == CHAR_BACKSLASH)
dvander@2762	2261	{
dvander@2762	2262	int temperrorcode = 0;
dvander@2762	2263	next = check_escape(&ptr, &temperrorcode, cd->bracount, options, FALSE);
dvander@2762	2264	if (temperrorcode != 0) return FALSE;
dvander@2762	2265	ptr++; /* Point after the escape sequence */
dvander@2762	2266	}
dvander@2762	2267
dvander@2762	2268	else if ((cd->ctypes[*ptr] & ctype_meta) == 0)
dvander@2762	2269	{
dvander@2762	2270	#ifdef SUPPORT_UTF8
dvander@2762	2271	if (utf8) { GETCHARINC(next, ptr); } else
dvander@2762	2272	#endif
dvander@2762	2273	next = *ptr++;
dvander@2762	2274	}
dvander@2762	2275
dvander@2762	2276	else return FALSE;
dvander@2762	2277
dvander@2762	2278	/* Skip whitespace and comments in extended mode */
dvander@2762	2279
dvander@2762	2280	if ((options & PCRE_EXTENDED) != 0)
dvander@2762	2281	{
dvander@2762	2282	for (;;)
dvander@2762	2283	{
dvander@2762	2284	while ((cd->ctypes[*ptr] & ctype_space) != 0) ptr++;
dvander@2762	2285	if (*ptr == CHAR_NUMBER_SIGN)
dvander@2762	2286	{
dvander@2762	2287	while (*(++ptr) != 0)
dvander@2762	2288	if (IS_NEWLINE(ptr)) { ptr += cd->nllen; break; }
dvander@2762	2289	}
dvander@2762	2290	else break;
dvander@2762	2291	}
dvander@2762	2292	}
dvander@2762	2293
dvander@2762	2294	/* If the next thing is itself optional, we have to give up. */
dvander@2762	2295
dvander@2762	2296	if (ptr == CHAR_ASTERISK \|\| ptr == CHAR_QUESTION_MARK \|\|
dvander@2762	2297	strncmp((char *)ptr, STR_LEFT_CURLY_BRACKET STR_0 STR_COMMA, 3) == 0)
dvander@2762	2298	return FALSE;
dvander@2762	2299
dvander@2762	2300	/* Now compare the next item with the previous opcode. If the previous is a
dvander@2762	2301	positive single character match, "item" either contains the character or, if
dvander@2762	2302	"item" is greater than 127 in utf8 mode, the character's bytes are in
dvander@2762	2303	utf8_char. */
dvander@2762	2304
dvander@2762	2305
dvander@2762	2306	/* Handle cases when the next item is a character. */
dvander@2762	2307
dvander@2762	2308	if (next >= 0) switch(op_code)
dvander@2762	2309	{
dvander@2762	2310	case OP_CHAR:
dvander@2762	2311	#ifdef SUPPORT_UTF8
dvander@2762	2312	if (utf8 && item > 127) { GETCHAR(item, utf8_char); }
dvander@2762	2313	#else
dvander@2762	2314	(void)(utf8_char); /* Keep compiler happy by referencing function argument */
dvander@2762	2315	#endif
dvander@2762	2316	return item != next;
dvander@2762	2317
dvander@2762	2318	/* For CHARNC (caseless character) we must check the other case. If we have
dvander@2762	2319	Unicode property support, we can use it to test the other case of
dvander@2762	2320	high-valued characters. */
dvander@2762	2321
dvander@2762	2322	case OP_CHARNC:
dvander@2762	2323	#ifdef SUPPORT_UTF8
dvander@2762	2324	if (utf8 && item > 127) { GETCHAR(item, utf8_char); }
dvander@2762	2325	#endif
dvander@2762	2326	if (item == next) return FALSE;
dvander@2762	2327	#ifdef SUPPORT_UTF8
dvander@2762	2328	if (utf8)
dvander@2762	2329	{
dvander@2762	2330	unsigned int othercase;
dvander@2762	2331	if (next < 128) othercase = cd->fcc[next]; else
dvander@2762	2332	#ifdef SUPPORT_UCP
dvander@2762	2333	othercase = UCD_OTHERCASE((unsigned int)next);
dvander@2762	2334	#else
dvander@2762	2335	othercase = NOTACHAR;
dvander@2762	2336	#endif
dvander@2762	2337	return (unsigned int)item != othercase;
dvander@2762	2338	}
dvander@2762	2339	else
dvander@2762	2340	#endif /* SUPPORT_UTF8 */
dvander@2762	2341	return (item != cd->fcc[next]); /* Non-UTF-8 mode */
dvander@2762	2342
dvander@2762	2343	/* For OP_NOT, "item" must be a single-byte character. */
dvander@2762	2344
dvander@2762	2345	case OP_NOT:
dvander@2762	2346	if (item == next) return TRUE;
dvander@2762	2347	if ((options & PCRE_CASELESS) == 0) return FALSE;
dvander@2762	2348	#ifdef SUPPORT_UTF8
dvander@2762	2349	if (utf8)
dvander@2762	2350	{
dvander@2762	2351	unsigned int othercase;
dvander@2762	2352	if (next < 128) othercase = cd->fcc[next]; else
dvander@2762	2353	#ifdef SUPPORT_UCP
dvander@2762	2354	othercase = UCD_OTHERCASE(next);
dvander@2762	2355	#else
dvander@2762	2356	othercase = NOTACHAR;
dvander@2762	2357	#endif
dvander@2762	2358	return (unsigned int)item == othercase;
dvander@2762	2359	}
dvander@2762	2360	else
dvander@2762	2361	#endif /* SUPPORT_UTF8 */
dvander@2762	2362	return (item == cd->fcc[next]); /* Non-UTF-8 mode */
dvander@2762	2363
dvander@2762	2364	case OP_DIGIT:
dvander@2762	2365	return next > 127 \|\| (cd->ctypes[next] & ctype_digit) == 0;
dvander@2762	2366
dvander@2762	2367	case OP_NOT_DIGIT:
dvander@2762	2368	return next <= 127 && (cd->ctypes[next] & ctype_digit) != 0;
dvander@2762	2369
dvander@2762	2370	case OP_WHITESPACE:
dvander@2762	2371	return next > 127 \|\| (cd->ctypes[next] & ctype_space) == 0;
dvander@2762	2372
dvander@2762	2373	case OP_NOT_WHITESPACE:
dvander@2762	2374	return next <= 127 && (cd->ctypes[next] & ctype_space) != 0;
dvander@2762	2375
dvander@2762	2376	case OP_WORDCHAR:
dvander@2762	2377	return next > 127 \|\| (cd->ctypes[next] & ctype_word) == 0;
dvander@2762	2378
dvander@2762	2379	case OP_NOT_WORDCHAR:
dvander@2762	2380	return next <= 127 && (cd->ctypes[next] & ctype_word) != 0;
dvander@2762	2381
dvander@2762	2382	case OP_HSPACE:
dvander@2762	2383	case OP_NOT_HSPACE:
dvander@2762	2384	switch(next)
dvander@2762	2385	{
dvander@2762	2386	case 0x09:
dvander@2762	2387	case 0x20:
dvander@2762	2388	case 0xa0:
dvander@2762	2389	case 0x1680:
dvander@2762	2390	case 0x180e:
dvander@2762	2391	case 0x2000:
dvander@2762	2392	case 0x2001:
dvander@2762	2393	case 0x2002:
dvander@2762	2394	case 0x2003:
dvander@2762	2395	case 0x2004:
dvander@2762	2396	case 0x2005:
dvander@2762	2397	case 0x2006:
dvander@2762	2398	case 0x2007:
dvander@2762	2399	case 0x2008:
dvander@2762	2400	case 0x2009:
dvander@2762	2401	case 0x200A:
dvander@2762	2402	case 0x202f:
dvander@2762	2403	case 0x205f:
dvander@2762	2404	case 0x3000:
dvander@2762	2405	return op_code != OP_HSPACE;
dvander@2762	2406	default:
dvander@2762	2407	return op_code == OP_HSPACE;
dvander@2762	2408	}
dvander@2762	2409
dvander@2762	2410	case OP_VSPACE:
dvander@2762	2411	case OP_NOT_VSPACE:
dvander@2762	2412	switch(next)
dvander@2762	2413	{
dvander@2762	2414	case 0x0a:
dvander@2762	2415	case 0x0b:
dvander@2762	2416	case 0x0c:
dvander@2762	2417	case 0x0d:
dvander@2762	2418	case 0x85:
dvander@2762	2419	case 0x2028:
dvander@2762	2420	case 0x2029:
dvander@2762	2421	return op_code != OP_VSPACE;
dvander@2762	2422	default:
dvander@2762	2423	return op_code == OP_VSPACE;
dvander@2762	2424	}
dvander@2762	2425
dvander@2762	2426	default:
dvander@2762	2427	return FALSE;
dvander@2762	2428	}
dvander@2762	2429
dvander@2762	2430
dvander@2762	2431	/* Handle the case when the next item is \d, \s, etc. */
dvander@2762	2432
dvander@2762	2433	switch(op_code)
dvander@2762	2434	{
dvander@2762	2435	case OP_CHAR:
dvander@2762	2436	case OP_CHARNC:
dvander@2762	2437	#ifdef SUPPORT_UTF8
dvander@2762	2438	if (utf8 && item > 127) { GETCHAR(item, utf8_char); }
dvander@2762	2439	#endif
dvander@2762	2440	switch(-next)
dvander@2762	2441	{
dvander@2762	2442	case ESC_d:
dvander@2762	2443	return item > 127 \|\| (cd->ctypes[item] & ctype_digit) == 0;
dvander@2762	2444
dvander@2762	2445	case ESC_D:
dvander@2762	2446	return item <= 127 && (cd->ctypes[item] & ctype_digit) != 0;
dvander@2762	2447
dvander@2762	2448	case ESC_s:
dvander@2762	2449	return item > 127 \|\| (cd->ctypes[item] & ctype_space) == 0;
dvander@2762	2450
dvander@2762	2451	case ESC_S:
dvander@2762	2452	return item <= 127 && (cd->ctypes[item] & ctype_space) != 0;
dvander@2762	2453
dvander@2762	2454	case ESC_w:
dvander@2762	2455	return item > 127 \|\| (cd->ctypes[item] & ctype_word) == 0;
dvander@2762	2456
dvander@2762	2457	case ESC_W:
dvander@2762	2458	return item <= 127 && (cd->ctypes[item] & ctype_word) != 0;
dvander@2762	2459
dvander@2762	2460	case ESC_h:
dvander@2762	2461	case ESC_H:
dvander@2762	2462	switch(item)
dvander@2762	2463	{
dvander@2762	2464	case 0x09:
dvander@2762	2465	case 0x20:
dvander@2762	2466	case 0xa0:
dvander@2762	2467	case 0x1680:
dvander@2762	2468	case 0x180e:
dvander@2762	2469	case 0x2000:
dvander@2762	2470	case 0x2001:
dvander@2762	2471	case 0x2002:
dvander@2762	2472	case 0x2003:
dvander@2762	2473	case 0x2004:
dvander@2762	2474	case 0x2005:
dvander@2762	2475	case 0x2006:
dvander@2762	2476	case 0x2007:
dvander@2762	2477	case 0x2008:
dvander@2762	2478	case 0x2009:
dvander@2762	2479	case 0x200A:
dvander@2762	2480	case 0x202f:
dvander@2762	2481	case 0x205f:
dvander@2762	2482	case 0x3000:
dvander@2762	2483	return -next != ESC_h;
dvander@2762	2484	default:
dvander@2762	2485	return -next == ESC_h;
dvander@2762	2486	}
dvander@2762	2487
dvander@2762	2488	case ESC_v:
dvander@2762	2489	case ESC_V:
dvander@2762	2490	switch(item)
dvander@2762	2491	{
dvander@2762	2492	case 0x0a:
dvander@2762	2493	case 0x0b:
dvander@2762	2494	case 0x0c:
dvander@2762	2495	case 0x0d:
dvander@2762	2496	case 0x85:
dvander@2762	2497	case 0x2028:
dvander@2762	2498	case 0x2029:
dvander@2762	2499	return -next != ESC_v;
dvander@2762	2500	default:
dvander@2762	2501	return -next == ESC_v;
dvander@2762	2502	}
dvander@2762	2503
dvander@2762	2504	default:
dvander@2762	2505	return FALSE;
dvander@2762	2506	}
dvander@2762	2507
dvander@2762	2508	case OP_DIGIT:
dvander@2762	2509	return next == -ESC_D \|\| next == -ESC_s \|\| next == -ESC_W \|\|
dvander@2762	2510	next == -ESC_h \|\| next == -ESC_v;
dvander@2762	2511
dvander@2762	2512	case OP_NOT_DIGIT:
dvander@2762	2513	return next == -ESC_d;
dvander@2762	2514
dvander@2762	2515	case OP_WHITESPACE:
dvander@2762	2516	return next == -ESC_S \|\| next == -ESC_d \|\| next == -ESC_w;
dvander@2762	2517
dvander@2762	2518	case OP_NOT_WHITESPACE:
dvander@2762	2519	return next == -ESC_s \|\| next == -ESC_h \|\| next == -ESC_v;
dvander@2762	2520
dvander@2762	2521	case OP_HSPACE:
dvander@2762	2522	return next == -ESC_S \|\| next == -ESC_H \|\| next == -ESC_d \|\| next == -ESC_w;
dvander@2762	2523
dvander@2762	2524	case OP_NOT_HSPACE:
dvander@2762	2525	return next == -ESC_h;
dvander@2762	2526
dvander@2762	2527	/* Can't have \S in here because VT matches \S (Perl anomaly) */
dvander@2762	2528	case OP_VSPACE:
dvander@2762	2529	return next == -ESC_V \|\| next == -ESC_d \|\| next == -ESC_w;
dvander@2762	2530
dvander@2762	2531	case OP_NOT_VSPACE:
dvander@2762	2532	return next == -ESC_v;
dvander@2762	2533
dvander@2762	2534	case OP_WORDCHAR:
dvander@2762	2535	return next == -ESC_W \|\| next == -ESC_s \|\| next == -ESC_h \|\| next == -ESC_v;
dvander@2762	2536
dvander@2762	2537	case OP_NOT_WORDCHAR:
dvander@2762	2538	return next == -ESC_w \|\| next == -ESC_d;
dvander@2762	2539
dvander@2762	2540	default:
dvander@2762	2541	return FALSE;
dvander@2762	2542	}
dvander@2762	2543
dvander@2762	2544	/* Control does not reach here */
dvander@2762	2545	}
dvander@2762	2546
dvander@2762	2547
dvander@2762	2548
dvander@2762	2549	/*************************************************
dvander@2762	2550	* Compile one branch *
dvander@2762	2551	*************************************************/
dvander@2762	2552
dvander@2762	2553	/* Scan the pattern, compiling it into the a vector. If the options are
dvander@2762	2554	changed during the branch, the pointer is used to change the external options
dvander@2762	2555	bits. This function is used during the pre-compile phase when we are trying
dvander@2762	2556	to find out the amount of memory needed, as well as during the real compile
dvander@2762	2557	phase. The value of lengthptr distinguishes the two phases.
dvander@2762	2558
dvander@2762	2559	Arguments:
dvander@2762	2560	optionsptr pointer to the option bits
dvander@2762	2561	codeptr points to the pointer to the current code point
dvander@2762	2562	ptrptr points to the current pattern pointer
dvander@2762	2563	errorcodeptr points to error code variable
dvander@2762	2564	firstbyteptr set to initial literal character, or < 0 (REQ_UNSET, REQ_NONE)
dvander@2762	2565	reqbyteptr set to the last literal character required, else < 0
dvander@2762	2566	bcptr points to current branch chain
dvander@2762	2567	cd contains pointers to tables etc.
dvander@2762	2568	lengthptr NULL during the real compile phase
dvander@2762	2569	points to length accumulator during pre-compile phase
dvander@2762	2570
dvander@2762	2571	Returns: TRUE on success
dvander@2762	2572	FALSE, with *errorcodeptr set non-zero on error
dvander@2762	2573	*/
dvander@2762	2574
dvander@2762	2575	static BOOL
dvander@2762	2576	compile_branch(int optionsptr, uschar codeptr, const uschar *ptrptr,
dvander@2762	2577	int errorcodeptr, int firstbyteptr, int reqbyteptr, branch_chain bcptr,
dvander@2762	2578	compile_data cd, int lengthptr)
dvander@2762	2579	{
dvander@2762	2580	int repeat_type, op_type;
dvander@2762	2581	int repeat_min = 0, repeat_max = 0; /* To please picky compilers */
dvander@2762	2582	int bravalue = 0;
dvander@2762	2583	int greedy_default, greedy_non_default;
dvander@2762	2584	int firstbyte, reqbyte;
dvander@2762	2585	int zeroreqbyte, zerofirstbyte;
dvander@2762	2586	int req_caseopt, reqvary, tempreqvary;
dvander@2762	2587	int options = *optionsptr;
dvander@2762	2588	int after_manual_callout = 0;
dvander@2762	2589	int length_prevgroup = 0;
dvander@2762	2590	register int c;
dvander@2762	2591	register uschar code = codeptr;
dvander@2762	2592	uschar *last_code = code;
dvander@2762	2593	uschar *orig_code = code;
dvander@2762	2594	uschar *tempcode;
dvander@2762	2595	BOOL inescq = FALSE;
dvander@2762	2596	BOOL groupsetfirstbyte = FALSE;
dvander@2762	2597	const uschar ptr = ptrptr;
dvander@2762	2598	const uschar *tempptr;
dvander@2762	2599	uschar *previous = NULL;
dvander@2762	2600	uschar *previous_callout = NULL;
dvander@2762	2601	uschar *save_hwm = NULL;
dvander@2762	2602	uschar classbits[32];
dvander@2762	2603
dvander@2762	2604	#ifdef SUPPORT_UTF8
dvander@2762	2605	BOOL class_utf8;
dvander@2762	2606	BOOL utf8 = (options & PCRE_UTF8) != 0;
dvander@2762	2607	uschar *class_utf8data;
dvander@2762	2608	uschar *class_utf8data_base;
dvander@2762	2609	uschar utf8_char[6];
dvander@2762	2610	#else
dvander@2762	2611	BOOL utf8 = FALSE;
dvander@2762	2612	uschar *utf8_char = NULL;
dvander@2762	2613	#endif
dvander@2762	2614
dvander@2762	2615	#ifdef DEBUG
dvander@2762	2616	if (lengthptr != NULL) DPRINTF((">> start branch\n"));
dvander@2762	2617	#endif
dvander@2762	2618
dvander@2762	2619	/* Set up the default and non-default settings for greediness */
dvander@2762	2620
dvander@2762	2621	greedy_default = ((options & PCRE_UNGREEDY) != 0);
dvander@2762	2622	greedy_non_default = greedy_default ^ 1;
dvander@2762	2623
dvander@2762	2624	/* Initialize no first byte, no required byte. REQ_UNSET means "no char
dvander@2762	2625	matching encountered yet". It gets changed to REQ_NONE if we hit something that
dvander@2762	2626	matches a non-fixed char first char; reqbyte just remains unset if we never
dvander@2762	2627	find one.
dvander@2762	2628
dvander@2762	2629	When we hit a repeat whose minimum is zero, we may have to adjust these values
dvander@2762	2630	to take the zero repeat into account. This is implemented by setting them to
dvander@2762	2631	zerofirstbyte and zeroreqbyte when such a repeat is encountered. The individual
dvander@2762	2632	item types that can be repeated set these backoff variables appropriately. */
dvander@2762	2633
dvander@2762	2634	firstbyte = reqbyte = zerofirstbyte = zeroreqbyte = REQ_UNSET;
dvander@2762	2635
dvander@2762	2636	/* The variable req_caseopt contains either the REQ_CASELESS value or zero,
dvander@2762	2637	according to the current setting of the caseless flag. REQ_CASELESS is a bit
dvander@2762	2638	value > 255. It is added into the firstbyte or reqbyte variables to record the
dvander@2762	2639	case status of the value. This is used only for ASCII characters. */
dvander@2762	2640
dvander@2762	2641	req_caseopt = ((options & PCRE_CASELESS) != 0)? REQ_CASELESS : 0;
dvander@2762	2642
dvander@2762	2643	/* Switch on next character until the end of the branch */
dvander@2762	2644
dvander@2762	2645	for (;; ptr++)
dvander@2762	2646	{
dvander@2762	2647	BOOL negate_class;
dvander@2762	2648	BOOL should_flip_negation;
dvander@2762	2649	BOOL possessive_quantifier;
dvander@2762	2650	BOOL is_quantifier;
dvander@2762	2651	BOOL is_recurse;
dvander@2762	2652	BOOL reset_bracount;
dvander@2762	2653	int class_charcount;
dvander@2762	2654	int class_lastchar;
dvander@2762	2655	int newoptions;
dvander@2762	2656	int recno;
dvander@2762	2657	int refsign;
dvander@2762	2658	int skipbytes;
dvander@2762	2659	int subreqbyte;
dvander@2762	2660	int subfirstbyte;
dvander@2762	2661	int terminator;
dvander@2762	2662	int mclength;
dvander@2762	2663	uschar mcbuffer[8];
dvander@2762	2664
dvander@2762	2665	/* Get next byte in the pattern */
dvander@2762	2666
dvander@2762	2667	c = *ptr;
dvander@2762	2668
dvander@2762	2669	/* If we are in the pre-compile phase, accumulate the length used for the
dvander@2762	2670	previous cycle of this loop. */
dvander@2762	2671
dvander@2762	2672	if (lengthptr != NULL)
dvander@2762	2673	{
dvander@2762	2674	#ifdef DEBUG
dvander@2762	2675	if (code > cd->hwm) cd->hwm = code; /* High water info */
dvander@2762	2676	#endif
dvander@2762	2677	if (code > cd->start_workspace + COMPILE_WORK_SIZE) /* Check for overrun */
dvander@2762	2678	{
dvander@2762	2679	*errorcodeptr = ERR52;
dvander@2762	2680	goto FAILED;
dvander@2762	2681	}
dvander@2762	2682
dvander@2762	2683	/* There is at least one situation where code goes backwards: this is the
dvander@2762	2684	case of a zero quantifier after a class (e.g. [ab]{0}). At compile time,
dvander@2762	2685	the class is simply eliminated. However, it is created first, so we have to
dvander@2762	2686	allow memory for it. Therefore, don't ever reduce the length at this point.
dvander@2762	2687	*/
dvander@2762	2688
dvander@2762	2689	if (code < last_code) code = last_code;
dvander@2762	2690
dvander@2762	2691	/* Paranoid check for integer overflow */
dvander@2762	2692
dvander@2762	2693	if (OFLOW_MAX - *lengthptr < code - last_code)
dvander@2762	2694	{
dvander@2762	2695	*errorcodeptr = ERR20;
dvander@2762	2696	goto FAILED;
dvander@2762	2697	}
dvander@2762	2698
dvander@2762	2699	*lengthptr += code - last_code;
dvander@2762	2700	DPRINTF(("length=%d added %d c=%c\n", *lengthptr, code - last_code, c));
dvander@2762	2701
dvander@2762	2702	/* If "previous" is set and it is not at the start of the work space, move
dvander@2762	2703	it back to there, in order to avoid filling up the work space. Otherwise,
dvander@2762	2704	if "previous" is NULL, reset the current code pointer to the start. */
dvander@2762	2705
dvander@2762	2706	if (previous != NULL)
dvander@2762	2707	{
dvander@2762	2708	if (previous > orig_code)
dvander@2762	2709	{
dvander@2762	2710	memmove(orig_code, previous, code - previous);
dvander@2762	2711	code -= previous - orig_code;
dvander@2762	2712	previous = orig_code;
dvander@2762	2713	}
dvander@2762	2714	}
dvander@2762	2715	else code = orig_code;
dvander@2762	2716
dvander@2762	2717	/* Remember where this code item starts so we can pick up the length
dvander@2762	2718	next time round. */
dvander@2762	2719
dvander@2762	2720	last_code = code;
dvander@2762	2721	}
dvander@2762	2722
dvander@2762	2723	/* In the real compile phase, just check the workspace used by the forward
dvander@2762	2724	reference list. */
dvander@2762	2725
dvander@2762	2726	else if (cd->hwm > cd->start_workspace + COMPILE_WORK_SIZE)
dvander@2762	2727	{
dvander@2762	2728	*errorcodeptr = ERR52;
dvander@2762	2729	goto FAILED;
dvander@2762	2730	}
dvander@2762	2731
dvander@2762	2732	/* If in \Q...\E, check for the end; if not, we have a literal */
dvander@2762	2733
dvander@2762	2734	if (inescq && c != 0)
dvander@2762	2735	{
dvander@2762	2736	if (c == CHAR_BACKSLASH && ptr[1] == CHAR_E)
dvander@2762	2737	{
dvander@2762	2738	inescq = FALSE;
dvander@2762	2739	ptr++;
dvander@2762	2740	continue;
dvander@2762	2741	}
dvander@2762	2742	else
dvander@2762	2743	{
dvander@2762	2744	if (previous_callout != NULL)
dvander@2762	2745	{
dvander@2762	2746	if (lengthptr == NULL) /* Don't attempt in pre-compile phase */
dvander@2762	2747	complete_callout(previous_callout, ptr, cd);
dvander@2762	2748	previous_callout = NULL;
dvander@2762	2749	}
dvander@2762	2750	if ((options & PCRE_AUTO_CALLOUT) != 0)
dvander@2762	2751	{
dvander@2762	2752	previous_callout = code;
dvander@2762	2753	code = auto_callout(code, ptr, cd);
dvander@2762	2754	}
dvander@2762	2755	goto NORMAL_CHAR;
dvander@2762	2756	}
dvander@2762	2757	}
dvander@2762	2758
dvander@2762	2759	/* Fill in length of a previous callout, except when the next thing is
dvander@2762	2760	a quantifier. */
dvander@2762	2761
dvander@2762	2762	is_quantifier =
dvander@2762	2763	c == CHAR_ASTERISK \|\| c == CHAR_PLUS \|\| c == CHAR_QUESTION_MARK \|\|
dvander@2762	2764	(c == CHAR_LEFT_CURLY_BRACKET && is_counted_repeat(ptr+1));
dvander@2762	2765
dvander@2762	2766	if (!is_quantifier && previous_callout != NULL &&
dvander@2762	2767	after_manual_callout-- <= 0)
dvander@2762	2768	{
dvander@2762	2769	if (lengthptr == NULL) /* Don't attempt in pre-compile phase */
dvander@2762	2770	complete_callout(previous_callout, ptr, cd);
dvander@2762	2771	previous_callout = NULL;
dvander@2762	2772	}
dvander@2762	2773
dvander@2762	2774	/* In extended mode, skip white space and comments */
dvander@2762	2775
dvander@2762	2776	if ((options & PCRE_EXTENDED) != 0)
dvander@2762	2777	{
dvander@2762	2778	if ((cd->ctypes[c] & ctype_space) != 0) continue;
dvander@2762	2779	if (c == CHAR_NUMBER_SIGN)
dvander@2762	2780	{
dvander@2762	2781	while (*(++ptr) != 0)
dvander@2762	2782	{
dvander@2762	2783	if (IS_NEWLINE(ptr)) { ptr += cd->nllen - 1; break; }
dvander@2762	2784	}
dvander@2762	2785	if (*ptr != 0) continue;
dvander@2762	2786
dvander@2762	2787	/* Else fall through to handle end of string */
dvander@2762	2788	c = 0;
dvander@2762	2789	}
dvander@2762	2790	}
dvander@2762	2791
dvander@2762	2792	/* No auto callout for quantifiers. */
dvander@2762	2793
dvander@2762	2794	if ((options & PCRE_AUTO_CALLOUT) != 0 && !is_quantifier)
dvander@2762	2795	{
dvander@2762	2796	previous_callout = code;
dvander@2762	2797	code = auto_callout(code, ptr, cd);
dvander@2762	2798	}
dvander@2762	2799
dvander@2762	2800	switch(c)
dvander@2762	2801	{
dvander@2762	2802	/* ===================================================================*/
dvander@2762	2803	case 0: /* The branch terminates at string end */
dvander@2762	2804	case CHAR_VERTICAL_LINE: /* or \| or ) */
dvander@2762	2805	case CHAR_RIGHT_PARENTHESIS:
dvander@2762	2806	*firstbyteptr = firstbyte;
dvander@2762	2807	*reqbyteptr = reqbyte;
dvander@2762	2808	*codeptr = code;
dvander@2762	2809	*ptrptr = ptr;
dvander@2762	2810	if (lengthptr != NULL)
dvander@2762	2811	{
dvander@2762	2812	if (OFLOW_MAX - *lengthptr < code - last_code)
dvander@2762	2813	{
dvander@2762	2814	*errorcodeptr = ERR20;
dvander@2762	2815	goto FAILED;
dvander@2762	2816	}
dvander@2762	2817	lengthptr += code - last_code; / To include callout length */
dvander@2762	2818	DPRINTF((">> end branch\n"));
dvander@2762	2819	}
dvander@2762	2820	return TRUE;
dvander@2762	2821
dvander@2762	2822
dvander@2762	2823	/* ===================================================================*/
dvander@2762	2824	/* Handle single-character metacharacters. In multiline mode, ^ disables
dvander@2762	2825	the setting of any following char as a first character. */
dvander@2762	2826
dvander@2762	2827	case CHAR_CIRCUMFLEX_ACCENT:
dvander@2762	2828	if ((options & PCRE_MULTILINE) != 0)
dvander@2762	2829	{
dvander@2762	2830	if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
dvander@2762	2831	}
dvander@2762	2832	previous = NULL;
dvander@2762	2833	*code++ = OP_CIRC;
dvander@2762	2834	break;
dvander@2762	2835
dvander@2762	2836	case CHAR_DOLLAR_SIGN:
dvander@2762	2837	previous = NULL;
dvander@2762	2838	*code++ = OP_DOLL;
dvander@2762	2839	break;
dvander@2762	2840
dvander@2762	2841	/* There can never be a first char if '.' is first, whatever happens about
dvander@2762	2842	repeats. The value of reqbyte doesn't change either. */
dvander@2762	2843
dvander@2762	2844	case CHAR_DOT:
dvander@2762	2845	if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
dvander@2762	2846	zerofirstbyte = firstbyte;
dvander@2762	2847	zeroreqbyte = reqbyte;
dvander@2762	2848	previous = code;
dvander@2762	2849	*code++ = ((options & PCRE_DOTALL) != 0)? OP_ALLANY: OP_ANY;
dvander@2762	2850	break;
dvander@2762	2851
dvander@2762	2852
dvander@2762	2853	/* ===================================================================*/
dvander@2762	2854	/* Character classes. If the included characters are all < 256, we build a
dvander@2762	2855	32-byte bitmap of the permitted characters, except in the special case
dvander@2762	2856	where there is only one such character. For negated classes, we build the
dvander@2762	2857	map as usual, then invert it at the end. However, we use a different opcode
dvander@2762	2858	so that data characters > 255 can be handled correctly.
dvander@2762	2859
dvander@2762	2860	If the class contains characters outside the 0-255 range, a different
dvander@2762	2861	opcode is compiled. It may optionally have a bit map for characters < 256,
dvander@2762	2862	but those above are are explicitly listed afterwards. A flag byte tells
dvander@2762	2863	whether the bitmap is present, and whether this is a negated class or not.
dvander@2762	2864
dvander@2762	2865	In JavaScript compatibility mode, an isolated ']' causes an error. In
dvander@2762	2866	default (Perl) mode, it is treated as a data character. */
dvander@2762	2867
dvander@2762	2868	case CHAR_RIGHT_SQUARE_BRACKET:
dvander@2762	2869	if ((cd->external_options & PCRE_JAVASCRIPT_COMPAT) != 0)
dvander@2762	2870	{
dvander@2762	2871	*errorcodeptr = ERR64;
dvander@2762	2872	goto FAILED;
dvander@2762	2873	}
dvander@2762	2874	goto NORMAL_CHAR;
dvander@2762	2875
dvander@2762	2876	case CHAR_LEFT_SQUARE_BRACKET:
dvander@2762	2877	previous = code;
dvander@2762	2878
dvander@2762	2879	/* PCRE supports POSIX class stuff inside a class. Perl gives an error if
dvander@2762	2880	they are encountered at the top level, so we'll do that too. */
dvander@2762	2881
dvander@2762	2882	if ((ptr[1] == CHAR_COLON \|\| ptr[1] == CHAR_DOT \|\|
dvander@2762	2883	ptr[1] == CHAR_EQUALS_SIGN) &&
dvander@2762	2884	check_posix_syntax(ptr, &tempptr))
dvander@2762	2885	{
dvander@2762	2886	*errorcodeptr = (ptr[1] == CHAR_COLON)? ERR13 : ERR31;
dvander@2762	2887	goto FAILED;
dvander@2762	2888	}
dvander@2762	2889
dvander@2762	2890	/* If the first character is '^', set the negation flag and skip it. Also,
dvander@2762	2891	if the first few characters (either before or after ^) are \Q\E or \E we
dvander@2762	2892	skip them too. This makes for compatibility with Perl. */
dvander@2762	2893
dvander@2762	2894	negate_class = FALSE;
dvander@2762	2895	for (;;)
dvander@2762	2896	{
dvander@2762	2897	c = *(++ptr);
dvander@2762	2898	if (c == CHAR_BACKSLASH)
dvander@2762	2899	{
dvander@2762	2900	if (ptr[1] == CHAR_E)
dvander@2762	2901	ptr++;
dvander@2762	2902	else if (strncmp((const char *)ptr+1,
dvander@2762	2903	STR_Q STR_BACKSLASH STR_E, 3) == 0)
dvander@2762	2904	ptr += 3;
dvander@2762	2905	else
dvander@2762	2906	break;
dvander@2762	2907	}
dvander@2762	2908	else if (!negate_class && c == CHAR_CIRCUMFLEX_ACCENT)
dvander@2762	2909	negate_class = TRUE;
dvander@2762	2910	else break;
dvander@2762	2911	}
dvander@2762	2912
dvander@2762	2913	/* Empty classes are allowed in JavaScript compatibility mode. Otherwise,
dvander@2762	2914	an initial ']' is taken as a data character -- the code below handles
dvander@2762	2915	that. In JS mode, [] must always fail, so generate OP_FAIL, whereas
dvander@2762	2916	[^] must match any character, so generate OP_ALLANY. */
dvander@2762	2917
dvander@2762	2918	if (c == CHAR_RIGHT_SQUARE_BRACKET &&
dvander@2762	2919	(cd->external_options & PCRE_JAVASCRIPT_COMPAT) != 0)
dvander@2762	2920	{
dvander@2762	2921	*code++ = negate_class? OP_ALLANY : OP_FAIL;
dvander@2762	2922	if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
dvander@2762	2923	zerofirstbyte = firstbyte;
dvander@2762	2924	break;
dvander@2762	2925	}
dvander@2762	2926
dvander@2762	2927	/* If a class contains a negative special such as \S, we need to flip the
dvander@2762	2928	negation flag at the end, so that support for characters > 255 works
dvander@2762	2929	correctly (they are all included in the class). */
dvander@2762	2930
dvander@2762	2931	should_flip_negation = FALSE;
dvander@2762	2932
dvander@2762	2933	/* Keep a count of chars with values < 256 so that we can optimize the case
dvander@2762	2934	of just a single character (as long as it's < 256). However, For higher
dvander@2762	2935	valued UTF-8 characters, we don't yet do any optimization. */
dvander@2762	2936
dvander@2762	2937	class_charcount = 0;
dvander@2762	2938	class_lastchar = -1;
dvander@2762	2939
dvander@2762	2940	/* Initialize the 32-char bit map to all zeros. We build the map in a
dvander@2762	2941	temporary bit of memory, in case the class contains only 1 character (less
dvander@2762	2942	than 256), because in that case the compiled code doesn't use the bit map.
dvander@2762	2943	*/
dvander@2762	2944
dvander@2762	2945	memset(classbits, 0, 32 * sizeof(uschar));
dvander@2762	2946
dvander@2762	2947	#ifdef SUPPORT_UTF8
dvander@2762	2948	class_utf8 = FALSE; /* No chars >= 256 */
dvander@2762	2949	class_utf8data = code + LINK_SIZE + 2; /* For UTF-8 items */
dvander@2762	2950	class_utf8data_base = class_utf8data; /* For resetting in pass 1 */
dvander@2762	2951	#endif
dvander@2762	2952
dvander@2762	2953	/* Process characters until ] is reached. By writing this as a "do" it
dvander@2762	2954	means that an initial ] is taken as a data character. At the start of the
dvander@2762	2955	loop, c contains the first byte of the character. */
dvander@2762	2956
dvander@2762	2957	if (c != 0) do
dvander@2762	2958	{
dvander@2762	2959	const uschar *oldptr;
dvander@2762	2960
dvander@2762	2961	#ifdef SUPPORT_UTF8
dvander@2762	2962	if (utf8 && c > 127)
dvander@2762	2963	{ /* Braces are required because the */
dvander@2762	2964	GETCHARLEN(c, ptr, ptr); /* macro generates multiple statements */
dvander@2762	2965	}
dvander@2762	2966
dvander@2762	2967	/* In the pre-compile phase, accumulate the length of any UTF-8 extra
dvander@2762	2968	data and reset the pointer. This is so that very large classes that
dvander@2762	2969	contain a zillion UTF-8 characters no longer overwrite the work space
dvander@2762	2970	(which is on the stack). */
dvander@2762	2971
dvander@2762	2972	if (lengthptr != NULL)
dvander@2762	2973	{
dvander@2762	2974	*lengthptr += class_utf8data - class_utf8data_base;
dvander@2762	2975	class_utf8data = class_utf8data_base;
dvander@2762	2976	}
dvander@2762	2977
dvander@2762	2978	#endif
dvander@2762	2979
dvander@2762	2980	/* Inside \Q...\E everything is literal except \E */
dvander@2762	2981
dvander@2762	2982	if (inescq)
dvander@2762	2983	{
dvander@2762	2984	if (c == CHAR_BACKSLASH && ptr[1] == CHAR_E) /* If we are at \E */
dvander@2762	2985	{
dvander@2762	2986	inescq = FALSE; /* Reset literal state */
dvander@2762	2987	ptr++; /* Skip the 'E' */
dvander@2762	2988	continue; /* Carry on with next */
dvander@2762	2989	}
dvander@2762	2990	goto CHECK_RANGE; /* Could be range if \E follows */
dvander@2762	2991	}
dvander@2762	2992
dvander@2762	2993	/* Handle POSIX class names. Perl allows a negation extension of the
dvander@2762	2994	form [:^name:]. A square bracket that doesn't match the syntax is
dvander@2762	2995	treated as a literal. We also recognize the POSIX constructions
dvander@2762	2996	[.ch.] and [=ch=] ("collating elements") and fault them, as Perl
dvander@2762	2997	5.6 and 5.8 do. */
dvander@2762	2998
dvander@2762	2999	if (c == CHAR_LEFT_SQUARE_BRACKET &&
dvander@2762	3000	(ptr[1] == CHAR_COLON \|\| ptr[1] == CHAR_DOT \|\|
dvander@2762	3001	ptr[1] == CHAR_EQUALS_SIGN) && check_posix_syntax(ptr, &tempptr))
dvander@2762	3002	{
dvander@2762	3003	BOOL local_negate = FALSE;
dvander@2762	3004	int posix_class, taboffset, tabopt;
dvander@2762	3005	register const uschar *cbits = cd->cbits;
dvander@2762	3006	uschar pbits[32];
dvander@2762	3007
dvander@2762	3008	if (ptr[1] != CHAR_COLON)
dvander@2762	3009	{
dvander@2762	3010	*errorcodeptr = ERR31;
dvander@2762	3011	goto FAILED;
dvander@2762	3012	}
dvander@2762	3013
dvander@2762	3014	ptr += 2;
dvander@2762	3015	if (*ptr == CHAR_CIRCUMFLEX_ACCENT)
dvander@2762	3016	{
dvander@2762	3017	local_negate = TRUE;
dvander@2762	3018	should_flip_negation = TRUE; /* Note negative special */
dvander@2762	3019	ptr++;
dvander@2762	3020	}
dvander@2762	3021
dvander@2762	3022	posix_class = check_posix_name(ptr, tempptr - ptr);
dvander@2762	3023	if (posix_class < 0)
dvander@2762	3024	{
dvander@2762	3025	*errorcodeptr = ERR30;
dvander@2762	3026	goto FAILED;
dvander@2762	3027	}
dvander@2762	3028
dvander@2762	3029	/* If matching is caseless, upper and lower are converted to
dvander@2762	3030	alpha. This relies on the fact that the class table starts with
dvander@2762	3031	alpha, lower, upper as the first 3 entries. */
dvander@2762	3032
dvander@2762	3033	if ((options & PCRE_CASELESS) != 0 && posix_class <= 2)
dvander@2762	3034	posix_class = 0;
dvander@2762	3035
dvander@2762	3036	/* We build the bit map for the POSIX class in a chunk of local store
dvander@2762	3037	because we may be adding and subtracting from it, and we don't want to
dvander@2762	3038	subtract bits that may be in the main map already. At the end we or the
dvander@2762	3039	result into the bit map that is being built. */
dvander@2762	3040
dvander@2762	3041	posix_class *= 3;
dvander@2762	3042
dvander@2762	3043	/* Copy in the first table (always present) */
dvander@2762	3044
dvander@2762	3045	memcpy(pbits, cbits + posix_class_maps[posix_class],
dvander@2762	3046	32 * sizeof(uschar));
dvander@2762	3047
dvander@2762	3048	/* If there is a second table, add or remove it as required. */
dvander@2762	3049
dvander@2762	3050	taboffset = posix_class_maps[posix_class + 1];
dvander@2762	3051	tabopt = posix_class_maps[posix_class + 2];
dvander@2762	3052
dvander@2762	3053	if (taboffset >= 0)
dvander@2762	3054	{
dvander@2762	3055	if (tabopt >= 0)
dvander@2762	3056	for (c = 0; c < 32; c++) pbits[c] \|= cbits[c + taboffset];
dvander@2762	3057	else
dvander@2762	3058	for (c = 0; c < 32; c++) pbits[c] &= ~cbits[c + taboffset];
dvander@2762	3059	}
dvander@2762	3060
dvander@2762	3061	/* Not see if we need to remove any special characters. An option
dvander@2762	3062	value of 1 removes vertical space and 2 removes underscore. */
dvander@2762	3063
dvander@2762	3064	if (tabopt < 0) tabopt = -tabopt;
dvander@2762	3065	if (tabopt == 1) pbits[1] &= ~0x3c;
dvander@2762	3066	else if (tabopt == 2) pbits[11] &= 0x7f;
dvander@2762	3067
dvander@2762	3068	/* Add the POSIX table or its complement into the main table that is
dvander@2762	3069	being built and we are done. */
dvander@2762	3070
dvander@2762	3071	if (local_negate)
dvander@2762	3072	for (c = 0; c < 32; c++) classbits[c] \|= ~pbits[c];
dvander@2762	3073	else
dvander@2762	3074	for (c = 0; c < 32; c++) classbits[c] \|= pbits[c];
dvander@2762	3075
dvander@2762	3076	ptr = tempptr + 1;
dvander@2762	3077	class_charcount = 10; /* Set > 1; assumes more than 1 per class */
dvander@2762	3078	continue; /* End of POSIX syntax handling */
dvander@2762	3079	}
dvander@2762	3080
dvander@2762	3081	/* Backslash may introduce a single character, or it may introduce one
dvander@2762	3082	of the specials, which just set a flag. The sequence \b is a special
dvander@2762	3083	case. Inside a class (and only there) it is treated as backspace.
dvander@2762	3084	Elsewhere it marks a word boundary. Other escapes have preset maps ready
dvander@2762	3085	to 'or' into the one we are building. We assume they have more than one
dvander@2762	3086	character in them, so set class_charcount bigger than one. */
dvander@2762	3087
dvander@2762	3088	if (c == CHAR_BACKSLASH)
dvander@2762	3089	{
dvander@2762	3090	c = check_escape(&ptr, errorcodeptr, cd->bracount, options, TRUE);
dvander@2762	3091	if (*errorcodeptr != 0) goto FAILED;
dvander@2762	3092
dvander@2762	3093	if (-c == ESC_b) c = CHAR_BS; /* \b is backspace in a class */
dvander@2762	3094	else if (-c == ESC_X) c = CHAR_X; /* \X is literal X in a class */
dvander@2762	3095	else if (-c == ESC_R) c = CHAR_R; /* \R is literal R in a class */
dvander@2762	3096	else if (-c == ESC_Q) /* Handle start of quoted string */
dvander@2762	3097	{
dvander@2762	3098	if (ptr[1] == CHAR_BACKSLASH && ptr[2] == CHAR_E)
dvander@2762	3099	{
dvander@2762	3100	ptr += 2; /* avoid empty string */
dvander@2762	3101	}
dvander@2762	3102	else inescq = TRUE;
dvander@2762	3103	continue;
dvander@2762	3104	}
dvander@2762	3105	else if (-c == ESC_E) continue; /* Ignore orphan \E */
dvander@2762	3106
dvander@2762	3107	if (c < 0)
dvander@2762	3108	{
dvander@2762	3109	register const uschar *cbits = cd->cbits;
dvander@2762	3110	class_charcount += 2; /* Greater than 1 is what matters */
dvander@2762	3111
dvander@2762	3112	/* Save time by not doing this in the pre-compile phase. */
dvander@2762	3113
dvander@2762	3114	if (lengthptr == NULL) switch (-c)
dvander@2762	3115	{
dvander@2762	3116	case ESC_d:
dvander@2762	3117	for (c = 0; c < 32; c++) classbits[c] \|= cbits[c+cbit_digit];
dvander@2762	3118	continue;
dvander@2762	3119
dvander@2762	3120	case ESC_D:
dvander@2762	3121	should_flip_negation = TRUE;
dvander@2762	3122	for (c = 0; c < 32; c++) classbits[c] \|= ~cbits[c+cbit_digit];
dvander@2762	3123	continue;
dvander@2762	3124
dvander@2762	3125	case ESC_w:
dvander@2762	3126	for (c = 0; c < 32; c++) classbits[c] \|= cbits[c+cbit_word];
dvander@2762	3127	continue;
dvander@2762	3128
dvander@2762	3129	case ESC_W:
dvander@2762	3130	should_flip_negation = TRUE;
dvander@2762	3131	for (c = 0; c < 32; c++) classbits[c] \|= ~cbits[c+cbit_word];
dvander@2762	3132	continue;
dvander@2762	3133
dvander@2762	3134	case ESC_s:
dvander@2762	3135	for (c = 0; c < 32; c++) classbits[c] \|= cbits[c+cbit_space];
dvander@2762	3136	classbits[1] &= ~0x08; /* Perl 5.004 onwards omits VT from \s */
dvander@2762	3137	continue;
dvander@2762	3138
dvander@2762	3139	case ESC_S:
dvander@2762	3140	should_flip_negation = TRUE;
dvander@2762	3141	for (c = 0; c < 32; c++) classbits[c] \|= ~cbits[c+cbit_space];
dvander@2762	3142	classbits[1] \|= 0x08; /* Perl 5.004 onwards omits VT from \s */
dvander@2762	3143	continue;
dvander@2762	3144
dvander@2762	3145	default: /* Not recognized; fall through */
dvander@2762	3146	break; /* Need "default" setting to stop compiler warning. */
dvander@2762	3147	}
dvander@2762	3148
dvander@2762	3149	/* In the pre-compile phase, just do the recognition. */
dvander@2762	3150
dvander@2762	3151	else if (c == -ESC_d \|\| c == -ESC_D \|\| c == -ESC_w \|\|
dvander@2762	3152	c == -ESC_W \|\| c == -ESC_s \|\| c == -ESC_S) continue;
dvander@2762	3153
dvander@2762	3154	/* We need to deal with \H, \h, \V, and \v in both phases because
dvander@2762	3155	they use extra memory. */
dvander@2762	3156
dvander@2762	3157	if (-c == ESC_h)
dvander@2762	3158	{
dvander@2762	3159	SETBIT(classbits, 0x09); /* VT */
dvander@2762	3160	SETBIT(classbits, 0x20); /* SPACE */
dvander@2762	3161	SETBIT(classbits, 0xa0); /* NSBP */
dvander@2762	3162	#ifdef SUPPORT_UTF8
dvander@2762	3163	if (utf8)
dvander@2762	3164	{
dvander@2762	3165	class_utf8 = TRUE;
dvander@2762	3166	*class_utf8data++ = XCL_SINGLE;
dvander@2762	3167	class_utf8data += _pcre_ord2utf8(0x1680, class_utf8data);
dvander@2762	3168	*class_utf8data++ = XCL_SINGLE;
dvander@2762	3169	class_utf8data += _pcre_ord2utf8(0x180e, class_utf8data);
dvander@2762	3170	*class_utf8data++ = XCL_RANGE;
dvander@2762	3171	class_utf8data += _pcre_ord2utf8(0x2000, class_utf8data);
dvander@2762	3172	class_utf8data += _pcre_ord2utf8(0x200A, class_utf8data);
dvander@2762	3173	*class_utf8data++ = XCL_SINGLE;
dvander@2762	3174	class_utf8data += _pcre_ord2utf8(0x202f, class_utf8data);
dvander@2762	3175	*class_utf8data++ = XCL_SINGLE;
dvander@2762	3176	class_utf8data += _pcre_ord2utf8(0x205f, class_utf8data);
dvander@2762	3177	*class_utf8data++ = XCL_SINGLE;
dvander@2762	3178	class_utf8data += _pcre_ord2utf8(0x3000, class_utf8data);
dvander@2762	3179	}
dvander@2762	3180	#endif
dvander@2762	3181	continue;
dvander@2762	3182	}
dvander@2762	3183
dvander@2762	3184	if (-c == ESC_H)
dvander@2762	3185	{
dvander@2762	3186	for (c = 0; c < 32; c++)
dvander@2762	3187	{
dvander@2762	3188	int x = 0xff;
dvander@2762	3189	switch (c)
dvander@2762	3190	{
dvander@2762	3191	case 0x09/8: x ^= 1 << (0x09%8); break;
dvander@2762	3192	case 0x20/8: x ^= 1 << (0x20%8); break;
dvander@2762	3193	case 0xa0/8: x ^= 1 << (0xa0%8); break;
dvander@2762	3194	default: break;
dvander@2762	3195	}
dvander@2762	3196	classbits[c] \|= x;
dvander@2762	3197	}
dvander@2762	3198
dvander@2762	3199	#ifdef SUPPORT_UTF8
dvander@2762	3200	if (utf8)
dvander@2762	3201	{
dvander@2762	3202	class_utf8 = TRUE;
dvander@2762	3203	*class_utf8data++ = XCL_RANGE;
dvander@2762	3204	class_utf8data += _pcre_ord2utf8(0x0100, class_utf8data);
dvander@2762	3205	class_utf8data += _pcre_ord2utf8(0x167f, class_utf8data);
dvander@2762	3206	*class_utf8data++ = XCL_RANGE;
dvander@2762	3207	class_utf8data += _pcre_ord2utf8(0x1681, class_utf8data);
dvander@2762	3208	class_utf8data += _pcre_ord2utf8(0x180d, class_utf8data);
dvander@2762	3209	*class_utf8data++ = XCL_RANGE;
dvander@2762	3210	class_utf8data += _pcre_ord2utf8(0x180f, class_utf8data);
dvander@2762	3211	class_utf8data += _pcre_ord2utf8(0x1fff, class_utf8data);
dvander@2762	3212	*class_utf8data++ = XCL_RANGE;
dvander@2762	3213	class_utf8data += _pcre_ord2utf8(0x200B, class_utf8data);
dvander@2762	3214	class_utf8data += _pcre_ord2utf8(0x202e, class_utf8data);
dvander@2762	3215	*class_utf8data++ = XCL_RANGE;
dvander@2762	3216	class_utf8data += _pcre_ord2utf8(0x2030, class_utf8data);
dvander@2762	3217	class_utf8data += _pcre_ord2utf8(0x205e, class_utf8data);
dvander@2762	3218	*class_utf8data++ = XCL_RANGE;
dvander@2762	3219	class_utf8data += _pcre_ord2utf8(0x2060, class_utf8data);
dvander@2762	3220	class_utf8data += _pcre_ord2utf8(0x2fff, class_utf8data);
dvander@2762	3221	*class_utf8data++ = XCL_RANGE;
dvander@2762	3222	class_utf8data += _pcre_ord2utf8(0x3001, class_utf8data);
dvander@2762	3223	class_utf8data += _pcre_ord2utf8(0x7fffffff, class_utf8data);
dvander@2762	3224	}
dvander@2762	3225	#endif
dvander@2762	3226	continue;
dvander@2762	3227	}
dvander@2762	3228
dvander@2762	3229	if (-c == ESC_v)
dvander@2762	3230	{
dvander@2762	3231	SETBIT(classbits, 0x0a); /* LF */
dvander@2762	3232	SETBIT(classbits, 0x0b); /* VT */
dvander@2762	3233	SETBIT(classbits, 0x0c); /* FF */
dvander@2762	3234	SETBIT(classbits, 0x0d); /* CR */
dvander@2762	3235	SETBIT(classbits, 0x85); /* NEL */
dvander@2762	3236	#ifdef SUPPORT_UTF8
dvander@2762	3237	if (utf8)
dvander@2762	3238	{
dvander@2762	3239	class_utf8 = TRUE;
dvander@2762	3240	*class_utf8data++ = XCL_RANGE;
dvander@2762	3241	class_utf8data += _pcre_ord2utf8(0x2028, class_utf8data);
dvander@2762	3242	class_utf8data += _pcre_ord2utf8(0x2029, class_utf8data);
dvander@2762	3243	}
dvander@2762	3244	#endif
dvander@2762	3245	continue;
dvander@2762	3246	}
dvander@2762	3247
dvander@2762	3248	if (-c == ESC_V)
dvander@2762	3249	{
dvander@2762	3250	for (c = 0; c < 32; c++)
dvander@2762	3251	{
dvander@2762	3252	int x = 0xff;
dvander@2762	3253	switch (c)
dvander@2762	3254	{
dvander@2762	3255	case 0x0a/8: x ^= 1 << (0x0a%8);
dvander@2762	3256	x ^= 1 << (0x0b%8);
dvander@2762	3257	x ^= 1 << (0x0c%8);
dvander@2762	3258	x ^= 1 << (0x0d%8);
dvander@2762	3259	break;
dvander@2762	3260	case 0x85/8: x ^= 1 << (0x85%8); break;
dvander@2762	3261	default: break;
dvander@2762	3262	}
dvander@2762	3263	classbits[c] \|= x;
dvander@2762	3264	}
dvander@2762	3265
dvander@2762	3266	#ifdef SUPPORT_UTF8
dvander@2762	3267	if (utf8)
dvander@2762	3268	{
dvander@2762	3269	class_utf8 = TRUE;
dvander@2762	3270	*class_utf8data++ = XCL_RANGE;
dvander@2762	3271	class_utf8data += _pcre_ord2utf8(0x0100, class_utf8data);
dvander@2762	3272	class_utf8data += _pcre_ord2utf8(0x2027, class_utf8data);
dvander@2762	3273	*class_utf8data++ = XCL_RANGE;
dvander@2762	3274	class_utf8data += _pcre_ord2utf8(0x2029, class_utf8data);
dvander@2762	3275	class_utf8data += _pcre_ord2utf8(0x7fffffff, class_utf8data);
dvander@2762	3276	}
dvander@2762	3277	#endif
dvander@2762	3278	continue;
dvander@2762	3279	}
dvander@2762	3280
dvander@2762	3281	/* We need to deal with \P and \p in both phases. */
dvander@2762	3282
dvander@2762	3283	#ifdef SUPPORT_UCP
dvander@2762	3284	if (-c == ESC_p \|\| -c == ESC_P)
dvander@2762	3285	{
dvander@2762	3286	BOOL negated;
dvander@2762	3287	int pdata;
dvander@2762	3288	int ptype = get_ucp(&ptr, &negated, &pdata, errorcodeptr);
dvander@2762	3289	if (ptype < 0) goto FAILED;
dvander@2762	3290	class_utf8 = TRUE;
dvander@2762	3291	*class_utf8data++ = ((-c == ESC_p) != negated)?
dvander@2762	3292	XCL_PROP : XCL_NOTPROP;
dvander@2762	3293	*class_utf8data++ = ptype;
dvander@2762	3294	*class_utf8data++ = pdata;
dvander@2762	3295	class_charcount -= 2; /* Not a < 256 character */
dvander@2762	3296	continue;
dvander@2762	3297	}
dvander@2762	3298	#endif
dvander@2762	3299	/* Unrecognized escapes are faulted if PCRE is running in its
dvander@2762	3300	strict mode. By default, for compatibility with Perl, they are
dvander@2762	3301	treated as literals. */
dvander@2762	3302
dvander@2762	3303	if ((options & PCRE_EXTRA) != 0)
dvander@2762	3304	{
dvander@2762	3305	*errorcodeptr = ERR7;
dvander@2762	3306	goto FAILED;
dvander@2762	3307	}
dvander@2762	3308
dvander@2762	3309	class_charcount -= 2; /* Undo the default count from above */
dvander@2762	3310	c = ptr; / Get the final character and fall through */
dvander@2762	3311	}
dvander@2762	3312
dvander@2762	3313	/* Fall through if we have a single character (c >= 0). This may be
dvander@2762	3314	greater than 256 in UTF-8 mode. */
dvander@2762	3315
dvander@2762	3316	} /* End of backslash handling */
dvander@2762	3317
dvander@2762	3318	/* A single character may be followed by '-' to form a range. However,
dvander@2762	3319	Perl does not permit ']' to be the end of the range. A '-' character
dvander@2762	3320	at the end is treated as a literal. Perl ignores orphaned \E sequences
dvander@2762	3321	entirely. The code for handling \Q and \E is messy. */
dvander@2762	3322
dvander@2762	3323	CHECK_RANGE:
dvander@2762	3324	while (ptr[1] == CHAR_BACKSLASH && ptr[2] == CHAR_E)
dvander@2762	3325	{
dvander@2762	3326	inescq = FALSE;
dvander@2762	3327	ptr += 2;
dvander@2762	3328	}
dvander@2762	3329
dvander@2762	3330	oldptr = ptr;
dvander@2762	3331
dvander@2762	3332	/* Remember \r or \n */
dvander@2762	3333
dvander@2762	3334	if (c == CHAR_CR \|\| c == CHAR_NL) cd->external_flags \|= PCRE_HASCRORLF;
dvander@2762	3335
dvander@2762	3336	/* Check for range */
dvander@2762	3337
dvander@2762	3338	if (!inescq && ptr[1] == CHAR_MINUS)
dvander@2762	3339	{
dvander@2762	3340	int d;
dvander@2762	3341	ptr += 2;
dvander@2762	3342	while (*ptr == CHAR_BACKSLASH && ptr[1] == CHAR_E) ptr += 2;
dvander@2762	3343
dvander@2762	3344	/* If we hit \Q (not followed by \E) at this point, go into escaped
dvander@2762	3345	mode. */
dvander@2762	3346
dvander@2762	3347	while (*ptr == CHAR_BACKSLASH && ptr[1] == CHAR_Q)
dvander@2762	3348	{
dvander@2762	3349	ptr += 2;
dvander@2762	3350	if (*ptr == CHAR_BACKSLASH && ptr[1] == CHAR_E)
dvander@2762	3351	{ ptr += 2; continue; }
dvander@2762	3352	inescq = TRUE;
dvander@2762	3353	break;
dvander@2762	3354	}
dvander@2762	3355
dvander@2762	3356	if (ptr == 0 \|\| (!inescq && ptr == CHAR_RIGHT_SQUARE_BRACKET))
dvander@2762	3357	{
dvander@2762	3358	ptr = oldptr;
dvander@2762	3359	goto LONE_SINGLE_CHARACTER;
dvander@2762	3360	}
dvander@2762	3361
dvander@2762	3362	#ifdef SUPPORT_UTF8
dvander@2762	3363	if (utf8)
dvander@2762	3364	{ /* Braces are required because the */
dvander@2762	3365	GETCHARLEN(d, ptr, ptr); /* macro generates multiple statements */
dvander@2762	3366	}
dvander@2762	3367	else
dvander@2762	3368	#endif
dvander@2762	3369	d = ptr; / Not UTF-8 mode */
dvander@2762	3370
dvander@2762	3371	/* The second part of a range can be a single-character escape, but
dvander@2762	3372	not any of the other escapes. Perl 5.6 treats a hyphen as a literal
dvander@2762	3373	in such circumstances. */
dvander@2762	3374
dvander@2762	3375	if (!inescq && d == CHAR_BACKSLASH)
dvander@2762	3376	{
dvander@2762	3377	d = check_escape(&ptr, errorcodeptr, cd->bracount, options, TRUE);
dvander@2762	3378	if (*errorcodeptr != 0) goto FAILED;
dvander@2762	3379
dvander@2762	3380	/* \b is backspace; \X is literal X; \R is literal R; any other
dvander@2762	3381	special means the '-' was literal */
dvander@2762	3382
dvander@2762	3383	if (d < 0)
dvander@2762	3384	{
dvander@2762	3385	if (d == -ESC_b) d = CHAR_BS;
dvander@2762	3386	else if (d == -ESC_X) d = CHAR_X;
dvander@2762	3387	else if (d == -ESC_R) d = CHAR_R; else
dvander@2762	3388	{
dvander@2762	3389	ptr = oldptr;
dvander@2762	3390	goto LONE_SINGLE_CHARACTER; /* A few lines below */
dvander@2762	3391	}
dvander@2762	3392	}
dvander@2762	3393	}
dvander@2762	3394
dvander@2762	3395	/* Check that the two values are in the correct order. Optimize
dvander@2762	3396	one-character ranges */
dvander@2762	3397
dvander@2762	3398	if (d < c)
dvander@2762	3399	{
dvander@2762	3400	*errorcodeptr = ERR8;
dvander@2762	3401	goto FAILED;
dvander@2762	3402	}
dvander@2762	3403
dvander@2762	3404	if (d == c) goto LONE_SINGLE_CHARACTER; /* A few lines below */
dvander@2762	3405
dvander@2762	3406	/* Remember \r or \n */
dvander@2762	3407
dvander@2762	3408	if (d == CHAR_CR \|\| d == CHAR_NL) cd->external_flags \|= PCRE_HASCRORLF;
dvander@2762	3409
dvander@2762	3410	/* In UTF-8 mode, if the upper limit is > 255, or > 127 for caseless
dvander@2762	3411	matching, we have to use an XCLASS with extra data items. Caseless
dvander@2762	3412	matching for characters > 127 is available only if UCP support is
dvander@2762	3413	available. */
dvander@2762	3414
dvander@2762	3415	#ifdef SUPPORT_UTF8
dvander@2762	3416	if (utf8 && (d > 255 \|\| ((options & PCRE_CASELESS) != 0 && d > 127)))
dvander@2762	3417	{
dvander@2762	3418	class_utf8 = TRUE;
dvander@2762	3419
dvander@2762	3420	/* With UCP support, we can find the other case equivalents of
dvander@2762	3421	the relevant characters. There may be several ranges. Optimize how
dvander@2762	3422	they fit with the basic range. */
dvander@2762	3423
dvander@2762	3424	#ifdef SUPPORT_UCP
dvander@2762	3425	if ((options & PCRE_CASELESS) != 0)
dvander@2762	3426	{
dvander@2762	3427	unsigned int occ, ocd;
dvander@2762	3428	unsigned int cc = c;
dvander@2762	3429	unsigned int origd = d;
dvander@2762	3430	while (get_othercase_range(&cc, origd, &occ, &ocd))
dvander@2762	3431	{
dvander@2762	3432	if (occ >= (unsigned int)c &&
dvander@2762	3433	ocd <= (unsigned int)d)
dvander@2762	3434	continue; /* Skip embedded ranges */
dvander@2762	3435
dvander@2762	3436	if (occ < (unsigned int)c &&
dvander@2762	3437	ocd >= (unsigned int)c - 1) /* Extend the basic range */
dvander@2762	3438	{ /* if there is overlap, */
dvander@2762	3439	c = occ; /* noting that if occ < c */
dvander@2762	3440	continue; /* we can't have ocd > d */
dvander@2762	3441	} /* because a subrange is */
dvander@2762	3442	if (ocd > (unsigned int)d &&
dvander@2762	3443	occ <= (unsigned int)d + 1) /* always shorter than */
dvander@2762	3444	{ /* the basic range. */
dvander@2762	3445	d = ocd;
dvander@2762	3446	continue;
dvander@2762	3447	}
dvander@2762	3448
dvander@2762	3449	if (occ == ocd)
dvander@2762	3450	{
dvander@2762	3451	*class_utf8data++ = XCL_SINGLE;
dvander@2762	3452	}
dvander@2762	3453	else
dvander@2762	3454	{
dvander@2762	3455	*class_utf8data++ = XCL_RANGE;
dvander@2762	3456	class_utf8data += _pcre_ord2utf8(occ, class_utf8data);
dvander@2762	3457	}
dvander@2762	3458	class_utf8data += _pcre_ord2utf8(ocd, class_utf8data);
dvander@2762	3459	}
dvander@2762	3460	}
dvander@2762	3461	#endif /* SUPPORT_UCP */
dvander@2762	3462
dvander@2762	3463	/* Now record the original range, possibly modified for UCP caseless
dvander@2762	3464	overlapping ranges. */
dvander@2762	3465
dvander@2762	3466	*class_utf8data++ = XCL_RANGE;
dvander@2762	3467	class_utf8data += _pcre_ord2utf8(c, class_utf8data);
dvander@2762	3468	class_utf8data += _pcre_ord2utf8(d, class_utf8data);
dvander@2762	3469
dvander@2762	3470	/* With UCP support, we are done. Without UCP support, there is no
dvander@2762	3471	caseless matching for UTF-8 characters > 127; we can use the bit map
dvander@2762	3472	for the smaller ones. */
dvander@2762	3473
dvander@2762	3474	#ifdef SUPPORT_UCP
dvander@2762	3475	continue; /* With next character in the class */
dvander@2762	3476	#else
dvander@2762	3477	if ((options & PCRE_CASELESS) == 0 \|\| c > 127) continue;
dvander@2762	3478
dvander@2762	3479	/* Adjust upper limit and fall through to set up the map */
dvander@2762	3480
dvander@2762	3481	d = 127;
dvander@2762	3482
dvander@2762	3483	#endif /* SUPPORT_UCP */
dvander@2762	3484	}
dvander@2762	3485	#endif /* SUPPORT_UTF8 */
dvander@2762	3486
dvander@2762	3487	/* We use the bit map for all cases when not in UTF-8 mode; else
dvander@2762	3488	ranges that lie entirely within 0-127 when there is UCP support; else
dvander@2762	3489	for partial ranges without UCP support. */
dvander@2762	3490
dvander@2762	3491	class_charcount += d - c + 1;
dvander@2762	3492	class_lastchar = d;
dvander@2762	3493
dvander@2762	3494	/* We can save a bit of time by skipping this in the pre-compile. */
dvander@2762	3495
dvander@2762	3496	if (lengthptr == NULL) for (; c <= d; c++)
dvander@2762	3497	{
dvander@2762	3498	classbits[c/8] \|= (1 << (c&7));
dvander@2762	3499	if ((options & PCRE_CASELESS) != 0)
dvander@2762	3500	{
dvander@2762	3501	int uc = cd->fcc[c]; /* flip case */
dvander@2762	3502	classbits[uc/8] \|= (1 << (uc&7));
dvander@2762	3503	}
dvander@2762	3504	}
dvander@2762	3505
dvander@2762	3506	continue; /* Go get the next char in the class */
dvander@2762	3507	}
dvander@2762	3508
dvander@2762	3509	/* Handle a lone single character - we can get here for a normal
dvander@2762	3510	non-escape char, or after \ that introduces a single character or for an
dvander@2762	3511	apparent range that isn't. */
dvander@2762	3512
dvander@2762	3513	LONE_SINGLE_CHARACTER:
dvander@2762	3514
dvander@2762	3515	/* Handle a character that cannot go in the bit map */
dvander@2762	3516
dvander@2762	3517	#ifdef SUPPORT_UTF8
dvander@2762	3518	if (utf8 && (c > 255 \|\| ((options & PCRE_CASELESS) != 0 && c > 127)))
dvander@2762	3519	{
dvander@2762	3520	class_utf8 = TRUE;
dvander@2762	3521	*class_utf8data++ = XCL_SINGLE;
dvander@2762	3522	class_utf8data += _pcre_ord2utf8(c, class_utf8data);
dvander@2762	3523
dvander@2762	3524	#ifdef SUPPORT_UCP
dvander@2762	3525	if ((options & PCRE_CASELESS) != 0)
dvander@2762	3526	{
dvander@2762	3527	unsigned int othercase;
dvander@2762	3528	if ((othercase = UCD_OTHERCASE(c)) != c)
dvander@2762	3529	{
dvander@2762	3530	*class_utf8data++ = XCL_SINGLE;
dvander@2762	3531	class_utf8data += _pcre_ord2utf8(othercase, class_utf8data);
dvander@2762	3532	}
dvander@2762	3533	}
dvander@2762	3534	#endif /* SUPPORT_UCP */
dvander@2762	3535
dvander@2762	3536	}
dvander@2762	3537	else
dvander@2762	3538	#endif /* SUPPORT_UTF8 */
dvander@2762	3539
dvander@2762	3540	/* Handle a single-byte character */
dvander@2762	3541	{
dvander@2762	3542	classbits[c/8] \|= (1 << (c&7));
dvander@2762	3543	if ((options & PCRE_CASELESS) != 0)
dvander@2762	3544	{
dvander@2762	3545	c = cd->fcc[c]; /* flip case */
dvander@2762	3546	classbits[c/8] \|= (1 << (c&7));
dvander@2762	3547	}
dvander@2762	3548	class_charcount++;
dvander@2762	3549	class_lastchar = c;
dvander@2762	3550	}
dvander@2762	3551	}
dvander@2762	3552
dvander@2762	3553	/* Loop until ']' reached. This "while" is the end of the "do" above. */
dvander@2762	3554
dvander@2762	3555	while ((c = *(++ptr)) != 0 && (c != CHAR_RIGHT_SQUARE_BRACKET \|\| inescq));
dvander@2762	3556
dvander@2762	3557	if (c == 0) /* Missing terminating ']' */
dvander@2762	3558	{
dvander@2762	3559	*errorcodeptr = ERR6;
dvander@2762	3560	goto FAILED;
dvander@2762	3561	}
dvander@2762	3562
dvander@2762	3563
dvander@2762	3564	/* This code has been disabled because it would mean that \s counts as
dvander@2762	3565	an explicit \r or \n reference, and that's not really what is wanted. Now
dvander@2762	3566	we set the flag only if there is a literal "\r" or "\n" in the class. */
dvander@2762	3567
dvander@2762	3568	#if 0
dvander@2762	3569	/* Remember whether \r or \n are in this class */
dvander@2762	3570
dvander@2762	3571	if (negate_class)
dvander@2762	3572	{
dvander@2762	3573	if ((classbits[1] & 0x24) != 0x24) cd->external_flags \|= PCRE_HASCRORLF;
dvander@2762	3574	}
dvander@2762	3575	else
dvander@2762	3576	{
dvander@2762	3577	if ((classbits[1] & 0x24) != 0) cd->external_flags \|= PCRE_HASCRORLF;
dvander@2762	3578	}
dvander@2762	3579	#endif
dvander@2762	3580
dvander@2762	3581
dvander@2762	3582	/* If class_charcount is 1, we saw precisely one character whose value is
dvander@2762	3583	less than 256. As long as there were no characters >= 128 and there was no
dvander@2762	3584	use of \p or \P, in other words, no use of any XCLASS features, we can
dvander@2762	3585	optimize.
dvander@2762	3586
dvander@2762	3587	In UTF-8 mode, we can optimize the negative case only if there were no
dvander@2762	3588	characters >= 128 because OP_NOT and the related opcodes like OP_NOTSTAR
dvander@2762	3589	operate on single-bytes only. This is an historical hangover. Maybe one day
dvander@2762	3590	we can tidy these opcodes to handle multi-byte characters.
dvander@2762	3591
dvander@2762	3592	The optimization throws away the bit map. We turn the item into a
dvander@2762	3593	1-character OP_CHAR[NC] if it's positive, or OP_NOT if it's negative. Note
dvander@2762	3594	that OP_NOT does not support multibyte characters. In the positive case, it
dvander@2762	3595	can cause firstbyte to be set. Otherwise, there can be no first char if
dvander@2762	3596	this item is first, whatever repeat count may follow. In the case of
dvander@2762	3597	reqbyte, save the previous value for reinstating. */
dvander@2762	3598
dvander@2762	3599	#ifdef SUPPORT_UTF8
dvander@2762	3600	if (class_charcount == 1 && !class_utf8 &&
dvander@2762	3601	(!utf8 \|\| !negate_class \|\| class_lastchar < 128))
dvander@2762	3602	#else
dvander@2762	3603	if (class_charcount == 1)
dvander@2762	3604	#endif
dvander@2762	3605	{
dvander@2762	3606	zeroreqbyte = reqbyte;
dvander@2762	3607
dvander@2762	3608	/* The OP_NOT opcode works on one-byte characters only. */
dvander@2762	3609
dvander@2762	3610	if (negate_class)
dvander@2762	3611	{
dvander@2762	3612	if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
dvander@2762	3613	zerofirstbyte = firstbyte;
dvander@2762	3614	*code++ = OP_NOT;
dvander@2762	3615	*code++ = class_lastchar;
dvander@2762	3616	break;
dvander@2762	3617	}
dvander@2762	3618
dvander@2762	3619	/* For a single, positive character, get the value into mcbuffer, and
dvander@2762	3620	then we can handle this with the normal one-character code. */
dvander@2762	3621
dvander@2762	3622	#ifdef SUPPORT_UTF8
dvander@2762	3623	if (utf8 && class_lastchar > 127)
dvander@2762	3624	mclength = _pcre_ord2utf8(class_lastchar, mcbuffer);
dvander@2762	3625	else
dvander@2762	3626	#endif
dvander@2762	3627	{
dvander@2762	3628	mcbuffer[0] = class_lastchar;
dvander@2762	3629	mclength = 1;
dvander@2762	3630	}
dvander@2762	3631	goto ONE_CHAR;
dvander@2762	3632	} /* End of 1-char optimization */
dvander@2762	3633
dvander@2762	3634	/* The general case - not the one-char optimization. If this is the first
dvander@2762	3635	thing in the branch, there can be no first char setting, whatever the
dvander@2762	3636	repeat count. Any reqbyte setting must remain unchanged after any kind of
dvander@2762	3637	repeat. */
dvander@2762	3638
dvander@2762	3639	if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
dvander@2762	3640	zerofirstbyte = firstbyte;
dvander@2762	3641	zeroreqbyte = reqbyte;
dvander@2762	3642
dvander@2762	3643	/* If there are characters with values > 255, we have to compile an
dvander@2762	3644	extended class, with its own opcode, unless there was a negated special
dvander@2762	3645	such as \S in the class, because in that case all characters > 255 are in
dvander@2762	3646	the class, so any that were explicitly given as well can be ignored. If
dvander@2762	3647	(when there are explicit characters > 255 that must be listed) there are no
dvander@2762	3648	characters < 256, we can omit the bitmap in the actual compiled code. */
dvander@2762	3649
dvander@2762	3650	#ifdef SUPPORT_UTF8
dvander@2762	3651	if (class_utf8 && !should_flip_negation)
dvander@2762	3652	{
dvander@2762	3653	class_utf8data++ = XCL_END; / Marks the end of extra data */
dvander@2762	3654	*code++ = OP_XCLASS;
dvander@2762	3655	code += LINK_SIZE;
dvander@2762	3656	*code = negate_class? XCL_NOT : 0;
dvander@2762	3657
dvander@2762	3658	/* If the map is required, move up the extra data to make room for it;
dvander@2762	3659	otherwise just move the code pointer to the end of the extra data. */
dvander@2762	3660
dvander@2762	3661	if (class_charcount > 0)
dvander@2762	3662	{
dvander@2762	3663	*code++ \|= XCL_MAP;
dvander@2762	3664	memmove(code + 32, code, class_utf8data - code);
dvander@2762	3665	memcpy(code, classbits, 32);
dvander@2762	3666	code = class_utf8data + 32;
dvander@2762	3667	}
dvander@2762	3668	else code = class_utf8data;
dvander@2762	3669
dvander@2762	3670	/* Now fill in the complete length of the item */
dvander@2762	3671
dvander@2762	3672	PUT(previous, 1, code - previous);
dvander@2762	3673	break; /* End of class handling */
dvander@2762	3674	}
dvander@2762	3675	#endif
dvander@2762	3676
dvander@2762	3677	/* If there are no characters > 255, set the opcode to OP_CLASS or
dvander@2762	3678	OP_NCLASS, depending on whether the whole class was negated and whether
dvander@2762	3679	there were negative specials such as \S in the class. Then copy the 32-byte
dvander@2762	3680	map into the code vector, negating it if necessary. */
dvander@2762	3681
dvander@2762	3682	*code++ = (negate_class == should_flip_negation) ? OP_CLASS : OP_NCLASS;
dvander@2762	3683	if (negate_class)
dvander@2762	3684	{
dvander@2762	3685	if (lengthptr == NULL) /* Save time in the pre-compile phase */
dvander@2762	3686	for (c = 0; c < 32; c++) code[c] = ~classbits[c];
dvander@2762	3687	}
dvander@2762	3688	else
dvander@2762	3689	{
dvander@2762	3690	memcpy(code, classbits, 32);
dvander@2762	3691	}
dvander@2762	3692	code += 32;
dvander@2762	3693	break;
dvander@2762	3694
dvander@2762	3695
dvander@2762	3696	/* ===================================================================*/
dvander@2762	3697	/* Various kinds of repeat; '{' is not necessarily a quantifier, but this
dvander@2762	3698	has been tested above. */
dvander@2762	3699
dvander@2762	3700	case CHAR_LEFT_CURLY_BRACKET:
dvander@2762	3701	if (!is_quantifier) goto NORMAL_CHAR;
dvander@2762	3702	ptr = read_repeat_counts(ptr+1, &repeat_min, &repeat_max, errorcodeptr);
dvander@2762	3703	if (*errorcodeptr != 0) goto FAILED;
dvander@2762	3704	goto REPEAT;
dvander@2762	3705
dvander@2762	3706	case CHAR_ASTERISK:
dvander@2762	3707	repeat_min = 0;
dvander@2762	3708	repeat_max = -1;
dvander@2762	3709	goto REPEAT;
dvander@2762	3710
dvander@2762	3711	case CHAR_PLUS:
dvander@2762	3712	repeat_min = 1;
dvander@2762	3713	repeat_max = -1;
dvander@2762	3714	goto REPEAT;
dvander@2762	3715
dvander@2762	3716	case CHAR_QUESTION_MARK:
dvander@2762	3717	repeat_min = 0;
dvander@2762	3718	repeat_max = 1;
dvander@2762	3719
dvander@2762	3720	REPEAT:
dvander@2762	3721	if (previous == NULL)
dvander@2762	3722	{
dvander@2762	3723	*errorcodeptr = ERR9;
dvander@2762	3724	goto FAILED;
dvander@2762	3725	}
dvander@2762	3726
dvander@2762	3727	if (repeat_min == 0)
dvander@2762	3728	{
dvander@2762	3729	firstbyte = zerofirstbyte; /* Adjust for zero repeat */
dvander@2762	3730	reqbyte = zeroreqbyte; /* Ditto */
dvander@2762	3731	}
dvander@2762	3732
dvander@2762	3733	/* Remember whether this is a variable length repeat */
dvander@2762	3734
dvander@2762	3735	reqvary = (repeat_min == repeat_max)? 0 : REQ_VARY;
dvander@2762	3736
dvander@2762	3737	op_type = 0; /* Default single-char op codes */
dvander@2762	3738	possessive_quantifier = FALSE; /* Default not possessive quantifier */
dvander@2762	3739
dvander@2762	3740	/* Save start of previous item, in case we have to move it up to make space
dvander@2762	3741	for an inserted OP_ONCE for the additional '+' extension. */
dvander@2762	3742
dvander@2762	3743	tempcode = previous;
dvander@2762	3744
dvander@2762	3745	/* If the next character is '+', we have a possessive quantifier. This
dvander@2762	3746	implies greediness, whatever the setting of the PCRE_UNGREEDY option.
dvander@2762	3747	If the next character is '?' this is a minimizing repeat, by default,
dvander@2762	3748	but if PCRE_UNGREEDY is set, it works the other way round. We change the
dvander@2762	3749	repeat type to the non-default. */
dvander@2762	3750
dvander@2762	3751	if (ptr[1] == CHAR_PLUS)
dvander@2762	3752	{
dvander@2762	3753	repeat_type = 0; /* Force greedy */
dvander@2762	3754	possessive_quantifier = TRUE;
dvander@2762	3755	ptr++;
dvander@2762	3756	}
dvander@2762	3757	else if (ptr[1] == CHAR_QUESTION_MARK)
dvander@2762	3758	{
dvander@2762	3759	repeat_type = greedy_non_default;
dvander@2762	3760	ptr++;
dvander@2762	3761	}
dvander@2762	3762	else repeat_type = greedy_default;
dvander@2762	3763
dvander@2762	3764	/* If previous was a character match, abolish the item and generate a
dvander@2762	3765	repeat item instead. If a char item has a minumum of more than one, ensure
dvander@2762	3766	that it is set in reqbyte - it might not be if a sequence such as x{3} is
dvander@2762	3767	the first thing in a branch because the x will have gone into firstbyte
dvander@2762	3768	instead. */
dvander@2762	3769
dvander@2762	3770	if (previous == OP_CHAR \|\| previous == OP_CHARNC)
dvander@2762	3771	{
dvander@2762	3772	/* Deal with UTF-8 characters that take up more than one byte. It's
dvander@2762	3773	easier to write this out separately than try to macrify it. Use c to
dvander@2762	3774	hold the length of the character in bytes, plus 0x80 to flag that it's a
dvander@2762	3775	length rather than a small character. */
dvander@2762	3776
dvander@2762	3777	#ifdef SUPPORT_UTF8
dvander@2762	3778	if (utf8 && (code[-1] & 0x80) != 0)
dvander@2762	3779	{
dvander@2762	3780	uschar *lastchar = code - 1;
dvander@2762	3781	while((*lastchar & 0xc0) == 0x80) lastchar--;
dvander@2762	3782	c = code - lastchar; /* Length of UTF-8 character */
dvander@2762	3783	memcpy(utf8_char, lastchar, c); /* Save the char */
dvander@2762	3784	c \|= 0x80; /* Flag c as a length */
dvander@2762	3785	}
dvander@2762	3786	else
dvander@2762	3787	#endif
dvander@2762	3788
dvander@2762	3789	/* Handle the case of a single byte - either with no UTF8 support, or
dvander@2762	3790	with UTF-8 disabled, or for a UTF-8 character < 128. */
dvander@2762	3791
dvander@2762	3792	{
dvander@2762	3793	c = code[-1];
dvander@2762	3794	if (repeat_min > 1) reqbyte = c \| req_caseopt \| cd->req_varyopt;
dvander@2762	3795	}
dvander@2762	3796
dvander@2762	3797	/* If the repetition is unlimited, it pays to see if the next thing on
dvander@2762	3798	the line is something that cannot possibly match this character. If so,
dvander@2762	3799	automatically possessifying this item gains some performance in the case
dvander@2762	3800	where the match fails. */
dvander@2762	3801
dvander@2762	3802	if (!possessive_quantifier &&
dvander@2762	3803	repeat_max < 0 &&
dvander@2762	3804	check_auto_possessive(*previous, c, utf8, utf8_char, ptr + 1,
dvander@2762	3805	options, cd))
dvander@2762	3806	{
dvander@2762	3807	repeat_type = 0; /* Force greedy */
dvander@2762	3808	possessive_quantifier = TRUE;
dvander@2762	3809	}
dvander@2762	3810
dvander@2762	3811	goto OUTPUT_SINGLE_REPEAT; /* Code shared with single character types */
dvander@2762	3812	}
dvander@2762	3813
dvander@2762	3814	/* If previous was a single negated character ([^a] or similar), we use
dvander@2762	3815	one of the special opcodes, replacing it. The code is shared with single-
dvander@2762	3816	character repeats by setting opt_type to add a suitable offset into
dvander@2762	3817	repeat_type. We can also test for auto-possessification. OP_NOT is
dvander@2762	3818	currently used only for single-byte chars. */
dvander@2762	3819
dvander@2762	3820	else if (*previous == OP_NOT)
dvander@2762	3821	{
dvander@2762	3822	op_type = OP_NOTSTAR - OP_STAR; /* Use "not" opcodes */
dvander@2762	3823	c = previous[1];
dvander@2762	3824	if (!possessive_quantifier &&
dvander@2762	3825	repeat_max < 0 &&
dvander@2762	3826	check_auto_possessive(OP_NOT, c, utf8, NULL, ptr + 1, options, cd))
dvander@2762	3827	{
dvander@2762	3828	repeat_type = 0; /* Force greedy */
dvander@2762	3829	possessive_quantifier = TRUE;
dvander@2762	3830	}
dvander@2762	3831	goto OUTPUT_SINGLE_REPEAT;
dvander@2762	3832	}
dvander@2762	3833
dvander@2762	3834	/* If previous was a character type match (\d or similar), abolish it and
dvander@2762	3835	create a suitable repeat item. The code is shared with single-character
dvander@2762	3836	repeats by setting op_type to add a suitable offset into repeat_type. Note
dvander@2762	3837	the the Unicode property types will be present only when SUPPORT_UCP is
dvander@2762	3838	defined, but we don't wrap the little bits of code here because it just
dvander@2762	3839	makes it horribly messy. */
dvander@2762	3840
dvander@2762	3841	else if (*previous < OP_EODN)
dvander@2762	3842	{
dvander@2762	3843	uschar *oldcode;
dvander@2762	3844	int prop_type, prop_value;
dvander@2762	3845	op_type = OP_TYPESTAR - OP_STAR; /* Use type opcodes */
dvander@2762	3846	c = *previous;
dvander@2762	3847
dvander@2762	3848	if (!possessive_quantifier &&
dvander@2762	3849	repeat_max < 0 &&
dvander@2762	3850	check_auto_possessive(c, 0, utf8, NULL, ptr + 1, options, cd))
dvander@2762	3851	{
dvander@2762	3852	repeat_type = 0; /* Force greedy */
dvander@2762	3853	possessive_quantifier = TRUE;
dvander@2762	3854	}
dvander@2762	3855
dvander@2762	3856	OUTPUT_SINGLE_REPEAT:
dvander@2762	3857	if (previous == OP_PROP \|\| previous == OP_NOTPROP)
dvander@2762	3858	{
dvander@2762	3859	prop_type = previous[1];
dvander@2762	3860	prop_value = previous[2];
dvander@2762	3861	}
dvander@2762	3862	else prop_type = prop_value = -1;
dvander@2762	3863
dvander@2762	3864	oldcode = code;
dvander@2762	3865	code = previous; /* Usually overwrite previous item */
dvander@2762	3866
dvander@2762	3867	/* If the maximum is zero then the minimum must also be zero; Perl allows
dvander@2762	3868	this case, so we do too - by simply omitting the item altogether. */
dvander@2762	3869
dvander@2762	3870	if (repeat_max == 0) goto END_REPEAT;
dvander@2762	3871
dvander@2762	3872	/* All real repeats make it impossible to handle partial matching (maybe
dvander@2762	3873	one day we will be able to remove this restriction). */
dvander@2762	3874
dvander@2762	3875	if (repeat_max != 1) cd->external_flags \|= PCRE_NOPARTIAL;
dvander@2762	3876
dvander@2762	3877	/* Combine the op_type with the repeat_type */
dvander@2762	3878
dvander@2762	3879	repeat_type += op_type;
dvander@2762	3880
dvander@2762	3881	/* A minimum of zero is handled either as the special case * or ?, or as
dvander@2762	3882	an UPTO, with the maximum given. */
dvander@2762	3883
dvander@2762	3884	if (repeat_min == 0)
dvander@2762	3885	{
dvander@2762	3886	if (repeat_max == -1) *code++ = OP_STAR + repeat_type;
dvander@2762	3887	else if (repeat_max == 1) *code++ = OP_QUERY + repeat_type;
dvander@2762	3888	else
dvander@2762	3889	{
dvander@2762	3890	*code++ = OP_UPTO + repeat_type;
dvander@2762	3891	PUT2INC(code, 0, repeat_max);
dvander@2762	3892	}
dvander@2762	3893	}
dvander@2762	3894
dvander@2762	3895	/* A repeat minimum of 1 is optimized into some special cases. If the
dvander@2762	3896	maximum is unlimited, we use OP_PLUS. Otherwise, the original item is
dvander@2762	3897	left in place and, if the maximum is greater than 1, we use OP_UPTO with
dvander@2762	3898	one less than the maximum. */
dvander@2762	3899
dvander@2762	3900	else if (repeat_min == 1)
dvander@2762	3901	{
dvander@2762	3902	if (repeat_max == -1)
dvander@2762	3903	*code++ = OP_PLUS + repeat_type;
dvander@2762	3904	else
dvander@2762	3905	{
dvander@2762	3906	code = oldcode; /* leave previous item in place */
dvander@2762	3907	if (repeat_max == 1) goto END_REPEAT;
dvander@2762	3908	*code++ = OP_UPTO + repeat_type;
dvander@2762	3909	PUT2INC(code, 0, repeat_max - 1);
dvander@2762	3910	}
dvander@2762	3911	}
dvander@2762	3912
dvander@2762	3913	/* The case {n,n} is just an EXACT, while the general case {n,m} is
dvander@2762	3914	handled as an EXACT followed by an UPTO. */
dvander@2762	3915
dvander@2762	3916	else
dvander@2762	3917	{
dvander@2762	3918	code++ = OP_EXACT + op_type; / NB EXACT doesn't have repeat_type */
dvander@2762	3919	PUT2INC(code, 0, repeat_min);
dvander@2762	3920
dvander@2762	3921	/* If the maximum is unlimited, insert an OP_STAR. Before doing so,
dvander@2762	3922	we have to insert the character for the previous code. For a repeated
dvander@2762	3923	Unicode property match, there are two extra bytes that define the
dvander@2762	3924	required property. In UTF-8 mode, long characters have their length in
dvander@2762	3925	c, with the 0x80 bit as a flag. */
dvander@2762	3926
dvander@2762	3927	if (repeat_max < 0)
dvander@2762	3928	{
dvander@2762	3929	#ifdef SUPPORT_UTF8
dvander@2762	3930	if (utf8 && c >= 128)
dvander@2762	3931	{
dvander@2762	3932	memcpy(code, utf8_char, c & 7);
dvander@2762	3933	code += c & 7;
dvander@2762	3934	}
dvander@2762	3935	else
dvander@2762	3936	#endif
dvander@2762	3937	{
dvander@2762	3938	*code++ = c;
dvander@2762	3939	if (prop_type >= 0)
dvander@2762	3940	{
dvander@2762	3941	*code++ = prop_type;
dvander@2762	3942	*code++ = prop_value;
dvander@2762	3943	}
dvander@2762	3944	}
dvander@2762	3945	*code++ = OP_STAR + repeat_type;
dvander@2762	3946	}
dvander@2762	3947
dvander@2762	3948	/* Else insert an UPTO if the max is greater than the min, again
dvander@2762	3949	preceded by the character, for the previously inserted code. If the
dvander@2762	3950	UPTO is just for 1 instance, we can use QUERY instead. */
dvander@2762	3951
dvander@2762	3952	else if (repeat_max != repeat_min)
dvander@2762	3953	{
dvander@2762	3954	#ifdef SUPPORT_UTF8
dvander@2762	3955	if (utf8 && c >= 128)
dvander@2762	3956	{
dvander@2762	3957	memcpy(code, utf8_char, c & 7);
dvander@2762	3958	code += c & 7;
dvander@2762	3959	}
dvander@2762	3960	else
dvander@2762	3961	#endif
dvander@2762	3962	*code++ = c;
dvander@2762	3963	if (prop_type >= 0)
dvander@2762	3964	{
dvander@2762	3965	*code++ = prop_type;
dvander@2762	3966	*code++ = prop_value;
dvander@2762	3967	}
dvander@2762	3968	repeat_max -= repeat_min;
dvander@2762	3969
dvander@2762	3970	if (repeat_max == 1)
dvander@2762	3971	{
dvander@2762	3972	*code++ = OP_QUERY + repeat_type;
dvander@2762	3973	}
dvander@2762	3974	else
dvander@2762	3975	{
dvander@2762	3976	*code++ = OP_UPTO + repeat_type;
dvander@2762	3977	PUT2INC(code, 0, repeat_max);
dvander@2762	3978	}
dvander@2762	3979	}
dvander@2762	3980	}
dvander@2762	3981
dvander@2762	3982	/* The character or character type itself comes last in all cases. */
dvander@2762	3983
dvander@2762	3984	#ifdef SUPPORT_UTF8
dvander@2762	3985	if (utf8 && c >= 128)
dvander@2762	3986	{
dvander@2762	3987	memcpy(code, utf8_char, c & 7);
dvander@2762	3988	code += c & 7;
dvander@2762	3989	}
dvander@2762	3990	else
dvander@2762	3991	#endif
dvander@2762	3992	*code++ = c;
dvander@2762	3993
dvander@2762	3994	/* For a repeated Unicode property match, there are two extra bytes that
dvander@2762	3995	define the required property. */
dvander@2762	3996
dvander@2762	3997	#ifdef SUPPORT_UCP
dvander@2762	3998	if (prop_type >= 0)
dvander@2762	3999	{
dvander@2762	4000	*code++ = prop_type;
dvander@2762	4001	*code++ = prop_value;
dvander@2762	4002	}
dvander@2762	4003	#endif
dvander@2762	4004	}
dvander@2762	4005
dvander@2762	4006	/* If previous was a character class or a back reference, we put the repeat
dvander@2762	4007	stuff after it, but just skip the item if the repeat was {0,0}. */
dvander@2762	4008
dvander@2762	4009	else if (*previous == OP_CLASS \|\|
dvander@2762	4010	*previous == OP_NCLASS \|\|
dvander@2762	4011	#ifdef SUPPORT_UTF8
dvander@2762	4012	*previous == OP_XCLASS \|\|
dvander@2762	4013	#endif
dvander@2762	4014	*previous == OP_REF)
dvander@2762	4015	{
dvander@2762	4016	if (repeat_max == 0)
dvander@2762	4017	{
dvander@2762	4018	code = previous;
dvander@2762	4019	goto END_REPEAT;
dvander@2762	4020	}
dvander@2762	4021
dvander@2762	4022	/* All real repeats make it impossible to handle partial matching (maybe
dvander@2762	4023	one day we will be able to remove this restriction). */
dvander@2762	4024
dvander@2762	4025	if (repeat_max != 1) cd->external_flags \|= PCRE_NOPARTIAL;
dvander@2762	4026
dvander@2762	4027	if (repeat_min == 0 && repeat_max == -1)
dvander@2762	4028	*code++ = OP_CRSTAR + repeat_type;
dvander@2762	4029	else if (repeat_min == 1 && repeat_max == -1)
dvander@2762	4030	*code++ = OP_CRPLUS + repeat_type;
dvander@2762	4031	else if (repeat_min == 0 && repeat_max == 1)
dvander@2762	4032	*code++ = OP_CRQUERY + repeat_type;
dvander@2762	4033	else
dvander@2762	4034	{
dvander@2762	4035	*code++ = OP_CRRANGE + repeat_type;
dvander@2762	4036	PUT2INC(code, 0, repeat_min);
dvander@2762	4037	if (repeat_max == -1) repeat_max = 0; /* 2-byte encoding for max */
dvander@2762	4038	PUT2INC(code, 0, repeat_max);
dvander@2762	4039	}
dvander@2762	4040	}
dvander@2762	4041
dvander@2762	4042	/* If previous was a bracket group, we may have to replicate it in certain
dvander@2762	4043	cases. */
dvander@2762	4044
dvander@2762	4045	else if (previous == OP_BRA \|\| previous == OP_CBRA \|\|
dvander@2762	4046	previous == OP_ONCE \|\| previous == OP_COND)
dvander@2762	4047	{
dvander@2762	4048	register int i;
dvander@2762	4049	int ketoffset = 0;
dvander@2762	4050	int len = code - previous;
dvander@2762	4051	uschar *bralink = NULL;
dvander@2762	4052
dvander@2762	4053	/* Repeating a DEFINE group is pointless */
dvander@2762	4054
dvander@2762	4055	if (*previous == OP_COND && previous[LINK_SIZE+1] == OP_DEF)
dvander@2762	4056	{
dvander@2762	4057	*errorcodeptr = ERR55;
dvander@2762	4058	goto FAILED;
dvander@2762	4059	}
dvander@2762	4060
dvander@2762	4061	/* If the maximum repeat count is unlimited, find the end of the bracket
dvander@2762	4062	by scanning through from the start, and compute the offset back to it
dvander@2762	4063	from the current code pointer. There may be an OP_OPT setting following
dvander@2762	4064	the final KET, so we can't find the end just by going back from the code
dvander@2762	4065	pointer. */
dvander@2762	4066
dvander@2762	4067	if (repeat_max == -1)
dvander@2762	4068	{
dvander@2762	4069	register uschar *ket = previous;
dvander@2762	4070	do ket += GET(ket, 1); while (*ket != OP_KET);
dvander@2762	4071	ketoffset = code - ket;
dvander@2762	4072	}
dvander@2762	4073
dvander@2762	4074	/* The case of a zero minimum is special because of the need to stick
dvander@2762	4075	OP_BRAZERO in front of it, and because the group appears once in the
dvander@2762	4076	data, whereas in other cases it appears the minimum number of times. For
dvander@2762	4077	this reason, it is simplest to treat this case separately, as otherwise
dvander@2762	4078	the code gets far too messy. There are several special subcases when the
dvander@2762	4079	minimum is zero. */
dvander@2762	4080
dvander@2762	4081	if (repeat_min == 0)
dvander@2762	4082	{
dvander@2762	4083	/* If the maximum is also zero, we used to just omit the group from the
dvander@2762	4084	output altogether, like this:
dvander@2762	4085
dvander@2762	4086	** if (repeat_max == 0)
dvander@2762	4087	** {
dvander@2762	4088	** code = previous;
dvander@2762	4089	** goto END_REPEAT;
dvander@2762	4090	** }
dvander@2762	4091
dvander@2762	4092	However, that fails when a group is referenced as a subroutine from
dvander@2762	4093	elsewhere in the pattern, so now we stick in OP_SKIPZERO in front of it
dvander@2762	4094	so that it is skipped on execution. As we don't have a list of which
dvander@2762	4095	groups are referenced, we cannot do this selectively.
dvander@2762	4096
dvander@2762	4097	If the maximum is 1 or unlimited, we just have to stick in the BRAZERO
dvander@2762	4098	and do no more at this point. However, we do need to adjust any
dvander@2762	4099	OP_RECURSE calls inside the group that refer to the group itself or any
dvander@2762	4100	internal or forward referenced group, because the offset is from the
dvander@2762	4101	start of the whole regex. Temporarily terminate the pattern while doing
dvander@2762	4102	this. */
dvander@2762	4103
dvander@2762	4104	if (repeat_max <= 1) /* Covers 0, 1, and unlimited */
dvander@2762	4105	{
dvander@2762	4106	*code = OP_END;
dvander@2762	4107	adjust_recurse(previous, 1, utf8, cd, save_hwm);
dvander@2762	4108	memmove(previous+1, previous, len);
dvander@2762	4109	code++;
dvander@2762	4110	if (repeat_max == 0)
dvander@2762	4111	{
dvander@2762	4112	*previous++ = OP_SKIPZERO;
dvander@2762	4113	goto END_REPEAT;
dvander@2762	4114	}
dvander@2762	4115	*previous++ = OP_BRAZERO + repeat_type;
dvander@2762	4116	}
dvander@2762	4117
dvander@2762	4118	/* If the maximum is greater than 1 and limited, we have to replicate
dvander@2762	4119	in a nested fashion, sticking OP_BRAZERO before each set of brackets.
dvander@2762	4120	The first one has to be handled carefully because it's the original
dvander@2762	4121	copy, which has to be moved up. The remainder can be handled by code
dvander@2762	4122	that is common with the non-zero minimum case below. We have to
dvander@2762	4123	adjust the value or repeat_max, since one less copy is required. Once
dvander@2762	4124	again, we may have to adjust any OP_RECURSE calls inside the group. */
dvander@2762	4125
dvander@2762	4126	else
dvander@2762	4127	{
dvander@2762	4128	int offset;
dvander@2762	4129	*code = OP_END;
dvander@2762	4130	adjust_recurse(previous, 2 + LINK_SIZE, utf8, cd, save_hwm);
dvander@2762	4131	memmove(previous + 2 + LINK_SIZE, previous, len);
dvander@2762	4132	code += 2 + LINK_SIZE;
dvander@2762	4133	*previous++ = OP_BRAZERO + repeat_type;
dvander@2762	4134	*previous++ = OP_BRA;
dvander@2762	4135
dvander@2762	4136	/* We chain together the bracket offset fields that have to be
dvander@2762	4137	filled in later when the ends of the brackets are reached. */
dvander@2762	4138
dvander@2762	4139	offset = (bralink == NULL)? 0 : previous - bralink;
dvander@2762	4140	bralink = previous;
dvander@2762	4141	PUTINC(previous, 0, offset);
dvander@2762	4142	}
dvander@2762	4143
dvander@2762	4144	repeat_max--;
dvander@2762	4145	}
dvander@2762	4146
dvander@2762	4147	/* If the minimum is greater than zero, replicate the group as many
dvander@2762	4148	times as necessary, and adjust the maximum to the number of subsequent
dvander@2762	4149	copies that we need. If we set a first char from the group, and didn't
dvander@2762	4150	set a required char, copy the latter from the former. If there are any
dvander@2762	4151	forward reference subroutine calls in the group, there will be entries on
dvander@2762	4152	the workspace list; replicate these with an appropriate increment. */
dvander@2762	4153
dvander@2762	4154	else
dvander@2762	4155	{
dvander@2762	4156	if (repeat_min > 1)
dvander@2762	4157	{
dvander@2762	4158	/* In the pre-compile phase, we don't actually do the replication. We
dvander@2762	4159	just adjust the length as if we had. Do some paranoid checks for
dvander@2762	4160	potential integer overflow. */
dvander@2762	4161
dvander@2762	4162	if (lengthptr != NULL)
dvander@2762	4163	{
dvander@2762	4164	int delta = (repeat_min - 1)*length_prevgroup;
dvander@2762	4165	if ((double)(repeat_min - 1)*(double)length_prevgroup >
dvander@2762	4166	(double)INT_MAX \|\|
dvander@2762	4167	OFLOW_MAX - *lengthptr < delta)
dvander@2762	4168	{
dvander@2762	4169	*errorcodeptr = ERR20;
dvander@2762	4170	goto FAILED;
dvander@2762	4171	}
dvander@2762	4172	*lengthptr += delta;
dvander@2762	4173	}
dvander@2762	4174
dvander@2762	4175	/* This is compiling for real */
dvander@2762	4176
dvander@2762	4177	else
dvander@2762	4178	{
dvander@2762	4179	if (groupsetfirstbyte && reqbyte < 0) reqbyte = firstbyte;
dvander@2762	4180	for (i = 1; i < repeat_min; i++)
dvander@2762	4181	{
dvander@2762	4182	uschar *hc;
dvander@2762	4183	uschar *this_hwm = cd->hwm;
dvander@2762	4184	memcpy(code, previous, len);
dvander@2762	4185	for (hc = save_hwm; hc < this_hwm; hc += LINK_SIZE)
dvander@2762	4186	{
dvander@2762	4187	PUT(cd->hwm, 0, GET(hc, 0) + len);
dvander@2762	4188	cd->hwm += LINK_SIZE;
dvander@2762	4189	}
dvander@2762	4190	save_hwm = this_hwm;
dvander@2762	4191	code += len;
dvander@2762	4192	}
dvander@2762	4193	}
dvander@2762	4194	}
dvander@2762	4195
dvander@2762	4196	if (repeat_max > 0) repeat_max -= repeat_min;
dvander@2762	4197	}
dvander@2762	4198
dvander@2762	4199	/* This code is common to both the zero and non-zero minimum cases. If
dvander@2762	4200	the maximum is limited, it replicates the group in a nested fashion,
dvander@2762	4201	remembering the bracket starts on a stack. In the case of a zero minimum,
dvander@2762	4202	the first one was set up above. In all cases the repeat_max now specifies
dvander@2762	4203	the number of additional copies needed. Again, we must remember to
dvander@2762	4204	replicate entries on the forward reference list. */
dvander@2762	4205
dvander@2762	4206	if (repeat_max >= 0)
dvander@2762	4207	{
dvander@2762	4208	/* In the pre-compile phase, we don't actually do the replication. We
dvander@2762	4209	just adjust the length as if we had. For each repetition we must add 1
dvander@2762	4210	to the length for BRAZERO and for all but the last repetition we must
dvander@2762	4211	add 2 + 2*LINKSIZE to allow for the nesting that occurs. Do some
dvander@2762	4212	paranoid checks to avoid integer overflow. */
dvander@2762	4213
dvander@2762	4214	if (lengthptr != NULL && repeat_max > 0)
dvander@2762	4215	{
dvander@2762	4216	int delta = repeat_max * (length_prevgroup + 1 + 2 + 2*LINK_SIZE) -
dvander@2762	4217	2 - 2LINK_SIZE; / Last one doesn't nest */
dvander@2762	4218	if ((double)repeat_max *
dvander@2762	4219	(double)(length_prevgroup + 1 + 2 + 2*LINK_SIZE)
dvander@2762	4220	> (double)INT_MAX \|\|
dvander@2762	4221	OFLOW_MAX - *lengthptr < delta)
dvander@2762	4222	{
dvander@2762	4223	*errorcodeptr = ERR20;
dvander@2762	4224	goto FAILED;
dvander@2762	4225	}
dvander@2762	4226	*lengthptr += delta;
dvander@2762	4227	}
dvander@2762	4228
dvander@2762	4229	/* This is compiling for real */
dvander@2762	4230
dvander@2762	4231	else for (i = repeat_max - 1; i >= 0; i--)
dvander@2762	4232	{
dvander@2762	4233	uschar *hc;
dvander@2762	4234	uschar *this_hwm = cd->hwm;
dvander@2762	4235
dvander@2762	4236	*code++ = OP_BRAZERO + repeat_type;
dvander@2762	4237
dvander@2762	4238	/* All but the final copy start a new nesting, maintaining the
dvander@2762	4239	chain of brackets outstanding. */
dvander@2762	4240
dvander@2762	4241	if (i != 0)
dvander@2762	4242	{
dvander@2762	4243	int offset;
dvander@2762	4244	*code++ = OP_BRA;
dvander@2762	4245	offset = (bralink == NULL)? 0 : code - bralink;
dvander@2762	4246	bralink = code;
dvander@2762	4247	PUTINC(code, 0, offset);
dvander@2762	4248	}
dvander@2762	4249
dvander@2762	4250	memcpy(code, previous, len);
dvander@2762	4251	for (hc = save_hwm; hc < this_hwm; hc += LINK_SIZE)
dvander@2762	4252	{
dvander@2762	4253	PUT(cd->hwm, 0, GET(hc, 0) + len + ((i != 0)? 2+LINK_SIZE : 1));
dvander@2762	4254	cd->hwm += LINK_SIZE;
dvander@2762	4255	}
dvander@2762	4256	save_hwm = this_hwm;
dvander@2762	4257	code += len;
dvander@2762	4258	}
dvander@2762	4259
dvander@2762	4260	/* Now chain through the pending brackets, and fill in their length
dvander@2762	4261	fields (which are holding the chain links pro tem). */
dvander@2762	4262
dvander@2762	4263	while (bralink != NULL)
dvander@2762	4264	{
dvander@2762	4265	int oldlinkoffset;
dvander@2762	4266	int offset = code - bralink + 1;
dvander@2762	4267	uschar *bra = code - offset;
dvander@2762	4268	oldlinkoffset = GET(bra, 1);
dvander@2762	4269	bralink = (oldlinkoffset == 0)? NULL : bralink - oldlinkoffset;
dvander@2762	4270	*code++ = OP_KET;
dvander@2762	4271	PUTINC(code, 0, offset);
dvander@2762	4272	PUT(bra, 1, offset);
dvander@2762	4273	}
dvander@2762	4274	}
dvander@2762	4275
dvander@2762	4276	/* If the maximum is unlimited, set a repeater in the final copy. We
dvander@2762	4277	can't just offset backwards from the current code point, because we
dvander@2762	4278	don't know if there's been an options resetting after the ket. The
dvander@2762	4279	correct offset was computed above.
dvander@2762	4280
dvander@2762	4281	Then, when we are doing the actual compile phase, check to see whether
dvander@2762	4282	this group is a non-atomic one that could match an empty string. If so,
dvander@2762	4283	convert the initial operator to the S form (e.g. OP_BRA -> OP_SBRA) so
dvander@2762	4284	that runtime checking can be done. [This check is also applied to
dvander@2762	4285	atomic groups at runtime, but in a different way.] */
dvander@2762	4286
dvander@2762	4287	else
dvander@2762	4288	{
dvander@2762	4289	uschar *ketcode = code - ketoffset;
dvander@2762	4290	uschar *bracode = ketcode - GET(ketcode, 1);
dvander@2762	4291	*ketcode = OP_KETRMAX + repeat_type;
dvander@2762	4292	if (lengthptr == NULL && *bracode != OP_ONCE)
dvander@2762	4293	{
dvander@2762	4294	uschar *scode = bracode;
dvander@2762	4295	do
dvander@2762	4296	{
dvander@2762	4297	if (could_be_empty_branch(scode, ketcode, utf8))
dvander@2762	4298	{
dvander@2762	4299	*bracode += OP_SBRA - OP_BRA;
dvander@2762	4300	break;
dvander@2762	4301	}
dvander@2762	4302	scode += GET(scode, 1);
dvander@2762	4303	}
dvander@2762	4304	while (*scode == OP_ALT);
dvander@2762	4305	}
dvander@2762	4306	}
dvander@2762	4307	}
dvander@2762	4308
dvander@2762	4309	/* If previous is OP_FAIL, it was generated by an empty class [] in
dvander@2762	4310	JavaScript mode. The other ways in which OP_FAIL can be generated, that is
dvander@2762	4311	by (*FAIL) or (?!) set previous to NULL, which gives a "nothing to repeat"
dvander@2762	4312	error above. We can just ignore the repeat in JS case. */
dvander@2762	4313
dvander@2762	4314	else if (*previous == OP_FAIL) goto END_REPEAT;
dvander@2762	4315
dvander@2762	4316	/* Else there's some kind of shambles */
dvander@2762	4317
dvander@2762	4318	else
dvander@2762	4319	{
dvander@2762	4320	*errorcodeptr = ERR11;
dvander@2762	4321	goto FAILED;
dvander@2762	4322	}
dvander@2762	4323
dvander@2762	4324	/* If the character following a repeat is '+', or if certain optimization
dvander@2762	4325	tests above succeeded, possessive_quantifier is TRUE. For some of the
dvander@2762	4326	simpler opcodes, there is an special alternative opcode for this. For
dvander@2762	4327	anything else, we wrap the entire repeated item inside OP_ONCE brackets.
dvander@2762	4328	The '+' notation is just syntactic sugar, taken from Sun's Java package,
dvander@2762	4329	but the special opcodes can optimize it a bit. The repeated item starts at
dvander@2762	4330	tempcode, not at previous, which might be the first part of a string whose
dvander@2762	4331	(former) last char we repeated.
dvander@2762	4332
dvander@2762	4333	Possessifying an 'exact' quantifier has no effect, so we can ignore it. But
dvander@2762	4334	an 'upto' may follow. We skip over an 'exact' item, and then test the
dvander@2762	4335	length of what remains before proceeding. */
dvander@2762	4336
dvander@2762	4337	if (possessive_quantifier)
dvander@2762	4338	{
dvander@2762	4339	int len;
dvander@2762	4340	if (tempcode == OP_EXACT \|\| tempcode == OP_TYPEEXACT \|\|
dvander@2762	4341	*tempcode == OP_NOTEXACT)
dvander@2762	4342	tempcode += _pcre_OP_lengths[*tempcode] +
dvander@2762	4343	((*tempcode == OP_TYPEEXACT &&
dvander@2762	4344	(tempcode[3] == OP_PROP \|\| tempcode[3] == OP_NOTPROP))? 2:0);
dvander@2762	4345	len = code - tempcode;
dvander@2762	4346	if (len > 0) switch (*tempcode)
dvander@2762	4347	{
dvander@2762	4348	case OP_STAR: *tempcode = OP_POSSTAR; break;
dvander@2762	4349	case OP_PLUS: *tempcode = OP_POSPLUS; break;
dvander@2762	4350	case OP_QUERY: *tempcode = OP_POSQUERY; break;
dvander@2762	4351	case OP_UPTO: *tempcode = OP_POSUPTO; break;
dvander@2762	4352
dvander@2762	4353	case OP_TYPESTAR: *tempcode = OP_TYPEPOSSTAR; break;
dvander@2762	4354	case OP_TYPEPLUS: *tempcode = OP_TYPEPOSPLUS; break;
dvander@2762	4355	case OP_TYPEQUERY: *tempcode = OP_TYPEPOSQUERY; break;
dvander@2762	4356	case OP_TYPEUPTO: *tempcode = OP_TYPEPOSUPTO; break;
dvander@2762	4357
dvander@2762	4358	case OP_NOTSTAR: *tempcode = OP_NOTPOSSTAR; break;
dvander@2762	4359	case OP_NOTPLUS: *tempcode = OP_NOTPOSPLUS; break;
dvander@2762	4360	case OP_NOTQUERY: *tempcode = OP_NOTPOSQUERY; break;
dvander@2762	4361	case OP_NOTUPTO: *tempcode = OP_NOTPOSUPTO; break;
dvander@2762	4362
dvander@2762	4363	default:
dvander@2762	4364	memmove(tempcode + 1+LINK_SIZE, tempcode, len);
dvander@2762	4365	code += 1 + LINK_SIZE;
dvander@2762	4366	len += 1 + LINK_SIZE;
dvander@2762	4367	tempcode[0] = OP_ONCE;
dvander@2762	4368	*code++ = OP_KET;
dvander@2762	4369	PUTINC(code, 0, len);
dvander@2762	4370	PUT(tempcode, 1, len);
dvander@2762	4371	break;
dvander@2762	4372	}
dvander@2762	4373	}
dvander@2762	4374
dvander@2762	4375	/* In all case we no longer have a previous item. We also set the
dvander@2762	4376	"follows varying string" flag for subsequently encountered reqbytes if
dvander@2762	4377	it isn't already set and we have just passed a varying length item. */
dvander@2762	4378
dvander@2762	4379	END_REPEAT:
dvander@2762	4380	previous = NULL;
dvander@2762	4381	cd->req_varyopt \|= reqvary;
dvander@2762	4382	break;
dvander@2762	4383
dvander@2762	4384
dvander@2762	4385	/* ===================================================================*/
dvander@2762	4386	/* Start of nested parenthesized sub-expression, or comment or lookahead or
dvander@2762	4387	lookbehind or option setting or condition or all the other extended
dvander@2762	4388	parenthesis forms. */
dvander@2762	4389
dvander@2762	4390	case CHAR_LEFT_PARENTHESIS:
dvander@2762	4391	newoptions = options;
dvander@2762	4392	skipbytes = 0;
dvander@2762	4393	bravalue = OP_CBRA;
dvander@2762	4394	save_hwm = cd->hwm;
dvander@2762	4395	reset_bracount = FALSE;
dvander@2762	4396
dvander@2762	4397	/* First deal with various "verbs" that can be introduced by ''. /
dvander@2762	4398
dvander@2762	4399	if (*(++ptr) == CHAR_ASTERISK && (cd->ctypes[ptr[1]] & ctype_letter) != 0)
dvander@2762	4400	{
dvander@2762	4401	int i, namelen;
dvander@2762	4402	const char *vn = verbnames;
dvander@2762	4403	const uschar *name = ++ptr;
dvander@2762	4404	previous = NULL;
dvander@2762	4405	while ((cd->ctypes[*++ptr] & ctype_letter) != 0) {};
dvander@2762	4406	if (*ptr == CHAR_COLON)
dvander@2762	4407	{
dvander@2762	4408	errorcodeptr = ERR59; / Not supported */
dvander@2762	4409	goto FAILED;
dvander@2762	4410	}
dvander@2762	4411	if (*ptr != CHAR_RIGHT_PARENTHESIS)
dvander@2762	4412	{
dvander@2762	4413	*errorcodeptr = ERR60;
dvander@2762	4414	goto FAILED;
dvander@2762	4415	}
dvander@2762	4416	namelen = ptr - name;
dvander@2762	4417	for (i = 0; i < verbcount; i++)
dvander@2762	4418	{
dvander@2762	4419	if (namelen == verbs[i].len &&
dvander@2762	4420	strncmp((char *)name, vn, namelen) == 0)
dvander@2762	4421	{
dvander@2762	4422	*code = verbs[i].op;
dvander@2762	4423	if (*code++ == OP_ACCEPT) cd->had_accept = TRUE;
dvander@2762	4424	break;
dvander@2762	4425	}
dvander@2762	4426	vn += verbs[i].len + 1;
dvander@2762	4427	}
dvander@2762	4428	if (i < verbcount) continue;
dvander@2762	4429	*errorcodeptr = ERR60;
dvander@2762	4430	goto FAILED;
dvander@2762	4431	}
dvander@2762	4432
dvander@2762	4433	/* Deal with the extended parentheses; all are introduced by '?', and the
dvander@2762	4434	appearance of any of them means that this is not a capturing group. */
dvander@2762	4435
dvander@2762	4436	else if (*ptr == CHAR_QUESTION_MARK)
dvander@2762	4437	{
dvander@2762	4438	int i, set, unset, namelen;
dvander@2762	4439	int *optset;
dvander@2762	4440	const uschar *name;
dvander@2762	4441	uschar *slot;
dvander@2762	4442
dvander@2762	4443	switch (*(++ptr))
dvander@2762	4444	{
dvander@2762	4445	case CHAR_NUMBER_SIGN: /* Comment; skip to ket */
dvander@2762	4446	ptr++;
dvander@2762	4447	while (ptr != 0 && ptr != CHAR_RIGHT_PARENTHESIS) ptr++;
dvander@2762	4448	if (*ptr == 0)
dvander@2762	4449	{
dvander@2762	4450	*errorcodeptr = ERR18;
dvander@2762	4451	goto FAILED;
dvander@2762	4452	}
dvander@2762	4453	continue;
dvander@2762	4454
dvander@2762	4455
dvander@2762	4456	/* ------------------------------------------------------------ */
dvander@2762	4457	case CHAR_VERTICAL_LINE: /* Reset capture count for each branch */
dvander@2762	4458	reset_bracount = TRUE;
dvander@2762	4459	/* Fall through */
dvander@2762	4460
dvander@2762	4461	/* ------------------------------------------------------------ */
dvander@2762	4462	case CHAR_COLON: /* Non-capturing bracket */
dvander@2762	4463	bravalue = OP_BRA;
dvander@2762	4464	ptr++;
dvander@2762	4465	break;
dvander@2762	4466
dvander@2762	4467
dvander@2762	4468	/* ------------------------------------------------------------ */
dvander@2762	4469	case CHAR_LEFT_PARENTHESIS:
dvander@2762	4470	bravalue = OP_COND; /* Conditional group */
dvander@2762	4471
dvander@2762	4472	/* A condition can be an assertion, a number (referring to a numbered
dvander@2762	4473	group), a name (referring to a named group), or 'R', referring to
dvander@2762	4474	recursion. R<digits> and R&name are also permitted for recursion tests.
dvander@2762	4475
dvander@2762	4476	There are several syntaxes for testing a named group: (?(name)) is used
dvander@2762	4477	by Python; Perl 5.10 onwards uses (?(<name>) or (?('name')).
dvander@2762	4478
dvander@2762	4479	There are two unfortunate ambiguities, caused by history. (a) 'R' can
dvander@2762	4480	be the recursive thing or the name 'R' (and similarly for 'R' followed
dvander@2762	4481	by digits), and (b) a number could be a name that consists of digits.
dvander@2762	4482	In both cases, we look for a name first; if not found, we try the other
dvander@2762	4483	cases. */
dvander@2762	4484
dvander@2762	4485	/* For conditions that are assertions, check the syntax, and then exit
dvander@2762	4486	the switch. This will take control down to where bracketed groups,
dvander@2762	4487	including assertions, are processed. */
dvander@2762	4488
dvander@2762	4489	if (ptr[1] == CHAR_QUESTION_MARK && (ptr[2] == CHAR_EQUALS_SIGN \|\|
dvander@2762	4490	ptr[2] == CHAR_EXCLAMATION_MARK \|\| ptr[2] == CHAR_LESS_THAN_SIGN))
dvander@2762	4491	break;
dvander@2762	4492
dvander@2762	4493	/* Most other conditions use OP_CREF (a couple change to OP_RREF
dvander@2762	4494	below), and all need to skip 3 bytes at the start of the group. */
dvander@2762	4495
dvander@2762	4496	code[1+LINK_SIZE] = OP_CREF;
dvander@2762	4497	skipbytes = 3;
dvander@2762	4498	refsign = -1;
dvander@2762	4499
dvander@2762	4500	/* Check for a test for recursion in a named group. */
dvander@2762	4501
dvander@2762	4502	if (ptr[1] == CHAR_R && ptr[2] == CHAR_AMPERSAND)
dvander@2762	4503	{
dvander@2762	4504	terminator = -1;
dvander@2762	4505	ptr += 2;
dvander@2762	4506	code[1+LINK_SIZE] = OP_RREF; /* Change the type of test */
dvander@2762	4507	}
dvander@2762	4508
dvander@2762	4509	/* Check for a test for a named group's having been set, using the Perl
dvander@2762	4510	syntax (?(<name>) or (?('name') */
dvander@2762	4511
dvander@2762	4512	else if (ptr[1] == CHAR_LESS_THAN_SIGN)
dvander@2762	4513	{
dvander@2762	4514	terminator = CHAR_GREATER_THAN_SIGN;
dvander@2762	4515	ptr++;
dvander@2762	4516	}
dvander@2762	4517	else if (ptr[1] == CHAR_APOSTROPHE)
dvander@2762	4518	{
dvander@2762	4519	terminator = CHAR_APOSTROPHE;
dvander@2762	4520	ptr++;
dvander@2762	4521	}
dvander@2762	4522	else
dvander@2762	4523	{
dvander@2762	4524	terminator = 0;
dvander@2762	4525	if (ptr[1] == CHAR_MINUS \|\| ptr[1] == CHAR_PLUS) refsign = *(++ptr);
dvander@2762	4526	}
dvander@2762	4527
dvander@2762	4528	/* We now expect to read a name; any thing else is an error */
dvander@2762	4529
dvander@2762	4530	if ((cd->ctypes[ptr[1]] & ctype_word) == 0)
dvander@2762	4531	{
dvander@2762	4532	ptr += 1; /* To get the right offset */
dvander@2762	4533	*errorcodeptr = ERR28;
dvander@2762	4534	goto FAILED;
dvander@2762	4535	}
dvander@2762	4536
dvander@2762	4537	/* Read the name, but also get it as a number if it's all digits */
dvander@2762	4538
dvander@2762	4539	recno = 0;
dvander@2762	4540	name = ++ptr;
dvander@2762	4541	while ((cd->ctypes[*ptr] & ctype_word) != 0)
dvander@2762	4542	{
dvander@2762	4543	if (recno >= 0)
dvander@2762	4544	recno = ((digitab[*ptr] & ctype_digit) != 0)?
dvander@2762	4545	recno * 10 + *ptr - CHAR_0 : -1;
dvander@2762	4546	ptr++;
dvander@2762	4547	}
dvander@2762	4548	namelen = ptr - name;
dvander@2762	4549
dvander@2762	4550	if ((terminator > 0 && *ptr++ != terminator) \|\|
dvander@2762	4551	*ptr++ != CHAR_RIGHT_PARENTHESIS)
dvander@2762	4552	{
dvander@2762	4553	ptr--; /* Error offset */
dvander@2762	4554	*errorcodeptr = ERR26;
dvander@2762	4555	goto FAILED;
dvander@2762	4556	}
dvander@2762	4557
dvander@2762	4558	/* Do no further checking in the pre-compile phase. */
dvander@2762	4559
dvander@2762	4560	if (lengthptr != NULL) break;
dvander@2762	4561
dvander@2762	4562	/* In the real compile we do the work of looking for the actual
dvander@2762	4563	reference. If the string started with "+" or "-" we require the rest to
dvander@2762	4564	be digits, in which case recno will be set. */
dvander@2762	4565
dvander@2762	4566	if (refsign > 0)
dvander@2762	4567	{
dvander@2762	4568	if (recno <= 0)
dvander@2762	4569	{
dvander@2762	4570	*errorcodeptr = ERR58;
dvander@2762	4571	goto FAILED;
dvander@2762	4572	}
dvander@2762	4573	recno = (refsign == CHAR_MINUS)?
dvander@2762	4574	cd->bracount - recno + 1 : recno +cd->bracount;
dvander@2762	4575	if (recno <= 0 \|\| recno > cd->final_bracount)
dvander@2762	4576	{
dvander@2762	4577	*errorcodeptr = ERR15;
dvander@2762	4578	goto FAILED;
dvander@2762	4579	}
dvander@2762	4580	PUT2(code, 2+LINK_SIZE, recno);
dvander@2762	4581	break;
dvander@2762	4582	}
dvander@2762	4583
dvander@2762	4584	/* Otherwise (did not start with "+" or "-"), start by looking for the
dvander@2762	4585	name. */
dvander@2762	4586
dvander@2762	4587	slot = cd->name_table;
dvander@2762	4588	for (i = 0; i < cd->names_found; i++)
dvander@2762	4589	{
dvander@2762	4590	if (strncmp((char )name, (char )slot+2, namelen) == 0) break;
dvander@2762	4591	slot += cd->name_entry_size;
dvander@2762	4592	}
dvander@2762	4593
dvander@2762	4594	/* Found a previous named subpattern */
dvander@2762	4595
dvander@2762	4596	if (i < cd->names_found)
dvander@2762	4597	{
dvander@2762	4598	recno = GET2(slot, 0);
dvander@2762	4599	PUT2(code, 2+LINK_SIZE, recno);
dvander@2762	4600	}
dvander@2762	4601
dvander@2762	4602	/* Search the pattern for a forward reference */
dvander@2762	4603
dvander@2762	4604	else if ((i = find_parens(cd, name, namelen,
dvander@2762	4605	(options & PCRE_EXTENDED) != 0)) > 0)
dvander@2762	4606	{
dvander@2762	4607	PUT2(code, 2+LINK_SIZE, i);
dvander@2762	4608	}
dvander@2762	4609
dvander@2762	4610	/* If terminator == 0 it means that the name followed directly after
dvander@2762	4611	the opening parenthesis [e.g. (?(abc)...] and in this case there are
dvander@2762	4612	some further alternatives to try. For the cases where terminator != 0
dvander@2762	4613	[things like (?(<name>... or (?('name')... or (?(R&name)... ] we have
dvander@2762	4614	now checked all the possibilities, so give an error. */
dvander@2762	4615
dvander@2762	4616	else if (terminator != 0)
dvander@2762	4617	{
dvander@2762	4618	*errorcodeptr = ERR15;
dvander@2762	4619	goto FAILED;
dvander@2762	4620	}
dvander@2762	4621
dvander@2762	4622	/* Check for (?(R) for recursion. Allow digits after R to specify a
dvander@2762	4623	specific group number. */
dvander@2762	4624
dvander@2762	4625	else if (*name == CHAR_R)
dvander@2762	4626	{
dvander@2762	4627	recno = 0;
dvander@2762	4628	for (i = 1; i < namelen; i++)
dvander@2762	4629	{
dvander@2762	4630	if ((digitab[name[i]] & ctype_digit) == 0)
dvander@2762	4631	{
dvander@2762	4632	*errorcodeptr = ERR15;
dvander@2762	4633	goto FAILED;
dvander@2762	4634	}
dvander@2762	4635	recno = recno * 10 + name[i] - CHAR_0;
dvander@2762	4636	}
dvander@2762	4637	if (recno == 0) recno = RREF_ANY;
dvander@2762	4638	code[1+LINK_SIZE] = OP_RREF; /* Change test type */
dvander@2762	4639	PUT2(code, 2+LINK_SIZE, recno);
dvander@2762	4640	}
dvander@2762	4641
dvander@2762	4642	/* Similarly, check for the (?(DEFINE) "condition", which is always
dvander@2762	4643	false. */
dvander@2762	4644
dvander@2762	4645	else if (namelen == 6 && strncmp((char *)name, STRING_DEFINE, 6) == 0)
dvander@2762	4646	{
dvander@2762	4647	code[1+LINK_SIZE] = OP_DEF;
dvander@2762	4648	skipbytes = 1;
dvander@2762	4649	}
dvander@2762	4650
dvander@2762	4651	/* Check for the "name" actually being a subpattern number. We are
dvander@2762	4652	in the second pass here, so final_bracount is set. */
dvander@2762	4653
dvander@2762	4654	else if (recno > 0 && recno <= cd->final_bracount)
dvander@2762	4655	{
dvander@2762	4656	PUT2(code, 2+LINK_SIZE, recno);
dvander@2762	4657	}
dvander@2762	4658
dvander@2762	4659	/* Either an unidentified subpattern, or a reference to (?(0) */
dvander@2762	4660
dvander@2762	4661	else
dvander@2762	4662	{
dvander@2762	4663	*errorcodeptr = (recno == 0)? ERR35: ERR15;
dvander@2762	4664	goto FAILED;
dvander@2762	4665	}
dvander@2762	4666	break;
dvander@2762	4667
dvander@2762	4668
dvander@2762	4669	/* ------------------------------------------------------------ */
dvander@2762	4670	case CHAR_EQUALS_SIGN: /* Positive lookahead */
dvander@2762	4671	bravalue = OP_ASSERT;
dvander@2762	4672	ptr++;
dvander@2762	4673	break;
dvander@2762	4674
dvander@2762	4675
dvander@2762	4676	/* ------------------------------------------------------------ */
dvander@2762	4677	case CHAR_EXCLAMATION_MARK: /* Negative lookahead */
dvander@2762	4678	ptr++;
dvander@2762	4679	if (ptr == CHAR_RIGHT_PARENTHESIS) / Optimize (?!) */
dvander@2762	4680	{
dvander@2762	4681	*code++ = OP_FAIL;
dvander@2762	4682	previous = NULL;
dvander@2762	4683	continue;
dvander@2762	4684	}
dvander@2762	4685	bravalue = OP_ASSERT_NOT;
dvander@2762	4686	break;
dvander@2762	4687
dvander@2762	4688
dvander@2762	4689	/* ------------------------------------------------------------ */
dvander@2762	4690	case CHAR_LESS_THAN_SIGN: /* Lookbehind or named define */
dvander@2762	4691	switch (ptr[1])
dvander@2762	4692	{
dvander@2762	4693	case CHAR_EQUALS_SIGN: /* Positive lookbehind */
dvander@2762	4694	bravalue = OP_ASSERTBACK;
dvander@2762	4695	ptr += 2;
dvander@2762	4696	break;
dvander@2762	4697
dvander@2762	4698	case CHAR_EXCLAMATION_MARK: /* Negative lookbehind */
dvander@2762	4699	bravalue = OP_ASSERTBACK_NOT;
dvander@2762	4700	ptr += 2;
dvander@2762	4701	break;
dvander@2762	4702
dvander@2762	4703	default: /* Could be name define, else bad */
dvander@2762	4704	if ((cd->ctypes[ptr[1]] & ctype_word) != 0) goto DEFINE_NAME;
dvander@2762	4705	ptr++; /* Correct offset for error */
dvander@2762	4706	*errorcodeptr = ERR24;
dvander@2762	4707	goto FAILED;
dvander@2762	4708	}
dvander@2762	4709	break;
dvander@2762	4710
dvander@2762	4711
dvander@2762	4712	/* ------------------------------------------------------------ */
dvander@2762	4713	case CHAR_GREATER_THAN_SIGN: /* One-time brackets */
dvander@2762	4714	bravalue = OP_ONCE;
dvander@2762	4715	ptr++;
dvander@2762	4716	break;
dvander@2762	4717
dvander@2762	4718
dvander@2762	4719	/* ------------------------------------------------------------ */
dvander@2762	4720	case CHAR_C: /* Callout - may be followed by digits; */
dvander@2762	4721	previous_callout = code; /* Save for later completion */
dvander@2762	4722	after_manual_callout = 1; /* Skip one item before completing */
dvander@2762	4723	*code++ = OP_CALLOUT;
dvander@2762	4724	{
dvander@2762	4725	int n = 0;
dvander@2762	4726	while ((digitab[*(++ptr)] & ctype_digit) != 0)
dvander@2762	4727	n = n * 10 + *ptr - CHAR_0;
dvander@2762	4728	if (*ptr != CHAR_RIGHT_PARENTHESIS)
dvander@2762	4729	{
dvander@2762	4730	*errorcodeptr = ERR39;
dvander@2762	4731	goto FAILED;
dvander@2762	4732	}
dvander@2762	4733	if (n > 255)
dvander@2762	4734	{
dvander@2762	4735	*errorcodeptr = ERR38;
dvander@2762	4736	goto FAILED;
dvander@2762	4737	}
dvander@2762	4738	*code++ = n;
dvander@2762	4739	PUT(code, 0, ptr - cd->start_pattern + 1); /* Pattern offset */
dvander@2762	4740	PUT(code, LINK_SIZE, 0); /* Default length */
dvander@2762	4741	code += 2 * LINK_SIZE;
dvander@2762	4742	}
dvander@2762	4743	previous = NULL;
dvander@2762	4744	continue;
dvander@2762	4745
dvander@2762	4746
dvander@2762	4747	/* ------------------------------------------------------------ */
dvander@2762	4748	case CHAR_P: /* Python-style named subpattern handling */
dvander@2762	4749	if (*(++ptr) == CHAR_EQUALS_SIGN \|\|
dvander@2762	4750	ptr == CHAR_GREATER_THAN_SIGN) / Reference or recursion */
dvander@2762	4751	{
dvander@2762	4752	is_recurse = *ptr == CHAR_GREATER_THAN_SIGN;
dvander@2762	4753	terminator = CHAR_RIGHT_PARENTHESIS;
dvander@2762	4754	goto NAMED_REF_OR_RECURSE;
dvander@2762	4755	}
dvander@2762	4756	else if (ptr != CHAR_LESS_THAN_SIGN) / Test for Python-style defn */
dvander@2762	4757	{
dvander@2762	4758	*errorcodeptr = ERR41;
dvander@2762	4759	goto FAILED;
dvander@2762	4760	}
dvander@2762	4761	/* Fall through to handle (?P< as (?< is handled */
dvander@2762	4762
dvander@2762	4763
dvander@2762	4764	/* ------------------------------------------------------------ */
dvander@2762	4765	DEFINE_NAME: /* Come here from (?< handling */
dvander@2762	4766	case CHAR_APOSTROPHE:
dvander@2762	4767	{
dvander@2762	4768	terminator = (*ptr == CHAR_LESS_THAN_SIGN)?
dvander@2762	4769	CHAR_GREATER_THAN_SIGN : CHAR_APOSTROPHE;
dvander@2762	4770	name = ++ptr;
dvander@2762	4771
dvander@2762	4772	while ((cd->ctypes[*ptr] & ctype_word) != 0) ptr++;
dvander@2762	4773	namelen = ptr - name;
dvander@2762	4774
dvander@2762	4775	/* In the pre-compile phase, just do a syntax check. */
dvander@2762	4776
dvander@2762	4777	if (lengthptr != NULL)
dvander@2762	4778	{
dvander@2762	4779	if (*ptr != terminator)
dvander@2762	4780	{
dvander@2762	4781	*errorcodeptr = ERR42;
dvander@2762	4782	goto FAILED;
dvander@2762	4783	}
dvander@2762	4784	if (cd->names_found >= MAX_NAME_COUNT)
dvander@2762	4785	{
dvander@2762	4786	*errorcodeptr = ERR49;
dvander@2762	4787	goto FAILED;
dvander@2762	4788	}
dvander@2762	4789	if (namelen + 3 > cd->name_entry_size)
dvander@2762	4790	{
dvander@2762	4791	cd->name_entry_size = namelen + 3;
dvander@2762	4792	if (namelen > MAX_NAME_SIZE)
dvander@2762	4793	{
dvander@2762	4794	*errorcodeptr = ERR48;
dvander@2762	4795	goto FAILED;
dvander@2762	4796	}
dvander@2762	4797	}
dvander@2762	4798	}
dvander@2762	4799
dvander@2762	4800	/* In the real compile, create the entry in the table */
dvander@2762	4801
dvander@2762	4802	else
dvander@2762	4803	{
dvander@2762	4804	slot = cd->name_table;
dvander@2762	4805	for (i = 0; i < cd->names_found; i++)
dvander@2762	4806	{
dvander@2762	4807	int crc = memcmp(name, slot+2, namelen);
dvander@2762	4808	if (crc == 0)
dvander@2762	4809	{
dvander@2762	4810	if (slot[2+namelen] == 0)
dvander@2762	4811	{
dvander@2762	4812	if ((options & PCRE_DUPNAMES) == 0)
dvander@2762	4813	{
dvander@2762	4814	*errorcodeptr = ERR43;
dvander@2762	4815	goto FAILED;
dvander@2762	4816	}
dvander@2762	4817	}
dvander@2762	4818	else crc = -1; /* Current name is substring */
dvander@2762	4819	}
dvander@2762	4820	if (crc < 0)
dvander@2762	4821	{
dvander@2762	4822	memmove(slot + cd->name_entry_size, slot,
dvander@2762	4823	(cd->names_found - i) * cd->name_entry_size);
dvander@2762	4824	break;
dvander@2762	4825	}
dvander@2762	4826	slot += cd->name_entry_size;
dvander@2762	4827	}
dvander@2762	4828
dvander@2762	4829	PUT2(slot, 0, cd->bracount + 1);
dvander@2762	4830	memcpy(slot + 2, name, namelen);
dvander@2762	4831	slot[2+namelen] = 0;
dvander@2762	4832	}
dvander@2762	4833	}
dvander@2762	4834
dvander@2762	4835	/* In both cases, count the number of names we've encountered. */
dvander@2762	4836
dvander@2762	4837	ptr++; /* Move past > or ' */
dvander@2762	4838	cd->names_found++;
dvander@2762	4839	goto NUMBERED_GROUP;
dvander@2762	4840
dvander@2762	4841
dvander@2762	4842	/* ------------------------------------------------------------ */
dvander@2762	4843	case CHAR_AMPERSAND: /* Perl recursion/subroutine syntax */
dvander@2762	4844	terminator = CHAR_RIGHT_PARENTHESIS;
dvander@2762	4845	is_recurse = TRUE;
dvander@2762	4846	/* Fall through */
dvander@2762	4847
dvander@2762	4848	/* We come here from the Python syntax above that handles both
dvander@2762	4849	references (?P=name) and recursion (?P>name), as well as falling
dvander@2762	4850	through from the Perl recursion syntax (?&name). We also come here from
dvander@2762	4851	the Perl \k<name> or \k'name' back reference syntax and the \k{name}
dvander@2762	4852	.NET syntax, and the Oniguruma \g<...> and \g'...' subroutine syntax. */
dvander@2762	4853
dvander@2762	4854	NAMED_REF_OR_RECURSE:
dvander@2762	4855	name = ++ptr;
dvander@2762	4856	while ((cd->ctypes[*ptr] & ctype_word) != 0) ptr++;
dvander@2762	4857	namelen = ptr - name;
dvander@2762	4858
dvander@2762	4859	/* In the pre-compile phase, do a syntax check and set a dummy
dvander@2762	4860	reference number. */
dvander@2762	4861
dvander@2762	4862	if (lengthptr != NULL)
dvander@2762	4863	{
dvander@2762	4864	if (namelen == 0)
dvander@2762	4865	{
dvander@2762	4866	*errorcodeptr = ERR62;
dvander@2762	4867	goto FAILED;
dvander@2762	4868	}
dvander@2762	4869	if (*ptr != terminator)
dvander@2762	4870	{
dvander@2762	4871	*errorcodeptr = ERR42;
dvander@2762	4872	goto FAILED;
dvander@2762	4873	}
dvander@2762	4874	if (namelen > MAX_NAME_SIZE)
dvander@2762	4875	{
dvander@2762	4876	*errorcodeptr = ERR48;
dvander@2762	4877	goto FAILED;
dvander@2762	4878	}
dvander@2762	4879	recno = 0;
dvander@2762	4880	}
dvander@2762	4881
dvander@2762	4882	/* In the real compile, seek the name in the table. We check the name
dvander@2762	4883	first, and then check that we have reached the end of the name in the
dvander@2762	4884	table. That way, if the name that is longer than any in the table,
dvander@2762	4885	the comparison will fail without reading beyond the table entry. */
dvander@2762	4886
dvander@2762	4887	else
dvander@2762	4888	{
dvander@2762	4889	slot = cd->name_table;
dvander@2762	4890	for (i = 0; i < cd->names_found; i++)
dvander@2762	4891	{
dvander@2762	4892	if (strncmp((char )name, (char )slot+2, namelen) == 0 &&
dvander@2762	4893	slot[2+namelen] == 0)
dvander@2762	4894	break;
dvander@2762	4895	slot += cd->name_entry_size;
dvander@2762	4896	}
dvander@2762	4897
dvander@2762	4898	if (i < cd->names_found) /* Back reference */
dvander@2762	4899	{
dvander@2762	4900	recno = GET2(slot, 0);
dvander@2762	4901	}
dvander@2762	4902	else if ((recno = /* Forward back reference */
dvander@2762	4903	find_parens(cd, name, namelen,
dvander@2762	4904	(options & PCRE_EXTENDED) != 0)) <= 0)
dvander@2762	4905	{
dvander@2762	4906	*errorcodeptr = ERR15;
dvander@2762	4907	goto FAILED;
dvander@2762	4908	}
dvander@2762	4909	}
dvander@2762	4910
dvander@2762	4911	/* In both phases, we can now go to the code than handles numerical
dvander@2762	4912	recursion or backreferences. */
dvander@2762	4913
dvander@2762	4914	if (is_recurse) goto HANDLE_RECURSION;
dvander@2762	4915	else goto HANDLE_REFERENCE;
dvander@2762	4916
dvander@2762	4917
dvander@2762	4918	/* ------------------------------------------------------------ */
dvander@2762	4919	case CHAR_R: /* Recursion */
dvander@2762	4920	ptr++; /* Same as (?0) */
dvander@2762	4921	/* Fall through */
dvander@2762	4922
dvander@2762	4923
dvander@2762	4924	/* ------------------------------------------------------------ */
dvander@2762	4925	case CHAR_MINUS: case CHAR_PLUS: /* Recursion or subroutine */
dvander@2762	4926	case CHAR_0: case CHAR_1: case CHAR_2: case CHAR_3: case CHAR_4:
dvander@2762	4927	case CHAR_5: case CHAR_6: case CHAR_7: case CHAR_8: case CHAR_9:
dvander@2762	4928	{
dvander@2762	4929	const uschar *called;
dvander@2762	4930	terminator = CHAR_RIGHT_PARENTHESIS;
dvander@2762	4931
dvander@2762	4932	/* Come here from the \g<...> and \g'...' code (Oniguruma
dvander@2762	4933	compatibility). However, the syntax has been checked to ensure that
dvander@2762	4934	the ... are a (signed) number, so that neither ERR63 nor ERR29 will
dvander@2762	4935	be called on this path, nor with the jump to OTHER_CHAR_AFTER_QUERY
dvander@2762	4936	ever be taken. */
dvander@2762	4937
dvander@2762	4938	HANDLE_NUMERICAL_RECURSION:
dvander@2762	4939
dvander@2762	4940	if ((refsign = *ptr) == CHAR_PLUS)
dvander@2762	4941	{
dvander@2762	4942	ptr++;
dvander@2762	4943	if ((digitab[*ptr] & ctype_digit) == 0)
dvander@2762	4944	{
dvander@2762	4945	*errorcodeptr = ERR63;
dvander@2762	4946	goto FAILED;
dvander@2762	4947	}
dvander@2762	4948	}
dvander@2762	4949	else if (refsign == CHAR_MINUS)
dvander@2762	4950	{
dvander@2762	4951	if ((digitab[ptr[1]] & ctype_digit) == 0)
dvander@2762	4952	goto OTHER_CHAR_AFTER_QUERY;
dvander@2762	4953	ptr++;
dvander@2762	4954	}
dvander@2762	4955
dvander@2762	4956	recno = 0;
dvander@2762	4957	while((digitab[*ptr] & ctype_digit) != 0)
dvander@2762	4958	recno = recno * 10 + *ptr++ - CHAR_0;
dvander@2762	4959
dvander@2762	4960	if (*ptr != terminator)
dvander@2762	4961	{
dvander@2762	4962	*errorcodeptr = ERR29;
dvander@2762	4963	goto FAILED;
dvander@2762	4964	}
dvander@2762	4965
dvander@2762	4966	if (refsign == CHAR_MINUS)
dvander@2762	4967	{
dvander@2762	4968	if (recno == 0)
dvander@2762	4969	{
dvander@2762	4970	*errorcodeptr = ERR58;
dvander@2762	4971	goto FAILED;
dvander@2762	4972	}
dvander@2762	4973	recno = cd->bracount - recno + 1;
dvander@2762	4974	if (recno <= 0)
dvander@2762	4975	{
dvander@2762	4976	*errorcodeptr = ERR15;
dvander@2762	4977	goto FAILED;
dvander@2762	4978	}
dvander@2762	4979	}
dvander@2762	4980	else if (refsign == CHAR_PLUS)
dvander@2762	4981	{
dvander@2762	4982	if (recno == 0)
dvander@2762	4983	{
dvander@2762	4984	*errorcodeptr = ERR58;
dvander@2762	4985	goto FAILED;
dvander@2762	4986	}
dvander@2762	4987	recno += cd->bracount;
dvander@2762	4988	}
dvander@2762	4989
dvander@2762	4990	/* Come here from code above that handles a named recursion */
dvander@2762	4991
dvander@2762	4992	HANDLE_RECURSION:
dvander@2762	4993
dvander@2762	4994	previous = code;
dvander@2762	4995	called = cd->start_code;
dvander@2762	4996
dvander@2762	4997	/* When we are actually compiling, find the bracket that is being
dvander@2762	4998	referenced. Temporarily end the regex in case it doesn't exist before
dvander@2762	4999	this point. If we end up with a forward reference, first check that
dvander@2762	5000	the bracket does occur later so we can give the error (and position)
dvander@2762	5001	now. Then remember this forward reference in the workspace so it can
dvander@2762	5002	be filled in at the end. */
dvander@2762	5003
dvander@2762	5004	if (lengthptr == NULL)
dvander@2762	5005	{
dvander@2762	5006	*code = OP_END;
dvander@2762	5007	if (recno != 0) called = find_bracket(cd->start_code, utf8, recno);
dvander@2762	5008
dvander@2762	5009	/* Forward reference */
dvander@2762	5010
dvander@2762	5011	if (called == NULL)
dvander@2762	5012	{
dvander@2762	5013	if (find_parens(cd, NULL, recno,
dvander@2762	5014	(options & PCRE_EXTENDED) != 0) < 0)
dvander@2762	5015	{
dvander@2762	5016	*errorcodeptr = ERR15;
dvander@2762	5017	goto FAILED;
dvander@2762	5018	}
dvander@2762	5019	called = cd->start_code + recno;
dvander@2762	5020	PUTINC(cd->hwm, 0, code + 2 + LINK_SIZE - cd->start_code);
dvander@2762	5021	}
dvander@2762	5022
dvander@2762	5023	/* If not a forward reference, and the subpattern is still open,
dvander@2762	5024	this is a recursive call. We check to see if this is a left
dvander@2762	5025	recursion that could loop for ever, and diagnose that case. */
dvander@2762	5026
dvander@2762	5027	else if (GET(called, 1) == 0 &&
dvander@2762	5028	could_be_empty(called, code, bcptr, utf8))
dvander@2762	5029	{
dvander@2762	5030	*errorcodeptr = ERR40;
dvander@2762	5031	goto FAILED;
dvander@2762	5032	}
dvander@2762	5033	}
dvander@2762	5034
dvander@2762	5035	/* Insert the recursion/subroutine item, automatically wrapped inside
dvander@2762	5036	"once" brackets. Set up a "previous group" length so that a
dvander@2762	5037	subsequent quantifier will work. */
dvander@2762	5038
dvander@2762	5039	*code = OP_ONCE;
dvander@2762	5040	PUT(code, 1, 2 + 2*LINK_SIZE);
dvander@2762	5041	code += 1 + LINK_SIZE;
dvander@2762	5042
dvander@2762	5043	*code = OP_RECURSE;
dvander@2762	5044	PUT(code, 1, called - cd->start_code);
dvander@2762	5045	code += 1 + LINK_SIZE;
dvander@2762	5046
dvander@2762	5047	*code = OP_KET;
dvander@2762	5048	PUT(code, 1, 2 + 2*LINK_SIZE);
dvander@2762	5049	code += 1 + LINK_SIZE;
dvander@2762	5050
dvander@2762	5051	length_prevgroup = 3 + 3*LINK_SIZE;
dvander@2762	5052	}
dvander@2762	5053
dvander@2762	5054	/* Can't determine a first byte now */
dvander@2762	5055
dvander@2762	5056	if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
dvander@2762	5057	continue;
dvander@2762	5058
dvander@2762	5059
dvander@2762	5060	/* ------------------------------------------------------------ */
dvander@2762	5061	default: /* Other characters: check option setting */
dvander@2762	5062	OTHER_CHAR_AFTER_QUERY:
dvander@2762	5063	set = unset = 0;
dvander@2762	5064	optset = &set;
dvander@2762	5065
dvander@2762	5066	while (ptr != CHAR_RIGHT_PARENTHESIS && ptr != CHAR_COLON)
dvander@2762	5067	{
dvander@2762	5068	switch (*ptr++)
dvander@2762	5069	{
dvander@2762	5070	case CHAR_MINUS: optset = &unset; break;
dvander@2762	5071
dvander@2762	5072	case CHAR_J: /* Record that it changed in the external options */
dvander@2762	5073	*optset \|= PCRE_DUPNAMES;
dvander@2762	5074	cd->external_flags \|= PCRE_JCHANGED;
dvander@2762	5075	break;
dvander@2762	5076
dvander@2762	5077	case CHAR_i: *optset \|= PCRE_CASELESS; break;
dvander@2762	5078	case CHAR_m: *optset \|= PCRE_MULTILINE; break;
dvander@2762	5079	case CHAR_s: *optset \|= PCRE_DOTALL; break;
dvander@2762	5080	case CHAR_x: *optset \|= PCRE_EXTENDED; break;
dvander@2762	5081	case CHAR_U: *optset \|= PCRE_UNGREEDY; break;
dvander@2762	5082	case CHAR_X: *optset \|= PCRE_EXTRA; break;
dvander@2762	5083
dvander@2762	5084	default: *errorcodeptr = ERR12;
dvander@2762	5085	ptr--; /* Correct the offset */
dvander@2762	5086	goto FAILED;
dvander@2762	5087	}
dvander@2762	5088	}
dvander@2762	5089
dvander@2762	5090	/* Set up the changed option bits, but don't change anything yet. */
dvander@2762	5091
dvander@2762	5092	newoptions = (options \| set) & (~unset);
dvander@2762	5093
dvander@2762	5094	/* If the options ended with ')' this is not the start of a nested
dvander@2762	5095	group with option changes, so the options change at this level. If this
dvander@2762	5096	item is right at the start of the pattern, the options can be
dvander@2762	5097	abstracted and made external in the pre-compile phase, and ignored in
dvander@2762	5098	the compile phase. This can be helpful when matching -- for instance in
dvander@2762	5099	caseless checking of required bytes.
dvander@2762	5100
dvander@2762	5101	If the code pointer is not (cd->start_code + 1 + LINK_SIZE), we are
dvander@2762	5102	definitely not at the start of the pattern because something has been
dvander@2762	5103	compiled. In the pre-compile phase, however, the code pointer can have
dvander@2762	5104	that value after the start, because it gets reset as code is discarded
dvander@2762	5105	during the pre-compile. However, this can happen only at top level - if
dvander@2762	5106	we are within parentheses, the starting BRA will still be present. At
dvander@2762	5107	any parenthesis level, the length value can be used to test if anything
dvander@2762	5108	has been compiled at that level. Thus, a test for both these conditions
dvander@2762	5109	is necessary to ensure we correctly detect the start of the pattern in
dvander@2762	5110	both phases.
dvander@2762	5111
dvander@2762	5112	If we are not at the pattern start, compile code to change the ims
dvander@2762	5113	options if this setting actually changes any of them, and reset the
dvander@2762	5114	greedy defaults and the case value for firstbyte and reqbyte. */
dvander@2762	5115
dvander@2762	5116	if (*ptr == CHAR_RIGHT_PARENTHESIS)
dvander@2762	5117	{
dvander@2762	5118	if (code == cd->start_code + 1 + LINK_SIZE &&
dvander@2762	5119	(lengthptr == NULL \|\| lengthptr == 2 + 2LINK_SIZE))
dvander@2762	5120	{
dvander@2762	5121	cd->external_options = newoptions;
dvander@2762	5122	}
dvander@2762	5123	else
dvander@2762	5124	{
dvander@2762	5125	if ((options & PCRE_IMS) != (newoptions & PCRE_IMS))
dvander@2762	5126	{
dvander@2762	5127	*code++ = OP_OPT;
dvander@2762	5128	*code++ = newoptions & PCRE_IMS;
dvander@2762	5129	}
dvander@2762	5130	greedy_default = ((newoptions & PCRE_UNGREEDY) != 0);
dvander@2762	5131	greedy_non_default = greedy_default ^ 1;
dvander@2762	5132	req_caseopt = ((newoptions & PCRE_CASELESS) != 0)? REQ_CASELESS : 0;
dvander@2762	5133	}
dvander@2762	5134
dvander@2762	5135	/* Change options at this level, and pass them back for use
dvander@2762	5136	in subsequent branches. When not at the start of the pattern, this
dvander@2762	5137	information is also necessary so that a resetting item can be
dvander@2762	5138	compiled at the end of a group (if we are in a group). */
dvander@2762	5139
dvander@2762	5140	*optionsptr = options = newoptions;
dvander@2762	5141	previous = NULL; /* This item can't be repeated */
dvander@2762	5142	continue; /* It is complete */
dvander@2762	5143	}
dvander@2762	5144
dvander@2762	5145	/* If the options ended with ':' we are heading into a nested group
dvander@2762	5146	with possible change of options. Such groups are non-capturing and are
dvander@2762	5147	not assertions of any kind. All we need to do is skip over the ':';
dvander@2762	5148	the newoptions value is handled below. */
dvander@2762	5149
dvander@2762	5150	bravalue = OP_BRA;
dvander@2762	5151	ptr++;
dvander@2762	5152	} /* End of switch for character following (? */
dvander@2762	5153	} /* End of (? handling */
dvander@2762	5154
dvander@2762	5155	/* Opening parenthesis not followed by '?'. If PCRE_NO_AUTO_CAPTURE is set,
dvander@2762	5156	all unadorned brackets become non-capturing and behave like (?:...)
dvander@2762	5157	brackets. */
dvander@2762	5158
dvander@2762	5159	else if ((options & PCRE_NO_AUTO_CAPTURE) != 0)
dvander@2762	5160	{
dvander@2762	5161	bravalue = OP_BRA;
dvander@2762	5162	}
dvander@2762	5163
dvander@2762	5164	/* Else we have a capturing group. */
dvander@2762	5165
dvander@2762	5166	else
dvander@2762	5167	{
dvander@2762	5168	NUMBERED_GROUP:
dvander@2762	5169	cd->bracount += 1;
dvander@2762	5170	PUT2(code, 1+LINK_SIZE, cd->bracount);
dvander@2762	5171	skipbytes = 2;
dvander@2762	5172	}
dvander@2762	5173
dvander@2762	5174	/* Process nested bracketed regex. Assertions may not be repeated, but
dvander@2762	5175	other kinds can be. All their opcodes are >= OP_ONCE. We copy code into a
dvander@2762	5176	non-register variable in order to be able to pass its address because some
dvander@2762	5177	compilers complain otherwise. Pass in a new setting for the ims options if
dvander@2762	5178	they have changed. */
dvander@2762	5179
dvander@2762	5180	previous = (bravalue >= OP_ONCE)? code : NULL;
dvander@2762	5181	*code = bravalue;
dvander@2762	5182	tempcode = code;
dvander@2762	5183	tempreqvary = cd->req_varyopt; /* Save value before bracket */
dvander@2762	5184	length_prevgroup = 0; /* Initialize for pre-compile phase */
dvander@2762	5185
dvander@2762	5186	if (!compile_regex(
dvander@2762	5187	newoptions, /* The complete new option state */
dvander@2762	5188	options & PCRE_IMS, /* The previous ims option state */
dvander@2762	5189	&tempcode, /* Where to put code (updated) */
dvander@2762	5190	&ptr, /* Input pointer (updated) */
dvander@2762	5191	errorcodeptr, /* Where to put an error message */
dvander@2762	5192	(bravalue == OP_ASSERTBACK \|\|
dvander@2762	5193	bravalue == OP_ASSERTBACK_NOT), /* TRUE if back assert */
dvander@2762	5194	reset_bracount, /* True if (?\| group */
dvander@2762	5195	skipbytes, /* Skip over bracket number */
dvander@2762	5196	&subfirstbyte, /* For possible first char */
dvander@2762	5197	&subreqbyte, /* For possible last char */
dvander@2762	5198	bcptr, /* Current branch chain */
dvander@2762	5199	cd, /* Tables block */
dvander@2762	5200	(lengthptr == NULL)? NULL : /* Actual compile phase */
dvander@2762	5201	&length_prevgroup /* Pre-compile phase */
dvander@2762	5202	))
dvander@2762	5203	goto FAILED;
dvander@2762	5204
dvander@2762	5205	/* At the end of compiling, code is still pointing to the start of the
dvander@2762	5206	group, while tempcode has been updated to point past the end of the group
dvander@2762	5207	and any option resetting that may follow it. The pattern pointer (ptr)
dvander@2762	5208	is on the bracket. */
dvander@2762	5209
dvander@2762	5210	/* If this is a conditional bracket, check that there are no more than
dvander@2762	5211	two branches in the group, or just one if it's a DEFINE group. We do this
dvander@2762	5212	in the real compile phase, not in the pre-pass, where the whole group may
dvander@2762	5213	not be available. */
dvander@2762	5214
dvander@2762	5215	if (bravalue == OP_COND && lengthptr == NULL)
dvander@2762	5216	{
dvander@2762	5217	uschar *tc = code;
dvander@2762	5218	int condcount = 0;
dvander@2762	5219
dvander@2762	5220	do {
dvander@2762	5221	condcount++;
dvander@2762	5222	tc += GET(tc,1);
dvander@2762	5223	}
dvander@2762	5224	while (*tc != OP_KET);
dvander@2762	5225
dvander@2762	5226	/* A DEFINE group is never obeyed inline (the "condition" is always
dvander@2762	5227	false). It must have only one branch. */
dvander@2762	5228
dvander@2762	5229	if (code[LINK_SIZE+1] == OP_DEF)
dvander@2762	5230	{
dvander@2762	5231	if (condcount > 1)
dvander@2762	5232	{
dvander@2762	5233	*errorcodeptr = ERR54;
dvander@2762	5234	goto FAILED;
dvander@2762	5235	}
dvander@2762	5236	bravalue = OP_DEF; /* Just a flag to suppress char handling below */
dvander@2762	5237	}
dvander@2762	5238
dvander@2762	5239	/* A "normal" conditional group. If there is just one branch, we must not
dvander@2762	5240	make use of its firstbyte or reqbyte, because this is equivalent to an
dvander@2762	5241	empty second branch. */
dvander@2762	5242
dvander@2762	5243	else
dvander@2762	5244	{
dvander@2762	5245	if (condcount > 2)
dvander@2762	5246	{
dvander@2762	5247	*errorcodeptr = ERR27;
dvander@2762	5248	goto FAILED;
dvander@2762	5249	}
dvander@2762	5250	if (condcount == 1) subfirstbyte = subreqbyte = REQ_NONE;
dvander@2762	5251	}
dvander@2762	5252	}
dvander@2762	5253
dvander@2762	5254	/* Error if hit end of pattern */
dvander@2762	5255
dvander@2762	5256	if (*ptr != CHAR_RIGHT_PARENTHESIS)
dvander@2762	5257	{
dvander@2762	5258	*errorcodeptr = ERR14;
dvander@2762	5259	goto FAILED;
dvander@2762	5260	}
dvander@2762	5261
dvander@2762	5262	/* In the pre-compile phase, update the length by the length of the group,
dvander@2762	5263	less the brackets at either end. Then reduce the compiled code to just a
dvander@2762	5264	set of non-capturing brackets so that it doesn't use much memory if it is
dvander@2762	5265	duplicated by a quantifier.*/
dvander@2762	5266
dvander@2762	5267	if (lengthptr != NULL)
dvander@2762	5268	{
dvander@2762	5269	if (OFLOW_MAX - lengthptr < length_prevgroup - 2 - 2LINK_SIZE)
dvander@2762	5270	{
dvander@2762	5271	*errorcodeptr = ERR20;
dvander@2762	5272	goto FAILED;
dvander@2762	5273	}
dvander@2762	5274	lengthptr += length_prevgroup - 2 - 2LINK_SIZE;
dvander@2762	5275	*code++ = OP_BRA;
dvander@2762	5276	PUTINC(code, 0, 1 + LINK_SIZE);
dvander@2762	5277	*code++ = OP_KET;
dvander@2762	5278	PUTINC(code, 0, 1 + LINK_SIZE);
dvander@2762	5279	break; /* No need to waste time with special character handling */
dvander@2762	5280	}
dvander@2762	5281
dvander@2762	5282	/* Otherwise update the main code pointer to the end of the group. */
dvander@2762	5283
dvander@2762	5284	code = tempcode;
dvander@2762	5285
dvander@2762	5286	/* For a DEFINE group, required and first character settings are not
dvander@2762	5287	relevant. */
dvander@2762	5288
dvander@2762	5289	if (bravalue == OP_DEF) break;
dvander@2762	5290
dvander@2762	5291	/* Handle updating of the required and first characters for other types of
dvander@2762	5292	group. Update for normal brackets of all kinds, and conditions with two
dvander@2762	5293	branches (see code above). If the bracket is followed by a quantifier with
dvander@2762	5294	zero repeat, we have to back off. Hence the definition of zeroreqbyte and
dvander@2762	5295	zerofirstbyte outside the main loop so that they can be accessed for the
dvander@2762	5296	back off. */
dvander@2762	5297
dvander@2762	5298	zeroreqbyte = reqbyte;
dvander@2762	5299	zerofirstbyte = firstbyte;
dvander@2762	5300	groupsetfirstbyte = FALSE;
dvander@2762	5301
dvander@2762	5302	if (bravalue >= OP_ONCE)
dvander@2762	5303	{
dvander@2762	5304	/* If we have not yet set a firstbyte in this branch, take it from the
dvander@2762	5305	subpattern, remembering that it was set here so that a repeat of more
dvander@2762	5306	than one can replicate it as reqbyte if necessary. If the subpattern has
dvander@2762	5307	no firstbyte, set "none" for the whole branch. In both cases, a zero
dvander@2762	5308	repeat forces firstbyte to "none". */
dvander@2762	5309
dvander@2762	5310	if (firstbyte == REQ_UNSET)
dvander@2762	5311	{
dvander@2762	5312	if (subfirstbyte >= 0)
dvander@2762	5313	{
dvander@2762	5314	firstbyte = subfirstbyte;
dvander@2762	5315	groupsetfirstbyte = TRUE;
dvander@2762	5316	}
dvander@2762	5317	else firstbyte = REQ_NONE;
dvander@2762	5318	zerofirstbyte = REQ_NONE;
dvander@2762	5319	}
dvander@2762	5320
dvander@2762	5321	/* If firstbyte was previously set, convert the subpattern's firstbyte
dvander@2762	5322	into reqbyte if there wasn't one, using the vary flag that was in
dvander@2762	5323	existence beforehand. */
dvander@2762	5324
dvander@2762	5325	else if (subfirstbyte >= 0 && subreqbyte < 0)
dvander@2762	5326	subreqbyte = subfirstbyte \| tempreqvary;
dvander@2762	5327
dvander@2762	5328	/* If the subpattern set a required byte (or set a first byte that isn't
dvander@2762	5329	really the first byte - see above), set it. */
dvander@2762	5330
dvander@2762	5331	if (subreqbyte >= 0) reqbyte = subreqbyte;
dvander@2762	5332	}
dvander@2762	5333
dvander@2762	5334	/* For a forward assertion, we take the reqbyte, if set. This can be
dvander@2762	5335	helpful if the pattern that follows the assertion doesn't set a different
dvander@2762	5336	char. For example, it's useful for /(?=abcde).+/. We can't set firstbyte
dvander@2762	5337	for an assertion, however because it leads to incorrect effect for patterns
dvander@2762	5338	such as /(?=a)a.+/ when the "real" "a" would then become a reqbyte instead
dvander@2762	5339	of a firstbyte. This is overcome by a scan at the end if there's no
dvander@2762	5340	firstbyte, looking for an asserted first char. */
dvander@2762	5341
dvander@2762	5342	else if (bravalue == OP_ASSERT && subreqbyte >= 0) reqbyte = subreqbyte;
dvander@2762	5343	break; /* End of processing '(' */
dvander@2762	5344
dvander@2762	5345
dvander@2762	5346	/* ===================================================================*/
dvander@2762	5347	/* Handle metasequences introduced by \. For ones like \d, the ESC_ values
dvander@2762	5348	are arranged to be the negation of the corresponding OP_values. For the
dvander@2762	5349	back references, the values are ESC_REF plus the reference number. Only
dvander@2762	5350	back references and those types that consume a character may be repeated.
dvander@2762	5351	We can test for values between ESC_b and ESC_Z for the latter; this may
dvander@2762	5352	have to change if any new ones are ever created. */
dvander@2762	5353
dvander@2762	5354	case CHAR_BACKSLASH:
dvander@2762	5355	tempptr = ptr;
dvander@2762	5356	c = check_escape(&ptr, errorcodeptr, cd->bracount, options, FALSE);
dvander@2762	5357	if (*errorcodeptr != 0) goto FAILED;
dvander@2762	5358
dvander@2762	5359	if (c < 0)
dvander@2762	5360	{
dvander@2762	5361	if (-c == ESC_Q) /* Handle start of quoted string */
dvander@2762	5362	{
dvander@2762	5363	if (ptr[1] == CHAR_BACKSLASH && ptr[2] == CHAR_E)
dvander@2762	5364	ptr += 2; /* avoid empty string */
dvander@2762	5365	else inescq = TRUE;
dvander@2762	5366	continue;
dvander@2762	5367	}
dvander@2762	5368
dvander@2762	5369	if (-c == ESC_E) continue; /* Perl ignores an orphan \E */
dvander@2762	5370
dvander@2762	5371	/* For metasequences that actually match a character, we disable the
dvander@2762	5372	setting of a first character if it hasn't already been set. */
dvander@2762	5373
dvander@2762	5374	if (firstbyte == REQ_UNSET && -c > ESC_b && -c < ESC_Z)
dvander@2762	5375	firstbyte = REQ_NONE;
dvander@2762	5376
dvander@2762	5377	/* Set values to reset to if this is followed by a zero repeat. */
dvander@2762	5378
dvander@2762	5379	zerofirstbyte = firstbyte;
dvander@2762	5380	zeroreqbyte = reqbyte;
dvander@2762	5381
dvander@2762	5382	/* \g<name> or \g'name' is a subroutine call by name and \g<n> or \g'n'
dvander@2762	5383	is a subroutine call by number (Oniguruma syntax). In fact, the value
dvander@2762	5384	-ESC_g is returned only for these cases. So we don't need to check for <
dvander@2762	5385	or ' if the value is -ESC_g. For the Perl syntax \g{n} the value is
dvander@2762	5386	-ESC_REF+n, and for the Perl syntax \g{name} the result is -ESC_k (as
dvander@2762	5387	that is a synonym for a named back reference). */
dvander@2762	5388
dvander@2762	5389	if (-c == ESC_g)
dvander@2762	5390	{
dvander@2762	5391	const uschar *p;
dvander@2762	5392	save_hwm = cd->hwm; /* Normally this is set when '(' is read */
dvander@2762	5393	terminator = (*(++ptr) == CHAR_LESS_THAN_SIGN)?
dvander@2762	5394	CHAR_GREATER_THAN_SIGN : CHAR_APOSTROPHE;
dvander@2762	5395
dvander@2762	5396	/* These two statements stop the compiler for warning about possibly
dvander@2762	5397	unset variables caused by the jump to HANDLE_NUMERICAL_RECURSION. In
dvander@2762	5398	fact, because we actually check for a number below, the paths that
dvander@2762	5399	would actually be in error are never taken. */
dvander@2762	5400
dvander@2762	5401	skipbytes = 0;
dvander@2762	5402	reset_bracount = FALSE;
dvander@2762	5403
dvander@2762	5404	/* Test for a name */
dvander@2762	5405
dvander@2762	5406	if (ptr[1] != CHAR_PLUS && ptr[1] != CHAR_MINUS)
dvander@2762	5407	{
dvander@2762	5408	BOOL isnumber = TRUE;
dvander@2762	5409	for (p = ptr + 1; p != 0 && p != terminator; p++)
dvander@2762	5410	{
dvander@2762	5411	if ((cd->ctypes[*p] & ctype_digit) == 0) isnumber = FALSE;
dvander@2762	5412	if ((cd->ctypes[*p] & ctype_word) == 0) break;
dvander@2762	5413	}
dvander@2762	5414	if (*p != terminator)
dvander@2762	5415	{
dvander@2762	5416	*errorcodeptr = ERR57;
dvander@2762	5417	break;
dvander@2762	5418	}
dvander@2762	5419	if (isnumber)
dvander@2762	5420	{
dvander@2762	5421	ptr++;
dvander@2762	5422	goto HANDLE_NUMERICAL_RECURSION;
dvander@2762	5423	}
dvander@2762	5424	is_recurse = TRUE;
dvander@2762	5425	goto NAMED_REF_OR_RECURSE;
dvander@2762	5426	}
dvander@2762	5427
dvander@2762	5428	/* Test a signed number in angle brackets or quotes. */
dvander@2762	5429
dvander@2762	5430	p = ptr + 2;
dvander@2762	5431	while ((digitab[*p] & ctype_digit) != 0) p++;
dvander@2762	5432	if (*p != terminator)
dvander@2762	5433	{
dvander@2762	5434	*errorcodeptr = ERR57;
dvander@2762	5435	break;
dvander@2762	5436	}
dvander@2762	5437	ptr++;
dvander@2762	5438	goto HANDLE_NUMERICAL_RECURSION;
dvander@2762	5439	}
dvander@2762	5440
dvander@2762	5441	/* \k<name> or \k'name' is a back reference by name (Perl syntax).
dvander@2762	5442	We also support \k{name} (.NET syntax) */
dvander@2762	5443
dvander@2762	5444	if (-c == ESC_k && (ptr[1] == CHAR_LESS_THAN_SIGN \|\|
dvander@2762	5445	ptr[1] == CHAR_APOSTROPHE \|\| ptr[1] == CHAR_LEFT_CURLY_BRACKET))
dvander@2762	5446	{
dvander@2762	5447	is_recurse = FALSE;
dvander@2762	5448	terminator = (*(++ptr) == CHAR_LESS_THAN_SIGN)?
dvander@2762	5449	CHAR_GREATER_THAN_SIGN : (*ptr == CHAR_APOSTROPHE)?
dvander@2762	5450	CHAR_APOSTROPHE : CHAR_RIGHT_CURLY_BRACKET;
dvander@2762	5451	goto NAMED_REF_OR_RECURSE;
dvander@2762	5452	}
dvander@2762	5453
dvander@2762	5454	/* Back references are handled specially; must disable firstbyte if
dvander@2762	5455	not set to cope with cases like (?=(\w+))\1: which would otherwise set
dvander@2762	5456	':' later. */
dvander@2762	5457
dvander@2762	5458	if (-c >= ESC_REF)
dvander@2762	5459	{
dvander@2762	5460	recno = -c - ESC_REF;
dvander@2762	5461
dvander@2762	5462	HANDLE_REFERENCE: /* Come here from named backref handling */
dvander@2762	5463	if (firstbyte == REQ_UNSET) firstbyte = REQ_NONE;
dvander@2762	5464	previous = code;
dvander@2762	5465	*code++ = OP_REF;
dvander@2762	5466	PUT2INC(code, 0, recno);
dvander@2762	5467	cd->backref_map \|= (recno < 32)? (1 << recno) : 1;
dvander@2762	5468	if (recno > cd->top_backref) cd->top_backref = recno;
dvander@2762	5469	}
dvander@2762	5470
dvander@2762	5471	/* So are Unicode property matches, if supported. */
dvander@2762	5472
dvander@2762	5473	#ifdef SUPPORT_UCP
dvander@2762	5474	else if (-c == ESC_P \|\| -c == ESC_p)
dvander@2762	5475	{
dvander@2762	5476	BOOL negated;
dvander@2762	5477	int pdata;
dvander@2762	5478	int ptype = get_ucp(&ptr, &negated, &pdata, errorcodeptr);
dvander@2762	5479	if (ptype < 0) goto FAILED;
dvander@2762	5480	previous = code;
dvander@2762	5481	*code++ = ((-c == ESC_p) != negated)? OP_PROP : OP_NOTPROP;
dvander@2762	5482	*code++ = ptype;
dvander@2762	5483	*code++ = pdata;
dvander@2762	5484	}
dvander@2762	5485	#else
dvander@2762	5486
dvander@2762	5487	/* If Unicode properties are not supported, \X, \P, and \p are not
dvander@2762	5488	allowed. */
dvander@2762	5489
dvander@2762	5490	else if (-c == ESC_X \|\| -c == ESC_P \|\| -c == ESC_p)
dvander@2762	5491	{
dvander@2762	5492	*errorcodeptr = ERR45;
dvander@2762	5493	goto FAILED;
dvander@2762	5494	}
dvander@2762	5495	#endif
dvander@2762	5496
dvander@2762	5497	/* For the rest (including \X when Unicode properties are supported), we
dvander@2762	5498	can obtain the OP value by negating the escape value. */
dvander@2762	5499
dvander@2762	5500	else
dvander@2762	5501	{
dvander@2762	5502	previous = (-c > ESC_b && -c < ESC_Z)? code : NULL;
dvander@2762	5503	*code++ = -c;
dvander@2762	5504	}
dvander@2762	5505	continue;
dvander@2762	5506	}
dvander@2762	5507
dvander@2762	5508	/* We have a data character whose value is in c. In UTF-8 mode it may have
dvander@2762	5509	a value > 127. We set its representation in the length/buffer, and then
dvander@2762	5510	handle it as a data character. */
dvander@2762	5511
dvander@2762	5512	#ifdef SUPPORT_UTF8
dvander@2762	5513	if (utf8 && c > 127)
dvander@2762	5514	mclength = _pcre_ord2utf8(c, mcbuffer);
dvander@2762	5515	else
dvander@2762	5516	#endif
dvander@2762	5517
dvander@2762	5518	{
dvander@2762	5519	mcbuffer[0] = c;
dvander@2762	5520	mclength = 1;
dvander@2762	5521	}
dvander@2762	5522	goto ONE_CHAR;
dvander@2762	5523
dvander@2762	5524
dvander@2762	5525	/* ===================================================================*/
dvander@2762	5526	/* Handle a literal character. It is guaranteed not to be whitespace or #
dvander@2762	5527	when the extended flag is set. If we are in UTF-8 mode, it may be a
dvander@2762	5528	multi-byte literal character. */
dvander@2762	5529
dvander@2762	5530	default:
dvander@2762	5531	NORMAL_CHAR:
dvander@2762	5532	mclength = 1;
dvander@2762	5533	mcbuffer[0] = c;
dvander@2762	5534
dvander@2762	5535	#ifdef SUPPORT_UTF8
dvander@2762	5536	if (utf8 && c >= 0xc0)
dvander@2762	5537	{
dvander@2762	5538	while ((ptr[1] & 0xc0) == 0x80)
dvander@2762	5539	mcbuffer[mclength++] = *(++ptr);
dvander@2762	5540	}
dvander@2762	5541	#endif
dvander@2762	5542
dvander@2762	5543	/* At this point we have the character's bytes in mcbuffer, and the length
dvander@2762	5544	in mclength. When not in UTF-8 mode, the length is always 1. */
dvander@2762	5545
dvander@2762	5546	ONE_CHAR:
dvander@2762	5547	previous = code;
dvander@2762	5548	*code++ = ((options & PCRE_CASELESS) != 0)? OP_CHARNC : OP_CHAR;
dvander@2762	5549	for (c = 0; c < mclength; c++) *code++ = mcbuffer[c];
dvander@2762	5550
dvander@2762	5551	/* Remember if \r or \n were seen */
dvander@2762	5552
dvander@2762	5553	if (mcbuffer[0] == CHAR_CR \|\| mcbuffer[0] == CHAR_NL)
dvander@2762	5554	cd->external_flags \|= PCRE_HASCRORLF;
dvander@2762	5555
dvander@2762	5556	/* Set the first and required bytes appropriately. If no previous first
dvander@2762	5557	byte, set it from this character, but revert to none on a zero repeat.
dvander@2762	5558	Otherwise, leave the firstbyte value alone, and don't change it on a zero
dvander@2762	5559	repeat. */
dvander@2762	5560
dvander@2762	5561	if (firstbyte == REQ_UNSET)
dvander@2762	5562	{
dvander@2762	5563	zerofirstbyte = REQ_NONE;
dvander@2762	5564	zeroreqbyte = reqbyte;
dvander@2762	5565
dvander@2762	5566	/* If the character is more than one byte long, we can set firstbyte
dvander@2762	5567	only if it is not to be matched caselessly. */
dvander@2762	5568
dvander@2762	5569	if (mclength == 1 \|\| req_caseopt == 0)
dvander@2762	5570	{
dvander@2762	5571	firstbyte = mcbuffer[0] \| req_caseopt;
dvander@2762	5572	if (mclength != 1) reqbyte = code[-1] \| cd->req_varyopt;
dvander@2762	5573	}
dvander@2762	5574	else firstbyte = reqbyte = REQ_NONE;
dvander@2762	5575	}
dvander@2762	5576
dvander@2762	5577	/* firstbyte was previously set; we can set reqbyte only the length is
dvander@2762	5578	1 or the matching is caseful. */
dvander@2762	5579
dvander@2762	5580	else
dvander@2762	5581	{
dvander@2762	5582	zerofirstbyte = firstbyte;
dvander@2762	5583	zeroreqbyte = reqbyte;
dvander@2762	5584	if (mclength == 1 \|\| req_caseopt == 0)
dvander@2762	5585	reqbyte = code[-1] \| req_caseopt \| cd->req_varyopt;
dvander@2762	5586	}
dvander@2762	5587
dvander@2762	5588	break; /* End of literal character handling */
dvander@2762	5589	}
dvander@2762	5590	} /* end of big loop */
dvander@2762	5591
dvander@2762	5592
dvander@2762	5593	/* Control never reaches here by falling through, only by a goto for all the
dvander@2762	5594	error states. Pass back the position in the pattern so that it can be displayed
dvander@2762	5595	to the user for diagnosing the error. */
dvander@2762	5596
dvander@2762	5597	FAILED:
dvander@2762	5598	*ptrptr = ptr;
dvander@2762	5599	return FALSE;
dvander@2762	5600	}
dvander@2762	5601
dvander@2762	5602
dvander@2762	5603
dvander@2762	5604
dvander@2762	5605	/*************************************************
dvander@2762	5606	* Compile sequence of alternatives *
dvander@2762	5607	*************************************************/
dvander@2762	5608
dvander@2762	5609	/* On entry, ptr is pointing past the bracket character, but on return it
dvander@2762	5610	points to the closing bracket, or vertical bar, or end of string. The code
dvander@2762	5611	variable is pointing at the byte into which the BRA operator has been stored.
dvander@2762	5612	If the ims options are changed at the start (for a (?ims: group) or during any
dvander@2762	5613	branch, we need to insert an OP_OPT item at the start of every following branch
dvander@2762	5614	to ensure they get set correctly at run time, and also pass the new options
dvander@2762	5615	into every subsequent branch compile.
dvander@2762	5616
dvander@2762	5617	This function is used during the pre-compile phase when we are trying to find
dvander@2762	5618	out the amount of memory needed, as well as during the real compile phase. The
dvander@2762	5619	value of lengthptr distinguishes the two phases.
dvander@2762	5620
dvander@2762	5621	Arguments:
dvander@2762	5622	options option bits, including any changes for this subpattern
dvander@2762	5623	oldims previous settings of ims option bits
dvander@2762	5624	codeptr -> the address of the current code pointer
dvander@2762	5625	ptrptr -> the address of the current pattern pointer
dvander@2762	5626	errorcodeptr -> pointer to error code variable
dvander@2762	5627	lookbehind TRUE if this is a lookbehind assertion
dvander@2762	5628	reset_bracount TRUE to reset the count for each branch
dvander@2762	5629	skipbytes skip this many bytes at start (for brackets and OP_COND)
dvander@2762	5630	firstbyteptr place to put the first required character, or a negative number
dvander@2762	5631	reqbyteptr place to put the last required character, or a negative number
dvander@2762	5632	bcptr pointer to the chain of currently open branches
dvander@2762	5633	cd points to the data block with tables pointers etc.
dvander@2762	5634	lengthptr NULL during the real compile phase
dvander@2762	5635	points to length accumulator during pre-compile phase
dvander@2762	5636
dvander@2762	5637	Returns: TRUE on success
dvander@2762	5638	*/
dvander@2762	5639
dvander@2762	5640	static BOOL
dvander@2762	5641	compile_regex(int options, int oldims, uschar codeptr, const uschar ptrptr,
dvander@2762	5642	int *errorcodeptr, BOOL lookbehind, BOOL reset_bracount, int skipbytes,
dvander@2762	5643	int firstbyteptr, int reqbyteptr, branch_chain bcptr, compile_data cd,
dvander@2762	5644	int *lengthptr)
dvander@2762	5645	{
dvander@2762	5646	const uschar ptr = ptrptr;
dvander@2762	5647	uschar code = codeptr;
dvander@2762	5648	uschar *last_branch = code;
dvander@2762	5649	uschar *start_bracket = code;
dvander@2762	5650	uschar *reverse_count = NULL;
dvander@2762	5651	int firstbyte, reqbyte;
dvander@2762	5652	int branchfirstbyte, branchreqbyte;
dvander@2762	5653	int length;
dvander@2762	5654	int orig_bracount;
dvander@2762	5655	int max_bracount;
dvander@2762	5656	branch_chain bc;
dvander@2762	5657
dvander@2762	5658	bc.outer = bcptr;
dvander@2762	5659	bc.current = code;
dvander@2762	5660
dvander@2762	5661	firstbyte = reqbyte = REQ_UNSET;
dvander@2762	5662
dvander@2762	5663	/* Accumulate the length for use in the pre-compile phase. Start with the
dvander@2762	5664	length of the BRA and KET and any extra bytes that are required at the
dvander@2762	5665	beginning. We accumulate in a local variable to save frequent testing of
dvander@2762	5666	lenthptr for NULL. We cannot do this by looking at the value of code at the
dvander@2762	5667	start and end of each alternative, because compiled items are discarded during
dvander@2762	5668	the pre-compile phase so that the work space is not exceeded. */
dvander@2762	5669
dvander@2762	5670	length = 2 + 2*LINK_SIZE + skipbytes;
dvander@2762	5671
dvander@2762	5672	/* WARNING: If the above line is changed for any reason, you must also change
dvander@2762	5673	the code that abstracts option settings at the start of the pattern and makes
dvander@2762	5674	them global. It tests the value of length for (2 + 2*LINK_SIZE) in the
dvander@2762	5675	pre-compile phase to find out whether anything has yet been compiled or not. */
dvander@2762	5676
dvander@2762	5677	/* Offset is set zero to mark that this bracket is still open */
dvander@2762	5678
dvander@2762	5679	PUT(code, 1, 0);
dvander@2762	5680	code += 1 + LINK_SIZE + skipbytes;
dvander@2762	5681
dvander@2762	5682	/* Loop for each alternative branch */
dvander@2762	5683
dvander@2762	5684	orig_bracount = max_bracount = cd->bracount;
dvander@2762	5685	for (;;)
dvander@2762	5686	{
dvander@2762	5687	/* For a (?\| group, reset the capturing bracket count so that each branch
dvander@2762	5688	uses the same numbers. */
dvander@2762	5689
dvander@2762	5690	if (reset_bracount) cd->bracount = orig_bracount;
dvander@2762	5691
dvander@2762	5692	/* Handle a change of ims options at the start of the branch */
dvander@2762	5693
dvander@2762	5694	if ((options & PCRE_IMS) != oldims)
dvander@2762	5695	{
dvander@2762	5696	*code++ = OP_OPT;
dvander@2762	5697	*code++ = options & PCRE_IMS;
dvander@2762	5698	length += 2;
dvander@2762	5699	}
dvander@2762	5700
dvander@2762	5701	/* Set up dummy OP_REVERSE if lookbehind assertion */
dvander@2762	5702
dvander@2762	5703	if (lookbehind)
dvander@2762	5704	{
dvander@2762	5705	*code++ = OP_REVERSE;
dvander@2762	5706	reverse_count = code;
dvander@2762	5707	PUTINC(code, 0, 0);
dvander@2762	5708	length += 1 + LINK_SIZE;
dvander@2762	5709	}
dvander@2762	5710
dvander@2762	5711	/* Now compile the branch; in the pre-compile phase its length gets added
dvander@2762	5712	into the length. */
dvander@2762	5713
dvander@2762	5714	if (!compile_branch(&options, &code, &ptr, errorcodeptr, &branchfirstbyte,
dvander@2762	5715	&branchreqbyte, &bc, cd, (lengthptr == NULL)? NULL : &length))
dvander@2762	5716	{
dvander@2762	5717	*ptrptr = ptr;
dvander@2762	5718	return FALSE;
dvander@2762	5719	}
dvander@2762	5720
dvander@2762	5721	/* Keep the highest bracket count in case (?\| was used and some branch
dvander@2762	5722	has fewer than the rest. */
dvander@2762	5723
dvander@2762	5724	if (cd->bracount > max_bracount) max_bracount = cd->bracount;
dvander@2762	5725
dvander@2762	5726	/* In the real compile phase, there is some post-processing to be done. */
dvander@2762	5727
dvander@2762	5728	if (lengthptr == NULL)
dvander@2762	5729	{
dvander@2762	5730	/* If this is the first branch, the firstbyte and reqbyte values for the
dvander@2762	5731	branch become the values for the regex. */
dvander@2762	5732
dvander@2762	5733	if (*last_branch != OP_ALT)
dvander@2762	5734	{
dvander@2762	5735	firstbyte = branchfirstbyte;
dvander@2762	5736	reqbyte = branchreqbyte;
dvander@2762	5737	}
dvander@2762	5738
dvander@2762	5739	/* If this is not the first branch, the first char and reqbyte have to
dvander@2762	5740	match the values from all the previous branches, except that if the
dvander@2762	5741	previous value for reqbyte didn't have REQ_VARY set, it can still match,
dvander@2762	5742	and we set REQ_VARY for the regex. */
dvander@2762	5743
dvander@2762	5744	else
dvander@2762	5745	{
dvander@2762	5746	/* If we previously had a firstbyte, but it doesn't match the new branch,
dvander@2762	5747	we have to abandon the firstbyte for the regex, but if there was
dvander@2762	5748	previously no reqbyte, it takes on the value of the old firstbyte. */
dvander@2762	5749
dvander@2762	5750	if (firstbyte >= 0 && firstbyte != branchfirstbyte)
dvander@2762	5751	{
dvander@2762	5752	if (reqbyte < 0) reqbyte = firstbyte;
dvander@2762	5753	firstbyte = REQ_NONE;
dvander@2762	5754	}
dvander@2762	5755
dvander@2762	5756	/* If we (now or from before) have no firstbyte, a firstbyte from the
dvander@2762	5757	branch becomes a reqbyte if there isn't a branch reqbyte. */
dvander@2762	5758
dvander@2762	5759	if (firstbyte < 0 && branchfirstbyte >= 0 && branchreqbyte < 0)
dvander@2762	5760	branchreqbyte = branchfirstbyte;
dvander@2762	5761
dvander@2762	5762	/* Now ensure that the reqbytes match */
dvander@2762	5763
dvander@2762	5764	if ((reqbyte & ~REQ_VARY) != (branchreqbyte & ~REQ_VARY))
dvander@2762	5765	reqbyte = REQ_NONE;
dvander@2762	5766	else reqbyte \|= branchreqbyte; /* To "or" REQ_VARY */
dvander@2762	5767	}
dvander@2762	5768
dvander@2762	5769	/* If lookbehind, check that this branch matches a fixed-length string, and
dvander@2762	5770	put the length into the OP_REVERSE item. Temporarily mark the end of the
dvander@2762	5771	branch with OP_END. */
dvander@2762	5772
dvander@2762	5773	if (lookbehind)
dvander@2762	5774	{
dvander@2762	5775	int fixed_length;
dvander@2762	5776	*code = OP_END;
dvander@2762	5777	fixed_length = find_fixedlength(last_branch, options);
dvander@2762	5778	DPRINTF(("fixed length = %d\n", fixed_length));
dvander@2762	5779	if (fixed_length < 0)
dvander@2762	5780	{
dvander@2762	5781	*errorcodeptr = (fixed_length == -2)? ERR36 : ERR25;
dvander@2762	5782	*ptrptr = ptr;
dvander@2762	5783	return FALSE;
dvander@2762	5784	}
dvander@2762	5785	PUT(reverse_count, 0, fixed_length);
dvander@2762	5786	}
dvander@2762	5787	}
dvander@2762	5788
dvander@2762	5789	/* Reached end of expression, either ')' or end of pattern. In the real
dvander@2762	5790	compile phase, go back through the alternative branches and reverse the chain
dvander@2762	5791	of offsets, with the field in the BRA item now becoming an offset to the
dvander@2762	5792	first alternative. If there are no alternatives, it points to the end of the
dvander@2762	5793	group. The length in the terminating ket is always the length of the whole
dvander@2762	5794	bracketed item. If any of the ims options were changed inside the group,
dvander@2762	5795	compile a resetting op-code following, except at the very end of the pattern.
dvander@2762	5796	Return leaving the pointer at the terminating char. */
dvander@2762	5797
dvander@2762	5798	if (*ptr != CHAR_VERTICAL_LINE)
dvander@2762	5799	{
dvander@2762	5800	if (lengthptr == NULL)
dvander@2762	5801	{
dvander@2762	5802	int branch_length = code - last_branch;
dvander@2762	5803	do
dvander@2762	5804	{
dvander@2762	5805	int prev_length = GET(last_branch, 1);
dvander@2762	5806	PUT(last_branch, 1, branch_length);
dvander@2762	5807	branch_length = prev_length;
dvander@2762	5808	last_branch -= branch_length;
dvander@2762	5809	}
dvander@2762	5810	while (branch_length > 0);
dvander@2762	5811	}
dvander@2762	5812
dvander@2762	5813	/* Fill in the ket */
dvander@2762	5814
dvander@2762	5815	*code = OP_KET;
dvander@2762	5816	PUT(code, 1, code - start_bracket);
dvander@2762	5817	code += 1 + LINK_SIZE;
dvander@2762	5818
dvander@2762	5819	/* Resetting option if needed */
dvander@2762	5820
dvander@2762	5821	if ((options & PCRE_IMS) != oldims && *ptr == CHAR_RIGHT_PARENTHESIS)
dvander@2762	5822	{
dvander@2762	5823	*code++ = OP_OPT;
dvander@2762	5824	*code++ = oldims;
dvander@2762	5825	length += 2;
dvander@2762	5826	}
dvander@2762	5827
dvander@2762	5828	/* Retain the highest bracket number, in case resetting was used. */
dvander@2762	5829
dvander@2762	5830	cd->bracount = max_bracount;
dvander@2762	5831
dvander@2762	5832	/* Set values to pass back */
dvander@2762	5833
dvander@2762	5834	*codeptr = code;
dvander@2762	5835	*ptrptr = ptr;
dvander@2762	5836	*firstbyteptr = firstbyte;
dvander@2762	5837	*reqbyteptr = reqbyte;
dvander@2762	5838	if (lengthptr != NULL)
dvander@2762	5839	{
dvander@2762	5840	if (OFLOW_MAX - *lengthptr < length)
dvander@2762	5841	{
dvander@2762	5842	*errorcodeptr = ERR20;
dvander@2762	5843	return FALSE;
dvander@2762	5844	}
dvander@2762	5845	*lengthptr += length;
dvander@2762	5846	}
dvander@2762	5847	return TRUE;
dvander@2762	5848	}
dvander@2762	5849
dvander@2762	5850	/* Another branch follows. In the pre-compile phase, we can move the code
dvander@2762	5851	pointer back to where it was for the start of the first branch. (That is,
dvander@2762	5852	pretend that each branch is the only one.)
dvander@2762	5853
dvander@2762	5854	In the real compile phase, insert an ALT node. Its length field points back
dvander@2762	5855	to the previous branch while the bracket remains open. At the end the chain
dvander@2762	5856	is reversed. It's done like this so that the start of the bracket has a
dvander@2762	5857	zero offset until it is closed, making it possible to detect recursion. */
dvander@2762	5858
dvander@2762	5859	if (lengthptr != NULL)
dvander@2762	5860	{
dvander@2762	5861	code = *codeptr + 1 + LINK_SIZE + skipbytes;
dvander@2762	5862	length += 1 + LINK_SIZE;
dvander@2762	5863	}
dvander@2762	5864	else
dvander@2762	5865	{
dvander@2762	5866	*code = OP_ALT;
dvander@2762	5867	PUT(code, 1, code - last_branch);
dvander@2762	5868	bc.current = last_branch = code;
dvander@2762	5869	code += 1 + LINK_SIZE;
dvander@2762	5870	}
dvander@2762	5871
dvander@2762	5872	ptr++;
dvander@2762	5873	}
dvander@2762	5874	/* Control never reaches here */
dvander@2762	5875	}
dvander@2762	5876
dvander@2762	5877
dvander@2762	5878
dvander@2762	5879
dvander@2762	5880	/*************************************************
dvander@2762	5881	* Check for anchored expression *
dvander@2762	5882	*************************************************/
dvander@2762	5883
dvander@2762	5884	/* Try to find out if this is an anchored regular expression. Consider each
dvander@2762	5885	alternative branch. If they all start with OP_SOD or OP_CIRC, or with a bracket
dvander@2762	5886	all of whose alternatives start with OP_SOD or OP_CIRC (recurse ad lib), then
dvander@2762	5887	it's anchored. However, if this is a multiline pattern, then only OP_SOD
dvander@2762	5888	counts, since OP_CIRC can match in the middle.
dvander@2762	5889
dvander@2762	5890	We can also consider a regex to be anchored if OP_SOM starts all its branches.
dvander@2762	5891	This is the code for \G, which means "match at start of match position, taking
dvander@2762	5892	into account the match offset".
dvander@2762	5893
dvander@2762	5894	A branch is also implicitly anchored if it starts with .* and DOTALL is set,
dvander@2762	5895	because that will try the rest of the pattern at all possible matching points,
dvander@2762	5896	so there is no point trying again.... er ....
dvander@2762	5897
dvander@2762	5898	.... except when the .* appears inside capturing parentheses, and there is a
dvander@2762	5899	subsequent back reference to those parentheses. We haven't enough information
dvander@2762	5900	to catch that case precisely.
dvander@2762	5901
dvander@2762	5902	At first, the best we could do was to detect when .* was in capturing brackets
dvander@2762	5903	and the highest back reference was greater than or equal to that level.
dvander@2762	5904	However, by keeping a bitmap of the first 31 back references, we can catch some
dvander@2762	5905	of the more common cases more precisely.
dvander@2762	5906
dvander@2762	5907	Arguments:
dvander@2762	5908	code points to start of expression (the bracket)
dvander@2762	5909	options points to the options setting
dvander@2762	5910	bracket_map a bitmap of which brackets we are inside while testing; this
dvander@2762	5911	handles up to substring 31; after that we just have to take
dvander@2762	5912	the less precise approach
dvander@2762	5913	backref_map the back reference bitmap
dvander@2762	5914
dvander@2762	5915	Returns: TRUE or FALSE
dvander@2762	5916	*/
dvander@2762	5917
dvander@2762	5918	static BOOL
dvander@2762	5919	is_anchored(register const uschar code, int options, unsigned int bracket_map,
dvander@2762	5920	unsigned int backref_map)
dvander@2762	5921	{
dvander@2762	5922	do {
dvander@2762	5923	const uschar scode = first_significant_code(code + _pcre_OP_lengths[code],
dvander@2762	5924	options, PCRE_MULTILINE, FALSE);
dvander@2762	5925	register int op = *scode;
dvander@2762	5926
dvander@2762	5927	/* Non-capturing brackets */
dvander@2762	5928
dvander@2762	5929	if (op == OP_BRA)
dvander@2762	5930	{
dvander@2762	5931	if (!is_anchored(scode, options, bracket_map, backref_map)) return FALSE;
dvander@2762	5932	}
dvander@2762	5933
dvander@2762	5934	/* Capturing brackets */
dvander@2762	5935
dvander@2762	5936	else if (op == OP_CBRA)
dvander@2762	5937	{
dvander@2762	5938	int n = GET2(scode, 1+LINK_SIZE);
dvander@2762	5939	int new_map = bracket_map \| ((n < 32)? (1 << n) : 1);
dvander@2762	5940	if (!is_anchored(scode, options, new_map, backref_map)) return FALSE;
dvander@2762	5941	}
dvander@2762	5942
dvander@2762	5943	/* Other brackets */
dvander@2762	5944
dvander@2762	5945	else if (op == OP_ASSERT \|\| op == OP_ONCE \|\| op == OP_COND)
dvander@2762	5946	{
dvander@2762	5947	if (!is_anchored(scode, options, bracket_map, backref_map)) return FALSE;
dvander@2762	5948	}
dvander@2762	5949
dvander@2762	5950	/* .* is not anchored unless DOTALL is set (which generates OP_ALLANY) and
dvander@2762	5951	it isn't in brackets that are or may be referenced. */
dvander@2762	5952
dvander@2762	5953	else if ((op == OP_TYPESTAR \|\| op == OP_TYPEMINSTAR \|\|
dvander@2762	5954	op == OP_TYPEPOSSTAR))
dvander@2762	5955	{
dvander@2762	5956	if (scode[1] != OP_ALLANY \|\| (bracket_map & backref_map) != 0)
dvander@2762	5957	return FALSE;
dvander@2762	5958	}
dvander@2762	5959
dvander@2762	5960	/* Check for explicit anchoring */
dvander@2762	5961
dvander@2762	5962	else if (op != OP_SOD && op != OP_SOM &&
dvander@2762	5963	((*options & PCRE_MULTILINE) != 0 \|\| op != OP_CIRC))
dvander@2762	5964	return FALSE;
dvander@2762	5965	code += GET(code, 1);
dvander@2762	5966	}
dvander@2762	5967	while (code == OP_ALT); / Loop for each alternative */
dvander@2762	5968	return TRUE;
dvander@2762	5969	}
dvander@2762	5970
dvander@2762	5971
dvander@2762	5972
dvander@2762	5973	/*************************************************
dvander@2762	5974	* Check for starting with ^ or .* *
dvander@2762	5975	*************************************************/
dvander@2762	5976
dvander@2762	5977	/* This is called to find out if every branch starts with ^ or .* so that
dvander@2762	5978	"first char" processing can be done to speed things up in multiline
dvander@2762	5979	matching and for non-DOTALL patterns that start with .* (which must start at
dvander@2762	5980	the beginning or after \n). As in the case of is_anchored() (see above), we
dvander@2762	5981	have to take account of back references to capturing brackets that contain .*
dvander@2762	5982	because in that case we can't make the assumption.
dvander@2762	5983
dvander@2762	5984	Arguments:
dvander@2762	5985	code points to start of expression (the bracket)
dvander@2762	5986	bracket_map a bitmap of which brackets we are inside while testing; this
dvander@2762	5987	handles up to substring 31; after that we just have to take
dvander@2762	5988	the less precise approach
dvander@2762	5989	backref_map the back reference bitmap
dvander@2762	5990
dvander@2762	5991	Returns: TRUE or FALSE
dvander@2762	5992	*/
dvander@2762	5993
dvander@2762	5994	static BOOL
dvander@2762	5995	is_startline(const uschar *code, unsigned int bracket_map,
dvander@2762	5996	unsigned int backref_map)
dvander@2762	5997	{
dvander@2762	5998	do {
dvander@2762	5999	const uschar scode = first_significant_code(code + _pcre_OP_lengths[code],
dvander@2762	6000	NULL, 0, FALSE);
dvander@2762	6001	register int op = *scode;
dvander@2762	6002
dvander@2762	6003	/* If we are at the start of a conditional assertion group, both the
dvander@2762	6004	conditional assertion and what follows the condition must satisfy the test
dvander@2762	6005	for start of line. Other kinds of condition fail. Note that there may be an
dvander@2762	6006	auto-callout at the start of a condition. */
dvander@2762	6007
dvander@2762	6008	if (op == OP_COND)
dvander@2762	6009	{
dvander@2762	6010	scode += 1 + LINK_SIZE;
dvander@2762	6011	if (*scode == OP_CALLOUT) scode += _pcre_OP_lengths[OP_CALLOUT];
dvander@2762	6012	switch (*scode)
dvander@2762	6013	{
dvander@2762	6014	case OP_CREF:
dvander@2762	6015	case OP_RREF:
dvander@2762	6016	case OP_DEF:
dvander@2762	6017	return FALSE;
dvander@2762	6018
dvander@2762	6019	default: /* Assertion */
dvander@2762	6020	if (!is_startline(scode, bracket_map, backref_map)) return FALSE;
dvander@2762	6021	do scode += GET(scode, 1); while (*scode == OP_ALT);
dvander@2762	6022	scode += 1 + LINK_SIZE;
dvander@2762	6023	break;
dvander@2762	6024	}
dvander@2762	6025	scode = first_significant_code(scode, NULL, 0, FALSE);
dvander@2762	6026	op = *scode;
dvander@2762	6027	}
dvander@2762	6028
dvander@2762	6029	/* Non-capturing brackets */
dvander@2762	6030
dvander@2762	6031	if (op == OP_BRA)
dvander@2762	6032	{
dvander@2762	6033	if (!is_startline(scode, bracket_map, backref_map)) return FALSE;
dvander@2762	6034	}
dvander@2762	6035
dvander@2762	6036	/* Capturing brackets */
dvander@2762	6037
dvander@2762	6038	else if (op == OP_CBRA)
dvander@2762	6039	{
dvander@2762	6040	int n = GET2(scode, 1+LINK_SIZE);
dvander@2762	6041	int new_map = bracket_map \| ((n < 32)? (1 << n) : 1);
dvander@2762	6042	if (!is_startline(scode, new_map, backref_map)) return FALSE;
dvander@2762	6043	}
dvander@2762	6044
dvander@2762	6045	/* Other brackets */
dvander@2762	6046
dvander@2762	6047	else if (op == OP_ASSERT \|\| op == OP_ONCE)
dvander@2762	6048	{
dvander@2762	6049	if (!is_startline(scode, bracket_map, backref_map)) return FALSE;
dvander@2762	6050	}
dvander@2762	6051
dvander@2762	6052	/* .* means "start at start or after \n" if it isn't in brackets that
dvander@2762	6053	may be referenced. */
dvander@2762	6054
dvander@2762	6055	else if (op == OP_TYPESTAR \|\| op == OP_TYPEMINSTAR \|\| op == OP_TYPEPOSSTAR)
dvander@2762	6056	{
dvander@2762	6057	if (scode[1] != OP_ANY \|\| (bracket_map & backref_map) != 0) return FALSE;
dvander@2762	6058	}
dvander@2762	6059
dvander@2762	6060	/* Check for explicit circumflex */
dvander@2762	6061
dvander@2762	6062	else if (op != OP_CIRC) return FALSE;
dvander@2762	6063
dvander@2762	6064	/* Move on to the next alternative */
dvander@2762	6065
dvander@2762	6066	code += GET(code, 1);
dvander@2762	6067	}
dvander@2762	6068	while (code == OP_ALT); / Loop for each alternative */
dvander@2762	6069	return TRUE;
dvander@2762	6070	}
dvander@2762	6071
dvander@2762	6072
dvander@2762	6073
dvander@2762	6074	/*************************************************
dvander@2762	6075	* Check for asserted fixed first char *
dvander@2762	6076	*************************************************/
dvander@2762	6077
dvander@2762	6078	/* During compilation, the "first char" settings from forward assertions are
dvander@2762	6079	discarded, because they can cause conflicts with actual literals that follow.
dvander@2762	6080	However, if we end up without a first char setting for an unanchored pattern,
dvander@2762	6081	it is worth scanning the regex to see if there is an initial asserted first
dvander@2762	6082	char. If all branches start with the same asserted char, or with a bracket all
dvander@2762	6083	of whose alternatives start with the same asserted char (recurse ad lib), then
dvander@2762	6084	we return that char, otherwise -1.
dvander@2762	6085
dvander@2762	6086	Arguments:
dvander@2762	6087	code points to start of expression (the bracket)
dvander@2762	6088	options pointer to the options (used to check casing changes)
dvander@2762	6089	inassert TRUE if in an assertion
dvander@2762	6090
dvander@2762	6091	Returns: -1 or the fixed first char
dvander@2762	6092	*/
dvander@2762	6093
dvander@2762	6094	static int
dvander@2762	6095	find_firstassertedchar(const uschar code, int options, BOOL inassert)
dvander@2762	6096	{
dvander@2762	6097	register int c = -1;
dvander@2762	6098	do {
dvander@2762	6099	int d;
dvander@2762	6100	const uschar *scode =
dvander@2762	6101	first_significant_code(code + 1+LINK_SIZE, options, PCRE_CASELESS, TRUE);
dvander@2762	6102	register int op = *scode;
dvander@2762	6103
dvander@2762	6104	switch(op)
dvander@2762	6105	{
dvander@2762	6106	default:
dvander@2762	6107	return -1;
dvander@2762	6108
dvander@2762	6109	case OP_BRA:
dvander@2762	6110	case OP_CBRA:
dvander@2762	6111	case OP_ASSERT:
dvander@2762	6112	case OP_ONCE:
dvander@2762	6113	case OP_COND:
dvander@2762	6114	if ((d = find_firstassertedchar(scode, options, op == OP_ASSERT)) < 0)
dvander@2762	6115	return -1;
dvander@2762	6116	if (c < 0) c = d; else if (c != d) return -1;
dvander@2762	6117	break;
dvander@2762	6118
dvander@2762	6119	case OP_EXACT: /* Fall through */
dvander@2762	6120	scode += 2;
dvander@2762	6121
dvander@2762	6122	case OP_CHAR:
dvander@2762	6123	case OP_CHARNC:
dvander@2762	6124	case OP_PLUS:
dvander@2762	6125	case OP_MINPLUS:
dvander@2762	6126	case OP_POSPLUS:
dvander@2762	6127	if (!inassert) return -1;
dvander@2762	6128	if (c < 0)
dvander@2762	6129	{
dvander@2762	6130	c = scode[1];
dvander@2762	6131	if ((*options & PCRE_CASELESS) != 0) c \|= REQ_CASELESS;
dvander@2762	6132	}
dvander@2762	6133	else if (c != scode[1]) return -1;
dvander@2762	6134	break;
dvander@2762	6135	}
dvander@2762	6136
dvander@2762	6137	code += GET(code, 1);
dvander@2762	6138	}
dvander@2762	6139	while (*code == OP_ALT);
dvander@2762	6140	return c;
dvander@2762	6141	}
dvander@2762	6142
dvander@2762	6143
dvander@2762	6144
dvander@2762	6145	/*************************************************
dvander@2762	6146	* Compile a Regular Expression *
dvander@2762	6147	*************************************************/
dvander@2762	6148
dvander@2762	6149	/* This function takes a string and returns a pointer to a block of store
dvander@2762	6150	holding a compiled version of the expression. The original API for this
dvander@2762	6151	function had no error code return variable; it is retained for backwards
dvander@2762	6152	compatibility. The new function is given a new name.
dvander@2762	6153
dvander@2762	6154	Arguments:
dvander@2762	6155	pattern the regular expression
dvander@2762	6156	options various option bits
dvander@2762	6157	errorcodeptr pointer to error code variable (pcre_compile2() only)
dvander@2762	6158	can be NULL if you don't want a code value
dvander@2762	6159	errorptr pointer to pointer to error text
dvander@2762	6160	erroroffset ptr offset in pattern where error was detected
dvander@2762	6161	tables pointer to character tables or NULL
dvander@2762	6162
dvander@2762	6163	Returns: pointer to compiled data block, or NULL on error,
dvander@2762	6164	with errorptr and erroroffset set
dvander@2762	6165	*/
dvander@2762	6166
dvander@2762	6167	PCRE_EXP_DEFN pcre * PCRE_CALL_CONVENTION
dvander@2762	6168	pcre_compile(const char pattern, int options, const char *errorptr,
dvander@2762	6169	int erroroffset, const unsigned char tables)
dvander@2762	6170	{
dvander@2762	6171	return pcre_compile2(pattern, options, NULL, errorptr, erroroffset, tables);
dvander@2762	6172	}
dvander@2762	6173
dvander@2762	6174
dvander@2762	6175	PCRE_EXP_DEFN pcre * PCRE_CALL_CONVENTION
dvander@2762	6176	pcre_compile2(const char pattern, int options, int errorcodeptr,
dvander@2762	6177	const char *errorptr, int erroroffset, const unsigned char *tables)
dvander@2762	6178	{
dvander@2762	6179	real_pcre *re;
dvander@2762	6180	int length = 1; /* For final END opcode */
dvander@2762	6181	int firstbyte, reqbyte, newline;
dvander@2762	6182	int errorcode = 0;
dvander@2762	6183	int skipatstart = 0;
dvander@2762	6184	#ifdef SUPPORT_UTF8
dvander@2762	6185	BOOL utf8;
dvander@2762	6186	#endif
dvander@2762	6187	size_t size;
dvander@2762	6188	uschar *code;
dvander@2762	6189	const uschar *codestart;
dvander@2762	6190	const uschar *ptr;
dvander@2762	6191	compile_data compile_block;
dvander@2762	6192	compile_data *cd = &compile_block;
dvander@2762	6193
dvander@2762	6194	/* This space is used for "compiling" into during the first phase, when we are
dvander@2762	6195	computing the amount of memory that is needed. Compiled items are thrown away
dvander@2762	6196	as soon as possible, so that a fairly large buffer should be sufficient for
dvander@2762	6197	this purpose. The same space is used in the second phase for remembering where
dvander@2762	6198	to fill in forward references to subpatterns. */
dvander@2762	6199
dvander@2762	6200	uschar cworkspace[COMPILE_WORK_SIZE];
dvander@2762	6201
dvander@2762	6202	/* Set this early so that early errors get offset 0. */
dvander@2762	6203
dvander@2762	6204	ptr = (const uschar *)pattern;
dvander@2762	6205
dvander@2762	6206	/* We can't pass back an error message if errorptr is NULL; I guess the best we
dvander@2762	6207	can do is just return NULL, but we can set a code value if there is a code
dvander@2762	6208	pointer. */
dvander@2762	6209
dvander@2762	6210	if (errorptr == NULL)
dvander@2762	6211	{
dvander@2762	6212	if (errorcodeptr != NULL) *errorcodeptr = 99;
dvander@2762	6213	return NULL;
dvander@2762	6214	}
dvander@2762	6215
dvander@2762	6216	*errorptr = NULL;
dvander@2762	6217	if (errorcodeptr != NULL) *errorcodeptr = ERR0;
dvander@2762	6218
dvander@2762	6219	/* However, we can give a message for this error */
dvander@2762	6220
dvander@2762	6221	if (erroroffset == NULL)
dvander@2762	6222	{
dvander@2762	6223	errorcode = ERR16;
dvander@2762	6224	goto PCRE_EARLY_ERROR_RETURN2;
dvander@2762	6225	}
dvander@2762	6226
dvander@2762	6227	*erroroffset = 0;
dvander@2762	6228
dvander@2762	6229	/* Set up pointers to the individual character tables */
dvander@2762	6230
dvander@2762	6231	if (tables == NULL) tables = _pcre_default_tables;
dvander@2762	6232	cd->lcc = tables + lcc_offset;
dvander@2762	6233	cd->fcc = tables + fcc_offset;
dvander@2762	6234	cd->cbits = tables + cbits_offset;
dvander@2762	6235	cd->ctypes = tables + ctypes_offset;
dvander@2762	6236
dvander@2762	6237	/* Check that all undefined public option bits are zero */
dvander@2762	6238
dvander@2762	6239	if ((options & ~PUBLIC_COMPILE_OPTIONS) != 0)
dvander@2762	6240	{
dvander@2762	6241	errorcode = ERR17;
dvander@2762	6242	goto PCRE_EARLY_ERROR_RETURN;
dvander@2762	6243	}
dvander@2762	6244
dvander@2762	6245	/* Check for global one-time settings at the start of the pattern, and remember
dvander@2762	6246	the offset for later. */
dvander@2762	6247
dvander@2762	6248	while (ptr[skipatstart] == CHAR_LEFT_PARENTHESIS &&
dvander@2762	6249	ptr[skipatstart+1] == CHAR_ASTERISK)
dvander@2762	6250	{
dvander@2762	6251	int newnl = 0;
dvander@2762	6252	int newbsr = 0;
dvander@2762	6253
dvander@2762	6254	if (strncmp((char *)(ptr+skipatstart+2), STRING_UTF8_RIGHTPAR, 5) == 0)
dvander@2762	6255	{ skipatstart += 7; options \|= PCRE_UTF8; continue; }
dvander@2762	6256
dvander@2762	6257	if (strncmp((char *)(ptr+skipatstart+2), STRING_CR_RIGHTPAR, 3) == 0)
dvander@2762	6258	{ skipatstart += 5; newnl = PCRE_NEWLINE_CR; }
dvander@2762	6259	else if (strncmp((char *)(ptr+skipatstart+2), STRING_LF_RIGHTPAR, 3) == 0)
dvander@2762	6260	{ skipatstart += 5; newnl = PCRE_NEWLINE_LF; }
dvander@2762	6261	else if (strncmp((char *)(ptr+skipatstart+2), STRING_CRLF_RIGHTPAR, 5) == 0)
dvander@2762	6262	{ skipatstart += 7; newnl = PCRE_NEWLINE_CR + PCRE_NEWLINE_LF; }
dvander@2762	6263	else if (strncmp((char *)(ptr+skipatstart+2), STRING_ANY_RIGHTPAR, 4) == 0)
dvander@2762	6264	{ skipatstart += 6; newnl = PCRE_NEWLINE_ANY; }
dvander@2762	6265	else if (strncmp((char *)(ptr+skipatstart+2), STRING_ANYCRLF_RIGHTPAR, 8) == 0)
dvander@2762	6266	{ skipatstart += 10; newnl = PCRE_NEWLINE_ANYCRLF; }
dvander@2762	6267
dvander@2762	6268	else if (strncmp((char *)(ptr+skipatstart+2), STRING_BSR_ANYCRLF_RIGHTPAR, 12) == 0)
dvander@2762	6269	{ skipatstart += 14; newbsr = PCRE_BSR_ANYCRLF; }
dvander@2762	6270	else if (strncmp((char *)(ptr+skipatstart+2), STRING_BSR_UNICODE_RIGHTPAR, 12) == 0)
dvander@2762	6271	{ skipatstart += 14; newbsr = PCRE_BSR_UNICODE; }
dvander@2762	6272
dvander@2762	6273	if (newnl != 0)
dvander@2762	6274	options = (options & ~PCRE_NEWLINE_BITS) \| newnl;
dvander@2762	6275	else if (newbsr != 0)
dvander@2762	6276	options = (options & ~(PCRE_BSR_ANYCRLF\|PCRE_BSR_UNICODE)) \| newbsr;
dvander@2762	6277	else break;
dvander@2762	6278	}
dvander@2762	6279
dvander@2762	6280	/* Can't support UTF8 unless PCRE has been compiled to include the code. */
dvander@2762	6281
dvander@2762	6282	#ifdef SUPPORT_UTF8
dvander@2762	6283	utf8 = (options & PCRE_UTF8) != 0;
dvander@2762	6284	if (utf8 && (options & PCRE_NO_UTF8_CHECK) == 0 &&
dvander@2762	6285	(erroroffset = _pcre_valid_utf8((uschar )pattern, -1)) >= 0)
dvander@2762	6286	{
dvander@2762	6287	errorcode = ERR44;
dvander@2762	6288	goto PCRE_EARLY_ERROR_RETURN2;
dvander@2762	6289	}
dvander@2762	6290	#else
dvander@2762	6291	if ((options & PCRE_UTF8) != 0)
dvander@2762	6292	{
dvander@2762	6293	errorcode = ERR32;
dvander@2762	6294	goto PCRE_EARLY_ERROR_RETURN;
dvander@2762	6295	}
dvander@2762	6296	#endif
dvander@2762	6297
dvander@2762	6298	/* Check validity of \R options. */
dvander@2762	6299
dvander@2762	6300	switch (options & (PCRE_BSR_ANYCRLF\|PCRE_BSR_UNICODE))
dvander@2762	6301	{
dvander@2762	6302	case 0:
dvander@2762	6303	case PCRE_BSR_ANYCRLF:
dvander@2762	6304	case PCRE_BSR_UNICODE:
dvander@2762	6305	break;
dvander@2762	6306	default: errorcode = ERR56; goto PCRE_EARLY_ERROR_RETURN;
dvander@2762	6307	}
dvander@2762	6308
dvander@2762	6309	/* Handle different types of newline. The three bits give seven cases. The
dvander@2762	6310	current code allows for fixed one- or two-byte sequences, plus "any" and
dvander@2762	6311	"anycrlf". */
dvander@2762	6312
dvander@2762	6313	switch (options & PCRE_NEWLINE_BITS)
dvander@2762	6314	{
dvander@2762	6315	case 0: newline = NEWLINE; break; /* Build-time default */
dvander@2762	6316	case PCRE_NEWLINE_CR: newline = CHAR_CR; break;
dvander@2762	6317	case PCRE_NEWLINE_LF: newline = CHAR_NL; break;
dvander@2762	6318	case PCRE_NEWLINE_CR+
dvander@2762	6319	PCRE_NEWLINE_LF: newline = (CHAR_CR << 8) \| CHAR_NL; break;
dvander@2762	6320	case PCRE_NEWLINE_ANY: newline = -1; break;
dvander@2762	6321	case PCRE_NEWLINE_ANYCRLF: newline = -2; break;
dvander@2762	6322	default: errorcode = ERR56; goto PCRE_EARLY_ERROR_RETURN;
dvander@2762	6323	}
dvander@2762	6324
dvander@2762	6325	if (newline == -2)
dvander@2762	6326	{
dvander@2762	6327	cd->nltype = NLTYPE_ANYCRLF;
dvander@2762	6328	}
dvander@2762	6329	else if (newline < 0)
dvander@2762	6330	{
dvander@2762	6331	cd->nltype = NLTYPE_ANY;
dvander@2762	6332	}
dvander@2762	6333	else
dvander@2762	6334	{
dvander@2762	6335	cd->nltype = NLTYPE_FIXED;
dvander@2762	6336	if (newline > 255)
dvander@2762	6337	{
dvander@2762	6338	cd->nllen = 2;
dvander@2762	6339	cd->nl[0] = (newline >> 8) & 255;
dvander@2762	6340	cd->nl[1] = newline & 255;
dvander@2762	6341	}
dvander@2762	6342	else
dvander@2762	6343	{
dvander@2762	6344	cd->nllen = 1;
dvander@2762	6345	cd->nl[0] = newline;
dvander@2762	6346	}
dvander@2762	6347	}
dvander@2762	6348
dvander@2762	6349	/* Maximum back reference and backref bitmap. The bitmap records up to 31 back
dvander@2762	6350	references to help in deciding whether (.*) can be treated as anchored or not.
dvander@2762	6351	*/
dvander@2762	6352
dvander@2762	6353	cd->top_backref = 0;
dvander@2762	6354	cd->backref_map = 0;
dvander@2762	6355
dvander@2762	6356	/* Reflect pattern for debugging output */
dvander@2762	6357
dvander@2762	6358	DPRINTF(("------------------------------------------------------------------\n"));
dvander@2762	6359	DPRINTF(("%s\n", pattern));
dvander@2762	6360
dvander@2762	6361	/* Pretend to compile the pattern while actually just accumulating the length
dvander@2762	6362	of memory required. This behaviour is triggered by passing a non-NULL final
dvander@2762	6363	argument to compile_regex(). We pass a block of workspace (cworkspace) for it
dvander@2762	6364	to compile parts of the pattern into; the compiled code is discarded when it is
dvander@2762	6365	no longer needed, so hopefully this workspace will never overflow, though there
dvander@2762	6366	is a test for its doing so. */
dvander@2762	6367
dvander@2762	6368	cd->bracount = cd->final_bracount = 0;
dvander@2762	6369	cd->names_found = 0;
dvander@2762	6370	cd->name_entry_size = 0;
dvander@2762	6371	cd->name_table = NULL;
dvander@2762	6372	cd->start_workspace = cworkspace;
dvander@2762	6373	cd->start_code = cworkspace;
dvander@2762	6374	cd->hwm = cworkspace;
dvander@2762	6375	cd->start_pattern = (const uschar *)pattern;
dvander@2762	6376	cd->end_pattern = (const uschar *)(pattern + strlen(pattern));
dvander@2762	6377	cd->req_varyopt = 0;
dvander@2762	6378	cd->external_options = options;
dvander@2762	6379	cd->external_flags = 0;
dvander@2762	6380
dvander@2762	6381	/* Now do the pre-compile. On error, errorcode will be set non-zero, so we
dvander@2762	6382	don't need to look at the result of the function here. The initial options have
dvander@2762	6383	been put into the cd block so that they can be changed if an option setting is
dvander@2762	6384	found within the regex right at the beginning. Bringing initial option settings
dvander@2762	6385	outside can help speed up starting point checks. */
dvander@2762	6386
dvander@2762	6387	ptr += skipatstart;
dvander@2762	6388	code = cworkspace;
dvander@2762	6389	*code = OP_BRA;
dvander@2762	6390	(void)compile_regex(cd->external_options, cd->external_options & PCRE_IMS,
dvander@2762	6391	&code, &ptr, &errorcode, FALSE, FALSE, 0, &firstbyte, &reqbyte, NULL, cd,
dvander@2762	6392	&length);
dvander@2762	6393	if (errorcode != 0) goto PCRE_EARLY_ERROR_RETURN;
dvander@2762	6394
dvander@2762	6395	DPRINTF(("end pre-compile: length=%d workspace=%d\n", length,
dvander@2762	6396	cd->hwm - cworkspace));
dvander@2762	6397
dvander@2762	6398	if (length > MAX_PATTERN_SIZE)
dvander@2762	6399	{
dvander@2762	6400	errorcode = ERR20;
dvander@2762	6401	goto PCRE_EARLY_ERROR_RETURN;
dvander@2762	6402	}
dvander@2762	6403
dvander@2762	6404	/* Compute the size of data block needed and get it, either from malloc or
dvander@2762	6405	externally provided function. Integer overflow should no longer be possible
dvander@2762	6406	because nowadays we limit the maximum value of cd->names_found and
dvander@2762	6407	cd->name_entry_size. */
dvander@2762	6408
dvander@2762	6409	size = length + sizeof(real_pcre) + cd->names_found * (cd->name_entry_size + 3);
dvander@2762	6410	re = (real_pcre *)(pcre_malloc)(size);
dvander@2762	6411
dvander@2762	6412	if (re == NULL)
dvander@2762	6413	{
dvander@2762	6414	errorcode = ERR21;
dvander@2762	6415	goto PCRE_EARLY_ERROR_RETURN;
dvander@2762	6416	}
dvander@2762	6417
dvander@2762	6418	/* Put in the magic number, and save the sizes, initial options, internal
dvander@2762	6419	flags, and character table pointer. NULL is used for the default character
dvander@2762	6420	tables. The nullpad field is at the end; it's there to help in the case when a
dvander@2762	6421	regex compiled on a system with 4-byte pointers is run on another with 8-byte
dvander@2762	6422	pointers. */
dvander@2762	6423
dvander@2762	6424	re->magic_number = MAGIC_NUMBER;
dvander@2762	6425	re->size = size;
dvander@2762	6426	re->options = cd->external_options;
dvander@2762	6427	re->flags = cd->external_flags;
dvander@2762	6428	re->dummy1 = 0;
dvander@2762	6429	re->first_byte = 0;
dvander@2762	6430	re->req_byte = 0;
dvander@2762	6431	re->name_table_offset = sizeof(real_pcre);
dvander@2762	6432	re->name_entry_size = cd->name_entry_size;
dvander@2762	6433	re->name_count = cd->names_found;
dvander@2762	6434	re->ref_count = 0;
dvander@2762	6435	re->tables = (tables == _pcre_default_tables)? NULL : tables;
dvander@2762	6436	re->nullpad = NULL;
dvander@2762	6437
dvander@2762	6438	/* The starting points of the name/number translation table and of the code are
dvander@2762	6439	passed around in the compile data block. The start/end pattern and initial
dvander@2762	6440	options are already set from the pre-compile phase, as is the name_entry_size
dvander@2762	6441	field. Reset the bracket count and the names_found field. Also reset the hwm
dvander@2762	6442	field; this time it's used for remembering forward references to subpatterns.
dvander@2762	6443	*/
dvander@2762	6444
dvander@2762	6445	cd->final_bracount = cd->bracount; /* Save for checking forward references */
dvander@2762	6446	cd->bracount = 0;
dvander@2762	6447	cd->names_found = 0;
dvander@2762	6448	cd->name_table = (uschar *)re + re->name_table_offset;
dvander@2762	6449	codestart = cd->name_table + re->name_entry_size * re->name_count;
dvander@2762	6450	cd->start_code = codestart;
dvander@2762	6451	cd->hwm = cworkspace;
dvander@2762	6452	cd->req_varyopt = 0;
dvander@2762	6453	cd->had_accept = FALSE;
dvander@2762	6454
dvander@2762	6455	/* Set up a starting, non-extracting bracket, then compile the expression. On
dvander@2762	6456	error, errorcode will be set non-zero, so we don't need to look at the result
dvander@2762	6457	of the function here. */
dvander@2762	6458
dvander@2762	6459	ptr = (const uschar *)pattern + skipatstart;
dvander@2762	6460	code = (uschar *)codestart;
dvander@2762	6461	*code = OP_BRA;
dvander@2762	6462	(void)compile_regex(re->options, re->options & PCRE_IMS, &code, &ptr,
dvander@2762	6463	&errorcode, FALSE, FALSE, 0, &firstbyte, &reqbyte, NULL, cd, NULL);
dvander@2762	6464	re->top_bracket = cd->bracount;
dvander@2762	6465	re->top_backref = cd->top_backref;
dvander@2762	6466	re->flags = cd->external_flags;
dvander@2762	6467
dvander@2762	6468	if (cd->had_accept) reqbyte = -1; /* Must disable after (ACCEPT) /
dvander@2762	6469
dvander@2762	6470	/* If not reached end of pattern on success, there's an excess bracket. */
dvander@2762	6471
dvander@2762	6472	if (errorcode == 0 && *ptr != 0) errorcode = ERR22;
dvander@2762	6473
dvander@2762	6474	/* Fill in the terminating state and check for disastrous overflow, but
dvander@2762	6475	if debugging, leave the test till after things are printed out. */
dvander@2762	6476
dvander@2762	6477	*code++ = OP_END;
dvander@2762	6478
dvander@2762	6479	#ifndef DEBUG
dvander@2762	6480	if (code - codestart > length) errorcode = ERR23;
dvander@2762	6481	#endif
dvander@2762	6482
dvander@2762	6483	/* Fill in any forward references that are required. */
dvander@2762	6484
dvander@2762	6485	while (errorcode == 0 && cd->hwm > cworkspace)
dvander@2762	6486	{
dvander@2762	6487	int offset, recno;
dvander@2762	6488	const uschar *groupptr;
dvander@2762	6489	cd->hwm -= LINK_SIZE;
dvander@2762	6490	offset = GET(cd->hwm, 0);
dvander@2762	6491	recno = GET(codestart, offset);
dvander@2762	6492	groupptr = find_bracket(codestart, (re->options & PCRE_UTF8) != 0, recno);
dvander@2762	6493	if (groupptr == NULL) errorcode = ERR53;
dvander@2762	6494	else PUT(((uschar *)codestart), offset, groupptr - codestart);
dvander@2762	6495	}
dvander@2762	6496
dvander@2762	6497	/* Give an error if there's back reference to a non-existent capturing
dvander@2762	6498	subpattern. */
dvander@2762	6499
dvander@2762	6500	if (errorcode == 0 && re->top_backref > re->top_bracket) errorcode = ERR15;
dvander@2762	6501
dvander@2762	6502	/* Failed to compile, or error while post-processing */
dvander@2762	6503
dvander@2762	6504	if (errorcode != 0)
dvander@2762	6505	{
dvander@2762	6506	(pcre_free)(re);
dvander@2762	6507	PCRE_EARLY_ERROR_RETURN:
dvander@2762	6508	erroroffset = ptr - (const uschar )pattern;
dvander@2762	6509	PCRE_EARLY_ERROR_RETURN2:
dvander@2762	6510	*errorptr = find_error_text(errorcode);
dvander@2762	6511	if (errorcodeptr != NULL) *errorcodeptr = errorcode;
dvander@2762	6512	return NULL;
dvander@2762	6513	}
dvander@2762	6514
dvander@2762	6515	/* If the anchored option was not passed, set the flag if we can determine that
dvander@2762	6516	the pattern is anchored by virtue of ^ characters or \A or anything else (such
dvander@2762	6517	as starting with .* when DOTALL is set).
dvander@2762	6518
dvander@2762	6519	Otherwise, if we know what the first byte has to be, save it, because that
dvander@2762	6520	speeds up unanchored matches no end. If not, see if we can set the
dvander@2762	6521	PCRE_STARTLINE flag. This is helpful for multiline matches when all branches
dvander@2762	6522	start with ^. and also when all branches start with .* for non-DOTALL matches.
dvander@2762	6523	*/
dvander@2762	6524
dvander@2762	6525	if ((re->options & PCRE_ANCHORED) == 0)
dvander@2762	6526	{
dvander@2762	6527	int temp_options = re->options; /* May get changed during these scans */
dvander@2762	6528	if (is_anchored(codestart, &temp_options, 0, cd->backref_map))
dvander@2762	6529	re->options \|= PCRE_ANCHORED;
dvander@2762	6530	else
dvander@2762	6531	{
dvander@2762	6532	if (firstbyte < 0)
dvander@2762	6533	firstbyte = find_firstassertedchar(codestart, &temp_options, FALSE);
dvander@2762	6534	if (firstbyte >= 0) /* Remove caseless flag for non-caseable chars */
dvander@2762	6535	{
dvander@2762	6536	int ch = firstbyte & 255;
dvander@2762	6537	re->first_byte = ((firstbyte & REQ_CASELESS) != 0 &&
dvander@2762	6538	cd->fcc[ch] == ch)? ch : firstbyte;
dvander@2762	6539	re->flags \|= PCRE_FIRSTSET;
dvander@2762	6540	}
dvander@2762	6541	else if (is_startline(codestart, 0, cd->backref_map))
dvander@2762	6542	re->flags \|= PCRE_STARTLINE;
dvander@2762	6543	}
dvander@2762	6544	}
dvander@2762	6545
dvander@2762	6546	/* For an anchored pattern, we use the "required byte" only if it follows a
dvander@2762	6547	variable length item in the regex. Remove the caseless flag for non-caseable
dvander@2762	6548	bytes. */
dvander@2762	6549
dvander@2762	6550	if (reqbyte >= 0 &&
dvander@2762	6551	((re->options & PCRE_ANCHORED) == 0 \|\| (reqbyte & REQ_VARY) != 0))
dvander@2762	6552	{
dvander@2762	6553	int ch = reqbyte & 255;
dvander@2762	6554	re->req_byte = ((reqbyte & REQ_CASELESS) != 0 &&
dvander@2762	6555	cd->fcc[ch] == ch)? (reqbyte & ~REQ_CASELESS) : reqbyte;
dvander@2762	6556	re->flags \|= PCRE_REQCHSET;
dvander@2762	6557	}
dvander@2762	6558
dvander@2762	6559	/* Print out the compiled data if debugging is enabled. This is never the
dvander@2762	6560	case when building a production library. */
dvander@2762	6561
dvander@2762	6562	#ifdef DEBUG
dvander@2762	6563
dvander@2762	6564	printf("Length = %d top_bracket = %d top_backref = %d\n",
dvander@2762	6565	length, re->top_bracket, re->top_backref);
dvander@2762	6566
dvander@2762	6567	printf("Options=%08x\n", re->options);
dvander@2762	6568
dvander@2762	6569	if ((re->flags & PCRE_FIRSTSET) != 0)
dvander@2762	6570	{
dvander@2762	6571	int ch = re->first_byte & 255;
dvander@2762	6572	const char *caseless = ((re->first_byte & REQ_CASELESS) == 0)?
dvander@2762	6573	"" : " (caseless)";
dvander@2762	6574	if (isprint(ch)) printf("First char = %c%s\n", ch, caseless);
dvander@2762	6575	else printf("First char = \\x%02x%s\n", ch, caseless);
dvander@2762	6576	}
dvander@2762	6577
dvander@2762	6578	if ((re->flags & PCRE_REQCHSET) != 0)
dvander@2762	6579	{
dvander@2762	6580	int ch = re->req_byte & 255;
dvander@2762	6581	const char *caseless = ((re->req_byte & REQ_CASELESS) == 0)?
dvander@2762	6582	"" : " (caseless)";
dvander@2762	6583	if (isprint(ch)) printf("Req char = %c%s\n", ch, caseless);
dvander@2762	6584	else printf("Req char = \\x%02x%s\n", ch, caseless);
dvander@2762	6585	}
dvander@2762	6586
dvander@2762	6587	pcre_printint(re, stdout, TRUE);
dvander@2762	6588
dvander@2762	6589	/* This check is done here in the debugging case so that the code that
dvander@2762	6590	was compiled can be seen. */
dvander@2762	6591
dvander@2762	6592	if (code - codestart > length)
dvander@2762	6593	{
dvander@2762	6594	(pcre_free)(re);
dvander@2762	6595	*errorptr = find_error_text(ERR23);
dvander@2762	6596	erroroffset = ptr - (uschar )pattern;
dvander@2762	6597	if (errorcodeptr != NULL) *errorcodeptr = ERR23;
dvander@2762	6598	return NULL;
dvander@2762	6599	}
dvander@2762	6600	#endif /* DEBUG */
dvander@2762	6601
dvander@2762	6602	return (pcre *)re;
dvander@2762	6603	}
dvander@2762	6604
dvander@2762	6605	/* End of pcre_compile.c */

author	David Anderson <dvander@alliedmods.net>
	Tue Jul 28 17:51:34 2009 -0400 (2009-07-28)
changeset 2762	d2d467bf1b5a
child 3831	babd0eee3c5e
permissions	-rw-r--r--