1 #!/usr/local/bin/perl -w
3 # This is a utility that searches out "DECLARE_STACK_OF()"
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.
9 # Geoff Thorpe, June, 2000 (with massive Perl-hacking
10 # help from Steve Robb)
12 my $safestack = "crypto/stack/safestack";
17 if($arg eq "-write") {
24 @source = (<crypto/*.[ch]>, <crypto/*/*.[ch]>, <ssl/*.[ch]>, <apps/*.[ch]>);
25 foreach $file (@source) {
28 # Open the .c/.h file for reading
29 open(IN, "< $file") || die "Can't open $file for reading: $!";
32 if (/^DECLARE_STACK_OF\(([^)]+)\)/) {
35 if (/^DECLARE_ASN1_SET_OF\(([^)]+)\)/) {
38 if (/^DECLARE_PKCS12_STACK_OF\(([^)]+)\)/) {
41 if (/^DECLARE_LHASH_OF\(([^)]+)\)/) {
50 my $old_stackfile = "";
51 my $new_stackfile = "";
55 open(IN, "< $safestack.h") || die "Can't open input file: $!";
59 if (m|^/\* This block of defines is updated by util/mkstack.pl, please do not touch! \*/|) {
62 if (m|^/\* End of util/mkstack.pl block, you may now edit :-\) \*/|) {
64 } elsif ($inside_block == 0) {
67 next if($inside_block != 1);
68 $new_stackfile .= "/* This block of defines is updated by util/mkstack.pl, please do not touch! */";
70 foreach $type_thing (sort @stacklst) {
71 $new_stackfile .= <<EOF;
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))
83 #define sk_${type_thing}_find_ex(st, val) SKM_sk_find_ex($type_thing, (st), (val))
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))
93 #define sk_${type_thing}_is_sorted(st) SKM_sk_is_sorted($type_thing, (st))
96 foreach $type_thing (sort @asn1setlst) {
97 $new_stackfile .= <<EOF;
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))
109 foreach $type_thing (sort @p12stklst) {
110 $new_stackfile .= <<EOF;
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))
117 foreach $type_thing (sort @lhashlst) {
118 my $lc_tt = lc $type_thing;
119 $new_stackfile .= <<EOF;
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)
141 $new_stackfile .= "/* End of util/mkstack.pl block, you may now edit :-) */\n";
146 if ($new_stackfile eq $old_stackfile) {
147 print "No changes to $safestack.h.\n";
148 exit 0; # avoid unnecessary rebuild
152 print "Writing new $safestack.h.\n";
153 open OUT, ">$safestack.h" || die "Can't open output file";
154 print OUT $new_stackfile;