CoreToFSM.cpp

Go to the documentation of this file.

//===CoreToFSM.cpp - Convert Core Dialects (HW + Seq + Comb) to FSM Dialect===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
 
#include "circt/Conversion/CoreToFSM.h"
#include "circt/Dialect/Comb/CombDialect.h"
#include "circt/Dialect/Comb/CombOps.h"
#include "circt/Dialect/FSM/FSMOps.h"
#include "circt/Dialect/HW/HWOps.h"
#include "circt/Dialect/Seq/SeqOps.h"
#include "circt/Dialect/Seq/SeqTypes.h"
#include "circt/Support/BackedgeBuilder.h"
#include "circt/Support/LLVM.h"
#include "mlir/Analysis/TopologicalSortUtils.h"
#include "mlir/IR/Block.h"
#include "mlir/IR/Builders.h"
#include "mlir/IR/BuiltinAttributes.h"
#include "mlir/IR/Diagnostics.h"
#include "mlir/IR/IRMapping.h"
#include "mlir/IR/MLIRContext.h"
#include "mlir/IR/Value.h"
#include "mlir/Pass/Pass.h"
#include "mlir/Pass/PassManager.h"
#include "mlir/Transforms/DialectConversion.h"
#include "mlir/Transforms/GreedyPatternRewriteDriver.h"
#include "mlir/Transforms/Passes.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/DenseSet.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/Support/Casting.h"
#include "llvm/Support/LogicalResult.h"
#include <string>
 
namespace circt {
#define GEN_PASS_DEF_CONVERTCORETOFSM
#include "circt/Conversion/Passes.h.inc"
} // namespace circt
 
using namespace mlir;
using namespace circt;
using namespace hw;
using namespace comb;
using namespace fsm;
 
namespace {
 
// Forward declaration for our helper function
static void generateConcatenatedValues(
    const llvm::SmallVector<llvm::SetVector<size_t>> &allOperandValues,
    const llvm::SmallVector<unsigned> &shifts,
    llvm::SetVector<size_t> &finalPossibleValues);
 
/// Internal helper with visited set to detect cycles.
static void addPossibleValuesImpl(llvm::SetVector<size_t> &possibleValues,
                                  Value v, llvm::DenseSet<Value> &visited) {
  // Detect cycles - if we've seen this value before, skip it.
  if (!visited.insert(v).second)
    return;
 
  if (auto c = dyn_cast_or_null<hw::ConstantOp>(v.getDefiningOp())) {
    possibleValues.insert(c.getValueAttr().getValue().getZExtValue());
    return;
  }
  if (auto m = dyn_cast_or_null<MuxOp>(v.getDefiningOp())) {
    addPossibleValuesImpl(possibleValues, m.getTrueValue(), visited);
    addPossibleValuesImpl(possibleValues, m.getFalseValue(), visited);
    return;
  }
 
  if (auto concatOp = dyn_cast_or_null<ConcatOp>(v.getDefiningOp())) {
    llvm::SmallVector<llvm::SetVector<size_t>> allOperandValues;
    llvm::SmallVector<unsigned> operandWidths;
 
    for (Value operand : concatOp.getOperands()) {
      llvm::SetVector<size_t> operandPossibleValues;
      addPossibleValuesImpl(operandPossibleValues, operand, visited);
 
      // It's crucial to handle the case where a sub-computation is too complex.
      // If we can't determine specific values for an operand, we must
      // pessimistically assume it can be any value its bitwidth allows.
      auto opType = dyn_cast<IntegerType>(operand.getType());
      // comb.concat only accepts signless integer operands by definition in
      // CIRCT's type system, so this assertion should always hold for valid IR.
      assert(opType && "comb.concat operand must be an integer type");
      unsigned width = opType.getWidth();
      if (operandPossibleValues.empty()) {
        uint64_t numStates = 1ULL << width;
        // Add a threshold to prevent combinatorial explosion on large unknown
        // inputs.
        if (numStates > 256) { // Heuristic threshold
          // If the search space is too large, we abandon the analysis for this
          // path. The outer function will fall back to its own full-range
          // default.
          v.getDefiningOp()->emitWarning()
              << "Search space too large (>" << 256
              << " states) for operand with bitwidth " << width
              << "; abandoning analysis for this path";
          return;
        }
        for (uint64_t i = 0; i < numStates; ++i)
          operandPossibleValues.insert(i);
      }
 
      allOperandValues.push_back(operandPossibleValues);
      operandWidths.push_back(width);
    }
 
    // The shift for operand `i` is the sum of the widths of operands `i+1` to
    // `n-1`.
    llvm::SmallVector<unsigned> shifts(concatOp.getNumOperands(), 0);
    for (int i = concatOp.getNumOperands() - 2; i >= 0; --i) {
      shifts[i] = shifts[i + 1] + operandWidths[i + 1];
    }
 
    generateConcatenatedValues(allOperandValues, shifts, possibleValues);
    return;
  }
 
  // --- Fallback Case ---
  // If the operation is not recognized, assume all possible values for its
  // bitwidth.
 
  auto addrType = dyn_cast<IntegerType>(v.getType());
  if (!addrType)
    return; // Not an integer type we can analyze
 
  unsigned bitWidth = addrType.getWidth();
  // Again, use a threshold to avoid trying to enumerate 2^64 values.
  if (bitWidth > 16) {
    if (v.getDefiningOp())
      v.getDefiningOp()->emitWarning()
          << "Bitwidth " << bitWidth
          << " too large (>16); abandoning analysis for this path";
    return;
  }
 
  uint64_t numRegStates = 1ULL << bitWidth;
  for (size_t i = 0; i < numRegStates; i++) {
    possibleValues.insert(i);
  }
}
 
static void addPossibleValues(llvm::SetVector<size_t> &possibleValues,
                              Value v) {
  llvm::DenseSet<Value> visited;
  addPossibleValuesImpl(possibleValues, v, visited);
}
 
/// Checks if two values compute the same function structurally.
/// Values defined outside their respective regions (e.g., machine block
/// arguments or fsm.variable results) are compared by SSA identity.
/// Values defined by operations within their regions are compared using
/// MLIR's OperationEquivalence with a custom equivalence callback.
static bool areStructurallyEquivalent(Value a, Value b, Region &regionA,
                                      Region &regionB) {
  if (a == b)
    return true;
 
  Operation *opA = a.getDefiningOp();
  Operation *opB = b.getDefiningOp();
  if (!opA || !opB)
    return false;
 
  bool aIsLocal = regionA.isAncestor(opA->getParentRegion());
  bool bIsLocal = regionB.isAncestor(opB->getParentRegion());
  if (aIsLocal != bIsLocal)
    return false;
  if (!aIsLocal)
    return false;
 
  // Both local: compare result index and delegate structural comparison
  // to MLIR's OperationEquivalence.
  if (cast<OpResult>(a).getResultNumber() !=
      cast<OpResult>(b).getResultNumber())
    return false;
 
  return OperationEquivalence::isEquivalentTo(
      opA, opB,
      [&](Value lhs, Value rhs) -> LogicalResult {
        return success(areStructurallyEquivalent(lhs, rhs, regionA, regionB));
      },
      /*markEquivalent=*/nullptr, OperationEquivalence::Flags::IgnoreLocations);
}
 
/// RewritePattern that folds expressions in an action region that are
/// structurally equivalent to guard conditions into boolean constants.
 
class GuardConditionFoldPattern : public RewritePattern {
public:
  GuardConditionFoldPattern(MLIRContext *ctx,
                            ArrayRef<std::pair<Value, bool>> guardFacts,
                            Region &guardRegion, Region &actionRegion)
      : RewritePattern(MatchAnyOpTypeTag(), /*benefit=*/10, ctx),
        guardFacts(guardFacts.begin(), guardFacts.end()),
        guardRegion(guardRegion), actionRegion(actionRegion) {}
 
