This is the mail archive of the gcc@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: RFC: GIMPLE tuples. Design and implementation proposal

From: Paolo Bonzini <paolo dot bonzini at lu dot unisi dot ch>
To: Andi Kleen <andi at firstfloor dot org>
Cc: Richard Henderson <rth at redhat dot com>, gcc at gcc dot gnu dot org
Date: Wed, 11 Apr 2007 17:23:54 +0200
Subject: Re: RFC: GIMPLE tuples. Design and implementation proposal
References: <461B175A.1050407@redhat.com.suse.lists.egcs> <m3mz1gnllz.fsf@localhost.localdomain.suse.lists.egcs> <20070411010342.GB25174@redhat.com.suse.lists.egcs> <p73tzvni0us.fsf@bingen.suse.de>
Reply-to: bonzini at gnu dot org

If you go this way (and require special GC/debugger support) you
could as well xor next/prev too and save another field.
Adding a xor is basically free and much cheaper than any cache miss
from larger data structures.
The only thing that wouldn't work is that when you have a pointer to an arbitary element (without starting from beginning/end first) you couldn't get previous or next.

You would pass around a BSI (basic-block/statement iterator) in this case. The BSI would hold the previous/next as necessary.

Paolo

References:
- Re: RFC: GIMPLE tuples. Design and implementation proposal
  - From: Andi Kleen

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