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
|
/* Test for re_match with non-zero start.
Copyright (C) 2002-2022 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<https://www.gnu.org/licenses/>. */
#include <locale.h>
#include <stdio.h>
#include <string.h>
#include <regex.h>
int
main (void)
{
struct re_pattern_buffer regex;
struct re_registers regs;
const char *s;
int match;
int result = 0;
regs.num_regs = 1;
memset (®ex, '\0', sizeof (regex));
s = re_compile_pattern ("[abc]*d", 7, ®ex);
if (s != NULL)
{
puts ("re_compile_pattern return non-NULL value");
result = 1;
}
else
{
match = re_match (®ex, "foacabdxy", 9, 2, ®s);
if (match != 5)
{
printf ("re_match returned %d, expected 5\n", match);
result = 1;
}
else if (regs.start[0] != 2 || regs.end[0] != 7)
{
printf ("re_match returned %d..%d, expected 2..7\n",
regs.start[0], regs.end[0]);
result = 1;
}
puts (" -> OK");
}
return result;
}
|
