-
Notifications
You must be signed in to change notification settings - Fork 125
/
Copy pathplist.c
276 lines (247 loc) · 7.13 KB
/
plist.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
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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
/*-
* Copyright (c) 2008-2015 Juan Romero Pardines.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <errno.h>
#include <pthread.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "xbps_api_impl.h"
struct thread_data {
pthread_t thread;
xbps_array_t array;
xbps_dictionary_t dict;
struct xbps_handle *xhp;
unsigned int start;
unsigned int arraycount;
unsigned int *reserved;
pthread_mutex_t *reserved_lock;
unsigned int slicecount;
int (*fn)(struct xbps_handle *, xbps_object_t, const char *, void *, bool *);
void *fn_arg;
};
/**
* @file lib/plist.c
* @brief PropertyList generic routines
* @defgroup plist PropertyList generic functions
*
* These functions manipulate plist files and objects shared by almost
* all library functions.
*/
static void *
array_foreach_thread(void *arg)
{
xbps_object_t obj, pkgd;
struct thread_data *thd = arg;
const char *key;
int rv;
bool loop_done = false;
unsigned i = thd->start;
unsigned int end = i + thd->slicecount;
while(i < thd->arraycount) {
/* process pkgs from start until end */
for (; i < end && i < thd->arraycount; i++) {
obj = xbps_array_get(thd->array, i);
if (xbps_object_type(thd->dict) == XBPS_TYPE_DICTIONARY) {
pkgd = xbps_dictionary_get_keysym(thd->dict, obj);
key = xbps_dictionary_keysym_cstring_nocopy(obj);
/* ignore internal objs */
if (strncmp(key, "_XBPS_", 6) == 0)
continue;
} else {
pkgd = obj;
key = NULL;
}
rv = (*thd->fn)(thd->xhp, pkgd, key, thd->fn_arg, &loop_done);
if (rv != 0 || loop_done)
return NULL;
}
/* Reserve more elements to compute */
pthread_mutex_lock(thd->reserved_lock);
i = *thd->reserved;
end = i + thd->slicecount;
*thd->reserved = end;
pthread_mutex_unlock(thd->reserved_lock);
}
return NULL;
}
int
xbps_array_foreach_cb_multi(struct xbps_handle *xhp,
xbps_array_t array,
xbps_dictionary_t dict,
int (*fn)(struct xbps_handle *, xbps_object_t, const char *, void *, bool *),
void *arg)
{
struct thread_data *thd;
unsigned int arraycount, slicecount;
int rv = 0, error = 0, i, maxthreads;
unsigned int reserved;
pthread_mutex_t reserved_lock = PTHREAD_MUTEX_INITIALIZER;
assert(fn != NULL);
if (xbps_object_type(array) != XBPS_TYPE_ARRAY)
return 0;
arraycount = xbps_array_count(array);
if (arraycount == 0)
return 0;
maxthreads = (int)sysconf(_SC_NPROCESSORS_ONLN);
if (maxthreads <= 1 || arraycount <= 1) /* use single threaded routine */
return xbps_array_foreach_cb(xhp, array, dict, fn, arg);
thd = calloc(maxthreads, sizeof(*thd));
assert(thd);
// maxthread is boundchecked to be > 1
if((unsigned int)maxthreads >= arraycount) {
maxthreads = arraycount;
slicecount = 1;
} else {
slicecount = arraycount / maxthreads;
if (slicecount > 32) {
slicecount = 32;
}
}
reserved = slicecount * maxthreads;
for (i = 0; i < maxthreads; i++) {
thd[i].array = array;
thd[i].dict = dict;
thd[i].xhp = xhp;
thd[i].fn = fn;
thd[i].fn_arg = arg;
thd[i].start = i * slicecount;
thd[i].reserved = &reserved;
thd[i].reserved_lock = &reserved_lock;
thd[i].slicecount = slicecount;
thd[i].arraycount = arraycount;
if ((rv = pthread_create(&thd[i].thread, NULL, array_foreach_thread, &thd[i])) != 0) {
error = rv;
break;
}
}
/* wait for all threads that were created successfully */
for (int c = 0; c < i; c++) {
if ((rv = pthread_join(thd[c].thread, NULL)) != 0)
error = rv;
}
free(thd);
pthread_mutex_destroy(&reserved_lock);
return error ? error : rv;
}
int
xbps_array_foreach_cb(struct xbps_handle *xhp,
xbps_array_t array,
xbps_dictionary_t dict,
int (*fn)(struct xbps_handle *, xbps_object_t, const char *, void *, bool *),
void *arg)
{
xbps_dictionary_t pkgd;
xbps_object_t obj;
const char *key;
int rv = 0;
bool loop_done = false;
for (unsigned int i = 0; i < xbps_array_count(array); i++) {
obj = xbps_array_get(array, i);
if (xbps_object_type(dict) == XBPS_TYPE_DICTIONARY) {
pkgd = xbps_dictionary_get_keysym(dict, obj);
key = xbps_dictionary_keysym_cstring_nocopy(obj);
/* ignore internal objs */
if (strncmp(key, "_XBPS_", 6) == 0)
continue;
} else {
pkgd = obj;
key = NULL;
}
rv = (*fn)(xhp, pkgd, key, arg, &loop_done);
if (rv != 0 || loop_done)
break;
}
return rv;
}
xbps_object_iterator_t
xbps_array_iter_from_dict(xbps_dictionary_t dict, const char *key)
{
xbps_array_t array;
assert(xbps_object_type(dict) == XBPS_TYPE_DICTIONARY);
assert(key != NULL);
array = xbps_dictionary_get(dict, key);
if (xbps_object_type(array) != XBPS_TYPE_ARRAY) {
errno = EINVAL;
return NULL;
}
return xbps_array_iterator(array);
}
static int
array_replace_dict(xbps_array_t array,
xbps_dictionary_t dict,
const char *str,
bool bypattern)
{
xbps_object_t obj;
const char *pkgver, *pkgname;
assert(xbps_object_type(array) == XBPS_TYPE_ARRAY);
assert(xbps_object_type(dict) == XBPS_TYPE_DICTIONARY);
assert(str != NULL);
for (unsigned int i = 0; i < xbps_array_count(array); i++) {
obj = xbps_array_get(array, i);
if (obj == NULL) {
continue;
}
if (!xbps_dictionary_get_cstring_nocopy(obj, "pkgver", &pkgver)) {
continue;
}
if (bypattern) {
/* pkgpattern match */
if (xbps_pkgpattern_match(pkgver, str)) {
if (!xbps_array_set(array, i, dict)) {
return EINVAL;
}
return 0;
}
} else {
/* pkgname match */
xbps_dictionary_get_cstring_nocopy(obj, "pkgname", &pkgname);
if (strcmp(pkgname, str) == 0) {
if (!xbps_array_set(array, i, dict)) {
return EINVAL;
}
return 0;
}
}
}
/* no match */
return ENOENT;
}
int HIDDEN
xbps_array_replace_dict_by_name(xbps_array_t array,
xbps_dictionary_t dict,
const char *pkgver)
{
return array_replace_dict(array, dict, pkgver, false);
}
int HIDDEN
xbps_array_replace_dict_by_pattern(xbps_array_t array,
xbps_dictionary_t dict,
const char *pattern)
{
return array_replace_dict(array, dict, pattern, true);
}