[thirdparty/openssl.git] / crypto / asn1 / a_set.c

/* crypto/asn1/a_set.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"
#include "asn1_mac.h"

/* ASN1err(ASN1_F_ASN1_TYPE_NEW,ERR_R_MALLOC_FAILURE);
 */
typedef struct
    {
    unsigned char *pbData;
    int cbData;
    } MYBLOB;

/* SetBlobCmp
 * This function compares two elements of SET_OF block
 */
static int SetBlobCmp(const void *elem1, const void *elem2 )
    {
    const MYBLOB *b1 = (const MYBLOB *)elem1;
    const MYBLOB *b2 = (const MYBLOB *)elem2;
    int r;

    r = memcmp(b1->pbData, b2->pbData,
	       b1->cbData < b2->cbData ? b1->cbData : b2->cbData);
    if(r != 0)
	return r;
    return b1->cbData-b2->cbData;
    }

int i2d_ASN1_SET(a,pp,func,ex_tag,ex_class,is_set)
STACK *a;
unsigned char **pp;
int (*func)();
int ex_tag;
int ex_class;
int is_set;	/* if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) */

	{
	int ret=0,r;
	int i;
	unsigned char *p;
        unsigned char *pStart, *pTempMem;
        MYBLOB *rgSetBlob;
        int totSize;

	if (a == NULL) return(0);
	for (i=sk_num(a)-1; i>=0; i--)
		ret+=func(sk_value(a,i),NULL);
	r=ASN1_object_size(1,ret,ex_tag);
	if (pp == NULL) return(r);

	p= *pp;
	ASN1_put_object(&p,1,ret,ex_tag,ex_class);

/* Modified by gp@nsj.co.jp */
	/* And then again by Ben */
	/* And again by Steve */

	if(!is_set || (sk_num(a) < 2))
		{
		for (i=0; i<sk_num(a); i++)
                	func(sk_value(a,i),&p);

		*pp=p;
		return(r);
		}

        pStart  = p; /* Catch the beg of Setblobs*/
        rgSetBlob = (MYBLOB *)Malloc( sk_num(a) * sizeof(MYBLOB)); /* In this array
we will store the SET blobs */

        for (i=0; i<sk_num(a); i++)
	        {
                rgSetBlob[i].pbData = p;  /* catch each set encode blob */
                func(sk_value(a,i),&p);
                rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; /* Length of this
SetBlob
*/
		}
        *pp=p;
        totSize = p - pStart; /* This is the total size of all set blobs */

 /* Now we have to sort the blobs. I am using a simple algo.
    *Sort ptrs *Copy to temp-mem *Copy from temp-mem to user-mem*/
        qsort( rgSetBlob, sk_num(a), sizeof(MYBLOB), SetBlobCmp);
        pTempMem = Malloc(totSize);

/* Copy to temp mem */
        p = pTempMem;
        for(i=0; i<sk_num(a); ++i)
		{
                memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData);
                p += rgSetBlob[i].cbData;
		}

/* Copy back to user mem*/
        memcpy(pStart, pTempMem, totSize);
        Free(pTempMem);
        Free(rgSetBlob);

        return(r);
        }

STACK *d2i_ASN1_SET(a,pp,length,func,free_func,ex_tag,ex_class)
STACK **a;
unsigned char **pp;
long length;
char *(*func)();
void (*free_func)();
int ex_tag;
int ex_class;
	{
	ASN1_CTX c;
	STACK *ret=NULL;

	if ((a == NULL) || ((*a) == NULL))
		{ if ((ret=sk_new(NULL)) == NULL) goto err; }
	else
		ret=(*a);

	c.p= *pp;
	c.max=(length == 0)?0:(c.p+length);

	c.inf=ASN1_get_object(&c.p,&c.slen,&c.tag,&c.xclass,c.max-c.p);
	if (c.inf & 0x80) goto err;
	if (ex_class != c.xclass)
		{
		ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_CLASS);
		goto err;
		}
	if (ex_tag != c.tag)
		{
		ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_TAG);
		goto err;
		}
	if ((c.slen+c.p) > c.max)
		{
		ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_LENGTH_ERROR);
		goto err;
		}
	/* check for infinite constructed - it can be as long
	 * as the amount of data passed to us */
	if (c.inf == (V_ASN1_CONSTRUCTED+1))
		c.slen=length+ *pp-c.p;
	c.max=c.p+c.slen;

	while (c.p < c.max)
		{
		char *s;

		if (M_ASN1_D2I_end_sequence()) break;
		if ((s=func(NULL,&c.p,c.slen,c.max-c.p)) == NULL)
			{
			ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_ERROR_PARSING_SET_ELEMENT);
			asn1_add_error(*pp,(int)(c.q- *pp));
			goto err;
			}
		if (!sk_push(ret,s)) goto err;
		}
	if (a != NULL) (*a)=ret;
	*pp=c.p;
	return(ret);
