mirror of
https://github.com/freebsd/freebsd-src.git
synced 2026-10-28 11:25:21 +01:00
3122 lines
81 KiB
C
3122 lines
81 KiB
C
/* Convert timestamp from time_t to struct tm. */
|
|
|
|
/*
|
|
** This file is in the public domain, so clarified as of
|
|
** 1996-06-05 by Arthur David Olson.
|
|
*/
|
|
|
|
/*
|
|
** Leap second handling from Bradley White.
|
|
** POSIX.1-1988 style TZ environment variable handling from Guy Harris.
|
|
*/
|
|
|
|
/*LINTLIBRARY*/
|
|
|
|
#define LOCALTIME_IMPLEMENTATION
|
|
#include "private.h"
|
|
|
|
#include "tzdir.h"
|
|
#include "tzfile.h"
|
|
#include <fcntl.h>
|
|
|
|
#if HAVE_SYS_STAT_H
|
|
# include <sys/stat.h>
|
|
# ifndef S_ISREG
|
|
# define S_ISREG(mode) (((mode) & S_IFMT) == S_IFREG) /* Ancient UNIX. */
|
|
# endif
|
|
#else
|
|
struct stat { char st_ctime, st_dev, st_ino; };
|
|
# define dev_t char
|
|
# define ino_t char
|
|
# define fstat(fd, st) (memset(st, 0, sizeof *(st)), 0)
|
|
# define stat(name, st) fstat(0, st)
|
|
# define S_ISREG(mode) 1
|
|
#endif
|
|
|
|
#ifndef HAVE_STRUCT_STAT_ST_CTIM
|
|
# define HAVE_STRUCT_STAT_ST_CTIM 1
|
|
#endif
|
|
#if !defined st_ctim && defined __APPLE__ && defined __MACH__
|
|
# define st_ctim st_ctimespec
|
|
#endif
|
|
|
|
#ifndef THREAD_SAFE
|
|
# define THREAD_SAFE 0
|
|
#endif
|
|
|
|
#ifndef THREAD_RWLOCK
|
|
# define THREAD_RWLOCK 0
|
|
#endif
|
|
|
|
#ifndef THREAD_TM_MULTI
|
|
# define THREAD_TM_MULTI 0
|
|
#endif
|
|
|
|
#ifndef USE_TIMEX_T
|
|
# define USE_TIMEX_T false
|
|
#endif
|
|
|
|
#if THREAD_SAFE
|
|
# include <pthread.h>
|
|
|
|
# ifndef THREAD_PREFER_SINGLE
|
|
# define THREAD_PREFER_SINGLE 0
|
|
# endif
|
|
# if THREAD_PREFER_SINGLE
|
|
# ifndef HAVE___ISTHREADED
|
|
# if defined __FreeBSD__ || defined __OpenBSD__ || defined __DragonFly__
|
|
# define HAVE___ISTHREADED 1
|
|
# else
|
|
# define HAVE___ISTHREADED 0
|
|
# endif
|
|
# endif
|
|
# if HAVE___ISTHREADED
|
|
extern int __isthreaded;
|
|
# else
|
|
# if !defined HAVE_SYS_SINGLE_THREADED_H && defined __has_include
|
|
# if __has_include(<sys/single_threaded.h>)
|
|
# define HAVE_SYS_SINGLE_THREADED_H 1
|
|
# else
|
|
# define HAVE_SYS_SINGLE_THREADED_H 0
|
|
# endif
|
|
# endif
|
|
# ifndef HAVE_SYS_SINGLE_THREADED_H
|
|
# if defined __GLIBC__ && 2 < __GLIBC__ + (32 <= __GLIBC_MINOR__)
|
|
# define HAVE_SYS_SINGLE_THREADED_H 1
|
|
# else
|
|
# define HAVE_SYS_SINGLE_THREADED_H 0
|
|
# endif
|
|
# endif
|
|
# if HAVE_SYS_SINGLE_THREADED_H
|
|
# include <sys/single_threaded.h>
|
|
# endif
|
|
# endif
|
|
# endif
|
|
#endif
|
|
|
|
#if !defined TM_GMTOFF || !USE_TIMEX_T
|
|
# if THREAD_SAFE
|
|
|
|
/* True if the current process might be multi-threaded,
|
|
false if it is definitely single-threaded.
|
|
If false, it will be false the next time it is called
|
|
unless the caller creates a thread in the meantime.
|
|
If true, it might become false the next time it is called
|
|
if all other threads exit in the meantime. */
|
|
static bool
|
|
is_threaded(void)
|
|
{
|
|
# if THREAD_PREFER_SINGLE && HAVE___ISTHREADED
|
|
return !!__isthreaded;
|
|
# elif THREAD_PREFER_SINGLE && HAVE_SYS_SINGLE_THREADED_H
|
|
return !__libc_single_threaded;
|
|
# else
|
|
return true;
|
|
# endif
|
|
}
|
|
|
|
# if THREAD_RWLOCK
|
|
static pthread_rwlock_t locallock = PTHREAD_RWLOCK_INITIALIZER;
|
|
static int dolock(void) { return pthread_rwlock_rdlock(&locallock); }
|
|
static void dounlock(void) { pthread_rwlock_unlock(&locallock); }
|
|
# else
|
|
static pthread_mutex_t locallock = PTHREAD_MUTEX_INITIALIZER;
|
|
static int dolock(void) { return pthread_mutex_lock(&locallock); }
|
|
static void dounlock(void) { pthread_mutex_unlock(&locallock); }
|
|
# endif
|
|
|
|
/* Get a lock. Return 0 on success, a positive errno value on failure,
|
|
negative if known to be single-threaded so no lock is needed. */
|
|
static int
|
|
lock(void)
|
|
{
|
|
if (!is_threaded())
|
|
return -1;
|
|
return dolock();
|
|
}
|
|
static void
|
|
unlock(bool threaded)
|
|
{
|
|
if (threaded)
|
|
dounlock();
|
|
}
|
|
# else
|
|
static int lock(void) { return -1; }
|
|
static void unlock(ATTRIBUTE_MAYBE_UNUSED bool threaded) { }
|
|
# endif
|
|
#endif
|
|
|
|
#if THREAD_SAFE
|
|
typedef pthread_once_t once_t;
|
|
# define ONCE_INIT PTHREAD_ONCE_INIT
|
|
#else
|
|
typedef bool once_t;
|
|
# define ONCE_INIT false
|
|
#endif
|
|
|
|
static void
|
|
once(once_t *once_control, void init_routine(void))
|
|
{
|
|
#if THREAD_SAFE
|
|
pthread_once(once_control, init_routine);
|
|
#else
|
|
if (!*once_control) {
|
|
*once_control = true;
|
|
init_routine();
|
|
}
|
|
#endif
|
|
}
|
|
|
|
enum tm_multi { LOCALTIME_TM_MULTI, GMTIME_TM_MULTI, OFFTIME_TM_MULTI };
|
|
|
|
#if THREAD_SAFE && THREAD_TM_MULTI
|
|
|
|
enum { N_TM_MULTI = OFFTIME_TM_MULTI + 1 };
|
|
static pthread_key_t tm_multi_key;
|
|
static int tm_multi_key_err;
|
|
|
|
static void
|
|
tm_multi_key_init(void)
|
|
{
|
|
tm_multi_key_err = pthread_key_create(&tm_multi_key, free);
|
|
}
|
|
|
|
#endif
|
|
|
|
/* Unless intptr_t is missing, pacify gcc -Wcast-qual on char const * exprs.
|
|
Use this carefully, as the casts disable type checking.
|
|
This is a macro so that it can be used in static initializers. */
|
|
#ifdef INTPTR_MAX
|
|
# define UNCONST(a) ((char *) (intptr_t) (a))
|
|
#else
|
|
# define UNCONST(a) ((char *) (a))
|
|
#endif
|
|
|
|
/* A signed type wider than int, so that we can add 1900 + tm_mon/12 to tm_year
|
|
without overflow. The static_assert checks that it is indeed wider
|
|
than int; if this fails on your platform please let us know. */
|
|
#if INT_MAX < LONG_MAX
|
|
typedef long iinntt;
|
|
# define IINNTT_MIN LONG_MIN
|
|
# define IINNTT_MAX LONG_MAX
|
|
#elif INT_MAX < LLONG_MAX
|
|
typedef long long iinntt;
|
|
# define IINNTT_MIN LLONG_MIN
|
|
# define IINNTT_MAX LLONG_MAX
|
|
#else
|
|
typedef intmax_t iinntt;
|
|
# define IINNTT_MIN INTMAX_MIN
|
|
# define IINNTT_MAX INTMAX_MAX
|
|
#endif
|
|
static_assert(IINNTT_MIN < INT_MIN && INT_MAX < IINNTT_MAX);
|
|
|
|
#ifndef HAVE_STRUCT_TIMESPEC
|
|
# define HAVE_STRUCT_TIMESPEC 1
|
|
#endif
|
|
#if !HAVE_STRUCT_TIMESPEC
|
|
struct timespec { time_t tv_sec; long tv_nsec; };
|
|
#endif
|
|
|
|
#if !defined CLOCK_MONOTONIC_COARSE && defined CLOCK_MONOTONIC
|
|
# define CLOCK_MONOTONIC_COARSE CLOCK_MONOTONIC
|
|
#endif
|
|
#ifndef CLOCK_MONOTONIC_COARSE
|
|
# undef clock_gettime
|
|
# define clock_gettime(id, t) ((t)->tv_sec = time(NULL), (t)->tv_nsec = 0, 0)
|
|
#endif
|
|
|
|
/* How many seconds to wait before checking the default TZif file again.
|
|
Negative means no checking. Default to 61 if DETECT_TZ_CHANGES
|
|
(as FreeBSD optionally builds its localtime.c with -DDETECT_TZ_CHANGES),
|
|
and to -1 otherwise. */
|
|
#ifndef TZ_CHANGE_INTERVAL
|
|
# ifdef DETECT_TZ_CHANGES
|
|
# define TZ_CHANGE_INTERVAL 61
|
|
# else
|
|
# define TZ_CHANGE_INTERVAL (-1)
|
|
# endif
|
|
#endif
|
|
static_assert(TZ_CHANGE_INTERVAL < 0 || HAVE_SYS_STAT_H);
|
|
|
|
/* The change detection interval. */
|
|
#if TZ_CHANGE_INTERVAL < 0 || !defined __FreeBSD__
|
|
enum { tz_change_interval = TZ_CHANGE_INTERVAL };
|
|
#else
|
|
/* FreeBSD uses this private-but-extern var in its internal test suite. */
|
|
int __tz_change_interval = TZ_CHANGE_INTERVAL;
|
|
# define tz_change_interval __tz_change_interval
|
|
#endif
|
|
|
|
/* The type of monotonic times.
|
|
This is the system time_t, even if USE_TIMEX_T #defines time_t below. */
|
|
typedef time_t monotime_t;
|
|
|
|
/* On platforms where offtime or mktime might overflow,
|
|
strftime.c defines USE_TIMEX_T to be true and includes us.
|
|
This tells us to #define time_t to an internal type timex_t that is
|
|
wide enough so that strftime %s never suffers from integer overflow,
|
|
and to #define offtime (if TM_GMTOFF is defined) or mktime (otherwise)
|
|
to a static function that returns the redefined time_t.
|
|
It also tells us to define only data and code needed
|
|
to support the offtime or mktime variant. */
|
|
#if USE_TIMEX_T
|
|
# undef TIME_T_MIN
|
|
# undef TIME_T_MAX
|
|
# undef time_t
|
|
# define time_t timex_t
|
|
# if MKTIME_FITS_IN(LONG_MIN, LONG_MAX)
|
|
typedef long timex_t;
|
|
# define TIME_T_MIN LONG_MIN
|
|
# define TIME_T_MAX LONG_MAX
|
|
# elif MKTIME_FITS_IN(LLONG_MIN, LLONG_MAX)
|
|
typedef long long timex_t;
|
|
# define TIME_T_MIN LLONG_MIN
|
|
# define TIME_T_MAX LLONG_MAX
|
|
# else
|
|
typedef intmax_t timex_t;
|
|
# define TIME_T_MIN INTMAX_MIN
|
|
# define TIME_T_MAX INTMAX_MAX
|
|
# endif
|
|
|
|
# ifdef TM_GMTOFF
|
|
# undef timeoff
|
|
# define timeoff timex_timeoff
|
|
# undef EXTERN_TIMEOFF
|
|
# else
|
|
# undef mktime
|
|
# define mktime timex_mktime
|
|
# endif
|
|
#endif
|
|
|
|
/* Placeholders for platforms lacking AT_FCWD, openat, and fstatat. */
|
|
#ifndef AT_FDCWD
|
|
# define AT_FDCWD (-1) /* any negative value will do */
|
|
static int openat(int dd, char const *path, int oflag) { unreachable (); }
|
|
static int fstatat(int dd, char const *path, struct stat *st, int flags)
|
|
{ unreachable(); }
|
|
#endif
|
|
|
|
/* Port to platforms that lack some O_* flags. Unless otherwise
|
|
specified, the flags are standardized by POSIX. */
|
|
|
|
#ifndef O_BINARY
|
|
# define O_BINARY 0 /* MS-Windows */
|
|
#endif
|
|
#ifndef O_CLOEXEC
|
|
# define O_CLOEXEC 0
|
|
#endif
|
|
#ifndef O_CLOFORK
|
|
# define O_CLOFORK 0
|
|
#endif
|
|
#ifndef O_DIRECTORY
|
|
# define O_DIRECTORY 0
|
|
#endif
|
|
#ifndef O_IGNORE_CTTY
|
|
# define O_IGNORE_CTTY 0 /* GNU/Hurd */
|
|
#endif
|
|
#ifndef O_NOCTTY
|
|
# define O_NOCTTY 0
|
|
#endif
|
|
#ifndef O_PATH
|
|
# define O_PATH 0
|
|
#endif
|
|
#ifndef O_REGULAR
|
|
# define O_REGULAR 0
|
|
#endif
|
|
#ifndef O_RESOLVE_BENEATH
|
|
# define O_RESOLVE_BENEATH 0
|
|
#endif
|
|
#ifndef O_SEARCH
|
|
# define O_SEARCH 0
|
|
#endif
|
|
|
|
#if !HAVE_ISSETUGID
|
|
|
|
# if !defined HAVE_SYS_AUXV_H && defined __has_include
|
|
# if __has_include(<sys/auxv.h>)
|
|
# define HAVE_SYS_AUXV_H 1
|
|
# endif
|
|
# endif
|
|
# ifndef HAVE_SYS_AUXV_H
|
|
# if defined __GLIBC__ && 2 < __GLIBC__ + (19 <= __GLIBC_MINOR__)
|
|
# define HAVE_SYS_AUXV_H 1
|
|
# else
|
|
# define HAVE_SYS_AUXV_H 0
|
|
# endif
|
|
# endif
|
|
# if HAVE_SYS_AUXV_H
|
|
# include <sys/auxv.h>
|
|
# endif
|
|
|
|
/* Avoid clash if headers declare but libraries do not define issetugid. */
|
|
# undef issetugid
|
|
# define issetugid localtime_issetugid
|
|
|
|
/* Return 1 if the process is privileged, 0 otherwise. */
|
|
static int
|
|
issetugid(void)
|
|
{
|
|
# if HAVE_SYS_AUXV_H && defined AT_SECURE
|
|
unsigned long val;
|
|
errno = 0;
|
|
val = getauxval(AT_SECURE);
|
|
if (val || errno != ENOENT)
|
|
return !!val;
|
|
# endif
|
|
# if HAVE_GETRESUID
|
|
{
|
|
uid_t ruid, euid, suid;
|
|
gid_t rgid, egid, sgid;
|
|
if (0 <= getresuid (&ruid, &euid, &suid)) {
|
|
if ((ruid ^ euid) | (ruid ^ suid))
|
|
return 1;
|
|
if (0 <= getresgid (&rgid, &egid, &sgid))
|
|
return !!((rgid ^ egid) | (rgid ^ sgid));
|
|
}
|
|
}
|
|
# endif
|
|
# if HAVE_GETEUID
|
|
return geteuid() != getuid() || getegid() != getgid();
|
|
# else
|
|
return 0;
|
|
# endif
|
|
}
|
|
#endif
|
|
|
|
#ifndef WILDABBR
|
|
/*
|
|
** Someone might make incorrect use of a time zone abbreviation:
|
|
** 1. They might reference tzname[0] before calling tzset (explicitly
|
|
** or implicitly).
|
|
** 2. They might reference tzname[1] before calling tzset (explicitly
|
|
** or implicitly).
|
|
** 3. They might reference tzname[1] after setting to a time zone
|
|
** in which Daylight Saving Time is never observed.
|
|
** 4. They might reference tzname[0] after setting to a time zone
|
|
** in which Standard Time is never observed.
|
|
** 5. They might reference tm.TM_ZONE after calling offtime.
|
|
** What's best to do in the above cases is open to debate;
|
|
** for now, we just set things up so that in any of the five cases
|
|
** WILDABBR is used. Another possibility: initialize tzname[0] to the
|
|
** string "tzname[0] used before set", and similarly for the other cases.
|
|
** And another: initialize tzname[0] to "ERA", with an explanation in the
|
|
** manual page of what this "time zone abbreviation" means (doing this so
|
|
** that tzname[0] has the "normal" length of three characters).
|
|
*/
|
|
# define WILDABBR " "
|
|
#endif /* !defined WILDABBR */
|
|
|
|
static const char wildabbr[] = WILDABBR;
|
|
|
|
static char const etc_utc[] = "Etc/UTC";
|
|
|
|
#if !USE_TIMEX_T || defined TM_ZONE || !defined TM_GMTOFF
|
|
static char const *utc = etc_utc + sizeof "Etc/" - 1;
|
|
#endif
|
|
|
|
/*
|
|
** The DST rules to use if TZ has no rules.
|
|
** Default to US rules as of 2017-05-07.
|
|
** POSIX does not specify the default DST rules;
|
|
** for historical reasons, US rules are a common default.
|
|
*/
|
|
#ifndef TZDEFRULESTRING
|
|
# define TZDEFRULESTRING ",M3.2.0,M11.1.0"
|
|
#endif
|
|
|
|
/* If compiled with -DOPENAT_TZDIR, then when accessing a relative
|
|
name like "America/Los_Angeles", first open TZDIR (default
|
|
"/usr/share/zoneinfo") as a directory and then use the result in
|
|
openat with "America/Los_Angeles", rather than the traditional
|
|
approach of opening "/usr/share/zoneinfo/America/Los_Angeles".
|
|
Although the OPENAT_TZDIR approach is less efficient, suffers from
|
|
spurious EMFILE and ENFILE failures, and is no more secure in practice,
|
|
bleeding edge FreeBSD started doing it this way in August 2025. */
|
|
#ifndef OPENAT_TZDIR
|
|
# define OPENAT_TZDIR 0
|
|
#endif
|
|
|
|
/* If compiled with -DSUPPRESS_TZDIR, do not prepend TZDIR to relative TZ.
|
|
This is intended for specialized applications only, due to its
|
|
security implications. */
|
|
#ifndef SUPPRESS_TZDIR
|
|
# define SUPPRESS_TZDIR 0
|
|
#endif
|
|
|
|
/* Limit to time zone abbreviation length in proleptic TZ strings.
|
|
This is distinct from TZ_MAX_CHARS, which limits TZif file contents.
|
|
It defaults to 254, not 255, so that desigidx_type can be an unsigned char.
|
|
unsigned char suffices for TZif files, so the only reason to increase
|
|
TZNAME_MAXIMUM is to support TZ strings specifying abbreviations
|
|
longer than 254 bytes. There is little reason to do that, though,
|
|
as strings that long are hardly "abbreviations". */
|
|
#ifndef TZNAME_MAXIMUM
|
|
# define TZNAME_MAXIMUM 254
|
|
#endif
|
|
|
|
#if TZNAME_MAXIMUM < UCHAR_MAX
|
|
typedef unsigned char desigidx_type;
|
|
#elif TZNAME_MAXIMUM < INT_MAX
|
|
typedef int desigidx_type;
|
|
#elif TZNAME_MAXIMUM < PTRDIFF_MAX
|
|
typedef ptrdiff_t desigidx_type;
|
|
#else
|
|
# error "TZNAME_MAXIMUM too large"
|
|
#endif
|
|
|
|
/* A type that can represent any 32-bit two's complement integer,
|
|
i.e., any integer in the range -2**31 .. 2**31 - 1.
|
|
Ordinarily this is int_fast32_t, but on non-C23 hosts
|
|
that are not two's complement it is int_fast64_t. */
|
|
#if INT_FAST32_MIN < -TWO_31_MINUS_1
|
|
typedef int_fast32_t int_fast32_2s;
|
|
#else
|
|
typedef int_fast64_t int_fast32_2s;
|
|
#endif
|
|
|
|
struct ttinfo { /* time type information */
|
|
int_least32_t tt_utoff; /* UT offset in seconds; in the range
|
|
-2**31 + 1 .. 2**31 - 1 */
|
|
desigidx_type tt_desigidx; /* abbreviation list index */
|
|
bool tt_isdst; /* used to set tm_isdst */
|
|
};
|
|
|
|
struct lsinfo { /* leap second information */
|
|
time_t ls_trans; /* transition time (positive) */
|
|
int_fast32_2s ls_corr; /* correction to apply */
|
|
};
|
|
|
|
/* This abbreviation means local time is unspecified. */
|
|
static char const UNSPEC[] = "-00";
|
|
|
|
/* How many extra bytes are needed at the end of struct state's chars array.
|
|
This needs to be at least 1 for null termination in case the input
|
|
data isn't properly terminated, and it also needs to be big enough
|
|
for ttunspecified to work without crashing. */
|
|
enum { CHARS_EXTRA = max(sizeof UNSPEC, 2) - 1 };
|
|
|
|
/* A representation of the contents of a TZif file. Ideally this
|
|
would have no size limits; the following sizes should suffice for
|
|
practical use. This struct should not be too large, as instances
|
|
are put on the stack and stacks are relatively small on some platforms.
|
|
See tzfile.h for more about the sizes. */
|
|
struct state {
|
|
#if TZ_RUNTIME_LEAPS
|
|
int leapcnt;
|
|
#endif
|
|
int timecnt;
|
|
int typecnt;
|
|
int charcnt;
|
|
bool goahead;
|
|
time_t ats[TZ_MAX_TIMES];
|
|
unsigned char types[TZ_MAX_TIMES];
|
|
struct ttinfo ttis[TZ_MAX_TYPES];
|
|
char chars[max(max(TZ_MAX_CHARS + CHARS_EXTRA, sizeof "UTC"),
|
|
2 * (TZNAME_MAXIMUM + 1))];
|
|
#if TZ_RUNTIME_LEAPS
|
|
struct lsinfo lsis[TZ_MAX_LEAPS];
|
|
#endif
|
|
};
|
|
|
|
static int
|
|
leapcount(ATTRIBUTE_MAYBE_UNUSED struct state const *sp)
|
|
{
|
|
#if TZ_RUNTIME_LEAPS
|
|
return sp->leapcnt;
|
|
#else
|
|
return 0;
|
|
#endif
|
|
}
|
|
static void
|
|
set_leapcount(ATTRIBUTE_MAYBE_UNUSED struct state *sp,
|
|
ATTRIBUTE_MAYBE_UNUSED int leapcnt)
|
|
{
|
|
#if TZ_RUNTIME_LEAPS
|
|
sp->leapcnt = leapcnt;
|
|
#endif
|
|
}
|
|
static struct lsinfo
|
|
lsinfo(ATTRIBUTE_MAYBE_UNUSED struct state const *sp,
|
|
ATTRIBUTE_MAYBE_UNUSED int i)
|
|
{
|
|
#if TZ_RUNTIME_LEAPS
|
|
return sp->lsis[i];
|
|
#else
|
|
unreachable();
|
|
#endif
|
|
}
|
|
static void
|
|
set_lsinfo(ATTRIBUTE_MAYBE_UNUSED struct state *sp,
|
|
ATTRIBUTE_MAYBE_UNUSED int i,
|
|
ATTRIBUTE_MAYBE_UNUSED struct lsinfo lsinfo)
|
|
{
|
|
#if TZ_RUNTIME_LEAPS
|
|
sp->lsis[i] = lsinfo;
|
|
#endif
|
|
}
|
|
|
|
enum r_type {
|
|
JULIAN_DAY, /* Jn = Julian day */
|
|
DAY_OF_YEAR, /* n = day of year */
|
|
MONTH_NTH_DAY_OF_WEEK /* Mm.n.d = month, week, day of week */
|
|
};
|
|
|
|
struct rule {
|
|
enum r_type r_type; /* type of rule */
|
|
int r_day; /* day number of rule */
|
|
int r_week; /* week number of rule */
|
|
int r_mon; /* month number of rule */
|
|
int_fast32_t r_time; /* transition time of rule */
|
|
};
|
|
|
|
static struct tm *gmtsub(struct state const *, time_t const *, int_fast32_t,
|
|
struct tm *, time_t *);
|
|
static bool increment_overflow_time(time_t *, int_fast32_2s);
|
|
static int_fast32_2s leapcorr(struct state const *, time_t);
|
|
static struct tm *timesub(time_t const *, int_fast32_t, struct state const *,
|
|
struct tm *, time_t *);
|
|
static bool tzparse(char const *, struct state *, struct state const *);
|
|
|
|
#ifndef ALL_STATE
|
|
# define ALL_STATE 0
|
|
#endif
|
|
|
|
#if ALL_STATE
|
|
static struct state * lclptr;
|
|
static struct state * gmtptr;
|
|
#else
|
|
static struct state lclmem;
|
|
static struct state gmtmem;
|
|
static struct state *const lclptr = &lclmem;
|
|
static struct state *const gmtptr = &gmtmem;
|
|
#endif /* State Farm */
|
|
|
|
/* Maximum number of bytes in an efficiently-handled TZ string.
|
|
Longer strings work, albeit less efficiently. */
|
|
#ifndef TZ_STRLEN_MAX
|
|
# define TZ_STRLEN_MAX 255
|
|
#endif /* !defined TZ_STRLEN_MAX */
|
|
|
|
#if !USE_TIMEX_T || !defined TM_GMTOFF
|
|
static char lcl_TZname[TZ_STRLEN_MAX + 1];
|
|
static int lcl_is_set;
|
|
#endif
|
|
|
|
/*
|
|
** Section 4.12.3 of X3.159-1989 requires that
|
|
** Except for the strftime function, these functions [asctime,
|
|
** ctime, gmtime, localtime] return values in one of two static
|
|
** objects: a broken-down time structure and an array of char.
|
|
** Thanks to Paul Eggert for noting this.
|
|
**
|
|
** Although this requirement was removed in C99 it is still present in POSIX.
|
|
** Follow the requirement if SUPPORT_C89, even though this is more likely to
|
|
** trigger latent bugs in programs.
|
|
*/
|
|
|
|
#if !USE_TIMEX_T
|
|
|
|
# if SUPPORT_C89
|
|
static struct tm tm;
|
|
# endif
|
|
|
|
# if 2 <= HAVE_TZNAME + TZ_TIME_T
|
|
char *tzname[2] = { UNCONST(wildabbr), UNCONST(wildabbr) };
|
|
# endif
|
|
# if 2 <= USG_COMPAT + TZ_TIME_T
|
|
long timezone;
|
|
int daylight;
|
|
# endif
|
|
# if 2 <= ALTZONE + TZ_TIME_T
|
|
long altzone;
|
|
# endif
|
|
|
|
#endif
|
|
|
|
/* Initialize *S to a value based on UTOFF, ISDST, and DESIGIDX. */
|
|
static void
|
|
init_ttinfo(struct ttinfo *s, int_fast32_t utoff, bool isdst,
|
|
desigidx_type desigidx)
|
|
{
|
|
s->tt_utoff = utoff;
|
|
s->tt_isdst = isdst;
|
|
s->tt_desigidx = desigidx;
|
|
}
|
|
|
|
/* Return true if SP's time type I does not specify local time. */
|
|
static bool
|
|
ttunspecified(struct state const *sp, int i)
|
|
{
|
|
char const *abbr = &sp->chars[sp->ttis[i].tt_desigidx];
|
|
/* memcmp is likely faster than strcmp, and is safe due to CHARS_EXTRA. */
|
|
return memcmp(abbr, UNSPEC, sizeof UNSPEC) == 0;
|
|
}
|
|
|
|
static int_fast32_2s
|
|
detzcode(const char *const codep)
|
|
{
|
|
register int i;
|
|
int_fast32_2s
|
|
maxval = TWO_31_MINUS_1,
|
|
minval = -1 - maxval,
|
|
result;
|
|
|
|
result = codep[0] & 0x7f;
|
|
for (i = 1; i < 4; ++i)
|
|
result = (result << 8) | (codep[i] & 0xff);
|
|
|
|
if (codep[0] & 0x80) {
|
|
/* Do two's-complement negation even on non-two's-complement machines.
|
|
This cannot overflow, as int_fast32_2s is wide enough. */
|
|
result += minval;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
static int_fast64_t
|
|
detzcode64(const char *const codep)
|
|
{
|
|
register int_fast64_t result;
|
|
register int i;
|
|
int_fast64_t one = 1;
|
|
int_fast64_t halfmaxval = one << (64 - 2);
|
|
int_fast64_t maxval = halfmaxval - 1 + halfmaxval;
|
|
int_fast64_t minval = -TWOS_COMPLEMENT(int_fast64_t) - maxval;
|
|
|
|
result = codep[0] & 0x7f;
|
|
for (i = 1; i < 8; ++i)
|
|
result = (result << 8) | (codep[i] & 0xff);
|
|
|
|
if (codep[0] & 0x80) {
|
|
/* Do two's-complement negation even on non-two's-complement machines.
|
|
If the result would be minval - 1, return minval. */
|
|
result -= !TWOS_COMPLEMENT(int_fast64_t) && result != 0;
|
|
result += minval;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
#if !USE_TIMEX_T || !defined TM_GMTOFF
|
|
|
|
static void
|
|
update_tzname_etc(struct state const *sp, struct ttinfo const *ttisp)
|
|
{
|
|
# if HAVE_TZNAME
|
|
tzname[ttisp->tt_isdst] = UNCONST(&sp->chars[ttisp->tt_desigidx]);
|
|
# endif
|
|
# if USG_COMPAT
|
|
if (!ttisp->tt_isdst)
|
|
timezone = - ttisp->tt_utoff;
|
|
# endif
|
|
# if ALTZONE
|
|
if (ttisp->tt_isdst)
|
|
altzone = - ttisp->tt_utoff;
|
|
# endif
|
|
}
|
|
|
|
/* If STDDST_MASK indicates that SP's TYPE provides useful info,
|
|
update tzname, timezone, and/or altzone and return STDDST_MASK,
|
|
diminished by the provided info if it is a specified local time.
|
|
Otherwise, return STDDST_MASK. See settzname for STDDST_MASK. */
|
|
static int
|
|
may_update_tzname_etc(int stddst_mask, struct state *sp, int type)
|
|
{
|
|
struct ttinfo *ttisp = &sp->ttis[type];
|
|
int this_bit = 1 << ttisp->tt_isdst;
|
|
if (stddst_mask & this_bit) {
|
|
update_tzname_etc(sp, ttisp);
|
|
if (!ttunspecified(sp, type))
|
|
return stddst_mask & ~this_bit;
|
|
}
|
|
return stddst_mask;
|
|
}
|
|
|
|
static void
|
|
settzname(void)
|
|
{
|
|
register struct state * const sp = lclptr;
|
|
register int i;
|
|
|
|
/* If STDDST_MASK & 1 we need info about a standard time.
|
|
If STDDST_MASK & 2 we need info about a daylight saving time.
|
|
When STDDST_MASK becomes zero we can stop looking. */
|
|
int stddst_mask = 0;
|
|
|
|
# if HAVE_TZNAME
|
|
tzname[0] = tzname[1] = UNCONST(sp ? wildabbr : utc);
|
|
stddst_mask = 3;
|
|
# endif
|
|
# if USG_COMPAT
|
|
timezone = 0;
|
|
stddst_mask = 3;
|
|
# endif
|
|
# if ALTZONE
|
|
altzone = 0;
|
|
stddst_mask |= 2;
|
|
# endif
|
|
/*
|
|
** And to get the latest time zone abbreviations into tzname. . .
|
|
*/
|
|
if (sp) {
|
|
for (i = sp->timecnt - 1; stddst_mask && 0 <= i; i--)
|
|
stddst_mask = may_update_tzname_etc(stddst_mask, sp, sp->types[i]);
|
|
for (i = sp->typecnt - 1; stddst_mask && 0 <= i; i--)
|
|
stddst_mask = may_update_tzname_etc(stddst_mask, sp, i);
|
|
}
|
|
# if USG_COMPAT
|
|
daylight = stddst_mask >> 1 ^ 1;
|
|
# endif
|
|
}
|
|
|
|
/* Replace bogus characters in time zone abbreviations.
|
|
Return 0 on success, an errno value if a time zone abbreviation is
|
|
too long. */
|
|
static int
|
|
scrub_abbrs(struct state *sp)
|
|
{
|
|
int i;
|
|
|
|
/* Reject overlong abbreviations. */
|
|
for (i = 0; i < sp->charcnt - (TZNAME_MAXIMUM + 1); ) {
|
|
int len = strnlen(&sp->chars[i], TZNAME_MAXIMUM + 1);
|
|
if (TZNAME_MAXIMUM < len)
|
|
return EOVERFLOW;
|
|
i += len + 1;
|
|
}
|
|
|
|
/* Replace bogus characters. */
|
|
for (i = 0; i < sp->charcnt; ++i)
|
|
switch (sp->chars[i]) {
|
|
case '\0':
|
|
case '+': case '-': case '.':
|
|
case '0': case '1': case '2': case '3': case '4':
|
|
case '5': case '6': case '7': case '8': case '9':
|
|
case ':':
|
|
case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': case 'G':
|
|
case 'H': case 'I': case 'J': case 'K': case 'L': case 'M': case 'N':
|
|
case 'O': case 'P': case 'Q': case 'R': case 'S': case 'T': case 'U':
|
|
case 'V': case 'W': case 'X': case 'Y': case 'Z':
|
|
case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': case 'g':
|
|
case 'h': case 'i': case 'j': case 'k': case 'l': case 'm': case 'n':
|
|
case 'o': case 'p': case 'q': case 'r': case 's': case 't': case 'u':
|
|
case 'v': case 'w': case 'x': case 'y': case 'z':
|
|
break;
|
|
|
|
default:
|
|
sp->chars[i] = '_';
|
|
break;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
#endif
|
|
|
|
/* Return true if the TZif file with descriptor FD changed,
|
|
or may have changed, since the last time we were called.
|
|
Return false if it did not change.
|
|
If *ST is valid it is the file's current status;
|
|
otherwise, update *ST to the status if possible. */
|
|
static bool
|
|
tzfile_changed(int fd, struct stat *st)
|
|
{
|
|
/* If old_ctim.tv_sec, these variables hold the corresponding part
|
|
of the file's metadata the last time this function was called. */
|
|
static struct timespec old_ctim;
|
|
static dev_t old_dev;
|
|
static ino_t old_ino;
|
|
|
|
if (!st->st_ctime && fstat(fd, st) < 0) {
|
|
/* We do not know the file's state, so reset. */
|
|
old_ctim.tv_sec = 0;
|
|
return true;
|
|
} else {
|
|
/* Use the change time, as it changes more reliably; mod time can
|
|
be set back with futimens etc. Use subsecond timestamp
|
|
resolution if available, as this can help distinguish files on
|
|
non-POSIX platforms where st_dev and st_ino are unreliable. */
|
|
struct timespec ctim;
|
|
/* Copy via members, as AIX 7.3 defaults to an incompatible st_ctim. */
|
|
ctim.tv_sec = st->st_ctime;
|
|
#if HAVE_STRUCT_STAT_ST_CTIM
|
|
ctim.tv_nsec = st->st_ctim.tv_nsec;
|
|
#else
|
|
ctim.tv_nsec = 0;
|
|
#endif
|
|
|
|
if ((ctim.tv_sec ^ old_ctim.tv_sec) | (ctim.tv_nsec ^ old_ctim.tv_nsec)
|
|
| (st->st_dev ^ old_dev) | (st->st_ino ^ old_ino)) {
|
|
old_ctim = ctim;
|
|
old_dev = st->st_dev;
|
|
old_ino = st->st_ino;
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
}
|
|
|
|
/* Input buffer for data read from a compiled tz file. */
|
|
union input_buffer {
|
|
/* The first part of the buffer, interpreted as a header. */
|
|
struct tzhead tzhead;
|
|
|
|
/* The entire buffer. Ideally this would have no size limits;
|
|
the following should suffice for practical use. */
|
|
char buf[2 * sizeof(struct tzhead) + 2 * sizeof(struct state)
|
|
+ 4 * TZ_MAX_TIMES];
|
|
};
|
|
|
|
/* TZDIR with a trailing '/'. It is null-terminated if OPENAT_TZDIR. */
|
|
#if !OPENAT_TZDIR
|
|
ATTRIBUTE_NONSTRING
|
|
#endif
|
|
static char const tzdirslash[sizeof TZDIR + OPENAT_TZDIR] = TZDIR "/";
|
|
enum { tzdirslashlen = sizeof TZDIR };
|
|
#ifdef PATH_MAX
|
|
static_assert(tzdirslashlen <= PATH_MAX); /* Sanity check; assumed below. */
|
|
#endif
|
|
|
|
/* Local storage needed for 'tzloadbody'. */
|
|
union local_storage {
|
|
/* The results of analyzing the file's contents after it is opened. */
|
|
struct file_analysis {
|
|
/* The input buffer. */
|
|
union input_buffer u;
|
|
|
|
/* A temporary state used for parsing a TZ string in the file. */
|
|
struct state st;
|
|
} u;
|
|
|
|
#if defined PATH_MAX && !OPENAT_TZDIR && !SUPPRESS_TZDIR
|
|
/* The name of the file to be opened. */
|
|
char fullname[PATH_MAX];
|
|
#endif
|
|
};
|
|
|
|
/* These tzload flags can be ORed together, and fit into 'char'. */
|
|
|
|
/* TZLOAD_FROMENV means the TZ string is a process-wide setting either
|
|
taken from the TZ environment variable or inferred from TZ being unset.
|
|
When 0 <= tz_change_interval, TZLOAD_FROMENV lets us skip reanalysis
|
|
of a TZif file that did not change during the interval. */
|
|
enum { TZLOAD_FROMENV = 1 };
|
|
|
|
/* Read any newline-surrounded TZ string. */
|
|
enum { TZLOAD_TZSTRING = 2 };
|
|
|
|
/* TZ should be a file under TZDIR. */
|
|
enum { TZLOAD_TZDIR_SUB = 4 };
|
|
|
|
|
|
/* Load tz data from the file named NAME into *SP. Respect TZLOADFLAGS.
|
|
Use **LSPP for temporary storage. Return 0 on
|
|
success, an errno value on failure. */
|
|
static int
|
|
tzloadbody(char const *name, struct state *sp, char tzloadflags,
|
|
union local_storage **lspp)
|
|
{
|
|
register int i;
|
|
register int fid;
|
|
register int stored;
|
|
register ssize_t nread;
|
|
char const *relname;
|
|
union local_storage *lsp = *lspp;
|
|
union input_buffer *up;
|
|
register int tzheadsize = sizeof(struct tzhead);
|
|
int dd = AT_FDCWD;
|
|
int oflags = (O_RDONLY | O_BINARY | O_CLOEXEC | O_CLOFORK
|
|
| O_IGNORE_CTTY | O_NOCTTY | O_REGULAR);
|
|
bool might_escape = false;
|
|
int err;
|
|
struct stat st;
|
|
st.st_ctime = 0;
|
|
|
|
sp->goahead = false;
|
|
|
|
if (! name) {
|
|
name = TZDEFAULT;
|
|
if (! name)
|
|
return EINVAL;
|
|
/* Omit "tzloadflags &= ~TZLOAD_FROMENV;" here, as that
|
|
would hurt performance by rereading and reanalyzing the
|
|
TZDEFAULT file even when it is unchanged. */
|
|
}
|
|
|
|
if (name[0] == ':')
|
|
++name;
|
|
|
|
relname = name;
|
|
|
|
/* If the program is privileged, NAME is TZDEFAULT or
|
|
subsidiary to TZDIR. Also, NAME is not a device. */
|
|
if (name[0] == '/' && strcmp(name, TZDEFAULT) != 0) {
|
|
if (!SUPPRESS_TZDIR
|
|
&& strncmp(relname, tzdirslash, tzdirslashlen) == 0)
|
|
for (relname += tzdirslashlen; *relname == '/'; relname++)
|
|
continue;
|
|
else if (issetugid())
|
|
return ENOTCAPABLE;
|
|
else
|
|
might_escape = true;
|
|
}
|
|
|
|
if (relname[0] != '/') {
|
|
if (!OPENAT_TZDIR || !O_RESOLVE_BENEATH) {
|
|
/* Fail if a relative name contains a non-terminal ".." component,
|
|
as such a name could read a non-directory outside TZDIR
|
|
when AT_FDCWD and O_RESOLVE_BENEATH are not available. */
|
|
char const *component;
|
|
for (component = relname; component[0]; component++)
|
|
if (component[0] == '.' && component[1] == '.'
|
|
&& component[2] == '/'
|
|
&& (component == relname || component[-1] == '/')) {
|
|
if (issetugid())
|
|
return ENOTCAPABLE;
|
|
might_escape = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (OPENAT_TZDIR && !SUPPRESS_TZDIR) {
|
|
/* Prefer O_SEARCH or O_PATH if available;
|
|
O_RDONLY should be OK too, as TZDIR is invariably readable.
|
|
O_DIRECTORY should be redundant but might help
|
|
on old platforms that mishandle trailing '/'. */
|
|
dd = open(tzdirslash,
|
|
((O_SEARCH ? O_SEARCH : O_PATH ? O_PATH : O_RDONLY)
|
|
| O_BINARY | O_CLOEXEC | O_CLOFORK | O_DIRECTORY));
|
|
if (dd < 0)
|
|
return errno;
|
|
if (O_RESOLVE_BENEATH && issetugid()) {
|
|
oflags |= O_RESOLVE_BENEATH;
|
|
might_escape = false;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (!OPENAT_TZDIR && !SUPPRESS_TZDIR && name[0] != '/') {
|
|
char *cp;
|
|
size_t fullnamesize;
|
|
#ifdef PATH_MAX
|
|
size_t namesizemax = PATH_MAX - tzdirslashlen;
|
|
size_t namelen = strnlen (name, namesizemax);
|
|
if (namesizemax <= namelen)
|
|
return ENAMETOOLONG;
|
|
#else
|
|
size_t namelen = strlen (name);
|
|
#endif
|
|
fullnamesize = tzdirslashlen + namelen + 1;
|
|
|
|
/* Create a string "TZDIR/NAME". Using sprintf here
|
|
would pull in stdio (and would fail if the
|
|
resulting string length exceeded INT_MAX!). */
|
|
if (ALL_STATE || sizeof *lsp < fullnamesize) {
|
|
lsp = malloc(max(sizeof *lsp, fullnamesize));
|
|
if (!lsp)
|
|
return HAVE_MALLOC_ERRNO ? errno : ENOMEM;
|
|
*lspp = lsp;
|
|
}
|
|
cp = mempcpy(lsp, tzdirslash, tzdirslashlen);
|
|
cp = mempcpy(cp, name, namelen);
|
|
*cp = '\0';
|
|
#if defined PATH_MAX && !OPENAT_TZDIR && !SUPPRESS_TZDIR
|
|
name = lsp->fullname;
|
|
#else
|
|
name = (char *) lsp;
|
|
#endif
|
|
}
|
|
|
|
/* For a platform that lacks O_REGULAR and a file that might
|
|
be outside TZDIR, check that it is a regular file,
|
|
as merely opening a device could have unwanted side effects.
|
|
Though racy, there is no portable way to fix the race. */
|
|
if (!O_REGULAR && might_escape) {
|
|
/* (oflags & O_RESOLVE_BENEATH) must be zero here. */
|
|
if ((OPENAT_TZDIR ? fstatat(dd, relname, &st, 0) : stat(name, &st))
|
|
< 0)
|
|
return errno;
|
|
if (!S_ISREG(st.st_mode))
|
|
return EFTYPE;
|
|
}
|
|
fid = OPENAT_TZDIR ? openat(dd, relname, oflags) : open(name, oflags);
|
|
err = errno;
|
|
if (0 <= dd)
|
|
close(dd);
|
|
if (fid < 0)
|
|
return err;
|
|
|
|
/* If detecting changes to the the primary TZif file's state and
|
|
the file's status is unchanged, save time by returning now.
|
|
Otherwise read the file's contents. Close the file either way. */
|
|
if (0 <= tz_change_interval && (tzloadflags & TZLOAD_FROMENV)
|
|
&& !tzfile_changed(fid, &st))
|
|
err = -1;
|
|
else {
|
|
if (ALL_STATE && !lsp) {
|
|
lsp = malloc(sizeof *lsp);
|
|
if (!lsp)
|
|
return HAVE_MALLOC_ERRNO ? errno : ENOMEM;
|
|
*lspp = lsp;
|
|
}
|
|
up = &lsp->u.u;
|
|
nread = read(fid, up->buf, sizeof up->buf);
|
|
err = tzheadsize <= nread ? 0 : nread < 0 ? errno : EFTYPE;
|
|
}
|
|
close(fid);
|
|
if (err)
|
|
return err < 0 ? 0 : err;
|
|
|
|
for (stored = 4; stored <= 8; stored *= 2) {
|
|
char version = up->tzhead.tzh_version[0];
|
|
bool skip_datablock = stored == 4 && version;
|
|
int_fast32_t datablock_size;
|
|
int_fast32_2s
|
|
ttisstdcnt = detzcode(up->tzhead.tzh_ttisstdcnt),
|
|
ttisutcnt = detzcode(up->tzhead.tzh_ttisutcnt),
|
|
leapcnt = detzcode(up->tzhead.tzh_leapcnt),
|
|
timecnt = detzcode(up->tzhead.tzh_timecnt),
|
|
typecnt = detzcode(up->tzhead.tzh_typecnt),
|
|
charcnt = detzcode(up->tzhead.tzh_charcnt);
|
|
char const *p = up->buf + tzheadsize;
|
|
/* Although tzfile(5) currently requires typecnt to be nonzero,
|
|
support future formats that may allow zero typecnt
|
|
in files that have a TZ string and no transitions. */
|
|
if (! (0 <= leapcnt
|
|
&& leapcnt <= (TZ_RUNTIME_LEAPS ? TZ_MAX_LEAPS : 0)
|
|
&& 0 <= typecnt && typecnt <= TZ_MAX_TYPES
|
|
&& 0 <= timecnt && timecnt <= TZ_MAX_TIMES
|
|
&& 0 <= charcnt && charcnt <= TZ_MAX_CHARS
|
|
&& 0 <= ttisstdcnt && ttisstdcnt <= TZ_MAX_TYPES
|
|
&& 0 <= ttisutcnt && ttisutcnt <= TZ_MAX_TYPES))
|
|
return EFTYPE;
|
|
datablock_size
|
|
= (timecnt * stored /* ats */
|
|
+ timecnt /* types */
|
|
+ typecnt * 6 /* ttinfos */
|
|
+ charcnt /* chars */
|
|
+ leapcnt * (stored + 4) /* lsinfos */
|
|
+ ttisstdcnt /* ttisstds */
|
|
+ ttisutcnt); /* ttisuts */
|
|
if (nread < tzheadsize + datablock_size)
|
|
return EFTYPE;
|
|
if (skip_datablock)
|
|
p += datablock_size;
|
|
else if (! ((ttisstdcnt == typecnt || ttisstdcnt == 0)
|
|
&& (ttisutcnt == typecnt || ttisutcnt == 0)))
|
|
return EFTYPE;
|
|
else {
|
|
int_fast64_t prevtr = -1;
|
|
int_fast32_2s prevcorr;
|
|
set_leapcount(sp, leapcnt);
|
|
sp->timecnt = timecnt;
|
|
sp->typecnt = typecnt;
|
|
sp->charcnt = charcnt;
|
|
|
|
/* Read transitions, discarding those out of time_t range.
|
|
But pretend the last transition before TIME_T_MIN
|
|
occurred at TIME_T_MIN. */
|
|
timecnt = 0;
|
|
for (i = 0; i < sp->timecnt; ++i) {
|
|
int_fast64_t at
|
|
= stored == 4 ? detzcode(p) : detzcode64(p);
|
|
sp->types[i] = at <= TIME_T_MAX;
|
|
if (sp->types[i]) {
|
|
time_t attime
|
|
= ((TYPE_SIGNED(time_t) ? at < TIME_T_MIN : at < 0)
|
|
? TIME_T_MIN : at);
|
|
if (timecnt && attime <= sp->ats[timecnt - 1]) {
|
|
if (attime < sp->ats[timecnt - 1])
|
|
return EFTYPE;
|
|
sp->types[i - 1] = 0;
|
|
timecnt--;
|
|
}
|
|
sp->ats[timecnt++] = attime;
|
|
}
|
|
p += stored;
|
|
}
|
|
|
|
timecnt = 0;
|
|
for (i = 0; i < sp->timecnt; ++i) {
|
|
unsigned char typ = *p++;
|
|
if (sp->typecnt <= typ)
|
|
return EFTYPE;
|
|
if (sp->types[i])
|
|
sp->types[timecnt++] = typ;
|
|
}
|
|
sp->timecnt = timecnt;
|
|
for (i = 0; i < sp->typecnt; ++i) {
|
|
register struct ttinfo * ttisp;
|
|
unsigned char isdst, desigidx;
|
|
int_fast32_2s utoff = detzcode(p);
|
|
|
|
/* Reject a UT offset equal to -2**31, as it might
|
|
cause trouble both in this file and in callers.
|
|
Also, it violates RFC 9636 section 3.2. */
|
|
if (utoff < -TWO_31_MINUS_1)
|
|
return EFTYPE;
|
|
|
|
ttisp = &sp->ttis[i];
|
|
ttisp->tt_utoff = utoff;
|
|
p += 4;
|
|
isdst = *p++;
|
|
if (! (isdst < 2))
|
|
return EFTYPE;
|
|
ttisp->tt_isdst = isdst;
|
|
desigidx = *p++;
|
|
if (! (desigidx < sp->charcnt))
|
|
return EFTYPE;
|
|
ttisp->tt_desigidx = desigidx;
|
|
}
|
|
for (i = 0; i < sp->charcnt; ++i)
|
|
sp->chars[i] = *p++;
|
|
/* Ensure '\0'-terminated, and make it safe to call
|
|
ttunspecified later. */
|
|
memset(&sp->chars[i], 0, CHARS_EXTRA);
|
|
|
|
/* Read leap seconds, discarding those out of time_t range. */
|
|
leapcnt = 0;
|
|
for (i = 0; i < leapcount(sp); i++) {
|
|
int_fast64_t tr = stored == 4 ? detzcode(p) : detzcode64(p);
|
|
int_fast32_2s corr = detzcode(p + stored);
|
|
p += stored + 4;
|
|
|
|
/* Leap seconds cannot occur before the Epoch,
|
|
or out of order. */
|
|
if (tr <= prevtr)
|
|
return EFTYPE;
|
|
|
|
/* To avoid other botches in this code, each leap second's
|
|
correction must differ from the previous one's by 1
|
|
second or less, except that the first correction can be
|
|
any value; these requirements are more generous than
|
|
RFC 9636, to allow future RFC extensions. */
|
|
if (! (i == 0
|
|
|| (prevcorr < corr
|
|
? corr == prevcorr + 1
|
|
: (corr == prevcorr
|
|
|| corr == prevcorr - 1))))
|
|
return EFTYPE;
|
|
prevtr = tr;
|
|
prevcorr = corr;
|
|
|
|
if (tr <= TIME_T_MAX) {
|
|
struct lsinfo ls;
|
|
ls.ls_trans = tr;
|
|
ls.ls_corr = corr;
|
|
set_lsinfo(sp, leapcnt, ls);
|
|
leapcnt++;
|
|
}
|
|
}
|
|
set_leapcount(sp, leapcnt);
|
|
|
|
/* Do not bother to validate standard/wall and UT/local
|
|
indicators, as they are no longer used here. */
|
|
p += ttisstdcnt + ttisutcnt;
|
|
}
|
|
|
|
nread -= p - up->buf;
|
|
memmove(up->buf, p, nread);
|
|
|
|
/* If this is an old file, we're done. */
|
|
if (!version)
|
|
break;
|
|
}
|
|
if ((tzloadflags & TZLOAD_TZSTRING) && nread > 2 &&
|
|
up->buf[0] == '\n' && up->buf[nread - 1] == '\n') {
|
|
struct state *ts = &lsp->u.st;
|
|
|
|
up->buf[nread - 1] = '\0';
|
|
if (!tzparse(&up->buf[1], ts, sp))
|
|
return EFTYPE;
|
|
else {
|
|
/* Attempt to reuse existing abbreviations.
|
|
Without this, America/Anchorage would
|
|
consume 50 bytes for abbreviations, as
|
|
sp->charcnt equals 40 (for LMT AST AWT APT AHST
|
|
AHDT YST AKDT AKST) and ts->charcnt equals 10
|
|
(for AKST AKDT). Reusing means sp->charcnt can
|
|
stay 40 in this example. */
|
|
int charcnt = sp->charcnt;
|
|
for (i = 0; i < ts->typecnt; i++) {
|
|
char *tsabbr = ts->chars + ts->ttis[i].tt_desigidx;
|
|
int j;
|
|
for (j = 0; j < charcnt; j++)
|
|
if (strcmp(sp->chars + j, tsabbr) == 0) {
|
|
ts->ttis[i].tt_desigidx = j;
|
|
break;
|
|
}
|
|
if (! (j < charcnt)) {
|
|
int tsabbrlen = strnlen(tsabbr, TZ_MAX_CHARS - j);
|
|
if (TZ_MAX_CHARS <= j + tsabbrlen)
|
|
return EOVERFLOW;
|
|
else {
|
|
char *cp = sp->chars + j;
|
|
cp = mempcpy(cp, tsabbr, tsabbrlen);
|
|
*cp = '\0';
|
|
charcnt = j + tsabbrlen + 1;
|
|
ts->ttis[i].tt_desigidx = j;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (TZ_MAX_TYPES - sp->typecnt < ts->typecnt)
|
|
return EOVERFLOW;
|
|
else {
|
|
sp->charcnt = charcnt;
|
|
|
|
/* Ignore any trailing, no-op transitions generated
|
|
by zic as they don't help here and can run afoul
|
|
of bugs in zic 2016j or earlier. */
|
|
while (1 < sp->timecnt
|
|
&& (sp->types[sp->timecnt - 1]
|
|
== sp->types[sp->timecnt - 2]))
|
|
sp->timecnt--;
|
|
|
|
sp->goahead = ts->goahead;
|
|
|
|
for (i = 0; i < ts->timecnt; i++) {
|
|
time_t t = ts->ats[i];
|
|
if (increment_overflow_time(&t, leapcorr(sp, t))
|
|
|| (0 < sp->timecnt
|
|
&& t <= sp->ats[sp->timecnt - 1]))
|
|
continue;
|
|
if (TZ_MAX_TIMES <= sp->timecnt)
|
|
return EOVERFLOW;
|
|
sp->ats[sp->timecnt] = t;
|
|
sp->types[sp->timecnt] = (sp->typecnt
|
|
+ ts->types[i]);
|
|
sp->timecnt++;
|
|
}
|
|
for (i = 0; i < ts->typecnt; i++)
|
|
sp->ttis[sp->typecnt++] = ts->ttis[i];
|
|
}
|
|
}
|
|
}
|
|
if (sp->typecnt == 0)
|
|
return EFTYPE;
|
|
|
|
return 0;
|
|
}
|
|
|
|
/* Load tz data from the file named NAME into *SP. Respect TZLOADFLAGS.
|
|
Return 0 on success, an errno value on failure. */
|
|
static int
|
|
tzload(char const *name, struct state *sp, char tzloadflags)
|
|
{
|
|
int r;
|
|
union local_storage *lsp0;
|
|
union local_storage *lsp;
|
|
#if ALL_STATE
|
|
lsp = NULL;
|
|
#else
|
|
union local_storage ls;
|
|
lsp = &ls;
|
|
#endif
|
|
lsp0 = lsp;
|
|
r = tzloadbody(name, sp, tzloadflags, &lsp);
|
|
if (lsp != lsp0)
|
|
free(lsp);
|
|
return r;
|
|
}
|
|
|
|
static const int mon_lengths[2][MONSPERYEAR] = {
|
|
{ 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 },
|
|
{ 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }
|
|
};
|
|
|
|
/* Is C an ASCII digit? */
|
|
static bool
|
|
is_digit(char c)
|
|
{
|
|
return '0' <= c && c <= '9';
|
|
}
|
|
|
|
/*
|
|
** Given a pointer into a timezone string, scan until a character that is not
|
|
** a valid character in a time zone abbreviation is found.
|
|
** Return a pointer to that character.
|
|
*/
|
|
|
|
ATTRIBUTE_PURE_114833 static const char *
|
|
getzname(register const char *strp)
|
|
{
|
|
register char c;
|
|
|
|
while ((c = *strp) != '\0' && !is_digit(c) && c != ',' && c != '-' &&
|
|
c != '+')
|
|
++strp;
|
|
return strp;
|
|
}
|
|
|
|
/*
|
|
** Given a pointer into an extended timezone string, scan until the ending
|
|
** delimiter of the time zone abbreviation is located.
|
|
** Return a pointer to the delimiter.
|
|
**
|
|
** As with getzname above, the legal character set is actually quite
|
|
** restricted, with other characters producing undefined results.
|
|
** We don't do any checking here; checking is done later in common-case code.
|
|
*/
|
|
|
|
ATTRIBUTE_PURE_114833 static const char *
|
|
getqzname(register const char *strp, const int delim)
|
|
{
|
|
register int c;
|
|
|
|
while ((c = *strp) != '\0' && c != delim)
|
|
++strp;
|
|
return strp;
|
|
}
|
|
|
|
/*
|
|
** Given a pointer into a timezone string, extract a number from that string.
|
|
** Check that the number is within a specified range; if it is not, return
|
|
** NULL.
|
|
** Otherwise, return a pointer to the first character not part of the number.
|
|
*/
|
|
|
|
static const char *
|
|
getnum(register const char *strp, int *const nump, const int min, const int max)
|
|
{
|
|
register char c;
|
|
register int num;
|
|
|
|
if (strp == NULL || !is_digit(c = *strp))
|
|
return NULL;
|
|
num = 0;
|
|
do {
|
|
num = num * 10 + (c - '0');
|
|
if (num > max)
|
|
return NULL; /* illegal value */
|
|
c = *++strp;
|
|
} while (is_digit(c));
|
|
if (num < min)
|
|
return NULL; /* illegal value */
|
|
*nump = num;
|
|
return strp;
|
|
}
|
|
|
|
/*
|
|
** Given a pointer into a timezone string, extract a number of seconds,
|
|
** in hh[:mm[:ss]] form, from the string.
|
|
** If any error occurs, return NULL.
|
|
** Otherwise, return a pointer to the first character not part of the number
|
|
** of seconds.
|
|
*/
|
|
|
|
static const char *
|
|
getsecs(register const char *strp, int_fast32_t *const secsp)
|
|
{
|
|
int num;
|
|
int_fast32_t secsperhour = SECSPERHOUR;
|
|
|
|
/*
|
|
** 'HOURSPERDAY * DAYSPERWEEK - 1' allows quasi-POSIX rules like
|
|
** "M10.4.6/26", which does not conform to POSIX,
|
|
** but which specifies the equivalent of
|
|
** "02:00 on the first Sunday on or after 23 Oct".
|
|
*/
|
|
strp = getnum(strp, &num, 0, HOURSPERDAY * DAYSPERWEEK - 1);
|
|
if (strp == NULL)
|
|
return NULL;
|
|
*secsp = num * secsperhour;
|
|
if (*strp == ':') {
|
|
++strp;
|
|
strp = getnum(strp, &num, 0, MINSPERHOUR - 1);
|
|
if (strp == NULL)
|
|
return NULL;
|
|
*secsp += num * SECSPERMIN;
|
|
if (*strp == ':') {
|
|
++strp;
|
|
/* 'SECSPERMIN' allows for leap seconds. */
|
|
strp = getnum(strp, &num, 0, SECSPERMIN);
|
|
if (strp == NULL)
|
|
return NULL;
|
|
*secsp += num;
|
|
}
|
|
}
|
|
return strp;
|
|
}
|
|
|
|
/*
|
|
** Given a pointer into a timezone string, extract an offset, in
|
|
** [+-]hh[:mm[:ss]] form, from the string.
|
|
** If any error occurs, return NULL.
|
|
** Otherwise, return a pointer to the first character not part of the time.
|
|
*/
|
|
|
|
static const char *
|
|
getoffset(register const char *strp, int_fast32_t *const offsetp)
|
|
{
|
|
register bool neg = false;
|
|
|
|
if (*strp == '-') {
|
|
neg = true;
|
|
++strp;
|
|
} else if (*strp == '+')
|
|
++strp;
|
|
strp = getsecs(strp, offsetp);
|
|
if (strp == NULL)
|
|
return NULL; /* illegal time */
|
|
if (neg)
|
|
*offsetp = -*offsetp;
|
|
return strp;
|
|
}
|
|
|
|
/*
|
|
** Given a pointer into a timezone string, extract a rule in the form
|
|
** date[/time]. See POSIX Base Definitions section 8.3 variable TZ
|
|
** for the format of "date" and "time".
|
|
** If a valid rule is not found, return NULL.
|
|
** Otherwise, return a pointer to the first character not part of the rule.
|
|
*/
|
|
|
|
static const char *
|
|
getrule(const char *strp, register struct rule *const rulep)
|
|
{
|
|
if (*strp == 'J') {
|
|
/*
|
|
** Julian day.
|
|
*/
|
|
rulep->r_type = JULIAN_DAY;
|
|
++strp;
|
|
strp = getnum(strp, &rulep->r_day, 1, DAYSPERNYEAR);
|
|
} else if (*strp == 'M') {
|
|
/*
|
|
** Month, week, day.
|
|
*/
|
|
rulep->r_type = MONTH_NTH_DAY_OF_WEEK;
|
|
++strp;
|
|
strp = getnum(strp, &rulep->r_mon, 1, MONSPERYEAR);
|
|
if (strp == NULL)
|
|
return NULL;
|
|
if (*strp++ != '.')
|
|
return NULL;
|
|
strp = getnum(strp, &rulep->r_week, 1, 5);
|
|
if (strp == NULL)
|
|
return NULL;
|
|
if (*strp++ != '.')
|
|
return NULL;
|
|
strp = getnum(strp, &rulep->r_day, 0, DAYSPERWEEK - 1);
|
|
} else if (is_digit(*strp)) {
|
|
/*
|
|
** Day of year.
|
|
*/
|
|
rulep->r_type = DAY_OF_YEAR;
|
|
strp = getnum(strp, &rulep->r_day, 0, DAYSPERLYEAR - 1);
|
|
} else return NULL; /* invalid format */
|
|
if (strp == NULL)
|
|
return NULL;
|
|
if (*strp == '/') {
|
|
/*
|
|
** Time specified.
|
|
*/
|
|
++strp;
|
|
strp = getoffset(strp, &rulep->r_time);
|
|
} else rulep->r_time = 2 * SECSPERHOUR; /* default = 2:00:00 */
|
|
return strp;
|
|
}
|
|
|
|
/*
|
|
** Given a year, a rule, and the offset from UT at the time that rule takes
|
|
** effect, calculate the year-relative time that rule takes effect.
|
|
*/
|
|
|
|
static int_fast32_t
|
|
transtime(time_t year, register const struct rule *const rulep,
|
|
const int_fast32_t offset)
|
|
{
|
|
int d; /* Day of year (zero-origin). */
|
|
register bool leapyear;
|
|
|
|
leapyear = isleap(year);
|
|
|
|
if (rulep->r_type <= DAY_OF_YEAR) {
|
|
/*
|
|
** Jn - Julian day, 1 == January 1, 60 == March 1 even in leap
|
|
** years.
|
|
** In non-leap years, or if the day number is 59 or less, just
|
|
** use the day number - 1.
|
|
**
|
|
** n - day of year.
|
|
*/
|
|
d = rulep->r_day - ((rulep->r_type < DAY_OF_YEAR)
|
|
& (!leapyear | (rulep->r_day <= 59)));
|
|
} else {
|
|
/*
|
|
** Mm.n.d - nth "dth day" of month m.
|
|
*/
|
|
|
|
/*
|
|
** Use Zeller's Congruence to get day-of-week of first day of
|
|
** month.
|
|
*/
|
|
int i;
|
|
bool janfeb = rulep->r_mon <= 2;
|
|
int month = (rulep->r_mon
|
|
+ (janfeb ? MONSPERYEAR : 0)); /* 3..14 */
|
|
int adjustment = (TYPE_SIGNED(time_t) ? 0 : 400) - janfeb;
|
|
int ay_rem = (year + adjustment) % YEARSPERREPEAT;
|
|
int y = ay_rem + (ay_rem < 0 ? YEARSPERREPEAT : 0);
|
|
int dow = (((13 * (month + 1)) / 5
|
|
+ y + y / 4 - y / 100 + y / 400)
|
|
% DAYSPERWEEK);
|
|
|
|
/*
|
|
** "dow" is the day-of-week of the first day of the month. Get
|
|
** the day-of-month (zero-origin) of the first "dow" day of the
|
|
** month.
|
|
*/
|
|
d = rulep->r_day - dow;
|
|
d += (rulep->r_week - (0 <= d)) * DAYSPERWEEK;
|
|
if (mon_lengths[leapyear][rulep->r_mon - 1] <= d)
|
|
d -= DAYSPERWEEK;
|
|
|
|
/*
|
|
** "d" is the day-of-month (zero-origin) of the day we want.
|
|
*/
|
|
for (i = 0; i < rulep->r_mon - 1; ++i)
|
|
d += mon_lengths[leapyear][i];
|
|
}
|
|
|
|
/*
|
|
** d is the origin-0 year-relative day in
|
|
** question. To get the year-relative time of the specified local
|
|
** time on that day, add the transition time and the current offset
|
|
** from UT to d * SECSPERDAY.
|
|
*/
|
|
return d * SECSPERDAY + rulep->r_time + offset;
|
|
}
|
|
|
|
/*
|
|
** Given a POSIX.1 proleptic TZ string, fill in the rule tables as
|
|
** appropriate.
|
|
*/
|
|
|
|
static bool
|
|
tzparse(const char *name, struct state *sp, struct state const *basep)
|
|
{
|
|
const char * stdname;
|
|
const char * dstname;
|
|
int_fast32_t stdoffset;
|
|
int_fast32_t dstoffset;
|
|
register char * cp;
|
|
ptrdiff_t stdlen, dstlen, charcnt;
|
|
time_t atlo = TIME_T_MIN, leaplo = TIME_T_MIN;
|
|
|
|
stdname = name;
|
|
if (*name == '<') {
|
|
name++;
|
|
stdname = name;
|
|
name = getqzname(name, '>');
|
|
if (*name != '>')
|
|
return false;
|
|
stdlen = name - stdname;
|
|
name++;
|
|
} else {
|
|
name = getzname(name);
|
|
stdlen = name - stdname;
|
|
}
|
|
if (! (0 < stdlen && stdlen <= TZNAME_MAXIMUM))
|
|
return false;
|
|
name = getoffset(name, &stdoffset);
|
|
if (name == NULL)
|
|
return false;
|
|
charcnt = stdlen + 1;
|
|
if (basep) {
|
|
if (0 < basep->timecnt)
|
|
atlo = basep->ats[basep->timecnt - 1];
|
|
set_leapcount(sp, leapcount(basep));
|
|
if (0 < leapcount(sp)) {
|
|
int i;
|
|
for (i = 0; i < leapcount(sp); i++)
|
|
set_lsinfo(sp, i, lsinfo(basep, i));
|
|
leaplo = lsinfo(sp, leapcount(sp) - 1).ls_trans;
|
|
}
|
|
} else
|
|
set_leapcount(sp, 0); /* So, we're off a little. */
|
|
sp->goahead = false;
|
|
if (*name != '\0') {
|
|
struct rule start, end;
|
|
int timecnt;
|
|
time_t janfirst, repeatbeg, year, yearbeg, yearlim;
|
|
int_fast32_t janoffset = 0;
|
|
|
|
if (*name == '<') {
|
|
dstname = ++name;
|
|
name = getqzname(name, '>');
|
|
if (*name != '>')
|
|
return false;
|
|
dstlen = name - dstname;
|
|
name++;
|
|
} else {
|
|
dstname = name;
|
|
name = getzname(name);
|
|
dstlen = name - dstname; /* length of DST abbr. */
|
|
}
|
|
if (! (0 < dstlen && dstlen <= TZNAME_MAXIMUM))
|
|
return false;
|
|
charcnt += dstlen + 1;
|
|
if (*name != '\0' && *name != ',' && *name != ';') {
|
|
name = getoffset(name, &dstoffset);
|
|
if (name == NULL)
|
|
return false;
|
|
} else dstoffset = stdoffset - SECSPERHOUR;
|
|
|
|
if (*name == '\0')
|
|
name = TZDEFRULESTRING;
|
|
if (! (*name == ',' || *name == ';'))
|
|
return false;
|
|
|
|
name = getrule(name + 1, &start);
|
|
if (!name)
|
|
return false;
|
|
if (*name++ != ',')
|
|
return false;
|
|
name = getrule(name, &end);
|
|
if (!name || *name)
|
|
return false;
|
|
sp->typecnt = 2; /* standard time and DST */
|
|
|
|
/* Two transitions per year, from atlo forward, and going on
|
|
for years_of_observations past max(atlo, leaplo). */
|
|
init_ttinfo(&sp->ttis[0], -stdoffset, false, 0);
|
|
init_ttinfo(&sp->ttis[1], -dstoffset, true, stdlen + 1);
|
|
timecnt = 0;
|
|
repeatbeg = (atlo / SECSPERREPEAT
|
|
+ (atlo < 0 && 0 < atlo % SECSPERREPEAT));
|
|
yearbeg = repeatbeg * YEARSPERREPEAT + EPOCH_YEAR;
|
|
janfirst = repeatbeg * SECSPERREPEAT;
|
|
|
|
do {
|
|
int_fast32_t yearsecs
|
|
= year_days(yearbeg - 1) * SECSPERDAY;
|
|
time_t janfirst1 = janfirst;
|
|
yearbeg--;
|
|
if (increment_overflow_time(&janfirst1, -yearsecs)) {
|
|
janoffset = -yearsecs;
|
|
break;
|
|
}
|
|
janfirst = janfirst1;
|
|
} while (atlo < janfirst);
|
|
|
|
while (true) {
|
|
int_fast32_t yearsecs
|
|
= year_days(yearbeg) * SECSPERDAY;
|
|
time_t janfirst1 = janfirst;
|
|
if (increment_overflow_time(&janfirst1, yearsecs)
|
|
|| atlo <= janfirst1)
|
|
break;
|
|
yearbeg++;
|
|
janfirst = janfirst1;
|
|
}
|
|
|
|
yearlim = yearbeg + years_of_observations;
|
|
for (year = yearbeg; year < yearlim; year++) {
|
|
int_fast32_t
|
|
starttime = transtime(year, &start, stdoffset),
|
|
endtime = transtime(year, &end, dstoffset),
|
|
yearsecs = year_days(year) * SECSPERDAY;
|
|
bool reversed = endtime < starttime;
|
|
if (reversed) {
|
|
int_fast32_t swap = starttime;
|
|
starttime = endtime;
|
|
endtime = swap;
|
|
}
|
|
if (reversed
|
|
|| (starttime < endtime
|
|
&& endtime - starttime < yearsecs)) {
|
|
time_t at_added = TIME_T_MAX;
|
|
time_t at = janfirst;
|
|
if (! increment_overflow_time(&at, janoffset + starttime)
|
|
&& atlo <= at) {
|
|
if (TZ_MAX_TIMES <= timecnt)
|
|
return false;
|
|
sp->ats[timecnt] = at_added = at;
|
|
sp->types[timecnt++] = !reversed;
|
|
}
|
|
at = janfirst;
|
|
if (! increment_overflow_time(&at, janoffset + endtime)
|
|
&& atlo <= at) {
|
|
if (TZ_MAX_TIMES <= timecnt)
|
|
return false;
|
|
sp->ats[timecnt] = at_added = at;
|
|
sp->types[timecnt++] = reversed;
|
|
}
|
|
if (at_added < leaplo)
|
|
yearlim = year + years_of_observations;
|
|
}
|
|
if (increment_overflow_time(&janfirst, janoffset + yearsecs))
|
|
break;
|
|
janoffset = 0;
|
|
}
|
|
sp->timecnt = timecnt;
|
|
if (! timecnt) {
|
|
sp->ttis[0] = sp->ttis[1];
|
|
sp->typecnt = 1; /* Perpetual DST. */
|
|
} else if (years_of_observations <= year - yearbeg)
|
|
sp->goahead = true;
|
|
} else {
|
|
dstlen = 0;
|
|
sp->typecnt = 1; /* only standard time */
|
|
sp->timecnt = 0;
|
|
init_ttinfo(&sp->ttis[0], -stdoffset, false, 0);
|
|
}
|
|
sp->charcnt = charcnt;
|
|
cp = sp->chars;
|
|
cp = mempcpy(cp, stdname, stdlen);
|
|
*cp++ = '\0';
|
|
if (dstlen != 0) {
|
|
cp = mempcpy(cp, dstname, dstlen);
|
|
*cp = '\0';
|
|
}
|
|
return true;
|
|
}
|
|
|
|
static void
|
|
gmtload(struct state *const sp)
|
|
{
|
|
if (!TZ_RUNTIME_LEAPS || tzload(etc_utc, sp, TZLOAD_TZSTRING) != 0)
|
|
tzparse("UTC0", sp, NULL);
|
|
}
|
|
|
|
#if !USE_TIMEX_T || !defined TM_GMTOFF
|
|
|
|
/* Return true if primary cached time zone data are fresh,
|
|
i.e., if this function is known to have recently returned false.
|
|
A call is recent if it occurred less than tz_change_interval seconds ago.
|
|
NOW should be the current time. */
|
|
static bool
|
|
fresh_tzdata(monotime_t now)
|
|
{
|
|
/* If nonzero, the time of the last false return. */
|
|
static monotime_t last_checked;
|
|
|
|
if (last_checked && now - last_checked < tz_change_interval)
|
|
return true;
|
|
last_checked = now;
|
|
return false;
|
|
}
|
|
|
|
/* Initialize *SP to a value appropriate for the TZ setting NAME.
|
|
Respect TZLOADFLAGS.
|
|
Return 0 on success, an errno value on failure. */
|
|
static int
|
|
zoneinit(struct state *sp, char const *name, char tzloadflags)
|
|
{
|
|
if (name && ! name[0]) {
|
|
/*
|
|
** User wants it fast rather than right.
|
|
*/
|
|
set_leapcount(sp, 0); /* so, we're off a little */
|
|
sp->timecnt = 0;
|
|
sp->typecnt = 0;
|
|
sp->charcnt = 0;
|
|
sp->goahead = false;
|
|
init_ttinfo(&sp->ttis[0], 0, false, 0);
|
|
strcpy(sp->chars, utc);
|
|
return 0;
|
|
} else {
|
|
int err = tzload(name, sp, tzloadflags);
|
|
if (err != 0 && name && name[0] != ':' && !(tzloadflags & TZLOAD_TZDIR_SUB)
|
|
&& tzparse(name, sp, NULL))
|
|
err = 0;
|
|
if (err == 0)
|
|
err = scrub_abbrs(sp);
|
|
return err;
|
|
}
|
|
}
|
|
|
|
/* If THREADED, upgrade a read lock to a write lock.
|
|
Return 0 on success, a positive errno value otherwise. */
|
|
static int
|
|
rd2wrlock(ATTRIBUTE_MAYBE_UNUSED bool threaded)
|
|
{
|
|
# if THREAD_RWLOCK
|
|
if (threaded) {
|
|
dounlock();
|
|
return pthread_rwlock_wrlock(&locallock);
|
|
}
|
|
# endif
|
|
return 0;
|
|
}
|
|
|
|
/* Like tzset(), but in a critical section.
|
|
If THREADED && THREAD_RWLOCK the caller has a read lock,
|
|
and this function might upgrade it to a write lock.
|
|
If WALL, act as if TZ is unset; although always false in this file,
|
|
a wrapper .c file's obsolete and ineffective tzsetwall function can use it.
|
|
If tz_change_interval is positive the time is NOW; otherwise ignore NOW. */
|
|
static void
|
|
tzset_unlocked(bool threaded, bool wall, monotime_t now)
|
|
{
|
|
char const *name;
|
|
struct state *sp;
|
|
char tzloadflags;
|
|
size_t namelen;
|
|
bool writing = false;
|
|
|
|
for (;;) {
|
|
name = wall ? NULL : getenv("TZ");
|
|
sp = lclptr;
|
|
tzloadflags = TZLOAD_FROMENV | TZLOAD_TZSTRING;
|
|
namelen = sizeof lcl_TZname + 1; /* placeholder for no name */
|
|
|
|
if (name) {
|
|
namelen = strnlen(name, sizeof lcl_TZname);
|
|
|
|
/* Abbreviate a string like "/usr/share/zoneinfo/America/Los_Angeles"
|
|
to its shorter equivalent "America/Los_Angeles". */
|
|
if (!SUPPRESS_TZDIR && tzdirslashlen < namelen
|
|
&& memcmp(name, tzdirslash, tzdirslashlen) == 0) {
|
|
char const *p = name + tzdirslashlen;
|
|
while (*p == '/')
|
|
p++;
|
|
if (*p && *p != ':') {
|
|
name = p;
|
|
namelen = strnlen(name, sizeof lcl_TZname);
|
|
tzloadflags |= TZLOAD_TZDIR_SUB;
|
|
}
|
|
}
|
|
}
|
|
|
|
if ((tz_change_interval <= 0 ? tz_change_interval < 0 : fresh_tzdata(now))
|
|
&& (name
|
|
? 0 < lcl_is_set && strcmp(lcl_TZname, name) == 0
|
|
: lcl_is_set < 0))
|
|
return;
|
|
|
|
if (!THREAD_RWLOCK || writing)
|
|
break;
|
|
if (rd2wrlock(threaded) != 0)
|
|
return;
|
|
writing = true;
|
|
}
|
|
|
|
# if ALL_STATE
|
|
if (! sp)
|
|
lclptr = sp = malloc(sizeof *lclptr);
|
|
# endif
|
|
if (sp) {
|
|
int err = zoneinit(sp, name, tzloadflags);
|
|
if (err != 0) {
|
|
zoneinit(sp, "", 0);
|
|
/* Abbreviate with "-00" if there was an error.
|
|
Do not treat a missing TZDEFAULT file as an error. */
|
|
if (name || err != ENOENT)
|
|
strcpy(sp->chars, UNSPEC);
|
|
}
|
|
if (namelen < sizeof lcl_TZname) {
|
|
char *cp = lcl_TZname;
|
|
cp = mempcpy(cp, name, namelen);
|
|
*cp = '\0';
|
|
}
|
|
}
|
|
settzname();
|
|
lcl_is_set = (sizeof lcl_TZname > namelen) - (sizeof lcl_TZname < namelen);
|
|
}
|
|
|
|
#endif
|
|
|
|
#if !defined TM_GMTOFF || !USE_TIMEX_T
|
|
|
|
/* If tz_change_interval is positive,
|
|
return the current time as a monotonically nondecreasing value.
|
|
Otherwise the return value does not matter. */
|
|
static monotime_t
|
|
get_monotonic_time(void)
|
|
{
|
|
struct timespec now;
|
|
now.tv_sec = 0;
|
|
if (0 < tz_change_interval)
|
|
clock_gettime(CLOCK_MONOTONIC_COARSE, &now);
|
|
return now.tv_sec;
|
|
}
|
|
#endif
|
|
|
|
#if !USE_TIMEX_T
|
|
|
|
void
|
|
tzset(void)
|
|
{
|
|
monotime_t now = get_monotonic_time();
|
|
int err = lock();
|
|
if (0 < err) {
|
|
errno = err;
|
|
return;
|
|
}
|
|
tzset_unlocked(!err, false, now);
|
|
unlock(!err);
|
|
}
|
|
#endif
|
|
|
|
#ifdef __FreeBSD__
|
|
void
|
|
freebsd13_tzsetwall(void)
|
|
{
|
|
monotime_t now = get_monotonic_time();
|
|
int err = lock();
|
|
if (0 < err) {
|
|
errno = err;
|
|
return;
|
|
}
|
|
tzset_unlocked(!err, true, now);
|
|
unlock(!err);
|
|
}
|
|
__sym_compat(tzsetwall, freebsd13_tzsetwall, FBSD_1.0);
|
|
__warn_references(tzsetwall,
|
|
"warning: tzsetwall() is deprecated, use tzset() instead.");
|
|
#endif /* __FreeBSD__ */
|
|
static void
|
|
gmtcheck1(void)
|
|
{
|
|
#if ALL_STATE
|
|
gmtptr = malloc(sizeof *gmtptr);
|
|
#endif
|
|
if (gmtptr)
|
|
gmtload(gmtptr);
|
|
}
|
|
|
|
static void
|
|
gmtcheck(void)
|
|
{
|
|
static once_t gmt_once = ONCE_INIT;
|
|
once(&gmt_once, gmtcheck1);
|
|
}
|
|
|
|
#if NETBSD_INSPIRED && !USE_TIMEX_T
|
|
|
|
timezone_t
|
|
tzalloc(char const *name)
|
|
{
|
|
timezone_t sp = malloc(sizeof *sp);
|
|
if (sp) {
|
|
int err = zoneinit(sp, name, TZLOAD_TZSTRING);
|
|
if (err != 0) {
|
|
free(sp);
|
|
errno = err;
|
|
return NULL;
|
|
}
|
|
} else if (!HAVE_MALLOC_ERRNO)
|
|
errno = ENOMEM;
|
|
return sp;
|
|
}
|
|
|
|
#ifndef FREE_PRESERVES_ERRNO
|
|
# if ((defined _POSIX_VERSION && 202405 <= _POSIX_VERSION) \
|
|
|| (defined __GLIBC__ && 2 < __GLIBC__ + (33 <= __GLIBC_MINOR__)) \
|
|
|| defined __OpenBSD__ || defined __sun)
|
|
# define FREE_PRESERVES_ERRNO 1
|
|
# else
|
|
# define FREE_PRESERVES_ERRNO 0
|
|
# endif
|
|
#endif
|
|
|
|
void
|
|
tzfree(timezone_t sp)
|
|
{
|
|
int err;
|
|
if (!FREE_PRESERVES_ERRNO)
|
|
err = errno;
|
|
free(sp);
|
|
if (!FREE_PRESERVES_ERRNO)
|
|
errno = err;
|
|
}
|
|
|
|
/*
|
|
** NetBSD 6.1.4 has ctime_rz, but omit it because C23 deprecates ctime and
|
|
** POSIX.1-2024 removes ctime_r. Both have potential security problems that
|
|
** ctime_rz would share. Callers can instead use localtime_rz + strftime.
|
|
**
|
|
** NetBSD 6.1.4 has tzgetname, but omit it because it doesn't work
|
|
** in zones with three or more time zone abbreviations.
|
|
** Callers can instead use localtime_rz + strftime.
|
|
*/
|
|
|
|
#endif
|
|
|
|
#if !USE_TIMEX_T || !defined TM_GMTOFF
|
|
|
|
/*
|
|
** The easy way to behave "as if no library function calls" localtime
|
|
** is to not call it, so we drop its guts into "localsub", which can be
|
|
** freely called. (And no, the PANS doesn't require the above behavior,
|
|
** but it *is* desirable.)
|
|
**
|
|
** If successful and SETNAME is nonzero,
|
|
** set the applicable parts of tzname, timezone and altzone;
|
|
** however, it's OK to omit this step for proleptic TZ strings
|
|
** since in that case tzset should have already done this step correctly.
|
|
** SETNAME's type is int_fast32_t for compatibility with gmtsub,
|
|
** but it is actually a boolean and its value should be 0 or 1.
|
|
**
|
|
** If LTM_YEAR, store the resulting year-1900 into *LTM_YEAR rather
|
|
** than into the default TMP->tm_year; this prevents year overflow.
|
|
*/
|
|
|
|
/*ARGSUSED*/
|
|
static struct tm *
|
|
localsub(struct state const *sp, time_t const *timep, int_fast32_t setname,
|
|
struct tm *tmp, time_t *ltm_year)
|
|
{
|
|
register const struct ttinfo * ttisp;
|
|
register int i;
|
|
register struct tm * result;
|
|
const time_t t = *timep;
|
|
|
|
if (sp == NULL) {
|
|
/* Don't bother to set tzname etc.; tzset has already done it. */
|
|
return gmtsub(gmtptr, timep, 0, tmp, ltm_year);
|
|
}
|
|
if (sp->goahead && sp->ats[sp->timecnt - 1] < t) {
|
|
/* Avoid integer overflow when time_t is signed, by
|
|
using secs_div_2 twice; the full value would
|
|
always be even, so halving does not round. */
|
|
time_t
|
|
tlo = sp->ats[sp->timecnt - 1],
|
|
diffyears = ((t / 2 - tlo / 2
|
|
+ ((t % 2 - tlo % 2 + 2) / 2 - 1))
|
|
/ (SECSPERREPEAT / 2)
|
|
* YEARSPERREPEAT),
|
|
years = diffyears + YEARSPERREPEAT,
|
|
secs_div_2 = (diffyears * (AVGSECSPERYEAR / 2)
|
|
+ SECSPERREPEAT / 2),
|
|
newt = t - secs_div_2 - secs_div_2,
|
|
ryear;
|
|
|
|
result = localsub(sp, &newt, setname, tmp, &ryear);
|
|
if (result) {
|
|
if (ltm_year)
|
|
*ltm_year = ryear + years;
|
|
else {
|
|
# ifdef ckd_add
|
|
if (ckd_add(&result->tm_year, ryear, years))
|
|
return NULL;
|
|
# else
|
|
time_t newy = ryear + years;
|
|
if (! (INT_MIN <= newy && newy <= INT_MAX))
|
|
return NULL;
|
|
result->tm_year = newy;
|
|
# endif
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
if (sp->timecnt == 0 || t < sp->ats[0]) {
|
|
i = 0;
|
|
} else {
|
|
register int lo = 1;
|
|
register int hi = sp->timecnt;
|
|
|
|
while (lo < hi) {
|
|
register int mid = (lo + hi) >> 1;
|
|
|
|
if (t < sp->ats[mid])
|
|
hi = mid;
|
|
else lo = mid + 1;
|
|
}
|
|
i = sp->types[lo - 1];
|
|
}
|
|
ttisp = &sp->ttis[i];
|
|
/*
|
|
** To get (wrong) behavior that's compatible with System V Release 2.0
|
|
** you'd replace the statement below with
|
|
** t += ttisp->tt_utoff;
|
|
** timesub(&t, 0, sp, tmp, ltm_year);
|
|
*/
|
|
result = timesub(&t, ttisp->tt_utoff, sp, tmp, ltm_year);
|
|
if (result) {
|
|
result->tm_isdst = ttisp->tt_isdst;
|
|
# ifdef TM_ZONE
|
|
result->TM_ZONE = UNCONST(&sp->chars[ttisp->tt_desigidx]);
|
|
# endif
|
|
if (setname)
|
|
update_tzname_etc(sp, ttisp);
|
|
}
|
|
return result;
|
|
}
|
|
#endif
|
|
|
|
#if !USE_TIMEX_T
|
|
|
|
/* Return TMP, or a thread-specific struct tm * selected by WHICH. */
|
|
static struct tm *
|
|
tm_multi(struct tm *tmp, ATTRIBUTE_MAYBE_UNUSED enum tm_multi which)
|
|
{
|
|
# if THREAD_SAFE && THREAD_TM_MULTI
|
|
/* It is OK to check is_threaded() separately here; even if it
|
|
returns a different value in other places in the caller,
|
|
this function's behavior is still valid. */
|
|
if (is_threaded()) {
|
|
/* Try to get a thread-specific struct tm *.
|
|
Fall back on TMP if this fails. */
|
|
static pthread_once_t tm_multi_once = PTHREAD_ONCE_INIT;
|
|
pthread_once(&tm_multi_once, tm_multi_key_init);
|
|
if (!tm_multi_key_err) {
|
|
struct tm *p = pthread_getspecific(tm_multi_key);
|
|
if (!p) {
|
|
p = malloc(N_TM_MULTI * sizeof *p);
|
|
if (p && pthread_setspecific(tm_multi_key, p) != 0) {
|
|
free(p);
|
|
p = NULL;
|
|
}
|
|
}
|
|
if (p)
|
|
return &p[which];
|
|
}
|
|
}
|
|
# endif
|
|
return tmp;
|
|
}
|
|
|
|
# if NETBSD_INSPIRED
|
|
struct tm *
|
|
localtime_rz(struct state *restrict sp, time_t const *restrict timep,
|
|
struct tm *restrict tmp)
|
|
{
|
|
return localsub(sp, timep, 0, tmp, NULL);
|
|
}
|
|
# endif
|
|
|
|
static struct tm *
|
|
localtime_tzset(time_t const *timep, struct tm *tmp, bool setname)
|
|
{
|
|
monotime_t now = get_monotonic_time();
|
|
int err = lock();
|
|
if (0 < err) {
|
|
errno = err;
|
|
return NULL;
|
|
}
|
|
if (0 <= tz_change_interval || setname || !lcl_is_set)
|
|
tzset_unlocked(!err, false, now);
|
|
tmp = localsub(lclptr, timep, setname, tmp, NULL);
|
|
unlock(!err);
|
|
return tmp;
|
|
}
|
|
|
|
struct tm *
|
|
localtime(const time_t *timep)
|
|
{
|
|
# if !SUPPORT_C89
|
|
static struct tm tm;
|
|
# endif
|
|
return localtime_tzset(timep, tm_multi(&tm, LOCALTIME_TM_MULTI), true);
|
|
}
|
|
|
|
struct tm *
|
|
localtime_r(const time_t *restrict timep, struct tm *restrict tmp)
|
|
{
|
|
return localtime_tzset(timep, tmp, false);
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
** gmtsub is to gmtime as localsub is to localtime.
|
|
*/
|
|
|
|
static struct tm *
|
|
gmtsub(ATTRIBUTE_MAYBE_UNUSED struct state const *sp, time_t const *timep,
|
|
int_fast32_t offset, struct tm *tmp, time_t *ltm_year)
|
|
{
|
|
register struct tm * result;
|
|
|
|
result = timesub(timep, offset, gmtptr, tmp, ltm_year);
|
|
#ifdef TM_ZONE
|
|
/*
|
|
** Could get fancy here and deliver something such as
|
|
** "+xx" or "-xx" if offset is non-zero,
|
|
** but this is no time for a treasure hunt.
|
|
*/
|
|
tmp->TM_ZONE = UNCONST(offset ? wildabbr
|
|
: gmtptr ? gmtptr->chars : utc);
|
|
#endif /* defined TM_ZONE */
|
|
return result;
|
|
}
|
|
|
|
#if !USE_TIMEX_T
|
|
|
|
/*
|
|
* Re-entrant version of gmtime.
|
|
*/
|
|
|
|
struct tm *
|
|
gmtime_r(time_t const *restrict timep, struct tm *restrict tmp)
|
|
{
|
|
gmtcheck();
|
|
return gmtsub(gmtptr, timep, 0, tmp, NULL);
|
|
}
|
|
|
|
struct tm *
|
|
gmtime(const time_t *timep)
|
|
{
|
|
# if !SUPPORT_C89
|
|
static struct tm tm;
|
|
# endif
|
|
return gmtime_r(timep, tm_multi(&tm, GMTIME_TM_MULTI));
|
|
}
|
|
|
|
# if STD_INSPIRED
|
|
|
|
/* This function is obsolescent and may disappear in future releases.
|
|
Callers can instead use localtime_rz with a fixed-offset zone. */
|
|
|
|
struct tm *
|
|
offtime_r(time_t const *restrict timep, long offset, struct tm *restrict tmp)
|
|
{
|
|
gmtcheck();
|
|
return gmtsub(gmtptr, timep, offset, tmp, NULL);
|
|
}
|
|
|
|
struct tm *
|
|
offtime(time_t const *timep, long offset)
|
|
{
|
|
# if !SUPPORT_C89
|
|
static struct tm tm;
|
|
# endif
|
|
return offtime_r(timep, offset, tm_multi(&tm, OFFTIME_TM_MULTI));
|
|
}
|
|
|
|
# endif
|
|
#endif
|
|
|
|
/*
|
|
** Return the number of leap years through the end of the given year
|
|
** where, to make the math easy, the answer for year zero is defined as zero.
|
|
*/
|
|
|
|
static time_t
|
|
leaps_thru_end_of_nonneg(time_t y)
|
|
{
|
|
return y / 4 - y / 100 + y / 400;
|
|
}
|
|
|
|
static time_t
|
|
leaps_thru_end_of(time_t y)
|
|
{
|
|
return (y < 0
|
|
? -1 - leaps_thru_end_of_nonneg(-1 - y)
|
|
: leaps_thru_end_of_nonneg(y));
|
|
}
|
|
|
|
static struct tm *
|
|
timesub(const time_t *timep, int_fast32_t offset,
|
|
const struct state *sp, struct tm *tmp, time_t *ltm_year)
|
|
{
|
|
register time_t tdays;
|
|
register const int * ip;
|
|
int_fast32_2s corr;
|
|
register int i;
|
|
int_fast32_t idays, rem, dayoff, dayrem;
|
|
time_t y;
|
|
|
|
/* If less than SECSPERMIN, the number of seconds since the
|
|
most recent positive leap second; otherwise, do not add 1
|
|
to localtime tm_sec because of leap seconds. */
|
|
time_t secs_since_posleap = SECSPERMIN;
|
|
|
|
corr = 0;
|
|
i = sp ? leapcount(sp) : 0;
|
|
while (--i >= 0) {
|
|
struct lsinfo ls = lsinfo(sp, i);
|
|
if (ls.ls_trans <= *timep) {
|
|
corr = ls.ls_corr;
|
|
if ((i == 0 ? 0 : lsinfo(sp, i - 1).ls_corr) < corr)
|
|
secs_since_posleap = *timep - ls.ls_trans;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* Calculate the year, avoiding integer overflow even if
|
|
time_t is unsigned. */
|
|
tdays = *timep / SECSPERDAY;
|
|
rem = *timep % SECSPERDAY;
|
|
rem += offset % SECSPERDAY - corr % SECSPERDAY + 3 * SECSPERDAY;
|
|
dayoff = offset / SECSPERDAY - corr / SECSPERDAY + rem / SECSPERDAY - 3;
|
|
rem %= SECSPERDAY;
|
|
/* y = (EPOCH_YEAR
|
|
+ floor((tdays + dayoff) / DAYSPERREPEAT) * YEARSPERREPEAT),
|
|
sans overflow. But calculate against 1570 (EPOCH_YEAR -
|
|
YEARSPERREPEAT) instead of against 1970 so that things work
|
|
for localtime values before 1970 when time_t is unsigned. */
|
|
dayrem = tdays % DAYSPERREPEAT;
|
|
dayrem += dayoff % DAYSPERREPEAT;
|
|
y = (EPOCH_YEAR - YEARSPERREPEAT
|
|
+ ((1 + dayoff / DAYSPERREPEAT + dayrem / DAYSPERREPEAT
|
|
- ((dayrem % DAYSPERREPEAT) < 0)
|
|
+ tdays / DAYSPERREPEAT)
|
|
* YEARSPERREPEAT));
|
|
/* idays = (tdays + dayoff) mod DAYSPERREPEAT, sans overflow. */
|
|
idays = tdays % DAYSPERREPEAT;
|
|
idays += dayoff % DAYSPERREPEAT + 2 * DAYSPERREPEAT;
|
|
idays %= DAYSPERREPEAT;
|
|
/* Increase Y and decrease IDAYS until IDAYS is in range for Y. */
|
|
while (year_days(y) <= idays) {
|
|
int tdelta = idays / DAYSPERLYEAR;
|
|
int_fast32_t ydelta = tdelta + !tdelta;
|
|
time_t newy = y + ydelta;
|
|
register int leapdays;
|
|
leapdays = leaps_thru_end_of(newy - 1) -
|
|
leaps_thru_end_of(y - 1);
|
|
idays -= ydelta * DAYSPERNYEAR;
|
|
idays -= leapdays;
|
|
y = newy;
|
|
}
|
|
|
|
if (ltm_year) {
|
|
*ltm_year = y - TM_YEAR_BASE;
|
|
} else {
|
|
#ifdef ckd_add
|
|
if (ckd_add(&tmp->tm_year, y, -TM_YEAR_BASE)) {
|
|
errno = EOVERFLOW;
|
|
return NULL;
|
|
}
|
|
#else
|
|
if (!TYPE_SIGNED(time_t) && y < TM_YEAR_BASE) {
|
|
int signed_y = y;
|
|
tmp->tm_year = signed_y - TM_YEAR_BASE;
|
|
} else if ((!TYPE_SIGNED(time_t) || INT_MIN + TM_YEAR_BASE <= y)
|
|
&& y - TM_YEAR_BASE <= INT_MAX)
|
|
tmp->tm_year = y - TM_YEAR_BASE;
|
|
else {
|
|
errno = EOVERFLOW;
|
|
return NULL;
|
|
}
|
|
#endif
|
|
}
|
|
tmp->tm_yday = idays;
|
|
/*
|
|
** The "extra" mods below avoid overflow problems.
|
|
*/
|
|
tmp->tm_wday = (TM_WDAY_BASE
|
|
+ ((y % DAYSPERWEEK - TM_YEAR_BASE % DAYSPERWEEK)
|
|
% DAYSPERWEEK
|
|
* (DAYSPERNYEAR % DAYSPERWEEK))
|
|
+ leaps_thru_end_of(y - 1)
|
|
- leaps_thru_end_of(TM_YEAR_BASE - 1)
|
|
+ idays);
|
|
tmp->tm_wday %= DAYSPERWEEK;
|
|
if (tmp->tm_wday < 0)
|
|
tmp->tm_wday += DAYSPERWEEK;
|
|
tmp->tm_hour = rem / SECSPERHOUR;
|
|
rem %= SECSPERHOUR;
|
|
tmp->tm_min = rem / SECSPERMIN;
|
|
tmp->tm_sec = rem % SECSPERMIN;
|
|
|
|
/* Use "... ??:??:60" at the end of the localtime minute containing
|
|
the second just before the positive leap second. */
|
|
tmp->tm_sec += secs_since_posleap <= tmp->tm_sec;
|
|
|
|
ip = mon_lengths[isleap(y)];
|
|
for (tmp->tm_mon = 0; idays >= ip[tmp->tm_mon]; ++(tmp->tm_mon))
|
|
idays -= ip[tmp->tm_mon];
|
|
tmp->tm_mday = idays + 1;
|
|
tmp->tm_isdst = 0;
|
|
#ifdef TM_GMTOFF
|
|
tmp->TM_GMTOFF = offset;
|
|
#endif /* defined TM_GMTOFF */
|
|
return tmp;
|
|
}
|
|
|
|
/*
|
|
** Adapted from code provided by Robert Elz, who writes:
|
|
** The "best" way to do mktime I think is based on an idea of Bob
|
|
** Kridle's (so its said...) from a long time ago.
|
|
** It does a binary search of the time_t space. Since time_t's are
|
|
** just 32 bits, its a max of 32 iterations (even at 64 bits it
|
|
** would still be very reasonable).
|
|
*/
|
|
|
|
#ifndef WRONG
|
|
# define WRONG (-1)
|
|
#endif /* !defined WRONG */
|
|
|
|
/*
|
|
** Normalize logic courtesy Paul Eggert.
|
|
*/
|
|
|
|
static bool
|
|
increment_overflow_64(int *ip, int_fast64_t j)
|
|
{
|
|
#ifdef ckd_add
|
|
return ckd_add(ip, *ip, j);
|
|
#else
|
|
if (j < 0 ? *ip < INT_MIN - j : INT_MAX - j < *ip)
|
|
return true;
|
|
*ip += j;
|
|
return false;
|
|
#endif
|
|
}
|
|
|
|
static bool
|
|
increment_overflow_time_iinntt(time_t *tp, iinntt j)
|
|
{
|
|
#ifdef ckd_add
|
|
return ckd_add(tp, *tp, j);
|
|
#else
|
|
if (j < 0
|
|
? (TYPE_SIGNED(time_t) ? *tp < TIME_T_MIN - j : *tp <= -1 - j)
|
|
: TIME_T_MAX - j < *tp)
|
|
return true;
|
|
*tp += j;
|
|
return false;
|
|
#endif
|
|
}
|
|
|
|
static bool
|
|
increment_overflow_time_64(time_t *tp, int_fast64_t j)
|
|
{
|
|
#ifdef ckd_add
|
|
return ckd_add(tp, *tp, j);
|
|
#else
|
|
if (j < 0
|
|
? (TYPE_SIGNED(time_t) ? *tp < TIME_T_MIN - j : *tp <= -1 - j)
|
|
: TIME_T_MAX - j < *tp)
|
|
return true;
|
|
*tp += j;
|
|
return false;
|
|
#endif
|
|
}
|
|
|
|
static bool
|
|
increment_overflow_time(time_t *tp, int_fast32_2s j)
|
|
{
|
|
#ifdef ckd_add
|
|
return ckd_add(tp, *tp, j);
|
|
#else
|
|
/*
|
|
** This is like
|
|
** 'if (! (TIME_T_MIN <= *tp + j && *tp + j <= TIME_T_MAX)) ...',
|
|
** except that it does the right thing even if *tp + j would overflow.
|
|
*/
|
|
if (! (j < 0
|
|
? (TYPE_SIGNED(time_t) ? TIME_T_MIN - j <= *tp : -1 - j < *tp)
|
|
: *tp <= TIME_T_MAX - j))
|
|
return true;
|
|
*tp += j;
|
|
return false;
|
|
#endif
|
|
}
|
|
|
|
/* Return A - B, where both are in the range -2**31 + 1 .. 2**31 - 1.
|
|
The result cannot overflow. */
|
|
static int_fast64_t
|
|
utoff_diff (int_fast32_t a, int_fast32_t b)
|
|
{
|
|
int_fast64_t aa = a;
|
|
return aa - b;
|
|
}
|
|
|
|
static int
|
|
tmcomp(register const struct tm *const atmp,
|
|
register const struct tm *const btmp)
|
|
{
|
|
register int result;
|
|
|
|
if (atmp->tm_year != btmp->tm_year)
|
|
return atmp->tm_year < btmp->tm_year ? -1 : 1;
|
|
if ((result = (atmp->tm_mon - btmp->tm_mon)) == 0 &&
|
|
(result = (atmp->tm_mday - btmp->tm_mday)) == 0 &&
|
|
(result = (atmp->tm_hour - btmp->tm_hour)) == 0 &&
|
|
(result = (atmp->tm_min - btmp->tm_min)) == 0)
|
|
result = atmp->tm_sec - btmp->tm_sec;
|
|
return result;
|
|
}
|
|
|
|
/* Copy to *DEST from *SRC. Copy only the members needed for mktime,
|
|
as other members might not be initialized. */
|
|
static void
|
|
mktmcpy(struct tm *dest, struct tm const *src)
|
|
{
|
|
dest->tm_sec = src->tm_sec;
|
|
dest->tm_min = src->tm_min;
|
|
dest->tm_hour = src->tm_hour;
|
|
dest->tm_mday = src->tm_mday;
|
|
dest->tm_mon = src->tm_mon;
|
|
dest->tm_year = src->tm_year;
|
|
dest->tm_isdst = src->tm_isdst;
|
|
#if defined TM_GMTOFF && ! UNINIT_TRAP
|
|
dest->TM_GMTOFF = src->TM_GMTOFF;
|
|
#endif
|
|
}
|
|
|
|
static time_t
|
|
time2sub(struct tm *const tmp,
|
|
struct tm *funcp(struct state const *, time_t const *,
|
|
int_fast32_t, struct tm *, time_t *),
|
|
struct state const *sp,
|
|
const int_fast32_t offset,
|
|
bool *okayp,
|
|
bool do_norm_secs)
|
|
{
|
|
register int dir;
|
|
register int i, j;
|
|
register time_t lo;
|
|
register time_t hi;
|
|
iinntt y, mday, hour, min, saved_seconds;
|
|
time_t newt;
|
|
time_t t;
|
|
struct tm yourtm, mytm;
|
|
|
|
*okayp = false;
|
|
mktmcpy(&yourtm, tmp);
|
|
|
|
min = yourtm.tm_min;
|
|
if (do_norm_secs) {
|
|
min += yourtm.tm_sec / SECSPERMIN;
|
|
yourtm.tm_sec %= SECSPERMIN;
|
|
if (yourtm.tm_sec < 0) {
|
|
yourtm.tm_sec += SECSPERMIN;
|
|
min--;
|
|
}
|
|
}
|
|
|
|
hour = yourtm.tm_hour;
|
|
hour += min / MINSPERHOUR;
|
|
yourtm.tm_min = min % MINSPERHOUR;
|
|
if (yourtm.tm_min < 0) {
|
|
yourtm.tm_min += MINSPERHOUR;
|
|
hour--;
|
|
}
|
|
|
|
mday = yourtm.tm_mday;
|
|
mday += hour / HOURSPERDAY;
|
|
yourtm.tm_hour = hour % HOURSPERDAY;
|
|
if (yourtm.tm_hour < 0) {
|
|
yourtm.tm_hour += HOURSPERDAY;
|
|
mday--;
|
|
}
|
|
|
|
y = yourtm.tm_year;
|
|
y += yourtm.tm_mon / MONSPERYEAR;
|
|
yourtm.tm_mon %= MONSPERYEAR;
|
|
if (yourtm.tm_mon < 0) {
|
|
yourtm.tm_mon += MONSPERYEAR;
|
|
y--;
|
|
}
|
|
|
|
/*
|
|
** Turn y into an actual year number for now.
|
|
** It is converted back to an offset from TM_YEAR_BASE later.
|
|
*/
|
|
y += TM_YEAR_BASE;
|
|
|
|
while (mday <= 0) {
|
|
iinntt li = y - (yourtm.tm_mon <= 1);
|
|
mday += year_days(li);
|
|
y--;
|
|
}
|
|
while (DAYSPERLYEAR < mday) {
|
|
iinntt li = y + (1 < yourtm.tm_mon);
|
|
mday -= year_days(li);
|
|
y++;
|
|
}
|
|
yourtm.tm_mday = mday;
|
|
for ( ; ; ) {
|
|
i = mon_lengths[isleap(y)][yourtm.tm_mon];
|
|
if (yourtm.tm_mday <= i)
|
|
break;
|
|
yourtm.tm_mday -= i;
|
|
if (++yourtm.tm_mon >= MONSPERYEAR) {
|
|
yourtm.tm_mon = 0;
|
|
y++;
|
|
}
|
|
}
|
|
#ifdef ckd_add
|
|
if (ckd_add(&yourtm.tm_year, y, -TM_YEAR_BASE))
|
|
return WRONG;
|
|
#else
|
|
y -= TM_YEAR_BASE;
|
|
if (! (INT_MIN <= y && y <= INT_MAX))
|
|
return WRONG;
|
|
yourtm.tm_year = y;
|
|
#endif
|
|
if (yourtm.tm_sec >= 0 && yourtm.tm_sec < SECSPERMIN)
|
|
saved_seconds = 0;
|
|
else if (yourtm.tm_year < EPOCH_YEAR - TM_YEAR_BASE) {
|
|
/*
|
|
** We can't set tm_sec to 0, because that might push the
|
|
** time below the minimum representable time.
|
|
** Set tm_sec to 59 instead.
|
|
** This assumes that the minimum representable time is
|
|
** not in the same minute that a leap second was deleted from,
|
|
** which is a safer assumption than using 58 would be.
|
|
*/
|
|
saved_seconds = yourtm.tm_sec;
|
|
saved_seconds -= SECSPERMIN - 1;
|
|
yourtm.tm_sec = SECSPERMIN - 1;
|
|
} else {
|
|
saved_seconds = yourtm.tm_sec;
|
|
yourtm.tm_sec = 0;
|
|
}
|
|
/*
|
|
** Do a binary search (this works whatever time_t's type is).
|
|
*/
|
|
lo = TIME_T_MIN;
|
|
hi = TIME_T_MAX;
|
|
for ( ; ; ) {
|
|
t = lo / 2 + hi / 2;
|
|
if (t < lo)
|
|
t = lo;
|
|
else if (t > hi)
|
|
t = hi;
|
|
if (! funcp(sp, &t, offset, &mytm, NULL)) {
|
|
/*
|
|
** Assume that t is too extreme to be represented in
|
|
** a struct tm; arrange things so that it is less
|
|
** extreme on the next pass.
|
|
*/
|
|
dir = (t > 0) ? 1 : -1;
|
|
} else dir = tmcomp(&mytm, &yourtm);
|
|
if (dir != 0) {
|
|
if (t == lo) {
|
|
if (t == TIME_T_MAX)
|
|
return WRONG;
|
|
++t;
|
|
++lo;
|
|
} else if (t == hi) {
|
|
if (t == TIME_T_MIN)
|
|
return WRONG;
|
|
--t;
|
|
--hi;
|
|
}
|
|
if (lo > hi)
|
|
return WRONG;
|
|
if (dir > 0)
|
|
hi = t;
|
|
else lo = t;
|
|
continue;
|
|
}
|
|
#if defined TM_GMTOFF && ! UNINIT_TRAP
|
|
if (mytm.TM_GMTOFF != yourtm.TM_GMTOFF
|
|
&& (yourtm.TM_GMTOFF < 0
|
|
? (-SECSPERDAY <= yourtm.TM_GMTOFF
|
|
&& (mytm.TM_GMTOFF <=
|
|
(min(INT_FAST32_MAX, LONG_MAX)
|
|
+ yourtm.TM_GMTOFF)))
|
|
: (yourtm.TM_GMTOFF <= SECSPERDAY
|
|
&& ((max(INT_FAST32_MIN, LONG_MIN)
|
|
+ yourtm.TM_GMTOFF)
|
|
<= mytm.TM_GMTOFF)))) {
|
|
/* MYTM matches YOURTM except with the wrong UT offset.
|
|
YOURTM.TM_GMTOFF is plausible, so try it instead.
|
|
It's OK if YOURTM.TM_GMTOFF contains uninitialized data,
|
|
since the guess gets checked. */
|
|
time_t altt = t;
|
|
int_fast64_t offdiff;
|
|
bool v;
|
|
# ifdef ckd_sub
|
|
v = ckd_sub(&offdiff, mytm.TM_GMTOFF, yourtm.TM_GMTOFF);
|
|
# else
|
|
/* A ckd_sub approximation that is good enough here. */
|
|
v = !(-TWO_31_MINUS_1 <= yourtm.TM_GMTOFF
|
|
&& yourtm.TM_GMTOFF <= TWO_31_MINUS_1);
|
|
if (!v)
|
|
offdiff = utoff_diff(mytm.TM_GMTOFF, yourtm.TM_GMTOFF);
|
|
# endif
|
|
if (!v && !increment_overflow_time_64(&altt, offdiff)) {
|
|
struct tm alttm;
|
|
if (funcp(sp, &altt, offset, &alttm, NULL)
|
|
&& alttm.tm_isdst == mytm.tm_isdst
|
|
&& alttm.TM_GMTOFF == yourtm.TM_GMTOFF
|
|
&& tmcomp(&alttm, &yourtm) == 0) {
|
|
t = altt;
|
|
mytm = alttm;
|
|
}
|
|
}
|
|
}
|
|
#endif
|
|
if (yourtm.tm_isdst < 0 || mytm.tm_isdst == yourtm.tm_isdst)
|
|
break;
|
|
/*
|
|
** Right time, wrong type.
|
|
** Hunt for right time, right type.
|
|
** It's okay to guess wrong since the guess
|
|
** gets checked.
|
|
*/
|
|
if (sp == NULL)
|
|
return WRONG;
|
|
for (i = sp->typecnt - 1; i >= 0; --i) {
|
|
if (sp->ttis[i].tt_isdst != yourtm.tm_isdst)
|
|
continue;
|
|
for (j = sp->typecnt - 1; j >= 0; --j) {
|
|
if (sp->ttis[j].tt_isdst == yourtm.tm_isdst)
|
|
continue;
|
|
if (ttunspecified(sp, j))
|
|
continue;
|
|
newt = t;
|
|
if (increment_overflow_time_64
|
|
(&newt,
|
|
utoff_diff(sp->ttis[j].tt_utoff,
|
|
sp->ttis[i].tt_utoff)))
|
|
continue;
|
|
if (! funcp(sp, &newt, offset, &mytm, NULL))
|
|
continue;
|
|
if (tmcomp(&mytm, &yourtm) != 0)
|
|
continue;
|
|
if (mytm.tm_isdst != yourtm.tm_isdst)
|
|
continue;
|
|
/*
|
|
** We have a match.
|
|
*/
|
|
t = newt;
|
|
goto label;
|
|
}
|
|
}
|
|
return WRONG;
|
|
}
|
|
label:
|
|
if (increment_overflow_time_iinntt(&t, saved_seconds))
|
|
return WRONG;
|
|
if (funcp(sp, &t, offset, tmp, NULL))
|
|
*okayp = true;
|
|
return t;
|
|
}
|
|
|
|
static time_t
|
|
time2(struct tm * const tmp,
|
|
struct tm *funcp(struct state const *, time_t const *,
|
|
int_fast32_t, struct tm *, time_t *),
|
|
struct state const *sp,
|
|
const int_fast32_t offset,
|
|
bool *okayp)
|
|
{
|
|
time_t t;
|
|
|
|
/*
|
|
** First try without normalization of seconds
|
|
** (in case tm_sec contains a value associated with a leap second).
|
|
** If that fails, try with normalization of seconds.
|
|
*/
|
|
t = time2sub(tmp, funcp, sp, offset, okayp, false);
|
|
return *okayp ? t : time2sub(tmp, funcp, sp, offset, okayp, true);
|
|
}
|
|
|
|
static time_t
|
|
time1(struct tm *const tmp,
|
|
struct tm *funcp(struct state const *, time_t const *,
|
|
int_fast32_t, struct tm *, time_t *),
|
|
struct state const *sp,
|
|
const int_fast32_t offset)
|
|
{
|
|
register time_t t;
|
|
register int samei, otheri;
|
|
register int sameind, otherind;
|
|
register int i;
|
|
register int nseen;
|
|
char seen[TZ_MAX_TYPES];
|
|
unsigned char types[TZ_MAX_TYPES];
|
|
bool okay;
|
|
|
|
if (tmp == NULL) {
|
|
errno = EINVAL;
|
|
return WRONG;
|
|
}
|
|
if (tmp->tm_isdst > 1)
|
|
tmp->tm_isdst = 1;
|
|
t = time2(tmp, funcp, sp, offset, &okay);
|
|
if (okay)
|
|
return t;
|
|
if (tmp->tm_isdst < 0)
|
|
#ifdef PCTS
|
|
/*
|
|
** POSIX Conformance Test Suite code courtesy Grant Sullivan.
|
|
*/
|
|
tmp->tm_isdst = 0; /* reset to std and try again */
|
|
#else
|
|
return t;
|
|
#endif /* !defined PCTS */
|
|
/*
|
|
** We're supposed to assume that somebody took a time of one type
|
|
** and did some math on it that yielded a "struct tm" that's bad.
|
|
** We try to divine the type they started from and adjust to the
|
|
** type they need.
|
|
*/
|
|
if (sp == NULL)
|
|
return WRONG;
|
|
for (i = 0; i < sp->typecnt; ++i)
|
|
seen[i] = false;
|
|
nseen = 0;
|
|
for (i = sp->timecnt - 1; i >= 0; --i)
|
|
if (!seen[sp->types[i]] && !ttunspecified(sp, sp->types[i])) {
|
|
seen[sp->types[i]] = true;
|
|
types[nseen++] = sp->types[i];
|
|
}
|
|
for (sameind = 0; sameind < nseen; ++sameind) {
|
|
samei = types[sameind];
|
|
if (sp->ttis[samei].tt_isdst != tmp->tm_isdst)
|
|
continue;
|
|
for (otherind = 0; otherind < nseen; ++otherind) {
|
|
otheri = types[otherind];
|
|
if (sp->ttis[otheri].tt_isdst != tmp->tm_isdst) {
|
|
int sec = tmp->tm_sec;
|
|
if (!increment_overflow_64
|
|
(&tmp->tm_sec,
|
|
utoff_diff(sp->ttis[otheri].tt_utoff,
|
|
sp->ttis[samei].tt_utoff))) {
|
|
tmp->tm_isdst = !tmp->tm_isdst;
|
|
t = time2(tmp, funcp, sp, offset, &okay);
|
|
if (okay)
|
|
return t;
|
|
tmp->tm_isdst = !tmp->tm_isdst;
|
|
}
|
|
tmp->tm_sec = sec;
|
|
}
|
|
}
|
|
}
|
|
return WRONG;
|
|
}
|
|
|
|
#if !defined TM_GMTOFF || !USE_TIMEX_T
|
|
|
|
static time_t
|
|
mktime_tzname(struct state *sp, struct tm *tmp, bool setname)
|
|
{
|
|
if (sp)
|
|
return time1(tmp, localsub, sp, setname);
|
|
else {
|
|
gmtcheck();
|
|
return time1(tmp, gmtsub, gmtptr, 0);
|
|
}
|
|
}
|
|
|
|
# if USE_TIMEX_T
|
|
static
|
|
# endif
|
|
time_t
|
|
mktime(struct tm *tmp)
|
|
{
|
|
monotime_t now = get_monotonic_time();
|
|
time_t t;
|
|
int err = lock();
|
|
if (0 < err) {
|
|
errno = err;
|
|
return -1;
|
|
}
|
|
tzset_unlocked(!err, false, now);
|
|
t = mktime_tzname(lclptr, tmp, true);
|
|
unlock(!err);
|
|
return t;
|
|
}
|
|
|
|
#endif
|
|
|
|
#if NETBSD_INSPIRED && !USE_TIMEX_T
|
|
time_t
|
|
mktime_z(struct state *restrict sp, struct tm *restrict tmp)
|
|
{
|
|
return mktime_tzname(sp, tmp, false);
|
|
}
|
|
#endif
|
|
|
|
#if STD_INSPIRED && !USE_TIMEX_T
|
|
/* This function is obsolescent and may disappear in future releases.
|
|
Callers can instead use mktime. */
|
|
time_t
|
|
timelocal(struct tm *tmp)
|
|
{
|
|
if (tmp != NULL)
|
|
tmp->tm_isdst = -1; /* in case it wasn't initialized */
|
|
return mktime(tmp);
|
|
}
|
|
#endif
|
|
|
|
#if defined TM_GMTOFF || !USE_TIMEX_T
|
|
|
|
# ifndef EXTERN_TIMEOFF
|
|
# ifndef timeoff
|
|
# define timeoff my_timeoff /* Don't collide with OpenBSD 7.4 <time.h>. */
|
|
# endif
|
|
# define EXTERN_TIMEOFF static
|
|
# endif
|
|
|
|
/* This function is obsolescent and may disappear in future releases.
|
|
Callers can instead use mktime_z with a fixed-offset zone. */
|
|
EXTERN_TIMEOFF time_t
|
|
timeoff(struct tm *tmp, long offset)
|
|
{
|
|
if (tmp)
|
|
tmp->tm_isdst = 0;
|
|
gmtcheck();
|
|
return time1(tmp, gmtsub, gmtptr, offset);
|
|
}
|
|
#endif
|
|
|
|
#if !USE_TIMEX_T
|
|
time_t
|
|
timegm(struct tm *tmp)
|
|
{
|
|
time_t t;
|
|
struct tm tmcpy;
|
|
mktmcpy(&tmcpy, tmp);
|
|
tmcpy.tm_wday = -1;
|
|
t = timeoff(&tmcpy, 0);
|
|
if (0 <= tmcpy.tm_wday)
|
|
*tmp = tmcpy;
|
|
return t;
|
|
}
|
|
#endif
|
|
|
|
static int_fast32_2s
|
|
leapcorr(struct state const *sp, time_t t)
|
|
{
|
|
register int i;
|
|
|
|
i = leapcount(sp);
|
|
while (--i >= 0) {
|
|
struct lsinfo ls = lsinfo(sp, i);
|
|
if (ls.ls_trans <= t)
|
|
return ls.ls_corr;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
** XXX--is the below the right way to conditionalize??
|
|
*/
|
|
|
|
#if !USE_TIMEX_T
|
|
# if STD_INSPIRED
|
|
|
|
static bool
|
|
decrement_overflow_time(time_t *tp, int_fast32_2s j)
|
|
{
|
|
#ifdef ckd_sub
|
|
return ckd_sub(tp, *tp, j);
|
|
#else
|
|
if (! (j < 0
|
|
? *tp <= TIME_T_MAX + j
|
|
: (TYPE_SIGNED(time_t) ? TIME_T_MIN + j <= *tp : j <= *tp)))
|
|
return true;
|
|
*tp -= j;
|
|
return false;
|
|
#endif
|
|
}
|
|
|
|
/* NETBSD_INSPIRED_EXTERN functions are exported to callers if
|
|
NETBSD_INSPIRED is defined, and are private otherwise. */
|
|
# if NETBSD_INSPIRED
|
|
# define NETBSD_INSPIRED_EXTERN
|
|
# else
|
|
# define NETBSD_INSPIRED_EXTERN static
|
|
# endif
|
|
|
|
/*
|
|
** IEEE Std 1003.1 (POSIX) says that 536457599
|
|
** shall correspond to "Wed Dec 31 23:59:59 UTC 1986", which
|
|
** is not the case if we are accounting for leap seconds.
|
|
** So, we provide the following conversion routines for use
|
|
** when exchanging timestamps with POSIX conforming systems.
|
|
*/
|
|
|
|
NETBSD_INSPIRED_EXTERN time_t
|
|
time2posix_z(struct state *sp, time_t t)
|
|
{
|
|
if (decrement_overflow_time(&t, leapcorr(sp, t))) {
|
|
/* Overflow near maximum time_t value with negative correction.
|
|
This can happen with unrealistic-but-valid TZif files. */
|
|
errno = EOVERFLOW;
|
|
return -1;
|
|
}
|
|
return t;
|
|
}
|
|
|
|
time_t
|
|
time2posix(time_t t)
|
|
{
|
|
monotime_t now = get_monotonic_time();
|
|
int err = lock();
|
|
if (0 < err) {
|
|
errno = err;
|
|
return -1;
|
|
}
|
|
if (0 <= tz_change_interval || !lcl_is_set)
|
|
tzset_unlocked(!err, false, now);
|
|
if (lclptr)
|
|
t = time2posix_z(lclptr, t);
|
|
unlock(!err);
|
|
return t;
|
|
}
|
|
|
|
NETBSD_INSPIRED_EXTERN time_t
|
|
posix2time_z(struct state *sp, time_t t)
|
|
{
|
|
int i;
|
|
for (i = leapcount(sp); 0 <= --i; ) {
|
|
struct lsinfo ls = lsinfo(sp, i);
|
|
time_t t_corr = t;
|
|
|
|
if (increment_overflow_time(&t_corr, ls.ls_corr)) {
|
|
if (0 <= ls.ls_corr) {
|
|
/* Overflow near maximum time_t value with positive correction.
|
|
This can happen with ordinary TZif files with leap seconds. */
|
|
errno = EOVERFLOW;
|
|
return -1;
|
|
} else {
|
|
/* A negative correction overflowed, so keep going.
|
|
This can happen with unrealistic-but-valid TZif files. */
|
|
}
|
|
} else if (ls.ls_trans <= t_corr)
|
|
return (t_corr
|
|
- (ls.ls_trans == t_corr
|
|
&& (i == 0 ? 0 : lsinfo(sp, i - 1).ls_corr) < ls.ls_corr));
|
|
}
|
|
return t;
|
|
}
|
|
|
|
time_t
|
|
posix2time(time_t t)
|
|
{
|
|
monotime_t now = get_monotonic_time();
|
|
int err = lock();
|
|
if (0 < err) {
|
|
errno = err;
|
|
return -1;
|
|
}
|
|
if (0 <= tz_change_interval || !lcl_is_set)
|
|
tzset_unlocked(!err, false, now);
|
|
if (lclptr)
|
|
t = posix2time_z(lclptr, t);
|
|
unlock(!err);
|
|
return t;
|
|
}
|
|
|
|
# endif /* STD_INSPIRED */
|
|
|
|
# if TZ_TIME_T
|
|
|
|
# if !USG_COMPAT
|
|
# define timezone 0
|
|
# endif
|
|
|
|
/* Convert from the underlying system's time_t to the ersatz time_tz,
|
|
which is called 'time_t' in this file. Typically, this merely
|
|
converts the time's integer width. On some platforms, the system
|
|
time is local time not UT, or uses some epoch other than the POSIX
|
|
epoch.
|
|
|
|
Although this code appears to define a function named 'time' that
|
|
returns time_t, the macros in private.h cause this code to actually
|
|
define a function named 'tz_time' that returns tz_time_t. The call
|
|
to sys_time invokes the underlying system's 'time' function. */
|
|
|
|
time_t
|
|
time(time_t *p)
|
|
{
|
|
time_t r = sys_time(NULL);
|
|
if (r != (time_t) -1) {
|
|
iinntt offset = EPOCH_LOCAL ? timezone : 0;
|
|
if (offset < IINNTT_MIN + EPOCH_OFFSET
|
|
|| increment_overflow_time_iinntt(&r, offset - EPOCH_OFFSET)) {
|
|
errno = EOVERFLOW;
|
|
r = -1;
|
|
}
|
|
}
|
|
if (p)
|
|
*p = r;
|
|
return r;
|
|
}
|
|
|
|
# endif
|
|
#endif
|