aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Transforms/Utils/LoopVersioning.cpp
diff options
context:
space:
mode:
authorSam McCall <sam.mccall@gmail.com>2020-09-01 20:22:59 +0200
committerSam McCall <sam.mccall@gmail.com>2020-09-22 19:43:41 +0200
commit625761825620f19a44c7a1482ce05d678a1b0deb (patch)
tree2e3fa3b8ad6a1e16ca5f0ba4005224f16ef0cdc5 /llvm/lib/Transforms/Utils/LoopVersioning.cpp
parentc3c08bfdfd6244e0429753ee56df39c90187d772 (diff)
downloadllvm-625761825620f19a44c7a1482ce05d678a1b0deb.zip
llvm-625761825620f19a44c7a1482ce05d678a1b0deb.tar.gz
llvm-625761825620f19a44c7a1482ce05d678a1b0deb.tar.bz2
[ASTMatchers] Avoid recursion in ancestor matching to save stack space.
A recent change increased the stack size of memoizedMatchesAncestorOfRecursively leading to stack overflows on real code involving large fold expressions. It's not totally unreasonable to choke on very deep ASTs, but as common infrastructure it's be nice if ASTMatchFinder is more robust. (It already uses data recursion for the regular "downward" traversal.) Differential Revision: https://reviews.llvm.org/D86964
Diffstat (limited to 'llvm/lib/Transforms/Utils/LoopVersioning.cpp')
0 files changed, 0 insertions, 0 deletions