CIRCT 20.0.0git
Loading...
Searching...
No Matches
Passes.h
Go to the documentation of this file.
1//===- Passes.h - Pass Entrypoints ------------------------------*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This header file defines prototypes for CIRCT transformation passes.
10//
11//===----------------------------------------------------------------------===//
12
13#ifndef CIRCT_TRANSFORMS_PASSES_H
14#define CIRCT_TRANSFORMS_PASSES_H
15
17#include "mlir/Dialect/Affine/IR/AffineOps.h"
18#include "mlir/IR/BuiltinOps.h"
19#include "mlir/Pass/Pass.h"
20#include <limits>
21
22namespace circt {
23
24//===----------------------------------------------------------------------===//
25// Passes
26//===----------------------------------------------------------------------===//
27
28#define GEN_PASS_DECL
29
31 // Specify the format for op count data emission
34 JSON
35};
36
37#include "circt/Transforms/Passes.h.inc"
38
39std::unique_ptr<mlir::Pass> createMapArithToCombPass();
40std::unique_ptr<mlir::Pass> createFlattenMemRefPass();
41std::unique_ptr<mlir::Pass> createFlattenMemRefCallsPass();
42std::unique_ptr<mlir::Pass> createStripDebugInfoWithPredPass(
43 const std::function<bool(mlir::Location)> &pred);
44std::unique_ptr<mlir::Pass> createMaximizeSSAPass();
45std::unique_ptr<mlir::Pass> createInsertMergeBlocksPass();
46std::unique_ptr<mlir::Pass> createPrintOpCountPass();
47std::unique_ptr<mlir::Pass> createMemoryBankingPass(
48 std::optional<unsigned> bankingFactor = std::nullopt,
49 std::optional<unsigned> bankingDimension = std::nullopt);
50std::unique_ptr<mlir::Pass> createIndexSwitchToIfPass();
51
52//===----------------------------------------------------------------------===//
53// Utility functions.
54//===----------------------------------------------------------------------===//
55
56// Returns true if the provided memref is considered unidimensional (having a
57// shape of size 1).
58bool isUniDimensional(mlir::MemRefType memref);
59
60// Returns true if the region is into maximal SSA form i.e., if all the values
61// within the region are in maximal SSA form.
62bool isRegionSSAMaximized(Region &region);
63
64/// Strategy class to control the behavior of SSA maximization. The class
65/// exposes overridable filter functions to dynamically select which blocks,
66/// block arguments, operations, and operation results should be put into
67/// maximal SSA form. All filter functions should return true whenever the
68/// entity they operate on should be considered for SSA maximization. By
69/// default, all filter functions always return true.
71public:
72 /// Determines whether a block should have the values it defines (i.e., block
73 /// arguments and operation results within the block) SSA maximized.
74 virtual bool maximizeBlock(Block *block);
75 /// Determines whether a block argument should be SSA maximized.
76 virtual bool maximizeArgument(BlockArgument arg);
77 /// Determines whether an operation should have its results SSA maximized.
78 virtual bool maximizeOp(Operation *op);
79 /// Determines whether an operation's result should be SSA maximized.
80 virtual bool maximizeResult(OpResult res);
81
82 virtual ~SSAMaximizationStrategy() = default;
83};
84
85/// Converts a single value within a function into maximal SSA form. This
86/// removes any implicit dataflow of this specific value within the enclosing
87/// function. The function adds new block arguments wherever necessary to carry
88/// the value explicitly between blocks.
89/// Succeeds when it was possible to convert the value into maximal SSA form.
90LogicalResult maximizeSSA(Value value, PatternRewriter &rewriter);
91
92/// Considers all of an operation's results for SSA maximization, following a
93/// provided strategy. This removes any implicit dataflow of the selected
94/// operation's results within the enclosing function. The function adds new
95/// block arguments wherever necessary to carry the results explicitly between
96/// blocks. Succeeds when it was possible to convert the selected operation's
97/// results into maximal SSA form.
98LogicalResult maximizeSSA(Operation *op, SSAMaximizationStrategy &strategy,
99 PatternRewriter &rewriter);
100
101/// Considers all values defined by a block (i.e., block arguments and operation
102/// results within the block) for SSA maximization, following a provided
103/// strategy. This removes any implicit dataflow of the selected values within
104/// the enclosing function. The function adds new block arguments wherever
105/// necessary to carry the values explicitly between blocks. Succeeds when it
106/// was possible to convert the selected values defined by the block into
107/// maximal SSA form.
108LogicalResult maximizeSSA(Block *block, SSAMaximizationStrategy &strategy,
109 PatternRewriter &rewriter);
110
111/// Considers all blocks within a region for SSA maximization, following a
112/// provided strategy. This removes any implicit dataflow of the values defined
113/// by selected blocks within the region. The function adds new block arguments
114/// wherever necessary to carry the region's values explicitly between blocks.
115/// Succeeds when it was possible to convert all of the values defined by
116/// selected blocks into maximal SSA form.
117LogicalResult maximizeSSA(Region &region, SSAMaximizationStrategy &strategy,
118 PatternRewriter &rewriter);
119
120/// Manually run merge block insertion on a region.
121///
122/// This transformation does treat loops like a single block and thus does not
123/// affect them.
124LogicalResult insertMergeBlocks(mlir::Region &r,
125 mlir::ConversionPatternRewriter &rewriter);
126
127//===----------------------------------------------------------------------===//
128// Registration
129//===----------------------------------------------------------------------===//
130
131/// Generate the code for registering passes.
132#define GEN_PASS_REGISTRATION
133#include "circt/Transforms/Passes.h.inc"
134
135} // namespace circt
136
137#endif // CIRCT_TRANSFORMS_PASSES_H
Strategy strategy
Strategy class to control the behavior of SSA maximization.
Definition Passes.h:70
virtual bool maximizeResult(OpResult res)
Determines whether an operation's result should be SSA maximized.
virtual ~SSAMaximizationStrategy()=default
virtual bool maximizeArgument(BlockArgument arg)
Determines whether a block argument should be SSA maximized.
virtual bool maximizeBlock(Block *block)
Determines whether a block should have the values it defines (i.e., block arguments and operation res...
virtual bool maximizeOp(Operation *op)
Determines whether an operation should have its results SSA maximized.
The InstanceGraph op interface, see InstanceGraphInterface.td for more details.
std::unique_ptr< mlir::Pass > createMaximizeSSAPass()
std::unique_ptr< mlir::Pass > createPrintOpCountPass()
std::unique_ptr< mlir::Pass > createInsertMergeBlocksPass()
std::unique_ptr< mlir::Pass > createIndexSwitchToIfPass()
std::unique_ptr< mlir::Pass > createMapArithToCombPass()
mlir::LogicalResult insertMergeBlocks(mlir::Region &r, mlir::ConversionPatternRewriter &rewriter)
Insert additional blocks that serve as counterparts to the blocks that diverged the control flow.
LogicalResult maximizeSSA(Value value, PatternRewriter &rewriter)
Converts a single value within a function into maximal SSA form.
std::unique_ptr< mlir::Pass > createMemoryBankingPass(std::optional< unsigned > bankingFactor=std::nullopt, std::optional< unsigned > bankingDimension=std::nullopt)
std::unique_ptr< mlir::Pass > createFlattenMemRefPass()
OpCountEmissionFormat
Definition Passes.h:30
bool isUniDimensional(mlir::MemRefType memref)
bool isRegionSSAMaximized(Region &region)
std::unique_ptr< mlir::Pass > createFlattenMemRefCallsPass()
std::unique_ptr< mlir::Pass > createStripDebugInfoWithPredPass(const std::function< bool(mlir::Location)> &pred)
Creates a pass to strip debug information from a function.