1 /*- 2 * Copyright (c) 1992 Diomidis Spinellis. 3 * Copyright (c) 1992, 1993 4 * The Regents of the University of California. All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * Diomidis Spinellis of Imperial College, University of London. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 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 * @(#)defs.h 8.1 (Berkeley) 6/6/93 34 * $FreeBSD$ 35 */ 36 37 /* 38 * Types of address specifications 39 */ 40 enum e_atype { 41 AT_RE, /* Line that match RE */ 42 AT_LINE, /* Specific line */ 43 AT_LAST, /* Last line */ 44 }; 45 46 /* 47 * Format of an address 48 */ 49 struct s_addr { 50 enum e_atype type; /* Address type */ 51 union { 52 u_long l; /* Line number */ 53 regex_t *r; /* Regular expression */ 54 } u; 55 }; 56 57 /* 58 * Substitution command 59 */ 60 struct s_subst { 61 int n; /* Occurrence to subst. */ 62 int p; /* True if p flag */ 63 char *wfile; /* NULL if no wfile */ 64 int wfd; /* Cached file descriptor */ 65 regex_t *re; /* Regular expression */ 66 int maxbref; /* Largest backreference. */ 67 u_long linenum; /* Line number. */ 68 char *new; /* Replacement text */ 69 }; 70 71 /* 72 * Translate command. 73 */ 74 struct s_tr { 75 unsigned char bytetab[256]; 76 struct trmulti { 77 int fromlen; 78 char from[MB_LEN_MAX]; 79 int tolen; 80 char to[MB_LEN_MAX]; 81 } *multis; 82 int nmultis; 83 }; 84 85 /* 86 * An internally compiled command. 87 * Initialy, label references are stored in t, on a second pass they 88 * are updated to pointers. 89 */ 90 struct s_command { 91 struct s_command *next; /* Pointer to next command */ 92 struct s_addr *a1, *a2; /* Start and end address */ 93 char *t; /* Text for : a c i r w */ 94 union { 95 struct s_command *c; /* Command(s) for b t { */ 96 struct s_subst *s; /* Substitute command */ 97 struct s_tr *y; /* Replace command array */ 98 int fd; /* File descriptor for w */ 99 } u; 100 char code; /* Command code */ 101 u_int nonsel:1; /* True if ! */ 102 u_int inrange:1; /* True if in range */ 103 }; 104 105 /* 106 * Types of command arguments recognised by the parser 107 */ 108 enum e_args { 109 EMPTY, /* d D g G h H l n N p P q x = \0 */ 110 TEXT, /* a c i */ 111 NONSEL, /* ! */ 112 GROUP, /* { */ 113 ENDGROUP, /* } */ 114 COMMENT, /* # */ 115 BRANCH, /* b t */ 116 LABEL, /* : */ 117 RFILE, /* r */ 118 WFILE, /* w */ 119 SUBST, /* s */ 120 TR /* y */ 121 }; 122 123 /* 124 * Structure containing things to append before a line is read 125 */ 126 struct s_appends { 127 enum {AP_STRING, AP_FILE} type; 128 char *s; 129 size_t len; 130 }; 131 132 enum e_spflag { 133 APPEND, /* Append to the contents. */ 134 REPLACE, /* Replace the contents. */ 135 }; 136 137 /* 138 * Structure for a space (process, hold, otherwise). 139 */ 140 typedef struct { 141 char *space; /* Current space pointer. */ 142 size_t len; /* Current length. */ 143 int deleted; /* If deleted. */ 144 char *back; /* Backing memory. */ 145 size_t blen; /* Backing memory length. */ 146 } SPACE; 147