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];
316 int prefixlen_a = 0, prefixlen_b = 0;
320 case IPAddressOrRange_addressPrefix:
321 addr_expand(addr_a, a->u.addressPrefix, length, 0x00);
322 prefixlen_a = addr_prefixlen(a->u.addressPrefix);
324 case IPAddressOrRange_addressRange:
325 addr_expand(addr_a, a->u.addressRange->min, length, 0x00);
326 prefixlen_a = length * 8;
331 case IPAddressOrRange_addressPrefix:
332 addr_expand(addr_b, b->u.addressPrefix, length, 0x00);
333 prefixlen_b = addr_prefixlen(b->u.addressPrefix);
335 case IPAddressOrRange_addressRange:
336 addr_expand(addr_b, b->u.addressRange->min, length, 0x00);
337 prefixlen_b = length * 8;
341 if ((r = memcmp(addr_a, addr_b, length)) != 0)
344 return prefixlen_a - prefixlen_b;
348 * IPv4-specific closure over IPAddressOrRange_cmp, since sk_sort()
349 * comparision routines are only allowed two arguments.
351 static int v4IPAddressOrRange_cmp(const IPAddressOrRange * const *a,
352 const IPAddressOrRange * const *b)
354 return IPAddressOrRange_cmp(*a, *b, 4);
358 * IPv6-specific closure over IPAddressOrRange_cmp, since sk_sort()
359 * comparision routines are only allowed two arguments.
361 static int v6IPAddressOrRange_cmp(const IPAddressOrRange * const *a,
362 const IPAddressOrRange * const *b)
364 return IPAddressOrRange_cmp(*a, *b, 16);
368 * Calculate whether a range collapses to a prefix.
369 * See last paragraph of RFC 3779 2.2.3.7.
371 static int range_should_be_prefix(const unsigned char *min,
372 const unsigned char *max,
378 for (i = 0; i < length && min[i] == max[i]; i++)
380 for (j = length - 1; j >= 0 && min[j] == 0x00 && max[j] == 0xFF; j--)
386 mask = min[i] ^ max[i];
388 case 0x01: j = 7; break;
389 case 0x03: j = 6; break;
390 case 0x07: j = 5; break;
391 case 0x0F: j = 4; break;
392 case 0x1F: j = 3; break;
393 case 0x3F: j = 2; break;
394 case 0x7F: j = 1; break;
397 if ((min[i] & mask) != 0 || (max[i] & mask) != mask)
404 * Construct a prefix.
406 static int make_addressPrefix(IPAddressOrRange **result,
410 int bytelen = (prefixlen + 7) / 8, bitlen = prefixlen % 8;
411 IPAddressOrRange *aor = IPAddressOrRange_new();
415 aor->type = IPAddressOrRange_addressPrefix;
416 if (aor->u.addressPrefix == NULL &&
417 (aor->u.addressPrefix = ASN1_BIT_STRING_new()) == NULL)
419 if (!ASN1_BIT_STRING_set(aor->u.addressPrefix, addr, bytelen))
421 aor->u.addressPrefix->flags &= ~7;
422 aor->u.addressPrefix->flags |= ASN1_STRING_FLAG_BITS_LEFT;
424 aor->u.addressPrefix->data[bytelen - 1] &= ~(0xFF >> bitlen);
425 aor->u.addressPrefix->flags |= 8 - bitlen;
432 IPAddressOrRange_free(aor);
437 * Construct a range. If it can be expressed as a prefix,
438 * return a prefix instead. Doing this here simplifies
439 * the rest of the code considerably.
441 static int make_addressRange(IPAddressOrRange **result,
446 IPAddressOrRange *aor;
449 if ((prefixlen = range_should_be_prefix(min, max, length)) >= 0)
450 return make_addressPrefix(result, min, prefixlen);
452 if ((aor = IPAddressOrRange_new()) == NULL)
454 aor->type = IPAddressOrRange_addressRange;
455 assert(aor->u.addressRange == NULL);
456 if ((aor->u.addressRange = IPAddressRange_new()) == NULL)
458 if (aor->u.addressRange->min == NULL &&
459 (aor->u.addressRange->min = ASN1_BIT_STRING_new()) == NULL)
461 if (aor->u.addressRange->max == NULL &&
462 (aor->u.addressRange->max = ASN1_BIT_STRING_new()) == NULL)
465 for (i = length; i > 0 && min[i - 1] == 0x00; --i)
467 if (!ASN1_BIT_STRING_set(aor->u.addressRange->min, min, i))
469 aor->u.addressRange->min->flags &= ~7;
470 aor->u.addressRange->min->flags |= ASN1_STRING_FLAG_BITS_LEFT;
472 unsigned char b = min[i - 1];
474 while ((b & (0xFFU >> j)) != 0)
476 aor->u.addressRange->min->flags |= 8 - j;
479 for (i = length; i > 0 && max[i - 1] == 0xFF; --i)
481 if (!ASN1_BIT_STRING_set(aor->u.addressRange->max, max, i))
483 aor->u.addressRange->max->flags &= ~7;
484 aor->u.addressRange->max->flags |= ASN1_STRING_FLAG_BITS_LEFT;
486 unsigned char b = max[i - 1];
488 while ((b & (0xFFU >> j)) != (0xFFU >> j))
490 aor->u.addressRange->max->flags |= 8 - j;
497 IPAddressOrRange_free(aor);
502 * Construct a new address family or find an existing one.
504 static IPAddressFamily *make_IPAddressFamily(IPAddrBlocks *addr,
506 const unsigned *safi)
509 unsigned char key[3];
513 key[0] = (afi >> 8) & 0xFF;
516 key[2] = *safi & 0xFF;
522 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
523 f = sk_IPAddressFamily_value(addr, i);
524 assert(f->addressFamily->data != NULL);
525 if (f->addressFamily->length == keylen &&
526 !memcmp(f->addressFamily->data, key, keylen))
530 if ((f = IPAddressFamily_new()) == NULL)
532 if (f->ipAddressChoice == NULL &&
533 (f->ipAddressChoice = IPAddressChoice_new()) == NULL)
535 if (f->addressFamily == NULL &&
536 (f->addressFamily = ASN1_OCTET_STRING_new()) == NULL)
538 if (!ASN1_OCTET_STRING_set(f->addressFamily, key, keylen))
540 if (!sk_IPAddressFamily_push(addr, f))
546 IPAddressFamily_free(f);
551 * Add an inheritance element.
553 int v3_addr_add_inherit(IPAddrBlocks *addr,
555 const unsigned *safi)
557 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
559 f->ipAddressChoice == NULL ||
560 (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
561 f->ipAddressChoice->u.addressesOrRanges != NULL))
563 if (f->ipAddressChoice->type == IPAddressChoice_inherit &&
564 f->ipAddressChoice->u.inherit != NULL)
566 if (f->ipAddressChoice->u.inherit == NULL &&
567 (f->ipAddressChoice->u.inherit = ASN1_NULL_new()) == NULL)
569 f->ipAddressChoice->type = IPAddressChoice_inherit;
574 * Construct an IPAddressOrRange sequence, or return an existing one.
576 static IPAddressOrRanges *make_prefix_or_range(IPAddrBlocks *addr,
578 const unsigned *safi)
580 IPAddressFamily *f = make_IPAddressFamily(addr, afi, safi);
581 IPAddressOrRanges *aors = NULL;
584 f->ipAddressChoice == NULL ||
585 (f->ipAddressChoice->type == IPAddressChoice_inherit &&
586 f->ipAddressChoice->u.inherit != NULL))
588 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges)
589 aors = f->ipAddressChoice->u.addressesOrRanges;
592 if ((aors = sk_IPAddressOrRange_new_null()) == NULL)
596 sk_IPAddressOrRange_set_cmp_func(aors, v4IPAddressOrRange_cmp);
599 sk_IPAddressOrRange_set_cmp_func(aors, v6IPAddressOrRange_cmp);
602 f->ipAddressChoice->type = IPAddressChoice_addressesOrRanges;
603 f->ipAddressChoice->u.addressesOrRanges = aors;
610 int v3_addr_add_prefix(IPAddrBlocks *addr,
612 const unsigned *safi,
616 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
617 IPAddressOrRange *aor;
618 if (aors == NULL || !make_addressPrefix(&aor, a, prefixlen))
620 if (sk_IPAddressOrRange_push(aors, aor))
622 IPAddressOrRange_free(aor);
629 int v3_addr_add_range(IPAddrBlocks *addr,
631 const unsigned *safi,
635 IPAddressOrRanges *aors = make_prefix_or_range(addr, afi, safi);
636 IPAddressOrRange *aor;
637 int length = length_from_afi(afi);
640 if (!make_addressRange(&aor, min, max, length))
642 if (sk_IPAddressOrRange_push(aors, aor))
644 IPAddressOrRange_free(aor);
649 * Extract min and max values from an IPAddressOrRange.
651 static void extract_min_max(IPAddressOrRange *aor,
656 assert(aor != NULL && min != NULL && max != NULL);
658 case IPAddressOrRange_addressPrefix:
659 addr_expand(min, aor->u.addressPrefix, length, 0x00);
660 addr_expand(max, aor->u.addressPrefix, length, 0xFF);
662 case IPAddressOrRange_addressRange:
663 addr_expand(min, aor->u.addressRange->min, length, 0x00);
664 addr_expand(max, aor->u.addressRange->max, length, 0xFF);
670 * Public wrapper for extract_min_max().
672 int v3_addr_get_range(IPAddressOrRange *aor,
678 int afi_length = length_from_afi(afi);
679 if (aor == NULL || min == NULL || max == NULL ||
680 afi_length == 0 || length < afi_length ||
681 (aor->type != IPAddressOrRange_addressPrefix &&
682 aor->type != IPAddressOrRange_addressRange))
684 extract_min_max(aor, min, max, afi_length);
689 * Sort comparision function for a sequence of IPAddressFamily.
691 * The last paragraph of RFC 3779 2.2.3.3 is slightly ambiguous about
692 * the ordering: I can read it as meaning that IPv6 without a SAFI
693 * comes before IPv4 with a SAFI, which seems pretty weird. The
694 * examples in appendix B suggest that the author intended the
695 * null-SAFI rule to apply only within a single AFI, which is what I
696 * would have expected and is what the following code implements.
698 static int IPAddressFamily_cmp(const IPAddressFamily * const *a_,
699 const IPAddressFamily * const *b_)
701 const ASN1_OCTET_STRING *a = (*a_)->addressFamily;
702 const ASN1_OCTET_STRING *b = (*b_)->addressFamily;
703 int len = ((a->length <= b->length) ? a->length : b->length);
704 int cmp = memcmp(a->data, b->data, len);
705 return cmp ? cmp : a->length - b->length;
709 * Check whether an IPAddrBLocks is in canonical form.
711 int v3_addr_is_canonical(IPAddrBlocks *addr)
713 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
714 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
715 IPAddressOrRanges *aors;
719 * Empty extension is cannonical.
725 * Check whether the top-level list is in order.
727 for (i = 0; i < sk_IPAddressFamily_num(addr) - 1; i++) {
728 const IPAddressFamily *a = sk_IPAddressFamily_value(addr, i);
729 const IPAddressFamily *b = sk_IPAddressFamily_value(addr, i + 1);
730 if (IPAddressFamily_cmp(&a, &b) >= 0)
735 * Top level's ok, now check each address family.
737 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
738 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
739 int length = length_from_afi(v3_addr_get_afi(f));
742 * Inheritance is canonical. Anything other than inheritance or
743 * a SEQUENCE OF IPAddressOrRange is an ASN.1 error or something.
745 if (f == NULL || f->ipAddressChoice == NULL)
747 switch (f->ipAddressChoice->type) {
748 case IPAddressChoice_inherit:
750 case IPAddressChoice_addressesOrRanges:
757 * It's an IPAddressOrRanges sequence, check it.
759 aors = f->ipAddressChoice->u.addressesOrRanges;
760 if (sk_IPAddressOrRange_num(aors) == 0)
762 for (j = 0; j < sk_IPAddressOrRange_num(aors) - 1; j++) {
763 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
764 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, j + 1);
766 extract_min_max(a, a_min, a_max, length);
767 extract_min_max(b, b_min, b_max, length);
770 * Punt misordered list, overlapping start, or inverted range.
772 if (memcmp(a_min, b_min, length) >= 0 ||
773 memcmp(a_min, a_max, length) > 0 ||
774 memcmp(b_min, b_max, length) > 0)
778 * Punt if adjacent or overlapping. Check for adjacency by
779 * subtracting one from b_min first.
781 for (k = length - 1; k >= 0 && b_min[k]-- == 0x00; k--)
783 if (memcmp(a_max, b_min, length) >= 0)
787 * Check for range that should be expressed as a prefix.
789 if (a->type == IPAddressOrRange_addressRange &&
790 range_should_be_prefix(a_min, a_max, length) >= 0)
795 * Check final range to see if it should be a prefix.
797 j = sk_IPAddressOrRange_num(aors) - 1;
799 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, j);
800 if (a->type == IPAddressOrRange_addressRange) {
801 extract_min_max(a, a_min, a_max, length);
802 if (range_should_be_prefix(a_min, a_max, length) >= 0)
809 * If we made it through all that, we're happy.
815 * Whack an IPAddressOrRanges into canonical form.
817 static int IPAddressOrRanges_canonize(IPAddressOrRanges *aors,
820 int i, j, length = length_from_afi(afi);
823 * Sort the IPAddressOrRanges sequence.
825 sk_IPAddressOrRange_sort(aors);
828 * Clean up representation issues, punt on duplicates or overlaps.
830 for (i = 0; i < sk_IPAddressOrRange_num(aors) - 1; i++) {
831 IPAddressOrRange *a = sk_IPAddressOrRange_value(aors, i);
832 IPAddressOrRange *b = sk_IPAddressOrRange_value(aors, i + 1);
833 unsigned char a_min[ADDR_RAW_BUF_LEN], a_max[ADDR_RAW_BUF_LEN];
834 unsigned char b_min[ADDR_RAW_BUF_LEN], b_max[ADDR_RAW_BUF_LEN];
836 extract_min_max(a, a_min, a_max, length);
837 extract_min_max(b, b_min, b_max, length);
842 if (memcmp(a_max, b_min, length) >= 0)
846 * Merge if a and b are adjacent. We check for
847 * adjacency by subtracting one from b_min first.
849 for (j = length - 1; j >= 0 && b_min[j]-- == 0x00; j--)
851 if (memcmp(a_max, b_min, length) == 0) {
852 IPAddressOrRange *merged;
853 if (!make_addressRange(&merged, a_min, b_max, length))
855 sk_IPAddressOrRange_set(aors, i, merged);
856 sk_IPAddressOrRange_delete(aors, i + 1);
857 IPAddressOrRange_free(a);
858 IPAddressOrRange_free(b);
868 * Whack an IPAddrBlocks extension into canonical form.
870 int v3_addr_canonize(IPAddrBlocks *addr)
873 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
874 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
875 if (f->ipAddressChoice->type == IPAddressChoice_addressesOrRanges &&
876 !IPAddressOrRanges_canonize(f->ipAddressChoice->u.addressesOrRanges,
880 sk_IPAddressFamily_sort(addr);
881 assert(v3_addr_is_canonical(addr));
886 * v2i handler for the IPAddrBlocks extension.
888 static void *v2i_IPAddrBlocks(struct v3_ext_method *method,
889 struct v3_ext_ctx *ctx,
890 STACK_OF(CONF_VALUE) *values)
892 static const char v4addr_chars[] = "0123456789.";
893 static const char v6addr_chars[] = "0123456789.:abcdefABCDEF";
894 IPAddrBlocks *addr = NULL;
898 if ((addr = sk_IPAddressFamily_new(IPAddressFamily_cmp)) == NULL) {
899 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
903 for (i = 0; i < sk_CONF_VALUE_num(values); i++) {
904 CONF_VALUE *val = sk_CONF_VALUE_value(values, i);
905 unsigned char min[ADDR_RAW_BUF_LEN], max[ADDR_RAW_BUF_LEN];
906 unsigned afi, *safi = NULL, safi_;
907 const char *addr_chars;
908 int prefixlen, i1, i2, delim, length;
910 if ( !name_cmp(val->name, "IPv4")) {
912 } else if (!name_cmp(val->name, "IPv6")) {
914 } else if (!name_cmp(val->name, "IPv4-SAFI")) {
917 } else if (!name_cmp(val->name, "IPv6-SAFI")) {
921 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_NAME_ERROR);
922 X509V3_conf_err(val);
928 addr_chars = v4addr_chars;
931 addr_chars = v6addr_chars;
935 length = length_from_afi(afi);
938 * Handle SAFI, if any, and BUF_strdup() so we can null-terminate
939 * the other input values.
942 *safi = strtoul(val->value, &t, 0);
943 t += strspn(t, " \t");
944 if (*safi > 0xFF || *t++ != ':') {
945 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_SAFI);
946 X509V3_conf_err(val);
949 t += strspn(t, " \t");
952 s = BUF_strdup(val->value);
955 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
960 * Check for inheritance. Not worth additional complexity to
961 * optimize this (seldom-used) case.
963 if (!strcmp(s, "inherit")) {
964 if (!v3_addr_add_inherit(addr, afi, safi)) {
965 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_INHERITANCE);
966 X509V3_conf_err(val);
974 i1 = strspn(s, addr_chars);
975 i2 = i1 + strspn(s + i1, " \t");
979 if (a2i_ipadd(min, s) != length) {
980 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_IPADDRESS);
981 X509V3_conf_err(val);
987 prefixlen = (int) strtoul(s + i2, &t, 10);
988 if (t == s + i2 || *t != '\0') {
989 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
990 X509V3_conf_err(val);
993 if (!v3_addr_add_prefix(addr, afi, safi, min, prefixlen)) {
994 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
999 i1 = i2 + strspn(s + i2, " \t");
1000 i2 = i1 + strspn(s + i1, addr_chars);
1001 if (i1 == i2 || s[i2] != '\0') {
1002 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
1003 X509V3_conf_err(val);
1006 if (a2i_ipadd(max, s + i1) != length) {
1007 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_INVALID_IPADDRESS);
1008 X509V3_conf_err(val);
1011 if (!v3_addr_add_range(addr, afi, safi, min, max)) {
1012 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1017 if (!v3_addr_add_prefix(addr, afi, safi, min, length * 8)) {
1018 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, ERR_R_MALLOC_FAILURE);
1023 X509V3err(X509V3_F_V2I_IPADDRBLOCKS, X509V3_R_EXTENSION_VALUE_ERROR);
1024 X509V3_conf_err(val);
1033 * Canonize the result, then we're done.
1035 if (!v3_addr_canonize(addr))
1041 sk_IPAddressFamily_pop_free(addr, IPAddressFamily_free);
1048 const X509V3_EXT_METHOD v3_addr = {
1049 NID_sbgp_ipAddrBlock, /* nid */
1051 ASN1_ITEM_ref(IPAddrBlocks), /* template */
1052 0, 0, 0, 0, /* old functions, ignored */
1056 v2i_IPAddrBlocks, /* v2i */
1057 i2r_IPAddrBlocks, /* i2r */
1059 NULL /* extension-specific data */
1063 * Figure out whether extension sues inheritance.
1065 int v3_addr_inherits(IPAddrBlocks *addr)
1070 for (i = 0; i < sk_IPAddressFamily_num(addr); i++) {
1071 IPAddressFamily *f = sk_IPAddressFamily_value(addr, i);
1072 if (f->ipAddressChoice->type == IPAddressChoice_inherit)
1079 * Figure out whether parent contains child.
1081 static int addr_contains(IPAddressOrRanges *parent,
1082 IPAddressOrRanges *child,
1085 unsigned char p_min[ADDR_RAW_BUF_LEN], p_max[ADDR_RAW_BUF_LEN];
1086 unsigned char c_min[ADDR_RAW_BUF_LEN], c_max[ADDR_RAW_BUF_LEN];
1089 if (child == NULL || parent == child)
1095 for (c = 0; c < sk_IPAddressOrRange_num(child); c++) {
1096 extract_min_max(sk_IPAddressOrRange_value(child, c),
1097 c_min, c_max, length);
1099 if (p >= sk_IPAddressOrRange_num(parent))
1101 extract_min_max(sk_IPAddressOrRange_value(parent, p),
1102 p_min, p_max, length);
1103 if (memcmp(p_max, c_max, length) < 0)
1105 if (memcmp(p_min, c_min, length) > 0)
1115 * Test whether a is a subset of b.
1117 int v3_addr_subset(IPAddrBlocks *a, IPAddrBlocks *b)
1120 if (a == NULL || a == b)
1122 if (b == NULL || v3_addr_inherits(a) || v3_addr_inherits(b))
1124 sk_IPAddressFamily_set_cmp_func(b, IPAddressFamily_cmp);
1125 for (i = 0; i < sk_IPAddressFamily_num(a); i++) {
1126 IPAddressFamily *fa = sk_IPAddressFamily_value(a, i);
1127 int j = sk_IPAddressFamily_find(b, fa);
1128 IPAddressFamily *fb = sk_IPAddressFamily_value(b, j);
1129 if (!addr_contains(fb->ipAddressChoice->u.addressesOrRanges,
1130 fa->ipAddressChoice->u.addressesOrRanges,
1131 length_from_afi(v3_addr_get_afi(fb))))
1138 * Validation error handling via callback.
1140 #define validation_err(_err_) \
1142 if (ctx != NULL) { \
1143 ctx->error = _err_; \
1144 ctx->error_depth = i; \
1145 ctx->current_cert = x; \
1146 ret = ctx->verify_cb(0, ctx); \
1155 * Core code for RFC 3779 2.3 path validation.
1157 static int v3_addr_validate_path_internal(X509_STORE_CTX *ctx,
1158 STACK_OF(X509) *chain,
1161 IPAddrBlocks *child = NULL;
1165 assert(chain != NULL && sk_X509_num(chain) > 0);
1166 assert(ctx != NULL || ext != NULL);
1167 assert(ctx == NULL || ctx->verify_cb != NULL);
1170 * Figure out where to start. If we don't have an extension to
1171 * check, we're done. Otherwise, check canonical form and
1172 * set up for walking up the chain.
1179 x = sk_X509_value(chain, i);
1181 if ((ext = x->rfc3779_addr) == NULL)
1184 if (!v3_addr_is_canonical(ext))
1185 validation_err(X509_V_ERR_INVALID_EXTENSION);
1186 sk_IPAddressFamily_set_cmp_func(ext, IPAddressFamily_cmp);
1187 if ((child = sk_IPAddressFamily_dup(ext)) == NULL) {
1188 X509V3err(X509V3_F_V3_ADDR_VALIDATE_PATH_INTERNAL, ERR_R_MALLOC_FAILURE);
1194 * Now walk up the chain. No cert may list resources that its
1195 * parent doesn't list.
1197 for (i++; i < sk_X509_num(chain); i++) {
1198 x = sk_X509_value(chain, i);
1200 if (!v3_addr_is_canonical(x->rfc3779_addr))
1201 validation_err(X509_V_ERR_INVALID_EXTENSION);
1202 if (x->rfc3779_addr == NULL) {
1203 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1204 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1205 if (fc->ipAddressChoice->type != IPAddressChoice_inherit) {
1206 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1212 sk_IPAddressFamily_set_cmp_func(x->rfc3779_addr, IPAddressFamily_cmp);
1213 for (j = 0; j < sk_IPAddressFamily_num(child); j++) {
1214 IPAddressFamily *fc = sk_IPAddressFamily_value(child, j);
1215 int k = sk_IPAddressFamily_find(x->rfc3779_addr, fc);
1216 IPAddressFamily *fp = sk_IPAddressFamily_value(x->rfc3779_addr, k);
1218 if (fc->ipAddressChoice->type == IPAddressChoice_addressesOrRanges) {
1219 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1224 if (fp->ipAddressChoice->type == IPAddressChoice_addressesOrRanges) {
1225 if (fc->ipAddressChoice->type == IPAddressChoice_inherit ||
1226 addr_contains(fp->ipAddressChoice->u.addressesOrRanges,
1227 fc->ipAddressChoice->u.addressesOrRanges,
1228 length_from_afi(v3_addr_get_afi(fc))))
1229 sk_IPAddressFamily_set(child, j, fp);
1231 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
1237 * 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 */