Coverage Report

Created: 2025-12-10 06:24

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/openssl/crypto/x509/v3_asid.c
Line
Count
Source
1
/*
2
 * Copyright 2006-2025 The OpenSSL Project Authors. All Rights Reserved.
3
 *
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
8
 */
9
10
/*
11
 * Implementation of RFC 3779 section 3.2.
12
 */
13
14
#include <assert.h>
15
#include <stdio.h>
16
#include <string.h>
17
#include "internal/cryptlib.h"
18
#include <openssl/conf.h>
19
#include <openssl/asn1.h>
20
#include <openssl/asn1t.h>
21
#include <openssl/x509v3.h>
22
#include <openssl/x509.h>
23
#include "crypto/x509.h"
24
#include <openssl/bn.h>
25
#include "ext_dat.h"
26
#include "x509_local.h"
27
28
#ifndef OPENSSL_NO_RFC3779
29
30
/*
31
 * OpenSSL ASN.1 template translation of RFC 3779 3.2.3.
32
 */
33
34
ASN1_SEQUENCE(ASRange) = {
35
    ASN1_SIMPLE(ASRange, min, ASN1_INTEGER),
36
    ASN1_SIMPLE(ASRange, max, ASN1_INTEGER)
37
0
} ASN1_SEQUENCE_END(ASRange)
38
0
39
0
ASN1_CHOICE(ASIdOrRange) = {
40
0
    ASN1_SIMPLE(ASIdOrRange, u.id, ASN1_INTEGER),
41
0
    ASN1_SIMPLE(ASIdOrRange, u.range, ASRange)
42
0
} ASN1_CHOICE_END(ASIdOrRange)
43
0
44
0
ASN1_CHOICE(ASIdentifierChoice) = {
45
0
    ASN1_SIMPLE(ASIdentifierChoice, u.inherit, ASN1_NULL),
46
0
    ASN1_SEQUENCE_OF(ASIdentifierChoice, u.asIdsOrRanges, ASIdOrRange)
47
0
} ASN1_CHOICE_END(ASIdentifierChoice)
48
0
49
0
ASN1_SEQUENCE(ASIdentifiers) = {
50
0
    ASN1_EXP_OPT(ASIdentifiers, asnum, ASIdentifierChoice, 0),
51
0
    ASN1_EXP_OPT(ASIdentifiers, rdi, ASIdentifierChoice, 1)
52
0
} ASN1_SEQUENCE_END(ASIdentifiers)
53
0
54
0
IMPLEMENT_ASN1_FUNCTIONS(ASRange)
55
0
IMPLEMENT_ASN1_FUNCTIONS(ASIdOrRange)
56
0
IMPLEMENT_ASN1_FUNCTIONS(ASIdentifierChoice)
57
0
IMPLEMENT_ASN1_FUNCTIONS(ASIdentifiers)
58
0
59
0
/*
60
0
 * i2r method for an ASIdentifierChoice.
61
0
 */
62
0
static int i2r_ASIdentifierChoice(BIO *out,
63
0
    ASIdentifierChoice *choice,
64
0
    int indent, const char *msg)
65
0
{
66
0
    int i;
67
0
    char *s;
68
0
    if (choice == NULL)
69
0
        return 1;
70
0
    BIO_printf(out, "%*s%s:\n", indent, "", msg);
71
0
    switch (choice->type) {
72
0
    case ASIdentifierChoice_inherit:
73
0
        BIO_printf(out, "%*sinherit\n", indent + 2, "");
74
0
        break;
75
0
    case ASIdentifierChoice_asIdsOrRanges:
76
0
        for (i = 0; i < sk_ASIdOrRange_num(choice->u.asIdsOrRanges); i++) {
77
0
            ASIdOrRange *aor = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
78
0
            switch (aor->type) {
79
0
            case ASIdOrRange_id:
80
0
                if ((s = i2s_ASN1_INTEGER(NULL, aor->u.id)) == NULL)
81
0
                    return 0;
82
0
                BIO_printf(out, "%*s%s\n", indent + 2, "", s);
83
0
                OPENSSL_free(s);
84
0
                break;
85
0
            case ASIdOrRange_range:
86
0
                if ((s = i2s_ASN1_INTEGER(NULL, aor->u.range->min)) == NULL)
87
0
                    return 0;
88
0
                BIO_printf(out, "%*s%s-", indent + 2, "", s);
89
0
                OPENSSL_free(s);
90
0
                if ((s = i2s_ASN1_INTEGER(NULL, aor->u.range->max)) == NULL)
91
0
                    return 0;
92
0
                BIO_printf(out, "%s\n", s);
93
0
                OPENSSL_free(s);
94
0
                break;
95
0
            default:
96
0
                return 0;
97
0
            }
98
0
        }
99
0
        break;
100
0
    default:
101
0
        return 0;
102
0
    }
103
0
    return 1;
104
0
}
105
106
/*
107
 * i2r method for an ASIdentifier extension.
108
 */
