projects / minimal.git / blame
| Commit | Line | Data |
|---|---|---|
| bc3eb2a9 JF |
1 | /* Minimal - the simplest thing that could possibly work |
| 2 | * Copyright (C) 2007 Jay Freeman (saurik) | |
| 3 | */ | |
| 4 | ||
| 5 | /* | |
| 6 | * Redistribution and use in source and binary | |
| 7 | * forms, with or without modification, are permitted | |
| 8 | * provided that the following conditions are met: | |
| 9 | * | |
| 10 | * 1. Redistributions of source code must retain the | |
| 11 | * above copyright notice, this list of conditions | |
| 12 | * and the following disclaimer. | |
| 13 | * 2. Redistributions in binary form must reproduce the | |
| 14 | * above copyright notice, this list of conditions | |
| 15 | * and the following disclaimer in the documentation | |
| 16 | * and/or other materials provided with the | |
| 17 | * distribution. | |
| 18 | * 3. The name of the author may not be used to endorse | |
| 19 | * or promote products derived from this software | |
| 20 | * without specific prior written permission. | |
| 21 | * | |
| 22 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' | |
| 23 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, | |
| 24 | * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF | |
| 25 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| 26 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE | |
| 27 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | |
| 28 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | |
| 29 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR | |
| 30 | * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
| 31 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF | |
| 32 | * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR | |
| 33 | * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN | |
| 34 | * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF | |
| 35 | * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 36 | */ | |
| 37 | ||
| 38 | #ifndef MINIMAL_HEXDUMP_H | |
| 39 | #define MINIMAL_HEXDUMP_H | |
| 40 | ||
| 41 | #include "minimal/stdlib.h" | |
| 42 | ||
| 43 | char hexchar(uint8_t value) { | |
| 44 | return value < 0x20 || value >= 0x80 ? '.' : value; | |
| 45 | } | |
| 46 | ||
| 47 | void hexdump(const char *mark, const uint8_t *data, size_t size) { | |
| 48 | int i = 0, j; | |
| 49 | ||
| 50 | while (i != size) { | |
| 51 | if (i % 16 == 0) | |
| 52 | printf("[%s] 0x%.3x:", mark, i); | |
| 53 | ||
| 54 | printf(" %.2x", data[i]); | |
| 55 | ||
| 56 | if (++i % 16 == 0) { | |
| 57 | printf(" "); | |
| 58 | for (j = i - 16; j != i; ++j) | |
| 59 | printf("%c", hexchar(data[j])); | |
| 60 | printf("\n"); | |
| 61 | } | |
| 62 | } | |
| 63 | ||
| 64 | if (i % 16 != 0) { | |
| 65 | for (j = i % 16; j != 16; ++j) | |
| 66 | printf(" "); | |
| 67 | printf(" "); | |
| 68 | for (j = i / 16 * 16; j != i; ++j) | |
| 69 | printf("%c", hexchar(data[j])); | |
| 70 | printf("\n"); | |
| 71 | } | |
| 72 | } | |
| 73 | ||
| 74 | #endif/*MINIMAL_HEXDUMP_H*/ |