GCC Code Coverage Report
Directory: ./ Exec Total Coverage
File: lib/libcurses/tinfo/name_match.c Lines: 9 23 39.1 %
Date: 2017-11-07 Branches: 6 32 18.8 %

Line Branch Exec Source
1
/* $OpenBSD: name_match.c,v 1.4 2010/01/12 23:22:06 nicm Exp $ */
2
3
/****************************************************************************
4
 * Copyright (c) 1999-2007,2008 Free Software Foundation, Inc.              *
5
 *                                                                          *
6
 * Permission is hereby granted, free of charge, to any person obtaining a  *
7
 * copy of this software and associated documentation files (the            *
8
 * "Software"), to deal in the Software without restriction, including      *
9
 * without limitation the rights to use, copy, modify, merge, publish,      *
10
 * distribute, distribute with modifications, sublicense, and/or sell       *
11
 * copies of the Software, and to permit persons to whom the Software is    *
12
 * furnished to do so, subject to the following conditions:                 *
13
 *                                                                          *
14
 * The above copyright notice and this permission notice shall be included  *
15
 * in all copies or substantial portions of the Software.                   *
16
 *                                                                          *
17
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS  *
18
 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF               *
19
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.   *
20
 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,   *
21
 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR    *
22
 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR    *
23
 * THE USE OR OTHER DEALINGS IN THE SOFTWARE.                               *
24
 *                                                                          *
25
 * Except as contained in this notice, the name(s) of the above copyright   *
26
 * holders shall not be used in advertising or otherwise to promote the     *
27
 * sale, use or other dealings in this Software without prior written       *
28
 * authorization.                                                           *
29
 ****************************************************************************/
30
31
/****************************************************************************
32
 *  Author: Thomas E. Dickey                    1999-on                     *
33
 ****************************************************************************/
34
35
#include <curses.priv.h>
36
#include <term.h>
37
#include <tic.h>
38
39
MODULE_ID("$Id: name_match.c,v 1.4 2010/01/12 23:22:06 nicm Exp $")
40
41
/*
42
 *	_nc_first_name(char *names)
43
 *
44
 *	Extract the primary name from a compiled entry.
45
 */
46
#define FirstName _nc_globals.first_name
47
48
NCURSES_EXPORT(char *)
49
_nc_first_name(const char *const sp)
50
/* get the first name from the given name list */
51
{
52
    unsigned n;
53
54
#if NO_LEAKS
55
    if (sp == 0) {
56
	if (FirstName != 0)
57
	    FreeAndNull(FirstName);
58
    } else
59
#endif
60
    {
61
4
	if (FirstName == 0)
62
2
	    FirstName = typeMalloc(char, MAX_NAME_SIZE + 1);
63
64
2
	if (FirstName != 0) {
65
28
	    for (n = 0; n < MAX_NAME_SIZE; n++) {
66
28
		if ((FirstName[n] = sp[n]) == '\0'
67
28
		    || (FirstName[n] == '|'))
68
		    break;
69
	    }
70
2
	    FirstName[n] = '\0';
71
2
	}
72
    }
73
2
    return (FirstName);
74
}
75
76
/*
77
 *	int _nc_name_match(namelist, name, delim)
78
 *
79
 *	Is the given name matched in namelist?
80
 */
81
82
NCURSES_EXPORT(int)
83
_nc_name_match(const char *const namelst, const char *const name, const char *const delim)
84
{
85
    const char *s, *d, *t;
86
    int code, found;
87
88
    if ((s = namelst) != 0) {
89
	while (*s != '\0') {
90
	    for (d = name; *d != '\0'; d++) {
91
		if (*s != *d)
92
		    break;
93
		s++;
94
	    }
95
	    found = FALSE;
96
	    for (code = TRUE; *s != '\0'; code = FALSE, s++) {
97
		for (t = delim; *t != '\0'; t++) {
98
		    if (*s == *t) {
99
			found = TRUE;
100
			break;
101
		    }
102
		}
103
		if (found)
104
		    break;
105
	    }
106
	    if (code && *d == '\0')
107
		return code;
108
	    if (*s++ == 0)
109
		break;
110
	}
111
    }
112
    return FALSE;
113
}