63 lines
1.4 KiB
C
63 lines
1.4 KiB
C
/* $Header$ */
|
|
#include <time.h>
|
|
|
|
#define LEAPYEAR(year) (!((year) % 4) && (((year) % 100) || !((year) % 400)))
|
|
#define YEARSIZE(year) (LEAPYEAR(year) ? 366 : 365)
|
|
#define FIRSTSUNDAY(t) (((t)->tm_yday - (t)->tm_wday + 420) % 7)
|
|
|
|
static int
|
|
last_sunday(d, t)
|
|
register int d;
|
|
register struct tm *t;
|
|
{
|
|
int first = FIRSTSUNDAY(t);
|
|
|
|
if (d >= 58 && LEAPYEAR(t->tm_year+1900)) d++;
|
|
if (d < first) return first;
|
|
return d - (d - first) % 7;
|
|
}
|
|
|
|
dysize(y)
|
|
{
|
|
/* compatibility */
|
|
return YEARSIZE(y);
|
|
}
|
|
|
|
extern struct tm *gmtime();
|
|
|
|
struct tm *
|
|
localtime(clock)
|
|
long *clock;
|
|
{
|
|
register struct tm *gmt;
|
|
long cl;
|
|
int begindst, enddst;
|
|
extern int __daylight;
|
|
extern long __timezone;
|
|
|
|
tzset();
|
|
cl = *clock - __timezone;
|
|
gmt = gmtime(&cl);
|
|
if (__daylight) {
|
|
/* daylight saving time.
|
|
Unfortunately, rules differ for different countries.
|
|
Implemented here are heuristics that got it right
|
|
in Holland, over the last couple of years.
|
|
Of course, there is no algorithm. It is all
|
|
politics ...
|
|
*/
|
|
begindst = last_sunday(89, gmt); /* last Sun before Apr */
|
|
enddst = last_sunday(272, gmt); /* last Sun in Sep */
|
|
if ((gmt->tm_yday>begindst ||
|
|
(gmt->tm_yday==begindst && gmt->tm_hour>=2)) &&
|
|
(gmt->tm_yday<enddst ||
|
|
(gmt->tm_yday==enddst && gmt->tm_hour<3))) {
|
|
/* it all happens between 2 and 3 */
|
|
cl += 1*60*60;
|
|
gmt = gmtime(&cl);
|
|
gmt->tm_isdst++;
|
|
}
|
|
}
|
|
return gmt;
|
|
}
|