1 | /* |
2 | * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL project |
3 | * 2004. |
4 | */ |
5 | /* ==================================================================== |
6 | * Copyright (c) 2004 The OpenSSL Project. All rights reserved. |
7 | * |
8 | * Redistribution and use in source and binary forms, with or without |
9 | * modification, are permitted provided that the following conditions |
10 | * are met: |
11 | * |
12 | * 1. Redistributions of source code must retain the above copyright |
13 | * notice, this list of conditions and the following disclaimer. |
14 | * |
15 | * 2. Redistributions in binary form must reproduce the above copyright |
16 | * notice, this list of conditions and the following disclaimer in |
17 | * the documentation and/or other materials provided with the |
18 | * distribution. |
19 | * |
20 | * 3. All advertising materials mentioning features or use of this |
21 | * software must display the following acknowledgment: |
22 | * "This product includes software developed by the OpenSSL Project |
23 | * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)" |
24 | * |
25 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to |
26 | * endorse or promote products derived from this software without |
27 | * prior written permission. For written permission, please contact |
28 | * licensing@OpenSSL.org. |
29 | * |
30 | * 5. Products derived from this software may not be called "OpenSSL" |
31 | * nor may "OpenSSL" appear in their names without prior written |
32 | * permission of the OpenSSL Project. |
33 | * |
34 | * 6. Redistributions of any form whatsoever must retain the following |
35 | * acknowledgment: |
36 | * "This product includes software developed by the OpenSSL Project |
37 | * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)" |
38 | * |
39 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY |
40 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
41 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
42 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR |
43 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
44 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
45 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
46 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
47 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
48 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
49 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
50 | * OF THE POSSIBILITY OF SUCH DAMAGE. |
51 | * ==================================================================== |
52 | * |
53 | * This product includes cryptographic software written by Eric Young |
54 | * (eay@cryptsoft.com). This product includes software written by Tim |
55 | * Hudson (tjh@cryptsoft.com). */ |
56 | |
57 | #include <openssl/mem.h> |
58 | #include <openssl/obj.h> |
59 | #include <openssl/thread.h> |
60 | #include <openssl/x509.h> |
61 | #include <openssl/x509v3.h> |
62 | |
63 | #include "pcy_int.h" |
64 | #include "../internal.h" |
65 | |
66 | static int policy_data_cmp(const X509_POLICY_DATA **a, |
67 | const X509_POLICY_DATA **b); |
68 | static int policy_cache_set_int(long *out, ASN1_INTEGER *value); |
69 | |
70 | /* |
71 | * Set cache entry according to CertificatePolicies extension. Note: this |
72 | * destroys the passed CERTIFICATEPOLICIES structure. |
73 | */ |
74 | |
75 | static int policy_cache_create(X509 *x, |
76 | CERTIFICATEPOLICIES *policies, int crit) |
77 | { |
78 | size_t i; |
79 | int ret = 0; |
80 | X509_POLICY_CACHE *cache = x->policy_cache; |
81 | X509_POLICY_DATA *data = NULL; |
82 | POLICYINFO *policy; |
83 | if (sk_POLICYINFO_num(policies) == 0) |
84 | goto bad_policy; |
85 | cache->data = sk_X509_POLICY_DATA_new(policy_data_cmp); |
86 | if (!cache->data) |
87 | goto bad_policy; |
88 | for (i = 0; i < sk_POLICYINFO_num(policies); i++) { |
89 | policy = sk_POLICYINFO_value(policies, i); |
90 | data = policy_data_new(policy, NULL, crit); |
91 | if (!data) |
92 | goto bad_policy; |
93 | /* |
94 | * Duplicate policy OIDs are illegal: reject if matches found. |
95 | */ |
96 | sk_X509_POLICY_DATA_sort(cache->data); |
97 | if (OBJ_obj2nid(data->valid_policy) == NID_any_policy) { |
98 | if (cache->anyPolicy) { |
99 | ret = -1; |
100 | goto bad_policy; |
101 | } |
102 | cache->anyPolicy = data; |
103 | } else if (sk_X509_POLICY_DATA_find(cache->data, NULL, data)) { |
104 | ret = -1; |
105 | goto bad_policy; |
106 | } else if (!sk_X509_POLICY_DATA_push(cache->data, data)) |
107 | goto bad_policy; |
108 | data = NULL; |
109 | } |
110 | ret = 1; |
111 | bad_policy: |
112 | if (ret == -1) |
113 | x->ex_flags |= EXFLAG_INVALID_POLICY; |
114 | if (data) |
115 | policy_data_free(data); |
116 | sk_POLICYINFO_pop_free(policies, POLICYINFO_free); |
117 | if (ret <= 0) { |
118 | sk_X509_POLICY_DATA_pop_free(cache->data, policy_data_free); |
119 | cache->data = NULL; |
120 | } |
121 | return ret; |
122 | } |
123 | |
124 | static int policy_cache_new(X509 *x) |
125 | { |
126 | X509_POLICY_CACHE *cache; |
127 | ASN1_INTEGER *ext_any = NULL; |
128 | POLICY_CONSTRAINTS *ext_pcons = NULL; |
129 | CERTIFICATEPOLICIES *ext_cpols = NULL; |
130 | POLICY_MAPPINGS *ext_pmaps = NULL; |
131 | int i; |
132 | cache = OPENSSL_malloc(sizeof(X509_POLICY_CACHE)); |
133 | if (!cache) |
134 | return 0; |
135 | cache->anyPolicy = NULL; |
136 | cache->data = NULL; |
137 | cache->any_skip = -1; |
138 | cache->explicit_skip = -1; |
139 | cache->map_skip = -1; |
140 | |
141 | x->policy_cache = cache; |
142 | |
143 | /* |
144 | * Handle requireExplicitPolicy *first*. Need to process this even if we |
145 | * don't have any policies. |
146 | */ |
147 | ext_pcons = X509_get_ext_d2i(x, NID_policy_constraints, &i, NULL); |
148 | |
149 | if (!ext_pcons) { |
150 | if (i != -1) |
151 | goto bad_cache; |
152 | } else { |
153 | if (!ext_pcons->requireExplicitPolicy |
154 | && !ext_pcons->inhibitPolicyMapping) |
155 | goto bad_cache; |
156 | if (!policy_cache_set_int(&cache->explicit_skip, |
157 | ext_pcons->requireExplicitPolicy)) |
158 | goto bad_cache; |
159 | if (!policy_cache_set_int(&cache->map_skip, |
160 | ext_pcons->inhibitPolicyMapping)) |
161 | goto bad_cache; |
162 | } |
163 | |
164 | /* Process CertificatePolicies */ |
165 | |
166 | ext_cpols = X509_get_ext_d2i(x, NID_certificate_policies, &i, NULL); |
167 | /* |
168 | * If no CertificatePolicies extension or problem decoding then there is |
169 | * no point continuing because the valid policies will be NULL. |
170 | */ |
171 | if (!ext_cpols) { |
172 | /* If not absent some problem with extension */ |
173 | if (i != -1) |
174 | goto bad_cache; |
175 | return 1; |
176 | } |
177 | |
178 | i = policy_cache_create(x, ext_cpols, i); |
179 | |
180 | /* NB: ext_cpols freed by policy_cache_set_policies */ |
181 | |
182 | if (i <= 0) |
183 | return i; |
184 | |
185 | ext_pmaps = X509_get_ext_d2i(x, NID_policy_mappings, &i, NULL); |
186 | |
187 | if (!ext_pmaps) { |
188 | /* If not absent some problem with extension */ |
189 | if (i != -1) |
190 | goto bad_cache; |
191 | } else { |
192 | i = policy_cache_set_mapping(x, ext_pmaps); |
193 | if (i <= 0) |
194 | goto bad_cache; |
195 | } |
196 | |
197 | ext_any = X509_get_ext_d2i(x, NID_inhibit_any_policy, &i, NULL); |
198 | |
199 | if (!ext_any) { |
200 | if (i != -1) |
201 | goto bad_cache; |
202 | } else if (!policy_cache_set_int(&cache->any_skip, ext_any)) |
203 | goto bad_cache; |
204 | |
205 | if (0) { |
206 | bad_cache: |
207 | x->ex_flags |= EXFLAG_INVALID_POLICY; |
208 | } |
209 | |
210 | if (ext_pcons) |
211 | POLICY_CONSTRAINTS_free(ext_pcons); |
212 | |
213 | if (ext_any) |
214 | ASN1_INTEGER_free(ext_any); |
215 | |
216 | return 1; |
217 | |
218 | } |
219 | |
220 | void policy_cache_free(X509_POLICY_CACHE *cache) |
221 | { |
222 | if (!cache) |
223 | return; |
224 | if (cache->anyPolicy) |
225 | policy_data_free(cache->anyPolicy); |
226 | if (cache->data) |
227 | sk_X509_POLICY_DATA_pop_free(cache->data, policy_data_free); |
228 | OPENSSL_free(cache); |
229 | } |
230 | |
231 | /* |
232 | * g_x509_policy_cache_lock is used to protect against concurrent calls to |
233 | * |policy_cache_new|. Ideally this would be done with a |CRYPTO_once_t| in |
234 | * the |X509| structure, but |CRYPTO_once_t| isn't public. |
235 | */ |
236 | static struct CRYPTO_STATIC_MUTEX g_x509_policy_cache_lock = |
237 | CRYPTO_STATIC_MUTEX_INIT; |
238 | |
239 | const X509_POLICY_CACHE *policy_cache_set(X509 *x) |
240 | { |
241 | X509_POLICY_CACHE *cache; |
242 | |
243 | CRYPTO_STATIC_MUTEX_lock_read(&g_x509_policy_cache_lock); |
244 | cache = x->policy_cache; |
245 | CRYPTO_STATIC_MUTEX_unlock_read(&g_x509_policy_cache_lock); |
246 | |
247 | if (cache != NULL) |
248 | return cache; |
249 | |
250 | CRYPTO_STATIC_MUTEX_lock_write(&g_x509_policy_cache_lock); |
251 | if (x->policy_cache == NULL) |
252 | policy_cache_new(x); |
253 | cache = x->policy_cache; |
254 | CRYPTO_STATIC_MUTEX_unlock_write(&g_x509_policy_cache_lock); |
255 | |
256 | return cache; |
257 | } |
258 | |
259 | X509_POLICY_DATA *policy_cache_find_data(const X509_POLICY_CACHE *cache, |
260 | const ASN1_OBJECT *id) |
261 | { |
262 | size_t idx; |
263 | X509_POLICY_DATA tmp; |
264 | |
265 | tmp.valid_policy = (ASN1_OBJECT *)id; |
266 | sk_X509_POLICY_DATA_sort(cache->data); |
267 | if (!sk_X509_POLICY_DATA_find(cache->data, &idx, &tmp)) |
268 | return NULL; |
269 | return sk_X509_POLICY_DATA_value(cache->data, idx); |
270 | } |
271 | |
272 | static int policy_data_cmp(const X509_POLICY_DATA **a, |
273 | const X509_POLICY_DATA **b) |
274 | { |
275 | return OBJ_cmp((*a)->valid_policy, (*b)->valid_policy); |
276 | } |
277 | |
278 | static int policy_cache_set_int(long *out, ASN1_INTEGER *value) |
279 | { |
280 | if (value == NULL) |
281 | return 1; |
282 | if (value->type == V_ASN1_NEG_INTEGER) |
283 | return 0; |
284 | *out = ASN1_INTEGER_get(value); |
285 | return 1; |
286 | } |
287 | |