hexdump.h revision 1590 
1/*
2 * Copyright (c) 1989, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 *    must display the following acknowledgement:
15 *	This product includes software developed by the University of
16 *	California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 *    may be used to endorse or promote products derived from this software
19 *    without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
33 *	@(#)hexdump.h	8.1 (Berkeley) 6/6/93
34 */
35
36typedef struct _pr {
37	struct _pr *nextpr;		/* next print unit */
38#define	F_ADDRESS	0x001		/* print offset */
39#define	F_BPAD		0x002		/* blank pad */
40#define	F_C		0x004		/* %_c */
41#define	F_CHAR		0x008		/* %c */
42#define	F_DBL		0x010		/* %[EefGf] */
43#define	F_INT		0x020		/* %[di] */
44#define	F_P		0x040		/* %_p */
45#define	F_STR		0x080		/* %s */
46#define	F_U		0x100		/* %_u */
47#define	F_UINT		0x200		/* %[ouXx] */
48#define	F_TEXT		0x400		/* no conversions */
49	u_int flags;			/* flag values */
50	int bcnt;			/* byte count */
51	char *cchar;			/* conversion character */
52	char *fmt;			/* printf format */
53	char *nospace;			/* no whitespace version */
54} PR;
55
56typedef struct _fu {
57	struct _fu *nextfu;		/* next format unit */
58	struct _pr *nextpr;		/* next print unit */
59#define	F_IGNORE	0x01		/* %_A */
60#define	F_SETREP	0x02		/* rep count set, not default */
61	u_int flags;			/* flag values */
62	int reps;			/* repetition count */
63	int bcnt;			/* byte count */
64	char *fmt;			/* format string */
65} FU;
66
67typedef struct _fs {			/* format strings */
68	struct _fs *nextfs;		/* linked list of format strings */
69	struct _fu *nextfu;		/* linked list of format units */
70	int bcnt;
71} FS;
72
73extern FS *fshead;			/* head of format strings list */
74extern int blocksize;			/* data block size */
75enum _vflag { ALL, DUP, FIRST, WAIT };	/* -v values */
76
77void	 add __P((char *));
78void	 addfile __P((char *));
79void	 badcnt __P((char *));
80void	 badconv __P((char *));
81void	 badfmt __P((char *));
82void	 badsfmt __P((void));
83void	 bpad __P((PR *));
84void	 conv_c __P((PR *, u_char *));
85void	 conv_u __P((PR *, u_char *));
86void	 display __P((void));
87void	 doskip __P((char *, int));
88void	 err __P((const char *, ...));
89void	*emalloc __P((int));
90void	 escape __P((char *));
91u_char	*get __P((void));
92void	 newsyntax __P((int, char ***));
93int	 next __P((char **));
94void	 nomem __P((void));
95void	 oldsyntax __P((int, char ***));
96void	 rewrite __P((FS *));
97int	 size __P((FS *));
98void	 usage __P((void));
99