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