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
|
% Copyright (C) 1998 Aladdin Enterprises. All rights reserved.
%
% This file is part of GNU Ghostscript.
%
% GNU Ghostscript is distributed in the hope that it will be useful, but
% WITHOUT ANY WARRANTY. No author or distributor accepts responsibility
% to anyone for the consequences of using it or for whether it serves any
% particular purpose or works at all, unless he says so in writing. Refer
% to the GNU General Public License for full details.
%
% Everyone is granted permission to copy, modify and redistribute GNU
% Ghostscript, but only under the conditions described in the GNU General
% Public License. A copy of this license is supposed to have been given
% to you along with GNU Ghostscript so you can know your rights and
% responsibilities. It should be in a file named COPYING. Among other
% things, the copyright notice and this notice must be preserved on all
% copies.
% $RCSfile: cid2code.ps,v $ $Revision: 1.2.2.1 $
% Construct an inverse map from CIDs to codes.
% Create an inverse map from CIDs to code values.
% We only use this for 16-bit Unicode, so it has some limitations.
% After invoking .cmap2code, loading a CMap file prints out the map
% instead of doing what it usually does.
/.cmap2codedict 10 dict begin
/begincmap {
mark
} def
/endcmap {
% Stack: mark code_lo1 code_hi1 cid1 ...
20 dict begin
/depth counttomark 3 sub def
% Do a first pass to determine the maximum CID.
0 0 3 depth {
1 add /d exch def
d index d 2 add index 1 get add d 3 add index 1 get sub .max
} for
1 add /ncid exch def
/map ncid 2 mul string def
% Now fill in the map.
0 3 depth {
/d exch def
d index 2 mul /cid2 exch def
d 1 add index /hi exch def
d 2 add index 2 string copy /lo exch def
lo 1 get 1 hi 1 get {
map cid2 lo 0 get put
map cid2 1 add 3 -1 roll put
/cid2 cid2 2 add def
} for
} for
% Print the map.
(%stdout) (w) file
dup (<) print
dup /ASCIIHexEncode filter
dup map writestring
closefile
() = flush
closefile
end
} def
%/begincodespacerange
/endcodespacerange {cleartomark} def
%/usecmap
%/beginbfchar
/endbfchar {cleartomark} def
%/beginbfrange
/endbfrange {cleartomark} def
%/begincidchar
/endcidchar {
counttomark 2 idiv { dup counttomark 1 add 3 roll } repeat pop
} def
%/begincidrange
/endcidrange {
counttomark 1 add -1 roll pop
} def
%/beginnotdefchar
/endnotdefchar {cleartomark} def
%/beginnotdefrange
/endnotdefrange {cleartomark} def
currentdict end readonly def
/.cmap2code { % - .cmap2code -
/CIDInit /ProcSet findresource dup length dict copy
.cmap2codedict { 3 copy put pop pop } forall
/CIDInit exch /ProcSet defineresource pop
} def
% Extract and print reverse mapping information from a cid2code.txt file.
/.printhex2 { % <int16> .printhex2 -
(<) print
16#10000 add 16 =string cvrs 1 4 getinterval print
(>) print
} def
/.cid2code { % <cmaptemplate> <file> <column> .cid2code -
30 dict begin
/column exch def
(r) file /f exch def
(%!) =
(/CIDInit /ProcSet findresource begin 12 dict begin begincmap) =
% Print the information from the template.
{
exch ==only ( ) print
dup type /dicttype eq {
dup length =only ( dict dup begin) = {
( ) print exch ===only ( ) print ===only ( def) =
} forall (end def) =
} {
===only
} ifelse ( def) =
} forall
% Read the data from the cid2code.txt file.
{
f =string readline pop (CID\t) anchorsearch { pop pop exit } if pop
} loop
/map [ {
f =string readline not { pop exit } if
column { (\t) search pop pop pop } repeat
(\t) search { exch pop exch pop } if
(,) search { exch pop exch pop } if
dup length 4 ne { pop (*) } if
dup (*) eq { pop (0000) } if
(16#) exch concatstrings cvi
} loop ] def
% Print the code space range(s).
/maxcid map length 1 sub def
mark maxcid
dup 255 and 255 eq {
0 exch
} {
dup 16#ff00 and exch 0 2 index 1 sub
} ifelse
counttomark 2 idiv dup =only ( begincodespacerange) = {
exch .printhex2 .printhex2 () =
} repeat (endcodespacerange) =
% Print the map data.
0 1 100 maxcid {
/lo exch def
/hi lo 99 add maxcid .min def
0 lo 1 hi { map exch get 0 ne { 1 add } if } for
dup 0 eq {
pop
} {
=only ( begincidchar) = lo 1 hi {
map 1 index get dup 0 eq { pop pop } { exch .printhex2 = } ifelse
} for (endcidchar) =
} ifelse
} for
% Wrap up.
(endcmap CMapName currentdict /CMap defineresource pop end end) =
f closefile
end
} bind def
|
