3 * Wolfgang Denk, DENX Software Engineering, wd@denx.de.
5 * See file CREDITS for list of people who contributed to this
8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License as
10 * published by the Free Software Foundation; either version 2 of
11 * the License, or (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
25 * Date & Time support for Philips PCF8563 RTC
32 #if (CONFIG_COMMANDS & CFG_CMD_DATE) || defined(CONFIG_TIMESTAMP)
35 #define STARTOFTIME 1970
37 #define SECYR (SECDAY * 365)
38 #define leapyear(year) ((year) % 4 == 0)
39 #define days_in_year(a) (leapyear(a) ? 366 : 365)
40 #define days_in_month(a) (month_days[(a) - 1])
42 static int month_days
[12] = {
43 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
47 * This only works for the Gregorian calendar - i.e. after 1752 (in the UK)
49 void GregorianDay(struct rtc_time
* tm
)
54 int MonthOffset
[] = { 0,31,59,90,120,151,181,212,243,273,304,334 };
56 lastYear
=tm
->tm_year
-1;
59 * Number of leap corrections to apply up to end of last year
61 leapsToDate
= lastYear
/4 - lastYear
/100 + lastYear
/400;
64 * This year is a leap year if it is divisible by 4 except when it is
65 * divisible by 100 unless it is divisible by 400
67 * e.g. 1904 was a leap year, 1900 was not, 1996 is, and 2000 will be
69 if((tm
->tm_year
%4==0) &&
70 ((tm
->tm_year
%100!=0) || (tm
->tm_year
%400==0)) &&
73 * We are past Feb. 29 in a leap year
80 day
+= lastYear
*365 + leapsToDate
+ MonthOffset
[tm
->tm_mon
-1] + tm
->tm_mday
;
85 void to_tm(int tim
, struct rtc_time
* tm
)
88 register long hms
, day
;
93 /* Hours, minutes, seconds are easy */
94 tm
->tm_hour
= hms
/ 3600;
95 tm
->tm_min
= (hms
% 3600) / 60;
96 tm
->tm_sec
= (hms
% 3600) % 60;
98 /* Number of years in days */
99 for (i
= STARTOFTIME
; day
>= days_in_year(i
); i
++) {
100 day
-= days_in_year(i
);
104 /* Number of months in days left */
105 if (leapyear(tm
->tm_year
)) {
106 days_in_month(FEBRUARY
) = 29;
108 for (i
= 1; day
>= days_in_month(i
); i
++) {
109 day
-= days_in_month(i
);
111 days_in_month(FEBRUARY
) = 28;
114 /* Days are what is left over (+1) from all that. */
115 tm
->tm_mday
= day
+ 1;
118 * Determine the day of week
123 /* Converts Gregorian date to seconds since 1970-01-01 00:00:00.
124 * Assumes input in normal date format, i.e. 1980-12-31 23:59:59
125 * => year=1980, mon=12, day=31, hour=23, min=59, sec=59.
127 * [For the Julian calendar (which was used in Russia before 1917,
128 * Britain & colonies before 1752, anywhere else before 1582,
129 * and is still in use by some communities) leave out the
130 * -year/100+year/400 terms, and add 10.]
132 * This algorithm was first published by Gauss (I think).
134 * WARNING: this function will overflow on 2106-02-07 06:28:16 on
135 * machines were long is 32-bit! (However, as time_t is signed, we
136 * will already get problems at other places on 2038-01-19 03:14:08)
139 mktime (unsigned int year
, unsigned int mon
,
140 unsigned int day
, unsigned int hour
,
141 unsigned int min
, unsigned int sec
)
143 if (0 >= (int) (mon
-= 2)) { /* 1..12 -> 11,12,1..10 */
144 mon
+= 12; /* Puts Feb last since it has leap day */
149 (unsigned long) (year
/4 - year
/100 + year
/400 + 367*mon
/12 + day
) +
151 )*24 + hour
/* now have hours */
152 )*60 + min
/* now have minutes */
153 )*60 + sec
; /* finally seconds */
156 #endif /* CFG_CMD_DATE */