-
Notifications
You must be signed in to change notification settings - Fork 0
/
util.c
127 lines (114 loc) · 2.83 KB
/
util.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/*
* util.c - Onkyo receiver utility functions
*
* Copyright (c) 2008-2010 Dan McGee <[email protected]>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <sys/stat.h> /* open */
#include <sys/time.h> /* struct timeval */
#include <fcntl.h> /* open */
#include <unistd.h> /* close, read, write */
#include <errno.h> /* for errno refs */
#include "onkyo.h"
int xopen(const char *path, int oflag)
{
int fd;
while(1) {
fd = open(path, oflag);
if ((fd < 0) && errno == EINTR)
continue;
return fd;
}
}
int xclose(int fd)
{
int nr;
while(1) {
nr = close(fd);
if((nr < 0) && errno == EINTR)
continue;
return nr;
}
}
ssize_t xread(int fd, void *buf, size_t len)
{
ssize_t nr;
while(1) {
nr = read(fd, buf, len);
if ((nr < 0) && (errno == EAGAIN || errno == EINTR))
continue;
return nr;
}
}
ssize_t xwrite(int fd, const void *buf, size_t len)
{
ssize_t nr;
while(1) {
nr = write(fd, buf, len);
if ((nr < 0) && (errno == EAGAIN || errno == EINTR))
continue;
return nr;
}
}
/**
* Hash the given string to an unsigned long value.
* This is the standard sdbm hashing algorithm.
* @param str string to hash
* @return the hash value of the given string
*/
unsigned long hash_sdbm(const char *str)
{
unsigned long hash = 0;
int c;
if(!str)
return hash;
while((c = *str++))
hash = (unsigned int)c + hash * 65599;
return hash;
}
void timeval_diff(struct timeval * restrict a,
struct timeval * restrict b, struct timeval * restrict result)
{
/* Calculate time difference as `a - b`.
* Make sure we end up with an in-range usecs value. */
result->tv_sec = a->tv_sec - b->tv_sec;
result->tv_usec = a->tv_usec - b->tv_usec;
if(result->tv_usec < 0) {
result->tv_usec += 1000000;
result->tv_sec -= 1;
}
}
struct timeval timeval_min(struct timeval *restrict a,
struct timeval * restrict b)
{
if(a->tv_sec == 0 && a->tv_usec == 0) {
return *b;
} if(a->tv_sec < b->tv_sec) {
return *a;
} else if(a->tv_sec > b->tv_sec) {
return *b;
}
/* getting here means seconds are equal */
return a->tv_usec < b->tv_usec ? *a : *b;
}
int timeval_positive(struct timeval *tv)
{
if(tv->tv_sec > 0)
return 1;
if(tv->tv_sec == 0 && tv->tv_usec > 0)
return 1;
return 0;
}
/* vim: set ts=4 sw=4 noet: */