1 /****************************************************************************
2 * Copyright (c) 1998-2008,2009 Free Software Foundation, Inc. *
4 * Permission is hereby granted, free of charge, to any person obtaining a *
5 * copy of this software and associated documentation files (the *
6 * "Software"), to deal in the Software without restriction, including *
7 * without limitation the rights to use, copy, modify, merge, publish, *
8 * distribute, distribute with modifications, sublicense, and/or sell *
9 * copies of the Software, and to permit persons to whom the Software is *
10 * furnished to do so, subject to the following conditions: *
12 * The above copyright notice and this permission notice shall be included *
13 * in all copies or substantial portions of the Software. *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
16 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
18 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
19 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
20 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
21 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
23 * Except as contained in this notice, the name(s) of the above copyright *
24 * holders shall not be used in advertising or otherwise to promote the *
25 * sale, use or other dealings in this Software without prior written *
27 ****************************************************************************/
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 1996-on *
33 ****************************************************************************/
36 * comp_parse.c -- parser driver loop and use handling.
38 * _nc_read_entry_source(FILE *, literal, bool, bool (*hook)())
39 * _nc_resolve_uses2(void)
40 * _nc_free_entries(void)
42 * Use this code by calling _nc_read_entry_source() on as many source
43 * files as you like (either terminfo or termcap syntax). If you
44 * want use-resolution, call _nc_resolve_uses2(). To free the list
45 * storage, do _nc_free_entries().
49 #include <curses.priv.h>
54 #include <term_entry.h>
56 MODULE_ID("$Id: comp_parse.c,v 1.70 2009/07/18 20:38:52 tom Exp $")
58 static void sanity_check2(TERMTYPE *, bool);
59 NCURSES_IMPEXP void NCURSES_API(*_nc_check_termtype2) (TERMTYPE *, bool) = sanity_check2;
61 /* obsolete: 20040705 */
62 static void sanity_check(TERMTYPE *);
63 NCURSES_IMPEXP void NCURSES_API(*_nc_check_termtype) (TERMTYPE *) = sanity_check;
67 /* add an entry to the in-core list */
69 ENTRY *newp = _nc_copy_entry(ep);
72 _nc_err_abort(MSG_NO_MEMORY);
74 newp->last = _nc_tail;
79 newp->last->next = newp;
83 force_bar(char *dst, char *src)
85 if (strchr(src, '|') == 0) {
86 size_t len = strlen(src);
87 if (len > MAX_NAME_SIZE)
89 (void) strncpy(dst, src, len);
90 (void) strcpy(dst + len, "|");
95 #define ForceBar(dst, src) ((strchr(src, '|') == 0) ? force_bar(dst, src) : src)
98 _nc_entry_match(char *n1, char *n2)
99 /* do any of the aliases in a pair of terminal names match? */
101 char *pstart, *qstart, *pend, *qend;
102 char nc1[MAX_NAME_SIZE + 2];
103 char nc2[MAX_NAME_SIZE + 2];
105 n1 = ForceBar(nc1, n1);
106 n2 = ForceBar(nc2, n2);
108 for (pstart = n1; (pend = strchr(pstart, '|')); pstart = pend + 1)
109 for (qstart = n2; (qend = strchr(qstart, '|')); qstart = qend + 1)
110 if ((pend - pstart == qend - qstart)
111 && memcmp(pstart, qstart, (size_t) (pend - pstart)) == 0)
117 /****************************************************************************
119 * Entry compiler and resolution logic
121 ****************************************************************************/
124 _nc_read_entry_source(FILE *fp, char *buf,
125 int literal, bool silent,
126 bool(*hook) (ENTRY *))
127 /* slurp all entries in the given file into core */
130 bool oldsuppress = _nc_suppress_warnings;
134 _nc_suppress_warnings = TRUE; /* shut the lexer up, too */
136 _nc_reset_input(fp, buf);
138 memset(&thisentry, 0, sizeof(thisentry));
139 if (_nc_parse_entry(&thisentry, literal, silent) == ERR)
141 if (!isalnum(UChar(thisentry.tterm.term_names[0])))
142 _nc_err_abort("terminal names must start with letter or digit");
145 * This can be used for immediate compilation of entries with no "use="
146 * references to disk. That avoids consuming a lot of memory when the
147 * resolution code could fetch entries off disk.
149 if (hook != NULLHOOK && (*hook) (&thisentry)) {
154 * The enqueued entry is copied with _nc_copy_termtype(), so we can
155 * free some of the data from thisentry, i.e., the arrays.
157 FreeIfNeeded(thisentry.tterm.Booleans);
158 FreeIfNeeded(thisentry.tterm.Numbers);
159 FreeIfNeeded(thisentry.tterm.Strings);
161 FreeIfNeeded(thisentry.tterm.ext_Names);
167 /* set up the head pointer */
168 for (_nc_head = _nc_tail; _nc_head->last; _nc_head = _nc_head->last)
171 DEBUG(1, ("head = %s", _nc_head->tterm.term_names));
172 DEBUG(1, ("tail = %s", _nc_tail->tterm.term_names));
176 DEBUG(1, ("no entries parsed"));
179 _nc_suppress_warnings = oldsuppress;
183 _nc_resolve_uses2(bool fullresolve, bool literal)
184 /* try to resolve all use capabilities */
186 ENTRY *qp, *rp, *lastread = 0;
189 int unresolved, total_unresolved, multiples;
191 DEBUG(2, ("RESOLUTION BEGINNING"));
194 * Check for multiple occurrences of the same name.
202 && _nc_entry_match(qp->tterm.term_names, rp->tterm.term_names)) {
204 if (matchcount == 1) {
205 (void) fprintf(stderr, "Name collision between %s",
206 _nc_first_name(qp->tterm.term_names));
210 (void) fprintf(stderr, " %s", _nc_first_name(rp->tterm.term_names));
214 (void) putc('\n', stderr);
219 DEBUG(2, ("NO MULTIPLE NAME OCCURRENCES"));
222 * First resolution stage: compute link pointers corresponding to names.
224 total_unresolved = 0;
228 for (i = 0; i < qp->nuses; i++) {
230 char *child = _nc_first_name(qp->tterm.term_names);
231 char *lookfor = qp->uses[i].name;
232 long lookline = qp->uses[i].line;
238 /* first, try to resolve from in-core records */
241 && _nc_name_match(rp->tterm.term_names, lookfor, "|")) {
242 DEBUG(2, ("%s: resolving use=%s (in core)",
245 qp->uses[i].link = rp;
250 /* if that didn't work, try to merge in a compiled entry */
253 char filename[PATH_MAX];
255 memset(&thisterm, 0, sizeof(thisterm));
256 if (_nc_read_entry(lookfor, filename, &thisterm) == 1) {
257 DEBUG(2, ("%s: resolving use=%s (compiled)",
260 rp = typeMalloc(ENTRY, 1);
262 _nc_err_abort(MSG_NO_MEMORY);
263 rp->tterm = thisterm;
268 qp->uses[i].link = rp;
273 /* no good, mark this one unresolvable and complain */
278 _nc_curr_line = lookline;
279 _nc_warning("resolution of use=%s failed", lookfor);
280 qp->uses[i].link = 0;
284 if (total_unresolved) {
285 /* free entries read in off disk */
286 _nc_free_entries(lastread);
290 DEBUG(2, ("NAME RESOLUTION COMPLETED OK"));
293 * OK, at this point all (char *) references in `name' members
294 * have been successfully converted to (ENTRY *) pointers in
295 * `link' members. Time to do the actual merges.
305 DEBUG(2, ("%s: attempting merge",
306 _nc_first_name(qp->tterm.term_names)));
308 * If any of the use entries we're looking for is
309 * incomplete, punt. We'll catch this entry on a
312 for (i = 0; i < qp->nuses; i++)
313 if (qp->uses[i].link->nuses) {
314 DEBUG(2, ("%s: use entry %d unresolved",
315 _nc_first_name(qp->tterm.term_names), i));
320 * First, make sure there is no garbage in the
321 * merge block. As a side effect, copy into
322 * the merged entry the name field and string
325 _nc_copy_termtype(&merged, &(qp->tterm));
328 * Now merge in each use entry in the proper
331 for (; qp->nuses; qp->nuses--)
332 _nc_merge_entry(&merged,
333 &qp->uses[qp->nuses - 1].link->tterm);
336 * Now merge in the original entry.
338 _nc_merge_entry(&merged, &qp->tterm);
341 * Replace the original entry with the merged one.
343 FreeIfNeeded(qp->tterm.Booleans);
344 FreeIfNeeded(qp->tterm.Numbers);
345 FreeIfNeeded(qp->tterm.Strings);
347 FreeIfNeeded(qp->tterm.ext_Names);
350 _nc_wrap_entry(qp, TRUE);
353 * We know every entry is resolvable because name resolution
354 * didn't bomb. So go back for another pass.
364 DEBUG(2, ("MERGES COMPLETED OK"));
368 * We'd like to free entries read in off disk at this point, but can't.
369 * The merge_entry() code doesn't copy the strings in the use entries,
370 * it just aliases them. If this ever changes, do a
371 * free_entries(lastread) here.
374 DEBUG(2, ("RESOLUTION FINISHED"));
377 if (_nc_check_termtype != 0) {
380 _nc_curr_line = qp->startline;
381 _nc_set_type(_nc_first_name(qp->tterm.term_names));
382 _nc_check_termtype2(&qp->tterm, literal);
384 DEBUG(2, ("SANITY CHECK FINISHED"));
390 /* obsolete: 20040705 */
392 _nc_resolve_uses(bool fullresolve)
394 return _nc_resolve_uses2(fullresolve, FALSE);
398 * This bit of legerdemain turns all the terminfo variable names into
399 * references to locations in the arrays Booleans, Numbers, and Strings ---
400 * precisely what's needed.
407 sanity_check2(TERMTYPE *tp, bool literal)
409 if (!PRESENT(exit_attribute_mode)) {
410 #ifdef __UNUSED__ /* this casts too wide a net */
411 bool terminal_entry = !strchr(tp->term_names, '+');
412 if (terminal_entry &&
413 (PRESENT(set_attributes)
414 || PRESENT(enter_standout_mode)
415 || PRESENT(enter_underline_mode)
416 || PRESENT(enter_blink_mode)
417 || PRESENT(enter_bold_mode)
418 || PRESENT(enter_dim_mode)
419 || PRESENT(enter_secure_mode)
420 || PRESENT(enter_protected_mode)
421 || PRESENT(enter_reverse_mode)))
422 _nc_warning("no exit_attribute_mode");
423 #endif /* __UNUSED__ */
424 PAIRED(enter_standout_mode, exit_standout_mode);
425 PAIRED(enter_underline_mode, exit_underline_mode);
428 /* we do this check/fix in postprocess_termcap(), but some packagers
429 * prefer to bypass it...
433 && enter_alt_charset_mode != 0
434 && exit_alt_charset_mode != 0)
435 acs_chars = strdup(VT_ACSC);
436 ANDMISSING(enter_alt_charset_mode, acs_chars);
437 ANDMISSING(exit_alt_charset_mode, acs_chars);
440 /* listed in structure-member order of first argument */
441 PAIRED(enter_alt_charset_mode, exit_alt_charset_mode);
442 ANDMISSING(enter_blink_mode, exit_attribute_mode);
443 ANDMISSING(enter_bold_mode, exit_attribute_mode);
444 PAIRED(exit_ca_mode, enter_ca_mode);
445 PAIRED(enter_delete_mode, exit_delete_mode);
446 ANDMISSING(enter_dim_mode, exit_attribute_mode);
447 PAIRED(enter_insert_mode, exit_insert_mode);
448 ANDMISSING(enter_secure_mode, exit_attribute_mode);
449 ANDMISSING(enter_protected_mode, exit_attribute_mode);
450 ANDMISSING(enter_reverse_mode, exit_attribute_mode);
451 PAIRED(from_status_line, to_status_line);
452 PAIRED(meta_off, meta_on);
454 PAIRED(prtr_on, prtr_off);
455 PAIRED(save_cursor, restore_cursor);
456 PAIRED(enter_xon_mode, exit_xon_mode);
457 PAIRED(enter_am_mode, exit_am_mode);
458 ANDMISSING(label_off, label_on);
460 PAIRED(display_clock, remove_clock);
462 ANDMISSING(set_color_pair, initialize_pair);
465 /* obsolete: 20040705 */
467 sanity_check(TERMTYPE *tp)
469 sanity_check2(tp, FALSE);
476 _nc_alloc_entry_leaks();
477 _nc_captoinfo_leaks();
478 _nc_comp_captab_leaks();
479 _nc_comp_scan_leaks();
480 #if BROKEN_LINKER || USE_REENTRANT
484 _nc_tic_expand(0, FALSE, 0);
488 _nc_free_tic(int code)
491 _nc_free_tinfo(code);