2008-05-07 13:39:42 +00:00
|
|
|
/*
|
2011-10-05 07:23:29 +00:00
|
|
|
* Copyright (c) 2003 - 2005 Kungliga Tekniska Högskolan
|
|
|
|
* (Royal Institute of Technology, Stockholm, Sweden).
|
|
|
|
* All rights reserved.
|
2008-05-07 13:39:42 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* Portions Copyright (c) 2009 Apple Inc. All rights reserved.
|
2008-05-07 13:39:42 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
2008-05-07 13:39:42 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
2008-05-07 13:39:42 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* 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.
|
2008-05-07 13:39:42 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* 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.
|
2008-05-07 13:39:42 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "der_locl.h"
|
|
|
|
#include "heim_asn1.h"
|
|
|
|
|
2011-10-05 07:23:29 +00:00
|
|
|
RCSID("$Id$");
|
2008-05-07 13:39:42 +00:00
|
|
|
|
|
|
|
int
|
2011-10-05 07:23:29 +00:00
|
|
|
encode_heim_any(unsigned char *p, size_t len,
|
2008-05-07 13:39:42 +00:00
|
|
|
const heim_any *data, size_t *size)
|
|
|
|
{
|
2011-10-05 07:23:29 +00:00
|
|
|
return der_put_octet_string (p, len, data, size);
|
2008-05-07 13:39:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2011-10-05 07:23:29 +00:00
|
|
|
decode_heim_any(const unsigned char *p, size_t len,
|
2008-05-07 13:39:42 +00:00
|
|
|
heim_any *data, size_t *size)
|
|
|
|
{
|
|
|
|
size_t len_len, length, l;
|
|
|
|
Der_class thisclass;
|
|
|
|
Der_type thistype;
|
|
|
|
unsigned int thistag;
|
|
|
|
int e;
|
|
|
|
|
|
|
|
memset(data, 0, sizeof(*data));
|
|
|
|
|
|
|
|
e = der_get_tag (p, len, &thisclass, &thistype, &thistag, &l);
|
|
|
|
if (e) return e;
|
|
|
|
if (l > len)
|
|
|
|
return ASN1_OVERFLOW;
|
|
|
|
e = der_get_length(p + l, len - l, &length, &len_len);
|
|
|
|
if (e) return e;
|
2011-10-05 07:23:29 +00:00
|
|
|
if (length == ASN1_INDEFINITE) {
|
|
|
|
if (len < len_len + l)
|
|
|
|
return ASN1_OVERFLOW;
|
|
|
|
length = len - (len_len + l);
|
|
|
|
} else {
|
|
|
|
if (len < length + len_len + l)
|
|
|
|
return ASN1_OVERFLOW;
|
|
|
|
}
|
2008-05-07 13:39:42 +00:00
|
|
|
|
|
|
|
data->data = malloc(length + len_len + l);
|
|
|
|
if (data->data == NULL)
|
|
|
|
return ENOMEM;
|
|
|
|
data->length = length + len_len + l;
|
|
|
|
memcpy(data->data, p, length + len_len + l);
|
|
|
|
|
|
|
|
if (size)
|
|
|
|
*size = length + len_len + l;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
free_heim_any(heim_any *data)
|
|
|
|
{
|
2011-10-05 07:23:29 +00:00
|
|
|
der_free_octet_string(data);
|
2008-05-07 13:39:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
size_t
|
|
|
|
length_heim_any(const heim_any *data)
|
|
|
|
{
|
|
|
|
return data->length;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
copy_heim_any(const heim_any *from, heim_any *to)
|
|
|
|
{
|
2011-10-05 07:23:29 +00:00
|
|
|
return der_copy_octet_string(from, to);
|
2008-05-07 13:39:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2011-10-05 07:23:29 +00:00
|
|
|
encode_heim_any_set(unsigned char *p, size_t len,
|
2008-05-07 13:39:42 +00:00
|
|
|
const heim_any_set *data, size_t *size)
|
|
|
|
{
|
2011-10-05 07:23:29 +00:00
|
|
|
return der_put_octet_string (p, len, data, size);
|
2008-05-07 13:39:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2011-10-05 07:23:29 +00:00
|
|
|
decode_heim_any_set(const unsigned char *p, size_t len,
|
2008-05-07 13:39:42 +00:00
|
|
|
heim_any_set *data, size_t *size)
|
|
|
|
{
|
2011-10-05 07:23:29 +00:00
|
|
|
return der_get_octet_string(p, len, data, size);
|
2008-05-07 13:39:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
free_heim_any_set(heim_any_set *data)
|
|
|
|
{
|
2011-10-05 07:23:29 +00:00
|
|
|
der_free_octet_string(data);
|
2008-05-07 13:39:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
size_t
|
|
|
|
length_heim_any_set(const heim_any *data)
|
|
|
|
{
|
2011-10-05 07:23:29 +00:00
|
|
|
return data->length;
|
2008-05-07 13:39:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
copy_heim_any_set(const heim_any_set *from, heim_any_set *to)
|
|
|
|
{
|
2011-10-05 07:23:29 +00:00
|
|
|
return der_copy_octet_string(from, to);
|
2008-05-07 13:39:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
heim_any_cmp(const heim_any_set *p, const heim_any_set *q)
|
|
|
|
{
|
2011-10-05 07:23:29 +00:00
|
|
|
return der_heim_octet_string_cmp(p, q);
|
2008-05-07 13:39:42 +00:00
|
|
|
}
|