FastDeploy/third_party/optimizer/onnxoptimizer/passes/eliminate_unused_initializer.h

/*
 * SPDX-License-Identifier: Apache-2.0
 */

// ATTENTION: The code in this file is highly EXPERIMENTAL.
// Adventurous users should note that the APIs will probably change.

#pragma once

// Before:
//   A, B, C are in the initializer list
//   D = Add(B, C)
// After:
//   B, C are in the initializer list and A is removed
//   D = Add(B, C)
//
// this pass can handle the case satisfy all following conditions:
//   condition 1: A is not used as any node's input
//   condition 2: A is not an output

#include "onnxoptimizer/pass.h"

namespace ONNX_NAMESPACE {
namespace optimization {

struct EliminateUnusedInitializer final : public FullGraphBasedPass {
  explicit EliminateUnusedInitializer()
      : FullGraphBasedPass(PassType::Nop, PassEfficiency::Complete,
                           PassOptimizationType::Memory) {}

  std::string getPassName() const override {
    return "eliminate_unused_initializer";
  }

  PassAnalysisType getPassAnalysisType() const override {
    return PassAnalysisType::Empty;
  }

  void erase_used_initializers(
      Graph& g, std::unordered_set<std::string>* initializer_names) {
    for (auto output : g.outputs()) {
      initializer_names->erase(output->uniqueName());
    }
    for (auto it = g.begin(); it != g.end(); ++it) {
      auto* n = *it;
      DescendOnGraphAttributesUnconstrained(
          n, [this, initializer_names](Graph& graph) {
            erase_used_initializers(graph, initializer_names);
          });
      for (auto* input : n->inputs()) {
        initializer_names->erase(input->uniqueName());
      }
    }
  }

  void eliminate_unused_initializer(Graph& graph) {
    std::unordered_set<std::string> initializer_names(
        graph.initializer_names().begin(), graph.initializer_names().end());
    erase_used_initializers(graph, &initializer_names);

    // remove initializer and input if need
    for (std::string name : initializer_names) {
      graph.eraseInitializer(name);
      auto iter = std::find_if(
          graph.inputs().begin(), graph.inputs().end(),
          [&name](Value* input) { return input->uniqueName() == name; });
      if (iter != graph.inputs().end()) {
        graph.eraseInput(std::distance(graph.inputs().begin(), iter));
      }
    }
  }

  std::shared_ptr<PostPassAnalysis> runPass(Graph& graph) override {
    eliminate_unused_initializer(graph);
    return std::shared_ptr<PostPassAnalysis>(new PostPassAnalysis());
  }
};

}  // namespace optimization
}  // namespace ONNX_NAMESPACE