explanation from IRC:

	|sabre|	I think it's an order of evaluation thing
	|sabre|	for me, the RHS of the assignment is evaluated first
	|sabre|	getTypeDescription checks to see if ConcreteTypeDescription[Ty] contains anything
	|sabre|	since it doesn't, it computes and returns the value
	|sabre|	this gets put into the map.
	|sabre|	For you, the LHS is evaluated first.
	|sabre|	Map[Ty] (aka ConcreteTypeDescriptions[Ty]) inserts an empty string into the map, returning a reference
	|sabre|	getTypeDesc then sees the empty string in the map
	|sabre|	and returns it
	|sabre|	bork :)

llvm-svn: 20394

  * Loop invariant code does not dominate the loop header, but rather
    the end of the loop preheader.

  * The base for a reduced GEP isn't a constant unless all of its
    operands (preceding the induction variable) are constant.

  * Allow induction variable elimination for the simple case after all.

Also made changes recommended by Chris for properly deleting
instructions.

llvm-svn: 20383

llvm-svn: 20382

llvm-svn: 20380

Justin Wick!

llvm-svn: 20378

llvm-svn: 20377

llvm-svn: 20376

llvm-svn: 20375

llvm-svn: 20372

for reasons explained in the comments, I also deactivated this code as it needs
more thought.

llvm-svn: 20367

llvm-svn: 20360

llvm-svn: 20358

llvm-svn: 20354

llvm-svn: 20352

llvm-svn: 20343

llvm-svn: 20342

llvm-svn: 20340

llvm-svn: 20339

bytecode file members or not.
Patch Contributed By Adam Treat

llvm-svn: 20338

If we fold three constants together (c1+c2+c3), make sure to keep
LHSC updated, instead of reusing (in this case), the 1 instead of the
partial sum.

llvm-svn: 20337

llvm-svn: 20334

make BB labels be exported for debuging, add fp negation optimization, further pecimise the FP instructions

llvm-svn: 20332

Actually teach dsa about select instructions.  This doesn't affect the
graph in any way other than not setting a spurious U marker on pointer
nodes that are selected.

llvm-svn: 20324

  X = gep null, ...

Used to not create a scalar map entry for X, which caused clients to barf.
This is bad.

llvm-svn: 20316

llvm-svn: 20308

llvm-svn: 20306

reporting the problem and exiting.

llvm-svn: 20302

This does a simple form of "jump threading", which eliminates CFG edges that
are provably dead.  This triggers 90 times in the external tests, and
eliminating CFG edges is always always a good thing! :)

llvm-svn: 20300

llvm-svn: 20298

llvm-svn: 20297

llvm-svn: 20296

llvm-svn: 20295

llvm-svn: 20293

Only print out machine instructions before modulo scheduling if we are actually doing modulo scheduling! :)

llvm-svn: 20292

llvm-svn: 20290

llvm-svn: 20289

llvm-svn: 20288

this reduces the time for -simplifycfg in a debug build from 106s to 14.82s

llvm-svn: 20286

llvm-svn: 20284

llvm-svn: 20280