/src/openssl/crypto/x509/x509name.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved. |
3 | | * |
4 | | * Licensed under the Apache License 2.0 (the "License"). You may not use |
5 | | * this file except in compliance with the License. You can obtain a copy |
6 | | * in the file LICENSE in the source distribution or at |
7 | | * https://www.openssl.org/source/license.html |
8 | | */ |
9 | | |
10 | | #include <stdio.h> |
11 | | #include "internal/cryptlib.h" |
12 | | #include <openssl/safestack.h> |
13 | | #include <openssl/asn1.h> |
14 | | #include <openssl/objects.h> |
15 | | #include <openssl/evp.h> |
16 | | #include <openssl/x509.h> |
17 | | #include "crypto/x509.h" |
18 | | |
19 | | int X509_NAME_get_text_by_NID(X509_NAME *name, int nid, char *buf, int len) |
20 | 0 | { |
21 | 0 | ASN1_OBJECT *obj; |
22 | |
|
23 | 0 | obj = OBJ_nid2obj(nid); |
24 | 0 | if (obj == NULL) |
25 | 0 | return -1; |
26 | 0 | return X509_NAME_get_text_by_OBJ(name, obj, buf, len); |
27 | 0 | } |
28 | | |
29 | | int X509_NAME_get_text_by_OBJ(X509_NAME *name, const ASN1_OBJECT *obj, |
30 | | char *buf, int len) |
31 | 0 | { |
32 | 0 | int i; |
33 | 0 | const ASN1_STRING *data; |
34 | |
|
35 | 0 | i = X509_NAME_get_index_by_OBJ(name, obj, -1); |
36 | 0 | if (i < 0) |
37 | 0 | return -1; |
38 | 0 | data = X509_NAME_ENTRY_get_data(X509_NAME_get_entry(name, i)); |
39 | 0 | if (buf == NULL) |
40 | 0 | return data->length; |
41 | 0 | if (len <= 0) |
42 | 0 | return 0; |
43 | 0 | i = (data->length > (len - 1)) ? (len - 1) : data->length; |
44 | 0 | memcpy(buf, data->data, i); |
45 | 0 | buf[i] = '\0'; |
46 | 0 | return i; |
47 | 0 | } |
48 | | |
49 | | int X509_NAME_entry_count(const X509_NAME *name) |
50 | 19.1k | { |
51 | 19.1k | if (name == NULL) |
52 | 0 | return 0; |
53 | 19.1k | return sk_X509_NAME_ENTRY_num(name->entries); |
54 | 19.1k | } |
55 | | |
56 | | int X509_NAME_get_index_by_NID(X509_NAME *name, int nid, int lastpos) |
57 | 0 | { |
58 | 0 | ASN1_OBJECT *obj; |
59 | |
|
60 | 0 | obj = OBJ_nid2obj(nid); |
61 | 0 | if (obj == NULL) |
62 | 0 | return -2; |
63 | 0 | return X509_NAME_get_index_by_OBJ(name, obj, lastpos); |
64 | 0 | } |
65 | | |
66 | | /* NOTE: you should be passing -1, not 0 as lastpos */ |
67 | | int X509_NAME_get_index_by_OBJ(X509_NAME *name, const ASN1_OBJECT *obj, int lastpos) |
68 | 0 | { |
69 | 0 | int n; |
70 | 0 | X509_NAME_ENTRY *ne; |
71 | 0 | STACK_OF(X509_NAME_ENTRY) *sk; |
72 | |
|
73 | 0 | if (name == NULL) |
74 | 0 | return -1; |
75 | 0 | if (lastpos < 0) |
76 | 0 | lastpos = -1; |
77 | 0 | sk = name->entries; |
78 | 0 | n = sk_X509_NAME_ENTRY_num(sk); |
79 | 0 | for (lastpos++; lastpos < n; lastpos++) { |
80 | 0 | ne = sk_X509_NAME_ENTRY_value(sk, lastpos); |
81 | 0 | if (OBJ_cmp(ne->object, obj) == 0) |
82 | 0 | return lastpos; |
83 | 0 | } |
84 | 0 | return -1; |
85 | 0 | } |
86 | | |
87 | | X509_NAME_ENTRY *X509_NAME_get_entry(const X509_NAME *name, int loc) |
88 | 3.12k | { |
89 | 3.12k | if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc |
90 | 3.12k | || loc < 0) |
91 | 0 | return NULL; |
92 | | |
93 | 3.12k | return sk_X509_NAME_ENTRY_value(name->entries, loc); |
94 | 3.12k | } |
95 | | |
96 | | X509_NAME_ENTRY *X509_NAME_delete_entry(X509_NAME *name, int loc) |
97 | 0 | { |
98 | 0 | X509_NAME_ENTRY *ret; |
99 | 0 | int i, n, set_prev, set_next; |
100 | 0 | STACK_OF(X509_NAME_ENTRY) *sk; |
101 | |
|
102 | 0 | if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc |
103 | 0 | || loc < 0) |
104 | 0 | return NULL; |
105 | | |
106 | 0 | sk = name->entries; |
107 | 0 | ret = sk_X509_NAME_ENTRY_delete(sk, loc); |
108 | 0 | n = sk_X509_NAME_ENTRY_num(sk); |
109 | 0 | name->modified = 1; |
110 | 0 | if (loc == n) |
111 | 0 | return ret; |
112 | | |
113 | | /* else we need to fixup the set field */ |
114 | 0 | if (loc != 0) |
115 | 0 | set_prev = (sk_X509_NAME_ENTRY_value(sk, loc - 1))->set; |
116 | 0 | else |
117 | 0 | set_prev = ret->set - 1; |
118 | 0 | set_next = sk_X509_NAME_ENTRY_value(sk, loc)->set; |
119 | | |
120 | | /*- |
121 | | * set_prev is the previous set |
122 | | * set is the current set |
123 | | * set_next is the following |
124 | | * prev 1 1 1 1 1 1 1 1 |
125 | | * set 1 1 2 2 |
126 | | * next 1 1 2 2 2 2 3 2 |
127 | | * so basically only if prev and next differ by 2, then |
128 | | * re-number down by 1 |
129 | | */ |
130 | 0 | if (set_prev + 1 < set_next) |
131 | 0 | for (i = loc; i < n; i++) |
132 | 0 | sk_X509_NAME_ENTRY_value(sk, i)->set--; |
133 | 0 | return ret; |
134 | 0 | } |
135 | | |
136 | | int X509_NAME_add_entry_by_OBJ(X509_NAME *name, const ASN1_OBJECT *obj, int type, |
137 | | const unsigned char *bytes, int len, int loc, |
138 | | int set) |
139 | 0 | { |
140 | 0 | X509_NAME_ENTRY *ne; |
141 | 0 | int ret; |
142 | |
|
143 | 0 | ne = X509_NAME_ENTRY_create_by_OBJ(NULL, obj, type, bytes, len); |
144 | 0 | if (!ne) |
145 | 0 | return 0; |
146 | 0 | ret = X509_NAME_add_entry(name, ne, loc, set); |
147 | 0 | X509_NAME_ENTRY_free(ne); |
148 | 0 | return ret; |
149 | 0 | } |
150 | | |
151 | | int X509_NAME_add_entry_by_NID(X509_NAME *name, int nid, int type, |
152 | | const unsigned char *bytes, int len, int loc, |
153 | | int set) |
154 | 0 | { |
155 | 0 | X509_NAME_ENTRY *ne; |
156 | 0 | int ret; |
157 | 0 | ne = X509_NAME_ENTRY_create_by_NID(NULL, nid, type, bytes, len); |
158 | 0 | if (!ne) |
159 | 0 | return 0; |
160 | 0 | ret = X509_NAME_add_entry(name, ne, loc, set); |
161 | 0 | X509_NAME_ENTRY_free(ne); |
162 | 0 | return ret; |
163 | 0 | } |
164 | | |
165 | | int X509_NAME_add_entry_by_txt(X509_NAME *name, const char *field, int type, |
166 | | const unsigned char *bytes, int len, int loc, |
167 | | int set) |
168 | 0 | { |
169 | 0 | X509_NAME_ENTRY *ne; |
170 | 0 | int ret; |
171 | 0 | ne = X509_NAME_ENTRY_create_by_txt(NULL, field, type, bytes, len); |
172 | 0 | if (!ne) |
173 | 0 | return 0; |
174 | 0 | ret = X509_NAME_add_entry(name, ne, loc, set); |
175 | 0 | X509_NAME_ENTRY_free(ne); |
176 | 0 | return ret; |
177 | 0 | } |
178 | | |
179 | | /* |
180 | | * if set is -1, append to previous set, 0 'a new one', and 1, prepend to the |
181 | | * guy we are about to stomp on. |
182 | | */ |
183 | | int X509_NAME_add_entry(X509_NAME *name, const X509_NAME_ENTRY *ne, int loc, |
184 | | int set) |
185 | 0 | { |
186 | 0 | X509_NAME_ENTRY *new_name = NULL; |
187 | 0 | int n, i, inc; |
188 | 0 | STACK_OF(X509_NAME_ENTRY) *sk; |
189 | |
|
190 | 0 | if (name == NULL) |
191 | 0 | return 0; |
192 | 0 | sk = name->entries; |
193 | 0 | n = sk_X509_NAME_ENTRY_num(sk); |
194 | 0 | if (loc > n) |
195 | 0 | loc = n; |
196 | 0 | else if (loc < 0) |
197 | 0 | loc = n; |
198 | 0 | inc = (set == 0); |
199 | 0 | name->modified = 1; |
200 | |
|
201 | 0 | if (set == -1) { |
202 | 0 | if (loc == 0) { |
203 | 0 | set = 0; |
204 | 0 | inc = 1; |
205 | 0 | } else { |
206 | 0 | set = sk_X509_NAME_ENTRY_value(sk, loc - 1)->set; |
207 | 0 | } |
208 | 0 | } else { /* if (set >= 0) */ |
209 | |
|
210 | 0 | if (loc >= n) { |
211 | 0 | if (loc != 0) |
212 | 0 | set = sk_X509_NAME_ENTRY_value(sk, loc - 1)->set + 1; |
213 | 0 | else |
214 | 0 | set = 0; |
215 | 0 | } else |
216 | 0 | set = sk_X509_NAME_ENTRY_value(sk, loc)->set; |
217 | 0 | } |
218 | | |
219 | | /* |
220 | | * X509_NAME_ENTRY_dup is ASN1 generated code, that can't be easily |
221 | | * const'ified; harmless cast since dup() don't modify its input. |
222 | | */ |
223 | 0 | if ((new_name = X509_NAME_ENTRY_dup((X509_NAME_ENTRY *)ne)) == NULL) |
224 | 0 | goto err; |
225 | 0 | new_name->set = set; |
226 | 0 | if (!sk_X509_NAME_ENTRY_insert(sk, new_name, loc)) { |
227 | 0 | X509err(X509_F_X509_NAME_ADD_ENTRY, ERR_R_MALLOC_FAILURE); |
228 | 0 | goto err; |
229 | 0 | } |
230 | 0 | if (inc) { |
231 | 0 | n = sk_X509_NAME_ENTRY_num(sk); |
232 | 0 | for (i = loc + 1; i < n; i++) |
233 | 0 | sk_X509_NAME_ENTRY_value(sk, i)->set += 1; |
234 | 0 | } |
235 | 0 | return 1; |
236 | 0 | err: |
237 | 0 | X509_NAME_ENTRY_free(new_name); |
238 | 0 | return 0; |
239 | 0 | } |
240 | | |
241 | | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_txt(X509_NAME_ENTRY **ne, |
242 | | const char *field, int type, |
243 | | const unsigned char *bytes, |
244 | | int len) |
245 | 0 | { |
246 | 0 | ASN1_OBJECT *obj; |
247 | 0 | X509_NAME_ENTRY *nentry; |
248 | |
|
249 | 0 | obj = OBJ_txt2obj(field, 0); |
250 | 0 | if (obj == NULL) { |
251 | 0 | X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_TXT, |
252 | 0 | X509_R_INVALID_FIELD_NAME); |
253 | 0 | ERR_add_error_data(2, "name=", field); |
254 | 0 | return NULL; |
255 | 0 | } |
256 | 0 | nentry = X509_NAME_ENTRY_create_by_OBJ(ne, obj, type, bytes, len); |
257 | 0 | ASN1_OBJECT_free(obj); |
258 | 0 | return nentry; |
259 | 0 | } |
260 | | |
261 | | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_NID(X509_NAME_ENTRY **ne, int nid, |
262 | | int type, |
263 | | const unsigned char *bytes, |
264 | | int len) |
265 | 0 | { |
266 | 0 | ASN1_OBJECT *obj; |
267 | 0 | X509_NAME_ENTRY *nentry; |
268 | |
|
269 | 0 | obj = OBJ_nid2obj(nid); |
270 | 0 | if (obj == NULL) { |
271 | 0 | X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_NID, X509_R_UNKNOWN_NID); |
272 | 0 | return NULL; |
273 | 0 | } |
274 | 0 | nentry = X509_NAME_ENTRY_create_by_OBJ(ne, obj, type, bytes, len); |
275 | 0 | ASN1_OBJECT_free(obj); |
276 | 0 | return nentry; |
277 | 0 | } |
278 | | |
279 | | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_OBJ(X509_NAME_ENTRY **ne, |
280 | | const ASN1_OBJECT *obj, int type, |
281 | | const unsigned char *bytes, |
282 | | int len) |
283 | 0 | { |
284 | 0 | X509_NAME_ENTRY *ret; |
285 | |
|
286 | 0 | if ((ne == NULL) || (*ne == NULL)) { |
287 | 0 | if ((ret = X509_NAME_ENTRY_new()) == NULL) |
288 | 0 | return NULL; |
289 | 0 | } else |
290 | 0 | ret = *ne; |
291 | | |
292 | 0 | if (!X509_NAME_ENTRY_set_object(ret, obj)) |
293 | 0 | goto err; |
294 | 0 | if (!X509_NAME_ENTRY_set_data(ret, type, bytes, len)) |
295 | 0 | goto err; |
296 | | |
297 | 0 | if ((ne != NULL) && (*ne == NULL)) |
298 | 0 | *ne = ret; |
299 | 0 | return ret; |
300 | 0 | err: |
301 | 0 | if ((ne == NULL) || (ret != *ne)) |
302 | 0 | X509_NAME_ENTRY_free(ret); |
303 | 0 | return NULL; |
304 | 0 | } |
305 | | |
306 | | int X509_NAME_ENTRY_set_object(X509_NAME_ENTRY *ne, const ASN1_OBJECT *obj) |
307 | 0 | { |
308 | 0 | if ((ne == NULL) || (obj == NULL)) { |
309 | 0 | X509err(X509_F_X509_NAME_ENTRY_SET_OBJECT, |
310 | 0 | ERR_R_PASSED_NULL_PARAMETER); |
311 | 0 | return 0; |
312 | 0 | } |
313 | 0 | ASN1_OBJECT_free(ne->object); |
314 | 0 | ne->object = OBJ_dup(obj); |
315 | 0 | return ((ne->object == NULL) ? 0 : 1); |
316 | 0 | } |
317 | | |
318 | | int X509_NAME_ENTRY_set_data(X509_NAME_ENTRY *ne, int type, |
319 | | const unsigned char *bytes, int len) |
320 | 0 | { |
321 | 0 | int i; |
322 | |
|
323 | 0 | if ((ne == NULL) || ((bytes == NULL) && (len != 0))) |
324 | 0 | return 0; |
325 | 0 | if ((type > 0) && (type & MBSTRING_FLAG)) |
326 | 0 | return ASN1_STRING_set_by_NID(&ne->value, bytes, |
327 | 0 | len, type, |
328 | 0 | OBJ_obj2nid(ne->object)) ? 1 : 0; |
329 | 0 | if (len < 0) |
330 | 0 | len = strlen((const char *)bytes); |
331 | 0 | i = ASN1_STRING_set(ne->value, bytes, len); |
332 | 0 | if (!i) |
333 | 0 | return 0; |
334 | 0 | if (type != V_ASN1_UNDEF) { |
335 | 0 | if (type == V_ASN1_APP_CHOOSE) |
336 | 0 | ne->value->type = ASN1_PRINTABLE_type(bytes, len); |
337 | 0 | else |
338 | 0 | ne->value->type = type; |
339 | 0 | } |
340 | 0 | return 1; |
341 | 0 | } |
342 | | |
343 | | ASN1_OBJECT *X509_NAME_ENTRY_get_object(const X509_NAME_ENTRY *ne) |
344 | 3.12k | { |
345 | 3.12k | if (ne == NULL) |
346 | 0 | return NULL; |
347 | 3.12k | return ne->object; |
348 | 3.12k | } |
349 | | |
350 | | ASN1_STRING *X509_NAME_ENTRY_get_data(const X509_NAME_ENTRY *ne) |
351 | 3.12k | { |
352 | 3.12k | if (ne == NULL) |
353 | 0 | return NULL; |
354 | 3.12k | return ne->value; |
355 | 3.12k | } |
356 | | |
357 | | int X509_NAME_ENTRY_set(const X509_NAME_ENTRY *ne) |
358 | 5.27k | { |
359 | 5.27k | return ne->set; |
360 | 5.27k | } |