Commit | Line | Data |
---|---|---|
2c872e05 | 1 | /* @(#)cmd5.c 8.1 (Berkeley) 6/6/93 */ |
abecab39 SW |
2 | /* $NetBSD: cmd5.c,v 1.7 2003/08/07 11:17:23 agc Exp $ */ |
3 | ||
984263bc MD |
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. | |
abecab39 | 19 | * 3. Neither the name of the University nor the names of its contributors |
984263bc MD |
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 | ||
984263bc MD |
36 | #include "defs.h" |
37 | ||
38 | /* | |
39 | * Window movement. | |
40 | */ | |
41 | ||
abecab39 SW |
42 | void getminmax(int, int, int, int, int *, int *, int *); |
43 | ||
44 | void | |
45 | c_move(struct ww *w) | |
984263bc MD |
46 | { |
47 | int col, row; | |
48 | int mincol, minrow; | |
49 | int maxcol, maxrow; | |
50 | int curcol, currow; | |
51 | ||
52 | if (!terse) | |
53 | wwputs("New window position: ", cmdwin); | |
54 | col = w->ww_w.l; | |
55 | row = w->ww_w.t; | |
56 | wwadd(boxwin, framewin->ww_back); | |
57 | for (;;) { | |
58 | wwbox(boxwin, row - 1, col - 1, w->ww_w.nr + 2, w->ww_w.nc + 2); | |
59 | getminmax(row, w->ww_w.nr, 1, wwnrow, | |
60 | &currow, &minrow, &maxrow); | |
61 | getminmax(col, w->ww_w.nc, 0, wwncol, | |
62 | &curcol, &mincol, &maxcol); | |
63 | wwsetcursor(currow, curcol); | |
64 | while (wwpeekc() < 0) | |
65 | wwiomux(); | |
66 | switch (getpos(&row, &col, minrow, mincol, maxrow, maxcol)) { | |
67 | case 3: | |
68 | wwunbox(boxwin); | |
69 | wwdelete(boxwin); | |
70 | return; | |
71 | case 2: | |
72 | wwunbox(boxwin); | |
73 | break; | |
74 | case 1: | |
75 | wwunbox(boxwin); | |
76 | case 0: | |
77 | continue; | |
78 | } | |
79 | break; | |
80 | } | |
81 | wwdelete(boxwin); | |
82 | if (!terse) | |
83 | wwputc('\n', cmdwin); | |
84 | wwcurtowin(cmdwin); | |
85 | movewin(w, row, col); | |
86 | } | |
87 | ||
abecab39 SW |
88 | void |
89 | movewin(struct ww *w, int row, int col) | |
984263bc MD |
90 | { |
91 | struct ww *back = w->ww_back; | |
92 | ||
93 | w->ww_alt.t = w->ww_w.t; | |
94 | w->ww_alt.l = w->ww_w.l; | |
95 | wwdelete(w); | |
96 | wwmove(w, row, col); | |
97 | wwadd(w, back); | |
98 | reframe(); | |
99 | } | |
100 | ||
101 | /* | |
102 | * Weird stufff, don't ask. | |
103 | */ | |
abecab39 SW |
104 | void |
105 | getminmax(int x, int n, int a, int b, int *curx, int *minx, int *maxx) | |
984263bc MD |
106 | { |
107 | if (x < 0) | |
108 | *curx = x + n - 1; | |
109 | else | |
110 | *curx = x; | |
111 | ||
112 | if (x <= a) | |
113 | *minx = 1 - n; | |
114 | else if (x <= b - n) | |
115 | *minx = a; | |
116 | else | |
117 | *minx = b - n; | |
118 | ||
119 | if (x >= b - n) | |
120 | *maxx = b - 1; | |
121 | else if (x >= a) | |
122 | *maxx = b - n; | |
123 | else | |
124 | *maxx = a; | |
125 | } |