You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

207 line
5.7 KiB

  1. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  2. * All rights reserved.
  3. *
  4. * This package is an SSL implementation written
  5. * by Eric Young (eay@cryptsoft.com).
  6. * The implementation was written so as to conform with Netscapes SSL.
  7. *
  8. * This library is free for commercial and non-commercial use as long as
  9. * the following conditions are aheared to. The following conditions
  10. * apply to all code found in this distribution, be it the RC4, RSA,
  11. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  12. * included with this distribution is covered by the same copyright terms
  13. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  14. *
  15. * Copyright remains Eric Young's, and as such any Copyright notices in
  16. * the code are not to be removed.
  17. * If this package is used in a product, Eric Young should be given attribution
  18. * as the author of the parts of the library used.
  19. * This can be in the form of a textual message at program startup or
  20. * in documentation (online or textual) provided with the package.
  21. *
  22. * Redistribution and use in source and binary forms, with or without
  23. * modification, are permitted provided that the following conditions
  24. * are met:
  25. * 1. Redistributions of source code must retain the copyright
  26. * notice, this list of conditions and the following disclaimer.
  27. * 2. Redistributions in binary form must reproduce the above copyright
  28. * notice, this list of conditions and the following disclaimer in the
  29. * documentation and/or other materials provided with the distribution.
  30. * 3. All advertising materials mentioning features or use of this software
  31. * must display the following acknowledgement:
  32. * "This product includes cryptographic software written by
  33. * Eric Young (eay@cryptsoft.com)"
  34. * The word 'cryptographic' can be left out if the rouines from the library
  35. * being used are not cryptographic related :-).
  36. * 4. If you include any Windows specific code (or a derivative thereof) from
  37. * the apps directory (application code) you must include an acknowledgement:
  38. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  39. *
  40. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  41. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  42. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  43. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  44. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  45. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  46. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  47. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  48. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  49. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  50. * SUCH DAMAGE.
  51. *
  52. * The licence and distribution terms for any publically available version or
  53. * derivative of this code cannot be changed. i.e. this code cannot simply be
  54. * copied and put under another distribution licence
  55. * [including the GNU Public Licence.] */
  56. #include <openssl/asn1.h>
  57. #include <openssl/err.h>
  58. #include <openssl/mem.h>
  59. /* Based on a_int.c: equivalent ENUMERATED functions */
  60. int i2a_ASN1_ENUMERATED(BIO *bp, ASN1_ENUMERATED *a)
  61. {
  62. int i,n=0;
  63. static const char *h="0123456789ABCDEF";
  64. char buf[2];
  65. if (a == NULL) return(0);
  66. if (a->length == 0)
  67. {
  68. if (BIO_write(bp,"00",2) != 2) goto err;
  69. n=2;
  70. }
  71. else
  72. {
  73. for (i=0; i<a->length; i++)
  74. {
  75. if ((i != 0) && (i%35 == 0))
  76. {
  77. if (BIO_write(bp,"\\\n",2) != 2) goto err;
  78. n+=2;
  79. }
  80. buf[0]=h[((unsigned char)a->data[i]>>4)&0x0f];
  81. buf[1]=h[((unsigned char)a->data[i] )&0x0f];
  82. if (BIO_write(bp,buf,2) != 2) goto err;
  83. n+=2;
  84. }
  85. }
  86. return(n);
  87. err:
  88. return(-1);
  89. }
  90. int a2i_ASN1_ENUMERATED(BIO *bp, ASN1_ENUMERATED *bs, char *buf, int size)
  91. {
  92. int ret=0;
  93. int i,j,k,m,n,again,bufsize;
  94. unsigned char *s=NULL,*sp;
  95. unsigned char *bufp;
  96. int num=0,slen=0,first=1;
  97. bs->type=V_ASN1_ENUMERATED;
  98. bufsize=BIO_gets(bp,buf,size);
  99. for (;;)
  100. {
  101. if (bufsize < 1) goto err_sl;
  102. i=bufsize;
  103. if (buf[i-1] == '\n') buf[--i]='\0';
  104. if (i == 0) goto err_sl;
  105. if (buf[i-1] == '\r') buf[--i]='\0';
  106. if (i == 0) goto err_sl;
  107. again=(buf[i-1] == '\\');
  108. for (j=0; j<i; j++)
  109. {
  110. if (!( ((buf[j] >= '0') && (buf[j] <= '9')) ||
  111. ((buf[j] >= 'a') && (buf[j] <= 'f')) ||
  112. ((buf[j] >= 'A') && (buf[j] <= 'F'))))
  113. {
  114. i=j;
  115. break;
  116. }
  117. }
  118. buf[i]='\0';
  119. /* We have now cleared all the crap off the end of the
  120. * line */
  121. if (i < 2) goto err_sl;
  122. bufp=(unsigned char *)buf;
  123. if (first)
  124. {
  125. first=0;
  126. if ((bufp[0] == '0') && (buf[1] == '0'))
  127. {
  128. bufp+=2;
  129. i-=2;
  130. }
  131. }
  132. k=0;
  133. i-=again;
  134. if (i%2 != 0)
  135. {
  136. OPENSSL_PUT_ERROR(ASN1, ASN1_R_ODD_NUMBER_OF_CHARS);
  137. goto err;
  138. }
  139. i/=2;
  140. if (num+i > slen)
  141. {
  142. if (s == NULL)
  143. sp=(unsigned char *)OPENSSL_malloc(
  144. (unsigned int)num+i*2);
  145. else
  146. sp=(unsigned char *)OPENSSL_realloc(s,
  147. (unsigned int)num+i*2);
  148. if (sp == NULL)
  149. {
  150. OPENSSL_PUT_ERROR(ASN1, ERR_R_MALLOC_FAILURE);
  151. goto err;
  152. }
  153. s=sp;
  154. slen=num+i*2;
  155. }
  156. for (j=0; j<i; j++,k+=2)
  157. {
  158. for (n=0; n<2; n++)
  159. {
  160. m=bufp[k+n];
  161. if ((m >= '0') && (m <= '9'))
  162. m-='0';
  163. else if ((m >= 'a') && (m <= 'f'))
  164. m=m-'a'+10;
  165. else if ((m >= 'A') && (m <= 'F'))
  166. m=m-'A'+10;
  167. else
  168. {
  169. OPENSSL_PUT_ERROR(ASN1, ASN1_R_NON_HEX_CHARACTERS);
  170. goto err;
  171. }
  172. s[num+j]<<=4;
  173. s[num+j]|=m;
  174. }
  175. }
  176. num+=i;
  177. if (again)
  178. bufsize=BIO_gets(bp,buf,size);
  179. else
  180. break;
  181. }
  182. bs->length=num;
  183. bs->data=s;
  184. ret=1;
  185. err:
  186. if (0)
  187. {
  188. err_sl:
  189. OPENSSL_PUT_ERROR(ASN1, ASN1_R_SHORT_LINE);
  190. }
  191. if (s != NULL)
  192. OPENSSL_free(s);
  193. return(ret);
  194. }