├── tests ├── test.js ├── test.php ├── test_utf8.php └── test_utf8.js ├── .gitignore ├── composer.json ├── README.md ├── src └── Packer.php └── LICENSE /tests/test.js: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /tests/test.php: -------------------------------------------------------------------------------- 1 | 8 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | composer.phar 2 | vendor/ 3 | .idea 4 | 5 | # Commit your application's lock file http://getcomposer.org/doc/01-basic-usage.md#composer-lock-the-lock-file 6 | # You may choose to ignore a library lock file http://getcomposer.org/doc/02-libraries.md#lock-file 7 | # composer.lock 8 | -------------------------------------------------------------------------------- /tests/test_utf8.php: -------------------------------------------------------------------------------- 1 | 8 | -------------------------------------------------------------------------------- /composer.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "tholu/php-packer", 3 | "description": "A PHP version of Packer, JavaScript obfuscation library originally created by Dean Edwards", 4 | "keywords": ["uglify", "minify", "minification", "js", "obfuscate", "javascript"], 5 | "homepage": "https://github.com/tholu/php-packer", 6 | "license": "MIT", 7 | "type": "library", 8 | "authors": [ 9 | { 10 | "name": "Thomas Lutz", 11 | "email": "thomaslutz.de@gmail.com" 12 | }, 13 | { 14 | "name": "Nicolas Martin" 15 | }, 16 | { 17 | "name": "Dean Edwards" 18 | } 19 | ], 20 | "require": { 21 | "php": ">=5.3.0" 22 | }, 23 | "autoload": { 24 | "psr-4": { 25 | "Tholu\\Packer\\": "src/" 26 | } 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /tests/test_utf8.js: -------------------------------------------------------------------------------- 1 | var ArtyomVoicesIdentifiers = { 2 | // German 3 | "de-DE": ["Google Deutsch", "de-DE", "de_DE"], 4 | // Spanish 5 | "es-ES": ["Google español", "es-ES", "es_ES", "es-MX", "es_MX"], 6 | // Italian 7 | "it-IT": ["Google italiano", "it-IT", "it_IT"], 8 | // Japanese 9 | "jp-JP": ["Google 日本人", "ja-JP", "ja_JP"], 10 | // English USA 11 | "en-US": ["Google US English", "en-US", "en_US"], 12 | // English UK 13 | "en-GB": ["Google UK English Male", "Google UK English Female", "en-GB", "en_GB"], 14 | // Brazilian Portuguese 15 | "pt-BR": ["Google português do Brasil", "pt-PT", "pt-BR", "pt_PT", "pt_BR"], 16 | // Portugal Portuguese 17 | // Note: in desktop, there's no voice for portugal Portuguese 18 | "pt-PT": ["Google português do Brasil", "pt-PT", "pt_PT"], 19 | // Russian 20 | "ru-RU": ["Google русский", "ru-RU", "ru_RU"], 21 | // Dutch (holland) 22 | "nl-NL": ["Google Nederlands", "nl-NL", "nl_NL"], 23 | // French 24 | "fr-FR": ["Google français", "fr-FR", "fr_FR"], 25 | // Polish 26 | "pl-PL": ["Google polski", "pl-PL", "pl_PL"], 27 | // Indonesian 28 | "id-ID": ["Google Bahasa Indonesia", "id-ID", "id_ID"], 29 | // Hindi 30 | "hi-IN": ["Google हिन्दी", "hi-IN", "hi_IN"], 31 | // Mandarin Chinese 32 | "zh-CN": ["Google 普通话（中国大陆）", "zh-CN", "zh_CN"], 33 | // Cantonese Chinese 34 | "zh-HK": ["Google 粤語（香港）", "zh-HK", "zh_HK"], 35 | // Native voice 36 | "native": ["native"] 37 | }; -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | php-packer 2 | ========== 3 | 4 | A PHP version of Packer, JavaScript obfuscation library originally created by Dean Edwards, ported to PHP by Nicolas Martin. 5 | Packed for composer and slightly extended by Thomas Lutz. 6 | 7 | ## Installation 8 | 9 | Simply run `composer require tholu/php-packer`. 10 | 11 | ## Usage (slightly changed from previous used implementation!) 12 | 13 | ```php 14 | pack(); 37 | echo $packed_js; 38 | ``` 39 | 40 | ## UTF8 41 | 42 | If you have UTF8 characters in your JavaScript like [here](https://github.com/tholu/php-packer/blob/master/tests/test_utf8.js), avoid using the "High ASCII" encoding and use "Normal" instead. Also make sure, that the file is saved and read with proper UTF8 encoding. 43 | -------------------------------------------------------------------------------- /src/Packer.php: -------------------------------------------------------------------------------- 1 | pack(); 26 | * 27 | * or 28 | * 29 | * $myPacker = new Packer($script, 'Normal', true, false); 30 | * $packed = $myPacker->pack(); 31 | * 32 | * or (default values) 33 | * 34 | * $myPacker = new Packer($script); 35 | * $packed = $myPacker->pack(); 36 | * 37 | * 38 | * params of the constructor : 39 | * $script: the JavaScript to pack, string. 40 | * $encoding: level of encoding, int or string : 41 | * 0,10,62,95 or 'None', 'Numeric', 'Normal', 'High ASCII'. 42 | * default: 62. 43 | * $fastDecode: include the fast decoder in the packed result, boolean. 44 | * default : true. 45 | * $specialChars: if you are flagged your private and local variables 46 | * in the script, boolean. 47 | * default: false. 48 | * 49 | * The pack() method return the compressed JavasScript, as a string. 50 | * 51 | * see http://dean.edwards.name/packer/usage/ for more information. 52 | * 53 | * Notes : 54 | * # need PHP 5 . Tested with PHP 5.1.2, 5.1.3, 5.1.4, 5.2.3 55 | * 56 | * # The packed result may be different than with the Dean Edwards 57 | * version, but with the same length. The reason is that the PHP 58 | * function usort to sort array don't necessarily preserve the 59 | * original order of two equal member. The Javascript sort function 60 | * in fact preserve this order (but that's not require by the 61 | * ECMAScript standard). So the encoded keywords order can be 62 | * different in the two results. 63 | * 64 | * # Be careful with the 'High ASCII' Level encoding if you use 65 | * UTF-8 in your files... 66 | */ 67 | 68 | namespace Tholu\Packer; 69 | 70 | 71 | class Packer { 72 | // constants 73 | const IGNORE = '$1'; 74 | 75 | // validate parameters 76 | private $_script = ''; 77 | private $_encoding = 62; 78 | private $_fastDecode = true; 79 | private $_specialChars = false; 80 | private $_removeSemicolons = true; 81 | 82 | private $LITERAL_ENCODING = array( 83 | 'None' => 0, 84 | 'Numeric' => 10, 85 | 'Normal' => 62, 86 | 'High ASCII' => 95 87 | ); 88 | 89 | public function __construct($_script, $_encoding = 62, $_fastDecode = true, $_specialChars = false, $_removeSemicolons = true) 90 | { 91 | $this->_script = $_script . "\n"; 92 | if (array_key_exists($_encoding, $this->LITERAL_ENCODING)) 93 | $_encoding = $this->LITERAL_ENCODING[$_encoding]; 94 | $this->_encoding = min((int)$_encoding, 95); 95 | $this->_fastDecode = $_fastDecode; 96 | $this->_specialChars = $_specialChars; 97 | $this->_removeSemicolons = $_removeSemicolons; 98 | } 99 | 100 | public function pack() { 101 | $this->_addParser('_basicCompression'); 102 | if ($this->_specialChars) 103 | $this->_addParser('_encodeSpecialChars'); 104 | if ($this->_encoding) 105 | $this->_addParser('_encodeKeywords'); 106 | 107 | // go! 108 | return $this->_pack($this->_script); 109 | } 110 | 111 | // apply all parsing routines 112 | private function _pack($script) { 113 | for ($i = 0; isset($this->_parsers[$i]); $i++) { 114 | $script = call_user_func(array(&$this,$this->_parsers[$i]), $script); 115 | } 116 | return $script; 117 | } 118 | 119 | // keep a list of parsing functions, they'll be executed all at once 120 | private $_parsers = array(); 121 | private function _addParser($parser) { 122 | $this->_parsers[] = $parser; 123 | } 124 | 125 | // zero encoding - just removal of white space and comments 126 | private function _basicCompression($script) { 127 | $parser = new ParseMaster(); 128 | // make safe 129 | $parser->escapeChar = '\\'; 130 | // protect strings 131 | $parser->add('/\'[^\'\\n\\r]*\'/', self::IGNORE); 132 | $parser->add('/"[^"\\n\\r]*"/', self::IGNORE); 133 | // remove comments 134 | $parser->add('/\\/\\/[^\\n\\r]*[\\n\\r]/', ' '); 135 | $parser->add('/\\/\\*[^*]*\\*+([^\\/][^*]*\\*+)*\\//', ' '); 136 | // protect regular expressions 137 | $parser->add('/\\s+(\\/[^\\/\\n\\r\\*][^\\/\\n\\r]*\\/g?i?)/', '$2'); // IGNORE 138 | $parser->add('/[^\\w\\x24\\/\'"*)\\?:]\\/[^\\/\\n\\r\\*][^\\/\\n\\r]*\\/g?i?/', self::IGNORE); 139 | // remove: ;;; doSomething(); 140 | if ($this->_specialChars) $parser->add('/;;;[^\\n\\r]+[\\n\\r]/'); 141 | // remove redundant semi-colons 142 | if ($this->_removeSemicolons) { 143 | $parser->add('/\\(;;\\)/', self::IGNORE); // protect for (;;) loops 144 | $parser->add('/;+\\s*([};])/', '$2'); 145 | } 146 | // apply the above 147 | $script = $parser->exec($script); 148 | 149 | // remove white-space 150 | $parser->add('/(\\b|\\x24)\\s+(\\b|\\x24)/', '$2 $3'); 151 | $parser->add('/([+\\-])\\s+([+\\-])/', '$2 $3'); 152 | $parser->add('/\\s+/', ''); 153 | // done 154 | return $parser->exec($script); 155 | } 156 | 157 | private function _encodeSpecialChars($script) { 158 | $parser = new ParseMaster(); 159 | // replace: $name -> n, $$name -> na 160 | $parser->add('/((\\x24+)([a-zA-Z$_]+))(\\d*)/', 161 | array('fn' => '_replace_name') 162 | ); 163 | // replace: _name -> _0, double-underscore (__name) is ignored 164 | $regexp = '/\\b_[A-Za-z\\d]\\w*/'; 165 | // build the word list 166 | $keywords = $this->_analyze($script, $regexp, '_encodePrivate'); 167 | // quick ref 168 | $encoded = $keywords['encoded']; 169 | 170 | $parser->add($regexp, 171 | array( 172 | 'fn' => '_replace_encoded', 173 | 'data' => $encoded 174 | ) 175 | ); 176 | return $parser->exec($script); 177 | } 178 | 179 | private function _encodeKeywords($script) { 180 | // escape high-ascii values already in the script (i.e. in strings) 181 | if ($this->_encoding > 62) 182 | $script = $this->_escape95($script); 183 | // create the parser 184 | $parser = new ParseMaster(); 185 | $encode = $this->_getEncoder($this->_encoding); 186 | // for high-ascii, don't encode single character low-ascii 187 | $regexp = ($this->_encoding > 62) ? '/\\w\\w+/' : '/\\w+/'; 188 | // build the word list 189 | $keywords = $this->_analyze($script, $regexp, $encode); 190 | $encoded = $keywords['encoded']; 191 | 192 | // encode 193 | $parser->add($regexp, 194 | array( 195 | 'fn' => '_replace_encoded', 196 | 'data' => $encoded 197 | ) 198 | ); 199 | if (empty($script)) return $script; 200 | else { 201 | //$res = $parser->exec($script); 202 | //$res = $this->_bootStrap($res, $keywords); 203 | //return $res; 204 | return $this->_bootStrap($parser->exec($script), $keywords); 205 | } 206 | } 207 | 208 | private function _analyze($script, $regexp, $encode) { 209 | // analyse 210 | // retreive all words in the script 211 | $all = array(); 212 | preg_match_all($regexp, $script, $all); 213 | $_sorted = array(); // list of words sorted by frequency 214 | $_encoded = array(); // dictionary of word->encoding 215 | $_protected = array(); // instances of "protected" words 216 | $all = $all[0]; // simulate the javascript comportement of global match 217 | if (!empty($all)) { 218 | $unsorted = array(); // same list, not sorted 219 | $protected = array(); // "protected" words (dictionary of word->"word") 220 | $value = array(); // dictionary of charCode->encoding (eg. 256->ff) 221 | $this->_count = array(); // word->count 222 | $i = count($all); $j = 0; //$word = null; 223 | // count the occurrences - used for sorting later 224 | do { 225 | --$i; 226 | $word = '$' . $all[$i]; 227 | if (!isset($this->_count[$word])) { 228 | $this->_count[$word] = 0; 229 | $unsorted[$j] = $word; 230 | // make a dictionary of all of the protected words in this script 231 | // these are words that might be mistaken for encoding 232 | //if (is_string($encode) && method_exists($this, $encode)) 233 | $values[$j] = call_user_func(array(&$this, $encode), $j); 234 | $protected['$' . $values[$j]] = $j++; 235 | } 236 | // increment the word counter 237 | $this->_count[$word]++; 238 | } while ($i > 0); 239 | // prepare to sort the word list, first we must protect 240 | // words that are also used as codes. we assign them a code 241 | // equivalent to the word itself. 242 | // e.g. if "do" falls within our encoding range 243 | // then we store keywords["do"] = "do"; 244 | // this avoids problems when decoding 245 | $i = count($unsorted); 246 | do { 247 | $word = $unsorted[--$i]; 248 | if (isset($protected[$word]) /*!= null*/) { 249 | $_sorted[$protected[$word]] = substr($word, 1); 250 | $_protected[$protected[$word]] = true; 251 | $this->_count[$word] = 0; 252 | } 253 | } while ($i); 254 | 255 | // sort the words by frequency 256 | // Note: the javascript and php version of sort can be different : 257 | // in php manual, usort : 258 | // " If two members compare as equal, 259 | // their order in the sorted array is undefined." 260 | // so the final packed script is different of the Dean's javascript version 261 | // but equivalent. 262 | // the ECMAscript standard does not guarantee this behaviour, 263 | // and thus not all browsers (e.g. Mozilla versions dating back to at 264 | // least 2003) respect this. 265 | usort($unsorted, array(&$this, '_sortWords')); 266 | $j = 0; 267 | // because there are "protected" words in the list 268 | // we must add the sorted words around them 269 | do { 270 | if (!isset($_sorted[$i])) 271 | $_sorted[$i] = substr($unsorted[$j++], 1); 272 | $_encoded[$_sorted[$i]] = $values[$i]; 273 | } while (++$i < count($unsorted)); 274 | } 275 | return array( 276 | 'sorted' => $_sorted, 277 | 'encoded' => $_encoded, 278 | 'protected' => $_protected); 279 | } 280 | 281 | private $_count = array(); 282 | private function _sortWords($match1, $match2) { 283 | return $this->_count[$match2] - $this->_count[$match1]; 284 | } 285 | 286 | // build the boot function used for loading and decoding 287 | private function _bootStrap($packed, $keywords) { 288 | $ENCODE = $this->_safeRegExp('$encode\\($count\\)'); 289 | 290 | // $packed: the packed script 291 | $packed = "'" . $this->_escape($packed) . "'"; 292 | 293 | // $ascii: base for encoding 294 | $ascii = min(count($keywords['sorted']), $this->_encoding); 295 | if ($ascii == 0) $ascii = 1; 296 | 297 | // $count: number of words contained in the script 298 | $count = count($keywords['sorted']); 299 | 300 | // $keywords: list of words contained in the script 301 | foreach ($keywords['protected'] as $i=>$value) { 302 | $keywords['sorted'][$i] = ''; 303 | } 304 | // convert from a string to an array 305 | ksort($keywords['sorted']); 306 | $keywords = "'" . implode('|',$keywords['sorted']) . "'.split('|')"; 307 | 308 | $encode = ($this->_encoding > 62) ? '_encode95' : $this->_getEncoder($ascii); 309 | $encode = $this->_getJSFunction($encode); 310 | $encode = preg_replace('/_encoding/','$ascii', $encode); 311 | $encode = preg_replace('/arguments\\.callee/','$encode', $encode); 312 | $inline = '\\$count' . ($ascii > 10 ? '.toString(\\$ascii)' : ''); 313 | 314 | // $decode: code snippet to speed up decoding 315 | if ($this->_fastDecode) { 316 | // create the decoder 317 | $decode = $this->_getJSFunction('_decodeBody'); 318 | if ($this->_encoding > 62) 319 | $decode = preg_replace('/\\\\w/', '[\\xa1-\\xff]', $decode); 320 | // perform the encoding inline for lower ascii values 321 | elseif ($ascii < 36) 322 | $decode = preg_replace($ENCODE, $inline, $decode); 323 | // special case: when $count==0 there are no keywords. I want to keep 324 | // the basic shape of the unpacking funcion so i'll frig the code... 325 | if ($count == 0) 326 | $decode = preg_replace($this->_safeRegExp('($count)\\s*=\\s*1'), '$1=0', $decode, 1); 327 | } 328 | 329 | // boot function 330 | $unpack = $this->_getJSFunction('_unpack'); 331 | if ($this->_fastDecode) { 332 | // insert the decoder 333 | $this->buffer = $decode; 334 | $unpack = preg_replace_callback('/\\{/', array(&$this, '_insertFastDecode'), $unpack, 1); 335 | } 336 | $unpack = preg_replace('/"/', "'", $unpack); 337 | if ($this->_encoding > 62) { // high-ascii 338 | // get rid of the word-boundaries for regexp matches 339 | $unpack = preg_replace('/\'\\\\\\\\b\'\s*\\+|\\+\s*\'\\\\\\\\b\'/', '', $unpack); 340 | } 341 | if ($ascii > 36 || $this->_encoding > 62 || $this->_fastDecode) { 342 | // insert the encode function 343 | $this->buffer = $encode; 344 | $unpack = preg_replace_callback('/\\{/', array(&$this, '_insertFastEncode'), $unpack, 1); 345 | } else { 346 | // perform the encoding inline 347 | $unpack = preg_replace($ENCODE, $inline, $unpack); 348 | } 349 | // pack the boot function too 350 | $unpackPacker = new Packer($unpack, 0, false, true); 351 | $unpack = $unpackPacker->pack(); 352 | 353 | // arguments 354 | $params = array($packed, $ascii, $count, $keywords); 355 | if ($this->_fastDecode) { 356 | $params[] = 0; 357 | $params[] = '{}'; 358 | } 359 | $params = implode(',', $params); 360 | 361 | // the whole thing 362 | return 'eval(' . $unpack . '(' . $params . "))\n"; 363 | } 364 | 365 | private $buffer; 366 | private function _insertFastDecode($match) { 367 | return '{' . $this->buffer . ';'; 368 | } 369 | private function _insertFastEncode($match) { 370 | return '{$encode=' . $this->buffer . ';'; 371 | } 372 | 373 | // mmm.. ..which one do i need ?? 374 | private function _getEncoder($ascii) { 375 | return $ascii > 10 ? $ascii > 36 ? $ascii > 62 ? 376 | '_encode95' : '_encode62' : '_encode36' : '_encode10'; 377 | } 378 | 379 | // zero encoding 380 | // characters: 0123456789 381 | private function _encode10($charCode) { 382 | return $charCode; 383 | } 384 | 385 | // inherent base36 support 386 | // characters: 0123456789abcdefghijklmnopqrstuvwxyz 387 | private function _encode36($charCode) { 388 | return base_convert($charCode, 10, 36); 389 | } 390 | 391 | // hitch a ride on base36 and add the upper case alpha characters 392 | // characters: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ 393 | private function _encode62($charCode) { 394 | $res = ''; 395 | if ($charCode >= $this->_encoding) { 396 | $res = $this->_encode62((int)($charCode / $this->_encoding)); 397 | } 398 | $charCode = $charCode % $this->_encoding; 399 | 400 | if ($charCode > 35) 401 | return $res . chr($charCode + 29); 402 | else 403 | return $res . base_convert($charCode, 10, 36); 404 | } 405 | 406 | // use high-ascii values 407 | // characters: ¡¢£¤¥¦§¨©ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþ 408 | private function _encode95($charCode) { 409 | $res = ''; 410 | if ($charCode >= $this->_encoding) 411 | $res = $this->_encode95($charCode / $this->_encoding); 412 | 413 | return $res . chr(($charCode % $this->_encoding) + 161); 414 | } 415 | 416 | private function _safeRegExp($string) { 417 | return '/'.preg_replace('/\$/', '\\\$', $string).'/'; 418 | } 419 | 420 | private function _encodePrivate($charCode) { 421 | return "_" . $charCode; 422 | } 423 | 424 | // protect characters used by the parser 425 | private function _escape($script) { 426 | return preg_replace('/([\\\\\'])/', '\\\$1', $script); 427 | } 428 | 429 | // protect high-ascii characters already in the script 430 | private function _escape95($script) { 431 | return preg_replace_callback( 432 | '/[\\xa1-\\xff]/', 433 | array(&$this, '_escape95Bis'), 434 | $script 435 | ); 436 | } 437 | private function _escape95Bis($match) { 438 | return '\x'.((string)dechex(ord($match))); 439 | } 440 | 441 | 442 | private function _getJSFunction($aName) { 443 | if (defined('self::JSFUNCTION'.$aName)) 444 | return constant('self::JSFUNCTION'.$aName); 445 | else 446 | return ''; 447 | } 448 | 449 | // JavaScript Functions used. 450 | // Note : In Dean's version, these functions are converted 451 | // with 'String(aFunctionName);'. 452 | // This internal conversion complete the original code, ex : 453 | // 'while (aBool) anAction();' is converted to 454 | // 'while (aBool) { anAction(); }'. 455 | // The JavaScript functions below are corrected. 456 | 457 | // unpacking function - this is the boot strap function 458 | // data extracted from this packing routine is passed to 459 | // this function when decoded in the target 460 | // NOTE ! : without the ';' final. 461 | const JSFUNCTION_unpack = 462 | 463 | 'function($packed, $ascii, $count, $keywords, $encode, $decode) { 464 | while ($count--) { 465 | if ($keywords[$count]) { 466 | $packed = $packed.replace(new RegExp(\'\\\\b\' + $encode($count) + \'\\\\b\', \'g\'), $keywords[$count]); 467 | } 468 | } 469 | return $packed; 470 | }'; 471 | /* 472 | 'function($packed, $ascii, $count, $keywords, $encode, $decode) { 473 | while ($count--) 474 | if ($keywords[$count]) 475 | $packed = $packed.replace(new RegExp(\'\\\\b\' + $encode($count) + \'\\\\b\', \'g\'), $keywords[$count]); 476 | return $packed; 477 | }'; 478 | */ 479 | 480 | // code-snippet inserted into the unpacker to speed up decoding 481 | const JSFUNCTION_decodeBody = 482 | //_decode = function() { 483 | // does the browser support String.replace where the 484 | // replacement value is a function? 485 | 486 | ' if (!\'\'.replace(/^/, String)) { 487 | // decode all the values we need 488 | while ($count--) { 489 | $decode[$encode($count)] = $keywords[$count] || $encode($count); 490 | } 491 | // global replacement function 492 | $keywords = [function ($encoded) {return $decode[$encoded]}]; 493 | // generic match 494 | $encode = function () {return \'\\\\w+\'}; 495 | // reset the loop counter - we are now doing a global replace 496 | $count = 1; 497 | } 498 | '; 499 | //}; 500 | /* 501 | ' if (!\'\'.replace(/^/, String)) { 502 | // decode all the values we need 503 | while ($count--) $decode[$encode($count)] = $keywords[$count] || $encode($count); 504 | // global replacement function 505 | $keywords = [function ($encoded) {return $decode[$encoded]}]; 506 | // generic match 507 | $encode = function () {return\'\\\\w+\'}; 508 | // reset the loop counter - we are now doing a global replace 509 | $count = 1; 510 | }'; 511 | */ 512 | 513 | // zero encoding 514 | // characters: 0123456789 515 | const JSFUNCTION_encode10 = 516 | 'function($charCode) { 517 | return $charCode; 518 | }';//;'; 519 | 520 | // inherent base36 support 521 | // characters: 0123456789abcdefghijklmnopqrstuvwxyz 522 | const JSFUNCTION_encode36 = 523 | 'function($charCode) { 524 | return $charCode.toString(36); 525 | }';//;'; 526 | 527 | // hitch a ride on base36 and add the upper case alpha characters 528 | // characters: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ 529 | const JSFUNCTION_encode62 = 530 | 'function($charCode) { 531 | return ($charCode < _encoding ? \'\' : arguments.callee(parseInt($charCode / _encoding))) + 532 | (($charCode = $charCode % _encoding) > 35 ? String.fromCharCode($charCode + 29) : $charCode.toString(36)); 533 | }'; 534 | 535 | // use high-ascii values 536 | // characters: ¡¢£¤¥¦§¨©ª«¬­®¯°±²³´µ¶·¸¹º»¼½¾¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþ 537 | const JSFUNCTION_encode95 = 538 | 'function($charCode) { 539 | return ($charCode < _encoding ? \'\' : arguments.callee($charCode / _encoding)) + 540 | String.fromCharCode($charCode % _encoding + 161); 541 | }'; 542 | 543 | } 544 | 545 | 546 | class ParseMaster { 547 | public $ignoreCase = false; 548 | public $escapeChar = ''; 549 | 550 | // constants 551 | const EXPRESSION = 0; 552 | const REPLACEMENT = 1; 553 | const LENGTH = 2; 554 | 555 | // used to determine nesting levels 556 | private $GROUPS = '/\\(/';//g 557 | private $SUB_REPLACE = '/\\$\\d/'; 558 | private $INDEXED = '/^\\$\\d+$/'; 559 | private $TRIM = '/([\'"])\\1\\.(.*)\\.\\1\\1$/'; 560 | private $ESCAPE = '/\\\./';//g 561 | private $QUOTE = '/\'/'; 562 | private $DELETED = '/\\x01[^\\x01]*\\x01/';//g 563 | 564 | public function add($expression, $replacement = '') { 565 | // count the number of sub-expressions 566 | // - add one because each pattern is itself a sub-expression 567 | $length = 1 + preg_match_all($this->GROUPS, $this->_internalEscape((string)$expression), $out); 568 | 569 | // treat only strings $replacement 570 | if (is_string($replacement)) { 571 | // does the pattern deal with sub-expressions? 572 | if (preg_match($this->SUB_REPLACE, $replacement)) { 573 | // a simple lookup? (e.g. "$2") 574 | if (preg_match($this->INDEXED, $replacement)) { 575 | // store the index (used for fast retrieval of matched strings) 576 | $replacement = (int)(substr($replacement, 1)) - 1; 577 | } else { // a complicated lookup (e.g. "Hello $2 $1") 578 | // build a function to do the lookup 579 | $quote = preg_match($this->QUOTE, $this->_internalEscape($replacement)) 580 | ? '"' : "'"; 581 | $replacement = array( 582 | 'fn' => '_backReferences', 583 | 'data' => array( 584 | 'replacement' => $replacement, 585 | 'length' => $length, 586 | 'quote' => $quote 587 | ) 588 | ); 589 | } 590 | } 591 | } 592 | // pass the modified arguments 593 | if (!empty($expression)) $this->_add($expression, $replacement, $length); 594 | else $this->_add('/^$/', $replacement, $length); 595 | } 596 | 597 | public function exec($string) { 598 | // execute the global replacement 599 | $this->_escaped = array(); 600 | 601 | // simulate the _patterns.toSTring of Dean 602 | $regexp = '/'; 603 | foreach ($this->_patterns as $reg) { 604 | $regexp .= '(' . substr($reg[self::EXPRESSION], 1, -1) . ')|'; 605 | } 606 | $regexp = substr($regexp, 0, -1) . '/'; 607 | $regexp .= ($this->ignoreCase) ? 'i' : ''; 608 | 609 | $string = $this->_escape($string, $this->escapeChar); 610 | $string = preg_replace_callback( 611 | $regexp, 612 | array( 613 | &$this, 614 | '_replacement' 615 | ), 616 | $string 617 | ); 618 | $string = $this->_unescape($string, $this->escapeChar); 619 | 620 | return preg_replace($this->DELETED, '', $string); 621 | } 622 | 623 | public function reset() { 624 | // clear the patterns collection so that this object may be re-used 625 | $this->_patterns = array(); 626 | } 627 | 628 | // private 629 | private $_escaped = array(); // escaped characters 630 | private $_patterns = array(); // patterns stored by index 631 | 632 | // create and add a new pattern to the patterns collection 633 | private function _add() { 634 | $arguments = func_get_args(); 635 | $this->_patterns[] = $arguments; 636 | } 637 | 638 | // this is the global replace function (it's quite complicated) 639 | private function _replacement($arguments) { 640 | if (empty($arguments)) return ''; 641 | 642 | $i = 1; $j = 0; 643 | // loop through the patterns 644 | while (isset($this->_patterns[$j])) { 645 | $pattern = $this->_patterns[$j++]; 646 | // do we have a result? 647 | if (isset($arguments[$i]) && ($arguments[$i] != '')) { 648 | $replacement = $pattern[self::REPLACEMENT]; 649 | 650 | if (is_array($replacement) && isset($replacement['fn'])) { 651 | 652 | if (isset($replacement['data'])) $this->buffer = $replacement['data']; 653 | return call_user_func(array(&$this, $replacement['fn']), $arguments, $i); 654 | 655 | } elseif (is_int($replacement)) { 656 | return $arguments[$replacement + $i]; 657 | 658 | } 659 | $delete = ($this->escapeChar == '' || 660 | strpos($arguments[$i], $this->escapeChar) === false) 661 | ? '' : "\x01" . $arguments[$i] . "\x01"; 662 | return $delete . $replacement; 663 | 664 | // skip over references to sub-expressions 665 | } else { 666 | $i += $pattern[self::LENGTH]; 667 | } 668 | } 669 | } 670 | 671 | private function _backReferences($match, $offset) { 672 | $replacement = $this->buffer['replacement']; 673 | $quote = $this->buffer['quote']; 674 | $i = $this->buffer['length']; 675 | while ($i) { 676 | $replacement = str_replace('$'.$i--, $match[$offset + $i], $replacement); 677 | } 678 | return $replacement; 679 | } 680 | 681 | private function _replace_name($match, $offset){ 682 | $length = strlen($match[$offset + 2]); 683 | $start = $length - max($length - strlen($match[$offset + 3]), 0); 684 | return substr($match[$offset + 1], $start, $length) . $match[$offset + 4]; 685 | } 686 | 687 | private function _replace_encoded($match, $offset) { 688 | return $this->buffer[$match[$offset]]; 689 | } 690 | 691 | 692 | // php : we cannot pass additional data to preg_replace_callback, 693 | // and we cannot use &$this in create_function, so let's go to lower level 694 | private $buffer; 695 | 696 | // encode escaped characters 697 | private function _escape($string, $escapeChar) { 698 | if ($escapeChar) { 699 | $this->buffer = $escapeChar; 700 | return preg_replace_callback( 701 | '/\\' . $escapeChar . '(.)' .'/', 702 | array(&$this, '_escapeBis'), 703 | $string 704 | ); 705 | 706 | } else { 707 | return $string; 708 | } 709 | } 710 | private function _escapeBis($match) { 711 | $this->_escaped[] = $match[1]; 712 | return $this->buffer; 713 | } 714 | 715 | // decode escaped characters 716 | private function _unescape($string, $escapeChar) { 717 | if ($escapeChar) { 718 | $regexp = '/'.'\\'.$escapeChar.'/'; 719 | $this->buffer = array('escapeChar'=> $escapeChar, 'i' => 0); 720 | return preg_replace_callback 721 | ( 722 | $regexp, 723 | array(&$this, '_unescapeBis'), 724 | $string 725 | ); 726 | 727 | } else { 728 | return $string; 729 | } 730 | } 731 | private function _unescapeBis() { 732 | if (isset($this->_escaped[$this->buffer['i']]) 733 | && $this->_escaped[$this->buffer['i']] != '') 734 | { 735 | $temp = $this->_escaped[$this->buffer['i']]; 736 | } else { 737 | $temp = ''; 738 | } 739 | $this->buffer['i']++; 740 | return $this->buffer['escapeChar'] . $temp; 741 | } 742 | 743 | private function _internalEscape($string) { 744 | return preg_replace($this->ESCAPE, '', $string); 745 | } 746 | } 747 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU LESSER GENERAL PUBLIC LICENSE 2 | Version 2.1, February 1999 3 | 4 | Copyright (C) 1991, 1999 Free Software Foundation, Inc. 5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 6 | Everyone is permitted to copy and distribute verbatim copies 7 | of this license document, but changing it is not allowed. 8 | 9 | (This is the first released version of the Lesser GPL. It also counts 10 | as the successor of the GNU Library Public License, version 2, hence 11 | the version number 2.1.) 12 | 13 | Preamble 14 | 15 | The licenses for most software are designed to take away your 16 | freedom to share and change it. By contrast, the GNU General Public 17 | Licenses are intended to guarantee your freedom to share and change 18 | free software--to make sure the software is free for all its users. 19 | 20 | This license, the Lesser General Public License, applies to some 21 | specially designated software packages--typically libraries--of the 22 | Free Software Foundation and other authors who decide to use it. You 23 | can use it too, but we suggest you first think carefully about whether 24 | this license or the ordinary General Public License is the better 25 | strategy to use in any particular case, based on the explanations below. 26 | 27 | When we speak of free software, we are referring to freedom of use, 28 | not price. Our General Public Licenses are designed to make sure that 29 | you have the freedom to distribute copies of free software (and charge 30 | for this service if you wish); that you receive source code or can get 31 | it if you want it; that you can change the software and use pieces of 32 | it in new free programs; and that you are informed that you can do 33 | these things. 34 | 35 | To protect your rights, we need to make restrictions that forbid 36 | distributors to deny you these rights or to ask you to surrender these 37 | rights. These restrictions translate to certain responsibilities for 38 | you if you distribute copies of the library or if you modify it. 39 | 40 | For example, if you distribute copies of the library, whether gratis 41 | or for a fee, you must give the recipients all the rights that we gave 42 | you. You must make sure that they, too, receive or can get the source 43 | code. If you link other code with the library, you must provide 44 | complete object files to the recipients, so that they can relink them 45 | with the library after making changes to the library and recompiling 46 | it. And you must show them these terms so they know their rights. 47 | 48 | We protect your rights with a two-step method: (1) we copyright the 49 | library, and (2) we offer you this license, which gives you legal 50 | permission to copy, distribute and/or modify the library. 51 | 52 | To protect each distributor, we want to make it very clear that 53 | there is no warranty for the free library. Also, if the library is 54 | modified by someone else and passed on, the recipients should know 55 | that what they have is not the original version, so that the original 56 | author's reputation will not be affected by problems that might be 57 | introduced by others. 58 | 59 | Finally, software patents pose a constant threat to the existence of 60 | any free program. We wish to make sure that a company cannot 61 | effectively restrict the users of a free program by obtaining a 62 | restrictive license from a patent holder. Therefore, we insist that 63 | any patent license obtained for a version of the library must be 64 | consistent with the full freedom of use specified in this license. 65 | 66 | Most GNU software, including some libraries, is covered by the 67 | ordinary GNU General Public License. This license, the GNU Lesser 68 | General Public License, applies to certain designated libraries, and 69 | is quite different from the ordinary General Public License. We use 70 | this license for certain libraries in order to permit linking those 71 | libraries into non-free programs. 72 | 73 | When a program is linked with a library, whether statically or using 74 | a shared library, the combination of the two is legally speaking a 75 | combined work, a derivative of the original library. The ordinary 76 | General Public License therefore permits such linking only if the 77 | entire combination fits its criteria of freedom. The Lesser General 78 | Public License permits more lax criteria for linking other code with 79 | the library. 80 | 81 | We call this license the "Lesser" General Public License because it 82 | does Less to protect the user's freedom than the ordinary General 83 | Public License. It also provides other free software developers Less 84 | of an advantage over competing non-free programs. These disadvantages 85 | are the reason we use the ordinary General Public License for many 86 | libraries. However, the Lesser license provides advantages in certain 87 | special circumstances. 88 | 89 | For example, on rare occasions, there may be a special need to 90 | encourage the widest possible use of a certain library, so that it becomes 91 | a de-facto standard. To achieve this, non-free programs must be 92 | allowed to use the library. A more frequent case is that a free 93 | library does the same job as widely used non-free libraries. In this 94 | case, there is little to gain by limiting the free library to free 95 | software only, so we use the Lesser General Public License. 96 | 97 | In other cases, permission to use a particular library in non-free 98 | programs enables a greater number of people to use a large body of 99 | free software. For example, permission to use the GNU C Library in 100 | non-free programs enables many more people to use the whole GNU 101 | operating system, as well as its variant, the GNU/Linux operating 102 | system. 103 | 104 | Although the Lesser General Public License is Less protective of the 105 | users' freedom, it does ensure that the user of a program that is 106 | linked with the Library has the freedom and the wherewithal to run 107 | that program using a modified version of the Library. 108 | 109 | The precise terms and conditions for copying, distribution and 110 | modification follow. Pay close attention to the difference between a 111 | "work based on the library" and a "work that uses the library". The 112 | former contains code derived from the library, whereas the latter must 113 | be combined with the library in order to run. 114 | 115 | GNU LESSER GENERAL PUBLIC LICENSE 116 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 117 | 118 | 0. This License Agreement applies to any software library or other 119 | program which contains a notice placed by the copyright holder or 120 | other authorized party saying it may be distributed under the terms of 121 | this Lesser General Public License (also called "this License"). 122 | Each licensee is addressed as "you". 123 | 124 | A "library" means a collection of software functions and/or data 125 | prepared so as to be conveniently linked with application programs 126 | (which use some of those functions and data) to form executables. 127 | 128 | The "Library", below, refers to any such software library or work 129 | which has been distributed under these terms. A "work based on the 130 | Library" means either the Library or any derivative work under 131 | copyright law: that is to say, a work containing the Library or a 132 | portion of it, either verbatim or with modifications and/or translated 133 | straightforwardly into another language. (Hereinafter, translation is 134 | included without limitation in the term "modification".) 135 | 136 | "Source code" for a work means the preferred form of the work for 137 | making modifications to it. For a library, complete source code means 138 | all the source code for all modules it contains, plus any associated 139 | interface definition files, plus the scripts used to control compilation 140 | and installation of the library. 141 | 142 | Activities other than copying, distribution and modification are not 143 | covered by this License; they are outside its scope. The act of 144 | running a program using the Library is not restricted, and output from 145 | such a program is covered only if its contents constitute a work based 146 | on the Library (independent of the use of the Library in a tool for 147 | writing it). Whether that is true depends on what the Library does 148 | and what the program that uses the Library does. 149 | 150 | 1. You may copy and distribute verbatim copies of the Library's 151 | complete source code as you receive it, in any medium, provided that 152 | you conspicuously and appropriately publish on each copy an 153 | appropriate copyright notice and disclaimer of warranty; keep intact 154 | all the notices that refer to this License and to the absence of any 155 | warranty; and distribute a copy of this License along with the 156 | Library. 157 | 158 | You may charge a fee for the physical act of transferring a copy, 159 | and you may at your option offer warranty protection in exchange for a 160 | fee. 161 | 162 | 2. You may modify your copy or copies of the Library or any portion 163 | of it, thus forming a work based on the Library, and copy and 164 | distribute such modifications or work under the terms of Section 1 165 | above, provided that you also meet all of these conditions: 166 | 167 | a) The modified work must itself be a software library. 168 | 169 | b) You must cause the files modified to carry prominent notices 170 | stating that you changed the files and the date of any change. 171 | 172 | c) You must cause the whole of the work to be licensed at no 173 | charge to all third parties under the terms of this License. 174 | 175 | d) If a facility in the modified Library refers to a function or a 176 | table of data to be supplied by an application program that uses 177 | the facility, other than as an argument passed when the facility 178 | is invoked, then you must make a good faith effort to ensure that, 179 | in the event an application does not supply such function or 180 | table, the facility still operates, and performs whatever part of 181 | its purpose remains meaningful. 182 | 183 | (For example, a function in a library to compute square roots has 184 | a purpose that is entirely well-defined independent of the 185 | application. Therefore, Subsection 2d requires that any 186 | application-supplied function or table used by this function must 187 | be optional: if the application does not supply it, the square 188 | root function must still compute square roots.) 189 | 190 | These requirements apply to the modified work as a whole. If 191 | identifiable sections of that work are not derived from the Library, 192 | and can be reasonably considered independent and separate works in 193 | themselves, then this License, and its terms, do not apply to those 194 | sections when you distribute them as separate works. But when you 195 | distribute the same sections as part of a whole which is a work based 196 | on the Library, the distribution of the whole must be on the terms of 197 | this License, whose permissions for other licensees extend to the 198 | entire whole, and thus to each and every part regardless of who wrote 199 | it. 200 | 201 | Thus, it is not the intent of this section to claim rights or contest 202 | your rights to work written entirely by you; rather, the intent is to 203 | exercise the right to control the distribution of derivative or 204 | collective works based on the Library. 205 | 206 | In addition, mere aggregation of another work not based on the Library 207 | with the Library (or with a work based on the Library) on a volume of 208 | a storage or distribution medium does not bring the other work under 209 | the scope of this License. 210 | 211 | 3. You may opt to apply the terms of the ordinary GNU General Public 212 | License instead of this License to a given copy of the Library. To do 213 | this, you must alter all the notices that refer to this License, so 214 | that they refer to the ordinary GNU General Public License, version 2, 215 | instead of to this License. (If a newer version than version 2 of the 216 | ordinary GNU General Public License has appeared, then you can specify 217 | that version instead if you wish.) Do not make any other change in 218 | these notices. 219 | 220 | Once this change is made in a given copy, it is irreversible for 221 | that copy, so the ordinary GNU General Public License applies to all 222 | subsequent copies and derivative works made from that copy. 223 | 224 | This option is useful when you wish to copy part of the code of 225 | the Library into a program that is not a library. 226 | 227 | 4. You may copy and distribute the Library (or a portion or 228 | derivative of it, under Section 2) in object code or executable form 229 | under the terms of Sections 1 and 2 above provided that you accompany 230 | it with the complete corresponding machine-readable source code, which 231 | must be distributed under the terms of Sections 1 and 2 above on a 232 | medium customarily used for software interchange. 233 | 234 | If distribution of object code is made by offering access to copy 235 | from a designated place, then offering equivalent access to copy the 236 | source code from the same place satisfies the requirement to 237 | distribute the source code, even though third parties are not 238 | compelled to copy the source along with the object code. 239 | 240 | 5. A program that contains no derivative of any portion of the 241 | Library, but is designed to work with the Library by being compiled or 242 | linked with it, is called a "work that uses the Library". Such a 243 | work, in isolation, is not a derivative work of the Library, and 244 | therefore falls outside the scope of this License. 245 | 246 | However, linking a "work that uses the Library" with the Library 247 | creates an executable that is a derivative of the Library (because it 248 | contains portions of the Library), rather than a "work that uses the 249 | library". The executable is therefore covered by this License. 250 | Section 6 states terms for distribution of such executables. 251 | 252 | When a "work that uses the Library" uses material from a header file 253 | that is part of the Library, the object code for the work may be a 254 | derivative work of the Library even though the source code is not. 255 | Whether this is true is especially significant if the work can be 256 | linked without the Library, or if the work is itself a library. The 257 | threshold for this to be true is not precisely defined by law. 258 | 259 | If such an object file uses only numerical parameters, data 260 | structure layouts and accessors, and small macros and small inline 261 | functions (ten lines or less in length), then the use of the object 262 | file is unrestricted, regardless of whether it is legally a derivative 263 | work. (Executables containing this object code plus portions of the 264 | Library will still fall under Section 6.) 265 | 266 | Otherwise, if the work is a derivative of the Library, you may 267 | distribute the object code for the work under the terms of Section 6. 268 | Any executables containing that work also fall under Section 6, 269 | whether or not they are linked directly with the Library itself. 270 | 271 | 6. As an exception to the Sections above, you may also combine or 272 | link a "work that uses the Library" with the Library to produce a 273 | work containing portions of the Library, and distribute that work 274 | under terms of your choice, provided that the terms permit 275 | modification of the work for the customer's own use and reverse 276 | engineering for debugging such modifications. 277 | 278 | You must give prominent notice with each copy of the work that the 279 | Library is used in it and that the Library and its use are covered by 280 | this License. You must supply a copy of this License. If the work 281 | during execution displays copyright notices, you must include the 282 | copyright notice for the Library among them, as well as a reference 283 | directing the user to the copy of this License. Also, you must do one 284 | of these things: 285 | 286 | a) Accompany the work with the complete corresponding 287 | machine-readable source code for the Library including whatever 288 | changes were used in the work (which must be distributed under 289 | Sections 1 and 2 above); and, if the work is an executable linked 290 | with the Library, with the complete machine-readable "work that 291 | uses the Library", as object code and/or source code, so that the 292 | user can modify the Library and then relink to produce a modified 293 | executable containing the modified Library. (It is understood 294 | that the user who changes the contents of definitions files in the 295 | Library will not necessarily be able to recompile the application 296 | to use the modified definitions.) 297 | 298 | b) Use a suitable shared library mechanism for linking with the 299 | Library. A suitable mechanism is one that (1) uses at run time a 300 | copy of the library already present on the user's computer system, 301 | rather than copying library functions into the executable, and (2) 302 | will operate properly with a modified version of the library, if 303 | the user installs one, as long as the modified version is 304 | interface-compatible with the version that the work was made with. 305 | 306 | c) Accompany the work with a written offer, valid for at 307 | least three years, to give the same user the materials 308 | specified in Subsection 6a, above, for a charge no more 309 | than the cost of performing this distribution. 310 | 311 | d) If distribution of the work is made by offering access to copy 312 | from a designated place, offer equivalent access to copy the above 313 | specified materials from the same place. 314 | 315 | e) Verify that the user has already received a copy of these 316 | materials or that you have already sent this user a copy. 317 | 318 | For an executable, the required form of the "work that uses the 319 | Library" must include any data and utility programs needed for 320 | reproducing the executable from it. However, as a special exception, 321 | the materials to be distributed need not include anything that is 322 | normally distributed (in either source or binary form) with the major 323 | components (compiler, kernel, and so on) of the operating system on 324 | which the executable runs, unless that component itself accompanies 325 | the executable. 326 | 327 | It may happen that this requirement contradicts the license 328 | restrictions of other proprietary libraries that do not normally 329 | accompany the operating system. Such a contradiction means you cannot 330 | use both them and the Library together in an executable that you 331 | distribute. 332 | 333 | 7. You may place library facilities that are a work based on the 334 | Library side-by-side in a single library together with other library 335 | facilities not covered by this License, and distribute such a combined 336 | library, provided that the separate distribution of the work based on 337 | the Library and of the other library facilities is otherwise 338 | permitted, and provided that you do these two things: 339 | 340 | a) Accompany the combined library with a copy of the same work 341 | based on the Library, uncombined with any other library 342 | facilities. This must be distributed under the terms of the 343 | Sections above. 344 | 345 | b) Give prominent notice with the combined library of the fact 346 | that part of it is a work based on the Library, and explaining 347 | where to find the accompanying uncombined form of the same work. 348 | 349 | 8. You may not copy, modify, sublicense, link with, or distribute 350 | the Library except as expressly provided under this License. Any 351 | attempt otherwise to copy, modify, sublicense, link with, or 352 | distribute the Library is void, and will automatically terminate your 353 | rights under this License. However, parties who have received copies, 354 | or rights, from you under this License will not have their licenses 355 | terminated so long as such parties remain in full compliance. 356 | 357 | 9. You are not required to accept this License, since you have not 358 | signed it. However, nothing else grants you permission to modify or 359 | distribute the Library or its derivative works. These actions are 360 | prohibited by law if you do not accept this License. Therefore, by 361 | modifying or distributing the Library (or any work based on the 362 | Library), you indicate your acceptance of this License to do so, and 363 | all its terms and conditions for copying, distributing or modifying 364 | the Library or works based on it. 365 | 366 | 10. Each time you redistribute the Library (or any work based on the 367 | Library), the recipient automatically receives a license from the 368 | original licensor to copy, distribute, link with or modify the Library 369 | subject to these terms and conditions. You may not impose any further 370 | restrictions on the recipients' exercise of the rights granted herein. 371 | You are not responsible for enforcing compliance by third parties with 372 | this License. 373 | 374 | 11. If, as a consequence of a court judgment or allegation of patent 375 | infringement or for any other reason (not limited to patent issues), 376 | conditions are imposed on you (whether by court order, agreement or 377 | otherwise) that contradict the conditions of this License, they do not 378 | excuse you from the conditions of this License. If you cannot 379 | distribute so as to satisfy simultaneously your obligations under this 380 | License and any other pertinent obligations, then as a consequence you 381 | may not distribute the Library at all. For example, if a patent 382 | license would not permit royalty-free redistribution of the Library by 383 | all those who receive copies directly or indirectly through you, then 384 | the only way you could satisfy both it and this License would be to 385 | refrain entirely from distribution of the Library. 386 | 387 | If any portion of this section is held invalid or unenforceable under any 388 | particular circumstance, the balance of the section is intended to apply, 389 | and the section as a whole is intended to apply in other circumstances. 390 | 391 | It is not the purpose of this section to induce you to infringe any 392 | patents or other property right claims or to contest validity of any 393 | such claims; this section has the sole purpose of protecting the 394 | integrity of the free software distribution system which is 395 | implemented by public license practices. Many people have made 396 | generous contributions to the wide range of software distributed 397 | through that system in reliance on consistent application of that 398 | system; it is up to the author/donor to decide if he or she is willing 399 | to distribute software through any other system and a licensee cannot 400 | impose that choice. 401 | 402 | This section is intended to make thoroughly clear what is believed to 403 | be a consequence of the rest of this License. 404 | 405 | 12. If the distribution and/or use of the Library is restricted in 406 | certain countries either by patents or by copyrighted interfaces, the 407 | original copyright holder who places the Library under this License may add 408 | an explicit geographical distribution limitation excluding those countries, 409 | so that distribution is permitted only in or among countries not thus 410 | excluded. In such case, this License incorporates the limitation as if 411 | written in the body of this License. 412 | 413 | 13. The Free Software Foundation may publish revised and/or new 414 | versions of the Lesser General Public License from time to time. 415 | Such new versions will be similar in spirit to the present version, 416 | but may differ in detail to address new problems or concerns. 417 | 418 | Each version is given a distinguishing version number. If the Library 419 | specifies a version number of this License which applies to it and 420 | "any later version", you have the option of following the terms and 421 | conditions either of that version or of any later version published by 422 | the Free Software Foundation. If the Library does not specify a 423 | license version number, you may choose any version ever published by 424 | the Free Software Foundation. 425 | 426 | 14. If you wish to incorporate parts of the Library into other free 427 | programs whose distribution conditions are incompatible with these, 428 | write to the author to ask for permission. For software which is 429 | copyrighted by the Free Software Foundation, write to the Free 430 | Software Foundation; we sometimes make exceptions for this. Our 431 | decision will be guided by the two goals of preserving the free status 432 | of all derivatives of our free software and of promoting the sharing 433 | and reuse of software generally. 434 | 435 | NO WARRANTY 436 | 437 | 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO 438 | WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. 439 | EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR 440 | OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY 441 | KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE 442 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 443 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE 444 | LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME 445 | THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 446 | 447 | 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN 448 | WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY 449 | AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU 450 | FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR 451 | CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE 452 | LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING 453 | RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A 454 | FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF 455 | SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH 456 | DAMAGES. 457 | 458 | END OF TERMS AND CONDITIONS 459 | 460 | How to Apply These Terms to Your New Libraries 461 | 462 | If you develop a new library, and you want it to be of the greatest 463 | possible use to the public, we recommend making it free software that 464 | everyone can redistribute and change. You can do so by permitting 465 | redistribution under these terms (or, alternatively, under the terms of the 466 | ordinary General Public License). 467 | 468 | To apply these terms, attach the following notices to the library. It is 469 | safest to attach them to the start of each source file to most effectively 470 | convey the exclusion of warranty; and each file should have at least the 471 | "copyright" line and a pointer to where the full notice is found. 472 | 473 | {description} 474 | Copyright (C) {year} {fullname} 475 | 476 | This library is free software; you can redistribute it and/or 477 | modify it under the terms of the GNU Lesser General Public 478 | License as published by the Free Software Foundation; either 479 | version 2.1 of the License, or (at your option) any later version. 480 | 481 | This library is distributed in the hope that it will be useful, 482 | but WITHOUT ANY WARRANTY; without even the implied warranty of 483 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 484 | Lesser General Public License for more details. 485 | 486 | You should have received a copy of the GNU Lesser General Public 487 | License along with this library; if not, write to the Free Software 488 | Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 489 | USA 490 | 491 | Also add information on how to contact you by electronic and paper mail. 492 | 493 | You should also get your employer (if you work as a programmer) or your 494 | school, if any, to sign a "copyright disclaimer" for the library, if 495 | necessary. Here is a sample; alter the names: 496 | 497 | Yoyodyne, Inc., hereby disclaims all copyright interest in the 498 | library `Frob' (a library for tweaking knobs) written by James Random 499 | Hacker. 500 | 501 | {signature of Ty Coon}, 1 April 1990 502 | Ty Coon, President of Vice 503 | 504 | That's all there is to it! --------------------------------------------------------------------------------