Lines Matching full:blocklength
95 int32_t allocDataBlock(int32_t blockLength);
406 int32_t MutableCodePointTrie::allocDataBlock(int32_t blockLength) { in allocDataBlock() argument
408 int32_t newTop = newBlock + blockLength; in allocDataBlock()
592 const uint16_t *q, int32_t qStart, int32_t blockLength) { in findSameBlock() argument
594 length -= blockLength; in findSameBlock()
598 if (equalBlocks(p + pStart, q, blockLength)) { in findSameBlock()
607 uint32_t value, int32_t blockLength) { in findAllSameBlock() argument
609 limit -= blockLength; in findAllSameBlock()
614 if (i == blockLength) { in findAllSameBlock()
633 const UIntB *q, int32_t qStart, int32_t blockLength) { in getOverlap() argument
634 int32_t overlap = blockLength - 1; in getOverlap()
644 int32_t blockLength) { in getAllSameOverlap() argument
645 int32_t min = length - (blockLength - 1); in getAllSameOverlap()
804 blockLength = newBlockLength; in init()
810 int32_t start = prevDataLength - blockLength; in extend()
816 for (int32_t end = newDataLength - blockLength; start <= end; ++start) { in extend()
846 int32_t blockLimit = blockStart + blockLength; in makeHashCode()
856 for (int32_t i = 1; i < blockLength; ++i) { in makeHashCode()
883 if (equalBlocks(data + dataIndex, blockData + blockStart, blockLength)) { in findEntry()
901 if (allValuesSameAs(data + dataIndex, blockLength, blockValue)) { in findEntry()
924 int32_t blockLength = 0; member in __anon422b44c30111::MixedBlocks
941 int32_t blockLength = UCPTRIE_FAST_DATA_BLOCK_LENGTH; in compactWholeDataBlocks() local
945 blockLength = UCPTRIE_SMALL_DATA_BLOCK_LENGTH; in compactWholeDataBlocks()
953 if (allValuesSameAs(p + 1, blockLength - 1, value)) { in compactWholeDataBlocks()
958 newDataCapacity += blockLength; in compactWholeDataBlocks()
979 newDataCapacity += blockLength; in compactWholeDataBlocks()
1018 newDataCapacity += blockLength; in compactWholeDataBlocks()
1041 void printBlock(const uint32_t *block, int32_t blockLength, uint32_t value, in printBlock() argument
1050 for (; i < blockLength; ++i) { in printBlock()
1104 int32_t blockLength = UCPTRIE_FAST_DATA_BLOCK_LENGTH; in compactData() local
1105 if (!mixedBlocks.init(newDataCapacity, blockLength)) { in compactData()
1116 blockLength = UCPTRIE_SMALL_DATA_BLOCK_LENGTH; in compactData()
1119 if (!mixedBlocks.init(newDataCapacity, blockLength)) { in compactData()
1127 // Find an earlier part of the data array of length blockLength in compactData()
1139 n = findAllSameBlock(newData, n + 1, newDataLength, value, blockLength); in compactData()
1145 n = getAllSameOverlap(newData, newDataLength, value, blockLength); in compactData()
1149 printBlock(nullptr, blockLength, value, i << UCPTRIE_SHIFT_3, n, initialValue); in compactData()
1154 while (n < blockLength) { in compactData()
1167 n = getOverlap(newData, newDataLength, block, 0, blockLength); in compactData()
1171 printBlock(block, blockLength, 0, i << UCPTRIE_SHIFT_3, n, initialValue); in compactData()
1176 while (n < blockLength) { in compactData()
1445 int32_t blockLength = UCPTRIE_INDEX_2_BLOCK_LENGTH; in compactIndex() local
1447 for (int32_t i = 0; i < i2Length; i += blockLength) { in compactIndex()
1449 if ((i2Length - i) >= blockLength) { in compactIndex()
1451 U_ASSERT(blockLength == UCPTRIE_INDEX_2_BLOCK_LENGTH); in compactIndex()
1455 blockLength = i2Length - i; in compactIndex()
1457 index2, i, blockLength); in compactIndex()
1467 n = getOverlap(index16, indexLength, index2, i, blockLength); in compactIndex()
1471 while (n < blockLength) { in compactIndex()