This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] Avoid nondeterminism in tree-ssanames
- From: law at redhat dot com
- To: Diego Novillo <dnovillo at redhat dot com>
- Cc: Andrew Macleod <amacleod at redhat dot com>, Jan Hubicka <jh at suse dot cz>, Geoff Keating <geoffk at geoffk dot org>, gcc-patches <gcc-patches at gcc dot gnu dot org>
- Date: Mon, 01 Dec 2003 14:38:30 -0700
- Subject: Re: [tree-ssa] Avoid nondeterminism in tree-ssanames
- Reply-to: law at redhat dot com
In message <1070314306.20247.39.camel@frodo.toronto.redhat.com>, Diego Novillo
writes:
>On Mon, 2003-12-01 at 16:26, Andrew MacLeod wrote:
>
>> I dont particularly like re-using SSA_NAMEs versions. Expecially in
>> large programs Im debugging, I tend to grep for VAR_v in a.c.* listing
>> files to see where uses appear and dissappear. I guess its not a huge
>> thing to filter out, but I can see it being very confusing sometimes,
>> especially if the new use is at all similar to what the old use was.
>>
>Agreed. It also makes it hard to debug when you want to setup a
>conditional breakpoint based on the SSA number.
>
>Unless it's a huge win, I would *really* want to go back to the previous
>scheme of having unique SSA numbers across the whole compilation unit.
Err, across the whole compilation unit? You've got to be kidding. Think
about how we size some varrays and sbitmaps?!?
Across a function, yes, that's sensible. Across a compilation unit is,err,
dumb.
jeff