159     AffineMap ubMap = ubs[i];  in isSliceMaximalFastCheck()  local
162     if (!lbMap || !ubMap || lbMap.getNumResults() != 1 ||  in isSliceMaximalFastCheck()
163         ubMap.getNumResults() != 1 ||  in isSliceMaximalFastCheck()
164         lbMap.getResult(0) + 1 != ubMap.getResult(0) ||  in isSliceMaximalFastCheck()
407                                          AffineMap &ubMap) const {  in getLowerAndUpperBound()
418   ubMap = boundPairs.second;  in getLowerAndUpperBound()
420   assert(ubMap && "upper bound for a region must exist");  in getLowerAndUpperBound()
422   assert(ubMap.getNumInputs() == cst.getNumDimAndSymbolVars() - rank);  in getLowerAndUpperBound()
974 static Optional<uint64_t> getConstDifference(AffineMap lbMap, AffineMap ubMap) {  in getConstDifference()  argument
976   assert(ubMap.getNumResults() == 1 && "expected single result bound map");  in getConstDifference()
977   assert(lbMap.getNumDims() == ubMap.getNumDims());  in getConstDifference()
978   assert(lbMap.getNumSymbols() == ubMap.getNumSymbols());  in getConstDifference()
980   AffineExpr ubExpr(ubMap.getResult(0));  in getConstDifference()
1002     AffineMap ubMap = slice.ubs[i];  in buildSliceTripCountMap()  local
1006     if (!lbMap || lbMap.getNumResults() == 0 || !ubMap ||  in buildSliceTripCountMap()
1007         ubMap.getNumResults() == 0) {  in buildSliceTripCountMap()
1021     Optional<uint64_t> tripCount = getConstDifference(lbMap, ubMap);  in buildSliceTripCountMap()
1208     if (AffineMap ubMap = sliceState->ubs[i])  in insertBackwardComputationSlice()  local
1209       forOp.setUpperBound(sliceState->ubOperands[i], ubMap);  in insertBackwardComputationSlice()