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