usr.bin/window/tttermcap.c

   1 /*
   2  * Copyright (c) 1983, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * Edward Wang at The University of California, Berkeley.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  11  * 1. Redistributions of source code must retain the above copyright
  12  *    notice, this list of conditions and the following disclaimer.
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in the
  15  *    documentation and/or other materials provided with the distribution.
  16  * 3. All advertising materials mentioning features or use of this software
  17  *    must display the following acknowledgement:
  18  *      This product includes software developed by the University of
  19  *      California, Berkeley and its contributors.
  20  * 4. Neither the name of the University nor the names of its contributors
  21  *    may be used to endorse or promote products derived from this software
  22  *    without specific prior written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34  * SUCH DAMAGE.
  35  *
  36  * @(#)tttermcap.c      8.1 (Berkeley) 6/6/93
  37  * $FreeBSD: src/usr.bin/window/tttermcap.c,v 1.1.1.1.14.1 2001/05/17 09:45:01 obrien Exp $
  38  * $DragonFly: src/usr.bin/window/tttermcap.c,v 1.3 2005/02/28 13:57:05 joerg Exp $
  39  */
  40
  41 #include "tt.h"
  42
  43 char *tgetstr();
  44 char *tgoto();
  45
  46 tttputc(c)
  47 {
  48         ttputc(c);
  49 }
  50
  51 ttxputc(c)
  52 {
  53         *tt_strp++ = c;
  54 }
  55
  56 struct tt_str *
  57 tttgetstr(str)
  58         char *str;
  59 {
  60         register struct tt_str *s;
  61
  62         if ((str = tgetstr(str, &tt_strp)) == 0)
  63                 return 0;
  64         if ((s = (struct tt_str *) malloc(sizeof *s)) == 0)
  65                 return 0;
  66         s->ts_str = str;
  67         s->ts_n = tt_strp - s->ts_str - 1;
  68         return s;
  69 }
  70
  71 struct tt_str *
  72 ttxgetstr(str)
  73         char *str;
  74 {
  75         register struct tt_str *s;
  76         char buf[100];
  77         char *bufp = buf;
  78
  79         if (tgetstr(str, &bufp) == 0)
  80                 return 0;
  81         if ((s = (struct tt_str *) malloc(sizeof *s)) == 0)
  82                 return 0;
  83         s->ts_str = tt_strp;
  84         tputs(buf, 1, ttxputc);
  85         s->ts_n = tt_strp - s->ts_str;
  86         *tt_strp++ = 0;
  87         return s;
  88 }
  89
  90 tttgoto(s, col, row)
  91         struct tt_str *s;
  92 {
  93         register char *p = s->ts_str;
  94
  95         ttputs(tgoto(p, col, row));
  96         for (p += s->ts_n; *--p == 0;)
  97                 ttputc(0);
  98 }
  99
 100 ttpgoto(s, col, row, n)
 101         struct tt_str *s;
 102 {
 103
 104         tputs(tgoto(s->ts_str, col, row), n, tttputc);
 105 }
 106
 107 ttstrcmp(a, b)
 108         register struct tt_str *a, *b;
 109 {
 110         int n, r;
 111
 112         if (r = bcmp(a->ts_str, b->ts_str,
 113                         (n = a->ts_n - b->ts_n) < 0 ? a->ts_n : b->ts_n))
 114                 return r;
 115         return n;
 116 }