1b528cefcSMark Murray /*
2*ae771770SStanislav Sedov * Copyright (c) 1997 Kungliga Tekniska Högskolan
3b528cefcSMark Murray * (Royal Institute of Technology, Stockholm, Sweden).
4b528cefcSMark Murray * All rights reserved.
5b528cefcSMark Murray *
6b528cefcSMark Murray * Redistribution and use in source and binary forms, with or without
7b528cefcSMark Murray * modification, are permitted provided that the following conditions
8b528cefcSMark Murray * are met:
9b528cefcSMark Murray *
10b528cefcSMark Murray * 1. Redistributions of source code must retain the above copyright
11b528cefcSMark Murray * notice, this list of conditions and the following disclaimer.
12b528cefcSMark Murray *
13b528cefcSMark Murray * 2. Redistributions in binary form must reproduce the above copyright
14b528cefcSMark Murray * notice, this list of conditions and the following disclaimer in the
15b528cefcSMark Murray * documentation and/or other materials provided with the distribution.
16b528cefcSMark Murray *
17b528cefcSMark Murray * 3. Neither the name of the Institute nor the names of its contributors
18b528cefcSMark Murray * may be used to endorse or promote products derived from this software
19b528cefcSMark Murray * without specific prior written permission.
20b528cefcSMark Murray *
21b528cefcSMark Murray * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22b528cefcSMark Murray * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23b528cefcSMark Murray * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24b528cefcSMark Murray * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25b528cefcSMark Murray * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26b528cefcSMark Murray * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27b528cefcSMark Murray * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28b528cefcSMark Murray * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29b528cefcSMark Murray * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30b528cefcSMark Murray * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31b528cefcSMark Murray * SUCH DAMAGE.
32b528cefcSMark Murray */
33b528cefcSMark Murray
34b528cefcSMark Murray #include "der_locl.h"
35b528cefcSMark Murray
36*ae771770SStanislav Sedov #define ASN1_MAX_YEAR 2000
37b528cefcSMark Murray
38b528cefcSMark Murray static int
is_leap(unsigned y)39b528cefcSMark Murray is_leap(unsigned y)
40b528cefcSMark Murray {
41b528cefcSMark Murray y += 1900;
42b528cefcSMark Murray return (y % 4) == 0 && ((y % 100) != 0 || (y % 400) == 0);
43b528cefcSMark Murray }
44b528cefcSMark Murray
45*ae771770SStanislav Sedov static const unsigned ndays[2][12] ={
46*ae771770SStanislav Sedov {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
47*ae771770SStanislav Sedov {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
48*ae771770SStanislav Sedov
49c19800e8SDoug Rabson /*
50c19800e8SDoug Rabson * This is a simplifed version of timegm(3) that doesn't accept out of
51c19800e8SDoug Rabson * bound values that timegm(3) normally accepts but those are not
52c19800e8SDoug Rabson * valid in asn1 encodings.
53c19800e8SDoug Rabson */
54c19800e8SDoug Rabson
55b528cefcSMark Murray time_t
_der_timegm(struct tm * tm)56c19800e8SDoug Rabson _der_timegm (struct tm *tm)
57b528cefcSMark Murray {
58b528cefcSMark Murray time_t res = 0;
59*ae771770SStanislav Sedov int i;
60*ae771770SStanislav Sedov
61*ae771770SStanislav Sedov /*
62*ae771770SStanislav Sedov * See comment in _der_gmtime
63*ae771770SStanislav Sedov */
64*ae771770SStanislav Sedov if (tm->tm_year > ASN1_MAX_YEAR)
65*ae771770SStanislav Sedov return 0;
66b528cefcSMark Murray
67c19800e8SDoug Rabson if (tm->tm_year < 0)
68c19800e8SDoug Rabson return -1;
69c19800e8SDoug Rabson if (tm->tm_mon < 0 || tm->tm_mon > 11)
70c19800e8SDoug Rabson return -1;
71*ae771770SStanislav Sedov if (tm->tm_mday < 1 || tm->tm_mday > (int)ndays[is_leap(tm->tm_year)][tm->tm_mon])
72c19800e8SDoug Rabson return -1;
73c19800e8SDoug Rabson if (tm->tm_hour < 0 || tm->tm_hour > 23)
74c19800e8SDoug Rabson return -1;
75c19800e8SDoug Rabson if (tm->tm_min < 0 || tm->tm_min > 59)
76c19800e8SDoug Rabson return -1;
77c19800e8SDoug Rabson if (tm->tm_sec < 0 || tm->tm_sec > 59)
78c19800e8SDoug Rabson return -1;
79c19800e8SDoug Rabson
80b528cefcSMark Murray for (i = 70; i < tm->tm_year; ++i)
81b528cefcSMark Murray res += is_leap(i) ? 366 : 365;
82b528cefcSMark Murray
83b528cefcSMark Murray for (i = 0; i < tm->tm_mon; ++i)
84b528cefcSMark Murray res += ndays[is_leap(tm->tm_year)][i];
85b528cefcSMark Murray res += tm->tm_mday - 1;
86b528cefcSMark Murray res *= 24;
87b528cefcSMark Murray res += tm->tm_hour;
88b528cefcSMark Murray res *= 60;
89b528cefcSMark Murray res += tm->tm_min;
90b528cefcSMark Murray res *= 60;
91b528cefcSMark Murray res += tm->tm_sec;
92b528cefcSMark Murray return res;
93b528cefcSMark Murray }
94*ae771770SStanislav Sedov
95*ae771770SStanislav Sedov struct tm *
_der_gmtime(time_t t,struct tm * tm)96*ae771770SStanislav Sedov _der_gmtime(time_t t, struct tm *tm)
97*ae771770SStanislav Sedov {
98*ae771770SStanislav Sedov time_t secday = t % (3600 * 24);
99*ae771770SStanislav Sedov time_t days = t / (3600 * 24);
100*ae771770SStanislav Sedov
101*ae771770SStanislav Sedov memset(tm, 0, sizeof(*tm));
102*ae771770SStanislav Sedov
103*ae771770SStanislav Sedov tm->tm_sec = secday % 60;
104*ae771770SStanislav Sedov tm->tm_min = (secday % 3600) / 60;
105*ae771770SStanislav Sedov tm->tm_hour = secday / 3600;
106*ae771770SStanislav Sedov
107*ae771770SStanislav Sedov /*
108*ae771770SStanislav Sedov * Refuse to calculate time ~ 2000 years into the future, this is
109*ae771770SStanislav Sedov * not possible for systems where time_t is a int32_t, however,
110*ae771770SStanislav Sedov * when time_t is a int64_t, that can happen, and this becomes a
111*ae771770SStanislav Sedov * denial of sevice.
112*ae771770SStanislav Sedov */
113*ae771770SStanislav Sedov if (days > (ASN1_MAX_YEAR * 365))
114*ae771770SStanislav Sedov return NULL;
115*ae771770SStanislav Sedov
116*ae771770SStanislav Sedov tm->tm_year = 70;
117*ae771770SStanislav Sedov while(1) {
118*ae771770SStanislav Sedov unsigned dayinyear = (is_leap(tm->tm_year) ? 366 : 365);
119*ae771770SStanislav Sedov if (days < dayinyear)
120*ae771770SStanislav Sedov break;
121*ae771770SStanislav Sedov tm->tm_year += 1;
122*ae771770SStanislav Sedov days -= dayinyear;
123*ae771770SStanislav Sedov }
124*ae771770SStanislav Sedov tm->tm_mon = 0;
125*ae771770SStanislav Sedov
126*ae771770SStanislav Sedov while (1) {
127*ae771770SStanislav Sedov unsigned daysinmonth = ndays[is_leap(tm->tm_year)][tm->tm_mon];
128*ae771770SStanislav Sedov if (days < daysinmonth)
129*ae771770SStanislav Sedov break;
130*ae771770SStanislav Sedov days -= daysinmonth;
131*ae771770SStanislav Sedov tm->tm_mon++;
132*ae771770SStanislav Sedov }
133*ae771770SStanislav Sedov tm->tm_mday = days + 1;
134*ae771770SStanislav Sedov
135*ae771770SStanislav Sedov return tm;
136*ae771770SStanislav Sedov }
137