summaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorRoman Lebedev <lebedev.ri@gmail.com>2021-11-05 19:22:27 +0300
committerRoman Lebedev <lebedev.ri@gmail.com>2021-11-05 19:22:48 +0300
commit0b36431810076790b1f3362495b2eaebc9be96c7 (patch)
tree09b71399185ee01a7de2bb1b9a6df33424cae63e /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parent3151fca9f3698a1dc4f07a26351f5c6f06688d89 (diff)
[NFCI] InstructionTest: trim `InstructionsTest.ShuffleMaskIsReplicationMask_*` complexity
These tests have pretty high O() complexity due to their nature, which leads to potentially-long runtimes. While in release build for me they took ~1 and ~2 sec, as noted in https://reviews.llvm.org/D113214#inline-1080479 they take minutes in debug build. Fine-tune the amount of permutations they deal with, without affecting the test coverage. After this, they take <~10ms each for me (in release build), hopefully that is good-enough for debug build too.
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions