crypto/x509/x509name.c

   1 /* crypto/x509/x509name.c */
   2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
   3  * All rights reserved.
   4  *
   5  * This package is an SSL implementation written
   6  * by Eric Young (eay@cryptsoft.com).
   7  * The implementation was written so as to conform with Netscapes SSL.
   8  *
   9  * This library is free for commercial and non-commercial use as long as
  10  * the following conditions are aheared to.  The following conditions
  11  * apply to all code found in this distribution, be it the RC4, RSA,
  12  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
  13  * included with this distribution is covered by the same copyright terms
  14  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  15  *
  16  * Copyright remains Eric Young's, and as such any Copyright notices in
  17  * the code are not to be removed.
  18  * If this package is used in a product, Eric Young should be given attribution
  19  * as the author of the parts of the library used.
  20  * This can be in the form of a textual message at program startup or
  21  * in documentation (online or textual) provided with the package.
  22  *
  23  * Redistribution and use in source and binary forms, with or without
  24  * modification, are permitted provided that the following conditions
  25  * are met:
  26  * 1. Redistributions of source code must retain the copyright
  27  *    notice, this list of conditions and the following disclaimer.
  28  * 2. Redistributions in binary form must reproduce the above copyright
  29  *    notice, this list of conditions and the following disclaimer in the
  30  *    documentation and/or other materials provided with the distribution.
  31  * 3. All advertising materials mentioning features or use of this software
  32  *    must display the following acknowledgement:
  33  *    "This product includes cryptographic software written by
  34  *     Eric Young (eay@cryptsoft.com)"
  35  *    The word 'cryptographic' can be left out if the rouines from the library
  36  *    being used are not cryptographic related :-).
  37  * 4. If you include any Windows specific code (or a derivative thereof) from
  38  *    the apps directory (application code) you must include an acknowledgement:
  39  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  40  *
  41  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  42  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  43  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  44  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  45  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  46  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  47  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  49  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  50  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  51  * SUCH DAMAGE.
  52  *
  53  * The licence and distribution terms for any publically available version or
  54  * derivative of this code cannot be changed.  i.e. this code cannot simply be
  55  * copied and put under another distribution licence
  56  * [including the GNU Public Licence.]
  57  */
  58
  59 #include <stdio.h>
  60 #include "stack.h"
  61 #include "cryptlib.h"
  62 #include "asn1.h"
  63 #include "objects.h"
  64 #include "evp.h"
  65 #include "x509.h"
  66
  67 int X509_NAME_get_text_by_NID(name,nid,buf,len)
  68 X509_NAME *name;
  69 int nid;
  70 char *buf;
  71 int len;
  72         {
  73         ASN1_OBJECT *obj;
  74
  75         obj=OBJ_nid2obj(nid);
  76         if (obj == NULL) return(-1);
  77         return(X509_NAME_get_text_by_OBJ(name,obj,buf,len));
  78         }
  79
  80 int X509_NAME_get_text_by_OBJ(name,obj,buf,len)
  81 X509_NAME *name;
  82 ASN1_OBJECT *obj;
  83 char *buf;
  84 int len;
  85         {
  86         int i;
  87         ASN1_STRING *data;
  88
  89         i=X509_NAME_get_index_by_OBJ(name,obj,-1);
  90         if (i < 0) return(-1);
  91         data=X509_NAME_ENTRY_get_data(X509_NAME_get_entry(name,i));
  92         i=(data->length > (len-1))?(len-1):data->length;
  93         if (buf == NULL) return(data->length);
  94         memcpy(buf,data->data,i);
  95         buf[i]='\0';
  96         return(i);
  97         }
  98
  99 int X509_NAME_entry_count(name)
 100 X509_NAME *name;
 101         {
 102         if (name == NULL) return(0);
 103         return(sk_num(name->entries));
 104         }
 105
 106 int X509_NAME_get_index_by_NID(name,nid,lastpos)
 107 X509_NAME *name;
 108 int nid;
 109 int lastpos;
 110         {
 111         ASN1_OBJECT *obj;
 112
 113         obj=OBJ_nid2obj(nid);
 114         if (obj == NULL) return(-2);
 115         return(X509_NAME_get_index_by_OBJ(name,obj,lastpos));
 116         }
 117
 118 /* NOTE: you should be passsing -1, not 0 as lastpos */
 119 int X509_NAME_get_index_by_OBJ(name,obj,lastpos)
 120 X509_NAME *name;
 121 ASN1_OBJECT *obj;
 122 int lastpos;
 123         {
 124         int n;
 125         X509_NAME_ENTRY *ne;
 126         STACK *sk;
 127
 128         if (name == NULL) return(-1);
 129         if (lastpos < 0)
 130                 lastpos= -1;
 131         sk=name->entries;
 132         n=sk_num(sk);
 133         for (lastpos++; lastpos < n; lastpos++)
 134                 {
 135                 ne=(X509_NAME_ENTRY *)sk_value(sk,lastpos);
 136                 if (OBJ_cmp(ne->object,obj) == 0)
 137                         return(lastpos);
 138                 }
 139         return(-1);
 140         }
 141
 142 X509_NAME_ENTRY *X509_NAME_get_entry(name,loc)
 143 X509_NAME *name;
 144 int loc;
 145         {
 146         if (    (name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0))
 147                 return(NULL);
 148         else
 149                 return((X509_NAME_ENTRY *)sk_value(name->entries,loc));
 150         }
 151
 152 X509_NAME_ENTRY *X509_NAME_delete_entry(name,loc)
 153 X509_NAME *name;
 154 int loc;
 155         {
 156         X509_NAME_ENTRY *ret;
 157         int i,n,set_prev,set_next;
 158         STACK *sk;
 159
 160         if ((name == NULL) || (sk_num(name->entries) <= loc) || (loc < 0))
 161                 return(NULL);
 162         sk=name->entries;
 163         ret=(X509_NAME_ENTRY *)sk_delete(sk,loc);
 164         n=sk_num(sk);
 165         name->modified=1;
 166         if (loc == n) return(ret);
 167
 168         /* else we need to fixup the set field */
 169         if (loc != 0)
 170                 set_prev=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set;
 171         else
 172                 set_prev=ret->set-1;
 173         set_next=((X509_NAME_ENTRY *)sk_value(sk,loc))->set;
 174
 175         /* set_prev is the previous set
 176          * set is the current set
 177          * set_next is the following
 178          * prev  1 1    1 1     1 1     1 1
 179          * set   1      1       2       2
 180          * next  1 1    2 2     2 2     3 2
 181          * so basically only if prev and next differ by 2, then
 182          * re-number down by 1 */
 183         if (set_prev+1 < set_next)
 184                 for (i=loc; i<n; i++)
 185                         ((X509_NAME_ENTRY *)sk_value(sk,i))->set--;
 186         return(ret);
 187         }
 188
 189 /* if set is -1, append to previous set, 0 'a new one', and 1,
 190  * prepend to the guy we are about to stomp on. */
 191 int X509_NAME_add_entry(name,ne,loc,set)
 192 X509_NAME *name;
 193 X509_NAME_ENTRY *ne;
 194 int loc;
 195 int set;
 196         {
 197         X509_NAME_ENTRY *new_name=NULL;
 198         int n,i,inc;
 199         STACK *sk;
 200
 201         if (name == NULL) return(0);
 202         sk=name->entries;
 203         n=sk_num(sk);
 204         if (loc > n) loc=n;
 205         else if (loc < 0) loc=n;
 206
 207         name->modified=1;
 208
 209         if (set == -1)
 210                 {
 211                 if (loc == 0)
 212                         {
 213                         set=0;
 214                         inc=1;
 215                         }
 216                 else
 217                         {
 218                         set=((X509_NAME_ENTRY *)sk_value(sk,loc-1))->set;
 219                         inc=0;
 220                         }
 221                 }
 222         else /* if (set >= 0) */
 223                 {
 224                 if (loc >= n)
 225                         {
 226                         if (loc != 0)
 227                                 set=((X509_NAME_ENTRY *)
 228                                         sk_value(sk,loc-1))->set+1;
 229                         else
 230                                 set=0;
 231                         }
 232                 else
 233                         set=((X509_NAME_ENTRY *)sk_value(sk,loc))->set;
 234                 inc=(set == 0)?1:0;
 235                 }
 236
 237         if ((new_name=X509_NAME_ENTRY_dup(ne)) == NULL)
 238                 goto err;
 239         new_name->set=set;
 240         if (!sk_insert(sk,(char *)new_name,loc))
 241                 {
 242                 X509err(X509_F_X509_NAME_ADD_ENTRY,ERR_R_MALLOC_FAILURE);
 243                 goto err;
 244                 }
 245         if (inc)
 246                 {
 247                 n=sk_num(sk);
 248                 for (i=loc+1; i<n; i++)
 249                         ((X509_NAME_ENTRY *)sk_value(sk,i-1))->set+=1;
 250                 }
 251         return(1);
 252 err:
 253         if (new_name != NULL)
 254                 X509_NAME_ENTRY_free(new_name);
 255         return(0);
 256         }
 257
 258 X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_NID(ne,nid,type,bytes,len)
 259 X509_NAME_ENTRY **ne;
 260 int nid;
 261 int type;
 262 unsigned char *bytes;
 263 int len;
 264         {
 265         ASN1_OBJECT *obj;
 266
 267         obj=OBJ_nid2obj(nid);
 268         if (obj == NULL)
 269                 {
 270                 X509err(X509_F_X509_NAME_ENTRY_CREATE_BY_NID,X509_R_UNKNOWN_NID);
 271                 return(NULL);
 272                 }
 273         return(X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len));
 274         }
 275
 276 X509_NAME_ENTRY *X509_NAME_ENTRY_create_by_OBJ(ne,obj,type,bytes,len)
 277 X509_NAME_ENTRY **ne;
 278 ASN1_OBJECT *obj;
 279 int type;
 280 unsigned char *bytes;
 281 int len;
 282         {
 283         X509_NAME_ENTRY *ret;
 284
 285         if ((ne == NULL) || (*ne == NULL))
 286                 {
 287                 if ((ret=X509_NAME_ENTRY_new()) == NULL)
 288                         return(NULL);
 289                 }
 290         else
 291                 ret= *ne;
 292
 293         if (!X509_NAME_ENTRY_set_object(ret,obj))
 294                 goto err;
 295         if (!X509_NAME_ENTRY_set_data(ret,type,bytes,len))
 296                 goto err;
 297
 298         if ((ne != NULL) && (*ne == NULL)) *ne=ret;
 299         return(ret);
 300 err:
 301         if ((ne == NULL) || (ret != *ne))
 302                 X509_NAME_ENTRY_free(ret);
 303         return(NULL);
 304         }
 305
 306 int X509_NAME_ENTRY_set_object(ne,obj)
 307 X509_NAME_ENTRY *ne;
 308 ASN1_OBJECT *obj;
 309         {
 310         if ((ne == NULL) || (obj == NULL))
 311                 {
 312                 X509err(X509_F_X509_NAME_ENTRY_SET_OBJECT,ERR_R_PASSED_NULL_PARAMETER);
 313                 return(0);
 314                 }
 315         ASN1_OBJECT_free(ne->object);
 316         ne->object=OBJ_dup(obj);
 317         return((ne->object == NULL)?0:1);
 318         }
 319
 320 int X509_NAME_ENTRY_set_data(ne,type,bytes,len)
 321 X509_NAME_ENTRY *ne;
 322 int type;
 323 unsigned char *bytes;
 324 int len;
 325         {
 326         int i;
 327
 328         if ((ne == NULL) || ((bytes == NULL) && (len != 0))) return(0);
 329         if (len < 0) len=strlen((char *)bytes);
 330         i=ASN1_STRING_set(ne->value,bytes,len);
 331         if (!i) return(0);
 332         if (type != V_ASN1_UNDEF)
 333                 {
 334                 if (type == V_ASN1_APP_CHOOSE)
 335                         ne->value->type=ASN1_PRINTABLE_type(bytes,len);
 336                 else
 337                         ne->value->type=type;
 338                 }
 339         return(1);
 340         }
 341
 342 ASN1_OBJECT *X509_NAME_ENTRY_get_object(ne)
 343 X509_NAME_ENTRY *ne;
 344         {
 345         if (ne == NULL) return(NULL);
 346         return(ne->object);
 347         }
 348
 349 ASN1_STRING *X509_NAME_ENTRY_get_data(ne)
 350 X509_NAME_ENTRY *ne;
 351         {
 352         if (ne == NULL) return(NULL);
 353         return(ne->value);
 354         }
 355