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)
44 int rc = isdigit((unsigned char)*str);
47 while (isdigit((unsigned char)*str) || *str == 'x')
53 aindex(char const * arr[], char const ** str, int len)
59 l = strlen(strncpy(mystr, *str, len));
60 for (i = 0; i < l; i++)
61 mystr[i] = (char) tolower((unsigned char)mystr[i]);
62 for (i = 0; arr[i] && strcmp(mystr, arr[i]) != 0; i++);
65 else { /* Skip past it */
66 while (**str && isalpha((unsigned char)**str))
68 /* And any following whitespace */
69 while (**str && (**str == ',' || isspace((unsigned char)**str)))
76 weekday(char const ** str)
78 static char const *days[] =
79 {"sun", "mon", "tue", "wed", "thu", "fri", "sat", NULL};
81 return aindex(days, str, 3);
85 parse_datesub(char const * str, struct tm *t)
91 const char *valid_formats[] = {
116 "%H:%M\t%S %d-%b-%y",
117 "%H:%M\t%S %d-%b-%Y",
118 "%H:%M\t%S %d-%m-%y",
119 "%H:%M\t%S %d-%m-%Y",
124 "%d-%b-%y\t%H:%M:%S",
125 "%d-%b-%Y\t%H:%M:%S",
126 "%d-%m-%y\t%H:%M:%S",
127 "%d-%m-%Y\t%H:%M:%S",
131 l = newlocale(LC_ALL_MASK, "C", NULL);
133 memset(&tm, 0, sizeof(tm));
134 for (i=0; valid_formats[i] != NULL; i++) {
135 ret = strptime_l(str, valid_formats[i], &tm, l);
136 if (ret && *ret == '\0') {
137 t->tm_mday = tm.tm_mday;
138 t->tm_mon = tm.tm_mon;
139 t->tm_year = tm.tm_year;
140 t->tm_hour = tm.tm_hour;
141 t->tm_min = tm.tm_min;
142 t->tm_sec = tm.tm_sec;
150 errx(EXIT_FAILURE, "Invalid date");
155 * Parse time must be flexible, it handles the following formats:
156 * nnnnnnnnnnn UNIX timestamp (all numeric), 0 = now
157 * 0xnnnnnnnn UNIX timestamp in hexadecimal
158 * 0nnnnnnnnn UNIX timestamp in octal
160 * +nnnn[smhdwoy] Given time + nnnn hours, mins, days, weeks, months or years
161 * -nnnn[smhdwoy] Given time - nnnn hours, mins, days, weeks, months or years
162 * dd[ ./-]mmm[ ./-]yy Date }
163 * hh:mm:ss Time } May be combined
167 parse_date(time_t dt, char const * str)
177 while (*str && isspace((unsigned char)*str))
181 dt = strtol(str, &p, 0);
182 } else if (*str == '+' || *str == '-') {
183 val = strtol(str, &p, 0);
186 case 'H': /* hours */
191 case 'M': /* minutes */
195 case 'S': /* seconds */
200 dt += (val * 86400L);
203 case 'W': /* weeks */
204 dt += (val * 604800L);
207 case 'O': /* months */
209 T->tm_mon += (int) val;
213 case 'Y': /* years */
215 T->tm_year += (int) val;
220 if (T->tm_mday != i) {
223 dt -= (time_t) 86400L;
225 default: /* unknown */
226 break; /* leave untouched */
232 * Skip past any weekday prefix
235 strlcpy(tmp, str, sizeof(tmp));
240 * See if we can break off any timezone
242 while ((q = strrchr(tmp, ' ')) != NULL) {
243 if (strchr("(+-", q[1]) != NULL)
248 while (q[j] && isupper((unsigned char)q[j]))
257 parse_datesub(tmp, T);