No empty .Rs/.Re
[netbsd-mini2440.git] / crypto / dist / heimdal / lib / asn1 / extra.c
blob684705c3755596ea04914a86ca45c6249acf6dd8
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("$Heimdal: extra.c 16672 2006-01-31 09:44:54Z lha $"
38 "$NetBSD$");
40 int
41 encode_heim_any(unsigned char *p, size_t len,
42 const heim_any *data, size_t *size)
44 if (data->length > len)
45 return ASN1_OVERFLOW;
46 p -= data->length;
47 len -= data->length;
48 memcpy (p+1, data->data, data->length);
49 *size = data->length;
50 return 0;
53 int
54 decode_heim_any(const unsigned char *p, size_t len,
55 heim_any *data, size_t *size)
57 size_t len_len, length, l;
58 Der_class thisclass;
59 Der_type thistype;
60 unsigned int thistag;
61 int e;
63 memset(data, 0, sizeof(*data));
65 e = der_get_tag (p, len, &thisclass, &thistype, &thistag, &l);
66 if (e) return e;
67 if (l > len)
68 return ASN1_OVERFLOW;
69 e = der_get_length(p + l, len - l, &length, &len_len);
70 if (e) return e;
71 if (length + len_len + l > len)
72 return ASN1_OVERFLOW;
74 data->data = malloc(length + len_len + l);
75 if (data->data == NULL)
76 return ENOMEM;
77 data->length = length + len_len + l;
78 memcpy(data->data, p, length + len_len + l);
80 if (size)
81 *size = length + len_len + l;
83 return 0;
86 void
87 free_heim_any(heim_any *data)
89 free(data->data);
90 data->data = NULL;
93 size_t
94 length_heim_any(const heim_any *data)
96 return data->length;
99 int
100 copy_heim_any(const heim_any *from, heim_any *to)
102 to->data = malloc(from->length);
103 if (to->data == NULL && from->length != 0)
104 return ENOMEM;
105 memcpy(to->data, from->data, from->length);
106 to->length = from->length;
107 return 0;
111 encode_heim_any_set(unsigned char *p, size_t len,
112 const heim_any_set *data, size_t *size)
114 return encode_heim_any(p, len, data, size);
119 decode_heim_any_set(const unsigned char *p, size_t len,
120 heim_any_set *data, size_t *size)
122 memset(data, 0, sizeof(*data));
123 data->data = malloc(len);
124 if (data->data == NULL && len != 0)
125 return ENOMEM;
126 data->length = len;
127 memcpy(data->data, p, len);
128 if (size) *size = len;
129 return 0;
132 void
133 free_heim_any_set(heim_any_set *data)
135 free_heim_any(data);
138 size_t
139 length_heim_any_set(const heim_any *data)
141 return length_heim_any(data);
145 copy_heim_any_set(const heim_any_set *from, heim_any_set *to)
147 return copy_heim_any(from, to);
151 heim_any_cmp(const heim_any_set *p, const heim_any_set *q)
153 if (p->length != q->length)
154 return p->length - q->length;
155 return memcmp(p->data, q->data, p->length);