diff options
author | djm <> | 2010-10-01 22:59:01 +0000 |
---|---|---|
committer | djm <> | 2010-10-01 22:59:01 +0000 |
commit | fe047d8b632246cb2db3234a0a4f32e5c318857b (patch) | |
tree | 939b752540947d33507b3acc48d76a8bfb7c3dc3 /src/lib/libcrypto/util/mkstack.pl | |
parent | 2ea67f4aa254b09ded62e6e14fc893bbe6381579 (diff) | |
download | openbsd-fe047d8b632246cb2db3234a0a4f32e5c318857b.tar.gz openbsd-fe047d8b632246cb2db3234a0a4f32e5c318857b.tar.bz2 openbsd-fe047d8b632246cb2db3234a0a4f32e5c318857b.zip |
resolve conflicts, fix local changes
Diffstat (limited to 'src/lib/libcrypto/util/mkstack.pl')
-rw-r--r-- | src/lib/libcrypto/util/mkstack.pl | 74 |
1 files changed, 70 insertions, 4 deletions
diff --git a/src/lib/libcrypto/util/mkstack.pl b/src/lib/libcrypto/util/mkstack.pl index 2a968f395f..6a43757c95 100644 --- a/src/lib/libcrypto/util/mkstack.pl +++ b/src/lib/libcrypto/util/mkstack.pl | |||
@@ -21,7 +21,7 @@ while (@ARGV) { | |||
21 | } | 21 | } |
22 | 22 | ||
23 | 23 | ||
24 | @source = (<crypto/*.[ch]>, <crypto/*/*.[ch]>, <ssl/*.[ch]>); | 24 | @source = (<crypto/*.[ch]>, <crypto/*/*.[ch]>, <ssl/*.[ch]>, <apps/*.[ch]>); |
25 | foreach $file (@source) { | 25 | foreach $file (@source) { |
26 | next if -l $file; | 26 | next if -l $file; |
27 | 27 | ||
@@ -31,11 +31,19 @@ foreach $file (@source) { | |||
31 | while(<IN>) { | 31 | while(<IN>) { |
32 | if (/^DECLARE_STACK_OF\(([^)]+)\)/) { | 32 | if (/^DECLARE_STACK_OF\(([^)]+)\)/) { |
33 | push @stacklst, $1; | 33 | push @stacklst, $1; |
34 | } if (/^DECLARE_ASN1_SET_OF\(([^)]+)\)/) { | 34 | } |
35 | if (/^DECLARE_SPECIAL_STACK_OF\(([^,\s]+)\s*,\s*([^>\s]+)\)/) { | ||
36 | push @sstacklst, [$1, $2]; | ||
37 | } | ||
38 | if (/^DECLARE_ASN1_SET_OF\(([^)]+)\)/) { | ||
35 | push @asn1setlst, $1; | 39 | push @asn1setlst, $1; |
36 | } if (/^DECLARE_PKCS12_STACK_OF\(([^)]+)\)/) { | 40 | } |
41 | if (/^DECLARE_PKCS12_STACK_OF\(([^)]+)\)/) { | ||
37 | push @p12stklst, $1; | 42 | push @p12stklst, $1; |
38 | } | 43 | } |
44 | if (/^DECLARE_LHASH_OF\(([^)]+)\)/) { | ||
45 | push @lhashlst, $1; | ||
46 | } | ||
39 | } | 47 | } |
40 | close(IN); | 48 | close(IN); |
41 | } | 49 | } |
@@ -65,7 +73,7 @@ while(<IN>) { | |||
65 | foreach $type_thing (sort @stacklst) { | 73 | foreach $type_thing (sort @stacklst) { |
66 | $new_stackfile .= <<EOF; | 74 | $new_stackfile .= <<EOF; |
67 | 75 | ||
68 | #define sk_${type_thing}_new(st) SKM_sk_new($type_thing, (st)) | 76 | #define sk_${type_thing}_new(cmp) SKM_sk_new($type_thing, (cmp)) |
69 | #define sk_${type_thing}_new_null() SKM_sk_new_null($type_thing) | 77 | #define sk_${type_thing}_new_null() SKM_sk_new_null($type_thing) |
70 | #define sk_${type_thing}_free(st) SKM_sk_free($type_thing, (st)) | 78 | #define sk_${type_thing}_free(st) SKM_sk_free($type_thing, (st)) |
71 | #define sk_${type_thing}_num(st) SKM_sk_num($type_thing, (st)) | 79 | #define sk_${type_thing}_num(st) SKM_sk_num($type_thing, (st)) |
@@ -88,6 +96,39 @@ while(<IN>) { | |||
88 | #define sk_${type_thing}_is_sorted(st) SKM_sk_is_sorted($type_thing, (st)) | 96 | #define sk_${type_thing}_is_sorted(st) SKM_sk_is_sorted($type_thing, (st)) |
89 | EOF | 97 | EOF |
90 | } | 98 | } |
99 | |||
100 | foreach $type_thing (sort @sstacklst) { | ||
101 | my $t1 = $type_thing->[0]; | ||
102 | my $t2 = $type_thing->[1]; | ||
103 | $new_stackfile .= <<EOF; | ||
104 | |||
105 | #define sk_${t1}_new(cmp) ((STACK_OF($t1) *)sk_new(CHECKED_SK_CMP_FUNC($t2, cmp))) | ||
106 | #define sk_${t1}_new_null() ((STACK_OF($t1) *)sk_new_null()) | ||
107 | #define sk_${t1}_push(st, val) sk_push(CHECKED_PTR_OF(STACK_OF($t1), st), CHECKED_PTR_OF($t2, val)) | ||
108 | #define sk_${t1}_find(st, val) sk_find(CHECKED_PTR_OF(STACK_OF($t1), st), CHECKED_PTR_OF($t2, val)) | ||
109 | #define sk_${t1}_value(st, i) (($t1)sk_value(CHECKED_PTR_OF(STACK_OF($t1), st), i)) | ||
110 | #define sk_${t1}_num(st) SKM_sk_num($t1, st) | ||
111 | #define sk_${t1}_pop_free(st, free_func) sk_pop_free(CHECKED_PTR_OF(STACK_OF($t1), st), CHECKED_SK_FREE_FUNC2($t1, free_func)) | ||
112 | #define sk_${t1}_insert(st, val, i) sk_insert(CHECKED_PTR_OF(STACK_OF($t1), st), CHECKED_PTR_OF($t2, val), i) | ||
113 | #define sk_${t1}_free(st) SKM_sk_free(${t1}, st) | ||
114 | #define sk_${t1}_set(st, i, val) sk_set((_STACK *)CHECKED_PTR_OF(STACK_OF($t1), st), i, CHECKED_PTR_OF($t2, val)) | ||
115 | #define sk_${t1}_zero(st) SKM_sk_zero($t1, (st)) | ||
116 | #define sk_${t1}_unshift(st, val) sk_unshift((_STACK *)CHECKED_PTR_OF(STACK_OF($t1), st), CHECKED_PTR_OF($t2, val)) | ||
117 | #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)) | ||
118 | #define sk_${t1}_delete(st, i) SKM_sk_delete($t1, (st), (i)) | ||
119 | #define sk_${t1}_delete_ptr(st, ptr) ($t1 *)sk_delete_ptr((_STACK *)CHECKED_PTR_OF(STACK_OF($t1), st), CHECKED_PTR_OF($t2, ptr)) | ||
120 | #define sk_${t1}_set_cmp_func(st, cmp) \\ | ||
121 | ((int (*)(const $t2 * const *,const $t2 * const *)) \\ | ||
122 | sk_set_cmp_func((_STACK *)CHECKED_PTR_OF(STACK_OF($t1), st), CHECKED_SK_CMP_FUNC($t2, cmp))) | ||
123 | #define sk_${t1}_dup(st) SKM_sk_dup($t1, st) | ||
124 | #define sk_${t1}_shift(st) SKM_sk_shift($t1, (st)) | ||
125 | #define sk_${t1}_pop(st) ($t2 *)sk_pop((_STACK *)CHECKED_PTR_OF(STACK_OF($t1), st)) | ||
126 | #define sk_${t1}_sort(st) SKM_sk_sort($t1, (st)) | ||
127 | #define sk_${t1}_is_sorted(st) SKM_sk_is_sorted($t1, (st)) | ||
128 | |||
129 | EOF | ||
130 | } | ||
131 | |||
91 | foreach $type_thing (sort @asn1setlst) { | 132 | foreach $type_thing (sort @asn1setlst) { |
92 | $new_stackfile .= <<EOF; | 133 | $new_stackfile .= <<EOF; |
93 | 134 | ||
@@ -108,6 +149,31 @@ EOF | |||
108 | SKM_PKCS12_decrypt_d2i($type_thing, (algor), (d2i_func), (free_func), (pass), (passlen), (oct), (seq)) | 149 | SKM_PKCS12_decrypt_d2i($type_thing, (algor), (d2i_func), (free_func), (pass), (passlen), (oct), (seq)) |
109 | EOF | 150 | EOF |
110 | } | 151 | } |
152 | |||
153 | foreach $type_thing (sort @lhashlst) { | ||
154 | my $lc_tt = lc $type_thing; | ||
155 | $new_stackfile .= <<EOF; | ||
156 | |||
157 | #define lh_${type_thing}_new() LHM_lh_new(${type_thing},${lc_tt}) | ||
158 | #define lh_${type_thing}_insert(lh,inst) LHM_lh_insert(${type_thing},lh,inst) | ||
159 | #define lh_${type_thing}_retrieve(lh,inst) LHM_lh_retrieve(${type_thing},lh,inst) | ||
160 | #define lh_${type_thing}_delete(lh,inst) LHM_lh_delete(${type_thing},lh,inst) | ||
161 | #define lh_${type_thing}_doall(lh,fn) LHM_lh_doall(${type_thing},lh,fn) | ||
162 | #define lh_${type_thing}_doall_arg(lh,fn,arg_type,arg) \\ | ||
163 | LHM_lh_doall_arg(${type_thing},lh,fn,arg_type,arg) | ||
164 | #define lh_${type_thing}_error(lh) LHM_lh_error(${type_thing},lh) | ||
165 | #define lh_${type_thing}_num_items(lh) LHM_lh_num_items(${type_thing},lh) | ||
166 | #define lh_${type_thing}_down_load(lh) LHM_lh_down_load(${type_thing},lh) | ||
167 | #define lh_${type_thing}_node_stats_bio(lh,out) \\ | ||
168 | LHM_lh_node_stats_bio(${type_thing},lh,out) | ||
169 | #define lh_${type_thing}_node_usage_stats_bio(lh,out) \\ | ||
170 | LHM_lh_node_usage_stats_bio(${type_thing},lh,out) | ||
171 | #define lh_${type_thing}_stats_bio(lh,out) \\ | ||
172 | LHM_lh_stats_bio(${type_thing},lh,out) | ||
173 | #define lh_${type_thing}_free(lh) LHM_lh_free(${type_thing},lh) | ||
174 | EOF | ||
175 | } | ||
176 | |||
111 | $new_stackfile .= "/* End of util/mkstack.pl block, you may now edit :-) */\n"; | 177 | $new_stackfile .= "/* End of util/mkstack.pl block, you may now edit :-) */\n"; |
112 | $inside_block = 2; | 178 | $inside_block = 2; |
113 | } | 179 | } |