109
static int i2r_ASIdentifiers(const X509V3_EXT_METHOD *method,
110
    void *ext, BIO *out, int indent)
111
0
{
112
0
    ASIdentifiers *asid = ext;
113
0
    return (i2r_ASIdentifierChoice(out, asid->asnum, indent,
114
0
                "Autonomous System Numbers")
115
0
        && i2r_ASIdentifierChoice(out, asid->rdi, indent,
116
0
            "Routing Domain Identifiers"));
117
0
}
118
119
/*
120
 * Sort comparison function for a sequence of ASIdOrRange elements.
121
 */
122
static int ASIdOrRange_cmp(const ASIdOrRange *const *a_,
123
    const ASIdOrRange *const *b_)
124
0
{
125
0
    const ASIdOrRange *a = *a_, *b = *b_;
126
127
0
    assert((a->type == ASIdOrRange_id && a->u.id != NULL) || (a->type == ASIdOrRange_range && a->u.range != NULL && a->u.range->min != NULL && a->u.range->max != NULL));
128
129
0
    assert((b->type == ASIdOrRange_id && b->u.id != NULL) || (b->type == ASIdOrRange_range && b->u.range != NULL && b->u.range->min != NULL && b->u.range->max != NULL));
130
131
0
    if (a->type == ASIdOrRange_id && b->type == ASIdOrRange_id)
132
0
        return ASN1_INTEGER_cmp(a->u.id, b->u.id);
133
134
0
    if (a->type == ASIdOrRange_range && b->type == ASIdOrRange_range) {
135
0
        int r = ASN1_INTEGER_cmp(a->u.range->min, b->u.range->min);
136
0
        return r != 0 ? r : ASN1_INTEGER_cmp(a->u.range->max, b->u.range->max);
137
0
    }
138
139
0
    if (a->type == ASIdOrRange_id)
140
0
        return ASN1_INTEGER_cmp(a->u.id, b->u.range->min);
141
0
    else
142
0
        return ASN1_INTEGER_cmp(a->u.range->min, b->u.id);
143
0
}
144
145
/*
146
 * Add an inherit element.
147
 */
148
int X509v3_asid_add_inherit(ASIdentifiers *asid, int which)
149
0
{
150
0
    ASIdentifierChoice **choice;
151
0
    if (asid == NULL)
152
0
        return 0;
153
0
    switch (which) {
154
0
    case V3_ASID_ASNUM:
155
0
        choice = &asid->asnum;
156
0
        break;
157
0
    case V3_ASID_RDI:
158
0
        choice = &asid->rdi;
159
0
        break;
160
0
    default:
161
0
        return 0;
162
0
    }
163
0
    if (*choice == NULL) {
164
0
        if ((*choice = ASIdentifierChoice_new()) == NULL)
165
0
            return 0;
166
0
        if (((*choice)->u.inherit = ASN1_NULL_new()) == NULL) {
167
0
            ASIdentifierChoice_free(*choice);
168
0
            *choice = NULL;
169
0
            return 0;
170
0
        }
171
0
        (*choice)->type = ASIdentifierChoice_inherit;
172
0
    }
173
0
    return (*choice)->type == ASIdentifierChoice_inherit;
174
0
}
175
176
/*
177
 * Add an ID or range to an ASIdentifierChoice.
178
 */
179
int X509v3_asid_add_id_or_range(ASIdentifiers *asid,
180
    int which, ASN1_INTEGER *min, ASN1_INTEGER *max)
