llvm-6502/test/Transforms/InstCombine/add-sitofp.ll

; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {add i32}

define double @x(i32 %a, i32 %b) nounwind {
  %m = lshr i32 %a, 24
  %n = and i32 %m, %b
  %o = sitofp i32 %n to double
  %p = fadd double %o, 1.0
  ret double %p
}
Generalize the new code in instcombine's ComputeNumSignBits for handling and/or to handle more cases (such as this add-sitofp.ll testcase), and port it to selectiondag's ComputeNumSignBits. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@51469 91177308-0d34-0410-b5e6-96231b3b80d8 2008-05-23 02:28:01 +00:00			`; RUN: llvm-as < %s \| opt -instcombine \| llvm-dis \| grep {add i32}`

			`define double @x(i32 %a, i32 %b) nounwind {`
			`%m = lshr i32 %a, 24`
			`%n = and i32 %m, %b`
			`%o = sitofp i32 %n to double`
Split the Add, Sub, and Mul instruction opcodes into separate 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 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@72897 91177308-0d34-0410-b5e6-96231b3b80d8 2009-06-04 22:49:04 +00:00			`%p = fadd double %o, 1.0`
Generalize the new code in instcombine's ComputeNumSignBits for handling and/or to handle more cases (such as this add-sitofp.ll testcase), and port it to selectiondag's ComputeNumSignBits. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@51469 91177308-0d34-0410-b5e6-96231b3b80d8 2008-05-23 02:28:01 +00:00			`ret double %p`
			`}`