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>
72 #ifndef OPENSSL_NO_RFC3779
75 * OpenSSL ASN.1 template translation of RFC 3779 3.2.3.
78 ASN1_SEQUENCE(ASRange) = {
79 ASN1_SIMPLE(ASRange, min, ASN1_INTEGER),
80 ASN1_SIMPLE(ASRange, max, ASN1_INTEGER)
81 } ASN1_SEQUENCE_END(ASRange)
83 ASN1_CHOICE(ASIdOrRange) = {
84 ASN1_SIMPLE(ASIdOrRange, u.id, ASN1_INTEGER),
85 ASN1_SIMPLE(ASIdOrRange, u.range, ASRange)
86 } ASN1_CHOICE_END(ASIdOrRange)
88 ASN1_CHOICE(ASIdentifierChoice) = {
89 ASN1_SIMPLE(ASIdentifierChoice, u.inherit, ASN1_NULL),
90 ASN1_SEQUENCE_OF(ASIdentifierChoice, u.asIdsOrRanges, ASIdOrRange)
91 } ASN1_CHOICE_END(ASIdentifierChoice)
93 ASN1_SEQUENCE(ASIdentifiers) = {
94 ASN1_EXP_OPT(ASIdentifiers, asnum, ASIdentifierChoice, 0),
95 ASN1_EXP_OPT(ASIdentifiers, rdi, ASIdentifierChoice, 1)
96 } ASN1_SEQUENCE_END(ASIdentifiers)
98 IMPLEMENT_ASN1_FUNCTIONS(ASRange)
99 IMPLEMENT_ASN1_FUNCTIONS(ASIdOrRange)
100 IMPLEMENT_ASN1_FUNCTIONS(ASIdentifierChoice)
101 IMPLEMENT_ASN1_FUNCTIONS(ASIdentifiers)
104 * i2r method for an ASIdentifierChoice.
106 static int i2r_ASIdentifierChoice(BIO *out,
107 ASIdentifierChoice *choice,
108 int indent, const char *msg)
114 BIO_printf(out, "%*s%s:\n", indent, "", msg);
115 switch (choice->type) {
116 case ASIdentifierChoice_inherit:
117 BIO_printf(out, "%*sinherit\n", indent + 2, "");
119 case ASIdentifierChoice_asIdsOrRanges:
120 for (i = 0; i < sk_ASIdOrRange_num(choice->u.asIdsOrRanges); i++) {
122 sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
125 if ((s = i2s_ASN1_INTEGER(NULL, aor->u.id)) == NULL)
127 BIO_printf(out, "%*s%s\n", indent + 2, "", s);
130 case ASIdOrRange_range:
131 if ((s = i2s_ASN1_INTEGER(NULL, aor->u.range->min)) == NULL)
133 BIO_printf(out, "%*s%s-", indent + 2, "", s);
135 if ((s = i2s_ASN1_INTEGER(NULL, aor->u.range->max)) == NULL)
137 BIO_printf(out, "%s\n", s);
152 * i2r method for an ASIdentifier extension.
154 static int i2r_ASIdentifiers(const X509V3_EXT_METHOD *method,
155 void *ext, BIO *out, int indent)
157 ASIdentifiers *asid = ext;
158 return (i2r_ASIdentifierChoice(out, asid->asnum, indent,
159 "Autonomous System Numbers") &&
160 i2r_ASIdentifierChoice(out, asid->rdi, indent,
161 "Routing Domain Identifiers"));
165 * Sort comparision function for a sequence of ASIdOrRange elements.
167 static int ASIdOrRange_cmp(const ASIdOrRange *const *a_,
168 const ASIdOrRange *const *b_)
170 const ASIdOrRange *a = *a_, *b = *b_;
172 OPENSSL_assert((a->type == ASIdOrRange_id && a->u.id != NULL) ||
173 (a->type == ASIdOrRange_range && a->u.range != NULL &&
174 a->u.range->min != NULL && a->u.range->max != NULL));
176 OPENSSL_assert((b->type == ASIdOrRange_id && b->u.id != NULL) ||
177 (b->type == ASIdOrRange_range && b->u.range != NULL &&
178 b->u.range->min != NULL && b->u.range->max != NULL));
180 if (a->type == ASIdOrRange_id && b->type == ASIdOrRange_id)
181 return ASN1_INTEGER_cmp(a->u.id, b->u.id);
183 if (a->type == ASIdOrRange_range && b->type == ASIdOrRange_range) {
184 int r = ASN1_INTEGER_cmp(a->u.range->min, b->u.range->min);
185 return r != 0 ? r : ASN1_INTEGER_cmp(a->u.range->max,
189 if (a->type == ASIdOrRange_id)
190 return ASN1_INTEGER_cmp(a->u.id, b->u.range->min);
192 return ASN1_INTEGER_cmp(a->u.range->min, b->u.id);
196 * Add an inherit element.
198 int v3_asid_add_inherit(ASIdentifiers *asid, int which)
200 ASIdentifierChoice **choice;
205 choice = &asid->asnum;
213 if (*choice == NULL) {
214 if ((*choice = ASIdentifierChoice_new()) == NULL)
216 OPENSSL_assert((*choice)->u.inherit == NULL);
217 if (((*choice)->u.inherit = ASN1_NULL_new()) == NULL)
219 (*choice)->type = ASIdentifierChoice_inherit;
221 return (*choice)->type == ASIdentifierChoice_inherit;
225 * Add an ID or range to an ASIdentifierChoice.
227 int v3_asid_add_id_or_range(ASIdentifiers *asid,
228 int which, ASN1_INTEGER *min, ASN1_INTEGER *max)
230 ASIdentifierChoice **choice;
236 choice = &asid->asnum;
244 if (*choice != NULL && (*choice)->type == ASIdentifierChoice_inherit)
246 if (*choice == NULL) {
247 if ((*choice = ASIdentifierChoice_new()) == NULL)
249 OPENSSL_assert((*choice)->u.asIdsOrRanges == NULL);
250 (*choice)->u.asIdsOrRanges = sk_ASIdOrRange_new(ASIdOrRange_cmp);
251 if ((*choice)->u.asIdsOrRanges == NULL)
253 (*choice)->type = ASIdentifierChoice_asIdsOrRanges;
255 if ((aor = ASIdOrRange_new()) == NULL)
258 aor->type = ASIdOrRange_id;
261 aor->type = ASIdOrRange_range;
262 if ((aor->u.range = ASRange_new()) == NULL)
264 ASN1_INTEGER_free(aor->u.range->min);
265 aor->u.range->min = min;
266 ASN1_INTEGER_free(aor->u.range->max);
267 aor->u.range->max = max;
269 if (!(sk_ASIdOrRange_push((*choice)->u.asIdsOrRanges, aor)))
274 ASIdOrRange_free(aor);
279 * Extract min and max values from an ASIdOrRange.
281 static void extract_min_max(ASIdOrRange *aor,
282 ASN1_INTEGER **min, ASN1_INTEGER **max)
284 OPENSSL_assert(aor != NULL && min != NULL && max != NULL);
290 case ASIdOrRange_range:
291 *min = aor->u.range->min;
292 *max = aor->u.range->max;
298 * Check whether an ASIdentifierChoice is in canonical form.
300 static int ASIdentifierChoice_is_canonical(ASIdentifierChoice *choice)
302 ASN1_INTEGER *a_max_plus_one = NULL;
307 * Empty element or inheritance is canonical.
309 if (choice == NULL || choice->type == ASIdentifierChoice_inherit)
313 * If not a list, or if empty list, it's broken.
315 if (choice->type != ASIdentifierChoice_asIdsOrRanges ||
316 sk_ASIdOrRange_num(choice->u.asIdsOrRanges) == 0)
320 * It's a list, check it.
322 for (i = 0; i < sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1; i++) {
323 ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
324 ASIdOrRange *b = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i + 1);
325 ASN1_INTEGER *a_min = NULL, *a_max = NULL, *b_min = NULL, *b_max =
328 extract_min_max(a, &a_min, &a_max);
329 extract_min_max(b, &b_min, &b_max);
332 * Punt misordered list, overlapping start, or inverted range.
334 if (ASN1_INTEGER_cmp(a_min, b_min) >= 0 ||
335 ASN1_INTEGER_cmp(a_min, a_max) > 0 ||
336 ASN1_INTEGER_cmp(b_min, b_max) > 0)
340 * Calculate a_max + 1 to check for adjacency.
342 if ((bn == NULL && (bn = BN_new()) == NULL) ||
343 ASN1_INTEGER_to_BN(a_max, bn) == NULL ||
344 !BN_add_word(bn, 1) ||
346 BN_to_ASN1_INTEGER(bn, a_max_plus_one)) == NULL) {
347 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_IS_CANONICAL,
348 ERR_R_MALLOC_FAILURE);
353 * Punt if adjacent or overlapping.
355 if (ASN1_INTEGER_cmp(a_max_plus_one, b_min) >= 0)
360 * Check for inverted range.
362 i = sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1;
364 ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
365 ASN1_INTEGER *a_min, *a_max;
366 if (a != NULL && a->type == ASIdOrRange_range) {
367 extract_min_max(a, &a_min, &a_max);
368 if (ASN1_INTEGER_cmp(a_min, a_max) > 0)
376 ASN1_INTEGER_free(a_max_plus_one);
382 * Check whether an ASIdentifier extension is in canonical form.
384 int v3_asid_is_canonical(ASIdentifiers *asid)
386 return (asid == NULL ||
387 (ASIdentifierChoice_is_canonical(asid->asnum) &&
388 ASIdentifierChoice_is_canonical(asid->rdi)));
392 * Whack an ASIdentifierChoice into canonical form.
394 static int ASIdentifierChoice_canonize(ASIdentifierChoice *choice)
396 ASN1_INTEGER *a_max_plus_one = NULL;
401 * Nothing to do for empty element or inheritance.
403 if (choice == NULL || choice->type == ASIdentifierChoice_inherit)
407 * If not a list, or if empty list, it's broken.
409 if (choice->type != ASIdentifierChoice_asIdsOrRanges ||
410 sk_ASIdOrRange_num(choice->u.asIdsOrRanges) == 0) {
411 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_CANONIZE,
412 X509V3_R_EXTENSION_VALUE_ERROR);
417 * We have a non-empty list. Sort it.
419 sk_ASIdOrRange_sort(choice->u.asIdsOrRanges);
422 * Now check for errors and suboptimal encoding, rejecting the
423 * former and fixing the latter.
425 for (i = 0; i < sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1; i++) {
426 ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
427 ASIdOrRange *b = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i + 1);
428 ASN1_INTEGER *a_min = NULL, *a_max = NULL, *b_min = NULL, *b_max =
431 extract_min_max(a, &a_min, &a_max);
432 extract_min_max(b, &b_min, &b_max);
435 * Make sure we're properly sorted (paranoia).
437 OPENSSL_assert(ASN1_INTEGER_cmp(a_min, b_min) <= 0);
440 * Punt inverted ranges.
442 if (ASN1_INTEGER_cmp(a_min, a_max) > 0 ||
443 ASN1_INTEGER_cmp(b_min, b_max) > 0)
447 * Check for overlaps.
449 if (ASN1_INTEGER_cmp(a_max, b_min) >= 0) {
450 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_CANONIZE,
451 X509V3_R_EXTENSION_VALUE_ERROR);
456 * Calculate a_max + 1 to check for adjacency.
458 if ((bn == NULL && (bn = BN_new()) == NULL) ||
459 ASN1_INTEGER_to_BN(a_max, bn) == NULL ||
460 !BN_add_word(bn, 1) ||
462 BN_to_ASN1_INTEGER(bn, a_max_plus_one)) == NULL) {
463 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_CANONIZE,
464 ERR_R_MALLOC_FAILURE);
469 * If a and b are adjacent, merge them.
471 if (ASN1_INTEGER_cmp(a_max_plus_one, b_min) == 0) {
475 if ((r = OPENSSL_malloc(sizeof(ASRange))) == NULL) {
476 X509V3err(X509V3_F_ASIDENTIFIERCHOICE_CANONIZE,
477 ERR_R_MALLOC_FAILURE);
482 a->type = ASIdOrRange_range;
485 case ASIdOrRange_range:
486 ASN1_INTEGER_free(a->u.range->max);
487 a->u.range->max = b_max;
494 case ASIdOrRange_range:
495 b->u.range->max = NULL;
499 (void)sk_ASIdOrRange_delete(choice->u.asIdsOrRanges, i + 1);
506 * Check for final inverted range.
508 i = sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1;
510 ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
511 ASN1_INTEGER *a_min, *a_max;
512 if (a != NULL && a->type == ASIdOrRange_range) {
513 extract_min_max(a, &a_min, &a_max);
514 if (ASN1_INTEGER_cmp(a_min, a_max) > 0)
519 OPENSSL_assert(ASIdentifierChoice_is_canonical(choice)); /* Paranoia */
524 ASN1_INTEGER_free(a_max_plus_one);
530 * Whack an ASIdentifier extension into canonical form.
532 int v3_asid_canonize(ASIdentifiers *asid)
534 return (asid == NULL ||
535 (ASIdentifierChoice_canonize(asid->asnum) &&
536 ASIdentifierChoice_canonize(asid->rdi)));
540 * v2i method for an ASIdentifier extension.
542 static void *v2i_ASIdentifiers(const struct v3_ext_method *method,
543 struct v3_ext_ctx *ctx,
544 STACK_OF(CONF_VALUE) *values)
546 ASN1_INTEGER *min = NULL, *max = NULL;
547 ASIdentifiers *asid = NULL;
550 if ((asid = ASIdentifiers_new()) == NULL) {
551 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
555 for (i = 0; i < sk_CONF_VALUE_num(values); i++) {
556 CONF_VALUE *val = sk_CONF_VALUE_value(values, i);
557 int i1, i2, i3, is_range, which;
560 * Figure out whether this is an AS or an RDI.
562 if (!name_cmp(val->name, "AS")) {
563 which = V3_ASID_ASNUM;
564 } else if (!name_cmp(val->name, "RDI")) {
567 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
568 X509V3_R_EXTENSION_NAME_ERROR);
569 X509V3_conf_err(val);
574 * Handle inheritance.
576 if (!strcmp(val->value, "inherit")) {
577 if (v3_asid_add_inherit(asid, which))
579 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
580 X509V3_R_INVALID_INHERITANCE);
581 X509V3_conf_err(val);
586 * Number, range, or mistake, pick it apart and figure out which.
588 i1 = strspn(val->value, "0123456789");
589 if (val->value[i1] == '\0') {
593 i2 = i1 + strspn(val->value + i1, " \t");
594 if (val->value[i2] != '-') {
595 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
596 X509V3_R_INVALID_ASNUMBER);
597 X509V3_conf_err(val);
601 i2 = i2 + strspn(val->value + i2, " \t");
602 i3 = i2 + strspn(val->value + i2, "0123456789");
603 if (val->value[i3] != '\0') {
604 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
605 X509V3_R_INVALID_ASRANGE);
606 X509V3_conf_err(val);
612 * Syntax is ok, read and add it.
615 if (!X509V3_get_value_int(val, &min)) {
616 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
620 char *s = BUF_strdup(val->value);
622 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
626 min = s2i_ASN1_INTEGER(NULL, s);
627 max = s2i_ASN1_INTEGER(NULL, s + i2);
629 if (min == NULL || max == NULL) {
630 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
633 if (ASN1_INTEGER_cmp(min, max) > 0) {
634 X509V3err(X509V3_F_V2I_ASIDENTIFIERS,
635 X509V3_R_EXTENSION_VALUE_ERROR);
639 if (!v3_asid_add_id_or_range(asid, which, min, max)) {
640 X509V3err(X509V3_F_V2I_ASIDENTIFIERS, ERR_R_MALLOC_FAILURE);
647 * Canonize the result, then we're done.
649 if (!v3_asid_canonize(asid))
654 ASIdentifiers_free(asid);
655 ASN1_INTEGER_free(min);
656 ASN1_INTEGER_free(max);
663 const X509V3_EXT_METHOD v3_asid = {
664 NID_sbgp_autonomousSysNum, /* nid */
666 ASN1_ITEM_ref(ASIdentifiers), /* template */
667 0, 0, 0, 0, /* old functions, ignored */
671 v2i_ASIdentifiers, /* v2i */
672 i2r_ASIdentifiers, /* i2r */
674 NULL /* extension-specific data */
678 * Figure out whether extension uses inheritance.
680 int v3_asid_inherits(ASIdentifiers *asid)
682 return (asid != NULL &&
683 ((asid->asnum != NULL &&
684 asid->asnum->type == ASIdentifierChoice_inherit) ||
685 (asid->rdi != NULL &&
686 asid->rdi->type == ASIdentifierChoice_inherit)));
690 * Figure out whether parent contains child.
692 static int asid_contains(ASIdOrRanges *parent, ASIdOrRanges *child)
694 ASN1_INTEGER *p_min = NULL, *p_max = NULL, *c_min = NULL, *c_max = NULL;
697 if (child == NULL || parent == child)
703 for (c = 0; c < sk_ASIdOrRange_num(child); c++) {
704 extract_min_max(sk_ASIdOrRange_value(child, c), &c_min, &c_max);
706 if (p >= sk_ASIdOrRange_num(parent))
708 extract_min_max(sk_ASIdOrRange_value(parent, p), &p_min, &p_max);
709 if (ASN1_INTEGER_cmp(p_max, c_max) < 0)
711 if (ASN1_INTEGER_cmp(p_min, c_min) > 0)
721 * Test whether a is a subet of b.
723 int v3_asid_subset(ASIdentifiers *a, ASIdentifiers *b)
728 !v3_asid_inherits(a) &&
729 !v3_asid_inherits(b) &&
730 asid_contains(b->asnum->u.asIdsOrRanges,
731 a->asnum->u.asIdsOrRanges) &&
732 asid_contains(b->rdi->u.asIdsOrRanges,
733 a->rdi->u.asIdsOrRanges)));
737 * Validation error handling via callback.
739 # define validation_err(_err_) \
742 ctx->error = _err_; \
743 ctx->error_depth = i; \
744 ctx->current_cert = x; \
745 ret = ctx->verify_cb(0, ctx); \
754 * Core code for RFC 3779 3.3 path validation.
756 static int v3_asid_validate_path_internal(X509_STORE_CTX *ctx,
757 STACK_OF(X509) *chain,
760 ASIdOrRanges *child_as = NULL, *child_rdi = NULL;
761 int i, ret = 1, inherit_as = 0, inherit_rdi = 0;
764 OPENSSL_assert(chain != NULL && sk_X509_num(chain) > 0);
765 OPENSSL_assert(ctx != NULL || ext != NULL);
766 OPENSSL_assert(ctx == NULL || ctx->verify_cb != NULL);
769 * Figure out where to start. If we don't have an extension to
770 * check, we're done. Otherwise, check canonical form and
771 * set up for walking up the chain.
778 x = sk_X509_value(chain, i);
779 OPENSSL_assert(x != NULL);
780 if ((ext = x->rfc3779_asid) == NULL)
783 if (!v3_asid_is_canonical(ext))
784 validation_err(X509_V_ERR_INVALID_EXTENSION);
785 if (ext->asnum != NULL) {
786 switch (ext->asnum->type) {
787 case ASIdentifierChoice_inherit:
790 case ASIdentifierChoice_asIdsOrRanges:
791 child_as = ext->asnum->u.asIdsOrRanges;
795 if (ext->rdi != NULL) {
796 switch (ext->rdi->type) {
797 case ASIdentifierChoice_inherit:
800 case ASIdentifierChoice_asIdsOrRanges:
801 child_rdi = ext->rdi->u.asIdsOrRanges;
807 * Now walk up the chain. Extensions must be in canonical form, no
808 * cert may list resources that its parent doesn't list.
810 for (i++; i < sk_X509_num(chain); i++) {
811 x = sk_X509_value(chain, i);
812 OPENSSL_assert(x != NULL);
813 if (x->rfc3779_asid == NULL) {
814 if (child_as != NULL || child_rdi != NULL)
815 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
818 if (!v3_asid_is_canonical(x->rfc3779_asid))
819 validation_err(X509_V_ERR_INVALID_EXTENSION);
820 if (x->rfc3779_asid->asnum == NULL && child_as != NULL) {
821 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
825 if (x->rfc3779_asid->asnum != NULL &&
826 x->rfc3779_asid->asnum->type ==
827 ASIdentifierChoice_asIdsOrRanges) {
829 || asid_contains(x->rfc3779_asid->asnum->u.asIdsOrRanges,
831 child_as = x->rfc3779_asid->asnum->u.asIdsOrRanges;
834 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
837 if (x->rfc3779_asid->rdi == NULL && child_rdi != NULL) {
838 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
842 if (x->rfc3779_asid->rdi != NULL &&
843 x->rfc3779_asid->rdi->type == ASIdentifierChoice_asIdsOrRanges) {
845 asid_contains(x->rfc3779_asid->rdi->u.asIdsOrRanges,
847 child_rdi = x->rfc3779_asid->rdi->u.asIdsOrRanges;
850 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
856 * Trust anchor can't inherit.
858 OPENSSL_assert(x != NULL);
859 if (x->rfc3779_asid != NULL) {
860 if (x->rfc3779_asid->asnum != NULL &&
861 x->rfc3779_asid->asnum->type == ASIdentifierChoice_inherit)
862 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
863 if (x->rfc3779_asid->rdi != NULL &&
864 x->rfc3779_asid->rdi->type == ASIdentifierChoice_inherit)
865 validation_err(X509_V_ERR_UNNESTED_RESOURCE);
872 # undef validation_err
875 * RFC 3779 3.3 path validation -- called from X509_verify_cert().
877 int v3_asid_validate_path(X509_STORE_CTX *ctx)
879 return v3_asid_validate_path_internal(ctx, ctx->chain, NULL);
883 * RFC 3779 3.3 path validation of an extension.
884 * Test whether chain covers extension.
886 int v3_asid_validate_resource_set(STACK_OF(X509) *chain,
887 ASIdentifiers *ext, int allow_inheritance)
891 if (chain == NULL || sk_X509_num(chain) == 0)
893 if (!allow_inheritance && v3_asid_inherits(ext))
895 return v3_asid_validate_path_internal(NULL, chain, ext);
898 #endif /* OPENSSL_NO_RFC3779 */