f_string.c 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199
  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 "internal/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)
  68. return (0);
  69. if (a->length == 0) {
  70. if (BIO_write(bp, "0", 1) != 1)
  71. goto err;
  72. n = 1;
  73. } else {
  74. for (i = 0; i < a->length; i++) {
  75. if ((i != 0) && (i % 35 == 0)) {
  76. if (BIO_write(bp, "\\\n", 2) != 2)
  77. 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)
  83. goto err;
  84. n += 2;
  85. }
  86. }
  87. return (n);
  88. err:
  89. return (-1);
  90. }
  91. int a2i_ASN1_STRING(BIO *bp, ASN1_STRING *bs, char *buf, int size)
  92. {
  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. bufsize = BIO_gets(bp, buf, size);
  98. for (;;) {
  99. if (bufsize < 1) {
  100. if (first)
  101. break;
  102. else
  103. goto err;
  104. }
  105. first = 0;
  106. i = bufsize;
  107. if (buf[i - 1] == '\n')
  108. buf[--i] = '\0';
  109. if (i == 0)
  110. goto err;
  111. if (buf[i - 1] == '\r')
  112. buf[--i] = '\0';
  113. if (i == 0)
  114. goto err;
  115. again = (buf[i - 1] == '\\');
  116. for (j = i - 1; j > 0; j--) {
  117. #ifndef CHARSET_EBCDIC
  118. if (!(((buf[j] >= '0') && (buf[j] <= '9')) ||
  119. ((buf[j] >= 'a') && (buf[j] <= 'f')) ||
  120. ((buf[j] >= 'A') && (buf[j] <= 'F'))))
  121. #else
  122. /*
  123. * This #ifdef is not strictly necessary, since the characters
  124. * A...F a...f 0...9 are contiguous (yes, even in EBCDIC - but
  125. * not the whole alphabet). Nevertheless, isxdigit() is faster.
  126. */
  127. if (!isxdigit(buf[j]))
  128. #endif
  129. {
  130. i = j;
  131. break;
  132. }
  133. }
  134. buf[i] = '\0';
  135. /*
  136. * We have now cleared all the crap off the end of the line
  137. */
  138. if (i < 2)
  139. goto err;
  140. bufp = (unsigned char *)buf;
  141. k = 0;
  142. i -= again;
  143. if (i % 2 != 0) {
  144. ASN1err(ASN1_F_A2I_ASN1_STRING, ASN1_R_ODD_NUMBER_OF_CHARS);
  145. return 0;
  146. }
  147. i /= 2;
  148. if (num + i > slen) {
  149. sp = OPENSSL_realloc(s, (unsigned int)num + i * 2);
  150. if (sp == NULL) {
  151. ASN1err(ASN1_F_A2I_ASN1_STRING, ERR_R_MALLOC_FAILURE);
  152. OPENSSL_free(s);
  153. return 0;
  154. }
  155. s = sp;
  156. slen = num + i * 2;
  157. }
  158. for (j = 0; j < i; j++, k += 2) {
  159. for (n = 0; n < 2; n++) {
  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. ASN1err(ASN1_F_A2I_ASN1_STRING,
  169. ASN1_R_NON_HEX_CHARACTERS);
  170. return 0;
  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. return 1;
  185. err:
  186. ASN1err(ASN1_F_A2I_ASN1_STRING, ASN1_R_SHORT_LINE);
  187. return 0;
  188. }