2017-04-17 17:43:38 +00:00
|
|
|
/*
|
|
|
|
* QR Code generator library (C)
|
|
|
|
*
|
2017-04-24 20:41:54 +00:00
|
|
|
* Copyright (c) Project Nayuki. (MIT License)
|
2017-04-17 17:43:38 +00:00
|
|
|
* 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>
|
2017-07-04 05:27:18 +00:00
|
|
|
#include <stddef.h>
|
2017-04-17 19:15:40 +00:00
|
|
|
#include <stdint.h>
|
2017-04-17 17:43:38 +00:00
|
|
|
|
|
|
|
|
2017-09-09 06:09:17 +00:00
|
|
|
/*---- Enum and struct types----*/
|
2017-04-19 21:08:05 +00:00
|
|
|
|
2017-04-17 19:22:55 +00:00
|
|
|
/*
|
2017-09-09 06:09:17 +00:00
|
|
|
* The error correction level used in a QR Code symbol.
|
2017-04-17 19:22:55 +00:00
|
|
|
*/
|
|
|
|
enum qrcodegen_Ecc {
|
2017-04-26 17:21:44 +00:00
|
|
|
qrcodegen_Ecc_LOW = 0,
|
2017-04-17 19:22:55 +00:00
|
|
|
qrcodegen_Ecc_MEDIUM,
|
|
|
|
qrcodegen_Ecc_QUARTILE,
|
|
|
|
qrcodegen_Ecc_HIGH,
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2017-09-09 06:09:17 +00:00
|
|
|
* The mask pattern used in a QR Code symbol.
|
2017-04-17 19:22:55 +00:00
|
|
|
*/
|
|
|
|
enum qrcodegen_Mask {
|
2017-09-09 06:09:17 +00:00
|
|
|
// A special value to tell the QR Code encoder to
|
|
|
|
// automatically select an appropriate mask pattern
|
2017-04-17 19:22:55 +00:00
|
|
|
qrcodegen_Mask_AUTO = -1,
|
2017-09-09 06:09:17 +00:00
|
|
|
// The eight actual mask patterns
|
2017-04-17 19:22:55 +00:00
|
|
|
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,
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2017-09-08 03:16:43 +00:00
|
|
|
/*
|
|
|
|
* The mode field of a segment.
|
|
|
|
*/
|
|
|
|
enum qrcodegen_Mode {
|
|
|
|
qrcodegen_Mode_NUMERIC,
|
|
|
|
qrcodegen_Mode_ALPHANUMERIC,
|
|
|
|
qrcodegen_Mode_BYTE,
|
|
|
|
qrcodegen_Mode_KANJI,
|
|
|
|
qrcodegen_Mode_ECI,
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2017-09-09 06:09:17 +00:00
|
|
|
/*
|
|
|
|
* A segment of user/application data that a QR Code symbol can convey.
|
|
|
|
* Each segment has a mode, a character count, and character/general data that is
|
|
|
|
* already encoded as a sequence of bits. The maximum allowed bit length is 32767,
|
|
|
|
* because even the largest QR Code (version 40) has only 31329 modules.
|
2017-09-08 03:16:43 +00:00
|
|
|
*/
|
|
|
|
struct qrcodegen_Segment {
|
|
|
|
// The mode indicator for this segment.
|
|
|
|
enum qrcodegen_Mode mode;
|
|
|
|
|
2017-09-09 06:09:17 +00:00
|
|
|
// The length of this segment's unencoded data. Always in the range [0, 32767].
|
|
|
|
// For numeric, alphanumeric, and kanji modes, this measures in Unicode code points.
|
|
|
|
// For byte mode, this measures in bytes (raw binary data, text in UTF-8, or other encodings).
|
|
|
|
// For ECI mode, this is always zero.
|
2017-09-08 03:16:43 +00:00
|
|
|
int numChars;
|
|
|
|
|
2017-09-09 06:09:17 +00:00
|
|
|
// The data bits of this segment, packed in bitwise big endian.
|
|
|
|
// Can be null if the bit length is zero.
|
2017-09-08 03:16:43 +00:00
|
|
|
uint8_t *data;
|
|
|
|
|
2017-09-09 06:09:17 +00:00
|
|
|
// The number of valid data bits used in the buffer. Requires
|
|
|
|
// 0 <= bitLength <= 32767, and bitLength <= (capacity of data array) * 8.
|
2017-09-08 03:16:43 +00:00
|
|
|
int bitLength;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2017-04-19 21:08:05 +00:00
|
|
|
|
|
|
|
/*---- Macro constants and functions ----*/
|
|
|
|
|
2017-04-26 17:20:38 +00:00
|
|
|
// The minimum and maximum defined QR Code version numbers for Model 2.
|
2017-04-19 22:17:07 +00:00
|
|
|
#define qrcodegen_VERSION_MIN 1
|
|
|
|
#define qrcodegen_VERSION_MAX 40
|
|
|
|
|
2017-04-17 19:22:55 +00:00
|
|
|
// 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.
|
2017-09-09 06:09:17 +00:00
|
|
|
// Requires qrcodegen_VERSION_MIN <= n <= qrcodegen_VERSION_MAX.
|
2017-04-25 05:31:15 +00:00
|
|
|
#define qrcodegen_BUFFER_LEN_FOR_VERSION(n) ((((n) * 4 + 17) * ((n) * 4 + 17) + 7) / 8 + 1)
|
2017-04-17 19:22:55 +00:00
|
|
|
|
2017-04-19 21:40:14 +00:00
|
|
|
// The worst-case number of bytes needed to store one QR Code, up to and including
|
2017-04-26 17:20:38 +00:00
|
|
|
// version 40. This value equals 3918, which is just under 4 kilobytes.
|
2017-09-09 06:09:17 +00:00
|
|
|
// Use this more convenient value to avoid calculating tighter memory bounds for buffers.
|
2017-04-19 22:17:07 +00:00
|
|
|
#define qrcodegen_BUFFER_LEN_MAX qrcodegen_BUFFER_LEN_FOR_VERSION(qrcodegen_VERSION_MAX)
|
2017-04-17 19:22:55 +00:00
|
|
|
|
|
|
|
|
2017-04-19 21:08:05 +00:00
|
|
|
|
2017-05-06 11:43:14 +00:00
|
|
|
/*---- Functions to generate QR Codes ----*/
|
2017-04-19 21:08:05 +00:00
|
|
|
|
2017-04-19 20:45:50 +00:00
|
|
|
/*
|
2017-04-26 17:20:38 +00:00
|
|
|
* Encodes the given text string to a QR Code symbol, returning true if encoding succeeded.
|
|
|
|
* 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.
|
|
|
|
* - The variables ecl and mask must correspond to enum constant values.
|
|
|
|
* - Requires 1 <= minVersion <= maxVersion <= 40.
|
|
|
|
* - The arrays tempBuffer and qrcode must each have a length
|
|
|
|
* of at least qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion).
|
|
|
|
* - After the function returns, tempBuffer contains no useful data.
|
|
|
|
* - 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.
|
2017-05-06 11:43:14 +00:00
|
|
|
* - Please consult the QR Code specification for information on
|
2017-04-26 17:20:38 +00:00
|
|
|
* data capacities per version, ECC level, and text encoding mode.
|
2017-04-19 20:45:50 +00:00
|
|
|
*/
|
2017-04-25 06:15:11 +00:00
|
|
|
bool qrcodegen_encodeText(const char *text, uint8_t tempBuffer[], uint8_t qrcode[],
|
2017-04-19 20:46:32 +00:00
|
|
|
enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl);
|
2017-04-19 20:45:50 +00:00
|
|
|
|
|
|
|
|
2017-04-19 18:07:02 +00:00
|
|
|
/*
|
2017-04-26 17:20:38 +00:00
|
|
|
* Encodes the given binary data to a QR Code symbol, returning true if encoding succeeded.
|
|
|
|
* 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 array range dataAndTemp[0 : dataLen] should normally be
|
|
|
|
* valid UTF-8 text, but is not required by the QR Code standard.
|
|
|
|
* - The variables ecl and mask must correspond to enum constant values.
|
|
|
|
* - Requires 1 <= minVersion <= maxVersion <= 40.
|
|
|
|
* - The arrays dataAndTemp and qrcode must each have a length
|
|
|
|
* of at least qrcodegen_BUFFER_LEN_FOR_VERSION(maxVersion).
|
|
|
|
* - After the function returns, the contents of dataAndTemp may have changed,
|
|
|
|
* and does not represent useful data anymore.
|
|
|
|
* - 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. This is the hard upper limit of the QR Code standard.
|
2017-05-06 11:43:14 +00:00
|
|
|
* - Please consult the QR Code specification for information on
|
2017-04-26 17:20:38 +00:00
|
|
|
* data capacities per version, ECC level, and text encoding mode.
|
2017-04-19 18:07:02 +00:00
|
|
|
*/
|
2017-04-25 06:15:11 +00:00
|
|
|
bool qrcodegen_encodeBinary(uint8_t dataAndTemp[], size_t dataLen, uint8_t qrcode[],
|
2017-04-19 20:46:32 +00:00
|
|
|
enum qrcodegen_Ecc ecl, int minVersion, int maxVersion, enum qrcodegen_Mask mask, bool boostEcl);
|
2017-04-19 18:07:02 +00:00
|
|
|
|
|
|
|
|
2017-09-08 06:13:16 +00:00
|
|
|
/*
|
|
|
|
* Tests whether the given string can be encoded as a segment in alphanumeric mode.
|
|
|
|
*/
|
|
|
|
bool qrcodegen_isAlphanumeric(const char *text);
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Tests whether the given string can be encoded as a segment in numeric mode.
|
|
|
|
*/
|
|
|
|
bool qrcodegen_isNumeric(const char *text);
|
|
|
|
|
|
|
|
|
2017-09-08 05:57:10 +00:00
|
|
|
/*
|
|
|
|
* 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 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);
|
|
|
|
|
|
|
|
|
2017-09-08 06:43:25 +00:00
|
|
|
/*
|
|
|
|
* Returns a segment representing the given binary data encoded in byte mode.
|
|
|
|
*/
|
|
|
|
struct qrcodegen_Segment qrcodegen_makeBytes(const uint8_t data[], size_t len, uint8_t buf[]);
|
|
|
|
|
|
|
|
|
2017-09-08 07:06:22 +00:00
|
|
|
/*
|
|
|
|
* 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[]);
|
|
|
|
|
|
|
|
|
2017-09-08 06:43:25 +00:00
|
|
|
/*
|
|
|
|
* 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[]);
|
|
|
|
|
|
|
|
|
2017-09-09 05:46:11 +00:00
|
|
|
/*
|
|
|
|
* Renders a QR Code symbol representing the given data segments at the given error correction
|
|
|
|
* level or higher. The smallest possible QR Code version is automatically chosen for the output.
|
|
|
|
* Returns true if QR Code creation succeeded, or false if the data is too long to fit in any version.
|
|
|
|
* This function allows the user to create a custom sequence of segments that switches
|
|
|
|
* between modes (such as alphanumeric and binary) to encode text more efficiently.
|
|
|
|
* This function is considered to be lower level than simply encoding text or binary data.
|
|
|
|
* To save memory, the segments' data buffers can alias/overlap tempBuffer, and will
|
|
|
|
* result in them being clobbered, but the QR Code output will still be correct.
|
|
|
|
* But the qrcode array must not overlap tempBuffer or any segment's data buffer.
|
|
|
|
*/
|
2017-09-09 04:33:31 +00:00
|
|
|
bool qrcodegen_encodeSegments(const struct qrcodegen_Segment segs[], size_t len,
|
|
|
|
enum qrcodegen_Ecc ecl, uint8_t tempBuffer[], uint8_t qrcode[]);
|
|
|
|
|
|
|
|
|
2017-09-09 05:46:11 +00:00
|
|
|
/*
|
|
|
|
* Renders a QR Code symbol representing the given data segments with the given encoding parameters.
|
|
|
|
* Returns true if QR Code creation succeeded, or false if the data is too long to fit in the range of versions.
|
|
|
|
* The smallest possible QR Code version within the given range is automatically chosen for the output.
|
|
|
|
* This function allows the user to create a custom sequence of segments that switches
|
|
|
|
* between modes (such as alphanumeric and binary) to encode text more efficiently.
|
|
|
|
* This function is considered to be lower level than simply encoding text or binary data.
|
|
|
|
* To save memory, the segments' data buffers can alias/overlap tempBuffer, and will
|
|
|
|
* result in them being clobbered, but the QR Code output will still be correct.
|
|
|
|
* But the qrcode array must not overlap tempBuffer or any segment's data buffer.
|
|
|
|
*/
|
2017-09-09 04:33:31 +00:00
|
|
|
bool qrcodegen_encodeSegmentsAdvanced(const struct qrcodegen_Segment segs[], size_t len, enum qrcodegen_Ecc ecl,
|
|
|
|
int minVersion, int maxVersion, int mask, bool boostEcl, uint8_t tempBuffer[], uint8_t qrcode[]);
|
|
|
|
|
2017-04-19 21:08:05 +00:00
|
|
|
|
2017-05-06 11:43:14 +00:00
|
|
|
/*---- Functions to extract raw data from QR Codes ----*/
|
2017-04-19 21:08:05 +00:00
|
|
|
|
2017-04-17 18:02:14 +00:00
|
|
|
/*
|
2017-04-26 17:20:38 +00:00
|
|
|
* Returns the side length of the given QR Code, assuming that encoding succeeded.
|
2017-05-06 11:43:14 +00:00
|
|
|
* 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).
|
2017-04-17 18:02:14 +00:00
|
|
|
*/
|
2017-04-25 06:00:39 +00:00
|
|
|
int qrcodegen_getSize(const uint8_t qrcode[]);
|
2017-04-17 18:02:14 +00:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Returns the color of the module (pixel) at the given coordinates, which is either
|
2017-04-26 17:20:38 +00:00
|
|
|
* false for white or true for black. The top left corner has the coordinates (x=0, y=0).
|
2017-04-17 18:02:14 +00:00
|
|
|
* If the given coordinates are out of bounds, then false (white) is returned.
|
|
|
|
*/
|
2017-04-25 05:46:01 +00:00
|
|
|
bool qrcodegen_getModule(const uint8_t qrcode[], int x, int y);
|