MLIR  20.0.0git
Classes | Namespaces | Typedefs
RootOrdering.h File Reference
#include "mlir/IR/Value.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/SmallVector.h"
#include <functional>
#include <vector>

Go to the source code of this file.

Classes

struct  mlir::pdl_to_pdl_interp::RootOrderingEntry
 The information associated with an edge in the cost graph. More...
 
class  mlir::pdl_to_pdl_interp::OptimalBranching
 The optimal branching algorithm solver. More...
 

Namespaces

 mlir
 Include the generated interface declarations.
 
 mlir::pdl_to_pdl_interp
 

Typedefs

using mlir::pdl_to_pdl_interp::RootOrderingGraph = DenseMap< Value, DenseMap< Value, RootOrderingEntry > >
 A directed graph representing the cost of ordering the roots in the predicate tree. More...