llvm-svn: 3371

variables that are obviously dead.  The most common case is %FILE

llvm-svn: 3370

llvm-svn: 3369

llvm-svn: 3368

llvm-svn: 3367

    - ParseConstantPool was resolving reference to value using the function
      slot # instead of the global slot #.
  - Bytecode reader changes:
    - Remove the failure<> template from Bytecode Reader
    - Remove extraneous #includes
    - s/method/function/ a bit
    - Eliminate the fwdRefs class that just added abstraction where it was not
      needed, making things more complex.
    - Use a vector instead of a list for function signatures.

llvm-svn: 3366

llvm-svn: 3365

llvm-svn: 3364

Changed parser to always use parenthesis on ConstExprs to be consistent

llvm-svn: 3363

  - Changed parser to always use parenthesis on ConstExprs to be consistent
  - Parser now passes TRUE and FALSE tokens as a special case of the ConstExpr
    machinery instead of a special case of constant int stuff
  - Fix the AsmParser to use ValueRef ::= ConstExpr, and remove
    ResolvedVal ::= ConstExpr this allows constexprs to be used in PHI nodes

llvm-svn: 3362

llvm-svn: 3361

llvm-svn: 3360

llvm-svn: 3359

llvm-svn: 3358

llvm-svn: 3357

llvm-svn: 3356

llvm-svn: 3355

type result

llvm-svn: 3354

llvm-svn: 3353

llvm-svn: 3352

llvm-svn: 3351

llvm-svn: 3350

llvm-svn: 3349

llvm-svn: 3348

llvm-svn: 3347

llvm-svn: 3346

llvm-svn: 3345

Also, these tree nodes are now binary, not unary.

llvm-svn: 3344

but is instead implemented with XOR.  Note that the InstrForest opLabels
for Not and BNot remain the same, i.e., the XOR is recognized and
represented as a (boolean or bitwise) Not when building the instruction
trees.  But these tree nodes are now binary, not unary.

llvm-svn: 3343

no longer a separate instruction but is instead implemented with XOR.

llvm-svn: 3342

unary Neg and Not: isNeg, isNot, getNegArgument, and getNotArgument.

llvm-svn: 3341

llvm-svn: 3340

uint %test4(int %A, int %B) {
        %COND = setlt int %A, %B                ; <bool> [#uses=1]
        %result = cast bool %COND to uint               ; <uint> [#uses=1]
        ret uint %result
}
into a single cast instruction.

llvm-svn: 3339

llvm-svn: 3338

This _trivial_ change causes GCSE and LICM to be much more effective at
hoisting loads.  Before it would not be able to eliminate 'load X' if there
was just a dominating 'load X, 0' because the expressions were not identical.

llvm-svn: 3337

llvm-svn: 3336

llvm-svn: 3335

llvm-svn: 3334

llvm-svn: 3333

llvm-svn: 3332