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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,5f8432149982f35e X-Google-Attributes: gid103376,public X-Google-Thread: fca1b,5f8432149982f35e X-Google-Attributes: gidfca1b,public From: Gautier Subject: Re: Ada and QNX Date: 2000/10/16 Message-ID: <39EB411B.42AA5EF3@maths.unine.ch>#1/1 X-Deja-AN: 682145923 Content-Transfer-Encoding: 7bit References: <8r1i82$ri3$1@kujawiak.man.lodz.pl> <8r5pe5$h70$1@nnrp1.deja.com> <8FCDFD7EEnopenopena@63.209.170.206> <39EA6305.CD5CFE1F@ix.netcom.com> <39EA9161.6469DDE2@home.com> <39EB1BA2.B5F2BFDF@acm.org> <39EB283A.9F7B4F76@motorola.com> X-Accept-Language: en Content-Type: text/plain; charset=us-ascii X-Trace: 16 Oct 2000 19:55:39 +0100, mac13-32.unine.ch Organization: Maths - Uni =?iso-8859-1?Q?Neuch=E2tel?= MIME-Version: 1.0 Newsgroups: comp.lang.ada,comp.os.qnx Date: 2000-10-16T00:00:00+00:00 List-Id: Igor: > Summarizing what you and others replied, it looks like everything is > cool with Ada. Just wondering why it is not yet really resurrected and > blooming and shining in all its glory. You should take courses about psychology of the masses... > Perhaps my personal doubts aren't that personal, huh? Nobody appears to > write an OS in Ada, being so good for system level work. And by the way, > many people say that GCC does not generate good code for C, Who says that ?! Did you play the famous Quake 1 game, it is entirely made with GCC, including graphics... > so I'm kinda curious how does GNAT manage to generate good code for > such a more complex language as Ada. It doesn't matter. With strong typing, GCC-GNAT knows better what animals are the variables (not just pointers to something) and optimizes indices, shifts, registers, inlinings, generics etc. nicely. You can take a look at my pure-software 3D experiments (see link below). > Aside from code generation itself, how do they > manage to implement things like rendesvous in an efficient AND portable > way? Such things normally belong to system-dependent runtime libraries, > but in Ada they are part of language and having no proof I nevertheless > suspect that they are implemented by trading efficiency for portability. For tasking, I can't tell, but e.g. for exceptions, they don't alter at all performance: they are well implemented !... Anyway you can see the resulting assembler code (gcc -S -O2 -gnatpn) for checking what GCC/GNAT does... ____________________________________________________ Gautier -- http://members.nbci.com/gdemont/e3d.htm