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: Incorrect bitfield aliasing with Tree SSA


> It gives you the alias set of the parent, which, for the reason that
> OTHER THINGS USE THE ALIAS SET SPLAY TREES, gives the wrong answer.

Can you give a few sentence explanation of what "alias set splay trees"
are and why they aren't using the alias set mechanism?

> > I'm not sure what a "TBAA forest" is, but keep in mind that, at least in
> > Ada, we have many different types (meaning different tree nodes) that have
> > the same alias set and we really do mean that they are to conflict.
> 
> That's nice.

But are they handled properly?

> There are other questions we ask about alias sets other than "do these
> two alias sets conflict" (which is asking whether they are subsets of
> each other, or equal).  We have good reasons to ask these questions.

Can you give examples of those questions?


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