1 /* $Id: d1_read.c,v 1.15 2005-01-17 22:12:34 adam Exp $
2 Copyright (C) 1995-2005
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/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;
135 r->root = parent->root;
137 parent->child = parent->last_child = r;
139 parent->last_child->next = r;
140 parent->last_child = r;
142 data1_init_node(dh, r, type);
146 data1_node *data1_mk_node2 (data1_handle dh, NMEM m, int type,
149 return data1_append_node (dh, m, type, parent);
152 data1_node *data1_insert_node (data1_handle dh, NMEM m, int type,
155 data1_node *r = (data1_node *)nmem_malloc(m, sizeof(*r));
156 r->next = r->child = r->last_child = 0;
163 r->root = parent->root;
166 parent->last_child = r;
168 r->next = parent->child;
171 data1_init_node(dh, r, type);
175 void data1_free_tree (data1_handle dh, data1_node *t)
177 data1_node *p = t->child, *pn;
182 data1_free_tree (dh, p);
189 data1_node *data1_mk_root (data1_handle dh, NMEM nmem, const char *name)
191 data1_absyn *absyn = data1_get_absyn (dh, name);
195 yaz_log(YLOG_WARN, "Unable to acquire abstract syntax " "for '%s'",
197 /* It's now OK for a record not to have an absyn */
199 res = data1_mk_node2 (dh, nmem, DATA1N_root, 0);
200 res->u.root.type = data1_insert_string (dh, res, nmem, name);
201 res->u.root.absyn = absyn;
205 void data1_set_root(data1_handle dh, data1_node *res,
206 NMEM nmem, const char *name)
208 data1_absyn *absyn = data1_get_absyn (dh, name);
210 res->u.root.type = data1_insert_string (dh, res, nmem, name);
211 res->u.root.absyn = absyn;
214 void data1_add_attrs(data1_handle dh, NMEM nmem, const char **attr,
220 while (attr && *attr)
222 *p = (data1_xattr*) nmem_malloc (nmem, sizeof(**p));
223 (*p)->name = nmem_strdup (nmem, *attr++);
224 (*p)->value = nmem_strdup (nmem, *attr++);
225 (*p)->what = DATA1I_text;
232 data1_node *data1_mk_preprocess (data1_handle dh, NMEM nmem,
234 const char **attr, data1_node *at)
236 return data1_mk_preprocess_n (dh, nmem, target, strlen(target),
240 data1_node *data1_mk_preprocess_n (data1_handle dh, NMEM nmem,
241 const char *target, size_t len,
242 const char **attr, data1_node *at)
244 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_preprocess, at);
245 res->u.preprocess.target = data1_insert_string_n (dh, res, nmem,
248 data1_add_attrs(dh, nmem, attr, &res->u.preprocess.attributes);
252 data1_node *data1_insert_preprocess (data1_handle dh, NMEM nmem,
254 const char **attr, data1_node *at)
256 return data1_insert_preprocess_n (dh, nmem, target, strlen(target),
260 data1_node *data1_insert_preprocess_n (data1_handle dh, NMEM nmem,
261 const char *target, size_t len,
262 const char **attr, data1_node *at)
264 data1_node *res = data1_insert_node (dh, nmem, DATA1N_preprocess, at);
265 res->u.preprocess.target = data1_insert_string_n (dh, res, nmem,
268 data1_add_attrs(dh, nmem, attr, &res->u.preprocess.attributes);
272 data1_node *data1_mk_tag_n (data1_handle dh, NMEM nmem,
273 const char *tag, size_t len, const char **attr,
276 data1_node *partag = get_parent_tag(dh, at);
277 data1_node *res = data1_mk_node2 (dh, nmem, DATA1N_tag, at);
278 data1_element *e = 0;
280 res->u.tag.tag = data1_insert_string_n (dh, res, nmem, tag, len);
282 if (!partag) /* top tag? */
283 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
284 0 /* index as local */,
288 /* only set element for known tags */
289 e = partag->u.tag.element;
291 e = data1_getelementbytagname (dh, at->root->u.root.absyn,
294 res->u.tag.element = e;
295 data1_add_attrs(dh, nmem, attr, &res->u.tag.attributes);
299 void data1_tag_add_attr (data1_handle dh, NMEM nmem,
300 data1_node *res, const char **attr)
302 if (res->which != DATA1N_tag)
305 data1_add_attrs(dh, nmem, attr, &res->u.tag.attributes);
308 data1_node *data1_mk_tag (data1_handle dh, NMEM nmem,
309 const char *tag, const char **attr, data1_node *at)
311 return data1_mk_tag_n (dh, nmem, tag, strlen(tag), attr, at);
314 data1_node *data1_search_tag (data1_handle dh, data1_node *n,
319 n = data1_get_root_tag (dh, n);
324 for (; n; n = n->next)
325 if (n->which == DATA1N_tag && n->u.tag.tag &&
326 !yaz_matchstr (n->u.tag.tag, tag))
333 data1_node *data1_mk_tag_uni (data1_handle dh, NMEM nmem,
334 const char *tag, data1_node *at)
336 data1_node *node = data1_search_tag (dh, at->child, tag);
338 node = data1_mk_tag (dh, nmem, tag, 0 /* attr */, at);
340 node->child = node->last_child = 0;
344 data1_node *data1_mk_text_n (data1_handle dh, NMEM mem,
345 const char *buf, size_t len, data1_node *parent)
347 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_data, parent);
348 res->u.data.what = DATA1I_text;
349 res->u.data.len = len;
351 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
355 data1_node *data1_mk_text_nf (data1_handle dh, NMEM mem,
356 const char *buf, size_t len, data1_node *parent)
358 data1_node *res = data1_mk_text_n (dh, mem, buf, len, parent);
359 res->u.data.formatted_text = 1;
363 data1_node *data1_mk_text (data1_handle dh, NMEM mem,
364 const char *buf, data1_node *parent)
366 return data1_mk_text_n (dh, mem, buf, strlen(buf), parent);
369 data1_node *data1_mk_comment_n (data1_handle dh, NMEM mem,
370 const char *buf, size_t len,
373 data1_node *res = data1_mk_node2 (dh, mem, DATA1N_comment, parent);
374 res->u.data.what = DATA1I_text;
375 res->u.data.len = len;
377 res->u.data.data = data1_insert_string_n (dh, res, mem, buf, len);
381 data1_node *data1_mk_comment (data1_handle dh, NMEM mem,
382 const char *buf, data1_node *parent)
384 return data1_mk_comment_n (dh, mem, buf, strlen(buf), parent);
387 char *data1_insert_string_n (data1_handle dh, data1_node *res,
388 NMEM m, const char *str, size_t len)
391 if (len >= DATA1_LOCALDATA)
392 b = (char *) nmem_malloc (m, len+1);
395 memcpy (b, str, len);
400 char *data1_insert_string (data1_handle dh, data1_node *res,
401 NMEM m, const char *str)
403 return data1_insert_string_n (dh, res, m, str, strlen(str));
406 static data1_node *data1_add_insert_taggeddata(data1_handle dh,
408 const char *tagname, NMEM m,
412 data1_node *root = at->root;
413 data1_node *partag = get_parent_tag (dh, at);
414 data1_element *e = NULL;
415 data1_node *datn = 0;
416 data1_node *tagn = 0;
419 e = data1_getelementbytagname (dh, root->u.root.absyn, 0, tagname);
422 e = partag->u.tag.element;
424 e = data1_getelementbytagname (dh, root->u.root.absyn, e, tagname);
426 if (local_allowed || e)
429 tagn = data1_insert_node (dh, m, DATA1N_tag, at);
431 tagn = data1_append_node (dh, m, DATA1N_tag, at);
432 tagn->u.tag.tag = data1_insert_string (dh, tagn, m, tagname);
433 tagn->u.tag.element = e;
434 datn = data1_mk_node2 (dh, m, DATA1N_data, tagn);
439 data1_node *data1_mk_tag_data(data1_handle dh, data1_node *at,
440 const char *tagname, NMEM m)
442 return data1_add_insert_taggeddata (dh, at, tagname, m, 1, 0);
447 * Insert a tagged node into the record root as first child of the node at
448 * which should be root or tag itself). Returns pointer to the data node,
449 * which can then be modified.
451 data1_node *data1_mk_tag_data_wd(data1_handle dh, data1_node *at,
452 const char *tagname, NMEM m)
454 return data1_add_insert_taggeddata (dh, at, tagname, m, 0, 1);
457 data1_node *data1_insert_taggeddata (data1_handle dh, data1_node *root,
458 data1_node *at, const char *tagname,
461 return data1_add_insert_taggeddata (dh, at, tagname, m, 0, 1);
464 data1_node *data1_add_taggeddata (data1_handle dh, data1_node *root,
465 data1_node *at, const char *tagname,
468 return data1_add_insert_taggeddata (dh, at, tagname, m, 1, 0);
471 data1_node *data1_mk_tag_data_zint (data1_handle dh, data1_node *at,
472 const char *tag, zint num,
475 data1_node *node_data;
477 node_data = data1_mk_tag_data (dh, at, tag, nmem);
480 node_data->u.data.what = DATA1I_num;
481 node_data->u.data.data = node_data->lbuf;
482 sprintf (node_data->u.data.data, ZINT_FORMAT, num);
483 node_data->u.data.len = strlen (node_data->u.data.data);
487 data1_node *data1_mk_tag_data_int (data1_handle dh, data1_node *at,
488 const char *tag, int num,
491 return data1_mk_tag_data_zint(dh, at, tag, num, nmem);
494 data1_node *data1_mk_tag_data_oid (data1_handle dh, data1_node *at,
495 const char *tag, Odr_oid *oid,
498 data1_node *node_data;
499 char str[128], *p = str;
502 node_data = data1_mk_tag_data (dh, at, tag, nmem);
506 for (ii = oid; *ii >= 0; ii++)
510 sprintf (p, "%d", *ii);
513 node_data->u.data.what = DATA1I_oid;
514 node_data->u.data.len = strlen (str);
515 node_data->u.data.data = data1_insert_string (dh, node_data, nmem, str);
520 data1_node *data1_mk_tag_data_text (data1_handle dh, data1_node *at,
521 const char *tag, const char *str,
524 data1_node *node_data;
526 node_data = data1_mk_tag_data (dh, at, tag, nmem);
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, nmem, str);
536 data1_node *data1_mk_tag_data_text_uni (data1_handle dh, data1_node *at,
537 const char *tag, const char *str,
540 data1_node *node = data1_search_tag (dh, at->child, tag);
542 return data1_mk_tag_data_text (dh, at, tag, str, nmem);
545 data1_node *node_data = node->child;
546 node_data->u.data.what = DATA1I_text;
547 node_data->u.data.len = strlen (str);
548 node_data->u.data.data = data1_insert_string (dh, node_data,
550 node_data->child = node_data->last_child = 0;
555 static int ampr (int (*get_byte)(void *fh), void *fh, int *amp)
558 int c = (*get_byte)(fh);
562 int c = (*get_byte)(fh);
577 if (!strcmp (ent, "quot"))
579 if (!strcmp (ent, "apos"))
581 if (!strcmp (ent, "gt"))
583 if (!strcmp (ent, "lt"))
585 if (!strcmp (ent, "amp"))
590 else if (c == 0 || d1_isspace(c))
600 data1_xattr *data1_read_xattr (data1_handle dh, NMEM m,
601 int (*get_byte)(void *fh), void *fh,
602 WRBUF wrbuf, int *ch, int *amp)
604 data1_xattr *p_first = 0;
605 data1_xattr **pp = &p_first;
611 while (*amp || (c && d1_isspace(c)))
612 c = ampr (get_byte, fh, amp);
613 if (*amp == 0 && (c == 0 || c == '>' || c == '/'))
615 *pp = p = (data1_xattr *) nmem_malloc (m, sizeof(*p));
619 p->what = DATA1I_xmltext;
622 while (c && c != '=' && c != '>' && c != '/' && !d1_isspace(c))
624 wrbuf_putc (wrbuf, c);
625 c = ampr (get_byte, fh, amp);
627 wrbuf_putc (wrbuf, '\0');
628 len = wrbuf_len(wrbuf);
629 p->name = (char*) nmem_malloc (m, len);
630 strcpy (p->name, wrbuf_buf(wrbuf));
633 c = ampr (get_byte, fh, amp);
634 if (*amp == 0 && c == '"')
636 c = ampr (get_byte, fh, amp);
638 while (*amp || (c && c != '"'))
640 wrbuf_putc (wrbuf, c);
641 c = ampr (get_byte, fh, amp);
644 c = ampr (get_byte, fh, amp);
646 else if (*amp == 0 && c == '\'')
648 c = ampr (get_byte, fh, amp);
650 while (*amp || (c && c != '\''))
652 wrbuf_putc (wrbuf, c);
653 c = ampr (get_byte, fh, amp);
656 c = ampr (get_byte, fh, amp);
661 while (*amp || (c && c != '>' && c != '/'))
663 wrbuf_putc (wrbuf, c);
664 c = ampr (get_byte, fh, amp);
667 wrbuf_putc (wrbuf, '\0');
668 len = wrbuf_len(wrbuf);
669 p->value = (char*) nmem_malloc (m, len);
670 strcpy (p->value, wrbuf_buf(wrbuf));
678 * Ugh. Sometimes functions just grow and grow on you. This one reads a
679 * 'node' and its children.
681 data1_node *data1_read_nodex (data1_handle dh, NMEM m,
682 int (*get_byte)(void *fh), void *fh, WRBUF wrbuf)
684 data1_node *d1_stack[256];
691 c = ampr (get_byte, fh, &);
694 data1_node *parent = level ? d1_stack[level-1] : 0;
696 if (amp == 0 && c == '<') /* beginning of tag */
706 c = ampr (get_byte, fh, &);
707 if (amp == 0 && c == '/')
710 c = ampr (get_byte, fh, &);
712 else if (amp == 0 && c == '!')
718 c0 = ampr (get_byte, fh, &0);
719 if (amp0 == 0 && c0 == '\0')
721 c = ampr (get_byte, fh, &);
723 if (amp0 == 0 && c0 == '-' && amp == 0 && c == '-')
725 /* COMMENT: <!-- ... --> */
728 c = ampr (get_byte, fh, &);
731 if (amp == 0 && c == '-')
733 else if (amp == 0 && c == '>' && no_dash >= 2)
739 wrbuf_buf(wrbuf), wrbuf_len(wrbuf)-2,
741 c = ampr (get_byte, fh, &); /* skip > */
746 wrbuf_putc (wrbuf, c);
747 c = ampr (get_byte, fh, &);
752 { /* DIRECTIVE: <! .. > */
757 if (amp == 0 && c == '>' && blevel == 0)
759 c = ampr (get_byte, fh, &);
762 if (amp == 0 && c == '[')
764 if (amp == 0 && c == ']' && blevel > 0)
766 c = ampr (get_byte, fh, &);
771 while (amp || (c && c != '>' && c != '/' && !d1_isspace(c)))
773 if (i < (sizeof(tag)-1))
775 c = ampr (get_byte, fh, &);
778 xattr = data1_read_xattr (dh, m, get_byte, fh, wrbuf, &c, &);
780 if (amp == 0 && c == '/')
781 { /* <tag attrs/> or <tag/> */
783 c = ampr (get_byte, fh, &);
787 yaz_log(YLOG_WARN, "d1: %d: Malformed tag", line);
791 c = ampr (get_byte, fh, &);
803 parent = d1_stack[--i];
804 if ((parent->which == DATA1N_root &&
805 !strcmp(tag, parent->u.root.type)) ||
806 (parent->which == DATA1N_tag &&
807 !strcmp(tag, parent->u.tag.tag)))
815 yaz_log (YLOG_WARN, "%d: no begin tag for %s",
820 if (data1_is_xmlmode(dh))
832 else if (!strcmp(tag, "var"))
834 char tclass[DATA1_MAX_SYMBOL], type[DATA1_MAX_SYMBOL];
838 if (sscanf(args, "%s %s %n", tclass, type, &val_offset) != 2)
840 yaz_log(YLOG_WARN, "Malformed variant triple at '%s'", tag);
844 data1_getvartypebyct(dh,
845 parent->root->u.root.absyn->varset,
849 * If we're the first variant in this group, create a parent
850 * variant, and insert it before the current variant.
852 if (parent->which != DATA1N_variant)
854 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
859 * now determine if one of our ancestor triples is of
860 * same type. If so, we break here.
863 for (i = level-1; d1_stack[i]->which==DATA1N_variant; --i)
864 if (d1_stack[i]->u.variant.type == tp)
869 res = data1_mk_node2 (dh, m, DATA1N_variant, parent);
870 res->u.variant.type = tp;
871 res->u.variant.value =
872 data1_insert_string (dh, res, m, args + val_offset);
878 /* tag .. acquire our element in the abstract syntax */
881 parent = data1_mk_root (dh, m, tag);
882 res = d1_stack[level] = parent;
884 if (data1_is_xmlmode(dh))
887 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
888 res->u.tag.attributes = xattr;
893 res = data1_mk_tag (dh, m, tag, 0 /* attr */, parent);
894 res->u.tag.attributes = xattr;
897 d1_stack[level] = res;
898 d1_stack[level+1] = 0;
899 if (level < 250 && !null_tag)
902 else /* != '<'... this is a body of text */
908 c = ampr (get_byte, fh, &);
911 res = data1_mk_node2 (dh, m, DATA1N_data, parent);
912 res->u.data.what = DATA1I_xmltext;
913 res->u.data.formatted_text = 0;
914 d1_stack[level] = res;
918 while (amp || (c && c != '<'))
920 wrbuf_putc (wrbuf, c);
921 c = ampr (get_byte, fh, &);
923 len = wrbuf_len(wrbuf);
925 /* use local buffer of nmem if too large */
926 if (len >= DATA1_LOCALDATA)
927 res->u.data.data = (char*) nmem_malloc (m, len);
929 res->u.data.data = res->lbuf;
932 memcpy (res->u.data.data, wrbuf_buf(wrbuf), len);
934 res->u.data.data = 0;
935 res->u.data.len = len;
941 int getc_mem (void *fh)
943 const char **p = (const char **) fh;
949 data1_node *data1_read_node (data1_handle dh, const char **buf, NMEM m)
951 WRBUF wrbuf = wrbuf_alloc();
954 node = data1_read_nodex(dh, m, getc_mem, (void *) (buf), wrbuf);
955 wrbuf_free (wrbuf, 1);
960 * Read a record in the native syntax.
962 data1_node *data1_read_record(data1_handle dh,
963 int (*rf)(void *, char *, size_t), void *fh,
967 char **buf = data1_get_read_buf (dh, &size);
972 *buf = (char *)xmalloc(*size = 4096);
976 if (rd + 2048 >= *size && !(*buf =(char *)xrealloc(*buf, *size *= 2)))
978 if ((res = (*rf)(fh, *buf + rd, 2048)) <= 0)
984 return data1_read_node(dh, &bp, m);
993 data1_node *data1_read_sgml (data1_handle dh, NMEM m, const char *buf)
995 const char *bp = buf;
996 return data1_read_node (dh, &bp, m);
1000 static int conv_item (NMEM m, yaz_iconv_t t,
1001 WRBUF wrbuf, char *inbuf, size_t inlen)
1003 wrbuf_rewind (wrbuf);
1004 if (wrbuf->size < 10)
1005 wrbuf_grow (wrbuf, 10);
1008 char *outbuf = wrbuf->buf + wrbuf->pos;
1009 size_t outlen = wrbuf->size - wrbuf->pos;
1010 if (yaz_iconv (t, &inbuf, &inlen, &outbuf, &outlen) ==
1011 (size_t)(-1) && yaz_iconv_error(t) != YAZ_ICONV_E2BIG)
1013 /* bad data. stop and skip conversion entirely */
1016 else if (inlen == 0)
1017 { /* finished converting */
1018 wrbuf->pos = wrbuf->size - outlen;
1023 /* buffer too small: make sure we expand buffer */
1024 wrbuf->pos = wrbuf->size - outlen;
1025 wrbuf_grow(wrbuf, 20);
1031 static void data1_iconv_s (data1_handle dh, NMEM m, data1_node *n,
1032 yaz_iconv_t t, WRBUF wrbuf, const char *tocode)
1034 for (; n; n = n->next)
1039 case DATA1N_comment:
1040 if (conv_item (m, t, wrbuf, n->u.data.data, n->u.data.len) == 0)
1043 data1_insert_string_n (dh, n, m, wrbuf->buf,
1045 n->u.data.len = wrbuf->pos;
1049 if (conv_item (m, t, wrbuf, n->u.tag.tag, strlen(n->u.tag.tag))
1053 data1_insert_string_n (dh, n, m,
1054 wrbuf->buf, wrbuf->pos);
1056 if (n->u.tag.attributes)
1059 for (p = n->u.tag.attributes; p; p = p->next)
1062 conv_item(m, t, wrbuf, p->value, strlen(p->value))
1065 wrbuf_puts (wrbuf, "");
1066 p->value = nmem_strdup (m, wrbuf->buf);
1071 case DATA1N_preprocess:
1072 if (strcmp(n->u.preprocess.target, "xml") == 0)
1074 data1_xattr *p = n->u.preprocess.attributes;
1075 for (; p; p = p->next)
1076 if (strcmp (p->name, "encoding") == 0)
1077 p->value = nmem_strdup (m, tocode);
1081 data1_iconv_s (dh, m, n->child, t, wrbuf, tocode);
1085 const char *data1_get_encoding (data1_handle dh, data1_node *n)
1087 /* see if we have an xml header that specifies encoding */
1088 if (n && n->child && n->child->which == DATA1N_preprocess &&
1089 strcmp (n->child->u.preprocess.target, "xml") == 0)
1091 data1_xattr *xp = n->child->u.preprocess.attributes;
1092 for (; xp; xp = xp->next)
1093 if (!strcmp (xp->name, "encoding") == 0)
1096 /* no encoding in header, so see if "encoding" was specified for abs */
1097 if (n && n->which == DATA1N_root &&
1098 n->u.root.absyn && n->u.root.absyn->encoding)
1099 return n->u.root.absyn->encoding;
1100 /* none of above, return a hard coded default */
1101 return "ISO-8859-1";
1104 int data1_iconv (data1_handle dh, NMEM m, data1_node *n,
1106 const char *fromcode)
1108 if (yaz_matchstr (tocode, fromcode))
1110 WRBUF wrbuf = wrbuf_alloc();
1111 yaz_iconv_t t = yaz_iconv_open(tocode, fromcode);
1114 wrbuf_free(wrbuf, 1);
1117 data1_iconv_s(dh, m, n, t, wrbuf, tocode);
1119 wrbuf_free(wrbuf, 1);
1124 void data1_concat_text(data1_handle dh, NMEM m, data1_node *n)
1126 for (; n; n = n->next)
1128 if (n->which == DATA1N_data && n->next &&
1129 n->next->which == DATA1N_data)
1135 for (np = n; np && np->which == DATA1N_data; np=np->next)
1136 sz += np->u.data.len;
1137 ndata = nmem_malloc(m, sz);
1138 for (np = n; np && np->which == DATA1N_data; np=np->next)
1140 memcpy(ndata+off, np->u.data.data, np->u.data.len);
1141 off += np->u.data.len;
1143 n->u.data.data = ndata;
1146 if (!np && n->parent)
1147 n->parent->last_child = n;
1150 data1_concat_text(dh, m, n->child);