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
|
#! /bin/sh
#
# make-uniuni -- script for creating the file uniuni.cpp
#
# Copyright (C) 2005, 2006
# Free Software Foundation, Inc.
# Written by Werner Lemberg <wl@gnu.org>
#
# This file is part of groff.
#
# groff is free software; you can redistribute it and/or modify it under
# the terms of the GNU General Public License as published by the Free
# Software Foundation; either version 2, or (at your option) any later
# version.
#
# groff is distributed in the hope that it will be useful, but WITHOUT ANY
# WARRANTY; without even the implied warranty of MERCHANTABILITY or
# FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
# for more details.
#
# You should have received a copy of the GNU General Public License along
# with groff; see the file COPYING. If not, write to the Free Software
# Foundation, 51 Franklin St - Fifth Floor, Boston, MA 02110-1301, USA.
#
# usage:
#
# make-uniuni <version-string> < UnicodeData.txt > uniuni.cpp
#
# `UnicodeData.txt' is the central database file from the Unicode standard.
# Unfortunately, it doesn't contain a version number which must be thus
# provided manually as a parameter to the filter.
#
# This program needs a C preprocessor.
#
CPP=cpp
prog="$0"
if test $# -ne 1; then
echo "usage: $0 <version-string> < UnicodeData.txt > uniuni.cpp"
exit 1
fi
version_string="$1"
# Remove ranges and control characters,
# then extract the decomposition field,
# then remove lines without decomposition,
# then remove all compatibility decompositions.
sed -e '/^[^;]*;</d' \
| sed -e 's/;[^;]*;[^;]*;[^;]*;[^;]*;\([^;]*\);.*$/;\1/' \
| sed -e '/^[^;]*;$/d' \
| sed -e '/^[^;]*;</d' > $$1
# Prepare input for running cpp.
cat $$1 \
| sed -e 's/^\([^;]*\);/#define \1 /' \
-e 's/ / u/g' > $$2
cat $$1 \
| sed -e 's/^\([^;]*\);.*$/\1 u\1/' >> $$2
# Run C preprocessor to recursively decompose.
$CPP $$2 $$3
# Convert it back to original format.
cat $$3 \
| sed -e '/#/d' \
-e '/^$/d' \
-e 's/ \+/ /g' \
-e 's/ *$//' \
-e 's/u//g' \
-e 's/^\([^ ]*\) /\1;/' > $$4
# Write preamble.
cat <<END
// -*- C++ -*-
/* Copyright (C) 2002, 2003, 2004, 2005
Free Software Foundation, Inc.
Written by Werner Lemberg <wl@gnu.org>
This file is part of groff.
groff is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2, or (at your option) any later
version.
groff is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License along
with groff; see the file COPYING. If not, write to the Free Software
Foundation, 51 Franklin St - Fifth Floor, Boston, MA 02110-1301, USA. */
// This code has been algorithmically derived from the file
// UnicodeData.txt, version $version_string, available from unicode.org,
// on `date '+%Y-%m-%d'`.
#include "lib.h"
#include "stringclass.h"
#include "ptable.h"
#include "unicode.h"
struct unicode_decompose {
char *value;
};
declare_ptable(unicode_decompose)
implement_ptable(unicode_decompose)
PTABLE(unicode_decompose) unicode_decompose_table;
// the first digit in the composite string gives the number of composites
struct S {
const char *key;
const char *value;
} unicode_decompose_list[] = {
END
# Emit Unicode data.
cat $$4 \
| sed -e 's/ /_/g' \
-e 's/\(.*\);\(.*_.*_.*_.*\)$/ { "\1", "4\2" },/' \
-e 's/\(.*\);\(.*_.*_.*\)$/ { "\1", "3\2" },/' \
-e 's/\(.*\);\(.*_.*\)$/ { "\1", "2\2" },/' \
-e 's/\(.*\);\(.*\)$/ { "\1", "1\2" },/'
# Write postamble.
cat <<END
};
// global constructor
static struct unicode_decompose_init {
unicode_decompose_init();
} _unicode_decompose_init;
unicode_decompose_init::unicode_decompose_init()
{
for (unsigned int i = 0;
i < sizeof(unicode_decompose_list)/sizeof(unicode_decompose_list[0]);
i++) {
unicode_decompose *dec = new unicode_decompose[1];
dec->value = (char *)unicode_decompose_list[i].value;
unicode_decompose_table.define(unicode_decompose_list[i].key, dec);
}
}
const char *decompose_unicode(const char *s)
{
unicode_decompose *result = unicode_decompose_table.lookup(s);
return result ? result->value : 0;
}
END
# Remove temporary files.
rm $$1 $$2 $$3 $$4
# EOF
|
