diff options
| author | bors <bors@rust-lang.org> | 2025-09-17 13:56:54 +0000 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2025-09-17 13:56:54 +0000 |
| commit | 5d1b897a07dc30d810dd541795125c1c216266c7 (patch) | |
| tree | 039c32657725cddbb0528af54157fc9385063a95 /compiler/rustc_codegen_llvm/messages.ftl | |
| parent | ce6daf3d5a5bffb2a00264197f92dc31608df0da (diff) | |
| parent | 7abbc9c8b2c638752e2a6b0913ed1e93e14d21ba (diff) | |
| download | rust-5d1b897a07dc30d810dd541795125c1c216266c7.tar.gz rust-5d1b897a07dc30d810dd541795125c1c216266c7.zip | |
Auto merge of #146331 - RalfJung:copy-prov-repeat, r=oli-obk
interpret: copy_provenance: avoid large intermediate buffer for large repeat counts Copying provenance worked in this odd way where the "preparation" phase (which is supposed to just extract the necessary information from the source range) already did all the work of repeating the result N times for the target range. This was needed to use the existing `insert_presorted` function on `SortedMap`. This PR generalizes `insert_presorted` so that we can avoid this odd structure on copy-provenance, and maybe even improve performance.
Diffstat (limited to 'compiler/rustc_codegen_llvm/messages.ftl')
0 files changed, 0 insertions, 0 deletions