1 /* $Id: d1_read.c,v 1.27 2007-06-27 22:04:45 adam Exp $
2 Copyright (C) 1995-2007
5 This file is part of the Zebra server.
7 Zebra is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
25 * This module reads "loose" SGML and converts it to data1 tree
32 #include <yaz/yaz-util.h>
35 data1_node *data1_get_root_tag (data1_handle dh, data1_node *n)
39 if (data1_is_xmlmode(dh))
42 while (n && n->which != DATA1N_tag)
49 * get the tag which is the immediate parent of this node (this may mean
50 * traversing intermediate things like variants and stuff.
52 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
54 if (data1_is_xmlmode(dh))
56 for (; n && n->which != DATA1N_root; n = n->parent)
57 if (n->which == DATA1N_tag && n->parent &&
58 n->parent->which != DATA1N_root)
63 for (; n && n->which != DATA1N_root; n = n->parent)
64 if (n->which == DATA1N_tag)
70 data1_node *data1_mk_node (data1_handle dh, NMEM m)
72 return data1_mk_node2 (dh, m, DATA1N_root, 0);
75 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
77 return data1_mk_node2 (dh, m, type, 0);
80 static void data1_init_node (data1_handle dh, data1_node *r, int type)
88 r->u.tag.no_data_requested = 0;
89 r->u.tag.node_selected = 0;
90 r->u.tag.make_variantlist = 0;
91 r->u.tag.get_bytes = -1;
92 r->u.tag.attributes = 0;
102 r->u.data.formatted_text = 0;
108 r->u.data.formatted_text = 1;
111 r->u.variant.type = 0;
112 r->u.variant.value = 0;
114 case DATA1N_preprocess:
115 r->u.preprocess.target = 0;
116 r->u.preprocess.attributes = 0;
119 yaz_log (YLOG_WARN, "data_mk_node_type. bad type = %d\n", type);
123 data1_node *data1_append_node (data1_handle dh, NMEM m, int type,
126 data1_node *r = (data1_node *)nmem_malloc(m, sizeof(*r));
127 r->next = r->child = r->last_child = 0;
134 r->root = parent->root;
136 parent->child = parent->last_child = r;
138 parent->last_child->next = r;
139 parent->last_child = r;
141 data1_init_node(dh, r, type);
145 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
148 return data1_append_node (dh, m, type, parent);
151 data1_node *data1_insert_node (data1_handle dh, NMEM m, int type,
154 data1_node *r = (data1_node *)nmem_malloc(m, sizeof(*r));
155 r->next = r->child = r->last_child = 0;
161 r->root = parent->root;
164 parent->last_child = r;
166 r->next = parent->child;
169 data1_init_node(dh, r, type);
173 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
175 data1_absyn *absyn = data1_get_absyn(dh, name, 1);
180 yaz_log(YLOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
182 /* It's now OK for a record not to have an absyn */
184 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
185 res->u.root.type = data1_insert_string (dh, res, nmem, name);
186 res->u.root.absyn = absyn;
190 void data1_set_root(data1_handle dh, data1_node *res,
191 NMEM nmem, const char *name)
193 data1_absyn *absyn = data1_get_absyn(
194 dh, name, DATA1_XPATH_INDEXING_ENABLE);
196 res->u.root.type = data1_insert_string (dh, res, nmem, name);
197 res->u.root.absyn = absyn;
200 void data1_add_attrs(data1_handle dh, NMEM nmem, const char **attr,
206 while (attr && *attr)
208 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
209 (*p)->name = nmem_strdup (nmem, *attr++);
210 (*p)->value = nmem_strdup (nmem, *attr++);
211 (*p)->what = DATA1I_text;
218 data1_node *data1_mk_preprocess (data1_handle dh, NMEM nmem,
220 const char **attr, data1_node *at)
222 return data1_mk_preprocess_n (dh, nmem, target, strlen(target),
226 data1_node *data1_mk_preprocess_n (data1_handle dh, NMEM nmem,
227 const char *target, size_t len,
228 const char **attr, data1_node *at)
230 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
231 res->u.preprocess.target = data1_insert_string_n (dh, res, nmem,
234 data1_add_attrs(dh, nmem, attr, &res->u.preprocess.attributes);
238 data1_node *data1_insert_preprocess (data1_handle dh, NMEM nmem,
240 const char **attr, data1_node *at)
242 return data1_insert_preprocess_n (dh, nmem, target, strlen(target),
246 data1_node *data1_insert_preprocess_n (data1_handle dh, NMEM nmem,
247 const char *target, size_t len,
248 const char **attr, data1_node *at)
250 data1_node *res = data1_insert_node (dh, nmem, DATA1N_preprocess, at);
251 res->u.preprocess.target = data1_insert_string_n (dh, res, nmem,
254 data1_add_attrs(dh, nmem, attr, &res->u.preprocess.attributes);
258 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
259 const char *tag, size_t len, const char **attr,
262 data1_node *partag = get_parent_tag(dh, at);
263 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
264 data1_element *e = 0;
266 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
268 if (!partag) /* top tag? */
269 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
270 0 /* index as local */,
274 /* only set element for known tags */
275 e = partag->u.tag.element;
277 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
280 res->u.tag.element = e;
281 data1_add_attrs(dh, nmem, attr, &res->u.tag.attributes);
285 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
286 data1_node *res, const char **attr)
288 if (res->which != DATA1N_tag)
291 data1_add_attrs(dh, nmem, attr, &res->u.tag.attributes);
294 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
295 const char *tag, const char **attr, data1_node *at)
297 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
300 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
305 n = data1_get_root_tag (dh, n);
310 for (; n; n = n->next)
311 if (n->which == DATA1N_tag && n->u.tag.tag &&
312 !yaz_matchstr (n->u.tag.tag, tag))
319 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
320 const char *tag, data1_node *at)
322 data1_node *node = data1_search_tag (dh, at->child, tag);
324 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
326 node->child = node->last_child = 0;
330 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
331 const char *buf, size_t len, data1_node *parent)
333 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
334 res->u.data.what = DATA1I_text;
335 res->u.data.len = len;
337 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
341 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
342 const char *buf, size_t len, data1_node *parent)
344 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
345 res->u.data.formatted_text = 1;
349 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
350 const char *buf, data1_node *parent)
352 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
355 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
356 const char *buf, size_t len,
359 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
360 res->u.data.what = DATA1I_text;
361 res->u.data.len = len;
363 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
367 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
368 const char *buf, data1_node *parent)
370 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
373 char *data1_insert_string_n (data1_handle dh, data1_node *res,
374 NMEM m, const char *str, size_t len)
377 if (len >= DATA1_LOCALDATA)
378 b = (char *) nmem_malloc (m, len+1);
381 memcpy (b, str, len);
386 char *data1_insert_string (data1_handle dh, data1_node *res,
387 NMEM m, const char *str)
389 return data1_insert_string_n (dh, res, m, str, strlen(str));
392 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
394 const char *tagname, NMEM m,
398 data1_node *root = at->root;
399 data1_node *partag = get_parent_tag (dh, at);
400 data1_element *e = NULL;
401 data1_node *datn = 0;
402 data1_node *tagn = 0;
405 e = data1_getelementbytagname (dh, root->u.root.absyn, 0, tagname);
408 e = partag->u.tag.element;
410 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
412 if (local_allowed || e)
415 tagn = data1_insert_node (dh, m, DATA1N_tag, at);
417 tagn = data1_append_node (dh, m, DATA1N_tag, at);
418 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
419 tagn->u.tag.element = e;
420 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
425 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
426 const char *tagname, NMEM m)
428 return data1_add_insert_taggeddata (dh, at, tagname, m, 1, 0);
433 * Insert a tagged node into the record root as first child of the node at
434 * which should be root or tag itself). Returns pointer to the data node,
435 * which can then be modified.
437 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
438 const char *tagname, NMEM m)
440 return data1_add_insert_taggeddata (dh, at, tagname, m, 0, 1);
443 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
444 data1_node *at, const char *tagname,
447 return data1_add_insert_taggeddata (dh, at, tagname, m, 0, 1);
450 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
451 data1_node *at, const char *tagname,
454 return data1_add_insert_taggeddata (dh, at, tagname, m, 1, 0);
457 data1_node *data1_mk_tag_data_zint (data1_handle dh, data1_node *at,
458 const char *tag, zint num,
461 data1_node *node_data;
463 node_data = data1_mk_tag_data (dh, at, tag, nmem);
466 node_data->u.data.what = DATA1I_num;
467 node_data->u.data.data = node_data->lbuf;
468 sprintf (node_data->u.data.data, ZINT_FORMAT, num);
469 node_data->u.data.len = strlen (node_data->u.data.data);
473 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
474 const char *tag, int num,
477 return data1_mk_tag_data_zint(dh, at, tag, num, nmem);
480 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
481 const char *tag, Odr_oid *oid,
484 data1_node *node_data;
485 char str[128], *p = str;
488 node_data = data1_mk_tag_data (dh, at, tag, nmem);
492 for (ii = oid; *ii >= 0; ii++)
496 sprintf (p, "%d", *ii);
499 node_data->u.data.what = DATA1I_oid;
500 node_data->u.data.len = strlen (str);
501 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
506 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
507 const char *tag, const char *str,
510 data1_node *node_data;
512 node_data = data1_mk_tag_data (dh, at, tag, nmem);
515 node_data->u.data.what = DATA1I_text;
516 node_data->u.data.len = strlen (str);
517 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
522 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
523 const char *tag, const char *str,
526 data1_node *node = data1_search_tag (dh, at->child, tag);
528 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
531 data1_node *node_data = node->child;
532 node_data->u.data.what = DATA1I_text;
533 node_data->u.data.len = strlen (str);
534 node_data->u.data.data = data1_insert_string (dh, node_data,
536 node_data->child = node_data->last_child = 0;
541 static int ampr (int (*get_byte)(void *fh), void *fh, int *amp)
544 int c = (*get_byte)(fh);
548 int c = (*get_byte)(fh);
563 if (!strcmp (ent, "quot"))
565 if (!strcmp (ent, "apos"))
567 if (!strcmp (ent, "gt"))
569 if (!strcmp (ent, "lt"))
571 if (!strcmp (ent, "amp"))
576 else if (c == 0 || d1_isspace(c))
586 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
587 int (*get_byte)(void *fh), void *fh,
588 WRBUF wrbuf, int *ch, int *amp)
590 data1_xattr *p_first = 0;
591 data1_xattr **pp = &p_first;
596 while (*amp || (c && d1_isspace(c)))
597 c = ampr (get_byte, fh, amp);
598 if (*amp == 0 && (c == 0 || c == '>' || c == '/'))
600 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
604 p->what = DATA1I_xmltext;
607 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
609 wrbuf_putc (wrbuf, c);
610 c = ampr (get_byte, fh, amp);
612 p->name = nmem_strdup (m, wrbuf_cstr(wrbuf));
615 c = ampr (get_byte, fh, amp);
616 if (*amp == 0 && c == '"')
618 c = ampr (get_byte, fh, amp);
620 while (*amp || (c && c != '"'))
622 wrbuf_putc (wrbuf, c);
623 c = ampr (get_byte, fh, amp);
626 c = ampr (get_byte, fh, amp);
628 else if (*amp == 0 && c == '\'')
630 c = ampr (get_byte, fh, amp);
632 while (*amp || (c && c != '\''))
634 wrbuf_putc (wrbuf, c);
635 c = ampr (get_byte, fh, amp);
638 c = ampr (get_byte, fh, amp);
643 while (*amp || (c && c != '>' && c != '/'))
645 wrbuf_putc (wrbuf, c);
646 c = ampr (get_byte, fh, amp);
649 p->value = nmem_strdup(m, wrbuf_cstr(wrbuf));
657 * Ugh. Sometimes functions just grow and grow on you. This one reads a
658 * 'node' and its children.
660 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
661 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
663 data1_node *d1_stack[256];
670 c = ampr (get_byte, fh, &);
673 data1_node *parent = level ? d1_stack[level-1] : 0;
675 if (amp == 0 && c == '<') /* beginning of tag */
684 c = ampr (get_byte, fh, &);
685 if (amp == 0 && c == '/')
688 c = ampr (get_byte, fh, &);
690 else if (amp == 0 && c == '?')
693 while ((c = ampr(get_byte, fh, &)))
705 c = ampr(get_byte, fh, &);
711 if (amp == 0 && c == quote_mode)
717 else if (amp == 0 && c == '!')
723 c0 = ampr (get_byte, fh, &0);
724 if (amp0 == 0 && c0 == '\0')
726 c = ampr (get_byte, fh, &);
728 if (amp0 == 0 && c0 == '-' && amp == 0 && c == '-')
730 /* COMMENT: <!-- ... --> */
733 c = ampr (get_byte, fh, &);
736 if (amp == 0 && c == '-')
738 else if (amp == 0 && c == '>' && no_dash >= 2)
744 wrbuf_buf(wrbuf), wrbuf_len(wrbuf)-2,
746 c = ampr (get_byte, fh, &); /* skip > */
751 wrbuf_putc (wrbuf, c);
752 c = ampr (get_byte, fh, &);
757 { /* DIRECTIVE: <! .. > */
762 if (amp == 0 && c == '>' && blevel == 0)
764 c = ampr (get_byte, fh, &);
767 if (amp == 0 && c == '[')
769 if (amp == 0 && c == ']' && blevel > 0)
771 c = ampr (get_byte, fh, &);
776 while (amp || (c && c != '>' && c != '/' && !d1_isspace(c)))
778 if (i < (sizeof(tag)-1))
780 c = ampr (get_byte, fh, &);
783 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c, &);
784 if (amp == 0 && c == '/')
785 { /* <tag attrs/> or <tag/> */
787 c = ampr (get_byte, fh, &);
791 yaz_log(YLOG_WARN, "d1: %d: Malformed tag", line);
795 c = ampr (get_byte, fh, &);
807 parent = d1_stack[--i];
808 if ((parent->which == DATA1N_root &&
809 !strcmp(tag, parent->u.root.type)) ||
810 (parent->which == DATA1N_tag &&
811 !strcmp(tag, parent->u.tag.tag)))
819 yaz_log (YLOG_WARN, "%d: no begin tag for %s",
824 if (data1_is_xmlmode(dh))
836 else if (!strcmp(tag, "var")
837 && xattr && xattr->next && xattr->next->next
839 && xattr->next->value == 0
840 && xattr->next->next->value == 0)
842 /* <var class type value> */
843 const char *tclass = xattr->name;
844 const char *type = xattr->next->name;
845 const char *value = xattr->next->name;
848 yaz_log(YLOG_LOG, "Variant class=%s type=%s value=%s",
849 tclass, type, value);
851 data1_getvartypebyct(dh,
852 parent->root->u.root.absyn->varset,
856 * If we're the first variant in this group, create a parent
857 * variant, and insert it before the current variant.
859 if (parent->which != DATA1N_variant)
861 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
866 * now determine if one of our ancestor triples is of
867 * same type. If so, we break here.
870 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
871 if (d1_stack[i]->u.variant.type == tp)
876 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
877 res->u.variant.type = tp;
878 res->u.variant.value =
879 data1_insert_string (dh, res, m, value);
885 /* tag .. acquire our element in the abstract syntax */
888 parent = data1_mk_root (dh, m, tag);
889 res = d1_stack[level] = parent;
891 if (data1_is_xmlmode(dh))
894 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
895 res->u.tag.attributes = xattr;
900 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
901 res->u.tag.attributes = xattr;
904 d1_stack[level] = res;
905 d1_stack[level+1] = 0;
906 if (level < 250 && !null_tag)
909 else /* != '<'... this is a body of text */
915 c = ampr (get_byte, fh, &);
918 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
919 res->u.data.what = DATA1I_xmltext;
920 res->u.data.formatted_text = 0;
921 d1_stack[level] = res;
925 while (amp || (c && c != '<'))
927 wrbuf_putc (wrbuf, c);
928 c = ampr (get_byte, fh, &);
930 len = wrbuf_len(wrbuf);
932 /* use local buffer of nmem if too large */
933 if (len >= DATA1_LOCALDATA)
934 res->u.data.data = (char*) nmem_malloc (m, len);
936 res->u.data.data = res->lbuf;
939 memcpy (res->u.data.data, wrbuf_buf(wrbuf), len);
941 res->u.data.data = 0;
942 res->u.data.len = len;
948 int getc_mem (void *fh)
950 const char **p = (const char **) fh;
956 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
958 WRBUF wrbuf = wrbuf_alloc();
961 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
962 wrbuf_destroy(wrbuf);
967 * Read a record in the native syntax.
969 data1_node *data1_read_record(data1_handle dh,
970 int (*rf)(void *, char *, size_t), void *fh,
974 char **buf = data1_get_read_buf (dh, &size);
979 *buf = (char *)xmalloc(*size = 4096);
983 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
985 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
991 return data1_read_node(dh, &bp, m);
1000 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
1002 const char *bp = buf;
1003 return data1_read_node (dh, &bp, m);
1007 static int conv_item(NMEM m, yaz_iconv_t t,
1008 WRBUF wrbuf, char *inbuf, size_t inlen)
1010 wrbuf_rewind(wrbuf);
1011 wrbuf_iconv_write(wrbuf, t, inbuf, inlen);
1012 wrbuf_iconv_reset(wrbuf, t);
1016 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
1017 yaz_iconv_t t, WRBUF wrbuf, const char *tocode)
1019 for (; n; n = n->next)
1024 case DATA1N_comment:
1025 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
1028 data1_insert_string_n (dh, n, m, wrbuf->buf,
1030 n->u.data.len = wrbuf->pos;
1034 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
1038 data1_insert_string_n (dh, n, m,
1039 wrbuf->buf, wrbuf->pos);
1041 if (n->u.tag.attributes)
1044 for (p = n->u.tag.attributes; p; p = p->next)
1047 conv_item(m, t, wrbuf, p->value, strlen(p->value))
1050 p->value = nmem_strdup(m, wrbuf_cstr(wrbuf));
1055 case DATA1N_preprocess:
1056 if (strcmp(n->u.preprocess.target, "xml") == 0)
1058 data1_xattr *p = n->u.preprocess.attributes;
1059 for (; p; p = p->next)
1060 if (strcmp (p->name, "encoding") == 0)
1061 p->value = nmem_strdup (m, tocode);
1065 data1_iconv_s (dh, m, n->child, t, wrbuf, tocode);
1069 const char *data1_get_encoding (data1_handle dh, data1_node *n)
1071 /* see if we have an xml header that specifies encoding */
1072 if (n && n->child && n->child->which == DATA1N_preprocess &&
1073 strcmp (n->child->u.preprocess.target, "xml") == 0)
1075 data1_xattr *xp = n->child->u.preprocess.attributes;
1076 for (; xp; xp = xp->next)
1077 if (!strcmp (xp->name, "encoding") == 0)
1080 /* no encoding in header, so see if "encoding" was specified for abs */
1081 if (n && n->which == DATA1N_root &&
1082 n->u.root.absyn && n->u.root.absyn->encoding)
1083 return n->u.root.absyn->encoding;
1084 /* none of above, return a hard coded default */
1085 return "ISO-8859-1";
1088 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
1090 const char *fromcode)
1092 if (yaz_matchstr (tocode, fromcode))
1094 WRBUF wrbuf = wrbuf_alloc();
1095 yaz_iconv_t t = yaz_iconv_open(tocode, fromcode);
1098 wrbuf_destroy(wrbuf);
1101 data1_iconv_s(dh, m, n, t, wrbuf, tocode);
1103 wrbuf_destroy(wrbuf);
1108 void data1_chop_text(data1_handle dh, NMEM m, data1_node *n)
1110 for (; n; n = n->next)
1112 if (n->which == DATA1N_data)
1115 int sz = n->u.data.len;
1116 const char *ndata = n->u.data.data;
1119 for (off = 0; off < sz; off++)
1120 if (!d1_isspace(ndata[off]))
1125 while (sz && d1_isspace(ndata[sz - 1]))
1128 n->u.data.data = nmem_malloc(m, sz);
1130 memcpy(n->u.data.data, ndata, sz);
1133 data1_chop_text(dh, m, n->child);
1137 void data1_concat_text(data1_handle dh, NMEM m, data1_node *n)
1139 for (; n; n = n->next)
1141 if (n->which == DATA1N_data && n->next &&
1142 n->next->which == DATA1N_data)
1148 for (np = n; np && np->which == DATA1N_data; np=np->next)
1149 sz += np->u.data.len;
1150 ndata = nmem_malloc(m, sz);
1151 for (np = n; np && np->which == DATA1N_data; np=np->next)
1153 memcpy(ndata+off, np->u.data.data, np->u.data.len);
1154 off += np->u.data.len;
1156 n->u.data.data = ndata;
1159 if (!np && n->parent)
1160 n->parent->last_child = n;
1163 data1_concat_text(dh, m, n->child);
1170 * indent-tabs-mode: nil
1172 * vim: shiftwidth=4 tabstop=8 expandtab