205 lines
6.1 KiB
C
205 lines
6.1 KiB
C
/* ed.h: type and constant definitions for the ed editor. */
|
|
/*
|
|
* Copyright (c) 1993 The Regents of the University of California.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Andrew Moore, Talke Studio.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)ed.h 5.5 (Berkeley) 3/28/93
|
|
*/
|
|
|
|
#include <unistd.h>
|
|
# include <regex.h>
|
|
#if defined(BSD) && BSD >= 199103 || defined(__386BSD__)
|
|
# include <sys/param.h> /* for MAXPATHLEN */
|
|
#endif
|
|
|
|
#define BITSPERBYTE 8
|
|
#define BITS(type) (BITSPERBYTE * (int)sizeof(type))
|
|
#define CHARBITS BITS(char)
|
|
#define INTBITS BITS(int)
|
|
|
|
#define ESCHAR '\\'
|
|
#define CCL '[' /* Character class: [...] */
|
|
#define CCLEND ']'
|
|
#define DITTO '&'
|
|
|
|
/* sigflags values */
|
|
#define SIG_INT 1
|
|
#define SIG_HUP 2
|
|
|
|
#define TRUE 1
|
|
#define FALSE 0
|
|
#define ERR (-2)
|
|
#define EMOD (ERR - 1)
|
|
|
|
#ifndef MAXPATHLEN
|
|
# define MAXPATHLEN 255 /* _POSIX_PATH_MAX */
|
|
#endif
|
|
|
|
#define MAXFNAME MAXPATHLEN /* max file name size */
|
|
#define MAXLINE (4 << 10) /* max number of chars per line */
|
|
#define SE_MAX 30 /* max subexpressions in a regular expression */
|
|
|
|
typedef regex_t pattern_t;
|
|
|
|
#ifdef GNU_REGEX
|
|
# define FASTMAP_SIZE 256 /* size of fastmap for 8 bit character set */
|
|
#endif
|
|
|
|
/* Line node */
|
|
typedef struct line {
|
|
struct line *next;
|
|
struct line *prev;
|
|
off_t seek; /* address of line in scratch buffer */
|
|
|
|
#define ACTV (1 << (INTBITS - 1)) /* active status: high bit of len */
|
|
|
|
int len; /* length of line */
|
|
} line_t;
|
|
|
|
|
|
typedef struct undo {
|
|
|
|
/* type of undo nodes */
|
|
#define UADD 0
|
|
#define UDEL 1
|
|
|
|
int type; /* command type */
|
|
line_t *h; /* head of list */
|
|
line_t *t; /* tail of list */
|
|
} undo_t;
|
|
|
|
#ifndef max
|
|
# define max(a,b) ((a) > (b) ? (a) : (b))
|
|
#endif
|
|
|
|
#ifndef min
|
|
# define min(a,b) ((a) < (b) ? (a) : (b))
|
|
#endif
|
|
|
|
/* nextln: return line after l wrt k */
|
|
#define nextln(l,k) ((l)+1 > (k) ? 0 : (l)+1)
|
|
|
|
/* nextln: return line before l wrt k */
|
|
#define prevln(l,k) ((l)-1 < 0 ? (k) : (l)-1)
|
|
|
|
#define skipblanks() while (isspace(*ibufp) && *ibufp != '\n') ibufp++
|
|
|
|
/* spl1: disable some interrupts (requires reliable signals) */
|
|
#define spl1() mutex++
|
|
|
|
/* spl0: enable all interrupts; check sigflags (requires reliable signals) */
|
|
#define spl0() \
|
|
if (--mutex == 0) { \
|
|
if (sigflags & SIG_HUP) dohup(); \
|
|
if (sigflags & SIG_INT) dointr(); \
|
|
}
|
|
|
|
/* requeue: link pred before succ */
|
|
#define requeue(pred, succ) (pred)->next = (succ), (succ)->prev = (pred)
|
|
|
|
/* insqueue: insert elem in circular queue after pred */
|
|
#define insqueue(elem, pred) \
|
|
{ \
|
|
requeue((elem), (pred)->next); \
|
|
requeue((pred), elem); \
|
|
}
|
|
|
|
/* remqueue: remove elem from circular queue */
|
|
#define remqueue(elem) requeue((elem)->prev, (elem)->next);
|
|
|
|
#ifndef __P
|
|
# ifndef __STDC__
|
|
# define __P(proto) ()
|
|
# else
|
|
# define __P(proto) proto
|
|
# endif
|
|
#endif
|
|
|
|
/* local function declarations */
|
|
int append __P((long, int));
|
|
int cbcdec __P((char *, FILE *));
|
|
int cbcenc __P((char *, int, FILE *));
|
|
void cbcinit __P((void));
|
|
int ckglob __P((void));
|
|
int deflt __P((long, long));
|
|
int del __P((long, long));
|
|
int desgetc __P((FILE *));
|
|
FILE *desopen __P((char *, char *));
|
|
int desputc __P((int, FILE *));
|
|
int docmd __P((int));
|
|
char *ccl __P((int, char *));
|
|
long doglob __P((void));
|
|
void dohup __P((void));
|
|
void dointr __P((void));
|
|
int doprnt __P((long, long, int));
|
|
long doread __P((long, char *));
|
|
long dowrite __P((long, long, char *, char *));
|
|
char *esctos __P((char *));
|
|
long find __P((pattern_t *, int));
|
|
void freecmdv __P((void));
|
|
char *getcmdv __P((void));
|
|
char *getfn __P((void));
|
|
int getkey __P((void));
|
|
char *getlhs __P((int));
|
|
int getline __P((char *, int));
|
|
int getlist __P((void));
|
|
long getnum __P((int));
|
|
long getone __P((void));
|
|
line_t *getptr __P((long));
|
|
long getrange __P((line_t *, line_t *));
|
|
int getrhs __P((char *, int));
|
|
char *gettxt __P((line_t *));
|
|
undo_t *getuptr __P((int, long, long));
|
|
int join __P((long, long));
|
|
line_t *lpdup __P((line_t *));
|
|
void lpqueue __P((line_t *));
|
|
char *makesub __P((char *, int, int));
|
|
int move __P((long, int));
|
|
int oddesc __P((char *, char *));
|
|
void onhup __P((int));
|
|
void onintr __P((int));
|
|
pattern_t *optpat __P((void));
|
|
void prntln __P((char *, long, int));
|
|
char *puttxt __P((char *));
|
|
void quit __P((int));
|
|
char *regsub __P((pattern_t *, char *, char *, int));
|
|
int sbclose __P((void));
|
|
int sbopen __P((void));
|
|
int sgetline __P((char *, int, FILE *));
|
|
char *subcat __P((char *, regmatch_t *, char *, char *, char *));
|
|
int subst __P((pattern_t *, char *, int));
|
|
int transfer __P((long));
|
|
int undo __P((void));
|
|
void ureset __P((void));
|