diff options
author | Pawel Kowalski <p.kowalski2@partner.samsung.com> | 2019-08-28 14:28:40 +0200 |
---|---|---|
committer | Pawel Kowalski <p.kowalski2@partner.samsung.com> | 2019-08-28 14:28:40 +0200 |
commit | 26bea900a531662c6028ecc06f4adea825658434 (patch) | |
tree | 1db3d30bddc8b8336fa7a8f2bf5a3615001071e1 /lib/element.c | |
parent | e527f54afdf27ab8ce73a22d05d69e5482f5e92b (diff) | |
download | libtasn1-26bea900a531662c6028ecc06f4adea825658434.tar.gz libtasn1-26bea900a531662c6028ecc06f4adea825658434.tar.bz2 libtasn1-26bea900a531662c6028ecc06f4adea825658434.zip |
Imported Upstream version 4.14upstream/4.14
Diffstat (limited to 'lib/element.c')
-rw-r--r-- | lib/element.c | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/lib/element.c b/lib/element.c index b09f826..a4c61bb 100644 --- a/lib/element.c +++ b/lib/element.c @@ -34,9 +34,9 @@ #include "element.h" void -_asn1_hierarchical_name (asn1_node node, char *name, int name_size) +_asn1_hierarchical_name (asn1_node_const node, char *name, int name_size) { - asn1_node p; + asn1_node_const p; char tmp_name[64]; p = node; @@ -135,7 +135,7 @@ _asn1_convert_integer (const unsigned char *value, unsigned char *value_out, * The last element in the list may be provided in @pcache, to avoid * traversing the list, an expensive operation in long lists. * - * On success it returns in @pcache the added element (which is the + * On success it returns in @pcache the added element (which is the * tail in the list of added elements). */ int @@ -699,7 +699,7 @@ asn1_write_value (asn1_node node_root, const char *name, * @len: number of bytes of *value: value[0]..value[len-1]. Initialy * holds the sizeof value. * - * Returns the value of one element inside a structure. + * Returns the value of one element inside a structure. * If an element is OPTIONAL and this returns * %ASN1_ELEMENT_NOT_FOUND, it means that this element wasn't present * in the der encoding that created the structure. The first element @@ -757,7 +757,7 @@ asn1_write_value (asn1_node node_root, const char *name, * this function may return %ASN1_SUCCESS even if the provided @len is zero. **/ int -asn1_read_value (asn1_node root, const char *name, void *ivalue, int *len) +asn1_read_value (asn1_node_const root, const char *name, void *ivalue, int *len) { return asn1_read_value_type (root, name, ivalue, len, NULL); } @@ -772,7 +772,7 @@ asn1_read_value (asn1_node root, const char *name, void *ivalue, int *len) * holds the sizeof value. * @etype: The type of the value read (ASN1_ETYPE) * - * Returns the type and value of one element inside a structure. + * Returns the type and value of one element inside a structure. * If an element is OPTIONAL and this returns * %ASN1_ELEMENT_NOT_FOUND, it means that this element wasn't present * in the der encoding that created the structure. The first element @@ -831,10 +831,10 @@ asn1_read_value (asn1_node root, const char *name, void *ivalue, int *len) * this function may return %ASN1_SUCCESS even if the provided @len is zero. **/ int -asn1_read_value_type (asn1_node root, const char *name, void *ivalue, +asn1_read_value_type (asn1_node_const root, const char *name, void *ivalue, int *len, unsigned int *etype) { - asn1_node node, p, p2; + asn1_node_const node, p, p2; int len2, len3, result; int value_size = *len; unsigned char *value = ivalue; @@ -1025,7 +1025,7 @@ asn1_read_value_type (asn1_node root, const char *name, void *ivalue, * @name is not a valid element. **/ int -asn1_read_tag (asn1_node root, const char *name, int *tagValue, +asn1_read_tag (asn1_node_const root, const char *name, int *tagValue, int *classValue) { asn1_node node, p, pTag; @@ -1100,7 +1100,7 @@ asn1_read_tag (asn1_node root, const char *name, int *tagValue, * Returns: %ASN1_SUCCESS if the node exists. **/ int -asn1_read_node_value (asn1_node node, asn1_data_node_st * data) +asn1_read_node_value (asn1_node_const node, asn1_data_node_st * data) { data->name = node->name; data->value = node->value; |