PageRenderTime 67ms CodeModel.GetById 15ms RepoModel.GetById 0ms app.codeStats 1ms

/shared/code/qrcode.php

https://bitbucket.org/biadmin/tcexam
PHP | 2865 lines | 1688 code | 209 blank | 968 comment | 292 complexity | b57b0525d53b08c1843e739c0c51f351 MD5 | raw file
Possible License(s): AGPL-3.0, GPL-3.0, BSD-3-Clause, LGPL-2.1, LGPL-3.0 
    

  1. <?php

    2. 

  2. //============================================================+

    3. 

  3. // File name   : qrcode.php

    4. 

  4. // Version     : 1.0.004

    5. 

  5. // Begin       : 2010-03-22

    6. 

  6. // Last Update : 2010-06-03

    7. 

  7. // Author      : Nicola Asuni - Tecnick.com S.r.l - Via Della Pace, 11 - 09044 - Quartucciu (CA) - ITALY - www.tecnick.com - info@tecnick.com

    8. 

  8. // License     : GNU-LGPL v3 (http://www.gnu.org/copyleft/lesser.html)

    9. 

  9. // -------------------------------------------------------------------

    10. 

  10. // Copyright (C) 2010-2010  Nicola Asuni - Tecnick.com S.r.l.

    11. 

  11. //

    12. 

  12. // This file is part of TCPDF software library.

    13. 

  13. //

    14. 

  14. // TCPDF is free software: you can redistribute it and/or modify it

    15. 

  15. // under the terms of the GNU Lesser General Public License as

    16. 

  16. // published by the Free Software Foundation, either version 3 of the

    17. 

  17. // License, or (at your option) any later version.

    18. 

  18. //

    19. 

  19. // TCPDF is distributed in the hope that it will be useful, but

    20. 

  20. // WITHOUT ANY WARRANTY; without even the implied warranty of

    21. 

  21. // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.

    22. 

  22. // See the GNU Lesser General Public License for more details.

    23. 

  23. //

    24. 

  24. // You should have received a copy of the GNU Lesser General Public License

    25. 

  25. // along with TCPDF.  If not, see <http://www.gnu.org/licenses/>.

    26. 

  26. //

    27. 

  27. // See LICENSE.TXT file for more information.

    28. 

  28. // -------------------------------------------------------------------

    29. 

  29. //

    30. 

  30. // DESCRIPTION :

    31. 

  31. //

    32. 

  32. // Class to create QR-code arrays for TCPDF class.

    33. 

  33. // QR Code symbol is a 2D barcode that can be scanned by

    34. 

  34. // handy terminals such as a mobile phone with CCD.

    35. 

  35. // The capacity of QR Code is up to 7000 digits or 4000

    36. 

  36. // characters, and has high robustness.

    37. 

  37. // This class supports QR Code model 2, described in

    38. 

  38. // JIS (Japanese Industrial Standards) X0510:2004

    39. 

  39. // or ISO/IEC 18004.

    40. 

  40. // Currently the following features are not supported:

    41. 

  41. // ECI and FNC1 mode, Micro QR Code, QR Code model 1,

    42. 

  42. // Structured mode.

    43. 

  43. //

    44. 

  44. // This class is derived from the following projects:

    45. 

  45. // ---------------------------------------------------------

    46. 

  46. // "PHP QR Code encoder"

    47. 

  47. // License: GNU-LGPLv3

    48. 

  48. // Copyright (C) 2010 by Dominik Dzienia <deltalab at poczta dot fm>

    49. 

  49. // http://phpqrcode.sourceforge.net/

    50. 

  50. // https://sourceforge.net/projects/phpqrcode/

    51. 

  51. //

    52. 

  52. // The "PHP QR Code encoder" is based on

    53. 

  53. // "C libqrencode library" (ver. 3.1.1)

    54. 

  54. // License: GNU-LGPL 2.1

    55. 

  55. // Copyright (C) 2006-2010 by Kentaro Fukuchi

    56. 

  56. // http://megaui.net/fukuchi/works/qrencode/index.en.html

    57. 

  57. //

    58. 

  58. // Reed-Solomon code encoder is written by Phil Karn, KA9Q.

    59. 

  59. // Copyright (C) 2002-2006 Phil Karn, KA9Q

    60. 

  60. //

    61. 

  61. // QR Code is registered trademark of DENSO WAVE INCORPORATED

    62. 

  62. // http://www.denso-wave.com/qrcode/index-e.html

    63. 

  63. // ---------------------------------------------------------

    64. 

  64. //============================================================+

    65. 

  65. 

    66. 

  66. /**

    67. 

  67.  * Class to create QR-code arrays for TCPDF class.

    68. 

  68.  * QR Code symbol is a 2D barcode that can be scanned by handy terminals such as a mobile phone with CCD.

    69. 

  69.  * The capacity of QR Code is up to 7000 digits or 4000 characters, and has high robustness.

    70. 

  70.  * This class supports QR Code model 2, described in JIS (Japanese Industrial Standards) X0510:2004 or ISO/IEC 18004.

    71. 

  71.  * Currently the following features are not supported: ECI and FNC1 mode, Micro QR Code, QR Code model 1, Structured mode.

    72. 

  72.  *

    73. 

  73.  * This class is derived from "PHP QR Code encoder" by Dominik Dzienia (http://phpqrcode.sourceforge.net/) based on "libqrencode C library 3.1.1." by Kentaro Fukuchi (http://megaui.net/fukuchi/works/qrencode/index.en.html), contains Reed-Solomon code written by Phil Karn, KA9Q. QR Code is registered trademark of DENSO WAVE INCORPORATED (http://www.denso-wave.com/qrcode/index-e.html).

    74. 

  74.  * Please read comments on this class source file for full copyright and license information.

    75. 

  75.  *

    76. 

  76.  * @package com.tecnick.tcpdf

    77. 

  77.  * @abstract Class for generating QR-code array for TCPDF.

    78. 

  78.  * @author Nicola Asuni

    79. 

  79.  * @copyright 2010-2010 Nicola Asuni - Tecnick.com S.r.l (www.tecnick.com) Via Della Pace, 11 - 09044 - Quartucciu (CA) - ITALY - www.tecnick.com - info@tecnick.com

    80. 

  80.  * @link http://www.tcpdf.org

    81. 

  81.  * @license http://www.gnu.org/copyleft/lesser.html LGPL

    82. 

  82.  * @version 1.0.004

    83. 

  83.  */

    84. 

  84. 

    85. 

  85. // definitions

    86. 

  86. if (!defined('QRCODEDEFS')) {

    87. 

  87. 

    88. 

  88. 	/**

    89. 

  89. 	 * Indicate that definitions for this class are set

    90. 

  90. 	 */

    91. 

  91. 	define('QRCODEDEFS', true);

    92. 

  92. 

    93. 

  93. 	// -----------------------------------------------------

    94. 

  94. 

    95. 

  95. 	// Encoding modes (characters which can be encoded in QRcode)

    96. 

  96. 

    97. 

  97. 	/**

    98. 

  98. 	 * Encoding mode

    99. 

  99. 	 */

    100. 

  100. 	define('QR_MODE_NL', -1);

    101. 

  101. 

    102. 

  102. 	/**

    103. 

  103. 	 * Encoding mode numeric (0-9). 3 characters are encoded to 10bit length. In theory, 7089 characters or less can be stored in a QRcode.

    104. 

  104. 	 */

    105. 

  105. 	define('QR_MODE_NM', 0);

    106. 

  106. 

    107. 

  107. 	/**

    108. 

  108. 	 * Encoding mode alphanumeric (0-9A-Z $%*+-./:) 45characters. 2 characters are encoded to 11bit length. In theory, 4296 characters or less can be stored in a QRcode.

    109. 

  109. 	 */

    110. 

  110. 	define('QR_MODE_AN', 1);

    111. 

  111. 

    112. 

  112. 	/**

    113. 

  113. 	 * Encoding mode 8bit byte data. In theory, 2953 characters or less can be stored in a QRcode.

    114. 

  114. 	 */

    115. 

  115. 	define('QR_MODE_8B', 2);

    116. 

  116. 

    117. 

  117. 	/**

    118. 

  118. 	 * Encoding mode KANJI. A KANJI character (multibyte character) is encoded to 13bit length. In theory, 1817 characters or less can be stored in a QRcode.

    119. 

  119. 	 */

    120. 

  120. 	define('QR_MODE_KJ', 3);

    121. 

  121. 

    122. 

  122. 	/**

    123. 

  123. 	 * Encoding mode STRUCTURED (currently unsupported)

    124. 

  124. 	 */

    125. 

  125. 	define('QR_MODE_ST', 4);

    126. 

  126. 

    127. 

  127. 	// -----------------------------------------------------

    128. 

  128. 

    129. 

  129. 	// Levels of error correction.

    130. 

  130. 	// QRcode has a function of an error correcting for miss reading that white is black.

    131. 

  131. 	// Error correcting is defined in 4 level as below.

    132. 

  132. 

    133. 

  133. 	/**

    134. 

  134. 	 * Error correction level L : About 7% or less errors can be corrected.

    135. 

  135. 	 */

    136. 

  136. 	define('QR_ECLEVEL_L', 0);

    137. 

  137. 

    138. 

  138. 	/**

    139. 

  139. 	 * Error correction level M : About 15% or less errors can be corrected.

    140. 

  140. 	 */

    141. 

  141. 	define('QR_ECLEVEL_M', 1);

    142. 

  142. 

    143. 

  143. 	/**

    144. 

  144. 	 * Error correction level Q : About 25% or less errors can be corrected.

    145. 

  145. 	 */

    146. 

  146. 	define('QR_ECLEVEL_Q', 2);

    147. 

  147. 

    148. 

  148. 	/**

    149. 

  149. 	 * Error correction level H : About 30% or less errors can be corrected.

    150. 

  150. 	 */

    151. 

  151. 	define('QR_ECLEVEL_H', 3);

    152. 

  152. 

    153. 

  153. 	// -----------------------------------------------------

    154. 

  154. 

    155. 

  155. 	// Version. Size of QRcode is defined as version.

    156. 

  156. 	// Version is from 1 to 40.

    157. 

  157. 	// Version 1 is 21*21 matrix. And 4 modules increases whenever 1 version increases.

    158. 

  158. 	// So version 40 is 177*177 matrix.

    159. 

  159. 

    160. 

  160. 	/**

    161. 

  161. 	 * Maximum QR Code version.

    162. 

  162. 	 */

    163. 

  163. 	define('QRSPEC_VERSION_MAX', 40);

    164. 

  164. 

    165. 

  165. 	/**

    166. 

  166. 	 * Maximum matrix size for maximum version (version 40 is 177*177 matrix).

    167. 

  167. 	 */

    168. 

  168.     define('QRSPEC_WIDTH_MAX', 177);

    169. 

  169. 

    170. 

  170. 	// -----------------------------------------------------

    171. 

  171. 

    172. 

  172. 	/**

    173. 

  173. 	 * Matrix index to get width from $capacity array.

    174. 

  174. 	 */

    175. 

  175.     define('QRCAP_WIDTH',    0);

    176. 

  176. 

    177. 

  177.     /**

    178. 

  178. 	 * Matrix index to get number of words from $capacity array.

    179. 

  179. 	 */

    180. 

  180.     define('QRCAP_WORDS',    1);

    181. 

  181. 

    182. 

  182.     /**

    183. 

  183. 	 * Matrix index to get remainder from $capacity array.

    184. 

  184. 	 */

    185. 

  185.     define('QRCAP_REMINDER', 2);

    186. 

  186. 

    187. 

  187.     /**

    188. 

  188. 	 * Matrix index to get error correction level from $capacity array.

    189. 

  189. 	 */

    190. 

  190.     define('QRCAP_EC',       3);

    191. 

  191. 

    192. 

  192. 	// -----------------------------------------------------

    193. 

  193. 

    194. 

  194. 	// Structure (currently usupported)

    195. 

  195. 

    196. 

  196. 	/**

    197. 

  197. 	 * Number of header bits for structured mode

    198. 

  198. 	 */

    199. 

  199.     define('STRUCTURE_HEADER_BITS',  20);

    200. 

  200. 

    201. 

  201.     /**

    202. 

  202. 	 * Max number of symbols for structured mode

    203. 

  203. 	 */

    204. 

  204.     define('MAX_STRUCTURED_SYMBOLS', 16);

    205. 

  205. 

    206. 

  206. 	// -----------------------------------------------------

    207. 

  207. 

    208. 

  208.     // Masks

    209. 

  209. 

    210. 

  210.     /**

    211. 

  211. 	 * Down point base value for case 1 mask pattern (concatenation of same color in a line or a column)

    212. 

  212. 	 */

    213. 

  213.     define('N1',  3);

    214. 

  214. 

    215. 

  215.     /**

    216. 

  216. 	 * Down point base value for case 2 mask pattern (module block of same color)

    217. 

  217. 	 */

    218. 

  218. 	define('N2',  3);

    219. 

  219. 

    220. 

  220.     /**

    221. 

  221. 	 * Down point base value for case 3 mask pattern (1:1:3:1:1(dark:bright:dark:bright:dark)pattern in a line or a column)

    222. 

  222. 	 */

    223. 

  223. 	define('N3', 40);

    224. 

  224. 

    225. 

  225.     /**

    226. 

  226. 	 * Down point base value for case 4 mask pattern (ration of dark modules in whole)

    227. 

  227. 	 */

    228. 

  228. 	define('N4', 10);

    229. 

  229. 

    230. 

  230. 	// -----------------------------------------------------

    231. 

  231. 

    232. 

  232. 	// Optimization settings

    233. 

  233. 

    234. 

  234. 	/**

    235. 

  235. 	 * if true, estimates best mask (spec. default, but extremally slow; set to false to significant performance boost but (propably) worst quality code

    236. 

  236. 	 */

    237. 

  237. 	define('QR_FIND_BEST_MASK', true);

    238. 

  238. 

    239. 

  239. 	/**

    240. 

  240. 	 * if false, checks all masks available, otherwise value tells count of masks need to be checked, mask id are got randomly

    241. 

  241. 	 */

    242. 

  242. 	define('QR_FIND_FROM_RANDOM', 2);

    243. 

  243. 

    244. 

  244. 	/**

    245. 

  245. 	 * when QR_FIND_BEST_MASK === false

    246. 

  246. 	 */

    247. 

  247. 	define('QR_DEFAULT_MASK', 2);

    248. 

  248. 

    249. 

  249. 	// -----------------------------------------------------

    250. 

  250. 

    251. 

  251. } // end of definitions

    252. 

  252. 

    253. 

  253. // #*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#

    254. 

  254. 

    255. 

  255. if (!class_exists('QRcode', false)) {

    256. 

  256. 

    257. 

  257. 	// for compatibility with PHP4

    258. 

  258. 	if (!function_exists('str_split')) {

    259. 

  259.     	/**

    260. 

  260.     	 * Convert a string to an array (needed for PHP4 compatibility)

    261. 

  261.     	 * @param string $string The input string.

    262. 

  262.     	 * @param int $split_length Maximum length of the chunk.

    263. 

  263.     	 * @return  If the optional split_length  parameter is specified, the returned array will be broken down into chunks with each being split_length  in length, otherwise each chunk will be one character in length. FALSE is returned if split_length is less than 1. If the split_length length exceeds the length of string , the entire string is returned as the first (and only) array element.

    264. 

  264.     	 */

    265. 

  265. 		function str_split($string, $split_length=1) {

    266. 

  266. 			if ((strlen($string) > $split_length) OR (!$split_length)) {

    267. 

  267. 				do {

    268. 

  268. 					$c = strlen($string);

    269. 

  269. 					$parts[] = substr($string, 0, $split_length);

    270. 

  270. 					$string = substr($string, $split_length);

    271. 

  271. 				} while ($string !== false);

    272. 

  272. 			} else {

    273. 

  273. 				$parts = array($string);

    274. 

  274. 			}

    275. 

  275. 			return $parts;

    276. 

  276. 		}

    277. 

  277. 	}

    278. 

  278. 

    279. 

  279. 	// #####################################################

    280. 

  280. 

    281. 

  281. 	/**

    282. 

  282. 	 * Class to create QR-code arrays for TCPDF class.

    283. 

  283. 	 * QR Code symbol is a 2D barcode that can be scanned by handy terminals such as a mobile phone with CCD.

    284. 

  284. 	 * The capacity of QR Code is up to 7000 digits or 4000 characters, and has high robustness.

    285. 

  285. 	 * This class supports QR Code model 2, described in JIS (Japanese Industrial Standards) X0510:2004 or ISO/IEC 18004.

    286. 

  286. 	 * Currently the following features are not supported: ECI and FNC1 mode, Micro QR Code, QR Code model 1, Structured mode.

    287. 

  287. 	 *

    288. 

  288. 	 * This class is derived from "PHP QR Code encoder" by Dominik Dzienia (http://phpqrcode.sourceforge.net/) based on "libqrencode C library 3.1.1." by Kentaro Fukuchi (http://megaui.net/fukuchi/works/qrencode/index.en.html), contains Reed-Solomon code written by Phil Karn, KA9Q. QR Code is registered trademark of DENSO WAVE INCORPORATED (http://www.denso-wave.com/qrcode/index-e.html).

    289. 

  289. 	 * Please read comments on this class source file for full copyright and license information.

    290. 

  290. 	 *

    291. 

  291. 	 * @name QRcode

    292. 

  292. 	 * @package com.tecnick.tcpdf

    293. 

  293. 	 * @abstract Class for generating QR-code array for TCPDF.

    294. 

  294. 	 * @author Nicola Asuni

    295. 

  295. 	 * @copyright 2010-2010 Nicola Asuni - Tecnick.com S.r.l (www.tecnick.com) Via Della Pace, 11 - 09044 - Quartucciu (CA) - ITALY - www.tecnick.com - info@tecnick.com

    296. 

  296. 	 * @link http://www.tcpdf.org

    297. 

  297. 	 * @license http://www.gnu.org/copyleft/lesser.html LGPL

    298. 

  298. 	 * @version 1.0.004

    299. 

  299. 	 */

    300. 

  300. 	class QRcode {

    301. 

  301. 

    302. 

  302. 		/**

    303. 

  303. 		 * @var barcode array to be returned which is readable by TCPDF

    304. 

  304. 		 * @access protected

    305. 

  305. 		 */

    306. 

  306. 		protected $barcode_array = array();

    307. 

  307. 

    308. 

  308. 		/**

    309. 

  309. 		 * @var QR code version. Size of QRcode is defined as version. Version is from 1 to 40. Version 1 is 21*21 matrix. And 4 modules increases whenever 1 version increases. So version 40 is 177*177 matrix.

    310. 

  310. 		 * @access protected

    311. 

  311. 		 */

    312. 

  312. 		protected $version = 0;

    313. 

  313. 

    314. 

  314. 		/**

    315. 

  315. 		 * @var Levels of error correction. See definitions for possible values.

    316. 

  316. 		 * @access protected

    317. 

  317. 		 */

    318. 

  318. 		protected $level = QR_ECLEVEL_L;

    319. 

  319. 

    320. 

  320. 		/**

    321. 

  321. 		 * @var Encoding mode

    322. 

  322. 		 * @access protected

    323. 

  323. 		 */

    324. 

  324. 		protected $hint = QR_MODE_8B;

    325. 

  325. 

    326. 

  326. 		/**

    327. 

  327. 		 * @var if true the input string will be converted to uppercase

    328. 

  328. 		 * @access protected

    329. 

  329. 		 */

    330. 

  330. 		protected $casesensitive = true;

    331. 

  331. 

    332. 

  332. 		/**

    333. 

  333. 		 * @var structured QR code (not supported yet)

    334. 

  334. 		 * @access protected

    335. 

  335. 		 */

    336. 

  336. 		protected $structured = 0;

    337. 

  337. 

    338. 

  338. 		/**

    339. 

  339. 		 * @var mask data

    340. 

  340. 		 * @access protected

    341. 

  341. 		 */

    342. 

  342. 		protected $data;

    343. 

  343. 

    344. 

  344. 		// FrameFiller

    345. 

  345. 

    346. 

  346. 		/**

    347. 

  347. 		 * @var width

    348. 

  348. 		 * @access protected

    349. 

  349. 		 */

    350. 

  350. 		protected $width;

    351. 

  351. 

    352. 

  352. 		/**

    353. 

  353. 		 * @var frame

    354. 

  354. 		 * @access protected

    355. 

  355. 		 */

    356. 

  356. 		protected $frame;

    357. 

  357. 

    358. 

  358. 		/**

    359. 

  359. 		 * @var X position of bit

    360. 

  360. 		 * @access protected

    361. 

  361. 		 */

    362. 

  362. 		protected $x;

    363. 

  363. 

    364. 

  364. 		/**

    365. 

  365. 		 * @var Y position of bit

    366. 

  366. 		 * @access protected

    367. 

  367. 		 */

    368. 

  368. 		protected $y;

    369. 

  369. 

    370. 

  370. 		/**

    371. 

  371. 		 * @var direction

    372. 

  372. 		 * @access protected

    373. 

  373. 		 */

    374. 

  374. 		protected $dir;

    375. 

  375. 

    376. 

  376. 		/**

    377. 

  377. 		 * @var single bit

    378. 

  378. 		 * @access protected

    379. 

  379. 		 */

    380. 

  380. 		protected $bit;

    381. 

  381. 

    382. 

  382. 		// ---- QRrawcode ----

    383. 

  383. 

    384. 

  384. 		/**

    385. 

  385. 		 * @var data code

    386. 

  386. 		 * @access protected

    387. 

  387. 		 */

    388. 

  388. 		protected $datacode = array();

    389. 

  389. 

    390. 

  390. 		/**

    391. 

  391. 		 * @var error correction code

    392. 

  392. 		 * @access protected

    393. 

  393. 		 */

    394. 

  394. 		protected $ecccode = array();

    395. 

  395. 

    396. 

  396. 		/**

    397. 

  397. 		 * @var blocks

    398. 

  398. 		 * @access protected

    399. 

  399. 		 */

    400. 

  400. 		protected $blocks;

    401. 

  401. 

    402. 

  402. 		/**

    403. 

  403. 		 * @var Reed-Solomon blocks

    404. 

  404. 		 * @access protected

    405. 

  405. 		 */

    406. 

  406. 		protected $rsblocks = array(); //of RSblock

    407. 

  407. 

    408. 

  408. 		/**

    409. 

  409. 		 * @var counter

    410. 

  410. 		 * @access protected

    411. 

  411. 		 */

    412. 

  412. 		protected $count;

    413. 

  413. 

    414. 

  414. 		/**

    415. 

  415. 		 * @var data length

    416. 

  416. 		 * @access protected

    417. 

  417. 		 */

    418. 

  418. 		protected $dataLength;

    419. 

  419. 

    420. 

  420. 		/**

    421. 

  421. 		 * @var error correction length

    422. 

  422. 		 * @access protected

    423. 

  423. 		 */

    424. 

  424. 		protected $eccLength;

    425. 

  425. 

    426. 

  426. 		/**

    427. 

  427. 		 * @var b1

    428. 

  428. 		 * @access protected

    429. 

  429. 		 */

    430. 

  430. 		protected $b1;

    431. 

  431. 

    432. 

  432. 		// ---- QRmask ----

    433. 

  433. 

    434. 

  434. 		/**

    435. 

  435. 		 * @var run length

    436. 

  436. 		 * @access protected

    437. 

  437. 		 */

    438. 

  438. 		protected $runLength = array();

    439. 

  439. 

    440. 

  440. 		// ---- QRsplit ----

    441. 

  441. 

    442. 

  442. 		/**

    443. 

  443. 		 * @var input data string

    444. 

  444. 		 * @access protected

    445. 

  445. 		 */

    446. 

  446. 		protected $dataStr = '';

    447. 

  447. 

    448. 

  448. 		/**

    449. 

  449. 		 * @var input items

    450. 

  450. 		 * @access protected

    451. 

  451. 		 */

    452. 

  452. 		protected $items;

    453. 

  453. 

    454. 

  454. 		// Reed-Solomon items

    455. 

  455. 

    456. 

  456. 		/**

    457. 

  457. 		 * @var Reed-Solomon items

    458. 

  458. 		 * @access protected

    459. 

  459. 		 */

    460. 

  460. 		protected $rsitems = array();

    461. 

  461. 

    462. 

  462. 		/**

    463. 

  463. 		 * @var array of frames

    464. 

  464. 		 * @access protected

    465. 

  465. 		 */

    466. 

  466. 		protected $frames = array();

    467. 

  467. 

    468. 

  468. 		/**

    469. 

  469. 		 * @var alphabet-numeric convesion table

    470. 

  470. 		 * @access protected

    471. 

  471. 		 */

    472. 

  472. 		protected $anTable = array(

    473. 

  473. 			-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, //

    474. 

  474. 			-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, //

    475. 

  475. 			36, -1, -1, -1, 37, 38, -1, -1, -1, -1, 39, 40, -1, 41, 42, 43, //

    476. 

  476. 			 0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 44, -1, -1, -1, -1, -1, //

    477. 

  477. 			-1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, //

    478. 

  478. 			25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, -1, //

    479. 

  479. 			-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, //

    480. 

  480. 			-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1  //

    481. 

  481. 			);

    482. 

  482. 

    483. 

  483. 		/**

    484. 

  484. 		 * @var array Table of the capacity of symbols

    485. 

  485. 		 * See Table 1 (pp.13) and Table 12-16 (pp.30-36), JIS X0510:2004.

    486. 

  486. 		 * @access protected

    487. 

  487. 		 */

    488. 

  488. 		protected $capacity = array(

    489. 

  489. 			array(  0,    0, 0, array(   0,    0,    0,    0)), //

    490. 

  490. 			array( 21,   26, 0, array(   7,   10,   13,   17)), //  1

    491. 

  491. 			array( 25,   44, 7, array(  10,   16,   22,   28)), //

    492. 

  492. 			array( 29,   70, 7, array(  15,   26,   36,   44)), //

    493. 

  493. 			array( 33,  100, 7, array(  20,   36,   52,   64)), //

    494. 

  494. 			array( 37,  134, 7, array(  26,   48,   72,   88)), //  5

    495. 

  495. 			array( 41,  172, 7, array(  36,   64,   96,  112)), //

    496. 

  496. 			array( 45,  196, 0, array(  40,   72,  108,  130)), //

    497. 

  497. 			array( 49,  242, 0, array(  48,   88,  132,  156)), //

    498. 

  498. 			array( 53,  292, 0, array(  60,  110,  160,  192)), //

    499. 

  499. 			array( 57,  346, 0, array(  72,  130,  192,  224)), // 10

    500. 

  500. 			array( 61,  404, 0, array(  80,  150,  224,  264)), //

    501. 

  501. 			array( 65,  466, 0, array(  96,  176,  260,  308)), //

    502. 

  502. 			array( 69,  532, 0, array( 104,  198,  288,  352)), //

    503. 

  503. 			array( 73,  581, 3, array( 120,  216,  320,  384)), //

    504. 

  504. 			array( 77,  655, 3, array( 132,  240,  360,  432)), // 15

    505. 

  505. 			array( 81,  733, 3, array( 144,  280,  408,  480)), //

    506. 

  506. 			array( 85,  815, 3, array( 168,  308,  448,  532)), //

    507. 

  507. 			array( 89,  901, 3, array( 180,  338,  504,  588)), //

    508. 

  508. 			array( 93,  991, 3, array( 196,  364,  546,  650)), //

    509. 

  509. 			array( 97, 1085, 3, array( 224,  416,  600,  700)), // 20

    510. 

  510. 			array(101, 1156, 4, array( 224,  442,  644,  750)), //

    511. 

  511. 			array(105, 1258, 4, array( 252,  476,  690,  816)), //

    512. 

  512. 			array(109, 1364, 4, array( 270,  504,  750,  900)), //

    513. 

  513. 			array(113, 1474, 4, array( 300,  560,  810,  960)), //

    514. 

  514. 			array(117, 1588, 4, array( 312,  588,  870, 1050)), // 25

    515. 

  515. 			array(121, 1706, 4, array( 336,  644,  952, 1110)), //

    516. 

  516. 			array(125, 1828, 4, array( 360,  700, 1020, 1200)), //

    517. 

  517. 			array(129, 1921, 3, array( 390,  728, 1050, 1260)), //

    518. 

  518. 			array(133, 2051, 3, array( 420,  784, 1140, 1350)), //

    519. 

  519. 			array(137, 2185, 3, array( 450,  812, 1200, 1440)), // 30

    520. 

  520. 			array(141, 2323, 3, array( 480,  868, 1290, 1530)), //

    521. 

  521. 			array(145, 2465, 3, array( 510,  924, 1350, 1620)), //

    522. 

  522. 			array(149, 2611, 3, array( 540,  980, 1440, 1710)), //

    523. 

  523. 			array(153, 2761, 3, array( 570, 1036, 1530, 1800)), //

    524. 

  524. 			array(157, 2876, 0, array( 570, 1064, 1590, 1890)), // 35

    525. 

  525. 			array(161, 3034, 0, array( 600, 1120, 1680, 1980)), //

    526. 

  526. 			array(165, 3196, 0, array( 630, 1204, 1770, 2100)), //

    527. 

  527. 			array(169, 3362, 0, array( 660, 1260, 1860, 2220)), //

    528. 

  528. 			array(173, 3532, 0, array( 720, 1316, 1950, 2310)), //

    529. 

  529. 			array(177, 3706, 0, array( 750, 1372, 2040, 2430))  // 40

    530. 

  530. 		);

    531. 

  531. 

    532. 

  532. 		/**

    533. 

  533. 		 * @var array Length indicator

    534. 

  534. 		 * @access protected

    535. 

  535. 		 */

    536. 

  536. 		protected $lengthTableBits = array(

    537. 

  537. 			array(10, 12, 14),

    538. 

  538. 			array( 9, 11, 13),

    539. 

  539. 			array( 8, 16, 16),

    540. 

  540. 			array( 8, 10, 12)

    541. 

  541. 		);

    542. 

  542. 

    543. 

  543. 		/**

    544. 

  544. 		 * @var array Table of the error correction code (Reed-Solomon block)

    545. 

  545. 		 * See Table 12-16 (pp.30-36), JIS X0510:2004.

    546. 

  546. 		 * @access protected

    547. 

  547. 		 */

    548. 

  548. 		protected $eccTable = array(

    549. 

  549. 			array(array( 0,  0), array( 0,  0), array( 0,  0), array( 0,  0)), //

    550. 

  550. 			array(array( 1,  0), array( 1,  0), array( 1,  0), array( 1,  0)), //  1

    551. 

  551. 			array(array( 1,  0), array( 1,  0), array( 1,  0), array( 1,  0)), //

    552. 

  552. 			array(array( 1,  0), array( 1,  0), array( 2,  0), array( 2,  0)), //

    553. 

  553. 			array(array( 1,  0), array( 2,  0), array( 2,  0), array( 4,  0)), //

    554. 

  554. 			array(array( 1,  0), array( 2,  0), array( 2,  2), array( 2,  2)), //  5

    555. 

  555. 			array(array( 2,  0), array( 4,  0), array( 4,  0), array( 4,  0)), //

    556. 

  556. 			array(array( 2,  0), array( 4,  0), array( 2,  4), array( 4,  1)), //

    557. 

  557. 			array(array( 2,  0), array( 2,  2), array( 4,  2), array( 4,  2)), //

    558. 

  558. 			array(array( 2,  0), array( 3,  2), array( 4,  4), array( 4,  4)), //

    559. 

  559. 			array(array( 2,  2), array( 4,  1), array( 6,  2), array( 6,  2)), // 10

    560. 

  560. 			array(array( 4,  0), array( 1,  4), array( 4,  4), array( 3,  8)), //

    561. 

  561. 			array(array( 2,  2), array( 6,  2), array( 4,  6), array( 7,  4)), //

    562. 

  562. 			array(array( 4,  0), array( 8,  1), array( 8,  4), array(12,  4)), //

    563. 

  563. 			array(array( 3,  1), array( 4,  5), array(11,  5), array(11,  5)), //

    564. 

  564. 			array(array( 5,  1), array( 5,  5), array( 5,  7), array(11,  7)), // 15

    565. 

  565. 			array(array( 5,  1), array( 7,  3), array(15,  2), array( 3, 13)), //

    566. 

  566. 			array(array( 1,  5), array(10,  1), array( 1, 15), array( 2, 17)), //

    567. 

  567. 			array(array( 5,  1), array( 9,  4), array(17,  1), array( 2, 19)), //

    568. 

  568. 			array(array( 3,  4), array( 3, 11), array(17,  4), array( 9, 16)), //

    569. 

  569. 			array(array( 3,  5), array( 3, 13), array(15,  5), array(15, 10)), // 20

    570. 

  570. 			array(array( 4,  4), array(17,  0), array(17,  6), array(19,  6)), //

    571. 

  571. 			array(array( 2,  7), array(17,  0), array( 7, 16), array(34,  0)), //

    572. 

  572. 			array(array( 4,  5), array( 4, 14), array(11, 14), array(16, 14)), //

    573. 

  573. 			array(array( 6,  4), array( 6, 14), array(11, 16), array(30,  2)), //

    574. 

  574. 			array(array( 8,  4), array( 8, 13), array( 7, 22), array(22, 13)), // 25

    575. 

  575. 			array(array(10,  2), array(19,  4), array(28,  6), array(33,  4)), //

    576. 

  576. 			array(array( 8,  4), array(22,  3), array( 8, 26), array(12, 28)), //

    577. 

  577. 			array(array( 3, 10), array( 3, 23), array( 4, 31), array(11, 31)), //

    578. 

  578. 			array(array( 7,  7), array(21,  7), array( 1, 37), array(19, 26)), //

    579. 

  579. 			array(array( 5, 10), array(19, 10), array(15, 25), array(23, 25)), // 30

    580. 

  580. 			array(array(13,  3), array( 2, 29), array(42,  1), array(23, 28)), //

    581. 

  581. 			array(array(17,  0), array(10, 23), array(10, 35), array(19, 35)), //

    582. 

  582. 			array(array(17,  1), array(14, 21), array(29, 19), array(11, 46)), //

    583. 

  583. 			array(array(13,  6), array(14, 23), array(44,  7), array(59,  1)), //

    584. 

  584. 			array(array(12,  7), array(12, 26), array(39, 14), array(22, 41)), // 35

    585. 

  585. 			array(array( 6, 14), array( 6, 34), array(46, 10), array( 2, 64)), //

    586. 

  586. 			array(array(17,  4), array(29, 14), array(49, 10), array(24, 46)), //

    587. 

  587. 			array(array( 4, 18), array(13, 32), array(48, 14), array(42, 32)), //

    588. 

  588. 			array(array(20,  4), array(40,  7), array(43, 22), array(10, 67)), //

    589. 

  589. 			array(array(19,  6), array(18, 31), array(34, 34), array(20, 61))  // 40

    590. 

  590. 		);

    591. 

  591. 

    592. 

  592. 		/**

    593. 

  593. 		 * @var array Positions of alignment patterns.

    594. 

  594. 		 * This array includes only the second and the third position of the alignment patterns. Rest of them can be calculated from the distance between them.

    595. 

  595. 		 * See Table 1 in Appendix E (pp.71) of JIS X0510:2004.

    596. 

  596. 		 * @access protected

    597. 

  597. 		 */

    598. 

  598. 		protected $alignmentPattern = array(

    599. 

  599. 			array( 0,  0),

    600. 

  600. 			array( 0,  0), array(18,  0), array(22,  0), array(26,  0), array(30,  0), //  1- 5

    601. 

  601. 			array(34,  0), array(22, 38), array(24, 42), array(26, 46), array(28, 50), //  6-10

    602. 

  602. 			array(30, 54), array(32, 58), array(34, 62), array(26, 46), array(26, 48), // 11-15

    603. 

  603. 			array(26, 50), array(30, 54), array(30, 56), array(30, 58), array(34, 62), // 16-20

    604. 

  604. 			array(28, 50), array(26, 50), array(30, 54), array(28, 54), array(32, 58), // 21-25

    605. 

  605. 			array(30, 58), array(34, 62), array(26, 50), array(30, 54), array(26, 52), // 26-30

    606. 

  606. 			array(30, 56), array(34, 60), array(30, 58), array(34, 62), array(30, 54), // 31-35

    607. 

  607. 			array(24, 50), array(28, 54), array(32, 58), array(26, 54), array(30, 58)  // 35-40

    608. 

  608. 		);

    609. 

  609. 

    610. 

  610. 		/**

    611. 

  611. 		 * @var array Version information pattern (BCH coded).

    612. 

  612. 		 * See Table 1 in Appendix D (pp.68) of JIS X0510:2004.

    613. 

  613. 		 * size: [QRSPEC_VERSION_MAX - 6]

    614. 

  614. 		 * @access protected

    615. 

  615. 		 */

    616. 

  616. 		protected $versionPattern = array(

    617. 

  617. 			0x07c94, 0x085bc, 0x09a99, 0x0a4d3, 0x0bbf6, 0x0c762, 0x0d847, 0x0e60d, //

    618. 

  618. 			0x0f928, 0x10b78, 0x1145d, 0x12a17, 0x13532, 0x149a6, 0x15683, 0x168c9, //

    619. 

  619. 			0x177ec, 0x18ec4, 0x191e1, 0x1afab, 0x1b08e, 0x1cc1a, 0x1d33f, 0x1ed75, //

    620. 

  620. 			0x1f250, 0x209d5, 0x216f0, 0x228ba, 0x2379f, 0x24b0b, 0x2542e, 0x26a64, //

    621. 

  621. 			0x27541, 0x28c69

    622. 

  622. 		);

    623. 

  623. 

    624. 

  624. 		/**

    625. 

  625. 		 * @var array Format information

    626. 

  626. 		 * @access protected

    627. 

  627. 		 */

    628. 

  628. 		protected $formatInfo = array(

    629. 

  629. 			array(0x77c4, 0x72f3, 0x7daa, 0x789d, 0x662f, 0x6318, 0x6c41, 0x6976), //

    630. 

  630. 			array(0x5412, 0x5125, 0x5e7c, 0x5b4b, 0x45f9, 0x40ce, 0x4f97, 0x4aa0), //

    631. 

  631. 			array(0x355f, 0x3068, 0x3f31, 0x3a06, 0x24b4, 0x2183, 0x2eda, 0x2bed), //

    632. 

  632. 			array(0x1689, 0x13be, 0x1ce7, 0x19d0, 0x0762, 0x0255, 0x0d0c, 0x083b)  //

    633. 

  633. 		);

    634. 

  634. 

    635. 

  635. 

    636. 

  636. 		// -------------------------------------------------

    637. 

  637. 		// -------------------------------------------------

    638. 

  638. 

    639. 

  639. 

    640. 

  640. 		/**

    641. 

  641. 		 * This is the class constructor.

    642. 

  642. 		 * Creates a QRcode object

    643. 

  643. 		 * @param string $code code to represent using QRcode

    644. 

  644. 		 * @param string $eclevel error level: <ul><li>L : About 7% or less errors can be corrected.</li><li>M : About 15% or less errors can be corrected.</li><li>Q : About 25% or less errors can be corrected.</li><li>H : About 30% or less errors can be corrected.</li></ul>

    645. 

  645. 		 * @access public

    646. 

  646. 		 * @since 1.0.000

    647. 

  647. 		 */

    648. 

  648. 		public function __construct($code, $eclevel = 'L') {

    649. 

  649. 			$barcode_array = array();

    650. 

  650. 			if ((is_null($code)) OR ($code == '\0') OR ($code == '')) {

    651. 

  651. 				return false;

    652. 

  652. 			}

    653. 

  653. 			// set error correction level

    654. 

  654. 			$this->level = array_search($eclevel, array('L', 'M', 'Q', 'H'));

    655. 

  655. 			if ($this->level === false) {

    656. 

  656. 				$this->level = QR_ECLEVEL_L;

    657. 

  657. 			}

    658. 

  658. 			if (($this->hint != QR_MODE_8B) AND ($this->hint != QR_MODE_KJ)) {

    659. 

  659. 				return false;

    660. 

  660. 			}

    661. 

  661. 			if (($this->version < 0) OR ($this->version > QRSPEC_VERSION_MAX)) {

    662. 

  662. 				return false;

    663. 

  663. 			}

    664. 

  664. 			$this->items = array();

    665. 

  665. 			$this->encodeString($code);

    666. 

  666. 			$qrTab = $this->binarize($this->data);

    667. 

  667. 			$size = count($qrTab);

    668. 

  668. 			$barcode_array['num_rows'] = $size;

    669. 

  669. 			$barcode_array['num_cols'] = $size;

    670. 

  670. 			$barcode_array['bcode'] = array();

    671. 

  671. 			foreach ($qrTab as $line) {

    672. 

  672. 				$arrAdd = array();

    673. 

  673. 				foreach (str_split($line) as $char) {

    674. 

  674. 					$arrAdd[] = ($char=='1')?1:0;

    675. 

  675. 				}

    676. 

  676. 				$barcode_array['bcode'][] = $arrAdd;

    677. 

  677. 			}

    678. 

  678. 			$this->barcode_array = $barcode_array;

    679. 

  679. 		}

    680. 

  680. 

    681. 

  681. 		/**

    682. 

  682. 		 * Returns a barcode array which is readable by TCPDF

    683. 

  683. 		 * @return array barcode array readable by TCPDF;

    684. 

  684. 		 * @access public

    685. 

  685. 		 */

    686. 

  686. 		public function getBarcodeArray() {

    687. 

  687. 			return $this->barcode_array;

    688. 

  688. 		}

    689. 

  689. 

    690. 

  690. 		/**

    691. 

  691. 		 * Convert the frame in binary form

    692. 

  692. 		 * @param array $frame array to binarize

    693. 

  693. 		 * @return array frame in binary form

    694. 

  694. 		 */

    695. 

  695. 		protected function binarize($frame) {

    696. 

  696. 			$len = count($frame);

    697. 

  697. 			// the frame is square (width = height)

    698. 

  698. 			foreach ($frame as &$frameLine) {

    699. 

  699. 				for ($i=0; $i<$len; $i++) {

    700. 

  700. 					$frameLine[$i] = (ord($frameLine[$i])&1)?'1':'0';

    701. 

  701. 				}

    702. 

  702. 			}

    703. 

  703. 			return $frame;

    704. 

  704. 		}

    705. 

  705. 

    706. 

  706. 		/**

    707. 

  707. 		 * Encode the input string to QR code

    708. 

  708. 		 * @param string $string input string to encode

    709. 

  709. 		 */

    710. 

  710. 		protected function encodeString($string) {

    711. 

  711. 			$this->dataStr = $string;

    712. 

  712. 			if (!$this->casesensitive) {

    713. 

  713. 				$this->toUpper();

    714. 

  714. 			}

    715. 

  715. 			$ret = $this->splitString();

    716. 

  716. 			if ($ret < 0) {

    717. 

  717. 				return NULL;

    718. 

  718. 			}

    719. 

  719. 			$this->encodeMask(-1);

    720. 

  720. 		}

    721. 

  721. 

    722. 

  722. 		/**

    723. 

  723. 		 * Encode mask

    724. 

  724. 		 * @param int $mask masking mode

    725. 

  725. 		 */

    726. 

  726. 		protected function encodeMask($mask) {

    727. 

  727. 			$spec = array(0, 0, 0, 0, 0);

    728. 

  728. 			$this->datacode = $this->getByteStream($this->items);

    729. 

  729. 			if (is_null($this->datacode)) {

    730. 

  730. 				return NULL;

    731. 

  731. 			}

    732. 

  732. 			$spec = $this->getEccSpec($this->version, $this->level, $spec);

    733. 

  733. 			$this->b1 = $this->rsBlockNum1($spec);

    734. 

  734. 			$this->dataLength = $this->rsDataLength($spec);

    735. 

  735. 			$this->eccLength = $this->rsEccLength($spec);

    736. 

  736. 			$this->ecccode = array_fill(0, $this->eccLength, 0);

    737. 

  737. 			$this->blocks = $this->rsBlockNum($spec);

    738. 

  738. 			$ret = $this->init($spec);

    739. 

  739. 			if ($ret < 0) {

    740. 

  740. 				return NULL;

    741. 

  741. 			}

    742. 

  742. 			$this->count = 0;

    743. 

  743. 			$this->width = $this->getWidth($this->version);

    744. 

  744. 			$this->frame = $this->newFrame($this->version);

    745. 

  745. 			$this->x = $this->width - 1;

    746. 

  746. 			$this->y = $this->width - 1;

    747. 

  747. 			$this->dir = -1;

    748. 

  748. 			$this->bit = -1;

    749. 

  749. 			// inteleaved data and ecc codes

    750. 

  750. 			for ($i=0; $i < ($this->dataLength + $this->eccLength); $i++) {

    751. 

  751. 				$code = $this->getCode();

    752. 

  752. 				$bit = 0x80;

    753. 

  753. 				for ($j=0; $j<8; $j++) {

    754. 

  754. 					$addr = $this->getNextPosition();

    755. 

  755. 					$this->setFrameAt($addr, 0x02 | (($bit & $code) != 0));

    756. 

  756. 					$bit = $bit >> 1;

    757. 

  757. 				}

    758. 

  758. 			}

    759. 

  759. 			// remainder bits

    760. 

  760. 			$j = $this->getRemainder($this->version);

    761. 

  761. 			for ($i=0; $i<$j; $i++) {

    762. 

  762. 				$addr = $this->getNextPosition();

    763. 

  763. 				$this->setFrameAt($addr, 0x02);

    764. 

  764. 			}

    765. 

  765. 			// masking

    766. 

  766. 			$this->runLength = array_fill(0, QRSPEC_WIDTH_MAX + 1, 0);

    767. 

  767. 			if ($mask < 0) {

    768. 

  768. 				if (QR_FIND_BEST_MASK) {

    769. 

  769. 					$masked = $this->mask($this->width, $this->frame, $this->level);

    770. 

  770. 				} else {

    771. 

  771. 					$masked = $this->makeMask($this->width, $this->frame, (intval(QR_DEFAULT_MASK) % 8), $this->level);

    772. 

  772. 				}

    773. 

  773. 			} else {

    774. 

  774. 				$masked = $this->makeMask($this->width, $this->frame, $mask, $this->level);

    775. 

  775. 			}

    776. 

  776. 			if ($masked == NULL) {

    777. 

  777. 				return NULL;

    778. 

  778. 			}

    779. 

  779. 			$this->data = $masked;

    780. 

  780. 		}

    781. 

  781. 

    782. 

  782. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    783. 

  783. 

    784. 

  784. 		// FrameFiller

    785. 

  785. 

    786. 

  786. 		/**

    787. 

  787. 		 * Set frame value at specified position

    788. 

  788. 		 * @param array $at x,y position

    789. 

  789. 		 * @param int $val value of the character to set

    790. 

  790. 		 */

    791. 

  791. 		protected function setFrameAt($at, $val) {

    792. 

  792. 			$this->frame[$at['y']][$at['x']] = chr($val);

    793. 

  793. 		}

    794. 

  794. 

    795. 

  795. 		/**

    796. 

  796. 		 * Get frame value at specified position

    797. 

  797. 		 * @param array $at x,y position

    798. 

  798. 		 * @return value at specified position

    799. 

  799. 		 */

    800. 

  800. 		protected function getFrameAt($at) {

    801. 

  801. 			return ord($this->frame[$at['y']][$at['x']]);

    802. 

  802. 		}

    803. 

  803. 

    804. 

  804. 		/**

    805. 

  805. 		 * Return the next frame position

    806. 

  806. 		 * @return array of x,y coordinates

    807. 

  807. 		 */

    808. 

  808. 		protected function getNextPosition() {

    809. 

  809. 			do {

    810. 

  810. 				if ($this->bit == -1) {

    811. 

  811. 					$this->bit = 0;

    812. 

  812. 					return array('x'=>$this->x, 'y'=>$this->y);

    813. 

  813. 				}

    814. 

  814. 				$x = $this->x;

    815. 

  815. 				$y = $this->y;

    816. 

  816. 				$w = $this->width;

    817. 

  817. 				if ($this->bit == 0) {

    818. 

  818. 					$x--;

    819. 

  819. 					$this->bit++;

    820. 

  820. 				} else {

    821. 

  821. 					$x++;

    822. 

  822. 					$y += $this->dir;

    823. 

  823. 					$this->bit--;

    824. 

  824. 				}

    825. 

  825. 				if ($this->dir < 0) {

    826. 

  826. 					if ($y < 0) {

    827. 

  827. 						$y = 0;

    828. 

  828. 						$x -= 2;

    829. 

  829. 						$this->dir = 1;

    830. 

  830. 						if ($x == 6) {

    831. 

  831. 							$x--;

    832. 

  832. 							$y = 9;

    833. 

  833. 						}

    834. 

  834. 					}

    835. 

  835. 				} else {

    836. 

  836. 					if ($y == $w) {

    837. 

  837. 						$y = $w - 1;

    838. 

  838. 						$x -= 2;

    839. 

  839. 						$this->dir = -1;

    840. 

  840. 						if ($x == 6) {

    841. 

  841. 							$x--;

    842. 

  842. 							$y -= 8;

    843. 

  843. 						}

    844. 

  844. 					}

    845. 

  845. 				}

    846. 

  846. 				if (($x < 0) OR ($y < 0)) {

    847. 

  847. 					return NULL;

    848. 

  848. 				}

    849. 

  849. 				$this->x = $x;

    850. 

  850. 				$this->y = $y;

    851. 

  851. 			} while(ord($this->frame[$y][$x]) & 0x80);

    852. 

  852. 			return array('x'=>$x, 'y'=>$y);

    853. 

  853. 		}

    854. 

  854. 

    855. 

  855. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    856. 

  856. 

    857. 

  857. 		// QRrawcode

    858. 

  858. 

    859. 

  859. 		/**

    860. 

  860. 		 * Initialize code.

    861. 

  861. 		 * @param array $spec array of ECC specification

    862. 

  862. 		 * @return 0 in case of success, -1 in case of error

    863. 

  863. 		 */

    864. 

  864. 		protected function init($spec) {

    865. 

  865. 			$dl = $this->rsDataCodes1($spec);

    866. 

  866. 			$el = $this->rsEccCodes1($spec);

    867. 

  867. 			$rs = $this->init_rs(8, 0x11d, 0, 1, $el, 255 - $dl - $el);

    868. 

  868. 			$blockNo = 0;

    869. 

  869. 			$dataPos = 0;

    870. 

  870. 			$eccPos = 0;

    871. 

  871. 			$endfor = $this->rsBlockNum1($spec);

    872. 

  872. 			for ($i=0; $i < $endfor; ++$i) {

    873. 

  873. 				$ecc = array_slice($this->ecccode, $eccPos);

    874. 

  874. 				$this->rsblocks[$blockNo] = array();

    875. 

  875. 				$this->rsblocks[$blockNo]['dataLength'] = $dl;

    876. 

  876. 				$this->rsblocks[$blockNo]['data'] = array_slice($this->datacode, $dataPos);

    877. 

  877. 				$this->rsblocks[$blockNo]['eccLength'] = $el;

    878. 

  878. 				$ecc = $this->encode_rs_char($rs, $this->rsblocks[$blockNo]['data'], $ecc);

    879. 

  879. 				$this->rsblocks[$blockNo]['ecc'] = $ecc;

    880. 

  880. 				$this->ecccode = array_merge(array_slice($this->ecccode,0, $eccPos), $ecc);

    881. 

  881. 				$dataPos += $dl;

    882. 

  882. 				$eccPos += $el;

    883. 

  883. 				$blockNo++;

    884. 

  884. 			}

    885. 

  885. 			if ($this->rsBlockNum2($spec) == 0) {

    886. 

  886. 				return 0;

    887. 

  887. 			}

    888. 

  888. 			$dl = $this->rsDataCodes2($spec);

    889. 

  889. 			$el = $this->rsEccCodes2($spec);

    890. 

  890. 			$rs = $this->init_rs(8, 0x11d, 0, 1, $el, 255 - $dl - $el);

    891. 

  891. 			if ($rs == NULL) {

    892. 

  892. 				return -1;

    893. 

  893. 			}

    894. 

  894. 			$endfor = $this->rsBlockNum2($spec);

    895. 

  895. 			for ($i=0; $i < $endfor; ++$i) {

    896. 

  896. 				$ecc = array_slice($this->ecccode, $eccPos);

    897. 

  897. 				$this->rsblocks[$blockNo] = array();

    898. 

  898. 				$this->rsblocks[$blockNo]['dataLength'] = $dl;

    899. 

  899. 				$this->rsblocks[$blockNo]['data'] = array_slice($this->datacode, $dataPos);

    900. 

  900. 				$this->rsblocks[$blockNo]['eccLength'] = $el;

    901. 

  901. 				$ecc = $this->encode_rs_char($rs, $this->rsblocks[$blockNo]['data'], $ecc);

    902. 

  902. 				$this->rsblocks[$blockNo]['ecc'] = $ecc;

    903. 

  903. 				$this->ecccode = array_merge(array_slice($this->ecccode, 0, $eccPos), $ecc);

    904. 

  904. 				$dataPos += $dl;

    905. 

  905. 				$eccPos += $el;

    906. 

  906. 				$blockNo++;

    907. 

  907. 			}

    908. 

  908. 			return 0;

    909. 

  909. 		}

    910. 

  910. 

    911. 

  911. 		/**

    912. 

  912. 		 * Return Reed-Solomon block code.

    913. 

  913. 		 * @return array rsblocks

    914. 

  914. 		 */

    915. 

  915. 		protected function getCode() {

    916. 

  916. 			if ($this->count < $this->dataLength) {

    917. 

  917. 				$row = $this->count % $this->blocks;

    918. 

  918. 				$col = $this->count / $this->blocks;

    919. 

  919. 				if ($col >= $this->rsblocks[0]['dataLength']) {

    920. 

  920. 					$row += $this->b1;

    921. 

  921. 				}

    922. 

  922. 				$ret = $this->rsblocks[$row]['data'][$col];

    923. 

  923. 			} elseif ($this->count < $this->dataLength + $this->eccLength) {

    924. 

  924. 				$row = ($this->count - $this->dataLength) % $this->blocks;

    925. 

  925. 				$col = ($this->count - $this->dataLength) / $this->blocks;

    926. 

  926. 				$ret = $this->rsblocks[$row]['ecc'][$col];

    927. 

  927. 			} else {

    928. 

  928. 				return 0;

    929. 

  929. 			}

    930. 

  930. 			$this->count++;

    931. 

  931. 			return $ret;

    932. 

  932. 		}

    933. 

  933. 

    934. 

  934. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    935. 

  935. 

    936. 

  936. 		// QRmask

    937. 

  937. 

    938. 

  938. 		/**

    939. 

  939. 		 * Write Format Information on frame and returns the number of black bits

    940. 

  940. 		 * @param int $width frame width

    941. 

  941. 		 * @param array $frame frame

    942. 

  942. 		 * @param array $mask masking mode

    943. 

  943. 		 * @param int $level error correction level

    944. 

  944. 		 * @return int blacks

    945. 

  945. 		 */

    946. 

  946. 		 protected function writeFormatInformation($width, &$frame, $mask, $level) {

    947. 

  947. 			$blacks = 0;

    948. 

  948. 			$format =  $this->getFormatInfo($mask, $level);

    949. 

  949. 			for ($i=0; $i<8; ++$i) {

    950. 

  950. 				if ($format & 1) {

    951. 

  951. 					$blacks += 2;

    952. 

  952. 					$v = 0x85;

    953. 

  953. 				} else {

    954. 

  954. 					$v = 0x84;

    955. 

  955. 				}

    956. 

  956. 				$frame[8][$width - 1 - $i] = chr($v);

    957. 

  957. 				if ($i < 6) {

    958. 

  958. 					$frame[$i][8] = chr($v);

    959. 

  959. 				} else {

    960. 

  960. 					$frame[$i + 1][8] = chr($v);

    961. 

  961. 				}

    962. 

  962. 				$format = $format >> 1;

    963. 

  963. 			}

    964. 

  964. 			for ($i=0; $i<7; ++$i) {

    965. 

  965. 			if ($format & 1) {

    966. 

  966. 				$blacks += 2;

    967. 

  967. 				$v = 0x85;

    968. 

  968. 			} else {

    969. 

  969. 				$v = 0x84;

    970. 

  970. 			}

    971. 

  971. 			$frame[$width - 7 + $i][8] = chr($v);

    972. 

  972. 			if ($i == 0) {

    973. 

  973. 				$frame[8][7] = chr($v);

    974. 

  974. 			} else {

    975. 

  975. 				$frame[8][6 - $i] = chr($v);

    976. 

  976. 			}

    977. 

  977. 			$format = $format >> 1;

    978. 

  978. 			}

    979. 

  979. 			return $blacks;

    980. 

  980. 		}

    981. 

  981. 

    982. 

  982. 		/**

    983. 

  983. 		 * mask0

    984. 

  984. 		 * @param int $x X position

    985. 

  985. 		 * @param int $y Y position

    986. 

  986. 		 * @return int mask

    987. 

  987. 		 */

    988. 

  988. 		 protected function mask0($x, $y) {

    989. 

  989. 			return ($x + $y) & 1;

    990. 

  990. 		}

    991. 

  991. 

    992. 

  992. 		/**

    993. 

  993. 		 * mask1

    994. 

  994. 		 * @param int $x X position

    995. 

  995. 		 * @param int $y Y position

    996. 

  996. 		 * @return int mask

    997. 

  997. 		 */

    998. 

  998. 		 protected function mask1($x, $y) {

    999. 

  999. 			return ($y & 1);

    1000. 

  1000. 		}

    1001. 

  1001. 

    1002. 

  1002. 		/**

    1003. 

  1003. 		 * mask2

    1004. 

  1004. 		 * @param int $x X position

    1005. 

  1005. 		 * @param int $y Y position

    1006. 

  1006. 		 * @return int mask

    1007. 

  1007. 		 */

    1008. 

  1008. 		 protected function mask2($x, $y) {

    1009. 

  1009. 			return ($x % 3);

    1010. 

  1010. 		}

    1011. 

  1011. 

    1012. 

  1012. 		/**

    1013. 

  1013. 		 * mask3

    1014. 

  1014. 		 * @param int $x X position

    1015. 

  1015. 		 * @param int $y Y position

    1016. 

  1016. 		 * @return int mask

    1017. 

  1017. 		 */

    1018. 

  1018. 		 protected function mask3($x, $y) {

    1019. 

  1019. 			return ($x + $y) % 3;

    1020. 

  1020. 		}

    1021. 

  1021. 

    1022. 

  1022. 		/**

    1023. 

  1023. 		 * mask4

    1024. 

  1024. 		 * @param int $x X position

    1025. 

  1025. 		 * @param int $y Y position

    1026. 

  1026. 		 * @return int mask

    1027. 

  1027. 		 */

    1028. 

  1028. 		 protected function mask4($x, $y) {

    1029. 

  1029. 			return (((int)($y / 2)) + ((int)($x / 3))) & 1;

    1030. 

  1030. 		}

    1031. 

  1031. 

    1032. 

  1032. 		/**

    1033. 

  1033. 		 * mask5

    1034. 

  1034. 		 * @param int $x X position

    1035. 

  1035. 		 * @param int $y Y position

    1036. 

  1036. 		 * @return int mask

    1037. 

  1037. 		 */

    1038. 

  1038. 		 protected function mask5($x, $y) {

    1039. 

  1039. 			return (($x * $y) & 1) + ($x * $y) % 3;

    1040. 

  1040. 		}

    1041. 

  1041. 

    1042. 

  1042. 		/**

    1043. 

  1043. 		 * mask6

    1044. 

  1044. 		 * @param int $x X position

    1045. 

  1045. 		 * @param int $y Y position

    1046. 

  1046. 		 * @return int mask

    1047. 

  1047. 		 */

    1048. 

  1048. 		 protected function mask6($x, $y) {

    1049. 

  1049. 			return ((($x * $y) & 1) + ($x * $y) % 3) & 1;

    1050. 

  1050. 		}

    1051. 

  1051. 

    1052. 

  1052. 		/**

    1053. 

  1053. 		 * mask7

    1054. 

  1054. 		 * @param int $x X position

    1055. 

  1055. 		 * @param int $y Y position

    1056. 

  1056. 		 * @return int mask

    1057. 

  1057. 		 */

    1058. 

  1058. 		 protected function mask7($x, $y) {

    1059. 

  1059. 			return ((($x * $y) % 3) + (($x + $y) & 1)) & 1;

    1060. 

  1060. 		}

    1061. 

  1061. 

    1062. 

  1062. 		/**

    1063. 

  1063. 		 * Return bitmask

    1064. 

  1064. 		 * @param int $maskNo mask number

    1065. 

  1065. 		 * @param int $width width

    1066. 

  1066. 		 * @param array $frame frame

    1067. 

  1067. 		 * @return array bitmask

    1068. 

  1068. 		 */

    1069. 

  1069. 		protected function generateMaskNo($maskNo, $width, $frame) {

    1070. 

  1070. 			$bitMask = array_fill(0, $width, array_fill(0, $width, 0));

    1071. 

  1071. 			for ($y=0; $y<$width; ++$y) {

    1072. 

  1072. 				for ($x=0; $x<$width; ++$x) {

    1073. 

  1073. 					if (ord($frame[$y][$x]) & 0x80) {

    1074. 

  1074. 						$bitMask[$y][$x] = 0;

    1075. 

  1075. 					} else {

    1076. 

  1076. 						$maskFunc = call_user_func(array($this, 'mask'.$maskNo), $x, $y);

    1077. 

  1077. 						$bitMask[$y][$x] = ($maskFunc == 0)?1:0;

    1078. 

  1078. 					}

    1079. 

  1079. 				}

    1080. 

  1080. 			}

    1081. 

  1081. 			return $bitMask;

    1082. 

  1082. 		}

    1083. 

  1083. 

    1084. 

  1084. 		/**

    1085. 

  1085. 		 * makeMaskNo

    1086. 

  1086. 		 * @param int $maskNo

    1087. 

  1087. 		 * @param int $width

    1088. 

  1088. 		 * @param int $s

    1089. 

  1089. 		 * @param int $d

    1090. 

  1090. 		 * @param boolean $maskGenOnly

    1091. 

  1091. 		 * @return int b

    1092. 

  1092. 		 */

    1093. 

  1093. 		 protected function makeMaskNo($maskNo, $width, $s, &$d, $maskGenOnly=false) {

    1094. 

  1094. 			$b = 0;

    1095. 

  1095. 			$bitMask = array();

    1096. 

  1096. 			$bitMask = $this->generateMaskNo($maskNo, $width, $s, $d);

    1097. 

  1097. 			if ($maskGenOnly) {

    1098. 

  1098. 				return;

    1099. 

  1099. 			}

    1100. 

  1100. 			$d = $s;

    1101. 

  1101. 			for ($y=0; $y<$width; ++$y) {

    1102. 

  1102. 				for ($x=0; $x<$width; ++$x) {

    1103. 

  1103. 					if ($bitMask[$y][$x] == 1) {

    1104. 

  1104. 						$d[$y][$x] = chr(ord($s[$y][$x]) ^ (int)$bitMask[$y][$x]);

    1105. 

  1105. 					}

    1106. 

  1106. 					$b += (int)(ord($d[$y][$x]) & 1);

    1107. 

  1107. 				}

    1108. 

  1108. 			}

    1109. 

  1109. 			return $b;

    1110. 

  1110. 		}

    1111. 

  1111. 

    1112. 

  1112. 		/**

    1113. 

  1113. 		 * makeMask

    1114. 

  1114. 		 * @param int $width

    1115. 

  1115. 		 * @param array $frame

    1116. 

  1116. 		 * @param int $maskNo

    1117. 

  1117. 		 * @param int $level

    1118. 

  1118. 		 * @return array mask

    1119. 

  1119. 		 */

    1120. 

  1120. 		 protected function makeMask($width, $frame, $maskNo, $level) {

    1121. 

  1121. 			$masked = array_fill(0, $width, str_repeat("\0", $width));

    1122. 

  1122. 			$this->makeMaskNo($maskNo, $width, $frame, $masked);

    1123. 

  1123. 			$this->writeFormatInformation($width, $masked, $maskNo, $level);

    1124. 

  1124. 			return $masked;

    1125. 

  1125. 		}

    1126. 

  1126. 

    1127. 

  1127. 		/**

    1128. 

  1128. 		 * calcN1N3

    1129. 

  1129. 		 * @param int $length

    1130. 

  1130. 		 * @return int demerit

    1131. 

  1131. 		 */

    1132. 

  1132. 		 protected function calcN1N3($length) {

    1133. 

  1133. 			$demerit = 0;

    1134. 

  1134. 			for ($i=0; $i<$length; ++$i) {

    1135. 

  1135. 				if ($this->runLength[$i] >= 5) {

    1136. 

  1136. 					$demerit += (N1 + ($this->runLength[$i] - 5));

    1137. 

  1137. 				}

    1138. 

  1138. 				if ($i & 1) {

    1139. 

  1139. 					if (($i >= 3) AND ($i < ($length-2)) AND ($this->runLength[$i] % 3 == 0)) {

    1140. 

  1140. 						$fact = (int)($this->runLength[$i] / 3);

    1141. 

  1141. 						if (($this->runLength[$i-2] == $fact)

    1142. 

  1142. 							AND ($this->runLength[$i-1] == $fact)

    1143. 

  1143. 							AND ($this->runLength[$i+1] == $fact)

    1144. 

  1144. 							AND ($this->runLength[$i+2] == $fact)) {

    1145. 

  1145. 							if (($this->runLength[$i-3] < 0) OR ($this->runLength[$i-3] >= (4 * $fact))) {

    1146. 

  1146. 								$demerit += N3;

    1147. 

  1147. 							} elseif ((($i+3) >= $length) OR ($this->runLength[$i+3] >= (4 * $fact))) {

    1148. 

  1148. 								$demerit += N3;

    1149. 

  1149. 							}

    1150. 

  1150. 						}

    1151. 

  1151. 					}

    1152. 

  1152. 				}

    1153. 

  1153. 			}

    1154. 

  1154. 			return $demerit;

    1155. 

  1155. 		}

    1156. 

  1156. 

    1157. 

  1157. 		/**

    1158. 

  1158. 		 * evaluateSymbol

    1159. 

  1159. 		 * @param int $width

    1160. 

  1160. 		 * @param array $frame

    1161. 

  1161. 		 * @return int demerit

    1162. 

  1162. 		 */

    1163. 

  1163. 		 protected function evaluateSymbol($width, $frame) {

    1164. 

  1164. 			$head = 0;

    1165. 

  1165. 			$demerit = 0;

    1166. 

  1166. 			for ($y=0; $y<$width; ++$y) {

    1167. 

  1167. 				$head = 0;

    1168. 

  1168. 				$this->runLength[0] = 1;

    1169. 

  1169. 				$frameY = $frame[$y];

    1170. 

  1170. 				if ($y > 0) {

    1171. 

  1171. 					$frameYM = $frame[$y-1];

    1172. 

  1172. 				}

    1173. 

  1173. 				for ($x=0; $x<$width; ++$x) {

    1174. 

  1174. 					if (($x > 0) AND ($y > 0)) {

    1175. 

  1175. 						$b22 = ord($frameY[$x]) & ord($frameY[$x-1]) & ord($frameYM[$x]) & ord($frameYM[$x-1]);

    1176. 

  1176. 						$w22 = ord($frameY[$x]) | ord($frameY[$x-1]) | ord($frameYM[$x]) | ord($frameYM[$x-1]);

    1177. 

  1177. 						if (($b22 | ($w22 ^ 1)) & 1) {

    1178. 

  1178. 							$demerit += N2;

    1179. 

  1179. 						}

    1180. 

  1180. 					}

    1181. 

  1181. 					if (($x == 0) AND (ord($frameY[$x]) & 1)) {

    1182. 

  1182. 						$this->runLength[0] = -1;

    1183. 

  1183. 						$head = 1;

    1184. 

  1184. 						$this->runLength[$head] = 1;

    1185. 

  1185. 					} elseif ($x > 0) {

    1186. 

  1186. 						if ((ord($frameY[$x]) ^ ord($frameY[$x-1])) & 1) {

    1187. 

  1187. 							$head++;

    1188. 

  1188. 							$this->runLength[$head] = 1;

    1189. 

  1189. 						} else {

    1190. 

  1190. 							$this->runLength[$head]++;

    1191. 

  1191. 						}

    1192. 

  1192. 					}

    1193. 

  1193. 				}

    1194. 

  1194. 				$demerit += $this->calcN1N3($head+1);

    1195. 

  1195. 			}

    1196. 

  1196. 			for ($x=0; $x<$width; ++$x) {

    1197. 

  1197. 				$head = 0;

    1198. 

  1198. 				$this->runLength[0] = 1;

    1199. 

  1199. 				for ($y=0; $y<$width; ++$y) {

    1200. 

  1200. 					if (($y == 0) AND (ord($frame[$y][$x]) & 1)) {

    1201. 

  1201. 						$this->runLength[0] = -1;

    1202. 

  1202. 						$head = 1;

    1203. 

  1203. 						$this->runLength[$head] = 1;

    1204. 

  1204. 					} elseif ($y > 0) {

    1205. 

  1205. 						if ((ord($frame[$y][$x]) ^ ord($frame[$y-1][$x])) & 1) {

    1206. 

  1206. 							$head++;

    1207. 

  1207. 							$this->runLength[$head] = 1;

    1208. 

  1208. 						} else {

    1209. 

  1209. 							$this->runLength[$head]++;

    1210. 

  1210. 						}

    1211. 

  1211. 					}

    1212. 

  1212. 				}

    1213. 

  1213. 				$demerit += $this->calcN1N3($head+1);

    1214. 

  1214. 			}

    1215. 

  1215. 			return $demerit;

    1216. 

  1216. 		}

    1217. 

  1217. 

    1218. 

  1218. 		/**

    1219. 

  1219. 		 * mask

    1220. 

  1220. 		 * @param int $width

    1221. 

  1221. 		 * @param array $frame

    1222. 

  1222. 		 * @param int $level

    1223. 

  1223. 		 * @return array best mask

    1224. 

  1224. 		 */

    1225. 

  1225. 		 protected function mask($width, $frame, $level) {

    1226. 

  1226. 			$minDemerit = PHP_INT_MAX;

    1227. 

  1227. 			$bestMaskNum = 0;

    1228. 

  1228. 			$bestMask = array();

    1229. 

  1229. 			$checked_masks = array(0, 1, 2, 3, 4, 5, 6, 7);

    1230. 

  1230. 			if (QR_FIND_FROM_RANDOM !== false) {

    1231. 

  1231. 				$howManuOut = 8 - (QR_FIND_FROM_RANDOM % 9);

    1232. 

  1232. 				for ($i = 0; $i <  $howManuOut; ++$i) {

    1233. 

  1233. 					$remPos = rand (0, count($checked_masks)-1);

    1234. 

  1234. 					unset($checked_masks[$remPos]);

    1235. 

  1235. 					$checked_masks = array_values($checked_masks);

    1236. 

  1236. 				}

    1237. 

  1237. 			}

    1238. 

  1238. 			$bestMask = $frame;

    1239. 

  1239. 			foreach ($checked_masks as $i) {

    1240. 

  1240. 				$mask = array_fill(0, $width, str_repeat("\0", $width));

    1241. 

  1241. 				$demerit = 0;

    1242. 

  1242. 				$blacks = 0;

    1243. 

  1243. 				$blacks  = $this->makeMaskNo($i, $width, $frame, $mask);

    1244. 

  1244. 				$blacks += $this->writeFormatInformation($width, $mask, $i, $level);

    1245. 

  1245. 				$blacks  = (int)(100 * $blacks / ($width * $width));

    1246. 

  1246. 				$demerit = (int)((int)(abs($blacks - 50) / 5) * N4);

    1247. 

  1247. 				$demerit += $this->evaluateSymbol($width, $mask);

    1248. 

  1248. 				if ($demerit < $minDemerit) {

    1249. 

  1249. 					$minDemerit = $demerit;

    1250. 

  1250. 					$bestMask = $mask;

    1251. 

  1251. 					$bestMaskNum = $i;

    1252. 

  1252. 				}

    1253. 

  1253. 			}

    1254. 

  1254. 			return $bestMask;

    1255. 

  1255. 		}

    1256. 

  1256. 

    1257. 

  1257. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    1258. 

  1258. 

    1259. 

  1259. 		// QRsplit

    1260. 

  1260. 

    1261. 

  1261. 		/**

    1262. 

  1262. 		 * Return true if the character at specified position is a number

    1263. 

  1263. 		 * @param string $str string

    1264. 

  1264. 		 * @param int $pos characted position

    1265. 

  1265. 		 * @return boolean true of false

    1266. 

  1266. 		 */

    1267. 

  1267. 		 protected function isdigitat($str, $pos) {

    1268. 

  1268. 			if ($pos >= strlen($str)) {

    1269. 

  1269. 				return false;

    1270. 

  1270. 			}

    1271. 

  1271. 			return ((ord($str[$pos]) >= ord('0'))&&(ord($str[$pos]) <= ord('9')));

    1272. 

  1272. 		}

    1273. 

  1273. 

    1274. 

  1274. 		/**

    1275. 

  1275. 		 * Return true if the character at specified position is an alphanumeric character

    1276. 

  1276. 		 * @param string $str string

    1277. 

  1277. 		 * @param int $pos characted position

    1278. 

  1278. 		 * @return boolean true of false

    1279. 

  1279. 		 */

    1280. 

  1280. 		 protected function isalnumat($str, $pos) {

    1281. 

  1281. 			if ($pos >= strlen($str)) {

    1282. 

  1282. 				return false;

    1283. 

  1283. 			}

    1284. 

  1284. 			return ($this->lookAnTable(ord($str[$pos])) >= 0);

    1285. 

  1285. 		}

    1286. 

  1286. 

    1287. 

  1287. 		/**

    1288. 

  1288. 		 * identifyMode

    1289. 

  1289. 		 * @param int $pos

    1290. 

  1290. 		 * @return int mode

    1291. 

  1291. 		 */

    1292. 

  1292. 		 protected function identifyMode($pos) {

    1293. 

  1293. 			if ($pos >= strlen($this->dataStr)) {

    1294. 

  1294. 				return QR_MODE_NL;

    1295. 

  1295. 			}

    1296. 

  1296. 			$c = $this->dataStr[$pos];

    1297. 

  1297. 			if ($this->isdigitat($this->dataStr, $pos)) {

    1298. 

  1298. 				return QR_MODE_NM;

    1299. 

  1299. 			} elseif ($this->isalnumat($this->dataStr, $pos)) {

    1300. 

  1300. 				return QR_MODE_AN;

    1301. 

  1301. 			} elseif ($this->hint == QR_MODE_KJ) {

    1302. 

  1302. 				if ($pos+1 < strlen($this->dataStr)) {

    1303. 

  1303. 					$d = $this->dataStr[$pos+1];

    1304. 

  1304. 					$word = (ord($c) << 8) | ord($d);

    1305. 

  1305. 					if (($word >= 0x8140 && $word <= 0x9ffc) OR ($word >= 0xe040 && $word <= 0xebbf)) {

    1306. 

  1306. 						return QR_MODE_KJ;

    1307. 

  1307. 					}

    1308. 

  1308. 				}

    1309. 

  1309. 			}

    1310. 

  1310. 			return QR_MODE_8B;

    1311. 

  1311. 		}

    1312. 

  1312. 

    1313. 

  1313. 		/**

    1314. 

  1314. 		 * eatNum

    1315. 

  1315. 		 * @return int run

    1316. 

  1316. 		 */

    1317. 

  1317. 		 protected function eatNum() {

    1318. 

  1318. 			$ln = $this->lengthIndicator(QR_MODE_NM, $this->version);

    1319. 

  1319. 			$p = 0;

    1320. 

  1320. 			while($this->isdigitat($this->dataStr, $p)) {

    1321. 

  1321. 				$p++;

    1322. 

  1322. 			}

    1323. 

  1323. 			$run = $p;

    1324. 

  1324. 			$mode = $this->identifyMode($p);

    1325. 

  1325. 			if ($mode == QR_MODE_8B) {

    1326. 

  1326. 				$dif = $this->estimateBitsModeNum($run) + 4 + $ln

    1327. 

  1327. 				+ $this->estimateBitsMode8(1)         // + 4 + l8

    1328. 

  1328. 				- $this->estimateBitsMode8($run + 1); // - 4 - l8

    1329. 

  1329. 				if ($dif > 0) {

    1330. 

  1330. 					return $this->eat8();

    1331. 

  1331. 				}

    1332. 

  1332. 			}

    1333. 

  1333. 			if ($mode == QR_MODE_AN) {

    1334. 

  1334. 				$dif = $this->estimateBitsModeNum($run) + 4 + $ln

    1335. 

  1335. 				+ $this->estimateBitsModeAn(1)        // + 4 + la

    1336. 

  1336. 				- $this->estimateBitsModeAn($run + 1);// - 4 - la

    1337. 

  1337. 				if ($dif > 0) {

    1338. 

  1338. 					return $this->eatAn();

    1339. 

  1339. 				}

    1340. 

  1340. 			}

    1341. 

  1341. 			$this->items = $this->appendNewInputItem($this->items, QR_MODE_NM, $run, str_split($this->dataStr));

    1342. 

  1342. 			return $run;

    1343. 

  1343. 		}

    1344. 

  1344. 

    1345. 

  1345. 		/**

    1346. 

  1346. 		 * eatAn

    1347. 

  1347. 		 * @return int run

    1348. 

  1348. 		 */

    1349. 

  1349. 		 protected function eatAn() {

    1350. 

  1350. 			$la = $this->lengthIndicator(QR_MODE_AN,  $this->version);

    1351. 

  1351. 			$ln = $this->lengthIndicator(QR_MODE_NM, $this->version);

    1352. 

  1352. 			$p = 0;

    1353. 

  1353. 			while($this->isalnumat($this->dataStr, $p)) {

    1354. 

  1354. 				if ($this->isdigitat($this->dataStr, $p)) {

    1355. 

  1355. 					$q = $p;

    1356. 

  1356. 					while($this->isdigitat($this->dataStr, $q)) {

    1357. 

  1357. 						$q++;

    1358. 

  1358. 					}

    1359. 

  1359. 					$dif = $this->estimateBitsModeAn($p) // + 4 + la

    1360. 

  1360. 					+ $this->estimateBitsModeNum($q - $p) + 4 + $ln

    1361. 

  1361. 					- $this->estimateBitsModeAn($q); // - 4 - la

    1362. 

  1362. 					if ($dif < 0) {

    1363. 

  1363. 						break;

    1364. 

  1364. 					} else {

    1365. 

  1365. 						$p = $q;

    1366. 

  1366. 					}

    1367. 

  1367. 				} else {

    1368. 

  1368. 					$p++;

    1369. 

  1369. 				}

    1370. 

  1370. 			}

    1371. 

  1371. 			$run = $p;

    1372. 

  1372. 			if (!$this->isalnumat($this->dataStr, $p)) {

    1373. 

  1373. 				$dif = $this->estimateBitsModeAn($run) + 4 + $la

    1374. 

  1374. 				+ $this->estimateBitsMode8(1) // + 4 + l8

    1375. 

  1375. 				- $this->estimateBitsMode8($run + 1); // - 4 - l8

    1376. 

  1376. 				if ($dif > 0) {

    1377. 

  1377. 					return $this->eat8();

    1378. 

  1378. 				}

    1379. 

  1379. 			}

    1380. 

  1380. 			$this->items = $this->appendNewInputItem($this->items, QR_MODE_AN, $run, str_split($this->dataStr));

    1381. 

  1381. 			return $run;

    1382. 

  1382. 		}

    1383. 

  1383. 

    1384. 

  1384. 		/**

    1385. 

  1385. 		 * eatKanji

    1386. 

  1386. 		 * @return int run

    1387. 

  1387. 		 */

    1388. 

  1388. 		 protected function eatKanji() {

    1389. 

  1389. 			$p = 0;

    1390. 

  1390. 			while($this->identifyMode($p) == QR_MODE_KJ) {

    1391. 

  1391. 				$p += 2;

    1392. 

  1392. 			}

    1393. 

  1393. 			$this->items = $this->appendNewInputItem($this->items, QR_MODE_KJ, $p, str_split($this->dataStr));

    1394. 

  1394. 			return $run;

    1395. 

  1395. 		}

    1396. 

  1396. 

    1397. 

  1397. 		/**

    1398. 

  1398. 		 * eat8

    1399. 

  1399. 		 * @return int run

    1400. 

  1400. 		 */

    1401. 

  1401. 		 protected function eat8() {

    1402. 

  1402. 			$la = $this->lengthIndicator(QR_MODE_AN, $this->version);

    1403. 

  1403. 			$ln = $this->lengthIndicator(QR_MODE_NM, $this->version);

    1404. 

  1404. 			$p = 1;

    1405. 

  1405. 			$dataStrLen = strlen($this->dataStr);

    1406. 

  1406. 			while($p < $dataStrLen) {

    1407. 

  1407. 				$mode = $this->identifyMode($p);

    1408. 

  1408. 				if ($mode == QR_MODE_KJ) {

    1409. 

  1409. 					break;

    1410. 

  1410. 				}

    1411. 

  1411. 				if ($mode == QR_MODE_NM) {

    1412. 

  1412. 					$q = $p;

    1413. 

  1413. 					while($this->isdigitat($this->dataStr, $q)) {

    1414. 

  1414. 						$q++;

    1415. 

  1415. 					}

    1416. 

  1416. 					$dif = $this->estimateBitsMode8($p) // + 4 + l8

    1417. 

  1417. 					+ $this->estimateBitsModeNum($q - $p) + 4 + $ln

    1418. 

  1418. 					- $this->estimateBitsMode8($q); // - 4 - l8

    1419. 

  1419. 					if ($dif < 0) {

    1420. 

  1420. 						break;

    1421. 

  1421. 					} else {

    1422. 

  1422. 						$p = $q;

    1423. 

  1423. 					}

    1424. 

  1424. 				} elseif ($mode == QR_MODE_AN) {

    1425. 

  1425. 					$q = $p;

    1426. 

  1426. 					while($this->isalnumat($this->dataStr, $q)) {

    1427. 

  1427. 						$q++;

    1428. 

  1428. 					}

    1429. 

  1429. 					$dif = $this->estimateBitsMode8($p)  // + 4 + l8

    1430. 

  1430. 					+ $this->estimateBitsModeAn($q - $p) + 4 + $la

    1431. 

  1431. 					- $this->estimateBitsMode8($q); // - 4 - l8

    1432. 

  1432. 					if ($dif < 0) {

    1433. 

  1433. 						break;

    1434. 

  1434. 					} else {

    1435. 

  1435. 						$p = $q;

    1436. 

  1436. 					}

    1437. 

  1437. 				} else {

    1438. 

  1438. 					$p++;

    1439. 

  1439. 				}

    1440. 

  1440. 			}

    1441. 

  1441. 			$run = $p;

    1442. 

  1442. 			$this->items = $this->appendNewInputItem($this->items, QR_MODE_8B, $run, str_split($this->dataStr));

    1443. 

  1443. 			return $run;

    1444. 

  1444. 		}

    1445. 

  1445. 

    1446. 

  1446. 		/**

    1447. 

  1447. 		 * splitString

    1448. 

  1448. 		 */

    1449. 

  1449. 		 protected function splitString() {

    1450. 

  1450. 			while (strlen($this->dataStr) > 0) {

    1451. 

  1451. 				if ($this->dataStr == '') {

    1452. 

  1452. 					return 0;

    1453. 

  1453. 				}

    1454. 

  1454. 				$mode = $this->identifyMode(0);

    1455. 

  1455. 				switch ($mode) {

    1456. 

  1456. 					case QR_MODE_NM: {

    1457. 

  1457. 						$length = $this->eatNum();

    1458. 

  1458. 						break;

    1459. 

  1459. 					}

    1460. 

  1460. 					case QR_MODE_AN: {

    1461. 

  1461. 						$length = $this->eatAn();

    1462. 

  1462. 						break;

    1463. 

  1463. 					}

    1464. 

  1464. 					case QR_MODE_KJ: {

    1465. 

  1465. 						if ($hint == QR_MODE_KJ) {

    1466. 

  1466. 							$length = $this->eatKanji();

    1467. 

  1467. 						} else {

    1468. 

  1468. 							$length = $this->eat8();

    1469. 

  1469. 						}

    1470. 

  1470. 						break;

    1471. 

  1471. 					}

    1472. 

  1472. 					default: {

    1473. 

  1473. 						$length = $this->eat8();

    1474. 

  1474. 						break;

    1475. 

  1475. 					}

    1476. 

  1476. 				}

    1477. 

  1477. 				if ($length == 0) {

    1478. 

  1478. 					return 0;

    1479. 

  1479. 				}

    1480. 

  1480. 				if ($length < 0) {

    1481. 

  1481. 					return -1;

    1482. 

  1482. 				}

    1483. 

  1483. 				$this->dataStr = substr($this->dataStr, $length);

    1484. 

  1484. 			}

    1485. 

  1485. 		}

    1486. 

  1486. 

    1487. 

  1487. 		/**

    1488. 

  1488. 		 * toUpper

    1489. 

  1489. 		 */

    1490. 

  1490. 		 protected function toUpper() {

    1491. 

  1491. 			$stringLen = strlen($this->dataStr);

    1492. 

  1492. 			$p = 0;

    1493. 

  1493. 			while ($p < $stringLen) {

    1494. 

  1494. 				$mode = $this->identifyMode(substr($this->dataStr, $p), $this->hint);

    1495. 

  1495. 				if ($mode == QR_MODE_KJ) {

    1496. 

  1496. 					$p += 2;

    1497. 

  1497. 				} else {

    1498. 

  1498. 					if ((ord($this->dataStr[$p]) >= ord('a')) AND (ord($this->dataStr[$p]) <= ord('z'))) {

    1499. 

  1499. 						$this->dataStr[$p] = chr(ord($this->dataStr[$p]) - 32);

    1500. 

  1500. 					}

    1501. 

  1501. 					$p++;

    1502. 

  1502. 				}

    1503. 

  1503. 			}

    1504. 

  1504. 			return $this->dataStr;

    1505. 

  1505. 		}

    1506. 

  1506. 

    1507. 

  1507. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    1508. 

  1508. 

    1509. 

  1509. 		// QRinputItem

    1510. 

  1510. 

    1511. 

  1511. 		/**

    1512. 

  1512. 		 * newInputItem

    1513. 

  1513. 		 * @param int $mode

    1514. 

  1514. 		 * @param int $size

    1515. 

  1515. 		 * @param array $data

    1516. 

  1516. 		 * @param array $bstream

    1517. 

  1517. 		 * @return array input item

    1518. 

  1518. 		 */

    1519. 

  1519. 		 protected function newInputItem($mode, $size, $data, $bstream=null) {

    1520. 

  1520. 			$setData = array_slice($data, 0, $size);

    1521. 

  1521. 			if (count($setData) < $size) {

    1522. 

  1522. 				$setData = array_merge($setData, array_fill(0, ($size - count($setData)), 0));

    1523. 

  1523. 			}

    1524. 

  1524. 			if (!$this->check($mode, $size, $setData)) {

    1525. 

  1525. 				return NULL;

    1526. 

  1526. 			}

    1527. 

  1527. 			$inputitem = array();

    1528. 

  1528. 			$inputitem['mode'] = $mode;

    1529. 

  1529. 			$inputitem['size'] = $size;

    1530. 

  1530. 			$inputitem['data'] = $setData;

    1531. 

  1531. 			$inputitem['bstream'] = $bstream;

    1532. 

  1532. 			return $inputitem;

    1533. 

  1533. 		}

    1534. 

  1534. 

    1535. 

  1535. 		/**

    1536. 

  1536. 		 * encodeModeNum

    1537. 

  1537. 		 * @param array $inputitem

    1538. 

  1538. 		 * @param int $version

    1539. 

  1539. 		 * @return array input item

    1540. 

  1540. 		 */

    1541. 

  1541. 		 protected function encodeModeNum($inputitem, $version) {

    1542. 

  1542. 			$words = (int)($inputitem['size'] / 3);

    1543. 

  1543. 			$inputitem['bstream'] = array();

    1544. 

  1544. 			$val = 0x1;

    1545. 

  1545. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, $val);

    1546. 

  1546. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], $this->lengthIndicator(QR_MODE_NM, $version), $inputitem['size']);

    1547. 

  1547. 			for ($i=0; $i < $words; ++$i) {

    1548. 

  1548. 				$val  = (ord($inputitem['data'][$i*3  ]) - ord('0')) * 100;

    1549. 

  1549. 				$val += (ord($inputitem['data'][$i*3+1]) - ord('0')) * 10;

    1550. 

  1550. 				$val += (ord($inputitem['data'][$i*3+2]) - ord('0'));

    1551. 

  1551. 				$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 10, $val);

    1552. 

  1552. 			}

    1553. 

  1553. 			if ($inputitem['size'] - $words * 3 == 1) {

    1554. 

  1554. 				$val = ord($inputitem['data'][$words*3]) - ord('0');

    1555. 

  1555. 				$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, $val);

    1556. 

  1556. 			} elseif (($inputitem['size'] - ($words * 3)) == 2) {

    1557. 

  1557. 				$val  = (ord($inputitem['data'][$words*3  ]) - ord('0')) * 10;

    1558. 

  1558. 				$val += (ord($inputitem['data'][$words*3+1]) - ord('0'));

    1559. 

  1559. 				$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 7, $val);

    1560. 

  1560. 			}

    1561. 

  1561. 			return $inputitem;

    1562. 

  1562. 		}

    1563. 

  1563. 

    1564. 

  1564. 		/**

    1565. 

  1565. 		 * encodeModeAn

    1566. 

  1566. 		 * @param array $inputitem

    1567. 

  1567. 		 * @param int $version

    1568. 

  1568. 		 * @return array input item

    1569. 

  1569. 		 */

    1570. 

  1570. 		 protected function encodeModeAn($inputitem, $version) {

    1571. 

  1571. 			$words = (int)($inputitem['size'] / 2);

    1572. 

  1572. 			$inputitem['bstream'] = array();

    1573. 

  1573. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, 0x02);

    1574. 

  1574. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], $this->lengthIndicator(QR_MODE_AN, $version), $inputitem['size']);

    1575. 

  1575. 			for ($i=0; $i < $words; ++$i) {

    1576. 

  1576. 				$val  = (int)$this->lookAnTable(ord($inputitem['data'][$i*2  ])) * 45;

    1577. 

  1577. 				$val += (int)$this->lookAnTable(ord($inputitem['data'][$i*2+1]));

    1578. 

  1578. 				$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 11, $val);

    1579. 

  1579. 			}

    1580. 

  1580. 			if ($inputitem['size'] & 1) {

    1581. 

  1581. 				$val = $this->lookAnTable(ord($inputitem['data'][($words * 2)]));

    1582. 

  1582. 				$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 6, $val);

    1583. 

  1583. 			}

    1584. 

  1584. 			return $inputitem;

    1585. 

  1585. 		}

    1586. 

  1586. 

    1587. 

  1587. 		/**

    1588. 

  1588. 		 * encodeMode8

    1589. 

  1589. 		 * @param array $inputitem

    1590. 

  1590. 		 * @param int $version

    1591. 

  1591. 		 * @return array input item

    1592. 

  1592. 		 */

    1593. 

  1593. 		 protected function encodeMode8($inputitem, $version) {

    1594. 

  1594. 			$inputitem['bstream'] = array();

    1595. 

  1595. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, 0x4);

    1596. 

  1596. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], $this->lengthIndicator(QR_MODE_8B, $version), $inputitem['size']);

    1597. 

  1597. 			for ($i=0; $i < $inputitem['size']; ++$i) {

    1598. 

  1598. 				$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 8, ord($inputitem['data'][$i]));

    1599. 

  1599. 			}

    1600. 

  1600. 			return $inputitem;

    1601. 

  1601. 		}

    1602. 

  1602. 

    1603. 

  1603. 		/**

    1604. 

  1604. 		 * encodeModeKanji

    1605. 

  1605. 		 * @param array $inputitem

    1606. 

  1606. 		 * @param int $version

    1607. 

  1607. 		 * @return array input item

    1608. 

  1608. 		 */

    1609. 

  1609. 		 protected function encodeModeKanji($inputitem, $version) {

    1610. 

  1610. 			$inputitem['bstream'] = array();

    1611. 

  1611. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, 0x8);

    1612. 

  1612. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], $this->lengthIndicator(QR_MODE_KJ, $version), (int)($inputitem['size'] / 2));

    1613. 

  1613. 			for ($i=0; $i<$inputitem['size']; $i+=2) {

    1614. 

  1614. 				$val = (ord($inputitem['data'][$i]) << 8) | ord($inputitem['data'][$i+1]);

    1615. 

  1615. 				if ($val <= 0x9ffc) {

    1616. 

  1616. 					$val -= 0x8140;

    1617. 

  1617. 				} else {

    1618. 

  1618. 					$val -= 0xc140;

    1619. 

  1619. 				}

    1620. 

  1620. 				$h = ($val >> 8) * 0xc0;

    1621. 

  1621. 				$val = ($val & 0xff) + $h;

    1622. 

  1622. 				$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 13, $val);

    1623. 

  1623. 			}

    1624. 

  1624. 			return $inputitem;

    1625. 

  1625. 		}

    1626. 

  1626. 

    1627. 

  1627. 		/**

    1628. 

  1628. 		 * encodeModeStructure

    1629. 

  1629. 		 * @param array $inputitem

    1630. 

  1630. 		 * @return array input item

    1631. 

  1631. 		 */

    1632. 

  1632. 		 protected function encodeModeStructure($inputitem) {

    1633. 

  1633. 			$inputitem['bstream'] = array();

    1634. 

  1634. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, 0x03);

    1635. 

  1635. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, ord($inputitem['data'][1]) - 1);

    1636. 

  1636. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, ord($inputitem['data'][0]) - 1);

    1637. 

  1637. 			$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 8, ord($inputitem['data'][2]));

    1638. 

  1638. 			return $inputitem;

    1639. 

  1639. 		}

    1640. 

  1640. 

    1641. 

  1641. 		/**

    1642. 

  1642. 		 * encodeBitStream

    1643. 

  1643. 		 * @param array $inputitem

    1644. 

  1644. 		 * @param int $version

    1645. 

  1645. 		 * @return array input item

    1646. 

  1646. 		 */

    1647. 

  1647. 		 protected function encodeBitStream($inputitem, $version) {

    1648. 

  1648. 			$inputitem['bstream'] = array();

    1649. 

  1649. 			$words = $this->maximumWords($inputitem['mode'], $version);

    1650. 

  1650. 			if ($inputitem['size'] > $words) {

    1651. 

  1651. 				$st1 = $this->newInputItem($inputitem['mode'], $words, $inputitem['data']);

    1652. 

  1652. 				$st2 = $this->newInputItem($inputitem['mode'], $inputitem['size'] - $words, array_slice($inputitem['data'], $words));

    1653. 

  1653. 				$st1 = $this->encodeBitStream($st1, $version);

    1654. 

  1654. 				$st2 = $this->encodeBitStream($st2, $version);

    1655. 

  1655. 				$inputitem['bstream'] = array();

    1656. 

  1656. 				$inputitem['bstream'] = $this->appendBitstream($inputitem['bstream'], $st1['bstream']);

    1657. 

  1657. 				$inputitem['bstream'] = $this->appendBitstream($inputitem['bstream'], $st2['bstream']);

    1658. 

  1658. 			} else {

    1659. 

  1659. 				switch($inputitem['mode']) {

    1660. 

  1660. 					case QR_MODE_NM: {

    1661. 

  1661. 						$inputitem = $this->encodeModeNum($inputitem, $version);

    1662. 

  1662. 						break;

    1663. 

  1663. 					}

    1664. 

  1664. 					case QR_MODE_AN: {

    1665. 

  1665. 						$inputitem = $this->encodeModeAn($inputitem, $version);

    1666. 

  1666. 						break;

    1667. 

  1667. 					}

    1668. 

  1668. 					case QR_MODE_8B: {

    1669. 

  1669. 						$inputitem = $this->encodeMode8($inputitem, $version);

    1670. 

  1670. 						break;

    1671. 

  1671. 					}

    1672. 

  1672. 					case QR_MODE_KJ: {

    1673. 

  1673. 						$inputitem = $this->encodeModeKanji($inputitem, $version);

    1674. 

  1674. 						break;

    1675. 

  1675. 					}

    1676. 

  1676. 					case QR_MODE_ST: {

    1677. 

  1677. 						$inputitem = $this->encodeModeStructure($inputitem);

    1678. 

  1678. 						break;

    1679. 

  1679. 					}

    1680. 

  1680. 					default: {

    1681. 

  1681. 						break;

    1682. 

  1682. 					}

    1683. 

  1683. 				}

    1684. 

  1684. 			}

    1685. 

  1685. 			return $inputitem;

    1686. 

  1686. 		}

    1687. 

  1687. 

    1688. 

  1688. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    1689. 

  1689. 

    1690. 

  1690. 		// QRinput

    1691. 

  1691. 

    1692. 

  1692. 		/**

    1693. 

  1693. 		 * Append data to an input object.

    1694. 

  1694. 		 * The data is copied and appended to the input object.

    1695. 

  1695. 		 * @param array items input items

    1696. 

  1696. 		 * @param int $mode encoding mode.

    1697. 

  1697. 		 * @param int $size size of data (byte).

    1698. 

  1698. 		 * @param array $data array of input data.

    1699. 

  1699. 		 * @return items

    1700. 

  1700. 		 *

    1701. 

  1701. 		 */

    1702. 

  1702. 		protected function appendNewInputItem($items, $mode, $size, $data) {

    1703. 

  1703. 			$items[] = $this->newInputItem($mode, $size, $data);

    1704. 

  1704. 			return $items;

    1705. 

  1705. 		}

    1706. 

  1706. 

    1707. 

  1707. 		/**

    1708. 

  1708. 		 * insertStructuredAppendHeader

    1709. 

  1709. 		 * @param array $items

    1710. 

  1710. 		 * @param int $size

    1711. 

  1711. 		 * @param int $index

    1712. 

  1712. 		 * @param int $parity

    1713. 

  1713. 		 * @return array items

    1714. 

  1714. 		 */

    1715. 

  1715. 		 protected function insertStructuredAppendHeader($items, $size, $index, $parity) {

    1716. 

  1716. 			if ($size > MAX_STRUCTURED_SYMBOLS) {

    1717. 

  1717. 				return -1;

    1718. 

  1718. 			}

    1719. 

  1719. 			if (($index <= 0) OR ($index > MAX_STRUCTURED_SYMBOLS)) {

    1720. 

  1720. 				return -1;

    1721. 

  1721. 			}

    1722. 

  1722. 			$buf = array($size, $index, $parity);

    1723. 

  1723. 			$entry = $this->newInputItem(QR_MODE_ST, 3, buf);

    1724. 

  1724. 			array_unshift($items, $entry);

    1725. 

  1725. 			return $items;

    1726. 

  1726. 		}

    1727. 

  1727. 

    1728. 

  1728. 		/**

    1729. 

  1729. 		 * calcParity

    1730. 

  1730. 		 * @param array $items

    1731. 

  1731. 		 * @return int parity

    1732. 

  1732. 		 */

    1733. 

  1733. 		 protected function calcParity($items) {

    1734. 

  1734. 			$parity = 0;

    1735. 

  1735. 			foreach ($items as $item) {

    1736. 

  1736. 				if ($item['mode'] != QR_MODE_ST) {

    1737. 

  1737. 					for ($i=$item['size']-1; $i>=0; --$i) {

    1738. 

  1738. 						$parity ^= $item['data'][$i];

    1739. 

  1739. 					}

    1740. 

  1740. 				}

    1741. 

  1741. 			}

    1742. 

  1742. 			return $parity;

    1743. 

  1743. 		}

    1744. 

  1744. 

    1745. 

  1745. 		/**

    1746. 

  1746. 		 * checkModeNum

    1747. 

  1747. 		 * @param int $size

    1748. 

  1748. 		 * @param array $data

    1749. 

  1749. 		 * @return boolean true or false

    1750. 

  1750. 		 */

    1751. 

  1751. 		 protected function checkModeNum($size, $data) {

    1752. 

  1752. 			for ($i=0; $i<$size; ++$i) {

    1753. 

  1753. 				if ((ord($data[$i]) < ord('0')) OR (ord($data[$i]) > ord('9'))){

    1754. 

  1754. 					return false;

    1755. 

  1755. 				}

    1756. 

  1756. 			}

    1757. 

  1757. 			return true;

    1758. 

  1758. 		}

    1759. 

  1759. 

    1760. 

  1760. 		/**

    1761. 

  1761. 		 * estimateBitsModeNum

    1762. 

  1762. 		 * @param int $size

    1763. 

  1763. 		 * @return int number of bits

    1764. 

  1764. 		 */

    1765. 

  1765. 		 protected function estimateBitsModeNum($size) {

    1766. 

  1766. 			$w = (int)$size / 3;

    1767. 

  1767. 			$bits = $w * 10;

    1768. 

  1768. 			switch($size - $w * 3) {

    1769. 

  1769. 				case 1: {

    1770. 

  1770. 					$bits += 4;

    1771. 

  1771. 					break;

    1772. 

  1772. 				}

    1773. 

  1773. 				case 2: {

    1774. 

  1774. 					$bits += 7;

    1775. 

  1775. 					break;

    1776. 

  1776. 				}

    1777. 

  1777. 				default: {

    1778. 

  1778. 					break;

    1779. 

  1779. 				}

    1780. 

  1780. 			}

    1781. 

  1781. 			return $bits;

    1782. 

  1782. 		}

    1783. 

  1783. 

    1784. 

  1784. 		/**

    1785. 

  1785. 		 * Look up the alphabet-numeric convesion table (see JIS X0510:2004, pp.19).

    1786. 

  1786. 		 * @param int $c character value

    1787. 

  1787. 		 * @return value

    1788. 

  1788. 		 */

    1789. 

  1789. 		protected function lookAnTable($c) {

    1790. 

  1790. 			return (($c > 127)?-1:$this->anTable[$c]);

    1791. 

  1791. 		}

    1792. 

  1792. 

    1793. 

  1793. 		/**

    1794. 

  1794. 		 * checkModeAn

    1795. 

  1795. 		 * @param int $size

    1796. 

  1796. 		 * @param array $data

    1797. 

  1797. 		 * @return boolean true or false

    1798. 

  1798. 		 */

    1799. 

  1799. 		 protected function checkModeAn($size, $data) {

    1800. 

  1800. 			for ($i=0; $i<$size; ++$i) {

    1801. 

  1801. 				if ($this->lookAnTable(ord($data[$i])) == -1) {

    1802. 

  1802. 					return false;

    1803. 

  1803. 				}

    1804. 

  1804. 			}

    1805. 

  1805. 			return true;

    1806. 

  1806. 		}

    1807. 

  1807. 

    1808. 

  1808. 		/**

    1809. 

  1809. 		 * estimateBitsModeAn

    1810. 

  1810. 		 * @param int $size

    1811. 

  1811. 		 * @return int number of bits

    1812. 

  1812. 		 */

    1813. 

  1813. 		 protected function estimateBitsModeAn($size) {

    1814. 

  1814. 			$w = (int)($size / 2);

    1815. 

  1815. 			$bits = $w * 11;

    1816. 

  1816. 			if ($size & 1) {

    1817. 

  1817. 				$bits += 6;

    1818. 

  1818. 			}

    1819. 

  1819. 			return $bits;

    1820. 

  1820. 		}

    1821. 

  1821. 

    1822. 

  1822. 		/**

    1823. 

  1823. 		 * estimateBitsMode8

    1824. 

  1824. 		 * @param int $size

    1825. 

  1825. 		 * @return int number of bits

    1826. 

  1826. 		 */

    1827. 

  1827. 		 protected function estimateBitsMode8($size) {

    1828. 

  1828. 			return $size * 8;

    1829. 

  1829. 		}

    1830. 

  1830. 

    1831. 

  1831. 		/**

    1832. 

  1832. 		 * estimateBitsModeKanji

    1833. 

  1833. 		 * @param int $size

    1834. 

  1834. 		 * @return int number of bits

    1835. 

  1835. 		 */

    1836. 

  1836. 		 protected function estimateBitsModeKanji($size) {

    1837. 

  1837. 			return (int)(($size / 2) * 13);

    1838. 

  1838. 		}

    1839. 

  1839. 

    1840. 

  1840. 		/**

    1841. 

  1841. 		 * checkModeKanji

    1842. 

  1842. 		 * @param int $size

    1843. 

  1843. 		 * @param array $data

    1844. 

  1844. 		 * @return boolean true or false

    1845. 

  1845. 		 */

    1846. 

  1846. 		 protected function checkModeKanji($size, $data) {

    1847. 

  1847. 			if ($size & 1) {

    1848. 

  1848. 				return false;

    1849. 

  1849. 			}

    1850. 

  1850. 			for ($i=0; $i<$size; $i+=2) {

    1851. 

  1851. 				$val = (ord($data[$i]) << 8) | ord($data[$i+1]);

    1852. 

  1852. 				if (($val < 0x8140) OR (($val > 0x9ffc) AND ($val < 0xe040)) OR ($val > 0xebbf)) {

    1853. 

  1853. 					return false;

    1854. 

  1854. 				}

    1855. 

  1855. 			}

    1856. 

  1856. 			return true;

    1857. 

  1857. 		}

    1858. 

  1858. 

    1859. 

  1859. 		/**

    1860. 

  1860. 		 * Validate the input data.

    1861. 

  1861. 		 * @param int $mode encoding mode.

    1862. 

  1862. 		 * @param int $size size of data (byte).

    1863. 

  1863. 		 * @param array data data to validate

    1864. 

  1864. 		 * @return boolean true in case of valid data, false otherwise

    1865. 

  1865. 		 */

    1866. 

  1866. 		protected function check($mode, $size, $data) {

    1867. 

  1867. 			if ($size <= 0) {

    1868. 

  1868. 				return false;

    1869. 

  1869. 			}

    1870. 

  1870. 			switch($mode) {

    1871. 

  1871. 				case QR_MODE_NM: {

    1872. 

  1872. 					return $this->checkModeNum($size, $data);

    1873. 

  1873. 				}

    1874. 

  1874. 				case QR_MODE_AN: {

    1875. 

  1875. 					return $this->checkModeAn($size, $data);

    1876. 

  1876. 				}

    1877. 

  1877. 				case QR_MODE_KJ: {

    1878. 

  1878. 					return $this->checkModeKanji($size, $data);

    1879. 

  1879. 				}

    1880. 

  1880. 				case QR_MODE_8B: {

    1881. 

  1881. 					return true;

    1882. 

  1882. 				}

    1883. 

  1883. 				case QR_MODE_ST: {

    1884. 

  1884. 					return true;

    1885. 

  1885. 				}

    1886. 

  1886. 				default: {

    1887. 

  1887. 					break;

    1888. 

  1888. 				}

    1889. 

  1889. 			}

    1890. 

  1890. 			return false;

    1891. 

  1891. 		}

    1892. 

  1892. 

    1893. 

  1893. 		/**

    1894. 

  1894. 		 * estimateBitStreamSize

    1895. 

  1895. 		 * @param array $items

    1896. 

  1896. 		 * @param int $version

    1897. 

  1897. 		 * @return int bits

    1898. 

  1898. 		 */

    1899. 

  1899. 		 protected function estimateBitStreamSize($items, $version) {

    1900. 

  1900. 			$bits = 0;

    1901. 

  1901. 			if ($version == 0) {

    1902. 

  1902. 				$version = 1;

    1903. 

  1903. 			}

    1904. 

  1904. 			foreach ($items as $item) {

    1905. 

  1905. 				switch($item['mode']) {

    1906. 

  1906. 					case QR_MODE_NM: {

    1907. 

  1907. 						$bits = $this->estimateBitsModeNum($item['size']);

    1908. 

  1908. 						break;

    1909. 

  1909. 					}

    1910. 

  1910. 					case QR_MODE_AN: {

    1911. 

  1911. 						$bits = $this->estimateBitsModeAn($item['size']);

    1912. 

  1912. 						break;

    1913. 

  1913. 					}

    1914. 

  1914. 					case QR_MODE_8B: {

    1915. 

  1915. 						$bits = $this->estimateBitsMode8($item['size']);

    1916. 

  1916. 						break;

    1917. 

  1917. 					}

    1918. 

  1918. 					case QR_MODE_KJ: {

    1919. 

  1919. 						$bits = $this->estimateBitsModeKanji($item['size']);

    1920. 

  1920. 						break;

    1921. 

  1921. 					}

    1922. 

  1922. 					case QR_MODE_ST: {

    1923. 

  1923. 						return STRUCTURE_HEADER_BITS;

    1924. 

  1924. 					}

    1925. 

  1925. 					default: {

    1926. 

  1926. 						return 0;

    1927. 

  1927. 					}

    1928. 

  1928. 				}

    1929. 

  1929. 				$l = $this->lengthIndicator($item['mode'], $version);

    1930. 

  1930. 				$m = 1 << $l;

    1931. 

  1931. 				$num = (int)(($item['size'] + $m - 1) / $m);

    1932. 

  1932. 				$bits += $num * (4 + $l);

    1933. 

  1933. 			}

    1934. 

  1934. 			return $bits;

    1935. 

  1935. 		}

    1936. 

  1936. 

    1937. 

  1937. 		/**

    1938. 

  1938. 		 * estimateVersion

    1939. 

  1939. 		 * @param array $items

    1940. 

  1940. 		 * @return int version

    1941. 

  1941. 		 */

    1942. 

  1942. 		 protected function estimateVersion($items) {

    1943. 

  1943. 			$version = 0;

    1944. 

  1944. 			$prev = 0;

    1945. 

  1945. 			do {

    1946. 

  1946. 				$prev = $version;

    1947. 

  1947. 				$bits = $this->estimateBitStreamSize($items, $prev);

    1948. 

  1948. 				$version = $this->getMinimumVersion((int)(($bits + 7) / 8), $this->level);

    1949. 

  1949. 				if ($version < 0) {

    1950. 

  1950. 					return -1;

    1951. 

  1951. 				}

    1952. 

  1952. 			} while ($version > $prev);

    1953. 

  1953. 			return $version;

    1954. 

  1954. 		}

    1955. 

  1955. 

    1956. 

  1956. 		/**

    1957. 

  1957. 		 * lengthOfCode

    1958. 

  1958. 		 * @param int $mode

    1959. 

  1959. 		 * @param int $version

    1960. 

  1960. 		 * @param int $bits

    1961. 

  1961. 		 * @return int size

    1962. 

  1962. 		 */

    1963. 

  1963. 		 protected function lengthOfCode($mode, $version, $bits) {

    1964. 

  1964. 			$payload = $bits - 4 - $this->lengthIndicator($mode, $version);

    1965. 

  1965. 			switch($mode) {

    1966. 

  1966. 				case QR_MODE_NM: {

    1967. 

  1967. 					$chunks = (int)($payload / 10);

    1968. 

  1968. 					$remain = $payload - $chunks * 10;

    1969. 

  1969. 					$size = $chunks * 3;

    1970. 

  1970. 					if ($remain >= 7) {

    1971. 

  1971. 						$size += 2;

    1972. 

  1972. 					} elseif ($remain >= 4) {

    1973. 

  1973. 						$size += 1;

    1974. 

  1974. 					}

    1975. 

  1975. 					break;

    1976. 

  1976. 				}

    1977. 

  1977. 				case QR_MODE_AN: {

    1978. 

  1978. 					$chunks = (int)($payload / 11);

    1979. 

  1979. 					$remain = $payload - $chunks * 11;

    1980. 

  1980. 					$size = $chunks * 2;

    1981. 

  1981. 					if ($remain >= 6) {

    1982. 

  1982. 						++$size;

    1983. 

  1983. 					}

    1984. 

  1984. 					break;

    1985. 

  1985. 				}

    1986. 

  1986. 				case QR_MODE_8B: {

    1987. 

  1987. 					$size = (int)($payload / 8);

    1988. 

  1988. 					break;

    1989. 

  1989. 				}

    1990. 

  1990. 				case QR_MODE_KJ: {

    1991. 

  1991. 					$size = (int)(($payload / 13) * 2);

    1992. 

  1992. 					break;

    1993. 

  1993. 				}

    1994. 

  1994. 				case QR_MODE_ST: {

    1995. 

  1995. 					$size = (int)($payload / 8);

    1996. 

  1996. 					break;

    1997. 

  1997. 				}

    1998. 

  1998. 				default: {

    1999. 

  1999. 					$size = 0;

    2000. 

  2000. 					break;

    2001. 

  2001. 				}

    2002. 

  2002. 			}

    2003. 

  2003. 			$maxsize = $this->maximumWords($mode, $version);

    2004. 

  2004. 			if ($size < 0) {

    2005. 

  2005. 				$size = 0;

    2006. 

  2006. 			}

    2007. 

  2007. 			if ($size > $maxsize) {

    2008. 

  2008. 				$size = $maxsize;

    2009. 

  2009. 			}

    2010. 

  2010. 			return $size;

    2011. 

  2011. 		}

    2012. 

  2012. 

    2013. 

  2013. 		/**

    2014. 

  2014. 		 * createBitStream

    2015. 

  2015. 		 * @param array $items

    2016. 

  2016. 		 * @return array of items and total bits

    2017. 

  2017. 		 */

    2018. 

  2018. 		 protected function createBitStream($items) {

    2019. 

  2019. 			$total = 0;

    2020. 

  2020. 			foreach ($items as $key => $item) {

    2021. 

  2021. 				$items[$key] = $this->encodeBitStream($item, $this->version);

    2022. 

  2022. 				$bits = count($items[$key]['bstream']);

    2023. 

  2023. 				$total += $bits;

    2024. 

  2024. 			}

    2025. 

  2025. 			return array($items, $total);

    2026. 

  2026. 		}

    2027. 

  2027. 

    2028. 

  2028. 		/**

    2029. 

  2029. 		 * convertData

    2030. 

  2030. 		 * @param array $items

    2031. 

  2031. 		 * @return array items

    2032. 

  2032. 		 */

    2033. 

  2033. 		 protected function convertData($items) {

    2034. 

  2034. 			$ver = $this->estimateVersion($items);

    2035. 

  2035. 			if ($ver > $this->version) {

    2036. 

  2036. 				$this->version = $ver;

    2037. 

  2037. 			}

    2038. 

  2038. 			for (;;) {

    2039. 

  2039. 				$cbs = $this->createBitStream($items);

    2040. 

  2040. 				$items = $cbs[0];

    2041. 

  2041. 				$bits = $cbs[1];

    2042. 

  2042. 				if ($bits < 0) {

    2043. 

  2043. 					return -1;

    2044. 

  2044. 				}

    2045. 

  2045. 				$ver = $this->getMinimumVersion((int)(($bits + 7) / 8), $this->level);

    2046. 

  2046. 				if ($ver < 0) {

    2047. 

  2047. 					return -1;

    2048. 

  2048. 				} elseif ($ver > $this->version) {

    2049. 

  2049. 					$this->version = $ver;

    2050. 

  2050. 				} else {

    2051. 

  2051. 					break;

    2052. 

  2052. 				}

    2053. 

  2053. 			}

    2054. 

  2054. 			return $items;

    2055. 

  2055. 		}

    2056. 

  2056. 

    2057. 

  2057. 		/**

    2058. 

  2058. 		 * Append Padding Bit to bitstream

    2059. 

  2059. 		 * @param array $bstream

    2060. 

  2060. 		 * @return array bitstream

    2061. 

  2061. 		 */

    2062. 

  2062. 		 protected function appendPaddingBit($bstream) {

    2063. 

  2063. 			$bits = count($bstream);

    2064. 

  2064. 			$maxwords = $this->getDataLength($this->version, $this->level);

    2065. 

  2065. 			$maxbits = $maxwords * 8;

    2066. 

  2066. 			if ($maxbits == $bits) {

    2067. 

  2067. 				return 0;

    2068. 

  2068. 			}

    2069. 

  2069. 			if ($maxbits - $bits < 5) {

    2070. 

  2070. 				return $this->appendNum($bstream, $maxbits - $bits, 0);

    2071. 

  2071. 			}

    2072. 

  2072. 			$bits += 4;

    2073. 

  2073. 			$words = (int)(($bits + 7) / 8);

    2074. 

  2074. 			$padding = array();

    2075. 

  2075. 			$padding = $this->appendNum($padding, $words * 8 - $bits + 4, 0);

    2076. 

  2076. 			$padlen = $maxwords - $words;

    2077. 

  2077. 			if ($padlen > 0) {

    2078. 

  2078. 				$padbuf = array();

    2079. 

  2079. 				for ($i=0; $i<$padlen; ++$i) {

    2080. 

  2080. 					$padbuf[$i] = ($i&1)?0x11:0xec;

    2081. 

  2081. 				}

    2082. 

  2082. 				$padding = $this->appendBytes($padding, $padlen, $padbuf);

    2083. 

  2083. 			}

    2084. 

  2084. 			return $this->appendBitstream($bstream, $padding);

    2085. 

  2085. 		}

    2086. 

  2086. 

    2087. 

  2087. 		/**

    2088. 

  2088. 		 * mergeBitStream

    2089. 

  2089. 		 * @param array $bstream

    2090. 

  2090. 		 * @return array bitstream

    2091. 

  2091. 		 */

    2092. 

  2092. 		 protected function mergeBitStream($items) {

    2093. 

  2093. 			$items = $this->convertData($items);

    2094. 

  2094. 			$bstream = array();

    2095. 

  2095. 			foreach ($items as $item) {

    2096. 

  2096. 				$bstream = $this->appendBitstream($bstream, $item['bstream']);

    2097. 

  2097. 			}

    2098. 

  2098. 			return $bstream;

    2099. 

  2099. 		}

    2100. 

  2100. 

    2101. 

  2101. 		/**

    2102. 

  2102. 		 * Returns a stream of bits.

    2103. 

  2103. 		 * @param int $items

    2104. 

  2104. 		 * @return array padded merged byte stream

    2105. 

  2105. 		 */

    2106. 

  2106. 		protected function getBitStream($items) {

    2107. 

  2107. 			$bstream = $this->mergeBitStream($items);

    2108. 

  2108. 			return $this->appendPaddingBit($bstream);

    2109. 

  2109. 		}

    2110. 

  2110. 

    2111. 

  2111. 		/**

    2112. 

  2112. 		 * Pack all bit streams padding bits into a byte array.

    2113. 

  2113. 		 * @param int $items

    2114. 

  2114. 		 * @return array padded merged byte stream

    2115. 

  2115. 		 */

    2116. 

  2116. 		protected function getByteStream($items) {

    2117. 

  2117. 			$bstream = $this->getBitStream($items);

    2118. 

  2118. 			return $this->bitstreamToByte($bstream);

    2119. 

  2119. 		}

    2120. 

  2120. 

    2121. 

  2121. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    2122. 

  2122. 

    2123. 

  2123. 		// QRbitstream

    2124. 

  2124. 

    2125. 

  2125. 		/**

    2126. 

  2126. 		 * Return an array with zeros

    2127. 

  2127. 		 * @param int $setLength array size

    2128. 

  2128. 		 * @return array

    2129. 

  2129. 		 */

    2130. 

  2130. 		 protected function allocate($setLength) {

    2131. 

  2131. 			return array_fill(0, $setLength, 0);

    2132. 

  2132. 		}

    2133. 

  2133. 

    2134. 

  2134. 		/**

    2135. 

  2135. 		 * Return new bitstream from number

    2136. 

  2136. 		 * @param int $bits number of bits

    2137. 

  2137. 		 * @param int $num number

    2138. 

  2138. 		 * @return array bitstream

    2139. 

  2139. 		 */

    2140. 

  2140. 		 protected function newFromNum($bits, $num) {

    2141. 

  2141. 			$bstream = $this->allocate($bits);

    2142. 

  2142. 			$mask = 1 << ($bits - 1);

    2143. 

  2143. 			for ($i=0; $i<$bits; ++$i) {

    2144. 

  2144. 				if ($num & $mask) {

    2145. 

  2145. 					$bstream[$i] = 1;

    2146. 

  2146. 				} else {

    2147. 

  2147. 					$bstream[$i] = 0;

    2148. 

  2148. 				}

    2149. 

  2149. 				$mask = $mask >> 1;

    2150. 

  2150. 			}

    2151. 

  2151. 			return $bstream;

    2152. 

  2152. 		}

    2153. 

  2153. 

    2154. 

  2154. 		/**

    2155. 

  2155. 		 * Return new bitstream from bytes

    2156. 

  2156. 		 * @param int $size size

    2157. 

  2157. 		 * @param array $data bytes

    2158. 

  2158. 		 * @return array bitstream

    2159. 

  2159. 		 */

    2160. 

  2160. 		 protected function newFromBytes($size, $data) {

    2161. 

  2161. 			$bstream = $this->allocate($size * 8);

    2162. 

  2162. 			$p=0;

    2163. 

  2163. 			for ($i=0; $i<$size; ++$i) {

    2164. 

  2164. 				$mask = 0x80;

    2165. 

  2165. 				for ($j=0; $j<8; ++$j) {

    2166. 

  2166. 					if ($data[$i] & $mask) {

    2167. 

  2167. 						$bstream[$p] = 1;

    2168. 

  2168. 					} else {

    2169. 

  2169. 						$bstream[$p] = 0;

    2170. 

  2170. 					}

    2171. 

  2171. 					$p++;

    2172. 

  2172. 					$mask = $mask >> 1;

    2173. 

  2173. 				}

    2174. 

  2174. 			}

    2175. 

  2175. 			return $bstream;

    2176. 

  2176. 		}

    2177. 

  2177. 

    2178. 

  2178. 		/**

    2179. 

  2179. 		 * Append one bitstream to another

    2180. 

  2180. 		 * @param array $bitstream original bitstream

    2181. 

  2181. 		 * @param array $append bitstream to append

    2182. 

  2182. 		 * @return array bitstream

    2183. 

  2183. 		 */

    2184. 

  2184. 		 protected function appendBitstream($bitstream, $append) {

    2185. 

  2185. 			if ((!is_array($append)) OR (count($append) == 0)) {

    2186. 

  2186. 				return $bitstream;

    2187. 

  2187. 			}

    2188. 

  2188. 			if (count($bitstream) == 0) {

    2189. 

  2189. 				return $append;

    2190. 

  2190. 			}

    2191. 

  2191. 			return array_values(array_merge($bitstream, $append));

    2192. 

  2192. 		}

    2193. 

  2193. 

    2194. 

  2194. 		/**

    2195. 

  2195. 		 * Append one bitstream created from number to another

    2196. 

  2196. 		 * @param array $bitstream original bitstream

    2197. 

  2197. 		 * @param int $bits number of bits

    2198. 

  2198. 		 * @param int $num number

    2199. 

  2199. 		 * @return array bitstream

    2200. 

  2200. 		 */

    2201. 

  2201. 		 protected function appendNum($bitstream, $bits, $num) {

    2202. 

  2202. 			if ($bits == 0) {

    2203. 

  2203. 				return 0;

    2204. 

  2204. 			}

    2205. 

  2205. 			$b = $this->newFromNum($bits, $num);

    2206. 

  2206. 			return $this->appendBitstream($bitstream, $b);

    2207. 

  2207. 		}

    2208. 

  2208. 

    2209. 

  2209. 		/**

    2210. 

  2210. 		 * Append one bitstream created from bytes to another

    2211. 

  2211. 		 * @param array $bitstream original bitstream

    2212. 

  2212. 		 * @param int $size size

    2213. 

  2213. 		 * @param array $data bytes

    2214. 

  2214. 		 * @return array bitstream

    2215. 

  2215. 		 */

    2216. 

  2216. 		 protected function appendBytes($bitstream, $size, $data) {

    2217. 

  2217. 			if ($size == 0) {

    2218. 

  2218. 				return 0;

    2219. 

  2219. 			}

    2220. 

  2220. 			$b = $this->newFromBytes($size, $data);

    2221. 

  2221. 			return $this->appendBitstream($bitstream, $b);

    2222. 

  2222. 		}

    2223. 

  2223. 

    2224. 

  2224. 		/**

    2225. 

  2225. 		 * Convert bitstream to bytes

    2226. 

  2226. 		 * @param array $bitstream original bitstream

    2227. 

  2227. 		 * @return array of bytes

    2228. 

  2228. 		 */

    2229. 

  2229. 		 protected function bitstreamToByte($bstream) {

    2230. 

  2230. 			$size = count($bstream);

    2231. 

  2231. 			if ($size == 0) {

    2232. 

  2232. 				return array();

    2233. 

  2233. 			}

    2234. 

  2234. 			$data = array_fill(0, (int)(($size + 7) / 8), 0);

    2235. 

  2235. 			$bytes = (int)($size / 8);

    2236. 

  2236. 			$p = 0;

    2237. 

  2237. 			for ($i=0; $i<$bytes; $i++) {

    2238. 

  2238. 				$v = 0;

    2239. 

  2239. 				for ($j=0; $j<8; $j++) {

    2240. 

  2240. 					$v = $v << 1;

    2241. 

  2241. 					$v |= $bstream[$p];

    2242. 

  2242. 					$p++;

    2243. 

  2243. 				}

    2244. 

  2244. 				$data[$i] = $v;

    2245. 

  2245. 			}

    2246. 

  2246. 			if ($size & 7) {

    2247. 

  2247. 				$v = 0;

    2248. 

  2248. 				for ($j=0; $j<($size & 7); $j++) {

    2249. 

  2249. 					$v = $v << 1;

    2250. 

  2250. 					$v |= $bstream[$p];

    2251. 

  2251. 					$p++;

    2252. 

  2252. 				}

    2253. 

  2253. 				$data[$bytes] = $v;

    2254. 

  2254. 			}

    2255. 

  2255. 			return $data;

    2256. 

  2256. 		}

    2257. 

  2257. 

    2258. 

  2258. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    2259. 

  2259. 

    2260. 

  2260. 		// QRspec

    2261. 

  2261. 

    2262. 

  2262. 		/**

    2263. 

  2263. 		 * Replace a value on the array at the specified position

    2264. 

  2264. 		 * @param array $srctab

    2265. 

  2265. 		 * @param int $x X position

    2266. 

  2266. 		 * @param int $y Y position

    2267. 

  2267. 		 * @param string $repl value to replace

    2268. 

  2268. 		 * @param int $replLen length of the repl string

    2269. 

  2269. 		 * @return array srctab

    2270. 

  2270. 		 */

    2271. 

  2271. 		 protected function qrstrset($srctab, $x, $y, $repl, $replLen=false) {

    2272. 

  2272. 			$srctab[$y] = substr_replace($srctab[$y], ($replLen !== false)?substr($repl,0,$replLen):$repl, $x, ($replLen !== false)?$replLen:strlen($repl));

    2273. 

  2273. 			return $srctab;

    2274. 

  2274. 		}

    2275. 

  2275. 

    2276. 

  2276. 		/**

    2277. 

  2277. 		 * Return maximum data code length (bytes) for the version.

    2278. 

  2278. 		 * @param int $version version

    2279. 

  2279. 		 * @param int $level error correction level

    2280. 

  2280. 		 * @return int maximum size (bytes)

    2281. 

  2281. 		 */

    2282. 

  2282. 		protected function getDataLength($version, $level) {

    2283. 

  2283. 			return $this->capacity[$version][QRCAP_WORDS] - $this->capacity[$version][QRCAP_EC][$level];

    2284. 

  2284. 		}

    2285. 

  2285. 

    2286. 

  2286. 		/**

    2287. 

  2287. 		 * Return maximum error correction code length (bytes) for the version.

    2288. 

  2288. 		 * @param int $version version

    2289. 

  2289. 		 * @param int $level error correction level

    2290. 

  2290. 		 * @return int ECC size (bytes)

    2291. 

  2291. 		 */

    2292. 

  2292. 		protected function getECCLength($version, $level){

    2293. 

  2293. 			return $this->capacity[$version][QRCAP_EC][$level];

    2294. 

  2294. 		}

    2295. 

  2295. 

    2296. 

  2296. 		/**

    2297. 

  2297. 		 * Return the width of the symbol for the version.

    2298. 

  2298. 		 * @param int $version version

    2299. 

  2299. 		 * @return int width

    2300. 

  2300. 		 */

    2301. 

  2301. 		protected function getWidth($version) {

    2302. 

  2302. 			return $this->capacity[$version][QRCAP_WIDTH];

    2303. 

  2303. 		}

    2304. 

  2304. 

    2305. 

  2305. 		/**

    2306. 

  2306. 		 * Return the numer of remainder bits.

    2307. 

  2307. 		 * @param int $version version

    2308. 

  2308. 		 * @return int number of remainder bits

    2309. 

  2309. 		 */

    2310. 

  2310. 		protected function getRemainder($version) {

    2311. 

  2311. 			return $this->capacity[$version][QRCAP_REMINDER];

    2312. 

  2312. 		}

    2313. 

  2313. 

    2314. 

  2314. 		/**

    2315. 

  2315. 		 * Return a version number that satisfies the input code length.

    2316. 

  2316. 		 * @param int $size input code length (byte)

    2317. 

  2317. 		 * @param int $level error correction level

    2318. 

  2318. 		 * @return int version number

    2319. 

  2319. 		 */

    2320. 

  2320. 		protected function getMinimumVersion($size, $level) {

    2321. 

  2321. 			for ($i=1; $i <= QRSPEC_VERSION_MAX; ++$i) {

    2322. 

  2322. 				$words  = $this->capacity[$i][QRCAP_WORDS] - $this->capacity[$i][QRCAP_EC][$level];

    2323. 

  2323. 				if ($words >= $size) {

    2324. 

  2324. 					return $i;

    2325. 

  2325. 				}

    2326. 

  2326. 			}

    2327. 

  2327. 			return -1;

    2328. 

  2328. 		}

    2329. 

  2329. 

    2330. 

  2330. 		/**

    2331. 

  2331. 		 * Return the size of length indicator for the mode and version.

    2332. 

  2332. 		 * @param int $mode encoding mode

    2333. 

  2333. 		 * @param int $version version

    2334. 

  2334. 		 * @return int the size of the appropriate length indicator (bits).

    2335. 

  2335. 		 */

    2336. 

  2336. 		protected function lengthIndicator($mode, $version) {

    2337. 

  2337. 			if ($mode == QR_MODE_ST) {

    2338. 

  2338. 				return 0;

    2339. 

  2339. 			}

    2340. 

  2340. 			if ($version <= 9) {

    2341. 

  2341. 				$l = 0;

    2342. 

  2342. 			} elseif ($version <= 26) {

    2343. 

  2343. 				$l = 1;

    2344. 

  2344. 			} else {

    2345. 

  2345. 				$l = 2;

    2346. 

  2346. 			}

    2347. 

  2347. 			return $this->lengthTableBits[$mode][$l];

    2348. 

  2348. 		}

    2349. 

  2349. 

    2350. 

  2350. 		/**

    2351. 

  2351. 		 * Return the maximum length for the mode and version.

    2352. 

  2352. 		 * @param int $mode encoding mode

    2353. 

  2353. 		 * @param int $version version

    2354. 

  2354. 		 * @return int the maximum length (bytes)

    2355. 

  2355. 		 */

    2356. 

  2356. 		protected function maximumWords($mode, $version) {

    2357. 

  2357. 			if ($mode == QR_MODE_ST) {

    2358. 

  2358. 				return 3;

    2359. 

  2359. 			}

    2360. 

  2360. 			if ($version <= 9) {

    2361. 

  2361. 				$l = 0;

    2362. 

  2362. 			} else if ($version <= 26) {

    2363. 

  2363. 				$l = 1;

    2364. 

  2364. 			} else {

    2365. 

  2365. 				$l = 2;

    2366. 

  2366. 			}

    2367. 

  2367. 			$bits = $this->lengthTableBits[$mode][$l];

    2368. 

  2368. 			$words = (1 << $bits) - 1;

    2369. 

  2369. 			if ($mode == QR_MODE_KJ) {

    2370. 

  2370. 				$words *= 2; // the number of bytes is required

    2371. 

  2371. 			}

    2372. 

  2372. 			return $words;

    2373. 

  2373. 		}

    2374. 

  2374. 

    2375. 

  2375. 		/**

    2376. 

  2376. 		 * Return an array of ECC specification.

    2377. 

  2377. 		 * @param int $version version

    2378. 

  2378. 		 * @param int $level error correction level

    2379. 

  2379. 		 * @param array $spec an array of ECC specification contains as following: {# of type1 blocks, # of data code, # of ecc code, # of type2 blocks, # of data code}

    2380. 

  2380. 		 * @return array spec

    2381. 

  2381. 		 */

    2382. 

  2382. 		protected function getEccSpec($version, $level, $spec) {

    2383. 

  2383. 			if (count($spec) < 5) {

    2384. 

  2384. 				$spec = array(0, 0, 0, 0, 0);

    2385. 

  2385. 			}

    2386. 

  2386. 			$b1 = $this->eccTable[$version][$level][0];

    2387. 

  2387. 			$b2 = $this->eccTable[$version][$level][1];

    2388. 

  2388. 			$data = $this->getDataLength($version, $level);

    2389. 

  2389. 			$ecc = $this->getECCLength($version, $level);

    2390. 

  2390. 			if ($b2 == 0) {

    2391. 

  2391. 				$spec[0] = $b1;

    2392. 

  2392. 				$spec[1] = (int)($data / $b1);

    2393. 

  2393. 				$spec[2] = (int)($ecc / $b1);

    2394. 

  2394. 				$spec[3] = 0;

    2395. 

  2395. 				$spec[4] = 0;

    2396. 

  2396. 			} else {

    2397. 

  2397. 				$spec[0] = $b1;

    2398. 

  2398. 				$spec[1] = (int)($data / ($b1 + $b2));

    2399. 

  2399. 				$spec[2] = (int)($ecc  / ($b1 + $b2));

    2400. 

  2400. 				$spec[3] = $b2;

    2401. 

  2401. 				$spec[4] = $spec[1] + 1;

    2402. 

  2402. 			}

    2403. 

  2403. 			return $spec;

    2404. 

  2404. 		}

    2405. 

  2405. 

    2406. 

  2406. 		/**

    2407. 

  2407. 		 * Put an alignment marker.

    2408. 

  2408. 		 * @param array $frame frame

    2409. 

  2409. 		 * @param int $width width

    2410. 

  2410. 		 * @param int $ox X center coordinate of the pattern

    2411. 

  2411. 		 * @param int $oy Y center coordinate of the pattern

    2412. 

  2412. 		 * @return array frame

    2413. 

  2413. 		 */

    2414. 

  2414. 		protected function putAlignmentMarker($frame, $ox, $oy) {

    2415. 

  2415. 			$finder = array(

    2416. 

  2416. 				"\xa1\xa1\xa1\xa1\xa1",

    2417. 

  2417. 				"\xa1\xa0\xa0\xa0\xa1",

    2418. 

  2418. 				"\xa1\xa0\xa1\xa0\xa1",

    2419. 

  2419. 				"\xa1\xa0\xa0\xa0\xa1",

    2420. 

  2420. 				"\xa1\xa1\xa1\xa1\xa1"

    2421. 

  2421. 				);

    2422. 

  2422. 			$yStart = $oy - 2;

    2423. 

  2423. 			$xStart = $ox - 2;

    2424. 

  2424. 			for ($y=0; $y < 5; $y++) {

    2425. 

  2425. 				$frame = $this->qrstrset($frame, $xStart, $yStart+$y, $finder[$y]);

    2426. 

  2426. 			}

    2427. 

  2427. 			return $frame;

    2428. 

  2428. 		}

    2429. 

  2429. 

    2430. 

  2430. 		/**

    2431. 

  2431. 		 * Put an alignment pattern.

    2432. 

  2432. 		 * @param int $version version

    2433. 

  2433. 		 * @param array $fram frame

    2434. 

  2434. 		 * @param int $width width

    2435. 

  2435. 		 * @return array frame

    2436. 

  2436. 		 */

    2437. 

  2437. 		 protected function putAlignmentPattern($version, $frame, $width) {

    2438. 

  2438. 			if ($version < 2) {

    2439. 

  2439. 				return $frame;

    2440. 

  2440. 			}

    2441. 

  2441. 			$d = $this->alignmentPattern[$version][1] - $this->alignmentPattern[$version][0];

    2442. 

  2442. 			if ($d < 0) {

    2443. 

  2443. 				$w = 2;

    2444. 

  2444. 			} else {

    2445. 

  2445. 				$w = (int)(($width - $this->alignmentPattern[$version][0]) / $d + 2);

    2446. 

  2446. 			}

    2447. 

  2447. 			if ($w * $w - 3 == 1) {

    2448. 

  2448. 				$x = $this->alignmentPattern[$version][0];

    2449. 

  2449. 				$y = $this->alignmentPattern[$version][0];

    2450. 

  2450. 				$frame = $this->putAlignmentMarker($frame, $x, $y);

    2451. 

  2451. 				return $frame;

    2452. 

  2452. 			}

    2453. 

  2453. 			$cx = $this->alignmentPattern[$version][0];

    2454. 

  2454. 			$wo = $w - 1;

    2455. 

  2455. 			for ($x=1; $x < $wo; ++$x) {

    2456. 

  2456. 				$frame = $this->putAlignmentMarker($frame, 6, $cx);

    2457. 

  2457. 				$frame = $this->putAlignmentMarker($frame, $cx,  6);

    2458. 

  2458. 				$cx += $d;

    2459. 

  2459. 			}

    2460. 

  2460. 			$cy = $this->alignmentPattern[$version][0];

    2461. 

  2461. 			for ($y=0; $y < $wo; ++$y) {

    2462. 

  2462. 				$cx = $this->alignmentPattern[$version][0];

    2463. 

  2463. 				for ($x=0; $x < $wo; ++$x) {

    2464. 

  2464. 					$frame = $this->putAlignmentMarker($frame, $cx, $cy);

    2465. 

  2465. 					$cx += $d;

    2466. 

  2466. 				}

    2467. 

  2467. 				$cy += $d;

    2468. 

  2468. 			}

    2469. 

  2469. 			return $frame;

    2470. 

  2470. 		}

    2471. 

  2471. 

    2472. 

  2472. 		/**

    2473. 

  2473. 		 * Return BCH encoded version information pattern that is used for the symbol of version 7 or greater. Use lower 18 bits.

    2474. 

  2474. 		 * @param int $version version

    2475. 

  2475. 		 * @return BCH encoded version information pattern

    2476. 

  2476. 		 */

    2477. 

  2477. 		protected function getVersionPattern($version) {

    2478. 

  2478. 			if (($version < 7) OR ($version > QRSPEC_VERSION_MAX)) {

    2479. 

  2479. 				return 0;

    2480. 

  2480. 			}

    2481. 

  2481. 			return $this->versionPattern[($version - 7)];

    2482. 

  2482. 		}

    2483. 

  2483. 

    2484. 

  2484. 		/**

    2485. 

  2485. 		 * Return BCH encoded format information pattern.

    2486. 

  2486. 		 * @param array $mask

    2487. 

  2487. 		 * @param int $level error correction level

    2488. 

  2488. 		 * @return BCH encoded format information pattern

    2489. 

  2489. 		 */

    2490. 

  2490. 		protected function getFormatInfo($mask, $level) {

    2491. 

  2491. 			if (($mask < 0) OR ($mask > 7)) {

    2492. 

  2492. 				return 0;

    2493. 

  2493. 			}

    2494. 

  2494. 			if (($level < 0) OR ($level > 3)) {

    2495. 

  2495. 				return 0;

    2496. 

  2496. 			}

    2497. 

  2497. 			return $this->formatInfo[$level][$mask];

    2498. 

  2498. 		}

    2499. 

  2499. 

    2500. 

  2500. 		/**

    2501. 

  2501. 		 * Put a finder pattern.

    2502. 

  2502. 		 * @param array $frame frame

    2503. 

  2503. 		 * @param int $width width

    2504. 

  2504. 		 * @param int $ox X center coordinate of the pattern

    2505. 

  2505. 		 * @param int $oy Y center coordinate of the pattern

    2506. 

  2506. 		 * @return array frame

    2507. 

  2507. 		 */

    2508. 

  2508. 		protected function putFinderPattern($frame, $ox, $oy) {

    2509. 

  2509. 			$finder = array(

    2510. 

  2510. 			"\xc1\xc1\xc1\xc1\xc1\xc1\xc1",

    2511. 

  2511. 			"\xc1\xc0\xc0\xc0\xc0\xc0\xc1",

    2512. 

  2512. 			"\xc1\xc0\xc1\xc1\xc1\xc0\xc1",

    2513. 

  2513. 			"\xc1\xc0\xc1\xc1\xc1\xc0\xc1",

    2514. 

  2514. 			"\xc1\xc0\xc1\xc1\xc1\xc0\xc1",

    2515. 

  2515. 			"\xc1\xc0\xc0\xc0\xc0\xc0\xc1",

    2516. 

  2516. 			"\xc1\xc1\xc1\xc1\xc1\xc1\xc1"

    2517. 

  2517. 			);

    2518. 

  2518. 			for ($y=0; $y < 7; $y++) {

    2519. 

  2519. 				$frame = $this->qrstrset($frame, $ox, ($oy + $y), $finder[$y]);

    2520. 

  2520. 			}

    2521. 

  2521. 			return $frame;

    2522. 

  2522. 		}

    2523. 

  2523. 

    2524. 

  2524. 		/**

    2525. 

  2525. 		 * Return a copy of initialized frame.

    2526. 

  2526. 		 * @param int $version version

    2527. 

  2527. 		 * @return Array of unsigned char.

    2528. 

  2528. 		 */

    2529. 

  2529. 		protected function createFrame($version) {

    2530. 

  2530. 			$width = $this->capacity[$version][QRCAP_WIDTH];

    2531. 

  2531. 			$frameLine = str_repeat ("\0", $width);

    2532. 

  2532. 			$frame = array_fill(0, $width, $frameLine);

    2533. 

  2533. 			// Finder pattern

    2534. 

  2534. 			$frame = $this->putFinderPattern($frame, 0, 0);

    2535. 

  2535. 			$frame = $this->putFinderPattern($frame, $width - 7, 0);

    2536. 

  2536. 			$frame = $this->putFinderPattern($frame, 0, $width - 7);

    2537. 

  2537. 			// Separator

    2538. 

  2538. 			$yOffset = $width - 7;

    2539. 

  2539. 			for ($y=0; $y < 7; ++$y) {

    2540. 

  2540. 				$frame[$y][7] = "\xc0";

    2541. 

  2541. 				$frame[$y][$width - 8] = "\xc0";

    2542. 

  2542. 				$frame[$yOffset][7] = "\xc0";

    2543. 

  2543. 				++$yOffset;

    2544. 

  2544. 			}

    2545. 

  2545. 			$setPattern = str_repeat("\xc0", 8);

    2546. 

  2546. 			$frame = $this->qrstrset($frame, 0, 7, $setPattern);

    2547. 

  2547. 			$frame = $this->qrstrset($frame, $width-8, 7, $setPattern);

    2548. 

  2548. 			$frame = $this->qrstrset($frame, 0, $width - 8, $setPattern);

    2549. 

  2549. 			// Format info

    2550. 

  2550. 			$setPattern = str_repeat("\x84", 9);

    2551. 

  2551. 			$frame = $this->qrstrset($frame, 0, 8, $setPattern);

    2552. 

  2552. 			$frame = $this->qrstrset($frame, $width - 8, 8, $setPattern, 8);

    2553. 

  2553. 			$yOffset = $width - 8;

    2554. 

  2554. 			for ($y=0; $y < 8; ++$y,++$yOffset) {

    2555. 

  2555. 				$frame[$y][8] = "\x84";

    2556. 

  2556. 				$frame[$yOffset][8] = "\x84";

    2557. 

  2557. 			}

    2558. 

  2558. 			// Timing pattern

    2559. 

  2559. 			$wo = $width - 15;

    2560. 

  2560. 			for ($i=1; $i < $wo; ++$i) {

    2561. 

  2561. 				$frame[6][7+$i] = chr(0x90 | ($i & 1));

    2562. 

  2562. 				$frame[7+$i][6] = chr(0x90 | ($i & 1));

    2563. 

  2563. 			}

    2564. 

  2564. 			// Alignment pattern

    2565. 

  2565. 			$frame = $this->putAlignmentPattern($version, $frame, $width);

    2566. 

  2566. 			// Version information

    2567. 

  2567. 			if ($version >= 7) {

    2568. 

  2568. 				$vinf = $this->getVersionPattern($version);

    2569. 

  2569. 				$v = $vinf;

    2570. 

  2570. 				for ($x=0; $x<6; ++$x) {

    2571. 

  2571. 					for ($y=0; $y<3; ++$y) {

    2572. 

  2572. 						$frame[($width - 11)+$y][$x] = chr(0x88 | ($v & 1));

    2573. 

  2573. 						$v = $v >> 1;

    2574. 

  2574. 					}

    2575. 

  2575. 				}

    2576. 

  2576. 				$v = $vinf;

    2577. 

  2577. 				for ($y=0; $y<6; ++$y) {

    2578. 

  2578. 					for ($x=0; $x<3; ++$x) {

    2579. 

  2579. 						$frame[$y][$x+($width - 11)] = chr(0x88 | ($v & 1));

    2580. 

  2580. 						$v = $v >> 1;

    2581. 

  2581. 					}

    2582. 

  2582. 				}

    2583. 

  2583. 			}

    2584. 

  2584. 			// and a little bit...

    2585. 

  2585. 			$frame[$width - 8][8] = "\x81";

    2586. 

  2586. 			return $frame;

    2587. 

  2587. 		}

    2588. 

  2588. 

    2589. 

  2589. 		/**

    2590. 

  2590. 		 * Set new frame for the specified version.

    2591. 

  2591. 		 * @param int $version version

    2592. 

  2592. 		 * @return Array of unsigned char.

    2593. 

  2593. 		 */

    2594. 

  2594. 		protected function newFrame($version) {

    2595. 

  2595. 			if (($version < 1) OR ($version > QRSPEC_VERSION_MAX)) {

    2596. 

  2596. 				return NULL;

    2597. 

  2597. 			}

    2598. 

  2598. 			if (!isset($this->frames[$version])) {

    2599. 

  2599. 				$this->frames[$version] = $this->createFrame($version);

    2600. 

  2600. 			}

    2601. 

  2601. 			if (is_null($this->frames[$version])) {

    2602. 

  2602. 				return NULL;

    2603. 

  2603. 			}

    2604. 

  2604. 			return $this->frames[$version];

    2605. 

  2605. 		}

    2606. 

  2606. 

    2607. 

  2607. 		/**

    2608. 

  2608. 		 * Return block number 0

    2609. 

  2609. 		 * @param array $spec

    2610. 

  2610. 		 * @return int value

    2611. 

  2611. 		 */

    2612. 

  2612. 		 protected function rsBlockNum($spec) {

    2613. 

  2613. 			return ($spec[0] + $spec[3]);

    2614. 

  2614. 		}

    2615. 

  2615. 

    2616. 

  2616. 		/**

    2617. 

  2617. 		* Return block number 1

    2618. 

  2618. 		 * @param array $spec

    2619. 

  2619. 		 * @return int value

    2620. 

  2620. 		 */

    2621. 

  2621. 		 protected function rsBlockNum1($spec) {

    2622. 

  2622. 			return $spec[0];

    2623. 

  2623. 		}

    2624. 

  2624. 

    2625. 

  2625. 		/**

    2626. 

  2626. 		 * Return data codes 1

    2627. 

  2627. 		 * @param array $spec

    2628. 

  2628. 		 * @return int value

    2629. 

  2629. 		 */

    2630. 

  2630. 		 protected function rsDataCodes1($spec) {

    2631. 

  2631. 			return $spec[1];

    2632. 

  2632. 		}

    2633. 

  2633. 

    2634. 

  2634. 		/**

    2635. 

  2635. 		 * Return ecc codes 1

    2636. 

  2636. 		 * @param array $spec

    2637. 

  2637. 		 * @return int value

    2638. 

  2638. 		 */

    2639. 

  2639. 		 protected function rsEccCodes1($spec) {

    2640. 

  2640. 			return $spec[2];

    2641. 

  2641. 		}

    2642. 

  2642. 

    2643. 

  2643. 		/**

    2644. 

  2644. 		 * Return block number 2

    2645. 

  2645. 		 * @param array $spec

    2646. 

  2646. 		 * @return int value

    2647. 

  2647. 		 */

    2648. 

  2648. 		 protected function rsBlockNum2($spec) {

    2649. 

  2649. 			return $spec[3];

    2650. 

  2650. 		}

    2651. 

  2651. 

    2652. 

  2652. 		/**

    2653. 

  2653. 		 * Return data codes 2

    2654. 

  2654. 		 * @param array $spec

    2655. 

  2655. 		 * @return int value

    2656. 

  2656. 		 */

    2657. 

  2657. 		 protected function rsDataCodes2($spec) {

    2658. 

  2658. 			return $spec[4];

    2659. 

  2659. 		}

    2660. 

  2660. 

    2661. 

  2661. 		/**

    2662. 

  2662. 		 * Return ecc codes 2

    2663. 

  2663. 		 * @param array $spec

    2664. 

  2664. 		 * @return int value

    2665. 

  2665. 		 */

    2666. 

  2666. 		 protected function rsEccCodes2($spec) {

    2667. 

  2667. 			return $spec[2];

    2668. 

  2668. 		}

    2669. 

  2669. 

    2670. 

  2670. 		/**

    2671. 

  2671. 		 * Return data length

    2672. 

  2672. 		 * @param array $spec

    2673. 

  2673. 		 * @return int value

    2674. 

  2674. 		 */

    2675. 

  2675. 		 protected function rsDataLength($spec) {

    2676. 

  2676. 			return ($spec[0] * $spec[1]) + ($spec[3] * $spec[4]);

    2677. 

  2677. 		}

    2678. 

  2678. 

    2679. 

  2679. 		/**

    2680. 

  2680. 		 * Return ecc length

    2681. 

  2681. 		 * @param array $spec

    2682. 

  2682. 		 * @return int value

    2683. 

  2683. 		 */

    2684. 

  2684. 		 protected function rsEccLength($spec) {

    2685. 

  2685. 			return ($spec[0] + $spec[3]) * $spec[2];

    2686. 

  2686. 		}

    2687. 

  2687. 

    2688. 

  2688. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    2689. 

  2689. 

    2690. 

  2690. 		// QRrs

    2691. 

  2691. 

    2692. 

  2692. 		/**

    2693. 

  2693. 		 * Initialize a Reed-Solomon codec and add it to existing rsitems

    2694. 

  2694. 		 * @param int $symsize symbol size, bits

    2695. 

  2695. 		 * @param int $gfpoly  Field generator polynomial coefficients

    2696. 

  2696. 		 * @param int $fcr  first root of RS code generator polynomial, index form

    2697. 

  2697. 		 * @param int $prim  primitive element to generate polynomial roots

    2698. 

  2698. 		 * @param int $nroots RS code generator polynomial degree (number of roots)

    2699. 

  2699. 		 * @param int $pad  padding bytes at front of shortened block

    2700. 

  2700. 		 * @return array Array of RS values:<ul><li>mm = Bits per symbol;</li><li>nn = Symbols per block;</li><li>alpha_to = log lookup table array;</li><li>index_of = Antilog lookup table array;</li><li>genpoly = Generator polynomial array;</li><li>nroots = Number of generator;</li><li>roots = number of parity symbols;</li><li>fcr = First consecutive root, index form;</li><li>prim = Primitive element, index form;</li><li>iprim = prim-th root of 1, index form;</li><li>pad = Padding bytes in shortened block;</li><li>gfpoly</ul>.

    2701. 

  2701. 		 */

    2702. 

  2702. 		 protected function init_rs($symsize, $gfpoly, $fcr, $prim, $nroots, $pad) {

    2703. 

  2703. 			foreach ($this->rsitems as $rs) {

    2704. 

  2704. 				if (($rs['pad'] != $pad) OR ($rs['nroots'] != $nroots) OR ($rs['mm'] != $symsize)

    2705. 

  2705. 					OR ($rs['gfpoly'] != $gfpoly) OR ($rs['fcr'] != $fcr) OR ($rs['prim'] != $prim)) {

    2706. 

  2706. 					continue;

    2707. 

  2707. 				}

    2708. 

  2708. 				return $rs;

    2709. 

  2709. 			}

    2710. 

  2710. 			$rs = $this->init_rs_char($symsize, $gfpoly, $fcr, $prim, $nroots, $pad);

    2711. 

  2711. 			array_unshift($this->rsitems, $rs);

    2712. 

  2712. 			return $rs;

    2713. 

  2713. 		}

    2714. 

  2714. 

    2715. 

  2715. 		// - - - - - - - - - - - - - - - - - - - - - - - - -

    2716. 

  2716. 

    2717. 

  2717. 		// QRrsItem

    2718. 

  2718. 

    2719. 

  2719. 		/**

    2720. 

  2720. 		 * modnn

    2721. 

  2721. 		 * @param array RS values

    2722. 

  2722. 		 * @param int $x X position

    2723. 

  2723. 		 * @return int X osition

    2724. 

  2724. 		 */

    2725. 

  2725. 		 protected function modnn($rs, $x) {

    2726. 

  2726. 			while ($x >= $rs['nn']) {

    2727. 

  2727. 				$x -= $rs['nn'];

    2728. 

  2728. 				$x = ($x >> $rs['mm']) + ($x & $rs['nn']);

    2729. 

  2729. 			}

    2730. 

  2730. 			return $x;

    2731. 

  2731. 		}

    2732. 

  2732. 

    2733. 

  2733. 		/**

    2734. 

  2734. 		 * Initialize a Reed-Solomon codec and returns an array of values.

    2735. 

  2735. 		 * @param int $symsize symbol size, bits

    2736. 

  2736. 		 * @param int $gfpoly  Field generator polynomial coefficients

    2737. 

  2737. 		 * @param int $fcr  first root of RS code generator polynomial, index form

    2738. 

  2738. 		 * @param int $prim  primitive element to generate polynomial roots

    2739. 

  2739. 		 * @param int $nroots RS code generator polynomial degree (number of roots)

    2740. 

  2740. 		 * @param int $pad  padding bytes at front of shortened block

    2741. 

  2741. 		 * @return array Array of RS values:<ul><li>mm = Bits per symbol;</li><li>nn = Symbols per block;</li><li>alpha_to = log lookup table array;</li><li>index_of = Antilog lookup table array;</li><li>genpoly = Generator polynomial array;</li><li>nroots = Number of generator;</li><li>roots = number of parity symbols;</li><li>fcr = First consecutive root, index form;</li><li>prim = Primitive element, index form;</li><li>iprim = prim-th root of 1, index form;</li><li>pad = Padding bytes in shortened block;</li><li>gfpoly</ul>.

    2742. 

  2742. 		 */

    2743. 

  2743. 		protected function init_rs_char($symsize, $gfpoly, $fcr, $prim, $nroots, $pad) {

    2744. 

  2744. 			// Based on Reed solomon encoder by Phil Karn, KA9Q (GNU-LGPLv2)

    2745. 

  2745. 			$rs = null;

    2746. 

  2746. 			// Check parameter ranges

    2747. 

  2747. 			if (($symsize < 0) OR ($symsize > 8)) {

    2748. 

  2748. 				return $rs;

    2749. 

  2749. 			}

    2750. 

  2750. 			if (($fcr < 0) OR ($fcr >= (1<<$symsize))) {

    2751. 

  2751. 				return $rs;

    2752. 

  2752. 			}

    2753. 

  2753. 			if (($prim <= 0) OR ($prim >= (1<<$symsize))) {

    2754. 

  2754. 				return $rs;

    2755. 

  2755. 			}

    2756. 

  2756. 			if (($nroots < 0) OR ($nroots >= (1<<$symsize))) {

    2757. 

  2757. 				return $rs;

    2758. 

  2758. 			}

    2759. 

  2759. 			if (($pad < 0) OR ($pad >= ((1<<$symsize) -1 - $nroots))) {

    2760. 

  2760. 				return $rs;

    2761. 

  2761. 			}

    2762. 

  2762. 			$rs = array();

    2763. 

  2763. 			$rs['mm'] = $symsize;

    2764. 

  2764. 			$rs['nn'] = (1 << $symsize) - 1;

    2765. 

  2765. 			$rs['pad'] = $pad;

    2766. 

  2766. 			$rs['alpha_to'] = array_fill(0, ($rs['nn'] + 1), 0);

    2767. 

  2767. 			$rs['index_of'] = array_fill(0, ($rs['nn'] + 1), 0);

    2768. 

  2768. 			// PHP style macro replacement ;)

    2769. 

  2769. 			$NN =& $rs['nn'];

    2770. 

  2770. 			$A0 =& $NN;

    2771. 

  2771. 			// Generate Galois field lookup tables

    2772. 

  2772. 			$rs['index_of'][0] = $A0; // log(zero) = -inf

    2773. 

  2773. 			$rs['alpha_to'][$A0] = 0; // alpha**-inf = 0

    2774. 

  2774. 			$sr = 1;

    2775. 

  2775. 			for ($i=0; $i<$rs['nn']; ++$i) {

    2776. 

  2776. 				$rs['index_of'][$sr] = $i;

    2777. 

  2777. 				$rs['alpha_to'][$i] = $sr;

    2778. 

  2778. 				$sr <<= 1;

    2779. 

  2779. 				if ($sr & (1 << $symsize)) {

    2780. 

  2780. 					$sr ^= $gfpoly;

    2781. 

  2781. 				}

    2782. 

  2782. 				$sr &= $rs['nn'];

    2783. 

  2783. 			}

    2784. 

  2784. 			if ($sr != 1) {

    2785. 

  2785. 				// field generator polynomial is not primitive!

    2786. 

  2786. 				return NULL;

    2787. 

  2787. 			}

    2788. 

  2788. 			// Form RS code generator polynomial from its roots

    2789. 

  2789. 			$rs['genpoly'] = array_fill(0, ($nroots + 1), 0);

    2790. 

  2790. 			$rs['fcr'] = $fcr;

    2791. 

  2791. 			$rs['prim'] = $prim;

    2792. 

  2792. 			$rs['nroots'] = $nroots;

    2793. 

  2793. 			$rs['gfpoly'] = $gfpoly;

    2794. 

  2794. 			// Find prim-th root of 1, used in decoding

    2795. 

  2795. 			for ($iprim=1; ($iprim % $prim) != 0; $iprim += $rs['nn']) {

    2796. 

  2796. 				; // intentional empty-body loop!

    2797. 

  2797. 			}

    2798. 

  2798. 			$rs['iprim'] = (int)($iprim / $prim);

    2799. 

  2799. 			$rs['genpoly'][0] = 1;

    2800. 

  2800. 			for ($i = 0,$root=$fcr*$prim; $i < $nroots; $i++, $root += $prim) {

    2801. 

  2801. 				$rs['genpoly'][$i+1] = 1;

    2802. 

  2802. 				// Multiply rs->genpoly[] by  @**(root + x)

    2803. 

  2803. 				for ($j = $i; $j > 0; --$j) {

    2804. 

  2804. 					if ($rs['genpoly'][$j] != 0) {

    2805. 

  2805. 						$rs['genpoly'][$j] = $rs['genpoly'][$j-1] ^ $rs['alpha_to'][$this->modnn($rs, $rs['index_of'][$rs['genpoly'][$j]] + $root)];

    2806. 

  2806. 					} else {

    2807. 

  2807. 						$rs['genpoly'][$j] = $rs['genpoly'][$j-1];

    2808. 

  2808. 					}

    2809. 

  2809. 				}

    2810. 

  2810. 				// rs->genpoly[0] can never be zero

    2811. 

  2811. 				$rs['genpoly'][0] = $rs['alpha_to'][$this->modnn($rs, $rs['index_of'][$rs['genpoly'][0]] + $root)];

    2812. 

  2812. 			}

    2813. 

  2813. 			// convert rs->genpoly[] to index form for quicker encoding

    2814. 

  2814. 			for ($i = 0; $i <= $nroots; ++$i) {

    2815. 

  2815. 				$rs['genpoly'][$i] = $rs['index_of'][$rs['genpoly'][$i]];

    2816. 

  2816. 			}

    2817. 

  2817. 			return $rs;

    2818. 

  2818. 		}

    2819. 

  2819. 

    2820. 

  2820. 		/**

    2821. 

  2821. 		 * Encode a Reed-Solomon codec and returns the parity array

    2822. 

  2822. 		 * @param array $rs RS values

    2823. 

  2823. 		 * @param array $data data

    2824. 

  2824. 		 * @param array $parity parity

    2825. 

  2825. 		 * @return parity array

    2826. 

  2826. 		 */

    2827. 

  2827. 		 protected function encode_rs_char($rs, $data, $parity) {

    2828. 

  2828. 			$MM       =& $rs['mm']; // bits per symbol

    2829. 

  2829. 			$NN       =& $rs['nn']; // the total number of symbols in a RS block

    2830. 

  2830. 			$ALPHA_TO =& $rs['alpha_to']; // the address of an array of NN elements to convert Galois field elements in index (log) form to polynomial form

    2831. 

  2831. 			$INDEX_OF =& $rs['index_of']; // the address of an array of NN elements to convert Galois field elements in polynomial form to index (log) form

    2832. 

  2832. 			$GENPOLY  =& $rs['genpoly']; // an array of NROOTS+1 elements containing the generator polynomial in index form

    2833. 

  2833. 			$NROOTS   =& $rs['nroots']; // the number of roots in the RS code generator polynomial, which is the same as the number of parity symbols in a block

    2834. 

  2834. 			$FCR      =& $rs['fcr']; // first consecutive root, index form

    2835. 

  2835. 			$PRIM     =& $rs['prim']; // primitive element, index form

    2836. 

  2836. 			$IPRIM    =& $rs['iprim']; // prim-th root of 1, index form

    2837. 

  2837. 			$PAD      =& $rs['pad']; // the number of pad symbols in a block

    2838. 

  2838. 			$A0       =& $NN;

    2839. 

  2839. 			$parity = array_fill(0, $NROOTS, 0);

    2840. 

  2840. 			for ($i=0; $i < ($NN - $NROOTS - $PAD); $i++) {

    2841. 

  2841. 				$feedback = $INDEX_OF[$data[$i] ^ $parity[0]];

    2842. 

  2842. 				if ($feedback != $A0) {

    2843. 

  2843. 					// feedback term is non-zero

    2844. 

  2844. 					// This line is unnecessary when GENPOLY[NROOTS] is unity, as it must

    2845. 

  2845. 					// always be for the polynomials constructed by init_rs()

    2846. 

  2846. 					$feedback = $this->modnn($rs, $NN - $GENPOLY[$NROOTS] + $feedback);

    2847. 

  2847. 					for ($j=1; $j < $NROOTS; ++$j) {

    2848. 

  2848. 					$parity[$j] ^= $ALPHA_TO[$this->modnn($rs, $feedback + $GENPOLY[($NROOTS - $j)])];

    2849. 

  2849. 					}

    2850. 

  2850. 				}

    2851. 

  2851. 				// Shift

    2852. 

  2852. 				array_shift($parity);

    2853. 

  2853. 				if ($feedback != $A0) {

    2854. 

  2854. 					array_push($parity, $ALPHA_TO[$this->modnn($rs, $feedback + $GENPOLY[0])]);

    2855. 

  2855. 				} else {

    2856. 

  2856. 					array_push($parity, 0);

    2857. 

  2857. 				}

    2858. 

  2858. 			}

    2859. 

  2859. 			return $parity;

    2860. 

  2860. 		}

    2861. 

  2861. 

    2862. 

  2862. 	} // end QRcode class

    2863. 

  2863. 

    2864. 

  2864. } // END OF "class_exists QRcode"

    2865. 

  2865. ?>

    2866. 

  2866.