masqmail

view src/tables.c @ 246:4cff8638dd9b

find changesets by author, revision, files, or words in the commit message
SMTP client: tries EHLO now always first Changed the behavior of the SMTP client. Now always an EHLO greeting is sent, no matter what kind of greeting text the server had sent. If the EHLO failed, an HELO greeting is tried as fall back. This is the behavior RFC 2821 requires (section 3.2). This change will fix setups that were not possible to sent to a server because that requires AUTH but hadn't said ``ESMTP'' in its greeting message. See also: Debian bug #349211 Thanks to Steffen (inne)
author markus schnalke <meillo@marmaro.de>
date Thu, 28 Oct 2010 16:40:02 -0300
parents 3b344bf57162
children 41958685480d
line source
1 /* MasqMail
2 Copyright (C) 1999-2001 Oliver Kurth
3 Copyright (C) 2008 markus schnalke <meillo@marmaro.de>
4
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
9
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18 */
19
20 #include <fnmatch.h>
21
22 #include "masqmail.h"
23
24 table_pair*
25 create_pair(gchar * key, gpointer value)
26 {
27 table_pair *pair;
28
29 pair = g_malloc(sizeof(table_pair));
30 pair->key = g_strdup(key);
31 pair->value = value;
32
33 return pair;
34 }
35
36 table_pair*
37 create_pair_string(gchar * key, gpointer value)
38 {
39 table_pair *pair;
40
41 pair = g_malloc(sizeof(table_pair));
42 pair->key = g_strdup(key);
43 pair->value = (gpointer) (g_strdup(value));
44
45 return pair;
46 }
47
48 table_pair*
49 parse_table_pair(gchar * line, char delim)
50 {
51 gchar buf[256];
52 gchar *p, *q;
53 table_pair *pair;
54
55 p = line;
56 q = buf;
57 while ((*p != '\0') && (*p != delim) && q < buf + 255)
58 *(q++) = *(p++);
59 *q = '\0';
60
61 pair = g_malloc(sizeof(table_pair));
62 pair->key = g_strdup(g_strstrip(buf));
63
64 if (*p) {
65 p++;
66 /* while(isspace(*p)) p++; */
67 pair->value = (gpointer *) (g_strdup(g_strstrip(p)));
68 } else
69 pair->value = (gpointer *) g_strdup("");
70
71 return pair;
72 }
73
74 gpointer*
75 table_find_func(GList * table_list, gchar * key, int (*cmp_func) (const char *, const char *))
76 {
77 GList *node;
78
79 foreach(table_list, node) {
80 table_pair *pair = (table_pair *) (node->data);
81 if (cmp_func(pair->key, key) == 0)
82 return pair->value;
83 }
84 return NULL;
85 }
86
87 gpointer*
88 table_find(GList * table_list, gchar * key)
89 {
90 return table_find_func(table_list, key, strcmp);
91 }
92
93 gpointer*
94 table_find_case(GList * table_list, gchar * key)
95 {
96 return table_find_func(table_list, key, strcasecmp);
97 }
98
99 static int
100 fnmatch0(const char *pattern, const char *string)
101 {
102 return fnmatch(pattern, string, 0);
103 }
104
105 gpointer*
106 table_find_fnmatch(GList * table_list, gchar * key)
107 {
108 return table_find_func(table_list, key, fnmatch0);
109 }
110
111 GList*
112 table_read(gchar * fname, gchar delim)
113 {
114 GList *list = NULL;
115 FILE *fptr;
116
117 if ((fptr = fopen(fname, "rt"))) {
118 gchar buf[256];
119
120 while (fgets(buf, 255, fptr)) {
121 if (buf[0] && (buf[0] != '#') && (buf[0] != '\n')) {
122 table_pair *pair;
123 g_strchomp(buf);
124 pair = parse_table_pair(buf, delim);
125 list = g_list_append(list, pair);
126 }
127 }
128 fclose(fptr);
129 if (!list)
130 logwrite(LOG_NOTICE, "table file %s contained no entries\n", fname);
131 return list;
132 }
133 logwrite(LOG_ALERT, "could not open table file %s: %s."
134 " Thus no aliasing will be done\n", fname, strerror(errno));
135
136 return NULL;
137 }
138
139 void
140 destroy_table(GList * table)
141 {
142 GList *node;
143
144 foreach(table, node) {
145 table_pair *p = (table_pair *) (node->data);
146 g_free(p->key);
147 g_free(p->value);
148 g_free(p);
149 }
150 g_list_free(table);
151 }