[PATCH] D131827: [LoopSimplify][NFC] Replace depth-first order process as depth_first accessor.

[Florian Hahn via Phabricator via llvm-commits]

fhahn added inline comments.


================
Comment at: llvm/lib/Transforms/Utils/LoopSimplify.cpp:731
   SmallVector<Loop *, 4> Worklist;
-  Worklist.push_back(L);
-
-  // Walk the worklist from front to back, pushing newly found sub loops onto
-  // the back. This will let us process loops from back to front in depth-first
-  // order. We can use this simple process because loops form a tree.
-  for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) {
-    Loop *L2 = Worklist[Idx];
-    Worklist.append(L2->begin(), L2->end());
-  }
+  for_each(depth_first(L),
+           [&Worklist](Loop *SubLoop) { Worklist.push_back(SubLoop); });
----------------
StephenFan wrote:
> StephenFan wrote:
> > reames wrote:
> > > This looks wrong.  The original loop was pushing elements in inverse depth first order (i.e. from the root down) so that it could walk backwards through that order to get dfs.  You seem to be visiting each item in dfs, and adding them to worklist, and then still visiting them in inverse order.  
> > Thanks! Indeed, I was wrong. I found that the inverse_depth_first iterator accessor might be suitable.
> After digging into the implementation detail of `depth_first`, I feel like you may have misunderstood what `depth_first` would do. I found that `depth_first` would return nodes from the root down. So this patch looks correct. 
You should be able to verify that the contents of the worklist stays the same by computing it both ways and then comparing them.


Repository:
  rG LLVM Github Monorepo

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

https://reviews.llvm.org/D131827