universe@10: /*
universe@34:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. 
universe@48:  * Copyright 2017 Mike Becker. All rights reserved.
universe@34:  * 
universe@34:  * Redistribution and use in source and binary forms, with or without
universe@34:  * modification, are permitted provided that the following conditions are met:
universe@34:  * 
universe@34:  * 1. Redistributions of source code must retain the above copyright
universe@34:  * notice, this list of conditions and the following disclaimer.
universe@34:  * 
universe@34:  * 2. Redistributions in binary form must reproduce the above copyright
universe@34:  * notice, this list of conditions and the following disclaimer in the
universe@34:  * documentation and/or other materials provided with the distribution.
universe@34:  * 
universe@34:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@34:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@34:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
universe@34:  * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
universe@34:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
universe@34:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
universe@34:  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
universe@34:  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
universe@34:  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
universe@34:  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 
universe@34:  *
universe@10:  * suffix_fnc.c
universe@10:  *
universe@10:  *  Created on: 15.09.2011
universe@20:  *      Author: Mike
universe@10:  */
universe@10: 
universe@10: #include "suffix_fnc.h"
universe@10: 
universe@30: bool testSuffix(char* filename, string_list_t* list) {
universe@10:   bool ret = false;
universe@10:   int tokenlen, fnamelen = strlen(filename);
universe@30:   for (int t = 0 ; t < list->count ; t++) {
universe@30:     tokenlen = strlen(list->items[t]);
universe@10:     if (fnamelen >= tokenlen && tokenlen > 0) {
universe@10:       if (strncmp(filename+fnamelen-tokenlen,
universe@30:                   list->items[t], tokenlen) == 0) {
universe@10:         ret = true;
universe@10:         break;
universe@10:       }
universe@10:     }
universe@10:   }
universe@30:   return ret;
universe@10: }
universe@10: