3 * David L. Nugent. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
14 * THIS SOFTWARE IS PROVIDED BY DAVID L. NUGENT AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL DAVID L. NUGENT OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 static const char rcsid[] =
42 numerics(char const * str)
45 return (str[strspn(str, "0123456789x")] == '\0');
49 aindex(char const * arr[], char const ** str, int len)
55 l = strlen(strncpy(mystr, *str, len));
56 for (i = 0; i < l; i++)
57 mystr[i] = (char) tolower((unsigned char)mystr[i]);
58 for (i = 0; arr[i] && strcmp(mystr, arr[i]) != 0; i++);
61 else { /* Skip past it */
62 while (**str && isalpha((unsigned char)**str))
64 /* And any following whitespace */
65 while (**str && (**str == ',' || isspace((unsigned char)**str)))
72 weekday(char const ** str)
74 static char const *days[] =
75 {"sun", "mon", "tue", "wed", "thu", "fri", "sat", NULL};
77 return aindex(days, str, 3);
81 parse_datesub(char const * str, struct tm *t)
87 const char *valid_formats[] = {
112 "%H:%M\t%S %d-%b-%y",
113 "%H:%M\t%S %d-%b-%Y",
114 "%H:%M\t%S %d-%m-%y",
115 "%H:%M\t%S %d-%m-%Y",
120 "%d-%b-%y\t%H:%M:%S",
121 "%d-%b-%Y\t%H:%M:%S",
122 "%d-%m-%y\t%H:%M:%S",
123 "%d-%m-%Y\t%H:%M:%S",
127 l = newlocale(LC_ALL_MASK, "C", NULL);
129 memset(&tm, 0, sizeof(tm));
130 for (i=0; valid_formats[i] != NULL; i++) {
131 ret = strptime_l(str, valid_formats[i], &tm, l);
132 if (ret && *ret == '\0') {
133 t->tm_mday = tm.tm_mday;
134 t->tm_mon = tm.tm_mon;
135 t->tm_year = tm.tm_year;
136 t->tm_hour = tm.tm_hour;
137 t->tm_min = tm.tm_min;
138 t->tm_sec = tm.tm_sec;
146 errx(EXIT_FAILURE, "Invalid date");
151 * Parse time must be flexible, it handles the following formats:
152 * nnnnnnnnnnn UNIX timestamp (all numeric), 0 = now
153 * 0xnnnnnnnn UNIX timestamp in hexadecimal
154 * 0nnnnnnnnn UNIX timestamp in octal
156 * +nnnn[smhdwoy] Given time + nnnn hours, mins, days, weeks, months or years
157 * -nnnn[smhdwoy] Given time - nnnn hours, mins, days, weeks, months or years
158 * dd[ ./-]mmm[ ./-]yy Date }
159 * hh:mm:ss Time } May be combined
163 parse_date(time_t dt, char const * str)
173 while (*str && isspace((unsigned char)*str))
177 dt = strtol(str, &p, 0);
178 } else if (*str == '+' || *str == '-') {
179 val = strtol(str, &p, 0);
182 case 'H': /* hours */
187 case 'M': /* minutes */
191 case 'S': /* seconds */
196 dt += (val * 86400L);
199 case 'W': /* weeks */
200 dt += (val * 604800L);
203 case 'O': /* months */
205 T->tm_mon += (int) val;
209 case 'Y': /* years */
211 T->tm_year += (int) val;
216 if (T->tm_mday != i) {
219 dt -= (time_t) 86400L;
221 default: /* unknown */
222 break; /* leave untouched */
228 * Skip past any weekday prefix
231 strlcpy(tmp, str, sizeof(tmp));
236 * See if we can break off any timezone
238 while ((q = strrchr(tmp, ' ')) != NULL) {
239 if (strchr("(+-", q[1]) != NULL)
244 while (q[j] && isupper((unsigned char)q[j]))
253 parse_datesub(tmp, T);