OpenBSD-4.6/usr.bin/vi/common/mem.h

/*	$OpenBSD: mem.h,v 1.5 2006/01/08 21:05:39 miod Exp $	*/

/*-
 * Copyright (c) 1993, 1994
 *	The Regents of the University of California.  All rights reserved.
 * Copyright (c) 1993, 1994, 1995, 1996
 *	Keith Bostic.  All rights reserved.
 *
 * See the LICENSE file for redistribution information.
 *
 *	@(#)mem.h	10.7 (Berkeley) 3/30/96
 */

/* Increase the size of a malloc'd buffer.  Two versions, one that
 * returns, one that jumps to an error label.
 */
#define	BINC_GOTO(sp, lp, llen, nlen) {					\
	void *L__bincp;							\
	if ((nlen) > (llen)) {						\
		if ((L__bincp = binc((sp), (lp), &(llen), (nlen)))	\
		    == NULL)						\
			goto alloc_err;					\
		/*							\
		 * !!!							\
		 * Possible pointer conversion.				\
		 */							\
		(lp) = L__bincp;					\
	}								\
}
#define	BINC_RET(sp, lp, llen, nlen) {					\
	void *L__bincp;							\
	if ((nlen) > (llen)) {						\
		if ((L__bincp = binc((sp), (lp), &(llen), (nlen)))	\
		    == NULL)						\
			return (1);					\
		/*							\
		 * !!!							\
		 * Possible pointer conversion.				\
		 */							\
		(lp) = L__bincp;					\
	}								\
}

/*
 * Get some temporary space, preferably from the global temporary buffer,
 * from a malloc'd buffer otherwise.  Two versions, one that returns, one
 * that jumps to an error label.
 */
#define	GET_SPACE_GOTO(sp, bp, blen, nlen) {				\
	GS *L__gp = (sp) == NULL ? NULL : (sp)->gp;			\
	if (L__gp == NULL || F_ISSET(L__gp, G_TMP_INUSE)) {		\
		(bp) = NULL;						\
		(blen) = 0;						\
		BINC_GOTO((sp), (bp), (blen), (nlen)); 			\
	} else {							\
		BINC_GOTO((sp), L__gp->tmp_bp, L__gp->tmp_blen, (nlen));\
		(bp) = L__gp->tmp_bp;					\
		(blen) = L__gp->tmp_blen;				\
		F_SET(L__gp, G_TMP_INUSE);				\
	}								\
}
#define	GET_SPACE_RET(sp, bp, blen, nlen) {				\
	GS *L__gp = (sp) == NULL ? NULL : (sp)->gp;			\
	if (L__gp == NULL || F_ISSET(L__gp, G_TMP_INUSE)) {		\
		(bp) = NULL;						\
		(blen) = 0;						\
		BINC_RET((sp), (bp), (blen), (nlen));			\
	} else {							\
		BINC_RET((sp), L__gp->tmp_bp, L__gp->tmp_blen, (nlen));	\
		(bp) = L__gp->tmp_bp;					\
		(blen) = L__gp->tmp_blen;				\
		F_SET(L__gp, G_TMP_INUSE);				\
	}								\
}

/*
 * Add space to a GET_SPACE returned buffer.  Two versions, one that
 * returns, one that jumps to an error label.
 */
#define	ADD_SPACE_GOTO(sp, bp, blen, nlen) {				\
	GS *L__gp = (sp) == NULL ? NULL : (sp)->gp;			\
	if (L__gp == NULL || (bp) == L__gp->tmp_bp) {			\
		F_CLR(L__gp, G_TMP_INUSE);				\
		BINC_GOTO((sp), L__gp->tmp_bp, L__gp->tmp_blen, (nlen));\
		(bp) = L__gp->tmp_bp;					\
		(blen) = L__gp->tmp_blen;				\
		F_SET(L__gp, G_TMP_INUSE);				\
	} else								\
		BINC_GOTO((sp), (bp), (blen), (nlen));			\
}
#define	ADD_SPACE_RET(sp, bp, blen, nlen) {				\
	GS *L__gp = (sp) == NULL ? NULL : (sp)->gp;			\
	if (L__gp == NULL || (bp) == L__gp->tmp_bp) {			\
		F_CLR(L__gp, G_TMP_INUSE);				\
		BINC_RET((sp), L__gp->tmp_bp, L__gp->tmp_blen, (nlen));	\
		(bp) = L__gp->tmp_bp;					\
		(blen) = L__gp->tmp_blen;				\
		F_SET(L__gp, G_TMP_INUSE);				\
	} else								\
		BINC_RET((sp), (bp), (blen), (nlen));			\
}

/* Free a GET_SPACE returned buffer. */
#define	FREE_SPACE(sp, bp, blen) {					\
	GS *L__gp = (sp) == NULL ? NULL : (sp)->gp;			\
	if (L__gp != NULL && (bp) == L__gp->tmp_bp)			\
		F_CLR(L__gp, G_TMP_INUSE);				\
	else								\
		free(bp);						\
}

/*
 * Malloc a buffer, casting the return pointer.  Various versions.
 *
 * !!!
 * The cast should be unnecessary, malloc(3) and friends return void *'s,
 * which is all we need.  However, some systems that nvi needs to run on
 * don't do it right yet, resulting in the compiler printing out roughly
 * a million warnings.  After awhile, it seemed easier to put the casts
 * in instead of explaining it all the time.
 */
#define	CALLOC(sp, p, cast, nmemb, size) {				\
	if (((p) = (cast)calloc((nmemb), (size))) == NULL)		\
		msgq((sp), M_SYSERR, NULL);				\
}
#define	CALLOC_GOTO(sp, p, cast, nmemb, size) {				\
	if (((p) = (cast)calloc((nmemb), (size))) == NULL)		\
		goto alloc_err;						\
}
#define	CALLOC_NOMSG(sp, p, cast, nmemb, size) {			\
	(p) = (cast)calloc((nmemb), (size));				\
}
#define	CALLOC_RET(sp, p, cast, nmemb, size) {				\
	if (((p) = (cast)calloc((nmemb), (size))) == NULL) {		\
		msgq((sp), M_SYSERR, NULL);				\
		return (1);						\
	}								\
}

#define	MALLOC(sp, p, cast, size) {					\
	if (((p) = (cast)malloc(size)) == NULL)				\
		msgq((sp), M_SYSERR, NULL);				\
}
#define	MALLOC_GOTO(sp, p, cast, size) {				\
	if (((p) = (cast)malloc(size)) == NULL)				\
		goto alloc_err;						\
}
#define	MALLOC_NOMSG(sp, p, cast, size) {				\
	(p) = (cast)malloc(size);					\
}
#define	MALLOC_RET(sp, p, cast, size) {					\
	if (((p) = (cast)malloc(size)) == NULL) {			\
		msgq((sp), M_SYSERR, NULL);				\
		return (1);						\
	}								\
}
/*
 * XXX
 * Don't depend on realloc(NULL, size) working.
 */
#define	REALLOC(sp, p, cast, size) {					\
	if (((p) = (cast)((p) == NULL ?					\
	    malloc(size) : realloc((p), (size)))) == NULL)		\
		msgq((sp), M_SYSERR, NULL);				\
}

/*
 * Versions of memmove(3) and memset(3) that use the size of the
 * initial pointer to figure out how much memory to manipulate.
 */
#define	MEMMOVE(p, t, len)	memmove((p), (t), (len) * sizeof(*(p)))
#define	MEMSET(p, value, len)	memset((p), (value), (len) * sizeof(*(p)))