1 /*
2  * QR Code generator library (C)
3  *
4  * Copyright (c) Project Nayuki. (MIT License)
5  * https://www.nayuki.io/page/qr-code-generator-library
6  *
7  * Permission is hereby granted, free of charge, to any person obtaining a copy of
8  * this software and associated documentation files (the "Software"), to deal in
9  * the Software without restriction, including without limitation the rights to
10  * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
11  * the Software, and to permit persons to whom the Software is furnished to do so,
12  * subject to the following conditions:
13  * - The above copyright notice and this permission notice shall be included in
14  *   all copies or substantial portions of the Software.
15  * - The Software is provided "as is", without warranty of any kind, express or
16  *   implied, including but not limited to the warranties of merchantability,
17  *   fitness for a particular purpose and noninfringement. In no event shall the
18  *   authors or copyright holders be liable for any claim, damages or other
19  *   liability, whether in an action of contract, tort or otherwise, arising from,
20  *   out of or in connection with the Software or the use or other dealings in the
21  *   Software.
22  */
23 
24 #pragma once
25 
26 #include "../../../lvgl.h"
27 #ifdef LV_USE_QRCODE
28 
29 #include LV_STDBOOL_INCLUDE
30 #include LV_STDDEF_INCLUDE
31 #include LV_STDINT_INCLUDE
32 
33 
34 #ifdef __cplusplus
35 extern "C" {
36 #endif
37 
38 
39 /*
40  * This library creates QR Code symbols, which is a type of two-dimension barcode.
41  * Invented by Denso Wave and described in the ISO/IEC 18004 standard.
42  * A QR Code structure is an immutable square grid of black and white cells.
43  * The library provides functions to create a QR Code from text or binary data.
44  * The library covers the QR Code Model 2 specification, supporting all versions (sizes)
45  * from 1 to 40, all 4 error correction levels, and 4 character encoding modes.
46  *
47  * Ways to create a QR Code object:
48  * - High level: Take the payload data and call qrcodegen_encodeText() or qrcodegen_encodeBinary().
49  * - Low level: Custom-make the list of segments and call
50  *   qrcodegen_encodeSegments() or qrcodegen_encodeSegmentsAdvanced().
51  * (Note that all ways require supplying the desired error correction level and various byte buffers.)
52  */
53 
54 
55 /*---- Enum and struct types----*/
56 
57 /*
58  * The error correction level in a QR Code symbol.
59  */
60 enum qrcodegen_Ecc {
61     // Must be declared in ascending order of error protection
62     // so that an internal qrcodegen function works properly
63     qrcodegen_Ecc_LOW = 0,   // The QR Code can tolerate about  7% erroneous codewords
64     qrcodegen_Ecc_MEDIUM,    // The QR Code can tolerate about 15% erroneous codewords
65     qrcodegen_Ecc_QUARTILE,  // The QR Code can tolerate about 25% erroneous codewords
66     qrcodegen_Ecc_HIGH,      // The QR Code can tolerate about 30% erroneous codewords
67 };
68 
69 
70 /*
71  * The mask pattern used in a QR Code symbol.
72  */
73 enum qrcodegen_Mask {
74     // A special value to tell the QR Code encoder to
75     // automatically select an appropriate mask pattern
76     qrcodegen_Mask_AUTO = -1,
77     // The eight actual mask patterns
78     qrcodegen_Mask_0 = 0,
79     qrcodegen_Mask_1,
80     qrcodegen_Mask_2,
81     qrcodegen_Mask_3,
82     qrcodegen_Mask_4,
83     qrcodegen_Mask_5,
84     qrcodegen_Mask_6,
85     qrcodegen_Mask_7,
86 };
87 
88 
89 /*
90  * Describes how a segment's data bits are interpreted.
91  */
92 enum qrcodegen_Mode {
93     qrcodegen_Mode_NUMERIC      = 0x1,
94     qrcodegen_Mode_ALPHANUMERIC = 0x2,
95     qrcodegen_Mode_BYTE         = 0x4,
96     qrcodegen_Mode_KANJI        = 0x8,
97     qrcodegen_Mode_ECI          = 0x7,
98 };
99 
100 
101 /*
102  * A segment of character/binary/control data in a QR Code symbol.
103  * The mid-level way to create a segment is to take the payload data
104  * and call a factory function such as qrcodegen_makeNumeric().
105  * The low-level way to create a segment is to custom-make the bit buffer
106  * and initialize a qrcodegen_Segment struct with appropriate values.
107  * Even in the most favorable conditions, a QR Code can only hold 7089 characters of data.
108  * Any segment longer than this is meaningless for the purpose of generating QR Codes.
109  * Moreover, the maximum allowed bit length is 32767 because
110  * the largest QR Code (version 40) has 31329 modules.
111  */
112 struct qrcodegen_Segment {
113     // The mode indicator of this segment.
114     enum qrcodegen_Mode mode;
115 
116     // The length of this segment's unencoded data. Measured in characters for
117     // numeric/alphanumeric/kanji mode, bytes for byte mode, and 0 for ECI mode.
118     // Always zero or positive. Not the same as the data's bit length.
119     int numChars;
120 
121     // The data bits of this segment, packed in bitwise big endian.
122     // Can be null if the bit length is zero.
123     uint8_t * data;
124 
125     // The number of valid data bits used in the buffer. Requires
126     // 0 <= bitLength <= 32767, and bitLength <= (capacity of data array) * 8.
127     // The character count (numChars) must agree with the mode and the bit buffer length.
128     int bitLength;
129 };
130 
131 
132 
133 /*---- Macro constants and functions ----*/
134 
135 #define qrcodegen_VERSION_MIN   1  // The minimum version number supported in the QR Code Model 2 standard
136 #define qrcodegen_VERSION_MAX  40  // The maximum version number supported in the QR Code Model 2 standard
137 
138 // Calculates the number of bytes needed to store any QR Code up to and including the given version number,
139 // as a compile-time constant. For example, 'uint8_t buffer[qrcodegen_BUFFER_LEN_FOR_VERSION(25)];'
140 // can store any single QR Code from version 1 to 25 (inclusive). The result fits in an int (or int16).
141 // Requires qrcodegen_VERSION_MIN <= n <= qrcodegen_VERSION_MAX.
142 #define qrcodegen_BUFFER_LEN_FOR_VERSION(n)  ((((n) * 4 + 17) * ((n) * 4 + 17) + 7) / 8 + 1)
143 
144 // The worst-case number of bytes needed to store one QR Code, up to and including
145 // version 40. This value equals 3918, which is just under 4 kilobytes.
146 // Use this more convenient value to avoid calculating tighter memory bounds for buffers.
147 #define qrcodegen_BUFFER_LEN_MAX  qrcodegen_BUFFER_LEN_FOR_VERSION(qrcodegen_VERSION_MAX)
148 
149 
150 
151 /*---- Functions (high level) to generate QR Codes ----*/
152 
153 /*
154  * Encodes the given text string to a QR Code, returning true if encoding succeeded.
155  * If the data is too long to fit in any version in the given range
156  * at the given ECC level, then false is returned.
157  * - The input text must be encoded in UTF-8 and contain no NULs.
158  * - The variables ecl and mask must correspond to enum constant values.
159  * - Requires 1 <= minVersion <= maxVersion <= 40.
160  * - The arrays tempBuffer and qrcode must each have a length
161  *   of at least qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion).
162  * - After the function returns, tempBuffer contains no useful data.
163  * - If successful, the resulting QR Code may use numeric,
164  *   alphanumeric, or byte mode to encode the text.
165  * - In the most optimistic case, a QR Code at version 40 with low ECC
166  *   can hold any UTF-8 string up to 2953 bytes, or any alphanumeric string
167  *   up to 4296 characters, or any digit string up to 7089 characters.
168  *   These numbers represent the hard upper limit of the QR Code standard.
169  * - Please consult the QR Code specification for information on
170  *   data capacities per version, ECC level, and text encoding mode.
171  */
172 bool qrcodegen_encodeText(const char * text, uint8_t tempBuffer[], uint8_t qrcode[],
173                           enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl);
174 
175 
176 /*
177  * Encodes the given binary data to a QR Code, returning true if encoding succeeded.
178  * If the data is too long to fit in any version in the given range
179  * at the given ECC level, then false is returned.
180  * - The input array range dataAndTemp[0 : dataLen] should normally be
181  *   valid UTF-8 text, but is not required by the QR Code standard.
182  * - The variables ecl and mask must correspond to enum constant values.
183  * - Requires 1 <= minVersion <= maxVersion <= 40.
184  * - The arrays dataAndTemp and qrcode must each have a length
185  *   of at least qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion).
186  * - After the function returns, the contents of dataAndTemp may have changed,
187  *   and does not represent useful data anymore.
188  * - If successful, the resulting QR Code will use byte mode to encode the data.
189  * - In the most optimistic case, a QR Code at version 40 with low ECC can hold any byte
190  *   sequence up to length 2953. This is the hard upper limit of the QR Code standard.
191  * - Please consult the QR Code specification for information on
192  *   data capacities per version, ECC level, and text encoding mode.
193  */
194 bool qrcodegen_encodeBinary(uint8_t dataAndTemp[], size_t dataLen, uint8_t qrcode[],
195                             enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl);
196 
197 
198 /*---- Functions (low level) to generate QR Codes ----*/
199 
200 /*
201  * Renders a QR Code representing the given segments at the given error correction level.
202  * The smallest possible QR Code version is automatically chosen for the output. Returns true if
203  * QR Code creation succeeded, or false if the data is too long to fit in any version. The ECC level
204  * of the result may be higher than the ecl argument if it can be done without increasing the version.
205  * This function allows the user to create a custom sequence of segments that switches
206  * between modes (such as alphanumeric and byte) to encode text in less space.
207  * This is a low-level API; the high-level API is qrcodegen_encodeText() and qrcodegen_encodeBinary().
208  * To save memory, the segments' data buffers can alias/overlap tempBuffer, and will
209  * result in them being clobbered, but the QR Code output will still be correct.
210  * But the qrcode array must not overlap tempBuffer or any segment's data buffer.
211  */
212 bool qrcodegen_encodeSegments(const struct qrcodegen_Segment segs[], size_t len,
213                               enum qrcodegen_Ecc ecl, uint8_t tempBuffer[], uint8_t qrcode[]);
214 
215 
216 /*
217  * Renders a QR Code representing the given segments with the given encoding parameters.
218  * Returns true if QR Code creation succeeded, or false if the data is too long to fit in the range of versions.
219  * The smallest possible QR Code version within the given range is automatically
220  * chosen for the output. Iff boostEcl is true, then the ECC level of the result
221  * may be higher than the ecl argument if it can be done without increasing the
222  * version. The mask number is either between 0 to 7 (inclusive) to force that
223  * mask, or -1 to automatically choose an appropriate mask (which may be slow).
224  * This function allows the user to create a custom sequence of segments that switches
225  * between modes (such as alphanumeric and byte) to encode text in less space.
226  * This is a low-level API; the high-level API is qrcodegen_encodeText() and qrcodegen_encodeBinary().
227  * To save memory, the segments' data buffers can alias/overlap tempBuffer, and will
228  * result in them being clobbered, but the QR Code output will still be correct.
229  * But the qrcode array must not overlap tempBuffer or any segment's data buffer.
230  */
231 bool qrcodegen_encodeSegmentsAdvanced(const struct qrcodegen_Segment segs[], size_t len, enum qrcodegen_Ecc ecl,
232                                       int minVersion, int maxVersion, int mask, bool boostEcl, uint8_t tempBuffer[], uint8_t qrcode[]);
233 
234 
235 /*
236  * Tests whether the given string can be encoded as a segment in alphanumeric mode.
237  * A string is encodable iff each character is in the following set: 0 to 9, A to Z
238  * (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.
239  */
240 bool qrcodegen_isAlphanumeric(const char * text);
241 
242 
243 /*
244  * Tests whether the given string can be encoded as a segment in numeric mode.
245  * A string is encodable iff each character is in the range 0 to 9.
246  */
247 bool qrcodegen_isNumeric(const char * text);
248 
249 
250 /*
251  * Returns the number of bytes (uint8_t) needed for the data buffer of a segment
252  * containing the given number of characters using the given mode. Notes:
253  * - Returns SIZE_MAX on failure, i.e. numChars > INT16_MAX or
254  *   the number of needed bits exceeds INT16_MAX (i.e. 32767).
255  * - Otherwise, all valid results are in the range [0, ceil(INT16_MAX / 8)], i.e. at most 4096.
256  * - It is okay for the user to allocate more bytes for the buffer than needed.
257  * - For byte mode, numChars measures the number of bytes, not Unicode code points.
258  * - For ECI mode, numChars must be 0, and the worst-case number of bytes is returned.
259  *   An actual ECI segment can have shorter data. For non-ECI modes, the result is exact.
260  */
261 size_t qrcodegen_calcSegmentBufferSize(enum qrcodegen_Mode mode, size_t numChars);
262 
263 
264 /*
265  * Returns a segment representing the given binary data encoded in
266  * byte mode. All input byte arrays are acceptable. Any text string
267  * can be converted to UTF-8 bytes and encoded as a byte mode segment.
268  */
269 struct qrcodegen_Segment qrcodegen_makeBytes(const uint8_t data[], size_t len, uint8_t buf[]);
270 
271 
272 /*
273  * Returns a segment representing the given string of decimal digits encoded in numeric mode.
274  */
275 struct qrcodegen_Segment qrcodegen_makeNumeric(const char * digits, uint8_t buf[]);
276 
277 
278 /*
279  * Returns a segment representing the given text string encoded in alphanumeric mode.
280  * The characters allowed are: 0 to 9, A to Z (uppercase only), space,
281  * dollar, percent, asterisk, plus, hyphen, period, slash, colon.
282  */
283 struct qrcodegen_Segment qrcodegen_makeAlphanumeric(const char * text, uint8_t buf[]);
284 
285 
286 /*
287  * Returns a segment representing an Extended Channel Interpretation
288  * (ECI) designator with the given assignment value.
289  */
290 struct qrcodegen_Segment qrcodegen_makeEci(long assignVal, uint8_t buf[]);
291 
292 
293 /*---- Functions to extract raw data from QR Codes ----*/
294 
295 /*
296  * Returns the side length of the given QR Code, assuming that encoding succeeded.
297  * The result is in the range [21, 177]. Note that the length of the array buffer
298  * is related to the side length - every 'uint8_t qrcode[]' must have length at least
299  * qrcodegen_BUFFER_LEN_FOR_VERSION(version), which equals ceil(size^2 / 8 + 1).
300  */
301 int qrcodegen_getSize(const uint8_t qrcode[]);
302 
303 
304 /*
305  * Returns the color of the module (pixel) at the given coordinates, which is false
306  * for white or true for black. The top left corner has the coordinates (x=0, y=0).
307  * If the given coordinates are out of bounds, then false (white) is returned.
308  */
309 bool qrcodegen_getModule(const uint8_t qrcode[], int x, int y);
310 
311 /*
312  * Returns the qrcode size of the specified version. Returns -1 on failure
313  */
314 int qrcodegen_version2size(int version);
315 /*
316  * Returns the min version of the data that can be stored. Returns -1 on failure
317  */
318 int qrcodegen_getMinFitVersion(enum qrcodegen_Ecc ecl, size_t dataLen);
319 
320 #ifdef __cplusplus
321 }
322 #endif
323 
324 #endif
325