123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239 |
- /****************************************************************************
- * Copyright 2018-2021,2022 Thomas E. Dickey *
- * Copyright 1998-2015,2017 Free Software Foundation, Inc. *
- * *
- * Permission is hereby granted, free of charge, to any person obtaining a *
- * copy of this software and associated documentation files (the *
- * "Software"), to deal in the Software without restriction, including *
- * without limitation the rights to use, copy, modify, merge, publish, *
- * distribute, distribute with modifications, sublicense, and/or sell *
- * copies of the Software, and to permit persons to whom the Software is *
- * furnished to do so, subject to the following conditions: *
- * *
- * The above copyright notice and this permission notice shall be included *
- * in all copies or substantial portions of the Software. *
- * *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
- * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
- * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
- * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
- * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
- * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
- * *
- * Except as contained in this notice, the name(s) of the above copyright *
- * holders shall not be used in advertising or otherwise to promote the *
- * sale, use or other dealings in this Software without prior written *
- * authorization. *
- ****************************************************************************/
- /****************************************************************************
- * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
- * and: Eric S. Raymond <esr@snark.thyrsus.com> *
- * and: Thomas E. Dickey 1998-on *
- ****************************************************************************/
- /* $Id: term_entry.h,v 1.63 2022/09/24 15:04:59 tom Exp $ */
- /*
- * term_entry.h -- interface to entry-manipulation code
- */
- #ifndef NCURSES_TERM_ENTRY_H_incl
- #define NCURSES_TERM_ENTRY_H_incl 1
- /* *INDENT-OFF* */
- #ifdef __cplusplus
- extern "C" {
- #endif
- #include <ncursesw/curses.h>
- #include <ncursesw/term.h>
- /*
- * These macros may be used by programs that know about TERMTYPE:
- */
- #if NCURSES_XNAMES
- #define NUM_BOOLEANS(tp) (tp)->num_Booleans
- #define NUM_NUMBERS(tp) (tp)->num_Numbers
- #define NUM_STRINGS(tp) (tp)->num_Strings
- #define EXT_NAMES(tp,i,limit,index,table) (i >= limit) ? tp->ext_Names[index] : table[i]
- #else
- #define NUM_BOOLEANS(tp) BOOLCOUNT
- #define NUM_NUMBERS(tp) NUMCOUNT
- #define NUM_STRINGS(tp) STRCOUNT
- #define EXT_NAMES(tp,i,limit,index,table) table[i]
- #endif
- #define NUM_EXT_NAMES(tp) (unsigned) ((tp)->ext_Booleans + (tp)->ext_Numbers + (tp)->ext_Strings)
- #define for_each_boolean(n,tp) for(n = 0; n < NUM_BOOLEANS(tp); n++)
- #define for_each_number(n,tp) for(n = 0; n < NUM_NUMBERS(tp); n++)
- #define for_each_string(n,tp) for(n = 0; n < NUM_STRINGS(tp); n++)
- #if NCURSES_XNAMES
- #define for_each_ext_boolean(n,tp) for(n = BOOLCOUNT; (int) n < (int) NUM_BOOLEANS(tp); n++)
- #define for_each_ext_number(n,tp) for(n = NUMCOUNT; (int) n < (int) NUM_NUMBERS(tp); n++)
- #define for_each_ext_string(n,tp) for(n = STRCOUNT; (int) n < (int) NUM_STRINGS(tp); n++)
- #endif
- #define ExtBoolname(tp,i,names) EXT_NAMES(tp, i, BOOLCOUNT, (i - (tp->num_Booleans - tp->ext_Booleans)), names)
- #define ExtNumname(tp,i,names) EXT_NAMES(tp, i, NUMCOUNT, (i - (tp->num_Numbers - tp->ext_Numbers)) + tp->ext_Booleans, names)
- #define ExtStrname(tp,i,names) EXT_NAMES(tp, i, STRCOUNT, (i - (tp->num_Strings - tp->ext_Strings)) + (tp->ext_Numbers + tp->ext_Booleans), names)
- /*
- * The remaining type-definitions and macros are used only internally by the
- * ncurses utilities.
- */
- #ifdef NCURSES_INTERNALS
- /*
- * see db_iterator.c - this enumeration lists the places searched for a
- * terminal description and defines the order in which they are searched.
- */
- typedef enum {
- dbdTIC = 0, /* special, used by tic when writing entry */
- #if NCURSES_USE_DATABASE
- dbdEnvOnce, /* the $TERMINFO environment variable */
- dbdHome, /* $HOME/.terminfo */
- dbdEnvList, /* the $TERMINFO_DIRS environment variable */
- dbdCfgList, /* the compiled-in TERMINFO_DIRS value */
- dbdCfgOnce, /* the compiled-in TERMINFO value */
- #endif
- #if NCURSES_USE_TERMCAP
- dbdEnvOnce2, /* the $TERMCAP environment variable */
- dbdEnvList2, /* the $TERMPATH environment variable */
- dbdCfgList2, /* the compiled-in TERMPATH */
- #endif
- dbdLAST
- } DBDIRS;
- #define MAX_USES 32
- #define MAX_CROSSLINKS 16
- typedef struct entry ENTRY;
- typedef struct {
- char *name;
- ENTRY *link;
- long line;
- } ENTRY_USES;
- struct entry {
- TERMTYPE2 tterm;
- unsigned nuses;
- ENTRY_USES uses[MAX_USES];
- int ncrosslinks;
- ENTRY *crosslinks[MAX_CROSSLINKS];
- long cstart;
- long cend;
- long startline;
- ENTRY *next;
- ENTRY *last;
- };
- extern NCURSES_EXPORT_VAR(ENTRY *) _nc_head;
- extern NCURSES_EXPORT_VAR(ENTRY *) _nc_tail;
- #define for_entry_list(qp) for (qp = _nc_head; qp; qp = qp->next)
- #define for_entry_list2(qp,q0) for (qp = q0; qp; qp = qp->next)
- #define MAX_LINE 132
- #define NULLHOOK (bool(*)(ENTRY *))0
- /*
- * Note that WANTED and PRESENT are not simple inverses! If a capability
- * has been explicitly cancelled, it is not considered WANTED.
- */
- #define WANTED(s) ((s) == ABSENT_STRING)
- #define PRESENT(s) (((s) != ABSENT_STRING) && ((s) != CANCELLED_STRING))
- #define ANDMISSING(p,q) \
- { \
- if (PRESENT(p) && !PRESENT(q)) \
- _nc_warning(#p " but no " #q); \
- }
- #define PAIRED(p,q) \
- { \
- if (PRESENT(q) && !PRESENT(p)) \
- _nc_warning(#q " but no " #p); \
- if (PRESENT(p) && !PRESENT(q)) \
- _nc_warning(#p " but no " #q); \
- }
- /*
- * These entrypoints are used only by the ncurses utilities such as tic.
- */
- /* alloc_entry.c: elementary allocation code */
- extern NCURSES_EXPORT(ENTRY *) _nc_copy_entry (ENTRY *oldp);
- extern NCURSES_EXPORT(char *) _nc_save_str (const char *const);
- extern NCURSES_EXPORT(void) _nc_init_entry (ENTRY *const);
- extern NCURSES_EXPORT(void) _nc_merge_entry (ENTRY *const, ENTRY *const);
- extern NCURSES_EXPORT(void) _nc_wrap_entry (ENTRY *const, bool);
- /* alloc_ttype.c: elementary allocation code */
- extern NCURSES_EXPORT(void) _nc_align_termtype (TERMTYPE2 *, TERMTYPE2 *);
- /* free_ttype.c: elementary allocation code */
- extern NCURSES_EXPORT(void) _nc_free_termtype1 (TERMTYPE *);
- extern NCURSES_EXPORT(void) _nc_free_termtype2 (TERMTYPE2 *);
- /* lib_termcap.c: trim sgr0 string for termcap users */
- extern NCURSES_EXPORT(char *) _nc_trim_sgr0 (TERMTYPE2 *);
- /* parse_entry.c: entry-parsing code */
- #if NCURSES_XNAMES
- extern NCURSES_EXPORT_VAR(bool) _nc_user_definable;
- extern NCURSES_EXPORT_VAR(bool) _nc_disable_period;
- #endif
- extern NCURSES_EXPORT(int) _nc_parse_entry (ENTRY *, int, bool);
- extern NCURSES_EXPORT(int) _nc_capcmp (const char *, const char *);
- /* write_entry.c: writing an entry to the file system */
- extern NCURSES_EXPORT(void) _nc_set_writedir (const char *);
- extern NCURSES_EXPORT(void) _nc_write_entry (TERMTYPE2 *const);
- extern NCURSES_EXPORT(int) _nc_write_object (TERMTYPE2 *, char *, unsigned *, unsigned);
- /* comp_parse.c: entry list handling */
- extern NCURSES_EXPORT(void) _nc_read_entry_source (FILE*, char*, int, bool, bool (*)(ENTRY*));
- extern NCURSES_EXPORT(bool) _nc_entry_match (char *, char *);
- extern NCURSES_EXPORT(int) _nc_resolve_uses (bool); /* obs 20040705 */
- extern NCURSES_EXPORT(int) _nc_resolve_uses2 (bool, bool);
- extern NCURSES_EXPORT(void) _nc_free_entries (ENTRY *);
- extern NCURSES_IMPEXP void (NCURSES_API *_nc_check_termtype)(TERMTYPE *); /* obs 20040705 */
- extern NCURSES_IMPEXP void (NCURSES_API *_nc_check_termtype2)(TERMTYPE2 *, bool);
- /* trace_xnames.c */
- extern NCURSES_EXPORT(void) _nc_trace_xnames (TERMTYPE *);
- #endif /* NCURSES_INTERNALS */
- /*
- * These entrypoints were used by tack before 1.08.
- */
- #undef NCURSES_TACK_1_08
- #ifdef NCURSES_INTERNALS
- #define NCURSES_TACK_1_08 /* nothing */
- #else
- #define NCURSES_TACK_1_08 GCC_DEPRECATED("upgrade to tack 1.08")
- #endif
- /* alloc_ttype.c: elementary allocation code */
- extern NCURSES_EXPORT(void) _nc_copy_termtype (TERMTYPE *, const TERMTYPE *) NCURSES_TACK_1_08;
- /* lib_acs.c */
- extern NCURSES_EXPORT(void) _nc_init_acs (void) NCURSES_TACK_1_08; /* corresponds to traditional 'init_acs()' */
- /* free_ttype.c: elementary allocation code */
- extern NCURSES_EXPORT(void) _nc_free_termtype (TERMTYPE *) NCURSES_TACK_1_08;
- #ifdef __cplusplus
- }
- #endif
- /* *INDENT-ON* */
- #endif /* NCURSES_TERM_ENTRY_H_incl */
|