{"id":1141,"date":"2022-09-04T17:04:30","date_gmt":"2022-09-04T09:04:30","guid":{"rendered":"http:\/\/www.max-shu.com\/blog\/?p=1141"},"modified":"2022-09-04T17:04:30","modified_gmt":"2022-09-04T09:04:30","slug":"%e7%94%a8lvgl%e5%9b%be%e5%bd%a2%e5%ba%93%e7%bb%98%e5%88%b6%e4%ba%8c%e7%bb%b4%e7%a0%81","status":"publish","type":"post","link":"http:\/\/www.max-shu.com\/blog\/?p=1141","title":{"rendered":"\u7528LVGL\u56fe\u5f62\u5e93\u7ed8\u5236\u4e8c\u7ef4\u7801"},"content":{"rendered":"
<\/div>\n
\u4e8c\u7ef4\u7801\u6709\u4e24\u79cd\u6a21\u5f0f\uff0c\u8fd9\u91cc\u53ea\u652f\u6301Model1\uff0c\u4e0d\u652f\u6301Model2\u3002<\/div>\n
Model1\u4e8c\u7ef4\u7801\u670914\u4e2dversion\uff0cverson1\u7684\u5927\u5c0f\u4e3a21×21\u4e2a\u6a21\u5757\uff0cversionX\u7684\u5927\u5c0f\u4e3a(21+X*4)x(21+X*4)\u4e2a\u6a21\u5757\uff08\u8fd9\u91cc\u6a21\u5757\u8868\u793a\u6bcf\u4e2a\u56fe\u6848\u7684\u5207\u6362\uff0c\u6bd4\u5982\u5b9a\u4f4d\u7b26\u91cc\u9762\u7684\u9ed1\u8272\u3002<\/div>\n
\u501f\u9274\u8fd9\u4e2a\u4ee3\u7801\uff0c\u518d\u6dfb\u52a0\u7ed8\u5236\u90e8\u5206\uff1a<\/div>\n
https:\/\/github.com\/ricmoo\/QRCode<\/a><\/div>\n
<\/div>\n
\n
\u4f7f\u7528\u4f8b\u5b50\uff1a<\/strong><\/div>\n
\u6ce8\u610f\uff1aQrCode_Produce\u7684width\u548cheight\u53c2\u6570\u5fc5\u987b\u662f33\u7684\u500d\u6570\uff0c\u56e0\u4e3a\u4f7f\u7528\u7684\u662fversion4\uff0c\u537333×33\u7684\u5757\u5927\u5c0f\uff0c\u5426\u5219\u5728canvas\u8981\u4e48\u663e\u793a\u4e0d\u5168\u8981\u4e48\u53f3\u4e0b\u663e\u793a\u7a7a\u767d\u591a\u3002<\/div>\n
<\/div>\n
void my_test_init_3()<\/div>\n
{<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0printf(“my_test_init_3: \\n”);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_obj_t *scr1 = lv_obj_create(NULL, NULL);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_obj_set_style_local_bg_color(scr1, LV_OBJ_PART_MAIN, LV_STATE_DEFAULT, LV_COLOR_BLACK);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_scr_load(scr1);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/Produce QRCode<\/div>\n
#define QRCODE_BOARD\u00a0\u00a02<\/div>\n
#define QRCODE_WIDTH\u00a0\u00a0103\u00a0\u00a0\/\/ = 99+QRCODE_BOARD*2<\/div>\n
#define QRCODE_HEIGHT 103<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0static lv_color_t cbuf[LV_CANVAS_BUF_SIZE_TRUE_COLOR(QRCODE_WIDTH, QRCODE_HEIGHT)];<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_obj_t * canvas = lv_canvas_create(scr1, NULL);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_canvas_set_buffer(canvas, cbuf, QRCODE_WIDTH, QRCODE_HEIGHT, LV_IMG_CF_TRUE_COLOR);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_obj_set_hidden(canvas, false);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_obj_set_pos(canvas, 50, 10);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_canvas_fill_bg(canvas, LV_COLOR_SILVER, LV_OPA_COVER);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0QrCode_Produce(canvas, QRCODE_BOARD, QRCODE_BOARD,<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(QRCODE_WIDTH-QRCODE_BOARD*2)\/33, (QRCODE_HEIGHT-QRCODE_BOARD*2)\/33,<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0“0123456789\/:,.'(){}[]\\”abcdefABCDEF_-!@#$%^&*~0123456789”);<\/div>\n
\n
}<\/div>\n<\/div>\n
<\/div>\n
<\/div>\n
\u6e90\u6587\u4ef6\uff1a<\/strong><\/div>\n
<\/div>\n
#include <stdlib.h><\/div>\n
#include <string.h><\/div>\n
#include <stdio.h><\/div>\n
#include “lvgl\/lvgl.h”<\/div>\n
<\/div>\n
#include “qrcode.h”<\/div>\n
<\/div>\n
#pragma mark – Error Correction Lookup tables<\/div>\n
<\/div>\n
#if LOCK_VERSION == 0<\/div>\n
<\/div>\n
static const uint16_t NUM_ERROR_CORRECTION_CODEWORDS[4][40] = {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ 1,\u00a0\u00a02,\u00a0\u00a03,\u00a0\u00a04,\u00a0\u00a05,\u00a0\u00a0\u00a06,\u00a0\u00a0\u00a07,\u00a0\u00a0\u00a08,\u00a0\u00a0\u00a09,\u00a0\u00a010,\u00a0\u00a011,\u00a0\u00a012,\u00a0\u00a013,\u00a0\u00a014,\u00a0\u00a015,\u00a0\u00a016,\u00a0\u00a017,\u00a0\u00a018,\u00a0\u00a019,\u00a0\u00a020,\u00a0\u00a021,\u00a0\u00a022,\u00a0\u00a023,\u00a0\u00a024,\u00a0\u00a0\u00a025,\u00a0\u00a0\u00a026,\u00a0\u00a0\u00a027,\u00a0\u00a0\u00a028,\u00a0\u00a0\u00a029,\u00a0\u00a0\u00a030,\u00a0\u00a0\u00a031,\u00a0\u00a0\u00a032,\u00a0\u00a0\u00a033,\u00a0\u00a0\u00a034,\u00a0\u00a0\u00a035,\u00a0\u00a0\u00a036,\u00a0\u00a0\u00a037,\u00a0\u00a0\u00a038,\u00a0\u00a0\u00a039,\u00a0\u00a0\u00a040\u00a0\u00a0\u00a0\u00a0Error correction level<\/div>\n
\u00a0\u00a0\u00a0\u00a0{ 10, 16, 26, 36, 48,\u00a0\u00a064,\u00a0\u00a072,\u00a0\u00a088, 110, 130, 150, 176, 198, 216, 240, 280, 308, 338, 364, 416, 442, 476, 504, 560,\u00a0\u00a0588,\u00a0\u00a0644,\u00a0\u00a0700,\u00a0\u00a0728,\u00a0\u00a0784,\u00a0\u00a0812,\u00a0\u00a0868,\u00a0\u00a0924,\u00a0\u00a0980, 1036, 1064, 1120, 1204, 1260, 1316, 1372},\u00a0\u00a0\/\/ Medium<\/div>\n
\u00a0\u00a0\u00a0\u00a0{\u00a0\u00a07, 10, 15, 20, 26,\u00a0\u00a036,\u00a0\u00a040,\u00a0\u00a048,\u00a0\u00a060,\u00a0\u00a072,\u00a0\u00a080,\u00a0\u00a096, 104, 120, 132, 144, 168, 180, 196, 224, 224, 252, 270, 300,\u00a0\u00a0312,\u00a0\u00a0336,\u00a0\u00a0360,\u00a0\u00a0390,\u00a0\u00a0420,\u00a0\u00a0450,\u00a0\u00a0480,\u00a0\u00a0510,\u00a0\u00a0540,\u00a0\u00a0570,\u00a0\u00a0570,\u00a0\u00a0600,\u00a0\u00a0630,\u00a0\u00a0660,\u00a0\u00a0720,\u00a0\u00a0750},\u00a0\u00a0\/\/ Low<\/div>\n
\u00a0\u00a0\u00a0\u00a0{ 17, 28, 44, 64, 88, 112, 130, 156, 192, 224, 264, 308, 352, 384, 432, 480, 532, 588, 650, 700, 750, 816, 900, 960, 1050, 1110, 1200, 1260, 1350, 1440, 1530, 1620, 1710, 1800, 1890, 1980, 2100, 2220, 2310, 2430},\u00a0\u00a0\/\/ High<\/div>\n
\u00a0\u00a0\u00a0\u00a0{ 13, 22, 36, 52, 72,\u00a0\u00a096, 108, 132, 160, 192, 224, 260, 288, 320, 360, 408, 448, 504, 546, 600, 644, 690, 750, 810,\u00a0\u00a0870,\u00a0\u00a0952, 1020, 1050, 1140, 1200, 1290, 1350, 1440, 1530, 1590, 1680, 1770, 1860, 1950, 2040},\u00a0\u00a0\/\/ Quartile<\/div>\n
};<\/div>\n
<\/div>\n
static const uint8_t NUM_ERROR_CORRECTION_BLOCKS[4][40] = {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Version: (note that index 0 is for padding, and is set to an illegal value)<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ 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\u00a0\u00a0\u00a0\u00a0Error correction level<\/div>\n
\u00a0\u00a0\u00a0\u00a0{\u00a0\u00a01, 1, 1, 2, 2, 4, 4, 4, 5, 5,\u00a0\u00a05,\u00a0\u00a08,\u00a0\u00a09,\u00a0\u00a09, 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},\u00a0\u00a0\/\/ Medium<\/div>\n
\u00a0\u00a0\u00a0\u00a0{\u00a0\u00a01, 1, 1, 1, 1, 2, 2, 2, 2, 4,\u00a0\u00a04,\u00a0\u00a04,\u00a0\u00a04,\u00a0\u00a04,\u00a0\u00a06,\u00a0\u00a06,\u00a0\u00a06,\u00a0\u00a06,\u00a0\u00a07,\u00a0\u00a08,\u00a0\u00a08,\u00a0\u00a09,\u00a0\u00a09, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25},\u00a0\u00a0\/\/ Low<\/div>\n
\u00a0\u00a0\u00a0\u00a0{\u00a0\u00a01, 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},\u00a0\u00a0\/\/ High<\/div>\n
\u00a0\u00a0\u00a0\u00a0{\u00a0\u00a01, 1, 2, 2, 4, 4, 6, 6, 8, 8,\u00a0\u00a08, 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},\u00a0\u00a0\/\/ Quartile<\/div>\n
};<\/div>\n
<\/div>\n
static const uint16_t NUM_RAW_DATA_MODULES[40] = {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/\u00a0\u00a01,\u00a0\u00a0\u00a02,\u00a0\u00a0\u00a03,\u00a0\u00a0\u00a04,\u00a0\u00a0\u00a0\u00a05,\u00a0\u00a0\u00a0\u00a06,\u00a0\u00a0\u00a0\u00a07,\u00a0\u00a0\u00a0\u00a08,\u00a0\u00a0\u00a0\u00a09,\u00a0\u00a0\u00a010,\u00a0\u00a0\u00a011,\u00a0\u00a0\u00a012,\u00a0\u00a0\u00a013,\u00a0\u00a0\u00a014,\u00a0\u00a0\u00a015,\u00a0\u00a0\u00a016,\u00a0\u00a0\u00a017,<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0208, 359, 567, 807, 1079, 1383, 1568, 1936, 2336, 2768, 3232, 3728, 4256, 4651, 5243, 5867, 6523,<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/\u00a0\u00a0\u00a018,\u00a0\u00a0\u00a019,\u00a0\u00a0\u00a020,\u00a0\u00a0\u00a021,\u00a0\u00a0\u00a0\u00a022,\u00a0\u00a0\u00a0\u00a023,\u00a0\u00a0\u00a0\u00a024,\u00a0\u00a0\u00a0\u00a025,\u00a0\u00a0\u00a026,\u00a0\u00a0\u00a0\u00a027,\u00a0\u00a0\u00a0\u00a0\u00a028,\u00a0\u00a0\u00a0\u00a029,\u00a0\u00a0\u00a0\u00a030,\u00a0\u00a0\u00a0\u00a031,<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a07211, 7931, 8683, 9252, 10068, 10916, 11796, 12708, 13652, 14628, 15371, 16411, 17483, 18587,<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/\u00a0\u00a0\u00a0\u00a032,\u00a0\u00a0\u00a0\u00a033,\u00a0\u00a0\u00a0\u00a034,\u00a0\u00a0\u00a0\u00a035,\u00a0\u00a0\u00a0\u00a036,\u00a0\u00a0\u00a0\u00a037,\u00a0\u00a0\u00a0\u00a038,\u00a0\u00a0\u00a0\u00a039,\u00a0\u00a0\u00a0\u00a040<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a019723, 20891, 22091, 23008, 24272, 25568, 26896, 28256, 29648<\/div>\n
};<\/div>\n
<\/div>\n
\/\/ @TODO: Put other LOCK_VERSIONS here<\/div>\n
#elif LOCK_VERSION == 3<\/div>\n
<\/div>\n
static const int16_t NUM_ERROR_CORRECTION_CODEWORDS[4] = {<\/div>\n
\u00a0\u00a0\u00a0\u00a026, 15, 44, 36<\/div>\n
};<\/div>\n
<\/div>\n
static const int8_t NUM_ERROR_CORRECTION_BLOCKS[4] = {<\/div>\n
\u00a0\u00a0\u00a0\u00a01, 1, 2, 2<\/div>\n
};<\/div>\n
<\/div>\n
static const uint16_t NUM_RAW_DATA_MODULES = 567;<\/div>\n
<\/div>\n
#else<\/div>\n
<\/div>\n
#error Unsupported LOCK_VERSION (add it…)<\/div>\n
<\/div>\n
#endif<\/div>\n
<\/div>\n
<\/div>\n
static int max(int a, int b) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (a > b) { return a; }<\/div>\n
\u00a0\u00a0\u00a0\u00a0return b;<\/div>\n
}<\/div>\n
<\/div>\n
\/*<\/div>\n
static int abs(int value) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (value < 0) { return -value; }<\/div>\n
\u00a0\u00a0\u00a0\u00a0return value;<\/div>\n
}<\/div>\n
*\/<\/div>\n
<\/div>\n
<\/div>\n
#pragma mark – Mode testing and conversion<\/div>\n
<\/div>\n
static int8_t getAlphanumeric(char c) {<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (c >= ‘0’ && c <= ‘9’) { return (c – ‘0’); }<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (c >= ‘A’ && c <= ‘Z’) { return (c – ‘A’ + 10); }<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0switch (c) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case ‘ ‘: return 36;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case ‘$’: return 37;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case ‘%’: return 38;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case ‘*’: return 39;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case ‘+’: return 40;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case ‘-‘: return 41;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case ‘.’: return 42;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case ‘\/’: return 43;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case ‘:’: return 44;<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0return -1;<\/div>\n
}<\/div>\n
<\/div>\n
static bool isAlphanumeric(const char *text, uint16_t length) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0while (length != 0) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (getAlphanumeric(text[–length]) == -1) { return false; }<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0return true;<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
static bool isNumeric(const char *text, uint16_t length) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0while (length != 0) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0char c = text[–length];<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (c < ‘0’ || c > ‘9’) { return false; }<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0return true;<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
#pragma mark – Counting<\/div>\n
<\/div>\n
\/\/ We store the following tightly packed (less 8) in modeInfo<\/div>\n
\/\/\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<=9\u00a0\u00a0<=26\u00a0\u00a0<= 40<\/div>\n
\/\/ NUMERIC\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0( 10,\u00a0\u00a0\u00a012,\u00a0\u00a0\u00a0\u00a014);<\/div>\n
\/\/ ALPHANUMERIC (\u00a0\u00a09,\u00a0\u00a0\u00a011,\u00a0\u00a0\u00a0\u00a013);<\/div>\n
\/\/ BYTE\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0(\u00a0\u00a08,\u00a0\u00a0\u00a016,\u00a0\u00a0\u00a0\u00a016);<\/div>\n
static char getModeBits(uint8_t version, uint8_t mode) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Note: We use 15 instead of 16; since 15 doesn’t exist and we cannot store 16 (8 + 8) in 3 bits<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ hex(int(“”.join(reversed([(’00’ + bin(x – 8)[2:])[-3:] for x in [10, 9, 8, 12, 11, 15, 14, 13, 15]])), 2))<\/div>\n
\u00a0\u00a0\u00a0\u00a0unsigned int modeInfo = 0x7bbb80a;<\/div>\n
<\/div>\n
#if LOCK_VERSION == 0 || LOCK_VERSION > 9<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (version > 9) { modeInfo >>= 9; }<\/div>\n
#endif<\/div>\n
<\/div>\n
#if LOCK_VERSION == 0 || LOCK_VERSION > 26<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (version > 26) { modeInfo >>= 9; }<\/div>\n
#endif<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0char result = 8 + ((modeInfo >> (3 * mode)) & 0x07);<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (result == 15) { result = 16; }<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0return result;<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
#pragma mark – BitBucket<\/div>\n
<\/div>\n
typedef struct BitBucket {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t bitOffsetOrWidth;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t capacityBytes;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t *data;<\/div>\n
} BitBucket;<\/div>\n
<\/div>\n
\/*<\/div>\n
void bb_dump(BitBucket *bitBuffer) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0printf(“Buffer: “);<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint32_t i = 0; i < bitBuffer->capacityBytes; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0printf(“%02x”, bitBuffer->data[i]);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if ((i % 4) == 3) { printf(” “); }<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0printf(“\\n”);<\/div>\n
}<\/div>\n
*\/<\/div>\n
<\/div>\n
static uint16_t bb_getGridSizeBytes(uint8_t size) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0return (((size * size) + 7) \/ 8);<\/div>\n
}<\/div>\n
<\/div>\n
static uint16_t bb_getBufferSizeBytes(uint32_t bits) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0return ((bits + 7) \/ 8);<\/div>\n
}<\/div>\n
<\/div>\n
static void bb_initBuffer(BitBucket *bitBuffer, uint8_t *data, int32_t capacityBytes) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0bitBuffer->bitOffsetOrWidth = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0bitBuffer->capacityBytes = capacityBytes;<\/div>\n
\u00a0\u00a0\u00a0\u00a0bitBuffer->data = data;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0memset(data, 0, bitBuffer->capacityBytes);<\/div>\n
}<\/div>\n
<\/div>\n
static void bb_initGrid(BitBucket *bitGrid, uint8_t *data, uint8_t size) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0bitGrid->bitOffsetOrWidth = size;<\/div>\n
\u00a0\u00a0\u00a0\u00a0bitGrid->capacityBytes = bb_getGridSizeBytes(size);<\/div>\n
\u00a0\u00a0\u00a0\u00a0bitGrid->data = data;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0memset(data, 0, bitGrid->capacityBytes);<\/div>\n
}<\/div>\n
<\/div>\n
static void bb_appendBits(BitBucket *bitBuffer, uint32_t val, uint8_t length) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t offset = bitBuffer->bitOffsetOrWidth;<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int8_t i = length – 1; i >= 0; i–, offset++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bitBuffer->data[offset >> 3] |= ((val >> i) & 1) << (7 – (offset & 7));<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0bitBuffer->bitOffsetOrWidth = offset;<\/div>\n
}<\/div>\n
\/*<\/div>\n
void bb_setBits(BitBucket *bitBuffer, uint32_t val, int offset, uint8_t length) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int8_t i = length – 1; i >= 0; i–, offset++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bitBuffer->data[offset >> 3] |= ((val >> i) & 1) << (7 – (offset & 7));<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
*\/<\/div>\n
static void bb_setBit(BitBucket *bitGrid, uint8_t x, uint8_t y, bool on) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t offset = y * bitGrid->bitOffsetOrWidth + x;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t mask = 1 << (7 – (offset & 0x07));<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (on) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bitGrid->data[offset >> 3] |= mask;<\/div>\n
\u00a0\u00a0\u00a0\u00a0} else {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bitGrid->data[offset >> 3] &= ~mask;<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
<\/div>\n
static void bb_invertBit(BitBucket *bitGrid, uint8_t x, uint8_t y, bool invert) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t offset = y * bitGrid->bitOffsetOrWidth + x;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t mask = 1 << (7 – (offset & 0x07));<\/div>\n
\u00a0\u00a0\u00a0\u00a0bool on = ((bitGrid->data[offset >> 3] & (1 << (7 – (offset & 0x07)))) != 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (on ^ invert) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bitGrid->data[offset >> 3] |= mask;<\/div>\n
\u00a0\u00a0\u00a0\u00a0} else {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bitGrid->data[offset >> 3] &= ~mask;<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
<\/div>\n
static bool bb_getBit(BitBucket *bitGrid, uint8_t x, uint8_t y) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t offset = y * bitGrid->bitOffsetOrWidth + x;<\/div>\n
\u00a0\u00a0\u00a0\u00a0return (bitGrid->data[offset >> 3] & (1 << (7 – (offset & 0x07)))) != 0;<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
#pragma mark – Drawing Patterns<\/div>\n
<\/div>\n
\/\/ XORs the data modules in this QR Code with the given mask pattern. Due to XOR’s mathematical<\/div>\n
\/\/ properties, calling applyMask(m) twice with the same value is equivalent to no change at all.<\/div>\n
\/\/ This means it is possible to apply a mask, undo it, and try another mask. Note that a final<\/div>\n
\/\/ well-formed QR Code symbol needs exactly one mask applied (not zero, not two, etc.).<\/div>\n
static void applyMask(BitBucket *modules, BitBucket *isFunction, uint8_t mask) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t size = modules->bitOffsetOrWidth;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t y = 0; y < size; y++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t x = 0; x < size; x++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (bb_getBit(isFunction, x, y)) { continue; }<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool invert = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0switch (mask) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case 0:\u00a0\u00a0invert = (x + y) % 2 == 0;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0break;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case 1:\u00a0\u00a0invert = y % 2 == 0;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0break;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case 2:\u00a0\u00a0invert = x % 3 == 0;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0break;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case 3:\u00a0\u00a0invert = (x + y) % 3 == 0;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0break;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case 4:\u00a0\u00a0invert = (x \/ 3 + y \/ 2) % 2 == 0;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0break;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case 5:\u00a0\u00a0invert = x * y % 2 + x * y % 3 == 0;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0break;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case 6:\u00a0\u00a0invert = (x * y % 2 + x * y % 3) % 2 == 0;\u00a0\u00a0\u00a0\u00a0break;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0case 7:\u00a0\u00a0invert = ((x + y) % 2 + x * y % 3) % 2 == 0;\u00a0\u00a0break;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_invertBit(modules, x, y, invert);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
<\/div>\n
static void setFunctionModule(BitBucket *modules, BitBucket *isFunction, uint8_t x, uint8_t y, bool on) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0bb_setBit(modules, x, y, on);<\/div>\n
\u00a0\u00a0\u00a0\u00a0bb_setBit(isFunction, x, y, true);<\/div>\n
}<\/div>\n
<\/div>\n
\/\/ Draws a 9*9 finder pattern including the border separator, with the center module at (x, y).<\/div>\n
static void drawFinderPattern(BitBucket *modules, BitBucket *isFunction, uint8_t x, uint8_t y) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t size = modules->bitOffsetOrWidth;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int8_t i = -4; i <= 4; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (int8_t j = -4; j <= 4; j++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t dist = max(abs(i), abs(j));\u00a0\u00a0\/\/ Chebyshev\/infinity norm<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0int16_t xx = x + j, yy = y + i;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (0 <= xx && xx < size && 0 <= yy && yy < size) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, xx, yy, dist != 2 && dist != 4);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
<\/div>\n
\/\/ Draws a 5*5 alignment pattern, with the center module at (x, y).<\/div>\n
static void drawAlignmentPattern(BitBucket *modules, BitBucket *isFunction, uint8_t x, uint8_t y) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int8_t i = -2; i <= 2; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (int8_t j = -2; j <= 2; j++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, x + j, y + i, max(abs(i), abs(j)) != 1);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
<\/div>\n
\/\/ Draws two copies of the format bits (with its own error correction code)<\/div>\n
\/\/ based on the given mask and this object’s error correction level field.<\/div>\n
static void drawFormatBits(BitBucket *modules, BitBucket *isFunction, uint8_t ecc, uint8_t mask) {<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t size = modules->bitOffsetOrWidth;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Calculate error correction code and pack bits<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t data = ecc << 3 | mask;\u00a0\u00a0\/\/ errCorrLvl is uint2, mask is uint3<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t rem = data;<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int i = 0; i < 10; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0rem = (rem << 1) ^ ((rem >> 9) * 0x537);<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0data = data << 10 | rem;<\/div>\n
\u00a0\u00a0\u00a0\u00a0data ^= 0x5412;\u00a0\u00a0\/\/ uint15<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Draw first copy<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0; i <= 5; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, 8, i, ((data >> i) & 1) != 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, 8, 7, ((data >> 6) & 1) != 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, 8, 8, ((data >> 7) & 1) != 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, 7, 8, ((data >> 8) & 1) != 0);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int8_t i = 9; i < 15; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, 14 – i, 8, ((data >> i) & 1) != 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Draw second copy<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int8_t i = 0; i <= 7; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, size – 1 – i, 8, ((data >> i) & 1) != 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int8_t i = 8; i < 15; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, 8, size – 15 + i, ((data >> i) & 1) != 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, 8, size – 8, true);<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
\/\/ Draws two copies of the version bits (with its own error correction code),<\/div>\n
\/\/ based on this object’s version field (which only has an effect for 7 <= version <= 40).<\/div>\n
static void drawVersion(BitBucket *modules, BitBucket *isFunction, uint8_t version) {<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0int8_t size = modules->bitOffsetOrWidth;<\/div>\n
<\/div>\n
#if LOCK_VERSION != 0 && LOCK_VERSION < 7<\/div>\n
\u00a0\u00a0\u00a0\u00a0return;<\/div>\n
<\/div>\n
#else<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (version < 7) { return; }<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Calculate error correction code and pack bits<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t rem = version;\u00a0\u00a0\/\/ version is uint6, in the range [7, 40]<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0; i < 12; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0rem = (rem << 1) ^ ((rem >> 11) * 0x1F25);<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t data = version << 12 | rem;\u00a0\u00a0\/\/ uint18<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Draw two copies<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0; i < 18; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool bit = ((data >> i) & 1) != 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t a = size – 11 + i % 3, b = i \/ 3;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, a, b, bit);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, b, a, bit);<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
#endif<\/div>\n
}<\/div>\n
<\/div>\n
static void drawFunctionPatterns(BitBucket *modules, BitBucket *isFunction, uint8_t version, uint8_t ecc) {<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t size = modules->bitOffsetOrWidth;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Draw the horizontal and vertical timing patterns<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0; i < size; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, 6, i, i % 2 == 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0setFunctionModule(modules, isFunction, i, 6, i % 2 == 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules)<\/div>\n
\u00a0\u00a0\u00a0\u00a0drawFinderPattern(modules, isFunction, 3, 3);<\/div>\n
\u00a0\u00a0\u00a0\u00a0drawFinderPattern(modules, isFunction, size – 4, 3);<\/div>\n
\u00a0\u00a0\u00a0\u00a0drawFinderPattern(modules, isFunction, 3, size – 4);<\/div>\n
<\/div>\n
#if LOCK_VERSION == 0 || LOCK_VERSION > 1<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (version > 1) {<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ Draw the numerous alignment patterns<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t alignCount = version \/ 7 + 2;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t step;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (version != 32) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0step = (version * 4 + alignCount * 2 + 1) \/ (2 * alignCount – 2) * 2;\u00a0\u00a0\/\/ ceil((size – 13) \/ (2*numAlign – 2)) * 2<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0} else { \/\/ C-C-C-Combo breaker!<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0step = 26;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t alignPositionIndex = alignCount – 1;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/uint8_t alignPosition[alignCount];<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t alignPosition[2]; \/\/alignCount<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0alignPosition[0] = 6;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t size = version * 4 + 17;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0, pos = size – 7; i < alignCount – 1; i++, pos -= step) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0alignPosition[alignPositionIndex–] = pos;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0; i < alignCount; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t j = 0; j < alignCount; j++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if ((i == 0 && j == 0) || (i == 0 && j == alignCount – 1) || (i == alignCount – 1 && j == 0)) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0continue;\u00a0\u00a0\/\/ Skip the three finder corners<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0} else {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0drawAlignmentPattern(modules, isFunction, alignPosition[i], alignPosition[j]);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
#endif<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Draw configuration data<\/div>\n
\u00a0\u00a0\u00a0\u00a0drawFormatBits(modules, isFunction, ecc, 0);\u00a0\u00a0\/\/ Dummy mask value; overwritten later in the constructor<\/div>\n
\u00a0\u00a0\u00a0\u00a0drawVersion(modules, isFunction, version);<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
\/\/ Draws the given sequence of 8-bit codewords (data and error correction) onto the entire<\/div>\n
\/\/ data area of this QR Code symbol. Function modules need to be marked off before this is called.<\/div>\n
static void drawCodewords(BitBucket *modules, BitBucket *isFunction, BitBucket *codewords) {<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t bitLength = codewords->bitOffsetOrWidth;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t *data = codewords->data;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t size = modules->bitOffsetOrWidth;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Bit index into the data<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t i = 0;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Do the funny zigzag scan<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int16_t right = size – 1; right >= 1; right -= 2) {\u00a0\u00a0\/\/ Index of right column in each column pair<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (right == 6) { right = 5; }<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t vert = 0; vert < size; vert++) {\u00a0\u00a0\/\/ Vertical counter<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (int j = 0; j < 2; j++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t x = right – j;\u00a0\u00a0\/\/ Actual x coordinate<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool upwards = ((right & 2) == 0) ^ (x < 6);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t y = upwards ? size – 1 – vert : vert;\u00a0\u00a0\/\/ Actual y coordinate<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (!bb_getBit(isFunction, x, y) && i < bitLength) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_setBit(modules, x, y, ((data[i >> 3] >> (7 – (i & 7))) & 1) != 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0i++;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ If there are any remainder bits (0 to 7), they are already<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ set to 0\/false\/white when the grid of modules was initialized<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
<\/div>\n
#pragma mark – Penalty Calculation<\/div>\n
<\/div>\n
#define PENALTY_N1\u00a0\u00a0\u00a0\u00a0\u00a0\u00a03<\/div>\n
#define PENALTY_N2\u00a0\u00a0\u00a0\u00a0\u00a0\u00a03<\/div>\n
#define PENALTY_N3\u00a0\u00a0\u00a0\u00a0\u00a040<\/div>\n
#define PENALTY_N4\u00a0\u00a0\u00a0\u00a0\u00a010<\/div>\n
<\/div>\n
\/\/ Calculates and returns the penalty score based on state of this QR Code’s current modules.<\/div>\n
\/\/ This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.<\/div>\n
\/\/ @TODO: This can be optimized by working with the bytes instead of bits.<\/div>\n
static uint32_t getPenaltyScore(BitBucket *modules) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t result = 0;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t size = modules->bitOffsetOrWidth;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Adjacent modules in row having same color<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t y = 0; y < size; y++) {<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool colorX = bb_getBit(modules, 0, y);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t x = 1, runX = 1; x < size; x++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool cx = bb_getBit(modules, x, y);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (cx != colorX) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0colorX = cx;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0runX = 1;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0} else {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0runX++;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (runX == 5) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result += PENALTY_N1;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0} else if (runX > 5) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result++;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Adjacent modules in column having same color<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t x = 0; x < size; x++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool colorY = bb_getBit(modules, x, 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t y = 1, runY = 1; y < size; y++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool cy = bb_getBit(modules, x, y);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (cy != colorY) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0colorY = cy;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0runY = 1;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0} else {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0runY++;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (runY == 5) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result += PENALTY_N1;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0} else if (runY > 5) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result++;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t black = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t y = 0; y < size; y++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint16_t bitsRow = 0, bitsCol = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t x = 0; x < size; x++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool color = bb_getBit(modules, x, y);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ 2*2 blocks of modules having same color<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (x > 0 && y > 0) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool colorUL = bb_getBit(modules, x – 1, y – 1);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool colorUR = bb_getBit(modules, x, y – 1);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bool colorL = bb_getBit(modules, x – 1, y);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (color == colorUL && color == colorUR && color == colorL) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result += PENALTY_N2;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ Finder-like pattern in rows and columns<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bitsRow = ((bitsRow << 1) & 0x7FF) | color;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bitsCol = ((bitsCol << 1) & 0x7FF) | bb_getBit(modules, y, x);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ Needs 11 bits accumulated<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (x >= 10) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (bitsRow == 0x05D || bitsRow == 0x5D0) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result += PENALTY_N3;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (bitsCol == 0x05D || bitsCol == 0x5D0) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result += PENALTY_N3;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ Balance of black and white modules<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (color) { black++; }<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Find smallest k such that (45-5k)% <= dark\/total <= (55+5k)%<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t total = size * size;<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint16_t k = 0; black * 20 < (9 – k) * total || black * 20 > (11 + k) * total; k++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result += PENALTY_N4;<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0return result;<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
#pragma mark – Reed-Solomon Generator<\/div>\n
<\/div>\n
static uint8_t rs_multiply(uint8_t x, uint8_t y) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Russian peasant multiplication<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ See: https:\/\/en.wikipedia.org\/wiki\/Ancient_Egyptian_multiplication<\/a><\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t z = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (int8_t i = 7; i >= 0; i–) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0z = (z << 1) ^ ((z >> 7) * 0x11D);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0z ^= ((y >> i) & 1) * x;<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0return z;<\/div>\n
}<\/div>\n
<\/div>\n
static void rs_init(uint8_t degree, uint8_t *coeff) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0memset(coeff, 0, degree);<\/div>\n
\u00a0\u00a0\u00a0\u00a0coeff[degree – 1] = 1;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Compute the product polynomial (x – r^0) * (x – r^1) * (x – r^2) * … * (x – r^{degree-1}),<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ drop the highest term, and store the rest of the coefficients in order of descending powers.<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Note that r = 0x02, which is a generator element of this field GF(2^8\/0x11D).<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t root = 1;<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0; i < degree; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ Multiply the current product by (x – r^i)<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t j = 0; j < degree; j++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0coeff[j] = rs_multiply(coeff[j], root);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (j + 1 < degree) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0coeff[j] ^= coeff[j + 1];<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0root = (root << 1) ^ ((root >> 7) * 0x11D);\u00a0\u00a0\/\/ Multiply by 0x02 mod GF(2^8\/0x11D)<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
<\/div>\n
static void rs_getRemainder(uint8_t degree, uint8_t *coeff, uint8_t *data, uint8_t length, uint8_t *result, uint8_t stride) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Compute the remainder by performing polynomial division<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/for (uint8_t i = 0; i < degree; i++) { result[] = 0; }<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/memset(result, 0, degree);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0; i < length; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t factor = data[i] ^ result[0];<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t j = 1; j < degree; j++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result[(j – 1) * stride] = result[j * stride];<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result[(degree – 1) * stride] = 0;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t j = 0; j < degree; j++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result[j * stride] ^= rs_multiply(coeff[j], factor);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
<\/div>\n
#pragma mark – QrCode<\/div>\n
<\/div>\n
static int8_t encodeDataCodewords(BitBucket *dataCodewords, const uint8_t *text, uint16_t length, uint8_t version) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0int8_t mode = MODE_BYTE;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (isNumeric((char*)text, length)) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0mode = MODE_NUMERIC;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, 1 << MODE_NUMERIC, 4);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, length, getModeBits(version, MODE_NUMERIC));<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint16_t accumData = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t accumCount = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint16_t i = 0; i < length; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0accumData = accumData * 10 + ((char)(text[i]) – ‘0’);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0accumCount++;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (accumCount == 3) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, accumData, 10);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0accumData = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0accumCount = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ 1 or 2 digits remaining<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (accumCount > 0) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, accumData, accumCount * 3 + 1);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0} else if (isAlphanumeric((char*)text, length)) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0mode = MODE_ALPHANUMERIC;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, 1 << MODE_ALPHANUMERIC, 4);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, length, getModeBits(version, MODE_ALPHANUMERIC));<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint16_t accumData = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t accumCount = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint16_t i = 0; i\u00a0\u00a0< length; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0accumData = accumData * 45 + getAlphanumeric((char)(text[i]));<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0accumCount++;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (accumCount == 2) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, accumData, 11);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0accumData = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0accumCount = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ 1 character remaining<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (accumCount > 0) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, accumData, 6);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0} else {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, 1 << MODE_BYTE, 4);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, length, getModeBits(version, MODE_BYTE));<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint16_t i = 0; i < length; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(dataCodewords, (char)(text[i]), 8);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/bb_setBits(dataCodewords, length, 4, getModeBits(version, mode));<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0return mode;<\/div>\n
}<\/div>\n
<\/div>\n
static void performErrorCorrection(uint8_t version, uint8_t ecc, BitBucket *data) {<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ See: http:\/\/www.thonky.com\/qr-code-tutorial\/structure-final-message<\/a><\/div>\n
<\/div>\n
#if LOCK_VERSION == 0<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t numBlocks = NUM_ERROR_CORRECTION_BLOCKS[ecc][version – 1];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t totalEcc = NUM_ERROR_CORRECTION_CODEWORDS[ecc][version – 1];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t moduleCount = NUM_RAW_DATA_MODULES[version – 1];<\/div>\n
#else<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t numBlocks = NUM_ERROR_CORRECTION_BLOCKS[ecc];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t totalEcc = NUM_ERROR_CORRECTION_CODEWORDS[ecc];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t moduleCount = NUM_RAW_DATA_MODULES;<\/div>\n
#endif<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t blockEccLen = totalEcc \/ numBlocks;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t numShortBlocks = numBlocks – moduleCount \/ 8 % numBlocks;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t shortBlockLen = moduleCount \/ 8 \/ numBlocks;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t shortDataBlockLen = shortBlockLen – blockEccLen;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/uint8_t result[data->capacityBytes];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t result[203]; \/\/data->capacityBytes<\/div>\n
\u00a0\u00a0\u00a0\u00a0memset(result, 0, sizeof(result));<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/uint8_t coeff[blockEccLen];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t coeff[20]; \/\/blockEccLen<\/div>\n
\u00a0\u00a0\u00a0\u00a0rs_init(blockEccLen, coeff);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t offset = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t *dataBytes = data->data;<\/div>\n
<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Interleave all short blocks<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0; i < shortDataBlockLen; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint16_t index = i;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t stride = shortDataBlockLen;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t blockNum = 0; blockNum < numBlocks; blockNum++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result[offset++] = dataBytes[index];<\/div>\n
<\/div>\n
#if LOCK_VERSION == 0 || LOCK_VERSION >= 5<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (blockNum == numShortBlocks) { stride++; }<\/div>\n
#endif<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0index += stride;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Version less than 5 only have short blocks<\/div>\n
#if LOCK_VERSION == 0 || LOCK_VERSION >= 5<\/div>\n
\u00a0\u00a0\u00a0\u00a0{<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ Interleave long blocks<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint16_t index = shortDataBlockLen * (numShortBlocks + 1);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0uint8_t stride = shortDataBlockLen;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t blockNum = 0; blockNum < numBlocks – numShortBlocks; blockNum++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0result[offset++] = dataBytes[index];<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (blockNum == 0) { stride++; }<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0index += stride;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
#endif<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Add all ecc blocks, interleaved<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t blockSize = shortDataBlockLen;<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t blockNum = 0; blockNum < numBlocks; blockNum++) {<\/div>\n
<\/div>\n
#if LOCK_VERSION == 0 || LOCK_VERSION >= 5<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (blockNum == numShortBlocks) { blockSize++; }<\/div>\n
#endif<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0rs_getRemainder(blockEccLen, coeff, dataBytes, blockSize, &result[offset + blockNum], numBlocks);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0dataBytes += blockSize;<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0memcpy(data->data, result, data->capacityBytes);<\/div>\n
\u00a0\u00a0\u00a0\u00a0data->bitOffsetOrWidth = moduleCount;<\/div>\n
}<\/div>\n
<\/div>\n
\/\/ We store the Format bits tightly packed into a single byte (each of the 4 modes is 2 bits)<\/div>\n
\/\/ The format bits can be determined by ECC_FORMAT_BITS >> (2 * ecc)<\/div>\n
static const uint8_t ECC_FORMAT_BITS = (0x02 << 6) | (0x03 << 4) | (0x00 << 2) | (0x01 << 0);<\/div>\n
<\/div>\n
<\/div>\n
#pragma mark – Public QRCode functions<\/div>\n
<\/div>\n
uint16_t qrcode_getBufferSize(uint8_t version) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0return bb_getGridSizeBytes(4 * version + 17);<\/div>\n
}<\/div>\n
<\/div>\n
\/\/ @TODO: Return error if data is too big.<\/div>\n
int8_t qrcode_initBytes(QRCode *qrcode, uint8_t *modules, uint8_t version, uint8_t ecc, uint8_t *data, uint16_t length) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t size = version * 4 + 17;<\/div>\n
\u00a0\u00a0\u00a0\u00a0qrcode->version = version;<\/div>\n
\u00a0\u00a0\u00a0\u00a0qrcode->size = size;<\/div>\n
\u00a0\u00a0\u00a0\u00a0qrcode->ecc = ecc;<\/div>\n
\u00a0\u00a0\u00a0\u00a0qrcode->modules = modules;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t eccFormatBits = (ECC_FORMAT_BITS >> (2 * ecc)) & 0x03;<\/div>\n
<\/div>\n
#if LOCK_VERSION == 0<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t moduleCount = NUM_RAW_DATA_MODULES[version – 1];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t dataCapacity = moduleCount \/ 8 – NUM_ERROR_CORRECTION_CODEWORDS[eccFormatBits][version – 1];<\/div>\n
#else<\/div>\n
\u00a0\u00a0\u00a0\u00a0version = LOCK_VERSION;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t moduleCount = NUM_RAW_DATA_MODULES;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint16_t dataCapacity = moduleCount \/ 8 – NUM_ERROR_CORRECTION_CODEWORDS[eccFormatBits];<\/div>\n
#endif<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0struct BitBucket codewords;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/uint8_t codewordBytes[bb_getBufferSizeBytes(moduleCount)];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t codewordBytes[203]; \/\/bb_getBufferSizeBytes(moduleCount)<\/div>\n
\u00a0\u00a0\u00a0\u00a0bb_initBuffer(&codewords, codewordBytes, (int32_t)sizeof(codewordBytes));<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Place the data code words into the buffer<\/div>\n
\u00a0\u00a0\u00a0\u00a0int8_t mode = encodeDataCodewords(&codewords, data, length, version);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (mode < 0) { return -1; }<\/div>\n
\u00a0\u00a0\u00a0\u00a0qrcode->mode = mode;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Add terminator and pad up to a byte if applicable<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t padding = (dataCapacity * 8) – codewords.bitOffsetOrWidth;<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (padding > 4) { padding = 4; }<\/div>\n
\u00a0\u00a0\u00a0\u00a0bb_appendBits(&codewords, 0, padding);<\/div>\n
\u00a0\u00a0\u00a0\u00a0bb_appendBits(&codewords, 0, (8 – codewords.bitOffsetOrWidth % 8) % 8);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Pad with alternate bytes until data capacity is reached<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t padByte = 0xEC; codewords.bitOffsetOrWidth < (dataCapacity * 8); padByte ^= 0xEC ^ 0x11) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0bb_appendBits(&codewords, padByte, 8);<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0BitBucket modulesGrid;<\/div>\n
\u00a0\u00a0\u00a0\u00a0bb_initGrid(&modulesGrid, modules, size);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0BitBucket isFunctionGrid;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/uint8_t isFunctionGridBytes[bb_getGridSizeBytes(size)];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t isFunctionGridBytes[137]; \/\/bb_getGridSizeBytes(size)<\/div>\n
\u00a0\u00a0\u00a0\u00a0bb_initGrid(&isFunctionGrid, isFunctionGridBytes, size);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Draw function patterns, draw all codewords, do masking<\/div>\n
\u00a0\u00a0\u00a0\u00a0drawFunctionPatterns(&modulesGrid, &isFunctionGrid, version, eccFormatBits);<\/div>\n
\u00a0\u00a0\u00a0\u00a0performErrorCorrection(version, eccFormatBits, &codewords);<\/div>\n
\u00a0\u00a0\u00a0\u00a0drawCodewords(&modulesGrid, &isFunctionGrid, &codewords);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Find the best (lowest penalty) mask<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t mask = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0int32_t minPenalty = INT32_MAX;<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t i = 0; i < 8; i++) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0drawFormatBits(&modulesGrid, &isFunctionGrid, eccFormatBits, i);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0applyMask(&modulesGrid, &isFunctionGrid, i);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0int penalty = getPenaltyScore(&modulesGrid);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (penalty < minPenalty) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0mask = i;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0minPenalty = penalty;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0applyMask(&modulesGrid, &isFunctionGrid, i);\u00a0\u00a0\/\/ Undoes the mask due to XOR<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0qrcode->mask = mask;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Overwrite old format bits<\/div>\n
\u00a0\u00a0\u00a0\u00a0drawFormatBits(&modulesGrid, &isFunctionGrid, eccFormatBits, mask);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Apply the final choice of mask<\/div>\n
\u00a0\u00a0\u00a0\u00a0applyMask(&modulesGrid, &isFunctionGrid, mask);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0return 0;<\/div>\n
}<\/div>\n
<\/div>\n
int8_t qrcode_initText(QRCode *qrcode, uint8_t *modules, uint8_t version, uint8_t ecc, const char *data) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0return qrcode_initBytes(qrcode, modules, version, ecc, (uint8_t*)data, strlen(data));<\/div>\n
}<\/div>\n
<\/div>\n
bool qrcode_getModule(QRCode *qrcode, uint8_t x, uint8_t y) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0if (x < 0 || x >= qrcode->size || y < 0 || y >= qrcode->size) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0return false;<\/div>\n
\u00a0\u00a0\u00a0\u00a0}<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint32_t offset = y * qrcode->size + x;<\/div>\n
\u00a0\u00a0\u00a0\u00a0return (qrcode->modules[offset >> 3] & (1 << (7 – (offset & 0x07)))) != 0;<\/div>\n
}<\/div>\n
<\/div>\n
\/*<\/div>\n
uint8_t qrcode_getHexLength(QRCode *qrcode) {<\/div>\n
\u00a0\u00a0\u00a0\u00a0return ((qrcode->size * qrcode->size) + 7) \/ 4;<\/div>\n
}<\/div>\n
void qrcode_getHex(QRCode *qrcode, char *result) {<\/div>\n
<\/div>\n
}<\/div>\n
*\/<\/div>\n
<\/div>\n
<\/div>\n
\/\/Produce QRCode, only support Model1, no Model2.<\/div>\n
\/\/posX, posY: related to canvas.<\/div>\n
\/\/width, height: width*33 = real qrcode width, height*33 = real qrcode height.<\/div>\n
void QrCode_Produce(lv_obj_t *canvas, int posX, int posY, int width, int height, char *str)<\/div>\n
{<\/div>\n
\u00a0\u00a0\u00a0\u00a0lv_draw_rect_dsc_t rect_dsc;<\/div>\n
\u00a0\u00a0\u00a0\u00a0lv_draw_rect_dsc_init(&rect_dsc);<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.radius = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.bg_opa = LV_OPA_COVER;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.bg_grad_dir = LV_GRAD_DIR_HOR;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.bg_color = LV_COLOR_BLACK;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.bg_grad_color = LV_COLOR_BLACK;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.border_width = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.border_opa = LV_OPA_90;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.border_color = LV_COLOR_WHITE;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.shadow_width = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.shadow_ofs_x = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc.shadow_ofs_y = 0;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0lv_draw_rect_dsc_t rect_dsc1;<\/div>\n
\u00a0\u00a0\u00a0\u00a0lv_draw_rect_dsc_init(&rect_dsc1);<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.radius = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.bg_opa = LV_OPA_COVER;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.bg_grad_dir = LV_GRAD_DIR_HOR;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.bg_color = LV_COLOR_WHITE;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.bg_grad_color = LV_COLOR_WHITE;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.border_width = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.border_opa = LV_OPA_90;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.border_color = LV_COLOR_WHITE;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.shadow_width = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.shadow_ofs_x = 0;<\/div>\n
\u00a0\u00a0\u00a0\u00a0rect_dsc1.shadow_ofs_y = 0;<\/div>\n
<\/div>\n
\/*<\/div>\n
# define WIDTH 200<\/div>\n
# define HEIGHT 150<\/div>\n
\u00a0\u00a0\u00a0\u00a0static lv_color_t cbuf[LV_CANVAS_BUF_SIZE_TRUE_COLOR(WIDTH, HEIGHT)];<\/div>\n
\u00a0\u00a0\u00a0\u00a0lv_obj_t * canvas = lv_canvas_create(lv_scr_act(), NULL);<\/div>\n
\u00a0\u00a0\u00a0\u00a0lv_canvas_set_buffer(canvas, cbuf, WIDTH, HEIGHT, LV_IMG_CF_TRUE_COLOR);<\/div>\n
\u00a0\u00a0\u00a0\u00a0lv_obj_align(canvas, NULL, LV_ALIGN_IN_TOP_LEFT, 0, 0);<\/div>\n
\u00a0\u00a0\u00a0\u00a0lv_canvas_fill_bg(canvas, LV_COLOR_SILVER, LV_OPA_COVER);<\/div>\n
*\/<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t box_x = posX;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t box_y = posY;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t box_s = width;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t init_x = box_x;<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/ Create the QR code, only support version 4, ecc 0<\/div>\n
\u00a0\u00a0\u00a0\u00a0QRCode qrcode;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/version: 1: 21×21, x: 21+4*(x-1),(x from 1 to 14)<\/div>\n
\u00a0\u00a0\u00a0\u00a0\/\/uint8_t qrcodeData[qrcode_getBufferSize(4)];<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t qrcodeData[137]; \/\/qrcode_getBufferSize(4)<\/div>\n
\u00a0\u00a0\u00a0\u00a0qrcode_initText(&qrcode, qrcodeData, 4, 0, str);<\/div>\n
\u00a0\u00a0\u00a0\u00a0printf(“QrCode_Produce: box_s:%d, qrcode.size:%d\\n”, box_s, qrcode.size);<\/div>\n
<\/div>\n
\u00a0\u00a0\u00a0\u00a0for (uint8_t y = 0; y < qrcode.size; y++){<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ Each horizontal module<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0for (uint8_t x = 0; x < qrcode.size; x++)<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0{<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ Print each module (UTF-8 \\u2588 is a solid block)<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/Serial.print(qrcode_getModule(&qrcode, x, y) ? “\\u2588\\u2588″: ”\u00a0\u00a0“);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if (qrcode_getModule(&qrcode, x, y))<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0{<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/Serial.println(py+ps);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/display.fillRect(box_x, box_y, box_s, box_s, GxEPD_BLACK);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_canvas_draw_rect(canvas, box_x, box_y, box_s, box_s, &rect_dsc);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0else<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0{<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/Serial.println(py+ps);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/ display.fillRect(box_x, box_y, box_s, box_s, GxEPD_WHITE);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0lv_canvas_draw_rect(canvas, box_x, box_y, box_s, box_s, &rect_dsc1);<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0box_x = box_x + box_s;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0box_y = box_y + box_s;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0box_x = init_x;<\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0}<\/div>\n
}<\/div>\n
<\/div>\n
<\/div>\n
\u5934\u6587\u4ef6qrcode.h\uff1a<\/strong><\/div>\n
<\/div>\n
#ifndef __QRCODE_H_<\/div>\n
#define __QRCODE_H_<\/div>\n
<\/div>\n
#ifndef __cplusplus<\/div>\n
\/\/typedef unsigned char bool;<\/div>\n
\/\/static const bool false = 0;<\/div>\n
\/\/static const bool true = 1;<\/div>\n
#define false 0<\/div>\n
#define true 1<\/div>\n
#endif<\/div>\n
<\/div>\n
#include <stdint.h><\/div>\n
<\/div>\n
<\/div>\n
\/\/ QR Code Format Encoding<\/div>\n
#define MODE_NUMERIC\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a00<\/div>\n
#define MODE_ALPHANUMERIC\u00a0\u00a0\u00a01<\/div>\n
#define MODE_BYTE\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a02<\/div>\n
<\/div>\n
<\/div>\n
\/\/ Error Correction Code Levels<\/div>\n
#define ECC_LOW\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a00<\/div>\n
#define ECC_MEDIUM\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a01<\/div>\n
#define ECC_QUARTILE\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a02<\/div>\n
#define ECC_HIGH\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a03<\/div>\n
<\/div>\n
<\/div>\n
\/\/ If set to non-zero, this library can ONLY produce QR codes at that version<\/div>\n
\/\/ This saves a lot of dynamic memory, as the codeword tables are skipped<\/div>\n
#ifndef LOCK_VERSION<\/div>\n
#define LOCK_VERSION\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a00<\/div>\n
#endif<\/div>\n
<\/div>\n
<\/div>\n
typedef struct QRCode {<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t version;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t size;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t ecc;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t mode;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t mask;<\/div>\n
\u00a0\u00a0\u00a0\u00a0uint8_t *modules;<\/div>\n
} QRCode;<\/div>\n
<\/div>\n
<\/div>\n
#ifdef __cplusplus<\/div>\n
extern “C”{<\/div>\n
#endif\u00a0\u00a0\/* __cplusplus *\/<\/div>\n
<\/div>\n
<\/div>\n
<\/div>\n
uint16_t qrcode_getBufferSize(uint8_t version);<\/div>\n
<\/div>\n
int8_t qrcode_initText(QRCode *qrcode, uint8_t *modules, uint8_t version, uint8_t ecc, const char *data);<\/div>\n
int8_t qrcode_initBytes(QRCode *qrcode, uint8_t *modules, uint8_t version, uint8_t ecc, uint8_t *data, uint16_t length);<\/div>\n
<\/div>\n
bool qrcode_getModule(QRCode *qrcode, uint8_t x, uint8_t y);<\/div>\n
<\/div>\n
void QrCode_Produce(lv_obj_t *canvas, int posX, int posY, int width, int height, char *str);<\/div>\n
<\/div>\n
#ifdef __cplusplus<\/div>\n
}<\/div>\n
#endif\u00a0\u00a0\/* __cplusplus *\/<\/div>\n
<\/div>\n
<\/div>\n
#endif\u00a0\u00a0\/* __QRCODE_H_ *\/<\/div>\n
<\/div>\n
\n
<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

\u4e8c\u7ef4\u7801\u6709\u4e24\u79cd\u6a21\u5f0f\uff0c\u8fd9\u91cc\u53ea\u652f\u6301Model1\uff0c\u4e0d\u652f\u6301Model2\u3002 Model1\u4e8c\u7ef4\u7801\u670914\u4e2dversion\uff0cve …<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6,13],"tags":[851,868,869],"class_list":["post-1141","post","type-post","status-publish","format-standard","hentry","category-6","category-13","tag-lvgl","tag-qrcode","tag-869"],"views":1759,"_links":{"self":[{"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/1141","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1141"}],"version-history":[{"count":1,"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/1141\/revisions"}],"predecessor-version":[{"id":1142,"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/1141\/revisions\/1142"}],"wp:attachment":[{"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1141"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1141"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.max-shu.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1141"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}