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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
|
/*
* Copyright (c) 2007, Novell Inc.
*
* This program is licensed under the BSD license, read LICENSE.BSD
* for further information
*/
#define _GNU_SOURCE
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <sys/time.h>
#include "util.h"
void
solv_oom(size_t num, size_t len)
{
if (num)
fprintf(stderr, "Out of memory allocating %zu*%zu bytes!\n", num, len);
else
fprintf(stderr, "Out of memory allocating %zu bytes!\n", len);
abort();
exit(1);
}
void *
solv_malloc(size_t len)
{
void *r = malloc(len ? len : 1);
if (!r)
solv_oom(0, len);
return r;
}
void *
solv_malloc2(size_t num, size_t len)
{
if (len && (num * len) / len != num)
solv_oom(num, len);
return solv_malloc(num * len);
}
void *
solv_realloc(void *old, size_t len)
{
if (old == 0)
old = malloc(len ? len : 1);
else
old = realloc(old, len ? len : 1);
if (!old)
solv_oom(0, len);
return old;
}
void *
solv_realloc2(void *old, size_t num, size_t len)
{
if (len && (num * len) / len != num)
solv_oom(num, len);
return solv_realloc(old, num * len);
}
void *
solv_calloc(size_t num, size_t len)
{
void *r;
if (num == 0 || len == 0)
r = malloc(1);
else
r = calloc(num, len);
if (!r)
solv_oom(num, len);
return r;
}
void *
solv_free(void *mem)
{
if (mem)
free(mem);
return 0;
}
char *
solv_strdup(const char *s)
{
char *r;
if (!s)
return 0;
r = strdup(s);
if (!r)
solv_oom(0, strlen(s));
return r;
}
unsigned int
solv_timems(unsigned int subtract)
{
struct timeval tv;
unsigned int r;
if (gettimeofday(&tv, 0))
return 0;
r = (((unsigned int)tv.tv_sec >> 16) * 1000) << 16;
r += ((unsigned int)tv.tv_sec & 0xffff) * 1000;
r += (unsigned int)tv.tv_usec / 1000;
return r - subtract;
}
/* bsd's qsort_r has different arguments, so we define our
own version in case we need to do some clever mapping
see also: http://sources.redhat.com/ml/libc-alpha/2008-12/msg00003.html
*/
#if defined(__GLIBC__)
# if HAVE_QSORT_R || HAVE___QSORT_R
void
solv_sort(void *base, size_t nmemb, size_t size, int (*compar)(const void *, const void *, void *), void *compard)
{
# if HAVE_QSORT_R
qsort_r(base, nmemb, size, compar, compard);
# else
/* backported for SLE10-SP2 */
__qsort_r(base, nmemb, size, compar, compard);
# endif
}
#else /* qsort_r or __qsort_r on glibc */
/* use own version of qsort if none available */
#include "qsort_r.c"
#endif
#else /* not glibc */
struct solv_sort_data {
int (*compar)(const void *, const void *, void *);
void *compard;
};
static int
solv_sort_helper(void *compard, const void *a, const void *b)
{
struct solv_sort_data *d = compard;
return (*d->compar)(a, b, d->compard);
}
void
solv_sort(void *base, size_t nmemb, size_t size, int (*compar)(const void *, const void *, void *), void *compard)
{
struct solv_sort_data d;
d.compar = compar;
d.compard = compard;
qsort_r(base, nmemb, size, &d, solv_sort_helper);
}
#endif
char *
solv_dupjoin(const char *str1, const char *str2, const char *str3)
{
int l1, l2, l3;
char *s, *str;
l1 = str1 ? strlen(str1) : 0;
l2 = str2 ? strlen(str2) : 0;
l3 = str3 ? strlen(str3) : 0;
s = str = solv_malloc(l1 + l2 + l3 + 1);
if (l1)
{
strcpy(s, str1);
s += l1;
}
if (l2)
{
strcpy(s, str2);
s += l2;
}
if (l3)
{
strcpy(s, str3);
s += l3;
}
*s = 0;
return str;
}
char *
solv_dupappend(const char *str1, const char *str2, const char *str3)
{
char *str = solv_dupjoin(str1, str2, str3);
solv_free((void *)str1);
return str;
}
int
solv_hex2bin(const char **strp, unsigned char *buf, int bufl)
{
const char *str = *strp;
int i;
for (i = 0; i < bufl; i++)
{
int c = *str;
int d;
if (c >= '0' && c <= '9')
d = c - '0';
else if (c >= 'a' && c <= 'f')
d = c - ('a' - 10);
else if (c >= 'A' && c <= 'F')
d = c - ('A' - 10);
else
break;
c = *++str;
d <<= 4;
if (c >= '0' && c <= '9')
d |= c - '0';
else if (c >= 'a' && c <= 'f')
d |= c - ('a' - 10);
else if (c >= 'A' && c <= 'F')
d |= c - ('A' - 10);
else
break;
buf[i] = d;
++str;
}
*strp = str;
return i;
}
char *
solv_bin2hex(const unsigned char *buf, int l, char *str)
{
int i;
for (i = 0; i < l; i++, buf++)
{
int c = *buf >> 4;
*str++ = c < 10 ? c + '0' : c + ('a' - 10);
c = *buf & 15;
*str++ = c < 10 ? c + '0' : c + ('a' - 10);
}
*str = 0;
return str;
}
|
