1#!/usr/local/bin/perl -w 2 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. 8# 9# Geoff Thorpe, June, 2000 (with massive Perl-hacking 10# help from Steve Robb) 11 12my $safestack = "crypto/stack/safestack"; 13 14my $do_write; 15while (@ARGV) { 16 my $arg = $ARGV[0]; 17 if($arg eq "-write") { 18 $do_write = 1; 19 } 20 shift @ARGV; 21} 22 23 24@source = (<crypto/*.[ch]>, <crypto/*/*.[ch]>, <ssl/*.[ch]>, <apps/*.[ch]>); 25foreach $file (@source) { 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: $!"; 30 31 while(<IN>) { 32 if (/^DECLARE_STACK_OF\(([^)]+)\)/) { 33 push @stacklst, $1; 34 } 35 if (/^DECLARE_SPECIAL_STACK_OF\(([^,\s]+)\s*,\s*([^>\s]+)\)/) { 36 push @sstacklst, [$1, $2]; 37 } 38 if (/^DECLARE_ASN1_SET_OF\(([^)]+)\)/) { 39 push @asn1setlst, $1; 40 } 41 if (/^DECLARE_PKCS12_STACK_OF\(([^)]+)\)/) { 42 push @p12stklst, $1; 43 } 44 if (/^DECLARE_LHASH_OF\(([^)]+)\)/) { 45 push @lhashlst, $1; 46 } 47 } 48 close(IN); 49} 50 51 52 53my $old_stackfile = ""; 54my $new_stackfile = ""; 55my $inside_block = 0; 56my $type_thing; 57 58open(IN, "< $safestack.h") || die "Can't open input file: $!"; 59while(<IN>) { 60 $old_stackfile .= $_; 61 62 if (m|^/\* This block of defines is updated by util/mkstack.pl, please do not touch! \*/|) { 63 $inside_block = 1; 64 } 65 if (m|^/\* End of util/mkstack.pl block, you may now edit :-\) \*/|) { 66 $inside_block = 0; 67 } elsif ($inside_block == 0) { 68 $new_stackfile .= $_; 69 } 70 next if($inside_block != 1); 71 $new_stackfile .= "/* This block of defines is updated by util/mkstack.pl, please do not touch! */"; 72 73 foreach $type_thing (sort @stacklst) { 74 $new_stackfile .= <<EOF; 75 76#define sk_${type_thing}_new(cmp) SKM_sk_new($type_thing, (cmp)) 77#define sk_${type_thing}_new_null() SKM_sk_new_null($type_thing) 78#define sk_${type_thing}_free(st) SKM_sk_free($type_thing, (st)) 79#define sk_${type_thing}_num(st) SKM_sk_num($type_thing, (st)) 80#define sk_${type_thing}_value(st, i) SKM_sk_value($type_thing, (st), (i)) 81#define sk_${type_thing}_set(st, i, val) SKM_sk_set($type_thing, (st), (i), (val)) 82#define sk_${type_thing}_zero(st) SKM_sk_zero($type_thing, (st)) 83#define sk_${type_thing}_push(st, val) SKM_sk_push($type_thing, (st), (val)) 84#define sk_${type_thing}_unshift(st, val) SKM_sk_unshift($type_thing, (st), (val)) 85#define sk_${type_thing}_find(st, val) SKM_sk_find($type_thing, (st), (val)) 86#define sk_${type_thing}_find_ex(st, val) SKM_sk_find_ex($type_thing, (st), (val)) 87#define sk_${type_thing}_delete(st, i) SKM_sk_delete($type_thing, (st), (i)) 88#define sk_${type_thing}_delete_ptr(st, ptr) SKM_sk_delete_ptr($type_thing, (st), (ptr)) 89#define sk_${type_thing}_insert(st, val, i) SKM_sk_insert($type_thing, (st), (val), (i)) 90#define sk_${type_thing}_set_cmp_func(st, cmp) SKM_sk_set_cmp_func($type_thing, (st), (cmp)) 91#define sk_${type_thing}_dup(st) SKM_sk_dup($type_thing, st) 92#define sk_${type_thing}_pop_free(st, free_func) SKM_sk_pop_free($type_thing, (st), (free_func)) 93#define sk_${type_thing}_deep_copy(st, copy_func, free_func) SKM_sk_deep_copy($type_thing, (st), (copy_func), (free_func)) 94#define sk_${type_thing}_shift(st) SKM_sk_shift($type_thing, (st)) 95#define sk_${type_thing}_pop(st) SKM_sk_pop($type_thing, (st)) 96#define sk_${type_thing}_sort(st) SKM_sk_sort($type_thing, (st)) 97#define sk_${type_thing}_is_sorted(st) SKM_sk_is_sorted($type_thing, (st)) 98EOF 99 } 100 101 foreach $type_thing (sort { $a->[0] cmp $b->[0]} @sstacklst) { 102 my $t1 = $type_thing->[0]; 103 my $t2 = $type_thing->[1]; 104 $new_stackfile .= <<EOF; 105 106#define sk_${t1}_new(cmp) ((STACK_OF($t1) *)sk_new(CHECKED_SK_CMP_FUNC($t2, cmp))) 107#define sk_${t1}_new_null() ((STACK_OF($t1) *)sk_new_null()) 108#define sk_${t1}_push(st, val) sk_push(CHECKED_STACK_OF($t1, st), CHECKED_PTR_OF($t2, val)) 109#define sk_${t1}_find(st, val) sk_find(CHECKED_STACK_OF($t1, st), CHECKED_PTR_OF($t2, val)) 110#define sk_${t1}_value(st, i) (($t1)sk_value(CHECKED_STACK_OF($t1, st), i)) 111#define sk_${t1}_num(st) SKM_sk_num($t1, st) 112#define sk_${t1}_pop_free(st, free_func) sk_pop_free(CHECKED_STACK_OF($t1, st), CHECKED_SK_FREE_FUNC($t2, free_func)) 113#define sk_${t1}_deep_copy(st, copy_func, free_func) ((STACK_OF($t1) *)sk_deep_copy(CHECKED_STACK_OF($t1, st), CHECKED_SK_COPY_FUNC($t2, copy_func), CHECKED_SK_FREE_FUNC($t2, free_func))) 114#define sk_${t1}_insert(st, val, i) sk_insert(CHECKED_STACK_OF($t1, st), CHECKED_PTR_OF($t2, val), i) 115#define sk_${t1}_free(st) SKM_sk_free(${t1}, st) 116#define sk_${t1}_set(st, i, val) sk_set(CHECKED_STACK_OF($t1, st), i, CHECKED_PTR_OF($t2, val)) 117#define sk_${t1}_zero(st) SKM_sk_zero($t1, (st)) 118#define sk_${t1}_unshift(st, val) sk_unshift(CHECKED_STACK_OF($t1, st), CHECKED_PTR_OF($t2, val)) 119#define sk_${t1}_find_ex(st, val) sk_find_ex((_STACK *)CHECKED_CONST_PTR_OF(STACK_OF($t1), st), CHECKED_CONST_PTR_OF($t2, val)) 120#define sk_${t1}_delete(st, i) SKM_sk_delete($t1, (st), (i)) 121#define sk_${t1}_delete_ptr(st, ptr) ($t1 *)sk_delete_ptr(CHECKED_STACK_OF($t1, st), CHECKED_PTR_OF($t2, ptr)) 122#define sk_${t1}_set_cmp_func(st, cmp) \\ 123 ((int (*)(const $t2 * const *,const $t2 * const *)) \\ 124 sk_set_cmp_func(CHECKED_STACK_OF($t1, st), CHECKED_SK_CMP_FUNC($t2, cmp))) 125#define sk_${t1}_dup(st) SKM_sk_dup($t1, st) 126#define sk_${t1}_shift(st) SKM_sk_shift($t1, (st)) 127#define sk_${t1}_pop(st) ($t2 *)sk_pop(CHECKED_STACK_OF($t1, st)) 128#define sk_${t1}_sort(st) SKM_sk_sort($t1, (st)) 129#define sk_${t1}_is_sorted(st) SKM_sk_is_sorted($t1, (st)) 130 131EOF 132 } 133 134 foreach $type_thing (sort @asn1setlst) { 135 $new_stackfile .= <<EOF; 136 137#define d2i_ASN1_SET_OF_${type_thing}(st, pp, length, d2i_func, free_func, ex_tag, ex_class) \\ 138 SKM_ASN1_SET_OF_d2i($type_thing, (st), (pp), (length), (d2i_func), (free_func), (ex_tag), (ex_class)) 139#define i2d_ASN1_SET_OF_${type_thing}(st, pp, i2d_func, ex_tag, ex_class, is_set) \\ 140 SKM_ASN1_SET_OF_i2d($type_thing, (st), (pp), (i2d_func), (ex_tag), (ex_class), (is_set)) 141#define ASN1_seq_pack_${type_thing}(st, i2d_func, buf, len) \\ 142 SKM_ASN1_seq_pack($type_thing, (st), (i2d_func), (buf), (len)) 143#define ASN1_seq_unpack_${type_thing}(buf, len, d2i_func, free_func) \\ 144 SKM_ASN1_seq_unpack($type_thing, (buf), (len), (d2i_func), (free_func)) 145EOF 146 } 147 foreach $type_thing (sort @p12stklst) { 148 $new_stackfile .= <<EOF; 149 150#define PKCS12_decrypt_d2i_${type_thing}(algor, d2i_func, free_func, pass, passlen, oct, seq) \\ 151 SKM_PKCS12_decrypt_d2i($type_thing, (algor), (d2i_func), (free_func), (pass), (passlen), (oct), (seq)) 152EOF 153 } 154 155 foreach $type_thing (sort @lhashlst) { 156 my $lc_tt = lc $type_thing; 157 $new_stackfile .= <<EOF; 158 159#define lh_${type_thing}_new() LHM_lh_new(${type_thing},${lc_tt}) 160#define lh_${type_thing}_insert(lh,inst) LHM_lh_insert(${type_thing},lh,inst) 161#define lh_${type_thing}_retrieve(lh,inst) LHM_lh_retrieve(${type_thing},lh,inst) 162#define lh_${type_thing}_delete(lh,inst) LHM_lh_delete(${type_thing},lh,inst) 163#define lh_${type_thing}_doall(lh,fn) LHM_lh_doall(${type_thing},lh,fn) 164#define lh_${type_thing}_doall_arg(lh,fn,arg_type,arg) \\ 165 LHM_lh_doall_arg(${type_thing},lh,fn,arg_type,arg) 166#define lh_${type_thing}_error(lh) LHM_lh_error(${type_thing},lh) 167#define lh_${type_thing}_num_items(lh) LHM_lh_num_items(${type_thing},lh) 168#define lh_${type_thing}_down_load(lh) LHM_lh_down_load(${type_thing},lh) 169#define lh_${type_thing}_node_stats_bio(lh,out) \\ 170 LHM_lh_node_stats_bio(${type_thing},lh,out) 171#define lh_${type_thing}_node_usage_stats_bio(lh,out) \\ 172 LHM_lh_node_usage_stats_bio(${type_thing},lh,out) 173#define lh_${type_thing}_stats_bio(lh,out) \\ 174 LHM_lh_stats_bio(${type_thing},lh,out) 175#define lh_${type_thing}_free(lh) LHM_lh_free(${type_thing},lh) 176EOF 177 } 178 179 $new_stackfile .= "/* End of util/mkstack.pl block, you may now edit :-) */\n"; 180 $inside_block = 2; 181} 182 183 184if ($new_stackfile eq $old_stackfile) { 185 print "No changes to $safestack.h.\n"; 186 exit 0; # avoid unnecessary rebuild 187} 188 189if ($do_write) { 190 print "Writing new $safestack.h.\n"; 191 open OUT, ">$safestack.h" || die "Can't open output file"; 192 print OUT $new_stackfile; 193 close OUT; 194} 195