| 1 | /* |
| 2 | * librd - Rapid Development C library |
| 3 | * |
| 4 | * Copyright (c) 2012-2013, Magnus Edenhill |
| 5 | * All rights reserved. |
| 6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions are met: |
| 9 | * |
| 10 | * 1. Redistributions of source code must retain the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer. |
| 12 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 13 | * this list of conditions and the following disclaimer in the documentation |
| 14 | * and/or other materials provided with the distribution. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 26 | * POSSIBILITY OF SUCH DAMAGE. |
| 27 | */ |
| 28 | |
| 29 | #include "rdkafka_int.h" |
| 30 | #include "rdlog.h" |
| 31 | |
| 32 | #include <stdarg.h> |
| 33 | #include <string.h> |
| 34 | #include <ctype.h> |
| 35 | |
| 36 | |
| 37 | |
| 38 | |
| 39 | void rd_hexdump (FILE *fp, const char *name, const void *ptr, size_t len) { |
| 40 | const char *p = (const char *)ptr; |
| 41 | size_t of = 0; |
| 42 | |
| 43 | |
| 44 | if (name) |
| 45 | fprintf(fp, "%s hexdump (%" PRIusz" bytes):\n" , name, len); |
| 46 | |
| 47 | for (of = 0 ; of < len ; of += 16) { |
| 48 | char hexen[16*3+1]; |
| 49 | char charen[16+1]; |
| 50 | int hof = 0; |
| 51 | |
| 52 | int cof = 0; |
| 53 | unsigned int i; |
| 54 | |
| 55 | for (i = (unsigned int)of ; i < (unsigned int)of + 16 && i < len ; i++) { |
| 56 | hof += rd_snprintf(hexen+hof, sizeof(hexen)-hof, |
| 57 | "%02x " , |
| 58 | p[i] & 0xff); |
| 59 | cof += rd_snprintf(charen+cof, sizeof(charen)-cof, "%c" , |
| 60 | isprint((int)p[i]) ? p[i] : '.'); |
| 61 | } |
| 62 | fprintf(fp, "%08zx: %-48s %-16s\n" , |
| 63 | of, hexen, charen); |
| 64 | } |
| 65 | } |
| 66 | |
| 67 | |
| 68 | void rd_iov_print (const char *what, int iov_idx, const struct iovec *iov, |
| 69 | int hexdump) { |
| 70 | printf("%s: iov #%i: %" PRIusz"\n" , what, iov_idx, |
| 71 | (size_t)iov->iov_len); |
| 72 | if (hexdump) |
| 73 | rd_hexdump(stdout, what, iov->iov_base, iov->iov_len); |
| 74 | } |
| 75 | |
| 76 | |
| 77 | void rd_msghdr_print (const char *what, const struct msghdr *msg, |
| 78 | int hexdump) { |
| 79 | int i; |
| 80 | size_t len = 0; |
| 81 | |
| 82 | printf("%s: iovlen %" PRIusz"\n" , what, (size_t)msg->msg_iovlen); |
| 83 | |
| 84 | for (i = 0 ; i < (int)msg->msg_iovlen ; i++) { |
| 85 | rd_iov_print(what, i, &msg->msg_iov[i], hexdump); |
| 86 | len += msg->msg_iov[i].iov_len; |
| 87 | } |
| 88 | printf("%s: ^ message was %" PRIusz" bytes in total\n" , what, len); |
| 89 | } |
| 90 | |