1 /* Convert a `struct tm' to a time_t value.
2 Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2001, 2002, 2003,
3 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
4 Contributed by Paul Eggert (eggert@twinsun.com).
6 NOTE: The canonical source of this file is maintained with the GNU C Library.
7 Bugs can be reported to bug-glibc@gnu.org.
9 This program is free software; you can redistribute it and/or modify it
10 under the terms of the GNU General Public License as published by the
11 Free Software Foundation; either version 2, or (at your option) any
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
24 /* Define this to have a standalone program to test this implementation of
33 # define HAVE_LIMITS_H 1
34 # define STDC_HEADERS 1
37 /* Assume that leap seconds are possible, unless told otherwise.
38 If the host has a `zic' command with a `-L leapsecondfilename' option,
39 then it supports leap seconds; otherwise it probably doesn't. */
40 #ifndef LEAP_SECONDS_POSSIBLE
41 # define LEAP_SECONDS_POSSIBLE 1
44 #include <sys/types.h> /* Some systems define `time_t' here. */
56 /* Make it work even if the system's libc has its own mktime routine. */
57 # define mktime my_mktime
64 /* The extra casts work around common compiler bugs. */
65 #define TYPE_SIGNED(t) (! ((t) 0 < (t) -1))
66 /* The outer cast is needed to work around a bug in Cray C 5.0.3.0.
67 It is necessary at least when t == time_t. */
68 #define TYPE_MINIMUM(t) ((t) (TYPE_SIGNED (t) \
69 ? ~ (t) 0 << (sizeof (t) * CHAR_BIT - 1) : (t) 0))
70 #define TYPE_MAXIMUM(t) ((t) (~ (t) 0 - TYPE_MINIMUM (t)))
73 # define INT_MIN TYPE_MINIMUM (int)
76 # define INT_MAX TYPE_MAXIMUM (int)
80 # define TIME_T_MIN TYPE_MINIMUM (time_t)
83 # define TIME_T_MAX TYPE_MAXIMUM (time_t)
86 #define TM_YEAR_BASE 1900
87 #define EPOCH_YEAR 1970
90 /* Nonzero if YEAR is a leap year (every 4 years,
91 except every 100th isn't, and every 400th is). */
92 # define __isleap(year) \
93 ((year) % 4 == 0 && ((year) % 100 != 0 || (year) % 400 == 0))
96 /* How many days come before each month (0-12). */
97 const unsigned short int __mon_yday
[2][13] =
100 { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365 },
102 { 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, 366 }
107 # define my_mktime_localtime_r __localtime_r
109 /* If we're a mktime substitute in a GNU program, then prefer
110 localtime to localtime_r, since many localtime_r implementations
113 my_mktime_localtime_r (t
, tp
)
117 struct tm
*l
= localtime (t
);
126 /* Yield the difference between (YEAR-YDAY HOUR:MIN:SEC) and (*TP),
127 measured in seconds, ignoring leap seconds.
128 YEAR uses the same numbering as TM->tm_year.
129 All values are in range, except possibly YEAR.
130 If TP is null, return a nonzero value.
131 If overflow occurs, yield the low order bits of the correct answer. */
133 ydhms_tm_diff (year
, yday
, hour
, min
, sec
, tp
)
134 int year
, yday
, hour
, min
, sec
;
141 /* Compute intervening leap days correctly even if year is negative.
142 Take care to avoid int overflow. time_t overflow is OK, since
143 only the low order bits of the correct time_t answer are needed.
144 Don't convert to time_t until after all divisions are done, since
145 time_t might be unsigned. */
146 int a4
= (year
>> 2) + (TM_YEAR_BASE
>> 2) - ! (year
& 3);
147 int b4
= (tp
->tm_year
>> 2) + (TM_YEAR_BASE
>> 2) - ! (tp
->tm_year
& 3);
148 int a100
= a4
/ 25 - (a4
% 25 < 0);
149 int b100
= b4
/ 25 - (b4
% 25 < 0);
150 int a400
= a100
>> 2;
151 int b400
= b100
>> 2;
152 int intervening_leap_days
= (a4
- b4
) - (a100
- b100
) + (a400
- b400
);
153 time_t years
= year
- (time_t) tp
->tm_year
;
154 time_t days
= (365 * years
+ intervening_leap_days
155 + (yday
- tp
->tm_yday
));
156 return (60 * (60 * (24 * days
+ (hour
- tp
->tm_hour
))
157 + (min
- tp
->tm_min
))
158 + (sec
- tp
->tm_sec
));
162 /* Use CONVERT to convert *T to a broken down time in *TP.
163 If *T is out of range for conversion, adjust it so that
164 it is the nearest in-range value and then convert that. */
166 ranged_convert (convert
, t
, tp
)
168 struct tm
*(*convert
) (const time_t *, struct tm
*);
170 struct tm
*(*convert
)();
177 if (! (r
= (*convert
) (t
, tp
)) && *t
)
183 /* BAD is a known unconvertible time_t, and OK is a known good one.
184 Use binary search to narrow the range between BAD and OK until
186 while (bad
!= ok
+ (bad
< 0 ? -1 : 1))
188 time_t mid
= *t
= (bad
< 0
189 ? bad
+ ((ok
- bad
) >> 1)
190 : ok
+ ((bad
- ok
) >> 1));
191 if ((r
= (*convert
) (t
, tp
)))
202 /* The last conversion attempt failed;
203 revert to the most recent successful attempt. */
214 /* Convert *TP to a time_t value, inverting
215 the monotonic and mostly-unit-linear conversion function CONVERT.
216 Use *OFFSET to keep track of a guess at the offset of the result,
217 compared to what the result would be for UTC without leap seconds.
218 If *OFFSET's guess is correct, only one CONVERT call is needed. */
220 __mktime_internal (tp
, convert
, offset
)
223 struct tm
*(*convert
) (const time_t *, struct tm
*);
225 struct tm
*(*convert
)();
229 time_t t
, dt
, t0
, t1
, t2
;
232 /* The maximum number of probes (calls to CONVERT) should be enough
233 to handle any combinations of time zone rule changes, solar time,
234 leap seconds, and oscillations around a spring-forward gap.
235 POSIX.1 prohibits leap seconds, but some hosts have them anyway. */
236 int remaining_probes
= 6;
238 /* Time requested. Copy it in case CONVERT modifies *TP; this can
239 occur if TP is localtime's returned value and CONVERT is localtime. */
240 int sec
= tp
->tm_sec
;
241 int min
= tp
->tm_min
;
242 int hour
= tp
->tm_hour
;
243 int mday
= tp
->tm_mday
;
244 int mon
= tp
->tm_mon
;
245 int year_requested
= tp
->tm_year
;
246 int isdst
= tp
->tm_isdst
;
248 /* 1 if the previous probe was DST. */
251 /* Ensure that mon is in range, and set year accordingly. */
252 int mon_remainder
= mon
% 12;
253 int negative_mon_remainder
= mon_remainder
< 0;
254 int mon_years
= mon
/ 12 - negative_mon_remainder
;
255 int year
= year_requested
+ mon_years
;
257 /* The other values need not be in range:
258 the remaining code handles minor overflows correctly,
259 assuming int and time_t arithmetic wraps around.
260 Major overflows are caught at the end. */
262 /* Calculate day of year from year, month, and day of month.
263 The result need not be in range. */
264 int yday
= ((__mon_yday
[__isleap (year
+ TM_YEAR_BASE
)]
265 [mon_remainder
+ 12 * negative_mon_remainder
])
268 int sec_requested
= sec
;
270 /* Only years after 1970 are defined.
271 If year is 69, it might still be representable due to
272 timezone differences. */
276 #if LEAP_SECONDS_POSSIBLE
277 /* Handle out-of-range seconds specially,
278 since ydhms_tm_diff assumes every minute has 60 seconds. */
285 /* Invert CONVERT by probing. First assume the same offset as last time.
286 Then repeatedly use the error to improve the guess. */
288 tm
.tm_year
= EPOCH_YEAR
- TM_YEAR_BASE
;
289 tm
.tm_yday
= tm
.tm_hour
= tm
.tm_min
= tm
.tm_sec
= 0;
290 t0
= ydhms_tm_diff (year
, yday
, hour
, min
, sec
, &tm
);
292 for (t
= t1
= t2
= t0
+ *offset
, dst2
= 0;
293 (dt
= ydhms_tm_diff (year
, yday
, hour
, min
, sec
,
294 ranged_convert (convert
, &t
, &tm
)));
295 t1
= t2
, t2
= t
, t
+= dt
, dst2
= tm
.tm_isdst
!= 0)
296 if (t
== t1
&& t
!= t2
299 ? dst2
<= (tm
.tm_isdst
!= 0)
300 : (isdst
!= 0) != (tm
.tm_isdst
!= 0))))
301 /* We can't possibly find a match, as we are oscillating
302 between two values. The requested time probably falls
303 within a spring-forward gap of size DT. Follow the common
304 practice in this case, which is to return a time that is DT
305 away from the requested time, preferring a time whose
306 tm_isdst differs from the requested value. (If no tm_isdst
307 was requested and only one of the two values has a nonzero
308 tm_isdst, prefer that value.) In practice, this is more
309 useful than returning -1. */
311 else if (--remaining_probes
== 0)
314 /* If we have a match, check whether tm.tm_isdst has the requested
316 if (dt
== 0 && isdst
!= tm
.tm_isdst
&& 0 <= isdst
&& 0 <= tm
.tm_isdst
)
318 /* tm.tm_isdst has the wrong value. Look for a neighboring
319 time with the right value, and use its UTC offset.
320 Heuristic: probe the previous three calendar quarters (approximately),
321 looking for the desired isdst. This isn't perfect,
322 but it's good enough in practice. */
323 int quarter
= 7889238; /* seconds per average 1/4 Gregorian year */
326 /* If we're too close to the time_t limit, look in future quarters. */
327 if (t
< TIME_T_MIN
+ 3 * quarter
)
330 for (i
= 1; i
<= 3; i
++)
332 time_t ot
= t
- i
* quarter
;
334 ranged_convert (convert
, &ot
, &otm
);
335 if (otm
.tm_isdst
== isdst
)
337 /* We found the desired tm_isdst.
338 Extrapolate back to the desired time. */
339 t
= ot
+ ydhms_tm_diff (year
, yday
, hour
, min
, sec
, &otm
);
340 ranged_convert (convert
, &t
, &tm
);
348 #if LEAP_SECONDS_POSSIBLE
349 if (sec_requested
!= tm
.tm_sec
)
351 /* Adjust time to reflect the tm_sec requested, not the normalized value.
352 Also, repair any damage from a false match due to a leap second. */
353 t
+= sec_requested
- sec
+ (sec
== 0 && tm
.tm_sec
== 60);
354 if (! (*convert
) (&t
, &tm
))
359 if (TIME_T_MAX
/ INT_MAX
/ 366 / 24 / 60 / 60 < 3)
361 /* time_t isn't large enough to rule out overflows in ydhms_tm_diff,
362 so check for major overflows. A gross check suffices,
363 since if t has overflowed, it is off by a multiple of
364 TIME_T_MAX - TIME_T_MIN + 1. So ignore any component of
365 the difference that is bounded by a small value. */
367 double dyear
= (double) year_requested
+ mon_years
- tm
.tm_year
;
368 double dday
= 366 * dyear
+ mday
;
369 double dsec
= 60 * (60 * (24 * dday
+ hour
) + min
) + sec_requested
;
371 /* On Irix4.0.5 cc, dividing TIME_T_MIN by 3 does not produce
372 correct results, ie., it erroneously gives a positive value
373 of 715827882. Setting a variable first then doing math on it
374 seems to work. (ghazi@caip.rutgers.edu) */
376 const time_t time_t_max
= TIME_T_MAX
;
377 const time_t time_t_min
= TIME_T_MIN
;
379 if (time_t_max
/ 3 - time_t_min
/ 3 < (dsec
< 0 ? - dsec
: dsec
))
385 /* If year was 69, need to check whether the time was representable
387 if (t
< 0 || t
> 2 * 24 * 60 * 60)
396 static time_t localtime_offset
;
398 /* Convert *TP to a time_t value. */
404 /* POSIX.1 8.1.1 requires that whenever mktime() is called, the
405 time zone names contained in the external variable `tzname' shall
406 be set as if the tzset() function had been called. */
410 return __mktime_internal (tp
, my_mktime_localtime_r
, &localtime_offset
);
414 weak_alias (mktime
, timelocal
)
424 return ((a
->tm_sec
^ b
->tm_sec
)
425 | (a
->tm_min
^ b
->tm_min
)
426 | (a
->tm_hour
^ b
->tm_hour
)
427 | (a
->tm_mday
^ b
->tm_mday
)
428 | (a
->tm_mon
^ b
->tm_mon
)
429 | (a
->tm_year
^ b
->tm_year
)
430 | (a
->tm_mday
^ b
->tm_mday
)
431 | (a
->tm_yday
^ b
->tm_yday
)
432 | (a
->tm_isdst
^ b
->tm_isdst
));
440 printf ("%04d-%02d-%02d %02d:%02d:%02d yday %03d wday %d isdst %d",
441 tp
->tm_year
+ TM_YEAR_BASE
, tp
->tm_mon
+ 1, tp
->tm_mday
,
442 tp
->tm_hour
, tp
->tm_min
, tp
->tm_sec
,
443 tp
->tm_yday
, tp
->tm_wday
, tp
->tm_isdst
);
449 check_result (tk
, tmk
, tl
, lt
)
455 if (tk
!= tl
|| !lt
|| not_equal_tm (&tmk
, lt
))
459 printf (")\nyields (");
461 printf (") == %ld, should be %ld\n", (long) tl
, (long) tk
);
474 struct tm tm
, tmk
, tml
;
479 if ((argc
== 3 || argc
== 4)
480 && (sscanf (argv
[1], "%d-%d-%d%c",
481 &tm
.tm_year
, &tm
.tm_mon
, &tm
.tm_mday
, &trailer
)
483 && (sscanf (argv
[2], "%d:%d:%d%c",
484 &tm
.tm_hour
, &tm
.tm_min
, &tm
.tm_sec
, &trailer
)
487 tm
.tm_year
-= TM_YEAR_BASE
;
489 tm
.tm_isdst
= argc
== 3 ? -1 : atoi (argv
[3]);
492 lt
= localtime (&tl
);
498 printf ("mktime returns %ld == ", (long) tl
);
501 status
= check_result (tl
, tmk
, tl
, lt
);
503 else if (argc
== 4 || (argc
== 5 && strcmp (argv
[4], "-") == 0))
505 time_t from
= atol (argv
[1]);
506 time_t by
= atol (argv
[2]);
507 time_t to
= atol (argv
[3]);
510 for (tl
= from
; tl
<= to
; tl
+= by
)
512 lt
= localtime (&tl
);
517 status
|= check_result (tk
, tmk
, tl
, tml
);
521 printf ("localtime (%ld) yields 0\n", (long) tl
);
526 for (tl
= from
; tl
<= to
; tl
+= by
)
528 /* Null benchmark. */
529 lt
= localtime (&tl
);
534 status
|= check_result (tk
, tmk
, tl
, tml
);
538 printf ("localtime (%ld) yields 0\n", (long) tl
);
545 \t%s YYYY-MM-DD HH:MM:SS [ISDST] # Test given time.\n\
546 \t%s FROM BY TO # Test values FROM, FROM+BY, ..., TO.\n\
547 \t%s FROM BY TO - # Do not test those values (for benchmark).\n",
548 argv
[0], argv
[0], argv
[0]);
557 compile-command: "gcc -DDEBUG -DHAVE_LIMITS_H -DSTDC_HEADERS -Wall -W -O -g mktime.c -o mktime"
561 /* arch-tag: 9456752f-7ddd-47cb-8286-fa807b1355ae
562 (do not change this comment) */