[people/ms/strongswan.git] / src / libstrongswan / utils.c

/*
 * Copyright (C) 2008-2010 Tobias Brunner
 * Copyright (C) 2005-2008 Martin Willi
 * Hochschule fuer Technik Rapperswil
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the
 * Free Software Foundation; either version 2 of the License, or (at your
 * option) any later version.  See <http://www.fsf.org/copyleft/gpl.txt>.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * for more details.
 */

#include "utils.h"

#include <sys/stat.h>
#include <string.h>
#include <stdio.h>
#include <unistd.h>
#include <inttypes.h>
#include <stdint.h>
#include <limits.h>
#include <dirent.h>
#include <time.h>

#include "enum.h"
#include "debug.h"

ENUM(status_names, SUCCESS, NEED_MORE,
	"SUCCESS",
	"FAILED",
	"OUT_OF_RES",
	"ALREADY_DONE",
	"NOT_SUPPORTED",
	"INVALID_ARG",
	"NOT_FOUND",
	"PARSE_ERROR",
	"VERIFY_ERROR",
	"INVALID_STATE",
	"DESTROY_ME",
	"NEED_MORE",
);

/**
 * Described in header.
 */
void *clalloc(void * pointer, size_t size)
{
	void *data;
	data = malloc(size);

	memcpy(data, pointer, size);

	return (data);
}

/**
 * Described in header.
 */
void memxor(u_int8_t dst[], u_int8_t src[], size_t n)
{
	int m, i;

	/* byte wise XOR until dst aligned */
	for (i = 0; (uintptr_t)&dst[i] % sizeof(long) && i < n; i++)
	{
		dst[i] ^= src[i];
	}
	/* try to use words if src shares an aligment with dst */
	switch (((uintptr_t)&src[i] % sizeof(long)))
	{
		case 0:
			for (m = n - sizeof(long); i <= m; i += sizeof(long))
			{
				*(long*)&dst[i] ^= *(long*)&src[i];
			}
			break;
		case sizeof(int):
			for (m = n - sizeof(int); i <= m; i += sizeof(int))
			{
				*(int*)&dst[i] ^= *(int*)&src[i];
			}
			break;
		case sizeof(short):
			for (m = n - sizeof(short); i <= m; i += sizeof(short))
			{
				*(short*)&dst[i] ^= *(short*)&src[i];
			}
			break;
		default:
			break;
	}
	/* byte wise XOR of the rest */
	for (; i < n; i++)
	{
		dst[i] ^= src[i];
	}
}

/**
 * Described in header.
 */
void memwipe_noinline(void *ptr, size_t n)
{
	memwipe_inline(ptr, n);
}

/**
 * Described in header.
 */
void *memstr(const void *haystack, const char *needle, size_t n)
{
	unsigned const char *pos = haystack;
	size_t l = strlen(needle);
	for (; n >= l; ++pos, --n)
	{
		if (memeq(pos, needle, l))
		{
			return (void*)pos;
		}
	}
	return NULL;
}

/**
 * Described in header.
 */
char* translate(char *str, const char *from, const char *to)
{
	char *pos = str;
	if (strlen(from) != strlen(to))
	{
		return str;
	}
	while (pos && *pos)
	{
		char *match;
		if ((match = strchr(from, *pos)) != NULL)
		{
			*pos = to[match - from];
		}
		pos++;
	}
	return str;
}

/**
 * Described in header.
 */
bool mkdir_p(const char *path, mode_t mode)
{
	int len;
	char *pos, full[PATH_MAX];
	pos = full;
	if (!path || *path == '\0')
	{
		return TRUE;
	}
	len = snprintf(full, sizeof(full)-1, "%s", path);
	if (len < 0 || len >= sizeof(full)-1)
	{
		DBG1(DBG_LIB, "path string %s too long", path);
		return FALSE;
	}
	/* ensure that the path ends with a '/' */
	if (full[len-1] != '/')
	{
		full[len++] = '/';
		full[len] = '\0';
	}
	/* skip '/' at the beginning */
	while (*pos == '/')
	{
		pos++;
	}
	while ((pos = strchr(pos, '/')))
	{
		*pos = '\0';
		if (access(full, F_OK) < 0)
		{
			if (mkdir(full, mode) < 0)
			{
				DBG1(DBG_LIB, "failed to create directory %s", full);
				return FALSE;
			}
		}
		*pos = '/';
		pos++;
	}
	return TRUE;
}

