| /*- |
| * Parts (strptime()) Copyright (c) 1997, 1998, 2005, 2008 The NetBSD Foundation, Inc. |
| * All rights reserved. |
| * |
| * This code was contributed to The NetBSD Foundation by Klaus Klein. |
| * Heavily optimised by David Laight |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * 1. Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * 2. Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS |
| * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
| * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS |
| * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| * POSSIBILITY OF SUCH DAMAGE. |
| */ |
| |
| #include <sys/types.h> |
| #include <sys/stat.h> |
| #include <assert.h> |
| #include <errno.h> |
| #include <fcntl.h> |
| #include <limits.h> |
| #include <string.h> |
| #include <unistd.h> |
| #include <stdlib.h> |
| #include <stddef.h> |
| #ifdef HAVE_ALLOCA_H |
| # include <alloca.h> |
| #elif !defined alloca |
| # ifdef __GNUC__ |
| # define alloca __builtin_alloca |
| # elif defined _MSC_VER |
| # include <malloc.h> |
| # define alloca _alloca |
| # elif !defined HAVE_ALLOCA |
| # ifdef __cplusplus |
| extern "C" |
| # endif |
| void *alloca (size_t); |
| # endif |
| #endif |
| |
| #ifdef WIN32 |
| #include <windows.h> |
| #include <processenv.h> |
| #include <shellapi.h> |
| #include <wchar.h> |
| #include <wtypes.h> |
| #endif |
| |
| |
| #include "util.h" |
| #include "jq.h" |
| #include "jv_alloc.h" |
| #include "jv_unicode.h" |
| |
| #ifdef WIN32 |
| FILE *fopen(const char *fname, const char *mode) { |
| size_t sz = sizeof(wchar_t) * MultiByteToWideChar(CP_UTF8, 0, fname, -1, NULL, 0); |
| wchar_t *wfname = alloca(sz + 2); // +2 is not needed, but just in case |
| MultiByteToWideChar(CP_UTF8, 0, fname, -1, wfname, sz); |
| |
| sz = sizeof(wchar_t) * MultiByteToWideChar(CP_UTF8, 0, mode, -1, NULL, 0); |
| wchar_t *wmode = alloca(sz + 2); // +2 is not needed, but just in case |
| MultiByteToWideChar(CP_UTF8, 0, mode, -1, wmode, sz); |
| return _wfopen(wfname, wmode); |
| } |
| #endif |
| |
| jv expand_path(jv path) { |
| assert(jv_get_kind(path) == JV_KIND_STRING); |
| const char *pstr = jv_string_value(path); |
| jv ret = path; |
| if (jv_string_length_bytes(jv_copy(path)) > 1 && pstr[0] == '~' && pstr[1] == '/') { |
| jv home = get_home(); |
| if (jv_is_valid(home)) { |
| ret = jv_string_fmt("%s/%s",jv_string_value(home),pstr+2); |
| jv_free(home); |
| } else { |
| jv emsg = jv_invalid_get_msg(home); |
| ret = jv_invalid_with_msg(jv_string_fmt("Could not expand %s. (%s)", pstr, jv_string_value(emsg))); |
| jv_free(emsg); |
| } |
| jv_free(path); |
| } |
| return ret; |
| } |
| |
| jv get_home(void) { |
| jv ret; |
| char *home = getenv("HOME"); |
| if (!home) { |
| #ifndef WIN32 |
| ret = jv_invalid_with_msg(jv_string("Could not find home directory.")); |
| #else |
| home = getenv("USERPROFILE"); |
| if (!home) { |
| home = getenv("HOMEPATH"); |
| if (!home) { |
| ret = jv_invalid_with_msg(jv_string("Could not find home directory.")); |
| } else { |
| const char *hd = getenv("HOMEDRIVE"); |
| if (!hd) hd = ""; |
| ret = jv_string_fmt("%s%s",hd,home); |
| } |
| } else { |
| ret = jv_string(home); |
| } |
| #endif |
| } else { |
| ret = jv_string(home); |
| } |
| return ret; |
| } |
| |
| |
| jv jq_realpath(jv path) { |
| int path_max; |
| char *buf = NULL; |
| #ifdef _PC_PATH_MAX |
| path_max = pathconf(jv_string_value(path),_PC_PATH_MAX); |
| #else |
| path_max = PATH_MAX; |
| #endif |
| if (path_max > 0) { |
| buf = jv_mem_alloc(path_max); |
| } |
| #ifdef WIN32 |
| char *tmp = _fullpath(buf, jv_string_value(path), path_max); |
| #else |
| char *tmp = realpath(jv_string_value(path), buf); |
| #endif |
| if (tmp == NULL) { |
| free(buf); |
| return path; |
| } |
| jv_free(path); |
| path = jv_string(tmp); |
| free(tmp); |
| return path; |
| } |
| |
| const void *_jq_memmem(const void *haystack, size_t haystacklen, |
| const void *needle, size_t needlelen) { |
| #ifdef HAVE_MEMMEM |
| return (const void*)memmem(haystack, haystacklen, needle, needlelen); |
| #else |
| const char *h = haystack; |
| const char *n = needle; |
| size_t hi, hi2, ni; |
| |
| if (haystacklen < needlelen || haystacklen == 0) |
| return NULL; |
| for (hi = 0; hi < (haystacklen - needlelen + 1); hi++) { |
| for (ni = 0, hi2 = hi; ni < needlelen; ni++, hi2++) { |
| if (h[hi2] != n[ni]) |
| goto not_this; |
| } |
| |
| return &h[hi]; |
| |
| not_this: |
| continue; |
| } |
| return NULL; |
| #endif /* !HAVE_MEMMEM */ |
| } |
| |
| struct jq_util_input_state { |
| jq_util_msg_cb err_cb; |
| void *err_cb_data; |
| jv_parser *parser; |
| FILE* current_input; |
| char **files; |
| int nfiles; |
| int curr_file; |
| int failures; |
| jv slurped; |
| char buf[4096]; |
| size_t buf_valid_len; |
| jv current_filename; |
| size_t current_line; |
| }; |
| |
| static void fprinter(void *data, const char *fname) { |
| fprintf((FILE *)data, "jq: error: Could not open file %s: %s\n", fname, strerror(errno)); |
| } |
| |
| // If parser == NULL -> RAW |
| jq_util_input_state *jq_util_input_init(jq_util_msg_cb err_cb, void *err_cb_data) { |
| if (err_cb == NULL) { |
| err_cb = fprinter; |
| err_cb_data = stderr; |
| } |
| jq_util_input_state *new_state = jv_mem_calloc(1, sizeof(*new_state)); |
| new_state->err_cb = err_cb; |
| new_state->err_cb_data = err_cb_data; |
| new_state->slurped = jv_invalid(); |
| new_state->current_filename = jv_invalid(); |
| |
| return new_state; |
| } |
| |
| void jq_util_input_set_parser(jq_util_input_state *state, jv_parser *parser, int slurp) { |
| assert(!jv_is_valid(state->slurped)); |
| state->parser = parser; |
| |
| if (parser == NULL && slurp) |
| state->slurped = jv_string(""); |
| else if (slurp) |
| state->slurped = jv_array(); |
| else |
| state->slurped = jv_invalid(); |
| } |
| |
| void jq_util_input_free(jq_util_input_state **state) { |
| jq_util_input_state *old_state = *state; |
| *state = NULL; |
| if (old_state == NULL) |
| return; |
| |
| if (old_state->parser != NULL) |
| jv_parser_free(old_state->parser); |
| for (int i = 0; i < old_state->nfiles; i++) |
| free(old_state->files[i]); |
| free(old_state->files); |
| jv_free(old_state->slurped); |
| jv_free(old_state->current_filename); |
| jv_mem_free(old_state); |
| } |
| |
| void jq_util_input_add_input(jq_util_input_state *state, const char *fname) { |
| state->files = jv_mem_realloc(state->files, (state->nfiles + 1) * sizeof(state->files[0])); |
| state->files[state->nfiles++] = jv_mem_strdup(fname); |
| } |
| |
| int jq_util_input_errors(jq_util_input_state *state) { |
| return state->failures; |
| } |
| |
| static const char *next_file(jq_util_input_state *state) { |
| if (state->curr_file < state->nfiles) |
| return state->files[state->curr_file++]; |
| return NULL; |
| } |
| |
| static int jq_util_input_read_more(jq_util_input_state *state) { |
| if (!state->current_input || feof(state->current_input) || ferror(state->current_input)) { |
| if (state->current_input && ferror(state->current_input)) { |
| // System-level input error on the stream. It will be closed (below). |
| // TODO: report it. Can't use 'state->err_cb()' as it is hard-coded for |
| // 'open' related problems. |
| fprintf(stderr,"jq: error: %s\n", strerror(errno)); |
| } |
| if (state->current_input) { |
| if (state->current_input == stdin) { |
| clearerr(stdin); // perhaps we can read again; anyways, we don't fclose(stdin) |
| } else { |
| fclose(state->current_input); |
| } |
| state->current_input = NULL; |
| } |
| const char *f = next_file(state); |
| if (f != NULL) { |
| jv_free(state->current_filename); |
| state->current_line = 0; |
| if (!strcmp(f, "-")) { |
| state->current_input = stdin; |
| state->current_filename = jv_string("<stdin>"); |
| } else { |
| state->current_input = fopen(f, "r"); |
| state->current_filename = jv_string(f); |
| if (!state->current_input) { |
| state->err_cb(state->err_cb_data, f); |
| state->failures++; |
| } |
| } |
| } |
| } |
| |
| state->buf[0] = 0; |
| state->buf_valid_len = 0; |
| if (state->current_input) { |
| char *res; |
| memset(state->buf, 0xff, sizeof(state->buf)); |
| |
| const int max_utf8_len = 4; |
| const int max_gets_len = sizeof(state->buf) - max_utf8_len; |
| while (!(res = fgets(state->buf, max_gets_len, state->current_input)) && |
| ferror(state->current_input) && errno == EINTR) |
| clearerr(state->current_input); |
| if (res == NULL) { |
| state->buf[0] = 0; |
| if (ferror(state->current_input)) |
| state->failures++; |
| } else { |
| const char *p = memchr(state->buf, '\n', max_gets_len); |
| |
| if (p != NULL) |
| state->current_line++; |
| |
| if (p == NULL && feof(state->current_input)) { |
| size_t i; |
| |
| /* |
| * XXX We don't know how many bytes we've read! |
| * |
| * We can't use getline() because there need not be any newlines |
| * in the input. The only entirely correct choices are: use |
| * fgetc() or fread(). Using fread() will complicate buffer |
| * management here. |
| * |
| * For now we check how much fgets() read by scanning backwards for the |
| * terminating '\0'. This only works because we previously memset our |
| * buffer with something nonzero. |
| */ |
| for (i = max_gets_len - 1; i > 0; i--) { |
| if (state->buf[i] == '\0') |
| break; |
| } |
| state->buf_valid_len = i; |
| } else if (p == NULL) { |
| state->buf_valid_len = max_gets_len - 1; |
| char *end = state->buf + state->buf_valid_len; |
| int len = 0; |
| if (jvp_utf8_backtrack(end - 1, state->buf, &len) && len > 0) { |
| state->buf_valid_len += fread(end, 1, len, state->current_input); |
| } |
| } else { |
| state->buf_valid_len = (p - state->buf) + 1; |
| } |
| } |
| } |
| return state->curr_file == state->nfiles && !state->current_input; |
| } |
| |
| jv jq_util_input_next_input_cb(jq_state *jq, void *data) { |
| return jq_util_input_next_input((jq_util_input_state *)data); |
| } |
| |
| // Return the current_filename:current_line |
| jv jq_util_input_get_position(jq_state *jq) { |
| jq_input_cb cb = NULL; |
| void *cb_data = NULL; |
| jq_get_input_cb(jq, &cb, &cb_data); |
| assert(cb == jq_util_input_next_input_cb); |
| if (cb != jq_util_input_next_input_cb) |
| return jv_invalid_with_msg(jv_string("Invalid jq_util_input API usage")); |
| jq_util_input_state *s = (jq_util_input_state *)cb_data; |
| |
| // We can't assert that current_filename is a string because if |
| // the error was a JSON parser error then we may not have set |
| // current_filename yet. |
| if (jv_get_kind(s->current_filename) != JV_KIND_STRING) |
| return jv_string("<unknown>"); |
| |
| jv v = jv_string_fmt("%s:%lu", jv_string_value(s->current_filename), (unsigned long)s->current_line); |
| return v; |
| } |
| |
| jv jq_util_input_get_current_filename(jq_state* jq) { |
| jq_input_cb cb=NULL; |
| void *cb_data=NULL; |
| jq_get_input_cb(jq, &cb, &cb_data); |
| if (cb != jq_util_input_next_input_cb) |
| return jv_invalid_with_msg(jv_string("Unknown input filename")); |
| jq_util_input_state *s = (jq_util_input_state *)cb_data; |
| jv v = jv_copy(s->current_filename); |
| return v; |
| } |
| |
| jv jq_util_input_get_current_line(jq_state* jq) { |
| jq_input_cb cb=NULL; |
| void *cb_data=NULL; |
| jq_get_input_cb(jq, &cb, &cb_data); |
| if (cb != jq_util_input_next_input_cb) |
| return jv_invalid_with_msg(jv_string("Unknown input line number")); |
| jq_util_input_state *s = (jq_util_input_state *)cb_data; |
| jv v = jv_number(s->current_line); |
| return v; |
| } |
| |
| |
| // Blocks to read one more input from stdin and/or given files |
| // When slurping, it returns just one value |
| jv jq_util_input_next_input(jq_util_input_state *state) { |
| int is_last = 0; |
| jv value = jv_invalid(); // need more input |
| do { |
| if (state->parser == NULL) { |
| // Raw input |
| is_last = jq_util_input_read_more(state); |
| if (state->buf_valid_len == 0) |
| continue; |
| if (jv_is_valid(state->slurped)) { |
| // Slurped raw input |
| state->slurped = jv_string_concat(state->slurped, jv_string_sized(state->buf, state->buf_valid_len)); |
| } else { |
| if (!jv_is_valid(value)) |
| value = jv_string(""); |
| if (state->buf[state->buf_valid_len-1] == '\n') { |
| // whole line |
| state->buf[state->buf_valid_len-1] = 0; |
| return jv_string_concat(value, jv_string_sized(state->buf, state->buf_valid_len-1)); |
| } |
| value = jv_string_concat(value, jv_string_sized(state->buf, state->buf_valid_len)); |
| state->buf[0] = '\0'; |
| state->buf_valid_len = 0; |
| } |
| } else { |
| if (jv_parser_remaining(state->parser) == 0) { |
| is_last = jq_util_input_read_more(state); |
| jv_parser_set_buf(state->parser, state->buf, state->buf_valid_len, !is_last); |
| } |
| value = jv_parser_next(state->parser); |
| if (jv_is_valid(state->slurped)) { |
| if (jv_is_valid(value)) { |
| state->slurped = jv_array_append(state->slurped, value); |
| value = jv_invalid(); |
| } else if (jv_invalid_has_msg(jv_copy(value))) |
| return value; // Not slurped parsed input |
| } else if (jv_is_valid(value) || jv_invalid_has_msg(jv_copy(value))) { |
| return value; |
| } |
| } |
| } while (!is_last); |
| |
| if (jv_is_valid(state->slurped)) { |
| value = state->slurped; |
| state->slurped = jv_invalid(); |
| } |
| return value; |
| } |
| |
| #ifndef HAVE_STRPTIME |
| /* http://cvsweb.netbsd.org/bsdweb.cgi/~checkout~/src/lib/libc/time/strptime.c?only_with_tag=HEAD |
| * NetBSD implementation strptime(). |
| * Format description: https://netbsd.gw.com/cgi-bin/man-cgi?strptime+3+NetBSD-current |
| * Adapted by https://github.com/res2001 (https://github.com/res2001/strptime). |
| */ |
| |
| #include <ctype.h> |
| #include <string.h> |
| #include <time.h> |
| #include <stdint.h> |
| |
| static const unsigned char *conv_num(const unsigned char *, int *, unsigned int, unsigned int); |
| static const unsigned char *find_string(const unsigned char *, int *, const char * const *, const char * const *, int); |
| |
| /* |
| * We do not implement alternate representations. However, we always |
| * check whether a given modifier is allowed for a certain conversion. |
| */ |
| #define ALT_E 0x01 |
| #define ALT_O 0x02 |
| #define LEGAL_ALT(x) { if (alt_format & ~(x)) return NULL; } |
| |
| #define TM_YEAR_BASE 1900 |
| |
| #define TM_SUNDAY 0 |
| #define TM_MONDAY 1 |
| #define TM_TUESDAY 2 |
| #define TM_WEDNESDAY 3 |
| #define TM_THURSDAY 4 |
| #define TM_FRIDAY 5 |
| #define TM_SATURDAY 6 |
| |
| #define S_YEAR (1 << 0) |
| #define S_MON (1 << 1) |
| #define S_YDAY (1 << 2) |
| #define S_MDAY (1 << 3) |
| #define S_WDAY (1 << 4) |
| #define S_HOUR (1 << 5) |
| |
| #define HAVE_MDAY(s) (s & S_MDAY) |
| #define HAVE_MON(s) (s & S_MON) |
| #define HAVE_WDAY(s) (s & S_WDAY) |
| #define HAVE_YDAY(s) (s & S_YDAY) |
| #define HAVE_YEAR(s) (s & S_YEAR) |
| #define HAVE_HOUR(s) (s & S_HOUR) |
| |
| #define SECSPERMIN 60 |
| #define MINSPERHOUR 60 |
| #define SECSPERHOUR (SECSPERMIN * MINSPERHOUR) |
| #define HOURSPERDAY 24 |
| |
| #define HERE_D_T_FMT "%a %b %e %H:%M:%S %Y" |
| #define HERE_D_FMT "%y/%m/%d" |
| #define HERE_T_FMT_AMPM "%I:%M:%S %p" |
| #define HERE_T_FMT "%H:%M:%S" |
| |
| #define isleap(y) (((y) % 4) == 0 && (((y) % 100) != 0 || ((y) % 400) == 0)) |
| |
| /* |
| ** Since everything in isleap is modulo 400 (or a factor of 400), we know that |
| ** isleap(y) == isleap(y % 400) |
| ** and so |
| ** isleap(a + b) == isleap((a + b) % 400) |
| ** or |
| ** isleap(a + b) == isleap(a % 400 + b % 400) |
| ** This is true even if % means modulo rather than Fortran remainder |
| ** (which is allowed by C89 but not by C99 or later). |
| ** We use this to avoid addition overflow problems. |
| */ |
| |
| #define isleap_sum(a, b) isleap((a) % 400 + (b) % 400) |
| |
| #ifdef _MSC_VER |
| #define tzname _tzname |
| #define strncasecmp _strnicmp |
| #endif |
| |
| #ifdef TM_ZONE |
| static char* utc = "UTC"; |
| #endif |
| /* RFC-822/RFC-2822 */ |
| static const char *const nast[] = { |
| "EST", "CST", "MST", "PST", "\0\0\0" |
| }; |
| static const char *const nadt[] = { |
| "EDT", "CDT", "MDT", "PDT", "\0\0\0" |
| }; |
| static const char *const weekday_name[] = |
| { |
| "Sunday", "Monday", "Tuesday", "Wednesday", |
| "Thursday", "Friday", "Saturday" |
| }; |
| static const char *const ab_weekday_name[] = |
| { |
| "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
| }; |
| static const char *const month_name[] = |
| { |
| "January", "February", "March", "April", "May", "June", |
| "July", "August", "September", "October", "November", "December" |
| }; |
| static const char *const ab_month_name[] = |
| { |
| "Jan", "Feb", "Mar", "Apr", "May", "Jun", |
| "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" |
| }; |
| static const char *const am_pm[] = {"AM", "PM"}; |
| |
| |
| /* |
| * Table to determine the ordinal date for the start of a month. |
| * Ref: http://en.wikipedia.org/wiki/ISO_week_date |
| */ |
| static const int start_of_month[2][13] = { |
| /* non-leap year */ |
| { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365 }, |
| /* leap year */ |
| { 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, 366 } |
| }; |
| |
| /* |
| * Calculate the week day of the first day of a year. Valid for |
| * the Gregorian calendar, which began Sept 14, 1752 in the UK |
| * and its colonies. Ref: |
| * http://en.wikipedia.org/wiki/Determination_of_the_day_of_the_week |
| */ |
| |
| static int |
| first_wday_of(int yr) |
| { |
| return ((2 * (3 - (yr / 100) % 4)) + (yr % 100) + ((yr % 100) / 4) + |
| (isleap(yr) ? 6 : 0) + 1) % 7; |
| } |
| |
| #define delim(p) ((p) == '\0' || isspace((unsigned char)(p))) |
| |
| static int |
| fromzone(const unsigned char **bp, struct tm *tm, int mandatory) |
| { |
| // timezone_t tz; |
| char buf[512], *p; |
| const unsigned char *rp; |
| |
| for (p = buf, rp = *bp; !delim(*rp) && p < &buf[sizeof(buf) - 1]; rp++) |
| *p++ = *rp; |
| *p = '\0'; |
| |
| if (mandatory) |
| *bp = rp; |
| if (!isalnum((unsigned char)*buf)) |
| return 0; |
| // tz = tzalloc(buf); |
| // if (tz == NULL) |
| // return 0; |
| |
| *bp = rp; |
| tm->tm_isdst = 0; /* XXX */ |
| #ifdef TM_GMTOFF |
| tm->TM_GMTOFF = tzgetgmtoff(tz, tm->tm_isdst); |
| #endif |
| #ifdef TM_ZONE |
| // Can't use tzgetname() here because we are going to free() |
| tm->TM_ZONE = NULL; /* XXX */ |
| #endif |
| // tzfree(tz); |
| return 1; |
| } |
| |
| char* strptime(const char *buf, const char *fmt, struct tm *tm) |
| { |
| unsigned char c; |
| const unsigned char *bp, *ep, *zname; |
| int alt_format, i, split_year = 0, neg = 0, state = 0, |
| day_offset = -1, week_offset = 0, offs, mandatory; |
| const char *new_fmt; |
| |
| bp = (const unsigned char *)buf; |
| |
| while (bp != NULL && (c = *fmt++) != '\0') { |
| /* Clear `alternate' modifier prior to new conversion. */ |
| alt_format = 0; |
| i = 0; |
| |
| /* Eat up white-space. */ |
| if (isspace(c)) { |
| while (isspace(*bp)) |
| bp++; |
| continue; |
| } |
| |
| if (c != '%') |
| goto literal; |
| |
| |
| again: switch (c = *fmt++) { |
| case '%': /* "%%" is converted to "%". */ |
| literal: |
| if (c != *bp++) |
| return NULL; |
| LEGAL_ALT(0); |
| continue; |
| |
| /* |
| * "Alternative" modifiers. Just set the appropriate flag |
| * and start over again. |
| */ |
| case 'E': /* "%E?" alternative conversion modifier. */ |
| LEGAL_ALT(0); |
| alt_format |= ALT_E; |
| goto again; |
| |
| case 'O': /* "%O?" alternative conversion modifier. */ |
| LEGAL_ALT(0); |
| alt_format |= ALT_O; |
| goto again; |
| |
| /* |
| * "Complex" conversion rules, implemented through recursion. |
| */ |
| case 'c': /* Date and time, using the locale's format. */ |
| // new_fmt = _TIME_LOCALE(loc)->d_t_fmt; |
| new_fmt = HERE_D_T_FMT; |
| state |= S_WDAY | S_MON | S_MDAY | S_YEAR; |
| goto recurse; |
| |
| case 'F': /* The date as "%Y-%m-%d". */ |
| new_fmt = "%Y-%m-%d"; |
| LEGAL_ALT(0); |
| state |= S_MON | S_MDAY | S_YEAR; |
| goto recurse; |
| |
| case 'R': /* The time as "%H:%M". */ |
| new_fmt = "%H:%M"; |
| LEGAL_ALT(0); |
| goto recurse; |
| |
| case 'r': /* The time in 12-hour clock representation. */ |
| // new_fmt = _TIME_LOCALE(loc)->t_fmt_ampm; |
| new_fmt = HERE_T_FMT_AMPM; |
| LEGAL_ALT(0); |
| goto recurse; |
| |
| case 'X': /* The time, using the locale's format. */ |
| /* fall through */ |
| |
| case 'T': /* The time as "%H:%M:%S". */ |
| new_fmt = HERE_T_FMT; |
| LEGAL_ALT(0); |
| |
| recurse: |
| bp = (const unsigned char *)strptime((const char *)bp, |
| new_fmt, tm); |
| LEGAL_ALT(ALT_E); |
| continue; |
| |
| case 'x': /* The date, using the locale's format. */ |
| /* fall through */ |
| |
| case 'D': /* The date as "%y/%m/%d". */ |
| { |
| new_fmt = HERE_D_FMT; |
| LEGAL_ALT(0); |
| state |= S_MON | S_MDAY | S_YEAR; |
| const int year = split_year ? tm->tm_year : 0; |
| |
| bp = (const unsigned char *)strptime((const char *)bp, |
| new_fmt, tm); |
| LEGAL_ALT(ALT_E); |
| tm->tm_year += year; |
| if (split_year && tm->tm_year % (2000 - TM_YEAR_BASE) <= 68) |
| tm->tm_year -= 2000 - TM_YEAR_BASE; |
| split_year = 1; |
| continue; |
| } |
| /* |
| * "Elementary" conversion rules. |
| */ |
| case 'A': /* The day of week, using the locale's form. */ |
| case 'a': |
| bp = find_string(bp, &tm->tm_wday, weekday_name, ab_weekday_name, 7); |
| LEGAL_ALT(0); |
| state |= S_WDAY; |
| continue; |
| |
| case 'B': /* The month, using the locale's form. */ |
| case 'b': |
| case 'h': |
| bp = find_string(bp, &tm->tm_mon, month_name, ab_month_name, 12); |
| LEGAL_ALT(0); |
| state |= S_MON; |
| continue; |
| |
| case 'C': /* The century number. */ |
| i = 20; |
| bp = conv_num(bp, &i, 0, 99); |
| |
| i = i * 100 - TM_YEAR_BASE; |
| if (split_year) |
| i += tm->tm_year % 100; |
| split_year = 1; |
| tm->tm_year = i; |
| LEGAL_ALT(ALT_E); |
| state |= S_YEAR; |
| continue; |
| |
| case 'd': /* The day of month. */ |
| case 'e': |
| bp = conv_num(bp, &tm->tm_mday, 1, 31); |
| LEGAL_ALT(ALT_O); |
| state |= S_MDAY; |
| continue; |
| |
| case 'k': /* The hour (24-hour clock representation). */ |
| LEGAL_ALT(0); |
| /* FALLTHROUGH */ |
| case 'H': |
| bp = conv_num(bp, &tm->tm_hour, 0, 23); |
| LEGAL_ALT(ALT_O); |
| state |= S_HOUR; |
| continue; |
| |
| case 'l': /* The hour (12-hour clock representation). */ |
| LEGAL_ALT(0); |
| /* FALLTHROUGH */ |
| case 'I': |
| bp = conv_num(bp, &tm->tm_hour, 1, 12); |
| if (tm->tm_hour == 12) |
| tm->tm_hour = 0; |
| LEGAL_ALT(ALT_O); |
| state |= S_HOUR; |
| continue; |
| |
| case 'j': /* The day of year. */ |
| i = 1; |
| bp = conv_num(bp, &i, 1, 366); |
| tm->tm_yday = i - 1; |
| LEGAL_ALT(0); |
| state |= S_YDAY; |
| continue; |
| |
| case 'M': /* The minute. */ |
| bp = conv_num(bp, &tm->tm_min, 0, 59); |
| LEGAL_ALT(ALT_O); |
| continue; |
| |
| case 'm': /* The month. */ |
| i = 1; |
| bp = conv_num(bp, &i, 1, 12); |
| tm->tm_mon = i - 1; |
| LEGAL_ALT(ALT_O); |
| state |= S_MON; |
| continue; |
| |
| case 'p': /* The locale's equivalent of AM/PM. */ |
| bp = find_string(bp, &i, am_pm, NULL, 2); |
| if (HAVE_HOUR(state) && tm->tm_hour > 11) |
| return NULL; |
| tm->tm_hour += i * 12; |
| LEGAL_ALT(0); |
| continue; |
| |
| case 'S': /* The seconds. */ |
| bp = conv_num(bp, &tm->tm_sec, 0, 61); |
| LEGAL_ALT(ALT_O); |
| continue; |
| |
| case 's': { /* seconds since the epoch */ |
| #ifdef _WIN32 |
| const time_t TIME_MAX = INT32_MAX; |
| #else |
| const time_t TIME_MAX = INT64_MAX; |
| #endif |
| time_t sse, d; |
| |
| if (*bp < '0' || *bp > '9') { |
| bp = NULL; |
| continue; |
| } |
| |
| sse = *bp++ - '0'; |
| while (*bp >= '0' && *bp <= '9') { |
| d = *bp++ - '0'; |
| if (sse > TIME_MAX/10) { |
| bp = NULL; |
| break; |
| } |
| sse *= 10; |
| if (sse > TIME_MAX - d) { |
| bp = NULL; |
| break; |
| } |
| sse += d; |
| } |
| if (bp == NULL) |
| continue; |
| |
| #ifdef _WIN32 |
| if (localtime_s(tm, &sse)) |
| #else |
| if (localtime_r(&sse, tm) == NULL) |
| #endif |
| bp = NULL; |
| else |
| state |= S_YDAY | S_WDAY | S_MON | S_MDAY | S_YEAR; |
| continue; |
| } |
| |
| case 'U': /* The week of year, beginning on sunday. */ |
| case 'W': /* The week of year, beginning on monday. */ |
| /* |
| * This is bogus, as we can not assume any valid |
| * information present in the tm structure at this |
| * point to calculate a real value, so save the |
| * week for now in case it can be used later. |
| */ |
| bp = conv_num(bp, &i, 0, 53); |
| LEGAL_ALT(ALT_O); |
| if (c == 'U') |
| day_offset = TM_SUNDAY; |
| else |
| day_offset = TM_MONDAY; |
| week_offset = i; |
| continue; |
| |
| case 'w': /* The day of week, beginning on sunday. */ |
| bp = conv_num(bp, &tm->tm_wday, 0, 6); |
| LEGAL_ALT(ALT_O); |
| state |= S_WDAY; |
| continue; |
| |
| case 'u': /* The day of week, monday = 1. */ |
| bp = conv_num(bp, &i, 1, 7); |
| tm->tm_wday = i % 7; |
| LEGAL_ALT(ALT_O); |
| state |= S_WDAY; |
| continue; |
| |
| case 'g': /* The year corresponding to the ISO week |
| * number but without the century. |
| */ |
| bp = conv_num(bp, &i, 0, 99); |
| continue; |
| |
| case 'G': /* The year corresponding to the ISO week |
| * number with century. |
| */ |
| do |
| bp++; |
| while (isdigit(*bp)); |
| continue; |
| |
| case 'V': /* The ISO 8601:1988 week number as decimal */ |
| bp = conv_num(bp, &i, 0, 53); |
| continue; |
| |
| case 'Y': /* The year. */ |
| i = TM_YEAR_BASE; /* just for data sanity... */ |
| bp = conv_num(bp, &i, 0, 9999); |
| tm->tm_year = i - TM_YEAR_BASE; |
| LEGAL_ALT(ALT_E); |
| state |= S_YEAR; |
| continue; |
| |
| case 'y': /* The year within 100 years of the epoch. */ |
| /* LEGAL_ALT(ALT_E | ALT_O); */ |
| bp = conv_num(bp, &i, 0, 99); |
| |
| if (split_year) |
| /* preserve century */ |
| i += (tm->tm_year / 100) * 100; |
| else { |
| split_year = 1; |
| if (i <= 68) |
| i = i + 2000 - TM_YEAR_BASE; |
| } |
| tm->tm_year = i; |
| state |= S_YEAR; |
| continue; |
| |
| case 'Z': // time zone name |
| case 'z': // |
| #ifdef _WIN32 |
| _tzset(); |
| #else |
| tzset(); |
| #endif |
| mandatory = c == 'z'; |
| /* |
| * We recognize all ISO 8601 formats: |
| * Z = Zulu time/UTC |
| * [+-]hhmm |
| * [+-]hh:mm |
| * [+-]hh |
| * We recognize all RFC-822/RFC-2822 formats: |
| * UT|GMT |
| * North American : UTC offsets |
| * E[DS]T = Eastern : -4 | -5 |
| * C[DS]T = Central : -5 | -6 |
| * M[DS]T = Mountain: -6 | -7 |
| * P[DS]T = Pacific : -7 | -8 |
| * Nautical/Military |
| * [A-IL-M] = -1 ... -9 (J not used) |
| * [N-Y] = +1 ... +12 |
| * Note: J maybe used to denote non-nautical |
| * local time |
| */ |
| if (mandatory) |
| while (isspace(*bp)) |
| bp++; |
| |
| zname = bp; |
| switch (*bp++) { |
| case 'G': |
| if (*bp++ != 'M') |
| goto namedzone; |
| /*FALLTHROUGH*/ |
| case 'U': |
| if (*bp++ != 'T') |
| goto namedzone; |
| else if (!delim(*bp) && *bp++ != 'C') |
| goto namedzone; |
| /*FALLTHROUGH*/ |
| case 'Z': |
| if (!delim(*bp)) |
| goto namedzone; |
| tm->tm_isdst = 0; |
| #ifdef TM_GMTOFF |
| tm->TM_GMTOFF = 0; |
| #endif |
| #ifdef TM_ZONE |
| tm->TM_ZONE = utc; |
| #endif |
| continue; |
| case '+': |
| neg = 0; |
| break; |
| case '-': |
| neg = 1; |
| break; |
| default: |
| namedzone: |
| bp = zname; |
| |
| /* Nautical / Military style */ |
| if (delim(bp[1]) && |
| ((*bp >= 'A' && *bp <= 'I') || |
| (*bp >= 'L' && *bp <= 'Y'))) { |
| #ifdef TM_GMTOFF |
| /* Argh! No 'J'! */ |
| if (*bp >= 'A' && *bp <= 'I') |
| tm->TM_GMTOFF = |
| (int)*bp - ('A' - 1); |
| else if (*bp >= 'L' && *bp <= 'M') |
| tm->TM_GMTOFF = (int)*bp - 'A'; |
| else if (*bp >= 'N' && *bp <= 'Y') |
| tm->TM_GMTOFF = 'M' - (int)*bp; |
| tm->TM_GMTOFF *= SECSPERHOUR; |
| #endif |
| #ifdef TM_ZONE |
| tm->TM_ZONE = NULL; /* XXX */ |
| #endif |
| bp++; |
| continue; |
| } |
| /* 'J' is local time */ |
| if (delim(bp[1]) && *bp == 'J') { |
| #ifdef TM_GMTOFF |
| tm->TM_GMTOFF = -timezone; |
| #endif |
| #ifdef TM_ZONE |
| tm->TM_ZONE = NULL; /* XXX */ |
| #endif |
| bp++; |
| continue; |
| } |
| |
| /* |
| * From our 3 letter hard-coded table |
| * XXX: Can be removed, handled by tzload() |
| */ |
| if (delim(bp[0]) || delim(bp[1]) || |
| delim(bp[2]) || !delim(bp[3])) |
| goto loadzone; |
| ep = find_string(bp, &i, nast, NULL, 4); |
| if (ep != NULL) { |
| #ifdef TM_GMTOFF |
| tm->TM_GMTOFF = (-5 - i) * SECSPERHOUR; |
| #endif |
| #ifdef TM_ZONE |
| tm->TM_ZONE = __UNCONST(nast[i]); |
| #endif |
| bp = ep; |
| continue; |
| } |
| ep = find_string(bp, &i, nadt, NULL, 4); |
| if (ep != NULL) { |
| tm->tm_isdst = 1; |
| #ifdef TM_GMTOFF |
| tm->TM_GMTOFF = (-4 - i) * SECSPERHOUR; |
| #endif |
| #ifdef TM_ZONE |
| tm->TM_ZONE = __UNCONST(nadt[i]); |
| #endif |
| bp = ep; |
| continue; |
| } |
| /* |
| * Our current timezone |
| */ |
| ep = find_string(bp, &i, |
| (const char * const *)tzname, |
| NULL, 2); |
| if (ep != NULL) { |
| tm->tm_isdst = i; |
| #ifdef TM_GMTOFF |
| tm->TM_GMTOFF = -timezone; |
| #endif |
| #ifdef TM_ZONE |
| tm->TM_ZONE = tzname[i]; |
| #endif |
| bp = ep; |
| continue; |
| } |
| loadzone: |
| /* |
| * The hard way, load the zone! |
| */ |
| if (fromzone(&bp, tm, mandatory)) |
| continue; |
| goto out; |
| } |
| offs = 0; |
| for (i = 0; i < 4; ) { |
| if (isdigit(*bp)) { |
| offs = offs * 10 + (*bp++ - '0'); |
| i++; |
| continue; |
| } |
| if (i == 2 && *bp == ':') { |
| bp++; |
| continue; |
| } |
| break; |
| } |
| if (isdigit(*bp)) |
| goto out; |
| switch (i) { |
| case 2: |
| offs *= SECSPERHOUR; |
| break; |
| case 4: |
| i = offs % 100; |
| offs /= 100; |
| if (i >= SECSPERMIN) |
| goto out; |
| /* Convert minutes into decimal */ |
| offs = offs * SECSPERHOUR + i * SECSPERMIN; |
| break; |
| default: |
| out: |
| if (mandatory) |
| return NULL; |
| bp = zname; |
| continue; |
| } |
| /* ISO 8601 & RFC 3339 limit to 23:59 max */ |
| if (offs >= (HOURSPERDAY * SECSPERHOUR)) |
| goto out; |
| if (neg) |
| offs = -offs; |
| tm->tm_isdst = 0; /* XXX */ |
| #ifdef TM_GMTOFF |
| tm->TM_GMTOFF = offs; |
| #endif |
| #ifdef TM_ZONE |
| tm->TM_ZONE = NULL; /* XXX */ |
| #endif |
| continue; |
| |
| /* |
| * Miscellaneous conversions. |
| */ |
| case 'n': /* Any kind of white-space. */ |
| case 't': |
| while (isspace(*bp)) |
| bp++; |
| LEGAL_ALT(0); |
| continue; |
| |
| |
| default: /* Unknown/unsupported conversion. */ |
| return NULL; |
| } |
| } |
| |
| if (!HAVE_YDAY(state) && HAVE_YEAR(state)) { |
| if (HAVE_MON(state) && HAVE_MDAY(state)) { |
| /* calculate day of year (ordinal date) */ |
| tm->tm_yday = start_of_month[isleap_sum(tm->tm_year, |
| TM_YEAR_BASE)][tm->tm_mon] + (tm->tm_mday - 1); |
| state |= S_YDAY; |
| } else if (day_offset != -1) { |
| /* |
| * Set the date to the first Sunday (or Monday) |
| * of the specified week of the year. |
| */ |
| if (!HAVE_WDAY(state)) { |
| tm->tm_wday = day_offset; |
| state |= S_WDAY; |
| } |
| tm->tm_yday = (7 - |
| first_wday_of(tm->tm_year + TM_YEAR_BASE) + |
| day_offset) % 7 + (week_offset - 1) * 7 + |
| tm->tm_wday - day_offset; |
| state |= S_YDAY; |
| } |
| } |
| |
| if (HAVE_YDAY(state) && HAVE_YEAR(state)) { |
| int isleap; |
| |
| if (!HAVE_MON(state)) { |
| /* calculate month of day of year */ |
| i = 0; |
| isleap = isleap_sum(tm->tm_year, TM_YEAR_BASE); |
| while (tm->tm_yday >= start_of_month[isleap][i]) |
| i++; |
| if (i > 12) { |
| i = 1; |
| tm->tm_yday -= start_of_month[isleap][12]; |
| tm->tm_year++; |
| } |
| tm->tm_mon = i - 1; |
| state |= S_MON; |
| } |
| |
| if (!HAVE_MDAY(state)) { |
| /* calculate day of month */ |
| isleap = isleap_sum(tm->tm_year, TM_YEAR_BASE); |
| tm->tm_mday = tm->tm_yday - |
| start_of_month[isleap][tm->tm_mon] + 1; |
| state |= S_MDAY; |
| } |
| |
| if (!HAVE_WDAY(state)) { |
| /* calculate day of week */ |
| i = 0; |
| week_offset = first_wday_of(tm->tm_year); |
| while (i++ <= tm->tm_yday) { |
| if (week_offset++ >= 6) |
| week_offset = 0; |
| } |
| tm->tm_wday = week_offset; |
| state |= S_WDAY; |
| } |
| } |
| |
| return (char*)bp; |
| } |
| |
| |
| static const unsigned char * |
| conv_num(const unsigned char *buf, int *dest, unsigned int llim, unsigned int ulim) |
| { |
| unsigned int result = 0; |
| unsigned char ch; |
| |
| /* The limit also determines the number of valid digits. */ |
| unsigned int rulim = ulim; |
| |
| ch = *buf; |
| if (ch < '0' || ch > '9') |
| return NULL; |
| |
| do { |
| result *= 10; |
| result += ch - '0'; |
| rulim /= 10; |
| ch = *++buf; |
| } while ((result <= ulim) && rulim && ch >= '0' && ch <= '9'); |
| |
| if (result < llim || result > ulim) |
| return NULL; |
| |
| *dest = result; |
| return buf; |
| } |
| |
| static const unsigned char * |
| find_string(const unsigned char *bp, int *tgt, const char * const *n1, |
| const char * const *n2, int c) |
| { |
| int i; |
| size_t len; |
| |
| /* check full name - then abbreviated ones */ |
| for (; n1 != NULL; n1 = n2, n2 = NULL) { |
| for (i = 0; i < c; i++, n1++) { |
| len = strlen(*n1); |
| if (strncasecmp(*n1, (const char *)bp, len) == 0) { |
| *tgt = i; |
| return bp + len; |
| } |
| } |
| } |
| |
| /* Nothing matched */ |
| return NULL; |
| } |
| #endif |
