1*56978e91Snia /* $NetBSD: undo.c,v 1.8 2021/11/02 08:04:20 nia Exp $ */
249f0ad86Scgd
31357f155Salm /* undo.c: This file contains the undo routines for the ed line editor */
41357f155Salm /*-
51357f155Salm * Copyright (c) 1993 Andrew Moore, Talke Studio.
61357f155Salm * All rights reserved.
71357f155Salm *
81357f155Salm * Redistribution and use in source and binary forms, with or without
91357f155Salm * modification, are permitted provided that the following conditions
101357f155Salm * are met:
111357f155Salm * 1. Redistributions of source code must retain the above copyright
121357f155Salm * notice, this list of conditions and the following disclaimer.
131357f155Salm * 2. Redistributions in binary form must reproduce the above copyright
141357f155Salm * notice, this list of conditions and the following disclaimer in the
151357f155Salm * documentation and/or other materials provided with the distribution.
161357f155Salm *
171357f155Salm * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
181357f155Salm * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
191357f155Salm * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
201357f155Salm * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
211357f155Salm * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
221357f155Salm * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
231357f155Salm * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
241357f155Salm * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
251357f155Salm * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
261357f155Salm * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
271357f155Salm * SUCH DAMAGE.
281357f155Salm */
291357f155Salm
308b7ade1aSthorpej #include <sys/cdefs.h>
311357f155Salm #ifndef lint
3249f0ad86Scgd #if 0
331357f155Salm static char *rcsid = "@(#)undo.c,v 1.1 1994/02/01 00:34:44 alm Exp";
3449f0ad86Scgd #else
35*56978e91Snia __RCSID("$NetBSD: undo.c,v 1.8 2021/11/02 08:04:20 nia Exp $");
3649f0ad86Scgd #endif
371357f155Salm #endif /* not lint */
381357f155Salm
391357f155Salm #include "ed.h"
401357f155Salm
411357f155Salm
421357f155Salm #define USIZE 100 /* undo stack size */
431357f155Salm undo_t *ustack = NULL; /* undo stack */
441357f155Salm long usize = 0; /* stack size variable */
451357f155Salm long u_p = 0; /* undo stack pointer */
461357f155Salm
47548cdc00Smsaitoh /* push_undo_stack: return pointer to initialized undo node */
481357f155Salm undo_t *
push_undo_stack(int type,long from,long to)49d33a7206Sxtraeme push_undo_stack(int type, long from, long to)
501357f155Salm {
51*56978e91Snia int err;
521357f155Salm
531357f155Salm if (u_p < usize ||
54*56978e91Snia (err = reallocarr(&ustack, usize += USIZE, sizeof(undo_t))) == 0) {
551357f155Salm ustack[u_p].type = type;
561357f155Salm ustack[u_p].t = get_addressed_line_node(to);
571357f155Salm ustack[u_p].h = get_addressed_line_node(from);
581357f155Salm return ustack + u_p++;
591357f155Salm }
601357f155Salm /* out of memory - release undo stack */
61*56978e91Snia fprintf(stderr, "%s\n", strerror(err));
62a3542600Sdholland seterrmsg("out of memory");
631357f155Salm clear_undo_stack();
641357f155Salm free(ustack);
651357f155Salm ustack = NULL;
661357f155Salm usize = 0;
671357f155Salm return NULL;
681357f155Salm }
691357f155Salm
701357f155Salm
711357f155Salm /* USWAP: swap undo nodes */
721357f155Salm #define USWAP(x,y) { \
731357f155Salm undo_t utmp; \
741357f155Salm utmp = x, x = y, y = utmp; \
751357f155Salm }
761357f155Salm
771357f155Salm
781357f155Salm long u_current_addr = -1; /* if >= 0, undo enabled */
791357f155Salm long u_addr_last = -1; /* if >= 0, undo enabled */
801357f155Salm
811357f155Salm /* pop_undo_stack: undo last change to the editor buffer */
821357f155Salm int
pop_undo_stack(void)83d33a7206Sxtraeme pop_undo_stack(void)
841357f155Salm {
851357f155Salm long n;
861357f155Salm long o_current_addr = current_addr;
871357f155Salm long o_addr_last = addr_last;
881357f155Salm
891357f155Salm if (u_current_addr == -1 || u_addr_last == -1) {
90a3542600Sdholland seterrmsg("nothing to undo");
911357f155Salm return ERR;
921357f155Salm } else if (u_p)
931357f155Salm modified = 1;
941357f155Salm get_addressed_line_node(0); /* this get_addressed_line_node last! */
951357f155Salm SPL1();
961357f155Salm for (n = u_p; n-- > 0;) {
971357f155Salm switch(ustack[n].type) {
981357f155Salm case UADD:
991357f155Salm REQUE(ustack[n].h->q_back, ustack[n].t->q_forw);
1001357f155Salm break;
1011357f155Salm case UDEL:
1021357f155Salm REQUE(ustack[n].h->q_back, ustack[n].h);
1031357f155Salm REQUE(ustack[n].t, ustack[n].t->q_forw);
1041357f155Salm break;
1051357f155Salm case UMOV:
1061357f155Salm case VMOV:
1071357f155Salm REQUE(ustack[n - 1].h, ustack[n].h->q_forw);
1081357f155Salm REQUE(ustack[n].t->q_back, ustack[n - 1].t);
1091357f155Salm REQUE(ustack[n].h, ustack[n].t);
1101357f155Salm n--;
1111357f155Salm break;
1121357f155Salm default:
1131357f155Salm /*NOTREACHED*/
1141357f155Salm ;
1151357f155Salm }
1161357f155Salm ustack[n].type ^= 1;
1171357f155Salm }
1181357f155Salm /* reverse undo stack order */
1191357f155Salm for (n = u_p; n-- > (u_p + 1)/ 2;)
1201357f155Salm USWAP(ustack[n], ustack[u_p - 1 - n]);
1211357f155Salm if (isglobal)
1221357f155Salm clear_active_list();
1231357f155Salm current_addr = u_current_addr, u_current_addr = o_current_addr;
1241357f155Salm addr_last = u_addr_last, u_addr_last = o_addr_last;
1251357f155Salm SPL0();
1261357f155Salm return 0;
1271357f155Salm }
1281357f155Salm
1291357f155Salm
1301357f155Salm /* clear_undo_stack: clear the undo stack */
1311357f155Salm void
clear_undo_stack(void)132d33a7206Sxtraeme clear_undo_stack(void)
1331357f155Salm {
1341357f155Salm line_t *lp, *ep, *tl;
1351357f155Salm
1361357f155Salm while (u_p--)
1371357f155Salm if (ustack[u_p].type == UDEL) {
1381357f155Salm ep = ustack[u_p].t->q_forw;
1391357f155Salm for (lp = ustack[u_p].h; lp != ep; lp = tl) {
1401357f155Salm unmark_line_node(lp);
1411357f155Salm tl = lp->q_forw;
1421357f155Salm free(lp);
1431357f155Salm }
1441357f155Salm }
1451357f155Salm u_p = 0;
1461357f155Salm u_current_addr = current_addr;
1471357f155Salm u_addr_last = addr_last;
1481357f155Salm }
149