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: "hubicka 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:20:29 +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 #17 from Jan Hubicka <hubicka at gcc dot gnu.org> 2011-08-24 14:20:29 UTC ---
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?
We could then make i386 backend to again inline the rep instruction and/or the
new string extensions
Honza