1 /* $NetBSD: regerror.c,v 1.6 1997/07/13 20:05:37 christos 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.6 1997/07/13 20:05:37 christos Exp $"); 48 #endif 49 #endif /* LIBC_SCCS and not lint */ 50 51 #include <sys/types.h> 52 #include <stdio.h> 53 #include <string.h> 54 #include <ctype.h> 55 #include <limits.h> 56 #include <stdlib.h> 57 #include <regex.h> 58 59 #include "utils.h" 60 61 /* ========= begin header generated by ./mkh ========= */ 62 #ifdef __cplusplus 63 extern "C" { 64 #endif 65 66 /* === regerror.c === */ 67 static char *regatoi __P((const regex_t *preg, char *localbuf, int buflen)); 68 69 #ifdef __cplusplus 70 } 71 #endif 72 /* ========= end header generated by ./mkh ========= */ 73 /* 74 = #define REG_NOMATCH 1 75 = #define REG_BADPAT 2 76 = #define REG_ECOLLATE 3 77 = #define REG_ECTYPE 4 78 = #define REG_EESCAPE 5 79 = #define REG_ESUBREG 6 80 = #define REG_EBRACK 7 81 = #define REG_EPAREN 8 82 = #define REG_EBRACE 9 83 = #define REG_BADBR 10 84 = #define REG_ERANGE 11 85 = #define REG_ESPACE 12 86 = #define REG_BADRPT 13 87 = #define REG_EMPTY 14 88 = #define REG_ASSERT 15 89 = #define REG_INVARG 16 90 = #define REG_ATOI 255 // convert name to number (!) 91 = #define REG_ITOA 0400 // convert number to name (!) 92 */ 93 static struct rerr { 94 int code; 95 char *name; 96 char *explain; 97 } rerrs[] = { 98 { REG_NOMATCH, "REG_NOMATCH", "regexec() failed to match" }, 99 { REG_BADPAT, "REG_BADPAT", "invalid regular expression" }, 100 { REG_ECOLLATE, "REG_ECOLLATE", "invalid collating element" }, 101 { REG_ECTYPE, "REG_ECTYPE", "invalid character class" }, 102 { REG_EESCAPE, "REG_EESCAPE", "trailing backslash (\\)" }, 103 { REG_ESUBREG, "REG_ESUBREG", "invalid backreference number" }, 104 { REG_EBRACK, "REG_EBRACK", "brackets ([ ]) not balanced" }, 105 { REG_EPAREN, "REG_EPAREN", "parentheses not balanced" }, 106 { REG_EBRACE, "REG_EBRACE", "braces not balanced" }, 107 { REG_BADBR, "REG_BADBR", "invalid repetition count(s)" }, 108 { REG_ERANGE, "REG_ERANGE", "invalid character range" }, 109 { REG_ESPACE, "REG_ESPACE", "out of memory" }, 110 { REG_BADRPT, "REG_BADRPT", "repetition-operator operand invalid" }, 111 { REG_EMPTY, "REG_EMPTY", "empty (sub)expression" }, 112 { REG_ASSERT, "REG_ASSERT", "\"can't happen\" -- you found a bug" }, 113 { REG_INVARG, "REG_INVARG", "invalid argument to regex routine" }, 114 { 0, "", "*** unknown regexp error code ***" } 115 }; 116 117 /* 118 * regerror - the interface to error numbers 119 * extern size_t regerror(int, const regex_t *, char *, size_t); 120 */ 121 /* ARGSUSED */ 122 size_t 123 regerror(errcode, preg, errbuf, errbuf_size) 124 int errcode; 125 const regex_t *preg; 126 char *errbuf; 127 size_t errbuf_size; 128 { 129 register struct rerr *r; 130 register size_t len; 131 register int target = errcode &~ REG_ITOA; 132 register char *s; 133 char convbuf[50]; 134 135 if (errcode == REG_ATOI) 136 s = regatoi(preg, convbuf, sizeof convbuf); 137 else { 138 for (r = rerrs; r->code != 0; r++) 139 if (r->code == target) 140 break; 141 142 if (errcode®_ITOA) { 143 if (r->code != 0) 144 (void)strncpy(convbuf, r->name, sizeof convbuf); 145 else 146 (void)snprintf(convbuf, sizeof convbuf, 147 "REG_0x%x", target); 148 s = convbuf; 149 } else 150 s = r->explain; 151 } 152 153 len = strlen(s) + 1; 154 if (errbuf_size > 0) { 155 (void)strncpy(errbuf, s, errbuf_size - 1); 156 errbuf[errbuf_size-1] = '\0'; 157 } 158 159 return(len); 160 } 161 162 /* 163 * regatoi - internal routine to implement REG_ATOI 164 * static char *regatoi(const regex_t *preg, char *localbuf, int buflen); 165 */ 166 static char * 167 regatoi(preg, localbuf, buflen) 168 const regex_t *preg; 169 char *localbuf; 170 int buflen; 171 { 172 register struct rerr *r; 173 174 for (r = rerrs; r->code != 0; r++) 175 if (strcmp(r->name, preg->re_endp) == 0) 176 break; 177 if (r->code == 0) 178 return("0"); 179 180 (void)snprintf(localbuf, buflen, "%d", r->code); 181 return(localbuf); 182 } 183