181
0
{
182
0
    ASIdentifierChoice **choice;
183
0
    ASIdOrRange *aor;
184
0
    if (asid == NULL)
185
0
        return 0;
186
0
    switch (which) {
187
0
    case V3_ASID_ASNUM:
188
0
        choice = &asid->asnum;
189
0
        break;
190
0
    case V3_ASID_RDI:
191
0
        choice = &asid->rdi;
192
0
        break;
193
0
    default:
194
0
        return 0;
195
0
    }
196
0
    if (*choice != NULL && (*choice)->type != ASIdentifierChoice_asIdsOrRanges)
197
0
        return 0;
198
0
    if (*choice == NULL) {
199
0
        if ((*choice = ASIdentifierChoice_new()) == NULL)
200
0
            return 0;
201
0
        (*choice)->u.asIdsOrRanges = sk_ASIdOrRange_new(ASIdOrRange_cmp);
202
0
        if ((*choice)->u.asIdsOrRanges == NULL) {
203
0
            ASIdentifierChoice_free(*choice);
204
0
            *choice = NULL;
205
0
            return 0;
206
0
        }
207
0
        (*choice)->type = ASIdentifierChoice_asIdsOrRanges;
208
0
    }
209
0
    if ((aor = ASIdOrRange_new()) == NULL)
210
0
        return 0;
211
0
    if (!sk_ASIdOrRange_reserve((*choice)->u.asIdsOrRanges, 1))
212
0
        goto err;
213
0
    if (max == NULL) {
214
0
        aor->type = ASIdOrRange_id;
215
0
        aor->u.id = min;
216
0
    } else {
217
0
        aor->type = ASIdOrRange_range;
218
0
        if ((aor->u.range = ASRange_new()) == NULL)
219
0
            goto err;
220
0
        ASN1_INTEGER_free(aor->u.range->min);
221
0
        aor->u.range->min = min;
222
0
        ASN1_INTEGER_free(aor->u.range->max);
223
0
        aor->u.range->max = max;
224
0
    }
225
    /* Cannot fail due to the reservation above */
226
0
    if (!ossl_assert(sk_ASIdOrRange_push((*choice)->u.asIdsOrRanges, aor)))
227
0
        goto err;
228
0
    return 1;
229
230
0
err:
231
0
    ASIdOrRange_free(aor);
232
0
    return 0;
233
0
}
234
235
/*
236
 * Extract min and max values from an ASIdOrRange.
237
 */
238
static int extract_min_max(ASIdOrRange *aor,
239
    ASN1_INTEGER **min, ASN1_INTEGER **max)
240
0
{
241
0
    if (!ossl_assert(aor != NULL))
242
0
        return 0;
243
0
    switch (aor->type) {
244
0
    case ASIdOrRange_id:
245
0
        *min = aor->u.id;
246
0
        *max = aor->u.id;
247
0
        return 1;
248
0
    case ASIdOrRange_range:
249
0
        *min = aor->u.range->min;
250
0
        *max = aor->u.range->max;
251
0
        return 1;
252
0
    }
253
254
0
    return 0;
255
0
}
256
257
/*
258
 * Check whether an ASIdentifierChoice is in canonical form.
259
 */
260
static int ASIdentifierChoice_is_canonical(ASIdentifierChoice *choice)
261
0
{
262
0
    ASN1_INTEGER *a_max_plus_one = NULL;
263
0
    ASN1_INTEGER *orig;
264
0
    BIGNUM *bn = NULL;
265
0
    int i, ret = 0;
266
267
    /*
268
     * Empty element or inheritance is canonical.
269
     */
270
0
    if (choice == NULL || choice->type == ASIdentifierChoice_inherit)
271
0
        return 1;
272
273
    /*
274
     * If not a list, or if empty list, it's broken.
275
     */
276
0
    if (choice->type != ASIdentifierChoice_asIdsOrRanges || sk_ASIdOrRange_num(choice->u.asIdsOrRanges) == 0)
277
0
        return 0;
278
279
    /*
280
     * It's a list, check it.
281
     */
282
0
    for (i = 0; i < sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1; i++) {
283
0
        ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
284
0
        ASIdOrRange *b = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i + 1);
285
0
        ASN1_INTEGER *a_min = NULL, *a_max = NULL, *b_min = NULL, *b_max = NULL;
286
287
0
        if (!extract_min_max(a, &a_min, &a_max)
288
0
            || !extract_min_max(b, &b_min, &b_max))
289
0
            goto done;
290
291
        /*
292
         * Punt misordered list, overlapping start, or inverted range.
293
         */
294
0
        if (ASN1_INTEGER_cmp(a_min, b_min) >= 0 || ASN1_INTEGER_cmp(a_min, a_max) > 0 || ASN1_INTEGER_cmp(b_min, b_max) > 0)
295
0
            goto done;
296
297
        /*
298
         * Calculate a_max + 1 to check for adjacency.
299
         */
300
0
        if ((bn == NULL && (bn = BN_new()) == NULL) || ASN1_INTEGER_to_BN(a_max, bn) == NULL || !BN_add_word(bn, 1)) {
301
0
            ERR_raise(ERR_LIB_X509V3, ERR_R_BN_LIB);
302
0
            goto done;
303
0
        }
304
305
0
        if ((a_max_plus_one = BN_to_ASN1_INTEGER(bn, orig = a_max_plus_one)) == NULL) {
306
0
            a_max_plus_one = orig;
307
0
            ERR_raise(ERR_LIB_X509V3, ERR_R_ASN1_LIB);
308
0
            goto done;
309
0
        }
310
311
        /*
312
         * Punt if adjacent or overlapping.
313
         */
314
0
        if (ASN1_INTEGER_cmp(a_max_plus_one, b_min) >= 0)
315
0
            goto done;
316
0
    }
