vixie@wrl.dec.com (Paul Vixie) (05/07/90)
Submitted-by: vixie@wrl.dec.com (Paul Vixie)
Posting-number: Volume 7, Issue 32
Archive-name: awl/part17
#! /bin/sh
# This is a shell archive. Remove anything before this line, then unpack
# it by saving it into a file and typing "sh file". To overwrite existing
# files, type "sh file -c". You can also feed this as standard input via
# unshar, or by typing "sh <file", e.g.. If this archive is complete, you
# will see the following message at the end:
# "End of archive 17 (of 17)."
# Contents: regex.c
# Wrapped by vixie@jove.pa.dec.com on Mon Apr 30 01:25:28 1990
PATH=/bin:/usr/bin:/usr/ucb ; export PATH
if test -f 'regex.c' -a "${1}" != "-c" ; then
echo shar: Will not clobber existing file \"'regex.c'\"
else
echo shar: Extracting \"'regex.c'\" \(47364 characters\)
sed "s/^X//" >'regex.c' <<'END_OF_FILE'
X#ifndef lint
static char *rcsid = "$Header: /usr/src/local/awl/RCS/regex.c,v 2.1 90/04/19 20:05:26 jkh Exp $";
X#endif
X
X/* Extended regular expression matching and search.
X Copyright (C) 1985 Free Software Foundation, Inc.
X
X NO WARRANTY
X
X BECAUSE THIS PROGRAM IS LICENSED FREE OF CHARGE, WE PROVIDE ABSOLUTELY
NO WARRANTY, TO THE EXTENT PERMITTED BY APPLICABLE STATE LAW. EXCEPT
WHEN OTHERWISE STATED IN WRITING, FREE SOFTWARE FOUNDATION, INC,
RICHARD M. STALLMAN AND/OR OTHER PARTIES PROVIDE THIS PROGRAM "AS IS"
WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
XFITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY
AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE
DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
CORRECTION.
X
X IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW WILL RICHARD M.
STALLMAN, THE FREE SOFTWARE FOUNDATION, INC., AND/OR ANY OTHER PARTY
WHO MAY MODIFY AND REDISTRIBUTE THIS PROGRAM AS PERMITTED BELOW, BE
LIABLE TO YOU FOR DAMAGES, INCLUDING ANY LOST PROFITS, LOST MONIES, OR
OTHER SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR
DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY THIRD PARTIES OR
A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS) THIS
PROGRAM, EVEN IF YOU HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY.
X
X GENERAL PUBLIC LICENSE TO COPY
X
X 1. You may copy and distribute verbatim copies of this source file
as you receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy a valid copyright notice "Copyright
X(C) 1985 Free Software Foundation, Inc."; and include following the
copyright notice a verbatim copy of the above disclaimer of warranty
and of this License. You may charge a distribution fee for the
physical act of transferring a copy.
X
X 2. You may modify your copy or copies of this source file or
any portion of it, and copy and distribute such modifications under
the terms of Paragraph 1 above, provided that you also do the following:
X
X a) cause the modified files to carry prominent notices stating
X that you changed the files and the date of any change; and
X
X b) cause the whole of any work that you distribute or publish,
X that in whole or in part contains or is a derivative of this
X program or any part thereof, to be licensed at no charge to all
X third parties on terms identical to those contained in this
X License Agreement (except that you may choose to grant more extensive
X warranty protection to some or all third parties, at your option).
X
X c) You may charge a distribution fee for the physical act of
X transferring a copy, and you may at your option offer warranty
X protection in exchange for a fee.
X
Mere aggregation of another unrelated program with this program (or its
derivative) on a volume of a storage or distribution medium does not bring
the other program under the scope of these terms.
X
X 3. You may copy and distribute this program (or a portion or derivative
of it, under Paragraph 2) in object code or executable form under the terms
of Paragraphs 1 and 2 above provided that you also do one of the following:
X
X a) accompany it with the complete corresponding machine-readable
X source code, which must be distributed under the terms of
X Paragraphs 1 and 2 above; or,
X
X b) accompany it with a written offer, valid for at least three
X years, to give any third party free (except for a nominal
X shipping charge) a complete machine-readable copy of the
X corresponding source code, to be distributed under the terms of
X Paragraphs 1 and 2 above; or,
X
X c) accompany it with the information you received as to where the
X corresponding source code may be obtained. (This alternative is
X allowed only for noncommercial distribution and only if you
X received the program in object code or executable form alone.)
X
XFor an executable file, complete source code means all the source code for
all modules it contains; but, as a special exception, it need not include
source code for modules which are standard libraries that accompany the
operating system on which the executable file runs.
X
X 4. You may not copy, sublicense, distribute or transfer this program
except as expressly provided under this License Agreement. Any attempt
otherwise to copy, sublicense, distribute or transfer this program is void and
your rights to use the program under this License agreement shall be
automatically terminated. However, parties who have received computer
software programs from you with this License Agreement will not have
their licenses terminated so long as such parties remain in full compliance.
X
X 5. If you wish to incorporate parts of this program into other free
programs whose distribution conditions are different, write to the Free
Software Foundation at 675 Mass Ave, Cambridge, MA 02139. We have not yet
worked out a simple rule that can be stated here, but we will often permit
this. We will be guided by the two goals of preserving the free status of
all derivatives of our free software and of promoting the sharing and reuse of
software.
X
X
In other words, you are welcome to use, share and improve this program.
You are forbidden to forbid anyone else to use, share and improve
what you give them. Help stamp out software-hoarding! */
X
X
X/*
X * Last change: February 25, 1989.
X * By: Jordan Hubbard
X *
X * Removed all references to emacs to eliminate as much confusion as
X * possible (this code's confusing enough as it is). Removed test code
X * for same reason. Viciously re-indented and reformatted to K&R style.
X * Generally tried to improve readability by messing around with some of
X * the syntax. But hey, who am I trying to fool? This is write-only code
X * and we all know it.
X *
X * These changes will probably piss RMS off but I was tracking a bug
X * through this code (it wasn't in here) and couldn't understand it without
X * indenting it to K&R first. I'm still not sure if I understand it but
X * I decided to leave the indentation the way it was. You can replace this
X * with the "stock" GNU regex.[ch] if you wish.
X *
X * $Log: regex.c,v $
X * Revision 2.1 90/04/19 20:05:26 jkh
X * Alpha checkin.
X *
X * Revision 2.0 90/03/26 01:43:37 jkh
X * pre-beta check-in
X *
X */
X
X#include "AwlP.h"
X
X/* Make alloca work the best possible way. */
X#ifdef __GNUC__
X#define alloca __builtin_alloca
X#else
X#ifdef sparc
X#include <alloca.h>
X#endif
X#endif
X
extern int bcmp();
X
X/*
X * Define the syntax stuff, so we can do the \<...\> things.
X */
X
X#ifndef Sword /* must be non-zero in some of the tests below... */
X#define Sword 1
X#endif
X
X#define SYNTAX(c) re_syntax_table[c]
X
X#ifdef SYNTAX_TABLE
X
char *re_syntax_table;
X
X#else
X
static char re_syntax_table[256];
X
static void init_syntax_once ()
X{
X register int c;
X static int done = 0;
X
X if (done)
X return;
X
X bzero (re_syntax_table, sizeof re_syntax_table);
X
X for (c = 'a'; c <= 'z'; c++)
X re_syntax_table[c] = Sword;
X
X for (c = 'A'; c <= 'Z'; c++)
X re_syntax_table[c] = Sword;
X
X for (c = '0'; c <= '9'; c++)
X re_syntax_table[c] = Sword;
X
X done = 1;
X}
X
X#endif /* SYNTAX_TABLE */
X
X/*
X * Number of failure points to allocate space for initially,
X * when matching. If this number is exceeded, more space is allocated,
X * so it is not a hard limit.
X */
X
X#ifndef NFAILURES
X#define NFAILURES 100
X#endif /* NFAILURES */
X
X#ifndef SIGN_EXTEND_CHAR
X#define SIGN_EXTEND_CHAR(x) (x)
X#endif
X
static int obscure_syntax = 0;
X
X/*
X * Specify the precise syntax of regexp for compilation.
X * This provides for compatibility for various utilities
X * which historically have different, incompatible syntaxes.
X *
X * The argument SYNTAX is a bit-mask containing the two bits
X * RE_NO_BK_PARENS and RE_NO_BK_VBAR.
X */
X
int re_set_syntax (syntax)
int syntax;
X{
X int ret;
X
X ret = obscure_syntax;
X obscure_syntax = syntax;
X return(ret);
X}
X
X/*
X * re_compile_pattern takes a regular-expression string
X * and converts it into a buffer full of byte commands for matching.
X *
X * PATTERN is the address of the pattern string
X * SIZE is the length of it.
X * BUFP is a struct re_pattern_buffer * which points to the info
X * on where to store the byte commands.
X * This structure contains a char * which points to the
X * actual space, which should have been obtained with XtMalloc.
X * re_compile_pattern may use XtRealloc to grow the buffer space.
X *
X * The number of bytes of commands can be found out by looking in
X * the struct re_pattern_buffer that bufp pointed to,
X * after re_compile_pattern returns.
X */
X
X#define PATPUSH(ch) (*b++ = (char) (ch))
X
X/*
X * Yuck. Multi-line macros with gotos imbeded. I guess if you're going
X * to sin, you might as well go all-out. Somewhere in the Alps, Father Ed
X * is getting sick against a rock. -jkh
X */
X#define PATFETCH(c) \
X {if (p == pend) goto end_of_pattern; \
X c = * (unsigned char *) p++; \
X if (translate) c = translate[c]; }
X
X#define PATFETCH_RAW(c) \
X {if (p == pend) goto end_of_pattern; \
X c = * (unsigned char *) p++; }
X
X#define PATUNFETCH p--
X
X#define EXTEND_BUFFER \
X { char *old_buffer = bufp->buffer; \
X if (bufp->allocated == (1<<16)) goto too_big; \
X bufp->allocated *= 2; \
X if (bufp->allocated > (1<<16)) bufp->allocated = (1<<16); \
X if (!(bufp->buffer = (char *) XtRealloc (bufp->buffer, bufp->allocated))) \
X goto memory_exhausted; \
X c = bufp->buffer - old_buffer; \
X b += c; \
X if (fixup_jump) \
X fixup_jump += c; \
X if (laststart) \
X laststart += c; \
X begalt += c; \
X if (pending_exact) \
X pending_exact += c; \
X }
X
static int store_jump (), insert_jump ();
X
char *re_compile_pattern (pattern, size, bufp)
char *pattern;
int size;
struct re_pattern_buffer *bufp;
X{
X register char *b = bufp->buffer;
X register char *p = pattern;
X char *pend = pattern + size;
X register unsigned c, c1;
X char *p1;
X unsigned char *translate = (unsigned char *) bufp->translate;
X
X /*
X * address of the count-byte of the most recently inserted "exactn"
X * command.
X * This makes it possible to tell whether a new exact-match character
X * can be added to that command or requires a new "exactn" command.
X */
X
X char *pending_exact = 0;
X
X /*
X * address of the place where a forward-jump should go
X * to the end of the containing expression.
X * Each alternative of an "or", except the last, ends with a
X * forward-jump of this sort.
X */
X
X char *fixup_jump = 0;
X
X /*
X * address of start of the most recently finished expression.
X * This tells postfix * where to find the start of its operand.
X */
X
X char *laststart = 0;
X
X /* In processing a repeat, 1 means zero matches is allowed */
X
X char zero_times_ok;
X
X /* In processing a repeat, 1 means many matches is allowed */
X
X char many_times_ok;
X
X /* address of beginning of regexp, or inside of last \( */
X
X char *begalt = b;
X
X /*
X * Stack of information saved by \( and restored by \).
X * Four stack elements are pushed by each \(:
X * First, the value of b.
X * Second, the value of fixup_jump.
X * Third, the value of regnum.
X * Fourth, the value of begalt.
X */
X
X int stackb[40];
X int *stackp = stackb;
X int *stacke = stackb + 40;
X int *stackt;
X
X /*
X * Counts \('s as they are encountered. Remembered for the matching \),
X * where it becomes the "register number" to put in the stop_memory
X * command.
X */
X
X int regnum = 1;
X
X bufp->fastmap_accurate = 0;
X
X#ifndef SYNTAX_TABLE
X /*
X * Initialize the syntax table.
X */
X init_syntax_once();
X#endif
X
X if (bufp->allocated == 0) {
X bufp->allocated = 28;
X if (bufp->buffer)
X /* EXTEND_BUFFER loses when bufp->allocated is 0 */
X bufp->buffer = (char *) XtRealloc (bufp->buffer, 28);
X else
X /* Caller did not allocate a buffer. Do it for him */
X bufp->buffer = (char *) XtMalloc (28);
X if (!bufp->buffer)
X goto memory_exhausted;
X begalt = b = bufp->buffer;
X }
X
X while (p != pend) {
X if (b - bufp->buffer > bufp->allocated - 10)
X /* Note that EXTEND_BUFFER clobbers c */
X EXTEND_BUFFER;
X
X PATFETCH (c);
X
X switch (c) {
X case '$':
X if (obscure_syntax & RE_TIGHT_VBAR) {
X if (!(obscure_syntax & RE_CONTEXT_INDEP_OPS) && p != pend)
X goto normal_char;
X /*
X * Make operand of last vbar end before
X * this `$'.
X */
X if (fixup_jump)
X store_jump (fixup_jump, jump, b);
X fixup_jump = 0;
X PATPUSH (endline);
X break;
X }
X
X /*
X * $ means succeed if at end of line, but only in
X * special contexts.
X * If randomly in the middle of a pattern, it is a
X * normal character.
X */
X if (p == pend || *p == '\n'
X || (obscure_syntax & RE_CONTEXT_INDEP_OPS)
X || (obscure_syntax & RE_NO_BK_PARENS
X ? *p == ')'
X : *p == '\\' && p[1] == ')')
X || (obscure_syntax & RE_NO_BK_VBAR
X ? *p == '|'
X : *p == '\\' && p[1] == '|'))
X {
X PATPUSH (endline);
X break;
X }
X goto normal_char;
X
X case '^':
X /*
X * ^ means succeed if at beg of line, but only if
X * no preceding pattern.
X */
X
X if (laststart && p[-2] != '\n' &&
X !(obscure_syntax & RE_CONTEXT_INDEP_OPS))
X goto normal_char;
X if (obscure_syntax & RE_TIGHT_VBAR) {
X if (p != pattern + 1
X && ! (obscure_syntax &
X RE_CONTEXT_INDEP_OPS))
X goto normal_char;
X PATPUSH (begline);
X begalt = b;
X }
X else
X PATPUSH (begline);
X break;
X
X case '+':
X case '?':
X if (obscure_syntax & RE_BK_PLUS_QM)
X goto normal_char;
X handle_plus:
X case '*':
X /* If there is no previous pattern, char not special. */
X if (!laststart && ! (obscure_syntax & RE_CONTEXT_INDEP_OPS))
X goto normal_char;
X /*
X * If there is a sequence of repetition chars,
X * collapse it down to equivalent to just one.
X */
X zero_times_ok = 0;
X many_times_ok = 0;
X while (1) {
X zero_times_ok |= c != '+';
X many_times_ok |= c != '?';
X if (p == pend)
X break;
X PATFETCH (c);
X if (c == '*')
X ;
X else if (!(obscure_syntax & RE_BK_PLUS_QM)
X && (c == '+' || c == '?'))
X ;
X else if ((obscure_syntax & RE_BK_PLUS_QM)
X && c == '\\') {
X int c1;
X PATFETCH (c1);
X if (!(c1 == '+' || c1 == '?')) {
X PATUNFETCH;
X PATUNFETCH;
X break;
X }
X c = c1;
X }
X else {
X PATUNFETCH;
X break;
X }
X }
X
X /*
X * Star, etc. applied to an empty pattern is
X * equivalent to an empty pattern.
X */
X if (!laststart)
X break;
X
X /*
X * Now we know whether 0 matches is allowed,
X * and whether 2 or more matches is allowed.
X */
X if (many_times_ok) {
X /* If more than one repetition is allowed,
X put in a backward jump at the end. */
X store_jump (b, maybe_finalize_jump, laststart - 3);
X b += 3;
X }
X insert_jump (on_failure_jump, laststart, b + 3, b);
X pending_exact = 0;
X b += 3;
X if (!zero_times_ok) {
X /*
X * At least one repetition required: insert
X * before the loop a skip over the initial
X * on-failure-jump instruction
X */
X insert_jump (dummy_failure_jump, laststart,
X laststart + 6, b);
X b += 3;
X }
X break;
X
X case '.':
X laststart = b;
X PATPUSH (anychar);
X break;
X
X case '[':
X while (b - bufp->buffer
X > bufp->allocated - 3 - (1 << BYTEWIDTH) / BYTEWIDTH)
X /* Note that EXTEND_BUFFER clobbers c */
X EXTEND_BUFFER;
X
X laststart = b;
X if (*p == '^')
X PATPUSH (charset_not), p++;
X else
X PATPUSH (charset);
X p1 = p;
X
X PATPUSH ((1 << BYTEWIDTH) / BYTEWIDTH);
X /* Clear the whole map */
X bzero (b, (1 << BYTEWIDTH) / BYTEWIDTH);
X /* Read in characters and ranges, setting map bits */
X while (1) {
X PATFETCH (c);
X if (c == ']' && p != p1 + 1) break;
X if (*p == '-' && p[1] != ']') {
X PATFETCH (c1);
X PATFETCH (c1);
X while (c <= c1)
X b[c / BYTEWIDTH] |= 1 << (c % BYTEWIDTH), c++;
X }
X else {
X b[c / BYTEWIDTH] |= 1 <<
X (c % BYTEWIDTH);
X }
X }
X /*
X * Discard any bitmap bytes that are all 0 at the
X * end of the map.
X * Decrement the map-length byte too.
X */
X while ((int) b[-1] > 0 && b[b[-1] - 1] == 0)
X b[-1]--;
X b += b[-1];
X break;
X
X case '(':
X if (! (obscure_syntax & RE_NO_BK_PARENS))
X goto normal_char;
X else
X goto handle_open;
X
X case ')':
X if (! (obscure_syntax & RE_NO_BK_PARENS))
X goto normal_char;
X else
X goto handle_close;
X
X case '\n':
X if (! (obscure_syntax & RE_NEWLINE_OR))
X goto normal_char;
X else
X goto handle_bar;
X
X case '|':
X if (! (obscure_syntax & RE_NO_BK_VBAR))
X goto normal_char;
X else
X goto handle_bar;
X
X case '\\':
X if (p == pend) goto invalid_pattern;
X PATFETCH_RAW (c);
X switch (c) {
X case '(':
X if (obscure_syntax & RE_NO_BK_PARENS)
X goto normal_backsl;
X handle_open:
X if (stackp == stacke) goto nesting_too_deep;
X if (regnum < RE_NREGS) {
X PATPUSH (start_memory);
X PATPUSH (regnum);
X }
X *stackp++ = b - bufp->buffer;
X *stackp++ = fixup_jump ? fixup_jump -
X bufp->buffer + 1 : 0;
X *stackp++ = regnum++;
X *stackp++ = begalt - bufp->buffer;
X fixup_jump = 0;
X laststart = 0;
X begalt = b;
X break;
X
X case ')':
X if (obscure_syntax & RE_NO_BK_PARENS)
X goto normal_backsl;
X handle_close:
X if (stackp == stackb) goto unmatched_close;
X begalt = *--stackp + bufp->buffer;
X if (fixup_jump)
X store_jump (fixup_jump, jump, b);
X if (stackp[-1] < RE_NREGS) {
X PATPUSH (stop_memory);
X PATPUSH (stackp[-1]);
X }
X stackp -= 2;
X fixup_jump = 0;
X if (*stackp)
X fixup_jump = *stackp +
X bufp->buffer - 1;
X laststart = *--stackp + bufp->buffer;
X break;
X
X case '|':
X if (obscure_syntax & RE_NO_BK_VBAR)
X goto normal_backsl;
X handle_bar:
X insert_jump (on_failure_jump, begalt,
X b + 6, b);
X pending_exact = 0;
X b += 3;
X if (fixup_jump)
X store_jump (fixup_jump, jump, b);
X fixup_jump = b;
X b += 3;
X laststart = 0;
X begalt = b;
X break;
X
X case 'w':
X laststart = b;
X PATPUSH (wordchar);
X break;
X
X case 'W':
X laststart = b;
X PATPUSH (notwordchar);
X break;
X
X case '<':
X PATPUSH (wordbeg);
X break;
X
X case '>':
X PATPUSH (wordend);
X break;
X
X case 'b':
X PATPUSH (wordbound);
X break;
X
X case 'B':
X PATPUSH (notwordbound);
X break;
X
X case '`':
X PATPUSH (begbuf);
X break;
X
X case '\'':
X PATPUSH (endbuf);
X break;
X
X case '1':
X case '2':
X case '3':
X case '4':
X case '5':
X case '6':
X case '7':
X case '8':
X case '9':
X c1 = c - '0';
X if (c1 >= regnum)
X goto normal_char;
X for (stackt = stackp - 2; stackt > stackb; stackt -= 4)
X if (*stackt == c1)
X goto normal_char;
X laststart = b;
X PATPUSH (duplicate);
X PATPUSH (c1);
X break;
X
X case '+':
X case '?':
X if (obscure_syntax & RE_BK_PLUS_QM)
X goto handle_plus;
X
X default:
X normal_backsl:
X /*
X * You might think it would be useful for \
X * to mean not to translate; but if we
X * don't translate it, it will never match
X * anything.
X */
X if (translate)
X c = translate[c];
X goto normal_char;
X }
X break;
X
X default:
X normal_char:
X if (!pending_exact || pending_exact + *pending_exact + 1
X != b || *pending_exact == 0177 || *p == '*' ||
X *p == '^' || ((obscure_syntax & RE_BK_PLUS_QM)
X ? *p == '\\' && (p[1] == '+' || p[1] == '?')
X : (*p == '+' || *p == '?')))
X {
X laststart = b;
X PATPUSH (exactn);
X pending_exact = b;
X PATPUSH (0);
X }
X PATPUSH (c);
X (*pending_exact)++;
X }
X }
X
X if (fixup_jump)
X store_jump (fixup_jump, jump, b);
X
X if (stackp != stackb)
X goto unmatched_open;
X
X bufp->used = b - bufp->buffer;
X return(0);
X
X invalid_pattern:
X return("Invalid regular expression");
X
X unmatched_open:
X return("Unmatched \\(");
X
X unmatched_close:
X return("Unmatched \\)");
X
X end_of_pattern:
X return("Premature end of regular expression");
X
X nesting_too_deep:
X return("Nesting too deep");
X
X too_big:
X return("Regular expression too big");
X
X memory_exhausted:
X return("Memory exhausted");
X}
X
X/*
X * Store where `from' points a jump operation to jump to where `to' points.
X * `opcode' is the opcode to store.
X */
X
static int store_jump (from, opcode, to)
char *from, *to;
char opcode;
X{
X from[0] = opcode;
X from[1] = (to - (from + 3)) & 0377;
X from[2] = (to - (from + 3)) >> 8;
X return(0);
X}
X
X/* Open up space at char FROM, and insert there a jump to TO.
X * CURRENT_END gives te end of the storage no in use,
X * so we know how much data to copy up.
X * OP is the opcode of the jump to insert.
X *
X * If you call this function, you must zero out pending_exact.
X */
X
static int insert_jump (op, from, to, current_end)
char op;
char *from, *to, *current_end;
X{
X register char *pto = current_end + 3;
X register char *pfrom = current_end;
X
X while (pfrom != from)
X *--pto = *--pfrom;
X store_jump (from, op, to);
X return(0);
X}
X
X/* Given a pattern, compute a fastmap from it.
X * The fastmap records which of the (1 << BYTEWIDTH) possible characters
X * can start a string that matches the pattern.
X * This fastmap is used by re_search to skip quickly over totally
X * implausible text.
X *
X * The caller must supply the address of a (1 << BYTEWIDTH)-byte data area
X * as bufp->fastmap.
X * The other components of bufp describe the pattern to be used.
X */
X
void re_compile_fastmap (bufp)
struct re_pattern_buffer *bufp;
X{
X unsigned char *pattern = (unsigned char *) bufp->buffer;
X int size = bufp->used;
X register char *fastmap = bufp->fastmap;
X register unsigned char *p = pattern;
X register unsigned char *pend = pattern + size;
X register int j;
X unsigned char *translate = (unsigned char *) bufp->translate;
X
X unsigned char *stackb[NFAILURES];
X unsigned char **stackp = stackb;
X
X bzero (fastmap, (1 << BYTEWIDTH));
X bufp->fastmap_accurate = 1;
X bufp->can_be_null = 0;
X
X while (p) {
X if (p == pend) {
X bufp->can_be_null = 1;
X break;
X }
X switch ((enum regexpcode) *p++) {
X case exactn:
X if (translate)
X fastmap[translate[p[1]]] = 1;
X else
X fastmap[p[1]] = 1;
X break;
X
X case begline:
X case before_dot:
X case at_dot:
X case after_dot:
X case begbuf:
X case endbuf:
X case wordbound:
X case notwordbound:
X case wordbeg:
X case wordend:
X continue;
X
X case endline:
X if (translate)
X fastmap[translate['\n']] = 1;
X else
X fastmap['\n'] = 1;
X if (bufp->can_be_null != 1)
X bufp->can_be_null = 2;
X break;
X
X case finalize_jump:
X case maybe_finalize_jump:
X case jump:
X case dummy_failure_jump:
X bufp->can_be_null = 1;
X j = *p++ & 0377;
X j += SIGN_EXTEND_CHAR (*(char *)p) << 8;
X p += j + 1; /* The 1 compensates for missing ++ above */
X if (j > 0)
X continue;
X /*
X * Jump backward reached implies we just went through
X * the body of a loop and matched nothing.
X * Opcode jumped to should be an on_failure_jump.
X * Just treat it like an ordinary jump.
X * For a * loop, it has pushed its failure point already;
X * if so, discard that as redundant.
X */
X if ((enum regexpcode)
X *p != on_failure_jump)
X continue;
X p++;
X j = *p++ & 0377;
X j += SIGN_EXTEND_CHAR (*(char *)p) << 8;
X p += j + 1; /* The 1 compensates for missing ++ above */
X if (stackp != stackb && *stackp == p)
X stackp--;
X continue;
X
X case on_failure_jump:
X j = *p++ & 0377;
X j += SIGN_EXTEND_CHAR (*(char *)p) << 8;
X p++;
X *++stackp = p + j;
X continue;
X
X case start_memory:
X case stop_memory:
X p++;
X continue;
X
X case duplicate:
X bufp->can_be_null = 1;
X fastmap['\n'] = 1;
X case anychar:
X for (j = 0; j < (1 << BYTEWIDTH); j++)
X if (j != '\n')
X fastmap[j] = 1;
X if (bufp->can_be_null)
X return;
X /*
X * Don't return; check the alternative paths
X * so we can set can_be_null if appropriate.
X */
X break;
X
X case wordchar:
X for (j = 0; j < (1 << BYTEWIDTH); j++)
X if (SYNTAX (j) == Sword)
X fastmap[j] = 1;
X break;
X
X case notwordchar:
X for (j = 0; j < (1 << BYTEWIDTH); j++)
X if (SYNTAX (j) != Sword)
X fastmap[j] = 1;
X break;
X
X case charset:
X for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
X if (p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH))) {
X if (translate)
X fastmap[translate[j]] = 1;
X else
X fastmap[j] = 1;
X }
X break;
X
X case charset_not:
X /* Chars beyond end of map must be allowed */
X for (j = *p * BYTEWIDTH; j < (1 << BYTEWIDTH); j++)
X if (translate)
X fastmap[translate[j]] = 1;
X else
X fastmap[j] = 1;
X
X for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
X if (!(p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH)))) {
X if (translate)
X fastmap[translate[j]] = 1;
X else
X fastmap[j] = 1;
X }
X break;
X
X default:
X /* unused, syntaxspec or notsyntaxspec */
X break;
X }
X
X /*
X * Get here means we have successfully found the possible starting
X * characters
X * of one path of the pattern. We need not follow this path any
X * farther. Instead, look at the next alternative remembered in
X * the stack.
X */
X if (stackp != stackb)
X p = *stackp--;
X else
X break;
X }
X}
X
X
X/* Like re_search_2, below, but only one string is specified. */
X
int re_search (pbufp, string, size, startpos, range, regs)
struct re_pattern_buffer *pbufp;
char *string;
int size, startpos, range;
struct re_registers *regs;
X{
X return(re_search_2 (pbufp, 0, 0, string, size, startpos, range, regs,
X size));
X}
X
X/*
X * Like re_match_2 but tries first a match starting at index STARTPOS,
X * then at STARTPOS + 1, and so on.
X * RANGE is the number of places to try before giving up.
X * If RANGE is negative, the starting positions tried are
X * STARTPOS, STARTPOS - 1, etc.
X * It is up to the caller to make sure that range is not so large
X * as to take the starting position outside of the input strings.
X * The value returned is the position at which the match was found,
X * or -1 if no match was found,
X * or -2 if error (such as failure stack overflow).
X */
X
int re_search_2 (pbufp, string1, size1, string2, size2, startpos, range,
X regs, mstop)
struct re_pattern_buffer *pbufp;
char *string1, *string2;
int size1, size2;
int startpos;
register int range;
struct re_registers *regs;
int mstop;
X{
X register char *fastmap = pbufp->fastmap;
X register unsigned char *translate = (unsigned char *) pbufp->translate;
X int total = size1 + size2;
X int val;
X
X /* Update the fastmap now if not correct already */
X if (fastmap && !pbufp->fastmap_accurate)
X re_compile_fastmap (pbufp);
X
X /* Don't waste time in a long search for a pattern
X that says it is anchored. */
X if (pbufp->used > 0 && (enum regexpcode) pbufp->buffer[0] == begbuf
X && range > 0) {
X if (startpos > 0) {
X return(-1);
X }
X else
X range = 1;
X }
X
X while (1) {
X /* If a fastmap is supplied, skip quickly over characters
X that cannot possibly be the start of a match.
X Note, however, that if the pattern can possibly match
X the null string, we must test it at each starting point
X so that we take the first null string we get. */
X
X if (fastmap && startpos < total && pbufp->can_be_null != 1) {
X if (range > 0) {
X register int lim = 0;
X register unsigned char *p;
X int irange = range;
X if (startpos < size1 && startpos + range >= size1)
X lim = range - (size1 - startpos);
X
X p = ((unsigned char *)&(startpos >= size1 ? string2 -
X size1 : string1)[startpos]);
X
X if (translate) {
X while (range > lim && !fastmap[translate[*p++]])
X range--;
X }
X else {
X while (range > lim && !fastmap[*p++])
X range--;
X }
X startpos += irange - range;
X }
X else {
X register unsigned char c;
X if (startpos >= size1)
X c = string2[startpos - size1];
X else
X c = string1[startpos];
X c &= 0xff;
X if (translate ? !fastmap[translate[c]] : !fastmap[c])
X goto advance;
X }
X }
X
X if (range >= 0 && startpos == total
X && fastmap && pbufp->can_be_null == 0)
X return(-1);
X
X val = re_match_2 (pbufp, string1, size1, string2, size2,
X startpos, regs, mstop);
X if (0 <= val) {
X if (val == -2)
X return(-2);
X return(startpos);
X }
X
X#ifdef C_ALLOCA
X alloca (0);
X#endif /* C_ALLOCA */
X
X advance:
X if (!range)
X break;
X if (range > 0)
X range--, startpos++; else range++, startpos--;
X }
X return(-1);
X}
X
X
int re_match (pbufp, string, size, pos, regs)
struct re_pattern_buffer *pbufp;
char *string;
int size, pos;
struct re_registers *regs;
X{
X return(re_match_2(pbufp, 0, 0, string, size, pos, regs, size));
X}
X
X/* Maximum size of failure stack. Beyond this, overflow is an error. */
X
int re_max_failures = 2000;
X
static int bcmp_translate();
X/*
X * Match the pattern described by PBUFP against data which is the virtual
X * concatenation of STRING1 and STRING2.
X * SIZE1 and SIZE2 are the sizes of the two data strings.
X * Start the match at position POS.
X * Do not consider matching past the position MSTOP.
X *
X * If pbufp->fastmap is nonzero, then it had better be up to date.
X *
X * The reason that the data to match are specified as two components
X * which are to be regarded as concatenated
X * is so this function can be used directly on the contents of an Emacs buffer.
X *
X * -1 is returned if there is no match. -2 is returned if there is
X * an error (such as match stack overflow). Otherwise the value is the length
X * of the substring which was matched.
X */
X
int re_match_2 (pbufp, string1, size1, string2, size2, pos, regs, mstop)
struct re_pattern_buffer *pbufp;
unsigned char *string1, *string2;
int size1, size2;
int pos;
struct re_registers *regs;
int mstop;
X{
X register unsigned char *p = (unsigned char *) pbufp->buffer;
X register unsigned char *pend = p + pbufp->used;
X /* End of first string */
X unsigned char *end1;
X /* End of second string */
X unsigned char *end2;
X /* Pointer just past last char to consider matching */
X unsigned char *end_match_1, *end_match_2;
X register unsigned char *d, *dend;
X register int mcnt;
X unsigned char *translate = (unsigned char *) pbufp->translate;
X
X /*
X * Failure point stack. Each place that can handle a failure further
X * down the line pushes a failure point on this stack. It consists of
X * two char *'s.
X * The first one pushed is where to resume scanning the pattern;
X * the second pushed is where to resume scanning the strings.
X * If the latter is zero, the failure point is a "dummy".
X * If a failure happens and the innermost failure point is dormant,
X * it discards that failure point and tries the next one.
X */
X
X unsigned char *initial_stack[2 * NFAILURES];
X unsigned char **stackb = initial_stack;
X unsigned char **stackp = stackb, **stacke = &stackb[2 * NFAILURES];
X
X /*
X * Information on the "contents" of registers.
X * These are pointers into the input strings; they record
X * just what was matched (on this attempt) by some part of the pattern.
X * The start_memory command stores the start of a register's contents
X * and the stop_memory command stores the end.
X *
X * At that point, regstart[regnum] points to the first character in the
X * register, regend[regnum] points to the first character beyond the end
X * of the register, regstart_seg1[regnum] is true iff regstart[regnum]
X * points into string1, and regend_seg1[regnum] is true iff
X * regend[regnum] points into string1.
X */
X
X unsigned char *regstart[RE_NREGS];
X unsigned char *regend[RE_NREGS];
X unsigned char regstart_seg1[RE_NREGS], regend_seg1[RE_NREGS];
X
X /*
X * Set up pointers to ends of strings.
X * Don't allow the second string to be empty unless both are empty.
X */
X if (!size2) {
X string2 = string1;
X size2 = size1;
X string1 = 0;
X size1 = 0;
X }
X end1 = string1 + size1;
X end2 = string2 + size2;
X
X /* Compute where to stop matching, within the two strings */
X if (mstop <= size1) {
X end_match_1 = string1 + mstop;
X end_match_2 = string2;
X }
X else {
X end_match_1 = end1;
X end_match_2 = string2 + mstop - size1;
X }
X
X /*
X * Initialize \) text positions to -1 to mark ones that no \( or \) has
X * been seen for.
X */
X
X for (mcnt = 0; mcnt < sizeof (regend) / sizeof (*regend); mcnt++)
X regend[mcnt] = (unsigned char *) -1;
X
X /*
X * `p' scans through the pattern as `d' scans through the data.
X * `dend' is the end of the input string that `d' points within.
X * `d' is advanced into the following input string whenever necessary,
X * but this happens before fetching;
X * therefore, at the beginning of the loop,
X * `d' can be pointing at the end of a string,
X * but it cannot equal string2.
X */
X
X if (pos <= size1)
X d = string1 + pos, dend = end_match_1;
X else
X d = string2 + pos - size1, dend = end_match_2;
X
X/* Write PREFETCH; just before fetching a character with *d. */
X#define PREFETCH \
X while (d == dend) \
X { if (dend == end_match_2) goto fail; /* end of string2 => failure */ \
X d = string2; /* end of string1 => advance to string2. */ \
X dend = end_match_2; }
X
X /*
X * This loop loops over pattern commands.
X * It exits by returning from the function if match is complete,
X * or it drops through if match fails at this starting point in the
X * input data.
X */
X
X while (1) {
X if (p == pend) {
X /* End of pattern means we have succeeded! */
X /*
X * If caller wants register contents data back, convert it to
X * indices
X */
X if (regs) {
X regs->start[0] = pos;
X if (dend == end_match_1)
X regs->end[0] = d - string1;
X else
X regs->end[0] = d - string2 + size1;
X for (mcnt = 1; mcnt < RE_NREGS; mcnt++) {
X if (regend[mcnt] == (unsigned char *) -1) {
X regs->start[mcnt] = -1;
X regs->end[mcnt] = -1;
X continue;
X }
X if (regstart_seg1[mcnt])
X regs->start[mcnt] = regstart[mcnt] - string1;
X else
X regs->start[mcnt] = regstart[mcnt] - string2 +
X size1;
X if (regend_seg1[mcnt])
X regs->end[mcnt] = regend[mcnt] - string1;
X else
X regs->end[mcnt] = regend[mcnt] - string2 +
X size1;
X }
X }
X if (dend == end_match_1) {
X return((d - string1 - pos));
X }
X else {
X return(d - string2 + size1 - pos);
X }
X }
X
X /* Otherwise match next pattern command */
X switch ((enum regexpcode) *p++) {
X /*
X * \( is represented by a start_memory, \) by a stop_memory.
X * Both of those commands contain a "register number" argument.
X * The text matched within the \( and \) is recorded under
X * that number.
X * Then, \<digit> turns into a `duplicate' command which
X * is followed by the numeric value of <digit> as the
X * register number.
X */
X
X case start_memory:
X regstart[*p] = d;
X regstart_seg1[*p++] = (dend == end_match_1);
X break;
X
X case stop_memory:
X regend[*p] = d;
X regend_seg1[*p++] = (dend == end_match_1);
X break;
X
X case duplicate:
X {
X int regno = *p++; /* Get which register to match against */
X register unsigned char *d2, *dend2;
X
X d2 = regstart[regno];
X dend2 = ((regstart_seg1[regno] == regend_seg1[regno])
X ? regend[regno] : end_match_1);
X while (1) {
X /*
X * Advance to next segment in register contents, if
X * necessary
X */
X while (d2 == dend2) {
X if (dend2 == end_match_2) break;
X if (dend2 == regend[regno]) break;
X /* end of string1 => advance to string2. */
X d2 = string2, dend2 = regend[regno];
X }
X /* At end of register contents => success */
X if (d2 == dend2) break;
X
X /*
X * Advance to next segment in data being matched,
X * if necessary.
X */
X PREFETCH;
X
X /* mcnt gets # consecutive chars to compare */
X mcnt = dend - d;
X if (mcnt > dend2 - d2)
X mcnt = dend2 - d2;
X /*
X * Compare that many; failure if mismatch, else
X * skip them.
X */
X if (translate ? bcmp_translate (d, d2, mcnt,
X translate) :
X bcmp (d, d2, mcnt))
X goto fail;
X d += mcnt, d2 += mcnt;
X }
X }
X break;
X
X case anychar:
X /* fetch a data character */
X PREFETCH;
X if ((translate ? translate[*d++] : *d++) == '\n')
X goto fail;
X break;
X
X case charset:
X case charset_not:
X {
X /* Nonzero for charset_not */
X int not = 0;
X register int c;
X if (*(p - 1) == (unsigned char) charset_not)
X not = 1;
X
X /* fetch a data character */
X PREFETCH;
X
X if (translate)
X c = translate [*d];
X else
X c = *d;
X
X if (c < *p * BYTEWIDTH
X && p[1 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
X not = !not;
X
X p += 1 + *p;
X
X if (!not) goto fail;
X d++;
X break;
X }
X
X case begline:
X if (d == string1 || d[-1] == '\n')
X break;
X goto fail;
X
X case endline:
X if (d == end2 || (d == end1 ? (size2 == 0 || *string2 == '\n')
X : *d == '\n'))
X break;
X goto fail;
X
X /*
X * "or" constructs ("|") are handled by starting each alternative
X * with an on_failure_jump that points to the start of the next
X * alternative.
X * Each alternative except the last ends with a jump to the
X * joining point.
X * (Actually, each jump except for the last one really jumps
X * to the following jump, because tensioning the jumps is a hassle.)
X */
X
X /*
X * The start of a stupid repeat has an on_failure_jump that points
X * past the end of the repeat text.
X * This makes a failure point so that, on failure to match a
X * repetition, matching restarts past as many repetitions have
X * been found with no way to fail and look for another one.
X */
X
X /*
X * A smart repeat is similar but loops back to the on_failure_jump
X * so that each repetition makes another failure point.
X */
X
X case on_failure_jump:
X if (stackp == stacke) {
X unsigned char **stackx;
X if (stacke - stackb > re_max_failures * 2)
X return(-2);
X stackx = (unsigned char **) alloca (2 * (stacke - stackb)
X * sizeof (char *));
X bcopy (stackb, stackx, (stacke - stackb) *
X sizeof (char *));
X stackp = stackx + (stackp - stackb);
X stacke = stackx + 2 * (stacke - stackb);
X stackb = stackx;
X }
X mcnt = *p++ & 0377;
X mcnt += SIGN_EXTEND_CHAR (*(char *)p) << 8;
X p++;
X *stackp++ = mcnt + p;
X *stackp++ = d;
X break;
X
X /*
X * The end of a smart repeat has an maybe_finalize_jump back.
X * Change it either to a finalize_jump or an ordinary jump.
X */
X
X case maybe_finalize_jump:
X mcnt = *p++ & 0377;
X mcnt += SIGN_EXTEND_CHAR (*(char *)p) << 8;
X p++;
X {
X register unsigned char *p2 = p;
X /*
X * Compare what follows with the begining of the repeat.
X * If we can establish that there is nothing that they
X * would both match, we can change to finalize_jump.
X */
X while (p2 != pend
X && (*p2 == (unsigned char) stop_memory
X || *p2 == (unsigned char) start_memory))
X p2++;
X if (p2 == pend)
X p[-3] = (unsigned char) finalize_jump;
X else if (*p2 == (unsigned char) exactn
X || *p2 == (unsigned char) endline) {
X register int c = *p2 == (unsigned char) endline ?
X '\n' : p2[2];
X register unsigned char *p1 = p + mcnt;
X /*
X * p1[0] ... p1[2] are an on_failure_jump.
X * Examine what follows that
X */
X if (p1[3] == (unsigned char) exactn && p1[5] != c)
X p[-3] = (unsigned char) finalize_jump;
X else if (p1[3] == (unsigned char) charset
X || p1[3] == (unsigned char) charset_not) {
X int not = p1[3] == (unsigned char) charset_not;
X if (c < p1[4] * BYTEWIDTH && p1[5 + c
X / BYTEWIDTH] &
X (1 << (c % BYTEWIDTH)))
X not = !not;
X /* not is 1 if c would match */
X /* That means it is not safe to finalize */
X if (!not)
X p[-3] = (unsigned char) finalize_jump;
X }
X }
X }
X p -= 2;
X if (p[-1] != (unsigned char) finalize_jump) {
X p[-1] = (unsigned char) jump;
X goto nofinalize;
X }
X
X /*
X * The end of a stupid repeat has a finalize-jump
X * back to the start, where another failure point will be made
X * which will point after all the repetitions found so far.
X */
X
X case finalize_jump:
X stackp -= 2;
X
X case jump:
X nofinalize:
X mcnt = *p++ & 0377;
X mcnt += SIGN_EXTEND_CHAR (*(char *)p) << 8;
X p += mcnt + 1; /* The 1 compensates for missing ++ above */
X break;
X
X case dummy_failure_jump:
X if (stackp == stacke) {
X unsigned char **stackx
X = (unsigned char **) alloca (2 * (stacke - stackb)
X * sizeof (char *));
X bcopy (stackb, stackx, (stacke - stackb) * sizeof (char *));
X stackp = stackx + (stackp - stackb);
X stacke = stackx + 2 * (stacke - stackb);
X stackb = stackx;
X }
X *stackp++ = 0;
X *stackp++ = 0;
X goto nofinalize;
X
X case wordbound:
X if (d == string1 /* Points to first char */
X || d == end2 /* Points to end */
X || (d == end1 && size2 == 0)) /* Points to end */
X break;
X if ((SYNTAX (d[-1]) == Sword)
X != (SYNTAX (d == end1 ? *string2 : *d) == Sword))
X break;
X goto fail;
X
X case notwordbound:
X if (d == string1 /* Points to first char */
X || d == end2 /* Points to end */
X || (d == end1 && size2 == 0)) /* Points to end */
X goto fail;
X if ((SYNTAX (d[-1]) == Sword)
X != (SYNTAX (d == end1 ? *string2 : *d) == Sword))
X goto fail;
X break;
X
X case wordbeg:
X if (d == end2 /* Points to end */
X || (d == end1 && size2 == 0) /* Points to end */
X || SYNTAX (* (d == end1 ? string2 : d)) != Sword)
X /* Next char not a letter */
X goto fail;
X if (d == string1 /* Points to first char */
X || SYNTAX (d[-1]) != Sword) /* prev char not letter */
X break;
X goto fail;
X
X case wordend:
X if (d == string1 /* Points to first char */
X || SYNTAX (d[-1]) != Sword) /* prev char not letter */
X goto fail;
X if (d == end2 /* Points to end */
X || (d == end1 && size2 == 0) /* Points to end */
X || SYNTAX (d == end1 ? *string2 : *d) != Sword)
X /* Next char not a letter */
X break;
X goto fail;
X
X case wordchar:
X PREFETCH;
X if (SYNTAX (*d++) == 0) goto fail;
X break;
X
X case notwordchar:
X PREFETCH;
X if (SYNTAX (*d++) != 0) goto fail;
X break;
X
X case begbuf:
X if (d == string1) /* Note, d cannot equal string2 */
X break; /* unless string1 == string2. */
X goto fail;
X
X case endbuf:
X if (d == end2 || (d == end1 && size2 == 0))
X break;
X goto fail;
X
X case exactn:
X /*
X * Match the next few pattern characters exactly.
X * mcnt is how many characters to match.
X */
X mcnt = *p++;
X if (translate) {
X do {
X PREFETCH;
X if (translate[*d++] != *p++) goto fail;
X }
X while (--mcnt);
X }
X else {
X do {
X PREFETCH;
X if (*d++ != *p++) goto fail;
X }
X while (--mcnt);
X }
X break;
X
X default:
X break;
X }
X /* Successfully matched one pattern command; keep matching */
X continue;
X
X /* Jump here if any matching operation fails. */
X fail:
X if (stackp != stackb) {
X /* A restart point is known. Restart there and pop it. */
X if (!stackp[-2]) {
X /*
X * If innermost failure point is dormant, flush it and
X * keep looking
X */
X stackp -= 2;
X goto fail;
X }
X d = *--stackp;
X p = *--stackp;
X if (d >= string1 && d <= end1)
X dend = end_match_1;
X }
X else break; /* Matching at this starting point really fails! */
X }
X return(-1); /* Failure to match */
X}
X
static int bcmp_translate (s1, s2, len, translate)
unsigned char *s1, *s2;
register int len;
unsigned char *translate;
X{
X register unsigned char *p1 = s1, *p2 = s2;
X
X while (len) {
X if (translate [*p1++] != translate [*p2++]) return(1);
X len--;
X }
X return(0);
X}
X
X/* Entry points compatible with bsd4.2 regex library */
X
static struct re_pattern_buffer re_comp_buf;
X
char *re_comp (s)
char *s;
X{
X if (!s) {
X if (!re_comp_buf.buffer)
X return("No previous regular expression");
X return(0);
X }
X
X if (!re_comp_buf.buffer) {
X if (!(re_comp_buf.buffer = (char *) XtMalloc (200)))
X return("Memory exhausted");
X re_comp_buf.allocated = 200;
X if (!(re_comp_buf.fastmap = (char *) XtMalloc (1 << BYTEWIDTH)))
X return("Memory exhausted");
X }
X return(re_compile_pattern (s, strlen (s), &re_comp_buf));
X}
X
int re_exec (s)
char *s;
X{
X int len = strlen (s);
X
X return(0 <= re_search (&re_comp_buf, s, len, 0, len, 0));
X}
END_OF_FILE
if test 47364 -ne `wc -c <'regex.c'`; then
echo shar: \"'regex.c'\" unpacked with wrong size!
fi
# end of 'regex.c'
fi
echo shar: End of archive 17 \(of 17\).
cp /dev/null ark17isdone
MISSING=""
for I in 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 ; do
if test ! -f ark${I}isdone ; then
MISSING="${MISSING} ${I}"
fi
done
if test "${MISSING}" = "" ; then
echo You have unpacked all 17 archives.
rm -f ark[1-9]isdone ark[1-9][0-9]isdone
else
echo You still need to unpack the following archives:
echo " " ${MISSING}
fi
## End of shell archive.
exit 0
dan
----------------------------------------------------
O'Reilly && Associates argv@sun.com / argv@ora.com
Opinions expressed reflect those of the author only.