[PATCH] D74691: [Attributor]Detect functions with unbounded loops

[Roman Lebedev via Phabricator via llvm-commits]

lebedev.ri added inline comments.


================
Comment at: llvm/lib/Transforms/IPO/Attributor.cpp:2373
 // TODO: Replace with more efficent code
-static bool containsCycle(Function &F) {
-  SmallPtrSet<BasicBlock *, 32> Visited;
+static bool containsUnboundedCycle(Function &F, Attributor &A) {
+  bool NoAnalysis = false;
----------------
I'm a little bit lost here, if a loop is not known to have `SmallConstantMaxTripCount`,
why does that mean it's unbounded?


Repository:
  rG LLVM Github Monorepo

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D74691/new/

https://reviews.llvm.org/D74691