| 1 | /* Test for regs allocation in re_search and re_match.
|
|---|
| 2 | Copyright (C) 2002 Free Software Foundation, Inc.
|
|---|
| 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
|
|---|
| 17 | License along with the GNU C Library; if not, write to the Free
|
|---|
| 18 | Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
|---|
| 19 | 02110-1301 USA. */
|
|---|
| 20 |
|
|---|
| 21 | #include <locale.h>
|
|---|
| 22 | #include <stdio.h>
|
|---|
| 23 | #include <stdlib.h>
|
|---|
| 24 | #include <string.h>
|
|---|
| 25 | #include <sys/types.h>
|
|---|
| 26 | #include <regex.h>
|
|---|
| 27 |
|
|---|
| 28 |
|
|---|
| 29 | int
|
|---|
| 30 | main (void)
|
|---|
| 31 | {
|
|---|
| 32 | struct re_pattern_buffer regex;
|
|---|
| 33 | struct re_registers regs;
|
|---|
| 34 | const char *s;
|
|---|
| 35 | int match, n;
|
|---|
| 36 | int result = 0;
|
|---|
| 37 |
|
|---|
| 38 | memset (®ex, '\0', sizeof (regex));
|
|---|
| 39 | regs.start = regs.end = NULL;
|
|---|
| 40 | regs.num_regs = 0;
|
|---|
| 41 | s = re_compile_pattern ("a", 1, ®ex);
|
|---|
| 42 | if (s != NULL)
|
|---|
| 43 | {
|
|---|
| 44 | puts ("failed to compile pattern \"a\"");
|
|---|
| 45 | result = 1;
|
|---|
| 46 | }
|
|---|
| 47 | else
|
|---|
| 48 | {
|
|---|
| 49 | match = re_search (®ex, "baobab", 6, 0, 6, ®s);
|
|---|
| 50 | n = 1;
|
|---|
| 51 | if (match != 1)
|
|---|
| 52 | {
|
|---|
| 53 | printf ("re_search returned %d, expected 1\n", match);
|
|---|
| 54 | result = 1;
|
|---|
| 55 | }
|
|---|
| 56 | else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1)
|
|---|
| 57 | {
|
|---|
| 58 | puts ("re_search failed to fill the -1 sentinel");
|
|---|
| 59 | result = 1;
|
|---|
| 60 | }
|
|---|
| 61 | }
|
|---|
| 62 |
|
|---|
| 63 | free (regex.buffer);
|
|---|
| 64 | memset (®ex, '\0', sizeof (regex));
|
|---|
| 65 |
|
|---|
| 66 | s = re_compile_pattern ("\\(\\(\\(a\\)\\)\\)", 13, ®ex);
|
|---|
| 67 | if (s != NULL)
|
|---|
| 68 | {
|
|---|
| 69 | puts ("failed to compile pattern /\\(\\(\\(a\\)\\)\\)/");
|
|---|
| 70 | result = 1;
|
|---|
| 71 | }
|
|---|
| 72 | else
|
|---|
| 73 | {
|
|---|
| 74 | match = re_match (®ex, "apl", 3, 0, ®s);
|
|---|
| 75 | n = 4;
|
|---|
| 76 | if (match != 1)
|
|---|
| 77 | {
|
|---|
| 78 | printf ("re_match returned %d, expected 1\n", match);
|
|---|
| 79 | result = 1;
|
|---|
| 80 | }
|
|---|
| 81 | else if (regs.num_regs <= n || regs.start[n] != -1 || regs.end[n] != -1)
|
|---|
| 82 | {
|
|---|
| 83 | puts ("re_match failed to fill the -1 sentinel");
|
|---|
| 84 | result = 1;
|
|---|
| 85 | }
|
|---|
| 86 | }
|
|---|
| 87 |
|
|---|
| 88 | if (result == 0)
|
|---|
| 89 | puts (" -> OK");
|
|---|
| 90 |
|
|---|
| 91 | return result;
|
|---|
| 92 | }
|
|---|