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