a_set.c 8.3 KB

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