Author: schizo
Date: 2008-05-18 11:49:13 +0000 (Sun, 18 May 2008)
New Revision: 2947
Added:
glibc-package/trunk/debian/patches/any/cvs-regex_anchor.diff
Modified:
glibc-package/trunk/debian/changelog
glibc-package/trunk/debian/patches/series
Log:
* Add any/cvs-regex_anchor.diff to fix performance anomaly with ^$.
closes: #475474.
Modified: glibc-package/trunk/debian/changelog
===================================================================
--- glibc-package/trunk/debian/changelog 2008-05-15 17:29:15 UTC (rev
2946)
+++ glibc-package/trunk/debian/changelog 2008-05-18 11:49:13 UTC (rev
2947)
@@ -1,12 +1,17 @@
glibc (2.7-12) UNRELEASED; urgency=low
+ [ Aurelien Jarno ]
* patches/alpha/submitted-procfs_h.diff: don't include elf/asm.h on alpha,
as it has been removed from linux-libc-dev.
* patch/arm/cvs-ioperm.diff: don't include asm/page.h as it has been removed
from linux-libc-dev. Closes: #480892.
- -- Aurelien Jarno <[EMAIL PROTECTED]> Mon, 12 May 2008 04:20:29 +0200
+ [ Clint Adams ]
+ * Add any/cvs-regex_anchor.diff to fix performance anomaly with ^$.
+ closes: #475474.
+ -- Clint Adams <[EMAIL PROTECTED]> Sun, 18 May 2008 07:42:57 -0400
+
glibc (2.7-11) unstable; urgency=low
[ Aurelien Jarno ]
Added: glibc-package/trunk/debian/patches/any/cvs-regex_anchor.diff
===================================================================
--- glibc-package/trunk/debian/patches/any/cvs-regex_anchor.diff
(rev 0)
+++ glibc-package/trunk/debian/patches/any/cvs-regex_anchor.diff
2008-05-18 11:49:13 UTC (rev 2947)
@@ -0,0 +1,151 @@
+2008-04-11 Paolo Bonzini <[EMAIL PROTECTED]>
+
+ * posix/regcomp.c (optimize_utf8): Add a note on why we test
+ opr.ctx_type.
+ (calc_first): Initialize constraint field.
+ (duplicate_node_closure): Use it instead of special casing ANCHORS.
+ Use search_duplicated_node to avoid loops. Fix grammar.
+ (duplicate_node): Merge constraint field for all node types.
+ (calc_eclosure_iter): Look at constraint field for all node types.
+ * posix/regex_internal.c (create_cd_newstate): Don't look at
+ create_cd_newstate.
+
+===================================================================
+RCS file: /cvs/glibc/libc/posix/regcomp.c,v
+retrieving revision 1.117
+retrieving revision 1.118
+--- a/posix/regcomp.c
++++ b/posix/regcomp.c
+@@ -1038,7 +1038,9 @@
+ case BUF_LAST:
+ break;
+ default:
+- /* Word anchors etc. cannot be handled. */
++ /* Word anchors etc. cannot be handled. It's okay to test
++ opr.ctx_type since constraints (for all DFA nodes) are
++ created by ORing one or more opr.ctx_type values. */
+ return;
+ }
+ break;
+@@ -1318,6 +1320,8 @@
+ node->node_idx = re_dfa_add_node (dfa, node->token);
+ if (BE (node->node_idx == -1, 0))
+ return REG_ESPACE;
++ if (node->token.type == ANCHOR)
++ dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type;
+ }
+ return REG_NOERROR;
+ }
+@@ -1446,22 +1450,17 @@
+ destination. */
+ org_dest = dfa->edests[org_node].elems[0];
+ re_node_set_empty (dfa->edests + clone_node);
+- if (dfa->nodes[org_node].type == ANCHOR)
++ /* If the node is root_node itself, it means the epsilon clsoure
++ has a loop. Then tie it to the destination of the root_node. */
++ if (org_node == root_node && clone_node != org_node)
+ {
+- /* In case of the node has another constraint, append it. */
+- if (org_node == root_node && clone_node != org_node)
+- {
+- /* ...but if the node is root_node itself, it means the
+- epsilon closure have a loop, then tie it to the
+- destination of the root_node. */
+- ret = re_node_set_insert (dfa->edests + clone_node,
+- org_dest);
+- if (BE (ret < 0, 0))
+- return REG_ESPACE;
+- break;
+- }
+- constraint |= dfa->nodes[org_node].opr.ctx_type;
++ ret = re_node_set_insert (dfa->edests + clone_node, org_dest);
++ if (BE (ret < 0, 0))
++ return REG_ESPACE;
++ break;
+ }
++ /* In case of the node has another constraint, add it. */
++ constraint |= dfa->nodes[org_node].constraint;
+ clone_dest = duplicate_node (dfa, org_dest, constraint);
+ if (BE (clone_dest == -1, 0))
+ return REG_ESPACE;
+@@ -1479,7 +1478,7 @@
+ clone_dest = search_duplicated_node (dfa, org_dest, constraint);
+ if (clone_dest == -1)
+ {
+- /* There are no such a duplicated node, create a new one. */
++ /* There is no such duplicated node, create a new one. */
+ reg_errcode_t err;
+ clone_dest = duplicate_node (dfa, org_dest, constraint);
+ if (BE (clone_dest == -1, 0))
+@@ -1494,7 +1493,7 @@
+ }
+ else
+ {
+- /* There are a duplicated node which satisfy the constraint,
++ /* There is a duplicated node which satisfies the constraint,
+ use it to avoid infinite loop. */
+ ret = re_node_set_insert (dfa->edests + clone_node, clone_dest);
+ if (BE (ret < 0, 0))
+@@ -1543,8 +1542,7 @@
+ if (BE (dup_idx != -1, 1))
+ {
+ dfa->nodes[dup_idx].constraint = constraint;
+- if (dfa->nodes[org_idx].type == ANCHOR)
+- dfa->nodes[dup_idx].constraint |= dfa->nodes[org_idx].opr.ctx_type;
++ dfa->nodes[dup_idx].constraint |= dfa->nodes[org_idx].constraint;
+ dfa->nodes[dup_idx].duplicated = 1;
+
+ /* Store the index of the original node. */
+@@ -1624,7 +1622,6 @@
+ calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, int node, int root)
+ {
+ reg_errcode_t err;
+- unsigned int constraint;
+ int i, incomplete;
+ re_node_set eclosure;
+ incomplete = 0;
+@@ -1636,15 +1633,14 @@
+ We reference this value to avoid infinite loop. */
+ dfa->eclosures[node].nelem = -1;
+
+- constraint = ((dfa->nodes[node].type == ANCHOR)
+- ? dfa->nodes[node].opr.ctx_type : 0);
+- /* If the current node has constraints, duplicate all nodes.
+- Since they must inherit the constraints. */
+- if (constraint
++ /* If the current node has constraints, duplicate all nodes
++ since they must inherit the constraints. */
++ if (dfa->nodes[node].constraint
+ && dfa->edests[node].nelem
+ && !dfa->nodes[dfa->edests[node].elems[0]].duplicated)
+ {
+- err = duplicate_node_closure (dfa, node, node, node, constraint);
++ err = duplicate_node_closure (dfa, node, node, node,
++ dfa->nodes[node].constraint);
+ if (BE (err != REG_NOERROR, 0))
+ return err;
+ }
+--- a/posix/regex_internal.c
++++ b/posix/regex_internal.c
+@@ -1665,11 +1665,9 @@
+
+ for (i = 0 ; i < nodes->nelem ; i++)
+ {
+- unsigned int constraint = 0;
+ re_token_t *node = dfa->nodes + nodes->elems[i];
+ re_token_type_t type = node->type;
+- if (node->constraint)
+- constraint = node->constraint;
++ unsigned int constraint = node->constraint;
+
+ if (type == CHARACTER && !constraint)
+ continue;
+@@ -1682,8 +1680,6 @@
+ newstate->halt = 1;
+ else if (type == OP_BACK_REF)
+ newstate->has_backref = 1;
+- else if (type == ANCHOR)
+- constraint = node->opr.ctx_type;
+
+ if (constraint)
+ {
Modified: glibc-package/trunk/debian/patches/series
===================================================================
--- glibc-package/trunk/debian/patches/series 2008-05-15 17:29:15 UTC (rev
2946)
+++ glibc-package/trunk/debian/patches/series 2008-05-18 11:49:13 UTC (rev
2947)
@@ -152,6 +152,7 @@
any/cvs-tzfile.diff -p1
any/cvs-vfscanf.diff -p0
any/cvs-wchar_h.diff -p0
+any/cvs-regex_anchor.diff
any/cvs-sunrpc_rpc_thread.diff
any/cvs-strerror_r.diff
any/local-notls.diff -p0
--
To UNSUBSCRIBE, email to [EMAIL PROTECTED]
with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
