Home
last modified time | relevance | path

Searched refs:opsB (Results 1 – 4 of 4) sorted by relevance

/external/antlr/tool/src/main/java/org/antlr/analysis/
DSemanticContext.java737 HashSet<SemanticContext> opsB = new HashSet<SemanticContext>(getAndOperands(b)); in factorAnd() local
740 result.retainAll(opsB); in factorAnd()
752 opsB.removeAll(result); in factorAnd()
753 if (opsB.isEmpty()) in factorAnd()
755 else if (opsB.size() == 1) in factorAnd()
756 b = opsB.iterator().next(); in factorAnd()
758 b = new AND(opsB); in factorAnd()
770 HashSet<SemanticContext> opsB = new HashSet<SemanticContext>(getOrOperands(b)); in factorOr() local
773 result.retainAll(opsB); in factorOr()
785 opsB.removeAll(result); in factorOr()
[all …]
/external/llvm-project/mlir/lib/Transforms/Utils/
DLoopFusionUtils.cpp301 SmallVector<Operation *, 4> opsB; in canFuseLoops() local
302 if (!gatherLoadsAndStores(forOpB, opsB)) { in canFuseLoops()
314 if (getMaxLoopDepth(opsB, fusionStrategy) < dstLoopDepth) { in canFuseLoops()
355 if (failed(mlir::computeSliceUnion(strategyOpsA, opsB, dstLoopDepth, in canFuseLoops()
/external/llvm-project/mlir/lib/Analysis/
DUtils.cpp599 ArrayRef<Operation *> opsB, in computeSliceUnion() argument
611 for (unsigned j = 0, numOpsB = opsB.size(); j < numOpsB; ++j) { in computeSliceUnion()
612 MemRefAccess dstAccess(opsB[j]); in computeSliceUnion()
617 (isBackwardSlice && loopDepth > getNestingDepth(opsB[j]))) { in computeSliceUnion()
636 dependentOpPairs.push_back({opsA[i], opsB[j]}); in computeSliceUnion()
640 mlir::getComputationSliceState(opsA[i], opsB[j], &dependenceConstraints, in computeSliceUnion()
/external/llvm-project/mlir/include/mlir/Analysis/
DUtils.h151 ArrayRef<Operation *> opsB, unsigned loopDepth,