Commit | Line | Data |
---|---|---|
864a4494 KB |
1 | /*- |
2 | * Copyright (c) 1992 Henry Spencer. | |
a586e915 KB |
3 | * Copyright (c) 1992, 1993 |
4 | * The Regents of the University of California. All rights reserved. | |
864a4494 KB |
5 | * |
6 | * This code is derived from software contributed to Berkeley by | |
7 | * Henry Spencer of the University of Toronto. | |
8 | * | |
ad787160 C |
9 | * Redistribution and use in source and binary forms, with or without |
10 | * modification, are permitted provided that the following conditions | |
11 | * are met: | |
12 | * 1. Redistributions of source code must retain the above copyright | |
13 | * notice, this list of conditions and the following disclaimer. | |
14 | * 2. Redistributions in binary form must reproduce the above copyright | |
15 | * notice, this list of conditions and the following disclaimer in the | |
16 | * documentation and/or other materials provided with the distribution. | |
17 | * 3. All advertising materials mentioning features or use of this software | |
18 | * must display the following acknowledgement: | |
19 | * This product includes software developed by the University of | |
20 | * California, Berkeley and its contributors. | |
21 | * 4. Neither the name of the University nor the names of its contributors | |
22 | * may be used to endorse or promote products derived from this software | |
23 | * without specific prior written permission. | |
864a4494 | 24 | * |
ad787160 C |
25 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
26 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
27 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
28 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
29 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
30 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
31 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
32 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
33 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
34 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
35 | * SUCH DAMAGE. | |
36 | * | |
37 | * @(#)regerror.c 8.1 (Berkeley) 6/4/93 | |
864a4494 KB |
38 | */ |
39 | ||
40 | #if defined(LIBC_SCCS) && !defined(lint) | |
ad787160 | 41 | static char sccsid[] = "@(#)regerror.c 8.1 (Berkeley) 6/4/93"; |
864a4494 KB |
42 | #endif /* LIBC_SCCS and not lint */ |
43 | ||
44 | #include <sys/types.h> | |
864a4494 KB |
45 | #include <stdio.h> |
46 | #include <string.h> | |
47 | #include <ctype.h> | |
48 | #include <limits.h> | |
49 | #include <stdlib.h> | |
864a4494 KB |
50 | #include <regex.h> |
51 | ||
52 | #include "utils.h" | |
53 | ||
6175ca7c KB |
54 | static char *regatoi __P((const regex_t *, char *)); |
55 | ||
56 | /* | |
57 | = #define REG_NOMATCH 1 | |
58 | = #define REG_BADPAT 2 | |
59 | = #define REG_ECOLLATE 3 | |
60 | = #define REG_ECTYPE 4 | |
61 | = #define REG_EESCAPE 5 | |
62 | = #define REG_ESUBREG 6 | |
63 | = #define REG_EBRACK 7 | |
64 | = #define REG_EPAREN 8 | |
65 | = #define REG_EBRACE 9 | |
66 | = #define REG_BADBR 10 | |
67 | = #define REG_ERANGE 11 | |
68 | = #define REG_ESPACE 12 | |
69 | = #define REG_BADRPT 13 | |
70 | = #define REG_EMPTY 14 | |
71 | = #define REG_ASSERT 15 | |
72 | = #define REG_INVARG 16 | |
73 | = #define REG_ATOI 255 // convert name to number (!) | |
74 | = #define REG_ITOA 0400 // convert number to name (!) | |
75 | */ | |
864a4494 KB |
76 | static struct rerr { |
77 | int code; | |
78 | char *name; | |
79 | char *explain; | |
80 | } rerrs[] = { | |
6175ca7c KB |
81 | REG_NOMATCH, "REG_NOMATCH", "regexec() failed to match", |
82 | REG_BADPAT, "REG_BADPAT", "invalid regular expression", | |
83 | REG_ECOLLATE, "REG_ECOLLATE", "invalid collating element", | |
84 | REG_ECTYPE, "REG_ECTYPE", "invalid character class", | |
85 | REG_EESCAPE, "REG_EESCAPE", "trailing backslash (\\)", | |
86 | REG_ESUBREG, "REG_ESUBREG", "invalid backreference number", | |
87 | REG_EBRACK, "REG_EBRACK", "brackets ([ ]) not balanced", | |
88 | REG_EPAREN, "REG_EPAREN", "parentheses not balanced", | |
89 | REG_EBRACE, "REG_EBRACE", "braces not balanced", | |
90 | REG_BADBR, "REG_BADBR", "invalid repetition count(s)", | |
91 | REG_ERANGE, "REG_ERANGE", "invalid character range", | |
92 | REG_ESPACE, "REG_ESPACE", "out of memory", | |
93 | REG_BADRPT, "REG_BADRPT", "repetition-operator operand invalid", | |
94 | REG_EMPTY, "REG_EMPTY", "empty (sub)expression", | |
95 | REG_ASSERT, "REG_ASSERT", "\"can't happen\" -- you found a bug", | |
96 | REG_INVARG, "REG_INVARG", "invalid argument to regex routine", | |
864a4494 KB |
97 | 0, "", "*** unknown regexp error code ***", |
98 | }; | |
99 | ||
100 | /* | |
101 | - regerror - the interface to error numbers | |
6175ca7c KB |
102 | = extern size_t regerror(int errcode, const regex_t *preg, char *errbuf, \ |
103 | = size_t errbuf_size); | |
864a4494 KB |
104 | */ |
105 | /* ARGSUSED */ | |
106 | size_t | |
107 | regerror(errcode, preg, errbuf, errbuf_size) | |
108 | int errcode; | |
109 | const regex_t *preg; | |
110 | char *errbuf; | |
111 | size_t errbuf_size; | |
112 | { | |
113 | register struct rerr *r; | |
114 | register size_t len; | |
6175ca7c KB |
115 | register int target = errcode &~ REG_ITOA; |
116 | register char *s; | |
117 | char convbuf[50]; | |
864a4494 | 118 | |
6175ca7c KB |
119 | if (errcode == REG_ATOI) |
120 | s = regatoi(preg, convbuf); | |
121 | else { | |
122 | for (r = rerrs; r->code != 0; r++) | |
123 | if (r->code == target) | |
124 | break; | |
125 | ||
126 | if (errcode®_ITOA) { | |
127 | if (r->code != 0) | |
128 | (void) strcpy(convbuf, r->name); | |
129 | else | |
130 | sprintf(convbuf, "REG_0x%x", target); | |
131 | assert(strlen(convbuf) < sizeof(convbuf)); | |
132 | s = convbuf; | |
133 | } else | |
134 | s = r->explain; | |
135 | } | |
864a4494 | 136 | |
6175ca7c | 137 | len = strlen(s) + 1; |
864a4494 KB |
138 | if (errbuf_size > 0) { |
139 | if (errbuf_size > len) | |
6175ca7c | 140 | (void) strcpy(errbuf, s); |
864a4494 | 141 | else { |
6175ca7c | 142 | (void) strncpy(errbuf, s, errbuf_size-1); |
864a4494 KB |
143 | errbuf[errbuf_size-1] = '\0'; |
144 | } | |
145 | } | |
146 | ||
147 | return(len); | |
148 | } | |
149 | ||
864a4494 | 150 | /* |
6175ca7c KB |
151 | - regatoi - internal routine to implement REG_ATOI |
152 | = static char *regatoi(const regex_t *preg, char *localbuf); | |
864a4494 | 153 | */ |
6175ca7c KB |
154 | static char * |
155 | regatoi(preg, localbuf) | |
156 | const regex_t *preg; | |
157 | char *localbuf; | |
864a4494 KB |
158 | { |
159 | register struct rerr *r; | |
6175ca7c KB |
160 | register size_t siz; |
161 | register char *p; | |
864a4494 KB |
162 | |
163 | for (r = rerrs; r->code != 0; r++) | |
6175ca7c KB |
164 | if (strcmp(r->name, preg->re_endp) == 0) |
165 | break; | |
166 | if (r->code == 0) | |
167 | return("0"); | |
864a4494 | 168 | |
6175ca7c KB |
169 | sprintf(localbuf, "%d", r->code); |
170 | return(localbuf); | |
864a4494 | 171 | } |