Lines Matching refs:TableSize

5962       Module &M, uint64_t TableSize, ConstantInt *Offset,
5970 /// Return true if a table with TableSize elements of
5972 static bool WouldFitInRegister(const DataLayout &DL, uint64_t TableSize,
6016 Module &M, uint64_t TableSize, ConstantInt *Offset,
6020 assert(TableSize >= Values.size() && "Can't fit values in table!");
6028 SmallVector<Constant *, 64> TableContents(TableSize);
6042 if (Values.size() < TableSize) {
6046 for (uint64_t I = 0; I < TableSize; ++I) {
6068 assert(TableSize >= 2 && "Should be a SingleValue table.");
6070 for (uint64_t I = 0; I < TableSize; ++I) {
6100 if (WouldFitInRegister(DL, TableSize, ValueType)) {
6102 APInt TableInt(TableSize * IT->getBitWidth(), 0);
6103 for (uint64_t I = TableSize; I > 0; --I) {
6119 ArrayType *ArrayTy = ArrayType::get(ValueType, TableSize);
6169 uint64_t TableSize =
6171 if (TableSize > (1ULL << std::min(IT->getBitWidth() - 1, 63u)))
6188 uint64_t TableSize,
6197 if (TableSize >= UINT_MAX / IT->getBitWidth())
6199 return DL.fitsInLegalInteger(TableSize * IT->getBitWidth());
6250 ShouldBuildLookupTable(SwitchInst *SI, uint64_t TableSize,
6253 if (SI->getNumCases() > TableSize)
6254 return false; // TableSize overflowed.
6267 SwitchLookupTable::WouldFitInRegister(DL, TableSize, Ty);
6284 return isSwitchDense(SI->getNumCases(), TableSize);
6299 DL, MaxCaseVal.getLimitedValue() + 1 /* TableSize */,
6475 uint64_t TableSize;
6477 TableSize = MaxCaseVal->getLimitedValue() + 1;
6479 TableSize =
6482 bool TableHasHoles = (NumResults < TableSize);
6488 if (!DL.fitsInLegalInteger(TableSize))
6492 if (!ShouldBuildLookupTable(SI, TableSize, TTI, DL, ResultTypes))
6519 assert(MaxTableSize >= TableSize &&
6528 const bool GeneratingCoveredLookupTable = (MaxTableSize == TableSize);
6539 TableIndex, ConstantInt::get(MinCaseVal->getType(), TableSize));
6559 uint64_t TableSizePowOf2 = NextPowerOf2(std::max(7ULL, TableSize - 1ULL));
6604 SwitchLookupTable Table(Mod, TableSize, TableIndexOffset, ResultList, DV,