| 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142 |
1x
1x
1x
4x
1x
1x
1x
39x
1x
1x
1x
39x
39x
39x
39x
39x
39x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
62x
1x
168x
168x
95x
95x
2x
2x
2x
3x
1x
3x
3x
3x
3x
3x
5x
5x
5x
3x
1x
1x
1x
3x
1x
1x
1x
1x
1x
62x
1x
62x
62x
62x
62x
62x
182x
182x
114x
114x
68x
6x
6x
6x
2x
6x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
2x
2x
2x
1x
1x
2x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
1x
2x
2x
2x
1x
2x
2x
2x
2x
1x
1x
2x
2x
2x
2x
1x
1x
1x
1x
1x
1x
3x
3x
1x
1x
1x
2x
2x
2x
2x
2x
2x
2x
2x
2x
2x
2x
2x
1x
1x
1x
2x
2x
2x
2x
1x
1x
1x
1x
1x
1x
2x
2x
2x
2x
1x
1x
1x
1x
2x
2x
2x
2x
2x
2x
2x
2x
1x
1x
1x
2x
2x
1x
1x
2x
2x
2x
2x
1x
1x
2x
1x
1x
2x
2x
2x
2x
1x
1x
1x
1x
1x
1x
2x
2x
2x
2x
2x
2x
2x
4x
4x
1x
1x
1x
1x
1x
1x
1x
1x
1x
62x
1x
1x
129x
1x
47x
47x
47x
47x
1x
1x
37x
55x
55x
55x
55x
1x
1x
19x
15x
15x
15x
15x
15x
15x
1x
1x
13x
2x
2x
2x
2x
1x
1x
2x
5x
5x
5x
5x
1x
1x
13x
5x
5x
5x
1x
1x
4x
52x
1x
37x
13x
19x
13x
13x
13x
13x
13x
4x
4x
4x
4x
4x
2x
2x
2x
52x
7x
2x
5x
1x
4x
1x
3x
12x
8x
1x
7x
2x
5x
1x
8x
3x
1x
2x
1x
6x
6x
6x
10x
3x
1x
2x
1x
8x
2x
6x
2x
2x
2x
1x
44x
44x
44x
44x
44x
44x
47x
44x
110x
110x
50x
50x
60x
8x
1x
7x
7x
7x
7x
13x
1x
12x
12x
12x
12x
11x
1x
10x
10x
10x
10x
10x
10x
10x
10x
10x
1x
1x
1x
3x
3x
3x
3x
3x
2x
1x
1x
1x
1x
1x
1x
1x
8x
8x
2x
2x
2x
2x
6x
6x
2x
2x
4x
4x
4x
4x
4x
5x
5x
5x
5x
5x
5x
5x
1x
4x
4x
4x
4x
1x
37x
37x
37x
4x
4x
4x
37x
48x
48x
48x
48x
48x
48x
5x
5x
48x
5x
5x
48x
48x
48x
37x
1x
1x
1x
1x
1x | /* Copyright 2017 Mozilla Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
'use strict';
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.PostScriptCompiler = exports.PostScriptEvaluator = exports.PDFFunctionFactory = exports.isPDFFunction = undefined;
var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; };
var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; Eif ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { Eif (protoProps) defineProperties(Constructor.prototype, protoProps); Iif (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();
var _util = require('../shared/util');
var _primitives = require('./primitives');
var _ps_parser = require('./ps_parser');
function _classCallCheck(instance, Constructor) { Iif (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
var IsEvalSupportedCached = {
get value() {
return (0, _util.shadow)(this, 'value', (0, _util.isEvalSupported)());
}
};
var PDFFunctionFactory = function () {
function PDFFunctionFactory(_ref) {
var xref = _ref.xref,
_ref$isEvalSupported = _ref.isEvalSupported,
isEvalSupported = _ref$isEvalSupported === undefined ? true : _ref$isEvalSupported;
_classCallCheck(this, PDFFunctionFactory);
this.xref = xref;
this.isEvalSupported = isEvalSupported !== false;
}
_createClass(PDFFunctionFactory, [{
key: 'create',
value: function create(fn) {
return PDFFunction.parse({
xref: this.xref,
isEvalSupported: this.isEvalSupported,
fn: fn
});
}
}, {
key: 'createFromArray',
value: function createFromArray(fnObj) {
return PDFFunction.parseArray({
xref: this.xref,
isEvalSupported: this.isEvalSupported,
fnObj: fnObj
});
}
}, {
key: 'createFromIR',
value: function createFromIR(IR) {
return PDFFunction.fromIR({
xref: this.xref,
isEvalSupported: this.isEvalSupported,
IR: IR
});
}
}, {
key: 'createIR',
value: function createIR(fn) {
return PDFFunction.getIR({
xref: this.xref,
isEvalSupported: this.isEvalSupported,
fn: fn
});
}
}]);
return PDFFunctionFactory;
}();
var PDFFunction = function PDFFunctionClosure() {
var CONSTRUCT_SAMPLED = 0;
var CONSTRUCT_INTERPOLATED = 2;
var CONSTRUCT_STICHED = 3;
var CONSTRUCT_POSTSCRIPT = 4;
return {
getSampleArray: function getSampleArray(size, outputSize, bps, stream) {
var i, ii;
var length = 1;
for (i = 0, ii = size.length; i < ii; i++) {
length *= size[i];
}
length *= outputSize;
var array = new Array(length);
var codeSize = 0;
var codeBuf = 0;
var sampleMul = 1.0 / (Math.pow(2.0, bps) - 1);
var strBytes = stream.getBytes((length * bps + 7) / 8);
var strIdx = 0;
for (i = 0; i < length; i++) {
while (codeSize < bps) {
codeBuf <<= 8;
codeBuf |= strBytes[strIdx++];
codeSize += 8;
}
codeSize -= bps;
array[i] = (codeBuf >> codeSize) * sampleMul;
codeBuf &= (1 << codeSize) - 1;
}
return array;
},
getIR: function getIR(_ref2) {
var xref = _ref2.xref,
isEvalSupported = _ref2.isEvalSupported,
fn = _ref2.fn;
var dict = fn.dict;
Iif (!dict) {
dict = fn;
}
var types = [this.constructSampled, null, this.constructInterpolated, this.constructStiched, this.constructPostScript];
var typeNum = dict.get('FunctionType');
var typeFn = types[typeNum];
Iif (!typeFn) {
throw new _util.FormatError('Unknown type of function');
}
return typeFn.call(this, {
xref: xref,
isEvalSupported: isEvalSupported,
fn: fn,
dict: dict
});
},
fromIR: function fromIR(_ref3) {
var xref = _ref3.xref,
isEvalSupported = _ref3.isEvalSupported,
IR = _ref3.IR;
var type = IR[0];
switch (type) {
case CONSTRUCT_SAMPLED:
return this.constructSampledFromIR({
xref: xref,
isEvalSupported: isEvalSupported,
IR: IR
});
case CONSTRUCT_INTERPOLATED:
return this.constructInterpolatedFromIR({
xref: xref,
isEvalSupported: isEvalSupported,
IR: IR
});
case CONSTRUCT_STICHED:
return this.constructStichedFromIR({
xref: xref,
isEvalSupported: isEvalSupported,
IR: IR
});
default:
return this.constructPostScriptFromIR({
xref: xref,
isEvalSupported: isEvalSupported,
IR: IR
});
}
},
parse: function parse(_ref4) {
var xref = _ref4.xref,
isEvalSupported = _ref4.isEvalSupported,
fn = _ref4.fn;
var IR = this.getIR({
xref: xref,
isEvalSupported: isEvalSupported,
fn: fn
});
return this.fromIR({
xref: xref,
isEvalSupported: isEvalSupported,
IR: IR
});
},
parseArray: function parseArray(_ref5) {
var xref = _ref5.xref,
isEvalSupported = _ref5.isEvalSupported,
fnObj = _ref5.fnObj;
if (!Array.isArray(fnObj)) {
return this.parse({
xref: xref,
isEvalSupported: isEvalSupported,
fn: fnObj
});
}
var fnArray = [];
for (var j = 0, jj = fnObj.length; j < jj; j++) {
fnArray.push(this.parse({
xref: xref,
isEvalSupported: isEvalSupported,
fn: xref.fetchIfRef(fnObj[j])
}));
}
return function (src, srcOffset, dest, destOffset) {
for (var i = 0, ii = fnArray.length; i < ii; i++) {
fnArray[i](src, srcOffset, dest, destOffset + i);
}
};
},
constructSampled: function constructSampled(_ref6) {
var xref = _ref6.xref,
isEvalSupported = _ref6.isEvalSupported,
fn = _ref6.fn,
dict = _ref6.dict;
function toMultiArray(arr) {
var inputLength = arr.length;
var out = [];
var index = 0;
for (var i = 0; i < inputLength; i += 2) {
out[index] = [arr[i], arr[i + 1]];
++index;
}
return out;
}
var domain = dict.getArray('Domain');
var range = dict.getArray('Range');
if (!domain || !range) {
throw new _util.FormatError('No domain or range');
}
var inputSize = domain.length / 2;
var outputSize = range.length / 2;
domain = toMultiArray(domain);
range = toMultiArray(range);
var size = dict.get('Size');
var bps = dict.get('BitsPerSample');
var order = dict.get('Order') || 1;
if (order !== 1) {
(0, _util.info)('No support for cubic spline interpolation: ' + order);
}
var encode = dict.getArray('Encode');
if (!encode) {
encode = [];
for (var i = 0; i < inputSize; ++i) {
encode.push(0);
encode.push(size[i] - 1);
}
}
encode = toMultiArray(encode);
var decode = dict.getArray('Decode');
if (!decode) {
decode = range;
} else {
decode = toMultiArray(decode);
}
var samples = this.getSampleArray(size, outputSize, bps, fn);
return [CONSTRUCT_SAMPLED, inputSize, domain, encode, decode, samples, size, outputSize, Math.pow(2, bps) - 1, range];
},
constructSampledFromIR: function constructSampledFromIR(_ref7) {
var xref = _ref7.xref,
isEvalSupported = _ref7.isEvalSupported,
IR = _ref7.IR;
function interpolate(x, xmin, xmax, ymin, ymax) {
return ymin + (x - xmin) * ((ymax - ymin) / (xmax - xmin));
}
return function constructSampledFromIRResult(src, srcOffset, dest, destOffset) {
var m = IR[1];
var domain = IR[2];
var encode = IR[3];
var decode = IR[4];
var samples = IR[5];
var size = IR[6];
var n = IR[7];
var range = IR[9];
var cubeVertices = 1 << m;
var cubeN = new Float64Array(cubeVertices);
var cubeVertex = new Uint32Array(cubeVertices);
var i, j;
for (j = 0; j < cubeVertices; j++) {
cubeN[j] = 1;
}
var k = n,
pos = 1;
for (i = 0; i < m; ++i) {
var domain_2i = domain[i][0];
var domain_2i_1 = domain[i][1];
var xi = Math.min(Math.max(src[srcOffset + i], domain_2i), domain_2i_1);
var e = interpolate(xi, domain_2i, domain_2i_1, encode[i][0], encode[i][1]);
var size_i = size[i];
e = Math.min(Math.max(e, 0), size_i - 1);
var e0 = e < size_i - 1 ? Math.floor(e) : e - 1;
var n0 = e0 + 1 - e;
var n1 = e - e0;
var offset0 = e0 * k;
var offset1 = offset0 + k;
for (j = 0; j < cubeVertices; j++) {
if (j & pos) {
cubeN[j] *= n1;
cubeVertex[j] += offset1;
} else {
cubeN[j] *= n0;
cubeVertex[j] += offset0;
}
}
k *= size_i;
pos <<= 1;
}
for (j = 0; j < n; ++j) {
var rj = 0;
for (i = 0; i < cubeVertices; i++) {
rj += samples[cubeVertex[i] + j] * cubeN[i];
}
rj = interpolate(rj, 0, 1, decode[j][0], decode[j][1]);
dest[destOffset + j] = Math.min(Math.max(rj, range[j][0]), range[j][1]);
}
};
},
constructInterpolated: function constructInterpolated(_ref8) {
var xref = _ref8.xref,
isEvalSupported = _ref8.isEvalSupported,
fn = _ref8.fn,
dict = _ref8.dict;
var c0 = dict.getArray('C0') || [0];
var c1 = dict.getArray('C1') || [1];
var n = dict.get('N');
if (!Array.isArray(c0) || !Array.isArray(c1)) {
throw new _util.FormatError('Illegal dictionary for interpolated function');
}
var length = c0.length;
var diff = [];
for (var i = 0; i < length; ++i) {
diff.push(c1[i] - c0[i]);
}
return [CONSTRUCT_INTERPOLATED, c0, diff, n];
},
constructInterpolatedFromIR: function constructInterpolatedFromIR(_ref9) {
var xref = _ref9.xref,
isEvalSupported = _ref9.isEvalSupported,
IR = _ref9.IR;
var c0 = IR[1];
var diff = IR[2];
var n = IR[3];
var length = diff.length;
return function constructInterpolatedFromIRResult(src, srcOffset, dest, destOffset) {
var x = n === 1 ? src[srcOffset] : Math.pow(src[srcOffset], n);
for (var j = 0; j < length; ++j) {
dest[destOffset + j] = c0[j] + x * diff[j];
}
};
},
constructStiched: function constructStiched(_ref10) {
var xref = _ref10.xref,
isEvalSupported = _ref10.isEvalSupported,
fn = _ref10.fn,
dict = _ref10.dict;
var domain = dict.getArray('Domain');
if (!domain) {
throw new _util.FormatError('No domain');
}
var inputSize = domain.length / 2;
if (inputSize !== 1) {
throw new _util.FormatError('Bad domain for stiched function');
}
var fnRefs = dict.get('Functions');
var fns = [];
for (var i = 0, ii = fnRefs.length; i < ii; ++i) {
fns.push(this.getIR({
xref: xref,
isEvalSupported: isEvalSupported,
fn: xref.fetchIfRef(fnRefs[i])
}));
}
var bounds = dict.getArray('Bounds');
var encode = dict.getArray('Encode');
return [CONSTRUCT_STICHED, domain, bounds, encode, fns];
},
constructStichedFromIR: function constructStichedFromIR(_ref11) {
var xref = _ref11.xref,
isEvalSupported = _ref11.isEvalSupported,
IR = _ref11.IR;
var domain = IR[1];
var bounds = IR[2];
var encode = IR[3];
var fnsIR = IR[4];
var fns = [];
var tmpBuf = new Float32Array(1);
for (var i = 0, ii = fnsIR.length; i < ii; i++) {
fns.push(this.fromIR({
xref: xref,
isEvalSupported: isEvalSupported,
IR: fnsIR[i]
}));
}
return function constructStichedFromIRResult(src, srcOffset, dest, destOffset) {
var clip = function constructStichedFromIRClip(v, min, max) {
if (v > max) {
v = max;
} else if (v < min) {
v = min;
}
return v;
};
var v = clip(src[srcOffset], domain[0], domain[1]);
for (var i = 0, ii = bounds.length; i < ii; ++i) {
if (v < bounds[i]) {
break;
}
}
var dmin = domain[0];
if (i > 0) {
dmin = bounds[i - 1];
}
var dmax = domain[1];
if (i < bounds.length) {
dmax = bounds[i];
}
var rmin = encode[2 * i];
var rmax = encode[2 * i + 1];
tmpBuf[0] = dmin === dmax ? rmin : rmin + (v - dmin) * (rmax - rmin) / (dmax - dmin);
fns[i](tmpBuf, 0, dest, destOffset);
};
},
constructPostScript: function constructPostScript(_ref12) {
var xref = _ref12.xref,
isEvalSupported = _ref12.isEvalSupported,
fn = _ref12.fn,
dict = _ref12.dict;
var domain = dict.getArray('Domain');
var range = dict.getArray('Range');
Iif (!domain) {
throw new _util.FormatError('No domain.');
}
Iif (!range) {
throw new _util.FormatError('No range.');
}
var lexer = new _ps_parser.PostScriptLexer(fn);
var parser = new _ps_parser.PostScriptParser(lexer);
var code = parser.parse();
return [CONSTRUCT_POSTSCRIPT, domain, range, code];
},
constructPostScriptFromIR: function constructPostScriptFromIR(_ref13) {
var xref = _ref13.xref,
isEvalSupported = _ref13.isEvalSupported,
IR = _ref13.IR;
var domain = IR[1];
var range = IR[2];
var code = IR[3];
Eif (isEvalSupported && IsEvalSupportedCached.value) {
var compiled = new PostScriptCompiler().compile(code, domain, range);
Eif (compiled) {
return new Function('src', 'srcOffset', 'dest', 'destOffset', compiled);
}
}
(0, _util.info)('Unable to compile PS function');
var numOutputs = range.length >> 1;
var numInputs = domain.length >> 1;
var evaluator = new PostScriptEvaluator(code);
var cache = Object.create(null);
var MAX_CACHE_SIZE = 2048 * 4;
var cache_available = MAX_CACHE_SIZE;
var tmpBuf = new Float32Array(numInputs);
return function constructPostScriptFromIRResult(src, srcOffset, dest, destOffset) {
var i, value;
var key = '';
var input = tmpBuf;
for (i = 0; i < numInputs; i++) {
value = src[srcOffset + i];
input[i] = value;
key += value + '_';
}
var cachedValue = cache[key];
if (cachedValue !== undefined) {
dest.set(cachedValue, destOffset);
return;
}
var output = new Float32Array(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;
}
}
output[i] = value;
}
if (cache_available > 0) {
cache_available--;
cache[key] = output;
}
dest.set(output, destOffset);
};
}
};
}();
function isPDFFunction(v) {
var fnDict;
if ((typeof v === 'undefined' ? 'undefined' : _typeof(v)) !== 'object') {
return false;
} else if ((0, _primitives.isDict)(v)) {
fnDict = v;
} else if ((0, _primitives.isStream)(v)) {
fnDict = v.dict;
} else {
return false;
}
return fnDict.has('FunctionType');
}
var PostScriptStack = function PostScriptStackClosure() {
var MAX_STACK_SIZE = 100;
function PostScriptStack(initialStack) {
this.stack = !initialStack ? [] : Array.prototype.slice.call(initialStack, 0);
}
PostScriptStack.prototype = {
push: function PostScriptStack_push(value) {
Iif (this.stack.length >= MAX_STACK_SIZE) {
throw new Error('PostScript function stack overflow.');
}
this.stack.push(value);
},
pop: function PostScriptStack_pop() {
Iif (this.stack.length <= 0) {
throw new Error('PostScript function stack underflow.');
}
return this.stack.pop();
},
copy: function PostScriptStack_copy(n) {
Iif (this.stack.length + n >= MAX_STACK_SIZE) {
throw new Error('PostScript function stack overflow.');
}
var stack = this.stack;
for (var i = stack.length - n, j = n - 1; j >= 0; j--, i++) {
stack.push(stack[i]);
}
},
index: function PostScriptStack_index(n) {
this.push(this.stack[this.stack.length - n - 1]);
},
roll: function PostScriptStack_roll(n, p) {
var stack = this.stack;
var l = stack.length - n;
var r = stack.length - 1,
c = l + (p - Math.floor(p / n) * n),
i,
j,
t;
for (i = l, j = r; i < j; i++, j--) {
t = stack[i];
stack[i] = stack[j];
stack[j] = t;
}
for (i = l, j = c - 1; i < j; i++, j--) {
t = stack[i];
stack[i] = stack[j];
stack[j] = t;
}
for (i = c, j = r; i < j; i++, j--) {
t = stack[i];
stack[i] = stack[j];
stack[j] = t;
}
}
};
return PostScriptStack;
}();
var PostScriptEvaluator = function PostScriptEvaluatorClosure() {
function PostScriptEvaluator(operators) {
this.operators = operators;
}
PostScriptEvaluator.prototype = {
execute: function PostScriptEvaluator_execute(initialStack) {
var stack = new PostScriptStack(initialStack);
var counter = 0;
var operators = this.operators;
var length = operators.length;
var operator, a, b;
while (counter < length) {
operator = operators[counter++];
if (typeof operator === 'number') {
stack.push(operator);
continue;
}
switch (operator) {
case 'jz':
b = stack.pop();
a = stack.pop();
if (!a) {
counter = b;
}
break;
case 'j':
a = stack.pop();
counter = a;
break;
case 'abs':
a = stack.pop();
stack.push(Math.abs(a));
break;
case 'add':
b = stack.pop();
a = stack.pop();
stack.push(a + b);
break;
case 'and':
b = stack.pop();
a = stack.pop();
if ((0, _util.isBool)(a) && (0, _util.isBool)(b)) {
stack.push(a && b);
} else {
stack.push(a & b);
}
break;
case 'atan':
a = stack.pop();
stack.push(Math.atan(a));
break;
case 'bitshift':
b = stack.pop();
a = stack.pop();
Eif (a > 0) {
stack.push(a << b);
} else {
stack.push(a >> b);
}
break;
case 'ceiling':
a = stack.pop();
stack.push(Math.ceil(a));
break;
case 'copy':
a = stack.pop();
stack.copy(a);
break;
case 'cos':
a = stack.pop();
stack.push(Math.cos(a));
break;
case 'cvi':
a = stack.pop() | 0;
stack.push(a);
break;
case 'cvr':
break;
case 'div':
b = stack.pop();
a = stack.pop();
stack.push(a / b);
break;
case 'dup':
stack.copy(1);
break;
case 'eq':
b = stack.pop();
a = stack.pop();
stack.push(a === b);
break;
case 'exch':
stack.roll(2, 1);
break;
case 'exp':
b = stack.pop();
a = stack.pop();
stack.push(Math.pow(a, b));
break;
case 'false':
stack.push(false);
break;
case 'floor':
a = stack.pop();
stack.push(Math.floor(a));
break;
case 'ge':
b = stack.pop();
a = stack.pop();
stack.push(a >= b);
break;
case 'gt':
b = stack.pop();
a = stack.pop();
stack.push(a > b);
break;
case 'idiv':
b = stack.pop();
a = stack.pop();
stack.push(a / b | 0);
break;
case 'index':
a = stack.pop();
stack.index(a);
break;
case 'le':
b = stack.pop();
a = stack.pop();
stack.push(a <= b);
break;
case 'ln':
a = stack.pop();
stack.push(Math.log(a));
break;
case 'log':
a = stack.pop();
stack.push(Math.log(a) / Math.LN10);
break;
case 'lt':
b = stack.pop();
a = stack.pop();
stack.push(a < b);
break;
case 'mod':
b = stack.pop();
a = stack.pop();
stack.push(a % b);
break;
case 'mul':
b = stack.pop();
a = stack.pop();
stack.push(a * b);
break;
case 'ne':
b = stack.pop();
a = stack.pop();
stack.push(a !== b);
break;
case 'neg':
a = stack.pop();
stack.push(-a);
break;
case 'not':
a = stack.pop();
if ((0, _util.isBool)(a)) {
stack.push(!a);
} else {
stack.push(~a);
}
break;
case 'or':
b = stack.pop();
a = stack.pop();
if ((0, _util.isBool)(a) && (0, _util.isBool)(b)) {
stack.push(a || b);
} else {
stack.push(a | b);
}
break;
case 'pop':
stack.pop();
break;
case 'roll':
b = stack.pop();
a = stack.pop();
stack.roll(a, b);
break;
case 'round':
a = stack.pop();
stack.push(Math.round(a));
break;
case 'sin':
a = stack.pop();
stack.push(Math.sin(a));
break;
case 'sqrt':
a = stack.pop();
stack.push(Math.sqrt(a));
break;
case 'sub':
b = stack.pop();
a = stack.pop();
stack.push(a - b);
break;
case 'true':
stack.push(true);
break;
case 'truncate':
a = stack.pop();
a = a < 0 ? Math.ceil(a) : Math.floor(a);
stack.push(a);
break;
case 'xor':
b = stack.pop();
a = stack.pop();
Iif ((0, _util.isBool)(a) && (0, _util.isBool)(b)) {
stack.push(a !== b);
} else {
stack.push(a ^ b);
}
break;
default:
throw new _util.FormatError('Unknown operator ' + operator);
}
}
return stack.stack;
}
};
return PostScriptEvaluator;
}();
var PostScriptCompiler = function PostScriptCompilerClosure() {
function AstNode(type) {
this.type = type;
}
AstNode.prototype.visit = function (visitor) {
throw new Error('abstract method');
};
function AstArgument(index, min, max) {
AstNode.call(this, 'args');
this.index = index;
this.min = min;
this.max = max;
}
AstArgument.prototype = Object.create(AstNode.prototype);
AstArgument.prototype.visit = function (visitor) {
visitor.visitArgument(this);
};
function AstLiteral(number) {
AstNode.call(this, 'literal');
this.number = number;
this.min = number;
this.max = number;
}
AstLiteral.prototype = Object.create(AstNode.prototype);
AstLiteral.prototype.visit = function (visitor) {
visitor.visitLiteral(this);
};
function AstBinaryOperation(op, arg1, arg2, min, max) {
AstNode.call(this, 'binary');
this.op = op;
this.arg1 = arg1;
this.arg2 = arg2;
this.min = min;
this.max = max;
}
AstBinaryOperation.prototype = Object.create(AstNode.prototype);
AstBinaryOperation.prototype.visit = function (visitor) {
visitor.visitBinaryOperation(this);
};
function AstMin(arg, max) {
AstNode.call(this, 'max');
this.arg = arg;
this.min = arg.min;
this.max = max;
}
AstMin.prototype = Object.create(AstNode.prototype);
AstMin.prototype.visit = function (visitor) {
visitor.visitMin(this);
};
function AstVariable(index, min, max) {
AstNode.call(this, 'var');
this.index = index;
this.min = min;
this.max = max;
}
AstVariable.prototype = Object.create(AstNode.prototype);
AstVariable.prototype.visit = function (visitor) {
visitor.visitVariable(this);
};
function AstVariableDefinition(variable, arg) {
AstNode.call(this, 'definition');
this.variable = variable;
this.arg = arg;
}
AstVariableDefinition.prototype = Object.create(AstNode.prototype);
AstVariableDefinition.prototype.visit = function (visitor) {
visitor.visitVariableDefinition(this);
};
function ExpressionBuilderVisitor() {
this.parts = [];
}
ExpressionBuilderVisitor.prototype = {
visitArgument: function visitArgument(arg) {
this.parts.push('Math.max(', arg.min, ', Math.min(', arg.max, ', src[srcOffset + ', arg.index, ']))');
},
visitVariable: function visitVariable(variable) {
this.parts.push('v', variable.index);
},
visitLiteral: function visitLiteral(literal) {
this.parts.push(literal.number);
},
visitBinaryOperation: function visitBinaryOperation(operation) {
this.parts.push('(');
operation.arg1.visit(this);
this.parts.push(' ', operation.op, ' ');
operation.arg2.visit(this);
this.parts.push(')');
},
visitVariableDefinition: function visitVariableDefinition(definition) {
this.parts.push('var ');
definition.variable.visit(this);
this.parts.push(' = ');
definition.arg.visit(this);
this.parts.push(';');
},
visitMin: function visitMin(max) {
this.parts.push('Math.min(');
max.arg.visit(this);
this.parts.push(', ', max.max, ')');
},
toString: function toString() {
return this.parts.join('');
}
};
function buildAddOperation(num1, num2) {
if (num2.type === 'literal' && num2.number === 0) {
return num1;
}
if (num1.type === 'literal' && num1.number === 0) {
return num2;
}
if (num2.type === 'literal' && num1.type === 'literal') {
return new AstLiteral(num1.number + num2.number);
}
return new AstBinaryOperation('+', num1, num2, num1.min + num2.min, num1.max + num2.max);
}
function buildMulOperation(num1, num2) {
if (num2.type === 'literal') {
if (num2.number === 0) {
return new AstLiteral(0);
} else if (num2.number === 1) {
return num1;
} else if (num1.type === 'literal') {
return new AstLiteral(num1.number * num2.number);
}
}
if (num1.type === 'literal') {
if (num1.number === 0) {
return new AstLiteral(0);
} else if (num1.number === 1) {
return num2;
}
}
var min = Math.min(num1.min * num2.min, num1.min * num2.max, num1.max * num2.min, num1.max * num2.max);
var max = Math.max(num1.min * num2.min, num1.min * num2.max, num1.max * num2.min, num1.max * num2.max);
return new AstBinaryOperation('*', num1, num2, min, max);
}
function buildSubOperation(num1, num2) {
if (num2.type === 'literal') {
if (num2.number === 0) {
return num1;
} else if (num1.type === 'literal') {
return new AstLiteral(num1.number - num2.number);
}
}
if (num2.type === 'binary' && num2.op === '-' && num1.type === 'literal' && num1.number === 1 && num2.arg1.type === 'literal' && num2.arg1.number === 1) {
return num2.arg2;
}
return new AstBinaryOperation('-', num1, num2, num1.min - num2.max, num1.max - num2.min);
}
function buildMinOperation(num1, max) {
Iif (num1.min >= max) {
return new AstLiteral(max);
} else Iif (num1.max <= max) {
return num1;
}
return new AstMin(num1, max);
}
function PostScriptCompiler() {}
PostScriptCompiler.prototype = {
compile: function PostScriptCompiler_compile(code, domain, range) {
var stack = [];
var i, ii;
var instructions = [];
var inputSize = domain.length >> 1,
outputSize = range.length >> 1;
var lastRegister = 0;
var n, j;
var num1, num2, ast1, ast2, tmpVar, item;
for (i = 0; i < inputSize; i++) {
stack.push(new AstArgument(i, domain[i * 2], domain[i * 2 + 1]));
}
for (i = 0, ii = code.length; i < ii; i++) {
item = code[i];
if (typeof item === 'number') {
stack.push(new AstLiteral(item));
continue;
}
switch (item) {
case 'add':
if (stack.length < 2) {
return null;
}
num2 = stack.pop();
num1 = stack.pop();
stack.push(buildAddOperation(num1, num2));
break;
case 'cvr':
if (stack.length < 1) {
return null;
}
break;
case 'mul':
if (stack.length < 2) {
return null;
}
num2 = stack.pop();
num1 = stack.pop();
stack.push(buildMulOperation(num1, num2));
break;
case 'sub':
if (stack.length < 2) {
return null;
}
num2 = stack.pop();
num1 = stack.pop();
stack.push(buildSubOperation(num1, num2));
break;
case 'exch':
Iif (stack.length < 2) {
return null;
}
ast1 = stack.pop();
ast2 = stack.pop();
stack.push(ast1, ast2);
break;
case 'pop':
Iif (stack.length < 1) {
return null;
}
stack.pop();
break;
case 'index':
Iif (stack.length < 1) {
return null;
}
num1 = stack.pop();
Iif (num1.type !== 'literal') {
return null;
}
n = num1.number;
if (n < 0 || !Number.isInteger(n) || stack.length < n) {
return null;
}
ast1 = stack[stack.length - n - 1];
Iif (ast1.type === 'literal' || ast1.type === 'var') {
stack.push(ast1);
break;
}
tmpVar = new AstVariable(lastRegister++, ast1.min, ast1.max);
stack[stack.length - n - 1] = tmpVar;
stack.push(tmpVar);
instructions.push(new AstVariableDefinition(tmpVar, ast1));
break;
case 'dup':
Iif (stack.length < 1) {
return null;
}
if (typeof code[i + 1] === 'number' && code[i + 2] === 'gt' && code[i + 3] === i + 7 && code[i + 4] === 'jz' && code[i + 5] === 'pop' && code[i + 6] === code[i + 1]) {
num1 = stack.pop();
stack.push(buildMinOperation(num1, code[i + 1]));
i += 6;
break;
}
ast1 = stack[stack.length - 1];
if (ast1.type === 'literal' || ast1.type === 'var') {
stack.push(ast1);
break;
}
tmpVar = new AstVariable(lastRegister++, ast1.min, ast1.max);
stack[stack.length - 1] = tmpVar;
stack.push(tmpVar);
instructions.push(new AstVariableDefinition(tmpVar, ast1));
break;
case 'roll':
Iif (stack.length < 2) {
return null;
}
num2 = stack.pop();
num1 = stack.pop();
Iif (num2.type !== 'literal' || num1.type !== 'literal') {
return null;
}
j = num2.number;
n = num1.number;
if (n <= 0 || !Number.isInteger(n) || !Number.isInteger(j) || stack.length < n) {
return null;
}
j = (j % n + n) % n;
Iif (j === 0) {
break;
}
Array.prototype.push.apply(stack, stack.splice(stack.length - n, n - j));
break;
default:
return null;
}
}
Iif (stack.length !== outputSize) {
return null;
}
var result = [];
instructions.forEach(function (instruction) {
var statementBuilder = new ExpressionBuilderVisitor();
instruction.visit(statementBuilder);
result.push(statementBuilder.toString());
});
stack.forEach(function (expr, i) {
var statementBuilder = new ExpressionBuilderVisitor();
expr.visit(statementBuilder);
var min = range[i * 2],
max = range[i * 2 + 1];
var out = [statementBuilder.toString()];
if (min > expr.min) {
out.unshift('Math.max(', min, ', ');
out.push(')');
}
if (max < expr.max) {
out.unshift('Math.min(', max, ', ');
out.push(')');
}
out.unshift('dest[destOffset + ', i, '] = ');
out.push(';');
result.push(out.join(''));
});
return result.join('\n');
}
};
return PostScriptCompiler;
}();
exports.isPDFFunction = isPDFFunction;
exports.PDFFunctionFactory = PDFFunctionFactory;
exports.PostScriptEvaluator = PostScriptEvaluator;
exports.PostScriptCompiler = PostScriptCompiler; |