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
|
#
# genmap_support.py: Multibyte Codec Map Generator
#
# Copyright (C) 2003-2004 Hye-Shik Chang <perky@FreeBSD.org>.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
#
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
# IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
# DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
# INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
# STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
# IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.
#
# $Id: genmap_support.py,v 1.6 2004/06/29 05:55:09 perky Exp $
#
import re
COPYRIGHT_HEADER = """\
/*
* $Id: genmap_support.py,v 1.6 2004/06/29 05:55:09 perky Exp $
*/
"""
class BufferedFiller:
def __init__(self, column=78):
self.column = column
self.buffered = []
self.cline = []
self.clen = 0
self.count = 0
def write(self, *data):
for s in data:
if len(s) > self.column:
raise ValueError, "token is too long"
if len(s) + self.clen > self.column:
self.flush()
self.clen += len(s)
self.cline.append(s)
self.count += 1
def flush(self):
if not self.cline:
return
self.buffered.append(''.join(self.cline))
self.clen = 0
del self.cline[:]
def printout(self, fp):
self.flush()
for l in self.buffered:
print >> fp, l
del self.buffered[:]
def __len__(self):
return self.count
class UCMReader:
def __init__(self, fp):
self.file = fp
def itertokens(self):
isincharmap = False
for line in self.file:
body = line.split('#', 1)[0].strip()
if body == 'CHARMAP':
isincharmap = True
elif body == 'END CHARMAP':
isincharmap = False
elif isincharmap:
index, data = body.split(None, 1)
index = int(index[2:-1], 16)
data = self.parsedata(data)
yield index, data
def parsedata(self, data):
return eval('"'+data.split()[0]+'"')
def printcopyright(fo):
print >> fo, COPYRIGHT_HEADER
class EncodeMapWriter:
filler_class = BufferedFiller
elemtype = 'DBCHAR'
indextype = 'struct unim_index'
def __init__(self, fp, prefix, map):
self.file = fp
self.prefix = prefix
self.filler = self.filler_class()
self.buildmap(map)
self.printmap(map)
def buildmap(self, emap):
for c1 in range(0, 256):
if c1 not in emap:
continue
c2map = emap[c1]
rc2values = c2map.keys()
rc2values.sort()
if not rc2values:
continue
c2map[self.prefix] = True
c2map['min'] = rc2values[0]
c2map['max'] = rc2values[-1]
c2map['midx'] = len(self.filler)
for v in range(rc2values[0], rc2values[-1] + 1):
if v not in c2map:
self.write_nochar()
elif isinstance(c2map[v], int):
self.write_char(c2map[v])
elif isinstance(c2map[v], tuple):
self.write_multic(c2map[v])
else:
raise ValueError
def write_nochar(self):
self.filler.write('N,')
def write_multic(self, point):
self.filler.write('M,')
def write_char(self, point):
self.filler.write(str(point) + ',')
def printmap(self, fmap):
print >> self.file, ("static const %s __%s_encmap[%d] = {" % (
self.elemtype, self.prefix, len(self.filler)))
self.filler.printout(self.file)
print >> self.file, "};"
print >> self.file
print >> self.file, "static const %s %s_encmap[256] = {" % (
self.indextype, self.prefix)
for i in range(256):
if i in fmap and self.prefix in fmap[i]:
self.filler.write("{", "__%s_encmap" % self.prefix, "+",
"%d" % fmap[i]['midx'], ",",
"%d," % fmap[i]['min'],
"%d" % fmap[i]['max'], "},")
else:
self.filler.write("{", "0,", "0,", "0", "},")
continue
self.filler.printout(self.file)
print >> self.file, "};"
print >> self.file
# XXX: convert all usages of this function to EncodeMapWriter
def genmap_encode(filler, prefix, emap):
for c1 in range(0, 256):
if not emap.has_key(c1):
continue
c2map = emap[c1]
rc2values = c2map.keys()
rc2values.sort()
if not rc2values:
continue
c2map[prefix] = True
c2map['min'] = rc2values[0]
c2map['max'] = rc2values[-1]
c2map['midx'] = len(filler)
for v in range(rc2values[0], rc2values[-1] + 1):
if not c2map.has_key(v):
filler.write('N,')
elif isinstance(c2map[v], int):
filler.write(str(c2map[v]) + ',')
elif isinstance(c2map[v], tuple):
filler.write('M,')
else:
raise ValueError
def print_encmap(fo, filler, fmapprefix, fmap, f2map={}, f2mapprefix=''):
print >> fo, ("static const DBCHAR __%s_encmap[%d] = {" % (
fmapprefix, len(filler)))
filler.printout(fo)
print >> fo, "};"
print >> fo
print >> fo, "static const struct unim_index %s_encmap[256] = {" % (fmapprefix)
for i in range(256):
if fmap.has_key(i) and fmap[i].has_key(fmapprefix):
map = fmap
prefix = fmapprefix
elif f2map.has_key(i) and f2map[i].has_key(f2mapprefix):
map = f2map
prefix = f2mapprefix
else:
filler.write("{", "0,", "0,", "0", "},")
continue
filler.write("{", "__%s_encmap" % prefix, "+", "%d" % map[i]['midx'],
",", "%d," % map[i]['min'], "%d" % map[i]['max'], "},")
filler.printout(fo)
print >> fo, "};"
print >> fo
def genmap_decode(filler, prefix, c1range, c2range, dmap, onlymask=(),
wide=0):
c2width = c2range[1] - c2range[0] + 1
c2values = range(c2range[0], c2range[1] + 1)
for c1 in range(c1range[0], c1range[1] + 1):
if not dmap.has_key(c1) or (onlymask and c1 not in onlymask):
continue
c2map = dmap[c1]
rc2values = [n for n in c2values if c2map.has_key(n)]
if not rc2values:
continue
c2map[prefix] = True
c2map['min'] = rc2values[0]
c2map['max'] = rc2values[-1]
c2map['midx'] = len(filler)
for v in range(rc2values[0], rc2values[-1] + 1):
if c2map.has_key(v):
filler.write('%d,' % c2map[v])
else:
filler.write('U,')
def print_decmap(fo, filler, fmapprefix, fmap, f2map={}, f2mapprefix='',
wide=0):
if not wide:
print >> fo, ("static const ucs2_t __%s_decmap[%d] = {" % (
fmapprefix, len(filler)))
width = 8
else:
print >> fo, ("static const ucs4_t __%s_decmap[%d] = {" % (
fmapprefix, len(filler)))
width = 4
filler.printout(fo)
print >> fo, "};"
print >> fo
if not wide:
print >> fo, "static const struct dbcs_index %s_decmap[256] = {" % (
fmapprefix)
else:
print >> fo, "static const struct widedbcs_index %s_decmap[256] = {" % (
fmapprefix)
for i in range(256):
if fmap.has_key(i) and fmap[i].has_key(fmapprefix):
map = fmap
prefix = fmapprefix
elif f2map.has_key(i) and f2map[i].has_key(f2mapprefix):
map = f2map
prefix = f2mapprefix
else:
filler.write("{", "0,", "0,", "0", "},")
continue
filler.write("{", "__%s_decmap" % prefix, "+", "%d" % map[i]['midx'],
",", "%d," % map[i]['min'], "%d" % map[i]['max'], "},")
filler.printout(fo)
print >> fo, "};"
print >> fo
def loadmap(fo, natcol=0, unicol=1, sbcs=0):
print "Loading from", fo
fo.seek(0, 0)
decmap = {}
for line in fo:
line = line.split('#', 1)[0].strip()
if not line or len(line.split()) < 2: continue
row = map(eval, line.split())
loc, uni = row[natcol], row[unicol]
if loc >= 0x100 or sbcs:
decmap.setdefault((loc >> 8), {})
decmap[(loc >> 8)][(loc & 0xff)] = uni
return decmap
|