You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
360 lines
10 KiB
360 lines
10 KiB
/*
|
|
* QR Code generator test suite (C)
|
|
*
|
|
* When compiling this program, the library qrcodegen.c needs QRCODEGEN_TEST
|
|
* to be defined. Run this command line program with no arguments.
|
|
*
|
|
* Copyright (c) Project Nayuki. (MIT License)
|
|
* https://www.nayuki.io/page/qr-code-generator-library
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy of
|
|
* this software and associated documentation files (the "Software"), to deal in
|
|
* the Software without restriction, including without limitation the rights to
|
|
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
|
* the Software, and to permit persons to whom the Software is furnished to do so,
|
|
* subject to the following conditions:
|
|
* - The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
* - The Software is provided "as is", without warranty of any kind, express or
|
|
* implied, including but not limited to the warranties of merchantability,
|
|
* fitness for a particular purpose and noninfringement. In no event shall the
|
|
* authors or copyright holders be liable for any claim, damages or other
|
|
* liability, whether in an action of contract, tort or otherwise, arising from,
|
|
* out of or in connection with the Software or the use or other dealings in the
|
|
* Software.
|
|
*/
|
|
|
|
#include <assert.h>
|
|
#include <limits.h>
|
|
#include <stdbool.h>
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "qrcodegen.h"
|
|
|
|
#define ARRAY_LENGTH(name) (sizeof(name) / sizeof(name[0]))
|
|
|
|
|
|
// Global variables
|
|
static int numTestCases = 0;
|
|
|
|
|
|
// Prototypes of private functions under test
|
|
int getTextProperties(const char *text, bool *isNumeric, bool *isAlphanumeric, int *textBits);
|
|
int getNumDataCodewords(int version, enum qrcodegen_Ecc ecl);
|
|
int getNumRawDataModules(int version);
|
|
void calcReedSolomonGenerator(int degree, uint8_t result[]);
|
|
void calcReedSolomonRemainder(const uint8_t data[], int dataLen, const uint8_t generator[], int degree, uint8_t result[]);
|
|
uint8_t finiteFieldMultiply(uint8_t x, uint8_t y);
|
|
int getAlignmentPatternPositions(int version, uint8_t result[7]);
|
|
|
|
|
|
/*---- Test cases ----*/
|
|
|
|
static void testSize(void) {
|
|
int cases[][2] = {
|
|
{ 1, 21},
|
|
{ 6, 41},
|
|
{20, 97},
|
|
{33, 149},
|
|
{40, 177},
|
|
};
|
|
for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) {
|
|
int *tc = cases[i];
|
|
assert(qrcodegen_getSize(tc[0]) == tc[1]);
|
|
numTestCases++;
|
|
}
|
|
}
|
|
|
|
|
|
static void testGetTextProperties(void) {
|
|
bool isNumeric, isAlphanumeric;
|
|
int textLen, textBits;
|
|
|
|
textLen = getTextProperties("", &isNumeric, &isAlphanumeric, &textBits);
|
|
assert(textLen == 0 && isNumeric && isAlphanumeric && textBits == 0);
|
|
numTestCases++;
|
|
|
|
textLen = getTextProperties("0", &isNumeric, &isAlphanumeric, &textBits);
|
|
assert(textLen == 1 && isNumeric && isAlphanumeric && textBits == 4);
|
|
numTestCases++;
|
|
|
|
textLen = getTextProperties("768", &isNumeric, &isAlphanumeric, &textBits);
|
|
assert(textLen == 3 && isNumeric && isAlphanumeric && textBits == 10);
|
|
numTestCases++;
|
|
|
|
textLen = getTextProperties("A1", &isNumeric, &isAlphanumeric, &textBits);
|
|
assert(textLen == 2 && !isNumeric && isAlphanumeric && textBits == 11);
|
|
numTestCases++;
|
|
|
|
textLen = getTextProperties("THE: QUICK+/*BROWN$FOX.", &isNumeric, &isAlphanumeric, &textBits);
|
|
assert(textLen == 23 && !isNumeric && isAlphanumeric && textBits == 127);
|
|
numTestCases++;
|
|
|
|
textLen = getTextProperties("aB 9", &isNumeric, &isAlphanumeric, &textBits);
|
|
assert(textLen == 4 && !isNumeric && !isAlphanumeric && textBits == 32);
|
|
numTestCases++;
|
|
|
|
char text[32769];
|
|
|
|
memset(text, '5', sizeof(text));
|
|
text[32768] = '\0';
|
|
textLen = getTextProperties(text, &isNumeric, &isAlphanumeric, &textBits);
|
|
assert(textLen < 0);
|
|
numTestCases++;
|
|
|
|
memset(text, '1', sizeof(text));
|
|
text[32767] = '\0';
|
|
textLen = getTextProperties(text, &isNumeric, &isAlphanumeric, &textBits);
|
|
assert((109224L > INT_MAX && textLen < 0) ||
|
|
(109224L <= INT_MAX && textLen == 32767 && isNumeric && isAlphanumeric && textBits == 109224L));
|
|
numTestCases++;
|
|
|
|
memset(text, 'a', sizeof(text));
|
|
text[4095] = '\0';
|
|
textLen = getTextProperties(text, &isNumeric, &isAlphanumeric, &textBits);
|
|
assert(textLen == 4095 && !isNumeric && !isAlphanumeric && textBits == 32760);
|
|
numTestCases++;
|
|
|
|
memset(text, 'a', sizeof(text));
|
|
text[32767] = '\0';
|
|
textLen = getTextProperties(text, &isNumeric, &isAlphanumeric, &textBits);
|
|
assert((262136L > INT_MAX && textLen < 0) ||
|
|
(262136L <= INT_MAX && textLen == 32767 && !isNumeric && !isAlphanumeric && textBits == 262136L));
|
|
numTestCases++;
|
|
}
|
|
|
|
|
|
static void testGetNumDataCodewords(void) {
|
|
int cases[][3] = {
|
|
{ 3, 1, 44},
|
|
{ 3, 2, 34},
|
|
{ 3, 3, 26},
|
|
{ 6, 0, 136},
|
|
{ 7, 0, 156},
|
|
{ 9, 0, 232},
|
|
{ 9, 1, 182},
|
|
{12, 3, 158},
|
|
{15, 0, 523},
|
|
{16, 2, 325},
|
|
{19, 3, 341},
|
|
{21, 0, 932},
|
|
{22, 0, 1006},
|
|
{22, 1, 782},
|
|
{22, 3, 442},
|
|
{24, 0, 1174},
|
|
{24, 3, 514},
|
|
{28, 0, 1531},
|
|
{30, 3, 745},
|
|
{32, 3, 845},
|
|
{33, 0, 2071},
|
|
{33, 3, 901},
|
|
{35, 0, 2306},
|
|
{35, 1, 1812},
|
|
{35, 2, 1286},
|
|
{36, 3, 1054},
|
|
{37, 3, 1096},
|
|
{39, 1, 2216},
|
|
{40, 1, 2334},
|
|
};
|
|
for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) {
|
|
int *tc = cases[i];
|
|
assert(getNumDataCodewords(tc[0], (enum qrcodegen_Ecc)tc[1]) == tc[2]);
|
|
numTestCases++;
|
|
}
|
|
}
|
|
|
|
|
|
static void testGetNumRawDataModules(void) {
|
|
int cases[][2] = {
|
|
{ 1, 208},
|
|
{ 2, 359},
|
|
{ 3, 567},
|
|
{ 6, 1383},
|
|
{ 7, 1568},
|
|
{12, 3728},
|
|
{15, 5243},
|
|
{18, 7211},
|
|
{22, 10068},
|
|
{26, 13652},
|
|
{32, 19723},
|
|
{37, 25568},
|
|
{40, 29648},
|
|
};
|
|
for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) {
|
|
int *tc = cases[i];
|
|
assert(getNumRawDataModules(tc[0]) == tc[1]);
|
|
numTestCases++;
|
|
}
|
|
}
|
|
|
|
|
|
static void testCalcReedSolomonGenerator(void) {
|
|
uint8_t generator[30];
|
|
|
|
calcReedSolomonGenerator(1, generator);
|
|
assert(generator[0] == 0x01);
|
|
numTestCases++;
|
|
|
|
calcReedSolomonGenerator(2, generator);
|
|
assert(generator[0] == 0x03);
|
|
assert(generator[1] == 0x02);
|
|
numTestCases++;
|
|
|
|
calcReedSolomonGenerator(5, generator);
|
|
assert(generator[0] == 0x1F);
|
|
assert(generator[1] == 0xC6);
|
|
assert(generator[2] == 0x3F);
|
|
assert(generator[3] == 0x93);
|
|
assert(generator[4] == 0x74);
|
|
numTestCases++;
|
|
|
|
calcReedSolomonGenerator(30, generator);
|
|
assert(generator[ 0] == 0xD4);
|
|
assert(generator[ 1] == 0xF6);
|
|
assert(generator[ 5] == 0xC0);
|
|
assert(generator[12] == 0x16);
|
|
assert(generator[13] == 0xD9);
|
|
assert(generator[20] == 0x12);
|
|
assert(generator[27] == 0x6A);
|
|
assert(generator[29] == 0x96);
|
|
numTestCases++;
|
|
}
|
|
|
|
|
|
static void testCalcReedSolomonRemainder(void) {
|
|
{
|
|
uint8_t data[1];
|
|
uint8_t generator[3];
|
|
uint8_t remainder[ARRAY_LENGTH(generator)];
|
|
calcReedSolomonGenerator(ARRAY_LENGTH(generator), generator);
|
|
calcReedSolomonRemainder(data, 0, generator, ARRAY_LENGTH(generator), remainder);
|
|
assert(remainder[0] == 0);
|
|
assert(remainder[1] == 0);
|
|
assert(remainder[2] == 0);
|
|
numTestCases++;
|
|
}
|
|
{
|
|
uint8_t data[2] = {0, 1};
|
|
uint8_t generator[4];
|
|
uint8_t remainder[ARRAY_LENGTH(generator)];
|
|
calcReedSolomonGenerator(ARRAY_LENGTH(generator), generator);
|
|
calcReedSolomonRemainder(data, ARRAY_LENGTH(data), generator, ARRAY_LENGTH(generator), remainder);
|
|
assert(remainder[0] == generator[0]);
|
|
assert(remainder[1] == generator[1]);
|
|
assert(remainder[2] == generator[2]);
|
|
assert(remainder[3] == generator[3]);
|
|
numTestCases++;
|
|
}
|
|
{
|
|
uint8_t data[5] = {0x03, 0x3A, 0x60, 0x12, 0xC7};
|
|
uint8_t generator[5];
|
|
uint8_t remainder[ARRAY_LENGTH(generator)];
|
|
calcReedSolomonGenerator(ARRAY_LENGTH(generator), generator);
|
|
calcReedSolomonRemainder(data, ARRAY_LENGTH(data), generator, ARRAY_LENGTH(generator), remainder);
|
|
assert(remainder[0] == 0xCB);
|
|
assert(remainder[1] == 0x36);
|
|
assert(remainder[2] == 0x16);
|
|
assert(remainder[3] == 0xFA);
|
|
assert(remainder[4] == 0x9D);
|
|
numTestCases++;
|
|
}
|
|
{
|
|
uint8_t data[43] = {
|
|
0x38, 0x71, 0xDB, 0xF9, 0xD7, 0x28, 0xF6, 0x8E, 0xFE, 0x5E,
|
|
0xE6, 0x7D, 0x7D, 0xB2, 0xA5, 0x58, 0xBC, 0x28, 0x23, 0x53,
|
|
0x14, 0xD5, 0x61, 0xC0, 0x20, 0x6C, 0xDE, 0xDE, 0xFC, 0x79,
|
|
0xB0, 0x8B, 0x78, 0x6B, 0x49, 0xD0, 0x1A, 0xAD, 0xF3, 0xEF,
|
|
0x52, 0x7D, 0x9A,
|
|
};
|
|
uint8_t generator[30];
|
|
uint8_t remainder[ARRAY_LENGTH(generator)];
|
|
calcReedSolomonGenerator(ARRAY_LENGTH(generator), generator);
|
|
calcReedSolomonRemainder(data, ARRAY_LENGTH(data), generator, ARRAY_LENGTH(generator), remainder);
|
|
assert(remainder[ 0] == 0xCE);
|
|
assert(remainder[ 1] == 0xF0);
|
|
assert(remainder[ 2] == 0x31);
|
|
assert(remainder[ 3] == 0xDE);
|
|
assert(remainder[ 8] == 0xE1);
|
|
assert(remainder[12] == 0xCA);
|
|
assert(remainder[17] == 0xE3);
|
|
assert(remainder[19] == 0x85);
|
|
assert(remainder[20] == 0x50);
|
|
assert(remainder[24] == 0xBE);
|
|
assert(remainder[29] == 0xB3);
|
|
numTestCases++;
|
|
}
|
|
}
|
|
|
|
|
|
static void testFiniteFieldMultiply(void) {
|
|
uint8_t cases[][3] = {
|
|
{0x00, 0x00, 0x00},
|
|
{0x01, 0x01, 0x01},
|
|
{0x02, 0x02, 0x04},
|
|
{0x00, 0x6E, 0x00},
|
|
{0xB2, 0xDD, 0xE6},
|
|
{0x41, 0x11, 0x25},
|
|
{0xB0, 0x1F, 0x11},
|
|
{0x05, 0x75, 0xBC},
|
|
{0x52, 0xB5, 0xAE},
|
|
{0xA8, 0x20, 0xA4},
|
|
{0x0E, 0x44, 0x9F},
|
|
{0xD4, 0x13, 0xA0},
|
|
{0x31, 0x10, 0x37},
|
|
{0x6C, 0x58, 0xCB},
|
|
{0xB6, 0x75, 0x3E},
|
|
{0xFF, 0xFF, 0xE2},
|
|
};
|
|
for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) {
|
|
uint8_t *tc = cases[i];
|
|
assert(finiteFieldMultiply(tc[0], tc[1]) == tc[2]);
|
|
numTestCases++;
|
|
}
|
|
}
|
|
|
|
|
|
static void testGetAlignmentPatternPositions(void) {
|
|
int cases[][9] = {
|
|
{ 1, 0, -1, -1, -1, -1, -1, -1, -1},
|
|
{ 2, 2, 6, 18, -1, -1, -1, -1, -1},
|
|
{ 3, 2, 6, 22, -1, -1, -1, -1, -1},
|
|
{ 6, 2, 6, 34, -1, -1, -1, -1, -1},
|
|
{ 7, 3, 6, 22, 38, -1, -1, -1, -1},
|
|
{ 8, 3, 6, 24, 42, -1, -1, -1, -1},
|
|
{16, 4, 6, 26, 50, 74, -1, -1, -1},
|
|
{25, 5, 6, 32, 58, 84, 110, -1, -1},
|
|
{32, 6, 6, 34, 60, 86, 112, 138, -1},
|
|
{33, 6, 6, 30, 58, 86, 114, 142, -1},
|
|
{39, 7, 6, 26, 54, 82, 110, 138, 166},
|
|
{40, 7, 6, 30, 58, 86, 114, 142, 170},
|
|
};
|
|
for (size_t i = 0; i < ARRAY_LENGTH(cases); i++) {
|
|
int *tc = cases[i];
|
|
uint8_t pos[7];
|
|
int num = getAlignmentPatternPositions(tc[0], pos);
|
|
assert(num == tc[1]);
|
|
for (int j = 0; j < num; j++)
|
|
assert(pos[j] == tc[2 + j]);
|
|
numTestCases++;
|
|
}
|
|
}
|
|
|
|
|
|
/*---- Main runner ----*/
|
|
|
|
int main(void) {
|
|
testSize();
|
|
testGetTextProperties();
|
|
testGetNumDataCodewords();
|
|
testGetNumRawDataModules();
|
|
testCalcReedSolomonGenerator();
|
|
testCalcReedSolomonRemainder();
|
|
testFiniteFieldMultiply();
|
|
testGetAlignmentPatternPositions();
|
|
printf("All %d test cases passed\n", numTestCases);
|
|
return EXIT_SUCCESS;
|
|
}
|