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