xref: /openbmc/u-boot/drivers/rtc/date.c (revision 19ee1fae)
1 // SPDX-License-Identifier: GPL-2.0+
2 /*
3  * (C) Copyright 2001
4  * Wolfgang Denk, DENX Software Engineering, wd@denx.de.
5  */
6 
7 #include <common.h>
8 #include <command.h>
9 #include <errno.h>
10 #include <rtc.h>
11 
12 #if defined(CONFIG_CMD_DATE) || defined(CONFIG_TIMESTAMP)
13 
14 #define FEBRUARY		2
15 #define	STARTOFTIME		1970
16 #define SECDAY			86400L
17 #define SECYR			(SECDAY * 365)
18 #define	leapyear(year)		((year) % 4 == 0)
19 #define	days_in_year(a)		(leapyear(a) ? 366 : 365)
20 #define	days_in_month(a)	(month_days[(a) - 1])
21 
22 static int month_offset[] = {
23 	0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334
24 };
25 
26 /*
27  * This only works for the Gregorian calendar - i.e. after 1752 (in the UK)
28  */
29 int rtc_calc_weekday(struct rtc_time *tm)
30 {
31 	int leaps_to_date;
32 	int last_year;
33 	int day;
34 
35 	if (tm->tm_year < 1753)
36 		return -1;
37 	last_year = tm->tm_year - 1;
38 
39 	/* Number of leap corrections to apply up to end of last year */
40 	leaps_to_date = last_year / 4 - last_year / 100 + last_year / 400;
41 
42 	/*
43 	 * This year is a leap year if it is divisible by 4 except when it is
44 	 * divisible by 100 unless it is divisible by 400
45 	 *
46 	 * e.g. 1904 was a leap year, 1900 was not, 1996 is, and 2000 is.
47 	 */
48 	if (tm->tm_year % 4 == 0 &&
49 	    ((tm->tm_year % 100 != 0) || (tm->tm_year % 400 == 0)) &&
50 	    tm->tm_mon > 2) {
51 		/* We are past Feb. 29 in a leap year */
52 		day = 1;
53 	} else {
54 		day = 0;
55 	}
56 
57 	day += last_year * 365 + leaps_to_date + month_offset[tm->tm_mon - 1] +
58 			tm->tm_mday;
59 	tm->tm_wday = day % 7;
60 
61 	return 0;
62 }
63 
64 /*
65  * Converts Gregorian date to seconds since 1970-01-01 00:00:00.
66  * Assumes input in normal date format, i.e. 1980-12-31 23:59:59
67  * => year=1980, mon=12, day=31, hour=23, min=59, sec=59.
68  *
69  * [For the Julian calendar (which was used in Russia before 1917,
70  * Britain & colonies before 1752, anywhere else before 1582,
71  * and is still in use by some communities) leave out the
72  * -year / 100 + year / 400 terms, and add 10.]
73  *
74  * This algorithm was first published by Gauss (I think).
75  *
76  * WARNING: this function will overflow on 2106-02-07 06:28:16 on
77  * machines where long is 32-bit! (However, as time_t is signed, we
78  * will already get problems at other places on 2038-01-19 03:14:08)
79  */
80 unsigned long rtc_mktime(const struct rtc_time *tm)
81 {
82 	int mon = tm->tm_mon;
83 	int year = tm->tm_year;
84 	int days, hours;
85 
86 	mon -= 2;
87 	if (0 >= (int)mon) {	/* 1..12 -> 11, 12, 1..10 */
88 		mon += 12;	/* Puts Feb last since it has leap day */
89 		year -= 1;
90 	}
91 
92 	days = (unsigned long)(year / 4 - year / 100 + year / 400 +
93 			367 * mon / 12 + tm->tm_mday) +
94 			year * 365 - 719499;
95 	hours = days * 24 + tm->tm_hour;
96 	return (hours * 60 + tm->tm_min) * 60 + tm->tm_sec;
97 }
98 
99 #endif
100