|
|
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * The contents of this file constitute Original Code as defined in and
7: * are subject to the Apple Public Source License Version 1.1 (the
8: * "License"). You may not use this file except in compliance with the
9: * License. Please obtain a copy of the License at
10: * http://www.apple.com/publicsource and read it before using this file.
11: *
12: * This Original Code and all software distributed under the License are
13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17: * License for the specific language governing rights and limitations
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /*-
23: * Copyright (c) 1992 Henry Spencer.
24: * Copyright (c) 1992, 1993
25: * The Regents of the University of California. All rights reserved.
26: *
27: * This code is derived from software contributed to Berkeley by
28: * Henry Spencer of the University of Toronto.
29: *
30: * Redistribution and use in source and binary forms, with or without
31: * modification, are permitted provided that the following conditions
32: * are met:
33: * 1. Redistributions of source code must retain the above copyright
34: * notice, this list of conditions and the following disclaimer.
35: * 2. Redistributions in binary form must reproduce the above copyright
36: * notice, this list of conditions and the following disclaimer in the
37: * documentation and/or other materials provided with the distribution.
38: * 3. All advertising materials mentioning features or use of this software
39: * must display the following acknowledgement:
40: * This product includes software developed by the University of
41: * California, Berkeley and its contributors.
42: * 4. Neither the name of the University nor the names of its contributors
43: * may be used to endorse or promote products derived from this software
44: * without specific prior written permission.
45: *
46: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
47: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
48: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
49: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
50: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
51: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
52: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
53: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
54: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
55: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
56: * SUCH DAMAGE.
57: *
58: * @(#)regex.h 8.2 (Berkeley) 1/3/94
59: */
60:
61: #ifndef _REGEX_H_
62: #define _REGEX_H_
63:
64: #include <sys/cdefs.h>
65:
66: /* types */
67: typedef off_t regoff_t;
68:
69: typedef struct {
70: int re_magic;
71: size_t re_nsub; /* number of parenthesized subexpressions */
72: __const char *re_endp; /* end pointer for REG_PEND */
73: struct re_guts *re_g; /* none of your business :-) */
74: } regex_t;
75:
76: typedef struct {
77: regoff_t rm_so; /* start of match */
78: regoff_t rm_eo; /* end of match */
79: } regmatch_t;
80:
81: /* regcomp() flags */
82: #define REG_BASIC 0000
83: #define REG_EXTENDED 0001
84: #define REG_ICASE 0002
85: #define REG_NOSUB 0004
86: #define REG_NEWLINE 0010
87: #define REG_NOSPEC 0020
88: #define REG_PEND 0040
89: #define REG_DUMP 0200
90:
91: /* regerror() flags */
92: #define REG_NOMATCH 1
93: #define REG_BADPAT 2
94: #define REG_ECOLLATE 3
95: #define REG_ECTYPE 4
96: #define REG_EESCAPE 5
97: #define REG_ESUBREG 6
98: #define REG_EBRACK 7
99: #define REG_EPAREN 8
100: #define REG_EBRACE 9
101: #define REG_BADBR 10
102: #define REG_ERANGE 11
103: #define REG_ESPACE 12
104: #define REG_BADRPT 13
105: #define REG_EMPTY 14
106: #define REG_ASSERT 15
107: #define REG_INVARG 16
108: #define REG_ATOI 255 /* convert name to number (!) */
109: #define REG_ITOA 0400 /* convert number to name (!) */
110:
111: /* regexec() flags */
112: #define REG_NOTBOL 00001
113: #define REG_NOTEOL 00002
114: #define REG_STARTEND 00004
115: #define REG_TRACE 00400 /* tracing of execution */
116: #define REG_LARGE 01000 /* force large representation */
117: #define REG_BACKR 02000 /* force use of backref code */
118:
119: __BEGIN_DECLS
120: int regcomp __P((regex_t *, const char *, int));
121: size_t regerror __P((int, const regex_t *, char *, size_t));
122: int regexec __P((const regex_t *,
123: const char *, size_t, regmatch_t [], int));
124: void regfree __P((regex_t *));
125: __END_DECLS
126:
127: #endif /* !_REGEX_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.