SynthOps.h File Reference

#include "circt/Dialect/Synth/SynthDialect.h"
#include "circt/Support/LLVM.h"
#include "mlir/IR/Attributes.h"
#include "mlir/IR/Builders.h"
#include "mlir/IR/BuiltinOps.h"
#include "mlir/IR/BuiltinTypes.h"
#include "mlir/IR/Dialect.h"
#include "mlir/IR/Operation.h"
#include "mlir/Interfaces/InferTypeOpInterface.h"
#include "mlir/Interfaces/SideEffectInterfaces.h"
#include "mlir/Rewrite/PatternApplicator.h"
#include "circt/Dialect/Synth/Synth.h.inc"
#include "llvm/ADT/PriorityQueue.h"

Include dependency graph for SynthOps.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	circt::synth::AndInverterVariadicOpConversion
class	circt::synth::ValueWithArrivalTime
	Helper class for delay-aware tree building. More...

Namespaces
namespace	circt
	The InstanceGraph op interface, see InstanceGraphInterface.td for more details.
namespace	circt::synth

Macros
#define	GET_OP_CLASSES

Functions
LogicalResult	circt::synth::topologicallySortGraphRegionBlocks (mlir::Operation *op, llvm::function_ref< bool(mlir::Value, mlir::Operation *)> isOperandReady)
	This function performs a topological sort on the operations within each block of graph regions in the given operation.
template<typename T >
T	circt::synth::buildBalancedTreeWithArrivalTimes (llvm::ArrayRef< T > elements, llvm::function_ref< T(T, T)> combine)
	Build a balanced binary tree using a priority queue to greedily pair elements with earliest arrival times.

Macro Definition Documentation

GET_OP_CLASSES

#define GET_OP_CLASSES

Definition at line 28 of file SynthOps.h.