1 /* @(#)wwdelline.c 8.1 (Berkeley) 6/6/93 */ 2 /* $NetBSD: wwdelline.c,v 1.6 2003/08/07 11:17:38 agc Exp $ */ 3 4 /* 5 * Copyright (c) 1983, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * Edward Wang at The University of California, Berkeley. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include "ww.h" 37 38 void 39 wwdelline(struct ww *w, int row) 40 { 41 int i; 42 union ww_char **cpp, **cqq; 43 union ww_char *cp; 44 int row1, row2; 45 char deleted; 46 int visible; 47 48 /* 49 * Scroll first. 50 */ 51 if ((row1 = row) < w->ww_i.t) { 52 row1 = w->ww_i.t; 53 } 54 if ((row2 = w->ww_b.b) > w->ww_i.b) { 55 row2 = w->ww_i.b; 56 visible = 0; 57 } else 58 visible = 1; 59 deleted = wwscroll1(w, row1, row2, 1, visible); 60 61 /* 62 * Fix the buffer. 63 * But leave clearing the last line for wwclreol(). 64 */ 65 cpp = &w->ww_buf[row]; 66 cqq = cpp + 1; 67 cp = *cpp; 68 for (i = w->ww_b.b - row; --i > 0;) 69 *cpp++ = *cqq++; 70 *cpp = cp; 71 72 /* 73 * Now clear the last line. 74 */ 75 if (visible) 76 wwclreol1(w, w->ww_b.b - 1, w->ww_b.l, deleted); 77 else { 78 cp += w->ww_b.l; 79 for (i = w->ww_b.nc; --i >= 0;) 80 cp++->c_w = ' '; 81 } 82 } 83