1 /* $OpenBSD: glbl.c,v 1.18 2016/03/22 17:58:28 mmcc Exp $ */ 2 /* $NetBSD: glbl.c,v 1.2 1995/03/21 09:04:41 cgd Exp $ */ 3 4 /* glob.c: This file contains the global command routines for the ed line 5 editor */ 6 /*- 7 * Copyright (c) 1993 Andrew Moore, Talke Studio. 8 * All rights reserved. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 #include <sys/ioctl.h> 33 #include <sys/wait.h> 34 35 #include <regex.h> 36 #include <signal.h> 37 #include <stdio.h> 38 #include <stdlib.h> 39 #include <string.h> 40 41 #include "ed.h" 42 43 static int set_active_node(line_t *); 44 static line_t *next_active_node(void); 45 46 /* build_active_list: add line matching a pattern to the global-active list */ 47 int 48 build_active_list(int isgcmd) 49 { 50 regex_t *pat; 51 line_t *lp; 52 int n; 53 char *s; 54 char delimiter; 55 56 if ((delimiter = *ibufp) == ' ' || delimiter == '\n') { 57 seterrmsg("invalid pattern delimiter"); 58 return ERR; 59 } else if ((pat = get_compiled_pattern()) == NULL) 60 return ERR; 61 else if (*ibufp == delimiter) 62 ibufp++; 63 clear_active_list(); 64 lp = get_addressed_line_node(first_addr); 65 for (n = first_addr; n <= second_addr; n++, lp = lp->q_forw) { 66 if ((s = get_sbuf_line(lp)) == NULL) 67 return ERR; 68 if (isbinary) 69 NUL_TO_NEWLINE(s, lp->len); 70 if (!regexec(pat, s, 0, NULL, 0) == isgcmd && 71 set_active_node(lp) < 0) 72 return ERR; 73 } 74 return 0; 75 } 76 77 78 /* exec_global: apply command list in the command buffer to the active 79 lines in a range; return command status */ 80 int 81 exec_global(int interact, int gflag) 82 { 83 static char *ocmd = NULL; 84 static int ocmdsz = 0; 85 86 line_t *lp = NULL; 87 int status; 88 int n; 89 char *cmd = NULL; 90 91 #ifdef BACKWARDS 92 if (!interact) { 93 if (!strcmp(ibufp, "\n")) 94 cmd = "p\n"; /* null cmd-list == `p' */ 95 else if ((cmd = get_extended_line(&n, 0)) == NULL) 96 return ERR; 97 } 98 #else 99 if (!interact && (cmd = get_extended_line(&n, 0)) == NULL) 100 return ERR; 101 #endif 102 clear_undo_stack(); 103 while ((lp = next_active_node()) != NULL) { 104 if ((current_addr = get_line_node_addr(lp)) < 0) 105 return ERR; 106 if (interact) { 107 /* print current_addr; get a command in global syntax */ 108 if (display_lines(current_addr, current_addr, gflag) < 0) 109 return ERR; 110 while ((n = get_tty_line()) > 0 && 111 ibuf[n - 1] != '\n') 112 clearerr(stdin); 113 if (n < 0) 114 return ERR; 115 else if (n == 0) { 116 seterrmsg("unexpected end-of-file"); 117 return ERR; 118 } else if (n == 1 && !strcmp(ibuf, "\n")) 119 continue; 120 else if (n == 2 && !strcmp(ibuf, "&\n")) { 121 if (cmd == NULL) { 122 seterrmsg("no previous command"); 123 return ERR; 124 } else cmd = ocmd; 125 } else if ((cmd = get_extended_line(&n, 0)) == NULL) 126 return ERR; 127 else { 128 REALLOC(ocmd, ocmdsz, n + 1, ERR); 129 memcpy(ocmd, cmd, n + 1); 130 cmd = ocmd; 131 } 132 133 } 134 ibufp = cmd; 135 for (; *ibufp;) 136 if ((status = extract_addr_range()) < 0 || 137 (status = exec_command()) < 0 || 138 (status > 0 && (status = display_lines( 139 current_addr, current_addr, status)) < 0)) 140 return status; 141 } 142 return 0; 143 } 144 145 146 static line_t **active_list; /* list of lines active in a global command */ 147 static int active_last; /* index of last active line in active_list */ 148 static int active_size; /* size of active_list */ 149 static int active_ptr; /* active_list index (non-decreasing) */ 150 static int active_ndx; /* active_list index (modulo active_last) */ 151 152 /* set_active_node: add a line node to the global-active list */ 153 static int 154 set_active_node(line_t *lp) 155 { 156 if (active_last + 1 > active_size) { 157 int ti = active_size; 158 line_t **ts; 159 SPL1(); 160 if ((ts = reallocarray(active_list, 161 (ti += MINBUFSZ), sizeof(line_t **))) == NULL) { 162 perror(NULL); 163 seterrmsg("out of memory"); 164 SPL0(); 165 return ERR; 166 } 167 active_size = ti; 168 active_list = ts; 169 SPL0(); 170 } 171 active_list[active_last++] = lp; 172 return 0; 173 } 174 175 176 /* unset_active_nodes: remove a range of lines from the global-active list */ 177 void 178 unset_active_nodes(line_t *np, line_t *mp) 179 { 180 line_t *lp; 181 int i; 182 183 for (lp = np; lp != mp; lp = lp->q_forw) 184 for (i = 0; i < active_last; i++) 185 if (active_list[active_ndx] == lp) { 186 active_list[active_ndx] = NULL; 187 active_ndx = INC_MOD(active_ndx, active_last - 1); 188 break; 189 } else active_ndx = INC_MOD(active_ndx, active_last - 1); 190 } 191 192 193 /* next_active_node: return the next global-active line node */ 194 static line_t * 195 next_active_node(void) 196 { 197 while (active_ptr < active_last && active_list[active_ptr] == NULL) 198 active_ptr++; 199 return (active_ptr < active_last) ? active_list[active_ptr++] : NULL; 200 } 201 202 203 /* clear_active_list: clear the global-active list */ 204 void 205 clear_active_list(void) 206 { 207 SPL1(); 208 active_size = active_last = active_ptr = active_ndx = 0; 209 free(active_list); 210 active_list = NULL; 211 SPL0(); 212 } 213