martong added inline comments.
================ Comment at: clang/lib/Analysis/ReachingDefinitions.cpp:269 + for (const CFGBlock *Succ : N->succs()) + Worklist.push_back(Succ); + } ---------------- I understand that this is the worklist algorithm uplifted from Wikipedia. But how do we transmogrify the original algorithm [1] to that one? What's particularly interesting for me is that we continue with the successors from here instead of examining all blocks over again. [1] Dragon book, 2007 Repository: rG LLVM Github Monorepo CHANGES SINCE LAST ACTION https://reviews.llvm.org/D76287/new/ https://reviews.llvm.org/D76287 _______________________________________________ cfe-commits mailing list cfe-commits@lists.llvm.org https://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
