2012-05-18-LoopPredRecurse.ll 996 B

123456789101112131415161718192021222324252627282930
  1. ; RUN: opt < %s -iv-users -S -disable-output
  2. ;
  3. ; PR12868: Infinite recursion:
  4. ; getUDivExpr()->getZeroExtendExpr()->isLoopBackedgeGuardedBy()
  5. ;
  6. ; We actually want SCEV simplification to fail gracefully in this
  7. ; case, so there's no output to check, just the absence of stack overflow.
  8. @c = common global i8 0, align 1
  9. define i32 @func() {
  10. entry:
  11. br label %for.cond
  12. for.cond: ; preds = %for.body, %entry
  13. %storemerge = phi i8 [ -1, %entry ], [ %inc, %for.body ]
  14. %ui.0 = phi i32 [ undef, %entry ], [ %div, %for.body ]
  15. %tobool = icmp eq i8 %storemerge, 0
  16. br i1 %tobool, label %for.end, label %for.body
  17. for.body: ; preds = %for.cond
  18. %conv = sext i8 %storemerge to i32
  19. %div = lshr i32 %conv, 1
  20. %tobool2 = icmp eq i32 %div, 0
  21. %inc = add i8 %storemerge, 1
  22. br i1 %tobool2, label %for.cond, label %for.end
  23. for.end: ; preds = %for.body, %for.cond
  24. ret i32 0
  25. }