lftr-promote.ll 1.3 KB

1234567891011121314151617181920212223242526272829303132333435363738
  1. ; RUN: opt < %s -indvars -S | grep add | count 1
  2. ; Indvars should be able to compute the exit value of this loop
  3. ; without any additional arithmetic. The only add needed should
  4. ; be the canonical IV increment.
  5. target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128"
  6. define void @foo(double* %p, i32 %n) nounwind {
  7. entry:
  8. %0 = icmp sgt i32 %n, 0 ; <i1> [#uses=1]
  9. br i1 %0, label %bb.nph, label %return
  10. bb.nph: ; preds = %entry
  11. br label %bb2
  12. bb2: ; preds = %bb3, %bb.nph
  13. %i.01 = phi i32 [ %7, %bb3 ], [ 0, %bb.nph ] ; <i32> [#uses=3]
  14. %1 = sext i32 %i.01 to i64 ; <i64> [#uses=1]
  15. %2 = getelementptr double, double* %p, i64 %1 ; <double*> [#uses=1]
  16. %3 = load double, double* %2, align 8 ; <double> [#uses=1]
  17. %4 = fmul double %3, 1.100000e+00 ; <double> [#uses=1]
  18. %5 = sext i32 %i.01 to i64 ; <i64> [#uses=1]
  19. %6 = getelementptr double, double* %p, i64 %5 ; <double*> [#uses=1]
  20. store double %4, double* %6, align 8
  21. %7 = add i32 %i.01, 1 ; <i32> [#uses=2]
  22. br label %bb3
  23. bb3: ; preds = %bb2
  24. %8 = icmp slt i32 %7, %n ; <i1> [#uses=1]
  25. br i1 %8, label %bb2, label %bb3.return_crit_edge
  26. bb3.return_crit_edge: ; preds = %bb3
  27. br label %return
  28. return: ; preds = %bb3.return_crit_edge, %entry
  29. ret void
  30. }