|
|
1.1 root 1: /*
2: * Copyright (c) 1983 Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * Edward Wang at The University of California, Berkeley.
7: *
8: * Redistribution and use in source and binary forms are permitted provided
9: * that: (1) source distributions retain this entire copyright notice and
10: * comment, and (2) distributions including binaries display the following
11: * acknowledgement: ``This product includes software developed by the
12: * University of California, Berkeley and its contributors'' in the
13: * documentation or other materials provided with the distribution and in
14: * all advertising materials mentioning features or use of this software.
15: * Neither the name of the University nor the names of its contributors may
16: * be used to endorse or promote products derived from this software without
17: * specific prior written permission.
18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
19: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
20: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
21: */
22:
23: #ifndef lint
24: static char sccsid[] = "@(#)wwbox.c 3.8 (Berkeley) 6/6/90";
25: #endif /* not lint */
26:
27: #include "ww.h"
28: #include "tt.h"
29:
30: wwbox(w, r, c, nr, nc)
31: register struct ww *w;
32: register r, c;
33: int nr, nc;
34: {
35: register r1, c1;
36: register i;
37:
38: r1 = r + nr - 1;
39: c1 = c + nc - 1;
40: wwframec(w, r, c, WWF_D|WWF_R);
41: for (i = c + 1; i < c1; i++)
42: wwframec(w, r, i, WWF_L|WWF_R);
43: wwframec(w, r, i, WWF_L|WWF_D);
44: for (i = r + 1; i < r1; i++)
45: wwframec(w, i, c1, WWF_U|WWF_D);
46: wwframec(w, i, c1, WWF_U|WWF_L);
47: for (i = c1 - 1; i > c; i--)
48: wwframec(w, r1, i, WWF_R|WWF_L);
49: wwframec(w, r1, i, WWF_R|WWF_U);
50: for (i = r1 - 1; i > r; i--)
51: wwframec(w, i, c, WWF_D|WWF_U);
52: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.