mbedtls_asn1_sequence::next - syntax, references, description

References

Code

Location

Referrer

struct mbedtls_asn1_sequence *next; /**< The next entry in the sequence. */

asn1.h:159

cur->next = (mbedtls_asn1_sequence*)mbedtls_calloc( 1,

asn1parse.c:268

mbedtls_asn1_get_sequence_of()

if( cur->next == NULL )

asn1parse.c:271

mbedtls_asn1_get_sequence_of()

cur = cur->next;

asn1parse.c:274

mbedtls_asn1_get_sequence_of()

cur->next = NULL;

asn1parse.c:279

mbedtls_asn1_get_sequence_of()

if( cur->next != NULL )

x509_crt.c:661

x509_get_subject_alt_name()

cur->next = mbedtls_calloc( 1, sizeof( mbedtls_asn1_sequence ) );

x509_crt.c:664

x509_get_subject_alt_name()

if( cur->next == NULL )

x509_crt.c:666

x509_get_subject_alt_name()

cur = cur->next;

x509_crt.c:670

x509_get_subject_alt_name()

cur->next = NULL;

x509_crt.c:681

x509_get_subject_alt_name()

cur = cur->next;

x509_crt.c:1422

x509_info_subject_alt_name()

cur = cur->next;

x509_crt.c:1515

x509_info_ext_key_usage()

for( cur = &crt->subject_alt_names; cur != NULL; cur = cur->next )

x509_crt.c:2440

x509_crt_verify_name()

seq_cur = cert_cur->ext_key_usage.next;

x509_crt.c:2657

mbedtls_x509_crt_free()

seq_cur = seq_cur->next;

x509_crt.c:2661

mbedtls_x509_crt_free()

seq_cur = cert_cur->subject_alt_names.next;

x509_crt.c:2667

mbedtls_x509_crt_free()

seq_cur = seq_cur->next;

x509_crt.c:2671

mbedtls_x509_crt_free()

Call Tree

All items filtered out

Data Use

mbedtls_asn1_sequence::next is written by 2 functions and is read by 6 functions:

mbedtls_asn1_get_sequence_of()

x509_get_subject_alt_name()

mbedtls_asn1_sequence::next

mbedtls_asn1_get_sequence_of()

x509_get_subject_alt_name()

x509_info_subject_alt_name()

x509_info_ext_key_usage()

x509_crt_verify_name()

mbedtls_x509_crt_free()

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

All items filtered out

mbedtls_asn1_sequence::next field

Syntax

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle