Re: Mixing Ada code with similar licenses

[Simon Wright <simon@pushface.org>]

"Jeffrey R. Carter" <spam.jrcarter.not@spam.not.acm.org> writes:

> The 2 BSS_Clear algorithms might implement the same algorithm, but
> they do it differently, so the GPL on one doesn't affect the other. If
> you can do
>
> procedure BSS_Clear is
>    N : constant Natural := ...; -- Based on start and end addresses
>
>    type List is array (1 .. N) of Integer'Address;
>
>    A : List;
>    for A'Address use To_Address (BSS_Start);
>    pragma Import (Ada, A);
> begin -- BSS_Clear
>    A := List'(A'range => 0);
> end BSS_Clear;
>
> then that's a 3rd implementation that makes the looping implicit.

And (it turns out) probably translates to a call to memset()! a yet
deeper level of implicitness.