xref: /freebsd/usr.bin/sed/defs.h (revision d0b2dbfa)
1 /*-
2  * SPDX-License-Identifier: BSD-3-Clause
3  *
4  * Copyright (c) 1992 Diomidis Spinellis.
5  * Copyright (c) 1992, 1993
6  *	The Regents of the University of California.  All rights reserved.
7  *
8  * This code is derived from software contributed to Berkeley by
9  * Diomidis Spinellis of Imperial College, University of London.
10  *
11  * Redistribution and use in source and binary forms, with or without
12  * modification, are permitted provided that the following conditions
13  * are met:
14  * 1. Redistributions of source code must retain the above copyright
15  *    notice, this list of conditions and the following disclaimer.
16  * 2. Redistributions in binary form must reproduce the above copyright
17  *    notice, this list of conditions and the following disclaimer in the
18  *    documentation and/or other materials provided with the distribution.
19  * 3. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  *
35  *	@(#)defs.h	8.1 (Berkeley) 6/6/93
36  */
37 
38 /*
39  * Types of address specifications
40  */
41 enum e_atype {
42 	AT_RE	    = 1,			/* Line that match RE */
43 	AT_LINE,				/* Specific line */
44 	AT_RELLINE,				/* Relative line */
45 	AT_LAST,				/* Last line */
46 };
47 
48 /*
49  * Format of an address
50  */
51 struct s_addr {
52 	enum e_atype type;			/* Address type */
53 	union {
54 		u_long l;			/* Line number */
55 		regex_t *r;			/* Regular expression */
56 	} u;
57 };
58 
59 /*
60  * Substitution command
61  */
62 struct s_subst {
63 	int n;					/* Occurrence to subst. */
64 	int p;					/* True if p flag */
65 	int icase;				/* True if I flag */
66 	char *wfile;				/* NULL if no wfile */
67 	int wfd;				/* Cached file descriptor */
68 	regex_t *re;				/* Regular expression */
69 	unsigned int maxbref;			/* Largest backreference. */
70 	u_long linenum;				/* Line number. */
71 	char *new;				/* Replacement text */
72 };
73 
74 /*
75  * Translate command.
76  */
77 struct s_tr {
78 	unsigned char bytetab[256];
79 	struct trmulti {
80 		size_t fromlen;
81 		char from[MB_LEN_MAX];
82 		size_t tolen;
83 		char to[MB_LEN_MAX];
84 	} *multis;
85 	int nmultis;
86 };
87 
88 /*
89  * An internally compiled command.
90  * Initially, label references are stored in t, on a second pass they
91  * are updated to pointers.
92  */
93 struct s_command {
94 	struct s_command *next;			/* Pointer to next command */
95 	struct s_addr *a1, *a2;			/* Start and end address */
96 	u_long startline;			/* Start line number or zero */
97 	char *t;				/* Text for : a c i r w */
98 	union {
99 		struct s_command *c;		/* Command(s) for b t { */
100 		struct s_subst *s;		/* Substitute command */
101 		struct s_tr *y;			/* Replace command array */
102 		int fd;				/* File descriptor for w */
103 	} u;
104 	char code;				/* Command code */
105 	u_int nonsel:1;				/* True if ! */
106 };
107 
108 /*
109  * Types of command arguments recognised by the parser
110  */
111 enum e_args {
112 	EMPTY,			/* d D g G h H l n N p P q x = \0 */
113 	TEXT,			/* a c i */
114 	NONSEL,			/* ! */
115 	GROUP,			/* { */
116 	ENDGROUP,		/* } */
117 	COMMENT,		/* # */
118 	BRANCH,			/* b t */
119 	LABEL,			/* : */
120 	RFILE,			/* r */
121 	WFILE,			/* w */
122 	SUBST,			/* s */
123 	TR			/* y */
124 };
125 
126 /*
127  * Structure containing things to append before a line is read
128  */
129 struct s_appends {
130 	enum {AP_STRING, AP_FILE} type;
131 	char *s;
132 	size_t len;
133 };
134 
135 enum e_spflag {
136 	APPEND,					/* Append to the contents. */
137 	REPLACE,				/* Replace the contents. */
138 };
139 
140 /*
141  * Structure for a space (process, hold, otherwise).
142  */
143 typedef struct {
144 	char *space;		/* Current space pointer. */
145 	size_t len;		/* Current length. */
146 	int deleted;		/* If deleted. */
147 	int append_newline;	/* If originally terminated by \n. */
148 	char *back;		/* Backing memory. */
149 	size_t blen;		/* Backing memory length. */
150 } SPACE;
151