ed.h revision 1.24 1 1.24 thorpej /* $NetBSD: ed.h,v 1.24 1997/07/20 06:35:37 thorpej Exp $ */
2 1.23 cgd
3 1.1 cgd /* ed.h: type and constant definitions for the ed editor. */
4 1.1 cgd /*
5 1.16 alm * Copyright (c) 1993 Andrew Moore
6 1.1 cgd * All rights reserved.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd *
17 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 1.1 cgd * SUCH DAMAGE.
28 1.1 cgd *
29 1.20 alm * @(#)ed.h,v 1.5 1994/02/01 00:34:39 alm Exp
30 1.1 cgd */
31 1.1 cgd
32 1.20 alm #include <sys/types.h>
33 1.20 alm #if defined(BSD) && BSD >= 199103 || defined(__386BSD__)
34 1.20 alm # include <sys/param.h> /* for MAXPATHLEN */
35 1.20 alm #endif
36 1.3 alm #include <errno.h>
37 1.20 alm #if defined(sun) || defined(__NetBSD__)
38 1.20 alm # include <limits.h>
39 1.1 cgd #endif
40 1.7 alm #include <regex.h>
41 1.9 alm #include <signal.h>
42 1.20 alm #include <stdio.h>
43 1.20 alm #include <stdlib.h>
44 1.20 alm #include <string.h>
45 1.20 alm #include <unistd.h>
46 1.1 cgd
47 1.1 cgd #define ERR (-2)
48 1.9 alm #define EMOD (-3)
49 1.9 alm #define FATAL (-4)
50 1.1 cgd
51 1.1 cgd #ifndef MAXPATHLEN
52 1.1 cgd # define MAXPATHLEN 255 /* _POSIX_PATH_MAX */
53 1.1 cgd #endif
54 1.1 cgd
55 1.9 alm #define MINBUFSZ 512 /* minimum buffer size - must be > 0 */
56 1.1 cgd #define SE_MAX 30 /* max subexpressions in a regular expression */
57 1.16 alm #ifdef INT_MAX
58 1.16 alm # define LINECHARS INT_MAX /* max chars per line */
59 1.16 alm #else
60 1.16 alm # define LINECHARS MAXINT /* max chars per line */
61 1.16 alm #endif
62 1.1 cgd
63 1.20 alm /* gflags */
64 1.20 alm #define GLB 001 /* global command */
65 1.20 alm #define GPR 002 /* print after command */
66 1.20 alm #define GLS 004 /* list after command */
67 1.20 alm #define GNP 010 /* enumerate after command */
68 1.20 alm #define GSG 020 /* global substitute */
69 1.20 alm
70 1.1 cgd typedef regex_t pattern_t;
71 1.1 cgd
72 1.1 cgd /* Line node */
73 1.1 cgd typedef struct line {
74 1.20 alm struct line *q_forw;
75 1.20 alm struct line *q_back;
76 1.1 cgd off_t seek; /* address of line in scratch buffer */
77 1.1 cgd int len; /* length of line */
78 1.1 cgd } line_t;
79 1.1 cgd
80 1.1 cgd
81 1.1 cgd typedef struct undo {
82 1.1 cgd
83 1.1 cgd /* type of undo nodes */
84 1.1 cgd #define UADD 0
85 1.1 cgd #define UDEL 1
86 1.4 alm #define UMOV 2
87 1.4 alm #define VMOV 3
88 1.1 cgd
89 1.1 cgd int type; /* command type */
90 1.1 cgd line_t *h; /* head of list */
91 1.1 cgd line_t *t; /* tail of list */
92 1.1 cgd } undo_t;
93 1.1 cgd
94 1.1 cgd #ifndef max
95 1.9 alm # define max(a,b) ((a) > (b) ? (a) : (b))
96 1.1 cgd #endif
97 1.1 cgd #ifndef min
98 1.9 alm # define min(a,b) ((a) < (b) ? (a) : (b))
99 1.1 cgd #endif
100 1.1 cgd
101 1.20 alm #define INC_MOD(l, k) ((l) + 1 > (k) ? 0 : (l) + 1)
102 1.20 alm #define DEC_MOD(l, k) ((l) - 1 < 0 ? (k) : (l) - 1)
103 1.1 cgd
104 1.17 alm /* SPL1: disable some interrupts (requires reliable signals) */
105 1.17 alm #define SPL1() mutex++
106 1.1 cgd
107 1.17 alm /* SPL0: enable all interrupts; check sigflags (requires reliable signals) */
108 1.17 alm #define SPL0() \
109 1.1 cgd if (--mutex == 0) { \
110 1.20 alm if (sigflags & (1 << (SIGHUP - 1))) handle_hup(SIGHUP); \
111 1.20 alm if (sigflags & (1 << (SIGINT - 1))) handle_int(SIGINT); \
112 1.20 alm }
113 1.20 alm
114 1.20 alm /* STRTOL: convert a string to long */
115 1.20 alm #define STRTOL(i, p) { \
116 1.20 alm if (((i = strtol(p, &p, 10)) == LONG_MIN || i == LONG_MAX) && \
117 1.20 alm errno == ERANGE) { \
118 1.20 alm sprintf(errmsg, "number out of range"); \
119 1.20 alm i = 0; \
120 1.20 alm return ERR; \
121 1.20 alm } \
122 1.1 cgd }
123 1.1 cgd
124 1.9 alm #if defined(sun) || defined(NO_REALLOC_NULL)
125 1.20 alm /* REALLOC: assure at least a minimum size for buffer b */
126 1.20 alm #define REALLOC(b,n,i,err) \
127 1.9 alm if ((i) > (n)) { \
128 1.9 alm int ti = (n); \
129 1.9 alm char *ts; \
130 1.17 alm SPL1(); \
131 1.9 alm if ((b) != NULL) { \
132 1.9 alm if ((ts = (char *) realloc((b), ti += max((i), MINBUFSZ))) == NULL) { \
133 1.9 alm fprintf(stderr, "%s\n", strerror(errno)); \
134 1.9 alm sprintf(errmsg, "out of memory"); \
135 1.17 alm SPL0(); \
136 1.9 alm return err; \
137 1.9 alm } \
138 1.9 alm } else { \
139 1.9 alm if ((ts = (char *) malloc(ti += max((i), MINBUFSZ))) == NULL) { \
140 1.9 alm fprintf(stderr, "%s\n", strerror(errno)); \
141 1.9 alm sprintf(errmsg, "out of memory"); \
142 1.17 alm SPL0(); \
143 1.9 alm return err; \
144 1.9 alm } \
145 1.9 alm } \
146 1.9 alm (n) = ti; \
147 1.9 alm (b) = ts; \
148 1.17 alm SPL0(); \
149 1.9 alm }
150 1.9 alm #else /* NO_REALLOC_NULL */
151 1.20 alm /* REALLOC: assure at least a minimum size for buffer b */
152 1.20 alm #define REALLOC(b,n,i,err) \
153 1.9 alm if ((i) > (n)) { \
154 1.9 alm int ti = (n); \
155 1.9 alm char *ts; \
156 1.17 alm SPL1(); \
157 1.9 alm if ((ts = (char *) realloc((b), ti += max((i), MINBUFSZ))) == NULL) { \
158 1.9 alm fprintf(stderr, "%s\n", strerror(errno)); \
159 1.9 alm sprintf(errmsg, "out of memory"); \
160 1.17 alm SPL0(); \
161 1.9 alm return err; \
162 1.9 alm } \
163 1.9 alm (n) = ti; \
164 1.9 alm (b) = ts; \
165 1.17 alm SPL0(); \
166 1.9 alm }
167 1.9 alm #endif /* NO_REALLOC_NULL */
168 1.9 alm
169 1.20 alm /* REQUE: link pred before succ */
170 1.20 alm #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred)
171 1.1 cgd
172 1.21 alm /* INSQUE: insert elem in circular queue after pred */
173 1.21 alm #define INSQUE(elem, pred) \
174 1.1 cgd { \
175 1.20 alm REQUE((elem), (pred)->q_forw); \
176 1.20 alm REQUE((pred), elem); \
177 1.1 cgd }
178 1.1 cgd
179 1.20 alm /* remque: remove_lines elem from circular queue */
180 1.21 alm #define REMQUE(elem) REQUE((elem)->q_back, (elem)->q_forw);
181 1.1 cgd
182 1.17 alm /* NUL_TO_NEWLINE: overwrite ASCII NULs with newlines */
183 1.17 alm #define NUL_TO_NEWLINE(s, l) translit_text(s, l, '\0', '\n')
184 1.9 alm
185 1.17 alm /* NEWLINE_TO_NUL: overwrite newlines with ASCII NULs */
186 1.17 alm #define NEWLINE_TO_NUL(s, l) translit_text(s, l, '\n', '\0')
187 1.9 alm
188 1.20 alm #ifdef sun
189 1.4 alm # define strerror(n) sys_errlist[n]
190 1.4 alm #endif
191 1.4 alm
192 1.1 cgd #ifndef __P
193 1.1 cgd # ifndef __STDC__
194 1.1 cgd # define __P(proto) ()
195 1.1 cgd # else
196 1.1 cgd # define __P(proto) proto
197 1.1 cgd # endif
198 1.1 cgd #endif
199 1.1 cgd
200 1.16 alm /* Local Function Declarations */
201 1.17 alm void add_line_node __P((line_t *));
202 1.17 alm int append_lines __P((long));
203 1.17 alm int apply_subst_template __P((char *, regmatch_t *, int, int));
204 1.17 alm int build_active_list __P((int));
205 1.17 alm int cbc_decode __P((char *, FILE *));
206 1.17 alm int cbc_encode __P((char *, int, FILE *));
207 1.17 alm int check_addr_range __P((long, long));
208 1.17 alm void clear_active_list __P((void));
209 1.17 alm void clear_undo_stack __P((void));
210 1.17 alm int close_sbuf __P((void));
211 1.17 alm int copy_lines __P((long));
212 1.17 alm int delete_lines __P((long, long));
213 1.17 alm void des_error __P((char *));
214 1.17 alm int display_lines __P((long, long, int));
215 1.17 alm line_t *dup_line_node __P((line_t *));
216 1.17 alm int exec_command __P((void));
217 1.17 alm long exec_global __P((int, int));
218 1.17 alm void expand_des_key __P((char *, char *));
219 1.17 alm int extract_addr_range __P((void));
220 1.17 alm char *extract_pattern __P((int));
221 1.22 cgd int extract_subst_tail __P((int *, long *));
222 1.17 alm char *extract_subst_template __P((void));
223 1.20 alm int filter_lines __P((long, long, char *));
224 1.17 alm int flush_des_file __P((FILE *));
225 1.17 alm line_t *get_addressed_line_node __P((long));
226 1.20 alm pattern_t *get_compiled_pattern __P((void));
227 1.17 alm int get_des_char __P((FILE *));
228 1.17 alm char *get_extended_line __P((int *, int));
229 1.17 alm char *get_filename __P((void));
230 1.17 alm int get_keyword __P((void));
231 1.17 alm long get_line_node_addr __P((line_t *));
232 1.17 alm long get_matching_node_addr __P((pattern_t *, int));
233 1.17 alm long get_marked_node_addr __P((int));
234 1.17 alm char *get_sbuf_line __P((line_t *));
235 1.17 alm int get_shell_command __P((void));
236 1.20 alm int get_stream_line __P((FILE *));
237 1.20 alm int get_tty_line __P((void));
238 1.17 alm void handle_hup __P((int));
239 1.17 alm void handle_int __P((int));
240 1.17 alm void handle_winch __P((int));
241 1.17 alm int has_trailing_escape __P((char *, char *));
242 1.17 alm int hex_to_binary __P((int, int));
243 1.17 alm void init_buffers __P((void));
244 1.17 alm void init_des_cipher __P((void));
245 1.17 alm int is_legal_filename __P((char *));
246 1.17 alm int join_lines __P((long, long));
247 1.17 alm int mark_line_node __P((line_t *, int));
248 1.17 alm int move_lines __P((long));
249 1.24 thorpej line_t *next_active_node __P((void));
250 1.17 alm long next_addr __P((void));
251 1.17 alm int open_sbuf __P((void));
252 1.17 alm char *parse_char_class __P((char *));
253 1.17 alm int pop_undo_stack __P((void));
254 1.17 alm undo_t *push_undo_stack __P((int, long, long));
255 1.17 alm int put_des_char __P((int, FILE *));
256 1.17 alm char *put_sbuf_line __P((char *));
257 1.20 alm int put_stream_line __P((FILE *, char *, int));
258 1.20 alm int put_tty_line __P((char *, int, long, int));
259 1.1 cgd void quit __P((int));
260 1.20 alm long read_file __P((char *, long));
261 1.20 alm long read_stream __P((FILE *, long));
262 1.20 alm int search_and_replace __P((pattern_t *, int, int));
263 1.17 alm int set_active_node __P((line_t *));
264 1.17 alm void set_des_key __P((char *));
265 1.17 alm void signal_hup __P((int));
266 1.17 alm void signal_int __P((int));
267 1.17 alm char *strip_escapes __P((char *));
268 1.20 alm int substitute_matching_text __P((pattern_t *, line_t *, int, int));
269 1.17 alm char *translit_text __P((char *, int, int, int));
270 1.17 alm void unmark_line_node __P((line_t *));
271 1.17 alm void unset_active_nodes __P((line_t *, line_t *));
272 1.20 alm long write_file __P((char *, char *, long, long));
273 1.20 alm long write_stream __P((FILE *, long, long));
274 1.9 alm
275 1.20 alm /* global buffers */
276 1.20 alm extern char stdinbuf[];
277 1.20 alm extern char *ibuf;
278 1.20 alm extern char *ibufp;
279 1.20 alm extern int ibufsz;
280 1.20 alm
281 1.20 alm /* global flags */
282 1.20 alm extern int isbinary;
283 1.20 alm extern int isglobal;
284 1.20 alm extern int modified;
285 1.9 alm extern int mutex;
286 1.9 alm extern int sigflags;
287 1.20 alm
288 1.20 alm /* global vars */
289 1.20 alm extern long addr_last;
290 1.20 alm extern long current_addr;
291 1.20 alm extern char errmsg[];
292 1.20 alm extern long first_addr;
293 1.20 alm extern int lineno;
294 1.20 alm extern long second_addr;
295 1.20 alm #ifdef sun
296 1.20 alm extern char *sys_errlist[];
297 1.20 alm #endif
298