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