/**
 * Return monotonic time
 */
time_t time_monotonic(timeval_t *tv)
{
#if defined(HAVE_CLOCK_GETTIME) && \
	(defined(HAVE_CONDATTR_CLOCK_MONOTONIC) || \
	 defined(HAVE_PTHREAD_COND_TIMEDWAIT_MONOTONIC))
	/* as we use time_monotonic() for condvar operations, we use the
	 * monotonic time source only if it is also supported by pthread. */
	timespec_t ts;

	if (clock_gettime(CLOCK_MONOTONIC, &ts) == 0)
	{
		if (tv)
		{
			tv->tv_sec = ts.tv_sec;
			tv->tv_usec = ts.tv_nsec / 1000;
		}
		return ts.tv_sec;
	}
#endif /* HAVE_CLOCK_GETTIME && (...) */
	/* Fallback to non-monotonic timestamps:
	 * On MAC OS X, creating monotonic timestamps is rather difficult. We
	 * could use mach_absolute_time() and catch sleep/wakeup notifications.
	 * We stick to the simpler (non-monotonic) gettimeofday() for now.
	 * But keep in mind: we need the same time source here as in condvar! */
	if (!tv)
	{
		return time(NULL);
	}
	if (gettimeofday(tv, NULL) != 0)
	{	/* should actually never fail if passed pointers are valid */
		return -1;
	}
	return tv->tv_sec;
}

/**
 * return null
 */
void *return_null()
{
	return NULL;
}

/**
 * returns TRUE
 */
bool return_true()
{
	return TRUE;
}

/**
 * returns FALSE
 */
bool return_false()
{
	return FALSE;
}

/**
 * returns FAILED
 */
status_t return_failed()
{
	return FAILED;
}

/**
 * nop operation
 */
void nop()
{
}

#ifndef HAVE_GCC_ATOMIC_OPERATIONS
#include <pthread.h>

/**
 * We use a single mutex for all refcount variables.
 */
static pthread_mutex_t ref_mutex = PTHREAD_MUTEX_INITIALIZER;

/**
 * Increase refcount
 */
void ref_get(refcount_t *ref)
{
	pthread_mutex_lock(&ref_mutex);
	(*ref)++;
	pthread_mutex_unlock(&ref_mutex);
}

/**
 * Decrease refcount
 */
bool ref_put(refcount_t *ref)
{
	bool more_refs;

	pthread_mutex_lock(&ref_mutex);
	more_refs = --(*ref) > 0;
	pthread_mutex_unlock(&ref_mutex);
	return !more_refs;
}
#endif /* HAVE_GCC_ATOMIC_OPERATIONS */

/**
 * Described in header.
 */
int time_printf_hook(char *dst, size_t len, printf_hook_spec_t *spec,
					 const void *const *args)
{
	static const char* months[] = {
		"Jan", "Feb", "Mar", "Apr", "May", "Jun",
		"Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
	};
	time_t *time = *((time_t**)(args[0]));
	bool utc = *((bool*)(args[1]));;
	struct tm t;

	if (time == UNDEFINED_TIME)
	{
		return print_in_hook(dst, len, "--- -- --:--:--%s----",
							 utc ? " UTC " : " ");
	}
	if (utc)
	{
		gmtime_r(time, &t);
	}
	else
	{
		localtime_r(time, &t);
	}
	return print_in_hook(dst, len, "%s %02d %02d:%02d:%02d%s%04d",
						 months[t.tm_mon], t.tm_mday, t.tm_hour, t.tm_min,
						 t.tm_sec, utc ? " UTC " : " ", t.tm_year + 1900);
}

/**
 * Described in header.
 */
int time_delta_printf_hook(char *dst, size_t len, printf_hook_spec_t *spec,
						   const void *const *args)
{
	char* unit = "second";
	time_t *arg1 = *((time_t**)(args[0]));
	time_t *arg2 = *((time_t**)(args[1]));
	u_int64_t delta = llabs(*arg1 - *arg2);

	if (delta > 2 * 60 * 60 * 24)
	{
		delta /= 60 * 60 * 24;
		unit = "day";
	}
	else if (delta > 2 * 60 * 60)
	{
		delta /= 60 * 60;
		unit = "hour";
	}
	else if (delta > 2 * 60)
	{
		delta /= 60;
		unit = "minute";
	}
	return print_in_hook(dst, len, "%" PRIu64 " %s%s", delta, unit,
						 (delta == 1) ? "" : "s");
}

