13 #ifndef MLIR_QUANTIZER_SUPPORT_CONSTRAINTANALYSISGRAPHTRAITS_H 14 #define MLIR_QUANTIZER_SUPPORT_CONSTRAINTANALYSISGRAPHTRAITS_H 17 #include "llvm/ADT/GraphTraits.h" 22 struct GraphTraits<const
mlir::quantizer::CAGNode *> {
34 struct GraphTraits<const
mlir::quantizer::CAGSlice *>
35 :
public llvm::GraphTraits<const mlir::quantizer::CAGNode *> {
49 #endif // MLIR_QUANTIZER_SUPPORT_CONSTRAINTANALYSISGRAPHTRAITS_H Definition: InferTypeOpInterface.cpp:20
const_iterator begin() const
Iterator over this node's children (outgoing) nodes.
Definition: ConstraintAnalysisGraph.h:79
Definition: ConstraintAnalysisGraph.h:45
Definition: PassRegistry.cpp:413
iterator begin()
Definition: ConstraintAnalysisGraph.h:254
A slice of a CAG (which may be the whole graph).
Definition: ConstraintAnalysisGraph.h:245
node_vector::const_iterator const_iterator
Definition: ConstraintAnalysisGraph.h:252
iterator end()
Definition: ConstraintAnalysisGraph.h:255
static mlir::quantizer::CAGSlice::const_iterator nodes_end(const mlir::quantizer::CAGSlice *G)
Definition: ConstraintAnalysisGraphTraits.h:42
static ChildIteratorType child_end(NodeRef node)
Definition: ConstraintAnalysisGraphTraits.h:30
const_iterator end() const
Definition: ConstraintAnalysisGraph.h:80
static mlir::quantizer::CAGSlice::const_iterator nodes_begin(const mlir::quantizer::CAGSlice *G)
Definition: ConstraintAnalysisGraphTraits.h:38
mlir::quantizer::CAGSlice::const_iterator nodes_iterator
Definition: ConstraintAnalysisGraphTraits.h:36
static ChildIteratorType child_begin(NodeRef node)
Definition: ConstraintAnalysisGraphTraits.h:29
mlir::quantizer::CAGNode::const_iterator ChildIteratorType
Definition: ConstraintAnalysisGraphTraits.h:28
static NodeRef getEntryNode(NodeRef node)
Definition: ConstraintAnalysisGraphTraits.h:25
node_vector::const_iterator const_iterator
Definition: ConstraintAnalysisGraph.h:64