2 * Copyright (c) 2005 - 2006 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 * Should use two hash/tree certificates intead of a array. Criteria
38 * should be subject and subjectKeyIdentifier since those two are
39 * commonly seached on in CMS and path building.
48 hx509_private_key *keys;
52 mem_init(hx509_context context,
53 hx509_certs certs, void **data, int flags,
54 const char *residue, hx509_lock lock)
57 mem = calloc(1, sizeof(*mem));
60 if (residue == NULL || residue[0] == '\0')
61 residue = "anonymous";
62 mem->name = strdup(residue);
63 if (mem->name == NULL) {
72 mem_free(hx509_certs certs, void *data)
74 struct mem_data *mem = data;
77 for (i = 0; i < mem->certs.len; i++)
78 hx509_cert_free(mem->certs.val[i]);
80 for (i = 0; mem->keys && mem->keys[i]; i++)
81 hx509_private_key_free(&mem->keys[i]);
90 mem_add(hx509_context context, hx509_certs certs, void *data, hx509_cert c)
92 struct mem_data *mem = data;
95 val = realloc(mem->certs.val,
96 (mem->certs.len + 1) * sizeof(mem->certs.val[0]));
100 mem->certs.val = val;
101 mem->certs.val[mem->certs.len] = hx509_cert_ref(c);
108 mem_iter_start(hx509_context context,
113 unsigned long *iter = malloc(sizeof(*iter));
125 mem_iter(hx509_context contexst,
131 unsigned long *iter = cursor;
132 struct mem_data *mem = data;
134 if (*iter >= mem->certs.len) {
139 *cert = hx509_cert_ref(mem->certs.val[*iter]);
145 mem_iter_end(hx509_context context,
155 mem_getkeys(hx509_context context,
158 hx509_private_key **keys)
160 struct mem_data *mem = data;
163 for (i = 0; mem->keys && mem->keys[i]; i++)
165 *keys = calloc(i + 1, sizeof(**keys));
166 for (i = 0; mem->keys && mem->keys[i]; i++) {
167 (*keys)[i] = _hx509_private_key_ref(mem->keys[i]);
168 if ((*keys)[i] == NULL) {
170 hx509_private_key_free(&(*keys)[i]);
171 hx509_set_error_string(context, 0, ENOMEM, "out of memory");
180 mem_addkey(hx509_context context,
183 hx509_private_key key)
185 struct mem_data *mem = data;
189 for (i = 0; mem->keys && mem->keys[i]; i++)
191 ptr = realloc(mem->keys, (i + 2) * sizeof(*mem->keys));
193 hx509_set_error_string(context, 0, ENOMEM, "out of memory");
197 mem->keys[i] = _hx509_private_key_ref(key);
198 mem->keys[i + 1] = NULL;
203 static struct hx509_keyset_ops keyset_mem = {
220 _hx509_ks_mem_register(hx509_context context)
222 _hx509_ks_register(context, &keyset_mem);