1999-02-09 01:30:41 +00:00
|
|
|
/* crypto/asn1/a_enum.c */
|
|
|
|
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
|
|
|
|
* 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"
|
1999-04-23 22:13:45 +00:00
|
|
|
#include <openssl/asn1.h>
|
1999-02-09 01:30:41 +00:00
|
|
|
|
1999-05-14 18:21:21 +00:00
|
|
|
/*
|
|
|
|
* Code for ENUMERATED type: identical to INTEGER apart from a different tag.
|
|
|
|
* for comments on encoding see a_int.c
|
|
|
|
*/
|
1999-02-09 01:30:41 +00:00
|
|
|
|
1999-10-20 01:50:23 +00:00
|
|
|
ASN1_ENUMERATED *ASN1_ENUMERATED_new(void)
|
|
|
|
{ return M_ASN1_ENUMERATED_new(); }
|
|
|
|
|
|
|
|
void ASN1_ENUMERATED_free(ASN1_ENUMERATED *x)
|
1999-10-23 09:19:42 +00:00
|
|
|
{ M_ASN1_ENUMERATED_free(x); }
|
1999-10-20 01:50:23 +00:00
|
|
|
|
1999-04-19 21:31:43 +00:00
|
|
|
int i2d_ASN1_ENUMERATED(ASN1_ENUMERATED *a, unsigned char **pp)
|
1999-02-09 01:30:41 +00:00
|
|
|
{
|
|
|
|
int pad=0,ret,r,i,t;
|
1999-05-14 18:21:21 +00:00
|
|
|
unsigned char *p,*n,pb=0;
|
1999-02-09 01:30:41 +00:00
|
|
|
|
|
|
|
if ((a == NULL) || (a->data == NULL)) return(0);
|
|
|
|
t=a->type;
|
|
|
|
if (a->length == 0)
|
|
|
|
ret=1;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
ret=a->length;
|
|
|
|
i=a->data[0];
|
1999-05-14 18:21:21 +00:00
|
|
|
if ((t == V_ASN1_ENUMERATED) && (i > 127)) {
|
1999-02-09 01:30:41 +00:00
|
|
|
pad=1;
|
|
|
|
pb=0;
|
1999-05-14 18:21:21 +00:00
|
|
|
} else if(t == V_ASN1_NEG_ENUMERATED) {
|
|
|
|
if(i>128) {
|
|
|
|
pad=1;
|
|
|
|
pb=0xFF;
|
|
|
|
} else if(i == 128) {
|
|
|
|
for(i = 1; i < a->length; i++) if(a->data[i]) {
|
|
|
|
pad=1;
|
|
|
|
pb=0xFF;
|
|
|
|
break;
|
|
|
|
}
|
1999-02-09 01:30:41 +00:00
|
|
|
}
|
1999-05-14 18:21:21 +00:00
|
|
|
}
|
1999-02-09 01:30:41 +00:00
|
|
|
ret+=pad;
|
|
|
|
}
|
|
|
|
r=ASN1_object_size(0,ret,V_ASN1_ENUMERATED);
|
|
|
|
if (pp == NULL) return(r);
|
|
|
|
p= *pp;
|
|
|
|
|
|
|
|
ASN1_put_object(&p,0,ret,V_ASN1_ENUMERATED,V_ASN1_UNIVERSAL);
|
|
|
|
if (pad) *(p++)=pb;
|
|
|
|
if (a->length == 0)
|
|
|
|
*(p++)=0;
|
|
|
|
else if (t == V_ASN1_ENUMERATED)
|
|
|
|
{
|
|
|
|
memcpy(p,a->data,(unsigned int)a->length);
|
|
|
|
p+=a->length;
|
|
|
|
}
|
1999-05-14 18:21:21 +00:00
|
|
|
else {
|
|
|
|
/* Begin at the end of the encoding */
|
|
|
|
n=a->data + a->length - 1;
|
|
|
|
p += a->length - 1;
|
|
|
|
i = a->length;
|
|
|
|
/* Copy zeros to destination as long as source is zero */
|
|
|
|
while(!*n) {
|
|
|
|
*(p--) = 0;
|
|
|
|
n--;
|
|
|
|
i--;
|
1999-02-09 01:30:41 +00:00
|
|
|
}
|
1999-05-14 18:21:21 +00:00
|
|
|
/* Complement and increment next octet */
|
|
|
|
*(p--) = ((*(n--)) ^ 0xff) + 1;
|
|
|
|
i--;
|
|
|
|
/* Complement any octets left */
|
|
|
|
for(;i > 0; i--) *(p--) = *(n--) ^ 0xff;
|
|
|
|
p += a->length;
|
|
|
|
}
|
1999-02-09 01:30:41 +00:00
|
|
|
|
|
|
|
*pp=p;
|
|
|
|
return(r);
|
|
|
|
}
|
|
|
|
|
1999-04-19 21:31:43 +00:00
|
|
|
ASN1_ENUMERATED *d2i_ASN1_ENUMERATED(ASN1_ENUMERATED **a, unsigned char **pp,
|
|
|
|
long length)
|
1999-02-09 01:30:41 +00:00
|
|
|
{
|
|
|
|
ASN1_ENUMERATED *ret=NULL;
|
|
|
|
unsigned char *p,*to,*s;
|
|
|
|
long len;
|
|
|
|
int inf,tag,xclass;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if ((a == NULL) || ((*a) == NULL))
|
|
|
|
{
|
1999-10-20 01:50:23 +00:00
|
|
|
if ((ret=M_ASN1_ENUMERATED_new()) == NULL) return(NULL);
|
1999-02-09 01:30:41 +00:00
|
|
|
ret->type=V_ASN1_ENUMERATED;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ret=(*a);
|
|
|
|
|
|
|
|
p= *pp;
|
|
|
|
inf=ASN1_get_object(&p,&len,&tag,&xclass,length);
|
|
|
|
if (inf & 0x80)
|
|
|
|
{
|
|
|
|
i=ASN1_R_BAD_OBJECT_HEADER;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (tag != V_ASN1_ENUMERATED)
|
|
|
|
{
|
|
|
|
i=ASN1_R_EXPECTING_AN_ENUMERATED;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We must Malloc stuff, even for 0 bytes otherwise it
|
|
|
|
* signifies a missing NULL parameter. */
|
|
|
|
s=(unsigned char *)Malloc((int)len+1);
|
|
|
|
if (s == NULL)
|
|
|
|
{
|
|
|
|
i=ERR_R_MALLOC_FAILURE;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
to=s;
|
1999-12-10 13:46:48 +00:00
|
|
|
if(!len) {
|
|
|
|
/* Strictly speaking this is an illegal ENUMERATED but we
|
|
|
|
* tolerate it.
|
|
|
|
*/
|
1999-12-13 13:14:14 +00:00
|
|
|
ret->type=V_ASN1_ENUMERATED;
|
1999-12-10 13:46:48 +00:00
|
|
|
} else if (*p & 0x80) /* a negative number */
|
1999-02-09 01:30:41 +00:00
|
|
|
{
|
|
|
|
ret->type=V_ASN1_NEG_ENUMERATED;
|
1999-05-14 18:21:21 +00:00
|
|
|
if ((*p == 0xff) && (len != 1)) {
|
1999-02-09 01:30:41 +00:00
|
|
|
p++;
|
|
|
|
len--;
|
|
|
|
}
|
1999-05-14 18:21:21 +00:00
|
|
|
i = len;
|
|
|
|
p += i - 1;
|
|
|
|
to += i - 1;
|
|
|
|
while((!*p) && i) {
|
|
|
|
*(to--) = 0;
|
|
|
|
i--;
|
|
|
|
p--;
|
|
|
|
}
|
|
|
|
if(!i) {
|
|
|
|
*s = 1;
|
|
|
|
s[len] = 0;
|
|
|
|
p += len;
|
|
|
|
len++;
|
|
|
|
} else {
|
|
|
|
*(to--) = (*(p--) ^ 0xff) + 1;
|
|
|
|
i--;
|
|
|
|
for(;i > 0; i--) *(to--) = *(p--) ^ 0xff;
|
|
|
|
p += len;
|
|
|
|
}
|
|
|
|
} else {
|
1999-02-09 01:30:41 +00:00
|
|
|
ret->type=V_ASN1_ENUMERATED;
|
|
|
|
if ((*p == 0) && (len != 1))
|
|
|
|
{
|
|
|
|
p++;
|
|
|
|
len--;
|
|
|
|
}
|
|
|
|
memcpy(s,p,(int)len);
|
|
|
|
p+=len;
|
1999-05-14 18:21:21 +00:00
|
|
|
}
|
1999-02-09 01:30:41 +00:00
|
|
|
|
2000-01-30 23:33:40 +00:00
|
|
|
if (ret->data != NULL) Free(ret->data);
|
1999-02-09 01:30:41 +00:00
|
|
|
ret->data=s;
|
|
|
|
ret->length=(int)len;
|
|
|
|
if (a != NULL) (*a)=ret;
|
|
|
|
*pp=p;
|
|
|
|
return(ret);
|
|
|
|
err:
|
|
|
|
ASN1err(ASN1_F_D2I_ASN1_ENUMERATED,i);
|
|
|
|
if ((ret != NULL) && ((a == NULL) || (*a != ret)))
|
1999-10-20 01:50:23 +00:00
|
|
|
M_ASN1_ENUMERATED_free(ret);
|
1999-02-09 01:30:41 +00:00
|
|
|
return(NULL);
|
|
|
|
}
|
|
|
|
|
1999-04-19 21:31:43 +00:00
|
|
|
int ASN1_ENUMERATED_set(ASN1_ENUMERATED *a, long v)
|
1999-02-09 01:30:41 +00:00
|
|
|
{
|
|
|
|
int i,j,k;
|
|
|
|
unsigned char buf[sizeof(long)+1];
|
|
|
|
long d;
|
|
|
|
|
|
|
|
a->type=V_ASN1_ENUMERATED;
|
|
|
|
if (a->length < (sizeof(long)+1))
|
|
|
|
{
|
|
|
|
if (a->data != NULL)
|
2000-01-30 23:33:40 +00:00
|
|
|
Free(a->data);
|
1999-02-09 01:30:41 +00:00
|
|
|
if ((a->data=(unsigned char *)Malloc(sizeof(long)+1)) != NULL)
|
|
|
|
memset((char *)a->data,0,sizeof(long)+1);
|
|
|
|
}
|
|
|
|
if (a->data == NULL)
|
|
|
|
{
|
|
|
|
ASN1err(ASN1_F_ASN1_ENUMERATED_SET,ERR_R_MALLOC_FAILURE);
|
|
|
|
return(0);
|
|
|
|
}
|
|
|
|
d=v;
|
|
|
|
if (d < 0)
|
|
|
|
{
|
|
|
|
d= -d;
|
|
|
|
a->type=V_ASN1_NEG_ENUMERATED;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i=0; i<sizeof(long); i++)
|
|
|
|
{
|
|
|
|
if (d == 0) break;
|
|
|
|
buf[i]=(int)d&0xff;
|
|
|
|
d>>=8;
|
|
|
|
}
|
|
|
|
j=0;
|
|
|
|
for (k=i-1; k >=0; k--)
|
|
|
|
a->data[j++]=buf[k];
|
|
|
|
a->length=j;
|
|
|
|
return(1);
|
|
|
|
}
|
|
|
|
|
1999-04-19 21:31:43 +00:00
|
|
|
long ASN1_ENUMERATED_get(ASN1_ENUMERATED *a)
|
1999-02-09 01:30:41 +00:00
|
|
|
{
|
|
|
|
int neg=0,i;
|
|
|
|
long r=0;
|
|
|
|
|
|
|
|
if (a == NULL) return(0L);
|
|
|
|
i=a->type;
|
|
|
|
if (i == V_ASN1_NEG_ENUMERATED)
|
|
|
|
neg=1;
|
|
|
|
else if (i != V_ASN1_ENUMERATED)
|
|
|
|
return(0);
|
|
|
|
|
|
|
|
if (a->length > sizeof(long))
|
|
|
|
{
|
|
|
|
/* hmm... a bit ugly */
|
|
|
|
return(0xffffffffL);
|
|
|
|
}
|
|
|
|
if (a->data == NULL)
|
|
|
|
return(0);
|
|
|
|
|
|
|
|
for (i=0; i<a->length; i++)
|
|
|
|
{
|
|
|
|
r<<=8;
|
|
|
|
r|=(unsigned char)a->data[i];
|
|
|
|
}
|
|
|
|
if (neg) r= -r;
|
|
|
|
return(r);
|
|
|
|
}
|
|
|
|
|
1999-04-19 21:31:43 +00:00
|
|
|
ASN1_ENUMERATED *BN_to_ASN1_ENUMERATED(BIGNUM *bn, ASN1_ENUMERATED *ai)
|
1999-02-09 01:30:41 +00:00
|
|
|
{
|
|
|
|
ASN1_ENUMERATED *ret;
|
|
|
|
int len,j;
|
|
|
|
|
|
|
|
if (ai == NULL)
|
1999-10-20 01:50:23 +00:00
|
|
|
ret=M_ASN1_ENUMERATED_new();
|
1999-02-09 01:30:41 +00:00
|
|
|
else
|
|
|
|
ret=ai;
|
|
|
|
if (ret == NULL)
|
|
|
|
{
|
|
|
|
ASN1err(ASN1_F_BN_TO_ASN1_ENUMERATED,ERR_R_NESTED_ASN1_ERROR);
|
|
|
|
goto err;
|
|
|
|
}
|
1999-05-14 18:21:21 +00:00
|
|
|
if(bn->neg) ret->type = V_ASN1_NEG_ENUMERATED;
|
|
|
|
else ret->type=V_ASN1_ENUMERATED;
|
1999-02-09 01:30:41 +00:00
|
|
|
j=BN_num_bits(bn);
|
|
|
|
len=((j == 0)?0:((j/8)+1));
|
|
|
|
ret->data=(unsigned char *)Malloc(len+4);
|
|
|
|
ret->length=BN_bn2bin(bn,ret->data);
|
|
|
|
return(ret);
|
|
|
|
err:
|
1999-10-20 01:50:23 +00:00
|
|
|
if (ret != ai) M_ASN1_ENUMERATED_free(ret);
|
1999-02-09 01:30:41 +00:00
|
|
|
return(NULL);
|
|
|
|
}
|
|
|
|
|
1999-04-19 21:31:43 +00:00
|
|
|
BIGNUM *ASN1_ENUMERATED_to_BN(ASN1_ENUMERATED *ai, BIGNUM *bn)
|
1999-02-09 01:30:41 +00:00
|
|
|
{
|
|
|
|
BIGNUM *ret;
|
|
|
|
|
|
|
|
if ((ret=BN_bin2bn(ai->data,ai->length,bn)) == NULL)
|
|
|
|
ASN1err(ASN1_F_ASN1_ENUMERATED_TO_BN,ASN1_R_BN_LIB);
|
1999-05-14 18:21:21 +00:00
|
|
|
if(ai->type == V_ASN1_NEG_ENUMERATED) bn->neg = 1;
|
1999-02-09 01:30:41 +00:00
|
|
|
return(ret);
|
|
|
|
}
|