-
Notifications
You must be signed in to change notification settings - Fork 24
/
dates.c
406 lines (384 loc) · 9.88 KB
/
dates.c
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
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
/*
mairix - message index builder and finder for maildir folders.
**********************************************************************
* Copyright (C) Richard P. Curnow 2002-2004,2006
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
* 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.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
**********************************************************************
*/
#include <stdio.h>
#include <string.h>
#include <time.h>
#include <ctype.h>
#include <assert.h>
#include "mairix.h"
#include "dates.h"
#include "datescan.h"
static enum DATESCAN_TYPE discover_type(char *first, char *last)/*{{{*/
{
int current_state = 0;
int token;
char *p;
p = first;
while (p < last) {
token = datescan_char2tok[(int)*(unsigned char*)p];
current_state = datescan_next_state(current_state, token);
if (current_state < 0) break;
p++;
}
if (current_state < 0) {
return DS_FAILURE;
} else {
return datescan_attr[current_state];
}
}
/*}}}*/
static int match_month(char *p)/*{{{*/
{
if (!strncasecmp(p, "jan", 3)) return 1;
if (!strncasecmp(p, "feb", 3)) return 2;
if (!strncasecmp(p, "mar", 3)) return 3;
if (!strncasecmp(p, "apr", 3)) return 4;
if (!strncasecmp(p, "may", 3)) return 5;
if (!strncasecmp(p, "jun", 3)) return 6;
if (!strncasecmp(p, "jul", 3)) return 7;
if (!strncasecmp(p, "aug", 3)) return 8;
if (!strncasecmp(p, "sep", 3)) return 9;
if (!strncasecmp(p, "oct", 3)) return 10;
if (!strncasecmp(p, "nov", 3)) return 11;
if (!strncasecmp(p, "dec", 3)) return 12;
return 0;
}
/*}}}*/
static int year_fix(int y)/*{{{*/
{
if (y>100) {
return y-1900;
} else if (y < 70) {
/* 2000-2069 */
return y+100;
} else {
/* 1970-1999 */
return y;
}
}
/*}}}*/
static int last_day(int mon, int y) {/*{{{*/
/* mon in [0,11], y=year-1900 */
static unsigned char days[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
if (mon != 1) {
return days[mon];
} else {
/* Because 2000 was a leap year, we don't have to bother about the %100
* rule, at least not in this range of dates. */
if ((y % 4) == 0) {
return 29;
} else {
return 28;
}
}
}
/*}}}*/
static void set_day(struct tm *x, int y)/*{{{*/
{
if (y > x->tm_mday) {
/* Shorthand for that day in previous month */
if (x->tm_mon == 0) {
x->tm_mon = 11;
--x->tm_year;
} else {
--x->tm_mon;
}
}
x->tm_mday = y; /* Always */
}
/*}}}*/
static int is_later_dm(struct tm *x, int m, int d)/*{{{*/
{
int m1 = m-1;
return ((x->tm_mon < m1) || ((x->tm_mon == m1) && (x->tm_mday < d)));
}
/*}}}*/
static int scan_date_expr(char *first, char *last, struct tm *start, struct tm *end)/*{{{*/
{
enum DATESCAN_TYPE type;
time_t now;
time(&now);
type = discover_type(first, last);
if (type == DS_SCALED) {/*{{{*/
int v;
char *p;
time_t then;
p = first;
v = 0;
while (isdigit(*p)) {
v = (v*10) + (*p - '0');
p++;
}
switch(*p) {
case 'd': v *= 86400; break;
case 'w': v *= 7*86400; break;
case 'm': v *= 30*86400; break;
case 'y': v *= 365*86400; break;
default:
fprintf(stderr, "Unrecognized relative date scaling '%c'\n", *p);
return -1;
}
then = now - v;
if (start) {
*start = *localtime(&then);
}
if (end) {
*end = *localtime(&then);
}/*}}}*/
} else if (type == DS_FAILURE) {
fputs("Cannot parse date expression [", stderr);
fwrite(first, sizeof(char), last-first, stderr);
fputs("]\n", stderr);
return -1;
} else {
/* something else */
int v1, v3;
int m2; /* decoded month */
char *p;
v1 = v3 = m2 = 0;
p = first;
while (p < last && isdigit(*p)) {
v1 = (v1*10) + (*p - '0');
p++;
}
if (p < last) {
m2 = match_month(p);
p += 3;
if (m2 == 0) {
return -1; /* failure */
}
}
while (p < last && isdigit(*p)) {
v3 = (v3*10) + (*p - '0');
p++;
}
assert(p==last); /* should be true in all cases. */
switch (type) {
case DS_D:/*{{{*/
if (start) set_day(start, v1);
if (end) set_day(end, v1);
break;
/*}}}*/
case DS_Y:/*{{{*/
if (start) {
start->tm_mday = 1;
start->tm_mon = 0; /* January */
start->tm_year = year_fix(v1);
}
if (end) {
end->tm_mday = 31;
end->tm_mon = 11;
end->tm_year = year_fix(v1);
}
break;
/*}}}*/
case DS_YYMMDD:/*{{{*/
if (start) {
start->tm_mday = v1 % 100;
start->tm_mon = ((v1 / 100) % 100) - 1;
start->tm_year = year_fix(v1/10000);
}
if (end) {
end->tm_mday = v1 % 100;
end->tm_mon = ((v1 / 100) % 100) - 1;
end->tm_year = year_fix(v1/10000);
}
break;
/*}}}*/
case DS_M:/*{{{*/
if (start) {
if (m2-1 > start->tm_mon) --start->tm_year; /* shorthand for previous year */
start->tm_mon = m2-1;
start->tm_mday = 1;
}
if (end) {
if (m2-1 > end->tm_mon) --end->tm_year; /* shorthand for previous year */
end->tm_mon = m2-1;
end->tm_mday = last_day(m2-1, end->tm_year);
}
break;
/*}}}*/
case DS_DM:/*{{{*/
if (start) {
if (is_later_dm(start, m2, v1)) --start->tm_year; /* shorthand for previous year. */
start->tm_mon = m2-1;
start->tm_mday = v1;
}
if (end) {
if (is_later_dm(end, m2, v1)) --end->tm_year; /* shorthand for previous year. */
end->tm_mon = m2-1;
end->tm_mday = v1;
}
break;
/*}}}*/
case DS_MD:/*{{{*/
if (start) {
if (is_later_dm(start, m2, v3)) --start->tm_year; /* shorthand for previous year. */
start->tm_mon = m2-1;
start->tm_mday = v3;
}
if (end) {
if (is_later_dm(end, m2, v3)) --end->tm_year; /* shorthand for previous year. */
end->tm_mon = m2-1;
end->tm_mday = v3;
}
break;
/*}}}*/
case DS_DMY:/*{{{*/
if (start) {
start->tm_mon = m2-1;
start->tm_mday = v1;
start->tm_year = year_fix(v3);
}
if (end) {
end->tm_mon = m2-1;
end->tm_mday = v1;
end->tm_year = year_fix(v3);
}
break;
/*}}}*/
case DS_YMD:/*{{{*/
if (start) {
start->tm_mon = m2-1;
start->tm_mday = v3;
start->tm_year = year_fix(v1);
}
if (end) {
end->tm_mon = m2-1;
end->tm_mday = v3;
end->tm_year = year_fix(v1);
}
break;
/*}}}*/
case DS_MY:/*{{{*/
if (start) {
start->tm_year = year_fix(v3);
start->tm_mon = m2 - 1;
start->tm_mday = 1;
}
if (end) {
end->tm_year = year_fix(v3);
end->tm_mon = m2 - 1;
end->tm_mday = last_day(end->tm_mon, end->tm_year);
}
break;
/*}}}*/
case DS_YM:/*{{{*/
if (start) {
start->tm_year = year_fix(v1);
start->tm_mon = m2 - 1;
start->tm_mday = 1;
}
if (end) {
end->tm_year = year_fix(v1);
end->tm_mon = m2 - 1;
end->tm_mday = last_day(end->tm_mon, end->tm_year);
}
break;/*}}}*/
case DS_FAILURE:
return -1;
break;
case DS_SCALED:
assert(0);
break;
}
}
return 0;
}
/*}}}*/
int scan_date_string(char *in, time_t *start, int *has_start, time_t *end, int *has_end)/*{{{*/
{
char *hyphen;
time_t now;
struct tm start_tm, end_tm;
char *nullchar;
int status;
*has_start = *has_end = 0;
nullchar = in;
while (*nullchar) nullchar++;
time(&now);
start_tm = end_tm = *localtime(&now);
start_tm.tm_hour = 0;
start_tm.tm_min = 0;
start_tm.tm_sec = 0;
start_tm.tm_isdst = -1;
end_tm.tm_hour = 23;
end_tm.tm_min = 59;
end_tm.tm_sec = 59;
end_tm.tm_isdst = -1;
hyphen = strchr(in, '-');
if (!hyphen) {
/* Start and end are the same. */
*has_start = *has_end = 1;
status = scan_date_expr(in, nullchar, &start_tm, &end_tm);
if (status) return status;
*start = mktime(&start_tm);
*end = mktime(&end_tm);
return 0;
} else {
if (hyphen+1 < nullchar) {
*has_end = 1;
status = scan_date_expr(hyphen+1, nullchar, NULL, &end_tm);
if (status) return status;
*end = mktime(&end_tm);
start_tm = end_tm;
}
if (hyphen > in) {
*has_start = 1;
status = scan_date_expr(in, hyphen, &start_tm, NULL);
if (status) return status;
*start = mktime(&start_tm);
}
}
return 0;
}
/*}}}*/
#ifdef TEST
static void check(char *in)/*{{{*/
{
struct tm start, end;
int result;
result = scan_date_string(in, &start, &end);
if (result) printf("Conversion for <%s> failed\n", in);
else {
char buf1[128], buf2[128];
strftime(buf1, 128, "%d-%b-%Y", &start);
strftime(buf2, 128, "%d-%b-%Y", &end);
printf("Computed range for <%s> : %s - %s\n", in, buf1, buf2);
}
}
/*}}}*/
int main (int argc, char **argv)/*{{{*/
{
check("2w-1w");
check("4m-1w");
check("2002-2003");
check("may2002-2003");
check("2002may-2003");
check("feb98-15may99");
check("feb98-15may1999");
check("2feb98-1y");
check("02feb98-1y");
check("970617-20010618");
return 0;
}
/*}}}*/
#endif