2 * Copyright (c) 1997-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
36 RCSID("$Id: der_put.c,v 1.33 2005/07/12 06:27:23 lha Exp $");
39 * All encoding functions take a pointer `p' to first position in
40 * which to write, from the right, `len' which means the maximum
41 * number of characters we are able to write. The function returns
42 * the number of characters written in `size' (if non-NULL).
43 * The return value is 0 or an error.
47 der_put_unsigned (unsigned char *p, size_t len, const unsigned *v, size_t *size)
49 unsigned char *base = p;
53 while (len > 0 && val) {
79 der_put_integer (unsigned char *p, size_t len, const int *v, size_t *size)
81 unsigned char *base = p;
102 return ASN1_OVERFLOW;
109 return ASN1_OVERFLOW;
120 der_put_length (unsigned char *p, size_t len, size_t val, size_t *size)
123 return ASN1_OVERFLOW;
133 return ASN1_OVERFLOW;
147 der_put_boolean(unsigned char *p, size_t len, const int *data, size_t *size)
150 return ASN1_OVERFLOW;
160 der_put_general_string (unsigned char *p, size_t len,
161 const heim_general_string *str, size_t *size)
163 size_t slen = strlen(*str);
166 return ASN1_OVERFLOW;
169 memcpy (p+1, *str, slen);
175 der_put_utf8string (unsigned char *p, size_t len,
176 const heim_utf8_string *str, size_t *size)
178 return der_put_general_string(p, len, str, size);
182 der_put_printable_string (unsigned char *p, size_t len,
183 const heim_printable_string *str, size_t *size)
185 return der_put_general_string(p, len, str, size);
189 der_put_ia5_string (unsigned char *p, size_t len,
190 const heim_ia5_string *str, size_t *size)
192 return der_put_general_string(p, len, str, size);
196 der_put_bmp_string (unsigned char *p, size_t len,
197 const heim_bmp_string *data, size_t *size)
200 if (len / 2 < data->length)
201 return ASN1_OVERFLOW;
202 p -= data->length * 2;
203 len -= data->length * 2;
204 for (i = 0; i < data->length; i++) {
205 p[1] = (data->data[i] >> 8) & 0xff;
206 p[2] = data->data[i] & 0xff;
209 if (size) *size = data->length * 2;
214 der_put_universal_string (unsigned char *p, size_t len,
215 const heim_universal_string *data, size_t *size)
218 if (len / 4 < data->length)
219 return ASN1_OVERFLOW;
220 p -= data->length * 4;
221 len -= data->length * 4;
222 for (i = 0; i < data->length; i++) {
223 p[1] = (data->data[i] >> 24) & 0xff;
224 p[2] = (data->data[i] >> 16) & 0xff;
225 p[3] = (data->data[i] >> 8) & 0xff;
226 p[4] = data->data[i] & 0xff;
229 if (size) *size = data->length * 4;
234 der_put_octet_string (unsigned char *p, size_t len,
235 const heim_octet_string *data, size_t *size)
237 if (len < data->length)
238 return ASN1_OVERFLOW;
241 memcpy (p+1, data->data, data->length);
242 *size = data->length;
247 der_put_heim_integer (unsigned char *p, size_t len,
248 const heim_integer *data, size_t *size)
250 unsigned char *buf = data->data;
253 if (data->length == 0) {
255 return ASN1_OVERFLOW;
261 if (len < data->length)
262 return ASN1_OVERFLOW;
266 if (data->negative) {
268 for (i = data->length - 1, carry = 1; i >= 0; i--) {
276 return ASN1_OVERFLOW;
283 memcpy(p + 1, buf, data->length);
287 return ASN1_OVERFLOW;
294 *size = data->length + hibitset;
299 der_put_generalized_time (unsigned char *p, size_t len,
300 const time_t *data, size_t *size)
306 e = _heim_time2generalizedtime (*data, &k, 1);
309 e = der_put_octet_string(p, len, &k, &l);
319 der_put_utctime (unsigned char *p, size_t len,
320 const time_t *data, size_t *size)
326 e = _heim_time2generalizedtime (*data, &k, 0);
329 e = der_put_octet_string(p, len, &k, &l);
339 der_put_oid (unsigned char *p, size_t len,
340 const heim_oid *data, size_t *size)
342 unsigned char *base = p;
345 for (n = data->length - 1; n >= 2; --n) {
346 unsigned u = data->components[n];
349 return ASN1_OVERFLOW;
355 return ASN1_OVERFLOW;
356 *p-- = 128 + u % 128;
362 return ASN1_OVERFLOW;
363 *p-- = 40 * data->components[0] + data->components[1];
369 der_put_tag (unsigned char *p, size_t len, Der_class class, Der_type type,
370 unsigned int tag, size_t *size)
374 return ASN1_OVERFLOW;
375 *p = MAKE_TAG(class, type, tag);
379 unsigned int continuation = 0;
383 return ASN1_OVERFLOW;
384 *p-- = tag % 128 | continuation;
391 return ASN1_OVERFLOW;
392 *p-- = MAKE_TAG(class, type, 0x1f);
400 der_put_length_and_tag (unsigned char *p, size_t len, size_t len_val,
401 Der_class class, Der_type type,
402 unsigned int tag, size_t *size)
408 e = der_put_length (p, len, len_val, &l);
414 e = der_put_tag (p, len, class, type, tag, &l);
425 _heim_time2generalizedtime (time_t t, heim_octet_string *s, int gtimep)
428 const size_t len = gtimep ? 15 : 13;
430 s->data = malloc(len + 1);
436 snprintf (s->data, len + 1, "%04d%02d%02d%02d%02d%02dZ",
437 tm->tm_year + 1900, tm->tm_mon + 1, tm->tm_mday,
438 tm->tm_hour, tm->tm_min, tm->tm_sec);
440 snprintf (s->data, len + 1, "%02d%02d%02d%02d%02d%02dZ",
441 tm->tm_year % 100, tm->tm_mon + 1, tm->tm_mday,
442 tm->tm_hour, tm->tm_min, tm->tm_sec);
448 der_put_bit_string (unsigned char *p, size_t len,
449 const heim_bit_string *data, size_t *size)
451 size_t data_size = (data->length + 7) / 8;
452 if (len < data_size + 1)
453 return ASN1_OVERFLOW;
455 len -= data_size + 1;
456 memcpy (p+2, data->data, data_size);
457 if (data->length && (data->length % 8) != 0)
458 p[1] = 8 - (data->length % 8);
461 *size = data_size + 1;
466 _heim_der_set_sort(const void *a1, const void *a2)
468 const struct heim_octet_string *s1 = a1, *s2 = a2;
471 ret = memcmp(s1->data, s2->data,
472 s1->length < s2->length ? s1->length : s2->length);
475 return s1->length - s2->length;