diff options
| author | Niko Matsakis <niko@alum.mit.edu> | 2020-11-23 10:21:54 -0500 |
|---|---|---|
| committer | Mark Rousskov <mark.simulacrum@gmail.com> | 2021-09-17 12:47:48 -0400 |
| commit | 59dc2013e27adc5a251e81317331890d4015cdf0 (patch) | |
| tree | 772112a556eed71525d29d801c16cb8e6d9be11b /src/test/codegen/src-hash-algorithm/src-hash-algorithm-md5.rs | |
| parent | bc2ece2a8d14b1ec6f2e92b316e1a7c4fd216c9a (diff) | |
| download | rust-59dc2013e27adc5a251e81317331890d4015cdf0.tar.gz rust-59dc2013e27adc5a251e81317331890d4015cdf0.zip | |
optimization: use a single DepthFirstSearch instead of hashsets
Extend the `DepthFirstSearch` iterator so that it can be re-used and extended with add'l start nodes. Then replace the FxHashSets of nodes we were using in the fallback analysis with a single iterator. This way we won't re-walk portions of the graph that are reached more than once, and we also do less allocation etc.
Diffstat (limited to 'src/test/codegen/src-hash-algorithm/src-hash-algorithm-md5.rs')
0 files changed, 0 insertions, 0 deletions