Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DLoadStoreVectorizer.cpp669 unsigned NumLeft = (SizeBytes - (SizeBytes % 4)) / ElementSizeBytes; in splitOddVectorElts() local
670 if (NumLeft == Chain.size()) { in splitOddVectorElts()
671 if ((NumLeft & 1) == 0) in splitOddVectorElts()
672 NumLeft /= 2; // Split even in half in splitOddVectorElts()
674 --NumLeft; // Split off last element in splitOddVectorElts()
675 } else if (NumLeft == 0) in splitOddVectorElts()
676 NumLeft = 1; in splitOddVectorElts()
677 return std::make_pair(Chain.slice(0, NumLeft), Chain.slice(NumLeft)); in splitOddVectorElts()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGFast.cpp689 if (unsigned NumLeft = NumOps) { in ScheduleNode() local
692 const SDValue &Op = N->getOperand(NumLeft-1); in ScheduleNode()
695 if (NumLeft == NumOps && Op.getValueType() == MVT::Glue) { in ScheduleNode()
718 } while (--NumLeft); in ScheduleNode()
H A DSelectionDAGBuilder.cpp11272 unsigned NumLeft = LastLeft - W.FirstCluster + 1; in splitWorkItem() local
11275 if (std::min(NumLeft, NumRight) < 3 && std::max(NumLeft, NumRight) > 3) { in splitWorkItem()
11279 if (NumLeft < NumRight) { in splitWorkItem()
11291 assert(NumRight < NumLeft); in splitWorkItem()