/* Copyright 2021 The TensorFlow Authors. 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.
==============================================================================*/

#ifndef TENSORFLOW_CORE_TRANSFORMS_TOPOSORT_PASS_H_
#define TENSORFLOW_CORE_TRANSFORMS_TOPOSORT_PASS_H_

#include <memory>

#include "mlir/Pass/Pass.h"  // from @llvm-project
#include "tensorflow/core/ir/dialect.h"

namespace mlir {
namespace tfg {

// Sort topologically (following SSA defs-uses edges) the given block.
// The sort is stable. Optionally accepts an instance of the TFG dialect for
// virtually breaking NextIteration -> Merge cycles.
void SortTopologically(Block *block, TFGraphDialect *dialect = nullptr);

// Programmatically create a pass that topologically sort graphs.
std::unique_ptr<Pass> CreateTopoSortPass();

}  // namespace tfg
}  // namespace mlir

#endif  // TENSORFLOW_CORE_TRANSFORMS_TOPOSORT_PASS_H_