/**
 * Number of bytes per line to dump raw data
 */
#define BYTES_PER_LINE 16

static char hexdig_upper[] = "0123456789ABCDEF";

/**
 * Described in header.
 */
int mem_printf_hook(char *dst, size_t dstlen,
					printf_hook_spec_t *spec, const void *const *args)
{
	char *bytes = *((void**)(args[0]));
	int len = *((size_t*)(args[1]));

	char buffer[BYTES_PER_LINE * 3];
	char ascii_buffer[BYTES_PER_LINE + 1];
	char *buffer_pos = buffer;
	char *bytes_pos  = bytes;
	char *bytes_roof = bytes + len;
	int line_start = 0;
	int i = 0;
	int written = 0;

	written += print_in_hook(dst, dstlen, "=> %d bytes @ %p", len, bytes);

	while (bytes_pos < bytes_roof)
	{
		*buffer_pos++ = hexdig_upper[(*bytes_pos >> 4) & 0xF];
		*buffer_pos++ = hexdig_upper[ *bytes_pos       & 0xF];

		ascii_buffer[i++] =
				(*bytes_pos > 31 && *bytes_pos < 127) ? *bytes_pos : '.';

		if (++bytes_pos == bytes_roof || i == BYTES_PER_LINE)
		{
			int padding = 3 * (BYTES_PER_LINE - i);

			while (padding--)
			{
				*buffer_pos++ = ' ';
			}
			*buffer_pos++ = '\0';
			ascii_buffer[i] = '\0';

			written += print_in_hook(dst, dstlen, "\n%4d: %s  %s",
									 line_start, buffer, ascii_buffer);

			buffer_pos = buffer;
			line_start += BYTES_PER_LINE;
			i = 0;
		}
		else
		{
			*buffer_pos++ = ' ';
		}
	}
	return written;
}
Commit	Line	Data
552cc11b	1	/*
38031382	2	* Copyright (C) 2008-2010 Tobias Brunner
552cc11b MW	3	* Copyright (C) 2005-2008 Martin Willi
	4	* Hochschule fuer Technik Rapperswil
	5	*
	6	* This program is free software; you can redistribute it and/or modify it
	7	* under the terms of the GNU General Public License as published by the
	8	* Free Software Foundation; either version 2 of the License, or (at your
	9	* option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
	10	*
	11	* This program is distributed in the hope that it will be useful, but
	12	* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
	13	* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
	14	* for more details.
552cc11b MW	15	*/
	16
	17	#include "utils.h"
	18
6c20579a	19	#include <sys/stat.h>
552cc11b	20	#include <string.h>
552cc11b	21	#include <stdio.h>
6c20579a	22	#include <unistd.h>
876961cf	23	#include <inttypes.h>
74b14b40	24	#include <stdint.h>
d24a74c5	25	#include <limits.h>
6c20579a	26	#include <dirent.h>
f464d750	27	#include <time.h>
552cc11b	28
fac3bfa5 TB	29	#include "enum.h"
fac3bfa5 TB	30	#include "debug.h"
552cc11b	31
a8809bb0	32	ENUM(status_names, SUCCESS, NEED_MORE,
552cc11b MW	33	"SUCCESS",
	34	"FAILED",
	35	"OUT_OF_RES",
	36	"ALREADY_DONE",
	37	"NOT_SUPPORTED",
	38	"INVALID_ARG",
	39	"NOT_FOUND",
	40	"PARSE_ERROR",
	41	"VERIFY_ERROR",
	42	"INVALID_STATE",
	43	"DESTROY_ME",
	44	"NEED_MORE",
	45	);
	46
	47	/**
	48	* Described in header.
	49	*/
	50	void clalloc(void pointer, size_t size)
	51	{
	52	void *data;
	53	data = malloc(size);
7daf5226	54
552cc11b	55	memcpy(data, pointer, size);
7daf5226	56
552cc11b MW	57	return (data);
	58	}
	59
	60	/**
	61	* Described in header.
	62	*/
