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