98 lines
2.6 KiB
C
98 lines
2.6 KiB
C
|
/*-
|
||
|
|
* Copyright (c) 2005 Poul-Henning Kamp
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer.
|
||
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
|
* documentation and/or other materials provided with the distribution.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
||
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
||
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
|
* SUCH DAMAGE.
|
||
|
|
*
|
||
|
|
* $FreeBSD$
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <namespace.h>
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <wchar.h>
|
||
|
|
#include <stdint.h>
|
||
|
|
#include <assert.h>
|
||
|
|
#include <sys/time.h>
|
||
|
|
#include "printf.h"
|
||
|
|
|
||
|
|
int
|
||
|
|
__printf_arginfo_hexdump(const struct printf_info *pi, size_t n, int *argt)
|
||
|
|
{
|
||
|
|
|
||
|
|
assert(n >= 2);
|
||
|
|
argt[0] = PA_POINTER;
|
||
|
|
argt[1] = PA_INT;
|
||
|
|
return (2);
|
||
|
|
}
|
||
|
|
|
||
|
|
int
|
||
|
|
__printf_render_hexdump(struct __printf_io *io, const struct printf_info *pi, const void *const *arg)
|
||
|
|
{
|
||
|
|
unsigned char *p;
|
||
|
|
unsigned u, l, j, a;
|
||
|
|
char buf[100], *q;
|
||
|
|
int ret;
|
||
|
|
|
||
|
|
if (pi->width > 0 && pi->width < 16)
|
||
|
|
l = pi->width;
|
||
|
|
else
|
||
|
|
l = 16;
|
||
|
|
p = *((unsigned char **)arg[0]);
|
||
|
|
u = *((unsigned *)arg[1]);
|
||
|
|
|
||
|
|
ret = 0;
|
||
|
|
a = 0;
|
||
|
|
while (u > 0) {
|
||
|
|
q = buf;
|
||
|
|
if (pi->showsign)
|
||
|
|
q += sprintf(q, " %04x", a);
|
||
|
|
for (j = 0; j < l && j < u; j++)
|
||
|
|
q += sprintf(q, " %02x", p[j]);
|
||
|
|
if (pi->alt) {
|
||
|
|
for (; j < l; j++)
|
||
|
|
q += sprintf(q, " ");
|
||
|
|
q += sprintf(q, " |");
|
||
|
|
for (j = 0; j < l && j < u; j++) {
|
||
|
|
if (p[j] < ' ' || p[j] > '~')
|
||
|
|
*q++ = '.';
|
||
|
|
else
|
||
|
|
*q++ = p[j];
|
||
|
|
}
|
||
|
|
for (; j < l; j++)
|
||
|
|
*q++ = ' ';
|
||
|
|
*q++ = '|';
|
||
|
|
}
|
||
|
|
if (l < u)
|
||
|
|
j = l;
|
||
|
|
else
|
||
|
|
j = u;
|
||
|
|
p += j;
|
||
|
|
u -= j;
|
||
|
|
a += j;
|
||
|
|
if (u > 0)
|
||
|
|
*q++ = '\n';
|
||
|
|
ret += __printf_puts(io, buf + 1, q - (buf + 1));
|
||
|
|
__printf_flush(io);
|
||
|
|
}
|
||
|
|
return (ret);
|
||
|
|
}
|