--- Begin Message ---
Subject: |
[PATCH] dfa: speed-up for a pattern that many atoms are catenated |
Date: |
Thu, 05 Jun 2014 20:32:44 +0900 |
When many atoms are catenated, dfamust() is very slow in order that
pushing a string into `in' list is slow. This change fixes it.
I tested below to confirm the effect.
$ printf '%08192d\n' 0 | time -p src/grep -f - /dev/null
0001-dfa-speed-up-for-a-pattern-that-many-atoms-are-caten.patch
Description: Text document
--- End Message ---
--- Begin Message ---
Subject: |
Re: bug#17700: [PATCH] dfa: speed-up for a pattern that many atoms are catenated |
Date: |
Fri, 06 Jun 2014 22:19:13 +0900 |
Paul Eggert wrote:
> So it looks like your patch confers some advantage, but on my platform
> almost all the speedup is achieved simply by switching to the system strstr.
First, I tested on CentOS 5.10. Next, I tested on RHEL 6.5, and get
result as same as you. strstr() on CentOS 5.10 may be too old. I'm
sure that this bug has already been fixed. So closing.
Thanks,
Norihiro
--- End Message ---