01e43e31	63	void memxor(u_int8_t dst[], u_int8_t src[], size_t n)
552cc11b	64	{
01e43e31	65	int m, i;
7daf5226	66
01e43e31	67	/* byte wise XOR until dst aligned */
09846603	68	for (i = 0; (uintptr_t)&dst[i] % sizeof(long) && i < n; i++)
4fd233a7	69	{
01e43e31	70	dst[i] ^= src[i];
4fd233a7	71	}
01e43e31	72	/* try to use words if src shares an aligment with dst */
74b14b40	73	switch (((uintptr_t)&src[i] % sizeof(long)))
552cc11b	74	{
01e43e31 MW	75	case 0:
	76	for (m = n - sizeof(long); i <= m; i += sizeof(long))
	77	{
	78	(long)&dst[i] ^= (long)&src[i];
	79	}
	80	break;
	81	case sizeof(int):
	82	for (m = n - sizeof(int); i <= m; i += sizeof(int))
	83	{
	84	(int)&dst[i] ^= (int)&src[i];
	85	}
	86	break;
	87	case sizeof(short):
	88	for (m = n - sizeof(short); i <= m; i += sizeof(short))
	89	{
	90	(short)&dst[i] ^= (short)&src[i];
	91	}
	92	break;
	93	default:
	94	break;
	95	}
	96	/* byte wise XOR of the rest */
	97	for (; i < n; i++)
	98	{
	99	dst[i] ^= src[i];
552cc11b MW	100	}
	101	}
	102
ed678b52 MW	103	/**
	104	* Described in header.
	105	*/
	106	void memwipe_noinline(void *ptr, size_t n)
	107	{
	108	memwipe_inline(ptr, n);
	109	}
	110
81736d7d TB	111	/**
	112	* Described in header.
	113	*/
	114	void memstr(const void haystack, const char *needle, size_t n)
	115	{
	116	unsigned const char *pos = haystack;
	117	size_t l = strlen(needle);
	118	for (; n >= l; ++pos, --n)
	119	{
	120	if (memeq(pos, needle, l))
	121	{
	122	return (void*)pos;
	123	}
	124	}
	125	return NULL;
	126	}
	127
d543d9ca TB	128	/**
	129	* Described in header.
	130	*/
	131	char* translate(char str, const char from, const char *to)
	132	{
	133	char *pos = str;
	134	if (strlen(from) != strlen(to))
	135	{
	136	return str;
	137	}
	138	while (pos && *pos)
	139	{
	140	char *match;
	141	if ((match = strchr(from, *pos)) != NULL)
	142	{
	143	*pos = to[match - from];
	144	}
	145	pos++;
	146	}
	147	return str;
	148	}
	149
6c20579a TB	150	/**
	151	* Described in header.
	152	*/
	153	bool mkdir_p(const char *path, mode_t mode)
	154	{
fc1afcc8	155	int len;
6c20579a TB	156	char *pos, full[PATH_MAX];
	157	pos = full;
	158	if (!path \|\| *path == '\0')
	159	{
	160	return TRUE;
	161	}
	162	len = snprintf(full, sizeof(full)-1, "%s", path);
	163	if (len < 0 \|\| len >= sizeof(full)-1)
	164	{
8b0e0910	165	DBG1(DBG_LIB, "path string %s too long", path);
6c20579a TB	166	return FALSE;
	167	}
	168	/* ensure that the path ends with a '/' */
	169	if (full[len-1] != '/')
	170	{
	171	full[len++] = '/';
	172	full[len] = '\0';
	173	}
	174	/* skip '/' at the beginning */
	175	while (*pos == '/')
	176	{
	177	pos++;
	178	}
	179	while ((pos = strchr(pos, '/')))
	180	{
	181	*pos = '\0';
	182	if (access(full, F_OK) < 0)
	183	{
	184	if (mkdir(full, mode) < 0)
	185	{
8b0e0910	186	DBG1(DBG_LIB, "failed to create directory %s", full);
6c20579a TB	187	return FALSE;
	188	}
	189	}
	190	*pos = '/';
	191	pos++;
	192	}
	193	return TRUE;
	194	}
	195
