diff options
| author | Nikita Popov <npopov@redhat.com> | 2022-02-10 10:38:37 +0100 |
|---|---|---|
| committer | Nikita Popov <npopov@redhat.com> | 2022-02-11 09:30:39 +0100 |
| commit | e24067819fbda2f2bf5d1f43dfe36c114accc21d (patch) | |
| tree | 57dd1831cdec0acca8de387fecafdec326e61c20 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp | |
| parent | a3655de2c81fc959590c109d81a010fc8e09c48e (diff) | |
| download | llvm-e24067819fbda2f2bf5d1f43dfe36c114accc21d.zip llvm-e24067819fbda2f2bf5d1f43dfe36c114accc21d.tar.gz llvm-e24067819fbda2f2bf5d1f43dfe36c114accc21d.tar.bz2 | |
[ArgPromotion] Protect harder against recursive promotion (PR42028)
In addition to the self-recursion check, also check whether there
is more than one node in the SCC, which implies that there is a
larger cycle. I believe checking SCC structure (rather than
something like norecurse) is the right thing to do here, because
this is specifically about preventing infinite loops over the SCC.
Fixes https://github.com/llvm/llvm-project/issues/42028.
Differential Revision: https://reviews.llvm.org/D119418
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions