1/****************************************************************************
2 * Copyright (c) 2009-2010,2011 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                                                *
31 ****************************************************************************/
32#include <progs.priv.h>
33#include <string.h>
34
35#include <transform.h>
36
37MODULE_ID("$Id: transform.c,v 1.3 2011/05/14 22:41:17 tom Exp $")
38
39#ifdef SUFFIX_IGNORED
40static void
41trim_suffix(const char *a, size_t *len)
42{
43    const char ignore[] = SUFFIX_IGNORED;
44
45    if (sizeof(ignore) != 0) {
46	bool trim = FALSE;
47	size_t need = (sizeof(ignore) - 1);
48
49	if (*len > need) {
50	    size_t first = *len - need;
51	    size_t n;
52	    trim = TRUE;
53	    for (n = first; n < *len; ++n) {
54		if (tolower(UChar(a[n])) != tolower(UChar(ignore[n - first]))) {
55		    trim = FALSE;
56		    break;
57		}
58	    }
59	    if (trim) {
60		*len -= need;
61	    }
62	}
63    }
64}
65#else
66#define trim_suffix(a, len)	/* nothing */
67#endif
68
69bool
70same_program(const char *a, const char *b)
71{
72    size_t len_a = strlen(a);
73    size_t len_b = strlen(b);
74
75    trim_suffix(a, &len_a);
76    trim_suffix(b, &len_b);
77
78    return (len_a == len_b) && (strncmp(a, b, len_a) == 0);
79}
80