1 |
|
|
/* $OpenBSD: v3_lib.c,v 1.14 2015/02/10 11:22:22 jsing Exp $ */ |
2 |
|
|
/* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL |
3 |
|
|
* project 1999. |
4 |
|
|
*/ |
5 |
|
|
/* ==================================================================== |
6 |
|
|
* Copyright (c) 1999 The OpenSSL Project. All rights reserved. |
7 |
|
|
* |
8 |
|
|
* Redistribution and use in source and binary forms, with or without |
9 |
|
|
* modification, are permitted provided that the following conditions |
10 |
|
|
* are met: |
11 |
|
|
* |
12 |
|
|
* 1. Redistributions of source code must retain the above copyright |
13 |
|
|
* notice, this list of conditions and the following disclaimer. |
14 |
|
|
* |
15 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright |
16 |
|
|
* notice, this list of conditions and the following disclaimer in |
17 |
|
|
* the documentation and/or other materials provided with the |
18 |
|
|
* distribution. |
19 |
|
|
* |
20 |
|
|
* 3. All advertising materials mentioning features or use of this |
21 |
|
|
* software must display the following acknowledgment: |
22 |
|
|
* "This product includes software developed by the OpenSSL Project |
23 |
|
|
* for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" |
24 |
|
|
* |
25 |
|
|
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to |
26 |
|
|
* endorse or promote products derived from this software without |
27 |
|
|
* prior written permission. For written permission, please contact |
28 |
|
|
* licensing@OpenSSL.org. |
29 |
|
|
* |
30 |
|
|
* 5. Products derived from this software may not be called "OpenSSL" |
31 |
|
|
* nor may "OpenSSL" appear in their names without prior written |
32 |
|
|
* permission of the OpenSSL Project. |
33 |
|
|
* |
34 |
|
|
* 6. Redistributions of any form whatsoever must retain the following |
35 |
|
|
* acknowledgment: |
36 |
|
|
* "This product includes software developed by the OpenSSL Project |
37 |
|
|
* for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" |
38 |
|
|
* |
39 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY |
40 |
|
|
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
41 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
42 |
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR |
43 |
|
|
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
44 |
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
45 |
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
46 |
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
47 |
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
48 |
|
|
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
49 |
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
50 |
|
|
* OF THE POSSIBILITY OF SUCH DAMAGE. |
51 |
|
|
* ==================================================================== |
52 |
|
|
* |
53 |
|
|
* This product includes cryptographic software written by Eric Young |
54 |
|
|
* (eay@cryptsoft.com). This product includes software written by Tim |
55 |
|
|
* Hudson (tjh@cryptsoft.com). |
56 |
|
|
* |
57 |
|
|
*/ |
58 |
|
|
/* X509 v3 extension utilities */ |
59 |
|
|
|
60 |
|
|
#include <stdio.h> |
61 |
|
|
|
62 |
|
|
#include <openssl/conf.h> |
63 |
|
|
#include <openssl/err.h> |
64 |
|
|
#include <openssl/x509v3.h> |
65 |
|
|
|
66 |
|
|
#include "ext_dat.h" |
67 |
|
|
|
68 |
|
|
static STACK_OF(X509V3_EXT_METHOD) *ext_list = NULL; |
69 |
|
|
|
70 |
|
|
static int ext_cmp(const X509V3_EXT_METHOD * const *a, |
71 |
|
|
const X509V3_EXT_METHOD * const *b); |
72 |
|
|
static void ext_list_free(X509V3_EXT_METHOD *ext); |
73 |
|
|
|
74 |
|
|
int |
75 |
|
|
X509V3_EXT_add(X509V3_EXT_METHOD *ext) |
76 |
|
|
{ |
77 |
|
|
if (!ext_list && !(ext_list = sk_X509V3_EXT_METHOD_new(ext_cmp))) { |
78 |
|
|
X509V3err(X509V3_F_X509V3_EXT_ADD, ERR_R_MALLOC_FAILURE); |
79 |
|
|
return 0; |
80 |
|
|
} |
81 |
|
|
if (!sk_X509V3_EXT_METHOD_push(ext_list, ext)) { |
82 |
|
|
X509V3err(X509V3_F_X509V3_EXT_ADD, ERR_R_MALLOC_FAILURE); |
83 |
|
|
return 0; |
84 |
|
|
} |
85 |
|
|
return 1; |
86 |
|
|
} |
87 |
|
|
|
88 |
|
|
static int |
89 |
|
|
ext_cmp(const X509V3_EXT_METHOD * const *a, const X509V3_EXT_METHOD * const *b) |
90 |
|
188 |
{ |
91 |
|
188 |
return ((*a)->ext_nid - (*b)->ext_nid); |
92 |
|
|
} |
93 |
|
|
|
94 |
|
|
DECLARE_OBJ_BSEARCH_CMP_FN(const X509V3_EXT_METHOD *, |
95 |
|
|
const X509V3_EXT_METHOD *, ext); |
96 |
|
227 |
IMPLEMENT_OBJ_BSEARCH_CMP_FN(const X509V3_EXT_METHOD *, |
97 |
|
|
const X509V3_EXT_METHOD *, ext); |
98 |
|
|
|
99 |
|
|
const X509V3_EXT_METHOD * |
100 |
|
|
X509V3_EXT_get_nid(int nid) |
101 |
|
39 |
{ |
102 |
|
|
X509V3_EXT_METHOD tmp; |
103 |
|
39 |
const X509V3_EXT_METHOD *t = &tmp, * const *ret; |
104 |
|
|
int idx; |
105 |
|
|
|
106 |
✗✓ |
39 |
if (nid < 0) |
107 |
|
|
return NULL; |
108 |
|
39 |
tmp.ext_nid = nid; |
109 |
|
39 |
ret = OBJ_bsearch_ext(&t, standard_exts, STANDARD_EXTENSION_COUNT); |
110 |
✓✗ |
39 |
if (ret) |
111 |
|
39 |
return *ret; |
112 |
|
|
if (!ext_list) |
113 |
|
|
return NULL; |
114 |
|
|
idx = sk_X509V3_EXT_METHOD_find(ext_list, &tmp); |
115 |
|
|
if (idx == -1) |
116 |
|
|
return NULL; |
117 |
|
|
return sk_X509V3_EXT_METHOD_value(ext_list, idx); |
118 |
|
|
} |
119 |
|
|
|
120 |
|
|
const X509V3_EXT_METHOD * |
121 |
|
|
X509V3_EXT_get(X509_EXTENSION *ext) |
122 |
|
39 |
{ |
123 |
|
|
int nid; |
124 |
|
|
|
125 |
✗✓ |
39 |
if ((nid = OBJ_obj2nid(ext->object)) == NID_undef) |
126 |
|
|
return NULL; |
127 |
|
39 |
return X509V3_EXT_get_nid(nid); |
128 |
|
|
} |
129 |
|
|
|
130 |
|
|
int |
131 |
|
|
X509V3_EXT_add_list(X509V3_EXT_METHOD *extlist) |
132 |
|
|
{ |
133 |
|
|
for (; extlist->ext_nid!=-1; extlist++) |
134 |
|
|
if (!X509V3_EXT_add(extlist)) |
135 |
|
|
return 0; |
136 |
|
|
return 1; |
137 |
|
|
} |
138 |
|
|
|
139 |
|
|
int |
140 |
|
|
X509V3_EXT_add_alias(int nid_to, int nid_from) |
141 |
|
|
{ |
142 |
|
|
const X509V3_EXT_METHOD *ext; |
143 |
|
|
X509V3_EXT_METHOD *tmpext; |
144 |
|
|
|
145 |
|
|
if (!(ext = X509V3_EXT_get_nid(nid_from))) { |
146 |
|
|
X509V3err(X509V3_F_X509V3_EXT_ADD_ALIAS, |
147 |
|
|
X509V3_R_EXTENSION_NOT_FOUND); |
148 |
|
|
return 0; |
149 |
|
|
} |
150 |
|
|
if (!(tmpext = malloc(sizeof(X509V3_EXT_METHOD)))) { |
151 |
|
|
X509V3err(X509V3_F_X509V3_EXT_ADD_ALIAS, ERR_R_MALLOC_FAILURE); |
152 |
|
|
return 0; |
153 |
|
|
} |
154 |
|
|
*tmpext = *ext; |
155 |
|
|
tmpext->ext_nid = nid_to; |
156 |
|
|
tmpext->ext_flags |= X509V3_EXT_DYNAMIC; |
157 |
|
|
return X509V3_EXT_add(tmpext); |
158 |
|
|
} |
159 |
|
|
|
160 |
|
|
void |
161 |
|
|
X509V3_EXT_cleanup(void) |
162 |
|
|
{ |
163 |
|
|
sk_X509V3_EXT_METHOD_pop_free(ext_list, ext_list_free); |
164 |
|
|
ext_list = NULL; |
165 |
|
|
} |
166 |
|
|
|
167 |
|
|
static void |
168 |
|
|
ext_list_free(X509V3_EXT_METHOD *ext) |
169 |
|
|
{ |
170 |
|
|
if (ext->ext_flags & X509V3_EXT_DYNAMIC) |
171 |
|
|
free(ext); |
172 |
|
|
} |
173 |
|
|
|
174 |
|
|
/* Legacy function: we don't need to add standard extensions |
175 |
|
|
* any more because they are now kept in ext_dat.h. |
176 |
|
|
*/ |
177 |
|
|
|
178 |
|
|
int |
179 |
|
|
X509V3_add_standard_extensions(void) |
180 |
|
|
{ |
181 |
|
|
return 1; |
182 |
|
|
} |
183 |
|
|
|
184 |
|
|
/* Return an extension internal structure */ |
185 |
|
|
|
186 |
|
|
void * |
187 |
|
|
X509V3_EXT_d2i(X509_EXTENSION *ext) |
188 |
|
39 |
{ |
189 |
|
|
const X509V3_EXT_METHOD *method; |
190 |
|
|
const unsigned char *p; |
191 |
|
|
|
192 |
✗✓ |
39 |
if (!(method = X509V3_EXT_get(ext))) |
193 |
|
|
return NULL; |
194 |
|
39 |
p = ext->value->data; |
195 |
✓✗ |
39 |
if (method->it) |
196 |
|
39 |
return ASN1_item_d2i(NULL, &p, ext->value->length, |
197 |
|
|
ASN1_ITEM_ptr(method->it)); |
198 |
|
|
return method->d2i(NULL, &p, ext->value->length); |
199 |
|
|
} |
200 |
|
|
|
201 |
|
|
/* Get critical flag and decoded version of extension from a NID. |
202 |
|
|
* The "idx" variable returns the last found extension and can |
203 |
|
|
* be used to retrieve multiple extensions of the same NID. |
204 |
|
|
* However multiple extensions with the same NID is usually |
205 |
|
|
* due to a badly encoded certificate so if idx is NULL we |
206 |
|
|
* choke if multiple extensions exist. |
207 |
|
|
* The "crit" variable is set to the critical value. |
208 |
|
|
* The return value is the decoded extension or NULL on |
209 |
|
|
* error. The actual error can have several different causes, |
210 |
|
|
* the value of *crit reflects the cause: |
211 |
|
|
* >= 0, extension found but not decoded (reflects critical value). |
212 |
|
|
* -1 extension not found. |
213 |
|
|
* -2 extension occurs more than once. |
214 |
|
|
*/ |
215 |
|
|
|
216 |
|
|
void * |
217 |
|
|
X509V3_get_d2i(STACK_OF(X509_EXTENSION) *x, int nid, int *crit, int *idx) |
218 |
|
80 |
{ |
219 |
|
|
int lastpos, i; |
220 |
|
80 |
X509_EXTENSION *ex, *found_ex = NULL; |
221 |
|
|
|
222 |
✗✓ |
80 |
if (!x) { |
223 |
|
|
if (idx) |
224 |
|
|
*idx = -1; |
225 |
|
|
if (crit) |
226 |
|
|
*crit = -1; |
227 |
|
|
return NULL; |
228 |
|
|
} |
229 |
✗✓ |
80 |
if (idx) |
230 |
|
|
lastpos = *idx + 1; |
231 |
|
|
else |
232 |
|
80 |
lastpos = 0; |
233 |
✗✓ |
80 |
if (lastpos < 0) |
234 |
|
|
lastpos = 0; |
235 |
✓✓ |
610 |
for (i = lastpos; i < sk_X509_EXTENSION_num(x); i++) { |
236 |
|
530 |
ex = sk_X509_EXTENSION_value(x, i); |
237 |
✓✓ |
530 |
if (OBJ_obj2nid(ex->object) == nid) { |
238 |
✗✓ |
39 |
if (idx) { |
239 |
|
|
*idx = i; |
240 |
|
|
found_ex = ex; |
241 |
|
|
break; |
242 |
✗✓ |
39 |
} else if (found_ex) { |
243 |
|
|
/* Found more than one */ |
244 |
|
|
if (crit) |
245 |
|
|
*crit = -2; |
246 |
|
|
return NULL; |
247 |
|
|
} |
248 |
|
39 |
found_ex = ex; |
249 |
|
|
} |
250 |
|
|
} |
251 |
✓✓ |
80 |
if (found_ex) { |
252 |
|
|
/* Found it */ |
253 |
✗✓ |
39 |
if (crit) |
254 |
|
|
*crit = X509_EXTENSION_get_critical(found_ex); |
255 |
|
39 |
return X509V3_EXT_d2i(found_ex); |
256 |
|
|
} |
257 |
|
|
|
258 |
|
|
/* Extension not found */ |
259 |
✗✓ |
41 |
if (idx) |
260 |
|
|
*idx = -1; |
261 |
✓✓ |
41 |
if (crit) |
262 |
|
8 |
*crit = -1; |
263 |
|
41 |
return NULL; |
264 |
|
|
} |
265 |
|
|
|
266 |
|
|
/* This function is a general extension append, replace and delete utility. |
267 |
|
|
* The precise operation is governed by the 'flags' value. The 'crit' and |
268 |
|
|
* 'value' arguments (if relevant) are the extensions internal structure. |
269 |
|
|
*/ |
270 |
|
|
|
271 |
|
|
int |
272 |
|
|
X509V3_add1_i2d(STACK_OF(X509_EXTENSION) **x, int nid, void *value, |
273 |
|
|
int crit, unsigned long flags) |
274 |
|
|
{ |
275 |
|
|
int extidx = -1; |
276 |
|
|
int errcode; |
277 |
|
|
X509_EXTENSION *ext, *extmp; |
278 |
|
|
unsigned long ext_op = flags & X509V3_ADD_OP_MASK; |
279 |
|
|
|
280 |
|
|
/* If appending we don't care if it exists, otherwise |
281 |
|
|
* look for existing extension. |
282 |
|
|
*/ |
283 |
|
|
if (ext_op != X509V3_ADD_APPEND) |
284 |
|
|
extidx = X509v3_get_ext_by_NID(*x, nid, -1); |
285 |
|
|
|
286 |
|
|
/* See if extension exists */ |
287 |
|
|
if (extidx >= 0) { |
288 |
|
|
/* If keep existing, nothing to do */ |
289 |
|
|
if (ext_op == X509V3_ADD_KEEP_EXISTING) |
290 |
|
|
return 1; |
291 |
|
|
/* If default then its an error */ |
292 |
|
|
if (ext_op == X509V3_ADD_DEFAULT) { |
293 |
|
|
errcode = X509V3_R_EXTENSION_EXISTS; |
294 |
|
|
goto err; |
295 |
|
|
} |
296 |
|
|
/* If delete, just delete it */ |
297 |
|
|
if (ext_op == X509V3_ADD_DELETE) { |
298 |
|
|
if (!sk_X509_EXTENSION_delete(*x, extidx)) |
299 |
|
|
return -1; |
300 |
|
|
return 1; |
301 |
|
|
} |
302 |
|
|
} else { |
303 |
|
|
/* If replace existing or delete, error since |
304 |
|
|
* extension must exist |
305 |
|
|
*/ |
306 |
|
|
if ((ext_op == X509V3_ADD_REPLACE_EXISTING) || |
307 |
|
|
(ext_op == X509V3_ADD_DELETE)) { |
308 |
|
|
errcode = X509V3_R_EXTENSION_NOT_FOUND; |
309 |
|
|
goto err; |
310 |
|
|
} |
311 |
|
|
} |
312 |
|
|
|
313 |
|
|
/* If we get this far then we have to create an extension: |
314 |
|
|
* could have some flags for alternative encoding schemes... |
315 |
|
|
*/ |
316 |
|
|
|
317 |
|
|
ext = X509V3_EXT_i2d(nid, crit, value); |
318 |
|
|
|
319 |
|
|
if (!ext) { |
320 |
|
|
X509V3err(X509V3_F_X509V3_ADD1_I2D, |
321 |
|
|
X509V3_R_ERROR_CREATING_EXTENSION); |
322 |
|
|
return 0; |
323 |
|
|
} |
324 |
|
|
|
325 |
|
|
/* If extension exists replace it.. */ |
326 |
|
|
if (extidx >= 0) { |
327 |
|
|
extmp = sk_X509_EXTENSION_value(*x, extidx); |
328 |
|
|
X509_EXTENSION_free(extmp); |
329 |
|
|
if (!sk_X509_EXTENSION_set(*x, extidx, ext)) |
330 |
|
|
return -1; |
331 |
|
|
return 1; |
332 |
|
|
} |
333 |
|
|
|
334 |
|
|
if (!*x && !(*x = sk_X509_EXTENSION_new_null())) |
335 |
|
|
return -1; |
336 |
|
|
if (!sk_X509_EXTENSION_push(*x, ext)) |
337 |
|
|
return -1; |
338 |
|
|
|
339 |
|
|
return 1; |
340 |
|
|
|
341 |
|
|
err: |
342 |
|
|
if (!(flags & X509V3_ADD_SILENT)) |
343 |
|
|
X509V3err(X509V3_F_X509V3_ADD1_I2D, errcode); |
344 |
|
|
return 0; |
345 |
|
|
} |