Home
last modified time | relevance | path

Searched refs:currentNode (Results 1 – 3 of 3) sorted by relevance

/llvm-project-15.0.7/mlir/lib/Reducer/
H A DReductionTreePass.cpp105 ReductionNode &currentNode = *iter; in findOptimal() local
106 Region &curRegion = currentNode.getRegion(); in findOptimal()
108 applyPatterns(curRegion, patterns, currentNode.getRanges(), in findOptimal()
110 currentNode.update(test.isInteresting(currentNode.getModule())); in findOptimal()
112 if (currentNode.isInteresting() == Tester::Interestingness::True && in findOptimal()
113 currentNode.getSize() < smallestNode->getSize()) in findOptimal()
114 smallestNode = &currentNode; in findOptimal()
/llvm-project-15.0.7/mlir/lib/Transforms/
H A DCSE.cpp304 auto &currentNode = stack.back(); in simplifyRegion() local
307 if (!currentNode->processed) { in simplifyRegion()
308 currentNode->processed = true; in simplifyRegion()
309 simplifyBlock(knownValues, currentNode->node->getBlock(), in simplifyRegion()
314 if (currentNode->childIterator != currentNode->node->end()) { in simplifyRegion()
315 auto *childNode = *(currentNode->childIterator++); in simplifyRegion()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDominanceFrontierImpl.h174 const DomTreeNodeT *currentNode = currentW->Node; in calculate() local
177 assert(currentNode && "Invalid work object. Missing current Node"); in calculate()
185 if (DT[Succ]->getIDom() != currentNode) in calculate()
194 for (typename DomTreeNodeT::const_iterator NI = currentNode->begin(), in calculate()
195 NE = currentNode->end(); in calculate()
201 childBB, currentBB, IDominee, currentNode)); in calculate()