Home
last modified time | relevance | path

Searched refs:blockEccLen (Results 1 - 5 of 5) sorted by relevance

/third_party/qrcodegen/java-fast/io/nayuki/fastqrcodegen/
H A DQrCode.java335 int blockEccLen = ECC_CODEWORDS_PER_BLOCK [errorCorrectionLevel.ordinal()][version]; in addEccAndInterleave()
338 int shortBlockDataLen = rawCodewords / numBlocks - blockEccLen; in addEccAndInterleave()
343 ReedSolomonGenerator rs = ReedSolomonGenerator.MEMOIZER.get(blockEccLen); in addEccAndInterleave()
344 byte[] ecc = new byte[blockEccLen]; // Temporary storage per iteration in addEccAndInterleave()
353 for (int j = 0, l = data.length + i; j < blockEccLen; j++, l += numBlocks) // Copy ECC in addEccAndInterleave()
/third_party/qrcodegen/java/src/main/java/io/nayuki/qrcodegen/
H A DQrCode.java435 int blockEccLen = ECC_CODEWORDS_PER_BLOCK [errorCorrectionLevel.ordinal()][version]; in addEccAndInterleave()
442 byte[] rsDiv = reedSolomonComputeDivisor(blockEccLen); in addEccAndInterleave()
444 byte[] dat = Arrays.copyOfRange(data, k, k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1)); in addEccAndInterleave()
448 System.arraycopy(ecc, 0, block, block.length - blockEccLen, ecc.length); in addEccAndInterleave()
457 if (i != shortBlockLen - blockEccLen || j >= numShortBlocks) { in addEccAndInterleave()
/third_party/qrcodegen/c/
H A Dqrcodegen-test.c111 size_t blockEccLen = (size_t)ECC_CODEWORDS_PER_BLOCK[(int)ecl][version]; in addEccAndInterleaveReference() local
118 uint8_t *generator = malloc(blockEccLen * sizeof(uint8_t)); in addEccAndInterleaveReference()
123 reedSolomonComputeDivisor((int)blockEccLen, generator); in addEccAndInterleaveReference()
130 size_t datLen = shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1); in addEccAndInterleaveReference()
132 reedSolomonComputeRemainder(&data[k], (int)datLen, generator, (int)blockEccLen, &block[shortBlockLen + 1 - blockEccLen]); in addEccAndInterleaveReference()
147 if (i != shortBlockLen - blockEccLen || j >= numShortBlocks) { in addEccAndInterleaveReference()
H A Dqrcodegen.c298 int blockEccLen = ECC_CODEWORDS_PER_BLOCK [(int)ecl][version]; in addEccAndInterleave() local
302 int shortBlockDataLen = rawCodewords / numBlocks - blockEccLen; in addEccAndInterleave()
307 reedSolomonComputeDivisor(blockEccLen, rsdiv); in addEccAndInterleave()
312 reedSolomonComputeRemainder(dat, datLen, rsdiv, blockEccLen, ecc); in addEccAndInterleave()
318 for (int j = 0, k = dataLen + i; j < blockEccLen; j++, k += numBlocks) // Copy ECC in addEccAndInterleave()
/third_party/qrcodegen/cpp/
H A Dqrcodegen.cpp504 int blockEccLen = ECC_CODEWORDS_PER_BLOCK [static_cast<int>(errorCorrectionLevel)][version]; in addEccAndInterleave() local
511 const vector<uint8_t> rsDiv = reedSolomonComputeDivisor(blockEccLen); in addEccAndInterleave()
513 vector<uint8_t> dat(data.cbegin() + k, data.cbegin() + (k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1))); in addEccAndInterleave()
527 if (i != static_cast<unsigned int>(shortBlockLen - blockEccLen) || j >= static_cast<unsigned int>(numShortBlocks)) in addEccAndInterleave()

Completed in 8 milliseconds