os/ossrv/ssl/libcrypto/src/crypto/x509/x509_obj.c
changeset 0 bde4ae8d615e
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/os/ossrv/ssl/libcrypto/src/crypto/x509/x509_obj.c	Fri Jun 15 03:10:57 2012 +0200
     1.3 @@ -0,0 +1,238 @@
     1.4 +/* crypto/x509/x509_obj.c */
     1.5 +/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
     1.6 + * All rights reserved.
     1.7 + *
     1.8 + * This package is an SSL implementation written
     1.9 + * by Eric Young (eay@cryptsoft.com).
    1.10 + * The implementation was written so as to conform with Netscapes SSL.
    1.11 + * 
    1.12 + * This library is free for commercial and non-commercial use as long as
    1.13 + * the following conditions are aheared to.  The following conditions
    1.14 + * apply to all code found in this distribution, be it the RC4, RSA,
    1.15 + * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
    1.16 + * included with this distribution is covered by the same copyright terms
    1.17 + * except that the holder is Tim Hudson (tjh@cryptsoft.com).
    1.18 + * 
    1.19 + * Copyright remains Eric Young's, and as such any Copyright notices in
    1.20 + * the code are not to be removed.
    1.21 + * If this package is used in a product, Eric Young should be given attribution
    1.22 + * as the author of the parts of the library used.
    1.23 + * This can be in the form of a textual message at program startup or
    1.24 + * in documentation (online or textual) provided with the package.
    1.25 + * 
    1.26 + * Redistribution and use in source and binary forms, with or without
    1.27 + * modification, are permitted provided that the following conditions
    1.28 + * are met:
    1.29 + * 1. Redistributions of source code must retain the copyright
    1.30 + *    notice, this list of conditions and the following disclaimer.
    1.31 + * 2. Redistributions in binary form must reproduce the above copyright
    1.32 + *    notice, this list of conditions and the following disclaimer in the
    1.33 + *    documentation and/or other materials provided with the distribution.
    1.34 + * 3. All advertising materials mentioning features or use of this software
    1.35 + *    must display the following acknowledgement:
    1.36 + *    "This product includes cryptographic software written by
    1.37 + *     Eric Young (eay@cryptsoft.com)"
    1.38 + *    The word 'cryptographic' can be left out if the rouines from the library
    1.39 + *    being used are not cryptographic related :-).
    1.40 + * 4. If you include any Windows specific code (or a derivative thereof) from 
    1.41 + *    the apps directory (application code) you must include an acknowledgement:
    1.42 + *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
    1.43 + * 
    1.44 + * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
    1.45 + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    1.46 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    1.47 + * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
    1.48 + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
    1.49 + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
    1.50 + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
    1.51 + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
    1.52 + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
    1.53 + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
    1.54 + * SUCH DAMAGE.
    1.55 + * 
    1.56 + * The licence and distribution terms for any publically available version or
    1.57 + * derivative of this code cannot be changed.  i.e. this code cannot simply be
    1.58 + * copied and put under another distribution licence
    1.59 + * [including the GNU Public Licence.]
    1.60 + */
    1.61 +/*
    1.62 + © Portions copyright (c) 2006 Nokia Corporation.  All rights reserved.
    1.63 + */
    1.64 +
    1.65 +#include <stdio.h>
    1.66 +#include "cryptlib.h"
    1.67 +#include <openssl/lhash.h>
    1.68 +#include <openssl/objects.h>
    1.69 +#include <openssl/x509.h>
    1.70 +#include <openssl/buffer.h>
    1.71 +#if (defined(SYMBIAN) && (defined(__WINSCW__) || defined(__WINS__)))
    1.72 +#include "libcrypto_wsd_macros.h"
    1.73 +#include "libcrypto_wsd.h"
    1.74 +#endif
    1.75 +
    1.76 +
    1.77 +EXPORT_C char *X509_NAME_oneline(X509_NAME *a, char *buf, int len)
    1.78 +	{
    1.79 +	X509_NAME_ENTRY *ne;
    1.80 +int i;
    1.81 +	int n,lold,l,l1,l2,num,j,type;
    1.82 +	const char *s;
    1.83 +	char *p;
    1.84 +	unsigned char *q;
    1.85 +	BUF_MEM *b=NULL;
    1.86 +#ifndef EMULATOR	
    1.87 +	static char hex[17]="0123456789ABCDEF";
    1.88 +#else
    1.89 +    static const char hex[17]="0123456789ABCDEF";	
    1.90 +#endif	
    1.91 +	int gs_doit[4];
    1.92 +	char tmp_buf[80];
    1.93 +#ifdef CHARSET_EBCDIC
    1.94 +	char ebcdic_buf[1024];
    1.95 +#endif
    1.96 +
    1.97 +	if (buf == NULL)
    1.98 +		{
    1.99 +		if ((b=BUF_MEM_new()) == NULL) goto err;
   1.100 +		if (!BUF_MEM_grow(b,200)) goto err;
   1.101 +		b->data[0]='\0';
   1.102 +		len=200;
   1.103 +		}
   1.104 +	if (a == NULL)
   1.105 +	    {
   1.106 +	    if(b)
   1.107 +		{
   1.108 +		buf=b->data;
   1.109 +		OPENSSL_free(b);
   1.110 +		}
   1.111 +	    strncpy(buf,"NO X509_NAME",len);
   1.112 +	    buf[len-1]='\0';
   1.113 +	    return buf;
   1.114 +	    }
   1.115 +
   1.116 +	len--; /* space for '\0' */
   1.117 +	l=0;
   1.118 +	for (i=0; i<sk_X509_NAME_ENTRY_num(a->entries); i++)
   1.119 +		{
   1.120 +		ne=sk_X509_NAME_ENTRY_value(a->entries,i);
   1.121 +		n=OBJ_obj2nid(ne->object);
   1.122 +		if ((n == NID_undef) || ((s=OBJ_nid2sn(n)) == NULL))
   1.123 +			{
   1.124 +			i2t_ASN1_OBJECT(tmp_buf,sizeof(tmp_buf),ne->object);
   1.125 +			s=tmp_buf;
   1.126 +			}
   1.127 +		l1=strlen(s);
   1.128 +
   1.129 +		type=ne->value->type;
   1.130 +		num=ne->value->length;
   1.131 +		q=ne->value->data;
   1.132 +#ifdef CHARSET_EBCDIC
   1.133 +                if (type == V_ASN1_GENERALSTRING ||
   1.134 +		    type == V_ASN1_VISIBLESTRING ||
   1.135 +		    type == V_ASN1_PRINTABLESTRING ||
   1.136 +		    type == V_ASN1_TELETEXSTRING ||
   1.137 +		    type == V_ASN1_VISIBLESTRING ||
   1.138 +		    type == V_ASN1_IA5STRING) {
   1.139 +                        ascii2ebcdic(ebcdic_buf, q,
   1.140 +				     (num > sizeof ebcdic_buf)
   1.141 +				     ? sizeof ebcdic_buf : num);
   1.142 +                        q=ebcdic_buf;
   1.143 +		}
   1.144 +#endif
   1.145 +
   1.146 +		if ((type == V_ASN1_GENERALSTRING) && ((num%4) == 0))
   1.147 +			{
   1.148 +			gs_doit[0]=gs_doit[1]=gs_doit[2]=gs_doit[3]=0;
   1.149 +			for (j=0; j<num; j++)
   1.150 +				if (q[j] != 0) gs_doit[j&3]=1;
   1.151 +
   1.152 +			if (gs_doit[0]|gs_doit[1]|gs_doit[2])
   1.153 +				gs_doit[0]=gs_doit[1]=gs_doit[2]=gs_doit[3]=1;
   1.154 +			else
   1.155 +				{
   1.156 +				gs_doit[0]=gs_doit[1]=gs_doit[2]=0;
   1.157 +				gs_doit[3]=1;
   1.158 +				}
   1.159 +			}
   1.160 +		else
   1.161 +			gs_doit[0]=gs_doit[1]=gs_doit[2]=gs_doit[3]=1;
   1.162 +
   1.163 +		for (l2=j=0; j<num; j++)
   1.164 +			{
   1.165 +			if (!gs_doit[j&3]) continue;
   1.166 +			l2++;
   1.167 +#ifndef CHARSET_EBCDIC
   1.168 +			if ((q[j] < ' ') || (q[j] > '~')) l2+=3;
   1.169 +#else
   1.170 +			if ((os_toascii[q[j]] < os_toascii[' ']) ||
   1.171 +			    (os_toascii[q[j]] > os_toascii['~'])) l2+=3;
   1.172 +#endif
   1.173 +			}
   1.174 +
   1.175 +		lold=l;
   1.176 +		l+=1+l1+1+l2;
   1.177 +		if (b != NULL)
   1.178 +			{
   1.179 +			if (!BUF_MEM_grow(b,l+1)) goto err;
   1.180 +			p= &(b->data[lold]);
   1.181 +			}
   1.182 +		else if (l > len)
   1.183 +			{
   1.184 +			break;
   1.185 +			}
   1.186 +		else
   1.187 +			p= &(buf[lold]);
   1.188 +		*(p++)='/';
   1.189 +		memcpy(p,s,(unsigned int)l1); p+=l1;
   1.190 +		*(p++)='=';
   1.191 +
   1.192 +#ifndef CHARSET_EBCDIC /* q was assigned above already. */
   1.193 +		q=ne->value->data;
   1.194 +#endif
   1.195 +
   1.196 +		for (j=0; j<num; j++)
   1.197 +			{
   1.198 +			if (!gs_doit[j&3]) continue;
   1.199 +#ifndef CHARSET_EBCDIC
   1.200 +			n=q[j];
   1.201 +			if ((n < ' ') || (n > '~'))
   1.202 +				{
   1.203 +				*(p++)='\\';
   1.204 +				*(p++)='x';
   1.205 +				*(p++)=hex[(n>>4)&0x0f];
   1.206 +				*(p++)=hex[n&0x0f];
   1.207 +				}
   1.208 +			else
   1.209 +				*(p++)=n;
   1.210 +#else
   1.211 +			n=os_toascii[q[j]];
   1.212 +			if ((n < os_toascii[' ']) ||
   1.213 +			    (n > os_toascii['~']))
   1.214 +				{
   1.215 +				*(p++)='\\';
   1.216 +				*(p++)='x';
   1.217 +				*(p++)=hex[(n>>4)&0x0f];
   1.218 +				*(p++)=hex[n&0x0f];
   1.219 +				}
   1.220 +			else
   1.221 +				*(p++)=q[j];
   1.222 +#endif
   1.223 +			}
   1.224 +		*p='\0';
   1.225 +		}
   1.226 +	if (b != NULL)
   1.227 +		{
   1.228 +		p=b->data;
   1.229 +		OPENSSL_free(b);
   1.230 +		}
   1.231 +	else
   1.232 +		p=buf;
   1.233 +	if (i == 0)
   1.234 +		*p = '\0';
   1.235 +	return(p);
   1.236 +err:
   1.237 +	X509err(X509_F_X509_NAME_ONELINE,ERR_R_MALLOC_FAILURE);
   1.238 +	if (b != NULL) BUF_MEM_free(b);
   1.239 +	return(NULL);
   1.240 +	}
   1.241 +