Rust-related/luminal
1
0
Fork 1
mirror of https://github.com/jafioti/luminal.git synced 2026-06-01 21:49:47 +09:00
Code Issues Packages Projects Releases Wiki Activity

clean

Browse Source
This commit is contained in:
Joe Fioti
2025-08-20 23:14:52 -07:00
parent 4bd28878d6
commit 1f998aa4b9
2 changed files with 4 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
crates/luminal_2/src/extract.rs
View File

@@ -149,10 +149,8 @@ fn extract_trajectories<'a>(
trajectory_cache: &mut FxHashMap<&'a NodeId, Vec<Vec<&'a NodeId>>>,
waiting: usize,
) -> Vec<Vec<&'a NodeId>> {
println!("waiting: {waiting}");
let mut trajectories = vec![];
'enode_loop: for enode in &egraph.classes()[current_class].nodes {
println!("enode loop[");
if INVALID_IR.contains(&egraph.nodes[enode].op.as_str()) {
junk_cache.insert(enode);
continue;
@@ -164,7 +162,6 @@ fn extract_trajectories<'a>(
let mut enode_trajectories = vec![];
*seen.entry(enode).or_insert(0) += 1;
for child in &egraph.nodes[enode].children {
println!("child loop");
// Ask what's the child's trajectories
if !trajectory_cache.contains_key(child) {
let child_trajectories = if is_expression_enode(&egraph.nodes[child].op) {
@@ -203,11 +200,6 @@ fn extract_trajectories<'a>(
enode_trajectories.push(child_trajectory);
}
} else if !trajectory_cache[child].is_empty() {
println!(
"cart {} w {}",
enode_trajectories.len(),
trajectory_cache[child].len()
);
// Cartisian product the current trajectories with the new trajectories
if enode_trajectories.len() * trajectory_cache[child].len() > MAX_SEARCHED_GRAPHS {
enode_trajectories = enode_trajectories

8
crates/luminal_2/src/translate.rs
View File

@@ -26,10 +26,10 @@ impl InitData {
}
pub type CrossSubGraphTensorIndexes = (NodeIndex, NodeIndex);
pub type MetaGraphNodeIndex = (NodeIndex);
pub type SubGraphNodeIndex = (NodeIndex);
pub type OrigGraphNodeIndex = (NodeIndex);
pub type OptimalGraphNodeIndex = (NodeIndex);
pub type MetaGraphNodeIndex = NodeIndex;
pub type SubGraphNodeIndex = NodeIndex;
pub type OrigGraphNodeIndex = NodeIndex;
pub type OptimalGraphNodeIndex = NodeIndex;
pub type SubGraph = StableGraph<GraphTerm, (), Directed>;
pub type MetaGraph = StableGraph<SubGraph, CrossSubGraphTensorIndexes, Directed>;