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
|
#!/usr/bin/perl
# Author: Thomas Jacob, Internet24.de
# Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Simon
# Josefsson.
# Copyright (C) 2004, 2010, 2011 Free Software Foundation, Inc.
#
# This program 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 3 of the License, or
# (at your option) any later version.
#
# This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
#
# I consider the output of this program to be unrestricted. Use it as
# you will.
# See doc/tld/README and draft-hoffman-idn-reg-*.txt inside Libidn for
# more information on the input file syntax.
# Use this to generate TLD tables:
# $ ./gen-tld-tables *.tld > tlds.c
use strict;
use warnings;
die "Usage: $0 <TLD-FILE [TLD-FILE ...]>" if ($#ARGV == -1);
print "/* This file is automatically generated. DO NOT EDIT!\n";
print " Instead, edit gen-tld-tables.pl and re-run. */\n";
print "\n";
print "#include \"tld.h\"\n";
print "\n";
my @tlds;
foreach my $tldfile (@ARGV)
{
my ($tld, $version);
my $data = process_definition ($tldfile, \$tld, \$version);
push @tlds, $tld;
optimize($data);
print_tld_domain($tld, \@$data, $version);
}
print "/* Main array */\n";
print "const Tld_table * _tld_tables[] =\n";
print "{\n";
foreach (@tlds)
{
print " &_tld_${_},\n";
}
print " NULL\n";
print "};\n";
# Print tld domain structure.
# void print_tld_domain($tldfile, \$tld, \@intervals, $version);
sub print_tld_domain
{
my $tld = shift;
my $intervals = shift;
my $version = shift;
my $num_intervals = @$intervals;
print "/* TLD $tld */\n";
print "static const Tld_table_element _tld_${tld}_valid[] =\n";
print "{\n";
if (@$intervals)
{
my $last = pop @$intervals;
foreach (@$intervals)
{
printf " { 0x%x, 0x%x },\n", $_->[0], $_->[1];
}
printf " { 0x%x, 0x%x }\n", $last->[0], $last->[1];
}
print "};\n";
print "\n";
print "static const Tld_table _tld_${tld} =\n";
print "{\n";
print " \"$tld\",\n";
print " \"$version\",\n";
print " $num_intervals,\n";
print " &_tld_${tld}_valid[0]\n";
print "};\n\n";
}
# process a definition file
# $filename, \$tld, \$version
# return @data on success, die otherwise
sub process_definition
{
my $filename = shift;
my $tld = shift;
my $version = shift;
my $incversion;
my $path;
my @data;
local * FILE;
open(FILE, "<$filename") or die "Cannot open $filename";
$path = $filename;
$path =~ s/\/[^\/]+$//;
my ($is_int,$have_num,$num,$cnum);
my $line = 1;
while(<FILE>)
{
chomp;
s/#.*$//;
if (m/^include\s+(\S+)\s*$/i)
{
my $incfile = $1;
my ($junk, $ver);
my $incdata = process_definition("$path/$incfile", \$junk, \$ver);
$incversion = $incversion . " $incfile ($ver)";
push @data, @$incdata;
next;
}
if (m/^version\s+"(.*)"\s*$/i)
{
$$version = $1;
next;
}
if (m/^tld\s+(\S+)\s*$/i)
{
$$tld = $1;
next;
}
while ($_ ne "")
{
s/^\s*//;
if ( (s/^(0x)([a-f0-9]+)//i) ||
(s/^(U\+)([a-f0-9]+)//i) ||
(s/^(0)(\d+)//) ||
(s/^(\d+)//) )
{
$cnum = $1;
if (((lc($1) eq "0x") || (lc($1) eq "u+")) && $2)
{
$cnum = hex($2);
}
elsif (($1 eq "0") && $2)
{
$cnum = oct($2);
}
if ($have_num)
{
if ($is_int)
{
push @data, [$num, $cnum];
$have_num = 0;
$is_int = 0;
}
else
{
push @data, [$num,$num];
$num = $cnum;
}
}
else
{
$have_num = 1;
$num = $cnum;
}
}
elsif (s/^\-//)
{
$is_int = 1;
}
elsif (s/^\|//)
{
$is_int = 0;
}
elsif (s/^\://)
{
$is_int = 0;
}
else
{
die "Parser error in file $filename at line $line near $_, "
if $_ ne "";
}
}
$line++;
}
close(FILE);
if ($have_num)
{
if ($is_int)
{
push @data, [$num, $cnum];
}
else
{
push @data, [$num, $num];
}
}
$$version = $$version . $incversion if $incversion;
return \@data;
}
# Build minimal set of intervals.
# void optimize(\@intervals)
sub optimize
{
my $intervals = shift;
return undef unless (@$intervals);
my @intervals = sort {$a->[0] <=> $b->[0]} @$intervals;
@$intervals = ();
my $cur_int = shift @intervals;
foreach (@intervals)
{
if ($_->[0]>($cur_int->[1]+1))
{
push @$intervals, $cur_int;
$cur_int = $_;
}
else
{
if ($_->[1] > $cur_int->[1])
{
$cur_int->[1] = $_->[1];
}
}
}
push @$intervals, $cur_int;
}
|
