Mercurial > masqmail
view src/tables.c @ 0:08114f7dcc23 0.2.21
this is masqmail-0.2.21 from oliver kurth
author | meillo@marmaro.de |
---|---|
date | Fri, 26 Sep 2008 17:05:23 +0200 |
parents | |
children | 26e34ae9a3e3 |
line wrap: on
line source
/* MasqMail Copyright (C) 1999-2001 Oliver Kurth This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #include "masqmail.h" #include <fnmatch.h> table_pair *create_pair(gchar *key, gpointer value) { table_pair *pair; pair = g_malloc(sizeof(table_pair)); pair->key = g_strdup(key); pair->value = value; return pair; } table_pair *create_pair_string(gchar *key, gpointer value) { table_pair *pair; pair = g_malloc(sizeof(table_pair)); pair->key = g_strdup(key); pair->value = (gpointer)(g_strdup(value)); return pair; } table_pair *parse_table_pair(gchar *line, char delim) { gchar buf[256]; gchar *p, *q; table_pair *pair; p = line; q = buf; while((*p != 0) && (*p != delim) && q < buf+255) *(q++) = *(p++); *q = 0; pair = g_malloc(sizeof(table_pair)); pair->key = g_strdup(g_strstrip(buf)); if(*p){ p++; /* while(isspace(*p)) p++; */ pair->value = (gpointer *)(g_strdup(g_strstrip(p))); }else pair->value = (gpointer *)g_strdup(""); return pair; } gpointer *table_find_func(GList *table_list, gchar *key, int (*cmp_func)(const char *, const char *)) { GList *node; foreach(table_list, node){ table_pair *pair = (table_pair *)(node->data); if(cmp_func(pair->key, key) == 0) return pair->value; } return NULL; } gpointer *table_find(GList *table_list, gchar *key) { return table_find_func(table_list, key, strcmp); } gpointer *table_find_case(GList *table_list, gchar *key) { return table_find_func(table_list, key, strcasecmp); } static int fnmatch0(const char *pattern, const char *string) { return fnmatch(pattern, string, 0); } gpointer *table_find_fnmatch(GList *table_list, gchar *key) { return table_find_func(table_list, key, fnmatch0); } GList *table_read(gchar *fname, gchar delim) { GList *list = NULL; FILE *fptr; if((fptr = fopen(fname, "rt"))){ gchar buf[256]; while(fgets(buf, 255, fptr)){ if(buf[0] && (buf[0] != '#') && (buf[0] != '\n')){ table_pair *pair; g_strchomp(buf); pair = parse_table_pair(buf, delim); list = g_list_append(list, pair); } } fclose(fptr); return list; } logwrite(LOG_ALERT, "could not open table file %s: %s\n", fname, strerror(errno)); return NULL; } void destroy_table(GList *table) { GList *node; foreach(table, node){ table_pair *p = (table_pair *)(node->data); g_free(p->key); g_free(p->value); g_free(p); } g_list_free(table); }