Home
last modified time | relevance | path

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

/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoadStoreVectorizer.cpp667 unsigned NumLeft = (SizeBytes - (SizeBytes % 4)) / ElementSizeBytes; in splitOddVectorElts() local
668 if (NumLeft == Chain.size()) { in splitOddVectorElts()
669 if ((NumLeft & 1) == 0) in splitOddVectorElts()
670 NumLeft /= 2; // Split even in half in splitOddVectorElts()
672 --NumLeft; // Split off last element in splitOddVectorElts()
673 } else if (NumLeft == 0) in splitOddVectorElts()
674 NumLeft = 1; in splitOddVectorElts()
675 return std::make_pair(Chain.slice(0, NumLeft), Chain.slice(NumLeft)); in splitOddVectorElts()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGFast.cpp674 if (unsigned NumLeft = NumOps) { in ScheduleNode() local
677 const SDValue &Op = N->getOperand(NumLeft-1); in ScheduleNode()
680 if (NumLeft == NumOps && Op.getValueType() == MVT::Glue) { in ScheduleNode()
703 } while (--NumLeft); in ScheduleNode()
H A DSelectionDAGBuilder.cpp10820 unsigned NumLeft = LastLeft - W.FirstCluster + 1; in splitWorkItem() local
10823 if (std::min(NumLeft, NumRight) < 3 && std::max(NumLeft, NumRight) > 3) { in splitWorkItem()
10827 if (NumLeft < NumRight) { in splitWorkItem()
10839 assert(NumRight < NumLeft); in splitWorkItem()