1/****************************************************************************
2 * Copyright (c) 2006-2011,2012 Free Software Foundation, Inc.              *
3 *                                                                          *
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:                 *
11 *                                                                          *
12 * The above copyright notice and this permission notice shall be included  *
13 * in all copies or substantial portions of the Software.                   *
14 *                                                                          *
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.                               *
22 *                                                                          *
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       *
26 * authorization.                                                           *
27 ****************************************************************************/
28
29/****************************************************************************
30 *  Author: Thomas E. Dickey                                                *
31 *     and: Juergen Pfeifer                                                 *
32 ****************************************************************************/
33
34#include <curses.priv.h>
35
36#include <ctype.h>
37
38#include <tic.h>
39
40MODULE_ID("$Id: entries.c,v 1.21 2012/05/05 20:33:44 tom Exp $")
41
42/****************************************************************************
43 *
44 * Entry queue handling
45 *
46 ****************************************************************************/
47/*
48 *  The entry list is a doubly linked list with NULLs terminating the lists:
49 *
50 *	  ---------   ---------   ---------
51 *	  |       |   |       |   |       |   offset
52 *        |-------|   |-------|   |-------|
53 *	  |   ----+-->|   ----+-->|  NULL |   next
54 *	  |-------|   |-------|   |-------|
55 *	  |  NULL |<--+----   |<--+----   |   last
56 *	  ---------   ---------   ---------
57 *	      ^                       ^
58 *	      |                       |
59 *	      |                       |
60 *	   _nc_head                _nc_tail
61 */
62
63NCURSES_EXPORT_VAR(ENTRY *) _nc_head = 0;
64NCURSES_EXPORT_VAR(ENTRY *) _nc_tail = 0;
65
66NCURSES_EXPORT(void)
67_nc_free_entry(ENTRY * headp, TERMTYPE *tterm)
68/* free the allocated storage consumed by the given list entry */
69{
70    ENTRY *ep;
71
72    if ((ep = _nc_delink_entry(headp, tterm)) != 0) {
73	free(ep);
74    }
75}
76
77NCURSES_EXPORT(void)
78_nc_free_entries(ENTRY * headp)
79/* free the allocated storage consumed by list entries */
80{
81    (void) headp;		/* unused - _nc_head is altered here! */
82
83    while (_nc_head != 0) {
84	_nc_free_termtype(&(_nc_head->tterm));
85    }
86}
87
88NCURSES_EXPORT(ENTRY *)
89_nc_delink_entry(ENTRY * headp, TERMTYPE *tterm)
90/* delink the allocated storage for the given list entry */
91{
92    ENTRY *ep, *last;
93
94    for (last = 0, ep = headp; ep != 0; last = ep, ep = ep->next) {
95	if (&(ep->tterm) == tterm) {
96	    if (last != 0) {
97		last->next = ep->next;
98	    }
99	    if (ep->next != 0) {
100		ep->next->last = last;
101	    }
102	    if (ep == _nc_head) {
103		_nc_head = ep->next;
104	    }
105	    if (ep == _nc_tail) {
106		_nc_tail = last;
107	    }
108	    break;
109	}
110    }
111    return ep;
112}
113
114NCURSES_EXPORT(void)
115_nc_leaks_tinfo(void)
116{
117#if NO_LEAKS
118    char *s;
119#endif
120
121    T((T_CALLED("_nc_free_tinfo()")));
122#if NO_LEAKS
123    _nc_free_tparm();
124    _nc_tgetent_leaks();
125
126    if (TerminalOf(CURRENT_SCREEN) != 0) {
127	del_curterm(TerminalOf(CURRENT_SCREEN));
128    }
129
130    _nc_comp_captab_leaks();
131    _nc_free_entries(_nc_head);
132    _nc_get_type(0);
133    _nc_first_name(0);
134    _nc_db_iterator_leaks();
135    _nc_keyname_leaks();
136#if BROKEN_LINKER || USE_REENTRANT
137    _nc_names_leaks();
138    _nc_codes_leaks();
139    FreeIfNeeded(_nc_prescreen.real_acs_map);
140#endif
141    _nc_comp_error_leaks();
142
143    if ((s = _nc_home_terminfo()) != 0)
144	free(s);
145
146#ifdef TRACE
147    trace(0);
148    _nc_trace_buf(-1, (size_t) 0);
149#endif
150
151#endif /* NO_LEAKS */
152    returnVoid;
153}
154
155#if NO_LEAKS
156NCURSES_EXPORT(void)
157_nc_free_tinfo(int code)
158{
159    _nc_leaks_tinfo();
160    exit(code);
161}
162#endif
163