/* [<][>][^][v][top][bottom][index][help] */
DEFINITIONS
This source file includes following definitions.
- hx509_peer_info_alloc
- free_cms_alg
- hx509_peer_info_free
- hx509_peer_info_set_cert
- hx509_peer_info_set_cms_algs
- hx509_peer_info_parse_smime
- hx509_peer_info_unparse_smime
- hx509_peer_info_parse
- hx509_peer_info_unparse
1 /*
2 * Copyright (c) 2006 - 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 RCSID("$Id$");
36
37 /**
38 * @page page_peer Hx509 crypto selecting functions
39 *
40 * Peer info structures are used togeter with hx509_crypto_select() to
41 * select the best avaible crypto algorithm to use.
42 *
43 * See the library functions here: @ref hx509_peer
44 */
45
46 /**
47 * Allocate a new peer info structure an init it to default values.
48 *
49 * @param context A hx509 context.
50 * @param peer return an allocated peer, free with hx509_peer_info_free().
51 *
52 * @return An hx509 error code, see hx509_get_error_string().
53 *
54 * @ingroup hx509_peer
55 */
56
57 int
58 hx509_peer_info_alloc(hx509_context context, hx509_peer_info *peer)
/* [<][>][^][v][top][bottom][index][help] */
59 {
60 *peer = calloc(1, sizeof(**peer));
61 if (*peer == NULL) {
62 hx509_set_error_string(context, 0, ENOMEM, "out of memory");
63 return ENOMEM;
64 }
65 return 0;
66 }
67
68
69 static void
70 free_cms_alg(hx509_peer_info peer)
/* [<][>][^][v][top][bottom][index][help] */
71 {
72 if (peer->val) {
73 size_t i;
74 for (i = 0; i < peer->len; i++)
75 free_AlgorithmIdentifier(&peer->val[i]);
76 free(peer->val);
77 peer->val = NULL;
78 peer->len = 0;
79 }
80 }
81
82 /**
83 * Free a peer info structure.
84 *
85 * @param peer peer info to be freed.
86 *
87 * @ingroup hx509_peer
88 */
89
90 void
91 hx509_peer_info_free(hx509_peer_info peer)
/* [<][>][^][v][top][bottom][index][help] */
92 {
93 if (peer == NULL)
94 return;
95 if (peer->cert)
96 hx509_cert_free(peer->cert);
97 free_cms_alg(peer);
98 memset(peer, 0, sizeof(*peer));
99 free(peer);
100 }
101
102 /**
103 * Set the certificate that remote peer is using.
104 *
105 * @param peer peer info to update
106 * @param cert cerificate of the remote peer.
107 *
108 * @return An hx509 error code, see hx509_get_error_string().
109 *
110 * @ingroup hx509_peer
111 */
112
113 int
114 hx509_peer_info_set_cert(hx509_peer_info peer,
/* [<][>][^][v][top][bottom][index][help] */
115 hx509_cert cert)
116 {
117 if (peer->cert)
118 hx509_cert_free(peer->cert);
119 peer->cert = hx509_cert_ref(cert);
120 return 0;
121 }
122
123 /**
124 * Set the algorithms that the peer supports.
125 *
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.
130 *
131 * @return An hx509 error code, see hx509_get_error_string().
132 *
133 * @ingroup hx509_peer
134 */
135
136 int
137 hx509_peer_info_set_cms_algs(hx509_context context,
/* [<][>][^][v][top][bottom][index][help] */
138 hx509_peer_info peer,
139 const AlgorithmIdentifier *val,
140 size_t len)
141 {
142 size_t i;
143
144 free_cms_alg(peer);
145
146 peer->val = calloc(len, sizeof(*peer->val));
147 if (peer->val == NULL) {
148 peer->len = 0;
149 hx509_set_error_string(context, 0, ENOMEM, "out of memory");
150 return ENOMEM;
151 }
152 peer->len = len;
153 for (i = 0; i < len; i++) {
154 int ret;
155 ret = copy_AlgorithmIdentifier(&val[i], &peer->val[i]);
156 if (ret) {
157 hx509_clear_error_string(context);
158 free_cms_alg(peer);
159 return ret;
160 }
161 }
162 return 0;
163 }
164
165 #if 0
166
167 /*
168 * S/MIME
169 */
170
171 int
172 hx509_peer_info_parse_smime(hx509_peer_info peer,
/* [<][>][^][v][top][bottom][index][help] */
173 const heim_octet_string *data)
174 {
175 return 0;
176 }
177
178 int
179 hx509_peer_info_unparse_smime(hx509_peer_info peer,
/* [<][>][^][v][top][bottom][index][help] */
180 heim_octet_string *data)
181 {
182 return 0;
183 }
184
185 /*
186 * For storing hx509_peer_info to be able to cache them.
187 */
188
189 int
190 hx509_peer_info_parse(hx509_peer_info peer,
/* [<][>][^][v][top][bottom][index][help] */
191 const heim_octet_string *data)
192 {
193 return 0;
194 }
195
196 int
197 hx509_peer_info_unparse(hx509_peer_info peer,
/* [<][>][^][v][top][bottom][index][help] */
198 heim_octet_string *data)
199 {
200 return 0;
201 }
202 #endif