1 /* $Id: d1_read.c,v 1.2 2002-10-22 13:19:50 adam Exp $
2 Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002
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 Zebra; see the file LICENSE.zebra. If not, write to the
19 Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
25 * This module reads "loose" SGML and converts it to data1 tree
32 #include <yaz/xmalloc.h>
33 #include <yaz/yaz-util.h>
37 data1_node *data1_get_root_tag (data1_handle dh, data1_node *n)
41 if (data1_is_xmlmode(dh))
44 while (n && n->which != DATA1N_tag)
51 * get the tag which is the immediate parent of this node (this may mean
52 * traversing intermediate things like variants and stuff.
54 data1_node *get_parent_tag (data1_handle dh, data1_node *n)
56 if (data1_is_xmlmode(dh))
58 for (; n && n->which != DATA1N_root; n = n->parent)
59 if (n->which == DATA1N_tag && n->parent &&
60 n->parent->which != DATA1N_root)
65 for (; n && n->which != DATA1N_root; n = n->parent)
66 if (n->which == DATA1N_tag)
72 data1_node *data1_mk_node (data1_handle dh, NMEM m)
74 return data1_mk_node2 (dh, m, DATA1N_root, 0);
77 data1_node *data1_mk_node_type (data1_handle dh, NMEM m, int type)
79 return data1_mk_node2 (dh, m, type, 0);
82 static void data1_init_node (data1_handle dh, data1_node *r, int type)
90 r->u.tag.no_data_requested = 0;
91 r->u.tag.node_selected = 0;
92 r->u.tag.make_variantlist = 0;
93 r->u.tag.get_bytes = -1;
94 r->u.tag.attributes = 0;
104 r->u.data.formatted_text = 0;
110 r->u.data.formatted_text = 1;
113 r->u.variant.type = 0;
114 r->u.variant.value = 0;
116 case DATA1N_preprocess:
117 r->u.preprocess.target = 0;
118 r->u.preprocess.attributes = 0;
121 logf (LOG_WARN, "data_mk_node_type. bad type = %d\n", type);
125 data1_node *data1_append_node (data1_handle dh, NMEM m, int type,
128 data1_node *r = (data1_node *)nmem_malloc(m, sizeof(*r));
129 r->next = r->child = r->last_child = 0;
136 r->root = parent->root;
139 parent->child = parent->last_child = r;
141 parent->last_child->next = r;
142 parent->last_child = r;
144 data1_init_node(dh, r, type);
148 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
151 return data1_append_node (dh, m, type, parent);
154 data1_node *data1_insert_node (data1_handle dh, NMEM m, int type,
157 data1_node *r = (data1_node *)nmem_malloc(m, sizeof(*r));
158 r->next = r->child = r->last_child = 0;
165 r->root = parent->root;
168 parent->last_child = r;
170 r->next = parent->child;
173 data1_init_node(dh, r, type);
177 void data1_free_tree (data1_handle dh, data1_node *t)
179 data1_node *p = t->child, *pn;
184 data1_free_tree (dh, p);
191 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
193 data1_absyn *absyn = data1_get_absyn (dh, name);
197 yaz_log(LOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
199 /* It's now OK for a record not to have an absyn */
201 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
202 res->u.root.type = data1_insert_string (dh, res, nmem, name);
203 res->u.root.absyn = absyn;
207 void data1_set_root(data1_handle dh, data1_node *res,
208 NMEM nmem, const char *name)
210 data1_absyn *absyn = data1_get_absyn (dh, name);
212 res->u.root.type = data1_insert_string (dh, res, nmem, name);
213 res->u.root.absyn = absyn;
216 data1_node *data1_mk_preprocess (data1_handle dh, NMEM nmem,
218 const char **attr, data1_node *at)
220 return data1_mk_preprocess_n (dh, nmem, target, strlen(target),
224 data1_node *data1_mk_preprocess_n (data1_handle dh, NMEM nmem,
225 const char *target, size_t len,
226 const char **attr, data1_node *at)
229 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
230 res->u.preprocess.target = data1_insert_string_n (dh, res, nmem,
233 p = &res->u.preprocess.attributes;
234 while (attr && *attr)
236 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
237 (*p)->name = nmem_strdup (nmem, *attr++);
238 (*p)->value = nmem_strdup (nmem, *attr++);
239 (*p)->what = DATA1I_text;
247 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
248 const char *tag, size_t len, const char **attr,
251 data1_node *partag = get_parent_tag(dh, at);
252 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
254 data1_element *e = 0;
256 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
258 if (!partag) /* top tag? */
259 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
260 0 /* index as local */,
264 /* only set element for known tags */
265 e = partag->u.tag.element;
267 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
270 res->u.tag.element = e;
271 p = &res->u.tag.attributes;
272 while (attr && *attr)
274 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
275 (*p)->name = nmem_strdup (nmem, *attr++);
276 (*p)->value = nmem_strdup (nmem, *attr++);
277 (*p)->what = DATA1I_text;
284 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
285 data1_node *res, const char **attr)
289 if (res->which != DATA1N_tag)
292 p = &res->u.tag.attributes;
296 while (attr && *attr)
298 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
299 (*p)->name = nmem_strdup (nmem, *attr++);
300 (*p)->value = nmem_strdup (nmem, *attr++);
301 (*p)->what = DATA1I_text;
307 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
308 const char *tag, const char **attr, data1_node *at)
310 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
313 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
318 n = data1_get_root_tag (dh, n);
323 for (; n; n = n->next)
324 if (n->which == DATA1N_tag && n->u.tag.tag &&
325 !yaz_matchstr (tag, n->u.tag.tag))
332 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
333 const char *tag, data1_node *at)
335 data1_node *node = data1_search_tag (dh, at->child, tag);
337 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
339 node->child = node->last_child = 0;
343 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
344 const char *buf, size_t len, data1_node *parent)
346 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
347 res->u.data.what = DATA1I_text;
348 res->u.data.len = len;
350 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
354 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
355 const char *buf, size_t len, data1_node *parent)
357 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
358 res->u.data.formatted_text = 1;
362 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
363 const char *buf, data1_node *parent)
365 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
368 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
369 const char *buf, size_t len,
372 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
373 res->u.data.what = DATA1I_text;
374 res->u.data.len = len;
376 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
380 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
381 const char *buf, data1_node *parent)
383 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
386 char *data1_insert_string_n (data1_handle dh, data1_node *res,
387 NMEM m, const char *str, size_t len)
390 if (len >= DATA1_LOCALDATA)
391 b = (char *) nmem_malloc (m, len+1);
394 memcpy (b, str, len);
399 char *data1_insert_string (data1_handle dh, data1_node *res,
400 NMEM m, const char *str)
402 return data1_insert_string_n (dh, res, m, str, strlen(str));
405 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
407 const char *tagname, NMEM m,
411 data1_node *root = at->root;
412 data1_node *partag = get_parent_tag (dh, at);
413 data1_element *e = NULL;
414 data1_node *datn = 0;
415 data1_node *tagn = 0;
418 e = data1_getelementbytagname (dh, root->u.root.absyn, 0, tagname);
421 e = partag->u.tag.element;
423 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
425 if (local_allowed || e)
428 tagn = data1_insert_node (dh, m, DATA1N_tag, at);
430 tagn = data1_append_node (dh, m, DATA1N_tag, at);
431 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
432 tagn->u.tag.element = e;
433 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
438 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
439 const char *tagname, NMEM m)
441 return data1_add_insert_taggeddata (dh, at, tagname, m, 1, 0);
446 * Insert a tagged node into the record root as first child of the node at
447 * which should be root or tag itself). Returns pointer to the data node,
448 * which can then be modified.
450 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
451 const char *tagname, NMEM m)
453 return data1_add_insert_taggeddata (dh, at, tagname, m, 0, 1);
456 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
457 data1_node *at, const char *tagname,
460 return data1_add_insert_taggeddata (dh, at, tagname, m, 0, 1);
463 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
464 data1_node *at, const char *tagname,
467 return data1_add_insert_taggeddata (dh, at, tagname, m, 1, 0);
470 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
471 const char *tag, int num,
474 data1_node *node_data;
476 node_data = data1_mk_tag_data (dh, at, tag, nmem);
479 node_data->u.data.what = DATA1I_num;
480 node_data->u.data.data = node_data->lbuf;
481 sprintf (node_data->u.data.data, "%d", num);
482 node_data->u.data.len = strlen (node_data->u.data.data);
486 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
487 const char *tag, Odr_oid *oid,
490 data1_node *node_data;
491 char str[128], *p = str;
494 node_data = data1_mk_tag_data (dh, at, tag, nmem);
498 for (ii = oid; *ii >= 0; ii++)
502 sprintf (p, "%d", *ii);
505 node_data->u.data.what = DATA1I_oid;
506 node_data->u.data.len = strlen (str);
507 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
512 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
513 const char *tag, const char *str,
516 data1_node *node_data;
518 node_data = data1_mk_tag_data (dh, at, tag, nmem);
521 node_data->u.data.what = DATA1I_text;
522 node_data->u.data.len = strlen (str);
523 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
528 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
529 const char *tag, const char *str,
532 data1_node *node = data1_search_tag (dh, at->child, tag);
534 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
537 data1_node *node_data = node->child;
538 node_data->u.data.what = DATA1I_text;
539 node_data->u.data.len = strlen (str);
540 node_data->u.data.data = data1_insert_string (dh, node_data,
542 node_data->child = node_data->last_child = 0;
547 static int ampr (int (*get_byte)(void *fh), void *fh, int *amp)
550 int c = (*get_byte)(fh);
554 int c = (*get_byte)(fh);
569 if (!strcmp (ent, "quot"))
571 if (!strcmp (ent, "apos"))
573 if (!strcmp (ent, "gt"))
575 if (!strcmp (ent, "lt"))
577 if (!strcmp (ent, "amp"))
582 else if (c == 0 || d1_isspace(c))
592 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
593 int (*get_byte)(void *fh), void *fh,
594 WRBUF wrbuf, int *ch, int *amp)
596 data1_xattr *p_first = 0;
597 data1_xattr **pp = &p_first;
603 while (*amp || (c && d1_isspace(c)))
604 c = ampr (get_byte, fh, amp);
605 if (*amp == 0 && (c == 0 || c == '>' || c == '/'))
607 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
611 p->what = DATA1I_xmltext;
614 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
616 wrbuf_putc (wrbuf, c);
617 c = ampr (get_byte, fh, amp);
619 wrbuf_putc (wrbuf, '\0');
620 len = wrbuf_len(wrbuf);
621 p->name = (char*) nmem_malloc (m, len);
622 strcpy (p->name, wrbuf_buf(wrbuf));
625 c = ampr (get_byte, fh, amp);
626 if (*amp == 0 && c == '"')
628 c = ampr (get_byte, fh, amp);
630 while (*amp || (c && c != '"'))
632 wrbuf_putc (wrbuf, c);
633 c = ampr (get_byte, fh, amp);
636 c = ampr (get_byte, fh, amp);
638 else if (*amp == 0 && c == '\'')
640 c = ampr (get_byte, fh, amp);
642 while (*amp || (c && c != '\''))
644 wrbuf_putc (wrbuf, c);
645 c = ampr (get_byte, fh, amp);
648 c = ampr (get_byte, fh, amp);
653 while (*amp || (c && c != '>' && c != '/'))
655 wrbuf_putc (wrbuf, c);
656 c = ampr (get_byte, fh, amp);
659 wrbuf_putc (wrbuf, '\0');
660 len = wrbuf_len(wrbuf);
661 p->value = (char*) nmem_malloc (m, len);
662 strcpy (p->value, wrbuf_buf(wrbuf));
670 * Ugh. Sometimes functions just grow and grow on you. This one reads a
671 * 'node' and its children.
673 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
674 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
676 data1_node *d1_stack[256];
683 c = ampr (get_byte, fh, &);
686 data1_node *parent = level ? d1_stack[level-1] : 0;
688 if (amp == 0 && c == '<') /* beginning of tag */
698 c = ampr (get_byte, fh, &);
699 if (amp == 0 && c == '/')
702 c = ampr (get_byte, fh, &);
704 else if (amp == 0 && c == '!')
710 c0 = ampr (get_byte, fh, &0);
711 if (amp0 == 0 && c0 == '\0')
713 c = ampr (get_byte, fh, &);
715 if (amp0 == 0 && c0 == '-' && amp == 0 && c == '-')
717 /* COMMENT: <!-- ... --> */
720 c = ampr (get_byte, fh, &);
723 if (amp == 0 && c == '-')
725 else if (amp == 0 && c == '>' && no_dash >= 2)
731 wrbuf_buf(wrbuf), wrbuf_len(wrbuf)-2,
733 c = ampr (get_byte, fh, &); /* skip > */
738 wrbuf_putc (wrbuf, c);
739 c = ampr (get_byte, fh, &);
744 { /* DIRECTIVE: <! .. > */
749 if (amp == 0 && c == '>' && blevel == 0)
751 c = ampr (get_byte, fh, &);
754 if (amp == 0 && c == '[')
756 if (amp == 0 && c == ']' && blevel > 0)
758 c = ampr (get_byte, fh, &);
763 while (amp || (c && c != '>' && c != '/' && !d1_isspace(c)))
765 if (i < (sizeof(tag)-1))
767 c = ampr (get_byte, fh, &);
770 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c, &);
772 if (amp == 0 && c == '/')
773 { /* <tag attrs/> or <tag/> */
775 c = ampr (get_byte, fh, &);
779 yaz_log(LOG_WARN, "d1: %d: Malformed tag", line);
783 c = ampr (get_byte, fh, &);
795 parent = d1_stack[--i];
796 if ((parent->which == DATA1N_root &&
797 !strcmp(tag, parent->u.root.type)) ||
798 (parent->which == DATA1N_tag &&
799 !strcmp(tag, parent->u.tag.tag)))
807 yaz_log (LOG_WARN, "%d: no begin tag for %s",
812 if (data1_is_xmlmode(dh))
824 else if (!strcmp(tag, "var"))
826 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
830 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
832 yaz_log(LOG_WARN, "Malformed variant triple at '%s'", tag);
836 data1_getvartypebyct(dh,
837 parent->root->u.root.absyn->varset,
841 * If we're the first variant in this group, create a parent
842 * variant, and insert it before the current variant.
844 if (parent->which != DATA1N_variant)
846 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
851 * now determine if one of our ancestor triples is of
852 * same type. If so, we break here.
855 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
856 if (d1_stack[i]->u.variant.type == tp)
861 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
862 res->u.variant.type = tp;
863 res->u.variant.value =
864 data1_insert_string (dh, res, m, args + val_offset);
870 /* tag .. acquire our element in the abstract syntax */
873 parent = data1_mk_root (dh, m, tag);
874 res = d1_stack[level] = parent;
876 if (data1_is_xmlmode(dh))
879 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
880 res->u.tag.attributes = xattr;
885 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
886 res->u.tag.attributes = xattr;
889 d1_stack[level] = res;
890 d1_stack[level+1] = 0;
891 if (level < 250 && !null_tag)
894 else /* != '<'... this is a body of text */
900 c = ampr (get_byte, fh, &);
903 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
904 res->u.data.what = DATA1I_xmltext;
905 res->u.data.formatted_text = 0;
906 d1_stack[level] = res;
910 while (amp || (c && c != '<'))
912 wrbuf_putc (wrbuf, c);
913 c = ampr (get_byte, fh, &);
915 len = wrbuf_len(wrbuf);
917 /* use local buffer of nmem if too large */
918 if (len >= DATA1_LOCALDATA)
919 res->u.data.data = (char*) nmem_malloc (m, len);
921 res->u.data.data = res->lbuf;
924 memcpy (res->u.data.data, wrbuf_buf(wrbuf), len);
926 res->u.data.data = 0;
927 res->u.data.len = len;
933 int getc_mem (void *fh)
935 const char **p = (const char **) fh;
941 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
943 WRBUF wrbuf = wrbuf_alloc();
946 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
947 wrbuf_free (wrbuf, 1);
952 * Read a record in the native syntax.
954 data1_node *data1_read_record(data1_handle dh,
955 int (*rf)(void *, char *, size_t), void *fh,
959 char **buf = data1_get_read_buf (dh, &size);
964 *buf = (char *)xmalloc(*size = 4096);
968 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
970 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
976 return data1_read_node(dh, &bp, m);
985 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
987 const char *bp = buf;
988 return data1_read_node (dh, &bp, m);
992 static int conv_item (NMEM m, yaz_iconv_t t,
993 WRBUF wrbuf, char *inbuf, size_t inlen)
995 wrbuf_rewind (wrbuf);
996 if (wrbuf->size < 10)
997 wrbuf_grow (wrbuf, 10);
1000 char *outbuf = wrbuf->buf + wrbuf->pos;
1001 size_t outlen = wrbuf->size - wrbuf->pos;
1002 if (yaz_iconv (t, &inbuf, &inlen, &outbuf, &outlen) ==
1003 (size_t)(-1) && yaz_iconv_error(t) != YAZ_ICONV_E2BIG)
1005 /* bad data. stop and skip conversion entirely */
1008 else if (inlen == 0)
1009 { /* finished converting */
1010 wrbuf->pos = wrbuf->size - outlen;
1015 /* buffer too small: make sure we expand buffer */
1016 wrbuf->pos = wrbuf->size - outlen;
1017 wrbuf_grow(wrbuf, 20);
1023 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
1024 yaz_iconv_t t, WRBUF wrbuf, const char *tocode)
1026 for (; n; n = n->next)
1031 case DATA1N_comment:
1032 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
1035 data1_insert_string_n (dh, n, m, wrbuf->buf,
1037 n->u.data.len = wrbuf->pos;
1041 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
1045 data1_insert_string_n (dh, n, m,
1046 wrbuf->buf, wrbuf->pos);
1048 if (n->u.tag.attributes)
1051 for (p = n->u.tag.attributes; p; p = p->next)
1054 conv_item(m, t, wrbuf, p->value, strlen(p->value))
1057 wrbuf_puts (wrbuf, "");
1058 p->value = nmem_strdup (m, wrbuf->buf);
1063 case DATA1N_preprocess:
1064 if (strcmp(n->u.preprocess.target, "xml") == 0)
1066 data1_xattr *p = n->u.preprocess.attributes;
1067 for (; p; p = p->next)
1068 if (strcmp (p->name, "encoding") == 0)
1069 p->value = nmem_strdup (m, tocode);
1073 data1_iconv_s (dh, m, n->child, t, wrbuf, tocode);
1077 const char *data1_get_encoding (data1_handle dh, data1_node *n)
1079 /* see if we have an xml header that specifies encoding */
1080 if (n && n->child && n->child->which == DATA1N_preprocess &&
1081 strcmp (n->child->u.preprocess.target, "xml") == 0)
1083 data1_xattr *xp = n->child->u.preprocess.attributes;
1084 for (; xp; xp = xp->next)
1085 if (!strcmp (xp->name, "encoding") == 0)
1088 /* no encoding in header, so see if "encoding" was specified for abs */
1089 if (n && n->which == DATA1N_root &&
1090 n->u.root.absyn && n->u.root.absyn->encoding)
1091 return n->u.root.absyn->encoding;
1092 /* none of above, return a hard coded default */
1093 return "ISO-8859-1";
1096 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
1098 const char *fromcode)
1100 if (strcmp (tocode, fromcode))
1102 WRBUF wrbuf = wrbuf_alloc();
1103 yaz_iconv_t t = yaz_iconv_open (tocode, fromcode);
1106 data1_iconv_s (dh, m, n, t, wrbuf, tocode);
1107 yaz_iconv_close (t);
1108 wrbuf_free (wrbuf, 1);