Home
last modified time | relevance | path

Searched refs:reedSolomonMultiply (Results 1 – 6 of 6) sorted by relevance

/third_party/qrcodegen/java/src/main/java/io/nayuki/qrcodegen/
DQrCode.java672 result[j] = (byte)reedSolomonMultiply(result[j] & 0xFF, root); in reedSolomonComputeDivisor()
676 root = reedSolomonMultiply(root, 0x02); in reedSolomonComputeDivisor()
692 result[i] ^= reedSolomonMultiply(divisor[i] & 0xFF, factor); in reedSolomonComputeRemainder()
700 private static int reedSolomonMultiply(int x, int y) { in reedSolomonMultiply() method in QrCode
/third_party/qrcodegen/typescript-javascript/
Dqrcodegen.ts600 result[j] = QrCode.reedSolomonMultiply(result[j], root);
604 root = QrCode.reedSolomonMultiply(root, 0x02);
617 result[i] ^= QrCode.reedSolomonMultiply(coef, factor));
625 private static reedSolomonMultiply(x: byte, y: byte): byte { method in qrcodegen.QrCode
/third_party/qrcodegen/c/
Dqrcodegen.c64 testable uint8_t reedSolomonMultiply(uint8_t x, uint8_t y);
372 result[j] = reedSolomonMultiply(result[j], root); in reedSolomonComputeDivisor()
376 root = reedSolomonMultiply(root, 0x02); in reedSolomonComputeDivisor()
393 result[j] ^= reedSolomonMultiply(generator[j], factor); in reedSolomonComputeRemainder()
402 testable uint8_t reedSolomonMultiply(uint8_t x, uint8_t y) { in reedSolomonMultiply() function
Dqrcodegen-test.c54 uint8_t reedSolomonMultiply(uint8_t x, uint8_t y);
381 assert(reedSolomonMultiply(tc[0], tc[1]) == tc[2]); in testReedSolomonMultiply()
/third_party/qrcodegen/cpp/
Dqrcodegen.cpp717 result.at(j) = reedSolomonMultiply(result.at(j), root); in reedSolomonComputeDivisor()
721 root = reedSolomonMultiply(root, 0x02); in reedSolomonComputeDivisor()
734 result.at(i) ^= reedSolomonMultiply(divisor.at(i), factor); in reedSolomonComputeRemainder()
740 uint8_t QrCode::reedSolomonMultiply(uint8_t x, uint8_t y) { in reedSolomonMultiply() function in qrcodegen::QrCode
Dqrcodegen.hpp465 private: static std::uint8_t reedSolomonMultiply(std::uint8_t x, std::uint8_t y);