[PATCH] D127874: [analyzer] Reimplement UnreachableCodeChecker using worklists

[Gabor Marton via Phabricator via cfe-commits]

martong added a comment.

> I don't think any of the issues mentioned in this patch relates to strongly connected components, thus I don't think I can answer to this question.

In your example above, repeated here:

  #6(entry)      #2(goto a;)
   |              |        ^
  #5(goto end;)   |         \
   |             #4(goto b;) |
  #1(end:)        |          |
   |             #3(goto c;) |
  #0(exit)         \________/

[#2, #4, #3] is a strongly connected (and unreachable) component  of the CFG, isn't it?


Repository:
  rG LLVM Github Monorepo

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

https://reviews.llvm.org/D127874