No empty .Rs/.Re
[netbsd-mini2440.git] / crypto / dist / heimdal / lib / asn1 / der_format.c
blobd095c97b3e54a1e42268c5e2dd0278a2e8636dad
1 /*
2 * Copyright (c) 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 <hex.h>
37 __RCSID("$Heimdal: der_format.c 20861 2007-06-03 20:18:29Z lha $"
38 "$NetBSD$");
40 int
41 der_parse_hex_heim_integer (const char *p, heim_integer *data)
43 ssize_t len;
45 data->length = 0;
46 data->negative = 0;
47 data->data = NULL;
49 if (*p == '-') {
50 p++;
51 data->negative = 1;
54 len = strlen(p);
55 if (len <= 0) {
56 data->data = NULL;
57 data->length = 0;
58 return EINVAL;
61 data->length = (len / 2) + 1;
62 data->data = malloc(data->length);
63 if (data->data == NULL) {
64 data->length = 0;
65 return ENOMEM;
68 len = hex_decode(p, data->data, data->length);
69 if (len < 0) {
70 free(data->data);
71 data->data = NULL;
72 data->length = 0;
73 return EINVAL;
77 unsigned char *q = data->data;
78 while(len > 0 && *q == 0) {
79 q++;
80 len--;
82 data->length = len;
83 memmove(data->data, q, len);
85 return 0;
88 int
89 der_print_hex_heim_integer (const heim_integer *data, char **p)
91 ssize_t len;
92 char *q;
94 len = hex_encode(data->data, data->length, p);
95 if (len < 0)
96 return ENOMEM;
98 if (data->negative) {
99 len = asprintf(&q, "-%s", *p);
100 free(*p);
101 if (len < 0)
102 return ENOMEM;
103 *p = q;
105 return 0;
109 der_print_heim_oid (const heim_oid *oid, char delim, char **str)
111 struct rk_strpool *p = NULL;
112 int i;
114 if (oid->length == 0)
115 return EINVAL;
117 for (i = 0; i < oid->length ; i++) {
118 p = rk_strpoolprintf(p, "%d", oid->components[i]);
119 if (p && i < oid->length - 1)
120 p = rk_strpoolprintf(p, "%c", delim);
121 if (p == NULL) {
122 *str = NULL;
123 return ENOMEM;
127 *str = rk_strpoolcollect(p);
128 if (*str == NULL)
129 return ENOMEM;
130 return 0;
134 der_parse_heim_oid (const char *str, const char *sep, heim_oid *data)
136 char *s, *w, *brkt, *endptr;
137 unsigned int *c;
138 long l;
140 data->length = 0;
141 data->components = NULL;
143 if (sep == NULL)
144 sep = ".";
146 s = strdup(str);
148 for (w = strtok_r(s, sep, &brkt);
149 w != NULL;
150 w = strtok_r(NULL, sep, &brkt)) {
152 c = realloc(data->components,
153 (data->length + 1) * sizeof(data->components[0]));
154 if (c == NULL) {
155 der_free_oid(data);
156 free(s);
157 return ENOMEM;
159 data->components = c;
161 l = strtol(w, &endptr, 10);
162 if (*endptr != '\0' || l < 0 || l > INT_MAX) {
163 der_free_oid(data);
164 free(s);
165 return EINVAL;
167 data->components[data->length++] = l;
169 free(s);
170 return 0;