]> git.saurik.com Git - apple/shell_cmds.git/blame - window/ttoutput.c
shell_cmds-34.tar.gz
[apple/shell_cmds.git] / window / ttoutput.c
CommitLineData
44bd5ea7
A
1/* $NetBSD: ttoutput.c,v 1.4 1997/11/21 08:36:34 lukem Exp $ */
2
3/*
4 * Copyright (c) 1983, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Edward Wang at The University of California, Berkeley.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 */
38
39#include <sys/cdefs.h>
40#ifndef lint
41#if 0
42static char sccsid[] = "@(#)ttoutput.c 8.1 (Berkeley) 6/6/93";
43#else
44__RCSID("$NetBSD: ttoutput.c,v 1.4 1997/11/21 08:36:34 lukem Exp $");
45#endif
46#endif /* not lint */
47
48#include <errno.h>
49#include <string.h>
50#include <unistd.h>
51#include "ww.h"
52#include "tt.h"
53
54/*
55 * Buffered output package.
56 * We need this because stdio fails on non-blocking writes.
57 */
58
59void
60ttflush()
61{
62 char *p;
63 int n = tt_obp - tt_ob;
64
65 if (n == 0)
66 return;
67 if (tt.tt_checksum)
68 (*tt.tt_checksum)(tt_ob, n);
69 if (tt.tt_flush) {
70 (*tt.tt_flush)();
71 return;
72 }
73 wwnflush++;
74 for (p = tt_ob; p < tt_obp;) {
75 wwnwr++;
76 n = write(1, p, tt_obp - p);
77 if (n < 0) {
78 wwnwre++;
79 if (errno != EWOULDBLOCK) {
80 /* can't deal with this */
81 p = tt_obp;
82 }
83 } else if (n == 0) {
84 /* what to do? */
85 wwnwrz++;
86 } else {
87 wwnwrc += n;
88 p += n;
89 }
90 }
91 tt_obp = tt_ob;
92}
93
94void
95ttputs(s)
96 char *s;
97{
98 while (*s)
99 ttputc(*s++);
100}
101
102void
103ttwrite(s, n)
104 char *s;
105 int n;
106{
107 switch (n) {
108 case 0:
109 break;
110 case 1:
111 ttputc(*s);
112 break;
113 case 2:
114 if (tt_obe - tt_obp < 2)
115 ttflush();
116 *tt_obp++ = *s++;
117 *tt_obp++ = *s;
118 break;
119 case 3:
120 if (tt_obe - tt_obp < 3)
121 ttflush();
122 *tt_obp++ = *s++;
123 *tt_obp++ = *s++;
124 *tt_obp++ = *s;
125 break;
126 case 4:
127 if (tt_obe - tt_obp < 4)
128 ttflush();
129 *tt_obp++ = *s++;
130 *tt_obp++ = *s++;
131 *tt_obp++ = *s++;
132 *tt_obp++ = *s;
133 break;
134 case 5:
135 if (tt_obe - tt_obp < 5)
136 ttflush();
137 *tt_obp++ = *s++;
138 *tt_obp++ = *s++;
139 *tt_obp++ = *s++;
140 *tt_obp++ = *s++;
141 *tt_obp++ = *s;
142 break;
143 default:
144 while (n > 0) {
145 int m;
146
147 while ((m = tt_obe - tt_obp) == 0)
148 ttflush();
149 if ((m = tt_obe - tt_obp) > n)
150 m = n;
151 memmove(tt_obp, s, m);
152 tt_obp += m;
153 s += m;
154 n -= m;
155 }
156 }
157}