src/lib/libc/regex/engine.c, branch release/7.0.0_cvs FreeBSD source tree This commit was manufactured by cvs2svn to create tag 2008-02-24T05:45:17+00:00 cvs2svn cvs2svn@FreeBSD.org 2008-02-24T05:45:17+00:00 a9c219fa3cec18ef9f30edec6fa106bf0e2d423d 'RELENG_7_0_0_RELEASE'. This commit was manufactured to restore the state of the 7.0-RELEASE image. 
'RELENG_7_0_0_RELEASE'.

This commit was manufactured to restore the state of the 7.0-RELEASE image.
Const'ify and ANSIfy the internal interfaces of regex(3). 2007-05-25T12:44:58+00:00 Xin LI delphij@FreeBSD.org 2007-05-25T12:44:58+00:00 eb2b3d109a5ea801c0c74ca92bdcfd6ec48a4d8d This is the final change that makes libc to compile with WERROR on my amd64 crashbox. 
This is the final change that makes libc to compile with
WERROR on my amd64 crashbox.
Only stop evaluation of a back reference if the match length is 2007-03-05T09:43:55+00:00 Xin LI delphij@FreeBSD.org 2007-03-05T09:43:55+00:00 082063a051b8b7914042824732665d83ccee20b8 zero and the recursion level is too deep. Obtained from: OpenBSD 
zero and the recursion level is too deep.

Obtained from:	OpenBSD
Avoid infinite recursion on: 2007-03-05T03:07:36+00:00 Xin LI delphij@FreeBSD.org 2007-03-05T03:07:36+00:00 0f4481c5e4fbc94727ae9ab2cde6a325aaf52d3d echo "foo foo bar bar bar baz" | sed 's/\([^ ]*\)\( *\1\)*/\1/g' Obtained from: OpenBSD via NetBSD (rev. 1.18) 
  echo "foo foo bar bar bar baz" | sed 's/\([^ ]*\)\( *\1\)*/\1/g'

Obtained from:	OpenBSD via NetBSD (rev. 1.18)
Per Regents of the University of Calfornia letter, remove advertising 2007-01-09T00:28:16+00:00 Warner Losh imp@FreeBSD.org 2007-01-09T00:28:16+00:00 c879ae3536e6d92b8d96c8965c5b05fcb9541520 clause. # If I've done so improperly on a file, please let me know. 
clause.

# If I've done so improperly on a file, please let me know.
Fix a boundary condition error in slow() and fast() in multibyte locales: 2005-08-17T11:37:38+00:00 Tim J. Robbins tjr@FreeBSD.org 2005-08-17T11:37:38+00:00 1ee0dbee5743a327993fce2896aed0f8d1b31518 we must allow the character beginning at "p" to be converted to a wide character for the purposes of EOL processing and word-boundary matching. 
we must allow the character beginning at "p" to be converted to a wide
character for the purposes of EOL processing and word-boundary matching.
Plug memory leak. 2004-12-30T14:27:57+00:00 Diomidis Spinellis dds@FreeBSD.org 2004-12-30T14:27:57+00:00 c7ce9e21f852b8eec580b7583c65dfcfc31de1f6 PR: bin/75656 MFC after: 2 weeks 
PR:		bin/75656
MFC after:	2 weeks
Fix computation of the 'n' argument to mbrtowc (through XMBRTOWC) to avoid 2004-11-21T03:14:32+00:00 Tim J. Robbins tjr@FreeBSD.org 2004-11-21T03:14:32+00:00 bd9643b1353ec4751c6fe182b899bf9f171f6ee0 reading past 'stop' in various places when converting multibyte characters. Reading too far caused truncation to not be detected when it should have been, eventually causing regexec() to loop infinitely in with certain combinations of patterns and strings in multibyte locales. PR: 74020 MFC after: 4 weeks 
reading past 'stop' in various places when converting multibyte characters.
Reading too far caused truncation to not be detected when it should have
been, eventually causing regexec() to loop infinitely in with certain
combinations of patterns and strings in multibyte locales.

PR:		74020
MFC after:	4 weeks
Make regular expression matching aware of multibyte characters. The general 2004-07-12T07:35:59+00:00 Tim J. Robbins tjr@FreeBSD.org 2004-07-12T07:35:59+00:00 e5996857ad1f30f74f848a2c464c75a7ae28e59a idea is that we perform multibyte->wide character conversion while parsing and compiling, then convert byte sequences to wide characters when they're needed for comparison and stepping through the string during execution. As with tr(1), the main complication is to efficiently represent sets of characters in bracket expressions. The old bitmap representation is replaced by a bitmap for the first 256 characters combined with a vector of individual wide characters, a vector of character ranges (for [A-Z] etc.), and a vector of character classes (for [[:alpha:]] etc.). One other point of interest is that although the Boyer-Moore algorithm had to be disabled in the general multibyte case, it is still enabled for UTF-8 because of its self-synchronizing nature. This greatly speeds up matching by reducing the number of multibyte conversions that need to be done. 
idea is that we perform multibyte->wide character conversion while parsing
and compiling, then convert byte sequences to wide characters when they're
needed for comparison and stepping through the string during execution.

As with tr(1), the main complication is to efficiently represent sets of
characters in bracket expressions. The old bitmap representation is replaced
by a bitmap for the first 256 characters combined with a vector of individual
wide characters, a vector of character ranges (for [A-Z] etc.), and a vector
of character classes (for [[:alpha:]] etc.).

One other point of interest is that although the Boyer-Moore algorithm had
to be disabled in the general multibyte case, it is still enabled for UTF-8
because of its self-synchronizing nature. This greatly speeds up matching
by reducing the number of multibyte conversions that need to be done.
Eliminate 61 warnings emitted at WARNS=2 (leaving 53 to go). 2003-02-16T17:29:11+00:00 Jacques Vidrine nectar@FreeBSD.org 2003-02-16T17:29:11+00:00 e0554a531f17f56167f978eddf29a09cc6ae9f32 Only warnings that could be fixed without changing the generated object code and without restructuring the source code have been handled. Reviewed by: /sbin/md5 
Only warnings that could be fixed without changing the generated object
code and without restructuring the source code have been handled.

Reviewed by:	/sbin/md5