1 /* @(#)wwadd.c 8.1 (Berkeley) 6/6/93 */
2 /* $NetBSD: wwadd.c,v 1.7 2003/08/07 11:17:35 agc Exp $ */
5 * Copyright (c) 1983, 1993
6 * The Regents of the University of California. All rights reserved.
8 * This code is derived from software contributed to Berkeley by
9 * Edward Wang at The University of California, Berkeley.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
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.
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
42 wwadd(struct ww
*w1
, struct ww
*w2
)
47 w1
->ww_order
= w2
->ww_order
+ 1;
49 w1
->ww_forw
= w2
->ww_forw
;
50 w2
->ww_forw
->ww_back
= w1
;
53 for (w
= w1
->ww_forw
; w
!= &wwhead
; w
= w
->ww_forw
)
55 for (i
= w1
->ww_i
.t
; i
< w1
->ww_i
.b
; i
++) {
57 unsigned char *smap
= wwsmap
[i
];
58 char *win
= w1
->ww_win
[i
];
59 union ww_char
*ns
= wwns
[i
];
60 union ww_char
*buf
= w1
->ww_buf
[i
];
64 for (j
= w1
->ww_i
.l
; j
< w1
->ww_i
.r
; j
++) {
66 if (w1
->ww_order
> w
->ww_order
)
70 if (w
!= &wwnobody
&& w
->ww_win
[i
][j
] == 0)
72 smap
[j
] = w1
->ww_index
;
75 ns
[j
].c_w
= buf
[j
].c_w
^ win
[j
] << WWC_MSHIFT
;
79 wwtouched
[i
] |= WWU_TOUCHED
;
80 w1
->ww_nvis
[i
] = nvis
;