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.2 required=5.0 tests=BAYES_00,INVALID_MSGID, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: fca1b,5f8432149982f35e X-Google-Attributes: gidfca1b,public X-Google-Thread: 103376,5f8432149982f35e X-Google-Attributes: gid103376,public From: dvdeug@x8b4e516e.dhcp.okstate.edu (David Starner) Subject: Re: Ada and QNX Date: 2000/10/16 Message-ID: <8sfg8p$8q61@news.cis.okstate.edu>#1/1 X-Deja-AN: 682171031 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> Organization: Oklahoma State University User-Agent: slrn/0.9.6.2 (Linux) Reply-To: dstarner98@aasaa.ofe.org Newsgroups: comp.lang.ada,comp.os.qnx Date: 2000-10-16T00:00:00+00:00 List-Id: On Mon, 16 Oct 2000 11:09:30 -0500, Igor Kovalenko wrote: >Perhaps my personal doubts aren't that personal, huh? Nobody appears to >write an OS in Ada, being so good for system level work. Tradition; what the programmers know; popularity; compiler availability - all reasons why OSs are implemented in the langauges they are. >And by the way, >many people say that GCC does not generate good code for C, so I'm kinda >curious how does GNAT manage to generate good code for such a more >complex language as Ada. GCC produces pretty good code. It's not best, but it's not bad code either. Ada's range constraints can often help the compile produce better code than a language without range constraints? As for Ada compilers, I remember a Dr. Dobbs article a few years back, an interview with Prof. Kahan, who pointed out that the only compiler to take full advantage of the ix87 stack was one specific Ada compiler. Like all other compilers, Ada compilers range from the good to the bad. >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. Why would you suspect that? What justifaction would you have to assume that? It's just like C - you can implement the C library in a portable way, or an efficent way, and it varies, but most good C implementations are done the efficent way. Same with Ada. -- David Starner - dstarner98@aasaa.ofe.org http://dvdeug.dhis.org If you wish to strive for peace of soul then believe; if you wish to be a devotee of truth, then inquire. -- Friedrich Nietzsche