Home | History | Annotate | Line # | Download | only in libcurses
tscroll.c revision 1.6
      1  1.6    jdc /*	$NetBSD: tscroll.c,v 1.6 2000/04/12 21:37:15 jdc 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.6    jdc __RCSID("$NetBSD: tscroll.c,v 1.6 2000/04/12 21:37:15 jdc 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.6    jdc __tscroll(cap, n1, n2)
     54  1.6    jdc 	const char *cap;
     55  1.6    jdc 	int     n1, n2;
     56  1.6    jdc {
     57  1.6    jdc 	return (__parse_cap(cap, n1, n2));
     58  1.6    jdc }
     59  1.6    jdc 
     60  1.1    cgd /*
     61  1.6    jdc  * Routines to parse capabilities.  Derived from tgoto.c in termcap(3)
     62  1.3    cgd  * library.  Cap is a string containing printf type escapes to allow
     63  1.3    cgd  * scrolling.  The following escapes are defined for substituting n:
     64  1.1    cgd  *
     65  1.1    cgd  *	%d	as in printf
     66  1.1    cgd  *	%2	like %2d
     67  1.1    cgd  *	%3	like %3d
     68  1.1    cgd  *	%.	gives %c hacking special case characters
     69  1.1    cgd  *	%+x	like %c but adding x first
     70  1.1    cgd  *
     71  1.1    cgd  *	The codes below affect the state but don't use up a value.
     72  1.1    cgd  *
     73  1.1    cgd  *	%>xy	if value > x add y
     74  1.1    cgd  *	%i	increments n
     75  1.1    cgd  *	%%	gives %
     76  1.1    cgd  *	%B	BCD (2 decimal digits encoded in one byte)
     77  1.1    cgd  *	%D	Delta Data (backwards bcd)
     78  1.1    cgd  *
     79  1.1    cgd  * all other characters are ``self-inserting''.
     80  1.6    jdc  *
     81  1.6    jdc  * XXX:
     82  1.6    jdc  *	%r	reverse order of two parameters
     83  1.6    jdc  * is also defined but we don't support it (yet).
     84  1.1    cgd  */
     85  1.6    jdc char	*
     86  1.6    jdc #if __STDC__
     87  1.6    jdc __parse_cap (char const *cap, ...)
     88  1.6    jdc #else
     89  1.6    jdc __parse_cap (cap, va_alist)
     90  1.6    jdc 	const char	*cap;
     91  1.6    jdc 	va_dcl
     92  1.6    jdc #endif
     93  1.1    cgd {
     94  1.6    jdc 	va_list	ap;
     95  1.1    cgd 	static char result[MAXRETURNSIZE];
     96  1.5    mrg 	int     c, n;
     97  1.5    mrg 	char   *dp;
     98  1.6    jdc 	int	have_input;
     99  1.1    cgd 
    100  1.6    jdc #if __STDC__
    101  1.6    jdc 	va_start (ap, cap);
    102  1.6    jdc #else
    103  1.6    jdc 	va_start(ap);
    104  1.6    jdc #endif
    105  1.3    cgd 	if (cap == NULL)
    106  1.3    cgd 		goto err;
    107  1.6    jdc #ifdef DEBUG
    108  1.6    jdc 	__CTRACE ("__parse_cap: cap = %s\n", cap);
    109  1.6    jdc #endif
    110  1.6    jdc 	have_input = 0;
    111  1.6    jdc 	for (dp = result; (c = *cap++) != '\0';) {
    112  1.1    cgd 		if (c != '%') {
    113  1.1    cgd 			*dp++ = c;
    114  1.1    cgd 			continue;
    115  1.1    cgd 		}
    116  1.3    cgd 		switch (c = *cap++) {
    117  1.1    cgd 		case 'n':
    118  1.6    jdc 			if (!have_input) {
    119  1.6    jdc 				n = va_arg (ap, int);
    120  1.6    jdc 				have_input = 1;
    121  1.6    jdc #ifdef DEBUG
    122  1.6    jdc 				__CTRACE ("__parse_cap: %%n, val = %d\n", n);
    123  1.6    jdc #endif
    124  1.6    jdc 			}
    125  1.1    cgd 			n ^= 0140;
    126  1.1    cgd 			continue;
    127  1.1    cgd 		case 'd':
    128  1.6    jdc 			if (!have_input) {
    129  1.6    jdc 				n = va_arg (ap, int);
    130  1.6    jdc 				have_input = 1;
    131  1.6    jdc #ifdef DEBUG
    132  1.6    jdc 				__CTRACE ("__parse_cap: %%d, val = %d\n", n);
    133  1.6    jdc #endif
    134  1.6    jdc 			}
    135  1.1    cgd 			if (n < 10)
    136  1.1    cgd 				goto one;
    137  1.1    cgd 			if (n < 100)
    138  1.1    cgd 				goto two;
    139  1.3    cgd 			/* FALLTHROUGH */
    140  1.1    cgd 		case '3':
    141  1.6    jdc 			if (!have_input) {
    142  1.6    jdc 				n = va_arg (ap, int);
    143  1.6    jdc 				have_input = 1;
    144  1.6    jdc #ifdef DEBUG
    145  1.6    jdc 				__CTRACE ("__parse_cap: %%3, val = %d\n", n);
    146  1.6    jdc #endif
    147  1.6    jdc 			}
    148  1.1    cgd 			*dp++ = (n / 100) | '0';
    149  1.1    cgd 			n %= 100;
    150  1.3    cgd 			/* FALLTHROUGH */
    151  1.1    cgd 		case '2':
    152  1.6    jdc 			if (!have_input) {
    153  1.6    jdc 				n = va_arg (ap, int);
    154  1.6    jdc 				have_input = 1;
    155  1.6    jdc #ifdef DEBUG
    156  1.6    jdc 				__CTRACE ("__parse_cap: %%2, val = %d\n", n);
    157  1.6    jdc #endif
    158  1.6    jdc 			}
    159  1.5    mrg 	two:		*dp++ = n / 10 | '0';
    160  1.5    mrg 	one:		*dp++ = n % 10 | '0';
    161  1.6    jdc 			have_input = 0;
    162  1.1    cgd 			continue;
    163  1.1    cgd 		case '>':
    164  1.6    jdc 			if (!have_input) {
    165  1.6    jdc 				n = va_arg (ap, int);
    166  1.6    jdc 				have_input = 1;
    167  1.6    jdc #ifdef DEBUG
    168  1.6    jdc 				__CTRACE ("__parse_cap: %%>, val = %d\n", n);
    169  1.6    jdc #endif
    170  1.6    jdc 			}
    171  1.3    cgd 			if (n > *cap++)
    172  1.3    cgd 				n += *cap++;
    173  1.1    cgd 			else
    174  1.3    cgd 				cap++;
    175  1.1    cgd 			continue;
    176  1.1    cgd 		case '+':
    177  1.6    jdc 			if (!have_input) {
    178  1.6    jdc 				n = va_arg (ap, int);
    179  1.6    jdc 				have_input = 1;
    180  1.6    jdc #ifdef DEBUG
    181  1.6    jdc 				__CTRACE ("__parse_cap: %%+, val = %d\n", n);
    182  1.6    jdc #endif
    183  1.6    jdc 			}
    184  1.3    cgd 			n += *cap++;
    185  1.3    cgd 			/* FALLTHROUGH */
    186  1.1    cgd 		case '.':
    187  1.6    jdc 			if (!have_input) {
    188  1.6    jdc 				n = va_arg (ap, int);
    189  1.6    jdc 				have_input = 1;
    190  1.6    jdc #ifdef DEBUG
    191  1.6    jdc 				__CTRACE ("__parse_cap: %%., val = %d\n", n);
    192  1.6    jdc #endif
    193  1.6    jdc 			}
    194  1.1    cgd 			*dp++ = n;
    195  1.6    jdc 			have_input = 0;
    196  1.1    cgd 			continue;
    197  1.1    cgd 		case 'i':
    198  1.6    jdc 			if (!have_input) {
    199  1.6    jdc 				n = va_arg (ap, int);
    200  1.6    jdc 				have_input = 1;
    201  1.6    jdc #ifdef DEBUG
    202  1.6    jdc 				__CTRACE ("__parse_cap: %%i, val = %d\n", n);
    203  1.6    jdc #endif
    204  1.6    jdc 			}
    205  1.1    cgd 			n++;
    206  1.1    cgd 			continue;
    207  1.1    cgd 		case '%':
    208  1.1    cgd 			*dp++ = c;
    209  1.1    cgd 			continue;
    210  1.1    cgd 		case 'B':
    211  1.6    jdc 			if (!have_input) {
    212  1.6    jdc 				n = va_arg (ap, int);
    213  1.6    jdc 				have_input = 1;
    214  1.6    jdc #ifdef DEBUG
    215  1.6    jdc 				__CTRACE ("__parse_cap: %%B, val = %d\n", n);
    216  1.6    jdc #endif
    217  1.6    jdc 			}
    218  1.1    cgd 			n = (n / 10 << 4) + n % 10;
    219  1.1    cgd 			continue;
    220  1.1    cgd 		case 'D':
    221  1.6    jdc 			if (!have_input) {
    222  1.6    jdc 				n = va_arg (ap, int);
    223  1.6    jdc 				have_input = 1;
    224  1.6    jdc #ifdef DEBUG
    225  1.6    jdc 				__CTRACE ("__parse_cap: %%D, val = %d\n", n);
    226  1.6    jdc #endif
    227  1.6    jdc 			}
    228  1.1    cgd 			n = n - 2 * (n % 16);
    229  1.1    cgd 			continue;
    230  1.5    mrg 			/*
    231  1.5    mrg 			 * XXX
    232  1.5    mrg 			 * System V terminfo files have lots of extra gunk.
    233  1.6    jdc 			 * The only other one we've seen in capability strings
    234  1.6    jdc 			 * is %pN, and it seems to work okay if we ignore it.
    235  1.5    mrg 			 */
    236  1.3    cgd 		case 'p':
    237  1.3    cgd 			++cap;
    238  1.3    cgd 			continue;
    239  1.1    cgd 		default:
    240  1.3    cgd 			goto err;
    241  1.1    cgd 		}
    242  1.1    cgd 	}
    243  1.1    cgd 	*dp = '\0';
    244  1.6    jdc 	va_end (ap);
    245  1.1    cgd 	return (result);
    246  1.3    cgd 
    247  1.6    jdc err:	va_end (ap);
    248  1.6    jdc 	return ("\0");
    249  1.1    cgd }
    250