leafnode  1.12.0
About: Leafnode is a store & forward NNTP proxy for small (dialup) sites.
  Fossies Dox: leafnode-1.12.0.tar.xz  ("unofficial" and yet experimental doxygen-generated source code documentation)  

timegm.c
Go to the documentation of this file.
1/* taken from FreeBSD 4 */
2
3/*
4 * Copyright (c) 1997 Kungliga Tekniska Högskolan
5 * (Royal Institute of Technology, Stockholm, Sweden).
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 *
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 *
19 * 3. Neither the name of the Institute nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36#include "leafnode.h"
37
38#ifndef HAVE_TIMEGM
39
40#include <time.h>
41
42static int
43is_leap(unsigned y)
44{
45 y += 1900;
46 return (y % 4) == 0 && ((y % 100) != 0 || (y % 400) == 0);
47}
48
49time_t
50timegm (struct tm *tm)
51{
52 static const unsigned ndays[2][12] ={
53 {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
54 {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
55 time_t res = 0;
56 int i;
57
58 for (i = 70; i < tm->tm_year; ++i)
59 res += is_leap(i) ? 366 : 365;
60
61 for (i = 0; i < tm->tm_mon; ++i)
62 res += ndays[is_leap(tm->tm_year)][i];
63 res += tm->tm_mday - 1;
64 res *= 24;
65 res += tm->tm_hour;
66 res *= 60;
67 res += tm->tm_min;
68 res *= 60;
69 res += tm->tm_sec;
70 return res;
71}
72
73#endif /* HAVE_TIMEGM */
time_t timegm(struct tm *tm)
Definition: timegm.c:50
static int is_leap(unsigned y)
Definition: timegm.c:43