1 /* Convert a `struct tm' to a time_t value.
2 Copyright (C) 1993-1999, 2002, 2003, 2004 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Contributed by Paul Eggert (eggert@twinsun.com).
6 The GNU C Library is free software; you can redistribute it and/or
7 modify it under the terms of the GNU Lesser General Public
8 License as published by the Free Software Foundation; either
9 version 2.1 of the License, or (at your option) any later version.
11 The GNU C Library is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public
17 License along with the GNU C Library; if not, write to the Free
18 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
21 /* Define this to have a standalone program to test this implementation of
29 /* Assume that leap seconds are possible, unless told otherwise.
30 If the host has a `zic' command with a `-L leapsecondfilename' option,
31 then it supports leap seconds; otherwise it probably doesn't. */
32 #ifndef LEAP_SECONDS_POSSIBLE
33 # define LEAP_SECONDS_POSSIBLE 1
36 #include <sys/types.h> /* Some systems define `time_t' here. */
40 #include <string.h> /* For string function builtin redirect. */
45 /* Make it work even if the system's libc has its own mktime routine. */
46 # define mktime my_mktime
49 /* The extra casts work around common compiler bugs. */
50 #define TYPE_SIGNED(t) (! ((t) 0 < (t) -1))
51 /* The outer cast is needed to work around a bug in Cray C 5.0.3.0.
52 It is necessary at least when t == time_t. */
53 #define TYPE_MINIMUM(t) ((t) (TYPE_SIGNED (t) \
54 ? ~ (t) 0 << (sizeof (t) * CHAR_BIT - 1) : (t) 0))
55 #define TYPE_MAXIMUM(t) ((t) (~ (t) 0 - TYPE_MINIMUM (t)))
58 # define TIME_T_MIN TYPE_MINIMUM (time_t)
61 # define TIME_T_MAX TYPE_MAXIMUM (time_t)
64 /* Verify a requirement at compile-time (unlike assert, which is runtime). */
65 #define verify(name, assertion) struct name { char a[(assertion) ? 1 : -1]; }
67 verify (time_t_is_integer
, (time_t) 0.5 == 0);
68 verify (twos_complement_arithmetic
, -1 == ~1 + 1);
69 verify (right_shift_propagates_sign
, -1 >> 1 == -1);
70 /* The code also assumes that signed integer overflow silently wraps
71 around, but this assumption can't be stated without causing a
72 diagnostic on some hosts. */
74 #define EPOCH_YEAR 1970
75 #define TM_YEAR_BASE 1900
76 verify (base_year_is_a_multiple_of_100
, TM_YEAR_BASE
% 100 == 0);
79 /* Nonzero if YEAR is a leap year (every 4 years,
80 except every 100th isn't, and every 400th is). */
81 # define __isleap(year) \
82 ((year) % 4 == 0 && ((year) % 100 != 0 || (year) % 400 == 0))
85 /* How many days come before each month (0-12). */
89 const unsigned short int __mon_yday
[2][13] =
92 { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365 },
94 { 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, 366 }
99 /* Portable standalone applications should supply a "time_r.h" that
100 declares a POSIX-compliant localtime_r, for the benefit of older
101 implementations that lack localtime_r or have a nonstandard one.
102 See the gnulib time_r module for one way to implement this. */
104 # undef __localtime_r
105 # define __localtime_r localtime_r
109 /* Yield the difference between (YEAR-YDAY HOUR:MIN:SEC) and (*TP),
110 measured in seconds, ignoring leap seconds.
111 YEAR uses the same numbering as TM->tm_year.
112 All values are in range, except possibly YEAR.
113 If TP is null, return a nonzero value.
114 If overflow occurs, yield the low order bits of the correct answer. */
116 ydhms_tm_diff (int year
, int yday
, int hour
, int min
, int sec
,
123 verify (C99_integer_division
, -1 / 2 == 0);
125 /* Compute intervening leap days correctly even if year is negative.
126 Take care to avoid int overflow. time_t overflow is OK, since
127 only the low order bits of the correct time_t answer are needed.
128 Don't convert to time_t until after all divisions are done, since
129 time_t might be unsigned. */
130 int a4
= (year
>> 2) + (TM_YEAR_BASE
>> 2) - ! (year
& 3);
131 int b4
= (tp
->tm_year
>> 2) + (TM_YEAR_BASE
>> 2) - ! (tp
->tm_year
& 3);
132 int a100
= a4
/ 25 - (a4
% 25 < 0);
133 int b100
= b4
/ 25 - (b4
% 25 < 0);
134 int a400
= a100
>> 2;
135 int b400
= b100
>> 2;
136 int intervening_leap_days
= (a4
- b4
) - (a100
- b100
) + (a400
- b400
);
137 time_t years
= year
- (time_t) tp
->tm_year
;
138 time_t days
= (365 * years
+ intervening_leap_days
139 + (yday
- tp
->tm_yday
));
140 return (60 * (60 * (24 * days
+ (hour
- tp
->tm_hour
))
141 + (min
- tp
->tm_min
))
142 + (sec
- tp
->tm_sec
));
146 /* Use CONVERT to convert *T to a broken down time in *TP.
147 If *T is out of range for conversion, adjust it so that
148 it is the nearest in-range value and then convert that. */
150 ranged_convert (struct tm
*(*convert
) (const time_t *, struct tm
*),
151 time_t *t
, struct tm
*tp
)
155 if (! (r
= (*convert
) (t
, tp
)) && *t
)
161 /* BAD is a known unconvertible time_t, and OK is a known good one.
162 Use binary search to narrow the range between BAD and OK until
164 while (bad
!= ok
+ (bad
< 0 ? -1 : 1))
166 time_t mid
= *t
= (bad
< 0
167 ? bad
+ ((ok
- bad
) >> 1)
168 : ok
+ ((bad
- ok
) >> 1));
169 if ((r
= (*convert
) (t
, tp
)))
180 /* The last conversion attempt failed;
181 revert to the most recent successful attempt. */
192 /* Convert *TP to a time_t value, inverting
193 the monotonic and mostly-unit-linear conversion function CONVERT.
194 Use *OFFSET to keep track of a guess at the offset of the result,
195 compared to what the result would be for UTC without leap seconds.
196 If *OFFSET's guess is correct, only one CONVERT call is needed. */
198 __mktime_internal (struct tm
*tp
,
199 struct tm
*(*convert
) (const time_t *, struct tm
*),
202 time_t t
, dt
, t0
, t1
, t2
;
205 /* The maximum number of probes (calls to CONVERT) should be enough
206 to handle any combinations of time zone rule changes, solar time,
207 leap seconds, and oscillations around a spring-forward gap.
208 POSIX.1 prohibits leap seconds, but some hosts have them anyway. */
209 int remaining_probes
= 6;
211 /* Time requested. Copy it in case CONVERT modifies *TP; this can
212 occur if TP is localtime's returned value and CONVERT is localtime. */
213 int sec
= tp
->tm_sec
;
214 int min
= tp
->tm_min
;
215 int hour
= tp
->tm_hour
;
216 int mday
= tp
->tm_mday
;
217 int mon
= tp
->tm_mon
;
218 int year_requested
= tp
->tm_year
;
219 int isdst
= tp
->tm_isdst
;
221 /* 1 if the previous probe was DST. */
224 /* Ensure that mon is in range, and set year accordingly. */
225 int mon_remainder
= mon
% 12;
226 int negative_mon_remainder
= mon_remainder
< 0;
227 int mon_years
= mon
/ 12 - negative_mon_remainder
;
228 int year
= year_requested
+ mon_years
;
230 /* The other values need not be in range:
231 the remaining code handles minor overflows correctly,
232 assuming int and time_t arithmetic wraps around.
233 Major overflows are caught at the end. */
235 /* Calculate day of year from year, month, and day of month.
236 The result need not be in range. */
237 int yday
= ((__mon_yday
[__isleap (year
+ TM_YEAR_BASE
)]
238 [mon_remainder
+ 12 * negative_mon_remainder
])
241 int sec_requested
= sec
;
243 /* Only years after 1970 are defined.
244 If year is 69, it might still be representable due to
245 timezone differences. */
249 #if LEAP_SECONDS_POSSIBLE
250 /* Handle out-of-range seconds specially,
251 since ydhms_tm_diff assumes every minute has 60 seconds. */
258 /* Invert CONVERT by probing. First assume the same offset as last time.
259 Then repeatedly use the error to improve the guess. */
261 tm
.tm_year
= EPOCH_YEAR
- TM_YEAR_BASE
;
262 tm
.tm_yday
= tm
.tm_hour
= tm
.tm_min
= tm
.tm_sec
= 0;
263 t0
= ydhms_tm_diff (year
, yday
, hour
, min
, sec
, &tm
);
265 for (t
= t1
= t2
= t0
+ *offset
, dst2
= 0;
266 (dt
= ydhms_tm_diff (year
, yday
, hour
, min
, sec
,
267 ranged_convert (convert
, &t
, &tm
)));
268 t1
= t2
, t2
= t
, t
+= dt
, dst2
= tm
.tm_isdst
!= 0)
269 if (t
== t1
&& t
!= t2
272 ? dst2
<= (tm
.tm_isdst
!= 0)
273 : (isdst
!= 0) != (tm
.tm_isdst
!= 0))))
274 /* We can't possibly find a match, as we are oscillating
275 between two values. The requested time probably falls
276 within a spring-forward gap of size DT. Follow the common
277 practice in this case, which is to return a time that is DT
278 away from the requested time, preferring a time whose
279 tm_isdst differs from the requested value. (If no tm_isdst
280 was requested and only one of the two values has a nonzero
281 tm_isdst, prefer that value.) In practice, this is more
282 useful than returning -1. */
284 else if (--remaining_probes
== 0)
287 /* If we have a match, check whether tm.tm_isdst has the requested
289 if (dt
== 0 && isdst
!= tm
.tm_isdst
&& 0 <= isdst
&& 0 <= tm
.tm_isdst
)
291 /* tm.tm_isdst has the wrong value. Look for a neighboring
292 time with the right value, and use its UTC offset.
293 Heuristic: probe the previous three calendar quarters (approximately),
294 looking for the desired isdst. This isn't perfect,
295 but it's good enough in practice. */
296 int quarter
= 7889238; /* seconds per average 1/4 Gregorian year */
299 /* If we're too close to the time_t limit, look in future quarters. */
300 if (t
< TIME_T_MIN
+ 3 * quarter
)
303 for (i
= 1; i
<= 3; i
++)
305 time_t ot
= t
- i
* quarter
;
307 ranged_convert (convert
, &ot
, &otm
);
308 if (otm
.tm_isdst
== isdst
)
310 /* We found the desired tm_isdst.
311 Extrapolate back to the desired time. */
312 t
= ot
+ ydhms_tm_diff (year
, yday
, hour
, min
, sec
, &otm
);
313 ranged_convert (convert
, &t
, &tm
);
321 #if LEAP_SECONDS_POSSIBLE
322 if (sec_requested
!= tm
.tm_sec
)
324 /* Adjust time to reflect the tm_sec requested, not the normalized value.
325 Also, repair any damage from a false match due to a leap second. */
326 t
+= sec_requested
- sec
+ (sec
== 0 && tm
.tm_sec
== 60);
327 if (! (*convert
) (&t
, &tm
))
332 if (TIME_T_MAX
/ INT_MAX
/ 366 / 24 / 60 / 60 < 3)
334 /* time_t isn't large enough to rule out overflows in ydhms_tm_diff,
335 so check for major overflows. A gross check suffices,
336 since if t has overflowed, it is off by a multiple of
337 TIME_T_MAX - TIME_T_MIN + 1. So ignore any component of
338 the difference that is bounded by a small value. */
340 double dyear
= (double) year_requested
+ mon_years
- tm
.tm_year
;
341 double dday
= 366 * dyear
+ mday
;
342 double dsec
= 60 * (60 * (24 * dday
+ hour
) + min
) + sec_requested
;
344 /* On Irix4.0.5 cc, dividing TIME_T_MIN by 3 does not produce
345 correct results, ie., it erroneously gives a positive value
346 of 715827882. Setting a variable first then doing math on it
347 seems to work. (ghazi@caip.rutgers.edu) */
349 const time_t time_t_max
= TIME_T_MAX
;
350 const time_t time_t_min
= TIME_T_MIN
;
352 if (time_t_max
/ 3 - time_t_min
/ 3 < (dsec
< 0 ? - dsec
: dsec
))
358 /* If year was 69, need to check whether the time was representable
360 if (t
< 0 || t
> 2 * 24 * 60 * 60)
369 static time_t localtime_offset
;
371 /* Convert *TP to a time_t value. */
373 mktime (struct tm
*tp
)
376 /* POSIX.1 8.1.1 requires that whenever mktime() is called, the
377 time zone names contained in the external variable `tzname' shall
378 be set as if the tzset() function had been called. */
382 return __mktime_internal (tp
, __localtime_r
, &localtime_offset
);
386 weak_alias (mktime
, timelocal
)
390 libc_hidden_def (mktime
)
391 libc_hidden_weak (timelocal
)
397 not_equal_tm (const struct tm
*a
, const struct tm
*b
)
399 return ((a
->tm_sec
^ b
->tm_sec
)
400 | (a
->tm_min
^ b
->tm_min
)
401 | (a
->tm_hour
^ b
->tm_hour
)
402 | (a
->tm_mday
^ b
->tm_mday
)
403 | (a
->tm_mon
^ b
->tm_mon
)
404 | (a
->tm_year
^ b
->tm_year
)
405 | (a
->tm_mday
^ b
->tm_mday
)
406 | (a
->tm_yday
^ b
->tm_yday
)
407 | (a
->tm_isdst
^ b
->tm_isdst
));
411 print_tm (const struct tm
*tp
)
414 printf ("%04d-%02d-%02d %02d:%02d:%02d yday %03d wday %d isdst %d",
415 tp
->tm_year
+ TM_YEAR_BASE
, tp
->tm_mon
+ 1, tp
->tm_mday
,
416 tp
->tm_hour
, tp
->tm_min
, tp
->tm_sec
,
417 tp
->tm_yday
, tp
->tm_wday
, tp
->tm_isdst
);
423 check_result (time_t tk
, struct tm tmk
, time_t tl
, const struct tm
*lt
)
425 if (tk
!= tl
|| !lt
|| not_equal_tm (&tmk
, lt
))
429 printf (")\nyields (");
431 printf (") == %ld, should be %ld\n", (long int) tk
, (long int) tl
);
439 main (int argc
, char **argv
)
442 struct tm tm
, tmk
, tml
;
447 if ((argc
== 3 || argc
== 4)
448 && (sscanf (argv
[1], "%d-%d-%d%c",
449 &tm
.tm_year
, &tm
.tm_mon
, &tm
.tm_mday
, &trailer
)
451 && (sscanf (argv
[2], "%d:%d:%d%c",
452 &tm
.tm_hour
, &tm
.tm_min
, &tm
.tm_sec
, &trailer
)
455 tm
.tm_year
-= TM_YEAR_BASE
;
457 tm
.tm_isdst
= argc
== 3 ? -1 : atoi (argv
[3]);
460 lt
= localtime (&tl
);
466 printf ("mktime returns %ld == ", (long int) tl
);
469 status
= check_result (tl
, tmk
, tl
, lt
);
471 else if (argc
== 4 || (argc
== 5 && strcmp (argv
[4], "-") == 0))
473 time_t from
= atol (argv
[1]);
474 time_t by
= atol (argv
[2]);
475 time_t to
= atol (argv
[3]);
478 for (tl
= from
; by
< 0 ? to
<= tl
: tl
<= to
; tl
= tl1
)
480 lt
= localtime (&tl
);
485 status
|= check_result (tk
, tmk
, tl
, &tml
);
489 printf ("localtime (%ld) yields 0\n", (long int) tl
);
493 if ((tl1
< tl
) != (by
< 0))
497 for (tl
= from
; by
< 0 ? to
<= tl
: tl
<= to
; tl
= tl1
)
499 /* Null benchmark. */
500 lt
= localtime (&tl
);
505 status
|= check_result (tk
, tmk
, tl
, &tml
);
509 printf ("localtime (%ld) yields 0\n", (long int) tl
);
513 if ((tl1
< tl
) != (by
< 0))
519 \t%s YYYY-MM-DD HH:MM:SS [ISDST] # Test given time.\n\
520 \t%s FROM BY TO # Test values FROM, FROM+BY, ..., TO.\n\
521 \t%s FROM BY TO - # Do not test those values (for benchmark).\n",
522 argv
[0], argv
[0], argv
[0]);
531 compile-command: "gcc -DDEBUG -DHAVE_TIME_R_POSIX -Wall -W -O -g mktime.c -o mktime"