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