From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Simon Wright Newsgroups: comp.lang.ada Subject: Re: Mixing Ada code with similar licenses Date: Mon, 27 Mar 2017 08:07:50 +0100 Organization: A noiseless patient Spider Message-ID: References: <86633a07-9a12-4419-ad09-b519e4f279a5@googlegroups.com> <0bc08b9a-63e3-41bf-96d8-e9652c23a72a@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: mx02.eternal-september.org; posting-host="2c4d1ae3dfa75454e139cc23729edbbe"; logging-data="3548"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+YnQDokHjC4jF6QJaY+8POQVLj1QXhrYE=" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/25.1 (darwin) Cancel-Lock: sha1:+cPqPLoPiyjd0W9BZ6k/xA1iA0w= sha1:zBGWdIIbxKiPIyGZOtAbsK8DaIo= Xref: news.eternal-september.org comp.lang.ada:46483 Date: 2017-03-27T08:07:50+01:00 List-Id: "Jeffrey R. Carter" 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.