50 {2015, 7, 1, 0, 0, 0, -17},
51 {2012, 7, 1, 0, 0, 0, -16},
52 {2009, 1, 1, 0, 0, 0, -15},
53 {2006, 1, 1, 0, 0, 0, -14},
54 {1999, 1, 1, 0, 0, 0, -13},
55 {1997, 7, 1, 0, 0, 0, -12},
56 {1996, 1, 1, 0, 0, 0, -11},
57 {1994, 7, 1, 0, 0, 0, -10},
58 {1993, 7, 1, 0, 0, 0, -9},
59 {1992, 7, 1, 0, 0, 0, -8},
60 {1991, 1, 1, 0, 0, 0, -7},
61 {1990, 1, 1, 0, 0, 0, -6},
62 {1988, 1, 1, 0, 0, 0, -5},
63 {1985, 7, 1, 0, 0, 0, -4},
64 {1983, 7, 1, 0, 0, 0, -3},
65 {1982, 7, 1, 0, 0, 0, -2},
66 {1981, 7, 1, 0, 0, 0, -1},
114 const int doy[] = {1, 32, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335};
116 int days, sec, year = (int)ep[0], mon = (
int)ep[1], day = (int)ep[2];
118 if (year < 1970 || 2099 < year || mon < 1 || 12 < mon) {
123 days = (year - 1970) * 365 + (year - 1969) / 4 + doy[mon - 1] + day - 2 + (year % 4 == 0 && mon >= 3 ? 1 : 0);
124 sec = (int)floor(ep[5]);
125 time.
time = (time_t)days * 86400 + (
int)ep[3] * 3600 + (int)ep[4] * 60 + sec;
126 time.
sec = ep[5] - sec;
138 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,
139 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
140 int days, sec, mon, day;
143 days = (int)(t.
time / 86400);
144 sec = (int)(t.
time - (time_t)days * 86400);
145 for (day = days % 1461, mon = 0; mon < 48; mon++) {
146 if (day >= mday[mon]) {
152 ep[0] = 1970 + days / 1461 * 4 + mon / 12;
153 ep[1] = mon % 12 + 1;
156 ep[4] = sec % 3600 / 60;
157 ep[5] = sec % 60 + t.
sec;