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