newwin.c revision 1.24 1 1.24 jdc /* $NetBSD: newwin.c,v 1.24 2001/04/20 12:56:09 jdc Exp $ */
2 1.8 mikel
3 1.1 cgd /*
4 1.7 cgd * Copyright (c) 1981, 1993, 1994
5 1.5 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.8 mikel #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.8 mikel #if 0
39 1.7 cgd static char sccsid[] = "@(#)newwin.c 8.3 (Berkeley) 7/27/94";
40 1.8 mikel #else
41 1.24 jdc __RCSID("$NetBSD: newwin.c,v 1.24 2001/04/20 12:56:09 jdc Exp $");
42 1.8 mikel #endif
43 1.10 mrg #endif /* not lint */
44 1.1 cgd
45 1.4 mycroft #include <stdlib.h>
46 1.1 cgd
47 1.7 cgd #include "curses.h"
48 1.13 blymn #include "curses_private.h"
49 1.7 cgd
50 1.15 jdc extern struct __winlist *winlistp;
51 1.15 jdc
52 1.19 blymn static WINDOW *__makenew(int nlines, int ncols, int by, int bx, int sub);
53 1.20 blymn
54 1.20 blymn /*
55 1.20 blymn * derwin --
56 1.20 blymn * Create a new window in the same manner as subwin but (by, bx)
57 1.20 blymn * are relative to the origin of window orig instead of absolute.
58 1.20 blymn */
59 1.20 blymn WINDOW *
60 1.20 blymn derwin(WINDOW *orig, int nlines, int ncols, int by, int bx)
61 1.20 blymn {
62 1.20 blymn if (orig == NULL)
63 1.20 blymn return ERR;
64 1.20 blymn
65 1.20 blymn return subwin(orig, nlines, ncols, orig->begy + by, orig->begx + bx);
66 1.20 blymn }
67 1.5 cgd
68 1.22 blymn /*
69 1.22 blymn * dupwin --
70 1.22 blymn * Create a copy of the given window.
71 1.22 blymn */
72 1.22 blymn WINDOW *
73 1.22 blymn dupwin(WINDOW *win)
74 1.22 blymn {
75 1.22 blymn WINDOW *new_one;
76 1.22 blymn
77 1.22 blymn if ((new_one =
78 1.22 blymn newwin(win->maxy, win->maxx, win->begy, win->begx)) == NULL)
79 1.22 blymn return NULL;
80 1.22 blymn
81 1.22 blymn overwrite(win, new_one);
82 1.22 blymn return new_one;
83 1.22 blymn }
84 1.22 blymn
85 1.22 blymn
86 1.4 mycroft /*
87 1.4 mycroft * newwin --
88 1.4 mycroft * Allocate space for and set up defaults for a new window.
89 1.4 mycroft */
90 1.1 cgd WINDOW *
91 1.19 blymn newwin(int nlines, int ncols, int by, int bx)
92 1.1 cgd {
93 1.9 perry WINDOW *win;
94 1.9 perry __LINE *lp;
95 1.10 mrg int i, j;
96 1.9 perry __LDATA *sp;
97 1.1 cgd
98 1.19 blymn if (nlines == 0)
99 1.19 blymn nlines = LINES - by;
100 1.19 blymn if (ncols == 0)
101 1.19 blymn ncols = COLS - bx;
102 1.5 cgd
103 1.19 blymn if ((win = __makenew(nlines, ncols, by, bx, 0)) == NULL)
104 1.4 mycroft return (NULL);
105 1.5 cgd
106 1.5 cgd win->nextp = win;
107 1.5 cgd win->ch_off = 0;
108 1.5 cgd win->orig = NULL;
109 1.5 cgd
110 1.5 cgd #ifdef DEBUG
111 1.5 cgd __CTRACE("newwin: win->ch_off = %d\n", win->ch_off);
112 1.5 cgd #endif
113 1.5 cgd
114 1.19 blymn for (i = 0; i < nlines; i++) {
115 1.5 cgd lp = win->lines[i];
116 1.5 cgd lp->flags = 0;
117 1.19 blymn for (sp = lp->line, j = 0; j < ncols; j++, sp++) {
118 1.5 cgd sp->ch = ' ';
119 1.21 jdc sp->bch = ' ';
120 1.5 cgd sp->attr = 0;
121 1.21 jdc sp->battr = 0;
122 1.5 cgd }
123 1.12 christos lp->hash = __hash((char *)(void *)lp->line,
124 1.19 blymn (int) (ncols * __LDATASIZE));
125 1.1 cgd }
126 1.4 mycroft return (win);
127 1.1 cgd }
128 1.1 cgd
129 1.1 cgd WINDOW *
130 1.19 blymn subwin(WINDOW *orig, int nlines, int ncols, int by, int bx)
131 1.1 cgd {
132 1.10 mrg int i;
133 1.5 cgd __LINE *lp;
134 1.9 perry WINDOW *win;
135 1.1 cgd
136 1.4 mycroft /* Make sure window fits inside the original one. */
137 1.4 mycroft #ifdef DEBUG
138 1.19 blymn __CTRACE("subwin: (%0.2o, %d, %d, %d, %d)\n", orig, nlines, ncols, by, bx);
139 1.4 mycroft #endif
140 1.5 cgd if (by < orig->begy || bx < orig->begx
141 1.19 blymn || by + nlines > orig->maxy + orig->begy
142 1.19 blymn || bx + ncols > orig->maxx + orig->begx)
143 1.4 mycroft return (NULL);
144 1.19 blymn if (nlines == 0)
145 1.19 blymn nlines = orig->maxy + orig->begy - by;
146 1.19 blymn if (ncols == 0)
147 1.19 blymn ncols = orig->maxx + orig->begx - bx;
148 1.19 blymn if ((win = __makenew(nlines, ncols, by, bx, 1)) == NULL)
149 1.4 mycroft return (NULL);
150 1.5 cgd win->nextp = orig->nextp;
151 1.5 cgd orig->nextp = win;
152 1.5 cgd win->orig = orig;
153 1.5 cgd
154 1.5 cgd /* Initialize flags here so that refresh can also use __set_subwin. */
155 1.5 cgd for (lp = win->lspace, i = 0; i < win->maxy; i++, lp++)
156 1.5 cgd lp->flags = 0;
157 1.4 mycroft __set_subwin(orig, win);
158 1.4 mycroft return (win);
159 1.1 cgd }
160 1.1 cgd /*
161 1.4 mycroft * This code is shared with mvwin().
162 1.1 cgd */
163 1.4 mycroft void
164 1.16 blymn __set_subwin(WINDOW *orig, WINDOW *win)
165 1.1 cgd {
166 1.10 mrg int i;
167 1.5 cgd __LINE *lp, *olp;
168 1.5 cgd
169 1.5 cgd win->ch_off = win->begx - orig->begx;
170 1.10 mrg /* Point line pointers to line space. */
171 1.5 cgd for (lp = win->lspace, i = 0; i < win->maxy; i++, lp++) {
172 1.5 cgd win->lines[i] = lp;
173 1.11 mycroft olp = orig->lines[i + win->begy - orig->begy];
174 1.18 mycroft lp->line = &olp->line[win->ch_off];
175 1.5 cgd lp->firstchp = &olp->firstch;
176 1.5 cgd lp->lastchp = &olp->lastch;
177 1.12 christos lp->hash = __hash((char *)(void *)lp->line,
178 1.12 christos (int) (win->maxx * __LDATASIZE));
179 1.5 cgd }
180 1.1 cgd
181 1.4 mycroft #ifdef DEBUG
182 1.5 cgd __CTRACE("__set_subwin: win->ch_off = %d\n", win->ch_off);
183 1.4 mycroft #endif
184 1.1 cgd }
185 1.1 cgd /*
186 1.5 cgd * __makenew --
187 1.4 mycroft * Set up a window buffer and returns a pointer to it.
188 1.1 cgd */
189 1.1 cgd static WINDOW *
190 1.19 blymn __makenew(int nlines, int ncols, int by, int bx, int sub)
191 1.4 mycroft {
192 1.15 jdc WINDOW *win;
193 1.15 jdc __LINE *lp;
194 1.15 jdc struct __winlist *wlp, *wlp2;
195 1.15 jdc int i;
196 1.10 mrg
197 1.1 cgd
198 1.4 mycroft #ifdef DEBUG
199 1.19 blymn __CTRACE("makenew: (%d, %d, %d, %d)\n", nlines, ncols, by, bx);
200 1.4 mycroft #endif
201 1.4 mycroft if ((win = malloc(sizeof(*win))) == NULL)
202 1.4 mycroft return (NULL);
203 1.4 mycroft #ifdef DEBUG
204 1.19 blymn __CTRACE("makenew: nlines = %d\n", nlines);
205 1.4 mycroft #endif
206 1.5 cgd
207 1.10 mrg /* Set up line pointer array and line space. */
208 1.19 blymn if ((win->lines = malloc(nlines * sizeof(__LINE *))) == NULL) {
209 1.1 cgd free(win);
210 1.5 cgd return NULL;
211 1.5 cgd }
212 1.19 blymn if ((win->lspace = malloc(nlines * sizeof(__LINE))) == NULL) {
213 1.10 mrg free(win);
214 1.10 mrg free(win->lines);
215 1.5 cgd return NULL;
216 1.5 cgd }
217 1.5 cgd /* Don't allocate window and line space if it's a subwindow */
218 1.5 cgd if (!sub) {
219 1.5 cgd /*
220 1.5 cgd * Allocate window space in one chunk.
221 1.5 cgd */
222 1.10 mrg if ((win->wspace =
223 1.19 blymn malloc(ncols * nlines * sizeof(__LDATA))) == NULL) {
224 1.5 cgd free(win->lines);
225 1.5 cgd free(win->lspace);
226 1.5 cgd free(win);
227 1.5 cgd return NULL;
228 1.15 jdc }
229 1.15 jdc /*
230 1.15 jdc * Append window to window list.
231 1.15 jdc */
232 1.15 jdc if ((wlp = malloc(sizeof(struct __winlist))) == NULL) {
233 1.15 jdc free(win->wspace);
234 1.15 jdc free(win->lines);
235 1.15 jdc free(win->lspace);
236 1.15 jdc free(win);
237 1.15 jdc return NULL;
238 1.15 jdc }
239 1.15 jdc wlp->winp = win;
240 1.15 jdc wlp->nextp = NULL;
241 1.15 jdc if (__winlistp == NULL)
242 1.15 jdc __winlistp = wlp;
243 1.15 jdc else {
244 1.15 jdc wlp2 = __winlistp;
245 1.15 jdc while (wlp2->nextp != NULL)
246 1.15 jdc wlp2 = wlp2->nextp;
247 1.15 jdc wlp2->nextp = wlp;
248 1.5 cgd }
249 1.5 cgd /*
250 1.5 cgd * Point line pointers to line space, and lines themselves into
251 1.5 cgd * window space.
252 1.5 cgd */
253 1.19 blymn for (lp = win->lspace, i = 0; i < nlines; i++, lp++) {
254 1.5 cgd win->lines[i] = lp;
255 1.19 blymn lp->line = &win->wspace[i * ncols];
256 1.5 cgd lp->firstchp = &lp->firstch;
257 1.5 cgd lp->lastchp = &lp->lastch;
258 1.5 cgd lp->firstch = 0;
259 1.5 cgd lp->lastch = 0;
260 1.5 cgd }
261 1.1 cgd }
262 1.4 mycroft #ifdef DEBUG
263 1.19 blymn __CTRACE("makenew: ncols = %d\n", ncols);
264 1.4 mycroft #endif
265 1.5 cgd win->cury = win->curx = 0;
266 1.19 blymn win->maxy = nlines;
267 1.19 blymn win->maxx = ncols;
268 1.5 cgd
269 1.5 cgd win->begy = by;
270 1.5 cgd win->begx = bx;
271 1.5 cgd win->flags = 0;
272 1.17 jdc win->delay = -1;
273 1.13 blymn win->wattr = 0;
274 1.21 jdc win->bch = ' ';
275 1.14 jdc win->battr = 0;
276 1.24 jdc win->scr_t = win->begy;
277 1.24 jdc win->scr_b = win->maxy - 1;
278 1.4 mycroft __swflags(win);
279 1.4 mycroft #ifdef DEBUG
280 1.13 blymn __CTRACE("makenew: win->wattr = %0.2o\n", win->wattr);
281 1.5 cgd __CTRACE("makenew: win->flags = %0.2o\n", win->flags);
282 1.5 cgd __CTRACE("makenew: win->maxy = %d\n", win->maxy);
283 1.5 cgd __CTRACE("makenew: win->maxx = %d\n", win->maxx);
284 1.5 cgd __CTRACE("makenew: win->begy = %d\n", win->begy);
285 1.5 cgd __CTRACE("makenew: win->begx = %d\n", win->begx);
286 1.24 jdc __CTRACE("makenew: win->scr_t = %d\n", win->scr_t);
287 1.24 jdc __CTRACE("makenew: win->scr_b = %d\n", win->scr_b);
288 1.4 mycroft #endif
289 1.4 mycroft return (win);
290 1.1 cgd }
291 1.1 cgd
292 1.4 mycroft void
293 1.16 blymn __swflags(WINDOW *win)
294 1.1 cgd {
295 1.7 cgd win->flags &= ~(__ENDLINE | __FULLWIN | __SCROLLWIN | __LEAVEOK);
296 1.5 cgd if (win->begx + win->maxx == COLS) {
297 1.5 cgd win->flags |= __ENDLINE;
298 1.7 cgd if (win->begx == 0 && win->maxy == LINES && win->begy == 0)
299 1.7 cgd win->flags |= __FULLWIN;
300 1.5 cgd if (win->begy + win->maxy == LINES)
301 1.5 cgd win->flags |= __SCROLLWIN;
302 1.1 cgd }
303 1.1 cgd }
304