1 /****************************************************************************
2  * Copyright (c) 1999-2007,2008 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.18 2008/11/16 00:19:59 juergen Exp $")
37 
38 /*
39  *	_nc_first_name(char *names)
40  *
41  *	Extract the primary name from a compiled entry.
42  */
43 #define FirstName _nc_globals.first_name
44 
45 NCURSES_EXPORT(char *)
46 _nc_first_name(const char *const sp)
47 /* get the first name from the given name list */
48 {
49     unsigned n;
50 
51 #if NO_LEAKS
52     if (sp == 0) {
53 	if (FirstName != 0)
54 	    FreeAndNull(FirstName);
55     } else
56 #endif
57     {
58 	if (FirstName == 0)
59 	    FirstName = typeMalloc(char, MAX_NAME_SIZE + 1);
60 
61 	if (FirstName != 0) {
62 	    for (n = 0; n < MAX_NAME_SIZE; n++) {
63 		if ((FirstName[n] = sp[n]) == '\0'
64 		    || (FirstName[n] == '|'))
65 		    break;
66 	    }
67 	    FirstName[n] = '\0';
68 	}
69     }
70     return (FirstName);
71 }
72 
73 /*
74  *	int _nc_name_match(namelist, name, delim)
75  *
76  *	Is the given name matched in namelist?
77  */
78 
79 NCURSES_EXPORT(int)
80 _nc_name_match(const char *const namelst, const char *const name, const char *const delim)
81 {
82     const char *s, *d, *t;
83     int code, found;
84 
85     if ((s = namelst) != 0) {
86 	while (*s != '\0') {
87 	    for (d = name; *d != '\0'; d++) {
88 		if (*s != *d)
89 		    break;
90 		s++;
91 	    }
92 	    found = FALSE;
93 	    for (code = TRUE; *s != '\0'; code = FALSE, s++) {
94 		for (t = delim; *t != '\0'; t++) {
95 		    if (*s == *t) {
96 			found = TRUE;
97 			break;
98 		    }
99 		}
100 		if (found)
101 		    break;
102 	    }
103 	    if (code && *d == '\0')
104 		return code;
105 	    if (*s++ == 0)
106 		break;
107 	}
108     }
109     return FALSE;
110 }
111