[go: up one dir, main page]

File: xxd.c

package info (click to toggle)
criterion 2.4.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, sid, trixie
  • size: 3,864 kB
  • sloc: ansic: 17,945; cpp: 774; python: 74; makefile: 25; sh: 19
file content (76 lines) | stat: -rw-r--r-- 2,936 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/*
 * The MIT License (MIT)
 *
 * Copyright © 2016-2018 Franklin "Snaipe" Mathieu <http://snai.pe/>
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */
#include <stddef.h>
#include <inttypes.h>
#include <ctype.h>
#include "common.h"

#define GROUP_BY          4
#define BYTES_PER_LINE    16

static inline int ulog2(uint64_t n)
{
#define S(k)    if (n >= (UINT64_C(1) << k)) { i += k; n >>= k; }
    int i = -(n == 0); S(32); S(16); S(8); S(4); S(2); S(1); return i;
#undef S
}

CR_API char *cri_string_xxd(const void *data, size_t start, size_t size)
{
    const size_t maxsz = align2_up(size, BYTES_PER_LINE);
    const size_t nb_lines = maxsz / BYTES_PER_LINE;
    const size_t nb_spaces = nb_lines * (BYTES_PER_LINE / GROUP_BY + 2);
    const size_t len_addr = (sizeof (void *) * 2 + 1) * nb_lines;
    const size_t len_hex = maxsz * 2;

    char *out = malloc(maxsz + len_hex + nb_spaces + len_addr + nb_lines + 1);
    const char *c = data;
    size_t written = 0;

    int offwidth = size > 1 ? ulog2(size - 1) / ulog2(16) : 1;
    offwidth = offwidth > 0 ? offwidth : 1;
    offwidth += offwidth % 2;

    for (size_t i = 0; i < size;) {
        written += sprintf(&out[written], "%0*" PRIx64 ":", offwidth, (uint64_t) (i + start));

        size_t j = 0;
        for (; j < BYTES_PER_LINE && i + j < size; ++j) {
            if (j % GROUP_BY == 0)
                out[written++] = ' ';
            written += sprintf(&out[written], "%02hhx", c[i + j]);
        }
        size_t left = BYTES_PER_LINE - j;
        for (size_t k = (left + 1) * 2 + left / GROUP_BY; k > 0; --k)
            out[written++] = ' ';
        for (size_t k = 0; k < j; ++k)
            out[written++] = isprint(c[i + k]) ? c[i + k] : '.';
        for (size_t k = BYTES_PER_LINE - j; k > 0; --k)
            out[written++] = ' ';
        out[written++] = '\n';
        i += j;
    }
    out[written] = '\0';
    return out;
}