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
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
|
/*
* repo_comps.c
*
* Parses RedHat comps format
*
* Copyright (c) 2012, Novell Inc.
*
* This program is licensed under the BSD license, read LICENSE.BSD
* for further information
*/
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <limits.h>
#include <fcntl.h>
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <dirent.h>
#include <expat.h>
#include "pool.h"
#include "repo.h"
#include "util.h"
#define DISABLE_SPLIT
#include "tools_util.h"
#include "repo_comps.h"
/*
* TODO:
*
* what's the difference between group/category?
* handle "default" and "langonly".
*
* maybe handle REL_COND in solver recommends handling?
*/
enum state {
STATE_START,
STATE_COMPS,
STATE_GROUP,
STATE_ID,
STATE_NAME,
STATE_DESCRIPTION,
STATE_DISPLAY_ORDER,
STATE_DEFAULT,
STATE_LANGONLY,
STATE_LANG_ONLY,
STATE_USERVISIBLE,
STATE_PACKAGELIST,
STATE_PACKAGEREQ,
STATE_CATEGORY,
STATE_CID,
STATE_CNAME,
STATE_CDESCRIPTION,
STATE_CDISPLAY_ORDER,
STATE_GROUPLIST,
STATE_GROUPID,
NUMSTATES
};
struct stateswitch {
enum state from;
char *ename;
enum state to;
int docontent;
};
/* must be sorted by first column */
static struct stateswitch stateswitches[] = {
{ STATE_START, "comps", STATE_COMPS, 0 },
{ STATE_COMPS, "group", STATE_GROUP, 0 },
{ STATE_COMPS, "category", STATE_CATEGORY, 0 },
{ STATE_GROUP, "id", STATE_ID, 1 },
{ STATE_GROUP, "name", STATE_NAME, 1 },
{ STATE_GROUP, "description", STATE_DESCRIPTION, 1 },
{ STATE_GROUP, "uservisible", STATE_USERVISIBLE, 1 },
{ STATE_GROUP, "display_order", STATE_DISPLAY_ORDER, 1 },
{ STATE_GROUP, "default", STATE_DEFAULT, 1 },
{ STATE_GROUP, "langonly", STATE_LANGONLY, 1 },
{ STATE_GROUP, "lang_only", STATE_LANG_ONLY, 1 },
{ STATE_GROUP, "packagelist", STATE_PACKAGELIST, 0 },
{ STATE_PACKAGELIST, "packagereq", STATE_PACKAGEREQ, 1 },
{ STATE_CATEGORY, "id", STATE_CID, 1 },
{ STATE_CATEGORY, "name", STATE_CNAME, 1 },
{ STATE_CATEGORY, "description", STATE_CDESCRIPTION, 1 },
{ STATE_CATEGORY , "grouplist", STATE_GROUPLIST, 0 },
{ STATE_CATEGORY , "display_order", STATE_CDISPLAY_ORDER, 1 },
{ STATE_GROUPLIST, "groupid", STATE_GROUPID, 1 },
{ NUMSTATES }
};
struct parsedata {
Pool *pool;
Repo *repo;
Repodata *data;
const char *filename;
const char *basename;
int depth;
enum state state;
int statedepth;
char *content;
int lcontent;
int acontent;
int docontent;
struct stateswitch *swtab[NUMSTATES];
enum state sbtab[NUMSTATES];
struct joindata jd;
const char *tmplang;
Id reqtype;
Id condreq;
Solvable *solvable;
Id handle;
};
/*
* find_attr
* find value for xml attribute
* I: txt, name of attribute
* I: atts, list of key/value attributes
* O: pointer to value of matching key, or NULL
*
*/
static inline const char *
find_attr(const char *txt, const char **atts)
{
for (; *atts; atts += 2)
{
if (!strcmp(*atts, txt))
return atts[1];
}
return 0;
}
/*
* XML callback: startElement
*/
static void XMLCALL
startElement(void *userData, const char *name, const char **atts)
{
struct parsedata *pd = userData;
Pool *pool = pd->pool;
Solvable *s = pd->solvable;
struct stateswitch *sw;
#if 0
fprintf(stderr, "start: [%d]%s\n", pd->state, name);
#endif
if (pd->depth != pd->statedepth)
{
pd->depth++;
return;
}
pd->depth++;
if (!pd->swtab[pd->state]) /* no statetable -> no substates */
{
#if 0
fprintf(stderr, "into unknown: %s (from: %d)\n", name, pd->state);
#endif
return;
}
for (sw = pd->swtab[pd->state]; sw->from == pd->state; sw++) /* find name in statetable */
if (!strcmp(sw->ename, name))
break;
if (sw->from != pd->state)
{
#if 0
fprintf(stderr, "into unknown: %s (from: %d)\n", name, pd->state);
#endif
return;
}
pd->state = sw->to;
pd->docontent = sw->docontent;
pd->statedepth = pd->depth;
pd->lcontent = 0;
*pd->content = 0;
switch(pd->state)
{
case STATE_GROUP:
case STATE_CATEGORY:
s = pd->solvable = pool_id2solvable(pool, repo_add_solvable(pd->repo));
pd->handle = s - pool->solvables;
break;
case STATE_NAME:
case STATE_CNAME:
case STATE_DESCRIPTION:
case STATE_CDESCRIPTION:
pd->tmplang = join_dup(&pd->jd, find_attr("xml:lang", atts));
break;
case STATE_PACKAGEREQ:
{
const char *type = find_attr("type", atts);
pd->condreq = 0;
pd->reqtype = SOLVABLE_RECOMMENDS;
if (type && !strcmp(type, "conditional"))
{
const char *requires = find_attr("requires", atts);
if (requires && *requires)
pd->condreq = pool_str2id(pool, requires, 1);
}
else if (type && !strcmp(type, "mandatory"))
pd->reqtype = SOLVABLE_REQUIRES;
else if (type && !strcmp(type, "optional"))
pd->reqtype = SOLVABLE_SUGGESTS;
break;
}
default:
break;
}
}
static void XMLCALL
endElement(void *userData, const char *name)
{
struct parsedata *pd = userData;
Solvable *s = pd->solvable;
Id id;
#if 0
fprintf(stderr, "end: [%d]%s\n", pd->state, name);
#endif
if (pd->depth != pd->statedepth)
{
pd->depth--;
#if 0
fprintf(stderr, "back from unknown %d %d %d\n", pd->state, pd->depth, pd->statedepth);
#endif
return;
}
pd->depth--;
pd->statedepth--;
switch (pd->state)
{
case STATE_GROUP:
case STATE_CATEGORY:
if (!s->arch)
s->arch = ARCH_NOARCH;
if (!s->evr)
s->evr = ID_EMPTY;
if (s->name && s->arch != ARCH_SRC && s->arch != ARCH_NOSRC)
s->provides = repo_addid_dep(pd->repo, s->provides, pool_rel2id(pd->pool, s->name, s->evr, REL_EQ, 1), 0);
pd->solvable = 0;
break;
case STATE_ID:
case STATE_CID:
s->name = pool_str2id(pd->pool, join2(&pd->jd, pd->state == STATE_ID ? "group" : "category", ":", pd->content), 1);
break;
case STATE_NAME:
case STATE_CNAME:
repodata_set_str(pd->data, pd->handle, pool_id2langid(pd->pool, SOLVABLE_SUMMARY, pd->tmplang, 1), pd->content);
break;
case STATE_DESCRIPTION:
case STATE_CDESCRIPTION:
repodata_set_str(pd->data, pd->handle, pool_id2langid(pd->pool, SOLVABLE_DESCRIPTION, pd->tmplang, 1), pd->content);
break;
case STATE_PACKAGEREQ:
id = pool_str2id(pd->pool, pd->content, 1);
if (pd->condreq)
id = pool_rel2id(pd->pool, id, pd->condreq, REL_COND, 1);
repo_add_idarray(pd->repo, pd->handle, pd->reqtype, id);
break;
case STATE_GROUPID:
id = pool_str2id(pd->pool, join2(&pd->jd, "group", ":", pd->content), 1);
s->requires = repo_addid_dep(pd->repo, s->requires, id, 0);
break;
case STATE_USERVISIBLE:
repodata_set_void(pd->data, pd->handle, SOLVABLE_ISVISIBLE);
break;
case STATE_DISPLAY_ORDER:
case STATE_CDISPLAY_ORDER:
repodata_set_str(pd->data, pd->handle, SOLVABLE_ORDER, pd->content);
break;
case STATE_DEFAULT:
break;
case STATE_LANGONLY:
case STATE_LANG_ONLY:
break;
default:
break;
}
pd->state = pd->sbtab[pd->state];
pd->docontent = 0;
#if 0
fprintf(stderr, "end: [%s] -> %d\n", name, pd->state);
#endif
}
static void XMLCALL
characterData(void *userData, const XML_Char *s, int len)
{
struct parsedata *pd = userData;
int l;
char *c;
if (!pd->docontent)
return;
l = pd->lcontent + len + 1;
if (l > pd->acontent)
{
pd->content = solv_realloc(pd->content, l + 256);
pd->acontent = l + 256;
}
c = pd->content + pd->lcontent;
pd->lcontent += len;
while (len-- > 0)
*c++ = *s++;
*c = 0;
}
#define BUFF_SIZE 8192
int
repo_add_comps(Repo *repo, FILE *fp, int flags)
{
Repodata *data;
struct parsedata pd;
char buf[BUFF_SIZE];
int i, l;
struct stateswitch *sw;
XML_Parser parser;
data = repo_add_repodata(repo, flags);
memset(&pd, 0, sizeof(pd));
pd.repo = repo;
pd.pool = repo->pool;
pd.data = data;
pd.content = solv_malloc(256);
pd.acontent = 256;
for (i = 0, sw = stateswitches; sw->from != NUMSTATES; i++, sw++)
{
if (!pd.swtab[sw->from])
pd.swtab[sw->from] = sw;
pd.sbtab[sw->to] = sw->from;
}
parser = XML_ParserCreate(NULL);
XML_SetUserData(parser, &pd);
XML_SetElementHandler(parser, startElement, endElement);
XML_SetCharacterDataHandler(parser, characterData);
for (;;)
{
l = fread(buf, 1, sizeof(buf), fp);
if (XML_Parse(parser, buf, l, l == 0) == XML_STATUS_ERROR)
{
pool_debug(pd.pool, SOLV_ERROR, "%s at line %u:%u\n", XML_ErrorString(XML_GetErrorCode(parser)), (unsigned int)XML_GetCurrentLineNumber(parser), (unsigned int)XML_GetCurrentColumnNumber(parser));
break;
}
if (l == 0)
break;
}
XML_ParserFree(parser);
solv_free(pd.content);
join_freemem(&pd.jd);
if (!(flags & REPO_NO_INTERNALIZE))
repodata_internalize(data);
return 0;
}
/* EOF */
|