1
/****************************************************************************
2
* Copyright (c) 2009 Free Software Foundation, Inc. *
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: *
12
* The above copyright notice and this permission notice shall be included *
13
* in all copies or substantial portions of the Software. *
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. *
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 *
27
****************************************************************************/
29
/****************************************************************************
30
* Author: Thomas E. Dickey *
31
****************************************************************************/
32
#include <progs.priv.h>
35
#include <transform.h>
37
MODULE_ID("$Id: transform.c,v 1.1 2009/03/14 19:08:28 tom Exp $")
41
trim_suffix(const char *a, unsigned *len)
43
const char ignore[] = SUFFIX_IGNORED;
45
if (sizeof(ignore) != 0) {
47
unsigned need = (sizeof(ignore) - 1);
50
unsigned first = *len - need;
53
for (n = first; n < *len; ++n) {
54
if (tolower(a[n]) != tolower(ignore[n - first])) {
66
#define trim_suffix(a, len) /* nothing */
70
same_program(const char *a, const char *b)
72
unsigned len_a = strlen(a);
73
unsigned len_b = strlen(b);
75
trim_suffix(a, &len_a);
76
trim_suffix(b, &len_b);
78
return (len_a == len_b) && (strncmp(a, b, len_a) == 0);