2 * Copyright (c) 2004 - 2007 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
37 AlgorithmIdentifier alg
;
38 hx509_private_key private_key
;
39 heim_octet_string localKeyId
;
42 struct hx509_collector
{
44 hx509_certs unenvelop_certs
;
47 struct private_key
**data
;
54 _hx509_collector_alloc(hx509_context context
, hx509_lock lock
, struct hx509_collector
**collector
)
56 struct hx509_collector
*c
;
61 c
= calloc(1, sizeof(*c
));
63 hx509_set_error_string(context
, 0, ENOMEM
, "out of memory");
68 ret
= hx509_certs_init(context
, "MEMORY:collector-unenvelop-cert",
69 0,NULL
, &c
->unenvelop_certs
);
76 ret
= hx509_certs_init(context
, "MEMORY:collector-tmp-store",
79 hx509_certs_free(&c
->unenvelop_certs
);
89 _hx509_collector_get_lock(struct hx509_collector
*c
)
96 _hx509_collector_certs_add(hx509_context context
,
97 struct hx509_collector
*c
,
100 return hx509_certs_add(context
, c
->certs
, cert
);
104 free_private_key(struct private_key
*key
)
106 free_AlgorithmIdentifier(&key
->alg
);
107 if (key
->private_key
)
108 hx509_private_key_free(&key
->private_key
);
109 der_free_octet_string(&key
->localKeyId
);
114 _hx509_collector_private_key_add(hx509_context context
,
115 struct hx509_collector
*c
,
116 const AlgorithmIdentifier
*alg
,
117 hx509_private_key private_key
,
118 const heim_octet_string
*key_data
,
119 const heim_octet_string
*localKeyId
)
121 struct private_key
*key
;
125 key
= calloc(1, sizeof(*key
));
129 d
= realloc(c
->val
.data
, (c
->val
.len
+ 1) * sizeof(c
->val
.data
[0]));
132 hx509_set_error_string(context
, 0, ENOMEM
, "Out of memory");
137 ret
= copy_AlgorithmIdentifier(alg
, &key
->alg
);
139 hx509_set_error_string(context
, 0, ret
, "Failed to copy "
140 "AlgorithmIdentifier");
144 key
->private_key
= private_key
;
146 ret
= hx509_parse_private_key(context
, alg
,
147 key_data
->data
, key_data
->length
,
148 HX509_KEY_FORMAT_DER
,
154 ret
= der_copy_octet_string(localKeyId
, &key
->localKeyId
);
156 hx509_set_error_string(context
, 0, ret
,
157 "Failed to copy localKeyId");
161 memset(&key
->localKeyId
, 0, sizeof(key
->localKeyId
));
163 c
->val
.data
[c
->val
.len
] = key
;
168 free_private_key(key
);
174 match_localkeyid(hx509_context context
,
175 struct private_key
*value
,
182 if (value
->localKeyId
.length
== 0) {
183 hx509_set_error_string(context
, 0, HX509_LOCAL_ATTRIBUTE_MISSING
,
184 "No local key attribute on private key");
185 return HX509_LOCAL_ATTRIBUTE_MISSING
;
188 _hx509_query_clear(&q
);
189 q
.match
|= HX509_QUERY_MATCH_LOCAL_KEY_ID
;
191 q
.local_key_id
= &value
->localKeyId
;
193 ret
= hx509_certs_find(context
, certs
, &q
, &cert
);
196 if (value
->private_key
)
197 _hx509_cert_assign_key(cert
, value
->private_key
);
198 hx509_cert_free(cert
);
204 match_keys(hx509_context context
, struct private_key
*value
, hx509_certs certs
)
208 int ret
, found
= HX509_CERT_NOT_FOUND
;
210 if (value
->private_key
== NULL
) {
211 hx509_set_error_string(context
, 0, HX509_PRIVATE_KEY_MISSING
,
212 "No private key to compare with");
213 return HX509_PRIVATE_KEY_MISSING
;
216 ret
= hx509_certs_start_seq(context
, certs
, &cursor
);
222 ret
= hx509_certs_next_cert(context
, certs
, cursor
, &c
);
227 if (_hx509_cert_private_key(c
)) {
232 ret
= _hx509_match_keys(c
, value
->private_key
);
234 _hx509_cert_assign_key(c
, value
->private_key
);
242 hx509_certs_end_seq(context
, certs
, cursor
);
245 hx509_clear_error_string(context
);
251 _hx509_collector_collect_certs(hx509_context context
,
252 struct hx509_collector
*c
,
253 hx509_certs
*ret_certs
)
261 ret
= hx509_certs_init(context
, "MEMORY:collector-store", 0, NULL
, &certs
);
265 ret
= hx509_certs_merge(context
, certs
, c
->certs
);
267 hx509_certs_free(&certs
);
271 for (i
= 0; i
< c
->val
.len
; i
++) {
272 ret
= match_localkeyid(context
, c
->val
.data
[i
], certs
);
275 ret
= match_keys(context
, c
->val
.data
[i
], certs
);
286 _hx509_collector_collect_private_keys(hx509_context context
,
287 struct hx509_collector
*c
,
288 hx509_private_key
**keys
)
294 for (i
= 0, nkeys
= 0; i
< c
->val
.len
; i
++)
295 if (c
->val
.data
[i
]->private_key
)
298 *keys
= calloc(nkeys
+ 1, sizeof(**keys
));
300 hx509_set_error_string(context
, 0, ENOMEM
, "malloc - out of memory");
304 for (i
= 0, nkeys
= 0; i
< c
->val
.len
; i
++) {
305 if (c
->val
.data
[i
]->private_key
) {
306 (*keys
)[nkeys
++] = c
->val
.data
[i
]->private_key
;
307 c
->val
.data
[i
]->private_key
= NULL
;
310 (*keys
)[nkeys
] = NULL
;
317 _hx509_collector_free(struct hx509_collector
*c
)
321 if (c
->unenvelop_certs
)
322 hx509_certs_free(&c
->unenvelop_certs
);
324 hx509_certs_free(&c
->certs
);
325 for (i
= 0; i
< c
->val
.len
; i
++)
326 free_private_key(c
->val
.data
[i
]);