/*- * Copyright (c) 1992, 1993 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley by * Rodney Ruddock of the University of Guelph. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)m.c 8.1 (Berkeley) 5/31/93"; #endif /* not lint */ #include <sys/types.h> #include <regex.h> #include <setjmp.h> #include <stdio.h> #include <string.h> #ifdef DBI #include <db.h> #endif #include "ed.h" #include "extern.h" /* * Move the specified lines to the new location. It's quick 'cause * just a couple of pointers are redirected. */ void m(inputt, errnum) FILE *inputt; int *errnum; { LINE *l_dest=NULL, *l_old_top, *l_old_bottom; /* Set l_dest here. */ if (((ss = getc(inputt)) != '\n') && (ss != EOF)) { for (;;) { if (ss != ' ') { ungetc(ss, inputt); break; } ss = getc(inputt); } l_dest = address_conv(NULL, inputt, errnum); } else (ungetc(ss, inputt), *errnum = -1); if (*errnum < 0) { strcpy(help_msg, "bad destination address"); return; } *errnum = 0; if (rol(inputt, errnum)) return; if (Start_default && End_default) Start = End = current; else if (Start_default) Start = End; if (Start == NULL) { strcpy(help_msg, "buffer empty"); *errnum = -1; return; } Start_default = End_default = 0; /* Do some address checking. */ if ((l_dest) && ((l_dest == Start) || (address_check(l_dest, Start) == -1)) && (address_check(End, l_dest) == -1)) { ungetc(ss, inputt); *errnum = -1; strcpy(help_msg, "destination address in address range"); return; } change_flag = 1; if (g_flag == 0) u_clr_stk(); /* * Some more address checking. These are "legal" command constructions * but are kind-a useless since the buffer doesn't change. */ *errnum = 1; if ((Start == l_dest) || (End == l_dest)) return; if ((Start == top) && (End == bottom)) return; if ((Start == top) && (l_dest == NULL)) return; *errnum = 0; l_old_top = top; l_old_bottom = bottom; sigspecial++; if (Start == top) { top = End->below; u_add_stk(&(End->below->above)); top->above = NULL; } else if (End == bottom) { bottom = Start->above; u_add_stk(&(Start->above->below)); bottom->below = NULL; } else { u_add_stk(&(Start->above->below)); Start->above->below = End->below; u_add_stk(&(End->below->above)); End->below->above = Start->above; } if (l_dest == NULL) { u_add_stk(&(Start->above)); Start->above = NULL; u_add_stk(&(End->below)); End->below = l_old_top; u_add_stk(&(l_old_top->above)); l_old_top->above = End; top = Start; } else if (l_dest == l_old_bottom) { u_add_stk(&(End->below)); End->below = NULL; u_add_stk(&(Start->above)); Start->above = l_dest; u_add_stk(&(l_dest->below)); l_dest->below = Start; bottom = End; } else { u_add_stk(&(Start->above)); Start->above = l_dest; u_add_stk(&(End->below)); End->below = l_dest->below; u_add_stk(&(l_dest->below->above)); l_dest->below->above = End; u_add_stk(&(l_dest->below)); l_dest->below = Start; } if (l_dest) l_dest->below = Start; current = Start; sigspecial--; *errnum = 1; }