[Hexagon] Simplify CFG after atomic expansion

This will remove suboptimal branching from the generated ll/sc loops.
The extra simplification pass affects a lot of testcases, which have
been modified to accommodate this change: either by modifying the
test to become immune to the CFG simplification, or (less preferablt)
by adding option -hexagon-initial-cfg-clenaup=0.

llvm-svn: 338774

1 files changed, 4 insertions, 4 deletions

diff --git a/llvm/test/CodeGen/Hexagon/bitconvert-vector.ll b/llvm/test/CodeGen/Hexagon/bitconvert-vector.ll
index 584cbca1ff4..21846c90f5b 100644
--- a/llvm/test/CodeGen/Hexagon/bitconvert-vector.ll
+++ b/llvm/test/CodeGen/Hexagon/bitconvert-vector.ll
@@ -11,15 +11,15 @@ declare <32 x i32> @llvm.hexagon.V6.lo.128B(<64 x i32>) #0
 declare <64 x i32> @llvm.hexagon.V6.vshuffvdd.128B(<32 x i32>, <32 x i32>, i32) #0
 declare <32 x i32> @llvm.hexagon.V6.valignbi.128B(<32 x i32>, <32 x i32>, i32) #0
 
-define void @fred() #1 {
+define void @fred(<64 x i16>* %a0, <32 x i32>* %a1) #1 {
 entry:
   %t0 = bitcast <64 x i16> zeroinitializer to <32 x i32>
   %t1 = tail call <32 x i32> @llvm.hexagon.V6.valignbi.128B(<32 x i32> %t0, <32 x i32> undef, i32 2)
   %t2 = tail call <64 x i32> @llvm.hexagon.V6.vshuffvdd.128B(<32 x i32> undef, <32 x i32> %t1, i32 -2)
   %t3 = tail call <32 x i32> @llvm.hexagon.V6.lo.128B(<64 x i32> %t2)
-  store <64 x i16> zeroinitializer, <64 x i16>* undef, align 128
-  store <32 x i32> %t3, <32 x i32>* undef, align 128
-  unreachable
+  store <64 x i16> zeroinitializer, <64 x i16>* %a0, align 128
+  store <32 x i32> %t3, <32 x i32>* %a1, align 128
+  ret void
 }