  LogicalResult matchAndRewrite(Operation *op,
                                PatternRewriter &rewriter) const override {
    if (!actionRegion.isAncestor(op->getParentRegion()))
      return failure();
 
    // Skip constants because replacing a constant with an identical constant
    // creates an infinite loop in the greedy rewriter.
    if (isa<hw::ConstantOp>(op))
      return failure();
 
    for (Value result : op->getResults()) {
      if (!result.getType().isInteger(1) || result.use_empty())
        continue;
 
      for (auto [guardExpr, isTrue] : guardFacts) {
        // Direct structural match.
        if (areStructurallyEquivalent(guardExpr, result, guardRegion,
                                      actionRegion))
          return replaceWithConstant(result, isTrue, op, rewriter);
 
        // ICmp predicate inversion: if the guard contains icmp P(X, Y),
        // find icmp !P(X, Y) in the action and replace with !isTrue.
        if (auto guardIcmp = guardExpr.getDefiningOp<ICmpOp>()) {
          if (auto actionIcmp = dyn_cast<ICmpOp>(op)) {
            if (actionIcmp.getPredicate() ==
                    ICmpOp::getNegatedPredicate(guardIcmp.getPredicate()) &&
                areStructurallyEquivalent(guardIcmp.getLhs(),
                                          actionIcmp.getLhs(), guardRegion,
                                          actionRegion) &&
                areStructurallyEquivalent(guardIcmp.getRhs(),
                                          actionIcmp.getRhs(), guardRegion,
                                          actionRegion))
              return replaceWithConstant(result, !isTrue, op, rewriter);
          }
        }
      }
    }
    return failure();
  }
 
private:
  LogicalResult replaceWithConstant(Value result, bool constVal, Operation *op,
                                    PatternRewriter &rewriter) const {
    rewriter.setInsertionPointToStart(&actionRegion.front());
    Value c = hw::ConstantOp::create(rewriter, op->getLoc(),
                                     rewriter.getI1Type(), constVal ? 1 : 0);
    rewriter.replaceAllUsesWith(result, c);
    if (op->use_empty())
      rewriter.eraseOp(op);
    return success();
  }
 
