1 files changed, 102 insertions, 0 deletions
diff --git a/runtime/onert/core/src/ir/pass/ConstantInsertionPass.cc b/runtime/onert/core/src/ir/pass/ConstantInsertionPass.cc
new file mode 100644
index 000000000..5f4612d35
--- /dev/null
+++ b/runtime/onert/core/src/ir/pass/ConstantInsertionPass.cc
@@ -0,0 +1,102 @@
+/*
+ * Copyright (c) 2019 Samsung Electronics Co., Ltd. All Rights Reserved
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include "ConstantInsertionPass.h"
+
+#include "backend/Backend.h"
+#include <ir/Graph.h>
+#include <util/Utils.h>
+
+namespace onert
+{
+namespace ir
+{
+namespace pass
+{
+
+void ConstantInsertionPass::callback(const OperationIndex &node_index, Operation &node)
+{
+  const auto &op_sequence_index = _lowered_graph.op_seqs().getOperation(node_index);
+  const auto op_seq_lower_info = _lowered_graph.getLowerInfo(op_sequence_index);
+  const auto backend = op_seq_lower_info->backend();
+  const auto layout = op_seq_lower_info->layout();
+  const auto factor = operand::PermuteFactor{backend, layout};
+
+  for (const auto input : node.getInputs())
+  {
+    auto &object = _graph.operands().at(input);
+
+    if (object.isConstant())
+    {
+      const auto key = ReplaceKey{input, factor};
+      if (_replace_operands_map.count(key) == 0)
+      {
+        auto new_object = object;
+        // TODO Remove const_case
+        const_cast<std::list<OperationIndex> &>(new_object.getDef().list()).clear();
+        const_cast<std::list<OperationIndex> &>(new_object.getUses().list()).clear();
+        const auto new_index = _graph.operands().emplace(new_object);
+        _replace_operands_map[key] = new_index;
+
+        _lowered_graph.setLowerInfo(new_index, std::make_unique<operand::LowerInfo>());
+        _lowered_graph.getLowerInfo(new_index)->addDefPermuteFactor(factor);
+      }
+
+      const auto replaced_input = _replace_operands_map[key];
+      // Update op_seq
+      if (_lowered_graph.op_seqs().at(op_sequence_index).getInputs().contains(input))
+      {
+        _lowered_graph.op_seqs().at(op_sequence_index).replaceInput(input, replaced_input);
+      }
+
+      // Update node
+      node.replaceInput(input, replaced_input);
+
+      // Update operand
+      auto &replaced_object = _graph.operands().at(replaced_input);
+      replaced_object.appendUse(node_index);
+
+      // Update lower_info
+      auto replaced_lower_info = _lowered_graph.getLowerInfo(replaced_input);
+      replaced_lower_info->addUsePermuteFactor(factor);
+
+      // Remove this node from def and uses of origin operand
+      if (object.getDef().contains(node_index))
+      {
+        object.removeDef(node_index);
+      }
+      object.removeUse(node_index);
+
+      // Remove origin operand
+      if (object.getDef().size() == 0 && object.getUses().size() == 0)
+      {
+        _graph.removeOperand(input);
+        _lowered_graph.removeLowerInfo(input);
+      }
+    }
+  }
+
+  // Now this runtime does not support the node making output as constant
+  for (const auto &output : node.getOutputs())
+  {
+    UNUSED_RELEASE(output);
+    assert(!_graph.operands().at(output).isConstant());
+  }
+}
+
+} // namespace pass
+} // namespace ir
+} // namespace onert