Update sorting algorithm for sequential circuits

TrustworthyComputing · Jun 19, 2023 · 297224a · 297224a
1 parent 75aa5e3
commit 297224a
Show file tree

Hide file tree

Showing 2 changed files with 18 additions and 11 deletions.
diff --git a/hdl-benchmarks b/hdl-benchmarks
diff --git a/src/circuit.rs b/src/circuit.rs
@@ -105,22 +105,29 @@ impl<'a> Circuit<'a> {
             wire_status.insert(input.clone());
         });
 
+        let mut dff_level = Vec::new();
         while !self.gates.is_empty() {
             // Temporary vector to store retained gates
             let mut level = Vec::new();
             let mut next_wire_status = HashSet::new();
-
+            let mut ready = false;
             self.gates.retain(|gate| {
-                let ready = gate
-                    .get_input_wires()
-                    .iter()
-                    .all(|wire| wire_status.contains(wire));
-
-                if ready {
+                if gate.get_gate_type() == GateType::Dff {
                     next_wire_status.insert(gate.get_output_wire());
-                    level.push(gate.clone());
+                    dff_level.push(gate.clone());
+                    ready = true;
+                }
+                else {
+                    ready = gate
+                        .get_input_wires()
+                        .iter()
+                        .all(|wire| wire_status.contains(wire));
+
+                    if ready {
+                        next_wire_status.insert(gate.get_output_wire());
+                        level.push(gate.clone());
+                    }
                 }
-
                 !ready
             });
 
@@ -130,7 +137,7 @@ impl<'a> Circuit<'a> {
             level.sort();
             self.ordered_gates.extend(level);
         }
-
+        self.ordered_gates.extend(dff_level);
         // Remove all the gates after sorting is done. Use ordered_gates from
         // now on.
         self.gates.clear();