input the the mul is a zext from bool, just that it is all zeros
other than the low bit.  This fixes some phase ordering issues
that would cause us to miss some xforms in mul.ll when the worklist
is visited differently.

llvm-svn: 83794

llvm-svn: 83792

gets but clang doesn't, because it is implemented in GCC's
fold routine.

llvm-svn: 83761

llvm-svn: 81257

of using llvm-as, now that opt supports this.

llvm-svn: 81226

llvm-svn: 75586

integer and floating-point opcodes, introducing
FAdd, FSub, and FMul.

For now, the AsmParser, BitcodeReader, and IRBuilder all preserve
backwards compatability, and the Core LLVM APIs preserve backwards
compatibility for IR producers. Most front-ends won't need to change
immediately.

This implements the first step of the plan outlined here:
http://nondot.org/sabre/LLVMNotes/IntegerOverflow.txt

llvm-svn: 72897

llvm-svn: 72875

do for scalars.  Patch contributed by Nicolas Capens

This also generalizes the previous xforms to work on long double, now that 
isExactlyValue works for long double.

llvm-svn: 54653

llvm-svn: 48483

llvm-svn: 39895

Make use of the END. facility on all files > 1K so that we aren't wasting CPU
cycles searching for RUN: lines that we'll never find.

llvm-svn: 36059

Upgrade tests to work with new llvm.exp version of llvm_runtest.

llvm-svn: 36013

llvm-svn: 33296

llvm-svn: 32115

llvm-svn: 11739

llvm-svn: 11736

llvm-svn: 11733

llvm-svn: 8558

llvm-svn: 8487

llvm-svn: 6966

llvm-svn: 6952

llvm-svn: 6905

* Add testcase for or ubyte, 255 which was broken before

llvm-svn: 5735

llvm-svn: 5732

  * A & ~A == 0
  * A / (2^c) == A >> c  if unsigned
  * 0 / A == 0
  * 1.0 * A == A
  * A * (2^c) == A << c
  * A ^ ~A == -1
  * A | ~A == -1
  * 0 % X = 0
  * A % (2^c) == A & (c-1) if unsigned
  * A - (A & B) == A & ~B
  * -1 - A == ~A

llvm-svn: 5588

If instcombine is making dead instructions, ALL that should be used is -die

llvm-svn: 3221

llvm-svn: 2416