Nelze vybrat více než 25 témat Téma musí začínat písmenem nebo číslem, může obsahovat pomlčky („-“) a může být dlouhé až 35 znaků.
 
 
 
 
 
 

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