blob: 67caf2d23f1a477726042b0f99d4b1ca5bd80d56 [file] [log] [blame]
Steve Kondikae271bc2015-11-15 02:50:53 +01001/****************************************************************************
micky3879b9f5e72025-07-08 18:04:53 -04002 * Copyright 2020 Thomas E. Dickey *
3 * Copyright 2009-2010,2011 Free Software Foundation, Inc. *
Steve Kondikae271bc2015-11-15 02:50:53 +01004 * *
5 * Permission is hereby granted, free of charge, to any person obtaining a *
6 * copy of this software and associated documentation files (the *
7 * "Software"), to deal in the Software without restriction, including *
8 * without limitation the rights to use, copy, modify, merge, publish, *
9 * distribute, distribute with modifications, sublicense, and/or sell *
10 * copies of the Software, and to permit persons to whom the Software is *
11 * furnished to do so, subject to the following conditions: *
12 * *
13 * The above copyright notice and this permission notice shall be included *
14 * in all copies or substantial portions of the Software. *
15 * *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
17 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
18 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
19 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
20 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
21 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
22 * THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
23 * *
24 * Except as contained in this notice, the name(s) of the above copyright *
25 * holders shall not be used in advertising or otherwise to promote the *
26 * sale, use or other dealings in this Software without prior written *
27 * authorization. *
28 ****************************************************************************/
29
30/****************************************************************************
31 * Author: Thomas E. Dickey *
32 ****************************************************************************/
33#include <progs.priv.h>
34#include <string.h>
35
36#include <transform.h>
37
micky3879b9f5e72025-07-08 18:04:53 -040038MODULE_ID("$Id: transform.c,v 1.4 2020/02/02 23:34:34 tom Exp $")
Steve Kondikae271bc2015-11-15 02:50:53 +010039
40#ifdef SUFFIX_IGNORED
41static void
42trim_suffix(const char *a, size_t *len)
43{
44 const char ignore[] = SUFFIX_IGNORED;
45
46 if (sizeof(ignore) != 0) {
47 bool trim = FALSE;
48 size_t need = (sizeof(ignore) - 1);
49
50 if (*len > need) {
51 size_t first = *len - need;
52 size_t n;
53 trim = TRUE;
54 for (n = first; n < *len; ++n) {
55 if (tolower(UChar(a[n])) != tolower(UChar(ignore[n - first]))) {
56 trim = FALSE;
57 break;
58 }
59 }
60 if (trim) {
61 *len -= need;
62 }
63 }
64 }
65}
66#else
67#define trim_suffix(a, len) /* nothing */
68#endif
69
70bool
71same_program(const char *a, const char *b)
72{
73 size_t len_a = strlen(a);
74 size_t len_b = strlen(b);
75
76 trim_suffix(a, &len_a);
77 trim_suffix(b, &len_b);
78
79 return (len_a == len_b) && (strncmp(a, b, len_a) == 0);
80}