2 * Contributed to the OpenSSL Project by the American Registry for
3 * Internet Numbers ("ARIN").
5 /* ====================================================================
6 * Copyright (c) 2006 The OpenSSL Project. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
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
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/)"
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.
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.
34 * 6. Redistributions of any form whatsoever must retain the following
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
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 * ====================================================================
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).
59 * Implementation of RFC 3779 section 2.2.
66 #include <openssl/conf.h>
67 #include <openssl/asn1.h>
68 #include <openssl/asn1t.h>
69 #include <openssl/buffer.h>
70 #include <openssl/x509v3.h>
72 #ifndef OPENSSL_NO_RFC3779
75 * OpenSSL ASN.1 template translation of RFC 3779 2.2.3.
78 ASN1_SEQUENCE(IPAddressRange) = {
79 ASN1_SIMPLE(IPAddressRange, min, ASN1_BIT_STRING),
80 ASN1_SIMPLE(IPAddressRange, max, ASN1_BIT_STRING)
81 } ASN1_SEQUENCE_END(IPAddressRange)
83 ASN1_CHOICE(IPAddressOrRange) = {
84 ASN1_SIMPLE(IPAddressOrRange, u.addressPrefix, ASN1_BIT_STRING),
85 ASN1_SIMPLE(IPAddressOrRange, u.addressRange, IPAddressRange)
86 } ASN1_CHOICE_END(IPAddressOrRange)
88 ASN1_CHOICE(IPAddressChoice) = {
89 ASN1_SIMPLE(IPAddressChoice, u.inherit, ASN1_NULL),
90 ASN1_SEQUENCE_OF(IPAddressChoice, u.addressesOrRanges, IPAddressOrRange)
91 } ASN1_CHOICE_END(IPAddressChoice)
93 ASN1_SEQUENCE(IPAddressFamily) = {
94 ASN1_SIMPLE(IPAddressFamily, addressFamily, ASN1_OCTET_STRING),
95 ASN1_SIMPLE(IPAddressFamily, ipAddressChoice, IPAddressChoice)
96 } ASN1_SEQUENCE_END(IPAddressFamily)
98 ASN1_ITEM_TEMPLATE(IPAddrBlocks) =
99 ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF, 0,
100 IPAddrBlocks, IPAddressFamily)
101 ASN1_ITEM_TEMPLATE_END(IPAddrBlocks)
103 IMPLEMENT_ASN1_FUNCTIONS(IPAddressRange)
104 IMPLEMENT_ASN1_FUNCTIONS(IPAddressOrRange)
105 IMPLEMENT_ASN1_FUNCTIONS(IPAddressChoice)
106 IMPLEMENT_ASN1_FUNCTIONS(IPAddressFamily)
109 * How much buffer space do we need for a raw address?
111 #define ADDR_RAW_BUF_LEN 16
114 * What's the address length associated with this AFI?
116 static int length_from_afi(const unsigned afi)
129 * Extract the AFI from an IPAddressFamily.
131 unsigned int v3_addr_get_afi(const IPAddressFamily *f)
133 return ((f != NULL &&
134 f->addressFamily != NULL &&
135 f->addressFamily->data != NULL)
136 ? ((f->addressFamily->data[0] << 8) |
137 (f->addressFamily->data[1]))
142 * Expand the bitstring form of an address into a raw byte array.
143 * At the moment this is coded for simplicity, not speed.
145 static void addr_expand(unsigned char *addr,
146 const ASN1_BIT_STRING *bs,
148 const unsigned char fill)
150 OPENSSL_assert(bs->length >= 0 && bs->length <= length);
151 if (bs->length > 0) {
152 memcpy(addr, bs->data, bs->length);
153 if ((bs->flags & 7) != 0) {
154 unsigned char mask = 0xFF >> (8 - (bs->flags & 7));
156 addr[bs->length - 1] &= ~mask;
158 addr[bs->length - 1] |= mask;
161 memset(addr + bs->length, fill, length - bs->length);
165 * Extract the prefix length from a bitstring.
167 #define addr_prefixlen(bs) ((int) ((bs)->length * 8 - ((bs)->flags & 7)))
170 * i2r handler for one address bitstring.
172 static int i2r_address(BIO *out,
174 const unsigned char fill,
175 const ASN1_BIT_STRING *bs)
177 unsigned char addr[ADDR_RAW_BUF_LEN];
186 addr_expand(addr, bs, 4, fill);
187 BIO_printf(out, "%d.%d.%d.%d", addr[0], addr[1], addr[2], addr[3]);
192 addr_expand(addr, bs, 16, fill);
193 for (n = 16; n > 1 && addr[n-1] == 0x00 && addr[n-2] == 0x00; n -= 2)
195 for (i = 0; i < n; i += 2)
196 BIO_printf(out, "%x%s", (addr[i] << 8) | addr[i+1], (i < 14 ? ":" : ""));
203 for (i = 0; i < bs->length; i++)
204 BIO_printf(out, "%s%02x", (i > 0 ? ":" : ""), bs->data[i]);
205 BIO_printf(out, "[%d]", (int) (bs->flags & 7));
212 * i2r handler for a sequence of addresses and ranges.
214 static int i2r_IPAddressOrRanges(BIO *out,
216 const IPAddressOrRanges *aors,
220 for (i = 0; i < sk_IPAddressOrRange_num(aors); i++) {
221 const IPAddressOrRange *aor = sk_IPAddressOrRange_value(aors, i);
222 BIO_printf(out, "%*s", indent, "");
224 case IPAddressOrRange_addressPrefix:
225 if (!i2r_address(out, afi, 0x00, aor->u.addressPrefix))
227 BIO_printf(out, "/%d\n", addr_prefixlen(aor->u.addressPrefix));
229 case IPAddressOrRange_addressRange:
230 if (!i2r_address(out, afi, 0x00, aor->u.addressRange->min))
233 if (!i2r_address(out, afi, 0xFF, aor->u.addressRange->max))
243 * i2r handler for an IPAddrBlocks extension.
245 static int i2r_IPAddrBlocks(const X509V3_EXT_METHOD *method,
250 const IPAddrBlocks *addr = ext;
252 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
253 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
254 const unsigned int afi = v3_addr_get_afi(f);
257 BIO_printf(out, "%*sIPv4", indent, "");
260 BIO_printf(out, "%*sIPv6", indent, "");
263 BIO_printf(out, "%*sUnknown AFI %u", indent, "", afi);
266 if (f->addressFamily->length > 2) {
267 switch (f->addressFamily->data[2]) {
269 BIO_puts(out, " (Unicast)");
272 BIO_puts(out, " (Multicast)");
275 BIO_puts(out, " (Unicast/Multicast)");
278 BIO_puts(out, " (MPLS)");
281 BIO_puts(out, " (Tunnel)");
284 BIO_puts(out, " (VPLS)");
287 BIO_puts(out, " (BGP MDT)");
290 BIO_puts(out, " (MPLS-labeled VPN)");
293 BIO_printf(out, " (Unknown SAFI %u)",
294 (unsigned) f->addressFamily->data[2]);
298 switch (f->ipAddressChoice->type) {
299 case IPAddressChoice_inherit:
300 BIO_puts(out, ": inherit\n");
302 case IPAddressChoice_addressesOrRanges:
303 BIO_puts(out, ":\n");
304 if (!i2r_IPAddressOrRanges(out,
306 f->ipAddressChoice->u.addressesOrRanges,
316 * Sort comparison function for a sequence of IPAddressOrRange
319 static int IPAddressOrRange_cmp(const IPAddressOrRange *a,
320 const IPAddressOrRange *b,
323 unsigned char addr_a[ADDR_RAW_BUF_LEN], addr_b[ADDR_RAW_BUF_LEN];
324 int prefixlen_a = 0, prefixlen_b = 0;
328 case IPAddressOrRange_addressPrefix:
329 addr_expand(addr_a, a->u.addressPrefix, length, 0x00);
330 prefixlen_a = addr_prefixlen(a->u.addressPrefix);
332 case IPAddressOrRange_addressRange:
333 addr_expand(addr_a, a->u.addressRange->min, length, 0x00);
334 prefixlen_a = length * 8;
339 case IPAddressOrRange_addressPrefix:
340 addr_expand(addr_b, b->u.addressPrefix, length, 0x00);
341 prefixlen_b = addr_prefixlen(b->u.addressPrefix);
343 case IPAddressOrRange_addressRange:
344 addr_expand(addr_b, b->u.addressRange->min, length, 0x00);
345 prefixlen_b = length * 8;
349 if ((r = memcmp(addr_a, addr_b, length)) != 0)
352 return prefixlen_a - prefixlen_b;
356 * IPv4-specific closure over IPAddressOrRange_cmp, since sk_sort()
357 * comparision routines are only allowed two arguments.
359 static int v4IPAddressOrRange_cmp(const IPAddressOrRange * const *a,
360 const IPAddressOrRange * const *b)
362 return IPAddressOrRange_cmp(*a, *b, 4);
366 * IPv6-specific closure over IPAddressOrRange_cmp, since sk_sort()
367 * comparision routines are only allowed two arguments.
369 static int v6IPAddressOrRange_cmp(const IPAddressOrRange * const *a,
370 const IPAddressOrRange * const *b)
372 return IPAddressOrRange_cmp(*a, *b, 16);
376 * Calculate whether a range collapses to a prefix.
377 * See last paragraph of RFC 3779 2.2.3.7.
379 static int range_should_be_prefix(const unsigned char *min,
380 const unsigned char *max,
386 OPENSSL_assert(memcmp(min, max, length) <= 0);
387 for (i = 0; i < length && min[i] == max[i]; i++)
389 for (j = length - 1; j >= 0 && min[j] == 0x00 && max[j] == 0xFF; j--)
395 mask = min[i] ^ max[i];
397 case 0x01: j = 7; break;
398 case 0x03: j = 6; break;
399 case 0x07: j = 5; break;
400 case 0x0F: j = 4; break;
401 case 0x1F: j = 3; break;
402 case 0x3F: j = 2; break;
403 case 0x7F: j = 1; break;
406 if ((min[i] & mask) != 0 || (max[i] & mask) != mask)
413 * Construct a prefix.
415 static int make_addressPrefix(IPAddressOrRange **result,
419 int bytelen = (prefixlen + 7) / 8, bitlen = prefixlen % 8;
420 IPAddressOrRange *aor = IPAddressOrRange_new();
424 aor->type = IPAddressOrRange_addressPrefix;
425 if (aor->u.addressPrefix == NULL &&
426 (aor->u.addressPrefix = ASN1_BIT_STRING_new()) == NULL)
428 if (!ASN1_BIT_STRING_set(aor->u.addressPrefix, addr, bytelen))
430 aor->u.addressPrefix->flags &= ~7;
431 aor->u.addressPrefix->flags |= ASN1_STRING_FLAG_BITS_LEFT;
433 aor->u.addressPrefix->data[bytelen - 1] &= ~(0xFF >> bitlen);
434 aor->u.addressPrefix->flags |= 8 - bitlen;
441 IPAddressOrRange_free(aor);
446 * Construct a range. If it can be expressed as a prefix,
447 * return a prefix instead. Doing this here simplifies
448 * the rest of the code considerably.
450 static int make_addressRange(IPAddressOrRange **result,
455 IPAddressOrRange *aor;
458 if ((prefixlen = range_should_be_prefix(min, max, length)) >= 0)
459 return make_addressPrefix(result, min, prefixlen);
461 if ((aor = IPAddressOrRange_new()) == NULL)
463 aor->type = IPAddressOrRange_addressRange;
464 OPENSSL_assert(aor->u.addressRange == NULL);
465 if ((aor->u.addressRange = IPAddressRange_new()) == NULL)
467 if (aor->u.addressRange->min == NULL &&
468 (aor->u.addressRange->min = ASN1_BIT_STRING_new()) == NULL)
470 if (aor->u.addressRange->max == NULL &&
471 (aor->u.addressRange->max = ASN1_BIT_STRING_new()) == NULL)
474 for (i = length; i > 0 && min[i - 1] == 0x00; --i)
476 if (!ASN1_BIT_STRING_set(aor->u.addressRange->min, min, i))
478 aor->u.addressRange->min->flags &= ~7;
479 aor->u.addressRange->min->flags |= ASN1_STRING_FLAG_BITS_LEFT;
481 unsigned char b = min[i - 1];
483 while ((b & (0xFFU >> j)) != 0)
485 aor->u.addressRange->min->flags |= 8 - j;
488 for (i = length; i > 0 && max[i - 1] == 0xFF; --i)
490 if (!ASN1_BIT_STRING_set(aor->u.addressRange->max, max, i))
492 aor->u.addressRange->max->flags &= ~7;
493 aor->u.addressRange->max->flags |= ASN1_STRING_FLAG_BITS_LEFT;
495 unsigned char b = max[i - 1];
497 while ((b & (0xFFU >> j)) != (0xFFU >> j))
499 aor->u.addressRange->max->flags |= 8 - j;
506 IPAddressOrRange_free(aor);
511 * Construct a new address family or find an existing one.
513 static IPAddressFamily *make_IPAddressFamily(IPAddrBlocks *addr,
515 const unsigned *safi)
518 unsigned char key[3];
522 key[0] = (afi >> 8) & 0xFF;
525 key[2] = *safi & 0xFF;
531 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
532 f = sk_IPAddressFamily_value(addr, i);
533 OPENSSL_assert(f->addressFamily->data != NULL);
534 if (f->addressFamily->length == keylen &&
535 !memcmp(f->addressFamily->data, key, keylen))
539 if ((f = IPAddressFamily_new()) == NULL)
541 if (f->ipAddressChoice == NULL &&
542 (f->ipAddressChoice = IPAddressChoice_new()) == NULL)
544 if (f->addressFamily == NULL &&
545 (f->addressFamily = ASN1_OCTET_STRING_new()) == NULL)
547 if (!ASN1_OCTET_STRING_set(f->addressFamily, key, keylen))
549 if (!sk_IPAddressFamily_push(addr, f))
555 IPAddressFamily_free(f);
560 * Add an inheritance element.
562 int v3_addr_add_inherit(IPAddrBlocks *addr,
564 const unsigned *safi)
566 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
568 f->ipAddressChoice == NULL ||
569 (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
570 f->ipAddressChoice->u.addressesOrRanges != NULL))
572 if (f->ipAddressChoice->type == IPAddressChoice_inherit &&
573 f->ipAddressChoice->u.inherit != NULL)
575 if (f->ipAddressChoice->u.inherit == NULL &&
576 (f->ipAddressChoice->u.inherit = ASN1_NULL_new()) == NULL)
578 f->ipAddressChoice->type = IPAddressChoice_inherit;
583 * Construct an IPAddressOrRange sequence, or return an existing one.
585 static IPAddressOrRanges *make_prefix_or_range(IPAddrBlocks *addr,
587 const unsigned *safi)
589 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
590 IPAddressOrRanges *aors = NULL;
593 f->ipAddressChoice == NULL ||
594 (f->ipAddressChoice->type == IPAddressChoice_inherit &&
595 f->ipAddressChoice->u.inherit != NULL))
597 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges)
598 aors = f->ipAddressChoice->u.addressesOrRanges;
601 if ((aors = sk_IPAddressOrRange_new_null()) == NULL)
605 sk_IPAddressOrRange_set_cmp_func(aors, v4IPAddressOrRange_cmp);
608 sk_IPAddressOrRange_set_cmp_func(aors, v6IPAddressOrRange_cmp);
611 f->ipAddressChoice->type = IPAddressChoice_addressesOrRanges;
612 f->ipAddressChoice->u.addressesOrRanges = aors;
619 int v3_addr_add_prefix(IPAddrBlocks *addr,
621 const unsigned *safi,
625 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
626 IPAddressOrRange *aor;
627 if (aors == NULL || !make_addressPrefix(&aor, a, prefixlen))
629 if (sk_IPAddressOrRange_push(aors, aor))
631 IPAddressOrRange_free(aor);
638 int v3_addr_add_range(IPAddrBlocks *addr,
640 const unsigned *safi,
644 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
645 IPAddressOrRange *aor;
646 int length = length_from_afi(afi);
649 if (!make_addressRange(&aor, min, max, length))
651 if (sk_IPAddressOrRange_push(aors, aor))
653 IPAddressOrRange_free(aor);
658 * Extract min and max values from an IPAddressOrRange.
660 static void extract_min_max(IPAddressOrRange *aor,
665 OPENSSL_assert(aor != NULL && min != NULL && max != NULL);
667 case IPAddressOrRange_addressPrefix:
668 addr_expand(min, aor->u.addressPrefix, length, 0x00);
669 addr_expand(max, aor->u.addressPrefix, length, 0xFF);
671 case IPAddressOrRange_addressRange:
672 addr_expand(min, aor->u.addressRange->min, length, 0x00);
673 addr_expand(max, aor->u.addressRange->max, length, 0xFF);
679 * Public wrapper for extract_min_max().
681 int v3_addr_get_range(IPAddressOrRange *aor,
687 int afi_length = length_from_afi(afi);
688 if (aor == NULL || min == NULL || max == NULL ||
689 afi_length == 0 || length < afi_length ||
690 (aor->type != IPAddressOrRange_addressPrefix &&
691 aor->type != IPAddressOrRange_addressRange))
693 extract_min_max(aor, min, max, afi_length);
698 * Sort comparision function for a sequence of IPAddressFamily.
700 * The last paragraph of RFC 3779 2.2.3.3 is slightly ambiguous about
701 * the ordering: I can read it as meaning that IPv6 without a SAFI
702 * comes before IPv4 with a SAFI, which seems pretty weird. The
703 * examples in appendix B suggest that the author intended the
704 * null-SAFI rule to apply only within a single AFI, which is what I
705 * would have expected and is what the following code implements.
707 static int IPAddressFamily_cmp(const IPAddressFamily * const *a_,
708 const IPAddressFamily * const *b_)
710 const ASN1_OCTET_STRING *a = (*a_)->addressFamily;
711 const ASN1_OCTET_STRING *b = (*b_)->addressFamily;
712 int len = ((a->length <= b->length) ? a->length : b->length);
713 int cmp = memcmp(a->data, b->data, len);
714 return cmp ? cmp : a->length - b->length;
718 * Check whether an IPAddrBLocks is in canonical form.
720 int v3_addr_is_canonical(IPAddrBlocks *addr)
722 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
723 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
724 IPAddressOrRanges *aors;
728 * Empty extension is cannonical.
734 * Check whether the top-level list is in order.
736 for (i = 0; i < sk_IPAddressFamily_num(addr) - 1; i++) {
737 const IPAddressFamily *a = sk_IPAddressFamily_value(addr, i);
738 const IPAddressFamily *b = sk_IPAddressFamily_value(addr, i + 1);
739 if (IPAddressFamily_cmp(&a, &b) >= 0)
744 * Top level's ok, now check each address family.
746 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
747 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
748 int length = length_from_afi(v3_addr_get_afi(f));
751 * Inheritance is canonical. Anything other than inheritance or
752 * a SEQUENCE OF IPAddressOrRange is an ASN.1 error or something.
754 if (f == NULL || f->ipAddressChoice == NULL)
756 switch (f->ipAddressChoice->type) {
757 case IPAddressChoice_inherit:
759 case IPAddressChoice_addressesOrRanges:
766 * It's an IPAddressOrRanges sequence, check it.
768 aors = f->ipAddressChoice->u.addressesOrRanges;
769 if (sk_IPAddressOrRange_num(aors) == 0)
771 for (j = 0; j < sk_IPAddressOrRange_num(aors) - 1; j++) {
772 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
773 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, j + 1);
775 extract_min_max(a, a_min, a_max, length);
776 extract_min_max(b, b_min, b_max, length);
779 * Punt misordered list, overlapping start, or inverted range.
781 if (memcmp(a_min, b_min, length) >= 0 ||
782 memcmp(a_min, a_max, length) > 0 ||
783 memcmp(b_min, b_max, length) > 0)
787 * Punt if adjacent or overlapping. Check for adjacency by
788 * subtracting one from b_min first.
790 for (k = length - 1; k >= 0 && b_min[k]-- == 0x00; k--)
792 if (memcmp(a_max, b_min, length) >= 0)
796 * Check for range that should be expressed as a prefix.
798 if (a->type == IPAddressOrRange_addressRange &&
799 range_should_be_prefix(a_min, a_max, length) >= 0)
804 * Check range to see if it's inverted or should be a
807 j = sk_IPAddressOrRange_num(aors) - 1;
809 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
810 if (a != NULL && a->type == IPAddressOrRange_addressRange) {
811 extract_min_max(a, a_min, a_max, length);
812 if (memcmp(a_min, a_max, length) > 0 ||
813 range_should_be_prefix(a_min, a_max, length) >= 0)
820 * If we made it through all that, we're happy.
826 * Whack an IPAddressOrRanges into canonical form.
828 static int IPAddressOrRanges_canonize(IPAddressOrRanges *aors,
831 int i, j, length = length_from_afi(afi);
834 * Sort the IPAddressOrRanges sequence.
836 sk_IPAddressOrRange_sort(aors);
839 * Clean up representation issues, punt on duplicates or overlaps.
841 for (i = 0; i < sk_IPAddressOrRange_num(aors) - 1; i++) {
842 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, i);
843 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, i + 1);
844 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
845 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
847 extract_min_max(a, a_min, a_max, length);
848 extract_min_max(b, b_min, b_max, length);
851 * Punt inverted ranges.
853 if (memcmp(a_min, a_max, length) > 0 ||
854 memcmp(b_min, b_max, length) > 0)
860 if (memcmp(a_max, b_min, length) >= 0)
864 * Merge if a and b are adjacent. We check for
865 * adjacency by subtracting one from b_min first.
867 for (j = length - 1; j >= 0 && b_min[j]-- == 0x00; j--)
869 if (memcmp(a_max, b_min, length) == 0) {
870 IPAddressOrRange *merged;
871 if (!make_addressRange(&merged, a_min, b_max, length))
873 sk_IPAddressOrRange_set(aors, i, merged);
874 sk_IPAddressOrRange_delete(aors, i + 1);
875 IPAddressOrRange_free(a);
876 IPAddressOrRange_free(b);
883 * Check for inverted final range.
885 j = sk_IPAddressOrRange_num(aors) - 1;
887 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
888 if (a != NULL && a->type == IPAddressOrRange_addressRange) {
889 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
890 extract_min_max(a, a_min, a_max, length);
891 if (memcmp(a_min, a_max, length) > 0)
900 * Whack an IPAddrBlocks extension into canonical form.
902 int v3_addr_canonize(IPAddrBlocks *addr)
905 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
906 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
907 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
908 !IPAddressOrRanges_canonize(f->ipAddressChoice->u.addressesOrRanges,
912 sk_IPAddressFamily_set_cmp_func(addr, IPAddressFamily_cmp);
913 sk_IPAddressFamily_sort(addr);
914 OPENSSL_assert(v3_addr_is_canonical(addr));
919 * v2i handler for the IPAddrBlocks extension.
921 static void *v2i_IPAddrBlocks(const struct v3_ext_method *method,
922 struct v3_ext_ctx *ctx,
923 STACK_OF(CONF_VALUE) *values)
925 static const char v4addr_chars[] = "0123456789.";
926 static const char v6addr_chars[] = "0123456789.:abcdefABCDEF";
927 IPAddrBlocks *addr = NULL;
931 if ((addr = sk_IPAddressFamily_new(IPAddressFamily_cmp)) == NULL) {
932 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
936 for (i = 0; i < sk_CONF_VALUE_num(values); i++) {
937 CONF_VALUE *val = sk_CONF_VALUE_value(values, i);
938 unsigned char min[ADDR_RAW_BUF_LEN], max[ADDR_RAW_BUF_LEN];
939 unsigned afi, *safi = NULL, safi_;
940 const char *addr_chars;
941 int prefixlen, i1, i2, delim, length;
943 if ( !name_cmp(val->name, "IPv4")) {
945 } else if (!name_cmp(val->name, "IPv6")) {
947 } else if (!name_cmp(val->name, "IPv4-SAFI")) {
950 } else if (!name_cmp(val->name, "IPv6-SAFI")) {
954 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_NAME_ERROR);
955 X509V3_conf_err(val);
961 addr_chars = v4addr_chars;
964 addr_chars = v6addr_chars;
968 length = length_from_afi(afi);
971 * Handle SAFI, if any, and BUF_strdup() so we can null-terminate
972 * the other input values.
975 *safi = strtoul(val->value, &t, 0);
976 t += strspn(t, " \t");
977 if (*safi > 0xFF || *t++ != ':') {
978 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_SAFI);
979 X509V3_conf_err(val);
982 t += strspn(t, " \t");
985 s = BUF_strdup(val->value);
988 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
993 * Check for inheritance. Not worth additional complexity to
994 * optimize this (seldom-used) case.
996 if (!strcmp(s, "inherit")) {
997 if (!v3_addr_add_inherit(addr, afi, safi)) {
998 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_INHERITANCE);
999 X509V3_conf_err(val);
1007 i1 = strspn(s, addr_chars);
1008 i2 = i1 + strspn(s + i1, " \t");
1012 if (a2i_ipadd(min, s) != length) {
1013 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_IPADDRESS);
1014 X509V3_conf_err(val);
1020 prefixlen = (int) strtoul(s + i2, &t, 10);
1021 if (t == s + i2 || *t != '\0') {
1022 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
1023 X509V3_conf_err(val);
1026 if (!v3_addr_add_prefix(addr, afi, safi, min, prefixlen)) {
1027 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1032 i1 = i2 + strspn(s + i2, " \t");
1033 i2 = i1 + strspn(s + i1, addr_chars);
1034 if (i1 == i2 || s[i2] != '\0') {
1035 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
1036 X509V3_conf_err(val);
1039 if (a2i_ipadd(max, s + i1) != length) {
1040 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_IPADDRESS);
1041 X509V3_conf_err(val);
1044 if (memcmp(min, max, length_from_afi(afi)) > 0) {
1045 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
1046 X509V3_conf_err(val);
1049 if (!v3_addr_add_range(addr, afi, safi, min, max)) {
1050 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1055 if (!v3_addr_add_prefix(addr, afi, safi, min, length * 8)) {
1056 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1061 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
1062 X509V3_conf_err(val);
1071 * Canonize the result, then we're done.
1073 if (!v3_addr_canonize(addr))
1079 sk_IPAddressFamily_pop_free(addr, IPAddressFamily_free);
1086 const X509V3_EXT_METHOD v3_addr = {
1087 NID_sbgp_ipAddrBlock, /* nid */
1089 ASN1_ITEM_ref(IPAddrBlocks), /* template */
1090 0, 0, 0, 0, /* old functions, ignored */
1094 v2i_IPAddrBlocks, /* v2i */
1095 i2r_IPAddrBlocks, /* i2r */
1097 NULL /* extension-specific data */
1101 * Figure out whether extension sues inheritance.
1103 int v3_addr_inherits(IPAddrBlocks *addr)
1108 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
1109 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
1110 if (f->ipAddressChoice->type == IPAddressChoice_inherit)
1117 * Figure out whether parent contains child.
1119 static int addr_contains(IPAddressOrRanges *parent,
1120 IPAddressOrRanges *child,
1123 unsigned char p_min[ADDR_RAW_BUF_LEN], p_max[ADDR_RAW_BUF_LEN];
1124 unsigned char c_min[ADDR_RAW_BUF_LEN], c_max[ADDR_RAW_BUF_LEN];
1127 if (child == NULL || parent == child)
1133 for (c = 0; c < sk_IPAddressOrRange_num(child); c++) {
1134 extract_min_max(sk_IPAddressOrRange_value(child, c),
1135 c_min, c_max, length);
1137 if (p >= sk_IPAddressOrRange_num(parent))
1139 extract_min_max(sk_IPAddressOrRange_value(parent, p),
1140 p_min, p_max, length);
1141 if (memcmp(p_max, c_max, length) < 0)
1143 if (memcmp(p_min, c_min, length) > 0)
1153 * Test whether a is a subset of b.
1155 int v3_addr_subset(IPAddrBlocks *a, IPAddrBlocks *b)
1158 if (a == NULL || a == b)
1160 if (b == NULL || v3_addr_inherits(a) || v3_addr_inherits(b))
1162 sk_IPAddressFamily_set_cmp_func(b, IPAddressFamily_cmp);
1163 for (i = 0; i < sk_IPAddressFamily_num(a); i++) {
1164 IPAddressFamily *fa = sk_IPAddressFamily_value(a, i);
1165 int j = sk_IPAddressFamily_find(b, fa);
1166 IPAddressFamily *fb;
1167 fb = sk_IPAddressFamily_value(b, j);
1170 if (!addr_contains(fb->ipAddressChoice->u.addressesOrRanges,
1171 fa->ipAddressChoice->u.addressesOrRanges,
1172 length_from_afi(v3_addr_get_afi(fb))))
1179 * Validation error handling via callback.
1181 #define validation_err(_err_) \
1183 if (ctx != NULL) { \
1184 ctx->error = _err_; \
1185 ctx->error_depth = i; \
1186 ctx->current_cert = x; \
1187 ret = ctx->verify_cb(0, ctx); \
1196 * Core code for RFC 3779 2.3 path validation.
1198 static int v3_addr_validate_path_internal(X509_STORE_CTX *ctx,
1199 STACK_OF(X509) *chain,
1202 IPAddrBlocks *child = NULL;
1206 OPENSSL_assert(chain != NULL && sk_X509_num(chain) > 0);
1207 OPENSSL_assert(ctx != NULL || ext != NULL);
1208 OPENSSL_assert(ctx == NULL || ctx->verify_cb != NULL);
1211 * Figure out where to start. If we don't have an extension to
1212 * check, we're done. Otherwise, check canonical form and
1213 * set up for walking up the chain.
1220 x = sk_X509_value(chain, i);
1221 OPENSSL_assert(x != NULL);
1222 if ((ext = x->rfc3779_addr) == NULL)
1225 if (!v3_addr_is_canonical(ext))
1226 validation_err(X509_V_ERR_INVALID_EXTENSION);
1227 sk_IPAddressFamily_set_cmp_func(ext, IPAddressFamily_cmp);
1228 if ((child = sk_IPAddressFamily_dup(ext)) == NULL) {
1229 X509V3err(X509V3_F_V3_ADDR_VALIDATE_PATH_INTERNAL, ERR_R_MALLOC_FAILURE);
1235 * Now walk up the chain. No cert may list resources that its
1236 * parent doesn't list.
1238 for (i++; i < sk_X509_num(chain); i++) {
1239 x = sk_X509_value(chain, i);
1240 OPENSSL_assert(x != NULL);
1241 if (!v3_addr_is_canonical(x->rfc3779_addr))
1242 validation_err(X509_V_ERR_INVALID_EXTENSION);
1243 if (x->rfc3779_addr == NULL) {
1244 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1245 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1246 if (fc->ipAddressChoice->type != IPAddressChoice_inherit) {
1247 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1253 sk_IPAddressFamily_set_cmp_func(x->rfc3779_addr, IPAddressFamily_cmp);
1254 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1255 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1256 int k = sk_IPAddressFamily_find(x->rfc3779_addr, fc);
1257 IPAddressFamily *fp = sk_IPAddressFamily_value(x->rfc3779_addr, k);
1259 if (fc->ipAddressChoice->type == IPAddressChoice_addressesOrRanges) {
1260 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1265 if (fp->ipAddressChoice->type == IPAddressChoice_addressesOrRanges) {
1266 if (fc->ipAddressChoice->type == IPAddressChoice_inherit ||
1267 addr_contains(fp->ipAddressChoice->u.addressesOrRanges,
1268 fc->ipAddressChoice->u.addressesOrRanges,
1269 length_from_afi(v3_addr_get_afi(fc))))
1270 sk_IPAddressFamily_set(child, j, fp);
1272 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1278 * Trust anchor can't inherit.
1280 OPENSSL_assert(x != NULL);
1281 if (x->rfc3779_addr != NULL) {
1282 for (j = 0; j < sk_IPAddressFamily_num(x->rfc3779_addr); j++) {
1283 IPAddressFamily *fp = sk_IPAddressFamily_value(x->rfc3779_addr, j);
1284 if (fp->ipAddressChoice->type == IPAddressChoice_inherit &&
1285 sk_IPAddressFamily_find(child, fp) >= 0)
1286 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1291 sk_IPAddressFamily_free(child);
1295 #undef validation_err
1298 * RFC 3779 2.3 path validation -- called from X509_verify_cert().
1300 int v3_addr_validate_path(X509_STORE_CTX *ctx)
1302 return v3_addr_validate_path_internal(ctx, ctx->chain, NULL);
1306 * RFC 3779 2.3 path validation of an extension.
1307 * Test whether chain covers extension.
1309 int v3_addr_validate_resource_set(STACK_OF(X509) *chain,
1311 int allow_inheritance)
1315 if (chain == NULL || sk_X509_num(chain) == 0)
1317 if (!allow_inheritance && v3_addr_inherits(ext))
1319 return v3_addr_validate_path_internal(NULL, chain, ext);
1322 #endif /* OPENSSL_NO_RFC3779 */