1 /* 2 * Copyright (c) 1989, 1993, 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * $FreeBSD$ 34 */ 35 36 37 #include <ctype.h> 38 #include <locale.h> 39 #include <stdio.h> 40 #include <string.h> 41 #include <sys/types.h> 42 #include <time.h> 43 #include <sys/uio.h> 44 #include <string.h> 45 #include <stdlib.h> 46 #include <err.h> 47 48 #include "pathnames.h" 49 #include "calendar.h" 50 51 struct tm *tp; 52 int *cumdays, offset, yrdays; 53 char dayname[10]; 54 55 56 /* 1-based month, 0-based days, cumulative */ 57 int daytab[][14] = { 58 { 0, -1, 30, 58, 89, 119, 150, 180, 211, 242, 272, 303, 333, 364 }, 59 { 0, -1, 30, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365 }, 60 }; 61 62 static char *days[] = { 63 "sun", "mon", "tue", "wed", "thu", "fri", "sat", NULL, 64 }; 65 66 static char *months[] = { 67 "jan", "feb", "mar", "apr", "may", "jun", 68 "jul", "aug", "sep", "oct", "nov", "dec", NULL, 69 }; 70 71 static struct fixs fndays[8]; /* full national days names */ 72 static struct fixs ndays[8]; /* short national days names */ 73 74 static struct fixs fnmonths[13]; /* full national months names */ 75 static struct fixs nmonths[13]; /* short national month names */ 76 77 78 void setnnames(void) 79 { 80 char buf[80]; 81 int i, l; 82 struct tm tm; 83 84 for (i = 0; i < 7; i++) { 85 tm.tm_wday = i; 86 strftime(buf, sizeof(buf), "%a", &tm); 87 for (l = strlen(buf); 88 l > 0 && isspace((unsigned char)buf[l - 1]); 89 l--) 90 ; 91 buf[l] = '\0'; 92 if (ndays[i].name != NULL) 93 free(ndays[i].name); 94 if ((ndays[i].name = strdup(buf)) == NULL) 95 errx(1, "cannot allocate memory"); 96 ndays[i].len = strlen(buf); 97 98 strftime(buf, sizeof(buf), "%A", &tm); 99 for (l = strlen(buf); 100 l > 0 && isspace((unsigned char)buf[l - 1]); 101 l--) 102 ; 103 buf[l] = '\0'; 104 if (fndays[i].name != NULL) 105 free(fndays[i].name); 106 if ((fndays[i].name = strdup(buf)) == NULL) 107 errx(1, "cannot allocate memory"); 108 fndays[i].len = strlen(buf); 109 } 110 111 for (i = 0; i < 12; i++) { 112 tm.tm_mon = i; 113 strftime(buf, sizeof(buf), "%b", &tm); 114 for (l = strlen(buf); 115 l > 0 && isspace((unsigned char)buf[l - 1]); 116 l--) 117 ; 118 buf[l] = '\0'; 119 if (nmonths[i].name != NULL) 120 free(nmonths[i].name); 121 if ((nmonths[i].name = strdup(buf)) == NULL) 122 errx(1, "cannot allocate memory"); 123 nmonths[i].len = strlen(buf); 124 125 strftime(buf, sizeof(buf), "%B", &tm); 126 for (l = strlen(buf); 127 l > 0 && isspace((unsigned char)buf[l - 1]); 128 l--) 129 ; 130 buf[l] = '\0'; 131 if (fnmonths[i].name != NULL) 132 free(fnmonths[i].name); 133 if ((fnmonths[i].name = strdup(buf)) == NULL) 134 errx(1, "cannot allocate memory"); 135 fnmonths[i].len = strlen(buf); 136 } 137 } 138 139 void 140 settime(now) 141 time_t now; 142 { 143 tp = localtime(&now); 144 if ( isleap(tp->tm_year + 1900) ) { 145 yrdays = 366; 146 cumdays = daytab[1]; 147 } else { 148 yrdays = 365; 149 cumdays = daytab[0]; 150 } 151 /* Friday displays Monday's events */ 152 offset = tp->tm_wday == 5 ? 3 : 1; 153 header[5].iov_base = dayname; 154 155 (void) setlocale(LC_TIME, "C"); 156 header[5].iov_len = strftime(dayname, sizeof(dayname), "%A", tp); 157 (void) setlocale(LC_TIME, ""); 158 159 setnnames(); 160 } 161 162 /* convert Day[/Month][/Year] into unix time (since 1970) 163 * Day: two digits, Month: two digits, Year: digits 164 */ 165 time_t Mktime (dp) 166 char *dp; 167 { 168 time_t t; 169 int d, m, y; 170 struct tm tm; 171 172 (void)time(&t); 173 tp = localtime(&t); 174 175 tm.tm_sec = 0; 176 tm.tm_min = 0; 177 tm.tm_hour = 0; 178 tm.tm_wday = 0; 179 tm.tm_mday = tp->tm_mday; 180 tm.tm_mon = tp->tm_mon; 181 tm.tm_year = tp->tm_year; 182 183 switch (sscanf(dp, "%d.%d.%d", &d, &m, &y)) { 184 case 3: 185 if (y > 1900) 186 y -= 1900; 187 tm.tm_year = y; 188 /* FALLTHROUGH */ 189 case 2: 190 tm.tm_mon = m - 1; 191 /* FALLTHROUGH */ 192 case 1: 193 tm.tm_mday = d; 194 } 195 196 #ifdef DEBUG 197 fprintf(stderr, "Mktime: %d %d %d %s\n", (int)mktime(&tm), (int)t, len, 198 asctime(&tm)); 199 #endif 200 return(mktime(&tm)); 201 } 202 203 /* 204 * Possible date formats include any combination of: 205 * 3-charmonth (January, Jan, Jan) 206 * 3-charweekday (Friday, Monday, mon.) 207 * numeric month or day (1, 2, 04) 208 * 209 * Any character may separate them, or they may not be separated. Any line, 210 * following a line that is matched, that starts with "whitespace", is shown 211 * along with the matched line. 212 */ 213 int 214 isnow(endp, monthp, dayp, varp) 215 char *endp; 216 int *monthp; 217 int *dayp; 218 int *varp; 219 { 220 int day, flags, month = 0, v1, v2; 221 222 /* 223 * CONVENTION 224 * 225 * Month: 1-12 226 * Monthname: Jan .. Dec 227 * Day: 1-31 228 * Weekday: Mon-Sun 229 * 230 */ 231 232 flags = 0; 233 234 /* read first field */ 235 /* didn't recognize anything, skip it */ 236 if (!(v1 = getfield(endp, &endp, &flags))) 237 return (0); 238 239 /* Easter or Easter depending days */ 240 if (flags & F_EASTER) 241 day = v1 - 1; /* days since January 1 [0-365] */ 242 243 /* 244 * 1. {Weekday,Day} XYZ ... 245 * 246 * where Day is > 12 247 */ 248 else if (flags & F_ISDAY || v1 > 12) { 249 250 /* found a day; day: 1-31 or weekday: 1-7 */ 251 day = v1; 252 253 /* {Day,Weekday} {Month,Monthname} ... */ 254 /* if no recognizable month, assume just a day alone 255 * in other words, find month or use current month */ 256 if (!(month = getfield(endp, &endp, &flags))) 257 month = tp->tm_mon + 1; 258 } 259 260 /* 2. {Monthname} XYZ ... */ 261 else if (flags & F_ISMONTH) { 262 month = v1; 263 264 /* Monthname {day,weekday} */ 265 /* if no recognizable day, assume the first day in month */ 266 if (!(day = getfield(endp, &endp, &flags))) 267 day = 1; 268 } 269 270 /* Hm ... */ 271 else { 272 v2 = getfield(endp, &endp, &flags); 273 274 /* 275 * {Day} {Monthname} ... 276 * where Day <= 12 277 */ 278 if (flags & F_ISMONTH) { 279 day = v1; 280 month = v2; 281 *varp = 0; 282 } 283 284 /* {Month} {Weekday,Day} ... */ 285 else { 286 /* F_ISDAY set, v2 > 12, or no way to tell */ 287 month = v1; 288 /* if no recognizable day, assume the first */ 289 day = v2 ? v2 : 1; 290 *varp = 0; 291 } 292 } 293 294 /* convert Weekday into *next* Day, 295 * e.g.: 'Sunday' -> 22 296 * 'SundayLast' -> ?? 297 */ 298 if (flags & F_ISDAY) { 299 #ifdef DEBUG 300 fprintf(stderr, "\nday: %d %s month %d\n", day, endp, month); 301 #endif 302 303 *varp = 1; 304 /* variable weekday, SundayLast, MondayFirst ... */ 305 if (day < 0 || day >= 10) { 306 307 /* negative offset; last, -4 .. -1 */ 308 if (day < 0) { 309 v1 = day/10 - 1; /* offset -4 ... -1 */ 310 day = 10 + (day % 10); /* day 1 ... 7 */ 311 312 /* day, eg '22nd' */ 313 v2 = tp->tm_mday + (((day - 1) - tp->tm_wday + 7) % 7); 314 315 /* (month length - day) / 7 + 1 */ 316 if (cumdays[month+1] - cumdays[month] >= v2 317 && ((int)((cumdays[month+1] - 318 cumdays[month] - v2) / 7) + 1) == -v1) 319 /* bingo ! */ 320 day = v2; 321 322 /* set to yesterday */ 323 else { 324 day = tp->tm_mday - 1; 325 if (day == 0) 326 return (0); 327 } 328 } 329 330 /* first, second ... +1 ... +5 */ 331 else { 332 v1 = day/10; /* offset: +1 (first Sunday) ... */ 333 day = day % 10; 334 335 /* day, eg '22th' */ 336 v2 = tp->tm_mday + (((day - 1) - tp->tm_wday + 7) % 7); 337 338 /* Hurrah! matched */ 339 if ( ((v2 - 1 + 7) / 7) == v1 ) 340 day = v2; 341 342 /* set to yesterday */ 343 else { 344 day = tp->tm_mday - 1; 345 if (day == 0) 346 return (0); 347 } 348 } 349 } 350 351 /* wired */ 352 else { 353 day = tp->tm_mday + (((day - 1) - tp->tm_wday + 7) % 7); 354 *varp = 1; 355 } 356 } 357 358 if (!(flags & F_EASTER)) { 359 *monthp = month; 360 *dayp = day; 361 day = cumdays[month] + day; 362 } 363 else { 364 for (v1 = 0; day > cumdays[v1]; v1++) 365 ; 366 *monthp = v1 - 1; 367 *dayp = day - cumdays[v1 - 1]; 368 *varp = 1; 369 } 370 371 #ifdef DEBUG 372 fprintf(stderr, "day2: day %d(%d-%d) yday %d\n", *dayp, day, cumdays[month], tp->tm_yday); 373 #endif 374 /* if today or today + offset days */ 375 if (day >= tp->tm_yday - f_dayBefore && 376 day <= tp->tm_yday + offset + f_dayAfter) 377 return (1); 378 379 /* if number of days left in this year + days to event in next year */ 380 if (yrdays - tp->tm_yday + day <= offset + f_dayAfter || 381 /* a year backward, eg. 6 Jan and 10 days before -> 27. Dec */ 382 tp->tm_yday + day - f_dayBefore < 0 383 ) 384 return (1); 385 return (0); 386 } 387 388 389 int 390 getmonth(s) 391 register char *s; 392 { 393 register char **p; 394 struct fixs *n; 395 396 for (n = fnmonths; n->name; ++n) 397 if (!strncasecmp(s, n->name, n->len)) 398 return ((n - fnmonths) + 1); 399 for (n = nmonths; n->name; ++n) 400 if (!strncasecmp(s, n->name, n->len)) 401 return ((n - nmonths) + 1); 402 for (p = months; *p; ++p) 403 if (!strncasecmp(s, *p, 3)) 404 return ((p - months) + 1); 405 return (0); 406 } 407 408 409 int 410 getday(s) 411 register char *s; 412 { 413 register char **p; 414 struct fixs *n; 415 416 for (n = fndays; n->name; ++n) 417 if (!strncasecmp(s, n->name, n->len)) 418 return ((n - fndays) + 1); 419 for (n = ndays; n->name; ++n) 420 if (!strncasecmp(s, n->name, n->len)) 421 return ((n - ndays) + 1); 422 for (p = days; *p; ++p) 423 if (!strncasecmp(s, *p, 3)) 424 return ((p - days) + 1); 425 return (0); 426 } 427 428 /* return offset for variable weekdays 429 * -1 -> last weekday in month 430 * +1 -> first weekday in month 431 * ... etc ... 432 */ 433 int 434 getdayvar(s) 435 register char *s; 436 { 437 register int offset; 438 439 440 offset = strlen(s); 441 442 443 /* Sun+1 or Wednesday-2 444 * ^ ^ */ 445 446 /* fprintf(stderr, "x: %s %s %d\n", s, s + offset - 2, offset); */ 447 switch(*(s + offset - 2)) { 448 case '-': 449 return(-(atoi(s + offset - 1))); 450 break; 451 case '+': 452 return(atoi(s + offset - 1)); 453 break; 454 } 455 456 457 /* 458 * some aliases: last, first, second, third, fourth 459 */ 460 461 /* last */ 462 if (offset > 4 && !strcasecmp(s + offset - 4, "last")) 463 return(-1); 464 else if (offset > 5 && !strcasecmp(s + offset - 5, "first")) 465 return(+1); 466 else if (offset > 6 && !strcasecmp(s + offset - 6, "second")) 467 return(+2); 468 else if (offset > 5 && !strcasecmp(s + offset - 5, "third")) 469 return(+3); 470 else if (offset > 6 && !strcasecmp(s + offset - 6, "fourth")) 471 return(+4); 472 473 474 /* no offset detected */ 475 return(0); 476 } 477