3f310c0d MW	196	/**
	197	* Return monotonic time
	198	*/
	199	time_t time_monotonic(timeval_t *tv)
	200	{
b2944d71 TB	201	#if defined(HAVE_CLOCK_GETTIME) && \
	202	(defined(HAVE_CONDATTR_CLOCK_MONOTONIC) \|\| \
	203	defined(HAVE_PTHREAD_COND_TIMEDWAIT_MONOTONIC))
3d5818ec MW	204	/* as we use time_monotonic() for condvar operations, we use the
3d5818ec MW	205	* monotonic time source only if it is also supported by pthread. */
3f310c0d	206	timespec_t ts;
7daf5226	207
3f310c0d MW	208	if (clock_gettime(CLOCK_MONOTONIC, &ts) == 0)
	209	{
	210	if (tv)
	211	{
	212	tv->tv_sec = ts.tv_sec;
	213	tv->tv_usec = ts.tv_nsec / 1000;
	214	}
	215	return ts.tv_sec;
	216	}
b2944d71	217	#endif /* HAVE_CLOCK_GETTIME && (...) */
3f310c0d MW	218	/* Fallback to non-monotonic timestamps:
	219	* On MAC OS X, creating monotonic timestamps is rather difficult. We
	220	* could use mach_absolute_time() and catch sleep/wakeup notifications.
3d5818ec MW	221	* We stick to the simpler (non-monotonic) gettimeofday() for now.
3d5818ec MW	222	* But keep in mind: we need the same time source here as in condvar! */
3f310c0d MW	223	if (!tv)
	224	{
	225	return time(NULL);
	226	}
	227	if (gettimeofday(tv, NULL) != 0)
	228	{ /* should actually never fail if passed pointers are valid */
	229	return -1;
	230	}
	231	return tv->tv_sec;
	232	}
	233
081ae2eb MW	234	/**
	235	* return null
	236	*/
	237	void *return_null()
	238	{
	239	return NULL;
	240	}
	241
da17b016 MW	242	/**
	243	* returns TRUE
	244	*/
	245	bool return_true()
	246	{
	247	return TRUE;
	248	}
	249
	250	/**
	251	* returns FALSE
	252	*/
	253	bool return_false()
	254	{
	255	return FALSE;
	256	}
	257
502edf42 MW	258	/**
	259	* returns FAILED
	260	*/
	261	status_t return_failed()
	262	{
	263	return FAILED;
	264	}
	265
233b853d MW	266	/**
	267	* nop operation
	268	*/
	269	void nop()
	270	{
	271	}
	272
efd0fe21 MW	273	#ifndef HAVE_GCC_ATOMIC_OPERATIONS
	274	#include <pthread.h>
	275
552cc11b	276	/**
7daf5226	277	* We use a single mutex for all refcount variables.
552cc11b MW	278	*/
	279	static pthread_mutex_t ref_mutex = PTHREAD_MUTEX_INITIALIZER;
	280
	281	/**
efd0fe21	282	* Increase refcount
552cc11b MW	283	*/
	284	void ref_get(refcount_t *ref)
	285	{
	286	pthread_mutex_lock(&ref_mutex);
	287	(*ref)++;
	288	pthread_mutex_unlock(&ref_mutex);
	289	}
	290
	291	/**
efd0fe21	292	* Decrease refcount
552cc11b MW	293	*/
	294	bool ref_put(refcount_t *ref)
	295	{
	296	bool more_refs;
7daf5226	297
552cc11b	298	pthread_mutex_lock(&ref_mutex);
21f411b8	299	more_refs = --(*ref) > 0;
552cc11b MW	300	pthread_mutex_unlock(&ref_mutex);
	301	return !more_refs;
	302	}
