2016-04-15 04:26:37 +00:00
|
|
|
/*
|
|
|
|
* QR Code generator library (C++)
|
|
|
|
*
|
2017-04-24 20:41:54 +00:00
|
|
|
* Copyright (c) Project Nayuki. (MIT License)
|
2016-04-15 04:26:37 +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.
|
|
|
|
*/
|
|
|
|
|
2017-04-17 16:32:14 +00:00
|
|
|
#include <climits>
|
2016-04-16 03:53:58 +00:00
|
|
|
#include <cstddef>
|
2016-04-15 04:26:37 +00:00
|
|
|
#include "BitBuffer.hpp"
|
|
|
|
#include "QrSegment.hpp"
|
|
|
|
|
2017-05-05 20:57:13 +00:00
|
|
|
using std::uint8_t;
|
2017-05-05 21:03:08 +00:00
|
|
|
using std::vector;
|
2017-05-05 20:57:13 +00:00
|
|
|
|
2016-04-15 04:26:37 +00:00
|
|
|
|
2017-04-21 05:30:59 +00:00
|
|
|
namespace qrcodegen {
|
|
|
|
|
|
|
|
QrSegment::Mode::Mode(int mode, int cc0, int cc1, int cc2) :
|
2016-04-15 04:26:37 +00:00
|
|
|
modeBits(mode) {
|
|
|
|
numBitsCharCount[0] = cc0;
|
|
|
|
numBitsCharCount[1] = cc1;
|
|
|
|
numBitsCharCount[2] = cc2;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-04-21 05:30:59 +00:00
|
|
|
int QrSegment::Mode::numCharCountBits(int ver) const {
|
2016-04-15 04:26:37 +00:00
|
|
|
if ( 1 <= ver && ver <= 9) return numBitsCharCount[0];
|
|
|
|
else if (10 <= ver && ver <= 26) return numBitsCharCount[1];
|
|
|
|
else if (27 <= ver && ver <= 40) return numBitsCharCount[2];
|
|
|
|
else throw "Version number out of range";
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-04-21 05:30:59 +00:00
|
|
|
const QrSegment::Mode QrSegment::Mode::NUMERIC (0x1, 10, 12, 14);
|
|
|
|
const QrSegment::Mode QrSegment::Mode::ALPHANUMERIC(0x2, 9, 11, 13);
|
|
|
|
const QrSegment::Mode QrSegment::Mode::BYTE (0x4, 8, 16, 16);
|
|
|
|
const QrSegment::Mode QrSegment::Mode::KANJI (0x8, 8, 10, 12);
|
2016-04-15 04:26:37 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
2017-05-05 21:03:08 +00:00
|
|
|
QrSegment QrSegment::makeBytes(const vector<uint8_t> &data) {
|
2017-04-21 15:49:16 +00:00
|
|
|
if (data.size() >= (unsigned int)INT_MAX / 8)
|
|
|
|
throw "Buffer too long";
|
|
|
|
return QrSegment(Mode::BYTE, (int)data.size(), data, (int)data.size() * 8);
|
2016-04-15 04:26:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-04-21 05:30:59 +00:00
|
|
|
QrSegment QrSegment::makeNumeric(const char *digits) {
|
2016-04-15 04:26:37 +00:00
|
|
|
BitBuffer bb;
|
|
|
|
int accumData = 0;
|
|
|
|
int accumCount = 0;
|
|
|
|
int charCount = 0;
|
|
|
|
for (; *digits != '\0'; digits++, charCount++) {
|
|
|
|
char c = *digits;
|
|
|
|
if (c < '0' || c > '9')
|
|
|
|
throw "String contains non-numeric characters";
|
|
|
|
accumData = accumData * 10 + (c - '0');
|
|
|
|
accumCount++;
|
|
|
|
if (accumCount == 3) {
|
|
|
|
bb.appendBits(accumData, 10);
|
|
|
|
accumData = 0;
|
|
|
|
accumCount = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (accumCount > 0) // 1 or 2 digits remaining
|
|
|
|
bb.appendBits(accumData, accumCount * 3 + 1);
|
|
|
|
return QrSegment(Mode::NUMERIC, charCount, bb.getBytes(), bb.getBitLength());
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-04-21 05:30:59 +00:00
|
|
|
QrSegment QrSegment::makeAlphanumeric(const char *text) {
|
2016-04-15 04:26:37 +00:00
|
|
|
BitBuffer bb;
|
|
|
|
int accumData = 0;
|
|
|
|
int accumCount = 0;
|
|
|
|
int charCount = 0;
|
|
|
|
for (; *text != '\0'; text++, charCount++) {
|
|
|
|
char c = *text;
|
|
|
|
if (c < ' ' || c > 'Z')
|
|
|
|
throw "String contains unencodable characters in alphanumeric mode";
|
|
|
|
accumData = accumData * 45 + ALPHANUMERIC_ENCODING_TABLE[c - ' '];
|
|
|
|
accumCount++;
|
|
|
|
if (accumCount == 2) {
|
|
|
|
bb.appendBits(accumData, 11);
|
|
|
|
accumData = 0;
|
|
|
|
accumCount = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (accumCount > 0) // 1 character remaining
|
|
|
|
bb.appendBits(accumData, 6);
|
|
|
|
return QrSegment(Mode::ALPHANUMERIC, charCount, bb.getBytes(), bb.getBitLength());
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-05-05 21:03:08 +00:00
|
|
|
vector<QrSegment> QrSegment::makeSegments(const char *text) {
|
2016-04-16 01:44:24 +00:00
|
|
|
// Select the most efficient segment encoding automatically
|
2017-05-05 21:03:08 +00:00
|
|
|
vector<QrSegment> result;
|
2016-04-16 01:44:24 +00:00
|
|
|
if (*text == '\0'); // Leave the vector empty
|
|
|
|
else if (QrSegment::isNumeric(text))
|
|
|
|
result.push_back(QrSegment::makeNumeric(text));
|
|
|
|
else if (QrSegment::isAlphanumeric(text))
|
|
|
|
result.push_back(QrSegment::makeAlphanumeric(text));
|
|
|
|
else {
|
2017-05-05 21:03:08 +00:00
|
|
|
vector<uint8_t> bytes;
|
2016-04-16 01:44:24 +00:00
|
|
|
for (; *text != '\0'; text++)
|
|
|
|
bytes.push_back(static_cast<uint8_t>(*text));
|
|
|
|
result.push_back(QrSegment::makeBytes(bytes));
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-05-05 21:03:08 +00:00
|
|
|
QrSegment::QrSegment(const Mode &md, int numCh, const vector<uint8_t> &b, int bitLen) :
|
2016-04-15 04:26:37 +00:00
|
|
|
mode(md),
|
|
|
|
numChars(numCh),
|
|
|
|
data(b),
|
|
|
|
bitLength(bitLen) {
|
|
|
|
if (numCh < 0 || bitLen < 0 || b.size() != static_cast<unsigned int>((bitLen + 7) / 8))
|
|
|
|
throw "Invalid value";
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-05-05 21:03:08 +00:00
|
|
|
int QrSegment::getTotalBits(const vector<QrSegment> &segs, int version) {
|
2016-04-16 03:53:58 +00:00
|
|
|
if (version < 1 || version > 40)
|
|
|
|
throw "Version number out of range";
|
|
|
|
int result = 0;
|
2017-05-05 20:56:32 +00:00
|
|
|
for (std::size_t i = 0; i < segs.size(); i++) {
|
2016-04-16 03:53:58 +00:00
|
|
|
const QrSegment &seg(segs.at(i));
|
|
|
|
int ccbits = seg.mode.numCharCountBits(version);
|
|
|
|
// Fail if segment length value doesn't fit in the length field's bit-width
|
2017-04-24 20:47:32 +00:00
|
|
|
if (seg.numChars >= (1L << ccbits) || seg.bitLength > INT16_MAX)
|
2016-04-16 03:53:58 +00:00
|
|
|
return -1;
|
2017-04-17 16:32:14 +00:00
|
|
|
long temp = (long)result + 4 + ccbits + seg.bitLength;
|
|
|
|
if (temp > INT_MAX)
|
|
|
|
return -1;
|
|
|
|
result = temp;
|
2016-04-16 03:53:58 +00:00
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-04-21 05:30:59 +00:00
|
|
|
bool QrSegment::isAlphanumeric(const char *text) {
|
2016-04-15 04:26:37 +00:00
|
|
|
for (; *text != '\0'; text++) {
|
|
|
|
char c = *text;
|
|
|
|
if (c < ' ' || c > 'Z' || ALPHANUMERIC_ENCODING_TABLE[c - ' '] == -1)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-04-21 05:30:59 +00:00
|
|
|
bool QrSegment::isNumeric(const char *text) {
|
2016-04-15 04:26:37 +00:00
|
|
|
for (; *text != '\0'; text++) {
|
|
|
|
char c = *text;
|
|
|
|
if (c < '0' || c > '9')
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-04-21 05:30:59 +00:00
|
|
|
const int8_t QrSegment::ALPHANUMERIC_ENCODING_TABLE[59] = {
|
2016-04-15 04:26:37 +00:00
|
|
|
// SP, !, ", #, $, %, &, ', (, ), *, +, ,, -, ., /, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, :, ;, <, =, >, ?, @, // ASCII codes 32 to 64
|
|
|
|
36, -1, -1, -1, 37, 38, -1, -1, -1, -1, 39, 40, -1, 41, 42, 43, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 44, -1, -1, -1, -1, -1, -1, // Array indices 0 to 32
|
|
|
|
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, // Array indices 33 to 58
|
|
|
|
// A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, // ASCII codes 65 to 90
|
|
|
|
};
|
2017-04-21 05:30:59 +00:00
|
|
|
|
|
|
|
}
|