2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
5 * David L. Nugent. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY DAVID L. NUGENT AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL DAVID L. NUGENT OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 static const char rcsid[] =
44 numerics(char const * str)
47 return (str[strspn(str, "0123456789x")] == '\0');
51 aindex(char const * arr[], char const ** str, int len)
57 l = strlen(strncpy(mystr, *str, len));
58 for (i = 0; i < l; i++)
59 mystr[i] = (char) tolower((unsigned char)mystr[i]);
60 for (i = 0; arr[i] && strcmp(mystr, arr[i]) != 0; i++);
63 else { /* Skip past it */
64 while (**str && isalpha((unsigned char)**str))
66 /* And any following whitespace */
67 while (**str && (**str == ',' || isspace((unsigned char)**str)))
74 weekday(char const ** str)
76 static char const *days[] =
77 {"sun", "mon", "tue", "wed", "thu", "fri", "sat", NULL};
79 return aindex(days, str, 3);
83 parse_datesub(char const * str, struct tm *t)
89 const char *valid_formats[] = {
114 "%H:%M\t%S %d-%b-%y",
115 "%H:%M\t%S %d-%b-%Y",
116 "%H:%M\t%S %d-%m-%y",
117 "%H:%M\t%S %d-%m-%Y",
122 "%d-%b-%y\t%H:%M:%S",
123 "%d-%b-%Y\t%H:%M:%S",
124 "%d-%m-%y\t%H:%M:%S",
125 "%d-%m-%Y\t%H:%M:%S",
129 l = newlocale(LC_ALL_MASK, "C", NULL);
131 memset(&tm, 0, sizeof(tm));
132 for (i=0; valid_formats[i] != NULL; i++) {
133 ret = strptime_l(str, valid_formats[i], &tm, l);
134 if (ret && *ret == '\0') {
135 t->tm_mday = tm.tm_mday;
136 t->tm_mon = tm.tm_mon;
137 t->tm_year = tm.tm_year;
138 t->tm_hour = tm.tm_hour;
139 t->tm_min = tm.tm_min;
140 t->tm_sec = tm.tm_sec;
148 errx(EXIT_FAILURE, "Invalid date");
153 * Parse time must be flexible, it handles the following formats:
154 * nnnnnnnnnnn UNIX timestamp (all numeric), 0 = now
155 * 0xnnnnnnnn UNIX timestamp in hexadecimal
156 * 0nnnnnnnnn UNIX timestamp in octal
158 * +nnnn[smhdwoy] Given time + nnnn hours, mins, days, weeks, months or years
159 * -nnnn[smhdwoy] Given time - nnnn hours, mins, days, weeks, months or years
160 * dd[ ./-]mmm[ ./-]yy Date }
161 * hh:mm:ss Time } May be combined
165 parse_date(time_t dt, char const * str)
175 while (*str && isspace((unsigned char)*str))
179 dt = strtol(str, &p, 0);
180 } else if (*str == '+' || *str == '-') {
181 val = strtol(str, &p, 0);
184 case 'H': /* hours */
189 case 'M': /* minutes */
193 case 'S': /* seconds */
198 dt += (val * 86400L);
201 case 'W': /* weeks */
202 dt += (val * 604800L);
205 case 'O': /* months */
207 T->tm_mon += (int) val;
211 case 'Y': /* years */
213 T->tm_year += (int) val;
218 if (T->tm_mday != i) {
221 dt -= (time_t) 86400L;
223 default: /* unknown */
224 break; /* leave untouched */
230 * Skip past any weekday prefix
233 strlcpy(tmp, str, sizeof(tmp));
238 * See if we can break off any timezone
240 while ((q = strrchr(tmp, ' ')) != NULL) {
241 if (strchr("(+-", q[1]) != NULL)
246 while (q[j] && isupper((unsigned char)q[j]))
255 parse_datesub(tmp, T);