[unix-history] / usr / src / old / lib2648 / bit.h

/*
 * Copyright (c) 1980 Regents of the University of California.
 * All rights reserved.  The Berkeley software License Agreement
 * specifies the terms and conditions for redistribution.
 *
 *	@(#)bit.h	5.1 (Berkeley) %G%
 */

/*
 * Bit matrix manipulations for font editor.
 *
 * General structure of a bit matrix: each row is packed into as few
 * bytes as possible, taking the bits from left to right within bytes.
 * The matrix is a sequence of such rows, i.e. up to 7 bits are wasted
 * at the end of each row.
 */

#include <stdio.h>
typedef char *	bitmat;
#ifdef TRACE
	FILE *trace;
#endif

#define max(x,y)	((x) > (y) ?   (x)  : (y))
#define min(x,y)	((x) < (y) ?   (x)  : (y))
Commit	Line	Data
61d96e53 DF	1	/*
	2	* Copyright (c) 1980 Regents of the University of California.
	3	* All rights reserved. The Berkeley software License Agreement
	4	* specifies the terms and conditions for redistribution.
	5	*
	6	* @(#)bit.h 5.1 (Berkeley) %G%
	7	*/
	8
177e2579 RC	9	/*
	10	* Bit matrix manipulations for font editor.
	11	*
	12	* General structure of a bit matrix: each row is packed into as few
	13	* bytes as possible, taking the bits from left to right within bytes.
	14	* The matrix is a sequence of such rows, i.e. up to 7 bits are wasted
	15	* at the end of each row.
	16	*/
	17
	18	#include <stdio.h>
	19	typedef char * bitmat;
	20	#ifdef TRACE
	21	FILE *trace;
	22	#endif
	23
	24	#define max(x,y) ((x) > (y) ? (x) : (y))
	25	#define min(x,y) ((x) < (y) ? (x) : (y))