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 3.2.
65 #include <openssl/conf.h>
66 #include <openssl/asn1.h>
67 #include <openssl/asn1t.h>
68 #include <openssl/x509v3.h>
69 #include <openssl/x509.h>
70 #include <openssl/bn.h>
74 * OpenSSL ASN.1 template translation of RFC 3779 3.2.3.
77 ASN1_SEQUENCE(ASRange) = {
78 ASN1_SIMPLE(ASRange, min, ASN1_INTEGER),
79 ASN1_SIMPLE(ASRange, max, ASN1_INTEGER)
80 } ASN1_SEQUENCE_END(ASRange)
82 ASN1_CHOICE(ASIdOrRange) = {
83 ASN1_SIMPLE(ASIdOrRange, u.id, ASN1_INTEGER),
84 ASN1_SIMPLE(ASIdOrRange, u.range, ASRange)
85 } ASN1_CHOICE_END(ASIdOrRange)
87 ASN1_CHOICE(ASIdentifierChoice) = {
88 ASN1_SIMPLE(ASIdentifierChoice, u.inherit, ASN1_NULL),
89 ASN1_SEQUENCE_OF(ASIdentifierChoice, u.asIdsOrRanges, ASIdOrRange)
90 } ASN1_CHOICE_END(ASIdentifierChoice)
92 ASN1_SEQUENCE(ASIdentifiers) = {
93 ASN1_EXP_OPT(ASIdentifiers, asnum, ASIdentifierChoice, 0),
94 ASN1_EXP_OPT(ASIdentifiers, rdi, ASIdentifierChoice, 1)
95 } ASN1_SEQUENCE_END(ASIdentifiers)
97 IMPLEMENT_ASN1_FUNCTIONS(ASRange)
98 IMPLEMENT_ASN1_FUNCTIONS(ASIdOrRange)
99 IMPLEMENT_ASN1_FUNCTIONS(ASIdentifierChoice)
100 IMPLEMENT_ASN1_FUNCTIONS(ASIdentifiers)
103 * i2r method for an ASIdentifierChoice.
105 static int i2r_ASIdentifierChoice(BIO *out,
106 ASIdentifierChoice *choice,
107 int indent, const char *msg)
113 BIO_printf(out, "%*s%s:\n", indent, "", msg);
114 switch (choice->type) {
115 case ASIdentifierChoice_inherit:
116 BIO_printf(out, "%*sinherit\n", indent + 2, "");
118 case ASIdentifierChoice_asIdsOrRanges:
119 for (i = 0; i < sk_ASIdOrRange_num(choice->u.asIdsOrRanges); i++) {
121 sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
124 if ((s = i2s_ASN1_INTEGER(NULL, aor->u.id)) == NULL)
126 BIO_printf(out, "%*s%s\n", indent + 2, "", s);
129 case ASIdOrRange_range:
130 if ((s = i2s_ASN1_INTEGER(NULL, aor->u.range->min)) == NULL)
132 BIO_printf(out, "%*s%s-", indent + 2, "", s);
134 if ((s = i2s_ASN1_INTEGER(NULL, aor->u.range->max)) == NULL)
136 BIO_printf(out, "%s\n", s);
151 * i2r method for an ASIdentifier extension.
153 static int i2r_ASIdentifiers(const X509V3_EXT_METHOD *method,
154 void *ext, BIO *out, int indent)
156 ASIdentifiers *asid = ext;
157 return (i2r_ASIdentifierChoice(out, asid->asnum, indent,
158 "Autonomous System Numbers") &&
159 i2r_ASIdentifierChoice(out, asid->rdi, indent,
160 "Routing Domain Identifiers"));
164 * Sort comparision function for a sequence of ASIdOrRange elements.
166 static int ASIdOrRange_cmp(const ASIdOrRange *const *a_,
167 const ASIdOrRange *const *b_)
169 const ASIdOrRange *a = *a_, *b = *b_;
171 OPENSSL_assert((a->type == ASIdOrRange_id && a->u.id != NULL) ||
172 (a->type == ASIdOrRange_range && a->u.range != NULL &&
173 a->u.range->min != NULL && a->u.range->max != NULL));
175 OPENSSL_assert((b->type == ASIdOrRange_id && b->u.id != NULL) ||
176 (b->type == ASIdOrRange_range && b->u.range != NULL &&
177 b->u.range->min != NULL && b->u.range->max != NULL));
179 if (a->type == ASIdOrRange_id && b->type == ASIdOrRange_id)
180 return ASN1_INTEGER_cmp(a->u.id, b->u.id);
182 if (a->type == ASIdOrRange_range && b->type == ASIdOrRange_range) {
183 int r = ASN1_INTEGER_cmp(a->u.range->min, b->u.range->min);
184 return r != 0 ? r : ASN1_INTEGER_cmp(a->u.range->max,
188 if (a->type == ASIdOrRange_id)
189 return ASN1_INTEGER_cmp(a->u.id, b->u.range->min);
191 return ASN1_INTEGER_cmp(a->u.range->min, b->u.id);
195 * Add an inherit element.
197 int v3_asid_add_inherit(ASIdentifiers *asid, int which)
199 ASIdentifierChoice **choice;
204 choice = &asid->asnum;
212 if (*choice == NULL) {
213 if ((*choice = ASIdentifierChoice_new()) == NULL)
215 OPENSSL_assert((*choice)->u.inherit == NULL);
216 if (((*choice)->u.inherit = ASN1_NULL_new()) == NULL)
218 (*choice)->type = ASIdentifierChoice_inherit;
220 return (*choice)->type == ASIdentifierChoice_inherit;
224 * Add an ID or range to an ASIdentifierChoice.
226 int v3_asid_add_id_or_range(ASIdentifiers *asid,
227 int which, ASN1_INTEGER *min, ASN1_INTEGER *max)
229 ASIdentifierChoice **choice;
235 choice = &asid->asnum;
243 if (*choice != NULL && (*choice)->type == ASIdentifierChoice_inherit)
245 if (*choice == NULL) {
246 if ((*choice = ASIdentifierChoice_new()) == NULL)
248 OPENSSL_assert((*choice)->u.asIdsOrRanges == NULL);
249 (*choice)->u.asIdsOrRanges = sk_ASIdOrRange_new(ASIdOrRange_cmp);
250 if ((*choice)->u.asIdsOrRanges == NULL)
252 (*choice)->type = ASIdentifierChoice_asIdsOrRanges;
254 if ((aor = ASIdOrRange_new()) == NULL)
257 aor->type = ASIdOrRange_id;
260 aor->type = ASIdOrRange_range;
261 if ((aor->u.range = ASRange_new()) == NULL)
263 ASN1_INTEGER_free(aor->u.range->min);
264 aor->u.range->min = min;
265 ASN1_INTEGER_free(aor->u.range->max);
266 aor->u.range->max = max;
268 if (!(sk_ASIdOrRange_push((*choice)->u.asIdsOrRanges, aor)))
273 ASIdOrRange_free(aor);
278 * Extract min and max values from an ASIdOrRange.
280 static void extract_min_max(ASIdOrRange *aor,
281 ASN1_INTEGER **min, ASN1_INTEGER **max)
283 OPENSSL_assert(aor != NULL && min != NULL && max != NULL);
289 case ASIdOrRange_range:
290 *min = aor->u.range->min;
291 *max = aor->u.range->max;
297 * Check whether an ASIdentifierChoice is in canonical form.
299 static int ASIdentifierChoice_is_canonical(ASIdentifierChoice *choice)
301 ASN1_INTEGER *a_max_plus_one = NULL;
306 * Empty element or inheritance is canonical.
308 if (choice == NULL || choice->type == ASIdentifierChoice_inherit)
312 * If not a list, or if empty list, it's broken.
314 if (choice->type != ASIdentifierChoice_asIdsOrRanges ||
315 sk_ASIdOrRange_num(choice->u.asIdsOrRanges) == 0)
319 * It's a list, check it.
321 for (i = 0; i < sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1; i++) {
322 ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
323 ASIdOrRange *b = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i + 1);
324 ASN1_INTEGER *a_min = NULL, *a_max = NULL, *b_min = NULL, *b_max =
327 extract_min_max(a, &a_min, &a_max);
328 extract_min_max(b, &b_min, &b_max);
331 * Punt misordered list, overlapping start, or inverted range.
333 if (ASN1_INTEGER_cmp(a_min, b_min) >= 0 ||
334 ASN1_INTEGER_cmp(a_min, a_max) > 0 ||
335 ASN1_INTEGER_cmp(b_min, b_max) > 0)
339 * Calculate a_max + 1 to check for adjacency.
341 if ((bn == NULL && (bn = BN_new()) == NULL) ||
342 ASN1_INTEGER_to_BN(a_max, bn) == NULL ||
343 !BN_add_word(bn, 1) ||
345 BN_to_ASN1_INTEGER(bn, a_max_plus_one)) == NULL) {
346 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_IS_CANONICAL,
347 ERR_R_MALLOC_FAILURE);
352 * Punt if adjacent or overlapping.
354 if (ASN1_INTEGER_cmp(a_max_plus_one, b_min) >= 0)
359 * Check for inverted range.
361 i = sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1;
363 ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
364 ASN1_INTEGER *a_min, *a_max;
365 if (a != NULL && a->type == ASIdOrRange_range) {
366 extract_min_max(a, &a_min, &a_max);
367 if (ASN1_INTEGER_cmp(a_min, a_max) > 0)
375 ASN1_INTEGER_free(a_max_plus_one);
381 * Check whether an ASIdentifier extension is in canonical form.
383 int v3_asid_is_canonical(ASIdentifiers *asid)
385 return (asid == NULL ||
386 (ASIdentifierChoice_is_canonical(asid->asnum) &&
387 ASIdentifierChoice_is_canonical(asid->rdi)));
391 * Whack an ASIdentifierChoice into canonical form.
393 static int ASIdentifierChoice_canonize(ASIdentifierChoice *choice)
395 ASN1_INTEGER *a_max_plus_one = NULL;
400 * Nothing to do for empty element or inheritance.
402 if (choice == NULL || choice->type == ASIdentifierChoice_inherit)
406 * If not a list, or if empty list, it's broken.
408 if (choice->type != ASIdentifierChoice_asIdsOrRanges ||
409 sk_ASIdOrRange_num(choice->u.asIdsOrRanges) == 0) {
410 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_CANONIZE,
411 X509V3_R_EXTENSION_VALUE_ERROR);
416 * We have a non-empty list. Sort it.
418 sk_ASIdOrRange_sort(choice->u.asIdsOrRanges);
421 * Now check for errors and suboptimal encoding, rejecting the
422 * former and fixing the latter.
424 for (i = 0; i < sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1; i++) {
425 ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
426 ASIdOrRange *b = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i + 1);
427 ASN1_INTEGER *a_min = NULL, *a_max = NULL, *b_min = NULL, *b_max =
430 extract_min_max(a, &a_min, &a_max);
431 extract_min_max(b, &b_min, &b_max);
434 * Make sure we're properly sorted (paranoia).
436 OPENSSL_assert(ASN1_INTEGER_cmp(a_min, b_min) <= 0);
439 * Punt inverted ranges.
441 if (ASN1_INTEGER_cmp(a_min, a_max) > 0 ||
442 ASN1_INTEGER_cmp(b_min, b_max) > 0)
446 * Check for overlaps.
448 if (ASN1_INTEGER_cmp(a_max, b_min) >= 0) {
449 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_CANONIZE,
450 X509V3_R_EXTENSION_VALUE_ERROR);
455 * Calculate a_max + 1 to check for adjacency.
457 if ((bn == NULL && (bn = BN_new()) == NULL) ||
458 ASN1_INTEGER_to_BN(a_max, bn) == NULL ||
459 !BN_add_word(bn, 1) ||
461 BN_to_ASN1_INTEGER(bn, a_max_plus_one)) == NULL) {
462 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_CANONIZE,
463 ERR_R_MALLOC_FAILURE);
468 * If a and b are adjacent, merge them.
470 if (ASN1_INTEGER_cmp(a_max_plus_one, b_min) == 0) {
474 if ((r = OPENSSL_malloc(sizeof(*r))) == NULL) {
475 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_CANONIZE,
476 ERR_R_MALLOC_FAILURE);
481 a->type = ASIdOrRange_range;
484 case ASIdOrRange_range:
485 ASN1_INTEGER_free(a->u.range->max);
486 a->u.range->max = b_max;
493 case ASIdOrRange_range:
494 b->u.range->max = NULL;
498 (void)sk_ASIdOrRange_delete(choice->u.asIdsOrRanges, i + 1);
505 * Check for final inverted range.
507 i = sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1;
509 ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
510 ASN1_INTEGER *a_min, *a_max;
511 if (a != NULL && a->type == ASIdOrRange_range) {
512 extract_min_max(a, &a_min, &a_max);
513 if (ASN1_INTEGER_cmp(a_min, a_max) > 0)
518 OPENSSL_assert(ASIdentifierChoice_is_canonical(choice)); /* Paranoia */
523 ASN1_INTEGER_free(a_max_plus_one);
529 * Whack an ASIdentifier extension into canonical form.
531 int v3_asid_canonize(ASIdentifiers *asid)
533 return (asid == NULL ||
534 (ASIdentifierChoice_canonize(asid->asnum) &&
535 ASIdentifierChoice_canonize(asid->rdi)));
539 * v2i method for an ASIdentifier extension.
541 static void *v2i_ASIdentifiers(const struct v3_ext_method *method,
542 struct v3_ext_ctx *ctx,
543 STACK_OF(CONF_VALUE) *values)
545 ASN1_INTEGER *min = NULL, *max = NULL;
546 ASIdentifiers *asid = NULL;
549 if ((asid = ASIdentifiers_new()) == NULL) {
550 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
554 for (i = 0; i < sk_CONF_VALUE_num(values); i++) {
555 CONF_VALUE *val = sk_CONF_VALUE_value(values, i);
556 int i1 = 0, i2 = 0, i3 = 0, is_range = 0, which = 0;
559 * Figure out whether this is an AS or an RDI.
561 if (!name_cmp(val->name, "AS")) {
562 which = V3_ASID_ASNUM;
563 } else if (!name_cmp(val->name, "RDI")) {
566 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
567 X509V3_R_EXTENSION_NAME_ERROR);
568 X509V3_conf_err(val);
573 * Handle inheritance.
575 if (strcmp(val->value, "inherit") == 0) {
576 if (v3_asid_add_inherit(asid, which))
578 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
579 X509V3_R_INVALID_INHERITANCE);
580 X509V3_conf_err(val);
585 * Number, range, or mistake, pick it apart and figure out which.
587 i1 = strspn(val->value, "0123456789");
588 if (val->value[i1] == '\0') {
592 i2 = i1 + strspn(val->value + i1, " \t");
593 if (val->value[i2] != '-') {
594 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
595 X509V3_R_INVALID_ASNUMBER);
596 X509V3_conf_err(val);
600 i2 = i2 + strspn(val->value + i2, " \t");
601 i3 = i2 + strspn(val->value + i2, "0123456789");
602 if (val->value[i3] != '\0') {
603 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
604 X509V3_R_INVALID_ASRANGE);
605 X509V3_conf_err(val);
611 * Syntax is ok, read and add it.
614 if (!X509V3_get_value_int(val, &min)) {
615 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
619 char *s = BUF_strdup(val->value);
621 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
625 min = s2i_ASN1_INTEGER(NULL, s);
626 max = s2i_ASN1_INTEGER(NULL, s + i2);
628 if (min == NULL || max == NULL) {
629 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
632 if (ASN1_INTEGER_cmp(min, max) > 0) {
633 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
634 X509V3_R_EXTENSION_VALUE_ERROR);
638 if (!v3_asid_add_id_or_range(asid, which, min, max)) {
639 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
646 * Canonize the result, then we're done.
648 if (!v3_asid_canonize(asid))
653 ASIdentifiers_free(asid);
654 ASN1_INTEGER_free(min);
655 ASN1_INTEGER_free(max);
662 const X509V3_EXT_METHOD v3_asid = {
663 NID_sbgp_autonomousSysNum, /* nid */
665 ASN1_ITEM_ref(ASIdentifiers), /* template */
666 0, 0, 0, 0, /* old functions, ignored */
670 v2i_ASIdentifiers, /* v2i */
671 i2r_ASIdentifiers, /* i2r */
673 NULL /* extension-specific data */
677 * Figure out whether extension uses inheritance.
679 int v3_asid_inherits(ASIdentifiers *asid)
681 return (asid != NULL &&
682 ((asid->asnum != NULL &&
683 asid->asnum->type == ASIdentifierChoice_inherit) ||
684 (asid->rdi != NULL &&
685 asid->rdi->type == ASIdentifierChoice_inherit)));
689 * Figure out whether parent contains child.
691 static int asid_contains(ASIdOrRanges *parent, ASIdOrRanges *child)
693 ASN1_INTEGER *p_min = NULL, *p_max = NULL, *c_min = NULL, *c_max = NULL;
696 if (child == NULL || parent == child)
702 for (c = 0; c < sk_ASIdOrRange_num(child); c++) {
703 extract_min_max(sk_ASIdOrRange_value(child, c), &c_min, &c_max);
705 if (p >= sk_ASIdOrRange_num(parent))
707 extract_min_max(sk_ASIdOrRange_value(parent, p), &p_min, &p_max);
708 if (ASN1_INTEGER_cmp(p_max, c_max) < 0)
710 if (ASN1_INTEGER_cmp(p_min, c_min) > 0)
720 * Test whether a is a subet of b.
722 int v3_asid_subset(ASIdentifiers *a, ASIdentifiers *b)
727 !v3_asid_inherits(a) &&
728 !v3_asid_inherits(b) &&
729 asid_contains(b->asnum->u.asIdsOrRanges,
730 a->asnum->u.asIdsOrRanges) &&
731 asid_contains(b->rdi->u.asIdsOrRanges,
732 a->rdi->u.asIdsOrRanges)));
736 * Validation error handling via callback.
738 #define validation_err(_err_) \
741 ctx->error = _err_; \
742 ctx->error_depth = i; \
743 ctx->current_cert = x; \
744 ret = ctx->verify_cb(0, ctx); \
753 * Core code for RFC 3779 3.3 path validation.
755 static int v3_asid_validate_path_internal(X509_STORE_CTX *ctx,
756 STACK_OF(X509) *chain,
759 ASIdOrRanges *child_as = NULL, *child_rdi = NULL;
760 int i, ret = 1, inherit_as = 0, inherit_rdi = 0;
763 OPENSSL_assert(chain != NULL && sk_X509_num(chain) > 0);
764 OPENSSL_assert(ctx != NULL || ext != NULL);
765 OPENSSL_assert(ctx == NULL || ctx->verify_cb != NULL);
768 * Figure out where to start. If we don't have an extension to
769 * check, we're done. Otherwise, check canonical form and
770 * set up for walking up the chain.
777 x = sk_X509_value(chain, i);
778 OPENSSL_assert(x != NULL);
779 if ((ext = x->rfc3779_asid) == NULL)
782 if (!v3_asid_is_canonical(ext))
783 validation_err(X509_V_ERR_INVALID_EXTENSION);
784 if (ext->asnum != NULL) {
785 switch (ext->asnum->type) {
786 case ASIdentifierChoice_inherit:
789 case ASIdentifierChoice_asIdsOrRanges:
790 child_as = ext->asnum->u.asIdsOrRanges;
794 if (ext->rdi != NULL) {
795 switch (ext->rdi->type) {
796 case ASIdentifierChoice_inherit:
799 case ASIdentifierChoice_asIdsOrRanges:
800 child_rdi = ext->rdi->u.asIdsOrRanges;
806 * Now walk up the chain. Extensions must be in canonical form, no
807 * cert may list resources that its parent doesn't list.
809 for (i++; i < sk_X509_num(chain); i++) {
810 x = sk_X509_value(chain, i);
811 OPENSSL_assert(x != NULL);
812 if (x->rfc3779_asid == NULL) {
813 if (child_as != NULL || child_rdi != NULL)
814 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
817 if (!v3_asid_is_canonical(x->rfc3779_asid))
818 validation_err(X509_V_ERR_INVALID_EXTENSION);
819 if (x->rfc3779_asid->asnum == NULL && child_as != NULL) {
820 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
824 if (x->rfc3779_asid->asnum != NULL &&
825 x->rfc3779_asid->asnum->type ==
826 ASIdentifierChoice_asIdsOrRanges) {
828 || asid_contains(x->rfc3779_asid->asnum->u.asIdsOrRanges,
830 child_as = x->rfc3779_asid->asnum->u.asIdsOrRanges;
833 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
836 if (x->rfc3779_asid->rdi == NULL && child_rdi != NULL) {
837 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
841 if (x->rfc3779_asid->rdi != NULL &&
842 x->rfc3779_asid->rdi->type == ASIdentifierChoice_asIdsOrRanges) {
844 asid_contains(x->rfc3779_asid->rdi->u.asIdsOrRanges,
846 child_rdi = x->rfc3779_asid->rdi->u.asIdsOrRanges;
849 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
855 * Trust anchor can't inherit.
857 OPENSSL_assert(x != NULL);
858 if (x->rfc3779_asid != NULL) {
859 if (x->rfc3779_asid->asnum != NULL &&
860 x->rfc3779_asid->asnum->type == ASIdentifierChoice_inherit)
861 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
862 if (x->rfc3779_asid->rdi != NULL &&
863 x->rfc3779_asid->rdi->type == ASIdentifierChoice_inherit)
864 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
871 #undef validation_err
874 * RFC 3779 3.3 path validation -- called from X509_verify_cert().
876 int v3_asid_validate_path(X509_STORE_CTX *ctx)
878 return v3_asid_validate_path_internal(ctx, ctx->chain, NULL);
882 * RFC 3779 3.3 path validation of an extension.
883 * Test whether chain covers extension.
885 int v3_asid_validate_resource_set(STACK_OF(X509) *chain,
886 ASIdentifiers *ext, int allow_inheritance)
890 if (chain == NULL || sk_X509_num(chain) == 0)
892 if (!allow_inheritance && v3_asid_inherits(ext))
894 return v3_asid_validate_path_internal(NULL, chain, ext);