|
|
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[] = "@(#)wwdump.c 3.15 (Berkeley) 6/6/90";
25: #endif /* not lint */
26:
27: #include "ww.h"
28: #include "tt.h"
29:
30: static char cmap[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
31:
32: wwdumpwin(w)
33: register struct ww *w;
34: {
35: register i, j;
36:
37: tt.tt_nmodes = 0;
38: (*tt.tt_clear)();
39: for (i = w->ww_i.t; i < w->ww_i.b; i++) {
40: (*tt.tt_move)(i, w->ww_i.l);
41: for (j = w->ww_i.l; j < w->ww_i.r; j++)
42: (*tt.tt_putc)(w->ww_win[i][j] & WWM_GLS ? 'G' : ' ');
43: }
44: }
45:
46: wwdumpnvis(w)
47: register struct ww *w;
48: {
49: register i;
50: char buf[20];
51:
52: tt.tt_nmodes = 0;
53: (*tt.tt_clear)();
54: for (i = w->ww_i.t; i < w->ww_i.b; i++) {
55: (*tt.tt_move)(i, w->ww_i.l);
56: (void) sprintf(buf, "%d", w->ww_nvis[i]);
57: (*tt.tt_write)(buf, strlen(buf));
58: }
59: }
60:
61: wwdumpsmap()
62: {
63: register i, j;
64:
65: tt.tt_nmodes = 0;
66: (*tt.tt_clear)();
67: for (i = 0; i < wwnrow; i++) {
68: (*tt.tt_move)(i, 0);
69: for (j = 0; j < wwncol; j++)
70: (*tt.tt_putc)(cmap[wwsmap[i][j]]);
71: }
72: }
73:
74: wwdumpns()
75: {
76: register i, j;
77:
78: (*tt.tt_clear)();
79: for (i = 0; i < wwnrow; i++) {
80: (*tt.tt_move)(i, 0);
81: for (j = 0; j < wwncol; j++) {
82: tt.tt_nmodes = wwns[i][j].c_m & tt.tt_availmodes;
83: (*tt.tt_putc)(wwns[i][j].c_c);
84: }
85: }
86: }
87:
88: wwdumpos()
89: {
90: register i, j;
91:
92: (*tt.tt_clear)();
93: for (i = 0; i < wwnrow; i++) {
94: (*tt.tt_move)(i, 0);
95: for (j = 0; j < wwncol; j++) {
96: tt.tt_nmodes = wwos[i][j].c_m & tt.tt_availmodes;
97: (*tt.tt_putc)(wwns[i][j].c_c);
98: }
99: }
100: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.