2 * Copyright (c) 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
35 RCSID("$Id: peer.c,v 1.1 2006/11/26 15:49:01 lha Exp $");
38 hx509_peer_info_alloc(hx509_context context, hx509_peer_info *peer)
40 *peer = calloc(1, sizeof(**peer));
42 hx509_set_error_string(context, 0, ENOMEM, "out of memory");
50 free_cms_alg(hx509_peer_info peer)
54 for (i = 0; i < peer->len; i++)
55 free_AlgorithmIdentifier(&peer->val[i]);
63 hx509_peer_info_free(hx509_peer_info peer)
66 hx509_cert_free(peer->cert);
68 memset(peer, 0, sizeof(*peer));
73 hx509_peer_info_set_cert(hx509_peer_info peer,
77 hx509_cert_free(peer->cert);
78 peer->cert = hx509_cert_ref(cert);
83 hx509_peer_info_set_cms_algs(hx509_context context,
85 const AlgorithmIdentifier *val,
92 peer->val = calloc(len, sizeof(*peer->val));
93 if (peer->val == NULL) {
95 hx509_set_error_string(context, 0, ENOMEM, "out of memory");
99 for (i = 0; i < len; i++) {
101 ret = copy_AlgorithmIdentifier(&val[i], &peer->val[i]);
103 hx509_clear_error_string(context);
118 hx509_peer_info_parse_smime(hx509_peer_info peer,
119 const heim_octet_string *data)
125 hx509_peer_info_unparse_smime(hx509_peer_info peer,
126 heim_octet_string *data)
132 * For storing hx509_peer_info to be able to cache them.
136 hx509_peer_info_parse(hx509_peer_info peer,
137 const heim_octet_string *data)
143 hx509_peer_info_unparse(hx509_peer_info peer,
144 heim_octet_string *data)