1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
/*
* Copyright 2011 Nexenta Systems, Inc. All rights reserved.
* Copyright (c) 1992, 1993, 1994 Henry Spencer.
* Copyright (c) 1992, 1993, 1994
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Henry Spencer.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "lint.h"
#include "file64.h"
#include <sys/types.h>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <stdlib.h>
#include <regex.h>
#include "utils.h"
#include "../gen/_libc_gettext.h"
static const char *regatoi(const regex_t *preg, char *localbuf);
#define RERR(x, msg) { x, #x, msg }
static struct rerr {
int code;
const char *name;
const char *explain;
} rerrs[] = {
RERR(REG_NOMATCH, "regexec() failed to match"),
RERR(REG_BADPAT, "invalid regular expression"),
RERR(REG_ECOLLATE, "invalid collating element"),
RERR(REG_ECTYPE, "invalid character class"),
RERR(REG_EESCAPE, "trailing backslash (\\)"),
RERR(REG_ESUBREG, "invalid backreference number"),
RERR(REG_EBRACK, "brackets ([ ]) not balanced"),
RERR(REG_EPAREN, "parentheses not balanced"),
RERR(REG_EBRACE, "braces not balanced"),
RERR(REG_BADBR, "invalid repetition count(s)"),
RERR(REG_ERANGE, "invalid character range"),
RERR(REG_ESPACE, "out of memory"),
RERR(REG_BADRPT, "repetition-operator operand invalid"),
#ifdef REG_EMPTY
RERR(REG_EMPTY, "empty (sub)expression"),
#endif
RERR(REG_EFATAL, "fatal internal error"),
#ifdef REG_INVARG
RERR(REG_INVARG, "invalid argument to regex routine"),
#endif
RERR(REG_ECHAR, "illegal byte sequence"),
RERR(REG_ENOSYS, "function not supported"),
RERR(REG_STACK, "backtrack stack overflow"),
RERR(REG_ENSUB, "more than 9 \\( \\) pairs"),
RERR(REG_ENEWLINE, "\n found before end of pattern"),
{0, "", "*** unknown regexp error code ***"}
};
/*
* regerror - the interface to error numbers
*/
/* ARGSUSED */
size_t
regerror(int errcode, const regex_t *_RESTRICT_KYWD preg,
char *_RESTRICT_KYWD errbuf, size_t errbuf_size)
{
struct rerr *r;
size_t len;
int target = errcode &~ REG_ITOA;
const char *s;
char convbuf[50];
if (errcode == REG_ATOI) {
s = regatoi(preg, convbuf);
} else {
for (r = rerrs; r->code != 0; r++) {
if (r->code == target)
break;
}
if (errcode®_ITOA) {
if (r->code != 0)
(void) strcpy(convbuf, r->name);
else
(void) sprintf(convbuf, "REG_0x%x", target);
assert(strlen(convbuf) < sizeof (convbuf));
s = convbuf;
} else {
s = _libc_gettext(r->explain);
}
}
len = strlen(s) + 1;
if (errbuf_size > 0) {
if (errbuf_size > len) {
(void) strcpy(errbuf, s);
} else {
(void) strncpy(errbuf, s, errbuf_size-1);
errbuf[errbuf_size-1] = '\0';
}
}
return (len);
}
/*
* regatoi - internal routine to implement REG_ATOI
*/
static const char *
regatoi(const regex_t *preg, char *localbuf)
{
struct rerr *r;
for (r = rerrs; r->code != 0; r++) {
if (strcmp(r->name, preg->re_endp) == 0)
break;
}
if (r->code == 0)
return ("0");
(void) sprintf(localbuf, "%d", r->code);
return (localbuf);
}
|
