Annotation of prex-old/usr/lib/libc/time/gmtime_r.c, Revision 1.1.1.1
1.1 nbrk 1: /*
2: * Copyright (c) 2005, Kohsuke Ohtani
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms, with or without
6: * modification, are permitted provided that the following conditions
7: * are met:
8: * 1. Redistributions of source code must retain the above copyright
9: * notice, this list of conditions and the following disclaimer.
10: * 2. Redistributions in binary form must reproduce the above copyright
11: * notice, this list of conditions and the following disclaimer in the
12: * documentation and/or other materials provided with the distribution.
13: * 3. Neither the name of the author nor the names of any co-contributors
14: * may be used to endorse or promote products derived from this software
15: * without specific prior written permission.
16: *
17: * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20: * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27: * SUCH DAMAGE.
28: */
29:
30: #include <sys/time.h>
31: #include <tzfile.h>
32:
33: static const int daysinmonth[] =
34: { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
35:
36: static int
37: is_leap(int year)
38: {
39: return (isleap(year) ? 1 : 0);
40: }
41:
42: struct tm *
43: gmtime_r(const time_t *timep, struct tm *tmp)
44: {
45: time_t t;
46: int days, year, mon;
47: int i;
48:
49: t = *timep;
50: days = t / 60 / 60 / 24;
51:
52: for (year = 1970, i = DAYSPERNYEAR + is_leap(year);
53: days >= i;
54: year++, i = DAYSPERNYEAR + is_leap(year))
55: days -= i;
56:
57: tmp->tm_year = year - 1900;
58: tmp->tm_yday = days;
59:
60: for (mon = 0; ; mon++) {
61: i = daysinmonth[mon];
62: if (mon == 1 && is_leap(year))
63: i++;
64: if (days < i)
65: break;
66: days -= i;
67: }
68: tmp->tm_mon = mon;
69: tmp->tm_mday = days + 1;
70: tmp->tm_wday = (int) ((1970 + days) % DAYSPERWEEK);
71:
72: tmp->tm_sec = t % 60;
73: tmp->tm_min = (t / 60) % 60;
74: tmp->tm_hour = (t / 60 / 60) % 24;
75: tmp->tm_isdst = 0;
76: return tmp;
77: }
CVSweb