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. 176580fee3Smillert * 3. Neither the name of the University nor the names of its contributors 18df930be7Sderaadt * may be used to endorse or promote products derived from this software 19df930be7Sderaadt * without specific prior written permission. 20df930be7Sderaadt * 21df930be7Sderaadt * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22df930be7Sderaadt * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23df930be7Sderaadt * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24df930be7Sderaadt * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25df930be7Sderaadt * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26df930be7Sderaadt * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27df930be7Sderaadt * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28df930be7Sderaadt * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29df930be7Sderaadt * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30df930be7Sderaadt * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31df930be7Sderaadt * SUCH DAMAGE. 32442a6afdSmillert * 33442a6afdSmillert * @(#)regexec.c 8.3 (Berkeley) 3/20/94 34df930be7Sderaadt */ 35df930be7Sderaadt 36df930be7Sderaadt #if defined(LIBC_SCCS) && !defined(lint) 37442a6afdSmillert #if 0 38442a6afdSmillert static char sccsid[] = "@(#)regexec.c 8.3 (Berkeley) 3/20/94"; 39442a6afdSmillert #else 40*3d7c72a1Sotto static char rcsid[] = "$OpenBSD: regexec.c,v 1.9 2004/10/17 17:58:54 otto Exp $"; 41442a6afdSmillert #endif 42df930be7Sderaadt #endif /* LIBC_SCCS and not lint */ 43df930be7Sderaadt 44df930be7Sderaadt /* 45df930be7Sderaadt * the outer shell of regexec() 46df930be7Sderaadt * 47df930be7Sderaadt * This file includes engine.c *twice*, after muchos fiddling with the 48df930be7Sderaadt * macros that code uses. This lets the same code operate on two different 49df930be7Sderaadt * representations for state sets. 50df930be7Sderaadt */ 51df930be7Sderaadt #include <sys/types.h> 52df930be7Sderaadt #include <stdio.h> 53df930be7Sderaadt #include <stdlib.h> 54df930be7Sderaadt #include <string.h> 55df930be7Sderaadt #include <limits.h> 56df930be7Sderaadt #include <ctype.h> 57df930be7Sderaadt #include <regex.h> 58df930be7Sderaadt 59df930be7Sderaadt #include "utils.h" 60df930be7Sderaadt #include "regex2.h" 61df930be7Sderaadt 62df930be7Sderaadt /* macros for manipulating states, small version */ 63442a6afdSmillert #define states long 64df930be7Sderaadt #define states1 states /* for later use in regexec() decision */ 65df930be7Sderaadt #define CLEAR(v) ((v) = 0) 66442a6afdSmillert #define SET0(v, n) ((v) &= ~((unsigned long)1 << (n))) 67442a6afdSmillert #define SET1(v, n) ((v) |= (unsigned long)1 << (n)) 68442a6afdSmillert #define ISSET(v, n) (((v) & ((unsigned long)1 << (n))) != 0) 69df930be7Sderaadt #define ASSIGN(d, s) ((d) = (s)) 70df930be7Sderaadt #define EQ(a, b) ((a) == (b)) 71442a6afdSmillert #define STATEVARS long dummy /* dummy version */ 72df930be7Sderaadt #define STATESETUP(m, n) /* nothing */ 73df930be7Sderaadt #define STATETEARDOWN(m) /* nothing */ 74df930be7Sderaadt #define SETUP(v) ((v) = 0) 75442a6afdSmillert #define onestate long 76442a6afdSmillert #define INIT(o, n) ((o) = (unsigned long)1 << (n)) 77442a6afdSmillert #define INC(o) ((o) <<= 1) 78df930be7Sderaadt #define ISSTATEIN(v, o) (((v) & (o)) != 0) 79df930be7Sderaadt /* some abbreviations; note that some of these know variable names! */ 80df930be7Sderaadt /* do "if I'm here, I can also be there" etc without branches */ 81442a6afdSmillert #define FWD(dst, src, n) ((dst) |= ((unsigned long)(src)&(here)) << (n)) 82442a6afdSmillert #define BACK(dst, src, n) ((dst) |= ((unsigned long)(src)&(here)) >> (n)) 83442a6afdSmillert #define ISSETBACK(v, n) (((v) & ((unsigned long)here >> (n))) != 0) 84df930be7Sderaadt /* function names */ 85df930be7Sderaadt #define SNAMES /* engine.c looks after details */ 86df930be7Sderaadt 87df930be7Sderaadt #include "engine.c" 88df930be7Sderaadt 89df930be7Sderaadt /* now undo things */ 90df930be7Sderaadt #undef states 91df930be7Sderaadt #undef CLEAR 92df930be7Sderaadt #undef SET0 93df930be7Sderaadt #undef SET1 94df930be7Sderaadt #undef ISSET 95df930be7Sderaadt #undef ASSIGN 96df930be7Sderaadt #undef EQ 97df930be7Sderaadt #undef STATEVARS 98df930be7Sderaadt #undef STATESETUP 99df930be7Sderaadt #undef STATETEARDOWN 100df930be7Sderaadt #undef SETUP 101df930be7Sderaadt #undef onestate 102df930be7Sderaadt #undef INIT 103df930be7Sderaadt #undef INC 104df930be7Sderaadt #undef ISSTATEIN 105df930be7Sderaadt #undef FWD 106df930be7Sderaadt #undef BACK 107df930be7Sderaadt #undef ISSETBACK 108df930be7Sderaadt #undef SNAMES 109df930be7Sderaadt 110df930be7Sderaadt /* macros for manipulating states, large version */ 111df930be7Sderaadt #define states char * 112df930be7Sderaadt #define CLEAR(v) memset(v, 0, m->g->nstates) 113df930be7Sderaadt #define SET0(v, n) ((v)[n] = 0) 114df930be7Sderaadt #define SET1(v, n) ((v)[n] = 1) 115df930be7Sderaadt #define ISSET(v, n) ((v)[n]) 116df930be7Sderaadt #define ASSIGN(d, s) memcpy(d, s, m->g->nstates) 117df930be7Sderaadt #define EQ(a, b) (memcmp(a, b, m->g->nstates) == 0) 118442a6afdSmillert #define STATEVARS long vn; char *space 119df930be7Sderaadt #define STATESETUP(m, nv) { (m)->space = malloc((nv)*(m)->g->nstates); \ 120df930be7Sderaadt if ((m)->space == NULL) return(REG_ESPACE); \ 121df930be7Sderaadt (m)->vn = 0; } 122df930be7Sderaadt #define STATETEARDOWN(m) { free((m)->space); } 123df930be7Sderaadt #define SETUP(v) ((v) = &m->space[m->vn++ * m->g->nstates]) 124442a6afdSmillert #define onestate long 125df930be7Sderaadt #define INIT(o, n) ((o) = (n)) 126df930be7Sderaadt #define INC(o) ((o)++) 127df930be7Sderaadt #define ISSTATEIN(v, o) ((v)[o]) 128df930be7Sderaadt /* some abbreviations; note that some of these know variable names! */ 129df930be7Sderaadt /* do "if I'm here, I can also be there" etc without branches */ 130df930be7Sderaadt #define FWD(dst, src, n) ((dst)[here+(n)] |= (src)[here]) 131df930be7Sderaadt #define BACK(dst, src, n) ((dst)[here-(n)] |= (src)[here]) 132df930be7Sderaadt #define ISSETBACK(v, n) ((v)[here - (n)]) 133df930be7Sderaadt /* function names */ 134df930be7Sderaadt #define LNAMES /* flag */ 135df930be7Sderaadt 136df930be7Sderaadt #include "engine.c" 137df930be7Sderaadt 138df930be7Sderaadt /* 139df930be7Sderaadt - regexec - interface for matching 140df930be7Sderaadt = extern int regexec(const regex_t *, const char *, size_t, \ 141df930be7Sderaadt = regmatch_t [], int); 142df930be7Sderaadt = #define REG_NOTBOL 00001 143df930be7Sderaadt = #define REG_NOTEOL 00002 144df930be7Sderaadt = #define REG_STARTEND 00004 145df930be7Sderaadt = #define REG_TRACE 00400 // tracing of execution 146df930be7Sderaadt = #define REG_LARGE 01000 // force large representation 147df930be7Sderaadt = #define REG_BACKR 02000 // force use of backref code 148df930be7Sderaadt * 149df930be7Sderaadt * We put this here so we can exploit knowledge of the state representation 150df930be7Sderaadt * when choosing which matcher to call. Also, by this point the matchers 151df930be7Sderaadt * have been prototyped. 152df930be7Sderaadt */ 153df930be7Sderaadt int /* 0 success, REG_NOMATCH failure */ 154*3d7c72a1Sotto regexec(const regex_t *preg, const char *string, size_t nmatch, 155*3d7c72a1Sotto regmatch_t pmatch[], int eflags) 156df930be7Sderaadt { 157*3d7c72a1Sotto struct re_guts *g = preg->re_g; 158df930be7Sderaadt #ifdef REDEBUG 159df930be7Sderaadt # define GOODFLAGS(f) (f) 160df930be7Sderaadt #else 161df930be7Sderaadt # define GOODFLAGS(f) ((f)&(REG_NOTBOL|REG_NOTEOL|REG_STARTEND)) 162df930be7Sderaadt #endif 163df930be7Sderaadt 164df930be7Sderaadt if (preg->re_magic != MAGIC1 || g->magic != MAGIC2) 165df930be7Sderaadt return(REG_BADPAT); 166df930be7Sderaadt assert(!(g->iflags&BAD)); 167df930be7Sderaadt if (g->iflags&BAD) /* backstop for no-debug case */ 168df930be7Sderaadt return(REG_BADPAT); 169df930be7Sderaadt eflags = GOODFLAGS(eflags); 170df930be7Sderaadt 171df930be7Sderaadt if (g->nstates <= CHAR_BIT*sizeof(states1) && !(eflags®_LARGE)) 172df930be7Sderaadt return(smatcher(g, (char *)string, nmatch, pmatch, eflags)); 173df930be7Sderaadt else 174df930be7Sderaadt return(lmatcher(g, (char *)string, nmatch, pmatch, eflags)); 175df930be7Sderaadt } 176