1 /****************************************************************************
2 * Copyright 2018-2019,2020 Thomas E. Dickey *
3 * Copyright 2017 Free Software Foundation, Inc. *
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: *
13 * The above copyright notice and this permission notice shall be included *
14 * in all copies or substantial portions of the Software. *
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. *
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 *
28 ****************************************************************************/
30 /****************************************************************************
31 * Author: Thomas E. Dickey *
32 ****************************************************************************/
36 * New color-pair functions, alloc_pair and free_pair
39 #define NEW_PAIR_INTERNAL 1
40 #include <curses.priv.h>
43 #define CUR SP_TERMTYPE
46 #ifdef USE_TERM_DRIVER
47 #define MaxColors InfoOf(SP_PARM).maxcolors
49 #define MaxColors max_colors
52 #if NCURSES_EXT_COLORS
54 /* fix redefinition versys tic.h */
56 #define entry my_entry
58 #define ENTRY my_ENTRY
64 MODULE_ID("$Id: new_pair.c,v 1.19 2020/02/02 23:34:34 tom Exp $")
66 #if NCURSES_EXT_COLORS
71 prev_len(SCREEN *sp, int pair)
75 colorpair_t *list = sp->_color_pairs;
76 while (list[pair].prev != base) {
78 pair = list[pair].prev;
84 next_len(SCREEN *sp, int pair)
88 colorpair_t *list = sp->_color_pairs;
89 while (list[pair].next != base) {
91 pair = list[pair].next;
97 * Trace the contents of LRU color-pairs.
100 dumpit(SCREEN *sp, int pair, const char *tag)
102 colorpair_t *list = sp->_color_pairs;
103 char bigbuf[256 * 20];
106 size_t have = sizeof(bigbuf);
108 _nc_STRCPY(p, tag, have);
109 for (n = 0; n < sp->_pair_limit; ++n) {
110 if (list[n].mode != cpFREE) {
112 if ((size_t) (p - bigbuf) + 50 > have)
114 _nc_SPRINTF(p, _nc_SLIMIT(have - (p - bigbuf))
116 n, n == pair ? '@' : ':', list[n].next, list[n].prev);
119 T(("(%d/%d) %ld - %s",
122 strlen(bigbuf), bigbuf));
124 if (next_len(sp, 0) != prev_len(sp, 0)) {
126 ExitProgram(EXIT_FAILURE);
130 #define dumpit(sp, pair, tag) /* nothing */
134 compare_data(const void *a, const void *b)
136 const colorpair_t *p = (const colorpair_t *) a;
137 const colorpair_t *q = (const colorpair_t *) b;
138 return ((p->fg == q->fg)
144 _nc_find_color_pair(SCREEN *sp, int fg, int bg)
153 (pp = tfind(&find, &sp->_ordered_pairs, compare_data)) != 0) {
154 colorpair_t *temp = *(colorpair_t **) pp;
155 result = (int) (temp - sp->_color_pairs);
163 delink_color_pair(SCREEN *sp, int pair)
165 colorpair_t *list = sp->_color_pairs;
166 int prev = list[pair].prev;
167 int next = list[pair].next;
169 /* delink this from its current location */
170 if (list[prev].next == pair &&
171 list[next].prev == pair) {
172 list[prev].next = next;
173 list[next].prev = prev;
174 dumpit(sp, pair, "delinked");
179 * Discard all nodes in the fast-index.
182 _nc_free_ordered_pairs(SCREEN *sp)
184 if (sp && sp->_ordered_pairs && sp->_pair_alloc) {
186 for (n = 0; n < sp->_pair_alloc; ++n) {
187 tdelete(&sp->_color_pairs[n], &sp->_ordered_pairs, compare_data);
193 * Use this call to update the fast-index when modifying an entry in the color
197 _nc_reset_color_pair(SCREEN *sp, int pair, colorpair_t * next)
200 if (ValidPair(sp, pair)) {
201 ReservePairs(sp, pair);
202 last = &(sp->_color_pairs[pair]);
203 delink_color_pair(sp, pair);
204 if (last->mode > cpFREE &&
205 (last->fg != next->fg || last->bg != next->bg)) {
206 /* remove the old entry from fast index */
207 tdelete(last, &sp->_ordered_pairs, compare_data);
208 /* create a new entry in fast index */
210 tsearch(last, &sp->_ordered_pairs, compare_data);
216 * Use this call to relink the newest pair to the front of the list, keeping
220 _nc_set_color_pair(SCREEN *sp, int pair, int mode)
222 if (ValidPair(sp, pair)) {
223 colorpair_t *list = sp->_color_pairs;
224 dumpit(sp, pair, "SET_PAIR");
225 list[0].mode = cpKEEP;
226 if (list[pair].mode <= cpFREE)
228 list[pair].mode = mode;
229 if (list[0].next != pair) {
230 /* link it at the front of the list */
231 list[pair].next = list[0].next;
232 list[list[pair].next].prev = pair;
236 dumpit(sp, pair, "...after");
241 * If we reallocate the color-pair array, we have to adjust the fast-index.
244 _nc_copy_pairs(SCREEN *sp, colorpair_t * target, colorpair_t * source, int length)
247 for (n = 0; n < length; ++n) {
248 void *find = tfind(source + n, &sp->_ordered_pairs, compare_data);
250 tdelete(source + n, &sp->_ordered_pairs, compare_data);
251 tsearch(target + n, &sp->_ordered_pairs, compare_data);
257 NCURSES_SP_NAME(alloc_pair) (NCURSES_SP_DCLx int fg, int bg)
261 T((T_CALLED("alloc_pair(%d,%d)"), fg, bg));
264 } else if ((pair = _nc_find_color_pair(SP_PARM, fg, bg)) < 0) {
266 * Check if all of the slots have been used. If not, find one and
269 if (SP_PARM->_pairs_used + 1 < SP_PARM->_pair_limit) {
271 int hint = SP_PARM->_recent_pair;
274 * The linear search is done to allow mixing calls to init_pair()
275 * and alloc_pair(). The former can make gaps...
277 for (pair = hint + 1; pair < SP_PARM->_pair_alloc; pair++) {
278 if (SP_PARM->_color_pairs[pair].mode == cpFREE) {
279 T(("found gap %d", pair));
284 if (!found && (SP_PARM->_pair_alloc < SP_PARM->_pair_limit)) {
285 pair = SP_PARM->_pair_alloc;
286 ReservePairs(SP_PARM, pair);
287 if (SP_PARM->_color_pairs == 0) {
294 for (pair = 1; pair <= hint; pair++) {
295 if (SP_PARM->_color_pairs[pair].mode == cpFREE) {
296 T(("found gap %d", pair));
303 SP_PARM->_recent_pair = pair;
308 /* reuse the oldest one */
309 pair = SP_PARM->_color_pairs[0].prev;
310 T(("reusing %d", pair));
313 if (_nc_init_pair(SP_PARM, pair, fg, bg) == ERR)
320 NCURSES_SP_NAME(find_pair) (NCURSES_SP_DCLx int fg, int bg)
324 T((T_CALLED("find_pair(%d,%d)"), fg, bg));
325 pair = _nc_find_color_pair(SP_PARM, fg, bg);
330 NCURSES_SP_NAME(free_pair) (NCURSES_SP_DCLx int pair)
333 T((T_CALLED("free_pair(%d)"), pair));
334 if (ValidPair(SP_PARM, pair) && pair < SP_PARM->_pair_alloc) {
335 colorpair_t *cp = &(SP_PARM->_color_pairs[pair]);
337 _nc_change_pair(SP_PARM, pair);
338 delink_color_pair(SP_PARM, pair);
339 tdelete(cp, &SP_PARM->_ordered_pairs, compare_data);
342 SP_PARM->_pairs_used--;
350 alloc_pair(int f, int b)
352 return NCURSES_SP_NAME(alloc_pair) (CURRENT_SCREEN, f, b);
356 find_pair(int f, int b)
358 return NCURSES_SP_NAME(find_pair) (CURRENT_SCREEN, f, b);
364 return NCURSES_SP_NAME(free_pair) (CURRENT_SCREEN, pair);
370 _nc_new_pair_leaks(SCREEN *sp)
372 if (sp->_color_pairs) {
373 while (sp->_color_pairs[0].next) {
374 free_pair(sp->_color_pairs[0].next);
381 void _nc_new_pair(void);
386 #endif /* NCURSES_EXT_COLORS */