2 * Copyright (c) 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
40 der_parse_hex_heim_integer (const char *p
, heim_integer
*data
)
60 data
->length
= (len
/ 2) + 1;
61 data
->data
= malloc(data
->length
);
62 if (data
->data
== NULL
) {
67 len
= hex_decode(p
, data
->data
, data
->length
);
76 unsigned char *q
= data
->data
;
77 while(len
> 0 && *q
== 0) {
82 memmove(data
->data
, q
, len
);
88 der_print_hex_heim_integer (const heim_integer
*data
, char **p
)
93 len
= hex_encode(data
->data
, data
->length
, p
);
98 len
= asprintf(&q
, "-%s", *p
);
108 der_print_heim_oid (const heim_oid
*oid
, char delim
, char **str
)
110 struct rk_strpool
*p
= NULL
;
113 if (oid
->length
== 0)
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
);
126 *str
= rk_strpoolcollect(p
);
133 der_parse_heim_oid (const char *str
, const char *sep
, heim_oid
*data
)
135 char *s
, *w
, *brkt
, *endptr
;
140 data
->components
= NULL
;
147 for (w
= strtok_r(s
, sep
, &brkt
);
149 w
= strtok_r(NULL
, sep
, &brkt
)) {
151 c
= realloc(data
->components
,
152 (data
->length
+ 1) * sizeof(data
->components
[0]));
158 data
->components
= c
;
160 l
= strtol(w
, &endptr
, 10);
161 if (*endptr
!= '\0' || l
< 0 || l
> INT_MAX
) {
166 data
->components
[data
->length
++] = l
;