Merged from mainline.

llvm-svn: 15723

llvm/CREDITS.TXT

@@ -12,6 +12,10 @@ E: vadve@cs.uiuc.edu
 W: http://www.cs.uiuc.edu/~vadve/
 D: The Sparc64 backend, provider of much wisdom, and motivator for LLVM
 
+N: Nate Begeman
+E: natebegeman@mac.com
+D: Portions of the PowerPC backend
+
 N: Tanya Brethour
 E: tonic@nondot.org
 W: http://nondot.org/~tonic/
@@ -20,7 +24,8 @@ D: The llvm-ar tool
 N: Misha Brukman
 E: brukman+llvm@uiuc.edu
 W: http://misha.brukman.net
-D: Portions of X86 and Sparc JIT compilers, incremental bytecode loader
+D: Portions of X86 and Sparc JIT compilers, PowerPC backend
+D: Incremental bytecode loader
 
 N: Cameron Buschardt
 E: buschard@uiuc.edu
@@ -37,14 +42,26 @@ D: Autoconf support, QMTest database, documentation improvements
 N: Brian Gaeke
 E: gaeke@uiuc.edu
 W: http://www.students.uiuc.edu/~gaeke/
-D: Portions of X86 static and JIT compilers, reoptimizer framework cleanups
+D: Portions of X86 static and JIT compilers. 
+D: Dynamic trace optimizer 
 D: FreeBSD/X86 compatibility fixes, the llvm-nm tool
 
+N: Louis Gerbarg
+D: Portions of the PowerPC backend
+
 N: Chris Lattner
 E: sabre@nondot.org
 W: http://nondot.org/~sabre/
 D: Primary architect of LLVM
 
+N: Vladimir Merzliakov
+E: wanderer@rsu.ru
+D: Test suite fixes for FreeBSD.
+
+N: Vladimir Prus
+E: ghost@cs.msu.su
+D: Made inst_iterator behave like a proper iterator, LowerConstantExprs pass
+
 N: Ruchira Sasanka
 E: sasanka@uiuc.edu
 D: Graph coloring register allocator for the Sparc64 backend
@@ -53,6 +70,12 @@ N: Anand Shukla
 E: ashukla@cs.uiuc.edu
 D: The `paths' pass
 
+N: Reid Spencer
+E: rspencer@x10sys.com
+W: http://extprosys.sourceforge.net/
+D: 'llvm' namespacification, Stacker FE, VMCore cleanup (SymbolTable, 
+D: Value != Type, CPR removal, bytecode improvements, llvmcs).
+
 N: Bill Wendling
 E: wendling@isanbard.org
 D: The `Lower Setjmp/Longjmp' pass, improvements to the -lowerswitch pass.

llvm/LICENSE.TXT

@@ -1,45 +1,11 @@
-NOTICE:
-=======
-All distributions of LLVM prior to the 1.0 Release will be licensed to you
-under the LLVM pre-release license.  The 1.0 Release will be announced on the
-LLVM Announcements Mailing List.
-
-After the 1.0 Release of LLVM, the LLVM code will be licensed to you under the
-LLVM Release License (aka the Illinois Open Source License).
-
-The main point is that you cannot re-distribute LLVM until the 1.0 Release.
-
-==============================================================================
-LLVM pre-release license
-==============================================================================
-
-This is a pre-release distribution of the LLVM software and is provided for
-evaluation only.  This version of the LLVM software or modifications thereof
-should not be distributed to third parties for any purpose.  Any third parties
-interested in it can request a copy directly by sending e-mail to
-llvmdev@cs.uiuc.edu.  As this is an evaluation release, we would appreciate any
-and all feedback, ideas, and reports of bugs that you encounter.  You may
-discuss development of LLVM on llvmdev@cs.uiuc.edu, and bugs can be submitted
-through the LLVM Bug Tracker at http://llvm.cs.uiuc.edu/bugzilla/ .  We thank
-you for your interest in LLVM and look forward to any comments or feedback you
-may have.
-
-THE SOFTWARE IS PROVIDED AS IS, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
-CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE
-SOFTWARE.
-
 ==============================================================================
 LLVM Release License
 ==============================================================================
 University of Illinois/NCSA
 Open Source License
 
-Copyright (c) 2003, University of Illinois at Urbana-Champaign.  All rights
-reserved.
+Copyright (c) 2003, 2004 University of Illinois at Urbana-Champaign.
+All rights reserved.
 
 Developed by:
 
@@ -83,3 +49,53 @@ The LLVM software contains code written by third parties.  Such software will
 have its own individual LICENSE.TXT file in the directory in which it appears.
 This file will describe the copyrights, license, and restrictions which apply
 to that code.
+
+The disclaimer of warranty in the University of Illinois Open Source License
+applies to all code in the LLVM Distribution, and nothing in any of the
+other licenses gives permission to use the names of the LLVM Team or the
+University of Illinois to endorse or promote products derived from this
+Software.
+
+The following pieces of software have additional or alternate copyrights,
+licenses, and/or restrictions:
+
+Program             Directory
+-------             ---------
+PowerPC Backend     llvm/lib/Target/PowerPC
+Autoconf:           llvm/autoconf
+                    llvm/projects/ModuleMaker/autoconf
+                    llvm/projects/sample/autoconf
+Burg:               llvm/utils/Burg
+                    llvm/test/Programs/MultiSource/Applications/Burg
+Aha:                llvm/test/Programs/MultiSource/Applications/aha
+SGEFA:              llvm/test/Programs/MultiSource/Applications/sgefa
+SIOD:               llvm/test/Programs/MultiSource/Applications/siod
+Spiff:              llvm/test/Programs/MultiSource/Applications/spiff
+D:                  llvm/test/Programs/MultiSource/Applications/d
+Lambda:             llvm/test/Programs/MultiSource/Applications/lambda-0.1.3
+hbd:                llvm/test/Programs/MultiSource/Applications/hbd
+treecc:             llvm/test/Programs/MultiSource/Applications/treecc
+kimwitu++:          llvm/test/Programs/MultiSource/Applications/kimwitu++
+obsequi:            llvm/test/Programs/MultiSource/Applications/obsequi
+Fhourstones:        llvm/test/Programs/MultiSource/Benchmarks/Fhourstones
+McCat:              llvm/test/Programs/MultiSource/Benchmarks/McCat
+Olden:              llvm/test/Programs/MultiSource/Benchmarks/Olden
+OptimizerEval:      llvm/test/Programs/MultiSource/Benchmarks/OptimizerEval
+Ptrdist:            llvm/test/Programs/MultiSource/Benchmarks/Ptrdist
+LLUBenchmark:       llvm/test/Programs/MultiSource/Benchmarks/llubenchmark
+SIM:                llvm/test/Programs/MultiSource/Benchmarks/sim
+cfrac:              llvm/test/Programs/MultiSource/Benchmarks/MallocBench/cfrac
+espresso:           llvm/test/Programs/MultiSource/Benchmarks/MallocBench/espresso
+gs:                 llvm/test/Programs/MultiSource/Benchmarks/MallocBench/gs
+p2c:                llvm/test/Programs/MultiSource/Benchmarks/MallocBench/p2c
+gawk:               llvm/test/Programs/MultiSource/Benchmarks/MallocBench/gawk
+make:               llvm/test/Programs/MultiSource/Benchmarks/MallocBench/make
+perl:               llvm/test/Programs/MultiSource/Benchmarks/MallocBench/perl
+Dhrystone:          llvm/test/Programs/SingleSource/Benchmarks/Dhrystone
+SingleSource Tests: llvm/test/Programs/SingleSource/Benchmarks/Misc
+                    llvm/test/Programs/SingleSource/CustomChecked
+                    llvm/test/Programs/SingleSource/Gizmos
+GNU Libc:           llvm/runtime/GCCLibraries/libc
+Zlib Library:       llvm/runtime/zlib
+PNG Library:        llvm/runtime/libpng
+

llvm/Makefile

@@ -1,14 +1,18 @@
-##===- ./Makefile ------------------------------------------*- Makefile -*-===##
+#===- ./Makefile -------------------------------------------*- Makefile -*--===#
 # 
 #                     The LLVM Compiler Infrastructure
 #
 # This file was developed by the LLVM research group and is distributed under
 # the University of Illinois Open Source License. See LICENSE.TXT for details.
 # 
-##===----------------------------------------------------------------------===##
+#===------------------------------------------------------------------------===#
 LEVEL = .
-DIRS = lib/Support utils lib tools runtime
+DIRS = lib/Support utils lib tools 
+
+ifneq ($(MAKECMDGOALS),tools-only)
+DIRS += runtime
 OPTIONAL_DIRS = projects
+endif
 
 include $(LEVEL)/Makefile.common
 
@@ -22,15 +26,27 @@ distclean:: clean
 	                  $(LEVEL)/config.log \
 	                  $(LEVEL)/TAGS
 
-tools-only:
-	@for dir in lib/Support utils lib tools; do $(MAKE) -C $$dir; done
+tools-only: all
 
-AUTOCONF = autoconf
-AUTOHEADER = autoheader
+# Install support for llvm include files:
+.PHONY: install-includes
 
-configure: autoconf/configure.ac autoconf/aclocal.m4
-	cd autoconf && $(AUTOCONF) -o ../configure configure.ac
+install-includes:
+	$(MKDIR) $(DESTDIR)$(includedir)/llvm
+	cd include && find * -path '*/Internal' -prune -o '(' '!' '(' -name '*~' -o -name .cvsignore ')' -print ')' | grep -v CVS | pax -rwdvpe $(DESTDIR)$(includedir)/llvm
+ifneq ($(BUILD_SRC_ROOT),$(BUILD_OBJ_ROOT))
+	cd $(BUILD_SRC_ROOT)/include && find * -path '*/Internal' -prune -o '(' '!' '(' -name '*~' -o -name .cvsignore ')' -print ')' | grep -v CVS | pax -rwdvpe $(DESTDIR)$(includedir)/llvm
+endif
 
-include/Config/config.h.in: autoconf/configure.ac autoconf/aclocal.m4
-	$(AUTOHEADER) -I autoconf autoconf/configure.ac
+install:: install-includes
+
+# Build tags database for Emacs/Xemacs:
+.PHONY: tags
+
+TAGS: tags
+
+all::
+
+tags:
+	find $(wildcard $(SourceDir)/include $(SourceDir)/lib $(SourceDir)/tools) -name '*.cpp' -o -name '*.h' | $(ETAGS) $(ETAGSFLAGS) -
 

llvm/Makefile.common

@@ -1,11 +1,11 @@
-#===-- Makefile.common - Common make rules for LLVM -------*- makefile -*--====
+#===-- Makefile.common - Common make rules for LLVM --------*- Makefile -*--===#
 # 
 #                     The LLVM Compiler Infrastructure
 #
 # This file was developed by the LLVM research group and is distributed under
 # the University of Illinois Open Source License. See LICENSE.TXT for details.
 # 
-##===----------------------------------------------------------------------===##
+#===------------------------------------------------------------------------===#
 #
 # This file is included by all of the LLVM makefiles.  This file defines common
 # rules to do things like compile a .cpp file or generate dependency info.

llvm/Makefile.config.in

@@ -1,103 +1,84 @@
-#===-- Makefile.config - Local configuration for LLVM ------*- makefile -*--====
+#===-- Makefile.config - Local configuration for LLVM ------*- Makefile -*--===#
+#
+#                     The LLVM Compiler Infrastructure
+#
+# This file was developed by the LLVM research group and is distributed under
+# the University of Illinois Open Source License. See LICENSE.TXT for details.
+# 
+#===------------------------------------------------------------------------===#
 #
 # This file is included by Makefile.common.  It defines paths and other
 # values specific to a particular installation of LLVM.
-#===-----------------------------------------------------------------------====
+#
+#===------------------------------------------------------------------------===#
 
-#
 # Target operating system for which LLVM will be compiled.
-#
 OS=@OS@
 
-#
 # Target hardware architecture
-#
 ARCH=@ARCH@
 
+# Endian-ness of the target
+ENDIAN=@ENDIAN@
+
 # Path to the C++ compiler to use.  This is an optional setting, which defaults
 # to whatever your gmake defaults to.
-#
-# Under Linux, for some reason the compiler driver wants to search the PATH to
-# find the system assembler, which breaks if the LLVM assembler is in our path.
-# Hack it to use the assembler in /usr/bin directly.
-#
 CXX = @CXX@
 
-# We have the same problem with the CC binary, which use used by testcases for
-# native builds.
-#
+# Path to the CC binary, which use used by testcases for native builds.
 CC := @CC@
 
-#
-# Compilation flags for the C and C++ compilers.
-#
+# Path to the Python interpreter
+PYTHON := @PYTHON@
 
-#
-# Removing the compiler flags for now.  They interfere with the test suite
-# (which has its own autoconf stuff), and we don't use -DHAVE_CONFIG_H anyway.
-#
-#CPPFLAGS+=@DEFS@
-#CCFLAGS+=@DEFS@
+# Linker flags.
 LDFLAGS+=@LDFLAGS@
 
-#
-# Removed since it prevents the tests from working properly.
-#
-#LIBS+=@LIBS@
-
-#
 # Libraries needed by tools
-#
 TOOLLINKOPTS=@LIBS@
 
-#
-# Path to the archiver program.
-#
+# Path to the library archiver program.
 AR_PATH = @AR@
 
-#
 # The pathnames of the Flex and Bison programs, respectively.
-#
-BISON    = @YACC@
+YACC     = @YACC@
+BISON    = @BISON@
 FLEX     = @LEX@
 
-#
 # Paths to miscellaneous programs.
-#
-RPWD    = @RPWD@
-SED     = @SED@
-RM      = @RM@
-ECHO    = @ECHO@
+RPWD    = pwd
+SED     = sed
+RM      = rm
+ECHO    = echo
 MKDIR   = @abs_top_srcdir@/autoconf/mkinstalldirs
-DATE    = @DATE@
-MV      = @MV@
+DATE    = date
+MV      = mv
 INSTALL = @INSTALL@
 DOT     = @DOT@
 ETAGS   = @ETAGS@
+ETAGSFLAGS = @ETAGSFLAGS@
 
-#
 # Determine the target for which LLVM should generate code.
-#
 LLVMGCCARCH := @target@/3.4-llvm
 
+# Full pathnames of LLVM C/C++ front-end 'cc1' and 'cc1plus' binaries:
+LCC1 = @LLVMCC1@
+LCC1XX = @LLVMCC1PLUS@
+
 # Path to directory where object files should be stored during a build.
 # Set OBJ_ROOT to "." if you do not want to use a separate place for
 # object files.
-# 
-#OBJ_ROOT = .
 OBJ_ROOT := .
 
-# Path to location for LLVM front-end this should only be specified here if you
-# want to override the value set in Makefile.$(uname)
-#
+# Path to location for LLVM C/C++ front-end. You can modify this if you
+# want to override the value set by configure.
 LLVMGCCDIR := @LLVMGCCDIR@
 
-# When this setting is set to true, programs in the llvm/test/Programs hierarchy
+# When this variable is set to 1, programs in the llvm/test/Programs hierarchy
 # are not recompiled from source code.  Instead, the bytecode for the file is
 # pulled from the BYTECODE_REPOSITORY directory.  This can be useful when disk
 # space is limited or when you just don't want to spend time running the C
 # frontend.
-#
 #USE_PRECOMPILED_BYTECODE := 1
 @UPB@
 
@@ -105,71 +86,54 @@ LLVMGCCDIR := @LLVMGCCDIR@
 # versions of the test/Programs/* programs.  This is used as the bytecode source
 # when USE_PRECOMPILED_BYTECODE is specified or when source code is not
 # available for the program (such as SPEC).
-#
 BYTECODE_REPOSITORY := @BCR@
 
-# Path to location for purify, this is only needed if you build with
-# ENABLE_PURIFY=1
-# 
-PURIFY = @PURIFY@
-
-#
 # SPEC benchmarks:
-#	Set the USE_SPEC variable to enable the use of the SPEC benchmarks.
+#	If these are set then run the SPEC benchmarks.
 #	You must provide the SPEC benchmarks on your own.
-#
-@USE_SPEC@
+@USE_SPEC2000@
+@USE_SPEC95@
 
-#
-# Path to the SPEC benchmarks.  If you have the SPEC benchmarks, place the
-# path here.
-#
-#SPEC_ROOT := /home/vadve/shared/benchmarks/speccpu2000/benchspec
-SPEC_ROOT := @SPEC_ROOT@
+# Path to the SPEC benchmarks.
+SPEC2000_ROOT := @SPEC2000_ROOT@
+SPEC95_ROOT := @SPEC95_ROOT@
+
+# Path to the Povray source code.
+@USE_POVRAY@
+POVRAY_ROOT := @POVRAY_ROOT@
 
-#
 # Path to the PAPI code.  This is used by the reoptimizer only.
-#
 #PAPIDIR := /home/vadve/shared/papi-2.3.4.1
 PAPIDIR := @PAPIDIR@
 
 # These are options that can either be enabled here, or can be enabled on the
-# make command line (ie, make ENABLE_PROFILING=1)
-#
+# make command line (ie, make ENABLE_PROFILING=1):
 
 # When ENABLE_OPTIMIZED is enabled, Release builds of all of the LLVM code are
 # turned on, and Debug builds are turned off.
-#
 #ENABLE_OPTIMIZED = 1
 @ENABLE_OPTIMIZED@
 
 # When ENABLE_PROFILING is enabled, the llvm source base is built with profile
 # information to allow gprof to be used to get execution frequencies.
-#
 #ENABLE_PROFILING = 1
 
-#
 # This option tells the Makefiles to produce verbose output.
 # It essentially prints the commands that make is executing
-#
 #VERBOSE = 1
 
-# When ENABLE_PURIFY is set to 1, the LLVM tools are linked with purify (which
-# must be locally installed) to allow for some automated memory error debugging.
-#
-#ENABLE_PURIFY = 1
-@ENABLE_PURIFY@
-
-#
 # Enable JIT for this platform
-#
 @JIT@
 
-#
 # Disable LLC diffs for testing.
-#
 @DISABLE_LLC_DIFFS@
 
+# Shared library extension for this platform.
+SHLIBEXT = @SHLIBEXT@
+
+# Executable file extension for this platform.
+EXEEXT = @EXEEXT@
+
 ###########################################################################
 # Directory Configuration
 #	This section of the Makefile determines what is where.  To be
@@ -186,37 +150,27 @@ PAPIDIR := @PAPIDIR@
 #
 ###########################################################################
 
-#
 # Set the object build directory.  By default, it is the current directory.
-#
 ifndef BUILD_OBJ_DIR
 BUILD_OBJ_DIR := $(subst //,/,$(shell $(RPWD)))
 endif
 
-#
 # Set the root of the object directory.
-#
 ifndef BUILD_OBJ_ROOT
 BUILD_OBJ_ROOT := $(subst //,/,$(shell cd $(BUILD_OBJ_DIR)/$(LEVEL); $(RPWD)))
 endif
 
-#
 # Set the source build directory.  That is almost always the current directory.
-#
 ifndef BUILD_SRC_DIR
 BUILD_SRC_DIR := $(subst //,/,@abs_top_srcdir@/$(patsubst $(BUILD_OBJ_ROOT)%,%,$(BUILD_OBJ_DIR)))
 endif
 
-#
 # Set the source root directory.
-#
 ifndef BUILD_SRC_ROOT
 BUILD_SRC_ROOT := $(subst //,/,@abs_top_srcdir@)
 endif
 
-#
 # Set the LLVM object directory.
-#
 ifndef LLVM_OBJ_ROOT
 ifdef LLVM_SRC_ROOT
 LLVM_OBJ_ROOT := $(shell cd $(LLVM_SRC_ROOT); $(RPWD))
@@ -225,18 +179,34 @@ LLVM_OBJ_ROOT := $(BUILD_OBJ_ROOT)
 endif
 endif
 
-#
 # Set the LLVM source directory.
 # It is typically the root directory of what we're compiling now.
-#
 ifndef LLVM_SRC_ROOT
 LLVM_SRC_ROOT := $(BUILD_SRC_ROOT)
 endif
 
-#
 # Set SourceDir for backwards compatbility.
-#
 ifndef SourceDir
 SourceDir=$(BUILD_SRC_DIR)
 endif
 
+# Installation directories, as provided by the configure script.
+exec_prefix = @exec_prefix@
+prefix = @prefix@
+program_transform_name = @program_transform_name@
+bindir = @bindir@
+sbindir = @sbindir@
+libexecdir = @libexecdir@
+datadir = @datadir@
+sysconfdir = @sysconfdir@
+sharedstatedir = @sharedstatedir@ 
+localstatedir = @localstatedir@
+libdir = @libdir@
+bytecode_libdir = $(LLVMGCCDIR)/bytecode-libs
+includedir = @includedir@
+infodir = @infodir@
+mandir = @mandir@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_DATA = @INSTALL_DATA@
+

llvm/Makefile.rules

@@ -1,11 +1,11 @@
-#===-- Makefile.rules - Common make rules for LLVM -------*- makefile -*--====
+#===-- Makefile.rules - Common make rules for LLVM ---------*- Makefile -*--===#
 #
 #                     The LLVM Compiler Infrastructure
 #
 # This file was developed by the LLVM research group and is distributed under
 # the University of Illinois Open Source License. See LICENSE.TXT for details.
 # 
-##===----------------------------------------------------------------------===##
+#===------------------------------------------------------------------------===#
 #
 # This file is included by all of the LLVM makefiles.  This file defines common
 # rules to do things like compile a .cpp file or generate dependency info.
@@ -71,12 +71,14 @@ all::$(LLVM_OBJ_ROOT)/config.status
 ifdef SHARED_LIBRARY
 # if SHARED_LIBRARY is specified, the default is to build the dynamic lib
 all:: dynamic
+install:: install-dynamic-library
 endif
 
 ifdef BYTECODE_LIBRARY
 # if BYTECODE_LIBRARY is specified, the default is to build the bytecode lib
 all:: bytecodelib
-install:: bytecodelib-install
+install:: install-bytecode-library
+install-bytecode:: install-bytecode-library
 endif
 
 # Default Rule:  Make sure it's also a :: rule
@@ -91,6 +93,9 @@ test::
 # Default rule for building only bytecode.
 bytecode::
 
+# Default rule for installing only bytecode.
+install-bytecode::
+
 # Print out the directories used for building
 prdirs::
 	@${ECHO} "Build Source Root: " $(BUILD_SRC_ROOT)
@@ -108,7 +113,7 @@ prdirs::
 ###########################################################################
 .SUFFIXES:
 .SUFFIXES: .c .cpp .h .hpp .y .l
-.SUFFIXES: .lo .o .a .so .bc .td
+.SUFFIXES: .lo .o .a $(SHLIBEXT) .bc .td
 .SUFFIXES: .ps .dot .d
 
 #
@@ -116,7 +121,7 @@ prdirs::
 # slightly since GNU Make will not try to find implicit rules for targets
 # which are marked as Phony.
 #
-.PHONY: all dynamic bytecodelib bytecodelib-install
+.PHONY: all dynamic bytecodelib install-bytecode-library
 .PHONY: clean distclean install test bytecode prdirs
 
 ###########################################################################
@@ -129,10 +134,6 @@ prdirs::
 # Variables derived from configuration options... 
 #--------------------------------------------------------------------
 
-#BinInstDir=/usr/local/bin
-#LibInstDir=/usr/local/lib/xxx
-#DocInstDir=/usr/doc/xxx
-
 BURG_OPTS = -I
 
 ifdef ENABLE_PROFILING
@@ -243,23 +244,36 @@ endif
 #--------------------------------------------------------------------------
 # Utilities used while building the LLVM tree, which live in the utils dir
 #
-BURG    := $(LLVMTOOLCURRENT)/burg
+BURG       := $(LLVMTOOLCURRENT)/burg$(EXEEXT)
 RunBurg    := $(BURG) $(BURG_OPTS)
-TBLGEN  := $(LLVMTOOLCURRENT)/tblgen
+TBLGEN     := $(LLVMTOOLCURRENT)/tblgen$(EXEEXT)
+LGCCLDPROG := $(LLVMTOOLCURRENT)/gccld$(EXEEXT)
 
 #--------------------------------------------------------------------------
 # The LLVM GCC front-end in C and C++ flavors
 #
 LLVMGCC := PATH=$(LLVMTOOLCURRENT):$(PATH) $(LLVMGCCDIR)/bin/gcc
-LCC1    := $(LLVMGCCDIR)/libexec/gcc/$(LLVMGCCARCH)/cc1
 LLVMGXX := PATH=$(LLVMTOOLCURRENT):$(PATH) $(LLVMGCCDIR)/bin/g++
-LCC1XX  := $(LLVMGCCDIR)/libexec/gcc/$(LLVMGCCARCH)/cc1plus
 
 #--------------------------------------------------------------------------
-# Some of the compiled LLVM tools which are used for compilation of runtime
-# libraries.
+# The compiled LLVM tools
 #
-LLVMAS  := $(LLVMTOOLCURRENT)/llvm-as
+
+LLVMAS  := $(LLVMTOOLCURRENT)/llvm-as$(EXEEXT)
+# Find the location of the platform specific LLVM GCC libraries
+LLVMGCCLIBDIR=$(dir $(shell $(LLVMGCC) -print-file-name=libgcc.a))
+# LLVM Tool Definitions (LLVMGCC, LLVMGXX, LLVMAS are provided by
+# Makefile.rules) 
+LLI       = $(LLVMTOOLCURRENT)/lli$(EXEEXT)
+LLC       = $(LLVMTOOLCURRENT)/llc$(EXEEXT)
+LGCCAS    = $(LLVMTOOLCURRENT)/gccas$(EXEEXT)
+LGCCLD    = $(LGCCLDPROG) -L$(LLVMGCCLIBDIR) -L$(LLVMGCCDIR)/lib
+LDIS      = $(LLVMTOOLCURRENT)/llvm-dis$(EXEEXT)
+LOPT      = $(LLVMTOOLCURRENT)/opt$(EXEEXT)
+LLINK     = $(LLVMTOOLCURRENT)/llvm-link$(EXEEXT)
+LPROF     = $(LLVMTOOLCURRENT)/llvm-prof$(EXEEXT)
+LANALYZE  = $(LLVMTOOLCURRENT)/analyze$(EXEEXT)
+LBUGPOINT = $(LLVMTOOLCURRENT)/bugpoint$(EXEEXT)
 
 
 ###########################################################################
@@ -288,17 +302,21 @@ STRIP = $(PLATFORMSTRIPOPTS)
 STRIP_WARN_MSG = "(without symbols)"
 endif
 
-# Allow gnu extensions...
+# Allow GNU extensions:
 CPPFLAGS += -D_GNU_SOURCE
+# Pull in limit macros from stdint.h, even in C++:
+CPPFLAGS += -D__STDC_LIMIT_MACROS
 
-CompileWarnings  := -Wall -W  -Wwrite-strings -Wno-unused
-CompileCommonOpts := $(CompileWarnings) -fshort-enums
+### FIXME: this is GCC specific
+CPPFLAGS += -DATTR_DEPRECATED='__attribute__ ((deprecated))'
+
+CompileCommonOpts := -Wall -W -Wwrite-strings -Wno-unused
 CompileOptimizeOpts := -O3 -DNDEBUG -finline-functions
 
 #
 # Compile commands with libtool.
 #
-Compile  := $(LIBTOOL) --mode=compile $(CXX) -c $(CPPFLAGS) $(CXXFLAGS) $(CompileCommonOpts)
+Compile  := $(LIBTOOL) --tag=CXX --mode=compile $(CXX) -c $(CPPFLAGS) $(CXXFLAGS) $(CompileCommonOpts)
 CompileC  := $(LIBTOOL) --mode=compile $(CC) -c $(CPPFLAGS) $(CFLAGS) $(CompileCommonOpts)
 
 # Compile a cpp file, don't link...
@@ -319,15 +337,25 @@ CompileCP := $(CompileC) $(CompileOptimizeOpts) $(PROFILE)
 # Link final executable
 #	(Note that we always link with the C++ compiler).
 #
-Link     := $(LIBTOOL) --mode=link $(CXX)
+Link     := $(LIBTOOL) --tag=CXX --mode=link $(CXX)
 
 # link both projlib and llvmlib libraries
 LinkG    := $(Link) -g -L$(PROJLIBDEBUGSOURCE)  -L$(LLVMLIBDEBUGSOURCE) $(STRIP)
 LinkO    := $(Link) -O3 -L$(PROJLIBRELEASESOURCE) -L$(LLVMLIBRELEASESOURCE)
 LinkP    := $(Link) -O3 -L$(PROJLIBPROFILESOURCE) -L$(LLVMLIBPROFILESOURCE) $(PROFILE)
 
+# TOOLLINKOPTSB to pass options to the linker like library search path etc
+# Note that this is different from TOOLLINKOPTS, these options
+# are passed to the linker *before* the USEDLIBS options are passed.
+# e.g. usage TOOLLINKOPTSB =  -L/home/xxx/lib
+ifdef TOOLLINKOPTSB
+LinkG    := $(LinkG) $(TOOLLINKOPTSB) 
+LinkO    := $(LinkO) $(TOOLLINKOPTSB) 
+LinkP    := $(LinkP) $(TOOLLINKOPTSB) 
+endif
+
 # Create one .o file from a bunch of .o files...
-Relink := ${LIBTOOL} --mode=link $(CXX)
+Relink := ${LIBTOOL} --tag=CXX --mode=link $(CXX)
 
 #
 # Configure where the item being compiled should go.
@@ -345,7 +373,7 @@ Depend   := $(CXX) -MM -I$(LEVEL)/include $(CPPFLAGS)
 DependC  := $(CC)  -MM -I$(LEVEL)/include $(CPPFLAGS) 
 
 # Archive a bunch of .o files into a .a file...
-AR       = ${AR_PATH} cq 
+AR       = $(AR_PATH) cr
 
 #----------------------------------------------------------
 
@@ -355,18 +383,18 @@ AR       = ${AR_PATH} cq
 # 
 ifndef Source
 Source  := $(notdir $(ExtraSource) $(wildcard $(SourceDir)/*.cpp \
-                    $(SourceDir)/*.c $(SourceDir)/*.y $(SourceDir)/*.l))
+                    $(SourceDir)/*.cc $(SourceDir)/*.c $(SourceDir)/*.y \
+                    $(SourceDir)/*.l))
 endif
 
 #
 # Libtool Objects
 #
 Srcs := $(sort $(basename $(Source)))
-Objs := $(addsuffix .lo, $(Srcs))
-ObjectsO := $(addprefix $(BUILD_OBJ_DIR)/Release/,$(Objs))
-ObjectsP := $(addprefix $(BUILD_OBJ_DIR)/Profile/,$(Objs))
-ObjectsG := $(addprefix $(BUILD_OBJ_DIR)/Debug/,$(Objs))
-ObjectsBC := $(addprefix $(BUILD_OBJ_DIR)/BytecodeObj/,$(addsuffix .bc, $(Srcs)))
+ObjectsO  := $(Srcs:%=$(BUILD_OBJ_DIR)/Release/%.lo)
+ObjectsP  := $(Srcs:%=$(BUILD_OBJ_DIR)/Profile/%.lo)
+ObjectsG  := $(Srcs:%=$(BUILD_OBJ_DIR)/Debug/%.lo)
+ObjectsBC := $(Srcs:%=$(BUILD_OBJ_DIR)/BytecodeObj/%.bc)
 
 #
 # The real objects underlying the libtool objects
@@ -381,9 +409,14 @@ RObjectsG := $(addprefix $(BUILD_OBJ_DIR)/Debug/,$(RObjs))
 #---------------------------------------------------------
 
 ifdef DIRS
-all install clean test bytecode ::
+all install clean test bytecode stripped-bytecode install-bytecode::
 	$(VERB) for dir in ${DIRS}; do \
-		(cd $$dir; $(MAKE) $@) || exit 1; \
+		if [ ! -f $$dir/Makefile ]; \
+		then \
+			$(MKDIR) $$dir; \
+			cp $(SourceDir)/$$dir/Makefile $$dir/Makefile; \
+		fi; \
+		($(MAKE) -C $$dir $@ $(MFLAGS)) || exit 1; \
 	done
 endif
 
@@ -394,18 +427,30 @@ install  :: $(addsuffix /.makeinstall , $(PARALLEL_DIRS))
 clean    :: $(addsuffix /.makeclean   , $(PARALLEL_DIRS))
 test     :: $(addsuffix /.maketest    , $(PARALLEL_DIRS))
 bytecode :: $(addsuffix /.makebytecode, $(PARALLEL_DIRS))
+stripped-bytecode :: $(addsuffix /.makestripped-bytecode, $(PARALLEL_DIRS))
+install-bytecode :: $(addsuffix /.makeinstall-bytecode, $(PARALLEL_DIRS))
 
-%/.makeall %/.makeinstall %/.makeclean %/.maketest %/.makebytecode:
-	$(VERB) cd $(@D); $(MAKE) $(subst $(@D)/.make,,$@)
+%/.makeall %/.makeinstall %/.makeclean %/.maketest %/.makebytecode %/.makestripped-bytecode %/.makeinstall-bytecode:
+	$(VERB) if [ ! -f $(@D)/Makefile ]; \
+	then \
+		$(MKDIR) $(@D); \
+		cp $(SourceDir)/$(@D)/Makefile $(@D)/Makefile; \
+	fi; \
+	$(MAKE) -C $(@D) $(subst $(@D)/.make,,$@) $(MFLAGS)
 endif
 
 # Handle directories that may or may not exist
 ifdef OPTIONAL_DIRS
-all install clean test bytecode ::
+all install clean test bytecode stripped-bytecode install-bytecode::
 	$(VERB) for dir in ${OPTIONAL_DIRS}; do \
-		if [ -d $$dir ]; \
+		if [ -d $(SourceDir)/$$dir ]; \
 		then\
-			(cd $$dir; $(MAKE) $@) || exit 1; \
+			if [ ! -f $$dir/Makefile ]; \
+			then \
+				$(MKDIR) $$dir; \
+				cp $(SourceDir)/$$dir/Makefile $$dir/Makefile; \
+			fi; \
+			($(MAKE) -C$$dir $@ $(MFLAGS)) || exit 1; \
 		fi \
 	done
 endif
@@ -431,44 +476,55 @@ endif
 #  of it.  For this reason, sometimes it's useful to use libraries as .a files.
 ###########################################################################
 
+# Install rule for making bytecode library directory if it does not exist.
+# Trigger this by making libraries that need to be installed here depend on it.
+$(DESTDIR)$(bytecode_libdir):
+	$(MKDIR) $@
+
 ifdef LIBRARYNAME
 
 # Make sure there isn't any extranous whitespace on the LIBRARYNAME option
 LIBRARYNAME := $(strip $(LIBRARYNAME))
 
-LIBNAME_O    := $(DESTLIBRELEASE)/lib$(LIBRARYNAME).so
-LIBNAME_P    := $(DESTLIBPROFILE)/lib$(LIBRARYNAME).so
-LIBNAME_G    := $(DESTLIBDEBUG)/lib$(LIBRARYNAME).so
+LIBNAME_O    := $(DESTLIBRELEASE)/lib$(LIBRARYNAME)$(SHLIBEXT)
+LIBNAME_P    := $(DESTLIBPROFILE)/lib$(LIBRARYNAME)$(SHLIBEXT)
+LIBNAME_G    := $(DESTLIBDEBUG)/lib$(LIBRARYNAME)$(SHLIBEXT)
+LIBNAME_CUR  := $(DESTLIBCURRENT)/lib$(LIBRARYNAME)$(SHLIBEXT)
 LIBNAME_AO   := $(DESTLIBRELEASE)/lib$(LIBRARYNAME).a
 LIBNAME_AP   := $(DESTLIBPROFILE)/lib$(LIBRARYNAME).a
 LIBNAME_AG   := $(DESTLIBDEBUG)/lib$(LIBRARYNAME).a
+LIBNAME_ACUR := $(DESTLIBCURRENT)/lib$(LIBRARYNAME).a
 LIBNAME_OBJO := $(DESTLIBRELEASE)/$(LIBRARYNAME).o
 LIBNAME_OBJP := $(DESTLIBPROFILE)/$(LIBRARYNAME).o
 LIBNAME_OBJG := $(DESTLIBDEBUG)/$(LIBRARYNAME).o
+LIBNAME_OBJCUR := $(DESTLIBCURRENT)/$(LIBRARYNAME).o
 LIBNAME_BC   := $(DESTLIBBYTECODE)/lib$(LIBRARYNAME).bc
 
+
 #--------------------------------------------------------------------
 # Library Targets
 #	Modify the top level targets to build the desired libraries.
 #--------------------------------------------------------------------
 
 # dynamic target builds a shared object version of the library...
-dynamic:: $(DESTLIBCURRENT)/lib$(LIBRARYNAME).so
+dynamic:: $(LIBNAME_CUR)
 bytecodelib:: $(LIBNAME_BC)
-bytecodelib-install:: $(LLVMGCCDIR)/bytecode-libs/lib$(LIBRARYNAME).bc
+install-bytecode-library:: $(DESTDIR)$(bytecode_libdir)/lib$(LIBRARYNAME).bc
 
-$(LLVMGCCDIR)/bytecode-libs/lib$(LIBRARYNAME).bc: $(LIBNAME_BC)
+$(DESTDIR)$(bytecode_libdir)/lib$(LIBRARYNAME).bc: $(LIBNAME_BC) $(DESTDIR)$(bytecode_libdir)
 	@${ECHO} ======= Installing $(LIBRARYNAME) bytecode library =======
 	cp $< $@
 
 # Does the library want a .o version built?
 ifndef DONT_BUILD_RELINKED
-all:: $(DESTLIBCURRENT)/$(LIBRARYNAME).o
+all:: $(LIBNAME_OBJCUR)
+install:: install-single-object-library
 endif
 
 # Does the library want an archive version built?
 ifdef BUILD_ARCHIVE
-all:: $(DESTLIBCURRENT)/lib$(LIBRARYNAME).a
+all:: $(LIBNAME_ACUR)
+install:: install-archive-library
 endif
 
 #--------------------------------------------------------------------
@@ -489,44 +545,58 @@ endif
 
 # Rule for building bytecode libraries.
 $(LIBNAME_BC): $(ObjectsBC) $(LibSubDirs) $(DESTLIBBYTECODE)/.dir
-	@${ECHO} ======= Linking $(LIBRARYNAME) bytecode library =======
+	@${ECHO} Linking $(LIBRARYNAME) bytecode library
 	$(VERB) $(LinkBCLib) -o $@ $(ObjectsBC) $(LibSubDirs) $(LibLinkOpts)
+	@${ECHO} ======= Finished building $(LIBRARYNAME) bytecode library =======
 #
 # Rules for building dynamically linked libraries.
 #
 $(LIBNAME_O): $(ObjectsO) $(LibSubDirs) $(DESTLIBRELEASE)/.dir
-	@${ECHO} ======= Linking $(LIBRARYNAME) dynamic release library =======
+	@${ECHO} Linking $(LIBRARYNAME) dynamic release library
 	$(VERB) $(Link) -o $*.la $(ObjectsO) $(LibSubDirs) $(LibLinkOpts)
 	$(VERB) $(LIBTOOL) --mode=install $(INSTALL) $*.la $(DESTLIBCURRENT)
+	@${ECHO} ======= Finished building $(LIBRARYNAME) dynamic release library =======
 
 $(LIBNAME_P): $(ObjectsP) $(LibSubDirs) $(DESTLIBPROFILE)/.dir
-	@${ECHO} ======= Linking $(LIBRARYNAME) dynamic profile library =======
+	@${ECHO} Linking $(LIBRARYNAME) dynamic profile library
 	$(VERB) $(Link) -o $*.la $(ObjectsP) $(LibSubDirs) $(LibLinkOpts)
 	$(VERB) $(LIBTOOL) --mode=install $(INSTALL) $*.la $(DESTLIBCURRENT)
+	@${ECHO} ======= Finished building $(LIBRARYNAME) dynamic profile library =======
 
 $(LIBNAME_G): $(ObjectsG) $(LibSubDirs) $(DESTLIBDEBUG)/.dir
-	@${ECHO} ======= Linking $(LIBRARYNAME) dynamic debug library =======
+	@${ECHO} Linking $(LIBRARYNAME) dynamic debug library
 	$(VERB) $(Link) -o $*.la $(ObjectsG) $(LibSubDirs) $(LibLinkOpts)
 	$(VERB) $(LIBTOOL) --mode=install $(INSTALL) $*.la $(DESTLIBCURRENT)
+	@${ECHO} ======= Finished building $(LIBRARYNAME) dynamic debug library =======
+
+install-dynamic-library: $(LIBNAME_CUR)
+	$(MKDIR) $(DESTDIR)$(libdir)
+	$(VERB) $(LIBTOOL) --mode=install $(INSTALL) $(LIBNAME_CUR) $(DESTDIR)$(libdir)/lib$(LIBRARYNAME)$(SHLIBEXT)
 
 #
 # Rules for building static archive libraries.
 #
 $(LIBNAME_AO): $(ObjectsO) $(LibSubDirs) $(DESTLIBRELEASE)/.dir
-	@${ECHO} ======= Linking $(LIBRARYNAME) archive release library =======
+	@${ECHO} Linking $(LIBRARYNAME) archive release library
 	@$(RM) -f $@
 	$(VERB) $(Link) -03 -o $@ $(ObjectsO) $(LibSubDirs) -static
+	@${ECHO} Finished building $(LIBRARYNAME) archive release library =======
 
 $(LIBNAME_AP): $(ObjectsP) $(LibSubDirs) $(DESTLIBPROFILE)/.dir
-	@${ECHO} ======= Linking $(LIBRARYNAME) archive profile library =======
+	@${ECHO} Linking $(LIBRARYNAME) archive profile library
 	@$(RM) -f $@
 	$(VERB) $(Link) -03 $(PROFILE) -o $@ $(ObjectsP) $(LibSubDirs) -static
+	@${ECHO} ======= Finished building $(LIBRARYNAME) archive profile library =======
 
 $(LIBNAME_AG): $(ObjectsG) $(LibSubDirs) $(DESTLIBDEBUG)/.dir
-	@${ECHO} ======= Linking $(LIBRARYNAME) archive debug library =======
+	@${ECHO} Linking $(LIBRARYNAME) archive debug library
 	@$(RM) -f $@
 	$(VERB) $(Link) -g $(STRIP) -o $@ $(ObjectsG) $(LibSubDirs) -static
+	@${ECHO} ======= Finished building $(LIBRARYNAME) archive debug library =======
 
+install-archive-library: $(LIBNAME_ACUR)
+	$(MKDIR) $(DESTDIR)$(libdir)
+	$(VERB) $(LIBTOOL) --mode=install $(INSTALL) $(LIBNAME_ACUR) $(DESTDIR)$(libdir)/lib$(LIBRARYNAME).a
 
 #
 # Rules for building .o libraries.
@@ -554,23 +624,10 @@ $(LIBNAME_OBJG): $(ObjectsG) $(LibSubDirs) $(DESTLIBDEBUG)/.dir
 	@${ECHO} "Linking `basename $@`"
 	$(VERB) $(Relink) -o $@ $(RObjectsG) $(LibSubDirs)
 
-endif
+install-single-object-library: $(LIBNAME_OBJCUR)
+	$(MKDIR) $(DESTDIR)$(libdir)
+	$(VERB) $(LIBTOOL) --mode=install $(INSTALL) $(LIBNAME_OBJCUR) $(DESTDIR)$(libdir)/$(LIBRARYNAME).o
 
-#------------------------------------------------------------------------
-# Create a TAGS database for emacs
-#------------------------------------------------------------------------
-
-ifneq ($(ETAGS),false)
-ifeq ($(LEVEL), .)
-SRCDIRS := $(wildcard $(SourceDir)/include $(SourceDir)/lib $(SourceDir)/tools)
-
-tags:
-	$(ETAGS) -l c++ `find $(SRCDIRS) -name '*.cpp' -o -name '*.h'`
-all:: tags
-endif
-else
-tags:
-	${ECHO} "Cannot build $@: The program etags is not installed"
 endif
 
 #------------------------------------------------------------------------
@@ -636,16 +693,23 @@ clean::
 	$(VERB) $(RM) -f $(TOOLEXENAMES)
 
 $(TOOLEXENAME_G): $(ObjectsG) $(USED_LIB_PATHS_G) $(DESTTOOLDEBUG)/.dir
-	@${ECHO} ======= Linking $(TOOLNAME) debug executable $(STRIP_WARN_MSG) =======
+	@${ECHO} Linking $(TOOLNAME) debug executable $(STRIP_WARN_MSG)
 	$(VERB) $(LinkG) -o $@ $(ObjectsG) $(LIB_OPTS_G) $(LINK_OPTS) $(LIBS)
+	@${ECHO} ======= Finished building $(TOOLNAME) debug executable $(STRIP_WARN_MSG) =======
 
 $(TOOLEXENAME_O): $(ObjectsO) $(USED_LIB_PATHS_O) $(DESTTOOLRELEASE)/.dir
-	@${ECHO} ======= Linking $(TOOLNAME) release executable =======
+	@${ECHO} Linking $(TOOLNAME) release executable
 	$(VERB) $(LinkO) -o $@ $(ObjectsO) $(LIB_OPTS_O) $(LINK_OPTS) $(LIBS)
+	@${ECHO} ======= Finished building $(TOOLNAME) release executable =======
 
 $(TOOLEXENAME_P): $(ObjectsP) $(USED_LIB_PATHS_P) $(DESTTOOLPROFILE)/.dir
-	@${ECHO} ======= Linking $(TOOLNAME) profile executable =======
+	@${ECHO} Linking $(TOOLNAME) profile executable
 	$(VERB) $(LinkP) -o $@ $(ObjectsP) $(LIB_OPTS_P) $(LINK_OPTS) $(LIBS)
+	@${ECHO} ======= Finished building $(TOOLNAME) profile executable =======
+
+install:: $(TOOLEXENAMES)
+	$(MKDIR) $(DESTDIR)$(bindir)
+	$(LIBTOOL) --mode=install $(INSTALL_PROGRAM) -c -m 0755 $(TOOLEXENAMES) $(DESTDIR)$(bindir)/$(TOOLNAME)
 
 endif
 
@@ -654,6 +718,7 @@ endif
 #---------------------------------------------------------
 .PRECIOUS: $(BUILD_OBJ_DIR)/Depend/.dir $(BUILD_OBJ_DIR)/BytecodeObj/.dir
 .PRECIOUS: $(BUILD_OBJ_DIR)/Debug/.dir $(BUILD_OBJ_DIR)/Release/.dir
+.PRECIOUS: $(BUILD_OBJ_DIR)/Profile/.dir
 
 # Create .lo files in the ObjectFiles directory from the .cpp and .c files...
 $(BUILD_OBJ_DIR)/Release/%.lo: %.cpp $(BUILD_OBJ_DIR)/Release/.dir
@@ -682,11 +747,11 @@ $(BUILD_OBJ_DIR)/Debug/%.lo: %.c $(BUILD_OBJ_DIR)/Debug/.dir
 
 $(BUILD_OBJ_DIR)/BytecodeObj/%.bc: %.cpp $(BUILD_OBJ_DIR)/BytecodeObj/.dir $(LCC1XX)
 	@${ECHO} "Compiling `basename $<` to bytecode"
-	$(VERB) $(LLVMGXX) $(CompileWarnings) $(CPPFLAGS) -c $< -o $@
+	$(VERB) $(LLVMGXX) $(CompileCommonOpts) $(CPPFLAGS) -c $< -o $@
 
 $(BUILD_OBJ_DIR)/BytecodeObj/%.bc: %.c $(BUILD_OBJ_DIR)/BytecodeObj/.dir $(LCC1)
 	@${ECHO} "Compiling `basename $<` to bytecode"
-	$(VERB) $(LLVMGCC) $(CompileWarnings) $(CPPFLAGS) -c $< -o $@
+	$(VERB) $(LLVMGCC) $(CompileCommonOpts) $(CPPFLAGS) -c $< -o $@
 
 $(BUILD_OBJ_DIR)/BytecodeObj/%.bc: %.ll $(BUILD_OBJ_DIR)/BytecodeObj/.dir $(LLVMAS)
 	@${ECHO} "Compiling `basename $<` to bytecode"
@@ -726,7 +791,7 @@ YACC_OUTPUT = $(addprefix $(YACC_FILES:%.y=%), .h .cpp .output)
 %.c: %.y     # Cancel built-in rules for yacc
 %.h: %.y     # Cancel built-in rules for yacc
 %.cpp %.h : %.y
-	@${ECHO} Bisoning $<
+	@${ECHO} "Bisoning `basename $<`"
 	$(VERB) $(BISON) -v -d -p $(<F:%Parser.y=%) -o $*.tab.c  $<
 	$(VERB) cmp -s $*.tab.c $*.cpp > /dev/null || ${MV} -f $*.tab.c $*.cpp
 	$(VERB) cmp -s $*.tab.h $*.h   > /dev/null || ${MV} -f $*.tab.h $*.h
@@ -759,7 +824,10 @@ clean::
 	$(VERB) $(RM) -rf $(BUILD_OBJ_DIR)/Debug $(BUILD_OBJ_DIR)/Release
 	$(VERB) $(RM) -rf $(BUILD_OBJ_DIR)/Profile $(BUILD_OBJ_DIR)/Depend
 	$(VERB) $(RM) -rf $(BUILD_OBJ_DIR)/BytecodeObj
-	$(VERB) $(RM) -f core core.[0-9][0-9]* *.o *.d *.so *~ *.flc
+	$(VERB) $(RM) -f core core.[0-9][0-9]* *.o *.d *~ *.flc
+ifneq ($(strip $(SHLIBEXT)),) # Extra paranoia - make real sure SHLIBEXT is set
+	$(VERB)	$(RM) -f *$(SHLIBEXT)
+endif
 	$(VERB) $(RM) -f $(LEX_OUTPUT) $(YACC_OUTPUT)
 
 ###########################################################################
@@ -778,11 +846,11 @@ SourceDepend := $(SourceBaseNames:%=$(BUILD_OBJ_DIR)/Depend/%.d)
 
 # Create dependencies for the *.cpp files...
 $(BUILD_OBJ_DIR)/Depend/%.d: %.cpp $(BUILD_OBJ_DIR)/Depend/.dir
-	$(VERB) $(Depend) $< | $(SED) 's|\.o|\.lo|' | $(SED) 's|$*\.lo *|$(BUILD_OBJ_DIR)/Release/& $(BUILD_OBJ_DIR)/Profile/& $(BUILD_OBJ_DIR)/Debug/& $(BUILD_OBJ_DIR)/Depend/$(@F)|g' > $@
+	$(VERB) $(Depend) $< | $(SED) 's|\.o:|\.lo:|' | $(SED) 's|$*\.lo *|$(BUILD_OBJ_DIR)/Release/& $(BUILD_OBJ_DIR)/Profile/& $(BUILD_OBJ_DIR)/Debug/& $(BUILD_OBJ_DIR)/Depend/$(@F)|g' > $@
 
 # Create dependencies for the *.c files...
 $(BUILD_OBJ_DIR)/Depend/%.d: %.c $(BUILD_OBJ_DIR)/Depend/.dir
-	$(VERB) $(DependC) -o $@ $< | $(SED) 's|\.o|\.lo|' | $(SED) 's|$*\.lo *|$(BUILD_OBJ_DIR)/Release/& $(BUILD_OBJ_DIR)/Profile/& $(BUILD_OBJ_DIR)/Debug/& $(BUILD_OBJ_DIR)/Depend/$(@F)|g' > $@
+	$(VERB) $(DependC) -o $@ $< | $(SED) 's|\.o:|\.lo:|' | $(SED) 's|$*\.lo *|$(BUILD_OBJ_DIR)/Release/& $(BUILD_OBJ_DIR)/Profile/& $(BUILD_OBJ_DIR)/Debug/& $(BUILD_OBJ_DIR)/Depend/$(@F)|g' > $@
 
 #
 # Autoconf Dependencies.
@@ -794,6 +862,13 @@ $(LLVM_OBJ_ROOT)/config.status:: $(LLVM_SRC_ROOT)/configure
 	@${ECHO} "****************************************************************"
 	$(VERB) exit 1
 
+# If the Makefile in the source tree has been updated, copy it over into the
+# build tree.
+Makefile :: $(BUILD_SRC_DIR)/Makefile
+	@${ECHO} "===== Updating Makefile from source dir: `dirname $<` ====="
+	$(MKDIR) $(@D)
+	cp -f $< $@
+
 #
 # Include dependencies generated from C/C++ source files, but not if we
 # are cleaning (this example taken from the GNU Make Manual).

llvm/README.txt

@@ -1,106 +1 @@
-Welcome to LLVM!
-
-This file provides the location of all important LLVM documentation.  In
-particular, you should read the license information and the installation
-directions before you begin using LLVM.
-
-After that, there are several technical references that will help you use LLVM.
-Consult them as necessary.
-
-Finally, you can find information on how to communicate with the LLVM
-developers and LLVM community.  This is of primary interest if you wish to
-submit a bug, supply a patch, or just keep current with what's going on with
-LLVM.
-
-Introductory Literature:
-
-	LLVM Home Page:
-		http://llvm.cs.uiuc.edu
-
-	License Information:
-		llvm/LICENSE.txt
-
-	Release Notes:
-		llvm/docs/ReleaseNotes.html
-
-LLVM Design:
-
-	 The LLVM Instruction Set and Compilation Strategy:
-		http://llvm.cs.uiuc.edu/pubs/2002-08-09-LLVMCompilationStrategy.html
-
-LLVM User Guides:
-
-	Download and Installation Instructions:
-		llvm/docs/GettingStarted.html
-
-	LLVM Command Guide:
-		llvm/docs/CommandGuide/CommandGuide.html
-
-	LLVM Assembly Language:
-		llvm/docs/LangRef.html
-
-	LLVM Test Suite Guide:
-		llvm/docs/TestingGuide.html
-
-LLVM Programming Documentation:
-
-	LLVM Programmers Manual:
-		llvm/docs/ProgrammersManual.html
-
-	Writing an LLVM Pass:
-		llvm/docs/WritingAnLLVMPass.html
-
-	Alias Analysis in LLVM:
-		llvm/docs/AliasAnalysis.html
-
-	Command Line Library:
-		llvm/docs/CommandLine.html
-
-	Coding Standards:
-		llvm/docs/CodingStandards.html
-
-LLVM Community:
-
-	Submitting a Bug:
-		http://llvm.cs.uiuc.edu/docs/HowToSubmitABug.html
-
-	Open Projects:
-		llvm/docs/OpenProjects.html
-
-	Creating a new LLVM Project:
-		llvm/docs/Projects.html
-
-	Mailing Lists:
-		There are several mailing lists providing LLVM users with
-		information:
-
-			o LLVM Announcements List:
-			http://mail.cs.uiuc.edu/mailman/listinfo/llvm-announce
-
-				This is a low volume list that provides
-				important announcements regarding LLVM.  It is
-				primarily intended to announce new releases,
-				major updates to the software, etc.  This list
-				is highly recommended for anyone that uses LLVM.
-
-
-			o LLVM Developers List:
-			http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev
-
-				This list is for people who want to be included
-				in technical discussions of LLVM.  People post
-				to this list when they have questions about
-				writing code for or using the LLVM tools.  It
-				is low volume.
-
-			o LLVM Commits List
-			http://mail.cs.uiuc.edu/mailman/listinfo/llvm-commits
-
-				This list contains all commit messages that are
-				made when LLVM developers commit code changes
-				to the CVS archive.  It is useful for those who
-				want to stay on the bleeding edge of LLVM
-				development.
-
-				This list is very high volume.
-
+This file is a placeholder; see docs/index.html for documentation.

llvm/autoconf/AutoRegen.sh

@@ -0,0 +1,21 @@
+#!/bin/sh
+die () {
+	echo "$@" 1>&2
+	exit 1
+}
+test -d autoconf && test -f autoconf/configure.ac && cd autoconf
+[ -f configure.ac ] || die "Can't find 'autoconf' dir; please cd into it first"
+echo "Regenerating aclocal.m4 with aclocal"
+aclocal || die "aclocal failed"
+autoconf --version | egrep '2\.5[0-9]' > /dev/null
+if test $? -ne 0
+then
+	die "Your autoconf was not detected as being 2.5x"
+fi
+echo "Note: Warnings about 'AC_CONFIG_SUBDIRS: you should use literals' are ok"
+echo "Regenerating configure with autoconf 2.5x"
+autoconf -o ../configure configure.ac || die "autoconf failed"
+cd ..
+echo "Regenerating config.h.in with autoheader 2.5x"
+autoheader -I autoconf autoconf/configure.ac || die "autoheader failed"
+exit 0

llvm/autoconf/configure.ac

@@ -1,21 +1,5 @@
-dnl Autoconf requirements
-dnl AC_INIT(package, version, bug-report-address)
-dnl information on the package
-dnl checks for programs
-dnl checks for libraries
-dnl checks for header files
-dnl checks for types
-dnl checks for structures
-dnl checks for compiler characteristics
-dnl checks for library functions
-dnl checks for system services
-dnl AC_CONFIG_FILES([file...])
-dnl AC_OUTPUT
-
-dnl **************************************************************************
-dnl * Initialize
-dnl **************************************************************************
-AC_INIT([[[LLVM]]],[[[1.0]]],[llvmbugs@cs.uiuc.edu])
+dnl Initialize autoconf
+AC_INIT([[LLVM]],[[1.3]],[llvmbugs@cs.uiuc.edu])
 
 dnl Place all of the extra autoconf files into the config subdirectory
 AC_CONFIG_AUX_DIR([autoconf])
@@ -30,81 +14,43 @@ then
 	fi
 fi
 
-if test -d ${srcdir}/projects/sample
-then
-  AC_CONFIG_SUBDIRS(projects/sample)
-fi
+dnl Configure all of the projects present in our source tree.
+for i in `ls ${srcdir}/projects`
+do
+  if test ${i} != "CVS"
+  then
+    if test -f ${srcdir}/projects/${i}/configure
+    then
+      AC_CONFIG_SUBDIRS(projects/${i})
+    fi
+  fi
+done
 
-if test -d ${srcdir}/projects/reopt
-then
-  AC_CONFIG_SUBDIRS(projects/reopt)
-fi
-
-if test -d ${srcdir}/projects/poolalloc
-then
-  AC_CONFIG_SUBDIRS(projects/poolalloc)
-fi
-
-dnl Configure a header file
+dnl Configure header files
 AC_CONFIG_HEADERS(include/Config/config.h)
+
+dnl Configure other output file
+AC_CONFIG_FILES(Makefile.config
+ include/Support/DataTypes.h
+ include/Support/ThreadSupport.h
+ include/Support/hash_map
+ include/Support/hash_set
+ include/Support/iterator)
+
+dnl Do special configuration of Makefiles
 AC_CONFIG_MAKEFILE(Makefile)
 AC_CONFIG_MAKEFILE(Makefile.common)
-AC_CONFIG_MAKEFILE(Makefile.rules)
 AC_CONFIG_MAKEFILE(lib/Makefile)
-AC_CONFIG_MAKEFILE(lib/Analysis/Makefile)
-AC_CONFIG_MAKEFILE(lib/Analysis/DataStructure/Makefile)
-AC_CONFIG_MAKEFILE(lib/Analysis/IPA/Makefile)
-AC_CONFIG_MAKEFILE(lib/Analysis/LiveVar/Makefile)
-AC_CONFIG_MAKEFILE(lib/AsmParser/Makefile)
-AC_CONFIG_MAKEFILE(lib/Bytecode/Makefile)
-AC_CONFIG_MAKEFILE(lib/Bytecode/Reader/Makefile)
-AC_CONFIG_MAKEFILE(lib/Bytecode/Writer/Makefile)
-AC_CONFIG_MAKEFILE(lib/CWriter/Makefile)
-AC_CONFIG_MAKEFILE(lib/CodeGen/Makefile)
-AC_CONFIG_MAKEFILE(lib/CodeGen/InstrSched/Makefile)
-AC_CONFIG_MAKEFILE(lib/CodeGen/InstrSelection/Makefile)
-AC_CONFIG_MAKEFILE(lib/CodeGen/ModuloScheduling/Makefile)
-AC_CONFIG_MAKEFILE(lib/CodeGen/RegAlloc/Makefile)
-AC_CONFIG_MAKEFILE(lib/CodeGen/SelectionDAG/Makefile)
-AC_CONFIG_MAKEFILE(lib/ExecutionEngine/Makefile)
-AC_CONFIG_MAKEFILE(lib/ExecutionEngine/Interpreter/Makefile)
-AC_CONFIG_MAKEFILE(lib/ExecutionEngine/JIT/Makefile)
-AC_CONFIG_MAKEFILE(lib/Support/Makefile)
-AC_CONFIG_MAKEFILE(lib/Target/Makefile)
-AC_CONFIG_MAKEFILE(lib/Target/Sparc/Makefile)
-AC_CONFIG_MAKEFILE(lib/Target/X86/Makefile)
-AC_CONFIG_MAKEFILE(lib/Transforms/Makefile)
-AC_CONFIG_MAKEFILE(lib/Transforms/Hello/Makefile)
-AC_CONFIG_MAKEFILE(lib/Transforms/IPO/Makefile)
-AC_CONFIG_MAKEFILE(lib/Transforms/Instrumentation/Makefile)
-AC_CONFIG_MAKEFILE(lib/Transforms/Instrumentation/ProfilePaths/Makefile)
-AC_CONFIG_MAKEFILE(lib/Transforms/Scalar/Makefile)
-AC_CONFIG_MAKEFILE(lib/Transforms/Utils/Makefile)
-AC_CONFIG_MAKEFILE(lib/VMCore/Makefile)
 AC_CONFIG_MAKEFILE(runtime/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/crtend/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libc/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libcurses/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libg/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libgcc/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libm/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libmalloc/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libtermcap/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libucb/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libutempter/Makefile)
-AC_CONFIG_MAKEFILE(runtime/GCCLibraries/libutil/Makefile)
-AC_CONFIG_MAKEFILE(runtime/libdummy/Makefile)
-AC_CONFIG_MAKEFILE(runtime/libtrace/Makefile)
 AC_CONFIG_MAKEFILE(test/Makefile)
 AC_CONFIG_MAKEFILE(test/Makefile.tests)
 AC_CONFIG_MAKEFILE(test/QMTest/llvm.py)
 AC_CONFIG_MAKEFILE(test/QMTest/llvmdb.py)
 AC_CONFIG_MAKEFILE(test/Programs/Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/Makefile.programs)
+AC_CONFIG_MAKEFILE(test/Programs/Makefile.tests)
 AC_CONFIG_MAKEFILE(test/Programs/TEST.aa.Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/TEST.dsgraph.report)
-AC_CONFIG_MAKEFILE(test/Programs/TEST.micro.report)
 AC_CONFIG_MAKEFILE(test/Programs/TEST.aa.report)
 AC_CONFIG_MAKEFILE(test/Programs/TEST.example.Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/TEST.nightly.Makefile)
@@ -115,162 +61,93 @@ AC_CONFIG_MAKEFILE(test/Programs/TEST.dsgraph.Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/TEST.jit.report)
 AC_CONFIG_MAKEFILE(test/Programs/TEST.typesafe.Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/TEST.dsgraph.gnuplot)
-AC_CONFIG_MAKEFILE(test/Programs/TEST.micro.Makefile)
+AC_CONFIG_MAKEFILE(test/Programs/TEST.vtl.Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/External/Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/Makefile.spec)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CFP2000/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CFP2000/177.mesa/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CFP2000/179.art/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CFP2000/183.equake/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CFP2000/188.ammp/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/164.gzip/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/175.vpr/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/176.gcc/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/181.mcf/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/186.crafty/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/197.parser/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/252.eon/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/253.perlbmk/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/254.gap/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/255.vortex/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/256.bzip2/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/CINT2000/300.twolf/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/LLVMSource/Makefile)
+AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/Makefile.spec2000)
+AC_CONFIG_MAKEFILE(test/Programs/External/SPEC/Makefile.spec95)
 AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Makefile.multisrc)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Applications/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Applications/Burg/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Applications/aha/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Applications/sgefa/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Fhourstones/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/01-qbsort/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/03-testtrie/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/04-bisect/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/05-eks/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/08-main/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/09-vor/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/12-IOtest/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/15-trie/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/17-bintr/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/McCat/18-imp/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/bh/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/bisort/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/em3d/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/health/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/mst/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/perimeter/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/power/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/treeadd/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/tsp/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Olden/voronoi/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/OptimizerEval/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Ptrdist/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Ptrdist/anagram/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Ptrdist/bc/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Ptrdist/ft/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Ptrdist/ks/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/Ptrdist/yacr2/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/llubenchmark/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/sim/Makefile)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/analyzer/test.in)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/distray/Makefile)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/distray/test.in)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/fourinarow/Makefile)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/fourinarow/test.in)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/mason/Makefile)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/mason/test.in)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/neural/Makefile)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/neural/test.in)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/pcompress2/Makefile)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/pcompress2/test.in)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/pifft/Makefile)
+AC_CONFIG_MAKEFILE(test/Programs/MultiSource/Benchmarks/FreeBench/pifft/test.in)
 AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Makefile.singlesrc)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Gizmos/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Benchmarks/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Benchmarks/Dhrystone/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Benchmarks/Shootout/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Benchmarks/Stanford/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Benchmarks/Misc/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/CustomChecked/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/UnitTests/Makefile)
 AC_CONFIG_MAKEFILE(test/Programs/SingleSource/UnitTests/SetjmpLongjmp/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Regression/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Regression/C/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Regression/C++/Makefile)
-AC_CONFIG_MAKEFILE(test/Programs/SingleSource/Regression/C++/EH/Makefile)
 AC_CONFIG_MAKEFILE(tools/Makefile)
-AC_CONFIG_MAKEFILE(tools/analyze/Makefile)
-AC_CONFIG_MAKEFILE(tools/bugpoint/Makefile)
-AC_CONFIG_MAKEFILE(tools/extract/Makefile)
-AC_CONFIG_MAKEFILE(tools/gccas/Makefile)
-AC_CONFIG_MAKEFILE(tools/gccld/Makefile)
-AC_CONFIG_MAKEFILE(tools/llc/Makefile)
-AC_CONFIG_MAKEFILE(tools/llee/Makefile)
-AC_CONFIG_MAKEFILE(tools/lli/Makefile)
-AC_CONFIG_MAKEFILE(tools/llvm-ar/Makefile)
-AC_CONFIG_MAKEFILE(tools/llvm-as/Makefile)
-AC_CONFIG_MAKEFILE(tools/llvm-dis/Makefile)
-AC_CONFIG_MAKEFILE(tools/llvm-link/Makefile)
-AC_CONFIG_MAKEFILE(tools/llvm-nm/Makefile)
-AC_CONFIG_MAKEFILE(tools/opt/Makefile)
 AC_CONFIG_MAKEFILE(utils/Makefile)
-AC_CONFIG_MAKEFILE(utils/Burg/Makefile)
-AC_CONFIG_MAKEFILE(utils/Burg/Doc/Makefile)
-AC_CONFIG_MAKEFILE(utils/TableGen/Makefile)
 AC_CONFIG_MAKEFILE(projects/Makefile)
-AC_CONFIG_MAKEFILE(projects/ModuleMaker/Makefile)
-AC_CONFIG_MAKEFILE(projects/ModuleMaker/Makefile.common)
-AC_CONFIG_MAKEFILE(projects/ModuleMaker/tools/Makefile)
-AC_CONFIG_MAKEFILE(projects/ModuleMaker/tools/ModuleMaker/Makefile)
 
-dnl **************************************************************************
-dnl * Determine which system we are building on
-dnl **************************************************************************
-
-dnl Check the install program (needs to be done before canonical stuff)
+dnl Find the install program (needs to be done before canonical stuff)
 AC_PROG_INSTALL
 
 dnl Check which host for which we're compiling.  This will tell us which LLVM
 dnl compiler will be used for compiling SSA into object code.
 AC_CANONICAL_TARGET
 
-dnl
-dnl Now, for some of our own magic:
+dnl Set the "OS" Makefile variable based on the system we are building on.
 dnl We will use the build machine information to set some variables.
-dnl
 case $build in
-	*i*86*)  AC_SUBST(OS,[Linux])
+	*-*-linux*)
+             AC_SUBST(OS,[Linux])
+			 if test -d /home/vadve/lattner/local/x86/llvm-gcc
+			 then
 			   AC_SUBST(LLVMGCCDIR,[/home/vadve/lattner/local/x86/llvm-gcc/])
+			 fi
 	         ;;
-
-	*sparc*) AC_SUBST(OS,[SunOS])
+	*-*-solaris*)
+             AC_SUBST(OS,[SunOS])
+			 if test -d /home/vadve/lattner/local/sparc/llvm-gcc
+			 then
 	           AC_SUBST(LLVMGCCDIR,[/home/vadve/lattner/local/sparc/llvm-gcc/])
+			 fi
+	         ;;
+	*-*-cygwin*)
+             AC_SUBST(OS,[Cygwin])
+	         ;;
+	*-*-darwin*)
+             AC_SUBST(OS,[Darwin])
+	         ;;
+	*-*-aix*)
+             AC_SUBST(OS,[AIX])
 	         ;;
-
 	*)       AC_SUBST(OS,[Unknown])
 	         ;;
 esac
 
-dnl
 dnl If we are targetting a Sparc machine running Solaris, pretend that it is
 dnl V9, since that is all that we support at the moment, and autoconf will only
 dnl tell us we're a sparc.
-dnl
 case $target in
-	*sparc*solaris*)  AC_SUBST(target,[[sparcv9-sun-solaris2.8]])
+	sparc*-*-solaris*)  AC_SUBST(target,[[sparcv9-sun-solaris2.8]])
 	                    ;;
 esac
 
-dnl
 dnl Determine what our target architecture is and configure accordingly.
 dnl This will allow Makefiles to make a distinction between the hardware and
 dnl the OS.
-dnl
 case $target in
-	*i*86*)           AC_SUBST(ARCH,[x86])
+	i*86-*)           AC_SUBST(ARCH,[x86])
 	                  ;;
-	*sparc*solaris*)  AC_SUBST(ARCH,[Sparc])
+	sparc*-*)         AC_SUBST(ARCH,[Sparc])
+	                  ;;
+	powerpc*-*)       AC_SUBST(ARCH,[PowerPC])
+	                  ;;
+	*)                AC_SUBST(ARCH,[Unknown])
 	                  ;;
 esac
 
-dnl **************************************************************************
-dnl * Check for programs.
-dnl **************************************************************************
-
 dnl Check for compilation tools
 AC_PROG_CXX
 AC_PROG_CC(gcc)
@@ -281,7 +158,6 @@ if test "$GCC" != "yes"
 then
 	AC_MSG_ERROR([gcc required but not found])
 fi
-
 if test "$GXX" != "yes"
 then
 	AC_MSG_ERROR([g++ required but not found])
@@ -291,86 +167,41 @@ dnl Verify that GCC is version 3.0 or higher
 gccmajor=`$CC --version | head -n 1 | awk '{print $NF;}' | cut -d. -f1`
 if test "$gccmajor" -lt "3"
 then
-	AC_MSG_ERROR([gcc 3.x required])
+	AC_MSG_ERROR([gcc 3.x required, but you have a lower version])
 fi
 
-dnl Check for GNU Make.  We use its extensions to, so don't build without it
+dnl Check for GNU Make.  We use its extensions too, so don't build without it
 CHECK_GNU_MAKE
 if test -z "$_cv_gnu_make_command"
 then
 	AC_MSG_ERROR([GNU Make required but not found])
 fi
 
-dnl Check for compiler-compiler tools (reminds me of Little Caesar's Pizza)
+dnl Checks for other tools
 AC_PROG_FLEX
 AC_PROG_BISON
-
-dnl Check for libtool
 AC_PROG_LIBTOOL
 
-dnl Check for our special programs
-AC_PATH_PROG(RPWD,[pwd],[false])
-if test ${RPWD} = "false"
+dnl Checks for tools we can get away with not having:
+AC_PATH_PROG(DOT,[dot],[true dot])
+AC_PATH_PROG(ETAGS,[etags],[true etags])
+dnl Check if we know how to tell etags we are using C++:
+etags_version=`$ETAGS --version 2>&1`
+case "$etags_version" in
+	*[Ee]xuberant*) ETAGSFLAGS="--language-force=c++" ;;
+	*GNU\ Emacs*) ETAGSFLAGS="-l c++" ;;
+	*) ETAGSFLAGS="" ;;
+esac
+AC_SUBST(ETAGSFLAGS,$ETAGSFLAGS)
+AC_PATH_PROG(PYTHON,[python],[true python])
+if test "$PYTHON" = "false"
 then
-	AC_MSG_ERROR([pwd required but not found])
+	AC_MSG_WARN([Python is required for the test suite, but it was not found])
 fi
-
-AC_PATH_PROG(AR,[ar],[false])
-if test ${AR} = "false"
+AC_PATH_PROG(QMTEST,[qmtest],[true qmtest])
+if test "$QMTEST" = "false"
 then
-	AC_MSG_ERROR([ar required but not found])
-fi
-
-AC_PATH_PROG(SED,[sed],[false])
-if test ${SED} = "false"
-then
-	AC_MSG_ERROR([sed required but not found])
-fi
-
-AC_PATH_PROG(RM,[rm],[false])
-if test ${RM} = "false"
-then
-	AC_MSG_ERROR([rm required but not found])
-fi
-
-AC_PATH_PROG(ECHO,[echo],[false])
-if test ${ECHO} = "false"
-then
-	AC_MSG_ERROR([echo required but not found])
-fi
-
-AC_PATH_PROG(MKDIR,[mkdir],[false])
-if test ${MKDIR} = "false"
-then
-	AC_MSG_ERROR([mkdir required but not found])
-fi
-
-AC_PATH_PROG(DATE,[date],[false])
-if test ${DATE} = "false"
-then
-	AC_MSG_ERROR([date required but not found])
-fi
-
-AC_PATH_PROG(MV,[mv],[false])
-if test ${MV} = "false"
-then
-	AC_MSG_ERROR([mv required but not found])
-fi
-
-AC_PATH_PROG(DOT,[dot],[false])
-
-AC_PATH_PROG(ETAGS,[etags],[false])
-
-AC_PATH_PROG(PYTHON,[python],[false])
-if test ${PYTHON} = "false"
-then
-	AC_MSG_WARN([python required but not found])
-fi
-
-AC_PATH_PROG(QMTEST,[qmtest],[false])
-if test ${QMTEST} = "false"
-then
-	AC_MSG_WARN([qmtest required but not found])
+	AC_MSG_WARN([QMTest is required for the test suite, but it was not found])
 fi
 
 dnl Verify that the version of python available is high enough for qmtest
@@ -384,20 +215,17 @@ then
 	then
 		if test "$pyminor" -lt "2"
 		then
-			AC_MSG_ERROR([Python 2.2 or greater required])
+			AC_MSG_WARN([QMTest requires Python 2.2 or later])
 		fi
 	fi
 else
-	AC_MSG_ERROR([Python 2.2 or greater required])
+	AC_MSG_WARN([QMTest requires Python 2.2 or later])
 fi
 
 dnl Verify that the source directory is valid
 AC_CONFIG_SRCDIR(["Makefile.config.in"])
 
-dnl **************************************************************************
-dnl * Check for libraries.
-dnl **************************************************************************
-
+dnl Checks for libraries:
 dnl libelf is for sparc only; we can ignore it if we don't have it
 AC_CHECK_LIB(elf, elf_begin)
 
@@ -407,44 +235,36 @@ AC_SEARCH_LIBS(dlopen,dl,AC_DEFINE([HAVE_DLOPEN],[1],[Define if dlopen() is avai
 dnl mallinfo is optional; the code can compile (minus features) without it
 AC_SEARCH_LIBS(mallinfo,malloc,AC_DEFINE([HAVE_MALLINFO],[1],[Define if mallinfo() is available on this platform.]))
 
-dnl
-dnl The math libraries are used by the test code, but not by the actual LLVM
-dnl code.
-dnl
-dnl AC_CHECK_LIB(m, cos)
+dnl pthread locking functions are optional - but llvm will not be thread-safe
+dnl without locks.
+AC_SEARCH_LIBS(pthread_mutex_lock,pthread,HAVE_PTHREAD_MUTEX_LOCK=1,HAVE_PTHREAD_MUTEX_LOCK=0)
+AC_SUBST(HAVE_PTHREAD_MUTEX_LOCK)
 
-dnl **************************************************************************
-dnl * Checks for header files.
-dnl *	Chances are, if the standard C or POSIX type header files are missing,
-dnl *	then LLVM just isn't going to compile.  However, it is possible that
-dnl *	the necessary functions/macros will be included from other
-dnl *	(non-standard and non-obvious) header files.
-dnl *
-dnl *	So, we'll be gracious, give it a chance, and try to go on without
-dnl *	them.
-dnl **************************************************************************
+dnl Checks for header files.
+dnl We don't check for ancient stuff or things that are guaranteed to be there
+dnl by the C++ standard. We always use the <cfoo> versions of <foo.h> C headers.
 AC_HEADER_STDC
 AC_HEADER_SYS_WAIT
 
-dnl Check for ANSI C/POSIX header files
-AC_CHECK_HEADERS(assert.h fcntl.h limits.h sys/time.h unistd.h errno.h signal.h math.h)
+dnl Checks for POSIX and other various system-specific header files
+AC_CHECK_HEADERS(fcntl.h limits.h sys/time.h unistd.h malloc.h sys/mman.h sys/resource.h dlfcn.h link.h execinfo.h windows.h)
 
-dnl Check for system specific header files
-AC_CHECK_HEADERS(malloc.h sys/mman.h sys/resource.h)
+dnl Check for things that need to be included in public headers, and so
+dnl for which we may not have access to a HAVE_* preprocessor #define.
+dnl (primarily used in DataTypes.h)
+AC_CHECK_HEADER([sys/types.h],
+                [INCLUDE_SYS_TYPES_H='#include <sys/types.h>'],
+                [INCLUDE_SYS_TYPES_H=''])
+AC_SUBST(INCLUDE_SYS_TYPES_H)
+AC_CHECK_HEADER([inttypes.h],
+                [INCLUDE_INTTYPES_H='#include <inttypes.h>'],
+                [INCLUDE_INTTYPES_H=''])
+AC_SUBST(INCLUDE_INTTYPES_H)
+AC_CHECK_HEADER([stdint.h],
+                [INCLUDE_STDINT_H='#include <stdint.h>'],
+                [INCLUDE_STDINT_H=''])
+AC_SUBST(INCLUDE_STDINT_H)
 
-dnl Check for header files associated with dlopen and friends
-AC_CHECK_HEADERS(dlfcn.h link.h)
-
-dnl **************************************************************************
-dnl * Checks for typedefs, structures, and compiler characteristics.
-dnl **************************************************************************
-
-dnl Check for const and inline keywords
-AC_C_CONST
-AC_C_INLINE
-
-dnl Check for machine endian-ness
-AC_C_BIGENDIAN(AC_DEFINE([ENDIAN_BIG],[],[Define if the machine is Big-Endian]),AC_DEFINE([ENDIAN_LITTLE],[],[Define if the machine is Little-Endian]))
 
 dnl Check for types
 AC_TYPE_PID_T
@@ -457,59 +277,41 @@ AC_STRUCT_TM
 dnl Check for various C features
 AC_C_PRINTF_A
 
+dnl Check for the endianness of the target
+AC_C_BIGENDIAN(AC_SUBST([ENDIAN],[big]),AC_SUBST([ENDIAN],[little]))
+
 dnl Check for C++ extensions
-AC_CXX_HAVE_EXT_HASH_MAP
-AC_CXX_HAVE_EXT_HASH_SET
-AC_CXX_HAVE_EXT_SLIST
+AC_CXX_HAVE_HASH_MAP
+AC_CXX_HAVE_HASH_SET
 AC_CXX_HAVE_STD_ITERATOR
 AC_CXX_HAVE_BI_ITERATOR
 AC_CXX_HAVE_FWD_ITERATOR
 
-dnl **************************************************************************
-dnl * Checks for library functions.
-dnl **************************************************************************
+AC_FUNC_ISNAN
+AC_FUNC_ISINF
+
+dnl Checks for library functions.
 AC_FUNC_ALLOCA
-AC_PROG_GCC_TRADITIONAL
-AC_FUNC_MEMCMP
 AC_FUNC_MMAP
-AC_FUNC_MMAP_FILE
-if test ${ac_cv_func_mmap_file} = "no"
+if test "$ac_cv_func_mmap_fixed_mapped" = "no"
 then
-	AC_MSG_ERROR([mmap() of files required but not found])
+	AC_MSG_WARN([mmap() required but not found])
+fi
+AC_FUNC_MMAP_FILE
+if test "$ac_cv_func_mmap_file" = "no"
+then
+	AC_MSG_WARN([mmap() of files required but not found])
 fi
 AC_HEADER_MMAP_ANONYMOUS
 AC_TYPE_SIGNAL
-AC_CHECK_FUNCS(getcwd gettimeofday strcspn strdup strerror strspn strstr strtod strtol strtoq strtoll)
-
-dnl
-dnl Need to check mmap for MAP_PRIVATE, MAP_ANONYMOUS, MAP_ANON, MAP_FIXED
-dnl MAP_FIXED is only needed for Sparc
-dnl MAP_ANON is used for Sparc and BSD
-dnl Everyone should have MAP_PRIVATE
-dnl
-
-dnl Check for certain functions (even if we've already found them) so that we
-dnl can quit with an error if they are unavailable.
-dnl
-dnl As the code is made more portable (i.e. less reliant on these functions,
-dnl these checks should go away.
-AC_CHECK_FUNC(mmap,,AC_MSG_ERROR([Function mmap() required but not found]))
+AC_CHECK_FUNCS(getcwd gettimeofday strdup strtoq strtoll backtrace isatty mkstemp getrusage)
 AC_CHECK_FUNC(mprotect,,AC_MSG_ERROR([Function mprotect() required but not found]))
 
-dnl **************************************************************************
-dnl * Enable various compile-time options
-dnl **************************************************************************
+dnl Determine if the linker supports the -R option.
+AC_LINK_USE_R
 
-dnl Purify Option
-AC_ARG_ENABLE(purify,AC_HELP_STRING([--enable-purify],[Compile with purify (default is NO)]),,enableval="no")
-if test ${enableval} = "no"
-then
-	AC_SUBST(ENABLE_PURIFY,[[]])
-else
-	AC_SUBST(ENABLE_PURIFY,[[ENABLE_PURIFY=1]])
-fi
-
-dnl Optimized Option
+dnl --enable/--with command-line options:
+dnl Check whether they want to do an optimized build:
 AC_ARG_ENABLE(optimized,AC_HELP_STRING([--enable-optimized],[Compile with optimizations enabled (default is NO)]),,enableval=no)
 if test ${enableval} = "no"
 then
@@ -518,27 +320,50 @@ else
 	AC_SUBST(ENABLE_OPTIMIZED,[[ENABLE_OPTIMIZED=1]])
 fi
 
-dnl Spec Benchmarks
-AC_ARG_ENABLE(spec2000,AC_HELP_STRING([--enable-spec],[Compile SPEC 2000 benchmarks (default is NO)]),,enableval=no)
-if test ${enableval} = "no"
-then
-	if test -d /home/vadve/shared/benchmarks/speccpu2000/benchspec
+AC_DEFUN(EXTERNAL_BENCHMARK,
+[m4_define([allcapsname],translit($1,a-z,A-Z))
+ AC_ARG_ENABLE($1,
+ AC_HELP_STRING([--enable-$1=ARG], 
+                [Use $1 as a benchmark (srcs in DIR)]),
+ checkresult=$enableval,
+ checkresult=auto)
+AC_MSG_CHECKING([for $1 benchmark sources])
+case "$checkresult" in
+auto|yes)
+    defaultdir=$2
+	if test -d "$defaultdir"
 	then
-		AC_SUBST(SPEC_ROOT,[/home/vadve/shared/benchmarks/speccpu2000/benchspec])
-		AC_SUBST(USE_SPEC,[[USE_SPEC=1]])
+		AC_SUBST(allcapsname()[_ROOT],[$defaultdir])
+		AC_SUBST([USE_]allcapsname(),[USE_]allcapsname()=1)
+        checkresult="yes, found in $defaultdir"
     else
-		AC_SUBST(USE_SPEC,[[]])
-		AC_SUBST(SPEC_ROOT,[])
+        checkresult=no
     fi
-else
-	if test ${enableval} = ""
+    ;;
+no)
+    AC_SUBST(allcapsname()[_ROOT],[])
+    AC_SUBST([USE_]allcapsname(),[])
+    checkresult=no
+    ;;
+*)  if test -d "$checkresult"
     then
-		AC_SUBST(SPEC_ROOT,[/home/vadve/shared/benchmarks/speccpu2000/benchspec])
+        AC_SUBST(allcapsname()[_ROOT],"$checkresult")
+        AC_SUBST([USE_]allcapsname(),[USE_]allcapsname()=1)
+        checkresult="yes, in $checkresult"
     else
-		AC_SUBST(SPEC_ROOT,[${enableval}])
+        AC_SUBST(allcapsname()[_ROOT],[])
+        AC_SUBST([USE_]allcapsname(),[])
+        checkresult="no, not found in $checkresult"
     fi
-	AC_SUBST(USE_SPEC,[[USE_SPEC=1]])
-fi
+    ;;
+esac
+AC_MSG_RESULT($checkresult)
+m4_undefine([allcapsname])
+])
+
+EXTERNAL_BENCHMARK(spec95,/home/vadve/shared/benchmarks/spec95/benchspec)
+EXTERNAL_BENCHMARK(spec2000,/home/vadve/shared/benchmarks/speccpu2000/benchspec)
+EXTERNAL_BENCHMARK(povray,/home/vadve/shared/benchmarks/povray31)
 
 dnl Precompiled Bytecode Option
 AC_ARG_ENABLE(precompiled_bytecode,AC_HELP_STRING([--enable-precompiled_bytecode],[Use pre-compiled bytecode (default is NO)]),,enableval=no)
@@ -549,7 +374,6 @@ else
 	AC_SUBST(UPB,[[USE_PRECOMPILED_BYTECODE=1]])
 fi
 
-
 dnl LLC Diff Option
 AC_ARG_ENABLE(llc_diffs,AC_HELP_STRING([--enable-llc_diffs],[Enable LLC Diffs when testing (default is YES)]),,enableval=yes)
 if test ${enableval} = "no"
@@ -561,7 +385,6 @@ fi
 
 dnl JIT Option
 AC_ARG_ENABLE(jit,AC_HELP_STRING([--enable-jit],[Enable Just In Time Compiling (default is YES)]),,enableval=default)
-
 if test ${enableval} = "no"
 then
 	AC_SUBST(JIT,[[]])
@@ -579,12 +402,44 @@ else
 	esac
 fi
 
-dnl **************************************************************************
-dnl * Set the location of various third-party software packages
-dnl **************************************************************************
-
-dnl Location of the LLVM C front end
+dnl Find the LLVM GCC-based C/C++ front end
 AC_ARG_WITH(llvmgccdir,AC_HELP_STRING([--with-llvmgccdir],[Location of LLVM GCC front-end]),AC_SUBST(LLVMGCCDIR,[$withval]))
+AC_MSG_CHECKING([for llvm-gcc])
+LLVM_GCC_CHECK=no
+if test -d "$LLVMGCCDIR"
+then
+	if test -x "$LLVMGCCDIR/bin/gcc"
+	then
+		LLVM_GCC_CHECK="$LLVMGCCDIR/bin/gcc"
+	fi
+fi
+llvmgccwarn=no
+AC_MSG_RESULT($LLVM_GCC_CHECK)
+if test "$LLVM_GCC_CHECK" = "no"
+then
+    llvmgccwarn=yes
+fi
+AC_MSG_CHECKING([whether llvm-gcc is sane])
+LLVM_GCC_SANE=no
+if test -x "$LLVM_GCC_CHECK"
+then
+	cp /dev/null conftest.c
+    "$LLVM_GCC_CHECK" -S -o - conftest.c | grep implementation > /dev/null 2>&1
+	if test $? -eq 0
+	then
+		LLVM_GCC_SANE=yes
+	fi
+	rm conftest.c
+	llvmcc1path=`"$LLVM_GCC_CHECK" --print-prog-name=cc1`
+	AC_SUBST(LLVMCC1,$llvmcc1path)
+	llvmcc1pluspath=`"$LLVM_GCC_CHECK" --print-prog-name=cc1plus`
+	AC_SUBST(LLVMCC1PLUS,$llvmcc1pluspath)
+fi
+AC_MSG_RESULT($LLVM_GCC_SANE)
+if test "$LLVM_GCC_SANE" = "no"
+then
+	llvmgccwarn=yes
+fi
 
 dnl Location of the bytecode repository
 AC_ARG_WITH(bcrepos,AC_HELP_STRING([--with-bcrepos],[Location of Bytecode Repository]),AC_SUBST(BCR,[$withval]),AC_SUBST(BCR,[/home/vadve/lattner/LLVMPrograms]))
@@ -592,14 +447,27 @@ AC_ARG_WITH(bcrepos,AC_HELP_STRING([--with-bcrepos],[Location of Bytecode Reposi
 dnl Location of PAPI
 AC_ARG_WITH(papi,AC_HELP_STRING([--with-papi],[Location of PAPI]),AC_SUBST(PAPIDIR,[$withval]),AC_SUBST(PAPIDIR,[/home/vadve/shared/Sparc/papi-2.3.4.1]))
 
-dnl Location of the purify program
-AC_ARG_WITH(purify,AC_HELP_STRING([--with-purify],[Location of purify program]),AC_SUBST(PURIFY,[$withval]))
+dnl Get libtool's idea of what the shared library suffix is.
+dnl (This is a hack; it relies on undocumented behavior.)
+AC_MSG_CHECKING([for shared library suffix])
+eval "SHLIBEXT=$shrext"
+AC_MSG_RESULT($SHLIBEXT)
+dnl Propagate it to the Makefiles and config.h (for gccld & bugpoint).
+AC_SUBST(SHLIBEXT,$SHLIBEXT)
+AC_DEFINE_UNQUOTED(SHLIBEXT,"$SHLIBEXT",
+                   [Extension that shared libraries have, e.g., ".so".])
 
-dnl **************************************************************************
-dnl * Configure other software packages (via AC_CONFIG_SUBDIRS)
-dnl **************************************************************************
+dnl Create the output files
+AC_OUTPUT()
+
+dnl Warn loudly if llvm-gcc was not obviously working
+if test $llvmgccwarn = yes
+then
+	AC_MSG_WARN([***** llvm C/C++ front end was not found, or does not])
+	AC_MSG_WARN([***** appear to be working.])
+	AC_MSG_WARN([***** ])
+	AC_MSG_WARN([***** Please check configure's --with-llvmgccdir option.])
+	AC_MSG_WARN([***** Runtime libraries (in llvm/runtime) will not be built,])
+	AC_MSG_WARN([***** but you should be able to build the llvm tools.])
+fi
 
-dnl **************************************************************************
-dnl * Create the output files
-dnl **************************************************************************
-AC_OUTPUT(Makefile.config)

llvm/docs/Bugpoint.html

@@ -12,15 +12,15 @@
 <h3>SYNOPSIS</h3>
 <tt>bugpoint [options] [input LLVM ll/bc files] [LLVM passes] --args &lt;program arguments&gt;...</tt>
 
-<img src="../Debugging.gif" width=444 height=314 align=right>
+<img src="img/Debugging.gif" width=444 height=314 align=right>
 <h3>DESCRIPTION</h3>
 
 The <tt>bugpoint</tt> tool narrows down the source of
 problems in LLVM tools and passes.  It can be used to debug three types of
-failures: optimizer crashes, miscompilations by optimizers, or invalid native
-code generation.  It aims to reduce large test cases to small, useful ones. 
-For example,
-if <tt><a href="gccas.html">gccas</a></tt> crashes while optimizing a file, it
+failures: optimizer crashes, miscompilations by optimizers, or bad native
+code generation (including problems in the static and JIT compilers).  It aims 
+to reduce large test cases to small, useful ones.  For example,
+if <tt><a href="CommandGuide/gccas.html">gccas</a></tt> crashes while optimizing a file, it
 will identify the optimization (or combination of optimizations) that causes the
 crash, and reduce the file down to a small example which triggers the crash.<p>
 
@@ -30,11 +30,13 @@ crash, and reduce the file down to a small example which triggers the crash.<p>
 <tt>bugpoint</tt> is designed to be a useful tool without requiring any
 hooks into the LLVM infrastructure at all.  It works with any and all LLVM
 passes and code generators, and does not need to "know" how they work.  Because
-of this, it may appear to do a lot of stupid things or miss obvious
+of this, it may appear to do stupid things or miss obvious
 simplifications.  <tt>bugpoint</tt> is also designed to trade off programmer
 time for computer time in the compiler-debugging process; consequently, it may
 take a long period of (unattended) time to reduce a test case, but we feel it
-is still worth it. :-) <p>
+is still worth it. Note that <tt>bugpoint</tt> is generally very quick unless
+debugging a miscompilation where each test of the program (which requires 
+executing it) takes a long time.<p>
 
 <a name="automaticdebuggerselection">
 <h4>Automatic Debugger Selection</h4>
@@ -43,67 +45,62 @@ is still worth it. :-) <p>
 specified on the command line and links them together into a single module,
 called the test program.  If any LLVM passes are
 specified on the command line, it runs these passes on the test program.  If
-any of the passes crash, or if they produce malformed output,
+any of the passes crash, or if they produce malformed output (which causes the 
+verifier to abort),
 <tt>bugpoint</tt> starts the <a href="#crashdebug">crash debugger</a>.<p>
 
 Otherwise, if the <a href="#opt_output"><tt>-output</tt></a> option was not
-specified, <tt>bugpoint</tt> runs the test program with the C backend (which
-is assumed to generate good code) to generate a reference output.  Once
+specified, <tt>bugpoint</tt> runs the test program with the C backend (which is
+assumed to generate good code) to generate a reference output.  Once
 <tt>bugpoint</tt> has a reference output for the test program, it tries
-executing it
-with the <a href="#opt_run-">selected</a> code generator.  If
-the resulting output differs from the reference output, it assumes the
-difference resulted from a code generator failure, and starts the
-<a href="#codegendebug">code generator debugger</a>.<p>
+executing it with the <a href="#opt_run-">selected</a> code generator.  If the
+selected code generator crashes, <tt>bugpoint</tt> starts the <a
+href="#crashdebug">crash debugger</a> on the code generator.  Otherwise, if the
+resulting output differs from the reference output, it assumes the difference
+resulted from a code generator failure, and starts the <a
+href="#codegendebug">code generator debugger</a>.<p>
 
-Otherwise, <tt>bugpoint</tt> runs the test program after all of the LLVM passes
-have been applied to it.  If its output differs from the reference output,
-it assumes the difference resulted from a failure in one of the LLVM passes,
-and enters the
-<a href="#miscompilationdebug">miscompilation debugger</a>. Otherwise,
-there is no problem <tt>bugpoint</tt> can debug.<p>
+Finally, if the output of the selected code generator matches the reference
+output, <tt>bugpoint</tt> runs the test program after all of the LLVM passes
+have been applied to it.  If its output differs from the reference output, it
+assumes the difference resulted from a failure in one of the LLVM passes, and
+enters the <a href="#miscompilationdebug">miscompilation
+debugger</a>. Otherwise, there is no problem <tt>bugpoint</tt> can debug.<p>
 
 <a name="crashdebug">
 <h4>Crash debugger</h4>
 
-If an optimizer crashes, <tt>bugpoint</tt> will try as hard as it can to
-reduce the list of passes and the size of the test program.  First,
-<tt>bugpoint</tt> figures out which combination of passes triggers the bug. This
-is useful when debugging a problem exposed by <tt>gccas</tt>, for example,
-because it runs over 25 optimizations.<p>
+If an optimizer or code generator crashes, <tt>bugpoint</tt> will try as hard as
+it can to reduce the list of passes (for optimizer crashes) and the size of the
+test program.  First, <tt>bugpoint</tt> figures out which combination of
+optimizer passes triggers the bug. This is useful when debugging a problem
+exposed by <tt>gccas</tt>, for example, because it runs over 38 passes.<p>
 
 Next, <tt>bugpoint</tt> tries removing functions from the test program, to
-reduce its
-size.  Usually it is able to reduce a test program
-to a single function, when debugging intraprocedural optimizations.  Once the
-number of
+reduce its size.  Usually it is able to reduce a test program to a single
+function, when debugging intraprocedural optimizations.  Once the number of
 functions has been reduced, it attempts to delete various edges in the control
 flow graph, to reduce the size of the function as much as possible.  Finally,
 <tt>bugpoint</tt> deletes any individual LLVM instructions whose absence does
 not eliminate the failure.  At the end, <tt>bugpoint</tt> should tell you what
 passes crash, give you a bytecode file, and give you instructions on how to
-reproduce the failure with <tt><a href="opt.html">opt</a></tt> or
-<tt><a href="analyze.html">analyze</a></tt>.<p>
+reproduce the failure with <tt><a href="CommandGuide/opt.html">opt</a></tt>, <tt><a
+href="CommandGuide/analyze.html">analyze</a></tt>, or <tt><a href="CommandGuide/llc.html">llc</a></tt>.<p>
 
 <a name="codegendebug">
 <h4>Code generator debugger</h4>
 
-The code generator debugger attempts to narrow down the amount of code that is
-being miscompiled by the <a href="#opt_run-">selected</a> code generator.  To do
-this, it takes the test program and partitions it into two pieces: one piece
+<p>The code generator debugger attempts to narrow down the amount of code that
+is being miscompiled by the <a href="#opt_run-">selected</a> code generator.  To
+do this, it takes the test program and partitions it into two pieces: one piece
 which it compiles with the C backend (into a shared object), and one piece which
 it runs with either the JIT or the static LLC compiler.  It uses several
 techniques to reduce the amount of code pushed through the LLVM code generator,
 to reduce the potential scope of the problem.  After it is finished, it emits
 two bytecode files (called "test" [to be compiled with the code generator] and
-"safe" [to be compiled with the C backend] respectively), and instructions for
-reproducing the problem.  The code generator debugger assumes that the C
-backend produces good code.<p>
-
-If you are using the code generator debugger and get an error message that
-says "UNSUPPORTED: external function used as a global initializer!", try using
-the <tt>-run-llc</tt> option instead of the <tt>-run-jit</tt> option.  This is
-due to an unimplemented feature in the code generator debugger.<p>
+"safe" [to be compiled with the C backend], respectively), and instructions for
+reproducing the problem.  The code generator debugger assumes that the C backend
+produces good code.</p>
 
 <a name="miscompilationdebug">
 <h4>Miscompilation debugger</h4>
@@ -126,7 +123,7 @@ non-obvious ways.  Here are some hints and tips:<p>
 <ol>
 <li>In the code generator and miscompilation debuggers, <tt>bugpoint</tt> only
     works with programs that have deterministic output.  Thus, if the program
-    outputs the date, time, or any other "random" data, <tt>bugpoint</tt> may
+    outputs <tt>argv[0]</tt>, the date, time, or any other "random" data, <tt>bugpoint</tt> may
     misinterpret differences in these data, when output, as the result of a
     miscompilation.  Programs should be temporarily modified to disable
     outputs that are likely to vary from run to run.
@@ -148,18 +145,23 @@ non-obvious ways.  Here are some hints and tips:<p>
     <br>to get a copy of <tt>bugpoint</tt>'s output in the file
     <tt>bugpoint.log</tt>, as well as on your terminal.
 
-<li><tt>bugpoint</tt> cannot debug problems with the linker. If
+<li><tt>bugpoint</tt> cannot debug problems with the LLVM linker. If
     <tt>bugpoint</tt> crashes before you see its "All input ok" message,
     you might try <tt>llvm-link -v</tt> on the same set of input files. If
     that also crashes, you may be experiencing a linker bug.
 
+<li>If your program is <b>supposed</b> to crash, <tt>bugpoint</tt> will be
+    confused. One way to deal with this is to cause bugpoint to ignore the exit
+    code from your program, by giving it the <tt>-check-exit-code=false</tt>
+    option.
+    
 </ol>
 
 <h3>OPTIONS</h3>
 
 <ul>
-	<li><tt>-additional-so &lt;library.so&gt;</tt><br>
-    Load <tt>&lt;library.so&gt;</tt> into the test program whenever it is run.
+	<li><tt>-additional-so &lt;library&gt;</tt><br>
+    Load <tt>&lt;library&gt;</tt> into the test program whenever it is run.
     This is useful if you are debugging programs which depend on non-LLVM
     libraries (such as the X or curses libraries) to run.<p>
 
@@ -175,7 +177,23 @@ non-obvious ways.  Here are some hints and tips:<p>
         part of the <tt>-args</tt> option, not as options to <tt>bugpoint</tt>
         itself.<p>
 
-	<li><tt>-disable-{adce,dce,final-cleanup,simplifycfg}</tt><br>
+	<li><tt>-tool-args &lt;tool args&gt;</tt><br>
+	Pass all arguments specified after <tt>-tool-args</tt> to the
+	LLVM tool under test (llc, lli, etc.) whenever it runs.
+	You should use this option in the following way:
+        <p>
+        <tt>bugpoint &lt;bugpoint args&gt; -tool-args -- &lt;tool args&gt;</tt>
+        <p>
+        The "<tt>--</tt>" right after the <tt>-tool-args</tt> option tells
+        <tt>bugpoint</tt> to consider any options starting with <tt>-</tt> to be
+        part of the <tt>-tool-args</tt> option, not as options to
+        <tt>bugpoint</tt> itself. (See <tt>-args</tt>, above.)<p>
+
+	<li><tt>-check-exit-code={true,false}</tt><br>
+    Assume a non-zero exit code or core dump from the test program is
+    a failure. Defaults to true.<p>
+
+	<li><tt>-disable-{dce,simplifycfg}</tt><br>
     Do not run the specified passes to clean up and reduce the size of the
     test program. By default, <tt>bugpoint</tt> uses these passes internally
     when attempting to reduce test programs.  If you're trying to find
@@ -189,14 +207,14 @@ non-obvious ways.  Here are some hints and tips:<p>
     test program, whenever it runs, to come from that file.
 	<p>
 
-	<a name="opt_load"><li> <tt>-load &lt;plugin.so&gt;</tt><br>
-	Load the dynamic object <tt>&lt;plugin.so&gt;</tt> into <tt>bugpoint</tt>
+	<a name="opt_load"><li> <tt>-load &lt;plugin&gt;</tt><br>
+	Load the dynamic object <tt>&lt;plugin&gt;</tt> into <tt>bugpoint</tt>
     itself.  This object should register new
 	optimization passes.  Once loaded, the object will add new command line
 	options to enable various optimizations.  To see the new complete list
 	of optimizations, use the -help and -load options together:
 	<p>
-	<tt>bugpoint -load &lt;plugin.so&gt; -help</tt>
+	<tt>bugpoint -load &lt;plugin&gt; -help</tt>
 	<p>
 
 	<a name="opt_output"><li><tt>-output &lt;filename&gt;</tt><br>
@@ -206,6 +224,9 @@ non-obvious ways.  Here are some hints and tips:<p>
     <tt>bugpoint</tt> will attempt to generate a reference output by
     compiling the program with the C backend and running it.<p>
 
+	<li><tt>-profile-info-file &lt;filename&gt;</tt><br>
+    Profile file loaded by -profile-loader.<p>
+
 	<a name="opt_run-"><li><tt>-run-{int,jit,llc,cbe}</tt><br>
     Whenever the test program is compiled, <tt>bugpoint</tt> should generate
     code for it using the specified code generator.  These options allow
@@ -218,10 +239,6 @@ non-obvious ways.  Here are some hints and tips:<p>
 If <tt>bugpoint</tt> succeeds in finding a problem, it will exit with 0.
 Otherwise, if an error occurs, it will exit with a non-zero value.
 
-<h3>SEE ALSO</h3>
-<a href="opt.html"><tt>opt</tt></a>,
-<a href="analyze.html"><tt>analyze</tt></a>
-
 <HR>
 Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
 </body>

llvm/docs/CFEBuildInstrs.html

@@ -1,25 +1,72 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
 <html>
 <head>
-  <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
-  <link rel="stylesheet" href="llvm.css" type="text/css" media="screen" />
-  <title>Bootstrapping the C/C++ Front-End</title>
+  <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+  <link rel="stylesheet" href="llvm.css" type="text/css" media="screen">
+  <title>Bootstrapping the LLVM C/C++ Front-End</title>
 </head>
 <body>
 
 <div class="doc_title">
-  Bootstrapping the C/C++ Front-End
+  Bootstrapping the LLVM C/C++ Front-End
 </div>
 
-<p>This document is intended to explain the process of building the LLVM
-C/C++ front-end, based on GCC 3.4, from source.</p>
+<ol>
+  <li><a href="#cautionarynote">A Cautionary Note</a>
+    <ul>
+      <li><a href="#cygwin">Building under Cygwin</a></li>
+    </ul>
+  </li>
+  <li><a href="#instructions">Instructions</a></li>
+  <li><a href="#license">License Information</a></li>
+</ol>
+
+<div class="doc_author">    
+  <p>Written by Brian R. Gaeke and 
+     <a href="http://nondot.org/sabre">Chris Lattner</a></p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="cautionarynote">A Cautionary Note</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>This document is intended to explain the process of building the
+LLVM C/C++ front-end, based on GCC 3.4, from its source code. You
+would have to do this, for example, if you are porting LLVM to a new
+architecture or operating system.</p>
 
 <p><b>NOTE:</b> This is currently a somewhat fragile, error-prone
-process, and you should only try to do it if (A) you really, really,
-really can't use the binaries we distribute, and (B) you are a wicked
-good GCC hacker.</p>
+process, and you should <b>only</b> try to do it if:</p>
+
+<ol>
+  <li>you really, really, really can't use the binaries we distribute</li>
+  <li>you need GCC to fix some of the header files on your system</li>
+  <li>you are an elite GCC hacker.</li>
+</ol>
 
 <p>We welcome patches to help make this process simpler.</p>
+</div>
+
+<!--=========================================================================-->
+<div class="doc_subsection">
+  <a name="cygwin">Building under Cygwin</a>
+</div>
+<!--=========================================================================-->
+
+<div class="doc_text">
+<p>If you are building LLVM and the C front-end under Cygwin, please note that
+the LLVM and GCC makefiles do not correctly handle spaces in paths.  To deal
+with this issue, make sure that your LLVM and GCC source and build trees are 
+located in a top-level directory (like <tt>/cygdrive/c/llvm</tt> and 
+<tt>/cygdrive/c/llvm-cfrontend</tt>), not in a directory that contains a space
+(which includes your "home directory", because it lives under the "Documents 
+and Settings" directory).  We welcome patches to fix this issue.
+</p>
+</div>
 
 <!-- *********************************************************************** -->
 <div class="doc_section">
@@ -34,12 +81,11 @@ good GCC hacker.</p>
 <pre>
  % cd llvm
  % ./configure [options...]
- % gmake tools-only
+ % gmake 
 </pre>
-    <p>The use of the non-default target "tools-only" means that the
-    LLVM tools and libraries will build, and the binaries will be
-    deposited in llvm/tools/Debug, but the runtime (bytecode)
-    libraries will not build.</p></li>
+    <p>This will build all of the LLVM tools and libraries, but you will see 
+       warnings about missing the C front-end (certain runtime libraries can't
+       be built without it).  Ignore these warnings for now.</p></li>
 
 <li><p>Add the directory containing the tools to your PATH.</p>
 <pre>
@@ -48,9 +94,6 @@ good GCC hacker.</p>
 
 <li><p>Unpack the C/C++ front-end source into cfrontend/src.</p></li>
 
-<li><p>Edit src/configure.  Change the first line (starting w/ #!) to
-       contain the correct full pathname of sh.</p></li>
-
 <li><p>Make "build" and "install" directories as siblings of the "src"
        tree.</p>
 <pre>
@@ -61,12 +104,50 @@ good GCC hacker.</p>
  % set CFEINSTALL = `pwd`/install
 </pre></li>
 
-<li><p>Configure, build and install the C front-end:</p>
+
+<li><p>Configure, build, and install the C front-end:</p>
+
+<p>
+<b>Linux/x86:</b><br>
+<b>MacOS X/PowerPC</b> (requires dlcompat library):
+</p>
+
 <pre>
  % cd build
- % ../src/configure --prefix=$CFEINSTALL --disable-nls --disable-shared \
+ % ../src/configure --prefix=$CFEINSTALL --disable-threads --disable-nls --disable-shared \
    --enable-languages=c,c++
- % gmake all-gcc
+ % gmake
+ % setenv LLVM_LIB_SEARCH_PATH `pwd`/gcc 
+ % gmake all; gmake install
+</pre>
+
+<p><b>Cygwin/x86:</b></p>
+
+<pre>
+ % cd build
+ % ../src/configure --prefix=$CFEINSTALL --disable-threads --disable-nls --disable-shared \
+   --enable-languages=c,c++ --disable-c-mbchar
+ % gmake
+ % setenv LLVM_LIB_SEARCH_PATH `pwd`/gcc 
+ % gmake all; gmake install
+</pre>
+
+<p><b>Solaris/SPARC:</b></p>
+
+<p>
+For Solaris/SPARC, LLVM only supports the SPARC V9.  Therefore, the
+configure command line should specify sparcv9, as shown below. Also,
+note that Solaris has trouble with various wide (multibyte) character
+functions from C as referenced from C++, so we typically configure with
+--disable-c-mbchar (cf. <a href="http://llvm.cs.uiuc.edu/PR206">Bug 206</a>).
+</p>
+
+<pre>
+ % cd build
+ % ../src/configure --prefix=$CFEINSTALL --disable-threads --disable-nls \
+   --disable-shared --enable-languages=c,c++ --host=sparcv9-sun-solaris2.8 \
+   --disable-c-mbchar
+ % gmake
  % setenv LLVM_LIB_SEARCH_PATH `pwd`/gcc 
  % gmake all; gmake install
 </pre>
@@ -79,13 +160,13 @@ good GCC hacker.</p>
   <li><p><b>Fix 1:</b> If you have system header files that include
    inline assembly, you may have to modify them to remove the inline
    assembly, and install the modified versions in
-   <code>$CFEINSTALL/<i>target-triplet</i>/sys-include</code>.</p></li>
+   <code>$CFEINSTALL/<i>target-triplet</i>/sys-include</code>.</li>
 
   <li><b>Fix 2:</b> If you are building the C++ front-end on a CPU we
    haven't tried yet, you will probably have to edit the appropriate
    version of atomicity.h under
    <code>src/libstdc++-v3/config/cpu/<i>name-of-cpu</i>/atomicity.h</code>
-   and apply a patch so that it does not use inline assembly.</p></li>
+   and apply a patch so that it does not use inline assembly.</li>
  </ul>
 
  <p><b>Porting to a new architecture:</b> If you are porting the new front-end
@@ -105,17 +186,20 @@ good GCC hacker.</p>
   <li>No inline assembly for position independent code.  At the LLVM level,
       everything is position independent.</li>
   <li>We handle <tt>.init</tt> and <tt>.fini</tt> differently.</li>
+  <li>You may have to disable multilib support in your target.  Using multilib
+      support causes the GCC compiler driver to add a lot of "<tt>-L</tt>"
+      options to the link line, which do not relate to LLVM and confuse
+      <tt>gccld</tt>.  To disable multilibs, delete any
+      <tt>MULTILIB_OPTIONS</tt> lines from your target files.</li>
   <li>Did we mention that we don't support inline assembly?  You'll probably
       have to add some fixinclude hacks to disable it in the system
       headers.</li>
  </ul>
 </li>
 
-<li><p>Go back into the LLVM source tree proper. Edit Makefile.config
-to redefine <code>LLVMGCCDIR</code> to the full pathname of the
-<code>$CFEINSTALL</code> directory, which is the directory you just
-installed the C front-end into. (The ./configure script is likely to
-have set this to a directory which does not exist on your system.)</p></li>
+<li><p>Go back into the LLVM source tree proper.  Rerun configure, using
+the <code>--with-llvmgccdir=$CFEINSTALL</code> option to specify the path
+to the newly built C front-end.</p></li>
 
 <li><p>If you edited header files during the C/C++ front-end build as
 described in "Fix 1" above, you must now copy those header files from
@@ -125,11 +209,14 @@ described in "Fix 1" above, you must now copy those header files from
 libgcc.a library, which you can find by running
 <code>$CFEINSTALL/bin/gcc --print-libgcc-file-name</code>.)</p></li>
 
-<li><p>Build and install the runtime (bytecode) libraries by running:</p>
+<li><p>Rebuild your CVS tree.  This shouldn't cause the whole thing to be
+  rebuilt, but it should build the runtime libraries.  After the tree is
+  built, install the runtime libraries into your C front-end build tree.
+  These are the commands you need.</p>
 <pre>
- % gmake -C runtime
+ % gmake
  % mkdir $CFEINSTALL/bytecode-libs
- % gmake -C runtime install
+ % gmake -C runtime install-bytecode
  % setenv LLVM_LIB_SEARCH_PATH $CFEINSTALL/bytecode-libs
 </pre></li>
 
@@ -139,18 +226,84 @@ following means:</p>
   <li> compiling and running a "hello, LLVM" program in C and C++.</li>
   <li> running the tests under <tt>test/Programs</tt> using <code>gmake -C
    test/Programs</code></li>
- </ul>
-  </p>
-</li>
+ </ul></li>
 </ol>
 </div>
 
 <!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="license">License Information</a>
+</div>
 
-<hr><font size="-1">
-<address><a href="mailto:gaeke -at- uiuc.edu">Brian Gaeke</a></address>
-Last modified: $Date$
-</font>
+<div class="doc_text">
+<p>
+The LLVM GCC frontend is licensed to you under the GNU General Public License
+and the GNU Lesser General Public License.  Please see the files COPYING and
+COPYING.LIB for more details.
+</p>
+
+<p>
+The software also has the following additional copyrights:
+</p>
+
+<pre>
+
+Copyright (c) 2003, 2004 University of Illinois at Urbana-Champaign.
+All rights reserved.
+
+Developed by:
+
+    LLVM Team
+
+    University of Illinois at Urbana-Champaign
+
+    http://llvm.cs.uiuc.edu
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE
+SOFTWARE.
+
+Copyright (c) 1994
+Hewlett-Packard Company
+
+Permission to use, copy, modify, distribute and sell this software
+and its documentation for any purpose is hereby granted without fee,
+provided that the above copyright notice appear in all copies and
+that both that copyright notice and this permission notice appear
+in supporting documentation.  Hewlett-Packard Company makes no
+representations about the suitability of this software for any
+purpose.  It is provided "as is" without express or implied warranty.
+
+Copyright (c) 1996, 1997, 1998, 1999
+Silicon Graphics Computer Systems, Inc.
+
+Permission to use, copy, modify, distribute and sell this software
+and its documentation for any purpose is hereby granted without fee,
+provided that the above copyright notice appear in all copies and
+that both that copyright notice and this permission notice appear
+in supporting documentation.  Silicon Graphics makes no
+representations about the suitability of this software for any
+purpose.  It is provided "as is" without express or implied warranty.
+</pre>
+</div>
+
+<!-- *********************************************************************** -->
+
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
+
+  Brian Gaeke<br>
+  <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
 
 </body>
 </html>

llvm/docs/CodeGenerator.html

@@ -0,0 +1,644 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <title>The LLVM Target-Independent Code Generator</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+<body>
+
+<div class="doc_title">
+  The LLVM Target-Independent Code Generator
+</div>
+
+<ol>
+  <li><a href="#introduction">Introduction</a>
+    <ul>
+      <li><a href="#required">Required components in the code generator</a></li>
+      <li><a href="#high-level-design">The high-level design of the code generator</a></li>
+      <li><a href="#tablegen">Using TableGen for target description</a></li>
+    </ul>
+  </li>
+  <li><a href="#targetdesc">Target description classes</a>
+    <ul>
+      <li><a href="#targetmachine">The <tt>TargetMachine</tt> class</a></li>
+      <li><a href="#targetdata">The <tt>TargetData</tt> class</a></li>
+      <li><a href="#mregisterinfo">The <tt>MRegisterInfo</tt> class</a></li>
+      <li><a href="#targetinstrinfo">The <tt>TargetInstrInfo</tt> class</a></li>
+      <li><a href="#targetframeinfo">The <tt>TargetFrameInfo</tt> class</a></li>
+      <li><a href="#targetjitinfo">The <tt>TargetJITInfo</tt> class</a></li>
+    </ul>
+  </li>
+  <li><a href="#codegendesc">Machine code description classes</a>
+    <ul>
+      <li><a href="#machineinstr">The <tt>MachineInstr</tt> class</a></li>
+    </ul>
+  </li>
+  <li><a href="#codegenalgs">Target-independent code generation algorithms</a>
+  </li>
+  <li><a href="#targetimpls">Target description implementations</a>
+    <ul>
+      <li><a href="#x86">The X86 backend</a></li>
+    </ul>
+  </li>
+
+</ol>
+
+<div class="doc_author">
+  <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a></p>
+</div>
+
+<div class="doc_warning">
+  <p>Warning: This is a work in progress.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="introduction">Introduction</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>The LLVM target-independent code generator is a framework that provides a
+suite of reusable components for translating the LLVM internal representation to
+the machine code for a specified target -- either in assembly form (suitable for
+a static compiler) or in binary machine code format (usable for a JIT compiler).
+The LLVM target-independent code generator consists of five main components:</p>
+
+<ol>
+<li><a href="#targetdesc">Abstract target description</a> interfaces which
+capture important properties about various aspects of the machine, independently
+of how they will be used.  These interfaces are defined in
+<tt>include/llvm/Target/</tt>.</li>
+
+<li>Classes used to represent the <a href="#codegendesc">machine code</a> being
+generated for a target.  These classes are intended to be abstract enough to
+represent the machine code for <i>any</i> target machine.  These classes are
+defined in <tt>include/llvm/CodeGen/</tt>.</li>
+
+<li><a href="#codegenalgs">Target-independent algorithms</a> used to implement
+various phases of native code generation (register allocation, scheduling, stack
+frame representation, etc).  This code lives in <tt>lib/CodeGen/</tt>.</li>
+
+<li><a href="#targetimpls">Implementations of the abstract target description
+interfaces</a> for particular targets.  These machine descriptions make use of
+the components provided by LLVM, and can optionally provide custom
+target-specific passes, to build complete code generators for a specific target.
+Target descriptions live in <tt>lib/Target/</tt>.</li>
+
+<li><a href="#jit">The target-independent JIT components</a>.  The LLVM JIT is
+completely target independent (it uses the <tt>TargetJITInfo</tt> structure to
+interface for target-specific issues.  The code for the target-independent
+JIT lives in <tt>lib/ExecutionEngine/JIT</tt>.</li>
+
+</ol>
+
+<p>
+Depending on which part of the code generator you are interested in working on,
+different pieces of this will be useful to you.  In any case, you should be
+familiar with the <a href="#targetdesc">target description</a> and <a
+href="#codegendesc">machine code representation</a> classes.  If you want to add
+a backend for a new target, you will need to <a href="#targetimpls">implement the
+target description</a> classes for your new target and understand the <a
+href="LangRef.html">LLVM code representation</a>.  If you are interested in
+implementing a new <a href="#codegenalgs">code generation algorithm</a>, it
+should only depend on the target-description and machine code representation
+classes, ensuring that it is portable.
+</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+ <a name="required">Required components in the code generator</a>
+</div>
+
+<div class="doc_text">
+
+<p>The two pieces of the LLVM code generator are the high-level interface to the
+code generator and the set of reusable components that can be used to build
+target-specific backends.  The two most important interfaces (<a
+href="#targetmachine"><tt>TargetMachine</tt></a> and <a
+href="#targetdata"><tt>TargetData</tt></a> classes) are the only ones that are
+required to be defined for a backend to fit into the LLVM system, but the others
+must be defined if the reusable code generator components are going to be
+used.</p>
+
+<p>This design has two important implications.  The first is that LLVM can
+support completely non-traditional code generation targets.  For example, the C
+backend does not require register allocation, instruction selection, or any of
+the other standard components provided by the system.  As such, it only
+implements these two interfaces, and does its own thing.  Another example of a
+code generator like this is a (purely hypothetical) backend that converts LLVM
+to the GCC RTL form and uses GCC to emit machine code for a target.</p>
+
+<p>This design also implies that it is possible to design and
+implement radically different code generators in the LLVM system that do not
+make use of any of the built-in components.  Doing so is not recommended at all,
+but could be required for radically different targets that do not fit into the
+LLVM machine description model: programmable FPGAs for example.</p>
+
+<p><b>Important Note:</b> For historical reasons, the LLVM SparcV9 code
+generator uses almost entirely different code paths than described in this
+document.  For this reason, there are some deprecated interfaces (such as
+<tt>TargetRegInfo</tt> and <tt>TargetSchedInfo</tt>), which are only used by the
+V9 backend and should not be used by any other targets.  Also, all code in the
+<tt>lib/Target/SparcV9</tt> directory and subdirectories should be considered
+deprecated, and should not be used as the basis for future code generator work.
+The SparcV9 backend is slowly being merged into the rest of the
+target-independent code generators, but this is a low-priority process with no
+predictable completion date.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+ <a name="high-level-design">The high-level design of the code generator</a>
+</div>
+
+<div class="doc_text">
+
+<p>The LLVM target-indendent code generator is designed to support efficient and
+quality code generation for standard register-based microprocessors.  Code
+generation in this model is divided into the following stages:</p>
+
+<ol>
+<li><b>Instruction Selection</b> - Determining an efficient implementation of the
+input LLVM code in the target instruction set.  This stage produces the initial
+code for the program in the target instruction set, then makes use of virtual
+registers in SSA form and physical registers that represent any required
+register assignments due to target constraints or calling conventions.</li>
+
+<li><b>SSA-based Machine Code Optimizations</b> - This (optional) stage consists
+of a series of machine-code optimizations that operate on the SSA-form produced
+by the instruction selector.  Optimizations like modulo-scheduling, normal
+scheduling, or peephole optimization work here.</li>
+
+<li><b>Register Allocation</b> - The target code is transformed from an infinite
+virtual register file in SSA form to the concrete register file used by the
+target.  This phase introduces spill code and eliminates all virtual register
+references from the program.</li>
+
+<li><b>Prolog/Epilog Code Insertion</b> - Once the machine code has been
+generated for the function and the amount of stack space required is known (used
+for LLVM alloca's and spill slots), the prolog and epilog code for the function
+can be inserted and "abstract stack location references" can be eliminated.
+This stage is responsible for implementing optimizations like frame-pointer
+elimination and stack packing.</li>
+
+<li><b>Late Machine Code Optimizations</b> - Optimizations that operate on
+"final" machine code can go here, such as spill code scheduling and peephole
+optimizations.</li>
+
+<li><b>Code Emission</b> - The final stage actually outputs the code for
+the current function, either in the target assembler format or in machine
+code.</li>
+
+</ol>
+
+<p>
+The code generator is based on the assumption that the instruction selector will
+use an optimal pattern matching selector to create high-quality sequences of
+native instructions.  Alternative code generator designs based on pattern 
+expansion and
+aggressive iterative peephole optimization are much slower.  This design 
+permits efficient compilation (important for JIT environments) and
+aggressive optimization (used when generating code offline) by allowing 
+components of varying levels of sophisication to be used for any step of 
+compilation.</p>
+
+<p>
+In addition to these stages, target implementations can insert arbitrary
+target-specific passes into the flow.  For example, the X86 target uses a
+special pass to handle the 80x87 floating point stack architecture.  Other
+targets with unusual requirements can be supported with custom passes as needed.
+</p>
+
+</div>
+
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+ <a name="tablegen">Using TableGen for target description</a>
+</div>
+
+<div class="doc_text">
+
+<p>The target description classes require a detailed description of the target
+architecture.  These target descriptions often have a large amount of common
+information (e.g., an add instruction is almost identical to a sub instruction).
+In order to allow the maximum amount of commonality to be factored out, the LLVM
+code generator uses the <a href="TableGenFundamentals.html">TableGen</a> tool to
+describe big chunks of the target machine, which allows the use of domain- and 
+target-specific abstractions to reduce the amount of repetition.
+</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="targetdesc">Target description classes</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>The LLVM target description classes (which are located in the
+<tt>include/llvm/Target</tt> directory) provide an abstract description of the
+target machine, independent of any particular client.  These classes are
+designed to capture the <i>abstract</i> properties of the target (such as what
+instruction and registers it has), and do not incorporate any particular pieces
+of code generation algorithms (these interfaces do not take interference graphs
+as inputs or other algorithm-specific data structures).</p>
+
+<p>All of the target description classes (except the <tt><a
+href="#targetdata">TargetData</a></tt> class) are designed to be subclassed by
+the concrete target implementation, and have virtual methods implemented.  To
+get to these implementations, the <tt><a
+href="#targetmachine">TargetMachine</a></tt> class provides accessors that
+should be implemented by the target.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="targetmachine">The <tt>TargetMachine</tt> class</a>
+</div>
+
+<div class="doc_text">
+
+<p>The <tt>TargetMachine</tt> class provides virtual methods that are used to
+access the target-specific implementations of the various target description
+classes (with the <tt>getInstrInfo</tt>, <tt>getRegisterInfo</tt>,
+<tt>getFrameInfo</tt>, ... methods).  This class is designed to be specialized by
+a concrete target implementation (e.g., <tt>X86TargetMachine</tt>) which
+implements the various virtual methods.  The only required target description
+class is the <a href="#targetdata"><tt>TargetData</tt></a> class, but if the
+code generator components are to be used, the other interfaces should be
+implemented as well.</p>
+
+</div>
+
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="targetdata">The <tt>TargetData</tt> class</a>
+</div>
+
+<div class="doc_text">
+
+<p>The <tt>TargetData</tt> class is the only required target description class,
+and it is the only class that is not extensible (it cannot be derived from).  It
+specifies information about how the target lays out memory for structures, the
+alignment requirements for various data types, the size of pointers in the
+target, and whether the target is little- or big-endian.</p>
+
+</div>
+
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="mregisterinfo">The <tt>MRegisterInfo</tt> class</a>
+</div>
+
+<div class="doc_text">
+
+<p>The <tt>MRegisterInfo</tt> class (which will eventually be renamed to
+<tt>TargetRegisterInfo</tt>) is used to describe the register file of the
+target and any interactions between the registers.</p>
+
+<p>Registers in the code generator are represented in the code generator by
+unsigned numbers.  Physical registers (those that actually exist in the target
+description) are unique small numbers, and virtual registers are generally
+large.</p>
+
+<p>Each register in the processor description has an associated
+<tt>MRegisterDesc</tt> entry, which provides a textual name for the register
+(used for assembly output and debugging dumps), a set of aliases (used to
+indicate that one register overlaps with another), and some flag bits.
+</p>
+
+<p>In addition to the per-register description, the <tt>MRegisterInfo</tt> class
+exposes a set of processor specific register classes (instances of the
+<tt>TargetRegisterClass</tt> class).  Each register class contains sets of
+registers that have the same properties (for example, they are all 32-bit
+integer registers).  Each SSA virtual register created by the instruction
+selector has an associated register class.  When the register allocator runs, it
+replaces virtual registers with a physical register in the set.</p>
+
+<p>
+The target-specific implementations of these classes is auto-generated from a <a
+href="TableGenFundamentals.html">TableGen</a> description of the register file.
+</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="targetinstrinfo">The <tt>TargetInstrInfo</tt> class</a>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="targetframeinfo">The <tt>TargetFrameInfo</tt> class</a>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="targetjitinfo">The <tt>TargetJITInfo</tt> class</a>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="codegendesc">Machine code description classes</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>
+At the high-level, LLVM code is translated to a machine specific representation
+formed out of MachineFunction, MachineBasicBlock, and <a 
+href="#machineinstr"><tt>MachineInstr</tt></a> instances
+(defined in include/llvm/CodeGen).  This representation is completely target
+agnostic, representing instructions in their most abstract form: an opcode and a
+series of operands.  This representation is designed to support both SSA
+representation for machine code, as well as a register allocated, non-SSA form.
+</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="machineinstr">The <tt>MachineInstr</tt> class</a>
+</div>
+
+<div class="doc_text">
+
+<p>Target machine instructions are represented as instances of the
+<tt>MachineInstr</tt> class.  This class is an extremely abstract way of
+representing machine instructions.  In particular, all it keeps track of is 
+an opcode number and some number of operands.</p>
+
+<p>The opcode number is an simple unsigned number that only has meaning to a 
+specific backend.  All of the instructions for a target should be defined in 
+the <tt>*InstrInfo.td</tt> file for the target, and the opcode enum values
+are autogenerated from this description.  The <tt>MachineInstr</tt> class does
+not have any information about how to intepret the instruction (i.e., what the 
+semantics of the instruction are): for that you must refer to the 
+<tt><a href="#targetinstrinfo">TargetInstrInfo</a></tt> class.</p> 
+
+<p>The operands of a machine instruction can be of several different types:
+they can be a register reference, constant integer, basic block reference, etc.
+In addition, a machine operand should be marked as a def or a use of the value
+(though only registers are allowed to be defs).</p>
+
+<p>By convention, the LLVM code generator orders instruction operands so that
+all register definitions come before the register uses, even on architectures
+that are normally printed in other orders.  For example, the sparc add 
+instruction: "<tt>add %i1, %i2, %i3</tt>" adds the "%i1", and "%i2" registers
+and stores the result into the "%i3" register.  In the LLVM code generator,
+the operands should be stored as "<tt>%i3, %i1, %i2</tt>": with the destination
+first.</p>
+
+<p>Keeping destination operands at the beginning of the operand list has several
+advantages.  In particular, the debugging printer will print the instruction 
+like this:</p>
+
+<pre>
+  %r3 = add %i1, %i2
+</pre>
+
+<p>If the first operand is a def, and it is also easier to <a 
+href="#buildmi">create instructions</a> whose only def is the first 
+operand.</p>
+
+</div>
+
+<!-- _______________________________________________________________________ -->
+<div class="doc_subsubsection">
+  <a name="buildmi">Using the <tt>MachineInstrBuilder.h</tt> functions</a>
+</div>
+
+<div class="doc_text">
+
+<p>Machine instructions are created by using the <tt>BuildMI</tt> functions,
+located in the <tt>include/llvm/CodeGen/MachineInstrBuilder.h</tt> file.  The
+<tt>BuildMI</tt> functions make it easy to build arbitrary machine 
+instructions.  Usage of the <tt>BuildMI</tt> functions look like this: 
+</p>
+
+<pre>
+  // Create a 'DestReg = mov 42' (rendered in X86 assembly as 'mov DestReg, 42')
+  // instruction.  The '1' specifies how many operands will be added.
+  MachineInstr *MI = BuildMI(X86::MOV32ri, 1, DestReg).addImm(42);
+
+  // Create the same instr, but insert it at the end of a basic block.
+  MachineBasicBlock &amp;MBB = ...
+  BuildMI(MBB, X86::MOV32ri, 1, DestReg).addImm(42);
+
+  // Create the same instr, but insert it before a specified iterator point.
+  MachineBasicBlock::iterator MBBI = ...
+  BuildMI(MBB, MBBI, X86::MOV32ri, 1, DestReg).addImm(42);
+
+  // Create a 'cmp Reg, 0' instruction, no destination reg.
+  MI = BuildMI(X86::CMP32ri, 2).addReg(Reg).addImm(0);
+  // Create an 'sahf' instruction which takes no operands and stores nothing.
+  MI = BuildMI(X86::SAHF, 0);
+
+  // Create a self looping branch instruction.
+  BuildMI(MBB, X86::JNE, 1).addMBB(&amp;MBB);
+</pre>
+
+<p>
+The key thing to remember with the <tt>BuildMI</tt> functions is that you have
+to specify the number of operands that the machine instruction will take 
+(allowing efficient memory allocation).  Also, if operands default to be uses
+of values, not definitions.  If you need to add a definition operand (other 
+than the optional destination register), you must explicitly mark it as such.
+</p>
+
+</div>
+
+<!-- _______________________________________________________________________ -->
+<div class="doc_subsubsection">
+  <a name="fixedregs">Fixed (aka preassigned) registers</a>
+</div>
+
+<div class="doc_text">
+
+<p>One important issue that the code generator needs to be aware of is the
+presence of fixed registers.  In particular, there are often places in the 
+instruction stream where the register allocator <em>must</em> arrange for a
+particular value to be in a particular register.  This can occur due to 
+limitations in the instruction set (e.g., the X86 can only do a 32-bit divide 
+with the <tt>EAX</tt>/<tt>EDX</tt> registers), or external factors like calling
+conventions.  In any case, the instruction selector should emit code that 
+copies a virtual register into or out of a physical register when needed.</p>
+
+<p>For example, consider this simple LLVM example:</p>
+
+<pre>
+  int %test(int %X, int %Y) {
+    %Z = div int %X, %Y
+    ret int %Z
+  }
+</pre>
+
+<p>The X86 instruction selector produces this machine code for the div 
+and ret (use 
+"<tt>llc X.bc -march=x86 -print-machineinstrs</tt>" to get this):</p>
+
+<pre>
+        ;; Start of div
+        %EAX = mov %reg1024           ;; Copy X (in reg1024) into EAX
+        %reg1027 = sar %reg1024, 31
+        %EDX = mov %reg1027           ;; Sign extend X into EDX
+        idiv %reg1025                 ;; Divide by Y (in reg1025)
+        %reg1026 = mov %EAX           ;; Read the result (Z) out of EAX
+
+        ;; Start of ret
+        %EAX = mov %reg1026           ;; 32-bit return value goes in EAX
+        ret
+</pre>
+
+<p>By the end of code generation, the register allocator has coallesced
+the registers and deleted the resultant identity moves, producing the
+following code:</p>
+
+<pre>
+        ;; X is in EAX, Y is in ECX
+        mov %EAX, %EDX
+        sar %EDX, 31
+        idiv %ECX
+        ret 
+</pre>
+
+<p>This approach is extremely general (if it can handle the X86 architecture, 
+it can handle anything!) and allows all of the target specific
+knowledge about the instruction stream to be isolated in the instruction 
+selector.  Note that physical registers should have a short lifetime for good 
+code generation, and all physical registers are assumed dead on entry and
+exit of basic blocks (before register allocation).  Thus if you need a value
+to be live across basic block boundaries, it <em>must</em> live in a virtual 
+register.</p>
+
+</div>
+
+<!-- _______________________________________________________________________ -->
+<div class="doc_subsubsection">
+  <a name="ssa">Machine code SSA form</a>
+</div>
+
+<div class="doc_text">
+
+<p><tt>MachineInstr</tt>'s are initially instruction selected in SSA-form, and
+are maintained in SSA-form until register allocation happens.  For the most 
+part, this is trivially simple since LLVM is already in SSA form: LLVM PHI nodes
+become machine code PHI nodes, and virtual registers are only allowed to have a
+single definition.</p>
+
+<p>After register allocation, machine code is no longer in SSA-form, as there 
+are no virtual registers left in the code.</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="targetimpls">Target description implementations</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>This section of the document explains any features or design decisions that
+are specific to the code generator for a particular target.</p>
+
+</div>
+
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="x86">The X86 backend</a>
+</div>
+
+<div class="doc_text">
+
+<p>
+The X86 code generator lives in the <tt>lib/Target/X86</tt> directory.  This
+code generator currently targets a generic P6-like processor.  As such, it
+produces a few P6-and-above instructions (like conditional moves), but it does
+not make use of newer features like MMX or SSE.  In the future, the X86 backend
+will have subtarget support added for specific processor families and 
+implementations.</p>
+
+</div>
+
+<!-- _______________________________________________________________________ -->
+<div class="doc_subsubsection">
+  <a name="x86_memory">Representing X86 addressing modes in MachineInstrs</a>
+</div>
+
+<div class="doc_text">
+
+<p>
+The x86 has a very, uhm, flexible, way of accessing memory.  It is capable of
+forming memory addresses of the following expression directly in integer
+instructions (which use ModR/M addressing):</p>
+
+<pre>
+   Base+[1,2,4,8]*IndexReg+Disp32
+</pre>
+
+<p>Wow, that's crazy.  In order to represent this, LLVM tracks no less that 4
+operands for each memory operand of this form.  This means that the "load" form
+of 'mov' has the following "Operands" in this order:</p>
+
+<pre>
+Index:        0     |    1        2       3           4
+Meaning:   DestReg, | BaseReg,  Scale, IndexReg, Displacement
+OperandTy: VirtReg, | VirtReg, UnsImm, VirtReg,   SignExtImm
+</pre>
+
+<p>Stores and all other instructions treat the four memory operands in the same
+way, in the same order.</p>
+
+</div>
+
+<!-- _______________________________________________________________________ -->
+<div class="doc_subsubsection">
+  <a name="x86_names">Instruction naming</a>
+</div>
+
+<div class="doc_text">
+
+<p>
+An instruction name consists of the base name, a default operand size
+followed by a character per operand with an optional special size. For
+example:</p>
+
+<p>
+<tt>ADD8rr</tt> -&gt; add, 8-bit register, 8-bit register<br>
+<tt>IMUL16rmi</tt> -&gt; imul, 16-bit register, 16-bit memory, 16-bit immediate<br>
+<tt>IMUL16rmi8</tt> -&gt; imul, 16-bit register, 16-bit memory, 8-bit immediate<br>
+<tt>MOVSX32rm16</tt> -&gt; movsx, 32-bit register, 16-bit memory
+</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" /></a>
+
+  <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
+  <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
+
+</body>
+</html>

llvm/docs/CommandGuide/Makefile

@@ -0,0 +1,23 @@
+POD = $(wildcard *.pod)
+HTML = $(patsubst %.pod, html/%.html, $(POD))
+MAN = $(patsubst %.pod, man/man1/%.1, $(POD))
+PS = $(patsubst %.pod, ps/%.ps, $(POD))
+
+all: $(HTML) $(MAN) $(PS)
+
+.SUFFIXES:
+.SUFFIXES: .html .pod .1 .ps
+
+html/%.html: %.pod
+	pod2html --css=manpage.css --htmlroot=. \
+		--podpath=. --noindex --infile=$< --outfile=$@
+
+man/man1/%.1: %.pod
+	pod2man --release=1.3 --center="LLVM Command Guide" $< $@
+
+ps/%.ps: man/man1/%.1
+	groff -Tps -man $< > $@
+
+clean:
+	rm -f pod2htm*.*~~ $(HTML) $(MAN) $(PS)
+

llvm/docs/CommandGuide/analyze.html

@@ -1,81 +0,0 @@
-<html>
-<title>
-LLVM: analyze tool
-</title>
-
-<body bgcolor=white>
-
-<center><h1>LLVM: <tt>analyze</tt> tool</h1></center>
-<HR>
-
-<h3>NAME</h3>
-<tt>analyze</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>analyze [options] [filename]</tt>
-
-<h3>DESCRIPTION</h3>
-
-The <tt>analyze</tt> command performs various analysis of LLVM assembly code or
-bytecode.  It will usually print the results on standard output, but in a few
-cases, it will print output to standard error or generate a file with the
-analysis output (which is usually done when the output is meant for another
-program).
-<p>
-If filename is omitted or is -, <tt>analyze</tt> reads its input from standard
-input.  It first attempts to interpret its input as LLVM bytecode.  If it
-encounters an error, it then attempts to parse the input as LLVM assembly
-language.
-
-<h3>OPTIONS</h3>
-
-<ul>
-	<li> -help
-	<br>
-	Print a summary of command line options.
-	<p>
-
-	<li> -stats
-	<br>
-	Print statistics.
-	<p>
-
-	<li> -time-passes
-	<br>
-	Record the amount of time needed for each pass and print it to standard
-	error.
-	<p>
-
-	<li> -q
-	<br>
-	Quiet mode.  With this option, analysis pass names are not printed.
-	<p>
-
-	<li> -load &lt;plugin.so&gt;
-	<br>
-	Load the specified dynamic object with name plugin.so.  This file
-	should contain additional analysis passes that register themselves with
-	the <tt>analyze</tt> program after being loaded.
-	<p>
-
-	After being loaded, additional command line options are made available
-	for running the passes made available by plugin.so.  Use
-	'<tt><tt>analyze</tt> -load &lt;plugin.so&gt; -help</tt>' to see the new
-	list of available analysis passes.
-	<p>
-</ul>
-
-<h3>EXIT STATUS</h3>
-
-If <tt>analyze</tt> succeeds, it will exit with 0.  Otherwise, if an error
-occurs, it will exit with a non-zero value.
-
-<h3>SEE ALSO</h3>
-
-<a href="opt.html"><tt>opt</tt></a>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/analyze.pod

@@ -0,0 +1,75 @@
+=pod
+
+=head1 NAME
+
+analyze - LLVM program analyzer
+
+=head1 SYNOPSIS
+
+B<analyze> [I<options>] [I<filename>]
+
+=head1 DESCRIPTION
+
+The B<analyze> command performs various analysis of LLVM assembly
+code or bytecode.  It will usually print the results on standard
+output, but in a few cases, it will print output to standard error
+or generate a file with the analysis output, which is usually done
+when the output is meant for another program.
+
+If filename is omitted or is I<->, B<analyze> reads its input from
+standard input.  It first attempts to interpret its input as LLVM
+bytecode.  If it encounters an error, it then attempts to parse the
+input as LLVM assembly language.
+
+=head1 OPTIONS
+
+=over
+
+=item B<-help>
+
+Print a summary of command line options.
+
+=item B<-q>
+
+Quiet mode.  With this option, analysis pass names are not printed.
+
+=item B<-load> I<plugin>
+
+Load the specified dynamic object with name I<plugin>.  This file
+should contain additional analysis passes that register themselves
+with the B<analyze> program after being loaded.
+
+After being loaded, additional command line options are made
+available for running the passes made available by I<plugin>.  Use
+B<analyze -load> I<plugin> B<-help> to see the new list of available
+analysis passes.
+
+=item B<-profile-info-file> I<filename>
+
+Specify the name of the file loaded by the -profile-loader option.
+
+=item B<-stats>
+
+Print statistics.
+
+=item B<-time-passes>
+
+Record the amount of time needed for each pass and print it to standard
+error.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<analyze> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<opt|opt>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/bugpoint.pod

@@ -0,0 +1,249 @@
+=pod
+
+=head1 NAME
+
+bugpoint - automatic test case reduction tool
+
+=head1 SYNOPSIS
+
+B<bugpoint> [I<options>] [I<input LLVM ll/bc files>] [I<LLVM passes>] B<--args>
+I<program arguments>
+
+=head1 DESCRIPTION
+
+B<bugpoint> narrows down the source of problems in LLVM tools and passes.  It
+can be used to debug three types of failures: optimizer crashes, miscompilations
+by optimizers, or bad native code generation (including problems in the static
+and JIT compilers).  It aims to reduce large test cases to small, useful ones.
+For example, if B<gccas> crashes while optimizing a file, it will identify the
+optimization (or combination of optimizations) that causes the crash, and reduce
+the file down to a small example which triggers the crash.
+
+=head2 Design Philosophy
+
+B<bugpoint> is designed to be a useful tool without requiring any hooks into the
+LLVM infrastructure at all.  It works with any and all LLVM passes and code
+generators, and does not need to "know" how they work.  Because of this, it may
+appear to do stupid things or miss obvious simplifications.  B<bugpoint> is also
+designed to trade off programmer time for computer time in the
+compiler-debugging process; consequently, it may take a long period of
+(unattended) time to reduce a test case, but we feel it is still worth it. Note
+that B<bugpoint> is generally very quick unless debugging a miscompilation where
+each test of the program (which requires executing it) takes a long time.
+
+=head2 Automatic Debugger Selection
+
+B<bugpoint> reads each F<.bc> or F<.ll> file specified on the command line and
+links them together into a single module, called the test program.  If any LLVM
+passes are specified on the command line, it runs these passes on the test
+program.  If any of the passes crash, or if they produce malformed output (which
+causes the verifier to abort), B<bugpoint> starts the crash debugger.
+
+Otherwise, if the B<-output> option was not specified, B<bugpoint> runs the test
+program with the C backend (which is assumed to generate good code) to generate
+a reference output.  Once B<bugpoint> has a reference output for the test
+program, it tries executing it with the selected code generator.  If the
+selected code generator crashes, B<bugpoint> starts the L</Crash debugger> on
+the code generator.  Otherwise, if the resulting output differs from the
+reference output, it assumes the difference resulted from a code generator
+failure, and starts the L</Code generator debugger>.
+
+Finally, if the output of the selected code generator matches the reference
+output, B<bugpoint> runs the test program after all of the LLVM passes have been
+applied to it.  If its output differs from the reference output, it assumes the
+difference resulted from a failure in one of the LLVM passes, and enters the
+miscompilation debugger. Otherwise, there is no problem B<bugpoint> can debug.
+
+=head2 Crash debugger
+
+If an optimizer or code generator crashes, B<bugpoint> will try as hard as it
+can to reduce the list of passes (for optimizer crashes) and the size of the
+test program.  First, B<bugpoint> figures out which combination of optimizer
+passes triggers the bug. This is useful when debugging a problem exposed by
+B<gccas>, for example, because it runs over 38 passes.
+
+Next, B<bugpoint> tries removing functions from the test program, to reduce its
+size.  Usually it is able to reduce a test program to a single function, when
+debugging intraprocedural optimizations.  Once the number of functions has been
+reduced, it attempts to delete various edges in the control flow graph, to
+reduce the size of the function as much as possible.  Finally, B<bugpoint>
+deletes any individual LLVM instructions whose absence does not eliminate the
+failure.  At the end, B<bugpoint> should tell you what passes crash, give you a
+bytecode file, and give you instructions on how to reproduce the failure with
+B<opt>, B<analyze>, or B<llc>.
+
+=head2 Code generator debugger
+
+The code generator debugger attempts to narrow down the amount of code that is
+being miscompiled by the selected code generator.  To do this, it takes the test
+program and partitions it into two pieces: one piece which it compiles with the
+C backend (into a shared object), and one piece which it runs with either the
+JIT or the static compiler (B<llc>).  It uses several techniques to reduce the
+amount of code pushed through the LLVM code generator, to reduce the potential
+scope of the problem.  After it is finished, it emits two bytecode files (called
+"test" [to be compiled with the code generator] and "safe" [to be compiled with
+the C backend], respectively), and instructions for reproducing the problem.
+The code generator debugger assumes that the C backend produces good code.
+
+=head2 Miscompilation debugger
+
+The miscompilation debugger works similarly to the code generator debugger.  It
+works by splitting the test program into two pieces, running the optimizations
+specified on one piece, linking the two pieces back together, and then executing
+the result.  It attempts to narrow down the list of passes to the one (or few)
+which are causing the miscompilation, then reduce the portion of the test
+program which is being miscompiled.  The miscompilation debugger assumes that
+the selected code generator is working properly.
+
+=head2 Advice for using bugpoint
+
+B<bugpoint> can be a remarkably useful tool, but it sometimes works in
+non-obvious ways.  Here are some hints and tips:
+
+=over
+
+=item *
+
+In the code generator and miscompilation debuggers, B<bugpoint> only
+works with programs that have deterministic output.  Thus, if the program
+outputs C<argv[0]>, the date, time, or any other "random" data, B<bugpoint> may
+misinterpret differences in these data, when output, as the result of a
+miscompilation.  Programs should be temporarily modified to disable outputs that
+are likely to vary from run to run.
+
+=item *
+
+In the code generator and miscompilation debuggers, debugging will go faster if
+you manually modify the program or its inputs to reduce the runtime, but still
+exhibit the problem.
+
+=item *
+
+B<bugpoint> is extremely useful when working on a new optimization: it helps
+track down regressions quickly.  To avoid having to relink B<bugpoint> every
+time you change your optimization, make B<bugpoint> dynamically load
+your optimization by using the B<-load> option.
+
+=item *
+
+B<bugpoint> can generate a lot of output and run for a long period of time.  It
+is often useful to capture the output of the program to file.  For example, in
+the C shell, you can type:
+
+    bugpoint ... |& tee bugpoint.log
+
+to get a copy of B<bugpoint>'s output in the file F<bugpoint.log>, as well as on
+your terminal.
+
+=item *
+
+B<bugpoint> cannot debug problems with the LLVM linker. If B<bugpoint> crashes
+before you see its C<All input ok> message, you might try running C<llvm-link
+-v> on the same set of input files. If that also crashes, you may be
+experiencing a linker bug.
+
+=item *
+
+If your program is supposed to crash, B<bugpoint> will be confused. One way to
+deal with this is to cause B<bugpoint> to ignore the exit code from your
+program, by giving it the B<-check-exit-code=false> option.
+
+=back
+
+=head1 OPTIONS
+
+=over 
+
+=item B<--additional-so> F<library>
+
+Load the dynamic shared object F<library> into the test program whenever it is
+run.  This is useful if you are debugging programs which depend on non-LLVM
+libraries (such as the X or curses libraries) to run.
+
+=item B<--args> I<program args>
+
+Pass all arguments specified after -args to the test program whenever it runs.
+Note that if any of the I<program args> start with a '-', you should use:
+
+    bugpoint [bugpoint args] --args -- [program args]
+
+The "--" right after the B<--args> option tells B<bugpoint> to consider any
+options starting with C<-> to be part of the B<--args> option, not as options to
+B<bugpoint> itself.
+
+=item B<--tool-args> I<tool args>
+
+Pass all arguments specified after --tool-args to the LLVM tool under test
+(B<llc>, B<lli>, etc.) whenever it runs.  You should use this option in the
+following way:
+
+    bugpoint [bugpoint args] --tool-args -- [tool args]
+
+The "--" right after the B<--tool-args> option tells B<bugpoint> to consider any
+options starting with C<-> to be part of the B<--tool-args> option, not as
+options to B<bugpoint> itself. (See B<--args>, above.)
+
+=item B<--check-exit-code>=I<{true,false}>
+
+Assume a non-zero exit code or core dump from the test program is a failure.
+Defaults to true.
+
+=item B<--disable-{dce,simplifycfg}>
+
+Do not run the specified passes to clean up and reduce the size of the test
+program. By default, B<bugpoint> uses these passes internally when attempting to
+reduce test programs.  If you're trying to find a bug in one of these passes,
+B<bugpoint> may crash.
+
+=item B<--help>
+
+Print a summary of command line options.
+
+=item B<--input> F<filename>
+
+Open F<filename> and redirect the standard input of the test program, whenever
+it runs, to come from that file.
+
+=item B<--load> F<plugin>
+
+Load the dynamic object F<plugin> into B<bugpoint> itself.  This object should
+register new optimization passes.  Once loaded, the object will add new command
+line options to enable various optimizations.  To see the new complete list of
+optimizations, use the B<--help> and B<--load> options together; for example:
+
+    bugpoint --load myNewPass.so --help
+
+=item B<--output> F<filename>
+
+Whenever the test program produces output on its standard output stream, it
+should match the contents of F<filename> (the "reference output"). If you
+do not use this option, B<bugpoint> will attempt to generate a reference output
+by compiling the program with the C backend and running it.
+
+=item B<--profile-info-file> F<filename>
+
+Profile file loaded by B<--profile-loader>.
+
+=item B<--run-{int,jit,llc,cbe}>
+
+Whenever the test program is compiled, B<bugpoint> should generate code for it
+using the specified code generator.  These options allow you to choose the
+interpreter, the JIT compiler, the static native code compiler, or the C
+backend, respectively.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<bugpoint> succeeds in finding a problem, it will exit with 0.  Otherwise,
+if an error occurs, it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<opt|opt>, L<analyze|analyze>
+
+=head1 AUTHOR
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/extract.html

@@ -1,70 +0,0 @@
-<html>
-<title>
-LLVM: extract tool
-</title>
-
-<body bgcolor=white>
-
-<center>
-<h1>LLVM: <tt>extract</tt> tool</h1>
-</center>
-<HR>
-
-<h3>NAME</h3>
-<tt>extract</tt>
-
-<h3>
-SYNOPSIS
-</h3>
-
-<tt>extract [options] [filename]</tt>
-<h3>
-DESCRIPTION
-</h3>
-
-The <tt>extract</tt> command takes the name of a function and extracts it from
-the specified LLVM bytecode file.  It is primarily used as a debugging tool to
-reduce test cases from larger programs that are triggering a bug.
-<p>
-
-In addition to extracting the bytecode of the specified function,
-<tt>extract</tt> will also remove unreachable global variables, prototypes, and
-unused types.
-<p>
-
-The <tt>extract</tt> command reads its input from standard input if filename is
-omitted or if filename is -.  The output is always written to standard output.
-
-<h3>
-OPTIONS
-</h3>
-
-<ul>
-	<li>-func &lt;function&gt;
-	<br>
-	Extract the specified function from the LLVM bytecode.
-	<p>
-
-	<li> -help
-	<br>
-	Print a summary of command line options.
-	<p>
-</ul>
-
-<h3>
-EXIT STATUS
-</h3>
-
-If <tt>extract</tt> succeeds, it will exit with 0.  Otherwise, if an error
-occurs, it will exit with a non-zero value.
-
-<h3>
-SEE ALSO
-</h3>
-<a href="bugpoint.html"><tt>bugpoint</tt></a>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/extract.pod

@@ -0,0 +1,72 @@
+=pod
+
+=head1 NAME
+
+extract - extract a function from an LLVM module
+
+=head1 SYNOPSIS
+
+B<extract> [I<options>] B<--func> I<function-name> [I<filename>]
+
+=head1 DESCRIPTION
+
+The B<extract> command takes the name of a function and extracts it from
+the specified LLVM bytecode file.  It is primarily used as a debugging tool to
+reduce test cases from larger programs that are triggering a bug.
+
+In addition to extracting the bytecode of the specified function,
+B<extract> will also remove unreachable global variables, prototypes, and
+unused types.
+
+The B<extract> command reads its input from standard input if filename is
+omitted or if filename is -.  The output is always written to standard output,
+unless the B<-o> option is specified (see below).
+
+=head1 OPTIONS
+
+=over
+
+=item B<-f>
+
+Force overwrite.  Normally, B<extract> will refuse to overwrite an
+output file that already exists.  With this option, B<extract>
+will overwrite the output file and replace it with new bytecode.
+
+=item B<--func> I<function-name>
+
+Extract the function named I<function-name> from the LLVM bytecode.
+
+=item B<--help>
+
+Print a summary of command line options.
+
+=item B<-o> I<filename>
+
+Specify the output filename.  If filename is "-" (the default), then
+B<extract> sends its output to standard output.
+
+=item B<--stats>
+
+Print statistics.
+
+=item B<--time-passes>
+
+Record the amount of time needed for each pass and print it to standard
+error.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<extract> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<bugpoint|bugpoint>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/gccas.html

@@ -1,79 +0,0 @@
-<html>
-<title>LLVM: gccas tool</title>
-
-<body bgcolor=white>
-
-<center>
-<h1>LLVM: <tt>gccas</tt> tool</h1>
-</center>
-<HR>
-
-<h3>NAME</h3>
-<tt>gccas</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>gccas [options] &lt; filename&gt;</tt>
-
-<h3>DESCRIPTION</h3>
-
-The <tt>gccas</tt> utility takes an LLVM assembly file generated by the <a
-href="llvmgcc.html">C</a> or <a href="llvmgxx.html">C++</a> frontends and
-converts it into an LLVM bytecode file.  It is primarily used by the GCC front
-end, and as such, attempts to mimic the interface provided by the default system
-assembler so that it can act as a "drop-in" replacement.<p>
-
-<tt>gccas</tt> performs a number of optimizations on the input program.<p>
-
-<h3>
-OPTIONS
-</h3>
-
-<ul>
-	<li> -help
-	<br>
-	Print a summary of command line options.
-	<p>
-
-	<li> -o &lt;filename&gt;
-	<br>
-	Specify the output filename which will hold the assembled bytecode.
-	<p>
-
-	<li>-disable-inlining
-	<br>
-	Disable the inlining pass.  By default, it is enabled.
-	<p>
-
-	<li> -stats
-	<br>
-	Print statistics.
-	<p>
-
-	<li> -time-passes
-	<br>
-	Record the amount of time needed for each pass and print it to standard
-	error.
-	<p>
-
-	<li> -verify
-	<br>
-	Verify each pass result.
-	<p>
-</ul>
-
-<h3>
-EXIT STATUS
-</h3>
-
-If <tt>gccas</tt> succeeds, it will exit with 0.  Otherwise, if an error occurs,
-it will exit with a non-zero value.
-
-<h3>SEE ALSO</h3>
-<a href="llvm-as.html"><tt>llvm-as</tt></a>
-<a href="gccld.html"><tt>gccld</tt></a>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/gccas.pod

@@ -0,0 +1,76 @@
+=pod
+
+=head1 NAME
+
+gccas - optimizing LLVM assembler
+
+=head1 SYNOPSIS
+
+B<gccas> [I<options>] I<filename>
+
+=head1 DESCRIPTION
+
+The B<gccas> utility takes an LLVM assembly file generated by the
+L<llvmgcc|llvmgcc> or L<llvmg++|llvmgxx> front-ends and converts
+it into an LLVM bytecode file.  It is primarily used by the GCC
+front end, and as such, attempts to mimic the interface provided
+by the default system assembler so that it can act as a "drop-in"
+replacement.
+
+B<gccas> performs a number of optimizations on the input program,
+including but not limited to: promotion of stack values to SSA
+registers; elimination of dead globals, function arguments, code,
+and types; tail-call elimination; loop-invariant code motion; global
+common-subexpression elimination; and sparse conditional constant
+propagation.
+
+=head1 OPTIONS
+
+=over
+
+=item B<--help>
+
+Print a summary of command line options.
+
+=item B<-o> F<filename>
+
+Specify the name of the output file which will hold the assembled bytecode.
+
+=item B<--disable-inlining>
+
+Disable the inlining pass.  By default, it is enabled.
+
+=item B<--disable-opt>
+
+Disable all assembler-time optimization passes.
+
+=item B<--stats>
+
+Print statistics.
+
+=item B<--time-passes>
+
+Record the amount of time needed for each pass and print it to standard
+error.
+
+=item B<--verify>
+
+Verify each pass result.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<gccas> succeeds, it will exit with an exit status of 0.
+Otherwise, if an error occurs, it will exit with a non-zero exit
+status.
+
+=head1 SEE ALSO
+
+L<llvm-as|llvm-as>, L<gccld|gccld>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/gccld.html

@@ -1,180 +0,0 @@
-<html>
-<title>LLVM: gccld tool</title>
-
-<body bgcolor=white>
-
-<center><h1>LLVM: <tt>gccld</tt> tool</h1></center>
-<HR>
-
-<h3>NAME</h3>
-<tt>gccld</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>gccld [options] &lt; filename&gt; [ filename ...]</tt>
-
-<h3>DESCRIPTION</h3>
-
-The <tt>gccld</tt> utility takes a set of LLVM bytecode files and links them
-together into a single LLVM bytecode file.  The output bytecode file can be
-another bytecode library or an executable bytecode program.  Using additional
-options, <tt>gccld</tt> is able to produce native code executables.
-<p>
-
-The <tt>gccld</tt> utility is primarily used by the <a href="llvmgcc.html">C</a>
-and <a href="llvmgxx.html">C++</a> front-ends, and as such, attempts to mimic
-the interface provided by the default system linker so that it can act as a
-"drop-in" replacement.
-<p>
-
-The <tt>gccld</tt> tool performs a small set of interprocedural, post-link,
-optimizations on the program.
-
-
-<h4>Search Order</h4>
-
-When looking for objects specified on the command line, <tt>gccld</tt> will
-search for the object first in the current directory and then in the directory
-specified by the <tt>LLVM_LIB_SEARCH_PATH</tt> environment variable.  If it
-cannot find the object, it fails.
-<p>
-
-When looking for a library specified with the -l option, <tt>gccld</tt> first
-attempts to load a file with that name from the current directory.  If that
-fails, it looks for lib&lt;library&gt;.bc, lib&lt;library&gt;.a, or
-lib&lt;library&gt;.so, in that order, in each directory added to the library
-search path with the -L option.  These directories are searched in order they
-were specified.  If the library cannot be located, then <tt>gccld</tt> looks in
-the directory specified by the <tt>LLVM_LIB_SEARCH_PATH</tt> environment
-variable.  If it does not find lib&lt;library&gt;.[bc | a | so] there, it fails.
-
-The -L option is global.  It does not matter where it is specified in the list
-of command line arguments; the directory is simply added to the search path and
-is applied to all libraries, preceding or succeeding, in the command line.
-
-<h4>Link order</h4>
-
-All object files are linked first in the order they were specified on the
-command line.  All library files are linked next.  Some libraries may not be
-linked into the object program; see below.
-
-<h4>Library Linkage</h4>
-
-Object files and static bytecode objects are always linked into the output
-file.  Library archives (.a files) load only the objects within the archive
-that define symbols needed by the output file.  Hence, libraries should be
-listed after the object files and libraries which need them; otherwise, the
-library may not be linked in, and the dependent library will not have its
-undefined symbols defined.
-
-<h4>Native code generation</h4>
-
-The <tt>gccld</tt> program has limited support for native code generation, when
-using the -native option.
-
-
-<h3>OPTIONS</h3>
-
-<ul>
-	<li> -help
-	<br>
-	Print a summary of command line options.
-	<p>
-
-	<li> -o &lt;filename&gt;
-	<br>
-	Specify the output filename which will hold the linked bytecode.
-	<p>
-
-	<li> -stats
-	<br>
-	Print statistics.
-	<p>
-
-	<li> -time-passes
-	<br>
-	Record the amount of time needed for each pass and print it to standard
-	error.
-	<p>
-
-	<li> -verify
-	<br>
-	Verify each pass result.
-	<p>
-
-	<li> -L=&lt;directory&gt;
-	<br>
-	Add directory to the list of directories to search when looking for
-	libraries.
-	<p>
-
-	<li> -disable-internalize
-	<br>
-	Do not mark all symbols as internal.
-	<p>
-
-	<li> -internalize-public-api-file &lt;filename&gt;
-	<br>
-	Preserve the list of symbol names in the file filename.
-	<p>
-
-	<li> -internalize-public-api-list &lt;list&gt;
-	<br>
-	Preserve the symbol names in list.
-	<p>
-
-	<li> -l=&lt;library&gt;
-	<br>
-	Specify libraries to include when linking the output file.  When
-	linking, <tt>gccld</tt> will first attempt to load a file with the
-	pathname library.  If that fails, it will then attempt to load
-	lib&lt;library&gt;.bc, lib&lt;library&gt;.a, and lib&lt;library&gt;.so,
-	in that order.
-	<p>
-
-	<li> -link-as-library
-	<br>
-	Link the .bc files together as a library, not an executable.
-	<p>
-
-	<li> -native
-	<br>
-	Generate a native, machine code executable.
-  <p>
-  When generating native executables, <tt>gccld</tt> first checks for a bytecode
-  version of the library and links it in, if necessary.  If the library is
-  missing, <tt>gccld</tt> skips it.  Then, <tt>gccld</tt> links in the same
-  libraries as native code.
-  <p>
-  In this way, <tt>gccld</tt> should be able to link in optimized bytecode
-  subsets of common libraries and then link in any part of the library that
-  hasn't been converted to bytecode.
-	<p>
-
-	<li> -s
-	<br>
-	Strip symbol information from the generated executable.
-	<p>
-
-	<li> -v
-	<br>
-	Print information about actions taken.
-</ul>
-
-<h3>EXIT STATUS</h3>
-
-If <tt>gccld</tt> succeeds, it will exit with 0.  Otherwise, if an error occurs,
-it will exit with a non-zero value.
-
-<h3>SEE ALSO</h3>
-<a href="llvm-link.html"><tt>llvm-link</tt></a>
-<a href="gccas.html"><tt>gccas</tt></a>
-
-<h3>BUGS</h3>
-The -L option cannot be used for find native code libraries when using the
--native option.
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/gccld.pod

@@ -0,0 +1,175 @@
+=pod
+
+=head1 NAME
+
+gccld - optimizing LLVM linker
+
+=head1 SYNOPSIS
+
+B<gccld> [I<options>] I<filename ...>
+
+=head1 DESCRIPTION
+
+The B<gccld> utility takes a set of LLVM bytecode files and links them
+together into a single LLVM bytecode file.  The output bytecode file can be
+another bytecode library or an executable bytecode program.  Using additional
+options, B<gccld> is able to produce native code executables.
+
+The B<gccld> utility is primarily used by the L<llvmgcc> and
+L<llvmg++|llvmgxx> front-ends, and as such, attempts to mimic the interface
+provided by the default system linker so that it can act as a ``drop-in''
+replacement.
+
+The B<gccld> tool performs a small set of interprocedural, post-link
+optimizations on the program.
+
+=head2 Search Order
+
+When looking for objects specified on the command line, B<gccld> will search for
+the object first in the current directory and then in the directory specified by
+the B<LLVM_LIB_SEARCH_PATH> environment variable.  If it cannot find the object,
+it fails.
+
+When looking for a library specified with the B<-l> option, B<gccld> first
+attempts to load a file with that name from the current directory.  If that
+fails, it looks for libI<library>.bc, libI<library>.a, or libI<library>.I<shared
+library extension>, in that order, in each directory added to the library search
+path with the B<-L> option.  These directories are searched in the order they
+were specified.  If the library cannot be located, then B<gccld> looks in the
+directory specified by the B<LLVM_LIB_SEARCH_PATH> environment variable.  If it
+does not find a library there, it fails.
+
+The shared library extension may be I<.so>, I<.dyld>, I<.dll>, or something
+different, depending upon the system.
+
+The B<-L> option is global.  It does not matter where it is specified in the
+list of command line arguments; the directory is simply added to the search path
+and is applied to all libraries, preceding or succeeding, in the command line.
+
+=head2 Link order
+
+All object files are linked first in the order they were specified on the
+command line.  All library files are linked next.  Some libraries may not be
+linked into the object program; see below.
+
+=head2 Library Linkage
+
+Object files and static bytecode objects are always linked into the output
+file.  Library archives (.a files) load only the objects within the archive
+that define symbols needed by the output file.  Hence, libraries should be
+listed after the object files and libraries which need them; otherwise, the
+library may not be linked in, and the dependent library will not have its
+undefined symbols defined.
+
+=head2 Native code generation
+
+The B<gccld> program has limited support for native code generation, when
+using the B<-native> or B<-native-cbe> options.
+
+=head1 OPTIONS
+
+=over
+
+=item B<-help>
+
+Print a summary of command line options.
+
+=item B<-o> I<filename>
+
+Specify the output filename which will hold the linked bytecode.
+
+=item B<-stats>
+
+Print statistics.
+
+=item B<-time-passes>
+
+Record the amount of time needed for each pass and print it to standard
+error.
+
+=item B<-verify>
+
+Verify each pass result.
+
+=item B<-disable-opt>
+
+Disable all link-time optimization passes.
+
+=item B<-disable-inlining>
+
+Do not run the inliner pass.
+
+=item B<-L>I<directory>
+
+Add directory to the list of directories to search when looking for
+libraries.
+
+=item B<-disable-internalize>
+
+Do not mark all symbols as internal.
+
+=item B<-internalize-public-api-file> I<filename>
+
+Preserve the list of symbol names in the file filename.
+
+=item B<-internalize-public-api-list &lt;list&gt;>
+
+Preserve the symbol names in list.
+
+=item B<-l>I<library>
+
+Specify libraries to include when linking the output file.  When linking,
+B<gccld> will first attempt to load a file with the pathname B<library>.  If
+that fails, it will then attempt to load libI<library>.bc, libI<library>.a, and
+libI<library>.I<shared library extension>, in that order.
+
+=item B<-link-as-library>
+
+Link the .bc files together as a library, not an executable.
+
+=item B<-native>
+
+Generate a native machine code executable.
+
+When generating native executables, B<gccld> first checks for a bytecode
+version of the library and links it in, if necessary.  If the library is
+missing, B<gccld> skips it.  Then, B<gccld> links in the same
+libraries as native code.
+
+In this way, B<gccld> should be able to link in optimized bytecode
+subsets of common libraries and then link in any part of the library that
+hasn't been converted to bytecode.
+
+=item B<-native-cbe>
+
+Generate a native machine code executable with the LLVM C backend.
+      
+This option is identical to the B<-native> option, but uses the
+C backend to generate code for the program instead of an LLVM native
+code generator.
+
+=item B<-s>
+
+Strip symbol information from the generated executable.
+
+=item B<-v>
+
+Print information about actions taken.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<gccld> succeeds, it will exit with an exit status of 0.
+Otherwise, if an error occurs, it will exit with a non-zero exit
+status.
+
+=head1 SEE ALSO
+
+L<llvm-link|llvm-link>, L<gccas|gccas>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/html/.cvsignore

@@ -0,0 +1 @@
+*html

llvm/docs/CommandGuide/html/manpage.css

@@ -0,0 +1,256 @@
+/* Based on http://www.perldoc.com/css/perldoc.css */
+
+@import url("../llvm.css");
+
+body { font-family: Arial,Helvetica; }
+
+blockquote { margin: 10pt;  }
+
+h1, a { color: #336699; }
+
+
+/*** Top menu style ****/
+.mmenuon { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #ff6600; font-size: 10pt;
+ }
+.mmenuoff { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #ffffff; font-size: 10pt;
+}	  
+.cpyright {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #ffffff; font-size: xx-small;
+}
+.cpyrightText {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #ffffff; font-size: xx-small;
+}
+.sections { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 11pt;
+}	 
+.dsections { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 12pt;
+}	
+.slink { 
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: none;
+ color: #000000; font-size: 9pt;
+}	 
+
+.slink2 { font-family: Arial,Helvetica; text-decoration: none; color: #336699; }	 
+
+.maintitle { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 18pt;
+}	 
+.dblArrow {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: small;
+}
+.menuSec {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: small;
+}
+
+.newstext {
+ font-family: Arial,Helvetica; font-size: small;
+}
+
+.linkmenu {
+ font-family: Arial,Helvetica; color: #000000; font-weight: bold;
+ text-decoration: none;
+}
+
+P {
+ font-family: Arial,Helvetica;
+}
+
+PRE {
+    font-size: 10pt;
+}
+.quote { 
+ font-family: Times; text-decoration: none;
+ color: #000000; font-size: 9pt; font-style: italic;
+}	
+.smstd { font-family: Arial,Helvetica; color: #000000; font-size: x-small; } 
+.std { font-family: Arial,Helvetica; color: #000000; } 
+.meerkatTitle { 
+ font-family: sans-serif; font-size: x-small;  color: black;    }
+
+.meerkatDescription { font-family: sans-serif; font-size: 10pt; color: black }
+.meerkatCategory { 
+ font-family: sans-serif; font-size: 9pt; font-weight: bold; font-style: italic; 
+ color: brown; }
+.meerkatChannel { 
+ font-family: sans-serif; font-size: 9pt; font-style: italic; color: brown; }
+.meerkatDate { font-family: sans-serif; font-size: xx-small; color: #336699; }
+
+.tocTitle {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #333333; font-size: 10pt;
+}
+
+.toc-item {
+ font-family: Arial,Helvetica; font-weight: bold; 
+ color: #336699; font-size: 10pt; text-decoration: underline;
+}
+
+.perlVersion {
+ font-family: Arial,Helvetica; font-weight: bold; 
+ color: #336699; font-size: 10pt; text-decoration: none;
+}
+
+.podTitle {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #000000;
+}
+
+.docTitle {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #000000; font-size: 10pt;
+}
+.dotDot {
+ font-family: Arial,Helvetica; font-weight: bold; 
+ color: #000000; font-size: 9pt;
+}
+
+.docSec {
+ font-family: Arial,Helvetica; font-weight: normal; 
+ color: #333333; font-size: 9pt;
+}
+.docVersion {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 10pt;
+}
+
+.docSecs-on {
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: none;
+ color: #ff0000; font-size: 10pt;
+}
+.docSecs-off {
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: none;
+ color: #333333; font-size: 10pt;
+}
+
+h2 {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: medium;
+}
+h1 {
+ font-family: Verdana,Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: large;
+}
+
+DL {
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: none;
+ color: #333333; font-size: 10pt;
+}
+
+UL > LI > A {
+ font-family: Arial,Helvetica; font-weight: bold;
+ color: #336699; font-size: 10pt;
+}
+
+.moduleInfo {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #333333; font-size: 11pt;
+}
+
+.moduleInfoSec {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 10pt;
+}
+
+.moduleInfoVal {
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: underline;
+ color: #000000; font-size: 10pt;
+}
+
+.cpanNavTitle {
+ font-family: Arial,Helvetica; font-weight: bold; 
+ color: #ffffff; font-size: 10pt;
+}
+.cpanNavLetter {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none; 
+ color: #333333; font-size: 9pt;
+}
+.cpanCat {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none; 
+ color: #336699; font-size: 9pt;
+}
+
+.bttndrkblue-bkgd-top {
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgtop.gif);
+}
+.bttndrkblue-bkgd-left {
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgleft.gif);
+}
+.bttndrkblue-bkgd {
+	padding-top: 0px;
+	padding-bottom: 0px;
+	margin-bottom: 0px;
+	margin-top: 0px;
+	background-repeat: no-repeat;
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgmiddle.gif);
+	vertical-align: top;
+}
+.bttndrkblue-bkgd-right {
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgright.gif);
+}
+.bttndrkblue-bkgd-bottom {
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgbottom.gif);
+}
+.bttndrkblue-text a {
+	color: #ffffff;
+	text-decoration: none;
+}
+a.bttndrkblue-text:hover {
+	color: #ffDD3C;
+	text-decoration: none;
+}
+.bg-ltblue {
+	background-color: #f0f5fa;
+} 
+
+.border-left-b {
+	background: #f0f5fa url(/i/corner-leftline.gif) repeat-y;
+} 
+
+.border-right-b {
+	background: #f0f5fa url(/i/corner-rightline.gif) repeat-y;
+} 
+
+.border-top-b {
+	background: #f0f5fa url(/i/corner-topline.gif) repeat-x;
+} 
+
+.border-bottom-b {
+	background: #f0f5fa url(/i/corner-botline.gif) repeat-x;
+} 
+
+.border-right-w {
+	background: #ffffff url(/i/corner-rightline.gif) repeat-y;
+} 
+
+.border-top-w {
+	background: #ffffff url(/i/corner-topline.gif) repeat-x;
+} 
+
+.border-bottom-w {
+	background: #ffffff url(/i/corner-botline.gif) repeat-x;
+} 
+
+.bg-white {
+	background-color: #ffffff;
+} 
+
+.border-left-w {
+	background: #ffffff url(/i/corner-leftline.gif) repeat-y;
+} 

llvm/docs/CommandGuide/index.html

@@ -1,122 +1,135 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
 <html>
-	<head>
+<head>
   <title>LLVM Command Guide</title>
-	</head>
+  <link rel="stylesheet" href="../llvm.css" type="text/css">
+</head>
+<body>
 
-	<body bgcolor=white>
+<div class="doc_title">
+  LLVM Command Guide
+</div>
 
-	<center><h1>LLVM Command Guide<br></h1></center>
+<div class="doc_text">
 
-	This document is the reference manual for the LLVM utilities.  It will
-	show you how to use the LLVM commands and what all of their options
-	are.
+<p>These documents are HTML versions of the <a href="man/man1/">man pages</a>
+for all of the LLVM tools.  These pages describe how to use the LLVM commands
+and what their options are.  Note that these pages do not describe all of the 
+options available for all tools.  To get a complete listing, pass the 
+<tt>--help</tt> (general options) or <tt>--help-hidden</tt> (general+debugging
+options) arguments to the tool you are interested in.</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="basic">Basic Commands</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<ul>
+
+<li><a href="html/llvm-as.html"><b>llvm-as</b></a> - 
+    assemble a human-readable .ll file into bytecode</li>
+
+<li><a href="html/llvm-dis.html"><b>llvm-dis</b></a> -
+    disassemble a bytecode file into a human-readable .ll file</li>
+
+<li><a href="html/opt.html"><b>opt</b></a> -
+    run a series of LLVM-to-LLVM optimizations on a bytecode file</li>
+
+<li><a href="html/llc.html"><b>llc</b></a> - 
+    generate native machine code for a bytecode file</li>
+
+<li><a href="html/lli.html"><b>lli</b></a> - 
+    directly run a program compiled to bytecode using a JIT compiler or 
+    interpreter</li>
+
+<li><a href="html/llvm-link.html"><b>llvm-link</b></A>
+    link several bytecode files into one</li>
+
+<li><a href="html/analyze.html"><b>analyze</b></a> -
+    run LLVM analyses on a bytecode file and print the results</li>
+
+<li><a href="html/llvm-nm.html"><b>llvm-nm</b></a>
+    print out the names and types of symbols in a bytecode file</li>
+
+<li><a href="html/llvm-prof.html"><b>llvm-prof</b></a> -
+    format raw `<tt>llvmprof.out</tt>' data into a human-readable report</li>
+
+</ul>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="frontend">C, C++, and Stacker Front-end Commands</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<ul>
+
+<li><a href="html/llvmgcc.html"><b>llvmgcc</b></a> -
+    GCC-based C front-end for LLVM
+
+<li><a href="html/llvmgxx.html"><b>llvmg++</b></a> -
+    GCC-based C++ front-end for LLVM</li>
+
+<li><a href="html/gccas.html"><b>gccas</b></a> -
+    compile-time optimizer used by llvm-g++ and llvm-gcc</li>
+
+<li><a href="html/gccld.html"><b>gccld</b></a> -
+    linker and link-time optimizer used by llvm-g++ and llvm-gcc</li>
+
+<li><a href="html/stkrc.html"><b>stkrc</b></a> -
+    front-end compiler for the <a href="../Stacker.html">Stacker</a> 
+    language</li>
+
+</ul>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="debug">Debugging Tools</a>
+</div>
+<!-- *********************************************************************** -->
 
 
+<div class="doc_text">
 
-<table width=100% border=0>
-<tr><td valign=top width=50%>
+<ul>
 
-	<!--===============================================================-->
-	<center><h2><a name="llvmcmds">Basic Commands</a><hr></h2></center>
-	<!--===============================================================-->
+<li><a href="html/bugpoint.html"><b>bugpoint</b></a> -
+    automatic test-case reducer</li>
 
-	<dl compact>
-		<dt><A href="llvm-as.html"><b>llvm-as</b></A>
-		<dd>
-		Assemble a human-readable LLVM program into LLVM bytecode.
-		<p>
+<li><a href="html/extract.html"><b>extract</b></a> -
+    extract a function from an LLVM bytecode file</li>
 
-		<dt><A href="llvm-dis.html"><b>llvm-dis</b></A>
-		<dd>
-		Disassemble an LLVM bytecode file into human-readable form.
-		<p>
+<li><a href="html/llvm-bcanalyzer.html"><b>llvm-bcanalyzer</b></a> -
+    bytecode analyzer (analyzes the binary encoding itself, not the program it
+    represents)</li>
 
-		<dt><A href="llvm-nm.html"><b>llvm-nm</b></A>
-		<dd>
-		Print out the names and types of symbols in an LLVM bytecode file.
-		<p>
+</ul>
 
-		<dt><A href="analyze.html"><b>analyze</b></A>
-		<dd>
-		Analyze an LLVM bytecode file.
-		<p>
+</div>
 
-		<dt><A href="opt.html"><b>opt</b></A>
-		<dd>
-		Optimize an LLVM bytecode file.
-		<p>
+<!-- *********************************************************************** -->
 
-		<dt><A href="llvm-link.html"><b>llvm-link</b></A>
-		<dd>
-		Link several LLVM bytecode files together into one LLVM
-		bytecode file.
-		<p>
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
 
-		<dt><A href="llc.html"><b>llc</b></A>
-		<dd>
-		Compile an LLVM bytecode program into native machine code.
+  <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
 
-		<dt><A href="lli.html"><b>lli</b></A>
-		<dd>
-		Run an LLVM bytecode program using either an interpreter or a
-		JIT compiler.
-		<p>
-	</dl>
-
-</td><td valign=top width=50%>
-
-	<!--===============================================================-->
-	<center><h2><a name="llvmcmds">C and C++ Front-end Commands</a><hr></h2></center>
-	<!--===============================================================-->
-
-	<dl compact>
-		<dt><A href="llvmgcc.html"><b>llvmgcc</b></A>
-		<dd>
-		GCC-based C front end for LLVM.
-		<p>
-
-		<dt><A href="llvmgxx.html"><b>llvmg++</b></A>
-		<dd>
-		GCC-based C++ front end for LLVM.
-		<p>
-
-		<dt><A href="gccas.html"><b>gccas</b></A>
-		<dd>
-		LLVM assembler used by GCC and other native compiler tools.
-		<p>
-
-		<dt><A href="gccld.html"><b>gccld</b></A>
-		<dd>
-		LLVM linker used by GCC and other native compiler tools.
-	</dl>
-
-	<!--===============================================================-->
-	<center><h2><a name="llvmcmds">Debugging Tools</a><hr></h2></center>
-	<!--===============================================================-->
-
-	<dl compact>
-		<dt><A href="bugpoint.html"><b>bugpoint</b></A>
-		<dd>
-		Trace an LLVM bytecode program and reduce its failure to a
-		simple testcase.
-		<p>
-
-		<dt><A href="extract.html"><b>extract</b></A>
-		<dd>
-		Extract a function from an LLVM bytecode file.
-	</dl>
-</td></tr></table>
-
-
-<hr><font size=-1>
-Maintained by the 
-<a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.<br>
-<!-- Created: Wed Feb 26 10:40:50 CST 2003 -->
-<!-- hhmts start -->
-Last modified: Tue Oct  7 15:34:17 CDT 2003
-<!-- hhmts end -->
-</font>
-
-	</body>
+</body>
 </html>

llvm/docs/CommandGuide/llc.html

@@ -1,198 +0,0 @@
-<html>
-<title>LLVM: llc tool</title>
-
-<body bgcolor=white>
-
-<center><h1>LLVM: <tt>llc</tt> tool</h1></center>
-<HR>
-
-<h3>NAME</h3>
-<tt>llc</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>llc [options] [filename]</tt>
-
-<h3>DESCRIPTION</h3>
-
-The <tt>llc</tt> command compiles LLVM bytecode into assembly language for a
-specified architecture.  The assembly language output can then be passed through
-a native assembler and linker to generate native code.
-<p>
-The choice of architecture for the output assembly code is determined as
-follows:
-
-<ul>
-	<li>
-	If the user has specified an architecture with the -m option, use that
-	architecture.
-	<p>
-
-	<li>
-	Examine the input LLVM bytecode file:
-	<ul>
-		<li>
-		If it specifies little endian and a pointer size of 32 bits, select the
-		x86 architecture.
-		<p>
-		
-		<li>
-		If it specifies big endian and a pointer size of 64 bit pointers,
-		select the SparcV9 architecture.
-	</ul>
-	<p>
-
-	<li>
-	If <tt>llc</tt> was compiled on an architecture for which it can
-	generate code, select the architecture upon which <tt>llc</tt> was
-	compiled.
-	<p>
-
-	<li>
-	Print a message to the user asking him or her to specify the output
-	architecture explicitly.
-</ul>
-
-<p>
-
-If filename is not specified, or if filename is -, <tt>llc</tt> reads its input
-from standard input.  Otherwise, it will read its input from filename.
-<p>
-
-If the -o option is left unspecified, then <tt>llc</tt> will send its output to standard
-output if the input is from standard input.  If the -o option specifies -, then
-the output will also be sent to standard output.
-<p>
-
-If no -o option is specified and an input file other than - is specified, then
-<tt>llc</tt> creates the output filename as follows:
-
-<ul>
-	<li>
-	If the file ends in .bc, then the .bc suffix is removed, and the .s suffix
-	is appended.
-	<p>
-	<li>
-	Otherwise, the .s suffix is appended to the input filename.
-</ul>
-
-<h3>
-OPTIONS
-</h3>
-<ul>
-	<li>-f                   
-	<br>
-	Overwrite output files
-	<p>
-
-	<li>-m&lt;arch&gt;
-	<br>
-	Specify the architecture for which to generate assembly.  Valid
-	architectures are:
-
-	<dl compact>
-		<di> x86
-		<dd>IA-32 (Pentium and above)</dd>
-
-		<di> sparc
-		<dd>SPARC V9</dd>
-	</dl>
-	<p>
-
-	<li>-o &lt;filename&gt;
-	<br>
-	Specify the output filename.
-	<p>
-
-	<li> -help
-	<br>
-	Print a summary of command line options.
-	<p>
-
-	<li> -stats
-	<br>
-	Print statistics.
-	<p>
-
-	<li> -time-passes
-	<br>
-	Record the amount of time needed for each pass and print it to standard
-	error.
-	<p>
-
-</ul>
-<h4>X86 Specific Options</h4>
-<ul>
-	<li>-disable-fp-elim
-	<br>
-	Disable frame pointer elimination optimization.
-	<p>
-
-	<li>-disable-pattern-isel
-	<br>
-	Use the 'simple' X86 instruction selector (the default).
-	<p>
-
-	<li>-print-machineinstrs
-	<br>
-	Print generated machine code.
-	<p>
-
-	<li>-regalloc=&lt;ra&gt;
-	<br>
-        Specify the register allocator to use. The default is <i>simple</i>.
-        Valid register allocators are:
-	<dl compact>
-		<di> simple
-		<dd>Very simple register allocator</dd>
-
-		<di> local
-		<dd>Local register allocator</dd>
-	</dl>
-	<p>
-
-</ul>
-
-<h4>Sparc Specific Options</h4>
-<ul>
-	<li>-disable-peephole
-	<br>
-	Disable peephole optimization pass.
-	<p>
-
-	<li>-disable-preopt
-	<br>
-	Disable optimizations prior to instruction selection.
-	<p>
-
-	<li>-disable-sched
-	<br>
-	Disable local scheduling pass.
-	<p>
-
-	<li>-disable-strip
-	<br>
-	Do not strip the LLVM bytecode included in executable.
-	<p>
-
-	<li>-enable-maps
-	<br>
-	Emit LLVM-to-MachineCode mapping info to assembly.
-	<p>
-</ul>
-
-
-<h3>EXIT STATUS</h3>
-
-If <tt>llc</tt> succeeds, it will exit with 0.  Otherwise, if an error occurs,
-it will exit with a non-zero value.
-
-<h3>
-SEE ALSO
-</h3>
-<a href="lli.html"><tt>lli</tt></a>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/llc.pod

@@ -0,0 +1,206 @@
+=pod
+
+=head1 NAME
+
+llc - LLVM static compiler
+
+=head1 SYNOPSIS
+
+B<llc> [I<options>] [I<filename>]
+
+=head1 DESCRIPTION
+
+The B<llc> command compiles LLVM bytecode into assembly language for a
+specified architecture.  The assembly language output can then be passed through
+a native assembler and linker to generate native code.
+
+The choice of architecture for the output assembly code is determined as
+follows, by attempting to satisfy each of the following rules in turn (first
+one wins):
+
+=over
+
+=item *
+
+If the user has specified an architecture with the -m option, use that
+architecture.
+
+=item *
+
+Examine the input LLVM bytecode file: if it is little endian and has a
+pointer size of 32 bits, select the Intel IA-32 architecture.  If it is big
+endian and has a pointer size of 64 bits, select the SparcV9 architecture.
+
+=item *
+
+If B<llc> was compiled on an architecture for which it can generate code, select
+the architecture upon which B<llc> was compiled.
+
+=item *
+
+Exit with an error message telling the user to specify the output
+architecture explicitly.
+
+=back
+
+=head1 OPTIONS
+
+If I<filename> is - or omitted, B<llc> reads LLVM bytecode from standard input.
+Otherwise, it will read LLVM bytecode from I<filename>.
+
+If the B<-o> option is omitted, then B<llc> will send its output to standard
+output if the input is from standard input.  If the B<-o> option specifies -,
+then the output will also be sent to standard output.
+
+If no B<-o> option is specified and an input file other than - is specified,
+then B<llc> creates the output filename by taking the input filename,
+removing any existing F<.bc> extension, and adding a F<.s> suffix.
+
+Other B<llc> options are as follows:
+
+=over
+
+=item B<-f>
+
+Overwrite output files. By default, B<llc> will refuse to overwrite
+an output file which already exists.
+
+=item B<-march>=I<arch>
+
+Specify the architecture for which to generate assembly.  Valid
+architectures are:
+
+=over
+
+=item I<x86>
+
+Intel IA-32 (Pentium and above)
+
+=item I<sparcv9>
+
+64-bit SPARC V9
+
+=item I<c>
+
+Emit C code, not assembly
+
+=back
+
+=item B<-enable-correct-eh-support>
+
+Instruct the B<-lowerinvoke> pass to insert code for correct exception handling
+support.  This is expensive and is by default omitted for efficiency.
+
+=item B<-help>
+
+Print a summary of command line options.
+
+=item B<-stats>
+
+Print statistics recorded by code-generation passes.
+
+=item B<-time-passes>
+
+Record the amount of time needed for each pass and print a report to standard
+error.
+
+=back
+
+=head2 Intel IA-32-specific Options
+
+=over
+
+=item B<--disable-fp-elim>
+
+Disable frame pointer elimination optimization.
+
+=item B<--disable-pattern-isel>
+
+Use the 'simple' X86 instruction selector (the default).
+
+=item B<--print-machineinstrs>
+
+Print generated machine code.
+
+=item B<--regalloc>=I<allocator>
+
+Specify the register allocator to use. The default I<allocator> is I<local>.
+Valid register allocators are:
+
+=over
+
+=item I<simple>
+
+Very simple "always spill" register allocator
+
+=item I<local>
+
+Local register allocator
+
+=item I<linearscan>
+
+Linear scan global register allocator
+
+=item I<iterativescan>
+
+Iterative scan global register allocator
+
+=back
+
+=item B<--spiller>=I<spiller>
+
+Specify the spiller to use for register allocators that support it.  Currently
+this option is used only by the linear scan register allocator. The default
+I<spiller> is I<local>.  Valid spillers are:
+
+=over
+
+=item I<simple>
+
+Simple spiller
+
+=item I<local>
+
+Local spiller
+
+=back
+
+=back
+
+=head2 SPARCV9-specific Options
+
+=over
+
+=item B<--disable-peephole>
+
+Disable peephole optimization pass.
+
+=item B<--disable-sched>
+
+Disable local scheduling pass.
+
+=item B<--disable-strip>
+
+The Sparc backend embeds the LLVM bytecode into the assembly output.  This
+option requests that symbol names be retained; by default, they are stripped out.
+
+=item B<--enable-maps>
+
+Emit LLVM-to-machine code mapping information into the assembly output.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<llc> succeeds, it will exit with 0.  Otherwise, if an error occurs,
+it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<lli|lli>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/lli.html

@@ -1,127 +0,0 @@
-<html>
-<title>
-LLVM: lli tool
-</title>
-
-<body bgcolor=white>
-
-<center>
-<h1>LLVM: <tt>lli</tt> tool</h1>
-</center>
-<HR>
-
-<h3>
-NAME
-</h3>
-
-<tt>lli</tt>
-
-<h3>
-SYNOPSIS
-</h3>
-
-<tt>lli [options] [filename] [args ...]</tt>
-<h3>
-DESCRIPTION
-</h3>
-
-<tt>lli</tt> directly executes programs in LLVM format. 
-It takes a program in LLVM
-bytecode format and executes it using a just-in-time
-compiler, if one is available for the current architecture, or an interpreter.
-<tt>lli</tt> takes all of the same code generator options as the
-<tt><a href="llc.html">llc</a></tt> tool, but they are only applicable when
-the just-in-time compiler is being used.
-<p>
-
-If filename is not specified, then <tt>lli</tt> reads the LLVM bytecode for
-the program from standard input.
-<p>
-The optional "args" specified on the command line are passed to the
-program as arguments.
-<p>
-
-
-<h3>
-OPTIONS
-</h3>
-
-<ul>
-	<li> <tt>-array-checks</tt>
-	<br>
-	Enable array bound checks. If an LLVM program attempts to access an
-    element of an array which is not within the size of that array,
-    <tt>lli</tt> will print an error message and call <tt>abort(3)</tt>.
-    This is presently only applicable to the interpreter.
-	<p>
-
-	<li> <tt>-help</tt>
-	<br>
-	Print a summary of command line options.
-	<p>
-
-	<li> <tt>-stats</tt>
-	<br>
-	Print statistics from the code-generation passes. This is only meaningful
-    for the just-in-time compiler, at present.
-	<p>
-
-	<li> <tt>-time-passes</tt>
-	<br>
-	Record the amount of time needed for each code-generation pass and print
-    it to standard error.
-	<p>
-
-	<li> <tt>-march=&lt;arch&gt;</tt>
-	<br>
-    Use the specified non-default architecture when selecting a code generator
-    for the just-in-time compiler. This may result in a crash if you pick an
-    architecture which is not compatible with the hardware you are running
-    <tt>lli</tt> on.
-	<p>
-
-    <li> <tt>-quiet, -q</tt>
-    <br>
-    Do not print any output about the return values of functions.
-    This is presently only applicable to the interpreter.
-    <p>
-
-    <li> <tt>-force-interpreter={false,true}</tt>
-    <br>
-    If set to true, use the interpreter even if a just-in-time compiler is
-    available for this architecture. Defaults to false.
-    <p>
-
-    <li> <tt>-trace</tt>
-    <br>
-    Print an LLVM-instruction-level dynamic execution trace. This is
-    presently only applicable to the interpreter.
-    <p>
-
-    <li> <tt>-f=&lt;name&gt;</tt>
-    <br>
-    Call the function named <tt>&lt;name&gt;</tt> to start the program.
-    Note: The function is assumed to have the C signature <tt>int
-    <tt>&lt;name&gt;</tt> (int, char **, char **)</tt>. 
-    If you try to use this option to call a function of incompatible type,
-    undefined behavior may result. Defaults to "main".
-    <p>
-
-</ul>
-
-<h3>
-EXIT STATUS
-</h3>
-
-If <tt>lli</tt> fails to load the program, it will exit with an exit code of 1.
-Otherwise, it will return the exit code of the program it executes.
-
-<h3>
-SEE ALSO
-</h3>
-<a href="llc.html"><tt>llc</tt></a>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>

llvm/docs/CommandGuide/lli.pod

@@ -0,0 +1,76 @@
+=pod
+
+=head1 NAME
+
+lli - directly execute programs from LLVM bytecode
+
+=head1 SYNOPSIS
+
+B<lli> [I<options>] [I<filename>] [I<program args>]
+
+=head1 DESCRIPTION
+
+B<lli> directly executes programs in LLVM bytecode format.  It takes a program
+in LLVM bytecode format and executes it using a just-in-time compiler, if one is
+available for the current architecture, or an interpreter.  B<lli> takes all of
+the same code generator options as L<llc|llc>, but they are only effective when
+B<lli> is using the just-in-time compiler.
+
+If I<filename> is not specified, then B<lli> reads the LLVM bytecode for the
+program from standard input.
+
+The optional I<args> specified on the command line are passed to the program as
+arguments.
+
+=head1 OPTIONS
+
+=over
+
+=item B<-help>
+
+Print a summary of command line options.
+
+=item B<-stats>
+
+Print statistics from the code-generation passes. This is only meaningful for
+the just-in-time compiler, at present.
+
+=item B<-time-passes>
+
+Record the amount of time needed for each code-generation pass and print it to
+standard error.
+
+=item B<-march>=I<arch>
+
+Use the specified non-default architecture arch when selecting a code generator
+for the just-in-time compiler. This may result in a crash if you pick an
+architecture which is not compatible with the hardware you are running B<lli> on.
+
+=item B<-force-interpreter>=I<{false,true}>
+
+If set to true, use the interpreter even if a just-in-time compiler is available
+for this architecture. Defaults to false.
+
+=item B<-f>=I<name>
+
+Call the function named I<name> to start the program.  Note: The
+function is assumed to have the C signature C<int> I<name> C<(int,
+char **, char **)>.  If you try to use this option to call a function of
+incompatible type, undefined behavior may result. Defaults to C<main>.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<lli> fails to load the program, it will exit with an exit code of 1.
+Otherwise, it will return the exit code of the program it executes.
+
+=head1 SEE ALSO
+
+L<llc|llc>
+
+=head1 AUTHOR
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/llvm-as.html

@@ -1,97 +0,0 @@
-<html>
-<title>
-LLVM: llvm-as tool
-</title>
-
-<body bgcolor=white>
-
-<center><h1>LLVM: <tt>llvm-as</tt> tool</h1></center>
-<HR>
-
-<h3>NAME</h3>
-<tt>llvm-as</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>llvm-as [options] [filename]</tt>
-
-<h3>DESCRIPTION</h3>
-
-The <tt>llvm-as</tt> command is the LLVM assembler.  It reads a file containing
-human readable LLVM assembly language, translates it to LLVM bytecode, and
-writes the result into a file or to standard output.
-<p>
-
-If filename is omitted or is -, then <tt>llvm-as</tt> reads its input from
-standard input.
-<p>
-
-If an output file is not specified with the <tt>-o</tt> option, then
-<tt>llvm-as</tt> sends its output to a file or standard output by the following
-logic:
-
-<ul>
-	<li>
-	If the input is standard input, then the output is standard output.
-	<p>
-
-	<li>
-	If the input is a file that ends with .ll, then the output file is of
-	the same name, except that the suffix is changed to .bc.
-	<p>
-
-	<li>
-	If the input is a file that does not end with the .ll suffix, then the
-	output file has the same name as the input file, except that the .bc
-	suffix is appended.
-	<p>
-</ul>
-
-<h3>OPTIONS</h3>
-
-<ul>
-	<li> -f
-	<br>
-	Force overwrite.  Normally, <tt>llvm-as</tt> will refuse to overwrite an
-	output file that already exists.  With this option, <tt>llvm-as</tt>
-	will overwrite the output file and replace it with new bytecode.
-	<p>
-
-	<li> -help
-	<br>
-	Print a summary of command line options.
-	<p>
-
-	<li> -o &lt;filename&gt;
-	<br>
-	Specify the output filename.  If filename is -, then <tt>llvm-as</tt>
-	sends its output to standard output.
-	<p>
-
-	<li> -stats
-	<br>
-	Print statistics.
-	<p>
-
-	<li> -time-passes
-	<br>
-	Record the amount of time needed for each pass and print it to standard
-	error.
-	<p>
-</ul>
-
-<h3>EXIT STATUS</h3>
-
-If <tt>llvm-as</tt> succeeds, it will exit with 0.  Otherwise, if an error
-occurs, it will exit with a non-zero value.
-
-<h3>SEE ALSO</h3>
-
-<a href="llvm-dis.html"><tt>llvm-dis</tt></a>
-<a href="gccas.html"><tt>gccas</tt></a>
-
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/llvm-as.pod

@@ -0,0 +1,86 @@
+=pod
+
+=head1 NAME
+
+llvm-as - LLVM assembler
+
+=head1 SYNOPSIS
+
+B<llvm-as> [I<options>] [I<filename>]
+
+=head1 DESCRIPTION
+
+The B<llvm-as> command invokes the LLVM assembler.  It reads a file containing
+human-readable LLVM assembly language, translates it to LLVM bytecode, and
+writes the result into a file or to standard output.
+
+If F<filename> is omitted or is C<->, then B<llvm-as> reads its input from
+standard input.
+
+If an output file is not specified with the B<-o> option, then
+B<llvm-as> sends its output to a file or standard output by following
+these rules:
+
+=over 
+
+=item *
+
+If the input is standard input, then the output is standard output.
+
+=item *
+
+If the input is a file that ends with C<.ll>, then the output file is of
+the same name, except that the suffix is changed to C<.bc>.
+
+=item *
+
+If the input is a file that does not end with the C<.ll> suffix, then the
+output file has the same name as the input file, except that the C<.bc>
+suffix is appended.
+
+=back
+
+=head1 OPTIONS
+
+=over
+
+=item B<-f>
+
+Force overwrite.  Normally, B<llvm-as> will refuse to overwrite an
+output file that already exists.  With this option, B<llvm-as>
+will overwrite the output file and replace it with new bytecode.
+
+=item B<--help>
+
+Print a summary of command line options.
+
+=item B<-o> F<filename>
+
+Specify the output file name.  If F<filename> is C<->, then B<llvm-as>
+sends its output to standard output.
+
+=item B<--stats>
+
+Print statistics.
+
+=item B<--time-passes>
+
+Record the amount of time needed for each pass and print it to standard
+error.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<llvm-as> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<llvm-dis|llvm-dis>, L<gccas|gccas>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/llvm-bcanalyzer.pod

@@ -0,0 +1,66 @@
+=pod
+
+=head1 NAME
+
+llvm-bcanalyzer - LLVM bytecode analyzer
+
+=head1 SYNOPSIS
+
+B<llvm-bcanalyzer> [I<options>] [I<filename>]
+
+=head1 DESCRIPTION
+
+The B<llvm-bcanalyzer> command is a small utility for analyzing bytecode files.
+The tool reads a bytecode file (such as generated with the B<llvm-as> tool) and
+produces a statistical report on the contents of the byteocde file.  The tool
+will also dump a low level but human readable version of the bytecode file. 
+This tool is probably not of much interest or utility except for those working 
+directly with the bytecode file format. Most LLVM users can just ignore
+this tool.
+
+If F<filename> is omitted or is C<->, then B<llvm-bcanalyzer> reads its input 
+from standard input. This is useful for combining the tool into a pipeline.
+
+Output is written to the standard output.
+
+=head1 OPTIONS
+
+=over
+
+=item B<-nodetails>
+
+Causes B<llvm-bcanalyzer> to abbreviate its output by writing out only a module 
+level summary. The details for individual functions are not displayed.
+
+=item B<-dump>
+
+Causes B<llvm-bcanalyzer> to dump the bytecode in a human readable format. This 
+format is significantly different from LLVM assembly and provides details about 
+the encoding of the bytecode file. 
+
+=item B<-verify>
+
+Causes B<llvm-bcanalyzer> to verify the module produced by by reading the 
+bytecode. This ensures that the statistics generated are based on a consistent
+module.
+
+=item B<--help>
+
+Print a summary of command line options.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<llvm-bcanalyzer> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value, usually 1.
+
+=head1 SEE ALSO
+
+L<llvm-dis|llvm-dis>, L<http://llvm.cs.uiuc.edu/docs/BytecodeFormat.html>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/llvm-db.pod

@@ -0,0 +1,16 @@
+=pod
+
+=head1 NAME
+
+llvm-db - LLVM debugger (alpha)
+
+=head1 SYNOPSIS
+
+Details coming soon. Please see 
+L<http://llvm.cs.uiuc.edu/docs/SourceLevelDebugging.html> in the meantime.
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/llvm-dis.html

@@ -1,99 +0,0 @@
-<html>
-<title>
-LLVM: llvm-dis tool
-</title>
-
-<body bgcolor=white>
-
-<center><h1>LLVM: <tt>llvm-dis</tt> tool</h1></center>
-<HR>
-
-<h3>NAME</h3>
-<tt>llvm-dis</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>llvm-dis [options] [filename]</tt>
-
-<h3>DESCRIPTION</h3>
-
-The <tt>llvm-dis</tt> command is the LLVM disassembler.  It takes an LLVM
-bytecode file and converts it into LLVM assembly language or C source code with
-equivalent functionality.
-<p>
-
-If filename is omitted, <tt>llvm-dis</tt> reads its input from standard input.
-<p>
-
-The default output file for <tt>llvm-dis</tt> is determined by the following logic:
-<ul>
-	<li>
-	If the input is standard input or the file -, then the output is
-	standard output.
-	<p>
-
-	<li>
-	If the input filename ends in .bc, then the output filename will be
-	identical, except that the .bc suffix will be replaced by the .ll or .c
-	suffix (for LLVM assembly language and C code, respectively).
-	<p>
-
-	<li>
-	If the input filename does not end in .bc, then the output filename will
-	be identical to the input filename, except that the .ll or .c suffix
-	will be appended to the filename (for LLVM assembly language and C code,
-	respectively).
-</ul>
-
-<h3>OPTIONS</h3>
-
-<ul>
-	<li> -llvm
-	<br>
-	Instruct <tt>llvm-dis</tt> to generate LLVM assembly code in human
-	readable format.  This is the default behavior.
-	<p>
-
-	<li> -c
-	<br>
-	Instruct <tt>llvm-dis</tt> to generate C source code.
-	<p>
-
-	<li> -f
-	<br>
-	Force overwrite.  Normally, <tt>llvm-dis</tt> will refuse to overwrite
-	an output file that already exists.  With this option, <tt>llvm-dis</tt>
-	will overwrite the output file.
-	<p>
-
-	<li> -help
-	<br>
-	Print a summary of command line options.
-	<p>
-
-	<li> -o &lt;filename&gt;
-	<br>
-	Specify the output filename.  If filename is -, then the output is sent
-	to standard output.
-	<p>
-
-	<li> -time-passes
-	<br>
-	Record the amount of time needed for each pass and print it to standard
-	error.
-	<p>
-</ul>
-
-<h3>EXIT STATUS</h3>
-
-If <tt>llvm-dis</tt> succeeds, it will exit with 0.  Otherwise, if an error
-occurs, it will exit with a non-zero value.
-
-<h3>SEE ALSO</h3>
-
-<a href="llvm-as.html"><tt>llvm-as</tt></a>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/llvm-dis.pod

@@ -0,0 +1,65 @@
+=pod
+
+=head1 NAME
+
+llvm-dis - LLVM disassembler
+
+=head1 SYNOPSIS
+
+B<llvm-dis> [I<options>] [I<filename>]
+
+=head1 DESCRIPTION
+
+The B<llvm-dis> command is the LLVM disassembler.  It takes an LLVM
+bytecode file and converts it into human-readable LLVM assembly language.
+
+If filename is omitted or specified as C<->, B<llvm-dis> reads its
+input from standard input.
+
+If the input is being read from standard input, then B<llvm-dis>
+will send its output to standard output by default.  Otherwise, the
+output will be written to a file named after the input file, with
+a C<.ll> suffix added (any existing C<.bc> suffix will first be
+removed).  You can override the choice of output file using the
+B<-o> option.
+
+=head1 OPTIONS
+
+=over
+
+=item B<-f>
+
+Force overwrite.  Normally, B<llvm-dis> will refuse to overwrite
+an output file that already exists.  With this option, B<llvm-dis>
+will overwrite the output file.
+
+=item B<--help>
+
+Print a summary of command line options.
+
+=item B<-o> F<filename>
+
+Specify the output file name.  If F<filename> is -, then the output is sent
+to standard output.
+
+=item B<-time-passes>
+
+Record the amount of time needed for each pass and print it to standard
+error.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<llvm-dis> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<llvm-as|llvm-as>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/llvm-link.html

@@ -1,88 +0,0 @@
-<html>
-<title>
-LLVM: llvm-link tool
-</title>
-
-<body bgcolor=white>
-
-<center><h1>LLVM: <tt>llvm-link</tt> tool</h1></center>
-<HR>
-
-<h3>NAME</h3>
-<tt>llvm-link</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>llvm-link [options] &lt;filename&gt; [filename ...]</tt>
-
-<h3>DESCRIPTION</h3>
-
-The <tt>llvm-link</tt> command takes several LLVM bytecode files and links them
-together into a single LLVM bytecode file.  It writes the output file to
-standard output, unless the -o option is used to specify a filename.
-<p>
-
-The <tt>llvm-link</tt> command attempts to load the input files from the current
-directory.  If that fails, it looks for each file in each of the
-directories specified by the -L options on the command line.  The library search
-paths are global; each one is searched for every input file if necessary.  The
-directories are searched in the order they were specified on the command line.
-
-<h3>
-OPTIONS
-</h3>
-
-<ul>
-	<li>-L &lt;directory&gt;
-	<br>
-	Add the specified directory to the library search path.  When looking
-	for libraries, <tt>llvm-link</tt> will look in pathname for libraries.
-	This option can be specified multiple times; <tt>llvm-link</tt> will
-	search inside these directories in the order in which they were
-	specified on the command line.
-	<p>
-
-	<li>-f
-	<br>
-	Overwrite output files.  By default, <tt>llvm-link</tt> will not
-	overwrite an output file if it alreadys exists.
-	<p>
-
-	<li>-o &lt;filename&gt;
-	<br>
-	Output filename.  If filename is -, then <tt>llvm-link</tt> will write
-	its output to standard output.
-	<p>
-
-	<li>-d
-	<br>
-	If specified, <tt>llvm-link</tt> prints a human-readable version of the
-	output bytecode file to standard error.
-	<p>
-
-	<li>-help
-	<br>
-	Print a summary of command line options.
-	<p>
-
-	<li>-v
-	<br>
-	Verbose mode.  Print information about what <tt>llvm-link</tt> is doing.
-    This typically includes a message for each bytecode file linked in
-    and for each library found.
-</ul>
-
-<h3>
-EXIT STATUS
-</h3>
-
-If <tt>llvm-link</tt> succeeds, it will exit with 0.  Otherwise, if an error
-occurs, it will exit with a non-zero value.
-
-<h3>SEE ALSO</h3>
-<a href="gccld.html"><tt>gccld</tt></a>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/llvm-link.pod

@@ -0,0 +1,75 @@
+=pod
+
+=head1 NAME
+
+llvm-link - LLVM linker
+
+=head1 SYNOPSIS
+
+B<llvm-link> [I<options>] I<filename ...>
+
+=head1 DESCRIPTION
+
+The B<llvm-link> command takes several LLVM bytecode files and links them
+together into a single LLVM bytecode file.  It writes the output file to
+standard output, unless the B<-o> option is used to specify a filename.
+
+The B<llvm-link> command attempts to load the input files from the current
+directory.  If that fails, it looks for each file in each of the directories
+specified by the B<-L> options on the command line.  The library search paths
+are global; each one is searched for every input file if necessary.  The
+directories are searched in the order they were specified on the command line.
+
+=head1 OPTIONS
+
+=over
+
+=item B<-L> F<directory>
+
+Add the specified F<directory> to the library search path.  When looking for
+libraries, B<llvm-link> will look in pathname for libraries.  This option can be
+specified multiple times; B<llvm-link> will search inside these directories in
+the order in which they were specified on the command line.
+
+=item B<-f>
+
+Overwrite output files.  By default, B<llvm-link> will not overwrite an output
+file if it alreadys exists.
+
+=item B<-o> F<filename>
+
+Specify the output file name.  If F<filename> is C<->, then B<llvm-link> will
+write its output to standard output.
+
+=item B<-d>
+
+If specified, B<llvm-link> prints a human-readable version of the output
+bytecode file to standard error.
+
+=item B<--help>
+
+Print a summary of command line options.
+
+=item B<-v>
+
+Verbose mode.  Print information about what B<llvm-link> is doing.  This
+typically includes a message for each bytecode file linked in and for each
+library found.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<llvm-link> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<gccld>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut
+

llvm/docs/CommandGuide/llvm-nm.html

@@ -1,118 +0,0 @@
-<html>
-<title>
-LLVM: llvm-nm tool
-</title>
-
-<body bgcolor=white>
-
-<center><h1>LLVM: <tt>llvm-nm</tt> tool</h1></center>
-<HR>
-
-<h3>NAME</h3>
-<tt>llvm-nm</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>llvm-nm [options] [filenames...]</tt>
-
-<h3>DESCRIPTION</h3>
-
-<p>The <tt>llvm-nm</tt> utility lists the names of symbols from the
-LLVM bytecode files named on the command line, along with some
-ancillary information about each symbol. If no filename is specified,
-or - is used as a filename, <tt>llvm-nm</tt> reads its input from standard
-input.</p>
-
-<p><tt>llvm-nm</tt>'s default output format is the traditional BSD
-<tt>nm(1)</tt> output format. Each such output record consists of an
-(optional) 8-digit hexadecimal address, followed by a type code
-character, followed by a name, for each symbol. One record is printed
-per line; fields are separated by spaces. When the address is omitted,
-it is replaced by 8 spaces.</p>
-
-<p>Type code characters currently supported, and their meanings, are
-as follows:</p>
-
-<table border>
-<tr><td>U</td><td>Named object is referenced but undefined in this
-              bytecode file</td></tr>
-<tr><td>C</td><td>Common (multiple defs link together into one
-              def)</td></tr>
-<tr><td>W</td><td>Weak reference (multiple defs link together into zero or
-              one defs)</td></tr>
-<tr><td>t</td><td>Local function (text) object</td></tr>
-<tr><td>T</td><td>Global function (text) object</td></tr>
-<tr><td>d</td><td>Local data object</td></tr>
-<tr><td>D</td><td>Global data object</td></tr>
-<tr><td>?</td><td>Something unrecognizable</td></tr>
-</table>
-
-<p>Because LLVM bytecode files typically contain objects that are not
-considered to have addresses until they are linked into an executable
-image or dynamically compiled "just-in-time", <tt>llvm-nm</tt> does
-not print an address for any symbol, even symbols which are defined in
-the bytecode file.</p>
-
-<h3>OPTIONS</h3>
-
-<ul>
-	<li> -P
-	<br>
-        Use POSIX.2 output format. Alias for --format=posix.
-	<p>
-	<li> -B    (default)
-	<br>
-        Use BSD output format. Alias for --format=bsd.
-	<p>
-
-	<li> -help
-	<br>
-	Print a summary of command-line options and their meanings.
-	<p>
-
-	<li> -defined-only
-	<br>
-	Print only symbols defined in this bytecode file (as opposed
-        to symbols which may be referenced by objects in this file,
-        but not defined in this file.)
-	<p>
-
-	<li> -extern-only, -g
-	<br>
-	Print only symbols whose definitions are external; that is,
-        accessible from other bytecode files.
-	<p>
-
-	<li> -undefined-only, -u
-	<br>
-	Print only symbols referenced but not defined in this bytecode
-        file.
-	<p>
-
-	<li> -format=<i>fmt</i>, -f
-	<br>
-	Select an output format; <i>fmt</i> may be sysv, posix, or
-        bsd. The default is bsd.
-	<p>
-</ul>
-
-<h3>BUGS</h3>
-
-<tt>llvm-nm</tt> cannot currently see inside <tt>ar(1)</tt> library
-archive files, like <tt>nm(1)</tt> can. It cannot demangle C++ mangled
-names, like GNU <tt>nm(1)</tt> can.
-
-<h3>EXIT STATUS</h3>
-
-<tt>llvm-nm</tt> exits with an exit code of zero.
-
-<h3>SEE ALSO</h3>
-
-<a href="llvm-dis.html"><tt>llvm-dis</tt></a>,
-<tt>ar(1)</tt>,
-<tt>nm(1)</tt>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/llvm-nm.pod

@@ -0,0 +1,122 @@
+=pod
+
+=head1 NAME
+
+llvm-nm - list LLVM bytecode file's symbol table
+
+=head1 SYNOPSIS
+
+B<llvm-nm> [I<options>] [I<filenames...>]
+
+=head1 DESCRIPTION
+
+The B<llvm-nm> utility lists the names of symbols from the LLVM bytecode files,
+or B<ar> archives containing LLVM bytecode files, named on the command line.
+Each symbol is listed along with some simple information about its provenance.
+If no filename is specified, or I<-> is used as a filename, B<llvm-nm> will
+process a bytecode file on its standard input stream.
+
+B<llvm-nm>'s default output format is the traditional BSD B<nm> output format.
+Each such output record consists of an (optional) 8-digit hexadecimal address,
+followed by a type code character, followed by a name, for each symbol. One
+record is printed per line; fields are separated by spaces. When the address is
+omitted, it is replaced by 8 spaces.
+
+Type code characters currently supported, and their meanings, are as follows:
+
+=over
+
+=item U
+
+Named object is referenced but undefined in this bytecode file
+
+=item C
+
+Common (multiple defs link together into one def)
+
+=item W
+
+Weak reference (multiple defs link together into zero or one defs)
+
+=item t
+
+Local function (text) object
+
+=item T
+
+Global function (text) object
+
+=item d
+
+Local data object
+
+=item D
+
+Global data object
+
+=item ?
+
+Something unrecognizable
+
+=back
+
+Because LLVM bytecode files typically contain objects that are not considered to
+have addresses until they are linked into an executable image or dynamically
+compiled "just-in-time", B<llvm-nm> does not print an address for any symbol,
+even symbols which are defined in the bytecode file.
+
+=head1 OPTIONS
+
+=over
+
+=item B<-P>
+
+Use POSIX.2 output format. Alias for B<--format=posix>.
+
+=item B<-B>    (default)
+
+Use BSD output format. Alias for B<--format=bsd>.
+
+=item B<--help>
+
+Print a summary of command-line options and their meanings.
+
+=item B<--defined-only>
+
+Print only symbols defined in this bytecode file (as opposed to
+symbols which may be referenced by objects in this file, but not
+defined in this file.)
+
+=item B<--extern-only>, B<-g>
+
+Print only symbols whose definitions are external; that is, accessible
+from other bytecode files.
+
+=item B<--undefined-only>, B<-u>
+
+Print only symbols referenced but not defined in this bytecode file.
+
+=item B<--format=>I<fmt>, B<-f>
+
+Select an output format; I<fmt> may be I<sysv>, I<posix>, or I<bsd>. The
+default is I<bsd>.
+
+=back
+
+=head1 BUGS
+
+B<llvm-nm> cannot demangle C++ mangled names, like GNU B<nm> can.
+
+=head1 EXIT STATUS
+
+B<llvm-nm> exits with an exit code of zero.
+
+=head1 SEE ALSO
+
+L<llvm-dis|llvm-dis>, L<ar(1)>, L<nm(1)>
+
+=head1 AUTHOR
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/llvm-prof.pod

@@ -0,0 +1,57 @@
+=pod
+
+=head1 NAME
+
+llvm-prof - print execution profile of LLVM program
+
+=head1 SYNOPSIS
+
+B<llvm-prof> [I<options>] [I<bytecode file>] [I<llvmprof.out>]
+
+=head1 DESCRIPTION
+
+The B<llvm-prof> tool reads in an F<llvmprof.out> file (which can
+optionally use a specific file with the third program argument), a bytecode file
+for the program, and produces a human readable report, suitable for determining
+where the program hotspots are.
+
+This program is often used in conjunction with the F<utils/profile.pl>
+script.  This script automatically instruments a program, runs it with the JIT,
+then runs B<llvm-prof> to format a report.  To get more information about
+F<utils/profile.pl>, execute it with the B<--help> option.
+
+=head1 OPTIONS
+
+=over
+
+=item B<--annotated-llvm> or B<-A>
+
+In addition to the normal report printed, print out the code for the
+program, annotated with execution frequency information. This can be
+particularly useful when trying to visualize how frequently basic blocks
+are executed.  This is most useful with basic block profiling
+information or better.
+
+=item B<--print-all-code>
+
+Using this option enables the B<--annotated-llvm> option, but it
+prints the entire module, instead of just the most commonly executed
+functions.
+
+=item B<--time-passes>
+
+Record the amount of time needed for each pass and print it to standard
+error.
+
+=back
+
+=head1 EXIT STATUS
+
+B<llvm-prof|llvm-prof> returns 1 if it cannot load the bytecode file or the
+profile information. Otherwise, it exits with zero.
+
+=head1 AUTHOR
+
+B<llvm-prof> is maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/llvmgcc.html

@@ -1,113 +0,0 @@
-<html>
-<title>
-LLVM: llvmgcc tool
-</title>
-
-<body bgcolor=white>
-
-<center>
-<h1>LLVM: <tt>llvmgcc</tt> tool</h1>
-</center>
-<HR>
-
-<h3>NAME</h3>
-<tt>llvmgcc</tt>
-
-<h3>
-SYNOPSIS
-</h3>
-
-<tt>llvmgcc [options] filename</tt>
-<h3>
-DESCRIPTION
-</h3>
-
-The <tt>llvmgcc</tt> command is the LLVM C front end.  It is a modified version
-of the <a href="http://gcc.gnu.org">GNU Compiler Collection</a> (GCC) that takes
-C programs and compiles them into LLVM bytecode or assembly language, depending
-upon the options.
-<p>
-
-Unless the <tt>-S</tt> option is specified, <tt>llvmgcc</tt> will use the
-<a href="gccas.html"><tt>gccas</tt></a> program to perform some optimizations
-and create an LLVM bytecode file. Unless the <tt>-c</tt> option is specified,
-<tt>llvmgcc</tt> will also use the <a href="gccld.html"><tt>gccld</tt></a>
-program to perform further optimizations and link the resulting bytecode
-file(s) with support libraries to create an executable program.
-<p>
-
-Being derived from GCC, llvmgcc has many of GCC's features and accepts most of
-GCC's options.  It handles a number of GCC's extensions to the C programming
-language.
-<p>
-
-Below you will find several commonly used options:
-
-<h3>
-OPTIONS
-</h3>
-
-<ul>
-	<li> -S
-	<br>
-	Do not generate an LLVM bytecode file.  Rather, compile the source file
-	into an LLVM assembly language file.
-	<p>
-
-	<li> -c
-	<br>
-	Do not generate a linked bytecode executable.  Rather, compile the source
-	file into an LLVM bytecode file.  This bytecode file can then be linked
-	with other bytecode files later to generate a full LLVM executable.
-	<p>
-
-	<li> -o <i>filename</i>
-	<br>
-	Specify the output file to be <i>filename</i>.
-	<p>
-
-	<li> -I <i>directory</i>
-	<br>
-	Add a directory to the header file search path.  This option can be
-	repeated.
-	<p>
-
-	<li> -L <i>directory</i>
-	<br>
-	Add <i>directory</i> to the library search path.  This option can be
-	repeated.
-	<p>
-
-	<li> -l<i>name</i>
-	<br>
-	Link in the library lib<i>name</i>.[bc | a | so].  This library should
-	be a bytecode library.
-	<p>
-
-	<li>-Wl,<i>option</i>
-	<br>
-	Pass <i>option</i> to the linker program, <a
-	href="gccld.html"><tt>gccld</tt></a>.
-	<p>
-</ul>
-
-<h3>
-EXIT STATUS
-</h3>
-
-If <tt>llvmgcc</tt> succeeds, it will exit with 0.  Otherwise, if an error
-occurs, it will exit with a non-zero value.
-
-<h3>
-SEE ALSO
-</h3>
-<A HREF="llvmgxx.html"><tt>llvmg++</tt></A>,
-<A HREF="gccas.html"><tt>gccas</tt></A>,
-<A HREF="gccld.html"><tt>gccld</tt></A>,
-and the Info documentation for <tt>gcc</tt>.
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/llvmgcc.pod

@@ -0,0 +1,87 @@
+=pod
+
+=head1 NAME
+
+llvmgcc - LLVM C front-end
+
+=head1 SYNOPSIS
+
+B<llvmgcc> [I<options>] I<filename>
+
+=head1 DESCRIPTION
+
+The B<llvmgcc> command is the LLVM C front end.  It is a modified
+version of gcc that takes C programs and compiles them into LLVM
+bytecode or assembly language, depending upon the options.
+
+Unless the B<-S> option is specified, B<llvmgcc> will use the
+L<gccas|gccas> program to perform some optimizations and create an
+LLVM bytecode file. Unless the B<-c> option is specified, B<llvmgcc>
+will also use the L<gccld|gccld> program to perform further
+optimizations and link the resulting bytecode file(s) with support
+libraries to create an executable program.
+
+Being derived from the GNU Compiler Collection, B<llvmgcc> has many
+of gcc's features and accepts most of gcc's options.  It handles a
+number of gcc's extensions to the C programming language.
+
+=head1 OPTIONS
+
+=over
+
+=item B<--help>
+
+Print a summary of command line options.
+
+=item B<-S>
+
+Do not generate an LLVM bytecode file.  Rather, compile the source
+file into an LLVM assembly language file.
+
+=item B<-c>
+
+Do not generate a linked executable.  Rather, compile the source
+file into an LLVM bytecode file.  This bytecode file can then be
+linked with other bytecode files later on to generate a full LLVM
+executable.
+
+=item B<-o> I<filename>
+
+Specify the output file to be I<filename>.
+
+=item B<-I> I<directory>
+
+Add a directory to the header file search path.  This option can be
+repeated.
+
+=item B<-L> I<directory>
+
+Add I<directory> to the library search path.  This option can be
+repeated.
+
+=item B<-l>I<name>
+
+Link in the library libI<name>.[bc | a | so].  This library should
+be a bytecode library.
+
+=item B<-Wl,>I<option>
+
+Pass I<option> to the linker (usually gccld).
+
+=back
+
+=head1 EXIT STATUS
+
+If B<llvmgcc> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<llvmg++|llvmgxx>, L<gccas|gccas>, L<gccld|gccld>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut
+

llvm/docs/CommandGuide/llvmgxx.html

@@ -1,107 +0,0 @@
-<html>
-<title>
-LLVM: llvmg++ tool
-</title>
-
-<body bgcolor=white>
-
-<center>
-<h1>LLVM: <tt>llvmg++</tt> tool</h1>
-</center>
-<HR>
-
-<h3>NAME</h3>
-<tt>llvmg++</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>llvmg++ [options] filename</tt>
-
-<h3>DESCRIPTION</h3>
-
-The <tt>llvmg++</tt> command is the LLVM C++ front end.  It is a modified
-version of g++ that takes C++ programs and compiles them into LLVM bytecode or
-assembly language, depending upon the options.
-<p>
-
-Unless the <tt>-S</tt> option is specified, <tt>llvmg++</tt> will use the
-<a href="gccas.html"><tt>gccas</tt></a> program to perform some optimizations
-and create an LLVM bytecode file. Unless the <tt>-c</tt> option is specified,
-<tt>llvmg++</tt> will also use the <a href="gccld.html"><tt>gccld</tt></a>
-program to perform further optimizations and link the resulting bytecode
-file(s) with support libraries to create an executable program.
-<p>
-
-Being derived from the <a href="http://gcc.gnu.org">GNU Compiler Collection</a>,
-<tt>llvmg++</tt> has many of g++'s features and accepts most of g++'s options.
-It handles a number of g++'s extensions to the C++ programming language.
-<p>
-
-Below you will find several commonly used options:
-
-<h3>
-OPTIONS
-</h3>
-
-<ul>
-	<li> -S
-	<br>
-	Do not generate an LLVM bytecode file.  Rather, compile the source file
-	into an LLVM assembly language file.
-	<p>
-
-	<li> -c
-	<br>
-	Do not generate a linked executable.  Rather, compile the source file
-	into an LLVM bytecode file.  This bytecode file can then be linked with
-	other bytecode files later on to generate a full LLVM executable.
-	<p>
-
-	<li> -o <i>filename</i>
-	<br>
-	Specify the output file to be <i>filename</i>.
-	<p>
-
-	<li> -I <i>directory</i>
-	<br>
-	Add a directory to the header file search path.  This option can be
-	repeated.
-	<p>
-
-	<li> -L <i>directory</i>
-	<br>
-	Add <i>directory</i> to the library search path.  This option can be
-	repeated.
-	<p>
-
-	<li> -l<i>name</i>
-	<br>
-	Link in the library lib<i>name</i>.[bc | a | so].  This library should
-	be a bytecode library.
-	<p>
-
-	<li>-Wl,<i>option</i>
-	<br>
-	Pass <i>option</i> to the linker (usually gccld).
-	<p>
-
-</ul>
-
-<h3>
-EXIT STATUS
-</h3>
-
-If <tt>llvmg++</tt> succeeds, it will exit with 0.  Otherwise, if an error
-occurs, it will exit with a non-zero value.
-
-<h3>
-SEE ALSO
-</h3>
-<A HREF="llvmgcc.html"><tt>llvmg++</tt></A>,
-<A HREF="gccas.html"><tt>gccas</tt></A>,
-<A HREF="gccld.html"><tt>gccld</tt></A>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/llvmgxx.pod

@@ -0,0 +1,87 @@
+=pod
+
+=head1 NAME
+
+llvmg++ - LLVM C++ front-end
+
+=head1 SYNOPSIS
+
+B<llvmg++> [I<options>] I<filename>
+
+=head1 DESCRIPTION
+
+The B<llvmg++> command is the LLVM C++ front end.  It is a modified
+version of g++ that takes C++ programs and compiles them into LLVM
+bytecode or assembly language, depending upon the options.
+
+Unless the B<-S> option is specified, B<llvmg++> will use the
+L<gccas|gccas> program to perform some optimizations and create an
+LLVM bytecode file. Unless the B<-c> option is specified, B<llvmg++>
+will also use the L<gccld|gccld> program to perform further
+optimizations and link the resulting bytecode file(s) with support
+libraries to create an executable program.
+
+Being derived from the GNU Compiler Collection, B<llvmg++> has many
+of g++'s features and accepts most of g++'s options.  It handles a
+number of g++'s extensions to the C++ programming language.
+
+=head1 OPTIONS
+
+=over
+
+=item B<--help>
+
+Print a summary of command line options.
+
+=item B<-S>
+
+Do not generate an LLVM bytecode file.  Rather, compile the source
+file into an LLVM assembly language file.
+
+=item B<-c>
+
+Do not generate a linked executable.  Rather, compile the source
+file into an LLVM bytecode file.  This bytecode file can then be
+linked with other bytecode files later on to generate a full LLVM
+executable.
+
+=item B<-o> I<filename>
+
+Specify the output file to be I<filename>.
+
+=item B<-I> I<directory>
+
+Add a directory to the header file search path.  This option can be
+repeated.
+
+=item B<-L> I<directory>
+
+Add I<directory> to the library search path.  This option can be
+repeated.
+
+=item B<-l>I<name>
+
+Link in the library libI<name>.[bc | a | so].  This library should
+be a bytecode library.
+
+=item B<-Wl,>I<option>
+
+Pass I<option> to the linker (usually gccld).
+
+=back
+
+=head1 EXIT STATUS
+
+If B<llvmg++> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<llvmgcc>, L<gccas>, L<gccld>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut
+

llvm/docs/CommandGuide/man/man1/.cvsignore

@@ -0,0 +1 @@
+*.1

llvm/docs/CommandGuide/manpage.css

@@ -0,0 +1,256 @@
+/* Based on http://www.perldoc.com/css/perldoc.css */
+
+@import url("../llvm.css");
+
+body { font-family: Arial,Helvetica; }
+
+blockquote { margin: 10pt;  }
+
+h1, a { color: #336699; }
+
+
+/*** Top menu style ****/
+.mmenuon { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #ff6600; font-size: 10pt;
+ }
+.mmenuoff { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #ffffff; font-size: 10pt;
+}	  
+.cpyright {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #ffffff; font-size: xx-small;
+}
+.cpyrightText {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #ffffff; font-size: xx-small;
+}
+.sections { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 11pt;
+}	 
+.dsections { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 12pt;
+}	
+.slink { 
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: none;
+ color: #000000; font-size: 9pt;
+}	 
+
+.slink2 { font-family: Arial,Helvetica; text-decoration: none; color: #336699; }	 
+
+.maintitle { 
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 18pt;
+}	 
+.dblArrow {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: small;
+}
+.menuSec {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: small;
+}
+
+.newstext {
+ font-family: Arial,Helvetica; font-size: small;
+}
+
+.linkmenu {
+ font-family: Arial,Helvetica; color: #000000; font-weight: bold;
+ text-decoration: none;
+}
+
+P {
+ font-family: Arial,Helvetica;
+}
+
+PRE {
+    font-size: 10pt;
+}
+.quote { 
+ font-family: Times; text-decoration: none;
+ color: #000000; font-size: 9pt; font-style: italic;
+}	
+.smstd { font-family: Arial,Helvetica; color: #000000; font-size: x-small; } 
+.std { font-family: Arial,Helvetica; color: #000000; } 
+.meerkatTitle { 
+ font-family: sans-serif; font-size: x-small;  color: black;    }
+
+.meerkatDescription { font-family: sans-serif; font-size: 10pt; color: black }
+.meerkatCategory { 
+ font-family: sans-serif; font-size: 9pt; font-weight: bold; font-style: italic; 
+ color: brown; }
+.meerkatChannel { 
+ font-family: sans-serif; font-size: 9pt; font-style: italic; color: brown; }
+.meerkatDate { font-family: sans-serif; font-size: xx-small; color: #336699; }
+
+.tocTitle {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #333333; font-size: 10pt;
+}
+
+.toc-item {
+ font-family: Arial,Helvetica; font-weight: bold; 
+ color: #336699; font-size: 10pt; text-decoration: underline;
+}
+
+.perlVersion {
+ font-family: Arial,Helvetica; font-weight: bold; 
+ color: #336699; font-size: 10pt; text-decoration: none;
+}
+
+.podTitle {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #000000;
+}
+
+.docTitle {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #000000; font-size: 10pt;
+}
+.dotDot {
+ font-family: Arial,Helvetica; font-weight: bold; 
+ color: #000000; font-size: 9pt;
+}
+
+.docSec {
+ font-family: Arial,Helvetica; font-weight: normal; 
+ color: #333333; font-size: 9pt;
+}
+.docVersion {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 10pt;
+}
+
+.docSecs-on {
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: none;
+ color: #ff0000; font-size: 10pt;
+}
+.docSecs-off {
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: none;
+ color: #333333; font-size: 10pt;
+}
+
+h2 {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: medium;
+}
+h1 {
+ font-family: Verdana,Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: large;
+}
+
+DL {
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: none;
+ color: #333333; font-size: 10pt;
+}
+
+UL > LI > A {
+ font-family: Arial,Helvetica; font-weight: bold;
+ color: #336699; font-size: 10pt;
+}
+
+.moduleInfo {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #333333; font-size: 11pt;
+}
+
+.moduleInfoSec {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none;
+ color: #336699; font-size: 10pt;
+}
+
+.moduleInfoVal {
+ font-family: Arial,Helvetica; font-weight: normal; text-decoration: underline;
+ color: #000000; font-size: 10pt;
+}
+
+.cpanNavTitle {
+ font-family: Arial,Helvetica; font-weight: bold; 
+ color: #ffffff; font-size: 10pt;
+}
+.cpanNavLetter {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none; 
+ color: #333333; font-size: 9pt;
+}
+.cpanCat {
+ font-family: Arial,Helvetica; font-weight: bold; text-decoration: none; 
+ color: #336699; font-size: 9pt;
+}
+
+.bttndrkblue-bkgd-top {
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgtop.gif);
+}
+.bttndrkblue-bkgd-left {
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgleft.gif);
+}
+.bttndrkblue-bkgd {
+	padding-top: 0px;
+	padding-bottom: 0px;
+	margin-bottom: 0px;
+	margin-top: 0px;
+	background-repeat: no-repeat;
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgmiddle.gif);
+	vertical-align: top;
+}
+.bttndrkblue-bkgd-right {
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgright.gif);
+}
+.bttndrkblue-bkgd-bottom {
+	background-color: #225688;
+	background-image: url(/global/mvc_objects/images/bttndrkblue_bgbottom.gif);
+}
+.bttndrkblue-text a {
+	color: #ffffff;
+	text-decoration: none;
+}
+a.bttndrkblue-text:hover {
+	color: #ffDD3C;
+	text-decoration: none;
+}
+.bg-ltblue {
+	background-color: #f0f5fa;
+} 
+
+.border-left-b {
+	background: #f0f5fa url(/i/corner-leftline.gif) repeat-y;
+} 
+
+.border-right-b {
+	background: #f0f5fa url(/i/corner-rightline.gif) repeat-y;
+} 
+
+.border-top-b {
+	background: #f0f5fa url(/i/corner-topline.gif) repeat-x;
+} 
+
+.border-bottom-b {
+	background: #f0f5fa url(/i/corner-botline.gif) repeat-x;
+} 
+
+.border-right-w {
+	background: #ffffff url(/i/corner-rightline.gif) repeat-y;
+} 
+
+.border-top-w {
+	background: #ffffff url(/i/corner-topline.gif) repeat-x;
+} 
+
+.border-bottom-w {
+	background: #ffffff url(/i/corner-botline.gif) repeat-x;
+} 
+
+.bg-white {
+	background-color: #ffffff;
+} 
+
+.border-left-w {
+	background: #ffffff url(/i/corner-leftline.gif) repeat-y;
+} 

llvm/docs/CommandGuide/opt.html

@@ -1,120 +0,0 @@
-<html>
-<title>LLVM: opt tool</title>
-
-<body bgcolor=white>
-
-<center><h1>LLVM: <tt>opt</tt> tool</h1></center>
-<HR>
-
-<h3>NAME</h3>
-<tt>opt</tt>
-
-<h3>SYNOPSIS</h3>
-<tt>opt [options] [filename]</tt>
-
-<h3>DESCRIPTION</h3>
-
-The <tt>opt</tt> command is the modular LLVM optimizer.  It takes LLVM bytecode
-as input, runs the specified optimizations on it, and then outputs the optimized
-LLVM bytecode.
-<p>
-
-The optimizations available via <tt>opt</tt> depend upon what libraries were
-linked into it as well as any additional libraries that have been loaded with
-the <tt>-load</tt> option.  Use the <tt>-help</tt> option to determine what
-optimizations you can use.
-<p>
-
-If no filename is specified on the command line, <tt>opt</tt> reads its input
-from standard input.
-<p>
-
-If an output filename is not specified with the <tt>-o</tt> option, <tt>opt</tt>
-writes its output to the standard output.
-
-
-<h3>OPTIONS</h3>
-
-<ul>
-	<li> -f
-	<br>
-	Force overwrite.  Normally, <tt>opt</tt> will refuse to overwrite an
-	output file that already exists.  With this option, <tt>opt</tt> will
-	overwrite the output file and replace it with new bytecode.
-	<p>
-
-	<li> -help
-	<br>
-	Print a summary of command line options.
-	<p>
-
-	<li> -o &lt;filename&gt;
-	<br>
-	Specify the output filename.
-	<p>
-
-	<li> -stats
-	<br>
-	Print statistics.
-	<p>
-
-	<li> -time-passes
-	<br>
-	Record the amount of time needed for each pass and print it to standard
-	error.
-	<p>
-
-	<li> -debug
-	<br>
-	If this is a debug build, this option will enable debug printouts from
-	passes which use the <tt>DEBUG</tt> macro.  See the <a
-	href="../ProgrammersManual.html#DEBUG">Programmer's Manual</a> for more
-	information.
-	<p>
-<!--
-	<li> -internalize-public-api-file &lt;filename&gt;
-	<br>
-	Preserve the symbol names listed in the file filename.
-	<p>
-
-	<li> -internalize-public-api-list=&lt;list&gt;
-	<br>
-	Perserve the symbol names specified.
-	<p>
--->
-
-	<li> -q
-	<br>
-	Quiet mode.  Do not print messages on whether the program was modified.
-	<p>
-
-	<li> -load &lt;plugin.so&gt;
-	<br>
-	Load the dynamic object &lt;plugin.so&gt;.  This object should register new
-	optimization passes.  Once loaded, the object will add new command line
-	options to enable various optimizations.  To see the new complete list
-	of optimizations, use the -help and -load options together:
-	<p>
-	<tt>opt -load  &lt;plugin.so&gt; -help</tt>
-	<p>
-
-	<li> -p
-	<br>
-	Print module after each transformation.
-	<p>
-</ul>
-
-<h3>EXIT STATUS</h3>
-
-If <tt>opt</tt> succeeds, it will exit with 0.  Otherwise, if an error occurs,
-it will exit with a non-zero value.
-
-<h3>SEE ALSO</h3>
-
-<a href="analyze.html"><tt>analyze</tt></a>
-
-<HR>
-Maintained by the <a href="http://llvm.cs.uiuc.edu">LLVM Team</a>.
-</body>
-</html>
-

llvm/docs/CommandGuide/opt.pod

@@ -0,0 +1,97 @@
+=pod
+
+=head1 NAME
+
+opt - LLVM optimizer
+
+=head1 SYNOPSIS
+
+B<opt> [I<options>] [I<filename>]
+
+=head1 DESCRIPTION
+
+The B<opt> command is the modular LLVM optimizer.  It takes LLVM
+bytecode as input, runs the specified optimizations on it, and then
+outputs the optimized LLVM bytecode.
+
+The optimizations available via B<opt> depend upon what libraries
+were linked into it as well as any additional libraries that have
+been loaded with the B<-load> option.  Use the B<-help> option to
+determine what optimizations you can use.
+
+If no filename is specified on the command line, B<opt> reads its
+input from standard input.
+
+If an output filename is not specified with the B<-o> option, B<opt>
+writes its output to the standard output.
+
+=head1 OPTIONS
+
+=over
+
+=item B<-f>
+
+Force overwrite.  Normally, B<opt> will refuse to overwrite an
+output file that already exists.  With this option, B<opt> will
+overwrite the output file and replace it with new bytecode.
+
+=item B<-help>
+
+Print a summary of command line options.
+
+=item B<-o> I<filename>
+
+Specify the output filename.
+
+=item B<-profile-info-file> I<filename>
+
+Specify the name of the file loaded by the -profile-loader option.
+
+=item B<-stats>
+
+Print statistics.
+
+=item B<-time-passes>
+
+Record the amount of time needed for each pass and print it to standard
+error.
+
+=item B<-debug>
+
+If this is a debug build, this option will enable debug printouts
+from passes which use the I<DEBUG()> macro.  See the B<LLVM Programmer's
+Manual>, section I<#DEBUG> for more information.
+
+=item B<-load>=I<plugin>
+
+Load the dynamic object I<plugin>.  This object should register new
+optimization passes.  Once loaded, the object will add new command line
+options to enable various optimizations.  To see the new complete list
+of optimizations, use the B<-help> and B<-load> options together:
+
+=over
+
+B<opt -load>=I<plugin> B<-help>
+
+=back
+
+=item B<-p>
+
+Print module after each transformation.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<opt> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value.
+
+=head1 SEE ALSO
+
+L<analyze|analyze>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/CommandGuide/ps/.cvsignore

@@ -0,0 +1 @@
+*ps

llvm/docs/CommandGuide/stkrc.pod

@@ -0,0 +1,96 @@
+=pod
+
+=head1 NAME
+
+stkrc - Stacker Compiler
+
+=head1 SYNOPSIS
+
+B<stkrc> [I<options>] [I<filename>]
+
+=head1 DESCRIPTION
+
+The B<stkrc> command is the compiler for the Stacker language. Stacker is a
+simple stack based, Forth-like language that was written as a demonstration
+language for LLVM. For details on the language, please see
+L<http://llvm.cs.uiuc.edu/docs/Stacker.html> . The B<stkrc> compiler is fairly 
+minimal. It compiles to bytecode only and doesn't perform any optimizations.
+The output of stkrc (a bytecode file) can be piped through other LLVM tools
+for optimization and linking.
+
+If F<filename> is omitted or is C<->, then B<stkrc> reads its input 
+from standard input. This is useful for combining the tool into a pipeline.
+
+If an output file is not specified with the B<-o> option, then
+B<llvm-as> sends its output to a file or standard output by following
+these rules:
+
+=over 
+
+=item *
+
+If the input is standard input, then the output is standard output.
+
+=item *
+
+If the input is a file that ends with C<.st>, then the output file is of
+the same name, except that the suffix is changed to C<.bc>.
+
+=item *
+
+If the input is a file that does not end with the C<.st> suffix, then the
+output file has the same name as the input file, except that the C<.bc>
+suffix is appended.
+
+=back
+
+=head1 OPTIONS
+
+=over
+
+=item B<-o> F<filename>
+
+Specify the output file name.  If F<filename> is C<->, then B<llvm-as>
+sends its output to standard output.
+
+=item B<-stats>
+
+Print statistics acquired during compilation.
+
+=item B<-time-passes>
+
+Record the amount of time needed for each pass and print it to standard
+error.
+
+=item B<-f>
+
+Force the output to be written. Normally, B<stkrc> won't overwrite an existing
+bytecode file. This option overrides that behavior. 
+
+=item B<-s> F<stacksize>
+
+Specify the stack size for the program. The default stack size, 1024, should be
+sufficient for most programs. For very large programs, especially those that 
+recurse a lot, you might want to provide a larger value. Each unit of this
+value consumes 8 bytes of memory.
+
+=item B<-help>
+
+Print a summary of command line options.
+
+=back
+
+=head1 EXIT STATUS
+
+If B<stkrc> succeeds, it will exit with 0.  Otherwise, if an error
+occurs, it will exit with a non-zero value, usually 1.
+
+=head1 SEE ALSO
+
+L<llvm-as>, L<http://llvm.cs.uiuc.edu/docs/Stacker.html>
+
+=head1 AUTHORS
+
+Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
+
+=cut

llvm/docs/DSGraphStatus.html

@@ -1,883 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head><title>Data Structure Graph Analysis Status Page</title></head>
-
-<body><h1>Data Structure Graph Analysis Status Page</h1>
-
-This page records information and the progress the data structure analysis
-passes have been making.  Times are in seconds, sizes are #bytes allocated for a
-particular pass.  Runs that are all '*'d out were not completed because they
-were taking too long (time listed show how long I waited).<p>
-
-Fields that appear in bold have changes from the last entry on the page.
-Floating point entries are only highlighted if they change significantly from
-their previous value.<p>
-
-<hr>
-<a name="20021113"><h2>Nov 14, 2002:</h2>
-
-Some fine tuning happened here.  The DSNode object was shrunk by a little bit,
-lowering memory consumption.  The type merging code now ignores access to
-structure fields when checking compatibility, reducing node collapses and
-increasing memory consumption in some cases.  This table also includes data for
-the number of indirect call sites, and the number of indirect call targets.  The
-final column is the average number of call targets per indirect call site.<p>
-
-<pre>
-Name:                Anlyz: LocTm: BUTim: TDTim: TimeSum: BCTime:      LocSize: BUSize:  TDSize:  BUTDSz:  BCSize:    NumFold  NumNodes   MaxSz  GlobGr MaxSCC | Loads Store Calls Allca Mallc Sum   | num/ind indcallee ratio
-254.gap              0.6627 0.1810 0.6627 0.4697 1.3134   0.6080   |   2024800  2822584  2018424  4841008  16585864 |    2076  24032+3948 268    0+0    20     | 18420 3888  5805  87    3     28203 | 11      11        1     
-255.vortex           0.3589 0.1648 0.3589 0.6751 1.1988   0.4810   |   1381200  1259752  2001576  3261328  11694840 |    1038  7343+2842  166    0+0    38     | 13901 6136  6829  1420  2     28288 | 6       95        15.8333
-300.twolf            0.0690 0.0663 0.0690 0.1151 0.2504   0.2424   |   466600   392384   400272   792656   7054760  |    95    4144+784   215    0+0    1      | 11246 2911  1865  114   3     16139 | 269     269       1     
-197.parser           0.0481 0.0305 0.0481 0.0479 0.1265   0.1291   |   281184   225008   212296   437304   4409632  |    338   2257+707   97     0+0    3      | 2611  908   1651  25    2     5197  | 2       4         2     
-burg.llvm            0.0265 0.0218 0.0265 0.0389 0.0872   0.1565   |   536960   477848   188472   666320   2997272  |    213   2309+575   98     0+0    2      | 2265  363   1128  44    4     3804  | 8       24        3     
-ptrdist-bc           0.0107 0.0079 0.0107 0.0116 0.0302   0.0354   |   198640   269032   91248    360280   1332992  |    62    680+199    42     0+0    1      | 764   411   425   21    25    1646  | 3       3         1     
-ptrdist-yacr2        0.0100 0.0073 0.0100 0.0078 0.0251   0.0212   |   176112   193048   72296    265344   982896   |    *     1036+90    53     0+0    1      | 872   174   289   16    27    1378  | *       *         n/a   
-164.gzip.llvm        0.0062 0.0094 0.0062 0.0070 0.0226   0.1029   |   201568   129000   70880    199880   1873760  |    8     971+87     67     0+0    1      | 1014  622   351   19    3     2009  | 9       9         1     
-optimizer-eval.llvm  0.0060 0.0034 0.0060 0.0344 0.0438   0.0145   |   100008   78968    61784    140752   626688   |    *     309+41     72     0+0    1      | 278   405   108   32    *     823   | 2       174       87    
-181.mcf              0.0050 0.0040 0.0050 0.0055 0.0145   0.0195   |   130984   120848   43208    164056   579064   |    46    376+52     83     0+0    1      | 362   225   81    8     2     678   | *       *         n/a   
-voronoi.llvm         0.0037 0.0028 0.0037 0.0054 0.0119   0.0098   |   63768    82584    48808    131392   413304   |    3     307+77     58     0+0    1      | 399   171   121   44    4     739   | *       *         n/a   
-256.bzip2            0.0030 0.0060 0.0030 0.0025 0.0115   0.0907   |   138536   83624    39760    123384   1363416  |    *     563+37     59     0+0    1      | 698   307   287   18    10    1320  | 2       2         1     
-sgefa.llvm           0.0028 0.0019 0.0028 0.0029 0.0076   0.0080   |   85680    81992    67056    149048   372736   |    *     130+24     36     0+0    1      | 159   65    77    5     5     311   | 1       1         1     
-sim.llvm             0.0022 0.0032 0.0022 0.0026 0.008    0.0193   |   54952    81152    21976    103128   737584   |    *     261+36     60     0+0    1      | 687   305   75    2     21    1090  | *       *         n/a   
-bh.llvm              0.0021 0.0025 0.0021 0.0019 0.0065   0.0113   |   75656    51520    27768    79288    470680   |    38    194+35     23     0+0    1      | 266   189   151   36    3     645   | 2       2         1     
-ptrdist-ft           0.0019 0.0020 0.0019 0.0021 0.006    0.0115   |   46336    58552    15464    74016    502704   |    *     192+42     19     0+0    1      | 147   80    96    1     5     329   | 6       6         1     
-ptrdist-ks           0.0017 0.0028 0.0017 0.0017 0.0062   0.0089   |   48792    44664    31304    75968    381528   |    *     215+30     36     0+0    1      | 155   87    88    2     6     338   | *       *         n/a   
-ptrdist-anagram      0.0014 0.0017 0.0014 0.0012 0.0043   0.0079   |   43400    41992    14864    56856    409312   |    5     196+28     20     0+0    1      | 105   77    60    5     3     250   | 3       3         1     
-em3d.llvm            0.0013 0.0012 0.0013 0.0010 0.0035   0.0056   |   24256    43304    13024    56328    223952   |    1     178+28     21     0+0    1      | 114   41    71    *     12    238   | 3       8         2.66666
-health.llvm          0.0012 0.0010 0.0012 0.0013 0.0035   0.0070   |   32064    31992    12720    44712    202312   |    3     97+31      13     0+0    1      | 85    72    47    5     3     212   | *       *         n/a   
-lists.llvm           0.0010 0.0008 0.0010 0.0015 0.0033   0.0033   |   24968    22808    6640     29448    139832   |    *     67+26      28     0+0    1      | 40    31    53    *     3     127   | *       *         n/a   
-mst.llvm             0.0008 0.0008 0.0008 0.0007 0.0023   0.0044   |   18944    15584    16680    32264    183080   |    4     97+15      13     0+0    1      | 55    36    42    5     5     143   | 2       2         1     
-hash.llvm            0.0008 0.0006 0.0008 0.0008 0.0022   0.0035   |   17504    26464    8208     34672    150160   |    *     117+17     19     0+0    1      | 35    25    25    1     4     90    | *       *         n/a   
-tsp.llvm             0.0007 0.0009 0.0007 0.0005 0.0021   0.0042   |   18416    15024    5408     20432    183312   |    *     42+15      7      0+0    1      | 54    61    64    *     1     180   | *       *         n/a   
-power.llvm           0.0007 0.0008 0.0007 0.0007 0.0022   0.0050   |   19704    18880    18120    37000    212104   |    *     81+18      11     0+0    1      | 141   86    46    11    4     288   | *       *         n/a   
-perimeter.llvm       0.0007 0.0006 0.0007 0.0004 0.0017   0.0035   |   14944    13072    3936     17008    155240   |    *     35+15      7      0+0    1      | 30    25    49    *     1     105   | *       *         n/a   
-bisort.llvm          0.0005 0.0006 0.0005 0.0003 0.0014   0.0032   |   13480    11608    3704     15312    124416   |    *     35+13      7      0+0    1      | 37    24    40    *     1     102   | *       *         n/a   
-objinst.llvm         0.0004 0.0004 0.0004 0.0005 0.0013   0.0028   |   11360    11008    12288    23296    86552    |    7     53+14      19     0+0    1      | 18    11    19    *     2     50    | *       *         n/a   
-methcall.llvm        0.0004 0.0004 0.0004 0.0006 0.0014   0.0026   |   10280    9816     9128     18944    86632    |    17    45+12      15     0+0    1      | 18    11    16    *     2     47    | 1       3         3     
-treeadd.llvm         0.0003 0.0003 0.0003 0.0002 0.0008   0.0019   |   8712     7568     2216     9784     70776    |    *     25+7       7      0+0    1      | 15    6     18    *     1     40    | *       *         n/a   
-matrix.llvm          0.0003 0.0003 0.0003 0.0003 0.0009   0.0019   |   3840     15744    3064     18808    69184    |    *     38+9       12     0+0    1      | 21    4     11    *     2     38    | *       *         n/a   
-llubenchmark.llvm    0.0003 0.0005 0.0003 0.0003 0.0011   0.0028   |   11016    9448     2616     12064    123384   |    *     31+7       15     0+0    1      | 29    9     26    *     2     66    | *       *         n/a   
-ary3.llvm            0.0003 0.0003 0.0003 0.0002 0.0008   0.0018   |   8832     12584    3008     15592    71432    |    4     44+5       17     0+0    1      | 10    14    7     *     1     32    | *       *         n/a   
-sumarraymalloc.llvm  0.0002 0.0005 0.0002 0.0002 0.0009   0.0016   |   7032     2680     2064     4744     54544    |    *     23+5       7      0+0    1      | 8     2     8     *     1     19    | *       *         n/a   
-sieve.llvm           0.0002 0.0002 0.0002 0.0006 0.001    0.0032   |   5704     1944     1616     3560     216328   |    *     22+2       12     0+0    1      | 7     3     4     *     *     14    | *       *         n/a   
-random.llvm          0.0002 0.0002 0.0002 0.0001 0.0005   0.0014   |   2056     7176     1312     8488     46680    |    *     15+2       7      0+0    1      | 8     2     6     *     *     16    | *       *         n/a   
-heapsort.llvm        0.0002 0.0003 0.0002 0.0001 0.0006   0.0016   |   2856     6976     1992     8968     63368    |    *     26+3       7      0+0    1      | 14    7     6     *     1     28    | *       *         n/a   
-fib2.llvm            0.0002 0.0002 0.0002 0.0001 0.0005   0.0014   |   5744     6168     1632     7800     42448    |    *     21+5       8      0+0    1      | 6     1     7     *     *     14    | *       *         n/a   
-ackermann.llvm       0.0002 0.0002 0.0002 0.0001 0.0005   0.0013   |   1744     1536     1192     2728     47528    |    *     13+2       7      0+0    1      | 6     1     6     *     *     13    | *       *         n/a   
-sumarray.llvm        0.0001 0.0001 0.0001 0.0000 0.0002   0.0007   |   912      624      632      1256     15112    |    *     6+1        4      0+0    1      | 1     3     2     *     1     7     | *       *         n/a   
-sumarray2d.llvm      0.0001 0.0001 0.0001 0.0001 0.0003   0.0009   |   1576     3656     848      4504     22544    |    *     10+1       7      0+0    1      | 1     2     3     1     *     7     | *       *         n/a   
-printargs.llvm       0.0001 0.0001 0.0001 0.0001 0.0003   0.0007   |   3712     1048     704      1752     19104    |    *     6+1        4      0+0    1      | 4     *     5     *     *     9     | *       *         n/a   
-pi.llvm              0.0001 0.0002 0.0001 0.0001 0.0004   0.0011   |   2368     4720     4736     9456     35208    |    *     17+2       13     0+0    1      | 7     3     7     2     *     19    | *       *         n/a   
-matrixTranspose.llvm 0.0001 0.0002 0.0001 0.0001 0.0004   0.0013   |   1392     4128     736      4864     69720    |    *     8+1        5      0+0    1      | 6     5     4     *     *     15    | *       *         n/a   
-indvars.llvm         0.0001 0.0002 0.0001 0.0001 0.0004   0.0010   |   4752     1072     1024     2096     31536    |    *     13+1       8      0+0    1      | 2     6     3     1     *     12    | *       *         n/a   
-hello.llvm           0.0000 0.0001 0.0000 0.0000 0.0001   0.0006   |   752      472      472      944      14112    |    *     2+0        2      0+0    1      | 3     *     4     *     *     7     | *       *         n/a   
-</pre><p>
-
-<hr>
-<a name="20021113"><h2>Nov 13, 2002:</h2>
-
-New numbers, same as last time, just some extra columns on the end:<p>
-
-This data set also includes new data for the ptrdist benchmark.<p>
-
-<pre>
-Name:                Anlyz: LocTime: BUTime:  TDTime:  TimeSum: BCTime:      LocSize: BUSize:  TDSize:  BUTDSz:  BCSize:    NumFold  NumNodes   MaxSz  GlobGr MaxSCC | Loads Store Calls Allca Mallc Sum  
-254.gap                4.39 0.1773   0.6581   0.4703   1.3057   0.6054   |   2024952  2823064  2018920  4841984  16585864 |    2080  24032+3948 268    0+0    20     | 18420 3888  5805  87    3     28203 
-255.vortex             4.03 0.1154   0.3172   0.6416   1.0742   0.4523   |   1381344  1261232  1997512  3258744  11694840 |    1043  7331+2844  166    0+0    38     | 13901 6136  6829  1420  2     28288 
-300.twolf              0.80 0.0557   0.0593   0.1062   0.2212   0.2191   |   466544   391432   394760   786192   7054760  |    115   4127+784   215    0+0    1      | 11246 2911  1865  114   3     16139 
-197.parser             0.44 0.0302   0.0403   0.0442   0.1147   0.1204   |   280960   224800   212168   436968   4409632  |    338   2255+706   97     0+0    3      | 2611  908   1651  25    2     5197  
-burg.llvm              0.33 0.0208   0.0268   0.0356   0.0832   0.1293   |   536552   478856   185880   664736   2997272  |    205   2273+576   98     0+0    2      | 2265  363   1128  44    4     3804  
-164.gzip.llvm          0.20 0.0093   0.0062   0.0073   0.0228   0.0999   |   201568   129000   70880    199880   1873760  |    8     971+87     67     0+0    1      | 1014  622   351   19    3     2009  
-ptrdist-bc             0.12 0.0080   0.0111   0.0132   0.0323   0.0304   |   198640   269032   91232    360264   1332992  |    62    680+199    42     0+0    1      | 764   411   425   21    25    1646  
-256.bzip2              0.11 0.0057   0.0028   0.0024   0.0109   0.0462   |   138536   83624    39760    123384   1363416  |    *     563+37     59     0+0    1      | 698   307   287   18    10    1320  
-optimizer-eval.llvm    0.10 0.0033   0.0064   0.0304   0.0401   0.0133   |   100008   78968    61784    140752   626688   |    *     309+41     72     0+0    1      | 278   405   108   32    *     823   
-ptrdist-yacr2          0.09 0.0075   0.0097   0.0084   0.0256   0.0211   |   176112   193048   72296    265344   982896   |    *     1036+90    53     0+0    1      | 872   174   289   16    27    1378  
-181.mcf                0.09 0.0081   0.0051   0.0054   0.0186   0.0216   |   130816   121096   43648    164744   579064   |    44    388+51     83     0+0    1      | 362   225   81    8     2     678   
-sgefa.llvm             0.08 0.0019   0.0026   0.0029   0.0074   0.0081   |   85680    81992    67056    149048   372736   |    *     130+24     36     0+0    1      | 159   65    77    5     5     311   
-voronoi.llvm           0.06 0.0028   0.0037   0.0053   0.0118   0.0097   |   63768    82416    51856    134272   413304   |    11    299+77     58     0+0    1      | 399   171   121   44    4     739   
-sim.llvm               0.06 0.0032   0.0022   0.0025   0.0079   0.0162   |   54952    81152    21976    103128   737584   |    *     261+36     60     0+0    1      | 687   305   75    2     21    1090  
-bh.llvm                0.06 0.0025   0.0021   0.0023   0.0069   0.0116   |   75656    51520    27768    79288    470680   |    38    194+35     23     0+0    1      | 266   189   151   36    3     645   
-ptrdist-ft             0.05 0.0020   0.0019   0.0021   0.006    0.0113   |   46336    58552    15464    74016    502704   |    *     192+42     19     0+0    1      | 147   80    96    1     5     329   
-em3d.llvm              0.05 0.0012   0.0012   0.0011   0.0035   0.0056   |   24256    43304    13024    56328    223952   |    1     178+28     21     0+0    1      | 114   41    71    *     12    238   
-ptrdist-ks             0.04 0.0023   0.0016   0.0017   0.0056   0.0081   |   48792    44664    31304    75968    381528   |    *     215+30     36     0+0    1      | 155   87    88    2     6     338   
-ptrdist-anagram        0.04 0.0016   0.0014   0.0025   0.0055   0.0079   |   43400    41992    14864    56856    409312   |    5     196+28     20     0+0    1      | 105   77    60    5     3     250   
-mst.llvm               0.04 0.0008   0.0007   0.0007   0.0022   0.0044   |   18944    15584    16680    32264    183080   |    4     97+15      13     0+0    1      | 55    36    42    5     5     143   
-health.llvm            0.04 0.0010   0.0012   0.0017   0.0039   0.0070   |   32064    31992    12720    44712    202312   |    3     97+31      13     0+0    1      | 85    72    47    5     3     212   
-tsp.llvm               0.03 0.0009   0.0006   0.0005   0.002    0.0041   |   18416    14504    4872     19376    183312   |    9     42+15      7      0+0    1      | 54    61    64    *     1     180   
-treeadd.llvm           0.03 0.0003   0.0003   0.0002   0.0008   0.0019   |   8712     7568     2216     9784     70776    |    *     25+7       7      0+0    1      | 15    6     18    *     1     40    
-sieve.llvm             0.03 0.0002   0.0002   0.0001   0.0005   0.0032   |   5704     1944     1616     3560     216328   |    *     22+2       12     0+0    1      | 7     3     4     *     *     14    
-power.llvm             0.03 0.0008   0.0007   0.0007   0.0022   0.0049   |   19704    18880    18120    37000    212104   |    *     81+18      11     0+0    1      | 141   86    46    11    4     288   
-pi.llvm                0.03 0.0002   0.0001   0.0001   0.0004   0.0010   |   2368     4720     4736     9456     35208    |    *     17+2       13     0+0    1      | 7     3     7     2     *     19    
-perimeter.llvm         0.03 0.0006   0.0007   0.0004   0.0017   0.0035   |   14944    13072    3936     17008    155240   |    *     35+15      7      0+0    1      | 30    25    49    *     1     105   
-objinst.llvm           0.03 0.0005   0.0005   0.0006   0.0016   0.0025   |   11360    16328    4112     20440    86552    |    19    45+14      16     0+0    1      | 18    11    19    *     2     50    
-methcall.llvm          0.03 0.0004   0.0004   0.0006   0.0014   0.0026   |   10280    9752     9040     18792    86632    |    19    43+12      14     0+0    1      | 18    11    16    *     2     47    
-matrixTranspose.llvm   0.03 0.0002   0.0001   0.0002   0.0005   0.0013   |   1392     4128     736      4864     69720    |    *     8+1        5      0+0    1      | 6     5     4     *     *     15    
-matrix.llvm            0.03 0.0003   0.0003   0.0003   0.0009   0.0019   |   3840     15744    3064     18808    69184    |    *     38+9       12     0+0    1      | 21    4     11    *     2     38    
-llubenchmark.llvm      0.03 0.0005   0.0003   0.0003   0.0011   0.0028   |   11016    9448     2616     12064    123384   |    *     31+7       15     0+0    1      | 29    9     26    *     2     66    
-lists.llvm             0.03 0.0008   0.0010   0.0014   0.0032   0.0033   |   24968    22552    6128     28680    139832   |    15    67+26      28     0+0    1      | 40    31    53    *     3     127   
-hash.llvm              0.03 0.0006   0.0008   0.0008   0.0022   0.0035   |   17504    26464    8208     34672    150160   |    *     117+17     19     0+0    1      | 35    25    25    1     4     90    
-bisort.llvm            0.03 0.0006   0.0005   0.0003   0.0014   0.0029   |   13480    11608    3704     15312    124416   |    *     35+13      7      0+0    1      | 37    24    40    *     1     102   
-ary3.llvm              0.03 0.0003   0.0003   0.0002   0.0008   0.0018   |   8832     12584    3008     15592    71432    |    4     44+5       17     0+0    1      | 10    14    7     *     1     32    
-sumarraymalloc.llvm    0.02 0.0002   0.0002   0.0002   0.0006   0.0015   |   7032     2680     2064     4744     54544    |    *     23+5       7      0+0    1      | 8     2     8     *     1     19    
-sumarray.llvm          0.02 0.0001   0.0001   0.0000   0.0002   0.0007   |   912      624      632      1256     15112    |    *     6+1        4      0+0    1      | 1     3     2     *     1     7     
-sumarray2d.llvm        0.02 0.0001   0.0001   0.0001   0.0003   0.0009   |   1576     3656     848      4504     22544    |    *     10+1       7      0+0    1      | 1     2     3     1     *     7     
-random.llvm            0.02 0.0002   0.0002   0.0001   0.0005   0.0014   |   2056     7176     1312     8488     46680    |    *     15+2       7      0+0    1      | 8     2     6     *     *     16    
-printargs.llvm         0.02 0.0001   0.0001   0.0000   0.0002   0.0008   |   3712     1048     704      1752     19104    |    *     6+1        4      0+0    1      | 4     *     5     *     *     9     
-indvars.llvm           0.02 0.0002   0.0001   0.0001   0.0004   0.0010   |   4752     1072     1024     2096     31536    |    *     13+1       8      0+0    1      | 2     6     3     1     *     12    
-heapsort.llvm          0.02 0.0002   0.0002   0.0001   0.0005   0.0017   |   2856     6976     1992     8968     63368    |    *     26+3       7      0+0    1      | 14    7     6     *     1     28    
-fib2.llvm              0.02 0.0002   0.0002   0.0001   0.0005   0.0013   |   5744     6168     1632     7800     42448    |    *     21+5       8      0+0    1      | 6     1     7     *     *     14    
-ackermann.llvm         0.02 0.0002   0.0002   0.0001   0.0005   0.0017   |   1744     1536     1192     2728     47528    |    *     13+2       7      0+0    1      | 6     1     6     *     *     13    
-hello.llvm             0.01 0.0001   0.0001   0.0000   0.0002   0.0006   |   752      472      472      944      14112    |    *     2+0        2      0+0    1      | 3     *     4     *     *     7     
-</pre><p>
-
-<hr>
-<a name="20021112-2"><h2>Nov 12, 2002 #2:</h2>
-
-This build is the same as <a href="#20021112">before</a>, except now this is
-compiled in release mode (optimizations enabled, assertions off).<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime: BCTime:      LocSize: BUSize:  TDSize:  TotSize: BCSize:    NumFold  NumNodes   main   __main GlobGr
-254.gap.lib                 3.43 0.1783   0.6490   0.4676   1.7957   0.5938   |   2024904  2816256  2016824  6857984  16561248 |    5973  24033+3949 44+9   0+0    0+0    
-255.vortex.lib              3.01 0.1177   0.3156   0.6452   1.5678   0.4652   |   1381488  1260088  2000864  4642440  11691072 |    5851  7324+2837  166+11 0+0    0+0    
-300.twolf.lib               0.72 0.0547   0.0591   0.1054   0.3435   0.2076   |   466544   391448   394984   1252976  6950016  |    768   4127+784   90+53  0+0    0+0    
-197.parser.lib              0.38 0.0301   0.0400   0.0448   0.1712   0.1206   |   407728   224960   212368   964008   4442008  |    1332  2256+707   14+6   0+0    0+0    
-burg.llvm.lib               0.31 0.0207   0.0264   0.0359   0.1114   0.1493   |   535720   477752   185808   1265384  2998392  |    754   2273+576   45+7   0+0    0+0    
-164.gzip.llvm.lib           0.17 0.0089   0.0062   0.0070   0.0400   0.0977   |   201336   128072   135240   561056   1860784  |    24    971+87     8+2    0+0    0+0    
-optimizer-eval.llvm.lib     0.08 0.0033   0.0063   0.0311   0.0528   0.0131   |   101272   79216    61760    242248   624880   |    *     309+41     72+27  0+0    0+0    
-256.bzip2.lib               0.08 0.0056   0.0028   0.0024   0.0242   0.0342   |   139696   84264    39688    335984   1371144  |    *     563+37     8+2    0+0    0+0    
-181.mcf.lib                 0.07 0.0038   0.0049   0.0055   0.0345   0.0155   |   109872   142976   43664    313504   585632   |    167   388+51     22+10  0+0    0+0    
-sim.llvm.lib                0.05 0.0031   0.0023   0.0026   0.0187   0.0159   |   55880    51128    21864    225776   728104   |    *     260+35     39+22  0+0    0+0    
-voronoi.llvm.lib            0.04 0.0028   0.0037   0.0054   0.0165   0.0098   |   79696    83000    27112    203160   412912   |    18    299+77     15+8   0+0    0+0    
-hash.llvm.lib               0.04 0.0006   0.0008   0.0008   0.0045   0.0038   |   25568    23384    8184     70024    150480   |    *     117+17     14+6   0+0    0+0    
-bh.llvm.lib                 0.04 0.0025   0.0021   0.0019   0.0118   0.0114   |   75208    51032    27800    202752   482440   |    64    194+35     6+2    0+0    0+0    
-sgefa.llvm.lib              0.03 0.0019   0.0026   0.0028   0.0124   0.0085   |   85856    82224    67032    260752   375800   |    *     130+24     24+14  0+0    0+0    
-health.llvm.lib             0.03 0.0010   0.0012   0.0013   0.0077   0.0072   |   30416    30184    12704    80824    197952   |    18    97+31      12+4   0+0    0+0    
-tsp.llvm.lib                0.02 0.0009   0.0006   0.0005   0.0044   0.0044   |   18416    14448    4880     52472    183104   |    22    42+15      7+4    0+0    0+0    
-power.llvm.lib              0.02 0.0008   0.0007   0.0007   0.0049   0.0065   |   19592    27536    7848     63072    218032   |    *     81+18      11+2   0+0    0+0    
-perimeter.llvm.lib          0.02 0.0006   0.0006   0.0004   0.0039   0.0035   |   15200    14104    3944     46320    158680   |    *     35+15      7+4    0+0    0+0    
-objinst.llvm.lib            0.02 0.0004   0.0004   0.0006   0.0038   0.0026   |   11368    15280    4112     45376    90432    |    32    45+14      16+10  0+0    0+0    
-mst.llvm.lib                0.02 0.0008   0.0008   0.0007   0.0047   0.0046   |   18952    16568    7024     58032    183080   |    10    97+15      12+3   0+0    0+0    
-methcall.llvm.lib           0.02 0.0004   0.0004   0.0005   0.0035   0.0026   |   10944    11088    3928     39584    87008    |    30    43+12      14+8   0+0    0+0    
-llubenchmark.llvm.lib       0.02 0.0005   0.0003   0.0003   0.0037   0.0030   |   11008    9448     2600     33976    123336   |    *     31+7       15+5   0+0    0+0    
-lists.llvm.lib              0.02 0.0010   0.0010   0.0014   0.0054   0.0036   |   25352    15608    14344    67520    139752   |    29    67+26      3+1    0+0    0+0    
-em3d.llvm.lib               0.02 0.0011   0.0013   0.0011   0.0063   0.0055   |   24320    32736    12984    86912    224936   |    1     178+28     12+4   0+0    0+0    
-bisort.llvm.lib             0.02 0.0006   0.0005   0.0003   0.0033   0.0030   |   13520    11672    3704     45912    125120   |    *     35+13      7+4    0+0    0+0    
-treeadd.llvm.lib            0.01 0.0003   0.0003   0.0002   0.0023   0.0019   |   8064     7512     2200     29880    70776    |    *     25+7       6+3    0+0    0+0    
-sumarraymalloc.llvm.lib     0.01 0.0002   0.0002   0.0002   0.0020   0.0015   |   2712     7000     2048     25576    54608    |    *     23+5       7+4    0+0    0+0    
-sumarray.llvm.lib           0.01 0.0001   0.0001   0.0001   0.0011   0.0007   |   904      3192     624      4720     15112    |    *     6+1        4+1    0+0    0+0    
-sumarray2d.llvm.lib         0.01 0.0002   0.0001   0.0001   0.0013   0.0009   |   1568     3536     848      8176     22504    |    *     10+1       7+1    0+0    0+0    
-sieve.llvm.lib              0.01 0.0002   0.0002   0.0001   0.0020   0.0033   |   2152     6144     1616     23240    216328   |    *     22+2       12+1   0+0    0+0    
-random.llvm.lib             0.01 0.0002   0.0002   0.0001   0.0017   0.0014   |   7616     1632     1320     23104    46680    |    *     15+2       3+1    0+0    0+0    
-printargs.llvm.lib          0.01 0.0001   0.0001   0.0001   0.0011   0.0008   |   1248     1048     704      5144     19104    |    *     6+1        4+1    0+0    0+0    
-pi.llvm.lib                 0.01 0.0002   0.0001   0.0001   0.0016   0.0011   |   5392     3800     4728     13920    35880    |    *     17+2       13+2   0+0    0+0    
-matrixTranspose.llvm.lib    0.01 0.0002   0.0001   0.0001   0.0012   0.0013   |   5800     1144     736      7680     69712    |    *     8+1        5+1    0+0    0+0    
-matrix.llvm.lib             0.01 0.0003   0.0003   0.0003   0.0028   0.0018   |   10088    8616     10672    40912    68728    |    *     38+9       12+8   0+0    0+0    
-indvars.llvm.lib            0.01 0.0002   0.0001   0.0001   0.0014   0.0010   |   4760     1080     1016     9392     31536    |    *     13+1       8+1    0+0    0+0    
-hello.llvm.lib              0.01 0.0001   0.0001   0.0000   0.0009   0.0007   |   752      2952     472      6512     12216    |    *     2+0        0+0    0+0    0+0    
-heapsort.llvm.lib           0.01 0.0002   0.0002   0.0001   0.0021   0.0017   |   2856     6968     2008     26672    63368    |    *     26+3       7+2    0+0    0+0    
-fib2.llvm.lib               0.01 0.0002   0.0002   0.0001   0.0019   0.0013   |   5696     6136     1640     26200    41992    |    *     21+5       8+3    0+0    0+0    
-ary3.llvm.lib               0.01 0.0003   0.0004   0.0002   0.0026   0.0018   |   10264    21184    3008     45968    72576    |    6     44+5       12+3   0+0    0+0    
-ackermann.llvm.lib          0.01 0.0002   0.0002   0.0001   0.0016   0.0014   |   1752     5736     1200     24944    46728    |    *     13+2       3+1    0+0    0+0    
-</pre><p>
-
-
-<hr>
-<a name="20021112"><h2>Nov 12, 2002:</h2>
-
-<a
-href="http://mail.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20021111/001567.html">This
-small change</a> is important to programs with large SCC's.  It basically makes
-sure to inline calls to non-scc functions before we inline <b>any</b> intra-scc
-calls.  The problem is that inlining an SCC call could add <b>more</b> call
-sites that would slow things down.<p>
-
-Note that the total time underestimates the improvement.  Take a look at the
-change on BU time/total time to get an accurate accessment.  I had some of the
-graph IO printing code commented out in the last run, which affected Analyze
-time, but not total time.<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime: BCTime:      LocSize: BUSize:  TDSize:  TotSize: BCSize:    NumFold  NumNodes   main   __main GlobGr
-254.gap.lib                17.69 0.8298   4.1158   2.4087   8.9138   2.9912   |   2024984  <b>2840288</b>  <b>2024560</b>  <b>6889832</b>  16554904 |    <b>5985</b>  <b>24035+3950</b> 44+9   0+0    0+0    
-255.vortex.lib             14.99 0.5988   1.8871   3.6557   7.3284   2.4054   |   1381056  <b>1259144</b>  <b>1997120</b>  <b>4637320</b>  11689312 |    <b>5853</b>  <b>7328+2841</b>  166+11 0+0    0+0    
-300.twolf.lib               3.34 0.2774   0.2827   0.5115   1.5475   1.0153   |   466528   391512   396552   1254592  6936728  |    749   4128+784   90+53  0+0    0+0    
-197.parser.lib              1.85 0.1485   0.3190   0.2156   0.8689   0.6872   |   408392   <b>225184</b>   <b>212552</b>   <b>965384</b>   4447944  |    <b>1343</b>  2257+707   14+6   0+0    0+0    
-burg.llvm.lib               1.22 0.1027   0.1926   0.1739   0.5598   0.4947   |   530600   <b>474592</b>   185792   <b>1190984</b>  3040208  |    <b>758</b>   2273+576   45+7   0+0    0+0    
-164.gzip.llvm.lib           0.74 0.0398   0.0559   0.0350   0.1957   0.4561   |   145952   184776   70872    499912   1876248  |    24    971+87     8+2    0+0    0+0    
-optimizer-eval.llvm.lib     0.43 0.0183   0.0485   0.2054   0.3047   0.0839   |   101184   79456    61760    242400   624688   |    *     309+41     72+27  0+0    0+0    
-256.bzip2.lib               0.34 0.0241   0.0404   0.0113   0.1250   0.1624   |   139504   83400    39712    335144   1373216  |    *     563+37     8+2    0+0    0+0    
-181.mcf.lib                 0.23 0.0216   0.0279   0.0301   0.1126   0.0795   |   115448   146520   43680    322864   589440   |    166   388+51     22+10  0+0    0+0    
-sim.llvm.lib                0.20 0.0137   0.0138   0.0131   0.0800   0.0876   |   81632    51496    21872    226584   734152   |    *     260+35     39+22  0+0    0+0    
-voronoi.llvm.lib            0.17 0.0139   0.0246   0.0282   0.0811   0.0591   |   79824    84152    27112    204904   420568   |    18    299+77     15+8   0+0    0+0    
-sgefa.llvm.lib              0.16 0.0090   0.0195   0.0201   0.0848   0.0542   |   85688    100456   67024    277864   368680   |    *     130+24     24+14  0+0    0+0    
-bh.llvm.lib                 0.16 0.0121   0.0164   0.0115   0.0581   0.0682   |   75000    51080    27760    217632   470720   |    61    194+35     6+2    0+0    0+0    
-power.llvm.lib              <b>0.13</b> 0.0044   <b>0.0122</b>   0.0037   0.0282   0.0484   |   27776    17688    18144    71424    213760   |    *     81+18      11+2   0+0    0+0    
-em3d.llvm.lib               0.11 0.0060   0.0110   0.0059   0.0308   0.0561   |   33040    36256    13008    90632    227520   |    1     178+28     12+4   0+0    0+0    
-health.llvm.lib             0.10 0.0052   <b>0.0203</b>   0.0073   0.0406   0.0421   |   30632    31432    12704    89592    199888   |    18    97+31      12+4   0+0    0+0    
-tsp.llvm.lib                0.07 0.0051   0.0063   0.0027   0.0217   0.0332   |   18232    14336    4920     51888    180744   |    21    43+15      8+4    0+0    0+0    
-mst.llvm.lib                0.07 0.0040   0.0065   0.0037   0.0215   0.0296   |   18624    25576    7040     65808    178832   |    10    97+15      12+3   0+0    0+0    
-lists.llvm.lib              0.07 0.0043   0.0131   0.0071   0.0299   0.0269   |   24552    16920    14440    68024    141480   |    30    67+26      3+1    0+0    0+0    
-fib2.llvm.lib               <b>0.07</b> <b>0.0053</b>   <b>0.0217</b>   0.0008   <b>0.0313</b>   <b>0.0076</b>   |   7960     6288     1640     28408    42256    |    *     21+5       8+3    0+0    0+0    
-perimeter.llvm.lib          0.06 0.0031   0.0064   0.0021   0.0190   0.0275   |   15016    14192    3936     45912    156352   |    *     35+15      7+4    0+0    0+0    
-hash.llvm.lib               0.06 0.0031   0.0050   0.0052   0.0200   0.0211   |   25728    16608    8208     63576    151680   |    *     117+17     14+6   0+0    0+0    
-bisort.llvm.lib             0.06 0.0030   0.0055   0.0019   0.0318   <b>0.0126</b>   |   13288    11408    3712     39448    127360   |    *     35+13      7+4    0+0    0+0    
-sumarraymalloc.llvm.lib     0.04 0.0009   0.0014   0.0009   0.0075   <b>0.0240</b>   |   7040     2672     2048     25872    54352    |    *     23+5       7+4    0+0    0+0    
-objinst.llvm.lib            0.04 0.0019   0.0050   0.0032   0.0154   <b>0.0100</b>   |   11280    15784    4112     45296    89856    |    34    45+14      16+10  0+0    0+0    
-methcall.llvm.lib           0.04 0.0018   0.0047   0.0031   0.0145   <b>0.0122</b>   |   11008    9880     3928     38624    87976    |    30    43+12      14+8   0+0    0+0    
-matrix.llvm.lib             0.04 0.0013   0.0021   0.0014   0.0106   <b>0.0198</b>   |   8808     8872     3072     33144    69112    |    *     38+9       12+8   0+0    0+0    
-llubenchmark.llvm.lib       0.04 0.0024   0.0026   0.0015   0.0142   0.0118   |   11072    11760    2624     36480    124344   |    *     31+7       15+5   0+0    0+0    
-heapsort.llvm.lib           0.04 0.0009   0.0019   0.0007   0.0073   <b>0.0137</b>   |   2856     6968     2008     26976    63160    |    *     26+3       7+2    0+0    0+0    
-ary3.llvm.lib               0.04 0.0013   0.0020   0.0011   0.0090   <b>0.0134</b>   |   10240    13104    10888    45832    73064    |    6     44+5       12+3   0+0    0+0    
-ackermann.llvm.lib          0.04 0.0007   0.0015   0.0004   0.0066   0.0262   |   1744     5728     1200     22056    46448    |    *     13+2       3+1    0+0    0+0    
-treeadd.llvm.lib            0.03 0.0015   0.0028   0.0010   0.0090   0.0084   |   3856     7384     2200     29784    72064    |    *     25+7       6+3    0+0    0+0    
-sieve.llvm.lib              0.03 0.0008   0.0012   0.0006   0.0061   0.0162   |   2176     6176     1632     23432    216840   |    *     22+2       12+1   0+0    0+0    
-random.llvm.lib             <b>0.03</b> 0.0008   0.0017   0.0004   0.0059   <b>0.0133</b>   |   2056     5720     1320     22080    45264    |    *     15+2       3+1    0+0    0+0    
-matrixTranspose.llvm.lib    0.03 0.0005   0.0010   0.0003   0.0032   0.0129   |   4272     1144     736      8560     68448    |    *     8+1        5+1    0+0    0+0    
-hello.llvm.lib              0.03 0.0004   0.0015   0.0001   0.0066   0.0107   |   752      2952     472      6512     14160    |    *     2+0        0+0    0+0    0+0    
-sumarray2d.llvm.lib         <b>0.02</b> 0.0005   0.0009   0.0002   0.0034   <b>0.0055</b>   |   1568     3584     848      8264     23288    |    *     10+1       7+1    0+0    0+0    
-printargs.llvm.lib          <b>0.02</b> 0.0004   0.0013   0.0002   0.0032   0.0058   |   1240     1048     696      5128     19160    |    *     6+1        4+1    0+0    0+0    
-pi.llvm.lib                 0.02 0.0008   0.0021   0.0005   0.0052   0.0036   |   5392     1560     1392     8344     36032    |    *     17+2       13+2   0+0    0+0    
-indvars.llvm.lib            0.02 0.0006   0.0010   0.0003   0.0037   0.0036   |   4744     1072     4208     12544    31336    |    *     13+1       8+1    0+0    0+0    
-sumarray.llvm.lib           <b>0.01</b> 0.0004   0.0008   0.0002   0.0026   <b>0.0029</b>   |   904      3192     624      4720     15152    |    *     6+1        4+1    0+0    0+0    
-</pre><p>
-
-<hr>
-<a name="20021111-2"><h2>Nov 11, 2002 #2:</h2>
-
-This is the result after <a
-href="http://mail.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20021111/001565.html">fixing
-some major bugs</a>.  The globals list was supposed to be kept sorted, but there
-was one minor, tiny, little, bug that caused it to get screwed up sometimes.
-This caused vortex to explode, fixing it gets things back in control where you'd
-expect.  Viola.<p>
-
-This also includes a merging bug that caused some things to be merged and some
-other things to happen when they shouldn't, which accounts for folding
-reductions.<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime: BCTime:      LocSize: BUSize:  TDSize:  TotSize: BCSize:    NumFold  NumNodes   main   __main GlobGr
-254.gap.lib                17.65 0.8186   4.5919   2.3718   9.2483   2.8978   |   <b>2024984</b>  <b>2984936</b>  <b>2025480</b>  <b>7035400</b>  <b>16554904</b> |    <b>6853</b>  <b>24032+3950</b> 44+9   0+0    0+0    
-255.vortex.lib             15.02 0.5766   2.4586   <b>3.5717</b>   <b>7.6692</b>   2.2728   |   <b>1381056</b>  <b>1340216</b>  <b>2461232</b>  <b>5182504</b>  <b>11689312</b> |    <b>7127</b>  <b>7302+2815</b>  166+11 0+0    0+0    
-300.twolf.lib               3.23 0.2747   0.2856   0.5057   1.5129   0.9846   |   <b>466528</b>   <b>391512</b>   <b>396552</b>   <b>1254592</b>  <b>6936728</b>  |    <b>749</b>   <b>4128+784</b>   <b>90+53</b>  0+0    0+0    
-197.parser.lib              1.84 0.1528   0.3458   0.2180   0.8983   0.6469   |   <b>408392</b>   <b>225312</b>   <b>212688</b>   <b>965648</b>   <b>4447944</b>  |    <b>1357</b>  <b>2257+707</b>   14+6   0+0    0+0    
-burg.llvm.lib               1.20 0.1017   0.1867   0.1765   0.5525   0.4912   |   <b>530600</b>   <b>473296</b>   <b>185792</b>   <b>1189688</b>  <b>3040208</b>  |    <b>756</b>   <b>2273+576</b>   <b>45+7</b>   0+0    0+0    
-164.gzip.llvm.lib           0.71 0.0392   0.0649   0.0330   0.2008   0.4263   |   <b>145952</b>   <b>184776</b>   <b>70872</b>    <b>499912</b>   <b>1876248</b>  |    24    971+87     8+2    0+0    0+0    
-optimizer-eval.llvm.lib     0.42 0.0163   0.0446   0.2063   0.2953   <b>0.0798</b>   |   <b>101184</b>   <b>79456</b>    <b>61760</b>    <b>242400</b>   <b>624688</b>   |    *     309+41     72+27  0+0    0+0    
-256.bzip2.lib               0.34 0.0238   0.0491   0.0112   0.1311   0.1543   |   <b>139504</b>   <b>83400</b>    <b>39712</b>    <b>335144</b>   <b>1373216</b>  |    *     563+37     8+2    0+0    0+0    
-181.mcf.lib                 0.20 0.0174   0.0267   0.0272   0.0906   0.0744   |   <b>115448</b>   <b>146520</b>   <b>43680</b>    <b>322864</b>   <b>589440</b>   |    <b>166</b>   <b>388+51</b>     <b>22+10</b>  0+0    0+0    
-sim.llvm.lib                0.19 0.0135   0.0136   0.0130   0.0776   0.0794   |   <b>81632</b>    <b>51496</b>    <b>21872</b>    <b>226584</b>   <b>734152</b>   |    *     <b>260+35</b>     39+22  0+0    0+0    
-voronoi.llvm.lib            0.17 0.0137   0.0267   0.0286   0.0829   0.0561   |   <b>79824</b>    <b>84152</b>    <b>27112</b>    <b>204904</b>   <b>420568</b>   |    18    299+77     15+8   0+0    0+0    
-bh.llvm.lib                 0.16 0.0116   0.0161   0.0111   0.0591   0.0675   |   <b>75000</b>    <b>51080</b>    <b>27760</b>    <b>217632</b>   <b>470720</b>   |    61    194+35     6+2    0+0    0+0    
-sgefa.llvm.lib              0.14 0.0086   0.0201   0.0208   0.0656   0.0517   |   <b>85688</b>    <b>100456</b>   <b>67024</b>    <b>277864</b>   <b>368680</b>   |    *     130+24     24+14  0+0    0+0    
-sumarray2d.llvm.lib         <b>0.11</b> 0.0005   0.0009   0.0002   0.0033   <b>0.0922</b>   |   <b>1568</b>     <b>3584</b>     <b>848</b>      <b>8264</b>     <b>23288</b>    |    *     10+1       7+1    0+0    0+0    
-health.llvm.lib             0.09 0.0050   0.0082   0.0073   0.0280   0.0419   |   <b>30632</b>    <b>31432</b>    <b>12704</b>    <b>89592</b>    <b>199888</b>   |    <b>18</b>    <b>97+31</b>      <b>12+4</b>   0+0    0+0    
-em3d.llvm.lib               0.09 0.0058   0.0110   0.0059   0.0304   0.0395   |   <b>33040</b>    <b>36256</b>    <b>13008</b>    <b>90632</b>    <b>227520</b>   |    <b>1</b>     <b>178+28</b>     12+4   0+0    0+0    
-power.llvm.lib              0.08 0.0042   0.0067   0.0040   0.0222   0.0365   |   <b>27776</b>    <b>17688</b>    <b>18144</b>    <b>71424</b>    <b>213760</b>   |    *     81+18      11+2   0+0    0+0    
-mst.llvm.lib                0.08 0.0039   0.0072   0.0037   0.0218   0.0306   |   <b>18624</b>    <b>25576</b>    7040     <b>65808</b>    <b>178832</b>   |    10    97+15      12+3   0+0    0+0    
-lists.llvm.lib              0.08 0.0043   0.0137   0.0072   0.0306   0.0283   |   <b>24552</b>    <b>16920</b>    14440    <b>68024</b>    141480   |    30    67+26      3+1    0+0    0+0    
-tsp.llvm.lib                0.07 0.0048   0.0066   0.0027   0.0217   0.0327   |   <b>18232</b>    <b>14336</b>    <b>4920</b>     <b>51888</b>    <b>180744</b>   |    21    <b>43+15</b>      <b>8+4</b>    0+0    0+0    
-perimeter.llvm.lib          0.06 0.0031   0.0066   0.0024   0.0194   0.0260   |   <b>15016</b>    <b>14192</b>    <b>3936</b>     <b>45912</b>    <b>156352</b>   |    *     35+15      7+4    0+0    0+0    
-bisort.llvm.lib             0.06 0.0029   0.0056   0.0018   0.0230   0.0229   |   <b>13288</b>    <b>11408</b>    3712     <b>39448</b>    <b>127360</b>   |    *     35+13      7+4    0+0    0+0    
-objinst.llvm.lib            0.05 0.0019   0.0048   0.0031   0.0153   0.0174   |   <b>11280</b>    <b>15784</b>    <b>4112</b>     <b>45296</b>    <b>89856</b>    |    34    45+14      16+10  0+0    0+0    
-methcall.llvm.lib           0.05 0.0017   0.0043   0.0028   0.0135   0.0187   |   <b>11008</b>    <b>9880</b>     <b>3928</b>     <b>38624</b>    <b>87976</b>    |    30    43+12      14+8   0+0    0+0    
-heapsort.llvm.lib           0.05 0.0009   0.0020   0.0007   0.0074   <b>0.0306</b>   |   <b>2856</b>     <b>6968</b>     <b>2008</b>     <b>26976</b>    <b>63160</b>    |    *     26+3       7+2    0+0    0+0    
-hash.llvm.lib               0.05 0.0030   0.0052   0.0040   0.0184   0.0173   |   <b>25728</b>    <b>16608</b>    <b>8208</b>     <b>63576</b>    <b>151680</b>   |    *     117+17     14+6   0+0    0+0    
-sumarraymalloc.llvm.lib     0.04 0.0009   0.0015   0.0009   0.0067   0.0156   |   7040     2672     2048     25872    54352    |    *     23+5       7+4    0+0    0+0    
-random.llvm.lib             0.04 0.0009   0.0018   0.0004   0.0060   0.0223   |   2056     5720     1320     22080    45264    |    *     15+2       3+1    0+0    0+0    
-llubenchmark.llvm.lib       0.04 0.0022   0.0028   0.0015   0.0130   0.0118   |   <b>11072</b>    <b>11760</b>    <b>2624</b>     <b>36480</b>    <b>124344</b>   |    *     31+7       15+5   0+0    0+0    
-ackermann.llvm.lib          0.04 0.0007   0.0015   0.0004   0.0055   0.0230   |   1744     5728     1200     22056    46448    |    *     13+2       3+1    0+0    0+0    
-treeadd.llvm.lib            0.03 0.0015   0.0029   0.0009   0.0090   0.0076   |   3856     7384     2200     29784    72064    |    *     25+7       6+3    0+0    0+0    
-sieve.llvm.lib              0.03 0.0007   0.0013   0.0005   0.0060   0.0140   |   2176     6176     1632     23432    216840   |    *     22+2       12+1   0+0    0+0    
-printargs.llvm.lib          0.03 0.0005   0.0015   0.0002   0.0034   0.0077   |   1240     1048     696      5128     19160    |    *     6+1        4+1    0+0    0+0    
-matrixTranspose.llvm.lib    0.03 0.0005   0.0010   0.0003   0.0032   0.0167   |   <b>4272</b>     1144     736      <b>8560</b>     <b>68448</b>    |    *     8+1        5+1    0+0    0+0    
-matrix.llvm.lib             0.03 0.0013   0.0022   0.0014   0.0092   0.0100   |   <b>8808</b>     <b>8872</b>     <b>3072</b>     <b>33144</b>    <b>69112</b>    |    *     38+9       12+8   0+0    0+0    
-hello.llvm.lib              0.03 0.0004   0.0014   0.0001   0.0067   0.0123   |   752      2952     472      6512     <b>14160</b>    |    *     2+0        0+0    0+0    0+0    
-fib2.llvm.lib               0.03 0.0008   0.0015   0.0007   0.0061   <b>0.0135</b>   |   <b>7960</b>     <b>6288</b>     <b>1640</b>     <b>28408</b>    <b>42256</b>    |    *     21+5       8+3    0+0    0+0    
-ary3.llvm.lib               0.03 0.0012   0.0020   0.0011   0.0086   0.0084   |   <b>10240</b>    <b>13104</b>    <b>10888</b>    <b>45832</b>    73064    |    6     44+5       12+3   0+0    0+0    
-sumarray.llvm.lib           0.02 0.0003   0.0009   0.0002   0.0028   <b>0.0114</b>   |   904      3192     624      4720     15152    |    *     6+1        4+1    0+0    0+0    
-pi.llvm.lib                 0.02 0.0008   0.0020   0.0004   0.0050   0.0037   |   5392     1560     1392     8344     36032    |    *     17+2       13+2   0+0    0+0    
-indvars.llvm.lib            0.02 <b>0.0005</b>   0.0009   0.0003   0.0035   0.0035   |   <b>4744</b>     <b>1072</b>     <b>4208</b>     <b>12544</b>    31336    |    *     13+1       8+1    0+0    0+0    
-</pre><p>
-
-<hr>
-<a name="20021111"><h2>Nov 11, 2002:</h2>
-
-This is the first successful run of all of the benchmarks!  This is still
-compiled in debug mode, still has lots of tweaks and minor improvements that
-could be made, lots of optimizations even, but they will have to wait for a
-bit.<p>
-
-Also note that we now include time taken the parse the bytecode file into LLVM
-IR, and the space used by the LLVM IR.<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime: BCTime:      LocSize: BUSize:  TDSize:  TotSize: BCSize:    NumFold  NumNodes   main   __main GlobGr
-255.vortex.lib             <b>24.44</b> <b>0.5896</b>   <b>2.7741</b>   <b>11.5906</b>  <b>16.5760</b>  <b>2.3257</b>   |   <b>1381816</b>  <b>1338688</b>  <b>14822760</b> <b>17543264</b> <b>11691568</b> |    <b>7288</b>  <b>7321+3135</b>  <b>166+11</b> <b>0+0</b>    <b>0+0</b>    
-254.gap.lib                19.51 0.8708   4.6071   3.5835   10.6354  2.9075   |   2024600  <b>3155592</b>  <b>2323136</b>  <b>7503328</b>  16555920 |    <b>6934</b>  <b>24027+3950</b> <b>44+9</b>   0+0    0+0    
-300.twolf.lib               3.38 0.2753   0.2930   0.5233   1.5807   0.9966   |   466248   <b>392352</b>   <b>398296</b>   <b>1256896</b>  6936800  |    <b>765</b>   <b>4129+784</b>   <b>91+53</b>  0+0    0+0    
-197.parser.lib              1.89 0.1478   0.3243   0.2178   0.8755   0.6667   |   408560   <b>224928</b>   <b>213736</b>   <b>966696</b>   4451256  |    <b>1350</b>  <b>2259+711</b>   <b>14+6</b>   0+0    0+0    
-burg.llvm.lib               1.23 0.1039   0.1877   0.1779   0.5589   0.4972   |   530224   <b>471200</b>   <b>183504</b>   <b>1184928</b>  3039960  |    <b>790</b>   <b>2239+575</b>   <b>42+7</b>   0+0    0+0    
-164.gzip.llvm.lib           0.71 0.0408   0.0578   0.0332   0.1965   0.4323   |   201664   <b>128768</b>   <b>70864</b>    <b>498912</b>   1870880  |    24    <b>971+87</b>     <b>8+2</b>    0+0    0+0    
-optimizer-eval.llvm.lib     0.51 0.0166   0.0480   0.2086   0.3041   <b>0.1716</b>   |   81584    <b>78352</b>    <b>60304</b>    <b>238616</b>   620296   |    *     <b>309+41</b>     <b>72+27</b>  0+0    0+0    
-256.bzip2.lib               0.33 0.0240   0.0383   0.0114   0.1214   0.1565   |   139536   <b>84224</b>    <b>39704</b>    <b>335680</b>   1370784  |    *     <b>563+37</b>     <b>8+2</b>    0+0    0+0    
-181.mcf.lib                 0.22 0.0184   0.0286   0.0287   0.0959   0.0874   |   111384   <b>145792</b>   <b>43360</b>    <b>317776</b>   589808   |    <b>156</b>   <b>393+51</b>     <b>23+10</b>  0+0    0+0    
-sim.llvm.lib                0.20 0.0136   0.0137   0.0130   0.0792   0.0848   |   55376    <b>81000</b>    <b>21960</b>    <b>253344</b>   721520   |    *     <b>261+36</b>     <b>39+22</b>  0+0    0+0    
-voronoi.llvm.lib            0.17 0.0135   0.0262   0.0289   0.0833   0.0553   |   79696    <b>87968</b>    <b>27128</b>    <b>208568</b>   419920   |    18    <b>299+77</b>     <b>15+8</b>   0+0    0+0    
-bh.llvm.lib                 0.16 0.0116   0.0164   0.0118   0.0590   0.0665   |   55864    71416    27432    219376   473840   |    61    194+35     6+2    0+0    0+0    
-sgefa.llvm.lib              0.15 0.0089   0.0222   0.0246   0.0720   0.0530   |   85904    82240    67064    260872   364520   |    *     130+24     24+14  0+0    0+0    
-health.llvm.lib             0.10 0.0050   0.0096   0.0055   0.0275   0.0450   |   29880    27920    7608     73008    199064   |    71    79+29      10+4   0+0    0+0    
-tsp.llvm.lib                0.08 0.0049   0.0072   0.0027   0.0224   0.0350   |   25704    14472    4872     52216    176600   |    21    42+15      7+4    0+0    0+0    
-power.llvm.lib              0.08 0.0041   0.0067   0.0037   0.0222   0.0361   |   28512    17760    7848     61960    214128   |    *     81+18      11+2   0+0    0+0    
-em3d.llvm.lib               0.08 0.0060   0.0113   0.0055   0.0312   0.0315   |   24280    32960    12536    86576    224616   |    13    172+25     12+4   0+0    0+0    
-perimeter.llvm.lib          0.07 0.0031   0.0069   0.0020   0.0196   0.0261   |   14936    14112    3928     45592    155208   |    *     35+15      7+4    0+0    0+0    
-mst.llvm.lib                0.07 0.0039   0.0067   0.0037   0.0216   0.0285   |   27408    16752    7040     66048    178328   |    10    97+15      12+3   0+0    0+0    
-lists.llvm.lib              0.07 0.0043   0.0128   0.0072   0.0299   0.0276   |   24544    16912    14440    68008    141480   |    30    67+26      3+1    0+0    0+0    
-hash.llvm.lib               0.06 0.0030   0.0051   0.0054   0.0202   0.0186   |   17936    24808    8216     64232    153552   |    *     117+17     14+6   0+0    0+0    
-methcall.llvm.lib           0.05 0.0017   0.0047   0.0029   0.0142   0.0174   |   10984    9856     9144     44000    87328    |    30    43+12      14+8   0+0    0+0    
-objinst.llvm.lib            0.04 0.0019   0.0042   0.0033   0.0147   0.0114   |   11072    15328    10536    50496    87064    |    34    45+14      16+10  0+0    0+0    
-matrix.llvm.lib             0.04 0.0012   0.0021   0.0016   0.0094   <b>0.0164</b>   |   8720     8784     3048     36600    68048    |    *     38+9       12+8   0+0    0+0    
-llubenchmark.llvm.lib       0.04 0.0021   0.0027   0.0014   0.0130   0.0117   |   4728     <b>9368</b>     <b>2608</b>     <b>33440</b>    122712   |    *     31+7       15+5   0+0    0+0    
-bisort.llvm.lib             0.04 0.0029   0.0056   0.0019   0.0160   0.0125   |   13608    11744    3712     45984    126584   |    *     35+13      7+4    0+0    0+0    
-ary3.llvm.lib               0.04 0.0012   0.0020   0.0011   0.0088   0.0138   |   8648     19856    2976     43080    73064    |    6     44+5       12+3   0+0    0+0    
-ackermann.llvm.lib          0.04 0.0007   0.0017   0.0004   0.0058   <b>0.0226</b>   |   1744     5728     1200     22056    46448    |    *     13+2       3+1    0+0    0+0    
-treeadd.llvm.lib            0.03 0.0014   0.0029   0.0009   0.0090   0.0077   |   3856     7384     2200     29784    72064    |    *     25+7       6+3    0+0    0+0    
-sumarraymalloc.llvm.lib     0.03 0.0009   <b>0.0017</b>   0.0009   0.0069   0.0100   |   7040     2672     2048     25872    54352    |    *     23+5       7+4    0+0    0+0    
-sieve.llvm.lib              0.03 0.0007   0.0012   0.0005   0.0060   0.0138   |   2176     6176     1632     23432    216840   |    *     22+2       12+1   0+0    0+0    
-random.llvm.lib             0.03 0.0008   0.0018   0.0004   0.0060   <b>0.0137</b>   |   2056     5720     1320     22080    45264    |    *     15+2       3+1    0+0    0+0    
-matrixTranspose.llvm.lib    0.03 0.0005   0.0010   0.0003   0.0033   <b>0.0151</b>   |   4248     1144     736      8520     68104    |    *     8+1        5+1    0+0    0+0    
-hello.llvm.lib              <b>0.03</b> 0.0004   0.0018   0.0001   <b>0.0064</b>   <b>0.0105</b>   |   752      2952     472      6512     12264    |    *     2+0        0+0    0+0    0+0    
-heapsort.llvm.lib           0.03 0.0009   0.0020   0.0007   0.0074   0.0080   |   7448     7224     1992     28032    62704    |    *     26+3       7+2    0+0    0+0    
-sumarray2d.llvm.lib         0.02 0.0005   0.0009   0.0002   0.0033   0.0030   |   4208     856      3656     10904    21968    |    *     10+1       7+1    0+0    0+0    
-printargs.llvm.lib          0.02 0.0004   0.0014   0.0002   0.0033   <b>0.0061</b>   |   1240     1048     696      5128     19160    |    *     6+1        4+1    0+0    0+0    
-pi.llvm.lib                 0.02 0.0007   0.0019   0.0004   0.0050   0.0037   |   5392     1560     1392     8344     36032    |    *     17+2       13+2   0+0    0+0    
-indvars.llvm.lib            0.02 <b>0.0011</b>   0.0010   0.0003   0.0043   0.0035   |   1744     4088     1024     9696     31336    |    *     13+1       8+1    0+0    0+0    
-fib2.llvm.lib               0.02 0.0008   0.0015   0.0007   0.0061   0.0050   |   2416     10376    1648     30088    43792    |    *     21+5       8+3    0+0    0+0    
-sumarray.llvm.lib           0.01 <b>0.0003</b>   0.0009   0.0002   0.0027   0.0022   |   904      3192     624      4720     15152    |    *     6+1        4+1    0+0    0+0    
-</pre><p>
-
-
-
-<hr>
-<a name="20021110"><h2>Nov 10, 2002:</h2>
-
-This data set has the prototype Tarjan SCC code in to help with cases that were
-causing exponential behavior.  This gets Gap working, but Vortex is still either
-infinite looping or really slow.  I'm almost certain there are a couple of bugs
-still remaining in the implementation, so these should be regarded as
-preliminary numbers.<p>
-
-Here is some trivia for you: Vortex contains a SCC with 38 nodes, and another
-with 19.  Gap contains SCCs of size 2, 2, 20, 6, 2.<p>
-
-Also note that the bytecode file for GAP is 3x the size of the bytecode file for
-twolf.<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime: BCTime:      LocSize: BUSize:  TDSize:  TotSize: BCSize:    NumFold  NumNodes   main   __main GlobGr
-255.vortex.lib              <b>7.56</b> *        *        *        *        *        |   *        *        *        *        *        |    *     *          *      *      *      
-254.gap.lib                <b>22.53</b> <b>0.8908</b>   <b>7.0430</b>   <b>3.2424</b>   <b>12.8506</b>  <b>3.1879</b>   |   <b>2024600</b>  <b>5229888</b>  <b>3882656</b>  <b>11137144</b> <b>16555920</b> |    <b>6959</b>  <b>42275+3949</b> <b>59+9</b>   <b>0+0</b>    <b>0+0</b>    
-300.twolf.lib               3.92 0.3259   0.3470   0.8163   2.0253   1.0287   |   <b>466248</b>   <b>405936</b>   <b>456456</b>   <b>1328640</b>  <b>6936800</b>  |    <b>821</b>   <b>4119+784</b>   <b>90+53</b>  0+0    0+0    
-197.parser.lib              2.23 0.1939   <b>0.4020</b>   0.2499   1.0864   0.7768   |   408560   <b>229568</b>   <b>220672</b>   <b>978272</b>   4451256  |    <b>1362</b>  <b>2272+704</b>   <b>16+6</b>   0+0    0+0    
-burg.llvm.lib               1.28 0.1085   0.1942   0.1954   0.5911   0.5072   |   530224   <b>477440</b>   <b>290376</b>   <b>1298040</b>  3039960  |    <b>796</b>   <b>2248+575</b>   <b>39+7</b>   0+0    0+0    
-164.gzip.llvm.lib           0.67 0.0392   0.0506   0.0326   0.1873   0.4044   |   201664   <b>130312</b>   <b>72000</b>    <b>501592</b>   1870880  |    24    <b>988+87</b>     <b>12+2</b>   0+0    0+0    
-optimizer-eval.llvm.lib     0.43 0.0172   0.0570   0.2122   0.3200   0.0725   |   81584    <b>78640</b>    <b>60384</b>    <b>238984</b>   620296   |    *     <b>299+41</b>     <b>62+27</b>  0+0    0+0    
-256.bzip2.lib               0.34 0.0250   <b>0.0374</b>   0.0117   0.1242   0.1508   |   139536   <b>84856</b>    <b>40208</b>    <b>336816</b>   1370784  |    *     <b>569+37</b>     <b>12+2</b>   0+0    0+0    
-181.mcf.lib                 0.23 0.0304   0.0296   0.0438   0.1255   0.0685   |   111384   <b>145928</b>   <b>38568</b>    <b>313120</b>   589808   |    <b>161</b>   <b>384+51</b>     <b>27+10</b>  0+0    0+0    
-sim.llvm.lib                0.22 0.0138   0.0162   0.0146   0.0850   0.0891   |   55376    <b>81680</b>    <b>21784</b>    <b>253848</b>   721520   |    *     <b>259+36</b>     <b>37+22</b>  0+0    0+0    
-voronoi.llvm.lib            0.20 0.0140   0.0311   0.0293   0.0962   0.0547   |   79696    <b>85176</b>    <b>27272</b>    <b>205920</b>   419920   |    18    <b>294+76</b>     <b>17+8</b>   0+0    0+0    
-sgefa.llvm.lib              0.17 0.0088   0.0250   0.0223   0.0730   0.0615   |   85904    <b>82240</b>    <b>67064</b>    <b>260872</b>   364520   |    *     130+24     24+14  0+0    0+0    
-bh.llvm.lib                 0.15 0.0120   0.0173   0.0126   0.0614   0.0548   |   55864    <b>71416</b>    <b>27432</b>    <b>219376</b>   473840   |    61    194+35     6+2    0+0    0+0    
-em3d.llvm.lib               0.09 0.0066   0.0111   0.0088   0.0350   0.0284   |   24280    <b>32960</b>    <b>12536</b>    <b>86576</b>    224616   |    <b>13</b>    <b>172+25</b>     12+4   0+0    0+0    
-health.llvm.lib             0.08 0.0052   0.0098   0.0062   0.0287   0.0330   |   29880    <b>27920</b>    <b>7608</b>     <b>73008</b>    199064   |    71    79+29      10+4   0+0    0+0    
-mst.llvm.lib                0.07 0.0048   <b>0.0068</b>   0.0056   0.0266   0.0218   |   27408    <b>16752</b>    <b>7040</b>     <b>66048</b>    178328   |    10    97+15      12+3   0+0    0+0    
-tsp.llvm.lib                0.06 0.0049   <b>0.0069</b>   0.0026   0.0222   0.0212   |   25704    <b>14472</b>    <b>4872</b>     <b>52216</b>    176600   |    21    42+15      7+4    0+0    0+0    
-power.llvm.lib              0.06 0.0042   <b>0.0065</b>   0.0036   0.0217   0.0214   |   28512    <b>17760</b>    <b>7848</b>     <b>61960</b>    214128   |    *     81+18      11+2   0+0    0+0    
-lists.llvm.lib              0.06 0.0042   0.0113   0.0071   0.0293   0.0146   |   24544    <b>16912</b>    <b>14440</b>    <b>68008</b>    141480   |    30    67+26      3+1    0+0    0+0    
-perimeter.llvm.lib          0.05 0.0030   0.0058   0.0020   0.0186   0.0161   |   14936    <b>14112</b>    <b>3928</b>     <b>45592</b>    155208   |    *     35+15      7+4    0+0    0+0    
-methcall.llvm.lib           0.05 0.0017   <b>0.0042</b>   0.0028   0.0137   0.0099   |   10984    <b>9856</b>     <b>9144</b>     <b>44000</b>    87328    |    30    43+12      14+8   0+0    0+0    
-hash.llvm.lib               0.05 0.0031   0.0050   0.0039   0.0187   0.0163   |   17936    <b>24808</b>    <b>8216</b>     <b>64232</b>    153552   |    *     117+17     14+6   0+0    0+0    
-bisort.llvm.lib             0.05 0.0048   <b>0.0053</b>   0.0018   0.0188   0.0125   |   13608    <b>11744</b>    <b>3712</b>     <b>45984</b>    126584   |    *     35+13      7+4    0+0    0+0    
-objinst.llvm.lib            0.04 0.0018   <b>0.0044</b>   0.0032   0.0163   0.0103   |   11072    <b>15328</b>    <b>10536</b>    <b>50496</b>    87064    |    <b>34</b>    45+14      16+10  0+0    0+0    
-llubenchmark.llvm.lib       0.04 0.0021   <b>0.0022</b>   0.0014   0.0125   0.0124   |   4728     <b>9520</b>     <b>2624</b>     <b>33608</b>    122712   |    *     31+7       15+5   0+0    0+0    
-treeadd.llvm.lib            0.03 0.0015   <b>0.0024</b>   0.0009   0.0085   0.0077   |   3856     <b>7384</b>     <b>2200</b>     <b>29784</b>    72064    |    *     25+7       6+3    0+0    0+0    
-sumarraymalloc.llvm.lib     0.03 0.0009   <b>0.0035</b>   0.0009   0.0088   0.0058   |   7040     <b>2672</b>     <b>2048</b>     <b>25872</b>    54352    |    *     23+5       7+4    0+0    0+0    
-sieve.llvm.lib              0.03 0.0007   <b>0.0011</b>   0.0005   0.0060   0.0144   |   2176     <b>6176</b>     <b>1632</b>     <b>23432</b>    216840   |    *     22+2       12+1   0+0    0+0    
-random.llvm.lib             0.03 0.0008   <b>0.0016</b>   0.0004   0.0063   0.0050   |   2056     <b>5720</b>     <b>1320</b>     <b>22080</b>    45264    |    *     15+2       3+1    0+0    0+0    
-matrix.llvm.lib             0.03 0.0012   0.0021   0.0014   0.0093   0.0081   |   8720     <b>8784</b>     <b>3048</b>     <b>36600</b>    68048    |    *     38+9       12+8   0+0    0+0    
-heapsort.llvm.lib           0.03 0.0010   <b>0.0018</b>   0.0006   0.0084   0.0064   |   7448     <b>7224</b>     <b>1992</b>     <b>28032</b>    62704    |    *     26+3       7+2    0+0    0+0    
-fib2.llvm.lib               0.03 0.0008   <b>0.0016</b>   0.0007   0.0063   0.0048   |   2416     <b>10376</b>    <b>1648</b>     <b>30088</b>    43792    |    *     21+5       8+3    0+0    0+0    
-ary3.llvm.lib               0.03 0.0012   0.0019   0.0011   0.0086   0.0073   |   8648     <b>19856</b>    <b>2976</b>     <b>43080</b>    73064    |    6     44+5       12+3   0+0    0+0    
-sumarray2d.llvm.lib         0.02 0.0004   <b>0.0008</b>   0.0003   0.0031   0.0029   |   4208     856      3656     10904    21968    |    *     10+1       7+1    0+0    0+0    
-printargs.llvm.lib          0.02 0.0005   <b>0.0012</b>   0.0002   0.0031   0.0024   |   1240     <b>1048</b>     <b>696</b>      <b>5128</b>     19160    |    *     6+1        4+1    0+0    0+0    
-pi.llvm.lib                 0.02 0.0007   <b>0.0015</b>   0.0004   0.0050   0.0035   |   5392     <b>1560</b>     <b>1392</b>     <b>8344</b>     36032    |    *     17+2       13+2   0+0    0+0    
-matrixTranspose.llvm.lib    0.02 0.0006   <b>0.0011</b>   0.0003   0.0036   0.0051   |   4248     <b>1144</b>     <b>736</b>      8520     68104    |    *     8+1        5+1    0+0    0+0    
-indvars.llvm.lib            0.02 0.0005   <b>0.0009</b>   0.0003   0.0035   0.0037   |   1744     4088     <b>1024</b>     <b>9696</b>     31336    |    *     13+1       8+1    0+0    0+0    
-ackermann.llvm.lib          0.02 0.0008   <b>0.0014</b>   0.0004   0.0056   0.0060   |   1744     <b>5728</b>     <b>1200</b>     <b>22056</b>    46448    |    *     13+2       3+1    0+0    0+0    
-sumarray.llvm.lib           0.01 <b>0.0014</b>   <b>0.0008</b>   0.0002   0.0036   0.0021   |   904      <b>3192</b>     624      <b>4720</b>     15152    |    *     6+1        4+1    0+0    0+0    
-hello.llvm.lib              0.01 0.0004   <b>0.0015</b>   0.0001   0.0028   0.0019   |   752      2952     472      6512     12264    |    *     2+0        0+0    0+0    0+0    
-</pre><p>
-
-
-<hr>
-<a name="20021109-2"><h2>Nov 9, 2002 #2:</h2>
-
-This has the first part of the globals graph implemented, this simply deletes
-the nodes that should be moved to the globals graph, without saving them and
-then later merging them back in (The GlobGr size indicates the size of the
-globals graph: right now it is empty, this will be fixed in the future).  From
-this we can get some <b>best case</b> times that the final algorithm will not be
-able to match, but it is interesting to see badly how the N<sup>2</sup> case
-hurts the TD pass.<p>
-
-Note that I now know that gap and vortex are not working because of an infinite
-loop in the algorithm, now that this is identified, hopefully it will be fixed
-shortly.<p>
-
-Note that these numbers are still with a debug build.  Compiling with
-optimizations and without assertions improves run time 3-4x.<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime:      LocSize: BUSize:  TDSize:    TotSize:     NumFold  NumNodes   main   __main GlobGr
-254.gap.lib                 4.92 *        *        *        *        |    *        *        *          *          |    *     *          *      *      *      
-255.vortex.lib              2.78 *        *        *        *        |    *        *        *          *          |    *     *          *      *      *      
-300.twolf.lib               <b>3.50</b> 0.2890   <b>0.3094</b>   <b>0.5272</b>   <b>1.6337</b>   |    <b>487976</b>   <b>434248</b>   <b>418472</b>     <b>1340696</b>    |    <b>794</b>   <b>4223+808</b>   <b>88+45</b>  <b>0+0</b>    0+0    
-197.parser.lib              <b>1.70</b> 0.1517   <b>0.1978</b>   <b>0.2152</b>   <b>0.7588</b>   |    <b>408560</b>   <b>243688</b>   <b>213776</b>     <b>985496</b>     |    <b>1327</b>  <b>2257+706</b>   <b>14+6</b>   <b>0+0</b>    0+0    
-burg.llvm.lib               <b>1.14</b> 0.1056   <b>0.1296</b>   <b>0.1720</b>   <b>0.5084</b>   |    <b>530224</b>   <b>478880</b>   <b>179080</b>     <b>1188184</b>    |    <b>722</b>   <b>2167+577</b>   <b>30+7</b>   <b>0+0</b>    0+0    
-164.gzip.llvm.lib           0.65 0.0406   <b>0.0256</b>   <b>0.0328</b>   <b>0.1651</b>   |    <b>201664</b>   <b>129304</b>   <b>70864</b>      <b>499448</b>     |    <b>24</b>    <b>971+87</b>     <b>8+2</b>    <b>0+0</b>    0+0    
-optimizer-eval.llvm.lib     0.40 0.0170   <b>0.0366</b>   0.2099   0.3047   |    <b>81584</b>    <b>79352</b>    <b>62232</b>      <b>241544</b>     |    *     <b>309+41</b>     <b>72+27</b>  <b>0+0</b>    0+0    
-256.bzip2.lib               <b>0.29</b> 0.0249   <b>0.0107</b>   <b>0.0112</b>   <b>0.0943</b>   |    <b>139536</b>   <b>84752</b>    <b>39720</b>      <b>336224</b>     |    <b>*</b>     <b>563+37</b>     <b>8+2</b>    <b>0+0</b>    0+0    
-181.mcf.lib                 0.20 0.0185   0.0247   <b>0.0285</b>   0.1042   |    <b>111384</b>   <b>145912</b>   <b>43544</b>      <b>318080</b>     |    <b>156</b>   <b>393+51</b>     <b>23+10</b>  <b>0+0</b>    0+0    
-sim.llvm.lib                0.18 0.0143   0.0106   <b>0.0129</b>   0.0765   |    <b>55376</b>    <b>83072</b>    <b>21968</b>      <b>255424</b>     |    *     <b>261+36</b>     <b>39+22</b>  <b>0+0</b>    0+0    
-voronoi.llvm.lib            0.15 0.0152   0.0203   0.0309   0.0807   |    <b>79696</b>    <b>87280</b>    <b>27336</b>      <b>208088</b>     |    <b>18</b>    <b>299+77</b>     <b>15+8</b>   <b>0+0</b>    0+0    
-bh.llvm.lib                 0.13 0.0120   0.0100   <b>0.0110</b>   0.0506   |    <b>55864</b>    <b>72480</b>    <b>27632</b>      <b>220640</b>     |    <b>61</b>    <b>194+35</b>     <b>6+2</b>    <b>0+0</b>    0+0    
-sgefa.llvm.lib              0.12 0.0088   <b>0.0165</b>   <b>0.0199</b>   0.0616   |    <b>85904</b>    <b>82032</b>    <b>67032</b>      <b>260632</b>     |    *     <b>130+24</b>     <b>24+14</b>  <b>0+0</b>    0+0    
-health.llvm.lib             0.07 0.0051   0.0065   0.0054   0.0243   |    <b>29880</b>    <b>31328</b>    <b>7816</b>       <b>76624</b>      |    71    <b>79+29</b>      <b>10+4</b>   <b>0+0</b>    0+0    
-em3d.llvm.lib               0.07 0.0059   0.0058   <b>0.0058</b>   0.0254   |    <b>24280</b>    <b>33360</b>    <b>13344</b>      <b>87784</b>      |    <b>10</b>    <b>179+27</b>     <b>12+4</b>   <b>0+0</b>    0+0    
-power.llvm.lib              0.06 0.0043   0.0029   0.0051   0.0197   |    <b>28512</b>    <b>17808</b>    <b>8008</b>       <b>62168</b>      |    *     <b>81+18</b>      <b>11+2</b>   <b>0+0</b>    0+0    
-tsp.llvm.lib                0.05 0.0051   0.0031   <b>0.0027</b>   0.0185   |    <b>25704</b>    <b>14576</b>    <b>5040</b>       <b>52488</b>      |    <b>21</b>    <b>42+15</b>      <b>7+4</b>    <b>0+0</b>    0+0    
-perimeter.llvm.lib          0.05 0.0030   0.0036   0.0020   0.0163   |    <b>14936</b>    <b>22008</b>    <b>4296</b>       <b>53856</b>      |    *     <b>35+15</b>      <b>7+4</b>    <b>0+0</b>    0+0    
-mst.llvm.lib                0.05 0.0051   0.0033   <b>0.0038</b>   0.0193   |    <b>27408</b>    <b>16880</b>    <b>7216</b>       <b>66352</b>      |    10    <b>97+15</b>      <b>12+3</b>   <b>0+0</b>    0+0    
-lists.llvm.lib              0.05 0.0042   0.0058   0.0071   0.0227   |    <b>24544</b>    <b>17384</b>    <b>13696</b>      <b>67736</b>      |    <b>30</b>    <b>67+26</b>      <b>3+1</b>    <b>0+0</b>    0+0    
-hash.llvm.lib               0.05 0.0030   0.0033   0.0041   0.0168   |    <b>17936</b>    <b>25000</b>    <b>8544</b>       <b>64752</b>      |    *     <b>117+17</b>     <b>14+6</b>   <b>0+0</b>    0+0    
-objinst.llvm.lib            0.04 0.0018   0.0018   0.0033   0.0122   |    <b>11072</b>    <b>16344</b>    <b>12040</b>      <b>53016</b>      |    <b>35</b>    <b>45+14</b>      <b>16+10</b>  <b>0+0</b>    0+0    
-methcall.llvm.lib           0.04 0.0017   0.0015   0.0029   0.0111   |    <b>10984</b>    <b>9816</b>     <b>11880</b>      <b>46696</b>      |    <b>30</b>    <b>43+12</b>      <b>14+8</b>   <b>0+0</b>    0+0    
-llubenchmark.llvm.lib       0.04 0.0021   <b>0.0010</b>   <b>0.0015</b>   0.0115   |    <b>4728</b>     <b>9384</b>     <b>2808</b>       <b>33656</b>      |    *     <b>31+7</b>       <b>15+5</b>   <b>0+0</b>    0+0    
-bisort.llvm.lib             0.04 0.0029   0.0022   <b>0.0019</b>   0.0128   |    <b>13608</b>    <b>11840</b>    <b>3888</b>       <b>46256</b>      |    *     <b>35+13</b>      <b>7+4</b>    <b>0+0</b>    0+0    
-treeadd.llvm.lib            0.03 0.0014   0.0009   0.0010   0.0071   |    <b>3856</b>     <b>12496</b>    <b>2392</b>       <b>35088</b>      |    *     <b>25+7</b>       <b>6+3</b>    <b>0+0</b>    0+0    
-sumarraymalloc.llvm.lib     0.03 0.0009   0.0008   0.0010   0.0063   |    <b>7040</b>     <b>2192</b>     <b>2656</b>       <b>26000</b>      |    *     <b>23+5</b>       <b>7+4</b>    <b>0+0</b>    0+0    
-sieve.llvm.lib              0.03 0.0007   0.0005   0.0006   0.0063   |    <b>2176</b>     <b>5832</b>     <b>1968</b>       <b>23424</b>      |    *     <b>22+2</b>       <b>12+1</b>   <b>0+0</b>    0+0    
-matrixTranspose.llvm.lib    <b>0.03</b> 0.0005   0.0002   0.0003   0.0026   |    <b>4248</b>     <b>792</b>      <b>1088</b>       <b>8520</b>       |    *     <b>8+1</b>        <b>5+1</b>    <b>0+0</b>    0+0    
-matrix.llvm.lib             0.03 0.0013   0.0013   0.0015   0.0085   |    <b>8720</b>     <b>8704</b>     <b>3416</b>       <b>36888</b>      |    *     <b>38+9</b>       <b>12+8</b>   <b>0+0</b>    0+0    
-ary3.llvm.lib               0.03 0.0012   0.0012   0.0012   0.0078   |    <b>8648</b>     <b>14136</b>    <b>3328</b>       <b>37712</b>      |    6     <b>44+5</b>       <b>12+3</b>   <b>0+0</b>    0+0    
-random.llvm.lib             0.02 0.0008   0.0004   0.0005   0.0047   |    <b>2056</b>     <b>4720</b>     <b>1656</b>       <b>21416</b>      |    *     <b>15+2</b>       <b>3+1</b>    <b>0+0</b>    0+0    
-pi.llvm.lib                 0.02 0.0007   0.0003   <b>0.0005</b>   0.0036   |    <b>5392</b>     <b>1384</b>     <b>4768</b>       <b>11544</b>      |    *     <b>17+2</b>       <b>13+2</b>   <b>0+0</b>    0+0    
-hello.llvm.lib              0.02 0.0004   <b>0.0001</b>   <b>0.0001</b>   0.0015   |    <b>752</b>      <b>2952</b>     <b>472</b>        <b>6512</b>       |    *     <b>2+0</b>        <b>0+0</b>    <b>0+0</b>    0+0    
-heapsort.llvm.lib           0.02 0.0009   0.0006   0.0007   0.0062   |    <b>7448</b>     <b>6864</b>     <b>2360</b>       <b>28040</b>      |    *     <b>26+3</b>       <b>7+2</b>    <b>0+0</b>    0+0    
-fib2.llvm.lib               0.02 0.0008   0.0007   0.0007   0.0055   |    <b>2416</b>     <b>5680</b>     <b>2000</b>       <b>25744</b>      |    *     <b>21+5</b>       <b>8+3</b>    <b>0+0</b>    0+0    
-ackermann.llvm.lib          <b>0.02</b> <b>0.0007</b>   <b>0.0004</b>   <b>0.0005</b>   <b>0.0046</b>   |    <b>1744</b>     <b>5368</b>     <b>1552</b>       <b>22048</b>      |    *     <b>13+2</b>       <b>3+1</b>    <b>0+0</b>    0+0    
-sumarray.llvm.lib           0.01 0.0003   0.0002   0.0002   0.0021   |    <b>904</b>      <b>2232</b>     <b>624</b>        <b>3760</b>       |    *     <b>6+1</b>        <b>4+1</b>    0+0    0+0    
-sumarray2d.llvm.lib         0.01 0.0004   0.0002   0.0003   0.0026   |    <b>4208</b>     <b>856</b>      <b>3656</b>       <b>10904</b>      |    *     <b>10+1</b>       <b>7+1</b>    <b>0+0</b>    0+0    
-printargs.llvm.lib          0.01 0.0004   0.0002   0.0003   0.0023   |    <b>1240</b>     <b>704</b>      <b>1064</b>       <b>5152</b>       |    *     <b>6+1</b>        <b>4+1</b>    <b>0+0</b>    0+0    
-indvars.llvm.lib            0.01 0.0005   0.0003   0.0003   0.0030   |    <b>1744</b>     <b>4088</b>     <b>1032</b>       <b>9704</b>       |    *     <b>13+1</b>       <b>8+1</b>    <b>0+0</b>    0+0    
-</pre><p>
-
-
-<hr>
-<a name="20021109-1"><h2>Nov 9, 2002:</h2>
-
-Same as the <a href="#20021108-3">previous run</a>, but now with a small tweak:
-constants are never put into the scalar map for a function.  This is in
-preparation for the global graph work, but it does speed analysis up
-marginally:<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime:      LocSize: BUSize:  TDSize:    TotSize:     NumFold  NumNodes   main   __main
-254.gap.lib                 2.16 *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-255.vortex.lib              1.11 *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-300.twolf.lib              11.63 0.2468   0.7464   7.5333   9.2461   |    <b>595576</b>   <b>795896</b>   <b>10397040</b>   <b>11788512</b>   |    <b>3577</b>  <b>161901+1222</b> 854+0  854+0  
-197.parser.lib             10.97 0.1258   0.4903   8.6508   9.5864   |    <b>464920</b>   <b>621904</b>   <b>12987664</b>   <b>14309904</b>   |    <b>2643</b>  <b>197546+1185</b> 601+0  601+0  
-burg.llvm.lib               5.18 0.0904   0.2948   3.7480   4.3338   |    <b>576064</b>   <b>893240</b>   <b>4821880</b>    <b>6356592</b>    |    <b>1557</b>  <b>72659+919</b>  436+0  436+0  
-164.gzip.llvm.lib           1.28 0.0355   0.1037   0.5037   0.7448   |    <b>228456</b>   <b>511192</b>   <b>1971048</b>    <b>2809016</b>    |    <b>70</b>    <b>16642+233</b>  171+0  171+0  
-256.bzip2.lib               0.69 0.0201   0.0535   0.3301   0.4626   |    <b>163016</b>   <b>284360</b>   <b>1450312</b>    <b>1970944</b>    |    20    <b>11464+202</b>  148+0  148+0  
-optimizer-eval.llvm.lib     0.57 0.0195   0.0846   0.3000   0.4423   |    <b>86832</b>    <b>180296</b>   <b>702840</b>     <b>988152</b>     |    *     3693+101   63+0   63+0   
-sim.llvm.lib                0.26 0.0137   0.0195   0.0619   0.1439   |    <b>92280</b>    <b>106632</b>   <b>330888</b>     <b>602464</b>     |    *     <b>2738+67</b>    99+0   99+0   
-181.mcf.lib                 0.23 0.0164   0.0294   0.0572   0.1265   |    <b>133872</b>   <b>128088</b>   <b>229576</b>     <b>508384</b>     |    <b>180</b>   <b>1923+73</b>    44+0   44+0   
-voronoi.llvm.lib            0.19 0.0119   0.0245   0.0606   0.1138   |    <b>83592</b>    <b>93192</b>    <b>211920</b>     <b>402648</b>     |    17    <b>1734+106</b>   30+0   30+0   
-sgefa.llvm.lib              0.17 0.0071   0.0333   0.0406   0.0994   |    <b>88880</b>    <b>102320</b>   <b>133176</b>     <b>349144</b>     |    *     634+55     31+0   31+0   
-bh.llvm.lib                 0.15 0.0102   0.0154   0.0239   0.0697   |    <b>77528</b>    <b>80672</b>    <b>110160</b>     <b>316400</b>     |    66    <b>716+64</b>     13+0   13+0   
-em3d.llvm.lib               0.09 0.0045   0.0105   0.0229   0.0477   |    <b>37816</b>    <b>55256</b>    <b>123168</b>     <b>232944</b>     |    <b>8</b>     <b>1032+59</b>    28+0   28+0   
-mst.llvm.lib                0.07 0.0033   0.0056   0.0115   0.0310   |    <b>30744</b>    <b>21600</b>    <b>62072</b>      <b>129088</b>     |    10    <b>471+36</b>     21+0   21+0   
-health.llvm.lib             0.07 0.0042   0.0080   0.0105   0.0313   |    <b>31520</b>    <b>31784</b>    <b>45624</b>      <b>123896</b>     |    71    <b>362+40</b>     14+0   14+0   
-tsp.llvm.lib                0.06 0.0046   0.0047   0.0060   0.0240   |    <b>19552</b>    <b>26040</b>    <b>25800</b>      <b>85696</b>      |    19    <b>248+31</b>     10+0   10+0   
-power.llvm.lib              0.06 0.0034   0.0050   0.0086   0.0254   |    <b>30904</b>    <b>31232</b>    <b>29704</b>      <b>99512</b>      |    *     277+35     9+0    9+0    
-perimeter.llvm.lib          0.05 0.0025   0.0044   0.0037   0.0195   |    <b>15760</b>    <b>24296</b>    <b>8552</b>       <b>61448</b>      |    *     <b>106+24</b>     4+0    4+0    
-lists.llvm.lib              0.05 0.0037   0.0075   0.0105   0.0283   |    <b>25912</b>    <b>29360</b>    <b>28352</b>      <b>101472</b>     |    50    <b>252+34</b>     10+0   10+0   
-hash.llvm.lib               0.05 0.0025   0.0040   0.0059   0.0194   |    <b>18464</b>    <b>25408</b>    <b>24192</b>      <b>81464</b>      |    *     <b>242+23</b>     7+0    7+0    
-llubenchmark.llvm.lib       0.04 0.0017   0.0022   0.0038   0.0198   |    <b>12040</b>    <b>13368</b>    <b>17600</b>      <b>54016</b>      |    *     <b>145+20</b>     15+0   15+0   
-bisort.llvm.lib             0.04 0.0024   0.0035   0.0051   0.0176   |    <b>14648</b>    <b>28160</b>    <b>22256</b>      <b>76136</b>      |    *     <b>211+27</b>     10+0   10+0   
-treeadd.llvm.lib            0.03 0.0011   0.0015   0.0020   0.0090   |    <b>9320</b>     <b>8552</b>     <b>10120</b>      <b>44152</b>      |    *     <b>77+14</b>      5+0    5+0    
-sieve.llvm.lib              0.03 0.0006   0.0006   0.0008   0.0063   |    <b>8032</b>     <b>1720</b>     <b>2552</b>       <b>22672</b>      |    *     <b>31+4</b>       2+0    2+0    
-objinst.llvm.lib            0.03 0.0015   0.0021   <b>0.0036</b>   0.0129   |    <b>11272</b>    <b>19896</b>    <b>6096</b>       <b>50920</b>      |    33    <b>74+17</b>      3+0    3+0    
-methcall.llvm.lib           0.03 0.0014   0.0018   0.0028   0.0111   |    <b>10936</b>    <b>15720</b>    <b>5152</b>       <b>45064</b>      |    26    <b>59+14</b>      2+0    2+0    
-matrix.llvm.lib             0.03 0.0014   0.0023   0.0025   0.0118   |    <b>8984</b>     <b>8096</b>     <b>4352</b>       <b>37776</b>      |    *     <b>47+11</b>      1+0    1+0    
-ary3.llvm.lib               0.03 0.0010   0.0014   0.0014   0.0084   |    <b>8992</b>     <b>8624</b>     <b>4344</b>       <b>37624</b>      |    6     <b>52+7</b>       1+0    1+0    
-sumarraymalloc.llvm.lib     0.02 0.0007   0.0009   0.0012   0.0069   |    <b>2936</b>     <b>6984</b>     <b>7216</b>       <b>31496</b>      |    *     <b>39+8</b>       2+0    2+0    
-random.llvm.lib             0.02 0.0006   0.0006   0.0008   0.0057   |    <b>2336</b>     <b>6000</b>     <b>2856</b>       <b>26944</b>      |    *     <b>32+5</b>       3+0    3+0    
-pi.llvm.lib                 0.02 0.0006   0.0006   0.0013   0.0047   |    <b>5816</b>     <b>7240</b>     <b>6688</b>       <b>19744</b>      |    *     34+6       3+0    3+0    
-heapsort.llvm.lib           0.02 0.0007   0.0009   0.0012   0.0070   |    <b>3128</b>     <b>7336</b>     <b>4008</b>       <b>29640</b>      |    *     <b>46+6</b>       3+0    3+0    
-fib2.llvm.lib               0.02 0.0007   0.0008   0.0008   0.0056   |    <b>5704</b>     <b>1928</b>     <b>2520</b>       <b>22440</b>      |    *     <b>26+6</b>       1+0    1+0    
-sumarray.llvm.lib           0.01 0.0003   0.0002   0.0003   0.0022   |    <b>960</b>      <b>3176</b>     <b>608</b>        <b>6856</b>       |    *     7+2        0+0    0+0    
-sumarray2d.llvm.lib         0.01 0.0003   0.0003   0.0004   0.0028   |    <b>1736</b>     <b>6056</b>     <b>1064</b>       <b>11176</b>      |    *     15+3       1+0    1+0    
-printargs.llvm.lib          0.01 0.0003   0.0004   0.0005   0.0026   |    <b>1464</b>     <b>848</b>      <b>3512</b>       <b>5824</b>       |    *     13+4       1+0    1+0    
-matrixTranspose.llvm.lib    0.01 0.0004   0.0004   0.0005   0.0030   |    <b>4384</b>     <b>1248</b>     <b>3824</b>       <b>9456</b>       |    *     17+4       3+0    3+0    
-indvars.llvm.lib            0.01 0.0004   0.0005   0.0005   0.0033   |    <b>4800</b>     <b>7440</b>     <b>1224</b>       <b>13464</b>      |    *     18+3       1+0    1+0    
-hello.llvm.lib              0.01 0.0003   0.0003   0.0003   0.0021   |    <b>976</b>      <b>3024</b>     <b>2968</b>       <b>9224</b>       |    *     8+3        1+0    1+0    
-ackermann.llvm.lib          0.00 0.0000   0.0000   0.0001   0.0004   |    <b>72</b>       0        832        <b>904</b>        |    *     0+0        *      *      
-</pre><p>
-
-<hr>
-<a name="20021108-3"><h2>Nov 8, 2002 #3:</h2>
-
-Same as the <a href="#20021108-2">previous run</a>, but now we automatically
-collapse arrays down to a single element in the representation.  The graphs
-produced should be exactly the same, it's just memory consumption that goes
-dramatically down, for example: 197.parser (64M-&gt;14M), 164.gzip
-(14M-&gt;2.7M), 256.bzip (9M -&gt; 1.9M), etc.<p>
-
-With reduced memory consumption comes higher performance of course (better cache
-behavior n stuff).<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime:      LocSize: BUSize:  TDSize:    TotSize:     NumFold  NumNodes   main   __main
-254.gap.lib                71.65 *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-255.vortex.lib              <b>4.62</b> *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-300.twolf.lib              12.22 0.2369   0.8840   8.0785   9.9177   |    <b>573880</b>   <b>770752</b>   <b>10364040</b>   <b>11708672</b>   |    <b>3514</b>  161528+1101 854+0  854+0  
-197.parser.lib             <b>11.73</b> 0.1216   <b>0.5217</b>   <b>9.3368</b>   <b>10.3099</b>  |    <b>461720</b>   <b>619960</b>   <b>12948496</b>   <b>14266336</b>   |    <b>2641</b>  196932+1184 601+0  601+0  
-burg.llvm.lib               5.35 0.0857   0.2873   3.9878   4.5484   |    <b>650608</b>   <b>906016</b>   <b>4691952</b>    <b>6248576</b>    |    <b>1555</b>  72533+902  436+0  436+0  
-164.gzip.llvm.lib           <b>1.33</b> <b>0.0309</b>   <b>0.1085</b>   <b>0.5445</b>   <b>0.7708</b>   |    <b>284312</b>   <b>521048</b>   <b>1877416</b>    <b>2779368</b>    |    <b>67</b>    16632+232  171+0  171+0  
-256.bzip2.lib               <b>0.73</b> 0.0191   <b>0.0588</b>   <b>0.3611</b>   <b>0.4995</b>   |    <b>156760</b>   <b>336272</b>   <b>1390240</b>    <b>1956528</b>    |    <b>20</b>    11456+201  148+0  148+0  
-optimizer-eval.llvm.lib     0.56 0.0129   0.0957   0.2881   0.4359   |    <b>85720</b>    <b>178016</b>   <b>750424</b>     <b>1032352</b>    |    <b>*</b>     3693+101   63+0   63+0   
-sim.llvm.lib                <b>0.29</b> 0.0126   <b>0.0237</b>   <b>0.0731</b>   <b>0.1630</b>   |    <b>93240</b>    <b>106144</b>   <b>331688</b>     <b>626088</b>     |    <b>*</b>     2739+67    99+0   99+0   
-181.mcf.lib                 0.28 0.0153   0.0379   <b>0.0649</b>   0.1457   |    <b>136744</b>   <b>155416</b>   <b>202496</b>     <b>511544</b>     |    <b>178</b>   1914+72    44+0   44+0   
-voronoi.llvm.lib            0.22 0.0122   0.0296   0.0728   0.1324   |    <b>83568</b>    <b>94008</b>    <b>212560</b>     <b>404128</b>     |    <b>17</b>    1733+106   30+0   30+0   
-sgefa.llvm.lib              0.19 0.0072   0.0375   0.0491   0.1131   |    <b>102144</b>   <b>109744</b>   <b>117064</b>     <b>353720</b>     |    <b>*</b>     634+55     31+0   31+0   
-bh.llvm.lib                 0.17 0.0098   0.0164   0.0260   0.0728   |    <b>78048</b>    <b>82616</b>    <b>86688</b>      <b>311168</b>     |    66    715+64     13+0   13+0   
-em3d.llvm.lib               0.11 0.0046   0.0114   0.0327   0.0590   |    <b>36344</b>    <b>64760</b>    <b>125360</b>     <b>243088</b>     |    <b>9</b>     1031+59    28+0   28+0   
-power.llvm.lib              0.09 0.0043   0.0053   0.0100   0.0296   |    <b>22840</b>    <b>33912</b>    <b>30440</b>      <b>103016</b>     |    <b>*</b>     277+35     9+0    9+0    
-tsp.llvm.lib                0.08 0.0043   0.0057   0.0066   0.0276   |    <b>20640</b>    <b>25416</b>    <b>25784</b>      <b>86464</b>      |    <b>19</b>    247+31     10+0   10+0   
-mst.llvm.lib                0.08 0.0033   0.0060   0.0123   0.0308   |    <b>29088</b>    31400    <b>51632</b>      <b>126792</b>     |    <b>10</b>    470+36     21+0   21+0   
-lists.llvm.lib              0.08 <b>0.0035</b>   0.0080   0.0111   0.0294   |    <b>25048</b>    <b>33872</b>    <b>25520</b>      <b>96760</b>      |    <b>50</b>    246+34     10+0   10+0   
-health.llvm.lib             0.08 <b>0.0043</b>   0.0083   0.0120   0.0344   |    31232    <b>31256</b>    <b>45008</b>      <b>122464</b>     |    <b>71</b>    361+40     14+0   14+0   
-perimeter.llvm.lib          0.07 0.0036   0.0047   0.0049   0.0251   |    15336    22904    <b>15968</b>      <b>66864</b>      |    *     105+24     4+0    4+0    
-objinst.llvm.lib            0.06 0.0016   0.0024   <b>0.0090</b>   0.0191   |    11032    <b>15560</b>    <b>12416</b>      <b>52664</b>      |    <b>33</b>    73+17      3+0    3+0    
-bisort.llvm.lib             0.06 0.0023   0.0036   0.0065   0.0202   |    14376    <b>20968</b>    <b>22152</b>      <b>68568</b>      |    <b>*</b>     210+27     10+0   10+0   
-llubenchmark.llvm.lib       0.05 0.0018   0.0024   0.0042   0.0166   |    11824    <b>15464</b>    <b>23480</b>      <b>61776</b>      |    <b>*</b>     144+20     15+0   15+0   
-hash.llvm.lib               0.05 0.0026   0.0044   0.0062   0.0206   |    <b>18192</b>    <b>24928</b>    <b>23976</b>      <b>80496</b>      |    <b>*</b>     241+23     7+0    7+0    
-methcall.llvm.lib           0.04 0.0014   0.0019   0.0031   0.0120   |    10824    9704     11128      45312      |    <b>26</b>    58+14      2+0    2+0    
-ary3.llvm.lib               0.04 0.0010   0.0015   0.0014   0.0102   |    8752     17136    4168       45720      |    6     50+7       1+0    1+0    
-treeadd.llvm.lib            0.03 0.0011   0.0016   0.0023   0.0098   |    9080     8408     <b>9944</b>       <b>39424</b>      |    <b>*</b>     76+14      5+0    5+0    
-sieve.llvm.lib              0.03 0.0006   <b>0.0006</b>   <b>0.0009</b>   0.0063   |    <b>7856</b>     <b>6056</b>     <b>2480</b>       <b>26760</b>      |    *     30+4       2+0    2+0    
-pi.llvm.lib                 0.03 0.0006   0.0007   0.0012   0.0050   |    5696     5272     <b>5584</b>       <b>16552</b>      |    *     34+6       3+0    3+0    
-matrix.llvm.lib             0.03 0.0010   0.0017   0.0018   0.0096   |    8584     17680    4208       46232      |    *     46+11      1+0    1+0    
-heapsort.llvm.lib           0.03 0.0010   0.0009   0.0013   0.0076   |    2936     7224     3912       29240      |    *     45+6       3+0    3+0    
-sumarraymalloc.llvm.lib     0.02 0.0007   0.0009   0.0015   0.0072   |    2720     <b>6872</b>     <b>7128</b>       <b>31152</b>      |    *     38+8       2+0    2+0    
-sumarray.llvm.lib           0.02 0.0003   0.0002   0.0003   0.0025   |    <b>864</b>      <b>3144</b>     <b>592</b>        <b>6712</b>       |    <b>*</b>     7+2        0+0    0+0    
-random.llvm.lib             0.02 0.0006   0.0006   0.0009   0.0057   |    6184     1808     2752       23600      |    *     31+5       3+0    3+0    
-printargs.llvm.lib          0.02 0.0003   0.0004   0.0006   0.0028   |    1360     816      <b>3480</b>       <b>5656</b>       |    *     13+4       1+0    1+0    
-matrixTranspose.llvm.lib    0.02 0.0004   <b>0.0004</b>   <b>0.0006</b>   <b>0.0034</b>   |    <b>5888</b>     <b>1224</b>     <b>4864</b>       <b>11976</b>      |    *     17+4       3+0    3+0    
-indvars.llvm.lib            <b>0.02</b> <b>0.0005</b>   <b>0.0005</b>   <b>0.0005</b>   <b>0.0037</b>   |    <b>4680</b>     <b>3552</b>     <b>1200</b>       <b>9432</b>       |    *     18+3       1+0    1+0    
-fib2.llvm.lib               0.02 0.0007   0.0008   0.0009   0.0059   |    6176     1808     2400       23008      |    *     25+6       1+0    1+0    
-sumarray2d.llvm.lib         <b>0.01</b> <b>0.0004</b>   <b>0.0004</b>   <b>0.0004</b>   <b>0.0030</b>   |    <b>1648</b>     <b>6024</b>     <b>4144</b>       <b>14136</b>      |    *     15+3       1+0    1+0    
-hello.llvm.lib              0.01 0.0003   0.0003   0.0003   0.0022   |    880      592      2944       6672       |    *     8+3        1+0    1+0    
-ackermann.llvm.lib          <b>0.00</b> 0.0000   0.0000   0.0002   0.0004   |    0        0        832        832        |    *     0+0        *      *      
-</pre><p>
-
-
-
-<hr>
-<a name="20021108-2"><h2>Nov 8, 2002 #2:</h2>
-
-Same as the <a href="#20021108">previous run</a>, but with a huge bug fix:
-before, all of the call nodes (from the local pass) were being passed up in the
-BU pass, causing graph exposions.  Now these call sites are not propagated.  The
-times and sized of graphs are all much smaller now.<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime:      LocSize: BUSize:  TDSize:    TotSize:     NumFold  NumNodes   main   __main
-254.gap.lib               <b>130.47</b> *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-255.vortex.lib             <b>86.17</b> *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-197.parser.lib             <b>26.50</b> 0.1601   <b>1.4931</b>   <b>22.7485</b>  <b>24.7647</b>  |    <b>2187656</b>  <b>4037056</b>  <b>57704672</b>   <b>64165544</b>   |    <b>4550</b>  <b>196932+1184</b> 601+0  601+0  
-300.twolf.lib              <b>14.33</b> 0.2311   1.0000   <b>10.1733</b>  <b>12.1591</b>  |    629008   <b>1085616</b>  <b>15564712</b>   <b>17279336</b>   |    <b>4655</b>  <b>161528+1101</b> 854+0  854+0  
-burg.llvm.lib               <b>6.71</b> 0.0904   <b>0.3799</b>   <b>5.1871</b>   <b>5.8809</b>   |    <b>745152</b>   <b>1254280</b>  <b>6822216</b>    <b>8821648</b>    |    <b>3253</b>  <b>72533+902</b>  <b>436+0</b>  <b>436+0</b>  
-164.gzip.llvm.lib           <b>6.07</b> 0.1158   0.9992   <b>4.1925</b>   <b>5.3966</b>   |    <b>2113120</b>  <b>2772872</b>  <b>9043760</b>    <b>14026344</b>   |    <b>233</b>   <b>16632+232</b>  171+0  171+0  
-256.bzip2.lib               <b>2.16</b> 0.0239   0.1987   <b>1.6047</b>   <b>1.8899</b>   |    372776   <b>1059888</b>  <b>7503640</b>    <b>9009560</b>    |    <b>132</b>   <b>11456+201</b>  148+0  148+0  
-sim.llvm.lib                1.54 0.0163   0.2356   1.0723   1.3738   |    <b>106096</b>   <b>124280</b>   <b>400760</b>     <b>726152</b>     |    <b>41</b>    <b>2739+67</b>    99+0   99+0   
-optimizer-eval.llvm.lib     <b>0.58</b> 0.0126   <b>0.0890</b>   <b>0.3282</b>   <b>0.4696</b>   |    <b>110464</b>   <b>188584</b>   <b>1055832</b>    <b>1373072</b>    |    <b>287</b>   <b>3693+101</b>   63+0   63+0   
-181.mcf.lib                 0.33 0.0155   0.0465   <b>0.1437</b>   <b>0.2308</b>   |    <b>156864</b>   <b>225184</b>   <b>805584</b>     <b>1204520</b>    |    <b>209</b>   <b>1914+72</b>    44+0   44+0   
-voronoi.llvm.lib            <b>0.19</b> 0.0111   0.0253   <b>0.0644</b>   <b>0.1178</b>   |    <b>83248</b>    <b>93616</b>    <b>238648</b>     <b>429504</b>     |    <b>31</b>    <b>1733+106</b>   30+0   30+0   
-sgefa.llvm.lib              0.18 0.0069   0.0398   0.0492   0.1156   |    104712   <b>108472</b>   <b>178920</b>     <b>416872</b>     |    <b>67</b>    <b>634+55</b>     31+0   31+0   
-bh.llvm.lib                 <b>0.16</b> 0.0100   0.0177   <b>0.0355</b>   <b>0.0838</b>   |    <b>81376</b>    <b>93656</b>    <b>190104</b>     <b>428952</b>     |    66    <b>715+64</b>     13+0   13+0   
-health.llvm.lib             0.10 <b>0.0230</b>   0.0084   0.0138   0.0551   |    31232    <b>31552</b>    <b>56984</b>      <b>134736</b>     |    <b>75</b>    <b>361+40</b>     14+0   14+0   
-em3d.llvm.lib               0.09 0.0045   0.0117   <b>0.0255</b>   0.0519   |    <b>37336</b>    <b>67808</b>    <b>126960</b>     <b>248728</b>     |    <b>50</b>    <b>1031+59</b>    <b>28+0</b>   <b>28+0</b>   
-power.llvm.lib              0.07 0.0035   0.0053   <b>0.0105</b>   <b>0.0287</b>   |    <b>23432</b>    <b>31680</b>    <b>42680</b>      <b>113616</b>     |    <b>3</b>     <b>277+35</b>     9+0    9+0    
-mst.llvm.lib                0.07 0.0033   0.0060   <b>0.0145</b>   0.0333   |    <b>29080</b>    <b>31400</b>    <b>56720</b>      <b>131872</b>     |    <b>35</b>    <b>470+36</b>     21+0   21+0   
-lists.llvm.lib              0.07 <b>0.0079</b>   0.0129   0.0170   0.0453   |    <b>27616</b>    <b>39648</b>    <b>75280</b>      <b>154864</b>     |    <b>54</b>    <b>246+34</b>     10+0   10+0   
-indvars.llvm.lib            0.07 0.0020   0.0257   0.0269   0.0569   |    <b>85496</b>    <b>87560</b>    161216     <b>334272</b>     |    *     18+3       1+0    1+0    
-tsp.llvm.lib                0.06 0.0041   0.0049   <b>0.0065</b>   0.0250   |    <b>19360</b>    <b>26216</b>    <b>26712</b>      <b>86912</b>      |    <b>23</b>    <b>247+31</b>     10+0   10+0   
-perimeter.llvm.lib          0.05 0.0024   0.0045   <b>0.0039</b>   0.0194   |    <b>15336</b>    <b>22904</b>    <b>16288</b>      <b>67184</b>      |    *     <b>105+24</b>     4+0    4+0    
-hash.llvm.lib               0.05 0.0029   0.0043   <b>0.0066</b>   0.0211   |    25880    <b>18176</b>    <b>28168</b>      <b>85624</b>      |    <b>2</b>     <b>241+23</b>     7+0    7+0    
-bisort.llvm.lib             <b>0.05</b> 0.0022   0.0036   0.0064   0.0192   |    14376    <b>28616</b>    <b>22416</b>      <b>76480</b>      |    <b>3</b>     <b>210+27</b>     10+0   10+0   
-llubenchmark.llvm.lib       0.04 0.0017   0.0026   0.0045   0.0169   |    11824    <b>24304</b>    <b>18168</b>      <b>65304</b>      |    <b>8</b>     <b>144+20</b>     15+0   15+0   
-treeadd.llvm.lib            0.03 0.0013   0.0016   0.0023   0.0101   |    <b>9080</b>     <b>8408</b>     <b>11224</b>      <b>40704</b>      |    <b>2</b>     <b>76+14</b>      5+0    5+0    
-sumarray2d.llvm.lib         0.03 0.0014   0.0097   0.0106   0.0238   |    42056    46440    83192      174008     |    *     15+3       1+0    1+0    
-sieve.llvm.lib              0.03 0.0008   0.0021   0.0032   0.0103   |    16064    <b>14264</b>    <b>35312</b>      <b>76008</b>      |    *     <b>30+4</b>       2+0    2+0    
-objinst.llvm.lib            <b>0.03</b> 0.0015   0.0024   <b>0.0037</b>   0.0134   |    11032    <b>15488</b>    <b>11440</b>      <b>51616</b>      |    39    <b>73+17</b>      3+0    3+0    
-methcall.llvm.lib           0.03 0.0014   0.0018   0.0030   0.0115   |    <b>10824</b>    <b>9704</b>     <b>11128</b>      <b>45312</b>      |    31    <b>58+14</b>      2+0    2+0    
-matrix.llvm.lib             0.03 0.0011   0.0017   0.0018   0.0109   |    <b>8584</b>     <b>17680</b>    <b>4208</b>       <b>46232</b>      |    *     <b>46+11</b>      1+0    1+0    
-ary3.llvm.lib               0.03 0.0010   0.0014   0.0014   0.0085   |    8752     <b>17136</b>    <b>4168</b>       <b>45720</b>      |    6     <b>50+7</b>       1+0    1+0    
-sumarraymalloc.llvm.lib     0.02 0.0007   0.0009   0.0013   0.0070   |    2720     <b>12824</b>    <b>3376</b>       <b>33352</b>      |    *     <b>38+8</b>       2+0    2+0    
-random.llvm.lib             0.02 0.0006   0.0009   0.0009   0.0060   |    <b>6184</b>     <b>1808</b>     <b>2752</b>       <b>23600</b>      |    *     <b>31+5</b>       3+0    3+0    
-pi.llvm.lib                 0.02 0.0006   0.0007   0.0011   0.0049   |    5696     <b>5272</b>     <b>6544</b>       <b>17512</b>      |    *     <b>34+6</b>       3+0    3+0    
-matrixTranspose.llvm.lib    0.02 0.0007   0.0033   0.0034   0.0095   |    14088    9424     29480      52992      |    *     17+4       3+0    3+0    
-heapsort.llvm.lib           <b>0.02</b> 0.0008   0.0009   0.0013   <b>0.0076</b>   |    2936     <b>7224</b>     <b>3912</b>       <b>29240</b>      |    *     <b>45+6</b>       3+0    3+0    
-fib2.llvm.lib               0.02 0.0014   0.0008   0.0009   0.0067   |    <b>6176</b>     <b>1808</b>     <b>2400</b>       <b>23008</b>      |    *     <b>25+6</b>       1+0    1+0    
-sumarray.llvm.lib           <b>0.01</b> 0.0003   0.0003   0.0003   0.0022   |    1280     3552     584        7528       |    3     7+2        0+0    0+0    
-printargs.llvm.lib          0.01 0.0005   0.0004   0.0006   0.0030   |    1360     <b>816</b>      <b>4760</b>       <b>6936</b>       |    *     <b>13+4</b>       1+0    1+0    
-hello.llvm.lib              0.01 0.0003   0.0003   0.0003   0.0022   |    880      <b>592</b>      <b>2944</b>       <b>6672</b>       |    *     <b>8+3</b>        1+0    1+0    
-ackermann.llvm.lib          0.01 0.0000   0.0000   0.0001   0.0004   |    0        0        832        832        |    *     0+0        *      *      
-</pre><p>
-
-<hr>
-<a name="20021108"><h2>Nov 8, 2002:</h2>
-
-Same as the <a href="#20021107-2">previous run</a>, but now the Top-Down pass
-has been rewritten to:<p>
-
-<ul>
-<li>Actually work on all of the benchmarks
-<li>Require less book-keeping
-<li>Only clone a caller graph into a particular callee graph once
-<li>Not prune nodes as aggressively, this is probably the reason for many
-    slowdowns below.
-</ul><p>
-
-Looking deeper into the results, gzip got slower by a factor of 4, optimizer
-eval got slower by a factor of 3, sim slowed down just a little bit.<p>
-
-Note that without the globals graph, some benchmarks are still VERY slow (those
-with heavy use of globals).<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime:      LocSize: BUSize:  TDSize:    TotSize:     NumFold  NumNodes   main   __main
-254.gap.lib               330.50 *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-255.vortex.lib                 * *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-197.parser.lib            120.10 0.1649   11.8198  105.3900 118.0119 |    2188536  4525320  60972272   67921544   |    22575 202604+8604 601+0  601+0  
-300.twolf.lib              72.38 0.2431   1.8500   30.5671  72.3845  |    629008   1375352  16515832   18520192   |    18090 163168+3906 854+0  854+0  
-burg.llvm.lib              34.18 0.0871   1.0919   15.8467  34.1754  |    749304   1755232  7209416    9779360    |    21707 78464+4387 393+0  393+0  
-164.gzip.llvm.lib          21.81 0.1149   1.2083   19.6981  21.1201  |    2055024  3145544  8929008    14227896   |    2387  18236+1588 171+0  171+0  
-256.bzip2.lib               7.44 0.0250   0.3032   6.2987   7.4430   |    372776   1205520  7660752    9312304    |    1765  11947+1011 148+0  148+0  
-optimizer-eval.llvm.lib     3.24 0.0131   1.0648   1.9117   3.0792   |    110456   343032   1971952    2443624    |    5293  4186+1033  63+0   63+0   
-sim.llvm.lib                2.27 0.0170   0.2274   1.7720   2.0708   |    104728   130376   451320     759088     |    62    2755+122   99+0   99+0   
-181.mcf.lib                 0.61 0.0162   0.0556   0.3631   0.4646   |    156648   234864   866704     1275064    |    243   2023+163   44+0   44+0   
-voronoi.llvm.lib            0.45 0.0117   0.0447   0.2557   0.3385   |    83088    150936   337552     585520     |    157   2063+390   30+0   30+0   
-bh.llvm.lib                 0.38 0.0101   0.0253   0.1778   0.2394   |    79736    129328   245408     502512     |    66    858+198    13+0   13+0   
-sgefa.llvm.lib              0.27 0.0071   0.0396   0.0780   0.1465   |    104712   112576   204600     446656     |    130   640+103    31+0   31+0   
-power.llvm.lib              0.14 0.0035   0.0080   0.0451   0.0675   |    31272    49768    66968      155680     |    6     359+96     9+0    9+0    
-em3d.llvm.lib               0.13 0.0046   0.0140   0.0524   0.0825   |    37096    65320    122624     241744     |    141   920+127    21+0   21+0   
-mst.llvm.lib                0.13 0.0033   0.0084   0.0381   0.0605   |    29104    36104    70496      150376     |    100   506+91     21+0   21+0   
-lists.llvm.lib              0.12 0.0036   0.0118   0.0328   0.0664   |    27880    33064    98728      177520     |    58    270+63     10+0   10+0   
-bisort.llvm.lib             0.11 0.0023   0.0047   0.0125   0.0270   |    14376    29520    33808      88776      |    6     226+42     10+0   10+0   
-indvars.llvm.lib            0.11 0.0020   0.0254   0.0310   0.0606   |    85520    88232    161216     334968     |    *     18+3       1+0    1+0    
-health.llvm.lib             0.10 0.0044   0.0113   0.0255   0.0519   |    31232    44592    53456      144248     |    79    385+69     14+0   14+0   
-tsp.llvm.lib                0.10 0.0042   0.0062   0.0176   0.0382   |    27840    19008    51376      112528     |    27    271+55     10+0   10+0   
-hash.llvm.lib               0.10 0.0026   0.0056   0.0168   0.0336   |    25880    29936    35312      104528     |    6     271+44     7+0    7+0    
-heapsort.llvm.lib           0.09 0.0007   0.0009   0.0015   0.0429   |    2936     7384     4064       29552      |    *     47+7       3+0    3+0    
-perimeter.llvm.lib          0.08 0.0025   0.0064   0.0090   0.0271   |    15432    25616    18552      72440      |    *     121+39     4+0    4+0    
-objinst.llvm.lib            0.08 0.0015   0.0027   0.0076   0.0180   |    11032    16088    19848      60624      |    39    78+25      3+0    3+0    
-sumarray2d.llvm.lib         0.06 0.0011   0.0098   0.0111   0.0241   |    42056    46440    83192      174008     |    *     15+3       1+0    1+0    
-ary3.llvm.lib               0.06 0.0010   0.0016   0.0021   0.0096   |    8752     17528    4696       46640      |    6     55+10      1+0    1+0    
-llubenchmark.llvm.lib       0.05 0.0018   0.0034   0.0063   0.0199   |    11824    20384    28056      71272      |    32    141+31     15+0   15+0   
-treeadd.llvm.lib            0.05 0.0012   0.0023   0.0036   0.0121   |    9120     17640    10960      53880      |    4     82+18      5+0    5+0    
-sumarray.llvm.lib           0.04 0.0003   0.0003   0.0003   0.0022   |    1280     3552     584        7528       |    3     7+2        0+0    0+0    
-methcall.llvm.lib           0.03 0.0014   0.0021   0.0045   0.0147   |    10680    16000    11784      51720      |    31    63+19      2+0    2+0    
-sieve.llvm.lib              0.03 0.0008   0.0022   0.0047   0.0120   |    16064    14528    39672      80632      |    *     32+5       2+0    2+0    
-fib2.llvm.lib               0.03 0.0007   0.0009   0.0011   0.0063   |    5512     6088     2544       26432      |    *     27+7       1+0    1+0    
-matrix.llvm.lib             0.02 0.0010   0.0017   0.0021   0.0100   |    8760     8104     8976       42184      |    *     48+12      1+0    1+0    
-matrixTranspose.llvm.lib    0.02 0.0007   0.0034   0.0037   0.0098   |    14088    9424     29480      52992      |    *     17+4       3+0    3+0    
-sumarraymalloc.llvm.lib     0.02 0.0007   0.0010   0.0016   0.0075   |    2720     12928    3536       33544      |    *     40+9       2+0    2+0    
-pi.llvm.lib                 0.02 0.0006   0.0007   0.0014   0.0052   |    5696     5368     5680       16744      |    *     35+7       3+0    3+0    
-random.llvm.lib             0.02 0.0006   0.0007   0.0012   0.0061   |    2136     6040     7248       31176      |    *     33+6       3+0    3+0    
-printargs.llvm.lib          0.02 0.0003   0.0004   0.0007   0.0030   |    1360     1024     1728       4112       |    *     14+5       1+0    1+0    
-hello.llvm.lib              0.02 0.0003   0.0003   0.0005   0.0023   |    880      648      768        4552       |    *     9+4        1+0    1+0    
-ackermann.llvm.lib          0.02 0.0000   0.0000   0.0002   0.0004   |    0        0        832        832        |    *     0+0        *      *      
-</pre><p>
-
-
-<hr>
-<a name="20021107-2"><h2>Nov 7, 2002 #2:</h2>
-
-Same as the <a href="#20021107">previous run</a>, but now we actually handle
-constants (especially constantexprs) correctly in the local and all subsequent
-passes.  This seems to dramatically improve many benchmarks, only slowing down
-gzip significantly.<p>
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime:      LocSize: BUSize:  TDSize:    TotSize:     NumFold  NumNodes   main   __main
-300.twolf.lib              30.88 *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-255.vortex.lib             15.71 *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-254.gap.lib                 6.07 analyze: ../../../include/llvm/Analysis/DSNode.h:77: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-164.gzip.llvm.lib           5.32 0.1157   1.0296   3.4025   4.6326   |    2054352  2631576  7804656    12588904   |    398   13372+217  174+3  174+3  
-256.bzip2.lib               2.36 0.0250   0.1913   1.8190   2.0966   |    371928   1045320  7533440    9023600    |    407   11415+149  151+2  151+2  
-sim.llvm.lib                1.97 0.0174   0.2155   1.4731   1.7539   |    104584   120112   449736     747416     |    46    2745+52    101+2  101+2  
-197.parser.lib              1.27 analyze: ../../../include/llvm/Analysis/DSNode.h:77: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-optimizer-eval.llvm.lib     1.09 0.0132   0.0926   0.8104   0.9528   |    109416   186592   1827184    2141376    |    1709  8189+43    63+0   63+0   
-burg.llvm.lib               0.81 analyze: ../../../include/llvm/Analysis/DSNode.h:77: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-181.mcf.lib                 0.38 0.0163   0.0470   0.1847   0.2714   |    156304   219896   808112     1201160    |    226   1859+0     44+0   44+0   
-voronoi.llvm.lib            0.22 0.0118   0.0241   0.0776   0.1293   |    82728    87872    214584     399128     |    31    1650+0     30+0   30+0   
-sgefa.llvm.lib              0.19 0.0074   0.0324   0.0716   0.1303   |    104560   104744   200024     434096     |    89    610+1      32+0   32+0   
-bh.llvm.lib                 0.17 0.0106   0.0158   0.0344   0.0813   |    80112    86984    210008     425144     |    66    678+3      16+0   16+0   
-em3d.llvm.lib               0.16 0.0067   0.0111   0.0619   0.0899   |    37600    55936    217632     327872     |    90    1584+522   38+3   38+3   
-health.llvm.lib             0.10 0.0044   0.0071   0.0117   0.0322   |    31120    38712    35248      120048     |    81    328+0      14+0   14+0   
-lists.llvm.lib              0.09 0.0037   0.0075   0.0296   0.0477   |    27792    32968    83288      162264     |    61    222+0      10+0   10+0   
-llubenchmark.llvm.lib       0.09 0.0018   0.0021   0.0060   0.0178   |    11104    12176    32552      66840      |    35    152+22     17+1   17+1   
-power.llvm.lib              0.08 0.0036   0.0045   0.0139   0.0308   |    21672    31000    40512      109008     |    5     246+0      9+0    9+0    
-mst.llvm.lib                0.07 0.0033   0.0051   0.0125   0.0296   |    28368    27552    49088      119680     |    54    435+1      21+0   21+0   
-indvars.llvm.lib            0.07 0.0020   0.0199   0.0281   0.0521   |    85496    84840    164280     334616     |    *     15+0       1+0    1+0    
-perimeter.llvm.lib          0.06 0.0027   0.0035   0.0037   0.0180   |    15312    12112    14536      54800      |    *     83+0       4+0    4+0    
-tsp.llvm.lib                0.05 0.0045   0.0041   0.0063   0.0254   |    27736    15016    25296      82352      |    28    228+1      11+0   11+0   
-hash.llvm.lib               0.04 0.0025   0.0038   0.0054   0.0202   |    18288    24528    26104      82320      |    2     220+0      7+0    7+0    
-bisort.llvm.lib             0.04 0.0025   0.0030   0.0050   0.0178   |    14296    19056    28384      72808      |    5     186+0      10+0   10+0   
-sumarray2d.llvm.lib         0.04 0.0011   0.0077   0.0102   0.0210   |    42032    46264    83960      174576     |    *     12+0       1+0    1+0    
-treeadd.llvm.lib            0.04 0.0011   0.0013   0.0017   0.0086   |    9008     7360     10264      42432      |    2     64+0       5+0    5+0    
-objinst.llvm.lib            0.03 0.0021   0.0019   0.0049   0.0147   |    10928    15344    24592      64520      |    31    151+72     9+4    9+4    
-methcall.llvm.lib           0.03 0.0014   0.0016   0.0030   0.0111   |    15520    8928     8032       45736      |    27    99+44      8+4    8+4    
-matrix.llvm.lib             0.03 0.0010   0.0015   0.0017   0.0086   |    8680     8424     8200       41304      |    *     39+0       1+0    1+0    
-sieve.llvm.lib              0.03 0.0007   0.0021   0.0032   0.0101   |    10320    13864    34512      72456      |    *     26+0       2+0    2+0    
-sumarraymalloc.llvm.lib     0.03 0.0007   0.0008   0.0008   0.0060   |    2656     6144     6848       30024      |    *     31+0       2+0    2+0    
-matrixTranspose.llvm.lib    0.03 0.0006   0.0027   0.0034   0.0087   |    14064    9080     28600      51744      |    *     14+0       3+0    3+0    
-ary3.llvm.lib               0.02 0.0011   0.0013   0.0012   0.0081   |    8720     6968     8256       39992      |    6     44+0       1+0    1+0    
-heapsort.llvm.lib           0.02 0.0008   0.0008   0.0008   0.0077   |    2896     13464    2552       33728      |    *     39+0       3+0    3+0    
-random.llvm.lib             0.02 0.0007   0.0006   0.0006   0.0056   |    6296     4848     6112       29856      |    *     26+0       3+0    3+0    
-fib2.llvm.lib               0.01 0.0007   0.0007   0.0006   0.0052   |    5488     5408     1344       24888      |    *     19+0       1+0    1+0    
-pi.llvm.lib                 0.01 0.0006   0.0006   0.0009   0.0043   |    5656     4768     5416       15840      |    *     29+0       3+0    3+0    
-printargs.llvm.lib          0.01 0.0003   0.0003   0.0003   0.0023   |    1336     560      728        2624       |    *     9+0        1+0    1+0    
-sumarray.llvm.lib           0.01 0.0003   0.0003   0.0002   0.0022   |    1256     2456     456        6280       |    3     5+0        0+0    0+0    
-hello.llvm.lib              0.01 0.0003   0.0003   0.0002   0.0019   |    840      2872     3136       6848       |    *     5+0        1+0    1+0    
-ackermann.llvm.lib          0.01 *        *        *        *        |    *        *        *          *          |    *     0+0        *      *      
-</pre><p>
-
-
-<hr>
-<a name="20021107"><h2>Nov 7, 2002:</h2>
-
-Notes: Debug build, no globals graph, no array collapsing.<p>
-
-Things are a big slower than before due to corrected handling of global
-variables.
-
-<pre>
-Name:                     Anlyz: LocTime: BUTime:  TDTime:  TotTime:      LocSize: BUSize:  TDSize:    TotSize:     NumFold  NumNodes   main   __main
-254.gap.lib                 6.23 analyze: ../../../include/llvm/Analysis/DSNode.h:77: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-sim.llvm.lib                3.77 0.0156   0.3313   1.6634   2.0787   |    63080    98008    192424     426656     |    *     1825+84    63+2   63+2   
-300.twolf.lib             374.15 *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-255.vortex.lib            185.26 *        *        *        *        |    *        *        *          *          |    *     *          *      *      
-256.bzip2.lib               1.10 0.0158   0.0679   0.7397   0.8794   |    213592   385312   3368648    4040464    |    18    5238+257   64+1   64+1   
-164.gzip.llvm.lib           1.08 0.0260   0.0797   0.3326   0.5279   |    235048   421744   1484408    2237792    |    21    9628+634   113+1  113+1  
-197.parser.lib              1.06 analyze: ../../../include/llvm/Analysis/DSNode.h:77: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-burg.llvm.lib               0.71 analyze: ../../../include/llvm/Analysis/DSNode.h:77: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-optimizer-eval.llvm.lib     0.67 0.0115   0.0793   0.4125   0.5422   |    78080    141896   372592     610760     |    58    666+27     2+0    2+0    
-181.mcf.lib                 0.32 0.0125   0.0418   0.1271   0.2052   |    120504   192920   545696     876008     |    186   753+0      14+0   14+0   
-voronoi.llvm.lib            0.18 0.0098   0.0204   0.0661   0.1116   |    78560    83344    116304     292200     |    19    1006+0     16+0   16+0   
-sgefa.llvm.lib              0.16 0.0064   0.0340   0.0413   0.0999   |    82280    96016    67960      270944     |    *     125+2      2+0    2+0    
-sieve.llvm.lib              0.16 0.0007   0.0028   0.0209   0.0295   |    9872     13808    38872      76312      |    *     22+0       1+0    1+0    
-lists.llvm.lib              0.15 0.0027   0.0061   0.0042   0.0217   |    22256    14256    3208       51720      |    52    38+0       0+0    0+0    
-bh.llvm.lib                 0.14 0.0082   0.0140   0.0171   0.0630   |    73320    75448    42920      255160     |    74    402+4      10+0   10+0   
-em3d.llvm.lib               0.14 0.0037   0.0091   0.0303   0.0522   |    33816    50768    109200     202192     |    10    925+410    19+3   19+3   
-hash.llvm.lib               0.14 0.0020   0.0033   0.0036   0.0154   |    17488    23928    12584      67400      |    *     131+0      2+0    2+0    
-llubenchmark.llvm.lib       0.13 0.0013   0.0011   0.0019   0.0128   |    9680     2144     10072      32904      |    *     51+10      4+1    4+1    
-indvars.llvm.lib            0.12 0.0022   0.0248   0.0422   0.0713   |    82040    87944    160872     333400     |    *     12+0       0+0    0+0    
-ary3.llvm.lib               0.12 0.0008   0.0011   0.0009   0.0072   |    7992     7808     2416       34264      |    6     37+0       0+0    0+0    
-health.llvm.lib             0.10 0.0035   0.0067   0.0067   0.0280   |    28432    27984    12640      83984      |    72    151+1      6+0    6+0    
-hello.llvm.lib              0.10 0.0002   0.0002   0.0002   0.0016   |    504      2816     336        3656       |    *     2+0        0+0    0+0    
-ackermann.llvm.lib          0.09 0.0004   0.0005   0.0004   0.0045   |    6976     992      840        18736      |    *     10+0       0+0    0+0    
-objinst.llvm.lib            0.08 0.0014   0.0019   0.0052   0.0137   |    9480     19064    12216      54416      |    25    148+80     7+4    7+4    
-sumarray2d.llvm.lib         0.08 0.0012   0.0096   0.0109   0.0235   |    41416    47080    80696      171512     |    *     9+0        0+0    0+0    
-methcall.llvm.lib           0.08 0.0011   0.0016   0.0032   0.0108   |    3952     17528    8584       43720      |    23    104+52     7+4    7+4    
-heapsort.llvm.lib           0.08 0.0006   0.0008   0.0007   0.0063   |    2264     13720    2216       33016      |    *     33+0       2+0    2+0    
-fib2.llvm.lib               0.08 0.0005   0.0006   0.0004   0.0048   |    1776     5312     1080       23992      |    *     14+0       0+0    0+0    
-tsp.llvm.lib                0.07 0.0036   0.0035   0.0041   0.0197   |    17304    13808    17968      63704      |    18    95+1       4+0    4+0    
-random.llvm.lib             0.07 0.0005   0.0006   0.0005   0.0066   |    1584     4704     5752       25264      |    *     21+0       2+0    2+0    
-pi.llvm.lib                 0.07 0.0004   0.0004   0.0005   0.0031   |    4744     1248     4368       10360      |    *     14+0       0+0    0+0    
-power.llvm.lib              0.06 0.0031   0.0063   0.0070   0.0251   |    19440    28024    23544      86832      |    *     146+0      4+0    4+0    
-bisort.llvm.lib             0.06 0.0019   0.0036   0.0026   0.0168   |    12776    18296    6808       48952      |    *     89+0       4+0    4+0    
-matrixTranspose.llvm.lib    0.06 0.0005   0.0019   0.0025   0.0065   |    9136     14520    25336      48992      |    *     10+0       1+0    1+0    
-printargs.llvm.lib          0.06 0.0003   0.0003   0.0003   0.0021   |    888      504      512        1904       |    *     5+0        0+0    0+0    
-perimeter.llvm.lib          0.05 0.0026   0.0042   0.0044   0.0220   |    13968    12464    3928       43016      |    *     35+0       1+0    1+0    
-mst.llvm.lib                0.05 0.0026   0.0040   0.0052   0.0227   |    16520    25840    14016      71048      |    10    217+1      9+0    9+0    
-sumarray.llvm.lib           0.05 0.0002   0.0003   0.0002   0.0020   |    976      3424     464        6976       |    3     5+0        0+0    0+0    
-treeadd.llvm.lib            0.03 0.0010   0.0011   0.0009   0.0085   |    7928     6424     2088       28432      |    *     27+0       1+0    1+0    
-matrix.llvm.lib             0.02 0.0020   0.0013   0.0014   0.0090   |    7856     10416    2200       36232      |    *     32+0       0+0    0+0    
-sumarraymalloc.llvm.lib     0.02 0.0006   0.0007   0.0005   0.0056   |    2032     5984     1368       23472      |    *     17+0       0+0    0+0    
-</pre><p>
-
-
-
-<hr>
-<a name="20021106"><h2>Nov 6, 2002:</h2>
-
-Notes: Debug build, no globals graph, no array collapsing.<p>
-
-<pre>
-Name:                         LocTime:  BUTime:   TDTime:   TotTime:  AnlzTime:      LocSize:  BUSize:   TDSize:   TotSize:    NumFold NumNodes  main    __main  
-ackermann.llvm.lib            0.0004    0.0005    0.0004    0.0045    0m0.040s  |    6976      992       840       18736     |    *    10+0      0+0     0+0     
-ary3.llvm.lib                 0.0008    0.0012    0.0012    0.0074    0m0.034s  |    7992      7808      2416      34264     |    6    37+0      0+0     0+0     
-fib2.llvm.lib                 0.0005    0.0006    0.0004    0.0047    0m0.019s  |    1776      5312      1080      23992     |    *    14+0      0+0     0+0     
-hash.llvm.lib                 0.0020    0.0031    0.0036    0.0157    0m0.046s  |    17488     23928     12584     67400     |    *    131+0     2+0     2+0     
-heapsort.llvm.lib             0.0006    0.0008    0.0007    0.0061    0m0.023s  |    2264      13720     2216      33016     |    *    33+0      2+0     2+0     
-hello.llvm.lib                0.0002    0.0002    0.0002    0.0015    0m0.014s  |    504       2816      336       3656      |    *    2+0       0+0     0+0     
-lists.llvm.lib                0.0029    0.0057    0.0057    0.0203    0m0.077s  |    22272     14264     12128     60688     |    57   38+0      0+0     0+0     
-llubenchmark.llvm.lib         0.0012    0.0011    0.0017    0.0111    0m0.036s  |    9680      2144      9944      32776     |    *    49+8      4+1     4+1     
-matrix.llvm.lib               0.0008    0.0013    0.0014    0.0079    0m0.038s  |    7848      10416     2200      36176     |    *    32+0      0+0     0+0     
-matrixTranspose.llvm.lib      0.0004    0.0015    0.0019    0.0054    0m0.031s  |    9136      14520     25336     48992     |    *    10+0      1+0     1+0     
-methcall.llvm.lib             0.0010    0.0018    0.0030    0.0108    0m0.080s  |    3952      17528     9024      44160     |    30   112+52    7+4     7+4     
-objinst.llvm.lib              0.0011    0.0018    0.0058    0.0149    0m0.061s  |    9480      19064     13192     55392     |    37   163+80    7+4     7+4     
-pi.llvm.lib                   0.0005    0.0004    0.0005    0.0032    0m0.027s  |    4744      1248      4368      10360     |    *    14+0      0+0     0+0     
-printargs.llvm.lib            0.0003    0.0005    0.0003    0.0023    0m0.042s  |    888       504       512       1904      |    *    5+0       0+0     0+0     
-random.llvm.lib               0.0005    0.0005    0.0005    0.0056    0m0.032s  |    1584      4704      5752      25264     |    *    21+0      2+0     2+0     
-sumarray.llvm.lib             0.0002    0.0003    0.0002    0.0020    0m0.034s  |    976       3424      464       6976      |    3    5+0       0+0     0+0     
-sumarray2d.llvm.lib           0.0010    0.0077    0.0111    0.0216    0m0.047s  |    41416     47080     80696     171512    |    *    9+0       0+0     0+0     
-sumarraymalloc.llvm.lib       0.0007    0.0007    0.0005    0.0054    0m0.032s  |    2032      5984      1368      23472     |    *    17+0      0+0     0+0     
-indvars.llvm.lib              0.0018    0.0189    0.0264    0.0490    0m0.065s  |    82040     87944     160872    333400    |    *    12+0      0+0     0+0     
-bh.llvm.lib                   0.0113    0.0128    0.0163    0.0597    0m0.148s  |    55112     75768     42928     240056    |    74   400+5     11+0    11+0    
-bisort.llvm.lib               0.0018    0.0024    0.0024    0.0123    0m0.051s  |    12776     18296     6808      48952     |    *    89+0      4+0     4+0     
-em3d.llvm.lib                 0.0035    0.0098    0.0196    0.0490    0m0.103s  |    33816     49744     54144     146112    |    10   518+33    14+1    14+1    
-health.llvm.lib               0.0033    0.0061    0.0057    0.0226    0m0.088s  |    28432     27992     12640     83992     |    72   151+1     6+0     6+0     
-mst.llvm.lib                  0.0025    0.0039    0.0050    0.0192    0m0.074s  |    16520     25840     14016     71048     |    10   217+1     9+0     9+0     
-perimeter.llvm.lib            0.0020    0.0032    0.0025    0.0154    0m0.045s  |    13968     12720     3928      43272     |    *    35+0      1+0     1+0     
-power.llvm.lib                0.0027    0.0039    0.0060    0.0232    0m0.062s  |    20960     30136     23504     82696     |    *    146+0     4+0     4+0     
-treeadd.llvm.lib              0.0009    0.0010    0.0008    0.0070    0m0.054s  |    7928      6424      2088      28432     |    *    27+0      1+0     1+0     
-tsp.llvm.lib                  0.0035    0.0034    0.0032    0.0187    0m0.064s  |    17304     13808     17968     63704     |    18   95+1      4+0     4+0     
-voronoi.llvm.lib              0.0093    0.0193    0.0567    0.1033    0m0.199s  |    78560     83336     116312    292200    |    19   1006+0    16+0    16+0    
-optimizer-eval.llvm.lib       0.0099    0.1017    0.4073    0.5492    0m0.674s  |    76736     140000    409448    644528    |    58   1259+23   7+0     7+0     
-sgefa.llvm.lib                0.0057    0.0283    0.0357    0.0863    0m0.153s  |    82280     96016     67728     270712    |    *    121+2     2+0     2+0     
-sieve.llvm.lib                0.0006    0.0020    0.0030    0.0096    0m0.033s  |    9872      13808     38872     76312     |    *    22+0      1+0     1+0     
-sim.llvm.lib                  0.0134    0.2127    1.1230    1.3938    0m1.559s  |    62864     98984     200600    457536    |    *    1807+206  71+7    71+7    
-164.gzip.llvm.lib             0.0225    0.0727    0.2910    0.4651    0m1.003s  |    235048    421864    1439120   2192624   |    17   9181+106  114+1   114+1   
-181.mcf.lib                   0.0121    0.0354    0.1096    0.1780    0m0.292s  |    120504    192920    545720    876032    |    195  753+0     14+0    14+0    
-197.parser.lib                analyze: ../../../include/llvm/Analysis/DSNode.h:74: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-254.gap.lib                   analyze: ../../../include/llvm/Analysis/DSNode.h:74: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-255.vortex.lib                analyze: ../../../include/llvm/Analysis/DSNode.h:74: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-256.bzip2.lib                 0.0149    0.0604    0.6503    0.7810    0m1.027s  |    210880    387776    3371632   4041800   |    18   5005+76   65+1    65+1    
-300.twolf.lib                 0.1806    0.5248    42.5463   43.8329   0m45.785s |    522056    653816    10076992  11252864  |    1269 78066+4900 410+12  410+12  
-burg.llvm.lib                 analyze: ../../../include/llvm/Analysis/DSNode.h:74: DSNode::~DSNode(): Assertion `Referrers.empty() && "Referrers to dead node exist!"' failed.
-</pre>
-
-    <hr>
-    <address><a href="mailto:sabre@nondot.org">Chris Lattner</a></address>
-<!-- Created: Wed Nov  6 19:57:57 CST 2002 -->
-<!-- hhmts start -->
-Last modified: Thu Nov 14 20:00:50 CST 2002
-<!-- hhmts end -->
-  </body>
-</html>

llvm/docs/ExtendingLLVM.html

@@ -0,0 +1,238 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <title>Extending LLVM: Adding instructions, intrinsics, types, etc.</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+
+<body>
+
+<div class="doc_title">
+  Extending LLVM: Adding instructions, intrinsics, types, etc.
+</div>
+
+<ol>
+  <li><a href="#introduction">Introduction and Warning</a></li>
+  <li><a href="#intrinsic">Adding a new intrinsic function</a></li>
+  <li><a href="#instruction">Adding a new instruction</a></li>
+  <li><a href="#type">Adding a new type</a>
+  <ol>
+    <li><a href="#fund_type">Adding a new fundamental type</a></li>
+    <li><a href="#derived_type">Adding a new derived type</a></li>
+  </ol></li>
+</ol>
+
+<div class="doc_author">    
+  <p>Written by <a href="http://misha.brukman.net">Misha Brukman</a></p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="introduction">Introduction and Warning</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>During the course of using LLVM, you may wish to customize it for your
+research project or for experimentation. At this point, you may realize that
+you need to add something to LLVM, whether it be a new fundamental type, a new
+intrinsic function, or a whole new instruction.</p>
+
+<p>When you come to this realization, stop and think. Do you really need to
+extend LLVM? Is it a new fundamental capability that LLVM does not support at
+its current incarnation or can it be synthesized from already pre-existing LLVM
+elements? If you are not sure, ask on the <a
+href="http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev">LLVM-dev</a> list. The
+reason is that extending LLVM will get involved as you need to update all the
+different passes that you intend to use with your extension, and there are
+<em>many</em> LLVM analyses and transformations, so it may be quite a bit of
+work.</p>
+
+<p>Adding an <a href="#intrinsic">intrinsic function</a> is easier than adding
+an instruction, and is transparent to optimization passes which treat it as an
+unanalyzable function.  If your added functionality can be expressed as a
+function call, an intrinsic function is the method of choice for LLVM
+extension.</p>
+
+<p>Before you invest a significant amount of effort into a non-trivial
+extension, <span class="doc_warning">ask on the list</span> if what you are
+looking to do can be done with already-existing infrastructure, or if maybe
+someone else is already working on it. You will save yourself a lot of time and
+effort by doing so.</p>
+
+<p>Finally, these are my notes, and since my extensions are not complete, I may
+be missing steps. If you find some omissions, please let me know <a
+href="http://misha.brukman.net/contact.html">directly</a> or post on <a
+href="http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev">LLVM-dev</a>.</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="intrinsic">Adding a new intrinsic function</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>Adding a new intrinsic function to LLVM is much easier than adding a new
+instruction.  Almost all extensions to LLVM should start as an intrinsic
+function and then be turned into an instruction if warranted.</p>
+
+<ol>
+<li><tt>llvm/docs/LangRef.html</tt>:
+    Document the intrinsic.  Decide whether it is code generator specific and
+    what the restrictions are.  Talk to other people about it so that you are
+    sure it's a good idea.</li>
+
+<li><tt>llvm/include/llvm/Intrinsics.h</tt>:
+    add an enum in the <tt>llvm::Intrinsic</tt> namespace</li>
+
+<li><tt>llvm/lib/CodeGen/IntrinsicLowering.cpp</tt>:
+    implement the lowering for this intrinsic</li>
+
+<li><tt>llvm/lib/VMCore/Verifier.cpp</tt>:
+    Add code to check the invariants of the intrinsic are respected.</li>
+
+<li><tt>llvm/lib/VMCore/Function.cpp (<tt>Function::getIntrinsicID()</tt>)</tt>:
+    Identify the new intrinsic function, returning the enum for the intrinsic
+    that you added.</li>
+
+<li><tt>llvm/lib/Analysis/BasicAliasAnalysis.cpp</tt>: If the new intrinsic does
+    not access memory or does not write to memory, add it to the relevant list
+    of functions.</li>
+
+<li><tt>llvm/lib/Transforms/Utils/Local.cpp</tt>: If it is possible to constant
+    propagate your intrinsic, add support to it in the
+    <tt>canConstantFoldCallTo</tt> and <tt>ConstantFoldCall</tt> functions.</li>
+
+<li>Test your intrinsic</li>
+<li><tt>llvm/test/Regression/*</tt>: add your test cases to the test suite.</li>
+</ol>
+
+<p>If this intrinsic requires code generator support (ie, it cannot be lowered).
+You should also add support to the code generator in question.</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="instruction">Adding a new instruction</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p><span class="doc_warning">WARNING: adding instructions changes the bytecode
+format, and it will take some effort to maintain compatibility with
+the previous version.</span> Only add an instruction if it is absolutely
+necessary.</p>
+
+<ol>
+
+<li><tt>llvm/include/llvm/Instruction.def</tt>:
+    add a number for your instruction and an enum name</li>
+
+<li><tt>llvm/include/llvm/Instructions.h</tt>:
+    add a definition for the class that will represent your instruction</li>
+
+<li><tt>llvm/include/llvm/Support/InstVisitor.h</tt>:
+    add a prototype for a visitor to your new instruction type</li>
+
+<li><tt>llvm/lib/AsmParser/Lexer.l</tt>:
+    add a new token to parse your instruction from assembly text file</li>
+
+<li><tt>llvm/lib/AsmParser/llvmAsmParser.y</tt>:
+    add the grammar on how your instruction can be read and what it will
+    construct as a result</li>
+
+<li><tt>llvm/lib/Bytecode/Reader/InstructionReader.cpp</tt>:
+    add a case for your instruction and how it will be parsed from bytecode</li>
+
+<li><tt>llvm/lib/VMCore/Instruction.cpp</tt>:
+    add a case for how your instruction will be printed out to assembly</li>
+
+<li><tt>llvm/lib/VMCore/Instructions.cpp</tt>:
+    implement the class you defined in <tt>llvm/include/llvm/Instructions.h</tt></li>
+
+</ol>
+
+<p>Also, you need to implement (or modify) any analyses or passes that you want
+to understand this new instruction.</p>
+
+</div>
+
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="type">Adding a new type</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p><span class="doc_warning">WARNING: adding new types changes the bytecode
+format, and will break compatibility with currently-existing LLVM
+installations.</span> Only add new types if it is absolutely necessary.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="fund_type">Adding a fundamental type</a>
+</div>
+
+<div class="doc_text">
+
+<ol>
+
+<li><tt>llvm/include/llvm/Type.def</tt>:
+    add enum for the type</li>
+
+<li><tt>llvm/include/llvm/Type.h</tt>:
+    add ID number for the new type; add static <tt>Type*</tt> for this type</li>
+
+<li><tt>llvm/lib/VMCore/Type.cpp</tt>:
+    add mapping from <tt>TypeID</tt> =&gt; <tt>Type*</tt>;
+    initialize the static <tt>Type*</tt></li>
+
+<li><tt>llvm/lib/AsmReader/Lexer.l</tt>:
+    add ability to parse in the type from text assembly</li>
+
+<li><tt>llvm/lib/AsmReader/llvmAsmParser.y</tt>:
+    add a token for that type</li>
+
+</ol>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="derived_type">Adding a derived type</a>
+</div>
+
+<div class="doc_text">
+
+<p>TODO</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" /></a>
+
+  <a href="http://misha.brukman.net">Misha Brukman</a><br>
+  <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a>
+  <br>
+  Last modified: $Date$
+</address>
+
+</body>
+</html>

llvm/docs/FAQ.html

@@ -1,145 +1,533 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <title>LLVM: Frequently Asked Questions</title>
+  <style type="text/css">
+    @import url("llvm.css");
+    .question { font-weight: bold }
+    .answer   { margin-left: 2em  }
+  </style>
+</head>
+<body>
 
-<h1>
-<center>
-LLVM: Frequently Asked Questions
-</center>
-</h1>
+<div class="doc_title">
+  LLVM: Frequently Asked Questions
+</div>
 
-<hr>
-
-<!--=====================================================================-->
-<h2>
-<a name="source">Source Code</a>
-</h2>
-<!--=====================================================================-->
-
-<dl compact>
-	<dt> <b>In what language is LLVM written?</b>
-	<dd>
-	All of the LLVM tools and libraries are written in C++ with extensive use
-	of the STL.
-	<p>
-
-	<dt><b>How portable is the LLVM source code?</b>
-	<dd>
-	The LLVM source code should be portable to most modern UNIX-like operating
-	systems.  Most of the code is written in standard C++ with operating
-	system services abstracted to a support library.  The tools required to
-	build and test LLVM have been ported to a plethora of platforms.
-	<p>
-	Some porting problems may exist in the following areas:
-	<ul>
-		<li>The GCC front end code is not as portable as the LLVM suite, so it
-		may not compile as well on unsupported platforms.
-
-		<p>
-
-		<li>The Python test classes are more UNIX-centric than they should be,
-		so porting to non-UNIX like platforms (i.e. Windows, MacOS 9) will
-		require some effort.
-		<p>
-
-		<li>The LLVM build system relies heavily on UNIX shell tools, like the
-		Bourne Shell and sed.  Porting to systems without these tools (MacOS 9,
-		Plan 9) will require more effort.
-	</ul>
-</dl>
-
-<hr>
-
-<!--=====================================================================-->
-<h2>
-<a name="build">Build Problems</a>
-</h2>
-<!--=====================================================================-->
-
-<dl compact>
-	<dt><b>When I run configure, it finds the wrong C compiler.</b>
-	<dd>
-	The <tt>configure</tt> script attempts to locate first <tt>gcc</tt> and
-	then <tt>cc</tt>, unless it finds compiler paths set in <tt>CC</tt> and
-	<tt>CXX</tt> for the C and C++ compiler, respectively.
-
-	If <tt>configure</tt> finds the wrong compiler, either adjust your
-	<tt>PATH</tt> environment variable or set <tt>CC</tt> and <tt>CXX</tt>
-	explicitly.
-	<p>
-
-	<dt><b>I compile the code, and I get some error about /localhome</b>.
-	<dd>
-	There are several possible causes for this.  The first is that you
-	didn't set a pathname properly when using <tt>configure</tt>, and it
-	defaulted to a pathname that we use on our research machines.
-	<p>
-	Another possibility is that we hardcoded a path in our Makefiles.  If
-	you see this, please email the LLVM bug mailing list with the name of
-	the offending Makefile and a description of what is wrong with it.
-
-	<dt><b>The <tt>configure</tt> script finds the right C compiler, but it
-	uses the LLVM linker from a previous build.  What do I do?</b>
-	<dd>
-	The <tt>configure</tt> script uses the <tt>PATH</tt> to find
-	executables, so if it's grabbing the wrong linker/assembler/etc, there
-	are two ways to fix it:
+<ol>
+  <li><a href="#license">License</a>
   <ol>
-		<li>Adjust your <tt>PATH</tt> environment variable so that the
-		correct program appears first in the <tt>PATH</tt>.  This may work,
-		but may not be convenient when you want them <i>first</i> in your
-		path for other work.
-		<p>
+  <li>Why are the LLVM source code and the front-end distributed under different
+  licenses?</li>
+  <li>Does the University of Illinois Open Source License really qualify as an
+  "open source" license?</li>
+  <li>Can I modify LLVM source code and redistribute the modified source?</li>
+  <li>Can I modify LLVM source code and redistribute binaries or other tools
+  based on it, without redistributing the source?</li>
+  </ol></li>
 
-		<li>Run <tt>configure</tt> with an alternative <tt>PATH</tt> that
-		is correct.  In a Borne compatible shell, the syntax would be:
-		<p>
-		<tt>PATH=<the path without the bad program> ./configure ...</tt>
-		<p>
-		This is still somewhat inconvenient, but it allows
-		<tt>configure</tt> to do its work without having to adjust your
-		<tt>PATH</tt> permanently.
+  <li><a href="#source">Source code</a>
+  <ol>
+  <li>In what language is LLVM written?</li>
+  <li>How portable is the LLVM source code?</li>
+  </ol></li>
+
+  <li><a href="#build">Build Problems</a>
+  <ol>
+  <li>When I run configure, it finds the wrong C compiler.</li>
+  <li>I compile the code, and I get some error about <tt>/localhome</tt>.</li>
+  <li>The <tt>configure</tt> script finds the right C compiler, but it uses the
+  LLVM linker from a previous build.  What do I do?</li>
+  <li>When creating a dynamic library, I get a strange GLIBC error.</li>
+  <li>I've updated my source tree from CVS, and now my build is trying to use a
+  file/directory that doesn't exist.</li>
+  <li>I've modified a Makefile in my source tree, but my build tree keeps using
+  the old version.  What do I do?</li>
+  <li>I've upgraded to a new version of LLVM, and I get strange build
+  errors.</li>
+  <li>I've built LLVM and am testing it, but the tests freeze.</li>
+  <li>Why do test results differ when I perform different types of builds?</li>
+  <li>Compiling LLVM with GCC 3.3.2 fails, what should I do?</li>
+  <li>When I use the test suite, all of the C Backend tests fail.  What is
+      wrong?</li>
+  </ol></li>
+
+  <li><a href="#cfe">Using the GCC Front End</a>
+  <ol>
+    <li>
+    When I compile software that uses a configure script, the configure script
+    thinks my system has all of the header files and libraries it is testing
+    for.  How do I get configure to work correctly?
+    </li>
+
+    <li>
+    When I compile code using the LLVM GCC front end, it complains that it
+    cannot find libcrtend.a.
+    </li>
   </ol>
+  </li>
 
-	<dt><b>When creating a dynamic library, I get a strange GLIBC error.</b>
-	<dd>
-	Under some operating systems (i.e. Linux), libtool does not work correctly
-	if GCC was compiled with the --disable-shared option.  To work around this,
-	install your own version of GCC that has shared libraries enabled by
-	default.
-	<p>
+  <li><a href="#cfe_code">Questions about code generated by the GCC front-end</a>
+  <ol>
+     <li>What is this <tt>__main()</tt> call that gets inserted into
+         <tt>main()</tt>?</li>
+     <li>Where did all of my code go??</li>
+     <li>What is this <tt>llvm.global_ctors</tt> and
+          <tt>_GLOBAL__I__tmp_webcompile...</tt> stuff that happens when I
+          #include &lt;iostream&gt;?</li>
+  </ol>
+  </li>
+</ol>
 
-	<dt><b>I've updated my source tree from CVS, and now my build is trying to
-	use a file/directory that doesn't exist.</b>
-	<dd>
-	You need to re-run configure in your object directory.  When new Makefiles
-	are added to the source tree, they have to be copied over to the object
-	tree in order to be used by the build.
-	<p>
+<div class="doc_author">
+  <p>Written by <a href="http://llvm.cs.uiuc.edu">The LLVM Team</a></p>
+</div>
 
-	<dt><b>I've modified a Makefile in my source tree, but my build tree keeps
-	using the old version.  What do I do?</b>
-	<dd>
-	If the Makefile already exists in your object tree, you can just run the
-	following command in the top level directory of your object tree:
-	<p>
-	<tt>./config.status &lt;relative path to Makefile&gt;</tt>
-	<p>
-	If the Makefile is new, you will have to modify the configure script to copy
-	it over.
-	<p>
 
-	<dt><b>I've upgraded to a new version of LLVM, and I get strange build
-	errors.</b>
-	<dd>
-	Sometimes changes to the LLVM source code alters how the build system
-	works.  Changes in libtool, autoconf, or header file dependencies are
-	especially prone to this sort of problem.
-	<p>
-	The best thing to try is to remove the old files and re-build.  In most
-	cases, this takes care of the problem.  To do this, just type <tt>make
-	clean</tt> and then <tt>make</tt> in the directory that fails to build.
-	<p>
-</dl>
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="license">License</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="question">
+<p>Why are the LLVM source code and the front-end distributed under different
+licenses?</p>
+</div>
+	
+<div class="answer">
+<p>The C/C++ front-ends are based on GCC and must be distributed under the GPL.
+Our aim is to distribute LLVM source code under a <em>much less restrictive</em>
+license, in particular one that does not compel users who distribute tools based
+on modifying the source to redistribute the modified source code as well.</p>
+</div>
+
+<div class="question">
+<p>Does the University of Illinois Open Source License really qualify as an
+"open source" license?</p>
+</div>
+
+<div class="answer">
+<p>Yes, the license is <a
+href="http://www.opensource.org/licenses/UoI-NCSA.php">certified</a> by the Open
+Source Initiative (OSI).</p>
+</div>
+
+<div class="question">
+<p>Can I modify LLVM source code and redistribute the modified source?</p>
+</div>
+
+<div class="answer">
+<p>Yes.  The modified source distribution must retain the copyright notice and
+follow the three bulletted conditions listed in the <a
+href="http://llvm.cs.uiuc.edu/releases/1.2/LICENSE.TXT">LLVM license</a>.</p>
+</div>
+
+<div class="question">
+<p>Can I modify LLVM source code and redistribute binaries or other tools based
+on it, without redistributing the source?</p>
+</div>
+
+<div class="answer">
+<p>Yes, this is why we distribute LLVM under a less restrictive license than
+GPL, as explained in the first question above.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="source">Source Code</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="question">
+<p>In what language is LLVM written?</p>
+</div>
+
+<div class="answer">
+<p>All of the LLVM tools and libraries are written in C++ with extensive use of
+the STL.</p>
+</div>
+
+<div class="question">
+<p>How portable is the LLVM source code?</p>
+</div>
+
+<div class="answer">
+<p>The LLVM source code should be portable to most modern UNIX-like operating
+systems.  Most of the code is written in standard C++ with operating system
+services abstracted to a support library.  The tools required to build and test
+LLVM have been ported to a plethora of platforms.</p>
+
+<p>Some porting problems may exist in the following areas:</p>
+
+<ul>
+
+  <li>The GCC front end code is not as portable as the LLVM suite, so it may not
+  compile as well on unsupported platforms.</li>
+
+  <li>The Python test classes are more UNIX-centric than they should be, so
+  porting to non-UNIX like platforms (i.e. Windows, MacOS 9) will require some
+  effort.</li>
+
+  <li>The LLVM build system relies heavily on UNIX shell tools, like the Bourne
+  Shell and sed.  Porting to systems without these tools (MacOS 9, Plan 9) will
+  require more effort.</li>
+
+</ul>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="build">Build Problems</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="question">
+<p>When I run configure, it finds the wrong C compiler.</p>
+</div>
+
+<div class="answer">
+
+<p>The <tt>configure</tt> script attempts to locate first <tt>gcc</tt> and then
+<tt>cc</tt>, unless it finds compiler paths set in <tt>CC</tt> and <tt>CXX</tt>
+for the C and C++ compiler, respectively.</p>
+
+<p>If <tt>configure</tt> finds the wrong compiler, either adjust your
+<tt>PATH</tt> environment variable or set <tt>CC</tt> and <tt>CXX</tt>
+explicitly.</p>
+
+</div>
+
+<div class="question">
+<p>I compile the code, and I get some error about <tt>/localhome</tt>.</p>
+</div>
+
+<div class="answer">
+
+<p>There are several possible causes for this.  The first is that you didn't set
+a pathname properly when using <tt>configure</tt>, and it defaulted to a
+pathname that we use on our research machines.</p>
+
+<p>Another possibility is that we hardcoded a path in our Makefiles.  If you see
+this, please email the LLVM bug mailing list with the name of the offending
+Makefile and a description of what is wrong with it.</p>
+
+</div>
+
+<div class="question">
+<p>The <tt>configure</tt> script finds the right C compiler, but it uses the
+LLVM linker from a previous build.  What do I do?</p>
+</div>
+
+<div class="answer">
+<p>The <tt>configure</tt> script uses the <tt>PATH</tt> to find executables, so
+if it's grabbing the wrong linker/assembler/etc, there are two ways to fix
+it:</p>
+
+<ol>
+		
+  <li><p>Adjust your <tt>PATH</tt> environment variable so that the correct
+  program appears first in the <tt>PATH</tt>.  This may work, but may not be
+  convenient when you want them <i>first</i> in your path for other
+  work.</p></li>
+
+  <li><p>Run <tt>configure</tt> with an alternative <tt>PATH</tt> that is
+  correct. In a Borne compatible shell, the syntax would be:</p>
+		
+      <p><tt>PATH=[the path without the bad program] ./configure ...</tt></p>
+
+      <p>This is still somewhat inconvenient, but it allows <tt>configure</tt>
+      to do its work without having to adjust your <tt>PATH</tt>
+      permanently.</p></li>
+	
+</ol>
+
+</div>
+
+<div class="question">
+<p>When creating a dynamic library, I get a strange GLIBC error.</p>
+</div>
+
+<div class="answer">
+<p>Under some operating systems (i.e. Linux), libtool does not work correctly if
+GCC was compiled with the --disable-shared option.  To work around this, install
+your own version of GCC that has shared libraries enabled by default.</p>
+</div>
+
+<div class="question">
+<p>I've updated my source tree from CVS, and now my build is trying to use a
+file/directory that doesn't exist.</p>
+</div>
+
+<div class="answer">
+<p>You need to re-run configure in your object directory.  When new Makefiles
+are added to the source tree, they have to be copied over to the object tree in
+order to be used by the build.</p>
+</div>
+
+<div class="question">
+<p>I've modified a Makefile in my source tree, but my build tree keeps using the
+old version.  What do I do?</p>
+</div>
+
+<div class="answer">
+
+<p>If the Makefile already exists in your object tree, you
+can just run the following command in the top level directory of your object
+tree:</p>
+
+<p><tt>./config.status &lt;relative path to Makefile&gt;</tt><p>
+
+<p>If the Makefile is new, you will have to modify the configure script to copy
+it over.</p>
+
+</div>
+
+<div class="question">
+<p>I've upgraded to a new version of LLVM, and I get strange build errors.</p>
+</div>
+
+<div class="answer">
+
+<p>Sometimes, changes to the LLVM source code alters how the build system works.
+Changes in libtool, autoconf, or header file dependencies are especially prone
+to this sort of problem.</p>
+
+<p>The best thing to try is to remove the old files and re-build.  In most
+cases, this takes care of the problem.  To do this, just type <tt>make
+clean</tt> and then <tt>make</tt> in the directory that fails to build.</p>
+
+</div>
+
+<div class="question">
+<p>I've built LLVM and am testing it, but the tests freeze.</p>
+</div>
+
+<div class="answer">
+
+<p>This is most likely occurring because you built a profile or release
+(optimized) build of LLVM and have not specified the same information on the
+<tt>gmake</tt> command line.</p>
+
+<p>For example, if you built LLVM with the command:</p>
+
+<p><tt>gmake ENABLE_PROFILING=1</tt>
+
+<p>...then you must run the tests with the following commands:</p>
+
+<p><tt>cd llvm/test<br>gmake  ENABLE_PROFILING=1</tt></p>
+
+</div>
+
+<div class="question">
+<p>Why do test results differ when I perform different types of builds?</p>
+</div>
+
+<div class="answer">
+
+<p>The LLVM test suite is dependent upon several features of the LLVM tools and
+libraries.</p>
+
+<p>First, the debugging assertions in code are not enabled in optimized or
+profiling builds.  Hence, tests that used to fail may pass.</p>
+	
+<p>Second, some tests may rely upon debugging options or behavior that is only
+available in the debug build.  These tests will fail in an optimized or profile
+build.</p>
+
+</div>
+
+<div class="question">
+<p>Compiling LLVM with GCC 3.3.2 fails, what should I do?</p>
+</div>
+
+<div class="answer">
+<p>This is <a href="http://gcc.gnu.org/PR?13392">a bug in GCC</a>, and 
+   affects projects other than LLVM.  Try upgrading or downgrading your GCC.</p>
+</div>
+
+<div class="question">
+<p>
+When I use the test suite, all of the C Backend tests fail.  What is
+wrong?
+</p>
+</div>
+
+<div class="answer">
+<p>
+If you build LLVM and the C Backend tests fail in <tt>llvm/test/Programs</tt>,
+then chances are good that the directory pointed to by the LLVM_LIB_SEARCH_PATH
+environment variable does not contain the libcrtend.a library.
+</p>
+
+<p>
+To fix it, verify that LLVM_LIB_SEARCH_PATH points to the correct directory
+and that libcrtend.a is inside.  For pre-built LLVM GCC front ends, this
+should be the absolute path to
+<tt>cfrontend/&lt;<i>platform</i>&gt;/llvm-gcc/bytecode-libs</tt>.  If you've
+built your own LLVM GCC front end, then ensure that you've built and installed
+the libraries in <tt>llvm/runtime</tt> and have LLVM_LIB_SEARCH_PATH pointing
+to the <tt>LLVMGCCDIR/bytecode-libs</tt> subdirectory.
+</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="cfe">Using the GCC Front End</a>
+</div>
+
+<div class="question">
+<p>
+When I compile software that uses a configure script, the configure script
+thinks my system has all of the header files and libraries it is testing for.
+How do I get configure to work correctly?
+</p>
+</div>
+
+<div class="answer">
+<p>
+The configure script is getting things wrong because the LLVM linker allows
+symbols to be undefined at link time (so that they can be resolved during JIT
+or translation to the C back end).  That is why configure thinks your system
+"has everything."
+</p>
+<p>
+To work around this, perform the following steps:
+</p>
+
+<ol>
+  <li>
+  Make sure the CC and CXX environment variables contains the full path to the
+  LLVM GCC front end.
+  </li>
+
+  <li>
+  Make sure that the regular C compiler is first in your PATH.
+  </li>
+
+  <li>
+  Add the string "-Wl,-native" to your CFLAGS environment variable.
+  </li>
+</ol>
+
+<p>
+This will allow the gccld linker to create a native code executable instead of
+a shell script that runs the JIT.  Creating native code requires standard
+linkage, which in turn will allow the configure script to find out if code is
+not linking on your system because the feature isn't available on your system.
+</p>
+</div>
+
+<div class="question">
+<p>
+When I compile code using the LLVM GCC front end, it complains that it cannot
+find libcrtend.a.
+</p>
+</div>
+
+<div class="answer">
+<p>
+In order to find libcrtend.a, you must have the directory in which it lives in
+your LLVM_LIB_SEARCH_PATH environment variable.  For the binary distribution of
+the LLVM GCC front end, this will be the full path of the bytecode-libs
+directory inside of the LLVM GCC distribution.
+</p>
+</div>
+
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="cfe_code">Questions about code generated by the GCC front-end</a>
+</div>
+
+<div class="question"><p>
+What is this <tt>__main()</tt> call that gets inserted into <tt>main()</tt>?
+</p></div>
+
+<div class="answer">
+<p>
+The <tt>__main</tt> call is inserted by the C/C++ compiler in order to guarantee
+that static constructors and destructors are called when the program starts up
+and shuts down.  In C, you can create static constructors and destructors by
+using GCC extensions, and in C++ you can do so by creating a global variable
+whose class has a ctor or dtor.
+</p>
+
+<p>
+The actual implementation of <tt>__main</tt> lives in the
+<tt>llvm/runtime/GCCLibraries/crtend/</tt> directory in the source-base, and is
+linked in automatically when you link the program.
+</p>
+</div>
+
+<!--=========================================================================-->
+
+<div class="question"><p>
+Where did all of my code go??
+</p></div>
+
+<div class="answer">
+<p>
+If you are using the LLVM demo page, you may often wonder what happened to all
+of the code that you typed in.  Remember that the demo script is running the
+code through the LLVM optimizers, so if your code doesn't actually do anything
+useful, it might all be deleted.
+</p>
+
+<p>
+To prevent this, make sure that the code is actually needed.  For example, if
+you are computing some expression, return the value from the function instead of
+leaving it in a local variable.  If you really want to constrain the optimizer,
+you can read from and assign to <tt>volatile</tt> global variables.
+</p>
+</div>
+
+<!--=========================================================================-->
+
+<div class="question"><p>
+What is this <tt>llvm.global_ctors</tt> and <tt>_GLOBAL__I__tmp_webcompile...</tt> stuff that happens when I #include &lt;iostream&gt;?
+</p></div>
+
+<div class="answer">
+<p>
+If you #include the &lt;iostream&gt; header into a C++ translation unit, the
+file will probably use the <tt>std::cin</tt>/<tt>std::cout</tt>/... global
+objects.  However, C++ does not guarantee an order of initialization between
+static objects in different translation units, so if a static ctor/dtor in your
+.cpp file used <tt>std::cout</tt>, for example, the object would not necessarily
+be automatically initialized before your use.
+</p>
+
+<p>
+To make <tt>std::cout</tt> and friends work correctly in these scenarios, the
+STL that we use declares a static object that gets created in every translation
+unit that includes &lt;iostream&gt;.  This object has a static constructor and
+destructor that initializes and destroys the global iostream objects before they
+could possibly be used in the file.  The code that you see in the .ll file
+corresponds to the constructor and destructor registration code.
+</p>
+
+<p>
+If you would like to make it easier to <b>understand</b> the LLVM code generated
+by the compiler in the demo page, consider using printf instead of iostreams to
+print values.
+</p>
+</div>
+
+<!-- *********************************************************************** -->
+
 <hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
+
+  <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
 
 </body>
 </html>

llvm/docs/GarbageCollection.html

@@ -0,0 +1,533 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <title>Accurate Garbage Collection with LLVM</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+<body>
+
+<div class="doc_title">
+  Accurate Garbage Collection with LLVM
+</div>
+
+<ol>
+  <li><a href="#introduction">Introduction</a>
+    <ul>
+    <li><a href="#feature">GC features provided and algorithms supported</a></li>
+    </ul>
+  </li>
+
+  <li><a href="#interfaces">Interfaces for user programs</a>
+    <ul>
+    <li><a href="#roots">Identifying GC roots on the stack: <tt>llvm.gcroot</tt></a></li>
+    <li><a href="#allocate">Allocating memory from the GC</a></li>
+    <li><a href="#barriers">Reading and writing references to the heap</a></li>
+    <li><a href="#explicit">Explicit invocation of the garbage collector</a></li>
+    </ul>
+  </li>
+
+  <li><a href="#gcimpl">Implementing a garbage collector</a>
+    <ul>
+    <li><a href="#llvm_gc_readwrite">Implementing <tt>llvm_gc_read</tt> and <tt>llvm_gc_write</tt></a></li>
+    <li><a href="#callbacks">Callback functions used to implement the garbage collector</a></li>
+    </ul>
+  </li>
+  <li><a href="#gcimpls">GC implementations available</a>
+    <ul>
+    <li><a href="#semispace">SemiSpace - A simple copying garbage collector</a></li>
+    </ul>
+  </li>
+
+<!--
+  <li><a href="#codegen">Implementing GC support in a code generator</a></li>
+-->
+</ol>
+
+<div class="doc_author">
+  <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a></p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="introduction">Introduction</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>Garbage collection is a widely used technique that frees the programmer from
+having to know the life-times of heap objects, making software easier to produce
+and maintain.  Many programming languages rely on garbage collection for
+automatic memory management.  There are two primary forms of garbage collection:
+conservative and accurate.</p>
+
+<p>Conservative garbage collection often does not require any special support
+from either the language or the compiler: it can handle non-type-safe
+programming languages (such as C/C++) and does not require any special
+information from the compiler.  The [LINK] Boehm collector is an example of a
+state-of-the-art conservative collector.</p>
+
+<p>Accurate garbage collection requires the ability to identify all pointers in
+the program at run-time (which requires that the source-language be type-safe in
+most cases).  Identifying pointers at run-time requires compiler support to
+locate all places that hold live pointer variables at run-time, including the
+<a href="#roots">processor stack and registers</a>.</p>
+
+<p>
+Conservative garbage collection is attractive because it does not require any
+special compiler support, but it does have problems.  In particular, because the
+conservative garbage collector cannot <i>know</i> that a particular word in the
+machine is a pointer, it cannot move live objects in the heap (preventing the
+use of compacting and generational GC algorithms) and it can occasionally suffer
+from memory leaks due to integer values that happen to point to objects in the
+program.  In addition, some aggressive compiler transformations can break
+conservative garbage collectors (though these seem rare in practice).
+</p>
+
+<p>
+Accurate garbage collectors do not suffer from any of these problems, but they
+can suffer from degraded scalar optimization of the program.  In particular,
+because the runtime must be able to identify and update all pointers active in
+the program, some optimizations are less effective.  In practice, however, the
+locality and performance benefits of using aggressive garbage allocation
+techniques dominates any low-level losses.
+</p>
+
+<p>
+This document describes the mechanisms and interfaces provided by LLVM to
+support accurate garbage collection.
+</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="feature">GC features provided and algorithms supported</a>
+</div>
+
+<div class="doc_text">
+
+<p>
+LLVM provides support for a broad class of garbage collection algorithms,
+including compacting semi-space collectors, mark-sweep collectors, generational
+collectors, and even reference counting implementations.  It includes support
+for <a href="#barriers">read and write barriers</a>, and associating <a
+href="#roots">meta-data with stack objects</a> (used for tagless garbage
+collection).  All LLVM code generators support garbage collection, including the
+C backend.
+</p>
+
+<p>
+We hope that the primitive support built into LLVM is sufficient to support a
+broad class of garbage collected languages, including Scheme, ML, scripting
+languages, Java, C#, etc.  That said, the implemented garbage collectors may
+need to be extended to support language-specific features such as finalization,
+weak references, or other features.  As these needs are identified and
+implemented, they should be added to this specification.
+</p>
+
+<p>
+LLVM does not currently support garbage collection of multi-threaded programs or
+GC-safe points other than function calls, but these will be added in the future
+as there is interest.
+</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="interfaces">Interfaces for user programs</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>This section describes the interfaces provided by LLVM and by the garbage
+collector run-time that should be used by user programs.  As such, this is the
+interface that front-end authors should generate code for.
+</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="roots">Identifying GC roots on the stack: <tt>llvm.gcroot</tt></a>
+</div>
+
+<div class="doc_text">
+
+<div class="doc_code"><tt>
+  void %llvm.gcroot(&lt;ty&gt;** %ptrloc, &lt;ty2&gt;* %metadata)
+</tt></div>
+
+<p>
+The <tt>llvm.gcroot</tt> intrinsic is used to inform LLVM of a pointer variable
+on the stack.  The first argument contains the address of the variable on the
+stack, and the second contains a pointer to metadata that should be associated
+with the pointer (which <b>must</b> be a constant or global value address).  At
+runtime, the <tt>llvm.gcroot</tt> intrinsic stores a null pointer into the
+specified location to initialize the pointer.</p>
+
+<p>
+Consider the following fragment of Java code:
+</p>
+
+<pre>
+       {
+         Object X;   // A null-initialized reference to an object
+         ...
+       }
+</pre>
+
+<p>
+This block (which may be located in the middle of a function or in a loop nest),
+could be compiled to this LLVM code:
+</p>
+
+<pre>
+Entry:
+   ;; In the entry block for the function, allocate the
+   ;; stack space for X, which is an LLVM pointer.
+   %X = alloca %Object*
+   ...
+
+   ;; "CodeBlock" is the block corresponding to the start
+   ;;  of the scope above.
+CodeBlock:
+   ;; Initialize the object, telling LLVM that it is now live.
+   ;; Java has type-tags on objects, so it doesn't need any
+   ;; metadata.
+   call void %llvm.gcroot(%Object** %X, sbyte* null)
+   ...
+
+   ;; As the pointer goes out of scope, store a null value into
+   ;; it, to indicate that the value is no longer live.
+   store %Object* null, %Object** %X
+   ...
+</pre>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="allocate">Allocating memory from the GC</a>
+</div>
+
+<div class="doc_text">
+
+<div class="doc_code"><tt>
+  sbyte *%llvm_gc_allocate(unsigned %Size)
+</tt></div>
+
+<p>The <tt>llvm_gc_allocate</tt> function is a global function defined by the
+garbage collector implementation to allocate memory.  It returns a
+zeroed-out block of memory of the appropriate size.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="barriers">Reading and writing references to the heap</a>
+</div>
+
+<div class="doc_text">
+
+<div class="doc_code"><tt>
+  sbyte *%llvm.gcread(sbyte *, sbyte **)<br>
+  void %llvm.gcwrite(sbyte*, sbyte*, sbyte**)
+</tt></div>
+
+<p>Several of the more interesting garbage collectors (e.g., generational
+collectors) need to be informed when the mutator (the program that needs garbage
+collection) reads or writes object references into the heap.  In the case of a
+generational collector, it needs to keep track of which "old" generation objects
+have references stored into them.  The amount of code that typically needs to be
+executed is usually quite small (and not on the critical path of any 
+computation), so the overall performance impact of the inserted code is 
+tolerable.</p>
+
+<p>To support garbage collectors that use read or write barriers, LLVM provides
+the <tt>llvm.gcread</tt> and <tt>llvm.gcwrite</tt> intrinsics.  The first
+intrinsic has exactly the same semantics as a non-volatile LLVM load and the
+second has the same semantics as a non-volatile LLVM store, with the
+additions that they also take a pointer to the start of the memory
+object as an argument.  At code generation
+time, these intrinsics are replaced with calls into the garbage collector
+(<tt><a href="#llvm_gc_readwrite">llvm_gc_read</a></tt> and <tt><a
+href="#llvm_gc_readwrite">llvm_gc_write</a></tt> respectively), which are then
+inlined into the code.
+</p>
+
+<p>
+If you are writing a front-end for a garbage collected language, every load or
+store of a reference from or to the heap should use these intrinsics instead of
+normal LLVM loads/stores.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="initialize">Garbage collector startup and initialization</a>
+</div>
+
+<div class="doc_text">
+
+<div class="doc_code"><tt>
+  void %llvm_gc_initialize(unsigned %InitialHeapSize)
+</tt></div>
+
+<p>
+The <tt>llvm_gc_initialize</tt> function should be called once before any other
+garbage collection functions are called.  This gives the garbage collector the
+chance to initialize itself and allocate the heap spaces.  The initial heap size
+to allocate should be specified as an argument.
+</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="explicit">Explicit invocation of the garbage collector</a>
+</div>
+
+<div class="doc_text">
+
+<div class="doc_code"><tt>
+  void %llvm_gc_collect()
+</tt></div>
+
+<p>
+The <tt>llvm_gc_collect</tt> function is exported by the garbage collector
+implementations to provide a full collection, even when the heap is not
+exhausted.  This can be used by end-user code as a hint, and may be ignored by
+the garbage collector.
+</p>
+
+</div>
+
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="gcimpl">Implementing a garbage collector</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>
+Implementing a garbage collector for LLVM is fairly straight-forward.  The LLVM
+garbage collectors are provided in a form that makes them easy to link into the
+language-specific runtime that a language front-end would use.  They require
+functionality from the language-specific runtime to get information about <a
+href="#gcdescriptors">where pointers are located in heap objects</a>.
+</p>
+
+<p>The
+implementation must include the <a
+href="#allocate"><tt>llvm_gc_allocate</tt></a> and <a
+href="#explicit"><tt>llvm_gc_collect</tt></a> functions, and it must implement
+the <a href="#llvm_gc_readwrite">read/write barrier</a> functions as well.  To
+do this, it will probably have to <a href="#traceroots">trace through the roots
+from the stack</a> and understand the <a href="#gcdescriptors">GC descriptors
+for heap objects</a>.  Luckily, there are some <a href="#gcimpls">example
+implementations</a> available.
+</p>
+</div>
+
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="llvm_gc_readwrite">Implementing <tt>llvm_gc_read</tt> and <tt>llvm_gc_write</tt></a>
+</div>
+
+<div class="doc_text">
+  <div class="doc_code"><tt>
+    void *llvm_gc_read(void*, void **)<br>
+    void llvm_gc_write(void*, void *, void**)
+ </tt></div>
+
+<p>
+These functions <i>must</i> be implemented in every garbage collector, even if
+they do not need read/write barriers.  In this case, just load or store the
+pointer, then return.
+</p>
+
+<p>
+If an actual read or write barrier is needed, it should be straight-forward to
+implement it.
+</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="callbacks">Callback functions used to implement the garbage collector</a>
+</div>
+
+<div class="doc_text">
+<p>
+Garbage collector implementations make use of call-back functions that are
+implemented by other parts of the LLVM system.
+</p>
+</div>
+
+<!--_________________________________________________________________________-->
+<div class="doc_subsubsection">
+  <a name="traceroots">Tracing GC pointers from the program stack</a>
+</div>
+
+<div class="doc_text">
+  <div class="doc_code"><tt>
+     void llvm_cg_walk_gcroots(void (*FP)(void **Root, void *Meta));
+  </tt></div>
+
+<p>
+The <tt>llvm_cg_walk_gcroots</tt> function is a function provided by the code
+generator that iterates through all of the GC roots on the stack, calling the
+specified function pointer with each record.  For each GC root, the address of
+the pointer and the meta-data (from the <a
+href="#gcroot"><tt>llvm.gcroot</tt></a> intrinsic) are provided.
+</p>
+</div>
+
+<!--_________________________________________________________________________-->
+<div class="doc_subsubsection">
+  <a name="staticroots">Tracing GC pointers from static roots</a>
+</div>
+
+<div class="doc_text">
+TODO
+</div>
+
+
+<!--_________________________________________________________________________-->
+<div class="doc_subsubsection">
+  <a name="gcdescriptors">Tracing GC pointers from heap objects</a>
+</div>
+
+<div class="doc_text">
+<p>
+The three most common ways to keep track of where pointers live in heap objects
+are (listed in order of space overhead required):</p>
+
+<ol>
+<li>In languages with polymorphic objects, pointers from an object header are
+usually used to identify the GC pointers in the heap object.  This is common for
+object-oriented languages like Self, Smalltalk, Java, or C#.</li>
+
+<li>If heap objects are not polymorphic, often the "shape" of the heap can be
+determined from the roots of the heap or from some other meta-data [<a
+href="#appel89">Appel89</a>, <a href="#goldberg91">Goldberg91</a>, <a
+href="#tolmach94">Tolmach94</a>].  In this case, the garbage collector can
+propagate the information around from meta data stored with the roots.  This
+often eliminates the need to have a header on objects in the heap.  This is
+common in the ML family.</li>
+
+<li>If all heap objects have pointers in the same locations, or pointers can be
+distinguished just by looking at them (e.g., the low order bit is clear), no
+book-keeping is needed at all.  This is common for Lisp-like languages.</li>
+</ol>
+
+<p>The LLVM garbage collectors are capable of supporting all of these styles of
+language, including ones that mix various implementations.  To do this, it
+allows the source-language to associate meta-data with the <a
+href="#roots">stack roots</a>, and the heap tracing routines can propagate the
+information.  In addition, LLVM allows the front-end to extract GC information
+from in any form from a specific object pointer (this supports situations #1 and
+#3).
+</p>
+
+<p><b>Making this efficient</b></p>
+
+
+
+</div>
+
+
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="gcimpls">GC implementations available</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>
+To make this more concrete, the currently implemented LLVM garbage collectors
+all live in the <tt>llvm/runtime/GC/*</tt> directories in the LLVM source-base.
+If you are interested in implementing an algorithm, there are many interesting
+possibilities (mark/sweep, a generational collector, a reference counting
+collector, etc), or you could choose to improve one of the existing algorithms.
+</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="semispace">SemiSpace - A simple copying garbage collector</a>
+</div>
+
+<div class="doc_text">
+<p>
+SemiSpace is a very simple copying collector.  When it starts up, it allocates
+two blocks of memory for the heap.  It uses a simple bump-pointer allocator to
+allocate memory from the first block until it runs out of space.  When it runs
+out of space, it traces through all of the roots of the program, copying blocks
+to the other half of the memory space.
+</p>
+
+</div>
+
+<!--_________________________________________________________________________-->
+<div class="doc_subsubsection">
+  Possible Improvements
+</div>
+
+<div class="doc_text">
+
+<p>
+If a collection cycle happens and the heap is not compacted very much (say less
+than 25% of the allocated memory was freed), the memory regions should be
+doubled in size.</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="references">References</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p><a name="appel89">[Appel89]</a> Runtime Tags Aren't Necessary. Andrew
+W. Appel. Lisp and Symbolic Computation 19(7):703-705, July 1989.</p>
+
+<p><a name="goldberg91">[Goldberg91]</a> Tag-free garbage collection for
+strongly typed programming languages.  Benjamin Goldberg. ACM SIGPLAN
+PLDI'91.</p>
+
+<p><a name="tolmach94">[Tolmach94]</a> Tag-free garbage collection using
+explicit type parameters.  Andrew Tolmach.  Proceedings of the 1994 ACM
+conference on LISP and functional programming.</p>
+
+</div>
+
+<!-- *********************************************************************** -->
+
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
+
+  <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
+  <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
+
+</body>
+</html>

llvm/docs/HistoricalNotes/2001-04-16-DynamicCompilation.txt

@@ -1,12 +1,49 @@
 By Chris:
 
-LLVM has been designed with two primary goals in mind.  First we strive to enable the best possible division of labor between static and dynamic compilers, and second, we need a flexible and powerful interface between these two complementary stages of compilation.  We feel that providing a solution to these two goals will yield an excellent solution to the performance problem faced by modern architectures and programming languages.
+LLVM has been designed with two primary goals in mind.  First we strive to 
+enable the best possible division of labor between static and dynamic 
+compilers, and second, we need a flexible and powerful interface 
+between these two complementary stages of compilation.  We feel that 
+providing a solution to these two goals will yield an excellent solution 
+to the performance problem faced by modern architectures and programming 
+languages.
 
-A key insight into current compiler and runtime systems is that a compiler may fall in anywhere in a "continuum of compilation" to do its job.  On one side, scripting languages statically compile nothing and dynamically compile (or equivalently, interpret) everything.  On the far other side, traditional static compilers process everything statically and nothing dynamically.  These approaches have typically been seen as a tradeoff between performance and portability.  On a deeper level, however, there are two reasons that optimal system performance may be obtained by a system somewhere in between these two extremes: Dynamic application behavior and social constraints.
+A key insight into current compiler and runtime systems is that a 
+compiler may fall in anywhere in a "continuum of compilation" to do its 
+job.  On one side, scripting languages statically compile nothing and 
+dynamically compile (or equivalently, interpret) everything.  On the far 
+other side, traditional static compilers process everything statically and 
+nothing dynamically.  These approaches have typically been seen as a 
+tradeoff between performance and portability.  On a deeper level, however, 
+there are two reasons that optimal system performance may be obtained by a
+system somewhere in between these two extremes: Dynamic application 
+behavior and social constraints.
 
-From a technical perspective, pure static compilation cannot ever give optimal performance in all cases, because applications have varying dynamic behavior that the static compiler cannot take into consideration.  Even compilers that support profile guided optimization generate poor code in the real world, because using such optimization tunes that application to one particular usage pattern, whereas real programs (as opposed to benchmarks) often have several different usage patterns.
+From a technical perspective, pure static compilation cannot ever give 
+optimal performance in all cases, because applications have varying dynamic
+behavior that the static compiler cannot take into consideration.  Even 
+compilers that support profile guided optimization generate poor code in 
+the real world, because using such optimization tunes that application 
+to one particular usage pattern, whereas real programs (as opposed to 
+benchmarks) often have several different usage patterns.
 
-On a social level, static compilation is a very shortsighted solution to the performance problem.  Instruction set architectures (ISAs) continuously evolve, and each implementation of an ISA (a processor) must choose a set of tradeoffs that make sense in the market context that it is designed for.  With every new processor introduced, the vendor faces two fundamental problems: First, there is a lag time between when a processor is introduced to when compilers generate quality code for the architecture.  Secondly, even when compilers catch up to the new architecture there is often a large body of legacy code that was compiled for previous generations and will not or can not be upgraded.  Thus a large percentage of code running on a processor may be compiled quite sub-optimally for the current characteristics of the dynamic execution environment.
-
-For these reasons, LLVM has been designed from the beginning as a long-term solution to these problems.  Its design allows the large body of platform independent, static, program optimizations currently in compilers to be reused unchanged in their current form.  It also provides important static type information to enable powerful dynamic and link time optimizations to be performed quickly and efficiently.  This combination enables an increase in effective system performance for real world environments.
+On a social level, static compilation is a very shortsighted solution to 
+the performance problem.  Instruction set architectures (ISAs) continuously 
+evolve, and each implementation of an ISA (a processor) must choose a set 
+of tradeoffs that make sense in the market context that it is designed for.  
+With every new processor introduced, the vendor faces two fundamental 
+problems: First, there is a lag time between when a processor is introduced 
+to when compilers generate quality code for the architecture.  Secondly, 
+even when compilers catch up to the new architecture there is often a large 
+body of legacy code that was compiled for previous generations and will 
+not or can not be upgraded.  Thus a large percentage of code running on a 
+processor may be compiled quite sub-optimally for the current 
+characteristics of the dynamic execution environment.
 
+For these reasons, LLVM has been designed from the beginning as a long-term 
+solution to these problems.  Its design allows the large body of platform 
+independent, static, program optimizations currently in compilers to be 
+reused unchanged in their current form.  It also provides important static 
+type information to enable powerful dynamic and link time optimizations 
+to be performed quickly and efficiently.  This combination enables an 
+increase in effective system performance for real world environments.

llvm/docs/HowToSubmitABug.html

@@ -1,61 +1,71 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head><title>How to submit an LLVM bug report</title></head>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <title>How to submit an LLVM bug report</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+<body>
 
-<body bgcolor=white>
+<div class="doc_title">
+  How to submit an LLVM bug report
+</div>
 
-<table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp; <font size=+3 color="#EEEEFF" face="Georgia,Palatino,Times,Roman"><b>How to submit an LLVM bug report</b></font></td>
-</tr></table>
+<table border="0" width="100%">
+<tr>
+<td valign="top">
 
-<table border=0 width=100%>
-<tr><td valign=top>
-<p><font size=+1>
 <ol>
-  <li><a href="#introduction">Introduction - Got bugs?</a>
+  <li><a href="#introduction">Introduction - Got bugs?</a></li>
   <li><a href="#crashers">Crashing Bugs</a>
     <ul>
     <li><a href="#front-end">Front-end bugs</a>
     <li><a href="#gccas">GCCAS bugs</a>
     <li><a href="#gccld">GCCLD bugs</a>
     <li><a href="#passes">Bugs in LLVM passes</a>
-    </ul>
-  <li><a href="#miscompilations">Miscompilations</a>
-  <li><a href="#codegen">Incorrect code generation (JIT and LLC)</a>
+    </ul></li>
+  <li><a href="#miscompilations">Miscompilations</a></li>
+  <li><a href="#codegen">Incorrect code generation (JIT and LLC)</a></li>
 
-  <p><b>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a> and
-                   <a href="http://misha.brukman.net">Misha Brukman</a></b><p>
-</ol><p></font>
-</td><td valign=top align=right>
-<img src="Debugging.gif" width=444 height=314>
-</td></tr>
+</ol>
+
+<div class="doc_author">
+  <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a> and
+                <a href="http://misha.brukman.net">Misha Brukman</a></p>
+</div>
+
+</td>
+<td align="right">
+  <img src="img/Debugging.gif" alt="Debugging" width="444" height="314">
+</td>
+</tr>
 </table>
 
-
 <!-- *********************************************************************** -->
-<table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="introduction">Introduction - Got bugs?
-</b></font></td></tr></table><ul>
+<div class="doc_section">
+  <a name="introduction">Introduction - Got bugs?</a>
+</div>
 <!-- *********************************************************************** -->
 
-If you're working with LLVM and run into a bug, we definitely want to know about
-it.  This document describes what you can do to increase the odds of getting it
-fixed quickly.<p>
+<div class="doc_text">
 
-Basically you have to do two things at a minimum.  First, decide whether the bug
-<a href="#crashers">crashes the compiler</a> (or an LLVM pass), or if the
+<p>If you're working with LLVM and run into a bug, we definitely want to know
+about it.  This document describes what you can do to increase the odds of
+getting it fixed quickly.</p>
+
+<p>Basically you have to do two things at a minimum.  First, decide whether the
+bug <a href="#crashers">crashes the compiler</a> (or an LLVM pass), or if the
 compiler is <a href="#miscompilations">miscompiling</a> the program.  Based on
 what type of bug it is, follow the instructions in the linked section to narrow
 down the bug so that the person who fixes it will be able to find the problem
-more easily.<p>
+more easily.</p>
+
+<p>Once you have a reduced test-case, go to <a
+href="http://llvm.cs.uiuc.edu/bugs/enter_bug.cgi">the LLVM Bug Tracking
+System</a>, select the category in which the bug falls, and fill out the form
+with the necessary details.  The bug description should contain the following
+information:</p>
 
-Once you have a reduced test-case, go to
-<a href="http://llvm.cs.uiuc.edu/bugs/enter_bug.cgi">
-the LLVM Bug Tracking System,
-</a>
-select the catagory in which the bug falls, and fill out the form with the
-necessary details.  The bug description should contain the following
-information:
 <ul>
   <li>All information necessary to reproduce the problem.</li>
   <li>The reduced test-case that triggers the bug.</li>
@@ -63,218 +73,288 @@ information:
   repository).</li>
 </ul>
 
-<p>
-Thanks for helping us make LLVM better!<p>
+<p>Thanks for helping us make LLVM better!</p>
 
+</div>
 
 <!-- *********************************************************************** -->
-</ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="crashers">Crashing Bugs
-</b></font></td></tr></table><ul>
+<div class="doc_section">
+  <a name="crashers">Crashing Bugs</a>
+</div>
 <!-- *********************************************************************** -->
 
-More often than not, bugs in the compiler cause it to crash - often due to an
+<div class="doc_text">
+
+<p>More often than not, bugs in the compiler cause it to crash - often due to an
 assertion failure of some sort.  If you are running <tt><b>opt</b></tt> or
 <tt><b>analyze</b></tt> directly, and something crashes, jump to the section on
 <a href="#passes">bugs in LLVM passes</a>.  Otherwise, the most important
 piece of the puzzle is to figure out if it is the GCC-based front-end that is
-buggy or if it's one of the LLVM tools that has problems.<p>
+buggy or if it's one of the LLVM tools that has problems.</p>
 
-To figure out which program is crashing (the front-end, <tt><b>gccas</b></tt>,
-or <tt><b>gccld</b></tt>), run the <tt><b>llvm-gcc</b></tt> command line as you
-were when the crash occurred, but add a <tt>-v</tt> option to the command line.
-The compiler will print out a bunch of stuff, and should end with telling you
-that one of <tt><b>cc1</b></tt>, <tt><b>gccas</b></tt>, or <tt><b>gccld</b></tt>
-crashed.<p>
+<p>To figure out which program is crashing (the front-end,
+<tt><b>gccas</b></tt>, or <tt><b>gccld</b></tt>), run the
+<tt><b>llvm-gcc</b></tt> command line as you were when the crash occurred, but
+add a <tt>-v</tt> option to the command line.  The compiler will print out a
+bunch of stuff, and should end with telling you that one of
+<tt><b>cc1</b>/<b>cc1plus</b></tt>, <tt><b>gccas</b></tt>, or
+<tt><b>gccld</b></tt> crashed.</p>
 
 <ul>
-<li>If <tt><b>cc1</b></tt> crashed, you found a problem with the front-end.
-Jump ahead to the section on <a href="#front-end">front-end bugs</a>.
-<li>If <tt><b>gccas</b></tt> crashed, you found a bug in <a href="#gccas">one of
-the passes in <tt><b>gccas</b></tt></a>.
-<li>If <tt><b>gccld</b></tt> crashed, you found a bug in <a href="#gccld">one
-of the passes in <tt><b>gccld</b></tt></a>.
-<li>Otherwise, something really weird happened.  Email the list with what you
-have at this point.
-</ul><p>
 
+  <li>If <tt><b>cc1</b></tt> or <tt><b>cc1plus</b></tt> crashed, you found a
+  problem with the front-end.
+  Jump ahead to the section on <a href="#front-end">front-end bugs</a>.</li>
+
+  <li>If <tt><b>gccas</b></tt> crashed, you found a bug in <a href="#gccas">one
+  of the passes in <tt><b>gccas</b></tt></a>.</li>
+
+  <li>If <tt><b>gccld</b></tt> crashed, you found a bug in <a href="#gccld">one
+  of the passes in <tt><b>gccld</b></tt></a>.</li>
+
+  <li>Otherwise, something really weird happened. Email the list with what you
+  have at this point.</li>
+
+</ul>
+
+</div>
 
 <!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width="100%">&nbsp; 
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="front-end">Front-end bugs
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="front-end">Front-end bugs</a>
+</div>
 
-If the problem is in the front-end, you should re-run the same
+<div class="doc_text">
+
+<p>If the problem is in the front-end, you should re-run the same
 <tt>llvm-gcc</tt> command that resulted in the crash, but add the
-<tt>-save-temps</tt> option.  The compiler will crash again, but it
-will leave behind a <tt><i>foo</i>.i</tt> file (containing preprocessed
-C source code) and possibly <tt><i>foo</i>.s</tt> (containing LLVM
-assembly code), for each compiled <tt><i>foo</i>.c</tt> file. Send us
-the <tt><i>foo</i>.i</tt> file, along with a brief description of the
-error it caused.<p>
+<tt>-save-temps</tt> option.  The compiler will crash again, but it will leave
+behind a <tt><i>foo</i>.i</tt> file (containing preprocessed C source code) and
+possibly <tt><i>foo</i>.s</tt> (containing LLVM assembly code), for each
+compiled <tt><i>foo</i>.c</tt> file. Send us the <tt><i>foo</i>.i</tt> file,
+along with a brief description of the error it caused.</p>
+
+</div>
 
 <!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width="100%">&nbsp; 
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="gccas">GCCAS bugs
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="gccas">GCCAS bugs</a>
+</div>
 
-If you find that a bug crashes in the <tt><b>gccas</b></tt> stage of
+<div class="doc_text">
+
+<p>If you find that a bug crashes in the <tt><b>gccas</b></tt> stage of
 compilation, compile your test-case to a <tt>.s</tt> file with the
-<tt>-save-temps</tt> option to <tt><b>llvm-gcc</b></tt>. Then run:<p>
+<tt>-save-temps</tt> option to <tt><b>llvm-gcc</b></tt>. Then run:</p>
 
-<pre>
-  <b>gccas</b> -debug-pass=Arguments &lt; /dev/null -o - &gt; /dev/null
-</pre><p>
+<div class="doc_code">
+<p><tt><b>gccas</b> -debug-pass=Arguments &lt; /dev/null -o - &gt; /dev/null</tt></p>
+</div>
 
-... which will print a list of arguments, indicating the list of passes that
+<p>... which will print a list of arguments, indicating the list of passes that
 <tt><b>gccas</b></tt> runs.  Once you have the input file and the list of
 passes, go to the section on <a href="#passes">debugging bugs in LLVM
-passes</a>.<p>
+passes</a>.</p>
 
+</div>
 
 <!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width="100%">&nbsp; 
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="gccld">GCCLD bugs
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="gccld">GCCLD bugs</a>
+</div>
 
-If you find that a bug crashes in the <tt><b>gccld</b></tt> stage of
+<div class="doc_text">
+
+<p>If you find that a bug crashes in the <tt><b>gccld</b></tt> stage of
 compilation, gather all of the <tt>.o</tt> bytecode files and libraries that are
 being linked together (the "<tt><b>llvm-gcc</b> -v</tt>" output should include
-the full list of objects linked).  Then run:<p>
+the full list of objects linked).  Then run:</p>
 
-<pre>
-  <b>llvm-as</b> &lt; /dev/null &gt; null.bc
-  <b>gccld</b> -debug-pass=Arguments null.bc
-</pre><p>
+<div class="doc_code">
+<p><tt><b>llvm-as</b> &lt; /dev/null &gt; null.bc<br>
+<b>gccld</b> -debug-pass=Arguments null.bc</tt>
+</p>
+</div>
 
-... which will print a list of arguments, indicating the list of passes that
+<p>... which will print a list of arguments, indicating the list of passes that
 <tt><b>gccld</b></tt> runs.  Once you have the input files and the list of
 passes, go to the section on <a href="#passes">debugging bugs in LLVM
-passes</a>.<p>
+passes</a>.</p>
+
+</div>
 
 <!-- ======================================================================= -->
-</ul><table width="100%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width="100%">&nbsp; 
-<font color="#EEEEFF" face="Georgia,Palatino"><b>
-<a name="passes">Bugs in LLVM passes
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="passes">Bugs in LLVM passes</a>
+</div>
 
-At this point, you should have some number of LLVM assembly files or bytecode
+<div class="doc_text">
+
+<p>At this point, you should have some number of LLVM assembly files or bytecode
 files and a list of passes which crash when run on the specified input.  In
 order to reduce the list of passes (which is probably large) and the input to
-something tractable, use the <tt><b>bugpoint</b></tt> tool as follows:<p>
+something tractable, use the <tt><b>bugpoint</b></tt> tool as follows:</p>
 
-<pre>
-  <b>bugpoint</b> &lt;input files&gt; &lt;list of passes&gt;
-</pre><p>
+<div class="doc_code">
+<p><tt><b>bugpoint</b> &lt;input files&gt; &lt;list of passes&gt;</tt></p>
+</div>
 
-<tt><b>bugpoint</b></tt> will print a bunch of output as it reduces the
-test-case, but it should eventually print something like this:<p>
+<p><tt><b>bugpoint</b></tt> will print a bunch of output as it reduces the
+test-case, but it should eventually print something like this:</p>
 
-<pre>
-  ...
-  Emitted bytecode to 'bugpoint-reduced-simplified.bc'
+<div class="doc_code">
+<p><tt>
+...<br>
+Emitted bytecode to 'bugpoint-reduced-simplified.bc'<br>
+<br>
+*** You can reproduce the problem with: opt bugpoint-reduced-simplified.bc -licm<br>
+</tt></p>
+</div>
 
-  *** You can reproduce the problem with: opt bugpoint-reduced-simplified.bc -licm
-</pre><p>
-
-Once you complete this, please send the LLVM bytecode file and the command line
-to reproduce the problem to the llvmbugs mailing list.<p>
+<p>Once you complete this, please send the LLVM bytecode file and the command
+line to reproduce the problem to the llvmbugs mailing list.</p>
 
+</div>
 
 <!-- *********************************************************************** -->
-</ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="miscompilations">Miscompilations</a>
-</b></font></td></tr></table><ul>
+<div class="doc_section">
+  <a name="miscompilations">Miscompilations</a>
+</div>
 <!-- *********************************************************************** -->
 
-A miscompilation occurs when a pass does not correctly transform a program, thus
-producing errors that are only noticed during execution. This is different from
-producing invalid LLVM code (i.e., code not in SSA form, using values before
-defining them, etc.) which the verifier will check for after a pass finishes its
-run.<p>
+<div class="doc_text">
 
-To debug a miscompilation, you should choose which program you wish to run the
-output through, e.g. C backend, the JIT, or LLC, and a selection of passes, one
-of which may be causing the error, and run, for example:
+<p>A miscompilation occurs when a pass does not correctly transform a program,
+thus producing errors that are only noticed during execution. This is different
+from producing invalid LLVM code (i.e., code not in SSA form, using values
+before defining them, etc.) which the verifier will check for after a pass
+finishes its run.</p>
 
-<pre>
-  <b>bugpoint</b> -run-cbe [... optimization passes ...] file-to-test.bc
-</pre>
+<p>If it looks like the LLVM compiler is miscompiling a program, the very first
+thing to check is to make sure it is not using undefined behavior.  In
+particular, check to see if the program <a
+href="http://valgrind.kde.org/">valgrind</a>s clean, passes purify, or some
+other memory checker tool.  Many of the "LLVM bugs" that we have chased down
+ended up being bugs in the program being compiled, not LLVM.</p>
 
-<tt>bugpoint</tt> will try to narrow down your list of passes to the one pass
+<p>Once you determine that the program itself is not buggy, you should choose 
+which code generator you wish to compile the program with (e.g. C backend, the 
+JIT, or LLC) and optionally a series of LLVM passes to run.  For example:</p>
+
+<div class="doc_code">
+<p><tt>
+<b>bugpoint</b> -run-cbe [... optzn passes ...] file-to-test.bc --args -- [program arguments]</tt></p>
+</div>
+
+<p><tt>bugpoint</tt> will try to narrow down your list of passes to the one pass
 that causes an error, and simplify the bytecode file as much as it can to assist
 you. It will print a message letting you know how to reproduce the resulting
-error.
+error.</p>
+
+</div>
 
 <!-- *********************************************************************** -->
-</ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="codegen">Incorrect code generation</a>
-</b></font></td></tr></table><ul>
+<div class="doc_section">
+  <a name="codegen">Incorrect code generation</a>
+</div>
 <!-- *********************************************************************** -->
 
-Similarly to debugging incorrect compilation by mis-behaving passes, you can
+<div class="doc_text">
+
+<p>Similarly to debugging incorrect compilation by mis-behaving passes, you can
 debug incorrect code generation by either LLC or the JIT, using
 <tt>bugpoint</tt>. The process <tt>bugpoint</tt> follows in this case is to try
 to narrow the code down to a function that is miscompiled by one or the other
 method, but since for correctness, the entire program must be run,
 <tt>bugpoint</tt> will compile the code it deems to not be affected with the C
-Backend, and then link in the shared object it generates.<p>
+Backend, and then link in the shared object it generates.</p>
 
-To debug the JIT:
+<p>To debug the JIT:</p>
+
+<div class="doc_code">
 <pre>
-  <b>bugpoint</b> -run-jit -output=[correct output file] [bytecodefile]
+bugpoint -run-jit -output=[correct output file] [bytecode file]  \
+         --tool-args -- [arguments to pass to lli]               \
+         --args -- [program arguments]
 </pre>
+</div>
 
-Similarly, to debug the LLC, one would run:
+<p>Similarly, to debug the LLC, one would run:</p>
+
+<div class="doc_code">
 <pre>
-  <b>bugpoint</b> -run-llc -output=[correct output file] [bytecodefile]
+bugpoint -run-llc -output=[correct output file] [bytecode file]  \
+         --tool-args -- [arguments to pass to llc]               \
+         --args -- [program arguments]
 </pre>
+</div>
 
-At the end of a successful <tt>bugpoint</tt> run, you will be presented
+<p><b>Special note:</b> if you are debugging MultiSource or SPEC tests that
+already exist in the <tt>llvm/test</tt> hierarchy, there is an easier way to
+debug the JIT, LLC, and CBE, using the pre-written Makefile targets, which
+will pass the program options specified in the Makefiles:</p>
+
+<div class="doc_code">
+<p><tt>
+cd llvm/test/../../program<br>
+make bugpoint-jit
+</tt></p>
+</div>
+
+<p>At the end of a successful <tt>bugpoint</tt> run, you will be presented
 with two bytecode files: a <em>safe</em> file which can be compiled with the C
 backend and the <em>test</em> file which either LLC or the JIT
-mis-codegenerates, and thus causes the error.<p>
+mis-codegenerates, and thus causes the error.</p>
 
-To reproduce the error that <tt>bugpoint</tt> found, it is sufficient to do the
-following:
+<p>To reproduce the error that <tt>bugpoint</tt> found, it is sufficient to do
+the following:</p>
 
 <ol>
-  <li>Regenerate the shared object from the safe bytecode file:<br>
-<pre>
-  <b>llvm-dis</b> -c safe.bc -o safe.c<br>
-  <b>gcc</b> -shared safe.c -o safe.so
-</pre></li>
-  <li>If debugging LLC, compile test bytecode native and link with the shared object:<br>
-<pre>
-  <b>llc</b> test.bc -o test.s -f<br>
-  gcc test.s safe.so -o test.llc<br>
-  ./test.llc [program options]
-</pre></li>
-      <p>
-     If debugging the JIT, load the shared object and supply the test bytecode:<br>
-<pre>
-  <b>lli</b> -load=safe.so test.bc [program options]
-</pre></li>  
+
+<li><p>Regenerate the shared object from the safe bytecode file:</p>
+
+<div class="doc_code">
+<p><tt>
+<b>llc</b> -march=c safe.bc -o safe.c<br>
+<b>gcc</b> -shared safe.c -o safe.so
+</tt></p>
+</div></li>
+
+<li><p>If debugging LLC, compile test bytecode native and link with the shared
+    object:</p>
+
+<div class="doc_code">
+<p><tt>
+<b>llc</b> test.bc -o test.s -f<br>
+<b>gcc</b> test.s safe.so -o test.llc<br>
+./test.llc [program options]
+</tt></p>
+</div></li>
+    
+<li><p>If debugging the JIT, load the shared object and supply the test
+    bytecode:</p>
+
+<div class="doc_code">
+<p><tt><b>lli</b> -load=safe.so test.bc [program options]</tt></p>
+</div></li>  
+
 </ol>
 
-<!-- *********************************************************************** -->
-</ul>
-<!-- *********************************************************************** -->
+</div>
 
-<hr><font size-1>
-<address><a href="mailto:sabre@nondot.org">Chris Lattner</a></address>
-<!-- Created: Tue Aug  6 15:00:33 CDT 2002 -->
-<!-- hhmts start -->
-Last modified: Tue Oct 14 15:57:47 CDT 2003
-<!-- hhmts end -->
-</font></body></html>
+<!-- *********************************************************************** -->
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" /></a>
+
+  <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
+  <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a>
+  <br>
+  Last modified: $Date$
+</address>
+
+</body>
+</html>

llvm/docs/LLVMVsTheWorld.html

@@ -0,0 +1,180 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+  <title>LLVM vs. the World - Comparing Compilers to Compilers</title>
+</head>
+
+<body>
+
+<div class="doc_title">
+  LLVM vs. the World - Comparing Compilers to Compilers
+</div>
+
+<ol>
+  <li><a href="#introduction">Introduction</a></li>
+  <li><a href="#generalapplicability">General Applicability</a></li>
+  <li><a href="#typesystem">Type System</a></li>
+  <li><a href="#dataflowinformation">Control-flow and Data-flow Information</a></li>
+  <li><a href="#registers">Registers</a></li>
+  <li><a href="#programmerinterface">Programmer Interface</a></li>
+  <li><a href="#codeemission">Machine Code Emission</a></li>
+</ol>
+
+<div class="doc_author">
+  <p>Written by Brian R. Gaeke</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="introduction">Introduction</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>Whether you are a stranger to LLVM or not, and whether you are considering
+using it for your projects or not, you may find it useful to understand how we
+compare ourselves to other well-known compilers. The following list of points
+should help you understand -- from our point of view -- some of the important
+ways in which we see LLVM as different from other selected compilers and
+code generation systems.</p>
+
+<p>At the moment, we only compare ourselves below to <a
+href="http://gcc.gnu.org/">GCC</a> and <a
+href="http://www.gnu.org/software/lightning/">GNU lightning</a>, but we will try
+to revise and expand it as our knowledge and experience permit. Contributions are
+welcome.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="generalapplicability">General Applicability</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>GNU lightning: Only currently usable for dynamic runtime emission of binary
+machine code to memory. Supports one backend at a time.</p>
+
+<p>LLVM: Supports compilation of C and C++ (with more languages coming soon),
+strong SSA-based optimization at compile-time, link-time, run-time, and
+off-line, and multiple platform backends with Just-in-Time and ahead-of-time
+compilation frameworks. (See our document on <a
+href="http://llvm.cs.uiuc.edu/pubs/2004-01-30-CGO-LLVM.html">Lifelong
+Code Optimization</a> for more.)</p>
+
+<p>GCC: Many relatively mature platform backends support assembly-language code
+generation from many source languages. No run-time compilation
+support.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="typesystem">Type System</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>GNU lightning: C integer types and "void *" are supported. No type checking
+is performed. Explicit type casts are not typically necessary unless the
+underlying machine-specific types are distinct (e.g., sign- or zero-extension is
+apparently necessary, but casting "int" to "void *" would not be.)
+Floating-point support may not work on all platforms (it does not appear to be
+documented in the latest release).</p>
+
+<p>LLVM: Compositional type system based on C types, supporting structures,
+opaque types, and C integer and floating point types. Explicit cast instructions
+are required to transform a value from one type to another.</p>
+
+<p>GCC: Union of high-level types including those used in Pascal, C, C++, Ada,
+Java, and FORTRAN.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="dataflowinformation">Control-flow and Data-flow Information</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>GNU lightning: No data-flow information encoded in the generated program. No
+support for calculating CFG or def-use chains over generated programs.</p>
+
+<p>LLVM: Scalar values in Static Single-Assignment form; def-use chains and CFG
+always implicitly available and automatically kept up to date.</p>
+
+<p>GCC: Trees and RTL do not directly encode data-flow info; but def-use chains
+and CFGs can be calculated on the side. They are not automatically kept up to
+date.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="registers">Registers</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>GNU lightning: Very small fixed register set -- it takes the least common
+denominator of supported platforms; basically it inherits its tiny register set
+from IA-32, unnecessarily crippling targets like PowerPC with a large register
+set.</p>
+
+<p>LLVM: An infinite register set, reduced to a particular platform's finite
+register set by register allocator.</p>
+
+<p>GCC: Trees and RTL provide an arbitrarily large set of values.  Reduced to a
+particular platform's finite register set by register allocator.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="programmerinterface">Programmer Interface</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>GNU lightning: Library interface based on C preprocessor macros that emit
+binary code for a particular instruction to memory. No support for manipulating
+code before emission.</p>
+
+<p>LLVM: Library interface based on classes representing platform-independent
+intermediate code (Instruction) and platform-dependent code (MachineInstr) which
+can be manipulated arbitrarily and then emitted to memory.</p>
+
+<p>GCC: Internal header file interface (tree.h) to abstract syntax trees,
+representing roughly the union of all possible supported source-language
+constructs; also, an internal header file interface (rtl.h, rtl.def) to a
+low-level IR called RTL which represents roughly the union of all possible
+target machine instructions.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="codeemission">Machine Code Emission</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>GNU lightning: Only supports binary machine code emission to memory.</p>
+
+<p>LLVM: Supports writing out assembly language to a file, and binary machine
+code to memory, from the same back-end.</p>
+
+<p>GCC: Supports writing out assembly language to a file. No support for
+emitting machine code to memory.</p>
+</div>
+
+<!-- *********************************************************************** -->
+
+<hr>
+<div class="doc_footer">
+  <address>Brian R. Gaeke</address>
+  <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a>
+  <br>
+  Last modified: $Date$
+</div>
+
+</body>
+</html>

llvm/docs/ObjectFiles.html

@@ -0,0 +1,300 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
+<html>
+<head>
+	<title>Object Files: Understanding The Result Of LLVM Compilation</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+<body>
+<div class="doc_title">Object Files: Understanding The Result Of LLVM Compilation</div>
+<hr>
+<ol>
+  <li><a href="#abstract">Abstract</a></li>
+  <li><a href="#introduction">Introduction</a></li>
+  <li><a href="#files">File Contents</a></li>
+  <li><a href="#rot">Linkage Rules Of Thumb</a>
+	  <ol>
+			<li><a href="#always">Always Link vmcore.o, support.a</a>
+			<li><a href="#placeholder">Placeholder</a>
+		</ol>
+	</li>
+</ol>
+
+<div class="doc_author">
+  <p>Written by <a href="mailto:rspencer@x10sys.com">Reid Spencer</a></p>
+</div>
+
+<hr>
+
+<!-- ======================================================================= -->
+<div class="doc_section"><a name="abstract">Abstract</a></div>
+<div class="doc_text">
+<p>This document describes the contents of the many objects files and libraries
+that are produced by compiling LLVM. To make use of LLVM this information is 
+needed in order to understand what files should be linked into your program.
+</p>
+</div>
+<!-- ======================================================================= -->
+<div class="doc_section"> <a name="introduction">Introduction</a></div>
+<div class="doc_text">
+<p>If you're writing a compiler, virtual machine, or any other utility for
+	 LLVM, you'll need to figure out which of the many .a (archive) and .o
+	 (object) files you will need to link with to be successful. An
+	 understanding of the contents of these files and their inter-relationships
+	 will be useful in coming up with an optimal specification for the objects
+	 and libraries to link with. 
+</p>
+<p>The purpose of this document is to hopefully reduce some of the trial and
+   error that the author experienced in using LLVM.
+</p>
+</div>
+<!-- ======================================================================= -->
+<div class="doc_section"><a name="files"></a>File Contents</div>
+<div class="doc_text">
+<p>The table below provides a summary of the basic contents of each file.</p>
+<table class="doc_table" 
+	style="width:80%; text-align: left; border: 2px solid blue; border-collapse: collapse;">
+<tr class="doc_table">
+	<td colspan="2" class="doc_section">Summary Of LLVM Library And Object Files
+	</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue"><h2><u>Library</u></h2></td>
+	<td style="border: 2px solid blue"><h2><u>Description</u></h2></td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libipo.a</td>
+	<td style="border: 2px solid blue">
+		An archive of all inter-procedural optimizations.
+	</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libscalaropts.a</td>
+	<td style="border: 2px solid blue">
+		An archive of all scalar optimizations.
+	</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libtransforms.a</td>
+	<td style="border: 2px solid blue">
+		An archive of just the level raise pass.
+	</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libtarget.a</td>
+	<td style="border: 2px solid blue">
+		An archive containing code generator support for describing
+		target architectures.
+	</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libanalysis.a</td>
+	<td style="border: 2px solid blue">
+		An archive containing intra-procedural analyses.
+	</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libdatastructure.a</td>
+	<td style="border: 2px solid blue">
+		An archive containing optimizations for data structures.
+	</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libinstrument.a</td>
+	<td style="border: 2px solid blue">No idea.</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libregalloc.a</td>
+	<td style="border: 2px solid blue">Register Allocation code.</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libipa.a</td>
+	<td style="border: 2px solid blue">
+		An archive containing inter-procedural analyses</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libtransformutils.a</td>
+	<td style="border: 2px solid blue">
+		Utiltities for transformations?
+	</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libsupport.a</td>
+	<td style="border: 2px solid blue">General support utilities</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">libevar.a</td>
+	<td style="border: 2px solid blue">Live variable analysis for SPARC</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue"><h2><u>Object File</u></h2></td>
+	<td style="border: 2px solid blue"><h2><u>Description</u></h2></td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">support.o</td>
+	<td style="border: 2px solid blue">General support utilities</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">asmparser.o</td>
+	<td style="border: 2px solid blue">Assembler Parser</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">bcreader.o</td>
+	<td style="border: 2px solid blue">Byte Code Reader</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">bcwriter.o</td>
+	<td style="border: 2px solid blue">Byte Code Writer</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">sched.o</td>
+	<td style="border: 2px solid blue">SPARC instruction scheduler</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">selectiondag.o</td>
+	<td style="border: 2px solid blue">Aggressive instruction selector for Directed Acyclic Graphs</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">transformutils.o</td>
+	<td style="border: 2px solid blue">Utilities for code transformations</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">ipa.o</td>
+	<td style="border: 2px solid blue">Inter-Procedural Analysis Optimizations</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">select.o</td>
+	<td style="border: 2px solid blue">SPARC instruction selector</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">cwriter.o</td>
+	<td style="border: 2px solid blue">"C" Code Writer</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">profpaths.o</td>
+	<td style="border: 2px solid blue">Path profiling instrumentation</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">regalloc.o</td>
+	<td style="border: 2px solid blue">Register Allocation</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">instrument.o</td>
+	<td style="border: 2px solid blue">Instrumentation? Of What?</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">datastructure.o</td>
+	<td style="border: 2px solid blue">Data Structure Analysis</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">codegen.o</td>
+	<td style="border: 2px solid blue">Native code generation</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">livevar.o</td>
+	<td style="border: 2px solid blue">Live Variable Analysis</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">vmcore.o</td>
+	<td style="border: 2px solid blue">Virtual Machine Core</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">lli-interpreter.o</td>
+	<td style="border: 2px solid blue">Interpreter for LLVM ByteCode</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">lli-jit.o</td>
+	<td style="border: 2px solid blue">
+		Just-In-Time Compiler For LLVM ByteCode
+	</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">executionengine.o</td>
+	<td style="border: 2px solid blue">Engine for LLI</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">debugger.o</td>
+	<td style="border: 2px solid blue">Source Level Debugging Support</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">analysis.o</td>
+	<td style="border: 2px solid blue">General Framework For Analysis?</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">sparc.o</td>
+	<td style="border: 2px solid blue">Sun SPARC Processor Specific</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">target.o</td>
+	<td style="border: 2px solid blue">Target Machine Support?</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">transforms.o</td>
+	<td style="border: 2px solid blue">Code Transformations</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">x86.o</td>
+	<td style="border: 2px solid blue">Intel x86 Processor Specific</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">powerpc.o</td>
+	<td style="border: 2px solid blue">PowerPC Processor Specific</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">scalaropts.o</td>
+	<td style="border: 2px solid blue">Optimizations For Scalars</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">ipo.o</td>
+	<td style="border: 2px solid blue">Inter-Procedural Optimization</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">trace.o</td>
+	<td style="border: 2px solid blue">Support For Tracing/Debugging?</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">profile_rt.o</td>
+	<td style="border: 2px solid blue">Runtime Library For Profiler</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">sample.o</td>
+	<td style="border: 2px solid blue">Sample Program ?</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">stkr_compiler.o</td>
+	<td style="border: 2px solid blue">Stacker Language Compiler Library</td>
+</tr>
+<tr class="doc_table">
+	<td style="border: 2px solid blue">stkr_runtime.o</td>
+	<td style="border: 2px solid blue">Stacker Language Runtime Library</td>
+</tr>
+</table>
+</div>
+<p></p>
+<!-- ======================================================================= -->
+<div class="doc_section"><a name="rot">Linkage Rules Of Thumb</a></div>
+<div class="doc_text">
+	<p>This section contains various "rules of thumb" about what files you
+	should link into your programs.</p>
+</div>
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="always">Always Link vmcore.o support.a</a>
+</div>
+<div class="doc_text">
+	<p>No matter what you do with LLVM, you'll always need to link with vmcore.o 
+	and support.a.</p>
+</div>
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="Placeholder">Placeholder</a></div>
+<div class="doc_text">
+	<p>Need more rules of thumb here.</p>
+</div>
+<!-- ======================================================================= -->
+<hr>
+<div class="doc_footer">
+<address><a href="mailto:rspencer@x10sys.com">Reid Spencer</a></address>
+<a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a> 
+<br>Last modified: $Date$ </div>
+</body>
+</html>
+<!-- vim: sw=2 ts=2 ai
+-->

llvm/docs/OpenProjects.html

@@ -1,157 +1,172 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head><title>Open LLVM Projects</title></head>
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <title>Open LLVM Projects</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+<body>
 
-<body bgcolor=white>
-<center><h1><font size=7>Open LLVM Projects</font></h1></center>
+<div class="doc_title">
+  Open LLVM Projects
+</div>
 
 <ul>
-  <li><a href="#what">What is this?</a>
+  <li><a href="#what">What is this?</a></li>
   <li><a href="#improving">Improving the current system</a>
   <ol>
-    <li><a href="#glibc">Port glibc to LLVM</a>
-    <li><a href="#NightlyTest">Improving the Nightly Tester</a>
-    <li><a href="#programs">Compile programs with the LLVM Compiler</a>
-    <li><a href="#llvm_ir">Extend the LLVM intermediate representation</a>
-    <li><a href="#misc_imp">Miscellaneous Improvements</a>
-  </ol>
+    <li><a href="#code-cleanups">Implementing Code Cleanup bugs</a></li>
+    <li><a href="#glibc">Port glibc to LLVM</a></li>
+    <li><a href="#programs">Compile programs with the LLVM Compiler</a></li>
+    <li><a href="#llvm_ir">Extend the LLVM intermediate representation</a></li>
+    <li><a href="#misc_imp">Miscellaneous Improvements</a></li>
+  </ol></li>
 
   <li><a href="#new">Adding new capabilities to LLVM</a>
   <ol>
-    <li><a href="#pointeranalysis">Pointer and Alias Analysis</a>
-    <li><a href="#profileguided">Profile Guided Optimization</a>
-    <li><a href="#xforms">New Transformations and Analyses</a>
-    <li><a href="#x86be">X86 Back-end Improvements</a>
-    <li><a href="#misc_new">Miscellaneous Additions</a>
-  </ol>
+    <li><a href="#newfeaturebugs">Implementing new feature PRs</a></li>
+    <li><a href="#pointeranalysis">Pointer and Alias Analysis</a></li>
+    <li><a href="#profileguided">Profile Guided Optimization</a></li>
+    <li><a href="#xforms">New Transformations and Analyses</a></li>
+    <li><a href="#x86be">X86 Back-end Improvements</a></li>
+    <li><a href="#misc_new">Miscellaneous Additions</a></li>
+  </ol></li>
 </ul>
 
-<br><br>
+<div class="doc_author">
+  <p>Written by the <a href="http://llvm.cs.uiuc.edu/">LLVM Team</a></p>
+</div>
+
 
 <!-- *********************************************************************** -->
-<table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="what">What is this?
-</b></font></td></tr></table><ul>
+<div class="doc_section">
+  <a name="what">What is this?</a>
+</div>
 <!-- *********************************************************************** -->
 
-This document is meant to be a sort of "big TODO list" for LLVM.  Each project
-in this document is something that would be useful for LLVM to have, and would
-also be a great way to get familiar with the system.  Some of these projects are
-small and self-contained, which may be implemented in a couple of days, others
-are larger.  Several of these projects may lead to interesting research projects
-in their own right.  In any case, we welcome all contributions.<p>
+<div class="doc_text">
 
-If you are thinking about tackling one of these projects, please send a mail to
-the <a href="http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev">LLVM
+<p>This document is meant to be a sort of "big TODO list" for LLVM.  Each
+project in this document is something that would be useful for LLVM to have, and
+would also be a great way to get familiar with the system.  Some of these
+projects are small and self-contained, which may be implemented in a couple of
+days, others are larger.  Several of these projects may lead to interesting
+research projects in their own right.  In any case, we welcome all
+contributions.</p>
+
+<p>If you are thinking about tackling one of these projects, please send a mail
+to the <a href="http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev">LLVM
 Developer's</a> mailing list, so that we know the project is being worked on.
 Additionally this is a good way to get more information about a specific project
-or to suggest other projects to add to this page.<p>
+or to suggest other projects to add to this page.
+</p>
 
+<p>The projects in this page are open-ended. More specific projects are
+filed as unassigned enhancements in the <a href="http://llvm.cs.uiuc.edu/bugs/">
+LLVM bug tracker</a>. See the <a href="http://llvm.cs.uiuc.edu/bugs/buglist.cgi?keywords_type=allwords&amp;keywords=&amp;bug_status=NEW&amp;bug_status=ASSIGNED&amp;bug_status=REOPENED&amp;bug_severity=enhancement&amp;emailassigned_to1=1&amp;emailtype1=substring&amp;email1=unassigned">list of currently outstanding issues</a> if you wish to help improve LLVM.</p>
+
+</div>
 
 <!-- *********************************************************************** -->
-</ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="improving">Improving the current system
-</b></font></td></tr></table><ul>
+<div class="doc_section">
+  <a name="improving">Improving the current system</a>
+</div>
 <!-- *********************************************************************** -->
 
-Improvements to the current infrastructure are always very welcome and tend to
-be fairly straight-forward to implement.  Here are some of the key areas that
-can use improvement...<p>
+<div class="doc_text">
+
+<p>Improvements to the current infrastructure are always very welcome and tend
+to be fairly straight-forward to implement.  Here are some of the key areas that
+can use improvement...</p>
+
+</div>
 
 <!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="glibc">Port glibc to LLVM
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="code-cleanups">Implementing Code Cleanup bugs</a>
+</div>
 
-It would be very useful to <a
-href="http://www.gnu.org/software/libc/porting.html">port</a> <a
-href="http://www.gnu.org/software/glibc/">glibc</a> to LLVM.  This would allow a
+<div class="doc_text">
+
+<p>
+The <a href="http://llvm.cs.uiuc.edu/bugs/">LLVM bug tracker</a> occasionally
+has <a href="http://llvm.cs.uiuc.edu/bugs/buglist.cgi?short_desc_type=allwordssubstr&short_desc=&long_desc_type=allwordssubstr&long_desc=&bug_file_loc_type=allwordssubstr&bug_file_loc=&status_whiteboard_type=allwordssubstr&status_whiteboard=&keywords_type=allwords&keywords=code-cleanup&bug_status=NEW&bug_status=ASSIGNED&bug_status=REOPENED&emailassigned_to1=1&emailtype1=substring&email1=&emailassigned_to2=1&emailreporter2=1&emailcc2=1&emailtype2=substring&email2=&bugidtype=include&bug_id=&votes=&changedin=&chfieldfrom=&chfieldto=Now&chfieldvalue=&cmdtype=doit&order=Bug+Number&field0-0-0=noop&type0-0-0=noop&value0-0-0=">"code-cleanup" bugs</a> filed in it.  Taking one of these and fixing it is a good
+way to get your feet wet in the LLVM code and discover how some of its components
+work.
+</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="glibc">Port glibc to LLVM</a>
+</div>
+
+<div class="doc_text">
+
+<p>It would be very useful to <a
+href="http://www.gnu.org/software/libc/manual/html_node/Porting.html">port</a> <a
+href="http://www.gnu.org/software/libc/">glibc</a> to LLVM.  This would allow a
 variety of interprocedural algorithms to be much more effective in the face of
 library calls.  The most important pieces to port are things like the string
 library and the <tt>stdio</tt> related functions... low-level system calls like
-'<tt>read</tt>' should stay unimplemented in LLVM.<p>
+'<tt>read</tt>' should stay unimplemented in LLVM.</p>
 
+</div>
 
 <!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="NightlyTest">Improving the Nightly Tester
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="programs">Compile programs with the LLVM Compiler</a>
+</div>
 
-The <a href="/testresults/">Nightly Tester</a> is a simple perl script (located
-in utils/NightlyTest.pl) which runs every night to generate a daily report.  It
-could use the following improvements:<p>
+<div class="doc_text">
 
-<ol>
-<li>Olden timings - Time the compilation and execution times for the Olden
-    benchmark suite, keeping track of these values over time.
-
-<li>Graphs - It would be great to have gnuplot graphs to keep track of how the
-    tree is changing over time.  We already gather a several statistics, it
-    just necessary to add the script-fu to gnuplotize it.
-
-<li>Regression tests - We should run the regression tests in addition to the
-    program tests...
-</ol><p>
-
-
-<!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="programs">Compile programs with the LLVM Compiler
-</b></font></td></tr></table><ul>
-
-We are always looking for new testcases and benchmarks for use with LLVM.  In
+<p>We are always looking for new testcases and benchmarks for use with LLVM.  In
 particular, it is useful to try compiling your favorite C source code with LLVM.
 If it doesn't compile, try to figure out why or report it to the <a
 href="http://mail.cs.uiuc.edu/pipermail/llvmbugs/">llvm-bugs</a> list.  If you
 get the program to compile, it would be extremely useful to convert the build
 system to be compatible with the LLVM Programs testsuite so that we can check it
 into CVS and the automated tester can use it to track progress of the
-compiler.<p>
+compiler.</p>
 
-When testing a code, try running it with a variety of optimizations, and with
-all the back-ends: CBE, llc, and lli.<p>
+<p>When testing a code, try running it with a variety of optimizations, and with
+all the back-ends: CBE, llc, and lli.</p>
 
+</div>
 
 <!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="llvm_ir">Extend the LLVM intermediate representation
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="llvm_ir">Extend the LLVM intermediate representation</a>
+</div>
+
+<div class="doc_text">
 
 <ol>
-<li>Add a new conditional move instruction: <tt>X = select bool Cond, Y, Z</tt>
-<li>Add support for platform independent prefetch support.  The GCC <a
+<li>Add support for platform-independent prefetch support.  The GCC <a
     href="http://gcc.gnu.org/projects/prefetch.html">prefetch project</a> page
     has a good survey of the prefetching capabilities of a variety of modern
-    processors.
+    processors.</li>
+
 </ol>
 
+</div>
 
 <!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="misc_imp">Miscellaneous Improvements
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="misc_imp">Miscellaneous Improvements</a>
+</div>
+
+<div class="doc_text">
 
 <ol>
 <li>Someone needs to look into getting the <tt>ranlib</tt> tool to index LLVM
     bytecode files, so that linking in .a files is not hideously slow.  They
     would also then have to implement the reader for this index in
-    <tt>gccld</tt>.<br>
+    <tt>gccld</tt>.</li>
+
+<li>Rework the PassManager to be more flexible</li>
 
-<li>Improve the efficiency of the bytecode loader/writer<br>
-<li>Extend the FunctionPassManager to use a ModuleProvider to stream functions
-    in on demand.  This would improve the efficiency of the JIT.
-<li>Rework the PassManager to be more flexible
 <li>Some transformations and analyses only work on reducible flow graphs.  It
 would be nice to have a transformation which could be "required" by these passes
 which makes irreducible graphs reducible.  This can easily be accomplished
@@ -159,124 +174,187 @@ through code duplication.  See <a
 href="http://citeseer.nj.nec.com/janssen97making.html">Making Graphs Reducible
 with Controlled Node Splitting</a> and perhaps <a
 href="http://doi.acm.org/10.1145/262004.262005">Nesting of Reducible and
-Irreducible Loops</a>.
+Irreducible Loops</a>.</li>
+
 </ol>
 
+</div>
 
 <!-- *********************************************************************** -->
-</ul><table width="100%" bgcolor="#330077" border=0 cellpadding=4 cellspacing=0>
-<tr><td align=center><font color="#EEEEFF" size=+2 face="Georgia,Palatino"><b>
-<a name="new">Adding new capabilities to LLVM
-</b></font></td></tr></table><ul>
+<div class="doc_section">
+  <a name="new">Adding new capabilities to LLVM</a>
+</div>
 <!-- *********************************************************************** -->
 
-Sometimes creating new things is more fun that improving existing things.  These
-projects tend to be more involved and perhaps require more work, but can also be
-very rewarding.<p>
+<div class="doc_text">
+
+<p>Sometimes creating new things is more fun than improving existing things.
+These projects tend to be more involved and perhaps require more work, but can
+also be very rewarding.</p>
+
+</div>
+
 
 <!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="pointeranalysis">Pointer and Alias Analysis
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="newfeaturebugs">Implementing new feature PRs</a>
+</div>
 
-We have a <a href="AliasAnalysis.html">strong base for development</a> of both
-pointer analysis based optimizations as well as pointer analyses themselves.  It
-seems natural to want to take advantage of this...<p>
+<div class="doc_text">
+
+<p>Many ideas for feature requests are stored in LLVM bugzilla.  Just <a href="http://llvm.org/bugs/buglist.cgi?short_desc_type=allwordssubstr&short_desc=&long_desc_type=allwordssubstr&long_desc=&bug_file_loc_type=allwordssubstr&bug_file_loc=&status_whiteboard_type=allwordssubstr&status_whiteboard=&keywords_type=allwords&keywords=new-feature&bug_status=UNCONFIRMED&bug_status=NEW&bug_status=ASSIGNED&bug_status=REOPENED&emailassigned_to1=1&emailtype1=substring&email1=&emailassigned_to2=1&emailreporter2=1&emailcc2=1&emailtype2=substring&email2=&bugidtype=include&bug_id=&votes=&changedin=&chfieldfrom=&chfieldto=Now&chfieldvalue=&cmdtype=doit&namedcmd=All+PRs&newqueryname=&order=Bug+Number&field0-0-0=noop&type0-0-0=noop&value0-0-0=">search for bugs with a "new-feature" keyword</a>.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="pointeranalysis">Pointer and Alias Analysis</a>
+</div>
+
+<div class="doc_text">
+
+<p>We have a <a href="AliasAnalysis.html">strong base for development</a> of
+both pointer analysis based optimizations as well as pointer analyses
+themselves.  It seems natural to want to take advantage of this...</p>
 
 <ol>
 <li>Implement a flow-sensitive context-sensitive alias analysis algorithm<br>
   - Pick one of the somewhat efficient algorithms, but strive for maximum
-    precision
-<li>Implement a flow-sensitive context-insensitive alias analysis algorithm<br>
-  - Just an efficient local algorithm perhaps?
+    precision</li>
 
-<li>Implement an interface to update analyses in response to common code motion
-    transformations
-<li>Implement alias analysis based optimizations:
+<li>Implement a flow-sensitive context-insensitive alias analysis algorithm<br>
+  - Just an efficient local algorithm perhaps?</li>
+
+<li>Implement alias-analysis-based optimizations:
   <ul>
-  <li>Dead store elimination
-  </ul>
+  <li>Dead store elimination</li>
+  <li>...</li>
+  </ul></li>
 </ol>
 
+</div>
+
 <!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="profileguided">Profile Guided Optimization
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="profileguided">Profile Guided Optimization</a>
+</div>
 
-We are getting to the point where we really need a unified infrastructure for
-profile guided optimizations.  It would be wonderful to be able to write profile
-guided transformations which can be performed either at static compile time
-(compile time or offline optimization time) or at runtime in a JIT type setup.
-The LLVM transformation itself shouldn't need to know how it is being used.<p>
+<div class="doc_text">
 
-Ideas for profile guided transformations:<p>
+<p>We now have a unified infrastructure for writing profile-guided
+transformations, which will work either at offline-compile-time or in the JIT,
+but we don't have many transformations.  We would welcome new profile-guided
+transformations as well as improvements to the current profiling system.
+</p>
+
+<p>Ideas for profile guided transformations:</p>
 
 <ol>
-<li>Superblock formation (with many optimizations)
-<li>Loop unrolling/peeling
-<li>Profile directed inlining
-<li>Code layout
-<li>...
-</ol><p>
+<li>Superblock formation (with many optimizations)</li>
+<li>Loop unrolling/peeling</li>
+<li>Profile directed inlining</li>
+<li>Code layout</li>
+<li>...</li>
+</ol>
 
+<p>Improvements to the existing support:</p>
+
+<ol>
+<li>The current block and edge profiling code that gets inserted is very simple
+and inefficient.  Through the use of control-dependence information, many fewer
+counters could be inserted into the code.  Also, if the execution count of a
+loop is known to be a compile-time or runtime constant, all of the counters in
+the loop could be avoided.</li>
+
+<li>You could implement one of the "static profiling" algorithms which analyze a
+piece of code an make educated guesses about the relative execution frequencies
+of various parts of the code.</li>
+
+<li>You could add path profiling support, or adapt the existing LLVM path
+profiling code to work with the generic profiling interfaces.</li>
+</ol>
+
+</div>
 
 <!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="xforms">New Transformations and Analyses
-</b></font></td></tr></table><ul>
+<div class="doc_subsection">
+  <a name="xforms">New Transformations and Analyses</a>
+</div>
+
+<div class="doc_text">
 
 <ol>
 <li>Implement a Dependence Analysis Infrastructure<br>
-     - Design some way to represent and query dep analysis
-<li>Implement a faster Dominator Set Construction Algorithm<br>
-     - A linear time or nearly so algorithm
-<li>Implement a strength reduction pass
-<li>Value range propagation pass
-<li>Implement an unswitching pass
-<li>Write a loop unroller, with a simple heuristic for when to unroll
+     - Design some way to represent and query dep analysis</li>
+<li>Implement a strength reduction pass</li>
+<li>Value range propagation pass</li>
 </ol>
 
+</div>
+
 <!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="x86be">X86 Back-end Improvements
-</b></font></td></tr></table><ul>
+<div class="doc_section">
+  <a name="x86be">X86 Back-end Improvements</a>
+</div>
+
+<div class="doc_text">
 
 <ol>
-<li>Implement a global register allocator
-<li>Implement a better instruction selector
+<li>Implement a better instruction selector</li>
 <li>Implement support for the "switch" instruction without requiring the 
-    lower-switches pass.
+    lower-switches pass.</li>
+<li>Implement interprocedural register allocation. The CallGraphSCCPass can be
+    used to implement a bottom-up analysis that will determine the *actual* 
+    registers clobbered by a function. Use the pass to fine tune register usage 
+    in callers based on *actual* registers used by the callee.</li>
 </ol>
 
+</div>
+
 <!-- ======================================================================= -->
-</ul><table width="50%" bgcolor="#441188" border=0 cellpadding=4 cellspacing=0>
-<tr><td>&nbsp;</td><td width=100%>&nbsp; 
-<font color="#EEEEFF" size=+1 face="Georgia,Palatino"><b>
-<a name="misc_new">Miscellaneous Additions
-</b></font></td></tr></table><ul>
+<div class="doc_section">
+  <a name="misc_new">Miscellaneous Additions</a>
+</div>
+
+<div class="doc_text">
 
 <ol>
-<li>Write a new frontend for some language (Java? OCaml? Forth?)
-<li>Write a new backend for a target (IA64? MIPS? MMIX?)
+<li>Port the <a href="http://www-sop.inria.fr/mimosa/fp/Bigloo/">Bigloo</A>
+Scheme compiler, from Manuel Serrano at INRIA Sophia-Antipolis, to
+output LLVM bytecode. It seems that it can already output .NET
+bytecode, JVM bytecode, and C, so LLVM would ostensibly be another good
+candidate.</li>
+<li>Write a new frontend for C/C++ <b>in</b> C++, giving us the ability to
+directly use LLVM C++ classes from within a compiler rather than use
+C-based wrapper functions a la llvm-gcc.  One possible starting point is the <a
+href="http://www.parashift.com/c++-faq-lite/compiler-dependencies.html#faq-37.11">C++
+yacc grammar by Ed Willink</a>.</li>
+<li>Write a new frontend for some other language (Java? OCaml? Forth?)</li>
+<li>Write a new backend for a target (IA64? MIPS? MMIX?)</li>
+<li>Write a disassembler for machine code that would use TableGen to output 
+<tt>MachineInstr</tt>s for transformations, optimizations, etc.</li>
+<li>Random test vector generator: Use a C grammar to generate random C code;
+run it through llvm-gcc, then run a random set of passes on it using opt.
+Try to crash opt. When opt crashes, use bugpoint to reduce the test case and
+mail the result to yourself.  Repeat ad infinitum.</li>
+<li>Design a simple, recognizable logo.</li>
 </ol>
 
+</div>
 
-<!-- *********************************************************************** -->
-</ul>
 <!-- *********************************************************************** -->
 
-<hr><font size-1>
-<address><a href="mailto:sabre@nondot.org">Chris Lattner</a></address>
-<!-- Created: Tue Aug  6 15:00:33 CDT 2002 -->
-<!-- hhmts start -->
-Last modified: Wed Oct  1 16:48:54 CDT 2003
-<!-- hhmts end -->
-</font></body></html>
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
+
+  <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
+  <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
+
+</body>
+</html>

llvm/docs/Projects.html

@@ -1,135 +1,120 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
 <html>
-	<head>
+<head>
   <title>Creating an LLVM Project</title>
-	</head>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+<body>
 
-	<body bgcolor=white>
-
-	<center><h1>Creating an LLVM Project<br></h1></center>
-
-	<!--===============================================================-->
-	<h2><a name="a">Overview</a><hr></h2>
-	<!--===============================================================-->
-
-	The LLVM build system is designed to facilitate the building of third party
-	projects that use LLVM header files, libraries, and tools.  In order to use
-	these facilities, a Makefile from a project must do the following things:
+<div class="doc_title">Creating an LLVM Project</div>
 
+<ol>
+<li><a href="#overview">Overview</a></li>
+<li><a href="#create">Create a project from the Sample Project</a></li>
+<li><a href="#source">Source tree layout</a></li>
+<li><a href="#makefiles">Writing LLVM-style Makefiles</a>
   <ol>
-		<li>Set environment variables.
-		<p>
-		There are several environment variables that a Makefile needs to set to
-		use the LLVM build system:
-		<dl compact>
-			<dt>LLVM_SRC_ROOT
-			<dd>
-			The root of the LLVM source tree.
-			<p>
+  <li><a href="#reqVars">Required Variables</a></li>
+  <li><a href="#varsBuildDir">Variables for Building Subdirectories</a></li>
+  <li><a href="#varsBuildLib">Variables for Building Libraries</a></li>
+  <li><a href="#varsBuildProg">Variables for Building Programs</a></li>
+  <li><a href="#miscVars">Miscellaneous Variables</a></li>
+  </ol></li>
+<li><a href="#objcode">Placement of object code</a></li>
+<li><a href="#help">Further help</a></li>
+</ol>
 
-			<dt>LLVM_OBJ_ROOT
-			<dd>
-			The root of the LLVM object tree.
-			<p>
+<div class="doc_author">
+  <p>Written by John Criswell</p>
+</div>
 
-			<dt>BUILD_SRC_ROOT
-			<dd>
-			The root of the project's source tree.
-			<p>
+<!-- *********************************************************************** -->
+<div class="doc_section"><a name="overview">Overview</a></div>
+<!-- *********************************************************************** -->
 
-			<dt>BUILD_OBJ_ROOT
-			<dd>
-			The root of the project's object tree.
-			<p>
+<div class="doc_text">
 
-			<dt>BUILD_SRC_DIR
-			<dd>
-			The directory containing the current source to be compiled.
-			<p>
+<p>The LLVM build system is designed to facilitate the building of third party
+projects that use LLVM header files, libraries, and tools.  In order to use
+these facilities, a Makefile from a project must do the following things:</p>
 
-			<dt>BUILD_OBJ_DIR
-			<dd>
-			The directory where the current source will place the new object
-			files.  This should always be the current directory.
-			<p>
+<ol>
+<li>Set environment variables.There are several environment variables that a
+Makefile needs to set to use the LLVM build system:
 
-			<dt>LEVEL
-			<dd>
-			The relative path from the current directory to the root of the
-			object tree.
-			<p>
-		</dl>
+<ul>
+  <li><tt>LLVM_SRC_ROOT</tt> - The root of the LLVM source tree.</li>
+  <li><tt>LLVM_OBJ_ROOT</tt> - The root of the LLVM object tree.</li>
+  <li><tt>BUILD_SRC_ROOT</tt> - The root of the project's source tree.</li>
+  <li><tt>BUILD_OBJ_ROOT</tt> - The root of the project's object tree.</li>
+  <li><tt>BUILD_SRC_DIR</tt> - The directory containing the current source to be
+  compiled.</li>
+  <li><tt>BUILD_OBJ_DIR</tt> - The directory where the current source will place
+  the new object files.  This should always be the current directory.</li>
+  <li><tt>LEVEL</tt> - The relative path from the current directory to the root
+  of the object tree.</li>
+</ul></li>
+<li>Include <tt>Makefile.config</tt> from <tt>$(LLVM_OBJ_ROOT)</tt>.</li>
+<li>Include <tt>Makefile.rules</tt> from <tt>$(LLVM_SRC_ROOT)</tt>.</li>
+</ol>
 
-		<li>Include the LLVM Makefile.config from $(LLVM_OBJ_ROOT).
-		<p>
+<p>There are two ways that you can set all of these variables:</p>
 
-		<li>Include the LLVM Makefile.rules from $(LLVM_SRC_ROOT).
-	</ol>
+<ol>
+<li>You can write your own Makefiles which hard-code these values.</li>
 
-	There are two ways that you can set all of these variables:
-	<ol>
-		<li>
-		You can write your own Makefiles which hard-code these values.
+<li> You can use the pre-made LLVM sample project.  This sample project includes
+Makefiles, a configure script that can be used to configure the location of
+LLVM, and the ability to support multiple object directories from a single
+source directory.</li>
+</ol>
 
-		<li>
-		You can use the pre-made LLVM sample project.  This sample project
-		includes Makefiles, a configure script that can be used to configure
-		the location of LLVM, and the ability to support multiple object
-		directories from a single source directory.
-	</ol>
+<p>This document assumes that you will base your project off of the LLVM sample
+project found in <tt>llvm/projects/sample</tt>.  If you want to devise your own
+build system, studying the sample project and LLVM Makefiles will probably
+provide enough information on how to write your own Makefiles.</p>
 
-	This document assumes that you will base your project off of the LLVM
-	sample project found in <tt>llvm/projects/sample</tt>.  If you want to
-	devise your own build system, studying the sample project and LLVM
-	Makefiles will probably provide enough information on how to write your own
-	Makefiles.
-	<p>
+</div>
 
-	<!--===============================================================-->
-	<h2><a name="a">Create a Project from the Sample Project</a><hr></h2>
-	<!--===============================================================-->
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="create">Create a Project from the Sample Project</a>
+</div>
+<!-- *********************************************************************** -->
 
-	Follow these simple steps to start your project:
+<div class="doc_text">
 
-	<ol>
-		<li>
-		Copy the <tt>llvm/projects/sample</tt> directory to any place
-		of your choosing.  You can place it anywhere you like.  Rename the
-		directory to match the name of your project.
-		<p>
+<p>Follow these simple steps to start your project:</p>
 
-		<li>
-		Add your source code and Makefiles to your source tree.
-		<p>
+<ol>
+<li>Copy the <tt>llvm/projects/sample</tt> directory to any place of your
+choosing.  You can place it anywhere you like.  Rename the directory to match
+the name of your project.</li>
 
-		<li>
-		If you want your Makefiles to be configured by the
-		<tt>configure</tt> script, or if you want to support multiple
-		object directories, add your Makefiles to the <tt>configure</tt>
-		script by adding them into the <tt>autoconf/configure.ac</tt> file.
-		The macro <tt>AC_CONFIG_MAKEFILE</tt> will copy a file, unmodified,
-		from the source directory to the object directory.
+<li>Add your source code and Makefiles to your source tree.</li>
 
-		<p>
-		After updating <tt>autoconf/configure.ac</tt>, regenerate the
-		configure script with these commands:
-		<p>
-		<tt>
-		cd autoconf<br>
-		autoconf -o ../configure
-		</tt>
+<li>If you want your Makefiles to be configured by the <tt>configure</tt>
+script, or if you want to support multiple object directories, add your
+Makefiles to the <tt>configure</tt> script by adding them into the
+<tt>autoconf/configure.ac</tt> file.  The macro <tt>AC_CONFIG_MAKEFILE</tt> will
+copy a file, unmodified, from the source directory to the object directory.</li>
 
-		<p>
+<li>After updating <tt>autoconf/configure.ac</tt>, regenerate the
+configure script with these commands:
 
-		You must be using Autoconf version 2.57 or higher.
-		<p>
+<div class="doc_code">
+<p><tt>% cd autoconf<br>
+       % autoconf -o ../configure</tt></p>
+</div>
 
-		<li>
-		Run <tt>configure</tt> in the directory in which you want to place
-		object code.  Use the following options to tell your project where it
-		can find LLVM:
+<p>You must be using Autoconf version 2.57 or higher.</p></li>
 
-		<dl compact>
+<li>Run <tt>configure</tt> in the directory in which you want to place
+object code.  Use the following options to tell your project where it
+can find LLVM:
+
+  <dl>
     <dt><tt>--with-llvmsrc=&lt;directory&gt;</tt>
     <dd>
     Tell your project where the LLVM source tree is located.
@@ -138,26 +123,32 @@
     <dd>
     Tell your project where the LLVM object tree is located.
   </dl>
-	</ol>
+</ol>
 
-	That's it!  Now all you have to do is type <tt>gmake</tt> in the root of
-	your object directory, and your project should build.
+<p>That's it!  Now all you have to do is type <tt>gmake</tt> in the root of
+your object directory, and your project should build.</p>
 
-	<!--===============================================================-->
-	<h2><a name="Source Tree Layout">Source Tree Layout</a><hr></h2>
-	<!--===============================================================-->
+</div>
 
-	In order to use the LLVM build system, you will want to organize your
-	source code so that it can benefit from the build system's features.
-	Mainly, you want your source tree layout to look similar to the LLVM
-	source tree layout.  The best way to do this is to just copy the
-	project tree from <tt>llvm/projects/sample</tt> and modify it to meet
-	your needs, but you can certainly add to it if you want.
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="source">Source Tree Layout</a>
+</div>
+<!-- *********************************************************************** -->
 
-	Underneath your top level directory, you should have the following
-	directories:
+<div class="doc_text">
 
-	<dl compact>
+<p>In order to use the LLVM build system, you will want to organize your
+source code so that it can benefit from the build system's features.
+Mainly, you want your source tree layout to look similar to the LLVM
+source tree layout.  The best way to do this is to just copy the
+project tree from <tt>llvm/projects/sample</tt> and modify it to meet
+your needs, but you can certainly add to it if you want.</p>
+
+<p>Underneath your top level directory, you should have the following
+directories:</p>
+
+<dl>
   <dt><b>lib</b>
   <dd>
   This subdirectory should contain all of your library source
@@ -222,31 +213,54 @@
     need to find a way to use the source provided within that directory
     on your own.
   </ul>
-	</dl>
+</dl>
 
-	Typically, you will want to build your <b>lib</b> directory first
-	followed by your <b>tools</b> directory.
+<p>Typically, you will want to build your <b>lib</b> directory first followed by
+your <b>tools</b> directory.</p>
 
-	<!--===============================================================-->
-	<h2><a name="Makefile Variables">Writing LLVM Style Makefiles</a><hr></h2>
-	<!--===============================================================-->
-	The LLVM build system provides a convenient way to build libraries and
-	executables.  Most of your project Makefiles will only need to define a few
-	variables.  Below is a list of the variables one can set and what they can
-	do:
+</div>
 
-	<h3> Required Variables </h3>
-	<dl compact>
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="makefiles">Writing LLVM Style Makefiles</a>
+</div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>The LLVM build system provides a convenient way to build libraries and
+executables.  Most of your project Makefiles will only need to define a few
+variables.  Below is a list of the variables one can set and what they can
+do:</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="reqVars">Required Variables</a>
+</div>
+
+<div class="doc_text">
+
+<dl>
   <dt>LEVEL
   <dd>
   This variable is the relative path from this Makefile to the
   top directory of your project's source code.  For example, if
-		your source code is in /tmp/src, then the Makefile in
-		/tmp/src/jump/high would set LEVEL to "../..".
-	</dl>
+  your source code is in <tt>/tmp/src</tt>, then the Makefile in
+  <tt>/tmp/src/jump/high</tt> would set <tt>LEVEL</tt> to <tt>"../.."</tt>.
+</dl>
 
-	<h3> Variables for Building Subdirectories</h3>
-	<dl compact>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="varsBuildDir">Variables for Building Subdirectories</a>
+</div>
+
+<div class="doc_text">
+
+<dl>
   <dt>DIRS
   <dd>
   This is a space separated list of subdirectories that should be
@@ -266,10 +280,18 @@
   This is a list of directories that can be built if they exist,
   but will not cause an error if they do not exist.  They are
   built serially in the order in which they are listed.
-	</dl>
+</dl>
 
-	<h3> Variables for Building Libraries</h3>
-	<dl compact>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="varsBuildLib">Variables for Building Libraries</a>
+</div>
+
+<div class="doc_text">
+
+<dl>
   <dt>LIBRARYNAME
   <dd>
   This variable contains the base name of the library that will
@@ -289,10 +311,18 @@
   <dd>
   If SHARED_LIBRARY is defined in your Makefile, a shared
   (or dynamic) library will be built.
-	</dl>
+</dl>
 
-	<h3> Variables for Building Programs</h3>
-	<dl compact>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="varsBuildProg">Variables for Building Programs</a>
+</div>
+
+<div class="doc_text">
+
+<dl>
   <dt>TOOLNAME
   <dd>
   This variable contains the name of the program that will
@@ -322,12 +352,20 @@
   following line in your <tt>Makefile</tt>:
   <p>
   <tt>
-		LIBS+=-lsample
+  LIBS += -lsample
   </tt>
-	</dl>
+</dl>
 
-	<h3> Miscellaneous Variables</h3>
-	<dl compact>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="miscVars">Miscellaneous Variables</a>
+</div>
+
+<div class="doc_text">
+
+<dl>
   <dt>ExtraSource
   <dd>
   This variable contains a space separated list of extra source
@@ -347,41 +385,67 @@
   opposed to overwriting them.  The master Makefiles may already
   have useful options in them that you may not want to overwrite.
   <p>
-	</dl>
+</dl>
 
-	<!--===============================================================-->
-	<h2><a name="objcode">Placement of Object Code</a><hr></h2>
-	<!--===============================================================-->
+</div>
 
-	The final location of built libraries and executables will depend upon
-	whether you do a Debug, Release, or Profile build.
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="objcode">Placement of Object Code</a>
+</div>
+<!-- *********************************************************************** -->
 
-	<dl compact>
+<div class="doc_text">
+
+<p>The final location of built libraries and executables will depend upon
+whether you do a Debug, Release, or Profile build.</p>
+
+<dl>
   <dt>Libraries
   <dd>
   All libraries (static and dynamic) will be stored in
-		BUILD_OBJ_ROOT/lib/&lt;type&gt;, where type is <tt>Debug</tt>,
+  <tt>BUILD_OBJ_ROOT/lib/&lt;type&gt;</tt>, where type is <tt>Debug</tt>,
   <tt>Release</tt>, or <tt>Profile</tt> for a debug, optimized, or
-		profiled build, respectively.
-		<p>
+  profiled build, respectively.<p>
 
   <dt>Executables
-		<dd>
-		All executables will be stored in BUILD_OBJ_ROOT/lib/&lt;type&gt;,
-		where type is <tt>Debug</tt>, <tt>Release</tt>, or <tt>Profile</tt> for
-		a debug, optimized, or profiled build, respectively.
-	</dl>
+  <dd>All executables will be stored in
+  <tt>BUILD_OBJ_ROOT/tools/&lt;type&gt;</tt>, where type is <tt>Debug</tt>,
+  <tt>Release</tt>, or <tt>Profile</tt> for a debug, optimized, or profiled
+  build, respectively.
+</dl>
 
-	<!--===============================================================-->
-	<h2><a name="help">Further Help</a><hr></h2>
-	<!--===============================================================-->
+</div>
 
-	If you have any questions or need any help creating an LLVM project,
-	the LLVM team would be more than happy to help.  You can always post your
-	questions to the LLVM Developers Mailing List (<a
-	href="mailto:llvmdev.cs.uiuc.edu">llvmdev@cs.uiuc.edu</a>).
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="help">Further Help</a>
+</div>
+<!-- *********************************************************************** -->
 
+<div class="doc_text">
+
+<p>If you have any questions or need any help creating an LLVM project,
+the LLVM team would be more than happy to help.  You can always post your
+questions to the <a
+href="http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev">LLVM Developers
+Mailing List</a>.</p>
+
+</div>
+  
+<!-- *********************************************************************** -->
 <hr>
-Written by <a href="mailto:criswell@uiuc.edu">John Criswell</a>.
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" /></a>
+
+  <a href="mailto:criswell@uiuc.edu">John Criswell</a><br>
+  <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a>
+  <br>
+  Last modified: $Date$
+</address>
+
 </body>
 </html>

llvm/docs/ReleaseTasks.html

@@ -1,179 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
-  <title>LLVM Public Release Project</title>
-</head>
-<body bgcolor="white">
-<center>
-<h1><font size="7">LLVM Public Release Project</font></h1>
-</center>
-<ul>
-  <li><a href="#what">What is this?</a> </li>
-  <li><a href="#priorities">Priorities</a>
-    <ol>
-      <li><a href="#high">High Priority</a> </li>
-      <li><a href="#medium">Medimum Priority</a> </li>
-      <li><a href="#low">Low Priority</a> </li>
-    </ol>
-  </li>
-</ul>
-<br>
-<!-- *********************************************************************** -->
-<table width="100%" bgcolor="#330077" border="0" cellpadding="4"
- cellspacing="0">
-  <tbody>
-    <tr>
-      <td align="center"><font color="#eeeeff" size="+2"
- face="Georgia,Palatino"><b> <a name="what">What is this? </a></b><a
- name="what"></a></font></td>
-    </tr>
-  </tbody>
-</table>
-<ul>
-<!-- *********************************************************************** -->
-This document is a list of things to do before the LLVM project is
-publicly released. &nbsp;It will provide a checklist so that we know
-what has been done and what is left to be done. &nbsp;It will also keep
-a "wishlist" of desirable features.
-  <p><!-- *********************************************************************** -->
-  </p>
-</ul>
-<table width="100%" bgcolor="#330077" border="0" cellpadding="4"
- cellspacing="0">
-  <tbody>
-    <tr>
-      <td align="center"><font color="#eeeeff" size="+2"
- face="Georgia,Palatino"><b> <a name="priorities">Priorities</a></b><a
- name="improving"></a></font></td>
-    </tr>
-  </tbody>
-</table>
-<ul>
-<!-- *********************************************************************** -->The
-list of things to do...
-  <p><!-- ======================================================================= -->
-  </p>
-</ul>
-<table width="50%" bgcolor="#441188" border="0" cellpadding="4"
- cellspacing="0">
-  <tbody>
-    <tr>
-      <td>&nbsp;</td>
-      <td width="100%">&nbsp;&nbsp;<font color="#eeeeff" size="+1"
- face="Georgia,Palatino"><b><a name="high">High Priority</a></b><a
- name="glibc"></a></font></td>
-    </tr>
-  </tbody>
-</table>
-<ul>
-  <ul>
-    <ul>
-    </ul>
-    <li>Documentation</li>
-    <ul>
-      <li>Expand documentation on creating an LLVM project.</li>
-    </ul>
-    <li>Licenses</li>
-    <ul>
-      <li>Create license files for anything in the distribution that is
-not under our license.<br>
-      </li>
-    </ul>
-    <li>Ensure SafeCode builds.</li>
-    <li>Create a system for managing development and releases (i.e. CVS
-branching, labeling revisions, etc).</li>
-    <li>Create a web page for downloading LLVM.
-    <li>Create a method for requesting the GCC front end source code.
-  </ul>
-  <p><!-- ======================================================================= -->
-  </p>
-</ul>
-<table width="50%" bgcolor="#441188" border="0" cellpadding="4"
- cellspacing="0">
-  <tbody>
-    <tr>
-      <td>&nbsp;</td>
-      <td width="100%">&nbsp;&nbsp;<font color="#eeeeff" size="+1"
- face="Georgia,Palatino"><b><a name="medium">Medium Priority</a></b><a
- name="NightlyTest"></a></font></td>
-    </tr>
-  </tbody>
-</table>
-<ul>
-  <ul>
-    <li>Improve documentation on how to create an LLVM project.<br>
-    </li>
-    <li>Test Suite</li>
-    <ul>
-      <li>Add Feature and Regression tests to nightly tester.</li>
-      <li>Develop better QMTest database method.<br>
-      </li>
-    </ul>
-    <li>Write regression tests.</li>
-    <ul>
-      <li>The C++ constructor on dlopen() bug on Solaris.</li>
-    </ul>
-  </ul>
-  <ul>
-    <li>Release Management</li>
-  </ul>
-  <ul>
-    <ul>
-      <li>Find and implement a bug reporting system (i.e. Bugzilla).</li>
-    </ul>
-  </ul>
-  <p><!-- ======================================================================= -->
-  </p>
-</ul>
-<table width="50%" bgcolor="#441188" border="0" cellpadding="4"
- cellspacing="0">
-  <tbody>
-    <tr>
-      <td>&nbsp;</td>
-      <td width="100%">&nbsp;&nbsp;<font color="#eeeeff" size="+1"
- face="Georgia,Palatino"><b><a name="low">Low Priority</a></b><a
- name="programs"></a></font></td>
-    </tr>
-  </tbody>
-</table>
-<ul>
-  <ul>
-    <li>GCC C Front End</li>
-    <ul>
-      <li>Place the C front end into the CVS repository.</li>
-      <li>Ensure that the C front end compiles and installs nicely.</li>
-    </ul>
-    <li>Create an installer for the software.</li>
-    <li>Testing</li>
-    <ul>
-      <li>Create descriptions of what each test is doing (test
-specifications).<br>
-      </li>
-      <li>Test LLVM on various Linux distributions.</li>
-      <li>Test LLVM on various Solaris versions.</li>
-      <li>Test LLVM on Solaris/x86.</li>
-    </ul>
-    <ul>
-    </ul>
-    <li>Documentation</li>
-    <ul>
-      <li>Create man pages for the LLVM utilities.</li>
-      <li>Create man pages for the LLVM libraries.</li>
-    </ul>
-    <li>Rewrite this page without Netscape Composer :)<br>
-    </li>
-  </ul>
-</ul>
-<font size-1="">
-<address><a href="mailto:criswell@cs.uiuc.edu">John Criswell</a></address>
-<!-- Created: Tue Aug  6 15:00:33 CDT 2002 --><!-- hhmts start --> Last
-modified: Sat May 31 14:54:03 CDT 2003<!-- hhmts end --> </font> <br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-</body>
-</html>

llvm/docs/SystemLibrary.html

@@ -0,0 +1,203 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <title>System Library</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+<body>
+
+<div class="doc_title">System Library</div>
+
+<div class="doc_warning">
+  <p>Warning: This document is a work in progress.</p>
+</div>
+
+<ul>
+  <li><a href="#abstract">Abstract</a></li>
+  <li><a href="#requirements">System Library Requirements</a>
+  <ol>
+    <li><a href="#headers">Hide System Header Files</a></li>
+    <li><a href="#nofunc">No Exposed Functions</a></li>
+    <li><a href="#nodata">No Exposed Data</a></li>
+    <li><a href="#xcptns">No Exceptions</a></li>
+    <li><a href="#errors">Standard Error Codes</a></li>
+    <li><a href="#overhead">Minimize Overhead</a></li>
+  </ol></li>
+  <li><a href="#design">System Library Design</a>
+  <ol>
+    <li><a href="#opaque">Use Opaque Classes</a></li>
+    <li><a href="#common">Common Implementations</a></li>
+    <li><a href="#multi_imps">Multiple Implementations</a></li>
+    <li><a href="#lowlevel">Use Low Level Interfaces</a></li>
+    <li><a href="#memalloc">No Memory Allocation</a></li>
+    <li><a href="#virtuals">No Virtual Methods</a></li>
+  </ol></li>
+  <li><a href="#detail">System Library Details</a>
+  <ol>
+    <li><a href="#bug">Tracking Bugzilla Bug: 351</a></li>
+    <li><a href="#refimpl">Reference Implementatation</a></li>
+  </ol></li>
+</ul>
+
+<div class="doc_author">
+  <p>Written by <a href="rspencer@x10sys.com">Reid Spencer</a></p>
+</div>
+
+
+<!-- *********************************************************************** -->
+<div class="doc_section"><a name="abstract">Abstract</a></div>
+<div class="doc_text">
+  <p>This document describes the requirements, design, and implementation 
+  details of LLVM's System Library. The library is composed of the header files
+  in <tt>llvm/include/llvm/System</tt> and the source files in 
+  <tt>llvm/lib/System</tt>. The goal of this library is to completely shield 
+  LLVM from the variations in operating system interfaces. By centralizing 
+  LLVM's use of operating system interfaces, we make it possible for the LLVM
+  tool chain and runtime libraries to be more easily ported to new platforms.
+  The library also unclutters the rest of LLVM from #ifdef use and special
+  cases for specific operating systems.</p>
+  <p>The System Library was donated to LLVM by Reid Spencer who formulated the
+  original design as part of the eXtensible Programming System (XPS) which is
+  based, in part, on LLVM.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section">
+  <a name="requirements">System Library Requirements</a>
+</div>
+<div class="doc_text">
+  <p>The System library's requirements are aimed at shielding LLVM from the
+  variations in operating system interfaces. The following sections define the
+  requirements needed to fulfill this objective.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="headers">Hide System Header Files</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="nofunc">No Exposed Functions</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="nodata">No Exposed Data</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="xcptns">No Exceptions</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="errors">Standard Error Codes</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="overhead">Minimize Overhead</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section"><a name="design">System Library Design</a></div>
+<div class="doc_text">
+  <p>In order to fulfill the requirements of the system library, strict design
+  objectives must be maintained in the library as it evolves.  The goal here 
+  is to provide interfaces to operating system concepts (files, memory maps, 
+  sockets, signals, locking, etc) efficiently and in such a way that the 
+  remainder of LLVM is completely operating system agnostic.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="opaque">Use Opaque Classes</a></div>
+<div class="doc_text">
+  <p>no public data</p>
+  <p>onlyprimitive typed private/protected data</p>
+  <p>data size is "right" for platform, not max of all platforms</p>
+  <p>each class corresponds to O/S concept</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="common">Common Implementations</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="multi_imps">Multiple Implementations</a>
+</div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="low_level">Use Low Level Interfaces</a>
+</div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="memalloc">No Memory Allocation</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="virtuals">No Virtual Methods</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section"><a name="detail">System Library Details</a></div>
+<div class="doc_text">
+  <p>To be written.</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="bug">Bug 351</a></div>
+<div class="doc_text">
+  <p>See <a href="http://llvm.cs.uiuc.edu/PR351">bug 351</a>
+  for further details on the progress of this work</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="refimpl">Reference Implementation</a>
+</div>
+<div class="doc_text">
+  <p>The <tt>linux</tt> implementation of the system library will always be the
+  reference implementation. This means that (a) the concepts defined by the
+  linux must be identically replicated in the other implementations and (b) the
+  linux implementation must always be complete (provide implementations for all
+  concepts).</p>
+</div>
+
+<!-- *********************************************************************** -->
+
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
+
+  <a href="mailto:rspencer@x10sys.com">Reid Spencer</a><br>
+  <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
+</body>
+</html>

llvm/docs/TableGenFundamentals.html

@@ -0,0 +1,565 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <title>TableGen Fundamentals</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+<body>
+
+<div class="doc_title">TableGen Fundamentals</div>
+
+<div class="doc_text">
+<ul>
+  <li><a href="#introduction">Introduction</a>
+  <ol>
+    <li><a href="#concepts">Basic concepts</a></li>
+    <li><a href="#example">An example record</a></li>
+    <li><a href="#running">Running TableGen</a></li>
+  </ol></li>
+  <li><a href="#syntax">TableGen syntax</a>
+  <ol>
+    <li><a href="#primitives">TableGen primitives</a>
+    <ol>
+      <li><a href="#comments">TableGen comments</a></li>
+      <li><a href="#types">The TableGen type system</a></li>
+      <li><a href="#values">TableGen values and expressions</a></li>
+    </ol></li>
+    <li><a href="#classesdefs">Classes and definitions</a>
+    <ol>
+      <li><a href="#valuedef">Value definitions</a></li>
+      <li><a href="#recordlet">'let' expressions</a></li>
+      <li><a href="#templateargs">Class template arguments</a></li>
+    </ol></li>
+    <li><a href="#filescope">File scope entities</a>
+    <ol>
+      <li><a href="#include">File inclusion</a></li>
+      <li><a href="#globallet">'let' expressions</a></li>
+    </ol></li>
+  </ol></li>
+  <li><a href="#backends">TableGen backends</a>
+  <ol>
+    <li><a href="#">todo</a></li>
+  </ol></li>
+</ul>
+</div>
+
+<div class="doc_author">
+  <p>Written by <a href="mailto:sabre@nondot.org">Chris Lattner</a></p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section"><a name="introduction">Introduction</a></div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+
+<p>TableGen's purpose is to help a human develop and maintain records of
+domain-specific information.  Because there may be a large number of these
+records, it is specifically designed to allow writing flexible descriptions and
+for common features of these records to be factored out.  This reduces the
+amount of duplication in the description, reduces the chance of error, and
+makes it easier to structure domain specific information.</p>
+
+<p>The core part of TableGen <a href="#syntax">parses a file</a>, instantiates
+the declarations, and hands the result off to a domain-specific "<a
+href="#backends">TableGen backend</a>" for processing.  The current major user
+of TableGen is the <a href="CodeGenerator.html">LLVM code generator</a>.</p>
+
+<p>Note that if you work on TableGen much, and use emacs or vim, that you can
+find an emacs "TableGen mode" and a vim language file in
+<tt>llvm/utils/emacs</tt> and <tt>llvm/utils/vim</tt> directory of your LLVM
+distribution, respectively.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="running">Basic concepts</a></div>
+
+<div class="doc_text">
+
+<p>TableGen files consist of two key parts: 'classes' and 'definitions', both
+of which are considered 'records'.</p>
+
+<p><b>TableGen records</b> have a unique name, a list of values, and a list of
+superclasses.  The list of values is main data that TableGen builds for each
+record, it is this that holds the domain specific information for the
+application.  The interpretation of this data is left to a specific <a
+href="#backends">TableGen backend</a>, but the structure and format rules are
+taken care of and fixed by TableGen.</p>
+
+<p><b>TableGen definitions</b> are the concrete form of 'records'.  These
+generally do not have any undefined values, and are marked with the
+'<tt>def</tt>' keyword.</p>
+
+<p><b>TableGen classes</b> are abstract records that are used to build and
+describe other records.  These 'classes' allow the end-user to build
+abstractions for either the domain they are targetting (such as "Register",
+"RegisterClass", and "Instruction" in the LLVM code generator) or for the
+implementor to help factor out common properties of records (such as "FPInst",
+which is used to represent floating point instructions in the X86 backend).
+TableGen keeps track of all of the classes that are used to build up a
+definition, so the backend can find all definitions of a particular class, such
+as "Instruction".</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="example">An example record</a></div>
+
+<div class="doc_text">
+
+<p>With no other arguments, TableGen parses the specified file and prints out
+all of the classes, then all of the definitions.  This is a good way to see what
+the various definitions expand to fully.  Running this on the <tt>X86.td</tt>
+file prints this (at the time of this writing):</p>
+
+<pre>
+...
+<b>def</b> ADDrr8 {    <i>// Instruction X86Inst I2A8 Pattern</i>
+  <b>string</b> Name = "add";
+  <b>string</b> Namespace = "X86";
+  <b>list</b>&lt;Register&gt; Uses = [];
+  <b>list</b>&lt;Register&gt; Defs = [];
+  <b>bit</b> isReturn = 0;
+  <b>bit</b> isBranch = 0;
+  <b>bit</b> isCall = 0;
+  <b>bit</b> isTwoAddress = 1;
+  <b>bit</b> isTerminator = 0;
+  <b>dag</b> Pattern = (set R8, (plus R8, R8));
+  <b>bits</b>&lt;8&gt; Opcode = { 0, 0, 0, 0, 0, 0, 0, 0 };
+  Format Form = MRMDestReg;
+  <b>bits</b>&lt;5&gt; FormBits = { 0, 0, 0, 1, 1 };
+  ArgType Type = Arg8;
+  <b>bits</b>&lt;3&gt; TypeBits = { 0, 0, 1 };
+  <b>bit</b> hasOpSizePrefix = 0;
+  <b>bit</b> printImplicitUses = 0;
+  <b>bits</b>&lt;4&gt; Prefix = { 0, 0, 0, 0 };
+  FPFormat FPForm = ?;
+  <b>bits</b>&lt;3&gt; FPFormBits = { 0, 0, 0 };
+}
+...
+</pre>
+
+<p>This definition corresponds to an 8-bit register-register add instruction in
+the X86.  The string after the '<tt>def</tt>' string indicates the name of the
+record ("<tt>ADDrr8</tt>" in this case), and the comment at the end of the line
+indicates the superclasses of the definition.  The body of the record contains
+all of the data that TableGen assembled for the record, indicating that the
+instruction is part of the "X86" namespace, should be printed as "<tt>add</tt>"
+in the assembly file, it is a two-address instruction, has a particular
+encoding, etc.  The contents and semantics of the information in the record is
+specific to the needs of the X86 backend, and is only shown as an example.</p>
+
+<p>As you can see, a lot of information is needed for every instruction
+supported by the code generator, and specifying it all manually would be
+unmaintainble, prone to bugs, and tiring to do in the first place.  Because we
+are using TableGen, all of the information was derived from the following
+definition:</p>
+
+<pre>
+<b>def</b> ADDrr8   : I2A8&lt;"add", 0x00, MRMDestReg&gt;,
+               Pattern&lt;(set R8, (plus R8, R8))&gt;;
+</pre>
+
+<p>This definition makes use of the custom I2A8 (two address instruction with
+8-bit operand) class, which is defined in the X86-specific TableGen file to
+factor out the common features that instructions of its class share.  A key
+feature of TableGen is that it allows the end-user to define the abstractions
+they prefer to use when describing their information.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="running">Running TableGen</a></div>
+
+<div class="doc_text">
+
+<p>TableGen runs just like any other LLVM tool.  The first (optional) argument
+specifies the file to read.  If a filename is not specified, <tt>tblgen</tt>
+reads from standard input.</p>
+
+<p>To be useful, one of the <a href="#backends">TableGen backends</a> must be
+used.  These backends are selectable on the command line (type '<tt>tblgen
+--help</tt>' for a list).  For example, to get a list of all of the definitions
+that subclass a particular type (which can be useful for building up an enum
+list of these records), use the <tt>--print-enums</tt> option:</p>
+
+<pre>
+$ tblgen X86.td -print-enums -class=Register
+AH, AL, AX, BH, BL, BP, BX, CH, CL, CX, DH, DI, DL, DX,
+EAX, EBP, EBX, ECX, EDI, EDX, ESI, ESP, FP0, FP1, FP2, FP3, FP4, FP5, FP6,
+SI, SP, ST0, ST1, ST2, ST3, ST4, ST5, ST6, ST7, 
+
+$ tblgen X86.td -print-enums -class=Instruction 
+ADCrr32, ADDri16, ADDri16b, ADDri32, ADDri32b, ADDri8, ADDrr16, ADDrr32,
+ADDrr8, ADJCALLSTACKDOWN, ADJCALLSTACKUP, ANDri16, ANDri16b, ANDri32, ANDri32b,
+ANDri8, ANDrr16, ANDrr32, ANDrr8, BSWAPr32, CALLm32, CALLpcrel32, ...
+</pre>
+
+<p>The default backend prints out all of the records, as described <a
+href="#example">above</a>.</p>
+
+<p>If you plan to use TableGen for some purpose, you will most likely have to
+<a href="#backends">write a backend</a> that extracts the information specific
+to what you need and formats it in the appropriate way.</p>
+
+</div>
+
+
+<!-- *********************************************************************** -->
+<div class="doc_section"><a name="syntax">TableGen syntax</a></div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>TableGen doesn't care about the meaning of data (that is up to the backend
+to define), but it does care about syntax, and it enforces a simple type system.
+This section describes the syntax and the constructs allowed in a TableGen file.
+</p>
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection"><a name="primitives">TableGen primitives</a></div>
+
+<!-- -------------------------------------------------------------------------->
+<div class="doc_subsubsection"><a name="comments">TableGen comments</a></div>
+
+<div class="doc_text">
+<p>TableGen supports BCPL style "<tt>//</tt>" comments, which run to the end of
+the line, and it also supports <b>nestable</b> "<tt>/* */</tt>" comments.</p>
+</div>
+
+<!-- -------------------------------------------------------------------------->
+<div class="doc_subsubsection">
+  <a name="types">The TableGen type system</a>
+</div>
+
+<div class="doc_text">
+<p>TableGen files are strongly typed, in a simple (but complete) type-system.
+These types are used to perform automatic conversions, check for errors, and to
+help interface designers constrain the input that they allow.  Every <a
+href="#valuedef">value definition</a> is required to have an associated type.
+</p>
+
+<p>TableGen supports a mixture of very low-level types (such as <tt>bit</tt>)
+and very high-level types (such as <tt>dag</tt>).  This flexibility is what
+allows it to describe a wide range of information conveniently and compactly.
+The TableGen types are:</p>
+
+<ul>
+<li>"<tt><b>bit</b></tt>" - A 'bit' is a boolean value that can hold either 0 or
+1.</li>
+
+<li>"<tt><b>int</b></tt>" - The 'int' type represents a simple 32-bit integer
+value, such as 5.</li>
+
+<li>"<tt><b>string</b></tt>" - The 'string' type represents an ordered sequence
+of characters of arbitrary length.</li>
+
+<li>"<tt><b>bits</b>&lt;n&gt;</tt>" - A 'bits' type is an arbitrary, but fixed,
+size integer that is broken up into individual bits.  This type is useful
+because it can handle some bits being defined while others are undefined.</li>
+
+<li>"<tt><b>list</b>&lt;ty&gt;</tt>" - This type represents a list whose
+elements are some other type.  The contained type is arbitrary: it can even be
+another list type.</li>
+
+<li>Class type - Specifying a class name in a type context means that the
+defined value must be a subclass of the specified class.  This is useful in
+conjunction with the "list" type, for example, to constrain the elements of the
+list to a common base class (e.g., a <tt><b>list</b>&lt;Register&gt;</tt> can
+only contain definitions derived from the "<tt>Register</tt>" class).</li>
+
+<li>"<tt><b>code</b></tt>" - This represents a big hunk of text.  NOTE: I don't
+remember why this is distinct from string!</li>
+
+<li>"<tt><b>dag</b></tt>" - This type represents a nestable directed graph of
+elements.</li>
+</ul>
+
+<p>To date, these types have been sufficient for describing things that
+TableGen has been used for, but it is straight-forward to extend this list if
+needed.</p>
+
+</div>
+
+<!-- -------------------------------------------------------------------------->
+<div class="doc_subsubsection">
+  <a name="values">TableGen values and expressions</a>
+</div>
+
+<div class="doc_text">
+
+<p>TableGen allows for a pretty reasonable number of different expression forms
+when building up values.  These forms allow the TableGen file to be written in a
+natural syntax and flavor for the application.  The current expression forms
+supported include:</p>
+
+<ul>
+<li><tt>?</tt> - uninitialized field</li>
+<li><tt>0b1001011</tt> - binary integer value</li>
+<li><tt>07654321</tt> - octal integer value (indicated by a leading 0)</li>
+<li><tt>7</tt> - decimal integer value</li>
+<li><tt>0x7F</tt> - hexadecimal integer value</li>
+<li><tt>"foo"</tt> - string value</li>
+<li><tt>[{ ... }]</tt> - code fragment</li>
+<li><tt>[ X, Y, Z ]</tt> - list value.</li>
+<li><tt>{ a, b, c }</tt> - initializer for a "bits&lt;3&gt;" value</li>
+<li><tt>value</tt> - value reference</li>
+<li><tt>value{17}</tt> - access to one bit of a value</li>
+<li><tt>value{15-17}</tt> - access to multiple bits of a value</li>
+<li><tt>DEF</tt> - reference to a record definition</li>
+<li><tt>X.Y</tt> - reference to the subfield of a value</li>
+<li><tt>list[4-7,17,2-3]</tt> - A slice of the 'list' list, including elements 
+4,5,6,7,17,2, and 3 from it.  Elements may be included multiple times.</li>
+<li><tt>(DEF a, b)</tt> - a dag value.  The first element is required to be a
+record definition, the remaining elements in the list may be arbitrary other
+values, including nested `<tt>dag</tt>' values.</li>
+</ul>
+
+<p>Note that all of the values have rules specifying how they convert to values
+for different types.  These rules allow you to assign a value like "7" to a
+"bits&lt;4&gt;" value, for example.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="classesdefs">Classes and definitions</a>
+</div>
+
+<div class="doc_text">
+
+<p>As mentioned in the <a href="#concepts">intro</a>, classes and definitions
+(collectively known as 'records') in TableGen are the main high-level unit of
+information that TableGen collects.  Records are defined with a <tt>def</tt> or
+<tt>class</tt> keyword, the record name, and an optional list of "<a
+href="#templateargs">template arguments</a>".  If the record has superclasses,
+they are specified as a comma seperated list that starts with a colon character
+(":").  If <a href="#valuedef">value definitions</a> or <a href="#recordlet">let
+expressions</a> are needed for the class, they are enclosed in curly braces
+("{}"); otherwise, the record ends with a semicolon.  Here is a simple TableGen
+file:</p>
+
+<pre>
+<b>class</b> C { <b>bit</b> V = 1; }
+<b>def</b> X : C;
+<b>def</b> Y : C {
+  <b>string</b> Greeting = "hello";
+}
+</pre>
+
+<p>This example defines two definitions, <tt>X</tt> and <tt>Y</tt>, both of
+which derive from the <tt>C</tt> class.  Because of this, they both get the
+<tt>V</tt> bit value.  The <tt>Y</tt> definition also gets the Greeting member
+as well.</p>
+
+<p>In general, classes are useful for collecting together the commonality
+between a group of records and isolating it in a single place.  Also, classes
+permit the specification of default values for their subclasses, allowing the
+subclasses to override them as they wish.</p>
+
+</div>
+
+<!---------------------------------------------------------------------------->
+<div class="doc_subsubsection">
+  <a name="valuedef">Value definitions</a>
+</div>
+
+<div class="doc_text">
+<p>Value definitions define named entries in records.  A value must be defined
+before it can be referred to as the operand for another value definition or
+before the value is reset with a <a href="#recordlet">let expression</a>.  A
+value is defined by specifying a <a href="#types">TableGen type</a> and a name.
+If an initial value is available, it may be specified after the type with an
+equal sign.  Value definitions require terminating semicolons.</p>
+</div>
+
+<!-- -------------------------------------------------------------------------->
+<div class="doc_subsubsection">
+  <a name="recordlet">'let' expressions</a>
+</div>
+
+<div class="doc_text">
+<p>A record-level let expression is used to change the value of a value
+definition in a record.  This is primarily useful when a superclass defines a
+value that a derived class or definition wants to override.  Let expressions
+consist of the '<tt>let</tt>' keyword followed by a value name, an equal sign
+("="), and a new value.  For example, a new class could be added to the example
+above, redefining the <tt>V</tt> field for all of its subclasses:</p>
+
+<pre>
+<b>class</b> D : C { let V = 0; }
+<b>def</b> Z : D;
+</pre>
+
+<p>In this case, the <tt>Z</tt> definition will have a zero value for its "V"
+value, despite the fact that it derives (indirectly) from the <tt>C</tt> class,
+because the <tt>D</tt> class overrode its value.</p>
+
+</div>
+
+<!-- -------------------------------------------------------------------------->
+<div class="doc_subsubsection">
+  <a name="templateargs">Class template arguments</a>
+</div>
+
+<div class="doc_text">
+<p>TableGen permits the definition of parameterized classes as well as normal
+concrete classes.  Parameterized TableGen classes specify a list of variable
+bindings (which may optionally have defaults) that are bound when used.  Here is
+a simple example:</p>
+
+<pre>
+<b>class</b> FPFormat&lt;<b>bits</b>&lt;3&gt; val&gt; {
+  <b>bits</b>&lt;3&gt; Value = val;
+}
+<b>def</b> NotFP      : FPFormat&lt;0&gt;;
+<b>def</b> ZeroArgFP  : FPFormat&lt;1&gt;;
+<b>def</b> OneArgFP   : FPFormat&lt;2&gt;;
+<b>def</b> OneArgFPRW : FPFormat&lt;3&gt;;
+<b>def</b> TwoArgFP   : FPFormat&lt;4&gt;;
+<b>def</b> SpecialFP  : FPFormat&lt;5&gt;;
+</pre>
+
+<p>In this case, template arguments are used as a space efficient way to specify
+a list of "enumeration values", each with a "Value" field set to the specified
+integer.</p>
+
+<p>The more esoteric forms of <a href="#values">TableGen expressions</a> are
+useful in conjunction with template arguments.  As an example:</p>
+
+<pre>
+<b>class</b> ModRefVal&lt;<b>bits</b>&lt;2&gt; val&gt; {
+  <b>bits</b>&lt;2&gt; Value = val;
+}
+
+<b>def</b> None   : ModRefVal&lt;0&gt;;
+<b>def</b> Mod    : ModRefVal&lt;1&gt;;
+<b>def</b> Ref    : ModRefVal&lt;2&gt;;
+<b>def</b> ModRef : ModRefVal&lt;3&gt;;
+
+<b>class</b> Value&lt;ModRefVal MR&gt; {
+  <i>// decode some information into a more convenient format, while providing
+  // a nice interface to the user of the "Value" class.</i>
+  <b>bit</b> isMod = MR.Value{0};
+  <b>bit</b> isRef = MR.Value{1};
+
+  <i>// other stuff...</i>
+}
+
+<i>// Example uses</i>
+<b>def</b> bork : Value&lt;Mod&gt;;
+<b>def</b> zork : Value&lt;Ref&gt;;
+<b>def</b> hork : Value&lt;ModRef&gt;;
+</pre>
+
+<p>This is obviously a contrived example, but it shows how template arguments
+can be used to decouple the interface provided to the user of the class from the
+actual internal data representation expected by the class.  In this case,
+running <tt>tblgen</tt> on the example prints the following definitions:</p>
+
+<pre>
+<b>def</b> bork {      <i>// Value</i>
+  bit isMod = 1;
+  bit isRef = 0;
+}
+<b>def</b> hork {      <i>// Value</i>
+  bit isMod = 1;
+  bit isRef = 1;
+}
+<b>def</b> zork {      <i>// Value</i>
+  bit isMod = 0;
+  bit isRef = 1;
+}
+</pre>
+
+<p> This shows that TableGen was able to dig into the argument and extract a
+piece of information that was requested by the designer of the "Value" class.
+For more realistic examples, please see existing users of TableGen, such as the
+X86 backend.</p>
+
+</div>
+
+<!-- ======================================================================= -->
+<div class="doc_subsection">
+  <a name="filescope">File scope entities</a>
+</div>
+
+<!-- -------------------------------------------------------------------------->
+<div class="doc_subsubsection">
+  <a name="include">File inclusion</a>
+</div>
+
+<div class="doc_text">
+<p>TableGen supports the '<tt>include</tt>' token, which textually substitutes
+the specified file in place of the include directive.  The filename should be
+specified as a double quoted string immediately after the '<tt>include</tt>'
+keyword.  Example:</p>
+
+<pre>
+<b>include</b> "foo.td"
+</pre>
+
+</div>
+
+<!-- -------------------------------------------------------------------------->
+<div class="doc_subsubsection">
+  <a name="globallet">'let' expressions</a>
+</div>
+
+<div class="doc_text">
+<p> "let" expressions at file scope are similar to <a href="#recordlet">"let"
+expressions within a record</a>, except they can specify a value binding for
+multiple records at a time, and may be useful in certain other cases.
+File-scope let expressions are really just another way that TableGen allows the
+end-user to factor out commonality from the records.</p>
+
+<p>File-scope "let" expressions take a comma-seperated list of bindings to
+apply, and one of more records to bind the values in.  Here are some
+examples:</p>
+
+<pre>
+<b>let</b> isTerminator = 1, isReturn = 1 <b>in</b>
+  <b>def</b> RET : X86Inst&lt;"ret", 0xC3, RawFrm, NoArg&gt;;
+
+<b>let</b> isCall = 1 <b>in</b>
+  <i>// All calls clobber the non-callee saved registers...</i>
+  <b>let</b> Defs = [EAX, ECX, EDX, FP0, FP1, FP2, FP3, FP4, FP5, FP6] in {
+    <b>def</b> CALLpcrel32 : X86Inst&lt;"call", 0xE8, RawFrm, NoArg&gt;;
+    <b>def</b> CALLr32     : X86Inst&lt;"call", 0xFF, MRMS2r, Arg32&gt;;
+    <b>def</b> CALLm32     : X86Inst&lt;"call", 0xFF, MRMS2m, Arg32&gt;;
+  }
+</pre>
+
+<p>File-scope "let" expressions are often useful when a couple of definitions
+need to be added to several records, and the records do not otherwise need to be
+opened, as in the case with the CALL* instructions above.</p>
+</div>
+
+<!-- *********************************************************************** -->
+<div class="doc_section"><a name="backends">TableGen backends</a></div>
+<!-- *********************************************************************** -->
+
+<div class="doc_text">
+<p>How they work, how to write one.  This section should not contain details
+about any particular backend, except maybe -print-enums as an example.  This
+should highlight the APIs in <tt>TableGen/Record.h</tt>.</p>
+</div>
+
+<!-- *********************************************************************** -->
+
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" /></a>
+
+  <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
+  <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
+
+</body>
+</html>

llvm/docs/TestingGuide.html

@@ -1,11 +1,10 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
 <html>
 <head>
-    <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
-    <link rel="stylesheet" href="llvm.css" type="text/css" media="screen" />
   <title>LLVM Test Suite Guide</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
 </head>
-
 <body>
       
 <div class="doc_title">
@@ -16,256 +15,237 @@
 <li><a href="#overview">Overview</a></li>
 <li><a href="#Requirements">Requirements</a></li>
 <li><a href="#quick">Quick Start</a></li>
-<li><a href="#org">LLVM Test Suite Organization</a></li>
+<li><a href="#org">LLVM Test Suite Organization</a>
 <ul>
   <li><a href="#codefragments">Code Fragments</a></li>
   <li><a href="#wholeprograms">Whole Programs</a></li>
-</ul>
+</ul></li>
 <li><a href="#tree">LLVM Test Suite Tree</a></li>
 <li><a href="#qmstructure">QMTest Structure</a></li>
 <li><a href="#progstructure">Programs Structure</a></li>
 <li><a href="#run">Running the LLVM Tests</a></li>
-<p><b>Written by John T. Criswell</b></p>
+<li><a href="#nightly">Running the nightly tester</a></li>
 </ol>
 
-	<!--===============================================================-->
-	<div class="doc_section"><a name="overview">Overview</a></div>
-	<!--===============================================================-->
+<div class="doc_author">
+  <p>Written by John T. Criswell</p>
+</div>
 
-        <div class="doc_text">
-	<p>
-        This document is the reference manual for the LLVM test suite.  It
-	documents the structure of the LLVM test suite, the tools needed to
-	use it, and how to add and run tests.
-        </p>
-        </div>
+<!--===============================================================-->
+<div class="doc_section"><a name="overview">Overview</a></div>
+<!--===============================================================-->
 
-	<!--===============================================================-->
-	<div class="doc_section"><a name="Requirements">Requirements</a></div>
-	<!--===============================================================-->
+<div class="doc_text">
 
-        <div class="doc_text">
-        <p>
-	In order to use the LLVM test suite, you will need all of the software
-	required to build LLVM, plus the following:
-        </p>
-	<dl compact>
-		<dt><A HREF="http://www.qmtest.com">QMTest</A></dt>
-		<dd>The LLVM test suite uses QMTest to organize and
-                run tests.</dd>
+<p>This document is the reference manual for the LLVM test suite.  It documents
+the structure of the LLVM test suite, the tools needed to use it, and how to add
+and run tests.</p>
 
-		<dt><A HREF="http://www.python.org">Python</A></dt>
-		<dd>You will need a Python interpreter that works with
-                QMTest. Python will need zlib and SAX support
-                enabled.</dd>
-	</dl>
-        </div>
+</div>
 
-	<!--===============================================================-->
-	<div class="doc_section"><a name="quick">Quick Start</a></div>
-	<!--===============================================================-->
+<!--===============================================================-->
+<div class="doc_section"><a name="Requirements">Requirements</a></div>
+<!--===============================================================-->
 
-        <div class="doc_text">
-        <p>
-        The tests are located in the LLVM source tree under the directory
-        <tt>llvm/test</tt>. To run all of the tests in LLVM, use the Master
-        Makefile in that directory:
-	</p>
-	<pre>
-	 % make -C llvm/test
-	</pre>
+<div class="doc_text">
 
-	<p>
-	To run only the code fragment tests (i.e. those that do basic testing of
-	LLVM), run the tests organized by QMTest:
-	</p>
+<p>In order to use the LLVM test suite, you will need all of the software
+required to build LLVM, plus the following:</p>
 
-	<pre>
-	 % make -C llvm/test qmtest
-	</pre>
+<dl>
+  <dt><a href="http://www.qmtest.com">QMTest</A></dt>
+  <dd>The LLVM test suite uses QMTest to organize and run tests. <b>Note:
+  you will need <a href="http://llvm.cs.uiuc.edu/qm-2.0.3.tar.gz">QMTest
+  2.0.3 (source tar.gz file)</a> to be successful. The tests do not run with
+  any other version.</b></dd>
 
-	<p>
-	To run only the tests that compile and execute whole programs, run the
-	Programs tests:
-	</p>
+  <dt><a href="http://www.python.org">Python</A></dt>
+  <dd>You will need a Python interpreter that works with QMTest. Python will
+  need zlib and SAX support enabled.</dd>
+</dl>
 
-	<pre>
-	 % make -C llvm/test/Programs
-	</pre>
-        </div>
+</div>
 
-	<!--===============================================================-->
-	<div class="doc_section"><h2><a name="org">LLVM Test Suite
-        Organization </a></div>
-	<!--===============================================================-->
+<!--===============================================================-->
+<div class="doc_section"><a name="quick">Quick Start</a></div>
+<!--===============================================================-->
 
-        <div class="doc_text">
-	<p>The LLVM test suite contains two major categories of tests: code
-        fragments and whole programs.</p>
-        </div>
+<div class="doc_text">
 
-        <div class="doc_subsection"><a name="codefragments">Code Fragments</a> 
-        </div>
+<p> The tests are located in the LLVM source tree under the directory
+<tt>llvm/test</tt>. To run all of the tests in LLVM, use the Master Makefile in
+that directory:</p>
 
-        <div class="doc_text">
-                <p>
-		Code fragments are small pieces of code that test a specific
-		feature of LLVM or trigger a specific bug in LLVM.  They are
-		usually written in LLVM assembly language, but can be
-		written in other languages if the test targets a
-                particular language front end.
-		</p><p>
-		Code fragments are not complete programs, and they are
-                never executed to determine correct behavior.
-		</p><p>
-		The tests in the Features and
-                Regression directories contain code fragments.
-                </p>
-        </div>
+<pre>
+ % gmake -C llvm/test
+</pre>
 
-        <div class="doc_subsection"><a name="wholeprograms">Whole Programs</a> 
-        </div>
+<p>To run only the code fragment tests (i.e. those that do basic testing of
+LLVM), run the tests organized by QMTest:</p>
 
-        <div class="doc_text">
-		<p>
-                Whole Programs are pieces of code which can be compiled and
-                linked into a stand-alone program that can be executed.  These
-                programs are generally written in high level languages such as C
-                or C++, but sometimes they are written straight in LLVM
-                assembly.
-		</p><p>
-		These programs are compiled and then executed using several
-		different methods (native compiler, LLVM C backend, LLVM JIT,
-		LLVM native code generation, etc).  The output of these programs
-		is compared to ensure that LLVM is compiling the program
-		correctly.
-		</p><p>
-		In addition to compiling and executing programs, whole program
-		tests serve as a way of benchmarking LLVM performance, both in
-		terms of the efficiency of the programs generated as well as the
-		speed with which LLVM compiles, optimizes, and generates code.
-		</p><p>
-		The Programs directory contains all tests which compile and
-		benchmark whole programs.
-                </p>
-        </div>
+<pre>
+ % gmake -C llvm/test qmtest
+</pre>
 
-	<!--===============================================================-->
-	<div class="doc_section"><h2><a name="tree">LLVM Test Suite Tree</a>
-        </div>
-	<!--===============================================================-->
+<p>To run only the tests that compile and execute whole programs, run the
+Programs tests:</p>
 
-        <div class="doc_text">
-	<p>Each type of test in the LLVM test suite has its own directory. The
-        major subtrees of the test suite directory tree are as follows:</p>
+<pre>
+ % gmake -C llvm/test/Programs
+</pre>
 
-	<ul>
+</div>
+
+<!--===============================================================-->
+<div class="doc_section"><a name="org">LLVM Test Suite Organization</a></div>
+<!--===============================================================-->
+
+<div class="doc_text">
+
+<p>The LLVM test suite contains two major categories of tests: code
+fragments and whole programs.</p>
+
+</div>
+
+<div class="doc_subsection"><a name="codefragments">Code Fragments</a> 
+</div>
+
+<div class="doc_text">
+
+<p>Code fragments are small pieces of code that test a specific feature of LLVM
+or trigger a specific bug in LLVM.  They are usually written in LLVM assembly
+language, but can be written in other languages if the test targets a particular
+language front end.</p>
+
+<p>Code fragments are not complete programs, and they are never executed to
+determine correct behavior.</p> 
+
+<p>The tests in the Features and Regression directories contain code
+fragments.</p>
+
+</div>
+
+<div class="doc_subsection"><a name="wholeprograms">Whole Programs</a></div>
+
+<div class="doc_text">
+
+<p>Whole Programs are pieces of code which can be compiled and linked into a
+stand-alone program that can be executed.  These programs are generally written
+in high level languages such as C or C++, but sometimes they are written
+straight in LLVM assembly.</p>
+  
+<p>These programs are compiled and then executed using several different
+methods (native compiler, LLVM C backend, LLVM JIT, LLVM native code generation,
+etc).  The output of these programs is compared to ensure that LLVM is compiling
+the program correctly.</p>
+
+<p>In addition to compiling and executing programs, whole program tests serve as
+a way of benchmarking LLVM performance, both in terms of the efficiency of the
+programs generated as well as the speed with which LLVM compiles, optimizes, and
+generates code.</p>
+
+<p>The Programs directory contains all tests which compile and benchmark whole
+programs.</p> 
+
+</div>
+
+<!--===============================================================-->
+<div class="doc_section"><a name="tree">LLVM Test Suite Tree</a></div>
+<!--===============================================================-->
+
+<div class="doc_text">
+
+<p>Each type of test in the LLVM test suite has its own directory. The major
+subtrees of the test suite directory tree are as follows:</p>
+      
+<ul>
   <li>Features 
-		<p>
-                This directory contains sample codes that test various features
-		of the LLVM language.  These pieces of sample code are run
-		through various assembler, disassembler, and optimizer passes.
-		</p>
+    <p>This directory contains sample codes that test various features of the
+    LLVM language.  These pieces of sample code are run through various
+    assembler, disassembler, and optimizer passes.</p>
 
   <li>Regression
-                <p>
-		This directory contains regression tests for LLVM.  When a bug
-		is found in LLVM, a regression test containing just enough
-		code to reproduce the problem should be written and placed
-		somewhere underneath this directory.  In most cases, this
-		will be a small piece of LLVM assembly language code, often
-		distilled from an actual application or benchmark.
-		</p>
+    <p>This directory contains regression tests for LLVM.  When a bug is found
+    in LLVM, a regression test containing just enough code to reproduce the
+    problem should be written and placed somewhere underneath this directory.
+    In most cases, this will be a small piece of LLVM assembly language code,
+    often distilled from an actual application or benchmark.</p>
 
   <li>Programs
-		<p>
-                The Programs directory contains programs that can be compiled
-		with LLVM and executed.  These programs are compiled using the
-		native compiler and various LLVM backends.  The output from the
-		program compiled with the native compiler is assumed correct;
-		the results from the other programs are compared to the native
-		program output and pass if they match.
-		</p><p>
-		In addition for testing correctness, the Programs directory
-		also performs timing tests of various LLVM optimizations.
-		It also records compilation times for the compilers and the
-		JIT.  This information can be used to compare the
-		effectiveness of LLVM's optimizations and code generation.
-		</p><p>
-		The Programs directory is subdivided into several smaller
-		subdirectories:
+    <p>The Programs directory contains programs that can be compiled with LLVM
+    and executed.  These programs are compiled using the native compiler and
+    various LLVM backends.  The output from the program compiled with the native
+    compiler is assumed correct; the results from the other programs are
+    compared to the native program output and pass if they match.  </p>
+  
+    <p> In addition for testing correctness, the Programs directory also
+    performs timing tests of various LLVM optimizations.  It also records
+    compilation times for the compilers and the JIT.  This information can be
+    used to compare the effectiveness of LLVM's optimizations and code
+    generation.</p>
+    
+    <p>The Programs directory is subdivided into several smaller subdirectories:
     </p>
 
     <ul>
       <li>Programs/SingleSource
-                        <p>
-			The SingleSource directory contains test programs that
-			are only a single source file in size.  These are
-			usually small benchmark programs or small programs that
-			calculate a particular value.  Several such programs are
-			grouped together in each directory.
-			</p>
+        <p>The SingleSource directory contains test programs that are only a
+        single source file in size.  These are usually small benchmark programs
+        or small programs that calculate a particular value.  Several such
+        programs are grouped together in each directory.</p></li>
 
       <li>Programs/MultiSource
-                        <p>
-                        The MultiSource directory contains subdirectories which
-                        contain entire programs with multiple source files.
-                        Large benchmarks and whole applications go here.
-			</p>
+        <p>The MultiSource directory contains subdirectories which contain
+        entire programs with multiple source files.  Large benchmarks and whole
+        applications go here.</p></li>
 
       <li>Programs/External
-                        <p>
-			The External directory contains Makefiles for building
-			code that is external to (i.e. not distributed with)
-			LLVM.  The most prominent member of this directory is
-			the SPEC 2000 benchmark suite.  The presence and
-			location of these external programs is configured by the
-			LLVM <tt>configure</tt> script.
-                        </p>
-		</ul>
+        <p>The External directory contains Makefiles for building code that is
+        external to (i.e. not distributed with) LLVM.  The most prominent member
+        of this directory is the SPEC 2000 benchmark suite.  The presence and
+        location of these external programs is configured by the LLVM
+        <tt>configure</tt> script.</p></li>
         
-		<p>
+    </ul></li>
 
   <li>QMTest
-                <p>
-		This directory contains the QMTest information files.  Inside
-		this directory are QMTest administration files and the Python
-		code that implements the LLVM test and database classes.
-                </p>
-	</ul>
-        </div>
+    <p>This directory contains the QMTest information files.  Inside this
+    directory are QMTest administration files and the Python code that
+    implements the LLVM test and database classes.</p>
 
-	<!--===============================================================-->
-	<div class="doc_section"><h2><a name="qmstructure">QMTest Structure</a>
-        </div>
-	<!--===============================================================-->
+</ul>
 
-        <div class="doc_text">
-	<p>
-        The LLVM test suite is partially driven by QMTest and partially
-	driven by GNU Make.  Specifically, the Features and Regression tests
-	are all driven by QMTest.  The Programs directory is currently
-	driven by a set of Makefiles.
-	</p><p>
-	The QMTest system needs to have several pieces of information
-	available; these pieces of configuration information are known
-	collectively as the "context" in QMTest parlance.  Since the context
-	for LLVM is relatively large, the master Makefile in llvm/test
-	sets it for you.
-	</p><p>
-	The LLVM database class makes the subdirectories of llvm/test a
-	QMTest test database.  For each directory that contains tests driven by
-	QMTest, it knows what type of test the source file is and how to run it.
-	</p><p>
-	Hence, the QMTest namespace is essentially what you see in the
-	Feature and Regression directories, but there is some magic that
-	the database class performs (as described below).
-	</p><p>
-	The QMTest namespace is currently composed of the following tests and
-	test suites:
-        </p>
+</div>
 
-	<ul>
+<!--===============================================================-->
+<div class="doc_section"><a name="qmstructure">QMTest Structure</a></div>
+<!--===============================================================-->
+
+<div class="doc_text">
+
+<p>The LLVM test suite is partially driven by QMTest and partially
+driven by GNU Make.  Specifically, the Features and Regression tests
+are all driven by QMTest.  The Programs directory is currently
+driven by a set of Makefiles.</p>
+
+<p>The QMTest system needs to have several pieces of information
+available; these pieces of configuration information are known
+collectively as the "context" in QMTest parlance.  Since the context
+for LLVM is relatively large, the master Makefile in llvm/test
+sets it for you.</p>
+
+<p>The LLVM database class makes the subdirectories of llvm/test a
+QMTest test database.  For each directory that contains tests driven by
+QMTest, it knows what type of test the source file is and how to run it.</p>
+
+<p>Hence, the QMTest namespace is essentially what you see in the
+Feature and Regression directories, but there is some magic that
+the database class performs (as described below).</p>
+
+<p>The QMTest namespace is currently composed of the following tests and test
+suites:</p>
+
+<ul>
   <li>Feature
               <p>
   These are the feature tests found in the Feature directory.
@@ -273,155 +253,168 @@
               </p>
   <ul>
     <li>ad
-			<p>
-			Assembler/Disassembler tests.  These tests verify that a
-			piece of LLVM assembly language can be assembled into
-			bytecode and then disassembled into the original
-			assembly language code.  It does this several times to
-			ensure that assembled output can be disassembled and
-			disassembler output can be assembled.  It also verifies
-			that the give assembly language file can be assembled
-			correctly.
-                        </p>
+      <p>Assembler/Disassembler tests.  These tests verify that a piece of LLVM
+      assembly language can be assembled into bytecode and then disassembled
+      into the original assembly language code.  It does this several times to
+      ensure that assembled output can be disassembled and disassembler output
+      can be assembled.  It also verifies that the give assembly language file
+      can be assembled correctly.</p></li>
 
     <li>opt
-			<p>
-			Optimizer tests.  These tests verify that two of the
-			optimizer passes completely optimize a program (i.e.
-			after a single pass, they cannot optimize a program
-			any further).
-			</p>
+      <p>Optimizer tests.  These tests verify that two of the optimizer passes
+      completely optimize a program (i.e.  after a single pass, they cannot
+      optimize a program any further).</p></li>
 
     <li>mc
-			<p>
-			Machine code tests.  These tests verify that the LLVM
-			assembly language file can be translated into native
-			assembly code.
-			</p>
+      <p> Machine code tests.  These tests verify that the LLVM assembly
+      language file can be translated into native assembly code.</p></li>
 
     <li>cc
-			<p>
-			C code tests.  These tests verify that the specified
-			LLVM assembly code can be converted into C source code
-			using the C backend.
-                        </p>
+      <p>C code tests.  These tests verify that the specified LLVM assembly
+      code can be converted into C source code using the C backend.</p></li>
   </ul>
 
-		<p>
-		The LLVM database class looks at every file in the Feature
-		directory and creates a fake test hierarchy containing
-		<tt>Feature.&lt;testtype&gt;.&lt;testname&gt;</tt>.  So, if you
-		add an LLVM assembly language file to the Feature directory, it
-		actually creates 5 new tests: assembler/disassembler, assembler,
-		optimizer, machine code, and C code.
+  <p>The LLVM database class looks at every file in the Feature directory and
+  creates a fake test hierarchy containing
+  <tt>Feature.&lt;testtype&gt;.&lt;testname&gt;</tt>.  So, if you add an LLVM
+  assembly language file to the Feature directory, it actually creates 5 new
+  tests: assembler/disassembler, assembler, optimizer, machine code, and C code.
   </p>
 
   <li>Regression
-                <p>
-		These are the regression tests.  There is one suite for each
-		subdirectory of the Regression directory.  If you add a new
-		subdirectory there, you will need to modify, at least, the
-		<tt>RegressionMap</tt> variable in <tt>QMTest/llvmdb.py</tt> so
-		that QMTest knows how to run the tests in the new subdirectory.
-                </p>
-	</ul>
-        </div>
+    <p>These are the regression tests.  There is one suite for each
+    subdirectory of the Regression directory.  If you add a new subdirectory
+    there, you will need to modify, at least, the <tt>RegressionMap</tt>
+    variable in <tt>QMTest/llvmdb.py</tt> so that QMTest knows how to run the
+    tests in the new subdirectory.</p>
 
-	<!--===============================================================-->
-	<div class="doc_section"><h2><a name="progstructure">Programs
-        Structure</a></div>
-	<!--===============================================================-->
+</ul>
       
-        <div class="doc_text">
-        <p>
-	As mentioned previously, the Programs tree in llvm/test provides three
-	types of tests: MultiSource, SingleSource, and External.  Each tree is
-	then subdivided into several categories, including applications,
-	benchmarks, regression tests, code that is strange grammatically, etc.
-	These organizations should be relatively self explanatory.
-	</p><p>
-	In addition to the regular Programs tests, the Programs tree also
-	provides a mechanism for compiling the programs in different ways.  If
-	the variable TEST is defined on the gmake command line, the test system
-	will include a Makefile named <tt>TEST.&lt;value of TEST
-	variable&gt;.Makefile</tt>.  This Makefile can modify build rules to
-        yield different results.
-	</p><p>
-	For example, the LLVM nightly tester uses <tt>TEST.nightly.Makefile</tt>
-        to create the nightly test reports.  To run the nightly tests, run
-	<tt>gmake TEST=nightly</tt>.
-	</p><p>
-	There are several TEST Makefiles available in the tree.  Some of them
-	are designed for internal LLVM research and will not work outside of the
-	LLVM research group.  They may still be valuable, however, as a guide to
-	writing your own TEST Makefile for any optimization or analysis passes
-	that you develop with LLVM.
-        </p>
-        </div>
+</div>
 
-	<!--===============================================================-->
-	<div class="doc_section"><h2><a name="run">Running the LLVM Tests</a>
-        </div>
-	<!--===============================================================-->
+<!--===============================================================-->
+<div class="doc_section"><a name="progstructure">Programs Structure</a></div>
+<!--===============================================================-->
 
-        <div class="doc_text">
-        <p>
-	First, all tests are executed within the LLVM object directory tree.
-	They <i>are not</i> executed inside of the LLVM source tree.  This is
-	because the test suite creates temporary files during execution.
-	</p><p>
-	The master Makefile in llvm/test is capable of running both the
-	QMTest driven tests and the Programs tests.  By default, it will run
-	all of the tests.
-	</p><p>
-	To run only the QMTest driven tests, run <tt>make qmtest</tt> at the
-	command line in llvm/tests.  To run a specific qmtest, suffix the test
-	name with ".t" when running make.
-	</p><p>
-	For example, to run the Regression.LLC tests, type
-	<tt>make Regression.LLC.t</tt> in llvm/tests.
-	</p><p>
-	Note that the Makefiles in llvm/test/Features and llvm/test/Regression
-	are gone.  You must now use QMTest from the llvm/test directory to run
-	them.
-	</p><p>
-	To run the Programs test, cd into the llvm/test/Programs directory and
-	type <tt>make</tt>.  Alternatively, you can type <tt>make
-	TEST=&lt;type&gt; test</tt> to run one of the specialized tests in
-	llvm/test/Programs/TEST.&lt;type&gt;.Makefile.  For example, you could
-	run the nightly tester tests using the following commands:
-	</p>
+<div class="doc_text">
 
-	<pre>
+<p>As mentioned previously, the Programs tree in llvm/test provides three types
+of tests: MultiSource, SingleSource, and External.  Each tree is then subdivided
+into several categories, including applications, benchmarks, regression tests,
+code that is strange grammatically, etc.  These organizations should be
+relatively self explanatory.</p>
+
+<p>In addition to the regular Programs tests, the Programs tree also provides a
+mechanism for compiling the programs in different ways.  If the variable TEST is
+defined on the gmake command line, the test system will include a Makefile named
+<tt>TEST.&lt;value of TEST variable&gt;.Makefile</tt>.  This Makefile can modify
+build rules to yield different results.</p>
+
+<p>For example, the LLVM nightly tester uses <tt>TEST.nightly.Makefile</tt> to
+create the nightly test reports.  To run the nightly tests, run <tt>gmake
+TEST=nightly</tt>.</p>
+
+<p>There are several TEST Makefiles available in the tree.  Some of them are
+designed for internal LLVM research and will not work outside of the LLVM
+research group.  They may still be valuable, however, as a guide to writing your
+own TEST Makefile for any optimization or analysis passes that you develop with
+LLVM.</p>
+      
+</div>
+
+<!--===============================================================-->
+<div class="doc_section"><a name="run">Running the LLVM Tests</a></div>
+<!--===============================================================-->
+
+<div class="doc_text">
+
+<p>First, all tests are executed within the LLVM object directory tree.  They
+<i>are not</i> executed inside of the LLVM source tree.  This is because the
+test suite creates temporary files during execution.  </p>
+
+<p>The master Makefile in llvm/test is capable of running both the QMTest driven
+tests and the Programs tests.  By default, it will run all of the tests.</p>
+
+<p>To run only the QMTest driven tests, run <tt>gmake qmtest</tt> at the
+command line in llvm/tests.  To run a specific qmtest, suffix the test name with
+".t" when running gmake.</p>
+
+<p>For example, to run the Regression.LLC tests, type <tt>gmake
+Regression.LLC.t</tt> in llvm/tests.</p>
+
+<p>Note that the Makefiles in llvm/test/Features and llvm/test/Regression are
+gone. You must now use QMTest from the llvm/test directory to run them.</p>
+
+<p>To run the Programs test, cd into the llvm/test/Programs directory and type
+<tt>gmake</tt>.  Alternatively, you can type <tt>gmake TEST=&lt;type&gt;
+test</tt> to run one of the specialized tests in
+llvm/test/Programs/TEST.&lt;type&gt;.Makefile. For example, you could run the
+nightly tester tests using the following commands:</p>
+
+<pre>
  % cd llvm/test/Programs
-	 % make TEST=nightly test
-	</pre>
+ % gmake TEST=nightly test
+</pre>
 
-	<p>
-	Regardless of which test you're running, the results are printed on
-	standard output and standard error.  You can redirect these results to a
-	file if you choose.
-	</p><p>
-	Some tests are known to fail.  Some are bugs that we have not fixed yet;
-	others are features that we haven't added yet (or may never add).  In
-	QMTest, the result for such tests will be XFAIL (eXpected FAILure).  In
-	this way, you can tell the difference between an expected and unexpected
-	failure.
-	</p><p>
-	The Programs tests have no such feature as of this time.  If the test
-	passes, only warnings and other miscellaneous output will be generated.
-	If a test fails, a large &lt;program&gt; FAILED message will be
-	displayed.  This will help you separate benign warnings from actual test
-	failures.
-        </p>
-        </div>
+<p>Regardless of which test you're running, the results are printed on standard
+output and standard error.  You can redirect these results to a file if you
+choose.</p>
+
+<p>Some tests are known to fail.  Some are bugs that we have not fixed yet;
+others are features that we haven't added yet (or may never add).  In QMTest,
+the result for such tests will be XFAIL (eXpected FAILure).  In this way, you
+can tell the difference between an expected and unexpected failure.</p>
+
+<p>The Programs tests have no such feature as of this time. If the test passes,
+only warnings and other miscellaneous output will be generated.  If a test
+fails, a large &lt;program&gt; FAILED message will be displayed.  This will help
+you separate benign warnings from actual test failures.</p>
+
+</div>
+
+<!--===============================================================-->
+<div class="doc_section"><a name="nightly">Running the nightly tester</a></div>
+<!--===============================================================-->
+
+<div class="doc_text">
+
+<p>
+The <a href="http://llvm.cs.uiuc.edu/testresults/">LLVM Nightly Testers</a>
+automatically check out an LLVM tree, build it, run the "nightly" 
+program test (described above) and all of the regression tests, then 
+delete the checked out tree.  This tester is designed to ensure that 
+programs don't break as well as keep track of LLVM's progress over time.</p>
+
+<p>
+If you'd like to set up an instance of the nightly tester to run on your 
+machine, take a look at the comments at the top of the utils/NightlyTester.pl
+file.  We usually run it from a crontab entry that looks ilke this:
+</p>
+
+<pre>
+5 3 * * *       LLVM_LIB_SEARCH_PATH=.../llvm-gcc/bytecode-libs $HOME/llvm/utils/NightlyTest.pl -parallel -enable-linscan ...CVSREPOSTRING... $HOME/buildtest-X86 $HOME/cvs/testresults-X86
+</pre>
+
+<p>
+Take a look at the NightlyTest.pl file to see what all of the flags and 
+strings do.  If you start running the nightly tests, please let us know and 
+we'll link your page to the global tester page.  Thanks!
+</p>
+      
+</div>
 
 <!-- *********************************************************************** -->
 
-<hr><font size="-1">
-<address>John T. Criswell</address>
-Last modified: $Date$
-</font>
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" /></a>
 
+  John T. Criswell<br>
+  <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
 </body>
 </html>

llvm/docs/doxygen.cfg

@@ -201,7 +201,7 @@ DISTRIBUTE_GROUP_DOC   = NO
 # The TAB_SIZE tag can be used to set the number of spaces in a tab. 
 # Doxygen uses this value to replace tabs by spaces in code fragments.
 
-TAB_SIZE               = 8
+TAB_SIZE               = 2
 
 # The GENERATE_TODOLIST tag can be used to enable (YES) or 
 # disable (NO) the todo list. This list is created by putting \todo 
@@ -301,7 +301,7 @@ WARN_LOGFILE           =
 # directories like "/usr/src/myproject". Separate the files or directories with
 # spaces.
 
-INPUT                  = ..
+INPUT                  = .. ./doxygen.intro
 
 # If the value of the INPUT tag contains directories, you can use the 
 # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
@@ -411,7 +411,7 @@ ALPHABETICAL_INDEX     = YES
 # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns 
 # in which this list will be split (can be a number in the range [1..20])
 
-COLS_IN_ALPHA_INDEX    = 5
+COLS_IN_ALPHA_INDEX    = 4
 
 # In case all classes in a project start with a common prefix, all 
 # classes will be put under the same header in the alphabetical index. 
@@ -439,20 +439,20 @@ HTML_OUTPUT            = .
 # each generated HTML page. If it is left blank doxygen will generate a 
 # standard header.
 
-HTML_HEADER            = 
+HTML_HEADER            = doxygen.header
 
 # The HTML_FOOTER tag can be used to specify a personal HTML footer for 
 # each generated HTML page. If it is left blank doxygen will generate a 
 # standard footer.
 
-HTML_FOOTER            = 
+HTML_FOOTER            = doxygen.footer
 
 # The HTML_STYLESHEET tag can be used to specify a user defined cascading 
 # style sheet that is used by each HTML page. It can be used to 
 # fine-tune the look of the HTML output. If the tag is left blank doxygen 
 # will generate a default style sheet
 
-HTML_STYLESHEET        = 
+HTML_STYLESHEET        = doxygen.css
 
 # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, 
 # files or namespaces will be aligned in HTML using tables. If set to 
@@ -861,38 +861,3 @@ DOT_CLEANUP            = YES
 # used. If set to NO the values of all tags below this one will be ignored.
 
 SEARCHENGINE           = NO
-
-# The CGI_NAME tag should be the name of the CGI script that 
-# starts the search engine (doxysearch) with the correct parameters. 
-# A script with this name will be generated by doxygen.
-
-CGI_NAME               = 
-
-# The CGI_URL tag should be the absolute URL to the directory where the 
-# cgi binaries are located. See the documentation of your http daemon for 
-# details.
-
-CGI_URL                = 
-
-# The DOC_URL tag should be the absolute URL to the directory where the 
-# documentation is located. If left blank the absolute path to the 
-# documentation, with file:// prepended to it, will be used.
-
-DOC_URL                = 
-
-# The DOC_ABSPATH tag should be the absolute path to the directory where the 
-# documentation is located. If left blank the directory on the local machine 
-# will be used.
-
-DOC_ABSPATH            = 
-
-# The BIN_ABSPATH tag must point to the directory where the doxysearch binary 
-# is installed.
-
-BIN_ABSPATH            = 
-
-# The EXT_DOC_PATHS tag can be used to specify one or more paths to 
-# documentation generated for other projects. This allows doxysearch to search 
-# the documentation for these projects as well.
-
-EXT_DOC_PATHS          = 

llvm/docs/doxygen.css

@@ -0,0 +1,90 @@
+BODY { background: white; color: black; font-family: Verdana,Arial,sans-serif; }
+H1 { text-align: center; }
+H2 { text-align: center; }
+H3 { text-align: center; }
+CAPTION { font-weight: bold }
+A.qindex {}
+A.qindexRef {}
+A.el { text-decoration: none; font-weight: bold }
+A.elRef { font-weight: bold }
+A.code { text-decoration: none; font-weight: normal; color: #4444ee }
+A.codeRef { font-weight: normal; color: #4444ee }
+A:link {
+        cursor: pointer;
+        text-decoration: none;
+        font-weight: bolder;
+}
+A:visited {
+        cursor: pointer;
+        text-decoration: underline;
+        font-weight: bolder;
+}
+A:hover {
+        cursor: pointer;
+        text-decoration: underline;
+        font-weight: bolder;
+}
+A:active {
+        cursor: pointer;
+        text-decoration: underline;
+        font-weight: bolder;
+        font-style: italic;
+}
+DL.el { margin-left: -1cm }
+DIV.fragment { width: 100%; border: none; background-color: #eeeeee }
+DIV.ah { background-color: black; font-weight: bold; color: #ffffff; margin-bottom: 3px; margin-top: 3px }
+TD.md { background-color: #f2f2ff; font-weight: bold; }
+TD.mdname1 { background-color: #f2f2ff; font-weight: bold; color: #602020; }
+TD.mdname { background-color: #f2f2ff; font-weight: bold; color: #602020; width: 600px; }
+DIV.groupHeader { margin-left: 16px; margin-top: 12px; margin-bottom: 6px; font-weight: bold }
+DIV.groupText { margin-left: 16px; font-style: italic; font-size: smaller }
+TD.indexkey { 
+   background-color: #eeeeff; 
+   font-weight: bold; 
+   padding-right  : 10px; 
+   padding-top    : 2px; 
+   padding-left   : 10px; 
+   padding-bottom : 2px; 
+   margin-left    : 0px; 
+   margin-right   : 0px; 
+   margin-top     : 2px; 
+   margin-bottom  : 2px  
+}
+TD.indexvalue { 
+   background-color: #eeeeff; 
+   font-style: italic; 
+   padding-right  : 10px; 
+   padding-top    : 2px; 
+   padding-left   : 10px; 
+   padding-bottom : 2px; 
+   margin-left    : 0px; 
+   margin-right   : 0px; 
+   margin-top     : 2px; 
+   margin-bottom  : 2px  
+}
+span.keyword       { color: #008000 }
+span.keywordtype   { color: #604020 }
+span.keywordflow   { color: #e08000 }
+span.comment       { color: #800000 }
+span.preprocessor  { color: #806020 }
+span.stringliteral { color: #002080 }
+span.charliteral   { color: #008080 }
+
+.footer {
+        font-size: 80%;
+        font-weight: bold;
+        text-align: center;
+        vertical-align: middle;
+}
+.title {
+  font-size: 25pt; 
+  color: black; background: url("../img/lines.gif");
+  font-weight: bold;
+  border-width: 1px;
+  border-style: solid none solid none;
+  text-align: center;
+  vertical-align: middle;
+  padding-left: 8pt;
+  padding-top: 1px;
+  padding-bottom: 2px
+}

llvm/docs/doxygen.footer

@@ -0,0 +1,10 @@
+<hr>
+
+<p class="footer">
+Generated on $datetime for <a href="http://llvm.cs.uiuc.edu">LLVM</a> by
+<a href="http://www.doxygen.org">doxygen $doxygenversion</a><br/>
+Copyright &copy; 2003,2004 University of Illinois at Urbana-Champaign. All
+Rights Reserved.</p>
+
+</body>
+</html>

llvm/docs/doxygen.header

@@ -0,0 +1,9 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
+<html><head>
+<meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"/>
+<meta name="keywords" content="LLVM,Low Level Virtual Machine,C++,doxygen,API,documentation"/>
+<meta name="description" content="C++ source code API documentation for the Low Level Virtual Machine (LLVM)."/>
+<title>LLVM: $title</title>
+<link href="doxygen.css" rel="stylesheet" type="text/css"/>
+</head><body>
+<p class="title">LLVM API Documentation</p>

llvm/docs/doxygen.intro

@@ -0,0 +1,25 @@
+////////////////////////////////////////////////////////////////////////////////
+/// @file doxygen.intro
+/// @author Reid Spencer <rspencer@x10sys.com> 
+/// @date 2003/12/30
+/// @brief LLVM API documentation introduction.
+////////////////////////////////////////////////////////////////////////////////
+///
+/// @mainpage LLVM:Low Level Virtual Machine
+///
+/// @section main_intro Introduction
+/// Welcome to the Low Level Virtual Machine (LLVM)
+///
+/// This documentation describes the @b internal software that makes 
+/// up LLVM, not the @b external use of  LLVM. There are no instructions
+/// here on how to use LLVM, only the APIs that make up the software. For usage 
+/// instructions, please see the programmer's guide or reference manual.
+///
+/// @section main_caveat Caveat 
+/// This documentation is generated directly from the source code with doxygen. 
+/// Since LLVM is constantly under active development, what you're about to
+/// read is out of date! However, it may still be useful since certain portions
+/// of LLVM are very stable. 
+///
+/// @section main_changelog Change Log
+/// - Original content written 12/30/2003 by Reid Spencer

llvm/docs/index.html

@@ -0,0 +1,200 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+                      "http://www.w3.org/TR/html4/strict.dtd">
+<html>
+<head>
+  <title>Documentation for the LLVM System</title>
+  <link rel="stylesheet" href="llvm.css" type="text/css">
+</head>
+<body>
+
+<div class="doc_title">Documentation for the LLVM System</div>
+
+<div class="doc_text">
+<ul>
+  <li><a href="#llvmdesign">LLVM Design</a></li>
+  <li><a href="#userguide">LLVM User Guides</a></li>
+  <li><a href="#llvmprog">General LLVM Programming Documentation</a></li>
+  <li><a href="#subsystems">LLVM Subsystem Documentation</a></li>
+  <li><a href="#maillist">LLVM Mailing Lists</a></li>
+</ul>
+</div>
+
+<div class="doc_author">    
+  <p>Written by <a href="http://llvm.cs.uiuc.edu">The LLVM Team</a></p>
+</div>
+
+<!--=======================================================================-->
+<div class="doc_section"><a name="llvmdesign">LLVM Design</a></div>
+<!--=======================================================================-->
+
+<ul>
+<li><a href="pubs/2004-01-30-CGO-LLVM.html"> LLVM: A Compilation Framework for
+Lifelong Program Analysis &amp; Transformation</a>: - Describes
+the LLVM instruction set and compilation strategy.  This should be the first
+document you read to get an overview of LLVM.</li>
+
+<li><a href="LangRef.html">LLVM Reference Manual</a> - Defines the LLVM
+intermediate representation, the assembly form of the different nodes, and
+provides reference information about the different tools in LLVM.</li>
+
+<li><a href="BytecodeFormat.html">LLVM Bytecode File Format</a></li>
+
+</ul>
+
+<!--=======================================================================-->
+<div class="doc_section"><a name="userguide">LLVM User Guides</a></div>
+<!--=======================================================================-->
+
+<ul>
+<li><a href="GettingStarted.html">The LLVM Getting Started Guide</a> -
+Discusses how to get up and running quickly with the LLVM infrastructure.
+Everything from unpacking and compilation of the distribution to execution of
+some tools.</li>
+
+<li><a href="CommandGuide/index.html">LLVM Command Guide</a> - A reference
+manual for the LLVM command line utilities ("man" pages for LLVM tools).</li>
+
+<li><a href="FAQ.html">Frequently Asked Questions</a> - A list of common
+questions and problems and their solutions.</li>
+
+<li><a href="ReleaseNotes.html">Release notes for the current release</a> 
+- This describes new features, known bugs, and other limitations.</li>
+
+<li><a href="HowToSubmitABug.html">How to Submit A Bug Report</a> -
+Instructions for properly submitting information about any bugs you run into in
+the LLVM system.</li>
+
+<li><a href="TestingGuide.html">LLVM Test Suite Guide</a> - A reference
+manual for using the LLVM test suite.</li>
+
+<li><a href="CFEBuildInstrs.html">How to build the C/C++ front-end</a> -
+Instructions for building the front-end from source.</li>
+
+<li><a name="irc">You can probably find help on the unofficial LLVM IRC 
+channel</a>.  We often are on irc.oftc.net in the #llvm channel.  If you are 
+using the mozilla browser, and have chatzilla installed, you can join by <a 
+href="irc://irc.oftc.net/llvm">clicking here</a>.</li>
+
+</ul>
+
+
+<!--=======================================================================-->
+<div class="doc_section"><a name="llvmprog">General LLVM Programming Documentation</a></div>
+<!--=======================================================================-->
+
+<ul>
+<li><a href="ProgrammersManual.html">The LLVM Programmers Manual</a> -
+Introduction to the general layout of the LLVM sourcebase, important classes
+and APIs, and some tips &amp; tricks.</li>
+
+<li><a href="Projects.html">LLVM Project Guide</a> - How-to guide and
+templates for new projects that <em>use</em> the LLVM infrastructure.  The
+templates (directory organization, Makefiles, and test tree) allow the project
+code to be located outside (or inside) the <tt>llvm/</tt> tree, while using LLVM
+header files and libraries.</li>
+
+<li><a href="CommandLine.html">CommandLine library Reference Manual</a> -
+Provides information on using the command line parsing library.</li>
+
+<li><a href="CodingStandards.html">Recommended LLVM Coding standards</a> -
+Details the LLVM coding standards and provides useful information on writing
+efficient C++ code.</li>
+
+<li><a href="OpenProjects.html">Open Projects</a> - Look here if you are
+interested in doing something with LLVM but aren't sure what needs to be
+done.</li>
+
+<li><a href="ExtendingLLVM.html">Extending LLVM</a> - Look here to see how 
+to add instructions and intrinsics to LLVM.</li>
+
+<li><a href="CodingStandards.html">Coding Standards</a> - Guidelines for
+hacking LLVM source.</li>
+
+<li><a href="http://llvm.cs.uiuc.edu/doxygen/">Doxygen generated 
+documentation</a> (<a href="http://llvm.cs.uiuc.edu/doxygen/inherits.html">
+classes</a>)</li>
+
+<li><a href="http://llvm.cs.uiuc.edu/cvsweb/cvsweb.cgi/llvm">CVSWeb CVS Tree 
+Browser</a></li>
+
+</ul>
+
+<!--=======================================================================-->
+<div class="doc_section"><a name="subsystems">LLVM Subsystem Documentation</a></div>
+<!--=======================================================================-->
+
+<ul>
+
+<li><a href="WritingAnLLVMPass.html">Writing an LLVM Pass</a> - Information
+on how to write LLVM transformations and analyses.</li>
+
+<li><a href="CodeGenerator.html">The LLVM Target-Independent Code
+Generator</a> - The design and implementation of the LLVM code generator.
+Useful if you are working on retargetting LLVM to a new architecture, designing
+a new codegen pass, or enhancing existing components.</li>
+
+<li><a href="TableGenFundamentals.html">TableGen Fundamentals</a> -
+Describes the TableGen tool, which is used heavily by the LLVM code
+generator.</li>
+
+<li><a href="AliasAnalysis.html">Alias Analysis in LLVM</a> - Information
+on how to write a new alias analysis implementation or how to use existing
+analyses.</li>
+
+<li><a href="Stacker.html">The Stacker Cronicles</a> - This document
+describes both the Stacker language and LLVM frontend, but also some details
+about LLVM useful for those writing front-ends.</li>
+
+<li><a href="GarbageCollection.html">Accurate Garbage Collection with
+LLVM</a> - The interfaces source-language compilers should use for compiling
+GC'd programs.</li>
+
+<li><a href="SourceLevelDebugging.html">Source Level Debugging with
+LLVM</a> - This document describes the design and philosophy behind the LLVM
+source-level debugger.</li>
+
+<li><a href="Bugpoint.html">Bugpoint</a> automatic bug finder and
+test-case reducer description and usage information.</li>
+
+</ul>
+
+<!--=======================================================================-->
+<div class="doc_section"><a name="maillist">LLVM Mailing Lists</a></div>
+<!--=======================================================================-->
+
+<ul>
+<li>The <a href="http://mail.cs.uiuc.edu/mailman/listinfo/llvm-announce">
+LLVM Announcements List</a>: This is a low volume list that provides important 
+announcements regarding LLVM.  It gets email about once a month.</li>
+
+<li>The <a href="http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev">Developer's
+List</a>: This list is for people who want to be included in technical 
+discussions of LLVM. People post to this list when they have questions about 
+writing code for or using the LLVM tools. It is relatively low volume.</li>
+
+<li>The <a href="http://mail.cs.uiuc.edu/pipermail/llvmbugs/">Bugs &amp;
+Patches Archive</a>: This list gets emailed every time a bug is opened and
+closed, and when people submit patches to be included in LLVM.  It is higher 
+volume than the LLVMdev list.</li>
+
+<li>The <a href="http://mail.cs.uiuc.edu/pipermail/llvm-commits/">CVS Commits
+Archive</a>: This list contains all commit messages that are made when LLVM 
+developers commit code changes to the CVS archive. It is useful for those who 
+want to stay on the bleeding edge of LLVM development. This list is very high
+volume.</li>
+
+</ul>
+
+<!-- *********************************************************************** -->
+
+<hr>
+<address>
+  <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+  src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+  <a href="http://validator.w3.org/check/referer"><img
+  src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
+
+  <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
+  Last modified: $Date$
+</address>
+

llvm/docs/llvm.css

@@ -3,25 +3,58 @@
  */
 
 /* Common styles */
-.body { text: black; background: white; margin: 0 0 0 0 }
+.body { color: black; background: white; margin: 0 0 0 0 }
+
+/* No borders on image links */
+a:link img, a:visited img {border-style: none}
+
+address img { float: right; width: 88px; height: 31px; }
+address     { clear: right; }
 
 /* 
  * Documentation 
  */
 /* Common for title and header */
 .doc_title, .doc_section, .doc_subsection { 
-  color: #eeeeff; background: #330077;
+  color: black; background: url("img/lines.gif");
   font-family: "Georgia,Palatino,Times,Roman"; font-weight: bold;
-  padding-left: 8pt
+  border-width: 1px;
+  border-style: solid none solid none;
+  text-align: center;
+  vertical-align: middle;
+  padding-left: 8pt;
+  padding-top: 1px;
+  padding-bottom: 2px
 }
 
 .doc_title      { text-align: left;   font-size: 25pt }
-.doc_section    { text-align: center; font-size: 22pt }
-.doc_subsection { background: #441188; width: 50%;
-                  text-align: left;   font-size: 12pt; padding: 4 4 4 22 }
+.doc_section    { text-align: center; font-size: 22pt;
+                  margin: 20pt 0pt 5pt 0pt; }
+.doc_subsection { width: 75%;
+                  text-align: left;  font-size: 12pt; padding: 4pt 4pt 4pt 4pt;
+                  margin: 1.5em 0.5em 0.5em 0.5em }
+
+.doc_subsubsection { margin: 2.0em 0.5em 0.5em 0.5em;
+                     font-weight: bold; font-style: oblique;
+                     border-bottom: 1px solid #999999; font-size: 12pt;
+                     width: 75%; }
+.doc_author     { text-align: left; font-weight: bold; padding-left: 20pt }
 .doc_text       { text-align: left; padding-left: 20pt }
 
-/* Publications */
-.pub_title  { font-family: "Georgia,Palatino,Times,Roman"; font-size: 24pt; 
-              text-align: center }
-.pub_author { font-size: 14pt; text-align: center }
+.doc_footer     { text-align: left; padding: 0 0 0 0 }
+
+.doc_red        { color: red }
+
+.doc_table      { text-align: center; width: 90%; 
+                  padding: 1px 1px 1px 1px; border: 1px; }
+
+.doc_table_nw   { text-align: center; border: 1px; 
+    		  padding: 1px 1px 1px 1px; }
+
+.doc_warning    { color: red; font-weight: bold }
+
+.doc_code       { border: solid 1px gray; background: #eeeeee;
+                  margin: 0 1em 0 1em; 
+                  padding: 0 1em 0 1em;
+                  display:table;
+                }

llvm/include/Config/alloca.h

@@ -23,10 +23,11 @@
  *	2) If alloca.h cannot be found, then try stdlib.h.  Some platforms
  *	   (notably FreeBSD) defined alloca() there.
  */
-#ifndef __GNUC__
-#	ifdef HAVE_ALLOCA_H
-#		include <alloca.h>
-#	else
+#ifdef _MSC_VER
+/* noop on Visual C++ */
+#elif defined(HAVE_ALLOCA_H)
+#include <alloca.h>
+#elif !defined(__GNUC__)
 #	ifdef _AIX
  #		pragma alloca
 #	else
@@ -34,17 +35,12 @@
 			char * alloca ();
 #		endif
 #	endif
-#	endif
 #else
-#	ifdef HAVE_ALLOCA_H
-#		include <alloca.h>
-#	else
 #	ifdef HAVE_STDLIB_H
 #		include <stdlib.h>
 #	else
 #		error "The function alloca() is required but not found!"
 #	endif
-#	endif
 #endif
 
 #endif

llvm/include/Config/config.h.in

@@ -8,12 +8,6 @@
 /* Define to 1 if using `alloca.c'. */
 #undef C_ALLOCA
 
-/* Define if the machine is Big-Endian */
-#undef ENDIAN_BIG
-
-/* Define if the machine is Little-Endian */
-#undef ENDIAN_LITTLE
-
 /* Define to 1 if you have `alloca', as a function or macro. */
 #undef HAVE_ALLOCA
 
@@ -21,11 +15,8 @@
    */
 #undef HAVE_ALLOCA_H
 
-/* Define to 1 if you have the <assert.h> header file. */
-#undef HAVE_ASSERT_H
-
-/* define if the compiler has bidirectional iterator */
-#undef HAVE_BI_ITERATOR
+/* Define to 1 if you have the `backtrace' function. */
+#undef HAVE_BACKTRACE
 
 /* Define to 1 if you have the <dlfcn.h> header file. */
 #undef HAVE_DLFCN_H
@@ -33,17 +24,15 @@
 /* Define if dlopen() is available on this platform. */
 #undef HAVE_DLOPEN
 
-/* Define to 1 if you have the <errno.h> header file. */
-#undef HAVE_ERRNO_H
-
-/* define if the compiler has ext/slist */
-#undef HAVE_EXT_SLIST
+/* Define to 1 if you have the <execinfo.h> header file. */
+#undef HAVE_EXECINFO_H
 
 /* Define to 1 if you have the <fcntl.h> header file. */
 #undef HAVE_FCNTL_H
 
-/* define if the compiler has STL iterators */
-#undef HAVE_FWD_ITERATOR
+/* Define to 1 if your compiler defines finite in the <ieeefp.h> header file.
+   */
+#undef HAVE_FINITE_IN_IEEEFP_H
 
 /* Define to 1 if you have the `getcwd' function. */
 #undef HAVE_GETCWD
@@ -51,21 +40,33 @@
 /* Define to 1 if you have the `getpagesize' function. */
 #undef HAVE_GETPAGESIZE
 
+/* Define to 1 if you have the `getrusage' function. */
+#undef HAVE_GETRUSAGE
+
 /* Define to 1 if you have the `gettimeofday' function. */
 #undef HAVE_GETTIMEOFDAY
 
-/* define if the compiler has ext/hash_map */
-#undef HAVE_GNU_EXT_HASH_MAP
-
-/* define if the compiler has ext/hash_set in __gnu_cc */
-#undef HAVE_GNU_EXT_HASH_SET
-
 /* Define to 1 if the system has the type `int64_t'. */
 #undef HAVE_INT64_T
 
 /* Define to 1 if you have the <inttypes.h> header file. */
 #undef HAVE_INTTYPES_H
 
+/* Define to 1 if you have the `isatty' function. */
+#undef HAVE_ISATTY
+
+/* Define to 1 if your compiler defines isinf in the <cmath> header file. */
+#undef HAVE_ISINF_IN_CMATH
+
+/* Define to 1 if your compiler defines isinf in the <math.h> header file. */
+#undef HAVE_ISINF_IN_MATH_H
+
+/* Define to 1 if your compiler defines isnan in the <cmath> header file. */
+#undef HAVE_ISNAN_IN_CMATH
+
+/* Define to 1 if your compiler defines isnan in the <math.h> header file. */
+#undef HAVE_ISNAN_IN_MATH_H
+
 /* Define to 1 if you have the `elf' library (-lelf). */
 #undef HAVE_LIBELF
 
@@ -75,18 +76,22 @@
 /* Define to 1 if you have the <link.h> header file. */
 #undef HAVE_LINK_H
 
+/* Define if you can use -Wl,-R. to pass -R. to the linker, in order to add
+   the current directory to the dynamic linker search path. */
+#undef HAVE_LINK_R
+
 /* Define if mallinfo() is available on this platform. */
 #undef HAVE_MALLINFO
 
 /* Define to 1 if you have the <malloc.h> header file. */
 #undef HAVE_MALLOC_H
 
-/* Define to 1 if you have the <math.h> header file. */
-#undef HAVE_MATH_H
-
 /* Define to 1 if you have the <memory.h> header file. */
 #undef HAVE_MEMORY_H
 
+/* Define to 1 if you have the `mkstemp' function. */
+#undef HAVE_MKSTEMP
+
 /* Define to 1 if you have a working `mmap' system call. */
 #undef HAVE_MMAP
 
@@ -100,8 +105,8 @@
 /* define if the compiler implements namespaces */
 #undef HAVE_NAMESPACES
 
-/* Define to 1 if you have the <signal.h> header file. */
-#undef HAVE_SIGNAL_H
+/* Define to have the %a format string */
+#undef HAVE_PRINTF_A
 
 /* Define to 1 if you have the <stdint.h> header file. */
 #undef HAVE_STDINT_H
@@ -109,42 +114,23 @@
 /* Define to 1 if you have the <stdlib.h> header file. */
 #undef HAVE_STDLIB_H
 
-/* define if the compiler has ext/hash_map */
-#undef HAVE_STD_EXT_HASH_MAP
+/* Define to 1 if your compiler defines std::isinf in the <cmath> header file.
+   */
+#undef HAVE_STD_ISINF_IN_CMATH
 
-/* define if the compiler has ext/hash_set in std */
-#undef HAVE_STD_EXT_HASH_SET
-
-/* define if the compiler has STL iterators */
-#undef HAVE_STD_ITERATOR
-
-/* Define to 1 if you have the `strcspn' function. */
-#undef HAVE_STRCSPN
+/* Define to 1 if your compiler defines std::isnan in the <cmath> header file.
+   */
+#undef HAVE_STD_ISNAN_IN_CMATH
 
 /* Define to 1 if you have the `strdup' function. */
 #undef HAVE_STRDUP
 
-/* Define to 1 if you have the `strerror' function. */
-#undef HAVE_STRERROR
-
 /* Define to 1 if you have the <strings.h> header file. */
 #undef HAVE_STRINGS_H
 
 /* Define to 1 if you have the <string.h> header file. */
 #undef HAVE_STRING_H
 
-/* Define to 1 if you have the `strspn' function. */
-#undef HAVE_STRSPN
-
-/* Define to 1 if you have the `strstr' function. */
-#undef HAVE_STRSTR
-
-/* Define to 1 if you have the `strtod' function. */
-#undef HAVE_STRTOD
-
-/* Define to 1 if you have the `strtol' function. */
-#undef HAVE_STRTOL
-
 /* Define to 1 if you have the `strtoll' function. */
 #undef HAVE_STRTOLL
 
@@ -175,6 +161,9 @@
 /* Define to 1 if you have the <unistd.h> header file. */
 #undef HAVE_UNISTD_H
 
+/* Define to 1 if you have the <windows.h> header file. */
+#undef HAVE_WINDOWS_H
+
 /* Define to the address where bug reports for this package should be sent. */
 #undef PACKAGE_BUGREPORT
 
@@ -193,6 +182,9 @@
 /* Define as the return type of signal handlers (`int' or `void'). */
 #undef RETSIGTYPE
 
+/* Extension that shared libraries have, e.g., ".so". */
+#undef SHLIBEXT
+
 /* If using the C implementation of alloca, define if you know the
    direction of stack growth for your system; otherwise it will be
    automatically deduced at run-time.
@@ -214,18 +206,8 @@
    `char[]'. */
 #undef YYTEXT_POINTER
 
-/* Define to empty if `const' does not conform to ANSI C. */
-#undef const
-
-/* Define as `__inline' if that's what the C compiler calls it, or to nothing
-   if it is not supported. */
-#undef inline
-
 /* Define to `int' if <sys/types.h> does not define. */
 #undef pid_t
 
 /* Define to `unsigned' if <sys/types.h> does not define. */
 #undef size_t
-
-/* Define to have the %a format string in printf() */
-#undef HAVE_PRINTF_A

llvm/include/Config/dlfcn.h

@@ -16,17 +16,8 @@
 
 #include "Config/config.h"
 
-/*
- * According to the man pages on dlopen(), we sometimes need link.h.  So,
- * go grab it just in case.
- */
 #ifdef HAVE_DLFCN_H
 #include <dlfcn.h>
-
-#ifdef HAVE_LINK_H
-#include <link.h>
-#endif
-
 #endif
 
 #endif

llvm/include/Config/link.h

@@ -1,23 +0,0 @@
-/* 
- *                     The LLVM Compiler Infrastructure
- *
- * This file was developed by the LLVM research group and is distributed under
- * the University of Illinois Open Source License. See LICENSE.TXT for details.
- * 
- ******************************************************************************
- *
- * Description:
- *	This header file is the autoconf replacement for link.h (if it lives
- *	on the system).
- */
-
-#ifndef _CONFIG_LINK_H
-#define _CONFIG_LINK_H
-
-#include "Config/config.h"
-
-#ifdef HAVE_LINK_H
-#include <link.h>
-#endif
-
-#endif

llvm/include/Config/pagesize.h

@@ -0,0 +1,49 @@
+/* 
+ *                     The LLVM Compiler Infrastructure
+ *
+ * This file was developed by the LLVM research group and is distributed under
+ * the University of Illinois Open Source License. See LICENSE.TXT for details.
+ * 
+ ******************************************************************************
+ *
+ * This header file provides a platform-independent way of quering page size.
+ */
+
+#ifndef PAGESIZE_H
+#define PAGESIZE_H
+
+#include "Config/unistd.h"
+#include <sys/param.h>
+
+namespace llvm {
+
+/* Compatibility chart:
+ *
+ * Linux/x86:        _SC_PAGESIZE, _SC_PAGE_SIZE
+ * MacOS X/PowerPC:  v. 10.2: NBPG, 
+ *                   v. 10.3: _SC_PAGESIZE
+ * Solaris/Sparc:    _SC_PAGESIZE, _SC_PAGE_SIZE
+ */
+
+/**
+ * GetPageSize - wrapper to return page size in bytes for various 
+ *  architecture/OS combinations
+ */ 
+unsigned GetPageSize() {
+#ifdef _SC_PAGESIZE
+  return sysconf(_SC_PAGESIZE);
+#elif defined(_SC_PAGE_SIZE)
+  return sysconf(_SC_PAGE_SIZE);
+#elif defined(NBPG)
+#ifndef CLSIZE
+#define CLSIZE 1
+#endif
+  return NBPG * CLSIZE;
+#else
+  return 4096; /* allocate 4KB as a fall-back */
+#endif
+}
+
+}
+
+#endif

llvm/include/Config/stdlib.h

@@ -1,23 +0,0 @@
-/* 
- *                     The LLVM Compiler Infrastructure
- *
- * This file was developed by the LLVM research group and is distributed under
- * the University of Illinois Open Source License. See LICENSE.TXT for details.
- * 
- *===----------------------------------------------------------------------===//
- *
- * Description:
- *	This header file is the autoconf replacement for stdlib.h (if it lives
- *	on the system).
- */
-
-#ifndef _CONFIG_STDLIB_H
-#define _CONFIG_STDLIB_H
-
-#include "Config/config.h"
-
-#ifdef HAVE_STDLIB_H
-#include <stdlib.h>
-#endif
-
-#endif

llvm/include/Config/string.h

@@ -1,23 +0,0 @@
-/* 
- *                     The LLVM Compiler Infrastructure
- *
- * This file was developed by the LLVM research group and is distributed under
- * the University of Illinois Open Source License. See LICENSE.TXT for details.
- * 
- *===----------------------------------------------------------------------===//
- *
- * Description:
- *	This header file is the autoconf replacement for string.h (if it lives
- *	on the system).
- */
-
-#ifndef _CONFIG_STRING_H
-#define _CONFIG_STRING_H
-
-#include "Config/config.h"
-
-#ifdef HAVE_STRING_H
-#include <string.h>
-#endif
-
-#endif

llvm/include/Config/sys/mman.h

@@ -20,7 +20,7 @@
 
 #include "Config/config.h"
 
-#ifdef HAVE_SYS_MMAN_H
+#if defined(HAVE_SYS_MMAN_H) && !defined(_MSC_VER)
 #include <sys/mman.h>
 #endif
 

llvm/include/Config/sys/resource.h

@@ -1,4 +1,4 @@
-/*===-- Config/sys/resource.h - Annotation classes --------------*- C++ -*-===//
+/*===-- Config/sys/resource.h -----------------------------------*- C++ -*-===//
  * 
  *                     The LLVM Compiler Infrastructure
  *
@@ -18,22 +18,16 @@
 
 #include "Config/config.h"
 
-#ifdef HAVE_SYS_RESOURCE_H
+#if defined(HAVE_SYS_RESOURCE_H) && !defined(_MSC_VER)
 
 /*
  * In LLVM, we use sys/resource.h to use getrusage() and maybe some other
  * stuff.  Some man pages say that you also need sys/time.h and unistd.h.
  * So, to be paranoid, we will try to include all three if possible.
  */
-#ifdef HAVE_SYS_TIME_H
-#include <sys/time.h>
-#endif
-
+#include "Config/sys/time.h"
 #include <sys/resource.h>
-
-#ifdef HAVE_UNISTD_H
-#include <unistd.h>
-#endif
+#include "Config/unistd.h"
 
 #endif
 

llvm/include/Config/sys/stat.h

@@ -1,4 +1,4 @@
-/*===-- Config/sys/stat.h - Annotation classes --------------*- ----C++ -*-===//
+/*===-- Config/sys/stat.h -----------------------------------*- ----C++ -*-===//
  * 
  *                     The LLVM Compiler Infrastructure
  *
@@ -21,5 +21,9 @@
 #include <sys/stat.h>
 #endif
 
+#if defined(_MSC_VER)
+#define S_ISREG(X) ((X) & _S_IFREG)
+#endif
+
 #endif
 

llvm/include/Config/sys/time.h

@@ -1,4 +1,4 @@
-/*===-- Config/sys/time.h - Annotation classes ------------------*- C++ -*-===//
+/*===-- Config/sys/time.h ---------------------------------------*- C++ -*-===//
  * 
  *                     The LLVM Compiler Infrastructure
  *
@@ -17,7 +17,7 @@
 
 #include "Config/config.h"
 
-#ifdef HAVE_SYS_TIME_H
+#if defined(HAVE_SYS_TIME_H) && !defined(_MSC_VER)
 #include <sys/time.h>
 #endif
 

llvm/include/Config/sys/types.h

@@ -1,4 +1,4 @@
-/*===-- Config/sys/types.h - Annotation classes --------------*- C++ -*-===//
+/*===-- Config/sys/types.h --------------------------------------*- C++ -*-===//
  * 
  *                     The LLVM Compiler Infrastructure
  *

llvm/include/Config/sys/wait.h

@@ -1,4 +1,4 @@
-/*===-- Config/sys/wait.h - Annotation classes ------------------*- C++ -*-===//
+/*===-- Config/sys/wait.h ---------------------------------------*- C++ -*-===//
  * 
  *                     The LLVM Compiler Infrastructure
  *