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: g++ and aliasing bools




--On Friday, January 25, 2002 08:52:39 PM +0100 Paolo Carlini 
<pcarlini@unitus.it> wrote:

> Mark Mitchell wrote:
>
>> Your proof has at least one bug.  A type that has no baseclasses or
>> virtuals can contain (as a data member) a type that does; such a type
>> is at least as complex as the contained type.  (Similarly, an array
>> of classes with virtual bases, etc.)  You need to recurse through the
>> type structure.
>
> Mark, is this really hard to implement??

No!  You just have to think of it. :-)

> My feeling is that this first improvement step should not be terribly
> difficult to implement and also not terribly difficult to prove correct!

Agreed.  I think Joe's argument is a huge step forward; if we can just
work that through we'll probably get somewhere.

--
Mark Mitchell                   mark@codesourcery.com
CodeSourcery, LLC               http://www.codesourcery.com


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