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.7 required=5.0 tests=BAYES_05,HEADER_SPAM, INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: ff499,32898cca6ca4143e X-Google-Attributes: gidff499,public X-Google-Thread: 103376,32898cca6ca4143e X-Google-Attributes: gid103376,public From: "Thomas W. Christopher" Subject: Re: Compiler Optimisation? Date: 1998/12/10 Message-ID: <98-12-020@comp.compilers>#1/1 X-Deja-AN: 421004849 Content-Transfer-Encoding: 7bit Sender: johnl@iecc.com References: <98-12-010@comp.compilers> X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com Content-Type: text/plain; charset=us-ascii Organization: Illinois Institute of Technology Keywords: optimize Mime-Version: 1.0 Newsgroups: comp.lang.ada,comp.compilers X-FAQ-and-archives: http://www.iecc.com/compilers Date: 1998-12-10T00:00:00+00:00 List-Id: How much faster does optimized code run for different optimizations? I believe Daniel Bidwell ( http://www2.andrews.edu/~bidwell/ ) worked on that question in his PhD dissertation, as well as how much do the optimizations cost. As I recall, he found that "folding," performing constant arithmetic at compile time, not only makes the compiled code run faster, but also the compiler. -- Thomas W. Christopher -- tc@charlie.cns.iit.edu , tc@toolsofcomputing.com Principal, Tools of Computing LLC. -- http://www.toolsofcomputing.com Associate Prof., Illinois Inst. of Tech. -- http://www.iit.edu/~tc