SliceMatchers.h

Go to the documentation of this file.

//===- SliceMatchers.h - Matchers for slicing analysis ----------*- C++ -*-===//
//
// 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
//
//===----------------------------------------------------------------------===//
//
// This file defines slicing-analysis matchers that extend and abstract the
// core implementations from `SliceAnalysis.h`.
//
//===----------------------------------------------------------------------===//
 
#ifndef MLIR_TOOLS_MLIRQUERY_MATCHERS_SLICEMATCHERS_H
#define MLIR_TOOLS_MLIRQUERY_MATCHERS_SLICEMATCHERS_H
 
#include "mlir/Analysis/SliceAnalysis.h"
#include "mlir/IR/Operation.h"
 
/// Computes the backward-slice of all transitive defs reachable from `rootOp`,
/// if `innerMatcher` matches. The traversal stops once the desired depth level
/// is reached.
///
/// Example: starting from node 9, assuming the matcher
/// computes the slice for the first two depth levels:
/// ============================
///    1       2      3      4
///    |_______|      |______|
///    |   |             |
///    |   5             6
///    |___|_____________|
///      |               |
///      7               8
///      |_______________|
///              |
///              9
///
/// Assuming all local orders match the numbering order:
///     {1, 5, 6, 7, 8, 9}
namespace mlir::query::matcher {
 
template <typename Matcher>
class BackwardSliceMatcher {
public:
  BackwardSliceMatcher(Matcher innerMatcher, int64_t maxDepth, bool inclusive,
                       bool omitBlockArguments, bool omitUsesFromAbove)
      : innerMatcher(std::move(innerMatcher)), maxDepth(maxDepth),
        inclusive(inclusive), omitBlockArguments(omitBlockArguments),
        omitUsesFromAbove(omitUsesFromAbove) {}
 
  bool match(Operation *rootOp, SetVector<Operation *> &backwardSlice) {
    BackwardSliceOptions options;
    options.inclusive = inclusive;
    options.omitUsesFromAbove = omitUsesFromAbove;
    options.omitBlockArguments = omitBlockArguments;
    return (innerMatcher.match(rootOp) &&
            matches(rootOp, backwardSlice, options, maxDepth));
  }
 
private:
  bool matches(Operation *rootOp, llvm::SetVector<Operation *> &backwardSlice,
               BackwardSliceOptions &options, int64_t maxDepth);
 
private:
  // The outer matcher (e.g., BackwardSliceMatcher) relies on the innerMatcher
  // to determine whether we want to traverse the IR or not. For example, we
  // want to explore the IR only if the top-level operation name is
  // `"arith.addf"`.
  Matcher innerMatcher;
  // `maxDepth` specifies the maximum depth that the matcher can traverse the
  // IR. For example, if `maxDepth` is 2, the matcher will explore the defining
  // operations of the top-level op up to 2 levels.
  int64_t maxDepth;
  bool inclusive;
  bool omitBlockArguments;
  bool omitUsesFromAbove;
};
 
template <typename Matcher>
bool BackwardSliceMatcher<Matcher>::matches(
    Operation *rootOp, llvm::SetVector<Operation *> &backwardSlice,
    BackwardSliceOptions &options, int64_t maxDepth) {
  backwardSlice.clear();
  llvm::DenseMap<Operation *, int64_t> opDepths;
  // Initializing the root op with a depth of 0
  opDepths[rootOp] = 0;
  options.filter = [&](Operation *subOp) {
    // If the subOp hasn't been recorded in opDepths, it is deeper than
    // maxDepth.
    if (!opDepths.contains(subOp))
      return false;
    // Examine subOp's operands to compute depths of their defining operations.
    for (auto operand : subOp->getOperands()) {
      int64_t newDepth = opDepths[subOp] + 1;
      // If the newDepth is greater than maxDepth, further computation can be
      // skipped.
      if (newDepth > maxDepth)
        continue;
 
      if (auto definingOp = operand.getDefiningOp()) {
        // Registers the minimum depth
        if (!opDepths.contains(definingOp) || newDepth < opDepths[definingOp])
          opDepths[definingOp] = newDepth;
      } else {
        auto blockArgument = cast<BlockArgument>(operand);
        Operation *parentOp = blockArgument.getOwner()->getParentOp();
        if (!parentOp)
          continue;
 
        if (!opDepths.contains(parentOp) || newDepth < opDepths[parentOp])
          opDepths[parentOp] = newDepth;
      }
    }
    return true;
  };
  LogicalResult result = getBackwardSlice(rootOp, &backwardSlice, options);
  assert(result.succeeded() && "expected backward slice to succeed");
  (void)result;
  return options.inclusive ? backwardSlice.size() > 1
                           : backwardSlice.size() >= 1;
}
 
/// Computes the backward-slice of all transitive defs reachable from `rootOp`,
/// if `innerMatcher` matches. Traversal stops where `filterMatcher` matches.
template <typename BaseMatcher, typename Filter>
class PredicateBackwardSliceMatcher {
public:
  PredicateBackwardSliceMatcher(BaseMatcher innerMatcher, Filter filterMatcher,
                                bool inclusive, bool omitBlockArguments,
                                bool omitUsesFromAbove)
      : innerMatcher(std::move(innerMatcher)),
        filterMatcher(std::move(filterMatcher)), inclusive(inclusive),
        omitBlockArguments(omitBlockArguments),
        omitUsesFromAbove(omitUsesFromAbove) {}
 
