make compile
[heimdal.git] / lib / asn1 / extra.c
blobb244dbb52a3075aa23f64117411f02b3e054ec68
1 /*
2 * Copyright (c) 2003 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
34 #include "der_locl.h"
35 #include "heim_asn1.h"
37 RCSID("$Id$");
39 int
40 encode_heim_any(unsigned char *p, size_t len,
41 const heim_any *data, size_t *size)
43 if (data->length > len)
44 return ASN1_OVERFLOW;
45 p -= data->length;
46 len -= data->length;
47 memcpy (p+1, data->data, data->length);
48 *size = data->length;
49 return 0;
52 int
53 decode_heim_any(const unsigned char *p, size_t len,
54 heim_any *data, size_t *size)
56 size_t len_len, length, l;
57 Der_class thisclass;
58 Der_type thistype;
59 unsigned int thistag;
60 int e;
62 memset(data, 0, sizeof(*data));
64 e = der_get_tag (p, len, &thisclass, &thistype, &thistag, &l);
65 if (e) return e;
66 if (l > len)
67 return ASN1_OVERFLOW;
68 e = der_get_length(p + l, len - l, &length, &len_len);
69 if (e) return e;
70 if (length == ASN1_INDEFINITE) {
71 if (len < len_len + l)
72 return ASN1_OVERFLOW;
73 length = len - (len_len + l);
74 } else {
75 if (len < length + len_len + l)
76 return ASN1_OVERFLOW;
79 data->data = malloc(length + len_len + l);
80 if (data->data == NULL)
81 return ENOMEM;
82 data->length = length + len_len + l;
83 memcpy(data->data, p, length + len_len + l);
85 if (size)
86 *size = length + len_len + l;
88 return 0;
91 void
92 free_heim_any(heim_any *data)
94 free(data->data);
95 data->data = NULL;
98 size_t
99 length_heim_any(const heim_any *data)
101 return data->length;
105 copy_heim_any(const heim_any *from, heim_any *to)
107 to->data = malloc(from->length);
108 if (to->data == NULL && from->length != 0)
109 return ENOMEM;
110 memcpy(to->data, from->data, from->length);
111 to->length = from->length;
112 return 0;
116 encode_heim_any_set(unsigned char *p, size_t len,
117 const heim_any_set *data, size_t *size)
119 return encode_heim_any(p, len, data, size);
124 decode_heim_any_set(const unsigned char *p, size_t len,
125 heim_any_set *data, size_t *size)
127 memset(data, 0, sizeof(*data));
128 data->data = malloc(len);
129 if (data->data == NULL && len != 0)
130 return ENOMEM;
131 data->length = len;
132 memcpy(data->data, p, len);
133 if (size) *size = len;
134 return 0;
137 void
138 free_heim_any_set(heim_any_set *data)
140 free_heim_any(data);
143 size_t
144 length_heim_any_set(const heim_any *data)
146 return length_heim_any(data);
150 copy_heim_any_set(const heim_any_set *from, heim_any_set *to)
152 return copy_heim_any(from, to);
156 heim_any_cmp(const heim_any_set *p, const heim_any_set *q)
158 if (p->length != q->length)
159 return p->length - q->length;
160 return memcmp(p->data, q->data, p->length);