ncursesw-morphos/ncurses/tinfo/lib_baudrate.c
Thomas E. Dickey c633e5103a ncurses 5.2
2000-10-21 00:42:11 -04:00

179 lines
4.7 KiB
C

/****************************************************************************
* Copyright (c) 1998 Free Software Foundation, Inc. *
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
/****************************************************************************
* Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
* and: Eric S. Raymond <esr@snark.thyrsus.com> *
****************************************************************************/
/*
* lib_baudrate.c
*
*/
#include <curses.priv.h>
#include <term.h> /* cur_term, pad_char */
#include <termcap.h> /* ospeed */
MODULE_ID("$Id: lib_baudrate.c,v 1.17 2000/10/08 00:59:08 tom Exp $")
/*
* int
* baudrate()
*
* Returns the current terminal's baud rate.
*
*/
struct speed {
int s; /* value for 'ospeed' is an index */
int sp; /* the actual speed */
};
static struct speed const speeds[] =
{
{B0, 0},
{B50, 50},
{B75, 75},
{B110, 110},
{B134, 134},
{B150, 150},
{B200, 200},
{B300, 300},
{B600, 600},
{B1200, 1200},
{B1800, 1800},
{B2400, 2400},
{B4800, 4800},
{B9600, 9600},
#ifdef B19200
{B19200, 19200},
#else
#ifdef EXTA
{EXTA, 19200},
#endif
#endif
#ifdef B38400
{B38400, 38400},
#else
#ifdef EXTB
{EXTB, 38400},
#endif
#endif
#ifdef B57600
{B57600, 57600},
#endif
#ifdef B115200
{B115200, 115200},
#endif
#ifdef B230400
{B230400, 230400},
#endif
#ifdef B460800
{B460800, 460800},
#endif
};
int
_nc_baudrate(int OSpeed)
{
static int last_OSpeed;
static int last_baudrate;
int result;
unsigned i;
if (OSpeed == last_OSpeed) {
result = last_baudrate;
} else {
result = ERR;
if (OSpeed >= 0) {
for (i = 0; i < SIZEOF(speeds); i++) {
if (speeds[i].s == OSpeed) {
result = speeds[i].sp;
break;
}
}
}
last_baudrate = result;
}
return (result);
}
int
_nc_ospeed(int BaudRate)
{
int result = 1;
unsigned i;
if (BaudRate >= 0) {
for (i = 0; i < SIZEOF(speeds); i++) {
if (speeds[i].sp == BaudRate) {
result = speeds[i].s;
break;
}
}
}
return (result);
}
int
baudrate(void)
{
int result;
T((T_CALLED("baudrate()")));
/*
* In debugging, allow the environment symbol to override when we're
* redirecting to a file, so we can construct repeatable test-cases
* that take into account costs that depend on baudrate.
*/
#ifdef TRACE
if (SP && !isatty(fileno(SP->_ofp))
&& getenv("BAUDRATE") != 0) {
int ret;
if ((ret = _nc_getenv_num("BAUDRATE")) <= 0)
ret = 9600;
ospeed = _nc_ospeed(ret);
returnCode(ret);
} else
#endif
#ifdef TERMIOS
ospeed = cfgetospeed(&cur_term->Nttyb);
#else
ospeed = cur_term->Nttyb.sg_ospeed;
#endif
result = _nc_baudrate(ospeed);
if (cur_term != 0)
cur_term->_baudrate = result;
returnCode(result);
}