🚀 go-pugleaf

Current unix/make/rcs software developent methodology generally encourages
a style of coding in which huge computer programs and systems are broken
up into a large number of very small source modules which may be
incrementally compiled following source code updated.

Unfortunately, this general procedure makes it impossible for any globally
optimizing compiler to see any more than a small part of the program which
it is supposed to be globally optimizing at any one time.  So, we lose out
on the potential for inlining (cloning) of procedures/functions which are
not contained within the present source code file.

Is anyone working on updating make or developing compilers which are able
do global optimization of procedures spanning huge source code trees?  How
is such optimization accomplished by existing and/or planned compilers?

Is anyone working on updating gcc to globally optimize source code
contained through a huge tree of source code?

How much global optimization is done by the existing gcc 2.4.5 compiler
for i386/i486/pentium processors?

--
Alexander-James Annala
Principal Investigator
Neuroscience Image Analysis Network
HEDCO Neuroscience Building, Fifth Floor
University of Southern California
University Park
Los Angeles, CA 90089-2520
-- 
Send compilers articles to compilers@iecc.com or
{ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request@iecc.com.