Re: How to get Ada to ?cross the chasm??

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On 11/05/2018 12:57, Niklas Holsti wrote:
> On 18-05-11 13:04 , Dmitry A. Kazakov wrote:
>> On 11/05/2018 03:07, Paul Rubin wrote:
> 
>     [snip]
> 
>>> That's in contrast with
>>> conservative GC where the runtime can't necessarily figure out the types
>>> of all the objects.  Conservative GC is a terrifying concept in theory,
>>> but it works surprisingly well in practice.  It has been used in Ada in
>>> the past.
>>
>> [snip] And even with statically known types the
>> pointers might be not statically known:
>>
>>    type My_Integer (Indirect : Boolean := False) is record
>>       case Indirect is
>>          when True =>
>>             Reference : access Integer;
>>          when False =>
>>             Value : Integer;
>>       end case;
>>    end My_Integer;
> 
> That would not bother a conservative GC much; it would use the record's 
> contents as potential pointers (to whatever type of object) without 
> caring about the value of the Indirect discriminant.
> 
> If Indirect = False, but the Value happens to be a valid pointer to or 
> into a heap object, the conservative GC would consider the heap object 
> "reachable" and refrain from collecting it. So collection would not find 
> all the garbage, but usually it would find most of it.

Yes, but if we start not collecting objects we could do just same 
without pointers. The compiler could allocate Reference for each 
instance of My_Integer and never free it.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de