Annotation of src/usr.bin/window/cmd5.c, Revision 1.4
1.4 ! mpech 1: /* $OpenBSD: cmd5.c,v 1.3 1997/02/25 00:03:59 downsj Exp $ */
1.1 deraadt 2: /* $NetBSD: cmd5.c,v 1.3 1995/09/28 10:34:09 tls 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. All advertising materials mentioning features or use of this software
20: * must display the following acknowledgement:
21: * This product includes software developed by the University of
22: * California, Berkeley and its contributors.
23: * 4. Neither the name of the University nor the names of its contributors
24: * may be used to endorse or promote products derived from this software
25: * without specific prior written permission.
26: *
27: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37: * SUCH DAMAGE.
38: */
39:
40: #ifndef lint
41: #if 0
42: static char sccsid[] = "@(#)cmd5.c 8.1 (Berkeley) 6/6/93";
43: #else
1.4 ! mpech 44: static char rcsid[] = "$OpenBSD: cmd5.c,v 1.3 1997/02/25 00:03:59 downsj Exp $";
1.1 deraadt 45: #endif
46: #endif /* not lint */
47:
48: #include "defs.h"
49:
50: /*
51: * Window movement.
52: */
53:
54: c_move(w)
1.4 ! mpech 55: struct ww *w;
1.1 deraadt 56: {
57: int col, row;
58: int mincol, minrow;
59: int maxcol, maxrow;
60: int curcol, currow;
61:
62: if (!terse)
63: wwputs("New window position: ", cmdwin);
64: col = w->ww_w.l;
65: row = w->ww_w.t;
66: wwadd(boxwin, framewin->ww_back);
67: for (;;) {
68: wwbox(boxwin, row - 1, col - 1, w->ww_w.nr + 2, w->ww_w.nc + 2);
69: getminmax(row, w->ww_w.nr, 1, wwnrow,
70: &currow, &minrow, &maxrow);
71: getminmax(col, w->ww_w.nc, 0, wwncol,
72: &curcol, &mincol, &maxcol);
73: wwsetcursor(currow, curcol);
74: while (wwpeekc() < 0)
75: wwiomux();
76: switch (getpos(&row, &col, minrow, mincol, maxrow, maxcol)) {
77: case 3:
78: wwunbox(boxwin);
79: wwdelete(boxwin);
80: return;
81: case 2:
82: wwunbox(boxwin);
83: break;
84: case 1:
85: wwunbox(boxwin);
86: case 0:
87: continue;
88: }
89: break;
90: }
91: wwdelete(boxwin);
92: if (!terse)
93: wwputc('\n', cmdwin);
94: wwcurtowin(cmdwin);
95: movewin(w, row, col);
96: }
97:
98: movewin(w, row, col)
1.4 ! mpech 99: struct ww *w;
1.1 deraadt 100: {
101: struct ww *back = w->ww_back;
102:
103: w->ww_alt.t = w->ww_w.t;
104: w->ww_alt.l = w->ww_w.l;
105: wwdelete(w);
106: wwmove(w, row, col);
107: wwadd(w, back);
108: reframe();
109: }
110:
111: /*
112: * Weird stufff, don't ask.
113: */
114: getminmax(x, n, a, b, curx, minx, maxx)
1.4 ! mpech 115: int x, n, a, b;
1.1 deraadt 116: int *curx, *minx, *maxx;
117: {
118: if (x < 0)
119: *curx = x + n - 1;
120: else
121: *curx = x;
122:
123: if (x <= a)
124: *minx = 1 - n;
125: else if (x <= b - n)
126: *minx = a;
127: else
128: *minx = b - n;
129:
130: if (x >= b - n)
131: *maxx = b - 1;
132: else if (x >= a)
133: *maxx = b - n;
134: else
135: *maxx = a;
136: }