  bool match(Operation *rootOp, SetVector<Operation *> &backwardSlice) {
    backwardSlice.clear();
    BackwardSliceOptions options;
    options.inclusive = inclusive;
    options.omitUsesFromAbove = omitUsesFromAbove;
    options.omitBlockArguments = omitBlockArguments;
    if (innerMatcher.match(rootOp)) {
      options.filter = [&](Operation *subOp) {
        return !filterMatcher.match(subOp);
      };
      LogicalResult result = getBackwardSlice(rootOp, &backwardSlice, options);
      assert(result.succeeded() && "expected backward slice to succeed");
      (void)result;
      return options.inclusive ? backwardSlice.size() > 1
                               : backwardSlice.size() >= 1;
    }
    return false;
  }
 
private:
  BaseMatcher innerMatcher;
  Filter filterMatcher;
  bool inclusive;
  bool omitBlockArguments;
  bool omitUsesFromAbove;
};
 
/// Computes the forward-slice of all users reachable from `rootOp`,
/// if `innerMatcher` matches. Traversal stops where `filterMatcher` matches.
template <typename BaseMatcher, typename Filter>
class PredicateForwardSliceMatcher {
public:
  PredicateForwardSliceMatcher(BaseMatcher innerMatcher, Filter filterMatcher,
                               bool inclusive)
      : innerMatcher(std::move(innerMatcher)),
        filterMatcher(std::move(filterMatcher)), inclusive(inclusive) {}
 
  bool match(Operation *rootOp, SetVector<Operation *> &forwardSlice) {
    forwardSlice.clear();
    ForwardSliceOptions options;
    options.inclusive = inclusive;
    if (innerMatcher.match(rootOp)) {
      options.filter = [&](Operation *subOp) {
        return !filterMatcher.match(subOp);
      };
      getForwardSlice(rootOp, &forwardSlice, options);
      return options.inclusive ? forwardSlice.size() > 1
                               : forwardSlice.size() >= 1;
    }
    return false;
  }
 
private:
  BaseMatcher innerMatcher;
  Filter filterMatcher;
  bool inclusive;
};
 
/// Matches transitive defs of a top-level operation up to N levels.
template <typename Matcher>
inline BackwardSliceMatcher<Matcher>
m_GetDefinitions(Matcher innerMatcher, int64_t maxDepth, bool inclusive,
                 bool omitBlockArguments, bool omitUsesFromAbove) {
  assert(maxDepth >= 0 && "maxDepth must be non-negative");
  return BackwardSliceMatcher<Matcher>(std::move(innerMatcher), maxDepth,
                                       inclusive, omitBlockArguments,
                                       omitUsesFromAbove);
}
 
/// Matches all transitive defs of a top-level operation up to N levels.
template <typename Matcher>
inline BackwardSliceMatcher<Matcher> m_GetAllDefinitions(Matcher innerMatcher,
                                                         int64_t maxDepth) {
  assert(maxDepth >= 0 && "maxDepth must be non-negative");
  return BackwardSliceMatcher<Matcher>(std::move(innerMatcher), maxDepth, true,
                                       false, false);
}
 
/// Matches all transitive defs of a top-level operation and stops where
/// `filterMatcher` rejects.
template <typename BaseMatcher, typename Filter>
inline PredicateBackwardSliceMatcher<BaseMatcher, Filter>
m_GetDefinitionsByPredicate(BaseMatcher innerMatcher, Filter filterMatcher,
                            bool inclusive, bool omitBlockArguments,
                            bool omitUsesFromAbove) {
  return PredicateBackwardSliceMatcher<BaseMatcher, Filter>(
      std::move(innerMatcher), std::move(filterMatcher), inclusive,
      omitBlockArguments, omitUsesFromAbove);
}
 
/// Matches all users of a top-level operation and stops where
/// `filterMatcher` rejects.
template <typename BaseMatcher, typename Filter>
inline PredicateForwardSliceMatcher<BaseMatcher, Filter>
m_GetUsersByPredicate(BaseMatcher innerMatcher, Filter filterMatcher,
                      bool inclusive) {
  return PredicateForwardSliceMatcher<BaseMatcher, Filter>(
      std::move(innerMatcher), std::move(filterMatcher), inclusive);
}
 
} // namespace mlir::query::matcher
 
#endif // MLIR_TOOLS_MLIRQUERY_MATCHERS_SLICEMATCHERS_H