clock_subr.c revision 1.17 1 1.17 martin /* $NetBSD: clock_subr.c,v 1.17 2014/08/31 08:54:40 martin Exp $ */
2 1.1 gwr
3 1.1 gwr /*
4 1.16 rmind * Copyright (c) 1988 University of Utah.
5 1.1 gwr * Copyright (c) 1982, 1990, 1993
6 1.1 gwr * The Regents of the University of California. All rights reserved.
7 1.1 gwr *
8 1.1 gwr * This code is derived from software contributed to Berkeley by
9 1.1 gwr * the Systems Programming Group of the University of Utah Computer
10 1.1 gwr * Science Department.
11 1.1 gwr *
12 1.1 gwr * Redistribution and use in source and binary forms, with or without
13 1.1 gwr * modification, are permitted provided that the following conditions
14 1.1 gwr * are met:
15 1.1 gwr * 1. Redistributions of source code must retain the above copyright
16 1.1 gwr * notice, this list of conditions and the following disclaimer.
17 1.1 gwr * 2. Redistributions in binary form must reproduce the above copyright
18 1.1 gwr * notice, this list of conditions and the following disclaimer in the
19 1.1 gwr * documentation and/or other materials provided with the distribution.
20 1.8 agc * 3. Neither the name of the University nor the names of its contributors
21 1.8 agc * may be used to endorse or promote products derived from this software
22 1.8 agc * without specific prior written permission.
23 1.8 agc *
24 1.8 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.8 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.8 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.8 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.8 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.8 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.8 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.8 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.8 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.8 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.8 agc * SUCH DAMAGE.
35 1.8 agc *
36 1.8 agc * from: Utah $Hdr: clock.c 1.18 91/01/21$
37 1.8 agc *
38 1.8 agc * @(#)clock.c 8.2 (Berkeley) 1/12/94
39 1.8 agc */
40 1.8 agc
41 1.8 agc /*
42 1.1 gwr * Generic routines to convert between a POSIX date
43 1.1 gwr * (seconds since 1/1/1970) and yr/mo/day/hr/min/sec
44 1.1 gwr * Derived from arch/hp300/hp300/clock.c
45 1.1 gwr */
46 1.7 lukem
47 1.17 martin #ifdef _KERNEL
48 1.7 lukem #include <sys/cdefs.h>
49 1.17 martin __KERNEL_RCSID(0, "$NetBSD: clock_subr.c,v 1.17 2014/08/31 08:54:40 martin Exp $");
50 1.1 gwr
51 1.9 ragge #include <sys/param.h>
52 1.1 gwr #include <sys/systm.h>
53 1.17 martin #else
54 1.17 martin #include <string.h>
55 1.17 martin #include <time.h>
56 1.17 martin #endif
57 1.1 gwr
58 1.1 gwr #include <dev/clock_subr.h>
59 1.1 gwr
60 1.11 perry static inline int leapyear(int year);
61 1.1 gwr #define FEBRUARY 2
62 1.1 gwr #define days_in_year(a) (leapyear(a) ? 366 : 365)
63 1.1 gwr #define days_in_month(a) (month_days[(a) - 1])
64 1.1 gwr
65 1.1 gwr static const int month_days[12] = {
66 1.1 gwr 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
67 1.1 gwr };
68 1.1 gwr
69 1.2 gwr /*
70 1.2 gwr * This inline avoids some unnecessary modulo operations
71 1.2 gwr * as compared with the usual macro:
72 1.2 gwr * ( ((year % 4) == 0 &&
73 1.2 gwr * (year % 100) != 0) ||
74 1.2 gwr * ((year % 400) == 0) )
75 1.2 gwr * It is otherwise equivalent.
76 1.2 gwr */
77 1.1 gwr static inline int
78 1.13 perry leapyear(int year)
79 1.1 gwr {
80 1.1 gwr int rv = 0;
81 1.1 gwr
82 1.2 gwr if ((year & 3) == 0) {
83 1.1 gwr rv = 1;
84 1.1 gwr if ((year % 100) == 0) {
85 1.1 gwr rv = 0;
86 1.1 gwr if ((year % 400) == 0)
87 1.1 gwr rv = 1;
88 1.1 gwr }
89 1.1 gwr }
90 1.14 tsutsui return rv;
91 1.1 gwr }
92 1.1 gwr
93 1.1 gwr time_t
94 1.13 perry clock_ymdhms_to_secs(struct clock_ymdhms *dt)
95 1.1 gwr {
96 1.10 bjh21 uint64_t secs;
97 1.1 gwr int i, year, days;
98 1.1 gwr
99 1.1 gwr year = dt->dt_year;
100 1.1 gwr
101 1.1 gwr /*
102 1.1 gwr * Compute days since start of time
103 1.1 gwr * First from years, then from months.
104 1.1 gwr */
105 1.14 tsutsui if (year < POSIX_BASE_YEAR)
106 1.14 tsutsui return -1;
107 1.1 gwr days = 0;
108 1.1 gwr for (i = POSIX_BASE_YEAR; i < year; i++)
109 1.1 gwr days += days_in_year(i);
110 1.1 gwr if (leapyear(year) && dt->dt_mon > FEBRUARY)
111 1.1 gwr days++;
112 1.1 gwr
113 1.1 gwr /* Months */
114 1.1 gwr for (i = 1; i < dt->dt_mon; i++)
115 1.1 gwr days += days_in_month(i);
116 1.1 gwr days += (dt->dt_day - 1);
117 1.1 gwr
118 1.1 gwr /* Add hours, minutes, seconds. */
119 1.10 bjh21 secs = (((uint64_t)days
120 1.1 gwr * 24 + dt->dt_hour)
121 1.1 gwr * 60 + dt->dt_min)
122 1.1 gwr * 60 + dt->dt_sec;
123 1.1 gwr
124 1.17 martin if ((time_t)secs < 0 || secs > __type_max(time_t))
125 1.14 tsutsui return -1;
126 1.14 tsutsui return secs;
127 1.1 gwr }
128 1.1 gwr
129 1.1 gwr void
130 1.13 perry clock_secs_to_ymdhms(time_t secs, struct clock_ymdhms *dt)
131 1.1 gwr {
132 1.1 gwr int mthdays[12];
133 1.15 tsutsui int i;
134 1.15 tsutsui time_t days;
135 1.15 tsutsui time_t rsec; /* remainder seconds */
136 1.1 gwr
137 1.4 gwr /*
138 1.4 gwr * This function uses a local copy of month_days[]
139 1.4 gwr * so the copy can be modified (and thread-safe).
140 1.4 gwr * See the definition of days_in_month() above.
141 1.4 gwr */
142 1.6 thorpej memcpy(mthdays, month_days, sizeof(mthdays));
143 1.4 gwr #define month_days mthdays
144 1.1 gwr
145 1.1 gwr days = secs / SECDAY;
146 1.1 gwr rsec = secs % SECDAY;
147 1.1 gwr
148 1.1 gwr /* Day of week (Note: 1/1/1970 was a Thursday) */
149 1.1 gwr dt->dt_wday = (days + 4) % 7;
150 1.1 gwr
151 1.1 gwr /* Subtract out whole years, counting them in i. */
152 1.1 gwr for (i = POSIX_BASE_YEAR; days >= days_in_year(i); i++)
153 1.1 gwr days -= days_in_year(i);
154 1.1 gwr dt->dt_year = i;
155 1.1 gwr
156 1.1 gwr /* Subtract out whole months, counting them in i. */
157 1.1 gwr if (leapyear(i))
158 1.1 gwr days_in_month(FEBRUARY) = 29;
159 1.1 gwr for (i = 1; days >= days_in_month(i); i++)
160 1.1 gwr days -= days_in_month(i);
161 1.1 gwr dt->dt_mon = i;
162 1.1 gwr
163 1.1 gwr /* Days are what is left over (+1) from all that. */
164 1.1 gwr dt->dt_day = days + 1;
165 1.1 gwr
166 1.1 gwr /* Hours, minutes, seconds are easy */
167 1.1 gwr dt->dt_hour = rsec / 3600;
168 1.1 gwr rsec = rsec % 3600;
169 1.1 gwr dt->dt_min = rsec / 60;
170 1.1 gwr rsec = rsec % 60;
171 1.1 gwr dt->dt_sec = rsec;
172 1.4 gwr #undef month_days
173 1.1 gwr }
174