ncurses 6.2 - patch 20210515
[ncurses.git] / ncurses / tinfo / comp_parse.c
1 /****************************************************************************
2  * Copyright 2018-2020,2021 Thomas E. Dickey                                *
3  * Copyright 1998-2016,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 /****************************************************************************
31  *  Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995               *
32  *     and: Eric S. Raymond <esr@snark.thyrsus.com>                         *
33  *     and: Thomas E. Dickey                        1996-on                 *
34  ****************************************************************************/
35
36 /*
37  *      comp_parse.c -- parser driver loop and use handling.
38  *
39  *      Use this code by calling _nc_read_entry_source() on as many source
40  *      files as you like (either terminfo or termcap syntax).  If you
41  *      want use-resolution, call _nc_resolve_uses2().  To free the list
42  *      storage, do _nc_free_entries().
43  */
44
45 #include <curses.priv.h>
46
47 #include <ctype.h>
48
49 #include <tic.h>
50
51 MODULE_ID("$Id: comp_parse.c,v 1.113 2021/05/08 15:03:42 tom Exp $")
52
53 static void sanity_check2(TERMTYPE2 *, bool);
54 NCURSES_IMPEXP void (NCURSES_API *_nc_check_termtype2) (TERMTYPE2 *, bool) = sanity_check2;
55
56 static void fixup_acsc(TERMTYPE2 *, int);
57
58 static void
59 enqueue(ENTRY * ep)
60 /* add an entry to the in-core list */
61 {
62     ENTRY *newp = _nc_copy_entry(ep);
63
64     if (newp == 0)
65         _nc_err_abort(MSG_NO_MEMORY);
66
67     newp->last = _nc_tail;
68     _nc_tail = newp;
69
70     newp->next = 0;
71     if (newp->last)
72         newp->last->next = newp;
73 }
74
75 #define NAMEBUFFER_SIZE (MAX_NAME_SIZE + 2)
76
77 static char *
78 force_bar(char *dst, char *src)
79 {
80     if (strchr(src, '|') == 0) {
81         size_t len = strlen(src);
82         if (len > MAX_NAME_SIZE)
83             len = MAX_NAME_SIZE;
84         _nc_STRNCPY(dst, src, MAX_NAME_SIZE);
85         _nc_STRCPY(dst + len, "|", NAMEBUFFER_SIZE - len);
86         src = dst;
87     }
88     return src;
89 }
90 #define ForceBar(dst, src) ((strchr(src, '|') == 0) ? force_bar(dst, src) : src)
91
92 #if NCURSES_USE_TERMCAP && NCURSES_XNAMES
93 static char *
94 skip_index(char *name)
95 {
96     char *bar = strchr(name, '|');
97
98     if (bar != 0 && (bar - name) == 2)
99         name = bar + 1;
100
101     return name;
102 }
103 #endif
104
105 static bool
106 check_collisions(char *n1, char *n2, int counter)
107 {
108     char *pstart, *qstart, *pend, *qend;
109     char nc1[NAMEBUFFER_SIZE];
110     char nc2[NAMEBUFFER_SIZE];
111
112     n1 = ForceBar(nc1, n1);
113     n2 = ForceBar(nc2, n2);
114
115 #if NCURSES_USE_TERMCAP && NCURSES_XNAMES
116     if ((_nc_syntax == SYN_TERMCAP) && _nc_user_definable) {
117         n1 = skip_index(n1);
118         n2 = skip_index(n2);
119     }
120 #endif
121
122     for (pstart = n1; (pend = strchr(pstart, '|')); pstart = pend + 1) {
123         for (qstart = n2; (qend = strchr(qstart, '|')); qstart = qend + 1) {
124             if ((pend - pstart == qend - qstart)
125                 && memcmp(pstart, qstart, (size_t) (pend - pstart)) == 0) {
126                 if (counter > 0)
127                     (void) fprintf(stderr, "Name collision '%.*s' between\n",
128                                    (int) (pend - pstart), pstart);
129                 return (TRUE);
130             }
131         }
132     }
133
134     return (FALSE);
135 }
136
137 static char *
138 next_name(char *name)
139 {
140     if (*name != '\0')
141         ++name;
142     return name;
143 }
144
145 static char *
146 name_ending(char *name)
147 {
148     if (*name == '\0') {
149         name = 0;
150     } else {
151         while (*name != '\0' && *name != '|')
152             ++name;
153     }
154     return name;
155 }
156
157 /*
158  * Essentially, find the conflict reported in check_collisions() and remove
159  * it from the second name, unless that happens to be the last alias.
160  */
161 static bool
162 remove_collision(char *n1, char *n2)
163 {
164     char *p2 = n2;
165     char *pstart, *qstart, *pend, *qend;
166     bool removed = FALSE;
167
168 #if NCURSES_USE_TERMCAP && NCURSES_XNAMES
169     if ((_nc_syntax == SYN_TERMCAP) && _nc_user_definable) {
170         n1 = skip_index(n1);
171         p2 = n2 = skip_index(n2);
172     }
173 #endif
174
175     for (pstart = n1; (pend = name_ending(pstart)); pstart = next_name(pend)) {
176         for (qstart = n2; (qend = name_ending(qstart)); qstart = next_name(qend)) {
177             if ((pend - pstart == qend - qstart)
178                 && memcmp(pstart, qstart, (size_t) (pend - pstart)) == 0) {
179                 if (qstart != p2 || *qend == '|') {
180                     if (*qend == '|')
181                         ++qend;
182                     while ((*qstart++ = *qend++) != '\0') ;
183                     fprintf(stderr, "...now\t%s\n", p2);
184                     removed = TRUE;
185                 } else {
186                     fprintf(stderr, "Cannot remove alias '%.*s'\n",
187                             (int) (qend - qstart), qstart);
188                 }
189                 break;
190             }
191         }
192     }
193
194     return removed;
195 }
196
197 /* do any of the aliases in a pair of terminal names match? */
198 NCURSES_EXPORT(bool)
199 _nc_entry_match(char *n1, char *n2)
200 {
201     return check_collisions(n1, n2, 0);
202 }
203
204 /****************************************************************************
205  *
206  * Entry compiler and resolution logic
207  *
208  ****************************************************************************/
209
210 NCURSES_EXPORT(void)
211 _nc_read_entry_source(FILE *fp, char *buf,
212                       int literal, bool silent,
213                       bool(*hook) (ENTRY *))
214 /* slurp all entries in the given file into core */
215 {
216     ENTRY thisentry;
217     bool oldsuppress = _nc_suppress_warnings;
218     int immediate = 0;
219
220     if (silent)
221         _nc_suppress_warnings = TRUE;   /* shut the lexer up, too */
222
223     _nc_reset_input(fp, buf);
224     for (;;) {
225         memset(&thisentry, 0, sizeof(thisentry));
226         if (_nc_parse_entry(&thisentry, literal, silent) == ERR)
227             break;
228         if (!isalnum(UChar(thisentry.tterm.term_names[0])))
229             _nc_err_abort("terminal names must start with letter or digit");
230
231         /*
232          * This can be used for immediate compilation of entries with no "use="
233          * references to disk.  That avoids consuming a lot of memory when the
234          * resolution code could fetch entries off disk.
235          */
236         if (hook != NULLHOOK && (*hook) (&thisentry)) {
237             immediate++;
238         } else {
239             enqueue(&thisentry);
240             /*
241              * The enqueued entry is copied with _nc_copy_termtype(), so we can
242              * free some of the data from thisentry, i.e., the arrays.
243              */
244             FreeIfNeeded(thisentry.tterm.Booleans);
245             FreeIfNeeded(thisentry.tterm.Numbers);
246             FreeIfNeeded(thisentry.tterm.Strings);
247 #if NCURSES_XNAMES
248             FreeIfNeeded(thisentry.tterm.ext_Names);
249 #endif
250         }
251     }
252
253     if (_nc_tail) {
254         /* set up the head pointer */
255         for (_nc_head = _nc_tail; _nc_head->last; _nc_head = _nc_head->last)
256             continue;
257
258         DEBUG(1, ("head = %s", _nc_head->tterm.term_names));
259         DEBUG(1, ("tail = %s", _nc_tail->tterm.term_names));
260     }
261 #ifdef TRACE
262     else if (!immediate)
263         DEBUG(1, ("no entries parsed"));
264 #endif
265
266     _nc_suppress_warnings = oldsuppress;
267 }
268
269 #if NCURSES_XNAMES
270 static unsigned
271 find_capname(TERMTYPE2 *p, const char *name)
272 {
273     unsigned num_names = NUM_EXT_NAMES(p);
274     unsigned n;
275     if (name != 0) {
276         for (n = 0; n < num_names; ++n) {
277             if (!strcmp(p->ext_Names[n], name))
278                 break;
279         }
280     } else {
281         n = num_names + 1;
282     }
283     return n;
284 }
285
286 static int
287 extended_captype(TERMTYPE2 *p, unsigned which)
288 {
289     int result = UNDEF;
290     unsigned limit = 0;
291     limit += p->ext_Booleans;
292     if (limit != 0 && which < limit) {
293         result = BOOLEAN;
294     } else {
295         limit += p->ext_Numbers;
296         if (limit != 0 && which < limit) {
297             result = NUMBER;
298         } else {
299             limit += p->ext_Strings;
300             if (limit != 0 && which < limit) {
301                 result = STRING;
302             } else if (which >= limit) {
303                 result = CANCEL;
304             }
305         }
306     }
307     return result;
308 }
309
310 static const char *
311 name_of_captype(int which)
312 {
313     const char *result = "?";
314     switch (which) {
315     case BOOLEAN:
316         result = "boolean";
317         break;
318     case NUMBER:
319         result = "number";
320         break;
321     case STRING:
322         result = "string";
323         break;
324     }
325     return result;
326 }
327
328 #define valid_TERMTYPE2(p) \
329         ((p) != 0 && \
330          (p)->term_names != 0 && \
331          (p)->ext_Names != 0)
332
333 /*
334  * Disallow changing the type of an extended capability when doing a "use"
335  * if one or the other is a string.
336  */
337 static int
338 invalid_merge(TERMTYPE2 *to, TERMTYPE2 *from)
339 {
340     int rc = FALSE;
341     if (valid_TERMTYPE2(to)
342         && valid_TERMTYPE2(from)) {
343         char *to_name = _nc_first_name(to->term_names);
344         char *from_name = strdup(_nc_first_name(from->term_names));
345         unsigned num_names = NUM_EXT_NAMES(from);
346         unsigned n;
347
348         for (n = 0; n < num_names; ++n) {
349             const char *capname = from->ext_Names[n];
350             int tt = extended_captype(to, find_capname(to, capname));
351             int tf = extended_captype(from, n);
352
353             if (tt <= STRING
354                 && tf <= STRING
355                 && (tt == STRING) != (tf == STRING)) {
356                 if (from_name != 0 && strcmp(to_name, from_name)) {
357                     DEBUG(2,
358                           ("merge of %s to %s changes type of %s from %s to %s",
359                            from_name,
360                            to_name,
361                            from->ext_Names[n],
362                            name_of_captype(tf),
363                            name_of_captype(tt)));
364                 } else {
365                     DEBUG(2, ("merge of %s changes type of %s from %s to %s",
366                               to_name,
367                               from->ext_Names[n],
368                               name_of_captype(tf),
369                               name_of_captype(tt)));
370                 }
371                 _nc_warning("merge changes type of %s from %s to %s",
372                             from->ext_Names[n],
373                             name_of_captype(tf),
374                             name_of_captype(tt));
375                 rc = TRUE;
376             }
377         }
378         free(from_name);
379     }
380     return rc;
381 }
382 #define validate_merge(p, q) \
383         if (invalid_merge(&((p)->tterm), &((q)->tterm))) \
384                 return FALSE
385 #else
386 #define validate_merge(p, q)    /* nothing */
387 #endif
388
389 NCURSES_EXPORT(int)
390 _nc_resolve_uses2(bool fullresolve, bool literal)
391 /* try to resolve all use capabilities */
392 {
393     ENTRY *qp, *rp, *lastread = 0;
394     bool keepgoing;
395     unsigned i, j;
396     int unresolved, total_unresolved, multiples;
397
398     DEBUG(2, ("RESOLUTION BEGINNING"));
399
400     /*
401      * Check for multiple occurrences of the same name.
402      */
403     multiples = 0;
404     for_entry_list(qp) {
405         int matchcount = 0;
406
407         for_entry_list(rp) {
408             if (qp > rp
409                 && check_collisions(qp->tterm.term_names,
410                                     rp->tterm.term_names,
411                                     matchcount + 1)) {
412                 if (!matchcount++) {
413                     (void) fprintf(stderr, "\t%s\n", rp->tterm.term_names);
414                 }
415                 (void) fprintf(stderr, "and\t%s\n", qp->tterm.term_names);
416                 if (!remove_collision(rp->tterm.term_names,
417                                       qp->tterm.term_names)) {
418                     ++multiples;
419                 }
420             }
421         }
422     }
423     if (multiples > 0)
424         return (FALSE);
425
426     DEBUG(2, ("NO MULTIPLE NAME OCCURRENCES"));
427
428     /*
429      * First resolution stage: compute link pointers corresponding to names.
430      */
431     total_unresolved = 0;
432     _nc_curr_col = -1;
433     for_entry_list(qp) {
434         unresolved = 0;
435         for (i = 0; i < qp->nuses; i++) {
436             bool foundit;
437             char *child = _nc_first_name(qp->tterm.term_names);
438             char *lookfor = qp->uses[i].name;
439             long lookline = qp->uses[i].line;
440
441             if (lookfor == 0)
442                 continue;
443
444             foundit = FALSE;
445
446             _nc_set_type(child);
447
448             /* first, try to resolve from in-core records */
449             for_entry_list(rp) {
450                 if (rp != qp
451                     && _nc_name_match(rp->tterm.term_names, lookfor, "|")) {
452                     DEBUG(2, ("%s: resolving use=%s (in core)",
453                               child, lookfor));
454
455                     qp->uses[i].link = rp;
456                     foundit = TRUE;
457
458                     /* verify that there are no earlier uses */
459                     for (j = 0; j < i; ++j) {
460                         if (qp->uses[j].link != NULL
461                             && !strcmp(qp->uses[j].link->tterm.term_names,
462                                        rp->tterm.term_names)) {
463                             _nc_warning("duplicate use=%s", lookfor);
464                             break;
465                         }
466                     }
467                 }
468             }
469
470             /* if that didn't work, try to merge in a compiled entry */
471             if (!foundit) {
472                 TERMTYPE2 thisterm;
473                 char filename[PATH_MAX];
474
475                 memset(&thisterm, 0, sizeof(thisterm));
476                 if (_nc_read_entry2(lookfor, filename, &thisterm) == 1) {
477                     DEBUG(2, ("%s: resolving use=%s (compiled)",
478                               child, lookfor));
479
480                     TYPE_MALLOC(ENTRY, 1, rp);
481                     rp->tterm = thisterm;
482                     rp->nuses = 0;
483                     rp->next = lastread;
484                     lastread = rp;
485
486                     qp->uses[i].link = rp;
487                     foundit = TRUE;
488
489                     /* verify that there are no earlier uses */
490                     for (j = 0; j < i; ++j) {
491                         if (qp->uses[j].link != NULL
492                             && !strcmp(qp->uses[j].link->tterm.term_names,
493                                        rp->tterm.term_names)) {
494                             _nc_warning("duplicate use=%s", lookfor);
495                             break;
496                         }
497                     }
498                 }
499             }
500
501             /* no good, mark this one unresolvable and complain */
502             if (!foundit) {
503                 unresolved++;
504                 total_unresolved++;
505
506                 _nc_curr_line = (int) lookline;
507                 _nc_warning("resolution of use=%s failed", lookfor);
508                 qp->uses[i].link = 0;
509             }
510         }
511     }
512     if (total_unresolved) {
513         /* free entries read in off disk */
514         _nc_free_entries(lastread);
515         return (FALSE);
516     }
517
518     DEBUG(2, ("NAME RESOLUTION COMPLETED OK"));
519
520     /*
521      * OK, at this point all (char *) references in `name' members
522      * have been successfully converted to (ENTRY *) pointers in
523      * `link' members.  Time to do the actual merges.
524      */
525     if (fullresolve) {
526         do {
527             ENTRY merged;
528
529             keepgoing = FALSE;
530
531             for_entry_list(qp) {
532                 if (qp->nuses > 0) {
533                     DEBUG(2, ("%s: attempting merge",
534                               _nc_first_name(qp->tterm.term_names)));
535                     /*
536                      * If any of the use entries we're looking for is
537                      * incomplete, punt.  We'll catch this entry on a
538                      * subsequent pass.
539                      */
540                     for (i = 0; i < qp->nuses; i++)
541                         if (qp->uses[i].link
542                             && qp->uses[i].link->nuses) {
543                             DEBUG(2, ("%s: use entry %d unresolved",
544                                       _nc_first_name(qp->tterm.term_names), i));
545                             goto incomplete;
546                         }
547
548                     /*
549                      * First, make sure there is no garbage in the
550                      * merge block.  As a side effect, copy into
551                      * the merged entry the name field and string
552                      * table pointer.
553                      */
554                     _nc_copy_termtype2(&(merged.tterm), &(qp->tterm));
555
556                     /*
557                      * Now merge in each use entry in the proper
558                      * (reverse) order.
559                      */
560                     for (; qp->nuses; qp->nuses--) {
561                         validate_merge(&merged,
562                                        qp->uses[qp->nuses - 1].link);
563                         _nc_merge_entry(&merged,
564                                         qp->uses[qp->nuses - 1].link);
565                     }
566
567                     /*
568                      * Now merge in the original entry.
569                      */
570                     validate_merge(&merged, qp);
571                     _nc_merge_entry(&merged, qp);
572
573                     /*
574                      * Replace the original entry with the merged one.
575                      */
576                     FreeIfNeeded(qp->tterm.Booleans);
577                     FreeIfNeeded(qp->tterm.Numbers);
578                     FreeIfNeeded(qp->tterm.Strings);
579 #if NCURSES_XNAMES
580                     FreeIfNeeded(qp->tterm.ext_Names);
581 #endif
582                     qp->tterm = merged.tterm;
583                     _nc_wrap_entry(qp, TRUE);
584
585                     /*
586                      * We know every entry is resolvable because name resolution
587                      * didn't bomb.  So go back for another pass.
588                      */
589                     /* FALLTHRU */
590                   incomplete:
591                     keepgoing = TRUE;
592                 }
593             }
594         } while
595             (keepgoing);
596
597         DEBUG(2, ("MERGES COMPLETED OK"));
598     }
599
600     /*
601      * We'd like to free entries read in off disk at this point, but can't.
602      * The merge_entry() code doesn't copy the strings in the use entries,
603      * it just aliases them.  If this ever changes, do a
604      * free_entries(lastread) here.
605      */
606
607     DEBUG(2, ("RESOLUTION FINISHED"));
608
609     if (fullresolve) {
610         _nc_curr_col = -1;
611         for_entry_list(qp) {
612             _nc_curr_line = (int) qp->startline;
613             _nc_set_type(_nc_first_name(qp->tterm.term_names));
614             /*
615              * tic overrides this function pointer to provide more verbose
616              * checking.
617              */
618             if (_nc_check_termtype2 != sanity_check2) {
619                 SCREEN *save_SP = SP;
620                 SCREEN fake_sp;
621                 TERMINAL fake_tm;
622                 TERMINAL *save_tm = cur_term;
623
624                 /*
625                  * Setup so that tic can use ordinary terminfo interface to
626                  * obtain capability information.
627                  */
628                 memset(&fake_sp, 0, sizeof(fake_sp));
629                 memset(&fake_tm, 0, sizeof(fake_tm));
630                 fake_sp._term = &fake_tm;
631                 TerminalType(&fake_tm) = qp->tterm;
632                 _nc_set_screen(&fake_sp);
633                 set_curterm(&fake_tm);
634
635                 _nc_check_termtype2(&qp->tterm, literal);
636
637                 _nc_set_screen(save_SP);
638                 set_curterm(save_tm);
639             } else {
640                 fixup_acsc(&qp->tterm, literal);
641             }
642         }
643         DEBUG(2, ("SANITY CHECK FINISHED"));
644     }
645
646     return (TRUE);
647 }
648
649 /*
650  * This bit of legerdemain turns all the terminfo variable names into
651  * references to locations in the arrays Booleans, Numbers, and Strings ---
652  * precisely what's needed.
653  */
654
655 #undef CUR
656 #define CUR tp->
657
658 static void
659 fixup_acsc(TERMTYPE2 *tp, int literal)
660 {
661     if (!literal) {
662         if (acs_chars == ABSENT_STRING
663             && PRESENT(enter_alt_charset_mode)
664             && PRESENT(exit_alt_charset_mode))
665             acs_chars = strdup(VT_ACSC);
666     }
667 }
668
669 static void
670 sanity_check2(TERMTYPE2 *tp, bool literal)
671 {
672     if (!PRESENT(exit_attribute_mode)) {
673 #ifdef __UNUSED__               /* this casts too wide a net */
674         bool terminal_entry = !strchr(tp->term_names, '+');
675         if (terminal_entry &&
676             (PRESENT(set_attributes)
677              || PRESENT(enter_standout_mode)
678              || PRESENT(enter_underline_mode)
679              || PRESENT(enter_blink_mode)
680              || PRESENT(enter_bold_mode)
681              || PRESENT(enter_dim_mode)
682              || PRESENT(enter_secure_mode)
683              || PRESENT(enter_protected_mode)
684              || PRESENT(enter_reverse_mode)))
685             _nc_warning("no exit_attribute_mode");
686 #endif /* __UNUSED__ */
687         PAIRED(enter_standout_mode, exit_standout_mode);
688         PAIRED(enter_underline_mode, exit_underline_mode);
689 #if defined(enter_italics_mode) && defined(exit_italics_mode)
690         PAIRED(enter_italics_mode, exit_italics_mode);
691 #endif
692     }
693
694     /* we do this check/fix in postprocess_termcap(), but some packagers
695      * prefer to bypass it...
696      */
697     if (!literal) {
698         fixup_acsc(tp, literal);
699         ANDMISSING(enter_alt_charset_mode, acs_chars);
700         ANDMISSING(exit_alt_charset_mode, acs_chars);
701     }
702
703     /* listed in structure-member order of first argument */
704     PAIRED(enter_alt_charset_mode, exit_alt_charset_mode);
705     ANDMISSING(enter_blink_mode, exit_attribute_mode);
706     ANDMISSING(enter_bold_mode, exit_attribute_mode);
707     PAIRED(exit_ca_mode, enter_ca_mode);
708     PAIRED(enter_delete_mode, exit_delete_mode);
709     ANDMISSING(enter_dim_mode, exit_attribute_mode);
710     PAIRED(enter_insert_mode, exit_insert_mode);
711     ANDMISSING(enter_secure_mode, exit_attribute_mode);
712     ANDMISSING(enter_protected_mode, exit_attribute_mode);
713     ANDMISSING(enter_reverse_mode, exit_attribute_mode);
714     PAIRED(from_status_line, to_status_line);
715     PAIRED(meta_off, meta_on);
716
717     PAIRED(prtr_on, prtr_off);
718     PAIRED(save_cursor, restore_cursor);
719     PAIRED(enter_xon_mode, exit_xon_mode);
720     PAIRED(enter_am_mode, exit_am_mode);
721     ANDMISSING(label_off, label_on);
722 #if defined(display_clock) && defined(remove_clock)
723     PAIRED(display_clock, remove_clock);
724 #endif
725     ANDMISSING(set_color_pair, initialize_pair);
726 }
727
728 #if NO_LEAKS
729 NCURSES_EXPORT(void)
730 _nc_leaks_tic(void)
731 {
732     T((T_CALLED("_nc_free_tic()")));
733     _nc_globals.leak_checking = TRUE;
734     _nc_alloc_entry_leaks();
735     _nc_captoinfo_leaks();
736     _nc_comp_scan_leaks();
737 #if BROKEN_LINKER || USE_REENTRANT
738     _nc_names_leaks();
739     _nc_codes_leaks();
740 #endif
741     _nc_tic_expand(0, FALSE, 0);
742 }
743
744 NCURSES_EXPORT(void)
745 _nc_free_tic(int code)
746 {
747     _nc_leaks_tic();
748     exit_terminfo(code);
749 }
750 #endif