err:
	if ((ret != NULL) && ((a == NULL) || (*a != ret)))
		{
		if (free_func != NULL)
			sk_pop_free(ret,free_func);
		else
			sk_free(ret);
		}
	return(NULL);
	}
Commit	Line	Data
d02b48c6	1	/* crypto/asn1/a_set.c */
58964a49	2	/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
d02b48c6 RE	3	* All rights reserved.
	4	*
	5	* This package is an SSL implementation written
	6	* by Eric Young (eay@cryptsoft.com).
	7	* The implementation was written so as to conform with Netscapes SSL.
	8	*
	9	* This library is free for commercial and non-commercial use as long as
	10	* the following conditions are aheared to. The following conditions
	11	* apply to all code found in this distribution, be it the RC4, RSA,
	12	* lhash, DES, etc., code; not just the SSL code. The SSL documentation
	13	* included with this distribution is covered by the same copyright terms
	14	* except that the holder is Tim Hudson (tjh@cryptsoft.com).
	15	*
	16	* Copyright remains Eric Young's, and as such any Copyright notices in
	17	* the code are not to be removed.
	18	* If this package is used in a product, Eric Young should be given attribution
	19	* as the author of the parts of the library used.
	20	* This can be in the form of a textual message at program startup or
	21	* in documentation (online or textual) provided with the package.
	22	*
	23	* Redistribution and use in source and binary forms, with or without
	24	* modification, are permitted provided that the following conditions
	25	* are met:
	26	* 1. Redistributions of source code must retain the copyright
	27	* notice, this list of conditions and the following disclaimer.
	28	* 2. Redistributions in binary form must reproduce the above copyright
	29	* notice, this list of conditions and the following disclaimer in the
	30	* documentation and/or other materials provided with the distribution.
	31	* 3. All advertising materials mentioning features or use of this software
	32	* must display the following acknowledgement:
	33	* "This product includes cryptographic software written by
	34	* Eric Young (eay@cryptsoft.com)"
	35	* The word 'cryptographic' can be left out if the rouines from the library
	36	* being used are not cryptographic related :-).
	37	* 4. If you include any Windows specific code (or a derivative thereof) from
	38	* the apps directory (application code) you must include an acknowledgement:
	39	* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
	40	*
	41	* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
	42	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	43	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	44	* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
	45	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	46	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	47	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	48	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	49	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	50	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	51	* SUCH DAMAGE.
	52	*
	53	* The licence and distribution terms for any publically available version or
	54	* derivative of this code cannot be changed. i.e. this code cannot simply be
	55	* copied and put under another distribution licence
	56	* [including the GNU Public Licence.]
	57	*/
	58
	59	#include <stdio.h>
	60	#include "cryptlib.h"
	61	#include "asn1_mac.h"
	62
	63	/* ASN1err(ASN1_F_ASN1_TYPE_NEW,ERR_R_MALLOC_FAILURE);
	64	*/
4098e89c BL	65	typedef struct
	66	{
	67	unsigned char *pbData;
	68	int cbData;
	69	} MYBLOB;
d02b48c6	70
4098e89c BL	71	/* SetBlobCmp
	72	* This function compares two elements of SET_OF block
	73	*/
	74	static int SetBlobCmp(const void elem1, const void elem2 )
	75	{
e778802f BL	76	const MYBLOB b1 = (const MYBLOB )elem1;
e778802f BL	77	const MYBLOB b2 = (const MYBLOB )elem2;
4098e89c BL	78	int r;
	79
	80	r = memcmp(b1->pbData, b2->pbData,
	81	b1->cbData < b2->cbData ? b1->cbData : b2->cbData);
	82	if(r != 0)
	83	return r;
	84	return b1->cbData-b2->cbData;
	85	}
	86
	87	int i2d_ASN1_SET(a,pp,func,ex_tag,ex_class,is_set)
d02b48c6 RE	88	STACK *a;
	89	unsigned char **pp;
	90	int (*func)();
	91	int ex_tag;
	92	int ex_class;
