]> ncurses.scripts.mit.edu Git - ncurses.git/blob - ncurses/tinfo/name_match.c
a9e8396959d119380c955e1858aa11713454a019
[ncurses.git] / ncurses / tinfo / name_match.c
1 /****************************************************************************
2  * Copyright (c) 1999 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 <dickey@clark.net> 1999                        *
31  ****************************************************************************/
32
33 #include <curses.priv.h>
34 #include <term.h>
35 #include <tic.h>
36
37 MODULE_ID("$Id: name_match.c,v 1.8 1999/03/07 01:58:36 tom Exp $")
38
39 /*
40  *      _nc_first_name(char *names)
41  *
42  *      Extract the primary name from a compiled entry.
43  */
44
45 char *_nc_first_name(const char *const sp)
46 /* get the first name from the given name list */
47 {
48         static char     buf[MAX_NAME_SIZE+1];
49         register unsigned n;
50
51         for (n = 0; n < sizeof(buf)-1; n++) {
52                 if ((buf[n] = sp[n]) == '\0'
53                  || (buf[n] == '|'))
54                         break;
55         }
56         buf[n] = '\0';
57         return(buf);
58 }
59
60 /*
61  *      int _nc_name_match(namelist, name, delim)
62  *
63  *      Is the given name matched in namelist?
64  */
65
66 int _nc_name_match(const char *const namelst, const char *const name, const char *const delim)
67 {
68         const char *s, *d, *t;
69         int code, found;
70
71         if ((s = namelst) != 0) {
72                 while (*s != '\0') {
73                         for (d = name; *d != '\0'; d++) {
74                                 if (*s != *d)
75                                         break;
76                                 s++;
77                         }
78                         found = FALSE;
79                         for (code = TRUE; *s != '\0'; code = FALSE, s++) {
80                                 for (t = delim; *t != '\0'; t++) {
81                                         if (*s == *t) {
82                                                 found = TRUE;
83                                                 break;
84                                         }
85                                 }
86                                 if (found)
87                                         break;
88                         }
89                         if (code && *d == '\0')
90                                 return code;
91                         if (*s++ == 0)
92                                 break;
93                 }
94         }
95         return FALSE;
96 }