From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-0.5 required=3.0 tests=BAYES_05 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: Wed, 27 Feb 91 09:48:09 EST
From: neptune@Ada1.crd.ge.com (Keith Gehring)
Subject: Effects of Ada Coding Style on Compiler Optimizations
Message-ID: <9102271448.AA05693@Ada1.>
List-Id: <comp.lang.ada>

I am looking for a list of Ada features that, by their nature, thwart an
Ada compiler from optimizing a program (e.g., use of separates kills 
common subexpression elimination in the calling routine.) or are expensive
to use in terms of code size and speed (e.g., use of unconstrained array
types as subprogram parameters forces runtime determination of array size
vs. compile time determination).  I know there are more than these.

I would also appreciate any explanation as to why a particular feature
cannot be fully optimized (it may not be obvious to me).

I'll take any references to books, technical articles, personal 
experience/knowledge, etc.  

Thanks,

Keith L. Gehring
513-583-5373
neptune@Ada1.crd.ge.com