1.1 --- a/src/suffix_fnc.c Sat Jul 25 18:28:01 2020 +0200
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,44 +0,0 @@
1.4 -/*
1.5 - * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
1.6 - * Copyright 2018 Mike Becker. All rights reserved.
1.7 - *
1.8 - * Redistribution and use in source and binary forms, with or without
1.9 - * modification, are permitted provided that the following conditions are met:
1.10 - *
1.11 - * 1. Redistributions of source code must retain the above copyright
1.12 - * notice, this list of conditions and the following disclaimer.
1.13 - *
1.14 - * 2. Redistributions in binary form must reproduce the above copyright
1.15 - * notice, this list of conditions and the following disclaimer in the
1.16 - * documentation and/or other materials provided with the distribution.
1.17 - *
1.18 - * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
1.19 - * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.20 - * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
1.21 - * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
1.22 - * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1.23 - * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
1.24 - * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
1.25 - * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
1.26 - * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
1.27 - * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1.28 - */
1.29 -
1.30 -#include "suffix_fnc.h"
1.31 -
1.32 -bool testSuffix(char* filename, string_list_t* list) {
1.33 - bool ret = false;
1.34 - int tokenlen, fnamelen = strlen(filename);
1.35 - for (int t = 0 ; t < list->count ; t++) {
1.36 - tokenlen = strlen(list->items[t]);
1.37 - if (fnamelen >= tokenlen && tokenlen > 0) {
1.38 - if (strncmp(filename+fnamelen-tokenlen,
1.39 - list->items[t], tokenlen) == 0) {
1.40 - ret = true;
1.41 - break;
1.42 - }
1.43 - }
1.44 - }
1.45 - return ret;
1.46 -}
1.47 -
