Daniel C. Sobral 8e2f75b833 The algorithm that computes the tables used in the BM search algorithm sometimes ... access an array beyond it's length. This only happens in the last iteration of a loop, and the value fetched is not used then, so the bug is a relatively innocent one. Fix this by not fetching any value on the last iteration of said loop. Submitted by: MKI <mki@mozone.net> MFC after: 1 week		2001-11-09 10:17:44 +00:00
..
grot	Actually make it so this Makefile can build grot.	2000-07-10 06:10:47 +00:00
cclass.h
cname.h
COPYRIGHT
engine.c	Since g->moffset points to the _maximum_ offset at which the must	2000-07-09 17:36:53 +00:00
Makefile.inc	MAN[1-9] -> MAN.	2001-03-27 17:27:19 +00:00
re_format.7	Remove whitespace at EOL.	2001-07-15 07:53:42 +00:00
regcomp.c	The algorithm that computes the tables used in the BM search algorithm sometimes	2001-11-09 10:17:44 +00:00
regerror.c	remove <ctype.h> - not needed	1999-07-26 05:50:43 +00:00
regex2.h	Enhance the optimization provided by pre-matching. Fix style bugs with	2000-07-02 10:58:07 +00:00
regex.3	mdoc(7) police: Use the new .In macro for #include statements.	2001-10-01 16:09:29 +00:00
regexec.c	int -> long changes that reduce the diffs with the NetBSD version to	1998-05-14 21:45:18 +00:00
regfree.c	Since we have modified charjump to be CHAR_MIN-based, we have to	2000-07-08 09:45:17 +00:00
utils.h
WHATSNEW