mirror of
https://github.com/Aigor44/ncursesw-morphos.git
synced 2024-12-27 07:49:06 +08:00
c002077d39
+ add substitution for $RPATH_LIST to misc/ncurses-config.in + improve performance of tic with hashed-database by caching the database connection, using atexit() to cleanup. + modify treatment of 2-character aliases at the beginning of termcap entries so they are not counted in use-resolution, since these are guaranteed to be unique. Also ignore these aliases when reporting the primary name of the entry (cf: 20040501) + double-check gn (generic) flag in terminal descriptions to accommodate old/buggy termcap databases which misused that feature. + minor fixes to _nc_tgetent(), ensure buffer is initialized even on error-return.
124 lines
4.1 KiB
C
124 lines
4.1 KiB
C
/****************************************************************************
|
|
* Copyright (c) 1999-2008,2011 Free Software Foundation, Inc. *
|
|
* *
|
|
* Permission is hereby granted, free of charge, to any person obtaining a *
|
|
* copy of this software and associated documentation files (the *
|
|
* "Software"), to deal in the Software without restriction, including *
|
|
* without limitation the rights to use, copy, modify, merge, publish, *
|
|
* distribute, distribute with modifications, sublicense, and/or sell *
|
|
* copies of the Software, and to permit persons to whom the Software is *
|
|
* furnished to do so, subject to the following conditions: *
|
|
* *
|
|
* The above copyright notice and this permission notice shall be included *
|
|
* in all copies or substantial portions of the Software. *
|
|
* *
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
|
|
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
|
|
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
|
|
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
|
|
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
|
|
* *
|
|
* Except as contained in this notice, the name(s) of the above copyright *
|
|
* holders shall not be used in advertising or otherwise to promote the *
|
|
* sale, use or other dealings in this Software without prior written *
|
|
* authorization. *
|
|
****************************************************************************/
|
|
|
|
/****************************************************************************
|
|
* Author: Thomas E. Dickey 1999-on *
|
|
****************************************************************************/
|
|
|
|
#include <curses.priv.h>
|
|
#include <tic.h>
|
|
|
|
MODULE_ID("$Id: name_match.c,v 1.21 2011/08/13 20:23:12 tom Exp $")
|
|
|
|
#define FirstName _nc_globals.first_name
|
|
|
|
#if USE_TERMCAP && NCURSES_XNAMES
|
|
static const char *
|
|
skip_index(const char *name)
|
|
{
|
|
if ((_nc_syntax == SYN_TERMCAP) && _nc_user_definable) {
|
|
const char *bar = strchr(name, '|');
|
|
if (bar != 0 && (bar - name) == 2)
|
|
name = bar + 1;
|
|
}
|
|
return name;
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
* Get the primary name from the given name list. For terminfo, this is the
|
|
* first name. For termcap, this may be the second name, if the first one
|
|
* happens to be two characters.
|
|
*/
|
|
NCURSES_EXPORT(char *)
|
|
_nc_first_name(const char *const sp)
|
|
{
|
|
unsigned n;
|
|
|
|
#if NO_LEAKS
|
|
if (sp == 0) {
|
|
if (FirstName != 0)
|
|
FreeAndNull(FirstName);
|
|
} else
|
|
#endif
|
|
{
|
|
if (FirstName == 0)
|
|
FirstName = typeMalloc(char, MAX_NAME_SIZE + 1);
|
|
|
|
if (FirstName != 0) {
|
|
const char *src = sp;
|
|
#if USE_TERMCAP && NCURSES_XNAMES
|
|
src = skip_index(sp);
|
|
#endif
|
|
for (n = 0; n < MAX_NAME_SIZE; n++) {
|
|
if ((FirstName[n] = src[n]) == '\0'
|
|
|| (FirstName[n] == '|'))
|
|
break;
|
|
}
|
|
FirstName[n] = '\0';
|
|
}
|
|
}
|
|
return (FirstName);
|
|
}
|
|
|
|
/*
|
|
* Is the given name matched in namelist?
|
|
*/
|
|
NCURSES_EXPORT(int)
|
|
_nc_name_match(const char *const namelst, const char *const name, const char *const delim)
|
|
{
|
|
const char *s, *d, *t;
|
|
int code, found;
|
|
|
|
if ((s = namelst) != 0) {
|
|
while (*s != '\0') {
|
|
for (d = name; *d != '\0'; d++) {
|
|
if (*s != *d)
|
|
break;
|
|
s++;
|
|
}
|
|
found = FALSE;
|
|
for (code = TRUE; *s != '\0'; code = FALSE, s++) {
|
|
for (t = delim; *t != '\0'; t++) {
|
|
if (*s == *t) {
|
|
found = TRUE;
|
|
break;
|
|
}
|
|
}
|
|
if (found)
|
|
break;
|
|
}
|
|
if (code && *d == '\0')
|
|
return code;
|
|
if (*s++ == 0)
|
|
break;
|
|
}
|
|
}
|
|
return FALSE;
|
|
}
|