1/****************************************************************************
2 * Copyright 2020 Thomas E. Dickey                                          *
3 * Copyright 1998-2013,2016 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: Thomas E. Dickey                    1999-on                     *
32 ****************************************************************************/
33
34#include <curses.priv.h>
35#include <tic.h>
36
37MODULE_ID("$Id: name_match.c,v 1.25 2020/02/02 23:34:34 tom Exp $")
38
39#define FirstName _nc_globals.first_name
40
41#if NCURSES_USE_TERMCAP && NCURSES_XNAMES
42static const char *
43skip_index(const char *name)
44{
45    if ((_nc_syntax == SYN_TERMCAP) && _nc_user_definable) {
46	const char *bar = strchr(name, '|');
47	if (bar != 0 && (bar - name) == 2)
48	    name = bar + 1;
49    }
50    return name;
51}
52#endif
53
54/*
55 * Get the primary name from the given name list.  For terminfo, this is the
56 * first name.  For termcap, this may be the second name, if the first one
57 * happens to be two characters.
58 */
59NCURSES_EXPORT(char *)
60_nc_first_name(const char *const sp)
61{
62#if NO_LEAKS
63    if (sp == 0) {
64	if (FirstName != 0) {
65	    FreeAndNull(FirstName);
66	}
67    } else
68#endif
69    {
70	if (FirstName == 0)
71	    FirstName = typeMalloc(char, MAX_NAME_SIZE + 1);
72
73	if (FirstName != 0) {
74	    unsigned n;
75	    const char *src = sp;
76#if NCURSES_USE_TERMCAP && NCURSES_XNAMES
77	    src = skip_index(sp);
78#endif
79	    for (n = 0; n < MAX_NAME_SIZE; n++) {
80		if ((FirstName[n] = src[n]) == '\0'
81		    || (FirstName[n] == '|'))
82		    break;
83	    }
84	    FirstName[n] = '\0';
85	}
86    }
87    return (FirstName);
88}
89
90/*
91 * Is the given name matched in namelist?
92 */
93NCURSES_EXPORT(int)
94_nc_name_match(const char *const namelst, const char *const name, const char *const delim)
95{
96    const char *s;
97
98    if ((s = namelst) != 0) {
99	while (*s != '\0') {
100	    const char *d, *t;
101	    int code, found;
102
103	    for (d = name; *d != '\0'; d++) {
104		if (*s != *d)
105		    break;
106		s++;
107	    }
108	    found = FALSE;
109	    for (code = TRUE; *s != '\0'; code = FALSE, s++) {
110		for (t = delim; *t != '\0'; t++) {
111		    if (*s == *t) {
112			found = TRUE;
113			break;
114		    }
115		}
116		if (found)
117		    break;
118	    }
119	    if (code && *d == '\0')
120		return code;
121	    if (*s++ == 0)
122		break;
123	}
124    }
125    return FALSE;
126}
127