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