aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorOrlando Cazalet-Hyams <orlando.hyams@sony.com>2025-05-06 15:03:20 +0100
committerGitHub <noreply@github.com>2025-05-06 15:03:20 +0100
commitf8de1618cc3349829ed5ab699413dcb84451e0c7 (patch)
treeef571b0cbd097f457615b98032bd182cee9b9579 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parentaec39293316049e5944ac281f800efe5e0dcac5f (diff)
downloadllvm-f8de1618cc3349829ed5ab699413dcb84451e0c7.zip
llvm-f8de1618cc3349829ed5ab699413dcb84451e0c7.tar.gz
llvm-f8de1618cc3349829ed5ab699413dcb84451e0c7.tar.bz2
[KeyInstr][SimplifyCFG] Remap atoms when folding br to common succ into pred (#133482)
SimplifyCFG folds `d` into preds `b` and `c`. +---------------+ | | +--> b --+ | | v v --> a d --> e --> f --> | ^ ^ +--> c --+ | | | +---------------+ Remap source atoms so that the duplicated instructions are analysed independently to determine is_stmt positions. The pull request contains a discussion covering various edge cases here: https://github.com/llvm/llvm-project/pull/133482/files#r2039519348 The summary of the discussion is that we could avoid remapping when there's a single pred, but we decided that it's still a trade off, and not worth the additional complexity right now. RFC: https://discourse.llvm.org/t/rfc-improving-is-stmt-placement-for-better-interactive-debugging/82668
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions