ed.h revision 1.6 1 1.1 cgd /* ed.h: type and constant definitions for the ed editor. */
2 1.1 cgd /*
3 1.1 cgd * Copyright (c) 1993 The Regents of the University of California.
4 1.1 cgd * All rights reserved.
5 1.1 cgd *
6 1.1 cgd * This code is derived from software contributed to Berkeley by
7 1.1 cgd * Andrew Moore, Talke Studio.
8 1.1 cgd *
9 1.1 cgd * Redistribution and use in source and binary forms, with or without
10 1.1 cgd * modification, are permitted provided that the following conditions
11 1.1 cgd * are met:
12 1.1 cgd * 1. Redistributions of source code must retain the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer.
14 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 cgd * notice, this list of conditions and the following disclaimer in the
16 1.1 cgd * documentation and/or other materials provided with the distribution.
17 1.1 cgd * 3. All advertising materials mentioning features or use of this software
18 1.1 cgd * must display the following acknowledgement:
19 1.1 cgd * This product includes software developed by the University of
20 1.1 cgd * California, Berkeley and its contributors.
21 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
22 1.1 cgd * may be used to endorse or promote products derived from this software
23 1.1 cgd * without specific prior written permission.
24 1.1 cgd *
25 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 1.1 cgd * SUCH DAMAGE.
36 1.1 cgd *
37 1.1 cgd * @(#)ed.h 5.5 (Berkeley) 3/28/93
38 1.1 cgd */
39 1.1 cgd
40 1.1 cgd #include <unistd.h>
41 1.3 alm #include <errno.h>
42 1.3 alm #include <regex.h>
43 1.1 cgd #if defined(BSD) && BSD >= 199103 || defined(__386BSD__)
44 1.1 cgd # include <sys/param.h> /* for MAXPATHLEN */
45 1.1 cgd #endif
46 1.1 cgd
47 1.1 cgd #define BITSPERBYTE 8
48 1.1 cgd #define BITS(type) (BITSPERBYTE * (int)sizeof(type))
49 1.1 cgd #define CHARBITS BITS(char)
50 1.1 cgd #define INTBITS BITS(int)
51 1.1 cgd
52 1.1 cgd #define ESCHAR '\\'
53 1.1 cgd #define CCL '[' /* Character class: [...] */
54 1.1 cgd #define CCLEND ']'
55 1.1 cgd #define DITTO '&'
56 1.1 cgd
57 1.1 cgd #define TRUE 1
58 1.1 cgd #define FALSE 0
59 1.1 cgd #define ERR (-2)
60 1.1 cgd #define EMOD (ERR - 1)
61 1.1 cgd
62 1.1 cgd #ifndef MAXPATHLEN
63 1.1 cgd # define MAXPATHLEN 255 /* _POSIX_PATH_MAX */
64 1.1 cgd #endif
65 1.1 cgd
66 1.1 cgd #define MAXFNAME MAXPATHLEN /* max file name size */
67 1.1 cgd #define MAXLINE (4 << 10) /* max number of chars per line */
68 1.1 cgd #define SE_MAX 30 /* max subexpressions in a regular expression */
69 1.1 cgd
70 1.1 cgd typedef regex_t pattern_t;
71 1.1 cgd
72 1.1 cgd #ifdef GNU_REGEX
73 1.1 cgd # define FASTMAP_SIZE 256 /* size of fastmap for 8 bit character set */
74 1.1 cgd #endif
75 1.1 cgd
76 1.1 cgd /* Line node */
77 1.1 cgd typedef struct line {
78 1.1 cgd struct line *next;
79 1.1 cgd struct line *prev;
80 1.1 cgd off_t seek; /* address of line in scratch buffer */
81 1.1 cgd
82 1.1 cgd #define ACTV (1 << (INTBITS - 1)) /* active status: high bit of len */
83 1.1 cgd
84 1.1 cgd int len; /* length of line */
85 1.1 cgd } line_t;
86 1.1 cgd
87 1.1 cgd
88 1.1 cgd typedef struct undo {
89 1.1 cgd
90 1.1 cgd /* type of undo nodes */
91 1.1 cgd #define UADD 0
92 1.1 cgd #define UDEL 1
93 1.4 alm #define UMOV 2
94 1.4 alm #define VMOV 3
95 1.1 cgd
96 1.1 cgd int type; /* command type */
97 1.1 cgd line_t *h; /* head of list */
98 1.1 cgd line_t *t; /* tail of list */
99 1.1 cgd } undo_t;
100 1.1 cgd
101 1.1 cgd #ifndef max
102 1.1 cgd # define max(a,b) ((a) > (b) ? (a) : (b))
103 1.1 cgd #endif
104 1.1 cgd
105 1.1 cgd #ifndef min
106 1.1 cgd # define min(a,b) ((a) < (b) ? (a) : (b))
107 1.1 cgd #endif
108 1.1 cgd
109 1.3 alm /* nextln: return line after l mod k */
110 1.1 cgd #define nextln(l,k) ((l)+1 > (k) ? 0 : (l)+1)
111 1.1 cgd
112 1.3 alm /* nextln: return line before l mod k */
113 1.1 cgd #define prevln(l,k) ((l)-1 < 0 ? (k) : (l)-1)
114 1.1 cgd
115 1.1 cgd #define skipblanks() while (isspace(*ibufp) && *ibufp != '\n') ibufp++
116 1.1 cgd
117 1.1 cgd /* spl1: disable some interrupts (requires reliable signals) */
118 1.1 cgd #define spl1() mutex++
119 1.1 cgd
120 1.1 cgd /* spl0: enable all interrupts; check sigflags (requires reliable signals) */
121 1.1 cgd #define spl0() \
122 1.1 cgd if (--mutex == 0) { \
123 1.2 cgd if (sigflags & (1 << SIGHUP)) dohup(SIGHUP); \
124 1.2 cgd if (sigflags & (1 << SIGINT)) dointr(SIGINT); \
125 1.1 cgd }
126 1.1 cgd
127 1.1 cgd /* requeue: link pred before succ */
128 1.1 cgd #define requeue(pred, succ) (pred)->next = (succ), (succ)->prev = (pred)
129 1.1 cgd
130 1.1 cgd /* insqueue: insert elem in circular queue after pred */
131 1.1 cgd #define insqueue(elem, pred) \
132 1.1 cgd { \
133 1.1 cgd requeue((elem), (pred)->next); \
134 1.1 cgd requeue((pred), elem); \
135 1.1 cgd }
136 1.1 cgd
137 1.1 cgd /* remqueue: remove elem from circular queue */
138 1.1 cgd #define remqueue(elem) requeue((elem)->prev, (elem)->next);
139 1.1 cgd
140 1.4 alm #ifndef strerror
141 1.4 alm # define strerror(n) sys_errlist[n]
142 1.4 alm #endif
143 1.4 alm
144 1.1 cgd #ifndef __P
145 1.1 cgd # ifndef __STDC__
146 1.1 cgd # define __P(proto) ()
147 1.1 cgd # else
148 1.1 cgd # define __P(proto) proto
149 1.1 cgd # endif
150 1.1 cgd #endif
151 1.1 cgd
152 1.1 cgd /* local function declarations */
153 1.1 cgd int append __P((long, int));
154 1.1 cgd int cbcdec __P((char *, FILE *));
155 1.1 cgd int cbcenc __P((char *, int, FILE *));
156 1.1 cgd void cbcinit __P((void));
157 1.1 cgd int ckglob __P((void));
158 1.1 cgd int deflt __P((long, long));
159 1.1 cgd int del __P((long, long));
160 1.1 cgd int desgetc __P((FILE *));
161 1.1 cgd FILE *desopen __P((char *, char *));
162 1.1 cgd int desputc __P((int, FILE *));
163 1.1 cgd int docmd __P((int));
164 1.4 alm int err __P((char *));
165 1.1 cgd char *ccl __P((int, char *));
166 1.4 alm int cvtkey __P((char *, char *));
167 1.6 alm long doglob __P((int));
168 1.2 cgd void dohup __P((int));
169 1.2 cgd void dointr __P((int));
170 1.2 cgd void dowinch __P((int));
171 1.1 cgd int doprnt __P((long, long, int));
172 1.1 cgd long doread __P((long, char *));
173 1.1 cgd long dowrite __P((long, long, char *, char *));
174 1.1 cgd char *esctos __P((char *));
175 1.1 cgd long find __P((pattern_t *, int));
176 1.3 alm long getaddr __P((line_t *));
177 1.6 alm char *getcmdv __P((int));
178 1.1 cgd char *getfn __P((void));
179 1.1 cgd int getkey __P((void));
180 1.1 cgd char *getlhs __P((int));
181 1.1 cgd int getline __P((char *, int));
182 1.1 cgd int getlist __P((void));
183 1.1 cgd long getnum __P((int));
184 1.1 cgd long getone __P((void));
185 1.1 cgd line_t *getptr __P((long));
186 1.1 cgd int getrhs __P((char *, int));
187 1.6 alm int getshcmd __P((char **));
188 1.1 cgd char *gettxt __P((line_t *));
189 1.1 cgd int join __P((long, long));
190 1.1 cgd line_t *lpdup __P((line_t *));
191 1.1 cgd void lpqueue __P((line_t *));
192 1.4 alm int makekey __P((char *));
193 1.1 cgd char *makesub __P((char *, int, int));
194 1.4 alm int move __P((long));
195 1.1 cgd int oddesc __P((char *, char *));
196 1.1 cgd void onhup __P((int));
197 1.1 cgd void onintr __P((int));
198 1.1 cgd pattern_t *optpat __P((void));
199 1.1 cgd void prntln __P((char *, long, int));
200 1.1 cgd char *puttxt __P((char *));
201 1.1 cgd void quit __P((int));
202 1.1 cgd char *regsub __P((pattern_t *, char *, char *, int));
203 1.1 cgd int sbclose __P((void));
204 1.1 cgd int sbopen __P((void));
205 1.1 cgd int sgetline __P((char *, int, FILE *));
206 1.1 cgd char *subcat __P((char *, regmatch_t *, char *, char *, char *));
207 1.1 cgd int subst __P((pattern_t *, char *, int));
208 1.4 alm int tobinhex __P((int, int));
209 1.1 cgd int transfer __P((long));
210 1.1 cgd int undo __P((void));
211 1.4 alm undo_t *upush __P((int, long, long));
212 1.1 cgd void ureset __P((void));
213 1.4 alm
214 1.4 alm extern char *sys_errlist[];
215