开机二维码页: OLED显示设备ClientID二维码10s(qrcodegen库,白底暗码+右侧ID文本),未配置不显示;版本号不动
This commit is contained in:
parent
4fb21a4b43
commit
507ab7abda
|
|
@ -67,6 +67,7 @@
|
|||
| HR_IN 缺料检测 | **PA8 下拉输入，高=缺料→停投料关继电器1（只记日志），不接传感器不影响投料** |
|
||||
| KEY1~4 | **PC6/PC7/PB14/PB15 上拉输入，功能预留** |
|
||||
| 取消 | PA8 手动模式开关（MANUAL_MODE 已删） |
|
||||
| 开机二维码 | 已配置身份时开机 OLED 显示 10s：内容=ClientID（qrcodegen 生成），右侧附 ID 文本 |
|
||||
|
||||
**485 总线多从机（V1.7.1 起）**：称重秤 0x01（Modbus 读重量）+ 扩展继电器板 0x10（FC05 控制/FC03 读状态，协议见 `Docs/RS485扩展继电器协议.md`）；收帧统一在 feedScaleProcess 按站号分发，发送共用 uart.c 的 rs485_bus 时间戳做 50ms 静默保护；平台标识符 sw5~sw8，蓝牙 R5ON~R8OFF；扩展板状态断电记忆（Relay_State[5] 位掩码），离线→上线自动比对恢复
|
||||
|
||||
|
|
|
|||
|
|
@ -3,6 +3,7 @@
|
|||
* CLK=PB3 MOSI=PA15 DC=PC9 CS1=PC8 FSO=PA12 CS2=PC12 RST=PA11 */
|
||||
|
||||
#include "oled.h"
|
||||
#include "qrcodegen.h"
|
||||
#include <string.h>
|
||||
|
||||
#define OLED_CLK_PORT GPIOB
|
||||
|
|
@ -110,6 +111,77 @@ static void lcd_address(uint8_t page, uint8_t column)
|
|||
oled_write(0, (page & 0x0f)); /* 列地址低 4 位 */
|
||||
}
|
||||
|
||||
/*==== 开机二维码页: 内容=text(设备 ClientID), 左侧 QR 白底暗码, 右侧 ID 文本 ====
|
||||
* QR 用 Nayuki qrcodegen 生成(V1~V3 自动, ECC-L, 2px/模块放大), 白底亮块+2 模块静区;
|
||||
* 右侧 x=64 起分行打印 ID(每行 8 字符, 最多 3 行) */
|
||||
void oled_show_qrcode(const char *text)
|
||||
{
|
||||
static uint8_t qr[qrcodegen_BUFFER_LEN_FOR_VERSION(3)];
|
||||
static uint8_t tmp[qrcodegen_BUFFER_LEN_FOR_VERSION(3)];
|
||||
static uint8_t pagebuf[8][64];
|
||||
|
||||
char id[21];
|
||||
strncpy(id, text, 20);
|
||||
id[20] = 0;
|
||||
|
||||
if (!qrcodegen_encodeText(id, tmp, qr, qrcodegen_Ecc_LOW, 1, 3,
|
||||
qrcodegen_Mask_AUTO, true)) {
|
||||
return; /* 编码失败(ID 为空/超长)则不显示 */
|
||||
}
|
||||
int qs = qrcodegen_getSize(qr); /* 21/25/29 */
|
||||
int px = qs * 2; /* 2px/模块 -> 42/50/58 */
|
||||
int x0 = 2;
|
||||
int y0 = (64 - px) / 2; /* 垂直居中 */
|
||||
|
||||
memset(pagebuf, 0, sizeof(pagebuf));
|
||||
/* 白底(含 2 模块=4px 静区): 点亮矩形区域 */
|
||||
int lx = x0 - 4, rx = x0 + px + 4;
|
||||
int ty = y0 - 4, by = y0 + px + 4;
|
||||
if (lx < 0) lx = 0; if (rx > 64) rx = 64;
|
||||
if (ty < 0) ty = 0; if (by > 64) by = 64;
|
||||
for (int y = ty; y < by; y++)
|
||||
for (int x = lx; x < rx; x++)
|
||||
pagebuf[y >> 3][x] |= (uint8_t)(1u << (y & 7));
|
||||
|
||||
/* QR 暗模块: 对应像素清位 */
|
||||
for (int r = 0; r < qs; r++) {
|
||||
for (int c = 0; c < qs; c++) {
|
||||
if (qrcodegen_getModule(qr, c, r)) {
|
||||
for (int dy = 0; dy < 2; dy++) {
|
||||
for (int dx = 0; dx < 2; dx++) {
|
||||
int y = y0 + r * 2 + dy;
|
||||
int x = x0 + c * 2 + dx;
|
||||
pagebuf[y >> 3][x] &= (uint8_t)~(1u << (y & 7));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* 写左半屏 64 列(整页覆写, 不影响右侧文本区) */
|
||||
lcd_cs1(0);
|
||||
rom_cs2(1);
|
||||
for (uint8_t pg = 0; pg < 8; pg++) {
|
||||
oled_write(0, 0xb0 + pg);
|
||||
oled_write(0, 0x00);
|
||||
oled_write(0, 0x10);
|
||||
for (uint8_t x = 0; x < 64; x++) oled_write(1, pagebuf[pg][x]);
|
||||
}
|
||||
lcd_cs1(1);
|
||||
|
||||
/* 右侧 ID 文本: x=64 起每行 8 个 ASCII, 最多 3 行 */
|
||||
int len = (int)strlen(id);
|
||||
oled_locate(0, 8);
|
||||
oled_print("ID:");
|
||||
for (int r = 0; r < 3 && r * 8 < len; r++) {
|
||||
char seg[9];
|
||||
memcpy(seg, id + r * 8, 8); /* id 已 NUL 填充, 尾部短串会被 NUL 截断 */
|
||||
seg[8] = 0;
|
||||
oled_locate(1 + r, 8);
|
||||
oled_print(seg);
|
||||
}
|
||||
}
|
||||
|
||||
/*==== 关显示（黑屏，断电预警时调用）====*/
|
||||
void oled_off(void)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -4,8 +4,8 @@
|
|||
#include "main.h"
|
||||
|
||||
/* 128x64 OLED（SSD1306 兼容指令）+ 晶联讯 GB2312 字库 IC，全部 GPIO 模拟 SPI。
|
||||
* 接线：CLK=PC12 MOSI=PC9 DC=PC8 CS1=PC7(屏幕片选) FSO=PC6(字库输出,接MCU输入)
|
||||
* CS2=PB15(字库片选)
|
||||
* 接线(V1.7.0 新板)：CLK=PB3 MOSI=PA15 DC=PC9 CS1=PC8(屏幕片选) FSO=PA12(字库数据,读MCU方向)
|
||||
* CS2=PC12(字库片选) RST=PA11
|
||||
* 显示字符串必须是 GB2312/GBK 编码（本工程源文件即 GBK，直接写中文字面量即可）。
|
||||
* 屏幕 128x64：16 像素高的行共 4 行（row 0~3），每行 8 个汉字或 16 个 ASCII。 */
|
||||
|
||||
|
|
@ -17,5 +17,6 @@ void oled_xoff(uint8_t px);
|
|||
uint8_t oled_text_w(const char *gbk_str); /* 文本像素宽度（汉字16/ASCII8） */ /* 在当前列基础上右移 px 像素（防烧屏偏移用） */
|
||||
void oled_print(const char *gbk_str); /* 从当前位置显示 GBK 字符串 */
|
||||
void oled_print_line(const char *gbk_str); /* 整行显示：不足 128px 用空格补齐覆盖旧内容 */
|
||||
void oled_show_qrcode(const char *text); /* 开机二维码页: 内容=ClientID, 左侧QR+右侧ID文本 */
|
||||
|
||||
#endif /* __OLED_H */
|
||||
|
|
|
|||
|
|
@ -0,0 +1,918 @@
|
|||
/*
|
||||
* QR Code generator library (C)
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
/* NDEBUG: 关闭 assert(ARMCC 的 __aeabi_assert 会拉半主机调用, 嵌入式不可用) */
|
||||
#define NDEBUG
|
||||
|
||||
#include <assert.h>
|
||||
#include <limits.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include "qrcodegen.h"
|
||||
|
||||
#ifndef QRCODEGEN_TEST
|
||||
#define testable static // Keep functions private
|
||||
#else
|
||||
#define testable // Expose private functions
|
||||
#endif
|
||||
|
||||
|
||||
/*---- Forward declarations for private functions ----*/
|
||||
|
||||
testable void appendBitsToBuffer(unsigned int val, int numBits, uint8_t buffer[], int *bitLen);
|
||||
|
||||
testable void addEccAndInterleave(uint8_t data[], int version, enum qrcodegen_Ecc ecl, uint8_t result[]);
|
||||
testable int getNumDataCodewords(int version, enum qrcodegen_Ecc ecl);
|
||||
testable int getNumRawDataModules(int ver);
|
||||
|
||||
testable void reedSolomonComputeDivisor(int degree, uint8_t result[]);
|
||||
testable void reedSolomonComputeRemainder(const uint8_t data[], int dataLen,
|
||||
const uint8_t generator[], int degree, uint8_t result[]);
|
||||
testable uint8_t reedSolomonMultiply(uint8_t x, uint8_t y);
|
||||
|
||||
testable void initializeFunctionModules(int version, uint8_t qrcode[]);
|
||||
static void drawLightFunctionModules(uint8_t qrcode[], int version);
|
||||
static void drawFormatBits(enum qrcodegen_Ecc ecl, enum qrcodegen_Mask mask, uint8_t qrcode[]);
|
||||
testable int getAlignmentPatternPositions(int version, uint8_t result[7]);
|
||||
static void fillRectangle(int left, int top, int width, int height, uint8_t qrcode[]);
|
||||
|
||||
static void drawCodewords(const uint8_t data[], int dataLen, uint8_t qrcode[]);
|
||||
static void applyMask(const uint8_t functionModules[], uint8_t qrcode[], enum qrcodegen_Mask mask);
|
||||
static long getPenaltyScore(const uint8_t qrcode[]);
|
||||
static int finderPenaltyCountPatterns(const int runHistory[7], int qrsize);
|
||||
static int finderPenaltyTerminateAndCount(bool currentRunColor, int currentRunLength, int runHistory[7], int qrsize);
|
||||
static void finderPenaltyAddHistory(int currentRunLength, int runHistory[7], int qrsize);
|
||||
|
||||
testable bool getModuleBounded(const uint8_t qrcode[], int x, int y);
|
||||
testable void setModuleBounded(uint8_t qrcode[], int x, int y, bool isDark);
|
||||
testable void setModuleUnbounded(uint8_t qrcode[], int x, int y, bool isDark);
|
||||
static bool getBit(int x, int i);
|
||||
|
||||
testable int calcSegmentBitLength(enum qrcodegen_Mode mode, size_t numChars);
|
||||
testable int getTotalBits(const struct qrcodegen_Segment segs[], size_t len, int version);
|
||||
static int numCharCountBits(enum qrcodegen_Mode mode, int version);
|
||||
|
||||
|
||||
|
||||
/*---- Private tables of constants ----*/
|
||||
|
||||
static const char *ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
|
||||
|
||||
#define LENGTH_OVERFLOW -1
|
||||
|
||||
// For generating error correction codes.
|
||||
testable const int8_t ECC_CODEWORDS_PER_BLOCK[4][41] = {
|
||||
// Version: (note that index 0 is for padding, and is set to an illegal value)
|
||||
//0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level
|
||||
{-1, 7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // Low
|
||||
{-1, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28}, // Medium
|
||||
{-1, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // Quartile
|
||||
{-1, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30}, // High
|
||||
};
|
||||
|
||||
#define qrcodegen_REED_SOLOMON_DEGREE_MAX 30 // Based on the table above
|
||||
|
||||
// For generating error correction codes.
|
||||
testable const int8_t NUM_ERROR_CORRECTION_BLOCKS[4][41] = {
|
||||
// Version: (note that index 0 is for padding, and is set to an illegal value)
|
||||
//0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40 Error correction level
|
||||
{-1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 4, 4, 4, 6, 6, 6, 6, 7, 8, 8, 9, 9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25}, // Low
|
||||
{-1, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5, 5, 8, 9, 9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49}, // Medium
|
||||
{-1, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8, 8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68}, // Quartile
|
||||
{-1, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81}, // High
|
||||
};
|
||||
|
||||
// For automatic mask pattern selection.
|
||||
static const int PENALTY_N1 = 3;
|
||||
static const int PENALTY_N2 = 3;
|
||||
static const int PENALTY_N3 = 40;
|
||||
static const int PENALTY_N4 = 10;
|
||||
|
||||
|
||||
|
||||
/*---- High-level QR Code encoding functions ----*/
|
||||
|
||||
bool qrcodegen_encodeText(const char *text, uint8_t tempBuffer[], uint8_t qrcode[],
|
||||
enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl) {
|
||||
|
||||
size_t textLen = strlen(text);
|
||||
if (textLen == 0)
|
||||
return qrcodegen_encodeSegmentsAdvanced(NULL, 0, ecl, minVersion, maxVersion, mask, boostEcl, tempBuffer, qrcode);
|
||||
size_t bufLen = (size_t)qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion);
|
||||
|
||||
struct qrcodegen_Segment seg;
|
||||
if (qrcodegen_isNumeric(text)) {
|
||||
if (qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_NUMERIC, textLen) > bufLen)
|
||||
goto fail;
|
||||
seg = qrcodegen_makeNumeric(text, tempBuffer);
|
||||
} else if (qrcodegen_isAlphanumeric(text)) {
|
||||
if (qrcodegen_calcSegmentBufferSize(qrcodegen_Mode_ALPHANUMERIC, textLen) > bufLen)
|
||||
goto fail;
|
||||
seg = qrcodegen_makeAlphanumeric(text, tempBuffer);
|
||||
} else {
|
||||
if (textLen > bufLen)
|
||||
goto fail;
|
||||
for (size_t i = 0; i < textLen; i++)
|
||||
tempBuffer[i] = (uint8_t)text[i];
|
||||
seg.mode = qrcodegen_Mode_BYTE;
|
||||
seg.bitLength = calcSegmentBitLength(seg.mode, textLen);
|
||||
if (seg.bitLength == LENGTH_OVERFLOW)
|
||||
goto fail;
|
||||
seg.numChars = (int)textLen;
|
||||
seg.data = tempBuffer;
|
||||
}
|
||||
return qrcodegen_encodeSegmentsAdvanced(&seg, 1, ecl, minVersion, maxVersion, mask, boostEcl, tempBuffer, qrcode);
|
||||
|
||||
fail:
|
||||
qrcode[0] = 0; // Set size to invalid value for safety
|
||||
return false;
|
||||
}
|
||||
|
||||
|
||||
bool qrcodegen_encodeBinary(uint8_t dataAndTemp[], size_t dataLen, uint8_t qrcode[],
|
||||
enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl) {
|
||||
|
||||
struct qrcodegen_Segment seg;
|
||||
seg.mode = qrcodegen_Mode_BYTE;
|
||||
seg.bitLength = calcSegmentBitLength(seg.mode, dataLen);
|
||||
if (seg.bitLength == LENGTH_OVERFLOW) {
|
||||
qrcode[0] = 0; // Set size to invalid value for safety
|
||||
return false;
|
||||
}
|
||||
seg.numChars = (int)dataLen;
|
||||
seg.data = dataAndTemp;
|
||||
return qrcodegen_encodeSegmentsAdvanced(&seg, 1, ecl, minVersion, maxVersion, mask, boostEcl, dataAndTemp, qrcode);
|
||||
}
|
||||
|
||||
|
||||
testable void appendBitsToBuffer(unsigned int val, int numBits, uint8_t buffer[], int *bitLen) {
|
||||
assert(0 <= numBits && numBits <= 16 && (unsigned long)val >> numBits == 0);
|
||||
for (int i = numBits - 1; i >= 0; i--, (*bitLen)++)
|
||||
buffer[*bitLen >> 3] |= ((val >> i) & 1) << (7 - (*bitLen & 7));
|
||||
}
|
||||
|
||||
|
||||
|
||||
/*---- Low-level QR Code encoding functions ----*/
|
||||
|
||||
bool qrcodegen_encodeSegments(const struct qrcodegen_Segment segs[], size_t len,
|
||||
enum qrcodegen_Ecc ecl, uint8_t tempBuffer[], uint8_t qrcode[]) {
|
||||
return qrcodegen_encodeSegmentsAdvanced(segs, len, ecl,
|
||||
qrcodegen_VERSION_MIN, qrcodegen_VERSION_MAX, qrcodegen_Mask_AUTO, true, tempBuffer, qrcode);
|
||||
}
|
||||
|
||||
|
||||
bool qrcodegen_encodeSegmentsAdvanced(const struct qrcodegen_Segment segs[], size_t len, enum qrcodegen_Ecc ecl,
|
||||
int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl, uint8_t tempBuffer[], uint8_t qrcode[]) {
|
||||
assert(segs != NULL || len == 0);
|
||||
assert(qrcodegen_VERSION_MIN <= minVersion && minVersion <= maxVersion && maxVersion <= qrcodegen_VERSION_MAX);
|
||||
assert(0 <= (int)ecl && (int)ecl <= 3 && -1 <= (int)mask && (int)mask <= 7);
|
||||
|
||||
// Find the minimal version number to use
|
||||
int version, dataUsedBits;
|
||||
for (version = minVersion; ; version++) {
|
||||
int dataCapacityBits = getNumDataCodewords(version, ecl) * 8; // Number of data bits available
|
||||
dataUsedBits = getTotalBits(segs, len, version);
|
||||
if (dataUsedBits != LENGTH_OVERFLOW && dataUsedBits <= dataCapacityBits)
|
||||
break; // This version number is found to be suitable
|
||||
if (version >= maxVersion) { // All versions in the range could not fit the given data
|
||||
qrcode[0] = 0; // Set size to invalid value for safety
|
||||
return false;
|
||||
}
|
||||
}
|
||||
assert(dataUsedBits != LENGTH_OVERFLOW);
|
||||
|
||||
// Increase the error correction level while the data still fits in the current version number
|
||||
for (int i = (int)qrcodegen_Ecc_MEDIUM; i <= (int)qrcodegen_Ecc_HIGH; i++) { // From low to high
|
||||
if (boostEcl && dataUsedBits <= getNumDataCodewords(version, (enum qrcodegen_Ecc)i) * 8)
|
||||
ecl = (enum qrcodegen_Ecc)i;
|
||||
}
|
||||
|
||||
// Concatenate all segments to create the data bit string
|
||||
memset(qrcode, 0, (size_t)qrcodegen_BUFFER_LEN_FOR_VERSION(version) * sizeof(qrcode[0]));
|
||||
int bitLen = 0;
|
||||
for (size_t i = 0; i < len; i++) {
|
||||
const struct qrcodegen_Segment *seg = &segs[i];
|
||||
appendBitsToBuffer((unsigned int)seg->mode, 4, qrcode, &bitLen);
|
||||
appendBitsToBuffer((unsigned int)seg->numChars, numCharCountBits(seg->mode, version), qrcode, &bitLen);
|
||||
for (int j = 0; j < seg->bitLength; j++) {
|
||||
int bit = (seg->data[j >> 3] >> (7 - (j & 7))) & 1;
|
||||
appendBitsToBuffer((unsigned int)bit, 1, qrcode, &bitLen);
|
||||
}
|
||||
}
|
||||
assert(bitLen == dataUsedBits);
|
||||
|
||||
// Add terminator and pad up to a byte if applicable
|
||||
int dataCapacityBits = getNumDataCodewords(version, ecl) * 8;
|
||||
assert(bitLen <= dataCapacityBits);
|
||||
int terminatorBits = dataCapacityBits - bitLen;
|
||||
if (terminatorBits > 4)
|
||||
terminatorBits = 4;
|
||||
appendBitsToBuffer(0, terminatorBits, qrcode, &bitLen);
|
||||
appendBitsToBuffer(0, (8 - bitLen % 8) % 8, qrcode, &bitLen);
|
||||
assert(bitLen % 8 == 0);
|
||||
|
||||
// Pad with alternating bytes until data capacity is reached
|
||||
for (uint8_t padByte = 0xEC; bitLen < dataCapacityBits; padByte ^= 0xEC ^ 0x11)
|
||||
appendBitsToBuffer(padByte, 8, qrcode, &bitLen);
|
||||
|
||||
// Compute ECC, draw modules
|
||||
addEccAndInterleave(qrcode, version, ecl, tempBuffer);
|
||||
initializeFunctionModules(version, qrcode);
|
||||
drawCodewords(tempBuffer, getNumRawDataModules(version) / 8, qrcode);
|
||||
drawLightFunctionModules(qrcode, version);
|
||||
initializeFunctionModules(version, tempBuffer);
|
||||
|
||||
// Do masking
|
||||
if (mask == qrcodegen_Mask_AUTO) { // Automatically choose best mask
|
||||
long minPenalty = LONG_MAX;
|
||||
for (int i = 0; i < 8; i++) {
|
||||
enum qrcodegen_Mask msk = (enum qrcodegen_Mask)i;
|
||||
applyMask(tempBuffer, qrcode, msk);
|
||||
drawFormatBits(ecl, msk, qrcode);
|
||||
long penalty = getPenaltyScore(qrcode);
|
||||
if (penalty < minPenalty) {
|
||||
mask = msk;
|
||||
minPenalty = penalty;
|
||||
}
|
||||
applyMask(tempBuffer, qrcode, msk); // Undoes the mask due to XOR
|
||||
}
|
||||
}
|
||||
assert(0 <= (int)mask && (int)mask <= 7);
|
||||
applyMask(tempBuffer, qrcode, mask); // Apply the final choice of mask
|
||||
drawFormatBits(ecl, mask, qrcode); // Overwrite old format bits
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/*---- Error correction code generation functions ----*/
|
||||
|
||||
testable void addEccAndInterleave(uint8_t data[], int version, enum qrcodegen_Ecc ecl, uint8_t result[]) {
|
||||
assert(0 <= (int)ecl && (int)ecl < 4 && qrcodegen_VERSION_MIN <= version && version <= qrcodegen_VERSION_MAX);
|
||||
int numBlocks = NUM_ERROR_CORRECTION_BLOCKS[(int)ecl][version];
|
||||
int blockEccLen = ECC_CODEWORDS_PER_BLOCK [(int)ecl][version];
|
||||
int rawCodewords = getNumRawDataModules(version) / 8;
|
||||
int dataLen = getNumDataCodewords(version, ecl);
|
||||
int numShortBlocks = numBlocks - rawCodewords % numBlocks;
|
||||
int shortBlockDataLen = rawCodewords / numBlocks - blockEccLen;
|
||||
|
||||
uint8_t rsdiv[qrcodegen_REED_SOLOMON_DEGREE_MAX];
|
||||
reedSolomonComputeDivisor(blockEccLen, rsdiv);
|
||||
const uint8_t *dat = data;
|
||||
for (int i = 0; i < numBlocks; i++) {
|
||||
int datLen = shortBlockDataLen + (i < numShortBlocks ? 0 : 1);
|
||||
uint8_t *ecc = &data[dataLen]; // Temporary storage
|
||||
reedSolomonComputeRemainder(dat, datLen, rsdiv, blockEccLen, ecc);
|
||||
for (int j = 0, k = i; j < datLen; j++, k += numBlocks) { // Copy data
|
||||
if (j == shortBlockDataLen)
|
||||
k -= numShortBlocks;
|
||||
result[k] = dat[j];
|
||||
}
|
||||
for (int j = 0, k = dataLen + i; j < blockEccLen; j++, k += numBlocks) // Copy ECC
|
||||
result[k] = ecc[j];
|
||||
dat += datLen;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
testable int getNumDataCodewords(int version, enum qrcodegen_Ecc ecl) {
|
||||
int v = version, e = (int)ecl;
|
||||
assert(0 <= e && e < 4);
|
||||
return getNumRawDataModules(v) / 8
|
||||
- ECC_CODEWORDS_PER_BLOCK [e][v]
|
||||
* NUM_ERROR_CORRECTION_BLOCKS[e][v];
|
||||
}
|
||||
|
||||
|
||||
testable int getNumRawDataModules(int ver) {
|
||||
assert(qrcodegen_VERSION_MIN <= ver && ver <= qrcodegen_VERSION_MAX);
|
||||
int result = (16 * ver + 128) * ver + 64;
|
||||
if (ver >= 2) {
|
||||
int numAlign = ver / 7 + 2;
|
||||
result -= (25 * numAlign - 10) * numAlign - 55;
|
||||
if (ver >= 7)
|
||||
result -= 36;
|
||||
}
|
||||
assert(208 <= result && result <= 29648);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
/*---- Reed-Solomon ECC generator functions ----*/
|
||||
|
||||
testable void reedSolomonComputeDivisor(int degree, uint8_t result[]) {
|
||||
assert(1 <= degree && degree <= qrcodegen_REED_SOLOMON_DEGREE_MAX);
|
||||
memset(result, 0, (size_t)degree * sizeof(result[0]));
|
||||
result[degree - 1] = 1; // Start off with the monomial x^0
|
||||
|
||||
uint8_t root = 1;
|
||||
for (int i = 0; i < degree; i++) {
|
||||
// Multiply the current product by (x - r^i)
|
||||
for (int j = 0; j < degree; j++) {
|
||||
result[j] = reedSolomonMultiply(result[j], root);
|
||||
if (j + 1 < degree)
|
||||
result[j] ^= result[j + 1];
|
||||
}
|
||||
root = reedSolomonMultiply(root, 0x02);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
testable void reedSolomonComputeRemainder(const uint8_t data[], int dataLen,
|
||||
const uint8_t generator[], int degree, uint8_t result[]) {
|
||||
assert(1 <= degree && degree <= qrcodegen_REED_SOLOMON_DEGREE_MAX);
|
||||
memset(result, 0, (size_t)degree * sizeof(result[0]));
|
||||
for (int i = 0; i < dataLen; i++) { // Polynomial division
|
||||
uint8_t factor = data[i] ^ result[0];
|
||||
memmove(&result[0], &result[1], (size_t)(degree - 1) * sizeof(result[0]));
|
||||
result[degree - 1] = 0;
|
||||
for (int j = 0; j < degree; j++)
|
||||
result[j] ^= reedSolomonMultiply(generator[j], factor);
|
||||
}
|
||||
}
|
||||
|
||||
#undef qrcodegen_REED_SOLOMON_DEGREE_MAX
|
||||
|
||||
|
||||
testable uint8_t reedSolomonMultiply(uint8_t x, uint8_t y) {
|
||||
// Russian peasant multiplication
|
||||
uint8_t z = 0;
|
||||
for (int i = 7; i >= 0; i--) {
|
||||
z = (uint8_t)((z << 1) ^ ((z >> 7) * 0x11D));
|
||||
z ^= ((y >> i) & 1) * x;
|
||||
}
|
||||
return z;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/*---- Drawing function modules ----*/
|
||||
|
||||
testable void initializeFunctionModules(int version, uint8_t qrcode[]) {
|
||||
int qrsize = version * 4 + 17;
|
||||
memset(qrcode, 0, (size_t)((qrsize * qrsize + 7) / 8 + 1) * sizeof(qrcode[0]));
|
||||
qrcode[0] = (uint8_t)qrsize;
|
||||
|
||||
// Fill horizontal and vertical timing patterns
|
||||
fillRectangle(6, 0, 1, qrsize, qrcode);
|
||||
fillRectangle(0, 6, qrsize, 1, qrcode);
|
||||
|
||||
// Fill 3 finder patterns (all corners except bottom right) and format bits
|
||||
fillRectangle(0, 0, 9, 9, qrcode);
|
||||
fillRectangle(qrsize - 8, 0, 8, 9, qrcode);
|
||||
fillRectangle(0, qrsize - 8, 9, 8, qrcode);
|
||||
|
||||
// Fill numerous alignment patterns
|
||||
uint8_t alignPatPos[7];
|
||||
int numAlign = getAlignmentPatternPositions(version, alignPatPos);
|
||||
for (int i = 0; i < numAlign; i++) {
|
||||
for (int j = 0; j < numAlign; j++) {
|
||||
// Don't draw on the three finder corners
|
||||
if (!((i == 0 && j == 0) || (i == 0 && j == numAlign - 1) || (i == numAlign - 1 && j == 0)))
|
||||
fillRectangle(alignPatPos[i] - 2, alignPatPos[j] - 2, 5, 5, qrcode);
|
||||
}
|
||||
}
|
||||
|
||||
// Fill version blocks
|
||||
if (version >= 7) {
|
||||
fillRectangle(qrsize - 11, 0, 3, 6, qrcode);
|
||||
fillRectangle(0, qrsize - 11, 6, 3, qrcode);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
static void drawLightFunctionModules(uint8_t qrcode[], int version) {
|
||||
// Draw horizontal and vertical timing patterns
|
||||
int qrsize = qrcodegen_getSize(qrcode);
|
||||
for (int i = 7; i < qrsize - 7; i += 2) {
|
||||
setModuleBounded(qrcode, 6, i, false);
|
||||
setModuleBounded(qrcode, i, 6, false);
|
||||
}
|
||||
|
||||
// Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules)
|
||||
for (int dy = -4; dy <= 4; dy++) {
|
||||
for (int dx = -4; dx <= 4; dx++) {
|
||||
int dist = abs(dx);
|
||||
if (abs(dy) > dist)
|
||||
dist = abs(dy);
|
||||
if (dist == 2 || dist == 4) {
|
||||
setModuleUnbounded(qrcode, 3 + dx, 3 + dy, false);
|
||||
setModuleUnbounded(qrcode, qrsize - 4 + dx, 3 + dy, false);
|
||||
setModuleUnbounded(qrcode, 3 + dx, qrsize - 4 + dy, false);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Draw numerous alignment patterns
|
||||
uint8_t alignPatPos[7];
|
||||
int numAlign = getAlignmentPatternPositions(version, alignPatPos);
|
||||
for (int i = 0; i < numAlign; i++) {
|
||||
for (int j = 0; j < numAlign; j++) {
|
||||
if ((i == 0 && j == 0) || (i == 0 && j == numAlign - 1) || (i == numAlign - 1 && j == 0))
|
||||
continue; // Don't draw on the three finder corners
|
||||
for (int dy = -1; dy <= 1; dy++) {
|
||||
for (int dx = -1; dx <= 1; dx++)
|
||||
setModuleBounded(qrcode, alignPatPos[i] + dx, alignPatPos[j] + dy, dx == 0 && dy == 0);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Draw version blocks
|
||||
if (version >= 7) {
|
||||
int rem = version; // version is uint6, in the range [7, 40]
|
||||
for (int i = 0; i < 12; i++)
|
||||
rem = (rem << 1) ^ ((rem >> 11) * 0x1F25);
|
||||
long bits = (long)version << 12 | rem; // uint18
|
||||
assert(bits >> 18 == 0);
|
||||
|
||||
for (int i = 0; i < 6; i++) {
|
||||
for (int j = 0; j < 3; j++) {
|
||||
int k = qrsize - 11 + j;
|
||||
setModuleBounded(qrcode, k, i, (bits & 1) != 0);
|
||||
setModuleBounded(qrcode, i, k, (bits & 1) != 0);
|
||||
bits >>= 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
static void drawFormatBits(enum qrcodegen_Ecc ecl, enum qrcodegen_Mask mask, uint8_t qrcode[]) {
|
||||
assert(0 <= (int)mask && (int)mask <= 7);
|
||||
static const int table[] = {1, 0, 3, 2};
|
||||
int data = table[(int)ecl] << 3 | (int)mask; // errCorrLvl is uint2, mask is uint3
|
||||
int rem = data;
|
||||
for (int i = 0; i < 10; i++)
|
||||
rem = (rem << 1) ^ ((rem >> 9) * 0x537);
|
||||
int bits = (data << 10 | rem) ^ 0x5412; // uint15
|
||||
assert(bits >> 15 == 0);
|
||||
|
||||
// Draw first copy
|
||||
for (int i = 0; i <= 5; i++)
|
||||
setModuleBounded(qrcode, 8, i, getBit(bits, i));
|
||||
setModuleBounded(qrcode, 8, 7, getBit(bits, 6));
|
||||
setModuleBounded(qrcode, 8, 8, getBit(bits, 7));
|
||||
setModuleBounded(qrcode, 7, 8, getBit(bits, 8));
|
||||
for (int i = 9; i < 15; i++)
|
||||
setModuleBounded(qrcode, 14 - i, 8, getBit(bits, i));
|
||||
|
||||
// Draw second copy
|
||||
int qrsize = qrcodegen_getSize(qrcode);
|
||||
for (int i = 0; i < 8; i++)
|
||||
setModuleBounded(qrcode, qrsize - 1 - i, 8, getBit(bits, i));
|
||||
for (int i = 8; i < 15; i++)
|
||||
setModuleBounded(qrcode, 8, qrsize - 15 + i, getBit(bits, i));
|
||||
setModuleBounded(qrcode, 8, qrsize - 8, true); // Always dark
|
||||
}
|
||||
|
||||
|
||||
testable int getAlignmentPatternPositions(int version, uint8_t result[7]) {
|
||||
if (version == 1)
|
||||
return 0;
|
||||
int numAlign = version / 7 + 2;
|
||||
int step = (version * 8 + numAlign * 3 + 5) / (numAlign * 4 - 4) * 2;
|
||||
for (int i = numAlign - 1, pos = version * 4 + 10; i >= 1; i--, pos -= step)
|
||||
result[i] = (uint8_t)pos;
|
||||
result[0] = 6;
|
||||
return numAlign;
|
||||
}
|
||||
|
||||
|
||||
static void fillRectangle(int left, int top, int width, int height, uint8_t qrcode[]) {
|
||||
for (int dy = 0; dy < height; dy++) {
|
||||
for (int dx = 0; dx < width; dx++)
|
||||
setModuleBounded(qrcode, left + dx, top + dy, true);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
/*---- Drawing data modules and masking ----*/
|
||||
|
||||
static void drawCodewords(const uint8_t data[], int dataLen, uint8_t qrcode[]) {
|
||||
int qrsize = qrcodegen_getSize(qrcode);
|
||||
int i = 0; // Bit index into the data
|
||||
// Do the funny zigzag scan
|
||||
for (int right = qrsize - 1; right >= 1; right -= 2) { // Index of right column in each column pair
|
||||
if (right == 6)
|
||||
right = 5;
|
||||
for (int vert = 0; vert < qrsize; vert++) { // Vertical counter
|
||||
for (int j = 0; j < 2; j++) {
|
||||
int x = right - j; // Actual x coordinate
|
||||
bool upward = ((right + 1) & 2) == 0;
|
||||
int y = upward ? qrsize - 1 - vert : vert; // Actual y coordinate
|
||||
if (!getModuleBounded(qrcode, x, y) && i < dataLen * 8) {
|
||||
bool dark = getBit(data[i >> 3], 7 - (i & 7));
|
||||
setModuleBounded(qrcode, x, y, dark);
|
||||
i++;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
assert(i == dataLen * 8);
|
||||
}
|
||||
|
||||
|
||||
static void applyMask(const uint8_t functionModules[], uint8_t qrcode[], enum qrcodegen_Mask mask) {
|
||||
assert(0 <= (int)mask && (int)mask <= 7); // Disallows qrcodegen_Mask_AUTO
|
||||
int qrsize = qrcodegen_getSize(qrcode);
|
||||
for (int y = 0; y < qrsize; y++) {
|
||||
for (int x = 0; x < qrsize; x++) {
|
||||
if (getModuleBounded(functionModules, x, y))
|
||||
continue;
|
||||
bool invert;
|
||||
switch ((int)mask) {
|
||||
case 0: invert = (x + y) % 2 == 0; break;
|
||||
case 1: invert = y % 2 == 0; break;
|
||||
case 2: invert = x % 3 == 0; break;
|
||||
case 3: invert = (x + y) % 3 == 0; break;
|
||||
case 4: invert = (x / 3 + y / 2) % 2 == 0; break;
|
||||
case 5: invert = x * y % 2 + x * y % 3 == 0; break;
|
||||
case 6: invert = (x * y % 2 + x * y % 3) % 2 == 0; break;
|
||||
case 7: invert = ((x + y) % 2 + x * y % 3) % 2 == 0; break;
|
||||
default: assert(false); return;
|
||||
}
|
||||
bool val = getModuleBounded(qrcode, x, y);
|
||||
setModuleBounded(qrcode, x, y, val ^ invert);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
static long getPenaltyScore(const uint8_t qrcode[]) {
|
||||
int qrsize = qrcodegen_getSize(qrcode);
|
||||
long result = 0;
|
||||
|
||||
// Adjacent modules in row having same color, and finder-like patterns
|
||||
for (int y = 0; y < qrsize; y++) {
|
||||
bool runColor = false;
|
||||
int runX = 0;
|
||||
int runHistory[7] = {0};
|
||||
for (int x = 0; x < qrsize; x++) {
|
||||
if (getModuleBounded(qrcode, x, y) == runColor) {
|
||||
runX++;
|
||||
if (runX == 5)
|
||||
result += PENALTY_N1;
|
||||
else if (runX > 5)
|
||||
result++;
|
||||
} else {
|
||||
finderPenaltyAddHistory(runX, runHistory, qrsize);
|
||||
if (!runColor)
|
||||
result += finderPenaltyCountPatterns(runHistory, qrsize) * PENALTY_N3;
|
||||
runColor = getModuleBounded(qrcode, x, y);
|
||||
runX = 1;
|
||||
}
|
||||
}
|
||||
result += finderPenaltyTerminateAndCount(runColor, runX, runHistory, qrsize) * PENALTY_N3;
|
||||
}
|
||||
// Adjacent modules in column having same color, and finder-like patterns
|
||||
for (int x = 0; x < qrsize; x++) {
|
||||
bool runColor = false;
|
||||
int runY = 0;
|
||||
int runHistory[7] = {0};
|
||||
for (int y = 0; y < qrsize; y++) {
|
||||
if (getModuleBounded(qrcode, x, y) == runColor) {
|
||||
runY++;
|
||||
if (runY == 5)
|
||||
result += PENALTY_N1;
|
||||
else if (runY > 5)
|
||||
result++;
|
||||
} else {
|
||||
finderPenaltyAddHistory(runY, runHistory, qrsize);
|
||||
if (!runColor)
|
||||
result += finderPenaltyCountPatterns(runHistory, qrsize) * PENALTY_N3;
|
||||
runColor = getModuleBounded(qrcode, x, y);
|
||||
runY = 1;
|
||||
}
|
||||
}
|
||||
result += finderPenaltyTerminateAndCount(runColor, runY, runHistory, qrsize) * PENALTY_N3;
|
||||
}
|
||||
|
||||
// 2*2 blocks of modules having same color
|
||||
for (int y = 0; y < qrsize - 1; y++) {
|
||||
for (int x = 0; x < qrsize - 1; x++) {
|
||||
bool color = getModuleBounded(qrcode, x, y);
|
||||
if ( color == getModuleBounded(qrcode, x + 1, y) &&
|
||||
color == getModuleBounded(qrcode, x, y + 1) &&
|
||||
color == getModuleBounded(qrcode, x + 1, y + 1))
|
||||
result += PENALTY_N2;
|
||||
}
|
||||
}
|
||||
|
||||
// Balance of dark and light modules
|
||||
int dark = 0;
|
||||
for (int y = 0; y < qrsize; y++) {
|
||||
for (int x = 0; x < qrsize; x++) {
|
||||
if (getModuleBounded(qrcode, x, y))
|
||||
dark++;
|
||||
}
|
||||
}
|
||||
int total = qrsize * qrsize; // Note that size is odd, so dark/total != 1/2
|
||||
int k = (int)((labs(dark * 20L - total * 10L) + total - 1) / total) - 1;
|
||||
assert(0 <= k && k <= 9);
|
||||
result += k * PENALTY_N4;
|
||||
assert(0 <= result && result <= 2568888L);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
static int finderPenaltyCountPatterns(const int runHistory[7], int qrsize) {
|
||||
int n = runHistory[1];
|
||||
assert(n <= qrsize * 3); (void)qrsize;
|
||||
bool core = n > 0 && runHistory[2] == n && runHistory[3] == n * 3 && runHistory[4] == n && runHistory[5] == n;
|
||||
return (core && runHistory[0] >= n * 4 && runHistory[6] >= n ? 1 : 0)
|
||||
+ (core && runHistory[6] >= n * 4 && runHistory[0] >= n ? 1 : 0);
|
||||
}
|
||||
|
||||
|
||||
static int finderPenaltyTerminateAndCount(bool currentRunColor, int currentRunLength, int runHistory[7], int qrsize) {
|
||||
if (currentRunColor) { // Terminate dark run
|
||||
finderPenaltyAddHistory(currentRunLength, runHistory, qrsize);
|
||||
currentRunLength = 0;
|
||||
}
|
||||
currentRunLength += qrsize; // Add light border to final run
|
||||
finderPenaltyAddHistory(currentRunLength, runHistory, qrsize);
|
||||
return finderPenaltyCountPatterns(runHistory, qrsize);
|
||||
}
|
||||
|
||||
|
||||
static void finderPenaltyAddHistory(int currentRunLength, int runHistory[7], int qrsize) {
|
||||
if (runHistory[0] == 0)
|
||||
currentRunLength += qrsize; // Add light border to initial run
|
||||
memmove(&runHistory[1], &runHistory[0], 6 * sizeof(runHistory[0]));
|
||||
runHistory[0] = currentRunLength;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/*---- Basic QR Code information ----*/
|
||||
|
||||
int qrcodegen_getSize(const uint8_t qrcode[]) {
|
||||
assert(qrcode != NULL);
|
||||
int result = qrcode[0];
|
||||
assert((qrcodegen_VERSION_MIN * 4 + 17) <= result
|
||||
&& result <= (qrcodegen_VERSION_MAX * 4 + 17));
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
bool qrcodegen_getModule(const uint8_t qrcode[], int x, int y) {
|
||||
assert(qrcode != NULL);
|
||||
int qrsize = qrcode[0];
|
||||
return (0 <= x && x < qrsize && 0 <= y && y < qrsize) && getModuleBounded(qrcode, x, y);
|
||||
}
|
||||
|
||||
|
||||
testable bool getModuleBounded(const uint8_t qrcode[], int x, int y) {
|
||||
int qrsize = qrcode[0];
|
||||
assert(21 <= qrsize && qrsize <= 177 && 0 <= x && x < qrsize && 0 <= y && y < qrsize);
|
||||
int index = y * qrsize + x;
|
||||
return getBit(qrcode[(index >> 3) + 1], index & 7);
|
||||
}
|
||||
|
||||
|
||||
testable void setModuleBounded(uint8_t qrcode[], int x, int y, bool isDark) {
|
||||
int qrsize = qrcode[0];
|
||||
assert(21 <= qrsize && qrsize <= 177 && 0 <= x && x < qrsize && 0 <= y && y < qrsize);
|
||||
int index = y * qrsize + x;
|
||||
int bitIndex = index & 7;
|
||||
int byteIndex = (index >> 3) + 1;
|
||||
if (isDark)
|
||||
qrcode[byteIndex] |= 1 << bitIndex;
|
||||
else
|
||||
qrcode[byteIndex] &= (1 << bitIndex) ^ 0xFF;
|
||||
}
|
||||
|
||||
|
||||
testable void setModuleUnbounded(uint8_t qrcode[], int x, int y, bool isDark) {
|
||||
int qrsize = qrcode[0];
|
||||
if (0 <= x && x < qrsize && 0 <= y && y < qrsize)
|
||||
setModuleBounded(qrcode, x, y, isDark);
|
||||
}
|
||||
|
||||
|
||||
static bool getBit(int x, int i) {
|
||||
return ((x >> i) & 1) != 0;
|
||||
}
|
||||
|
||||
|
||||
|
||||
/*---- Segment handling ----*/
|
||||
|
||||
bool qrcodegen_isNumeric(const char *text) {
|
||||
assert(text != NULL);
|
||||
for (; *text != '\0'; text++) {
|
||||
if (*text < '0' || *text > '9')
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
bool qrcodegen_isAlphanumeric(const char *text) {
|
||||
assert(text != NULL);
|
||||
for (; *text != '\0'; text++) {
|
||||
if (strchr(ALPHANUMERIC_CHARSET, *text) == NULL)
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
size_t qrcodegen_calcSegmentBufferSize(enum qrcodegen_Mode mode, size_t numChars) {
|
||||
int temp = calcSegmentBitLength(mode, numChars);
|
||||
if (temp == LENGTH_OVERFLOW)
|
||||
return SIZE_MAX;
|
||||
assert(0 <= temp && temp <= INT16_MAX);
|
||||
return ((size_t)temp + 7) / 8;
|
||||
}
|
||||
|
||||
|
||||
testable int calcSegmentBitLength(enum qrcodegen_Mode mode, size_t numChars) {
|
||||
if (numChars > (unsigned int)INT16_MAX)
|
||||
return LENGTH_OVERFLOW;
|
||||
long result = (long)numChars;
|
||||
if (mode == qrcodegen_Mode_NUMERIC)
|
||||
result = (result * 10 + 2) / 3;
|
||||
else if (mode == qrcodegen_Mode_ALPHANUMERIC)
|
||||
result = (result * 11 + 1) / 2;
|
||||
else if (mode == qrcodegen_Mode_BYTE)
|
||||
result *= 8;
|
||||
else if (mode == qrcodegen_Mode_KANJI)
|
||||
result *= 13;
|
||||
else if (mode == qrcodegen_Mode_ECI && numChars == 0)
|
||||
result = 3 * 8;
|
||||
else {
|
||||
assert(false);
|
||||
return LENGTH_OVERFLOW;
|
||||
}
|
||||
assert(result >= 0);
|
||||
if (result > INT16_MAX)
|
||||
return LENGTH_OVERFLOW;
|
||||
return (int)result;
|
||||
}
|
||||
|
||||
|
||||
struct qrcodegen_Segment qrcodegen_makeBytes(const uint8_t data[], size_t len, uint8_t buf[]) {
|
||||
assert(data != NULL || len == 0);
|
||||
struct qrcodegen_Segment result;
|
||||
result.mode = qrcodegen_Mode_BYTE;
|
||||
result.bitLength = calcSegmentBitLength(result.mode, len);
|
||||
assert(result.bitLength != LENGTH_OVERFLOW);
|
||||
result.numChars = (int)len;
|
||||
if (len > 0)
|
||||
memcpy(buf, data, len * sizeof(buf[0]));
|
||||
result.data = buf;
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
struct qrcodegen_Segment qrcodegen_makeNumeric(const char *digits, uint8_t buf[]) {
|
||||
assert(digits != NULL);
|
||||
struct qrcodegen_Segment result;
|
||||
size_t len = strlen(digits);
|
||||
result.mode = qrcodegen_Mode_NUMERIC;
|
||||
int bitLen = calcSegmentBitLength(result.mode, len);
|
||||
assert(bitLen != LENGTH_OVERFLOW);
|
||||
result.numChars = (int)len;
|
||||
if (bitLen > 0)
|
||||
memset(buf, 0, ((size_t)bitLen + 7) / 8 * sizeof(buf[0]));
|
||||
result.bitLength = 0;
|
||||
|
||||
unsigned int accumData = 0;
|
||||
int accumCount = 0;
|
||||
for (; *digits != '\0'; digits++) {
|
||||
char c = *digits;
|
||||
assert('0' <= c && c <= '9');
|
||||
accumData = accumData * 10 + (unsigned int)(c - '0');
|
||||
accumCount++;
|
||||
if (accumCount == 3) {
|
||||
appendBitsToBuffer(accumData, 10, buf, &result.bitLength);
|
||||
accumData = 0;
|
||||
accumCount = 0;
|
||||
}
|
||||
}
|
||||
if (accumCount > 0)
|
||||
appendBitsToBuffer(accumData, accumCount * 3 + 1, buf, &result.bitLength);
|
||||
assert(result.bitLength == bitLen);
|
||||
result.data = buf;
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
struct qrcodegen_Segment qrcodegen_makeAlphanumeric(const char *text, uint8_t buf[]) {
|
||||
assert(text != NULL);
|
||||
struct qrcodegen_Segment result;
|
||||
size_t len = strlen(text);
|
||||
result.mode = qrcodegen_Mode_ALPHANUMERIC;
|
||||
int bitLen = calcSegmentBitLength(result.mode, len);
|
||||
assert(bitLen != LENGTH_OVERFLOW);
|
||||
result.numChars = (int)len;
|
||||
if (bitLen > 0)
|
||||
memset(buf, 0, ((size_t)bitLen + 7) / 8 * sizeof(buf[0]));
|
||||
result.bitLength = 0;
|
||||
|
||||
unsigned int accumData = 0;
|
||||
int accumCount = 0;
|
||||
for (; *text != '\0'; text++) {
|
||||
const char *temp = strchr(ALPHANUMERIC_CHARSET, *text);
|
||||
assert(temp != NULL);
|
||||
accumData = accumData * 45 + (unsigned int)(temp - ALPHANUMERIC_CHARSET);
|
||||
accumCount++;
|
||||
if (accumCount == 2) {
|
||||
appendBitsToBuffer(accumData, 11, buf, &result.bitLength);
|
||||
accumData = 0;
|
||||
accumCount = 0;
|
||||
}
|
||||
}
|
||||
if (accumCount > 0)
|
||||
appendBitsToBuffer(accumData, 6, buf, &result.bitLength);
|
||||
assert(result.bitLength == bitLen);
|
||||
result.data = buf;
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
struct qrcodegen_Segment qrcodegen_makeEci(long assignVal, uint8_t buf[]) {
|
||||
struct qrcodegen_Segment result;
|
||||
result.mode = qrcodegen_Mode_ECI;
|
||||
result.numChars = 0;
|
||||
result.bitLength = 0;
|
||||
if (assignVal < 0)
|
||||
assert(false);
|
||||
else if (assignVal < (1 << 7)) {
|
||||
memset(buf, 0, 1 * sizeof(buf[0]));
|
||||
appendBitsToBuffer((unsigned int)assignVal, 8, buf, &result.bitLength);
|
||||
} else if (assignVal < (1 << 14)) {
|
||||
memset(buf, 0, 2 * sizeof(buf[0]));
|
||||
appendBitsToBuffer(2, 2, buf, &result.bitLength);
|
||||
appendBitsToBuffer((unsigned int)assignVal, 14, buf, &result.bitLength);
|
||||
} else if (assignVal < 1000000L) {
|
||||
memset(buf, 0, 3 * sizeof(buf[0]));
|
||||
appendBitsToBuffer(6, 3, buf, &result.bitLength);
|
||||
appendBitsToBuffer((unsigned int)(assignVal >> 10), 11, buf, &result.bitLength);
|
||||
appendBitsToBuffer((unsigned int)(assignVal & 0x3FF), 10, buf, &result.bitLength);
|
||||
} else
|
||||
assert(false);
|
||||
result.data = buf;
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
testable int getTotalBits(const struct qrcodegen_Segment segs[], size_t len, int version) {
|
||||
assert(segs != NULL || len == 0);
|
||||
long result = 0;
|
||||
for (size_t i = 0; i < len; i++) {
|
||||
int numChars = segs[i].numChars;
|
||||
int bitLength = segs[i].bitLength;
|
||||
assert(0 <= numChars && numChars <= INT16_MAX);
|
||||
assert(0 <= bitLength && bitLength <= INT16_MAX);
|
||||
int ccbits = numCharCountBits(segs[i].mode, version);
|
||||
assert(0 <= ccbits && ccbits <= 16);
|
||||
if (numChars >= (1L << ccbits))
|
||||
return LENGTH_OVERFLOW;
|
||||
result += 4L + ccbits + bitLength;
|
||||
if (result > INT16_MAX)
|
||||
return LENGTH_OVERFLOW;
|
||||
}
|
||||
assert(0 <= result && result <= INT16_MAX);
|
||||
return (int)result;
|
||||
}
|
||||
|
||||
|
||||
static int numCharCountBits(enum qrcodegen_Mode mode, int version) {
|
||||
assert(qrcodegen_VERSION_MIN <= version && version <= qrcodegen_VERSION_MAX);
|
||||
int i = (version + 7) / 17;
|
||||
switch (mode) {
|
||||
case qrcodegen_Mode_NUMERIC : { static const int temp[] = {10, 12, 14}; return temp[i]; }
|
||||
case qrcodegen_Mode_ALPHANUMERIC: { static const int temp[] = { 9, 11, 13}; return temp[i]; }
|
||||
case qrcodegen_Mode_BYTE : { static const int temp[] = { 8, 16, 16}; return temp[i]; }
|
||||
case qrcodegen_Mode_KANJI : { static const int temp[] = { 8, 10, 12}; return temp[i]; }
|
||||
case qrcodegen_Mode_ECI : return 0;
|
||||
default: assert(false); return -1;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
#undef LENGTH_OVERFLOW
|
||||
|
|
@ -0,0 +1,385 @@
|
|||
/*
|
||||
* QR Code generator library (C)
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stddef.h>
|
||||
#include <stdint.h>
|
||||
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
|
||||
/*
|
||||
* This library creates QR Code symbols, which is a type of two-dimension barcode.
|
||||
* Invented by Denso Wave and described in the ISO/IEC 18004 standard.
|
||||
* A QR Code structure is an immutable square grid of dark and light cells.
|
||||
* The library provides functions to create a QR Code from text or binary data.
|
||||
* The library covers the QR Code Model 2 specification, supporting all versions (sizes)
|
||||
* from 1 to 40, all 4 error correction levels, and 4 character encoding modes.
|
||||
*
|
||||
* Ways to create a QR Code object:
|
||||
* - High level: Take the payload data and call qrcodegen_encodeText() or qrcodegen_encodeBinary().
|
||||
* - Low level: Custom-make the list of segments and call
|
||||
* qrcodegen_encodeSegments() or qrcodegen_encodeSegmentsAdvanced().
|
||||
* (Note that all ways require supplying the desired error correction level and various byte buffers.)
|
||||
*/
|
||||
|
||||
|
||||
/*---- Enum and struct types----*/
|
||||
|
||||
/*
|
||||
* The error correction level in a QR Code symbol.
|
||||
*/
|
||||
enum qrcodegen_Ecc {
|
||||
// Must be declared in ascending order of error protection
|
||||
// so that an internal qrcodegen function works properly
|
||||
qrcodegen_Ecc_LOW = 0 , // The QR Code can tolerate about 7% erroneous codewords
|
||||
qrcodegen_Ecc_MEDIUM , // The QR Code can tolerate about 15% erroneous codewords
|
||||
qrcodegen_Ecc_QUARTILE, // The QR Code can tolerate about 25% erroneous codewords
|
||||
qrcodegen_Ecc_HIGH , // The QR Code can tolerate about 30% erroneous codewords
|
||||
};
|
||||
|
||||
|
||||
/*
|
||||
* The mask pattern used in a QR Code symbol.
|
||||
*/
|
||||
enum qrcodegen_Mask {
|
||||
// A special value to tell the QR Code encoder to
|
||||
// automatically select an appropriate mask pattern
|
||||
qrcodegen_Mask_AUTO = -1,
|
||||
// The eight actual mask patterns
|
||||
qrcodegen_Mask_0 = 0,
|
||||
qrcodegen_Mask_1,
|
||||
qrcodegen_Mask_2,
|
||||
qrcodegen_Mask_3,
|
||||
qrcodegen_Mask_4,
|
||||
qrcodegen_Mask_5,
|
||||
qrcodegen_Mask_6,
|
||||
qrcodegen_Mask_7,
|
||||
};
|
||||
|
||||
|
||||
/*
|
||||
* Describes how a segment's data bits are interpreted.
|
||||
*/
|
||||
enum qrcodegen_Mode {
|
||||
qrcodegen_Mode_NUMERIC = 0x1,
|
||||
qrcodegen_Mode_ALPHANUMERIC = 0x2,
|
||||
qrcodegen_Mode_BYTE = 0x4,
|
||||
qrcodegen_Mode_KANJI = 0x8,
|
||||
qrcodegen_Mode_ECI = 0x7,
|
||||
};
|
||||
|
||||
|
||||
/*
|
||||
* A segment of character/binary/control data in a QR Code symbol.
|
||||
* The mid-level way to create a segment is to take the payload data
|
||||
* and call a factory function such as qrcodegen_makeNumeric().
|
||||
* The low-level way to create a segment is to custom-make the bit buffer
|
||||
* and initialize a qrcodegen_Segment struct with appropriate values.
|
||||
* Even in the most favorable conditions, a QR Code can only hold 7089 characters of data.
|
||||
* Any segment longer than this is meaningless for the purpose of generating QR Codes.
|
||||
* Moreover, the maximum allowed bit length is 32767 because
|
||||
* the largest QR Code (version 40) has 31329 modules.
|
||||
*/
|
||||
struct qrcodegen_Segment {
|
||||
// The mode indicator of this segment.
|
||||
enum qrcodegen_Mode mode;
|
||||
|
||||
// The length of this segment's unencoded data. Measured in characters for
|
||||
// numeric/alphanumeric/kanji mode, bytes for byte mode, and 0 for ECI mode.
|
||||
// Always zero or positive. Not the same as the data's bit length.
|
||||
int numChars;
|
||||
|
||||
// The data bits of this segment, packed in bitwise big endian.
|
||||
// Can be null if the bit length is zero.
|
||||
uint8_t *data;
|
||||
|
||||
// The number of valid data bits used in the buffer. Requires
|
||||
// 0 <= bitLength <= 32767, and bitLength <= (capacity of data array) * 8.
|
||||
// The character count (numChars) must agree with the mode and the bit buffer length.
|
||||
int bitLength;
|
||||
};
|
||||
|
||||
|
||||
|
||||
/*---- Macro constants and functions ----*/
|
||||
|
||||
#define qrcodegen_VERSION_MIN 1 // The minimum version number supported in the QR Code Model 2 standard
|
||||
#define qrcodegen_VERSION_MAX 40 // The maximum version number supported in the QR Code Model 2 standard
|
||||
|
||||
// Calculates the number of bytes needed to store any QR Code up to and including the given version number,
|
||||
// as a compile-time constant. For example, 'uint8_t buffer[qrcodegen_BUFFER_LEN_FOR_VERSION(25)];'
|
||||
// can store any single QR Code from version 1 to 25 (inclusive). The result fits in an int (or int16).
|
||||
// Requires qrcodegen_VERSION_MIN <= n <= qrcodegen_VERSION_MAX.
|
||||
#define qrcodegen_BUFFER_LEN_FOR_VERSION(n) ((((n) * 4 + 17) * ((n) * 4 + 17) + 7) / 8 + 1)
|
||||
|
||||
// The worst-case number of bytes needed to store one QR Code, up to and including
|
||||
// version 40. This value equals 3918, which is just under 4 kilobytes.
|
||||
// Use this more convenient value to avoid calculating tighter memory bounds for buffers.
|
||||
#define qrcodegen_BUFFER_LEN_MAX qrcodegen_BUFFER_LEN_FOR_VERSION(qrcodegen_VERSION_MAX)
|
||||
|
||||
|
||||
|
||||
/*---- Functions (high level) to generate QR Codes ----*/
|
||||
|
||||
/*
|
||||
* Encodes the given text string to a QR Code, returning true if successful.
|
||||
* If the data is too long to fit in any version in the given range
|
||||
* at the given ECC level, then false is returned.
|
||||
*
|
||||
* The input text must be encoded in UTF-8 and contain no NULs.
|
||||
* Requires 1 <= minVersion <= maxVersion <= 40.
|
||||
*
|
||||
* The smallest possible QR Code version within the given range is automatically
|
||||
* chosen for the output. Iff boostEcl is true, then the ECC level of the result
|
||||
* may be higher than the ecl argument if it can be done without increasing the
|
||||
* version. The mask is either between qrcodegen_Mask_0 to 7 to force that mask, or
|
||||
* qrcodegen_Mask_AUTO to automatically choose an appropriate mask (which may be slow).
|
||||
*
|
||||
* About the arrays, letting len = qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion):
|
||||
* - Before calling the function:
|
||||
* - The array ranges tempBuffer[0 : len] and qrcode[0 : len] must allow
|
||||
* reading and writing; hence each array must have a length of at least len.
|
||||
* - The two ranges must not overlap (aliasing).
|
||||
* - The initial state of both ranges can be uninitialized
|
||||
* because the function always writes before reading.
|
||||
* - After the function returns:
|
||||
* - Both ranges have no guarantee on which elements are initialized and what values are stored.
|
||||
* - tempBuffer contains no useful data and should be treated as entirely uninitialized.
|
||||
* - If successful, qrcode can be passed into qrcodegen_getSize() and qrcodegen_getModule().
|
||||
*
|
||||
* If successful, the resulting QR Code may use numeric,
|
||||
* alphanumeric, or byte mode to encode the text.
|
||||
*
|
||||
* In the most optimistic case, a QR Code at version 40 with low ECC
|
||||
* can hold any UTF-8 string up to 2953 bytes, or any alphanumeric string
|
||||
* up to 4296 characters, or any digit string up to 7089 characters.
|
||||
* These numbers represent the hard upper limit of the QR Code standard.
|
||||
*
|
||||
* Please consult the QR Code specification for information on
|
||||
* data capacities per version, ECC level, and text encoding mode.
|
||||
*/
|
||||
bool qrcodegen_encodeText(const char *text, uint8_t tempBuffer[], uint8_t qrcode[],
|
||||
enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl);
|
||||
|
||||
|
||||
/*
|
||||
* Encodes the given binary data to a QR Code, returning true if successful.
|
||||
* If the data is too long to fit in any version in the given range
|
||||
* at the given ECC level, then false is returned.
|
||||
*
|
||||
* Requires 1 <= minVersion <= maxVersion <= 40.
|
||||
*
|
||||
* The smallest possible QR Code version within the given range is automatically
|
||||
* chosen for the output. Iff boostEcl is true, then the ECC level of the result
|
||||
* may be higher than the ecl argument if it can be done without increasing the
|
||||
* version. The mask is either between qrcodegen_Mask_0 to 7 to force that mask, or
|
||||
* qrcodegen_Mask_AUTO to automatically choose an appropriate mask (which may be slow).
|
||||
*
|
||||
* About the arrays, letting len = qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion):
|
||||
* - Before calling the function:
|
||||
* - The array ranges dataAndTemp[0 : len] and qrcode[0 : len] must allow
|
||||
* reading and writing; hence each array must have a length of at least len.
|
||||
* - The two ranges must not overlap (aliasing).
|
||||
* - The input array range dataAndTemp[0 : dataLen] should normally be
|
||||
* valid UTF-8 text, but is not required by the QR Code standard.
|
||||
* - The initial state of dataAndTemp[dataLen : len] and qrcode[0 : len]
|
||||
* can be uninitialized because the function always writes before reading.
|
||||
* - After the function returns:
|
||||
* - Both ranges have no guarantee on which elements are initialized and what values are stored.
|
||||
* - dataAndTemp contains no useful data and should be treated as entirely uninitialized.
|
||||
* - If successful, qrcode can be passed into qrcodegen_getSize() and qrcodegen_getModule().
|
||||
*
|
||||
* If successful, the resulting QR Code will use byte mode to encode the data.
|
||||
*
|
||||
* In the most optimistic case, a QR Code at version 40 with low ECC can hold any byte
|
||||
* sequence up to length 2953 bytes. This is the hard upper limit of the QR Code standard.
|
||||
*
|
||||
* Please consult the QR Code specification for information on
|
||||
* data capacities per version, ECC level, and text encoding mode.
|
||||
*/
|
||||
bool qrcodegen_encodeBinary(uint8_t dataAndTemp[], size_t dataLen, uint8_t qrcode[],
|
||||
enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl);
|
||||
|
||||
|
||||
/*---- Functions (low level) to generate QR Codes ----*/
|
||||
|
||||
/*
|
||||
* Encodes the given segments to a QR Code, returning true if successful.
|
||||
* If the data is too long to fit in any version at the given ECC level,
|
||||
* then false is returned.
|
||||
*
|
||||
* The smallest possible QR Code version is automatically chosen for
|
||||
* the output. The ECC level of the result may be higher than the
|
||||
* ecl argument if it can be done without increasing the version.
|
||||
*
|
||||
* About the byte arrays, letting len = qrcodegen_BUFFER_LEN_FOR_VERSION(qrcodegen_VERSION_MAX):
|
||||
* - Before calling the function:
|
||||
* - The array ranges tempBuffer[0 : len] and qrcode[0 : len] must allow
|
||||
* reading and writing; hence each array must have a length of at least len.
|
||||
* - The two ranges must not overlap (aliasing).
|
||||
* - The initial state of both ranges can be uninitialized
|
||||
* because the function always writes before reading.
|
||||
* - The input array segs can contain segments whose data buffers overlap with tempBuffer.
|
||||
* - After the function returns:
|
||||
* - Both ranges have no guarantee on which elements are initialized and what values are stored.
|
||||
* - tempBuffer contains no useful data and should be treated as entirely uninitialized.
|
||||
* - Any segment whose data buffer overlaps with tempBuffer[0 : len]
|
||||
* must be treated as having invalid values in that array.
|
||||
* - If successful, qrcode can be passed into qrcodegen_getSize() and qrcodegen_getModule().
|
||||
*
|
||||
* Please consult the QR Code specification for information on
|
||||
* data capacities per version, ECC level, and text encoding mode.
|
||||
*
|
||||
* This function allows the user to create a custom sequence of segments that switches
|
||||
* between modes (such as alphanumeric and byte) to encode text in less space.
|
||||
* This is a low-level API; the high-level API is qrcodegen_encodeText() and qrcodegen_encodeBinary().
|
||||
*/
|
||||
bool qrcodegen_encodeSegments(const struct qrcodegen_Segment segs[], size_t len,
|
||||
enum qrcodegen_Ecc ecl, uint8_t tempBuffer[], uint8_t qrcode[]);
|
||||
|
||||
|
||||
/*
|
||||
* Encodes the given segments to a QR Code, returning true if successful.
|
||||
* If the data is too long to fit in any version in the given range
|
||||
* at the given ECC level, then false is returned.
|
||||
*
|
||||
* Requires 1 <= minVersion <= maxVersion <= 40.
|
||||
*
|
||||
* The smallest possible QR Code version within the given range is automatically
|
||||
* chosen for the output. Iff boostEcl is true, then the ECC level of the result
|
||||
* may be higher than the ecl argument if it can be done without increasing the
|
||||
* version. The mask is either between qrcodegen_Mask_0 to 7 to force that mask, or
|
||||
* qrcodegen_Mask_AUTO to automatically choose an appropriate mask (which may be slow).
|
||||
*
|
||||
* About the byte arrays, letting len = qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion):
|
||||
* - Before calling the function:
|
||||
* - The array ranges tempBuffer[0 : len] and qrcode[0 : len] must allow
|
||||
* reading and writing; hence each array must have a length of at least len.
|
||||
* - The two ranges must not overlap (aliasing).
|
||||
* - The initial state of both ranges can be uninitialized
|
||||
* because the function always writes before reading.
|
||||
* - The input array segs can contain segments whose data buffers overlap with tempBuffer.
|
||||
* - After the function returns:
|
||||
* - Both ranges have no guarantee on which elements are initialized and what values are stored.
|
||||
* - tempBuffer contains no useful data and should be treated as entirely uninitialized.
|
||||
* - Any segment whose data buffer overlaps with tempBuffer[0 : len]
|
||||
* must be treated as having invalid values in that array.
|
||||
* - If successful, qrcode can be passed into qrcodegen_getSize() and qrcodegen_getModule().
|
||||
*
|
||||
* Please consult the QR Code specification for information on
|
||||
* data capacities per version, ECC level, and text encoding mode.
|
||||
*
|
||||
* This function allows the user to create a custom sequence of segments that switches
|
||||
* between modes (such as alphanumeric and byte) to encode text in less space.
|
||||
* This is a low-level API; the high-level API is qrcodegen_encodeText() and qrcodegen_encodeBinary().
|
||||
*/
|
||||
bool qrcodegen_encodeSegmentsAdvanced(const struct qrcodegen_Segment segs[], size_t len, enum qrcodegen_Ecc ecl,
|
||||
int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl, uint8_t tempBuffer[], uint8_t qrcode[]);
|
||||
|
||||
|
||||
/*
|
||||
* Tests whether the given string can be encoded as a segment in numeric mode.
|
||||
* A string is encodable iff each character is in the range 0 to 9.
|
||||
*/
|
||||
bool qrcodegen_isNumeric(const char *text);
|
||||
|
||||
|
||||
/*
|
||||
* Tests whether the given string can be encoded as a segment in alphanumeric mode.
|
||||
* A string is encodable iff each character is in the following set: 0 to 9, A to Z
|
||||
* (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.
|
||||
*/
|
||||
bool qrcodegen_isAlphanumeric(const char *text);
|
||||
|
||||
|
||||
/*
|
||||
* Returns the number of bytes (uint8_t) needed for the data buffer of a segment
|
||||
* containing the given number of characters using the given mode. Notes:
|
||||
* - Returns SIZE_MAX on failure, i.e. numChars > INT16_MAX or the internal
|
||||
* calculation of the number of needed bits exceeds INT16_MAX (i.e. 32767).
|
||||
* - Otherwise, all valid results are in the range [0, ceil(INT16_MAX / 8)], i.e. at most 4096.
|
||||
* - It is okay for the user to allocate more bytes for the buffer than needed.
|
||||
* - For byte mode, numChars measures the number of bytes, not Unicode code points.
|
||||
* - For ECI mode, numChars must be 0, and the worst-case number of bytes is returned.
|
||||
* An actual ECI segment can have shorter data. For non-ECI modes, the result is exact.
|
||||
*/
|
||||
size_t qrcodegen_calcSegmentBufferSize(enum qrcodegen_Mode mode, size_t numChars);
|
||||
|
||||
|
||||
/*
|
||||
* Returns a segment representing the given binary data encoded in
|
||||
* byte mode. All input byte arrays are acceptable. Any text string
|
||||
* can be converted to UTF-8 bytes and encoded as a byte mode segment.
|
||||
*/
|
||||
struct qrcodegen_Segment qrcodegen_makeBytes(const uint8_t data[], size_t len, uint8_t buf[]);
|
||||
|
||||
|
||||
/*
|
||||
* Returns a segment representing the given string of decimal digits encoded in numeric mode.
|
||||
*/
|
||||
struct qrcodegen_Segment qrcodegen_makeNumeric(const char *digits, uint8_t buf[]);
|
||||
|
||||
|
||||
/*
|
||||
* Returns a segment representing the given text string encoded in alphanumeric mode.
|
||||
* The characters allowed are: 0 to 9, A to Z (uppercase only), space,
|
||||
* dollar, percent, asterisk, plus, hyphen, period, slash, colon.
|
||||
*/
|
||||
struct qrcodegen_Segment qrcodegen_makeAlphanumeric(const char *text, uint8_t buf[]);
|
||||
|
||||
|
||||
/*
|
||||
* Returns a segment representing an Extended Channel Interpretation
|
||||
* (ECI) designator with the given assignment value.
|
||||
*/
|
||||
struct qrcodegen_Segment qrcodegen_makeEci(long assignVal, uint8_t buf[]);
|
||||
|
||||
|
||||
/*---- Functions to extract raw data from QR Codes ----*/
|
||||
|
||||
/*
|
||||
* Returns the side length of the given QR Code, assuming that encoding succeeded.
|
||||
* The result is in the range [21, 177]. Note that the length of the array buffer
|
||||
* is related to the side length - every 'uint8_t qrcode[]' must have length at least
|
||||
* qrcodegen_BUFFER_LEN_FOR_VERSION(version), which equals ceil(size^2 / 8 + 1).
|
||||
*/
|
||||
int qrcodegen_getSize(const uint8_t qrcode[]);
|
||||
|
||||
|
||||
/*
|
||||
* Returns the color of the module (pixel) at the given coordinates, which is false
|
||||
* for light or true for dark. The top left corner has the coordinates (x=0, y=0).
|
||||
* If the given coordinates are out of bounds, then false (light) is returned.
|
||||
*/
|
||||
bool qrcodegen_getModule(const uint8_t qrcode[], int x, int y);
|
||||
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
|
@ -59,6 +59,8 @@ void storage_unlock(void)
|
|||
}
|
||||
|
||||
/*==== 业务模块初始化（调度器启动前调用，与裸机版一致）====*/
|
||||
static volatile uint8_t s_qr_showing = 0; /* 开机二维码页显示中: 抑制预调度周期刷新 */
|
||||
|
||||
void app_init(void)
|
||||
{
|
||||
log_info("");
|
||||
|
|
@ -108,6 +110,15 @@ void app_init(void)
|
|||
|
||||
/* OLED 屏幕（128x64 + GB2312 字库 IC） */
|
||||
oled_init();
|
||||
if (g_mqtt_configured) {
|
||||
/* 开机显示设备 ID 二维码 10s(内容=ClientID, 右侧附 ID 文本), 便于现场扫码绑定 */
|
||||
s_qr_showing = 1;
|
||||
oled_show_qrcode(MqttInfoStr.ClientID);
|
||||
log_info("> OLED: 开机显示设备ID二维码 10s");
|
||||
bg_delay(10000);
|
||||
s_qr_showing = 0;
|
||||
oled_clear();
|
||||
}
|
||||
if (g_feed_scale_on) { oled_locate(1, 1); oled_print("智能水产投料机"); }
|
||||
else { oled_locate(1, 1); oled_print("继电器控制终端"); }
|
||||
oled_locate(2, 2); oled_print("V" FIRMWARE_VERSION_STR " RTOS");
|
||||
|
|
@ -254,6 +265,7 @@ static void oled_home_refresh(uint32_t up_ms);
|
|||
void app_oled_presched_tick(void)
|
||||
{
|
||||
static uint32_t last = 0;
|
||||
if (s_qr_showing) return;
|
||||
if (HAL_GetTick() - last < 500) return;
|
||||
last = HAL_GetTick();
|
||||
oled_home_refresh(0);
|
||||
|
|
|
|||
|
|
@ -702,6 +702,11 @@
|
|||
<FileType>1</FileType>
|
||||
<FilePath>..\HardWare\OLED\oled.c</FilePath>
|
||||
</File>
|
||||
<File>
|
||||
<FileName>qrcodegen.c</FileName>
|
||||
<FileType>1</FileType>
|
||||
<FilePath>..\HardWare\OLED\qrcodegen.c</FilePath>
|
||||
</File>
|
||||
</Files>
|
||||
</Group>
|
||||
<Group>
|
||||
|
|
|
|||
4
版本说明.md
4
版本说明.md
|
|
@ -21,6 +21,10 @@
|
|||
控制命令改三段式：FC03 预读（判定在线 + 快照命令前反馈）→ FC05 → 150ms → FC03 校验跳变；
|
||||
命令链路最终无应答即判离线并应答平台 `ext relay board offline`，下次命令自动重新探测恢复；
|
||||
断电恢复触发点不变（离线→上线比对 EEPROM 逐路补发）
|
||||
- **开机二维码页**：已配置身份的设备开机后 OLED 显示 10s 二维码——内容为设备 ClientID
|
||||
（`MqttInfoStr.ClientID`，不是产品 ID/密码），左侧 QR 白底暗码（Nayuki qrcodegen，MIT，V1~V3 自动/ECC-L/2px 模块），
|
||||
右侧 x=64 起分行显示 ID 文本；10s 后自动切回正常界面，期间抑制预调度周期刷新防止覆盖；
|
||||
未配置身份（待配置模式）不显示
|
||||
- **扩展板状态断电记忆+上电恢复**（与板载继电器一致）：状态位掩码存 `MqttInfoStr.Relay_State[5]`（原保留字节，
|
||||
bit0~3=扩展 1~4 路，0xFF 空白视为全断），复用 EEPROM 偏移 102 现有落盘路径；
|
||||
扩展板每次离线→上线时比对 FC03 实际状态与 EEPROM 记忆，不一致的回路逐路补发 FC05 纠正
|
||||
|
|
|
|||
Loading…
Reference in New Issue