add topological sort

paddle/fluid/lite/core/mir/generate_program_pass.cc

@@ -18,7 +18,16 @@
 namespace paddle {
 namespace lite {
 namespace mir {
-void GenerateProgramPass::Apply(std::unique_ptr<mir::SSAGraph> &graph) {}
+
+void GenerateProgramPass::Apply(std::unique_ptr<mir::SSAGraph>& graph) {
+  for (auto& item : graph->TopoloticalOrder()) {
+    if (item->IsInstruct()) {
+      auto& instruct = item->AsInstruct();
+      kernels_.emplace_back(std::move(instruct.valid_kernels.front()));
+    }
+  }
+}
+
 }  // namespace mir
 }  // namespace lite
 }  // namespace paddle

paddle/fluid/lite/core/mir/generate_program_pass.h

@@ -14,6 +14,8 @@
 
 #pragma once
 
+#include <list>
+#include "paddle/fluid/lite/core/kernel.h"
 #include "paddle/fluid/lite/core/mir/pass.h"
 
 namespace paddle {
@@ -26,7 +28,12 @@ namespace mir {
  */
 class GenerateProgramPass : public ProgramPass {
  public:
-  void Apply(std::unique_ptr<mir::SSAGraph> &graph) override;
+  void Apply(std::unique_ptr<mir::SSAGraph>& graph) override;
+
+  std::list<std::unique_ptr<KernelBase>>& kernels() { return kernels_; }
+
+ private:
+  std::list<std::unique_ptr<KernelBase>> kernels_;
 };
 
 }  // namespace mir

paddle/fluid/lite/core/mir/ssa_graph.cc

@@ -13,3 +13,9 @@
 // limitations under the License.
 
 #include "paddle/fluid/lite/core/mir/ssa_graph.h"
+
+namespace paddle {
+namespace lite {
+namespace mir {}  // namespace mir
+}  // namespace lite
+}  // namespace paddle

paddle/fluid/lite/core/mir/ssa_graph.h

@@ -16,6 +16,7 @@
 
 #include <list>
 #include <map>
+#include <stack>
 #include <string>
 #include <vector>
 #include "paddle/fluid/lite/core/mir/node.h"
@@ -81,7 +82,31 @@ class SSAGraph : GraphBase {
     }
   }
 
-  std::vector<mir::Node *> TopoloticalOrder() const;
+  void sort_utils(mir::Node *n, std::map<mir::Node *, bool> &visited,
+                  std::stack<mir::Node *> &stack) {
+    visited[n] = true;
+    for (auto &out : n->outlinks) {
+      if (!visited[out]) {
+        sort_utils(out, visited, stack);
+      }
+    }
+  }
+
+  std::vector<mir::Node *> TopoloticalOrder() {
+    std::map<mir::Node *, bool> visited;
+    std::stack<mir::Node *> stack;
+    std::vector<mir::Node *> res;
+
+    for (auto &n : mutable_nodes()) {
+      if (!visited[&n]) sort_utils(&n, visited, stack);
+    }
+
+    while (!stack.empty()) {
+      res.push_back(stack.top());
+      stack.pop();
+    }
+    return res;
+  }
 
   const std::list<mir::Node> &nodes() const { return node_storage_; }
   std::list<mir::Node> &mutable_nodes() { return node_storage_; }