From 0ad5b3e9003147fce586fd20faf5c5ba31431757 Mon Sep 17 00:00:00 2001 From: El RIDO Date: Thu, 27 Dec 2018 21:32:13 +0100 Subject: [PATCH] implement zlib via web assembly, replacing rawdeflate library --- js/common.js | 4 +- js/privatebin.js | 96 ++- js/rawdeflate-0.5.js | 1675 ------------------------------------------ js/test/CryptTool.js | 13 +- js/zlib-1.2.11.js | 144 ++++ js/zlib-1.2.11.wasm | Bin 0 -> 61388 bytes tpl/bootstrap.php | 4 +- tpl/page.php | 4 +- 8 files changed, 216 insertions(+), 1724 deletions(-) delete mode 100644 js/rawdeflate-0.5.js create mode 100644 js/zlib-1.2.11.js create mode 100644 js/zlib-1.2.11.wasm diff --git a/js/common.js b/js/common.js index 4c7c7faa..96a4bf11 100644 --- a/js/common.js +++ b/js/common.js @@ -10,8 +10,8 @@ global.WebCrypto = require('node-webcrypto-ossl'); // application libraries to test global.$ = global.jQuery = require('./jquery-3.3.1'); -global.RawDeflate = require('./rawdeflate-0.5').RawDeflate; -global.RawDeflate.inflate = require('./rawinflate-0.3').RawDeflate.inflate; +global.RawDeflate = require('./rawinflate-0.3').RawDeflate; +require('./zlib-1.2.11'); require('./prettify'); global.prettyPrint = window.PR.prettyPrint; global.prettyPrintOne = window.PR.prettyPrintOne; diff --git a/js/privatebin.js b/js/privatebin.js index d489d8f7..6d24a580 100644 --- a/js/privatebin.js +++ b/js/privatebin.js @@ -32,6 +32,13 @@ jQuery(document).ready(function() { jQuery.PrivateBin = (function($, RawDeflate) { 'use strict'; + /** + * zlib library interface + * + * @private + */ + let z; + /** * static Helper methods * @@ -619,40 +626,67 @@ jQuery.PrivateBin = (function($, RawDeflate) { } /** - * compress a string, returns base64 encoded data (deflate compression) + * compress a string (deflate compression), returns buffer * * @name CryptTool.compress + * @async * @function * @private * @param {string} message - * @return {string} base64 data + * @param {string} mode + * @return {ArrayBuffer} data */ - function compress(message) + async function compress(message, mode) { - // detect presence of Base64.js, indicating legacy ZeroBin paste - if (typeof Base64 === 'undefined') { - return btoa( utob( RawDeflate.deflate( utob( message ) ) ) ); - } else { - return Base64.toBase64( RawDeflate.deflate( Base64.utob( message ) ) ); + message = StrToArr( + utob(message) + ); + if (mode === 'zlib') { + return z.deflate(message).buffer; } + return message; } /** - * decompress a base64 encoded data (deflate compression), returns string + * decompress potentially base64 encoded, deflate compressed buffer, returns string * * @name CryptTool.decompress + * @async * @function * @private - * @param {string} data base64 data + * @param {ArrayBuffer} data + * @param {string} mode * @return {string} message */ - function decompress(data) + async function decompress(data, mode) { + if (mode === 'zlib' || mode === 'none') { + if (mode === 'zlib') { + data = z.inflate(new Uint8Array(data)).buffer; + } + return btou( + ArrToStr(data) + ); + } // detect presence of Base64.js, indicating legacy ZeroBin paste if (typeof Base64 === 'undefined') { - return btou( RawDeflate.inflate( btou( atob( data ) ) ) ); + return btou( + RawDeflate.inflate( + btou( + atob( + ArrToStr(data) + ) + ) + ) + ); } else { - return Base64.btou( RawDeflate.inflate( Base64.fromBase64( data ) ) ); + return Base64.btou( + RawDeflate.inflate( + Base64.fromBase64( + ArrToStr(data) + ) + ) + ); } } @@ -779,7 +813,7 @@ jQuery.PrivateBin = (function($, RawDeflate) { * @param {string} password * @param {string} message * @param {array} adata - * @return {array} encrypted message & adata containing encryption spec + * @return {array} encrypted message in base64 encoding & adata containing encryption spec */ me.cipher = async function(key, password, message, adata) { @@ -793,17 +827,11 @@ jQuery.PrivateBin = (function($, RawDeflate) { 128, // tag size 'aes', // algorithm 'gcm', // algorithm mode - 'none' // compression - ], encodedSpec = [ - btoa(spec[0]), - btoa(spec[1]), - spec[2], - spec[3], - spec[4], - spec[5], - spec[6], - spec[7] - ]; + 'zlib' // compression + ], encodedSpec = []; + for (let i = 0; i < spec.length; ++i) { + encodedSpec[i] = i < 2 ? btoa(spec[i]) : spec[i]; + } if (adata.length === 0) { // comment adata = encodedSpec; @@ -819,7 +847,7 @@ jQuery.PrivateBin = (function($, RawDeflate) { await window.crypto.subtle.encrypt( cryptoSettings(JSON.stringify(adata), spec), await deriveKey(key, password, spec), - StrToArr(utob(message)) + await compress(message, spec[7]) ) ) ), @@ -864,28 +892,21 @@ jQuery.PrivateBin = (function($, RawDeflate) { } else { throw 'unsupported message format'; } - compression = encodedSpec[7]; let spec = encodedSpec, plainText = ''; spec[0] = atob(spec[0]); spec[1] = atob(spec[1]); try { - plainText = ArrToStr( + return await decompress( await window.crypto.subtle.decrypt( cryptoSettings(adataString, spec), await deriveKey(key, password, spec), StrToArr(atob(cipherMessage)) - ) + ), + encodedSpec[7] ); } catch(err) { return ''; } - if (compression === 'none') { - return btou(plainText); - } else if (compression === 'rawdeflate') { - return decompress(plainText); - } else { - throw 'unsupported compression format'; - } }; /** @@ -4487,7 +4508,7 @@ jQuery.PrivateBin = (function($, RawDeflate) { * @name Controller.init * @function */ - me.init = function() + me.init = async function() { // first load translations I18n.loadTranslations(); @@ -4505,6 +4526,7 @@ jQuery.PrivateBin = (function($, RawDeflate) { Prompt.init(); TopNav.init(); UiHelper.init(); + z = (await zlib); // check whether existing paste needs to be shown try { diff --git a/js/rawdeflate-0.5.js b/js/rawdeflate-0.5.js deleted file mode 100644 index 60eaf61b..00000000 --- a/js/rawdeflate-0.5.js +++ /dev/null @@ -1,1675 +0,0 @@ -/* - * $Id: rawdeflate.js,v 0.5 2013/04/09 14:25:38 dankogai Exp dankogai $ - * - * GNU General Public License, version 2 (GPL-2.0) - * https://opensource.org/licenses/GPL-2.0 - * Original: - * http://www.onicos.com/staff/iz/amuse/javascript/expert/deflate.txt - */ - -(function(ctx){ - -/* Copyright (C) 1999 Masanao Izumo - * Version: 1.0.1 - * LastModified: Dec 25 1999 - */ - -/* Interface: - * data = zip_deflate(src); - */ - -/* constant parameters */ -var zip_WSIZE = 32768; // Sliding Window size -var zip_STORED_BLOCK = 0; -var zip_STATIC_TREES = 1; -var zip_DYN_TREES = 2; - -/* for deflate */ -var zip_DEFAULT_LEVEL = 6; -var zip_FULL_SEARCH = true; -var zip_INBUFSIZ = 32768; // Input buffer size -var zip_INBUF_EXTRA = 64; // Extra buffer -var zip_OUTBUFSIZ = 1024 * 8; -var zip_window_size = 2 * zip_WSIZE; -var zip_MIN_MATCH = 3; -var zip_MAX_MATCH = 258; -var zip_BITS = 16; -// for SMALL_MEM -var zip_LIT_BUFSIZE = 0x2000; -var zip_HASH_BITS = 13; -// for MEDIUM_MEM -// var zip_LIT_BUFSIZE = 0x4000; -// var zip_HASH_BITS = 14; -// for BIG_MEM -// var zip_LIT_BUFSIZE = 0x8000; -// var zip_HASH_BITS = 15; -if(zip_LIT_BUFSIZE > zip_INBUFSIZ) - alert("error: zip_INBUFSIZ is too small"); -if((zip_WSIZE<<1) > (1< zip_BITS-1) - alert("error: zip_HASH_BITS is too large"); -if(zip_HASH_BITS < 8 || zip_MAX_MATCH != 258) - alert("error: Code too clever"); -var zip_DIST_BUFSIZE = zip_LIT_BUFSIZE; -var zip_HASH_SIZE = 1 << zip_HASH_BITS; -var zip_HASH_MASK = zip_HASH_SIZE - 1; -var zip_WMASK = zip_WSIZE - 1; -var zip_NIL = 0; // Tail of hash chains -var zip_TOO_FAR = 4096; -var zip_MIN_LOOKAHEAD = zip_MAX_MATCH + zip_MIN_MATCH + 1; -var zip_MAX_DIST = zip_WSIZE - zip_MIN_LOOKAHEAD; -var zip_SMALLEST = 1; -var zip_MAX_BITS = 15; -var zip_MAX_BL_BITS = 7; -var zip_LENGTH_CODES = 29; -var zip_LITERALS =256; -var zip_END_BLOCK = 256; -var zip_L_CODES = zip_LITERALS + 1 + zip_LENGTH_CODES; -var zip_D_CODES = 30; -var zip_BL_CODES = 19; -var zip_REP_3_6 = 16; -var zip_REPZ_3_10 = 17; -var zip_REPZ_11_138 = 18; -var zip_HEAP_SIZE = 2 * zip_L_CODES + 1; -var zip_H_SHIFT = parseInt((zip_HASH_BITS + zip_MIN_MATCH - 1) / - zip_MIN_MATCH); - -/* variables */ -var zip_free_queue; -var zip_qhead, zip_qtail; -var zip_initflag; -var zip_outbuf = null; -var zip_outcnt, zip_outoff; -var zip_complete; -var zip_window; -var zip_d_buf; -var zip_l_buf; -var zip_prev; -var zip_bi_buf; -var zip_bi_valid; -var zip_block_start; -var zip_ins_h; -var zip_hash_head; -var zip_prev_match; -var zip_match_available; -var zip_match_length; -var zip_prev_length; -var zip_strstart; -var zip_match_start; -var zip_eofile; -var zip_lookahead; -var zip_max_chain_length; -var zip_max_lazy_match; -var zip_compr_level; -var zip_good_match; -var zip_nice_match; -var zip_dyn_ltree; -var zip_dyn_dtree; -var zip_static_ltree; -var zip_static_dtree; -var zip_bl_tree; -var zip_l_desc; -var zip_d_desc; -var zip_bl_desc; -var zip_bl_count; -var zip_heap; -var zip_heap_len; -var zip_heap_max; -var zip_depth; -var zip_length_code; -var zip_dist_code; -var zip_base_length; -var zip_base_dist; -var zip_flag_buf; -var zip_last_lit; -var zip_last_dist; -var zip_last_flags; -var zip_flags; -var zip_flag_bit; -var zip_opt_len; -var zip_static_len; -var zip_deflate_data; -var zip_deflate_pos; - -/* objects (deflate) */ - -var zip_DeflateCT = function() { - this.fc = 0; // frequency count or bit string - this.dl = 0; // father node in Huffman tree or length of bit string -} - -var zip_DeflateTreeDesc = function() { - this.dyn_tree = null; // the dynamic tree - this.static_tree = null; // corresponding static tree or NULL - this.extra_bits = null; // extra bits for each code or NULL - this.extra_base = 0; // base index for extra_bits - this.elems = 0; // max number of elements in the tree - this.max_length = 0; // max bit length for the codes - this.max_code = 0; // largest code with non zero frequency -} - -/* Values for max_lazy_match, good_match and max_chain_length, depending on - * the desired pack level (0..9). The values given below have been tuned to - * exclude worst case performance for pathological files. Better values may be - * found for specific files. - */ -var zip_DeflateConfiguration = function(a, b, c, d) { - this.good_length = a; // reduce lazy search above this match length - this.max_lazy = b; // do not perform lazy search above this match length - this.nice_length = c; // quit search above this match length - this.max_chain = d; -} - -var zip_DeflateBuffer = function() { - this.next = null; - this.len = 0; - this.ptr = new Array(zip_OUTBUFSIZ); - this.off = 0; -} - -/* constant tables */ -var zip_extra_lbits = new Array( - 0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0); -var zip_extra_dbits = new Array( - 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13); -var zip_extra_blbits = new Array( - 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7); -var zip_bl_order = new Array( - 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15); -var zip_configuration_table = new Array( - new zip_DeflateConfiguration(0, 0, 0, 0), - new zip_DeflateConfiguration(4, 4, 8, 4), - new zip_DeflateConfiguration(4, 5, 16, 8), - new zip_DeflateConfiguration(4, 6, 32, 32), - new zip_DeflateConfiguration(4, 4, 16, 16), - new zip_DeflateConfiguration(8, 16, 32, 32), - new zip_DeflateConfiguration(8, 16, 128, 128), - new zip_DeflateConfiguration(8, 32, 128, 256), - new zip_DeflateConfiguration(32, 128, 258, 1024), - new zip_DeflateConfiguration(32, 258, 258, 4096)); - - -/* routines (deflate) */ - -var zip_deflate_start = function(level) { - var i; - - if(!level) - level = zip_DEFAULT_LEVEL; - else if(level < 1) - level = 1; - else if(level > 9) - level = 9; - - zip_compr_level = level; - zip_initflag = false; - zip_eofile = false; - if(zip_outbuf != null) - return; - - zip_free_queue = zip_qhead = zip_qtail = null; - zip_outbuf = new Array(zip_OUTBUFSIZ); - zip_window = new Array(zip_window_size); - zip_d_buf = new Array(zip_DIST_BUFSIZE); - zip_l_buf = new Array(zip_INBUFSIZ + zip_INBUF_EXTRA); - zip_prev = new Array(1 << zip_BITS); - zip_dyn_ltree = new Array(zip_HEAP_SIZE); - for(i = 0; i < zip_HEAP_SIZE; i++) - zip_dyn_ltree[i] = new zip_DeflateCT(); - zip_dyn_dtree = new Array(2*zip_D_CODES+1); - for(i = 0; i < 2*zip_D_CODES+1; i++) - zip_dyn_dtree[i] = new zip_DeflateCT(); - zip_static_ltree = new Array(zip_L_CODES+2); - for(i = 0; i < zip_L_CODES+2; i++) - zip_static_ltree[i] = new zip_DeflateCT(); - zip_static_dtree = new Array(zip_D_CODES); - for(i = 0; i < zip_D_CODES; i++) - zip_static_dtree[i] = new zip_DeflateCT(); - zip_bl_tree = new Array(2*zip_BL_CODES+1); - for(i = 0; i < 2*zip_BL_CODES+1; i++) - zip_bl_tree[i] = new zip_DeflateCT(); - zip_l_desc = new zip_DeflateTreeDesc(); - zip_d_desc = new zip_DeflateTreeDesc(); - zip_bl_desc = new zip_DeflateTreeDesc(); - zip_bl_count = new Array(zip_MAX_BITS+1); - zip_heap = new Array(2*zip_L_CODES+1); - zip_depth = new Array(2*zip_L_CODES+1); - zip_length_code = new Array(zip_MAX_MATCH-zip_MIN_MATCH+1); - zip_dist_code = new Array(512); - zip_base_length = new Array(zip_LENGTH_CODES); - zip_base_dist = new Array(zip_D_CODES); - zip_flag_buf = new Array(parseInt(zip_LIT_BUFSIZE / 8)); -} - -var zip_deflate_end = function() { - zip_free_queue = zip_qhead = zip_qtail = null; - zip_outbuf = null; - zip_window = null; - zip_d_buf = null; - zip_l_buf = null; - zip_prev = null; - zip_dyn_ltree = null; - zip_dyn_dtree = null; - zip_static_ltree = null; - zip_static_dtree = null; - zip_bl_tree = null; - zip_l_desc = null; - zip_d_desc = null; - zip_bl_desc = null; - zip_bl_count = null; - zip_heap = null; - zip_depth = null; - zip_length_code = null; - zip_dist_code = null; - zip_base_length = null; - zip_base_dist = null; - zip_flag_buf = null; -} - -var zip_reuse_queue = function(p) { - p.next = zip_free_queue; - zip_free_queue = p; -} - -var zip_new_queue = function() { - var p; - - if(zip_free_queue != null) - { - p = zip_free_queue; - zip_free_queue = zip_free_queue.next; - } - else - p = new zip_DeflateBuffer(); - p.next = null; - p.len = p.off = 0; - - return p; -} - -var zip_head1 = function(i) { - return zip_prev[zip_WSIZE + i]; -} - -var zip_head2 = function(i, val) { - return zip_prev[zip_WSIZE + i] = val; -} - -/* put_byte is used for the compressed output, put_ubyte for the - * uncompressed output. However unlzw() uses window for its - * suffix table instead of its output buffer, so it does not use put_ubyte - * (to be cleaned up). - */ -var zip_put_byte = function(c) { - zip_outbuf[zip_outoff + zip_outcnt++] = c; - if(zip_outoff + zip_outcnt == zip_OUTBUFSIZ) - zip_qoutbuf(); -} - -/* Output a 16 bit value, lsb first */ -var zip_put_short = function(w) { - w &= 0xffff; - if(zip_outoff + zip_outcnt < zip_OUTBUFSIZ - 2) { - zip_outbuf[zip_outoff + zip_outcnt++] = (w & 0xff); - zip_outbuf[zip_outoff + zip_outcnt++] = (w >>> 8); - } else { - zip_put_byte(w & 0xff); - zip_put_byte(w >>> 8); - } -} - -/* ========================================================================== - * Insert string s in the dictionary and set match_head to the previous head - * of the hash chain (the most recent string with same hash key). Return - * the previous length of the hash chain. - * IN assertion: all calls to to INSERT_STRING are made with consecutive - * input characters and the first MIN_MATCH bytes of s are valid - * (except for the last MIN_MATCH-1 bytes of the input file). - */ -var zip_INSERT_STRING = function() { - zip_ins_h = ((zip_ins_h << zip_H_SHIFT) - ^ (zip_window[zip_strstart + zip_MIN_MATCH - 1] & 0xff)) - & zip_HASH_MASK; - zip_hash_head = zip_head1(zip_ins_h); - zip_prev[zip_strstart & zip_WMASK] = zip_hash_head; - zip_head2(zip_ins_h, zip_strstart); -} - -/* Send a code of the given tree. c and tree must not have side effects */ -var zip_SEND_CODE = function(c, tree) { - zip_send_bits(tree[c].fc, tree[c].dl); -} - -/* Mapping from a distance to a distance code. dist is the distance - 1 and - * must not have side effects. dist_code[256] and dist_code[257] are never - * used. - */ -var zip_D_CODE = function(dist) { - return (dist < 256 ? zip_dist_code[dist] - : zip_dist_code[256 + (dist>>7)]) & 0xff; -} - -/* ========================================================================== - * Compares to subtrees, using the tree depth as tie breaker when - * the subtrees have equal frequency. This minimizes the worst case length. - */ -var zip_SMALLER = function(tree, n, m) { - return tree[n].fc < tree[m].fc || - (tree[n].fc == tree[m].fc && zip_depth[n] <= zip_depth[m]); -} - -/* ========================================================================== - * read string data - */ -var zip_read_buff = function(buff, offset, n) { - var i; - for(i = 0; i < n && zip_deflate_pos < zip_deflate_data.length; i++) - buff[offset + i] = - zip_deflate_data.charCodeAt(zip_deflate_pos++) & 0xff; - return i; -} - -/* ========================================================================== - * Initialize the "longest match" routines for a new file - */ -var zip_lm_init = function() { - var j; - - /* Initialize the hash table. */ - for(j = 0; j < zip_HASH_SIZE; j++) -// zip_head2(j, zip_NIL); - zip_prev[zip_WSIZE + j] = 0; - /* prev will be initialized on the fly */ - - /* Set the default configuration parameters: - */ - zip_max_lazy_match = zip_configuration_table[zip_compr_level].max_lazy; - zip_good_match = zip_configuration_table[zip_compr_level].good_length; - if(!zip_FULL_SEARCH) - zip_nice_match = zip_configuration_table[zip_compr_level].nice_length; - zip_max_chain_length = zip_configuration_table[zip_compr_level].max_chain; - - zip_strstart = 0; - zip_block_start = 0; - - zip_lookahead = zip_read_buff(zip_window, 0, 2 * zip_WSIZE); - if(zip_lookahead <= 0) { - zip_eofile = true; - zip_lookahead = 0; - return; - } - zip_eofile = false; - /* Make sure that we always have enough lookahead. This is important - * if input comes from a device such as a tty. - */ - while(zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile) - zip_fill_window(); - - /* If lookahead < MIN_MATCH, ins_h is garbage, but this is - * not important since only literal bytes will be emitted. - */ - zip_ins_h = 0; - for(j = 0; j < zip_MIN_MATCH - 1; j++) { -// UPDATE_HASH(ins_h, window[j]); - zip_ins_h = ((zip_ins_h << zip_H_SHIFT) ^ (zip_window[j] & 0xff)) & zip_HASH_MASK; - } -} - -/* ========================================================================== - * Set match_start to the longest match starting at the given string and - * return its length. Matches shorter or equal to prev_length are discarded, - * in which case the result is equal to prev_length and match_start is - * garbage. - * IN assertions: cur_match is the head of the hash chain for the current - * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 - */ -var zip_longest_match = function(cur_match) { - var chain_length = zip_max_chain_length; // max hash chain length - var scanp = zip_strstart; // current string - var matchp; // matched string - var len; // length of current match - var best_len = zip_prev_length; // best match length so far - - /* Stop when cur_match becomes <= limit. To simplify the code, - * we prevent matches with the string of window index 0. - */ - var limit = (zip_strstart > zip_MAX_DIST ? zip_strstart - zip_MAX_DIST : zip_NIL); - - var strendp = zip_strstart + zip_MAX_MATCH; - var scan_end1 = zip_window[scanp + best_len - 1]; - var scan_end = zip_window[scanp + best_len]; - - /* Do not waste too much time if we already have a good match: */ - if(zip_prev_length >= zip_good_match) - chain_length >>= 2; - -// Assert(encoder->strstart <= window_size-MIN_LOOKAHEAD, "insufficient lookahead"); - - do { -// Assert(cur_match < encoder->strstart, "no future"); - matchp = cur_match; - - /* Skip to next match if the match length cannot increase - * or if the match length is less than 2: - */ - if(zip_window[matchp + best_len] != scan_end || - zip_window[matchp + best_len - 1] != scan_end1 || - zip_window[matchp] != zip_window[scanp] || - zip_window[++matchp] != zip_window[scanp + 1]) { - continue; - } - - /* The check at best_len-1 can be removed because it will be made - * again later. (This heuristic is not always a win.) - * It is not necessary to compare scan[2] and match[2] since they - * are always equal when the other bytes match, given that - * the hash keys are equal and that HASH_BITS >= 8. - */ - scanp += 2; - matchp++; - - /* We check for insufficient lookahead only every 8th comparison; - * the 256th check will be made at strstart+258. - */ - do { - } while(zip_window[++scanp] == zip_window[++matchp] && - zip_window[++scanp] == zip_window[++matchp] && - zip_window[++scanp] == zip_window[++matchp] && - zip_window[++scanp] == zip_window[++matchp] && - zip_window[++scanp] == zip_window[++matchp] && - zip_window[++scanp] == zip_window[++matchp] && - zip_window[++scanp] == zip_window[++matchp] && - zip_window[++scanp] == zip_window[++matchp] && - scanp < strendp); - - len = zip_MAX_MATCH - (strendp - scanp); - scanp = strendp - zip_MAX_MATCH; - - if(len > best_len) { - zip_match_start = cur_match; - best_len = len; - if(zip_FULL_SEARCH) { - if(len >= zip_MAX_MATCH) break; - } else { - if(len >= zip_nice_match) break; - } - - scan_end1 = zip_window[scanp + best_len-1]; - scan_end = zip_window[scanp + best_len]; - } - } while((cur_match = zip_prev[cur_match & zip_WMASK]) > limit - && --chain_length != 0); - - return best_len; -} - -/* ========================================================================== - * Fill the window when the lookahead becomes insufficient. - * Updates strstart and lookahead, and sets eofile if end of input file. - * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0 - * OUT assertions: at least one byte has been read, or eofile is set; - * file reads are performed for at least two bytes (required for the - * translate_eol option). - */ -var zip_fill_window = function() { - var n, m; - - // Amount of free space at the end of the window. - var more = zip_window_size - zip_lookahead - zip_strstart; - - /* If the window is almost full and there is insufficient lookahead, - * move the upper half to the lower one to make room in the upper half. - */ - if(more == -1) { - /* Very unlikely, but possible on 16 bit machine if strstart == 0 - * and lookahead == 1 (input done one byte at time) - */ - more--; - } else if(zip_strstart >= zip_WSIZE + zip_MAX_DIST) { - /* By the IN assertion, the window is not empty so we can't confuse - * more == 0 with more == 64K on a 16 bit machine. - */ -// Assert(window_size == (ulg)2*WSIZE, "no sliding with BIG_MEM"); - -// System.arraycopy(window, WSIZE, window, 0, WSIZE); - for(n = 0; n < zip_WSIZE; n++) - zip_window[n] = zip_window[n + zip_WSIZE]; - - zip_match_start -= zip_WSIZE; - zip_strstart -= zip_WSIZE; /* we now have strstart >= MAX_DIST: */ - zip_block_start -= zip_WSIZE; - - for(n = 0; n < zip_HASH_SIZE; n++) { - m = zip_head1(n); - zip_head2(n, m >= zip_WSIZE ? m - zip_WSIZE : zip_NIL); - } - for(n = 0; n < zip_WSIZE; n++) { - /* If n is not on any hash chain, prev[n] is garbage but - * its value will never be used. - */ - m = zip_prev[n]; - zip_prev[n] = (m >= zip_WSIZE ? m - zip_WSIZE : zip_NIL); - } - more += zip_WSIZE; - } - // At this point, more >= 2 - if(!zip_eofile) { - n = zip_read_buff(zip_window, zip_strstart + zip_lookahead, more); - if(n <= 0) - zip_eofile = true; - else - zip_lookahead += n; - } -} - -/* ========================================================================== - * Processes a new input file and return its compressed length. This - * function does not perform lazy evaluationof matches and inserts - * new strings in the dictionary only for unmatched strings or for short - * matches. It is used only for the fast compression options. - */ -var zip_deflate_fast = function() { - while(zip_lookahead != 0 && zip_qhead == null) { - var flush; // set if current block must be flushed - - /* Insert the string window[strstart .. strstart+2] in the - * dictionary, and set hash_head to the head of the hash chain: - */ - zip_INSERT_STRING(); - - /* Find the longest match, discarding those <= prev_length. - * At this point we have always match_length < MIN_MATCH - */ - if(zip_hash_head != zip_NIL && - zip_strstart - zip_hash_head <= zip_MAX_DIST) { - /* To simplify the code, we prevent matches with the string - * of window index 0 (in particular we have to avoid a match - * of the string with itself at the start of the input file). - */ - zip_match_length = zip_longest_match(zip_hash_head); - /* longest_match() sets match_start */ - if(zip_match_length > zip_lookahead) - zip_match_length = zip_lookahead; - } - if(zip_match_length >= zip_MIN_MATCH) { -// check_match(strstart, match_start, match_length); - - flush = zip_ct_tally(zip_strstart - zip_match_start, - zip_match_length - zip_MIN_MATCH); - zip_lookahead -= zip_match_length; - - /* Insert new strings in the hash table only if the match length - * is not too large. This saves time but degrades compression. - */ - if(zip_match_length <= zip_max_lazy_match) { - zip_match_length--; // string at strstart already in hash table - do { - zip_strstart++; - zip_INSERT_STRING(); - /* strstart never exceeds WSIZE-MAX_MATCH, so there are - * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH - * these bytes are garbage, but it does not matter since - * the next lookahead bytes will be emitted as literals. - */ - } while(--zip_match_length != 0); - zip_strstart++; - } else { - zip_strstart += zip_match_length; - zip_match_length = 0; - zip_ins_h = zip_window[zip_strstart] & 0xff; -// UPDATE_HASH(ins_h, window[strstart + 1]); - zip_ins_h = ((zip_ins_h< zip_lookahead) - zip_match_length = zip_lookahead; - - /* Ignore a length 3 match if it is too distant: */ - if(zip_match_length == zip_MIN_MATCH && - zip_strstart - zip_match_start > zip_TOO_FAR) { - /* If prev_match is also MIN_MATCH, match_start is garbage - * but we will ignore the current match anyway. - */ - zip_match_length--; - } - } - /* If there was a match at the previous step and the current - * match is not better, output the previous match: - */ - if(zip_prev_length >= zip_MIN_MATCH && - zip_match_length <= zip_prev_length) { - var flush; // set if current block must be flushed - -// check_match(strstart - 1, prev_match, prev_length); - flush = zip_ct_tally(zip_strstart - 1 - zip_prev_match, - zip_prev_length - zip_MIN_MATCH); - - /* Insert in hash table all strings up to the end of the match. - * strstart-1 and strstart are already inserted. - */ - zip_lookahead -= zip_prev_length - 1; - zip_prev_length -= 2; - do { - zip_strstart++; - zip_INSERT_STRING(); - /* strstart never exceeds WSIZE-MAX_MATCH, so there are - * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH - * these bytes are garbage, but it does not matter since the - * next lookahead bytes will always be emitted as literals. - */ - } while(--zip_prev_length != 0); - zip_match_available = 0; - zip_match_length = zip_MIN_MATCH - 1; - zip_strstart++; - if(flush) { - zip_flush_block(0); - zip_block_start = zip_strstart; - } - } else if(zip_match_available != 0) { - /* If there was no match at the previous position, output a - * single literal. If there was a match but the current match - * is longer, truncate the previous match to a single literal. - */ - if(zip_ct_tally(0, zip_window[zip_strstart - 1] & 0xff)) { - zip_flush_block(0); - zip_block_start = zip_strstart; - } - zip_strstart++; - zip_lookahead--; - } else { - /* There is no previous match to compare with, wait for - * the next step to decide. - */ - zip_match_available = 1; - zip_strstart++; - zip_lookahead--; - } - - /* Make sure that we always have enough lookahead, except - * at the end of the input file. We need MAX_MATCH bytes - * for the next match, plus MIN_MATCH bytes to insert the - * string following the next match. - */ - while(zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile) - zip_fill_window(); - } -} - -var zip_init_deflate = function() { - if(zip_eofile) - return; - zip_bi_buf = 0; - zip_bi_valid = 0; - zip_ct_init(); - zip_lm_init(); - - zip_qhead = null; - zip_outcnt = 0; - zip_outoff = 0; - zip_match_available = 0; - - if(zip_compr_level <= 3) - { - zip_prev_length = zip_MIN_MATCH - 1; - zip_match_length = 0; - } - else - { - zip_match_length = zip_MIN_MATCH - 1; - zip_match_available = 0; - zip_match_available = 0; - } - - zip_complete = false; -} - -/* ========================================================================== - * Same as above, but achieves better compression. We use a lazy - * evaluation for matches: a match is finally adopted only if there is - * no better match at the next window position. - */ -var zip_deflate_internal = function(buff, off, buff_size) { - var n; - - if(!zip_initflag) - { - zip_init_deflate(); - zip_initflag = true; - if(zip_lookahead == 0) { // empty - zip_complete = true; - return 0; - } - } - - if((n = zip_qcopy(buff, off, buff_size)) == buff_size) - return buff_size; - - if(zip_complete) - return n; - - if(zip_compr_level <= 3) // optimized for speed - zip_deflate_fast(); - else - zip_deflate_better(); - if(zip_lookahead == 0) { - if(zip_match_available != 0) - zip_ct_tally(0, zip_window[zip_strstart - 1] & 0xff); - zip_flush_block(1); - zip_complete = true; - } - return n + zip_qcopy(buff, n + off, buff_size - n); -} - -var zip_qcopy = function(buff, off, buff_size) { - var n, i, j; - - n = 0; - while(zip_qhead != null && n < buff_size) - { - i = buff_size - n; - if(i > zip_qhead.len) - i = zip_qhead.len; -// System.arraycopy(qhead.ptr, qhead.off, buff, off + n, i); - for(j = 0; j < i; j++) - buff[off + n + j] = zip_qhead.ptr[zip_qhead.off + j]; - - zip_qhead.off += i; - zip_qhead.len -= i; - n += i; - if(zip_qhead.len == 0) { - var p; - p = zip_qhead; - zip_qhead = zip_qhead.next; - zip_reuse_queue(p); - } - } - - if(n == buff_size) - return n; - - if(zip_outoff < zip_outcnt) { - i = buff_size - n; - if(i > zip_outcnt - zip_outoff) - i = zip_outcnt - zip_outoff; - // System.arraycopy(outbuf, outoff, buff, off + n, i); - for(j = 0; j < i; j++) - buff[off + n + j] = zip_outbuf[zip_outoff + j]; - zip_outoff += i; - n += i; - if(zip_outcnt == zip_outoff) - zip_outcnt = zip_outoff = 0; - } - return n; -} - -/* ========================================================================== - * Allocate the match buffer, initialize the various tables and save the - * location of the internal file attribute (ascii/binary) and method - * (DEFLATE/STORE). - */ -var zip_ct_init = function() { - var n; // iterates over tree elements - var bits; // bit counter - var length; // length value - var code; // code value - var dist; // distance index - - if(zip_static_dtree[0].dl != 0) return; // ct_init already called - - zip_l_desc.dyn_tree = zip_dyn_ltree; - zip_l_desc.static_tree = zip_static_ltree; - zip_l_desc.extra_bits = zip_extra_lbits; - zip_l_desc.extra_base = zip_LITERALS + 1; - zip_l_desc.elems = zip_L_CODES; - zip_l_desc.max_length = zip_MAX_BITS; - zip_l_desc.max_code = 0; - - zip_d_desc.dyn_tree = zip_dyn_dtree; - zip_d_desc.static_tree = zip_static_dtree; - zip_d_desc.extra_bits = zip_extra_dbits; - zip_d_desc.extra_base = 0; - zip_d_desc.elems = zip_D_CODES; - zip_d_desc.max_length = zip_MAX_BITS; - zip_d_desc.max_code = 0; - - zip_bl_desc.dyn_tree = zip_bl_tree; - zip_bl_desc.static_tree = null; - zip_bl_desc.extra_bits = zip_extra_blbits; - zip_bl_desc.extra_base = 0; - zip_bl_desc.elems = zip_BL_CODES; - zip_bl_desc.max_length = zip_MAX_BL_BITS; - zip_bl_desc.max_code = 0; - - // Initialize the mapping length (0..255) -> length code (0..28) - length = 0; - for(code = 0; code < zip_LENGTH_CODES-1; code++) { - zip_base_length[code] = length; - for(n = 0; n < (1< dist code (0..29) */ - dist = 0; - for(code = 0 ; code < 16; code++) { - zip_base_dist[code] = dist; - for(n = 0; n < (1<>= 7; // from now on, all distances are divided by 128 - for( ; code < zip_D_CODES; code++) { - zip_base_dist[code] = dist << 7; - for(n = 0; n < (1<<(zip_extra_dbits[code]-7)); n++) - zip_dist_code[256 + dist++] = code; - } - // Assert (dist == 256, "ct_init: 256+dist != 512"); - - // Construct the codes of the static literal tree - for(bits = 0; bits <= zip_MAX_BITS; bits++) - zip_bl_count[bits] = 0; - n = 0; - while(n <= 143) { zip_static_ltree[n++].dl = 8; zip_bl_count[8]++; } - while(n <= 255) { zip_static_ltree[n++].dl = 9; zip_bl_count[9]++; } - while(n <= 279) { zip_static_ltree[n++].dl = 7; zip_bl_count[7]++; } - while(n <= 287) { zip_static_ltree[n++].dl = 8; zip_bl_count[8]++; } - /* Codes 286 and 287 do not exist, but we must include them in the - * tree construction to get a canonical Huffman tree (longest code - * all ones) - */ - zip_gen_codes(zip_static_ltree, zip_L_CODES + 1); - - /* The static distance tree is trivial: */ - for(n = 0; n < zip_D_CODES; n++) { - zip_static_dtree[n].dl = 5; - zip_static_dtree[n].fc = zip_bi_reverse(n, 5); - } - - // Initialize the first block of the first file: - zip_init_block(); -} - -/* ========================================================================== - * Initialize a new block. - */ -var zip_init_block = function() { - var n; // iterates over tree elements - - // Initialize the trees. - for(n = 0; n < zip_L_CODES; n++) zip_dyn_ltree[n].fc = 0; - for(n = 0; n < zip_D_CODES; n++) zip_dyn_dtree[n].fc = 0; - for(n = 0; n < zip_BL_CODES; n++) zip_bl_tree[n].fc = 0; - - zip_dyn_ltree[zip_END_BLOCK].fc = 1; - zip_opt_len = zip_static_len = 0; - zip_last_lit = zip_last_dist = zip_last_flags = 0; - zip_flags = 0; - zip_flag_bit = 1; -} - -/* ========================================================================== - * Restore the heap property by moving down the tree starting at node k, - * exchanging a node with the smallest of its two sons if necessary, stopping - * when the heap property is re-established (each father smaller than its - * two sons). - */ -var zip_pqdownheap = function( - tree, // the tree to restore - k) { // node to move down - var v = zip_heap[k]; - var j = k << 1; // left son of k - - while(j <= zip_heap_len) { - // Set j to the smallest of the two sons: - if(j < zip_heap_len && - zip_SMALLER(tree, zip_heap[j + 1], zip_heap[j])) - j++; - - // Exit if v is smaller than both sons - if(zip_SMALLER(tree, v, zip_heap[j])) - break; - - // Exchange v with the smallest son - zip_heap[k] = zip_heap[j]; - k = j; - - // And continue down the tree, setting j to the left son of k - j <<= 1; - } - zip_heap[k] = v; -} - -/* ========================================================================== - * Compute the optimal bit lengths for a tree and update the total bit length - * for the current block. - * IN assertion: the fields freq and dad are set, heap[heap_max] and - * above are the tree nodes sorted by increasing frequency. - * OUT assertions: the field len is set to the optimal bit length, the - * array bl_count contains the frequencies for each bit length. - * The length opt_len is updated; static_len is also updated if stree is - * not null. - */ -var zip_gen_bitlen = function(desc) { // the tree descriptor - var tree = desc.dyn_tree; - var extra = desc.extra_bits; - var base = desc.extra_base; - var max_code = desc.max_code; - var max_length = desc.max_length; - var stree = desc.static_tree; - var h; // heap index - var n, m; // iterate over the tree elements - var bits; // bit length - var xbits; // extra bits - var f; // frequency - var overflow = 0; // number of elements with bit length too large - - for(bits = 0; bits <= zip_MAX_BITS; bits++) - zip_bl_count[bits] = 0; - - /* In a first pass, compute the optimal bit lengths (which may - * overflow in the case of the bit length tree). - */ - tree[zip_heap[zip_heap_max]].dl = 0; // root of the heap - - for(h = zip_heap_max + 1; h < zip_HEAP_SIZE; h++) { - n = zip_heap[h]; - bits = tree[tree[n].dl].dl + 1; - if(bits > max_length) { - bits = max_length; - overflow++; - } - tree[n].dl = bits; - // We overwrite tree[n].dl which is no longer needed - - if(n > max_code) - continue; // not a leaf node - - zip_bl_count[bits]++; - xbits = 0; - if(n >= base) - xbits = extra[n - base]; - f = tree[n].fc; - zip_opt_len += f * (bits + xbits); - if(stree != null) - zip_static_len += f * (stree[n].dl + xbits); - } - if(overflow == 0) - return; - - // This happens for example on obj2 and pic of the Calgary corpus - - // Find the first bit length which could increase: - do { - bits = max_length - 1; - while(zip_bl_count[bits] == 0) - bits--; - zip_bl_count[bits]--; // move one leaf down the tree - zip_bl_count[bits + 1] += 2; // move one overflow item as its brother - zip_bl_count[max_length]--; - /* The brother of the overflow item also moves one step up, - * but this does not affect bl_count[max_length] - */ - overflow -= 2; - } while(overflow > 0); - - /* Now recompute all bit lengths, scanning in increasing frequency. - * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all - * lengths instead of fixing only the wrong ones. This idea is taken - * from 'ar' written by Haruhiko Okumura.) - */ - for(bits = max_length; bits != 0; bits--) { - n = zip_bl_count[bits]; - while(n != 0) { - m = zip_heap[--h]; - if(m > max_code) - continue; - if(tree[m].dl != bits) { - zip_opt_len += (bits - tree[m].dl) * tree[m].fc; - tree[m].fc = bits; - } - n--; - } - } -} - - /* ========================================================================== - * Generate the codes for a given tree and bit counts (which need not be - * optimal). - * IN assertion: the array bl_count contains the bit length statistics for - * the given tree and the field len is set for all tree elements. - * OUT assertion: the field code is set for all tree elements of non - * zero code length. - */ -var zip_gen_codes = function(tree, // the tree to decorate - max_code) { // largest code with non zero frequency - var next_code = new Array(zip_MAX_BITS+1); // next code value for each bit length - var code = 0; // running code value - var bits; // bit index - var n; // code index - - /* The distribution counts are first used to generate the code values - * without bit reversal. - */ - for(bits = 1; bits <= zip_MAX_BITS; bits++) { - code = ((code + zip_bl_count[bits-1]) << 1); - next_code[bits] = code; - } - - /* Check that the bit counts in bl_count are consistent. The last code - * must be all ones. - */ -// Assert (code + encoder->bl_count[MAX_BITS]-1 == (1<> 1; n >= 1; n--) - zip_pqdownheap(tree, n); - - /* Construct the Huffman tree by repeatedly combining the least two - * frequent nodes. - */ - do { - n = zip_heap[zip_SMALLEST]; - zip_heap[zip_SMALLEST] = zip_heap[zip_heap_len--]; - zip_pqdownheap(tree, zip_SMALLEST); - - m = zip_heap[zip_SMALLEST]; // m = node of next least frequency - - // keep the nodes sorted by frequency - zip_heap[--zip_heap_max] = n; - zip_heap[--zip_heap_max] = m; - - // Create a new node father of n and m - tree[node].fc = tree[n].fc + tree[m].fc; -// depth[node] = (char)(MAX(depth[n], depth[m]) + 1); - if(zip_depth[n] > zip_depth[m] + 1) - zip_depth[node] = zip_depth[n]; - else - zip_depth[node] = zip_depth[m] + 1; - tree[n].dl = tree[m].dl = node; - - // and insert the new node in the heap - zip_heap[zip_SMALLEST] = node++; - zip_pqdownheap(tree, zip_SMALLEST); - - } while(zip_heap_len >= 2); - - zip_heap[--zip_heap_max] = zip_heap[zip_SMALLEST]; - - /* At this point, the fields freq and dad are set. We can now - * generate the bit lengths. - */ - zip_gen_bitlen(desc); - - // The field len is now set, we can generate the bit codes - zip_gen_codes(tree, max_code); -} - -/* ========================================================================== - * Scan a literal or distance tree to determine the frequencies of the codes - * in the bit length tree. Updates opt_len to take into account the repeat - * counts. (The contribution of the bit length codes will be added later - * during the construction of bl_tree.) - */ -var zip_scan_tree = function(tree,// the tree to be scanned - max_code) { // and its largest code of non zero frequency - var n; // iterates over all tree elements - var prevlen = -1; // last emitted length - var curlen; // length of current code - var nextlen = tree[0].dl; // length of next code - var count = 0; // repeat count of the current code - var max_count = 7; // max repeat count - var min_count = 4; // min repeat count - - if(nextlen == 0) { - max_count = 138; - min_count = 3; - } - tree[max_code + 1].dl = 0xffff; // guard - - for(n = 0; n <= max_code; n++) { - curlen = nextlen; - nextlen = tree[n + 1].dl; - if(++count < max_count && curlen == nextlen) - continue; - else if(count < min_count) - zip_bl_tree[curlen].fc += count; - else if(curlen != 0) { - if(curlen != prevlen) - zip_bl_tree[curlen].fc++; - zip_bl_tree[zip_REP_3_6].fc++; - } else if(count <= 10) - zip_bl_tree[zip_REPZ_3_10].fc++; - else - zip_bl_tree[zip_REPZ_11_138].fc++; - count = 0; prevlen = curlen; - if(nextlen == 0) { - max_count = 138; - min_count = 3; - } else if(curlen == nextlen) { - max_count = 6; - min_count = 3; - } else { - max_count = 7; - min_count = 4; - } - } -} - - /* ========================================================================== - * Send a literal or distance tree in compressed form, using the codes in - * bl_tree. - */ -var zip_send_tree = function(tree, // the tree to be scanned - max_code) { // and its largest code of non zero frequency - var n; // iterates over all tree elements - var prevlen = -1; // last emitted length - var curlen; // length of current code - var nextlen = tree[0].dl; // length of next code - var count = 0; // repeat count of the current code - var max_count = 7; // max repeat count - var min_count = 4; // min repeat count - - /* tree[max_code+1].dl = -1; */ /* guard already set */ - if(nextlen == 0) { - max_count = 138; - min_count = 3; - } - - for(n = 0; n <= max_code; n++) { - curlen = nextlen; - nextlen = tree[n+1].dl; - if(++count < max_count && curlen == nextlen) { - continue; - } else if(count < min_count) { - do { zip_SEND_CODE(curlen, zip_bl_tree); } while(--count != 0); - } else if(curlen != 0) { - if(curlen != prevlen) { - zip_SEND_CODE(curlen, zip_bl_tree); - count--; - } - // Assert(count >= 3 && count <= 6, " 3_6?"); - zip_SEND_CODE(zip_REP_3_6, zip_bl_tree); - zip_send_bits(count - 3, 2); - } else if(count <= 10) { - zip_SEND_CODE(zip_REPZ_3_10, zip_bl_tree); - zip_send_bits(count-3, 3); - } else { - zip_SEND_CODE(zip_REPZ_11_138, zip_bl_tree); - zip_send_bits(count-11, 7); - } - count = 0; - prevlen = curlen; - if(nextlen == 0) { - max_count = 138; - min_count = 3; - } else if(curlen == nextlen) { - max_count = 6; - min_count = 3; - } else { - max_count = 7; - min_count = 4; - } - } -} - -/* ========================================================================== - * Construct the Huffman tree for the bit lengths and return the index in - * bl_order of the last bit length code to send. - */ -var zip_build_bl_tree = function() { - var max_blindex; // index of last bit length code of non zero freq - - // Determine the bit length frequencies for literal and distance trees - zip_scan_tree(zip_dyn_ltree, zip_l_desc.max_code); - zip_scan_tree(zip_dyn_dtree, zip_d_desc.max_code); - - // Build the bit length tree: - zip_build_tree(zip_bl_desc); - /* opt_len now includes the length of the tree representations, except - * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. - */ - - /* Determine the number of bit length codes to send. The pkzip format - * requires that at least 4 bit length codes be sent. (appnote.txt says - * 3 but the actual value used is 4.) - */ - for(max_blindex = zip_BL_CODES-1; max_blindex >= 3; max_blindex--) { - if(zip_bl_tree[zip_bl_order[max_blindex]].dl != 0) break; - } - /* Update opt_len to include the bit length tree and counts */ - zip_opt_len += 3*(max_blindex+1) + 5+5+4; -// Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", -// encoder->opt_len, encoder->static_len)); - - return max_blindex; -} - -/* ========================================================================== - * Send the header for a block using dynamic Huffman trees: the counts, the - * lengths of the bit length codes, the literal tree and the distance tree. - * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. - */ -var zip_send_all_trees = function(lcodes, dcodes, blcodes) { // number of codes for each tree - var rank; // index in bl_order - -// Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); -// Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, -// "too many codes"); -// Tracev((stderr, "\nbl counts: ")); - zip_send_bits(lcodes-257, 5); // not +255 as stated in appnote.txt - zip_send_bits(dcodes-1, 5); - zip_send_bits(blcodes-4, 4); // not -3 as stated in appnote.txt - for(rank = 0; rank < blcodes; rank++) { -// Tracev((stderr, "\nbl code %2d ", bl_order[rank])); - zip_send_bits(zip_bl_tree[zip_bl_order[rank]].dl, 3); - } - - // send the literal tree - zip_send_tree(zip_dyn_ltree,lcodes-1); - - // send the distance tree - zip_send_tree(zip_dyn_dtree,dcodes-1); -} - -/* ========================================================================== - * Determine the best encoding for the current block: dynamic trees, static - * trees or store, and output the encoded block to the zip file. - */ -var zip_flush_block = function(eof) { // true if this is the last block for a file - var opt_lenb, static_lenb; // opt_len and static_len in bytes - var max_blindex; // index of last bit length code of non zero freq - var stored_len; // length of input block - - stored_len = zip_strstart - zip_block_start; - zip_flag_buf[zip_last_flags] = zip_flags; // Save the flags for the last 8 items - - // Construct the literal and distance trees - zip_build_tree(zip_l_desc); -// Tracev((stderr, "\nlit data: dyn %ld, stat %ld", -// encoder->opt_len, encoder->static_len)); - - zip_build_tree(zip_d_desc); -// Tracev((stderr, "\ndist data: dyn %ld, stat %ld", -// encoder->opt_len, encoder->static_len)); - /* At this point, opt_len and static_len are the total bit lengths of - * the compressed block data, excluding the tree representations. - */ - - /* Build the bit length tree for the above two trees, and get the index - * in bl_order of the last bit length code to send. - */ - max_blindex = zip_build_bl_tree(); - - // Determine the best encoding. Compute first the block length in bytes - opt_lenb = (zip_opt_len +3+7)>>3; - static_lenb = (zip_static_len+3+7)>>3; - -// Trace((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ", -// opt_lenb, encoder->opt_len, -// static_lenb, encoder->static_len, stored_len, -// encoder->last_lit, encoder->last_dist)); - - if(static_lenb <= opt_lenb) - opt_lenb = static_lenb; - if(stored_len + 4 <= opt_lenb // 4: two words for the lengths - && zip_block_start >= 0) { - var i; - - /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. - * Otherwise we can't have processed more than WSIZE input bytes since - * the last block flush, because compression would have been - * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to - * transform a block into a stored block. - */ - zip_send_bits((zip_STORED_BLOCK<<1)+eof, 3); /* send block type */ - zip_bi_windup(); /* align on byte boundary */ - zip_put_short(stored_len); - zip_put_short(~stored_len); - - // copy block -/* - p = &window[block_start]; - for(i = 0; i < stored_len; i++) - put_byte(p[i]); -*/ - for(i = 0; i < stored_len; i++) - zip_put_byte(zip_window[zip_block_start + i]); - - } else if(static_lenb == opt_lenb) { - zip_send_bits((zip_STATIC_TREES<<1)+eof, 3); - zip_compress_block(zip_static_ltree, zip_static_dtree); - } else { - zip_send_bits((zip_DYN_TREES<<1)+eof, 3); - zip_send_all_trees(zip_l_desc.max_code+1, - zip_d_desc.max_code+1, - max_blindex+1); - zip_compress_block(zip_dyn_ltree, zip_dyn_dtree); - } - - zip_init_block(); - - if(eof != 0) - zip_bi_windup(); -} - -/* ========================================================================== - * Save the match info and tally the frequency counts. Return true if - * the current block must be flushed. - */ -var zip_ct_tally = function( - dist, // distance of matched string - lc) { // match length-MIN_MATCH or unmatched char (if dist==0) - zip_l_buf[zip_last_lit++] = lc; - if(dist == 0) { - // lc is the unmatched char - zip_dyn_ltree[lc].fc++; - } else { - // Here, lc is the match length - MIN_MATCH - dist--; // dist = match distance - 1 -// Assert((ush)dist < (ush)MAX_DIST && -// (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && -// (ush)D_CODE(dist) < (ush)D_CODES, "ct_tally: bad match"); - - zip_dyn_ltree[zip_length_code[lc]+zip_LITERALS+1].fc++; - zip_dyn_dtree[zip_D_CODE(dist)].fc++; - - zip_d_buf[zip_last_dist++] = dist; - zip_flags |= zip_flag_bit; - } - zip_flag_bit <<= 1; - - // Output the flags if they fill a byte - if((zip_last_lit & 7) == 0) { - zip_flag_buf[zip_last_flags++] = zip_flags; - zip_flags = 0; - zip_flag_bit = 1; - } - // Try to guess if it is profitable to stop the current block here - if(zip_compr_level > 2 && (zip_last_lit & 0xfff) == 0) { - // Compute an upper bound for the compressed length - var out_length = zip_last_lit * 8; - var in_length = zip_strstart - zip_block_start; - var dcode; - - for(dcode = 0; dcode < zip_D_CODES; dcode++) { - out_length += zip_dyn_dtree[dcode].fc * (5 + zip_extra_dbits[dcode]); - } - out_length >>= 3; -// Trace((stderr,"\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ", -// encoder->last_lit, encoder->last_dist, in_length, out_length, -// 100L - out_length*100L/in_length)); - if(zip_last_dist < parseInt(zip_last_lit/2) && - out_length < parseInt(in_length/2)) - return true; - } - return (zip_last_lit == zip_LIT_BUFSIZE-1 || - zip_last_dist == zip_DIST_BUFSIZE); - /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K - * on 16 bit machines and because stored blocks are restricted to - * 64K-1 bytes. - */ -} - - /* ========================================================================== - * Send the block data compressed using the given Huffman trees - */ -var zip_compress_block = function( - ltree, // literal tree - dtree) { // distance tree - var dist; // distance of matched string - var lc; // match length or unmatched char (if dist == 0) - var lx = 0; // running index in l_buf - var dx = 0; // running index in d_buf - var fx = 0; // running index in flag_buf - var flag = 0; // current flags - var code; // the code to send - var extra; // number of extra bits to send - - if(zip_last_lit != 0) do { - if((lx & 7) == 0) - flag = zip_flag_buf[fx++]; - lc = zip_l_buf[lx++] & 0xff; - if((flag & 1) == 0) { - zip_SEND_CODE(lc, ltree); /* send a literal byte */ -// Tracecv(isgraph(lc), (stderr," '%c' ", lc)); - } else { - // Here, lc is the match length - MIN_MATCH - code = zip_length_code[lc]; - zip_SEND_CODE(code+zip_LITERALS+1, ltree); // send the length code - extra = zip_extra_lbits[code]; - if(extra != 0) { - lc -= zip_base_length[code]; - zip_send_bits(lc, extra); // send the extra length bits - } - dist = zip_d_buf[dx++]; - // Here, dist is the match distance - 1 - code = zip_D_CODE(dist); -// Assert (code < D_CODES, "bad d_code"); - - zip_SEND_CODE(code, dtree); // send the distance code - extra = zip_extra_dbits[code]; - if(extra != 0) { - dist -= zip_base_dist[code]; - zip_send_bits(dist, extra); // send the extra distance bits - } - } // literal or match pair ? - flag >>= 1; - } while(lx < zip_last_lit); - - zip_SEND_CODE(zip_END_BLOCK, ltree); -} - -/* ========================================================================== - * Send a value on a given number of bits. - * IN assertion: length <= 16 and value fits in length bits. - */ -var zip_Buf_size = 16; // bit size of bi_buf -var zip_send_bits = function( - value, // value to send - length) { // number of bits - /* If not enough room in bi_buf, use (valid) bits from bi_buf and - * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid)) - * unused bits in value. - */ - if(zip_bi_valid > zip_Buf_size - length) { - zip_bi_buf |= (value << zip_bi_valid); - zip_put_short(zip_bi_buf); - zip_bi_buf = (value >> (zip_Buf_size - zip_bi_valid)); - zip_bi_valid += length - zip_Buf_size; - } else { - zip_bi_buf |= value << zip_bi_valid; - zip_bi_valid += length; - } -} - -/* ========================================================================== - * Reverse the first len bits of a code, using straightforward code (a faster - * method would use a table) - * IN assertion: 1 <= len <= 15 - */ -var zip_bi_reverse = function( - code, // the value to invert - len) { // its bit length - var res = 0; - do { - res |= code & 1; - code >>= 1; - res <<= 1; - } while(--len > 0); - return res >> 1; -} - -/* ========================================================================== - * Write out any remaining bits in an incomplete byte. - */ -var zip_bi_windup = function() { - if(zip_bi_valid > 8) { - zip_put_short(zip_bi_buf); - } else if(zip_bi_valid > 0) { - zip_put_byte(zip_bi_buf); - } - zip_bi_buf = 0; - zip_bi_valid = 0; -} - -var zip_qoutbuf = function() { - if(zip_outcnt != 0) { - var q, i; - q = zip_new_queue(); - if(zip_qhead == null) - zip_qhead = zip_qtail = q; - else - zip_qtail = zip_qtail.next = q; - q.len = zip_outcnt - zip_outoff; -// System.arraycopy(zip_outbuf, zip_outoff, q.ptr, 0, q.len); - for(i = 0; i < q.len; i++) - q.ptr[i] = zip_outbuf[zip_outoff + i]; - zip_outcnt = zip_outoff = 0; - } -} - -var zip_deflate = function(str, level) { - var i, j; - - zip_deflate_data = str; - zip_deflate_pos = 0; - if(typeof level == "undefined") - level = zip_DEFAULT_LEVEL; - zip_deflate_start(level); - - var buff = new Array(1024); - var aout = []; - while((i = zip_deflate_internal(buff, 0, buff.length)) > 0) { - var cbuf = new Array(i); - for(j = 0; j < i; j++){ - cbuf[j] = String.fromCharCode(buff[j]); - } - aout[aout.length] = cbuf.join(""); - } - zip_deflate_data = null; // G.C. - return aout.join(""); -} - -if (! ctx.RawDeflate) ctx.RawDeflate = {}; -ctx.RawDeflate.deflate = zip_deflate; - -})(this); diff --git a/js/test/CryptTool.js b/js/test/CryptTool.js index c36e7c90..3b8ae010 100644 --- a/js/test/CryptTool.js +++ b/js/test/CryptTool.js @@ -2,12 +2,12 @@ require('../common'); describe('CryptTool', function () { - afterEach(async function () { - // pause to let async functions conclude - await new Promise(resolve => setTimeout(resolve, 1900)); - }); - describe('cipher & decipher', function () { + afterEach(async function () { + // pause to let async functions conclude + await new Promise(resolve => setTimeout(resolve, 1900)); + }); + this.timeout(30000); it('can en- and decrypt any message', function () { jsc.check(jsc.forall( @@ -29,7 +29,8 @@ describe('CryptTool', function () { clean(); return message === plaintext; } - )); + ), + {tests: 3}); }); // The below static unit tests are included to ensure deciphering of "classic" diff --git a/js/zlib-1.2.11.js b/js/zlib-1.2.11.js new file mode 100644 index 00000000..bfba0617 --- /dev/null +++ b/js/zlib-1.2.11.js @@ -0,0 +1,144 @@ +'use strict'; + +let ret; + +async function initialize() { + if (ret) return ret; + + const COMPRESSION_LEVEL = 9; + const NO_ZLIB_HEADER = -1; + const CHUNK_SIZE = 32 * 1024; + const map = {}; + const memory = new WebAssembly.Memory({ + initial: 1, + maximum: 1024, // 64MB + }); + const env = { + memory, + writeToJs(ptr, size) { + const o = map[ptr]; + o.onData(new Uint8Array(memory.buffer, dstPtr, size)); + }, + _abort: errno => { console.error(`Error: ${errno}`) }, + _grow: () => { }, + }; + + let ins; + if (typeof fetch === 'undefined') { + const buff = fs.readFileSync('zlib-1.2.11.wasm'); + const module = await WebAssembly.compile(buff); + ins = await WebAssembly.instantiate(module, { env }); + } else { + ins = await WebAssembly.instantiateStreaming(fetch('zlib-1.2.11.wasm')); + } + + const srcPtr = ins.exports._malloc(CHUNK_SIZE); + const dstPtr = ins.exports._malloc(CHUNK_SIZE); + + class RawDef { + constructor() { + this.zstreamPtr = ins.exports._createDeflateContext(COMPRESSION_LEVEL, NO_ZLIB_HEADER); + map[this.zstreamPtr] = this; + this.offset = 0; + this.buff = new Uint8Array(CHUNK_SIZE); + } + + deflate(chunk, flush) { + const src = new Uint8Array(memory.buffer, srcPtr, chunk.length); + src.set(chunk); + ins.exports._deflate(this.zstreamPtr, srcPtr, dstPtr, chunk.length, CHUNK_SIZE, flush); + } + + onData(chunk) { + if (this.buff.length < this.offset + chunk.length) { + const buff = this.buff; + this.buff = new Uint8Array(this.buff.length * 2); + this.buff.set(buff); + } + this.buff.set(chunk, this.offset); + this.offset += chunk.length; + } + + destroy() { + ins.exports._freeDeflateContext(this.zstreamPtr); + delete map[this.zstreamPtr]; + this.buff = null; + } + + getBuffer() { + const res = new Uint8Array(this.offset); + for (let i = 0; i < this.offset; ++i) { + res[i] = this.buff[i]; + } + return res; + } + } + + class RawInf { + constructor() { + this.zstreamPtr = ins.exports._createInflateContext(NO_ZLIB_HEADER); + map[this.zstreamPtr] = this; + this.offset = 0; + this.buff = new Uint8Array(CHUNK_SIZE); + } + + inflate(chunk) { + const src = new Uint8Array(memory.buffer, srcPtr, chunk.length); + src.set(chunk); + ins.exports._inflate(this.zstreamPtr, srcPtr, dstPtr, chunk.length, CHUNK_SIZE); + } + + onData(chunk) { + if (this.buff.length < this.offset + chunk.length) { + const buff = this.buff; + this.buff = new Uint8Array(this.buff.length * 2); + this.buff.set(buff); + } + this.buff.set(chunk, this.offset); + this.offset += chunk.length; + } + + destroy() { + ins.exports._freeInflateContext(this.zstreamPtr); + delete map[this.zstreamPtr]; + this.buff = null; + } + + getBuffer() { + const res = new Uint8Array(this.offset); + for (let i = 0; i < this.offset; ++i) { + res[i] = this.buff[i]; + } + return res; + } + } + + ret = { + inflate(rawDeflateBuffer) { + const rawInf = new RawInf(); + for (let offset = 0; offset < rawDeflateBuffer.length; offset += CHUNK_SIZE) { + const end = Math.min(offset + CHUNK_SIZE, rawDeflateBuffer.length); + const chunk = rawDeflateBuffer.subarray(offset, end); + rawInf.inflate(chunk); + } + const ret = rawInf.getBuffer(); + rawInf.destroy(); + return ret; + }, + deflate(rawInflateBuffer) { + const rawDef = new RawDef(); + for (let offset = 0; offset < rawInflateBuffer.length; offset += CHUNK_SIZE) { + const end = Math.min(offset + CHUNK_SIZE, rawInflateBuffer.length); + const chunk = rawInflateBuffer.subarray(offset, end); + rawDef.deflate(chunk, rawInflateBuffer.length <= offset + CHUNK_SIZE); + } + const ret = rawDef.getBuffer(); + rawDef.destroy(); + return ret; + }, + } + + return ret; +} + +global.zlib = initialize(); diff --git a/js/zlib-1.2.11.wasm b/js/zlib-1.2.11.wasm new file mode 100644 index 0000000000000000000000000000000000000000..d98ea382eaee10be7c971f914b704f9bd455b79a GIT binary patch literal 61388 zcmcef34oo``TyU$-?_`ooylaKN%Gz+h%6+Qh}iO~ECivnRH-$VJ3+Q4s3wC@Ra&am zv{llUqE)qpASG2=N-K6sZB?aJQKD5v{-5u2-uK=+lLc*m|B2(AcRS}f&w0+Xo#&kE z9WnQWnCE%1C%U`4z2f1CMT-{279Ad6w8+!{D0<%EF)m^%r+MmLNJWLL72M6F%AVEX z9c~x;KDH>nT$LviGfteJKJ17iPnt8&U8D{>cFsu)yo4S!Etqrsycq|awC7weW-p#F z3K~lFP18Jsbr$b%cWDPSS}Y&rjqeoG8yyY@l+<6Or}%uMDi?s z5t|iDr!!}rPBEJ~?1Up`&OGTTZ`0Ia$IO{A!`q_oVMooGam2hCyU#dgCfO%WI&t2N zljnJ(vWFe*?sy~m*sHx>7#@AN$B8{Y9GN}rcz4I!%zfDFh0UAJGpM}4%cn>LB6LC3x2FRj{nEQ2V9iglXiR3?t4M0TCsOMKh`xa?)mYcz2Q#9(>-reF_v%1 z^Q=@=RatK4^Dlo%U^Xp^FY>)IfRxjIyqxmW0Fw+B%`GPce`2Da;%h%0BxX-4#{ERF zHa6Q&kM_K|L402DM&Igi8b}1$`F!A~f<;wT5yYzHbivDe`M@iu@_tHB=2nuy;Z%M2 zw2o@vSA)Z6m$QDVobl7;q&1WYhVD&MNvm;gB@v|O2k&KO2XAZ|HbT?Z=xANfrPb!} zg~8E{e&G!RYc7o??aBY9uI&G?uEPJYuG0UouJ-?7T?77yb#?x)>Vis>P#*-J2@bE8 zGe)HlXtt};ERL+Ein%o0I&4q-T>_wo3Y9C zJ5i3?m)1(ks)!Zhuoph?D!Ku?p@~FLnhyLa3bU$}bTDgnB_n8MS_}-pWRgNhcD7iX z9}8QwQgU3JoMz}=QklJ(?D=L)gQDkT_B zB3&0&(o}sy6&}lo1v9Hce^bz>TFC(#sE@;@=V?~K9JBMFzX9{-2(cOi9-VBDGJ2G# zKVnSM5bFBAVtCR9U9V4Ue9{h}qzEAylx&!?ep45Okn#a2UPyy2T~RcF(a=*7pN4pm zzU{LIn5p&eq~85&U2p#esDIh@_K!!BUSZdJ^snbv_5StzWIg?BTTlO>n{|fING2s( zQTG{J?hcDo?q3w*YlJ0bgy+i-Am*d6zI?x zfnyh%d9iRJFy@*vj9fTTtYqYCrNjg;;hrWZcu7}EP4JlC`XW8SLpM1**MeQnHWyt7TAz=69gCyUT zvw^B{yxGsv!9v36osdkB;$;b&Vxo|gE(({)1f$?oa60-Elw#)>cnbepwnkvYt^dA_$*Z29OpmDG-8RNm}*!58hw zBpD&?G{PkeglVZ(?U_bH&r;ztFSvEIx^1rn%STt~3l>YT!Zh|uyo;Xf7?X^dTb0Hj z%OM`Z!En{!NY>$?+4Z*tqo~0lwMTFm(tvSYI1oT}IFeoS1w~R&z_^gQ)jX&*I4h8q z#2|Dzx{9F|(Lp62bbpWtVa@o-d61&;XGqiQjyB3oR9l!TYIb1v2CWf&y`MFL9TQ78 z?Wh8{4sFTc^9=xN?toaMWr}ZPf;UQ~Awp{sy5C@jn%uCj(*?{xAh+56e+0R4t47F} z5p`5!2L|u2jWC>T#BiL^GVqEU0S{*Uk?0}gXF;r~7ecJ+rsMOfnm^(qb;N-pz=LZ* z-l7InDG%$qETVve=g1)Uav@Zm)8c)+0%5E(`71^BCmvFawVAOVHLFLl5FDdopfSq= zZC5?oz_UU)%d&ov-oTnYBa^T<(6#jjx~>?CogVMZ3K1(Du9EiirT!w*0Okf8XtFC< zX=w;Evoy$0i1U|*=JWY8%%hR0*$;f<0r;-CALfS!Vj2U;1_}o7RfnLPUQ7~9((4=K#lEc$(Qm$fwxL62&xaxj?5U} zc`VQXjQ49IqVdCQ<|CG3#$#iX0YBkqL6msw*Sb%G8}Z5;YZJI!GCraq8MHLqqc47D zju4mSOBlu;$%&4uI|qoEcCA88BMCKx4`dPAkip;ACT6LYgli3-k85p?CZ(ysIWhma z<)%O(G7QbL(j__dtTnu^Kx0w z%bR;%-qQ1OdC$vRdtTnw^YZqdmn(W+{=Dbq9X&7atX+akGY&Jd;Btlx3~u27mYOou z@=C%LK#@HOF)x=@R)b!%&s*e30%bk%7Yp&}&=>DD-YOZT`kF<*N# z+v8bNkE>jdt9*~ELXWFrkE`Y$S1r*M*nr-pPh_yFB1cA3Fbk~Bn%03;g~b=?CDH)I zoY2JJY9iVs=*iU3Q^pO8*0e67bxRaIM}}`QpTEm|p16Qv4NgqNjce8Q1Jv624Xk*b z$2`mDe-%~ZG!&SG)#iu!urTkepzgpC;4Z#L5As0_PQhg|c;NI!)nMqfd>)?A?Rmik zZ+rQ*XHZ1@i7k}o<6Iml8;p*zBnK7hyA+UwjBXiSzTKb^+3yK7w1yk9!87hfxJUg( zm{`!H`|v@yl}vXOIN9Cu{G5Kq;_OW0ZQvMnq6;UIp2xAAeX%@7z`o{#aq%oKk)eiR zbGyfJ#8LF(Kx%W$i8-z-PzRK0CTrnprE&imIY>$=ShxIS2|sF{eZ9rEdo|UeGdMt!Ao-T=hRTZ%)3Pp~++y zrea3E$W?EJot;#a6!e0D+>g!g;{QV@cg!R>T_Ab(W zL1jIm9d%OEYR>GiFq`Si0C_=SK7NFX$G8S5!xL)u8~})GnB#&0l&BtE$L3=i_q>kP zu0tY7)QEsl&Z5C291-A#OGiWyn^xRZC@J{f6iRrD!Wk745hSF-Wb&dzWcWfqzF;2+W6viQrC zUNKu}%17jyn^bH<0DFFJBMtxOcyDYN-)~4~W#P#!PL(FfXclpK$%%=Hntl;6CcqzQ zk4mD0510-<1whf4yjK4*0p=6pNZ}Zwe#fU3eKF%|1yyrzm50X%pwW{RD)^Zu=FfMZKUsI*&O|!LC$gH2$d2(~6z=DOmbMWEw>DBq0tzSndnAvdV`8 zH|mh7@i0-doB0?T z&|~;m48u_YrI5eWs35T}6?ilxDuA~ndQ(9{R4^o>0yPiGF-+=ijS8F?b5vl1p3U3v z=Xu+PAA(`X;zk&SfuL3R>^UDH06H1pqY|@esJYnzD_eIy#+Z*10DvHUE*|oJh<|#~ zi^d2=Xj-v9m4LO3PbVmAj^>nUj@sG?Z-sLd+f__CF@+axj=Iu%=4h_iUg(>zFMdU$ z2ecsEf@_>0qG1phEO%EnOT}*L6I3tStk647KjW=vRy#y>7#1PfatuPWZ%bM$G+NN4 zcZ1ABH`Qx1tv2`cs;g6$@jGio|IC!2+l*`xI3I_Ns+x)?JcLB0T5NWyUMobBsL($j zytl^Nt-E_M3iC>Ddxm-O+um+yA#1uQDxX;s z7P`BW`Erbj3l;!&t7@f5>w8>vRWh>~DG=FLkAo)-d<8fJt6Y)wD%LQ>g8TV7AKBV3 zA5bxt2-3TljnJ0Y(77Ow$^( zW(pjvNy~h&Jv0Q`6Muw2jX%o%hXdNIF;}N0Gpv*_22PEo%pe;_jU|W(lHxit9>aR+ zrVWsW$-G1%Gz^e{0+-S?lfm#RQ0ImE5dA{F<5j_mwS69>z`d zQb~ayD;l{li99}y7!PAD)`;)Q2Z&2h?cQ2?HFQLdK zcbP&bL-zq8PAX@slscG`6;0cN#B;o^3U-XN#^7>3TjDAs3u_3L*6&_JkxR99RlRr< zMJ{#sx_WU1MJ{!BdA)cyMJ{!BWxeLD|Tm7L)Mbp`Zzj!7%- zi&eng3s|+VJT!#8r2vS3BQEGaj$-S->?P~JxoezA*4$^gw?RXO*}=!tEcUSW(b!B+ z*({?BR-bVI$)%f!CVNT}|2m+zcM?*LF>6^-b>c=kX#HO(d}JNKqe5XrkHltceG02` zV%T8Ax3->6S z%vG}yfY13liunjhA!2$-WnE4yYQU)kL&#i;>qCWzTv8VzNB6D~IU|vBLk3XsVDknP zea48R8tkVp@FpNw@$saBj&%sGMvD-({0Bo_yD zkLs+yCJd;Bm$F8H5vS!wC$_$D5?FhZ$rY#^*Bv6zCum9mkakZs2MgsQ-~o@2dMazi zJI#<4byIX$N@j5?8bVa5(9x9$Kn)HBMPr6E?I;tCDpBaesP2Yt#{w5Hnb#>Tualy^ zm>hXgV)KEqoTp_R<^o$m!61Hl&Hq^Xnh9Hbpug=*yYoKt(gIZfiHW_s*<%F zw&E-*hD3EoZ+K=ELd^DMtS2Oj$5JiQoZv&&2lXAzWLmMP_LM;q0$RKwYKbN=*s08^ zhoDoYd)R>r#s-|VrU}W2qA#*QA_+oIO=+t2A3!30GbarZzb)y(cbL}+*j;+D5P9%+6_9&1wq0i%M zF-}nTND%NTb2mOwEy*82n2qzHnw}4XbW%j9!6VVs;E_l;kA!t1?K~39ZqXLb)B2bL z#WYzS&Lcq^Ktw;_xdI5Usyq_*Asz{J)^)Y+k>EYCP&^X6Y8<5Qkq9RpC`*R!$Q=G$ z^a>9?1&Oi#W9|T&O&T{+$W=%u_0d%CZ6U=Ac@k!)T(6N!DjFG(14+-TSgd0-7onPP z#5G%NYSf+J$&ejUam0>1*pVF54eW?2xvo3GfqM?`z>Z>#>?jF4f|4COibYOv+$lK0 zwF=Ye$0L>)aiyAXUR;T0#Fc~qdBynS7IfKVRBqa&6Ig-<6H^B z;&_n-m*9ZXmBsaoZ4j9xPD7m`r(vAHnF0}F?nQSK*lqK}4>nv#<+=2)@?$8eq?w%0pP_;Q2u1ovq)Pb9Ee z_heO#w%i0s45HW!BB1>GDiQLO>-q#?EVUYv>?N-^vPu-PSTN9=_PFDt%!o)$rvW}) zWyEbndxVw4O6+c@pK%k+i>Sez)J^mj2wiaF`UJilAr{!46jQaSg`%x_h``s9nhAXR z(?j4VdkTD!MF=2}4FDp8+A^CX)(t0-iOsSZW}OIMCDy{eXqY2(Jru`GAJb@=BUY;| ziMrO@9I={&6*os@#NmSplDN@I(h+?^EG=~9`m?*cz1Uz|Hz$q~&GlVk0sBaGn@8(g-MKSPd!WRdsnAYbMNUUZbGE_hhN?*m0EVn45Y>N{~K(owY` zsnu`Q7by$P$=YY(MVsGNd%~>paM&{Ech~>+!U%~G0l84|23(J_0GDI{vm zQP(`J!v$g4YwW?mpD5wX2NRKSwF=VZrUVl5qkS#&h7cXea3PugKw@$}i=x#*>q6Bp zP(*~5T3xB4(dCnpeIg6e0tJc=CmpWeSfs2XCq{c-rA32W^jrMC`k+&>KQTpU%=P=} z#^Bi%*_nWi1|IVVaL@0r{}CoYzx;tJCw#u^KqwOnX`kvVJ+8EXC836O4q?T(Gb*Cm zZ1H1yg8ZSA5Fo}kilbcYncysytk+?m2hj|H^|8ER16t$SIS^NluE-)M7LCa&auYyC zh7@QKYnjXOcAF*yta=}u!NlNy*kG|zVGtk3E#xfDJt>~lsruY^bj*~FF0FdWG!rmJ!0 zKpbB3jKyHHlZXqkO3l$Hhbu}9KOlK7J~1KLF6~h)1VSe;lPb{B_L0+x_o#z@YRv>j zOg(xluY$OeA{z8CykCg!C&U`DXr>rx({MIzod$=p>5?R#)=L9;dCjvSV z)s@zo5RNRxC^j+Yd69Jq>ZH84c~I)Tb@M&R{55|{10GE9kT1q9twg)4|I4I2s8FzxQoM z3yRTPlf2FN1;XLAUyhxm@j0yc#KNe`CcmI4RBM*ZdWz}?n{0B;HreM*dvqX4>z{kX z%f!lALjxuJQ`$}D>OmBT^$_nlk6n3{Eb*_>Lln5mJy;A;K!|af5e3Z!(LFUrh$Zf` z>SrA4hcpZaxB;o+WDc*jVbSpU42{79_VkU$q@vi=oZ3V@xUm74n2nBwqasw&v?DPP zjukz3L+!@J_W)Ld&iF#gRxAdX!KvW%c)2Bb{td6(CwP9fS8fN0zC72^0 zlvKHo#=&Fm^Mc2drS{QMeWcrLTjO>=Vw0)Ytr3-3=ZpEpd6iaCz(5=Na*4Ov{34_0 zm77Ufu-HE_5oHm?&#MgRDi1OQH2KX0GMW9D^4rvRp@IslehW^vK}f^A)`h$>9!jH; zc0cd8bn#{-t#=v0J`BNV53RKWaXNstw&wX&no&qqm!_qF5bX21%ANk8at8WM`yFDm z&{oK@MFoD|hSA66$3{aL3kq4KCMhoHa(tJ8rrGRb);(TtR-UPYpy(_+rx_l(;(#OT zW}0b8FdY#rFI6;p>Z4ROx$D?>Ehga?q#BE9MEwuZP-X$L$uG*Sp7jULuH^mxZ1Kpe zlh&=0K=YeXQkpv|&0WN6H?#|kP0`$U^9FSvK+NT?O&~p}$hd0Ahm3CeQ8)SP5Eyrr&sPY|`0T}!(t=(C?%9mN3+4XOPb~Jj1bs6i zAO%6GIlR(#lrTWNDZg}4@+cH%t$J0mgwfAH_WAsoCfSf_ivThnpQvf+NwoN3zTWUs zXqH!Hh~P2%G>b6oM%PTiVhc|1K4ay{+SLkyT%i@^pkMvj((ZWp=sPJUl;DsfFrRZRHmsG=_we09+;D0Nmzr3#62xc)DJ%TT9Mf%kJIT9*Dk5df3hDI<^4--`$uWciRL7tYI;;`M@Q?aPE2UGX) z0w}|aEOrBm<4)&-phJa=Ap$HLU0%ZL4BQ5mHDO3fgi4|=jM0HS4W0C55o;T{h_z4H z!tF^Bs;&H?74Vg8Qi*~*w4_SN%=&;sqo3{BQOOBk6!+4u0LC!`c7P)%L84w`k87mB zAR-7bn|Y^I)>FF*CM4C(=DgpAJjo#mdApLGY4*R7cS%&;hljYX)jlF`rr(E;j6p|( z!%Czml69PjhyjOFMl>Xho^*P%`YZ9^4iLbw+nD4*Y|eZa3Zw@waoaM@XeR`RBFjYD zMD%NVNQ&Z5R)6AlkvDL|Cuse9@?lC!DfHy1~s>9(gm3CpdhC$EhUP zVI74g6{Ou8l84M+qyyoyLcA*ClNIt3GfEMh{jHW1kj z8n0;gR|}|=qRHH$4#vYNn%o5cG?)Yv>S|2eAbAsjxR|dY5!>KBHvxU^`jkq_ckaZE zK%o29&HR^4p7fJE$pq)d{Fs_AbfA#2JmphBRs<~3OIuWgy|&^>eP#2bF}QXiLe@2; z;-qEIYItt6N zj%pKlZE%`2IBF7ZXIPB@vW?0Ds43jQ4fZ92H_))Tk~Z+H4pa~9TMH5PQ5iFSpN(Rs z{r?AMj09k=1c5+Y0;;dW4usib$8$uO{S4-f5$1o3nx2Fy_d|W3F#eccaB&KZWYz|T z;-kT$-9*tO5zkBnbE<6eAji$AlS*(c=W9p;N3jNwAhTX`7$>B5gl_<(k4DbKu=D~6 z$0M$$^?>qrZ5Q?WK*`Ch`yYd{z!rEDK_c{pX3Q6g1rF!LJCF_#FtA7B#Kqr@wZk=u z7LWLQ5$6oNGoSy3x%~3x@v?O;qi&cU%A0e{Aw+#U7o0fWQGWYy7}JYD?g94VbH7!zo3h>ZYTL)coFmaxC>ls zImQtErT#CWY0uVa;uO$X^d%k|$zQW6rWDh(h)-C0nL@Pmf`oTiyT_>s?v~~F@OaC7 zM!aRYJNv|T{Bp~3f}wdU8-8f{6eO1y*xp~>vYe*XFz@N~CEJl#4gQ64g#9GFMcRyQ z59R~Qp&Iy&;&04uKzg#K%$J(+I-rRX0USEtgp#}sqJJ&$P|8pu_t|%uu;my`x4l3m zv3<_EYu?A0ktd)TGAOHx>(8zVKI(`z>a;QMT5XL=>^(M}FL2J`a*Wggdyk#j{DUs? z`JYBkmx&xM5KgUFaGvPj*UWH^XLo8%WQ%j|fa$GnBF2Juw8vLVMC*N9N>scyZDYX$ z8+%&|(j29N88a?^U6?Ob{*5MQw&(M|*W!|vljNSs^>WYrm+lhQSKj%CsxQIG+&}X| z)i2oWi#{C&fQ5UB-N9M}*x34?4r&1x3fy7Nr1YsclZDYvf}os1TVXvd?o)xBgS_WO zO+-wC@(VJv?*Sp1KcV`d%UQDT}yaS5#HS!-k{a;;TyC>(HYy2?iwKA zRkWOEc+?<}xTsh3f{g9B;kLzsRHKbS1V|r9Y{ZGO`I;^0J9HGN9uB0$`z;3&(;F|4 zg?v-aMu$*vu7r#C547C}8$v`**X1m$BFFg1$pN zVX;t5koMRnD3?o@>q88rg?-8fCv)2c(r20fwuPX8D=P}@WwEYAI~81-#QyZ!oY1(> zC~u40g0kYgnym9_gcLTb^9zh1nkfJe;pE!sfV>Tx(PjiXrwCk)sJ13(r;s9nT3jR$ z=kJOx%y(&&(hyjyN^7*IlA}ksAag=oP%{KBC>1oCur^zub#&iwLg2&=sb22f^|3-b z1Z{m0wFyy7eey`qQ}U*Z5+pVOqOr*&1I=eGI-RM}qN1+Gya5QptMo zMIpfY)srvsc`v@Gao+$#RGcm2hs5s1Qfiz+^dCvQ#=}4nhc5DeLs7PgAhv<%K_Ujk z)#5G+FCInyqnFM%x2PijdxhGvc-9z6DCc0$NJ2tw8P;B*wh0ThMPE?l|9V1gJ=km% zW19%&g?!K-5@TzNL*`2q!S#x4c24i61ISs*x5< zYf@!ymN4yUG9RpjcaR`N>D%sIiF)`4n@^noTU2TePd?J5(>LNb7HsI@t-IAiLYhMZ za12+ zw_+ZbhWjkdYnP1Hn1qxPDhU9oDAwAnY9+$>+Uy+xolrnkC?^u;hBb8BVjsiI9h4OD zZDOAhBPDl1Zr>`JXT3uvl#!z!|;S}RvYc0m=Yhymked1bZu zVT=?;&T0baW(*9g9#No!Q(X)LtejqJyNDg05QgrV*{>~kb|n39 zEGf-qz0CeWi-t0Ng9^%pFE2hy=ETf&)ZXwyD?)Ab7LaTzzze zQSRbQI-Q9xqO_G{=b}z1)XFH<>Bs5f zCnl7RPL5@!s0wQp2V&i96KThla#i&qf^XyOMUqAZc(y zt|so(i?x~Qt~!^F);zU!C)lQ~J1NRTd~peEQ=!$DlWUa;J}D%JJ{=toiN`EhO5TSr zOvcF*R&vqQ=6h27jV+}(SAkrg7EoQZWeFS;$Pi8kw6J2-*zWionS@M47ukfvUV_nH zCJYJ;R5-J{3AYU=eaXkD<1Q1nbm2k~EM81>W(vG$P>e5pCO@5?;YXvUs^2`i@ibR- zS$Y$m=9=a7OlyGoQ`G_zbRtL%IOn?sGP#d(4lGWH)OMfJ= z*k@7)ONV+|1Lz9|7XEtNqvo$?gw?qM&X=H%#4>x&xWdm_2;OKDwRVX(5i|1P>xeEL z@aj5A8@$wN8e+N;oe+(ojNQA2vPN|Fe%2G68krh82`F|gv7`~9Q?5BV`m{q?>kSTm zO@N$~1GyS9^Pz|;g>HhegH`6~bm0IkcvdwG1@%(Hfb^+%%1~sUYIV$(Z$e!6hPiPZ zdOz#gpZ4DUu|^~gYwL@JXniq@*bWA2V&gTzNP5F`?-2d?TGm-Y(Yov#eGL7{{|&f3 z$VTXQblC{5j)SeEy(n)iE5xWmB@1gH_7JK!7OX|-8gp>xDI=F*9vsNb2ofxx)f9z0 zuq|<`Sa+5)sTw+IG!_j<%KB$)Y2CQ=#&eI|aMa`3*Ns`%>9CC?CWa8LgThIX`EIEu z|Gk?3R@}$|j*8#Z5IwJD5os^Ri&2MugtR492vs2@jB8|coLlE2v?)X|d-@Rbxn9bzh~^TXh)J@0W^wKW)6@F>2b^?+LY ztfAXs4Ru)I05F$)nV0QwX3Pi_v$N%DMvpCZ<`FF_f|{A7V*UvWePCM<7`M$nQoY}i zyO;cVa*@n|~C^5N!sMsvaum!kqR5DZoLSfE3`ct=l5Bl1uFo>PGx@ zkh3?alk6NW2a~_TV+k^esvNllnzj;2z-cSdCFD}UWFIt3KT1qAe&-@!bVL8pug{9h zIpmd^!^enpuH(VkY=_4s%sv<_rhwh*7|~kav+Xe2EMwYyCF?fEXgiHx)c+JdM9j5{ zh#6a^nColz(ro#35QG*mU{kk=yUkl4RMzHaH4EgPH2~s%2j5LE zChW>|9JVE~yTQ|%7|tzbEU%XahFWKk(!IfY?tTtM&TW=w=!<=g>i0`$GFok55axi5t}**esz!<}8bT6B^Yh03MZ6D$yxi1@WD z^@)j(y`)7XJr5;eJu1*fK<^BXm&_ASV6djd#@>fnu=mTrQ};}^+QupCtF?oGLo^fo zP0a)!t2dIph`NMrsiNz_`|59m03FNfG^j{_3YPT72V-otIt>6+MY1*CC|eDeIxxEj zE^DH5p@B=F6R2|ffO?B7v#PWI%|$0HfodH!3(157fbyvEC=W?Y1UH5@R@^j`>hmMM zk*PtTVUMZd0_X~iwvbbF8_+Q@xe`e__ecbYg=%rG6OY2V)9QQ@AtXcmHtiJ9D!O!Z zBNFX^h=>Gj7ZQ;913fsW`ydB(M3JjYB>>gi#ZfQTwYiRuZSj1_T*0=!A4 zjj4(e)yq5QXhbX!Zl#Yugz_P9Mnw=uHV#IK1{@ViwxSszHX~H0tOaY8&rBLdwk}*( zb$}$zix~4lTpMl-2=%!Uz*nN)cUZUS25(sXLg>e6LvwF^ZAA6UPZSVt#R^hB|F&5% zy=04IM*%1$J7kbbcBsa1zo}%0%o@oK87{~UNgl}#NgiZ|cAG|mDUuZuOcE`U8ImEA z88U_>GbE@aawJP6J8bP=(jycYnztL38FU7j!AhWZV!{>0UTxybyFyH&n-u1xQOJ(@ zokDq0pA?cLoWX4J!gOH^g=9KvoTyuq#2rnjc`Ioo-fvvk2^DED5(5dufMzG`IxeYZ z47(SzvW>C{wPhgM48}CJHe9SMAN~jI$?TEv7brd+dkP&@>Iy%?;pCXujR{w=e-s6x zB%Jq7yw>UE+H@)eDbSXAFMKka_-Kd=3%s>TDb%;foL&0nl@x;_KmCVfB4ET}DFJWTxN^nTQREdR(z_ zalr_U0#g?Ehp~;CSQAK&;{%EF-ZWwpZNSLI@lf|-I{ z=Nd9?b&?)2ryc7}n%+Yf>Z}*}+{lE)AlRQpX9S}Y&JlCKR!Ly1INr-_bc||4oKOB6 zaXxwAm^eK+pW?P7evhw9oDWmy<8!{K4V%atZ{uTezEIuvP_TdS+wN{Jw!10V^67&V zk(79Dp<3RNOlQ<;GDD*~I>Cz`$BRqD)F21q$9x*x^P@Ki z*mp!Va(rht;CJR&(w@g!IlqEBM`e6HA0%e$(fm1tOba}nJ!aY+G$1-aTx#W(S*ymI z*=nsN6twoN+s$O}+YuIqDCp9taA$O%;&gp$+g_kzd;B{G5c8Xb^$I_$$Wnu!na_rV zoui(bbC#Y?`RF~xcfg)iV{hd174MV@2<701Yyu*ET7zGFfI_eBscnORV-?!qD#I@q zXehy|SB<^djMz;E^(q}_>mdHMgLv~GJ%!^__llq_hT}2$qeF?=4VXjuJqMU|h%u~W z?s4|~P&QgZHEsmZhq#-YAGFL?_<-$BOcOFJZ1K~dP*^6o6g(AuCfIZ`!|go|(vsg1s z-qF*}>JG)1#7oJDPc4f`KqwG_6(%SwwKqY86D^|q-9I|q=5V!NWtuP3YwnaHOJ|zI zcSQ(78?~+O5sAYC*$_Qd)XHnWwAXaOdy-a}NyHxX!GuI$6OpAK`{7#oq~acaCrU+z zGYrBHaKo9KA!AD~#Hz?G(uZgmG*?~}U!Wp3)EBnb7YsE`pd;I`QOrZS>=0e~SD3RK zJYt<~q0JaiG&^?tsQ9pYMf{xpVbrCvtKUp_>>lI7!!2nMIq33O4oobXAJswDuVSXKA=Q z#YvoxNk|XVs~uR2T}DH0t8NPrnFm`_k7XFYSW4v?p6!z9a?>mvCt_SLAolSHfRQp11}8r=PXmp3pKs3jKAlT?Iy0UoNVZs%_$ z569qagK_aO%m)}Xmrf8l;geynQxz2TAb3L+c#FezzkG|J$lL!KICj_am zs4=#aGYqF5XW;Owo&`8iQ3UQ5 zD(EX^-1zB70ktD&7ThHZBsa zLOlwMLQDRGE^Qq9%XVAES#B1*Voo6^G=d zUKP=>Zi||{3B?T4#!&3&zD4wnp)@u>adHPU}#NLx{j~QKLm$>+6XPN@UXWBYqJnfg6cB z%@m>@jmv9mxk<1*5{#CL#)_f2+pJrz4>tK5sbfP!*D13WrDP=d(N1#7M<$5m9yPgc z!z9gd-&rvP7?LV-DOCDP(Bc*MIDMmks5`az{ozYY5mh0fht`o7y{Z=EE|N=OE!4i@ zsc7g3rMN`9LxYNjd7H^PPx?OHMFUom%L`31aG|CS_e1WO#*PMzVyl@Mb0PWcirHGk~I!DGg=T7bM0F+z&Og_}t49 z+am#{Uv0_CCc${s_MPN>xL3>UN{b6mF#|!X3j|ezivAAS8DYoHJ|YA}vEACXfq~l{ z_gm&6cr~6MYF5%1Kh=ew4`s)GLj-9S~{Jew!2P?{GOBA4a<0LKnwct|eP#na-uoV%k{n@V}K7pn}Q3ZFs3 zUnzDYlZ;B}GK`Efhnzzoq-#q36QqR073J52znXFY?r3VDK@N{xS&M*Mz>Jppn3{LGI+zgTdQi3EJL2QH# zrVM+x24zUARVok+?2%;ejfLiL8W7yo8sWGg*GNW<P@vuR`P-$Xa&U$EV@pH!BY<_ev zFC=Q>`|M%&cV*?wbya$YjaMidWv)5>UW_OlHapTu=Ql-XgtfT+sD2A}1)tl_1*z1N z`PCX6brx;qYKHV8(+Df6l8-KAC+XM}$aPyLQiGj@BV7!wQSpENHJi?1TRk3yHbLL@ z%=GKrS44rPb=XAc`f9BA4b#T`BD2qI5j=@O=rzKRVxDM$XdzhPG^^pHHUY=_J2?{% zqFo2_?!Ou2Ry&fZ15I-V9$r)5&X!?cyiS1W12ixf z_HShTPFKdC0(q;P;@nC?ow9@mOCsBYntjjD{Rmbdq< zylrJzwLH-u=5s61i-k(7vQhzz9L|1vY!1Ku_ z_#^ybUFA2oQ_W>+ zPEojDThOcp-@%&ZZS(xTRTX30&Q|9sl%q|)>NbC{Ci37shipxnZO85Ly}tIhwotZe zr64}n-o>kZ{r35M$TD!8kPz;B6+4rU(`il1DFiFM*>HGHdGiYbezs2lqt1(FSF%J! zfoZgestY>%urF(XZPJ435OQa*nA2c`l8@9X@nmXM2anY&ZC7y9$LOK8lV`cHufMx> z)4Djhv5O_wMSk-+>>>?Y7wH|d-gPeB*g5d$&K{IITivogDxkGr4e5qx0?Y@x^Uyfr zOggSVPy=GmsAQnuk3kS)Yg1XU>b*R8sH3vH8EajJ5WoY*9xiknbAK~-5>@&^WFy$1 z!~u4GKR&1w{3$9=g&d3giQ-Js?1NX+!&39epEx9$Yi^1KE1K9k{ zy4dy0`fh8v1iDK8_QV|kyi8C=Lu2LKvQT4afYH+(hOuuaf6zbV9mTE(h17<_< z7JgtwNN)=f1$QC7g2pT#pcI0nW(>KF+1P((p0N_b{xh$6T>{4)a)sp3CB_(XubextKY8CCklu_&{lu^bO?E{zXL1JbTlu0kz*%UzRog! z;9~^F2Z^rwl?MmUzwYsU(7hTVzqP-Kzcu?)B`C{?zlz^3myN#(lEZJ6tf;`)s<0at zEiC416B=nlGwQ0e>G39TQh&T0`^+JC1OM0#Y^V3z?7D)iiP)Fl*W6ZaDLd`LblfT~ zDv(77;4YT>*=cKlsC$vZKyS2clnUPk|R1~#P0I(0aWIaAYKi{k1| zVUzZ%0ARHbifd}?de*UuV*LY{hh>QxpGv%n9fRlxZ)htyFl2ncYJ$t>wPK@!sK9A| zHtRh;20%@N#!z6zNe4We<~Zm>l{fTmuk8C}1I6{<*&3l%hniYnSn@OFvIwOKEjUx| zFMP@8Gr*#HkqdH)81@kx5w;f*i6ASv#75qL;Fxm-71P zrEK)l-_gqe(X8K-Uiy3}z3>(EsuQo`gcUh_HrY(0CWo{2QjW&aFYDL=O)=(>e#ON5P z3v1WT;hp>{K+aC_1e+daR?E!J4fS~tkT5>SLCbFuZ2ier8Qe#D#4wH25; zWT3kROr6Bh^9DLagW**-yXr<)-Q;R8xLlk;ygZ5)X{i=&07h3C3PB(D)1r?aE0SUy zu7mz?P0;_iaie~tMQlfiU%ykT5fPQKN9qFt*AiHsNn%-nfN|wohDS4@Xr1M4Y`&C- zQp*roip1WIuZ+|RVywKCKM2ay{o(L9o(!Ky&ZXaq$Q-GuIZ|vuk49C7$YVB0`>n_D z-6-h__DN+3FTyJPA^uR!%8|OgZDp&fzl}e%%OA@9t-2~h>~TkBh&=w>>#7XZBozRf zW$sly8^k2^hpKIrt>3s#i4%YXM)KZ}F5l|lJn3=qZF|3D)S-TDTdfR5BOj{Dhft=? zu(ry`$qH!_lw-I*QV!}t@|*&dL|5M53SXIc31j@QV?)7d5C9`An_YCvd7o|sw8Fp< zqB?|N7d%q@C@`x|JY;z_T>CP1Wxw7?jlOMQ5=?dnq!E%Y`EE|ya7j?k0DDE`96Df` zRPydJtf89~M01!nA^JLzAuML|m7IEJZe*1NTNvHK&cXm!UrI_Ml@q2Jl2Fd#w1Nz7 zA^e>=MIcNj0*BJCDRt1FQLvgXSi-|Lr$e+hxx>$Nlt<~ThYnDpMo00(Q^FXYju^qj z#Iz6sOpsrK*1AfB3zO4VxNl7JJfHuP+ZE!KItJCteFsGwM?5x;Ecvk_**eyZWaISD zDQIW5ivv}Eh>K}UnIbpDMYItl4Oj%OB|sVqgFje~&r*9i!#%B;6$3Ukz~9~ZEz(`^ z6Tn@WC0dceBVq^7OQ*3(fWDi=;Z)TASnc_9Ctt&j$MA+U^Mz1|G)~hx`K%-n#iWv| zrPGav>#AL(m1nzk-jR~Fe(L}Z>VS#Biu1uvVSQf^v(|62iSl%4iRsgBCKwbfIw?*9 zC!nC(v!e?IFT8HD>pj(K5fOt_(}nKYnXNeqQ`!SohtG zYmnbt9YT2F1FOi^LT}b#bx?c^Up+S{vP+v$=c3dxCty5O?4-zfu__Mhn6uu7U3D2n zL#ZMty5Y5Y)3sLhMi`W^4t({O+^*aYsmYxk$4fz66T;|)<53|$mM#7?K4XAvn=})8BLjrS)i^+P;0$`uBD!rDAfg@(+ej@v3le(Pa}G0e74y<- z+F}o@zqZ38__GcofJE*i*KevmP0mppV3gCbsIF5k7T#7Ap!hEv9|%A|qv=wgL{JvM zFYbZdz}!Y8iyZk7FRnmGwu_nIyPTNddlttm9;%X)QJ{@^+EuU6c^WXPVk5E+G{{ML zVZ*K(m;WU`5yHY{fM45Q9wp(@*M2jrRt+z7h2#+$dpX0Ac$na%i=Ye8O~dr^2=s`! z0K!OIM~(;*btK{zg2ejjHfhj>idGPSh}8o@=rV+{YnMsK(2t7a~|eoKQu=4Z>q~Us8kXUITM>Bho2fomngTwG(jys}al^ z-RgW1s|2}>l|nrYAPBwGkCJD=85YB!nrMW2LZ<#UBJycNB&wUkT)lexp$?-?4J!2b z{~Ki%2etu}4f|Lq`!5j&x&2vKifD56OLIg^U@3MaVQ8H^#s)p)S*gJS42cfjbO-Oz>6YKQ2>X| z@&Zvr3Kz56D3>Uik)C1;C(s`+iYIGINnU~h`>A0NAm=DjU1ZX z*&SlilG7LxwgFSW_2Z^h&Ilot*E%9C&O6$h3)8azU)!5oux4;Dxu4!}LXR3MIZaK~ z9&O#i(go|VZHwgK*O;_L(O}X^$RHFgAjc9WilTxcL>H<8r0JX^WpGTk2BnRm5WdN%)hf5dQj-Ys(*wVZ$Hxkm0WrvW^ZVP2}YSm%Fb>3b+RmDo~XC8kSwyJUwL55)t(qE&eSAeUGvVcmrH{Q>MQXYs>c49E{P;rzHp+aYkqx3{5 zjtT3T&OqRh1w)-dgzggJjalSaN~euW9bL74cn~Av3Qism(e!^lIOZCFGuhxI|1So| z4k^=N_UWK7GmJuOMJi()#O5G@jK+|9-_a>*a)RoxCc?ZNK0`MLOP-Aakm2TQy#zDB z5u+nd@ntxLFT*zMW(W|k8ozSdK2N{UvwZZN${;&(q*-T-RD7H|?e2F@&HdJ1X*ben zXVF*QxT-%$q_Kf#%?+oZH0zA3fYXm@lbSXB?VO84V;mnI{?chX{3c&v!Bvquykw2% zG`lv?z{hLc#HBCVZ1GlS^YdM&!klte>lWtGhL>G;iNCsJW%0K!9w8jNCm5yQ0;)zYj{o3JMw#JP^ke; z-9;WZDAY6t%564=&mxuD>XOEU+OHnE9S$3O$$UN%}EA2{S~H|;85BiDTXdSs9Id5PUX z%l2&9PO=jgoDFafhVg*goWZ!;>3Gj)Z6CjTdq^ayZPPl$a+c_2T>Jo+?HfQTd4&cr zreT*gc*8UiTVZc8jBo3!-(;>VsM(MeoR$ZwG>-YeV=;~(l@HDlt?9=#jMj?!YPerC zTBFPSnyIgi<5_$tF%erLAeMn4DTPFrf#{NTl0zryL2`KHIrdR-8Wj(a${v!PBWoi& zoW>E^@!ZHRO=le00Y!~WW-(q|wd`48kpfkQm8wh!<7M>04NuFkrGVq(`LPSJaL(N3 zcR~XWaK>As&~aP=s0~3@HykDDUIKywF)X~Acsor%J7T|kbdA`VNzM_?5gQOY6h1`U|mVi1p4j< z0KaQfH7GC9Z95(bi#4iBAluQv!{e9m^W-RHcCIk?O3VZUORPn%7S87C^3e=nS{ zXOx3$cxmzDwU_uA5RQn|gXKI}5 z`Al0bgrhyVy1UyO$B)_MkMz6?NJ~lAkyesck)9`c zqdc!f;u&ge{)7a#lKjis|5Z+TCA(5N?fLvmhVPVklA@d?*Zrv6?RAG`pOP2TeU;)d zFX_th80AvR3m%H)*T!Nx&mo=3W}BLFxqQCBUy;9N{#y7eg@3K#Ut9RsC;V&g_1Cx8 zU%y^|{d@fl_>jMWAM!WoL;gB8{?`c>68W_WVIi4HrTNS7mks}#!oOUvKmABn?S&Wiw6bTq>U|B#QCoSPSPpX7X#Z1*X|~q`gQFkVcWNA z3~49Q3est$_egQl8Km7vcabWjACQhDy-1>6@9U&bk{%{)O}c?Jhx8^XM>?0ZC+Rn& z5u_iJs-(Y=29dr)I+*l((gf0Nq*F=nlG3EJNs~#xB5g+c5$PDx%cOp!i%Fj*Jx&@& zx|uYe^bb-q>8qrDNWUX(NxGJFBI$L~5YnZj&yk)b?LxYPw2<@xDMmV-6p(&FDwDoX zI)d~9sg-mgX+P3Kq_L#yNwZ0RCpD42OxlBVA88BH)uiJ|uaX9mzD@cJ=_%3j;~>GPzwNk!86q`gVMC5F1;`lHMovp$C0pP2NT17m@EzzCZaR-} zNe7U&CCwuxsNqb~CrG~}Z9@7X=_t}4Nx_??{O6?$q_{{?eTphmRFm=wq)t+t)JDpY z29eUFexzp75K@fPN@^kvBdUxS%b+cMJ?Pra0G)Ns3Ej za!QJn7MG-W)KjpgEq}bKQx#6ImB25DJ6{j0hBgBN|W=SW5XY2}Gr$rC?2aeopV6 zsXA4m*VGgB!Y2v(iKN3x-K3QyVY&O`R}ie}n}2WDi^pUZj5?zE_1pGq`u4!PPsn_2 zO?B3GR~+@~55IZzrCXo#bo1rQpE+g7tB*Z@&QlM6Yvf)xH~svy>lbE5FaPs}gYUfH z=+Z5N-}JAmPMv-0Th9h}EdJu7zaRA1m;P|Ve#;(R^Xs!7IrGy?X7*WmRoBs{{_Dv1 zU%PL{xzi7cwLdj8ebiAqx4ipyF?;^K{)sz&u5|ofF9nA`HfQ#+KX~Y+#7_RwWFr>}VF&dauW zbonbkxG!_^w*T^4zIs*D#RHZ!zi@l8x@h#yCuF}h^XLm>haC0tn*F-Ejyz&!=aXY* zoVAa4@;knA+Bvtr_uSw=9J$Bn z-}im%v`5aHvDc&jKIn)W_Ws>|%O=e8R{ZeAF}FV&T=CqVPki&qolm&?q09fh=J7|W zuO9!2_nta&+sWq~`_om+5C8q#(aGKaG&r%%VSD9%eBWusKkPI+weOFE_~xZj{*JT# z!hM@AJMO?6&pOF(di0oEFMH{T-!=d1+0QMx@2M>+OIBTX(^XIWy8q5Me&+PzOCD?!`e!cx+s!xL`JKXxHz&UH@b&X{nDW?PezxG@@Acj6>ExOHo|)U0KkAQ* zcRczVyHrmoUUhKw)ck|ZFMV%q(?y$K>*cP$H1oyXFKT(?;U8wdbljV22hWdu?$wd| z*+2G7j63|)Wbn(?hd=kJ=Z?K<^;b_Ed&(WhPd@L)Bkmt`<}oXlK77)q<6b=OliyrW zcpxz)fBUWd;+3s7OMU8&9dEm5c>d=%eEr~?MkcE_9&+W{C+-^i;HqU`x%8<~gRgz| zv)A2q^mjLV^QhM@`C;|*xr3{cXQHPXFv? zxBlaW1=pRlV9G56UOqT`&a7(7+TZM$KIV{otaa_BGro5GwMV}5$l9(WCOtT_-^nlL zmcIUQ@reV@Ozv~njfowO*zDLV|Jm>GReMi4evhXYoVd%L)rYQq=HSPlIwt?z#5Z<) za{K+SU2*k2m)`#Dq6cr7^6J`UV>;jb`OnY2>$cyFx#-6IfAqtfhNZ@>y6vL$6TjW! zz-JG*^Vp|0+49t5Zd|_S5qHNsjyv=lBTpK!{T=z6zW>$2FFT$~9en=k_-OHtU~I?0 zGmad$^)L4yJu-RE%%dl*S@6ZPuRQqEzrHw_o;~-ed-u5gu7}QjW%axFKegtMh3U(# z*?Zx&%f34L%u65aT=J#;+V0x3w8>NZKQe30$zKmvAMvRtuHCZzIpcG8vBFKU)cHOZI@;)`1gv- z`rmf`;^tGHy?WE}t8dt8?I~}~y<_St)h~A36YMnN*@IHkPkCeag-5>nrP0&x`c>xv zPsh&f`;CdWH=lpzE1Uf2uBXP|S-fZI_`TNLUjEvZ7w3L=@%eq4yax`MI`)Z4UpeyK z6MwV+3kwc7^!D5O&RqJ#$9FydoNqN>eBr)Jo_MzP>IZ)P@VhU(cG3OszJ16ON6s1i z@+n=_6?s^QV4t*0VEC8M}Jn;UB#9@}KX#>-`T- zyKvQGJ1@Qefp^E9d*{_*OH%(YjY-+4>dvtutAv3kT=e>xTH{cU|3a?1hWRY_{~WEtX$<&rAQh z?AiAxJn+`zUwHqO2Um1m-TnT-H+*}SrpshFCs+ig90#E`iQ#%6AM zVb;{QS9R?-?##)jF1X>)qxN~?-TPZ!e&OK>BlCnK49U>cTf4$>GvPG*U)>$pZ>Wun=JX> zmCZLkb8+7vcX$W<>EN-`-~0BFM?Uf7{-^w||MVC3`1Hbe_x0L9XoOt2XnOiO0|MRbmYnyO&rfHMv0mHH*XYAVg z(kWM7e8toiUpuDb!pk=waqiEbUvdAN-#>rVUypqD{gs=ne)*}Nzp$eHy;WBhcRlmm z%@*Ep;jXt1TQ%#QzV{!$zufMiw`5TwD zeSez=c0G5_`@=5M{NKKMSM0<`7biY*$K?1kS2bn+de{Bw8%{evc~-yaspb3iY5v-d z54Ajg*0+i;to~Ht=zk4r+W(>_v$@fi=60TPNPgB2H|v~o-%EpsEcn6DEe0PxT9Q#=h~L59%CB9$=?7z1Z+_orM{l;*-bZfo zh0T{%D&KzD@B7xU^6;BZ9x?RU+eS`4{Jkw^=XM#srgQe_U(UaA)OYTEd&{5xVEe6B zp8uU$|NQeov#iR7rcAo%(ItuefG5l z)%YjJ9=F~2w~o&)`q`1Y_C4XKV}3I7i2Z)?>fw(*@uL}k{Q1#G-0-p_`{ODmwe~$$v=A|J>?(!Oq}$K zVQ1{V`_{h=<{s2Cam34e>^AtkuY6+P0#X+ z+r4nh?0-K0`h(ZM_|z41|9HraJH6cX)CYgw`q<@vN)=CiY5bm>t#0vOdi~Rv{@}GE z)*Sw~mtNfJmH$`Rmq1hXz5U-SmwPkMvu=oxsR2>A4Te$@GK5@QGuM%_YY+J3pJ)5ac$$xWc47Lw2^KS6@4gWdOl)8R3-*ioL4z+wEr17Wd@z6yU zL-nP*1l-CK$@bNa#F*djwsn44nE8wtDpU_MMsAKC{iHHhyXrO`omMi@yLa`&=d%j$ zhv^-M7Ho0{%ZC^GgNmgFs533Q4|S&ZIJnOAnemGBGXFJi7Q6efDL`VhMN5slwd0au zL9dBPlmsAy1r&>}$y!WQ_ zZRrz|cX;;CB|KDln)F=XI{D{Up~U9E$-8T0jWuBiVrhW?!uozlJ)=?ZOrc<4 z&*=Lg{f>lCtEaj*mAJXW8QcfL(z`$ACRgKgI;m}*t-EAC_xJghf0k9efb|7AZ(mE^ z3+|w$Y?*I|o_ZNv%_OK+WHpJer7xdU%6PWr|Kw3}-Q#YLrm`8a#Yj&(yNqv7++NyHC`Js$^UZH+@yZ~a7rDr{zEXx#=POS_Tt2whHDdf*{!xGvF=wz$(`?9Z{#I%aI;ALsmN4K z?dA>_o9*H~5$Eyv1-_-QO~VhXQgAT+@|#%hGF#={-Kg+ld&LVf^jE$oe_S-a8J_(4 zcu#m3sdQ55gNaUDm+JmQ-eJtsUq5*pU1S)ZSF@|vUCUULTx?29)|8MHGSM+i{rHQl zbt3`0+Il@(ZGgLB)A@XN+7ZbL;h1Lbq_p%K5@I|WTh;z}0@aLY}mANa&COEWjerfEP3=FVm zlxe@_sOkOsF%v_3t6h;A#lF{QF1n4&Xt&7*u8$dfIc@bYUDa{DHKdQrPX3iUQu%a*)zA7;A3#FU}!S>ZK3HQ<#OYB z^PbNJg#i~d26(=2JMC4r#HojmewjP?CO9_MwLf)!f6=<`?JJk2gO%irltOTE*)uMO z_F!LyF*rX}D$ATwd-*DC6C)$8#dYTVYQeIX(7_~@)F_`i$rOQ+Wc=B-6(8w*&4vc_ zR&SOK!GYgA>9_Au37zDmG_#*e!k;lbj^``_hE`*HEWdm!AHQ-j7T2gSSLQdOjxkvN1I?P#4)BHH+ zWfi&986$e?{VZY4TGv-*{jgvHVYEn8uYU0Ux4D+}l3N+4=`0x+d1&pmGwO6792=7t z3q5l0PSS;^hGzvXH!|-%x-yeP95%)md|~z6~%ITMs*iHD5SpjFj( zcQJ?>mpD^dbWMxliJ){5pQcLhNhxEOKd*m{%{`5`)!ma@*x}bn?|GM4WwS(s8AsN? zH?3^a4@TmFdpO-{TIVJnSBI6jIjgKAsn&^47{?+G`o6EsoE(@FOzs_tz?ExD1{C?f z{8A}Jd%IpBUZ8^6+My8tbGgb*GqjE{&O6$F-TA}xx0U`f-H^VUt!z#ym#iIg8n!Ig z{h~;1-`UZoI#x7JBO6S|tzxhYtI96;H`?~h<^vXl>BqKi?#Fgb_nf8f*XU)qxs|oM z%<)KB&c=!26sNJ8w!s&*>uLvwoj#qOFunSIkfG~&&v9eX5!n~I<0z#!L%Mm}G&>ngu) zRz>(*eh`@87?skx)#tzbr(c_Nu9#?~RHobcq!#7bUnBeR%tRL9_;BJ-W>1rI-{8uh zllF5Chh0WC^K2v3M=dJ5Pf<&G9NH!D`PpvmD<2sA+b&?-j)_qbp4HJYGq=&>!wl`p z_TkAlOR8-8ah=5JH1qLwM)8rhl)~;5q1K_CQsa{2T+*csK@~4el^d#^^5!c;@b~LW z%6FB2r1vc9z5jJUTJE-_MnB+_|cF`r^wjb?A z<%?aXO)XkvN;nmcebOt4{%L1V)A;wdrJ-3M$+n%xN#4!Hk><q3S$Qb2cOJl^dtl*4mURGO#HmqQ)9dIwARp8wT$M2X0iO) zVFt<3g57-D^1IIbB2fETOjs-AC?Czi9VSzJuO7 zv4&1#mktUnrny?VuJ|S0e#ugkJEkQL)Qv;i*=5~batB6Iqc4x=3p}uHEc|Zu zQ}n9ClZRB!3A-QSXmY2&~D>Hj{&^4UO_! z7Brn{94U2s%`)Gf=(yd->C|;PefLM7A%@-`=cz;VkM1gI%(fLJc3W`%*0R?)r{dy0 zmfz!WW@OOhz1jqwjl!_u5j&%NzfkN2~JAX>q5GEuvDVQ(C_yH=HyHILlELXn$ z{*1So*|w7te?LKW;++X&YGSC!<6CJQpR$Y9@pZZ0#HHD(r?bo5UtW)gh>SKDlg!NW zpPf=q`$l%`*ze`KWq(x8F&{5svOq_RJHX1X=sck=zuaO*TRiWo@3!JdlC6)O zBNaZT&);&FBMKeESfln-cs8V7aimc(y_sQe&5HK!r0h7hn50hA4ixV6kesH=hGn$( zl-}Fw8Z-ST=}sIGF{*>{NsP(kLn#+pJ91gRPi^$BZnP)3TMn5z`pyWb>6eWg>x8Cp zGO`*maR~E>D7uaw7bZL)Z8>K9!v_F{?YMpCyA`d`@%c}bktXz7@bE{-+4AN-dZ+cJ^7U&O!dmi_0_O9Auw5fNF!Eih9(PD)?CXM z8tO)f;INgBwft(~jjkI8u`H|}^7J^*;@=sVx%s`+BgjE_8}E+K6*E zL5j_LQiNB`OBk~sJ>y7v|5+c!x2Yp%GGu9auhUm=SZhj$>%vCBrE5b{iIyGw{ZcVe zY=@I-F7BzBji*T;={65o{;ol4%yZI=ce$#UE~CUMKP!x*&Bco7JFuvdB$Kjzr{iih zvohoPY+go5i2ZD@o&44vlhLp>ZaFfuAk1Dn^^zgGds8$jL{&AuIKZ`Aq{_aXW9`I@ zy7J{MZ@>2>$Fk-Cla(KOIECMuie8nt{Gtrjw8bdZjzb9|TkgpEM>jes>zG(WlHF+VLF6OxW4~ z$_jH<#`OW=*w>pLF0V) z_lNFzC+y?*($$glx2gaI)gYxXZ@vImfavCkOBEm+j;(QrRyn9y!`xwokcDxox2G?1=J?GEFU-i`)x7s|!Q-L znhXByA9d>j224I4oxP0Ln=rPS4>QUPFEaZUf7n#~&n|QFX_G5?GR{*+_yQ+?yH$KF z>iY4?BWq;lSc&PEzax&HD{T)>`!Qe^M9(Pxn8q`Gf1G-0-eQF~EAw%BZa$*#+jIG- zulA-dx7aEdH+yN09h^Jinojm6O8qD$(A zEGsy|-PLxx}vly;cFdW^CWE@lZbadQpwRWN;E&9Xi-rn~LXFm@) z(hm>j+AQ=h43`f`6$f=&W>WX0cOL4Sadqew;WcYE|I6I;@UB?Ps6;?3x0+U?;iZn( ziO2rD>I;6{z%rZIey$+rZCrEOo3?8$ZFDS49j9nL--S7!>}u%a?WC%biZ4h~yY0N` zeMjAThgNq-;9(pvdBGe4BG>_ znlty8d#=Ys9+ACu_6lt*!<2bkSG0Xp;G^%+Cw`AbQfmcAvrVOQ%%TN5bo;|KhepJ@v(OpWz^QBxZyRIVmU1agQ zG5QjwBIP12Cdyni&LSk+v*f8jb-CyM-X(s~F!05~&PU-{Ev_`~Fc z_aP%I=1UiN4AW+_WH&aL)7VeESaX}W*6_x*H9POBJND$ePO@lX-VIkN7H$sJ%!)tZ z+})|XU9)13J>pIjw%}i2{WRLr4;H9!$G*9|TiLd(I2_e2b3xHQ`TG_6o5qVDkAF@M zCxwOgd{CM!?TXVe@jkR)_3Jcq*hM4nPiphS3~Rdec8ij08JfvyO(sIJ5+73yb#7>p zf3>b+69&|>uRCuxa34wQJ|81oA(@uM-7F??BfWY{gNKTM_h(*-yOX0i`}+aA(Q)A% zRUY|6g;=m-x^g#}LPV70Yc6|qNq=k|!)Gw>lqPYx9vGA(>NZ(Ocy z@VUoa<3d2;_II8EOXa;zqv7hfHwWjwxW>i?@1IZYzpcAo6g++Dijt9>Qg$3JWX~a& z8HTV|*fOQ3&M(!bGBKNBueh|tWeQf$pE)SxwH%eol9VD@=Yvlk5%5`QJKLa{FWtL^ zZg3#jWc^Mu=hu-q>T8ykl>AwE>E}5|9?a@cfW;Tfp4cnn<=+}{u^0Wy<`nEu>LcCo z0YJor+*etvOL0Pj>%{vGsnoRa0YE+a)o@;^i#!JwrzhZk{(e@c_;$s$FczlPDbG91 zBkv?$)a5Ahu&4)Sc?l1<*j%;nLo>T~<^O%_(e}VFb4h4{J4s_J?`ZC67V{3Tb3bT0 zmm;m+pAwC+UL(w|%lPUN5(E$Hi5881yFXZ8vfeUBcRJ%1&myB`hPFNJu?M|O$DpymAbBdIX!kO^;PlxX z-ypVj`=RIFjKx)r8K&rfmZJ}I{|1V1-1{t_E>9QBuj>+K!ehIGJbvJAUzHY) zI%u(|awhQ!gVr^^B5A>sy(*f2T#TjW#(urlwT*w;QJA~OlfKi>riyrX97D4Ng=zyR zI+jJKYgmM012ohS2m+vh4XSqOSX|-SB2vEqKY{?b{t&J+$Rbs!@WTe6g*M&~Yvc_B6TY1`(U5M_!P!R%GcYAoclZeiEl8ZHpP>5Wxv3DZjN$&1scNC!k zF3|5p{Bx-riLoYn5_e)I;R2hzi^o+P8+$8zl8YzandD4H+7E3NK+>QuPdhRU9sW5pG72xElf5>+BgwyJ@6hR zPv{ohY&)H~Tj8DUJ)DW2R(8-Qc($1={!={yRVi3z6g$=f#Y(#e&Y?O53w0m31{516j1ZxC+z$ZnLE-wLe|ToG4gd+@rC^cy zi~^hiz5@ABaD=@C;6$mxt+3G^f^#o`Jor1HeFn~Jn?~o761#1p~ z^@4i{{ae9#06+!!d+47J&Rqb~z-z%mr4lw4a31(3>L2}efwREa_}^0WCjs9F{25qezHS0e1OE#7i2h~(0pRy3`d zh!KJKT(C%dDBu+EImk!aGX?MizemyEANVogBNY9efFA%}1(qIg3!n{r9r6)9|84y@ zQ}nll7$Jzy0!sx52Alx?8S)W5OaQ#V6Dj)p0apS(K+)d;xCHPru*iHy0nPwlg?vQ+ ze_Q|WDEiw#j3~tCfkoy!44@8t9`X_W%>jbIA5ruV0ImZ314Vxq;L^Zff@K860?q^9 z`ajnHYiJ)CFA=a8;-7#;1A+hq;Ge*cjK>(j13clst^YoX{`TM(2Y(4zWW138E#S+L zkLdYt>%X0%KM7*?LHu*D$b8)doCf|4@)7;b00O`tQ1rhJ{5bG2ivG^PrGVFfWdOtg z&H?`e`H24iw*Ffw`ddMaFvMqrMdCvMCxL%~d_@1t06yT!6#cIOR|Y;r(cclcB=8Eb zbbx5US>V4RAGx1@TmM}Y{cRye4B`vGBK?H}G=MKaJ~E#>>pzX6|IYfKpy*GA7#WDK z2g?MA1Ly$XhHbzciY|Z|gGO;-&}cRc3yKeeW@f=a^(_WX%>i#Y31HA_%$Qv$ZVZ}= z9kUn3kAbflz~E547&Mj>6NFNO8(_vzL4FYA^C0=$EErlOpN0cNMDi_|G1N%@E_RF@ zk}u1OVLZ%_2DXcN`v`WOvx({o{8cx!8Kz zdB6tf8;VZYlT5}t6J31q|6InC-C--};YoC{BH=xJoh`{u5ZM5c`8+P|3B$cQpn!R!`{Uf*^Ek&ZKVElA1DHRp9dY^PNYu&|KEL4MuzF zW#fC{%?tv(wGjkwaiGyb@bVaX7n&MPgT|ui(adOWG#)LBRzq9B$7zSGK%MOxcwkrkd - + - + diff --git a/tpl/page.php b/tpl/page.php index 6a6f9e78..5c38f715 100644 --- a/tpl/page.php +++ b/tpl/page.php @@ -34,7 +34,7 @@ if ($ZEROBINCOMPATIBILITY): - + - +