2 * Copyright (c) 2003 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
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
35 #include "heim_asn1.h"
37 RCSID("$Id: extra.c 16672 2006-01-31 09:44:54Z lha $");
40 encode_heim_any(unsigned char *p, size_t len,
41 const heim_any *data, size_t *size)
43 if (data->length > len)
47 memcpy (p+1, data->data, data->length);
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;
62 memset(data, 0, sizeof(*data));
64 e = der_get_tag (p, len, &thisclass, &thistype, &thistag, &l);
68 e = der_get_length(p + l, len - l, &length, &len_len);
70 if (length + len_len + l > len)
73 data->data = malloc(length + len_len + l);
74 if (data->data == NULL)
76 data->length = length + len_len + l;
77 memcpy(data->data, p, length + len_len + l);
80 *size = length + len_len + l;
86 free_heim_any(heim_any *data)
93 length_heim_any(const heim_any *data)
99 copy_heim_any(const heim_any *from, heim_any *to)
101 to->data = malloc(from->length);
102 if (to->data == NULL && from->length != 0)
104 memcpy(to->data, from->data, from->length);
105 to->length = from->length;
110 encode_heim_any_set(unsigned char *p, size_t len,
111 const heim_any_set *data, size_t *size)
113 return encode_heim_any(p, len, data, size);
118 decode_heim_any_set(const unsigned char *p, size_t len,
119 heim_any_set *data, size_t *size)
121 memset(data, 0, sizeof(*data));
122 data->data = malloc(len);
123 if (data->data == NULL && len != 0)
126 memcpy(data->data, p, len);
127 if (size) *size = len;
132 free_heim_any_set(heim_any_set *data)
138 length_heim_any_set(const heim_any *data)
140 return length_heim_any(data);
144 copy_heim_any_set(const heim_any_set *from, heim_any_set *to)
146 return copy_heim_any(from, to);
150 heim_any_cmp(const heim_any_set *p, const heim_any_set *q)
152 if (p->length != q->length)
153 return p->length - q->length;
154 return memcmp(p->data, q->data, p->length);