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 #pragma ident "%Z%%M% %I% %E% SMI" 28 29 /* LINTLIBRARY */ 30 31 /* 32 * wsyncup.c 33 * 34 * XCurses Library 35 * 36 * Copyright 1990, 1995 by Mortice Kern Systems Inc. All rights reserved. 37 * 38 */ 39 40 #if M_RCSID 41 #ifndef lint 42 static char rcsID[] = "$Header: /rd/src/libc/xcurses/rcs/wsyncup.c 1.1 " 43 "1995/06/21 20:04:28 ant Exp $"; 44 #endif 45 #endif 46 47 #include <private.h> 48 49 int 50 syncok(WINDOW *w, bool bf) 51 { 52 w->_flags &= ~W_SYNC_UP; 53 if (bf) 54 w->_flags |= W_SYNC_UP; 55 56 return (OK); 57 } 58 59 void 60 wsyncup(WINDOW *w) 61 { 62 int y, py; 63 WINDOW *p; 64 65 for (p = w->_parent; p != NULL; w = p, p = w->_parent) { 66 /* Update the parent's dirty region from the child's. */ 67 for (py = w->_begy - p->_begy, y = 0; y < w->_maxy; ++y, ++py) { 68 if (0 <= w->_last[y]) { 69 p->_first[py] = w->_begx + w->_first[y]; 70 p->_last[py] = w->_begx + w->_last[y]; 71 } 72 } 73 } 74 } 75 76 void 77 wcursyncup(WINDOW *w) 78 { 79 WINDOW *p; 80 81 for (p = w->_parent; p != NULL; w = p, p = w->_parent) { 82 p->_cury = w->_begy + w->_cury; 83 p->_curx = w->_begx + w->_curx; 84 } 85 } 86