|
|
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[] = "@(#)wwdelchar.c 3.16 (Berkeley) 6/6/90";
25: #endif /* not lint */
26:
27: #include "ww.h"
28: #include "tt.h"
29:
30: wwdelchar(w, row, col)
31: register struct ww *w;
32: {
33: register i;
34: int nvis;
35:
36: /*
37: * First, shift the line.
38: */
39: {
40: register union ww_char *p, *q;
41:
42: p = &w->ww_buf[row][col];
43: q = p + 1;
44: for (i = w->ww_b.r - col; --i > 0;)
45: *p++ = *q++;
46: p->c_w = ' ';
47: }
48:
49: /*
50: * If can't see it, just return.
51: */
52: if (row < w->ww_i.t || row >= w->ww_i.b
53: || w->ww_i.r <= 0 || w->ww_i.r <= col)
54: return;
55:
56: if (col < w->ww_i.l)
57: col = w->ww_i.l;
58:
59: /*
60: * Now find out how much is actually changed, and fix wwns.
61: */
62: {
63: register union ww_char *buf;
64: register char *win;
65: register union ww_char *ns;
66: register char *smap;
67: char touched;
68:
69: nvis = 0;
70: smap = &wwsmap[row][col];
71: for (i = col; i < w->ww_i.r && *smap++ != w->ww_index; i++)
72: ;
73: if (i >= w->ww_i.r)
74: return;
75: col = i;
76: buf = w->ww_buf[row];
77: win = w->ww_win[row];
78: ns = wwns[row];
79: smap = &wwsmap[row][i];
80: touched = wwtouched[row];
81: for (; i < w->ww_i.r; i++) {
82: if (*smap++ != w->ww_index)
83: continue;
84: touched |= WWU_TOUCHED;
85: if (win[i])
86: ns[i].c_w =
87: buf[i].c_w ^ win[i] << WWC_MSHIFT;
88: else {
89: nvis++;
90: ns[i] = buf[i];
91: }
92: }
93: wwtouched[row] = touched;
94: }
95:
96: /*
97: * Can/Should we use delete character?
98: */
99: if (tt.tt_delchar != 0 && nvis > (wwncol - col) / 2) {
100: register union ww_char *p, *q;
101:
102: xxdelchar(row, col);
103: p = &wwos[row][col];
104: q = p + 1;
105: for (i = wwncol - col; --i > 0;)
106: *p++ = *q++;
107: p->c_w = ' ';
108: }
109: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.