130 lines
3.4 KiB
C
130 lines
3.4 KiB
C
/*
|
|
* Copyright (c) 1983, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Edward Wang at The University of California, Berkeley.
|
|
*
|
|
* 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[] = "@(#)cmd5.c 8.1 (Berkeley) 6/6/93";
|
|
#endif /* not lint */
|
|
|
|
#include "defs.h"
|
|
|
|
/*
|
|
* Window movement.
|
|
*/
|
|
|
|
c_move(w)
|
|
register struct ww *w;
|
|
{
|
|
int col, row;
|
|
int mincol, minrow;
|
|
int maxcol, maxrow;
|
|
int curcol, currow;
|
|
|
|
if (!terse)
|
|
wwputs("New window position: ", cmdwin);
|
|
col = w->ww_w.l;
|
|
row = w->ww_w.t;
|
|
wwadd(boxwin, framewin->ww_back);
|
|
for (;;) {
|
|
wwbox(boxwin, row - 1, col - 1, w->ww_w.nr + 2, w->ww_w.nc + 2);
|
|
getminmax(row, w->ww_w.nr, 1, wwnrow,
|
|
&currow, &minrow, &maxrow);
|
|
getminmax(col, w->ww_w.nc, 0, wwncol,
|
|
&curcol, &mincol, &maxcol);
|
|
wwsetcursor(currow, curcol);
|
|
while (wwpeekc() < 0)
|
|
wwiomux();
|
|
switch (getpos(&row, &col, minrow, mincol, maxrow, maxcol)) {
|
|
case 3:
|
|
wwunbox(boxwin);
|
|
wwdelete(boxwin);
|
|
return;
|
|
case 2:
|
|
wwunbox(boxwin);
|
|
break;
|
|
case 1:
|
|
wwunbox(boxwin);
|
|
case 0:
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
wwdelete(boxwin);
|
|
if (!terse)
|
|
wwputc('\n', cmdwin);
|
|
wwcurtowin(cmdwin);
|
|
movewin(w, row, col);
|
|
}
|
|
|
|
movewin(w, row, col)
|
|
register struct ww *w;
|
|
{
|
|
struct ww *back = w->ww_back;
|
|
|
|
w->ww_alt.t = w->ww_w.t;
|
|
w->ww_alt.l = w->ww_w.l;
|
|
wwdelete(w);
|
|
wwmove(w, row, col);
|
|
wwadd(w, back);
|
|
reframe();
|
|
}
|
|
|
|
/*
|
|
* Weird stufff, don't ask.
|
|
*/
|
|
getminmax(x, n, a, b, curx, minx, maxx)
|
|
register x, n, a, b;
|
|
int *curx, *minx, *maxx;
|
|
{
|
|
if (x < 0)
|
|
*curx = x + n - 1;
|
|
else
|
|
*curx = x;
|
|
|
|
if (x <= a)
|
|
*minx = 1 - n;
|
|
else if (x <= b - n)
|
|
*minx = a;
|
|
else
|
|
*minx = b - n;
|
|
|
|
if (x >= b - n)
|
|
*maxx = b - 1;
|
|
else if (x >= a)
|
|
*maxx = b - n;
|
|
else
|
|
*maxx = a;
|
|
}
|