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=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,def01441310021b3 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-08-03 10:38:32 PST Path: archiver1.google.com!newsfeed.google.com!newsfeed.stanford.edu!news.tele.dk!194.25.134.62!newsfeed00.sul.t-online.de!t-online.de!news-lei1.dfn.de!news-was.dfn.de!znr.news.ans.net!abq.news.ans.net!news.chips.ibm.com!newsfeed.btv.ibm.com!news.btv.ibm.com!not-for-mail From: pontius@btv.ibm.com (Dale Pontius) Newsgroups: comp.lang.ada Subject: Re: Will (abstract) Ada code improve over time ? Date: 3 Aug 2001 17:38:26 GMT Organization: IBM Global Services North -- Burlington, Vermont, USA Message-ID: <9kenii$ivo$1@news.btv.ibm.com> References: <3B557455.B3ADFEE@ffi.no> NNTP-Posting-Host: kimon.btv.ibm.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: news.btv.ibm.com 996860306 19448 9.61.131.227 (3 Aug 2001 17:38:26 GMT) X-Complaints-To: news@btv.ibm.com NNTP-Posting-Date: 3 Aug 2001 17:38:26 GMT X-Newsreader: knews 1.0b.0 Xref: archiver1.google.com comp.lang.ada:11238 Date: 2001-08-03T17:38:26+00:00 List-Id: In article , lutz@iks-jena.de (Lutz Donnerhacke) writes: > * Reinert Korsnes wrote: >>Since Ada code is (supposed to be) on a higher abstraction level than for >>example C, does this mean that we can expect new compilers and hardware >>over time (10 years ?) will make a program made in Ada more >>efficient/faster than a similar C program ? > > Assuming the same optimizer complexity, it might be true, because Ada > provides more and more precise information to the compiler than C. > The real issue here is about WHO is trying to make better optimizers? At present, most real-world compilers are C/C++, which don't furnish the extra information Ada does. Therefore most optimization work likely doesn't even concern itself with language hints to the optimizer. In other words, if work is being done to make Ada optimize better than C, it would probably become apparent here in c.l.a. One possible alternative scenario is if C++ is able to give hints to the optimizer. But in that case, I suspect that using those hints would be more a matter of either ignoring the noise, (not using the hings) or trying to pick the usable signal out of the noise. Dale Pontius