您最多选择25个主题 主题必须以字母或数字开头,可以包含连字符 (-),并且长度不得超过35个字符
 
 
 
 
 
 

191 行
6.2 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/bio.h>
  57. #include <limits.h>
  58. /* hexdump_ctx contains the state of a hexdump. */
  59. struct hexdump_ctx {
  60. BIO *bio;
  61. char right_chars[18]; /* the contents of the right-hand side, ASCII dump. */
  62. unsigned used; /* number of bytes in the current line. */
  63. size_t n; /* number of bytes total. */
  64. unsigned indent;
  65. };
  66. static void hexbyte(char *out, uint8_t b) {
  67. static const char hextable[] = "0123456789abcdef";
  68. out[0] = hextable[b>>4];
  69. out[1] = hextable[b&0x0f];
  70. }
  71. static char to_char(uint8_t b) {
  72. if (b < 32 || b > 126) {
  73. return '.';
  74. }
  75. return b;
  76. }
  77. /* hexdump adds |len| bytes of |data| to the current hex dump described by
  78. * |ctx|. */
  79. static int hexdump(struct hexdump_ctx *ctx, const uint8_t *data, size_t len) {
  80. size_t i;
  81. char buf[10];
  82. unsigned l;
  83. /* Output lines look like:
  84. * 00000010 2e 2f 30 31 32 33 34 35 36 37 38 ... 3c 3d // |./0123456789:;<=|
  85. * ^ offset ^ extra space ^ ASCII of line
  86. */
  87. for (i = 0; i < len; i++) {
  88. if (ctx->used == 0) {
  89. /* The beginning of a line. */
  90. BIO_indent(ctx->bio, ctx->indent, UINT_MAX);
  91. hexbyte(&buf[0], ctx->n >> 24);
  92. hexbyte(&buf[2], ctx->n >> 16);
  93. hexbyte(&buf[4], ctx->n >> 8);
  94. hexbyte(&buf[6], ctx->n);
  95. buf[8] = buf[9] = ' ';
  96. if (BIO_write(ctx->bio, buf, 10) < 0) {
  97. return 0;
  98. }
  99. }
  100. hexbyte(buf, data[i]);
  101. buf[2] = ' ';
  102. l = 3;
  103. if (ctx->used == 7) {
  104. /* There's an additional space after the 8th byte. */
  105. buf[3] = ' ';
  106. l = 4;
  107. } else if (ctx->used == 15) {
  108. /* At the end of the line there's an extra space and the bar for the
  109. * right column. */
  110. buf[3] = ' ';
  111. buf[4] = '|';
  112. l = 5;
  113. }
  114. if (BIO_write(ctx->bio, buf, l) < 0) {
  115. return 0;
  116. }
  117. ctx->right_chars[ctx->used] = to_char(data[i]);
  118. ctx->used++;
  119. ctx->n++;
  120. if (ctx->used == 16) {
  121. ctx->right_chars[16] = '|';
  122. ctx->right_chars[17] = '\n';
  123. if (BIO_write(ctx->bio, ctx->right_chars, sizeof(ctx->right_chars)) < 0) {
  124. return 0;
  125. }
  126. ctx->used = 0;
  127. }
  128. }
  129. return 1;
  130. }
  131. /* finish flushes any buffered data in |ctx|. */
  132. static int finish(struct hexdump_ctx *ctx) {
  133. /* See the comments in |hexdump| for the details of this format. */
  134. const unsigned n_bytes = ctx->used;
  135. unsigned l;
  136. char buf[5];
  137. if (n_bytes == 0) {
  138. return 1;
  139. }
  140. memset(buf, ' ', 4);
  141. buf[4] = '|';
  142. for (; ctx->used < 16; ctx->used++) {
  143. l = 3;
  144. if (ctx->used == 7) {
  145. l = 4;
  146. } else if (ctx->used == 15) {
  147. l = 5;
  148. }
  149. if (BIO_write(ctx->bio, buf, l) < 0) {
  150. return 0;
  151. }
  152. }
  153. ctx->right_chars[n_bytes] = '|';
  154. ctx->right_chars[n_bytes + 1] = '\n';
  155. if (BIO_write(ctx->bio, ctx->right_chars, n_bytes + 2) < 0) {
  156. return 0;
  157. }
  158. return 1;
  159. }
  160. int BIO_hexdump(BIO *bio, const uint8_t *data, size_t len, unsigned indent) {
  161. struct hexdump_ctx ctx;
  162. memset(&ctx, 0, sizeof(ctx));
  163. ctx.bio = bio;
  164. ctx.indent = indent;
  165. if (!hexdump(&ctx, data, len) || !finish(&ctx)) {
  166. return 0;
  167. }
  168. return 1;
  169. }