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.
65 #include "internal/cryptlib.h"
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>
73 #ifndef OPENSSL_NO_RFC3779
76 * OpenSSL ASN.1 template translation of RFC 3779 2.2.3.
79 ASN1_SEQUENCE(IPAddressRange) = {
80 ASN1_SIMPLE(IPAddressRange, min, ASN1_BIT_STRING),
81 ASN1_SIMPLE(IPAddressRange, max, ASN1_BIT_STRING)
82 } ASN1_SEQUENCE_END(IPAddressRange)
84 ASN1_CHOICE(IPAddressOrRange) = {
85 ASN1_SIMPLE(IPAddressOrRange, u.addressPrefix, ASN1_BIT_STRING),
86 ASN1_SIMPLE(IPAddressOrRange, u.addressRange, IPAddressRange)
87 } ASN1_CHOICE_END(IPAddressOrRange)
89 ASN1_CHOICE(IPAddressChoice) = {
90 ASN1_SIMPLE(IPAddressChoice, u.inherit, ASN1_NULL),
91 ASN1_SEQUENCE_OF(IPAddressChoice, u.addressesOrRanges, IPAddressOrRange)
92 } ASN1_CHOICE_END(IPAddressChoice)
94 ASN1_SEQUENCE(IPAddressFamily) = {
95 ASN1_SIMPLE(IPAddressFamily, addressFamily, ASN1_OCTET_STRING),
96 ASN1_SIMPLE(IPAddressFamily, ipAddressChoice, IPAddressChoice)
97 } ASN1_SEQUENCE_END(IPAddressFamily)
99 ASN1_ITEM_TEMPLATE(IPAddrBlocks) =
100 ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF, 0,
101 IPAddrBlocks, IPAddressFamily)
102 static_ASN1_ITEM_TEMPLATE_END(IPAddrBlocks)
104 IMPLEMENT_ASN1_FUNCTIONS(IPAddressRange)
105 IMPLEMENT_ASN1_FUNCTIONS(IPAddressOrRange)
106 IMPLEMENT_ASN1_FUNCTIONS(IPAddressChoice)
107 IMPLEMENT_ASN1_FUNCTIONS(IPAddressFamily)
110 * How much buffer space do we need for a raw address?
112 #define ADDR_RAW_BUF_LEN 16
115 * What's the address length associated with this AFI?
117 static int length_from_afi(const unsigned afi)
130 * Extract the AFI from an IPAddressFamily.
132 unsigned int v3_addr_get_afi(const IPAddressFamily *f)
134 return ((f != NULL &&
135 f->addressFamily != NULL && f->addressFamily->data != NULL)
136 ? ((f->addressFamily->data[0] << 8) | (f->addressFamily->data[1]))
141 * Expand the bitstring form of an address into a raw byte array.
142 * At the moment this is coded for simplicity, not speed.
144 static int addr_expand(unsigned char *addr,
145 const ASN1_BIT_STRING *bs,
146 const int length, const unsigned char fill)
148 if (bs->length < 0 || bs->length > length)
150 if (bs->length > 0) {
151 memcpy(addr, bs->data, bs->length);
152 if ((bs->flags & 7) != 0) {
153 unsigned char mask = 0xFF >> (8 - (bs->flags & 7));
155 addr[bs->length - 1] &= ~mask;
157 addr[bs->length - 1] |= mask;
160 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, const ASN1_BIT_STRING *bs)
176 unsigned char addr[ADDR_RAW_BUF_LEN];
183 if (!addr_expand(addr, bs, 4, fill))
185 BIO_printf(out, "%d.%d.%d.%d", addr[0], addr[1], addr[2], addr[3]);
188 if (!addr_expand(addr, bs, 16, fill))
190 for (n = 16; n > 1 && addr[n - 1] == 0x00 && addr[n - 2] == 0x00;
192 for (i = 0; i < n; i += 2)
193 BIO_printf(out, "%x%s", (addr[i] << 8) | addr[i + 1],
194 (i < 14 ? ":" : ""));
201 for (i = 0; i < bs->length; i++)
202 BIO_printf(out, "%s%02x", (i > 0 ? ":" : ""), bs->data[i]);
203 BIO_printf(out, "[%d]", (int)(bs->flags & 7));
210 * i2r handler for a sequence of addresses and ranges.
212 static int i2r_IPAddressOrRanges(BIO *out,
214 const IPAddressOrRanges *aors,
218 for (i = 0; i < sk_IPAddressOrRange_num(aors); i++) {
219 const IPAddressOrRange *aor = sk_IPAddressOrRange_value(aors, i);
220 BIO_printf(out, "%*s", indent, "");
222 case IPAddressOrRange_addressPrefix:
223 if (!i2r_address(out, afi, 0x00, aor->u.addressPrefix))
225 BIO_printf(out, "/%d\n", addr_prefixlen(aor->u.addressPrefix));
227 case IPAddressOrRange_addressRange:
228 if (!i2r_address(out, afi, 0x00, aor->u.addressRange->min))
231 if (!i2r_address(out, afi, 0xFF, aor->u.addressRange->max))
241 * i2r handler for an IPAddrBlocks extension.
243 static int i2r_IPAddrBlocks(const X509V3_EXT_METHOD *method,
244 void *ext, BIO *out, int indent)
246 const IPAddrBlocks *addr = ext;
248 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
249 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
250 const unsigned int afi = v3_addr_get_afi(f);
253 BIO_printf(out, "%*sIPv4", indent, "");
256 BIO_printf(out, "%*sIPv6", indent, "");
259 BIO_printf(out, "%*sUnknown AFI %u", indent, "", afi);
262 if (f->addressFamily->length > 2) {
263 switch (f->addressFamily->data[2]) {
265 BIO_puts(out, " (Unicast)");
268 BIO_puts(out, " (Multicast)");
271 BIO_puts(out, " (Unicast/Multicast)");
274 BIO_puts(out, " (MPLS)");
277 BIO_puts(out, " (Tunnel)");
280 BIO_puts(out, " (VPLS)");
283 BIO_puts(out, " (BGP MDT)");
286 BIO_puts(out, " (MPLS-labeled VPN)");
289 BIO_printf(out, " (Unknown SAFI %u)",
290 (unsigned)f->addressFamily->data[2]);
294 switch (f->ipAddressChoice->type) {
295 case IPAddressChoice_inherit:
296 BIO_puts(out, ": inherit\n");
298 case IPAddressChoice_addressesOrRanges:
299 BIO_puts(out, ":\n");
300 if (!i2r_IPAddressOrRanges(out,
303 u.addressesOrRanges, afi))
312 * Sort comparison function for a sequence of IPAddressOrRange
315 * There's no sane answer we can give if addr_expand() fails, and an
316 * assertion failure on externally supplied data is seriously uncool,
317 * so we just arbitrarily declare that if given invalid inputs this
318 * function returns -1. If this messes up your preferred sort order
319 * for garbage input, tough noogies.
321 static int IPAddressOrRange_cmp(const IPAddressOrRange *a,
322 const IPAddressOrRange *b, const int length)
324 unsigned char addr_a[ADDR_RAW_BUF_LEN], addr_b[ADDR_RAW_BUF_LEN];
325 int prefixlen_a = 0, prefixlen_b = 0;
329 case IPAddressOrRange_addressPrefix:
330 if (!addr_expand(addr_a, a->u.addressPrefix, length, 0x00))
332 prefixlen_a = addr_prefixlen(a->u.addressPrefix);
334 case IPAddressOrRange_addressRange:
335 if (!addr_expand(addr_a, a->u.addressRange->min, length, 0x00))
337 prefixlen_a = length * 8;
342 case IPAddressOrRange_addressPrefix:
343 if (!addr_expand(addr_b, b->u.addressPrefix, length, 0x00))
345 prefixlen_b = addr_prefixlen(b->u.addressPrefix);
347 case IPAddressOrRange_addressRange:
348 if (!addr_expand(addr_b, b->u.addressRange->min, length, 0x00))
350 prefixlen_b = length * 8;
354 if ((r = memcmp(addr_a, addr_b, length)) != 0)
357 return prefixlen_a - prefixlen_b;
361 * IPv4-specific closure over IPAddressOrRange_cmp, since sk_sort()
362 * comparision routines are only allowed two arguments.
364 static int v4IPAddressOrRange_cmp(const IPAddressOrRange *const *a,
365 const IPAddressOrRange *const *b)
367 return IPAddressOrRange_cmp(*a, *b, 4);
371 * IPv6-specific closure over IPAddressOrRange_cmp, since sk_sort()
372 * comparision routines are only allowed two arguments.
374 static int v6IPAddressOrRange_cmp(const IPAddressOrRange *const *a,
375 const IPAddressOrRange *const *b)
377 return IPAddressOrRange_cmp(*a, *b, 16);
381 * Calculate whether a range collapses to a prefix.
382 * See last paragraph of RFC 3779 2.2.3.7.
384 static int range_should_be_prefix(const unsigned char *min,
385 const unsigned char *max, const int length)
390 OPENSSL_assert(memcmp(min, max, length) <= 0);
391 for (i = 0; i < length && min[i] == max[i]; i++) ;
392 for (j = length - 1; j >= 0 && min[j] == 0x00 && max[j] == 0xFF; j--) ;
397 mask = min[i] ^ max[i];
423 if ((min[i] & mask) != 0 || (max[i] & mask) != mask)
430 * Construct a prefix.
432 static int make_addressPrefix(IPAddressOrRange **result,
433 unsigned char *addr, const int prefixlen)
435 int bytelen = (prefixlen + 7) / 8, bitlen = prefixlen % 8;
436 IPAddressOrRange *aor = IPAddressOrRange_new();
440 aor->type = IPAddressOrRange_addressPrefix;
441 if (aor->u.addressPrefix == NULL &&
442 (aor->u.addressPrefix = ASN1_BIT_STRING_new()) == NULL)
444 if (!ASN1_BIT_STRING_set(aor->u.addressPrefix, addr, bytelen))
446 aor->u.addressPrefix->flags &= ~7;
447 aor->u.addressPrefix->flags |= ASN1_STRING_FLAG_BITS_LEFT;
449 aor->u.addressPrefix->data[bytelen - 1] &= ~(0xFF >> bitlen);
450 aor->u.addressPrefix->flags |= 8 - bitlen;
457 IPAddressOrRange_free(aor);
462 * Construct a range. If it can be expressed as a prefix,
463 * return a prefix instead. Doing this here simplifies
464 * the rest of the code considerably.
466 static int make_addressRange(IPAddressOrRange **result,
468 unsigned char *max, const int length)
470 IPAddressOrRange *aor;
473 if ((prefixlen = range_should_be_prefix(min, max, length)) >= 0)
474 return make_addressPrefix(result, min, prefixlen);
476 if ((aor = IPAddressOrRange_new()) == NULL)
478 aor->type = IPAddressOrRange_addressRange;
479 OPENSSL_assert(aor->u.addressRange == NULL);
480 if ((aor->u.addressRange = IPAddressRange_new()) == NULL)
482 if (aor->u.addressRange->min == NULL &&
483 (aor->u.addressRange->min = ASN1_BIT_STRING_new()) == NULL)
485 if (aor->u.addressRange->max == NULL &&
486 (aor->u.addressRange->max = ASN1_BIT_STRING_new()) == NULL)
489 for (i = length; i > 0 && min[i - 1] == 0x00; --i) ;
490 if (!ASN1_BIT_STRING_set(aor->u.addressRange->min, min, i))
492 aor->u.addressRange->min->flags &= ~7;
493 aor->u.addressRange->min->flags |= ASN1_STRING_FLAG_BITS_LEFT;
495 unsigned char b = min[i - 1];
497 while ((b & (0xFFU >> j)) != 0)
499 aor->u.addressRange->min->flags |= 8 - j;
502 for (i = length; i > 0 && max[i - 1] == 0xFF; --i) ;
503 if (!ASN1_BIT_STRING_set(aor->u.addressRange->max, max, i))
505 aor->u.addressRange->max->flags &= ~7;
506 aor->u.addressRange->max->flags |= ASN1_STRING_FLAG_BITS_LEFT;
508 unsigned char b = max[i - 1];
510 while ((b & (0xFFU >> j)) != (0xFFU >> j))
512 aor->u.addressRange->max->flags |= 8 - j;
519 IPAddressOrRange_free(aor);
524 * Construct a new address family or find an existing one.
526 static IPAddressFamily *make_IPAddressFamily(IPAddrBlocks *addr,
528 const unsigned *safi)
531 unsigned char key[3];
535 key[0] = (afi >> 8) & 0xFF;
538 key[2] = *safi & 0xFF;
544 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
545 f = sk_IPAddressFamily_value(addr, i);
546 OPENSSL_assert(f->addressFamily->data != NULL);
547 if (f->addressFamily->length == keylen &&
548 !memcmp(f->addressFamily->data, key, keylen))
552 if ((f = IPAddressFamily_new()) == NULL)
554 if (f->ipAddressChoice == NULL &&
555 (f->ipAddressChoice = IPAddressChoice_new()) == NULL)
557 if (f->addressFamily == NULL &&
558 (f->addressFamily = ASN1_OCTET_STRING_new()) == NULL)
560 if (!ASN1_OCTET_STRING_set(f->addressFamily, key, keylen))
562 if (!sk_IPAddressFamily_push(addr, f))
568 IPAddressFamily_free(f);
573 * Add an inheritance element.
575 int v3_addr_add_inherit(IPAddrBlocks *addr,
576 const unsigned afi, const unsigned *safi)
578 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
580 f->ipAddressChoice == NULL ||
581 (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
582 f->ipAddressChoice->u.addressesOrRanges != NULL))
584 if (f->ipAddressChoice->type == IPAddressChoice_inherit &&
585 f->ipAddressChoice->u.inherit != NULL)
587 if (f->ipAddressChoice->u.inherit == NULL &&
588 (f->ipAddressChoice->u.inherit = ASN1_NULL_new()) == NULL)
590 f->ipAddressChoice->type = IPAddressChoice_inherit;
595 * Construct an IPAddressOrRange sequence, or return an existing one.
597 static IPAddressOrRanges *make_prefix_or_range(IPAddrBlocks *addr,
599 const unsigned *safi)
601 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
602 IPAddressOrRanges *aors = NULL;
605 f->ipAddressChoice == NULL ||
606 (f->ipAddressChoice->type == IPAddressChoice_inherit &&
607 f->ipAddressChoice->u.inherit != NULL))
609 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges)
610 aors = f->ipAddressChoice->u.addressesOrRanges;
613 if ((aors = sk_IPAddressOrRange_new_null()) == NULL)
617 (void)sk_IPAddressOrRange_set_cmp_func(aors, v4IPAddressOrRange_cmp);
620 (void)sk_IPAddressOrRange_set_cmp_func(aors, v6IPAddressOrRange_cmp);
623 f->ipAddressChoice->type = IPAddressChoice_addressesOrRanges;
624 f->ipAddressChoice->u.addressesOrRanges = aors;
631 int v3_addr_add_prefix(IPAddrBlocks *addr,
633 const unsigned *safi,
634 unsigned char *a, const int prefixlen)
636 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
637 IPAddressOrRange *aor;
638 if (aors == NULL || !make_addressPrefix(&aor, a, prefixlen))
640 if (sk_IPAddressOrRange_push(aors, aor))
642 IPAddressOrRange_free(aor);
649 int v3_addr_add_range(IPAddrBlocks *addr,
651 const unsigned *safi,
652 unsigned char *min, unsigned char *max)
654 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
655 IPAddressOrRange *aor;
656 int length = length_from_afi(afi);
659 if (!make_addressRange(&aor, min, max, length))
661 if (sk_IPAddressOrRange_push(aors, aor))
663 IPAddressOrRange_free(aor);
668 * Extract min and max values from an IPAddressOrRange.
670 static int extract_min_max(IPAddressOrRange *aor,
671 unsigned char *min, unsigned char *max, int length)
673 if (aor == NULL || min == NULL || max == NULL)
676 case IPAddressOrRange_addressPrefix:
677 return (addr_expand(min, aor->u.addressPrefix, length, 0x00) &&
678 addr_expand(max, aor->u.addressPrefix, length, 0xFF));
679 case IPAddressOrRange_addressRange:
680 return (addr_expand(min, aor->u.addressRange->min, length, 0x00) &&
681 addr_expand(max, aor->u.addressRange->max, length, 0xFF));
687 * Public wrapper for extract_min_max().
689 int v3_addr_get_range(IPAddressOrRange *aor,
692 unsigned char *max, const int length)
694 int afi_length = length_from_afi(afi);
695 if (aor == NULL || min == NULL || max == NULL ||
696 afi_length == 0 || length < afi_length ||
697 (aor->type != IPAddressOrRange_addressPrefix &&
698 aor->type != IPAddressOrRange_addressRange) ||
699 !extract_min_max(aor, min, max, afi_length))
706 * Sort comparision function for a sequence of IPAddressFamily.
708 * The last paragraph of RFC 3779 2.2.3.3 is slightly ambiguous about
709 * the ordering: I can read it as meaning that IPv6 without a SAFI
710 * comes before IPv4 with a SAFI, which seems pretty weird. The
711 * examples in appendix B suggest that the author intended the
712 * null-SAFI rule to apply only within a single AFI, which is what I
713 * would have expected and is what the following code implements.
715 static int IPAddressFamily_cmp(const IPAddressFamily *const *a_,
716 const IPAddressFamily *const *b_)
718 const ASN1_OCTET_STRING *a = (*a_)->addressFamily;
719 const ASN1_OCTET_STRING *b = (*b_)->addressFamily;
720 int len = ((a->length <= b->length) ? a->length : b->length);
721 int cmp = memcmp(a->data, b->data, len);
722 return cmp ? cmp : a->length - b->length;
726 * Check whether an IPAddrBLocks is in canonical form.
728 int v3_addr_is_canonical(IPAddrBlocks *addr)
730 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
731 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
732 IPAddressOrRanges *aors;
736 * Empty extension is cannonical.
742 * Check whether the top-level list is in order.
744 for (i = 0; i < sk_IPAddressFamily_num(addr) - 1; i++) {
745 const IPAddressFamily *a = sk_IPAddressFamily_value(addr, i);
746 const IPAddressFamily *b = sk_IPAddressFamily_value(addr, i + 1);
747 if (IPAddressFamily_cmp(&a, &b) >= 0)
752 * Top level's ok, now check each address family.
754 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
755 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
756 int length = length_from_afi(v3_addr_get_afi(f));
759 * Inheritance is canonical. Anything other than inheritance or
760 * a SEQUENCE OF IPAddressOrRange is an ASN.1 error or something.
762 if (f == NULL || f->ipAddressChoice == NULL)
764 switch (f->ipAddressChoice->type) {
765 case IPAddressChoice_inherit:
767 case IPAddressChoice_addressesOrRanges:
774 * It's an IPAddressOrRanges sequence, check it.
776 aors = f->ipAddressChoice->u.addressesOrRanges;
777 if (sk_IPAddressOrRange_num(aors) == 0)
779 for (j = 0; j < sk_IPAddressOrRange_num(aors) - 1; j++) {
780 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
781 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, j + 1);
783 if (!extract_min_max(a, a_min, a_max, length) ||
784 !extract_min_max(b, b_min, b_max, length))
788 * Punt misordered list, overlapping start, or inverted range.
790 if (memcmp(a_min, b_min, length) >= 0 ||
791 memcmp(a_min, a_max, length) > 0 ||
792 memcmp(b_min, b_max, length) > 0)
796 * Punt if adjacent or overlapping. Check for adjacency by
797 * subtracting one from b_min first.
799 for (k = length - 1; k >= 0 && b_min[k]-- == 0x00; k--) ;
800 if (memcmp(a_max, b_min, length) >= 0)
804 * Check for range that should be expressed as a prefix.
806 if (a->type == IPAddressOrRange_addressRange &&
807 range_should_be_prefix(a_min, a_max, length) >= 0)
812 * Check range to see if it's inverted or should be a
815 j = sk_IPAddressOrRange_num(aors) - 1;
817 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
818 if (a != NULL && a->type == IPAddressOrRange_addressRange) {
819 if (!extract_min_max(a, a_min, a_max, length))
821 if (memcmp(a_min, a_max, length) > 0 ||
822 range_should_be_prefix(a_min, a_max, length) >= 0)
829 * If we made it through all that, we're happy.
835 * Whack an IPAddressOrRanges into canonical form.
837 static int IPAddressOrRanges_canonize(IPAddressOrRanges *aors,
840 int i, j, length = length_from_afi(afi);
843 * Sort the IPAddressOrRanges sequence.
845 sk_IPAddressOrRange_sort(aors);
848 * Clean up representation issues, punt on duplicates or overlaps.
850 for (i = 0; i < sk_IPAddressOrRange_num(aors) - 1; i++) {
851 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, i);
852 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, i + 1);
853 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
854 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
856 if (!extract_min_max(a, a_min, a_max, length) ||
857 !extract_min_max(b, b_min, b_max, length))
861 * Punt inverted ranges.
863 if (memcmp(a_min, a_max, length) > 0 ||
864 memcmp(b_min, b_max, length) > 0)
870 if (memcmp(a_max, b_min, length) >= 0)
874 * Merge if a and b are adjacent. We check for
875 * adjacency by subtracting one from b_min first.
877 for (j = length - 1; j >= 0 && b_min[j]-- == 0x00; j--) ;
878 if (memcmp(a_max, b_min, length) == 0) {
879 IPAddressOrRange *merged;
880 if (!make_addressRange(&merged, a_min, b_max, length))
882 (void)sk_IPAddressOrRange_set(aors, i, merged);
883 (void)sk_IPAddressOrRange_delete(aors, i + 1);
884 IPAddressOrRange_free(a);
885 IPAddressOrRange_free(b);
892 * Check for inverted final range.
894 j = sk_IPAddressOrRange_num(aors) - 1;
896 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
897 if (a != NULL && a->type == IPAddressOrRange_addressRange) {
898 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
899 extract_min_max(a, a_min, a_max, length);
900 if (memcmp(a_min, a_max, length) > 0)
909 * Whack an IPAddrBlocks extension into canonical form.
911 int v3_addr_canonize(IPAddrBlocks *addr)
914 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
915 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
916 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
917 !IPAddressOrRanges_canonize(f->ipAddressChoice->
922 (void)sk_IPAddressFamily_set_cmp_func(addr, IPAddressFamily_cmp);
923 sk_IPAddressFamily_sort(addr);
924 OPENSSL_assert(v3_addr_is_canonical(addr));
929 * v2i handler for the IPAddrBlocks extension.
931 static void *v2i_IPAddrBlocks(const struct v3_ext_method *method,
932 struct v3_ext_ctx *ctx,
933 STACK_OF(CONF_VALUE) *values)
935 static const char v4addr_chars[] = "0123456789.";
936 static const char v6addr_chars[] = "0123456789.:abcdefABCDEF";
937 IPAddrBlocks *addr = NULL;
941 if ((addr = sk_IPAddressFamily_new(IPAddressFamily_cmp)) == NULL) {
942 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
946 for (i = 0; i < sk_CONF_VALUE_num(values); i++) {
947 CONF_VALUE *val = sk_CONF_VALUE_value(values, i);
948 unsigned char min[ADDR_RAW_BUF_LEN], max[ADDR_RAW_BUF_LEN];
949 unsigned afi, *safi = NULL, safi_;
950 const char *addr_chars = NULL;
951 int prefixlen, i1, i2, delim, length;
953 if (!name_cmp(val->name, "IPv4")) {
955 } else if (!name_cmp(val->name, "IPv6")) {
957 } else if (!name_cmp(val->name, "IPv4-SAFI")) {
960 } else if (!name_cmp(val->name, "IPv6-SAFI")) {
964 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
965 X509V3_R_EXTENSION_NAME_ERROR);
966 X509V3_conf_err(val);
972 addr_chars = v4addr_chars;
975 addr_chars = v6addr_chars;
979 length = length_from_afi(afi);
982 * Handle SAFI, if any, and BUF_strdup() so we can null-terminate
983 * the other input values.
986 *safi = strtoul(val->value, &t, 0);
987 t += strspn(t, " \t");
988 if (*safi > 0xFF || *t++ != ':') {
989 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_SAFI);
990 X509V3_conf_err(val);
993 t += strspn(t, " \t");
996 s = BUF_strdup(val->value);
999 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1004 * Check for inheritance. Not worth additional complexity to
1005 * optimize this (seldom-used) case.
1007 if (strcmp(s, "inherit") == 0) {
1008 if (!v3_addr_add_inherit(addr, afi, safi)) {
1009 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1010 X509V3_R_INVALID_INHERITANCE);
1011 X509V3_conf_err(val);
1019 i1 = strspn(s, addr_chars);
1020 i2 = i1 + strspn(s + i1, " \t");
1024 if (a2i_ipadd(min, s) != length) {
1025 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_IPADDRESS);
1026 X509V3_conf_err(val);
1032 prefixlen = (int)strtoul(s + i2, &t, 10);
1033 if (t == s + i2 || *t != '\0') {
1034 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1035 X509V3_R_EXTENSION_VALUE_ERROR);
1036 X509V3_conf_err(val);
1039 if (!v3_addr_add_prefix(addr, afi, safi, min, prefixlen)) {
1040 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1045 i1 = i2 + strspn(s + i2, " \t");
1046 i2 = i1 + strspn(s + i1, addr_chars);
1047 if (i1 == i2 || s[i2] != '\0') {
1048 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1049 X509V3_R_EXTENSION_VALUE_ERROR);
1050 X509V3_conf_err(val);
1053 if (a2i_ipadd(max, s + i1) != length) {
1054 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1055 X509V3_R_INVALID_IPADDRESS);
1056 X509V3_conf_err(val);
1059 if (memcmp(min, max, length_from_afi(afi)) > 0) {
1060 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1061 X509V3_R_EXTENSION_VALUE_ERROR);
1062 X509V3_conf_err(val);
1065 if (!v3_addr_add_range(addr, afi, safi, min, max)) {
1066 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1071 if (!v3_addr_add_prefix(addr, afi, safi, min, length * 8)) {
1072 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1077 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1078 X509V3_R_EXTENSION_VALUE_ERROR);
1079 X509V3_conf_err(val);
1088 * Canonize the result, then we're done.
1090 if (!v3_addr_canonize(addr))
1096 sk_IPAddressFamily_pop_free(addr, IPAddressFamily_free);
1103 const X509V3_EXT_METHOD v3_addr = {
1104 NID_sbgp_ipAddrBlock, /* nid */
1106 ASN1_ITEM_ref(IPAddrBlocks), /* template */
1107 0, 0, 0, 0, /* old functions, ignored */
1111 v2i_IPAddrBlocks, /* v2i */
1112 i2r_IPAddrBlocks, /* i2r */
1114 NULL /* extension-specific data */
1118 * Figure out whether extension sues inheritance.
1120 int v3_addr_inherits(IPAddrBlocks *addr)
1125 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
1126 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
1127 if (f->ipAddressChoice->type == IPAddressChoice_inherit)
1134 * Figure out whether parent contains child.
1136 static int addr_contains(IPAddressOrRanges *parent,
1137 IPAddressOrRanges *child, int length)
1139 unsigned char p_min[ADDR_RAW_BUF_LEN], p_max[ADDR_RAW_BUF_LEN];
1140 unsigned char c_min[ADDR_RAW_BUF_LEN], c_max[ADDR_RAW_BUF_LEN];
1143 if (child == NULL || parent == child)
1149 for (c = 0; c < sk_IPAddressOrRange_num(child); c++) {
1150 if (!extract_min_max(sk_IPAddressOrRange_value(child, c),
1151 c_min, c_max, length))
1154 if (p >= sk_IPAddressOrRange_num(parent))
1156 if (!extract_min_max(sk_IPAddressOrRange_value(parent, p),
1157 p_min, p_max, length))
1159 if (memcmp(p_max, c_max, length) < 0)
1161 if (memcmp(p_min, c_min, length) > 0)
1171 * Test whether a is a subset of b.
1173 int v3_addr_subset(IPAddrBlocks *a, IPAddrBlocks *b)
1176 if (a == NULL || a == b)
1178 if (b == NULL || v3_addr_inherits(a) || v3_addr_inherits(b))
1180 (void)sk_IPAddressFamily_set_cmp_func(b, IPAddressFamily_cmp);
1181 for (i = 0; i < sk_IPAddressFamily_num(a); i++) {
1182 IPAddressFamily *fa = sk_IPAddressFamily_value(a, i);
1183 int j = sk_IPAddressFamily_find(b, fa);
1184 IPAddressFamily *fb;
1185 fb = sk_IPAddressFamily_value(b, j);
1188 if (!addr_contains(fb->ipAddressChoice->u.addressesOrRanges,
1189 fa->ipAddressChoice->u.addressesOrRanges,
1190 length_from_afi(v3_addr_get_afi(fb))))
1197 * Validation error handling via callback.
1199 #define validation_err(_err_) \
1201 if (ctx != NULL) { \
1202 ctx->error = _err_; \
1203 ctx->error_depth = i; \
1204 ctx->current_cert = x; \
1205 ret = ctx->verify_cb(0, ctx); \
1214 * Core code for RFC 3779 2.3 path validation.
1216 static int v3_addr_validate_path_internal(X509_STORE_CTX *ctx,
1217 STACK_OF(X509) *chain,
1220 IPAddrBlocks *child = NULL;
1224 OPENSSL_assert(chain != NULL && sk_X509_num(chain) > 0);
1225 OPENSSL_assert(ctx != NULL || ext != NULL);
1226 OPENSSL_assert(ctx == NULL || ctx->verify_cb != NULL);
1229 * Figure out where to start. If we don't have an extension to
1230 * check, we're done. Otherwise, check canonical form and
1231 * set up for walking up the chain.
1238 x = sk_X509_value(chain, i);
1239 OPENSSL_assert(x != NULL);
1240 if ((ext = x->rfc3779_addr) == NULL)
1243 if (!v3_addr_is_canonical(ext))
1244 validation_err(X509_V_ERR_INVALID_EXTENSION);
1245 (void)sk_IPAddressFamily_set_cmp_func(ext, IPAddressFamily_cmp);
1246 if ((child = sk_IPAddressFamily_dup(ext)) == NULL) {
1247 X509V3err(X509V3_F_V3_ADDR_VALIDATE_PATH_INTERNAL,
1248 ERR_R_MALLOC_FAILURE);
1254 * Now walk up the chain. No cert may list resources that its
1255 * parent doesn't list.
1257 for (i++; i < sk_X509_num(chain); i++) {
1258 x = sk_X509_value(chain, i);
1259 OPENSSL_assert(x != NULL);
1260 if (!v3_addr_is_canonical(x->rfc3779_addr))
1261 validation_err(X509_V_ERR_INVALID_EXTENSION);
1262 if (x->rfc3779_addr == NULL) {
1263 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1264 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1265 if (fc->ipAddressChoice->type != IPAddressChoice_inherit) {
1266 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1272 (void)sk_IPAddressFamily_set_cmp_func(x->rfc3779_addr,
1273 IPAddressFamily_cmp);
1274 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1275 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1276 int k = sk_IPAddressFamily_find(x->rfc3779_addr, fc);
1277 IPAddressFamily *fp =
1278 sk_IPAddressFamily_value(x->rfc3779_addr, k);
1280 if (fc->ipAddressChoice->type ==
1281 IPAddressChoice_addressesOrRanges) {
1282 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1287 if (fp->ipAddressChoice->type ==
1288 IPAddressChoice_addressesOrRanges) {
1289 if (fc->ipAddressChoice->type == IPAddressChoice_inherit
1290 || addr_contains(fp->ipAddressChoice->u.addressesOrRanges,
1291 fc->ipAddressChoice->u.addressesOrRanges,
1292 length_from_afi(v3_addr_get_afi(fc))))
1293 sk_IPAddressFamily_set(child, j, fp);
1295 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1301 * Trust anchor can't inherit.
1303 OPENSSL_assert(x != NULL);
1304 if (x->rfc3779_addr != NULL) {
1305 for (j = 0; j < sk_IPAddressFamily_num(x->rfc3779_addr); j++) {
1306 IPAddressFamily *fp =
1307 sk_IPAddressFamily_value(x->rfc3779_addr, j);
1308 if (fp->ipAddressChoice->type == IPAddressChoice_inherit
1309 && sk_IPAddressFamily_find(child, fp) >= 0)
1310 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1315 sk_IPAddressFamily_free(child);
1319 #undef validation_err
1322 * RFC 3779 2.3 path validation -- called from X509_verify_cert().
1324 int v3_addr_validate_path(X509_STORE_CTX *ctx)
1326 return v3_addr_validate_path_internal(ctx, ctx->chain, NULL);
1330 * RFC 3779 2.3 path validation of an extension.
1331 * Test whether chain covers extension.
1333 int v3_addr_validate_resource_set(STACK_OF(X509) *chain,
1334 IPAddrBlocks *ext, int allow_inheritance)
1338 if (chain == NULL || sk_X509_num(chain) == 0)
1340 if (!allow_inheritance && v3_addr_inherits(ext))
1342 return v3_addr_validate_path_internal(NULL, chain, ext);
1345 #endif /* OPENSSL_NO_RFC3779 */