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=-0.4 required=5.0 tests=AC_FROM_MANY_DOTS,BAYES_00, XPRIO autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,cdd98d2601f9ac38,start X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-03-06 23:37:03 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.online.be!newsfeed.wirehub.nl!psiuk-p2!psiuk-p3!uknet!psiuk-n!news.pace.co.uk!nh.pace.co.uk!not-for-mail From: "Marin David Condic" Newsgroups: comp.lang.ada Subject: Representation Clauses That Used To Work On Gnat 3.13p Date: Wed, 6 Mar 2002 16:04:30 -0500 Organization: Posted on a server owned by Pace Micro Technology plc Message-ID: NNTP-Posting-Host: dhcp-200-133.miami.pace.co.uk X-Trace: nh.pace.co.uk 1015448676 7206 136.170.200.133 (6 Mar 2002 21:04:36 GMT) X-Complaints-To: newsmaster@news.cam.pace.co.uk NNTP-Posting-Date: 6 Mar 2002 21:04:36 GMT X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 5.50.4522.1200 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4522.1200 Xref: archiver1.google.com comp.lang.ada:20890 Date: 2002-03-06T21:04:36+00:00 List-Id: Testing some stuff I used to have working using Gnat 3.13p on a PC/NT machine, I discovered a representation clause that chokes on Gnat 3.14p. I'm wondering if possibly I am doing something wrong. The following code illustrates this: package Test_It is -- Issues warning: -- test_it.ads:5:27: warning: 32 bits of "Float_96" unused type Float_96 is digits 18 ; for Float_96'Size use 96 ; -- Issues error: -- test_it.ads:9:46: size for "Float_96" too small, minimum allowed is 128 type Vector_96 is array (Integer range <>) of Float_96 ; for Vector_96'Component_Size use Float_96'Size ; pragma Pack (Vector_96) ; end Test_It ; It used to be that Gnat stored an 80 bit IEEE floating point number using 96 bits & the above would compile on a PC (but not necessarily elsewhere.) Now it seems to require 128 bits & I'm wondering if getting the original 96 bits just requires some different/additional representation clauses or if it is just plain impossible. BTW: If it really used all 128 bits for computation, that would be fun. But since its only using 80 of them, it seems like a lot of wasted space... Does this speed things up any on an x86? MDC -- Marin David Condic Senior Software Engineer Pace Micro Technology Americas www.pacemicro.com Enabling the digital revolution e-Mail: marin.condic@pacemicro.com Web: http://www.mcondic.com/