nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2024-11-25 08:13:41 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove a few unnecessary constructions

Browse Source 
This shaves off ca 6% of the cycles in `start_walk_from()` in my
experiments.
This commit is contained in:
Amanda Stjerna 2024-05-20 13:25:55 +02:00
parent b1add7bc04
commit aee846224c
1 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
compiler/rustc_data_structures/src/graph/scc/mod.rs
View File

@ -535,7 +535,6 @@ where
successors_len: 0,
min_cycle_root: initial,
successor_node: initial,
// Strictly speaking not necessary, but assumed to be idempotent:
current_component_annotation: (self.to_annotation)(initial),
}];
@ -556,7 +555,9 @@ where
let depth = *depth;
// node is definitely in the current component, add it to the annotation.
if node != initial {
current_component_annotation.update_scc((self.to_annotation)(node));
}
debug!(
"Visiting {node:?} at depth {depth:?}, annotation: {current_component_annotation:?}"
);
@ -570,8 +571,10 @@ where
debug_assert!(matches!(self.node_states[node], NodeState::NotVisited));
// Push `node` onto the stack.
self.node_states[node] =
NodeState::BeingVisited { depth, annotation: (self.to_annotation)(node) };
self.node_states[node] = NodeState::BeingVisited {
depth,
annotation: *current_component_annotation,
};
self.node_stack.push(node);
// Walk each successor of the node, looking to see if any of