4098e89c BL	93	int is_set; /* if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) */
4098e89c BL	94
d02b48c6 RE	95	{
	96	int ret=0,r;
	97	int i;
	98	unsigned char *p;
4098e89c BL	99	unsigned char pStart, pTempMem;
	100	MYBLOB *rgSetBlob;
	101	int totSize;
d02b48c6 RE	102
	103	if (a == NULL) return(0);
	104	for (i=sk_num(a)-1; i>=0; i--)
	105	ret+=func(sk_value(a,i),NULL);
	106	r=ASN1_object_size(1,ret,ex_tag);
	107	if (pp == NULL) return(r);
	108
	109	p= *pp;
	110	ASN1_put_object(&p,1,ret,ex_tag,ex_class);
d02b48c6	111
4098e89c BL	112	/* Modified by gp@nsj.co.jp */
	113	/* And then again by Ben */
	114	/* And again by Steve */
	115
	116	if(!is_set \|\| (sk_num(a) < 2))
	117	{
	118	for (i=0; i<sk_num(a); i++)
	119	func(sk_value(a,i),&p);
	120
	121	*pp=p;
	122	return(r);
	123	}
	124
	125	pStart = p; /* Catch the beg of Setblobs*/
	126	rgSetBlob = (MYBLOB )Malloc( sk_num(a) sizeof(MYBLOB)); /* In this array
	127	we will store the SET blobs */
	128
	129	for (i=0; i<sk_num(a); i++)
	130	{
	131	rgSetBlob[i].pbData = p; /* catch each set encode blob */
	132	func(sk_value(a,i),&p);
	133	rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; /* Length of this
	134	SetBlob
	135	*/
	136	}
	137	*pp=p;
	138	totSize = p - pStart; /* This is the total size of all set blobs */
	139
	140	/* Now we have to sort the blobs. I am using a simple algo.
	141	Sort ptrs Copy to temp-mem Copy from temp-mem to user-mem/
	142	qsort( rgSetBlob, sk_num(a), sizeof(MYBLOB), SetBlobCmp);
	143	pTempMem = Malloc(totSize);
	144
	145	/* Copy to temp mem */
	146	p = pTempMem;
	147	for(i=0; i<sk_num(a); ++i)
	148	{
	149	memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData);
	150	p += rgSetBlob[i].cbData;
	151	}
	152
	153	/* Copy back to user mem*/
	154	memcpy(pStart, pTempMem, totSize);
	155	Free(pTempMem);
	156	Free(rgSetBlob);
	157
	158	return(r);
	159	}
d02b48c6	160
dfeab068	161	STACK *d2i_ASN1_SET(a,pp,length,func,free_func,ex_tag,ex_class)
d02b48c6 RE	162	STACK **a;
	163	unsigned char **pp;
	164	long length;
	165	char (func)();
dfeab068	166	void (*free_func)();
d02b48c6 RE	167	int ex_tag;
	168	int ex_class;
	169	{
	170	ASN1_CTX c;
	171	STACK *ret=NULL;
	172
	173	if ((a == NULL) \|\| ((*a) == NULL))
	174	{ if ((ret=sk_new(NULL)) == NULL) goto err; }
	175	else
	176	ret=(*a);
	177
	178	c.p= *pp;
	179	c.max=(length == 0)?0:(c.p+length);
	180
	181	c.inf=ASN1_get_object(&c.p,&c.slen,&c.tag,&c.xclass,c.max-c.p);
	182	if (c.inf & 0x80) goto err;
	183	if (ex_class != c.xclass)
	184	{
	185	ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_CLASS);
	186	goto err;
	187	}
	188	if (ex_tag != c.tag)
	189	{
	190	ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_TAG);
	191	goto err;
	192	}
	193	if ((c.slen+c.p) > c.max)
	194	{
	195	ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_LENGTH_ERROR);
	196	goto err;
	197	}
	198	/* check for infinite constructed - it can be as long
	199	* as the amount of data passed to us */
	200	if (c.inf == (V_ASN1_CONSTRUCTED+1))
	201	c.slen=length+ *pp-c.p;
	202	c.max=c.p+c.slen;
	203
	204	while (c.p < c.max)
	205	{
	206	char *s;
	207
	208	if (M_ASN1_D2I_end_sequence()) break;
dfeab068 RE	209	if ((s=func(NULL,&c.p,c.slen,c.max-c.p)) == NULL)
	210	{
	211	ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_ERROR_PARSING_SET_ELEMENT);
	212	asn1_add_error(pp,(int)(c.q- pp));
	213	goto err;
	214	}
d02b48c6 RE	215	if (!sk_push(ret,s)) goto err;
	216	}
	217	if (a != NULL) (*a)=ret;
	218	*pp=c.p;
	219	return(ret);
	220	err:
dfeab068 RE	221	if ((ret != NULL) && ((a == NULL) \|\| (*a != ret)))
	222	{
	223	if (free_func != NULL)
	224	sk_pop_free(ret,free_func);
	225	else
	226	sk_free(ret);
	227	}
d02b48c6 RE	228	return(NULL);
	229	}
	230