newwin.c revision 1.21 1 1.21 jdc /* $NetBSD: newwin.c,v 1.21 2000/04/18 22:45:24 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.21 jdc __RCSID("$NetBSD: newwin.c,v 1.21 2000/04/18 22:45:24 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.1 cgd
54 1.19 blymn void __set_subwin(WINDOW *orig, WINDOW *win);
55 1.20 blymn
56 1.20 blymn /*
57 1.20 blymn * derwin --
58 1.20 blymn * Create a new window in the same manner as subwin but (by, bx)
59 1.20 blymn * are relative to the origin of window orig instead of absolute.
60 1.20 blymn */
61 1.20 blymn WINDOW *
62 1.20 blymn derwin(WINDOW *orig, int nlines, int ncols, int by, int bx)
63 1.20 blymn {
64 1.20 blymn if (orig == NULL)
65 1.20 blymn return ERR;
66 1.20 blymn
67 1.20 blymn return subwin(orig, nlines, ncols, orig->begy + by, orig->begx + bx);
68 1.20 blymn }
69 1.5 cgd
70 1.4 mycroft /*
71 1.4 mycroft * newwin --
72 1.4 mycroft * Allocate space for and set up defaults for a new window.
73 1.4 mycroft */
74 1.1 cgd WINDOW *
75 1.19 blymn newwin(int nlines, int ncols, int by, int bx)
76 1.1 cgd {
77 1.9 perry WINDOW *win;
78 1.9 perry __LINE *lp;
79 1.10 mrg int i, j;
80 1.9 perry __LDATA *sp;
81 1.1 cgd
82 1.19 blymn if (nlines == 0)
83 1.19 blymn nlines = LINES - by;
84 1.19 blymn if (ncols == 0)
85 1.19 blymn ncols = COLS - bx;
86 1.5 cgd
87 1.19 blymn if ((win = __makenew(nlines, ncols, by, bx, 0)) == NULL)
88 1.4 mycroft return (NULL);
89 1.5 cgd
90 1.5 cgd win->nextp = win;
91 1.5 cgd win->ch_off = 0;
92 1.5 cgd win->orig = NULL;
93 1.5 cgd
94 1.5 cgd #ifdef DEBUG
95 1.5 cgd __CTRACE("newwin: win->ch_off = %d\n", win->ch_off);
96 1.5 cgd #endif
97 1.5 cgd
98 1.19 blymn for (i = 0; i < nlines; i++) {
99 1.5 cgd lp = win->lines[i];
100 1.5 cgd lp->flags = 0;
101 1.19 blymn for (sp = lp->line, j = 0; j < ncols; j++, sp++) {
102 1.5 cgd sp->ch = ' ';
103 1.21 jdc sp->bch = ' ';
104 1.5 cgd sp->attr = 0;
105 1.21 jdc sp->battr = 0;
106 1.5 cgd }
107 1.12 christos lp->hash = __hash((char *)(void *)lp->line,
108 1.19 blymn (int) (ncols * __LDATASIZE));
109 1.1 cgd }
110 1.4 mycroft return (win);
111 1.1 cgd }
112 1.1 cgd
113 1.1 cgd WINDOW *
114 1.19 blymn subwin(WINDOW *orig, int nlines, int ncols, int by, int bx)
115 1.1 cgd {
116 1.10 mrg int i;
117 1.5 cgd __LINE *lp;
118 1.9 perry WINDOW *win;
119 1.1 cgd
120 1.4 mycroft /* Make sure window fits inside the original one. */
121 1.4 mycroft #ifdef DEBUG
122 1.19 blymn __CTRACE("subwin: (%0.2o, %d, %d, %d, %d)\n", orig, nlines, ncols, by, bx);
123 1.4 mycroft #endif
124 1.5 cgd if (by < orig->begy || bx < orig->begx
125 1.19 blymn || by + nlines > orig->maxy + orig->begy
126 1.19 blymn || bx + ncols > orig->maxx + orig->begx)
127 1.4 mycroft return (NULL);
128 1.19 blymn if (nlines == 0)
129 1.19 blymn nlines = orig->maxy + orig->begy - by;
130 1.19 blymn if (ncols == 0)
131 1.19 blymn ncols = orig->maxx + orig->begx - bx;
132 1.19 blymn if ((win = __makenew(nlines, ncols, by, bx, 1)) == NULL)
133 1.4 mycroft return (NULL);
134 1.5 cgd win->nextp = orig->nextp;
135 1.5 cgd orig->nextp = win;
136 1.5 cgd win->orig = orig;
137 1.5 cgd
138 1.5 cgd /* Initialize flags here so that refresh can also use __set_subwin. */
139 1.5 cgd for (lp = win->lspace, i = 0; i < win->maxy; i++, lp++)
140 1.5 cgd lp->flags = 0;
141 1.4 mycroft __set_subwin(orig, win);
142 1.4 mycroft return (win);
143 1.1 cgd }
144 1.1 cgd /*
145 1.4 mycroft * This code is shared with mvwin().
146 1.1 cgd */
147 1.4 mycroft void
148 1.16 blymn __set_subwin(WINDOW *orig, WINDOW *win)
149 1.1 cgd {
150 1.10 mrg int i;
151 1.5 cgd __LINE *lp, *olp;
152 1.5 cgd
153 1.5 cgd win->ch_off = win->begx - orig->begx;
154 1.10 mrg /* Point line pointers to line space. */
155 1.5 cgd for (lp = win->lspace, i = 0; i < win->maxy; i++, lp++) {
156 1.5 cgd win->lines[i] = lp;
157 1.11 mycroft olp = orig->lines[i + win->begy - orig->begy];
158 1.18 mycroft lp->line = &olp->line[win->ch_off];
159 1.5 cgd lp->firstchp = &olp->firstch;
160 1.5 cgd lp->lastchp = &olp->lastch;
161 1.12 christos lp->hash = __hash((char *)(void *)lp->line,
162 1.12 christos (int) (win->maxx * __LDATASIZE));
163 1.5 cgd }
164 1.1 cgd
165 1.4 mycroft #ifdef DEBUG
166 1.5 cgd __CTRACE("__set_subwin: win->ch_off = %d\n", win->ch_off);
167 1.4 mycroft #endif
168 1.1 cgd }
169 1.1 cgd /*
170 1.5 cgd * __makenew --
171 1.4 mycroft * Set up a window buffer and returns a pointer to it.
172 1.1 cgd */
173 1.1 cgd static WINDOW *
174 1.19 blymn __makenew(int nlines, int ncols, int by, int bx, int sub)
175 1.4 mycroft {
176 1.15 jdc WINDOW *win;
177 1.15 jdc __LINE *lp;
178 1.15 jdc struct __winlist *wlp, *wlp2;
179 1.15 jdc int i;
180 1.10 mrg
181 1.1 cgd
182 1.4 mycroft #ifdef DEBUG
183 1.19 blymn __CTRACE("makenew: (%d, %d, %d, %d)\n", nlines, ncols, by, bx);
184 1.4 mycroft #endif
185 1.4 mycroft if ((win = malloc(sizeof(*win))) == NULL)
186 1.4 mycroft return (NULL);
187 1.4 mycroft #ifdef DEBUG
188 1.19 blymn __CTRACE("makenew: nlines = %d\n", nlines);
189 1.4 mycroft #endif
190 1.5 cgd
191 1.10 mrg /* Set up line pointer array and line space. */
192 1.19 blymn if ((win->lines = malloc(nlines * sizeof(__LINE *))) == NULL) {
193 1.1 cgd free(win);
194 1.5 cgd return NULL;
195 1.5 cgd }
196 1.19 blymn if ((win->lspace = malloc(nlines * sizeof(__LINE))) == NULL) {
197 1.10 mrg free(win);
198 1.10 mrg free(win->lines);
199 1.5 cgd return NULL;
200 1.5 cgd }
201 1.5 cgd /* Don't allocate window and line space if it's a subwindow */
202 1.5 cgd if (!sub) {
203 1.5 cgd /*
204 1.5 cgd * Allocate window space in one chunk.
205 1.5 cgd */
206 1.10 mrg if ((win->wspace =
207 1.19 blymn malloc(ncols * nlines * sizeof(__LDATA))) == NULL) {
208 1.5 cgd free(win->lines);
209 1.5 cgd free(win->lspace);
210 1.5 cgd free(win);
211 1.5 cgd return NULL;
212 1.15 jdc }
213 1.15 jdc /*
214 1.15 jdc * Append window to window list.
215 1.15 jdc */
216 1.15 jdc if ((wlp = malloc(sizeof(struct __winlist))) == NULL) {
217 1.15 jdc free(win->wspace);
218 1.15 jdc free(win->lines);
219 1.15 jdc free(win->lspace);
220 1.15 jdc free(win);
221 1.15 jdc return NULL;
222 1.15 jdc }
223 1.15 jdc wlp->winp = win;
224 1.15 jdc wlp->nextp = NULL;
225 1.15 jdc if (__winlistp == NULL)
226 1.15 jdc __winlistp = wlp;
227 1.15 jdc else {
228 1.15 jdc wlp2 = __winlistp;
229 1.15 jdc while (wlp2->nextp != NULL)
230 1.15 jdc wlp2 = wlp2->nextp;
231 1.15 jdc wlp2->nextp = wlp;
232 1.5 cgd }
233 1.5 cgd /*
234 1.5 cgd * Point line pointers to line space, and lines themselves into
235 1.5 cgd * window space.
236 1.5 cgd */
237 1.19 blymn for (lp = win->lspace, i = 0; i < nlines; i++, lp++) {
238 1.5 cgd win->lines[i] = lp;
239 1.19 blymn lp->line = &win->wspace[i * ncols];
240 1.5 cgd lp->firstchp = &lp->firstch;
241 1.5 cgd lp->lastchp = &lp->lastch;
242 1.5 cgd lp->firstch = 0;
243 1.5 cgd lp->lastch = 0;
244 1.5 cgd }
245 1.1 cgd }
246 1.4 mycroft #ifdef DEBUG
247 1.19 blymn __CTRACE("makenew: ncols = %d\n", ncols);
248 1.4 mycroft #endif
249 1.5 cgd win->cury = win->curx = 0;
250 1.19 blymn win->maxy = nlines;
251 1.19 blymn win->maxx = ncols;
252 1.5 cgd
253 1.5 cgd win->begy = by;
254 1.5 cgd win->begx = bx;
255 1.5 cgd win->flags = 0;
256 1.17 jdc win->delay = -1;
257 1.13 blymn win->wattr = 0;
258 1.21 jdc win->bch = ' ';
259 1.14 jdc win->battr = 0;
260 1.4 mycroft __swflags(win);
261 1.4 mycroft #ifdef DEBUG
262 1.13 blymn __CTRACE("makenew: win->wattr = %0.2o\n", win->wattr);
263 1.5 cgd __CTRACE("makenew: win->flags = %0.2o\n", win->flags);
264 1.5 cgd __CTRACE("makenew: win->maxy = %d\n", win->maxy);
265 1.5 cgd __CTRACE("makenew: win->maxx = %d\n", win->maxx);
266 1.5 cgd __CTRACE("makenew: win->begy = %d\n", win->begy);
267 1.5 cgd __CTRACE("makenew: win->begx = %d\n", win->begx);
268 1.4 mycroft #endif
269 1.4 mycroft return (win);
270 1.1 cgd }
271 1.1 cgd
272 1.4 mycroft void
273 1.16 blymn __swflags(WINDOW *win)
274 1.1 cgd {
275 1.7 cgd win->flags &= ~(__ENDLINE | __FULLWIN | __SCROLLWIN | __LEAVEOK);
276 1.5 cgd if (win->begx + win->maxx == COLS) {
277 1.5 cgd win->flags |= __ENDLINE;
278 1.7 cgd if (win->begx == 0 && win->maxy == LINES && win->begy == 0)
279 1.7 cgd win->flags |= __FULLWIN;
280 1.5 cgd if (win->begy + win->maxy == LINES)
281 1.5 cgd win->flags |= __SCROLLWIN;
282 1.1 cgd }
283 1.1 cgd }
284