lib/hx509/collector.c

   1 /*
   2  * Copyright (c) 2004 - 2007 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 "hx_locl.h"
  35
  36 struct private_key {
  37     AlgorithmIdentifier alg;
  38     hx509_private_key private_key;
  39     heim_octet_string localKeyId;
  40 };
  41
  42 struct hx509_collector {
  43     hx509_lock lock;
  44     hx509_certs unenvelop_certs;
  45     hx509_certs certs;
  46     struct {
  47         struct private_key **data;
  48         size_t len;
  49     } val;
  50 };
  51
  52
  53 int
  54 _hx509_collector_alloc(hx509_context context, hx509_lock lock, struct hx509_collector **collector)
  55 {
  56     struct hx509_collector *c;
  57     int ret;
  58
  59     *collector = NULL;
  60
  61     c = calloc(1, sizeof(*c));
  62     if (c == NULL) {
  63         hx509_set_error_string(context, 0, ENOMEM, "out of memory");
  64         return ENOMEM;
  65     }
  66     c->lock = lock;
  67
  68     ret = hx509_certs_init(context, "MEMORY:collector-unenvelop-cert",
  69                            0,NULL, &c->unenvelop_certs);
  70     if (ret) {
  71         free(c);
  72         return ret;
  73     }
  74     c->val.data = NULL;
  75     c->val.len = 0;
  76     ret = hx509_certs_init(context, "MEMORY:collector-tmp-store",
  77                            0, NULL, &c->certs);
  78     if (ret) {
  79         hx509_certs_free(&c->unenvelop_certs);
  80         free(c);
  81         return ret;
  82     }
  83
  84     *collector = c;
  85     return 0;
  86 }
  87
  88 hx509_lock
  89 _hx509_collector_get_lock(struct hx509_collector *c)
  90 {
  91     return c->lock;
  92 }
  93
  94
  95 int
  96 _hx509_collector_certs_add(hx509_context context,
  97                            struct hx509_collector *c,
  98                            hx509_cert cert)
  99 {
 100     return hx509_certs_add(context, c->certs, cert);
 101 }
 102
 103 static void
 104 free_private_key(struct private_key *key)
 105 {
 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);
 110     free(key);
 111 }
 112
 113 int
 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)
 120 {
 121     struct private_key *key;
 122     void *d;
 123     int ret;
 124
 125     key = calloc(1, sizeof(*key));
 126     if (key == NULL)
 127         return ENOMEM;
 128
 129     d = realloc(c->val.data, (c->val.len + 1) * sizeof(c->val.data[0]));
 130     if (d == NULL) {
 131         free(key);
 132         hx509_set_error_string(context, 0, ENOMEM, "Out of memory");
 133         return ENOMEM;
 134     }
 135     c->val.data = d;
 136
 137     ret = copy_AlgorithmIdentifier(alg, &key->alg);
 138     if (ret) {
 139         hx509_set_error_string(context, 0, ret, "Failed to copy "
 140                                "AlgorithmIdentifier");
 141         goto out;
 142     }
 143     if (private_key) {
 144         key->private_key = private_key;
 145     } else {
 146         ret = _hx509_parse_private_key(context, alg,
 147                                        key_data->data, key_data->length,
 148                                        &key->private_key);
 149         if (ret)
 150             goto out;
 151     }
 152     if (localKeyId) {
 153         ret = der_copy_octet_string(localKeyId, &key->localKeyId);
 154         if (ret) {
 155             hx509_set_error_string(context, 0, ret,
 156                                    "Failed to copy localKeyId");
 157             goto out;
 158         }
 159     } else
 160         memset(&key->localKeyId, 0, sizeof(key->localKeyId));
 161
 162     c->val.data[c->val.len] = key;
 163     c->val.len++;
 164
 165 out:
 166     if (ret)
 167         free_private_key(key);
 168
 169     return ret;
 170 }
 171
 172 static int
 173 match_localkeyid(hx509_context context,
 174                  struct private_key *value,
 175                  hx509_certs certs)
 176 {
 177     hx509_cert cert;
 178     hx509_query q;
 179     int ret;
 180
 181     if (value->localKeyId.length == 0) {
 182         hx509_set_error_string(context, 0, HX509_LOCAL_ATTRIBUTE_MISSING,
 183                                "No local key attribute on private key");
 184         return HX509_LOCAL_ATTRIBUTE_MISSING;
 185     }
 186
 187     _hx509_query_clear(&q);
 188     q.match |= HX509_QUERY_MATCH_LOCAL_KEY_ID;
 189
 190     q.local_key_id = &value->localKeyId;
 191
 192     ret = hx509_certs_find(context, certs, &q, &cert);
 193     if (ret == 0) {
 194
 195         if (value->private_key)
 196             _hx509_cert_assign_key(cert, value->private_key);
 197         hx509_cert_free(cert);
 198     }
 199     return ret;
 200 }
 201
 202 static int
 203 match_keys(hx509_context context, struct private_key *value, hx509_certs certs)
 204 {
 205     hx509_cursor cursor;
 206     hx509_cert c;
 207     int ret, found = HX509_CERT_NOT_FOUND;
 208
 209     if (value->private_key == NULL) {
 210         hx509_set_error_string(context, 0, HX509_PRIVATE_KEY_MISSING,
 211                                "No private key to compare with");
 212         return HX509_PRIVATE_KEY_MISSING;
 213     }
 214
 215     ret = hx509_certs_start_seq(context, certs, &cursor);
 216     if (ret)
 217         return ret;
 218
 219     c = NULL;
 220     while (1) {
 221         ret = hx509_certs_next_cert(context, certs, cursor, &c);
 222         if (ret)
 223             break;
 224         if (c == NULL)
 225             break;
 226         if (_hx509_cert_private_key(c)) {
 227             hx509_cert_free(c);
 228             continue;
 229         }
 230
 231         ret = _hx509_match_keys(c, value->private_key);
 232         if (ret) {
 233             _hx509_cert_assign_key(c, value->private_key);
 234             hx509_cert_free(c);
 235             found = 0;
 236             break;
 237         }
 238         hx509_cert_free(c);
 239     }
 240
 241     hx509_certs_end_seq(context, certs, cursor);
 242
 243     if (found)
 244         hx509_clear_error_string(context);
 245
 246     return found;
 247 }
 248
 249 int
 250 _hx509_collector_collect_certs(hx509_context context,
 251                                struct hx509_collector *c,
 252                                hx509_certs *ret_certs)
 253 {
 254     hx509_certs certs;
 255     int ret, i;
 256
 257     *ret_certs = NULL;
 258
 259     ret = hx509_certs_init(context, "MEMORY:collector-store", 0, NULL, &certs);
 260     if (ret)
 261         return ret;
 262
 263     ret = hx509_certs_merge(context, certs, c->certs);
 264     if (ret) {
 265         hx509_certs_free(&certs);
 266         return ret;
 267     }
 268
 269     for (i = 0; i < c->val.len; i++) {
 270         ret = match_localkeyid(context, c->val.data[i], certs);
 271         if (ret == 0)
 272             continue;
 273         ret = match_keys(context, c->val.data[i], certs);
 274         if (ret == 0)
 275             continue;
 276     }
 277
 278     *ret_certs = certs;
 279
 280     return 0;
 281 }
 282
 283 int
 284 _hx509_collector_collect_private_keys(hx509_context context,
 285                                       struct hx509_collector *c,
 286                                       hx509_private_key **keys)
 287 {
 288     int i, nkeys;
 289
 290     *keys = NULL;
 291
 292     for (i = 0, nkeys = 0; i < c->val.len; i++)
 293         if (c->val.data[i]->private_key)
 294             nkeys++;
 295
 296     *keys = calloc(nkeys + 1, sizeof(**keys));
 297     if (*keys == NULL) {
 298         hx509_set_error_string(context, 0, ENOMEM, "malloc - out of memory");
 299         return ENOMEM;
 300     }
 301
 302     for (i = 0, nkeys = 0; i < c->val.len; i++) {
 303         if (c->val.data[i]->private_key) {
 304             (*keys)[nkeys++] = c->val.data[i]->private_key;
 305             c->val.data[i]->private_key = NULL;
 306         }
 307     }
 308     (*keys)[nkeys] = NULL;
 309
 310     return 0;
 311 }
 312
 313
 314 void
 315 _hx509_collector_free(struct hx509_collector *c)
 316 {
 317     int i;
 318
 319     if (c->unenvelop_certs)
 320         hx509_certs_free(&c->unenvelop_certs);
 321     if (c->certs)
 322         hx509_certs_free(&c->certs);
 323     for (i = 0; i < c->val.len; i++)
 324         free_private_key(c->val.data[i]);
 325     if (c->val.data)
 326         free(c->val.data);
 327     free(c);
 328 }