f_string.c 5.9 KB

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