1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
/****************************************************************************
* Copyright (c) 1999-2012,2013 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.23 2013/05/25 20:20:08 tom Exp $")
#define FirstName _nc_globals.first_name
#if NCURSES_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 NCURSES_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;
}
|
