2 * Copyright (c) 2006 - 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
38 * @page page_peer Hx509 crypto selecting functions
40 * Peer info structures are used togeter with hx509_crypto_select() to
41 * select the best avaible crypto algorithm to use.
43 * See the library functions here: @ref hx509_peer
47 * Allocate a new peer info structure an init it to default values.
49 * @param context A hx509 context.
50 * @param peer return an allocated peer, free with hx509_peer_info_free().
52 * @return An hx509 error code, see hx509_get_error_string().
58 hx509_peer_info_alloc(hx509_context context
, hx509_peer_info
*peer
)
60 *peer
= calloc(1, sizeof(**peer
));
62 hx509_set_error_string(context
, 0, ENOMEM
, "out of memory");
70 free_cms_alg(hx509_peer_info peer
)
74 for (i
= 0; i
< peer
->len
; i
++)
75 free_AlgorithmIdentifier(&peer
->val
[i
]);
83 * Free a peer info structure.
85 * @param peer peer info to be freed.
91 hx509_peer_info_free(hx509_peer_info peer
)
96 hx509_cert_free(peer
->cert
);
98 memset(peer
, 0, sizeof(*peer
));
103 * Set the certificate that remote peer is using.
105 * @param peer peer info to update
106 * @param cert cerificate of the remote peer.
108 * @return An hx509 error code, see hx509_get_error_string().
110 * @ingroup hx509_peer
114 hx509_peer_info_set_cert(hx509_peer_info peer
,
118 hx509_cert_free(peer
->cert
);
119 peer
->cert
= hx509_cert_ref(cert
);
124 * Set the algorithms that the peer supports.
126 * @param context A hx509 context.
127 * @param peer the peer to set the new algorithms for
128 * @param val array of supported AlgorithmsIdentiers
129 * @param len length of array val.
131 * @return An hx509 error code, see hx509_get_error_string().
133 * @ingroup hx509_peer
137 hx509_peer_info_set_cms_algs(hx509_context context
,
138 hx509_peer_info peer
,
139 const AlgorithmIdentifier
*val
,
146 peer
->val
= calloc(len
, sizeof(*peer
->val
));
147 if (peer
->val
== NULL
) {
149 hx509_set_error_string(context
, 0, ENOMEM
, "out of memory");
153 for (i
= 0; i
< len
; i
++) {
155 ret
= copy_AlgorithmIdentifier(&val
[i
], &peer
->val
[i
]);
157 hx509_clear_error_string(context
);
172 hx509_peer_info_parse_smime(hx509_peer_info peer
,
173 const heim_octet_string
*data
)
179 hx509_peer_info_unparse_smime(hx509_peer_info peer
,
180 heim_octet_string
*data
)
186 * For storing hx509_peer_info to be able to cache them.
190 hx509_peer_info_parse(hx509_peer_info peer
,
191 const heim_octet_string
*data
)
197 hx509_peer_info_unparse(hx509_peer_info peer
,
198 heim_octet_string
*data
)