f_enum.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207
  1. /* crypto/asn1/f_enum.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/buffer.h>
  61. #include <openssl/asn1.h>
  62. /* Based on a_int.c: equivalent ENUMERATED functions */
  63. int i2a_ASN1_ENUMERATED(BIO *bp, ASN1_ENUMERATED *a)
  64. {
  65. int i,n=0;
  66. static const char *h="0123456789ABCDEF";
  67. char buf[2];
  68. if (a == NULL) return(0);
  69. if (a->length == 0)
  70. {
  71. if (BIO_write(bp,"00",2) != 2) goto err;
  72. n=2;
  73. }
  74. else
  75. {
  76. for (i=0; i<a->length; i++)
  77. {
  78. if ((i != 0) && (i%35 == 0))
  79. {
  80. if (BIO_write(bp,"\\\n",2) != 2) goto err;
  81. n+=2;
  82. }
  83. buf[0]=h[((unsigned char)a->data[i]>>4)&0x0f];
  84. buf[1]=h[((unsigned char)a->data[i] )&0x0f];
  85. if (BIO_write(bp,buf,2) != 2) goto err;
  86. n+=2;
  87. }
  88. }
  89. return(n);
  90. err:
  91. return(-1);
  92. }
  93. int a2i_ASN1_ENUMERATED(BIO *bp, ASN1_ENUMERATED *bs, char *buf, int size)
  94. {
  95. int ret=0;
  96. int i,j,k,m,n,again,bufsize;
  97. unsigned char *s=NULL,*sp;
  98. unsigned char *bufp;
  99. int num=0,slen=0,first=1;
  100. bs->type=V_ASN1_ENUMERATED;
  101. bufsize=BIO_gets(bp,buf,size);
  102. for (;;)
  103. {
  104. if (bufsize < 1) goto err_sl;
  105. i=bufsize;
  106. if (buf[i-1] == '\n') buf[--i]='\0';
  107. if (i == 0) goto err_sl;
  108. if (buf[i-1] == '\r') buf[--i]='\0';
  109. if (i == 0) goto err_sl;
  110. again=(buf[i-1] == '\\');
  111. for (j=0; j<i; j++)
  112. {
  113. if (!( ((buf[j] >= '0') && (buf[j] <= '9')) ||
  114. ((buf[j] >= 'a') && (buf[j] <= 'f')) ||
  115. ((buf[j] >= 'A') && (buf[j] <= 'F'))))
  116. {
  117. i=j;
  118. break;
  119. }
  120. }
  121. buf[i]='\0';
  122. /* We have now cleared all the crap off the end of the
  123. * line */
  124. if (i < 2) goto err_sl;
  125. bufp=(unsigned char *)buf;
  126. if (first)
  127. {
  128. first=0;
  129. if ((bufp[0] == '0') && (buf[1] == '0'))
  130. {
  131. bufp+=2;
  132. i-=2;
  133. }
  134. }
  135. k=0;
  136. i-=again;
  137. if (i%2 != 0)
  138. {
  139. ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ASN1_R_ODD_NUMBER_OF_CHARS);
  140. goto err;
  141. }
  142. i/=2;
  143. if (num+i > slen)
  144. {
  145. if (s == NULL)
  146. sp=(unsigned char *)OPENSSL_malloc(
  147. (unsigned int)num+i*2);
  148. else
  149. sp=(unsigned char *)OPENSSL_realloc(s,
  150. (unsigned int)num+i*2);
  151. if (sp == NULL)
  152. {
  153. ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ERR_R_MALLOC_FAILURE);
  154. if (s != NULL) OPENSSL_free(s);
  155. goto err;
  156. }
  157. s=sp;
  158. slen=num+i*2;
  159. }
  160. for (j=0; j<i; j++,k+=2)
  161. {
  162. for (n=0; n<2; n++)
  163. {
  164. m=bufp[k+n];
  165. if ((m >= '0') && (m <= '9'))
  166. m-='0';
  167. else if ((m >= 'a') && (m <= 'f'))
  168. m=m-'a'+10;
  169. else if ((m >= 'A') && (m <= 'F'))
  170. m=m-'A'+10;
  171. else
  172. {
  173. ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ASN1_R_NON_HEX_CHARACTERS);
  174. goto err;
  175. }
  176. s[num+j]<<=4;
  177. s[num+j]|=m;
  178. }
  179. }
  180. num+=i;
  181. if (again)
  182. bufsize=BIO_gets(bp,buf,size);
  183. else
  184. break;
  185. }
  186. bs->length=num;
  187. bs->data=s;
  188. ret=1;
  189. err:
  190. if (0)
  191. {
  192. err_sl:
  193. ASN1err(ASN1_F_A2I_ASN1_ENUMERATED,ASN1_R_SHORT_LINE);
  194. }
  195. return(ret);
  196. }