summaryrefslogtreecommitdiff
path: root/posix
diff options
context:
space:
mode:
authorUlrich Drepper <drepper@redhat.com>2003-11-22 09:35:46 +0000
committerUlrich Drepper <drepper@redhat.com>2003-11-22 09:35:46 +0000
commit18e3dc56e43e3e8e997845c0934e14296ba18bb7 (patch)
treee74f4dc27d391a97be64032e73e8ea66d10c9973 /posix
parentcb2eab1f8a11ad4e3e69b89a82a73435f0fa4983 (diff)
Update.
2003-11-22 Ulrich Drepper <drepper@redhat.com> * posix/PTESTS: Fix first test of GA143. * posix/regex_internal.c (re_dfa_add_node): Add BE, reallocation isn't likely.
Diffstat (limited to 'posix')
-rw-r--r--posix/PTESTS3
-rw-r--r--posix/ptestcases.h2
-rw-r--r--posix/regex_internal.c2
3 files changed, 4 insertions, 3 deletions
diff --git a/posix/PTESTS b/posix/PTESTS
index 7d2676e20f..8732a2ccfe 100644
--- a/posix/PTESTS
+++ b/posix/PTESTS
@@ -270,7 +270,8 @@
1¦63¦a\{1,63\}¦aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa¦
# 2.8.3.4 BRE Precedence
# GA143
-2¦20¦\^\[[[.].]]\\(\\1\\)\*\\{1,2\\}\$¦a^[]\(1\)*\{1,2\}$b¦
+#W There are numerous bugs in the original version.
+2¦19¦\^\[[[.].]]\\(\\1\\)\*\\{1,2\\}\$¦a^[]\(\1\)*\{1,2\}$b¦
1¦6¦[[=*=]][[=\=]][[=]=]][[===]][[...]][[:punct:]]¦*\]=.;¦
1¦6¦[$\(*\)^]*¦$\()*^¦
1¦1¦[\1]¦1¦
diff --git a/posix/ptestcases.h b/posix/ptestcases.h
index 1a15f75f82..8f008acf5a 100644
--- a/posix/ptestcases.h
+++ b/posix/ptestcases.h
@@ -265,7 +265,7 @@
{ 1, 63, "a\\{1,63\\}", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", },
{ 0, 0, "2.8.3.4 BRE Precedence", NULL, },
{ 0, 0, "GA143", NULL, },
- { 2, 20, "\\^\\[[[.].]]\\\\(\\\\1\\\\)\\*\\\\{1,2\\\\}\\$", "a^[]\\(1\\)*\\{1,2\\}$b", },
+ { 2, 19, "\\^\\[[[.].]]\\\\(\\\\1\\\\)\\*\\\\{1,2\\\\}\\$", "a^[]\\(\\1\\)*\\{1,2\\}$b", },
{ 1, 6, "[[=*=]][[=\\=]][[=]=]][[===]][[...]][[:punct:]]", "*\\]=.;", },
{ 1, 6, "[$\\(*\\)^]*", "$\\()*^", },
{ 1, 1, "[\\1]", "1", },
diff --git a/posix/regex_internal.c b/posix/regex_internal.c
index 71496ab906..50d6a79300 100644
--- a/posix/regex_internal.c
+++ b/posix/regex_internal.c
@@ -1040,7 +1040,7 @@ re_dfa_add_node (dfa, token, mode)
re_token_t token;
int mode;
{
- if (dfa->nodes_len >= dfa->nodes_alloc)
+ if (BE (dfa->nodes_len >= dfa->nodes_alloc, 0))
{
re_token_t *new_array;
dfa->nodes_alloc *= 2;