Menu

[d6dad6]: / src / xml_elem.c  Maximize  Restore  History

Download this file

287 lines (241 with data), 8.0 kB

  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
/* $Id: xml_elem.c,v 1.23 2004/11/21 23:40:40 mgrouch Exp $ */
/*
XMLStarlet: Command Line Toolkit to query/edit/check/transform XML documents
Copyright (c) 2002-2004 Mikhail Grushinskiy. All Rights Reserved.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include <config.h>
#include <libxml/xmlstring.h>
#include <libxml/hash.h>
#include <stdlib.h>
#include <string.h>
#include "xmlstar.h"
#include "escape.h"
/* TODO:
2. Option to display this only for nodes matching
an XPATH expression
-p <xpath>
so it will be able to deal with subtrees as well
*/
typedef struct _elOptions {
int show_attr; /* show attributes */
int show_attr_and_val; /* show attributes and values */
int sort_uniq; /* do sort and uniq on output */
int check_depth; /* limit depth */
} elOptions;
static elOptions elOps;
static xmlHashTablePtr uniq = NULL;
static xmlChar *curXPath = NULL;
/**
* Display usage syntax
*/
void
elUsage(int argc, char **argv, exit_status status)
{
extern void fprint_elem_usage(FILE* o, const char* argv0);
extern const char more_info[];
FILE *o = (status == EXIT_SUCCESS)? stdout : stderr;
fprint_elem_usage(o, argv[0]);
fprintf(o, "%s", more_info);
exit(status);
}
/**
* read file and print element paths
*/
int
parse_xml_file(const char *filename)
{
int ret, prev_depth = 0;
xmlTextReaderPtr reader;
for (reader = xmlReaderForFile(filename, NULL, 0);;)
{
int depth;
const xmlChar *name;
xmlReaderTypes type;
if (!reader) {
fprintf(stderr, "couldn't read file '%s'\n", filename);
exit(EXIT_BAD_FILE);
}
ret = xmlTextReaderRead(reader);
if (ret <= 0) break;
type = xmlTextReaderNodeType(reader);
depth = xmlTextReaderDepth(reader);
name = xmlTextReaderConstName(reader);
if (type != XML_READER_TYPE_ELEMENT)
continue;
while (curXPath && depth <= prev_depth)
{
xmlChar *slash = BAD_CAST strrchr((char*) curXPath, '/');
if (slash) *slash = '\0';
prev_depth--;
}
prev_depth = depth;
if (depth > 0) curXPath = xmlStrcat(curXPath, BAD_CAST "/");
curXPath = xmlStrcat(curXPath, name);
if (elOps.show_attr)
{
int have_attr;
fprintf(stdout, "%s\n", curXPath);
for (have_attr = xmlTextReaderMoveToFirstAttribute(reader);
have_attr;
have_attr = xmlTextReaderMoveToNextAttribute(reader))
{
const xmlChar *aname = xmlTextReaderConstName(reader);
fprintf(stdout, "%s/@%s\n", curXPath, aname);
}
}
else if (elOps.show_attr_and_val)
{
fprintf(stdout, "%s", curXPath);
if (xmlTextReaderHasAttributes(reader))
{
int have_attr, first = 1;
fprintf(stdout, "[");
for (have_attr = xmlTextReaderMoveToFirstAttribute(reader);
have_attr;
have_attr = xmlTextReaderMoveToNextAttribute(reader))
{
const xmlChar *aname = xmlTextReaderConstName(reader),
*avalue = xmlTextReaderConstValue(reader);
char quote;
if (!first)
fprintf(stdout, " and ");
first = 0;
quote = xmlStrchr(avalue, '\'')? '"' : '\'';
fprintf(stdout, "@%s=%c%s%c", aname, quote, avalue, quote);
}
fprintf(stdout, "]");
}
fprintf(stdout, "\n");
}
else if (elOps.sort_uniq)
{
if ((elOps.check_depth == 0) || (elOps.check_depth != 0 && depth < elOps.check_depth))
{
xmlHashAddEntry(uniq, curXPath, (void*) 1);
}
}
else fprintf(stdout, "%s\n", curXPath);
}
return ret == -1? EXIT_LIB_ERROR : ret;
}
/**
* Initialize options values
*/
void
elInitOptions(elOptions *ops)
{
ops->show_attr = 0;
ops->show_attr_and_val = 0;
ops->sort_uniq = 0;
ops->check_depth = 0;
}
typedef struct {
xmlChar **array;
int offset;
} ArrayDest;
/**
* put @name into @data->array[@data->offset]
*/
static void
hash_key_put(void *payload, void *data, xmlChar *name)
{
ArrayDest *dest = data;
dest->array[dest->offset++] = name;
}
/**
* a compare function for qsort
* takes pointers to 2 xmlChar* and compares them
*/
static int
compare_string_ptr(const void *p1, const void *p2)
{
typedef xmlChar const *const xmlCChar;
xmlCChar *str1 = p1, *str2 = p2;
return xmlStrcmp(*str1, *str2);
}
/**
* This is the main function for 'el' option
*/
int
elMain(int argc, char **argv)
{
int errorno = 0;
char* inp_file = "-";
if (argc <= 1) elUsage(argc, argv, EXIT_BAD_ARGS);
elInitOptions(&elOps);
if (argc == 2)
errorno = parse_xml_file("-");
else
{
if (!strcmp(argv[2], "--help") || !strcmp(argv[2], "-h") ||
!strcmp(argv[2], "-?") || !strcmp(argv[2], "-Z"))
{
elUsage(argc, argv, EXIT_SUCCESS);
}
else if (!strcmp(argv[2], "-a"))
{
elOps.show_attr = 1;
if (argc >= 4) inp_file = argv[3];
errorno = parse_xml_file(inp_file);
}
else if (!strcmp(argv[2], "-v"))
{
elOps.show_attr_and_val = 1;
if (argc >= 4) inp_file = argv[3];
errorno = parse_xml_file(inp_file);
}
else if (!strcmp(argv[2], "-u"))
{
elOps.sort_uniq = 1;
if (argc >= 4) inp_file = argv[3];
uniq = xmlHashCreate(0);
errorno = parse_xml_file(inp_file);
}
else if (!strncmp(argv[2], "-d", 2))
{
elOps.check_depth = atoi(argv[2]+2);
/* printf("Checking depth (%d)\n", elOps.check_depth); */
elOps.sort_uniq = 1;
if (argc >= 4) inp_file = argv[3];
uniq = xmlHashCreate(0);
errorno = parse_xml_file(inp_file);
}
else if (argv[2][0] != '-')
{
errorno = parse_xml_file(argv[2]);
}
else
elUsage(argc, argv, EXIT_BAD_ARGS);
}
if (uniq)
{
int i;
ArrayDest lines;
lines.array = xmlMalloc(sizeof(xmlChar*) * xmlHashSize(uniq));
lines.offset = 0;
xmlHashScan(uniq, hash_key_put, &lines);
qsort(lines.array, lines.offset, sizeof(xmlChar*), compare_string_ptr);
for (i = 0; i < lines.offset; i++)
{
printf("%s\n", lines.array[i]);
}
xmlFree(lines.array);
xmlHashFree(uniq, NULL);
}
return errorno;
}
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.