xref: /freebsd/contrib/ncurses/progs/transform.c (revision 43c7dd6b597947c27cab4ebc5a67a8a3f5b7c58d)
106bfebdeSXin LI /****************************************************************************
2*e1865124SBaptiste Daroussin  * Copyright 2020 Thomas E. Dickey                                          *
3*e1865124SBaptiste Daroussin  * Copyright 2009-2010,2011 Free Software Foundation, Inc.                  *
406bfebdeSXin LI  *                                                                          *
506bfebdeSXin LI  * Permission is hereby granted, free of charge, to any person obtaining a  *
606bfebdeSXin LI  * copy of this software and associated documentation files (the            *
706bfebdeSXin LI  * "Software"), to deal in the Software without restriction, including      *
806bfebdeSXin LI  * without limitation the rights to use, copy, modify, merge, publish,      *
906bfebdeSXin LI  * distribute, distribute with modifications, sublicense, and/or sell       *
1006bfebdeSXin LI  * copies of the Software, and to permit persons to whom the Software is    *
1106bfebdeSXin LI  * furnished to do so, subject to the following conditions:                 *
1206bfebdeSXin LI  *                                                                          *
1306bfebdeSXin LI  * The above copyright notice and this permission notice shall be included  *
1406bfebdeSXin LI  * in all copies or substantial portions of the Software.                   *
1506bfebdeSXin LI  *                                                                          *
1606bfebdeSXin LI  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS  *
1706bfebdeSXin LI  * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF               *
1806bfebdeSXin LI  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.   *
1906bfebdeSXin LI  * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,   *
2006bfebdeSXin LI  * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR    *
2106bfebdeSXin LI  * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR    *
2206bfebdeSXin LI  * THE USE OR OTHER DEALINGS IN THE SOFTWARE.                               *
2306bfebdeSXin LI  *                                                                          *
2406bfebdeSXin LI  * Except as contained in this notice, the name(s) of the above copyright   *
2506bfebdeSXin LI  * holders shall not be used in advertising or otherwise to promote the     *
2606bfebdeSXin LI  * sale, use or other dealings in this Software without prior written       *
2706bfebdeSXin LI  * authorization.                                                           *
2806bfebdeSXin LI  ****************************************************************************/
2906bfebdeSXin LI 
3006bfebdeSXin LI /****************************************************************************
3106bfebdeSXin LI  *  Author: Thomas E. Dickey                                                *
3206bfebdeSXin LI  ****************************************************************************/
3306bfebdeSXin LI #include <progs.priv.h>
3406bfebdeSXin LI #include <string.h>
3506bfebdeSXin LI 
3606bfebdeSXin LI #include <transform.h>
3706bfebdeSXin LI 
38*e1865124SBaptiste Daroussin MODULE_ID("$Id: transform.c,v 1.4 2020/02/02 23:34:34 tom Exp $")
3906bfebdeSXin LI 
4006bfebdeSXin LI #ifdef SUFFIX_IGNORED
4106bfebdeSXin LI static void
trim_suffix(const char * a,size_t * len)4273f0a83dSXin LI trim_suffix(const char *a, size_t *len)
4306bfebdeSXin LI {
4406bfebdeSXin LI     const char ignore[] = SUFFIX_IGNORED;
4506bfebdeSXin LI 
4606bfebdeSXin LI     if (sizeof(ignore) != 0) {
4706bfebdeSXin LI 	bool trim = FALSE;
4873f0a83dSXin LI 	size_t need = (sizeof(ignore) - 1);
4906bfebdeSXin LI 
5006bfebdeSXin LI 	if (*len > need) {
5173f0a83dSXin LI 	    size_t first = *len - need;
5273f0a83dSXin LI 	    size_t n;
5306bfebdeSXin LI 	    trim = TRUE;
5406bfebdeSXin LI 	    for (n = first; n < *len; ++n) {
5506bfebdeSXin LI 		if (tolower(UChar(a[n])) != tolower(UChar(ignore[n - first]))) {
5606bfebdeSXin LI 		    trim = FALSE;
5706bfebdeSXin LI 		    break;
5806bfebdeSXin LI 		}
5906bfebdeSXin LI 	    }
6006bfebdeSXin LI 	    if (trim) {
6106bfebdeSXin LI 		*len -= need;
6206bfebdeSXin LI 	    }
6306bfebdeSXin LI 	}
6406bfebdeSXin LI     }
6506bfebdeSXin LI }
6606bfebdeSXin LI #else
6706bfebdeSXin LI #define trim_suffix(a, len)	/* nothing */
6806bfebdeSXin LI #endif
6906bfebdeSXin LI 
7006bfebdeSXin LI bool
same_program(const char * a,const char * b)7106bfebdeSXin LI same_program(const char *a, const char *b)
7206bfebdeSXin LI {
7373f0a83dSXin LI     size_t len_a = strlen(a);
7473f0a83dSXin LI     size_t len_b = strlen(b);
7506bfebdeSXin LI 
7606bfebdeSXin LI     trim_suffix(a, &len_a);
7706bfebdeSXin LI     trim_suffix(b, &len_b);
7806bfebdeSXin LI 
7906bfebdeSXin LI     return (len_a == len_b) && (strncmp(a, b, len_a) == 0);
8006bfebdeSXin LI }
81