1 /* This file is part of the Zebra server.
2 Copyright (C) 1995-2008 Index Data
4 Zebra is free software; you can redistribute it and/or modify it under
5 the terms of the GNU General Public License as published by the Free
6 Software Foundation; either version 2, or (at your option) any later
9 Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
10 WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 * This module reads "loose" SGML and converts it to data1 tree
29 #include <yaz/yaz-util.h>
32 data1_node *data1_get_root_tag (data1_handle dh, data1_node *n)
36 if (data1_is_xmlmode(dh))
39 while (n && n->which != DATA1N_tag)
46 * get the tag which is the immediate parent of this node (this may mean
47 * traversing intermediate things like variants and stuff.
49 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
51 if (data1_is_xmlmode(dh))
53 for (; n && n->which != DATA1N_root; n = n->parent)
54 if (n->which == DATA1N_tag && n->parent &&
55 n->parent->which != DATA1N_root)
60 for (; n && n->which != DATA1N_root; n = n->parent)
61 if (n->which == DATA1N_tag)
67 data1_node *data1_mk_node (data1_handle dh, NMEM m)
69 return data1_mk_node2 (dh, m, DATA1N_root, 0);
72 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
74 return data1_mk_node2 (dh, m, type, 0);
77 static void data1_init_node (data1_handle dh, data1_node *r, int type)
85 r->u.tag.no_data_requested = 0;
86 r->u.tag.node_selected = 0;
87 r->u.tag.make_variantlist = 0;
88 r->u.tag.get_bytes = -1;
89 r->u.tag.attributes = 0;
99 r->u.data.formatted_text = 0;
105 r->u.data.formatted_text = 1;
108 r->u.variant.type = 0;
109 r->u.variant.value = 0;
111 case DATA1N_preprocess:
112 r->u.preprocess.target = 0;
113 r->u.preprocess.attributes = 0;
116 yaz_log (YLOG_WARN, "data_mk_node_type. bad type = %d\n", type);
120 data1_node *data1_append_node (data1_handle dh, NMEM m, int type,
123 data1_node *r = (data1_node *)nmem_malloc(m, sizeof(*r));
124 r->next = r->child = r->last_child = 0;
131 r->root = parent->root;
133 parent->child = parent->last_child = r;
135 parent->last_child->next = r;
136 parent->last_child = r;
138 data1_init_node(dh, r, type);
142 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
145 return data1_append_node (dh, m, type, parent);
148 data1_node *data1_insert_node (data1_handle dh, NMEM m, int type,
151 data1_node *r = (data1_node *)nmem_malloc(m, sizeof(*r));
152 r->next = r->child = r->last_child = 0;
158 r->root = parent->root;
161 parent->last_child = r;
163 r->next = parent->child;
166 data1_init_node(dh, r, type);
170 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
172 data1_absyn *absyn = data1_get_absyn(dh, name, 1);
177 yaz_log(YLOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
179 /* It's now OK for a record not to have an absyn */
181 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
182 res->u.root.type = data1_insert_string (dh, res, nmem, name);
183 res->u.root.absyn = absyn;
187 void data1_set_root(data1_handle dh, data1_node *res,
188 NMEM nmem, const char *name)
190 data1_absyn *absyn = data1_get_absyn(
191 dh, name, DATA1_XPATH_INDEXING_ENABLE);
193 res->u.root.type = data1_insert_string (dh, res, nmem, name);
194 res->u.root.absyn = absyn;
197 void data1_add_attrs(data1_handle dh, NMEM nmem, const char **attr,
203 while (attr && *attr)
205 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
206 (*p)->name = nmem_strdup (nmem, *attr++);
207 (*p)->value = nmem_strdup (nmem, *attr++);
208 (*p)->what = DATA1I_text;
215 data1_node *data1_mk_preprocess (data1_handle dh, NMEM nmem,
217 const char **attr, data1_node *at)
219 return data1_mk_preprocess_n (dh, nmem, target, strlen(target),
223 data1_node *data1_mk_preprocess_n (data1_handle dh, NMEM nmem,
224 const char *target, size_t len,
225 const char **attr, data1_node *at)
227 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
228 res->u.preprocess.target = data1_insert_string_n (dh, res, nmem,
231 data1_add_attrs(dh, nmem, attr, &res->u.preprocess.attributes);
235 data1_node *data1_insert_preprocess (data1_handle dh, NMEM nmem,
237 const char **attr, data1_node *at)
239 return data1_insert_preprocess_n (dh, nmem, target, strlen(target),
243 data1_node *data1_insert_preprocess_n (data1_handle dh, NMEM nmem,
244 const char *target, size_t len,
245 const char **attr, data1_node *at)
247 data1_node *res = data1_insert_node (dh, nmem, DATA1N_preprocess, at);
248 res->u.preprocess.target = data1_insert_string_n (dh, res, nmem,
251 data1_add_attrs(dh, nmem, attr, &res->u.preprocess.attributes);
255 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
256 const char *tag, size_t len, const char **attr,
259 data1_node *partag = get_parent_tag(dh, at);
260 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
261 data1_element *e = 0;
263 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
265 if (!partag) /* top tag? */
266 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
267 0 /* index as local */,
271 /* only set element for known tags */
272 e = partag->u.tag.element;
274 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
277 res->u.tag.element = e;
278 data1_add_attrs(dh, nmem, attr, &res->u.tag.attributes);
282 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
283 data1_node *res, const char **attr)
285 if (res->which != DATA1N_tag)
288 data1_add_attrs(dh, nmem, attr, &res->u.tag.attributes);
291 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
292 const char *tag, const char **attr, data1_node *at)
294 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
297 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
302 n = data1_get_root_tag (dh, n);
307 for (; n; n = n->next)
308 if (n->which == DATA1N_tag && n->u.tag.tag &&
309 !yaz_matchstr (n->u.tag.tag, tag))
316 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
317 const char *tag, data1_node *at)
319 data1_node *node = data1_search_tag (dh, at->child, tag);
321 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
323 node->child = node->last_child = 0;
327 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
328 const char *buf, size_t len, data1_node *parent)
330 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
331 res->u.data.what = DATA1I_text;
332 res->u.data.len = len;
334 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
338 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
339 const char *buf, size_t len, data1_node *parent)
341 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
342 res->u.data.formatted_text = 1;
346 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
347 const char *buf, data1_node *parent)
349 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
352 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
353 const char *buf, size_t len,
356 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
357 res->u.data.what = DATA1I_text;
358 res->u.data.len = len;
360 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
364 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
365 const char *buf, data1_node *parent)
367 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
370 char *data1_insert_string_n (data1_handle dh, data1_node *res,
371 NMEM m, const char *str, size_t len)
374 if (len >= DATA1_LOCALDATA)
375 b = (char *) nmem_malloc (m, len+1);
378 memcpy (b, str, len);
383 char *data1_insert_string (data1_handle dh, data1_node *res,
384 NMEM m, const char *str)
386 return data1_insert_string_n (dh, res, m, str, strlen(str));
389 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
391 const char *tagname, NMEM m,
395 data1_node *root = at->root;
396 data1_node *partag = get_parent_tag (dh, at);
397 data1_element *e = NULL;
398 data1_node *datn = 0;
399 data1_node *tagn = 0;
402 e = data1_getelementbytagname (dh, root->u.root.absyn, 0, tagname);
405 e = partag->u.tag.element;
407 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
409 if (local_allowed || e)
412 tagn = data1_insert_node (dh, m, DATA1N_tag, at);
414 tagn = data1_append_node (dh, m, DATA1N_tag, at);
415 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
416 tagn->u.tag.element = e;
417 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
422 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
423 const char *tagname, NMEM m)
425 return data1_add_insert_taggeddata (dh, at, tagname, m, 1, 0);
430 * Insert a tagged node into the record root as first child of the node at
431 * which should be root or tag itself). Returns pointer to the data node,
432 * which can then be modified.
434 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
435 const char *tagname, NMEM m)
437 return data1_add_insert_taggeddata (dh, at, tagname, m, 0, 1);
440 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
441 data1_node *at, const char *tagname,
444 return data1_add_insert_taggeddata (dh, at, tagname, m, 0, 1);
447 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
448 data1_node *at, const char *tagname,
451 return data1_add_insert_taggeddata (dh, at, tagname, m, 1, 0);
454 data1_node *data1_mk_tag_data_zint (data1_handle dh, data1_node *at,
455 const char *tag, zint num,
458 data1_node *node_data;
460 node_data = data1_mk_tag_data (dh, at, tag, nmem);
463 node_data->u.data.what = DATA1I_num;
464 node_data->u.data.data = node_data->lbuf;
465 sprintf (node_data->u.data.data, ZINT_FORMAT, num);
466 node_data->u.data.len = strlen (node_data->u.data.data);
470 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
471 const char *tag, int num,
474 return data1_mk_tag_data_zint(dh, at, tag, num, nmem);
477 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
478 const char *tag, Odr_oid *oid,
481 data1_node *node_data;
482 char str[128], *p = str;
485 node_data = data1_mk_tag_data (dh, at, tag, nmem);
489 for (ii = oid; *ii >= 0; ii++)
493 sprintf (p, "%d", *ii);
496 node_data->u.data.what = DATA1I_oid;
497 node_data->u.data.len = strlen (str);
498 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
503 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
504 const char *tag, const char *str,
507 data1_node *node_data;
509 node_data = data1_mk_tag_data (dh, at, tag, nmem);
512 node_data->u.data.what = DATA1I_text;
513 node_data->u.data.len = strlen (str);
514 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
519 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
520 const char *tag, const char *str,
523 data1_node *node = data1_search_tag (dh, at->child, tag);
525 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
528 data1_node *node_data = node->child;
529 node_data->u.data.what = DATA1I_text;
530 node_data->u.data.len = strlen (str);
531 node_data->u.data.data = data1_insert_string (dh, node_data,
533 node_data->child = node_data->last_child = 0;
538 static int ampr (int (*get_byte)(void *fh), void *fh, int *amp)
541 int c = (*get_byte)(fh);
545 int c = (*get_byte)(fh);
560 if (!strcmp (ent, "quot"))
562 if (!strcmp (ent, "apos"))
564 if (!strcmp (ent, "gt"))
566 if (!strcmp (ent, "lt"))
568 if (!strcmp (ent, "amp"))
573 else if (c == 0 || d1_isspace(c))
583 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
584 int (*get_byte)(void *fh), void *fh,
585 WRBUF wrbuf, int *ch, int *amp)
587 data1_xattr *p_first = 0;
588 data1_xattr **pp = &p_first;
593 while (*amp || (c && d1_isspace(c)))
594 c = ampr (get_byte, fh, amp);
595 if (*amp == 0 && (c == 0 || c == '>' || c == '/'))
597 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
601 p->what = DATA1I_xmltext;
604 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
606 wrbuf_putc (wrbuf, c);
607 c = ampr (get_byte, fh, amp);
609 p->name = nmem_strdup (m, wrbuf_cstr(wrbuf));
612 c = ampr (get_byte, fh, amp);
613 if (*amp == 0 && c == '"')
615 c = ampr (get_byte, fh, amp);
617 while (*amp || (c && c != '"'))
619 wrbuf_putc (wrbuf, c);
620 c = ampr (get_byte, fh, amp);
623 c = ampr (get_byte, fh, amp);
625 else if (*amp == 0 && c == '\'')
627 c = ampr (get_byte, fh, amp);
629 while (*amp || (c && c != '\''))
631 wrbuf_putc (wrbuf, c);
632 c = ampr (get_byte, fh, amp);
635 c = ampr (get_byte, fh, amp);
640 while (*amp || (c && c != '>' && c != '/'))
642 wrbuf_putc (wrbuf, c);
643 c = ampr (get_byte, fh, amp);
646 p->value = nmem_strdup(m, wrbuf_cstr(wrbuf));
654 * Ugh. Sometimes functions just grow and grow on you. This one reads a
655 * 'node' and its children.
657 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
658 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
660 data1_node *d1_stack[256];
667 c = ampr (get_byte, fh, &);
670 data1_node *parent = level ? d1_stack[level-1] : 0;
672 if (amp == 0 && c == '<') /* beginning of tag */
681 c = ampr (get_byte, fh, &);
682 if (amp == 0 && c == '/')
685 c = ampr (get_byte, fh, &);
687 else if (amp == 0 && c == '?')
690 while ((c = ampr(get_byte, fh, &)))
702 c = ampr(get_byte, fh, &);
708 if (amp == 0 && c == quote_mode)
714 else if (amp == 0 && c == '!')
720 c0 = ampr (get_byte, fh, &0);
721 if (amp0 == 0 && c0 == '\0')
723 c = ampr (get_byte, fh, &);
725 if (amp0 == 0 && c0 == '-' && amp == 0 && c == '-')
727 /* COMMENT: <!-- ... --> */
730 c = ampr (get_byte, fh, &);
733 if (amp == 0 && c == '-')
735 else if (amp == 0 && c == '>' && no_dash >= 2)
741 wrbuf_buf(wrbuf), wrbuf_len(wrbuf)-2,
743 c = ampr (get_byte, fh, &); /* skip > */
748 wrbuf_putc (wrbuf, c);
749 c = ampr (get_byte, fh, &);
754 { /* DIRECTIVE: <! .. > */
759 if (amp == 0 && c == '>' && blevel == 0)
761 c = ampr (get_byte, fh, &);
764 if (amp == 0 && c == '[')
766 if (amp == 0 && c == ']' && blevel > 0)
768 c = ampr (get_byte, fh, &);
773 while (amp || (c && c != '>' && c != '/' && !d1_isspace(c)))
775 if (i < (sizeof(tag)-1))
777 c = ampr (get_byte, fh, &);
780 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c, &);
781 if (amp == 0 && c == '/')
782 { /* <tag attrs/> or <tag/> */
784 c = ampr (get_byte, fh, &);
788 yaz_log(YLOG_WARN, "d1: %d: Malformed tag", line);
792 c = ampr (get_byte, fh, &);
804 parent = d1_stack[--i];
805 if ((parent->which == DATA1N_root &&
806 !strcmp(tag, parent->u.root.type)) ||
807 (parent->which == DATA1N_tag &&
808 !strcmp(tag, parent->u.tag.tag)))
816 yaz_log (YLOG_WARN, "%d: no begin tag for %s",
821 if (data1_is_xmlmode(dh))
833 else if (!strcmp(tag, "var")
834 && xattr && xattr->next && xattr->next->next
836 && xattr->next->value == 0
837 && xattr->next->next->value == 0)
839 /* <var class type value> */
840 const char *tclass = xattr->name;
841 const char *type = xattr->next->name;
842 const char *value = xattr->next->name;
845 yaz_log(YLOG_LOG, "Variant class=%s type=%s value=%s",
846 tclass, type, value);
848 data1_getvartypebyct(dh,
849 parent->root->u.root.absyn->varset,
853 * If we're the first variant in this group, create a parent
854 * variant, and insert it before the current variant.
856 if (parent->which != DATA1N_variant)
858 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
863 * now determine if one of our ancestor triples is of
864 * same type. If so, we break here.
867 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
868 if (d1_stack[i]->u.variant.type == tp)
873 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
874 res->u.variant.type = tp;
875 res->u.variant.value =
876 data1_insert_string (dh, res, m, value);
882 /* tag .. acquire our element in the abstract syntax */
885 parent = data1_mk_root (dh, m, tag);
886 res = d1_stack[level] = parent;
888 if (data1_is_xmlmode(dh))
891 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
892 res->u.tag.attributes = xattr;
897 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
898 res->u.tag.attributes = xattr;
901 d1_stack[level] = res;
902 d1_stack[level+1] = 0;
903 if (level < 250 && !null_tag)
906 else /* != '<'... this is a body of text */
912 c = ampr (get_byte, fh, &);
915 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
916 res->u.data.what = DATA1I_xmltext;
917 res->u.data.formatted_text = 0;
918 d1_stack[level] = res;
922 while (amp || (c && c != '<'))
924 wrbuf_putc (wrbuf, c);
925 c = ampr (get_byte, fh, &);
927 len = wrbuf_len(wrbuf);
929 /* use local buffer of nmem if too large */
930 if (len >= DATA1_LOCALDATA)
931 res->u.data.data = (char*) nmem_malloc (m, len);
933 res->u.data.data = res->lbuf;
936 memcpy (res->u.data.data, wrbuf_buf(wrbuf), len);
938 res->u.data.data = 0;
939 res->u.data.len = len;
945 int getc_mem (void *fh)
947 const char **p = (const char **) fh;
953 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
955 WRBUF wrbuf = wrbuf_alloc();
958 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
959 wrbuf_destroy(wrbuf);
964 * Read a record in the native syntax.
966 data1_node *data1_read_record(data1_handle dh,
967 int (*rf)(void *, char *, size_t), void *fh,
971 char **buf = data1_get_read_buf (dh, &size);
976 *buf = (char *)xmalloc(*size = 4096);
980 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
982 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
988 return data1_read_node(dh, &bp, m);
997 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
999 const char *bp = buf;
1000 return data1_read_node (dh, &bp, m);
1004 static int conv_item(NMEM m, yaz_iconv_t t,
1005 WRBUF wrbuf, char *inbuf, size_t inlen)
1007 wrbuf_rewind(wrbuf);
1008 wrbuf_iconv_write(wrbuf, t, inbuf, inlen);
1009 wrbuf_iconv_reset(wrbuf, t);
1013 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
1014 yaz_iconv_t t, WRBUF wrbuf, const char *tocode)
1016 for (; n; n = n->next)
1021 case DATA1N_comment:
1022 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
1025 data1_insert_string_n (dh, n, m, wrbuf->buf,
1027 n->u.data.len = wrbuf->pos;
1031 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
1035 data1_insert_string_n (dh, n, m,
1036 wrbuf->buf, wrbuf->pos);
1038 if (n->u.tag.attributes)
1041 for (p = n->u.tag.attributes; p; p = p->next)
1044 conv_item(m, t, wrbuf, p->value, strlen(p->value))
1047 p->value = nmem_strdup(m, wrbuf_cstr(wrbuf));
1052 case DATA1N_preprocess:
1053 if (strcmp(n->u.preprocess.target, "xml") == 0)
1055 data1_xattr *p = n->u.preprocess.attributes;
1056 for (; p; p = p->next)
1057 if (strcmp (p->name, "encoding") == 0)
1058 p->value = nmem_strdup (m, tocode);
1062 data1_iconv_s (dh, m, n->child, t, wrbuf, tocode);
1066 const char *data1_get_encoding (data1_handle dh, data1_node *n)
1068 /* see if we have an xml header that specifies encoding */
1069 if (n && n->child && n->child->which == DATA1N_preprocess &&
1070 strcmp (n->child->u.preprocess.target, "xml") == 0)
1072 data1_xattr *xp = n->child->u.preprocess.attributes;
1073 for (; xp; xp = xp->next)
1074 if (!strcmp (xp->name, "encoding") == 0)
1077 /* no encoding in header, so see if "encoding" was specified for abs */
1078 if (n && n->which == DATA1N_root &&
1079 n->u.root.absyn && n->u.root.absyn->encoding)
1080 return n->u.root.absyn->encoding;
1081 /* none of above, return a hard coded default */
1082 return "ISO-8859-1";
1085 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
1087 const char *fromcode)
1089 if (yaz_matchstr (tocode, fromcode))
1091 WRBUF wrbuf = wrbuf_alloc();
1092 yaz_iconv_t t = yaz_iconv_open(tocode, fromcode);
1095 wrbuf_destroy(wrbuf);
1098 data1_iconv_s(dh, m, n, t, wrbuf, tocode);
1100 wrbuf_destroy(wrbuf);
1105 void data1_chop_text(data1_handle dh, NMEM m, data1_node *n)
1107 for (; n; n = n->next)
1109 if (n->which == DATA1N_data)
1112 int sz = n->u.data.len;
1113 const char *ndata = n->u.data.data;
1116 for (off = 0; off < sz; off++)
1117 if (!d1_isspace(ndata[off]))
1122 while (sz && d1_isspace(ndata[sz - 1]))
1125 n->u.data.data = nmem_malloc(m, sz);
1127 memcpy(n->u.data.data, ndata, sz);
1130 data1_chop_text(dh, m, n->child);
1134 void data1_concat_text(data1_handle dh, NMEM m, data1_node *n)
1136 for (; n; n = n->next)
1138 if (n->which == DATA1N_data && n->next &&
1139 n->next->which == DATA1N_data)
1145 for (np = n; np && np->which == DATA1N_data; np=np->next)
1146 sz += np->u.data.len;
1147 ndata = nmem_malloc(m, sz);
1148 for (np = n; np && np->which == DATA1N_data; np=np->next)
1150 memcpy(ndata+off, np->u.data.data, np->u.data.len);
1151 off += np->u.data.len;
1153 n->u.data.data = ndata;
1156 if (!np && n->parent)
1157 n->parent->last_child = n;
1160 data1_concat_text(dh, m, n->child);
1167 * indent-tabs-mode: nil
1169 * vim: shiftwidth=4 tabstop=8 expandtab