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