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
|
/*
* plist.c
* Builds plist XML structures.
*
* Copyright (c) 2008 Zach C. All Rights Reserved.
*
* 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <string.h>
#include <assert.h>
#include "utils.h"
#include "plist.h"
#include <wchar.h>
#include <stdlib.h>
#include <stdio.h>
plist_t plist_new_node(plist_data_t data)
{
return (plist_t) g_node_new(data);
}
plist_data_t plist_get_data(const plist_t node)
{
if (!node)
return NULL;
return ((GNode *) node)->data;
}
plist_data_t plist_new_plist_data()
{
plist_data_t data = (plist_data_t) calloc(sizeof(struct plist_data_s), 1);
return data;
}
void plist_free_plist_data(plist_data_t data)
{
if (data) {
switch (data->type) {
default:
break;
}
free(data);
}
}
plist_t plist_new_dict()
{
plist_data_t data = plist_new_plist_data();
data->type = PLIST_DICT;
return plist_new_node(data);
}
plist_t plist_new_array()
{
plist_data_t data = plist_new_plist_data();
data->type = PLIST_ARRAY;
return plist_new_node(data);
}
plist_t plist_add_sub_element(plist_t node, plist_type type, void *value, uint64_t length)
{
//only structured types are allowed to have nulll value
if (!value && (type == PLIST_DICT || type == PLIST_ARRAY)) {
//now handle value
plist_data_t data = plist_new_plist_data();
data->type = type;
data->length = length;
switch (type) {
case PLIST_BOOLEAN:
data->boolval = *((char *) value);
break;
case PLIST_UINT:
data->intval = *((uint64_t *) value);
break;
case PLIST_REAL:
data->realval = *((double *) value);
break;
case PLIST_STRING:
data->strval = strdup((char *) value);
break;
case PLIST_UNICODE:
data->unicodeval = wcsdup((wchar_t *) value);
break;
case PLIST_DATA:
memcpy(data->buff, value, length);
break;
case PLIST_ARRAY:
case PLIST_DICT:
case PLIST_DATE:
default:
break;
}
plist_t subnode = plist_new_node(data);
if (node)
g_node_append(node, subnode);
return subnode;
} else
return NULL;
}
void plist_free(plist_t plist)
{
g_node_destroy(plist);
}
plist_t plist_get_first_child(plist_t node)
{
return (plist_t) g_node_first_child((GNode *) node);
}
plist_t plist_get_next_sibling(plist_t node)
{
return (plist_t) g_node_next_sibling((GNode *) node);
}
plist_t plist_get_prev_sibling(plist_t node)
{
return (plist_t) g_node_prev_sibling((GNode *) node);
}
char compare_node_value(plist_type type, plist_data_t data, void *value, uint64_t length)
{
char res = FALSE;
switch (type) {
case PLIST_BOOLEAN:
res = data->boolval == *((char *) value) ? TRUE : FALSE;
break;
case PLIST_UINT:
res = data->intval == *((uint64_t *) value) ? TRUE : FALSE;
break;
case PLIST_REAL:
res = data->realval == *((double *) value) ? TRUE : FALSE;
break;
case PLIST_KEY:
case PLIST_STRING:
res = !strcmp(data->strval, ((char *) value));
break;
case PLIST_UNICODE:
res = !wcscmp(data->unicodeval, ((wchar_t *) value));
break;
case PLIST_DATA:
res = memcmp(data->buff,(char*) value, length );
break;
case PLIST_ARRAY:
case PLIST_DICT:
case PLIST_DATE:
default:
break;
}
return res;
}
plist_t plist_find_node(plist_t plist, plist_type type, void *value, uint64_t length)
{
if (!plist)
return NULL;
plist_t current = NULL;
for (current = plist_get_first_child(plist); current; current = plist_get_next_sibling(current)) {
plist_data_t data = plist_get_data(current);
if (data->type == type && data->length == length && compare_node_value(type, data, value, length)) {
return current;
}
if (data->type == PLIST_DICT || data->type == PLIST_ARRAY) {
plist_t sub = plist_find_node(current, type, value, length);
if (sub)
return sub;
}
}
return NULL;
}
void plist_get_type_and_value(plist_t node, plist_type * type, void *value, uint64_t * length)
{
if (!node)
return;
plist_data_t data = plist_get_data(node);
*type = data->type;
*length = data->length;
switch (*type) {
case PLIST_BOOLEAN:
*((char *) value) = data->boolval;
break;
case PLIST_UINT:
*((uint64_t *) value) = data->intval;
break;
case PLIST_REAL:
*((double *) value) = data->realval;
break;
case PLIST_STRING:
*((char **) value) = strdup(data->strval);
break;
case PLIST_UNICODE:
*((wchar_t **) value) = wcsdup(data->unicodeval);
break;
case PLIST_KEY:
*((char **) value) = strdup(data->strval);
break;
case PLIST_DATA:
case PLIST_ARRAY:
case PLIST_DICT:
case PLIST_DATE:
default:
break;
}
}
plist_type plist_get_node_type(plist_t node)
{
if (node) {
plist_data_t data = plist_get_data(node);
if (data)
return data->type;
}
return PLIST_NONE;
}
uint64_t plist_get_node_uint_val(plist_t node)
{
if (PLIST_UINT == plist_get_node_type(node))
return plist_get_data(node)->intval;
else
return 0;
}
|
