You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
116 lines
1.9 KiB
116 lines
1.9 KiB
4 years ago
|
#!/usr/local/bin/perl
|
||
|
|
|
||
|
|
use strict;
|
||
|
|
|
||
|
|
my %xref_tbl;
|
||
|
|
my %oid_tbl;
|
||
|
|
|
||
|
|
my ($mac_file, $xref_file) = @ARGV;
|
||
|
|
|
||
|
|
open(IN, $mac_file) || die "Can't open $mac_file";
|
||
|
|
|
||
|
|
# Read in OID nid values for a lookup table.
|
||
|
|
|
||
|
|
while (<IN>)
|
||
|
|
{
|
||
|
|
chomp;
|
||
|
|
my ($name, $num) = /^(\S+)\s+(\S+)$/;
|
||
|
|
$oid_tbl{$name} = $num;
|
||
|
|
}
|
||
|
|
close IN;
|
||
|
|
|
||
|
|
open(IN, $xref_file) || die "Can't open $xref_file";
|
||
|
|
|
||
|
|
my $ln = 1;
|
||
|
|
|
||
|
|
while (<IN>)
|
||
|
|
{
|
||
|
|
chomp;
|
||
|
|
s/#.*$//;
|
||
|
|
next if (/^\S*$/);
|
||
|
|
my ($xr, $p1, $p2) = /^(\S+)\s+(\S+)\s+(\S+)/;
|
||
|
|
check_oid($xr);
|
||
|
|
check_oid($p1);
|
||
|
|
check_oid($p2);
|
||
|
|
$xref_tbl{$xr} = [$p1, $p2, $ln];
|
||
|
|
}
|
||
|
|
|
||
|
|
my @xrkeys = keys %xref_tbl;
|
||
|
|
|
||
|
|
my @srt1 = sort { $oid_tbl{$a} <=> $oid_tbl{$b}} @xrkeys;
|
||
|
|
|
||
|
|
for(my $i = 0; $i <= $#srt1; $i++)
|
||
|
|
{
|
||
|
|
$xref_tbl{$srt1[$i]}[2] = $i;
|
||
|
|
}
|
||
|
|
|
||
|
|
my @srt2 = sort
|
||
|
|
{
|
||
|
|
my$ap1 = $oid_tbl{$xref_tbl{$a}[0]};
|
||
|
|
my$bp1 = $oid_tbl{$xref_tbl{$b}[0]};
|
||
|
|
return $ap1 - $bp1 if ($ap1 != $bp1);
|
||
|
|
my$ap2 = $oid_tbl{$xref_tbl{$a}[1]};
|
||
|
|
my$bp2 = $oid_tbl{$xref_tbl{$b}[1]};
|
||
|
|
|
||
|
|
return $ap2 - $bp2;
|
||
|
|
} @xrkeys;
|
||
|
|
|
||
|
|
my $pname = $0;
|
||
|
|
|
||
|
|
$pname =~ s|^.[^/]/||;
|
||
|
|
|
||
|
|
print <<EOF;
|
||
|
|
/* AUTOGENERATED BY $pname, DO NOT EDIT */
|
||
|
|
|
||
|
|
typedef struct {
|
||
|
|
int sign_id;
|
||
|
|
int hash_id;
|
||
|
|
int pkey_id;
|
||
|
|
} nid_triple;
|
||
|
|
|
||
|
|
static const nid_triple sigoid_srt[] = {
|
||
|
|
EOF
|
||
|
|
|
||
|
|
foreach (@srt1)
|
||
|
|
{
|
||
|
|
my $xr = $_;
|
||
|
|
my ($p1, $p2) = @{$xref_tbl{$_}};
|
||
|
|
my $o1 = " {NID_$xr, NID_$p1,";
|
||
|
|
my $o2 = "NID_$p2},";
|
||
|
|
if (length("$o1 $o2") < 78)
|
||
|
|
{
|
||
|
|
print "$o1 $o2\n";
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
print "$o1\n $o2\n";
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
print "};";
|
||
|
|
print <<EOF;
|
||
|
|
|
||
|
|
|
||
|
|
static const nid_triple *const sigoid_srt_xref[] = {
|
||
|
|
EOF
|
||
|
|
|
||
|
|
foreach (@srt2)
|
||
|
|
{
|
||
|
|
my ($p1, $p2, $x) = @{$xref_tbl{$_}};
|
||
|
|
# If digest or signature algorithm is "undef" then the algorithm
|
||
|
|
# needs special handling and is excluded from the cross reference table.
|
||
|
|
next if $p1 eq "undef" || $p2 eq "undef";
|
||
|
|
print " \&sigoid_srt\[$x\],\n";
|
||
|
|
}
|
||
|
|
|
||
|
|
print "};\n";
|
||
|
|
|
||
|
|
sub check_oid
|
||
|
|
{
|
||
|
|
my ($chk) = @_;
|
||
|
|
if (!exists $oid_tbl{$chk})
|
||
|
|
{
|
||
|
|
die "Not Found \"$chk\"\n";
|
||
|
|
}
|
||
|
|
}
|