
git-svn-id: svn://svn.h5l.se/heimdal/trunk/heimdal@15751 ec53bebd-3082-4978-b11e-865c3cabbd6b
324 lines
8.1 KiB
C
324 lines
8.1 KiB
C
/*
|
|
* Copyright (c) 2004 - 2005 Kungliga Tekniska Högskolan
|
|
* (Royal Institute of Technology, Stockholm, Sweden).
|
|
* All rights reserved.
|
|
*
|
|
* 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 above 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. Neither the name of the Institute nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``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 INSTITUTE 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.
|
|
*/
|
|
|
|
#include "hx_locl.h"
|
|
RCSID("$Id$");
|
|
|
|
/*
|
|
* name parsing from rfc2253
|
|
* fix so parsing rfc1779 works too
|
|
* rfc3280
|
|
*/
|
|
|
|
#define oid_enc(n) { sizeof(n)/sizeof(n[0]), n }
|
|
|
|
static unsigned country_num[] = { 2, 5, 4, 6 };
|
|
static heim_oid country_oid = oid_enc(country_num);
|
|
static unsigned organizationName_num[] = { 2, 5, 4, 10 };
|
|
static heim_oid organizationName_oid = oid_enc(organizationName_num);
|
|
static unsigned commonName_num[] = { 2, 5, 4, 3 };
|
|
static heim_oid commonName_oid = oid_enc(commonName_num);
|
|
static unsigned localityName_num[] = { 2, 5, 4, 7 };
|
|
static heim_oid localityName_oid = oid_enc(localityName_num);
|
|
static unsigned email_num[] = { 1, 2, 840, 113549, 1, 9, 1 };
|
|
static heim_oid email_oid = oid_enc(email_num);
|
|
static unsigned uid_num[] = { 0, 9, 2342, 19200300, 100, 1, 1 };
|
|
static heim_oid uid_oid = oid_enc(uid_num);
|
|
|
|
static const struct {
|
|
char *n;
|
|
heim_oid *o;
|
|
} no[] = {
|
|
{ "C", &country_oid },
|
|
{ "CN", &commonName_oid },
|
|
{ "O", &organizationName_oid },
|
|
{ "L", &localityName_oid },
|
|
{ "Email", &email_oid },
|
|
{ "UID", &uid_oid }
|
|
};
|
|
|
|
static char *
|
|
quote_string(const char *f, size_t len, size_t *rlen)
|
|
{
|
|
size_t i, j, tolen;
|
|
const unsigned char *from = f;
|
|
unsigned char *to;
|
|
|
|
tolen = len * 3 + 1;
|
|
to = malloc(tolen);
|
|
if (to == NULL)
|
|
return NULL;
|
|
|
|
for (i = 0, j = 0; i < len; i++) {
|
|
if (from[i] == ' ' && i + 1 < len)
|
|
to[j++] = from[i];
|
|
else if (from[i] == ',' || from[i] == '=' || from[i] == '+' ||
|
|
from[i] == '<' || from[i] == '>' || from[i] == '#' ||
|
|
from[i] == ';' || from[i] == ' ')
|
|
{
|
|
to[j++] = '\\';
|
|
to[j++] = from[i];
|
|
} else if (from[i] >= 32 && from[i] <= 127) {
|
|
to[j++] = from[i];
|
|
} else {
|
|
int l = snprintf(&to[j], tolen - j - 1,
|
|
"#%02x", (unsigned int)from[i]);
|
|
j += l;
|
|
}
|
|
}
|
|
to[j] = '\0';
|
|
*rlen = j;
|
|
return to;
|
|
}
|
|
|
|
|
|
static int
|
|
append_string(char **str, size_t *total_len, char *ss, size_t len, int quote)
|
|
{
|
|
char *s, *qs;
|
|
|
|
if (quote)
|
|
qs = quote_string(ss, len, &len);
|
|
else
|
|
qs = ss;
|
|
|
|
s = realloc(*str, len + *total_len + 1);
|
|
if (s == NULL)
|
|
abort();
|
|
memcpy(s + *total_len, qs, len);
|
|
if (qs != ss)
|
|
free(qs);
|
|
s[*total_len + len] = '\0';
|
|
*str = s;
|
|
*total_len += len;
|
|
return 0;
|
|
}
|
|
|
|
static char *
|
|
oidtostring(const heim_oid *type)
|
|
{
|
|
char *s = NULL, *ss;
|
|
size_t i, total_len = 0;
|
|
|
|
for (i = 0; i < sizeof(no)/sizeof(no[0]); i++) {
|
|
if (heim_oid_cmp(no[i].o, type) == 0)
|
|
return strdup(no[i].n);
|
|
}
|
|
|
|
for (i = 0; i < type->length; i++) {
|
|
asprintf(&ss, "%u", type->components[i]);
|
|
append_string(&s, &total_len, ss, strlen(ss), 0);
|
|
if (i + 1 < type->length)
|
|
append_string(&s, &total_len, ".", 1, 0);
|
|
}
|
|
return s;
|
|
}
|
|
|
|
int
|
|
hx509_name_to_string(const hx509_name name, char **str)
|
|
{
|
|
const Name *n = &name->der_name;
|
|
ssize_t total_len = 0;
|
|
int i, j;
|
|
|
|
*str = strdup("");
|
|
if (*str == NULL)
|
|
return ENOMEM;
|
|
|
|
for (i = 0 ; i < n->u.rdnSequence.len; i++) {
|
|
char *ss;
|
|
int len;
|
|
|
|
for (j = 0; j < n->u.rdnSequence.val[i].len; j++) {
|
|
DirectoryString *ds = &n->u.rdnSequence.val[i].val[j].value;
|
|
char *oidname;
|
|
|
|
oidname = oidtostring(&n->u.rdnSequence.val[i].val[j].type);
|
|
|
|
switch(ds->element) {
|
|
case choice_DirectoryString_ia5String:
|
|
ss = ds->u.ia5String;
|
|
break;
|
|
case choice_DirectoryString_printableString:
|
|
ss = ds->u.ia5String;
|
|
break;
|
|
case choice_DirectoryString_utf8String:
|
|
ss = ds->u.ia5String;
|
|
break;
|
|
#if 0
|
|
case choice_DirectoryString_bmpstring:
|
|
ss = ds->u.bmpstring;
|
|
break;
|
|
#endif
|
|
default:
|
|
abort();
|
|
}
|
|
append_string(str, &total_len, oidname, strlen(oidname), 0);
|
|
free(oidname);
|
|
append_string(str, &total_len, "=", 1, 0);
|
|
len = strlen(ss);
|
|
append_string(str, &total_len, ss, len, 1);
|
|
if (j + 1 < n->u.rdnSequence.val[i].len)
|
|
append_string(str, &total_len, "+", 1, 0);
|
|
}
|
|
|
|
if (i + 1 < n->u.rdnSequence.len)
|
|
append_string(str, &total_len, ", ", 2, 0);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* XXX this function is broken, it needs to compare code points, not
|
|
* bytes.
|
|
*/
|
|
|
|
int
|
|
_hx509_name_ds_cmp(const DirectoryString *ds1, const DirectoryString *ds2)
|
|
{
|
|
int c;
|
|
|
|
c = ds1->element - ds2->element;
|
|
if (c)
|
|
return c;
|
|
|
|
switch(ds1->element) {
|
|
case choice_DirectoryString_ia5String:
|
|
c = strcmp(ds1->u.ia5String, ds2->u.ia5String);
|
|
break;
|
|
case choice_DirectoryString_teletexString:
|
|
c = heim_octet_string_cmp(&ds1->u.teletexString,
|
|
&ds2->u.teletexString);
|
|
break;
|
|
case choice_DirectoryString_printableString:
|
|
c = strcmp(ds1->u.printableString, ds2->u.printableString);
|
|
break;
|
|
case choice_DirectoryString_utf8String:
|
|
c = strcmp(ds1->u.utf8String, ds2->u.utf8String);
|
|
break;
|
|
case choice_DirectoryString_universalString:
|
|
c = heim_universal_string_cmp(&ds1->u.universalString,
|
|
&ds2->u.universalString);
|
|
break;
|
|
case choice_DirectoryString_bmpString:
|
|
c = heim_bmp_string_cmp(&ds1->u.bmpString,
|
|
&ds2->u.bmpString);
|
|
break;
|
|
default:
|
|
c = 1;
|
|
break;
|
|
}
|
|
return c;
|
|
}
|
|
|
|
int
|
|
_hx509_name_cmp(const Name *n1, const Name *n2)
|
|
{
|
|
int i, j, c;
|
|
|
|
c = n1->u.rdnSequence.len - n2->u.rdnSequence.len;
|
|
if (c)
|
|
return c;
|
|
|
|
for (i = 0 ; i < n1->u.rdnSequence.len; i++) {
|
|
c = n1->u.rdnSequence.val[i].len - n2->u.rdnSequence.val[i].len;
|
|
if (c)
|
|
return c;
|
|
|
|
for (j = 0; j < n1->u.rdnSequence.val[i].len; j++) {
|
|
c = heim_oid_cmp(&n1->u.rdnSequence.val[i].val[j].type,
|
|
&n1->u.rdnSequence.val[i].val[j].type);
|
|
if (c)
|
|
return c;
|
|
|
|
c = _hx509_name_ds_cmp(&n1->u.rdnSequence.val[i].val[j].value,
|
|
&n2->u.rdnSequence.val[i].val[j].value);
|
|
if (c)
|
|
return c;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
_hx509_name_from_Name(const Name *n, hx509_name *name)
|
|
{
|
|
int ret;
|
|
*name = calloc(1, sizeof(**name));
|
|
if (*name == NULL)
|
|
return ENOMEM;
|
|
ret = copy_Name(n, &(*name)->der_name);
|
|
if (ret) {
|
|
free(*name);
|
|
*name = NULL;
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
static int
|
|
hx509_der_parse_name(const void *data, size_t length, hx509_name *name)
|
|
{
|
|
int ret;
|
|
Name n;
|
|
|
|
*name = NULL;
|
|
ret = decode_Name(data, length, &n, NULL);
|
|
if (ret)
|
|
return ret;
|
|
return _hx509_name_from_Name(&n, name);
|
|
}
|
|
|
|
void
|
|
hx509_name_free(hx509_name *name)
|
|
{
|
|
free_Name(&(*name)->der_name);
|
|
memset(*name, 0, sizeof(**name));
|
|
free(*name);
|
|
*name = NULL;
|
|
}
|
|
|
|
int
|
|
hx509_parse_name(const void *data, size_t length, char **str)
|
|
{
|
|
hx509_name name;
|
|
int ret;
|
|
|
|
ret = hx509_der_parse_name(data, length, &name);
|
|
if (ret)
|
|
return ret;
|
|
|
|
ret = hx509_name_to_string(name, str);
|
|
hx509_name_free(&name);
|
|
return ret;
|
|
}
|