Nicolas Jager | 95c526b | 2016-10-20 09:47:03 -0400 | [diff] [blame] | 1 | /* |
| 2 | * qrencode - QR Code encoder |
| 3 | * |
| 4 | * Copyright (C) 2006-2012 Kentaro Fukuchi <kentaro@fukuchi.org> |
| 5 | * |
| 6 | * This library is free software; you can redistribute it and/or |
| 7 | * modify it under the terms of the GNU Lesser General Public |
| 8 | * License as published by the Free Software Foundation; either |
| 9 | * version 2.1 of the License, or any later version. |
| 10 | * |
| 11 | * This library is distributed in the hope that it will be useful, |
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 14 | * Lesser General Public License for more details. |
| 15 | * |
| 16 | * You should have received a copy of the GNU Lesser General Public |
| 17 | * License along with this library; if not, write to the Free Software |
| 18 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA |
| 19 | */ |
| 20 | |
| 21 | #if HAVE_CONFIG_H |
| 22 | # include "config.h" |
| 23 | #endif |
| 24 | #include <stdio.h> |
| 25 | #include <stdlib.h> |
| 26 | #include <string.h> |
| 27 | #include <errno.h> |
| 28 | |
| 29 | #include "qrencode.h" |
| 30 | #include "qrspec.h" |
| 31 | #include "mqrspec.h" |
| 32 | #include "bitstream.h" |
| 33 | #include "qrinput.h" |
| 34 | #include "rscode.h" |
| 35 | #include "split.h" |
| 36 | #include "mask.h" |
| 37 | #include "mmask.h" |
| 38 | |
| 39 | /****************************************************************************** |
| 40 | * Raw code |
| 41 | *****************************************************************************/ |
| 42 | |
| 43 | typedef struct { |
| 44 | int dataLength; |
| 45 | unsigned char *data; |
| 46 | int eccLength; |
| 47 | unsigned char *ecc; |
| 48 | } RSblock; |
| 49 | |
| 50 | typedef struct { |
| 51 | int version; |
| 52 | int dataLength; |
| 53 | int eccLength; |
| 54 | unsigned char *datacode; |
| 55 | unsigned char *ecccode; |
| 56 | int b1; |
| 57 | int blocks; |
| 58 | RSblock *rsblock; |
| 59 | int count; |
| 60 | } QRRawCode; |
| 61 | |
| 62 | static void RSblock_initBlock(RSblock *block, int dl, unsigned char *data, int el, unsigned char *ecc, RS *rs) |
| 63 | { |
| 64 | block->dataLength = dl; |
| 65 | block->data = data; |
| 66 | block->eccLength = el; |
| 67 | block->ecc = ecc; |
| 68 | |
| 69 | encode_rs_char(rs, data, ecc); |
| 70 | } |
| 71 | |
| 72 | static int RSblock_init(RSblock *blocks, int spec[5], unsigned char *data, unsigned char *ecc) |
| 73 | { |
| 74 | int i; |
| 75 | RSblock *block; |
| 76 | unsigned char *dp, *ep; |
| 77 | RS *rs; |
| 78 | int el, dl; |
| 79 | |
| 80 | dl = QRspec_rsDataCodes1(spec); |
| 81 | el = QRspec_rsEccCodes1(spec); |
| 82 | rs = init_rs(8, 0x11d, 0, 1, el, 255 - dl - el); |
| 83 | if(rs == NULL) return -1; |
| 84 | |
| 85 | block = blocks; |
| 86 | dp = data; |
| 87 | ep = ecc; |
| 88 | for(i=0; i<QRspec_rsBlockNum1(spec); i++) { |
| 89 | RSblock_initBlock(block, dl, dp, el, ep, rs); |
| 90 | dp += dl; |
| 91 | ep += el; |
| 92 | block++; |
| 93 | } |
| 94 | |
| 95 | if(QRspec_rsBlockNum2(spec) == 0) return 0; |
| 96 | |
| 97 | dl = QRspec_rsDataCodes2(spec); |
| 98 | el = QRspec_rsEccCodes2(spec); |
| 99 | rs = init_rs(8, 0x11d, 0, 1, el, 255 - dl - el); |
| 100 | if(rs == NULL) return -1; |
| 101 | for(i=0; i<QRspec_rsBlockNum2(spec); i++) { |
| 102 | RSblock_initBlock(block, dl, dp, el, ep, rs); |
| 103 | dp += dl; |
| 104 | ep += el; |
| 105 | block++; |
| 106 | } |
| 107 | |
| 108 | return 0; |
| 109 | } |
| 110 | |
| 111 | __STATIC void QRraw_free(QRRawCode *raw); |
| 112 | __STATIC QRRawCode *QRraw_new(QRinput *input) |
| 113 | { |
| 114 | QRRawCode *raw; |
| 115 | int spec[5], ret; |
| 116 | |
| 117 | raw = (QRRawCode *)malloc(sizeof(QRRawCode)); |
| 118 | if(raw == NULL) return NULL; |
| 119 | |
| 120 | raw->datacode = QRinput_getByteStream(input); |
| 121 | if(raw->datacode == NULL) { |
| 122 | free(raw); |
| 123 | return NULL; |
| 124 | } |
| 125 | |
| 126 | QRspec_getEccSpec(input->version, input->level, spec); |
| 127 | |
| 128 | raw->version = input->version; |
| 129 | raw->b1 = QRspec_rsBlockNum1(spec); |
| 130 | raw->dataLength = QRspec_rsDataLength(spec); |
| 131 | raw->eccLength = QRspec_rsEccLength(spec); |
| 132 | raw->ecccode = (unsigned char *)malloc(raw->eccLength); |
| 133 | if(raw->ecccode == NULL) { |
| 134 | free(raw->datacode); |
| 135 | free(raw); |
| 136 | return NULL; |
| 137 | } |
| 138 | |
| 139 | raw->blocks = QRspec_rsBlockNum(spec); |
| 140 | raw->rsblock = (RSblock *)calloc(raw->blocks, sizeof(RSblock)); |
| 141 | if(raw->rsblock == NULL) { |
| 142 | QRraw_free(raw); |
| 143 | return NULL; |
| 144 | } |
| 145 | ret = RSblock_init(raw->rsblock, spec, raw->datacode, raw->ecccode); |
| 146 | if(ret < 0) { |
| 147 | QRraw_free(raw); |
| 148 | return NULL; |
| 149 | } |
| 150 | |
| 151 | raw->count = 0; |
| 152 | |
| 153 | return raw; |
| 154 | } |
| 155 | |
| 156 | /** |
| 157 | * Return a code (byte). |
| 158 | * This function can be called iteratively. |
| 159 | * @param raw raw code. |
| 160 | * @return code |
| 161 | */ |
| 162 | __STATIC unsigned char QRraw_getCode(QRRawCode *raw) |
| 163 | { |
| 164 | int col, row; |
| 165 | unsigned char ret; |
| 166 | |
| 167 | if(raw->count < raw->dataLength) { |
| 168 | row = raw->count % raw->blocks; |
| 169 | col = raw->count / raw->blocks; |
| 170 | if(col >= raw->rsblock[0].dataLength) { |
| 171 | row += raw->b1; |
| 172 | } |
| 173 | ret = raw->rsblock[row].data[col]; |
| 174 | } else if(raw->count < raw->dataLength + raw->eccLength) { |
| 175 | row = (raw->count - raw->dataLength) % raw->blocks; |
| 176 | col = (raw->count - raw->dataLength) / raw->blocks; |
| 177 | ret = raw->rsblock[row].ecc[col]; |
| 178 | } else { |
| 179 | return 0; |
| 180 | } |
| 181 | raw->count++; |
| 182 | return ret; |
| 183 | } |
| 184 | |
| 185 | __STATIC void QRraw_free(QRRawCode *raw) |
| 186 | { |
| 187 | if(raw != NULL) { |
| 188 | free(raw->datacode); |
| 189 | free(raw->ecccode); |
| 190 | free(raw->rsblock); |
| 191 | free(raw); |
| 192 | } |
| 193 | } |
| 194 | |
| 195 | /****************************************************************************** |
| 196 | * Raw code for Micro QR Code |
| 197 | *****************************************************************************/ |
| 198 | |
| 199 | typedef struct { |
| 200 | int version; |
| 201 | int dataLength; |
| 202 | int eccLength; |
| 203 | unsigned char *datacode; |
| 204 | unsigned char *ecccode; |
| 205 | RSblock *rsblock; |
| 206 | int oddbits; |
| 207 | int count; |
| 208 | } MQRRawCode; |
| 209 | |
| 210 | __STATIC void MQRraw_free(MQRRawCode *raw); |
| 211 | __STATIC MQRRawCode *MQRraw_new(QRinput *input) |
| 212 | { |
| 213 | MQRRawCode *raw; |
| 214 | RS *rs; |
| 215 | |
| 216 | raw = (MQRRawCode *)malloc(sizeof(MQRRawCode)); |
| 217 | if(raw == NULL) return NULL; |
| 218 | |
| 219 | raw->version = input->version; |
| 220 | raw->dataLength = MQRspec_getDataLength(input->version, input->level); |
| 221 | raw->eccLength = MQRspec_getECCLength(input->version, input->level); |
| 222 | raw->oddbits = raw->dataLength * 8 - MQRspec_getDataLengthBit(input->version, input->level); |
| 223 | raw->datacode = QRinput_getByteStream(input); |
| 224 | if(raw->datacode == NULL) { |
| 225 | free(raw); |
| 226 | return NULL; |
| 227 | } |
| 228 | raw->ecccode = (unsigned char *)malloc(raw->eccLength); |
| 229 | if(raw->ecccode == NULL) { |
| 230 | free(raw->datacode); |
| 231 | free(raw); |
| 232 | return NULL; |
| 233 | } |
| 234 | |
| 235 | raw->rsblock = (RSblock *)calloc(1, sizeof(RSblock)); |
| 236 | if(raw->rsblock == NULL) { |
| 237 | MQRraw_free(raw); |
| 238 | return NULL; |
| 239 | } |
| 240 | |
| 241 | rs = init_rs(8, 0x11d, 0, 1, raw->eccLength, 255 - raw->dataLength - raw->eccLength); |
| 242 | if(rs == NULL) { |
| 243 | MQRraw_free(raw); |
| 244 | return NULL; |
| 245 | } |
| 246 | |
| 247 | RSblock_initBlock(raw->rsblock, raw->dataLength, raw->datacode, raw->eccLength, raw->ecccode, rs); |
| 248 | |
| 249 | raw->count = 0; |
| 250 | |
| 251 | return raw; |
| 252 | } |
| 253 | |
| 254 | /** |
| 255 | * Return a code (byte). |
| 256 | * This function can be called iteratively. |
| 257 | * @param raw raw code. |
| 258 | * @return code |
| 259 | */ |
| 260 | __STATIC unsigned char MQRraw_getCode(MQRRawCode *raw) |
| 261 | { |
| 262 | unsigned char ret; |
| 263 | |
| 264 | if(raw->count < raw->dataLength) { |
| 265 | ret = raw->datacode[raw->count]; |
| 266 | } else if(raw->count < raw->dataLength + raw->eccLength) { |
| 267 | ret = raw->ecccode[raw->count - raw->dataLength]; |
| 268 | } else { |
| 269 | return 0; |
| 270 | } |
| 271 | raw->count++; |
| 272 | return ret; |
| 273 | } |
| 274 | |
| 275 | __STATIC void MQRraw_free(MQRRawCode *raw) |
| 276 | { |
| 277 | if(raw != NULL) { |
| 278 | free(raw->datacode); |
| 279 | free(raw->ecccode); |
| 280 | free(raw->rsblock); |
| 281 | free(raw); |
| 282 | } |
| 283 | } |
| 284 | |
| 285 | |
| 286 | /****************************************************************************** |
| 287 | * Frame filling |
| 288 | *****************************************************************************/ |
| 289 | |
| 290 | typedef struct { |
| 291 | int width; |
| 292 | unsigned char *frame; |
| 293 | int x, y; |
| 294 | int dir; |
| 295 | int bit; |
| 296 | int mqr; |
| 297 | } FrameFiller; |
| 298 | |
| 299 | static FrameFiller *FrameFiller_new(int width, unsigned char *frame, int mqr) |
| 300 | { |
| 301 | FrameFiller *filler; |
| 302 | |
| 303 | filler = (FrameFiller *)malloc(sizeof(FrameFiller)); |
| 304 | if(filler == NULL) return NULL; |
| 305 | filler->width = width; |
| 306 | filler->frame = frame; |
| 307 | filler->x = width - 1; |
| 308 | filler->y = width - 1; |
| 309 | filler->dir = -1; |
| 310 | filler->bit = -1; |
| 311 | filler->mqr = mqr; |
| 312 | |
| 313 | return filler; |
| 314 | } |
| 315 | |
| 316 | static unsigned char *FrameFiller_next(FrameFiller *filler) |
| 317 | { |
| 318 | unsigned char *p; |
| 319 | int x, y, w; |
| 320 | |
| 321 | if(filler->bit == -1) { |
| 322 | filler->bit = 0; |
| 323 | return filler->frame + filler->y * filler->width + filler->x; |
| 324 | } |
| 325 | |
| 326 | x = filler->x; |
| 327 | y = filler->y; |
| 328 | p = filler->frame; |
| 329 | w = filler->width; |
| 330 | |
| 331 | if(filler->bit == 0) { |
| 332 | x--; |
| 333 | filler->bit++; |
| 334 | } else { |
| 335 | x++; |
| 336 | y += filler->dir; |
| 337 | filler->bit--; |
| 338 | } |
| 339 | |
| 340 | if(filler->dir < 0) { |
| 341 | if(y < 0) { |
| 342 | y = 0; |
| 343 | x -= 2; |
| 344 | filler->dir = 1; |
| 345 | if(!filler->mqr && x == 6) { |
| 346 | x--; |
| 347 | y = 9; |
| 348 | } |
| 349 | } |
| 350 | } else { |
| 351 | if(y == w) { |
| 352 | y = w - 1; |
| 353 | x -= 2; |
| 354 | filler->dir = -1; |
| 355 | if(!filler->mqr && x == 6) { |
| 356 | x--; |
| 357 | y -= 8; |
| 358 | } |
| 359 | } |
| 360 | } |
| 361 | if(x < 0 || y < 0) return NULL; |
| 362 | |
| 363 | filler->x = x; |
| 364 | filler->y = y; |
| 365 | |
| 366 | if(p[y * w + x] & 0x80) { |
| 367 | // This tail recursion could be optimized. |
| 368 | return FrameFiller_next(filler); |
| 369 | } |
| 370 | return &p[y * w + x]; |
| 371 | } |
| 372 | |
| 373 | #ifdef WITH_TESTS |
| 374 | extern unsigned char *FrameFiller_test(int version) |
| 375 | { |
| 376 | int width; |
| 377 | unsigned char *frame, *p; |
| 378 | FrameFiller *filler; |
| 379 | int i, length; |
| 380 | |
| 381 | width = QRspec_getWidth(version); |
| 382 | frame = QRspec_newFrame(version); |
| 383 | if(frame == NULL) return NULL; |
| 384 | filler = FrameFiller_new(width, frame, 0); |
| 385 | if(filler == NULL) { |
| 386 | free(frame); |
| 387 | return NULL; |
| 388 | } |
| 389 | length = QRspec_getDataLength(version, QR_ECLEVEL_L) * 8 |
| 390 | + QRspec_getECCLength(version, QR_ECLEVEL_L) * 8 |
| 391 | + QRspec_getRemainder(version); |
| 392 | for(i=0; i<length; i++) { |
| 393 | p = FrameFiller_next(filler); |
| 394 | if(p == NULL) { |
| 395 | free(filler); |
| 396 | free(frame); |
| 397 | return NULL; |
| 398 | } |
| 399 | *p = (unsigned char)(i & 0x7f) | 0x80; |
| 400 | } |
| 401 | free(filler); |
| 402 | return frame; |
| 403 | } |
| 404 | |
| 405 | extern unsigned char *FrameFiller_testMQR(int version) |
| 406 | { |
| 407 | int width; |
| 408 | unsigned char *frame, *p; |
| 409 | FrameFiller *filler; |
| 410 | int i, length; |
| 411 | |
| 412 | width = MQRspec_getWidth(version); |
| 413 | frame = MQRspec_newFrame(version); |
| 414 | if(frame == NULL) return NULL; |
| 415 | filler = FrameFiller_new(width, frame, 1); |
| 416 | if(filler == NULL) { |
| 417 | free(frame); |
| 418 | return NULL; |
| 419 | } |
| 420 | length = MQRspec_getDataLengthBit(version, QR_ECLEVEL_L) |
| 421 | + MQRspec_getECCLength(version, QR_ECLEVEL_L) * 8; |
| 422 | for(i=0; i<length; i++) { |
| 423 | p = FrameFiller_next(filler); |
| 424 | if(p == NULL) { |
| 425 | fprintf(stderr, "Frame filler run over the frame!\n"); |
| 426 | free(filler); |
| 427 | return frame; |
| 428 | } |
| 429 | *p = (unsigned char)(i & 0x7f) | 0x80; |
| 430 | } |
| 431 | free(filler); |
| 432 | return frame; |
| 433 | } |
| 434 | #endif |
| 435 | |
| 436 | |
| 437 | /****************************************************************************** |
| 438 | * QR-code encoding |
| 439 | *****************************************************************************/ |
| 440 | |
| 441 | __STATIC QRcode *QRcode_new(int version, int width, unsigned char *data) |
| 442 | { |
| 443 | QRcode *qrcode; |
| 444 | |
| 445 | qrcode = (QRcode *)malloc(sizeof(QRcode)); |
| 446 | if(qrcode == NULL) return NULL; |
| 447 | |
| 448 | qrcode->version = version; |
| 449 | qrcode->width = width; |
| 450 | qrcode->data = data; |
| 451 | |
| 452 | return qrcode; |
| 453 | } |
| 454 | |
| 455 | void QRcode_free(QRcode *qrcode) |
| 456 | { |
| 457 | if(qrcode != NULL) { |
| 458 | free(qrcode->data); |
| 459 | free(qrcode); |
| 460 | } |
| 461 | } |
| 462 | |
| 463 | __STATIC QRcode *QRcode_encodeMask(QRinput *input, int mask) |
| 464 | { |
| 465 | int width, version; |
| 466 | QRRawCode *raw; |
| 467 | unsigned char *frame, *masked, *p, code, bit; |
| 468 | FrameFiller *filler; |
| 469 | int i, j; |
| 470 | QRcode *qrcode = NULL; |
| 471 | |
| 472 | if(input->mqr) { |
| 473 | errno = EINVAL; |
| 474 | return NULL; |
| 475 | } |
| 476 | if(input->version < 0 || input->version > QRSPEC_VERSION_MAX) { |
| 477 | errno = EINVAL; |
| 478 | return NULL; |
| 479 | } |
| 480 | if(input->level > QR_ECLEVEL_H) { |
| 481 | errno = EINVAL; |
| 482 | return NULL; |
| 483 | } |
| 484 | |
| 485 | raw = QRraw_new(input); |
| 486 | if(raw == NULL) return NULL; |
| 487 | |
| 488 | version = raw->version; |
| 489 | width = QRspec_getWidth(version); |
| 490 | frame = QRspec_newFrame(version); |
| 491 | if(frame == NULL) { |
| 492 | QRraw_free(raw); |
| 493 | return NULL; |
| 494 | } |
| 495 | filler = FrameFiller_new(width, frame, 0); |
| 496 | if(filler == NULL) { |
| 497 | QRraw_free(raw); |
| 498 | free(frame); |
| 499 | return NULL; |
| 500 | } |
| 501 | |
| 502 | /* inteleaved data and ecc codes */ |
| 503 | for(i=0; i<raw->dataLength + raw->eccLength; i++) { |
| 504 | code = QRraw_getCode(raw); |
| 505 | bit = 0x80; |
| 506 | for(j=0; j<8; j++) { |
| 507 | p = FrameFiller_next(filler); |
| 508 | if(p == NULL) goto EXIT; |
| 509 | *p = 0x02 | ((bit & code) != 0); |
| 510 | bit = bit >> 1; |
| 511 | } |
| 512 | } |
| 513 | QRraw_free(raw); |
| 514 | raw = NULL; |
| 515 | /* remainder bits */ |
| 516 | j = QRspec_getRemainder(version); |
| 517 | for(i=0; i<j; i++) { |
| 518 | p = FrameFiller_next(filler); |
| 519 | if(p == NULL) goto EXIT; |
| 520 | *p = 0x02; |
| 521 | } |
| 522 | |
| 523 | /* masking */ |
| 524 | if(mask == -2) { // just for debug purpose |
| 525 | masked = (unsigned char *)malloc(width * width); |
| 526 | memcpy(masked, frame, width * width); |
| 527 | } else if(mask < 0) { |
| 528 | masked = Mask_mask(width, frame, input->level); |
| 529 | } else { |
| 530 | masked = Mask_makeMask(width, frame, mask, input->level); |
| 531 | } |
| 532 | if(masked == NULL) { |
| 533 | goto EXIT; |
| 534 | } |
| 535 | qrcode = QRcode_new(version, width, masked); |
| 536 | if(qrcode == NULL) { |
| 537 | free(masked); |
| 538 | } |
| 539 | |
| 540 | EXIT: |
| 541 | QRraw_free(raw); |
| 542 | free(filler); |
| 543 | free(frame); |
| 544 | return qrcode; |
| 545 | } |
| 546 | |
| 547 | __STATIC QRcode *QRcode_encodeMaskMQR(QRinput *input, int mask) |
| 548 | { |
| 549 | int width, version; |
| 550 | MQRRawCode *raw; |
| 551 | unsigned char *frame, *masked, *p, code, bit; |
| 552 | FrameFiller *filler; |
| 553 | int i, j; |
| 554 | QRcode *qrcode = NULL; |
| 555 | |
| 556 | if(!input->mqr) { |
| 557 | errno = EINVAL; |
| 558 | return NULL; |
| 559 | } |
| 560 | if(input->version <= 0 || input->version > MQRSPEC_VERSION_MAX) { |
| 561 | errno = EINVAL; |
| 562 | return NULL; |
| 563 | } |
| 564 | if(input->level > QR_ECLEVEL_Q) { |
| 565 | errno = EINVAL; |
| 566 | return NULL; |
| 567 | } |
| 568 | |
| 569 | raw = MQRraw_new(input); |
| 570 | if(raw == NULL) return NULL; |
| 571 | |
| 572 | version = raw->version; |
| 573 | width = MQRspec_getWidth(version); |
| 574 | frame = MQRspec_newFrame(version); |
| 575 | if(frame == NULL) { |
| 576 | MQRraw_free(raw); |
| 577 | return NULL; |
| 578 | } |
| 579 | filler = FrameFiller_new(width, frame, 1); |
| 580 | if(filler == NULL) { |
| 581 | MQRraw_free(raw); |
| 582 | free(frame); |
| 583 | return NULL; |
| 584 | } |
| 585 | |
| 586 | /* inteleaved data and ecc codes */ |
| 587 | for(i=0; i<raw->dataLength + raw->eccLength; i++) { |
| 588 | code = MQRraw_getCode(raw); |
| 589 | if(raw->oddbits && i == raw->dataLength - 1) { |
| 590 | bit = 1 << (raw->oddbits - 1); |
| 591 | for(j=0; j<raw->oddbits; j++) { |
| 592 | p = FrameFiller_next(filler); |
| 593 | if(p == NULL) goto EXIT; |
| 594 | *p = 0x02 | ((bit & code) != 0); |
| 595 | bit = bit >> 1; |
| 596 | } |
| 597 | } else { |
| 598 | bit = 0x80; |
| 599 | for(j=0; j<8; j++) { |
| 600 | p = FrameFiller_next(filler); |
| 601 | if(p == NULL) goto EXIT; |
| 602 | *p = 0x02 | ((bit & code) != 0); |
| 603 | bit = bit >> 1; |
| 604 | } |
| 605 | } |
| 606 | } |
| 607 | MQRraw_free(raw); |
| 608 | raw = NULL; |
| 609 | |
| 610 | /* masking */ |
| 611 | if(mask < 0) { |
| 612 | masked = MMask_mask(version, frame, input->level); |
| 613 | } else { |
| 614 | masked = MMask_makeMask(version, frame, mask, input->level); |
| 615 | } |
| 616 | if(masked == NULL) { |
| 617 | goto EXIT; |
| 618 | } |
| 619 | |
| 620 | qrcode = QRcode_new(version, width, masked); |
| 621 | |
| 622 | EXIT: |
| 623 | MQRraw_free(raw); |
| 624 | free(filler); |
| 625 | free(frame); |
| 626 | return qrcode; |
| 627 | } |
| 628 | |
| 629 | QRcode *QRcode_encodeInput(QRinput *input) |
| 630 | { |
| 631 | if(input->mqr) { |
| 632 | return QRcode_encodeMaskMQR(input, -1); |
| 633 | } else { |
| 634 | return QRcode_encodeMask(input, -1); |
| 635 | } |
| 636 | } |
| 637 | |
| 638 | static QRcode *QRcode_encodeStringReal(const char *string, int version, QRecLevel level, int mqr, QRencodeMode hint, int casesensitive) |
| 639 | { |
| 640 | QRinput *input; |
| 641 | QRcode *code; |
| 642 | int ret; |
| 643 | |
| 644 | if(string == NULL) { |
| 645 | errno = EINVAL; |
| 646 | return NULL; |
| 647 | } |
| 648 | if(hint != QR_MODE_8 && hint != QR_MODE_KANJI) { |
| 649 | errno = EINVAL; |
| 650 | return NULL; |
| 651 | } |
| 652 | |
| 653 | if(mqr) { |
| 654 | input = QRinput_newMQR(version, level); |
| 655 | } else { |
| 656 | input = QRinput_new2(version, level); |
| 657 | } |
| 658 | if(input == NULL) return NULL; |
| 659 | |
| 660 | ret = Split_splitStringToQRinput(string, input, hint, casesensitive); |
| 661 | if(ret < 0) { |
| 662 | QRinput_free(input); |
| 663 | return NULL; |
| 664 | } |
| 665 | code = QRcode_encodeInput(input); |
| 666 | QRinput_free(input); |
| 667 | |
| 668 | return code; |
| 669 | } |
| 670 | |
| 671 | QRcode *QRcode_encodeString(const char *string, int version, QRecLevel level, QRencodeMode hint, int casesensitive) |
| 672 | { |
| 673 | return QRcode_encodeStringReal(string, version, level, 0, hint, casesensitive); |
| 674 | } |
| 675 | |
| 676 | QRcode *QRcode_encodeStringMQR(const char *string, int version, QRecLevel level, QRencodeMode hint, int casesensitive) |
| 677 | { |
| 678 | return QRcode_encodeStringReal(string, version, level, 1, hint, casesensitive); |
| 679 | } |
| 680 | |
| 681 | static QRcode *QRcode_encodeDataReal(const unsigned char *data, int length, int version, QRecLevel level, int mqr) |
| 682 | { |
| 683 | QRinput *input; |
| 684 | QRcode *code; |
| 685 | int ret; |
| 686 | |
| 687 | if(data == NULL || length == 0) { |
| 688 | errno = EINVAL; |
| 689 | return NULL; |
| 690 | } |
| 691 | |
| 692 | if(mqr) { |
| 693 | input = QRinput_newMQR(version, level); |
| 694 | } else { |
| 695 | input = QRinput_new2(version, level); |
| 696 | } |
| 697 | if(input == NULL) return NULL; |
| 698 | |
| 699 | ret = QRinput_append(input, QR_MODE_8, length, data); |
| 700 | if(ret < 0) { |
| 701 | QRinput_free(input); |
| 702 | return NULL; |
| 703 | } |
| 704 | code = QRcode_encodeInput(input); |
| 705 | QRinput_free(input); |
| 706 | |
| 707 | return code; |
| 708 | } |
| 709 | |
| 710 | QRcode *QRcode_encodeData(int size, const unsigned char *data, int version, QRecLevel level) |
| 711 | { |
| 712 | return QRcode_encodeDataReal(data, size, version, level, 0); |
| 713 | } |
| 714 | |
| 715 | QRcode *QRcode_encodeString8bit(const char *string, int version, QRecLevel level) |
| 716 | { |
| 717 | if(string == NULL) { |
| 718 | errno = EINVAL; |
| 719 | return NULL; |
| 720 | } |
| 721 | return QRcode_encodeDataReal((unsigned char *)string, strlen(string), version, level, 0); |
| 722 | } |
| 723 | |
| 724 | QRcode *QRcode_encodeDataMQR(int size, const unsigned char *data, int version, QRecLevel level) |
| 725 | { |
| 726 | return QRcode_encodeDataReal(data, size, version, level, 1); |
| 727 | } |
| 728 | |
| 729 | QRcode *QRcode_encodeString8bitMQR(const char *string, int version, QRecLevel level) |
| 730 | { |
| 731 | if(string == NULL) { |
| 732 | errno = EINVAL; |
| 733 | return NULL; |
| 734 | } |
| 735 | return QRcode_encodeDataReal((unsigned char *)string, strlen(string), version, level, 1); |
| 736 | } |
| 737 | |
| 738 | |
| 739 | /****************************************************************************** |
| 740 | * Structured QR-code encoding |
| 741 | *****************************************************************************/ |
| 742 | |
| 743 | static QRcode_List *QRcode_List_newEntry(void) |
| 744 | { |
| 745 | QRcode_List *entry; |
| 746 | |
| 747 | entry = (QRcode_List *)malloc(sizeof(QRcode_List)); |
| 748 | if(entry == NULL) return NULL; |
| 749 | |
| 750 | entry->next = NULL; |
| 751 | entry->code = NULL; |
| 752 | |
| 753 | return entry; |
| 754 | } |
| 755 | |
| 756 | static void QRcode_List_freeEntry(QRcode_List *entry) |
| 757 | { |
| 758 | if(entry != NULL) { |
| 759 | QRcode_free(entry->code); |
| 760 | free(entry); |
| 761 | } |
| 762 | } |
| 763 | |
| 764 | void QRcode_List_free(QRcode_List *qrlist) |
| 765 | { |
| 766 | QRcode_List *list = qrlist, *next; |
| 767 | |
| 768 | while(list != NULL) { |
| 769 | next = list->next; |
| 770 | QRcode_List_freeEntry(list); |
| 771 | list = next; |
| 772 | } |
| 773 | } |
| 774 | |
| 775 | int QRcode_List_size(QRcode_List *qrlist) |
| 776 | { |
| 777 | QRcode_List *list = qrlist; |
| 778 | int size = 0; |
| 779 | |
| 780 | while(list != NULL) { |
| 781 | size++; |
| 782 | list = list->next; |
| 783 | } |
| 784 | |
| 785 | return size; |
| 786 | } |
| 787 | |
| 788 | #if 0 |
| 789 | static unsigned char QRcode_parity(const char *str, int size) |
| 790 | { |
| 791 | unsigned char parity = 0; |
| 792 | int i; |
| 793 | |
| 794 | for(i=0; i<size; i++) { |
| 795 | parity ^= str[i]; |
| 796 | } |
| 797 | |
| 798 | return parity; |
| 799 | } |
| 800 | #endif |
| 801 | |
| 802 | QRcode_List *QRcode_encodeInputStructured(QRinput_Struct *s) |
| 803 | { |
| 804 | QRcode_List *head = NULL; |
| 805 | QRcode_List *tail = NULL; |
| 806 | QRcode_List *entry; |
| 807 | QRinput_InputList *list = s->head; |
| 808 | |
| 809 | while(list != NULL) { |
| 810 | if(head == NULL) { |
| 811 | entry = QRcode_List_newEntry(); |
| 812 | if(entry == NULL) goto ABORT; |
| 813 | head = entry; |
| 814 | tail = head; |
| 815 | } else { |
| 816 | entry = QRcode_List_newEntry(); |
| 817 | if(entry == NULL) goto ABORT; |
| 818 | tail->next = entry; |
| 819 | tail = tail->next; |
| 820 | } |
| 821 | tail->code = QRcode_encodeInput(list->input); |
| 822 | if(tail->code == NULL) { |
| 823 | goto ABORT; |
| 824 | } |
| 825 | list = list->next; |
| 826 | } |
| 827 | |
| 828 | return head; |
| 829 | ABORT: |
| 830 | QRcode_List_free(head); |
| 831 | return NULL; |
| 832 | } |
| 833 | |
| 834 | static QRcode_List *QRcode_encodeInputToStructured(QRinput *input) |
| 835 | { |
| 836 | QRinput_Struct *s; |
| 837 | QRcode_List *codes; |
| 838 | |
| 839 | s = QRinput_splitQRinputToStruct(input); |
| 840 | if(s == NULL) return NULL; |
| 841 | |
| 842 | codes = QRcode_encodeInputStructured(s); |
| 843 | QRinput_Struct_free(s); |
| 844 | |
| 845 | return codes; |
| 846 | } |
| 847 | |
| 848 | static QRcode_List *QRcode_encodeDataStructuredReal( |
| 849 | int size, const unsigned char *data, |
| 850 | int version, QRecLevel level, |
| 851 | int eightbit, QRencodeMode hint, int casesensitive) |
| 852 | { |
| 853 | QRinput *input; |
| 854 | QRcode_List *codes; |
| 855 | int ret; |
| 856 | |
| 857 | if(version <= 0) { |
| 858 | errno = EINVAL; |
| 859 | return NULL; |
| 860 | } |
| 861 | if(!eightbit && (hint != QR_MODE_8 && hint != QR_MODE_KANJI)) { |
| 862 | errno = EINVAL; |
| 863 | return NULL; |
| 864 | } |
| 865 | |
| 866 | input = QRinput_new2(version, level); |
| 867 | if(input == NULL) return NULL; |
| 868 | |
| 869 | if(eightbit) { |
| 870 | ret = QRinput_append(input, QR_MODE_8, size, data); |
| 871 | } else { |
| 872 | ret = Split_splitStringToQRinput((char *)data, input, hint, casesensitive); |
| 873 | } |
| 874 | if(ret < 0) { |
| 875 | QRinput_free(input); |
| 876 | return NULL; |
| 877 | } |
| 878 | codes = QRcode_encodeInputToStructured(input); |
| 879 | QRinput_free(input); |
| 880 | |
| 881 | return codes; |
| 882 | } |
| 883 | |
| 884 | QRcode_List *QRcode_encodeDataStructured(int size, const unsigned char *data, int version, QRecLevel level) { |
| 885 | return QRcode_encodeDataStructuredReal(size, data, version, level, 1, QR_MODE_NUL, 0); |
| 886 | } |
| 887 | |
| 888 | QRcode_List *QRcode_encodeString8bitStructured(const char *string, int version, QRecLevel level) { |
| 889 | if(string == NULL) { |
| 890 | errno = EINVAL; |
| 891 | return NULL; |
| 892 | } |
| 893 | return QRcode_encodeDataStructured(strlen(string), (unsigned char *)string, version, level); |
| 894 | } |
| 895 | |
| 896 | QRcode_List *QRcode_encodeStringStructured(const char *string, int version, QRecLevel level, QRencodeMode hint, int casesensitive) |
| 897 | { |
| 898 | if(string == NULL) { |
| 899 | errno = EINVAL; |
| 900 | return NULL; |
| 901 | } |
| 902 | return QRcode_encodeDataStructuredReal(strlen(string), (unsigned char *)string, version, level, 0, hint, casesensitive); |
| 903 | } |
| 904 | |
| 905 | /****************************************************************************** |
| 906 | * System utilities |
| 907 | *****************************************************************************/ |
| 908 | |
| 909 | void QRcode_APIVersion(int *major_version, int *minor_version, int *micro_version) |
| 910 | { |
| 911 | if(major_version != NULL) { |
| 912 | *major_version = MAJOR_VERSION; |
| 913 | } |
| 914 | if(minor_version != NULL) { |
| 915 | *minor_version = MINOR_VERSION; |
| 916 | } |
| 917 | if(micro_version != NULL) { |
| 918 | *micro_version = MICRO_VERSION; |
| 919 | } |
| 920 | } |
| 921 | |
| 922 | char *QRcode_APIVersionString(void) |
| 923 | { |
| 924 | return VERSION; |
| 925 | } |
| 926 | |
| 927 | void QRcode_clearCache(void) |
| 928 | { |
| 929 | QRspec_clearCache(); |
| 930 | MQRspec_clearCache(); |
| 931 | free_rs_cache(); |
| 932 | } |