BSD 4_3_Net_2 release

[unix-history] / usr / src / lib / libcurses / insertln.c

diff --git a/usr/src/lib/libcurses/insertln.c b/usr/src/lib/libcurses/insertln.c
index 612a88c..7c9d528 100644 (file)
--- a/usr/src/lib/libcurses/insertln.c
+++ b/usr/src/lib/libcurses/insertln.c
@@ -1,10 +1,46 @@
+/*
+ * Copyright (c) 1981 Regents of the University of California.
+ * All rights reserved.
+ *
+ * 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[] = "@(#)insertln.c 5.4 (Berkeley) 6/1/90";
+#endif /* not lint */
+

 # include      "curses.ext"
 
 /*
  *     This routine performs an insert-line on the window, leaving
  * (_cury,_curx) unchanged.
  *
 # include      "curses.ext"
 
 /*
  *     This routine performs an insert-line on the window, leaving
  * (_cury,_curx) unchanged.
  *

- * %G% (Berkeley) @(#)insertln.c       1.2

  */
 winsertln(win)
 reg WINDOW     *win; {
  */
 winsertln(win)
 reg WINDOW     *win; {


@@ -12,15 +48,27 @@ reg WINDOW  *win; {
        reg char        *temp;
        reg int         y;
        reg char        *end;
        reg char        *temp;
        reg int         y;
        reg char        *end;

+       reg int         x;

 
 

-       temp = win->_y[win->_cury];
-       win->_firstch[win->_cury] = 0;
-       win->_lastch[win->_cury] = win->_maxx - 1;
+#ifdef DEBUG
+       fprintf(outf, "INSERTLN(%0.2o)\n", win);
+#endif
+       if (win->_orig == NULL)
+               temp = win->_y[win->_maxy - 1];

        for (y = win->_maxy - 1; y > win->_cury; --y) {
        for (y = win->_maxy - 1; y > win->_cury; --y) {

-               win->_y[y] = win->_y[y-1];
-               win->_firstch[y] = 0;
-               win->_lastch[y] = win->_maxx - 1;
+               if (win->_orig == NULL)
+                       win->_y[y] = win->_y[y - 1];
+               else
+                       bcopy(win->_y[y - 1], win->_y[y], win->_maxx);
+               touchline(win, y, 0, win->_maxx - 1);

        }
        }

+       if (win->_orig == NULL)
+               win->_y[y] = temp;
+       else
+               temp = win->_y[y];

        for (end = &temp[win->_maxx]; temp < end; )
                *temp++ = ' ';
        for (end = &temp[win->_maxx]; temp < end; )
                *temp++ = ' ';

+       touchline(win, y, 0, win->_maxx - 1);
+       if (win->_orig == NULL)
+               _id_subwins(win);

 }
 }