Skip to content

ncphp / mcClasses

Go to a project
Commit b5539ee8 by Frederick
Options

phpqrcode_php4

1 parent a31b8f27
Inline Side-by-side
Showing with 7376 additions and 0 deletions
lib/phpqrcode_php4/CHANGELOG 0 → 100644
* 1.0.0 build 2010031920
- first public release
- help in readme, install
- cleanup ans separation of QRtools and QRspec
- now TCPDF binding requires minimal changes in TCPDF, having most of job
done in QRtools tcpdfBarcodeArray
- nicer QRtools::timeBenchmark output
- license and copyright notices in files
- indent cleanup - from tab to 4spc, keep it that way please :)
- sf project, repository, wiki
- simple code generator in index.php
* 1.1.0 build 2010032113
- added merge tool wich generate merged version of code
located in phpqrcode.php
- splited qrconst.php from qrlib.php
* 1.1.1 build 2010032405
- patch by Rick Seymour allowing saving PNG and displaying it at the same time
- added version info in VERSION file
- modified merge tool to include version info into generated file
- fixed e-mail in almost all head comments
* 1.1.2 build 2010032722
- full integration with TCPDF thanks to Nicola Asuni, it's author
- fixed bug with alphanumeric encoding detection
* 1.1.3 build 2010081807
- short opening tags replaced with standard ones
* 1.1.4 build 2010100721
- added missing static keyword QRinput::check (found by Luke Brookhart, Onjax LLC)
lib/phpqrcode_php4/INSTALL 0 → 100644
== REQUIREMENTS ==
* PHP5
* PHP GD2 extension with JPEG and PNG support
== INSTALLATION ==
If you want to recreate cache by yourself make sure cache directory is
writable and you have permisions to write into it. Also make sure you are
able to read files in it if you have cache option enabled
== CONFIGURATION ==
Feel free to modify config constants in qrconfig.php file. Read about it in
provided comments and project wiki page (links in README file)
== QUICK START ==
Notice: probably you should'nt use all of this in same script :)
<?phpb
//include only that one, rest required files will be included from it
include "qrlib.php"
//write code into file, Error corection lecer is lowest, L (one form: L,M,Q,H)
//each code square will be 4x4 pixels (4x zoom)
//code will have 2 code squares white boundary around
QRcode::png('PHP QR Code :)', 'test.png', 'L', 4, 2);
//same as above but outputs file directly into browser (with appr. header etc.)
//all other settings are default
//WARNING! it should be FIRST and ONLY output generated by script, otherwise
//rest of output will land inside PNG binary, breaking it for sure
QRcode::png('PHP QR Code :)');
//show benchmark
QRtools::timeBenchmark();
//rebuild cache
QRtools::buildCache();
//code generated in text mode - as a binary table
//then displayed out as HTML using Unicode block building chars :)
$tab = $qr->encode('PHP QR Code :)');
QRspec::debug($tab, true);
== TCPDF INTEGRATION ==
Inside bindings/tcpdf you will find slightly modified 2dbarcodes.php.
Instal phpqrcode liblaty inside tcpdf folder, then overwrite (or merge)
2dbarcodes.php
Then use similar as example #50 from TCPDF examples:
<?php
$style = array(
'border' => true,
'padding' => 4,
'fgcolor' => array(0,0,0),
'bgcolor' => false, //array(255,255,255)
);
//code name: QR, specify error correction level after semicolon (L,M,Q,H)
$pdf->write2DBarcode('PHP QR Code :)', 'QR,L', '', '', 30, 30, $style, 'N');
lib/phpqrcode_php4/LICENSE 0 → 100644
GNU LESSER GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
This version of the GNU Lesser General Public License incorporates
the terms and conditions of version 3 of the GNU General Public
License, supplemented by the additional permissions listed below.
0. Additional Definitions.
As used herein, "this License" refers to version 3 of the GNU Lesser
General Public License, and the "GNU GPL" refers to version 3 of the GNU
General Public License.
"The Library" refers to a covered work governed by this License,
other than an Application or a Combined Work as defined below.
An "Application" is any work that makes use of an interface provided
by the Library, but which is not otherwise based on the Library.
Defining a subclass of a class defined by the Library is deemed a mode
of using an interface provided by the Library.
A "Combined Work" is a work produced by combining or linking an
Application with the Library. The particular version of the Library
with which the Combined Work was made is also called the "Linked
Version".
The "Minimal Corresponding Source" for a Combined Work means the
Corresponding Source for the Combined Work, excluding any source code
for portions of the Combined Work that, considered in isolation, are
based on the Application, and not on the Linked Version.
The "Corresponding Application Code" for a Combined Work means the
object code and/or source code for the Application, including any data
and utility programs needed for reproducing the Combined Work from the
Application, but excluding the System Libraries of the Combined Work.
1. Exception to Section 3 of the GNU GPL.
You may convey a covered work under sections 3 and 4 of this License
without being bound by section 3 of the GNU GPL.
2. Conveying Modified Versions.
If you modify a copy of the Library, and, in your modifications, a
facility refers to a function or data to be supplied by an Application
that uses the facility (other than as an argument passed when the
facility is invoked), then you may convey a copy of the modified
version:
a) under this License, provided that you make a good faith effort to
ensure that, in the event an Application does not supply the
function or data, the facility still operates, and performs
whatever part of its purpose remains meaningful, or
b) under the GNU GPL, with none of the additional permissions of
this License applicable to that copy.
3. Object Code Incorporating Material from Library Header Files.
The object code form of an Application may incorporate material from
a header file that is part of the Library. You may convey such object
code under terms of your choice, provided that, if the incorporated
material is not limited to numerical parameters, data structure
layouts and accessors, or small macros, inline functions and templates
(ten or fewer lines in length), you do both of the following:
a) Give prominent notice with each copy of the object code that the
Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the object code with a copy of the GNU GPL and this license
document.
4. Combined Works.
You may convey a Combined Work under terms of your choice that,
taken together, effectively do not restrict modification of the
portions of the Library contained in the Combined Work and reverse
engineering for debugging such modifications, if you also do each of
the following:
a) Give prominent notice with each copy of the Combined Work that
the Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the Combined Work with a copy of the GNU GPL and this license
document.
c) For a Combined Work that displays copyright notices during
execution, include the copyright notice for the Library among
these notices, as well as a reference directing the user to the
copies of the GNU GPL and this license document.
d) Do one of the following:
0) Convey the Minimal Corresponding Source under the terms of this
License, and the Corresponding Application Code in a form
suitable for, and under terms that permit, the user to
recombine or relink the Application with a modified version of
the Linked Version to produce a modified Combined Work, in the
manner specified by section 6 of the GNU GPL for conveying
Corresponding Source.
1) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (a) uses at run time
a copy of the Library already present on the user's computer
system, and (b) will operate properly with a modified version
of the Library that is interface-compatible with the Linked
Version.
e) Provide Installation Information, but only if you would otherwise
be required to provide such information under section 6 of the
GNU GPL, and only to the extent that such information is
necessary to install and execute a modified version of the
Combined Work produced by recombining or relinking the
Application with a modified version of the Linked Version. (If
you use option 4d0, the Installation Information must accompany
the Minimal Corresponding Source and Corresponding Application
Code. If you use option 4d1, you must provide the Installation
Information in the manner specified by section 6 of the GNU GPL
for conveying Corresponding Source.)
5. Combined Libraries.
You may place library facilities that are a work based on the
Library side by side in a single library together with other library
facilities that are not Applications and are not covered by this
License, and convey such a combined library under terms of your
choice, if you do both of the following:
a) Accompany the combined library with a copy of the same work based
on the Library, uncombined with any other library facilities,
conveyed under the terms of this License.
b) Give prominent notice with the combined library that part of it
is a work based on the Library, and explaining where to find the
accompanying uncombined form of the same work.
6. Revised Versions of the GNU Lesser General Public License.
The Free Software Foundation may publish revised and/or new versions
of the GNU Lesser General Public License from time to time. Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the
Library as you received it specifies that a certain numbered version
of the GNU Lesser General Public License "or any later version"
applies to it, you have the option of following the terms and
conditions either of that published version or of any later version
published by the Free Software Foundation. If the Library as you
received it does not specify a version number of the GNU Lesser
General Public License, you may choose any version of the GNU Lesser
General Public License ever published by the Free Software Foundation.
If the Library as you received it specifies that a proxy can decide
whether future versions of the GNU Lesser General Public License shall
apply, that proxy's public statement of acceptance of any version is
permanent authorization for you to choose that version for the
Library.
lib/phpqrcode_php4/README 0 → 100644
This is PHP implementation of QR Code 2-D barcode generator. It is pure-php
LGPL-licensed implementation based on C libqrencode by Kentaro Fukuchi.
== LICENSING ==
Copyright (C) 2010 by Dominik Dzienia
This library is free software; you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License as published by the Free
Software Foundation; either version 3 of the License, or any later version.
This library is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
PARTICULAR PURPOSE. See the GNU Lesser General Public License (LICENSE file)
for more details.
You should have received a copy of the GNU Lesser General Public License along
with this library; if not, write to the Free Software Foundation, Inc., 51
Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
== INSTALATION AND USAGE ==
* INSTALL file
* http://sourceforge.net/apps/mediawiki/phpqrcode/index.php?title=Main_Page
== CONTACT ==
Fell free to contact me via e-mail (deltalab at poczta dot fm) or using
folowing project pages:
* http://sourceforge.net/projects/phpqrcode/
* http://phpqrcode.sourceforge.net/
== ACKNOWLEDGMENTS ==
Based on C libqrencode library (ver. 3.1.1)
Copyright (C) 2006-2010 by Kentaro Fukuchi
http://megaui.net/fukuchi/works/qrencode/index.en.html
QR Code is registered trademarks of DENSO WAVE INCORPORATED in JAPAN and other
countries.
Reed-Solomon code encoder is written by Phil Karn, KA9Q.
Copyright (C) 2002, 2003, 2004, 2006 Phil Karn, KA9Q
\ No newline at end of file
lib/phpqrcode_php4/VERSION 0 → 100644
1.1.4
2010100721
\ No newline at end of file
lib/phpqrcode_php4/bindings/tcpdf/qrcode.php 0 → 100644
<?php
//============================================================+
// File name : qrcode.php
// Begin : 2010-03-22
// Last Update : 2010-03-29
// Version : 1.0.002
// License : GNU LGPL v.3 (http://www.gnu.org/copyleft/lesser.html)
// ----------------------------------------------------------------------------
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 3 of the License, or any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
// or browse http://www.gnu.org/copyleft/lesser.html
//
// ----------------------------------------------------------------------------
//
// DESCRIPTION :
//
// Class to create QR-code arrays for TCPDF class.
// QR Code symbol is a 2D barcode that can be scanned by
// handy terminals such as a mobile phone with CCD.
// The capacity of QR Code is up to 7000 digits or 4000
// characters, and has high robustness.
// This class supports QR Code model 2, described in
// JIS (Japanese Industrial Standards) X0510:2004
// or ISO/IEC 18004.
// Currently the following features are not supported:
// ECI and FNC1 mode, Micro QR Code, QR Code model 1,
// Structured mode.
//
// This class is derived from the following projects:
// ---------------------------------------------------------
// "PHP QR Code encoder"
// License: GNU-LGPLv3
// Copyright (C) 2010 by Dominik Dzienia <deltalab at poczta dot fm>
// http://phpqrcode.sourceforge.net/
// https://sourceforge.net/projects/phpqrcode/
//
// The "PHP QR Code encoder" is based on
// "C libqrencode library" (ver. 3.1.1)
// License: GNU-LGPL 2.1
// Copyright (C) 2006-2010 by Kentaro Fukuchi
// http://megaui.net/fukuchi/works/qrencode/index.en.html
//
// Reed-Solomon code encoder is written by Phil Karn, KA9Q.
// Copyright (C) 2002-2006 Phil Karn, KA9Q
//
// QR Code is registered trademark of DENSO WAVE INCORPORATED
// http://www.denso-wave.com/qrcode/index-e.html
// ---------------------------------------------------------
//
// Author: Nicola Asuni
//
// (c) Copyright 2010:
// Nicola Asuni
// Tecnick.com S.r.l.
// Via della Pace, 11
// 09044 Quartucciu (CA)
// ITALY
// www.tecnick.com
// info@tecnick.com
//============================================================+
/**
* Class to create QR-code arrays for TCPDF class.
* QR Code symbol is a 2D barcode that can be scanned by handy terminals such as a mobile phone with CCD.
* The capacity of QR Code is up to 7000 digits or 4000 characters, and has high robustness.
* This class supports QR Code model 2, described in JIS (Japanese Industrial Standards) X0510:2004 or ISO/IEC 18004.
* Currently the following features are not supported: ECI and FNC1 mode, Micro QR Code, QR Code model 1, Structured mode.
*
* 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).
* Please read comments on this class source file for full copyright and license information.
*
* @package com.tecnick.tcpdf
* @abstract Class for generating QR-code array for TCPDF.
* @author Nicola Asuni
* @copyright 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
* @link http://www.tcpdf.org
* @license http://www.gnu.org/copyleft/lesser.html LGPL
* @version 1.0.002
*/
// definitions
if (!defined('QRCODEDEFS')) {
/**
* Indicate that definitions for this class are set
*/
define('QRCODEDEFS', true);
// -----------------------------------------------------
// Encoding modes (characters which can be encoded in QRcode)
/**
* Encoding mode
*/
define('QR_MODE_NL', -1);
/**
* Encoding mode numeric (0-9). 3 characters are encoded to 10bit length. In theory, 7089 characters or less can be stored in a QRcode.
*/
define('QR_MODE_NM', 0);
/**
* 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.
*/
define('QR_MODE_AN', 1);
/**
* Encoding mode 8bit byte data. In theory, 2953 characters or less can be stored in a QRcode.
*/
define('QR_MODE_8B', 2);
/**
* 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.
*/
define('QR_MODE_KJ', 3);
/**
* Encoding mode STRUCTURED (currently unsupported)
*/
define('QR_MODE_ST', 4);
// -----------------------------------------------------
// Levels of error correction.
// QRcode has a function of an error correcting for miss reading that white is black.
// Error correcting is defined in 4 level as below.
/**
* Error correction level L : About 7% or less errors can be corrected.
*/
define('QR_ECLEVEL_L', 0);
/**
* Error correction level M : About 15% or less errors can be corrected.
*/
define('QR_ECLEVEL_M', 1);
/**
* Error correction level Q : About 25% or less errors can be corrected.
*/
define('QR_ECLEVEL_Q', 2);
/**
* Error correction level H : About 30% or less errors can be corrected.
*/
define('QR_ECLEVEL_H', 3);
// -----------------------------------------------------
// 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.
/**
* Maximum QR Code version.
*/
define('QRSPEC_VERSION_MAX', 40);
/**
* Maximum matrix size for maximum version (version 40 is 177*177 matrix).
*/
define('QRSPEC_WIDTH_MAX', 177);
// -----------------------------------------------------
/**
* Matrix index to get width from $capacity array.
*/
define('QRCAP_WIDTH', 0);
/**
* Matrix index to get number of words from $capacity array.
*/
define('QRCAP_WORDS', 1);
/**
* Matrix index to get remainder from $capacity array.
*/
define('QRCAP_REMINDER', 2);
/**
* Matrix index to get error correction level from $capacity array.
*/
define('QRCAP_EC', 3);
// -----------------------------------------------------
// Structure (currently usupported)
/**
* Number of header bits for structured mode
*/
define('STRUCTURE_HEADER_BITS', 20);
/**
* Max number of symbols for structured mode
*/
define('MAX_STRUCTURED_SYMBOLS', 16);
// -----------------------------------------------------
// Masks
/**
* Down point base value for case 1 mask pattern (concatenation of same color in a line or a column)
*/
define('N1', 3);
/**
* Down point base value for case 2 mask pattern (module block of same color)
*/
define('N2', 3);
/**
* 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)
*/
define('N3', 40);
/**
* Down point base value for case 4 mask pattern (ration of dark modules in whole)
*/
define('N4', 10);
// -----------------------------------------------------
// Optimization settings
/**
* if true, estimates best mask (spec. default, but extremally slow; set to false to significant performance boost but (propably) worst quality code
*/
define('QR_FIND_BEST_MASK', true);
/**
* if false, checks all masks available, otherwise value tells count of masks need to be checked, mask id are got randomly
*/
define('QR_FIND_FROM_RANDOM', 2);
/**
* when QR_FIND_BEST_MASK === false
*/
define('QR_DEFAULT_MASK', 2);
// -----------------------------------------------------
} // end of definitions
// #*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#
if (!class_exists('QRcode', false)) {
// for compaibility with PHP4
if (!function_exists('str_split')) {
/**
* Convert a string to an array (needed for PHP4 compatibility)
* @param string $string The input string.
* @param int $split_length Maximum length of the chunk.
* @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.
*/
function str_split($string, $split_length=1) {
if ((strlen($string) > $split_length) OR (!$split_length)) {
do {
$c = strlen($string);
$parts[] = substr($string, 0, $split_length);
$string = substr($string, $split_length);
} while ($string !== false);
} else {
$parts = array($string);
}
return $parts;
}
}
// #####################################################
/**
* Class to create QR-code arrays for TCPDF class.
* QR Code symbol is a 2D barcode that can be scanned by handy terminals such as a mobile phone with CCD.
* The capacity of QR Code is up to 7000 digits or 4000 characters, and has high robustness.
* This class supports QR Code model 2, described in JIS (Japanese Industrial Standards) X0510:2004 or ISO/IEC 18004.
* Currently the following features are not supported: ECI and FNC1 mode, Micro QR Code, QR Code model 1, Structured mode.
*
* 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).
* Please read comments on this class source file for full copyright and license information.
*
* @name QRcode
* @package com.tecnick.tcpdf
* @abstract Class for generating QR-code array for TCPDF.
* @author Nicola Asuni
* @copyright 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
* @link http://www.tcpdf.org
* @license http://www.gnu.org/copyleft/lesser.html LGPL
* @version 1.0.002
*/
class QRcode {
/**
* @var barcode array to be returned which is readable by TCPDF
* @access protected
*/
protected $barcode_array = array();
/**
* @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.
* @access protected
*/
protected $version = 0;
/**
* @var Levels of error correction. See definitions for possible values.
* @access protected
*/
protected $level = QR_ECLEVEL_L;
/**
* @var Encoding mode
* @access protected
*/
protected $hint = QR_MODE_8B;
/**
* @var if true the input string will be converted to uppercase
* @access protected
*/
protected $casesensitive = true;
/**
* @var structured QR code (not supported yet)
* @access protected
*/
protected $structured = 0;
/**
* @var mask data
* @access protected
*/
protected $data;
// FrameFiller
/**
* @var width
* @access protected
*/
protected $width;
/**
* @var frame
* @access protected
*/
protected $frame;
/**
* @var X position of bit
* @access protected
*/
protected $x;
/**
* @var Y position of bit
* @access protected
*/
protected $y;
/**
* @var direction
* @access protected
*/
protected $dir;
/**
* @var single bit
* @access protected
*/
protected $bit;
// ---- QRrawcode ----
/**
* @var data code
* @access protected
*/
protected $datacode = array();
/**
* @var error correction code
* @access protected
*/
protected $ecccode = array();
/**
* @var blocks
* @access protected
*/
protected $blocks;
/**
* @var Reed-Solomon blocks
* @access protected
*/
protected $rsblocks = array(); //of RSblock
/**
* @var counter
* @access protected
*/
protected $count;
/**
* @var data length
* @access protected
*/
protected $dataLength;
/**
* @var error correction length
* @access protected
*/
protected $eccLength;
/**
* @var b1
* @access protected
*/
protected $b1;
// ---- QRmask ----
/**
* @var run length
* @access protected
*/
protected $runLength = array();
// ---- QRsplit ----
/**
* @var input data string
* @access protected
*/
protected $dataStr = '';
/**
* @var input items
* @access protected
*/
protected $items;
// Reed-Solomon items
/**
* @var Reed-Solomon items
* @access protected
*/
protected $rsitems = array();
/**
* @var array of frames
* @access protected
*/
protected $frames = array();
/**
* @var alphabet-numeric convesion table
* @access protected
*/
protected $anTable = array(
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, //
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, //
36, -1, -1, -1, 37, 38, -1, -1, -1, -1, 39, 40, -1, 41, 42, 43, //
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 44, -1, -1, -1, -1, -1, //
-1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, //
25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, -1, //
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, //
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 //
);
/**
* @var array Table of the capacity of symbols
* See Table 1 (pp.13) and Table 12-16 (pp.30-36), JIS X0510:2004.
* @access protected
*/
protected $capacity = array(
array( 0, 0, 0, array( 0, 0, 0, 0)), //
array( 21, 26, 0, array( 7, 10, 13, 17)), // 1
array( 25, 44, 7, array( 10, 16, 22, 28)), //
array( 29, 70, 7, array( 15, 26, 36, 44)), //
array( 33, 100, 7, array( 20, 36, 52, 64)), //
array( 37, 134, 7, array( 26, 48, 72, 88)), // 5
array( 41, 172, 7, array( 36, 64, 96, 112)), //
array( 45, 196, 0, array( 40, 72, 108, 130)), //
array( 49, 242, 0, array( 48, 88, 132, 156)), //
array( 53, 292, 0, array( 60, 110, 160, 192)), //
array( 57, 346, 0, array( 72, 130, 192, 224)), // 10
array( 61, 404, 0, array( 80, 150, 224, 264)), //
array( 65, 466, 0, array( 96, 176, 260, 308)), //
array( 69, 532, 0, array( 104, 198, 288, 352)), //
array( 73, 581, 3, array( 120, 216, 320, 384)), //
array( 77, 655, 3, array( 132, 240, 360, 432)), // 15
array( 81, 733, 3, array( 144, 280, 408, 480)), //
array( 85, 815, 3, array( 168, 308, 448, 532)), //
array( 89, 901, 3, array( 180, 338, 504, 588)), //
array( 93, 991, 3, array( 196, 364, 546, 650)), //
array( 97, 1085, 3, array( 224, 416, 600, 700)), // 20
array(101, 1156, 4, array( 224, 442, 644, 750)), //
array(105, 1258, 4, array( 252, 476, 690, 816)), //
array(109, 1364, 4, array( 270, 504, 750, 900)), //
array(113, 1474, 4, array( 300, 560, 810, 960)), //
array(117, 1588, 4, array( 312, 588, 870, 1050)), // 25
array(121, 1706, 4, array( 336, 644, 952, 1110)), //
array(125, 1828, 4, array( 360, 700, 1020, 1200)), //
array(129, 1921, 3, array( 390, 728, 1050, 1260)), //
array(133, 2051, 3, array( 420, 784, 1140, 1350)), //
array(137, 2185, 3, array( 450, 812, 1200, 1440)), // 30
array(141, 2323, 3, array( 480, 868, 1290, 1530)), //
array(145, 2465, 3, array( 510, 924, 1350, 1620)), //
array(149, 2611, 3, array( 540, 980, 1440, 1710)), //
array(153, 2761, 3, array( 570, 1036, 1530, 1800)), //
array(157, 2876, 0, array( 570, 1064, 1590, 1890)), // 35
array(161, 3034, 0, array( 600, 1120, 1680, 1980)), //
array(165, 3196, 0, array( 630, 1204, 1770, 2100)), //
array(169, 3362, 0, array( 660, 1260, 1860, 2220)), //
array(173, 3532, 0, array( 720, 1316, 1950, 2310)), //
array(177, 3706, 0, array( 750, 1372, 2040, 2430)) // 40
);
/**
* @var array Length indicator
* @access protected
*/
protected $lengthTableBits = array(
array(10, 12, 14),
array( 9, 11, 13),
array( 8, 16, 16),
array( 8, 10, 12)
);
/**
* @var array Table of the error correction code (Reed-Solomon block)
* See Table 12-16 (pp.30-36), JIS X0510:2004.
* @access protected
*/
protected $eccTable = array(
array(array( 0, 0), array( 0, 0), array( 0, 0), array( 0, 0)), //
array(array( 1, 0), array( 1, 0), array( 1, 0), array( 1, 0)), // 1
array(array( 1, 0), array( 1, 0), array( 1, 0), array( 1, 0)), //
array(array( 1, 0), array( 1, 0), array( 2, 0), array( 2, 0)), //
array(array( 1, 0), array( 2, 0), array( 2, 0), array( 4, 0)), //
array(array( 1, 0), array( 2, 0), array( 2, 2), array( 2, 2)), // 5
array(array( 2, 0), array( 4, 0), array( 4, 0), array( 4, 0)), //
array(array( 2, 0), array( 4, 0), array( 2, 4), array( 4, 1)), //
array(array( 2, 0), array( 2, 2), array( 4, 2), array( 4, 2)), //
array(array( 2, 0), array( 3, 2), array( 4, 4), array( 4, 4)), //
array(array( 2, 2), array( 4, 1), array( 6, 2), array( 6, 2)), // 10
array(array( 4, 0), array( 1, 4), array( 4, 4), array( 3, 8)), //
array(array( 2, 2), array( 6, 2), array( 4, 6), array( 7, 4)), //
array(array( 4, 0), array( 8, 1), array( 8, 4), array(12, 4)), //
array(array( 3, 1), array( 4, 5), array(11, 5), array(11, 5)), //
array(array( 5, 1), array( 5, 5), array( 5, 7), array(11, 7)), // 15
array(array( 5, 1), array( 7, 3), array(15, 2), array( 3, 13)), //
array(array( 1, 5), array(10, 1), array( 1, 15), array( 2, 17)), //
array(array( 5, 1), array( 9, 4), array(17, 1), array( 2, 19)), //
array(array( 3, 4), array( 3, 11), array(17, 4), array( 9, 16)), //
array(array( 3, 5), array( 3, 13), array(15, 5), array(15, 10)), // 20
array(array( 4, 4), array(17, 0), array(17, 6), array(19, 6)), //
array(array( 2, 7), array(17, 0), array( 7, 16), array(34, 0)), //
array(array( 4, 5), array( 4, 14), array(11, 14), array(16, 14)), //
array(array( 6, 4), array( 6, 14), array(11, 16), array(30, 2)), //
array(array( 8, 4), array( 8, 13), array( 7, 22), array(22, 13)), // 25
array(array(10, 2), array(19, 4), array(28, 6), array(33, 4)), //
array(array( 8, 4), array(22, 3), array( 8, 26), array(12, 28)), //
array(array( 3, 10), array( 3, 23), array( 4, 31), array(11, 31)), //
array(array( 7, 7), array(21, 7), array( 1, 37), array(19, 26)), //
array(array( 5, 10), array(19, 10), array(15, 25), array(23, 25)), // 30
array(array(13, 3), array( 2, 29), array(42, 1), array(23, 28)), //
array(array(17, 0), array(10, 23), array(10, 35), array(19, 35)), //
array(array(17, 1), array(14, 21), array(29, 19), array(11, 46)), //
array(array(13, 6), array(14, 23), array(44, 7), array(59, 1)), //
array(array(12, 7), array(12, 26), array(39, 14), array(22, 41)), // 35
array(array( 6, 14), array( 6, 34), array(46, 10), array( 2, 64)), //
array(array(17, 4), array(29, 14), array(49, 10), array(24, 46)), //
array(array( 4, 18), array(13, 32), array(48, 14), array(42, 32)), //
array(array(20, 4), array(40, 7), array(43, 22), array(10, 67)), //
array(array(19, 6), array(18, 31), array(34, 34), array(20, 61)) // 40
);
/**
* @var array Positions of alignment patterns.
* 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.
* See Table 1 in Appendix E (pp.71) of JIS X0510:2004.
* @access protected
*/
protected $alignmentPattern = array(
array( 0, 0),
array( 0, 0), array(18, 0), array(22, 0), array(26, 0), array(30, 0), // 1- 5
array(34, 0), array(22, 38), array(24, 42), array(26, 46), array(28, 50), // 6-10
array(30, 54), array(32, 58), array(34, 62), array(26, 46), array(26, 48), // 11-15
array(26, 50), array(30, 54), array(30, 56), array(30, 58), array(34, 62), // 16-20
array(28, 50), array(26, 50), array(30, 54), array(28, 54), array(32, 58), // 21-25
array(30, 58), array(34, 62), array(26, 50), array(30, 54), array(26, 52), // 26-30
array(30, 56), array(34, 60), array(30, 58), array(34, 62), array(30, 54), // 31-35
array(24, 50), array(28, 54), array(32, 58), array(26, 54), array(30, 58) // 35-40
);
/**
* @var array Version information pattern (BCH coded).
* See Table 1 in Appendix D (pp.68) of JIS X0510:2004.
* size: [QRSPEC_VERSION_MAX - 6]
* @access protected
*/
protected $versionPattern = array(
0x07c94, 0x085bc, 0x09a99, 0x0a4d3, 0x0bbf6, 0x0c762, 0x0d847, 0x0e60d, //
0x0f928, 0x10b78, 0x1145d, 0x12a17, 0x13532, 0x149a6, 0x15683, 0x168c9, //
0x177ec, 0x18ec4, 0x191e1, 0x1afab, 0x1b08e, 0x1cc1a, 0x1d33f, 0x1ed75, //
0x1f250, 0x209d5, 0x216f0, 0x228ba, 0x2379f, 0x24b0b, 0x2542e, 0x26a64, //
0x27541, 0x28c69
);
/**
* @var array Format information
* @access protected
*/
protected $formatInfo = array(
array(0x77c4, 0x72f3, 0x7daa, 0x789d, 0x662f, 0x6318, 0x6c41, 0x6976), //
array(0x5412, 0x5125, 0x5e7c, 0x5b4b, 0x45f9, 0x40ce, 0x4f97, 0x4aa0), //
array(0x355f, 0x3068, 0x3f31, 0x3a06, 0x24b4, 0x2183, 0x2eda, 0x2bed), //
array(0x1689, 0x13be, 0x1ce7, 0x19d0, 0x0762, 0x0255, 0x0d0c, 0x083b) //
);
// -------------------------------------------------
// -------------------------------------------------
/**
* This is the class constructor.
* Creates a QRcode object
* @param string $code code to represent using QRcode
* @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>
* @access
* @since 1.0.000
*/
function __construct($code, $eclevel = 'L') {
$barcode_array = array();
if ((is_null($code)) OR ($code == '\0') OR ($code == '')) {
return false;
}
// set error correction level
$this->level = array_search($eclevel, array('L', 'M', 'Q', 'H'));
if ($this->level === false) {
$this->level = QR_ECLEVEL_L;
}
if (($this->hint != QR_MODE_8B) AND ($this->hint != QR_MODE_KJ)) {
return false;
}
if (($this->version < 0) OR ($this->version > QRSPEC_VERSION_MAX)) {
return false;
}
$this->items = array();
$this->encodeString($code);
$qrTab = $this->binarize($this->data);
$size = count($qrTab);
$barcode_array['num_rows'] = $size;
$barcode_array['num_cols'] = $size;
$barcode_array['bcode'] = array();
foreach ($qrTab as $line) {
$arrAdd = array();
foreach (str_split($line) as $char) {
$arrAdd[] = ($char=='1')?1:0;
}
$barcode_array['bcode'][] = $arrAdd;
}
$this->barcode_array = $barcode_array;
}
/**
* Returns a barcode array which is readable by TCPDF
* @return array barcode array readable by TCPDF;
* @access
*/
function getBarcodeArray() {
return $this->barcode_array;
}
/**
* Convert the frame in binary form
* @param array $frame array to binarize
* @return array frame in binary form
*/
protected function binarize($frame) {
$len = count($frame);
// the frame is square (width = height)
foreach ($frame as &$frameLine) {
for ($i=0; $i<$len; $i++) {
$frameLine[$i] = (ord($frameLine[$i])&1)?'1':'0';
}
}
return $frame;
}
/**
* Encode the input string to QR code
* @param string $string input string to encode
*/
protected function encodeString($string) {
$this->dataStr = $string;
if (!$this->casesensitive) {
$this->toUpper();
}
$ret = $this->splitString();
if ($ret < 0) {
return NULL;
}
$this->encodeMask(-1);
}
/**
* Encode mask
* @param int $mask masking mode
*/
protected function encodeMask($mask) {
$spec = array(0, 0, 0, 0, 0);
$this->datacode = $this->getByteStream($this->items);
if (is_null($this->datacode)) {
return NULL;
}
$spec = $this->getEccSpec($this->version, $this->level, $spec);
$this->b1 = $this->rsBlockNum1($spec);
$this->dataLength = $this->rsDataLength($spec);
$this->eccLength = $this->rsEccLength($spec);
$this->ecccode = array_fill(0, $this->eccLength, 0);
$this->blocks = $this->rsBlockNum($spec);
$ret = $this->init($spec);
if ($ret < 0) {
return NULL;
}
$this->count = 0;
$this->width = $this->getWidth($this->version);
$this->frame = $this->newFrame($this->version);
$this->x = $this->width - 1;
$this->y = $this->width - 1;
$this->dir = -1;
$this->bit = -1;
// inteleaved data and ecc codes
for ($i=0; $i < ($this->dataLength + $this->eccLength); $i++) {
$code = $this->getCode();
$bit = 0x80;
for ($j=0; $j<8; $j++) {
$addr = $this->getNextPosition();
$this->setFrameAt($addr, 0x02 | (($bit & $code) != 0));
$bit = $bit >> 1;
}
}
// remainder bits
$j = $this->getRemainder($this->version);
for ($i=0; $i<$j; $i++) {
$addr = $this->getNextPosition();
$this->setFrameAt($addr, 0x02);
}
// masking
$this->runLength = array_fill(0, QRSPEC_WIDTH_MAX + 1, 0);
if ($mask < 0) {
if (QR_FIND_BEST_MASK) {
$masked = $this->mask($this->width, $this->frame, $this->level);
} else {
$masked = $this->makeMask($this->width, $this->frame, (intval(QR_DEFAULT_MASK) % 8), $this->level);
}
} else {
$masked = $this->makeMask($this->width, $this->frame, $mask, $this->level);
}
if ($masked == NULL) {
return NULL;
}
$this->data = $masked;
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// FrameFiller
/**
* Set frame value at specified position
* @param array $at x,y position
* @param int $val value of the character to set
*/
protected function setFrameAt($at, $val) {
$this->frame[$at['y']][$at['x']] = chr($val);
}
/**
* Get frame value at specified position
* @param array $at x,y position
* @return value at specified position
*/
protected function getFrameAt($at) {
return ord($this->frame[$at['y']][$at['x']]);
}
/**
* Return the next frame position
* @return array of x,y coordinates
*/
protected function getNextPosition() {
do {
if ($this->bit == -1) {
$this->bit = 0;
return array('x'=>$this->x, 'y'=>$this->y);
}
$x = $this->x;
$y = $this->y;
$w = $this->width;
if ($this->bit == 0) {
$x--;
$this->bit++;
} else {
$x++;
$y += $this->dir;
$this->bit--;
}
if ($this->dir < 0) {
if ($y < 0) {
$y = 0;
$x -= 2;
$this->dir = 1;
if ($x == 6) {
$x--;
$y = 9;
}
}
} else {
if ($y == $w) {
$y = $w - 1;
$x -= 2;
$this->dir = -1;
if ($x == 6) {
$x--;
$y -= 8;
}
}
}
if (($x < 0) OR ($y < 0)) {
return NULL;
}
$this->x = $x;
$this->y = $y;
} while(ord($this->frame[$y][$x]) & 0x80);
return array('x'=>$x, 'y'=>$y);
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// QRrawcode
/**
* Initialize code.
* @param array $spec array of ECC specification
* @return 0 in case of success, -1 in case of error
*/
protected function init($spec) {
$dl = $this->rsDataCodes1($spec);
$el = $this->rsEccCodes1($spec);
$rs = $this->init_rs(8, 0x11d, 0, 1, $el, 255 - $dl - $el);
$blockNo = 0;
$dataPos = 0;
$eccPos = 0;
$endfor = $this->rsBlockNum1($spec);
for ($i=0; $i < $endfor; ++$i) {
$ecc = array_slice($this->ecccode, $eccPos);
$this->rsblocks[$blockNo] = array();
$this->rsblocks[$blockNo]['dataLength'] = $dl;
$this->rsblocks[$blockNo]['data'] = array_slice($this->datacode, $dataPos);
$this->rsblocks[$blockNo]['eccLength'] = $el;
$ecc = $this->encode_rs_char($rs, $this->rsblocks[$blockNo]['data'], $ecc);
$this->rsblocks[$blockNo]['ecc'] = $ecc;
$this->ecccode = array_merge(array_slice($this->ecccode,0, $eccPos), $ecc);
$dataPos += $dl;
$eccPos += $el;
$blockNo++;
}
if ($this->rsBlockNum2($spec) == 0) {
return 0;
}
$dl = $this->rsDataCodes2($spec);
$el = $this->rsEccCodes2($spec);
$rs = $this->init_rs(8, 0x11d, 0, 1, $el, 255 - $dl - $el);
if ($rs == NULL) {
return -1;
}
$endfor = $this->rsBlockNum2($spec);
for ($i=0; $i < $endfor; ++$i) {
$ecc = array_slice($this->ecccode, $eccPos);
$this->rsblocks[$blockNo] = array();
$this->rsblocks[$blockNo]['dataLength'] = $dl;
$this->rsblocks[$blockNo]['data'] = array_slice($this->datacode, $dataPos);
$this->rsblocks[$blockNo]['eccLength'] = $el;
$ecc = $this->encode_rs_char($rs, $this->rsblocks[$blockNo]['data'], $ecc);
$this->rsblocks[$blockNo]['ecc'] = $ecc;
$this->ecccode = array_merge(array_slice($this->ecccode, 0, $eccPos), $ecc);
$dataPos += $dl;
$eccPos += $el;
$blockNo++;
}
return 0;
}
/**
* Return Reed-Solomon block code.
* @return array rsblocks
*/
protected function getCode() {
if ($this->count < $this->dataLength) {
$row = $this->count % $this->blocks;
$col = $this->count / $this->blocks;
if ($col >= $this->rsblocks[0]['dataLength']) {
$row += $this->b1;
}
$ret = $this->rsblocks[$row]['data'][$col];
} elseif ($this->count < $this->dataLength + $this->eccLength) {
$row = ($this->count - $this->dataLength) % $this->blocks;
$col = ($this->count - $this->dataLength) / $this->blocks;
$ret = $this->rsblocks[$row]['ecc'][$col];
} else {
return 0;
}
$this->count++;
return $ret;
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// QRmask
/**
* Write Format Information on frame and returns the number of black bits
* @param int $width frame width
* @param array $frame frame
* @param array $mask masking mode
* @param int $level error correction level
* @return int blacks
*/
protected function writeFormatInformation($width, &$frame, $mask, $level) {
$blacks = 0;
$format = $this->getFormatInfo($mask, $level);
for ($i=0; $i<8; ++$i) {
if ($format & 1) {
$blacks += 2;
$v = 0x85;
} else {
$v = 0x84;
}
$frame[8][$width - 1 - $i] = chr($v);
if ($i < 6) {
$frame[$i][8] = chr($v);
} else {
$frame[$i + 1][8] = chr($v);
}
$format = $format >> 1;
}
for ($i=0; $i<7; ++$i) {
if ($format & 1) {
$blacks += 2;
$v = 0x85;
} else {
$v = 0x84;
}
$frame[$width - 7 + $i][8] = chr($v);
if ($i == 0) {
$frame[8][7] = chr($v);
} else {
$frame[8][6 - $i] = chr($v);
}
$format = $format >> 1;
}
return $blacks;
}
/**
* mask0
* @param int $x X position
* @param int $y Y position
* @return int mask
*/
protected function mask0($x, $y) {
return ($x + $y) & 1;
}
/**
* mask1
* @param int $x X position
* @param int $y Y position
* @return int mask
*/
protected function mask1($x, $y) {
return ($y & 1);
}
/**
* mask2
* @param int $x X position
* @param int $y Y position
* @return int mask
*/
protected function mask2($x, $y) {
return ($x % 3);
}
/**
* mask3
* @param int $x X position
* @param int $y Y position
* @return int mask
*/
protected function mask3($x, $y) {
return ($x + $y) % 3;
}
/**
* mask4
* @param int $x X position
* @param int $y Y position
* @return int mask
*/
protected function mask4($x, $y) {
return (((int)($y / 2)) + ((int)($x / 3))) & 1;
}
/**
* mask5
* @param int $x X position
* @param int $y Y position
* @return int mask
*/
protected function mask5($x, $y) {
return (($x * $y) & 1) + ($x * $y) % 3;
}
/**
* mask6
* @param int $x X position
* @param int $y Y position
* @return int mask
*/
protected function mask6($x, $y) {
return ((($x * $y) & 1) + ($x * $y) % 3) & 1;
}
/**
* mask7
* @param int $x X position
* @param int $y Y position
* @return int mask
*/
protected function mask7($x, $y) {
return ((($x * $y) % 3) + (($x + $y) & 1)) & 1;
}
/**
* Return bitmask
* @param int $maskNo mask number
* @param int $width width
* @param array $frame frame
* @return array bitmask
*/
protected function generateMaskNo($maskNo, $width, $frame) {
$bitMask = array_fill(0, $width, array_fill(0, $width, 0));
for ($y=0; $y<$width; ++$y) {
for ($x=0; $x<$width; ++$x) {
if (ord($frame[$y][$x]) & 0x80) {
$bitMask[$y][$x] = 0;
} else {
$maskFunc = call_user_func(array($this, 'mask'.$maskNo), $x, $y);
$bitMask[$y][$x] = ($maskFunc == 0)?1:0;
}
}
}
return $bitMask;
}
/**
* makeMaskNo
* @param int $maskNo
* @param int $width
* @param int $s
* @param int $d
* @param boolean $maskGenOnly
* @return int b
*/
protected function makeMaskNo($maskNo, $width, $s, &$d, $maskGenOnly=false) {
$b = 0;
$bitMask = array();
$bitMask = $this->generateMaskNo($maskNo, $width, $s, $d);
if ($maskGenOnly) {
return;
}
$d = $s;
for ($y=0; $y<$width; ++$y) {
for ($x=0; $x<$width; ++$x) {
if ($bitMask[$y][$x] == 1) {
$d[$y][$x] = chr(ord($s[$y][$x]) ^ (int)$bitMask[$y][$x]);
}
$b += (int)(ord($d[$y][$x]) & 1);
}
}
return $b;
}
/**
* makeMask
* @param int $width
* @param array $frame
* @param int $maskNo
* @param int $level
* @return array mask
*/
protected function makeMask($width, $frame, $maskNo, $level) {
$masked = array_fill(0, $width, str_repeat("\0", $width));
$this->makeMaskNo($maskNo, $width, $frame, $masked);
$this->writeFormatInformation($width, $masked, $maskNo, $level);
return $masked;
}
/**
* calcN1N3
* @param int $length
* @return int demerit
*/
protected function calcN1N3($length) {
$demerit = 0;
for ($i=0; $i<$length; ++$i) {
if ($this->runLength[$i] >= 5) {
$demerit += (N1 + ($this->runLength[$i] - 5));
}
if ($i & 1) {
if (($i >= 3) AND ($i < ($length-2)) AND ($this->runLength[$i] % 3 == 0)) {
$fact = (int)($this->runLength[$i] / 3);
if (($this->runLength[$i-2] == $fact)
AND ($this->runLength[$i-1] == $fact)
AND ($this->runLength[$i+1] == $fact)
AND ($this->runLength[$i+2] == $fact)) {
if (($this->runLength[$i-3] < 0) OR ($this->runLength[$i-3] >= (4 * $fact))) {
$demerit += N3;
} elseif ((($i+3) >= $length) OR ($this->runLength[$i+3] >= (4 * $fact))) {
$demerit += N3;
}
}
}
}
}
return $demerit;
}
/**
* evaluateSymbol
* @param int $width
* @param array $frame
* @return int demerit
*/
protected function evaluateSymbol($width, $frame) {
$head = 0;
$demerit = 0;
for ($y=0; $y<$width; ++$y) {
$head = 0;
$this->runLength[0] = 1;
$frameY = $frame[$y];
if ($y > 0) {
$frameYM = $frame[$y-1];
}
for ($x=0; $x<$width; ++$x) {
if (($x > 0) AND ($y > 0)) {
$b22 = ord($frameY[$x]) & ord($frameY[$x-1]) & ord($frameYM[$x]) & ord($frameYM[$x-1]);
$w22 = ord($frameY[$x]) | ord($frameY[$x-1]) | ord($frameYM[$x]) | ord($frameYM[$x-1]);
if (($b22 | ($w22 ^ 1)) & 1) {
$demerit += N2;
}
}
if (($x == 0) AND (ord($frameY[$x]) & 1)) {
$this->runLength[0] = -1;
$head = 1;
$this->runLength[$head] = 1;
} elseif ($x > 0) {
if ((ord($frameY[$x]) ^ ord($frameY[$x-1])) & 1) {
$head++;
$this->runLength[$head] = 1;
} else {
$this->runLength[$head]++;
}
}
}
$demerit += $this->calcN1N3($head+1);
}
for ($x=0; $x<$width; ++$x) {
$head = 0;
$this->runLength[0] = 1;
for ($y=0; $y<$width; ++$y) {
if (($y == 0) AND (ord($frame[$y][$x]) & 1)) {
$this->runLength[0] = -1;
$head = 1;
$this->runLength[$head] = 1;
} elseif ($y > 0) {
if ((ord($frame[$y][$x]) ^ ord($frame[$y-1][$x])) & 1) {
$head++;
$this->runLength[$head] = 1;
} else {
$this->runLength[$head]++;
}
}
}
$demerit += $this->calcN1N3($head+1);
}
return $demerit;
}
/**
* mask
* @param int $width
* @param array $frame
* @param int $level
* @return array best mask
*/
protected function mask($width, $frame, $level) {
$minDemerit = PHP_INT_MAX;
$bestMaskNum = 0;
$bestMask = array();
$checked_masks = array(0, 1, 2, 3, 4, 5, 6, 7);
if (QR_FIND_FROM_RANDOM !== false) {
$howManuOut = 8 - (QR_FIND_FROM_RANDOM % 9);
for ($i = 0; $i < $howManuOut; ++$i) {
$remPos = rand (0, count($checked_masks)-1);
unset($checked_masks[$remPos]);
$checked_masks = array_values($checked_masks);
}
}
$bestMask = $frame;
foreach ($checked_masks as $i) {
$mask = array_fill(0, $width, str_repeat("\0", $width));
$demerit = 0;
$blacks = 0;
$blacks = $this->makeMaskNo($i, $width, $frame, $mask);
$blacks += $this->writeFormatInformation($width, $mask, $i, $level);
$blacks = (int)(100 * $blacks / ($width * $width));
$demerit = (int)((int)(abs($blacks - 50) / 5) * N4);
$demerit += $this->evaluateSymbol($width, $mask);
if ($demerit < $minDemerit) {
$minDemerit = $demerit;
$bestMask = $mask;
$bestMaskNum = $i;
}
}
return $bestMask;
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// QRsplit
/**
* Return true if the character at specified position is a number
* @param string $str string
* @param int $pos characted position
* @return boolean true of false
*/
protected function isdigitat($str, $pos) {
if ($pos >= strlen($str)) {
return false;
}
return ((ord($str[$pos]) >= ord('0'))&&(ord($str[$pos]) <= ord('9')));
}
/**
* Return true if the character at specified position is an alphanumeric character
* @param string $str string
* @param int $pos characted position
* @return boolean true of false
*/
protected function isalnumat($str, $pos) {
if ($pos >= strlen($str)) {
return false;
}
return ($this->lookAnTable(ord($str[$pos])) >= 0);
}
/**
* identifyMode
* @param int $pos
* @return int mode
*/
protected function identifyMode($pos) {
if ($pos >= strlen($this->dataStr)) {
return QR_MODE_NL;
}
$c = $this->dataStr[$pos];
if ($this->isdigitat($this->dataStr, $pos)) {
return QR_MODE_NM;
} elseif ($this->isalnumat($this->dataStr, $pos)) {
return QR_MODE_AN;
} elseif ($this->hint == QR_MODE_KJ) {
if ($pos+1 < strlen($this->dataStr)) {
$d = $this->dataStr[$pos+1];
$word = (ord($c) << 8) | ord($d);
if (($word >= 0x8140 && $word <= 0x9ffc) OR ($word >= 0xe040 && $word <= 0xebbf)) {
return QR_MODE_KJ;
}
}
}
return QR_MODE_8B;
}
/**
* eatNum
* @return int run
*/
protected function eatNum() {
$ln = $this->lengthIndicator(QR_MODE_NM, $this->version);
$p = 0;
while($this->isdigitat($this->dataStr, $p)) {
$p++;
}
$run = $p;
$mode = $this->identifyMode($p);
if ($mode == QR_MODE_8B) {
$dif = $this->estimateBitsModeNum($run) + 4 + $ln
+ $this->estimateBitsMode8(1) // + 4 + l8
- $this->estimateBitsMode8($run + 1); // - 4 - l8
if ($dif > 0) {
return $this->eat8();
}
}
if ($mode == QR_MODE_AN) {
$dif = $this->estimateBitsModeNum($run) + 4 + $ln
+ $this->estimateBitsModeAn(1) // + 4 + la
- $this->estimateBitsModeAn($run + 1);// - 4 - la
if ($dif > 0) {
return $this->eatAn();
}
}
$this->items = $this->appendNewInputItem($this->items, QR_MODE_NM, $run, str_split($this->dataStr));
return $run;
}
/**
* eatAn
* @return int run
*/
protected function eatAn() {
$la = $this->lengthIndicator(QR_MODE_AN, $this->version);
$ln = $this->lengthIndicator(QR_MODE_NM, $this->version);
$p = 0;
while($this->isalnumat($this->dataStr, $p)) {
if ($this->isdigitat($this->dataStr, $p)) {
$q = $p;
while($this->isdigitat($this->dataStr, $q)) {
$q++;
}
$dif = $this->estimateBitsModeAn($p) // + 4 + la
+ $this->estimateBitsModeNum($q - $p) + 4 + $ln
- $this->estimateBitsModeAn($q); // - 4 - la
if ($dif < 0) {
break;
} else {
$p = $q;
}
} else {
$p++;
}
}
$run = $p;
if (!$this->isalnumat($this->dataStr, $p)) {
$dif = $this->estimateBitsModeAn($run) + 4 + $la
+ $this->estimateBitsMode8(1) // + 4 + l8
- $this->estimateBitsMode8($run + 1); // - 4 - l8
if ($dif > 0) {
return $this->eat8();
}
}
$this->items = $this->appendNewInputItem($this->items, QR_MODE_AN, $run, str_split($this->dataStr));
return $run;
}
/**
* eatKanji
* @return int run
*/
protected function eatKanji() {
$p = 0;
while($this->identifyMode($p) == QR_MODE_KJ) {
$p += 2;
}
$this->items = $this->appendNewInputItem($this->items, QR_MODE_KJ, $p, str_split($this->dataStr));
return $run;
}
/**
* eat8
* @return int run
*/
protected function eat8() {
$la = $this->lengthIndicator(QR_MODE_AN, $this->version);
$ln = $this->lengthIndicator(QR_MODE_NM, $this->version);
$p = 1;
$dataStrLen = strlen($this->dataStr);
while($p < $dataStrLen) {
$mode = $this->identifyMode($p);
if ($mode == QR_MODE_KJ) {
break;
}
if ($mode == QR_MODE_NM) {
$q = $p;
while($this->isdigitat($this->dataStr, $q)) {
$q++;
}
$dif = $this->estimateBitsMode8($p) // + 4 + l8
+ $this->estimateBitsModeNum($q - $p) + 4 + $ln
- $this->estimateBitsMode8($q); // - 4 - l8
if ($dif < 0) {
break;
} else {
$p = $q;
}
} elseif ($mode == QR_MODE_AN) {
$q = $p;
while($this->isalnumat($this->dataStr, $q)) {
$q++;
}
$dif = $this->estimateBitsMode8($p) // + 4 + l8
+ $this->estimateBitsModeAn($q - $p) + 4 + $la
- $this->estimateBitsMode8($q); // - 4 - l8
if ($dif < 0) {
break;
} else {
$p = $q;
}
} else {
$p++;
}
}
$run = $p;
$this->items = $this->appendNewInputItem($this->items, QR_MODE_8B, $run, str_split($this->dataStr));
return $run;
}
/**
* splitString
*/
protected function splitString() {
while (strlen($this->dataStr) > 0) {
if ($this->dataStr == '') {
return 0;
}
$mode = $this->identifyMode(0);
switch ($mode) {
case QR_MODE_NM: {
$length = $this->eatNum();
break;
}
case QR_MODE_AN: {
$length = $this->eatAn();
break;
}
case QR_MODE_KJ: {
if ($hint == QR_MODE_KJ) {
$length = $this->eatKanji();
} else {
$length = $this->eat8();
}
break;
}
default: {
$length = $this->eat8();
break;
}
}
if ($length == 0) {
return 0;
}
if ($length < 0) {
return -1;
}
$this->dataStr = substr($this->dataStr, $length);
}
}
/**
* toUpper
*/
protected function toUpper() {
$stringLen = strlen($this->dataStr);
$p = 0;
while ($p < $stringLen) {
$mode = $this->identifyMode(substr($this->dataStr, $p), $this->hint);
if ($mode == QR_MODE_KJ) {
$p += 2;
} else {
if ((ord($this->dataStr[$p]) >= ord('a')) AND (ord($this->dataStr[$p]) <= ord('z'))) {
$this->dataStr[$p] = chr(ord($this->dataStr[$p]) - 32);
}
$p++;
}
}
return $this->dataStr;
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// QRinputItem
/**
* newInputItem
* @param int $mode
* @param int $size
* @param array $data
* @param array $bstream
* @return array input item
*/
protected function newInputItem($mode, $size, $data, $bstream=null) {
$setData = array_slice($data, 0, $size);
if (count($setData) < $size) {
$setData = array_merge($setData, array_fill(0, ($size - count($setData)), 0));
}
if (!$this->check($mode, $size, $setData)) {
return NULL;
}
$inputitem = array();
$inputitem['mode'] = $mode;
$inputitem['size'] = $size;
$inputitem['data'] = $setData;
$inputitem['bstream'] = $bstream;
return $inputitem;
}
/**
* encodeModeNum
* @param array $inputitem
* @param int $version
* @return array input item
*/
protected function encodeModeNum($inputitem, $version) {
$words = (int)($inputitem['size'] / 3);
$inputitem['bstream'] = array();
$val = 0x1;
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, $val);
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], $this->lengthIndicator(QR_MODE_NM, $version), $inputitem['size']);
for ($i=0; $i < $words; ++$i) {
$val = (ord($inputitem['data'][$i*3 ]) - ord('0')) * 100;
$val += (ord($inputitem['data'][$i*3+1]) - ord('0')) * 10;
$val += (ord($inputitem['data'][$i*3+2]) - ord('0'));
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 10, $val);
}
if ($inputitem['size'] - $words * 3 == 1) {
$val = ord($inputitem['data'][$words*3]) - ord('0');
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, $val);
} elseif (($inputitem['size'] - ($words * 3)) == 2) {
$val = (ord($inputitem['data'][$words*3 ]) - ord('0')) * 10;
$val += (ord($inputitem['data'][$words*3+1]) - ord('0'));
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 7, $val);
}
return $inputitem;
}
/**
* encodeModeAn
* @param array $inputitem
* @param int $version
* @return array input item
*/
protected function encodeModeAn($inputitem, $version) {
$words = (int)($inputitem['size'] / 2);
$inputitem['bstream'] = array();
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, 0x02);
$inputitem['bstream'] = $this->appendNum(v, $this->lengthIndicator(QR_MODE_AN, $version), $inputitem['size']);
for ($i=0; $i < $words; ++$i) {
$val = (int)$this->lookAnTable(ord($inputitem['data'][$i*2 ])) * 45;
$val += (int)$this->lookAnTable(ord($inputitem['data'][$i*2+1]));
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 11, $val);
}
if ($inputitem['size'] & 1) {
$val = $this->lookAnTable(ord($inputitem['data'][($words * 2)]));
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 6, $val);
}
return $inputitem;
}
/**
* encodeMode8
* @param array $inputitem
* @param int $version
* @return array input item
*/
protected function encodeMode8($inputitem, $version) {
$inputitem['bstream'] = array();
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, 0x4);
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], $this->lengthIndicator(QR_MODE_8B, $version), $inputitem['size']);
for ($i=0; $i < $inputitem['size']; ++$i) {
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 8, ord($inputitem['data'][$i]));
}
return $inputitem;
}
/**
* encodeModeKanji
* @param array $inputitem
* @param int $version
* @return array input item
*/
protected function encodeModeKanji($inputitem, $version) {
$inputitem['bstream'] = array();
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, 0x8);
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], $this->lengthIndicator(QR_MODE_KJ, $version), (int)($inputitem['size'] / 2));
for ($i=0; $i<$inputitem['size']; $i+=2) {
$val = (ord($inputitem['data'][$i]) << 8) | ord($inputitem['data'][$i+1]);
if ($val <= 0x9ffc) {
$val -= 0x8140;
} else {
$val -= 0xc140;
}
$h = ($val >> 8) * 0xc0;
$val = ($val & 0xff) + $h;
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 13, $val);
}
return $inputitem;
}
/**
* encodeModeStructure
* @param array $inputitem
* @return array input item
*/
protected function encodeModeStructure($inputitem) {
$inputitem['bstream'] = array();
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, 0x03);
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, ord($inputitem['data'][1]) - 1);
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 4, ord($inputitem['data'][0]) - 1);
$inputitem['bstream'] = $this->appendNum($inputitem['bstream'], 8, ord($inputitem['data'][2]));
return $inputitem;
}
/**
* encodeBitStream
* @param array $inputitem
* @param int $version
* @return array input item
*/
protected function encodeBitStream($inputitem, $version) {
$inputitem['bstream'] = array();
$words = $this->maximumWords($inputitem['mode'], $version);
if ($inputitem['size'] > $words) {
$st1 = $this->newInputItem($inputitem['mode'], $words, $inputitem['data']);
$st2 = $this->newInputItem($inputitem['mode'], $inputitem['size'] - $words, array_slice($inputitem['data'], $words));
$st1 = $this->encodeBitStream($st1, $version);
$st2 = $this->encodeBitStream($st2, $version);
$inputitem['bstream'] = array();
$inputitem['bstream'] = $this->appendBitstream($inputitem['bstream'], $st1['bstream']);
$inputitem['bstream'] = $this->appendBitstream($inputitem['bstream'], $st2['bstream']);
} else {
switch($inputitem['mode']) {
case QR_MODE_NM: {
$inputitem = $this->encodeModeNum($inputitem, $version);
break;
}
case QR_MODE_AN: {
$inputitem = $this->encodeModeAn($inputitem, $version);
break;
}
case QR_MODE_8B: {
$inputitem = $this->encodeMode8($inputitem, $version);
break;
}
case QR_MODE_KJ: {
$inputitem = $this->encodeModeKanji($inputitem, $version);
break;
}
case QR_MODE_ST: {
$inputitem = $this->encodeModeStructure($inputitem);
break;
}
default: {
break;
}
}
}
return $inputitem;
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// QRinput
/**
* Append data to an input object.
* The data is copied and appended to the input object.
* @param array items input items
* @param int $mode encoding mode.
* @param int $size size of data (byte).
* @param array $data array of input data.
* @return items
*
*/
protected function appendNewInputItem($items, $mode, $size, $data) {
$items[] = $this->newInputItem($mode, $size, $data);
return $items;
}
/**
* insertStructuredAppendHeader
* @param array $items
* @param int $size
* @param int $index
* @param int $parity
* @return array items
*/
protected function insertStructuredAppendHeader($items, $size, $index, $parity) {
if ($size > MAX_STRUCTURED_SYMBOLS) {
return -1;
}
if (($index <= 0) OR ($index > MAX_STRUCTURED_SYMBOLS)) {
return -1;
}
$buf = array($size, $index, $parity);
$entry = $this->newInputItem(QR_MODE_ST, 3, buf);
array_unshift($items, $entry);
return $items;
}
/**
* calcParity
* @param array $items
* @return int parity
*/
protected function calcParity($items) {
$parity = 0;
foreach ($items as $item) {
if ($item['mode'] != QR_MODE_ST) {
for ($i=$item['size']-1; $i>=0; --$i) {
$parity ^= $item['data'][$i];
}
}
}
return $parity;
}
/**
* checkModeNum
* @param int $size
* @param array $data
* @return boolean true or false
*/
protected function checkModeNum($size, $data) {
for ($i=0; $i<$size; ++$i) {
if ((ord($data[$i]) < ord('0')) OR (ord($data[$i]) > ord('9'))){
return false;
}
}
return true;
}
/**
* estimateBitsModeNum
* @param int $size
* @return int number of bits
*/
protected function estimateBitsModeNum($size) {
$w = (int)$size / 3;
$bits = $w * 10;
switch($size - $w * 3) {
case 1: {
$bits += 4;
break;
}
case 2: {
$bits += 7;
break;
}
default: {
break;
}
}
return $bits;
}
/**
* Look up the alphabet-numeric convesion table (see JIS X0510:2004, pp.19).
* @param int $c character value
* @return value
*/
protected function lookAnTable($c) {
return (($c > 127)?-1:$this->anTable[$c]);
}
/**
* checkModeAn
* @param int $size
* @param array $data
* @return boolean true or false
*/
protected function checkModeAn($size, $data) {
for ($i=0; $i<$size; ++$i) {
if ($this->lookAnTable(ord($data[$i])) == -1) {
return false;
}
}
return true;
}
/**
* estimateBitsModeAn
* @param int $size
* @return int number of bits
*/
protected function estimateBitsModeAn($size) {
$w = (int)($size / 2);
$bits = $w * 11;
if ($size & 1) {
$bits += 6;
}
return $bits;
}
/**
* estimateBitsMode8
* @param int $size
* @return int number of bits
*/
protected function estimateBitsMode8($size) {
return $size * 8;
}
/**
* estimateBitsModeKanji
* @param int $size
* @return int number of bits
*/
protected function estimateBitsModeKanji($size) {
return (int)(($size / 2) * 13);
}
/**
* checkModeKanji
* @param int $size
* @param array $data
* @return boolean true or false
*/
protected function checkModeKanji($size, $data) {
if ($size & 1) {
return false;
}
for ($i=0; $i<$size; $i+=2) {
$val = (ord($data[$i]) << 8) | ord($data[$i+1]);
if (($val < 0x8140) OR (($val > 0x9ffc) AND ($val < 0xe040)) OR ($val > 0xebbf)) {
return false;
}
}
return true;
}
/**
* Validate the input data.
* @param int $mode encoding mode.
* @param int $size size of data (byte).
* @param array data data to validate
* @return boolean true in case of valid data, false otherwise
*/
protected function check($mode, $size, $data) {
if ($size <= 0) {
return false;
}
switch($mode) {
case QR_MODE_NM: {
return $this->checkModeNum($size, $data);
}
case QR_MODE_AN: {
return $this->checkModeAn($size, $data);
}
case QR_MODE_KJ: {
return $this->checkModeKanji($size, $data);
}
case QR_MODE_8B: {
return true;
}
case QR_MODE_ST: {
return true;
}
default: {
break;
}
}
return false;
}
/**
* estimateBitStreamSize
* @param array $items
* @param int $version
* @return int bits
*/
protected function estimateBitStreamSize($items, $version) {
$bits = 0;
if ($version == 0) {
$version = 1;
}
foreach ($items as $item) {
switch($item['mode']) {
case QR_MODE_NM: {
$bits = $this->estimateBitsModeNum($item['size']);
break;
}
case QR_MODE_AN: {
$bits = $this->estimateBitsModeAn($item['size']);
break;
}
case QR_MODE_8B: {
$bits = $this->estimateBitsMode8($item['size']);
break;
}
case QR_MODE_KJ: {
$bits = $this->estimateBitsModeKanji($item['size']);
break;
}
case QR_MODE_ST: {
return STRUCTURE_HEADER_BITS;
}
default: {
return 0;
}
}
$l = $this->lengthIndicator($item['mode'], $version);
$m = 1 << $l;
$num = (int)(($item['size'] + $m - 1) / $m);
$bits += $num * (4 + $l);
}
return $bits;
}
/**
* estimateVersion
* @param array $items
* @return int version
*/
protected function estimateVersion($items) {
$version = 0;
$prev = 0;
do {
$prev = $version;
$bits = $this->estimateBitStreamSize($items, $prev);
$version = $this->getMinimumVersion((int)(($bits + 7) / 8), $this->level);
if ($version < 0) {
return -1;
}
} while ($version > $prev);
return $version;
}
/**
* lengthOfCode
* @param int $mode
* @param int $version
* @param int $bits
* @return int size
*/
protected function lengthOfCode($mode, $version, $bits) {
$payload = $bits - 4 - $this->lengthIndicator($mode, $version);
switch($mode) {
case QR_MODE_NM: {
$chunks = (int)($payload / 10);
$remain = $payload - $chunks * 10;
$size = $chunks * 3;
if ($remain >= 7) {
$size += 2;
} elseif ($remain >= 4) {
$size += 1;
}
break;
}
case QR_MODE_AN: {
$chunks = (int)($payload / 11);
$remain = $payload - $chunks * 11;
$size = $chunks * 2;
if ($remain >= 6) {
++$size;
}
break;
}
case QR_MODE_8B: {
$size = (int)($payload / 8);
break;
}
case QR_MODE_KJ: {
$size = (int)(($payload / 13) * 2);
break;
}
case QR_MODE_ST: {
$size = (int)($payload / 8);
break;
}
default: {
$size = 0;
break;
}
}
$maxsize = $this->maximumWords($mode, $version);
if ($size < 0) {
$size = 0;
}
if ($size > $maxsize) {
$size = $maxsize;
}
return $size;
}
/**
* createBitStream
* @param array $items
* @return array of items and total bits
*/
protected function createBitStream($items) {
$total = 0;
foreach ($items as $key => $item) {
$items[$key] = $this->encodeBitStream($item, $this->version);
$bits = count($items[$key]['bstream']);
$total += $bits;
}
return array($items, $total);
}
/**
* convertData
* @param array $items
* @return array items
*/
protected function convertData($items) {
$ver = $this->estimateVersion($items);
if ($ver > $this->version) {
$this->version = $ver;
}
for (;;) {
$cbs = $this->createBitStream($items);
$items = $cbs[0];
$bits = $cbs[1];
if ($bits < 0) {
return -1;
}
$ver = $this->getMinimumVersion((int)(($bits + 7) / 8), $this->level);
if ($ver < 0) {
return -1;
} elseif ($ver > $this->version) {
$this->version = $ver;
} else {
break;
}
}
return $items;
}
/**
* Append Padding Bit to bitstream
* @param array $bstream
* @return array bitstream
*/
protected function appendPaddingBit($bstream) {
$bits = count($bstream);
$maxwords = $this->getDataLength($this->version, $this->level);
$maxbits = $maxwords * 8;
if ($maxbits == $bits) {
return 0;
}
if ($maxbits - $bits < 5) {
return $this->appendNum($bstream, $maxbits - $bits, 0);
}
$bits += 4;
$words = (int)(($bits + 7) / 8);
$padding = array();
$padding = $this->appendNum($padding, $words * 8 - $bits + 4, 0);
$padlen = $maxwords - $words;
if ($padlen > 0) {
$padbuf = array();
for ($i=0; $i<$padlen; ++$i) {
$padbuf[$i] = ($i&1)?0x11:0xec;
}
$padding = $this->appendBytes($padding, $padlen, $padbuf);
}
return $this->appendBitstream($bstream, $padding);
}
/**
* mergeBitStream
* @param array $bstream
* @return array bitstream
*/
protected function mergeBitStream($items) {
$items = $this->convertData($items);
$bstream = array();
foreach ($items as $item) {
$bstream = $this->appendBitstream($bstream, $item['bstream']);
}
return $bstream;
}
/**
* Returns a stream of bits.
* @param int $items
* @return array padded merged byte stream
*/
protected function getBitStream($items) {
$bstream = $this->mergeBitStream($items);
return $this->appendPaddingBit($bstream);
}
/**
* Pack all bit streams padding bits into a byte array.
* @param int $items
* @return array padded merged byte stream
*/
protected function getByteStream($items) {
$bstream = $this->getBitStream($items);
return $this->bitstreamToByte($bstream);
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// QRbitstream
/**
* Return an array with zeros
* @param int $setLength array size
* @return array
*/
protected function allocate($setLength) {
return array_fill(0, $setLength, 0);
}
/**
* Return new bitstream from number
* @param int $bits number of bits
* @param int $num number
* @return array bitstream
*/
protected function newFromNum($bits, $num) {
$bstream = $this->allocate($bits);
$mask = 1 << ($bits - 1);
for ($i=0; $i<$bits; ++$i) {
if ($num & $mask) {
$bstream[$i] = 1;
} else {
$bstream[$i] = 0;
}
$mask = $mask >> 1;
}
return $bstream;
}
/**
* Return new bitstream from bytes
* @param int $size size
* @param array $data bytes
* @return array bitstream
*/
protected function newFromBytes($size, $data) {
$bstream = $this->allocate($size * 8);
$p=0;
for ($i=0; $i<$size; ++$i) {
$mask = 0x80;
for ($j=0; $j<8; ++$j) {
if ($data[$i] & $mask) {
$bstream[$p] = 1;
} else {
$bstream[$p] = 0;
}
$p++;
$mask = $mask >> 1;
}
}
return $bstream;
}
/**
* Append one bitstream to another
* @param array $bitstream original bitstream
* @param array $append bitstream to append
* @return array bitstream
*/
protected function appendBitstream($bitstream, $append) {
if ((!is_array($append)) OR (count($append) == 0)) {
return $bitstream;
}
if (count($bitstream) == 0) {
return $append;
}
return array_values(array_merge($bitstream, $append));
}
/**
* Append one bitstream created from number to another
* @param array $bitstream original bitstream
* @param int $bits number of bits
* @param int $num number
* @return array bitstream
*/
protected function appendNum($bitstream, $bits, $num) {
if ($bits == 0) {
return 0;
}
$b = $this->newFromNum($bits, $num);
return $this->appendBitstream($bitstream, $b);
}
/**
* Append one bitstream created from bytes to another
* @param array $bitstream original bitstream
* @param int $size size
* @param array $data bytes
* @return array bitstream
*/
protected function appendBytes($bitstream, $size, $data) {
if ($size == 0) {
return 0;
}
$b = $this->newFromBytes($size, $data);
return $this->appendBitstream($bitstream, $b);
}
/**
* Convert bitstream to bytes
* @param array $bitstream original bitstream
* @return array of bytes
*/
protected function bitstreamToByte($bstream) {
$size = count($bstream);
if ($size == 0) {
return array();
}
$data = array_fill(0, (int)(($size + 7) / 8), 0);
$bytes = (int)($size / 8);
$p = 0;
for ($i=0; $i<$bytes; $i++) {
$v = 0;
for ($j=0; $j<8; $j++) {
$v = $v << 1;
$v |= $bstream[$p];
$p++;
}
$data[$i] = $v;
}
if ($size & 7) {
$v = 0;
for ($j=0; $j<($size & 7); $j++) {
$v = $v << 1;
$v |= $bstream[$p];
$p++;
}
$data[$bytes] = $v;
}
return $data;
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// QRspec
/**
* Replace a value on the array at the specified position
* @param array $srctab
* @param int $x X position
* @param int $y Y position
* @param string $repl value to replace
* @param int $replLen length of the repl string
* @return array srctab
*/
protected function qrstrset($srctab, $x, $y, $repl, $replLen=false) {
$srctab[$y] = substr_replace($srctab[$y], ($replLen !== false)?substr($repl,0,$replLen):$repl, $x, ($replLen !== false)?$replLen:strlen($repl));
return $srctab;
}
/**
* Return maximum data code length (bytes) for the version.
* @param int $version version
* @param int $level error correction level
* @return int maximum size (bytes)
*/
protected function getDataLength($version, $level) {
return $this->capacity[$version][QRCAP_WORDS] - $this->capacity[$version][QRCAP_EC][$level];
}
/**
* Return maximum error correction code length (bytes) for the version.
* @param int $version version
* @param int $level error correction level
* @return int ECC size (bytes)
*/
protected function getECCLength($version, $level){
return $this->capacity[$version][QRCAP_EC][$level];
}
/**
* Return the width of the symbol for the version.
* @param int $version version
* @return int width
*/
protected function getWidth($version) {
return $this->capacity[$version][QRCAP_WIDTH];
}
/**
* Return the numer of remainder bits.
* @param int $version version
* @return int number of remainder bits
*/
protected function getRemainder($version) {
return $this->capacity[$version][QRCAP_REMINDER];
}
/**
* Return a version number that satisfies the input code length.
* @param int $size input code length (byte)
* @param int $level error correction level
* @return int version number
*/
protected function getMinimumVersion($size, $level) {
for ($i=1; $i <= QRSPEC_VERSION_MAX; ++$i) {
$words = $this->capacity[$i][QRCAP_WORDS] - $this->capacity[$i][QRCAP_EC][$level];
if ($words >= $size) {
return $i;
}
}
return -1;
}
/**
* Return the size of length indicator for the mode and version.
* @param int $mode encoding mode
* @param int $version version
* @return int the size of the appropriate length indicator (bits).
*/
protected function lengthIndicator($mode, $version) {
if ($mode == QR_MODE_ST) {
return 0;
}
if ($version <= 9) {
$l = 0;
} elseif ($version <= 26) {
$l = 1;
} else {
$l = 2;
}
return $this->lengthTableBits[$mode][$l];
}
/**
* Return the maximum length for the mode and version.
* @param int $mode encoding mode
* @param int $version version
* @return int the maximum length (bytes)
*/
protected function maximumWords($mode, $version) {
if ($mode == QR_MODE_ST) {
return 3;
}
if ($version <= 9) {
$l = 0;
} else if ($version <= 26) {
$l = 1;
} else {
$l = 2;
}
$bits = $this->lengthTableBits[$mode][$l];
$words = (1 << $bits) - 1;
if ($mode == QR_MODE_KJ) {
$words *= 2; // the number of bytes is required
}
return $words;
}
/**
* Return an array of ECC specification.
* @param int $version version
* @param int $level error correction level
* @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}
* @return array spec
*/
protected function getEccSpec($version, $level, $spec) {
if (count($spec) < 5) {
$spec = array(0, 0, 0, 0, 0);
}
$b1 = $this->eccTable[$version][$level][0];
$b2 = $this->eccTable[$version][$level][1];
$data = $this->getDataLength($version, $level);
$ecc = $this->getECCLength($version, $level);
if ($b2 == 0) {
$spec[0] = $b1;
$spec[1] = (int)($data / $b1);
$spec[2] = (int)($ecc / $b1);
$spec[3] = 0;
$spec[4] = 0;
} else {
$spec[0] = $b1;
$spec[1] = (int)($data / ($b1 + $b2));
$spec[2] = (int)($ecc / ($b1 + $b2));
$spec[3] = $b2;
$spec[4] = $spec[1] + 1;
}
return $spec;
}
/**
* Put an alignment marker.
* @param array $frame frame
* @param int $width width
* @param int $ox X center coordinate of the pattern
* @param int $oy Y center coordinate of the pattern
* @return array frame
*/
protected function putAlignmentMarker($frame, $ox, $oy) {
$finder = array(
"\xa1\xa1\xa1\xa1\xa1",
"\xa1\xa0\xa0\xa0\xa1",
"\xa1\xa0\xa1\xa0\xa1",
"\xa1\xa0\xa0\xa0\xa1",
"\xa1\xa1\xa1\xa1\xa1"
);
$yStart = $oy - 2;
$xStart = $ox - 2;
for ($y=0; $y < 5; $y++) {
$frame = $this->qrstrset($frame, $xStart, $yStart+$y, $finder[$y]);
}
return $frame;
}
/**
* Put an alignment pattern.
* @param int $version version
* @param array $fram frame
* @param int $width width
* @return array frame
*/
protected function putAlignmentPattern($version, $frame, $width) {
if ($version < 2) {
return $frame;
}
$d = $this->alignmentPattern[$version][1] - $this->alignmentPattern[$version][0];
if ($d < 0) {
$w = 2;
} else {
$w = (int)(($width - $this->alignmentPattern[$version][0]) / $d + 2);
}
if ($w * $w - 3 == 1) {
$x = $this->alignmentPattern[$version][0];
$y = $this->alignmentPattern[$version][0];
$frame = $this->putAlignmentMarker($frame, $x, $y);
return $frame;
}
$cx = $this->alignmentPattern[$version][0];
$wo = $w - 1;
for ($x=1; $x < $wo; ++$x) {
$frame = $this->putAlignmentMarker($frame, 6, $cx);
$frame = $this->putAlignmentMarker($frame, $cx, 6);
$cx += $d;
}
$cy = $this->alignmentPattern[$version][0];
for ($y=0; $y < $wo; ++$y) {
$cx = $this->alignmentPattern[$version][0];
for ($x=0; $x < $wo; ++$x) {
$frame = $this->putAlignmentMarker($frame, $cx, $cy);
$cx += $d;
}
$cy += $d;
}
return $frame;
}
/**
* Return BCH encoded version information pattern that is used for the symbol of version 7 or greater. Use lower 18 bits.
* @param int $version version
* @return BCH encoded version information pattern
*/
protected function getVersionPattern($version) {
if (($version < 7) OR ($version > QRSPEC_VERSION_MAX)) {
return 0;
}
return $this->versionPattern[($version - 7)];
}
/**
* Return BCH encoded format information pattern.
* @param array $mask
* @param int $level error correction level
* @return BCH encoded format information pattern
*/
protected function getFormatInfo($mask, $level) {
if (($mask < 0) OR ($mask > 7)) {
return 0;
}
if (($level < 0) OR ($level > 3)) {
return 0;
}
return $this->formatInfo[$level][$mask];
}
/**
* Put a finder pattern.
* @param array $frame frame
* @param int $width width
* @param int $ox X center coordinate of the pattern
* @param int $oy Y center coordinate of the pattern
* @return array frame
*/
protected function putFinderPattern($frame, $ox, $oy) {
$finder = array(
"\xc1\xc1\xc1\xc1\xc1\xc1\xc1",
"\xc1\xc0\xc0\xc0\xc0\xc0\xc1",
"\xc1\xc0\xc1\xc1\xc1\xc0\xc1",
"\xc1\xc0\xc1\xc1\xc1\xc0\xc1",
"\xc1\xc0\xc1\xc1\xc1\xc0\xc1",
"\xc1\xc0\xc0\xc0\xc0\xc0\xc1",
"\xc1\xc1\xc1\xc1\xc1\xc1\xc1"
);
for ($y=0; $y < 7; $y++) {
$frame = $this->qrstrset($frame, $ox, ($oy + $y), $finder[$y]);
}
return $frame;
}
/**
* Return a copy of initialized frame.
* @param int $version version
* @return Array of unsigned char.
*/
protected function createFrame($version) {
$width = $this->capacity[$version][QRCAP_WIDTH];
$frameLine = str_repeat ("\0", $width);
$frame = array_fill(0, $width, $frameLine);
// Finder pattern
$frame = $this->putFinderPattern($frame, 0, 0);
$frame = $this->putFinderPattern($frame, $width - 7, 0);
$frame = $this->putFinderPattern($frame, 0, $width - 7);
// Separator
$yOffset = $width - 7;
for ($y=0; $y < 7; ++$y) {
$frame[$y][7] = "\xc0";
$frame[$y][$width - 8] = "\xc0";
$frame[$yOffset][7] = "\xc0";
++$yOffset;
}
$setPattern = str_repeat("\xc0", 8);
$frame = $this->qrstrset($frame, 0, 7, $setPattern);
$frame = $this->qrstrset($frame, $width-8, 7, $setPattern);
$frame = $this->qrstrset($frame, 0, $width - 8, $setPattern);
// Format info
$setPattern = str_repeat("\x84", 9);
$frame = $this->qrstrset($frame, 0, 8, $setPattern);
$frame = $this->qrstrset($frame, $width - 8, 8, $setPattern, 8);
$yOffset = $width - 8;
for ($y=0; $y < 8; ++$y,++$yOffset) {
$frame[$y][8] = "\x84";
$frame[$yOffset][8] = "\x84";
}
// Timing pattern
$wo = $width - 15;
for ($i=1; $i < $wo; ++$i) {
$frame[6][7+$i] = chr(0x90 | ($i & 1));
$frame[7+$i][6] = chr(0x90 | ($i & 1));
}
// Alignment pattern
$frame = $this->putAlignmentPattern($version, $frame, $width);
// Version information
if ($version >= 7) {
$vinf = $this->getVersionPattern($version);
$v = $vinf;
for ($x=0; $x<6; ++$x) {
for ($y=0; $y<3; ++$y) {
$frame[($width - 11)+$y][$x] = chr(0x88 | ($v & 1));
$v = $v >> 1;
}
}
$v = $vinf;
for ($y=0; $y<6; ++$y) {
for ($x=0; $x<3; ++$x) {
$frame[$y][$x+($width - 11)] = chr(0x88 | ($v & 1));
$v = $v >> 1;
}
}
}
// and a little bit...
$frame[$width - 8][8] = "\x81";
return $frame;
}
/**
* Set new frame for the specified version.
* @param int $version version
* @return Array of unsigned char.
*/
protected function newFrame($version) {
if (($version < 1) OR ($version > QRSPEC_VERSION_MAX)) {
return NULL;
}
if (!isset($this->frames[$version])) {
$this->frames[$version] = $this->createFrame($version);
}
if (is_null($this->frames[$version])) {
return NULL;
}
return $this->frames[$version];
}
/**
* Return block number 0
* @param array $spec
* @return int value
*/
protected function rsBlockNum($spec) {
return ($spec[0] + $spec[3]);
}
/**
* Return block number 1
* @param array $spec
* @return int value
*/
protected function rsBlockNum1($spec) {
return $spec[0];
}
/**
* Return data codes 1
* @param array $spec
* @return int value
*/
protected function rsDataCodes1($spec) {
return $spec[1];
}
/**
* Return ecc codes 1
* @param array $spec
* @return int value
*/
protected function rsEccCodes1($spec) {
return $spec[2];
}
/**
* Return block number 2
* @param array $spec
* @return int value
*/
protected function rsBlockNum2($spec) {
return $spec[3];
}
/**
* Return data codes 2
* @param array $spec
* @return int value
*/
protected function rsDataCodes2($spec) {
return $spec[4];
}
/**
* Return ecc codes 2
* @param array $spec
* @return int value
*/
protected function rsEccCodes2($spec) {
return $spec[2];
}
/**
* Return data length
* @param array $spec
* @return int value
*/
protected function rsDataLength($spec) {
return ($spec[0] * $spec[1]) + ($spec[3] * $spec[4]);
}
/**
* Return ecc length
* @param array $spec
* @return int value
*/
protected function rsEccLength($spec) {
return ($spec[0] + $spec[3]) * $spec[2];
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// QRrs
/**
* Initialize a Reed-Solomon codec and add it to existing rsitems
* @param int $symsize symbol size, bits
* @param int $gfpoly Field generator polynomial coefficients
* @param int $fcr first root of RS code generator polynomial, index form
* @param int $prim primitive element to generate polynomial roots
* @param int $nroots RS code generator polynomial degree (number of roots)
* @param int $pad padding bytes at front of shortened block
* @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>.
*/
protected function init_rs($symsize, $gfpoly, $fcr, $prim, $nroots, $pad) {
foreach ($this->rsitems as $rs) {
if (($rs['pad'] != $pad) OR ($rs['nroots'] != $nroots) OR ($rs['mm'] != $symsize)
OR ($rs['gfpoly'] != $gfpoly) OR ($rs['fcr'] != $fcr) OR ($rs['prim'] != $prim)) {
continue;
}
return $rs;
}
$rs = $this->init_rs_char($symsize, $gfpoly, $fcr, $prim, $nroots, $pad);
array_unshift($this->rsitems, $rs);
return $rs;
}
// - - - - - - - - - - - - - - - - - - - - - - - - -
// QRrsItem
/**
* modnn
* @param array RS values
* @param int $x X position
* @return int X osition
*/
protected function modnn($rs, $x) {
while ($x >= $rs['nn']) {
$x -= $rs['nn'];
$x = ($x >> $rs['mm']) + ($x & $rs['nn']);
}
return $x;
}
/**
* Initialize a Reed-Solomon codec and returns an array of values.
* @param int $symsize symbol size, bits
* @param int $gfpoly Field generator polynomial coefficients
* @param int $fcr first root of RS code generator polynomial, index form
* @param int $prim primitive element to generate polynomial roots
* @param int $nroots RS code generator polynomial degree (number of roots)
* @param int $pad padding bytes at front of shortened block
* @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>.
*/
protected function init_rs_char($symsize, $gfpoly, $fcr, $prim, $nroots, $pad) {
// Based on Reed solomon encoder by Phil Karn, KA9Q (GNU-LGPLv2)
$rs = null;
// Check parameter ranges
if (($symsize < 0) OR ($symsize > 8)) {
return $rs;
}
if (($fcr < 0) OR ($fcr >= (1<<$symsize))) {
return $rs;
}
if (($prim <= 0) OR ($prim >= (1<<$symsize))) {
return $rs;
}
if (($nroots < 0) OR ($nroots >= (1<<$symsize))) {
return $rs;
}
if (($pad < 0) OR ($pad >= ((1<<$symsize) -1 - $nroots))) {
return $rs;
}
$rs = array();
$rs['mm'] = $symsize;
$rs['nn'] = (1 << $symsize) - 1;
$rs['pad'] = $pad;
$rs['alpha_to'] = array_fill(0, ($rs['nn'] + 1), 0);
$rs['index_of'] = array_fill(0, ($rs['nn'] + 1), 0);
// PHP style macro replacement ;)
$NN =& $rs['nn'];
$A0 =& $NN;
// Generate Galois field lookup tables
$rs['index_of'][0] = $A0; // log(zero) = -inf
$rs['alpha_to'][$A0] = 0; // alpha**-inf = 0
$sr = 1;
for ($i=0; $i<$rs['nn']; ++$i) {
$rs['index_of'][$sr] = $i;
$rs['alpha_to'][$i] = $sr;
$sr <<= 1;
if ($sr & (1 << $symsize)) {
$sr ^= $gfpoly;
}
$sr &= $rs['nn'];
}
if ($sr != 1) {
// field generator polynomial is not primitive!
return NULL;
}
// Form RS code generator polynomial from its roots
$rs['genpoly'] = array_fill(0, ($nroots + 1), 0);
$rs['fcr'] = $fcr;
$rs['prim'] = $prim;
$rs['nroots'] = $nroots;
$rs['gfpoly'] = $gfpoly;
// Find prim-th root of 1, used in decoding
for ($iprim=1; ($iprim % $prim) != 0; $iprim += $rs['nn']) {
; // intentional empty-body loop!
}
$rs['iprim'] = (int)($iprim / $prim);
$rs['genpoly'][0] = 1;
for ($i = 0,$root=$fcr*$prim; $i < $nroots; $i++, $root += $prim) {
$rs['genpoly'][$i+1] = 1;
// Multiply rs->genpoly[] by @**(root + x)
for ($j = $i; $j > 0; --$j) {
if ($rs['genpoly'][$j] != 0) {
$rs['genpoly'][$j] = $rs['genpoly'][$j-1] ^ $rs['alpha_to'][$this->modnn($rs, $rs['index_of'][$rs['genpoly'][$j]] + $root)];
} else {
$rs['genpoly'][$j] = $rs['genpoly'][$j-1];
}
}
// rs->genpoly[0] can never be zero
$rs['genpoly'][0] = $rs['alpha_to'][$this->modnn($rs, $rs['index_of'][$rs['genpoly'][0]] + $root)];
}
// convert rs->genpoly[] to index form for quicker encoding
for ($i = 0; $i <= $nroots; ++$i) {
$rs['genpoly'][$i] = $rs['index_of'][$rs['genpoly'][$i]];
}
return $rs;
}
/**
* Encode a Reed-Solomon codec and returns the parity array
* @param array $rs RS values
* @param array $data data
* @param array $parity parity
* @return parity array
*/
protected function encode_rs_char($rs, $data, $parity) {
$MM =& $rs['mm']; // bits per symbol
$NN =& $rs['nn']; // the total number of symbols in a RS block
$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
$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
$GENPOLY =& $rs['genpoly']; // an array of NROOTS+1 elements containing the generator polynomial in index form
$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
$FCR =& $rs['fcr']; // first consecutive root, index form
$PRIM =& $rs['prim']; // primitive element, index form
$IPRIM =& $rs['iprim']; // prim-th root of 1, index form
$PAD =& $rs['pad']; // the number of pad symbols in a block
$A0 =& $NN;
$parity = array_fill(0, $NROOTS, 0);
for ($i=0; $i < ($NN - $NROOTS - $PAD); $i++) {
$feedback = $INDEX_OF[$data[$i] ^ $parity[0]];
if ($feedback != $A0) {
// feedback term is non-zero
// This line is unnecessary when GENPOLY[NROOTS] is unity, as it must
// always be for the polynomials constructed by init_rs()
$feedback = $this->modnn($rs, $NN - $GENPOLY[$NROOTS] + $feedback);
for ($j=1; $j < $NROOTS; ++$j) {
$parity[$j] ^= $ALPHA_TO[$this->modnn($rs, $feedback + $GENPOLY[($NROOTS - $j)])];
}
}
// Shift
array_shift($parity);
if ($feedback != $A0) {
array_push($parity, $ALPHA_TO[$this->modnn($rs, $feedback + $GENPOLY[0])]);
} else {
array_push($parity, 0);
}
}
return $parity;
}
} // end QRcode class
} // END OF "class_exists QRcode"
?>
lib/phpqrcode_php4/cache/frame_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_10.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_11.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_12.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_13.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_14.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_15.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_16.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_17.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_18.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_19.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_20.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_21.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_22.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_23.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_24.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_25.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_26.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_27.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_28.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_29.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_30.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_31.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_32.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_33.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_34.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_35.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_36.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_37.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_38.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_39.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_40.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_8.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/frame_9.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_101_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_105_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_109_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_113_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_117_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_121_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_125_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_129_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_133_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_137_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_141_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_145_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_149_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_153_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_157_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_161_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_165_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_169_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_173_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_177_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_21_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_25_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_29_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_33_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_37_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_41_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_45_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_49_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_53_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_57_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_61_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_65_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_69_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_73_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_77_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_81_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_85_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_89_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_93_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_0/mask_97_0.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_101_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_105_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_109_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_113_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_117_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_121_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_125_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_129_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_133_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_137_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_141_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_145_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_149_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_153_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_157_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_161_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_165_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_169_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_173_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_177_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_21_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_25_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_29_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_33_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_37_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_41_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_45_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_49_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_53_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_57_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_61_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_65_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_69_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_73_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_77_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_81_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_85_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_89_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_93_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_1/mask_97_1.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_101_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_105_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_109_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_113_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_117_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_121_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_125_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_129_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_133_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_137_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_141_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_145_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_149_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_153_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_157_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_161_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_165_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_169_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_173_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_177_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_21_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_25_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_29_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_33_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_37_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_41_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_45_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_49_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_53_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_57_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_61_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_65_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_69_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_73_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_77_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_81_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_85_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_89_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_93_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_2/mask_97_2.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_101_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_105_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_109_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_113_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_117_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_121_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_125_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_129_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_133_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_137_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_141_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_145_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_149_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_153_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_157_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_161_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_165_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_169_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_173_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_177_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_21_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_25_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_29_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_33_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_37_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_41_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_45_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_49_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_53_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_57_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_61_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_65_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_69_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_73_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_77_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_81_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_85_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_89_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_93_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_3/mask_97_3.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_101_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_105_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_109_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_113_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_117_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_121_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_125_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_129_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_133_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_137_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_141_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_145_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_149_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_153_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_157_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_161_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_165_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_169_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_173_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_177_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_21_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_25_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_29_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_33_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_37_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_41_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_45_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_49_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_53_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_57_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_61_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_65_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_69_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_73_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_77_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_81_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_85_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_89_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_93_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_4/mask_97_4.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_101_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_105_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_109_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_113_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_117_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_121_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_125_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_129_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_133_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_137_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_141_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_145_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_149_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_153_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_157_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_161_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_165_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_169_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_173_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_177_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_21_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_25_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_29_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_33_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_37_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_41_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_45_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_49_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_53_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_57_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_61_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_65_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_69_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_73_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_77_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_81_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_85_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_89_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_93_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_5/mask_97_5.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_101_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_105_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_109_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_113_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_117_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_121_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_125_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_129_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_133_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_137_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_141_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_145_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_149_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_153_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_157_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_161_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_165_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_169_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_173_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_177_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_21_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_25_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_29_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_33_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_37_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_41_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_45_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_49_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_53_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_57_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_61_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_65_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_69_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_73_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_77_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_81_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_85_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_89_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_93_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_6/mask_97_6.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_101_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_105_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_109_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_113_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_117_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_121_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_125_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_129_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_133_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_137_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_141_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_145_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_149_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_153_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_157_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_161_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_165_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_169_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_173_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_177_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_21_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_25_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_29_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_33_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_37_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_41_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_45_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_49_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_53_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_57_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_61_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_65_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_69_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_73_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_77_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_81_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_85_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_89_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_93_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/cache/mask_7/mask_97_7.dat 0 → 100644
No preview for this file type
lib/phpqrcode_php4/index.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Exemplatory usage
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
echo "<h1>PHP QR Code</h1><hr/>";
//set it to writable location, a place for temp generated PNG files
$PNG_TEMP_DIR = dirname(__FILE__).DIRECTORY_SEPARATOR.'temp'.DIRECTORY_SEPARATOR;
//html PNG location prefix
$PNG_WEB_DIR = 'temp/';
include "qrlib.php";
//ofcourse we need rights to create temp dir
if (!file_exists($PNG_TEMP_DIR))
mkdir($PNG_TEMP_DIR);
$filename = $PNG_TEMP_DIR.'test.png';
//processing form input
//remember to sanitize user input in real-life solution !!!
$errorCorrectionLevel = 'L';
if (isset($_REQUEST['level']) && in_array($_REQUEST['level'], array('L','M','Q','H')))
$errorCorrectionLevel = $_REQUEST['level'];
$matrixPointSize = 4;
if (isset($_REQUEST['size']))
$matrixPointSize = min(max((int)$_REQUEST['size'], 1), 10);
if (isset($_REQUEST['data'])) {
//it's very important!
if (trim($_REQUEST['data']) == '')
die('data cannot be empty! <a href="?">back</a>');
// user data
$filename = $PNG_TEMP_DIR.'test'.md5($_REQUEST['data'].'|'.$errorCorrectionLevel.'|'.$matrixPointSize).'.png';
QRcode::png($_REQUEST['data'], $filename, $errorCorrectionLevel, $matrixPointSize, 2);
} else {
//default data
echo 'You can provide data in GET parameter: <a href="?data=like_that">like that</a><hr/>';
QRcode::png('PHP QR Code :)', $filename, $errorCorrectionLevel, $matrixPointSize, 2);
}
//display generated file
echo '<img src="'.$PNG_WEB_DIR.basename($filename).'" /><hr/>';
//config form
echo '<form action="index.php" method="post">
Data:&nbsp;<input name="data" value="'.(isset($_REQUEST['data'])?htmlspecialchars($_REQUEST['data']):'PHP QR Code :)').'" />&nbsp;
ECC:&nbsp;<select name="level">
<option value="L"'.(($errorCorrectionLevel=='L')?' selected':'').'>L - smallest</option>
<option value="M"'.(($errorCorrectionLevel=='M')?' selected':'').'>M</option>
<option value="Q"'.(($errorCorrectionLevel=='Q')?' selected':'').'>Q</option>
<option value="H"'.(($errorCorrectionLevel=='H')?' selected':'').'>H - best</option>
</select>&nbsp;
Size:&nbsp;<select name="size">';
for($i=1;$i<=10;$i++)
echo '<option value="'.$i.'"'.(($matrixPointSize==$i)?' selected':'').'>'.$i.'</option>';
echo '</select>&nbsp;
<input type="submit" value="GENERATE"></form><hr/>';
// benchmark
QRtools::timeBenchmark();
\ No newline at end of file
lib/phpqrcode_php4/phpqrcode.php 0 → 100644
This diff could not be displayed because it is too large.
lib/phpqrcode_php4/qrbitstream.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Bitstream class
*
* Based on libqrencode C library distributed under LGPL 2.1
* Copyright (C) 2006, 2007, 2008, 2009 Kentaro Fukuchi <fukuchi@megaui.net>
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
class QRbitstream {
$data = array();
//----------------------------------------------------------------------
function size()
{
return count($this->data);
}
//----------------------------------------------------------------------
function allocate($setLength)
{
$this->data = array_fill(0, $setLength, 0);
return 0;
}
//----------------------------------------------------------------------
function newFromNum($bits, $num)
{
$bstream = new QRbitstream();
$bstream->allocate($bits);
$mask = 1 << ($bits - 1);
for($i=0; $i<$bits; $i++) {
if($num & $mask) {
$bstream->data[$i] = 1;
} else {
$bstream->data[$i] = 0;
}
$mask = $mask >> 1;
}
return $bstream;
}
//----------------------------------------------------------------------
function newFromBytes($size, $data)
{
$bstream = new QRbitstream();
$bstream->allocate($size * 8);
$p=0;
for($i=0; $i<$size; $i++) {
$mask = 0x80;
for($j=0; $j<8; $j++) {
if($data[$i] & $mask) {
$bstream->data[$p] = 1;
} else {
$bstream->data[$p] = 0;
}
$p++;
$mask = $mask >> 1;
}
}
return $bstream;
}
//----------------------------------------------------------------------
function append(QRbitstream $arg)
{
if (is_null($arg)) {
return -1;
}
if($arg->size() == 0) {
return 0;
}
if($this->size() == 0) {
$this->data = $arg->data;
return 0;
}
$this->data = array_values(array_merge($this->data, $arg->data));
return 0;
}
//----------------------------------------------------------------------
function appendNum($bits, $num)
{
if ($bits == 0)
return 0;
$b = QRbitstream::newFromNum($bits, $num);
if(is_null($b))
return -1;
$ret = $this->append($b);
unset($b);
return $ret;
}
//----------------------------------------------------------------------
function appendBytes($size, $data)
{
if ($size == 0)
return 0;
$b = QRbitstream::newFromBytes($size, $data);
if(is_null($b))
return -1;
$ret = $this->append($b);
unset($b);
return $ret;
}
//----------------------------------------------------------------------
function toByte()
{
$size = $this->size();
if($size == 0) {
return array();
}
$data = array_fill(0, (int)(($size + 7) / 8), 0);
$bytes = (int)($size / 8);
$p = 0;
for($i=0; $i<$bytes; $i++) {
$v = 0;
for($j=0; $j<8; $j++) {
$v = $v << 1;
$v |= $this->data[$p];
$p++;
}
$data[$i] = $v;
}
if($size & 7) {
$v = 0;
for($j=0; $j<($size & 7); $j++) {
$v = $v << 1;
$v |= $this->data[$p];
$p++;
}
$data[$bytes] = $v;
}
return $data;
}
}
lib/phpqrcode_php4/qrconfig.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Config file, feel free to modify
*/
define('QR_CACHEABLE', true); // use cache - more disk reads but less CPU power, masks and format templates are stored there
define('QR_CACHE_DIR', dirname(__FILE__).DIRECTORY_SEPARATOR.'cache'.DIRECTORY_SEPARATOR); // used when QR_CACHEABLE === true
define('QR_LOG_DIR', dirname(__FILE__).DIRECTORY_SEPARATOR); // default error logs dir
define('QR_FIND_BEST_MASK', true); // if true, estimates best mask (spec. default, but extremally slow; set to false to significant performance boost but (propably) worst quality code
define('QR_FIND_FROM_RANDOM', false); // if false, checks all masks available, otherwise value tells count of masks need to be checked, mask id are got randomly
define('QR_DEFAULT_MASK', 2); // when QR_FIND_BEST_MASK === false
define('QR_PNG_MAXIMUM_SIZE', 1024); // maximum allowed png image width (in pixels), tune to make sure GD and PHP can handle such big images
\ No newline at end of file
lib/phpqrcode_php4/qrconst.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Common constants
*
* Based on libqrencode C library distributed under LGPL 2.1
* Copyright (C) 2006, 2007, 2008, 2009 Kentaro Fukuchi <fukuchi@megaui.net>
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
// Encoding modes
define('QR_MODE_NUL', -1);
define('QR_MODE_NUM', 0);
define('QR_MODE_AN', 1);
define('QR_MODE_8', 2);
define('QR_MODE_KANJI', 3);
define('QR_MODE_STRUCTURE', 4);
// Levels of error correction.
define('QR_ECLEVEL_L', 0);
define('QR_ECLEVEL_M', 1);
define('QR_ECLEVEL_Q', 2);
define('QR_ECLEVEL_H', 3);
// Supported output formats
define('QR_FORMAT_TEXT', 0);
define('QR_FORMAT_PNG', 1);
class qrstr {
function set(&$srctab, $x, $y, $repl, $replLen = false) {
$srctab[$y] = substr_replace($srctab[$y], ($replLen !== false)?substr($repl,0,$replLen):$repl, $x, ($replLen !== false)?$replLen:strlen($repl));
}
}
\ No newline at end of file
lib/phpqrcode_php4/qrencode.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Main encoder classes.
*
* Based on libqrencode C library distributed under LGPL 2.1
* Copyright (C) 2006, 2007, 2008, 2009 Kentaro Fukuchi <fukuchi@megaui.net>
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
class QRrsblock {
$dataLength;
$data = array();
$eccLength;
$ecc = array();
function __construct($dl, $data, $el, &$ecc, QRrsItem $rs)
{
$rs->encode_rs_char($data, $ecc);
$this->dataLength = $dl;
$this->data = $data;
$this->eccLength = $el;
$this->ecc = $ecc;
}
};
//##########################################################################
class QRrawcode {
$version;
$datacode = array();
$ecccode = array();
$blocks;
$rsblocks = array(); //of RSblock
$count;
$dataLength;
$eccLength;
$b1;
//----------------------------------------------------------------------
function __construct(QRinput $input)
{
$spec = array(0,0,0,0,0);
$this->datacode = $input->getByteStream();
if(is_null($this->datacode)) {
throw new Exception('null imput string');
}
QRspec::getEccSpec($input->getVersion(), $input->getErrorCorrectionLevel(), $spec);
$this->version = $input->getVersion();
$this->b1 = QRspec::rsBlockNum1($spec);
$this->dataLength = QRspec::rsDataLength($spec);
$this->eccLength = QRspec::rsEccLength($spec);
$this->ecccode = array_fill(0, $this->eccLength, 0);
$this->blocks = QRspec::rsBlockNum($spec);
$ret = $this->init($spec);
if($ret < 0) {
throw new Exception('block alloc error');
return null;
}
$this->count = 0;
}
//----------------------------------------------------------------------
function init(array $spec)
{
$dl = QRspec::rsDataCodes1($spec);
$el = QRspec::rsEccCodes1($spec);
$rs = QRrs::init_rs(8, 0x11d, 0, 1, $el, 255 - $dl - $el);
$blockNo = 0;
$dataPos = 0;
$eccPos = 0;
for($i=0; $i<QRspec::rsBlockNum1($spec); $i++) {
$ecc = array_slice($this->ecccode,$eccPos);
$this->rsblocks[$blockNo] = new QRrsblock($dl, array_slice($this->datacode, $dataPos), $el, $ecc, $rs);
$this->ecccode = array_merge(array_slice($this->ecccode,0, $eccPos), $ecc);
$dataPos += $dl;
$eccPos += $el;
$blockNo++;
}
if(QRspec::rsBlockNum2($spec) == 0)
return 0;
$dl = QRspec::rsDataCodes2($spec);
$el = QRspec::rsEccCodes2($spec);
$rs = QRrs::init_rs(8, 0x11d, 0, 1, $el, 255 - $dl - $el);
if($rs == NULL) return -1;
for($i=0; $i<QRspec::rsBlockNum2($spec); $i++) {
$ecc = array_slice($this->ecccode,$eccPos);
$this->rsblocks[$blockNo] = new QRrsblock($dl, array_slice($this->datacode, $dataPos), $el, $ecc, $rs);
$this->ecccode = array_merge(array_slice($this->ecccode,0, $eccPos), $ecc);
$dataPos += $dl;
$eccPos += $el;
$blockNo++;
}
return 0;
}
//----------------------------------------------------------------------
function getCode()
{
$ret;
if($this->count < $this->dataLength) {
$row = $this->count % $this->blocks;
$col = $this->count / $this->blocks;
if($col >= $this->rsblocks[0]->dataLength) {
$row += $this->b1;
}
$ret = $this->rsblocks[$row]->data[$col];
} else if($this->count < $this->dataLength + $this->eccLength) {
$row = ($this->count - $this->dataLength) % $this->blocks;
$col = ($this->count - $this->dataLength) / $this->blocks;
$ret = $this->rsblocks[$row]->ecc[$col];
} else {
return 0;
}
$this->count++;
return $ret;
}
}
//##########################################################################
class QRcode {
$version;
$width;
$data;
//----------------------------------------------------------------------
function encodeMask(QRinput $input, $mask)
{
if($input->getVersion() < 0 || $input->getVersion() > QRSPEC_VERSION_MAX) {
throw new Exception('wrong version');
}
if($input->getErrorCorrectionLevel() > QR_ECLEVEL_H) {
throw new Exception('wrong level');
}
$raw = new QRrawcode($input);
QRtools::markTime('after_raw');
$version = $raw->version;
$width = QRspec::getWidth($version);
$frame = QRspec::newFrame($version);
$filler = new FrameFiller($width, $frame);
if(is_null($filler)) {
return NULL;
}
// inteleaved data and ecc codes
for($i=0; $i<$raw->dataLength + $raw->eccLength; $i++) {
$code = $raw->getCode();
$bit = 0x80;
for($j=0; $j<8; $j++) {
$addr = $filler->next();
$filler->setFrameAt($addr, 0x02 | (($bit & $code) != 0));
$bit = $bit >> 1;
}
}
QRtools::markTime('after_filler');
unset($raw);
// remainder bits
$j = QRspec::getRemainder($version);
for($i=0; $i<$j; $i++) {
$addr = $filler->next();
$filler->setFrameAt($addr, 0x02);
}
$frame = $filler->frame;
unset($filler);
// masking
$maskObj = new QRmask();
if($mask < 0) {
if (QR_FIND_BEST_MASK) {
$masked = $maskObj->mask($width, $frame, $input->getErrorCorrectionLevel());
} else {
$masked = $maskObj->makeMask($width, $frame, (intval(QR_DEFAULT_MASK) % 8), $input->getErrorCorrectionLevel());
}
} else {
$masked = $maskObj->makeMask($width, $frame, $mask, $input->getErrorCorrectionLevel());
}
if($masked == NULL) {
return NULL;
}
QRtools::markTime('after_mask');
$this->version = $version;
$this->width = $width;
$this->data = $masked;
return $this;
}
//----------------------------------------------------------------------
function encodeInput(QRinput $input)
{
return $this->encodeMask($input, -1);
}
//----------------------------------------------------------------------
function encodeString8bit($string, $version, $level)
{
if(string == NULL) {
throw new Exception('empty string!');
return NULL;
}
$input = new QRinput($version, $level);
if($input == NULL) return NULL;
$ret = $input->append($input, QR_MODE_8, strlen($string), str_split($string));
if($ret < 0) {
unset($input);
return NULL;
}
return $this->encodeInput($input);
}
//----------------------------------------------------------------------
function encodeString($string, $version, $level, $hint, $casesensitive)
{
if($hint != QR_MODE_8 && $hint != QR_MODE_KANJI) {
throw new Exception('bad hint');
return NULL;
}
$input = new QRinput($version, $level);
if($input == NULL) return NULL;
$ret = QRsplit::splitStringToQRinput($string, $input, $hint, $casesensitive);
if($ret < 0) {
return NULL;
}
return $this->encodeInput($input);
}
//----------------------------------------------------------------------
function png($text, $outfile = false, $level = QR_ECLEVEL_L, $size = 3, $margin = 4, $saveandprint=false)
{
$enc = QRencode::factory($level, $size, $margin);
return $enc->encodePNG($text, $outfile, $saveandprint=false);
}
//----------------------------------------------------------------------
function text($text, $outfile = false, $level = QR_ECLEVEL_L, $size = 3, $margin = 4)
{
$enc = QRencode::factory($level, $size, $margin);
return $enc->encode($text, $outfile);
}
//----------------------------------------------------------------------
function raw($text, $outfile = false, $level = QR_ECLEVEL_L, $size = 3, $margin = 4)
{
$enc = QRencode::factory($level, $size, $margin);
return $enc->encodeRAW($text, $outfile);
}
}
//##########################################################################
class FrameFiller {
$width;
$frame;
$x;
$y;
$dir;
$bit;
//----------------------------------------------------------------------
function __construct($width, &$frame)
{
$this->width = $width;
$this->frame = $frame;
$this->x = $width - 1;
$this->y = $width - 1;
$this->dir = -1;
$this->bit = -1;
}
//----------------------------------------------------------------------
function setFrameAt($at, $val)
{
$this->frame[$at['y']][$at['x']] = chr($val);
}
//----------------------------------------------------------------------
function getFrameAt($at)
{
return ord($this->frame[$at['y']][$at['x']]);
}
//----------------------------------------------------------------------
function next()
{
do {
if($this->bit == -1) {
$this->bit = 0;
return array('x'=>$this->x, 'y'=>$this->y);
}
$x = $this->x;
$y = $this->y;
$w = $this->width;
if($this->bit == 0) {
$x--;
$this->bit++;
} else {
$x++;
$y += $this->dir;
$this->bit--;
}
if($this->dir < 0) {
if($y < 0) {
$y = 0;
$x -= 2;
$this->dir = 1;
if($x == 6) {
$x--;
$y = 9;
}
}
} else {
if($y == $w) {
$y = $w - 1;
$x -= 2;
$this->dir = -1;
if($x == 6) {
$x--;
$y -= 8;
}
}
}
if($x < 0 || $y < 0) return null;
$this->x = $x;
$this->y = $y;
} while(ord($this->frame[$y][$x]) & 0x80);
return array('x'=>$x, 'y'=>$y);
}
} ;
//##########################################################################
class QRencode {
$casesensitive = true;
$eightbit = false;
$version = 0;
$size = 3;
$margin = 4;
$structured = 0; // not supported yet
$level = QR_ECLEVEL_L;
$hint = QR_MODE_8;
//----------------------------------------------------------------------
function factory($level = QR_ECLEVEL_L, $size = 3, $margin = 4)
{
$enc = new QRencode();
$enc->size = $size;
$enc->margin = $margin;
switch ($level.'') {
case '0':
case '1':
case '2':
case '3':
$enc->level = $level;
break;
case 'l':
case 'L':
$enc->level = QR_ECLEVEL_L;
break;
case 'm':
case 'M':
$enc->level = QR_ECLEVEL_M;
break;
case 'q':
case 'Q':
$enc->level = QR_ECLEVEL_Q;
break;
case 'h':
case 'H':
$enc->level = QR_ECLEVEL_H;
break;
}
return $enc;
}
//----------------------------------------------------------------------
function encodeRAW($intext, $outfile = false)
{
$code = new QRcode();
if($this->eightbit) {
$code->encodeString8bit($intext, $this->version, $this->level);
} else {
$code->encodeString($intext, $this->version, $this->level, $this->hint, $this->casesensitive);
}
return $code->data;
}
//----------------------------------------------------------------------
function encode($intext, $outfile = false)
{
$code = new QRcode();
if($this->eightbit) {
$code->encodeString8bit($intext, $this->version, $this->level);
} else {
$code->encodeString($intext, $this->version, $this->level, $this->hint, $this->casesensitive);
}
QRtools::markTime('after_encode');
if ($outfile!== false) {
file_put_contents($outfile, join("\n", QRtools::binarize($code->data)));
} else {
return QRtools::binarize($code->data);
}
}
//----------------------------------------------------------------------
function encodePNG($intext, $outfile = false,$saveandprint=false)
{
try {
ob_start();
$tab = $this->encode($intext);
$err = ob_get_contents();
ob_end_clean();
if ($err != '')
QRtools::log($outfile, $err);
$maxSize = (int)(QR_PNG_MAXIMUM_SIZE / (count($tab)+2*$this->margin));
QRimage::png($tab, $outfile, min(max(1, $this->size), $maxSize), $this->margin,$saveandprint);
} catch (Exception $e) {
QRtools::log($outfile, $e->getMessage());
}
}
}
lib/phpqrcode_php4/qrimage.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Image output of code using GD2
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
define('QR_IMAGE', true);
class QRimage {
//----------------------------------------------------------------------
function png($frame, $filename = false, $pixelPerPoint = 4, $outerFrame = 4,$saveandprint=FALSE)
{
$image = self::image($frame, $pixelPerPoint, $outerFrame);
if ($filename === false) {
Header("Content-type: image/png");
ImagePng($image);
} else {
if($saveandprint===TRUE){
ImagePng($image, $filename);
header("Content-type: image/png");
ImagePng($image);
}else{
ImagePng($image, $filename);
}
}
ImageDestroy($image);
}
//----------------------------------------------------------------------
function jpg($frame, $filename = false, $pixelPerPoint = 8, $outerFrame = 4, $q = 85)
{
$image = self::image($frame, $pixelPerPoint, $outerFrame);
if ($filename === false) {
Header("Content-type: image/jpeg");
ImageJpeg($image, null, $q);
} else {
ImageJpeg($image, $filename, $q);
}
ImageDestroy($image);
}
//----------------------------------------------------------------------
function image($frame, $pixelPerPoint = 4, $outerFrame = 4)
{
$h = count($frame);
$w = strlen($frame[0]);
$imgW = $w + 2*$outerFrame;
$imgH = $h + 2*$outerFrame;
$base_image =ImageCreate($imgW, $imgH);
$col[0] = ImageColorAllocate($base_image,255,255,255);
$col[1] = ImageColorAllocate($base_image,0,0,0);
imagefill($base_image, 0, 0, $col[0]);
for($y=0; $y<$h; $y++) {
for($x=0; $x<$w; $x++) {
if ($frame[$y][$x] == '1') {
ImageSetPixel($base_image,$x+$outerFrame,$y+$outerFrame,$col[1]);
}
}
}
$target_image =ImageCreate($imgW * $pixelPerPoint, $imgH * $pixelPerPoint);
ImageCopyResized($target_image, $base_image, 0, 0, 0, 0, $imgW * $pixelPerPoint, $imgH * $pixelPerPoint, $imgW, $imgH);
ImageDestroy($base_image);
return $target_image;
}
}
\ No newline at end of file
lib/phpqrcode_php4/qrinput.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Input encoding class
*
* Based on libqrencode C library distributed under LGPL 2.1
* Copyright (C) 2006, 2007, 2008, 2009 Kentaro Fukuchi <fukuchi@megaui.net>
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
define('STRUCTURE_HEADER_BITS', 20);
define('MAX_STRUCTURED_SYMBOLS', 16);
class QRinputItem {
$mode;
$size;
$data;
$bstream;
function __construct($mode, $size, $data, $bstream = null)
{
$setData = array_slice($data, 0, $size);
if (count($setData) < $size) {
$setData = array_merge($setData, array_fill(0,$size-count($setData),0));
}
if(!QRinput::check($mode, $size, $setData)) {
throw new Exception('Error m:'.$mode.',s:'.$size.',d:'.join(',',$setData));
return null;
}
$this->mode = $mode;
$this->size = $size;
$this->data = $setData;
$this->bstream = $bstream;
}
//----------------------------------------------------------------------
function encodeModeNum($version)
{
try {
$words = (int)($this->size / 3);
$bs = new QRbitstream();
$val = 0x1;
$bs->appendNum(4, $val);
$bs->appendNum(QRspec::lengthIndicator(QR_MODE_NUM, $version), $this->size);
for($i=0; $i<$words; $i++) {
$val = (ord($this->data[$i*3 ]) - ord('0')) * 100;
$val += (ord($this->data[$i*3+1]) - ord('0')) * 10;
$val += (ord($this->data[$i*3+2]) - ord('0'));
$bs->appendNum(10, $val);
}
if($this->size - $words * 3 == 1) {
$val = ord($this->data[$words*3]) - ord('0');
$bs->appendNum(4, $val);
} else if($this->size - $words * 3 == 2) {
$val = (ord($this->data[$words*3 ]) - ord('0')) * 10;
$val += (ord($this->data[$words*3+1]) - ord('0'));
$bs->appendNum(7, $val);
}
$this->bstream = $bs;
return 0;
} catch (Exception $e) {
return -1;
}
}
//----------------------------------------------------------------------
function encodeModeAn($version)
{
try {
$words = (int)($this->size / 2);
$bs = new QRbitstream();
$bs->appendNum(4, 0x02);
$bs->appendNum(QRspec::lengthIndicator(QR_MODE_AN, $version), $this->size);
for($i=0; $i<$words; $i++) {
$val = (int)QRinput::lookAnTable(ord($this->data[$i*2 ])) * 45;
$val += (int)QRinput::lookAnTable(ord($this->data[$i*2+1]));
$bs->appendNum(11, $val);
}
if($this->size & 1) {
$val = QRinput::lookAnTable(ord($this->data[$words * 2]));
$bs->appendNum(6, $val);
}
$this->bstream = $bs;
return 0;
} catch (Exception $e) {
return -1;
}
}
//----------------------------------------------------------------------
function encodeMode8($version)
{
try {
$bs = new QRbitstream();
$bs->appendNum(4, 0x4);
$bs->appendNum(QRspec::lengthIndicator(QR_MODE_8, $version), $this->size);
for($i=0; $i<$this->size; $i++) {
$bs->appendNum(8, ord($this->data[$i]));
}
$this->bstream = $bs;
return 0;
} catch (Exception $e) {
return -1;
}
}
//----------------------------------------------------------------------
function encodeModeKanji($version)
{
try {
$bs = new QRbitrtream();
$bs->appendNum(4, 0x8);
$bs->appendNum(QRspec::lengthIndicator(QR_MODE_KANJI, $version), (int)($this->size / 2));
for($i=0; $i<$this->size; $i+=2) {
$val = (ord($this->data[$i]) << 8) | ord($this->data[$i+1]);
if($val <= 0x9ffc) {
$val -= 0x8140;
} else {
$val -= 0xc140;
}
$h = ($val >> 8) * 0xc0;
$val = ($val & 0xff) + $h;
$bs->appendNum(13, $val);
}
$this->bstream = $bs;
return 0;
} catch (Exception $e) {
return -1;
}
}
//----------------------------------------------------------------------
function encodeModeStructure()
{
try {
$bs = new QRbitstream();
$bs->appendNum(4, 0x03);
$bs->appendNum(4, ord($this->data[1]) - 1);
$bs->appendNum(4, ord($this->data[0]) - 1);
$bs->appendNum(8, ord($this->data[2]));
$this->bstream = $bs;
return 0;
} catch (Exception $e) {
return -1;
}
}
//----------------------------------------------------------------------
function estimateBitStreamSizeOfEntry($version)
{
$bits = 0;
if($version == 0)
$version = 1;
switch($this->mode) {
case QR_MODE_NUM: $bits = QRinput::estimateBitsModeNum($this->size); break;
case QR_MODE_AN: $bits = QRinput::estimateBitsModeAn($this->size); break;
case QR_MODE_8: $bits = QRinput::estimateBitsMode8($this->size); break;
case QR_MODE_KANJI: $bits = QRinput::estimateBitsModeKanji($this->size);break;
case QR_MODE_STRUCTURE: return STRUCTURE_HEADER_BITS;
default:
return 0;
}
$l = QRspec::lengthIndicator($this->mode, $version);
$m = 1 << $l;
$num = (int)(($this->size + $m - 1) / $m);
$bits += $num * (4 + $l);
return $bits;
}
//----------------------------------------------------------------------
function encodeBitStream($version)
{
try {
unset($this->bstream);
$words = QRspec::maximumWords($this->mode, $version);
if($this->size > $words) {
$st1 = new QRinputItem($this->mode, $words, $this->data);
$st2 = new QRinputItem($this->mode, $this->size - $words, array_slice($this->data, $words));
$st1->encodeBitStream($version);
$st2->encodeBitStream($version);
$this->bstream = new QRbitstream();
$this->bstream->append($st1->bstream);
$this->bstream->append($st2->bstream);
unset($st1);
unset($st2);
} else {
$ret = 0;
switch($this->mode) {
case QR_MODE_NUM: $ret = $this->encodeModeNum($version); break;
case QR_MODE_AN: $ret = $this->encodeModeAn($version); break;
case QR_MODE_8: $ret = $this->encodeMode8($version); break;
case QR_MODE_KANJI: $ret = $this->encodeModeKanji($version);break;
case QR_MODE_STRUCTURE: $ret = $this->encodeModeStructure(); break;
default:
break;
}
if($ret < 0)
return -1;
}
return $this->bstream->size();
} catch (Exception $e) {
return -1;
}
}
};
//##########################################################################
class QRinput {
$items;
$version;
$level;
//----------------------------------------------------------------------
function __construct($version = 0, $level = QR_ECLEVEL_L)
{
if ($version < 0 || $version > QRSPEC_VERSION_MAX || $level > QR_ECLEVEL_H) {
throw new Exception('Invalid version no');
return NULL;
}
$this->version = $version;
$this->level = $level;
}
//----------------------------------------------------------------------
function getVersion()
{
return $this->version;
}
//----------------------------------------------------------------------
function setVersion($version)
{
if($version < 0 || $version > QRSPEC_VERSION_MAX) {
throw new Exception('Invalid version no');
return -1;
}
$this->version = $version;
return 0;
}
//----------------------------------------------------------------------
function getErrorCorrectionLevel()
{
return $this->level;
}
//----------------------------------------------------------------------
function setErrorCorrectionLevel($level)
{
if($level > QR_ECLEVEL_H) {
throw new Exception('Invalid ECLEVEL');
return -1;
}
$this->level = $level;
return 0;
}
//----------------------------------------------------------------------
function appendEntry(QRinputItem $entry)
{
$this->items[] = $entry;
}
//----------------------------------------------------------------------
function append($mode, $size, $data)
{
try {
$entry = new QRinputItem($mode, $size, $data);
$this->items[] = $entry;
return 0;
} catch (Exception $e) {
return -1;
}
}
//----------------------------------------------------------------------
function insertStructuredAppendHeader($size, $index, $parity)
{
if( $size > MAX_STRUCTURED_SYMBOLS ) {
throw new Exception('insertStructuredAppendHeader wrong size');
}
if( $index <= 0 || $index > MAX_STRUCTURED_SYMBOLS ) {
throw new Exception('insertStructuredAppendHeader wrong index');
}
$buf = array($size, $index, $parity);
try {
$entry = new QRinputItem(QR_MODE_STRUCTURE, 3, buf);
array_unshift($this->items, $entry);
return 0;
} catch (Exception $e) {
return -1;
}
}
//----------------------------------------------------------------------
function calcParity()
{
$parity = 0;
foreach($this->items as $item) {
if($item->mode != QR_MODE_STRUCTURE) {
for($i=$item->size-1; $i>=0; $i--) {
$parity ^= $item->data[$i];
}
}
}
return $parity;
}
//----------------------------------------------------------------------
function checkModeNum($size, $data)
{
for($i=0; $i<$size; $i++) {
if((ord($data[$i]) < ord('0')) || (ord($data[$i]) > ord('9'))){
return false;
}
}
return true;
}
//----------------------------------------------------------------------
function estimateBitsModeNum($size)
{
$w = (int)$size / 3;
$bits = $w * 10;
switch($size - $w * 3) {
case 1:
$bits += 4;
break;
case 2:
$bits += 7;
break;
default:
break;
}
return $bits;
}
//----------------------------------------------------------------------
$anTable = array(
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
36, -1, -1, -1, 37, 38, -1, -1, -1, -1, 39, 40, -1, 41, 42, 43,
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 44, -1, -1, -1, -1, -1,
-1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
);
//----------------------------------------------------------------------
function lookAnTable($c)
{
return (($c > 127)?-1:self::$anTable[$c]);
}
//----------------------------------------------------------------------
function checkModeAn($size, $data)
{
for($i=0; $i<$size; $i++) {
if (self::lookAnTable(ord($data[$i])) == -1) {
return false;
}
}
return true;
}
//----------------------------------------------------------------------
function estimateBitsModeAn($size)
{
$w = (int)($size / 2);
$bits = $w * 11;
if($size & 1) {
$bits += 6;
}
return $bits;
}
//----------------------------------------------------------------------
function estimateBitsMode8($size)
{
return $size * 8;
}
//----------------------------------------------------------------------
function estimateBitsModeKanji($size)
{
return (int)(($size / 2) * 13);
}
//----------------------------------------------------------------------
function checkModeKanji($size, $data)
{
if($size & 1)
return false;
for($i=0; $i<$size; $i+=2) {
$val = (ord($data[$i]) << 8) | ord($data[$i+1]);
if( $val < 0x8140
|| ($val > 0x9ffc && $val < 0xe040)
|| $val > 0xebbf) {
return false;
}
}
return true;
}
/***********************************************************************
* Validation
**********************************************************************/
function check($mode, $size, $data)
{
if($size <= 0)
return false;
switch($mode) {
case QR_MODE_NUM: return self::checkModeNum($size, $data); break;
case QR_MODE_AN: return self::checkModeAn($size, $data); break;
case QR_MODE_KANJI: return self::checkModeKanji($size, $data); break;
case QR_MODE_8: return true; break;
case QR_MODE_STRUCTURE: return true; break;
default:
break;
}
return false;
}
//----------------------------------------------------------------------
function estimateBitStreamSize($version)
{
$bits = 0;
foreach($this->items as $item) {
$bits += $item->estimateBitStreamSizeOfEntry($version);
}
return $bits;
}
//----------------------------------------------------------------------
function estimateVersion()
{
$version = 0;
$prev = 0;
do {
$prev = $version;
$bits = $this->estimateBitStreamSize($prev);
$version = QRspec::getMinimumVersion((int)(($bits + 7) / 8), $this->level);
if ($version < 0) {
return -1;
}
} while ($version > $prev);
return $version;
}
//----------------------------------------------------------------------
function lengthOfCode($mode, $version, $bits)
{
$payload = $bits - 4 - QRspec::lengthIndicator($mode, $version);
switch($mode) {
case QR_MODE_NUM:
$chunks = (int)($payload / 10);
$remain = $payload - $chunks * 10;
$size = $chunks * 3;
if($remain >= 7) {
$size += 2;
} else if($remain >= 4) {
$size += 1;
}
break;
case QR_MODE_AN:
$chunks = (int)($payload / 11);
$remain = $payload - $chunks * 11;
$size = $chunks * 2;
if($remain >= 6)
$size++;
break;
case QR_MODE_8:
$size = (int)($payload / 8);
break;
case QR_MODE_KANJI:
$size = (int)(($payload / 13) * 2);
break;
case QR_MODE_STRUCTURE:
$size = (int)($payload / 8);
break;
default:
$size = 0;
break;
}
$maxsize = QRspec::maximumWords($mode, $version);
if($size < 0) $size = 0;
if($size > $maxsize) $size = $maxsize;
return $size;
}
//----------------------------------------------------------------------
function createBitStream()
{
$total = 0;
foreach($this->items as $item) {
$bits = $item->encodeBitStream($this->version);
if($bits < 0)
return -1;
$total += $bits;
}
return $total;
}
//----------------------------------------------------------------------
function convertData()
{
$ver = $this->estimateVersion();
if($ver > $this->getVersion()) {
$this->setVersion($ver);
}
for(;;) {
$bits = $this->createBitStream();
if($bits < 0)
return -1;
$ver = QRspec::getMinimumVersion((int)(($bits + 7) / 8), $this->level);
if($ver < 0) {
throw new Exception('WRONG VERSION');
return -1;
} else if($ver > $this->getVersion()) {
$this->setVersion($ver);
} else {
break;
}
}
return 0;
}
//----------------------------------------------------------------------
function appendPaddingBit(&$bstream)
{
$bits = $bstream->size();
$maxwords = QRspec::getDataLength($this->version, $this->level);
$maxbits = $maxwords * 8;
if ($maxbits == $bits) {
return 0;
}
if ($maxbits - $bits < 5) {
return $bstream->appendNum($maxbits - $bits, 0);
}
$bits += 4;
$words = (int)(($bits + 7) / 8);
$padding = new QRbitstream();
$ret = $padding->appendNum($words * 8 - $bits + 4, 0);
if($ret < 0)
return $ret;
$padlen = $maxwords - $words;
if($padlen > 0) {
$padbuf = array();
for($i=0; $i<$padlen; $i++) {
$padbuf[$i] = ($i&1)?0x11:0xec;
}
$ret = $padding->appendBytes($padlen, $padbuf);
if($ret < 0)
return $ret;
}
$ret = $bstream->append($padding);
return $ret;
}
//----------------------------------------------------------------------
function mergeBitStream()
{
if($this->convertData() < 0) {
return null;
}
$bstream = new QRbitstream();
foreach($this->items as $item) {
$ret = $bstream->append($item->bstream);
if($ret < 0) {
return null;
}
}
return $bstream;
}
//----------------------------------------------------------------------
function getBitStream()
{
$bstream = $this->mergeBitStream();
if($bstream == null) {
return null;
}
$ret = $this->appendPaddingBit($bstream);
if($ret < 0) {
return null;
}
return $bstream;
}
//----------------------------------------------------------------------
function getByteStream()
{
$bstream = $this->getBitStream();
if($bstream == null) {
return null;
}
return $bstream->toByte();
}
}
\ No newline at end of file
lib/phpqrcode_php4/qrlib.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Root library file, prepares environment and includes dependencies
*
* Based on libqrencode C library distributed under LGPL 2.1
* Copyright (C) 2006, 2007, 2008, 2009 Kentaro Fukuchi <fukuchi@megaui.net>
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
$QR_BASEDIR = dirname(__FILE__).DIRECTORY_SEPARATOR;
// Required libs
include $QR_BASEDIR."qrconst.php";
include $QR_BASEDIR."qrconfig.php";
include $QR_BASEDIR."qrtools.php";
include $QR_BASEDIR."qrspec.php";
include $QR_BASEDIR."qrimage.php";
include $QR_BASEDIR."qrinput.php";
include $QR_BASEDIR."qrbitstream.php";
include $QR_BASEDIR."qrsplit.php";
include $QR_BASEDIR."qrrscode.php";
include $QR_BASEDIR."qrmask.php";
include $QR_BASEDIR."qrencode.php";
lib/phpqrcode_php4/qrmask.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Masking
*
* Based on libqrencode C library distributed under LGPL 2.1
* Copyright (C) 2006, 2007, 2008, 2009 Kentaro Fukuchi <fukuchi@megaui.net>
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
define('N1', 3);
define('N2', 3);
define('N3', 40);
define('N4', 10);
class QRmask {
$runLength = array();
//----------------------------------------------------------------------
function __construct()
{
$this->runLength = array_fill(0, QRSPEC_WIDTH_MAX + 1, 0);
}
//----------------------------------------------------------------------
function writeFormatInformation($width, &$frame, $mask, $level)
{
$blacks = 0;
$format = QRspec::getFormatInfo($mask, $level);
for($i=0; $i<8; $i++) {
if($format & 1) {
$blacks += 2;
$v = 0x85;
} else {
$v = 0x84;
}
$frame[8][$width - 1 - $i] = chr($v);
if($i < 6) {
$frame[$i][8] = chr($v);
} else {
$frame[$i + 1][8] = chr($v);
}
$format = $format >> 1;
}
for($i=0; $i<7; $i++) {
if($format & 1) {
$blacks += 2;
$v = 0x85;
} else {
$v = 0x84;
}
$frame[$width - 7 + $i][8] = chr($v);
if($i == 0) {
$frame[8][7] = chr($v);
} else {
$frame[8][6 - $i] = chr($v);
}
$format = $format >> 1;
}
return $blacks;
}
//----------------------------------------------------------------------
function mask0($x, $y) { return ($x+$y)&1; }
function mask1($x, $y) { return ($y&1); }
function mask2($x, $y) { return ($x%3); }
function mask3($x, $y) { return ($x+$y)%3; }
function mask4($x, $y) { return (((int)($y/2))+((int)($x/3)))&1; }
function mask5($x, $y) { return (($x*$y)&1)+($x*$y)%3; }
function mask6($x, $y) { return ((($x*$y)&1)+($x*$y)%3)&1; }
function mask7($x, $y) { return ((($x*$y)%3)+(($x+$y)&1))&1; }
//----------------------------------------------------------------------
function generateMaskNo($maskNo, $width, $frame)
{
$bitMask = array_fill(0, $width, array_fill(0, $width, 0));
for($y=0; $y<$width; $y++) {
for($x=0; $x<$width; $x++) {
if(ord($frame[$y][$x]) & 0x80) {
$bitMask[$y][$x] = 0;
} else {
$maskFunc = call_user_func(array($this, 'mask'.$maskNo), $x, $y);
$bitMask[$y][$x] = ($maskFunc == 0)?1:0;
}
}
}
return $bitMask;
}
//----------------------------------------------------------------------
function serial($bitFrame)
{
$codeArr = array();
foreach ($bitFrame as $line)
$codeArr[] = join('', $line);
return gzcompress(join("\n", $codeArr), 9);
}
//----------------------------------------------------------------------
function unserial($code)
{
$codeArr = array();
$codeLines = explode("\n", gzuncompress($code));
foreach ($codeLines as $line)
$codeArr[] = str_split($line);
return $codeArr;
}
//----------------------------------------------------------------------
function makeMaskNo($maskNo, $width, $s, &$d, $maskGenOnly = false)
{
$b = 0;
$bitMask = array();
$fileName = QR_CACHE_DIR.'mask_'.$maskNo.DIRECTORY_SEPARATOR.'mask_'.$width.'_'.$maskNo.'.dat';
if (QR_CACHEABLE) {
if (file_exists($fileName)) {
$bitMask = self::unserial(file_get_contents($fileName));
} else {
$bitMask = $this->generateMaskNo($maskNo, $width, $s, $d);
if (!file_exists(QR_CACHE_DIR.'mask_'.$maskNo))
mkdir(QR_CACHE_DIR.'mask_'.$maskNo);
file_put_contents($fileName, self::serial($bitMask));
}
} else {
$bitMask = $this->generateMaskNo($maskNo, $width, $s, $d);
}
if ($maskGenOnly)
return;
$d = $s;
for($y=0; $y<$width; $y++) {
for($x=0; $x<$width; $x++) {
if($bitMask[$y][$x] == 1) {
$d[$y][$x] = chr(ord($s[$y][$x]) ^ (int)$bitMask[$y][$x]);
}
$b += (int)(ord($d[$y][$x]) & 1);
}
}
return $b;
}
//----------------------------------------------------------------------
function makeMask($width, $frame, $maskNo, $level)
{
$masked = array_fill(0, $width, str_repeat("\0", $width));
$this->makeMaskNo($maskNo, $width, $frame, $masked);
$this->writeFormatInformation($width, $masked, $maskNo, $level);
return $masked;
}
//----------------------------------------------------------------------
function calcN1N3($length)
{
$demerit = 0;
for($i=0; $i<$length; $i++) {
if($this->runLength[$i] >= 5) {
$demerit += (N1 + ($this->runLength[$i] - 5));
}
if($i & 1) {
if(($i >= 3) && ($i < ($length-2)) && ($this->runLength[$i] % 3 == 0)) {
$fact = (int)($this->runLength[$i] / 3);
if(($this->runLength[$i-2] == $fact) &&
($this->runLength[$i-1] == $fact) &&
($this->runLength[$i+1] == $fact) &&
($this->runLength[$i+2] == $fact)) {
if(($this->runLength[$i-3] < 0) || ($this->runLength[$i-3] >= (4 * $fact))) {
$demerit += N3;
} else if((($i+3) >= $length) || ($this->runLength[$i+3] >= (4 * $fact))) {
$demerit += N3;
}
}
}
}
}
return $demerit;
}
//----------------------------------------------------------------------
function evaluateSymbol($width, $frame)
{
$head = 0;
$demerit = 0;
for($y=0; $y<$width; $y++) {
$head = 0;
$this->runLength[0] = 1;
$frameY = $frame[$y];
if ($y>0)
$frameYM = $frame[$y-1];
for($x=0; $x<$width; $x++) {
if(($x > 0) && ($y > 0)) {
$b22 = ord($frameY[$x]) & ord($frameY[$x-1]) & ord($frameYM[$x]) & ord($frameYM[$x-1]);
$w22 = ord($frameY[$x]) | ord($frameY[$x-1]) | ord($frameYM[$x]) | ord($frameYM[$x-1]);
if(($b22 | ($w22 ^ 1))&1) {
$demerit += N2;
}
}
if(($x == 0) && (ord($frameY[$x]) & 1)) {
$this->runLength[0] = -1;
$head = 1;
$this->runLength[$head] = 1;
} else if($x > 0) {
if((ord($frameY[$x]) ^ ord($frameY[$x-1])) & 1) {
$head++;
$this->runLength[$head] = 1;
} else {
$this->runLength[$head]++;
}
}
}
$demerit += $this->calcN1N3($head+1);
}
for($x=0; $x<$width; $x++) {
$head = 0;
$this->runLength[0] = 1;
for($y=0; $y<$width; $y++) {
if($y == 0 && (ord($frame[$y][$x]) & 1)) {
$this->runLength[0] = -1;
$head = 1;
$this->runLength[$head] = 1;
} else if($y > 0) {
if((ord($frame[$y][$x]) ^ ord($frame[$y-1][$x])) & 1) {
$head++;
$this->runLength[$head] = 1;
} else {
$this->runLength[$head]++;
}
}
}
$demerit += $this->calcN1N3($head+1);
}
return $demerit;
}
//----------------------------------------------------------------------
function mask($width, $frame, $level)
{
$minDemerit = PHP_INT_MAX;
$bestMaskNum = 0;
$bestMask = array();
$checked_masks = array(0,1,2,3,4,5,6,7);
if (QR_FIND_FROM_RANDOM !== false) {
$howManuOut = 8-(QR_FIND_FROM_RANDOM % 9);
for ($i = 0; $i < $howManuOut; $i++) {
$remPos = rand (0, count($checked_masks)-1);
unset($checked_masks[$remPos]);
$checked_masks = array_values($checked_masks);
}
}
$bestMask = $frame;
foreach($checked_masks as $i) {
$mask = array_fill(0, $width, str_repeat("\0", $width));
$demerit = 0;
$blacks = 0;
$blacks = $this->makeMaskNo($i, $width, $frame, $mask);
$blacks += $this->writeFormatInformation($width, $mask, $i, $level);
$blacks = (int)(100 * $blacks / ($width * $width));
$demerit = (int)((int)(abs($blacks - 50) / 5) * N4);
$demerit += $this->evaluateSymbol($width, $mask);
if($demerit < $minDemerit) {
$minDemerit = $demerit;
$bestMask = $mask;
$bestMaskNum = $i;
}
}
return $bestMask;
}
//----------------------------------------------------------------------
}
lib/phpqrcode_php4/qrrscode.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Reed-Solomon error correction support
*
* Copyright (C) 2002, 2003, 2004, 2006 Phil Karn, KA9Q
* (libfec is released under the GNU Lesser General Public License.)
*
* Based on libqrencode C library distributed under LGPL 2.1
* Copyright (C) 2006, 2007, 2008, 2009 Kentaro Fukuchi <fukuchi@megaui.net>
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
class QRrsItem {
$mm; // Bits per symbol
$nn; // Symbols per block (= (1<<mm)-1)
$alpha_to = array(); // log lookup table
$index_of = array(); // Antilog lookup table
$genpoly = array(); // Generator polynomial
$nroots; // Number of generator roots = number of parity symbols
$fcr; // First consecutive root, index form
$prim; // Primitive element, index form
$iprim; // prim-th root of 1, index form
$pad; // Padding bytes in shortened block
$gfpoly;
//----------------------------------------------------------------------
function modnn($x)
{
while ($x >= $this->nn) {
$x -= $this->nn;
$x = ($x >> $this->mm) + ($x & $this->nn);
}
return $x;
}
//----------------------------------------------------------------------
function init_rs_char($symsize, $gfpoly, $fcr, $prim, $nroots, $pad)
{
// Common code for intializing a Reed-Solomon control block (char or int symbols)
// Copyright 2004 Phil Karn, KA9Q
// May be used under the terms of the GNU Lesser General Public License (LGPL)
$rs = null;
// Check parameter ranges
if($symsize < 0 || $symsize > 8) return $rs;
if($fcr < 0 || $fcr >= (1<<$symsize)) return $rs;
if($prim <= 0 || $prim >= (1<<$symsize)) return $rs;
if($nroots < 0 || $nroots >= (1<<$symsize)) return $rs; // Can't have more roots than symbol values!
if($pad < 0 || $pad >= ((1<<$symsize) -1 - $nroots)) return $rs; // Too much padding
$rs = new QRrsItem();
$rs->mm = $symsize;
$rs->nn = (1<<$symsize)-1;
$rs->pad = $pad;
$rs->alpha_to = array_fill(0, $rs->nn+1, 0);
$rs->index_of = array_fill(0, $rs->nn+1, 0);
// PHP style macro replacement ;)
$NN =& $rs->nn;
$A0 =& $NN;
// Generate Galois field lookup tables
$rs->index_of[0] = $A0; // log(zero) = -inf
$rs->alpha_to[$A0] = 0; // alpha**-inf = 0
$sr = 1;
for($i=0; $i<$rs->nn; $i++) {
$rs->index_of[$sr] = $i;
$rs->alpha_to[$i] = $sr;
$sr <<= 1;
if($sr & (1<<$symsize)) {
$sr ^= $gfpoly;
}
$sr &= $rs->nn;
}
if($sr != 1){
// field generator polynomial is not primitive!
$rs = NULL;
return $rs;
}
/* Form RS code generator polynomial from its roots */
$rs->genpoly = array_fill(0, $nroots+1, 0);
$rs->fcr = $fcr;
$rs->prim = $prim;
$rs->nroots = $nroots;
$rs->gfpoly = $gfpoly;
/* Find prim-th root of 1, used in decoding */
for($iprim=1;($iprim % $prim) != 0;$iprim += $rs->nn)
; // intentional empty-body loop!
$rs->iprim = (int)($iprim / $prim);
$rs->genpoly[0] = 1;
for ($i = 0,$root=$fcr*$prim; $i < $nroots; $i++, $root += $prim) {
$rs->genpoly[$i+1] = 1;
// Multiply rs->genpoly[] by @**(root + x)
for ($j = $i; $j > 0; $j--) {
if ($rs->genpoly[$j] != 0) {
$rs->genpoly[$j] = $rs->genpoly[$j-1] ^ $rs->alpha_to[$rs->modnn($rs->index_of[$rs->genpoly[$j]] + $root)];
} else {
$rs->genpoly[$j] = $rs->genpoly[$j-1];
}
}
// rs->genpoly[0] can never be zero
$rs->genpoly[0] = $rs->alpha_to[$rs->modnn($rs->index_of[$rs->genpoly[0]] + $root)];
}
// convert rs->genpoly[] to index form for quicker encoding
for ($i = 0; $i <= $nroots; $i++)
$rs->genpoly[$i] = $rs->index_of[$rs->genpoly[$i]];
return $rs;
}
//----------------------------------------------------------------------
function encode_rs_char($data, &$parity)
{
$MM =& $this->mm;
$NN =& $this->nn;
$ALPHA_TO =& $this->alpha_to;
$INDEX_OF =& $this->index_of;
$GENPOLY =& $this->genpoly;
$NROOTS =& $this->nroots;
$FCR =& $this->fcr;
$PRIM =& $this->prim;
$IPRIM =& $this->iprim;
$PAD =& $this->pad;
$A0 =& $NN;
$parity = array_fill(0, $NROOTS, 0);
for($i=0; $i< ($NN-$NROOTS-$PAD); $i++) {
$feedback = $INDEX_OF[$data[$i] ^ $parity[0]];
if($feedback != $A0) {
// feedback term is non-zero
// This line is unnecessary when GENPOLY[NROOTS] is unity, as it must
// always be for the polynomials constructed by init_rs()
$feedback = $this->modnn($NN - $GENPOLY[$NROOTS] + $feedback);
for($j=1;$j<$NROOTS;$j++) {
$parity[$j] ^= $ALPHA_TO[$this->modnn($feedback + $GENPOLY[$NROOTS-$j])];
}
}
// Shift
array_shift($parity);
if($feedback != $A0) {
array_push($parity, $ALPHA_TO[$this->modnn($feedback + $GENPOLY[0])]);
} else {
array_push($parity, 0);
}
}
}
}
//##########################################################################
class QRrs {
$items = array();
//----------------------------------------------------------------------
function init_rs($symsize, $gfpoly, $fcr, $prim, $nroots, $pad)
{
foreach(self::$items as $rs) {
if($rs->pad != $pad) continue;
if($rs->nroots != $nroots) continue;
if($rs->mm != $symsize) continue;
if($rs->gfpoly != $gfpoly) continue;
if($rs->fcr != $fcr) continue;
if($rs->prim != $prim) continue;
return $rs;
}
$rs = QRrsItem::init_rs_char($symsize, $gfpoly, $fcr, $prim, $nroots, $pad);
array_unshift(self::$items, $rs);
return $rs;
}
}
\ No newline at end of file
lib/phpqrcode_php4/qrspec.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* QR Code specifications
*
* Based on libqrencode C library distributed under LGPL 2.1
* Copyright (C) 2006, 2007, 2008, 2009 Kentaro Fukuchi <fukuchi@megaui.net>
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* The following data / specifications are taken from
* "Two dimensional symbol -- QR-code -- Basic Specification" (JIS X0510:2004)
* or
* "Automatic identification and data capture techniques --
* QR Code 2005 bar code symbology specification" (ISO/IEC 18004:2006)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
define('QRSPEC_VERSION_MAX', 40);
define('QRSPEC_WIDTH_MAX', 177);
define('QRCAP_WIDTH', 0);
define('QRCAP_WORDS', 1);
define('QRCAP_REMINDER', 2);
define('QRCAP_EC', 3);
class QRspec {
$capacity = array(
array( 0, 0, 0, array( 0, 0, 0, 0)),
array( 21, 26, 0, array( 7, 10, 13, 17)), // 1
array( 25, 44, 7, array( 10, 16, 22, 28)),
array( 29, 70, 7, array( 15, 26, 36, 44)),
array( 33, 100, 7, array( 20, 36, 52, 64)),
array( 37, 134, 7, array( 26, 48, 72, 88)), // 5
array( 41, 172, 7, array( 36, 64, 96, 112)),
array( 45, 196, 0, array( 40, 72, 108, 130)),
array( 49, 242, 0, array( 48, 88, 132, 156)),
array( 53, 292, 0, array( 60, 110, 160, 192)),
array( 57, 346, 0, array( 72, 130, 192, 224)), //10
array( 61, 404, 0, array( 80, 150, 224, 264)),
array( 65, 466, 0, array( 96, 176, 260, 308)),
array( 69, 532, 0, array( 104, 198, 288, 352)),
array( 73, 581, 3, array( 120, 216, 320, 384)),
array( 77, 655, 3, array( 132, 240, 360, 432)), //15
array( 81, 733, 3, array( 144, 280, 408, 480)),
array( 85, 815, 3, array( 168, 308, 448, 532)),
array( 89, 901, 3, array( 180, 338, 504, 588)),
array( 93, 991, 3, array( 196, 364, 546, 650)),
array( 97, 1085, 3, array( 224, 416, 600, 700)), //20
array(101, 1156, 4, array( 224, 442, 644, 750)),
array(105, 1258, 4, array( 252, 476, 690, 816)),
array(109, 1364, 4, array( 270, 504, 750, 900)),
array(113, 1474, 4, array( 300, 560, 810, 960)),
array(117, 1588, 4, array( 312, 588, 870, 1050)), //25
array(121, 1706, 4, array( 336, 644, 952, 1110)),
array(125, 1828, 4, array( 360, 700, 1020, 1200)),
array(129, 1921, 3, array( 390, 728, 1050, 1260)),
array(133, 2051, 3, array( 420, 784, 1140, 1350)),
array(137, 2185, 3, array( 450, 812, 1200, 1440)), //30
array(141, 2323, 3, array( 480, 868, 1290, 1530)),
array(145, 2465, 3, array( 510, 924, 1350, 1620)),
array(149, 2611, 3, array( 540, 980, 1440, 1710)),
array(153, 2761, 3, array( 570, 1036, 1530, 1800)),
array(157, 2876, 0, array( 570, 1064, 1590, 1890)), //35
array(161, 3034, 0, array( 600, 1120, 1680, 1980)),
array(165, 3196, 0, array( 630, 1204, 1770, 2100)),
array(169, 3362, 0, array( 660, 1260, 1860, 2220)),
array(173, 3532, 0, array( 720, 1316, 1950, 2310)),
array(177, 3706, 0, array( 750, 1372, 2040, 2430)) //40
);
//----------------------------------------------------------------------
function getDataLength($version, $level)
{
return self::$capacity[$version][QRCAP_WORDS] - self::$capacity[$version][QRCAP_EC][$level];
}
//----------------------------------------------------------------------
function getECCLength($version, $level)
{
return self::$capacity[$version][QRCAP_EC][$level];
}
//----------------------------------------------------------------------
function getWidth($version)
{
return self::$capacity[$version][QRCAP_WIDTH];
}
//----------------------------------------------------------------------
function getRemainder($version)
{
return self::$capacity[$version][QRCAP_REMINDER];
}
//----------------------------------------------------------------------
function getMinimumVersion($size, $level)
{
for($i=1; $i<= QRSPEC_VERSION_MAX; $i++) {
$words = self::$capacity[$i][QRCAP_WORDS] - self::$capacity[$i][QRCAP_EC][$level];
if($words >= $size)
return $i;
}
return -1;
}
//######################################################################
$lengthTableBits = array(
array(10, 12, 14),
array( 9, 11, 13),
array( 8, 16, 16),
array( 8, 10, 12)
);
//----------------------------------------------------------------------
function lengthIndicator($mode, $version)
{
if ($mode == QR_MODE_STRUCTURE)
return 0;
if ($version <= 9) {
$l = 0;
} else if ($version <= 26) {
$l = 1;
} else {
$l = 2;
}
return self::$lengthTableBits[$mode][$l];
}
//----------------------------------------------------------------------
function maximumWords($mode, $version)
{
if($mode == QR_MODE_STRUCTURE)
return 3;
if($version <= 9) {
$l = 0;
} else if($version <= 26) {
$l = 1;
} else {
$l = 2;
}
$bits = self::$lengthTableBits[$mode][$l];
$words = (1 << $bits) - 1;
if($mode == QR_MODE_KANJI) {
$words *= 2; // the number of bytes is required
}
return $words;
}
// Error correction code -----------------------------------------------
// Table of the error correction code (Reed-Solomon block)
// See Table 12-16 (pp.30-36), JIS X0510:2004.
$eccTable = array(
array(array( 0, 0), array( 0, 0), array( 0, 0), array( 0, 0)),
array(array( 1, 0), array( 1, 0), array( 1, 0), array( 1, 0)), // 1
array(array( 1, 0), array( 1, 0), array( 1, 0), array( 1, 0)),
array(array( 1, 0), array( 1, 0), array( 2, 0), array( 2, 0)),
array(array( 1, 0), array( 2, 0), array( 2, 0), array( 4, 0)),
array(array( 1, 0), array( 2, 0), array( 2, 2), array( 2, 2)), // 5
array(array( 2, 0), array( 4, 0), array( 4, 0), array( 4, 0)),
array(array( 2, 0), array( 4, 0), array( 2, 4), array( 4, 1)),
array(array( 2, 0), array( 2, 2), array( 4, 2), array( 4, 2)),
array(array( 2, 0), array( 3, 2), array( 4, 4), array( 4, 4)),
array(array( 2, 2), array( 4, 1), array( 6, 2), array( 6, 2)), //10
array(array( 4, 0), array( 1, 4), array( 4, 4), array( 3, 8)),
array(array( 2, 2), array( 6, 2), array( 4, 6), array( 7, 4)),
array(array( 4, 0), array( 8, 1), array( 8, 4), array(12, 4)),
array(array( 3, 1), array( 4, 5), array(11, 5), array(11, 5)),
array(array( 5, 1), array( 5, 5), array( 5, 7), array(11, 7)), //15
array(array( 5, 1), array( 7, 3), array(15, 2), array( 3, 13)),
array(array( 1, 5), array(10, 1), array( 1, 15), array( 2, 17)),
array(array( 5, 1), array( 9, 4), array(17, 1), array( 2, 19)),
array(array( 3, 4), array( 3, 11), array(17, 4), array( 9, 16)),
array(array( 3, 5), array( 3, 13), array(15, 5), array(15, 10)), //20
array(array( 4, 4), array(17, 0), array(17, 6), array(19, 6)),
array(array( 2, 7), array(17, 0), array( 7, 16), array(34, 0)),
array(array( 4, 5), array( 4, 14), array(11, 14), array(16, 14)),
array(array( 6, 4), array( 6, 14), array(11, 16), array(30, 2)),
array(array( 8, 4), array( 8, 13), array( 7, 22), array(22, 13)), //25
array(array(10, 2), array(19, 4), array(28, 6), array(33, 4)),
array(array( 8, 4), array(22, 3), array( 8, 26), array(12, 28)),
array(array( 3, 10), array( 3, 23), array( 4, 31), array(11, 31)),
array(array( 7, 7), array(21, 7), array( 1, 37), array(19, 26)),
array(array( 5, 10), array(19, 10), array(15, 25), array(23, 25)), //30
array(array(13, 3), array( 2, 29), array(42, 1), array(23, 28)),
array(array(17, 0), array(10, 23), array(10, 35), array(19, 35)),
array(array(17, 1), array(14, 21), array(29, 19), array(11, 46)),
array(array(13, 6), array(14, 23), array(44, 7), array(59, 1)),
array(array(12, 7), array(12, 26), array(39, 14), array(22, 41)), //35
array(array( 6, 14), array( 6, 34), array(46, 10), array( 2, 64)),
array(array(17, 4), array(29, 14), array(49, 10), array(24, 46)),
array(array( 4, 18), array(13, 32), array(48, 14), array(42, 32)),
array(array(20, 4), array(40, 7), array(43, 22), array(10, 67)),
array(array(19, 6), array(18, 31), array(34, 34), array(20, 61)),//40
);
//----------------------------------------------------------------------
// CACHEABLE!!!
function getEccSpec($version, $level, array &$spec)
{
if (count($spec) < 5) {
$spec = array(0,0,0,0,0);
}
$b1 = self::$eccTable[$version][$level][0];
$b2 = self::$eccTable[$version][$level][1];
$data = self::getDataLength($version, $level);
$ecc = self::getECCLength($version, $level);
if($b2 == 0) {
$spec[0] = $b1;
$spec[1] = (int)($data / $b1);
$spec[2] = (int)($ecc / $b1);
$spec[3] = 0;
$spec[4] = 0;
} else {
$spec[0] = $b1;
$spec[1] = (int)($data / ($b1 + $b2));
$spec[2] = (int)($ecc / ($b1 + $b2));
$spec[3] = $b2;
$spec[4] = $spec[1] + 1;
}
}
// Alignment pattern ---------------------------------------------------
// Positions of alignment patterns.
// 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.
// See Table 1 in Appendix E (pp.71) of JIS X0510:2004.
$alignmentPattern = array(
array( 0, 0),
array( 0, 0), array(18, 0), array(22, 0), array(26, 0), array(30, 0), // 1- 5
array(34, 0), array(22, 38), array(24, 42), array(26, 46), array(28, 50), // 6-10
array(30, 54), array(32, 58), array(34, 62), array(26, 46), array(26, 48), //11-15
array(26, 50), array(30, 54), array(30, 56), array(30, 58), array(34, 62), //16-20
array(28, 50), array(26, 50), array(30, 54), array(28, 54), array(32, 58), //21-25
array(30, 58), array(34, 62), array(26, 50), array(30, 54), array(26, 52), //26-30
array(30, 56), array(34, 60), array(30, 58), array(34, 62), array(30, 54), //31-35
array(24, 50), array(28, 54), array(32, 58), array(26, 54), array(30, 58), //35-40
);
/** --------------------------------------------------------------------
* Put an alignment marker.
* @param frame
* @param width
* @param ox,oy center coordinate of the pattern
*/
function putAlignmentMarker(array &$frame, $ox, $oy)
{
$finder = array(
"\xa1\xa1\xa1\xa1\xa1",
"\xa1\xa0\xa0\xa0\xa1",
"\xa1\xa0\xa1\xa0\xa1",
"\xa1\xa0\xa0\xa0\xa1",
"\xa1\xa1\xa1\xa1\xa1"
);
$yStart = $oy-2;
$xStart = $ox-2;
for($y=0; $y<5; $y++) {
QRstr::set($frame, $xStart, $yStart+$y, $finder[$y]);
}
}
//----------------------------------------------------------------------
function putAlignmentPattern($version, &$frame, $width)
{
if($version < 2)
return;
$d = self::$alignmentPattern[$version][1] - self::$alignmentPattern[$version][0];
if($d < 0) {
$w = 2;
} else {
$w = (int)(($width - self::$alignmentPattern[$version][0]) / $d + 2);
}
if($w * $w - 3 == 1) {
$x = self::$alignmentPattern[$version][0];
$y = self::$alignmentPattern[$version][0];
self::putAlignmentMarker($frame, $x, $y);
return;
}
$cx = self::$alignmentPattern[$version][0];
for($x=1; $x<$w - 1; $x++) {
self::putAlignmentMarker($frame, 6, $cx);
self::putAlignmentMarker($frame, $cx, 6);
$cx += $d;
}
$cy = self::$alignmentPattern[$version][0];
for($y=0; $y<$w-1; $y++) {
$cx = self::$alignmentPattern[$version][0];
for($x=0; $x<$w-1; $x++) {
self::putAlignmentMarker($frame, $cx, $cy);
$cx += $d;
}
$cy += $d;
}
}
// Version information pattern -----------------------------------------
// Version information pattern (BCH coded).
// See Table 1 in Appendix D (pp.68) of JIS X0510:2004.
// size: [QRSPEC_VERSION_MAX - 6]
$versionPattern = array(
0x07c94, 0x085bc, 0x09a99, 0x0a4d3, 0x0bbf6, 0x0c762, 0x0d847, 0x0e60d,
0x0f928, 0x10b78, 0x1145d, 0x12a17, 0x13532, 0x149a6, 0x15683, 0x168c9,
0x177ec, 0x18ec4, 0x191e1, 0x1afab, 0x1b08e, 0x1cc1a, 0x1d33f, 0x1ed75,
0x1f250, 0x209d5, 0x216f0, 0x228ba, 0x2379f, 0x24b0b, 0x2542e, 0x26a64,
0x27541, 0x28c69
);
//----------------------------------------------------------------------
function getVersionPattern($version)
{
if($version < 7 || $version > QRSPEC_VERSION_MAX)
return 0;
return self::$versionPattern[$version -7];
}
// Format information --------------------------------------------------
// See calcFormatInfo in tests/test_qrspec.c (orginal qrencode c lib)
$formatInfo = array(
array(0x77c4, 0x72f3, 0x7daa, 0x789d, 0x662f, 0x6318, 0x6c41, 0x6976),
array(0x5412, 0x5125, 0x5e7c, 0x5b4b, 0x45f9, 0x40ce, 0x4f97, 0x4aa0),
array(0x355f, 0x3068, 0x3f31, 0x3a06, 0x24b4, 0x2183, 0x2eda, 0x2bed),
array(0x1689, 0x13be, 0x1ce7, 0x19d0, 0x0762, 0x0255, 0x0d0c, 0x083b)
);
function getFormatInfo($mask, $level)
{
if($mask < 0 || $mask > 7)
return 0;
if($level < 0 || $level > 3)
return 0;
return self::$formatInfo[$level][$mask];
}
// Frame ---------------------------------------------------------------
// Cache of initial frames.
$frames = array();
/** --------------------------------------------------------------------
* Put a finder pattern.
* @param frame
* @param width
* @param ox,oy upper-left coordinate of the pattern
*/
function putFinderPattern(&$frame, $ox, $oy)
{
$finder = array(
"\xc1\xc1\xc1\xc1\xc1\xc1\xc1",
"\xc1\xc0\xc0\xc0\xc0\xc0\xc1",
"\xc1\xc0\xc1\xc1\xc1\xc0\xc1",
"\xc1\xc0\xc1\xc1\xc1\xc0\xc1",
"\xc1\xc0\xc1\xc1\xc1\xc0\xc1",
"\xc1\xc0\xc0\xc0\xc0\xc0\xc1",
"\xc1\xc1\xc1\xc1\xc1\xc1\xc1"
);
for($y=0; $y<7; $y++) {
QRstr::set($frame, $ox, $oy+$y, $finder[$y]);
}
}
//----------------------------------------------------------------------
function createFrame($version)
{
$width = self::$capacity[$version][QRCAP_WIDTH];
$frameLine = str_repeat ("\0", $width);
$frame = array_fill(0, $width, $frameLine);
// Finder pattern
self::putFinderPattern($frame, 0, 0);
self::putFinderPattern($frame, $width - 7, 0);
self::putFinderPattern($frame, 0, $width - 7);
// Separator
$yOffset = $width - 7;
for($y=0; $y<7; $y++) {
$frame[$y][7] = "\xc0";
$frame[$y][$width - 8] = "\xc0";
$frame[$yOffset][7] = "\xc0";
$yOffset++;
}
$setPattern = str_repeat("\xc0", 8);
QRstr::set($frame, 0, 7, $setPattern);
QRstr::set($frame, $width-8, 7, $setPattern);
QRstr::set($frame, 0, $width - 8, $setPattern);
// Format info
$setPattern = str_repeat("\x84", 9);
QRstr::set($frame, 0, 8, $setPattern);
QRstr::set($frame, $width - 8, 8, $setPattern, 8);
$yOffset = $width - 8;
for($y=0; $y<8; $y++,$yOffset++) {
$frame[$y][8] = "\x84";
$frame[$yOffset][8] = "\x84";
}
// Timing pattern
for($i=1; $i<$width-15; $i++) {
$frame[6][7+$i] = chr(0x90 | ($i & 1));
$frame[7+$i][6] = chr(0x90 | ($i & 1));
}
// Alignment pattern
self::putAlignmentPattern($version, $frame, $width);
// Version information
if($version >= 7) {
$vinf = self::getVersionPattern($version);
$v = $vinf;
for($x=0; $x<6; $x++) {
for($y=0; $y<3; $y++) {
$frame[($width - 11)+$y][$x] = chr(0x88 | ($v & 1));
$v = $v >> 1;
}
}
$v = $vinf;
for($y=0; $y<6; $y++) {
for($x=0; $x<3; $x++) {
$frame[$y][$x+($width - 11)] = chr(0x88 | ($v & 1));
$v = $v >> 1;
}
}
}
// and a little bit...
$frame[$width - 8][8] = "\x81";
return $frame;
}
//----------------------------------------------------------------------
function debug($frame, $binary_mode = false)
{
if ($binary_mode) {
foreach ($frame as &$frameLine) {
$frameLine = join('<span class="m">&nbsp;&nbsp;</span>', explode('0', $frameLine));
$frameLine = join('&#9608;&#9608;', explode('1', $frameLine));
}
?>
<style>
.m { background-color: white; }
</style>
<?php
echo '<pre><tt><br/ ><br/ ><br/ >&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;';
echo join("<br/ >&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;", $frame);
echo '</tt></pre><br/ ><br/ ><br/ ><br/ ><br/ ><br/ >';
} else {
foreach ($frame as &$frameLine) {
$frameLine = join('<span class="m">&nbsp;</span>', explode("\xc0", $frameLine));
$frameLine = join('<span class="m">&#9618;</span>', explode("\xc1", $frameLine));
$frameLine = join('<span class="p">&nbsp;</span>', explode("\xa0", $frameLine));
$frameLine = join('<span class="p">&#9618;</span>', explode("\xa1", $frameLine));
$frameLine = join('<span class="s">&#9671;</span>', explode("\x84", $frameLine)); //format 0
$frameLine = join('<span class="s">&#9670;</span>', explode("\x85", $frameLine)); //format 1
$frameLine = join('<span class="x">&#9762;</span>', explode("\x81", $frameLine)); //special bit
$frameLine = join('<span class="c">&nbsp;</span>', explode("\x90", $frameLine)); //clock 0
$frameLine = join('<span class="c">&#9719;</span>', explode("\x91", $frameLine)); //clock 1
$frameLine = join('<span class="f">&nbsp;</span>', explode("\x88", $frameLine)); //version
$frameLine = join('<span class="f">&#9618;</span>', explode("\x89", $frameLine)); //version
$frameLine = join('&#9830;', explode("\x01", $frameLine));
$frameLine = join('&#8901;', explode("\0", $frameLine));
}
?>
<style>
.p { background-color: yellow; }
.m { background-color: #00FF00; }
.s { background-color: #FF0000; }
.c { background-color: aqua; }
.x { background-color: pink; }
.f { background-color: gold; }
</style>
<?php
echo "<pre><tt>";
echo join("<br/ >", $frame);
echo "</tt></pre>";
}
}
//----------------------------------------------------------------------
function serial($frame)
{
return gzcompress(join("\n", $frame), 9);
}
//----------------------------------------------------------------------
function unserial($code)
{
return explode("\n", gzuncompress($code));
}
//----------------------------------------------------------------------
function newFrame($version)
{
if($version < 1 || $version > QRSPEC_VERSION_MAX)
return null;
if(!isset(self::$frames[$version])) {
$fileName = QR_CACHE_DIR.'frame_'.$version.'.dat';
if (QR_CACHEABLE) {
if (file_exists($fileName)) {
self::$frames[$version] = self::unserial(file_get_contents($fileName));
} else {
self::$frames[$version] = self::createFrame($version);
file_put_contents($fileName, self::serial(self::$frames[$version]));
}
} else {
self::$frames[$version] = self::createFrame($version);
}
}
if(is_null(self::$frames[$version]))
return null;
return self::$frames[$version];
}
//----------------------------------------------------------------------
function rsBlockNum($spec) { return $spec[0] + $spec[3]; }
function rsBlockNum1($spec) { return $spec[0]; }
function rsDataCodes1($spec) { return $spec[1]; }
function rsEccCodes1($spec) { return $spec[2]; }
function rsBlockNum2($spec) { return $spec[3]; }
function rsDataCodes2($spec) { return $spec[4]; }
function rsEccCodes2($spec) { return $spec[2]; }
function rsDataLength($spec) { return ($spec[0] * $spec[1]) + ($spec[3] * $spec[4]); }
function rsEccLength($spec) { return ($spec[0] + $spec[3]) * $spec[2]; }
}
\ No newline at end of file
lib/phpqrcode_php4/qrsplit.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Input splitting classes
*
* Based on libqrencode C library distributed under LGPL 2.1
* Copyright (C) 2006, 2007, 2008, 2009 Kentaro Fukuchi <fukuchi@megaui.net>
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* The following data / specifications are taken from
* "Two dimensional symbol -- QR-code -- Basic Specification" (JIS X0510:2004)
* or
* "Automatic identification and data capture techniques --
* QR Code 2005 bar code symbology specification" (ISO/IEC 18004:2006)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
class QRsplit {
$dataStr = '';
$input;
$modeHint;
//----------------------------------------------------------------------
function __construct($dataStr, $input, $modeHint)
{
$this->dataStr = $dataStr;
$this->input = $input;
$this->modeHint = $modeHint;
}
//----------------------------------------------------------------------
function isdigitat($str, $pos)
{
if ($pos >= strlen($str))
return false;
return ((ord($str[$pos]) >= ord('0'))&&(ord($str[$pos]) <= ord('9')));
}
//----------------------------------------------------------------------
function isalnumat($str, $pos)
{
if ($pos >= strlen($str))
return false;
return (QRinput::lookAnTable(ord($str[$pos])) >= 0);
}
//----------------------------------------------------------------------
function identifyMode($pos)
{
if ($pos >= strlen($this->dataStr))
return QR_MODE_NUL;
$c = $this->dataStr[$pos];
if(self::isdigitat($this->dataStr, $pos)) {
return QR_MODE_NUM;
} else if(self::isalnumat($this->dataStr, $pos)) {
return QR_MODE_AN;
} else if($this->modeHint == QR_MODE_KANJI) {
if ($pos+1 < strlen($this->dataStr))
{
$d = $this->dataStr[$pos+1];
$word = (ord($c) << 8) | ord($d);
if(($word >= 0x8140 && $word <= 0x9ffc) || ($word >= 0xe040 && $word <= 0xebbf)) {
return QR_MODE_KANJI;
}
}
}
return QR_MODE_8;
}
//----------------------------------------------------------------------
function eatNum()
{
$ln = QRspec::lengthIndicator(QR_MODE_NUM, $this->input->getVersion());
$p = 0;
while(self::isdigitat($this->dataStr, $p)) {
$p++;
}
$run = $p;
$mode = $this->identifyMode($p);
if($mode == QR_MODE_8) {
$dif = QRinput::estimateBitsModeNum($run) + 4 + $ln
+ QRinput::estimateBitsMode8(1) // + 4 + l8
- QRinput::estimateBitsMode8($run + 1); // - 4 - l8
if($dif > 0) {
return $this->eat8();
}
}
if($mode == QR_MODE_AN) {
$dif = QRinput::estimateBitsModeNum($run) + 4 + $ln
+ QRinput::estimateBitsModeAn(1) // + 4 + la
- QRinput::estimateBitsModeAn($run + 1);// - 4 - la
if($dif > 0) {
return $this->eatAn();
}
}
$ret = $this->input->append(QR_MODE_NUM, $run, str_split($this->dataStr));
if($ret < 0)
return -1;
return $run;
}
//----------------------------------------------------------------------
function eatAn()
{
$la = QRspec::lengthIndicator(QR_MODE_AN, $this->input->getVersion());
$ln = QRspec::lengthIndicator(QR_MODE_NUM, $this->input->getVersion());
$p = 0;
while(self::isalnumat($this->dataStr, $p)) {
if(self::isdigitat($this->dataStr, $p)) {
$q = $p;
while(self::isdigitat($this->dataStr, $q)) {
$q++;
}
$dif = QRinput::estimateBitsModeAn($p) // + 4 + la
+ QRinput::estimateBitsModeNum($q - $p) + 4 + $ln
- QRinput::estimateBitsModeAn($q); // - 4 - la
if($dif < 0) {
break;
} else {
$p = $q;
}
} else {
$p++;
}
}
$run = $p;
if(!self::isalnumat($this->dataStr, $p)) {
$dif = QRinput::estimateBitsModeAn($run) + 4 + $la
+ QRinput::estimateBitsMode8(1) // + 4 + l8
- QRinput::estimateBitsMode8($run + 1); // - 4 - l8
if($dif > 0) {
return $this->eat8();
}
}
$ret = $this->input->append(QR_MODE_AN, $run, str_split($this->dataStr));
if($ret < 0)
return -1;
return $run;
}
//----------------------------------------------------------------------
function eatKanji()
{
$p = 0;
while($this->identifyMode($p) == QR_MODE_KANJI) {
$p += 2;
}
$ret = $this->input->append(QR_MODE_KANJI, $p, str_split($this->dataStr));
if($ret < 0)
return -1;
return $run;
}
//----------------------------------------------------------------------
function eat8()
{
$la = QRspec::lengthIndicator(QR_MODE_AN, $this->input->getVersion());
$ln = QRspec::lengthIndicator(QR_MODE_NUM, $this->input->getVersion());
$p = 1;
$dataStrLen = strlen($this->dataStr);
while($p < $dataStrLen) {
$mode = $this->identifyMode($p);
if($mode == QR_MODE_KANJI) {
break;
}
if($mode == QR_MODE_NUM) {
$q = $p;
while(self::isdigitat($this->dataStr, $q)) {
$q++;
}
$dif = QRinput::estimateBitsMode8($p) // + 4 + l8
+ QRinput::estimateBitsModeNum($q - $p) + 4 + $ln
- QRinput::estimateBitsMode8($q); // - 4 - l8
if($dif < 0) {
break;
} else {
$p = $q;
}
} else if($mode == QR_MODE_AN) {
$q = $p;
while(self::isalnumat($this->dataStr, $q)) {
$q++;
}
$dif = QRinput::estimateBitsMode8($p) // + 4 + l8
+ QRinput::estimateBitsModeAn($q - $p) + 4 + $la
- QRinput::estimateBitsMode8($q); // - 4 - l8
if($dif < 0) {
break;
} else {
$p = $q;
}
} else {
$p++;
}
}
$run = $p;
$ret = $this->input->append(QR_MODE_8, $run, str_split($this->dataStr));
if($ret < 0)
return -1;
return $run;
}
//----------------------------------------------------------------------
function splitString()
{
while (strlen($this->dataStr) > 0)
{
if($this->dataStr == '')
return 0;
$mode = $this->identifyMode(0);
switch ($mode) {
case QR_MODE_NUM: $length = $this->eatNum(); break;
case QR_MODE_AN: $length = $this->eatAn(); break;
case QR_MODE_KANJI:
if ($hint == QR_MODE_KANJI)
$length = $this->eatKanji();
else $length = $this->eat8();
break;
default: $length = $this->eat8(); break;
}
if($length == 0) return 0;
if($length < 0) return -1;
$this->dataStr = substr($this->dataStr, $length);
}
}
//----------------------------------------------------------------------
function toUpper()
{
$stringLen = strlen($this->dataStr);
$p = 0;
while ($p<$stringLen) {
$mode = self::identifyMode(substr($this->dataStr, $p), $this->modeHint);
if($mode == QR_MODE_KANJI) {
$p += 2;
} else {
if (ord($this->dataStr[$p]) >= ord('a') && ord($this->dataStr[$p]) <= ord('z')) {
$this->dataStr[$p] = chr(ord($this->dataStr[$p]) - 32);
}
$p++;
}
}
return $this->dataStr;
}
//----------------------------------------------------------------------
function splitStringToQRinput($string, QRinput $input, $modeHint, $casesensitive = true)
{
if(is_null($string) || $string == '\0' || $string == '') {
throw new Exception('empty string!!!');
}
$split = new QRsplit($string, $input, $modeHint);
if(!$casesensitive)
$split->toUpper();
return $split->splitString();
}
}
\ No newline at end of file
lib/phpqrcode_php4/qrtools.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Toolset, handy and debug utilites.
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
class QRtools {
//----------------------------------------------------------------------
function binarize($frame)
{
$len = count($frame);
foreach ($frame as &$frameLine) {
for($i=0; $i<$len; $i++) {
$frameLine[$i] = (ord($frameLine[$i])&1)?'1':'0';
}
}
return $frame;
}
//----------------------------------------------------------------------
function tcpdfBarcodeArray($code, $mode = 'QR,L', $tcPdfVersion = '4.5.037')
{
$barcode_array = array();
if (!is_array($mode))
$mode = explode(',', $mode);
$eccLevel = 'L';
if (count($mode) > 1) {
$eccLevel = $mode[1];
}
$qrTab = QRcode::text($code, false, $eccLevel);
$size = count($qrTab);
$barcode_array['num_rows'] = $size;
$barcode_array['num_cols'] = $size;
$barcode_array['bcode'] = array();
foreach ($qrTab as $line) {
$arrAdd = array();
foreach(str_split($line) as $char)
$arrAdd[] = ($char=='1')?1:0;
$barcode_array['bcode'][] = $arrAdd;
}
return $barcode_array;
}
//----------------------------------------------------------------------
function clearCache()
{
self::$frames = array();
}
//----------------------------------------------------------------------
function buildCache()
{
QRtools::markTime('before_build_cache');
$mask = new QRmask();
for ($a=1; $a <= QRSPEC_VERSION_MAX; $a++) {
$frame = QRspec::newFrame($a);
if (QR_IMAGE) {
$fileName = QR_CACHE_DIR.'frame_'.$a.'.png';
QRimage::png(self::binarize($frame), $fileName, 1, 0);
}
$width = count($frame);
$bitMask = array_fill(0, $width, array_fill(0, $width, 0));
for ($maskNo=0; $maskNo<8; $maskNo++)
$mask->makeMaskNo($maskNo, $width, $frame, $bitMask, true);
}
QRtools::markTime('after_build_cache');
}
//----------------------------------------------------------------------
function log($outfile, $err)
{
if (QR_LOG_DIR !== false) {
if ($err != '') {
if ($outfile !== false) {
file_put_contents(QR_LOG_DIR.basename($outfile).'-errors.txt', date('Y-m-d H:i:s').': '.$err, FILE_APPEND);
} else {
file_put_contents(QR_LOG_DIR.'errors.txt', date('Y-m-d H:i:s').': '.$err, FILE_APPEND);
}
}
}
}
//----------------------------------------------------------------------
function dumpMask($frame)
{
$width = count($frame);
for($y=0;$y<$width;$y++) {
for($x=0;$x<$width;$x++) {
echo ord($frame[$y][$x]).',';
}
}
}
//----------------------------------------------------------------------
function markTime($markerId)
{
list($usec, $sec) = explode(" ", microtime());
$time = ((float)$usec + (float)$sec);
if (!isset($GLOBALS['qr_time_bench']))
$GLOBALS['qr_time_bench'] = array();
$GLOBALS['qr_time_bench'][$markerId] = $time;
}
//----------------------------------------------------------------------
function timeBenchmark()
{
self::markTime('finish');
$lastTime = 0;
$startTime = 0;
$p = 0;
echo '<table cellpadding="3" cellspacing="1">
<thead><tr style="border-bottom:1px solid silver"><td colspan="2" style="text-align:center">BENCHMARK</td></tr></thead>
<tbody>';
foreach($GLOBALS['qr_time_bench'] as $markerId=>$thisTime) {
if ($p > 0) {
echo '<tr><th style="text-align:right">till '.$markerId.': </th><td>'.number_format($thisTime-$lastTime, 6).'s</td></tr>';
} else {
$startTime = $thisTime;
}
$p++;
$lastTime = $thisTime;
}
echo '</tbody><tfoot>
<tr style="border-top:2px solid black"><th style="text-align:right">TOTAL: </th><td>'.number_format($lastTime-$startTime, 6).'s</td></tr>
</tfoot>
</table>';
}
}
//##########################################################################
QRtools::markTime('start');
\ No newline at end of file
lib/phpqrcode_php4/tools/merge.bat 0 → 100644
php ./merge.php
pause
\ No newline at end of file
lib/phpqrcode_php4/tools/merge.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Tool for merging all library files into one, simpler to incorporate.
*
* MAKE SURE THAT RESULTING PHPQRCode.php (and its dir) ARE WRITABLE!
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
$QR_BASEDIR = dirname(__FILE__).DIRECTORY_SEPARATOR.'..'.DIRECTORY_SEPARATOR;
$QR_TOOLSDIR = dirname(__FILE__).DIRECTORY_SEPARATOR;
$outputFile = $QR_BASEDIR.'phpqrcode.php';
// Required libs
$fileList = array(
$QR_BASEDIR.'qrconst.php',
$QR_TOOLSDIR.'merged_config.php',
$QR_BASEDIR.'qrtools.php',
$QR_BASEDIR.'qrspec.php',
$QR_BASEDIR.'qrimage.php',
$QR_BASEDIR.'qrinput.php',
$QR_BASEDIR.'qrbitstream.php',
$QR_BASEDIR.'qrsplit.php',
$QR_BASEDIR.'qrrscode.php',
$QR_BASEDIR.'qrmask.php',
$QR_BASEDIR.'qrencode.php'
);
$headerFile = $QR_TOOLSDIR.'merged_header.php';
$versionFile = $QR_BASEDIR.'VERSION';
$outputCode = '';
foreach($fileList as $fileName) {
$outputCode .= "\n\n".'//---- '.basename($fileName).' -----------------------------'."\n\n";
$anotherCode = file_get_contents($fileName);
$anotherCode = preg_replace ('/^<\?php/', '', $anotherCode);
$anotherCode = preg_replace ('/\?>\*$/', '', $anotherCode);
$outputCode .= "\n\n".$anotherCode."\n\n";
}
$versionDataEx = explode("\n", file_get_contents($versionFile));
$outputContents = file_get_contents($headerFile);
$outputContents .= "\n\n/*\n * Version: ".trim($versionDataEx[0])."\n * Build: ".trim($versionDataEx[1])."\n */\n\n";
$outputContents .= $outputCode;
file_put_contents($outputFile, $outputContents);
\ No newline at end of file
lib/phpqrcode_php4/tools/merge.sh 0 → 100644
#!/bin/sh
php ./merge.php
\ No newline at end of file
lib/phpqrcode_php4/tools/merged_config.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* Config file, tuned-up for merged verion
*/
define('QR_CACHEABLE', false); // use cache - more disk reads but less CPU power, masks and format templates are stored there
define('QR_CACHE_DIR', false); // used when QR_CACHEABLE === true
define('QR_LOG_DIR', false); // default error logs dir
define('QR_FIND_BEST_MASK', true); // if true, estimates best mask (spec. default, but extremally slow; set to false to significant performance boost but (propably) worst quality code
define('QR_FIND_FROM_RANDOM', 2); // if false, checks all masks available, otherwise value tells count of masks need to be checked, mask id are got randomly
define('QR_DEFAULT_MASK', 2); // when QR_FIND_BEST_MASK === false
define('QR_PNG_MAXIMUM_SIZE', 1024); // maximum allowed png image width (in pixels), tune to make sure GD and PHP can handle such big images
\ No newline at end of file
lib/phpqrcode_php4/tools/merged_header.php 0 → 100644
<?php
/*
* PHP QR Code encoder
*
* This file contains MERGED version of PHP QR Code library.
* It was auto-generated from full version for your convenience.
*
* This merged version was configured to not requre any external files,
* with disabled cache, error loging and weker but faster mask matching.
* If you need tune it up please use non-merged version.
*
* For full version, documentation, examples of use please visit:
*
* http://phpqrcode.sourceforge.net/
* https://sourceforge.net/projects/phpqrcode/
*
* PHP QR Code is distributed under LGPL 3
* Copyright (C) 2010 Dominik Dzienia <deltalab at poczta dot fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
\ No newline at end of file
scripts/basepath.inc.php 0 → 100644
<?php
/**
* @var link to the basic path from the mcClasses dir
*/
$__BASEPATH_EX='../';
/**
* @var link from the basic path to the mcClasses dir,
* copy this var in the main basepath.inc.php if you want use include.php
*/
$__PATH_to_mcClasses= $__BASEPATH_EX .'';
?>
\ No newline at end of file
scripts/exportMailAddress.php 0 → 100644
<?php
require_once("../include.php");
$content = mcFile::getFileContent('Adressbuch_geli-hh_namen.ldif');
//print_r($content);
$array_mail = array();
$string_mail = '';
foreach($content as $lnr => $line) {
// preg_match_all('/^[_a-zA-Z0-9-]+(\.[_a-zA-Z0-9-]+)*@([a-zA-Z0-9-]+\.)+([a-zA-Z]{2,4})$/', $line, $treffer, PREG_SET_ORDER);
$pattern="/([\s]*)([_a-zA-Z0-9-]+(\.[_a-zA-Z0-9-]+)*([ ]+|)@([ ]+|)([a-zA-Z0-9-]+\.)+([a-zA-Z]{2,}))([\s]*)/i";
preg_match_all($pattern, $line, $treffer);
if(array_key_exists(0, $treffer) && array_key_exists(0, $treffer[0])) {
$array_mail[] = $treffer[0][0];
$string_mail .= $treffer[0][0];
} else {
echo($lnr.': '.$line."\n");
}
}
print_r($array_mail);
mcFile::write('mail.txt', $string_mail);
?>
Markdown is supported
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!