1998-12-21 10:52:47 +00:00
|
|
|
/* crypto/asn1/x_name.c */
|
1998-12-21 10:56:39 +00:00
|
|
|
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
|
1998-12-21 10:52:47 +00:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This package is an SSL implementation written
|
|
|
|
* by Eric Young (eay@cryptsoft.com).
|
|
|
|
* The implementation was written so as to conform with Netscapes SSL.
|
|
|
|
*
|
|
|
|
* This library is free for commercial and non-commercial use as long as
|
|
|
|
* the following conditions are aheared to. The following conditions
|
|
|
|
* apply to all code found in this distribution, be it the RC4, RSA,
|
|
|
|
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
|
|
|
|
* included with this distribution is covered by the same copyright terms
|
|
|
|
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
|
|
|
|
*
|
|
|
|
* Copyright remains Eric Young's, and as such any Copyright notices in
|
|
|
|
* the code are not to be removed.
|
|
|
|
* If this package is used in a product, Eric Young should be given attribution
|
|
|
|
* as the author of the parts of the library used.
|
|
|
|
* This can be in the form of a textual message at program startup or
|
|
|
|
* in documentation (online or textual) provided with the package.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* "This product includes cryptographic software written by
|
|
|
|
* Eric Young (eay@cryptsoft.com)"
|
|
|
|
* The word 'cryptographic' can be left out if the rouines from the library
|
|
|
|
* being used are not cryptographic related :-).
|
|
|
|
* 4. If you include any Windows specific code (or a derivative thereof) from
|
|
|
|
* the apps directory (application code) you must include an acknowledgement:
|
|
|
|
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* The licence and distribution terms for any publically available version or
|
|
|
|
* derivative of this code cannot be changed. i.e. this code cannot simply be
|
|
|
|
* copied and put under another distribution licence
|
|
|
|
* [including the GNU Public Licence.]
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include "cryptlib.h"
|
2000-12-08 19:09:35 +00:00
|
|
|
#include <openssl/asn1t.h>
|
1999-07-21 22:10:23 +00:00
|
|
|
#include <openssl/x509.h>
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2004-03-15 23:15:26 +00:00
|
|
|
static int x509_name_ex_d2i(ASN1_VALUE **val, const unsigned char **in, long len, const ASN1_ITEM *it,
|
2000-12-08 19:09:35 +00:00
|
|
|
int tag, int aclass, char opt, ASN1_TLC *ctx);
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
static int x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass);
|
|
|
|
static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it);
|
|
|
|
static void x509_name_ex_free(ASN1_VALUE **val, const ASN1_ITEM *it);
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
static int x509_name_encode(X509_NAME *a);
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
ASN1_SEQUENCE(X509_NAME_ENTRY) = {
|
|
|
|
ASN1_SIMPLE(X509_NAME_ENTRY, object, ASN1_OBJECT),
|
|
|
|
ASN1_SIMPLE(X509_NAME_ENTRY, value, ASN1_PRINTABLE)
|
2001-02-23 12:47:06 +00:00
|
|
|
} ASN1_SEQUENCE_END(X509_NAME_ENTRY)
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
IMPLEMENT_ASN1_FUNCTIONS(X509_NAME_ENTRY)
|
2001-07-27 02:22:42 +00:00
|
|
|
IMPLEMENT_ASN1_DUP_FUNCTION(X509_NAME_ENTRY)
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
/* For the "Name" type we need a SEQUENCE OF { SET OF X509_NAME_ENTRY }
|
|
|
|
* so declare two template wrappers for this
|
|
|
|
*/
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
ASN1_ITEM_TEMPLATE(X509_NAME_ENTRIES) =
|
|
|
|
ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SET_OF, 0, RDNS, X509_NAME_ENTRY)
|
2001-02-23 12:47:06 +00:00
|
|
|
ASN1_ITEM_TEMPLATE_END(X509_NAME_ENTRIES)
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
ASN1_ITEM_TEMPLATE(X509_NAME_INTERNAL) =
|
|
|
|
ASN1_EX_TEMPLATE_TYPE(ASN1_TFLG_SEQUENCE_OF, 0, Name, X509_NAME_ENTRIES)
|
2001-02-23 12:47:06 +00:00
|
|
|
ASN1_ITEM_TEMPLATE_END(X509_NAME_INTERNAL)
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
/* Normally that's where it would end: we'd have two nested STACK structures
|
|
|
|
* representing the ASN1. Unfortunately X509_NAME uses a completely different
|
|
|
|
* form and caches encodings so we have to process the internal form and convert
|
|
|
|
* to the external form.
|
|
|
|
*/
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
const ASN1_EXTERN_FUNCS x509_name_ff = {
|
|
|
|
NULL,
|
|
|
|
x509_name_ex_new,
|
|
|
|
x509_name_ex_free,
|
|
|
|
0, /* Default clear behaviour is OK */
|
|
|
|
x509_name_ex_d2i,
|
|
|
|
x509_name_ex_i2d
|
|
|
|
};
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
IMPLEMENT_EXTERN_ASN1(X509_NAME, V_ASN1_SEQUENCE, x509_name_ff)
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
IMPLEMENT_ASN1_FUNCTIONS(X509_NAME)
|
2001-07-27 02:22:42 +00:00
|
|
|
IMPLEMENT_ASN1_DUP_FUNCTION(X509_NAME)
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
static int x509_name_ex_new(ASN1_VALUE **val, const ASN1_ITEM *it)
|
|
|
|
{
|
|
|
|
X509_NAME *ret = NULL;
|
|
|
|
ret = OPENSSL_malloc(sizeof(X509_NAME));
|
|
|
|
if(!ret) goto memerr;
|
2000-05-31 17:41:34 +00:00
|
|
|
if ((ret->entries=sk_X509_NAME_ENTRY_new_null()) == NULL)
|
2000-12-08 19:09:35 +00:00
|
|
|
goto memerr;
|
|
|
|
if((ret->bytes = BUF_MEM_new()) == NULL) goto memerr;
|
1998-12-21 10:52:47 +00:00
|
|
|
ret->modified=1;
|
2000-12-08 19:09:35 +00:00
|
|
|
*val = (ASN1_VALUE *)ret;
|
|
|
|
return 1;
|
2001-03-05 11:09:43 +00:00
|
|
|
|
|
|
|
memerr:
|
2005-05-11 03:45:39 +00:00
|
|
|
ASN1err(ASN1_F_X509_NAME_EX_NEW, ERR_R_MALLOC_FAILURE);
|
2001-03-05 11:09:43 +00:00
|
|
|
if (ret)
|
|
|
|
{
|
|
|
|
if (ret->entries)
|
|
|
|
sk_X509_NAME_ENTRY_free(ret->entries);
|
|
|
|
OPENSSL_free(ret);
|
|
|
|
}
|
2000-12-08 19:09:35 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void x509_name_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it)
|
|
|
|
{
|
|
|
|
X509_NAME *a;
|
|
|
|
if(!pval || !*pval)
|
1999-01-07 19:15:59 +00:00
|
|
|
return;
|
2000-12-08 19:09:35 +00:00
|
|
|
a = (X509_NAME *)*pval;
|
1999-01-07 19:15:59 +00:00
|
|
|
|
1998-12-21 10:52:47 +00:00
|
|
|
BUF_MEM_free(a->bytes);
|
1999-05-01 17:40:57 +00:00
|
|
|
sk_X509_NAME_ENTRY_pop_free(a->entries,X509_NAME_ENTRY_free);
|
2000-06-01 22:19:21 +00:00
|
|
|
OPENSSL_free(a);
|
2000-12-08 19:09:35 +00:00
|
|
|
*pval = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Used with sk_pop_free() to free up the internal representation.
|
|
|
|
* NB: we only free the STACK and not its contents because it is
|
|
|
|
* already present in the X509_NAME structure.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static void sk_internal_free(void *a)
|
|
|
|
{
|
|
|
|
sk_free(a);
|
|
|
|
}
|
|
|
|
|
2004-03-15 23:15:26 +00:00
|
|
|
static int x509_name_ex_d2i(ASN1_VALUE **val, const unsigned char **in, long len, const ASN1_ITEM *it,
|
2000-12-08 19:09:35 +00:00
|
|
|
int tag, int aclass, char opt, ASN1_TLC *ctx)
|
|
|
|
{
|
2004-03-15 23:15:26 +00:00
|
|
|
const unsigned char *p = *in, *q;
|
2007-07-27 20:34:56 +00:00
|
|
|
union { STACK *s; ASN1_VALUE *a; } intname = {NULL};
|
|
|
|
union { X509_NAME *x; ASN1_VALUE *a; } nm = {NULL};
|
2000-12-08 19:09:35 +00:00
|
|
|
int i, j, ret;
|
|
|
|
STACK_OF(X509_NAME_ENTRY) *entries;
|
|
|
|
X509_NAME_ENTRY *entry;
|
|
|
|
q = p;
|
|
|
|
|
|
|
|
/* Get internal representation of Name */
|
2007-07-27 20:34:56 +00:00
|
|
|
ret = ASN1_item_ex_d2i(&intname.a,
|
2005-01-27 01:47:31 +00:00
|
|
|
&p, len, ASN1_ITEM_rptr(X509_NAME_INTERNAL),
|
|
|
|
tag, aclass, opt, ctx);
|
2000-12-08 19:09:35 +00:00
|
|
|
|
|
|
|
if(ret <= 0) return ret;
|
|
|
|
|
|
|
|
if(*val) x509_name_ex_free(val, NULL);
|
2007-07-27 20:34:56 +00:00
|
|
|
if(!x509_name_ex_new(&nm.a, NULL)) goto err;
|
2000-12-08 19:09:35 +00:00
|
|
|
/* We've decoded it: now cache encoding */
|
2007-07-27 20:34:56 +00:00
|
|
|
if(!BUF_MEM_grow(nm.x->bytes, p - q)) goto err;
|
|
|
|
memcpy(nm.x->bytes->data, q, p - q);
|
2000-12-08 19:09:35 +00:00
|
|
|
|
|
|
|
/* Convert internal representation to X509_NAME structure */
|
2007-07-27 20:34:56 +00:00
|
|
|
for(i = 0; i < sk_num(intname.s); i++) {
|
|
|
|
entries = (STACK_OF(X509_NAME_ENTRY) *)sk_value(intname.s, i);
|
2000-12-08 19:09:35 +00:00
|
|
|
for(j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
|
|
|
|
entry = sk_X509_NAME_ENTRY_value(entries, j);
|
|
|
|
entry->set = i;
|
2007-07-27 20:34:56 +00:00
|
|
|
if(!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
|
2000-12-08 19:09:35 +00:00
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
sk_X509_NAME_ENTRY_free(entries);
|
1998-12-21 10:52:47 +00:00
|
|
|
}
|
2007-07-27 20:34:56 +00:00
|
|
|
sk_free(intname.s);
|
|
|
|
nm.x->modified = 0;
|
|
|
|
*val = nm.a;
|
2000-12-08 19:09:35 +00:00
|
|
|
*in = p;
|
|
|
|
return ret;
|
2011-09-05 09:56:48 +00:00
|
|
|
err:
|
|
|
|
if (nm.x != NULL)
|
|
|
|
X509_NAME_free(nm.x);
|
2005-05-11 03:45:39 +00:00
|
|
|
ASN1err(ASN1_F_X509_NAME_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
|
2000-12-08 19:09:35 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int x509_name_ex_i2d(ASN1_VALUE **val, unsigned char **out, const ASN1_ITEM *it, int tag, int aclass)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
X509_NAME *a = (X509_NAME *)*val;
|
|
|
|
if(a->modified) {
|
|
|
|
ret = x509_name_encode((X509_NAME *)a);
|
|
|
|
if(ret < 0) return ret;
|
|
|
|
}
|
|
|
|
ret = a->bytes->length;
|
|
|
|
if(out != NULL) {
|
|
|
|
memcpy(*out,a->bytes->data,ret);
|
|
|
|
*out+=ret;
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2000-12-08 19:09:35 +00:00
|
|
|
static int x509_name_encode(X509_NAME *a)
|
|
|
|
{
|
2007-07-27 20:34:56 +00:00
|
|
|
union { STACK *s; ASN1_VALUE *a; } intname = {NULL};
|
2000-12-08 19:09:35 +00:00
|
|
|
int len;
|
|
|
|
unsigned char *p;
|
|
|
|
STACK_OF(X509_NAME_ENTRY) *entries = NULL;
|
|
|
|
X509_NAME_ENTRY *entry;
|
|
|
|
int i, set = -1;
|
2007-07-27 20:34:56 +00:00
|
|
|
intname.s = sk_new_null();
|
|
|
|
if(!intname.s) goto memerr;
|
2000-12-08 19:09:35 +00:00
|
|
|
for(i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) {
|
|
|
|
entry = sk_X509_NAME_ENTRY_value(a->entries, i);
|
|
|
|
if(entry->set != set) {
|
|
|
|
entries = sk_X509_NAME_ENTRY_new_null();
|
|
|
|
if(!entries) goto memerr;
|
2007-07-27 20:34:56 +00:00
|
|
|
if(!sk_push(intname.s, (char *)entries)) goto memerr;
|
2000-12-08 19:09:35 +00:00
|
|
|
set = entry->set;
|
|
|
|
}
|
|
|
|
if(!sk_X509_NAME_ENTRY_push(entries, entry)) goto memerr;
|
1998-12-21 10:52:47 +00:00
|
|
|
}
|
2007-07-27 20:34:56 +00:00
|
|
|
len = ASN1_item_ex_i2d(&intname.a, NULL,
|
2005-01-27 01:47:31 +00:00
|
|
|
ASN1_ITEM_rptr(X509_NAME_INTERNAL), -1, -1);
|
2000-12-08 19:09:35 +00:00
|
|
|
if (!BUF_MEM_grow(a->bytes,len)) goto memerr;
|
|
|
|
p=(unsigned char *)a->bytes->data;
|
2007-07-27 20:34:56 +00:00
|
|
|
ASN1_item_ex_i2d(&intname.a,
|
2005-01-27 01:47:31 +00:00
|
|
|
&p, ASN1_ITEM_rptr(X509_NAME_INTERNAL), -1, -1);
|
2007-07-27 20:34:56 +00:00
|
|
|
sk_pop_free(intname.s, sk_internal_free);
|
2000-12-08 19:09:35 +00:00
|
|
|
a->modified = 0;
|
|
|
|
return len;
|
|
|
|
memerr:
|
2007-07-27 20:34:56 +00:00
|
|
|
sk_pop_free(intname.s, sk_internal_free);
|
2005-05-11 03:45:39 +00:00
|
|
|
ASN1err(ASN1_F_X509_NAME_ENCODE, ERR_R_MALLOC_FAILURE);
|
2000-12-08 19:09:35 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
1998-12-21 10:52:47 +00:00
|
|
|
|
1999-04-19 21:31:43 +00:00
|
|
|
int X509_NAME_set(X509_NAME **xn, X509_NAME *name)
|
1998-12-21 10:52:47 +00:00
|
|
|
{
|
|
|
|
X509_NAME *in;
|
|
|
|
|
2001-01-11 23:24:28 +00:00
|
|
|
if (!xn || !name) return(0);
|
1998-12-21 10:52:47 +00:00
|
|
|
|
|
|
|
if (*xn != name)
|
|
|
|
{
|
|
|
|
in=X509_NAME_dup(name);
|
|
|
|
if (in != NULL)
|
|
|
|
{
|
|
|
|
X509_NAME_free(*xn);
|
|
|
|
*xn=in;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return(*xn != NULL);
|
|
|
|
}
|
|
|
|
|
1999-05-01 17:40:57 +00:00
|
|
|
IMPLEMENT_STACK_OF(X509_NAME_ENTRY)
|
|
|
|
IMPLEMENT_ASN1_SET_OF(X509_NAME_ENTRY)
|