Lines Matching defs:dataLen
62 testable void reedSolomonComputeRemainder(const uint8_t data[], int dataLen,
72 static void drawCodewords(const uint8_t data[], int dataLen, uint8_t qrcode[]);
167 bool qrcodegen_encodeBinary(uint8_t dataAndTemp[], size_t dataLen, uint8_t qrcode[],
172 seg.bitLength = calcSegmentBitLength(seg.mode, dataLen);
177 seg.numChars = (int)dataLen;
291 // bytes from the blocks and stores them in the result array. data[0 : dataLen] contains
292 // the input data. data[dataLen : rawCodewords] is used as a temporary work area and will
300 int dataLen = getNumDataCodewords(version, ecl);
311 uint8_t *ecc = &data[dataLen]; // Temporary storage
318 for (int j = 0, k = dataLen + i; j < blockEccLen; j++, k += numBlocks) // Copy ECC
382 // The remainder when data[0 : dataLen] is divided by divisor[0 : degree] is stored in result[0 : degree].
384 testable void reedSolomonComputeRemainder(const uint8_t data[], int dataLen,
388 for (int i = 0; i < dataLen; i++) { // Polynomial division
577 static void drawCodewords(const uint8_t data[], int dataLen, uint8_t qrcode[]) {
589 if (!getModuleBounded(qrcode, x, y) && i < dataLen * 8) {
599 assert(i == dataLen * 8);