1178825Sdfr/*
2233294Sstas * Copyright (c) 1997, 2006 Kungliga Tekniska H��gskolan
3233294Sstas * (Royal Institute of Technology, Stockholm, Sweden).
4233294Sstas * All rights reserved.
5178825Sdfr *
6233294Sstas * Redistribution and use in source and binary forms, with or without
7233294Sstas * modification, are permitted provided that the following conditions
8233294Sstas * are met:
9178825Sdfr *
10233294Sstas * 1. Redistributions of source code must retain the above copyright
11233294Sstas *    notice, this list of conditions and the following disclaimer.
12178825Sdfr *
13233294Sstas * 2. Redistributions in binary form must reproduce the above copyright
14233294Sstas *    notice, this list of conditions and the following disclaimer in the
15233294Sstas *    documentation and/or other materials provided with the distribution.
16178825Sdfr *
17233294Sstas * 3. Neither the name of the Institute nor the names of its contributors
18233294Sstas *    may be used to endorse or promote products derived from this software
19233294Sstas *    without specific prior written permission.
20178825Sdfr *
21233294Sstas * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22233294Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23233294Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24233294Sstas * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25233294Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26233294Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27233294Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28233294Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29233294Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30233294Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31233294Sstas * SUCH DAMAGE.
32178825Sdfr */
33178825Sdfr
34178825Sdfr#include <config.h>
35178825Sdfr
36178825Sdfr#include "roken.h"
37178825Sdfr
38178825Sdfrstatic int
39178825Sdfris_leap(unsigned y)
40178825Sdfr{
41178825Sdfr    y += 1900;
42178825Sdfr    return (y % 4) == 0 && ((y % 100) != 0 || (y % 400) == 0);
43178825Sdfr}
44178825Sdfr
45233294Sstas/*
46178825Sdfr * XXX This is a simplifed version of timegm, it needs to support out of
47178825Sdfr * bounds values.
48178825Sdfr */
49178825Sdfr
50178825Sdfrtime_t
51178825Sdfrrk_timegm (struct tm *tm)
52178825Sdfr{
53178825Sdfr  static const unsigned ndays[2][12] ={
54178825Sdfr    {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
55178825Sdfr    {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
56178825Sdfr  time_t res = 0;
57178825Sdfr  unsigned i;
58178825Sdfr
59233294Sstas  if (tm->tm_year < 0)
60178825Sdfr      return -1;
61233294Sstas  if (tm->tm_mon < 0 || tm->tm_mon > 11)
62178825Sdfr      return -1;
63178825Sdfr  if (tm->tm_mday < 1 || tm->tm_mday > ndays[is_leap(tm->tm_year)][tm->tm_mon])
64178825Sdfr      return -1;
65233294Sstas  if (tm->tm_hour < 0 || tm->tm_hour > 23)
66178825Sdfr      return -1;
67233294Sstas  if (tm->tm_min < 0 || tm->tm_min > 59)
68178825Sdfr      return -1;
69233294Sstas  if (tm->tm_sec < 0 || tm->tm_sec > 59)
70178825Sdfr      return -1;
71178825Sdfr
72178825Sdfr  for (i = 70; i < tm->tm_year; ++i)
73178825Sdfr    res += is_leap(i) ? 366 : 365;
74178825Sdfr
75178825Sdfr  for (i = 0; i < tm->tm_mon; ++i)
76178825Sdfr    res += ndays[is_leap(tm->tm_year)][i];
77178825Sdfr  res += tm->tm_mday - 1;
78178825Sdfr  res *= 24;
79178825Sdfr  res += tm->tm_hour;
80178825Sdfr  res *= 60;
81178825Sdfr  res += tm->tm_min;
82178825Sdfr  res *= 60;
83178825Sdfr  res += tm->tm_sec;
84178825Sdfr  return res;
85178825Sdfr}
86