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