diff options
Diffstat (limited to 'src/lib/libcrypto/x509/x509name.c')
| -rw-r--r-- | src/lib/libcrypto/x509/x509name.c | 205 | 
1 files changed, 115 insertions, 90 deletions
| diff --git a/src/lib/libcrypto/x509/x509name.c b/src/lib/libcrypto/x509/x509name.c index 650e71b1b5..4c20e03ece 100644 --- a/src/lib/libcrypto/x509/x509name.c +++ b/src/lib/libcrypto/x509/x509name.c | |||
| @@ -57,18 +57,14 @@ | |||
| 57 | */ | 57 | */ | 
| 58 | 58 | ||
| 59 | #include <stdio.h> | 59 | #include <stdio.h> | 
| 60 | #include "stack.h" | 60 | #include <openssl/stack.h> | 
| 61 | #include "cryptlib.h" | 61 | #include "cryptlib.h" | 
| 62 | #include "asn1.h" | 62 | #include <openssl/asn1.h> | 
| 63 | #include "objects.h" | 63 | #include <openssl/objects.h> | 
| 64 | #include "evp.h" | 64 | #include <openssl/evp.h> | 
| 65 | #include "x509.h" | 65 | #include <openssl/x509.h> | 
| 66 | 66 | ||
| 67 | int X509_NAME_get_text_by_NID(name,nid,buf,len) | 67 | int X509_NAME_get_text_by_NID(X509_NAME *name, int nid, char *buf, int len) | 
| 68 | X509_NAME *name; | ||
| 69 | int nid; | ||
| 70 | char *buf; | ||
| 71 | int len; | ||
| 72 | { | 68 | { | 
| 73 | ASN1_OBJECT *obj; | 69 | ASN1_OBJECT *obj; | 
| 74 | 70 | ||
| @@ -77,11 +73,8 @@ int len; | |||
| 77 | return(X509_NAME_get_text_by_OBJ(name,obj,buf,len)); | 73 | return(X509_NAME_get_text_by_OBJ(name,obj,buf,len)); | 
| 78 | } | 74 | } | 
| 79 | 75 | ||
| 80 | int X509_NAME_get_text_by_OBJ(name,obj,buf,len) | 76 | int X509_NAME_get_text_by_OBJ(X509_NAME *name, ASN1_OBJECT *obj, char *buf, | 
| 81 | X509_NAME *name; | 77 | int len) | 
| 82 | ASN1_OBJECT *obj; | ||
| 83 | char *buf; | ||
| 84 | int len; | ||
| 85 | { | 78 | { | 
| 86 | int i; | 79 | int i; | 
| 87 | ASN1_STRING *data; | 80 | ASN1_STRING *data; | 
| @@ -96,17 +89,13 @@ int len; | |||
| 96 | return(i); | 89 | return(i); | 
| 97 | } | 90 | } | 
| 98 | 91 | ||
| 99 | int X509_NAME_entry_count(name) | 92 | int X509_NAME_entry_count(X509_NAME *name) | 
| 100 | X509_NAME *name; | ||
| 101 | { | 93 | { | 
| 102 | if (name == NULL) return(0); | 94 | if (name == NULL) return(0); | 
| 103 | return(sk_num(name->entries)); | 95 | return(sk_X509_NAME_ENTRY_num(name->entries)); | 
| 104 | } | 96 | } | 
| 105 | 97 | ||
| 106 | int X509_NAME_get_index_by_NID(name,nid,lastpos) | 98 | int X509_NAME_get_index_by_NID(X509_NAME *name, int nid, int lastpos) | 
| 107 | X509_NAME *name; | ||
| 108 | int nid; | ||
| 109 | int lastpos; | ||
| 110 | { | 99 | { | 
| 111 | ASN1_OBJECT *obj; | 100 | ASN1_OBJECT *obj; | 
| 112 | 101 | ||
| @@ -116,61 +105,57 @@ int lastpos; | |||
| 116 | } | 105 | } | 
| 117 | 106 | ||
| 118 | /* NOTE: you should be passsing -1, not 0 as lastpos */ | 107 | /* NOTE: you should be passsing -1, not 0 as lastpos */ | 
| 119 | int X509_NAME_get_index_by_OBJ(name,obj,lastpos) | 108 | int X509_NAME_get_index_by_OBJ(X509_NAME *name, ASN1_OBJECT *obj, | 
| 120 | X509_NAME *name; | 109 | int lastpos) | 
| 121 | ASN1_OBJECT *obj; | ||
| 122 | int lastpos; | ||
| 123 | { | 110 | { | 
| 124 | int n; | 111 | int n; | 
| 125 | X509_NAME_ENTRY *ne; | 112 | X509_NAME_ENTRY *ne; | 
| 126 | STACK *sk; | 113 | STACK_OF(X509_NAME_ENTRY) *sk; | 
| 127 | 114 | ||
| 128 | if (name == NULL) return(-1); | 115 | if (name == NULL) return(-1); | 
| 129 | if (lastpos < 0) | 116 | if (lastpos < 0) | 
| 130 | lastpos= -1; | 117 | lastpos= -1; | 
| 131 | sk=name->entries; | 118 | sk=name->entries; | 
| 132 | n=sk_num(sk); | 119 | n=sk_X509_NAME_ENTRY_num(sk); | 
| 133 | for (lastpos++; lastpos < n; lastpos++) | 120 | for (lastpos++; lastpos < n; lastpos++) | 
| 134 | { | 121 | { | 
| 135 | ne=(X509_NAME_ENTRY *)sk_value(sk,lastpos); | 122 | ne=sk_X509_NAME_ENTRY_value(sk,lastpos); | 
| 136 | if (OBJ_cmp(ne->object,obj) == 0) | 123 | if (OBJ_cmp(ne->object,obj) == 0) | 
| 137 | return(lastpos); | 124 | return(lastpos); | 
| 138 | } | 125 | } | 
| 139 | return(-1); | 126 | return(-1); | 
| 140 | } | 127 | } | 
| 141 | 128 | ||
| 142 | X509_NAME_ENTRY *X509_NAME_get_entry(name,loc) | 129 | X509_NAME_ENTRY *X509_NAME_get_entry(X509_NAME *name, int loc) | 
| 143 | X509_NAME *name; | ||
| 144 | int loc; | ||
| 145 | { | 130 | { | 
| 146 | if ( (name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0)) | 131 | if(name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc | 
| 132 | || loc < 0) | ||
| 147 | return(NULL); | 133 | return(NULL); | 
| 148 | else | 134 | else | 
| 149 | return((X509_NAME_ENTRY *)sk_value(name->entries,loc)); | 135 | return(sk_X509_NAME_ENTRY_value(name->entries,loc)); | 
| 150 | } | 136 | } | 
| 151 | 137 | ||
| 152 | X509_NAME_ENTRY *X509_NAME_delete_entry(name,loc) | 138 | X509_NAME_ENTRY *X509_NAME_delete_entry(X509_NAME *name, int loc) | 
| 153 | X509_NAME *name; | ||
| 154 | int loc; | ||
| 155 | { | 139 | { | 
| 156 | X509_NAME_ENTRY *ret; | 140 | X509_NAME_ENTRY *ret; | 
| 157 | int i,j,n,set_prev,set_next; | 141 | int i,n,set_prev,set_next; | 
| 158 | STACK *sk; | 142 | STACK_OF(X509_NAME_ENTRY) *sk; | 
| 159 | 143 | ||
| 160 | if ((name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0)) | 144 | if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc | 
| 145 | || loc < 0) | ||
| 161 | return(NULL); | 146 | return(NULL); | 
| 162 | sk=name->entries; | 147 | sk=name->entries; | 
| 163 | ret=(X509_NAME_ENTRY *)sk_delete(sk,loc); | 148 | ret=sk_X509_NAME_ENTRY_delete(sk,loc); | 
| 164 | n=sk_num(sk); | 149 | n=sk_X509_NAME_ENTRY_num(sk); | 
| 165 | name->modified=1; | 150 | name->modified=1; | 
| 166 | if (loc == n) return(ret); | 151 | if (loc == n) return(ret); | 
| 167 | 152 | ||
| 168 | /* else we need to fixup the set field */ | 153 | /* else we need to fixup the set field */ | 
| 169 | if (loc != 0) | 154 | if (loc != 0) | 
| 170 | set_prev=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set; | 155 | set_prev=(sk_X509_NAME_ENTRY_value(sk,loc-1))->set; | 
| 171 | else | 156 | else | 
| 172 | set_prev=ret->set-1; | 157 | set_prev=ret->set-1; | 
| 173 | set_next=((X509_NAME_ENTRY *)sk_value(sk,loc))->set; | 158 | set_next=sk_X509_NAME_ENTRY_value(sk,loc)->set; | 
| 174 | 159 | ||
| 175 | /* set_prev is the previous set | 160 | /* set_prev is the previous set | 
| 176 | * set is the current set | 161 | * set is the current set | 
| @@ -181,29 +166,59 @@ int loc; | |||
| 181 | * so basically only if prev and next differ by 2, then | 166 | * so basically only if prev and next differ by 2, then | 
| 182 | * re-number down by 1 */ | 167 | * re-number down by 1 */ | 
| 183 | if (set_prev+1 < set_next) | 168 | if (set_prev+1 < set_next) | 
| 184 | { | ||
| 185 | j=set_next-set_prev-1; | ||
| 186 | for (i=loc; i<n; i++) | 169 | for (i=loc; i<n; i++) | 
| 187 | ((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set-=j; | 170 | sk_X509_NAME_ENTRY_value(sk,i)->set--; | 
| 188 | } | ||
| 189 | return(ret); | 171 | return(ret); | 
| 190 | } | 172 | } | 
| 191 | 173 | ||
| 174 | int X509_NAME_add_entry_by_OBJ(X509_NAME *name, ASN1_OBJECT *obj, int type, | ||
| 175 | unsigned char *bytes, int len, int loc, int set) | ||
| 176 | { | ||
| 177 | X509_NAME_ENTRY *ne; | ||
| 178 | int ret; | ||
| 179 | ne = X509_NAME_ENTRY_create_by_OBJ(NULL, obj, type, bytes, len); | ||
| 180 | if(!ne) return 0; | ||
| 181 | ret = X509_NAME_add_entry(name, ne, loc, set); | ||
| 182 | X509_NAME_ENTRY_free(ne); | ||
| 183 | return ret; | ||
| 184 | } | ||
| 185 | |||
| 186 | int X509_NAME_add_entry_by_NID(X509_NAME *name, int nid, int type, | ||
| 187 | unsigned char *bytes, int len, int loc, int set) | ||
| 188 | { | ||
| 189 | X509_NAME_ENTRY *ne; | ||
| 190 | int ret; | ||
| 191 | ne = X509_NAME_ENTRY_create_by_NID(NULL, nid, type, bytes, len); | ||
| 192 | if(!ne) return 0; | ||
| 193 | ret = X509_NAME_add_entry(name, ne, loc, set); | ||
| 194 | X509_NAME_ENTRY_free(ne); | ||
| 195 | return ret; | ||
| 196 | } | ||
| 197 | |||
| 198 | int X509_NAME_add_entry_by_txt(X509_NAME *name, char *field, int type, | ||
| 199 | unsigned char *bytes, int len, int loc, int set) | ||
| 200 | { | ||
| 201 | X509_NAME_ENTRY *ne; | ||
| 202 | int ret; | ||
| 203 | ne = X509_NAME_ENTRY_create_by_txt(NULL, field, type, bytes, len); | ||
| 204 | if(!ne) return 0; | ||
| 205 | ret = X509_NAME_add_entry(name, ne, loc, set); | ||
| 206 | X509_NAME_ENTRY_free(ne); | ||
| 207 | return ret; | ||
| 208 | } | ||
| 209 | |||
| 192 | /* if set is -1, append to previous set, 0 'a new one', and 1, | 210 | /* if set is -1, append to previous set, 0 'a new one', and 1, | 
| 193 | * prepend to the guy we are about to stomp on. */ | 211 | * prepend to the guy we are about to stomp on. */ | 
| 194 | int X509_NAME_add_entry(name,ne,loc,set) | 212 | int X509_NAME_add_entry(X509_NAME *name, X509_NAME_ENTRY *ne, int loc, | 
| 195 | X509_NAME *name; | 213 | int set) | 
| 196 | X509_NAME_ENTRY *ne; | ||
| 197 | int loc; | ||
| 198 | int set; | ||
| 199 | { | 214 | { | 
| 200 | X509_NAME_ENTRY *new_name=NULL; | 215 | X509_NAME_ENTRY *new_name=NULL; | 
| 201 | int n,i,inc; | 216 | int n,i,inc; | 
| 202 | STACK *sk; | 217 | STACK_OF(X509_NAME_ENTRY) *sk; | 
| 203 | 218 | ||
| 204 | if (name == NULL) return(0); | 219 | if (name == NULL) return(0); | 
| 205 | sk=name->entries; | 220 | sk=name->entries; | 
| 206 | n=sk_num(sk); | 221 | n=sk_X509_NAME_ENTRY_num(sk); | 
| 207 | if (loc > n) loc=n; | 222 | if (loc > n) loc=n; | 
| 208 | else if (loc < 0) loc=n; | 223 | else if (loc < 0) loc=n; | 
| 209 | 224 | ||
| @@ -218,7 +233,7 @@ int set; | |||
| 218 | } | 233 | } | 
| 219 | else | 234 | else | 
| 220 | { | 235 | { | 
| 221 | set=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set; | 236 | set=sk_X509_NAME_ENTRY_value(sk,loc-1)->set; | 
| 222 | inc=0; | 237 | inc=0; | 
| 223 | } | 238 | } | 
| 224 | } | 239 | } | 
| @@ -227,45 +242,60 @@ int set; | |||
| 227 | if (loc >= n) | 242 | if (loc >= n) | 
| 228 | { | 243 | { | 
| 229 | if (loc != 0) | 244 | if (loc != 0) | 
| 230 | set=((X509_NAME_ENTRY *) | 245 | set=sk_X509_NAME_ENTRY_value(sk,loc-1)->set+1; | 
| 231 | sk_value(sk,loc-1))->set+1; | ||
| 232 | else | 246 | else | 
| 233 | set=0; | 247 | set=0; | 
| 234 | } | 248 | } | 
| 235 | else | 249 | else | 
| 236 | set=((X509_NAME_ENTRY *)sk_value(sk,loc))->set; | 250 | set=sk_X509_NAME_ENTRY_value(sk,loc)->set; | 
| 237 | inc=(set == 0)?1:0; | 251 | inc=(set == 0)?1:0; | 
| 238 | } | 252 | } | 
| 239 | 253 | ||
| 240 | if ((new_name=X509_NAME_ENTRY_dup(ne)) == NULL) | 254 | if ((new_name=X509_NAME_ENTRY_dup(ne)) == NULL) | 
| 241 | goto err; | 255 | goto err; | 
| 242 | new_name->set=set; | 256 | new_name->set=set; | 
| 243 | if (!sk_insert(sk,(char *)new_name,loc)) | 257 | if (!sk_X509_NAME_ENTRY_insert(sk,new_name,loc)) | 
| 244 | { | 258 | { | 
| 245 | X509err(X509_F_X509_NAME_ADD_ENTRY,ERR_R_MALLOC_FAILURE); | 259 | X509err(X509_F_X509_NAME_ADD_ENTRY,ERR_R_MALLOC_FAILURE); | 
| 246 | goto err; | 260 | goto err; | 
| 247 | } | 261 | } | 
| 248 | if (inc) | 262 | if (inc) | 
| 249 | { | 263 | { | 
| 250 | n=sk_num(sk); | 264 | n=sk_X509_NAME_ENTRY_num(sk); | 
| 251 | for (i=loc+1; i<n; i++) | 265 | for (i=loc+1; i<n; i++) | 
| 252 | ((X509_NAME_ENTRY *)sk_value(sk,i-1))->set+=1; | 266 | sk_X509_NAME_ENTRY_value(sk,i-1)->set+=1; | 
| 253 | } | 267 | } | 
| 254 | return(1); | 268 | return(1); | 
| 255 | err: | 269 | err: | 
| 256 | if (new_name != NULL) | 270 | if (new_name != NULL) | 
| 257 | X509_NAME_ENTRY_free(ne); | 271 | X509_NAME_ENTRY_free(new_name); | 
| 258 | return(0); | 272 | return(0); | 
| 259 | } | 273 | } | 
| 260 | 274 | ||
| 261 | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_NID(ne,nid,type,bytes,len) | 275 | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_txt(X509_NAME_ENTRY **ne, | 
| 262 | X509_NAME_ENTRY **ne; | 276 | char *field, int type, unsigned char *bytes, int len) | 
| 263 | int nid; | ||
| 264 | int type; | ||
| 265 | unsigned char *bytes; | ||
| 266 | int len; | ||
| 267 | { | 277 | { | 
| 268 | ASN1_OBJECT *obj; | 278 | ASN1_OBJECT *obj; | 
| 279 | X509_NAME_ENTRY *nentry; | ||
| 280 | |||
| 281 | obj=OBJ_txt2obj(field, 0); | ||
| 282 | if (obj == NULL) | ||
| 283 | { | ||
| 284 | X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_TXT, | ||
| 285 | X509_R_INVALID_FIELD_NAME); | ||
| 286 | ERR_add_error_data(2, "name=", field); | ||
| 287 | return(NULL); | ||
| 288 | } | ||
| 289 | nentry = X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len); | ||
| 290 | ASN1_OBJECT_free(obj); | ||
| 291 | return nentry; | ||
| 292 | } | ||
| 293 | |||
| 294 | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_NID(X509_NAME_ENTRY **ne, int nid, | ||
| 295 | int type, unsigned char *bytes, int len) | ||
| 296 | { | ||
| 297 | ASN1_OBJECT *obj; | ||
| 298 | X509_NAME_ENTRY *nentry; | ||
| 269 | 299 | ||
| 270 | obj=OBJ_nid2obj(nid); | 300 | obj=OBJ_nid2obj(nid); | 
| 271 | if (obj == NULL) | 301 | if (obj == NULL) | 
| @@ -273,15 +303,13 @@ int len; | |||
| 273 | X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_NID,X509_R_UNKNOWN_NID); | 303 | X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_NID,X509_R_UNKNOWN_NID); | 
| 274 | return(NULL); | 304 | return(NULL); | 
| 275 | } | 305 | } | 
| 276 | return(X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len)); | 306 | nentry = X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len); | 
| 307 | ASN1_OBJECT_free(obj); | ||
| 308 | return nentry; | ||
| 277 | } | 309 | } | 
| 278 | 310 | ||
| 279 | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len) | 311 | X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_OBJ(X509_NAME_ENTRY **ne, | 
| 280 | X509_NAME_ENTRY **ne; | 312 | ASN1_OBJECT *obj, int type, unsigned char *bytes, int len) | 
| 281 | ASN1_OBJECT *obj; | ||
| 282 | int type; | ||
| 283 | unsigned char *bytes; | ||
| 284 | int len; | ||
| 285 | { | 313 | { | 
| 286 | X509_NAME_ENTRY *ret; | 314 | X509_NAME_ENTRY *ret; | 
| 287 | 315 | ||
| @@ -297,7 +325,7 @@ int len; | |||
| 297 | goto err; | 325 | goto err; | 
| 298 | if (!X509_NAME_ENTRY_set_data(ret,type,bytes,len)) | 326 | if (!X509_NAME_ENTRY_set_data(ret,type,bytes,len)) | 
| 299 | goto err; | 327 | goto err; | 
| 300 | 328 | ||
| 301 | if ((ne != NULL) && (*ne == NULL)) *ne=ret; | 329 | if ((ne != NULL) && (*ne == NULL)) *ne=ret; | 
| 302 | return(ret); | 330 | return(ret); | 
| 303 | err: | 331 | err: | 
| @@ -306,9 +334,7 @@ err: | |||
| 306 | return(NULL); | 334 | return(NULL); | 
| 307 | } | 335 | } | 
| 308 | 336 | ||
| 309 | int X509_NAME_ENTRY_set_object(ne,obj) | 337 | int X509_NAME_ENTRY_set_object(X509_NAME_ENTRY *ne, ASN1_OBJECT *obj) | 
| 310 | X509_NAME_ENTRY *ne; | ||
| 311 | ASN1_OBJECT *obj; | ||
| 312 | { | 338 | { | 
| 313 | if ((ne == NULL) || (obj == NULL)) | 339 | if ((ne == NULL) || (obj == NULL)) | 
| 314 | { | 340 | { | 
| @@ -320,15 +346,16 @@ ASN1_OBJECT *obj; | |||
| 320 | return((ne->object == NULL)?0:1); | 346 | return((ne->object == NULL)?0:1); | 
| 321 | } | 347 | } | 
| 322 | 348 | ||
| 323 | int X509_NAME_ENTRY_set_data(ne,type,bytes,len) | 349 | int X509_NAME_ENTRY_set_data(X509_NAME_ENTRY *ne, int type, | 
| 324 | X509_NAME_ENTRY *ne; | 350 | unsigned char *bytes, int len) | 
| 325 | int type; | ||
| 326 | unsigned char *bytes; | ||
| 327 | int len; | ||
| 328 | { | 351 | { | 
| 329 | int i; | 352 | int i; | 
| 330 | 353 | ||
| 331 | if ((ne == NULL) || ((bytes == NULL) && (len != 0))) return(0); | 354 | if ((ne == NULL) || ((bytes == NULL) && (len != 0))) return(0); | 
| 355 | if((type > 0) && (type & MBSTRING_FLAG)) | ||
| 356 | return ASN1_STRING_set_by_NID(&ne->value, bytes, | ||
| 357 | len, type, | ||
| 358 | OBJ_obj2nid(ne->object)) ? 1 : 0; | ||
| 332 | if (len < 0) len=strlen((char *)bytes); | 359 | if (len < 0) len=strlen((char *)bytes); | 
| 333 | i=ASN1_STRING_set(ne->value,bytes,len); | 360 | i=ASN1_STRING_set(ne->value,bytes,len); | 
| 334 | if (!i) return(0); | 361 | if (!i) return(0); | 
| @@ -342,15 +369,13 @@ int len; | |||
| 342 | return(1); | 369 | return(1); | 
| 343 | } | 370 | } | 
| 344 | 371 | ||
| 345 | ASN1_OBJECT *X509_NAME_ENTRY_get_object(ne) | 372 | ASN1_OBJECT *X509_NAME_ENTRY_get_object(X509_NAME_ENTRY *ne) | 
| 346 | X509_NAME_ENTRY *ne; | ||
| 347 | { | 373 | { | 
| 348 | if (ne == NULL) return(NULL); | 374 | if (ne == NULL) return(NULL); | 
| 349 | return(ne->object); | 375 | return(ne->object); | 
| 350 | } | 376 | } | 
| 351 | 377 | ||
| 352 | ASN1_STRING *X509_NAME_ENTRY_get_data(ne) | 378 | ASN1_STRING *X509_NAME_ENTRY_get_data(X509_NAME_ENTRY *ne) | 
| 353 | X509_NAME_ENTRY *ne; | ||
| 354 | { | 379 | { | 
| 355 | if (ne == NULL) return(NULL); | 380 | if (ne == NULL) return(NULL); | 
| 356 | return(ne->value); | 381 | return(ne->value); | 
