The Machine Perception Toolbox

[Introduction]- [News]- [Download]- [Screenshots]- [Manual (pdf)]- [Forums]- [API Reference]- [Repository ]

 

regexp.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	regexp
Defines
#define	MAGIC   0234
#define	NSUBEXP   10
Typedefs
typedef regexp	regexp
Functions
regexp *	regcomp (char *exp)
void	regerror (char *s)
int	regexec (regexp *prog, char *string)

---

Define Documentation

#define MAGIC   0234

Definition at line 29 of file regexp.h. Referenced by regcomp().

#define NSUBEXP   10

Definition at line 10 of file regexp.h.

---

Typedef Documentation

typedef struct regexp regexp

---

Function Documentation

regexp* regcomp (  char *  exp  )

Definition at line 213 of file regexp.c. References EXACTLY, FAIL, MAGIC, OP, OPERAND, regexp::program, r, reg(), regexp::reganch, regc(), regcode, regexp::regmlen, regexp::regmust, regnext(), regnpar, regparse, regsize, and regexp::regstart. Referenced by regex_compile(). { register regexp *r; register char *scan; register char *longest; register unsigned len; int flags; if (exp == NULL) FAIL("NULL argument"); /* First pass: determine size, legality. */ #ifdef notdef if (exp[0] == '.' && exp[1] == '*') exp += 2; /* aid grep */ #endif regparse = (char *)exp; regnpar = 1; regsize = 0L; regcode = &regdummy; regc(MAGIC); if (reg(0, &flags) == NULL) return(NULL); /* Small enough for pointer-storage convention? */ if (regsize >= 32767L) /* Probably could be 65535L. */ FAIL("regexp too big"); /* Allocate space. */ r = (regexp *)malloc(sizeof(regexp) + (unsigned)regsize); if (r == NULL) FAIL("out of space"); /* Second pass: emit code. */ regparse = (char *)exp; regnpar = 1; regcode = r->program; regc(MAGIC); if (reg(0, &flags) == NULL) return(NULL); /* Dig out information for optimizations. */ r->regstart = '\0'; /* Worst-case defaults. */ r->reganch = 0; r->regmust = NULL; r->regmlen = 0; scan = r->program+1; /* First BRANCH. */ if (OP(regnext(scan)) == END) { /* Only one top-level choice. */ scan = OPERAND(scan); /* Starting-point info. */ if (OP(scan) == EXACTLY) r->regstart = *OPERAND(scan); else if (OP(scan) == BOL) r->reganch++; /* * If there's something expensive in the r.e., find the * longest literal string that must appear and make it the * regmust. Resolve ties in favor of later strings, since * the regstart check works with the beginning of the r.e. * and avoiding duplication strengthens checking. Not a * strong reason, but sufficient in the absence of others. */ if (flags&SPSTART) { longest = NULL; len = 0; for (; scan != NULL; scan = regnext(scan)) if (OP(scan) == EXACTLY && strlen(OPERAND(scan)) >= len) { longest = OPERAND(scan); len = strlen(OPERAND(scan)); } r->regmust = longest; r->regmlen = len; } } return(r); }

Here is the call graph for this function:

void regerror (  char *  s  )

Definition at line 189 of file headers.c. References s. Referenced by regexec(), regmatch(), and regrepeat(). { printf( "re error %s\n", s ); }

int regexec (  regexp *  prog, char *  string )

Referenced by builtin_match(), builtin_subst(), headers1(), and macro_headers().

---