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