This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: [tree-ssa][Bug optimization/12747] Scalar replacement ofaggregates (part 1)


On Thu, 2003-11-20 at 16:53, Andrew MacLeod wrote:

> Whats the SSA look like for this one? This is presumably final optimized
> code. All the componentry is renamed via virtual operands?
> 
Yup.  All vops.


> I would think we'd get:
> 
> void copy(BitVector&, BitVector&, unsigned int) (DEST, SRC, I)
> {
>   setBit (DEST, I, (int)(bool)(int)getBit (SRC, I));
> }
> 
> out the other end now... Although now that I think about it I dont think
> I have enabled moving function calls, so I guess we'd get
> 
> void copy(BitVector&, BitVector&, unsigned int) (DEST, SRC, I)
> {
>   T.3 = getBit (SRC, I);
>   setBit (DEST, I, (int)(bool)(int)T.3);
> }
> 
Well, I was also expecting <D1587> to be copy propagated, but it
wasn't.  I'll take a look.


Diego.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]