MLIR  20.0.0git
Public Member Functions | List of all members
mlir::ComposeCollapseOfExpandOp< CollapseOpTy, ExpandOpTy, CastOpTy, DimOpTy, TensorTy > Struct Template Reference

Pattern to compose collapse_shape(expand_shape(src, reassociation_1), reassociation_2). More...

#include "mlir/Dialect/Utils/ReshapeOpsUtils.h"

+ Inheritance diagram for mlir::ComposeCollapseOfExpandOp< CollapseOpTy, ExpandOpTy, CastOpTy, DimOpTy, TensorTy >:

Public Member Functions

LogicalResult matchAndRewrite (CollapseOpTy collapseOp, PatternRewriter &rewriter) const override
 
- Public Member Functions inherited from mlir::OpRewritePattern< CollapseOpTy >
 OpRewritePattern (MLIRContext *context, PatternBenefit benefit=1, ArrayRef< StringRef > generatedNames={})
 Patterns must specify the root operation name they match against, and can also specify the benefit of the pattern matching and a list of generated ops. More...
 
- Public Member Functions inherited from mlir::detail::OpOrInterfaceRewritePatternBase< SourceOp >
void rewrite (Operation *op, PatternRewriter &rewriter) const final
 Wrappers around the RewritePattern methods that pass the derived op type. More...
 
LogicalResult match (Operation *op) const final
 Attempt to match against code rooted at the specified operation, which is the same operation code as getRootKind(). More...
 
LogicalResult matchAndRewrite (Operation *op, PatternRewriter &rewriter) const final
 Attempt to match against code rooted at the specified operation, which is the same operation code as getRootKind(). More...
 
virtual void rewrite (SourceOp op, PatternRewriter &rewriter) const
 Rewrite and Match methods that operate on the SourceOp type. More...
 
virtual LogicalResult match (SourceOp op) const
 
virtual LogicalResult matchAndRewrite (SourceOp op, PatternRewriter &rewriter) const
 
- Public Member Functions inherited from mlir::RewritePattern
virtual ~RewritePattern ()=default
 
- Public Member Functions inherited from mlir::Pattern
ArrayRef< OperationNamegetGeneratedOps () const
 Return a list of operations that may be generated when rewriting an operation instance with this pattern. More...
 
std::optional< OperationNamegetRootKind () const
 Return the root node that this pattern matches. More...
 
std::optional< TypeIDgetRootInterfaceID () const
 Return the interface ID used to match the root operation of this pattern. More...
 
std::optional< TypeIDgetRootTraitID () const
 Return the trait ID used to match the root operation of this pattern. More...
 
PatternBenefit getBenefit () const
 Return the benefit (the inverse of "cost") of matching this pattern. More...
 
bool hasBoundedRewriteRecursion () const
 Returns true if this pattern is known to result in recursive application, i.e. More...
 
MLIRContextgetContext () const
 Return the MLIRContext used to create this pattern. More...
 
StringRef getDebugName () const
 Return a readable name for this pattern. More...
 
void setDebugName (StringRef name)
 Set the human readable debug name used for this pattern. More...
 
ArrayRef< StringRef > getDebugLabels () const
 Return the set of debug labels attached to this pattern. More...
 
void addDebugLabels (ArrayRef< StringRef > labels)
 Add the provided debug labels to this pattern. More...
 
void addDebugLabels (StringRef label)
 

Additional Inherited Members

- Static Public Member Functions inherited from mlir::RewritePattern
template<typename T , typename... Args>
static std::unique_ptr< T > create (Args &&...args)
 This method provides a convenient interface for creating and initializing derived rewrite patterns of the given type T. More...
 
