/src/openssl30/crypto/x509/x509name.c
| Line | Count | Source (jump to first uncovered line) | 
| 1 |  | /* | 
| 2 |  |  * Copyright 1995-2020 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(const X509_NAME *name, int nid, | 
| 20 |  |                               char *buf, int len) | 
| 21 | 0 | { | 
| 22 | 0 |     ASN1_OBJECT *obj; | 
| 23 |  | 
 | 
| 24 | 0 |     obj = OBJ_nid2obj(nid); | 
| 25 | 0 |     if (obj == NULL) | 
| 26 | 0 |         return -1; | 
| 27 | 0 |     return X509_NAME_get_text_by_OBJ(name, obj, buf, len); | 
| 28 | 0 | } | 
| 29 |  |  | 
| 30 |  | int X509_NAME_get_text_by_OBJ(const X509_NAME *name, const ASN1_OBJECT *obj, | 
| 31 |  |                               char *buf, int len) | 
| 32 | 0 | { | 
| 33 | 0 |     int i; | 
| 34 | 0 |     const ASN1_STRING *data; | 
| 35 |  | 
 | 
| 36 | 0 |     i = X509_NAME_get_index_by_OBJ(name, obj, -1); | 
| 37 | 0 |     if (i < 0) | 
| 38 | 0 |         return -1; | 
| 39 | 0 |     data = X509_NAME_ENTRY_get_data(X509_NAME_get_entry(name, i)); | 
| 40 | 0 |     if (buf == NULL) | 
| 41 | 0 |         return data->length; | 
| 42 | 0 |     if (len <= 0) | 
| 43 | 0 |         return 0; | 
| 44 | 0 |     i = (data->length > (len - 1)) ? (len - 1) : data->length; | 
| 45 | 0 |     memcpy(buf, data->data, i); | 
| 46 | 0 |     buf[i] = '\0'; | 
| 47 | 0 |     return i; | 
| 48 | 0 | } | 
| 49 |  |  | 
| 50 |  | int X509_NAME_entry_count(const X509_NAME *name) | 
| 51 | 25.7k | { | 
| 52 | 25.7k |     int ret; | 
| 53 |  |  | 
| 54 | 25.7k |     if (name == NULL) | 
| 55 | 0 |         return 0; | 
| 56 | 25.7k |     ret = sk_X509_NAME_ENTRY_num(name->entries); | 
| 57 | 25.7k |     return ret > 0 ? ret : 0; | 
| 58 | 25.7k | } | 
| 59 |  |  | 
| 60 |  | int X509_NAME_get_index_by_NID(const X509_NAME *name, int nid, int lastpos) | 
| 61 | 80 | { | 
| 62 | 80 |     ASN1_OBJECT *obj; | 
| 63 |  |  | 
| 64 | 80 |     obj = OBJ_nid2obj(nid); | 
| 65 | 80 |     if (obj == NULL) | 
| 66 | 0 |         return -2; | 
| 67 | 80 |     return X509_NAME_get_index_by_OBJ(name, obj, lastpos); | 
| 68 | 80 | } | 
| 69 |  |  | 
| 70 |  | /* NOTE: you should be passing -1, not 0 as lastpos */ | 
| 71 |  | int X509_NAME_get_index_by_OBJ(const X509_NAME *name, const ASN1_OBJECT *obj, | 
| 72 |  |                                int lastpos) | 
| 73 | 80 | { | 
| 74 | 80 |     int n; | 
| 75 | 80 |     X509_NAME_ENTRY *ne; | 
| 76 | 80 |     STACK_OF(X509_NAME_ENTRY) *sk; | 
| 77 |  |  | 
| 78 | 80 |     if (name == NULL) | 
| 79 | 0 |         return -1; | 
| 80 | 80 |     if (lastpos < 0) | 
| 81 | 56 |         lastpos = -1; | 
| 82 | 80 |     sk = name->entries; | 
| 83 | 80 |     n = sk_X509_NAME_ENTRY_num(sk); | 
| 84 | 109 |     for (lastpos++; lastpos < n; lastpos++) { | 
| 85 | 56 |         ne = sk_X509_NAME_ENTRY_value(sk, lastpos); | 
| 86 | 56 |         if (OBJ_cmp(ne->object, obj) == 0) | 
| 87 | 27 |             return lastpos; | 
| 88 | 56 |     } | 
| 89 | 53 |     return -1; | 
| 90 | 80 | } | 
| 91 |  |  | 
| 92 |  | X509_NAME_ENTRY *X509_NAME_get_entry(const X509_NAME *name, int loc) | 
| 93 | 56.7k | { | 
| 94 | 56.7k |     if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc | 
| 95 | 56.7k |         || loc < 0) | 
| 96 | 750 |         return NULL; | 
| 97 |  |  | 
| 98 | 55.9k |     return sk_X509_NAME_ENTRY_value(name->entries, loc); | 
| 99 | 56.7k | } | 
| 100 |  |  | 
| 101 |  | X509_NAME_ENTRY *X509_NAME_delete_entry(X509_NAME *name, int loc) | 
| 102 | 0 | { | 
| 103 | 0 |     X509_NAME_ENTRY *ret; | 
| 104 | 0 |     int i, n, set_prev, set_next; | 
| 105 | 0 |     STACK_OF(X509_NAME_ENTRY) *sk; | 
| 106 |  | 
 | 
| 107 | 0 |     if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc | 
| 108 | 0 |         || loc < 0) | 
| 109 | 0 |         return NULL; | 
| 110 |  |  | 
| 111 | 0 |     sk = name->entries; | 
| 112 | 0 |     ret = sk_X509_NAME_ENTRY_delete(sk, loc); | 
| 113 | 0 |     n = sk_X509_NAME_ENTRY_num(sk); | 
| 114 | 0 |     name->modified = 1; | 
| 115 | 0 |     if (loc == n) | 
| 116 | 0 |         return ret; | 
| 117 |  |  | 
| 118 |  |     /* else we need to fixup the set field */ | 
| 119 | 0 |     if (loc != 0) | 
| 120 | 0 |         set_prev = (sk_X509_NAME_ENTRY_value(sk, loc - 1))->set; | 
| 121 | 0 |     else | 
| 122 | 0 |         set_prev = ret->set - 1; | 
| 123 | 0 |     set_next = sk_X509_NAME_ENTRY_value(sk, loc)->set; | 
| 124 |  |  | 
| 125 |  |     /*- | 
| 126 |  |      * set_prev is the previous set | 
| 127 |  |      * set is the current set | 
| 128 |  |      * set_next is the following | 
| 129 |  |      * prev  1 1    1 1     1 1     1 1 | 
| 130 |  |      * set   1      1       2       2 | 
| 131 |  |      * next  1 1    2 2     2 2     3 2 | 
| 132 |  |      * so basically only if prev and next differ by 2, then | 
| 133 |  |      * re-number down by 1 | 
| 134 |  |      */ | 
| 135 | 0 |     if (set_prev + 1 < set_next) | 
| 136 | 0 |         for (i = loc; i < n; i++) | 
| 137 | 0 |             sk_X509_NAME_ENTRY_value(sk, i)->set--; | 
| 138 | 0 |     return ret; | 
| 139 | 0 | } | 
| 140 |  |  | 
| 141 |  | int X509_NAME_add_entry_by_OBJ(X509_NAME *name, const ASN1_OBJECT *obj, int type, | 
| 142 |  |                                const unsigned char *bytes, int len, int loc, | 
| 143 |  |                                int set) | 
| 144 | 0 | { | 
| 145 | 0 |     X509_NAME_ENTRY *ne; | 
| 146 | 0 |     int ret; | 
| 147 |  | 
 | 
| 148 | 0 |     ne = X509_NAME_ENTRY_create_by_OBJ(NULL, obj, type, bytes, len); | 
| 149 | 0 |     if (!ne) | 
| 150 | 0 |         return 0; | 
| 151 | 0 |     ret = X509_NAME_add_entry(name, ne, loc, set); | 
| 152 | 0 |     X509_NAME_ENTRY_free(ne); | 
| 153 | 0 |     return ret; | 
| 154 | 0 | } | 
| 155 |  |  | 
| 156 |  | int X509_NAME_add_entry_by_NID(X509_NAME *name, int nid, int type, | 
| 157 |  |                                const unsigned char *bytes, int len, int loc, | 
| 158 |  |                                int set) | 
| 159 | 0 | { | 
| 160 | 0 |     X509_NAME_ENTRY *ne; | 
| 161 | 0 |     int ret; | 
| 162 | 0 |     ne = X509_NAME_ENTRY_create_by_NID(NULL, nid, type, bytes, len); | 
| 163 | 0 |     if (!ne) | 
| 164 | 0 |         return 0; | 
| 165 | 0 |     ret = X509_NAME_add_entry(name, ne, loc, set); | 
| 166 | 0 |     X509_NAME_ENTRY_free(ne); | 
| 167 | 0 |     return ret; | 
| 168 | 0 | } | 
| 169 |  |  | 
| 170 |  | int X509_NAME_add_entry_by_txt(X509_NAME *name, const char *field, int type, | 
| 171 |  |                                const unsigned char *bytes, int len, int loc, | 
| 172 |  |                                int set) | 
| 173 | 0 | { | 
| 174 | 0 |     X509_NAME_ENTRY *ne; | 
| 175 | 0 |     int ret; | 
| 176 | 0 |     ne = X509_NAME_ENTRY_create_by_txt(NULL, field, type, bytes, len); | 
| 177 | 0 |     if (!ne) | 
| 178 | 0 |         return 0; | 
| 179 | 0 |     ret = X509_NAME_add_entry(name, ne, loc, set); | 
| 180 | 0 |     X509_NAME_ENTRY_free(ne); | 
| 181 | 0 |     return ret; | 
| 182 | 0 | } | 
| 183 |  |  | 
| 184 |  | /* | 
| 185 |  |  * if set is -1, append to previous set, 0 'a new one', and 1, prepend to the | 
| 186 |  |  * guy we are about to stomp on. | 
| 187 |  |  */ | 
| 188 |  | int X509_NAME_add_entry(X509_NAME *name, const X509_NAME_ENTRY *ne, int loc, | 
| 189 |  |                         int set) | 
| 190 | 40.3k | { | 
| 191 | 40.3k |     X509_NAME_ENTRY *new_name = NULL; | 
| 192 | 40.3k |     int n, i, inc; | 
| 193 | 40.3k |     STACK_OF(X509_NAME_ENTRY) *sk; | 
| 194 |  |  | 
| 195 | 40.3k |     if (name == NULL) | 
| 196 | 0 |         return 0; | 
| 197 | 40.3k |     sk = name->entries; | 
| 198 | 40.3k |     n = sk_X509_NAME_ENTRY_num(sk); | 
| 199 | 40.3k |     if (loc > n) | 
| 200 | 0 |         loc = n; | 
| 201 | 40.3k |     else if (loc < 0) | 
| 202 | 40.3k |         loc = n; | 
| 203 | 40.3k |     inc = (set == 0); | 
| 204 | 40.3k |     name->modified = 1; | 
| 205 |  |  | 
| 206 | 40.3k |     if (set == -1) { | 
| 207 | 0 |         if (loc == 0) { | 
| 208 | 0 |             set = 0; | 
| 209 | 0 |             inc = 1; | 
| 210 | 0 |         } else { | 
| 211 | 0 |             set = sk_X509_NAME_ENTRY_value(sk, loc - 1)->set; | 
| 212 | 0 |         } | 
| 213 | 40.3k |     } else {                    /* if (set >= 0) */ | 
| 214 |  |  | 
| 215 | 40.3k |         if (loc >= n) { | 
| 216 | 40.3k |             if (loc != 0) | 
| 217 | 32.1k |                 set = sk_X509_NAME_ENTRY_value(sk, loc - 1)->set + 1; | 
| 218 | 8.18k |             else | 
| 219 | 8.18k |                 set = 0; | 
| 220 | 40.3k |         } else | 
| 221 | 0 |             set = sk_X509_NAME_ENTRY_value(sk, loc)->set; | 
| 222 | 40.3k |     } | 
| 223 |  |  | 
| 224 | 40.3k |     if ((new_name = X509_NAME_ENTRY_dup(ne)) == NULL) | 
| 225 | 661 |         goto err; | 
| 226 | 39.6k |     new_name->set = set; | 
| 227 | 39.6k |     if (!sk_X509_NAME_ENTRY_insert(sk, new_name, loc)) { | 
| 228 | 0 |         ERR_raise(ERR_LIB_X509, ERR_R_MALLOC_FAILURE); | 
| 229 | 0 |         goto err; | 
| 230 | 0 |     } | 
| 231 | 39.6k |     if (inc) { | 
| 232 | 29.1k |         n = sk_X509_NAME_ENTRY_num(sk); | 
| 233 | 29.1k |         for (i = loc + 1; i < n; i++) | 
| 234 | 0 |             sk_X509_NAME_ENTRY_value(sk, i)->set += 1; | 
| 235 | 29.1k |     } | 
| 236 | 39.6k |     return 1; | 
| 237 | 661 |  err: | 
| 238 | 661 |     X509_NAME_ENTRY_free(new_name); | 
| 239 | 661 |     return 0; | 
| 240 | 39.6k | } | 
| 241 |  |  | 
| 242 |  | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_txt(X509_NAME_ENTRY **ne, | 
| 243 |  |                                                const char *field, int type, | 
| 244 |  |                                                const unsigned char *bytes, | 
| 245 |  |                                                int len) | 
| 246 | 0 | { | 
| 247 | 0 |     ASN1_OBJECT *obj; | 
| 248 | 0 |     X509_NAME_ENTRY *nentry; | 
| 249 |  | 
 | 
| 250 | 0 |     obj = OBJ_txt2obj(field, 0); | 
| 251 | 0 |     if (obj == NULL) { | 
| 252 | 0 |         ERR_raise_data(ERR_LIB_X509, X509_R_INVALID_FIELD_NAME, | 
| 253 | 0 |                        "name=%s", 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 |         ERR_raise(ERR_LIB_X509, 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 |         ERR_raise(ERR_LIB_X509, ERR_R_PASSED_NULL_PARAMETER); | 
| 310 | 0 |         return 0; | 
| 311 | 0 |     } | 
| 312 | 0 |     ASN1_OBJECT_free(ne->object); | 
| 313 | 0 |     ne->object = OBJ_dup(obj); | 
| 314 | 0 |     return ((ne->object == NULL) ? 0 : 1); | 
| 315 | 0 | } | 
| 316 |  |  | 
| 317 |  | int X509_NAME_ENTRY_set_data(X509_NAME_ENTRY *ne, int type, | 
| 318 |  |                              const unsigned char *bytes, int len) | 
| 319 | 0 | { | 
| 320 | 0 |     int i; | 
| 321 |  | 
 | 
| 322 | 0 |     if ((ne == NULL) || ((bytes == NULL) && (len != 0))) | 
| 323 | 0 |         return 0; | 
| 324 | 0 |     if ((type > 0) && (type & MBSTRING_FLAG)) | 
| 325 | 0 |         return ASN1_STRING_set_by_NID(&ne->value, bytes, | 
| 326 | 0 |                                       len, type, | 
| 327 | 0 |                                       OBJ_obj2nid(ne->object)) ? 1 : 0; | 
| 328 | 0 |     if (len < 0) | 
| 329 | 0 |         len = strlen((const char *)bytes); | 
| 330 | 0 |     i = ASN1_STRING_set(ne->value, bytes, len); | 
| 331 | 0 |     if (!i) | 
| 332 | 0 |         return 0; | 
| 333 | 0 |     if (type != V_ASN1_UNDEF) { | 
| 334 | 0 |         if (type == V_ASN1_APP_CHOOSE) | 
| 335 | 0 |             ne->value->type = ASN1_PRINTABLE_type(bytes, len); | 
| 336 | 0 |         else | 
| 337 | 0 |             ne->value->type = type; | 
| 338 | 0 |     } | 
| 339 | 0 |     return 1; | 
| 340 | 0 | } | 
| 341 |  |  | 
| 342 |  | ASN1_OBJECT *X509_NAME_ENTRY_get_object(const X509_NAME_ENTRY *ne) | 
| 343 | 55.9k | { | 
| 344 | 55.9k |     if (ne == NULL) | 
| 345 | 0 |         return NULL; | 
| 346 | 55.9k |     return ne->object; | 
| 347 | 55.9k | } | 
| 348 |  |  | 
| 349 |  | ASN1_STRING *X509_NAME_ENTRY_get_data(const X509_NAME_ENTRY *ne) | 
| 350 | 55.9k | { | 
| 351 | 55.9k |     if (ne == NULL) | 
| 352 | 0 |         return NULL; | 
| 353 | 55.9k |     return ne->value; | 
| 354 | 55.9k | } | 
| 355 |  |  | 
| 356 |  | int X509_NAME_ENTRY_set(const X509_NAME_ENTRY *ne) | 
| 357 | 87.2k | { | 
| 358 | 87.2k |     return ne->set; | 
| 359 | 87.2k | } |