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 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 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];
182 addr_expand(addr, bs, 4, fill);
183 BIO_printf(out, "%d.%d.%d.%d", addr[0], addr[1], addr[2], addr[3]);
186 addr_expand(addr, bs, 16, fill);
187 for (n = 16; n > 1 && addr[n-1] == 0x00 && addr[n-2] == 0x00; n -= 2)
189 for (i = 0; i < n; i += 2)
190 BIO_printf(out, "%x%s", (addr[i] << 8) | addr[i+1], (i < 14 ? ":" : ""));
195 for (i = 0; i < bs->length; i++)
196 BIO_printf(out, "%s%02x", (i > 0 ? ":" : ""), bs->data[i]);
197 BIO_printf(out, "[%d]", (int) (bs->flags & 7));
204 * i2r handler for a sequence of addresses and ranges.
206 static int i2r_IPAddressOrRanges(BIO *out,
208 const IPAddressOrRanges *aors,
212 for (i = 0; i < sk_IPAddressOrRange_num(aors); i++) {
213 const IPAddressOrRange *aor = sk_IPAddressOrRange_value(aors, i);
214 BIO_printf(out, "%*s", indent, "");
216 case IPAddressOrRange_addressPrefix:
217 if (!i2r_address(out, afi, 0x00, aor->u.addressPrefix))
219 BIO_printf(out, "/%d\n", addr_prefixlen(aor->u.addressPrefix));
221 case IPAddressOrRange_addressRange:
222 if (!i2r_address(out, afi, 0x00, aor->u.addressRange->min))
225 if (!i2r_address(out, afi, 0xFF, aor->u.addressRange->max))
235 * i2r handler for an IPAddrBlocks extension.
237 static int i2r_IPAddrBlocks(X509V3_EXT_METHOD *method,
242 const IPAddrBlocks *addr = ext;
244 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
245 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
246 const unsigned afi = v3_addr_get_afi(f);
249 BIO_printf(out, "%*sIPv4", indent, "");
252 BIO_printf(out, "%*sIPv6", indent, "");
255 BIO_printf(out, "%*sUnknown AFI %u", indent, "", afi);
258 if (f->addressFamily->length > 2) {
259 switch (f->addressFamily->data[2]) {
261 BIO_puts(out, " (Unicast)");
264 BIO_puts(out, " (Multicast)");
267 BIO_puts(out, " (Unicast/Multicast)");
270 BIO_puts(out, " (MPLS)");
273 BIO_puts(out, " (Tunnel)");
276 BIO_puts(out, " (VPLS)");
279 BIO_puts(out, " (BGP MDT)");
282 BIO_puts(out, " (MPLS-labeled VPN)");
285 BIO_printf(out, " (Unknown SAFI %u)",
286 (unsigned) f->addressFamily->data[2]);
290 switch (f->ipAddressChoice->type) {
291 case IPAddressChoice_inherit:
292 BIO_puts(out, ": inherit\n");
294 case IPAddressChoice_addressesOrRanges:
295 BIO_puts(out, ":\n");
296 if (!i2r_IPAddressOrRanges(out,
298 f->ipAddressChoice->u.addressesOrRanges,
308 * Sort comparison function for a sequence of IPAddressOrRange
311 static int IPAddressOrRange_cmp(const IPAddressOrRange *a,
312 const IPAddressOrRange *b,
315 unsigned char addr_a[ADDR_RAW_BUF_LEN], addr_b[ADDR_RAW_BUF_LEN];
321 case IPAddressOrRange_addressPrefix:
322 addr_expand(addr_a, a->u.addressPrefix, length, 0x00);
323 prefixlen_a = addr_prefixlen(a->u.addressPrefix);
325 case IPAddressOrRange_addressRange:
326 addr_expand(addr_a, a->u.addressRange->min, length, 0x00);
327 prefixlen_a = length * 8;
332 case IPAddressOrRange_addressPrefix:
333 addr_expand(addr_b, b->u.addressPrefix, length, 0x00);
334 prefixlen_b = addr_prefixlen(b->u.addressPrefix);
336 case IPAddressOrRange_addressRange:
337 addr_expand(addr_b, b->u.addressRange->min, length, 0x00);
338 prefixlen_b = length * 8;
342 if ((r = memcmp(addr_a, addr_b, length)) != 0)
345 return prefixlen_a - prefixlen_b;
349 * IPv4-specific closure over IPAddressOrRange_cmp, since sk_sort()
350 * comparision routines are only allowed two arguments.
352 static int v4IPAddressOrRange_cmp(const IPAddressOrRange * const *a,
353 const IPAddressOrRange * const *b)
355 return IPAddressOrRange_cmp(*a, *b, 4);
359 * IPv6-specific closure over IPAddressOrRange_cmp, since sk_sort()
360 * comparision routines are only allowed two arguments.
362 static int v6IPAddressOrRange_cmp(const IPAddressOrRange * const *a,
363 const IPAddressOrRange * const *b)
365 return IPAddressOrRange_cmp(*a, *b, 16);
369 * Calculate whether a range collapses to a prefix.
370 * See last paragraph of RFC 3779 2.2.3.7.
372 static int range_should_be_prefix(const unsigned char *min,
373 const unsigned char *max,
379 for (i = 0; i < length && min[i] == max[i]; i++)
381 for (j = length - 1; j >= 0 && min[j] == 0x00 && max[j] == 0xFF; j--)
387 mask = min[i] ^ max[i];
389 case 0x01: j = 7; break;
390 case 0x03: j = 6; break;
391 case 0x07: j = 5; break;
392 case 0x0F: j = 4; break;
393 case 0x1F: j = 3; break;
394 case 0x3F: j = 2; break;
395 case 0x7F: j = 1; break;
398 if ((min[i] & mask) != 0 || (max[i] & mask) != mask)
405 * Construct a prefix.
407 static int make_addressPrefix(IPAddressOrRange **result,
411 int bytelen = (prefixlen + 7) / 8, bitlen = prefixlen % 8;
412 IPAddressOrRange *aor = IPAddressOrRange_new();
416 aor->type = IPAddressOrRange_addressPrefix;
417 if (aor->u.addressPrefix == NULL &&
418 (aor->u.addressPrefix = ASN1_BIT_STRING_new()) == NULL)
420 if (!ASN1_BIT_STRING_set(aor->u.addressPrefix, addr, bytelen))
422 aor->u.addressPrefix->flags &= ~7;
423 aor->u.addressPrefix->flags |= ASN1_STRING_FLAG_BITS_LEFT;
425 aor->u.addressPrefix->data[bytelen - 1] &= ~(0xFF >> bitlen);
426 aor->u.addressPrefix->flags |= 8 - bitlen;
433 IPAddressOrRange_free(aor);
438 * Construct a range. If it can be expressed as a prefix,
439 * return a prefix instead. Doing this here simplifies
440 * the rest of the code considerably.
442 static int make_addressRange(IPAddressOrRange **result,
447 IPAddressOrRange *aor;
450 if ((prefixlen = range_should_be_prefix(min, max, length)) >= 0)
451 return make_addressPrefix(result, min, prefixlen);
453 if ((aor = IPAddressOrRange_new()) == NULL)
455 aor->type = IPAddressOrRange_addressRange;
456 assert(aor->u.addressRange == NULL);
457 if ((aor->u.addressRange = IPAddressRange_new()) == NULL)
459 if (aor->u.addressRange->min == NULL &&
460 (aor->u.addressRange->min = ASN1_BIT_STRING_new()) == NULL)
462 if (aor->u.addressRange->max == NULL &&
463 (aor->u.addressRange->max = ASN1_BIT_STRING_new()) == NULL)
466 for (i = length; i > 0 && min[i - 1] == 0x00; --i)
468 if (!ASN1_BIT_STRING_set(aor->u.addressRange->min, min, i))
470 aor->u.addressRange->min->flags &= ~7;
471 aor->u.addressRange->min->flags |= ASN1_STRING_FLAG_BITS_LEFT;
473 unsigned char b = min[i - 1];
475 while ((b & (0xFFU >> j)) != 0)
477 aor->u.addressRange->min->flags |= 8 - j;
480 for (i = length; i > 0 && max[i - 1] == 0xFF; --i)
482 if (!ASN1_BIT_STRING_set(aor->u.addressRange->max, max, i))
484 aor->u.addressRange->max->flags &= ~7;
485 aor->u.addressRange->max->flags |= ASN1_STRING_FLAG_BITS_LEFT;
487 unsigned char b = max[i - 1];
489 while ((b & (0xFFU >> j)) != (0xFFU >> j))
491 aor->u.addressRange->max->flags |= 8 - j;
498 IPAddressOrRange_free(aor);
503 * Construct a new address family or find an existing one.
505 static IPAddressFamily *make_IPAddressFamily(IPAddrBlocks *addr,
507 const unsigned *safi)
510 unsigned char key[3];
514 key[0] = (afi >> 8) & 0xFF;
517 key[2] = *safi & 0xFF;
523 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
524 f = sk_IPAddressFamily_value(addr, i);
525 assert(f->addressFamily->data != NULL);
526 if (f->addressFamily->length == keylen &&
527 !memcmp(f->addressFamily->data, key, keylen))
531 if ((f = IPAddressFamily_new()) == NULL)
533 if (f->ipAddressChoice == NULL &&
534 (f->ipAddressChoice = IPAddressChoice_new()) == NULL)
536 if (f->addressFamily == NULL &&
537 (f->addressFamily = ASN1_OCTET_STRING_new()) == NULL)
539 if (!ASN1_OCTET_STRING_set(f->addressFamily, key, keylen))
541 if (!sk_IPAddressFamily_push(addr, f))
547 IPAddressFamily_free(f);
552 * Add an inheritance element.
554 int v3_addr_add_inherit(IPAddrBlocks *addr,
556 const unsigned *safi)
558 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
560 f->ipAddressChoice == NULL ||
561 (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
562 f->ipAddressChoice->u.addressesOrRanges != NULL))
564 if (f->ipAddressChoice->type == IPAddressChoice_inherit &&
565 f->ipAddressChoice->u.inherit != NULL)
567 if (f->ipAddressChoice->u.inherit == NULL &&
568 (f->ipAddressChoice->u.inherit = ASN1_NULL_new()) == NULL)
570 f->ipAddressChoice->type = IPAddressChoice_inherit;
575 * Construct an IPAddressOrRange sequence, or return an existing one.
577 static IPAddressOrRanges *make_prefix_or_range(IPAddrBlocks *addr,
579 const unsigned *safi)
581 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
582 IPAddressOrRanges *aors = NULL;
585 f->ipAddressChoice == NULL ||
586 (f->ipAddressChoice->type == IPAddressChoice_inherit &&
587 f->ipAddressChoice->u.inherit != NULL))
589 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges)
590 aors = f->ipAddressChoice->u.addressesOrRanges;
593 if ((aors = sk_IPAddressOrRange_new_null()) == NULL)
597 (void)sk_IPAddressOrRange_set_cmp_func(aors, v4IPAddressOrRange_cmp);
600 (void)sk_IPAddressOrRange_set_cmp_func(aors, v6IPAddressOrRange_cmp);
603 f->ipAddressChoice->type = IPAddressChoice_addressesOrRanges;
604 f->ipAddressChoice->u.addressesOrRanges = aors;
611 int v3_addr_add_prefix(IPAddrBlocks *addr,
613 const unsigned *safi,
617 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
618 IPAddressOrRange *aor;
619 if (aors == NULL || !make_addressPrefix(&aor, a, prefixlen))
621 if (sk_IPAddressOrRange_push(aors, aor))
623 IPAddressOrRange_free(aor);
630 int v3_addr_add_range(IPAddrBlocks *addr,
632 const unsigned *safi,
636 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
637 IPAddressOrRange *aor;
638 int length = length_from_afi(afi);
641 if (!make_addressRange(&aor, min, max, length))
643 if (sk_IPAddressOrRange_push(aors, aor))
645 IPAddressOrRange_free(aor);
650 * Extract min and max values from an IPAddressOrRange.
652 static void extract_min_max(IPAddressOrRange *aor,
657 assert(aor != NULL && min != NULL && max != NULL);
659 case IPAddressOrRange_addressPrefix:
660 addr_expand(min, aor->u.addressPrefix, length, 0x00);
661 addr_expand(max, aor->u.addressPrefix, length, 0xFF);
663 case IPAddressOrRange_addressRange:
664 addr_expand(min, aor->u.addressRange->min, length, 0x00);
665 addr_expand(max, aor->u.addressRange->max, length, 0xFF);
671 * Public wrapper for extract_min_max().
673 int v3_addr_get_range(IPAddressOrRange *aor,
679 int afi_length = length_from_afi(afi);
680 if (aor == NULL || min == NULL || max == NULL ||
681 afi_length == 0 || length < afi_length ||
682 (aor->type != IPAddressOrRange_addressPrefix &&
683 aor->type != IPAddressOrRange_addressRange))
685 extract_min_max(aor, min, max, afi_length);
690 * Sort comparision function for a sequence of IPAddressFamily.
692 * The last paragraph of RFC 3779 2.2.3.3 is slightly ambiguous about
693 * the ordering: I can read it as meaning that IPv6 without a SAFI
694 * comes before IPv4 with a SAFI, which seems pretty weird. The
695 * examples in appendix B suggest that the author intended the
696 * null-SAFI rule to apply only within a single AFI, which is what I
697 * would have expected and is what the following code implements.
699 static int IPAddressFamily_cmp(const IPAddressFamily * const *a_,
700 const IPAddressFamily * const *b_)
702 const ASN1_OCTET_STRING *a = (*a_)->addressFamily;
703 const ASN1_OCTET_STRING *b = (*b_)->addressFamily;
704 int len = ((a->length <= b->length) ? a->length : b->length);
705 int cmp = memcmp(a->data, b->data, len);
706 return cmp ? cmp : a->length - b->length;
710 * Check whether an IPAddrBLocks is in canonical form.
712 int v3_addr_is_canonical(IPAddrBlocks *addr)
714 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
715 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
716 IPAddressOrRanges *aors;
720 * Empty extension is cannonical.
726 * Check whether the top-level list is in order.
728 for (i = 0; i < sk_IPAddressFamily_num(addr) - 1; i++) {
729 const IPAddressFamily *a = sk_IPAddressFamily_value(addr, i);
730 const IPAddressFamily *b = sk_IPAddressFamily_value(addr, i + 1);
731 if (IPAddressFamily_cmp(&a, &b) >= 0)
736 * Top level's ok, now check each address family.
738 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
739 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
740 int length = length_from_afi(v3_addr_get_afi(f));
743 * Inheritance is canonical. Anything other than inheritance or
744 * a SEQUENCE OF IPAddressOrRange is an ASN.1 error or something.
746 if (f == NULL || f->ipAddressChoice == NULL)
748 switch (f->ipAddressChoice->type) {
749 case IPAddressChoice_inherit:
751 case IPAddressChoice_addressesOrRanges:
758 * It's an IPAddressOrRanges sequence, check it.
760 aors = f->ipAddressChoice->u.addressesOrRanges;
761 if (sk_IPAddressOrRange_num(aors) == 0)
763 for (j = 0; j < sk_IPAddressOrRange_num(aors) - 1; j++) {
764 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
765 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, j + 1);
767 extract_min_max(a, a_min, a_max, length);
768 extract_min_max(b, b_min, b_max, length);
771 * Punt misordered list, overlapping start, or inverted range.
773 if (memcmp(a_min, b_min, length) >= 0 ||
774 memcmp(a_min, a_max, length) > 0 ||
775 memcmp(b_min, b_max, length) > 0)
779 * Punt if adjacent or overlapping. Check for adjacency by
780 * subtracting one from b_min first.
782 for (k = length - 1; k >= 0 && b_min[k]-- == 0x00; k--)
784 if (memcmp(a_max, b_min, length) >= 0)
788 * Check for range that should be expressed as a prefix.
790 if (a->type == IPAddressOrRange_addressRange &&
791 range_should_be_prefix(a_min, a_max, length) >= 0)
796 * Check final range to see if it should be a prefix.
798 j = sk_IPAddressOrRange_num(aors) - 1;
800 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
801 if (a->type == IPAddressOrRange_addressRange) {
802 extract_min_max(a, a_min, a_max, length);
803 if (range_should_be_prefix(a_min, a_max, length) >= 0)
810 * If we made it through all that, we're happy.
816 * Whack an IPAddressOrRanges into canonical form.
818 static int IPAddressOrRanges_canonize(IPAddressOrRanges *aors,
821 int i, j, length = length_from_afi(afi);
824 * Sort the IPAddressOrRanges sequence.
826 sk_IPAddressOrRange_sort(aors);
829 * Clean up representation issues, punt on duplicates or overlaps.
831 for (i = 0; i < sk_IPAddressOrRange_num(aors) - 1; i++) {
832 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, i);
833 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, i + 1);
834 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
835 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
837 extract_min_max(a, a_min, a_max, length);
838 extract_min_max(b, b_min, b_max, length);
843 if (memcmp(a_max, b_min, length) >= 0)
847 * Merge if a and b are adjacent. We check for
848 * adjacency by subtracting one from b_min first.
850 for (j = length - 1; j >= 0 && b_min[j]-- == 0x00; j--)
852 if (memcmp(a_max, b_min, length) == 0) {
853 IPAddressOrRange *merged;
854 if (!make_addressRange(&merged, a_min, b_max, length))
856 sk_IPAddressOrRange_set(aors, i, merged);
857 (void)sk_IPAddressOrRange_delete(aors, i + 1);
858 IPAddressOrRange_free(a);
859 IPAddressOrRange_free(b);
869 * Whack an IPAddrBlocks extension into canonical form.
871 int v3_addr_canonize(IPAddrBlocks *addr)
874 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
875 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
876 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
877 !IPAddressOrRanges_canonize(f->ipAddressChoice->u.addressesOrRanges,
881 (void)sk_IPAddressFamily_set_cmp_func(addr, IPAddressFamily_cmp);
882 sk_IPAddressFamily_sort(addr);
883 assert(v3_addr_is_canonical(addr));
888 * v2i handler for the IPAddrBlocks extension.
890 static void *v2i_IPAddrBlocks(struct v3_ext_method *method,
891 struct v3_ext_ctx *ctx,
892 STACK_OF(CONF_VALUE) *values)
894 static const char v4addr_chars[] = "0123456789.";
895 static const char v6addr_chars[] = "0123456789.:abcdefABCDEF";
896 IPAddrBlocks *addr = NULL;
900 if ((addr = sk_IPAddressFamily_new(IPAddressFamily_cmp)) == NULL) {
901 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
905 for (i = 0; i < sk_CONF_VALUE_num(values); i++) {
906 CONF_VALUE *val = sk_CONF_VALUE_value(values, i);
907 unsigned char min[ADDR_RAW_BUF_LEN], max[ADDR_RAW_BUF_LEN];
908 unsigned afi, *safi = NULL, safi_;
909 const char *addr_chars;
910 int prefixlen, i1, i2, delim, length;
912 if ( !name_cmp(val->name, "IPv4")) {
914 } else if (!name_cmp(val->name, "IPv6")) {
916 } else if (!name_cmp(val->name, "IPv4-SAFI")) {
919 } else if (!name_cmp(val->name, "IPv6-SAFI")) {
923 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_NAME_ERROR);
924 X509V3_conf_err(val);
930 addr_chars = v4addr_chars;
933 addr_chars = v6addr_chars;
937 length = length_from_afi(afi);
940 * Handle SAFI, if any, and BUF_strdup() so we can null-terminate
941 * the other input values.
944 *safi = strtoul(val->value, &t, 0);
945 t += strspn(t, " \t");
946 if (*safi > 0xFF || *t++ != ':') {
947 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_SAFI);
948 X509V3_conf_err(val);
951 t += strspn(t, " \t");
954 s = BUF_strdup(val->value);
957 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
962 * Check for inheritance. Not worth additional complexity to
963 * optimize this (seldom-used) case.
965 if (!strcmp(s, "inherit")) {
966 if (!v3_addr_add_inherit(addr, afi, safi)) {
967 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_INHERITANCE);
968 X509V3_conf_err(val);
976 i1 = strspn(s, addr_chars);
977 i2 = i1 + strspn(s + i1, " \t");
981 if (a2i_ipadd(min, s) != length) {
982 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_IPADDRESS);
983 X509V3_conf_err(val);
989 prefixlen = (int) strtoul(s + i2, &t, 10);
990 if (t == s + i2 || *t != '\0') {
991 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
992 X509V3_conf_err(val);
995 if (!v3_addr_add_prefix(addr, afi, safi, min, prefixlen)) {
996 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1001 i1 = i2 + strspn(s + i2, " \t");
1002 i2 = i1 + strspn(s + i1, addr_chars);
1003 if (i1 == i2 || s[i2] != '\0') {
1004 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
1005 X509V3_conf_err(val);
1008 if (a2i_ipadd(max, s + i1) != length) {
1009 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_IPADDRESS);
1010 X509V3_conf_err(val);
1013 if (!v3_addr_add_range(addr, afi, safi, min, max)) {
1014 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1019 if (!v3_addr_add_prefix(addr, afi, safi, min, length * 8)) {
1020 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1025 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
1026 X509V3_conf_err(val);
1035 * Canonize the result, then we're done.
1037 if (!v3_addr_canonize(addr))
1043 sk_IPAddressFamily_pop_free(addr, IPAddressFamily_free);
1050 const X509V3_EXT_METHOD v3_addr = {
1051 NID_sbgp_ipAddrBlock, /* nid */
1053 ASN1_ITEM_ref(IPAddrBlocks), /* template */
1054 0, 0, 0, 0, /* old functions, ignored */
1058 v2i_IPAddrBlocks, /* v2i */
1059 i2r_IPAddrBlocks, /* i2r */
1061 NULL /* extension-specific data */
1065 * Figure out whether extension sues inheritance.
1067 int v3_addr_inherits(IPAddrBlocks *addr)
1072 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
1073 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
1074 if (f->ipAddressChoice->type == IPAddressChoice_inherit)
1081 * Figure out whether parent contains child.
1083 static int addr_contains(IPAddressOrRanges *parent,
1084 IPAddressOrRanges *child,
1087 unsigned char p_min[ADDR_RAW_BUF_LEN], p_max[ADDR_RAW_BUF_LEN];
1088 unsigned char c_min[ADDR_RAW_BUF_LEN], c_max[ADDR_RAW_BUF_LEN];
1091 if (child == NULL || parent == child)
1097 for (c = 0; c < sk_IPAddressOrRange_num(child); c++) {
1098 extract_min_max(sk_IPAddressOrRange_value(child, c),
1099 c_min, c_max, length);
1101 if (p >= sk_IPAddressOrRange_num(parent))
1103 extract_min_max(sk_IPAddressOrRange_value(parent, p),
1104 p_min, p_max, length);
1105 if (memcmp(p_max, c_max, length) < 0)
1107 if (memcmp(p_min, c_min, length) > 0)
1117 * Test whether a is a subset of b.
1119 int v3_addr_subset(IPAddrBlocks *a, IPAddrBlocks *b)
1122 if (a == NULL || a == b)
1124 if (b == NULL || v3_addr_inherits(a) || v3_addr_inherits(b))
1126 (void)sk_IPAddressFamily_set_cmp_func(b, IPAddressFamily_cmp);
1127 for (i = 0; i < sk_IPAddressFamily_num(a); i++) {
1128 IPAddressFamily *fa = sk_IPAddressFamily_value(a, i);
1129 int j = sk_IPAddressFamily_find(b, fa);
1130 IPAddressFamily *fb = sk_IPAddressFamily_value(b, j);
1131 if (!addr_contains(fb->ipAddressChoice->u.addressesOrRanges,
1132 fa->ipAddressChoice->u.addressesOrRanges,
1133 length_from_afi(v3_addr_get_afi(fb))))
1140 * Validation error handling via callback.
1142 #define validation_err(_err_) \
1144 if (ctx != NULL) { \
1145 ctx->error = _err_; \
1146 ctx->error_depth = i; \
1147 ctx->current_cert = x; \
1148 ret = ctx->verify_cb(0, ctx); \
1157 * Core code for RFC 3779 2.3 path validation.
1159 static int v3_addr_validate_path_internal(X509_STORE_CTX *ctx,
1160 STACK_OF(X509) *chain,
1163 IPAddrBlocks *child = NULL;
1167 assert(chain != NULL && sk_X509_num(chain) > 0);
1168 assert(ctx != NULL || ext != NULL);
1169 assert(ctx == NULL || ctx->verify_cb != NULL);
1172 * Figure out where to start. If we don't have an extension to
1173 * check, we're done. Otherwise, check canonical form and
1174 * set up for walking up the chain.
1180 x = sk_X509_value(chain, i);
1182 if ((ext = x->rfc3779_addr) == NULL)
1185 if (!v3_addr_is_canonical(ext))
1186 validation_err(X509_V_ERR_INVALID_EXTENSION);
1187 (void)sk_IPAddressFamily_set_cmp_func(ext, IPAddressFamily_cmp);
1188 if ((child = sk_IPAddressFamily_dup(ext)) == NULL) {
1189 X509V3err(X509V3_F_V3_ADDR_VALIDATE_PATH_INTERNAL, ERR_R_MALLOC_FAILURE);
1195 * Now walk up the chain. No cert may list resources that its
1196 * parent doesn't list.
1198 for (i++; i < sk_X509_num(chain); i++) {
1199 x = sk_X509_value(chain, i);
1201 if (!v3_addr_is_canonical(x->rfc3779_addr))
1202 validation_err(X509_V_ERR_INVALID_EXTENSION);
1203 if (x->rfc3779_addr == NULL) {
1204 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1205 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1206 if (fc->ipAddressChoice->type != IPAddressChoice_inherit) {
1207 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1213 (void)sk_IPAddressFamily_set_cmp_func(x->rfc3779_addr, IPAddressFamily_cmp);
1214 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1215 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1216 int k = sk_IPAddressFamily_find(x->rfc3779_addr, fc);
1217 IPAddressFamily *fp = sk_IPAddressFamily_value(x->rfc3779_addr, k);
1219 if (fc->ipAddressChoice->type == IPAddressChoice_addressesOrRanges) {
1220 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1225 if (fp->ipAddressChoice->type == IPAddressChoice_addressesOrRanges) {
1226 if (fc->ipAddressChoice->type == IPAddressChoice_inherit ||
1227 addr_contains(fp->ipAddressChoice->u.addressesOrRanges,
1228 fc->ipAddressChoice->u.addressesOrRanges,
1229 length_from_afi(v3_addr_get_afi(fc))))
1230 sk_IPAddressFamily_set(child, j, fp);
1232 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1238 * Trust anchor can't inherit.
1240 if (x->rfc3779_addr != NULL) {
1241 for (j = 0; j < sk_IPAddressFamily_num(x->rfc3779_addr); j++) {
1242 IPAddressFamily *fp = sk_IPAddressFamily_value(x->rfc3779_addr, j);
1243 if (fp->ipAddressChoice->type == IPAddressChoice_inherit &&
1244 sk_IPAddressFamily_find(child, fp) >= 0)
1245 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1250 sk_IPAddressFamily_free(child);
1254 #undef validation_err
1257 * RFC 3779 2.3 path validation -- called from X509_verify_cert().
1259 int v3_addr_validate_path(X509_STORE_CTX *ctx)
1261 return v3_addr_validate_path_internal(ctx, ctx->chain, NULL);
1265 * RFC 3779 2.3 path validation of an extension.
1266 * Test whether chain covers extension.
1268 int v3_addr_validate_resource_set(STACK_OF(X509) *chain,
1270 int allow_inheritance)
1274 if (chain == NULL || sk_X509_num(chain) == 0)
1276 if (!allow_inheritance && v3_addr_inherits(ext))
1278 return v3_addr_validate_path_internal(NULL, chain, ext);
1281 #endif /* OPENSSL_NO_RFC3779 */