llvm-svn: 2700

That was causing a miscompilation of strtol/atoi plus others

llvm-svn: 2669

* Add optimization to rank computation to not recursively search when
  unneccesary.
* More agressively negate expressions to open reassociation opportunities.
* Linearize (A+B)+(C+D) into ((A+B)+C)+D

llvm-svn: 2637

By making sure to consider binary expressions identical if their operands
are backwards, but swappable.

llvm-svn: 2629

llvm-svn: 2627

"This testcase caused instcombine to fail because it got the same instruction on
it's worklist more than once (which is ok), but then deleted the instruction.
Since the inst stayed on the worklist, as soon as it came back up to be
processed, bad things happened, and opt asserted."

llvm-svn: 2623

llvm-svn: 2620

llvm-svn: 2617

llvm-svn: 2615

the command line

llvm-svn: 2601

llvm-svn: 2600

llvm-svn: 2593

llvm-svn: 2582

llvm-svn: 2581

llvm-svn: 2566

* Bugfix:  A + -B and -A + B

llvm-svn: 2561

llvm-svn: 2559

Cleanup code a lot

llvm-svn: 2547

llvm-svn: 2537

llvm-svn: 2529

the Scalar and Utils subdirectories

llvm-svn: 2523

llvm-svn: 2518

llvm-svn: 2517

llvm-svn: 2516

  is empirically faster by a noticable margin, even though duplicates can
  happen.

llvm-svn: 2511

* Convert to worklist instead of iterative algorithm

llvm-svn: 2510

llvm-svn: 2504

* Convert main constant propogation pass to be worklist driven instead of
  iterative.
* -constprop pass no longer "constant propogates" terminator instructions
   - CFG is now preserved!

llvm-svn: 2502

llvm-svn: 2501

* Remove dead PHI case (which could not work due to getNumOperands rather than
  getNumIncomingValues.  This really belongs in InstCombine, anyway so we'll
  move it there.

llvm-svn: 2497

llvm-svn: 2494

llvm-svn: 2493

llvm-svn: 2490

llvm-svn: 2484

void "test3"(bool %T) {
        br bool %T, label %BB1, label %BB1
BB1:
        ret void
}

llvm-svn: 2472

llvm-svn: 2471

Now use #if 0 instead of #ifdef 0

llvm-svn: 2448

llvm-svn: 2447

    test/Regression/Transforms/SCCP/2002-05-02-EdgeFailure.ll
* SCCP now preserves the CFG:  It leaves conditional branches the way they
  are in the program, not simplifying them.  A seperate pass should eliminate
  the potentially dead basic blocks and edges in the CFG.

llvm-svn: 2446

* Change worklist to a set so that duplicates cannot happen
* Add support for the invoke instruction
* Avoid marking store and free instructions as overdefined, since they
  cannot produce a value anyway.
* Inline the OperandChangedState implementation
* Add isEdgeFeasible in preparation to fix a bug.  Right now it behaves
  exactly as before.
* Remove obsolete comment about constant pools

llvm-svn: 2445