usr.bin/window/tttermcap.c

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