blob: 9892cfcf2cb4b0d0048ff497c58fa6a79356d9e7 (
plain)
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
|
/***********************************************************************
* *
* This software is part of the ast package *
* Copyright (c) 1985-2009 AT&T Intellectual Property *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Intellectual Property *
* *
* A copy of the License is available at *
* http://www.opensource.org/licenses/cpl1.0.txt *
* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
* *
* Information and Software Systems Research *
* AT&T Research *
* Florham Park NJ *
* *
* Glenn Fowler <gsf@research.att.com> *
* David Korn <dgk@research.att.com> *
* Phong Vo <kpv@research.att.com> *
* *
***********************************************************************/
#pragma prototyped
/*
* re_comp implementation
*/
#include <ast.h>
#include <re_comp.h>
#include <regex.h>
#undef error
#undef valid
static struct
{
char error[64];
regex_t re;
int valid;
} state;
char*
re_comp(const char* pattern)
{
register int r;
if (!pattern || !*pattern)
{
if (state.valid)
return 0;
r = REG_BADPAT;
}
else
{
if (state.valid)
{
state.valid = 0;
regfree(&state.re);
}
if (!(r = regcomp(&state.re, pattern, REG_LENIENT|REG_NOSUB|REG_NULL)))
{
state.valid = 1;
return 0;
}
}
regerror(r, &state.re, state.error, sizeof(state.error));
return state.error;
}
int
re_exec(const char* subject)
{
if (state.valid && subject)
switch (regexec(&state.re, subject, 0, NiL, 0))
{
case 0:
return 1;
case REG_NOMATCH:
return 0;
}
return -1;
}
|
