/*

 * Copyright (C) 2000-2025 Free Software Foundation, Inc.

 *

 * This file is part of LIBTASN1.

 *

 * The LIBTASN1 library is free software; you can redistribute it

 * and/or modify it under the terms of the GNU Lesser General Public

 * License as published by the Free Software Foundation; either

 * version 2.1 of the License, or (at your option) any later version.

 *

 * This library is distributed in the hope that it will be useful, but

 * WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

 * Lesser General Public License for more details.

 *

 * You should have received a copy of the GNU Lesser General Public

 * License along with this library; if not, see

 * <https://www.gnu.org/licenses/>.

 */

#ifndef _ELEMENT_H

# define _ELEMENT_H

struct node_tail_cache_st

{

  asn1_node head;   /* the first element of the sequence */

  asn1_node tail;

};

int _asn1_append_sequence_set (asn1_node node,

             struct node_tail_cache_st *pcached);

int _asn1_convert_integer (const unsigned char *value,

         unsigned char *value_out,

         int value_out_size, int *len);

void _asn1_hierarchical_name (asn1_node_const node, char *name,

            int name_size);

static inline asn1_node_const

_asn1_node_array_get (const struct asn1_node_array_st *array, size_t position)

{

  return position < array->size ? array->nodes[position] : NULL;

}

Unexecuted instantiation: coding.c:_asn1_node_array_get

Unexecuted instantiation: decoding.c:_asn1_node_array_get

Unexecuted instantiation: element.c:_asn1_node_array_get

Unexecuted instantiation: parser_aux.c:_asn1_node_array_get

Unexecuted instantiation: structure.c:_asn1_node_array_get

int

_asn1_node_array_set (struct asn1_node_array_st *array, size_t position,

          asn1_node node);

#endif