mkstack.pl 7.7 KB

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