From ae08a91472d1a02176fee1ab77f9ae7bf85d4d0b Mon Sep 17 00:00:00 2001
From: Yaman Umuroglu <maltanar@gmail.com>
Date: Tue, 18 Aug 2020 20:26:48 +0200
Subject: [PATCH] [Transform] handle 1-node graphs correctly in SortGraph
---
src/finn/transformation/general.py | 5 ++++-
1 file changed, 4 insertions(+), 1 deletion(-)
diff --git a/src/finn/transformation/general.py b/src/finn/transformation/general.py
index 4303eb17f..690364a7d 100644
--- a/src/finn/transformation/general.py
+++ b/src/finn/transformation/general.py
@@ -189,6 +189,9 @@ class SortGraph(Transformation):
# Probably this is faster than copying initializers and more robust in general
def apply(self, model):
+ if len(model.graph.node) == 1:
+ # single-node graph, nothing to sort
+ return (model, False)
# Gather graph structure
graph_dependencies = {}
node_list = [
@@ -214,7 +217,7 @@ class SortGraph(Transformation):
for new_idx, sorted_idx in enumerate(sorted_node_indexes):
model.graph.node.insert(new_idx, node_list[sorted_idx])
- return model, False
+ return (model, False)
class ConvertSubToAdd(Transformation):
--
GitLab