- Protected Member Functions inherited from mlir::RewritePattern
 Pattern (StringRef rootName, PatternBenefit benefit, MLIRContext *context, ArrayRef< StringRef > generatedNames={})
 Inherit the base constructors from Pattern. More...
 
 Pattern (MatchAnyOpTypeTag tag, PatternBenefit benefit, MLIRContext *context, ArrayRef< StringRef > generatedNames={})
 Inherit the base constructors from Pattern. More...
 
 Pattern (MatchInterfaceOpTypeTag tag, TypeID interfaceID, PatternBenefit benefit, MLIRContext *context, ArrayRef< StringRef > generatedNames={})
 Inherit the base constructors from Pattern. More...
 
 Pattern (MatchTraitOpTypeTag tag, TypeID traitID, PatternBenefit benefit, MLIRContext *context, ArrayRef< StringRef > generatedNames={})
 Inherit the base constructors from Pattern. More...
 
- Protected Member Functions inherited from mlir::Pattern
 Pattern (StringRef rootName, PatternBenefit benefit, MLIRContext *context, ArrayRef< StringRef > generatedNames={})
 Construct a pattern with a certain benefit that matches the operation with the given root name. More...
 
 Pattern (MatchAnyOpTypeTag tag, PatternBenefit benefit, MLIRContext *context, ArrayRef< StringRef > generatedNames={})
 Construct a pattern that may match any operation type. More...
 
 Pattern (MatchInterfaceOpTypeTag tag, TypeID interfaceID, PatternBenefit benefit, MLIRContext *context, ArrayRef< StringRef > generatedNames={})
 Construct a pattern that may match any operation that implements the interface defined by the provided interfaceID. More...
 
 Pattern (MatchTraitOpTypeTag tag, TypeID traitID, PatternBenefit benefit, MLIRContext *context, ArrayRef< StringRef > generatedNames={})
 Construct a pattern that may match any operation that implements the trait defined by the provided traitID. More...
 
void setHasBoundedRewriteRecursion (bool hasBoundedRecursionArg=true)
 Set the flag detailing if this pattern has bounded rewrite recursion or not. More...
 

Detailed Description

template<typename CollapseOpTy, typename ExpandOpTy, typename CastOpTy, typename DimOpTy, typename TensorTy>
struct mlir::ComposeCollapseOfExpandOp< CollapseOpTy, ExpandOpTy, CastOpTy, DimOpTy, TensorTy >

Pattern to compose collapse_shape(expand_shape(src, reassociation_1), reassociation_2).

In that case both srcType and resultType can be expressed as a function of intermediateType. In order to demonstrate the approach, let's assume that rank(srcType) > rank(resultType), i.e. the resulting operation should becollapse_shape. In that case, we can iterate over every set of indices inreassociation_2 and try to find ids of sets of indices inreassociation_1` that cover it completely.

Example:

%0 = tensor.expand_shape arg [[0], [1], [2, 3]] : tensor<?x?x?xi64> into tensor<?x?x?x1xi64> %1 = tensor.collapse_shape %0 [[0, 1], [2, 3]] : tensor<?x?x?x1xi64> into tensor<?x?xi64>

can be canonicalized into

%0 = tensor.collapse_shape arg [[0, 1], [2]] : tensor<?x?x?xi64> into tensor<?x?xi64>

because [0] and [1] from expand_shape reassociation cover completely [0, 1] from collapse_shape. If it is impossible to find such union of indices, then we fail. When rank(srcType) < rank(resultType), then we just swap reassociation_1 reassociation_2 and produce expand_shape.

Definition at line 257 of file ReshapeOpsUtils.h.

Member Function Documentation

◆ matchAndRewrite()

template<typename CollapseOpTy , typename ExpandOpTy , typename CastOpTy , typename DimOpTy , typename TensorTy >
LogicalResult mlir::ComposeCollapseOfExpandOp< CollapseOpTy, ExpandOpTy, CastOpTy, DimOpTy, TensorTy >::matchAndRewrite ( CollapseOpTy  collapseOp,
PatternRewriter rewriter 
) const
inlineoverride

The documentation for this struct was generated from the following file: