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