X-Git-Url: https://scm.cri.ensmp.fr/git/Faustine.git/blobdiff_plain/1059e1cc0c2ecfa237406949aa26155b6a5b9154..66f23d4fabf89ad09adbd4dfc15ac6b5b2b7da83:/interpreter/preprocessor/faust-0.9.47mr3/compiler/parallelize/graphSorting.hh

diff --git a/interpreter/preprocessor/faust-0.9.47mr3/compiler/parallelize/graphSorting.hh b/interpreter/preprocessor/faust-0.9.47mr3/compiler/parallelize/graphSorting.hh
new file mode 100644
index 0000000..5a4daa7
--- /dev/null
+++ b/interpreter/preprocessor/faust-0.9.47mr3/compiler/parallelize/graphSorting.hh
@@ -0,0 +1,21 @@
+#ifndef __GRAPHSORTING__
+#define __GRAPHSORTING__
+
+
+#include <set>
+#include "loop.hh"
+
+ 
+
+typedef set<Loop*>      lset;
+typedef vector<Loop*>   lvec;
+typedef vector<lset>    lgraph;    
+
+/**
+ * Topological sort of an acyclic graph of loops starting 
+ * from its root. The loops are collect in an lgraph : a 
+ * vector of sets of loops
+ */
+void sortGraph(Loop* root,lgraph& V);
+
+#endif