This is the mail archive of the
mailing list for the GCC project.
Re: [Patch, PR 61720] Clear regex BFS match queue after every iteration
- From: Jonathan Wakely <jwakely dot gcc at gmail dot com>
- To: Mike Stump <mikestump at comcast dot net>
- Cc: Paolo Carlini <paolo dot carlini at oracle dot com>, Tim Shen <timshen at google dot com>, "libstdc++" <libstdc++ at gcc dot gnu dot org>, gcc-patches <gcc-patches at gcc dot gnu dot org>, Jonathan Wakely <jwakely at redhat dot com>
- Date: Wed, 9 Jul 2014 19:33:45 +0100
- Subject: Re: [Patch, PR 61720] Clear regex BFS match queue after every iteration
- Authentication-results: sourceware.org; auth=none
- References: <CAG4ZjN=GJoUVDWQVAdC-Pq9JwwHLY8=jX72FBt7fD-Pkb-NCDA at mail dot gmail dot com> <53B9586E dot 2020505 at oracle dot com> <CAG4ZjN=K3JFHBs64s95ZBLph=rnb_-7zCqguat81r128Q91S0Q at mail dot gmail dot com> <53BA5941 dot 9000708 at oracle dot com> <CAG4ZjN=RtUJqbPcOxjgNOvgGWuOJGQ85iXXew+4esV1sFM7HhQ at mail dot gmail dot com> <53BCF3E3 dot 5080208 at oracle dot com> <9CDD9607-526F-430E-8C7F-8707DB05F13C at comcast dot net>
On 9 July 2014 18:33, Mike Stump wrote:
> The other limit is how big the resulting program is. Too large, and it wonât test on a small memory system. Under a meg, and most people donât care. As it climbs above that it starts mattering more.
If the test is driven by a data file containing the cases to test then
the executable going to be pretty small, as it reads a single case
form the file and runs it, then loops. So executable size shouldn't be
an issue here.