317
318
    /*
319
     * Check for inverted range.
320
     */
321
0
    i = sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1;
322
0
    {
323
0
        ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
324
0
        ASN1_INTEGER *a_min, *a_max;
325
0
        if (a != NULL && a->type == ASIdOrRange_range) {
326
0
            if (!extract_min_max(a, &a_min, &a_max)
327
0
                || ASN1_INTEGER_cmp(a_min, a_max) > 0)
328
0
                goto done;
329
0
        }
330
0
    }
331
332
0
    ret = 1;
333
334
0
done:
335
0
    ASN1_INTEGER_free(a_max_plus_one);
336
0
    BN_free(bn);
337
0
    return ret;
338
0
}
339
340
/*
341
 * Check whether an ASIdentifier extension is in canonical form.
342
 */
343
int X509v3_asid_is_canonical(ASIdentifiers *asid)
344
0
{
345
0
    return (asid == NULL || (ASIdentifierChoice_is_canonical(asid->asnum) && ASIdentifierChoice_is_canonical(asid->rdi)));
346
0
}
347
348
/*
349
 * Whack an ASIdentifierChoice into canonical form.
350
 */
351
static int ASIdentifierChoice_canonize(ASIdentifierChoice *choice)
352
0
{
353
0
    ASN1_INTEGER *a_max_plus_one = NULL;
354
0
    ASN1_INTEGER *orig;
355
0
    BIGNUM *bn = NULL;
356
0
    int i, ret = 0;
357
358
    /*
359
     * Nothing to do for empty element or inheritance.
360
     */
361
0
    if (choice == NULL || choice->type == ASIdentifierChoice_inherit)
362
0
        return 1;
363
364
    /*
365
     * If not a list, or if empty list, it's broken.
366
     */
367
0
    if (choice->type != ASIdentifierChoice_asIdsOrRanges || sk_ASIdOrRange_num(choice->u.asIdsOrRanges) == 0) {
368
0
        ERR_raise(ERR_LIB_X509V3, X509V3_R_EXTENSION_VALUE_ERROR);
369
0
        return 0;
370
0
    }
371
372
    /*
373
     * We have a non-empty list.  Sort it.
374
     */
375
0
    sk_ASIdOrRange_sort(choice->u.asIdsOrRanges);
376
377
    /*
378
     * Now check for errors and suboptimal encoding, rejecting the
379
     * former and fixing the latter.
380
     */
381
0
    for (i = 0; i < sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1; i++) {
382
0
        ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
383
0
        ASIdOrRange *b = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i + 1);
384
0
        ASN1_INTEGER *a_min = NULL, *a_max = NULL, *b_min = NULL, *b_max = NULL;
385
386
0
        if (!extract_min_max(a, &a_min, &a_max)
387
0
            || !extract_min_max(b, &b_min, &b_max))
388
0
            goto done;
389
390
        /*
391
         * Make sure we're properly sorted (paranoia).
392
         */
393
0
        if (!ossl_assert(ASN1_INTEGER_cmp(a_min, b_min) <= 0))
394
0
            goto done;
395
396
        /*
397
         * Punt inverted ranges.
398
         */
399
0
        if (ASN1_INTEGER_cmp(a_min, a_max) > 0 || ASN1_INTEGER_cmp(b_min, b_max) > 0)
400
0
            goto done;
401
402
        /*
403
         * Check for overlaps.
404
         */
405
0
        if (ASN1_INTEGER_cmp(a_max, b_min) >= 0) {
406
0
            ERR_raise(ERR_LIB_X509V3, X509V3_R_EXTENSION_VALUE_ERROR);
407
0
            goto done;
408
0
        }
409
410
        /*
411
         * Calculate a_max + 1 to check for adjacency.
412
         */
413
0
        if ((bn == NULL && (bn = BN_new()) == NULL) || ASN1_INTEGER_to_BN(a_max, bn) == NULL || !BN_add_word(bn, 1)) {
414
0
            ERR_raise(ERR_LIB_X509V3, ERR_R_BN_LIB);
415
0
            goto done;
416
0
        }
417
418
0
        if ((a_max_plus_one = BN_to_ASN1_INTEGER(bn, orig = a_max_plus_one)) == NULL) {
419
0
            a_max_plus_one = orig;
420
0
            ERR_raise(ERR_LIB_X509V3, ERR_R_ASN1_LIB);
421
0
            goto done;
422
0
        }
423
424
        /*
425
         * If a and b are adjacent, merge them.
426
         */
427
0
        if (ASN1_INTEGER_cmp(a_max_plus_one, b_min) == 0) {
428
0
            ASRange *r;
429
0
            switch (a->type) {
430
0
            case ASIdOrRange_id:
431
0
                if ((r = OPENSSL_malloc(sizeof(*r))) == NULL)
432
0
                    goto done;
433
0
                r->min = a_min;
434
0
                r->max = b_max;
435
0
                a->type = ASIdOrRange_range;
436
0
                a->u.range = r;
437
0
                break;
438
0
            case ASIdOrRange_range:
439
0
                ASN1_INTEGER_free(a->u.range->max);
440
0
                a->u.range->max = b_max;
441
0
                break;
442
0
            }
443
0
            switch (b->type) {
444
0
            case ASIdOrRange_id:
445
0
                b->u.id = NULL;
446
0
                break;
447
0
            case ASIdOrRange_range:
448
0
                b->u.range->max = NULL;
449
0
                break;
450
0
            }
451
0
            ASIdOrRange_free(b);
452
0
            (void)sk_ASIdOrRange_delete(choice->u.asIdsOrRanges, i + 1);
453
0
            i--;
454
0
            continue;
455
0
        }
456
0
    }
