2
* Copyright (c) 1997 Kungliga Tekniska Högskolan
3
* (Royal Institute of Technology, Stockholm, Sweden).
6
* Redistribution and use in source and binary forms, with or without
7
* modification, are permitted provided that the following conditions
10
* 1. Redistributions of source code must retain the above copyright
11
* notice, this list of conditions and the following disclaimer.
13
* 2. Redistributions in binary form must reproduce the above copyright
14
* notice, this list of conditions and the following disclaimer in the
15
* documentation and/or other materials provided with the distribution.
17
* 3. Neither the name of the Institute nor the names of its contributors
18
* may be used to endorse or promote products derived from this software
19
* without specific prior written permission.
21
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42
return (y % 4) == 0 && ((y % 100) != 0 || (y % 400) == 0);
46
* This is a simplifed version of timegm(3) that doesn't accept out of
47
* bound values that timegm(3) normally accepts but those are not
48
* valid in asn1 encodings.
52
_der_timegm (struct tm *tm)
54
static const unsigned ndays[2][12] ={
55
{31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
56
{31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
62
if (tm->tm_mon < 0 || tm->tm_mon > 11)
64
if (tm->tm_mday < 1 || tm->tm_mday > ndays[is_leap(tm->tm_year)][tm->tm_mon])
66
if (tm->tm_hour < 0 || tm->tm_hour > 23)
68
if (tm->tm_min < 0 || tm->tm_min > 59)
70
if (tm->tm_sec < 0 || tm->tm_sec > 59)
73
for (i = 70; i < tm->tm_year; ++i)
74
res += is_leap(i) ? 366 : 365;
76
for (i = 0; i < tm->tm_mon; ++i)
77
res += ndays[is_leap(tm->tm_year)][i];
78
res += tm->tm_mday - 1;