1 /* @(#)wwcursor.c 8.1 (Berkeley) 6/6/93 */
2 /* $NetBSD: wwcursor.c,v 1.7 2003/08/07 11:17:37 agc 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. Neither the name of the University nor the names of its contributors
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
36 #include "ww.h"
37
38 void
wwcursor(struct ww * w,int on)39 wwcursor(struct ww *w, int on)
40 {
41 char *win;
42
43 if (on) {
44 if (ISSET(w->ww_wflags, WWW_HASCURSOR))
45 return;
46 SET(w->ww_wflags, WWW_HASCURSOR);
47 } else {
48 if (!ISSET(w->ww_wflags, WWW_HASCURSOR))
49 return;
50 CLR(w->ww_wflags, WWW_HASCURSOR);
51 }
52 if (wwcursormodes != 0) {
53 win = &w->ww_win[w->ww_cur.r][w->ww_cur.c];
54 *win ^= wwcursormodes;
55 if (w->ww_cur.r < w->ww_i.t || w->ww_cur.r >= w->ww_i.b
56 || w->ww_cur.c < w->ww_i.l || w->ww_cur.c >= w->ww_i.r)
57 return;
58 if (wwsmap[w->ww_cur.r][w->ww_cur.c] == w->ww_index) {
59 if (*win == 0)
60 w->ww_nvis[w->ww_cur.r]++;
61 else if (*win == wwcursormodes)
62 w->ww_nvis[w->ww_cur.r]--;
63 wwns[w->ww_cur.r][w->ww_cur.c].c_m ^= wwcursormodes;
64 wwtouched[w->ww_cur.r] |= WWU_TOUCHED;
65 }
66 }
67 }
68
69 void
wwsetcursormodes(int new)70 wwsetcursormodes(int new)
71 {
72 int i;
73 struct ww *w;
74 int old = wwcursormodes;
75
76 new &= wwavailmodes;
77 if (new == wwcursormodes)
78 return;
79 for (i = 0; i < NWW; i++)
80 if (wwindex[i] != 0 &&
81 ISSET((w = wwindex[i])->ww_wflags, WWW_HASCURSOR)) {
82 wwcursor(w, 0);
83 wwcursormodes = new;
84 wwcursor(w, 1);
85 wwcursormodes = old;
86 }
87 wwcursormodes = new;
88 }
89