llvm-svn: 29672

llvm-svn: 29671

llvm-svn: 29670

Rafael Espindola for pointing this out.

llvm-svn: 29669

llvm-svn: 29668

llvm-svn: 29667

llvm-svn: 29665

ldr rx, [ry, #offset]

llvm-svn: 29664

source dir for LLVM to be specified explicitly. This removes the dependency
on the llvm-config script. If the option is not given, then the scripts use
llvm-config which should be both built and in the PATH. This arrangement
provides a useful default for most developers but also allows the nightly
tester to execute countloc.sh before llvm-config is built and without
altering the PATH.

llvm-svn: 29663

llvm-svn: 29662

llvm-svn: 29661

llvm-svn: 29660

llvm-svn: 29659

llvm-svn: 29658

llvm-svn: 29656

2. make use of the -code-only option on llvmdo
3. Add some debug print statements to find #1

llvm-svn: 29655

nightly test graph. And, documentation is important.

llvm-svn: 29654

are considered to be code. This will give a drop in the LOC count on the
nightly testers, but it is more accurate than previous estimates.

llvm-svn: 29653

files that are considered to be code. Documentation is excluded.

llvm-svn: 29652

  1. Remove tabs
  2. Wrap to 80 columns
  3. Put spaces between "if" or "elsif" and expression
  4. Put { on same line as if statement.
  5. Make indentation be 2 spaces.
Functionality change:
  Run utils/countloc.sh after the build is done. This is necessary because
  that script now uses llvm-config to find the top src directory.

llvm-svn: 29651

the number of relocations in object files, shrinkifying them.

llvm-svn: 29650

llvm-svn: 29649

llvm-svn: 29648

Not only will this take huge amounts of compile time, the resultant loop nests
won't be useful for optimization.  This reduces loopsimplify time on
Transforms/LoopSimplify/2006-08-11-LoopSimplifyLongTime.ll from ~32s to ~0.4s
with a debug build of llvm on a 2.7Ghz G5.

llvm-svn: 29647

llvm-svn: 29646

pounding on Loop::contains (which is O(n) in the size of the loop), use a
sorted vector, which is O(log(N)) for each query.  This speeds up Duraid's
horrible testcase from ~72s to ~31s in a debug build.

llvm-svn: 29645

blocks that target loop blocks.

Before, the code was run once per loop, and depended on the number of
predecessors each block in the loop had.  Unfortunately, scanning preds can
be really slow when huge numbers of phis exist or when phis with huge numbers
of inputs exist.

Now, the code is run once per function and scans successors instead of preds,
which is far faster.  In addition, the new code is simpler and is goto free,
woo.

This change speeds up a nasty testcase Duraid provided me from taking hours to
taking ~72s with a debug build.  The functionality this implements is already
tested in the testsuite as Transforms/CodeExtractor/2004-03-13-LoopExtractorCrash.ll.

llvm-svn: 29644

llvm-svn: 29643

doesn't significantly improve performance but it helps a small amount.

llvm-svn: 29642

so we remove it from being counted.

llvm-svn: 29641

speedup in isel time.

llvm-svn: 29640

#includes it.

llvm-svn: 29639

llvm-svn: 29638

previously missed.

llvm-svn: 29637

llvm-svn: 29636

llvm-svn: 29635

eliminate code duplication due to the 'N' parameter.

llvm-svn: 29634

Added two flags (-submit-server and -submit-script) which allow the user to specify where the test results are submitted too. If these are not specified they default to the LLVM.org server.

llvm-svn: 29633

root from the llvm-config script.

llvm-svn: 29632

llvm-svn: 29631