Loading...
regex/FreeBSD/regcomp.c.patch Libc-763.12 Libc-498
--- Libc/Libc-763.12/regex/FreeBSD/regcomp.c.patch
+++ Libc/Libc-498/regex/FreeBSD/regcomp.c.patch
@@ -1,15 +1,15 @@
---- regcomp.c.orig	2010-06-21 14:05:04.000000000 -0700
-+++ regcomp.c	2010-06-21 14:23:51.000000000 -0700
-@@ -39,6 +39,8 @@ static char sccsid[] = "@(#)regcomp.c	8.
+--- regcomp.c.orig	2004-11-25 11:38:32.000000000 -0800
++++ regcomp.c	2005-04-05 14:46:18.000000000 -0700
+@@ -43,6 +43,8 @@
  #include <sys/cdefs.h>
- __FBSDID("$FreeBSD: src/lib/libc/regex/regcomp.c,v 1.36 2007/06/11 03:05:54 delphij Exp $");
+ __FBSDID("$FreeBSD: src/lib/libc/regex/regcomp.c,v 1.34 2004/10/03 15:42:59 stefanf Exp $");
  
 +#include "xlocale_private.h"
 +
  #include <sys/types.h>
  #include <stdio.h>
  #include <string.h>
-@@ -69,6 +71,9 @@ struct parse {
+@@ -73,6 +75,9 @@
  	sopno ssize;		/* malloced strip size (allocated) */
  	sopno slen;		/* malloced strip length (used) */
  	int ncsalloc;		/* number of csets allocated */
@@ -19,7 +19,7 @@
  	struct re_guts *g;
  #	define	NPAREN	10	/* we need to remember () 1-9 for back refs */
  	sopno pbegin[NPAREN];	/* -> ( ([0] unused) */
-@@ -93,7 +98,7 @@ static void p_b_cclass(struct parse *p, 
+@@ -97,7 +102,7 @@
  static void p_b_eclass(struct parse *p, cset *cs);
  static wint_t p_b_symbol(struct parse *p);
  static wint_t p_b_coll_elem(struct parse *p, wint_t endc);
@@ -28,7 +28,7 @@
  static void bothcases(struct parse *p, wint_t ch);
  static void ordinary(struct parse *p, wint_t ch);
  static void nonnewline(struct parse *p);
-@@ -104,7 +109,7 @@ static void freeset(struct parse *p, cse
+@@ -108,7 +113,7 @@
  static void CHadd(struct parse *p, cset *cs, wint_t ch);
  static void CHaddrange(struct parse *p, cset *cs, wint_t min, wint_t max);
  static void CHaddtype(struct parse *p, cset *cs, wctype_t wct);
@@ -37,7 +37,7 @@
  static sopno dupl(struct parse *p, sopno start, sopno finish);
  static void doemit(struct parse *p, sop op, size_t opnd);
  static void doinsert(struct parse *p, sop op, size_t opnd, sopno pos);
-@@ -222,10 +227,14 @@ regcomp(regex_t * __restrict preg,
+@@ -227,10 +232,14 @@
  	p->end = p->next + len;
  	p->error = 0;
  	p->ncsalloc = 0;
@@ -52,7 +52,7 @@
  	g->sets = NULL;
  	g->ncsets = 0;
  	g->cflags = cflags;
-@@ -302,8 +311,12 @@ p_ere(struct parse *p,
+@@ -308,8 +317,12 @@
  		conc = HERE();
  		while (MORE() && (c = PEEK()) != '|' && c != stop)
  			p_ere_exp(p);
@@ -66,7 +66,7 @@
  		if (!EAT('|'))
  			break;		/* NOTE BREAK OUT */
  
-@@ -410,7 +423,7 @@ p_ere_exp(struct parse *p)
+@@ -417,7 +430,7 @@
  		ordinary(p, wc);
  		break;
  	case '{':		/* okay as ordinary except if digit follows */
@@ -75,7 +75,7 @@
  		/* FALLTHROUGH */
  	default:
  		p->next--;
-@@ -424,7 +437,7 @@ p_ere_exp(struct parse *p)
+@@ -431,7 +444,7 @@
  	c = PEEK();
  	/* we call { a repetition if followed by a digit */
  	if (!( c == '*' || c == '+' || c == '?' ||
@@ -84,7 +84,7 @@
  		return;		/* no repetition, we're done */
  	NEXT();
  
-@@ -453,7 +466,7 @@ p_ere_exp(struct parse *p)
+@@ -460,7 +473,7 @@
  	case '{':
  		count = p_count(p);
  		if (EAT(',')) {
@@ -93,7 +93,7 @@
  				count2 = p_count(p);
  				(void)REQUIRE(count <= count2, REG_BADBR);
  			} else		/* single number with comma */
-@@ -474,7 +487,7 @@ p_ere_exp(struct parse *p)
+@@ -481,7 +494,7 @@
  		return;
  	c = PEEK();
  	if (!( c == '*' || c == '+' || c == '?' ||
@@ -102,9 +102,9 @@
  		return;
  	SETERROR(REG_BADRPT);
  }
-@@ -486,7 +499,12 @@ p_ere_exp(struct parse *p)
- static void
- p_str(struct parse *p)
+@@ -494,7 +507,12 @@
+ p_str(p)
+ struct parse *p;
  {
 +#if __DARWIN_UNIX03
 + 	if (!p->zerorepeats) REQUIRE(MORE(), REG_EMPTY);
@@ -115,7 +115,7 @@
  	while (MORE())
  		ordinary(p, WGETNEXT());
  }
-@@ -525,8 +543,12 @@ p_bre(struct parse *p,
+@@ -534,8 +552,12 @@
  		p->g->iflags |= USEEOL;
  		p->g->neol++;
  	}
@@ -129,7 +129,7 @@
  }
  
  /*
-@@ -599,12 +621,22 @@ p_simp_re(struct parse *p,
+@@ -609,12 +631,22 @@
  		i = (c&~BACKSL) - '0';
  		assert(i < NPAREN);
  		if (p->pend[i] != 0) {
@@ -152,7 +152,7 @@
  			EMIT(O_BACK, i);
  		} else
  			SETERROR(REG_ESUBREG);
-@@ -627,9 +659,10 @@ p_simp_re(struct parse *p,
+@@ -637,9 +669,10 @@
  		INSERT(OQUEST_, pos);
  		ASTERN(O_QUEST, pos);
  	} else if (EATTWO('\\', '{')) {
@@ -164,7 +164,7 @@
  				count2 = p_count(p);
  				(void)REQUIRE(count <= count2, REG_BADBR);
  			} else		/* single number with comma */
-@@ -659,7 +692,7 @@ p_count(struct parse *p)
+@@ -670,7 +703,7 @@
  	int count = 0;
  	int ndigits = 0;
  
@@ -173,7 +173,7 @@
  		count = count*10 + (GETNEXT() - '0');
  		ndigits++;
  	}
-@@ -697,10 +730,22 @@ p_bracket(struct parse *p)
+@@ -709,10 +742,22 @@
  		cs->icase = 1;
  	if (EAT('^'))
  		cs->invert = 1;
@@ -196,7 +196,7 @@
  	while (MORE() && PEEK() != ']' && !SEETWO('-', ']'))
  		p_b_term(p, cs);
  	if (EAT('-'))
-@@ -713,7 +758,7 @@ p_bracket(struct parse *p)
+@@ -725,7 +770,7 @@
  	if (cs->invert && p->g->cflags&REG_NEWLINE)
  		cs->bmp['\n' >> 3] |= 1 << ('\n' & 7);
  
@@ -205,7 +205,7 @@
  		ordinary(p, ch);
  		freeset(p, cs);
  	} else
-@@ -737,8 +782,16 @@ p_b_term(struct parse *p, cset *cs)
+@@ -751,8 +796,16 @@
  		c = (MORE2()) ? PEEK2() : '\0';
  		break;
  	case '-':
@@ -222,7 +222,7 @@
  		break;
  	default:
  		c = '\0';
-@@ -759,7 +812,11 @@ p_b_term(struct parse *p, cset *cs)
+@@ -773,7 +826,11 @@
  		NEXT2();
  		(void)REQUIRE(MORE(), REG_EBRACK);
  		c = PEEK();
@@ -234,7 +234,7 @@
  		p_b_eclass(p, cs);
  		(void)REQUIRE(MORE(), REG_EBRACK);
  		(void)REQUIRE(EATTWO('=', ']'), REG_ECOLLATE);
-@@ -778,14 +835,14 @@ p_b_term(struct parse *p, cset *cs)
+@@ -792,14 +849,14 @@
  		if (start == finish)
  			CHadd(p, cs, start);
  		else {
@@ -253,7 +253,7 @@
  					   )
  						CHadd(p, cs, i);
  				}
-@@ -807,7 +864,7 @@ p_b_cclass(struct parse *p, cset *cs)
+@@ -823,7 +880,7 @@
  	wctype_t wct;
  	char clname[16];
  
@@ -262,7 +262,7 @@
  		NEXT();
  	len = p->next - sp;
  	if (len >= sizeof(clname) - 1) {
-@@ -816,7 +873,7 @@ p_b_cclass(struct parse *p, cset *cs)
+@@ -832,7 +889,7 @@
  	}
  	memcpy(clname, sp, len);
  	clname[len] = '\0';
@@ -271,7 +271,7 @@
  		SETERROR(REG_ECTYPE);
  		return;
  	}
-@@ -826,14 +883,38 @@ p_b_cclass(struct parse *p, cset *cs)
+@@ -842,16 +899,40 @@
  /*
   - p_b_eclass - parse an equivalence-class name and deal with it
   == static void p_b_eclass(struct parse *p, cset *cs);
@@ -279,7 +279,9 @@
 - * This implementation is incomplete. xxx
   */
  static void
- p_b_eclass(struct parse *p, cset *cs)
+ p_b_eclass(p, cs)
+ struct parse *p;
+ cset *cs;
  {
 -	wint_t c;
 -
@@ -314,12 +316,8 @@
  	c = p_b_coll_elem(p, '=');
  	CHadd(p, cs, c);
  }
-@@ -866,10 +947,10 @@ p_b_coll_elem(struct parse *p,
- 	wint_t endc)		/* name ended by endc,']' */
- {
- 	char *sp = p->next;
--	struct cname *cp;
-+	const struct cname *cp;
+@@ -889,7 +970,7 @@
+ 	struct cname *cp;
  	int len;
  	mbstate_t mbs;
 -	wchar_t wc;
@@ -327,7 +325,7 @@
  	size_t clen;
  
  	while (MORE() && !SEETWO(endc, ']'))
-@@ -883,9 +964,10 @@ p_b_coll_elem(struct parse *p,
+@@ -903,9 +984,10 @@
  		if (strncmp(cp->name, sp, len) == 0 && cp->name[len] == '\0')
  			return(cp->code);	/* known name */
  	memset(&mbs, 0, sizeof(mbs));
@@ -341,16 +339,18 @@
  		SETERROR(REG_ILLSEQ);
  	else
  		SETERROR(REG_ECOLLATE);		/* neither */
-@@ -894,16 +976,16 @@ p_b_coll_elem(struct parse *p,
+@@ -914,17 +996,18 @@
  
  /*
   - othercase - return the case counterpart of an alphabetic
 - == static char othercase(int ch);
-+ == static char othercase(wint_t ch, locale_t loc);
++ == static char othercase(int ch, locale_t loc);
   */
  static wint_t			/* if no counterpart, return ch */
--othercase(wint_t ch)
-+othercase(wint_t ch, locale_t loc)
+-othercase(ch)
++othercase(ch, loc)
+ wint_t ch;
++locale_t loc;
  {
 -	assert(iswalpha(ch));
 -	if (iswupper(ch))
@@ -365,7 +365,7 @@
  	else			/* peculiar, but could happen */
  		return(ch);
  }
-@@ -923,10 +1005,10 @@ bothcases(struct parse *p, wint_t ch)
+@@ -946,10 +1029,10 @@
  	size_t n;
  	mbstate_t mbs;
  
@@ -378,7 +378,7 @@
  	assert(n != (size_t)-1);
  	bracket[n] = ']';
  	bracket[n + 1] = '\0';
-@@ -946,7 +1028,7 @@ ordinary(struct parse *p, wint_t ch)
+@@ -971,7 +1054,7 @@
  {
  	cset *cs;
  
@@ -387,7 +387,7 @@
  		bothcases(p, ch);
  	else if ((ch & OPDMASK) == ch)
  		EMIT(OCHAR, ch);
-@@ -1012,10 +1094,22 @@ repeat(struct parse *p,
+@@ -1039,10 +1122,22 @@
  	switch (REP(MAP(from), MAP(to))) {
  	case REP(0, 0):			/* must be user doing this */
  		DROP(finish-start);	/* drop the operand */
@@ -411,7 +411,7 @@
  		/* KLUDGE: emit y? as (y|) until subtle bug gets fixed */
  		INSERT(OCH_, start);		/* offset is wrong... */
  		repeat(p, start+1, 1, to);
-@@ -1029,6 +1123,10 @@ repeat(struct parse *p,
+@@ -1056,6 +1151,10 @@
  		/* done */
  		break;
  	case REP(1, N):			/* as x?x{1,n-1} */
@@ -422,7 +422,7 @@
  		/* KLUDGE: emit y? as (y|) until subtle bug gets fixed */
  		INSERT(OCH_, start);
  		ASTERN(OOR1, start);
-@@ -1036,6 +1134,7 @@ repeat(struct parse *p,
+@@ -1063,6 +1162,7 @@
  		EMIT(OOR2, 0);			/* offset very wrong... */
  		AHEAD(THERE());			/* ...so fix it */
  		ASTERN(O_CH, THERETHERE());
@@ -430,7 +430,7 @@
  		copy = dupl(p, start+1, finish+1);
  		assert(copy == finish+4);
  		repeat(p, copy, 1, to-1);
-@@ -1071,7 +1170,7 @@ wgetnext(struct parse *p)
+@@ -1099,7 +1199,7 @@
  	size_t n;
  
  	memset(&mbs, 0, sizeof(mbs));
@@ -439,12 +439,14 @@
  	if (n == (size_t)-1 || n == (size_t)-2) {
  		SETERROR(REG_ILLSEQ);
  		return (0);
-@@ -1139,12 +1238,12 @@ freeset(struct parse *p, cset *cs)
+@@ -1172,13 +1272,14 @@
   - returning it if so, otherwise returning OUT.
   */
  static wint_t
--singleton(cset *cs)
-+singleton(cset *cs, locale_t loc)
+-singleton(cs)
++singleton(cs, loc)
+ cset *cs;
++locale_t loc;
  {
  	wint_t i, s, n;
  
@@ -454,7 +456,7 @@
  			n++;
  			s = i;
  		}
-@@ -1178,9 +1277,9 @@ CHadd(struct parse *p, cset *cs, wint_t 
+@@ -1215,9 +1316,9 @@
  		cs->wides[cs->nwides++] = ch;
  	}
  	if (cs->icase) {
@@ -466,7 +468,7 @@
  			cs->bmp[nch >> 3] |= 1 << (nch & 7);
  	}
  }
-@@ -1219,7 +1318,7 @@ CHaddtype(struct parse *p, cset *cs, wct
+@@ -1262,7 +1363,7 @@
  	wctype_t *newtypes;
  
  	for (i = 0; i < NC; i++)
@@ -475,7 +477,7 @@
  			CHadd(p, cs, i);
  	newtypes = realloc(cs->types, (cs->ntypes + 1) *
  	    sizeof(*cs->types));
-@@ -1391,6 +1490,7 @@ findmust(struct parse *p, struct re_guts
+@@ -1451,6 +1552,7 @@
  	char buf[MB_LEN_MAX];
  	size_t clen;
  	mbstate_t mbs;
@@ -483,7 +485,7 @@
  
  	/* avoid making error situations worse */
  	if (p->error != 0)
-@@ -1401,8 +1501,8 @@ findmust(struct parse *p, struct re_guts
+@@ -1461,8 +1563,8 @@
  	 * multibyte character strings, but it's safe for at least
  	 * UTF-8 (see RFC 3629).
  	 */
@@ -494,7 +496,7 @@
  		return;
  
  	/* find the longest OCHAR sequence in strip */
-@@ -1418,7 +1518,7 @@ findmust(struct parse *p, struct re_guts
+@@ -1478,7 +1580,7 @@
  				memset(&mbs, 0, sizeof(mbs));
  				newstart = scan - 1;
  			}
@@ -503,7 +505,7 @@
  			if (clen == (size_t)-1)
  				goto toohard;
  			newlen += clen;
-@@ -1537,7 +1637,7 @@ findmust(struct parse *p, struct re_guts
+@@ -1597,7 +1699,7 @@
  	while (cp < g->must + g->mlen) {
  		while (OP(s = *scan++) != OCHAR)
  			continue;