[PATCH] D92401: [BasicAA] Handle two unknown sizes for GEPs

[Nikita Popov via Phabricator via llvm-commits]

nikic added a comment.

@fhahn Thank you! For this test case we end up recursing through a deep "gep of phi of gep of phi of ..." chain, where we split up into two branches at each phi, resulting in exponential runtime. Not recursing in this case, while somewhat arbitrary, ends up cutting off the recursion at the first "gep of phi" where we no longer have known sizes.

I think the right way to address this is to introduce a proper recursion limit in BasicAA, though that would take some care to ensure cache consistency.


Repository:
  rG LLVM Github Monorepo

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

https://reviews.llvm.org/D92401