localtime.c revision 1.18 1 1.18 kleink /* $NetBSD: localtime.c,v 1.18 1998/09/10 15:58:39 kleink Exp $ */
2 1.7 jtc
3 1.7 jtc /*
4 1.7 jtc ** This file is in the public domain, so clarified as of
5 1.10 jtc ** 1996-06-05 by Arthur David Olson (arthur_david_olson (at) nih.gov).
6 1.7 jtc */
7 1.2 jtc
8 1.11 christos #include <sys/cdefs.h>
9 1.1 jtc #ifndef lint
10 1.1 jtc #ifndef NOID
11 1.11 christos #if 0
12 1.18 kleink static char elsieid[] = "@(#)localtime.c 7.66";
13 1.11 christos #else
14 1.18 kleink __RCSID("$NetBSD: localtime.c,v 1.18 1998/09/10 15:58:39 kleink Exp $");
15 1.11 christos #endif
16 1.1 jtc #endif /* !defined NOID */
17 1.1 jtc #endif /* !defined lint */
18 1.1 jtc
19 1.1 jtc /*
20 1.1 jtc ** Leap second handling from Bradley White (bww (at) k.gp.cs.cmu.edu).
21 1.1 jtc ** POSIX-style TZ environment variable handling from Guy Harris
22 1.1 jtc ** (guy (at) auspex.com).
23 1.1 jtc */
24 1.1 jtc
25 1.1 jtc /*LINTLIBRARY*/
26 1.1 jtc
27 1.12 jtc #include "namespace.h"
28 1.1 jtc #include "private.h"
29 1.1 jtc #include "tzfile.h"
30 1.1 jtc #include "fcntl.h"
31 1.12 jtc
32 1.12 jtc #ifdef __weak_alias
33 1.18 kleink __weak_alias(ctime_r,_ctime_r);
34 1.18 kleink __weak_alias(gmtime_r,_gmtime_r);
35 1.18 kleink __weak_alias(localtime_r,_localtime_r);
36 1.12 jtc __weak_alias(offtime,_offtime);
37 1.12 jtc __weak_alias(posix2time,_posix2time);
38 1.12 jtc __weak_alias(time2posix,_time2posix);
39 1.12 jtc __weak_alias(timegm,_timegm);
40 1.12 jtc __weak_alias(timelocal,_timelocal);
41 1.12 jtc __weak_alias(timeoff,_timeoff);
42 1.12 jtc __weak_alias(tzset,_tzset);
43 1.12 jtc __weak_alias(tzsetwall,_tzsetwall);
44 1.12 jtc #endif
45 1.1 jtc
46 1.1 jtc /*
47 1.1 jtc ** SunOS 4.1.1 headers lack O_BINARY.
48 1.1 jtc */
49 1.1 jtc
50 1.1 jtc #ifdef O_BINARY
51 1.1 jtc #define OPEN_MODE (O_RDONLY | O_BINARY)
52 1.1 jtc #endif /* defined O_BINARY */
53 1.1 jtc #ifndef O_BINARY
54 1.1 jtc #define OPEN_MODE O_RDONLY
55 1.1 jtc #endif /* !defined O_BINARY */
56 1.1 jtc
57 1.1 jtc #ifndef WILDABBR
58 1.1 jtc /*
59 1.1 jtc ** Someone might make incorrect use of a time zone abbreviation:
60 1.1 jtc ** 1. They might reference tzname[0] before calling tzset (explicitly
61 1.1 jtc ** or implicitly).
62 1.1 jtc ** 2. They might reference tzname[1] before calling tzset (explicitly
63 1.1 jtc ** or implicitly).
64 1.1 jtc ** 3. They might reference tzname[1] after setting to a time zone
65 1.1 jtc ** in which Daylight Saving Time is never observed.
66 1.1 jtc ** 4. They might reference tzname[0] after setting to a time zone
67 1.1 jtc ** in which Standard Time is never observed.
68 1.1 jtc ** 5. They might reference tm.TM_ZONE after calling offtime.
69 1.1 jtc ** What's best to do in the above cases is open to debate;
70 1.1 jtc ** for now, we just set things up so that in any of the five cases
71 1.1 jtc ** WILDABBR is used. Another possibility: initialize tzname[0] to the
72 1.1 jtc ** string "tzname[0] used before set", and similarly for the other cases.
73 1.1 jtc ** And another: initialize tzname[0] to "ERA", with an explanation in the
74 1.1 jtc ** manual page of what this "time zone abbreviation" means (doing this so
75 1.1 jtc ** that tzname[0] has the "normal" length of three characters).
76 1.1 jtc */
77 1.1 jtc #define WILDABBR " "
78 1.1 jtc #endif /* !defined WILDABBR */
79 1.1 jtc
80 1.15 mycroft static const char wildabbr[] = "WILDABBR";
81 1.1 jtc
82 1.1 jtc static const char gmt[] = "GMT";
83 1.1 jtc
84 1.1 jtc struct ttinfo { /* time type information */
85 1.14 jtc long tt_gmtoff; /* UTC offset in seconds */
86 1.1 jtc int tt_isdst; /* used to set tm_isdst */
87 1.1 jtc int tt_abbrind; /* abbreviation list index */
88 1.1 jtc int tt_ttisstd; /* TRUE if transition is std time */
89 1.14 jtc int tt_ttisgmt; /* TRUE if transition is UTC */
90 1.1 jtc };
91 1.1 jtc
92 1.1 jtc struct lsinfo { /* leap second information */
93 1.1 jtc time_t ls_trans; /* transition time */
94 1.1 jtc long ls_corr; /* correction to apply */
95 1.1 jtc };
96 1.1 jtc
97 1.1 jtc #define BIGGEST(a, b) (((a) > (b)) ? (a) : (b))
98 1.1 jtc
99 1.1 jtc #ifdef TZNAME_MAX
100 1.1 jtc #define MY_TZNAME_MAX TZNAME_MAX
101 1.1 jtc #endif /* defined TZNAME_MAX */
102 1.1 jtc #ifndef TZNAME_MAX
103 1.1 jtc #define MY_TZNAME_MAX 255
104 1.1 jtc #endif /* !defined TZNAME_MAX */
105 1.1 jtc
106 1.1 jtc struct state {
107 1.1 jtc int leapcnt;
108 1.1 jtc int timecnt;
109 1.1 jtc int typecnt;
110 1.1 jtc int charcnt;
111 1.1 jtc time_t ats[TZ_MAX_TIMES];
112 1.1 jtc unsigned char types[TZ_MAX_TIMES];
113 1.1 jtc struct ttinfo ttis[TZ_MAX_TYPES];
114 1.1 jtc char chars[BIGGEST(BIGGEST(TZ_MAX_CHARS + 1, sizeof gmt),
115 1.1 jtc (2 * (MY_TZNAME_MAX + 1)))];
116 1.1 jtc struct lsinfo lsis[TZ_MAX_LEAPS];
117 1.1 jtc };
118 1.1 jtc
119 1.1 jtc struct rule {
120 1.1 jtc int r_type; /* type of rule--see below */
121 1.1 jtc int r_day; /* day number of rule */
122 1.1 jtc int r_week; /* week number of rule */
123 1.1 jtc int r_mon; /* month number of rule */
124 1.1 jtc long r_time; /* transition time of rule */
125 1.1 jtc };
126 1.1 jtc
127 1.1 jtc #define JULIAN_DAY 0 /* Jn - Julian day */
128 1.1 jtc #define DAY_OF_YEAR 1 /* n - day of year */
129 1.1 jtc #define MONTH_NTH_DAY_OF_WEEK 2 /* Mm.n.d - month, week, day of week */
130 1.1 jtc
131 1.1 jtc /*
132 1.1 jtc ** Prototypes for static functions.
133 1.1 jtc */
134 1.1 jtc
135 1.1 jtc static long detzcode P((const char * codep));
136 1.1 jtc static const char * getzname P((const char * strp));
137 1.1 jtc static const char * getnum P((const char * strp, int * nump, int min,
138 1.1 jtc int max));
139 1.1 jtc static const char * getsecs P((const char * strp, long * secsp));
140 1.1 jtc static const char * getoffset P((const char * strp, long * offsetp));
141 1.1 jtc static const char * getrule P((const char * strp, struct rule * rulep));
142 1.1 jtc static void gmtload P((struct state * sp));
143 1.1 jtc static void gmtsub P((const time_t * timep, long offset,
144 1.1 jtc struct tm * tmp));
145 1.1 jtc static void localsub P((const time_t * timep, long offset,
146 1.1 jtc struct tm * tmp));
147 1.1 jtc static int increment_overflow P((int * number, int delta));
148 1.1 jtc static int normalize_overflow P((int * tensptr, int * unitsptr,
149 1.1 jtc int base));
150 1.1 jtc static void settzname P((void));
151 1.1 jtc static time_t time1 P((struct tm * tmp,
152 1.1 jtc void(*funcp) P((const time_t *,
153 1.1 jtc long, struct tm *)),
154 1.1 jtc long offset));
155 1.1 jtc static time_t time2 P((struct tm *tmp,
156 1.1 jtc void(*funcp) P((const time_t *,
157 1.1 jtc long, struct tm*)),
158 1.1 jtc long offset, int * okayp));
159 1.13 jtc static time_t time2sub P((struct tm *tmp,
160 1.13 jtc void(*funcp) P((const time_t *,
161 1.13 jtc long, struct tm*)),
162 1.13 jtc long offset, int * okayp, int do_norm_secs));
163 1.1 jtc static void timesub P((const time_t * timep, long offset,
164 1.1 jtc const struct state * sp, struct tm * tmp));
165 1.1 jtc static int tmcomp P((const struct tm * atmp,
166 1.1 jtc const struct tm * btmp));
167 1.1 jtc static time_t transtime P((time_t janfirst, int year,
168 1.1 jtc const struct rule * rulep, long offset));
169 1.1 jtc static int tzload P((const char * name, struct state * sp));
170 1.1 jtc static int tzparse P((const char * name, struct state * sp,
171 1.1 jtc int lastditch));
172 1.11 christos #ifdef STD_INSPIRED
173 1.11 christos static long leapcorr P((time_t * timep));
174 1.11 christos #endif
175 1.1 jtc
176 1.1 jtc #ifdef ALL_STATE
177 1.1 jtc static struct state * lclptr;
178 1.1 jtc static struct state * gmtptr;
179 1.1 jtc #endif /* defined ALL_STATE */
180 1.1 jtc
181 1.1 jtc #ifndef ALL_STATE
182 1.1 jtc static struct state lclmem;
183 1.1 jtc static struct state gmtmem;
184 1.1 jtc #define lclptr (&lclmem)
185 1.1 jtc #define gmtptr (&gmtmem)
186 1.1 jtc #endif /* State Farm */
187 1.1 jtc
188 1.1 jtc #ifndef TZ_STRLEN_MAX
189 1.1 jtc #define TZ_STRLEN_MAX 255
190 1.1 jtc #endif /* !defined TZ_STRLEN_MAX */
191 1.1 jtc
192 1.1 jtc static char lcl_TZname[TZ_STRLEN_MAX + 1];
193 1.1 jtc static int lcl_is_set;
194 1.1 jtc static int gmt_is_set;
195 1.1 jtc
196 1.16 mycroft __aconst char * tzname[2] = {
197 1.16 mycroft (__aconst char *)wildabbr,
198 1.16 mycroft (__aconst char *)wildabbr
199 1.1 jtc };
200 1.1 jtc
201 1.1 jtc /*
202 1.1 jtc ** Section 4.12.3 of X3.159-1989 requires that
203 1.1 jtc ** Except for the strftime function, these functions [asctime,
204 1.1 jtc ** ctime, gmtime, localtime] return values in one of two static
205 1.1 jtc ** objects: a broken-down time structure and an array of char.
206 1.1 jtc ** Thanks to Paul Eggert (eggert (at) twinsun.com) for noting this.
207 1.1 jtc */
208 1.1 jtc
209 1.1 jtc static struct tm tm;
210 1.1 jtc
211 1.1 jtc #ifdef USG_COMPAT
212 1.1 jtc time_t timezone = 0;
213 1.1 jtc int daylight = 0;
214 1.1 jtc #endif /* defined USG_COMPAT */
215 1.1 jtc
216 1.1 jtc #ifdef ALTZONE
217 1.1 jtc time_t altzone = 0;
218 1.1 jtc #endif /* defined ALTZONE */
219 1.1 jtc
220 1.1 jtc static long
221 1.1 jtc detzcode(codep)
222 1.1 jtc const char * const codep;
223 1.1 jtc {
224 1.1 jtc register long result;
225 1.1 jtc
226 1.4 jtc /*
227 1.4 jtc ** The first character must be sign extended on systems with >32bit
228 1.4 jtc ** longs. This was solved differently in the master tzcode sources
229 1.4 jtc ** (the fix first appeared in tzcode95c.tar.gz). But I believe
230 1.4 jtc ** that this implementation is superior.
231 1.4 jtc */
232 1.4 jtc
233 1.4 jtc #ifdef __STDC__
234 1.4 jtc #define SIGN_EXTEND_CHAR(x) ((signed char) x)
235 1.4 jtc #else
236 1.4 jtc #define SIGN_EXTEND_CHAR(x) ((x & 0x80) ? ((~0 << 8) | x) : x)
237 1.4 jtc #endif
238 1.4 jtc
239 1.4 jtc result = (SIGN_EXTEND_CHAR(codep[0]) << 24) \
240 1.3 jtc | (codep[1] & 0xff) << 16 \
241 1.3 jtc | (codep[2] & 0xff) << 8
242 1.3 jtc | (codep[3] & 0xff);
243 1.1 jtc return result;
244 1.1 jtc }
245 1.1 jtc
246 1.1 jtc static void
247 1.1 jtc settzname P((void))
248 1.1 jtc {
249 1.5 jtc register struct state * const sp = lclptr;
250 1.5 jtc register int i;
251 1.1 jtc
252 1.16 mycroft tzname[0] = (__aconst char *)wildabbr;
253 1.16 mycroft tzname[1] = (__aconst char *)wildabbr;
254 1.1 jtc #ifdef USG_COMPAT
255 1.1 jtc daylight = 0;
256 1.1 jtc timezone = 0;
257 1.1 jtc #endif /* defined USG_COMPAT */
258 1.1 jtc #ifdef ALTZONE
259 1.1 jtc altzone = 0;
260 1.1 jtc #endif /* defined ALTZONE */
261 1.1 jtc #ifdef ALL_STATE
262 1.1 jtc if (sp == NULL) {
263 1.17 mycroft tzname[0] = tzname[1] = (__aconst char *)gmt;
264 1.1 jtc return;
265 1.1 jtc }
266 1.1 jtc #endif /* defined ALL_STATE */
267 1.1 jtc for (i = 0; i < sp->typecnt; ++i) {
268 1.1 jtc register const struct ttinfo * const ttisp = &sp->ttis[i];
269 1.1 jtc
270 1.1 jtc tzname[ttisp->tt_isdst] =
271 1.1 jtc &sp->chars[ttisp->tt_abbrind];
272 1.1 jtc #ifdef USG_COMPAT
273 1.1 jtc if (ttisp->tt_isdst)
274 1.1 jtc daylight = 1;
275 1.1 jtc if (i == 0 || !ttisp->tt_isdst)
276 1.1 jtc timezone = -(ttisp->tt_gmtoff);
277 1.1 jtc #endif /* defined USG_COMPAT */
278 1.1 jtc #ifdef ALTZONE
279 1.1 jtc if (i == 0 || ttisp->tt_isdst)
280 1.1 jtc altzone = -(ttisp->tt_gmtoff);
281 1.1 jtc #endif /* defined ALTZONE */
282 1.1 jtc }
283 1.1 jtc /*
284 1.1 jtc ** And to get the latest zone names into tzname. . .
285 1.1 jtc */
286 1.1 jtc for (i = 0; i < sp->timecnt; ++i) {
287 1.1 jtc register const struct ttinfo * const ttisp =
288 1.1 jtc &sp->ttis[
289 1.1 jtc sp->types[i]];
290 1.1 jtc
291 1.1 jtc tzname[ttisp->tt_isdst] =
292 1.1 jtc &sp->chars[ttisp->tt_abbrind];
293 1.1 jtc }
294 1.1 jtc }
295 1.1 jtc
296 1.1 jtc static int
297 1.1 jtc tzload(name, sp)
298 1.1 jtc register const char * name;
299 1.1 jtc register struct state * const sp;
300 1.1 jtc {
301 1.1 jtc register const char * p;
302 1.1 jtc register int i;
303 1.1 jtc register int fid;
304 1.1 jtc
305 1.1 jtc if (name == NULL && (name = TZDEFAULT) == NULL)
306 1.1 jtc return -1;
307 1.9 mrg
308 1.1 jtc {
309 1.1 jtc register int doaccess;
310 1.1 jtc /*
311 1.1 jtc ** Section 4.9.1 of the C standard says that
312 1.1 jtc ** "FILENAME_MAX expands to an integral constant expression
313 1.10 jtc ** that is the size needed for an array of char large enough
314 1.1 jtc ** to hold the longest file name string that the implementation
315 1.1 jtc ** guarantees can be opened."
316 1.1 jtc */
317 1.1 jtc char fullname[FILENAME_MAX + 1];
318 1.1 jtc
319 1.1 jtc if (name[0] == ':')
320 1.1 jtc ++name;
321 1.1 jtc doaccess = name[0] == '/';
322 1.1 jtc if (!doaccess) {
323 1.1 jtc if ((p = TZDIR) == NULL)
324 1.1 jtc return -1;
325 1.1 jtc if ((strlen(p) + strlen(name) + 1) >= sizeof fullname)
326 1.1 jtc return -1;
327 1.8 mrg (void) strcpy(fullname, p); /* XXX strcpy is safe */
328 1.8 mrg (void) strcat(fullname, "/"); /* XXX strcat is safe */
329 1.8 mrg (void) strcat(fullname, name); /* XXX strcat is safe */
330 1.1 jtc /*
331 1.1 jtc ** Set doaccess if '.' (as in "../") shows up in name.
332 1.1 jtc */
333 1.1 jtc if (strchr(name, '.') != NULL)
334 1.1 jtc doaccess = TRUE;
335 1.1 jtc name = fullname;
336 1.1 jtc }
337 1.1 jtc if (doaccess && access(name, R_OK) != 0)
338 1.1 jtc return -1;
339 1.9 mrg /*
340 1.9 mrg * XXX potential security problem here if user of a set-id
341 1.9 mrg * program has set TZ (which is passed in as name) here,
342 1.9 mrg * and uses a race condition trick to defeat the access(2)
343 1.9 mrg * above.
344 1.9 mrg */
345 1.1 jtc if ((fid = open(name, OPEN_MODE)) == -1)
346 1.1 jtc return -1;
347 1.1 jtc }
348 1.1 jtc {
349 1.1 jtc struct tzhead * tzhp;
350 1.14 jtc union {
351 1.14 jtc struct tzhead tzhead;
352 1.14 jtc char buf[sizeof *sp + sizeof *tzhp];
353 1.14 jtc } u;
354 1.1 jtc int ttisstdcnt;
355 1.1 jtc int ttisgmtcnt;
356 1.1 jtc
357 1.14 jtc i = read(fid, u.buf, sizeof u.buf);
358 1.1 jtc if (close(fid) != 0)
359 1.1 jtc return -1;
360 1.14 jtc ttisstdcnt = (int) detzcode(u.tzhead.tzh_ttisgmtcnt);
361 1.14 jtc ttisgmtcnt = (int) detzcode(u.tzhead.tzh_ttisstdcnt);
362 1.14 jtc sp->leapcnt = (int) detzcode(u.tzhead.tzh_leapcnt);
363 1.14 jtc sp->timecnt = (int) detzcode(u.tzhead.tzh_timecnt);
364 1.14 jtc sp->typecnt = (int) detzcode(u.tzhead.tzh_typecnt);
365 1.14 jtc sp->charcnt = (int) detzcode(u.tzhead.tzh_charcnt);
366 1.14 jtc p = u.tzhead.tzh_charcnt + sizeof u.tzhead.tzh_charcnt;
367 1.1 jtc if (sp->leapcnt < 0 || sp->leapcnt > TZ_MAX_LEAPS ||
368 1.1 jtc sp->typecnt <= 0 || sp->typecnt > TZ_MAX_TYPES ||
369 1.1 jtc sp->timecnt < 0 || sp->timecnt > TZ_MAX_TIMES ||
370 1.1 jtc sp->charcnt < 0 || sp->charcnt > TZ_MAX_CHARS ||
371 1.1 jtc (ttisstdcnt != sp->typecnt && ttisstdcnt != 0) ||
372 1.1 jtc (ttisgmtcnt != sp->typecnt && ttisgmtcnt != 0))
373 1.1 jtc return -1;
374 1.14 jtc if (i - (p - u.buf) < sp->timecnt * 4 + /* ats */
375 1.1 jtc sp->timecnt + /* types */
376 1.1 jtc sp->typecnt * (4 + 2) + /* ttinfos */
377 1.1 jtc sp->charcnt + /* chars */
378 1.1 jtc sp->leapcnt * (4 + 4) + /* lsinfos */
379 1.1 jtc ttisstdcnt + /* ttisstds */
380 1.1 jtc ttisgmtcnt) /* ttisgmts */
381 1.1 jtc return -1;
382 1.1 jtc for (i = 0; i < sp->timecnt; ++i) {
383 1.1 jtc sp->ats[i] = detzcode(p);
384 1.1 jtc p += 4;
385 1.1 jtc }
386 1.1 jtc for (i = 0; i < sp->timecnt; ++i) {
387 1.1 jtc sp->types[i] = (unsigned char) *p++;
388 1.1 jtc if (sp->types[i] >= sp->typecnt)
389 1.1 jtc return -1;
390 1.1 jtc }
391 1.1 jtc for (i = 0; i < sp->typecnt; ++i) {
392 1.1 jtc register struct ttinfo * ttisp;
393 1.1 jtc
394 1.1 jtc ttisp = &sp->ttis[i];
395 1.1 jtc ttisp->tt_gmtoff = detzcode(p);
396 1.1 jtc p += 4;
397 1.1 jtc ttisp->tt_isdst = (unsigned char) *p++;
398 1.1 jtc if (ttisp->tt_isdst != 0 && ttisp->tt_isdst != 1)
399 1.1 jtc return -1;
400 1.1 jtc ttisp->tt_abbrind = (unsigned char) *p++;
401 1.1 jtc if (ttisp->tt_abbrind < 0 ||
402 1.1 jtc ttisp->tt_abbrind > sp->charcnt)
403 1.1 jtc return -1;
404 1.1 jtc }
405 1.1 jtc for (i = 0; i < sp->charcnt; ++i)
406 1.1 jtc sp->chars[i] = *p++;
407 1.1 jtc sp->chars[i] = '\0'; /* ensure '\0' at end */
408 1.1 jtc for (i = 0; i < sp->leapcnt; ++i) {
409 1.1 jtc register struct lsinfo * lsisp;
410 1.1 jtc
411 1.1 jtc lsisp = &sp->lsis[i];
412 1.1 jtc lsisp->ls_trans = detzcode(p);
413 1.1 jtc p += 4;
414 1.1 jtc lsisp->ls_corr = detzcode(p);
415 1.1 jtc p += 4;
416 1.1 jtc }
417 1.1 jtc for (i = 0; i < sp->typecnt; ++i) {
418 1.1 jtc register struct ttinfo * ttisp;
419 1.1 jtc
420 1.1 jtc ttisp = &sp->ttis[i];
421 1.1 jtc if (ttisstdcnt == 0)
422 1.1 jtc ttisp->tt_ttisstd = FALSE;
423 1.1 jtc else {
424 1.1 jtc ttisp->tt_ttisstd = *p++;
425 1.1 jtc if (ttisp->tt_ttisstd != TRUE &&
426 1.1 jtc ttisp->tt_ttisstd != FALSE)
427 1.1 jtc return -1;
428 1.1 jtc }
429 1.1 jtc }
430 1.1 jtc for (i = 0; i < sp->typecnt; ++i) {
431 1.1 jtc register struct ttinfo * ttisp;
432 1.1 jtc
433 1.1 jtc ttisp = &sp->ttis[i];
434 1.1 jtc if (ttisgmtcnt == 0)
435 1.1 jtc ttisp->tt_ttisgmt = FALSE;
436 1.1 jtc else {
437 1.1 jtc ttisp->tt_ttisgmt = *p++;
438 1.1 jtc if (ttisp->tt_ttisgmt != TRUE &&
439 1.1 jtc ttisp->tt_ttisgmt != FALSE)
440 1.1 jtc return -1;
441 1.1 jtc }
442 1.1 jtc }
443 1.1 jtc }
444 1.1 jtc return 0;
445 1.1 jtc }
446 1.1 jtc
447 1.1 jtc static const int mon_lengths[2][MONSPERYEAR] = {
448 1.1 jtc { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 },
449 1.1 jtc { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }
450 1.1 jtc };
451 1.1 jtc
452 1.1 jtc static const int year_lengths[2] = {
453 1.1 jtc DAYSPERNYEAR, DAYSPERLYEAR
454 1.1 jtc };
455 1.1 jtc
456 1.1 jtc /*
457 1.1 jtc ** Given a pointer into a time zone string, scan until a character that is not
458 1.1 jtc ** a valid character in a zone name is found. Return a pointer to that
459 1.1 jtc ** character.
460 1.1 jtc */
461 1.1 jtc
462 1.1 jtc static const char *
463 1.1 jtc getzname(strp)
464 1.1 jtc register const char * strp;
465 1.1 jtc {
466 1.1 jtc register char c;
467 1.1 jtc
468 1.5 jtc while ((c = *strp) != '\0' && !is_digit(c) && c != ',' && c != '-' &&
469 1.1 jtc c != '+')
470 1.1 jtc ++strp;
471 1.1 jtc return strp;
472 1.1 jtc }
473 1.1 jtc
474 1.1 jtc /*
475 1.1 jtc ** Given a pointer into a time zone string, extract a number from that string.
476 1.1 jtc ** Check that the number is within a specified range; if it is not, return
477 1.1 jtc ** NULL.
478 1.1 jtc ** Otherwise, return a pointer to the first character not part of the number.
479 1.1 jtc */
480 1.1 jtc
481 1.1 jtc static const char *
482 1.1 jtc getnum(strp, nump, min, max)
483 1.1 jtc register const char * strp;
484 1.1 jtc int * const nump;
485 1.1 jtc const int min;
486 1.1 jtc const int max;
487 1.1 jtc {
488 1.1 jtc register char c;
489 1.1 jtc register int num;
490 1.1 jtc
491 1.5 jtc if (strp == NULL || !is_digit(c = *strp))
492 1.1 jtc return NULL;
493 1.1 jtc num = 0;
494 1.5 jtc do {
495 1.1 jtc num = num * 10 + (c - '0');
496 1.1 jtc if (num > max)
497 1.1 jtc return NULL; /* illegal value */
498 1.5 jtc c = *++strp;
499 1.5 jtc } while (is_digit(c));
500 1.1 jtc if (num < min)
501 1.1 jtc return NULL; /* illegal value */
502 1.1 jtc *nump = num;
503 1.1 jtc return strp;
504 1.1 jtc }
505 1.1 jtc
506 1.1 jtc /*
507 1.1 jtc ** Given a pointer into a time zone string, extract a number of seconds,
508 1.1 jtc ** in hh[:mm[:ss]] form, from the string.
509 1.1 jtc ** If any error occurs, return NULL.
510 1.1 jtc ** Otherwise, return a pointer to the first character not part of the number
511 1.1 jtc ** of seconds.
512 1.1 jtc */
513 1.1 jtc
514 1.1 jtc static const char *
515 1.1 jtc getsecs(strp, secsp)
516 1.1 jtc register const char * strp;
517 1.1 jtc long * const secsp;
518 1.1 jtc {
519 1.1 jtc int num;
520 1.1 jtc
521 1.1 jtc /*
522 1.1 jtc ** `HOURSPERDAY * DAYSPERWEEK - 1' allows quasi-Posix rules like
523 1.1 jtc ** "M10.4.6/26", which does not conform to Posix,
524 1.1 jtc ** but which specifies the equivalent of
525 1.1 jtc ** ``02:00 on the first Sunday on or after 23 Oct''.
526 1.1 jtc */
527 1.1 jtc strp = getnum(strp, &num, 0, HOURSPERDAY * DAYSPERWEEK - 1);
528 1.1 jtc if (strp == NULL)
529 1.1 jtc return NULL;
530 1.1 jtc *secsp = num * (long) SECSPERHOUR;
531 1.1 jtc if (*strp == ':') {
532 1.1 jtc ++strp;
533 1.1 jtc strp = getnum(strp, &num, 0, MINSPERHOUR - 1);
534 1.1 jtc if (strp == NULL)
535 1.1 jtc return NULL;
536 1.1 jtc *secsp += num * SECSPERMIN;
537 1.1 jtc if (*strp == ':') {
538 1.1 jtc ++strp;
539 1.1 jtc /* `SECSPERMIN' allows for leap seconds. */
540 1.1 jtc strp = getnum(strp, &num, 0, SECSPERMIN);
541 1.1 jtc if (strp == NULL)
542 1.1 jtc return NULL;
543 1.1 jtc *secsp += num;
544 1.1 jtc }
545 1.1 jtc }
546 1.1 jtc return strp;
547 1.1 jtc }
548 1.1 jtc
549 1.1 jtc /*
550 1.1 jtc ** Given a pointer into a time zone string, extract an offset, in
551 1.1 jtc ** [+-]hh[:mm[:ss]] form, from the string.
552 1.1 jtc ** If any error occurs, return NULL.
553 1.1 jtc ** Otherwise, return a pointer to the first character not part of the time.
554 1.1 jtc */
555 1.1 jtc
556 1.1 jtc static const char *
557 1.1 jtc getoffset(strp, offsetp)
558 1.1 jtc register const char * strp;
559 1.1 jtc long * const offsetp;
560 1.1 jtc {
561 1.5 jtc register int neg = 0;
562 1.1 jtc
563 1.1 jtc if (*strp == '-') {
564 1.1 jtc neg = 1;
565 1.1 jtc ++strp;
566 1.5 jtc } else if (*strp == '+')
567 1.5 jtc ++strp;
568 1.1 jtc strp = getsecs(strp, offsetp);
569 1.1 jtc if (strp == NULL)
570 1.1 jtc return NULL; /* illegal time */
571 1.1 jtc if (neg)
572 1.1 jtc *offsetp = -*offsetp;
573 1.1 jtc return strp;
574 1.1 jtc }
575 1.1 jtc
576 1.1 jtc /*
577 1.1 jtc ** Given a pointer into a time zone string, extract a rule in the form
578 1.1 jtc ** date[/time]. See POSIX section 8 for the format of "date" and "time".
579 1.1 jtc ** If a valid rule is not found, return NULL.
580 1.1 jtc ** Otherwise, return a pointer to the first character not part of the rule.
581 1.1 jtc */
582 1.1 jtc
583 1.1 jtc static const char *
584 1.1 jtc getrule(strp, rulep)
585 1.1 jtc const char * strp;
586 1.1 jtc register struct rule * const rulep;
587 1.1 jtc {
588 1.1 jtc if (*strp == 'J') {
589 1.1 jtc /*
590 1.1 jtc ** Julian day.
591 1.1 jtc */
592 1.1 jtc rulep->r_type = JULIAN_DAY;
593 1.1 jtc ++strp;
594 1.1 jtc strp = getnum(strp, &rulep->r_day, 1, DAYSPERNYEAR);
595 1.1 jtc } else if (*strp == 'M') {
596 1.1 jtc /*
597 1.1 jtc ** Month, week, day.
598 1.1 jtc */
599 1.1 jtc rulep->r_type = MONTH_NTH_DAY_OF_WEEK;
600 1.1 jtc ++strp;
601 1.1 jtc strp = getnum(strp, &rulep->r_mon, 1, MONSPERYEAR);
602 1.1 jtc if (strp == NULL)
603 1.1 jtc return NULL;
604 1.1 jtc if (*strp++ != '.')
605 1.1 jtc return NULL;
606 1.1 jtc strp = getnum(strp, &rulep->r_week, 1, 5);
607 1.1 jtc if (strp == NULL)
608 1.1 jtc return NULL;
609 1.1 jtc if (*strp++ != '.')
610 1.1 jtc return NULL;
611 1.1 jtc strp = getnum(strp, &rulep->r_day, 0, DAYSPERWEEK - 1);
612 1.5 jtc } else if (is_digit(*strp)) {
613 1.1 jtc /*
614 1.1 jtc ** Day of year.
615 1.1 jtc */
616 1.1 jtc rulep->r_type = DAY_OF_YEAR;
617 1.1 jtc strp = getnum(strp, &rulep->r_day, 0, DAYSPERLYEAR - 1);
618 1.1 jtc } else return NULL; /* invalid format */
619 1.1 jtc if (strp == NULL)
620 1.1 jtc return NULL;
621 1.1 jtc if (*strp == '/') {
622 1.1 jtc /*
623 1.1 jtc ** Time specified.
624 1.1 jtc */
625 1.1 jtc ++strp;
626 1.1 jtc strp = getsecs(strp, &rulep->r_time);
627 1.1 jtc } else rulep->r_time = 2 * SECSPERHOUR; /* default = 2:00:00 */
628 1.1 jtc return strp;
629 1.1 jtc }
630 1.1 jtc
631 1.1 jtc /*
632 1.14 jtc ** Given the Epoch-relative time of January 1, 00:00:00 UTC, in a year, the
633 1.14 jtc ** year, a rule, and the offset from UTC at the time that rule takes effect,
634 1.1 jtc ** calculate the Epoch-relative time that rule takes effect.
635 1.1 jtc */
636 1.1 jtc
637 1.1 jtc static time_t
638 1.1 jtc transtime(janfirst, year, rulep, offset)
639 1.1 jtc const time_t janfirst;
640 1.1 jtc const int year;
641 1.1 jtc register const struct rule * const rulep;
642 1.1 jtc const long offset;
643 1.1 jtc {
644 1.1 jtc register int leapyear;
645 1.1 jtc register time_t value;
646 1.1 jtc register int i;
647 1.1 jtc int d, m1, yy0, yy1, yy2, dow;
648 1.1 jtc
649 1.1 jtc INITIALIZE(value);
650 1.1 jtc leapyear = isleap(year);
651 1.1 jtc switch (rulep->r_type) {
652 1.1 jtc
653 1.1 jtc case JULIAN_DAY:
654 1.1 jtc /*
655 1.1 jtc ** Jn - Julian day, 1 == January 1, 60 == March 1 even in leap
656 1.1 jtc ** years.
657 1.1 jtc ** In non-leap years, or if the day number is 59 or less, just
658 1.1 jtc ** add SECSPERDAY times the day number-1 to the time of
659 1.1 jtc ** January 1, midnight, to get the day.
660 1.1 jtc */
661 1.1 jtc value = janfirst + (rulep->r_day - 1) * SECSPERDAY;
662 1.1 jtc if (leapyear && rulep->r_day >= 60)
663 1.1 jtc value += SECSPERDAY;
664 1.1 jtc break;
665 1.1 jtc
666 1.1 jtc case DAY_OF_YEAR:
667 1.1 jtc /*
668 1.1 jtc ** n - day of year.
669 1.1 jtc ** Just add SECSPERDAY times the day number to the time of
670 1.1 jtc ** January 1, midnight, to get the day.
671 1.1 jtc */
672 1.1 jtc value = janfirst + rulep->r_day * SECSPERDAY;
673 1.1 jtc break;
674 1.1 jtc
675 1.1 jtc case MONTH_NTH_DAY_OF_WEEK:
676 1.1 jtc /*
677 1.1 jtc ** Mm.n.d - nth "dth day" of month m.
678 1.1 jtc */
679 1.1 jtc value = janfirst;
680 1.1 jtc for (i = 0; i < rulep->r_mon - 1; ++i)
681 1.1 jtc value += mon_lengths[leapyear][i] * SECSPERDAY;
682 1.1 jtc
683 1.1 jtc /*
684 1.1 jtc ** Use Zeller's Congruence to get day-of-week of first day of
685 1.1 jtc ** month.
686 1.1 jtc */
687 1.1 jtc m1 = (rulep->r_mon + 9) % 12 + 1;
688 1.1 jtc yy0 = (rulep->r_mon <= 2) ? (year - 1) : year;
689 1.1 jtc yy1 = yy0 / 100;
690 1.1 jtc yy2 = yy0 % 100;
691 1.1 jtc dow = ((26 * m1 - 2) / 10 +
692 1.1 jtc 1 + yy2 + yy2 / 4 + yy1 / 4 - 2 * yy1) % 7;
693 1.1 jtc if (dow < 0)
694 1.1 jtc dow += DAYSPERWEEK;
695 1.1 jtc
696 1.1 jtc /*
697 1.1 jtc ** "dow" is the day-of-week of the first day of the month. Get
698 1.1 jtc ** the day-of-month (zero-origin) of the first "dow" day of the
699 1.1 jtc ** month.
700 1.1 jtc */
701 1.1 jtc d = rulep->r_day - dow;
702 1.1 jtc if (d < 0)
703 1.1 jtc d += DAYSPERWEEK;
704 1.1 jtc for (i = 1; i < rulep->r_week; ++i) {
705 1.1 jtc if (d + DAYSPERWEEK >=
706 1.1 jtc mon_lengths[leapyear][rulep->r_mon - 1])
707 1.1 jtc break;
708 1.1 jtc d += DAYSPERWEEK;
709 1.1 jtc }
710 1.1 jtc
711 1.1 jtc /*
712 1.1 jtc ** "d" is the day-of-month (zero-origin) of the day we want.
713 1.1 jtc */
714 1.1 jtc value += d * SECSPERDAY;
715 1.1 jtc break;
716 1.1 jtc }
717 1.1 jtc
718 1.1 jtc /*
719 1.14 jtc ** "value" is the Epoch-relative time of 00:00:00 UTC on the day in
720 1.1 jtc ** question. To get the Epoch-relative time of the specified local
721 1.1 jtc ** time on that day, add the transition time and the current offset
722 1.14 jtc ** from UTC.
723 1.1 jtc */
724 1.1 jtc return value + rulep->r_time + offset;
725 1.1 jtc }
726 1.1 jtc
727 1.1 jtc /*
728 1.1 jtc ** Given a POSIX section 8-style TZ string, fill in the rule tables as
729 1.1 jtc ** appropriate.
730 1.1 jtc */
731 1.1 jtc
732 1.1 jtc static int
733 1.1 jtc tzparse(name, sp, lastditch)
734 1.1 jtc const char * name;
735 1.1 jtc register struct state * const sp;
736 1.1 jtc const int lastditch;
737 1.1 jtc {
738 1.1 jtc const char * stdname;
739 1.1 jtc const char * dstname;
740 1.1 jtc size_t stdlen;
741 1.1 jtc size_t dstlen;
742 1.1 jtc long stdoffset;
743 1.1 jtc long dstoffset;
744 1.1 jtc register time_t * atp;
745 1.1 jtc register unsigned char * typep;
746 1.1 jtc register char * cp;
747 1.1 jtc register int load_result;
748 1.1 jtc
749 1.1 jtc INITIALIZE(dstname);
750 1.1 jtc stdname = name;
751 1.1 jtc if (lastditch) {
752 1.1 jtc stdlen = strlen(name); /* length of standard zone name */
753 1.1 jtc name += stdlen;
754 1.1 jtc if (stdlen >= sizeof sp->chars)
755 1.1 jtc stdlen = (sizeof sp->chars) - 1;
756 1.10 jtc stdoffset = 0;
757 1.1 jtc } else {
758 1.1 jtc name = getzname(name);
759 1.1 jtc stdlen = name - stdname;
760 1.1 jtc if (stdlen < 3)
761 1.1 jtc return -1;
762 1.10 jtc if (*name == '\0')
763 1.10 jtc return -1;
764 1.1 jtc name = getoffset(name, &stdoffset);
765 1.1 jtc if (name == NULL)
766 1.1 jtc return -1;
767 1.1 jtc }
768 1.1 jtc load_result = tzload(TZDEFRULES, sp);
769 1.1 jtc if (load_result != 0)
770 1.1 jtc sp->leapcnt = 0; /* so, we're off a little */
771 1.1 jtc if (*name != '\0') {
772 1.1 jtc dstname = name;
773 1.1 jtc name = getzname(name);
774 1.1 jtc dstlen = name - dstname; /* length of DST zone name */
775 1.1 jtc if (dstlen < 3)
776 1.1 jtc return -1;
777 1.1 jtc if (*name != '\0' && *name != ',' && *name != ';') {
778 1.1 jtc name = getoffset(name, &dstoffset);
779 1.1 jtc if (name == NULL)
780 1.1 jtc return -1;
781 1.1 jtc } else dstoffset = stdoffset - SECSPERHOUR;
782 1.1 jtc if (*name == ',' || *name == ';') {
783 1.1 jtc struct rule start;
784 1.1 jtc struct rule end;
785 1.1 jtc register int year;
786 1.1 jtc register time_t janfirst;
787 1.1 jtc time_t starttime;
788 1.1 jtc time_t endtime;
789 1.1 jtc
790 1.1 jtc ++name;
791 1.1 jtc if ((name = getrule(name, &start)) == NULL)
792 1.1 jtc return -1;
793 1.1 jtc if (*name++ != ',')
794 1.1 jtc return -1;
795 1.1 jtc if ((name = getrule(name, &end)) == NULL)
796 1.1 jtc return -1;
797 1.1 jtc if (*name != '\0')
798 1.1 jtc return -1;
799 1.1 jtc sp->typecnt = 2; /* standard time and DST */
800 1.1 jtc /*
801 1.1 jtc ** Two transitions per year, from EPOCH_YEAR to 2037.
802 1.1 jtc */
803 1.1 jtc sp->timecnt = 2 * (2037 - EPOCH_YEAR + 1);
804 1.1 jtc if (sp->timecnt > TZ_MAX_TIMES)
805 1.1 jtc return -1;
806 1.1 jtc sp->ttis[0].tt_gmtoff = -dstoffset;
807 1.1 jtc sp->ttis[0].tt_isdst = 1;
808 1.1 jtc sp->ttis[0].tt_abbrind = stdlen + 1;
809 1.1 jtc sp->ttis[1].tt_gmtoff = -stdoffset;
810 1.1 jtc sp->ttis[1].tt_isdst = 0;
811 1.1 jtc sp->ttis[1].tt_abbrind = 0;
812 1.1 jtc atp = sp->ats;
813 1.1 jtc typep = sp->types;
814 1.1 jtc janfirst = 0;
815 1.1 jtc for (year = EPOCH_YEAR; year <= 2037; ++year) {
816 1.1 jtc starttime = transtime(janfirst, year, &start,
817 1.1 jtc stdoffset);
818 1.1 jtc endtime = transtime(janfirst, year, &end,
819 1.1 jtc dstoffset);
820 1.1 jtc if (starttime > endtime) {
821 1.1 jtc *atp++ = endtime;
822 1.1 jtc *typep++ = 1; /* DST ends */
823 1.1 jtc *atp++ = starttime;
824 1.1 jtc *typep++ = 0; /* DST begins */
825 1.1 jtc } else {
826 1.1 jtc *atp++ = starttime;
827 1.1 jtc *typep++ = 0; /* DST begins */
828 1.1 jtc *atp++ = endtime;
829 1.1 jtc *typep++ = 1; /* DST ends */
830 1.1 jtc }
831 1.1 jtc janfirst += year_lengths[isleap(year)] *
832 1.1 jtc SECSPERDAY;
833 1.1 jtc }
834 1.1 jtc } else {
835 1.1 jtc register long theirstdoffset;
836 1.1 jtc register long theirdstoffset;
837 1.1 jtc register long theiroffset;
838 1.1 jtc register int isdst;
839 1.1 jtc register int i;
840 1.1 jtc register int j;
841 1.1 jtc
842 1.1 jtc if (*name != '\0')
843 1.1 jtc return -1;
844 1.1 jtc if (load_result != 0)
845 1.1 jtc return -1;
846 1.1 jtc /*
847 1.1 jtc ** Initial values of theirstdoffset and theirdstoffset.
848 1.1 jtc */
849 1.1 jtc theirstdoffset = 0;
850 1.1 jtc for (i = 0; i < sp->timecnt; ++i) {
851 1.1 jtc j = sp->types[i];
852 1.1 jtc if (!sp->ttis[j].tt_isdst) {
853 1.5 jtc theirstdoffset =
854 1.5 jtc -sp->ttis[j].tt_gmtoff;
855 1.1 jtc break;
856 1.1 jtc }
857 1.1 jtc }
858 1.1 jtc theirdstoffset = 0;
859 1.1 jtc for (i = 0; i < sp->timecnt; ++i) {
860 1.1 jtc j = sp->types[i];
861 1.1 jtc if (sp->ttis[j].tt_isdst) {
862 1.5 jtc theirdstoffset =
863 1.5 jtc -sp->ttis[j].tt_gmtoff;
864 1.1 jtc break;
865 1.1 jtc }
866 1.1 jtc }
867 1.1 jtc /*
868 1.1 jtc ** Initially we're assumed to be in standard time.
869 1.1 jtc */
870 1.1 jtc isdst = FALSE;
871 1.1 jtc theiroffset = theirstdoffset;
872 1.1 jtc /*
873 1.1 jtc ** Now juggle transition times and types
874 1.1 jtc ** tracking offsets as you do.
875 1.1 jtc */
876 1.1 jtc for (i = 0; i < sp->timecnt; ++i) {
877 1.1 jtc j = sp->types[i];
878 1.1 jtc sp->types[i] = sp->ttis[j].tt_isdst;
879 1.1 jtc if (sp->ttis[j].tt_ttisgmt) {
880 1.1 jtc /* No adjustment to transition time */
881 1.1 jtc } else {
882 1.1 jtc /*
883 1.1 jtc ** If summer time is in effect, and the
884 1.1 jtc ** transition time was not specified as
885 1.1 jtc ** standard time, add the summer time
886 1.1 jtc ** offset to the transition time;
887 1.1 jtc ** otherwise, add the standard time
888 1.1 jtc ** offset to the transition time.
889 1.1 jtc */
890 1.1 jtc /*
891 1.1 jtc ** Transitions from DST to DDST
892 1.1 jtc ** will effectively disappear since
893 1.1 jtc ** POSIX provides for only one DST
894 1.1 jtc ** offset.
895 1.1 jtc */
896 1.1 jtc if (isdst && !sp->ttis[j].tt_ttisstd) {
897 1.1 jtc sp->ats[i] += dstoffset -
898 1.1 jtc theirdstoffset;
899 1.1 jtc } else {
900 1.1 jtc sp->ats[i] += stdoffset -
901 1.1 jtc theirstdoffset;
902 1.1 jtc }
903 1.1 jtc }
904 1.1 jtc theiroffset = -sp->ttis[j].tt_gmtoff;
905 1.1 jtc if (sp->ttis[j].tt_isdst)
906 1.1 jtc theirdstoffset = theiroffset;
907 1.1 jtc else theirstdoffset = theiroffset;
908 1.1 jtc }
909 1.1 jtc /*
910 1.1 jtc ** Finally, fill in ttis.
911 1.1 jtc ** ttisstd and ttisgmt need not be handled.
912 1.1 jtc */
913 1.1 jtc sp->ttis[0].tt_gmtoff = -stdoffset;
914 1.1 jtc sp->ttis[0].tt_isdst = FALSE;
915 1.1 jtc sp->ttis[0].tt_abbrind = 0;
916 1.1 jtc sp->ttis[1].tt_gmtoff = -dstoffset;
917 1.1 jtc sp->ttis[1].tt_isdst = TRUE;
918 1.1 jtc sp->ttis[1].tt_abbrind = stdlen + 1;
919 1.7 jtc sp->typecnt = 2;
920 1.1 jtc }
921 1.1 jtc } else {
922 1.1 jtc dstlen = 0;
923 1.1 jtc sp->typecnt = 1; /* only standard time */
924 1.1 jtc sp->timecnt = 0;
925 1.1 jtc sp->ttis[0].tt_gmtoff = -stdoffset;
926 1.1 jtc sp->ttis[0].tt_isdst = 0;
927 1.1 jtc sp->ttis[0].tt_abbrind = 0;
928 1.1 jtc }
929 1.1 jtc sp->charcnt = stdlen + 1;
930 1.1 jtc if (dstlen != 0)
931 1.1 jtc sp->charcnt += dstlen + 1;
932 1.10 jtc if ((size_t) sp->charcnt > sizeof sp->chars)
933 1.1 jtc return -1;
934 1.1 jtc cp = sp->chars;
935 1.1 jtc (void) strncpy(cp, stdname, stdlen);
936 1.1 jtc cp += stdlen;
937 1.1 jtc *cp++ = '\0';
938 1.1 jtc if (dstlen != 0) {
939 1.1 jtc (void) strncpy(cp, dstname, dstlen);
940 1.1 jtc *(cp + dstlen) = '\0';
941 1.1 jtc }
942 1.1 jtc return 0;
943 1.1 jtc }
944 1.1 jtc
945 1.1 jtc static void
946 1.1 jtc gmtload(sp)
947 1.1 jtc struct state * const sp;
948 1.1 jtc {
949 1.1 jtc if (tzload(gmt, sp) != 0)
950 1.1 jtc (void) tzparse(gmt, sp, TRUE);
951 1.1 jtc }
952 1.1 jtc
953 1.1 jtc #ifndef STD_INSPIRED
954 1.1 jtc /*
955 1.1 jtc ** A non-static declaration of tzsetwall in a system header file
956 1.1 jtc ** may cause a warning about this upcoming static declaration...
957 1.1 jtc */
958 1.1 jtc static
959 1.1 jtc #endif /* !defined STD_INSPIRED */
960 1.1 jtc void
961 1.1 jtc tzsetwall P((void))
962 1.1 jtc {
963 1.1 jtc if (lcl_is_set < 0)
964 1.1 jtc return;
965 1.1 jtc lcl_is_set = -1;
966 1.1 jtc
967 1.1 jtc #ifdef ALL_STATE
968 1.1 jtc if (lclptr == NULL) {
969 1.1 jtc lclptr = (struct state *) malloc(sizeof *lclptr);
970 1.1 jtc if (lclptr == NULL) {
971 1.1 jtc settzname(); /* all we can do */
972 1.1 jtc return;
973 1.1 jtc }
974 1.1 jtc }
975 1.1 jtc #endif /* defined ALL_STATE */
976 1.1 jtc if (tzload((char *) NULL, lclptr) != 0)
977 1.1 jtc gmtload(lclptr);
978 1.1 jtc settzname();
979 1.1 jtc }
980 1.1 jtc
981 1.1 jtc void
982 1.1 jtc tzset P((void))
983 1.1 jtc {
984 1.1 jtc register const char * name;
985 1.1 jtc
986 1.1 jtc name = getenv("TZ");
987 1.1 jtc if (name == NULL) {
988 1.1 jtc tzsetwall();
989 1.1 jtc return;
990 1.1 jtc }
991 1.1 jtc
992 1.1 jtc if (lcl_is_set > 0 && strcmp(lcl_TZname, name) == 0)
993 1.1 jtc return;
994 1.1 jtc lcl_is_set = (strlen(name) < sizeof(lcl_TZname));
995 1.1 jtc if (lcl_is_set)
996 1.8 mrg (void)strncpy(lcl_TZname, name, sizeof(lcl_TZname) - 1);
997 1.1 jtc
998 1.1 jtc #ifdef ALL_STATE
999 1.1 jtc if (lclptr == NULL) {
1000 1.1 jtc lclptr = (struct state *) malloc(sizeof *lclptr);
1001 1.1 jtc if (lclptr == NULL) {
1002 1.1 jtc settzname(); /* all we can do */
1003 1.1 jtc return;
1004 1.1 jtc }
1005 1.1 jtc }
1006 1.1 jtc #endif /* defined ALL_STATE */
1007 1.1 jtc if (*name == '\0') {
1008 1.1 jtc /*
1009 1.1 jtc ** User wants it fast rather than right.
1010 1.1 jtc */
1011 1.1 jtc lclptr->leapcnt = 0; /* so, we're off a little */
1012 1.1 jtc lclptr->timecnt = 0;
1013 1.1 jtc lclptr->ttis[0].tt_gmtoff = 0;
1014 1.1 jtc lclptr->ttis[0].tt_abbrind = 0;
1015 1.8 mrg (void)strncpy(lclptr->chars, gmt, sizeof(lclptr->chars) - 1);
1016 1.1 jtc } else if (tzload(name, lclptr) != 0)
1017 1.1 jtc if (name[0] == ':' || tzparse(name, lclptr, FALSE) != 0)
1018 1.1 jtc (void) gmtload(lclptr);
1019 1.1 jtc settzname();
1020 1.1 jtc }
1021 1.1 jtc
1022 1.1 jtc /*
1023 1.1 jtc ** The easy way to behave "as if no library function calls" localtime
1024 1.1 jtc ** is to not call it--so we drop its guts into "localsub", which can be
1025 1.1 jtc ** freely called. (And no, the PANS doesn't require the above behavior--
1026 1.1 jtc ** but it *is* desirable.)
1027 1.1 jtc **
1028 1.1 jtc ** The unused offset argument is for the benefit of mktime variants.
1029 1.1 jtc */
1030 1.1 jtc
1031 1.1 jtc /*ARGSUSED*/
1032 1.1 jtc static void
1033 1.1 jtc localsub(timep, offset, tmp)
1034 1.1 jtc const time_t * const timep;
1035 1.1 jtc const long offset;
1036 1.1 jtc struct tm * const tmp;
1037 1.1 jtc {
1038 1.1 jtc register struct state * sp;
1039 1.1 jtc register const struct ttinfo * ttisp;
1040 1.1 jtc register int i;
1041 1.1 jtc const time_t t = *timep;
1042 1.1 jtc
1043 1.1 jtc sp = lclptr;
1044 1.1 jtc #ifdef ALL_STATE
1045 1.1 jtc if (sp == NULL) {
1046 1.1 jtc gmtsub(timep, offset, tmp);
1047 1.1 jtc return;
1048 1.1 jtc }
1049 1.1 jtc #endif /* defined ALL_STATE */
1050 1.1 jtc if (sp->timecnt == 0 || t < sp->ats[0]) {
1051 1.1 jtc i = 0;
1052 1.1 jtc while (sp->ttis[i].tt_isdst)
1053 1.1 jtc if (++i >= sp->typecnt) {
1054 1.1 jtc i = 0;
1055 1.1 jtc break;
1056 1.1 jtc }
1057 1.1 jtc } else {
1058 1.1 jtc for (i = 1; i < sp->timecnt; ++i)
1059 1.1 jtc if (t < sp->ats[i])
1060 1.1 jtc break;
1061 1.1 jtc i = sp->types[i - 1];
1062 1.1 jtc }
1063 1.1 jtc ttisp = &sp->ttis[i];
1064 1.1 jtc /*
1065 1.1 jtc ** To get (wrong) behavior that's compatible with System V Release 2.0
1066 1.1 jtc ** you'd replace the statement below with
1067 1.1 jtc ** t += ttisp->tt_gmtoff;
1068 1.1 jtc ** timesub(&t, 0L, sp, tmp);
1069 1.1 jtc */
1070 1.1 jtc timesub(&t, ttisp->tt_gmtoff, sp, tmp);
1071 1.1 jtc tmp->tm_isdst = ttisp->tt_isdst;
1072 1.1 jtc tzname[tmp->tm_isdst] = &sp->chars[ttisp->tt_abbrind];
1073 1.1 jtc #ifdef TM_ZONE
1074 1.1 jtc tmp->TM_ZONE = &sp->chars[ttisp->tt_abbrind];
1075 1.1 jtc #endif /* defined TM_ZONE */
1076 1.1 jtc }
1077 1.1 jtc
1078 1.1 jtc struct tm *
1079 1.1 jtc localtime(timep)
1080 1.1 jtc const time_t * const timep;
1081 1.1 jtc {
1082 1.1 jtc tzset();
1083 1.1 jtc localsub(timep, 0L, &tm);
1084 1.1 jtc return &tm;
1085 1.1 jtc }
1086 1.1 jtc
1087 1.1 jtc /*
1088 1.18 kleink * Re-entrant version of localtime
1089 1.18 kleink */
1090 1.18 kleink struct tm *
1091 1.18 kleink localtime_r(timep, tm)
1092 1.18 kleink const time_t * const timep;
1093 1.18 kleink struct tm * tm;
1094 1.18 kleink {
1095 1.18 kleink localsub(timep, 0L, tm);
1096 1.18 kleink return tm;
1097 1.18 kleink }
1098 1.18 kleink
1099 1.18 kleink /*
1100 1.1 jtc ** gmtsub is to gmtime as localsub is to localtime.
1101 1.1 jtc */
1102 1.1 jtc
1103 1.1 jtc static void
1104 1.1 jtc gmtsub(timep, offset, tmp)
1105 1.1 jtc const time_t * const timep;
1106 1.1 jtc const long offset;
1107 1.1 jtc struct tm * const tmp;
1108 1.1 jtc {
1109 1.1 jtc if (!gmt_is_set) {
1110 1.1 jtc gmt_is_set = TRUE;
1111 1.1 jtc #ifdef ALL_STATE
1112 1.1 jtc gmtptr = (struct state *) malloc(sizeof *gmtptr);
1113 1.1 jtc if (gmtptr != NULL)
1114 1.1 jtc #endif /* defined ALL_STATE */
1115 1.1 jtc gmtload(gmtptr);
1116 1.1 jtc }
1117 1.1 jtc timesub(timep, offset, gmtptr, tmp);
1118 1.1 jtc #ifdef TM_ZONE
1119 1.1 jtc /*
1120 1.1 jtc ** Could get fancy here and deliver something such as
1121 1.14 jtc ** "UTC+xxxx" or "UTC-xxxx" if offset is non-zero,
1122 1.1 jtc ** but this is no time for a treasure hunt.
1123 1.1 jtc */
1124 1.1 jtc if (offset != 0)
1125 1.16 mycroft tmp->TM_ZONE = (__aconst char *)wildabbr;
1126 1.1 jtc else {
1127 1.1 jtc #ifdef ALL_STATE
1128 1.1 jtc if (gmtptr == NULL)
1129 1.17 mycroft tmp->TM_ZONE = (__aconst char *)gmt;
1130 1.1 jtc else tmp->TM_ZONE = gmtptr->chars;
1131 1.1 jtc #endif /* defined ALL_STATE */
1132 1.1 jtc #ifndef ALL_STATE
1133 1.1 jtc tmp->TM_ZONE = gmtptr->chars;
1134 1.1 jtc #endif /* State Farm */
1135 1.1 jtc }
1136 1.1 jtc #endif /* defined TM_ZONE */
1137 1.1 jtc }
1138 1.1 jtc
1139 1.1 jtc struct tm *
1140 1.1 jtc gmtime(timep)
1141 1.1 jtc const time_t * const timep;
1142 1.1 jtc {
1143 1.1 jtc gmtsub(timep, 0L, &tm);
1144 1.1 jtc return &tm;
1145 1.1 jtc }
1146 1.1 jtc
1147 1.18 kleink /*
1148 1.18 kleink * Re-entrant version of gmtime
1149 1.18 kleink */
1150 1.18 kleink struct tm *
1151 1.18 kleink gmtime_r(timep, tm)
1152 1.18 kleink const time_t * const timep;
1153 1.18 kleink struct tm * tm;
1154 1.18 kleink {
1155 1.18 kleink gmtsub(timep, 0L, tm);
1156 1.18 kleink return tm;
1157 1.18 kleink }
1158 1.18 kleink
1159 1.1 jtc #ifdef STD_INSPIRED
1160 1.1 jtc
1161 1.1 jtc struct tm *
1162 1.1 jtc offtime(timep, offset)
1163 1.1 jtc const time_t * const timep;
1164 1.1 jtc const long offset;
1165 1.1 jtc {
1166 1.1 jtc gmtsub(timep, offset, &tm);
1167 1.1 jtc return &tm;
1168 1.1 jtc }
1169 1.1 jtc
1170 1.1 jtc #endif /* defined STD_INSPIRED */
1171 1.1 jtc
1172 1.1 jtc static void
1173 1.1 jtc timesub(timep, offset, sp, tmp)
1174 1.1 jtc const time_t * const timep;
1175 1.1 jtc const long offset;
1176 1.1 jtc register const struct state * const sp;
1177 1.1 jtc register struct tm * const tmp;
1178 1.1 jtc {
1179 1.1 jtc register const struct lsinfo * lp;
1180 1.1 jtc register long days;
1181 1.1 jtc register long rem;
1182 1.1 jtc register int y;
1183 1.1 jtc register int yleap;
1184 1.1 jtc register const int * ip;
1185 1.1 jtc register long corr;
1186 1.1 jtc register int hit;
1187 1.1 jtc register int i;
1188 1.1 jtc
1189 1.1 jtc corr = 0;
1190 1.1 jtc hit = 0;
1191 1.1 jtc #ifdef ALL_STATE
1192 1.1 jtc i = (sp == NULL) ? 0 : sp->leapcnt;
1193 1.1 jtc #endif /* defined ALL_STATE */
1194 1.1 jtc #ifndef ALL_STATE
1195 1.1 jtc i = sp->leapcnt;
1196 1.1 jtc #endif /* State Farm */
1197 1.1 jtc while (--i >= 0) {
1198 1.1 jtc lp = &sp->lsis[i];
1199 1.1 jtc if (*timep >= lp->ls_trans) {
1200 1.1 jtc if (*timep == lp->ls_trans) {
1201 1.1 jtc hit = ((i == 0 && lp->ls_corr > 0) ||
1202 1.1 jtc lp->ls_corr > sp->lsis[i - 1].ls_corr);
1203 1.1 jtc if (hit)
1204 1.1 jtc while (i > 0 &&
1205 1.1 jtc sp->lsis[i].ls_trans ==
1206 1.1 jtc sp->lsis[i - 1].ls_trans + 1 &&
1207 1.1 jtc sp->lsis[i].ls_corr ==
1208 1.1 jtc sp->lsis[i - 1].ls_corr + 1) {
1209 1.1 jtc ++hit;
1210 1.1 jtc --i;
1211 1.1 jtc }
1212 1.1 jtc }
1213 1.1 jtc corr = lp->ls_corr;
1214 1.1 jtc break;
1215 1.1 jtc }
1216 1.1 jtc }
1217 1.1 jtc days = *timep / SECSPERDAY;
1218 1.1 jtc rem = *timep % SECSPERDAY;
1219 1.1 jtc #ifdef mc68k
1220 1.1 jtc if (*timep == 0x80000000) {
1221 1.1 jtc /*
1222 1.1 jtc ** A 3B1 muffs the division on the most negative number.
1223 1.1 jtc */
1224 1.1 jtc days = -24855;
1225 1.1 jtc rem = -11648;
1226 1.1 jtc }
1227 1.1 jtc #endif /* defined mc68k */
1228 1.1 jtc rem += (offset - corr);
1229 1.1 jtc while (rem < 0) {
1230 1.1 jtc rem += SECSPERDAY;
1231 1.1 jtc --days;
1232 1.1 jtc }
1233 1.1 jtc while (rem >= SECSPERDAY) {
1234 1.1 jtc rem -= SECSPERDAY;
1235 1.1 jtc ++days;
1236 1.1 jtc }
1237 1.1 jtc tmp->tm_hour = (int) (rem / SECSPERHOUR);
1238 1.1 jtc rem = rem % SECSPERHOUR;
1239 1.1 jtc tmp->tm_min = (int) (rem / SECSPERMIN);
1240 1.6 jtc /*
1241 1.6 jtc ** A positive leap second requires a special
1242 1.6 jtc ** representation. This uses "... ??:59:60" et seq.
1243 1.6 jtc */
1244 1.6 jtc tmp->tm_sec = (int) (rem % SECSPERMIN) + hit;
1245 1.1 jtc tmp->tm_wday = (int) ((EPOCH_WDAY + days) % DAYSPERWEEK);
1246 1.1 jtc if (tmp->tm_wday < 0)
1247 1.1 jtc tmp->tm_wday += DAYSPERWEEK;
1248 1.1 jtc y = EPOCH_YEAR;
1249 1.5 jtc #define LEAPS_THRU_END_OF(y) ((y) / 4 - (y) / 100 + (y) / 400)
1250 1.5 jtc while (days < 0 || days >= (long) year_lengths[yleap = isleap(y)]) {
1251 1.5 jtc register int newy;
1252 1.5 jtc
1253 1.5 jtc newy = y + days / DAYSPERNYEAR;
1254 1.5 jtc if (days < 0)
1255 1.5 jtc --newy;
1256 1.5 jtc days -= (newy - y) * DAYSPERNYEAR +
1257 1.5 jtc LEAPS_THRU_END_OF(newy - 1) -
1258 1.5 jtc LEAPS_THRU_END_OF(y - 1);
1259 1.5 jtc y = newy;
1260 1.5 jtc }
1261 1.1 jtc tmp->tm_year = y - TM_YEAR_BASE;
1262 1.1 jtc tmp->tm_yday = (int) days;
1263 1.1 jtc ip = mon_lengths[yleap];
1264 1.1 jtc for (tmp->tm_mon = 0; days >= (long) ip[tmp->tm_mon]; ++(tmp->tm_mon))
1265 1.1 jtc days = days - (long) ip[tmp->tm_mon];
1266 1.1 jtc tmp->tm_mday = (int) (days + 1);
1267 1.1 jtc tmp->tm_isdst = 0;
1268 1.1 jtc #ifdef TM_GMTOFF
1269 1.1 jtc tmp->TM_GMTOFF = offset;
1270 1.1 jtc #endif /* defined TM_GMTOFF */
1271 1.1 jtc }
1272 1.1 jtc
1273 1.1 jtc char *
1274 1.1 jtc ctime(timep)
1275 1.1 jtc const time_t * const timep;
1276 1.1 jtc {
1277 1.1 jtc /*
1278 1.1 jtc ** Section 4.12.3.2 of X3.159-1989 requires that
1279 1.18 kleink ** The ctime function converts the calendar time pointed to by timer
1280 1.1 jtc ** to local time in the form of a string. It is equivalent to
1281 1.1 jtc ** asctime(localtime(timer))
1282 1.1 jtc */
1283 1.1 jtc return asctime(localtime(timep));
1284 1.18 kleink }
1285 1.18 kleink
1286 1.18 kleink char *
1287 1.18 kleink ctime_r(timep, buf)
1288 1.18 kleink const time_t * const timep;
1289 1.18 kleink char * buf;
1290 1.18 kleink {
1291 1.18 kleink struct tm tm;
1292 1.18 kleink
1293 1.18 kleink return asctime_r(localtime_r(timep, &tm), buf);
1294 1.1 jtc }
1295 1.1 jtc
1296 1.1 jtc /*
1297 1.1 jtc ** Adapted from code provided by Robert Elz, who writes:
1298 1.1 jtc ** The "best" way to do mktime I think is based on an idea of Bob
1299 1.7 jtc ** Kridle's (so its said...) from a long time ago.
1300 1.7 jtc ** [kridle (at) xinet.com as of 1996-01-16.]
1301 1.1 jtc ** It does a binary search of the time_t space. Since time_t's are
1302 1.1 jtc ** just 32 bits, its a max of 32 iterations (even at 64 bits it
1303 1.1 jtc ** would still be very reasonable).
1304 1.1 jtc */
1305 1.1 jtc
1306 1.1 jtc #ifndef WRONG
1307 1.1 jtc #define WRONG (-1)
1308 1.1 jtc #endif /* !defined WRONG */
1309 1.1 jtc
1310 1.1 jtc /*
1311 1.1 jtc ** Simplified normalize logic courtesy Paul Eggert (eggert (at) twinsun.com).
1312 1.1 jtc */
1313 1.1 jtc
1314 1.1 jtc static int
1315 1.1 jtc increment_overflow(number, delta)
1316 1.1 jtc int * number;
1317 1.1 jtc int delta;
1318 1.1 jtc {
1319 1.1 jtc int number0;
1320 1.1 jtc
1321 1.1 jtc number0 = *number;
1322 1.1 jtc *number += delta;
1323 1.1 jtc return (*number < number0) != (delta < 0);
1324 1.1 jtc }
1325 1.1 jtc
1326 1.1 jtc static int
1327 1.1 jtc normalize_overflow(tensptr, unitsptr, base)
1328 1.1 jtc int * const tensptr;
1329 1.1 jtc int * const unitsptr;
1330 1.1 jtc const int base;
1331 1.1 jtc {
1332 1.1 jtc register int tensdelta;
1333 1.1 jtc
1334 1.1 jtc tensdelta = (*unitsptr >= 0) ?
1335 1.1 jtc (*unitsptr / base) :
1336 1.1 jtc (-1 - (-1 - *unitsptr) / base);
1337 1.1 jtc *unitsptr -= tensdelta * base;
1338 1.1 jtc return increment_overflow(tensptr, tensdelta);
1339 1.1 jtc }
1340 1.1 jtc
1341 1.1 jtc static int
1342 1.1 jtc tmcomp(atmp, btmp)
1343 1.1 jtc register const struct tm * const atmp;
1344 1.1 jtc register const struct tm * const btmp;
1345 1.1 jtc {
1346 1.1 jtc register int result;
1347 1.1 jtc
1348 1.1 jtc if ((result = (atmp->tm_year - btmp->tm_year)) == 0 &&
1349 1.1 jtc (result = (atmp->tm_mon - btmp->tm_mon)) == 0 &&
1350 1.1 jtc (result = (atmp->tm_mday - btmp->tm_mday)) == 0 &&
1351 1.1 jtc (result = (atmp->tm_hour - btmp->tm_hour)) == 0 &&
1352 1.1 jtc (result = (atmp->tm_min - btmp->tm_min)) == 0)
1353 1.1 jtc result = atmp->tm_sec - btmp->tm_sec;
1354 1.1 jtc return result;
1355 1.1 jtc }
1356 1.1 jtc
1357 1.1 jtc static time_t
1358 1.13 jtc time2sub(tmp, funcp, offset, okayp, do_norm_secs)
1359 1.1 jtc struct tm * const tmp;
1360 1.1 jtc void (* const funcp) P((const time_t*, long, struct tm*));
1361 1.1 jtc const long offset;
1362 1.1 jtc int * const okayp;
1363 1.13 jtc const int do_norm_secs;
1364 1.1 jtc {
1365 1.1 jtc register const struct state * sp;
1366 1.1 jtc register int dir;
1367 1.1 jtc register int bits;
1368 1.1 jtc register int i, j ;
1369 1.1 jtc register int saved_seconds;
1370 1.1 jtc time_t newt;
1371 1.1 jtc time_t t;
1372 1.1 jtc struct tm yourtm, mytm;
1373 1.1 jtc
1374 1.1 jtc *okayp = FALSE;
1375 1.1 jtc yourtm = *tmp;
1376 1.13 jtc if (do_norm_secs) {
1377 1.13 jtc if (normalize_overflow(&yourtm.tm_min, &yourtm.tm_sec,
1378 1.13 jtc SECSPERMIN))
1379 1.13 jtc return WRONG;
1380 1.13 jtc }
1381 1.1 jtc if (normalize_overflow(&yourtm.tm_hour, &yourtm.tm_min, MINSPERHOUR))
1382 1.1 jtc return WRONG;
1383 1.1 jtc if (normalize_overflow(&yourtm.tm_mday, &yourtm.tm_hour, HOURSPERDAY))
1384 1.1 jtc return WRONG;
1385 1.1 jtc if (normalize_overflow(&yourtm.tm_year, &yourtm.tm_mon, MONSPERYEAR))
1386 1.1 jtc return WRONG;
1387 1.1 jtc /*
1388 1.1 jtc ** Turn yourtm.tm_year into an actual year number for now.
1389 1.1 jtc ** It is converted back to an offset from TM_YEAR_BASE later.
1390 1.1 jtc */
1391 1.1 jtc if (increment_overflow(&yourtm.tm_year, TM_YEAR_BASE))
1392 1.1 jtc return WRONG;
1393 1.1 jtc while (yourtm.tm_mday <= 0) {
1394 1.1 jtc if (increment_overflow(&yourtm.tm_year, -1))
1395 1.1 jtc return WRONG;
1396 1.7 jtc i = yourtm.tm_year + (1 < yourtm.tm_mon);
1397 1.7 jtc yourtm.tm_mday += year_lengths[isleap(i)];
1398 1.1 jtc }
1399 1.1 jtc while (yourtm.tm_mday > DAYSPERLYEAR) {
1400 1.7 jtc i = yourtm.tm_year + (1 < yourtm.tm_mon);
1401 1.7 jtc yourtm.tm_mday -= year_lengths[isleap(i)];
1402 1.1 jtc if (increment_overflow(&yourtm.tm_year, 1))
1403 1.1 jtc return WRONG;
1404 1.1 jtc }
1405 1.1 jtc for ( ; ; ) {
1406 1.1 jtc i = mon_lengths[isleap(yourtm.tm_year)][yourtm.tm_mon];
1407 1.1 jtc if (yourtm.tm_mday <= i)
1408 1.1 jtc break;
1409 1.1 jtc yourtm.tm_mday -= i;
1410 1.1 jtc if (++yourtm.tm_mon >= MONSPERYEAR) {
1411 1.1 jtc yourtm.tm_mon = 0;
1412 1.1 jtc if (increment_overflow(&yourtm.tm_year, 1))
1413 1.1 jtc return WRONG;
1414 1.1 jtc }
1415 1.1 jtc }
1416 1.1 jtc if (increment_overflow(&yourtm.tm_year, -TM_YEAR_BASE))
1417 1.1 jtc return WRONG;
1418 1.1 jtc if (yourtm.tm_year + TM_YEAR_BASE < EPOCH_YEAR) {
1419 1.1 jtc /*
1420 1.1 jtc ** We can't set tm_sec to 0, because that might push the
1421 1.1 jtc ** time below the minimum representable time.
1422 1.1 jtc ** Set tm_sec to 59 instead.
1423 1.1 jtc ** This assumes that the minimum representable time is
1424 1.1 jtc ** not in the same minute that a leap second was deleted from,
1425 1.1 jtc ** which is a safer assumption than using 58 would be.
1426 1.1 jtc */
1427 1.1 jtc if (increment_overflow(&yourtm.tm_sec, 1 - SECSPERMIN))
1428 1.1 jtc return WRONG;
1429 1.1 jtc saved_seconds = yourtm.tm_sec;
1430 1.1 jtc yourtm.tm_sec = SECSPERMIN - 1;
1431 1.1 jtc } else {
1432 1.1 jtc saved_seconds = yourtm.tm_sec;
1433 1.1 jtc yourtm.tm_sec = 0;
1434 1.1 jtc }
1435 1.1 jtc /*
1436 1.6 jtc ** Divide the search space in half
1437 1.6 jtc ** (this works whether time_t is signed or unsigned).
1438 1.1 jtc */
1439 1.6 jtc bits = TYPE_BIT(time_t) - 1;
1440 1.1 jtc /*
1441 1.6 jtc ** If time_t is signed, then 0 is just above the median,
1442 1.6 jtc ** assuming two's complement arithmetic.
1443 1.6 jtc ** If time_t is unsigned, then (1 << bits) is just above the median.
1444 1.1 jtc */
1445 1.6 jtc t = TYPE_SIGNED(time_t) ? 0 : (((time_t) 1) << bits);
1446 1.1 jtc for ( ; ; ) {
1447 1.1 jtc (*funcp)(&t, offset, &mytm);
1448 1.1 jtc dir = tmcomp(&mytm, &yourtm);
1449 1.1 jtc if (dir != 0) {
1450 1.1 jtc if (bits-- < 0)
1451 1.1 jtc return WRONG;
1452 1.1 jtc if (bits < 0)
1453 1.6 jtc --t; /* may be needed if new t is minimal */
1454 1.1 jtc else if (dir > 0)
1455 1.6 jtc t -= ((time_t) 1) << bits;
1456 1.6 jtc else t += ((time_t) 1) << bits;
1457 1.1 jtc continue;
1458 1.1 jtc }
1459 1.1 jtc if (yourtm.tm_isdst < 0 || mytm.tm_isdst == yourtm.tm_isdst)
1460 1.1 jtc break;
1461 1.1 jtc /*
1462 1.1 jtc ** Right time, wrong type.
1463 1.1 jtc ** Hunt for right time, right type.
1464 1.1 jtc ** It's okay to guess wrong since the guess
1465 1.1 jtc ** gets checked.
1466 1.1 jtc */
1467 1.1 jtc /*
1468 1.1 jtc ** The (void *) casts are the benefit of SunOS 3.3 on Sun 2's.
1469 1.1 jtc */
1470 1.1 jtc sp = (const struct state *)
1471 1.1 jtc (((void *) funcp == (void *) localsub) ?
1472 1.1 jtc lclptr : gmtptr);
1473 1.1 jtc #ifdef ALL_STATE
1474 1.1 jtc if (sp == NULL)
1475 1.1 jtc return WRONG;
1476 1.1 jtc #endif /* defined ALL_STATE */
1477 1.5 jtc for (i = sp->typecnt - 1; i >= 0; --i) {
1478 1.1 jtc if (sp->ttis[i].tt_isdst != yourtm.tm_isdst)
1479 1.1 jtc continue;
1480 1.5 jtc for (j = sp->typecnt - 1; j >= 0; --j) {
1481 1.1 jtc if (sp->ttis[j].tt_isdst == yourtm.tm_isdst)
1482 1.1 jtc continue;
1483 1.1 jtc newt = t + sp->ttis[j].tt_gmtoff -
1484 1.1 jtc sp->ttis[i].tt_gmtoff;
1485 1.1 jtc (*funcp)(&newt, offset, &mytm);
1486 1.1 jtc if (tmcomp(&mytm, &yourtm) != 0)
1487 1.1 jtc continue;
1488 1.1 jtc if (mytm.tm_isdst != yourtm.tm_isdst)
1489 1.1 jtc continue;
1490 1.1 jtc /*
1491 1.1 jtc ** We have a match.
1492 1.1 jtc */
1493 1.1 jtc t = newt;
1494 1.1 jtc goto label;
1495 1.1 jtc }
1496 1.1 jtc }
1497 1.1 jtc return WRONG;
1498 1.1 jtc }
1499 1.1 jtc label:
1500 1.1 jtc newt = t + saved_seconds;
1501 1.1 jtc if ((newt < t) != (saved_seconds < 0))
1502 1.1 jtc return WRONG;
1503 1.1 jtc t = newt;
1504 1.1 jtc (*funcp)(&t, offset, tmp);
1505 1.1 jtc *okayp = TRUE;
1506 1.1 jtc return t;
1507 1.13 jtc }
1508 1.13 jtc
1509 1.13 jtc static time_t
1510 1.13 jtc time2(tmp, funcp, offset, okayp)
1511 1.13 jtc struct tm * const tmp;
1512 1.13 jtc void (* const funcp) P((const time_t*, long, struct tm*));
1513 1.13 jtc const long offset;
1514 1.13 jtc int * const okayp;
1515 1.13 jtc {
1516 1.13 jtc time_t t;
1517 1.13 jtc
1518 1.13 jtc /*
1519 1.13 jtc ** First try without normalization of seconds
1520 1.13 jtc ** (in case tm_sec contains a value associated with a leap second).
1521 1.13 jtc ** If that fails, try with normalization of seconds.
1522 1.13 jtc */
1523 1.13 jtc t = time2sub(tmp, funcp, offset, okayp, FALSE);
1524 1.13 jtc return *okayp ? t : time2sub(tmp, funcp, offset, okayp, TRUE);
1525 1.1 jtc }
1526 1.1 jtc
1527 1.1 jtc static time_t
1528 1.1 jtc time1(tmp, funcp, offset)
1529 1.1 jtc struct tm * const tmp;
1530 1.5 jtc void (* const funcp) P((const time_t *, long, struct tm *));
1531 1.1 jtc const long offset;
1532 1.1 jtc {
1533 1.1 jtc register time_t t;
1534 1.1 jtc register const struct state * sp;
1535 1.1 jtc register int samei, otheri;
1536 1.1 jtc int okay;
1537 1.1 jtc
1538 1.1 jtc if (tmp->tm_isdst > 1)
1539 1.1 jtc tmp->tm_isdst = 1;
1540 1.1 jtc t = time2(tmp, funcp, offset, &okay);
1541 1.1 jtc #ifdef PCTS
1542 1.1 jtc /*
1543 1.1 jtc ** PCTS code courtesy Grant Sullivan (grant (at) osf.org).
1544 1.1 jtc */
1545 1.1 jtc if (okay)
1546 1.1 jtc return t;
1547 1.1 jtc if (tmp->tm_isdst < 0)
1548 1.1 jtc tmp->tm_isdst = 0; /* reset to std and try again */
1549 1.1 jtc #endif /* defined PCTS */
1550 1.1 jtc #ifndef PCTS
1551 1.1 jtc if (okay || tmp->tm_isdst < 0)
1552 1.1 jtc return t;
1553 1.1 jtc #endif /* !defined PCTS */
1554 1.1 jtc /*
1555 1.1 jtc ** We're supposed to assume that somebody took a time of one type
1556 1.1 jtc ** and did some math on it that yielded a "struct tm" that's bad.
1557 1.1 jtc ** We try to divine the type they started from and adjust to the
1558 1.1 jtc ** type they need.
1559 1.1 jtc */
1560 1.1 jtc /*
1561 1.1 jtc ** The (void *) casts are the benefit of SunOS 3.3 on Sun 2's.
1562 1.1 jtc */
1563 1.1 jtc sp = (const struct state *) (((void *) funcp == (void *) localsub) ?
1564 1.1 jtc lclptr : gmtptr);
1565 1.1 jtc #ifdef ALL_STATE
1566 1.1 jtc if (sp == NULL)
1567 1.1 jtc return WRONG;
1568 1.1 jtc #endif /* defined ALL_STATE */
1569 1.5 jtc for (samei = sp->typecnt - 1; samei >= 0; --samei) {
1570 1.1 jtc if (sp->ttis[samei].tt_isdst != tmp->tm_isdst)
1571 1.1 jtc continue;
1572 1.5 jtc for (otheri = sp->typecnt - 1; otheri >= 0; --otheri) {
1573 1.1 jtc if (sp->ttis[otheri].tt_isdst == tmp->tm_isdst)
1574 1.1 jtc continue;
1575 1.1 jtc tmp->tm_sec += sp->ttis[otheri].tt_gmtoff -
1576 1.1 jtc sp->ttis[samei].tt_gmtoff;
1577 1.1 jtc tmp->tm_isdst = !tmp->tm_isdst;
1578 1.1 jtc t = time2(tmp, funcp, offset, &okay);
1579 1.1 jtc if (okay)
1580 1.1 jtc return t;
1581 1.1 jtc tmp->tm_sec -= sp->ttis[otheri].tt_gmtoff -
1582 1.1 jtc sp->ttis[samei].tt_gmtoff;
1583 1.1 jtc tmp->tm_isdst = !tmp->tm_isdst;
1584 1.1 jtc }
1585 1.1 jtc }
1586 1.1 jtc return WRONG;
1587 1.1 jtc }
1588 1.1 jtc
1589 1.1 jtc time_t
1590 1.1 jtc mktime(tmp)
1591 1.1 jtc struct tm * const tmp;
1592 1.1 jtc {
1593 1.1 jtc tzset();
1594 1.1 jtc return time1(tmp, localsub, 0L);
1595 1.1 jtc }
1596 1.1 jtc
1597 1.1 jtc #ifdef STD_INSPIRED
1598 1.1 jtc
1599 1.1 jtc time_t
1600 1.1 jtc timelocal(tmp)
1601 1.1 jtc struct tm * const tmp;
1602 1.1 jtc {
1603 1.1 jtc tmp->tm_isdst = -1; /* in case it wasn't initialized */
1604 1.1 jtc return mktime(tmp);
1605 1.1 jtc }
1606 1.1 jtc
1607 1.1 jtc time_t
1608 1.1 jtc timegm(tmp)
1609 1.1 jtc struct tm * const tmp;
1610 1.1 jtc {
1611 1.1 jtc tmp->tm_isdst = 0;
1612 1.1 jtc return time1(tmp, gmtsub, 0L);
1613 1.1 jtc }
1614 1.1 jtc
1615 1.1 jtc time_t
1616 1.1 jtc timeoff(tmp, offset)
1617 1.1 jtc struct tm * const tmp;
1618 1.1 jtc const long offset;
1619 1.1 jtc {
1620 1.1 jtc tmp->tm_isdst = 0;
1621 1.1 jtc return time1(tmp, gmtsub, offset);
1622 1.1 jtc }
1623 1.1 jtc
1624 1.1 jtc #endif /* defined STD_INSPIRED */
1625 1.1 jtc
1626 1.1 jtc #ifdef CMUCS
1627 1.1 jtc
1628 1.1 jtc /*
1629 1.1 jtc ** The following is supplied for compatibility with
1630 1.1 jtc ** previous versions of the CMUCS runtime library.
1631 1.1 jtc */
1632 1.1 jtc
1633 1.1 jtc long
1634 1.1 jtc gtime(tmp)
1635 1.1 jtc struct tm * const tmp;
1636 1.1 jtc {
1637 1.1 jtc const time_t t = mktime(tmp);
1638 1.1 jtc
1639 1.1 jtc if (t == WRONG)
1640 1.1 jtc return -1;
1641 1.1 jtc return t;
1642 1.1 jtc }
1643 1.1 jtc
1644 1.1 jtc #endif /* defined CMUCS */
1645 1.1 jtc
1646 1.1 jtc /*
1647 1.1 jtc ** XXX--is the below the right way to conditionalize??
1648 1.1 jtc */
1649 1.1 jtc
1650 1.1 jtc #ifdef STD_INSPIRED
1651 1.1 jtc
1652 1.1 jtc /*
1653 1.1 jtc ** IEEE Std 1003.1-1988 (POSIX) legislates that 536457599
1654 1.14 jtc ** shall correspond to "Wed Dec 31 23:59:59 UTC 1986", which
1655 1.1 jtc ** is not the case if we are accounting for leap seconds.
1656 1.1 jtc ** So, we provide the following conversion routines for use
1657 1.1 jtc ** when exchanging timestamps with POSIX conforming systems.
1658 1.1 jtc */
1659 1.1 jtc
1660 1.1 jtc static long
1661 1.1 jtc leapcorr(timep)
1662 1.1 jtc time_t * timep;
1663 1.1 jtc {
1664 1.1 jtc register struct state * sp;
1665 1.1 jtc register struct lsinfo * lp;
1666 1.1 jtc register int i;
1667 1.1 jtc
1668 1.1 jtc sp = lclptr;
1669 1.1 jtc i = sp->leapcnt;
1670 1.1 jtc while (--i >= 0) {
1671 1.1 jtc lp = &sp->lsis[i];
1672 1.1 jtc if (*timep >= lp->ls_trans)
1673 1.1 jtc return lp->ls_corr;
1674 1.1 jtc }
1675 1.1 jtc return 0;
1676 1.1 jtc }
1677 1.1 jtc
1678 1.1 jtc time_t
1679 1.1 jtc time2posix(t)
1680 1.1 jtc time_t t;
1681 1.1 jtc {
1682 1.1 jtc tzset();
1683 1.1 jtc return t - leapcorr(&t);
1684 1.1 jtc }
1685 1.1 jtc
1686 1.1 jtc time_t
1687 1.1 jtc posix2time(t)
1688 1.1 jtc time_t t;
1689 1.1 jtc {
1690 1.1 jtc time_t x;
1691 1.1 jtc time_t y;
1692 1.1 jtc
1693 1.1 jtc tzset();
1694 1.1 jtc /*
1695 1.1 jtc ** For a positive leap second hit, the result
1696 1.1 jtc ** is not unique. For a negative leap second
1697 1.1 jtc ** hit, the corresponding time doesn't exist,
1698 1.1 jtc ** so we return an adjacent second.
1699 1.1 jtc */
1700 1.1 jtc x = t + leapcorr(&t);
1701 1.1 jtc y = x - leapcorr(&x);
1702 1.1 jtc if (y < t) {
1703 1.1 jtc do {
1704 1.1 jtc x++;
1705 1.1 jtc y = x - leapcorr(&x);
1706 1.1 jtc } while (y < t);
1707 1.1 jtc if (t != y)
1708 1.1 jtc return x - 1;
1709 1.1 jtc } else if (y > t) {
1710 1.1 jtc do {
1711 1.1 jtc --x;
1712 1.1 jtc y = x - leapcorr(&x);
1713 1.1 jtc } while (y > t);
1714 1.1 jtc if (t != y)
1715 1.1 jtc return x + 1;
1716 1.1 jtc }
1717 1.1 jtc return x;
1718 1.1 jtc }
1719 1.1 jtc
1720 1.1 jtc #endif /* defined STD_INSPIRED */
1721