addbytes.c revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1987 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd static char sccsid[] = "@(#)addbytes.c 5.4 (Berkeley) 6/1/90";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd # include "curses.ext"
39 1.1 cgd
40 1.1 cgd /*
41 1.1 cgd * This routine adds the character to the current position
42 1.1 cgd *
43 1.1 cgd */
44 1.1 cgd waddbytes(win, bytes, count)
45 1.1 cgd reg WINDOW *win;
46 1.1 cgd reg char *bytes;
47 1.1 cgd reg int count;
48 1.1 cgd {
49 1.1 cgd #define SYNCH_OUT() {win->_cury = y; win->_curx = x;}
50 1.1 cgd #define SYNCH_IN() {y = win->_cury; x = win->_curx;}
51 1.1 cgd reg int x, y;
52 1.1 cgd reg int newx;
53 1.1 cgd
54 1.1 cgd SYNCH_IN();
55 1.1 cgd # ifdef FULLDEBUG
56 1.1 cgd fprintf(outf, "ADDBYTES('%c') at (%d, %d)\n", c, y, x);
57 1.1 cgd # endif
58 1.1 cgd while (count--) {
59 1.1 cgd register int c;
60 1.1 cgd static char blanks[] = " ";
61 1.1 cgd
62 1.1 cgd c = *bytes++;
63 1.1 cgd switch (c) {
64 1.1 cgd case '\t':
65 1.2 mycroft SYNCH_OUT();
66 1.1 cgd if (waddbytes(win, blanks, 8-(x%8)) == ERR) {
67 1.1 cgd return ERR;
68 1.1 cgd }
69 1.2 mycroft SYNCH_IN();
70 1.1 cgd break;
71 1.1 cgd
72 1.1 cgd default:
73 1.1 cgd # ifdef FULLDEBUG
74 1.1 cgd fprintf(outf, "ADDBYTES: 1: y = %d, x = %d, firstch = %d, lastch = %d\n", y, x, win->_firstch[y], win->_lastch[y]);
75 1.1 cgd # endif
76 1.1 cgd if (win->_flags & _STANDOUT)
77 1.1 cgd c |= _STANDOUT;
78 1.1 cgd {
79 1.1 cgd # ifdef FULLDEBUG
80 1.1 cgd fprintf(outf, "ADDBYTES(%0.2o, %d, %d)\n", win, y, x);
81 1.1 cgd # endif
82 1.1 cgd if (win->_y[y][x] != c) {
83 1.1 cgd newx = x + win->_ch_off;
84 1.1 cgd if (win->_firstch[y] == _NOCHANGE) {
85 1.1 cgd win->_firstch[y] =
86 1.1 cgd win->_lastch[y] = newx;
87 1.1 cgd } else if (newx < win->_firstch[y])
88 1.1 cgd win->_firstch[y] = newx;
89 1.1 cgd else if (newx > win->_lastch[y])
90 1.1 cgd win->_lastch[y] = newx;
91 1.1 cgd # ifdef FULLDEBUG
92 1.1 cgd fprintf(outf, "ADDBYTES: change gives f/l: %d/%d [%d/%d]\n",
93 1.1 cgd win->_firstch[y], win->_lastch[y],
94 1.1 cgd win->_firstch[y] - win->_ch_off,
95 1.1 cgd win->_lastch[y] - win->_ch_off);
96 1.1 cgd # endif
97 1.1 cgd }
98 1.1 cgd }
99 1.1 cgd win->_y[y][x++] = c;
100 1.1 cgd if (x >= win->_maxx) {
101 1.1 cgd x = 0;
102 1.1 cgd newline:
103 1.1 cgd if (++y >= win->_maxy)
104 1.1 cgd if (win->_scroll) {
105 1.1 cgd SYNCH_OUT();
106 1.1 cgd scroll(win);
107 1.1 cgd SYNCH_IN();
108 1.1 cgd --y;
109 1.1 cgd }
110 1.1 cgd else
111 1.1 cgd return ERR;
112 1.1 cgd }
113 1.1 cgd # ifdef FULLDEBUG
114 1.1 cgd fprintf(outf, "ADDBYTES: 2: y = %d, x = %d, firstch = %d, lastch = %d\n", y, x, win->_firstch[y], win->_lastch[y]);
115 1.1 cgd # endif
116 1.1 cgd break;
117 1.1 cgd case '\n':
118 1.1 cgd SYNCH_OUT();
119 1.1 cgd wclrtoeol(win);
120 1.1 cgd SYNCH_IN();
121 1.1 cgd if (!NONL)
122 1.1 cgd x = 0;
123 1.1 cgd goto newline;
124 1.1 cgd case '\r':
125 1.1 cgd x = 0;
126 1.1 cgd break;
127 1.1 cgd case '\b':
128 1.1 cgd if (--x < 0)
129 1.1 cgd x = 0;
130 1.1 cgd break;
131 1.1 cgd }
132 1.1 cgd }
133 1.1 cgd SYNCH_OUT();
134 1.1 cgd return OK;
135 1.1 cgd }
136