1/* $OpenBSD: regex.h,v 1.7 2012/12/05 23:19:57 deraadt Exp $ */ 2/* $NetBSD: regex.h,v 1.4.6.1 1996/06/10 18:57:07 explorer Exp $ */ 3 4/*- 5 * Copyright (c) 1992 Henry Spencer. 6 * Copyright (c) 1992, 1993 7 * The Regents of the University of California. All rights reserved. 8 * 9 * This code is derived from software contributed to Berkeley by 10 * Henry Spencer of the University of Toronto. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)regex.h 8.1 (Berkeley) 6/2/93 37 */ 38 39#ifndef _REGEX_H_ 40#define _REGEX_H_ 41 42#include <sys/types.h> 43 44/* types */ 45typedef off_t regoff_t; 46 47typedef struct { 48 int re_magic; 49 size_t re_nsub; /* number of parenthesized subexpressions */ 50 const char *re_endp; /* end pointer for REG_PEND */ 51 struct re_guts *re_g; /* none of your business :-) */ 52} regex_t; 53 54typedef struct { 55 regoff_t rm_so; /* start of match */ 56 regoff_t rm_eo; /* end of match */ 57} regmatch_t; 58 59/* regcomp() flags */ 60#define REG_BASIC 0000 61#define REG_EXTENDED 0001 62#define REG_ICASE 0002 63#define REG_NOSUB 0004 64#define REG_NEWLINE 0010 65#define REG_NOSPEC 0020 66#define REG_PEND 0040 67#define REG_DUMP 0200 68 69/* regerror() flags */ 70#define REG_NOMATCH 1 71#define REG_BADPAT 2 72#define REG_ECOLLATE 3 73#define REG_ECTYPE 4 74#define REG_EESCAPE 5 75#define REG_ESUBREG 6 76#define REG_EBRACK 7 77#define REG_EPAREN 8 78#define REG_EBRACE 9 79#define REG_BADBR 10 80#define REG_ERANGE 11 81#define REG_ESPACE 12 82#define REG_BADRPT 13 83#define REG_EMPTY 14 84#define REG_ASSERT 15 85#define REG_INVARG 16 86#define REG_ATOI 255 /* convert name to number (!) */ 87#define REG_ITOA 0400 /* convert number to name (!) */ 88 89/* regexec() flags */ 90#define REG_NOTBOL 00001 91#define REG_NOTEOL 00002 92#define REG_STARTEND 00004 93#define REG_TRACE 00400 /* tracing of execution */ 94#define REG_LARGE 01000 /* force large representation */ 95#define REG_BACKR 02000 /* force use of backref code */ 96 97__BEGIN_DECLS 98int regcomp(regex_t *, const char *, int); 99size_t regerror(int, const regex_t *, char *, size_t); 100int regexec(const regex_t *, const char *, size_t, regmatch_t [], int); 101void regfree(regex_t *); 102__END_DECLS 103 104#endif /* !_REGEX_H_ */ 105