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>
71 #include "internal/x509_int.h"
74 #ifndef OPENSSL_NO_RFC3779
77 * OpenSSL ASN.1 template translation of RFC 3779 2.2.3.
80 ASN1_SEQUENCE(IPAddressRange) = {
81 ASN1_SIMPLE(IPAddressRange, min, ASN1_BIT_STRING),
82 ASN1_SIMPLE(IPAddressRange, max, ASN1_BIT_STRING)
83 } ASN1_SEQUENCE_END(IPAddressRange)
85 ASN1_CHOICE(IPAddressOrRange) = {
86 ASN1_SIMPLE(IPAddressOrRange, u.addressPrefix, ASN1_BIT_STRING),
87 ASN1_SIMPLE(IPAddressOrRange, u.addressRange, IPAddressRange)
88 } ASN1_CHOICE_END(IPAddressOrRange)
90 ASN1_CHOICE(IPAddressChoice) = {
91 ASN1_SIMPLE(IPAddressChoice, u.inherit, ASN1_NULL),
92 ASN1_SEQUENCE_OF(IPAddressChoice, u.addressesOrRanges, IPAddressOrRange)
93 } ASN1_CHOICE_END(IPAddressChoice)
95 ASN1_SEQUENCE(IPAddressFamily) = {
96 ASN1_SIMPLE(IPAddressFamily, addressFamily, ASN1_OCTET_STRING),
97 ASN1_SIMPLE(IPAddressFamily, ipAddressChoice, IPAddressChoice)
98 } ASN1_SEQUENCE_END(IPAddressFamily)
100 ASN1_ITEM_TEMPLATE(IPAddrBlocks) =
101 ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF, 0,
102 IPAddrBlocks, IPAddressFamily)
103 static_ASN1_ITEM_TEMPLATE_END(IPAddrBlocks)
105 IMPLEMENT_ASN1_FUNCTIONS(IPAddressRange)
106 IMPLEMENT_ASN1_FUNCTIONS(IPAddressOrRange)
107 IMPLEMENT_ASN1_FUNCTIONS(IPAddressChoice)
108 IMPLEMENT_ASN1_FUNCTIONS(IPAddressFamily)
111 * How much buffer space do we need for a raw address?
113 #define ADDR_RAW_BUF_LEN 16
116 * What's the address length associated with this AFI?
118 static int length_from_afi(const unsigned afi)
131 * Extract the AFI from an IPAddressFamily.
133 unsigned int X509v3_addr_get_afi(const IPAddressFamily *f)
135 return ((f != NULL &&
136 f->addressFamily != NULL && f->addressFamily->data != NULL)
137 ? ((f->addressFamily->data[0] << 8) | (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 int addr_expand(unsigned char *addr,
146 const ASN1_BIT_STRING *bs,
147 const int length, const unsigned char fill)
149 if (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);
166 * Extract the prefix length from a bitstring.
168 #define addr_prefixlen(bs) ((int) ((bs)->length * 8 - ((bs)->flags & 7)))
171 * i2r handler for one address bitstring.
173 static int i2r_address(BIO *out,
175 const unsigned char fill, const ASN1_BIT_STRING *bs)
177 unsigned char addr[ADDR_RAW_BUF_LEN];
184 if (!addr_expand(addr, bs, 4, fill))
186 BIO_printf(out, "%d.%d.%d.%d", addr[0], addr[1], addr[2], addr[3]);
189 if (!addr_expand(addr, bs, 16, fill))
191 for (n = 16; n > 1 && addr[n - 1] == 0x00 && addr[n - 2] == 0x00;
193 for (i = 0; i < n; i += 2)
194 BIO_printf(out, "%x%s", (addr[i] << 8) | addr[i + 1],
195 (i < 14 ? ":" : ""));
202 for (i = 0; i < bs->length; i++)
203 BIO_printf(out, "%s%02x", (i > 0 ? ":" : ""), bs->data[i]);
204 BIO_printf(out, "[%d]", (int)(bs->flags & 7));
211 * i2r handler for a sequence of addresses and ranges.
213 static int i2r_IPAddressOrRanges(BIO *out,
215 const IPAddressOrRanges *aors,
219 for (i = 0; i < sk_IPAddressOrRange_num(aors); i++) {
220 const IPAddressOrRange *aor = sk_IPAddressOrRange_value(aors, i);
221 BIO_printf(out, "%*s", indent, "");
223 case IPAddressOrRange_addressPrefix:
224 if (!i2r_address(out, afi, 0x00, aor->u.addressPrefix))
226 BIO_printf(out, "/%d\n", addr_prefixlen(aor->u.addressPrefix));
228 case IPAddressOrRange_addressRange:
229 if (!i2r_address(out, afi, 0x00, aor->u.addressRange->min))
232 if (!i2r_address(out, afi, 0xFF, aor->u.addressRange->max))
242 * i2r handler for an IPAddrBlocks extension.
244 static int i2r_IPAddrBlocks(const X509V3_EXT_METHOD *method,
245 void *ext, BIO *out, int indent)
247 const IPAddrBlocks *addr = ext;
249 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
250 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
251 const unsigned int afi = X509v3_addr_get_afi(f);
254 BIO_printf(out, "%*sIPv4", indent, "");
257 BIO_printf(out, "%*sIPv6", indent, "");
260 BIO_printf(out, "%*sUnknown AFI %u", indent, "", afi);
263 if (f->addressFamily->length > 2) {
264 switch (f->addressFamily->data[2]) {
266 BIO_puts(out, " (Unicast)");
269 BIO_puts(out, " (Multicast)");
272 BIO_puts(out, " (Unicast/Multicast)");
275 BIO_puts(out, " (MPLS)");
278 BIO_puts(out, " (Tunnel)");
281 BIO_puts(out, " (VPLS)");
284 BIO_puts(out, " (BGP MDT)");
287 BIO_puts(out, " (MPLS-labeled VPN)");
290 BIO_printf(out, " (Unknown SAFI %u)",
291 (unsigned)f->addressFamily->data[2]);
295 switch (f->ipAddressChoice->type) {
296 case IPAddressChoice_inherit:
297 BIO_puts(out, ": inherit\n");
299 case IPAddressChoice_addressesOrRanges:
300 BIO_puts(out, ":\n");
301 if (!i2r_IPAddressOrRanges(out,
304 u.addressesOrRanges, afi))
313 * Sort comparison function for a sequence of IPAddressOrRange
316 * There's no sane answer we can give if addr_expand() fails, and an
317 * assertion failure on externally supplied data is seriously uncool,
318 * so we just arbitrarily declare that if given invalid inputs this
319 * function returns -1. If this messes up your preferred sort order
320 * for garbage input, tough noogies.
322 static int IPAddressOrRange_cmp(const IPAddressOrRange *a,
323 const IPAddressOrRange *b, const int length)
325 unsigned char addr_a[ADDR_RAW_BUF_LEN], addr_b[ADDR_RAW_BUF_LEN];
326 int prefixlen_a = 0, prefixlen_b = 0;
330 case IPAddressOrRange_addressPrefix:
331 if (!addr_expand(addr_a, a->u.addressPrefix, length, 0x00))
333 prefixlen_a = addr_prefixlen(a->u.addressPrefix);
335 case IPAddressOrRange_addressRange:
336 if (!addr_expand(addr_a, a->u.addressRange->min, length, 0x00))
338 prefixlen_a = length * 8;
343 case IPAddressOrRange_addressPrefix:
344 if (!addr_expand(addr_b, b->u.addressPrefix, length, 0x00))
346 prefixlen_b = addr_prefixlen(b->u.addressPrefix);
348 case IPAddressOrRange_addressRange:
349 if (!addr_expand(addr_b, b->u.addressRange->min, length, 0x00))
351 prefixlen_b = length * 8;
355 if ((r = memcmp(addr_a, addr_b, length)) != 0)
358 return prefixlen_a - prefixlen_b;
362 * IPv4-specific closure over IPAddressOrRange_cmp, since sk_sort()
363 * comparison routines are only allowed two arguments.
365 static int v4IPAddressOrRange_cmp(const IPAddressOrRange *const *a,
366 const IPAddressOrRange *const *b)
368 return IPAddressOrRange_cmp(*a, *b, 4);
372 * IPv6-specific closure over IPAddressOrRange_cmp, since sk_sort()
373 * comparison routines are only allowed two arguments.
375 static int v6IPAddressOrRange_cmp(const IPAddressOrRange *const *a,
376 const IPAddressOrRange *const *b)
378 return IPAddressOrRange_cmp(*a, *b, 16);
382 * Calculate whether a range collapses to a prefix.
383 * See last paragraph of RFC 3779 2.2.3.7.
385 static int range_should_be_prefix(const unsigned char *min,
386 const unsigned char *max, const int length)
391 OPENSSL_assert(memcmp(min, max, length) <= 0);
392 for (i = 0; i < length && min[i] == max[i]; i++) ;
393 for (j = length - 1; j >= 0 && min[j] == 0x00 && max[j] == 0xFF; j--) ;
398 mask = min[i] ^ max[i];
424 if ((min[i] & mask) != 0 || (max[i] & mask) != mask)
431 * Construct a prefix.
433 static int make_addressPrefix(IPAddressOrRange **result,
434 unsigned char *addr, const int prefixlen)
436 int bytelen = (prefixlen + 7) / 8, bitlen = prefixlen % 8;
437 IPAddressOrRange *aor = IPAddressOrRange_new();
441 aor->type = IPAddressOrRange_addressPrefix;
442 if (aor->u.addressPrefix == NULL &&
443 (aor->u.addressPrefix = ASN1_BIT_STRING_new()) == NULL)
445 if (!ASN1_BIT_STRING_set(aor->u.addressPrefix, addr, bytelen))
447 aor->u.addressPrefix->flags &= ~7;
448 aor->u.addressPrefix->flags |= ASN1_STRING_FLAG_BITS_LEFT;
450 aor->u.addressPrefix->data[bytelen - 1] &= ~(0xFF >> bitlen);
451 aor->u.addressPrefix->flags |= 8 - bitlen;
458 IPAddressOrRange_free(aor);
463 * Construct a range. If it can be expressed as a prefix,
464 * return a prefix instead. Doing this here simplifies
465 * the rest of the code considerably.
467 static int make_addressRange(IPAddressOrRange **result,
469 unsigned char *max, const int length)
471 IPAddressOrRange *aor;
474 if ((prefixlen = range_should_be_prefix(min, max, length)) >= 0)
475 return make_addressPrefix(result, min, prefixlen);
477 if ((aor = IPAddressOrRange_new()) == NULL)
479 aor->type = IPAddressOrRange_addressRange;
480 OPENSSL_assert(aor->u.addressRange == NULL);
481 if ((aor->u.addressRange = IPAddressRange_new()) == NULL)
483 if (aor->u.addressRange->min == NULL &&
484 (aor->u.addressRange->min = ASN1_BIT_STRING_new()) == NULL)
486 if (aor->u.addressRange->max == NULL &&
487 (aor->u.addressRange->max = ASN1_BIT_STRING_new()) == NULL)
490 for (i = length; i > 0 && min[i - 1] == 0x00; --i) ;
491 if (!ASN1_BIT_STRING_set(aor->u.addressRange->min, min, i))
493 aor->u.addressRange->min->flags &= ~7;
494 aor->u.addressRange->min->flags |= ASN1_STRING_FLAG_BITS_LEFT;
496 unsigned char b = min[i - 1];
498 while ((b & (0xFFU >> j)) != 0)
500 aor->u.addressRange->min->flags |= 8 - j;
503 for (i = length; i > 0 && max[i - 1] == 0xFF; --i) ;
504 if (!ASN1_BIT_STRING_set(aor->u.addressRange->max, max, i))
506 aor->u.addressRange->max->flags &= ~7;
507 aor->u.addressRange->max->flags |= ASN1_STRING_FLAG_BITS_LEFT;
509 unsigned char b = max[i - 1];
511 while ((b & (0xFFU >> j)) != (0xFFU >> j))
513 aor->u.addressRange->max->flags |= 8 - j;
520 IPAddressOrRange_free(aor);
525 * Construct a new address family or find an existing one.
527 static IPAddressFamily *make_IPAddressFamily(IPAddrBlocks *addr,
529 const unsigned *safi)
532 unsigned char key[3];
536 key[0] = (afi >> 8) & 0xFF;
539 key[2] = *safi & 0xFF;
545 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
546 f = sk_IPAddressFamily_value(addr, i);
547 OPENSSL_assert(f->addressFamily->data != NULL);
548 if (f->addressFamily->length == keylen &&
549 !memcmp(f->addressFamily->data, key, keylen))
553 if ((f = IPAddressFamily_new()) == NULL)
555 if (f->ipAddressChoice == NULL &&
556 (f->ipAddressChoice = IPAddressChoice_new()) == NULL)
558 if (f->addressFamily == NULL &&
559 (f->addressFamily = ASN1_OCTET_STRING_new()) == NULL)
561 if (!ASN1_OCTET_STRING_set(f->addressFamily, key, keylen))
563 if (!sk_IPAddressFamily_push(addr, f))
569 IPAddressFamily_free(f);
574 * Add an inheritance element.
576 int X509v3_addr_add_inherit(IPAddrBlocks *addr,
577 const unsigned afi, const unsigned *safi)
579 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
581 f->ipAddressChoice == NULL ||
582 (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
583 f->ipAddressChoice->u.addressesOrRanges != NULL))
585 if (f->ipAddressChoice->type == IPAddressChoice_inherit &&
586 f->ipAddressChoice->u.inherit != NULL)
588 if (f->ipAddressChoice->u.inherit == NULL &&
589 (f->ipAddressChoice->u.inherit = ASN1_NULL_new()) == NULL)
591 f->ipAddressChoice->type = IPAddressChoice_inherit;
596 * Construct an IPAddressOrRange sequence, or return an existing one.
598 static IPAddressOrRanges *make_prefix_or_range(IPAddrBlocks *addr,
600 const unsigned *safi)
602 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
603 IPAddressOrRanges *aors = NULL;
606 f->ipAddressChoice == NULL ||
607 (f->ipAddressChoice->type == IPAddressChoice_inherit &&
608 f->ipAddressChoice->u.inherit != NULL))
610 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges)
611 aors = f->ipAddressChoice->u.addressesOrRanges;
614 if ((aors = sk_IPAddressOrRange_new_null()) == NULL)
618 (void)sk_IPAddressOrRange_set_cmp_func(aors, v4IPAddressOrRange_cmp);
621 (void)sk_IPAddressOrRange_set_cmp_func(aors, v6IPAddressOrRange_cmp);
624 f->ipAddressChoice->type = IPAddressChoice_addressesOrRanges;
625 f->ipAddressChoice->u.addressesOrRanges = aors;
632 int X509v3_addr_add_prefix(IPAddrBlocks *addr,
634 const unsigned *safi,
635 unsigned char *a, const int prefixlen)
637 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
638 IPAddressOrRange *aor;
639 if (aors == NULL || !make_addressPrefix(&aor, a, prefixlen))
641 if (sk_IPAddressOrRange_push(aors, aor))
643 IPAddressOrRange_free(aor);
650 int X509v3_addr_add_range(IPAddrBlocks *addr,
652 const unsigned *safi,
653 unsigned char *min, unsigned char *max)
655 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
656 IPAddressOrRange *aor;
657 int length = length_from_afi(afi);
660 if (!make_addressRange(&aor, min, max, length))
662 if (sk_IPAddressOrRange_push(aors, aor))
664 IPAddressOrRange_free(aor);
669 * Extract min and max values from an IPAddressOrRange.
671 static int extract_min_max(IPAddressOrRange *aor,
672 unsigned char *min, unsigned char *max, int length)
674 if (aor == NULL || min == NULL || max == NULL)
677 case IPAddressOrRange_addressPrefix:
678 return (addr_expand(min, aor->u.addressPrefix, length, 0x00) &&
679 addr_expand(max, aor->u.addressPrefix, length, 0xFF));
680 case IPAddressOrRange_addressRange:
681 return (addr_expand(min, aor->u.addressRange->min, length, 0x00) &&
682 addr_expand(max, aor->u.addressRange->max, length, 0xFF));
688 * Public wrapper for extract_min_max().
690 int X509v3_addr_get_range(IPAddressOrRange *aor,
693 unsigned char *max, const int length)
695 int afi_length = length_from_afi(afi);
696 if (aor == NULL || min == NULL || max == NULL ||
697 afi_length == 0 || length < afi_length ||
698 (aor->type != IPAddressOrRange_addressPrefix &&
699 aor->type != IPAddressOrRange_addressRange) ||
700 !extract_min_max(aor, min, max, afi_length))
707 * Sort comparison function for a sequence of IPAddressFamily.
709 * The last paragraph of RFC 3779 2.2.3.3 is slightly ambiguous about
710 * the ordering: I can read it as meaning that IPv6 without a SAFI
711 * comes before IPv4 with a SAFI, which seems pretty weird. The
712 * examples in appendix B suggest that the author intended the
713 * null-SAFI rule to apply only within a single AFI, which is what I
714 * would have expected and is what the following code implements.
716 static int IPAddressFamily_cmp(const IPAddressFamily *const *a_,
717 const IPAddressFamily *const *b_)
719 const ASN1_OCTET_STRING *a = (*a_)->addressFamily;
720 const ASN1_OCTET_STRING *b = (*b_)->addressFamily;
721 int len = ((a->length <= b->length) ? a->length : b->length);
722 int cmp = memcmp(a->data, b->data, len);
723 return cmp ? cmp : a->length - b->length;
727 * Check whether an IPAddrBLocks is in canonical form.
729 int X509v3_addr_is_canonical(IPAddrBlocks *addr)
731 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
732 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
733 IPAddressOrRanges *aors;
737 * Empty extension is cannonical.
743 * Check whether the top-level list is in order.
745 for (i = 0; i < sk_IPAddressFamily_num(addr) - 1; i++) {
746 const IPAddressFamily *a = sk_IPAddressFamily_value(addr, i);
747 const IPAddressFamily *b = sk_IPAddressFamily_value(addr, i + 1);
748 if (IPAddressFamily_cmp(&a, &b) >= 0)
753 * Top level's ok, now check each address family.
755 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
756 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
757 int length = length_from_afi(X509v3_addr_get_afi(f));
760 * Inheritance is canonical. Anything other than inheritance or
761 * a SEQUENCE OF IPAddressOrRange is an ASN.1 error or something.
763 if (f == NULL || f->ipAddressChoice == NULL)
765 switch (f->ipAddressChoice->type) {
766 case IPAddressChoice_inherit:
768 case IPAddressChoice_addressesOrRanges:
775 * It's an IPAddressOrRanges sequence, check it.
777 aors = f->ipAddressChoice->u.addressesOrRanges;
778 if (sk_IPAddressOrRange_num(aors) == 0)
780 for (j = 0; j < sk_IPAddressOrRange_num(aors) - 1; j++) {
781 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
782 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, j + 1);
784 if (!extract_min_max(a, a_min, a_max, length) ||
785 !extract_min_max(b, b_min, b_max, length))
789 * Punt misordered list, overlapping start, or inverted range.
791 if (memcmp(a_min, b_min, length) >= 0 ||
792 memcmp(a_min, a_max, length) > 0 ||
793 memcmp(b_min, b_max, length) > 0)
797 * Punt if adjacent or overlapping. Check for adjacency by
798 * subtracting one from b_min first.
800 for (k = length - 1; k >= 0 && b_min[k]-- == 0x00; k--) ;
801 if (memcmp(a_max, b_min, length) >= 0)
805 * Check for range that should be expressed as a prefix.
807 if (a->type == IPAddressOrRange_addressRange &&
808 range_should_be_prefix(a_min, a_max, length) >= 0)
813 * Check range to see if it's inverted or should be a
816 j = sk_IPAddressOrRange_num(aors) - 1;
818 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
819 if (a != NULL && a->type == IPAddressOrRange_addressRange) {
820 if (!extract_min_max(a, a_min, a_max, length))
822 if (memcmp(a_min, a_max, length) > 0 ||
823 range_should_be_prefix(a_min, a_max, length) >= 0)
830 * If we made it through all that, we're happy.
836 * Whack an IPAddressOrRanges into canonical form.
838 static int IPAddressOrRanges_canonize(IPAddressOrRanges *aors,
841 int i, j, length = length_from_afi(afi);
844 * Sort the IPAddressOrRanges sequence.
846 sk_IPAddressOrRange_sort(aors);
849 * Clean up representation issues, punt on duplicates or overlaps.
851 for (i = 0; i < sk_IPAddressOrRange_num(aors) - 1; i++) {
852 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, i);
853 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, i + 1);
854 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
855 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
857 if (!extract_min_max(a, a_min, a_max, length) ||
858 !extract_min_max(b, b_min, b_max, length))
862 * Punt inverted ranges.
864 if (memcmp(a_min, a_max, length) > 0 ||
865 memcmp(b_min, b_max, length) > 0)
871 if (memcmp(a_max, b_min, length) >= 0)
875 * Merge if a and b are adjacent. We check for
876 * adjacency by subtracting one from b_min first.
878 for (j = length - 1; j >= 0 && b_min[j]-- == 0x00; j--) ;
879 if (memcmp(a_max, b_min, length) == 0) {
880 IPAddressOrRange *merged;
881 if (!make_addressRange(&merged, a_min, b_max, length))
883 (void)sk_IPAddressOrRange_set(aors, i, merged);
884 (void)sk_IPAddressOrRange_delete(aors, i + 1);
885 IPAddressOrRange_free(a);
886 IPAddressOrRange_free(b);
893 * Check for inverted final range.
895 j = sk_IPAddressOrRange_num(aors) - 1;
897 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
898 if (a != NULL && a->type == IPAddressOrRange_addressRange) {
899 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
900 if (!extract_min_max(a, a_min, a_max, length))
902 if (memcmp(a_min, a_max, length) > 0)
911 * Whack an IPAddrBlocks extension into canonical form.
913 int X509v3_addr_canonize(IPAddrBlocks *addr)
916 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
917 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
918 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
919 !IPAddressOrRanges_canonize(f->ipAddressChoice->
921 X509v3_addr_get_afi(f)))
924 (void)sk_IPAddressFamily_set_cmp_func(addr, IPAddressFamily_cmp);
925 sk_IPAddressFamily_sort(addr);
926 OPENSSL_assert(X509v3_addr_is_canonical(addr));
931 * v2i handler for the IPAddrBlocks extension.
933 static void *v2i_IPAddrBlocks(const struct v3_ext_method *method,
934 struct v3_ext_ctx *ctx,
935 STACK_OF(CONF_VALUE) *values)
937 static const char v4addr_chars[] = "0123456789.";
938 static const char v6addr_chars[] = "0123456789.:abcdefABCDEF";
939 IPAddrBlocks *addr = NULL;
943 if ((addr = sk_IPAddressFamily_new(IPAddressFamily_cmp)) == NULL) {
944 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
948 for (i = 0; i < sk_CONF_VALUE_num(values); i++) {
949 CONF_VALUE *val = sk_CONF_VALUE_value(values, i);
950 unsigned char min[ADDR_RAW_BUF_LEN], max[ADDR_RAW_BUF_LEN];
951 unsigned afi, *safi = NULL, safi_;
952 const char *addr_chars = NULL;
953 int prefixlen, i1, i2, delim, length;
955 if (!name_cmp(val->name, "IPv4")) {
957 } else if (!name_cmp(val->name, "IPv6")) {
959 } else if (!name_cmp(val->name, "IPv4-SAFI")) {
962 } else if (!name_cmp(val->name, "IPv6-SAFI")) {
966 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
967 X509V3_R_EXTENSION_NAME_ERROR);
968 X509V3_conf_err(val);
974 addr_chars = v4addr_chars;
977 addr_chars = v6addr_chars;
981 length = length_from_afi(afi);
984 * Handle SAFI, if any, and OPENSSL_strdup() so we can null-terminate
985 * the other input values.
988 *safi = strtoul(val->value, &t, 0);
989 t += strspn(t, " \t");
990 if (*safi > 0xFF || *t++ != ':') {
991 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_SAFI);
992 X509V3_conf_err(val);
995 t += strspn(t, " \t");
996 s = OPENSSL_strdup(t);
998 s = OPENSSL_strdup(val->value);
1001 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1006 * Check for inheritance. Not worth additional complexity to
1007 * optimize this (seldom-used) case.
1009 if (strcmp(s, "inherit") == 0) {
1010 if (!X509v3_addr_add_inherit(addr, afi, safi)) {
1011 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1012 X509V3_R_INVALID_INHERITANCE);
1013 X509V3_conf_err(val);
1021 i1 = strspn(s, addr_chars);
1022 i2 = i1 + strspn(s + i1, " \t");
1026 if (a2i_ipadd(min, s) != length) {
1027 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_IPADDRESS);
1028 X509V3_conf_err(val);
1034 prefixlen = (int)strtoul(s + i2, &t, 10);
1035 if (t == s + i2 || *t != '\0') {
1036 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1037 X509V3_R_EXTENSION_VALUE_ERROR);
1038 X509V3_conf_err(val);
1041 if (!X509v3_addr_add_prefix(addr, afi, safi, min, prefixlen)) {
1042 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1047 i1 = i2 + strspn(s + i2, " \t");
1048 i2 = i1 + strspn(s + i1, addr_chars);
1049 if (i1 == i2 || s[i2] != '\0') {
1050 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1051 X509V3_R_EXTENSION_VALUE_ERROR);
1052 X509V3_conf_err(val);
1055 if (a2i_ipadd(max, s + i1) != length) {
1056 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1057 X509V3_R_INVALID_IPADDRESS);
1058 X509V3_conf_err(val);
1061 if (memcmp(min, max, length_from_afi(afi)) > 0) {
1062 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1063 X509V3_R_EXTENSION_VALUE_ERROR);
1064 X509V3_conf_err(val);
1067 if (!X509v3_addr_add_range(addr, afi, safi, min, max)) {
1068 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1073 if (!X509v3_addr_add_prefix(addr, afi, safi, min, length * 8)) {
1074 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1079 X509V3err(X509V3_F_V2I_IPADDRBLOCKS,
1080 X509V3_R_EXTENSION_VALUE_ERROR);
1081 X509V3_conf_err(val);
1090 * Canonize the result, then we're done.
1092 if (!X509v3_addr_canonize(addr))
1098 sk_IPAddressFamily_pop_free(addr, IPAddressFamily_free);
1105 const X509V3_EXT_METHOD v3_addr = {
1106 NID_sbgp_ipAddrBlock, /* nid */
1108 ASN1_ITEM_ref(IPAddrBlocks), /* template */
1109 0, 0, 0, 0, /* old functions, ignored */
1113 v2i_IPAddrBlocks, /* v2i */
1114 i2r_IPAddrBlocks, /* i2r */
1116 NULL /* extension-specific data */
1120 * Figure out whether extension sues inheritance.
1122 int X509v3_addr_inherits(IPAddrBlocks *addr)
1127 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
1128 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
1129 if (f->ipAddressChoice->type == IPAddressChoice_inherit)
1136 * Figure out whether parent contains child.
1138 static int addr_contains(IPAddressOrRanges *parent,
1139 IPAddressOrRanges *child, int length)
1141 unsigned char p_min[ADDR_RAW_BUF_LEN], p_max[ADDR_RAW_BUF_LEN];
1142 unsigned char c_min[ADDR_RAW_BUF_LEN], c_max[ADDR_RAW_BUF_LEN];
1145 if (child == NULL || parent == child)
1151 for (c = 0; c < sk_IPAddressOrRange_num(child); c++) {
1152 if (!extract_min_max(sk_IPAddressOrRange_value(child, c),
1153 c_min, c_max, length))
1156 if (p >= sk_IPAddressOrRange_num(parent))
1158 if (!extract_min_max(sk_IPAddressOrRange_value(parent, p),
1159 p_min, p_max, length))
1161 if (memcmp(p_max, c_max, length) < 0)
1163 if (memcmp(p_min, c_min, length) > 0)
1173 * Test whether a is a subset of b.
1175 int X509v3_addr_subset(IPAddrBlocks *a, IPAddrBlocks *b)
1178 if (a == NULL || a == b)
1180 if (b == NULL || X509v3_addr_inherits(a) || X509v3_addr_inherits(b))
1182 (void)sk_IPAddressFamily_set_cmp_func(b, IPAddressFamily_cmp);
1183 for (i = 0; i < sk_IPAddressFamily_num(a); i++) {
1184 IPAddressFamily *fa = sk_IPAddressFamily_value(a, i);
1185 int j = sk_IPAddressFamily_find(b, fa);
1186 IPAddressFamily *fb;
1187 fb = sk_IPAddressFamily_value(b, j);
1190 if (!addr_contains(fb->ipAddressChoice->u.addressesOrRanges,
1191 fa->ipAddressChoice->u.addressesOrRanges,
1192 length_from_afi(X509v3_addr_get_afi(fb))))
1199 * Validation error handling via callback.
1201 #define validation_err(_err_) \
1203 if (ctx != NULL) { \
1204 ctx->error = _err_; \
1205 ctx->error_depth = i; \
1206 ctx->current_cert = x; \
1207 ret = ctx->verify_cb(0, ctx); \
1216 * Core code for RFC 3779 2.3 path validation.
1218 static int addr_validate_path_internal(X509_STORE_CTX *ctx,
1219 STACK_OF(X509) *chain,
1222 IPAddrBlocks *child = NULL;
1226 OPENSSL_assert(chain != NULL && sk_X509_num(chain) > 0);
1227 OPENSSL_assert(ctx != NULL || ext != NULL);
1228 OPENSSL_assert(ctx == NULL || ctx->verify_cb != NULL);
1231 * Figure out where to start. If we don't have an extension to
1232 * check, we're done. Otherwise, check canonical form and
1233 * set up for walking up the chain.
1240 x = sk_X509_value(chain, i);
1241 OPENSSL_assert(x != NULL);
1242 if ((ext = x->rfc3779_addr) == NULL)
1245 if (!X509v3_addr_is_canonical(ext))
1246 validation_err(X509_V_ERR_INVALID_EXTENSION);
1247 (void)sk_IPAddressFamily_set_cmp_func(ext, IPAddressFamily_cmp);
1248 if ((child = sk_IPAddressFamily_dup(ext)) == NULL) {
1249 X509V3err(X509V3_F_ADDR_VALIDATE_PATH_INTERNAL,
1250 ERR_R_MALLOC_FAILURE);
1256 * Now walk up the chain. No cert may list resources that its
1257 * parent doesn't list.
1259 for (i++; i < sk_X509_num(chain); i++) {
1260 x = sk_X509_value(chain, i);
1261 OPENSSL_assert(x != NULL);
1262 if (!X509v3_addr_is_canonical(x->rfc3779_addr))
1263 validation_err(X509_V_ERR_INVALID_EXTENSION);
1264 if (x->rfc3779_addr == NULL) {
1265 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1266 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1267 if (fc->ipAddressChoice->type != IPAddressChoice_inherit) {
1268 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1274 (void)sk_IPAddressFamily_set_cmp_func(x->rfc3779_addr,
1275 IPAddressFamily_cmp);
1276 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1277 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1278 int k = sk_IPAddressFamily_find(x->rfc3779_addr, fc);
1279 IPAddressFamily *fp =
1280 sk_IPAddressFamily_value(x->rfc3779_addr, k);
1282 if (fc->ipAddressChoice->type ==
1283 IPAddressChoice_addressesOrRanges) {
1284 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1289 if (fp->ipAddressChoice->type ==
1290 IPAddressChoice_addressesOrRanges) {
1291 if (fc->ipAddressChoice->type == IPAddressChoice_inherit
1292 || addr_contains(fp->ipAddressChoice->u.addressesOrRanges,
1293 fc->ipAddressChoice->u.addressesOrRanges,
1294 length_from_afi(X509v3_addr_get_afi(fc))))
1295 sk_IPAddressFamily_set(child, j, fp);
1297 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1303 * Trust anchor can't inherit.
1305 OPENSSL_assert(x != NULL);
1306 if (x->rfc3779_addr != NULL) {
1307 for (j = 0; j < sk_IPAddressFamily_num(x->rfc3779_addr); j++) {
1308 IPAddressFamily *fp =
1309 sk_IPAddressFamily_value(x->rfc3779_addr, j);
1310 if (fp->ipAddressChoice->type == IPAddressChoice_inherit
1311 && sk_IPAddressFamily_find(child, fp) >= 0)
1312 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1317 sk_IPAddressFamily_free(child);
1321 #undef validation_err
1324 * RFC 3779 2.3 path validation -- called from X509_verify_cert().
1326 int X509v3_addr_validate_path(X509_STORE_CTX *ctx)
1328 return addr_validate_path_internal(ctx, ctx->chain, NULL);
1332 * RFC 3779 2.3 path validation of an extension.
1333 * Test whether chain covers extension.
1335 int X509v3_addr_validate_resource_set(STACK_OF(X509) *chain,
1336 IPAddrBlocks *ext, int allow_inheritance)
1340 if (chain == NULL || sk_X509_num(chain) == 0)
1342 if (!allow_inheritance && X509v3_addr_inherits(ext))
1344 return addr_validate_path_internal(NULL, chain, ext);
1347 #endif /* OPENSSL_NO_RFC3779 */