util.c
7.81 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
/* GNU mailutils - a suite of utilities for electronic mail
Copyright (C) 1999, 2001 Free Software Foundation, Inc.
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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "imap4d.h"
#include <ctype.h>
static int add2set (int **set, int *n, unsigned long val, size_t max);
static const char * sc2string (int rc);
/* FIXME: Some words are:
between double quotes, between parenthesis. */
char *
util_getword (char *s, char **save)
{
return strtok_r (s, " \r\n", save);
}
int
util_token (char *buf, size_t len, char **ptr)
{
char *start = *ptr;
size_t i;
/* Skip leading space. */
while (**ptr && **ptr == ' ')
(*ptr)++;
for (i = 1; **ptr && i < len; (*ptr)++, buf++, i++)
{
if (**ptr == ' ' || **ptr == '.'
|| **ptr == '(' || **ptr == ')'
|| **ptr == '[' || **ptr == ']'
|| **ptr == '<' || **ptr == '>')
{
/* Advance. */
if (start == (*ptr))
(*ptr)++;
break;
}
*buf = **ptr;
}
*buf = '\0';
/* Skip trailing space. */
while (**ptr && **ptr == ' ')
(*ptr)++;
return *ptr - start;;
}
/* Return in set an allocated array contain (n) numbers, for imap messsage set
set ::= sequence_num / (sequence_num ":" sequence_num) / (set "," set)
sequence_num ::= nz_number / "*"
;; * is the largest number in use. For message
;; sequence numbers, it is the number of messages
;; in the mailbox. For unique identifiers, it is
;; the unique identifier of the last message in
;; the mailbox.
nz_number ::= digit_nz *digit
FIXME: The algo below is to relaxe, things like <,,,> or <:12> or <20:10>
will not generate an error. */
int
util_msgset (char *s, int **set, int *n, int isuid)
{
unsigned long val = 0;
unsigned long low = 0;
int done = 0;
int status = 0;
size_t max = 0;
status = mailbox_messages_count (mbox, &max);
if (status != 0)
return status;
if (isuid)
{
message_t msg = NULL;
mailbox_get_message (mbox, max, &msg);
message_get_uid (msg, &max);
}
*n = 0;
*set = NULL;
while (*s)
{
switch (*s)
{
/* isdigit */
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
{
errno = 0;
val = strtoul (s, &s, 10);
if (val == ULONG_MAX && errno == ERANGE)
{
if (*set)
free (*set);
*n = 0;
return EINVAL;
}
if (low)
{
for (;low && low <= val; low++)
{
status = add2set (set, n, low, max);
if (status != 0)
return status;
}
low = 0;
}
else
{
status = add2set(set, n, val, max);
if (status != 0)
return status;
}
break;
}
case ':':
low = val + 1;
s++;
break;
case '*':
{
if (status != 0)
{
if (*set)
free (*set);
*n = 0;
return status;
}
val = max;
s++;
break;
}
case ',':
s++;
break;
default:
done = 1;
if (*set)
free (*set);
*n = 0;
return EINVAL;
} /* switch */
if (done)
break;
} /* while */
if (low)
{
for (;low && low <= val; low++)
{
status = add2set (set, n, low, max);
if (status != 0)
return status;
}
}
return 0;
}
int
util_send (const char *format, ...)
{
int status;
va_list ap;
va_start (ap, format);
status = vfprintf (ofile, format, ap);
va_end (ap);
return status;
}
int
util_out (int rc, const char *format, ...)
{
char *buf = NULL;
va_list ap;
va_start (ap, format);
vasprintf (&buf, format, ap);
va_end (ap);
fprintf (ofile, "* %s%s\r\n", sc2string (rc), buf);
free (buf);
return 0;
}
int
util_finish (struct imap4d_command *command, int rc, const char *format, ...)
{
char *buf = NULL;
const char *resp;
int new_state;
va_list ap;
va_start (ap, format);
vasprintf (&buf, format, ap);
va_end(ap);
resp = sc2string (rc);
fprintf (ofile, "%s %s%s %s\r\n", command->tag, resp, command->name, buf);
free (buf);
new_state = (rc == RESP_OK) ? command->success : command->failure;
if (new_state != STATE_NONE)
state = new_state;
return 0;
}
char *
imap4d_readline (int fd)
{
fd_set rfds;
struct timeval tv;
char buf[512], *ret = NULL;
int nread;
int total = 0;
int available;
FD_ZERO (&rfds);
FD_SET (fd, &rfds);
tv.tv_sec = timeout;
tv.tv_usec = 0;
do
{
if (timeout > 0)
{
available = select (fd + 1, &rfds, NULL, NULL, &tv);
if (!available)
util_quit (1); /* FIXME: Timeout, send a "* BYE". */
}
nread = read (fd, buf, sizeof (buf) - 1);
if (nread < 1)
util_quit (1); /* FIXME: dead socket, need to do something? */
buf[nread] = '\0';
ret = realloc (ret, (total + nread + 1) * sizeof (char));
if (ret == NULL)
util_quit (1); /* FIXME: ENOMEM, send a "* BYE" to the client. */
memcpy (ret + total, buf, nread + 1);
total += nread;
/* FIXME: handle literal strings here. */
}
while (memchr (buf, '\n', nread) == NULL);
for (nread = total; nread > 0; nread--)
if (ret[nread] == '\r' || ret[nread] == '\n')
ret[nread] = '\0';
return ret;
}
int
util_do_command (char *prompt)
{
char *sp = NULL, *tag, *cmd;
struct imap4d_command *command;
static struct imap4d_command nullcommand;
tag = util_getword (prompt, &sp);
cmd = util_getword (NULL, &sp);
if (!tag)
{
nullcommand.name = "";
nullcommand.tag = (char *)"*";
return util_finish (&nullcommand, RESP_BAD, "Null command");
}
else if (!cmd)
{
nullcommand.name = "";
nullcommand.tag = tag;
return util_finish (&nullcommand, RESP_BAD, "Missing arguments");
}
util_start (tag);
command = util_getcommand (cmd, imap4d_command_table);
if (command == NULL)
{
nullcommand.name = "";
nullcommand.tag = tag;
return util_finish (&nullcommand, RESP_BAD, "Invalid command");
}
command->tag = tag;
return command->func (command, sp);
}
int
util_upper (char *s)
{
if (!s)
return 0;
for (; *s; s++)
*s = toupper ((unsigned)*s);
return 0;
}
/* FIXME: What is this for? */
int
util_start (char *tag)
{
(void)tag;
return 0;
}
/* FIXME: Incomplete send errmsg to syslog, see pop3d:pop3_abquit(). */
void
util_quit (int err)
{
exit (err);
}
/* FIXME: What is this for? */
int
util_getstate (void)
{
return STATE_NONAUTH;
}
struct imap4d_command *
util_getcommand (char *cmd, struct imap4d_command command_table[])
{
size_t i, len = strlen (cmd);
for (i = 0; command_table[i].name != 0; i++)
{
if (strlen (command_table[i].name) == len &&
!strcasecmp (command_table[i].name, cmd))
return &command_table[i];
}
return NULL;
}
/* Status Code to String. */
static const char *
sc2string (int rc)
{
switch (rc)
{
case RESP_OK:
return "OK ";
case RESP_BAD:
return "BAD ";
case RESP_NO:
return "NO ";
case RESP_BYE:
return "BYE ";
}
return "";
}
static int
add2set (int **set, int *n, unsigned long val, size_t max)
{
int *tmp;
if (val == 0 || val > max
|| (tmp = realloc (*set, (*n + 1) * sizeof (**set))) == NULL)
{
if (*set)
free (*set);
*n = 0;
return ENOMEM;
}
*set = tmp;
(*set)[*n] = val;
(*n)++;
return 0;
}