457
458
    /*
459
     * Check for final inverted range.
460
     */
461
0
    i = sk_ASIdOrRange_num(choice->u.asIdsOrRanges) - 1;
462
0
    {
463
0
        ASIdOrRange *a = sk_ASIdOrRange_value(choice->u.asIdsOrRanges, i);
464
0
        ASN1_INTEGER *a_min, *a_max;
465
0
        if (a != NULL && a->type == ASIdOrRange_range) {
466
0
            if (!extract_min_max(a, &a_min, &a_max)
467
0
                || ASN1_INTEGER_cmp(a_min, a_max) > 0)
468
0
                goto done;
469
0
        }
470
0
    }
471
472
    /* Paranoia */
473
0
    if (!ossl_assert(ASIdentifierChoice_is_canonical(choice)))
474
0
        goto done;
475
476
0
    ret = 1;
477
478
0
done:
479
0
    ASN1_INTEGER_free(a_max_plus_one);
480
0
    BN_free(bn);
481
0
    return ret;
482
0
}
483
484
/*
485
 * Whack an ASIdentifier extension into canonical form.
486
 */
487
int X509v3_asid_canonize(ASIdentifiers *asid)
488
0
{
489
0
    return (asid == NULL || (ASIdentifierChoice_canonize(asid->asnum) && ASIdentifierChoice_canonize(asid->rdi)));
490
0
}
491
492
/*
493
 * v2i method for an ASIdentifier extension.
494
 */
495
static void *v2i_ASIdentifiers(const struct v3_ext_method *method,
496
    struct v3_ext_ctx *ctx,
497
    STACK_OF(CONF_VALUE) *values)
