1df930be7Sderaadt /*- 2df930be7Sderaadt * Copyright (c) 1992, 1993, 1994 Henry Spencer. 3df930be7Sderaadt * Copyright (c) 1992, 1993, 1994 4df930be7Sderaadt * The Regents of the University of California. All rights reserved. 5df930be7Sderaadt * 6df930be7Sderaadt * This code is derived from software contributed to Berkeley by 7df930be7Sderaadt * Henry Spencer. 8df930be7Sderaadt * 9df930be7Sderaadt * Redistribution and use in source and binary forms, with or without 10df930be7Sderaadt * modification, are permitted provided that the following conditions 11df930be7Sderaadt * are met: 12df930be7Sderaadt * 1. Redistributions of source code must retain the above copyright 13df930be7Sderaadt * notice, this list of conditions and the following disclaimer. 14df930be7Sderaadt * 2. Redistributions in binary form must reproduce the above copyright 15df930be7Sderaadt * notice, this list of conditions and the following disclaimer in the 16df930be7Sderaadt * documentation and/or other materials provided with the distribution. 17df930be7Sderaadt * 3. All advertising materials mentioning features or use of this software 18df930be7Sderaadt * must display the following acknowledgement: 19df930be7Sderaadt * This product includes software developed by the University of 20df930be7Sderaadt * California, Berkeley and its contributors. 21df930be7Sderaadt * 4. Neither the name of the University nor the names of its contributors 22df930be7Sderaadt * may be used to endorse or promote products derived from this software 23df930be7Sderaadt * without specific prior written permission. 24df930be7Sderaadt * 25df930be7Sderaadt * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26df930be7Sderaadt * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27df930be7Sderaadt * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28df930be7Sderaadt * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29df930be7Sderaadt * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30df930be7Sderaadt * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31df930be7Sderaadt * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32df930be7Sderaadt * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33df930be7Sderaadt * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34df930be7Sderaadt * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35df930be7Sderaadt * SUCH DAMAGE. 36*442a6afdSmillert * 37*442a6afdSmillert * @(#)regexec.c 8.3 (Berkeley) 3/20/94 38df930be7Sderaadt */ 39df930be7Sderaadt 40df930be7Sderaadt #if defined(LIBC_SCCS) && !defined(lint) 41*442a6afdSmillert #if 0 42*442a6afdSmillert static char sccsid[] = "@(#)regexec.c 8.3 (Berkeley) 3/20/94"; 43*442a6afdSmillert #else 44*442a6afdSmillert static char rcsid[] = "$OpenBSD: regexec.c,v 1.6 1997/04/28 20:45:01 millert Exp $"; 45*442a6afdSmillert #endif 46df930be7Sderaadt #endif /* LIBC_SCCS and not lint */ 47df930be7Sderaadt 48df930be7Sderaadt /* 49df930be7Sderaadt * the outer shell of regexec() 50df930be7Sderaadt * 51df930be7Sderaadt * This file includes engine.c *twice*, after muchos fiddling with the 52df930be7Sderaadt * macros that code uses. This lets the same code operate on two different 53df930be7Sderaadt * representations for state sets. 54df930be7Sderaadt */ 55df930be7Sderaadt #include <sys/types.h> 56df930be7Sderaadt #include <stdio.h> 57df930be7Sderaadt #include <stdlib.h> 58df930be7Sderaadt #include <string.h> 59df930be7Sderaadt #include <limits.h> 60df930be7Sderaadt #include <ctype.h> 61df930be7Sderaadt #include <regex.h> 62df930be7Sderaadt 63df930be7Sderaadt #include "utils.h" 64df930be7Sderaadt #include "regex2.h" 65df930be7Sderaadt 66*442a6afdSmillert static int nope = 0; /* for use in asserts; shuts lint up */ 67*442a6afdSmillert 68df930be7Sderaadt /* macros for manipulating states, small version */ 69*442a6afdSmillert #define states long 70df930be7Sderaadt #define states1 states /* for later use in regexec() decision */ 71df930be7Sderaadt #define CLEAR(v) ((v) = 0) 72*442a6afdSmillert #define SET0(v, n) ((v) &= ~((unsigned long)1 << (n))) 73*442a6afdSmillert #define SET1(v, n) ((v) |= (unsigned long)1 << (n)) 74*442a6afdSmillert #define ISSET(v, n) (((v) & ((unsigned long)1 << (n))) != 0) 75df930be7Sderaadt #define ASSIGN(d, s) ((d) = (s)) 76df930be7Sderaadt #define EQ(a, b) ((a) == (b)) 77*442a6afdSmillert #define STATEVARS long dummy /* dummy version */ 78df930be7Sderaadt #define STATESETUP(m, n) /* nothing */ 79df930be7Sderaadt #define STATETEARDOWN(m) /* nothing */ 80df930be7Sderaadt #define SETUP(v) ((v) = 0) 81*442a6afdSmillert #define onestate long 82*442a6afdSmillert #define INIT(o, n) ((o) = (unsigned long)1 << (n)) 83*442a6afdSmillert #define INC(o) ((o) <<= 1) 84df930be7Sderaadt #define ISSTATEIN(v, o) (((v) & (o)) != 0) 85df930be7Sderaadt /* some abbreviations; note that some of these know variable names! */ 86df930be7Sderaadt /* do "if I'm here, I can also be there" etc without branches */ 87*442a6afdSmillert #define FWD(dst, src, n) ((dst) |= ((unsigned long)(src)&(here)) << (n)) 88*442a6afdSmillert #define BACK(dst, src, n) ((dst) |= ((unsigned long)(src)&(here)) >> (n)) 89*442a6afdSmillert #define ISSETBACK(v, n) (((v) & ((unsigned long)here >> (n))) != 0) 90df930be7Sderaadt /* function names */ 91df930be7Sderaadt #define SNAMES /* engine.c looks after details */ 92df930be7Sderaadt 93df930be7Sderaadt #include "engine.c" 94df930be7Sderaadt 95df930be7Sderaadt /* now undo things */ 96df930be7Sderaadt #undef states 97df930be7Sderaadt #undef CLEAR 98df930be7Sderaadt #undef SET0 99df930be7Sderaadt #undef SET1 100df930be7Sderaadt #undef ISSET 101df930be7Sderaadt #undef ASSIGN 102df930be7Sderaadt #undef EQ 103df930be7Sderaadt #undef STATEVARS 104df930be7Sderaadt #undef STATESETUP 105df930be7Sderaadt #undef STATETEARDOWN 106df930be7Sderaadt #undef SETUP 107df930be7Sderaadt #undef onestate 108df930be7Sderaadt #undef INIT 109df930be7Sderaadt #undef INC 110df930be7Sderaadt #undef ISSTATEIN 111df930be7Sderaadt #undef FWD 112df930be7Sderaadt #undef BACK 113df930be7Sderaadt #undef ISSETBACK 114df930be7Sderaadt #undef SNAMES 115df930be7Sderaadt 116df930be7Sderaadt /* macros for manipulating states, large version */ 117df930be7Sderaadt #define states char * 118df930be7Sderaadt #define CLEAR(v) memset(v, 0, m->g->nstates) 119df930be7Sderaadt #define SET0(v, n) ((v)[n] = 0) 120df930be7Sderaadt #define SET1(v, n) ((v)[n] = 1) 121df930be7Sderaadt #define ISSET(v, n) ((v)[n]) 122df930be7Sderaadt #define ASSIGN(d, s) memcpy(d, s, m->g->nstates) 123df930be7Sderaadt #define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0) 124*442a6afdSmillert #define STATEVARS long vn; char *space 125df930be7Sderaadt #define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \ 126df930be7Sderaadt if ((m)->space == NULL) return(REG_ESPACE); \ 127df930be7Sderaadt (m)->vn = 0; } 128df930be7Sderaadt #define STATETEARDOWN(m) { free((m)->space); } 129df930be7Sderaadt #define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates]) 130*442a6afdSmillert #define onestate long 131df930be7Sderaadt #define INIT(o, n) ((o) = (n)) 132df930be7Sderaadt #define INC(o) ((o)++) 133df930be7Sderaadt #define ISSTATEIN(v, o) ((v)[o]) 134df930be7Sderaadt /* some abbreviations; note that some of these know variable names! */ 135df930be7Sderaadt /* do "if I'm here, I can also be there" etc without branches */ 136df930be7Sderaadt #define FWD(dst, src, n) ((dst)[here+(n)] |= (src)[here]) 137df930be7Sderaadt #define BACK(dst, src, n) ((dst)[here-(n)] |= (src)[here]) 138df930be7Sderaadt #define ISSETBACK(v, n) ((v)[here - (n)]) 139df930be7Sderaadt /* function names */ 140df930be7Sderaadt #define LNAMES /* flag */ 141df930be7Sderaadt 142df930be7Sderaadt #include "engine.c" 143df930be7Sderaadt 144df930be7Sderaadt /* 145df930be7Sderaadt - regexec - interface for matching 146df930be7Sderaadt = extern int regexec(const regex_t *, const char *, size_t, \ 147df930be7Sderaadt = regmatch_t [], int); 148df930be7Sderaadt = #define REG_NOTBOL 00001 149df930be7Sderaadt = #define REG_NOTEOL 00002 150df930be7Sderaadt = #define REG_STARTEND 00004 151df930be7Sderaadt = #define REG_TRACE 00400 // tracing of execution 152df930be7Sderaadt = #define REG_LARGE 01000 // force large representation 153df930be7Sderaadt = #define REG_BACKR 02000 // force use of backref code 154df930be7Sderaadt * 155df930be7Sderaadt * We put this here so we can exploit knowledge of the state representation 156df930be7Sderaadt * when choosing which matcher to call. Also, by this point the matchers 157df930be7Sderaadt * have been prototyped. 158df930be7Sderaadt */ 159df930be7Sderaadt int /* 0 success, REG_NOMATCH failure */ 160df930be7Sderaadt regexec(preg, string, nmatch, pmatch, eflags) 161df930be7Sderaadt const regex_t *preg; 162df930be7Sderaadt const char *string; 163df930be7Sderaadt size_t nmatch; 164df930be7Sderaadt regmatch_t pmatch[]; 165df930be7Sderaadt int eflags; 166df930be7Sderaadt { 167df930be7Sderaadt register struct re_guts *g = preg->re_g; 168df930be7Sderaadt #ifdef REDEBUG 169df930be7Sderaadt # define GOODFLAGS(f) (f) 170df930be7Sderaadt #else 171df930be7Sderaadt # define GOODFLAGS(f) ((f)&(REG_NOTBOL|REG_NOTEOL|REG_STARTEND)) 172df930be7Sderaadt #endif 173df930be7Sderaadt 174df930be7Sderaadt if (preg->re_magic != MAGIC1 || g->magic != MAGIC2) 175df930be7Sderaadt return(REG_BADPAT); 176df930be7Sderaadt assert(!(g->iflags&BAD)); 177df930be7Sderaadt if (g->iflags&BAD) /* backstop for no-debug case */ 178df930be7Sderaadt return(REG_BADPAT); 179df930be7Sderaadt eflags = GOODFLAGS(eflags); 180df930be7Sderaadt 181df930be7Sderaadt if (g->nstates <= CHAR_BIT*sizeof(states1) && !(eflags®_LARGE)) 182df930be7Sderaadt return(smatcher(g, (char *)string, nmatch, pmatch, eflags)); 183df930be7Sderaadt else 184df930be7Sderaadt return(lmatcher(g, (char *)string, nmatch, pmatch, eflags)); 185df930be7Sderaadt } 186