]>
Commit | Line | Data |
---|---|---|
d683fe11 | 1 | /* Test for regs allocation in re_search and re_match. |
688903eb | 2 | Copyright (C) 2002-2018 Free Software Foundation, Inc. |
d683fe11 UD |
3 | This file is part of the GNU C Library. |
4 | Contributed by Stepan Kasal <kasal@math.cas.cz>, 2002. | |
5 | ||
6 | The GNU C Library is free software; you can redistribute it and/or | |
7 | modify it under the terms of the GNU Lesser General Public | |
8 | License as published by the Free Software Foundation; either | |
9 | version 2.1 of the License, or (at your option) any later version. | |
10 | ||
11 | The GNU C Library is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 | Lesser General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU Lesser General Public | |
59ba27a6 PE |
17 | License along with the GNU C Library; if not, see |
18 | <http://www.gnu.org/licenses/>. */ | |
d683fe11 UD |
19 | |
20 | #include <locale.h> | |
21 | #include <stdio.h> | |
22 | #include <stdlib.h> | |
23 | #include <string.h> | |
24 | #include <sys/types.h> | |
25 | #include <regex.h> | |
26 | ||
27 | ||
28 | int | |
29 | main (void) | |
30 | { | |
31 | struct re_pattern_buffer regex; | |
32 | struct re_registers regs; | |
33 | const char *s; | |
34 | int match, n; | |
35 | int result = 0; | |
36 | ||
37 | memset (®ex, '\0', sizeof (regex)); | |
38 | regs.start = regs.end = NULL; | |
39 | regs.num_regs = 0; | |
40 | s = re_compile_pattern ("a", 1, ®ex); | |
41 | if (s != NULL) | |
42 | { | |
43 | puts ("failed to compile pattern \"a\""); | |
44 | result = 1; | |
45 | } | |
46 | else | |
47 | { | |
48 | match = re_search (®ex, "baobab", 6, 0, 6, ®s); | |
49 | n = 1; | |
50 | if (match != 1) | |
51 | { | |
52 | printf ("re_search returned %d, expected 1\n", match); | |
53 | result = 1; | |
54 | } | |
55 | else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1) | |
56 | { | |
57 | puts ("re_search failed to fill the -1 sentinel"); | |
58 | result = 1; | |
59 | } | |
60 | } | |
61 | ||
62 | free (regex.buffer); | |
63 | memset (®ex, '\0', sizeof (regex)); | |
64 | ||
65 | s = re_compile_pattern ("\\(\\(\\(a\\)\\)\\)", 13, ®ex); | |
66 | if (s != NULL) | |
67 | { | |
68 | puts ("failed to compile pattern /\\(\\(\\(a\\)\\)\\)/"); | |
69 | result = 1; | |
70 | } | |
71 | else | |
72 | { | |
73 | match = re_match (®ex, "apl", 3, 0, ®s); | |
74 | n = 4; | |
75 | if (match != 1) | |
76 | { | |
77 | printf ("re_match returned %d, expected 1\n", match); | |
78 | result = 1; | |
79 | } | |
80 | else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1) | |
81 | { | |
82 | puts ("re_match failed to fill the -1 sentinel"); | |
83 | result = 1; | |
84 | } | |
85 | } | |
86 | ||
87 | if (result == 0) | |
88 | puts (" -> OK"); | |
89 | ||
90 | return result; | |
91 | } |