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

llvm-svn: 3331

llvm-svn: 3330

llvm-svn: 3329

have to support the cast instruction, so the function is renamed to getCast.

llvm-svn: 3328

llvm-svn: 3327

llvm-svn: 3326

llvm-svn: 3325

llvm-svn: 3324

llvm-svn: 3323

llvm-svn: 3322

llvm-svn: 3321

llvm-svn: 3320

llvm-svn: 3319

llvm-svn: 3318

llvm-svn: 3317

llvm-svn: 3316

    - Fixed testcases to not use them either.

llvm-svn: 3315

llvm-svn: 3314

llvm-svn: 3313