3 Copyright (c) 2007-2008 Michael G Schwern
5 This software originally derived from Paul Sheer's pivotal_gmtime_r.c.
9 Permission is hereby granted, free of charge, to any person obtaining a copy
10 of this software and associated documentation files (the "Software"), to deal
11 in the Software without restriction, including without limitation the rights
12 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
13 copies of the Software, and to permit persons to whom the Software is
14 furnished to do so, subject to the following conditions:
16 The above copyright notice and this permission notice shall be included in
17 all copies or substantial portions of the Software.
19 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
22 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
31 Programmers who have available to them 64-bit time values as a 'long
32 long' type can use localtime64_r() and gmtime64_r() which correctly
33 converts the time even on 32-bit systems. Whether you have 64-bit time
34 values will depend on the operating system.
36 localtime64_r() is a 64-bit equivalent of localtime_r().
38 gmtime64_r() is a 64-bit equivalent of gmtime_r().
44 static const int days_in_month[2][12] = {
45 {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
46 {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
49 static const int julian_days_by_month[2][12] = {
50 {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334},
51 {0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335},
54 static const int length_of_year[2] = { 365, 366 };
56 /* Number of days in a 400 year Gregorian cycle */
57 static const Year years_in_gregorian_cycle = 400;
58 static const int days_in_gregorian_cycle = (365 * 400) + 100 - 4 + 1;
60 /* 28 year calendar cycle between 2010 and 2037 */
61 #define SOLAR_CYCLE_LENGTH 28
62 static const int safe_years[SOLAR_CYCLE_LENGTH] = {
63 2016, 2017, 2018, 2019,
64 2020, 2021, 2022, 2023,
65 2024, 2025, 2026, 2027,
66 2028, 2029, 2030, 2031,
67 2032, 2033, 2034, 2035,
68 2036, 2037, 2010, 2011,
69 2012, 2013, 2014, 2015
72 static const int dow_year_start[SOLAR_CYCLE_LENGTH] = {
73 5, 0, 1, 2, /* 0 2016 - 2019 */
78 2, 4, 5, 6, /* 20 2036, 2037, 2010, 2011 */
79 0, 2, 3, 4 /* 24 2012, 2013, 2014, 2015 */
82 /* Let's assume people are going to be looking for dates in the future.
83 Let's provide some cheats so you can skip ahead.
84 This has a 4x speed boost when near 2008.
86 /* Number of days since epoch on Jan 1st, 2008 GMT */
87 #define CHEAT_DAYS (1199145600 / 24 / 60 / 60)
88 #define CHEAT_YEARS 108
90 #define IS_LEAP(n) ((!(((n) + 1900) % 400) || (!(((n) + 1900) % 4) && (((n) + 1900) % 100))) != 0)
91 #define WRAP(a,b,m) ((a) = ((a) < 0 ) ? ((b)--, (a) + (m)) : (a))
93 #ifdef USE_SYSTEM_LOCALTIME
94 # define SHOULD_USE_SYSTEM_LOCALTIME(a) ( \
95 (a) <= SYSTEM_LOCALTIME_MAX && \
96 (a) >= SYSTEM_LOCALTIME_MIN \
99 # define SHOULD_USE_SYSTEM_LOCALTIME(a) (0)
102 #ifdef USE_SYSTEM_GMTIME
103 # define SHOULD_USE_SYSTEM_GMTIME(a) ( \
104 (a) <= SYSTEM_GMTIME_MAX && \
105 (a) >= SYSTEM_GMTIME_MIN \
108 # define SHOULD_USE_SYSTEM_GMTIME(a) (0)
112 static int is_exception_century(Year year)
114 int is_exception = ((year % 100 == 0) && !(year % 400 == 0));
115 /* printf("is_exception_century: %s\n", is_exception ? "yes" : "no"); */
117 return(is_exception);
121 Time64_T timegm64(struct TM *date) {
123 Time64_T seconds = 0;
126 if( date->tm_year > 70 ) {
128 while( year < date->tm_year ) {
129 days += length_of_year[IS_LEAP(year)];
133 else if ( date->tm_year < 70 ) {
136 days -= length_of_year[IS_LEAP(year)];
138 } while( year >= date->tm_year );
141 days += julian_days_by_month[IS_LEAP(date->tm_year)][date->tm_mon];
142 days += date->tm_mday - 1;
144 /* Avoid overflowing the days integer */
146 seconds = seconds * 60 * 60 * 24;
148 seconds += date->tm_hour * 60 * 60;
149 seconds += date->tm_min * 60;
150 seconds += date->tm_sec;
156 static int check_tm(struct TM *tm)
158 /* Don't forget leap seconds */
159 assert(tm->tm_sec >= 0);
160 assert(tm->tm_sec <= 61);
162 assert(tm->tm_min >= 0);
163 assert(tm->tm_min <= 59);
165 assert(tm->tm_hour >= 0);
166 assert(tm->tm_hour <= 23);
168 assert(tm->tm_mday >= 1);
169 assert(tm->tm_mday <= days_in_month[IS_LEAP(tm->tm_year)][tm->tm_mon]);
171 assert(tm->tm_mon >= 0);
172 assert(tm->tm_mon <= 11);
174 assert(tm->tm_wday >= 0);
175 assert(tm->tm_wday <= 6);
177 assert(tm->tm_yday >= 0);
178 assert(tm->tm_yday <= length_of_year[IS_LEAP(tm->tm_year)]);
180 #ifdef HAS_TM_TM_GMTOFF
181 assert(tm->tm_gmtoff >= -24 * 60 * 60);
182 assert(tm->tm_gmtoff <= 24 * 60 * 60);
189 /* The exceptional centuries without leap years cause the cycle to
192 static Year cycle_offset(Year year)
194 const Year start_year = 2000;
195 Year year_diff = year - start_year;
198 if( year > start_year )
201 exceptions = year_diff / 100;
202 exceptions -= year_diff / 400;
205 fprintf(stderr, "# year: %lld, exceptions: %lld, year_diff: %lld\n",
206 year, exceptions, year_diff);
209 return exceptions * 16;
212 /* For a given year after 2038, pick the latest possible matching
213 year in the 28 year calendar cycle.
216 1) Starts on the same day of the week.
217 2) Has the same leap year status.
219 This is so the calendars match up.
221 Also the previous year must match. When doing Jan 1st you might
222 wind up on Dec 31st the previous year when doing a -UTC time zone.
224 Finally, the next year must have the same start day of week. This
225 is for Dec 31st with a +UTC time zone.
226 It doesn't need the same leap year status since we only care about
229 static int safe_year(Year year)
232 Year year_cycle = year + cycle_offset(year);
234 /* Change non-leap xx00 years to an equivalent */
235 if( is_exception_century(year) )
238 /* Also xx01 years, since the previous year will be wrong */
239 if( is_exception_century(year - 1) )
242 year_cycle %= SOLAR_CYCLE_LENGTH;
244 year_cycle = SOLAR_CYCLE_LENGTH + year_cycle;
246 assert( year_cycle >= 0 );
247 assert( year_cycle < SOLAR_CYCLE_LENGTH );
248 safe_year = safe_years[year_cycle];
250 assert(safe_year <= 2037 && safe_year >= 2010);
253 printf("year: %d, year_cycle: %d, safe_year: %d\n",
254 year, year_cycle, safe_year);
261 void copy_tm_to_TM(const struct tm *src, struct TM *dest) {
263 memset(dest, 0, sizeof(*dest));
267 dest->tm_sec = src->tm_sec;
268 dest->tm_min = src->tm_min;
269 dest->tm_hour = src->tm_hour;
270 dest->tm_mday = src->tm_mday;
271 dest->tm_mon = src->tm_mon;
272 dest->tm_year = (Year)src->tm_year;
273 dest->tm_wday = src->tm_wday;
274 dest->tm_yday = src->tm_yday;
275 dest->tm_isdst = src->tm_isdst;
277 # ifdef HAS_TM_TM_GMTOFF
278 dest->tm_gmtoff = src->tm_gmtoff;
281 # ifdef HAS_TM_TM_ZONE
282 dest->tm_zone = src->tm_zone;
286 /* They're the same type */
287 memcpy(dest, src, sizeof(*dest));
293 void copy_TM_to_tm(const struct TM *src, struct tm *dest) {
295 memset(dest, 0, sizeof(*dest));
299 dest->tm_sec = src->tm_sec;
300 dest->tm_min = src->tm_min;
301 dest->tm_hour = src->tm_hour;
302 dest->tm_mday = src->tm_mday;
303 dest->tm_mon = src->tm_mon;
304 dest->tm_year = (int)src->tm_year;
305 dest->tm_wday = src->tm_wday;
306 dest->tm_yday = src->tm_yday;
307 dest->tm_isdst = src->tm_isdst;
309 # ifdef HAS_TM_TM_GMTOFF
310 dest->tm_gmtoff = src->tm_gmtoff;
313 # ifdef HAS_TM_TM_ZONE
314 dest->tm_zone = src->tm_zone;
318 /* They're the same type */
319 memcpy(dest, src, sizeof(*dest));
325 /* Simulate localtime_r() to the best of our ability */
326 struct tm * fake_localtime_r(const time_t *clock, struct tm *result) {
327 const struct tm *static_result = localtime(clock);
329 assert(result != NULL);
331 if( static_result == NULL ) {
332 memset(result, 0, sizeof(*result));
336 memcpy(result, static_result, sizeof(*result));
342 /* Simulate gmtime_r() to the best of our ability */
343 struct tm * fake_gmtime_r(const time_t *clock, struct tm *result) {
344 const struct tm *static_result = gmtime(clock);
346 assert(result != NULL);
348 if( static_result == NULL ) {
349 memset(result, 0, sizeof(*result));
353 memcpy(result, static_result, sizeof(*result));
359 struct TM *gmtime64_r (const Time64_T *in_time, struct TM *p)
361 int v_tm_sec, v_tm_min, v_tm_hour, v_tm_mon, v_tm_wday;
365 Time64_T time = *in_time;
371 /* Use the system gmtime() if time_t is small enough */
372 if( SHOULD_USE_SYSTEM_GMTIME(*in_time) ) {
373 time_t safe_time = *in_time;
375 GMTIME_R(&safe_time, &safe_date);
377 copy_tm_to_TM(&safe_date, p);
383 #ifdef HAS_TM_TM_GMTOFF
388 #ifdef HAS_TM_TM_ZONE
392 v_tm_sec = (int)(time % 60);
394 v_tm_min = (int)(time % 60);
396 v_tm_hour = (int)(time % 24);
400 WRAP (v_tm_sec, v_tm_min, 60);
401 WRAP (v_tm_min, v_tm_hour, 60);
402 WRAP (v_tm_hour, v_tm_tday, 24);
404 v_tm_wday = (int)((v_tm_tday + 4) % 7);
409 if (m >= CHEAT_DAYS) {
415 /* Gregorian cycles, this is huge optimization for distant times */
416 cycles = m / (Time64_T) days_in_gregorian_cycle;
418 m -= (cycles * (Time64_T) days_in_gregorian_cycle);
419 year += (cycles * years_in_gregorian_cycle);
423 leap = IS_LEAP (year);
424 while (m >= (Time64_T) length_of_year[leap]) {
425 m -= (Time64_T) length_of_year[leap];
427 leap = IS_LEAP (year);
432 while (m >= (Time64_T) days_in_month[leap][v_tm_mon]) {
433 m -= (Time64_T) days_in_month[leap][v_tm_mon];
439 /* Gregorian cycles */
440 cycles = (m / (Time64_T) days_in_gregorian_cycle) + 1;
442 m -= (cycles * (Time64_T) days_in_gregorian_cycle);
443 year += (cycles * years_in_gregorian_cycle);
447 leap = IS_LEAP (year);
448 while (m < (Time64_T) -length_of_year[leap]) {
449 m += (Time64_T) length_of_year[leap];
451 leap = IS_LEAP (year);
456 while (m < (Time64_T) -days_in_month[leap][v_tm_mon]) {
457 m += (Time64_T) days_in_month[leap][v_tm_mon];
460 m += (Time64_T) days_in_month[leap][v_tm_mon];
464 if( p->tm_year != year ) {
471 /* At this point m is less than a year so casting to an int is safe */
472 p->tm_mday = (int) m + 1;
473 p->tm_yday = julian_days_by_month[leap][v_tm_mon] + (int)m;
474 p->tm_sec = v_tm_sec;
475 p->tm_min = v_tm_min;
476 p->tm_hour = v_tm_hour;
477 p->tm_mon = v_tm_mon;
478 p->tm_wday = v_tm_wday;
486 struct TM *localtime64_r (const Time64_T *time, struct TM *local_tm)
494 assert(local_tm != NULL);
496 /* Use the system localtime() if time_t is small enough */
497 if( SHOULD_USE_SYSTEM_LOCALTIME(*time) ) {
500 LOCALTIME_R(&safe_time, &safe_date);
502 copy_tm_to_TM(&safe_date, local_tm);
503 assert(check_tm(local_tm));
508 if( gmtime64_r(time, &gm_tm) == NULL )
511 orig_year = gm_tm.tm_year;
513 if (gm_tm.tm_year > (2037 - 1900) ||
514 gm_tm.tm_year < (1902 - 1900)
517 gm_tm.tm_year = safe_year((Year)(gm_tm.tm_year + 1900)) - 1900;
520 safe_time = timegm64(&gm_tm);
521 if( LOCALTIME_R(&safe_time, &safe_date) == NULL )
524 copy_tm_to_TM(&safe_date, local_tm);
526 local_tm->tm_year = orig_year;
527 if( local_tm->tm_year != orig_year ) {
535 month_diff = local_tm->tm_mon - gm_tm.tm_mon;
537 /* When localtime is Dec 31st previous year and
538 gmtime is Jan 1st next year.
540 if( month_diff == 11 ) {
544 /* When localtime is Jan 1st, next year and
545 gmtime is Dec 31st, previous year.
547 if( month_diff == -11 ) {
551 /* GMT is Jan 1st, xx01 year, but localtime is still Dec 31st
552 in a non-leap xx00. There is one point in the cycle
553 we can't account for which the safe xx00 year is a leap
554 year. So we need to correct for Dec 31st comming out as
555 the 366th day of the year.
557 if( !IS_LEAP(local_tm->tm_year) && local_tm->tm_yday == 365 )
560 assert(check_tm(local_tm));