Browse Source

Merge pull request #4764 from p01/graphic_optimizations_2

Graphic optimizations 2
Yury Delendik 11 years ago
parent
commit
7f6cb0ecff
  1. 4
      src/core/stream.js
  2. 11
      src/shared/colorspace.js
  3. 85
      src/shared/function.js

4
src/core/stream.js

@ -144,8 +144,8 @@ var DecodeStream = (function DecodeStreamClosure() {
size *= 2; size *= 2;
} }
var buffer2 = new Uint8Array(size); var buffer2 = new Uint8Array(size);
for (var i = 0; i < current; ++i) { if (buffer) {
buffer2[i] = buffer[i]; buffer2.set(buffer);
} }
return (this.buffer = buffer2); return (this.buffer = buffer2);
}, },

11
src/shared/colorspace.js

@ -396,6 +396,7 @@ var AlternateCS = (function AlternateCSClosure() {
getRgbBuffer: function AlternateCS_getRgbBuffer(src, srcOffset, count, getRgbBuffer: function AlternateCS_getRgbBuffer(src, srcOffset, count,
dest, destOffset, bits, dest, destOffset, bits,
alpha01) { alpha01) {
var tinted;
var tintFn = this.tintFn; var tintFn = this.tintFn;
var base = this.base; var base = this.base;
var scale = 1 / ((1 << bits) - 1); var scale = 1 / ((1 << bits) - 1);
@ -409,16 +410,22 @@ var AlternateCS = (function AlternateCSClosure() {
var scaled = new Float32Array(numComps); var scaled = new Float32Array(numComps);
var i, j; var i, j;
if (usesZeroToOneRange) {
for (i = 0; i < count; i++) { for (i = 0; i < count; i++) {
for (j = 0; j < numComps; j++) { for (j = 0; j < numComps; j++) {
scaled[j] = src[srcOffset++] * scale; scaled[j] = src[srcOffset++] * scale;
} }
var tinted = tintFn(scaled); tinted = tintFn(scaled);
if (usesZeroToOneRange) {
for (j = 0; j < baseNumComps; j++) { for (j = 0; j < baseNumComps; j++) {
baseBuf[pos++] = tinted[j] * 255; baseBuf[pos++] = tinted[j] * 255;
} }
}
} else { } else {
for (i = 0; i < count; i++) {
for (j = 0; j < numComps; j++) {
scaled[j] = src[srcOffset++] * scale;
}
tinted = tintFn(scaled);
base.getRgbItem(tinted, 0, baseBuf, pos); base.getRgbItem(tinted, 0, baseBuf, pos);
pos += baseNumComps; pos += baseNumComps;
} }

85
src/shared/function.js

@ -385,64 +385,55 @@ var PDFFunction = (function PDFFunctionClosure() {
var domain = IR[1]; var domain = IR[1];
var range = IR[2]; var range = IR[2];
var code = IR[3]; var code = IR[3];
var numOutputs = range.length / 2; var numOutputs = range.length >> 1;
var numInputs = domain.length >> 1;
var evaluator = new PostScriptEvaluator(code); var evaluator = new PostScriptEvaluator(code);
// Cache the values for a big speed up, the cache size is limited though // Cache the values for a big speed up, the cache size is limited though
// since the number of possible values can be huge from a PS function. // since the number of possible values can be huge from a PS function.
var cache = new FunctionCache(); var cache = {};
// The MAX_CACHE_SIZE is set to ~4x the maximum number of distinct values
// seen in our tests.
var MAX_CACHE_SIZE = 2048 * 4;
var cache_available = MAX_CACHE_SIZE;
return function constructPostScriptFromIRResult(args) { return function constructPostScriptFromIRResult(args) {
var initialStack = []; var i, value;
for (var i = 0, ii = (domain.length / 2); i < ii; ++i) { var key = '';
initialStack.push(args[i]); var input = new Array(numInputs);
for (i = 0; i < numInputs; i++) {
value = args[i];
input[i] = value;
key += value + '_';
}
var cachedValue = cache[key];
if (cachedValue !== undefined) {
return cachedValue;
}
var output = new Array(numOutputs);
var stack = evaluator.execute(input);
var stackIndex = stack.length - numOutputs;
for (i = 0; i < numOutputs; i++) {
value = stack[stackIndex + i];
var bound = range[i * 2];
if (value < bound) {
value = bound;
} else {
bound = range[i * 2 +1];
if (value > bound) {
value = bound;
} }
var key = initialStack.join('_');
if (cache.has(key)) {
return cache.get(key);
} }
output[i] = value;
var stack = evaluator.execute(initialStack);
var transformed = [];
for (i = numOutputs - 1; i >= 0; --i) {
var out = stack.pop();
var rangeIndex = 2 * i;
if (out < range[rangeIndex]) {
out = range[rangeIndex];
} else if (out > range[rangeIndex + 1]) {
out = range[rangeIndex + 1];
} }
transformed[i] = out; if (cache_available > 0) {
} cache_available--;
cache.set(key, transformed); cache[key] = output;
return transformed;
};
} }
return output;
}; };
})();
var FunctionCache = (function FunctionCacheClosure() {
// Of 10 PDF's with type4 functions the maxium number of distinct values seen
// was 256. This still may need some tweaking in the future though.
var MAX_CACHE_SIZE = 1024;
function FunctionCache() {
this.cache = {};
this.total = 0;
}
FunctionCache.prototype = {
has: function FunctionCache_has(key) {
return key in this.cache;
},
get: function FunctionCache_get(key) {
return this.cache[key];
},
set: function FunctionCache_set(key, value) {
if (this.total < MAX_CACHE_SIZE) {
this.cache[key] = value;
this.total++;
}
} }
}; };
return FunctionCache;
})(); })();
var PostScriptStack = (function PostScriptStackClosure() { var PostScriptStack = (function PostScriptStackClosure() {

Loading…
Cancel
Save