2
0

f_string.c 6.8 KB

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