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