2 * Copyright 2006-2016 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the Apache License 2.0 (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
11 * Implementation of RFC 3779 section 2.2.
17 #include "internal/cryptlib.h"
18 #include <openssl/conf.h>
19 #include <openssl/asn1.h>
20 #include <openssl/asn1t.h>
21 #include <openssl/buffer.h>
22 #include <openssl/x509v3.h>
23 #include "internal/x509_int.h"
26 #ifndef OPENSSL_NO_RFC3779
29 * OpenSSL ASN.1 template translation of RFC 3779 2.2.3.
32 ASN1_SEQUENCE(IPAddressRange
) = {
33 ASN1_SIMPLE(IPAddressRange
, min
, ASN1_BIT_STRING
),
34 ASN1_SIMPLE(IPAddressRange
, max
, ASN1_BIT_STRING
)
35 } ASN1_SEQUENCE_END(IPAddressRange
)
37 ASN1_CHOICE(IPAddressOrRange
) = {
38 ASN1_SIMPLE(IPAddressOrRange
, u
.addressPrefix
, ASN1_BIT_STRING
),
39 ASN1_SIMPLE(IPAddressOrRange
, u
.addressRange
, IPAddressRange
)
40 } ASN1_CHOICE_END(IPAddressOrRange
)
42 ASN1_CHOICE(IPAddressChoice
) = {
43 ASN1_SIMPLE(IPAddressChoice
, u
.inherit
, ASN1_NULL
),
44 ASN1_SEQUENCE_OF(IPAddressChoice
, u
.addressesOrRanges
, IPAddressOrRange
)
45 } ASN1_CHOICE_END(IPAddressChoice
)
47 ASN1_SEQUENCE(IPAddressFamily
) = {
48 ASN1_SIMPLE(IPAddressFamily
, addressFamily
, ASN1_OCTET_STRING
),
49 ASN1_SIMPLE(IPAddressFamily
, ipAddressChoice
, IPAddressChoice
)
50 } ASN1_SEQUENCE_END(IPAddressFamily
)
52 ASN1_ITEM_TEMPLATE(IPAddrBlocks
) =
53 ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF
, 0,
54 IPAddrBlocks
, IPAddressFamily
)
55 static_ASN1_ITEM_TEMPLATE_END(IPAddrBlocks
)
57 IMPLEMENT_ASN1_FUNCTIONS(IPAddressRange
)
58 IMPLEMENT_ASN1_FUNCTIONS(IPAddressOrRange
)
59 IMPLEMENT_ASN1_FUNCTIONS(IPAddressChoice
)
60 IMPLEMENT_ASN1_FUNCTIONS(IPAddressFamily
)
63 * How much buffer space do we need for a raw address?
65 #define ADDR_RAW_BUF_LEN 16
68 * What's the address length associated with this AFI?
70 static int length_from_afi(const unsigned afi
)
83 * Extract the AFI from an IPAddressFamily.
85 unsigned int X509v3_addr_get_afi(const IPAddressFamily
*f
)
88 || f
->addressFamily
== NULL
89 || f
->addressFamily
->data
== NULL
90 || f
->addressFamily
->length
< 2)
92 return (f
->addressFamily
->data
[0] << 8) | f
->addressFamily
->data
[1];
96 * Expand the bitstring form of an address into a raw byte array.
97 * At the moment this is coded for simplicity, not speed.
99 static int addr_expand(unsigned char *addr
,
100 const ASN1_BIT_STRING
*bs
,
101 const int length
, const unsigned char fill
)
103 if (bs
->length
< 0 || bs
->length
> length
)
105 if (bs
->length
> 0) {
106 memcpy(addr
, bs
->data
, bs
->length
);
107 if ((bs
->flags
& 7) != 0) {
108 unsigned char mask
= 0xFF >> (8 - (bs
->flags
& 7));
110 addr
[bs
->length
- 1] &= ~mask
;
112 addr
[bs
->length
- 1] |= mask
;
115 memset(addr
+ bs
->length
, fill
, length
- bs
->length
);
120 * Extract the prefix length from a bitstring.
122 #define addr_prefixlen(bs) ((int) ((bs)->length * 8 - ((bs)->flags & 7)))
125 * i2r handler for one address bitstring.
127 static int i2r_address(BIO
*out
,
129 const unsigned char fill
, const ASN1_BIT_STRING
*bs
)
131 unsigned char addr
[ADDR_RAW_BUF_LEN
];
138 if (!addr_expand(addr
, bs
, 4, fill
))
140 BIO_printf(out
, "%d.%d.%d.%d", addr
[0], addr
[1], addr
[2], addr
[3]);
143 if (!addr_expand(addr
, bs
, 16, fill
))
145 for (n
= 16; n
> 1 && addr
[n
- 1] == 0x00 && addr
[n
- 2] == 0x00;
147 for (i
= 0; i
< n
; i
+= 2)
148 BIO_printf(out
, "%x%s", (addr
[i
] << 8) | addr
[i
+ 1],
149 (i
< 14 ? ":" : ""));
156 for (i
= 0; i
< bs
->length
; i
++)
157 BIO_printf(out
, "%s%02x", (i
> 0 ? ":" : ""), bs
->data
[i
]);
158 BIO_printf(out
, "[%d]", (int)(bs
->flags
& 7));
165 * i2r handler for a sequence of addresses and ranges.
167 static int i2r_IPAddressOrRanges(BIO
*out
,
169 const IPAddressOrRanges
*aors
,
173 for (i
= 0; i
< sk_IPAddressOrRange_num(aors
); i
++) {
174 const IPAddressOrRange
*aor
= sk_IPAddressOrRange_value(aors
, i
);
175 BIO_printf(out
, "%*s", indent
, "");
177 case IPAddressOrRange_addressPrefix
:
178 if (!i2r_address(out
, afi
, 0x00, aor
->u
.addressPrefix
))
180 BIO_printf(out
, "/%d\n", addr_prefixlen(aor
->u
.addressPrefix
));
182 case IPAddressOrRange_addressRange
:
183 if (!i2r_address(out
, afi
, 0x00, aor
->u
.addressRange
->min
))
186 if (!i2r_address(out
, afi
, 0xFF, aor
->u
.addressRange
->max
))
196 * i2r handler for an IPAddrBlocks extension.
198 static int i2r_IPAddrBlocks(const X509V3_EXT_METHOD
*method
,
199 void *ext
, BIO
*out
, int indent
)
201 const IPAddrBlocks
*addr
= ext
;
203 for (i
= 0; i
< sk_IPAddressFamily_num(addr
); i
++) {
204 IPAddressFamily
*f
= sk_IPAddressFamily_value(addr
, i
);
205 const unsigned int afi
= X509v3_addr_get_afi(f
);
208 BIO_printf(out
, "%*sIPv4", indent
, "");
211 BIO_printf(out
, "%*sIPv6", indent
, "");
214 BIO_printf(out
, "%*sUnknown AFI %u", indent
, "", afi
);
217 if (f
->addressFamily
->length
> 2) {
218 switch (f
->addressFamily
->data
[2]) {
220 BIO_puts(out
, " (Unicast)");
223 BIO_puts(out
, " (Multicast)");
226 BIO_puts(out
, " (Unicast/Multicast)");
229 BIO_puts(out
, " (MPLS)");
232 BIO_puts(out
, " (Tunnel)");
235 BIO_puts(out
, " (VPLS)");
238 BIO_puts(out
, " (BGP MDT)");
241 BIO_puts(out
, " (MPLS-labeled VPN)");
244 BIO_printf(out
, " (Unknown SAFI %u)",
245 (unsigned)f
->addressFamily
->data
[2]);
249 switch (f
->ipAddressChoice
->type
) {
250 case IPAddressChoice_inherit
:
251 BIO_puts(out
, ": inherit\n");
253 case IPAddressChoice_addressesOrRanges
:
254 BIO_puts(out
, ":\n");
255 if (!i2r_IPAddressOrRanges(out
,
258 u
.addressesOrRanges
, afi
))
267 * Sort comparison function for a sequence of IPAddressOrRange
270 * There's no sane answer we can give if addr_expand() fails, and an
271 * assertion failure on externally supplied data is seriously uncool,
272 * so we just arbitrarily declare that if given invalid inputs this
273 * function returns -1. If this messes up your preferred sort order
274 * for garbage input, tough noogies.
276 static int IPAddressOrRange_cmp(const IPAddressOrRange
*a
,
277 const IPAddressOrRange
*b
, const int length
)
279 unsigned char addr_a
[ADDR_RAW_BUF_LEN
], addr_b
[ADDR_RAW_BUF_LEN
];
280 int prefixlen_a
= 0, prefixlen_b
= 0;
284 case IPAddressOrRange_addressPrefix
:
285 if (!addr_expand(addr_a
, a
->u
.addressPrefix
, length
, 0x00))
287 prefixlen_a
= addr_prefixlen(a
->u
.addressPrefix
);
289 case IPAddressOrRange_addressRange
:
290 if (!addr_expand(addr_a
, a
->u
.addressRange
->min
, length
, 0x00))
292 prefixlen_a
= length
* 8;
297 case IPAddressOrRange_addressPrefix
:
298 if (!addr_expand(addr_b
, b
->u
.addressPrefix
, length
, 0x00))
300 prefixlen_b
= addr_prefixlen(b
->u
.addressPrefix
);
302 case IPAddressOrRange_addressRange
:
303 if (!addr_expand(addr_b
, b
->u
.addressRange
->min
, length
, 0x00))
305 prefixlen_b
= length
* 8;
309 if ((r
= memcmp(addr_a
, addr_b
, length
)) != 0)
312 return prefixlen_a
- prefixlen_b
;
316 * IPv4-specific closure over IPAddressOrRange_cmp, since sk_sort()
317 * comparison routines are only allowed two arguments.
319 static int v4IPAddressOrRange_cmp(const IPAddressOrRange
*const *a
,
320 const IPAddressOrRange
*const *b
)
322 return IPAddressOrRange_cmp(*a
, *b
, 4);
326 * IPv6-specific closure over IPAddressOrRange_cmp, since sk_sort()
327 * comparison routines are only allowed two arguments.
329 static int v6IPAddressOrRange_cmp(const IPAddressOrRange
*const *a
,
330 const IPAddressOrRange
*const *b
)
332 return IPAddressOrRange_cmp(*a
, *b
, 16);
336 * Calculate whether a range collapses to a prefix.
337 * See last paragraph of RFC 3779 2.2.3.7.
339 static int range_should_be_prefix(const unsigned char *min
,
340 const unsigned char *max
, const int length
)
345 if (memcmp(min
, max
, length
) <= 0)
347 for (i
= 0; i
< length
&& min
[i
] == max
[i
]; i
++) ;
348 for (j
= length
- 1; j
>= 0 && min
[j
] == 0x00 && max
[j
] == 0xFF; j
--) ;
353 mask
= min
[i
] ^ max
[i
];
379 if ((min
[i
] & mask
) != 0 || (max
[i
] & mask
) != mask
)
386 * Construct a prefix.
388 static int make_addressPrefix(IPAddressOrRange
**result
,
389 unsigned char *addr
, const int prefixlen
)
391 int bytelen
= (prefixlen
+ 7) / 8, bitlen
= prefixlen
% 8;
392 IPAddressOrRange
*aor
= IPAddressOrRange_new();
396 aor
->type
= IPAddressOrRange_addressPrefix
;
397 if (aor
->u
.addressPrefix
== NULL
&&
398 (aor
->u
.addressPrefix
= ASN1_BIT_STRING_new()) == NULL
)
400 if (!ASN1_BIT_STRING_set(aor
->u
.addressPrefix
, addr
, bytelen
))
402 aor
->u
.addressPrefix
->flags
&= ~7;
403 aor
->u
.addressPrefix
->flags
|= ASN1_STRING_FLAG_BITS_LEFT
;
405 aor
->u
.addressPrefix
->data
[bytelen
- 1] &= ~(0xFF >> bitlen
);
406 aor
->u
.addressPrefix
->flags
|= 8 - bitlen
;
413 IPAddressOrRange_free(aor
);
418 * Construct a range. If it can be expressed as a prefix,
419 * return a prefix instead. Doing this here simplifies
420 * the rest of the code considerably.
422 static int make_addressRange(IPAddressOrRange
**result
,
424 unsigned char *max
, const int length
)
426 IPAddressOrRange
*aor
;
429 if ((prefixlen
= range_should_be_prefix(min
, max
, length
)) >= 0)
430 return make_addressPrefix(result
, min
, prefixlen
);
432 if ((aor
= IPAddressOrRange_new()) == NULL
)
434 aor
->type
= IPAddressOrRange_addressRange
;
435 if ((aor
->u
.addressRange
= IPAddressRange_new()) == NULL
)
437 if (aor
->u
.addressRange
->min
== NULL
&&
438 (aor
->u
.addressRange
->min
= ASN1_BIT_STRING_new()) == NULL
)
440 if (aor
->u
.addressRange
->max
== NULL
&&
441 (aor
->u
.addressRange
->max
= ASN1_BIT_STRING_new()) == NULL
)
444 for (i
= length
; i
> 0 && min
[i
- 1] == 0x00; --i
) ;
445 if (!ASN1_BIT_STRING_set(aor
->u
.addressRange
->min
, min
, i
))
447 aor
->u
.addressRange
->min
->flags
&= ~7;
448 aor
->u
.addressRange
->min
->flags
|= ASN1_STRING_FLAG_BITS_LEFT
;
450 unsigned char b
= min
[i
- 1];
452 while ((b
& (0xFFU
>> j
)) != 0)
454 aor
->u
.addressRange
->min
->flags
|= 8 - j
;
457 for (i
= length
; i
> 0 && max
[i
- 1] == 0xFF; --i
) ;
458 if (!ASN1_BIT_STRING_set(aor
->u
.addressRange
->max
, max
, i
))
460 aor
->u
.addressRange
->max
->flags
&= ~7;
461 aor
->u
.addressRange
->max
->flags
|= ASN1_STRING_FLAG_BITS_LEFT
;
463 unsigned char b
= max
[i
- 1];
465 while ((b
& (0xFFU
>> j
)) != (0xFFU
>> j
))
467 aor
->u
.addressRange
->max
->flags
|= 8 - j
;
474 IPAddressOrRange_free(aor
);
479 * Construct a new address family or find an existing one.
481 static IPAddressFamily
*make_IPAddressFamily(IPAddrBlocks
*addr
,
483 const unsigned *safi
)
486 unsigned char key
[3];
490 key
[0] = (afi
>> 8) & 0xFF;
493 key
[2] = *safi
& 0xFF;
499 for (i
= 0; i
< sk_IPAddressFamily_num(addr
); i
++) {
500 f
= sk_IPAddressFamily_value(addr
, i
);
501 if (f
->addressFamily
->length
== keylen
&&
502 !memcmp(f
->addressFamily
->data
, key
, keylen
))
506 if ((f
= IPAddressFamily_new()) == NULL
)
508 if (f
->ipAddressChoice
== NULL
&&
509 (f
->ipAddressChoice
= IPAddressChoice_new()) == NULL
)
511 if (f
->addressFamily
== NULL
&&
512 (f
->addressFamily
= ASN1_OCTET_STRING_new()) == NULL
)
514 if (!ASN1_OCTET_STRING_set(f
->addressFamily
, key
, keylen
))
516 if (!sk_IPAddressFamily_push(addr
, f
))
522 IPAddressFamily_free(f
);
527 * Add an inheritance element.
529 int X509v3_addr_add_inherit(IPAddrBlocks
*addr
,
530 const unsigned afi
, const unsigned *safi
)
532 IPAddressFamily
*f
= make_IPAddressFamily(addr
, afi
, safi
);
534 f
->ipAddressChoice
== NULL
||
535 (f
->ipAddressChoice
->type
== IPAddressChoice_addressesOrRanges
&&
536 f
->ipAddressChoice
->u
.addressesOrRanges
!= NULL
))
538 if (f
->ipAddressChoice
->type
== IPAddressChoice_inherit
&&
539 f
->ipAddressChoice
->u
.inherit
!= NULL
)
541 if (f
->ipAddressChoice
->u
.inherit
== NULL
&&
542 (f
->ipAddressChoice
->u
.inherit
= ASN1_NULL_new()) == NULL
)
544 f
->ipAddressChoice
->type
= IPAddressChoice_inherit
;
549 * Construct an IPAddressOrRange sequence, or return an existing one.
551 static IPAddressOrRanges
*make_prefix_or_range(IPAddrBlocks
*addr
,
553 const unsigned *safi
)
555 IPAddressFamily
*f
= make_IPAddressFamily(addr
, afi
, safi
);
556 IPAddressOrRanges
*aors
= NULL
;
559 f
->ipAddressChoice
== NULL
||
560 (f
->ipAddressChoice
->type
== IPAddressChoice_inherit
&&
561 f
->ipAddressChoice
->u
.inherit
!= NULL
))
563 if (f
->ipAddressChoice
->type
== IPAddressChoice_addressesOrRanges
)
564 aors
= f
->ipAddressChoice
->u
.addressesOrRanges
;
567 if ((aors
= sk_IPAddressOrRange_new_null()) == NULL
)
571 (void)sk_IPAddressOrRange_set_cmp_func(aors
, v4IPAddressOrRange_cmp
);
574 (void)sk_IPAddressOrRange_set_cmp_func(aors
, v6IPAddressOrRange_cmp
);
577 f
->ipAddressChoice
->type
= IPAddressChoice_addressesOrRanges
;
578 f
->ipAddressChoice
->u
.addressesOrRanges
= aors
;
585 int X509v3_addr_add_prefix(IPAddrBlocks
*addr
,
587 const unsigned *safi
,
588 unsigned char *a
, const int prefixlen
)
590 IPAddressOrRanges
*aors
= make_prefix_or_range(addr
, afi
, safi
);
591 IPAddressOrRange
*aor
;
592 if (aors
== NULL
|| !make_addressPrefix(&aor
, a
, prefixlen
))
594 if (sk_IPAddressOrRange_push(aors
, aor
))
596 IPAddressOrRange_free(aor
);
603 int X509v3_addr_add_range(IPAddrBlocks
*addr
,
605 const unsigned *safi
,
606 unsigned char *min
, unsigned char *max
)
608 IPAddressOrRanges
*aors
= make_prefix_or_range(addr
, afi
, safi
);
609 IPAddressOrRange
*aor
;
610 int length
= length_from_afi(afi
);
613 if (!make_addressRange(&aor
, min
, max
, length
))
615 if (sk_IPAddressOrRange_push(aors
, aor
))
617 IPAddressOrRange_free(aor
);
622 * Extract min and max values from an IPAddressOrRange.
624 static int extract_min_max(IPAddressOrRange
*aor
,
625 unsigned char *min
, unsigned char *max
, int length
)
627 if (aor
== NULL
|| min
== NULL
|| max
== NULL
)
630 case IPAddressOrRange_addressPrefix
:
631 return (addr_expand(min
, aor
->u
.addressPrefix
, length
, 0x00) &&
632 addr_expand(max
, aor
->u
.addressPrefix
, length
, 0xFF));
633 case IPAddressOrRange_addressRange
:
634 return (addr_expand(min
, aor
->u
.addressRange
->min
, length
, 0x00) &&
635 addr_expand(max
, aor
->u
.addressRange
->max
, length
, 0xFF));
641 * Public wrapper for extract_min_max().
643 int X509v3_addr_get_range(IPAddressOrRange
*aor
,
646 unsigned char *max
, const int length
)
648 int afi_length
= length_from_afi(afi
);
649 if (aor
== NULL
|| min
== NULL
|| max
== NULL
||
650 afi_length
== 0 || length
< afi_length
||
651 (aor
->type
!= IPAddressOrRange_addressPrefix
&&
652 aor
->type
!= IPAddressOrRange_addressRange
) ||
653 !extract_min_max(aor
, min
, max
, afi_length
))
660 * Sort comparison function for a sequence of IPAddressFamily.
662 * The last paragraph of RFC 3779 2.2.3.3 is slightly ambiguous about
663 * the ordering: I can read it as meaning that IPv6 without a SAFI
664 * comes before IPv4 with a SAFI, which seems pretty weird. The
665 * examples in appendix B suggest that the author intended the
666 * null-SAFI rule to apply only within a single AFI, which is what I
667 * would have expected and is what the following code implements.
669 static int IPAddressFamily_cmp(const IPAddressFamily
*const *a_
,
670 const IPAddressFamily
*const *b_
)
672 const ASN1_OCTET_STRING
*a
= (*a_
)->addressFamily
;
673 const ASN1_OCTET_STRING
*b
= (*b_
)->addressFamily
;
674 int len
= ((a
->length
<= b
->length
) ? a
->length
: b
->length
);
675 int cmp
= memcmp(a
->data
, b
->data
, len
);
676 return cmp
? cmp
: a
->length
- b
->length
;
680 * Check whether an IPAddrBLocks is in canonical form.
682 int X509v3_addr_is_canonical(IPAddrBlocks
*addr
)
684 unsigned char a_min
[ADDR_RAW_BUF_LEN
], a_max
[ADDR_RAW_BUF_LEN
];
685 unsigned char b_min
[ADDR_RAW_BUF_LEN
], b_max
[ADDR_RAW_BUF_LEN
];
686 IPAddressOrRanges
*aors
;
690 * Empty extension is canonical.
696 * Check whether the top-level list is in order.
698 for (i
= 0; i
< sk_IPAddressFamily_num(addr
) - 1; i
++) {
699 const IPAddressFamily
*a
= sk_IPAddressFamily_value(addr
, i
);
700 const IPAddressFamily
*b
= sk_IPAddressFamily_value(addr
, i
+ 1);
701 if (IPAddressFamily_cmp(&a
, &b
) >= 0)
706 * Top level's ok, now check each address family.
708 for (i
= 0; i
< sk_IPAddressFamily_num(addr
); i
++) {
709 IPAddressFamily
*f
= sk_IPAddressFamily_value(addr
, i
);
710 int length
= length_from_afi(X509v3_addr_get_afi(f
));
713 * Inheritance is canonical. Anything other than inheritance or
714 * a SEQUENCE OF IPAddressOrRange is an ASN.1 error or something.
716 if (f
== NULL
|| f
->ipAddressChoice
== NULL
)
718 switch (f
->ipAddressChoice
->type
) {
719 case IPAddressChoice_inherit
:
721 case IPAddressChoice_addressesOrRanges
:
728 * It's an IPAddressOrRanges sequence, check it.
730 aors
= f
->ipAddressChoice
->u
.addressesOrRanges
;
731 if (sk_IPAddressOrRange_num(aors
) == 0)
733 for (j
= 0; j
< sk_IPAddressOrRange_num(aors
) - 1; j
++) {
734 IPAddressOrRange
*a
= sk_IPAddressOrRange_value(aors
, j
);
735 IPAddressOrRange
*b
= sk_IPAddressOrRange_value(aors
, j
+ 1);
737 if (!extract_min_max(a
, a_min
, a_max
, length
) ||
738 !extract_min_max(b
, b_min
, b_max
, length
))
742 * Punt misordered list, overlapping start, or inverted range.
744 if (memcmp(a_min
, b_min
, length
) >= 0 ||
745 memcmp(a_min
, a_max
, length
) > 0 ||
746 memcmp(b_min
, b_max
, length
) > 0)
750 * Punt if adjacent or overlapping. Check for adjacency by
751 * subtracting one from b_min first.
753 for (k
= length
- 1; k
>= 0 && b_min
[k
]-- == 0x00; k
--) ;
754 if (memcmp(a_max
, b_min
, length
) >= 0)
758 * Check for range that should be expressed as a prefix.
760 if (a
->type
== IPAddressOrRange_addressRange
&&
761 range_should_be_prefix(a_min
, a_max
, length
) >= 0)
766 * Check range to see if it's inverted or should be a
769 j
= sk_IPAddressOrRange_num(aors
) - 1;
771 IPAddressOrRange
*a
= sk_IPAddressOrRange_value(aors
, j
);
772 if (a
!= NULL
&& a
->type
== IPAddressOrRange_addressRange
) {
773 if (!extract_min_max(a
, a_min
, a_max
, length
))
775 if (memcmp(a_min
, a_max
, length
) > 0 ||
776 range_should_be_prefix(a_min
, a_max
, length
) >= 0)
783 * If we made it through all that, we're happy.
789 * Whack an IPAddressOrRanges into canonical form.
791 static int IPAddressOrRanges_canonize(IPAddressOrRanges
*aors
,
794 int i
, j
, length
= length_from_afi(afi
);
797 * Sort the IPAddressOrRanges sequence.
799 sk_IPAddressOrRange_sort(aors
);
802 * Clean up representation issues, punt on duplicates or overlaps.
804 for (i
= 0; i
< sk_IPAddressOrRange_num(aors
) - 1; i
++) {
805 IPAddressOrRange
*a
= sk_IPAddressOrRange_value(aors
, i
);
806 IPAddressOrRange
*b
= sk_IPAddressOrRange_value(aors
, i
+ 1);
807 unsigned char a_min
[ADDR_RAW_BUF_LEN
], a_max
[ADDR_RAW_BUF_LEN
];
808 unsigned char b_min
[ADDR_RAW_BUF_LEN
], b_max
[ADDR_RAW_BUF_LEN
];
810 if (!extract_min_max(a
, a_min
, a_max
, length
) ||
811 !extract_min_max(b
, b_min
, b_max
, length
))
815 * Punt inverted ranges.
817 if (memcmp(a_min
, a_max
, length
) > 0 ||
818 memcmp(b_min
, b_max
, length
) > 0)
824 if (memcmp(a_max
, b_min
, length
) >= 0)
828 * Merge if a and b are adjacent. We check for
829 * adjacency by subtracting one from b_min first.
831 for (j
= length
- 1; j
>= 0 && b_min
[j
]-- == 0x00; j
--) ;
832 if (memcmp(a_max
, b_min
, length
) == 0) {
833 IPAddressOrRange
*merged
;
834 if (!make_addressRange(&merged
, a_min
, b_max
, length
))
836 (void)sk_IPAddressOrRange_set(aors
, i
, merged
);
837 (void)sk_IPAddressOrRange_delete(aors
, i
+ 1);
838 IPAddressOrRange_free(a
);
839 IPAddressOrRange_free(b
);
846 * Check for inverted final range.
848 j
= sk_IPAddressOrRange_num(aors
) - 1;
850 IPAddressOrRange
*a
= sk_IPAddressOrRange_value(aors
, j
);
851 if (a
!= NULL
&& a
->type
== IPAddressOrRange_addressRange
) {
852 unsigned char a_min
[ADDR_RAW_BUF_LEN
], a_max
[ADDR_RAW_BUF_LEN
];
853 if (!extract_min_max(a
, a_min
, a_max
, length
))
855 if (memcmp(a_min
, a_max
, length
) > 0)
864 * Whack an IPAddrBlocks extension into canonical form.
866 int X509v3_addr_canonize(IPAddrBlocks
*addr
)
869 for (i
= 0; i
< sk_IPAddressFamily_num(addr
); i
++) {
870 IPAddressFamily
*f
= sk_IPAddressFamily_value(addr
, i
);
871 if (f
->ipAddressChoice
->type
== IPAddressChoice_addressesOrRanges
&&
872 !IPAddressOrRanges_canonize(f
->ipAddressChoice
->
874 X509v3_addr_get_afi(f
)))
877 (void)sk_IPAddressFamily_set_cmp_func(addr
, IPAddressFamily_cmp
);
878 sk_IPAddressFamily_sort(addr
);
879 if (!ossl_assert(X509v3_addr_is_canonical(addr
)))
885 * v2i handler for the IPAddrBlocks extension.
887 static void *v2i_IPAddrBlocks(const struct v3_ext_method
*method
,
888 struct v3_ext_ctx
*ctx
,
889 STACK_OF(CONF_VALUE
) *values
)
891 static const char v4addr_chars
[] = "0123456789.";
892 static const char v6addr_chars
[] = "0123456789.:abcdefABCDEF";
893 IPAddrBlocks
*addr
= NULL
;
897 if ((addr
= sk_IPAddressFamily_new(IPAddressFamily_cmp
)) == NULL
) {
898 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
, ERR_R_MALLOC_FAILURE
);
902 for (i
= 0; i
< sk_CONF_VALUE_num(values
); i
++) {
903 CONF_VALUE
*val
= sk_CONF_VALUE_value(values
, i
);
904 unsigned char min
[ADDR_RAW_BUF_LEN
], max
[ADDR_RAW_BUF_LEN
];
905 unsigned afi
, *safi
= NULL
, safi_
;
906 const char *addr_chars
= NULL
;
907 int prefixlen
, i1
, i2
, delim
, length
;
909 if (!name_cmp(val
->name
, "IPv4")) {
911 } else if (!name_cmp(val
->name
, "IPv6")) {
913 } else if (!name_cmp(val
->name
, "IPv4-SAFI")) {
916 } else if (!name_cmp(val
->name
, "IPv6-SAFI")) {
920 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
,
921 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 OPENSSL_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");
950 s
= OPENSSL_strdup(t
);
952 s
= OPENSSL_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") == 0) {
964 if (!X509v3_addr_add_inherit(addr
, afi
, safi
)) {
965 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
,
966 X509V3_R_INVALID_INHERITANCE
);
967 X509V3_conf_err(val
);
975 i1
= strspn(s
, addr_chars
);
976 i2
= i1
+ strspn(s
+ i1
, " \t");
980 if (a2i_ipadd(min
, s
) != length
) {
981 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
, X509V3_R_INVALID_IPADDRESS
);
982 X509V3_conf_err(val
);
988 prefixlen
= (int)strtoul(s
+ i2
, &t
, 10);
989 if (t
== s
+ i2
|| *t
!= '\0') {
990 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
,
991 X509V3_R_EXTENSION_VALUE_ERROR
);
992 X509V3_conf_err(val
);
995 if (!X509v3_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
,
1005 X509V3_R_EXTENSION_VALUE_ERROR
);
1006 X509V3_conf_err(val
);
1009 if (a2i_ipadd(max
, s
+ i1
) != length
) {
1010 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
,
1011 X509V3_R_INVALID_IPADDRESS
);
1012 X509V3_conf_err(val
);
1015 if (memcmp(min
, max
, length_from_afi(afi
)) > 0) {
1016 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
,
1017 X509V3_R_EXTENSION_VALUE_ERROR
);
1018 X509V3_conf_err(val
);
1021 if (!X509v3_addr_add_range(addr
, afi
, safi
, min
, max
)) {
1022 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
, ERR_R_MALLOC_FAILURE
);
1027 if (!X509v3_addr_add_prefix(addr
, afi
, safi
, min
, length
* 8)) {
1028 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
, ERR_R_MALLOC_FAILURE
);
1033 X509V3err(X509V3_F_V2I_IPADDRBLOCKS
,
1034 X509V3_R_EXTENSION_VALUE_ERROR
);
1035 X509V3_conf_err(val
);
1044 * Canonize the result, then we're done.
1046 if (!X509v3_addr_canonize(addr
))
1052 sk_IPAddressFamily_pop_free(addr
, IPAddressFamily_free
);
1059 const X509V3_EXT_METHOD v3_addr
= {
1060 NID_sbgp_ipAddrBlock
, /* nid */
1062 ASN1_ITEM_ref(IPAddrBlocks
), /* template */
1063 0, 0, 0, 0, /* old functions, ignored */
1067 v2i_IPAddrBlocks
, /* v2i */
1068 i2r_IPAddrBlocks
, /* i2r */
1070 NULL
/* extension-specific data */
1074 * Figure out whether extension sues inheritance.
1076 int X509v3_addr_inherits(IPAddrBlocks
*addr
)
1081 for (i
= 0; i
< sk_IPAddressFamily_num(addr
); i
++) {
1082 IPAddressFamily
*f
= sk_IPAddressFamily_value(addr
, i
);
1083 if (f
->ipAddressChoice
->type
== IPAddressChoice_inherit
)
1090 * Figure out whether parent contains child.
1092 static int addr_contains(IPAddressOrRanges
*parent
,
1093 IPAddressOrRanges
*child
, int length
)
1095 unsigned char p_min
[ADDR_RAW_BUF_LEN
], p_max
[ADDR_RAW_BUF_LEN
];
1096 unsigned char c_min
[ADDR_RAW_BUF_LEN
], c_max
[ADDR_RAW_BUF_LEN
];
1099 if (child
== NULL
|| parent
== child
)
1105 for (c
= 0; c
< sk_IPAddressOrRange_num(child
); c
++) {
1106 if (!extract_min_max(sk_IPAddressOrRange_value(child
, c
),
1107 c_min
, c_max
, length
))
1110 if (p
>= sk_IPAddressOrRange_num(parent
))
1112 if (!extract_min_max(sk_IPAddressOrRange_value(parent
, p
),
1113 p_min
, p_max
, length
))
1115 if (memcmp(p_max
, c_max
, length
) < 0)
1117 if (memcmp(p_min
, c_min
, length
) > 0)
1127 * Test whether a is a subset of b.
1129 int X509v3_addr_subset(IPAddrBlocks
*a
, IPAddrBlocks
*b
)
1132 if (a
== NULL
|| a
== b
)
1134 if (b
== NULL
|| X509v3_addr_inherits(a
) || X509v3_addr_inherits(b
))
1136 (void)sk_IPAddressFamily_set_cmp_func(b
, IPAddressFamily_cmp
);
1137 for (i
= 0; i
< sk_IPAddressFamily_num(a
); i
++) {
1138 IPAddressFamily
*fa
= sk_IPAddressFamily_value(a
, i
);
1139 int j
= sk_IPAddressFamily_find(b
, fa
);
1140 IPAddressFamily
*fb
;
1141 fb
= sk_IPAddressFamily_value(b
, j
);
1144 if (!addr_contains(fb
->ipAddressChoice
->u
.addressesOrRanges
,
1145 fa
->ipAddressChoice
->u
.addressesOrRanges
,
1146 length_from_afi(X509v3_addr_get_afi(fb
))))
1153 * Validation error handling via callback.
1155 #define validation_err(_err_) \
1157 if (ctx != NULL) { \
1158 ctx->error = _err_; \
1159 ctx->error_depth = i; \
1160 ctx->current_cert = x; \
1161 ret = ctx->verify_cb(0, ctx); \
1170 * Core code for RFC 3779 2.3 path validation.
1172 * Returns 1 for success, 0 on error.
1174 * When returning 0, ctx->error MUST be set to an appropriate value other than
1177 static int addr_validate_path_internal(X509_STORE_CTX
*ctx
,
1178 STACK_OF(X509
) *chain
,
1181 IPAddrBlocks
*child
= NULL
;
1185 if (!ossl_assert(chain
!= NULL
&& sk_X509_num(chain
) > 0)
1186 || !ossl_assert(ctx
!= NULL
|| ext
!= NULL
)
1187 || !ossl_assert(ctx
== NULL
|| ctx
->verify_cb
!= NULL
)) {
1189 ctx
->error
= X509_V_ERR_UNSPECIFIED
;
1194 * Figure out where to start. If we don't have an extension to
1195 * check, we're done. Otherwise, check canonical form and
1196 * set up for walking up the chain.
1203 x
= sk_X509_value(chain
, i
);
1204 if ((ext
= x
->rfc3779_addr
) == NULL
)
1207 if (!X509v3_addr_is_canonical(ext
))
1208 validation_err(X509_V_ERR_INVALID_EXTENSION
);
1209 (void)sk_IPAddressFamily_set_cmp_func(ext
, IPAddressFamily_cmp
);
1210 if ((child
= sk_IPAddressFamily_dup(ext
)) == NULL
) {
1211 X509V3err(X509V3_F_ADDR_VALIDATE_PATH_INTERNAL
,
1212 ERR_R_MALLOC_FAILURE
);
1214 ctx
->error
= X509_V_ERR_OUT_OF_MEM
;
1220 * Now walk up the chain. No cert may list resources that its
1221 * parent doesn't list.
1223 for (i
++; i
< sk_X509_num(chain
); i
++) {
1224 x
= sk_X509_value(chain
, i
);
1225 if (!X509v3_addr_is_canonical(x
->rfc3779_addr
))
1226 validation_err(X509_V_ERR_INVALID_EXTENSION
);
1227 if (x
->rfc3779_addr
== NULL
) {
1228 for (j
= 0; j
< sk_IPAddressFamily_num(child
); j
++) {
1229 IPAddressFamily
*fc
= sk_IPAddressFamily_value(child
, j
);
1230 if (fc
->ipAddressChoice
->type
!= IPAddressChoice_inherit
) {
1231 validation_err(X509_V_ERR_UNNESTED_RESOURCE
);
1237 (void)sk_IPAddressFamily_set_cmp_func(x
->rfc3779_addr
,
1238 IPAddressFamily_cmp
);
1239 for (j
= 0; j
< sk_IPAddressFamily_num(child
); j
++) {
1240 IPAddressFamily
*fc
= sk_IPAddressFamily_value(child
, j
);
1241 int k
= sk_IPAddressFamily_find(x
->rfc3779_addr
, fc
);
1242 IPAddressFamily
*fp
=
1243 sk_IPAddressFamily_value(x
->rfc3779_addr
, k
);
1245 if (fc
->ipAddressChoice
->type
==
1246 IPAddressChoice_addressesOrRanges
) {
1247 validation_err(X509_V_ERR_UNNESTED_RESOURCE
);
1252 if (fp
->ipAddressChoice
->type
==
1253 IPAddressChoice_addressesOrRanges
) {
1254 if (fc
->ipAddressChoice
->type
== IPAddressChoice_inherit
1255 || addr_contains(fp
->ipAddressChoice
->u
.addressesOrRanges
,
1256 fc
->ipAddressChoice
->u
.addressesOrRanges
,
1257 length_from_afi(X509v3_addr_get_afi(fc
))))
1258 sk_IPAddressFamily_set(child
, j
, fp
);
1260 validation_err(X509_V_ERR_UNNESTED_RESOURCE
);
1266 * Trust anchor can't inherit.
1268 if (x
->rfc3779_addr
!= NULL
) {
1269 for (j
= 0; j
< sk_IPAddressFamily_num(x
->rfc3779_addr
); j
++) {
1270 IPAddressFamily
*fp
=
1271 sk_IPAddressFamily_value(x
->rfc3779_addr
, j
);
1272 if (fp
->ipAddressChoice
->type
== IPAddressChoice_inherit
1273 && sk_IPAddressFamily_find(child
, fp
) >= 0)
1274 validation_err(X509_V_ERR_UNNESTED_RESOURCE
);
1279 sk_IPAddressFamily_free(child
);
1283 #undef validation_err
1286 * RFC 3779 2.3 path validation -- called from X509_verify_cert().
1288 int X509v3_addr_validate_path(X509_STORE_CTX
*ctx
)
1290 if (ctx
->chain
== NULL
1291 || sk_X509_num(ctx
->chain
) == 0
1292 || ctx
->verify_cb
== NULL
) {
1293 ctx
->error
= X509_V_ERR_UNSPECIFIED
;
1296 return addr_validate_path_internal(ctx
, ctx
->chain
, NULL
);
1300 * RFC 3779 2.3 path validation of an extension.
1301 * Test whether chain covers extension.
1303 int X509v3_addr_validate_resource_set(STACK_OF(X509
) *chain
,
1304 IPAddrBlocks
*ext
, int allow_inheritance
)
1308 if (chain
== NULL
|| sk_X509_num(chain
) == 0)
1310 if (!allow_inheritance
&& X509v3_addr_inherits(ext
))
1312 return addr_validate_path_internal(NULL
, chain
, ext
);
1315 #endif /* OPENSSL_NO_RFC3779 */