Home
last modified time | relevance | path

Searched refs:ReductionNode (Results 1 – 5 of 5) sorted by relevance

/llvm-project-15.0.7/mlir/include/mlir/Reducer/
H A DReductionNode.h44 class ReductionNode {
51 ReductionNode(ReductionNode *parent, const std::vector<Range> &range,
54 ReductionNode *getParent() const { return parent; } in getParent()
83 ArrayRef<ReductionNode *> generateNewVariants();
118 ReductionNode *top = visitQueue.front();
135 ArrayRef<ReductionNode *> getNeighbors(ReductionNode *node) { in getNeighbors()
140 std::queue<ReductionNode *> visitQueue;
152 ReductionNode *parent = nullptr;
181 std::vector<ReductionNode *> variants;
188 class ReductionNode::iterator<SinglePath>
[all …]
/llvm-project-15.0.7/mlir/lib/Reducer/
H A DReductionNode.cpp26 ReductionNode::ReductionNode( in ReductionNode() function in ReductionNode
27 ReductionNode *parentNode, const std::vector<Range> &ranges, in ReductionNode()
28 llvm::SpecificBumpPtrAllocator<ReductionNode> &allocator) in ReductionNode()
38 LogicalResult ReductionNode::initialize(ModuleOp parentModule, in initialize()
52 ArrayRef<ReductionNode *> ReductionNode::generateNewVariants() { in generateNewVariants()
119 ArrayRef<ReductionNode *>
120 ReductionNode::iterator<SinglePath>::getNeighbors(ReductionNode *node) { in getNeighbors()
123 ArrayRef<ReductionNode *> variantsFromParent = in getNeighbors()
130 if (!llvm::all_of(variantsFromParent, [](ReductionNode *node) { in getNeighbors()
136 ReductionNode *smallest = nullptr; in getNeighbors()
[all …]
H A DReductionTreePass.cpp39 ArrayRef<ReductionNode::Range> rangeToKeep, in applyPatterns()
89 llvm::SpecificBumpPtrAllocator<ReductionNode> allocator; in findOptimal()
91 std::vector<ReductionNode::Range> ranges{ in findOptimal()
94 ReductionNode *root = allocator.Allocate(); in findOptimal()
95 new (root) ReductionNode(nullptr, ranges, allocator); in findOptimal()
101 ReductionNode *smallestNode = root; in findOptimal()
105 ReductionNode &currentNode = *iter; in findOptimal()
121 SmallVector<ReductionNode *> trace; in findOptimal()
122 ReductionNode *curNode = smallestNode; in findOptimal()
131 ReductionNode *top = trace.pop_back_val(); in findOptimal()
[all …]
H A DCMakeLists.txt3 ReductionNode.cpp
/llvm-project-15.0.7/clang/docs/tools/
H A Dclang-formatted-files.txt7824 mlir/include/mlir/Reducer/ReductionNode.h
8361 mlir/lib/Reducer/ReductionNode.cpp