123 lines
3.6 KiB
C
123 lines
3.6 KiB
C
/*
|
|
* Copyright (c) 1980, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef lint
|
|
static char sccsid[] = "@(#)tputs.c 8.1 (Berkeley) 6/4/93";
|
|
#endif /* not lint */
|
|
|
|
#include <ctype.h>
|
|
#include "termcap.h"
|
|
|
|
/*
|
|
* The following array gives the number of tens of milliseconds per
|
|
* character for each speed as returned by gtty. Thus since 300
|
|
* baud returns a 7, there are 33.3 milliseconds per char at 300 baud.
|
|
*/
|
|
static
|
|
short tmspc10[] = {
|
|
0, 2000, 1333, 909, 743, 666, 500, 333, 166, 83, 55, 41, 20, 10, 5,
|
|
3, 2, 1
|
|
};
|
|
|
|
short ospeed;
|
|
char PC;
|
|
|
|
/*
|
|
* Put the character string cp out, with padding.
|
|
* The number of affected lines is affcnt, and the routine
|
|
* used to output one character is outc.
|
|
*/
|
|
void
|
|
tputs(const char *cp, int affcnt, int (*outc)(int))
|
|
{
|
|
register int i = 0;
|
|
register int mspc10;
|
|
|
|
if (cp == 0)
|
|
return;
|
|
|
|
/*
|
|
* Convert the number representing the delay.
|
|
*/
|
|
if (isdigit(*cp)) {
|
|
do
|
|
i = i * 10 + *cp++ - '0';
|
|
while (isdigit(*cp));
|
|
}
|
|
i *= 10;
|
|
if (*cp == '.') {
|
|
cp++;
|
|
if (isdigit(*cp))
|
|
i += *cp - '0';
|
|
/*
|
|
* Only one digit to the right of the decimal point.
|
|
*/
|
|
while (isdigit(*cp))
|
|
cp++;
|
|
}
|
|
|
|
/*
|
|
* If the delay is followed by a `*', then
|
|
* multiply by the affected lines count.
|
|
*/
|
|
if (*cp == '*')
|
|
cp++, i *= affcnt;
|
|
|
|
/*
|
|
* The guts of the string.
|
|
*/
|
|
while (*cp)
|
|
(*outc)(*cp++);
|
|
|
|
/*
|
|
* If no delay needed, or output speed is
|
|
* not comprehensible, then don't try to delay.
|
|
*/
|
|
if (i == 0)
|
|
return;
|
|
if (ospeed <= 0 || ospeed >= (sizeof tmspc10 / sizeof tmspc10[0]))
|
|
return;
|
|
|
|
/*
|
|
* Round up by a half a character frame,
|
|
* and then do the delay.
|
|
* Too bad there are no user program accessible programmed delays.
|
|
* Transmitting pad characters slows many
|
|
* terminals down and also loads the system.
|
|
*/
|
|
mspc10 = tmspc10[ospeed];
|
|
i += mspc10 / 2;
|
|
for (i /= mspc10; i > 0; i--)
|
|
(*outc)(PC);
|
|
}
|