updated build process
This commit is contained in:
Bala Clark
parent
417c7b0300
commit
6c98b89cae
22 changed files with 71 additions and 596 deletions
|
|
@ -4,12 +4,12 @@
|
|||
TODOs:
|
||||
|
||||
Fo sho:
|
||||
- README with build instructions
|
||||
- fix manga mode
|
||||
- trigger preload if requesting valid but not loaded images (can happen if network was interupted)
|
||||
- loading and generally hackiness of pointer is buggy, fix.
|
||||
- check for html5 feature support where used: diveintohtml5.org/everything.html or www.modernizr.com
|
||||
- full browser test - IE9 / FF3.6+ / Chrome / Safari / Opera
|
||||
- fix Makefile (handlebars is not compiling properly..)
|
||||
|
||||
Nice 2 have:
|
||||
- lint
|
||||
|
|
@ -23,7 +23,6 @@
|
|||
- properly bind "this" so we don't have to keep using "self"
|
||||
- allow toolbar to be sticky
|
||||
- unit test / integrate with travis CI
|
||||
- use less instead of plain css
|
||||
*/
|
||||
|
||||
/**
|
||||
|
|
@ -517,7 +516,7 @@ function ComicBook(id, srcs, opts) {
|
|||
context.drawImage(page2, page_width + offsetW, offsetH, page_width, page_height);
|
||||
}
|
||||
|
||||
this.pixastic = new Pixastic(context, options.libPath + "vendor/pixastic/");
|
||||
this.pixastic = new Pixastic(context, options.libPath + "pixastic/");
|
||||
|
||||
// apply any image enhancements previously defined
|
||||
$.each(options.enhance, function(action, options) {
|
||||
|
|
|
|||
44
lib/ComicBook.min.js
vendored
44
lib/ComicBook.min.js
vendored
|
|
@ -1,44 +0,0 @@
|
|||
var Pixastic=function(){function c(g,f,b){g.addEventListener?g.addEventListener(f,b,!1):g.attachEvent&&g.attachEvent("on"+f,b)}function d(g){var b=!1,a=function(){b||(b=!0,g())};document.write('<script defer src="//:" id="__onload_ie_pixastic__"><\/script>');var d=document.getElementById("__onload_ie_pixastic__");d.onreadystatechange=function(){d.readyState=="complete"&&(d.parentNode.removeChild(d),a())};document.addEventListener&&document.addEventListener("DOMContentLoaded",a,!1);c(window,"load",
|
||||
a)}function a(){for(var g=b("pixastic",null,"img"),a=b("pixastic",null,"canvas"),c=g.concat(a),d=0;d<c.length;d++)(function(){for(var g=c[d],b=[],a=g.className.split(" "),f=0;f<a.length;f++){var h=a[f];h.substring(0,9)=="pixastic-"&&(h=h.substring(9),h!=""&&b.push(h))}if(b.length)if(g.tagName.toLowerCase()=="img")if(a=new Image,a.src=g.src,a.complete)for(a=0;a<b.length;a++)(f=Pixastic.applyAction(g,g,b[a],null))&&(g=f);else a.onload=function(){for(var a=0;a<b.length;a++){var f=Pixastic.applyAction(g,
|
||||
g,b[a],null);f&&(g=f)}};else setTimeout(function(){for(var a=0;a<b.length;a++){var f=Pixastic.applyAction(g,g,b[a],null);f&&(g=f)}},1)})()}function b(g,a,b){var c=[];a==null&&(a=document);b==null&&(b="*");a=a.getElementsByTagName(b);b=a.length;g=RegExp("(^|\\s)"+g+"(\\s|$)");for(i=0,j=0;i<b;i++)g.test(a[i].className)&&(c[j]=a[i],j++);return c}function h(g,a){if(Pixastic.debug)try{switch(a){case "warn":console.warn("Pixastic:",g);break;case "error":console.error("Pixastic:",g);break;default:console.log("Pixastic:",
|
||||
g)}}catch(b){}}typeof pixastic_parseonload!="undefined"&&pixastic_parseonload&&d(a);var m=function(){var a=document.createElement("canvas"),b=!1;try{b=!!(typeof a.getContext=="function"&&a.getContext("2d"))}catch(c){}return function(){return b}}(),l=function(){var a=document.createElement("canvas"),b=!1,c;try{if(typeof a.getContext=="function"&&(c=a.getContext("2d")))b=typeof c.getImageData=="function"}catch(d){}return function(){return b}}(),e=function(){var a=!1,b=document.createElement("canvas");
|
||||
if(m()&&l()){b.width=b.height=1;b=b.getContext("2d");b.fillStyle="rgb(255,0,0)";b.fillRect(0,0,1,1);var c=document.createElement("canvas");c.width=c.height=1;var d=c.getContext("2d");d.fillStyle="rgb(0,0,255)";d.fillRect(0,0,1,1);b.globalAlpha=0.5;b.drawImage(c,0,0);a=b.getImageData(0,0,1,1).data[2]!=255}return function(){return a}}();return{parseOnLoad:!1,debug:!1,applyAction:function(a,b,c,d){var d=d||{},e=a.tagName.toLowerCase()=="canvas";if(e&&Pixastic.Client.isIE())return Pixastic.debug&&h("Tried to process a canvas element but browser is IE."),
|
||||
!1;var k,m,l=!1;Pixastic.Client.hasCanvas()&&(l=!!d.resultCanvas,k=d.resultCanvas||document.createElement("canvas"),m=k.getContext("2d"));var s=a.offsetWidth,q=a.offsetHeight;if(e)s=a.width,q=a.height;if(s==0||q==0)if(a.parentNode==null){var r=a.style.position,t=a.style.left;a.style.position="absolute";a.style.left="-9999px";document.body.appendChild(a);s=a.offsetWidth;q=a.offsetHeight;document.body.removeChild(a);a.style.position=r;a.style.left=t}else{Pixastic.debug&&h("Image has 0 width and/or height.");
|
||||
return}if(c.indexOf("(")>-1&&(r=c,c=r.substr(0,r.indexOf("(")),r=r.match(/\((.*?)\)/),r[1])){r=r[1].split(";");for(t=0;t<r.length;t++)if(thisArg=r[t].split("="),thisArg.length==2)if(thisArg[0]=="rect"){var n=thisArg[1].split(",");d[thisArg[0]]={left:parseInt(n[0],10)||0,top:parseInt(n[1],10)||0,width:parseInt(n[2],10)||0,height:parseInt(n[3],10)||0}}else d[thisArg[0]]=thisArg[1]}d.rect?(d.rect.left=Math.round(d.rect.left),d.rect.top=Math.round(d.rect.top),d.rect.width=Math.round(d.rect.width),d.rect.height=
|
||||
Math.round(d.rect.height)):d.rect={left:0,top:0,width:s,height:q};r=!1;Pixastic.Actions[c]&&typeof Pixastic.Actions[c].process=="function"&&(r=!0);if(!r)return Pixastic.debug&&h('Invalid action "'+c+'". Maybe file not included?'),!1;if(!Pixastic.Actions[c].checkSupport())return Pixastic.debug&&h('Action "'+c+'" not supported by this browser.'),!1;if(Pixastic.Client.hasCanvas()){if(k!==a)k.width=s,k.height=q;if(!l)k.style.width=s+"px",k.style.height=q+"px";m.drawImage(b,0,0,s,q);a.__pixastic_org_image?
|
||||
(k.__pixastic_org_image=a.__pixastic_org_image,k.__pixastic_org_width=a.__pixastic_org_width,k.__pixastic_org_height=a.__pixastic_org_height):(k.__pixastic_org_image=a,k.__pixastic_org_width=s,k.__pixastic_org_height=q)}else if(Pixastic.Client.isIE()&&typeof a.__pixastic_org_style=="undefined")a.__pixastic_org_style=a.style.cssText;b={image:a,canvas:k,width:s,height:q,useData:!0,options:d};if(!Pixastic.Actions[c].process(b))return!1;if(Pixastic.Client.hasCanvas()){b.useData&&Pixastic.Client.hasCanvasImageData()&&
|
||||
(k.getContext("2d").putImageData(b.canvasData,d.rect.left,d.rect.top),k.getContext("2d").fillRect(0,0,0,0));if(!d.leaveDOM){k.title=a.title;k.imgsrc=a.imgsrc;if(!e)k.alt=a.alt;if(!e)k.imgsrc=a.src;k.className=a.className;k.style.cssText=a.style.cssText;k.name=a.name;k.tabIndex=a.tabIndex;k.id=a.id;a.parentNode&&a.parentNode.replaceChild&&a.parentNode.replaceChild(k,a)}return d.resultCanvas=k}return a},prepareData:function(a,b){var c=a.canvas.getContext("2d"),d=a.options.rect,c=c.getImageData(d.left,
|
||||
d.top,d.width,d.height),d=c.data;if(!b)a.canvasData=c;return d},process:function(a,b,c,d){if(a.tagName.toLowerCase()=="img"){var h=new Image;h.src=a.src;if(h.complete){var e=Pixastic.applyAction(a,h,b,c);d&&d(e);return e}else h.onload=function(){var e=Pixastic.applyAction(a,h,b,c);d&&d(e)}}if(a.tagName.toLowerCase()=="canvas")return e=Pixastic.applyAction(a,a,b,c),d&&d(e),e},revert:function(a){if(Pixastic.Client.hasCanvas()){if(a.tagName.toLowerCase()=="canvas"&&a.__pixastic_org_image)return a.width=
|
||||
a.__pixastic_org_width,a.height=a.__pixastic_org_height,a.getContext("2d").drawImage(a.__pixastic_org_image,0,0),a.parentNode&&a.parentNode.replaceChild&&a.parentNode.replaceChild(a.__pixastic_org_image,a),a}else if(Pixastic.Client.isIE()&&typeof a.__pixastic_org_style!="undefined")a.style.cssText=a.__pixastic_org_style},Client:{hasCanvas:m,hasCanvasImageData:l,hasGlobalAlpha:e,isIE:function(){return!!document.all&&!!window.attachEvent&&!window.opera}},Actions:{}}}();
|
||||
Pixastic.Actions.brightness={process:function(c){var d=parseInt(c.options.brightness,10)||0,a=parseFloat(c.options.contrast)||0,b=!!(c.options.legacy&&c.options.legacy!="false");if(b)d=Math.min(150,Math.max(-150,d));else var h=1+Math.min(150,Math.max(-150,d))/150;a=Math.max(0,a+1);if(Pixastic.Client.hasCanvasImageData()){var m=Pixastic.prepareData(c),c=c.options.rect,c=c.width*c.height,l=c*4,e,g;a!=1?b?(b=a,d=(d-128)*a+128):(b=h*a,d=-a*128+128):b?b=1:(b=h,d=0);for(var f,x,o;c--;)m[l]=(f=m[l-=4]*b+
|
||||
d)>255?255:f<0?0:f,m[e]=(x=m[e=l+1]*b+d)>255?255:x<0?0:x,m[g]=(o=m[g=l+2]*b+d)>255?255:o<0?0:o;return!0}},checkSupport:function(){return Pixastic.Client.hasCanvasImageData()}};
|
||||
Pixastic.Actions.desaturate={process:function(c){var d=!!(c.options.average&&c.options.average!="false");if(Pixastic.Client.hasCanvasImageData()){var a=Pixastic.prepareData(c),c=c.options.rect,c=c.width*c.height,b=c*4,h,m;if(d)for(;c--;)a[b-=4]=a[h=b+1]=a[m=b+2]=(a[b]+a[h]+a[m])/3;else for(;c--;)a[b-=4]=a[h=b+1]=a[m=b+2]=a[b]*0.3+a[h]*0.59+a[m]*0.11;return!0}else if(Pixastic.Client.isIE())return c.image.style.filter+=" gray",!0},checkSupport:function(){return Pixastic.Client.hasCanvasImageData()||
|
||||
Pixastic.Client.isIE()}};
|
||||
Pixastic.Actions.sharpen={process:function(c){var d=0;typeof c.options.amount!="undefined"&&(d=parseFloat(c.options.amount)||0);d<0&&(d=0);d>1&&(d=1);if(Pixastic.Client.hasCanvasImageData()){for(var a=Pixastic.prepareData(c),b=Pixastic.prepareData(c,!0),h=15,d=1+3*d,m=[[0,-d,0],[-d,h,-d],[0,-d,0]],l=0,e=0;e<3;e++)for(var g=0;g<3;g++)l+=m[e][g];l=1/l;m=c.options.rect;c=m.width;m=m.height;h*=l;d*=l;l=c*4;e=m;do{var g=(e-1)*l,f=(e==1?0:e-2)*l,x=(e==m?e-1:e)*l,o=c;do{var p=g+(o*4-4),k=f+(o==1?0:o-2)*
|
||||
4,u=x+(o==c?o-1:o)*4,v=(-b[k]-b[p-4]-b[p+4]-b[u])*d+b[p]*h,s=(-b[k+1]-b[p-3]-b[p+5]-b[u+1])*d+b[p+1]*h,k=(-b[k+2]-b[p-2]-b[p+6]-b[u+2])*d+b[p+2]*h;v<0&&(v=0);s<0&&(s=0);k<0&&(k=0);v>255&&(v=255);s>255&&(s=255);k>255&&(k=255);a[p]=v;a[p+1]=s;a[p+2]=k}while(--o)}while(--e);return!0}},checkSupport:function(){return Pixastic.Client.hasCanvasImageData()}};this.Handlebars={};
|
||||
(function(c){c.VERSION="1.0.rc.1";c.helpers={};c.partials={};c.registerHelper=function(a,b,c){c&&(b.not=c);this.helpers[a]=b};c.registerPartial=function(a,b){this.partials[a]=b};c.registerHelper("helperMissing",function(a){if(arguments.length!==2)throw Error("Could not find property '"+a+"'");});var d=Object.prototype.toString;c.registerHelper("blockHelperMissing",function(a,b){var h=b.inverse||function(){},m=b.fn,l=d.call(a);return l==="[object Function]"&&(a=a.call(this)),a===!0?m(this):a===!1||
|
||||
a==null?h(this):l==="[object Array]"?a.length>0?c.helpers.each(a,b):h(this):m(a)});c.K=function(){};c.createFrame=Object.create||function(a){c.K.prototype=a;a=new c.K;return c.K.prototype=null,a};c.registerHelper("each",function(a,b){var d=b.fn,m=b.inverse,l=0,e="",g;b.data&&(g=c.createFrame(b.data));if(a&&typeof a=="object")if(a instanceof Array)for(var f=a.length;l<f;l++)g&&(g.index=l),e+=d(a[l],{data:g});else for(f in a)a.hasOwnProperty(f)&&(g&&(g.key=f),e+=d(a[f],{data:g}),l++);return l===0&&
|
||||
(e=m(this)),e});c.registerHelper("if",function(a,b){return d.call(a)==="[object Function]"&&(a=a.call(this)),!a||c.Utils.isEmpty(a)?b.inverse(this):b.fn(this)});c.registerHelper("unless",function(a,b){var d=b.fn;return b.fn=b.inverse,b.inverse=d,c.helpers["if"].call(this,a,b)});c.registerHelper("with",function(a,b){return b.fn(a)});c.registerHelper("log",function(a){c.log(a)})})(this.Handlebars);var errorProps="description,fileName,lineNumber,message,name,number,stack".split(",");
|
||||
Handlebars.Exception=function(c){for(var d=Error.prototype.constructor.apply(this,arguments),a=0;a<errorProps.length;a++)this[errorProps[a]]=d[errorProps[a]]};Handlebars.Exception.prototype=Error();Handlebars.SafeString=function(c){this.string=c};Handlebars.SafeString.prototype.toString=function(){return this.string.toString()};
|
||||
(function(){var c={"&":"&","<":"<",">":">",'"':""","'":"'","`":"`"},d=/[&<>"'`]/g,a=/[&<>"'`]/,b=function(a){return c[a]||"&"};Handlebars.Utils={escapeExpression:function(c){return c instanceof Handlebars.SafeString?c.toString():c==null||c===!1?"":a.test(c)?c.replace(d,b):c},isEmpty:function(a){return typeof a=="undefined"?!0:a===null?!0:a===!1?!0:Object.prototype.toString.call(a)==="[object Array]"&&a.length===0?!0:!1}}})();
|
||||
Handlebars.VM={template:function(c){var d={escapeExpression:Handlebars.Utils.escapeExpression,invokePartial:Handlebars.VM.invokePartial,programs:[],program:function(a,b,c){var d=this.programs[a];return c?Handlebars.VM.program(b,c):d?d:(d=this.programs[a]=Handlebars.VM.program(b),d)},programWithDepth:Handlebars.VM.programWithDepth,noop:Handlebars.VM.noop};return function(a,b){return b=b||{},c.call(d,Handlebars,a,b.helpers,b.partials,b.data)}},programWithDepth:function(c,d,a){var b=Array.prototype.slice.call(arguments,
|
||||
2);return function(a,m){return m=m||{},c.apply(this,[a,m.data||d].concat(b))}},program:function(c,d){return function(a,b){return b=b||{},c(a,b.data||d)}},noop:function(){return""},invokePartial:function(c,d,a,b,h,m){b={helpers:b,partials:h,data:m};if(c===void 0)throw new Handlebars.Exception("The partial "+d+" could not be found");if(c instanceof Function)return c(a,b);if(!Handlebars.compile)throw new Handlebars.Exception("The partial "+d+" could not be compiled when running in runtime-only mode");
|
||||
return h[d]=Handlebars.compile(c,{data:m!==void 0}),h[d](a,b)}};Handlebars.template=Handlebars.VM.template;
|
||||
(function(){var c=Handlebars.template,d=Handlebars.templates=Handlebars.templates||{};d.loadingOverlay=c(function(){this.compilerInfo=[2,">= 1.0.0-rc.3"];return'\n<div id="cb-loading-overlay" class="cb-control"></div>\n'});d.navigateLeft=c(function(){this.compilerInfo=[2,">= 1.0.0-rc.3"];return'\n<div data-trigger="click" data-action="drawPrevPage" class="cb-control navigate navigate-left ">\n\t<span class="icon-arrow-left"></span>\n</div>\n'});d.navigateRight=c(function(){this.compilerInfo=[2,">= 1.0.0-rc.3"];
|
||||
return'\n<div data-trigger="click" data-action="drawNextPage" class="cb-control navigate navigate-right">\n\t<span class="icon-arrow-right"></span>\n</div>\n'});d.progressbar=c(function(){this.compilerInfo=[2,">= 1.0.0-rc.3"];return'<div id="cb-status" class="cb-control">\n\t<div id="cb-progress-bar">\n\t\t<div class="progressbar-value"></div>\n\t</div>\n</div>\n'});d.toolbar=c(function(){this.compilerInfo=[2,">= 1.0.0-rc.3"];return'\n<div class="toolbar">\n\n\t<ul class="pull-left">\n\t\t<li>\n\t\t\t<button data-trigger="click" data-action="close" title="close" class="icon-remove-sign"></button>\n\t\t</li>\n\t\t<li class="separator"></li>\n\t\t<li>\n\t\t\t<button title="image settings" class="icon-settings"></button>\n\t\t\t<div class="dropdown">\n\t\t\t\t<form name="image-enhancements" data-trigger="reset" data-action="resetEnhancements">\n\t\t\t\t\t<div class="sliders">\n\t\t\t\t\t\t<div class="control-group">\n\t\t\t\t\t\t\t<label title="adjust brightness" class="icon-sun"></label>\n\t\t\t\t\t\t\t<input data-trigger="change" data-action="brightness" type="range" min="-100" max="100" step="1" value="0">\n\t\t\t\t\t\t</div>\n\t\t\t\t\t\t<div class="control-group">\n\t\t\t\t\t\t\t<label title="adjust contrast" class="icon-adjust"></label>\n\t\t\t\t\t\t\t<input data-trigger="change" data-action="contrast" type="range" min="-1" max="1" step="0.1" value="0">\n\t\t\t\t\t\t</div>\n\t\t\t\t\t\t<div class="control-group">\n\t\t\t\t\t\t\t<label title="sharpen" class="icon-droplet"></label>\n\t\t\t\t\t\t\t<input data-trigger="change" data-action="sharpen" type="range" min="0" max="1" step="0.1" value="0">\n\t\t\t\t\t\t</div>\n\t\t\t\t\t</div>\n\t\t\t\t\t<div class="control-group pull-left">\n\t\t\t\t\t\t<input id="image-desaturate" type="checkbox" data-trigger="change" data-action="desaturate">\n\t\t\t\t\t\t<label for="image-desaturate">desaturate</label>\n\t\t\t\t\t</div>\n\t\t\t\t\t<div class="control-group pull-right">\n\t\t\t\t\t\t<input type="reset" value="reset">\n\t\t\t\t\t</div>\n\t\t\t\t</form>\n\t\t\t</div>\n\t\t</li>\n\t\t<li>\n\t\t\t<button data-trigger="click" data-action="toggleLayout" title="toggle one/two pages at a time" class="icon-file"></button>\n\t\t</li>\n\t\t<li>\n\t\t\t<button data-trigger="click" data-action="zoomOut" title="zoom out" class="icon-zoom-out"></button>\n\t\t</li>\n\t\t<li>\n\t\t\t<button data-trigger="click" data-action="zoomIn" title="zoom in" class="icon-zoom-in"></button>\n\t\t</li>\n\t\t<li>\n\t\t\t<button data-trigger="click" data-action="fitWidth" title="fit page to window width" class="icon-expand"></button>\n\t\t</li>\n\t</ul>\n\n\t<ul class="pull-right">\n\t\t<li><span id="current-page"></span> / <span id="page-count"></span></li>\n\t</ul>\n\n</div>\n'})})();
|
||||
function merge(c,d){var a;typeof d==="undefined"&&(d={});for(a in c)c.hasOwnProperty(a)&&!(a in d)&&(d[a]=c[a]);return d}var ComicBookException={INVALID_ACTION:"invalid action",INVALID_PAGE:"invalid page",INVALID_PAGE_TYPE:"invalid page type",UNDEFINED_CONTROL:"undefined control",INVALID_ZOOM_MODE:"invalid zoom mode",INVALID_NAVIGATION_EVENT:"invalid navigation event"};
|
||||
function ComicBook(c,d,a){function b(){var a=window.innerHeight+1;t===!1&&(t=$(document.createElement("div")).attr("id","cb-width-shiv").css({width:"100%",position:"absolute",top:0,zIndex:"-1000"}),$("body").append(t));t.height(a);return t.innerWidth()}function h(){var a=m();a!==n&&u.indexOf(a)>-1&&(n=a,e.draw())}function m(){var a=parseInt(location.hash.substring(1),10)-1||0;if(a<0)a=location.hash=0;return a}function l(){p=document.getElementById(g);k=p.getContext("2d");q===!1&&(e.renderControls(),
|
||||
q=!0);window.addEventListener("keydown",e.navigation,!1);window.addEventListener("hashchange",h,!1)}var e=this,g=c;this.srcs=d;var f=merge({displayMode:"double",zoomMode:"fitWidth",manga:!1,enhance:{},keyboard:{next:78,previous:80,toolbar:84,toggleLayout:76}},a),x=d.length,o=[],p,k,u=[],v=1,s=!1,q=!1,r=!1,t=!1,c=m(),n=c<d.length?c:0;ComicBook.prototype.renderControls=function(){var a={};$.each(Handlebars.templates,function(b,c){var d=$(c().trim());a[b]=d;d.find("*").andSelf().filter("[data-action][data-trigger]").each(function(){var a=
|
||||
$(this),b=a.data("trigger"),c=a.data("action");if(typeof e[a.data("action")]==="function")a.on(b,e[c]);a.on(b,function(a){$(e).trigger(b,a)})});$(p).before(d)});this.controls=a};ComicBook.prototype.getControl=function(a){if(typeof this.controls[a]!=="object")throw ComicBookException.UNDEFINED_CONTROL+" "+a;return this.controls[a]};ComicBook.prototype.showControl=function(a){this.getControl(a).show().addClass("open")};ComicBook.prototype.hideControl=function(a){this.getControl(a).removeClass("open").hide()};
|
||||
ComicBook.prototype.toggleControl=function(a){this.getControl(a).toggle().toggleClass("open")};ComicBook.prototype.toggleLayout=function(){var a=e.getControl("toolbar").find("[data-action=toggleLayout]"),b=f.displayMode==="single"?"double":"single";a.removeClass(f.displayMode);a.addClass(b);f.displayMode=b;e.drawPage()};ComicBook.prototype.getPage=function(a){if(a<0||a>d.length-1)throw ComicBookException.INVALID_PAGE+" "+a;if(typeof o[a]==="object")return o[a];else r=a,this.showControl("loadingOverlay")};
|
||||
ComicBook.prototype.draw=function(){l();$(".navigate").outerHeight(window.innerHeight);$("#cb-loading-overlay").outerWidth(b()).height(window.innerHeight);o.length!==x?this.preload():this.drawPage()};ComicBook.prototype.zoom=function(a){f.zoomMode="manual";v=a;typeof this.getPage(n)==="object"&&this.drawPage()};ComicBook.prototype.zoomIn=function(){e.zoom(v+0.1)};ComicBook.prototype.zoomOut=function(){e.zoom(v-0.1)};ComicBook.prototype.fitWidth=function(){f.zoomMode="fitWidth";ComicBook.prototype.drawPage()};
|
||||
ComicBook.prototype.preload=function(){function a(b){var k=new Image;k.src=d[b];k.onload=function(){o[b]=this;u.push(b);$("#cb-progress-bar .progressbar-value").css("width",Math.floor(u.length/x*100)+"%");var k=f.displayMode==="double"&&n<d.length-1?1:0;if(c===!1&&$.inArray(n+k,u)!==-1||typeof r==="number"&&$.inArray(r,u)!==-1)typeof r==="number"&&(n=r-1,r=!1),e.drawPage(),e.hideControl("loadingOverlay"),c=!0;g.length?(a(g[0]),g.splice(0,1)):$("#cb-status").delay(500).fadeOut()}}var b=n,c=!1,g=[];
|
||||
this.showControl("loadingOverlay");(function(b,c){for(var d=1,e=b,f=b-1;e<=c;)d>3&&f>-1?(g.push(f),f--,d=0):(g.push(e),e++),d++;for(;f>-1;)g.push(f),f--;a(g[0])})(b,d.length-1)};ComicBook.prototype.pageLoaded=function(a){return typeof u[a-1]!=="undefined"};ComicBook.prototype.drawPage=function(a,c){var g=(typeof c!=="undefined"?c:1)?0:window.scrollY;if(typeof a==="number"&&a<d.length&&a>0&&(n=a-1,!this.pageLoaded(a))){this.showControl("loadingOverlay");return}n<0&&(n=0);var h,l=0,r=0,o=e.getPage(n),
|
||||
q=!1;f.displayMode==="double"&&n<d.length-1&&(q=e.getPage(n+1));if(typeof o!=="object")throw ComicBookException.INVALID_PAGE_TYPE+" "+typeof o;var w=o.width;p.width=0;p.height=0;if(s=typeof q==="object"&&(o.width>o.height||q.width>q.height)&&f.displayMode==="double")f.displayMode="single";f.displayMode==="double"&&(w+=typeof q==="object"?q.width:w);switch(f.zoomMode){case "manual":document.body.style.overflowX="auto";h=f.displayMode==="double"?v*2:v;break;case "fitWidth":document.body.style.overflowX=
|
||||
"hidden";v=h=b()>w?(b()-w)/b()+1:b()/w;break;default:throw ComicBookException.INVALID_ZOOM_MODE+" "+f.zoomMode;}var w=o.width*h,t=o.height*h;h=f.zoomMode==="manual"?o.width*v:w;var u=f.zoomMode==="manual"?o.height*v:t,t=u;p.width=w<b()?b():w;p.height=t<window.innerHeight?window.innerHeight:t;w<b()&&f.zoomMode==="manual"&&(l=(b()-h)/2,f.displayMode==="double"&&(l-=h/2));t<window.innerHeight&&f.zoomMode==="manual"&&(r=(window.innerHeight-u)/2);f.manga&&f.displayMode==="double"&&typeof q==="object"&&
|
||||
(w=o,o=q,q=w);k.drawImage(o,l,r,h,u);f.displayMode==="double"&&typeof q==="object"&&k.drawImage(q,h+l,r,h,u);$.each(f.enhance,function(a,b){e.enhance[a](b)});l=f.displayMode==="double"&&n+2<=d.length?n+1+"-"+(n+2):n+1;this.getControl("toolbar").find("#current-page").text(l).end().find("#page-count").text(d.length);if(s)f.displayMode="double";$("button.cb-fit-width").attr("disabled",f.zoomMode==="fitWidth");$(".navigate").show();n===0&&($(".navigate-left").hide(),$(".navigate-right").show());if(n===
|
||||
d.length-1||typeof q==="object"&&n===d.length-2)$(".navigate-left").show(),$(".navigate-right").hide();$(this).trigger("navigate");if(m()!==n)location.hash=n+1;window.scroll(0,g)};ComicBook.prototype.drawNextPage=function(){var a;try{a=e.getPage(n+1)}catch(b){}if(!a)return!1;if(n+1<o.length){n+=f.displayMode==="single"||s?1:2;try{e.drawPage()}catch(c){}}};ComicBook.prototype.drawPrevPage=function(){var a;try{a=e.getPage(n-1)}catch(b){}if(!a)return!1;s=a.width>a.height;n>0&&(n-=f.displayMode==="single"||
|
||||
s?1:2,e.drawPage())};ComicBook.prototype.brightness=function(){e.enhance.brightness({brightness:$(this).val()})};ComicBook.prototype.contrast=function(){e.enhance.brightness({contrast:$(this).val()})};ComicBook.prototype.sharpen=function(){e.enhance.sharpen({amount:$(this).val()})};ComicBook.prototype.desaturate=function(){$(this).is(":checked")?e.enhance.desaturate():e.enhance.resaturate()};ComicBook.prototype.resetEnhancements=function(){e.enhance.reset()};ComicBook.prototype.enhance={reset:function(a){a?
|
||||
delete f.enhance[a]:f.enhance={};e.drawPage(null,!1)},brightness:function(a,b){b!==!1&&this.reset("brightness");var c=merge({brightness:0,contrast:0},a);f.enhance.brightness=c;Pixastic.process(p,"brightness",{brightness:c.brightness,contrast:c.contrast,legacy:!0});l()},desaturate:function(){f.enhance.desaturate={};Pixastic.process(p,"desaturate",{average:!1});l()},resaturate:function(){delete f.enhance.desaturate;e.drawPage(null,!1)},sharpen:function(a){this.desharpen();a=merge({amount:0},a);f.enhance.sharpen=
|
||||
a;Pixastic.process(p,"sharpen",{amount:a.amount});l()},desharpen:function(){delete f.enhance.sharpen;e.drawPage(null,!1)}};ComicBook.prototype.navigation=function(a){if($("#cb-loading-overlay").is(":visible"))return!1;var b=!1;switch(a.type){case "keydown":a.keyCode===f.keyboard.previous&&(b="left");a.keyCode===f.keyboard.next&&(b="right");a.keyCode===f.keyboard.toolbar&&e.toggleToolbar();a.keyCode===f.keyboard.toggleLayout&&e.toggleLayout();break;default:throw ComicBookException.INVALID_NAVIGATION_EVENT+
|
||||
" "+a.type;}if(b)return a.stopPropagation(),f.manga?(b==="left"&&e.drawNextPage(),b==="right"&&e.drawPrevPage()):(b==="left"&&e.drawPrevPage(),b==="right"&&e.drawNextPage()),!1};ComicBook.prototype.destroy=function(){$("#cb-loading-overlay, #cb-status, #cb-color, .cb-control, .cb-toolbar, #cb-width-shiv").remove();p.width=0;p.height=0;window.removeEventListener("keydown",e.navigation,!1);window.removeEventListener("hashchange",h,!1);location.hash="";$(this).trigger("destroy")}};
|
||||
|
|
@ -1 +0,0 @@
|
|||
bitjs: Binary Tools for JavaScript
|
||||
|
|
@ -1,340 +0,0 @@
|
|||
/**
|
||||
* archive.js
|
||||
*
|
||||
* Provides base functionality for unarchiving.
|
||||
*
|
||||
* Licensed under the MIT License
|
||||
*
|
||||
* Copyright(c) 2011 Google Inc.
|
||||
*/
|
||||
|
||||
var bitjs = bitjs || {};
|
||||
bitjs.archive = bitjs.archive || {};
|
||||
|
||||
(function() {
|
||||
|
||||
// ===========================================================================
|
||||
// Stolen from Closure because it's the best way to do Java-like inheritance.
|
||||
bitjs.base = function(me, opt_methodName, var_args) {
|
||||
var caller = arguments.callee.caller;
|
||||
if (caller.superClass_) {
|
||||
// This is a constructor. Call the superclass constructor.
|
||||
return caller.superClass_.constructor.apply(
|
||||
me, Array.prototype.slice.call(arguments, 1));
|
||||
}
|
||||
|
||||
var args = Array.prototype.slice.call(arguments, 2);
|
||||
var foundCaller = false;
|
||||
for (var ctor = me.constructor;
|
||||
ctor; ctor = ctor.superClass_ && ctor.superClass_.constructor) {
|
||||
if (ctor.prototype[opt_methodName] === caller) {
|
||||
foundCaller = true;
|
||||
} else if (foundCaller) {
|
||||
return ctor.prototype[opt_methodName].apply(me, args);
|
||||
}
|
||||
}
|
||||
|
||||
// If we did not find the caller in the prototype chain,
|
||||
// then one of two things happened:
|
||||
// 1) The caller is an instance method.
|
||||
// 2) This method was not called by the right caller.
|
||||
if (me[opt_methodName] === caller) {
|
||||
return me.constructor.prototype[opt_methodName].apply(me, args);
|
||||
} else {
|
||||
throw Error(
|
||||
'goog.base called from a method of one name ' +
|
||||
'to a method of a different name');
|
||||
}
|
||||
};
|
||||
bitjs.inherits = function(childCtor, parentCtor) {
|
||||
/** @constructor */
|
||||
function tempCtor() {};
|
||||
tempCtor.prototype = parentCtor.prototype;
|
||||
childCtor.superClass_ = parentCtor.prototype;
|
||||
childCtor.prototype = new tempCtor();
|
||||
childCtor.prototype.constructor = childCtor;
|
||||
};
|
||||
// ===========================================================================
|
||||
|
||||
/**
|
||||
* An unarchive event.
|
||||
*
|
||||
* @param {string} type The event type.
|
||||
* @constructor
|
||||
*/
|
||||
bitjs.archive.UnarchiveEvent = function(type) {
|
||||
/**
|
||||
* The event type.
|
||||
*
|
||||
* @type {string}
|
||||
*/
|
||||
this.type = type;
|
||||
};
|
||||
|
||||
/**
|
||||
* The UnarchiveEvent types.
|
||||
*/
|
||||
bitjs.archive.UnarchiveEvent.Type = {
|
||||
START: 'start',
|
||||
PROGRESS: 'progress',
|
||||
EXTRACT: 'extract',
|
||||
FINISH: 'finish',
|
||||
INFO: 'info',
|
||||
ERROR: 'error'
|
||||
};
|
||||
|
||||
/**
|
||||
* Useful for passing info up to the client (for debugging).
|
||||
*
|
||||
* @param {string} msg The info message.
|
||||
*/
|
||||
bitjs.archive.UnarchiveInfoEvent = function(msg) {
|
||||
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.INFO);
|
||||
|
||||
/**
|
||||
* The information message.
|
||||
*
|
||||
* @type {string}
|
||||
*/
|
||||
this.msg = msg;
|
||||
};
|
||||
bitjs.inherits(bitjs.archive.UnarchiveInfoEvent, bitjs.archive.UnarchiveEvent);
|
||||
|
||||
/**
|
||||
* An unrecoverable error has occured.
|
||||
*
|
||||
* @param {string} msg The error message.
|
||||
*/
|
||||
bitjs.archive.UnarchiveErrorEvent = function(msg) {
|
||||
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.ERROR);
|
||||
|
||||
/**
|
||||
* The information message.
|
||||
*
|
||||
* @type {string}
|
||||
*/
|
||||
this.msg = msg;
|
||||
};
|
||||
bitjs.inherits(bitjs.archive.UnarchiveErrorEvent, bitjs.archive.UnarchiveEvent);
|
||||
|
||||
/**
|
||||
* Start event.
|
||||
*
|
||||
* @param {string} msg The info message.
|
||||
*/
|
||||
bitjs.archive.UnarchiveStartEvent = function() {
|
||||
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.START);
|
||||
};
|
||||
bitjs.inherits(bitjs.archive.UnarchiveStartEvent, bitjs.archive.UnarchiveEvent);
|
||||
|
||||
/**
|
||||
* Finish event.
|
||||
*
|
||||
* @param {string} msg The info message.
|
||||
*/
|
||||
bitjs.archive.UnarchiveFinishEvent = function() {
|
||||
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.FINISH);
|
||||
};
|
||||
bitjs.inherits(bitjs.archive.UnarchiveFinishEvent, bitjs.archive.UnarchiveEvent);
|
||||
|
||||
/**
|
||||
* Progress event.
|
||||
*/
|
||||
bitjs.archive.UnarchiveProgressEvent = function(
|
||||
currentFilename,
|
||||
currentFileNumber,
|
||||
currentBytesUnarchivedInFile,
|
||||
currentBytesUnarchived,
|
||||
totalUncompressedBytesInArchive,
|
||||
totalFilesInArchive) {
|
||||
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.PROGRESS);
|
||||
|
||||
this.currentFilename = currentFilename;
|
||||
this.currentFileNumber = currentFileNumber;
|
||||
this.currentBytesUnarchivedInFile = currentBytesUnarchivedInFile;
|
||||
this.totalFilesInArchive = totalFilesInArchive;
|
||||
this.currentBytesUnarchived = currentBytesUnarchived;
|
||||
this.totalUncompressedBytesInArchive = totalUncompressedBytesInArchive;
|
||||
};
|
||||
bitjs.inherits(bitjs.archive.UnarchiveProgressEvent, bitjs.archive.UnarchiveEvent);
|
||||
|
||||
/**
|
||||
* All extracted files returned by an Unarchiver will implement
|
||||
* the following interface:
|
||||
*
|
||||
* interface UnarchivedFile {
|
||||
* string filename
|
||||
* TypedArray fileData
|
||||
* }
|
||||
*
|
||||
*/
|
||||
|
||||
/**
|
||||
* Extract event.
|
||||
*/
|
||||
bitjs.archive.UnarchiveExtractEvent = function(unarchivedFile) {
|
||||
bitjs.base(this, bitjs.archive.UnarchiveEvent.Type.EXTRACT);
|
||||
|
||||
/**
|
||||
* @type {UnarchivedFile}
|
||||
*/
|
||||
this.unarchivedFile = unarchivedFile;
|
||||
};
|
||||
bitjs.inherits(bitjs.archive.UnarchiveExtractEvent, bitjs.archive.UnarchiveEvent);
|
||||
|
||||
|
||||
/**
|
||||
* Base class for all Unarchivers.
|
||||
*
|
||||
* @param {ArrayBuffer} arrayBuffer The Array Buffer.
|
||||
* @param {string} opt_pathToBitJS Optional string for where the BitJS files are located.
|
||||
* @constructor
|
||||
*/
|
||||
bitjs.archive.Unarchiver = function(arrayBuffer, opt_pathToBitJS) {
|
||||
/**
|
||||
* The ArrayBuffer object.
|
||||
* @type {ArrayBuffer}
|
||||
* @protected
|
||||
*/
|
||||
this.ab = arrayBuffer;
|
||||
|
||||
/**
|
||||
* The path to the BitJS files.
|
||||
* @type {string}
|
||||
* @private
|
||||
*/
|
||||
this.pathToBitJS_ = opt_pathToBitJS || '';
|
||||
|
||||
/**
|
||||
* A map from event type to an array of listeners.
|
||||
* @type {Map.<string, Array>}
|
||||
*/
|
||||
this.listeners_ = {};
|
||||
for (var type in bitjs.archive.UnarchiveEvent.Type) {
|
||||
this.listeners_[bitjs.archive.UnarchiveEvent.Type[type]] = [];
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Private web worker initialized during start().
|
||||
* @type {Worker}
|
||||
* @private
|
||||
*/
|
||||
bitjs.archive.Unarchiver.prototype.worker_ = null;
|
||||
|
||||
/**
|
||||
* This method must be overridden by the subclass to return the script filename.
|
||||
* @return {string} The script filename.
|
||||
* @protected.
|
||||
*/
|
||||
bitjs.archive.Unarchiver.prototype.getScriptFileName = function() {
|
||||
throw 'Subclasses of AbstractUnarchiver must overload getScriptFileName()';
|
||||
};
|
||||
|
||||
/**
|
||||
* Adds an event listener for UnarchiveEvents.
|
||||
*
|
||||
* @param {string} Event type.
|
||||
* @param {function} An event handler function.
|
||||
*/
|
||||
bitjs.archive.Unarchiver.prototype.addEventListener = function(type, listener) {
|
||||
if (type in this.listeners_) {
|
||||
if (this.listeners_[type].indexOf(listener) == -1) {
|
||||
this.listeners_[type].push(listener);
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Removes an event listener.
|
||||
*
|
||||
* @param {string} Event type.
|
||||
* @param {EventListener|function} An event listener or handler function.
|
||||
*/
|
||||
bitjs.archive.Unarchiver.prototype.removeEventListener = function(type, listener) {
|
||||
if (type in this.listeners_) {
|
||||
var index = this.listeners_[type].indexOf(listener);
|
||||
if (index != -1) {
|
||||
this.listeners_[type].splice(index, 1);
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Receive an event and pass it to the listener functions.
|
||||
*
|
||||
* @param {bitjs.archive.UnarchiveEvent} e
|
||||
* @private
|
||||
*/
|
||||
bitjs.archive.Unarchiver.prototype.handleWorkerEvent_ = function(e) {
|
||||
if ((e instanceof bitjs.archive.UnarchiveEvent || e.type) &&
|
||||
this.listeners_[e.type] instanceof Array) {
|
||||
this.listeners_[e.type].forEach(function (listener) { listener(e) });
|
||||
} else {
|
||||
console.log(e);
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Starts the unarchive in a separate Web Worker thread and returns immediately.
|
||||
*/
|
||||
bitjs.archive.Unarchiver.prototype.start = function() {
|
||||
var me = this;
|
||||
var scriptFileName = this.pathToBitJS_ + this.getScriptFileName();
|
||||
if (scriptFileName) {
|
||||
this.worker_ = new Worker(scriptFileName);
|
||||
|
||||
this.worker_.onerror = function(e) {
|
||||
console.log('Worker error: message = ' + e.message);
|
||||
throw e;
|
||||
};
|
||||
|
||||
this.worker_.onmessage = function(e) {
|
||||
if (typeof e.data == 'string') {
|
||||
// Just log any strings the workers pump our way.
|
||||
console.log(e.data);
|
||||
} else {
|
||||
// Assume that it is an UnarchiveEvent. Some browsers preserve the 'type'
|
||||
// so that instanceof UnarchiveEvent returns true, but others do not.
|
||||
me.handleWorkerEvent_(e.data);
|
||||
}
|
||||
};
|
||||
|
||||
this.worker_.postMessage({file: this.ab});
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Unzipper
|
||||
* @extends {bitjs.archive.Unarchiver}
|
||||
* @constructor
|
||||
*/
|
||||
bitjs.archive.Unzipper = function(arrayBuffer, opt_pathToBitJS) {
|
||||
bitjs.base(this, arrayBuffer, opt_pathToBitJS);
|
||||
};
|
||||
bitjs.inherits(bitjs.archive.Unzipper, bitjs.archive.Unarchiver);
|
||||
bitjs.archive.Unzipper.prototype.getScriptFileName = function() { return 'unzip.js' };
|
||||
|
||||
/**
|
||||
* Unrarrer
|
||||
* @extends {bitjs.archive.Unarchiver}
|
||||
* @constructor
|
||||
*/
|
||||
bitjs.archive.Unrarrer = function(arrayBuffer, opt_pathToBitJS) {
|
||||
bitjs.base(this, arrayBuffer, opt_pathToBitJS);
|
||||
};
|
||||
bitjs.inherits(bitjs.archive.Unrarrer, bitjs.archive.Unarchiver);
|
||||
bitjs.archive.Unrarrer.prototype.getScriptFileName = function() { return 'unrar.js' };
|
||||
|
||||
/**
|
||||
* Untarrer
|
||||
* @extends {bitjs.archive.Unarchiver}
|
||||
* @constructor
|
||||
*/
|
||||
bitjs.archive.Untarrer = function(arrayBuffer, opt_pathToBitJS) {
|
||||
bitjs.base(this, arrayBuffer, opt_pathToBitJS);
|
||||
};
|
||||
bitjs.inherits(bitjs.archive.Untarrer, bitjs.archive.Unarchiver);
|
||||
bitjs.archive.Untarrer.prototype.getScriptFileName = function() { return 'untar.js' };
|
||||
|
||||
})();
|
||||
|
|
@ -1,79 +0,0 @@
|
|||
<!DOCTYPE html>
|
||||
<html><head>
|
||||
<script src="io.js"></script>
|
||||
<script src="archive.js"></script>
|
||||
</head>
|
||||
<body>
|
||||
<input id='filechooser' type='file'></input>
|
||||
</body>
|
||||
<script>
|
||||
|
||||
function assertTrue(a) {
|
||||
if (!a) {
|
||||
alert("'" + a + "' not true");
|
||||
}
|
||||
}
|
||||
function assertEquals(a,b) {
|
||||
if (a != b) {
|
||||
alert("'" + a + "' != '" + b + "'")
|
||||
}
|
||||
}
|
||||
|
||||
function testAddRemoveEventListeners() {
|
||||
var progress = function(e) { alert('progress') };
|
||||
var progress2 = function(e) { alert('progress2') };
|
||||
|
||||
var ua = new bitjs.archive.Unarchiver(null);
|
||||
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress);
|
||||
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress);
|
||||
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress);
|
||||
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress2);
|
||||
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress2);
|
||||
assertEquals(2, ua.listeners_[bitjs.archive.UnarchiveEvent.Type.PROGRESS].length);
|
||||
|
||||
ua.removeEventListener(bitjs.archive.UnarchiveEvent.Type.START, progress);
|
||||
assertEquals(2, ua.listeners_[bitjs.archive.UnarchiveEvent.Type.PROGRESS].length);
|
||||
|
||||
ua.removeEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, progress);
|
||||
assertEquals(1, ua.listeners_[bitjs.archive.UnarchiveEvent.Type.PROGRESS].length);
|
||||
}
|
||||
|
||||
function testAbstractUnarchiveThrows() {
|
||||
var ua = new bitjs.archive.Unarchiver(null);
|
||||
try {
|
||||
ua.start();
|
||||
alert("unarchive() didn't throw");
|
||||
} catch(e) {}
|
||||
}
|
||||
|
||||
// unit tests
|
||||
// testAddRemoveEventListeners();
|
||||
// testAbstractUnarchiveThrows();
|
||||
// var uz = new bitjs.archive.Unzipper(null);
|
||||
|
||||
document.body.querySelector("#filechooser").addEventListener("change",
|
||||
function(evt) {
|
||||
var inp = evt.target;
|
||||
var filelist = inp.files;
|
||||
if (filelist.length == 1) {
|
||||
var blob = filelist[0];
|
||||
var fr = new FileReader();
|
||||
fr.onload = function() {
|
||||
var ua = new bitjs.archive.Unzipper(fr.result);
|
||||
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.INFO, function(e) {
|
||||
console.log("info: " + e.msg);
|
||||
})
|
||||
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.PROGRESS, function(e) {
|
||||
console.log("progress: " + e.msg);
|
||||
})
|
||||
ua.addEventListener(bitjs.archive.UnarchiveEvent.Type.EXTRACT, function(e) {
|
||||
console.log("extract: " + e.unarchiveFile.filename);
|
||||
})
|
||||
ua.start();
|
||||
};
|
||||
fr.readAsArrayBuffer(blob);
|
||||
}
|
||||
}, false);
|
||||
|
||||
</script>
|
||||
</html>
|
||||
310
lib/bitjs/io.js
310
lib/bitjs/io.js
|
|
@ -1,310 +0,0 @@
|
|||
/*
|
||||
* io.js
|
||||
*
|
||||
* Provides readers for bit/byte streams (reading) and a byte buffer (writing).
|
||||
*
|
||||
* Licensed under the MIT License
|
||||
*
|
||||
* Copyright(c) 2011 Google Inc.
|
||||
* Copyright(c) 2011 antimatter15
|
||||
*/
|
||||
|
||||
var bitjs = bitjs || {};
|
||||
bitjs.io = bitjs.io || {};
|
||||
|
||||
(function() {
|
||||
|
||||
// mask for getting the Nth bit (zero-based)
|
||||
bitjs.BIT = [ 0x01, 0x02, 0x04, 0x08,
|
||||
0x10, 0x20, 0x40, 0x80,
|
||||
0x100, 0x200, 0x400, 0x800,
|
||||
0x1000, 0x2000, 0x4000, 0x8000];
|
||||
|
||||
// mask for getting N number of bits (0-8)
|
||||
var BITMASK = [0, 0x01, 0x03, 0x07, 0x0F, 0x1F, 0x3F, 0x7F, 0xFF ];
|
||||
|
||||
|
||||
/**
|
||||
* This bit stream peeks and consumes bits out of a binary stream.
|
||||
*
|
||||
* {ArrayBuffer} ab An ArrayBuffer object or a Uint8Array.
|
||||
* {boolean} rtl Whether the stream reads bits from the byte starting
|
||||
* from bit 7 to 0 (true) or bit 0 to 7 (false).
|
||||
* {Number} opt_offset The offset into the ArrayBuffer
|
||||
* {Number} opt_length The length of this BitStream
|
||||
*/
|
||||
bitjs.io.BitStream = function(ab, rtl, opt_offset, opt_length) {
|
||||
if (!ab || !ab.toString || ab.toString() !== "[object ArrayBuffer]") {
|
||||
throw "Error! BitArray constructed with an invalid ArrayBuffer object";
|
||||
}
|
||||
|
||||
var offset = opt_offset || 0;
|
||||
var length = opt_length || ab.byteLength;
|
||||
this.bytes = new Uint8Array(ab, offset, length);
|
||||
this.bytePtr = 0; // tracks which byte we are on
|
||||
this.bitPtr = 0; // tracks which bit we are on (can have values 0 through 7)
|
||||
this.peekBits = rtl ? this.peekBits_rtl : this.peekBits_ltr;
|
||||
};
|
||||
|
||||
// byte0 byte1 byte2 byte3
|
||||
// 7......0 | 7......0 | 7......0 | 7......0
|
||||
//
|
||||
// The bit pointer starts at bit0 of byte0 and moves left until it reaches
|
||||
// bit7 of byte0, then jumps to bit0 of byte1, etc.
|
||||
bitjs.io.BitStream.prototype.peekBits_ltr = function(n, movePointers) {
|
||||
if (n <= 0 || typeof n != typeof 1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
var movePointers = movePointers || false,
|
||||
bytePtr = this.bytePtr,
|
||||
bitPtr = this.bitPtr,
|
||||
result = 0,
|
||||
bitsIn = 0,
|
||||
bytes = this.bytes;
|
||||
|
||||
// keep going until we have no more bits left to peek at
|
||||
// TODO: Consider putting all bits from bytes we will need into a variable and then
|
||||
// shifting/masking it to just extract the bits we want.
|
||||
// This could be considerably faster when reading more than 3 or 4 bits at a time.
|
||||
while (n > 0) {
|
||||
if (bytePtr >= bytes.length) {
|
||||
throw "Error! Overflowed the bit stream! n=" + n + ", bytePtr=" + bytePtr + ", bytes.length=" +
|
||||
bytes.length + ", bitPtr=" + bitPtr;
|
||||
return -1;
|
||||
}
|
||||
|
||||
var numBitsLeftInThisByte = (8 - bitPtr);
|
||||
if (n >= numBitsLeftInThisByte) {
|
||||
var mask = (BITMASK[numBitsLeftInThisByte] << bitPtr);
|
||||
result |= (((bytes[bytePtr] & mask) >> bitPtr) << bitsIn);
|
||||
|
||||
bytePtr++;
|
||||
bitPtr = 0;
|
||||
bitsIn += numBitsLeftInThisByte;
|
||||
n -= numBitsLeftInThisByte;
|
||||
}
|
||||
else {
|
||||
var mask = (BITMASK[n] << bitPtr);
|
||||
result |= (((bytes[bytePtr] & mask) >> bitPtr) << bitsIn);
|
||||
|
||||
bitPtr += n;
|
||||
bitsIn += n;
|
||||
n = 0;
|
||||
}
|
||||
}
|
||||
|
||||
if (movePointers) {
|
||||
this.bitPtr = bitPtr;
|
||||
this.bytePtr = bytePtr;
|
||||
}
|
||||
|
||||
return result;
|
||||
};
|
||||
|
||||
// byte0 byte1 byte2 byte3
|
||||
// 7......0 | 7......0 | 7......0 | 7......0
|
||||
//
|
||||
// The bit pointer starts at bit7 of byte0 and moves right until it reaches
|
||||
// bit0 of byte0, then goes to bit7 of byte1, etc.
|
||||
bitjs.io.BitStream.prototype.peekBits_rtl = function(n, movePointers) {
|
||||
if (n <= 0 || typeof n != typeof 1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
var movePointers = movePointers || false,
|
||||
bytePtr = this.bytePtr,
|
||||
bitPtr = this.bitPtr,
|
||||
result = 0,
|
||||
bytes = this.bytes;
|
||||
|
||||
// keep going until we have no more bits left to peek at
|
||||
// TODO: Consider putting all bits from bytes we will need into a variable and then
|
||||
// shifting/masking it to just extract the bits we want.
|
||||
// This could be considerably faster when reading more than 3 or 4 bits at a time.
|
||||
while (n > 0) {
|
||||
|
||||
if (bytePtr >= bytes.length) {
|
||||
throw "Error! Overflowed the bit stream! n=" + n + ", bytePtr=" + bytePtr + ", bytes.length=" +
|
||||
bytes.length + ", bitPtr=" + bitPtr;
|
||||
return -1;
|
||||
}
|
||||
|
||||
var numBitsLeftInThisByte = (8 - bitPtr);
|
||||
if (n >= numBitsLeftInThisByte) {
|
||||
result <<= numBitsLeftInThisByte;
|
||||
result |= (BITMASK[numBitsLeftInThisByte] & bytes[bytePtr]);
|
||||
bytePtr++;
|
||||
bitPtr = 0;
|
||||
n -= numBitsLeftInThisByte;
|
||||
}
|
||||
else {
|
||||
result <<= n;
|
||||
result |= ((bytes[bytePtr] & (BITMASK[n] << (8 - n - bitPtr))) >> (8 - n - bitPtr));
|
||||
|
||||
bitPtr += n;
|
||||
n = 0;
|
||||
}
|
||||
}
|
||||
|
||||
if (movePointers) {
|
||||
this.bitPtr = bitPtr;
|
||||
this.bytePtr = bytePtr;
|
||||
}
|
||||
|
||||
return result;
|
||||
};
|
||||
|
||||
//some voodoo magic
|
||||
bitjs.io.BitStream.prototype.getBits = function() {
|
||||
return (((((this.bytes[this.bytePtr] & 0xff) << 16) +
|
||||
((this.bytes[this.bytePtr+1] & 0xff) << 8) +
|
||||
((this.bytes[this.bytePtr+2] & 0xff))) >>> (8-this.bitPtr)) & 0xffff);
|
||||
};
|
||||
|
||||
bitjs.io.BitStream.prototype.readBits = function(n) {
|
||||
return this.peekBits(n, true);
|
||||
};
|
||||
|
||||
// This returns n bytes as a sub-array, advancing the pointer if movePointers
|
||||
// is true.
|
||||
// Only use this for uncompressed blocks as this throws away remaining bits in
|
||||
// the current byte.
|
||||
bitjs.io.BitStream.prototype.peekBytes = function(n, movePointers) {
|
||||
if (n <= 0 || typeof n != typeof 1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
// from http://tools.ietf.org/html/rfc1951#page-11
|
||||
// "Any bits of input up to the next byte boundary are ignored."
|
||||
while (this.bitPtr != 0) {
|
||||
this.readBits(1);
|
||||
}
|
||||
|
||||
var movePointers = movePointers || false;
|
||||
var bytePtr = this.bytePtr,
|
||||
bitPtr = this.bitPtr;
|
||||
|
||||
var result = this.bytes.subarray(bytePtr, bytePtr + n);
|
||||
|
||||
if (movePointers) {
|
||||
this.bytePtr += n;
|
||||
}
|
||||
|
||||
return result;
|
||||
};
|
||||
|
||||
bitjs.io.BitStream.prototype.readBytes = function( n ) {
|
||||
return this.peekBytes(n, true);
|
||||
};
|
||||
|
||||
|
||||
/**
|
||||
* This object allows you to peek and consume bytes as numbers and strings
|
||||
* out of an ArrayBuffer.
|
||||
*
|
||||
* This object is much easier to write than the above BitStream since
|
||||
* everything is byte-aligned.
|
||||
*
|
||||
* {ArrayBuffer} ab The ArrayBuffer object.
|
||||
* {Number} opt_offset The offset into the ArrayBuffer
|
||||
* {Number} opt_length The length of this BitStream
|
||||
*/
|
||||
bitjs.io.ByteStream = function(ab, opt_offset, opt_length) {
|
||||
var offset = opt_offset || 0;
|
||||
var length = opt_length || ab.byteLength;
|
||||
this.bytes = new Uint8Array(ab, offset, length);
|
||||
this.ptr = 0;
|
||||
};
|
||||
|
||||
// peeks at the next n bytes as an unsigned number but does not advance the pointer
|
||||
// TODO: This apparently cannot read more than 4 bytes as a number?
|
||||
bitjs.io.ByteStream.prototype.peekNumber = function( n ) {
|
||||
// TODO: return error if n would go past the end of the stream?
|
||||
if (n <= 0 || typeof n != typeof 1)
|
||||
return -1;
|
||||
|
||||
var result = 0;
|
||||
// read from last byte to first byte and roll them in
|
||||
var curByte = this.ptr + n - 1;
|
||||
while (curByte >= this.ptr) {
|
||||
result <<= 8;
|
||||
result |= this.bytes[curByte];
|
||||
--curByte;
|
||||
}
|
||||
return result;
|
||||
};
|
||||
|
||||
// returns the next n bytes as an unsigned number (or -1 on error)
|
||||
// and advances the stream pointer n bytes
|
||||
bitjs.io.ByteStream.prototype.readNumber = function( n ) {
|
||||
var num = this.peekNumber( n );
|
||||
this.ptr += n;
|
||||
return num;
|
||||
};
|
||||
|
||||
// This returns n bytes as a sub-array, advancing the pointer if movePointers
|
||||
// is true.
|
||||
bitjs.io.ByteStream.prototype.peekBytes = function(n, movePointers) {
|
||||
if (n <= 0 || typeof n != typeof 1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
var result = this.bytes.subarray(this.ptr, this.ptr + n);
|
||||
|
||||
if (movePointers) {
|
||||
this.ptr += n;
|
||||
}
|
||||
|
||||
return result;
|
||||
};
|
||||
|
||||
bitjs.io.ByteStream.prototype.readBytes = function( n ) {
|
||||
return this.peekBytes(n, true);
|
||||
};
|
||||
|
||||
// peeks at the next n bytes as a string but does not advance the pointer
|
||||
bitjs.io.ByteStream.prototype.peekString = function( n ) {
|
||||
if (n <= 0 || typeof n != typeof 1) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
var result = "";
|
||||
for (var p = this.ptr, end = this.ptr + n; p < end; ++p) {
|
||||
result += String.fromCharCode(this.bytes[p]);
|
||||
}
|
||||
return result;
|
||||
};
|
||||
|
||||
// returns the next n bytes as a string
|
||||
// and advances the stream pointer n bytes
|
||||
bitjs.io.ByteStream.prototype.readString = function(n) {
|
||||
var strToReturn = this.peekString(n);
|
||||
this.ptr += n;
|
||||
return strToReturn;
|
||||
};
|
||||
|
||||
|
||||
/**
|
||||
* A write-only Byte buffer which uses a Uint8 Typed Array as a backing store.
|
||||
*/
|
||||
bitjs.io.ByteBuffer = function(numBytes) {
|
||||
if (typeof numBytes != typeof 1 || numBytes <= 0) {
|
||||
throw "Error! ByteBuffer initialized with '" + numBytes + "'";
|
||||
}
|
||||
this.data = new Uint8Array(numBytes);
|
||||
this.ptr = 0;
|
||||
};
|
||||
|
||||
bitjs.io.ByteBuffer.prototype.insertByte = function(b) {
|
||||
// TODO: throw if byte is invalid?
|
||||
this.data[this.ptr++] = b;
|
||||
};
|
||||
|
||||
bitjs.io.ByteBuffer.prototype.insertBytes = function(bytes) {
|
||||
// TODO: throw if bytes is invalid?
|
||||
this.data.set(bytes, this.ptr);
|
||||
this.ptr += bytes.length;
|
||||
};
|
||||
|
||||
})();
|
||||
|
|
@ -1,906 +0,0 @@
|
|||
/**
|
||||
* unrar.js
|
||||
*
|
||||
* Copyright(c) 2011 Google Inc.
|
||||
* Copyright(c) 2011 antimatter15
|
||||
*
|
||||
* Reference Documentation:
|
||||
*
|
||||
* http://kthoom.googlecode.com/hg/docs/unrar.html
|
||||
*/
|
||||
|
||||
// This file expects to be invoked as a Worker (see onmessage below).
|
||||
importScripts('io.js');
|
||||
importScripts('archive.js');
|
||||
|
||||
// Progress variables.
|
||||
var currentFilename = "";
|
||||
var currentFileNumber = 0;
|
||||
var currentBytesUnarchivedInFile = 0;
|
||||
var currentBytesUnarchived = 0;
|
||||
var totalUncompressedBytesInArchive = 0;
|
||||
var totalFilesInArchive = 0;
|
||||
|
||||
// Helper functions.
|
||||
var info = function(str) {
|
||||
postMessage(new bitjs.archive.UnarchiveInfoEvent(str));
|
||||
};
|
||||
var err = function(str) {
|
||||
postMessage(new bitjs.archive.UnarchiveErrorEvent(str));
|
||||
};
|
||||
var postProgress = function() {
|
||||
postMessage(new bitjs.archive.UnarchiveProgressEvent(
|
||||
currentFilename,
|
||||
currentFileNumber,
|
||||
currentBytesUnarchivedInFile,
|
||||
currentBytesUnarchived,
|
||||
totalUncompressedBytesInArchive,
|
||||
totalFilesInArchive));
|
||||
};
|
||||
|
||||
// shows a byte value as its hex representation
|
||||
var nibble = "0123456789ABCDEF";
|
||||
var byteValueToHexString = function(num) {
|
||||
return nibble[num>>4] + nibble[num&0xF];
|
||||
};
|
||||
var twoByteValueToHexString = function(num) {
|
||||
return nibble[(num>>12)&0xF] + nibble[(num>>8)&0xF] + nibble[(num>>4)&0xF] + nibble[num&0xF];
|
||||
};
|
||||
|
||||
|
||||
// Volume Types
|
||||
var MARK_HEAD = 0x72,
|
||||
MAIN_HEAD = 0x73,
|
||||
FILE_HEAD = 0x74,
|
||||
COMM_HEAD = 0x75,
|
||||
AV_HEAD = 0x76,
|
||||
SUB_HEAD = 0x77,
|
||||
PROTECT_HEAD = 0x78,
|
||||
SIGN_HEAD = 0x79,
|
||||
NEWSUB_HEAD = 0x7a,
|
||||
ENDARC_HEAD = 0x7b;
|
||||
|
||||
// bstream is a bit stream
|
||||
var RarVolumeHeader = function(bstream) {
|
||||
|
||||
var headPos = bstream.bytePtr;
|
||||
// byte 1,2
|
||||
info("Rar Volume Header @"+bstream.bytePtr);
|
||||
|
||||
this.crc = bstream.readBits(16);
|
||||
info(" crc=" + this.crc);
|
||||
|
||||
// byte 3
|
||||
this.headType = bstream.readBits(8);
|
||||
info(" headType=" + this.headType);
|
||||
|
||||
// Get flags
|
||||
// bytes 4,5
|
||||
this.flags = {};
|
||||
this.flags.value = bstream.peekBits(16);
|
||||
|
||||
info(" flags=" + twoByteValueToHexString(this.flags.value));
|
||||
switch (this.headType) {
|
||||
case MAIN_HEAD:
|
||||
this.flags.MHD_VOLUME = !!bstream.readBits(1);
|
||||
this.flags.MHD_COMMENT = !!bstream.readBits(1);
|
||||
this.flags.MHD_LOCK = !!bstream.readBits(1);
|
||||
this.flags.MHD_SOLID = !!bstream.readBits(1);
|
||||
this.flags.MHD_PACK_COMMENT = !!bstream.readBits(1);
|
||||
this.flags.MHD_NEWNUMBERING = this.flags.MHD_PACK_COMMENT;
|
||||
this.flags.MHD_AV = !!bstream.readBits(1);
|
||||
this.flags.MHD_PROTECT = !!bstream.readBits(1);
|
||||
this.flags.MHD_PASSWORD = !!bstream.readBits(1);
|
||||
this.flags.MHD_FIRSTVOLUME = !!bstream.readBits(1);
|
||||
this.flags.MHD_ENCRYPTVER = !!bstream.readBits(1);
|
||||
bstream.readBits(6); // unused
|
||||
break;
|
||||
case FILE_HEAD:
|
||||
this.flags.LHD_SPLIT_BEFORE = !!bstream.readBits(1); // 0x0001
|
||||
this.flags.LHD_SPLIT_AFTER = !!bstream.readBits(1); // 0x0002
|
||||
this.flags.LHD_PASSWORD = !!bstream.readBits(1); // 0x0004
|
||||
this.flags.LHD_COMMENT = !!bstream.readBits(1); // 0x0008
|
||||
this.flags.LHD_SOLID = !!bstream.readBits(1); // 0x0010
|
||||
bstream.readBits(3); // unused
|
||||
this.flags.LHD_LARGE = !!bstream.readBits(1); // 0x0100
|
||||
this.flags.LHD_UNICODE = !!bstream.readBits(1); // 0x0200
|
||||
this.flags.LHD_SALT = !!bstream.readBits(1); // 0x0400
|
||||
this.flags.LHD_VERSION = !!bstream.readBits(1); // 0x0800
|
||||
this.flags.LHD_EXTTIME = !!bstream.readBits(1); // 0x1000
|
||||
this.flags.LHD_EXTFLAGS = !!bstream.readBits(1); // 0x2000
|
||||
bstream.readBits(2); // unused
|
||||
info(" LHD_SPLIT_BEFORE = " + this.flags.LHD_SPLIT_BEFORE);
|
||||
break;
|
||||
default:
|
||||
bstream.readBits(16);
|
||||
}
|
||||
|
||||
// byte 6,7
|
||||
this.headSize = bstream.readBits(16);
|
||||
info(" headSize=" + this.headSize);
|
||||
switch (this.headType) {
|
||||
case MAIN_HEAD:
|
||||
this.highPosAv = bstream.readBits(16);
|
||||
this.posAv = bstream.readBits(32);
|
||||
if (this.flags.MHD_ENCRYPTVER) {
|
||||
this.encryptVer = bstream.readBits(8);
|
||||
}
|
||||
info("Found MAIN_HEAD with highPosAv=" + this.highPosAv + ", posAv=" + this.posAv);
|
||||
break;
|
||||
case FILE_HEAD:
|
||||
this.packSize = bstream.readBits(32);
|
||||
this.unpackedSize = bstream.readBits(32);
|
||||
this.hostOS = bstream.readBits(8);
|
||||
this.fileCRC = bstream.readBits(32);
|
||||
this.fileTime = bstream.readBits(32);
|
||||
this.unpVer = bstream.readBits(8);
|
||||
this.method = bstream.readBits(8);
|
||||
this.nameSize = bstream.readBits(16);
|
||||
this.fileAttr = bstream.readBits(32);
|
||||
|
||||
if (this.flags.LHD_LARGE) {
|
||||
info("Warning: Reading in LHD_LARGE 64-bit size values");
|
||||
this.HighPackSize = bstream.readBits(32);
|
||||
this.HighUnpSize = bstream.readBits(32);
|
||||
} else {
|
||||
this.HighPackSize = 0;
|
||||
this.HighUnpSize = 0;
|
||||
if (this.unpackedSize == 0xffffffff) {
|
||||
this.HighUnpSize = 0x7fffffff
|
||||
this.unpackedSize = 0xffffffff;
|
||||
}
|
||||
}
|
||||
this.fullPackSize = 0;
|
||||
this.fullUnpackSize = 0;
|
||||
this.fullPackSize |= this.HighPackSize;
|
||||
this.fullPackSize <<= 32;
|
||||
this.fullPackSize |= this.packSize;
|
||||
|
||||
// read in filename
|
||||
|
||||
this.filename = bstream.readBytes(this.nameSize);
|
||||
for (var _i = 0, _s = ''; _i < this.filename.length; _i++) {
|
||||
_s += String.fromCharCode(this.filename[_i]);
|
||||
}
|
||||
|
||||
this.filename = _s;
|
||||
|
||||
if (this.flags.LHD_SALT) {
|
||||
info("Warning: Reading in 64-bit salt value");
|
||||
this.salt = bstream.readBits(64); // 8 bytes
|
||||
}
|
||||
|
||||
if (this.flags.LHD_EXTTIME) {
|
||||
// 16-bit flags
|
||||
var extTimeFlags = bstream.readBits(16);
|
||||
|
||||
// this is adapted straight out of arcread.cpp, Archive::ReadHeader()
|
||||
for (var I = 0; I < 4; ++I) {
|
||||
var rmode = extTimeFlags >> ((3-I)*4);
|
||||
if ((rmode & 8)==0)
|
||||
continue;
|
||||
if (I!=0)
|
||||
bstream.readBits(16);
|
||||
var count = (rmode&3);
|
||||
for (var J = 0; J < count; ++J)
|
||||
bstream.readBits(8);
|
||||
}
|
||||
}
|
||||
|
||||
if (this.flags.LHD_COMMENT) {
|
||||
info("Found a LHD_COMMENT");
|
||||
}
|
||||
|
||||
|
||||
while(headPos + this.headSize > bstream.bytePtr) bstream.readBits(1);
|
||||
|
||||
info("Found FILE_HEAD with packSize=" + this.packSize + ", unpackedSize= " + this.unpackedSize + ", hostOS=" + this.hostOS + ", unpVer=" + this.unpVer + ", method=" + this.method + ", filename=" + this.filename);
|
||||
|
||||
break;
|
||||
default:
|
||||
info("Found a header of type 0x" + byteValueToHexString(this.headType));
|
||||
// skip the rest of the header bytes (for now)
|
||||
bstream.readBytes( this.headSize - 7 );
|
||||
break;
|
||||
}
|
||||
};
|
||||
|
||||
var BLOCK_LZ = 0,
|
||||
BLOCK_PPM = 1;
|
||||
|
||||
var rLDecode = [0,1,2,3,4,5,6,7,8,10,12,14,16,20,24,28,32,40,48,56,64,80,96,112,128,160,192,224],
|
||||
rLBits = [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],
|
||||
rDBitLengthCounts = [4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,14,0,12],
|
||||
rSDDecode = [0,4,8,16,32,64,128,192],
|
||||
rSDBits = [2,2,3, 4, 5, 6, 6, 6];
|
||||
|
||||
var rDDecode = [0, 1, 2, 3, 4, 6, 8, 12, 16, 24, 32,
|
||||
48, 64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072,
|
||||
4096, 6144, 8192, 12288, 16384, 24576, 32768, 49152, 65536, 98304,
|
||||
131072, 196608, 262144, 327680, 393216, 458752, 524288, 589824,
|
||||
655360, 720896, 786432, 851968, 917504, 983040];
|
||||
|
||||
var rDBits = [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, 14, 14,
|
||||
15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16];
|
||||
|
||||
var rLOW_DIST_REP_COUNT = 16;
|
||||
|
||||
var rNC = 299,
|
||||
rDC = 60,
|
||||
rLDC = 17,
|
||||
rRC = 28,
|
||||
rBC = 20,
|
||||
rHUFF_TABLE_SIZE = (rNC+rDC+rRC+rLDC);
|
||||
|
||||
var UnpBlockType = BLOCK_LZ;
|
||||
var UnpOldTable = new Array(rHUFF_TABLE_SIZE);
|
||||
|
||||
var BD = { //bitdecode
|
||||
DecodeLen: new Array(16),
|
||||
DecodePos: new Array(16),
|
||||
DecodeNum: new Array(rBC)
|
||||
};
|
||||
var LD = { //litdecode
|
||||
DecodeLen: new Array(16),
|
||||
DecodePos: new Array(16),
|
||||
DecodeNum: new Array(rNC)
|
||||
};
|
||||
var DD = { //distdecode
|
||||
DecodeLen: new Array(16),
|
||||
DecodePos: new Array(16),
|
||||
DecodeNum: new Array(rDC)
|
||||
};
|
||||
var LDD = { //low dist decode
|
||||
DecodeLen: new Array(16),
|
||||
DecodePos: new Array(16),
|
||||
DecodeNum: new Array(rLDC)
|
||||
};
|
||||
var RD = { //rep decode
|
||||
DecodeLen: new Array(16),
|
||||
DecodePos: new Array(16),
|
||||
DecodeNum: new Array(rRC)
|
||||
};
|
||||
|
||||
var rBuffer;
|
||||
|
||||
// read in Huffman tables for RAR
|
||||
function RarReadTables(bstream) {
|
||||
var BitLength = new Array(rBC),
|
||||
Table = new Array(rHUFF_TABLE_SIZE);
|
||||
|
||||
// before we start anything we need to get byte-aligned
|
||||
bstream.readBits( (8 - bstream.bitPtr) & 0x7 );
|
||||
|
||||
if (bstream.readBits(1)) {
|
||||
info("Error! PPM not implemented yet");
|
||||
return;
|
||||
}
|
||||
|
||||
if (!bstream.readBits(1)) { //discard old table
|
||||
for (var i = UnpOldTable.length; i--;) UnpOldTable[i] = 0;
|
||||
}
|
||||
|
||||
// read in bit lengths
|
||||
for (var I = 0; I < rBC; ++I) {
|
||||
|
||||
var Length = bstream.readBits(4);
|
||||
if (Length == 15) {
|
||||
var ZeroCount = bstream.readBits(4);
|
||||
if (ZeroCount == 0) {
|
||||
BitLength[I] = 15;
|
||||
}
|
||||
else {
|
||||
ZeroCount += 2;
|
||||
while (ZeroCount-- > 0 && I < rBC)
|
||||
BitLength[I++] = 0;
|
||||
--I;
|
||||
}
|
||||
}
|
||||
else {
|
||||
BitLength[I] = Length;
|
||||
}
|
||||
}
|
||||
|
||||
// now all 20 bit lengths are obtained, we construct the Huffman Table:
|
||||
|
||||
RarMakeDecodeTables(BitLength, 0, BD, rBC);
|
||||
|
||||
var TableSize = rHUFF_TABLE_SIZE;
|
||||
//console.log(DecodeLen, DecodePos, DecodeNum);
|
||||
for (var i = 0; i < TableSize;) {
|
||||
var num = RarDecodeNumber(bstream, BD);
|
||||
if (num < 16) {
|
||||
Table[i] = (num + UnpOldTable[i]) & 0xf;
|
||||
i++;
|
||||
} else if(num < 18) {
|
||||
var N = (num == 16) ? (bstream.readBits(3) + 3) : (bstream.readBits(7) + 11);
|
||||
|
||||
while (N-- > 0 && i < TableSize) {
|
||||
Table[i] = Table[i - 1];
|
||||
i++;
|
||||
}
|
||||
} else {
|
||||
var N = (num == 18) ? (bstream.readBits(3) + 3) : (bstream.readBits(7) + 11);
|
||||
|
||||
while (N-- > 0 && i < TableSize) {
|
||||
Table[i++] = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
RarMakeDecodeTables(Table, 0, LD, rNC);
|
||||
RarMakeDecodeTables(Table, rNC, DD, rDC);
|
||||
RarMakeDecodeTables(Table, rNC + rDC, LDD, rLDC);
|
||||
RarMakeDecodeTables(Table, rNC + rDC + rLDC, RD, rRC);
|
||||
|
||||
for (var i = UnpOldTable.length; i--;) {
|
||||
UnpOldTable[i] = Table[i];
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
function RarDecodeNumber(bstream, dec) {
|
||||
var DecodeLen = dec.DecodeLen, DecodePos = dec.DecodePos, DecodeNum = dec.DecodeNum;
|
||||
var bitField = bstream.getBits() & 0xfffe;
|
||||
//some sort of rolled out binary search
|
||||
var bits = ((bitField < DecodeLen[8])?
|
||||
((bitField < DecodeLen[4])?
|
||||
((bitField < DecodeLen[2])?
|
||||
((bitField < DecodeLen[1])?1:2)
|
||||
:((bitField < DecodeLen[3])?3:4))
|
||||
:(bitField < DecodeLen[6])?
|
||||
((bitField < DecodeLen[5])?5:6)
|
||||
:((bitField < DecodeLen[7])?7:8))
|
||||
:((bitField < DecodeLen[12])?
|
||||
((bitField < DecodeLen[10])?
|
||||
((bitField < DecodeLen[9])?9:10)
|
||||
:((bitField < DecodeLen[11])?11:12))
|
||||
:(bitField < DecodeLen[14])?
|
||||
((bitField < DecodeLen[13])?13:14)
|
||||
:15));
|
||||
bstream.readBits(bits);
|
||||
var N = DecodePos[bits] + ((bitField - DecodeLen[bits -1]) >>> (16 - bits));
|
||||
|
||||
return DecodeNum[N];
|
||||
}
|
||||
|
||||
|
||||
|
||||
function RarMakeDecodeTables(BitLength, offset, dec, size) {
|
||||
var DecodeLen = dec.DecodeLen, DecodePos = dec.DecodePos, DecodeNum = dec.DecodeNum;
|
||||
var LenCount = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
|
||||
TmpPos = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],
|
||||
N = 0, M = 0;
|
||||
for (var i = DecodeNum.length; i--;) DecodeNum[i] = 0;
|
||||
for (var i = 0; i < size; i++) {
|
||||
LenCount[BitLength[i + offset] & 0xF]++;
|
||||
}
|
||||
LenCount[0] = 0;
|
||||
TmpPos[0] = 0;
|
||||
DecodePos[0] = 0;
|
||||
DecodeLen[0] = 0;
|
||||
|
||||
for (var I = 1; I < 16; ++I) {
|
||||
N = 2 * (N+LenCount[I]);
|
||||
M = (N << (15-I));
|
||||
if (M > 0xFFFF)
|
||||
M = 0xFFFF;
|
||||
DecodeLen[I] = M;
|
||||
DecodePos[I] = DecodePos[I-1] + LenCount[I-1];
|
||||
TmpPos[I] = DecodePos[I];
|
||||
}
|
||||
for (I = 0; I < size; ++I)
|
||||
if (BitLength[I + offset] != 0)
|
||||
DecodeNum[ TmpPos[ BitLength[offset + I] & 0xF ]++] = I;
|
||||
|
||||
}
|
||||
|
||||
// TODO: implement
|
||||
function Unpack15(bstream, Solid) {
|
||||
info("ERROR! RAR 1.5 compression not supported");
|
||||
}
|
||||
|
||||
function Unpack20(bstream, Solid) {
|
||||
var destUnpSize = rBuffer.data.length;
|
||||
var oldDistPtr = 0;
|
||||
|
||||
RarReadTables20(bstream);
|
||||
while (destUnpSize > rBuffer.ptr) {
|
||||
var num = RarDecodeNumber(bstream, LD);
|
||||
if (num < 256) {
|
||||
rBuffer.insertByte(num);
|
||||
continue;
|
||||
}
|
||||
if (num > 269) {
|
||||
var Length = rLDecode[num -= 270] + 3;
|
||||
if ((Bits = rLBits[num]) > 0) {
|
||||
Length += bstream.readBits(Bits);
|
||||
}
|
||||
var DistNumber = RarDecodeNumber(bstream, DD);
|
||||
var Distance = rDDecode[DistNumber] + 1;
|
||||
if ((Bits = rDBits[DistNumber]) > 0) {
|
||||
Distance += bstream.readBits(Bits);
|
||||
}
|
||||
if (Distance >= 0x2000) {
|
||||
Length++;
|
||||
if(Distance >= 0x40000) Length++;
|
||||
}
|
||||
lastLength = Length;
|
||||
lastDist = rOldDist[oldDistPtr++ & 3] = Distance;
|
||||
RarCopyString(Length, Distance);
|
||||
continue;
|
||||
}
|
||||
if (num == 269) {
|
||||
RarReadTables20(bstream);
|
||||
|
||||
RarUpdateProgress()
|
||||
|
||||
continue;
|
||||
}
|
||||
if (num == 256) {
|
||||
lastDist = rOldDist[oldDistPtr++ & 3] = lastDist;
|
||||
RarCopyString(lastLength, lastDist);
|
||||
continue;
|
||||
}
|
||||
if (num < 261) {
|
||||
var Distance = rOldDist[(oldDistPtr - (num - 256)) & 3];
|
||||
var LengthNumber = RarDecodeNumber(bstream, RD);
|
||||
var Length = rLDecode[LengthNumber] +2;
|
||||
if ((Bits = rLBits[LengthNumber]) > 0) {
|
||||
Length += bstream.readBits(Bits);
|
||||
}
|
||||
if (Distance >= 0x101) {
|
||||
Length++;
|
||||
if (Distance >= 0x2000) {
|
||||
Length++
|
||||
if (Distance >= 0x40000) Length++;
|
||||
}
|
||||
}
|
||||
lastLength = Length;
|
||||
lastDist = rOldDist[oldDistPtr++ & 3] = Distance;
|
||||
RarCopyString(Length, Distance);
|
||||
continue;
|
||||
}
|
||||
if (num < 270) {
|
||||
var Distance = rSDDecode[num -= 261] + 1;
|
||||
if ((Bits = rSDBits[num]) > 0) {
|
||||
Distance += bstream.readBits(Bits);
|
||||
}
|
||||
lastLength = 2;
|
||||
lastDist = rOldDist[oldDistPtr++ & 3] = Distance;
|
||||
RarCopyString(2, Distance);
|
||||
continue;
|
||||
}
|
||||
|
||||
}
|
||||
RarUpdateProgress()
|
||||
}
|
||||
|
||||
function RarUpdateProgress() {
|
||||
var change = rBuffer.ptr - currentBytesUnarchivedInFile;
|
||||
currentBytesUnarchivedInFile = rBuffer.ptr;
|
||||
currentBytesUnarchived += change;
|
||||
postProgress();
|
||||
}
|
||||
|
||||
|
||||
var rNC20 = 298,
|
||||
rDC20 = 48,
|
||||
rRC20 = 28,
|
||||
rBC20 = 19,
|
||||
rMC20 = 257;
|
||||
|
||||
var UnpOldTable20 = new Array(rMC20 * 4);
|
||||
|
||||
function RarReadTables20(bstream) {
|
||||
var BitLength = new Array(rBC20);
|
||||
var Table = new Array(rMC20 * 4);
|
||||
var TableSize, N, I;
|
||||
var AudioBlock = bstream.readBits(1);
|
||||
if (!bstream.readBits(1))
|
||||
for (var i = UnpOldTable20.length; i--;) UnpOldTable20[i] = 0;
|
||||
TableSize = rNC20 + rDC20 + rRC20;
|
||||
for (var I = 0; I < rBC20; I++)
|
||||
BitLength[I] = bstream.readBits(4);
|
||||
RarMakeDecodeTables(BitLength, 0, BD, rBC20);
|
||||
I = 0;
|
||||
while (I < TableSize) {
|
||||
var num = RarDecodeNumber(bstream, BD);
|
||||
if (num < 16) {
|
||||
Table[I] = num + UnpOldTable20[I] & 0xf;
|
||||
I++;
|
||||
} else if(num == 16) {
|
||||
N = bstream.readBits(2) + 3;
|
||||
while (N-- > 0 && I < TableSize) {
|
||||
Table[I] = Table[I - 1];
|
||||
I++;
|
||||
}
|
||||
} else {
|
||||
if (num == 17) {
|
||||
N = bstream.readBits(3) + 3;
|
||||
} else {
|
||||
N = bstream.readBits(7) + 11;
|
||||
}
|
||||
while (N-- > 0 && I < TableSize) {
|
||||
Table[I++] = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
RarMakeDecodeTables(Table, 0, LD, rNC20);
|
||||
RarMakeDecodeTables(Table, rNC20, DD, rDC20);
|
||||
RarMakeDecodeTables(Table, rNC20 + rDC20, RD, rRC20);
|
||||
for (var i = UnpOldTable20.length; i--;) UnpOldTable20[i] = Table[i];
|
||||
}
|
||||
|
||||
var lowDistRepCount = 0, prevLowDist = 0;
|
||||
|
||||
var rOldDist = [0,0,0,0];
|
||||
var lastDist;
|
||||
var lastLength;
|
||||
|
||||
|
||||
function Unpack29(bstream, Solid) {
|
||||
// lazy initialize rDDecode and rDBits
|
||||
|
||||
var DDecode = new Array(rDC);
|
||||
var DBits = new Array(rDC);
|
||||
|
||||
var Dist=0,BitLength=0,Slot=0;
|
||||
|
||||
for (var I = 0; I < rDBitLengthCounts.length; I++,BitLength++) {
|
||||
for (var J = 0; J < rDBitLengthCounts[I]; J++,Slot++,Dist+=(1<<BitLength)) {
|
||||
DDecode[Slot]=Dist;
|
||||
DBits[Slot]=BitLength;
|
||||
}
|
||||
}
|
||||
|
||||
var Bits;
|
||||
//tablesRead = false;
|
||||
|
||||
rOldDist = [0,0,0,0]
|
||||
|
||||
lastDist = 0;
|
||||
lastLength = 0;
|
||||
|
||||
for (var i = UnpOldTable.length; i--;) UnpOldTable[i] = 0;
|
||||
|
||||
// read in Huffman tables
|
||||
RarReadTables(bstream);
|
||||
|
||||
while (true) {
|
||||
var num = RarDecodeNumber(bstream, LD);
|
||||
|
||||
if (num < 256) {
|
||||
rBuffer.insertByte(num);
|
||||
continue;
|
||||
}
|
||||
if (num >= 271) {
|
||||
var Length = rLDecode[num -= 271] + 3;
|
||||
if ((Bits = rLBits[num]) > 0) {
|
||||
Length += bstream.readBits(Bits);
|
||||
}
|
||||
var DistNumber = RarDecodeNumber(bstream, DD);
|
||||
var Distance = DDecode[DistNumber]+1;
|
||||
if ((Bits = DBits[DistNumber]) > 0) {
|
||||
if (DistNumber > 9) {
|
||||
if (Bits > 4) {
|
||||
Distance += ((bstream.getBits() >>> (20 - Bits)) << 4);
|
||||
bstream.readBits(Bits - 4);
|
||||
//todo: check this
|
||||
}
|
||||
if (lowDistRepCount > 0) {
|
||||
lowDistRepCount--;
|
||||
Distance += prevLowDist;
|
||||
} else {
|
||||
var LowDist = RarDecodeNumber(bstream, LDD);
|
||||
if (LowDist == 16) {
|
||||
lowDistRepCount = rLOW_DIST_REP_COUNT - 1;
|
||||
Distance += prevLowDist;
|
||||
} else {
|
||||
Distance += LowDist;
|
||||
prevLowDist = LowDist;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
Distance += bstream.readBits(Bits);
|
||||
}
|
||||
}
|
||||
if (Distance >= 0x2000) {
|
||||
Length++;
|
||||
if (Distance >= 0x40000) {
|
||||
Length++;
|
||||
}
|
||||
}
|
||||
RarInsertOldDist(Distance);
|
||||
RarInsertLastMatch(Length, Distance);
|
||||
RarCopyString(Length, Distance);
|
||||
continue;
|
||||
}
|
||||
if (num == 256) {
|
||||
if (!RarReadEndOfBlock(bstream)) break;
|
||||
|
||||
continue;
|
||||
}
|
||||
if (num == 257) {
|
||||
//console.log("READVMCODE");
|
||||
if (!RarReadVMCode(bstream)) break;
|
||||
continue;
|
||||
}
|
||||
if (num == 258) {
|
||||
if (lastLength != 0) {
|
||||
RarCopyString(lastLength, lastDist);
|
||||
}
|
||||
continue;
|
||||
}
|
||||
if (num < 263) {
|
||||
var DistNum = num - 259;
|
||||
var Distance = rOldDist[DistNum];
|
||||
|
||||
for (var I = DistNum; I > 0; I--) {
|
||||
rOldDist[I] = rOldDist[I-1];
|
||||
}
|
||||
rOldDist[0] = Distance;
|
||||
|
||||
var LengthNumber = RarDecodeNumber(bstream, RD);
|
||||
var Length = rLDecode[LengthNumber] + 2;
|
||||
if ((Bits = rLBits[LengthNumber]) > 0) {
|
||||
Length += bstream.readBits(Bits);
|
||||
}
|
||||
RarInsertLastMatch(Length, Distance);
|
||||
RarCopyString(Length, Distance);
|
||||
continue;
|
||||
}
|
||||
if (num < 272) {
|
||||
var Distance = rSDDecode[num -= 263] + 1;
|
||||
if ((Bits = rSDBits[num]) > 0) {
|
||||
Distance += bstream.readBits(Bits);
|
||||
}
|
||||
RarInsertOldDist(Distance);
|
||||
RarInsertLastMatch(2, Distance);
|
||||
RarCopyString(2, Distance);
|
||||
continue;
|
||||
}
|
||||
|
||||
}
|
||||
RarUpdateProgress()
|
||||
}
|
||||
|
||||
function RarReadEndOfBlock(bstream) {
|
||||
|
||||
RarUpdateProgress()
|
||||
|
||||
|
||||
var NewTable = false, NewFile = false;
|
||||
if (bstream.readBits(1)) {
|
||||
NewTable = true;
|
||||
} else {
|
||||
NewFile = true;
|
||||
NewTable = !!bstream.readBits(1);
|
||||
}
|
||||
//tablesRead = !NewTable;
|
||||
return !(NewFile || NewTable && !RarReadTables(bstream));
|
||||
}
|
||||
|
||||
|
||||
function RarReadVMCode(bstream) {
|
||||
var FirstByte = bstream.readBits(8);
|
||||
var Length = (FirstByte & 7) + 1;
|
||||
if (Length == 7) {
|
||||
Length = bstream.readBits(8) + 7;
|
||||
} else if(Length == 8) {
|
||||
Length = bstream.readBits(16);
|
||||
}
|
||||
var vmCode = [];
|
||||
for(var I = 0; I < Length; I++) {
|
||||
//do something here with cheking readbuf
|
||||
vmCode.push(bstream.readBits(8));
|
||||
}
|
||||
return RarAddVMCode(FirstByte, vmCode, Length);
|
||||
}
|
||||
|
||||
function RarAddVMCode(firstByte, vmCode, length) {
|
||||
//console.log(vmCode);
|
||||
if (vmCode.length > 0) {
|
||||
info("Error! RarVM not supported yet!");
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
function RarInsertLastMatch(length, distance) {
|
||||
lastDist = distance;
|
||||
lastLength = length;
|
||||
}
|
||||
|
||||
function RarInsertOldDist(distance) {
|
||||
rOldDist.splice(3,1);
|
||||
rOldDist.splice(0,0,distance);
|
||||
}
|
||||
|
||||
//this is the real function, the other one is for debugging
|
||||
function RarCopyString(length, distance) {
|
||||
var destPtr = rBuffer.ptr - distance;
|
||||
if(destPtr < 0){
|
||||
var l = rOldBuffers.length;
|
||||
while(destPtr < 0){
|
||||
destPtr = rOldBuffers[--l].data.length + destPtr
|
||||
}
|
||||
//TODO: lets hope that it never needs to read beyond file boundaries
|
||||
while(length--) rBuffer.insertByte(rOldBuffers[l].data[destPtr++]);
|
||||
|
||||
}
|
||||
if (length > distance) {
|
||||
while(length--) rBuffer.insertByte(rBuffer.data[destPtr++]);
|
||||
} else {
|
||||
rBuffer.insertBytes(rBuffer.data.subarray(destPtr, destPtr + length));
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
var rOldBuffers = []
|
||||
// v must be a valid RarVolume
|
||||
function unpack(v) {
|
||||
|
||||
// TODO: implement what happens when unpVer is < 15
|
||||
var Ver = v.header.unpVer <= 15 ? 15 : v.header.unpVer,
|
||||
Solid = v.header.LHD_SOLID,
|
||||
bstream = new bitjs.io.BitStream(v.fileData.buffer, true /* rtl */, v.fileData.byteOffset, v.fileData.byteLength );
|
||||
|
||||
rBuffer = new bitjs.io.ByteBuffer(v.header.unpackedSize);
|
||||
|
||||
info("Unpacking "+v.filename+" RAR v"+Ver);
|
||||
|
||||
switch(Ver) {
|
||||
case 15: // rar 1.5 compression
|
||||
Unpack15(bstream, Solid);
|
||||
break;
|
||||
case 20: // rar 2.x compression
|
||||
case 26: // files larger than 2GB
|
||||
Unpack20(bstream, Solid);
|
||||
break;
|
||||
case 29: // rar 3.x compression
|
||||
case 36: // alternative hash
|
||||
Unpack29(bstream, Solid);
|
||||
break;
|
||||
} // switch(method)
|
||||
|
||||
rOldBuffers.push(rBuffer);
|
||||
//TODO: clear these old buffers when there's over 4MB of history
|
||||
return rBuffer.data;
|
||||
}
|
||||
|
||||
// bstream is a bit stream
|
||||
var RarLocalFile = function(bstream) {
|
||||
|
||||
this.header = new RarVolumeHeader(bstream);
|
||||
this.filename = this.header.filename;
|
||||
|
||||
if (this.header.headType != FILE_HEAD && this.header.headType != ENDARC_HEAD) {
|
||||
this.isValid = false;
|
||||
info("Error! RAR Volume did not include a FILE_HEAD header ");
|
||||
}
|
||||
else {
|
||||
// read in the compressed data
|
||||
this.fileData = null;
|
||||
if (this.header.packSize > 0) {
|
||||
this.fileData = bstream.readBytes(this.header.packSize);
|
||||
this.isValid = true;
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
RarLocalFile.prototype.unrar = function() {
|
||||
|
||||
if (!this.header.flags.LHD_SPLIT_BEFORE) {
|
||||
// unstore file
|
||||
if (this.header.method == 0x30) {
|
||||
info("Unstore "+this.filename);
|
||||
this.isValid = true;
|
||||
|
||||
currentBytesUnarchivedInFile += this.fileData.length;
|
||||
currentBytesUnarchived += this.fileData.length;
|
||||
} else {
|
||||
this.isValid = true;
|
||||
this.fileData = unpack(this);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
var unrar = function(arrayBuffer) {
|
||||
currentFilename = "";
|
||||
currentFileNumber = 0;
|
||||
currentBytesUnarchivedInFile = 0;
|
||||
currentBytesUnarchived = 0;
|
||||
totalUncompressedBytesInArchive = 0;
|
||||
totalFilesInArchive = 0;
|
||||
|
||||
postMessage(new bitjs.archive.UnarchiveStartEvent());
|
||||
var bstream = new bitjs.io.BitStream(arrayBuffer, false /* rtl */);
|
||||
|
||||
var header = new RarVolumeHeader(bstream);
|
||||
if (header.crc == 0x6152 &&
|
||||
header.headType == 0x72 &&
|
||||
header.flags.value == 0x1A21 &&
|
||||
header.headSize == 7) {
|
||||
info("Found RAR signature");
|
||||
|
||||
var mhead = new RarVolumeHeader(bstream);
|
||||
if (mhead.headType != MAIN_HEAD) {
|
||||
info("Error! RAR did not include a MAIN_HEAD header");
|
||||
}
|
||||
else {
|
||||
var localFiles = [],
|
||||
localFile = null;
|
||||
do {
|
||||
try {
|
||||
localFile = new RarLocalFile(bstream);
|
||||
info("RAR localFile isValid=" + localFile.isValid + ", volume packSize=" + localFile.header.packSize);
|
||||
if (localFile && localFile.isValid && localFile.header.packSize > 0) {
|
||||
totalUncompressedBytesInArchive += localFile.header.unpackedSize;
|
||||
localFiles.push(localFile);
|
||||
} else if (localFile.header.packSize == 0 && localFile.header.unpackedSize == 0) {
|
||||
localFile.isValid = true;
|
||||
}
|
||||
} catch(err) {
|
||||
break;
|
||||
}
|
||||
//info("bstream" + bstream.bytePtr+"/"+bstream.bytes.length);
|
||||
} while( localFile.isValid );
|
||||
totalFilesInArchive = localFiles.length;
|
||||
|
||||
// now we have all information but things are unpacked
|
||||
// TODO: unpack
|
||||
localFiles = localFiles.sort(function(a,b) {
|
||||
// extract the number at the end of both filenames
|
||||
var aname = a.filename;
|
||||
var bname = b.filename;
|
||||
return aname > bname ? 1 : -1;
|
||||
/*
|
||||
var aindex = aname.length, bindex = bname.length;
|
||||
|
||||
// Find the last number character from the back of the filename.
|
||||
while (aname[aindex-1] < '0' || aname[aindex-1] > '9') --aindex;
|
||||
while (bname[bindex-1] < '0' || bname[bindex-1] > '9') --bindex;
|
||||
|
||||
// Find the first number character from the back of the filename
|
||||
while (aname[aindex-1] >= '0' && aname[aindex-1] <= '9') --aindex;
|
||||
while (bname[bindex-1] >= '0' && bname[bindex-1] <= '9') --bindex;
|
||||
|
||||
// parse them into numbers and return comparison
|
||||
var anum = parseInt(aname.substr(aindex), 10),
|
||||
bnum = parseInt(bname.substr(bindex), 10);
|
||||
return bnum - anum;*/
|
||||
});
|
||||
|
||||
info(localFiles.map(function(a){return a.filename}).join(', '));
|
||||
for (var i = 0; i < localFiles.length; ++i) {
|
||||
var localfile = localFiles[i];
|
||||
|
||||
// update progress
|
||||
currentFilename = localfile.header.filename;
|
||||
currentBytesUnarchivedInFile = 0;
|
||||
|
||||
// actually do the unzipping
|
||||
localfile.unrar();
|
||||
|
||||
if (localfile.isValid) {
|
||||
postMessage(new bitjs.archive.UnarchiveExtractEvent(localfile));
|
||||
postProgress();
|
||||
}
|
||||
}
|
||||
|
||||
postProgress();
|
||||
}
|
||||
}
|
||||
else {
|
||||
err("Invalid RAR file");
|
||||
}
|
||||
postMessage(new bitjs.archive.UnarchiveFinishEvent());
|
||||
};
|
||||
|
||||
// event.data.file has the ArrayBuffer.
|
||||
onmessage = function(event) {
|
||||
var ab = event.data.file;
|
||||
unrar(ab, true);
|
||||
};
|
||||
|
|
@ -1,182 +0,0 @@
|
|||
/**
|
||||
* untar.js
|
||||
*
|
||||
* Copyright(c) 2011 Google Inc.
|
||||
*
|
||||
* Reference Documentation:
|
||||
*
|
||||
* TAR format: http://www.gnu.org/software/automake/manual/tar/Standard.html
|
||||
*/
|
||||
|
||||
// This file expects to be invoked as a Worker (see onmessage below).
|
||||
importScripts('io.js');
|
||||
importScripts('archive.js');
|
||||
|
||||
// Progress variables.
|
||||
var currentFilename = "";
|
||||
var currentFileNumber = 0;
|
||||
var currentBytesUnarchivedInFile = 0;
|
||||
var currentBytesUnarchived = 0;
|
||||
var totalUncompressedBytesInArchive = 0;
|
||||
var totalFilesInArchive = 0;
|
||||
|
||||
// Helper functions.
|
||||
var info = function(str) {
|
||||
postMessage(new bitjs.archive.UnarchiveInfoEvent(str));
|
||||
};
|
||||
var err = function(str) {
|
||||
postMessage(new bitjs.archive.UnarchiveErrorEvent(str));
|
||||
};
|
||||
var postProgress = function() {
|
||||
postMessage(new bitjs.archive.UnarchiveProgressEvent(
|
||||
currentFilename,
|
||||
currentFileNumber,
|
||||
currentBytesUnarchivedInFile,
|
||||
currentBytesUnarchived,
|
||||
totalUncompressedBytesInArchive,
|
||||
totalFilesInArchive));
|
||||
};
|
||||
|
||||
// Removes all characters from the first zero-byte in the string onwards.
|
||||
var readCleanString = function(bstr, numBytes) {
|
||||
var str = bstr.readString(numBytes);
|
||||
var zIndex = str.indexOf(String.fromCharCode(0));
|
||||
return zIndex != -1 ? str.substr(0, zIndex) : str;
|
||||
};
|
||||
|
||||
// takes a ByteStream and parses out the local file information
|
||||
var TarLocalFile = function(bstream) {
|
||||
this.isValid = false;
|
||||
|
||||
// Read in the header block
|
||||
this.name = readCleanString(bstream, 100);
|
||||
this.mode = readCleanString(bstream, 8);
|
||||
this.uid = readCleanString(bstream, 8);
|
||||
this.gid = readCleanString(bstream, 8);
|
||||
this.size = parseInt(readCleanString(bstream, 12), 8);
|
||||
this.mtime = readCleanString(bstream, 12);
|
||||
this.chksum = readCleanString(bstream, 8);
|
||||
this.typeflag = readCleanString(bstream, 1);
|
||||
this.linkname = readCleanString(bstream, 100);
|
||||
this.maybeMagic = readCleanString(bstream, 6);
|
||||
|
||||
if (this.maybeMagic == "ustar") {
|
||||
this.version = readCleanString(bstream, 2);
|
||||
this.uname = readCleanString(bstream, 32);
|
||||
this.gname = readCleanString(bstream, 32);
|
||||
this.devmajor = readCleanString(bstream, 8);
|
||||
this.devminor = readCleanString(bstream, 8);
|
||||
this.prefix = readCleanString(bstream, 155);
|
||||
|
||||
if (this.prefix.length) {
|
||||
this.name = this.prefix + this.name;
|
||||
}
|
||||
bstream.readBytes(12); // 512 - 500
|
||||
} else {
|
||||
bstream.readBytes(255); // 512 - 257
|
||||
}
|
||||
|
||||
// Done header, now rest of blocks are the file contents.
|
||||
this.filename = this.name;
|
||||
this.fileData = null;
|
||||
|
||||
info("Untarring file '" + this.filename + "'");
|
||||
info(" size = " + this.size);
|
||||
info(" typeflag = " + this.typeflag);
|
||||
|
||||
// A regular file.
|
||||
if (this.typeflag == 0) {
|
||||
info(" This is a regular file.");
|
||||
var sizeInBytes = parseInt(this.size);
|
||||
this.fileData = new Uint8Array(bstream.bytes.buffer, bstream.ptr, this.size);
|
||||
if (this.name.length > 0 && this.size > 0 && this.fileData && this.fileData.buffer) {
|
||||
this.isValid = true;
|
||||
}
|
||||
|
||||
bstream.readBytes(this.size);
|
||||
|
||||
// Round up to 512-byte blocks.
|
||||
var remaining = 512 - this.size % 512;
|
||||
if (remaining > 0 && remaining < 512) {
|
||||
bstream.readBytes(remaining);
|
||||
}
|
||||
} else if (this.typeflag == 5) {
|
||||
info(" This is a directory.")
|
||||
}
|
||||
};
|
||||
|
||||
// Takes an ArrayBuffer of a tar file in
|
||||
// returns null on error
|
||||
// returns an array of DecompressedFile objects on success
|
||||
var untar = function(arrayBuffer) {
|
||||
currentFilename = "";
|
||||
currentFileNumber = 0;
|
||||
currentBytesUnarchivedInFile = 0;
|
||||
currentBytesUnarchived = 0;
|
||||
totalUncompressedBytesInArchive = 0;
|
||||
totalFilesInArchive = 0;
|
||||
|
||||
postMessage(new bitjs.archive.UnarchiveStartEvent());
|
||||
var bstream = new bitjs.io.ByteStream(arrayBuffer);
|
||||
var localFiles = [];
|
||||
|
||||
// While we don't encounter an empty block, keep making TarLocalFiles.
|
||||
while (bstream.peekNumber(4) != 0) {
|
||||
var oneLocalFile = new TarLocalFile(bstream);
|
||||
if (oneLocalFile && oneLocalFile.isValid) {
|
||||
localFiles.push(oneLocalFile);
|
||||
totalUncompressedBytesInArchive += oneLocalFile.size;
|
||||
}
|
||||
}
|
||||
totalFilesInArchive = localFiles.length;
|
||||
|
||||
// got all local files, now sort them
|
||||
localFiles.sort(function(a,b) {
|
||||
// extract the number at the end of both filenames
|
||||
var aname = a.filename;
|
||||
var bname = b.filename;
|
||||
var aindex = aname.length, bindex = bname.length;
|
||||
|
||||
// Find the last number character from the back of the filename.
|
||||
while (aname[aindex-1] < '0' || aname[aindex-1] > '9') --aindex;
|
||||
while (bname[bindex-1] < '0' || bname[bindex-1] > '9') --bindex;
|
||||
|
||||
// Find the first number character from the back of the filename
|
||||
while (aname[aindex-1] >= '0' && aname[aindex-1] <= '9') --aindex;
|
||||
while (bname[bindex-1] >= '0' && bname[bindex-1] <= '9') --bindex;
|
||||
|
||||
// parse them into numbers and return comparison
|
||||
var anum = parseInt(aname.substr(aindex), 10),
|
||||
bnum = parseInt(bname.substr(bindex), 10);
|
||||
return anum - bnum;
|
||||
});
|
||||
|
||||
// report # files and total length
|
||||
if (localFiles.length > 0) {
|
||||
postProgress();
|
||||
}
|
||||
|
||||
// now do the shipping of each file
|
||||
for (var i = 0; i < localFiles.length; ++i) {
|
||||
var localfile = localFiles[i];
|
||||
info("Sending file '" + localfile.filename + "' up");
|
||||
|
||||
// update progress
|
||||
currentFilename = localfile.filename;
|
||||
currentFileNumber = i;
|
||||
currentBytesUnarchivedInFile = localfile.size;
|
||||
currentBytesUnarchived += localfile.size;
|
||||
postMessage(new bitjs.archive.UnarchiveExtractEvent(localfile));
|
||||
postProgress();
|
||||
}
|
||||
|
||||
postProgress();
|
||||
|
||||
postMessage(new bitjs.archive.UnarchiveFinishEvent());
|
||||
};
|
||||
|
||||
// event.data.file has the ArrayBuffer.
|
||||
onmessage = function(event) {
|
||||
var ab = event.data.file;
|
||||
untar(ab);
|
||||
};
|
||||
|
|
@ -1,631 +0,0 @@
|
|||
/**
|
||||
* unzip.js
|
||||
*
|
||||
* Copyright(c) 2011 Google Inc.
|
||||
* Copyright(c) 2011 antimatter15
|
||||
*
|
||||
* Reference Documentation:
|
||||
*
|
||||
* ZIP format: http://www.pkware.com/documents/casestudies/APPNOTE.TXT
|
||||
* DEFLATE format: http://tools.ietf.org/html/rfc1951
|
||||
*/
|
||||
|
||||
// This file expects to be invoked as a Worker (see onmessage below).
|
||||
importScripts('io.js');
|
||||
importScripts('archive.js');
|
||||
|
||||
// Progress variables.
|
||||
var currentFilename = "";
|
||||
var currentFileNumber = 0;
|
||||
var currentBytesUnarchivedInFile = 0;
|
||||
var currentBytesUnarchived = 0;
|
||||
var totalUncompressedBytesInArchive = 0;
|
||||
var totalFilesInArchive = 0;
|
||||
|
||||
// Helper functions.
|
||||
var info = function(str) {
|
||||
postMessage(new bitjs.archive.UnarchiveInfoEvent(str));
|
||||
};
|
||||
var err = function(str) {
|
||||
postMessage(new bitjs.archive.UnarchiveErrorEvent(str));
|
||||
};
|
||||
var postProgress = function() {
|
||||
postMessage(new bitjs.archive.UnarchiveProgressEvent(
|
||||
currentFilename,
|
||||
currentFileNumber,
|
||||
currentBytesUnarchivedInFile,
|
||||
currentBytesUnarchived,
|
||||
totalUncompressedBytesInArchive,
|
||||
totalFilesInArchive));
|
||||
};
|
||||
|
||||
var zLocalFileHeaderSignature = 0x04034b50;
|
||||
var zArchiveExtraDataSignature = 0x08064b50;
|
||||
var zCentralFileHeaderSignature = 0x02014b50;
|
||||
var zDigitalSignatureSignature = 0x05054b50;
|
||||
var zEndOfCentralDirSignature = 0x06064b50;
|
||||
var zEndOfCentralDirLocatorSignature = 0x07064b50;
|
||||
|
||||
// takes a ByteStream and parses out the local file information
|
||||
var ZipLocalFile = function(bstream) {
|
||||
if (typeof bstream != typeof {} || !bstream.readNumber || typeof bstream.readNumber != typeof function(){}) {
|
||||
return null;
|
||||
}
|
||||
|
||||
bstream.readNumber(4); // swallow signature
|
||||
this.version = bstream.readNumber(2);
|
||||
this.generalPurpose = bstream.readNumber(2);
|
||||
this.compressionMethod = bstream.readNumber(2);
|
||||
this.lastModFileTime = bstream.readNumber(2);
|
||||
this.lastModFileDate = bstream.readNumber(2);
|
||||
this.crc32 = bstream.readNumber(4);
|
||||
this.compressedSize = bstream.readNumber(4);
|
||||
this.uncompressedSize = bstream.readNumber(4);
|
||||
this.fileNameLength = bstream.readNumber(2);
|
||||
this.extraFieldLength = bstream.readNumber(2);
|
||||
|
||||
this.filename = null;
|
||||
if (this.fileNameLength > 0) {
|
||||
this.filename = bstream.readString(this.fileNameLength);
|
||||
}
|
||||
|
||||
info("Zip Local File Header:");
|
||||
info(" version=" + this.version);
|
||||
info(" general purpose=" + this.generalPurpose);
|
||||
info(" compression method=" + this.compressionMethod);
|
||||
info(" last mod file time=" + this.lastModFileTime);
|
||||
info(" last mod file date=" + this.lastModFileDate);
|
||||
info(" crc32=" + this.crc32);
|
||||
info(" compressed size=" + this.compressedSize);
|
||||
info(" uncompressed size=" + this.uncompressedSize);
|
||||
info(" file name length=" + this.fileNameLength);
|
||||
info(" extra field length=" + this.extraFieldLength);
|
||||
info(" filename = '" + this.filename + "'");
|
||||
|
||||
this.extraField = null;
|
||||
if (this.extraFieldLength > 0) {
|
||||
this.extraField = bstream.readString(this.extraFieldLength);
|
||||
info(" extra field=" + this.extraField);
|
||||
}
|
||||
|
||||
// read in the compressed data
|
||||
this.fileData = null;
|
||||
if (this.compressedSize > 0) {
|
||||
this.fileData = new Uint8Array(bstream.bytes.buffer, bstream.ptr, this.compressedSize);
|
||||
bstream.ptr += this.compressedSize;
|
||||
}
|
||||
|
||||
// TODO: deal with data descriptor if present (we currently assume no data descriptor!)
|
||||
// "This descriptor exists only if bit 3 of the general purpose bit flag is set"
|
||||
// But how do you figure out how big the file data is if you don't know the compressedSize
|
||||
// from the header?!?
|
||||
if ((this.generalPurpose & bitjs.BIT[3]) != 0) {
|
||||
this.crc32 = bstream.readNumber(4);
|
||||
this.compressedSize = bstream.readNumber(4);
|
||||
this.uncompressedSize = bstream.readNumber(4);
|
||||
}
|
||||
};
|
||||
|
||||
// determine what kind of compressed data we have and decompress
|
||||
ZipLocalFile.prototype.unzip = function() {
|
||||
|
||||
// Zip Version 1.0, no compression (store only)
|
||||
if (this.compressionMethod == 0 ) {
|
||||
info("ZIP v"+this.version+", store only: " + this.filename + " (" + this.compressedSize + " bytes)");
|
||||
currentBytesUnarchivedInFile = this.compressedSize;
|
||||
currentBytesUnarchived += this.compressedSize;
|
||||
}
|
||||
// version == 20, compression method == 8 (DEFLATE)
|
||||
else if (this.compressionMethod == 8) {
|
||||
info("ZIP v2.0, DEFLATE: " + this.filename + " (" + this.compressedSize + " bytes)");
|
||||
this.fileData = inflate(this.fileData, this.uncompressedSize);
|
||||
}
|
||||
else {
|
||||
err("UNSUPPORTED VERSION/FORMAT: ZIP v" + this.version + ", compression method=" + this.compressionMethod + ": " + this.filename + " (" + this.compressedSize + " bytes)");
|
||||
this.fileData = null;
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
// Takes an ArrayBuffer of a zip file in
|
||||
// returns null on error
|
||||
// returns an array of DecompressedFile objects on success
|
||||
var unzip = function(arrayBuffer) {
|
||||
postMessage(new bitjs.archive.UnarchiveStartEvent());
|
||||
|
||||
currentFilename = "";
|
||||
currentFileNumber = 0;
|
||||
currentBytesUnarchivedInFile = 0;
|
||||
currentBytesUnarchived = 0;
|
||||
totalUncompressedBytesInArchive = 0;
|
||||
totalFilesInArchive = 0;
|
||||
currentBytesUnarchived = 0;
|
||||
|
||||
var bstream = new bitjs.io.ByteStream(arrayBuffer);
|
||||
// detect local file header signature or return null
|
||||
if (bstream.peekNumber(4) == zLocalFileHeaderSignature) {
|
||||
var localFiles = [];
|
||||
// loop until we don't see any more local files
|
||||
while (bstream.peekNumber(4) == zLocalFileHeaderSignature) {
|
||||
var oneLocalFile = new ZipLocalFile(bstream);
|
||||
// this should strip out directories/folders
|
||||
if (oneLocalFile && oneLocalFile.uncompressedSize > 0 && oneLocalFile.fileData) {
|
||||
localFiles.push(oneLocalFile);
|
||||
totalUncompressedBytesInArchive += oneLocalFile.uncompressedSize;
|
||||
}
|
||||
}
|
||||
totalFilesInArchive = localFiles.length;
|
||||
|
||||
// got all local files, now sort them
|
||||
localFiles.sort(function(a,b) {
|
||||
// extract the number at the end of both filenames
|
||||
var aname = a.filename;
|
||||
var bname = b.filename;
|
||||
var aindex = aname.length, bindex = bname.length;
|
||||
|
||||
// Find the last number character from the back of the filename.
|
||||
while (aname[aindex-1] < '0' || aname[aindex-1] > '9') --aindex;
|
||||
while (bname[bindex-1] < '0' || bname[bindex-1] > '9') --bindex;
|
||||
|
||||
// Find the first number character from the back of the filename
|
||||
while (aname[aindex-1] >= '0' && aname[aindex-1] <= '9') --aindex;
|
||||
while (bname[bindex-1] >= '0' && bname[bindex-1] <= '9') --bindex;
|
||||
|
||||
// parse them into numbers and return comparison
|
||||
var anum = parseInt(aname.substr(aindex), 10),
|
||||
bnum = parseInt(bname.substr(bindex), 10);
|
||||
return anum - bnum;
|
||||
});
|
||||
|
||||
// archive extra data record
|
||||
if (bstream.peekNumber(4) == zArchiveExtraDataSignature) {
|
||||
info(" Found an Archive Extra Data Signature");
|
||||
|
||||
// skipping this record for now
|
||||
bstream.readNumber(4);
|
||||
var archiveExtraFieldLength = bstream.readNumber(4);
|
||||
bstream.readString(archiveExtraFieldLength);
|
||||
}
|
||||
|
||||
// central directory structure
|
||||
// TODO: handle the rest of the structures (Zip64 stuff)
|
||||
if (bstream.peekNumber(4) == zCentralFileHeaderSignature) {
|
||||
info(" Found a Central File Header");
|
||||
|
||||
// read all file headers
|
||||
while (bstream.peekNumber(4) == zCentralFileHeaderSignature) {
|
||||
bstream.readNumber(4); // signature
|
||||
bstream.readNumber(2); // version made by
|
||||
bstream.readNumber(2); // version needed to extract
|
||||
bstream.readNumber(2); // general purpose bit flag
|
||||
bstream.readNumber(2); // compression method
|
||||
bstream.readNumber(2); // last mod file time
|
||||
bstream.readNumber(2); // last mod file date
|
||||
bstream.readNumber(4); // crc32
|
||||
bstream.readNumber(4); // compressed size
|
||||
bstream.readNumber(4); // uncompressed size
|
||||
var fileNameLength = bstream.readNumber(2); // file name length
|
||||
var extraFieldLength = bstream.readNumber(2); // extra field length
|
||||
var fileCommentLength = bstream.readNumber(2); // file comment length
|
||||
bstream.readNumber(2); // disk number start
|
||||
bstream.readNumber(2); // internal file attributes
|
||||
bstream.readNumber(4); // external file attributes
|
||||
bstream.readNumber(4); // relative offset of local header
|
||||
|
||||
bstream.readString(fileNameLength); // file name
|
||||
bstream.readString(extraFieldLength); // extra field
|
||||
bstream.readString(fileCommentLength); // file comment
|
||||
}
|
||||
}
|
||||
|
||||
// digital signature
|
||||
if (bstream.peekNumber(4) == zDigitalSignatureSignature) {
|
||||
info(" Found a Digital Signature");
|
||||
|
||||
bstream.readNumber(4);
|
||||
var sizeOfSignature = bstream.readNumber(2);
|
||||
bstream.readString(sizeOfSignature); // digital signature data
|
||||
}
|
||||
|
||||
// report # files and total length
|
||||
if (localFiles.length > 0) {
|
||||
postProgress();
|
||||
}
|
||||
|
||||
// now do the unzipping of each file
|
||||
for (var i = 0; i < localFiles.length; ++i) {
|
||||
var localfile = localFiles[i];
|
||||
|
||||
// update progress
|
||||
currentFilename = localfile.filename;
|
||||
currentFileNumber = i;
|
||||
currentBytesUnarchivedInFile = 0;
|
||||
|
||||
// actually do the unzipping
|
||||
localfile.unzip();
|
||||
|
||||
if (localfile.fileData != null) {
|
||||
postMessage(new bitjs.archive.UnarchiveExtractEvent(localfile));
|
||||
postProgress();
|
||||
}
|
||||
}
|
||||
postProgress();
|
||||
postMessage(new bitjs.archive.UnarchiveFinishEvent());
|
||||
}
|
||||
}
|
||||
|
||||
// returns a table of Huffman codes
|
||||
// each entry's index is its code and its value is a JavaScript object
|
||||
// containing {length: 6, symbol: X}
|
||||
function getHuffmanCodes(bitLengths) {
|
||||
// ensure bitLengths is an array containing at least one element
|
||||
if (typeof bitLengths != typeof [] || bitLengths.length < 1) {
|
||||
err("Error! getHuffmanCodes() called with an invalid array");
|
||||
return null;
|
||||
}
|
||||
|
||||
// Reference: http://tools.ietf.org/html/rfc1951#page-8
|
||||
var numLengths = bitLengths.length,
|
||||
bl_count = [],
|
||||
MAX_BITS = 1;
|
||||
|
||||
// Step 1: count up how many codes of each length we have
|
||||
for (var i = 0; i < numLengths; ++i) {
|
||||
var length = bitLengths[i];
|
||||
// test to ensure each bit length is a positive, non-zero number
|
||||
if (typeof length != typeof 1 || length < 0) {
|
||||
err("bitLengths contained an invalid number in getHuffmanCodes(): " + length + " of type " + (typeof length));
|
||||
return null;
|
||||
}
|
||||
// increment the appropriate bitlength count
|
||||
if (bl_count[length] == undefined) bl_count[length] = 0;
|
||||
// a length of zero means this symbol is not participating in the huffman coding
|
||||
if (length > 0) bl_count[length]++;
|
||||
|
||||
if (length > MAX_BITS) MAX_BITS = length;
|
||||
}
|
||||
|
||||
// Step 2: Find the numerical value of the smallest code for each code length
|
||||
var next_code = [],
|
||||
code = 0;
|
||||
for (var bits = 1; bits <= MAX_BITS; ++bits) {
|
||||
var length = bits-1;
|
||||
// ensure undefined lengths are zero
|
||||
if (bl_count[length] == undefined) bl_count[length] = 0;
|
||||
code = (code + bl_count[bits-1]) << 1;
|
||||
next_code[bits] = code;
|
||||
}
|
||||
|
||||
// Step 3: Assign numerical values to all codes
|
||||
var table = {}, tableLength = 0;
|
||||
for (var n = 0; n < numLengths; ++n) {
|
||||
var len = bitLengths[n];
|
||||
if (len != 0) {
|
||||
table[next_code[len]] = { length: len, symbol: n }; //, bitstring: binaryValueToString(next_code[len],len) };
|
||||
tableLength++;
|
||||
next_code[len]++;
|
||||
}
|
||||
}
|
||||
table.maxLength = tableLength;
|
||||
|
||||
return table;
|
||||
}
|
||||
|
||||
/*
|
||||
The Huffman codes for the two alphabets are fixed, and are not
|
||||
represented explicitly in the data. The Huffman code lengths
|
||||
for the literal/length alphabet are:
|
||||
|
||||
Lit Value Bits Codes
|
||||
--------- ---- -----
|
||||
0 - 143 8 00110000 through
|
||||
10111111
|
||||
144 - 255 9 110010000 through
|
||||
111111111
|
||||
256 - 279 7 0000000 through
|
||||
0010111
|
||||
280 - 287 8 11000000 through
|
||||
11000111
|
||||
*/
|
||||
// fixed Huffman codes go from 7-9 bits, so we need an array whose index can hold up to 9 bits
|
||||
var fixedHCtoLiteral = null;
|
||||
var fixedHCtoDistance = null;
|
||||
function getFixedLiteralTable() {
|
||||
// create once
|
||||
if (!fixedHCtoLiteral) {
|
||||
var bitlengths = new Array(288);
|
||||
for (var i = 0; i <= 143; ++i) bitlengths[i] = 8;
|
||||
for (i = 144; i <= 255; ++i) bitlengths[i] = 9;
|
||||
for (i = 256; i <= 279; ++i) bitlengths[i] = 7;
|
||||
for (i = 280; i <= 287; ++i) bitlengths[i] = 8;
|
||||
|
||||
// get huffman code table
|
||||
fixedHCtoLiteral = getHuffmanCodes(bitlengths);
|
||||
}
|
||||
return fixedHCtoLiteral;
|
||||
}
|
||||
function getFixedDistanceTable() {
|
||||
// create once
|
||||
if (!fixedHCtoDistance) {
|
||||
var bitlengths = new Array(32);
|
||||
for (var i = 0; i < 32; ++i) { bitlengths[i] = 5; }
|
||||
|
||||
// get huffman code table
|
||||
fixedHCtoDistance = getHuffmanCodes(bitlengths);
|
||||
}
|
||||
return fixedHCtoDistance;
|
||||
}
|
||||
|
||||
// extract one bit at a time until we find a matching Huffman Code
|
||||
// then return that symbol
|
||||
function decodeSymbol(bstream, hcTable) {
|
||||
var code = 0, len = 0;
|
||||
var match = false;
|
||||
|
||||
// loop until we match
|
||||
for (;;) {
|
||||
// read in next bit
|
||||
var bit = bstream.readBits(1);
|
||||
code = (code<<1) | bit;
|
||||
++len;
|
||||
|
||||
// check against Huffman Code table and break if found
|
||||
if (hcTable.hasOwnProperty(code) && hcTable[code].length == len) {
|
||||
|
||||
break;
|
||||
}
|
||||
if (len > hcTable.maxLength) {
|
||||
err("Bit stream out of sync, didn't find a Huffman Code, length was " + len +
|
||||
" and table only max code length of " + hcTable.maxLength);
|
||||
break;
|
||||
}
|
||||
}
|
||||
return hcTable[code].symbol;
|
||||
}
|
||||
|
||||
|
||||
var CodeLengthCodeOrder = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
|
||||
/*
|
||||
Extra Extra Extra
|
||||
Code Bits Length(s) Code Bits Lengths Code Bits Length(s)
|
||||
---- ---- ------ ---- ---- ------- ---- ---- -------
|
||||
257 0 3 267 1 15,16 277 4 67-82
|
||||
258 0 4 268 1 17,18 278 4 83-98
|
||||
259 0 5 269 2 19-22 279 4 99-114
|
||||
260 0 6 270 2 23-26 280 4 115-130
|
||||
261 0 7 271 2 27-30 281 5 131-162
|
||||
262 0 8 272 2 31-34 282 5 163-194
|
||||
263 0 9 273 3 35-42 283 5 195-226
|
||||
264 0 10 274 3 43-50 284 5 227-257
|
||||
265 1 11,12 275 3 51-58 285 0 258
|
||||
266 1 13,14 276 3 59-66
|
||||
|
||||
*/
|
||||
var LengthLookupTable = [
|
||||
[0,3], [0,4], [0,5], [0,6],
|
||||
[0,7], [0,8], [0,9], [0,10],
|
||||
[1,11], [1,13], [1,15], [1,17],
|
||||
[2,19], [2,23], [2,27], [2,31],
|
||||
[3,35], [3,43], [3,51], [3,59],
|
||||
[4,67], [4,83], [4,99], [4,115],
|
||||
[5,131], [5,163], [5,195], [5,227],
|
||||
[0,258]
|
||||
];
|
||||
/*
|
||||
Extra Extra Extra
|
||||
Code Bits Dist Code Bits Dist Code Bits Distance
|
||||
---- ---- ---- ---- ---- ------ ---- ---- --------
|
||||
0 0 1 10 4 33-48 20 9 1025-1536
|
||||
1 0 2 11 4 49-64 21 9 1537-2048
|
||||
2 0 3 12 5 65-96 22 10 2049-3072
|
||||
3 0 4 13 5 97-128 23 10 3073-4096
|
||||
4 1 5,6 14 6 129-192 24 11 4097-6144
|
||||
5 1 7,8 15 6 193-256 25 11 6145-8192
|
||||
6 2 9-12 16 7 257-384 26 12 8193-12288
|
||||
7 2 13-16 17 7 385-512 27 12 12289-16384
|
||||
8 3 17-24 18 8 513-768 28 13 16385-24576
|
||||
9 3 25-32 19 8 769-1024 29 13 24577-32768
|
||||
*/
|
||||
var DistLookupTable = [
|
||||
[0,1], [0,2], [0,3], [0,4],
|
||||
[1,5], [1,7],
|
||||
[2,9], [2,13],
|
||||
[3,17], [3,25],
|
||||
[4,33], [4,49],
|
||||
[5,65], [5,97],
|
||||
[6,129], [6,193],
|
||||
[7,257], [7,385],
|
||||
[8,513], [8,769],
|
||||
[9,1025], [9,1537],
|
||||
[10,2049], [10,3073],
|
||||
[11,4097], [11,6145],
|
||||
[12,8193], [12,12289],
|
||||
[13,16385], [13,24577]
|
||||
];
|
||||
|
||||
function inflateBlockData(bstream, hcLiteralTable, hcDistanceTable, buffer) {
|
||||
/*
|
||||
loop (until end of block code recognized)
|
||||
decode literal/length value from input stream
|
||||
if value < 256
|
||||
copy value (literal byte) to output stream
|
||||
otherwise
|
||||
if value = end of block (256)
|
||||
break from loop
|
||||
otherwise (value = 257..285)
|
||||
decode distance from input stream
|
||||
|
||||
move backwards distance bytes in the output
|
||||
stream, and copy length bytes from this
|
||||
position to the output stream.
|
||||
*/
|
||||
var numSymbols = 0, blockSize = 0;
|
||||
for (;;) {
|
||||
var symbol = decodeSymbol(bstream, hcLiteralTable);
|
||||
++numSymbols;
|
||||
if (symbol < 256) {
|
||||
// copy literal byte to output
|
||||
buffer.insertByte(symbol);
|
||||
blockSize++;
|
||||
}
|
||||
else {
|
||||
// end of block reached
|
||||
if (symbol == 256) {
|
||||
break;
|
||||
}
|
||||
else {
|
||||
var lengthLookup = LengthLookupTable[symbol-257],
|
||||
length = lengthLookup[1] + bstream.readBits(lengthLookup[0]),
|
||||
distLookup = DistLookupTable[decodeSymbol(bstream, hcDistanceTable)],
|
||||
distance = distLookup[1] + bstream.readBits(distLookup[0]);
|
||||
|
||||
// now apply length and distance appropriately and copy to output
|
||||
|
||||
// TODO: check that backward distance < data.length?
|
||||
|
||||
// http://tools.ietf.org/html/rfc1951#page-11
|
||||
// "Note also that the referenced string may overlap the current
|
||||
// position; for example, if the last 2 bytes decoded have values
|
||||
// X and Y, a string reference with <length = 5, distance = 2>
|
||||
// adds X,Y,X,Y,X to the output stream."
|
||||
//
|
||||
// loop for each character
|
||||
var ch = buffer.ptr - distance;
|
||||
blockSize += length;
|
||||
if(length > distance) {
|
||||
var data = buffer.data;
|
||||
while (length--) {
|
||||
buffer.insertByte(data[ch++]);
|
||||
}
|
||||
} else {
|
||||
buffer.insertBytes(buffer.data.subarray(ch, ch + length))
|
||||
}
|
||||
|
||||
} // length-distance pair
|
||||
} // length-distance pair or end-of-block
|
||||
} // loop until we reach end of block
|
||||
return blockSize;
|
||||
}
|
||||
|
||||
// {Uint8Array} compressedData A Uint8Array of the compressed file data.
|
||||
// compression method 8
|
||||
// deflate: http://tools.ietf.org/html/rfc1951
|
||||
function inflate(compressedData, numDecompressedBytes) {
|
||||
// Bit stream representing the compressed data.
|
||||
var bstream = new bitjs.io.BitStream(compressedData.buffer,
|
||||
false /* rtl */,
|
||||
compressedData.byteOffset,
|
||||
compressedData.byteLength);
|
||||
var buffer = new bitjs.io.ByteBuffer(numDecompressedBytes);
|
||||
var numBlocks = 0, blockSize = 0;
|
||||
|
||||
// block format: http://tools.ietf.org/html/rfc1951#page-9
|
||||
do {
|
||||
var bFinal = bstream.readBits(1),
|
||||
bType = bstream.readBits(2);
|
||||
blockSize = 0;
|
||||
++numBlocks;
|
||||
// no compression
|
||||
if (bType == 0) {
|
||||
// skip remaining bits in this byte
|
||||
while (bstream.bitPtr != 0) bstream.readBits(1);
|
||||
var len = bstream.readBits(16),
|
||||
nlen = bstream.readBits(16);
|
||||
// TODO: check if nlen is the ones-complement of len?
|
||||
|
||||
if(len > 0) buffer.insertBytes(bstream.readBytes(len));
|
||||
blockSize = len;
|
||||
}
|
||||
// fixed Huffman codes
|
||||
else if(bType == 1) {
|
||||
blockSize = inflateBlockData(bstream, getFixedLiteralTable(), getFixedDistanceTable(), buffer);
|
||||
}
|
||||
// dynamic Huffman codes
|
||||
else if(bType == 2) {
|
||||
var numLiteralLengthCodes = bstream.readBits(5) + 257;
|
||||
var numDistanceCodes = bstream.readBits(5) + 1,
|
||||
numCodeLengthCodes = bstream.readBits(4) + 4;
|
||||
|
||||
// populate the array of code length codes (first de-compaction)
|
||||
var codeLengthsCodeLengths = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0];
|
||||
for (var i = 0; i < numCodeLengthCodes; ++i) {
|
||||
codeLengthsCodeLengths[ CodeLengthCodeOrder[i] ] = bstream.readBits(3);
|
||||
}
|
||||
|
||||
// get the Huffman Codes for the code lengths
|
||||
var codeLengthsCodes = getHuffmanCodes(codeLengthsCodeLengths);
|
||||
|
||||
// now follow this mapping
|
||||
/*
|
||||
0 - 15: Represent code lengths of 0 - 15
|
||||
16: Copy the previous code length 3 - 6 times.
|
||||
The next 2 bits indicate repeat length
|
||||
(0 = 3, ... , 3 = 6)
|
||||
Example: Codes 8, 16 (+2 bits 11),
|
||||
16 (+2 bits 10) will expand to
|
||||
12 code lengths of 8 (1 + 6 + 5)
|
||||
17: Repeat a code length of 0 for 3 - 10 times.
|
||||
(3 bits of length)
|
||||
18: Repeat a code length of 0 for 11 - 138 times
|
||||
(7 bits of length)
|
||||
*/
|
||||
// to generate the true code lengths of the Huffman Codes for the literal
|
||||
// and distance tables together
|
||||
var literalCodeLengths = [];
|
||||
var prevCodeLength = 0;
|
||||
while (literalCodeLengths.length < numLiteralLengthCodes + numDistanceCodes) {
|
||||
var symbol = decodeSymbol(bstream, codeLengthsCodes);
|
||||
if (symbol <= 15) {
|
||||
literalCodeLengths.push(symbol);
|
||||
prevCodeLength = symbol;
|
||||
}
|
||||
else if (symbol == 16) {
|
||||
var repeat = bstream.readBits(2) + 3;
|
||||
while (repeat--) {
|
||||
literalCodeLengths.push(prevCodeLength);
|
||||
}
|
||||
}
|
||||
else if (symbol == 17) {
|
||||
var repeat = bstream.readBits(3) + 3;
|
||||
while (repeat--) {
|
||||
literalCodeLengths.push(0);
|
||||
}
|
||||
}
|
||||
else if (symbol == 18) {
|
||||
var repeat = bstream.readBits(7) + 11;
|
||||
while (repeat--) {
|
||||
literalCodeLengths.push(0);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// now split the distance code lengths out of the literal code array
|
||||
var distanceCodeLengths = literalCodeLengths.splice(numLiteralLengthCodes, numDistanceCodes);
|
||||
|
||||
// now generate the true Huffman Code tables using these code lengths
|
||||
var hcLiteralTable = getHuffmanCodes(literalCodeLengths),
|
||||
hcDistanceTable = getHuffmanCodes(distanceCodeLengths);
|
||||
blockSize = inflateBlockData(bstream, hcLiteralTable, hcDistanceTable, buffer);
|
||||
}
|
||||
// error
|
||||
else {
|
||||
err("Error! Encountered deflate block of type 3");
|
||||
return null;
|
||||
}
|
||||
|
||||
// update progress
|
||||
currentBytesUnarchivedInFile += blockSize;
|
||||
currentBytesUnarchived += blockSize;
|
||||
postProgress();
|
||||
|
||||
} while (bFinal != 1);
|
||||
// we are done reading blocks if the bFinal bit was set for this block
|
||||
|
||||
// return the buffer data bytes
|
||||
return buffer.data;
|
||||
}
|
||||
|
||||
// event.data.file has the ArrayBuffer.
|
||||
onmessage = function(event) {
|
||||
unzip(event.data.file, true);
|
||||
};
|
||||
6
lib/vendor/jquery-2.0.0.min.js
vendored
6
lib/vendor/jquery-2.0.0.min.js
vendored
File diff suppressed because one or more lines are too long
Loading…
Add table
Add a link
Reference in a new issue