/src/openssl/crypto/x509/v3_addr.c
Line | Count | Source |
1 | | /* |
2 | | * Copyright 2006-2026 The OpenSSL Project Authors. All Rights Reserved. |
3 | | * |
4 | | * Licensed under the Apache License 2.0 (the "License"). You may not use |
5 | | * this file except in compliance with the License. You can obtain a copy |
6 | | * in the file LICENSE in the source distribution or at |
7 | | * https://www.openssl.org/source/license.html |
8 | | */ |
9 | | |
10 | | /* |
11 | | * Implementation of RFC 3779 section 2.2. |
12 | | */ |
13 | | |
14 | | #include <stdio.h> |
15 | | #include <stdlib.h> |
16 | | #include <assert.h> |
17 | | #include <string.h> |
18 | | |
19 | | #include <openssl/conf.h> |
20 | | #include <openssl/asn1.h> |
21 | | #include <openssl/asn1t.h> |
22 | | #include <openssl/buffer.h> |
23 | | #include <openssl/x509v3.h> |
24 | | #include "internal/cryptlib.h" |
25 | | #include "crypto/asn1.h" |
26 | | #include "crypto/x509.h" |
27 | | #include "ext_dat.h" |
28 | | #include "x509_local.h" |
29 | | |
30 | | #ifndef OPENSSL_NO_RFC3779 |
31 | | |
32 | | /* |
33 | | * OpenSSL ASN.1 template translation of RFC 3779 2.2.3. |
34 | | */ |
35 | | |
36 | | ASN1_SEQUENCE(IPAddressRange) = { |
37 | | ASN1_SIMPLE(IPAddressRange, min, ASN1_BIT_STRING), |
38 | | ASN1_SIMPLE(IPAddressRange, max, ASN1_BIT_STRING) |
39 | 0 | } ASN1_SEQUENCE_END(IPAddressRange) |
40 | 0 |
|
41 | 0 | ASN1_CHOICE(IPAddressOrRange) = { |
42 | 0 | ASN1_SIMPLE(IPAddressOrRange, u.addressPrefix, ASN1_BIT_STRING), |
43 | 0 | ASN1_SIMPLE(IPAddressOrRange, u.addressRange, IPAddressRange) |
44 | 0 | } ASN1_CHOICE_END(IPAddressOrRange) |
45 | 0 |
|
46 | 0 | ASN1_CHOICE(IPAddressChoice) = { |
47 | 0 | ASN1_SIMPLE(IPAddressChoice, u.inherit, ASN1_NULL), |
48 | 0 | ASN1_SEQUENCE_OF(IPAddressChoice, u.addressesOrRanges, IPAddressOrRange) |
49 | 0 | } ASN1_CHOICE_END(IPAddressChoice) |
50 | 0 |
|
51 | 0 | ASN1_SEQUENCE(IPAddressFamily) = { |
52 | 0 | ASN1_SIMPLE(IPAddressFamily, addressFamily, ASN1_OCTET_STRING), |
53 | 0 | ASN1_SIMPLE(IPAddressFamily, ipAddressChoice, IPAddressChoice) |
54 | 0 | } ASN1_SEQUENCE_END(IPAddressFamily) |
55 | 0 |
|
56 | 0 | ASN1_ITEM_TEMPLATE(IPAddrBlocks) = ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF, 0, |
57 | 0 | IPAddrBlocks, IPAddressFamily) |
58 | 0 | ASN1_ITEM_TEMPLATE_END(IPAddrBlocks) |
59 | | |
60 | | IMPLEMENT_ASN1_FUNCTIONS_fname(IPAddrBlocks, IPAddrBlocks, IPAddrBlocks) |
61 | | |
62 | | IMPLEMENT_ASN1_FUNCTIONS(IPAddressRange) |
63 | | IMPLEMENT_ASN1_FUNCTIONS(IPAddressOrRange) |
64 | | IMPLEMENT_ASN1_FUNCTIONS(IPAddressChoice) |
65 | | IMPLEMENT_ASN1_FUNCTIONS(IPAddressFamily) |
66 | | |
67 | | /* |
68 | | * How much buffer space do we need for a raw address? |
69 | | */ |
70 | | #define ADDR_RAW_BUF_LEN 16 |
71 | | |
72 | | /* |
73 | | * What's the address length associated with this AFI? |
74 | | */ |
75 | | static int length_from_afi(const unsigned afi) |
76 | 0 | { |
77 | 0 | switch (afi) { |
78 | 0 | case IANA_AFI_IPV4: |
79 | 0 | return 4; |
80 | 0 | case IANA_AFI_IPV6: |
81 | 0 | return 16; |
82 | 0 | default: |
83 | 0 | return 0; |
84 | 0 | } |
85 | 0 | } |
86 | | |
87 | | /* |
88 | | * Extract the AFI from an IPAddressFamily. |
89 | | */ |
90 | | unsigned int X509v3_addr_get_afi(const IPAddressFamily *f) |
91 | 0 | { |
92 | 0 | if (f == NULL |
93 | 0 | || f->addressFamily == NULL |
94 | 0 | || f->addressFamily->data == NULL |
95 | 0 | || f->addressFamily->length < 2) |
96 | 0 | return 0; |
97 | 0 | return (f->addressFamily->data[0] << 8) | f->addressFamily->data[1]; |
98 | 0 | } |
99 | | |
100 | | /* |
101 | | * Get SAFI from an IPAdressFamily. |
102 | | */ |
103 | | unsigned int X509v3_addr_get_safi(const IPAddressFamily *f) |
104 | 0 | { |
105 | 0 | if (f == NULL |
106 | 0 | || f->addressFamily == NULL |
107 | 0 | || f->addressFamily->data == NULL |
108 | 0 | || f->addressFamily->length < 3) { |
109 | 0 | return 0; |
110 | 0 | } |
111 | | |
112 | 0 | return f->addressFamily->data[2]; |
113 | 0 | } |
114 | | |
115 | | /* |
116 | | * Expand the bitstring form of an address into a raw byte array. |
117 | | * At the moment this is coded for simplicity, not speed. |
118 | | */ |
119 | | static int addr_expand(unsigned char *addr, |
120 | | const ASN1_BIT_STRING *bs, |
121 | | const int length, const unsigned char fill) |
122 | 0 | { |
123 | 0 | if (bs->length < 0 || bs->length > length) |
124 | 0 | return 0; |
125 | 0 | if (bs->length > 0) { |
126 | 0 | memcpy(addr, bs->data, bs->length); |
127 | 0 | if ((bs->flags & 7) != 0) { |
128 | 0 | unsigned char mask = 0xFF >> (8 - (bs->flags & 7)); |
129 | |
|
130 | 0 | if (fill == 0) |
131 | 0 | addr[bs->length - 1] &= ~mask; |
132 | 0 | else |
133 | 0 | addr[bs->length - 1] |= mask; |
134 | 0 | } |
135 | 0 | } |
136 | 0 | memset(addr + bs->length, fill, length - bs->length); |
137 | 0 | return 1; |
138 | 0 | } |
139 | | |
140 | | /* |
141 | | * Extract the prefix length from a bitstring. |
142 | | */ |
143 | 0 | #define addr_prefixlen(bs) ((int)((bs)->length * 8 - ((bs)->flags & 7))) |
144 | | |
145 | | /* |
146 | | * i2r handler for one address bitstring. |
147 | | */ |
148 | | static int i2r_address(BIO *out, |
149 | | const unsigned afi, |
150 | | const unsigned char fill, const ASN1_BIT_STRING *bs) |
151 | 0 | { |
152 | 0 | unsigned char addr[ADDR_RAW_BUF_LEN]; |
153 | 0 | int i, n; |
154 | |
|
155 | 0 | if (bs->length < 0) |
156 | 0 | return 0; |
157 | 0 | switch (afi) { |
158 | 0 | case IANA_AFI_IPV4: |
159 | 0 | if (!addr_expand(addr, bs, 4, fill)) |
160 | 0 | return 0; |
161 | 0 | BIO_printf(out, "%d.%d.%d.%d", addr[0], addr[1], addr[2], addr[3]); |
162 | 0 | break; |
163 | 0 | case IANA_AFI_IPV6: |
164 | 0 | if (!addr_expand(addr, bs, 16, fill)) |
165 | 0 | return 0; |
166 | 0 | for (n = 16; n > 1 && addr[n - 1] == 0x00 && addr[n - 2] == 0x00; |
167 | 0 | n -= 2) |
168 | 0 | ; |
169 | 0 | for (i = 0; i < n; i += 2) |
170 | 0 | BIO_printf(out, "%x%s", (addr[i] << 8) | addr[i + 1], |
171 | 0 | (i < 14 ? ":" : "")); |
172 | 0 | if (i < 16) |
173 | 0 | BIO_puts(out, ":"); |
174 | 0 | if (i == 0) |
175 | 0 | BIO_puts(out, ":"); |
176 | 0 | break; |
177 | 0 | default: |
178 | 0 | for (i = 0; i < bs->length; i++) |
179 | 0 | BIO_printf(out, "%s%02x", (i > 0 ? ":" : ""), bs->data[i]); |
180 | 0 | BIO_printf(out, "[%d]", (int)(bs->flags & 7)); |
181 | 0 | break; |
182 | 0 | } |
183 | 0 | return 1; |
184 | 0 | } |
185 | | |
186 | | /* |
187 | | * i2r handler for a sequence of addresses and ranges. |
188 | | */ |
189 | | static int i2r_IPAddressOrRanges(BIO *out, |
190 | | const int indent, |
191 | | const IPAddressOrRanges *aors, |
192 | | const unsigned afi) |
193 | 0 | { |
194 | 0 | int i; |
195 | |
|
196 | 0 | for (i = 0; i < sk_IPAddressOrRange_num(aors); i++) { |
197 | 0 | const IPAddressOrRange *aor = sk_IPAddressOrRange_value(aors, i); |
198 | |
|
199 | 0 | BIO_printf(out, "%*s", indent, ""); |
200 | 0 | switch (aor->type) { |
201 | 0 | case IPAddressOrRange_addressPrefix: |
202 | 0 | if (!i2r_address(out, afi, 0x00, aor->u.addressPrefix)) |
203 | 0 | return 0; |
204 | 0 | BIO_printf(out, "/%d\n", addr_prefixlen(aor->u.addressPrefix)); |
205 | 0 | continue; |
206 | 0 | case IPAddressOrRange_addressRange: |
207 | 0 | if (!i2r_address(out, afi, 0x00, aor->u.addressRange->min)) |
208 | 0 | return 0; |
209 | 0 | BIO_puts(out, "-"); |
210 | 0 | if (!i2r_address(out, afi, 0xFF, aor->u.addressRange->max)) |
211 | 0 | return 0; |
212 | 0 | BIO_puts(out, "\n"); |
213 | 0 | continue; |
214 | 0 | } |
215 | 0 | } |
216 | 0 | return 1; |
217 | 0 | } |
218 | | |
219 | | /* |
220 | | * i2r handler for an IPAddrBlocks extension. |
221 | | */ |
222 | | static int i2r_IPAddrBlocks(const X509V3_EXT_METHOD *method, |
223 | | void *ext, BIO *out, int indent) |
224 | 0 | { |
225 | 0 | const IPAddrBlocks *addr = ext; |
226 | 0 | int i; |
227 | |
|
228 | 0 | for (i = 0; i < sk_IPAddressFamily_num(addr); i++) { |
229 | 0 | IPAddressFamily *f = sk_IPAddressFamily_value(addr, i); |
230 | 0 | const unsigned int afi = X509v3_addr_get_afi(f); |
231 | |
|
232 | 0 | switch (afi) { |
233 | 0 | case IANA_AFI_IPV4: |
234 | 0 | BIO_printf(out, "%*sIPv4", indent, ""); |
235 | 0 | break; |
236 | 0 | case IANA_AFI_IPV6: |
237 | 0 | BIO_printf(out, "%*sIPv6", indent, ""); |
238 | 0 | break; |
239 | 0 | default: |
240 | 0 | BIO_printf(out, "%*sUnknown AFI %u", indent, "", afi); |
241 | 0 | break; |
242 | 0 | } |
243 | 0 | if (f->addressFamily->length > 2) { |
244 | 0 | switch (f->addressFamily->data[2]) { |
245 | 0 | case 1: |
246 | 0 | BIO_puts(out, " (Unicast)"); |
247 | 0 | break; |
248 | 0 | case 2: |
249 | 0 | BIO_puts(out, " (Multicast)"); |
250 | 0 | break; |
251 | 0 | case 3: |
252 | 0 | BIO_puts(out, " (Unicast/Multicast)"); |
253 | 0 | break; |
254 | 0 | case 4: |
255 | 0 | BIO_puts(out, " (MPLS)"); |
256 | 0 | break; |
257 | 0 | case 64: |
258 | 0 | BIO_puts(out, " (Tunnel)"); |
259 | 0 | break; |
260 | 0 | case 65: |
261 | 0 | BIO_puts(out, " (VPLS)"); |
262 | 0 | break; |
263 | 0 | case 66: |
264 | 0 | BIO_puts(out, " (BGP MDT)"); |
265 | 0 | break; |
266 | 0 | case 128: |
267 | 0 | BIO_puts(out, " (MPLS-labeled VPN)"); |
268 | 0 | break; |
269 | 0 | default: |
270 | 0 | BIO_printf(out, " (Unknown SAFI %u)", |
271 | 0 | (unsigned)f->addressFamily->data[2]); |
272 | 0 | break; |
273 | 0 | } |
274 | 0 | } |
275 | 0 | switch (f->ipAddressChoice->type) { |
276 | 0 | case IPAddressChoice_inherit: |
277 | 0 | BIO_puts(out, ": inherit\n"); |
278 | 0 | break; |
279 | 0 | case IPAddressChoice_addressesOrRanges: |
280 | 0 | BIO_puts(out, ":\n"); |
281 | 0 | if (!i2r_IPAddressOrRanges(out, |
282 | 0 | indent + 2, |
283 | 0 | f->ipAddressChoice->u.addressesOrRanges, afi)) |
284 | 0 | return 0; |
285 | 0 | break; |
286 | 0 | } |
287 | 0 | } |
288 | 0 | return 1; |
289 | 0 | } |
290 | | |
291 | | /* |
292 | | * Sort comparison function for a sequence of IPAddressOrRange |
293 | | * elements. |
294 | | * |
295 | | * There's no sane answer we can give if addr_expand() fails, and an |
296 | | * assertion failure on externally supplied data is seriously uncool, |
297 | | * so we just arbitrarily declare that if given invalid inputs this |
298 | | * function returns -1. If this messes up your preferred sort order |
299 | | * for garbage input, tough noogies. |
300 | | */ |
301 | | static int IPAddressOrRange_cmp(const IPAddressOrRange *a, |
302 | | const IPAddressOrRange *b, const int length) |
303 | 0 | { |
304 | 0 | unsigned char addr_a[ADDR_RAW_BUF_LEN], addr_b[ADDR_RAW_BUF_LEN]; |
305 | 0 | int prefixlen_a = 0, prefixlen_b = 0; |
306 | 0 | int r; |
307 | |
|
308 | 0 | switch (a->type) { |
309 | 0 | case IPAddressOrRange_addressPrefix: |
310 | 0 | if (!addr_expand(addr_a, a->u.addressPrefix, length, 0x00)) |
311 | 0 | return -1; |
312 | 0 | prefixlen_a = addr_prefixlen(a->u.addressPrefix); |
313 | 0 | break; |
314 | 0 | case IPAddressOrRange_addressRange: |
315 | 0 | if (!addr_expand(addr_a, a->u.addressRange->min, length, 0x00)) |
316 | 0 | return -1; |
317 | 0 | prefixlen_a = length * 8; |
318 | 0 | break; |
319 | 0 | default: |
320 | 0 | return -1; |
321 | 0 | } |
322 | | |
323 | 0 | switch (b->type) { |
324 | 0 | case IPAddressOrRange_addressPrefix: |
325 | 0 | if (!addr_expand(addr_b, b->u.addressPrefix, length, 0x00)) |
326 | 0 | return -1; |
327 | 0 | prefixlen_b = addr_prefixlen(b->u.addressPrefix); |
328 | 0 | break; |
329 | 0 | case IPAddressOrRange_addressRange: |
330 | 0 | if (!addr_expand(addr_b, b->u.addressRange->min, length, 0x00)) |
331 | 0 | return -1; |
332 | 0 | prefixlen_b = length * 8; |
333 | 0 | break; |
334 | 0 | default: |
335 | 0 | return -1; |
336 | 0 | } |
337 | | |
338 | 0 | if ((r = memcmp(addr_a, addr_b, length)) != 0) |
339 | 0 | return r; |
340 | 0 | else |
341 | 0 | return prefixlen_a - prefixlen_b; |
342 | 0 | } |
343 | | |
344 | | /* |
345 | | * IPv4-specific closure over IPAddressOrRange_cmp, since sk_sort() |
346 | | * comparison routines are only allowed two arguments. |
347 | | */ |
348 | | static int v4IPAddressOrRange_cmp(const IPAddressOrRange *const *a, |
349 | | const IPAddressOrRange *const *b) |
350 | 0 | { |
351 | 0 | return IPAddressOrRange_cmp(*a, *b, 4); |
352 | 0 | } |
353 | | |
354 | | /* |
355 | | * IPv6-specific closure over IPAddressOrRange_cmp, since sk_sort() |
356 | | * comparison routines are only allowed two arguments. |
357 | | */ |
358 | | static int v6IPAddressOrRange_cmp(const IPAddressOrRange *const *a, |
359 | | const IPAddressOrRange *const *b) |
360 | 0 | { |
361 | 0 | return IPAddressOrRange_cmp(*a, *b, 16); |
362 | 0 | } |
363 | | |
364 | | /* |
365 | | * Calculate whether a range collapses to a prefix. |
366 | | * See last paragraph of RFC 3779 2.2.3.7. |
367 | | */ |
368 | | static int range_should_be_prefix(const unsigned char *min, |
369 | | const unsigned char *max, const int length) |
370 | 0 | { |
371 | 0 | unsigned char mask; |
372 | 0 | int i, j; |
373 | | |
374 | | /* |
375 | | * It is the responsibility of the caller to confirm min <= max. We don't |
376 | | * use ossl_assert() here since we have no way of signalling an error from |
377 | | * this function - so we just use a plain assert instead. |
378 | | */ |
379 | 0 | assert(memcmp(min, max, length) <= 0); |
380 | |
|
381 | 0 | for (i = 0; i < length && min[i] == max[i]; i++) |
382 | 0 | ; |
383 | 0 | for (j = length - 1; j >= 0 && min[j] == 0x00 && max[j] == 0xFF; j--) |
384 | 0 | ; |
385 | 0 | if (i < j) |
386 | 0 | return -1; |
387 | 0 | if (i > j) |
388 | 0 | return i * 8; |
389 | 0 | mask = min[i] ^ max[i]; |
390 | 0 | switch (mask) { |
391 | 0 | case 0x01: |
392 | 0 | j = 7; |
393 | 0 | break; |
394 | 0 | case 0x03: |
395 | 0 | j = 6; |
396 | 0 | break; |
397 | 0 | case 0x07: |
398 | 0 | j = 5; |
399 | 0 | break; |
400 | 0 | case 0x0F: |
401 | 0 | j = 4; |
402 | 0 | break; |
403 | 0 | case 0x1F: |
404 | 0 | j = 3; |
405 | 0 | break; |
406 | 0 | case 0x3F: |
407 | 0 | j = 2; |
408 | 0 | break; |
409 | 0 | case 0x7F: |
410 | 0 | j = 1; |
411 | 0 | break; |
412 | 0 | default: |
413 | 0 | return -1; |
414 | 0 | } |
415 | 0 | if ((min[i] & mask) != 0 || (max[i] & mask) != mask) |
416 | 0 | return -1; |
417 | 0 | else |
418 | 0 | return i * 8 + j; |
419 | 0 | } |
420 | | |
421 | | /* |
422 | | * Construct a prefix. |
423 | | */ |
424 | | static int make_addressPrefix(IPAddressOrRange **result, unsigned char *addr, |
425 | | const int prefixlen, const int afilen) |
426 | 0 | { |
427 | 0 | int bytelen = (prefixlen + 7) / 8, bitlen = prefixlen % 8; |
428 | 0 | IPAddressOrRange *aor; |
429 | 0 | unsigned char *prefix = NULL; |
430 | 0 | uint8_t unused_bits = 0; |
431 | |
|
432 | 0 | if (bitlen > 0) |
433 | 0 | unused_bits = 8 - bitlen; |
434 | |
|
435 | 0 | if (prefixlen < 0 || prefixlen > (afilen * 8)) |
436 | 0 | return 0; |
437 | 0 | if ((aor = IPAddressOrRange_new()) == NULL) |
438 | 0 | return 0; |
439 | 0 | aor->type = IPAddressOrRange_addressPrefix; |
440 | 0 | if (aor->u.addressPrefix == NULL && (aor->u.addressPrefix = ASN1_BIT_STRING_new()) == NULL) |
441 | 0 | goto err; |
442 | 0 | if (bytelen > 0) { |
443 | 0 | prefix = OPENSSL_malloc(bytelen); |
444 | 0 | if (prefix == NULL) |
445 | 0 | goto err; |
446 | 0 | memcpy(prefix, addr, bytelen); |
447 | 0 | if (unused_bits) |
448 | 0 | prefix[bytelen - 1] &= ~(0xFF >> bitlen); |
449 | 0 | } |
450 | 0 | if (!ASN1_BIT_STRING_set1(aor->u.addressPrefix, prefix, bytelen, unused_bits)) |
451 | 0 | goto err; |
452 | 0 | *result = aor; |
453 | |
|
454 | 0 | OPENSSL_free(prefix); |
455 | 0 | return 1; |
456 | | |
457 | 0 | err: |
458 | 0 | OPENSSL_free(prefix); |
459 | 0 | IPAddressOrRange_free(aor); |
460 | 0 | return 0; |
461 | 0 | } |
462 | | |
463 | | /* |
464 | | * Construct a range. If it can be expressed as a prefix, |
465 | | * return a prefix instead. Doing this here simplifies |
466 | | * the rest of the code considerably. |
467 | | */ |
468 | | static int make_addressRange(IPAddressOrRange **result, |
469 | | unsigned char *min, |
470 | | unsigned char *max, const int length) |
471 | 0 | { |
472 | 0 | IPAddressOrRange *aor; |
473 | 0 | int i, prefixlen; |
474 | |
|
475 | 0 | if (memcmp(min, max, length) > 0) |
476 | 0 | return 0; |
477 | | |
478 | 0 | if ((prefixlen = range_should_be_prefix(min, max, length)) >= 0) |
479 | 0 | return make_addressPrefix(result, min, prefixlen, length); |
480 | | |
481 | 0 | if ((aor = IPAddressOrRange_new()) == NULL) |
482 | 0 | return 0; |
483 | 0 | aor->type = IPAddressOrRange_addressRange; |
484 | 0 | if ((aor->u.addressRange = IPAddressRange_new()) == NULL) |
485 | 0 | goto err; |
486 | 0 | if (aor->u.addressRange->min == NULL && (aor->u.addressRange->min = ASN1_BIT_STRING_new()) == NULL) |
487 | 0 | goto err; |
488 | 0 | if (aor->u.addressRange->max == NULL && (aor->u.addressRange->max = ASN1_BIT_STRING_new()) == NULL) |
489 | 0 | goto err; |
490 | | |
491 | 0 | for (i = length; i > 0 && min[i - 1] == 0x00; --i) |
492 | 0 | ; |
493 | 0 | if (!ASN1_BIT_STRING_set1(aor->u.addressRange->min, min, i, 0)) |
494 | 0 | goto err; |
495 | 0 | if (i > 0) { |
496 | 0 | unsigned char b = min[i - 1]; |
497 | 0 | int j = 1; |
498 | |
|
499 | 0 | while ((b & (0xFFU >> j)) != 0) |
500 | 0 | ++j; |
501 | 0 | aor->u.addressRange->min->flags |= 8 - j; |
502 | 0 | } |
503 | |
|
504 | 0 | for (i = length; i > 0 && max[i - 1] == 0xFF; --i) |
505 | 0 | ; |
506 | 0 | if (!ASN1_BIT_STRING_set1(aor->u.addressRange->max, max, i, 0)) |
507 | 0 | goto err; |
508 | 0 | if (i > 0) { |
509 | 0 | unsigned char b = max[i - 1]; |
510 | 0 | int j = 1; |
511 | |
|
512 | 0 | while ((b & (0xFFU >> j)) != (0xFFU >> j)) |
513 | 0 | ++j; |
514 | 0 | aor->u.addressRange->max->flags |= 8 - j; |
515 | 0 | } |
516 | |
|
517 | 0 | *result = aor; |
518 | 0 | return 1; |
519 | | |
520 | 0 | err: |
521 | 0 | IPAddressOrRange_free(aor); |
522 | 0 | return 0; |
523 | 0 | } |
524 | | |
525 | | /* |
526 | | * Construct a new address family or find an existing one. |
527 | | */ |
528 | | static IPAddressFamily *make_IPAddressFamily(IPAddrBlocks *addr, |
529 | | const unsigned afi, |
530 | | const unsigned *safi) |
531 | 0 | { |
532 | 0 | IPAddressFamily *f; |
533 | 0 | unsigned char key[3]; |
534 | 0 | int keylen; |
535 | 0 | int i; |
536 | |
|
537 | 0 | key[0] = (afi >> 8) & 0xFF; |
538 | 0 | key[1] = afi & 0xFF; |
539 | 0 | if (safi != NULL) { |
540 | 0 | key[2] = *safi & 0xFF; |
541 | 0 | keylen = 3; |
542 | 0 | } else { |
543 | 0 | keylen = 2; |
544 | 0 | } |
545 | |
|
546 | 0 | for (i = 0; i < sk_IPAddressFamily_num(addr); i++) { |
547 | 0 | f = sk_IPAddressFamily_value(addr, i); |
548 | 0 | if (f->addressFamily->length == keylen && !memcmp(f->addressFamily->data, key, keylen)) |
549 | 0 | return f; |
550 | 0 | } |
551 | | |
552 | 0 | if ((f = IPAddressFamily_new()) == NULL) |
553 | 0 | goto err; |
554 | 0 | if (f->ipAddressChoice == NULL && (f->ipAddressChoice = IPAddressChoice_new()) == NULL) |
555 | 0 | goto err; |
556 | 0 | if (f->addressFamily == NULL && (f->addressFamily = ASN1_OCTET_STRING_new()) == NULL) |
557 | 0 | goto err; |
558 | 0 | if (!ASN1_OCTET_STRING_set(f->addressFamily, key, keylen)) |
559 | 0 | goto err; |
560 | 0 | if (!sk_IPAddressFamily_push(addr, f)) |
561 | 0 | goto err; |
562 | | |
563 | 0 | return f; |
564 | | |
565 | 0 | err: |
566 | 0 | IPAddressFamily_free(f); |
567 | 0 | return NULL; |
568 | 0 | } |
569 | | |
570 | | /* |
571 | | * Add an inheritance element. |
572 | | */ |
573 | | int X509v3_addr_add_inherit(IPAddrBlocks *addr, |
574 | | unsigned afi, const unsigned *safi) |
575 | 0 | { |
576 | 0 | IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi); |
577 | |
|
578 | 0 | if (f == NULL || f->ipAddressChoice == NULL || (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges && f->ipAddressChoice->u.addressesOrRanges != NULL)) |
579 | 0 | return 0; |
580 | 0 | if (f->ipAddressChoice->type == IPAddressChoice_inherit && f->ipAddressChoice->u.inherit != NULL) |
581 | 0 | return 1; |
582 | 0 | if (f->ipAddressChoice->u.inherit == NULL && (f->ipAddressChoice->u.inherit = ASN1_NULL_new()) == NULL) |
583 | 0 | return 0; |
584 | 0 | f->ipAddressChoice->type = IPAddressChoice_inherit; |
585 | 0 | return 1; |
586 | 0 | } |
587 | | |
588 | | /* |
589 | | * Construct an IPAddressOrRange sequence, or return an existing one. |
590 | | */ |
591 | | static IPAddressOrRanges *make_prefix_or_range(IPAddrBlocks *addr, |
592 | | const unsigned afi, |
593 | | const unsigned *safi) |
594 | 0 | { |
595 | 0 | IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi); |
596 | 0 | IPAddressOrRanges *aors = NULL; |
597 | |
|
598 | 0 | if (f == NULL || f->ipAddressChoice == NULL || (f->ipAddressChoice->type == IPAddressChoice_inherit && f->ipAddressChoice->u.inherit != NULL)) |
599 | 0 | return NULL; |
600 | 0 | if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges) |
601 | 0 | aors = f->ipAddressChoice->u.addressesOrRanges; |
602 | 0 | if (aors != NULL) |
603 | 0 | return aors; |
604 | 0 | if ((aors = sk_IPAddressOrRange_new_null()) == NULL) |
605 | 0 | return NULL; |
606 | 0 | switch (afi) { |
607 | 0 | case IANA_AFI_IPV4: |
608 | 0 | (void)sk_IPAddressOrRange_set_cmp_func(aors, v4IPAddressOrRange_cmp); |
609 | 0 | break; |
610 | 0 | case IANA_AFI_IPV6: |
611 | 0 | (void)sk_IPAddressOrRange_set_cmp_func(aors, v6IPAddressOrRange_cmp); |
612 | 0 | break; |
613 | 0 | } |
614 | 0 | f->ipAddressChoice->type = IPAddressChoice_addressesOrRanges; |
615 | 0 | f->ipAddressChoice->u.addressesOrRanges = aors; |
616 | 0 | return aors; |
617 | 0 | } |
618 | | |
619 | | /* |
620 | | * Add a prefix. |
621 | | */ |
622 | | int X509v3_addr_add_prefix(IPAddrBlocks *addr, |
623 | | const unsigned afi, |
624 | | const unsigned *safi, |
625 | | unsigned char *a, int prefixlen) |
626 | 0 | { |
627 | 0 | IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi); |
628 | 0 | IPAddressOrRange *aor; |
629 | |
|
630 | 0 | if (aors == NULL |
631 | 0 | || !make_addressPrefix(&aor, a, prefixlen, length_from_afi(afi))) |
632 | 0 | return 0; |
633 | 0 | if (sk_IPAddressOrRange_push(aors, aor)) |
634 | 0 | return 1; |
635 | 0 | IPAddressOrRange_free(aor); |
636 | 0 | return 0; |
637 | 0 | } |
638 | | |
639 | | /* |
640 | | * Add a range. |
641 | | */ |
642 | | int X509v3_addr_add_range(IPAddrBlocks *addr, |
643 | | unsigned afi, |
644 | | const unsigned *safi, |
645 | | unsigned char *min, unsigned char *max) |
646 | 0 | { |
647 | 0 | IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi); |
648 | 0 | IPAddressOrRange *aor; |
649 | 0 | int length = length_from_afi(afi); |
650 | |
|
651 | 0 | if (aors == NULL) |
652 | 0 | return 0; |
653 | 0 | if (!make_addressRange(&aor, min, max, length)) |
654 | 0 | return 0; |
655 | 0 | if (sk_IPAddressOrRange_push(aors, aor)) |
656 | 0 | return 1; |
657 | 0 | IPAddressOrRange_free(aor); |
658 | 0 | return 0; |
659 | 0 | } |
660 | | |
661 | | /* |
662 | | * Extract min and max values from an IPAddressOrRange. |
663 | | */ |
664 | | static int extract_min_max(IPAddressOrRange *aor, |
665 | | unsigned char *min, unsigned char *max, int length) |
666 | 0 | { |
667 | 0 | if (aor == NULL || min == NULL || max == NULL) |
668 | 0 | return 0; |
669 | 0 | switch (aor->type) { |
670 | 0 | case IPAddressOrRange_addressPrefix: |
671 | 0 | return (addr_expand(min, aor->u.addressPrefix, length, 0x00) && addr_expand(max, aor->u.addressPrefix, length, 0xFF)); |
672 | 0 | case IPAddressOrRange_addressRange: |
673 | 0 | return (addr_expand(min, aor->u.addressRange->min, length, 0x00) && addr_expand(max, aor->u.addressRange->max, length, 0xFF)); |
674 | 0 | } |
675 | 0 | return 0; |
676 | 0 | } |
677 | | |
678 | | /* |
679 | | * Public wrapper for extract_min_max(). |
680 | | */ |
681 | | int X509v3_addr_get_range(IPAddressOrRange *aor, |
682 | | unsigned afi, |
683 | | unsigned char *min, |
684 | | unsigned char *max, int length) |
685 | 0 | { |
686 | 0 | int afi_length = length_from_afi(afi); |
687 | |
|
688 | 0 | if (aor == NULL || min == NULL || max == NULL || afi_length == 0 || length < afi_length || (aor->type != IPAddressOrRange_addressPrefix && aor->type != IPAddressOrRange_addressRange) || !extract_min_max(aor, min, max, afi_length)) |
689 | 0 | return 0; |
690 | | |
691 | 0 | return afi_length; |
692 | 0 | } |
693 | | |
694 | | /* |
695 | | * Sort comparison function for a sequence of IPAddressFamily. |
696 | | * |
697 | | * The last paragraph of RFC 3779 2.2.3.3 is slightly ambiguous about |
698 | | * the ordering: I can read it as meaning that IPv6 without a SAFI |
699 | | * comes before IPv4 with a SAFI, which seems pretty weird. The |
700 | | * examples in appendix B suggest that the author intended the |
701 | | * null-SAFI rule to apply only within a single AFI, which is what I |
702 | | * would have expected and is what the following code implements. |
703 | | */ |
704 | | static int IPAddressFamily_cmp(const IPAddressFamily *const *a_, |
705 | | const IPAddressFamily *const *b_) |
706 | 0 | { |
707 | 0 | const ASN1_OCTET_STRING *a = (*a_)->addressFamily; |
708 | 0 | const ASN1_OCTET_STRING *b = (*b_)->addressFamily; |
709 | 0 | int cmp, len = (a->length <= b->length) ? a->length : b->length; |
710 | |
|
711 | 0 | if (len > 0) { |
712 | 0 | cmp = memcmp(a->data, b->data, len); |
713 | 0 | if (cmp != 0) |
714 | 0 | return cmp; |
715 | 0 | } |
716 | | |
717 | 0 | return a->length - b->length; |
718 | 0 | } |
719 | | |
720 | | static int IPAddressFamily_check_len(const IPAddressFamily *f) |
721 | 0 | { |
722 | 0 | if (f->addressFamily->length < 2 || f->addressFamily->length > 3) |
723 | 0 | return 0; |
724 | 0 | else |
725 | 0 | return 1; |
726 | 0 | } |
727 | | |
728 | | /* |
729 | | * Check whether an IPAddrBLocks is in canonical form. |
730 | | */ |
731 | | int X509v3_addr_is_canonical(IPAddrBlocks *addr) |
732 | 0 | { |
733 | 0 | unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN]; |
734 | 0 | unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN]; |
735 | 0 | IPAddressOrRanges *aors; |
736 | 0 | int i, j, k; |
737 | | |
738 | | /* |
739 | | * Empty extension is canonical. |
740 | | */ |
741 | 0 | if (addr == NULL) |
742 | 0 | return 1; |
743 | | |
744 | | /* |
745 | | * Check whether the top-level list is in order. |
746 | | */ |
747 | 0 | for (i = 0; i < sk_IPAddressFamily_num(addr) - 1; i++) { |
748 | 0 | const IPAddressFamily *a = sk_IPAddressFamily_value(addr, i); |
749 | 0 | const IPAddressFamily *b = sk_IPAddressFamily_value(addr, i + 1); |
750 | |
|
751 | 0 | if (!IPAddressFamily_check_len(a) || !IPAddressFamily_check_len(b)) |
752 | 0 | return 0; |
753 | | |
754 | 0 | if (IPAddressFamily_cmp(&a, &b) >= 0) |
755 | 0 | return 0; |
756 | 0 | } |
757 | | |
758 | | /* |
759 | | * Top level's ok, now check each address family. |
760 | | */ |
761 | 0 | for (i = 0; i < sk_IPAddressFamily_num(addr); i++) { |
762 | 0 | IPAddressFamily *f = sk_IPAddressFamily_value(addr, i); |
763 | 0 | int length = length_from_afi(X509v3_addr_get_afi(f)); |
764 | | |
765 | | /* |
766 | | * Inheritance is canonical. Anything other than inheritance or |
767 | | * a SEQUENCE OF IPAddressOrRange is an ASN.1 error or something. |
768 | | */ |
769 | 0 | if (f == NULL || f->ipAddressChoice == NULL) |
770 | 0 | return 0; |
771 | 0 | switch (f->ipAddressChoice->type) { |
772 | 0 | case IPAddressChoice_inherit: |
773 | 0 | continue; |
774 | 0 | case IPAddressChoice_addressesOrRanges: |
775 | 0 | break; |
776 | 0 | default: |
777 | 0 | return 0; |
778 | 0 | } |
779 | | |
780 | 0 | if (!IPAddressFamily_check_len(f)) |
781 | 0 | return 0; |
782 | | |
783 | | /* |
784 | | * It's an IPAddressOrRanges sequence, check it. |
785 | | */ |
786 | 0 | aors = f->ipAddressChoice->u.addressesOrRanges; |
787 | 0 | if (sk_IPAddressOrRange_num(aors) == 0) |
788 | 0 | return 0; |
789 | | |
790 | 0 | for (j = 0; j < sk_IPAddressOrRange_num(aors) - 1; j++) { |
791 | 0 | IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j); |
792 | 0 | IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, j + 1); |
793 | |
|
794 | 0 | if (!extract_min_max(a, a_min, a_max, length) || !extract_min_max(b, b_min, b_max, length)) |
795 | 0 | return 0; |
796 | | |
797 | | /* |
798 | | * Punt misordered list, overlapping start, or inverted range. |
799 | | */ |
800 | 0 | if (memcmp(a_min, b_min, length) >= 0 || memcmp(a_min, a_max, length) > 0 || memcmp(b_min, b_max, length) > 0) |
801 | 0 | return 0; |
802 | | |
803 | | /* |
804 | | * Punt if adjacent or overlapping. Check for adjacency by |
805 | | * subtracting one from b_min first. |
806 | | */ |
807 | 0 | for (k = length - 1; k >= 0 && b_min[k]-- == 0x00; k--) |
808 | 0 | ; |
809 | 0 | if (memcmp(a_max, b_min, length) >= 0) |
810 | 0 | return 0; |
811 | | |
812 | | /* |
813 | | * Check for range that should be expressed as a prefix. |
814 | | */ |
815 | 0 | if (a->type == IPAddressOrRange_addressRange && range_should_be_prefix(a_min, a_max, length) >= 0) |
816 | 0 | return 0; |
817 | 0 | } |
818 | | |
819 | | /* |
820 | | * Check range to see if it's inverted or should be a |
821 | | * prefix. |
822 | | */ |
823 | 0 | j = sk_IPAddressOrRange_num(aors) - 1; |
824 | 0 | { |
825 | 0 | IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j); |
826 | |
|
827 | 0 | if (a != NULL && a->type == IPAddressOrRange_addressRange) { |
828 | 0 | if (!extract_min_max(a, a_min, a_max, length)) |
829 | 0 | return 0; |
830 | 0 | if (memcmp(a_min, a_max, length) > 0 || range_should_be_prefix(a_min, a_max, length) >= 0) |
831 | 0 | return 0; |
832 | 0 | } |
833 | 0 | } |
834 | 0 | } |
835 | | |
836 | | /* |
837 | | * If we made it through all that, we're happy. |
838 | | */ |
839 | 0 | return 1; |
840 | 0 | } |
841 | | |
842 | | /* |
843 | | * Whack an IPAddressOrRanges into canonical form. |
844 | | * |
845 | | * After the initial sort, the merge runs as a single linear sweep |
846 | | * over the list using a write index. Adjacent entries are folded |
847 | | * into the previous output by replacing it with a freshly built |
848 | | * merged range; both old entries are then freed and the consumed |
849 | | * source slot is recorded as NULL. Total cost is O(N log N) sort + |
850 | | * O(N) merge, with no stack deletes inside the loop. |
851 | | * |
852 | | * The NULL slots are closed up by a single compaction pass at the end, |
853 | | * which runs whether the sweep succeeded or failed. This guarantees |
854 | | * the live stack is always left hole-free, with every occupied slot |
855 | | * non-NULL, so on error the caller may safely inspect, print, encode, |
856 | | * free, or retry canonize on the object. The sort comparator |
857 | | * dereferences every slot with no NULL guard, so a retry (which |
858 | | * re-sorts) would crash on a hole. is_canonical tolerates NULL by |
859 | | * returning non-canonical, but the object is still structurally |
860 | | * invalid. |
861 | | */ |
862 | | static int IPAddressOrRanges_canonize(IPAddressOrRanges *aors, |
863 | | const unsigned afi) |
864 | 0 | { |
865 | 0 | int length = length_from_afi(afi); |
866 | 0 | int read, write = 0, n; |
867 | 0 | int ret = 0; |
868 | |
|
869 | 0 | sk_IPAddressOrRange_sort(aors); |
870 | 0 | n = sk_IPAddressOrRange_num(aors); |
871 | |
|
872 | 0 | for (read = 0; read < n; read++) { |
873 | 0 | IPAddressOrRange *cur = sk_IPAddressOrRange_value(aors, read); |
874 | 0 | unsigned char c_min[ADDR_RAW_BUF_LEN], c_max[ADDR_RAW_BUF_LEN]; |
875 | |
|
876 | 0 | if (!extract_min_max(cur, c_min, c_max, length)) |
877 | 0 | goto done; |
878 | | |
879 | | /* |
880 | | * Punt inverted range. |
881 | | */ |
882 | 0 | if (memcmp(c_min, c_max, length) > 0) |
883 | 0 | goto done; |
884 | | |
885 | 0 | if (write > 0) { |
886 | 0 | IPAddressOrRange *prev = sk_IPAddressOrRange_value(aors, |
887 | 0 | write - 1); |
888 | 0 | unsigned char p_min[ADDR_RAW_BUF_LEN], p_max[ADDR_RAW_BUF_LEN]; |
889 | 0 | unsigned char c_min_minus_one[ADDR_RAW_BUF_LEN]; |
890 | 0 | int j; |
891 | |
|
892 | 0 | if (!extract_min_max(prev, p_min, p_max, length)) |
893 | 0 | goto done; |
894 | | |
895 | | /* |
896 | | * Reject overlap with the previous accepted entry. |
897 | | */ |
898 | 0 | if (memcmp(p_max, c_min, length) >= 0) |
899 | 0 | goto done; |
900 | | |
901 | | /* |
902 | | * Adjacency test: does c_min - 1 equal p_max? Work on a |
903 | | * scratch copy so the original c_min stays intact for use |
904 | | * as the lower bound if we end up keeping cur. |
905 | | */ |
906 | 0 | memcpy(c_min_minus_one, c_min, length); |
907 | 0 | for (j = length - 1; |
908 | 0 | j >= 0 && c_min_minus_one[j]-- == 0x00; |
909 | 0 | j--) |
910 | 0 | ; |
911 | 0 | if (memcmp(p_max, c_min_minus_one, length) == 0) { |
912 | 0 | IPAddressOrRange *merged; |
913 | |
|
914 | 0 | if (!make_addressRange(&merged, p_min, c_max, length)) |
915 | 0 | goto done; |
916 | | /* |
917 | | * Replace prev with merged, free the originals, and |
918 | | * record the consumed source slot as NULL; the epilogue |
919 | | * compacts NULLs out of the live stack so it is left |
920 | | * hole-free whether we succeed or fail. |
921 | | */ |
922 | 0 | (void)sk_IPAddressOrRange_set(aors, write - 1, merged); |
923 | 0 | IPAddressOrRange_free(prev); |
924 | 0 | IPAddressOrRange_free(cur); |
925 | 0 | (void)sk_IPAddressOrRange_set(aors, read, NULL); |
926 | 0 | continue; |
927 | 0 | } |
928 | 0 | } |
929 | | |
930 | | /* |
931 | | * Keep cur. Slide it forward into the write slot if we have |
932 | | * fallen behind, and NULL the source slot to avoid duplicate |
933 | | * ownership. |
934 | | */ |
935 | 0 | if (write != read) { |
936 | 0 | (void)sk_IPAddressOrRange_set(aors, write, cur); |
937 | 0 | (void)sk_IPAddressOrRange_set(aors, read, NULL); |
938 | 0 | } |
939 | 0 | write++; |
940 | 0 | } |
941 | | |
942 | 0 | ret = 1; |
943 | |
|
944 | 0 | done: |
945 | | /* |
946 | | * The sweep above NULLs source slots as it folds entries. Whether |
947 | | * we succeeded or bailed out on an error, the stack must be left |
948 | | * hole-free, with every occupied slot non-NULL, so that the caller |
949 | | * may inspect, print, encode, free, or even retry canonize on the |
950 | | * object without dereferencing NULL. Slide every non-NULL slot |
951 | | * forward to close the holes, then pop the vacated tail. On success |
952 | | * this collapses [write..n-1] (all NULL) to length `write`; on error |
953 | | * it removes the possibly empty contiguous run of NULL slots in |
954 | | * [write, read), preserving the processed output in [0, write) and |
955 | | * the untouched original entries in [read, n). |
956 | | */ |
957 | 0 | { |
958 | 0 | int w = 0, r; |
959 | |
|
960 | 0 | for (r = 0; r < sk_IPAddressOrRange_num(aors); r++) { |
961 | 0 | IPAddressOrRange *v = sk_IPAddressOrRange_value(aors, r); |
962 | |
|
963 | 0 | if (v != NULL) { |
964 | 0 | if (w != r) |
965 | 0 | (void)sk_IPAddressOrRange_set(aors, w, v); |
966 | 0 | w++; |
967 | 0 | } |
968 | 0 | } |
969 | 0 | while (sk_IPAddressOrRange_num(aors) > w) |
970 | 0 | (void)sk_IPAddressOrRange_pop(aors); |
971 | 0 | } |
972 | |
|
973 | 0 | return ret; |
974 | 0 | } |
975 | | |
976 | | /* |
977 | | * Whack an IPAddrBlocks extension into canonical form. |
978 | | */ |
979 | | int X509v3_addr_canonize(IPAddrBlocks *addr) |
980 | 0 | { |
981 | 0 | int i; |
982 | |
|
983 | 0 | if (addr == NULL) { |
984 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_INVALID_NULL_ARGUMENT); |
985 | 0 | return 0; |
986 | 0 | } |
987 | | |
988 | 0 | for (i = 0; i < sk_IPAddressFamily_num(addr); i++) { |
989 | 0 | IPAddressFamily *f = sk_IPAddressFamily_value(addr, i); |
990 | |
|
991 | 0 | if (!IPAddressFamily_check_len(f)) |
992 | 0 | return 0; |
993 | | |
994 | 0 | if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges && !IPAddressOrRanges_canonize(f->ipAddressChoice->u.addressesOrRanges, X509v3_addr_get_afi(f))) |
995 | 0 | return 0; |
996 | 0 | } |
997 | 0 | (void)sk_IPAddressFamily_set_cmp_func(addr, IPAddressFamily_cmp); |
998 | 0 | sk_IPAddressFamily_sort(addr); |
999 | 0 | if (!ossl_assert(X509v3_addr_is_canonical(addr))) |
1000 | 0 | return 0; |
1001 | 0 | return 1; |
1002 | 0 | } |
1003 | | |
1004 | | /* |
1005 | | * v2i handler for the IPAddrBlocks extension. |
1006 | | */ |
1007 | | static void *v2i_IPAddrBlocks(const struct v3_ext_method *method, |
1008 | | struct v3_ext_ctx *ctx, |
1009 | | STACK_OF(CONF_VALUE) *values) |
1010 | 0 | { |
1011 | 0 | static const char v4addr_chars[] = "0123456789."; |
1012 | 0 | static const char v6addr_chars[] = "0123456789.:abcdefABCDEF"; |
1013 | 0 | IPAddrBlocks *addr = NULL; |
1014 | 0 | char *s = NULL, *t; |
1015 | 0 | int i; |
1016 | |
|
1017 | 0 | if ((addr = sk_IPAddressFamily_new(IPAddressFamily_cmp)) == NULL) { |
1018 | 0 | ERR_raise(ERR_LIB_X509V3, ERR_R_CRYPTO_LIB); |
1019 | 0 | return NULL; |
1020 | 0 | } |
1021 | | |
1022 | 0 | for (i = 0; i < sk_CONF_VALUE_num(values); i++) { |
1023 | 0 | CONF_VALUE *val = sk_CONF_VALUE_value(values, i); |
1024 | 0 | unsigned char min[ADDR_RAW_BUF_LEN], max[ADDR_RAW_BUF_LEN]; |
1025 | 0 | unsigned afi, *safi = NULL, safi_; |
1026 | 0 | const char *addr_chars = NULL; |
1027 | 0 | int prefixlen, i1, i2, delim, length; |
1028 | |
|
1029 | 0 | if (!ossl_v3_name_cmp(val->name, "IPv4")) { |
1030 | 0 | afi = IANA_AFI_IPV4; |
1031 | 0 | } else if (!ossl_v3_name_cmp(val->name, "IPv6")) { |
1032 | 0 | afi = IANA_AFI_IPV6; |
1033 | 0 | } else if (!ossl_v3_name_cmp(val->name, "IPv4-SAFI")) { |
1034 | 0 | afi = IANA_AFI_IPV4; |
1035 | 0 | safi = &safi_; |
1036 | 0 | } else if (!ossl_v3_name_cmp(val->name, "IPv6-SAFI")) { |
1037 | 0 | afi = IANA_AFI_IPV6; |
1038 | 0 | safi = &safi_; |
1039 | 0 | } else { |
1040 | 0 | ERR_raise_data(ERR_LIB_X509V3, X509V3_R_EXTENSION_NAME_ERROR, |
1041 | 0 | "%s", val->name); |
1042 | 0 | goto err; |
1043 | 0 | } |
1044 | | |
1045 | 0 | switch (afi) { |
1046 | 0 | case IANA_AFI_IPV4: |
1047 | 0 | addr_chars = v4addr_chars; |
1048 | 0 | break; |
1049 | 0 | case IANA_AFI_IPV6: |
1050 | 0 | addr_chars = v6addr_chars; |
1051 | 0 | break; |
1052 | 0 | } |
1053 | | |
1054 | 0 | length = length_from_afi(afi); |
1055 | | |
1056 | | /* |
1057 | | * Handle SAFI, if any, and OPENSSL_strdup() so we can null-terminate |
1058 | | * the other input values. |
1059 | | */ |
1060 | 0 | if (safi != NULL) { |
1061 | 0 | if (val->value == NULL) { |
1062 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_MISSING_VALUE); |
1063 | 0 | goto err; |
1064 | 0 | } |
1065 | 0 | *safi = strtoul(val->value, &t, 0); |
1066 | 0 | t += strspn(t, " \t"); |
1067 | 0 | if (*safi > 0xFF || *t++ != ':') { |
1068 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_INVALID_SAFI); |
1069 | 0 | X509V3_conf_add_error_name_value(val); |
1070 | 0 | goto err; |
1071 | 0 | } |
1072 | 0 | t += strspn(t, " \t"); |
1073 | 0 | s = OPENSSL_strdup(t); |
1074 | 0 | } else { |
1075 | 0 | s = OPENSSL_strdup(val->value); |
1076 | 0 | } |
1077 | 0 | if (s == NULL) |
1078 | 0 | goto err; |
1079 | | |
1080 | | /* |
1081 | | * Check for inheritance. Not worth additional complexity to |
1082 | | * optimize this (seldom-used) case. |
1083 | | */ |
1084 | 0 | if (strcmp(s, "inherit") == 0) { |
1085 | 0 | if (!X509v3_addr_add_inherit(addr, afi, safi)) { |
1086 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_INVALID_INHERITANCE); |
1087 | 0 | X509V3_conf_add_error_name_value(val); |
1088 | 0 | goto err; |
1089 | 0 | } |
1090 | 0 | OPENSSL_free(s); |
1091 | 0 | s = NULL; |
1092 | 0 | continue; |
1093 | 0 | } |
1094 | | |
1095 | 0 | i1 = (int)strspn(s, addr_chars); |
1096 | 0 | i2 = i1 + (int)strspn(s + i1, " \t"); |
1097 | 0 | delim = s[i2++]; |
1098 | 0 | s[i1] = '\0'; |
1099 | |
|
1100 | 0 | if (ossl_a2i_ipadd(min, s) != length) { |
1101 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_INVALID_IPADDRESS); |
1102 | 0 | X509V3_conf_add_error_name_value(val); |
1103 | 0 | goto err; |
1104 | 0 | } |
1105 | | |
1106 | 0 | switch (delim) { |
1107 | 0 | case '/': |
1108 | 0 | prefixlen = (int)strtoul(s + i2, &t, 10); |
1109 | 0 | if (t == s + i2 |
1110 | 0 | || *t != '\0' |
1111 | 0 | || prefixlen > (length * 8) |
1112 | 0 | || prefixlen < 0) { |
1113 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_EXTENSION_VALUE_ERROR); |
1114 | 0 | X509V3_conf_add_error_name_value(val); |
1115 | 0 | goto err; |
1116 | 0 | } |
1117 | 0 | if (!X509v3_addr_add_prefix(addr, afi, safi, min, prefixlen)) { |
1118 | 0 | ERR_raise(ERR_LIB_X509V3, ERR_R_X509V3_LIB); |
1119 | 0 | goto err; |
1120 | 0 | } |
1121 | 0 | break; |
1122 | 0 | case '-': |
1123 | 0 | i1 = i2 + (int)strspn(s + i2, " \t"); |
1124 | 0 | i2 = i1 + (int)strspn(s + i1, addr_chars); |
1125 | 0 | if (i1 == i2 || s[i2] != '\0') { |
1126 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_EXTENSION_VALUE_ERROR); |
1127 | 0 | X509V3_conf_add_error_name_value(val); |
1128 | 0 | goto err; |
1129 | 0 | } |
1130 | 0 | if (ossl_a2i_ipadd(max, s + i1) != length) { |
1131 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_INVALID_IPADDRESS); |
1132 | 0 | X509V3_conf_add_error_name_value(val); |
1133 | 0 | goto err; |
1134 | 0 | } |
1135 | 0 | if (memcmp(min, max, length_from_afi(afi)) > 0) { |
1136 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_EXTENSION_VALUE_ERROR); |
1137 | 0 | X509V3_conf_add_error_name_value(val); |
1138 | 0 | goto err; |
1139 | 0 | } |
1140 | 0 | if (!X509v3_addr_add_range(addr, afi, safi, min, max)) { |
1141 | 0 | ERR_raise(ERR_LIB_X509V3, ERR_R_X509V3_LIB); |
1142 | 0 | goto err; |
1143 | 0 | } |
1144 | 0 | break; |
1145 | 0 | case '\0': |
1146 | 0 | if (!X509v3_addr_add_prefix(addr, afi, safi, min, length * 8)) { |
1147 | 0 | ERR_raise(ERR_LIB_X509V3, ERR_R_X509V3_LIB); |
1148 | 0 | goto err; |
1149 | 0 | } |
1150 | 0 | break; |
1151 | 0 | default: |
1152 | 0 | ERR_raise(ERR_LIB_X509V3, X509V3_R_EXTENSION_VALUE_ERROR); |
1153 | 0 | X509V3_conf_add_error_name_value(val); |
1154 | 0 | goto err; |
1155 | 0 | } |
1156 | | |
1157 | 0 | OPENSSL_free(s); |
1158 | 0 | s = NULL; |
1159 | 0 | } |
1160 | | |
1161 | | /* |
1162 | | * Canonize the result, then we're done. |
1163 | | */ |
1164 | 0 | if (!X509v3_addr_canonize(addr)) |
1165 | 0 | goto err; |
1166 | 0 | return addr; |
1167 | | |
1168 | 0 | err: |
1169 | 0 | OPENSSL_free(s); |
1170 | 0 | sk_IPAddressFamily_pop_free(addr, IPAddressFamily_free); |
1171 | 0 | return NULL; |
1172 | 0 | } |
1173 | | |
1174 | | /* |
1175 | | * OpenSSL dispatch |
1176 | | */ |
1177 | | const X509V3_EXT_METHOD ossl_v3_addr = { |
1178 | | NID_sbgp_ipAddrBlock, /* nid */ |
1179 | | 0, /* flags */ |
1180 | | ASN1_ITEM_ref(IPAddrBlocks), /* template */ |
1181 | | 0, 0, 0, 0, /* old functions, ignored */ |
1182 | | 0, /* i2s */ |
1183 | | 0, /* s2i */ |
1184 | | 0, /* i2v */ |
1185 | | v2i_IPAddrBlocks, /* v2i */ |
1186 | | i2r_IPAddrBlocks, /* i2r */ |
1187 | | 0, /* r2i */ |
1188 | | NULL /* extension-specific data */ |
1189 | | }; |
1190 | | |
1191 | | /* |
1192 | | * Figure out whether extension sues inheritance. |
1193 | | */ |
1194 | | int X509v3_addr_inherits(IPAddrBlocks *addr) |
1195 | 0 | { |
1196 | 0 | int i; |
1197 | |
|
1198 | 0 | if (addr == NULL) |
1199 | 0 | return 0; |
1200 | 0 | for (i = 0; i < sk_IPAddressFamily_num(addr); i++) { |
1201 | 0 | IPAddressFamily *f = sk_IPAddressFamily_value(addr, i); |
1202 | |
|
1203 | 0 | if (f->ipAddressChoice->type == IPAddressChoice_inherit) |
1204 | 0 | return 1; |
1205 | 0 | } |
1206 | 0 | return 0; |
1207 | 0 | } |
1208 | | |
1209 | | /* |
1210 | | * Figure out whether parent contains child. |
1211 | | */ |
1212 | | static int addr_contains(IPAddressOrRanges *parent, |
1213 | | IPAddressOrRanges *child, int length) |
1214 | 0 | { |
1215 | 0 | unsigned char p_min[ADDR_RAW_BUF_LEN], p_max[ADDR_RAW_BUF_LEN]; |
1216 | 0 | unsigned char c_min[ADDR_RAW_BUF_LEN], c_max[ADDR_RAW_BUF_LEN]; |
1217 | 0 | int p, c; |
1218 | |
|
1219 | 0 | if (child == NULL || parent == child) |
1220 | 0 | return 1; |
1221 | 0 | if (parent == NULL) |
1222 | 0 | return 0; |
1223 | | |
1224 | 0 | p = 0; |
1225 | 0 | for (c = 0; c < sk_IPAddressOrRange_num(child); c++) { |
1226 | 0 | if (!extract_min_max(sk_IPAddressOrRange_value(child, c), |
1227 | 0 | c_min, c_max, length)) |
1228 | 0 | return 0; |
1229 | 0 | for (;; p++) { |
1230 | 0 | if (p >= sk_IPAddressOrRange_num(parent)) |
1231 | 0 | return 0; |
1232 | 0 | if (!extract_min_max(sk_IPAddressOrRange_value(parent, p), |
1233 | 0 | p_min, p_max, length)) |
1234 | 0 | return 0; |
1235 | 0 | if (memcmp(p_max, c_max, length) < 0) |
1236 | 0 | continue; |
1237 | 0 | if (memcmp(p_min, c_min, length) > 0) |
1238 | 0 | return 0; |
1239 | 0 | break; |
1240 | 0 | } |
1241 | 0 | } |
1242 | | |
1243 | 0 | return 1; |
1244 | 0 | } |
1245 | | |
1246 | | /* |
1247 | | * Test whether a is a subset of b. |
1248 | | */ |
1249 | | int X509v3_addr_subset(IPAddrBlocks *a, IPAddrBlocks *b) |
1250 | 0 | { |
1251 | 0 | int i; |
1252 | |
|
1253 | 0 | if (a == NULL || a == b) |
1254 | 0 | return 1; |
1255 | 0 | if (b == NULL || X509v3_addr_inherits(a) || X509v3_addr_inherits(b)) |
1256 | 0 | return 0; |
1257 | 0 | (void)sk_IPAddressFamily_set_cmp_func(b, IPAddressFamily_cmp); |
1258 | 0 | sk_IPAddressFamily_sort(b); |
1259 | | /* Could sort a here too and get O(|a|) running time instead of O(|a| ln |b|) */ |
1260 | 0 | for (i = 0; i < sk_IPAddressFamily_num(a); i++) { |
1261 | 0 | IPAddressFamily *fa = sk_IPAddressFamily_value(a, i); |
1262 | 0 | int j = sk_IPAddressFamily_find(b, fa); |
1263 | 0 | IPAddressFamily *fb = sk_IPAddressFamily_value(b, j); |
1264 | |
|
1265 | 0 | if (fb == NULL) |
1266 | 0 | return 0; |
1267 | 0 | if (!IPAddressFamily_check_len(fa) || !IPAddressFamily_check_len(fb)) |
1268 | 0 | return 0; |
1269 | 0 | if (!addr_contains(fb->ipAddressChoice->u.addressesOrRanges, |
1270 | 0 | fa->ipAddressChoice->u.addressesOrRanges, |
1271 | 0 | length_from_afi(X509v3_addr_get_afi(fb)))) |
1272 | 0 | return 0; |
1273 | 0 | } |
1274 | 0 | return 1; |
1275 | 0 | } |
1276 | | |
1277 | | /* |
1278 | | * Validation error handling via callback. |
1279 | | */ |
1280 | | #define validation_err(_err_) \ |
1281 | 0 | do { \ |
1282 | 0 | if (ctx != NULL) { \ |
1283 | 0 | ctx->error = _err_; \ |
1284 | 0 | ctx->error_depth = i; \ |
1285 | 0 | ctx->current_cert = x; \ |
1286 | 0 | rv = ctx->verify_cb(0, ctx); \ |
1287 | 0 | } else { \ |
1288 | 0 | rv = 0; \ |
1289 | 0 | } \ |
1290 | 0 | if (rv == 0) \ |
1291 | 0 | goto done; \ |
1292 | 0 | } while (0) |
1293 | | |
1294 | | /* |
1295 | | * Core code for RFC 3779 2.3 path validation. |
1296 | | * |
1297 | | * Returns 1 for success, 0 on error. |
1298 | | * |
1299 | | * When returning 0, ctx->error MUST be set to an appropriate value other than |
1300 | | * X509_V_OK. |
1301 | | */ |
1302 | | static int addr_validate_path_internal(X509_STORE_CTX *ctx, |
1303 | | const STACK_OF(X509) *chain, |
1304 | | IPAddrBlocks *ext) |
1305 | 0 | { |
1306 | 0 | IPAddrBlocks *child = NULL; |
1307 | 0 | int i, j, ret = 0, rv; |
1308 | 0 | X509 *x; |
1309 | |
|
1310 | 0 | if (!ossl_assert(chain != NULL && sk_X509_num(chain) > 0) |
1311 | 0 | || !ossl_assert(ctx != NULL || ext != NULL) |
1312 | 0 | || !ossl_assert(ctx == NULL || ctx->verify_cb != NULL)) { |
1313 | 0 | if (ctx != NULL) |
1314 | 0 | ctx->error = X509_V_ERR_UNSPECIFIED; |
1315 | 0 | return 0; |
1316 | 0 | } |
1317 | | |
1318 | | /* |
1319 | | * Figure out where to start. If we don't have an extension to |
1320 | | * check, we're done. Otherwise, check canonical form and |
1321 | | * set up for walking up the chain. |
1322 | | */ |
1323 | 0 | if (ext != NULL) { |
1324 | 0 | i = -1; |
1325 | 0 | x = NULL; |
1326 | 0 | } else { |
1327 | 0 | i = 0; |
1328 | 0 | x = sk_X509_value(chain, i); |
1329 | 0 | if ((ext = x->rfc3779_addr) == NULL) |
1330 | 0 | return 1; /* Return success */ |
1331 | 0 | } |
1332 | 0 | if (!X509v3_addr_is_canonical(ext)) |
1333 | 0 | validation_err(X509_V_ERR_INVALID_EXTENSION); |
1334 | 0 | (void)sk_IPAddressFamily_set_cmp_func(ext, IPAddressFamily_cmp); |
1335 | 0 | if ((child = sk_IPAddressFamily_dup(ext)) == NULL) { |
1336 | 0 | ERR_raise(ERR_LIB_X509V3, ERR_R_CRYPTO_LIB); |
1337 | 0 | if (ctx != NULL) |
1338 | 0 | ctx->error = X509_V_ERR_OUT_OF_MEM; |
1339 | 0 | goto done; |
1340 | 0 | } |
1341 | 0 | sk_IPAddressFamily_sort(child); |
1342 | | |
1343 | | /* |
1344 | | * Now walk up the chain. No cert may list resources that its |
1345 | | * parent doesn't list. |
1346 | | */ |
1347 | 0 | for (i++; i < sk_X509_num(chain); i++) { |
1348 | 0 | x = sk_X509_value(chain, i); |
1349 | 0 | if (!X509v3_addr_is_canonical(x->rfc3779_addr)) |
1350 | 0 | validation_err(X509_V_ERR_INVALID_EXTENSION); |
1351 | 0 | if (x->rfc3779_addr == NULL) { |
1352 | 0 | for (j = 0; j < sk_IPAddressFamily_num(child); j++) { |
1353 | 0 | IPAddressFamily *fc = sk_IPAddressFamily_value(child, j); |
1354 | |
|
1355 | 0 | if (!IPAddressFamily_check_len(fc)) |
1356 | 0 | goto done; |
1357 | | |
1358 | 0 | if (fc->ipAddressChoice->type != IPAddressChoice_inherit) { |
1359 | 0 | validation_err(X509_V_ERR_UNNESTED_RESOURCE); |
1360 | 0 | break; |
1361 | 0 | } |
1362 | 0 | } |
1363 | 0 | continue; |
1364 | 0 | } |
1365 | 0 | (void)sk_IPAddressFamily_set_cmp_func(x->rfc3779_addr, |
1366 | 0 | IPAddressFamily_cmp); |
1367 | 0 | sk_IPAddressFamily_sort(x->rfc3779_addr); |
1368 | 0 | for (j = 0; j < sk_IPAddressFamily_num(child); j++) { |
1369 | 0 | IPAddressFamily *fc = sk_IPAddressFamily_value(child, j); |
1370 | 0 | int k = sk_IPAddressFamily_find(x->rfc3779_addr, fc); |
1371 | 0 | IPAddressFamily *fp = sk_IPAddressFamily_value(x->rfc3779_addr, k); |
1372 | |
|
1373 | 0 | if (fp == NULL) { |
1374 | 0 | if (fc->ipAddressChoice->type == IPAddressChoice_addressesOrRanges) { |
1375 | 0 | validation_err(X509_V_ERR_UNNESTED_RESOURCE); |
1376 | 0 | break; |
1377 | 0 | } |
1378 | 0 | continue; |
1379 | 0 | } |
1380 | | |
1381 | 0 | if (!IPAddressFamily_check_len(fc) || !IPAddressFamily_check_len(fp)) |
1382 | 0 | goto done; |
1383 | | |
1384 | 0 | if (fp->ipAddressChoice->type == IPAddressChoice_addressesOrRanges) { |
1385 | 0 | if (fc->ipAddressChoice->type == IPAddressChoice_inherit |
1386 | 0 | || addr_contains(fp->ipAddressChoice->u.addressesOrRanges, |
1387 | 0 | fc->ipAddressChoice->u.addressesOrRanges, |
1388 | 0 | length_from_afi(X509v3_addr_get_afi(fc)))) |
1389 | 0 | (void)sk_IPAddressFamily_set(child, j, fp); |
1390 | 0 | else |
1391 | 0 | validation_err(X509_V_ERR_UNNESTED_RESOURCE); |
1392 | 0 | } |
1393 | 0 | } |
1394 | 0 | } |
1395 | | |
1396 | | /* |
1397 | | * Trust anchor can't inherit. |
1398 | | */ |
1399 | 0 | if (x->rfc3779_addr != NULL) { |
1400 | 0 | for (j = 0; j < sk_IPAddressFamily_num(x->rfc3779_addr); j++) { |
1401 | 0 | IPAddressFamily *fp = sk_IPAddressFamily_value(x->rfc3779_addr, j); |
1402 | |
|
1403 | 0 | if (!IPAddressFamily_check_len(fp)) |
1404 | 0 | goto done; |
1405 | | |
1406 | 0 | if (fp->ipAddressChoice->type == IPAddressChoice_inherit |
1407 | 0 | && sk_IPAddressFamily_find(child, fp) >= 0) |
1408 | 0 | validation_err(X509_V_ERR_UNNESTED_RESOURCE); |
1409 | 0 | } |
1410 | 0 | } |
1411 | 0 | ret = 1; |
1412 | 0 | done: |
1413 | 0 | sk_IPAddressFamily_free(child); |
1414 | 0 | return ret; |
1415 | 0 | } |
1416 | | |
1417 | | #undef validation_err |
1418 | | |
1419 | | /* |
1420 | | * RFC 3779 2.3 path validation -- called from X509_verify_cert(). |
1421 | | */ |
1422 | | int X509v3_addr_validate_path(X509_STORE_CTX *ctx) |
1423 | 0 | { |
1424 | 0 | if (ctx->chain == NULL |
1425 | 0 | || sk_X509_num(ctx->chain) == 0 |
1426 | 0 | || ctx->verify_cb == NULL) { |
1427 | 0 | ctx->error = X509_V_ERR_UNSPECIFIED; |
1428 | 0 | return 0; |
1429 | 0 | } |
1430 | 0 | return addr_validate_path_internal(ctx, ctx->chain, NULL); |
1431 | 0 | } |
1432 | | |
1433 | | /* |
1434 | | * RFC 3779 2.3 path validation of an extension. |
1435 | | * Test whether chain covers extension. |
1436 | | */ |
1437 | | int X509v3_addr_validate_resource_set(const STACK_OF(X509) *chain, |
1438 | | IPAddrBlocks *ext, int allow_inheritance) |
1439 | 0 | { |
1440 | 0 | if (ext == NULL) |
1441 | 0 | return 1; |
1442 | 0 | if (chain == NULL || sk_X509_num(chain) == 0) |
1443 | 0 | return 0; |
1444 | 0 | if (!allow_inheritance && X509v3_addr_inherits(ext)) |
1445 | 0 | return 0; |
1446 | 0 | return addr_validate_path_internal(NULL, chain, ext); |
1447 | 0 | } |
1448 | | |
1449 | | #endif /* OPENSSL_NO_RFC3779 */ |