efd0fe21	303	#endif /* HAVE_GCC_ATOMIC_OPERATIONS */
552cc11b MW	304
552cc11b MW	305	/**
d25ce370	306	* Described in header.
552cc11b	307	*/
d25ce370 TB	308	int time_printf_hook(char dst, size_t len, printf_hook_spec_t spec,
d25ce370 TB	309	const void const args)
552cc11b MW	310	{
	311	static const char* months[] = {
	312	"Jan", "Feb", "Mar", "Apr", "May", "Jun",
	313	"Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
	314	};
	315	time_t time = ((time_t**)(args[0]));
d25ce370	316	bool utc = ((bool)(args[1]));;
552cc11b	317	struct tm t;
7daf5226	318
552cc11b MW	319	if (time == UNDEFINED_TIME)
552cc11b MW	320	{
d25ce370 TB	321	return print_in_hook(dst, len, "--- -- --:--:--%s----",
d25ce370 TB	322	utc ? " UTC " : " ");
552cc11b MW	323	}
	324	if (utc)
	325	{
	326	gmtime_r(time, &t);
	327	}
	328	else
	329	{
	330	localtime_r(time, &t);
	331	}
d25ce370 TB	332	return print_in_hook(dst, len, "%s %02d %02d:%02d:%02d%s%04d",
	333	months[t.tm_mon], t.tm_mday, t.tm_hour, t.tm_min,
	334	t.tm_sec, utc ? " UTC " : " ", t.tm_year + 1900);
552cc11b MW	335	}
	336
	337	/**
d25ce370	338	* Described in header.
552cc11b	339	*/
d25ce370 TB	340	int time_delta_printf_hook(char dst, size_t len, printf_hook_spec_t spec,
d25ce370 TB	341	const void const args)
552cc11b MW	342	{
552cc11b MW	343	char* unit = "second";
d25ce370 TB	344	time_t arg1 = ((time_t**)(args[0]));
d25ce370 TB	345	time_t arg2 = ((time_t**)(args[1]));
876961cf	346	u_int64_t delta = llabs(arg1 - arg2);
7daf5226	347
552cc11b MW	348	if (delta > 2 * 60 * 60 * 24)
	349	{
	350	delta /= 60 * 60 * 24;
	351	unit = "day";
	352	}
	353	else if (delta > 2 * 60 * 60)
	354	{
	355	delta /= 60 * 60;
	356	unit = "hour";
	357	}
	358	else if (delta > 2 * 60)
	359	{
	360	delta /= 60;
	361	unit = "minute";
	362	}
876961cf TB	363	return print_in_hook(dst, len, "%" PRIu64 " %s%s", delta, unit,
876961cf TB	364	(delta == 1) ? "" : "s");
552cc11b MW	365	}
	366
	367	/**
	368	* Number of bytes per line to dump raw data
	369	*/
	370	#define BYTES_PER_LINE 16
	371
	372	static char hexdig_upper[] = "0123456789ABCDEF";
	373
	374	/**
d25ce370	375	* Described in header.
552cc11b	376	*/
d25ce370 TB	377	int mem_printf_hook(char *dst, size_t dstlen,
d25ce370 TB	378	printf_hook_spec_t spec, const void const *args)
552cc11b MW	379	{
	380	char bytes = ((void**)(args[0]));
	381	int len = ((size_t)(args[1]));
7daf5226	382
552cc11b MW	383	char buffer[BYTES_PER_LINE * 3];
	384	char ascii_buffer[BYTES_PER_LINE + 1];
	385	char *buffer_pos = buffer;
	386	char *bytes_pos = bytes;
	387	char *bytes_roof = bytes + len;
	388	int line_start = 0;
	389	int i = 0;
	390	int written = 0;
7daf5226	391
d25ce370	392	written += print_in_hook(dst, dstlen, "=> %d bytes @ %p", len, bytes);
7daf5226	393
552cc11b MW	394	while (bytes_pos < bytes_roof)
	395	{
	396	buffer_pos++ = hexdig_upper[(bytes_pos >> 4) & 0xF];
	397	buffer_pos++ = hexdig_upper[ bytes_pos & 0xF];
	398
	399	ascii_buffer[i++] =
	400	(bytes_pos > 31 && bytes_pos < 127) ? *bytes_pos : '.';
	401
7daf5226	402	if (++bytes_pos == bytes_roof \|\| i == BYTES_PER_LINE)
552cc11b MW	403	{
552cc11b MW	404	int padding = 3 * (BYTES_PER_LINE - i);
7daf5226	405
552cc11b MW	406	while (padding--)
	407	{
	408	*buffer_pos++ = ' ';
	409	}
	410	*buffer_pos++ = '\0';
	411	ascii_buffer[i] = '\0';
7daf5226	412
d25ce370	413	written += print_in_hook(dst, dstlen, "\n%4d: %s %s",
323f9f99	414	line_start, buffer, ascii_buffer);
7daf5226	415
552cc11b MW	416	buffer_pos = buffer;
	417	line_start += BYTES_PER_LINE;
	418	i = 0;
	419	}
	420	else
	421	{
	422	*buffer_pos++ = ' ';
	423	}
	424	}
	425	return written;
	426	}