diff options
Diffstat (limited to 'src/lib/libssl')
-rw-r--r-- | src/lib/libssl/pqueue.c (renamed from src/lib/libssl/src/crypto/pqueue/pqueue.c) | 21 | ||||
-rw-r--r-- | src/lib/libssl/pqueue.h (renamed from src/lib/libssl/src/crypto/pqueue/pqueue.h) | 1 | ||||
-rw-r--r-- | src/lib/libssl/shlib_version | 2 | ||||
-rw-r--r-- | src/lib/libssl/src/ssl/pqueue.c | 222 | ||||
-rw-r--r-- | src/lib/libssl/src/ssl/pqueue.h | 92 | ||||
-rw-r--r-- | src/lib/libssl/ssl/Makefile | 7 | ||||
-rw-r--r-- | src/lib/libssl/ssl/shlib_version | 2 |
7 files changed, 323 insertions, 24 deletions
diff --git a/src/lib/libssl/src/crypto/pqueue/pqueue.c b/src/lib/libssl/pqueue.c index fc68ae19c3..99c118c3b6 100644 --- a/src/lib/libssl/src/crypto/pqueue/pqueue.c +++ b/src/lib/libssl/pqueue.c | |||
@@ -57,8 +57,7 @@ | |||
57 | * | 57 | * |
58 | */ | 58 | */ |
59 | 59 | ||
60 | #include "cryptlib.h" | 60 | #include <string.h> |
61 | #include <openssl/bn.h> | ||
62 | #include "pqueue.h" | 61 | #include "pqueue.h" |
63 | 62 | ||
64 | typedef struct _pqueue { | 63 | typedef struct _pqueue { |
@@ -175,7 +174,8 @@ pqueue_find(pqueue_s *pq, unsigned char *prio64be) | |||
175 | return NULL; | 174 | return NULL; |
176 | 175 | ||
177 | for (next = pq->items; next != NULL; next = next->next) { | 176 | for (next = pq->items; next != NULL; next = next->next) { |
178 | if (memcmp(next->priority, prio64be, 8) == 0) { | 177 | if (memcmp(next->priority, prio64be, |
178 | sizeof(next->priority)) == 0) { | ||
179 | found = next; | 179 | found = next; |
180 | break; | 180 | break; |
181 | } | 181 | } |
@@ -187,21 +187,6 @@ pqueue_find(pqueue_s *pq, unsigned char *prio64be) | |||
187 | return found; | 187 | return found; |
188 | } | 188 | } |
189 | 189 | ||
190 | void | ||
191 | pqueue_print(pqueue_s *pq) | ||
192 | { | ||
193 | pitem *item = pq->items; | ||
194 | |||
195 | while (item != NULL) { | ||
196 | printf("item\t%02x%02x%02x%02x%02x%02x%02x%02x\n", | ||
197 | item->priority[0], item->priority[1], | ||
198 | item->priority[2], item->priority[3], | ||
199 | item->priority[4], item->priority[5], | ||
200 | item->priority[6], item->priority[7]); | ||
201 | item = item->next; | ||
202 | } | ||
203 | } | ||
204 | |||
205 | pitem * | 190 | pitem * |
206 | pqueue_iterator(pqueue_s *pq) | 191 | pqueue_iterator(pqueue_s *pq) |
207 | { | 192 | { |
diff --git a/src/lib/libssl/src/crypto/pqueue/pqueue.h b/src/lib/libssl/pqueue.h index 729e9abaf2..6e7df8f35b 100644 --- a/src/lib/libssl/src/crypto/pqueue/pqueue.h +++ b/src/lib/libssl/pqueue.h | |||
@@ -87,7 +87,6 @@ pitem *pqueue_find(pqueue pq, unsigned char *prio64be); | |||
87 | pitem *pqueue_iterator(pqueue pq); | 87 | pitem *pqueue_iterator(pqueue pq); |
88 | pitem *pqueue_next(piterator *iter); | 88 | pitem *pqueue_next(piterator *iter); |
89 | 89 | ||
90 | void pqueue_print(pqueue pq); | ||
91 | int pqueue_size(pqueue pq); | 90 | int pqueue_size(pqueue pq); |
92 | 91 | ||
93 | #endif /* ! HEADER_PQUEUE_H */ | 92 | #endif /* ! HEADER_PQUEUE_H */ |
diff --git a/src/lib/libssl/shlib_version b/src/lib/libssl/shlib_version index 906022aa66..aa54cbb404 100644 --- a/src/lib/libssl/shlib_version +++ b/src/lib/libssl/shlib_version | |||
@@ -1,2 +1,2 @@ | |||
1 | major=24 | 1 | major=24 |
2 | minor=0 | 2 | minor=1 |
diff --git a/src/lib/libssl/src/ssl/pqueue.c b/src/lib/libssl/src/ssl/pqueue.c new file mode 100644 index 0000000000..99c118c3b6 --- /dev/null +++ b/src/lib/libssl/src/ssl/pqueue.c | |||
@@ -0,0 +1,222 @@ | |||
1 | /* crypto/pqueue/pqueue.c */ | ||
2 | /* | ||
3 | * DTLS implementation written by Nagendra Modadugu | ||
4 | * (nagendra@cs.stanford.edu) for the OpenSSL project 2005. | ||
5 | */ | ||
6 | /* ==================================================================== | ||
7 | * Copyright (c) 1999-2005 The OpenSSL Project. All rights reserved. | ||
8 | * | ||
9 | * Redistribution and use in source and binary forms, with or without | ||
10 | * modification, are permitted provided that the following conditions | ||
11 | * are met: | ||
12 | * | ||
13 | * 1. Redistributions of source code must retain the above copyright | ||
14 | * notice, this list of conditions and the following disclaimer. | ||
15 | * | ||
16 | * 2. Redistributions in binary form must reproduce the above copyright | ||
17 | * notice, this list of conditions and the following disclaimer in | ||
18 | * the documentation and/or other materials provided with the | ||
19 | * distribution. | ||
20 | * | ||
21 | * 3. All advertising materials mentioning features or use of this | ||
22 | * software must display the following acknowledgment: | ||
23 | * "This product includes software developed by the OpenSSL Project | ||
24 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
25 | * | ||
26 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
27 | * endorse or promote products derived from this software without | ||
28 | * prior written permission. For written permission, please contact | ||
29 | * openssl-core@OpenSSL.org. | ||
30 | * | ||
31 | * 5. Products derived from this software may not be called "OpenSSL" | ||
32 | * nor may "OpenSSL" appear in their names without prior written | ||
33 | * permission of the OpenSSL Project. | ||
34 | * | ||
35 | * 6. Redistributions of any form whatsoever must retain the following | ||
36 | * acknowledgment: | ||
37 | * "This product includes software developed by the OpenSSL Project | ||
38 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
39 | * | ||
40 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
41 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
43 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
44 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
45 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
46 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
47 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
49 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
50 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
51 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
52 | * ==================================================================== | ||
53 | * | ||
54 | * This product includes cryptographic software written by Eric Young | ||
55 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
56 | * Hudson (tjh@cryptsoft.com). | ||
57 | * | ||
58 | */ | ||
59 | |||
60 | #include <string.h> | ||
61 | #include "pqueue.h" | ||
62 | |||
63 | typedef struct _pqueue { | ||
64 | pitem *items; | ||
65 | int count; | ||
66 | } pqueue_s; | ||
67 | |||
68 | pitem * | ||
69 | pitem_new(unsigned char *prio64be, void *data) | ||
70 | { | ||
71 | pitem *item = (pitem *)malloc(sizeof(pitem)); | ||
72 | |||
73 | if (item == NULL) | ||
74 | return NULL; | ||
75 | |||
76 | memcpy(item->priority, prio64be, sizeof(item->priority)); | ||
77 | |||
78 | item->data = data; | ||
79 | item->next = NULL; | ||
80 | |||
81 | return item; | ||
82 | } | ||
83 | |||
84 | void | ||
85 | pitem_free(pitem *item) | ||
86 | { | ||
87 | if (item == NULL) | ||
88 | return; | ||
89 | |||
90 | free(item); | ||
91 | } | ||
92 | |||
93 | pqueue_s * | ||
94 | pqueue_new(void) | ||
95 | { | ||
96 | pqueue_s *pq = (pqueue_s *)malloc(sizeof(pqueue_s)); | ||
97 | |||
98 | if (pq == NULL) | ||
99 | return NULL; | ||
100 | |||
101 | memset(pq, 0x00, sizeof(pqueue_s)); | ||
102 | return pq; | ||
103 | } | ||
104 | |||
105 | void | ||
106 | pqueue_free(pqueue_s *pq) | ||
107 | { | ||
108 | if (pq == NULL) | ||
109 | return; | ||
110 | |||
111 | free(pq); | ||
112 | } | ||
113 | |||
114 | pitem * | ||
115 | pqueue_insert(pqueue_s *pq, pitem *item) | ||
116 | { | ||
117 | pitem *curr, *next; | ||
118 | |||
119 | if (pq->items == NULL) { | ||
120 | pq->items = item; | ||
121 | return item; | ||
122 | } | ||
123 | |||
124 | for (curr = NULL, next = pq->items; next != NULL; | ||
125 | curr = next, next = next->next) { | ||
126 | /* we can compare 64-bit value in big-endian encoding | ||
127 | * with memcmp:-) */ | ||
128 | int cmp = memcmp(next->priority, item->priority, | ||
129 | sizeof(item->priority)); | ||
130 | if (cmp > 0) /* next > item */ | ||
131 | { | ||
132 | item->next = next; | ||
133 | |||
134 | if (curr == NULL) | ||
135 | pq->items = item; | ||
136 | else | ||
137 | curr->next = item; | ||
138 | |||
139 | return item; | ||
140 | } else if (cmp == 0) /* duplicates not allowed */ | ||
141 | return NULL; | ||
142 | } | ||
143 | |||
144 | item->next = NULL; | ||
145 | curr->next = item; | ||
146 | |||
147 | return item; | ||
148 | } | ||
149 | |||
150 | pitem * | ||
151 | pqueue_peek(pqueue_s *pq) | ||
152 | { | ||
153 | return pq->items; | ||
154 | } | ||
155 | |||
156 | pitem * | ||
157 | pqueue_pop(pqueue_s *pq) | ||
158 | { | ||
159 | pitem *item = pq->items; | ||
160 | |||
161 | if (pq->items != NULL) | ||
162 | pq->items = pq->items->next; | ||
163 | |||
164 | return item; | ||
165 | } | ||
166 | |||
167 | pitem * | ||
168 | pqueue_find(pqueue_s *pq, unsigned char *prio64be) | ||
169 | { | ||
170 | pitem *next; | ||
171 | pitem *found = NULL; | ||
172 | |||
173 | if (pq->items == NULL) | ||
174 | return NULL; | ||
175 | |||
176 | for (next = pq->items; next != NULL; next = next->next) { | ||
177 | if (memcmp(next->priority, prio64be, | ||
178 | sizeof(next->priority)) == 0) { | ||
179 | found = next; | ||
180 | break; | ||
181 | } | ||
182 | } | ||
183 | |||
184 | if (!found) | ||
185 | return NULL; | ||
186 | |||
187 | return found; | ||
188 | } | ||
189 | |||
190 | pitem * | ||
191 | pqueue_iterator(pqueue_s *pq) | ||
192 | { | ||
193 | return pqueue_peek(pq); | ||
194 | } | ||
195 | |||
196 | pitem * | ||
197 | pqueue_next(pitem **item) | ||
198 | { | ||
199 | pitem *ret; | ||
200 | |||
201 | if (item == NULL || *item == NULL) | ||
202 | return NULL; | ||
203 | |||
204 | /* *item != NULL */ | ||
205 | ret = *item; | ||
206 | *item = (*item)->next; | ||
207 | |||
208 | return ret; | ||
209 | } | ||
210 | |||
211 | int | ||
212 | pqueue_size(pqueue_s *pq) | ||
213 | { | ||
214 | pitem *item = pq->items; | ||
215 | int count = 0; | ||
216 | |||
217 | while (item != NULL) { | ||
218 | count++; | ||
219 | item = item->next; | ||
220 | } | ||
221 | return count; | ||
222 | } | ||
diff --git a/src/lib/libssl/src/ssl/pqueue.h b/src/lib/libssl/src/ssl/pqueue.h new file mode 100644 index 0000000000..6e7df8f35b --- /dev/null +++ b/src/lib/libssl/src/ssl/pqueue.h | |||
@@ -0,0 +1,92 @@ | |||
1 | /* crypto/pqueue/pqueue.h */ | ||
2 | /* | ||
3 | * DTLS implementation written by Nagendra Modadugu | ||
4 | * (nagendra@cs.stanford.edu) for the OpenSSL project 2005. | ||
5 | */ | ||
6 | /* ==================================================================== | ||
7 | * Copyright (c) 1999-2005 The OpenSSL Project. All rights reserved. | ||
8 | * | ||
9 | * Redistribution and use in source and binary forms, with or without | ||
10 | * modification, are permitted provided that the following conditions | ||
11 | * are met: | ||
12 | * | ||
13 | * 1. Redistributions of source code must retain the above copyright | ||
14 | * notice, this list of conditions and the following disclaimer. | ||
15 | * | ||
16 | * 2. Redistributions in binary form must reproduce the above copyright | ||
17 | * notice, this list of conditions and the following disclaimer in | ||
18 | * the documentation and/or other materials provided with the | ||
19 | * distribution. | ||
20 | * | ||
21 | * 3. All advertising materials mentioning features or use of this | ||
22 | * software must display the following acknowledgment: | ||
23 | * "This product includes software developed by the OpenSSL Project | ||
24 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" | ||
25 | * | ||
26 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
27 | * endorse or promote products derived from this software without | ||
28 | * prior written permission. For written permission, please contact | ||
29 | * openssl-core@OpenSSL.org. | ||
30 | * | ||
31 | * 5. Products derived from this software may not be called "OpenSSL" | ||
32 | * nor may "OpenSSL" appear in their names without prior written | ||
33 | * permission of the OpenSSL Project. | ||
34 | * | ||
35 | * 6. Redistributions of any form whatsoever must retain the following | ||
36 | * acknowledgment: | ||
37 | * "This product includes software developed by the OpenSSL Project | ||
38 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" | ||
39 | * | ||
40 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
41 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
42 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
43 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
44 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
45 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
46 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
47 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
49 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
50 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
51 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
52 | * ==================================================================== | ||
53 | * | ||
54 | * This product includes cryptographic software written by Eric Young | ||
55 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
56 | * Hudson (tjh@cryptsoft.com). | ||
57 | * | ||
58 | */ | ||
59 | |||
60 | #ifndef HEADER_PQUEUE_H | ||
61 | #define HEADER_PQUEUE_H | ||
62 | |||
63 | #include <stdio.h> | ||
64 | #include <stdlib.h> | ||
65 | #include <string.h> | ||
66 | |||
67 | typedef struct _pqueue *pqueue; | ||
68 | |||
69 | typedef struct _pitem { | ||
70 | unsigned char priority[8]; /* 64-bit value in big-endian encoding */ | ||
71 | void *data; | ||
72 | struct _pitem *next; | ||
73 | } pitem; | ||
74 | |||
75 | typedef struct _pitem *piterator; | ||
76 | |||
77 | pitem *pitem_new(unsigned char *prio64be, void *data); | ||
78 | void pitem_free(pitem *item); | ||
79 | |||
80 | pqueue pqueue_new(void); | ||
81 | void pqueue_free(pqueue pq); | ||
82 | |||
83 | pitem *pqueue_insert(pqueue pq, pitem *item); | ||
84 | pitem *pqueue_peek(pqueue pq); | ||
85 | pitem *pqueue_pop(pqueue pq); | ||
86 | pitem *pqueue_find(pqueue pq, unsigned char *prio64be); | ||
87 | pitem *pqueue_iterator(pqueue pq); | ||
88 | pitem *pqueue_next(piterator *iter); | ||
89 | |||
90 | int pqueue_size(pqueue pq); | ||
91 | |||
92 | #endif /* ! HEADER_PQUEUE_H */ | ||
diff --git a/src/lib/libssl/ssl/Makefile b/src/lib/libssl/ssl/Makefile index 737121fce4..8975572be8 100644 --- a/src/lib/libssl/ssl/Makefile +++ b/src/lib/libssl/ssl/Makefile | |||
@@ -1,4 +1,4 @@ | |||
1 | # $OpenBSD: Makefile,v 1.41 2014/05/05 15:03:22 tedu Exp $ | 1 | # $OpenBSD: Makefile,v 1.42 2014/05/12 19:14:14 miod Exp $ |
2 | 2 | ||
3 | LIB= ssl | 3 | LIB= ssl |
4 | 4 | ||
@@ -19,10 +19,11 @@ SRCS=\ | |||
19 | ssl_lib.c ssl_err2.c ssl_cert.c ssl_sess.c \ | 19 | ssl_lib.c ssl_err2.c ssl_cert.c ssl_sess.c \ |
20 | ssl_ciph.c ssl_stat.c ssl_rsa.c \ | 20 | ssl_ciph.c ssl_stat.c ssl_rsa.c \ |
21 | ssl_asn1.c ssl_txt.c ssl_algs.c \ | 21 | ssl_asn1.c ssl_txt.c ssl_algs.c \ |
22 | bio_ssl.c ssl_err.c t1_reneg.c | 22 | bio_ssl.c ssl_err.c t1_reneg.c \ |
23 | pqueue.c | ||
23 | SRCS+= s3_cbc.c | 24 | SRCS+= s3_cbc.c |
24 | 25 | ||
25 | HDRS= srtp.h ssl.h ssl2.h ssl3.h ssl23.h tls1.h dtls1.h kssl.h | 26 | HDRS= srtp.h ssl.h ssl2.h ssl3.h ssl23.h tls1.h dtls1.h kssl.h pqueue.h |
26 | 27 | ||
27 | .PATH: ${LSSL_SRC} | 28 | .PATH: ${LSSL_SRC} |
28 | 29 | ||
diff --git a/src/lib/libssl/ssl/shlib_version b/src/lib/libssl/ssl/shlib_version index 906022aa66..aa54cbb404 100644 --- a/src/lib/libssl/ssl/shlib_version +++ b/src/lib/libssl/ssl/shlib_version | |||
@@ -1,2 +1,2 @@ | |||
1 | major=24 | 1 | major=24 |
2 | minor=0 | 2 | minor=1 |