498
0
{
499
0
    ASN1_INTEGER *min = NULL, *max = NULL;
500
0
    ASIdentifiers *asid = NULL;
501
0
    int i;
502
503
0
    if ((asid = ASIdentifiers_new()) == NULL) {
504
0
        ERR_raise(ERR_LIB_X509V3, ERR_R_X509V3_LIB);
505
0
        return NULL;
506
0
    }
507
508
0
    for (i = 0; i < sk_CONF_VALUE_num(values); i++) {
509
0
        CONF_VALUE *val = sk_CONF_VALUE_value(values, i);
510
0
        int i1 = 0, i2 = 0, i3 = 0, is_range = 0, which = 0;
511
512
        /*
513
         * Figure out whether this is an AS or an RDI.
514
         */
515
0
        if (!ossl_v3_name_cmp(val->name, "AS")) {
516
0
            which = V3_ASID_ASNUM;
517
0
        } else if (!ossl_v3_name_cmp(val->name, "RDI")) {
518
0
            which = V3_ASID_RDI;
519
0
        } else {
520
0
            ERR_raise(ERR_LIB_X509V3, X509V3_R_EXTENSION_NAME_ERROR);
521
0
            X509V3_conf_add_error_name_value(val);
522
0
            goto err;
523
0
        }
524
525
0
        if (val->value == NULL) {
526
0
            ERR_raise(ERR_LIB_X509V3, X509V3_R_EXTENSION_VALUE_ERROR);
527
0
            goto err;
528
0
        }
529
530
        /*
531
         * Handle inheritance.
532
         */
533
0
        if (strcmp(val->value, "inherit") == 0) {
534
0
            if (X509v3_asid_add_inherit(asid, which))
535
0
                continue;
536
0
            ERR_raise(ERR_LIB_X509V3, X509V3_R_INVALID_INHERITANCE);
537
0
            X509V3_conf_add_error_name_value(val);
538
0
            goto err;
539
0
        }
540
541
        /*
542
         * Number, range, or mistake, pick it apart and figure out which.
543
         */
544
0
        i1 = (int)strspn(val->value, "0123456789");
545
0
        if (val->value[i1] == '\0') {
546
0
            is_range = 0;
547
0
        } else {
548
0
            is_range = 1;
549
0
            i2 = i1 + (int)strspn(val->value + i1, " \t");
550
0
            if (val->value[i2] != '-') {
551
0
                ERR_raise(ERR_LIB_X509V3, X509V3_R_INVALID_ASNUMBER);
552
0
                X509V3_conf_add_error_name_value(val);
553
0
                goto err;
554
0
            }
555
0
            i2++;
556
0
            i2 = i2 + (int)strspn(val->value + i2, " \t");
557
0
            i3 = i2 + (int)strspn(val->value + i2, "0123456789");
558
0
            if (val->value[i3] != '\0') {
559
0
                ERR_raise(ERR_LIB_X509V3, X509V3_R_INVALID_ASRANGE);
560
0
                X509V3_conf_add_error_name_value(val);
561
0
                goto err;
562
0
            }
563
0
        }
564
565
        /*
566
         * Syntax is ok, read and add it.
567
         */
568
0
        if (!is_range) {
569
0
            if (!X509V3_get_value_int(val, &min)) {
570
0
                ERR_raise(ERR_LIB_X509V3, ERR_R_X509V3_LIB);
571
0
                goto err;
572
0
            }
573
0
        } else {
574
0
            char *s = OPENSSL_strdup(val->value);
575
0
            if (s == NULL)
576
0
                goto err;
577
0
            s[i1] = '\0';
578
0
            min = s2i_ASN1_INTEGER(NULL, s);
579
0
            max = s2i_ASN1_INTEGER(NULL, s + i2);
580
0
            OPENSSL_free(s);
581
0
            if (min == NULL || max == NULL) {
582
0
                ERR_raise(ERR_LIB_X509V3, ERR_R_X509V3_LIB);
583
0
                goto err;
584
0
            }
585
0
            if (ASN1_INTEGER_cmp(min, max) > 0) {
586
0
                ERR_raise(ERR_LIB_X509V3, X509V3_R_EXTENSION_VALUE_ERROR);
587
0
                goto err;
588
0
            }
589
0
        }
590
0
        if (!X509v3_asid_add_id_or_range(asid, which, min, max)) {
591
0
            ERR_raise(ERR_LIB_X509V3, ERR_R_X509V3_LIB);
592
0
            goto err;
593
0
        }
594
0
        min = max = NULL;
595
0
    }
596
597
    /*
598
     * Canonize the result, then we're done.
599
     */
600
0
    if (!X509v3_asid_canonize(asid))
601
0
        goto err;
602
0
    return asid;
603
604
0
err:
605
0
    ASIdentifiers_free(asid);
606
0
    ASN1_INTEGER_free(min);
607
0
    ASN1_INTEGER_free(max);
608
0
    return NULL;
609
0
}
610
611
/*
612
 * OpenSSL dispatch.
613
 */
614
const X509V3_EXT_METHOD ossl_v3_asid = {
615
    NID_sbgp_autonomousSysNum, /* nid */
616
    0, /* flags */
617
    ASN1_ITEM_ref(ASIdentifiers), /* template */
618
    0, 0, 0, 0, /* old functions, ignored */
619
    0, /* i2s */
620
    0, /* s2i */
621
    0, /* i2v */
622
    v2i_ASIdentifiers, /* v2i */
623
    i2r_ASIdentifiers, /* i2r */
624
    0, /* r2i */
625
    NULL /* extension-specific data */
626
};
627
628
/*
629
 * Figure out whether extension uses inheritance.
630
 */
631
int X509v3_asid_inherits(ASIdentifiers *asid)
632
0
{
633
0
    return (asid != NULL && ((asid->asnum != NULL && asid->asnum->type == ASIdentifierChoice_inherit) || (asid->rdi != NULL && asid->rdi->type == ASIdentifierChoice_inherit)));
634
0
}
635
636
/*
637
 * Figure out whether parent contains child.
638
 */
639
static int asid_contains(ASIdOrRanges *parent, ASIdOrRanges *child)
640
0
{
641
0
    ASN1_INTEGER *p_min = NULL, *p_max = NULL, *c_min = NULL, *c_max = NULL;
642
0
    int p, c;
643
644
0
    if (child == NULL || parent == child)
645
0
        return 1;
646
0
    if (parent == NULL)
647
0
        return 0;
648
649
0
    p = 0;
650
0
    for (c = 0; c < sk_ASIdOrRange_num(child); c++) {
651
0
        if (!extract_min_max(sk_ASIdOrRange_value(child, c), &c_min, &c_max))
652
0
            return 0;
653
0
        for (;; p++) {
654
0
            if (p >= sk_ASIdOrRange_num(parent))
655
0
                return 0;
656
0
            if (!extract_min_max(sk_ASIdOrRange_value(parent, p), &p_min,
657
0
                    &p_max))
658
0
                return 0;
659
0
            if (ASN1_INTEGER_cmp(p_max, c_max) < 0)
660
0
                continue;
661
0
            if (ASN1_INTEGER_cmp(p_min, c_min) > 0)
662
0
                return 0;
663
0
            break;
664
0
        }
665
0
    }
666
667
0
    return 1;
668
0
}
669
670
/*
671
 * Test whether a is a subset of b.
672
 */
