term_entry.h 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237
  1. /****************************************************************************
  2. * Copyright 2018-2019,2020 Thomas E. Dickey *
  3. * Copyright 1998-2015,2017 Free Software Foundation, Inc. *
  4. * *
  5. * Permission is hereby granted, free of charge, to any person obtaining a *
  6. * copy of this software and associated documentation files (the *
  7. * "Software"), to deal in the Software without restriction, including *
  8. * without limitation the rights to use, copy, modify, merge, publish, *
  9. * distribute, distribute with modifications, sublicense, and/or sell *
  10. * copies of the Software, and to permit persons to whom the Software is *
  11. * furnished to do so, subject to the following conditions: *
  12. * *
  13. * The above copyright notice and this permission notice shall be included *
  14. * in all copies or substantial portions of the Software. *
  15. * *
  16. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
  17. * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
  18. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
  19. * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
  20. * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
  21. * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
  22. * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
  23. * *
  24. * Except as contained in this notice, the name(s) of the above copyright *
  25. * holders shall not be used in advertising or otherwise to promote the *
  26. * sale, use or other dealings in this Software without prior written *
  27. * authorization. *
  28. ****************************************************************************/
  29. /****************************************************************************
  30. * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
  31. * and: Eric S. Raymond <esr@snark.thyrsus.com> *
  32. * and: Thomas E. Dickey 1998-on *
  33. ****************************************************************************/
  34. /* $Id: term_entry.h,v 1.59 2020/02/02 23:34:34 tom Exp $ */
  35. /*
  36. * term_entry.h -- interface to entry-manipulation code
  37. */
  38. #ifndef NCURSES_TERM_ENTRY_H_incl
  39. #define NCURSES_TERM_ENTRY_H_incl 1
  40. /* *INDENT-OFF* */
  41. #ifdef __cplusplus
  42. extern "C" {
  43. #endif
  44. #include <curses.h>
  45. #include <term.h>
  46. /*
  47. * These macros may be used by programs that know about TERMTYPE:
  48. */
  49. #if NCURSES_XNAMES
  50. #define NUM_BOOLEANS(tp) (tp)->num_Booleans
  51. #define NUM_NUMBERS(tp) (tp)->num_Numbers
  52. #define NUM_STRINGS(tp) (tp)->num_Strings
  53. #define EXT_NAMES(tp,i,limit,index,table) (i >= limit) ? tp->ext_Names[index] : table[i]
  54. #else
  55. #define NUM_BOOLEANS(tp) BOOLCOUNT
  56. #define NUM_NUMBERS(tp) NUMCOUNT
  57. #define NUM_STRINGS(tp) STRCOUNT
  58. #define EXT_NAMES(tp,i,limit,index,table) table[i]
  59. #endif
  60. #define NUM_EXT_NAMES(tp) (unsigned) ((tp)->ext_Booleans + (tp)->ext_Numbers + (tp)->ext_Strings)
  61. #define for_each_boolean(n,tp) for(n = 0; n < NUM_BOOLEANS(tp); n++)
  62. #define for_each_number(n,tp) for(n = 0; n < NUM_NUMBERS(tp); n++)
  63. #define for_each_string(n,tp) for(n = 0; n < NUM_STRINGS(tp); n++)
  64. #if NCURSES_XNAMES
  65. #define for_each_ext_boolean(n,tp) for(n = BOOLCOUNT; (int) n < (int) NUM_BOOLEANS(tp); n++)
  66. #define for_each_ext_number(n,tp) for(n = NUMCOUNT; (int) n < (int) NUM_NUMBERS(tp); n++)
  67. #define for_each_ext_string(n,tp) for(n = STRCOUNT; (int) n < (int) NUM_STRINGS(tp); n++)
  68. #endif
  69. #define ExtBoolname(tp,i,names) EXT_NAMES(tp, i, BOOLCOUNT, (i - (tp->num_Booleans - tp->ext_Booleans)), names)
  70. #define ExtNumname(tp,i,names) EXT_NAMES(tp, i, NUMCOUNT, (i - (tp->num_Numbers - tp->ext_Numbers)) + tp->ext_Booleans, names)
  71. #define ExtStrname(tp,i,names) EXT_NAMES(tp, i, STRCOUNT, (i - (tp->num_Strings - tp->ext_Strings)) + (tp->ext_Numbers + tp->ext_Booleans), names)
  72. /*
  73. * The remaining type-definitions and macros are used only internally by the
  74. * ncurses utilities.
  75. */
  76. #ifdef NCURSES_INTERNALS
  77. /*
  78. * see db_iterator.c - this enumeration lists the places searched for a
  79. * terminal description and defines the order in which they are searched.
  80. */
  81. typedef enum {
  82. dbdTIC = 0, /* special, used by tic when writing entry */
  83. #if NCURSES_USE_DATABASE
  84. dbdEnvOnce, /* the $TERMINFO environment variable */
  85. dbdHome, /* $HOME/.terminfo */
  86. dbdEnvList, /* the $TERMINFO_DIRS environment variable */
  87. dbdCfgList, /* the compiled-in TERMINFO_DIRS value */
  88. dbdCfgOnce, /* the compiled-in TERMINFO value */
  89. #endif
  90. #if NCURSES_USE_TERMCAP
  91. dbdEnvOnce2, /* the $TERMCAP environment variable */
  92. dbdEnvList2, /* the $TERMPATH environment variable */
  93. dbdCfgList2, /* the compiled-in TERMPATH */
  94. #endif
  95. dbdLAST
  96. } DBDIRS;
  97. #define MAX_USES 32
  98. #define MAX_CROSSLINKS 16
  99. typedef struct entry ENTRY;
  100. typedef struct {
  101. char *name;
  102. ENTRY *link;
  103. long line;
  104. } ENTRY_USES;
  105. struct entry {
  106. TERMTYPE2 tterm;
  107. unsigned nuses;
  108. ENTRY_USES uses[MAX_USES];
  109. int ncrosslinks;
  110. ENTRY *crosslinks[MAX_CROSSLINKS];
  111. long cstart;
  112. long cend;
  113. long startline;
  114. ENTRY *next;
  115. ENTRY *last;
  116. };
  117. extern NCURSES_EXPORT_VAR(ENTRY *) _nc_head;
  118. extern NCURSES_EXPORT_VAR(ENTRY *) _nc_tail;
  119. #define for_entry_list(qp) for (qp = _nc_head; qp; qp = qp->next)
  120. #define MAX_LINE 132
  121. #define NULLHOOK (bool(*)(ENTRY *))0
  122. /*
  123. * Note that WANTED and PRESENT are not simple inverses! If a capability
  124. * has been explicitly cancelled, it's not considered WANTED.
  125. */
  126. #define WANTED(s) ((s) == ABSENT_STRING)
  127. #define PRESENT(s) (((s) != ABSENT_STRING) && ((s) != CANCELLED_STRING))
  128. #define ANDMISSING(p,q) \
  129. { \
  130. if (PRESENT(p) && !PRESENT(q)) \
  131. _nc_warning(#p " but no " #q); \
  132. }
  133. #define PAIRED(p,q) \
  134. { \
  135. if (PRESENT(q) && !PRESENT(p)) \
  136. _nc_warning(#q " but no " #p); \
  137. if (PRESENT(p) && !PRESENT(q)) \
  138. _nc_warning(#p " but no " #q); \
  139. }
  140. /*
  141. * These entrypoints are used only by the ncurses utilities such as tic.
  142. */
  143. /* alloc_entry.c: elementary allocation code */
  144. extern NCURSES_EXPORT(ENTRY *) _nc_copy_entry (ENTRY *oldp);
  145. extern NCURSES_EXPORT(char *) _nc_save_str (const char *const);
  146. extern NCURSES_EXPORT(void) _nc_init_entry (ENTRY *const);
  147. extern NCURSES_EXPORT(void) _nc_merge_entry (ENTRY *const, ENTRY *const);
  148. extern NCURSES_EXPORT(void) _nc_wrap_entry (ENTRY *const, bool);
  149. /* alloc_ttype.c: elementary allocation code */
  150. extern NCURSES_EXPORT(void) _nc_align_termtype (TERMTYPE2 *, TERMTYPE2 *);
  151. /* free_ttype.c: elementary allocation code */
  152. extern NCURSES_EXPORT(void) _nc_free_termtype2 (TERMTYPE2 *);
  153. /* lib_termcap.c: trim sgr0 string for termcap users */
  154. extern NCURSES_EXPORT(char *) _nc_trim_sgr0 (TERMTYPE2 *);
  155. /* parse_entry.c: entry-parsing code */
  156. #if NCURSES_XNAMES
  157. extern NCURSES_EXPORT_VAR(bool) _nc_user_definable;
  158. extern NCURSES_EXPORT_VAR(bool) _nc_disable_period;
  159. #endif
  160. extern NCURSES_EXPORT(int) _nc_parse_entry (ENTRY *, int, bool);
  161. extern NCURSES_EXPORT(int) _nc_capcmp (const char *, const char *);
  162. /* write_entry.c: writing an entry to the file system */
  163. extern NCURSES_EXPORT(void) _nc_set_writedir (const char *);
  164. extern NCURSES_EXPORT(void) _nc_write_entry (TERMTYPE2 *const);
  165. extern NCURSES_EXPORT(int) _nc_write_object (TERMTYPE2 *, char *, unsigned *, unsigned);
  166. /* comp_parse.c: entry list handling */
  167. extern NCURSES_EXPORT(void) _nc_read_entry_source (FILE*, char*, int, bool, bool (*)(ENTRY*));
  168. extern NCURSES_EXPORT(bool) _nc_entry_match (char *, char *);
  169. extern NCURSES_EXPORT(int) _nc_resolve_uses (bool); /* obs 20040705 */
  170. extern NCURSES_EXPORT(int) _nc_resolve_uses2 (bool, bool);
  171. extern NCURSES_EXPORT(void) _nc_free_entries (ENTRY *);
  172. extern NCURSES_IMPEXP void NCURSES_API (*_nc_check_termtype)(TERMTYPE *); /* obs 20040705 */
  173. extern NCURSES_IMPEXP void NCURSES_API (*_nc_check_termtype2)(TERMTYPE2 *, bool);
  174. /* trace_xnames.c */
  175. extern NCURSES_EXPORT(void) _nc_trace_xnames (TERMTYPE *);
  176. #endif /* NCURSES_INTERNALS */
  177. /*
  178. * These entrypoints were used by tack before 1.08.
  179. */
  180. #undef NCURSES_TACK_1_08
  181. #ifdef NCURSES_INTERNALS
  182. #define NCURSES_TACK_1_08 /* nothing */
  183. #else
  184. #define NCURSES_TACK_1_08 GCC_DEPRECATED("upgrade to tack 1.08")
  185. #endif
  186. /* alloc_ttype.c: elementary allocation code */
  187. extern NCURSES_EXPORT(void) _nc_copy_termtype (TERMTYPE *, const TERMTYPE *) NCURSES_TACK_1_08;
  188. /* lib_acs.c */
  189. extern NCURSES_EXPORT(void) _nc_init_acs (void) NCURSES_TACK_1_08; /* corresponds to traditional 'init_acs()' */
  190. /* free_ttype.c: elementary allocation code */
  191. extern NCURSES_EXPORT(void) _nc_free_termtype (TERMTYPE *) NCURSES_TACK_1_08;
  192. #ifdef __cplusplus
  193. }
  194. #endif
  195. /* *INDENT-ON* */
  196. #endif /* NCURSES_TERM_ENTRY_H_incl */