blob: 10f7905b7e60c8c4328dc054dda6a3ab75d037b2 [file] [log] [blame]
Paul Bakkerefc30292011-11-10 14:43:23 +00001/**
2 * \file asn1.h
3 *
4 * \brief Generic ASN.1 parsing
Darryl Greena40a1012018-01-05 15:33:17 +00005 */
6/*
Bence Szépkúti1e148272020-08-07 13:07:28 +02007 * Copyright The Mbed TLS Contributors
Manuel Pégourié-Gonnard37ff1402015-09-04 14:21:07 +02008 * SPDX-License-Identifier: Apache-2.0
9 *
10 * Licensed under the Apache License, Version 2.0 (the "License"); you may
11 * not use this file except in compliance with the License.
12 * You may obtain a copy of the License at
13 *
14 * http://www.apache.org/licenses/LICENSE-2.0
15 *
16 * Unless required by applicable law or agreed to in writing, software
17 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
18 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
19 * See the License for the specific language governing permissions and
20 * limitations under the License.
Paul Bakkerefc30292011-11-10 14:43:23 +000021 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020022#ifndef MBEDTLS_ASN1_H
23#define MBEDTLS_ASN1_H
Paul Bakkerefc30292011-11-10 14:43:23 +000024
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020025#if !defined(MBEDTLS_CONFIG_FILE)
Jaeden Ameroc49fbbf2019-07-04 20:01:14 +010026#include "mbedtls/config.h"
Manuel Pégourié-Gonnardcef4ad22014-04-29 12:39:06 +020027#else
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020028#include MBEDTLS_CONFIG_FILE
Manuel Pégourié-Gonnardcef4ad22014-04-29 12:39:06 +020029#endif
Paul Bakkerefc30292011-11-10 14:43:23 +000030
Rich Evans00ab4702015-02-06 13:43:58 +000031#include <stddef.h>
32
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020033#if defined(MBEDTLS_BIGNUM_C)
Jaeden Ameroc49fbbf2019-07-04 20:01:14 +010034#include "mbedtls/bignum.h"
Paul Bakkerefc30292011-11-10 14:43:23 +000035#endif
36
Paul Bakker9af723c2014-05-01 13:03:14 +020037/**
Paul Bakkerefc30292011-11-10 14:43:23 +000038 * \addtogroup asn1_module
Paul Bakker9af723c2014-05-01 13:03:14 +020039 * \{
Paul Bakkerefc30292011-11-10 14:43:23 +000040 */
Paul Bakker9af723c2014-05-01 13:03:14 +020041
Paul Bakkerefc30292011-11-10 14:43:23 +000042/**
43 * \name ASN1 Error codes
44 * These error codes are OR'ed to X509 error codes for
Paul Bakker9af723c2014-05-01 13:03:14 +020045 * higher error granularity.
Paul Bakkerefc30292011-11-10 14:43:23 +000046 * ASN1 is a standard to specify data structures.
47 * \{
48 */
Gilles Peskinea3974432021-07-26 18:48:10 +020049/** Out of data when parsing an ASN1 data structure. */
50#define MBEDTLS_ERR_ASN1_OUT_OF_DATA -0x0060
51/** ASN1 tag was of an unexpected value. */
52#define MBEDTLS_ERR_ASN1_UNEXPECTED_TAG -0x0062
53/** Error when trying to determine the length or invalid length. */
54#define MBEDTLS_ERR_ASN1_INVALID_LENGTH -0x0064
55/** Actual length differs from expected length. */
56#define MBEDTLS_ERR_ASN1_LENGTH_MISMATCH -0x0066
57/** Data is invalid. */
58#define MBEDTLS_ERR_ASN1_INVALID_DATA -0x0068
59/** Memory allocation failed */
60#define MBEDTLS_ERR_ASN1_ALLOC_FAILED -0x006A
61/** Buffer too small when writing ASN.1 data structure. */
62#define MBEDTLS_ERR_ASN1_BUF_TOO_SMALL -0x006C
Paul Bakker05888152012-02-16 10:26:57 +000063
Paul Bakkerefc30292011-11-10 14:43:23 +000064/* \} name */
65
66/**
67 * \name DER constants
Andres Amaya Garcia9fb02052017-08-25 17:24:44 +010068 * These constants comply with the DER encoded ASN.1 type tags.
Paul Bakkerefc30292011-11-10 14:43:23 +000069 * DER encoding uses hexadecimal representation.
70 * An example DER sequence is:\n
71 * - 0x02 -- tag indicating INTEGER
72 * - 0x01 -- length in octets
73 * - 0x05 -- value
Gilles Peskine96ddb0a2020-02-26 19:50:01 +010074 * Such sequences are typically read into \c ::mbedtls_x509_buf.
Paul Bakkerefc30292011-11-10 14:43:23 +000075 * \{
76 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020077#define MBEDTLS_ASN1_BOOLEAN 0x01
78#define MBEDTLS_ASN1_INTEGER 0x02
79#define MBEDTLS_ASN1_BIT_STRING 0x03
80#define MBEDTLS_ASN1_OCTET_STRING 0x04
81#define MBEDTLS_ASN1_NULL 0x05
82#define MBEDTLS_ASN1_OID 0x06
Mykhailo Sopiha20180ca2019-10-29 15:58:10 +020083#define MBEDTLS_ASN1_ENUMERATED 0x0A
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +020084#define MBEDTLS_ASN1_UTF8_STRING 0x0C
85#define MBEDTLS_ASN1_SEQUENCE 0x10
86#define MBEDTLS_ASN1_SET 0x11
87#define MBEDTLS_ASN1_PRINTABLE_STRING 0x13
88#define MBEDTLS_ASN1_T61_STRING 0x14
89#define MBEDTLS_ASN1_IA5_STRING 0x16
90#define MBEDTLS_ASN1_UTC_TIME 0x17
91#define MBEDTLS_ASN1_GENERALIZED_TIME 0x18
92#define MBEDTLS_ASN1_UNIVERSAL_STRING 0x1C
93#define MBEDTLS_ASN1_BMP_STRING 0x1E
94#define MBEDTLS_ASN1_PRIMITIVE 0x00
95#define MBEDTLS_ASN1_CONSTRUCTED 0x20
96#define MBEDTLS_ASN1_CONTEXT_SPECIFIC 0x80
Andres Amaya Garcia7512bf72017-08-25 17:12:11 +010097
Hanno Beckercba71222019-09-11 14:15:10 +010098/* Slightly smaller way to check if tag is a string tag
99 * compared to canonical implementation. */
100#define MBEDTLS_ASN1_IS_STRING_TAG( tag ) \
101 ( ( tag ) < 32u && ( \
102 ( ( 1u << ( tag ) ) & ( ( 1u << MBEDTLS_ASN1_BMP_STRING ) | \
103 ( 1u << MBEDTLS_ASN1_UTF8_STRING ) | \
104 ( 1u << MBEDTLS_ASN1_T61_STRING ) | \
105 ( 1u << MBEDTLS_ASN1_IA5_STRING ) | \
106 ( 1u << MBEDTLS_ASN1_UNIVERSAL_STRING ) | \
107 ( 1u << MBEDTLS_ASN1_PRINTABLE_STRING ) | \
108 ( 1u << MBEDTLS_ASN1_BIT_STRING ) ) ) != 0 ) )
109
Andres Amaya Garcia7512bf72017-08-25 17:12:11 +0100110/*
111 * Bit masks for each of the components of an ASN.1 tag as specified in
Gilles Peskine1ed45ea2018-03-08 18:16:45 +0100112 * ITU X.690 (08/2015), section 8.1 "General rules for encoding",
113 * paragraph 8.1.2.2:
Andres Amaya Garcia7512bf72017-08-25 17:12:11 +0100114 *
115 * Bit 8 7 6 5 1
116 * +-------+-----+------------+
117 * | Class | P/C | Tag number |
118 * +-------+-----+------------+
119 */
Andres Amaya Garcia7786abc2017-11-07 20:21:56 +0000120#define MBEDTLS_ASN1_TAG_CLASS_MASK 0xC0
121#define MBEDTLS_ASN1_TAG_PC_MASK 0x20
122#define MBEDTLS_ASN1_TAG_VALUE_MASK 0x1F
Andres Amaya Garcia7512bf72017-08-25 17:12:11 +0100123
Paul Bakkerefc30292011-11-10 14:43:23 +0000124/* \} name */
125/* \} addtogroup asn1_module */
126
127/** Returns the size of the binary string, without the trailing \\0 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200128#define MBEDTLS_OID_SIZE(x) (sizeof(x) - 1)
Paul Bakkerefc30292011-11-10 14:43:23 +0000129
Manuel Pégourié-Gonnarde76b7502014-01-23 19:15:29 +0100130/**
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200131 * Compares an mbedtls_asn1_buf structure to a reference OID.
Manuel Pégourié-Gonnarde76b7502014-01-23 19:15:29 +0100132 *
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200133 * Only works for 'defined' oid_str values (MBEDTLS_OID_HMAC_SHA1), you cannot use a
Manuel Pégourié-Gonnarde76b7502014-01-23 19:15:29 +0100134 * 'unsigned char *oid' here!
Paul Bakkere5eae762013-08-26 12:05:14 +0200135 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200136#define MBEDTLS_OID_CMP(oid_str, oid_buf) \
137 ( ( MBEDTLS_OID_SIZE(oid_str) != (oid_buf)->len ) || \
Manuel Pégourié-Gonnard6e064372015-03-19 16:54:56 +0000138 memcmp( (oid_str), (oid_buf)->p, (oid_buf)->len) != 0 )
Paul Bakkerc70b9822013-04-07 22:00:46 +0200139
Hanno Becker63e38fe2019-09-11 14:16:40 +0100140#define MBEDTLS_OID_CMP_RAW(oid_str, oid_buf, oid_buf_len) \
141 ( ( MBEDTLS_OID_SIZE(oid_str) != (oid_buf_len) ) || \
142 memcmp( (oid_str), (oid_buf), (oid_buf_len) ) != 0 )
143
Paul Bakkerefc30292011-11-10 14:43:23 +0000144#ifdef __cplusplus
145extern "C" {
146#endif
147
148/**
149 * \name Functions to parse ASN.1 data structures
150 * \{
151 */
152
153/**
154 * Type-length-value structure that allows for ASN1 using DER.
155 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200156typedef struct mbedtls_asn1_buf
Paul Bakkerefc30292011-11-10 14:43:23 +0000157{
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200158 int tag; /**< ASN1 type, e.g. MBEDTLS_ASN1_UTF8_STRING. */
Manuel Pégourié-Gonnardb8186a52015-06-18 14:58:58 +0200159 size_t len; /**< ASN1 length, in octets. */
Paul Bakkerefc30292011-11-10 14:43:23 +0000160 unsigned char *p; /**< ASN1 data, e.g. in ASCII. */
161}
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200162mbedtls_asn1_buf;
Paul Bakkerefc30292011-11-10 14:43:23 +0000163
164/**
165 * Container for ASN1 bit strings.
166 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200167typedef struct mbedtls_asn1_bitstring
Paul Bakkerefc30292011-11-10 14:43:23 +0000168{
Manuel Pégourié-Gonnardb8186a52015-06-18 14:58:58 +0200169 size_t len; /**< ASN1 length, in octets. */
Paul Bakkerefc30292011-11-10 14:43:23 +0000170 unsigned char unused_bits; /**< Number of unused bits at the end of the string */
171 unsigned char *p; /**< Raw ASN1 data for the bit string */
172}
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200173mbedtls_asn1_bitstring;
Paul Bakkerefc30292011-11-10 14:43:23 +0000174
175/**
176 * Container for a sequence of ASN.1 items
177 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200178typedef struct mbedtls_asn1_sequence
Paul Bakkerefc30292011-11-10 14:43:23 +0000179{
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200180 mbedtls_asn1_buf buf; /**< Buffer containing the given ASN.1 item. */
181 struct mbedtls_asn1_sequence *next; /**< The next entry in the sequence. */
Paul Bakkerefc30292011-11-10 14:43:23 +0000182}
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200183mbedtls_asn1_sequence;
Paul Bakkerefc30292011-11-10 14:43:23 +0000184
185/**
Paul Bakkere5eae762013-08-26 12:05:14 +0200186 * Container for a sequence or list of 'named' ASN.1 data items
187 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200188typedef struct mbedtls_asn1_named_data
Paul Bakkere5eae762013-08-26 12:05:14 +0200189{
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200190 mbedtls_asn1_buf oid; /**< The object identifier. */
191 mbedtls_asn1_buf val; /**< The named value. */
192 struct mbedtls_asn1_named_data *next; /**< The next entry in the sequence. */
Manuel Pégourié-Gonnard555fbf82015-02-04 17:11:55 +0000193 unsigned char next_merged; /**< Merge next item into the current one? */
Paul Bakkere5eae762013-08-26 12:05:14 +0200194}
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200195mbedtls_asn1_named_data;
Paul Bakkere5eae762013-08-26 12:05:14 +0200196
197/**
Paul Bakkercdda0972013-09-09 12:51:29 +0200198 * \brief Get the length of an ASN.1 element.
199 * Updates the pointer to immediately behind the length.
Paul Bakkerefc30292011-11-10 14:43:23 +0000200 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100201 * \param p On entry, \c *p points to the first byte of the length,
202 * i.e. immediately after the tag.
203 * On successful completion, \c *p points to the first byte
204 * after the length, i.e. the first byte of the content.
205 * On error, the value of \c *p is undefined.
206 * \param end End of data.
Gilles Peskinedc2db482019-09-20 21:06:01 +0200207 * \param len On successful completion, \c *len contains the length
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100208 * read from the ASN.1 input.
Paul Bakkerefc30292011-11-10 14:43:23 +0000209 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100210 * \return 0 if successful.
211 * \return #MBEDTLS_ERR_ASN1_OUT_OF_DATA if the ASN.1 element
212 * would end beyond \p end.
213 * \return #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the length is unparseable.
Paul Bakkerefc30292011-11-10 14:43:23 +0000214 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200215int mbedtls_asn1_get_len( unsigned char **p,
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100216 const unsigned char *end,
217 size_t *len );
Paul Bakkerefc30292011-11-10 14:43:23 +0000218
219/**
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100220 * \brief Get the tag and length of the element.
221 * Check for the requested tag.
Paul Bakkercdda0972013-09-09 12:51:29 +0200222 * Updates the pointer to immediately behind the tag and length.
Paul Bakkerefc30292011-11-10 14:43:23 +0000223 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100224 * \param p On entry, \c *p points to the start of the ASN.1 element.
225 * On successful completion, \c *p points to the first byte
226 * after the length, i.e. the first byte of the content.
227 * On error, the value of \c *p is undefined.
228 * \param end End of data.
Gilles Peskinedc2db482019-09-20 21:06:01 +0200229 * \param len On successful completion, \c *len contains the length
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100230 * read from the ASN.1 input.
231 * \param tag The expected tag.
Paul Bakkerefc30292011-11-10 14:43:23 +0000232 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100233 * \return 0 if successful.
234 * \return #MBEDTLS_ERR_ASN1_UNEXPECTED_TAG if the data does not start
235 * with the requested tag.
236 * \return #MBEDTLS_ERR_ASN1_OUT_OF_DATA if the ASN.1 element
237 * would end beyond \p end.
238 * \return #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the length is unparseable.
Paul Bakkerefc30292011-11-10 14:43:23 +0000239 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200240int mbedtls_asn1_get_tag( unsigned char **p,
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100241 const unsigned char *end,
242 size_t *len, int tag );
Paul Bakkerefc30292011-11-10 14:43:23 +0000243
244/**
Paul Bakkercdda0972013-09-09 12:51:29 +0200245 * \brief Retrieve a boolean ASN.1 tag and its value.
246 * Updates the pointer to immediately behind the full tag.
Paul Bakkerefc30292011-11-10 14:43:23 +0000247 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100248 * \param p On entry, \c *p points to the start of the ASN.1 element.
249 * On successful completion, \c *p points to the first byte
250 * beyond the ASN.1 element.
251 * On error, the value of \c *p is undefined.
252 * \param end End of data.
253 * \param val On success, the parsed value (\c 0 or \c 1).
Paul Bakkerefc30292011-11-10 14:43:23 +0000254 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100255 * \return 0 if successful.
256 * \return An ASN.1 error code if the input does not start with
257 * a valid ASN.1 BOOLEAN.
Paul Bakkerefc30292011-11-10 14:43:23 +0000258 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200259int mbedtls_asn1_get_bool( unsigned char **p,
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100260 const unsigned char *end,
261 int *val );
Paul Bakkerefc30292011-11-10 14:43:23 +0000262
263/**
Paul Bakkercdda0972013-09-09 12:51:29 +0200264 * \brief Retrieve an integer ASN.1 tag and its value.
265 * Updates the pointer to immediately behind the full tag.
Paul Bakkerefc30292011-11-10 14:43:23 +0000266 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100267 * \param p On entry, \c *p points to the start of the ASN.1 element.
268 * On successful completion, \c *p points to the first byte
269 * beyond the ASN.1 element.
270 * On error, the value of \c *p is undefined.
271 * \param end End of data.
272 * \param val On success, the parsed value.
Paul Bakkerefc30292011-11-10 14:43:23 +0000273 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100274 * \return 0 if successful.
275 * \return An ASN.1 error code if the input does not start with
276 * a valid ASN.1 INTEGER.
277 * \return #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the parsed value does
278 * not fit in an \c int.
Paul Bakkerefc30292011-11-10 14:43:23 +0000279 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200280int mbedtls_asn1_get_int( unsigned char **p,
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100281 const unsigned char *end,
282 int *val );
Paul Bakkerefc30292011-11-10 14:43:23 +0000283
284/**
Mykhailo Sopiha20180ca2019-10-29 15:58:10 +0200285 * \brief Retrieve an enumerated ASN.1 tag and its value.
286 * Updates the pointer to immediately behind the full tag.
287 *
288 * \param p On entry, \c *p points to the start of the ASN.1 element.
289 * On successful completion, \c *p points to the first byte
290 * beyond the ASN.1 element.
291 * On error, the value of \c *p is undefined.
292 * \param end End of data.
293 * \param val On success, the parsed value.
294 *
295 * \return 0 if successful.
296 * \return An ASN.1 error code if the input does not start with
297 * a valid ASN.1 ENUMERATED.
298 * \return #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the parsed value does
299 * not fit in an \c int.
300 */
301int mbedtls_asn1_get_enum( unsigned char **p,
302 const unsigned char *end,
303 int *val );
304
305/**
Paul Bakkercdda0972013-09-09 12:51:29 +0200306 * \brief Retrieve a bitstring ASN.1 tag and its value.
307 * Updates the pointer to immediately behind the full tag.
Paul Bakkerefc30292011-11-10 14:43:23 +0000308 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100309 * \param p On entry, \c *p points to the start of the ASN.1 element.
310 * On successful completion, \c *p is equal to \p end.
311 * On error, the value of \c *p is undefined.
312 * \param end End of data.
313 * \param bs On success, ::mbedtls_asn1_bitstring information about
314 * the parsed value.
Paul Bakkerefc30292011-11-10 14:43:23 +0000315 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100316 * \return 0 if successful.
317 * \return #MBEDTLS_ERR_ASN1_LENGTH_MISMATCH if the input contains
318 * extra data after a valid BIT STRING.
319 * \return An ASN.1 error code if the input does not start with
320 * a valid ASN.1 BIT STRING.
Paul Bakkerefc30292011-11-10 14:43:23 +0000321 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200322int mbedtls_asn1_get_bitstring( unsigned char **p, const unsigned char *end,
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100323 mbedtls_asn1_bitstring *bs );
Paul Bakkerefc30292011-11-10 14:43:23 +0000324
325/**
Paul Bakkercdda0972013-09-09 12:51:29 +0200326 * \brief Retrieve a bitstring ASN.1 tag without unused bits and its
327 * value.
328 * Updates the pointer to the beginning of the bit/octet string.
Manuel Pégourié-Gonnarda2d4e642013-07-11 13:59:02 +0200329 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100330 * \param p On entry, \c *p points to the start of the ASN.1 element.
331 * On successful completion, \c *p points to the first byte
332 * of the content of the BIT STRING.
333 * On error, the value of \c *p is undefined.
334 * \param end End of data.
335 * \param len On success, \c *len is the length of the content in bytes.
Manuel Pégourié-Gonnarda2d4e642013-07-11 13:59:02 +0200336 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100337 * \return 0 if successful.
338 * \return #MBEDTLS_ERR_ASN1_INVALID_DATA if the input starts with
339 * a valid BIT STRING with a nonzero number of unused bits.
340 * \return An ASN.1 error code if the input does not start with
341 * a valid ASN.1 BIT STRING.
Manuel Pégourié-Gonnarda2d4e642013-07-11 13:59:02 +0200342 */
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100343int mbedtls_asn1_get_bitstring_null( unsigned char **p,
344 const unsigned char *end,
345 size_t *len );
Manuel Pégourié-Gonnarda2d4e642013-07-11 13:59:02 +0200346
347/**
Gilles Peskinedc2db482019-09-20 21:06:01 +0200348 * \brief Parses and splits an ASN.1 "SEQUENCE OF <tag>".
349 * Updates the pointer to immediately behind the full sequence tag.
Paul Bakkerefc30292011-11-10 14:43:23 +0000350 *
Hanno Becker12ae27d2019-09-11 14:20:09 +0100351 * This function allocates memory for the sequence elements. You can free
352 * the allocated memory with mbedtls_asn1_sequence_free().
353 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100354 * \note On error, this function may return a partial list in \p cur.
355 * You must set `cur->next = NULL` before calling this function!
356 * Otherwise it is impossible to distinguish a previously non-null
357 * pointer from a pointer to an object allocated by this function.
Paul Bakkerefc30292011-11-10 14:43:23 +0000358 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100359 * \note If the sequence is empty, this function does not modify
360 * \c *cur. If the sequence is valid and non-empty, this
361 * function sets `cur->buf.tag` to \p tag. This allows
362 * callers to distinguish between an empty sequence and
363 * a one-element sequence.
364 *
365 * \param p On entry, \c *p points to the start of the ASN.1 element.
366 * On successful completion, \c *p is equal to \p end.
367 * On error, the value of \c *p is undefined.
368 * \param end End of data.
369 * \param cur A ::mbedtls_asn1_sequence which this function fills.
370 * When this function returns, \c *cur is the head of a linked
371 * list. Each node in this list is allocated with
372 * mbedtls_calloc() apart from \p cur itself, and should
373 * therefore be freed with mbedtls_free().
374 * The list describes the content of the sequence.
375 * The head of the list (i.e. \c *cur itself) describes the
376 * first element, `*cur->next` describes the second element, etc.
377 * For each element, `buf.tag == tag`, `buf.len` is the length
378 * of the content of the content of the element, and `buf.p`
379 * points to the first byte of the content (i.e. immediately
380 * past the length of the element).
381 * Note that list elements may be allocated even on error.
382 * \param tag Each element of the sequence must have this tag.
383 *
384 * \return 0 if successful.
385 * \return #MBEDTLS_ERR_ASN1_LENGTH_MISMATCH if the input contains
386 * extra data after a valid SEQUENCE OF \p tag.
Gilles Peskineb5c74a52019-10-30 17:07:02 +0100387 * \return #MBEDTLS_ERR_ASN1_UNEXPECTED_TAG if the input starts with
388 * an ASN.1 SEQUENCE in which an element has a tag that
389 * is different from \p tag.
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100390 * \return #MBEDTLS_ERR_ASN1_ALLOC_FAILED if a memory allocation failed.
391 * \return An ASN.1 error code if the input does not start with
Gilles Peskineb5c74a52019-10-30 17:07:02 +0100392 * a valid ASN.1 SEQUENCE.
Paul Bakkerefc30292011-11-10 14:43:23 +0000393 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200394int mbedtls_asn1_get_sequence_of( unsigned char **p,
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100395 const unsigned char *end,
396 mbedtls_asn1_sequence *cur,
397 int tag );
Hanno Becker12ae27d2019-09-11 14:20:09 +0100398/**
399 * \brief Free a heap-allocated linked list presentation of
400 * an ASN.1 sequence, including the first element.
401 *
402 * There are two common ways to manage the memory used for the representation
403 * of a parsed ASN.1 sequence:
404 * - Allocate a head node `mbedtls_asn1_sequence *head` with mbedtls_calloc().
405 * Pass this node as the `cur` argument to mbedtls_asn1_get_sequence_of().
406 * When you have finished processing the sequence,
407 * call mbedtls_asn1_sequence_free() on `head`.
408 * - Allocate a head node `mbedtls_asn1_sequence *head` in any manner,
409 * for example on the stack. Make sure that `head->next == NULL`.
410 * Pass `head` as the `cur` argument to mbedtls_asn1_get_sequence_of().
411 * When you have finished processing the sequence,
412 * call mbedtls_asn1_sequence_free() on `head->cur`,
413 * then free `head` itself in the appropriate manner.
414 *
415 * \param seq The address of the first sequence component. This may
416 * be \c NULL, in which case this functions returns
417 * immediately.
418 */
419void mbedtls_asn1_sequence_free( mbedtls_asn1_sequence *seq );
Paul Bakkerefc30292011-11-10 14:43:23 +0000420
Hanno Becker199b7092019-09-11 14:21:26 +0100421/**
422 * \brief Traverse an ASN.1 SEQUENCE container and
423 * call a callback for each entry.
424 *
425 * This function checks that the input is a SEQUENCE of elements that
426 * each have a "must" tag, and calls a callback function on the elements
427 * that have a "may" tag.
428 *
429 * For example, to validate that the input is a SEQUENCE of `tag1` and call
430 * `cb` on each element, use
431 * ```
432 * mbedtls_asn1_traverse_sequence_of(&p, end, 0xff, tag1, 0, 0, cb, ctx);
433 * ```
434 *
435 * To validate that the input is a SEQUENCE of ANY and call `cb` on
436 * each element, use
437 * ```
438 * mbedtls_asn1_traverse_sequence_of(&p, end, 0, 0, 0, 0, cb, ctx);
439 * ```
440 *
441 * To validate that the input is a SEQUENCE of CHOICE {NULL, OCTET STRING}
442 * and call `cb` on each element that is an OCTET STRING, use
443 * ```
444 * mbedtls_asn1_traverse_sequence_of(&p, end, 0xfe, 0x04, 0xff, 0x04, cb, ctx);
445 * ```
446 *
447 * The callback is called on the elements with a "may" tag from left to
448 * right. If the input is not a valid SEQUENCE of elements with a "must" tag,
449 * the callback is called on the elements up to the leftmost point where
450 * the input is invalid.
451 *
452 * \warning This function is still experimental and may change
453 * at any time.
454 *
455 * \param p The address of the pointer to the beginning of
456 * the ASN.1 SEQUENCE header. This is updated to
457 * point to the end of the ASN.1 SEQUENCE container
458 * on a successful invocation.
459 * \param end The end of the ASN.1 SEQUENCE container.
460 * \param tag_must_mask A mask to be applied to the ASN.1 tags found within
461 * the SEQUENCE before comparing to \p tag_must_value.
462 * \param tag_must_val The required value of each ASN.1 tag found in the
463 * SEQUENCE, after masking with \p tag_must_mask.
464 * Mismatching tags lead to an error.
465 * For example, a value of \c 0 for both \p tag_must_mask
466 * and \p tag_must_val means that every tag is allowed,
467 * while a value of \c 0xFF for \p tag_must_mask means
468 * that \p tag_must_val is the only allowed tag.
469 * \param tag_may_mask A mask to be applied to the ASN.1 tags found within
470 * the SEQUENCE before comparing to \p tag_may_value.
471 * \param tag_may_val The desired value of each ASN.1 tag found in the
472 * SEQUENCE, after masking with \p tag_may_mask.
473 * Mismatching tags will be silently ignored.
474 * For example, a value of \c 0 for \p tag_may_mask and
475 * \p tag_may_val means that any tag will be considered,
476 * while a value of \c 0xFF for \p tag_may_mask means
477 * that all tags with value different from \p tag_may_val
478 * will be ignored.
479 * \param cb The callback to trigger for each component
480 * in the ASN.1 SEQUENCE that matches \p tag_may_val.
481 * The callback function is called with the following
482 * parameters:
483 * - \p ctx.
484 * - The tag of the current element.
485 * - A pointer to the start of the current element's
486 * content inside the input.
487 * - The length of the content of the current element.
488 * If the callback returns a non-zero value,
489 * the function stops immediately,
490 * forwarding the callback's return value.
491 * \param ctx The context to be passed to the callback \p cb.
492 *
493 * \return \c 0 if successful the entire ASN.1 SEQUENCE
494 * was traversed without parsing or callback errors.
495 * \return #MBEDTLS_ERR_ASN1_LENGTH_MISMATCH if the input
496 * contains extra data after a valid SEQUENCE
497 * of elements with an accepted tag.
498 * \return #MBEDTLS_ERR_ASN1_UNEXPECTED_TAG if the input starts
499 * with an ASN.1 SEQUENCE in which an element has a tag
500 * that is not accepted.
501 * \return An ASN.1 error code if the input does not start with
502 * a valid ASN.1 SEQUENCE.
503 * \return A non-zero error code forwarded from the callback
504 * \p cb in case the latter returns a non-zero value.
505 */
506int mbedtls_asn1_traverse_sequence_of(
507 unsigned char **p,
508 const unsigned char *end,
Hanno Becker34aada22020-02-03 10:39:55 +0000509 unsigned char tag_must_mask, unsigned char tag_must_val,
510 unsigned char tag_may_mask, unsigned char tag_may_val,
Hanno Becker199b7092019-09-11 14:21:26 +0100511 int (*cb)( void *ctx, int tag,
512 unsigned char* start, size_t len ),
513 void *ctx );
514
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200515#if defined(MBEDTLS_BIGNUM_C)
Paul Bakkerefc30292011-11-10 14:43:23 +0000516/**
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100517 * \brief Retrieve an integer ASN.1 tag and its value.
Paul Bakkercdda0972013-09-09 12:51:29 +0200518 * Updates the pointer to immediately behind the full tag.
Paul Bakkerefc30292011-11-10 14:43:23 +0000519 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100520 * \param p On entry, \c *p points to the start of the ASN.1 element.
521 * On successful completion, \c *p points to the first byte
522 * beyond the ASN.1 element.
523 * On error, the value of \c *p is undefined.
524 * \param end End of data.
525 * \param X On success, the parsed value.
Paul Bakkerefc30292011-11-10 14:43:23 +0000526 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100527 * \return 0 if successful.
528 * \return An ASN.1 error code if the input does not start with
529 * a valid ASN.1 INTEGER.
530 * \return #MBEDTLS_ERR_ASN1_INVALID_LENGTH if the parsed value does
531 * not fit in an \c int.
532 * \return An MPI error code if the parsed value is too large.
Paul Bakkerefc30292011-11-10 14:43:23 +0000533 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200534int mbedtls_asn1_get_mpi( unsigned char **p,
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100535 const unsigned char *end,
536 mbedtls_mpi *X );
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200537#endif /* MBEDTLS_BIGNUM_C */
Paul Bakkerefc30292011-11-10 14:43:23 +0000538
Paul Bakkerf8d018a2013-06-29 12:16:17 +0200539/**
Paul Bakkercdda0972013-09-09 12:51:29 +0200540 * \brief Retrieve an AlgorithmIdentifier ASN.1 sequence.
541 * Updates the pointer to immediately behind the full
542 * AlgorithmIdentifier.
Paul Bakkerf8d018a2013-06-29 12:16:17 +0200543 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100544 * \param p On entry, \c *p points to the start of the ASN.1 element.
545 * On successful completion, \c *p points to the first byte
546 * beyond the AlgorithmIdentifier element.
547 * On error, the value of \c *p is undefined.
548 * \param end End of data.
549 * \param alg The buffer to receive the OID.
550 * \param params The buffer to receive the parameters.
551 * This is zeroized if there are no parameters.
Paul Bakkerf8d018a2013-06-29 12:16:17 +0200552 *
553 * \return 0 if successful or a specific ASN.1 or MPI error code.
554 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200555int mbedtls_asn1_get_alg( unsigned char **p,
Paul Bakkerf8d018a2013-06-29 12:16:17 +0200556 const unsigned char *end,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200557 mbedtls_asn1_buf *alg, mbedtls_asn1_buf *params );
Paul Bakkerf8d018a2013-06-29 12:16:17 +0200558
559/**
Paul Bakkercdda0972013-09-09 12:51:29 +0200560 * \brief Retrieve an AlgorithmIdentifier ASN.1 sequence with NULL or no
561 * params.
562 * Updates the pointer to immediately behind the full
563 * AlgorithmIdentifier.
Paul Bakkerf8d018a2013-06-29 12:16:17 +0200564 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100565 * \param p On entry, \c *p points to the start of the ASN.1 element.
566 * On successful completion, \c *p points to the first byte
567 * beyond the AlgorithmIdentifier element.
568 * On error, the value of \c *p is undefined.
569 * \param end End of data.
570 * \param alg The buffer to receive the OID.
Paul Bakkerf8d018a2013-06-29 12:16:17 +0200571 *
572 * \return 0 if successful or a specific ASN.1 or MPI error code.
573 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200574int mbedtls_asn1_get_alg_null( unsigned char **p,
Paul Bakkerf8d018a2013-06-29 12:16:17 +0200575 const unsigned char *end,
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200576 mbedtls_asn1_buf *alg );
Paul Bakkerf8d018a2013-06-29 12:16:17 +0200577
Paul Bakkere5eae762013-08-26 12:05:14 +0200578/**
Paul Bakkercdda0972013-09-09 12:51:29 +0200579 * \brief Find a specific named_data entry in a sequence or list based on
580 * the OID.
Paul Bakkere5eae762013-08-26 12:05:14 +0200581 *
582 * \param list The list to seek through
583 * \param oid The OID to look for
584 * \param len Size of the OID
585 *
586 * \return NULL if not found, or a pointer to the existing entry.
587 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200588mbedtls_asn1_named_data *mbedtls_asn1_find_named_data( mbedtls_asn1_named_data *list,
Paul Bakkere5eae762013-08-26 12:05:14 +0200589 const char *oid, size_t len );
590
591/**
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200592 * \brief Free a mbedtls_asn1_named_data entry
Paul Bakkere5eae762013-08-26 12:05:14 +0200593 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100594 * \param entry The named data entry to free.
595 * This function calls mbedtls_free() on
596 * `entry->oid.p` and `entry->val.p`.
Paul Bakkere5eae762013-08-26 12:05:14 +0200597 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200598void mbedtls_asn1_free_named_data( mbedtls_asn1_named_data *entry );
Paul Bakkere5eae762013-08-26 12:05:14 +0200599
Paul Bakkerc547cc92013-09-09 12:01:23 +0200600/**
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100601 * \brief Free all entries in a mbedtls_asn1_named_data list.
Paul Bakkerc547cc92013-09-09 12:01:23 +0200602 *
Gilles Peskinebcbe1df2019-03-01 17:57:43 +0100603 * \param head Pointer to the head of the list of named data entries to free.
604 * This function calls mbedtls_asn1_free_named_data() and
605 * mbedtls_free() on each list element and
606 * sets \c *head to \c NULL.
Paul Bakkerc547cc92013-09-09 12:01:23 +0200607 */
Manuel Pégourié-Gonnard2cf5a7c2015-04-08 12:49:31 +0200608void mbedtls_asn1_free_named_data_list( mbedtls_asn1_named_data **head );
Paul Bakkerc547cc92013-09-09 12:01:23 +0200609
Paul Bakkerefc30292011-11-10 14:43:23 +0000610#ifdef __cplusplus
611}
612#endif
613
614#endif /* asn1.h */