[Bug target/27125] optimize array bit shift

[pinskia at gcc dot gnu dot org]

--- Comment #3 from pinskia at gcc dot gnu dot org  2006-08-21 05:59 ---
This is a dup of bug 23813 and many others.  This is the standard subreg
problem.

*** This bug has been marked as a duplicate of 23813 ***


-- 

pinskia at gcc dot gnu dot org changed:

   What|Removed |Added

 Status|WAITING |RESOLVED
 Resolution||DUPLICATE


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=27125

[Bug target/27125] optimize array bit shift

[ajrobb at bigfoot dot com]

--- Comment #2 from ajrobb at bigfoot dot com  2006-05-10 09:45 ---
Created an attachment (id=11428)
 -- (http://gcc.gnu.org/bugzilla/attachment.cgi?id=11428action=view)
multi-word bit shift

This is my loop - using a single index that decrements to zero

I have seen simpler loops perform twice as fast with decrement to zero compared
with increment to value.

.L8:
movl-4(%ebp,%ebx,4), %eax
movl%edi, %ecx
movl(%ebp,%ebx,4), %edx
sall%cl, %eax
movl%esi, %ecx
shrl%cl, %edx
orl %eax, %edx
movl%edx, (%ebp,%ebx,4)
decl%ebx
jne .L8


-- 


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=27125

[Bug target/27125] optimize array bit shift

[pinskia at gcc dot gnu dot org]

--- Comment #1 from pinskia at gcc dot gnu dot org  2006-04-12 01:17 ---
I don't see any attached sources or .s files.


-- 

pinskia at gcc dot gnu dot org changed:

   What|Removed |Added

 Status|UNCONFIRMED |WAITING


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=27125