hanchenye-llvm-project/llvm/test/Transforms/InstCombine/add-sitofp.ll

; RUN: opt < %s -instcombine -S | grep {add nsw 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
}
Code that checks WillNotOverflowSignedAdd before creating an Add can safely use the NSW bit on the Add. llvm-svn: 85164 2009-10-27 06:14:22 +08:00			`; RUN: opt < %s -instcombine -S \| grep {add nsw i32}`
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. llvm-svn: 51469 2008-05-23 10:28:01 +08:00
			`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 llvm-svn: 72897 2009-06-05 06:49:04 +08: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. llvm-svn: 51469 2008-05-23 10:28:01 +08:00			`ret double %p`
			`}`