673
int X509v3_asid_subset(ASIdentifiers *a, ASIdentifiers *b)
674
0
{
675
0
    int subset;
676
677
0
    if (a == NULL || a == b)
678
0
        return 1;
679
680
0
    if (b == NULL)
681
0
        return 0;
682
683
0
    if (X509v3_asid_inherits(a) || X509v3_asid_inherits(b))
684
0
        return 0;
685
686
0
    subset = a->asnum == NULL
687
0
        || (b->asnum != NULL
688
0
            && asid_contains(b->asnum->u.asIdsOrRanges,
689
0
                a->asnum->u.asIdsOrRanges));
690
0
    if (!subset)
691
0
        return 0;
692
693
0
    return a->rdi == NULL
694
0
        || (b->rdi != NULL
695
0
            && asid_contains(b->rdi->u.asIdsOrRanges,
696
0
                a->rdi->u.asIdsOrRanges));
697
0
}
698
699
/*
700
 * Validation error handling via callback.
701
 */
702
#define validation_err(_err_)             \
703
0
    do {                                  \
704
0
        if (ctx != NULL) {                \
705
0
            ctx->error = _err_;           \
706
0
            ctx->error_depth = i;         \
707
0
            ctx->current_cert = x;        \
708
0
            ret = ctx->verify_cb(0, ctx); \
709
0
        } else {                          \
710
0
            ret = 0;                      \
711
0
        }                                 \
712
0
        if (!ret)                         \
713
0
            goto done;                    \
714
0
    } while (0)
715
716
/*
717
 * Core code for RFC 3779 3.3 path validation.
718
 */
719
static int asid_validate_path_internal(X509_STORE_CTX *ctx,
720
    STACK_OF(X509) *chain,
721
    ASIdentifiers *ext)
