Support unary FNeg in LICM

[spatel]

LGTM

llvm/trunk/lib/Transforms/Scalar/LICM.cpp

 
 namespace {
 /// Return true if-and-only-if we know how to (mechanically) both hoist and
 /// sink a given instruction out of a loop.  Does not address legality
 /// concerns such as aliasing or speculation safety.
 bool isHoistableAndSinkableInst(Instruction &I) {
   // Only these instructions are hoistable/sinkable.
   return (isa<LoadInst>(I) || isa<StoreInst>(I) || isa<CallInst>(I) ||
-          isa<FenceInst>(I) || isa<BinaryOperator>(I) || isa<CastInst>(I) ||
+          isa<FenceInst>(I) || isa<CastInst>(I) ||
+          isa<UnaryOperator>(I) || isa<BinaryOperator>(I) ||
           isa<SelectInst>(I) || isa<GetElementPtrInst>(I) || isa<CmpInst>(I) ||
           isa<InsertElementInst>(I) || isa<ExtractElementInst>(I) ||
           isa<ShuffleVectorInst>(I) || isa<ExtractValueInst>(I) ||
           isa<InsertValueInst>(I));
 }
 /// Return true if all of the alias sets within this AST are known not to
 /// contain a Mod, or if MSSA knows thare are no MemoryDefs in the loop.
 bool isReadOnly(AliasSetTracker *CurAST, const MemorySSAUpdater *MSSAU,

llvm/trunk/test/Transforms/LICM/hoisting.ll

then:                                             ; preds = %tailrecurse
   %cmp2 = add i32 %i.tr, 1
   br label %tailrecurse
 
 ifend:                                            ; preds = %tailrecurse
   ret { i32*, i32 } %d
 }
 
 ; CHECK: define void @test6(float %f)
-; CHECK: call
 ; CHECK: fneg
-; CHECK: call
+; CHECK: br label %for.body
 define void @test6(float %f) #2 {
 entry:
   br label %for.body
 
 for.body:                                         ; preds = %for.body, %entry
   %i = phi i32 [ 0, %entry ], [ %inc, %for.body ]
   call void @foo_may_call_exit(i32 0)
   %neg = fneg float %f