This is the mail archive of the
libc-alpha@sources.redhat.com
mailing list for the glibc project.
Re: [BZ558] Part 1: more efficient lowering of {m,n}
- From: Jakub Jelinek <jakub at redhat dot com>
- To: Paolo Bonzini <paolo dot bonzini at lu dot unisi dot ch>
- Cc: Glibc Development <libc-alpha at sources dot redhat dot com>
- Date: Tue, 23 Nov 2004 13:38:26 +0100
- Subject: Re: [BZ558] Part 1: more efficient lowering of {m,n}
- References: <41A32E07.2010304@lu.unisi.ch>
- Reply-to: Jakub Jelinek <jakub at redhat dot com>
On Tue, Nov 23, 2004 at 01:33:11PM +0100, Paolo Bonzini wrote:
> BZ558's profile shows that most of the time is taken by node set
> operations in calc_eclosure and calc_inveclosure.
>
> The calc_eclosure part is fixed by this patch. Braced groups are
> lowered differently: for example .{1,5} can become (.(.(.(..?)?)?)?)?
> instead of .?.?.?.?.? --- of course the brackets are not capturing,
> they're only there to show what is the question mark applied to.
Does this DTRT with say ([abcdefgh]){1,5}\1, e.g. when matching
abcdee or abb? If yes, it would be good to have that in the testsuite
too.
> Patch at
> http://sources.redhat.com/bugzilla/attachment.cgi?id=289&action=view
Even if you put patches into bugzilla, please mail them as well to
the mailing list.
Jakub