1993-04-09 16:58:42 +04:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1983 Regents of the University of California.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Edward Wang at The University of California, Berkeley.
|
|
|
|
*
|
|
|
|
* 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
|
1993-08-01 21:54:45 +04:00
|
|
|
/*static char sccsid[] = "from: @(#)tttermcap.c 3.12 (Berkeley) 6/6/90";*/
|
|
|
|
static char rcsid[] = "$Id: tttermcap.c,v 1.2 1993/08/01 18:02:05 mycroft Exp $";
|
1993-04-09 16:58:42 +04:00
|
|
|
#endif /* not lint */
|
|
|
|
|
|
|
|
#include "tt.h"
|
|
|
|
|
|
|
|
char *tgetstr();
|
|
|
|
char *tgoto();
|
|
|
|
char *malloc();
|
|
|
|
|
|
|
|
tttputc(c)
|
|
|
|
{
|
|
|
|
ttputc(c);
|
|
|
|
}
|
|
|
|
|
|
|
|
ttxputc(c)
|
|
|
|
{
|
|
|
|
*tt_strp++ = c;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct tt_str *
|
|
|
|
tttgetstr(str)
|
|
|
|
char *str;
|
|
|
|
{
|
|
|
|
register struct tt_str *s;
|
|
|
|
|
|
|
|
if ((str = tgetstr(str, &tt_strp)) == 0)
|
|
|
|
return 0;
|
|
|
|
if ((s = (struct tt_str *) malloc(sizeof *s)) == 0)
|
|
|
|
return 0;
|
|
|
|
s->ts_str = str;
|
|
|
|
s->ts_n = tt_strp - s->ts_str - 1;
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct tt_str *
|
|
|
|
ttxgetstr(str)
|
|
|
|
char *str;
|
|
|
|
{
|
|
|
|
register struct tt_str *s;
|
|
|
|
char buf[100];
|
|
|
|
char *bufp = buf;
|
|
|
|
|
|
|
|
if (tgetstr(str, &bufp) == 0)
|
|
|
|
return 0;
|
|
|
|
if ((s = (struct tt_str *) malloc(sizeof *s)) == 0)
|
|
|
|
return 0;
|
|
|
|
s->ts_str = tt_strp;
|
|
|
|
tputs(buf, 1, ttxputc);
|
|
|
|
s->ts_n = tt_strp - s->ts_str;
|
|
|
|
*tt_strp++ = 0;
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
tttgoto(s, col, row)
|
|
|
|
struct tt_str *s;
|
|
|
|
{
|
|
|
|
register char *p = s->ts_str;
|
|
|
|
|
|
|
|
ttputs(tgoto(p, col, row));
|
|
|
|
for (p += s->ts_n; *--p == 0;)
|
|
|
|
ttputc(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
ttpgoto(s, col, row, n)
|
|
|
|
struct tt_str *s;
|
|
|
|
{
|
|
|
|
|
|
|
|
tputs(tgoto(s->ts_str, col, row), n, tttputc);
|
|
|
|
}
|
|
|
|
|
|
|
|
ttstrcmp(a, b)
|
|
|
|
register struct tt_str *a, *b;
|
|
|
|
{
|
|
|
|
int n, r;
|
|
|
|
|
|
|
|
if (r = bcmp(a->ts_str, b->ts_str,
|
|
|
|
(n = a->ts_n - b->ts_n) < 0 ? a->ts_n : b->ts_n))
|
|
|
|
return r;
|
|
|
|
return n;
|
|
|
|
}
|