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
|
#!/usr/bin/perl
#
use strict;
my %FTAB = ();
while (<STDIN>) {
if (/^\s*int\s+([_a-zA-Z0-9]+)\(.*\)\s+\/\*\s+DESC:\s+(.+)\s+\*\/\s*/) {
my ($fname,$fdesc) = ($1,$2);
my $fid = $fname;
$fid =~ s/^mpf_//;
$fid =~ tr/_/-/;
$FTAB{$fid} = { 'ID' => $fid, 'DESC' => $fdesc, 'NAME' => $fname };
}
}
my @FLST = ();
foreach my $k (sort keys %FTAB) {
push @FLST,$FTAB{$k}
}
#
# Binary tree
#
my $r = undef;
sub addnode {
my ($r,$n) = @_;
if ($r) {
if ($r->{ID} lt $n->{ID}) {
$r->{LEFT} = addnode($r->{LEFT},$n);
} elsif ($r->{ID} gt $n->{ID}) {
$r->{RIGHT} = addnode($r->{RIGHT},$n);
} else {
die "DUPLICATE FUNCTION: $n->{ID}";
}
return $r;
} else {
return $n;
}
}
sub showref {
my ($n) = @_;
if ($n) {
return "_node_$n->{NAME}";
} else {
return "NULL";
}
}
sub outnode {
my ($r) = @_;
print "struct _mpf_functions _node_$r->{NAME} [] = { {\n";
print " ",showref($r->{LEFT}),",",showref($r->{RIGHT}),",\n";
print " \"$r->{ID}\",$r->{NAME},LL(\"$r->{DESC}\"),1\n";
print "} };\n";
}
sub dumptree {
my ($r) = @_;
if ($r) {
dumptree($r->{LEFT});
dumptree($r->{RIGHT});
outnode($r);
}
}
#
# Navigate list...
#
sub navlist {
my ($l,$s,$c) = @_;
return unless ($c);
my $m = int($c/2);
$r = addnode($r,$l->[$s+$m]);
navlist($l,$s,$m);
++$m;
navlist($l,$s+$m, $c-$m);
}
navlist(\@FLST,0,scalar(@FLST));
dumptree($r);
print "struct _mpf_functions *mpf_functions = ",showref($r),";\n";
|
