aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorFangrui Song <i@maskray.me>2024-04-29 22:05:35 -0700
committerFangrui Song <i@maskray.me>2024-04-29 22:05:35 -0700
commit79095b4079e8d4f8176bcc53fdacd2765f310cdb (patch)
tree87991950ca6e3dfe383b96f8d2ea32708efa2813 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parent326667d727546dad0ce9315aa93a3da698c7c71c (diff)
downloadllvm-79095b4079e8d4f8176bcc53fdacd2765f310cdb.zip
llvm-79095b4079e8d4f8176bcc53fdacd2765f310cdb.tar.gz
llvm-79095b4079e8d4f8176bcc53fdacd2765f310cdb.tar.bz2
[ELF] --compress-debug-sections=zstd: replace ZSTD_c_nbWorkers parallelism with multi-frame parallelism
https://reviews.llvm.org/D133679 utilizes zstd's multithread API to create one single frame. This provides a higher compression ratio but is significantly slower than concatenating multiple frames. With manual parallelism, it is easier to parallelize memcpy in OutputSection::writeTo for parallel memcpy. In addition, as the individual allocated decompression buffers are much smaller, we can make a wild guess (compressed_size/4) without worrying about a resize (due to wrong guess) would waste memory.
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions