From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on ip-172-31-65-14.ec2.internal X-Spam-Level: X-Spam-Status: No, score=-3.2 required=3.0 tests=BAYES_00,NICE_REPLY_A, T_SCC_BODY_TEXT_LINE autolearn=ham autolearn_force=no version=3.4.6 Path: eternal-september.org!reader01.eternal-september.org!news.szaf.org!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail From: Niklas Holsti Newsgroups: comp.lang.ada Subject: Re: Ada array contiguity. Date: Sun, 19 Feb 2023 19:54:13 +0200 Organization: Tidorum Ltd Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit X-Trace: individual.net uooDKW1BN3iBzcdLVf5hogHRzGwDs3gFZUsKIt6c9sp7onjuD4 Cancel-Lock: sha1:KiyZz6guZayHSuWs7otIUljS9y4= User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.14; rv:102.0) Gecko/20100101 Thunderbird/102.6.1 Content-Language: en-US In-Reply-To: Xref: reader01.eternal-september.org comp.lang.ada:64946 List-Id: On 2023-02-19 19:10, J-P. Rosen wrote: > Le 19/02/2023 à 15:59, Niklas Holsti a écrit : >>> (BTW: try to find a definition of "contiguous". At byte level? At >>> word level? What if the element does not fill a byte?) >> >> >> Indeed. But it seems to me that Arr'Size = Arr'Length * Comp'Size is >> the meaning usually intended for programming purposes. > > Certainly not if Comp'Size is not an integer number of bytes. I'm not so certain. By choosing various roundings-up of the component size, you can choose between "bit-contiguous", "byte-contiguous", etc. For example, bit-contiguous with 2-bit components: type Comp is (A, B, C, D) with Size => 2; type Arr is array (1 .. 10) of Comp with Pack, Size => 10 * Comp'Size; Nybble-contiguous with Comp'Size => 4, byte- (octet-) contiguous with Comp'Size => 8, etc. (However, I haven't checked that eg. GNAT does the "right thing" with such Size clauses, just that it accepts them. It does require the Pack aspect for the array type when Comp'Size is not a multiple of 8.) On 2023-02-19 17:08, Dmitry A. Kazakov wrote: > On 2023-02-19 15:59, Niklas Holsti wrote: >> On 2023-02-19 16:28, J-P. Rosen wrote: > >>> (BTW: try to find a definition of "contiguous". At byte level? >>> At word level? What if the element does not fill a byte?) >> >> Indeed. But it seems to me that Arr'Size = Arr'Length * Comp'Size >> is the meaning usually intended for programming purposes. > > Rather: the bit offset of an element is a linear function of its > position. That is ordering by index, but not contiguity: there may still be gaps between elements. However, I assume you meant that the slope of the linear function equals the component size, and then it includes contiguity. The relationship of index order to memory-location order is certainly an aspect that should be considered when interfacing to C or HW. Pet peeve: on more than one occasion I have been disappointed that Ada representation clauses do not let me specify the index-order of packed array elements in a word, relative to the bit-numbering order, and I have had to fall back to using several scalar-type record components, c1 .. c7 say, instead of one array-type component, c(1..7).