Rev 2959 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1435 | palkovsky | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2006 Ondrej Palkovsky |
1435 | palkovsky | 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 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * - The name of the author may not be used to endorse or promote products |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
1653 | cejka | 27 | */ |
28 | |||
1719 | decky | 29 | /** @addtogroup libc |
1653 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
1435 | palkovsky | 33 | */ |
34 | |||
1449 | palkovsky | 35 | #include <sys/time.h> |
1435 | palkovsky | 36 | #include <unistd.h> |
37 | #include <ipc/ipc.h> |
||
38 | #include <stdio.h> |
||
39 | #include <arch/barrier.h> |
||
1452 | palkovsky | 40 | #include <unistd.h> |
41 | #include <atomic.h> |
||
42 | #include <futex.h> |
||
2015 | jermar | 43 | #include <sysinfo.h> |
1596 | palkovsky | 44 | #include <ipc/services.h> |
1435 | palkovsky | 45 | |
46 | #include <sysinfo.h> |
||
47 | #include <as.h> |
||
48 | #include <ddi.h> |
||
49 | |||
3535 | svoboda | 50 | #include <time.h> |
51 | |||
1435 | palkovsky | 52 | /* Pointers to public variables with time */ |
53 | struct { |
||
1439 | palkovsky | 54 | volatile sysarg_t seconds1; |
1435 | palkovsky | 55 | volatile sysarg_t useconds; |
1439 | palkovsky | 56 | volatile sysarg_t seconds2; |
1435 | palkovsky | 57 | } *ktime = NULL; |
58 | |||
2486 | jermar | 59 | /** Add microseconds to given timeval. |
60 | * |
||
61 | * @param tv Destination timeval. |
||
62 | * @param usecs Number of microseconds to add. |
||
63 | */ |
||
64 | void tv_add(struct timeval *tv, suseconds_t usecs) |
||
65 | { |
||
66 | tv->tv_sec += usecs / 1000000; |
||
67 | tv->tv_usec += usecs % 1000000; |
||
68 | if (tv->tv_usec > 1000000) { |
||
69 | tv->tv_sec++; |
||
70 | tv->tv_usec -= 1000000; |
||
71 | } |
||
72 | } |
||
1435 | palkovsky | 73 | |
2486 | jermar | 74 | /** Subtract two timevals. |
75 | * |
||
76 | * @param tv1 First timeval. |
||
77 | * @param tv2 Second timeval. |
||
78 | * |
||
79 | * @return Return difference between tv1 and tv2 (tv1 - tv2) in |
||
80 | * microseconds. |
||
81 | */ |
||
82 | suseconds_t tv_sub(struct timeval *tv1, struct timeval *tv2) |
||
83 | { |
||
84 | suseconds_t result; |
||
85 | |||
86 | result = tv1->tv_usec - tv2->tv_usec; |
||
87 | result += (tv1->tv_sec - tv2->tv_sec) * 1000000; |
||
88 | |||
89 | return result; |
||
90 | } |
||
91 | |||
92 | /** Decide if one timeval is greater than the other. |
||
93 | * |
||
94 | * @param t1 First timeval. |
||
95 | * @param t2 Second timeval. |
||
96 | * |
||
97 | * @return Return true tv1 is greater than tv2. Otherwise return |
||
98 | * false. |
||
99 | */ |
||
100 | int tv_gt(struct timeval *tv1, struct timeval *tv2) |
||
101 | { |
||
102 | if (tv1->tv_sec > tv2->tv_sec) |
||
103 | return 1; |
||
104 | if (tv1->tv_sec == tv2->tv_sec && tv1->tv_usec > tv2->tv_usec) |
||
105 | return 1; |
||
106 | return 0; |
||
107 | } |
||
108 | |||
109 | /** Decide if one timeval is greater than or equal to the other. |
||
110 | * |
||
111 | * @param tv1 First timeval. |
||
112 | * @param tv2 Second timeval. |
||
113 | * |
||
114 | * @return Return true if tv1 is greater than or equal to tv2. |
||
115 | * Otherwise return false. |
||
116 | */ |
||
117 | int tv_gteq(struct timeval *tv1, struct timeval *tv2) |
||
118 | { |
||
119 | if (tv1->tv_sec > tv2->tv_sec) |
||
120 | return 1; |
||
121 | if (tv1->tv_sec == tv2->tv_sec && tv1->tv_usec >= tv2->tv_usec) |
||
122 | return 1; |
||
123 | return 0; |
||
124 | } |
||
125 | |||
126 | |||
1435 | palkovsky | 127 | /** POSIX gettimeofday |
128 | * |
||
129 | * The time variables are memory mapped(RO) from kernel, which updates |
||
130 | * them periodically. As it is impossible to read 2 values atomically, we |
||
131 | * use a trick: First read a seconds, then read microseconds, then |
||
1701 | palkovsky | 132 | * read seconds again. If a second elapsed in the meantime, set it to zero. |
133 | * This provides assurance, that at least the |
||
1435 | palkovsky | 134 | * sequence of subsequent gettimeofday calls is ordered. |
135 | */ |
||
136 | int gettimeofday(struct timeval *tv, struct timezone *tz) |
||
137 | { |
||
138 | void *mapping; |
||
1439 | palkovsky | 139 | sysarg_t s1, s2; |
2677 | jermar | 140 | int rights; |
1435 | palkovsky | 141 | int res; |
142 | |||
143 | if (!ktime) { |
||
2141 | jermar | 144 | mapping = as_get_mappable_page(PAGE_SIZE); |
1435 | palkovsky | 145 | /* Get the mapping of kernel clock */ |
2678 | jermar | 146 | res = ipc_share_in_start_1_1(PHONE_NS, mapping, PAGE_SIZE, |
2677 | jermar | 147 | SERVICE_MEM_REALTIME, &rights); |
1435 | palkovsky | 148 | if (res) { |
149 | printf("Failed to initialize timeofday memarea\n"); |
||
2959 | svoboda | 150 | printf("Address was 0x%x\n", (unsigned)mapping); |
1435 | palkovsky | 151 | _exit(1); |
152 | } |
||
2564 | jermar | 153 | if (!(rights & AS_AREA_READ)) { |
1462 | palkovsky | 154 | printf("Received bad rights on time area: %X\n", |
2564 | jermar | 155 | rights); |
1501 | palkovsky | 156 | as_area_destroy(mapping); |
1462 | palkovsky | 157 | _exit(1); |
158 | } |
||
1501 | palkovsky | 159 | ktime = mapping; |
1435 | palkovsky | 160 | } |
1441 | palkovsky | 161 | if (tz) { |
162 | tz->tz_minuteswest = 0; |
||
163 | tz->tz_dsttime = DST_NONE; |
||
164 | } |
||
165 | |||
1442 | palkovsky | 166 | s2 = ktime->seconds2; |
167 | read_barrier(); |
||
1435 | palkovsky | 168 | tv->tv_usec = ktime->useconds; |
169 | read_barrier(); |
||
1442 | palkovsky | 170 | s1 = ktime->seconds1; |
1439 | palkovsky | 171 | if (s1 != s2) { |
172 | tv->tv_usec = 0; |
||
173 | tv->tv_sec = s1 > s2 ? s1 : s2; |
||
174 | } else |
||
175 | tv->tv_sec = s1; |
||
1435 | palkovsky | 176 | |
177 | return 0; |
||
178 | } |
||
1452 | palkovsky | 179 | |
2564 | jermar | 180 | time_t time(time_t *tloc) |
181 | { |
||
182 | struct timeval tv; |
||
183 | |||
184 | if (gettimeofday(&tv, NULL)) |
||
185 | return (time_t) -1; |
||
186 | if (tloc) |
||
187 | *tloc = tv.tv_sec; |
||
188 | return tv.tv_sec; |
||
189 | } |
||
190 | |||
2188 | decky | 191 | /** Wait unconditionally for specified number of microseconds */ |
2616 | jermar | 192 | int usleep(unsigned long usec) |
1452 | palkovsky | 193 | { |
194 | atomic_t futex = FUTEX_INITIALIZER; |
||
195 | |||
2188 | decky | 196 | futex_initialize(&futex, 0); |
1452 | palkovsky | 197 | futex_down_timeout(&futex, usec, 0); |
2616 | jermar | 198 | return 0; |
1452 | palkovsky | 199 | } |
1653 | cejka | 200 | |
2188 | decky | 201 | /** Wait unconditionally for specified number of seconds */ |
202 | unsigned int sleep(unsigned int seconds) |
||
203 | { |
||
204 | atomic_t futex = FUTEX_INITIALIZER; |
||
205 | |||
206 | futex_initialize(&futex, 0); |
||
207 | |||
208 | /* Sleep in 1000 second steps to support |
||
209 | full argument range */ |
||
210 | while (seconds > 0) { |
||
211 | unsigned int period = (seconds > 1000) ? 1000 : seconds; |
||
212 | |||
213 | futex_down_timeout(&futex, period * 1000000, 0); |
||
214 | seconds -= period; |
||
215 | } |
||
2616 | jermar | 216 | return 0; |
2188 | decky | 217 | } |
218 | |||
1719 | decky | 219 | /** @} |
1653 | cejka | 220 | */ |