hexdump.h revision 131954 
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 * $FreeBSD: head/usr.bin/hexdump/hexdump.h 131954 2004-07-11 01:11:12Z tjr $
35 */
36
37#include <wchar.h>
38
39typedef struct _pr {
40	struct _pr *nextpr;		/* next print unit */
41#define	F_ADDRESS	0x001		/* print offset */
42#define	F_BPAD		0x002		/* blank pad */
43#define	F_C		0x004		/* %_c */
44#define	F_CHAR		0x008		/* %c */
45#define	F_DBL		0x010		/* %[EefGf] */
46#define	F_INT		0x020		/* %[di] */
47#define	F_P		0x040		/* %_p */
48#define	F_STR		0x080		/* %s */
49#define	F_U		0x100		/* %_u */
50#define	F_UINT		0x200		/* %[ouXx] */
51#define	F_TEXT		0x400		/* no conversions */
52	u_int flags;			/* flag values */
53	int bcnt;			/* byte count */
54	char *cchar;			/* conversion character */
55	char *fmt;			/* printf format */
56	char *nospace;			/* no whitespace version */
57	int mbleft;			/* bytes left of multibyte char. */
58	mbstate_t mbstate;		/* conversion state */
59} PR;
60
61typedef struct _fu {
62	struct _fu *nextfu;		/* next format unit */
63	struct _pr *nextpr;		/* next print unit */
64#define	F_IGNORE	0x01		/* %_A */
65#define	F_SETREP	0x02		/* rep count set, not default */
66	u_int flags;			/* flag values */
67	int reps;			/* repetition count */
68	int bcnt;			/* byte count */
69	char *fmt;			/* format string */
70} FU;
71
72typedef struct _fs {			/* format strings */
73	struct _fs *nextfs;		/* linked list of format strings */
74	struct _fu *nextfu;		/* linked list of format units */
75	int bcnt;
76} FS;
77
78extern FS *fshead;			/* head of format strings list */
79extern FU *endfu;			/* format at end-of-data */
80extern int blocksize;			/* data block size */
81extern int exitval;			/* final exit value */
82extern int odmode;			/* are we acting as od(1)? */
83extern int length;			/* amount of data to read */
84extern off_t skip;			/* amount of data to skip at start */
85enum _vflag { ALL, DUP, FIRST, WAIT };	/* -v values */
86extern enum _vflag vflag;
87
88void	 add(const char *);
89void	 addfile(char *);
90void	 badcnt(char *);
91void	 badconv(char *);
92void	 badfmt(const char *);
93void	 badsfmt(void);
94void	 bpad(PR *);
95void	 conv_c(PR *, u_char *, size_t);
96void	 conv_u(PR *, u_char *);
97void	 display(void);
98void	 doskip(const char *, int);
99void	 escape(char *);
100u_char	*get(void);
101void	 newsyntax(int, char ***);
102int	 next(char **);
103void	 nomem(void);
104void	 oldsyntax(int, char ***);
105size_t	 peek(u_char *, size_t);
106void	 rewrite(FS *);
107int	 size(FS *);
108void	 usage(void);
109