  SmallVector<std::pair<Value, bool>> guardFacts;
  Region &guardRegion;
  Region &actionRegion;
};
 
/// Simplify action blocks by propagating guard conditions.
/// When a transition is taken, its guard condition is known to be true.
/// This function finds expressions in the action region that are structurally
/// identical to the guard condition and replaces them with constant true.
/// It also handles NOT (xor with true) and AND decomposition to propagate
/// additional known values.
static void simplifyActionWithGuard(TransitionOp transition,
                                    OpBuilder &builder) {
  Region &guardRegion = transition.getGuard();
  Region &actionRegion = transition.getAction();
 
  if (guardRegion.empty() || actionRegion.empty())
    return;
 
  auto guardReturn =
      dyn_cast<fsm::ReturnOp>(guardRegion.front().getTerminator());
  if (!guardReturn)
    return;
 
  Location loc = guardReturn.getLoc();
  Value guardCondition = guardReturn.getOperand();
 
  // Collect (expression, isTrue) pairs to propagate into the action.
  SmallVector<std::pair<Value, bool>> guardFacts;
 
  // Use a worklist to decompose AND expressions.
  SmallVector<std::pair<Value, bool>> worklist;
  worklist.push_back({guardCondition, true});
 
  while (!worklist.empty()) {
    auto [cond, isTrue] = worklist.pop_back_val();
    guardFacts.push_back({cond, isTrue});
 
    // Decompose NOT: xor(E, true) means E has the opposite truth value.
    if (auto xorOp = cond.getDefiningOp<XorOp>()) {
      if (xorOp.isBinaryNot() &&
          guardRegion.isAncestor(xorOp->getParentRegion()))
        guardFacts.push_back({xorOp.getOperand(0), !isTrue});
    }
 
    // Decompose AND: if the AND is true, each operand is true.
    if (isTrue) {
      if (auto andOp = cond.getDefiningOp<AndOp>()) {
        if (guardRegion.isAncestor(andOp->getParentRegion())) {
          for (Value operand : andOp.getOperands())
            worklist.push_back({operand, true});
        }
      }
    }
  }
 
  // Replace external guard values (block args or ops outside guard region)
  // directly via replaceUsesWithIf.
  for (auto [guardExpr, isTrue] : guardFacts) {
    bool guardIsExternal =
        !guardExpr.getDefiningOp() ||
        !guardRegion.isAncestor(guardExpr.getDefiningOp()->getParentRegion());
    if (guardIsExternal) {
      builder.setInsertionPointToStart(&actionRegion.front());
      auto constOp = hw::ConstantOp::create(builder, loc, guardExpr.getType(),
                                            isTrue ? 1 : 0);
      guardExpr.replaceUsesWithIf(constOp.getResult(), [&](OpOperand &use) {
        if (!actionRegion.isAncestor(use.getOwner()->getParentRegion()))
          return false;
        // Never replace the variable operand of fsm.update because that is the
        // assignment target, not a value to be folded.
        if (auto updateOp = dyn_cast<UpdateOp>(use.getOwner()))
          if (use.getOperandNumber() == 0)
            return false;
        return true;
      });
    }
  }
 
  // Use pattern rewriter for internal guard expression folding.
  MLIRContext *ctx = transition.getContext();
  RewritePatternSet patterns(ctx);
  patterns.add<GuardConditionFoldPattern>(ctx, guardFacts, guardRegion,
                                          actionRegion);
  SmallVector<Operation *> actionOps;
  actionRegion.walk([&](Operation *op) { actionOps.push_back(op); });
  GreedyRewriteConfig config;
  config.setScope(&actionRegion);
  (void)applyOpPatternsGreedily(
      actionOps, FrozenRewritePatternSet(std::move(patterns)), config);
}
 
/// Checks if a value is a constant or a tree of muxes with constant leaves.
/// Uses an iterative approach with a visited set to handle cycles.
static bool isConstantOrConstantTree(Value value) {
  SmallVector<Value> worklist;
  llvm::DenseSet<Value> visited;
 
  worklist.push_back(value);
  while (!worklist.empty()) {
    Value current = worklist.pop_back_val();
 
    // Skip if already visited (handles cycles).
    if (!visited.insert(current).second)
      continue;
 
    Operation *definingOp = current.getDefiningOp();
    if (!definingOp)
      return false;
 
    if (isa<hw::ConstantOp>(definingOp))
      continue;
 
    if (auto muxOp = dyn_cast<MuxOp>(definingOp)) {
      worklist.push_back(muxOp.getTrueValue());
      worklist.push_back(muxOp.getFalseValue());
      continue;
    }
 
    // Not a constant or mux - not constant-like.
    return false;
  }
  return true;
}
 
/// Pushes an ICmp equality comparison through a mux operation.
/// This transforms `icmp eq (mux cond, x, y), b` into
/// `mux cond, (icmp eq x, b), (icmp eq y, b)`.
/// This simplification helps expose constant comparisons that can be folded
/// during FSM extraction, making transition guards easier to analyze.
LogicalResult pushIcmp(ICmpOp op, PatternRewriter &rewriter) {
  APInt lhs, rhs;
  if (op.getPredicate() == ICmpPredicate::eq &&
      op.getLhs().getDefiningOp<MuxOp>() &&
      (isConstantOrConstantTree(op.getLhs()) ||
       op.getRhs().getDefiningOp<hw::ConstantOp>())) {
    rewriter.setInsertionPointAfter(op);
    auto mux = op.getLhs().getDefiningOp<MuxOp>();
    Value x = mux.getTrueValue();
    Value y = mux.getFalseValue();
    Value b = op.getRhs();
    Location loc = op.getLoc();
    auto eq1 = ICmpOp::create(rewriter, loc, ICmpPredicate::eq, x, b);
    auto eq2 = ICmpOp::create(rewriter, loc, ICmpPredicate::eq, y, b);
    rewriter.replaceOpWithNewOp<MuxOp>(op, mux.getCond(), eq1.getResult(),
                                       eq2.getResult());
    return llvm::success();
  }
  if (op.getPredicate() == ICmpPredicate::eq &&
      op.getRhs().getDefiningOp<MuxOp>() &&
      (isConstantOrConstantTree(op.getRhs()) ||
       op.getLhs().getDefiningOp<hw::ConstantOp>())) {
    rewriter.setInsertionPointAfter(op);
    auto mux = op.getRhs().getDefiningOp<MuxOp>();
    Value x = mux.getTrueValue();
    Value y = mux.getFalseValue();
    Value b = op.getLhs();
    Location loc = op.getLoc();
    auto eq1 = ICmpOp::create(rewriter, loc, ICmpPredicate::eq, x, b);
    auto eq2 = ICmpOp::create(rewriter, loc, ICmpPredicate::eq, y, b);
    rewriter.replaceOpWithNewOp<MuxOp>(op, mux.getCond(), eq1.getResult(),
                                       eq2.getResult());
    return llvm::success();
  }
  return llvm::failure();
}
 
/// Iteratively builds all possible concatenated integer values from the
/// Cartesian product of value sets.
static void generateConcatenatedValues(
    const llvm::SmallVector<llvm::SetVector<size_t>> &allOperandValues,
    const llvm::SmallVector<unsigned> &shifts,
    llvm::SetVector<size_t> &finalPossibleValues) {
 
  if (allOperandValues.empty()) {
    finalPossibleValues.insert(0);
    return;
  }
 
  // Start with the values of the first operand, shifted appropriately.
  llvm::SetVector<size_t> currentResults;
  for (size_t val : allOperandValues[0])
    currentResults.insert(val << shifts[0]);
 
  // For each subsequent operand, combine with all existing partial results.
  for (size_t operandIdx = 1; operandIdx < allOperandValues.size();
       ++operandIdx) {
    llvm::SetVector<size_t> nextResults;
    unsigned shift = shifts[operandIdx];
 
    for (size_t partialValue : currentResults) {
      for (size_t val : allOperandValues[operandIdx]) {
        nextResults.insert(partialValue | (val << shift));
      }
    }
    currentResults = std::move(nextResults);
  }
 
  for (size_t val : currentResults)
    finalPossibleValues.insert(val);
}
 
static llvm::MapVector<Value, int> intToRegMap(SmallVector<seq::CompRegOp> v,
                                               int i) {
  llvm::MapVector<Value, int> m;
  for (size_t ci = 0; ci < v.size(); ci++) {
    seq::CompRegOp reg = v[ci];
    int bits = reg.getType().getIntOrFloatBitWidth();
    int v = i & ((1 << bits) - 1);
    m[reg] = v;
    i = i >> bits;
  }
  return m;
}
 
static int regMapToInt(SmallVector<seq::CompRegOp> v,
                       llvm::DenseMap<Value, int> m) {
  int i = 0;
  int width = 0;
  for (size_t ci = 0; ci < v.size(); ci++) {
    seq::CompRegOp reg = v[ci];
    i += m[reg] * 1ULL << width;
    width += (reg.getType().getIntOrFloatBitWidth());
  }
  return i;
}
 
/// Computes the Cartesian product of a list of sets.
static std::set<llvm::SmallVector<size_t>> calculateCartesianProduct(
    const llvm::SmallVector<llvm::SetVector<size_t>> &valueSets) {
  std::set<llvm::SmallVector<size_t>> product;
  if (valueSets.empty()) {
    // The Cartesian product of zero sets is a set containing one element:
    // the empty tuple (represented here by an empty vector).
    product.insert({});
    return product;
  }
 
  // Initialize the product with the elements of the first set, each in its
  // own vector.
  for (size_t value : valueSets.front()) {
    product.insert({value});
  }
 
  // Iteratively build the product. For each subsequent set, create a new
  // temporary product by appending each of its elements to every combination
  // already generated.
  for (size_t i = 1; i < valueSets.size(); ++i) {
    const auto &currentSet = valueSets[i];
    if (currentSet.empty()) {
      // The Cartesian product with an empty set results in an empty set.
      return {};
    }
 
    std::set<llvm::SmallVector<size_t>> newProduct;
    for (const auto &existingVector : product) {
      for (size_t newValue : currentSet) {
        llvm::SmallVector<size_t> newVector = existingVector;
        newVector.push_back(newValue);
        newProduct.insert(std::move(newVector));
      }
    }
    product = std::move(newProduct);
  }
 
  return product;
}
 
static FrozenRewritePatternSet loadPatterns(MLIRContext &context) {
 
  RewritePatternSet patterns(&context);
  for (auto *dialect : context.getLoadedDialects())
    dialect->getCanonicalizationPatterns(patterns);
  ICmpOp::getCanonicalizationPatterns(patterns, &context);
  AndOp::getCanonicalizationPatterns(patterns, &context);
  XorOp::getCanonicalizationPatterns(patterns, &context);
  MuxOp::getCanonicalizationPatterns(patterns, &context);
  ConcatOp::getCanonicalizationPatterns(patterns, &context);
  ExtractOp::getCanonicalizationPatterns(patterns, &context);
  AddOp::getCanonicalizationPatterns(patterns, &context);
  OrOp::getCanonicalizationPatterns(patterns, &context);
  MulOp::getCanonicalizationPatterns(patterns, &context);
  hw::ConstantOp::getCanonicalizationPatterns(patterns, &context);
  TransitionOp::getCanonicalizationPatterns(patterns, &context);
  StateOp::getCanonicalizationPatterns(patterns, &context);
  MachineOp::getCanonicalizationPatterns(patterns, &context);
  patterns.add(pushIcmp);
  FrozenRewritePatternSet frozenPatterns(std::move(patterns));
  return frozenPatterns;
}
 
static LogicalResult
getReachableStates(llvm::SetVector<size_t> &visitableStates,
                   HWModuleOp moduleOp, size_t currentStateIndex,
                   SmallVector<seq::CompRegOp> registers, OpBuilder opBuilder,
                   bool isInitialState) {
 
  IRMapping mapping;
  auto clonedBody =
      llvm::dyn_cast<HWModuleOp>(opBuilder.clone(*moduleOp, mapping));
 
  llvm::MapVector<Value, int> stateMap =
      intToRegMap(registers, currentStateIndex);
  Operation *terminator = clonedBody.getBody().front().getTerminator();
  auto output = dyn_cast<hw::OutputOp>(terminator);
  SmallVector<Value> values;
 
  for (auto [originalRegValue, constStateValue] : stateMap) {
 
    Value clonedRegValue = mapping.lookup(originalRegValue);
    Operation *clonedRegOp = clonedRegValue.getDefiningOp();
    auto reg = cast<seq::CompRegOp>(clonedRegOp);
    Type constantType = reg.getType();
    IntegerAttr constantAttr =
        opBuilder.getIntegerAttr(constantType, constStateValue);
    opBuilder.setInsertionPoint(clonedRegOp);
    auto otherStateConstant =
        hw::ConstantOp::create(opBuilder, reg.getLoc(), constantAttr);
    // If the register input is self-referential (input == output), use the
    // constant we're replacing it with. Otherwise, the value would become
    // dangling after we erase the register.
    Value regInput = reg.getInput();
    if (regInput == clonedRegValue)
      values.push_back(otherStateConstant.getResult());
    else
      values.push_back(regInput);
    clonedRegValue.replaceAllUsesWith(otherStateConstant.getResult());
    reg.erase();
  }
  opBuilder.setInsertionPointToEnd(clonedBody.front().getBlock());
  auto newOutput = hw::OutputOp::create(opBuilder, output.getLoc(), values);
  output.erase();
  FrozenRewritePatternSet frozenPatterns = loadPatterns(*moduleOp.getContext());
 
  SmallVector<Operation *> opsToProcess;
  clonedBody.walk([&](Operation *op) { opsToProcess.push_back(op); });
 
  bool changed = false;
  GreedyRewriteConfig config;
  if (failed(applyOpPatternsGreedily(opsToProcess, frozenPatterns, config,
                                     &changed)))
    return failure();
 
  llvm::SmallVector<llvm::SetVector<size_t>> pv;
  for (size_t j = 0; j < newOutput.getNumOperands(); j++) {
    llvm::SetVector<size_t> possibleValues;
 
    Value v = newOutput.getOperand(j);
    addPossibleValues(possibleValues, v);
    pv.push_back(possibleValues);
  }
  std::set<llvm::SmallVector<size_t>> flipped = calculateCartesianProduct(pv);
  for (llvm::SmallVector<size_t> v : flipped) {
    llvm::DenseMap<Value, int> m;
    for (size_t k = 0; k < v.size(); k++) {
      seq::CompRegOp r = registers[k];
      m[r] = v[k];
    }
 
    int i = regMapToInt(registers, m);
    visitableStates.insert(i);
  }
 
  clonedBody.erase();
  return success();
}
 
// A converter class to handle the logic of converting a single hw.module.
class HWModuleOpConverter {
public:
  HWModuleOpConverter(OpBuilder &builder, HWModuleOp moduleOp,
                      ArrayRef<std::string> stateRegNames)
      : moduleOp(moduleOp), opBuilder(builder), stateRegNames(stateRegNames) {}
  LogicalResult run() {
    SmallVector<seq::CompRegOp> stateRegs;
    SmallVector<seq::CompRegOp> variableRegs;
    Value foundClock, foundReset = nullptr;
    WalkResult walkResult = moduleOp.walk([&](seq::CompRegOp reg) {
      auto clk = reg.getClk();
      auto reset = reg.getReset();
      if (foundClock) {
        if (clk != foundClock) {
          reg.emitError("All registers must have the same clock signal.");
          return WalkResult::interrupt();
        }
      } else {
        foundClock = clk;
      }
 
      if (reset) {
        if (foundReset) {
          if (reset != foundReset) {
            reg.emitError("All registers must have the same reset signal.");
            return WalkResult::interrupt();
          }
        } else {
          foundReset = reset;
        }
      }
 
      // Check that the register type is an integer.
      if (!isa<IntegerType>(reg.getType())) {
        reg.emitError("FSM extraction only supports integer-typed registers");
        return WalkResult::interrupt();
      }
      if (isStateRegister(reg)) {
        stateRegs.push_back(reg);
      } else {
        variableRegs.push_back(reg);
      }
      return WalkResult::advance();
    });
    if (walkResult.wasInterrupted())
      return failure();
    if (stateRegs.empty()) {
      emitError(moduleOp.getLoc())
          << "Cannot find state register in this FSM. Use the state-regs "
             "option to specify which registers are state registers.";
      return failure();
    }
    SmallVector<seq::CompRegOp> registers;
    for (seq::CompRegOp c : stateRegs) {
      registers.push_back(c);
    }
 
    llvm::DenseMap<size_t, StateOp> stateToStateOp;
    llvm::DenseMap<StateOp, size_t> stateOpToState;
    // Collect reset arguments to exclude from the FSM's function type.
    // All CompReg reset signals are ignored during FSM extraction since the
    // FSM dialect does not have an explicit reset concept. The reset behavior
    // is only captured in the initial state value.
    llvm::DenseSet<size_t> asyncResetArguments;
    Location loc = moduleOp.getLoc();
    SmallVector<Type> inputTypes = moduleOp.getInputTypes();
 
    // Create a new FSM machine with the current state.
    auto resultTypes = moduleOp.getOutputTypes();
    FunctionType machineType =
        FunctionType::get(opBuilder.getContext(), inputTypes, resultTypes);
    StringRef machineName = moduleOp.getName();
 
    llvm::DenseMap<Value, int> initialStateMap;
    for (seq::CompRegOp reg : moduleOp.getOps<seq::CompRegOp>()) {
      Value resetValue = reg.getResetValue();
      hw::ConstantOp definingConstant;
      if (resetValue) {
        definingConstant = resetValue.getDefiningOp<hw::ConstantOp>();
      } else {
        // Assume that registers without a reset start at 0
        reg.emitWarning("Assuming register with no reset starts with value 0");
        definingConstant =
            hw::ConstantOp::create(opBuilder, reg.getLoc(), reg.getType(), 0);
      }
      if (!definingConstant) {
        reg->emitError(
            "cannot find defining constant for reset value of register");
        return failure();
      }
      int resetValueInt =
          definingConstant.getValueAttr().getValue().getZExtValue();
      initialStateMap[reg] = resetValueInt;
    }
    int initialStateIndex = regMapToInt(registers, initialStateMap);
 
    std::string initialStateName = "state_" + std::to_string(initialStateIndex);
 
    // Preserve argument and result names, which are stored as attributes.
    SmallVector<NamedAttribute> machineAttrs;
    if (auto argNames = moduleOp->getAttrOfType<ArrayAttr>("argNames"))
      machineAttrs.emplace_back(opBuilder.getStringAttr("argNames"), argNames);
    if (auto resNames = moduleOp->getAttrOfType<ArrayAttr>("resultNames"))
      machineAttrs.emplace_back(opBuilder.getStringAttr("resNames"), resNames);
 
    // The builder for fsm.MachineOp will create the body region and block
    // arguments.
    opBuilder.setInsertionPoint(moduleOp);
    auto machine =
        MachineOp::create(opBuilder, loc, machineName, initialStateName,
                          machineType, machineAttrs);
 
    OpBuilder::InsertionGuard guard(opBuilder);
    opBuilder.setInsertionPointToStart(&machine.getBody().front());
    llvm::MapVector<seq::CompRegOp, VariableOp> variableMap;
    for (seq::CompRegOp varReg : variableRegs) {
      TypedValue<Type> initialValue = varReg.getResetValue();
      hw::ConstantOp definingConstant;
      if (initialValue) {
        definingConstant = initialValue.getDefiningOp<hw::ConstantOp>();
      } else {
        // Assume that registers without a reset start at 0
        varReg.emitWarning(
            "Assuming register with no reset starts with value 0");
        definingConstant = hw::ConstantOp::create(opBuilder, varReg.getLoc(),
                                                  varReg.getType(), 0);
      }
      if (!definingConstant) {
        varReg->emitError("cannot find defining constant for reset value of "
                          "variable register");
        return failure();
      }
      auto variableOp = VariableOp::create(
          opBuilder, varReg->getLoc(), varReg.getInput().getType(),
          definingConstant.getValueAttr(), varReg.getName().value_or("var"));
      variableMap[varReg] = variableOp;
    }
 
    // Load rewrite patterns used for canonicalizing the generated FSM.
    FrozenRewritePatternSet frozenPatterns =
        loadPatterns(*moduleOp.getContext());
 
    SetVector<int> reachableStates;
    SmallVector<int> worklist;
 
    worklist.push_back(initialStateIndex);
    reachableStates.insert(initialStateIndex);
    // Process states in BFS order. The worklist grows as new reachable states
    // are discovered, so we use an index-based loop.
    for (unsigned i = 0; i < worklist.size(); ++i) {
 
      int currentStateIndex = worklist[i];
 
      llvm::MapVector<Value, int> stateMap =
          intToRegMap(registers, currentStateIndex);
 
      opBuilder.setInsertionPointToEnd(&machine.getBody().front());
 
      StateOp stateOp;
 
      if (!stateToStateOp.contains(currentStateIndex)) {
        stateOp = StateOp::create(opBuilder, loc,
                                  "state_" + std::to_string(currentStateIndex));
        stateToStateOp.insert({currentStateIndex, stateOp});
        stateOpToState.insert({stateOp, currentStateIndex});
      } else {
        stateOp = stateToStateOp.lookup(currentStateIndex);
      }
      Region &outputRegion = stateOp.getOutput();
      Block *outputBlock = &outputRegion.front();
      opBuilder.setInsertionPointToStart(outputBlock);
      IRMapping mapping;
      opBuilder.cloneRegionBefore(moduleOp.getModuleBody(), outputRegion,
                                  outputBlock->getIterator(), mapping);
      outputBlock->erase();
 
      auto *terminator = outputRegion.front().getTerminator();
      auto hwOutputOp = dyn_cast<hw::OutputOp>(terminator);
      assert(hwOutputOp && "Expected terminator to be hw.output op");
 
      // Position the builder to insert the new terminator right before the
      // old one.
      OpBuilder::InsertionGuard stateGuard(opBuilder);
      opBuilder.setInsertionPoint(hwOutputOp);
 
      // Create the new fsm.OutputOp with the same operands.
 
      fsm::OutputOp::create(opBuilder, hwOutputOp.getLoc(),
                            hwOutputOp.getOperands());
 
      // Erase the old terminator.
      hwOutputOp.erase();
 
      // Iterate through the state configuration to replace registers
      // with constants.
      for (auto &[originalRegValue, variableOp] : variableMap) {
        Value clonedRegValue = mapping.lookup(originalRegValue);
        Operation *clonedRegOp = clonedRegValue.getDefiningOp();
        auto reg = cast<seq::CompRegOp>(clonedRegOp);
        const auto res = variableOp.getResult();
        clonedRegValue.replaceAllUsesWith(res);
        reg.erase();
      }
      for (auto const &[originalRegValue, constStateValue] : stateMap) {
        //  Find the cloned register's result value using the mapping.
        Value clonedRegValue = mapping.lookup(originalRegValue);
        assert(clonedRegValue &&
               "Original register value not found in mapping");
        Operation *clonedRegOp = clonedRegValue.getDefiningOp();
 
        assert(clonedRegOp && "Cloned value must have a defining op");
        opBuilder.setInsertionPoint(clonedRegOp);
        auto r = cast<seq::CompRegOp>(clonedRegOp);
        TypedValue<IntegerType> registerReset = r.getReset();
        if (registerReset) {
          if (BlockArgument blockArg = dyn_cast<BlockArgument>(registerReset)) {
            asyncResetArguments.insert(blockArg.getArgNumber());
            auto falseConst = hw::ConstantOp::create(
                opBuilder, blockArg.getLoc(), clonedRegValue.getType(), 0);
            blockArg.replaceAllUsesWith(falseConst.getResult());
          }
          if (auto xorOp = registerReset.getDefiningOp<XorOp>()) {
            if (xorOp.isBinaryNot()) {
              Value rhs = xorOp.getOperand(0);
              if (BlockArgument blockArg = dyn_cast<BlockArgument>(rhs)) {
                asyncResetArguments.insert(blockArg.getArgNumber());
                auto trueConst = hw::ConstantOp::create(
                    opBuilder, blockArg.getLoc(), blockArg.getType(), 1);
                blockArg.replaceAllUsesWith(trueConst.getResult());
              }
            }
          }
        }
        auto constantOp =
            hw::ConstantOp::create(opBuilder, clonedRegValue.getLoc(),
                                   clonedRegValue.getType(), constStateValue);
        clonedRegValue.replaceAllUsesWith(constantOp.getResult());
        clonedRegOp->erase();
      }
      GreedyRewriteConfig config;
      SmallVector<Operation *> opsToProcess;
      outputRegion.walk([&](Operation *op) { opsToProcess.push_back(op); });
      // Replace references to arguments in the output block with
      // arguments at the top level.
      for (auto arg : outputRegion.front().getArguments()) {
        int argIndex = arg.getArgNumber();
        BlockArgument topLevelArg = machine.getBody().getArgument(argIndex);
        arg.replaceAllUsesWith(topLevelArg);
      }
      outputRegion.front().eraseArguments(
          [](BlockArgument arg) { return true; });
      FrozenRewritePatternSet patterns(opBuilder.getContext());
      config.setScope(&outputRegion);
 
      bool changed = false;
      if (failed(applyOpPatternsGreedily(opsToProcess, patterns, config,
                                         &changed)))
        return failure();
      opBuilder.setInsertionPoint(stateOp);
      // hw.module uses graph regions that allow cycles (e.g., registers feeding
      // back into themselves). By this point we've replaced all registers with
      // constants, but cycles in purely combinational logic (e.g., cyclic
      // muxes) may still exist. Such cycles cannot be converted to FSM.
      bool sorted = sortTopologically(&outputRegion.front());
      if (!sorted) {
        moduleOp.emitError()
            << "cannot convert module with combinational cycles to FSM";
        return failure();
      }
      Region &transitionRegion = stateOp.getTransitions();
      llvm::SetVector<size_t> visitableStates;
      if (failed(getReachableStates(visitableStates, moduleOp,
                                    currentStateIndex, registers, opBuilder,
                                    currentStateIndex == initialStateIndex)))
        return failure();
      for (size_t j : visitableStates) {
        StateOp toState;
        if (!stateToStateOp.contains(j)) {
          opBuilder.setInsertionPointToEnd(&machine.getBody().front());
          toState =
              StateOp::create(opBuilder, loc, "state_" + std::to_string(j));
          stateToStateOp.insert({j, toState});
          stateOpToState.insert({toState, j});
        } else {
          toState = stateToStateOp[j];
        }
        opBuilder.setInsertionPointToStart(&transitionRegion.front());
        auto transitionOp =
            TransitionOp::create(opBuilder, loc, "state_" + std::to_string(j));
        Region &guardRegion = transitionOp.getGuard();
        opBuilder.createBlock(&guardRegion);
 
        Block &guardBlock = guardRegion.front();
 
        opBuilder.setInsertionPointToStart(&guardBlock);
        IRMapping mapping;
        opBuilder.cloneRegionBefore(moduleOp.getModuleBody(), guardRegion,
                                    guardBlock.getIterator(), mapping);
        guardBlock.erase();
        Block &newGuardBlock = guardRegion.front();
        Operation *terminator = newGuardBlock.getTerminator();
        auto hwOutputOp = dyn_cast<hw::OutputOp>(terminator);
        assert(hwOutputOp && "Expected terminator to be hw.output op");
 
        llvm::MapVector<Value, int> toStateMap = intToRegMap(registers, j);
        SmallVector<Value> equalityChecks;
        for (auto &[originalRegValue, variableOp] : variableMap) {
          opBuilder.setInsertionPointToStart(&newGuardBlock);
          Value clonedRegValue = mapping.lookup(originalRegValue);
          Operation *clonedRegOp = clonedRegValue.getDefiningOp();
          auto reg = cast<seq::CompRegOp>(clonedRegOp);
          const auto res = variableOp.getResult();
          clonedRegValue.replaceAllUsesWith(res);
          reg.erase();
        }
        for (auto const &[originalRegValue, constStateValue] : toStateMap) {
 
          Value clonedRegValue = mapping.lookup(originalRegValue);
          Operation *clonedRegOp = clonedRegValue.getDefiningOp();
          opBuilder.setInsertionPoint(clonedRegOp);
          auto r = cast<seq::CompRegOp>(clonedRegOp);
 
          Value registerInput = r.getInput();
          TypedValue<IntegerType> registerReset = r.getReset();
          if (registerReset) {
            if (BlockArgument blockArg =
                    dyn_cast<BlockArgument>(registerReset)) {
              auto falseConst = hw::ConstantOp::create(
                  opBuilder, blockArg.getLoc(), clonedRegValue.getType(), 0);
              blockArg.replaceAllUsesWith(falseConst.getResult());
            }
            if (auto xorOp = registerReset.getDefiningOp<XorOp>()) {
              if (xorOp.isBinaryNot()) {
                Value rhs = xorOp.getOperand(0);
                if (BlockArgument blockArg = dyn_cast<BlockArgument>(rhs)) {
                  auto trueConst = hw::ConstantOp::create(
                      opBuilder, blockArg.getLoc(), blockArg.getType(), 1);
                  blockArg.replaceAllUsesWith(trueConst.getResult());
                }
              }
            }
          }
          Type constantType = registerInput.getType();
          IntegerAttr constantAttr =
              opBuilder.getIntegerAttr(constantType, constStateValue);
          auto otherStateConstant = hw::ConstantOp::create(
              opBuilder, hwOutputOp.getLoc(), constantAttr);
 
          auto doesEqual =
              ICmpOp::create(opBuilder, hwOutputOp.getLoc(), ICmpPredicate::eq,
                             registerInput, otherStateConstant.getResult());
          equalityChecks.push_back(doesEqual.getResult());
        }
        opBuilder.setInsertionPoint(hwOutputOp);
        auto allEqualCheck = AndOp::create(opBuilder, hwOutputOp.getLoc(),
                                           equalityChecks, false);
        fsm::ReturnOp::create(opBuilder, hwOutputOp.getLoc(),
                              allEqualCheck.getResult());
        hwOutputOp.erase();
        for (BlockArgument arg : newGuardBlock.getArguments()) {
          int argIndex = arg.getArgNumber();
          BlockArgument topLevelArg = machine.getBody().getArgument(argIndex);
          arg.replaceAllUsesWith(topLevelArg);
        }
        newGuardBlock.eraseArguments([](BlockArgument arg) { return true; });
        llvm::MapVector<Value, int> fromStateMap =
            intToRegMap(registers, currentStateIndex);
        for (auto const &[originalRegValue, constStateValue] : fromStateMap) {
          Value clonedRegValue = mapping.lookup(originalRegValue);
          assert(clonedRegValue &&
                 "Original register value not found in mapping");
          Operation *clonedRegOp = clonedRegValue.getDefiningOp();
          assert(clonedRegOp && "Cloned value must have a defining op");
          opBuilder.setInsertionPoint(clonedRegOp);
          auto constantOp =
              hw::ConstantOp::create(opBuilder, clonedRegValue.getLoc(),
                                     clonedRegValue.getType(), constStateValue);
          clonedRegValue.replaceAllUsesWith(constantOp.getResult());
          clonedRegOp->erase();
        }
        Region &actionRegion = transitionOp.getAction();
        if (!variableRegs.empty()) {
          Block *actionBlock = opBuilder.createBlock(&actionRegion);
          opBuilder.setInsertionPointToStart(actionBlock);
          IRMapping mapping;
          opBuilder.cloneRegionBefore(moduleOp.getModuleBody(), actionRegion,
                                      actionBlock->getIterator(), mapping);
          actionBlock->erase();
          Block &newActionBlock = actionRegion.front();
          for (BlockArgument arg : newActionBlock.getArguments()) {
            int argIndex = arg.getArgNumber();
            BlockArgument topLevelArg = machine.getBody().getArgument(argIndex);
            arg.replaceAllUsesWith(topLevelArg);
          }
          newActionBlock.eraseArguments([](BlockArgument arg) { return true; });
          for (auto &[originalRegValue, variableOp] : variableMap) {
            Value clonedRegValue = mapping.lookup(originalRegValue);
            Operation *clonedRegOp = clonedRegValue.getDefiningOp();
            auto reg = cast<seq::CompRegOp>(clonedRegOp);
            opBuilder.setInsertionPointToStart(&newActionBlock);
            UpdateOp::create(opBuilder, reg.getLoc(), variableOp,
                             reg.getInput());
            const Value res = variableOp.getResult();
            clonedRegValue.replaceAllUsesWith(res);
            reg.erase();
          }
          Operation *terminator = actionRegion.back().getTerminator();
          auto hwOutputOp = dyn_cast<hw::OutputOp>(terminator);
          assert(hwOutputOp && "Expected terminator to be hw.output op");
          hwOutputOp.erase();
 
          for (auto const &[originalRegValue, constStateValue] : fromStateMap) {
            Value clonedRegValue = mapping.lookup(originalRegValue);
            Operation *clonedRegOp = clonedRegValue.getDefiningOp();
            opBuilder.setInsertionPoint(clonedRegOp);
            auto constantOp = hw::ConstantOp::create(
                opBuilder, clonedRegValue.getLoc(), clonedRegValue.getType(),
                constStateValue);
            clonedRegValue.replaceAllUsesWith(constantOp.getResult());
            clonedRegOp->erase();
          }
 
          GreedyRewriteConfig config;
          SmallVector<Operation *> opsToProcess;
          actionRegion.walk([&](Operation *op) { opsToProcess.push_back(op); });
          config.setScope(&actionRegion);
 
          bool changed = false;
          if (failed(applyOpPatternsGreedily(opsToProcess, frozenPatterns,
                                             config, &changed)))
            return failure();
 
          // hw.module uses graph regions that allow cycles. By this point
          // we've replaced all registers with constants, but cycles in purely
          // combinational logic may still exist.
          bool actionSorted = sortTopologically(&actionRegion.front());
          if (!actionSorted) {
            moduleOp.emitError()
                << "cannot convert module with combinational cycles to FSM";
            return failure();
          }
        }
 
        // hw.module uses graph regions that allow cycles. By this point
        // we've replaced all registers with constants, but cycles in purely
        // combinational logic may still exist.
        bool guardSorted = sortTopologically(&newGuardBlock);
        if (!guardSorted) {
          moduleOp.emitError()
              << "cannot convert module with combinational cycles to FSM";
          return failure();
        }
        SmallVector<Operation *> outputOps;
        stateOp.getOutput().walk(
            [&](Operation *op) { outputOps.push_back(op); });
 
        bool changed = false;
        GreedyRewriteConfig config;
        config.setScope(&stateOp.getOutput());
        LogicalResult converged = applyOpPatternsGreedily(
            outputOps, frozenPatterns, config, &changed);
        assert(succeeded(converged) && "canonicalization failed to converge");
        SmallVector<Operation *> transitionOps;
        stateOp.getTransitions().walk(
            [&](Operation *op) { transitionOps.push_back(op); });
 
        GreedyRewriteConfig config2;
        config2.setScope(&stateOp.getTransitions());
        if (failed(applyOpPatternsGreedily(transitionOps, frozenPatterns,
                                           config2, &changed))) {
          return failure();
        }
 
        // Propagate guard conditions into action blocks to eliminate
        // redundant muxes. The guard already checks the transition
        // condition, so the action block can assume it holds.
        for (TransitionOp transition :
             stateOp.getTransitions().getOps<TransitionOp>())
          simplifyActionWithGuard(transition, opBuilder);
 
        // Re-canonicalize after guard propagation to clean up dead ops.
        {
          SmallVector<Operation *> postOps;
          stateOp.getTransitions().walk(
              [&](Operation *op) { postOps.push_back(op); });
          GreedyRewriteConfig postConfig;
          postConfig.setScope(&stateOp.getTransitions());
          if (failed(applyOpPatternsGreedily(postOps, frozenPatterns,
                                             postConfig, &changed)))
            return failure();
        }
 
        for (TransitionOp transition :
             stateOp.getTransitions().getOps<TransitionOp>()) {
          StateOp nextState = transition.getNextStateOp();
          int nextStateIndex = stateOpToState.lookup(nextState);
          auto guardConst = transition.getGuardReturn()
                                .getOperand()
                                .getDefiningOp<hw::ConstantOp>();
          bool nextStateIsReachable =
              !guardConst || (guardConst.getValueAttr().getInt() != 0);
          // If we find a valid next state and haven't seen it before, add it to
          // the worklist and the set of reachable states.
          if (nextStateIsReachable &&
              !reachableStates.contains(nextStateIndex)) {
            worklist.push_back(nextStateIndex);
            reachableStates.insert(nextStateIndex);
          }
        }
      }
    }
 
    // Clean up unreachable states. States without an output region are
    // placeholder states that were created during reachability analysis but
    // never populated (i.e., they are unreachable from the initial state).
    SmallVector<StateOp> statesToErase;
 
    // Collect unreachable states (those without an output op).
    for (StateOp stateOp : machine.getOps<StateOp>()) {
      if (!stateOp.getOutputOp()) {
        statesToErase.push_back(stateOp);
      }
    }
 
    // Erase states in a separate loop to avoid iterator invalidation. We first
    // collect all states to erase, then iterate over that list. This is
    // necessary because erasing a state while iterating over machine.getOps()
    // would invalidate the iterator.
    for (StateOp stateOp : statesToErase) {
      for (TransitionOp transition : machine.getOps<TransitionOp>()) {
        if (transition.getNextStateOp().getSymName() == stateOp.getSymName()) {
          transition.erase();
        }
      }
      stateOp.erase();
    }
 
    llvm::DenseSet<BlockArgument> asyncResetBlockArguments;
    for (auto arg : machine.getBody().front().getArguments()) {
      if (asyncResetArguments.contains(arg.getArgNumber())) {
        asyncResetBlockArguments.insert(arg);
      }
    }
 
    // Emit a warning if reset signals were detected and removed.
    // The FSM dialect does not support reset signals, so the reset behavior
    // is only captured in the initial state. The original reset triggering
    // mechanism is not preserved.
    if (!asyncResetBlockArguments.empty()) {
      moduleOp.emitWarning()
          << "reset signals detected and removed from FSM; "
             "reset behavior is captured only in the initial state";
    }
 
    Block &front = machine.getBody().front();
    front.eraseArguments([&](BlockArgument arg) {
      return asyncResetBlockArguments.contains(arg);
    });
 
    if (llvm::any_of(front.getArguments(), [](BlockArgument arg) {
          return arg.getType() == seq::ClockType::get(arg.getContext()) &&
                 arg.hasNUsesOrMore(1);
        })) {
      moduleOp.emitError("Clock uses outside register clocking are not "
                         "currently supported.");
      return failure();
    }
    machine.getBody().front().eraseArguments([&](BlockArgument arg) {
      return arg.getType() == seq::ClockType::get(arg.getContext());
    });
    FunctionType oldFunctionType = machine.getFunctionType();
    SmallVector<Type> inputsWithoutClock;
    for (unsigned int i = 0; i < oldFunctionType.getNumInputs(); i++) {
      Type input = oldFunctionType.getInput(i);
      if (input != seq::ClockType::get(input.getContext()) &&
          !asyncResetArguments.contains(i))
        inputsWithoutClock.push_back(input);
    }
 
    FunctionType newFunctionType = FunctionType::get(
        opBuilder.getContext(), inputsWithoutClock, resultTypes);
 
    machine.setFunctionType(newFunctionType);
    moduleOp.erase();
    return success();
  }
 
private:
  /// Helper function to determine if a register is a state register.
  bool isStateRegister(seq::CompRegOp reg) const {
    auto regName = reg.getName();
    if (!regName)
      return false;
 
    // If user specified state registers, check if this register's name matches
    // any of them.
    if (!stateRegNames.empty()) {
      return llvm::is_contained(stateRegNames, regName->str());
    }
 
    // Default behavior: infer state registers by checking if the name contains
    // "state".
    return regName->contains("state");
  }
 
  HWModuleOp moduleOp;
  OpBuilder &opBuilder;
  ArrayRef<std::string> stateRegNames;
};
 
} // namespace
 
namespace {
struct CoreToFSMPass : public circt::impl::ConvertCoreToFSMBase<CoreToFSMPass> {
  using ConvertCoreToFSMBase<CoreToFSMPass>::ConvertCoreToFSMBase;
 
  void runOnOperation() override {
    auto module = getOperation();
    OpBuilder builder(module);
 
    SmallVector<HWModuleOp> modules;
    for (auto hwModule : module.getOps<HWModuleOp>()) {
      modules.push_back(hwModule);
    }
 
    // Check for hw.instance operations - instance conversion is not supported.
    for (auto hwModule : modules) {
      for (auto instance : hwModule.getOps<hw::InstanceOp>()) {
        instance.emitError() << "instance conversion is not yet supported";
        signalPassFailure();
        return;
      }
    }
 
    for (auto hwModule : modules) {
      builder.setInsertionPoint(hwModule);
      HWModuleOpConverter converter(builder, hwModule, stateRegs);
      if (failed(converter.run())) {
        signalPassFailure();
        return;
      }
    }
  }
};
} // namespace