]>
Commit | Line | Data |
---|---|---|
e41c8d6a | 1 | #!/usr/local/bin/perl -w |
3f39e5ae | 2 | |
e41c8d6a | 3 | # This is a utility that searches out "DECLARE_STACK_OF()" |
3f39e5ae BM |
4 | # declarations in .h and .c files, and updates/creates/replaces |
5 | # the corresponding macro declarations in crypto/stack/safestack.h. | |
6 | # As it's not generally possible to have macros that generate macros, | |
7 | # we need to control this from the "outside", here in this script. | |
e41c8d6a GT |
8 | # |
9 | # Geoff Thorpe, June, 2000 (with massive Perl-hacking | |
10 | # help from Steve Robb) | |
11 | ||
3f39e5ae | 12 | my $safestack = "crypto/stack/safestack"; |
e41c8d6a | 13 | |
3f39e5ae | 14 | my $do_write; |
e41c8d6a GT |
15 | while (@ARGV) { |
16 | my $arg = $ARGV[0]; | |
3f39e5ae BM |
17 | if($arg eq "-write") { |
18 | $do_write = 1; | |
e41c8d6a | 19 | } |
3f39e5ae | 20 | shift @ARGV; |
e41c8d6a GT |
21 | } |
22 | ||
e41c8d6a | 23 | |
3c1d6bbc | 24 | @source = (<crypto/*.[ch]>, <crypto/*/*.[ch]>, <ssl/*.[ch]>, <apps/*.[ch]>); |
e41c8d6a | 25 | foreach $file (@source) { |
e41c8d6a GT |
26 | next if -l $file; |
27 | ||
28 | # Open the .c/.h file for reading | |
29 | open(IN, "< $file") || die "Can't open $file for reading: $!"; | |
e41c8d6a | 30 | |
3aceb94b DSH |
31 | while(<IN>) { |
32 | if (/^DECLARE_STACK_OF\(([^)]+)\)/) { | |
33 | push @stacklst, $1; | |
3c1d6bbc BL |
34 | } |
35 | if (/^DECLARE_ASN1_SET_OF\(([^)]+)\)/) { | |
7ef82068 | 36 | push @asn1setlst, $1; |
3c1d6bbc BL |
37 | } |
38 | if (/^DECLARE_PKCS12_STACK_OF\(([^)]+)\)/) { | |
7ef82068 | 39 | push @p12stklst, $1; |
3aceb94b | 40 | } |
3c1d6bbc BL |
41 | if (/^DECLARE_LHASH_OF\(([^)]+)\)/) { |
42 | push @lhashlst, $1; | |
43 | } | |
3aceb94b | 44 | } |
e41c8d6a | 45 | close(IN); |
e41c8d6a GT |
46 | } |
47 | ||
e41c8d6a | 48 | |
7ef82068 | 49 | |
3f39e5ae BM |
50 | my $old_stackfile = ""; |
51 | my $new_stackfile = ""; | |
52 | my $inside_block = 0; | |
53 | my $type_thing; | |
54 | ||
55 | open(IN, "< $safestack.h") || die "Can't open input file: $!"; | |
56 | while(<IN>) { | |
57 | $old_stackfile .= $_; | |
58 | ||
59 | if (m|^/\* This block of defines is updated by util/mkstack.pl, please do not touch! \*/|) { | |
60 | $inside_block = 1; | |
61 | } | |
62 | if (m|^/\* End of util/mkstack.pl block, you may now edit :-\) \*/|) { | |
63 | $inside_block = 0; | |
64 | } elsif ($inside_block == 0) { | |
65 | $new_stackfile .= $_; | |
66 | } | |
67 | next if($inside_block != 1); | |
68 | $new_stackfile .= "/* This block of defines is updated by util/mkstack.pl, please do not touch! */"; | |
69 | ||
4dd45354 | 70 | foreach $type_thing (sort @stacklst) { |
3f39e5ae | 71 | $new_stackfile .= <<EOF; |
3aceb94b | 72 | |
3f39e5ae BM |
73 | #define sk_${type_thing}_new(st) SKM_sk_new($type_thing, (st)) |
74 | #define sk_${type_thing}_new_null() SKM_sk_new_null($type_thing) | |
75 | #define sk_${type_thing}_free(st) SKM_sk_free($type_thing, (st)) | |
76 | #define sk_${type_thing}_num(st) SKM_sk_num($type_thing, (st)) | |
77 | #define sk_${type_thing}_value(st, i) SKM_sk_value($type_thing, (st), (i)) | |
78 | #define sk_${type_thing}_set(st, i, val) SKM_sk_set($type_thing, (st), (i), (val)) | |
79 | #define sk_${type_thing}_zero(st) SKM_sk_zero($type_thing, (st)) | |
80 | #define sk_${type_thing}_push(st, val) SKM_sk_push($type_thing, (st), (val)) | |
81 | #define sk_${type_thing}_unshift(st, val) SKM_sk_unshift($type_thing, (st), (val)) | |
82 | #define sk_${type_thing}_find(st, val) SKM_sk_find($type_thing, (st), (val)) | |
26851b6b | 83 | #define sk_${type_thing}_find_ex(st, val) SKM_sk_find_ex($type_thing, (st), (val)) |
3f39e5ae BM |
84 | #define sk_${type_thing}_delete(st, i) SKM_sk_delete($type_thing, (st), (i)) |
85 | #define sk_${type_thing}_delete_ptr(st, ptr) SKM_sk_delete_ptr($type_thing, (st), (ptr)) | |
86 | #define sk_${type_thing}_insert(st, val, i) SKM_sk_insert($type_thing, (st), (val), (i)) | |
87 | #define sk_${type_thing}_set_cmp_func(st, cmp) SKM_sk_set_cmp_func($type_thing, (st), (cmp)) | |
88 | #define sk_${type_thing}_dup(st) SKM_sk_dup($type_thing, st) | |
89 | #define sk_${type_thing}_pop_free(st, free_func) SKM_sk_pop_free($type_thing, (st), (free_func)) | |
90 | #define sk_${type_thing}_shift(st) SKM_sk_shift($type_thing, (st)) | |
91 | #define sk_${type_thing}_pop(st) SKM_sk_pop($type_thing, (st)) | |
92 | #define sk_${type_thing}_sort(st) SKM_sk_sort($type_thing, (st)) | |
2f605e8d | 93 | #define sk_${type_thing}_is_sorted(st) SKM_sk_is_sorted($type_thing, (st)) |
7ef82068 DSH |
94 | EOF |
95 | } | |
4dd45354 | 96 | foreach $type_thing (sort @asn1setlst) { |
7ef82068 DSH |
97 | $new_stackfile .= <<EOF; |
98 | ||
99 | #define d2i_ASN1_SET_OF_${type_thing}(st, pp, length, d2i_func, free_func, ex_tag, ex_class) \\ | |
100 | SKM_ASN1_SET_OF_d2i($type_thing, (st), (pp), (length), (d2i_func), (free_func), (ex_tag), (ex_class)) | |
101 | #define i2d_ASN1_SET_OF_${type_thing}(st, pp, i2d_func, ex_tag, ex_class, is_set) \\ | |
102 | SKM_ASN1_SET_OF_i2d($type_thing, (st), (pp), (i2d_func), (ex_tag), (ex_class), (is_set)) | |
103 | #define ASN1_seq_pack_${type_thing}(st, i2d_func, buf, len) \\ | |
104 | SKM_ASN1_seq_pack($type_thing, (st), (i2d_func), (buf), (len)) | |
105 | #define ASN1_seq_unpack_${type_thing}(buf, len, d2i_func, free_func) \\ | |
106 | SKM_ASN1_seq_unpack($type_thing, (buf), (len), (d2i_func), (free_func)) | |
107 | EOF | |
108 | } | |
4dd45354 | 109 | foreach $type_thing (sort @p12stklst) { |
7ef82068 DSH |
110 | $new_stackfile .= <<EOF; |
111 | ||
112 | #define PKCS12_decrypt_d2i_${type_thing}(algor, d2i_func, free_func, pass, passlen, oct, seq) \\ | |
113 | SKM_PKCS12_decrypt_d2i($type_thing, (algor), (d2i_func), (free_func), (pass), (passlen), (oct), (seq)) | |
3aceb94b DSH |
114 | EOF |
115 | } | |
3c1d6bbc BL |
116 | |
117 | foreach $type_thing (sort @lhashlst) { | |
118 | my $lc_tt = lc $type_thing; | |
119 | $new_stackfile .= <<EOF; | |
120 | ||
121 | #define lh_${type_thing}_new() LHM_lh_new(${type_thing},${lc_tt}) | |
122 | #define lh_${type_thing}_insert(lh,inst) LHM_lh_insert(${type_thing},lh,inst) | |
123 | #define lh_${type_thing}_retrieve(lh,inst) LHM_lh_retrieve(${type_thing},lh,inst) | |
124 | #define lh_${type_thing}_delete(lh,inst) LHM_lh_delete(${type_thing},lh,inst) | |
125 | #define lh_${type_thing}_doall(lh,fn) LHM_lh_doall(${type_thing},lh,fn) | |
126 | #define lh_${type_thing}_doall_arg(lh,fn,arg_type,arg) \\ | |
127 | LHM_lh_doall_arg(${type_thing},lh,fn,arg_type,arg) | |
128 | #define lh_${type_thing}_error(lh) LHM_lh_error(${type_thing},lh) | |
129 | #define lh_${type_thing}_num_items(lh) LHM_lh_num_items(${type_thing},lh) | |
130 | #define lh_${type_thing}_down_load(lh) LHM_lh_down_load(${type_thing},lh) | |
131 | #define lh_${type_thing}_node_stats_bio(lh,out) \\ | |
132 | LHM_lh_node_stats_bio(${type_thing},lh,out) | |
133 | #define lh_${type_thing}_node_usage_stats_bio(lh,out) \\ | |
134 | LHM_lh_node_usage_stats_bio(${type_thing},lh,out) | |
135 | #define lh_${type_thing}_stats_bio(lh,out) \\ | |
136 | LHM_lh_stats_bio(${type_thing},lh,out) | |
137 | #define lh_${type_thing}_free(lh) LHM_lh_free(${type_thing},lh) | |
138 | EOF | |
139 | } | |
140 | ||
3f39e5ae | 141 | $new_stackfile .= "/* End of util/mkstack.pl block, you may now edit :-) */\n"; |
3aceb94b | 142 | $inside_block = 2; |
3f39e5ae BM |
143 | } |
144 | ||
145 | ||
146 | if ($new_stackfile eq $old_stackfile) { | |
147 | print "No changes to $safestack.h.\n"; | |
148 | exit 0; # avoid unnecessary rebuild | |
149 | } | |
150 | ||
151 | if ($do_write) { | |
152 | print "Writing new $safestack.h.\n"; | |
153 | open OUT, ">$safestack.h" || die "Can't open output file"; | |
154 | print OUT $new_stackfile; | |
3aceb94b | 155 | close OUT; |
e41c8d6a | 156 | } |