1 /*
2 * Copyright (c) 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 *
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.
16 *
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.
20 *
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.
32 */
33
34 #include "der_locl.h"
35 #include <hex.h>
36
37 RCSID("$Id$");
38
39 int
der_parse_hex_heim_integer(const char * p,heim_integer * data)40 der_parse_hex_heim_integer (const char *p, heim_integer *data)
41 {
42 ssize_t len;
43
44 data->length = 0;
45 data->negative = 0;
46 data->data = NULL;
47
48 if (*p == '-') {
49 p++;
50 data->negative = 1;
51 }
52
53 len = strlen(p);
54 if (len <= 0) {
55 data->data = NULL;
56 data->length = 0;
57 return EINVAL;
58 }
59
60 data->length = (len / 2) + 1;
61 data->data = malloc(data->length);
62 if (data->data == NULL) {
63 data->length = 0;
64 return ENOMEM;
65 }
66
67 len = hex_decode(p, data->data, data->length);
68 if (len < 0) {
69 free(data->data);
70 data->data = NULL;
71 data->length = 0;
72 return EINVAL;
73 }
74
75 {
76 unsigned char *q = data->data;
77 while(len > 0 && *q == 0) {
78 q++;
79 len--;
80 }
81 data->length = len;
82 memmove(data->data, q, len);
83 }
84 return 0;
85 }
86
87 int
der_print_hex_heim_integer(const heim_integer * data,char ** p)88 der_print_hex_heim_integer (const heim_integer *data, char **p)
89 {
90 ssize_t len;
91 char *q;
92
93 len = hex_encode(data->data, data->length, p);
94 if (len < 0)
95 return ENOMEM;
96
97 if (data->negative) {
98 len = asprintf(&q, "-%s", *p);
99 free(*p);
100 if (len < 0)
101 return ENOMEM;
102 *p = q;
103 }
104 return 0;
105 }
106
107 int
der_print_heim_oid(const heim_oid * oid,char delim,char ** str)108 der_print_heim_oid (const heim_oid *oid, char delim, char **str)
109 {
110 struct rk_strpool *p = NULL;
111 size_t i;
112
113 if (oid->length == 0)
114 return EINVAL;
115
116 for (i = 0; i < oid->length ; i++) {
117 p = rk_strpoolprintf(p, "%d", oid->components[i]);
118 if (p && i < oid->length - 1)
119 p = rk_strpoolprintf(p, "%c", delim);
120 if (p == NULL) {
121 *str = NULL;
122 return ENOMEM;
123 }
124 }
125
126 *str = rk_strpoolcollect(p);
127 if (*str == NULL)
128 return ENOMEM;
129 return 0;
130 }
131
132 int
der_parse_heim_oid(const char * str,const char * sep,heim_oid * data)133 der_parse_heim_oid (const char *str, const char *sep, heim_oid *data)
134 {
135 char *s, *w, *brkt, *endptr;
136 unsigned int *c;
137 long l;
138
139 data->length = 0;
140 data->components = NULL;
141
142 if (sep == NULL)
143 sep = ".";
144
145 s = strdup(str);
146
147 for (w = strtok_r(s, sep, &brkt);
148 w != NULL;
149 w = strtok_r(NULL, sep, &brkt)) {
150
151 c = realloc(data->components,
152 (data->length + 1) * sizeof(data->components[0]));
153 if (c == NULL) {
154 der_free_oid(data);
155 free(s);
156 return ENOMEM;
157 }
158 data->components = c;
159
160 l = strtol(w, &endptr, 10);
161 if (*endptr != '\0' || l < 0 || l > INT_MAX) {
162 der_free_oid(data);
163 free(s);
164 return EINVAL;
165 }
166 data->components[data->length++] = l;
167 }
168 free(s);
169 return 0;
170 }
171