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
|
/*
usbmuxd - iPhone/iPod Touch USB multiplex server daemon
Copyright (C) 2009 Hector Martin "marcan" <hector@marcansoft.com>
Copyright (C) 2009 Nikias Bassen <nikias@gmx.li>
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation, either version 2.1 of the
License, or (at your option) any later version.
This library 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 Lesser General Public
License along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "utils.h"
#include "log.h"
#define util_error(...) usbmuxd_log(LL_ERROR, __VA_ARGS__)
void fdlist_create(struct fdlist *list)
{
list->count = 0;
list->capacity = 4;
list->owners = malloc(sizeof(*list->owners) * list->capacity);
list->fds = malloc(sizeof(*list->fds) * list->capacity);
}
void fdlist_add(struct fdlist *list, enum fdowner owner, int fd, short events)
{
if(list->count == list->capacity) {
list->capacity *= 2;
list->owners = realloc(list->owners, sizeof(*list->owners) * list->capacity);
list->fds = realloc(list->fds, sizeof(*list->fds) * list->capacity);
}
list->owners[list->count] = owner;
list->fds[list->count].fd = fd;
list->fds[list->count].events = events;
list->fds[list->count].revents = 0;
list->count++;
}
void fdlist_free(struct fdlist *list)
{
list->count = 0;
list->capacity = 0;
free(list->owners);
list->owners = NULL;
free(list->fds);
list->fds = NULL;
}
void fdlist_reset(struct fdlist *list)
{
list->count = 0;
}
void collection_init(struct collection *col)
{
col->list = malloc(sizeof(void *));
memset(col->list, 0, sizeof(void *));
col->capacity = 1;
}
void collection_free(struct collection *col)
{
free(col->list);
col->list = NULL;
col->capacity = 0;
}
void collection_add(struct collection *col, void *element)
{
int i;
for(i=0; i<col->capacity; i++) {
if(!col->list[i]) {
col->list[i] = element;
return;
}
}
col->list = realloc(col->list, sizeof(void*) * col->capacity * 2);
memset(&col->list[col->capacity], 0, sizeof(void *) * col->capacity);
col->list[col->capacity] = element;
col->capacity *= 2;
}
void collection_remove(struct collection *col, void *element)
{
int i;
for(i=0; i<col->capacity; i++) {
if(col->list[i] == element) {
col->list[i] = NULL;
return;
}
}
util_error("collection_remove: element %p not present in collection %p (cap %d)", element, col, col->capacity);
}
int collection_count(struct collection *col)
{
int i, cnt = 0;
for(i=0; i<col->capacity; i++) {
if(col->list[i])
cnt++;
}
return cnt;
}
|
