2
* This code is derived from OpenBSD's libc/regex, original license follows:
4
* Copyright (c) 1992 Henry Spencer.
5
* Copyright (c) 1992, 1993
6
* The Regents of the University of California. All rights reserved.
8
* This code is derived from software contributed to Berkeley by
9
* Henry Spencer of the University of Toronto.
11
* Redistribution and use in source and binary forms, with or without
12
* modification, are permitted provided that the following conditions
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. Neither the name of the University nor the names of its contributors
20
* may be used to endorse or promote products derived from this software
21
* without specific prior written permission.
23
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35
* @(#)regex.h 8.1 (Berkeley) 6/2/93
41
#include <sys/types.h>
42
typedef off_t llvm_regoff_t;
44
llvm_regoff_t rm_so; /* start of match */
45
llvm_regoff_t rm_eo; /* end of match */
48
typedef struct llvm_regex {
50
size_t re_nsub; /* number of parenthesized subexpressions */
51
const char *re_endp; /* end pointer for REG_PEND */
52
struct re_guts *re_g; /* none of your business :-) */
55
/* llvm_regcomp() flags */
56
#define REG_BASIC 0000
57
#define REG_EXTENDED 0001
58
#define REG_ICASE 0002
59
#define REG_NOSUB 0004
60
#define REG_NEWLINE 0010
61
#define REG_NOSPEC 0020
65
/* llvm_regerror() flags */
68
#define REG_ECOLLATE 3
82
#define REG_ATOI 255 /* convert name to number (!) */
83
#define REG_ITOA 0400 /* convert number to name (!) */
85
/* llvm_regexec() flags */
86
#define REG_NOTBOL 00001
87
#define REG_NOTEOL 00002
88
#define REG_STARTEND 00004
89
#define REG_TRACE 00400 /* tracing of execution */
90
#define REG_LARGE 01000 /* force large representation */
91
#define REG_BACKR 02000 /* force use of backref code */
97
int llvm_regcomp(llvm_regex_t *, const char *, int);
98
size_t llvm_regerror(int, const llvm_regex_t *, char *, size_t);
99
int llvm_regexec(const llvm_regex_t *, const char *, size_t,
100
llvm_regmatch_t [], int);
101
void llvm_regfree(llvm_regex_t *);
102
size_t llvm_strlcpy(char *dst, const char *src, size_t siz);
108
#endif /* !_REGEX_H_ */