1 /* $OpenBSD: term_entry.h,v 1.10 2000/03/26 16:45:03 millert Exp $ */ 2 3 /**************************************************************************** 4 * Copyright (c) 1998,1999,2000 Free Software Foundation, Inc. * 5 * * 6 * Permission is hereby granted, free of charge, to any person obtaining a * 7 * copy of this software and associated documentation files (the * 8 * "Software"), to deal in the Software without restriction, including * 9 * without limitation the rights to use, copy, modify, merge, publish, * 10 * distribute, distribute with modifications, sublicense, and/or sell * 11 * copies of the Software, and to permit persons to whom the Software is * 12 * furnished to do so, subject to the following conditions: * 13 * * 14 * The above copyright notice and this permission notice shall be included * 15 * in all copies or substantial portions of the Software. * 16 * * 17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * 18 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * 19 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. * 20 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, * 21 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR * 22 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR * 23 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. * 24 * * 25 * Except as contained in this notice, the name(s) of the above copyright * 26 * holders shall not be used in advertising or otherwise to promote the * 27 * sale, use or other dealings in this Software without prior written * 28 * authorization. * 29 ****************************************************************************/ 30 31 /**************************************************************************** 32 * Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 * 33 * and: Eric S. Raymond <esr@snark.thyrsus.com> * 34 ****************************************************************************/ 35 36 /* $From: term_entry.h,v 1.29 2000/03/19 02:04:15 tom Exp $ */ 37 38 /* 39 * term_entry.h -- interface to entry-manipulation code 40 */ 41 42 #ifndef _TERM_ENTRY_H 43 #define _TERM_ENTRY_H 44 45 #ifdef __cplusplus 46 extern "C" { 47 #endif 48 49 #include <term.h> 50 51 #define MAX_USES 32 52 #define MAX_CROSSLINKS 16 53 54 typedef struct entry { 55 TERMTYPE tterm; 56 int nuses; 57 struct 58 { 59 char *name; 60 struct entry *link; 61 long line; 62 } 63 uses[MAX_USES]; 64 int ncrosslinks; 65 struct entry *crosslinks[MAX_CROSSLINKS]; 66 long cstart, cend; 67 long startline; 68 struct entry *next; 69 struct entry *last; 70 } 71 ENTRY; 72 73 #if NCURSES_XNAMES 74 #define NUM_BOOLEANS(tp) (tp)->num_Booleans 75 #define NUM_NUMBERS(tp) (tp)->num_Numbers 76 #define NUM_STRINGS(tp) (tp)->num_Strings 77 #define EXT_NAMES(tp,i,limit,index,table) (i >= limit) ? tp->ext_Names[index] : table[i] 78 #else 79 #define NUM_BOOLEANS(tp) BOOLCOUNT 80 #define NUM_NUMBERS(tp) NUMCOUNT 81 #define NUM_STRINGS(tp) STRCOUNT 82 #define EXT_NAMES(tp,i,limit,index,table) table[i] 83 #endif 84 85 #define NUM_EXT_NAMES(tp) ((tp)->ext_Booleans + (tp)->ext_Numbers + (tp)->ext_Strings) 86 87 #define for_each_boolean(n,tp) for(n = 0; n < NUM_BOOLEANS(tp); n++) 88 #define for_each_number(n,tp) for(n = 0; n < NUM_NUMBERS(tp); n++) 89 #define for_each_string(n,tp) for(n = 0; n < NUM_STRINGS(tp); n++) 90 91 #define ExtBoolname(tp,i,names) EXT_NAMES(tp, i, BOOLCOUNT, (i - (tp->num_Booleans - tp->ext_Booleans)), names) 92 #define ExtNumname(tp,i,names) EXT_NAMES(tp, i, NUMCOUNT, (i - (tp->num_Numbers - tp->ext_Numbers)) + tp->ext_Booleans, names) 93 #define ExtStrname(tp,i,names) EXT_NAMES(tp, i, STRCOUNT, (i - (tp->num_Strings - tp->ext_Strings)) + (tp->ext_Numbers + tp->ext_Booleans), names) 94 95 extern ENTRY *_nc_head, *_nc_tail; 96 #define for_entry_list(qp) for (qp = _nc_head; qp; qp = qp->next) 97 98 #define MAX_LINE 132 99 100 #define NULLHOOK (bool(*)(ENTRY *))0 101 102 /* 103 * Note that WANTED and PRESENT are not simple inverses! If a capability 104 * has been explicitly cancelled, it's not considered WANTED. 105 */ 106 #define WANTED(s) ((s) == ABSENT_STRING) 107 #define PRESENT(s) (((s) != ABSENT_STRING) && ((s) != CANCELLED_STRING)) 108 109 #define ANDMISSING(p,q) \ 110 {if (PRESENT(p) && !PRESENT(q)) _nc_warning(#p " but no " #q);} 111 112 #define PAIRED(p,q) \ 113 { \ 114 if (PRESENT(q) && !PRESENT(p)) \ 115 _nc_warning(#q " but no " #p); \ 116 if (PRESENT(p) && !PRESENT(q)) \ 117 _nc_warning(#p " but no " #q); \ 118 } 119 120 /* alloc_entry.c: elementary allocation code */ 121 extern ENTRY *_nc_copy_entry(ENTRY *oldp); 122 extern char *_nc_save_str(const char *const); 123 extern void _nc_init_entry(TERMTYPE *const); 124 extern void _nc_merge_entry(TERMTYPE *const, TERMTYPE *const); 125 extern void _nc_wrap_entry(ENTRY *const); 126 127 /* alloc_ttype.c: elementary allocation code */ 128 extern void _nc_align_termtype(TERMTYPE *, TERMTYPE *); 129 extern void _nc_copy_termtype(TERMTYPE *, TERMTYPE *); 130 131 /* free_ttype.c: elementary allocation code */ 132 extern void _nc_free_termtype(TERMTYPE *); 133 134 /* lib_acs.c */ 135 extern void _nc_init_acs(void); /* corresponds to traditional 'init_acs()' */ 136 137 /* parse_entry.c: entry-parsing code */ 138 #if NCURSES_XNAMES 139 extern bool _nc_user_definable; 140 extern bool _nc_disable_period; 141 #endif 142 extern int _nc_parse_entry(ENTRY *, int, bool); 143 extern int _nc_capcmp(const char *, const char *); 144 145 /* write_entry.c: writing an entry to the file system */ 146 extern void _nc_set_writedir(char *); 147 extern void _nc_write_entry(TERMTYPE *const); 148 149 /* comp_parse.c: entry list handling */ 150 extern void _nc_read_entry_source(FILE*, char*, int, bool, bool (*)(ENTRY*)); 151 extern bool _nc_entry_match(char *, char *); 152 extern int _nc_resolve_uses(bool); 153 extern void _nc_free_entries(ENTRY *); 154 extern void (*_nc_check_termtype)(TERMTYPE *); 155 156 /* trace_xnames.c */ 157 extern void _nc_trace_xnames(TERMTYPE *); 158 159 #ifdef __cplusplus 160 } 161 #endif 162 163 #endif /* _TERM_ENTRY_H */ 164