/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2004 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1988 AT&T */
/* All Rights Reserved */
/*
* University Copyright- Copyright (c) 1982, 1986, 1988
* The Regents of the University of California
* All Rights Reserved
*
* University Acknowledgment- Portions of this document are derived from
* software developed by the University of California, Berkeley, and its
* contributors.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*LINTLIBRARY*/
#include <stdlib.h>
#include "curses_inc.h"
typedef struct
{
_sy;
} IDST;
static void _do_idln(int, int, int, int);
int
{
(insert_line || parm_insert_line ||
return (OK);
}
/*
* Return the start line for such action.
*/
static int
_set_idln(void)
{
/*
* The value we want to return is the lower line
* number of the top-most range.
*
* If there is more than one range of lines on which
* we're operating, _find_idln will get called more
* then once; we need to search all the IDST for the
* desired return value.
*/
{
int tmp;
}
return (rval);
}
}
static int
_use_idln(void)
{
/* first cycle do deletions, second cycle do insertions */
if (dir > 0) {
} else {
}
/* skip deletions or insertions */
continue;
}
/* find a contiguous block */
break;
}
/* top and bottom lines of the affected region */
if (dir > 0) {
} else {
}
/* do the actual output */
/* update change structure */
/* update screen image */
/*LINTED*/
/*LINTED*/
/* for next while cycle */
}
if (nomore)
break;
}
/* reset scrolling region */
if (didcsr) {
}
/*LINTED*/
/*LINTED*/
return (OK);
}
static void
{
short *begns;
/* change scrolling region */
if (change_scroll_region) {
}
} else {
if (didcsr) {
}
}
if (doinsert) {
/* memory below, clobber it now */
if (memory_below && clr_eol &&
cy = y;
cx = 0;
}
}
/* if not change_scroll_region, delete, then insert */
/* delete appropriate number of lines */
cx = 0;
else
for (y = 0; y < idn; ++y)
}
/* now do insert */
cx = 0;
if (yesscrl) {
if (!parm_rindex && (!scroll_reverse ||
goto hardinsert;
}
else
for (y = 0; y < idn; ++y)
} else {
else
for (y = 0; y < idn; ++y)
}
} else {
/* doing deletion */
/* memory above, clobber it now */
if (memory_above && clr_eol &&
cx = 0;
}
}
if (yesscrl) {
if (!parm_index && (!scroll_forward ||
goto harddelete;
}
cx = 0;
else
for (y = 0; y < idn; ++y)
} else {
/* do deletion */
cx = 0;
else
for (y = 0; y < idn; ++y)
}
/* if not change_scroll_region, do insert to restore bottom */
y = scrli - 1;
break;
if (y >= bsy) {
cx = 0;
if (parm_insert_line &&
else
for (y = 0; y < idn; ++y)
}
}
}
}