This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug target/43052] [4.7 Regression] Inline memcmp is *much* slower than glibc's, no longer expanded inline
- From: "rguenth at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Wed, 24 Aug 2011 14:36:45 +0000
- Subject: [Bug target/43052] [4.7 Regression] Inline memcmp is *much* slower than glibc's, no longer expanded inline
- Auto-submitted: auto-generated
- References: <bug-43052-4@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=43052
--- Comment #18 from Richard Guenther <rguenth at gcc dot gnu.org> 2011-08-24 14:36:45 UTC ---
(In reply to comment #17)
> Hmm,
> I guess ideally the middle-end should know how to inline the simple loop (for
> both strlen and memcmp) and do so when object size is known to be small
> (probably by target specific value). Or does anyone think it is a bad idea?
I think that's a bad idea, yes. Apart from maybe simple cases we already
handle for memcpy -> assignment simplifications (thus, aligned compares up to
word_mode size), but supposedly only if the result is checked for ==/!= 0
only(?).