Home | History | Annotate | Line # | Download | only in libcurses
tscroll.c revision 1.10
      1  1.10    wiz /*	$NetBSD: tscroll.c,v 1.10 2002/05/26 17:01:38 wiz Exp $	*/
      2   1.4  mikel 
      3   1.1    cgd /*-
      4   1.3    cgd  * Copyright (c) 1992, 1993, 1994
      5   1.1    cgd  *	The Regents of the University of California.  All rights reserved.
      6   1.1    cgd  *
      7   1.1    cgd  * Redistribution and use in source and binary forms, with or without
      8   1.1    cgd  * modification, are permitted provided that the following conditions
      9   1.1    cgd  * are met:
     10   1.1    cgd  * 1. Redistributions of source code must retain the above copyright
     11   1.1    cgd  *    notice, this list of conditions and the following disclaimer.
     12   1.1    cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1    cgd  *    notice, this list of conditions and the following disclaimer in the
     14   1.1    cgd  *    documentation and/or other materials provided with the distribution.
     15   1.1    cgd  * 3. All advertising materials mentioning features or use of this software
     16   1.1    cgd  *    must display the following acknowledgement:
     17   1.1    cgd  *	This product includes software developed by the University of
     18   1.1    cgd  *	California, Berkeley and its contributors.
     19   1.1    cgd  * 4. Neither the name of the University nor the names of its contributors
     20   1.1    cgd  *    may be used to endorse or promote products derived from this software
     21   1.1    cgd  *    without specific prior written permission.
     22   1.1    cgd  *
     23   1.1    cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24   1.1    cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25   1.1    cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26   1.1    cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27   1.1    cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28   1.1    cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29   1.1    cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30   1.1    cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31   1.1    cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32   1.1    cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33   1.1    cgd  * SUCH DAMAGE.
     34   1.1    cgd  */
     35   1.1    cgd 
     36   1.4  mikel #include <sys/cdefs.h>
     37   1.6    jdc #include <stdarg.h>
     38   1.6    jdc 
     39   1.1    cgd #ifndef lint
     40   1.4  mikel #if 0
     41   1.3    cgd static char sccsid[] = "@(#)tscroll.c	8.4 (Berkeley) 7/27/94";
     42   1.4  mikel #else
     43  1.10    wiz __RCSID("$NetBSD: tscroll.c,v 1.10 2002/05/26 17:01:38 wiz Exp $");
     44   1.4  mikel #endif
     45   1.5    mrg #endif				/* not lint */
     46   1.1    cgd 
     47   1.3    cgd #include "curses.h"
     48   1.6    jdc #include "curses_private.h"
     49   1.1    cgd 
     50   1.1    cgd #define	MAXRETURNSIZE	64
     51   1.1    cgd 
     52   1.6    jdc char   *
     53   1.7    jdc __tscroll(const char *cap, int n1, int n2)
     54   1.6    jdc {
     55   1.6    jdc 	return (__parse_cap(cap, n1, n2));
     56   1.6    jdc }
     57   1.6    jdc 
     58   1.1    cgd /*
     59   1.6    jdc  * Routines to parse capabilities.  Derived from tgoto.c in termcap(3)
     60   1.3    cgd  * library.  Cap is a string containing printf type escapes to allow
     61   1.3    cgd  * scrolling.  The following escapes are defined for substituting n:
     62   1.1    cgd  *
     63   1.1    cgd  *	%d	as in printf
     64   1.1    cgd  *	%2	like %2d
     65   1.1    cgd  *	%3	like %3d
     66   1.1    cgd  *	%.	gives %c hacking special case characters
     67   1.1    cgd  *	%+x	like %c but adding x first
     68   1.1    cgd  *
     69   1.1    cgd  *	The codes below affect the state but don't use up a value.
     70   1.1    cgd  *
     71   1.1    cgd  *	%>xy	if value > x add y
     72   1.1    cgd  *	%i	increments n
     73   1.1    cgd  *	%%	gives %
     74   1.1    cgd  *	%B	BCD (2 decimal digits encoded in one byte)
     75   1.1    cgd  *	%D	Delta Data (backwards bcd)
     76   1.1    cgd  *
     77   1.1    cgd  * all other characters are ``self-inserting''.
     78   1.6    jdc  *
     79   1.6    jdc  * XXX:
     80   1.6    jdc  *	%r	reverse order of two parameters
     81   1.6    jdc  * is also defined but we don't support it (yet).
     82   1.1    cgd  */
     83   1.6    jdc char	*
     84   1.6    jdc __parse_cap (char const *cap, ...)
     85   1.1    cgd {
     86   1.6    jdc 	va_list	ap;
     87   1.1    cgd 	static char result[MAXRETURNSIZE];
     88   1.5    mrg 	int     c, n;
     89   1.5    mrg 	char   *dp;
     90   1.6    jdc 	int	have_input;
     91   1.1    cgd 
     92   1.6    jdc 	va_start (ap, cap);
     93   1.9    jdc 	n = 0;			/* XXX gcc -Wuninitialized */
     94   1.9    jdc 
     95   1.3    cgd 	if (cap == NULL)
     96   1.3    cgd 		goto err;
     97   1.6    jdc #ifdef DEBUG
     98   1.9    jdc 	{
     99   1.9    jdc 		int	i;
    100   1.9    jdc 
    101   1.9    jdc 		__CTRACE("__parse_cap: cap = ");
    102   1.9    jdc 		for (i = 0; i < strlen(cap); i++)
    103   1.9    jdc 			__CTRACE("%s", unctrl(cap[i]));
    104   1.9    jdc 		__CTRACE("\n");
    105   1.9    jdc 	}
    106   1.6    jdc #endif
    107   1.6    jdc 	have_input = 0;
    108   1.6    jdc 	for (dp = result; (c = *cap++) != '\0';) {
    109   1.1    cgd 		if (c != '%') {
    110   1.1    cgd 			*dp++ = c;
    111   1.1    cgd 			continue;
    112   1.1    cgd 		}
    113   1.3    cgd 		switch (c = *cap++) {
    114   1.1    cgd 		case 'n':
    115   1.6    jdc 			if (!have_input) {
    116   1.6    jdc 				n = va_arg (ap, int);
    117   1.6    jdc 				have_input = 1;
    118   1.6    jdc #ifdef DEBUG
    119   1.6    jdc 				__CTRACE ("__parse_cap: %%n, val = %d\n", n);
    120   1.6    jdc #endif
    121   1.6    jdc 			}
    122   1.1    cgd 			n ^= 0140;
    123   1.1    cgd 			continue;
    124   1.1    cgd 		case 'd':
    125   1.6    jdc 			if (!have_input) {
    126   1.6    jdc 				n = va_arg (ap, int);
    127   1.6    jdc 				have_input = 1;
    128   1.6    jdc #ifdef DEBUG
    129   1.6    jdc 				__CTRACE ("__parse_cap: %%d, val = %d\n", n);
    130   1.6    jdc #endif
    131   1.6    jdc 			}
    132   1.1    cgd 			if (n < 10)
    133   1.1    cgd 				goto one;
    134   1.1    cgd 			if (n < 100)
    135   1.1    cgd 				goto two;
    136   1.3    cgd 			/* FALLTHROUGH */
    137   1.1    cgd 		case '3':
    138   1.6    jdc 			if (!have_input) {
    139   1.6    jdc 				n = va_arg (ap, int);
    140   1.6    jdc 				have_input = 1;
    141   1.6    jdc #ifdef DEBUG
    142   1.6    jdc 				__CTRACE ("__parse_cap: %%3, val = %d\n", n);
    143   1.6    jdc #endif
    144   1.6    jdc 			}
    145   1.1    cgd 			*dp++ = (n / 100) | '0';
    146   1.1    cgd 			n %= 100;
    147   1.3    cgd 			/* FALLTHROUGH */
    148   1.1    cgd 		case '2':
    149   1.6    jdc 			if (!have_input) {
    150   1.6    jdc 				n = va_arg (ap, int);
    151   1.6    jdc 				have_input = 1;
    152   1.6    jdc #ifdef DEBUG
    153   1.6    jdc 				__CTRACE ("__parse_cap: %%2, val = %d\n", n);
    154   1.6    jdc #endif
    155   1.6    jdc 			}
    156   1.5    mrg 	two:		*dp++ = n / 10 | '0';
    157   1.5    mrg 	one:		*dp++ = n % 10 | '0';
    158   1.6    jdc 			have_input = 0;
    159   1.1    cgd 			continue;
    160   1.1    cgd 		case '>':
    161   1.6    jdc 			if (!have_input) {
    162   1.6    jdc 				n = va_arg (ap, int);
    163   1.6    jdc 				have_input = 1;
    164   1.6    jdc #ifdef DEBUG
    165   1.6    jdc 				__CTRACE ("__parse_cap: %%>, val = %d\n", n);
    166   1.6    jdc #endif
    167   1.6    jdc 			}
    168   1.3    cgd 			if (n > *cap++)
    169   1.3    cgd 				n += *cap++;
    170   1.1    cgd 			else
    171   1.3    cgd 				cap++;
    172   1.1    cgd 			continue;
    173   1.1    cgd 		case '+':
    174   1.6    jdc 			if (!have_input) {
    175   1.6    jdc 				n = va_arg (ap, int);
    176   1.6    jdc 				have_input = 1;
    177   1.6    jdc #ifdef DEBUG
    178   1.6    jdc 				__CTRACE ("__parse_cap: %%+, val = %d\n", n);
    179   1.6    jdc #endif
    180   1.6    jdc 			}
    181   1.3    cgd 			n += *cap++;
    182   1.3    cgd 			/* FALLTHROUGH */
    183   1.1    cgd 		case '.':
    184   1.6    jdc 			if (!have_input) {
    185   1.6    jdc 				n = va_arg (ap, int);
    186   1.6    jdc 				have_input = 1;
    187   1.6    jdc #ifdef DEBUG
    188   1.6    jdc 				__CTRACE ("__parse_cap: %%., val = %d\n", n);
    189   1.6    jdc #endif
    190   1.6    jdc 			}
    191   1.1    cgd 			*dp++ = n;
    192   1.6    jdc 			have_input = 0;
    193   1.1    cgd 			continue;
    194   1.1    cgd 		case 'i':
    195   1.6    jdc 			if (!have_input) {
    196   1.6    jdc 				n = va_arg (ap, int);
    197   1.6    jdc 				have_input = 1;
    198   1.6    jdc #ifdef DEBUG
    199   1.6    jdc 				__CTRACE ("__parse_cap: %%i, val = %d\n", n);
    200   1.6    jdc #endif
    201   1.6    jdc 			}
    202   1.1    cgd 			n++;
    203   1.1    cgd 			continue;
    204   1.1    cgd 		case '%':
    205   1.1    cgd 			*dp++ = c;
    206   1.1    cgd 			continue;
    207   1.1    cgd 		case 'B':
    208   1.6    jdc 			if (!have_input) {
    209   1.6    jdc 				n = va_arg (ap, int);
    210   1.6    jdc 				have_input = 1;
    211   1.6    jdc #ifdef DEBUG
    212   1.6    jdc 				__CTRACE ("__parse_cap: %%B, val = %d\n", n);
    213   1.6    jdc #endif
    214   1.6    jdc 			}
    215   1.1    cgd 			n = (n / 10 << 4) + n % 10;
    216   1.1    cgd 			continue;
    217   1.1    cgd 		case 'D':
    218   1.6    jdc 			if (!have_input) {
    219   1.6    jdc 				n = va_arg (ap, int);
    220   1.6    jdc 				have_input = 1;
    221   1.6    jdc #ifdef DEBUG
    222   1.6    jdc 				__CTRACE ("__parse_cap: %%D, val = %d\n", n);
    223   1.6    jdc #endif
    224   1.6    jdc 			}
    225   1.1    cgd 			n = n - 2 * (n % 16);
    226   1.1    cgd 			continue;
    227   1.5    mrg 			/*
    228   1.5    mrg 			 * XXX
    229   1.5    mrg 			 * System V terminfo files have lots of extra gunk.
    230   1.6    jdc 			 * The only other one we've seen in capability strings
    231   1.6    jdc 			 * is %pN, and it seems to work okay if we ignore it.
    232   1.5    mrg 			 */
    233   1.3    cgd 		case 'p':
    234   1.3    cgd 			++cap;
    235   1.3    cgd 			continue;
    236   1.1    cgd 		default:
    237   1.3    cgd 			goto err;
    238   1.1    cgd 		}
    239   1.1    cgd 	}
    240   1.1    cgd 	*dp = '\0';
    241   1.6    jdc 	va_end (ap);
    242   1.1    cgd 	return (result);
    243   1.3    cgd 
    244   1.6    jdc err:	va_end (ap);
    245   1.8  blymn 	return ((char *) "\0");
    246   1.1    cgd }
    247