2017-09-19 22:54:40 +02:00
|
|
|
// Copyright 2017 The Abseil Authors.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
2019-03-08 16:27:53 +01:00
|
|
|
// https://www.apache.org/licenses/LICENSE-2.0
|
2017-09-19 22:54:40 +02:00
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
|
|
|
|
|
|
|
// The implementation of the absl::Time class, which is declared in
|
|
|
|
// //absl/time.h.
|
|
|
|
//
|
2017-09-27 19:50:48 +02:00
|
|
|
// The representation for an absl::Time is an absl::Duration offset from the
|
2017-09-19 22:54:40 +02:00
|
|
|
// epoch. We use the traditional Unix epoch (1970-01-01 00:00:00 +0000)
|
|
|
|
// for convenience, but this is not exposed in the API and could be changed.
|
|
|
|
//
|
|
|
|
// NOTE: To keep type verbosity to a minimum, the following variable naming
|
|
|
|
// conventions are used throughout this file.
|
|
|
|
//
|
2017-09-27 19:50:48 +02:00
|
|
|
// tz: An absl::TimeZone
|
2018-10-10 21:31:37 +02:00
|
|
|
// ci: An absl::TimeZone::CivilInfo
|
|
|
|
// ti: An absl::TimeZone::TimeInfo
|
|
|
|
// cd: An absl::CivilDay or a cctz::civil_day
|
|
|
|
// cs: An absl::CivilSecond or a cctz::civil_second
|
|
|
|
// bd: An absl::Time::Breakdown
|
2017-09-19 22:54:40 +02:00
|
|
|
// cl: A cctz::time_zone::civil_lookup
|
|
|
|
// al: A cctz::time_zone::absolute_lookup
|
|
|
|
|
|
|
|
#include "absl/time/time.h"
|
|
|
|
|
2019-06-21 22:11:42 +02:00
|
|
|
#if defined(_MSC_VER)
|
|
|
|
#include <winsock2.h> // for timeval
|
|
|
|
#endif
|
|
|
|
|
2017-09-19 22:54:40 +02:00
|
|
|
#include <cstring>
|
|
|
|
#include <ctime>
|
|
|
|
#include <limits>
|
|
|
|
|
2018-04-23 17:17:58 +02:00
|
|
|
#include "absl/time/internal/cctz/include/cctz/civil_time.h"
|
|
|
|
#include "absl/time/internal/cctz/include/cctz/time_zone.h"
|
|
|
|
|
|
|
|
namespace cctz = absl::time_internal::cctz;
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2017-09-19 22:54:40 +02:00
|
|
|
namespace absl {
|
2019-12-12 19:36:03 +01:00
|
|
|
ABSL_NAMESPACE_BEGIN
|
2017-09-19 22:54:40 +02:00
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
2018-06-21 21:55:12 +02:00
|
|
|
inline cctz::time_point<cctz::seconds> unix_epoch() {
|
|
|
|
return std::chrono::time_point_cast<cctz::seconds>(
|
2017-09-19 22:54:40 +02:00
|
|
|
std::chrono::system_clock::from_time_t(0));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Floors d to the next unit boundary closer to negative infinity.
|
|
|
|
inline int64_t FloorToUnit(absl::Duration d, absl::Duration unit) {
|
|
|
|
absl::Duration rem;
|
|
|
|
int64_t q = absl::IDivDuration(d, unit, &rem);
|
|
|
|
return (q > 0 ||
|
|
|
|
rem >= ZeroDuration() ||
|
|
|
|
q == std::numeric_limits<int64_t>::min()) ? q : q - 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline absl::Time::Breakdown InfiniteFutureBreakdown() {
|
|
|
|
absl::Time::Breakdown bd;
|
|
|
|
bd.year = std::numeric_limits<int64_t>::max();
|
|
|
|
bd.month = 12;
|
|
|
|
bd.day = 31;
|
|
|
|
bd.hour = 23;
|
|
|
|
bd.minute = 59;
|
|
|
|
bd.second = 59;
|
|
|
|
bd.subsecond = absl::InfiniteDuration();
|
|
|
|
bd.weekday = 4;
|
|
|
|
bd.yearday = 365;
|
|
|
|
bd.offset = 0;
|
|
|
|
bd.is_dst = false;
|
2018-04-30 20:44:26 +02:00
|
|
|
bd.zone_abbr = "-00";
|
2017-09-19 22:54:40 +02:00
|
|
|
return bd;
|
|
|
|
}
|
|
|
|
|
2018-10-10 21:31:37 +02:00
|
|
|
inline absl::Time::Breakdown InfinitePastBreakdown() {
|
2017-09-19 22:54:40 +02:00
|
|
|
Time::Breakdown bd;
|
|
|
|
bd.year = std::numeric_limits<int64_t>::min();
|
|
|
|
bd.month = 1;
|
|
|
|
bd.day = 1;
|
|
|
|
bd.hour = 0;
|
|
|
|
bd.minute = 0;
|
|
|
|
bd.second = 0;
|
|
|
|
bd.subsecond = -absl::InfiniteDuration();
|
|
|
|
bd.weekday = 7;
|
|
|
|
bd.yearday = 1;
|
|
|
|
bd.offset = 0;
|
|
|
|
bd.is_dst = false;
|
2018-04-30 20:44:26 +02:00
|
|
|
bd.zone_abbr = "-00";
|
2017-09-19 22:54:40 +02:00
|
|
|
return bd;
|
|
|
|
}
|
|
|
|
|
2018-10-10 21:31:37 +02:00
|
|
|
inline absl::TimeZone::CivilInfo InfiniteFutureCivilInfo() {
|
|
|
|
TimeZone::CivilInfo ci;
|
|
|
|
ci.cs = CivilSecond::max();
|
|
|
|
ci.subsecond = InfiniteDuration();
|
|
|
|
ci.offset = 0;
|
|
|
|
ci.is_dst = false;
|
|
|
|
ci.zone_abbr = "-00";
|
|
|
|
return ci;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline absl::TimeZone::CivilInfo InfinitePastCivilInfo() {
|
|
|
|
TimeZone::CivilInfo ci;
|
|
|
|
ci.cs = CivilSecond::min();
|
|
|
|
ci.subsecond = -InfiniteDuration();
|
|
|
|
ci.offset = 0;
|
|
|
|
ci.is_dst = false;
|
|
|
|
ci.zone_abbr = "-00";
|
|
|
|
return ci;
|
|
|
|
}
|
|
|
|
|
2017-09-19 22:54:40 +02:00
|
|
|
inline absl::TimeConversion InfiniteFutureTimeConversion() {
|
|
|
|
absl::TimeConversion tc;
|
|
|
|
tc.pre = tc.trans = tc.post = absl::InfiniteFuture();
|
|
|
|
tc.kind = absl::TimeConversion::UNIQUE;
|
|
|
|
tc.normalized = true;
|
|
|
|
return tc;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline TimeConversion InfinitePastTimeConversion() {
|
|
|
|
absl::TimeConversion tc;
|
|
|
|
tc.pre = tc.trans = tc.post = absl::InfinitePast();
|
|
|
|
tc.kind = absl::TimeConversion::UNIQUE;
|
|
|
|
tc.normalized = true;
|
|
|
|
return tc;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Makes a Time from sec, overflowing to InfiniteFuture/InfinitePast as
|
|
|
|
// necessary. If sec is min/max, then consult cs+tz to check for overlow.
|
2018-06-21 21:55:12 +02:00
|
|
|
Time MakeTimeWithOverflow(const cctz::time_point<cctz::seconds>& sec,
|
2017-09-19 22:54:40 +02:00
|
|
|
const cctz::civil_second& cs,
|
|
|
|
const cctz::time_zone& tz,
|
|
|
|
bool* normalized = nullptr) {
|
2018-06-21 21:55:12 +02:00
|
|
|
const auto max = cctz::time_point<cctz::seconds>::max();
|
|
|
|
const auto min = cctz::time_point<cctz::seconds>::min();
|
2017-09-19 22:54:40 +02:00
|
|
|
if (sec == max) {
|
|
|
|
const auto al = tz.lookup(max);
|
|
|
|
if (cs > al.cs) {
|
|
|
|
if (normalized) *normalized = true;
|
|
|
|
return absl::InfiniteFuture();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (sec == min) {
|
|
|
|
const auto al = tz.lookup(min);
|
|
|
|
if (cs < al.cs) {
|
|
|
|
if (normalized) *normalized = true;
|
|
|
|
return absl::InfinitePast();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
const auto hi = (sec - unix_epoch()).count();
|
|
|
|
return time_internal::FromUnixDuration(time_internal::MakeDuration(hi));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Returns Mon=1..Sun=7.
|
|
|
|
inline int MapWeekday(const cctz::weekday& wd) {
|
|
|
|
switch (wd) {
|
|
|
|
case cctz::weekday::monday:
|
|
|
|
return 1;
|
|
|
|
case cctz::weekday::tuesday:
|
|
|
|
return 2;
|
|
|
|
case cctz::weekday::wednesday:
|
|
|
|
return 3;
|
|
|
|
case cctz::weekday::thursday:
|
|
|
|
return 4;
|
|
|
|
case cctz::weekday::friday:
|
|
|
|
return 5;
|
|
|
|
case cctz::weekday::saturday:
|
|
|
|
return 6;
|
|
|
|
case cctz::weekday::sunday:
|
|
|
|
return 7;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2018-10-15 20:30:24 +02:00
|
|
|
bool FindTransition(const cctz::time_zone& tz,
|
|
|
|
bool (cctz::time_zone::*find_transition)(
|
|
|
|
const cctz::time_point<cctz::seconds>& tp,
|
|
|
|
cctz::time_zone::civil_transition* trans) const,
|
|
|
|
Time t, TimeZone::CivilTransition* trans) {
|
|
|
|
// Transitions are second-aligned, so we can discard any fractional part.
|
|
|
|
const auto tp = unix_epoch() + cctz::seconds(ToUnixSeconds(t));
|
|
|
|
cctz::time_zone::civil_transition tr;
|
|
|
|
if (!(tz.*find_transition)(tp, &tr)) return false;
|
|
|
|
trans->from = CivilSecond(tr.from);
|
|
|
|
trans->to = CivilSecond(tr.to);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2017-09-19 22:54:40 +02:00
|
|
|
} // namespace
|
|
|
|
|
2018-10-10 21:31:37 +02:00
|
|
|
//
|
|
|
|
// Time
|
|
|
|
//
|
|
|
|
|
2017-09-19 22:54:40 +02:00
|
|
|
absl::Time::Breakdown Time::In(absl::TimeZone tz) const {
|
2018-10-10 21:31:37 +02:00
|
|
|
if (*this == absl::InfiniteFuture()) return InfiniteFutureBreakdown();
|
|
|
|
if (*this == absl::InfinitePast()) return InfinitePastBreakdown();
|
2017-09-19 22:54:40 +02:00
|
|
|
|
2018-06-21 21:55:12 +02:00
|
|
|
const auto tp = unix_epoch() + cctz::seconds(time_internal::GetRepHi(rep_));
|
2017-09-19 22:54:40 +02:00
|
|
|
const auto al = cctz::time_zone(tz).lookup(tp);
|
|
|
|
const auto cs = al.cs;
|
|
|
|
const auto cd = cctz::civil_day(cs);
|
|
|
|
|
|
|
|
absl::Time::Breakdown bd;
|
|
|
|
bd.year = cs.year();
|
|
|
|
bd.month = cs.month();
|
|
|
|
bd.day = cs.day();
|
|
|
|
bd.hour = cs.hour();
|
|
|
|
bd.minute = cs.minute();
|
|
|
|
bd.second = cs.second();
|
|
|
|
bd.subsecond = time_internal::MakeDuration(0, time_internal::GetRepLo(rep_));
|
2018-10-10 21:31:37 +02:00
|
|
|
bd.weekday = MapWeekday(cctz::get_weekday(cd));
|
|
|
|
bd.yearday = cctz::get_yearday(cd);
|
2017-09-19 22:54:40 +02:00
|
|
|
bd.offset = al.offset;
|
|
|
|
bd.is_dst = al.is_dst;
|
|
|
|
bd.zone_abbr = al.abbr;
|
|
|
|
return bd;
|
|
|
|
}
|
|
|
|
|
|
|
|
//
|
2018-10-10 21:31:37 +02:00
|
|
|
// Conversions from/to other time types.
|
2017-09-19 22:54:40 +02:00
|
|
|
//
|
|
|
|
|
|
|
|
absl::Time FromUDate(double udate) {
|
|
|
|
return time_internal::FromUnixDuration(absl::Milliseconds(udate));
|
|
|
|
}
|
|
|
|
|
|
|
|
absl::Time FromUniversal(int64_t universal) {
|
|
|
|
return absl::UniversalEpoch() + 100 * absl::Nanoseconds(universal);
|
|
|
|
}
|
|
|
|
|
|
|
|
int64_t ToUnixNanos(Time t) {
|
|
|
|
if (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >= 0 &&
|
|
|
|
time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >> 33 == 0) {
|
|
|
|
return (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) *
|
|
|
|
1000 * 1000 * 1000) +
|
|
|
|
(time_internal::GetRepLo(time_internal::ToUnixDuration(t)) / 4);
|
|
|
|
}
|
|
|
|
return FloorToUnit(time_internal::ToUnixDuration(t), absl::Nanoseconds(1));
|
|
|
|
}
|
|
|
|
|
|
|
|
int64_t ToUnixMicros(Time t) {
|
|
|
|
if (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >= 0 &&
|
|
|
|
time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >> 43 == 0) {
|
|
|
|
return (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) *
|
|
|
|
1000 * 1000) +
|
|
|
|
(time_internal::GetRepLo(time_internal::ToUnixDuration(t)) / 4000);
|
|
|
|
}
|
|
|
|
return FloorToUnit(time_internal::ToUnixDuration(t), absl::Microseconds(1));
|
|
|
|
}
|
|
|
|
|
|
|
|
int64_t ToUnixMillis(Time t) {
|
|
|
|
if (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >= 0 &&
|
|
|
|
time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >> 53 == 0) {
|
|
|
|
return (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) * 1000) +
|
|
|
|
(time_internal::GetRepLo(time_internal::ToUnixDuration(t)) /
|
|
|
|
(4000 * 1000));
|
|
|
|
}
|
|
|
|
return FloorToUnit(time_internal::ToUnixDuration(t), absl::Milliseconds(1));
|
|
|
|
}
|
|
|
|
|
|
|
|
int64_t ToUnixSeconds(Time t) {
|
|
|
|
return time_internal::GetRepHi(time_internal::ToUnixDuration(t));
|
|
|
|
}
|
|
|
|
|
|
|
|
time_t ToTimeT(Time t) { return absl::ToTimespec(t).tv_sec; }
|
|
|
|
|
2018-10-10 21:31:37 +02:00
|
|
|
double ToUDate(Time t) {
|
|
|
|
return absl::FDivDuration(time_internal::ToUnixDuration(t),
|
|
|
|
absl::Milliseconds(1));
|
|
|
|
}
|
|
|
|
|
|
|
|
int64_t ToUniversal(absl::Time t) {
|
|
|
|
return absl::FloorToUnit(t - absl::UniversalEpoch(), absl::Nanoseconds(100));
|
|
|
|
}
|
|
|
|
|
|
|
|
absl::Time TimeFromTimespec(timespec ts) {
|
|
|
|
return time_internal::FromUnixDuration(absl::DurationFromTimespec(ts));
|
|
|
|
}
|
|
|
|
|
|
|
|
absl::Time TimeFromTimeval(timeval tv) {
|
|
|
|
return time_internal::FromUnixDuration(absl::DurationFromTimeval(tv));
|
|
|
|
}
|
|
|
|
|
2017-09-19 22:54:40 +02:00
|
|
|
timespec ToTimespec(Time t) {
|
|
|
|
timespec ts;
|
|
|
|
absl::Duration d = time_internal::ToUnixDuration(t);
|
|
|
|
if (!time_internal::IsInfiniteDuration(d)) {
|
|
|
|
ts.tv_sec = time_internal::GetRepHi(d);
|
|
|
|
if (ts.tv_sec == time_internal::GetRepHi(d)) { // no time_t narrowing
|
|
|
|
ts.tv_nsec = time_internal::GetRepLo(d) / 4; // floor
|
|
|
|
return ts;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (d >= absl::ZeroDuration()) {
|
|
|
|
ts.tv_sec = std::numeric_limits<time_t>::max();
|
|
|
|
ts.tv_nsec = 1000 * 1000 * 1000 - 1;
|
|
|
|
} else {
|
|
|
|
ts.tv_sec = std::numeric_limits<time_t>::min();
|
|
|
|
ts.tv_nsec = 0;
|
|
|
|
}
|
|
|
|
return ts;
|
|
|
|
}
|
|
|
|
|
|
|
|
timeval ToTimeval(Time t) {
|
|
|
|
timeval tv;
|
|
|
|
timespec ts = absl::ToTimespec(t);
|
|
|
|
tv.tv_sec = ts.tv_sec;
|
|
|
|
if (tv.tv_sec != ts.tv_sec) { // narrowing
|
|
|
|
if (ts.tv_sec < 0) {
|
|
|
|
tv.tv_sec = std::numeric_limits<decltype(tv.tv_sec)>::min();
|
|
|
|
tv.tv_usec = 0;
|
|
|
|
} else {
|
|
|
|
tv.tv_sec = std::numeric_limits<decltype(tv.tv_sec)>::max();
|
|
|
|
tv.tv_usec = 1000 * 1000 - 1;
|
|
|
|
}
|
|
|
|
return tv;
|
|
|
|
}
|
|
|
|
tv.tv_usec = static_cast<int>(ts.tv_nsec / 1000); // suseconds_t
|
|
|
|
return tv;
|
|
|
|
}
|
|
|
|
|
2017-09-24 17:20:48 +02:00
|
|
|
Time FromChrono(const std::chrono::system_clock::time_point& tp) {
|
|
|
|
return time_internal::FromUnixDuration(time_internal::FromChrono(
|
|
|
|
tp - std::chrono::system_clock::from_time_t(0)));
|
|
|
|
}
|
|
|
|
|
|
|
|
std::chrono::system_clock::time_point ToChronoTime(absl::Time t) {
|
|
|
|
using D = std::chrono::system_clock::duration;
|
|
|
|
auto d = time_internal::ToUnixDuration(t);
|
|
|
|
if (d < ZeroDuration()) d = Floor(d, FromChrono(D{1}));
|
|
|
|
return std::chrono::system_clock::from_time_t(0) +
|
|
|
|
time_internal::ToChronoDuration<D>(d);
|
|
|
|
}
|
|
|
|
|
2018-10-10 21:31:37 +02:00
|
|
|
//
|
|
|
|
// TimeZone
|
|
|
|
//
|
|
|
|
|
|
|
|
absl::TimeZone::CivilInfo TimeZone::At(Time t) const {
|
|
|
|
if (t == absl::InfiniteFuture()) return InfiniteFutureCivilInfo();
|
|
|
|
if (t == absl::InfinitePast()) return InfinitePastCivilInfo();
|
|
|
|
|
|
|
|
const auto ud = time_internal::ToUnixDuration(t);
|
|
|
|
const auto tp = unix_epoch() + cctz::seconds(time_internal::GetRepHi(ud));
|
|
|
|
const auto al = cz_.lookup(tp);
|
|
|
|
|
|
|
|
TimeZone::CivilInfo ci;
|
|
|
|
ci.cs = CivilSecond(al.cs);
|
|
|
|
ci.subsecond = time_internal::MakeDuration(0, time_internal::GetRepLo(ud));
|
|
|
|
ci.offset = al.offset;
|
|
|
|
ci.is_dst = al.is_dst;
|
|
|
|
ci.zone_abbr = al.abbr;
|
|
|
|
return ci;
|
|
|
|
}
|
|
|
|
|
|
|
|
absl::TimeZone::TimeInfo TimeZone::At(CivilSecond ct) const {
|
|
|
|
const cctz::civil_second cs(ct);
|
|
|
|
const auto cl = cz_.lookup(cs);
|
|
|
|
|
|
|
|
TimeZone::TimeInfo ti;
|
|
|
|
switch (cl.kind) {
|
|
|
|
case cctz::time_zone::civil_lookup::UNIQUE:
|
|
|
|
ti.kind = TimeZone::TimeInfo::UNIQUE;
|
|
|
|
break;
|
|
|
|
case cctz::time_zone::civil_lookup::SKIPPED:
|
|
|
|
ti.kind = TimeZone::TimeInfo::SKIPPED;
|
|
|
|
break;
|
|
|
|
case cctz::time_zone::civil_lookup::REPEATED:
|
|
|
|
ti.kind = TimeZone::TimeInfo::REPEATED;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
ti.pre = MakeTimeWithOverflow(cl.pre, cs, cz_);
|
|
|
|
ti.trans = MakeTimeWithOverflow(cl.trans, cs, cz_);
|
|
|
|
ti.post = MakeTimeWithOverflow(cl.post, cs, cz_);
|
|
|
|
return ti;
|
|
|
|
}
|
|
|
|
|
2018-10-15 20:30:24 +02:00
|
|
|
bool TimeZone::NextTransition(Time t, CivilTransition* trans) const {
|
|
|
|
return FindTransition(cz_, &cctz::time_zone::next_transition, t, trans);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool TimeZone::PrevTransition(Time t, CivilTransition* trans) const {
|
|
|
|
return FindTransition(cz_, &cctz::time_zone::prev_transition, t, trans);
|
|
|
|
}
|
|
|
|
|
2018-10-10 21:31:37 +02:00
|
|
|
//
|
|
|
|
// Conversions involving time zones.
|
|
|
|
//
|
|
|
|
|
|
|
|
absl::TimeConversion ConvertDateTime(int64_t year, int mon, int day, int hour,
|
|
|
|
int min, int sec, TimeZone tz) {
|
|
|
|
// Avoids years that are too extreme for CivilSecond to normalize.
|
|
|
|
if (year > 300000000000) return InfiniteFutureTimeConversion();
|
|
|
|
if (year < -300000000000) return InfinitePastTimeConversion();
|
|
|
|
|
|
|
|
const CivilSecond cs(year, mon, day, hour, min, sec);
|
|
|
|
const auto ti = tz.At(cs);
|
|
|
|
|
|
|
|
TimeConversion tc;
|
|
|
|
tc.pre = ti.pre;
|
|
|
|
tc.trans = ti.trans;
|
|
|
|
tc.post = ti.post;
|
|
|
|
switch (ti.kind) {
|
|
|
|
case TimeZone::TimeInfo::UNIQUE:
|
|
|
|
tc.kind = TimeConversion::UNIQUE;
|
|
|
|
break;
|
|
|
|
case TimeZone::TimeInfo::SKIPPED:
|
|
|
|
tc.kind = TimeConversion::SKIPPED;
|
|
|
|
break;
|
|
|
|
case TimeZone::TimeInfo::REPEATED:
|
|
|
|
tc.kind = TimeConversion::REPEATED;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
tc.normalized = false;
|
|
|
|
if (year != cs.year() || mon != cs.month() || day != cs.day() ||
|
|
|
|
hour != cs.hour() || min != cs.minute() || sec != cs.second()) {
|
|
|
|
tc.normalized = true;
|
|
|
|
}
|
|
|
|
return tc;
|
|
|
|
}
|
|
|
|
|
|
|
|
absl::Time FromTM(const struct tm& tm, absl::TimeZone tz) {
|
Export of internal Abseil changes
--
f13697e3d33803f9667d124072da4f6dd8bfbf85 by Andy Soffer <asoffer@google.com>:
Addressing https://github.com/abseil/abseil-cpp/issues/314, fixing
CMakeLists.txt to reference ABSL_TEST_COPTS rather than ABSL_DEFAULT_COPTS.
ABSL_TEST_COPTS should be preferred for all tests so that they are configured consistently (moreover, CMake should agree with Bazel).
PiperOrigin-RevId: 274932312
--
c31c24a1fa6bb98136adf51ef37c0818ac366690 by Derek Mauro <dmauro@google.com>:
Silence MSAN in the stack consumption test utility
PiperOrigin-RevId: 274912950
--
2412913c05a246cd527cd4c31452f126e9129f3a by CJ Johnson <johnsoncj@google.com>:
Internal change
PiperOrigin-RevId: 274847103
--
75e984a93b5760873501b96ac3229ccfd955daf8 by Abseil Team <absl-team@google.com>:
Reformat BUILD file to current standards.
PiperOrigin-RevId: 274815392
--
a2780e085f1df1e4ca2c814a58c893d1b78a1d9c by Samuel Benzaquen <sbenza@google.com>:
Fix invalid result regarding leading zeros in the exponent.
PiperOrigin-RevId: 274808017
--
dd402e1cb5c4ebacb576372ae24bf289d729d323 by Samuel Benzaquen <sbenza@google.com>:
Make string_view's relational operators constexpr when possible.
PiperOrigin-RevId: 274807873
--
b4ef32565653a5da1cb8bb8d0351586d23519658 by Abseil Team <absl-team@google.com>:
Internal rework.
PiperOrigin-RevId: 274787159
--
70d81971c5914e6785b8e8a9d4f6eb2655dd62c0 by Gennadiy Rozental <rogeeff@google.com>:
Internal rework.
PiperOrigin-RevId: 274715557
--
14f5b0440e353b899cafaaa15b53e77f98f401af by Gennadiy Rozental <rogeeff@google.com>:
Make deprecated statements about ParseFLag/UnparseFlag consistent in a file.
PiperOrigin-RevId: 274668123
--
2e85adbdbb92612e4d750bc34fbca3333128b42d by Abseil Team <absl-team@google.com>:
Allow absl::c_equal to be used with arrays.
This is achieved by allowing container size computation for arrays.
PiperOrigin-RevId: 274426830
--
219719f107226d328773e6cec99fb473f5d3119c by Gennadiy Rozental <rogeeff@google.com>:
Release correct extension interfaces to support usage of absl::Time and absl::Duration as ABSL_FLAG
PiperOrigin-RevId: 274273788
--
47a77f93fda23b69b4a6bdbd506fe643c69a5579 by Gennadiy Rozental <rogeeff@google.com>:
Rework of flags persistence/FlagSaver internals.
PiperOrigin-RevId: 274225213
--
7807be3fe757c19e3b0c487298387683d4c9f5b3 by Abseil Team <absl-team@google.com>:
Switch reference to sdkddkver.h to lowercase, matching conventions used in the Windows SDK and other uses. This helps to avoid confusion on case-sensitive filesystems.
PiperOrigin-RevId: 274061877
--
561304090087a19f1d10f0475f564fe132ebf06e by Andy Getzendanner <durandal@google.com>:
Fix ABSL_WAITER_MODE detection for mingw
Import of https://github.com/abseil/abseil-cpp/pull/342
PiperOrigin-RevId: 274030071
--
9b3caac2cf202b9d440dfa1b4ffd538ac4bf715b by Derek Mauro <dmauro@google.com>:
Support using Abseil with the musl libc implementation.
Only test changes were required:
* Workaround for a bug in sigaltstack() on musl
* printf-style pointer formatting (%p) is implementation defined,
so verify StrFromat produces something compatible
* Fix detection of feenableexcept()
PiperOrigin-RevId: 274011666
--
73e8a938fc139e1cc8670d4513a445bacc855539 by Abseil Team <absl-team@google.com>:
nvcc workaround: explicitly specify the definition of node_handle::Base
PiperOrigin-RevId: 274011392
--
ab9cc6d042aca7d48e16c504ab10eab39433f4b2 by Andy Soffer <asoffer@google.com>:
Internal change
PiperOrigin-RevId: 273996318
--
e567c4979ca99c7e71821ec1523b8f5edd2c76ac by Abseil Team <absl-team@google.com>:
Introduce a type alias to work around an nvcc bug.
On the previous code, nvcc gets confused thinking that T has to be a parameter
pack, as IsDecomposable accepts one.
PiperOrigin-RevId: 273980472
--
105b6e6339b77a32f4432de05f44cd3f9c436751 by Eric Fiselier <ericwf@google.com>:
Import of CCTZ from GitHub.
PiperOrigin-RevId: 273955589
--
8feb87ff1d7e721fe094855e67c19539d5e582b7 by Abseil Team <absl-team@google.com>:
Avoid dual-exporting scheduling_mode.h
PiperOrigin-RevId: 273825112
--
fbc37854776d295dae98fb9d06a541f296daab95 by Andy Getzendanner <durandal@google.com>:
Fix ABSL_HAVE_ALARM check on mingw
Import of https://github.com/abseil/abseil-cpp/pull/341
PiperOrigin-RevId: 273817839
--
6aedcd63a735b9133e143b043744ba0a25407f6f by Andy Soffer <asoffer@google.com>:
Remove bit_gen_view.h now that all callers have been migrated to bit_gen_ref.h
Tested:
TGP - https://test.corp.google.com/ui#id=OCL:273762409:BASE:273743370:1570639020744:3001bcb5
PiperOrigin-RevId: 273810331
--
6573de24a66ba715c579f7f32b5c48a1d743c7f8 by Abseil Team <absl-team@google.com>:
Internal change.
PiperOrigin-RevId: 273589963
--
91c8c28b6dca26d98b39e8e06a8ed17c701ff793 by Abseil Team <absl-team@google.com>:
Update macro name for `ABSL_GUARDED_BY()` in the example section.
PiperOrigin-RevId: 273286983
--
0ff7d1a93d70f8ecd693f8dbb98b7a4a016ca2a4 by Abseil Team <absl-team@google.com>:
Fix potential integer overflow in the absl time library.
In absl::FromTM, the tm.tm_year is added by 1900 regarding that tm.tm_year represents the years since 1900. This change checks integer overflow before doing the arithmetic operation.
PiperOrigin-RevId: 273092952
--
b41c2a1310086807be09a833099ae6d4009f037c by Gennadiy Rozental <rogeeff@google.com>:
Correctly Unlock the global mutex in case of concurrent flag initialization.
Fixes #386
PiperOrigin-RevId: 272979749
--
c53103e71b2a6063af3c6d4ff68aa2d8f9ae9e06 by Abseil Team <absl-team@google.com>:
Try to become idle only when there is no wakeup.
Immediately after waking up (when futex wait returns), the current thread tries
to become idle doing bunch of memory loads and a branch. Problem is that there
is a good chance that we woke up due to a wakeup, especially for actively used
threads. For such wakeups, calling MaybeBecomeIdle() would be a waste of
cycles.
Instead, call MaybeBecomeIdle() only when we are sure there is no wakeup. For
idle threads the net effect should be the same. For active, threads this will
be more efficient.
Moreover, since MaybeBecomeIdle() is called before waiting on the futex, the
current thread will try to become idle before sleeping. This should result
in more accurate idleness and more efficient release of thread resources.
PiperOrigin-RevId: 272940381
GitOrigin-RevId: f13697e3d33803f9667d124072da4f6dd8bfbf85
Change-Id: I36de05aec12595183725652dd362dfa58fb095d0
2019-10-16 03:18:40 +02:00
|
|
|
civil_year_t tm_year = tm.tm_year;
|
|
|
|
// Avoids years that are too extreme for CivilSecond to normalize.
|
|
|
|
if (tm_year > 300000000000ll) return InfiniteFuture();
|
|
|
|
if (tm_year < -300000000000ll) return InfinitePast();
|
|
|
|
int tm_mon = tm.tm_mon;
|
|
|
|
if (tm_mon == std::numeric_limits<int>::max()) {
|
|
|
|
tm_mon -= 12;
|
|
|
|
tm_year += 1;
|
|
|
|
}
|
|
|
|
const auto ti = tz.At(CivilSecond(tm_year + 1900, tm_mon + 1, tm.tm_mday,
|
|
|
|
tm.tm_hour, tm.tm_min, tm.tm_sec));
|
2018-10-10 21:31:37 +02:00
|
|
|
return tm.tm_isdst == 0 ? ti.post : ti.pre;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct tm ToTM(absl::Time t, absl::TimeZone tz) {
|
|
|
|
struct tm tm = {};
|
|
|
|
|
|
|
|
const auto ci = tz.At(t);
|
|
|
|
const auto& cs = ci.cs;
|
|
|
|
tm.tm_sec = cs.second();
|
|
|
|
tm.tm_min = cs.minute();
|
|
|
|
tm.tm_hour = cs.hour();
|
|
|
|
tm.tm_mday = cs.day();
|
|
|
|
tm.tm_mon = cs.month() - 1;
|
|
|
|
|
|
|
|
// Saturates tm.tm_year in cases of over/underflow, accounting for the fact
|
|
|
|
// that tm.tm_year is years since 1900.
|
|
|
|
if (cs.year() < std::numeric_limits<int>::min() + 1900) {
|
|
|
|
tm.tm_year = std::numeric_limits<int>::min();
|
|
|
|
} else if (cs.year() > std::numeric_limits<int>::max()) {
|
|
|
|
tm.tm_year = std::numeric_limits<int>::max() - 1900;
|
|
|
|
} else {
|
|
|
|
tm.tm_year = static_cast<int>(cs.year() - 1900);
|
|
|
|
}
|
|
|
|
|
2019-07-02 21:50:48 +02:00
|
|
|
switch (GetWeekday(cs)) {
|
2018-10-10 21:31:37 +02:00
|
|
|
case Weekday::sunday:
|
|
|
|
tm.tm_wday = 0;
|
|
|
|
break;
|
|
|
|
case Weekday::monday:
|
|
|
|
tm.tm_wday = 1;
|
|
|
|
break;
|
|
|
|
case Weekday::tuesday:
|
|
|
|
tm.tm_wday = 2;
|
|
|
|
break;
|
|
|
|
case Weekday::wednesday:
|
|
|
|
tm.tm_wday = 3;
|
|
|
|
break;
|
|
|
|
case Weekday::thursday:
|
|
|
|
tm.tm_wday = 4;
|
|
|
|
break;
|
|
|
|
case Weekday::friday:
|
|
|
|
tm.tm_wday = 5;
|
|
|
|
break;
|
|
|
|
case Weekday::saturday:
|
|
|
|
tm.tm_wday = 6;
|
|
|
|
break;
|
|
|
|
}
|
2019-07-02 21:50:48 +02:00
|
|
|
tm.tm_yday = GetYearDay(cs) - 1;
|
2018-10-10 21:31:37 +02:00
|
|
|
tm.tm_isdst = ci.is_dst ? 1 : 0;
|
|
|
|
|
|
|
|
return tm;
|
|
|
|
}
|
|
|
|
|
2019-12-12 19:36:03 +01:00
|
|
|
ABSL_NAMESPACE_END
|
2017-09-19 22:54:40 +02:00
|
|
|
} // namespace absl
|