722
0
{
723
0
    ASIdOrRanges *child_as = NULL, *child_rdi = NULL;
724
0
    int i, ret = 1, inherit_as = 0, inherit_rdi = 0;
725
0
    X509 *x;
726
727
0
    if (!ossl_assert(chain != NULL && sk_X509_num(chain) > 0)
728
0
        || !ossl_assert(ctx != NULL || ext != NULL)
729
0
        || !ossl_assert(ctx == NULL || ctx->verify_cb != NULL)) {
730
0
        if (ctx != NULL)
731
0
            ctx->error = X509_V_ERR_UNSPECIFIED;
732
0
        return 0;
733
0
    }
734
735
    /*
736
     * Figure out where to start.  If we don't have an extension to
737
     * check, we're done.  Otherwise, check canonical form and
738
     * set up for walking up the chain.
739
     */
740
0
    if (ext != NULL) {
741
0
        i = -1;
742
0
        x = NULL;
743
0
    } else {
744
0
        i = 0;
745
0
        x = sk_X509_value(chain, i);
746
0
        if ((ext = x->rfc3779_asid) == NULL)
747
0
            goto done;
748
0
    }
749
0
    if (!X509v3_asid_is_canonical(ext))
750
0
        validation_err(X509_V_ERR_INVALID_EXTENSION);
751
0
    if (ext->asnum != NULL) {
752
0
        switch (ext->asnum->type) {
753
0
        case ASIdentifierChoice_inherit:
754
0
            inherit_as = 1;
755
0
            break;
756
0
        case ASIdentifierChoice_asIdsOrRanges:
757
0
            child_as = ext->asnum->u.asIdsOrRanges;
758
0
            break;
759
0
        }
760
0
    }
761
0
    if (ext->rdi != NULL) {
762
0
        switch (ext->rdi->type) {
763
0
        case ASIdentifierChoice_inherit:
764
0
            inherit_rdi = 1;
765
0
            break;
766
0
        case ASIdentifierChoice_asIdsOrRanges:
767
0
            child_rdi = ext->rdi->u.asIdsOrRanges;
768
0
            break;
769
0
        }
770
0
    }
771
772
    /*
773
     * Now walk up the chain.  Extensions must be in canonical form, no
774
     * cert may list resources that its parent doesn't list.
775
     */
776
0
    for (i++; i < sk_X509_num(chain); i++) {
777
0
        x = sk_X509_value(chain, i);
778
0
        if (!ossl_assert(x != NULL)) {
779
0
            if (ctx != NULL)
780
0
                ctx->error = X509_V_ERR_UNSPECIFIED;
781
0
            return 0;
782
0
        }
783
0
        if (x->rfc3779_asid == NULL) {
784
0
            if (child_as != NULL || child_rdi != NULL)
785
0
                validation_err(X509_V_ERR_UNNESTED_RESOURCE);
786
0
            continue;
787
0
        }
788
0
        if (!X509v3_asid_is_canonical(x->rfc3779_asid))
789
0
            validation_err(X509_V_ERR_INVALID_EXTENSION);
790
0
        if (x->rfc3779_asid->asnum == NULL && child_as != NULL) {
791
0
            validation_err(X509_V_ERR_UNNESTED_RESOURCE);
792
0
            child_as = NULL;
793
0
            inherit_as = 0;
794
0
        }
795
0
        if (x->rfc3779_asid->asnum != NULL && x->rfc3779_asid->asnum->type == ASIdentifierChoice_asIdsOrRanges) {
796
0
            if (inherit_as
797
0
                || asid_contains(x->rfc3779_asid->asnum->u.asIdsOrRanges,
798
0
                    child_as)) {
799
0
                child_as = x->rfc3779_asid->asnum->u.asIdsOrRanges;
800
0
                inherit_as = 0;
801
0
            } else {
802
0
                validation_err(X509_V_ERR_UNNESTED_RESOURCE);
803
0
            }
804
0
        }
805
0
        if (x->rfc3779_asid->rdi == NULL && child_rdi != NULL) {
806
0
            validation_err(X509_V_ERR_UNNESTED_RESOURCE);
807
0
            child_rdi = NULL;
808
0
            inherit_rdi = 0;
809
0
        }
810
0
        if (x->rfc3779_asid->rdi != NULL && x->rfc3779_asid->rdi->type == ASIdentifierChoice_asIdsOrRanges) {
811
0
            if (inherit_rdi || asid_contains(x->rfc3779_asid->rdi->u.asIdsOrRanges, child_rdi)) {
812
0
                child_rdi = x->rfc3779_asid->rdi->u.asIdsOrRanges;
813
0
                inherit_rdi = 0;
814
0
            } else {
815
0
                validation_err(X509_V_ERR_UNNESTED_RESOURCE);
816
0
            }
817
0
        }
818
0
    }
819
820
    /*
821
     * Trust anchor can't inherit.
822
     */
823
0
    if (!ossl_assert(x != NULL)) {
824
0
        if (ctx != NULL)
825
0
            ctx->error = X509_V_ERR_UNSPECIFIED;
826
0
        return 0;
827
0
    }
828
0
    if (x->rfc3779_asid != NULL) {
829
0
        if (x->rfc3779_asid->asnum != NULL && x->rfc3779_asid->asnum->type == ASIdentifierChoice_inherit)
830
0
            validation_err(X509_V_ERR_UNNESTED_RESOURCE);
831
0
        if (x->rfc3779_asid->rdi != NULL && x->rfc3779_asid->rdi->type == ASIdentifierChoice_inherit)
832
0
            validation_err(X509_V_ERR_UNNESTED_RESOURCE);
833
0
    }
834
835
0
done:
836
0
    return ret;
837
0
}
838
839
#undef validation_err
840
841
/*
842
 * RFC 3779 3.3 path validation -- called from X509_verify_cert().
843
 */
844
int X509v3_asid_validate_path(X509_STORE_CTX *ctx)
845
0
{
846
0
    if (ctx->chain == NULL
847
0
        || sk_X509_num(ctx->chain) == 0
848
0
        || ctx->verify_cb == NULL) {
849
0
        ctx->error = X509_V_ERR_UNSPECIFIED;
850
0
        return 0;
851
0
    }
852
0
    return asid_validate_path_internal(ctx, ctx->chain, NULL);
853
0
}
854
855
/*
856
 * RFC 3779 3.3 path validation of an extension.
857
 * Test whether chain covers extension.
858
 */
859
int X509v3_asid_validate_resource_set(STACK_OF(X509) *chain,
860
    ASIdentifiers *ext, int allow_inheritance)
861
0
{
862
0
    if (ext == NULL)
863
0
        return 1;
864
0
    if (chain == NULL || sk_X509_num(chain) == 0)
865
0
        return 0;
866
0
    if (!allow_inheritance && X509v3_asid_inherits(ext))
867
0
        return 0;
868
0
    return asid_validate_path_internal(NULL, chain, ext);
869
0
}
870
871
#endif /* OPENSSL_NO_RFC3779 */