crypto/x509/x509_obj.c

   1 /* crypto/x509/x509_obj.c */
   2 /* Copyright (C) 1995-1997 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 "cryptlib.h"
  61 #include "lhash.h"
  62 #include "objects.h"
  63 #include "x509.h"
  64 #include "buffer.h"
  65
  66 char *X509_NAME_oneline(a,buf,len)
  67 X509_NAME *a;
  68 char *buf;
  69 int len;
  70         {
  71         X509_NAME_ENTRY *ne;
  72         unsigned int i;
  73         int n,lold,l,l1,l2,num,j,type;
  74         char *s,*p;
  75         unsigned char *q;
  76         BUF_MEM *b=NULL;
  77         static char hex[17]="0123456789ABCDEF";
  78         int gs_doit[4];
  79
  80         if (a == NULL) return("NO X509_NAME");
  81         if (buf == NULL)
  82                 {
  83                 if ((b=BUF_MEM_new()) == NULL) goto err;
  84                 if (!BUF_MEM_grow(b,200)) goto err;
  85                 b->data[0]='\0';
  86                 len=200;
  87                 }
  88
  89         len--; /* space for '\0' */
  90         l=0;
  91         for (i=0; (int)i<sk_num(a->entries); i++)
  92                 {
  93                 ne=(X509_NAME_ENTRY *)sk_value(a->entries,i);
  94                 n=OBJ_obj2nid(ne->object);
  95                 if (n == NID_undef)
  96                         s="UNKNOWN";
  97                 else
  98                         {
  99                         s=OBJ_nid2sn(n);
 100                         if (s == NULL) s="UNKNOWN2";
 101                         }
 102                 l1=strlen(s);
 103
 104                 type=ne->value->type;
 105                 num=ne->value->length;
 106                 q=ne->value->data;
 107
 108                 if ((type == V_ASN1_GENERALSTRING) && ((num%4) == 0))
 109                         {
 110                         gs_doit[0]=gs_doit[1]=gs_doit[2]=gs_doit[3]=0;
 111                         for (j=0; j<num; j++)
 112                                 if (q[j] != 0) gs_doit[j&3]=1;
 113
 114                         if (gs_doit[0]|gs_doit[1]|gs_doit[2])
 115                                 gs_doit[0]=gs_doit[1]=gs_doit[2]=gs_doit[3]=1;
 116                         else
 117                                 {
 118                                 gs_doit[0]=gs_doit[1]=gs_doit[2]=0;
 119                                 gs_doit[3]=1;
 120                                 }
 121                         }
 122                 else
 123                         gs_doit[0]=gs_doit[1]=gs_doit[2]=gs_doit[3]=1;
 124
 125                 for (l2=j=0; j<num; j++)
 126                         {
 127                         if (!gs_doit[j&3]) continue;
 128                         l2++;
 129                         if ((q[j] < ' ') || (q[j] > '~')) l2+=3;
 130                         }
 131
 132                 lold=l;
 133                 l+=1+l1+1+l2;
 134                 if (b != NULL)
 135                         {
 136                         if (!BUF_MEM_grow(b,l+1)) goto err;
 137                         p= &(b->data[lold]);
 138                         }
 139                 else if (l > len)
 140                         {
 141                         break;
 142                         }
 143                 else
 144                         p= &(buf[lold]);
 145                 *(p++)='/';
 146                 memcpy(p,s,(unsigned int)l1); p+=l1;
 147                 *(p++)='=';
 148
 149                 q=ne->value->data;
 150
 151                 for (j=0; j<num; j++)
 152                         {
 153                         if (!gs_doit[j&3]) continue;
 154                         n=q[j];
 155                         if ((n < ' ') || (n > '~'))
 156                                 {
 157                                 *(p++)='\\';
 158                                 *(p++)='x';
 159                                 *(p++)=hex[(n>>4)&0x0f];
 160                                 *(p++)=hex[n&0x0f];
 161                                 }
 162                         else
 163                                 *(p++)=n;
 164                         }
 165                 *p='\0';
 166                 }
 167         if (b != NULL)
 168                 {
 169                 p=b->data;
 170                 Free((char *)b);
 171                 }
 172         else
 173                 p=buf;
 174         return(p);
 175 err:
 176         X509err(X509_F_X509_NAME_ONELINE,ERR_R_MALLOC_FAILURE);
 177         if (b != NULL) BUF_MEM_free(b);
 178         return(NULL);
 179         }
 180