1 /*
2 * CDDL HEADER START
3 *
4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License, Version 1.0 only
6 * (the "License"). You may not use this file except in compliance
7 * with the License.
8 *
9 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10 * or http://www.opensolaris.org/os/licensing.
11 * See the License for the specific language governing permissions
12 * and limitations under the License.
13 *
14 * When distributing Covered Code, include this CDDL HEADER in each
15 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16 * If applicable, add the following below this CDDL HEADER, with the
17 * fields enclosed by brackets "[]" replaced with your own identifying
18 * information: Portions Copyright [yyyy] [name of copyright owner]
19 *
20 * CDDL HEADER END
21 */
22 /*
23 * Copyright (c) 1995-1998 by Sun Microsystems, Inc.
24 * All rights reserved.
25 */
26
27 /* LINTLIBRARY */
28
29 /*
30 * wsyncup.c
31 *
32 * XCurses Library
33 *
34 * Copyright 1990, 1995 by Mortice Kern Systems Inc. All rights reserved.
35 *
36 */
37
38 #if M_RCSID
39 #ifndef lint
40 static char rcsID[] = "$Header: /rd/src/libc/xcurses/rcs/wsyncup.c 1.1 "
41 "1995/06/21 20:04:28 ant Exp $";
42 #endif
43 #endif
44
45 #include <private.h>
46
47 int
syncok(WINDOW * w,bool bf)48 syncok(WINDOW *w, bool bf)
49 {
50 w->_flags &= ~W_SYNC_UP;
51 if (bf)
52 w->_flags |= W_SYNC_UP;
53
54 return (OK);
55 }
56
57 void
wsyncup(WINDOW * w)58 wsyncup(WINDOW *w)
59 {
60 int y, py;
61 WINDOW *p;
62
63 for (p = w->_parent; p != NULL; w = p, p = w->_parent) {
64 /* Update the parent's dirty region from the child's. */
65 for (py = w->_begy - p->_begy, y = 0; y < w->_maxy; ++y, ++py) {
66 if (0 <= w->_last[y]) {
67 p->_first[py] = w->_begx + w->_first[y];
68 p->_last[py] = w->_begx + w->_last[y];
69 }
70 }
71 }
72 }
73
74 void
wcursyncup(WINDOW * w)75 wcursyncup(WINDOW *w)
76 {
77 WINDOW *p;
78
79 for (p = w->_parent; p != NULL; w = p, p = w->_parent) {
80 p->_cury = w->_begy + w->_cury;
81 p->_curx = w->_begx + w->_curx;
82 }
83 }
84