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
|
/* This file is part of the Zebra server.
Copyright (C) Index Data
Zebra is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2, or (at your option) any later
version.
Zebra 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 General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/* converts data1 tree to XML record */
#if HAVE_CONFIG_H
#include <config.h>
#endif
#include <string.h>
#include <idzebra/data1.h>
#include <yaz/wrbuf.h>
#define IDSGML_MARGIN 75
#define PRETTY_FORMAT 0
static int wordlen(char *b, int max)
{
int l = 0;
while (l < max && !d1_isspace(*b))
l++, b++;
return l;
}
static void indent(WRBUF b, int col)
{
int i;
for (i = 0; i < col; i++)
wrbuf_putc(b, ' ');
}
static void wrbuf_put_xattr(WRBUF b, data1_xattr *p)
{
for (; p; p = p->next)
{
wrbuf_putc (b, ' ');
if (p->what == DATA1I_xmltext)
wrbuf_puts(b, p->name);
else
wrbuf_xmlputs(b, p->name);
if (p->value)
{
wrbuf_putc(b, '=');
wrbuf_putc(b, '"');
if (p->what == DATA1I_text)
wrbuf_xmlputs(b, p->value);
else
wrbuf_puts(b, p->value);
wrbuf_putc(b, '"');
}
}
}
static void wrbuf_write_tag(WRBUF b, const char *tag, int opening)
{
int i, fixup = 0;
/* see if we must fix the tag.. The grs.marc filter produces
a data1 tree with not well-formed XML */
if (*tag >= '0' && *tag <= '9')
fixup = 1;
for (i = 0; tag[i]; i++)
if (strchr( " <>$,()[]", tag[i]))
fixup = 1;
if (fixup)
{
wrbuf_puts(b, "tag");
if (opening)
{
wrbuf_puts(b, " value=\"");
wrbuf_xmlputs(b, tag);
wrbuf_puts(b, "\"");
}
}
else
wrbuf_puts(b, tag);
}
static int nodetoidsgml(data1_node *n, int select, WRBUF b, int col,
int pretty_format)
{
data1_node *c;
for (c = n->child; c; c = c->next)
{
char *tag;
if (c->which == DATA1N_preprocess)
{
if (pretty_format)
indent(b, col);
wrbuf_puts(b, "<?");
wrbuf_xmlputs(b, c->u.preprocess.target);
wrbuf_put_xattr(b, c->u.preprocess.attributes);
if (c->child)
wrbuf_puts(b, " ");
if (nodetoidsgml(c, select, b, (col > 40) ? 40 : col+2,
pretty_format) < 0)
return -1;
wrbuf_puts(b, "?>\n");
}
else if (c->which == DATA1N_tag)
{
if (select && !c->u.tag.node_selected)
continue;
tag = c->u.tag.tag;
if (!data1_matchstr(tag, "wellknown")) /* skip wellknown */
{
if (nodetoidsgml(c, select, b, col, pretty_format) < 0)
return -1;
}
else
{
if (pretty_format)
indent (b, col);
wrbuf_puts(b, "<");
wrbuf_write_tag(b, tag, 1);
wrbuf_put_xattr(b, c->u.tag.attributes);
wrbuf_puts(b, ">");
if (pretty_format)
wrbuf_puts(b, "\n");
if (nodetoidsgml(c, select, b, (col > 40) ? 40 : col+2,
pretty_format) < 0)
return -1;
if (pretty_format)
indent (b, col);
wrbuf_puts(b, "</");
wrbuf_write_tag(b, tag, 0);
wrbuf_puts(b, ">");
if (pretty_format)
wrbuf_puts(b, "\n");
}
}
else if (c->which == DATA1N_data || c->which == DATA1N_comment)
{
char *p = c->u.data.data;
int l = c->u.data.len;
int first = 1;
int lcol = col;
if (pretty_format && !c->u.data.formatted_text)
indent(b, col);
if (c->which == DATA1N_comment)
wrbuf_puts(b, "<!--");
switch (c->u.data.what)
{
case DATA1I_xmltext:
wrbuf_write(b, c->u.data.data, c->u.data.len);
break;
case DATA1I_text:
if (!pretty_format || c->u.data.formatted_text)
{
wrbuf_xmlputs_n(b, p, l);
}
else
{
while (l)
{
int wlen;
while (l && d1_isspace(*p))
p++, l--;
if (!l)
break;
/* break if we cross margin and word is not too long */
if (lcol + (wlen = wordlen(p, l)) > IDSGML_MARGIN &&
wlen < IDSGML_MARGIN)
{
wrbuf_puts(b, "\n");
indent(b, col);
lcol = col;
first = 1;
}
if (!first)
{
wrbuf_putc(b, ' ');
lcol++;
}
while (l && !d1_isspace(*p))
{
wrbuf_putc(b, *p);
p++;
l--;
lcol++;
}
first = 0;
}
wrbuf_puts(b, "\n");
}
break;
case DATA1I_num:
wrbuf_xmlputs_n(b, c->u.data.data, c->u.data.len);
if (pretty_format)
wrbuf_puts(b, "\n");
break;
case DATA1I_oid:
wrbuf_xmlputs_n(b, c->u.data.data, c->u.data.len);
if (pretty_format)
wrbuf_puts(b, "\n");
}
if (c->which == DATA1N_comment)
{
wrbuf_puts(b, "-->");
if (pretty_format)
wrbuf_puts(b, "\n");
}
}
}
return 0;
}
char *data1_nodetoidsgml(data1_handle dh, data1_node *n, int select, int *len)
{
WRBUF b = data1_get_wrbuf(dh);
wrbuf_rewind(b);
if (!data1_is_xmlmode(dh))
{
wrbuf_puts(b, "<");
wrbuf_write_tag(b, n->u.root.type, 1);
wrbuf_puts(b, ">\n");
}
if (nodetoidsgml(n, select, b, 0, 0 /* no pretty format */))
return 0;
if (!data1_is_xmlmode(dh))
{
wrbuf_puts(b, "</");
wrbuf_write_tag(b, n->u.root.type, 0);
wrbuf_puts(b, ">\n");
}
*len = wrbuf_len(b);
return wrbuf_buf(b);
}
/*
* Local variables:
* c-basic-offset: 4
* c-file-style: "Stroustrup"
* indent-tabs-mode: nil
* End:
* vim: shiftwidth=4 tabstop=8 expandtab
*/
|
