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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
/*****************************************************************************\
* $Id:$
*****************************************************************************
* Copyright (C) 2004-2008 The Regents of the University of California.
* Produced at Lawrence Livermore National Laboratory (cf, DISCLAIMER).
* Written by Jim Garlick <garlick@llnl.gov>
* UCRL-CODE-2002-008.
*
* This file is part of PowerMan, a remote power management program.
* For details, see <http://www.llnl.gov/linux/powerman/>.
*
* PowerMan is free software; you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the License, or (at your option)
* any later version.
*
* PowerMan is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*
* You should have received a copy of the GNU General Public License along
* with PowerMan; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
\*****************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include "xtypes.h"
#include "xregex.h"
#include "xmalloc.h"
/* Return true if regex [r] matches exactly [p] in [s].
*/
static bool
_matchstr(char *r, char *s, char *p)
{
xregex_t re;
xregex_match_t rm;
int res;
char *tmp;
re = xregex_create();
rm = xregex_match_create(2);
xregex_compile(re, r, TRUE);
res = xregex_exec(re, s, rm);
if (res && p) {
tmp = xregex_match_strdup(rm);
if (strcmp(tmp, p) != 0)
res = FALSE;
xfree(tmp);
}
xregex_match_destroy(rm);
xregex_destroy(re);
return res;
}
/* Return true if regex [r] matches exactly [s] in [s].
*/
static bool
_matchstr_all(char *r, char *s)
{
return _matchstr(r, s, s);
}
/* Return true if regex [r] matches anything in [s].
*/
static bool
_match(char *r, char *s)
{
return _matchstr(r, s, NULL);
}
static void
_check_substr_match(void)
{
xregex_t re;
xregex_match_t rm;
char *s;
re = xregex_create();
rm = xregex_match_create(2);
xregex_compile(re, "foo([0-9]+)bar([0-9]+)", TRUE);
assert(xregex_exec(re, "xxxfoo1bar2", rm) == TRUE);
s = xregex_match_sub_strdup(rm, 0);
assert(s != NULL);
assert(strcmp(s, "foo1bar2") == 0);
xfree(s);
s = xregex_match_sub_strdup(rm, 1);
assert(s != NULL);
assert(strcmp(s, "1") == 0);
xfree(s);
s = xregex_match_sub_strdup(rm, 2);
assert(s != NULL);
assert(strcmp(s, "2") == 0);
xfree(s);
s = xregex_match_sub_strdup(rm, 3);
assert(s == NULL);
s = xregex_match_sub_strdup(rm, -1); /* powerman actually does this! */
assert(s == NULL);
s = xregex_match_strdup(rm);
assert(strcmp(s, "xxxfoo1bar2") == 0);
assert(xregex_match_strlen(rm) == strlen(s));
xfree(s);
xregex_match_recycle(rm);
assert(xregex_exec(re, "foobar2", rm) == FALSE);
s = xregex_match_sub_strdup(rm, 0);
assert(s == NULL);
s = xregex_match_sub_strdup(rm, 1);
assert(s == NULL);
xregex_match_recycle(rm);
assert(xregex_exec(re, "xxxfoo1bar2yyy", rm) == TRUE);
s = xregex_match_sub_strdup(rm, 0);
assert(s != NULL);
assert(strcmp(s, "foo1bar2") == 0);
xfree(s);
s = xregex_match_sub_strdup(rm, 1);
assert(s != NULL);
assert(strcmp(s, "1") == 0);
xfree(s);
s = xregex_match_sub_strdup(rm, 2);
assert(s != NULL);
assert(strcmp(s, "2") == 0);
xfree(s);
s = xregex_match_strdup(rm);
assert(strcmp(s, "xxxfoo1bar2") == 0);
assert(xregex_match_strlen(rm) == strlen(s));
xfree(s);
xregex_match_destroy(rm);
xregex_destroy(re);
}
int
main(int argc, char *argv[])
{
char *s;
err_init("tregex");
assert(_match("foo", "foo"));
assert(_match("foo", "fooxxx"));
assert(_match("foo", "xxxfoo"));
assert(!_match("foo", "bar"));
_check_substr_match();
/* verify that \\n and \\r are converted into \r and \r */
assert(!_match("foo\\r\\n", "foo\\r\\n"));
assert( _match("foo\\r\\n", "foo\r\n"));
/* check a really long string for a regex */
#define LONG_STR_LEN (64*1024*1024)
#define POS_MAGIC 42
#define POS_WONDERFUL 32*1024*1024
#define POS_COOKIE 63*1024*1024
s = xmalloc(LONG_STR_LEN);
memset(s, 'a', LONG_STR_LEN - 1);
memcpy(s + POS_MAGIC, "MAGIC", 5);
memcpy(s + POS_WONDERFUL, "WONDERFUL", 9);
memcpy(s + POS_COOKIE, "COOKIE", 6);
s[LONG_STR_LEN - 1] = '\0';
assert( _match("MAGIC", s));
assert( _match("WONDERFUL", s));
assert( _match("COOKIE", s));
assert(!_match("CHOCOLATE", s));
xfree(s);
/* end of line handling should be disabled since end of string
* (which normally matches) is non-deterministic in powerman.
* We should be explicitly matching end-of-line sentinels like
* \n in scripts.
*/
assert(!_match("foo$", "foo"));
assert(!_match("foo$", "foo\n"));
assert(!_match("foo\n", "foo"));
assert(!_match("foo\n", "bar\nfoo"));
assert( _match("foo\n", "barfoo\n"));
/* regex takes first match if there are > 1,
* but leading wildcard matches greedily
*/
assert(_matchstr("foo", "abfoocdfoo",
"abfoo"));
assert(_matchstr_all(".*foo", "abfoocdfoo"));
/* check that [:space:] character class works inside bracket
* expression
*/
assert(_matchstr_all("bar[0-9[:space:]]*foo", "bar 42 foo"));
/* debug apcpdu3 regex
*/
#define B3RX "([0-9])*[^\r\n]*(ON|OFF)\r\n"
assert(_matchstr_all(B3RX, " 2- Outlet 2 ON\r\n"));
assert(_matchstr_all(B3RX, " 9- ON\r\n"));
exit(0);
}
|
