1168457Skato/*
264123Skato * Copyright (c) 1997 Kungliga Tekniska H��gskolan
364123Skato * (Royal Institute of Technology, Stockholm, Sweden).
464123Skato * All rights reserved.
564123Skato *
664123Skato * Redistribution and use in source and binary forms, with or without
764123Skato * modification, are permitted provided that the following conditions
864123Skato * are met:
964123Skato *
1064123Skato * 1. Redistributions of source code must retain the above copyright
1164123Skato *    notice, this list of conditions and the following disclaimer.
1264123Skato *
1364123Skato * 2. Redistributions in binary form must reproduce the above copyright
1464123Skato *    notice, this list of conditions and the following disclaimer in the
1564123Skato *    documentation and/or other materials provided with the distribution.
1664123Skato *
1764123Skato * 3. Neither the name of the Institute nor the names of its contributors
1864123Skato *    may be used to endorse or promote products derived from this software
1964123Skato *    without specific prior written permission.
2064123Skato *
2164123Skato * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
2264123Skato * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2364123Skato * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2464123Skato * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
2564123Skato * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2664123Skato * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2764123Skato * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2864123Skato * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2964123Skato * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3064123Skato * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3164123Skato * SUCH DAMAGE.
3264123Skato */
3364123Skato
3464123Skato#include "der_locl.h"
35114521Skato
36114521Skato#define ASN1_MAX_YEAR	2000
37168457Skato
38168457Skatostatic int
39168457Skatois_leap(unsigned y)
40168457Skato{
41168457Skato    y += 1900;
42168457Skato    return (y % 4) == 0 && ((y % 100) != 0 || (y % 400) == 0);
43168457Skato}
44114521Skato
45114521Skatostatic const unsigned ndays[2][12] ={
46168457Skato    {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
47168457Skato    {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
48168457Skato
49168457Skato/*
5064123Skato * This is a simplifed version of timegm(3) that doesn't accept out of
5164123Skato * bound values that timegm(3) normally accepts but those are not
5264123Skato * valid in asn1 encodings.
5364123Skato */
5464123Skato
5564123Skatotime_t
5664123Skato_der_timegm (struct tm *tm)
5764123Skato{
5864123Skato  time_t res = 0;
5964123Skato  int i;
6064123Skato
6164123Skato  /*
6264123Skato   * See comment in _der_gmtime
6364123Skato   */
6464123Skato  if (tm->tm_year > ASN1_MAX_YEAR)
6564123Skato      return 0;
6664123Skato
6764123Skato  if (tm->tm_year < 0)
6864123Skato      return -1;
6964123Skato  if (tm->tm_mon < 0 || tm->tm_mon > 11)
7064123Skato      return -1;
7164123Skato  if (tm->tm_mday < 1 || tm->tm_mday > (int)ndays[is_leap(tm->tm_year)][tm->tm_mon])
7264123Skato      return -1;
7364123Skato  if (tm->tm_hour < 0 || tm->tm_hour > 23)
74      return -1;
75  if (tm->tm_min < 0 || tm->tm_min > 59)
76      return -1;
77  if (tm->tm_sec < 0 || tm->tm_sec > 59)
78      return -1;
79
80  for (i = 70; i < tm->tm_year; ++i)
81    res += is_leap(i) ? 366 : 365;
82
83  for (i = 0; i < tm->tm_mon; ++i)
84    res += ndays[is_leap(tm->tm_year)][i];
85  res += tm->tm_mday - 1;
86  res *= 24;
87  res += tm->tm_hour;
88  res *= 60;
89  res += tm->tm_min;
90  res *= 60;
91  res += tm->tm_sec;
92  return res;
93}
94
95struct tm *
96_der_gmtime(time_t t, struct tm *tm)
97{
98    time_t secday = t % (3600 * 24);
99    time_t days = t / (3600 * 24);
100
101    memset(tm, 0, sizeof(*tm));
102
103    tm->tm_sec = secday % 60;
104    tm->tm_min = (secday % 3600) / 60;
105    tm->tm_hour = secday / 3600;
106
107    /*
108     * Refuse to calculate time ~ 2000 years into the future, this is
109     * not possible for systems where time_t is a int32_t, however,
110     * when time_t is a int64_t, that can happen, and this becomes a
111     * denial of sevice.
112     */
113    if (days > (ASN1_MAX_YEAR * 365))
114	return NULL;
115
116    tm->tm_year = 70;
117    while(1) {
118	unsigned dayinyear = (is_leap(tm->tm_year) ? 366 : 365);
119	if (days < dayinyear)
120	    break;
121	tm->tm_year += 1;
122	days -= dayinyear;
123    }
124    tm->tm_mon = 0;
125
126    while (1) {
127	unsigned daysinmonth = ndays[is_leap(tm->tm_year)][tm->tm_mon];
128	if (days < daysinmonth)
129	    break;
130	days -= daysinmonth;
131	tm->tm_mon++;
132    }
133    tm->tm_mday = days + 1;
134
135    return tm;
136}
137