a_set.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241
  1. /* crypto/asn1/a_set.c */
  2. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  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. #include <stdio.h>
  59. #include "cryptlib.h"
  60. #include <openssl/asn1_mac.h>
  61. #ifndef NO_ASN1_OLD
  62. typedef struct
  63. {
  64. unsigned char *pbData;
  65. int cbData;
  66. } MYBLOB;
  67. /* SetBlobCmp
  68. * This function compares two elements of SET_OF block
  69. */
  70. static int SetBlobCmp(const void *elem1, const void *elem2 )
  71. {
  72. const MYBLOB *b1 = (const MYBLOB *)elem1;
  73. const MYBLOB *b2 = (const MYBLOB *)elem2;
  74. int r;
  75. r = memcmp(b1->pbData, b2->pbData,
  76. b1->cbData < b2->cbData ? b1->cbData : b2->cbData);
  77. if(r != 0)
  78. return r;
  79. return b1->cbData-b2->cbData;
  80. }
  81. /* int is_set: if TRUE, then sort the contents (i.e. it isn't a SEQUENCE) */
  82. int i2d_ASN1_SET(STACK_OF(OPENSSL_BLOCK) *a, unsigned char **pp,
  83. i2d_of_void *i2d, int ex_tag, int ex_class,
  84. int is_set)
  85. {
  86. int ret=0,r;
  87. int i;
  88. unsigned char *p;
  89. unsigned char *pStart, *pTempMem;
  90. MYBLOB *rgSetBlob;
  91. int totSize;
  92. if (a == NULL) return(0);
  93. for (i=sk_OPENSSL_BLOCK_num(a)-1; i>=0; i--)
  94. ret+=i2d(sk_OPENSSL_BLOCK_value(a,i),NULL);
  95. r=ASN1_object_size(1,ret,ex_tag);
  96. if (pp == NULL) return(r);
  97. p= *pp;
  98. ASN1_put_object(&p,1,ret,ex_tag,ex_class);
  99. /* Modified by gp@nsj.co.jp */
  100. /* And then again by Ben */
  101. /* And again by Steve */
  102. if(!is_set || (sk_OPENSSL_BLOCK_num(a) < 2))
  103. {
  104. for (i=0; i<sk_OPENSSL_BLOCK_num(a); i++)
  105. i2d(sk_OPENSSL_BLOCK_value(a,i),&p);
  106. *pp=p;
  107. return(r);
  108. }
  109. pStart = p; /* Catch the beg of Setblobs*/
  110. /* In this array we will store the SET blobs */
  111. rgSetBlob = OPENSSL_malloc(sk_OPENSSL_BLOCK_num(a) * sizeof(MYBLOB));
  112. if (rgSetBlob == NULL)
  113. {
  114. ASN1err(ASN1_F_I2D_ASN1_SET,ERR_R_MALLOC_FAILURE);
  115. return(0);
  116. }
  117. for (i=0; i<sk_OPENSSL_BLOCK_num(a); i++)
  118. {
  119. rgSetBlob[i].pbData = p; /* catch each set encode blob */
  120. i2d(sk_OPENSSL_BLOCK_value(a,i),&p);
  121. rgSetBlob[i].cbData = p - rgSetBlob[i].pbData; /* Length of this
  122. SetBlob
  123. */
  124. }
  125. *pp=p;
  126. totSize = p - pStart; /* This is the total size of all set blobs */
  127. /* Now we have to sort the blobs. I am using a simple algo.
  128. *Sort ptrs *Copy to temp-mem *Copy from temp-mem to user-mem*/
  129. qsort( rgSetBlob, sk_OPENSSL_BLOCK_num(a), sizeof(MYBLOB), SetBlobCmp);
  130. if (!(pTempMem = OPENSSL_malloc(totSize)))
  131. {
  132. ASN1err(ASN1_F_I2D_ASN1_SET,ERR_R_MALLOC_FAILURE);
  133. return(0);
  134. }
  135. /* Copy to temp mem */
  136. p = pTempMem;
  137. for(i=0; i<sk_OPENSSL_BLOCK_num(a); ++i)
  138. {
  139. memcpy(p, rgSetBlob[i].pbData, rgSetBlob[i].cbData);
  140. p += rgSetBlob[i].cbData;
  141. }
  142. /* Copy back to user mem*/
  143. memcpy(pStart, pTempMem, totSize);
  144. OPENSSL_free(pTempMem);
  145. OPENSSL_free(rgSetBlob);
  146. return(r);
  147. }
  148. STACK_OF(OPENSSL_BLOCK) *d2i_ASN1_SET(STACK_OF(OPENSSL_BLOCK) **a,
  149. const unsigned char **pp,
  150. long length, d2i_of_void *d2i,
  151. void (*free_func)(OPENSSL_BLOCK), int ex_tag,
  152. int ex_class)
  153. {
  154. ASN1_const_CTX c;
  155. STACK_OF(OPENSSL_BLOCK) *ret=NULL;
  156. if ((a == NULL) || ((*a) == NULL))
  157. {
  158. if ((ret=sk_OPENSSL_BLOCK_new_null()) == NULL)
  159. {
  160. ASN1err(ASN1_F_D2I_ASN1_SET,ERR_R_MALLOC_FAILURE);
  161. goto err;
  162. }
  163. }
  164. else
  165. ret=(*a);
  166. c.p= *pp;
  167. c.max=(length == 0)?0:(c.p+length);
  168. c.inf=ASN1_get_object(&c.p,&c.slen,&c.tag,&c.xclass,c.max-c.p);
  169. if (c.inf & 0x80) goto err;
  170. if (ex_class != c.xclass)
  171. {
  172. ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_CLASS);
  173. goto err;
  174. }
  175. if (ex_tag != c.tag)
  176. {
  177. ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_BAD_TAG);
  178. goto err;
  179. }
  180. if ((c.slen+c.p) > c.max)
  181. {
  182. ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_LENGTH_ERROR);
  183. goto err;
  184. }
  185. /* check for infinite constructed - it can be as long
  186. * as the amount of data passed to us */
  187. if (c.inf == (V_ASN1_CONSTRUCTED+1))
  188. c.slen=length+ *pp-c.p;
  189. c.max=c.p+c.slen;
  190. while (c.p < c.max)
  191. {
  192. char *s;
  193. if (M_ASN1_D2I_end_sequence()) break;
  194. /* XXX: This was called with 4 arguments, incorrectly, it seems
  195. if ((s=func(NULL,&c.p,c.slen,c.max-c.p)) == NULL) */
  196. if ((s=d2i(NULL,&c.p,c.slen)) == NULL)
  197. {
  198. ASN1err(ASN1_F_D2I_ASN1_SET,ASN1_R_ERROR_PARSING_SET_ELEMENT);
  199. asn1_add_error(*pp,(int)(c.p- *pp));
  200. goto err;
  201. }
  202. if (!sk_OPENSSL_BLOCK_push(ret,s)) goto err;
  203. }
  204. if (a != NULL) (*a)=ret;
  205. *pp=c.p;
  206. return(ret);
  207. err:
  208. if ((ret != NULL) && ((a == NULL) || (*a != ret)))
  209. {
  210. if (free_func != NULL)
  211. sk_OPENSSL_BLOCK_pop_free(ret,free_func);
  212. else
  213. sk_OPENSSL_BLOCK_free(ret);
  214. }
  215. return(NULL);
  216. }
  217. #endif