X-Git-Url: http://git.indexdata.com/?p=idzebra-moved-to-github.git;a=blobdiff_plain;f=data1%2Fd1_map.c;h=f8c316918c5908286a6b4a2ed483c168facb5981;hp=997b9cb0ca8aed66aa97cf4d1d08415bd1099792;hb=f3f20a205132c39c9434b10086422c6b49b47faf;hpb=1872e3fc60b482771bbd1cb4b0290b8d6a9ef5d0 diff --git a/data1/d1_map.c b/data1/d1_map.c index 997b9cb..f8c3169 100644 --- a/data1/d1_map.c +++ b/data1/d1_map.c @@ -1,8 +1,5 @@ -/* $Id: d1_map.c,v 1.16 2007-04-16 08:44:31 adam Exp $ - Copyright (C) 1995-2007 - Index Data ApS - -This file is part of the Zebra server. +/* 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 @@ -20,6 +17,9 @@ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ +#if HAVE_CONFIG_H +#include +#endif #include #include #include @@ -30,6 +30,15 @@ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA #include #include +struct data1_mapunit +{ + int no_data; + int no_chop; + char *source_element_name; + data1_maptag *target_path; + struct data1_mapunit *next; +}; + data1_maptab *data1_read_maptab (data1_handle dh, const char *file) { NMEM mem = data1_nmem_get (dh); @@ -109,6 +118,10 @@ data1_maptab *data1_read_maptab (data1_handle dh, const char *file) (*mapp)->no_data = 1; else (*mapp)->no_data = 0; + if (argc > 3 && !data1_matchstr(argv[3], "nochop")) + (*mapp)->no_chop = 1; + else + (*mapp)->no_chop = 0; (*mapp)->source_element_name = (char *)nmem_malloc(mem, strlen(argv[1])+1); strcpy((*mapp)->source_element_name, argv[1]); @@ -154,7 +167,7 @@ data1_maptab *data1_read_maptab (data1_handle dh, const char *file) } mapp = &(*mapp)->next; } - else + else yaz_log(YLOG_WARN, "%s:%d: Unknown directive '%s'", file, lineno, argv[0]); @@ -163,23 +176,6 @@ data1_maptab *data1_read_maptab (data1_handle dh, const char *file) } /* - * Locate node with given elementname. - * NOTE: This is stupid - we don't find repeats this way. - */ -static data1_node *find_node(data1_node *p, char *elementname) -{ - data1_node *c, *r; - - for (c = p->child; c; c = c->next) - if (c->which == DATA1N_tag && c->u.tag.element && - !data1_matchstr(c->u.tag.element->name, elementname)) - return c; - else if ((r = find_node(c, elementname))) - return r; - return 0; -} - -/* * See if the node n is equivalent to the tag t. */ static int tagmatch(data1_node *n, data1_maptag *t) @@ -238,7 +234,7 @@ static data1_node *dup_child (data1_handle dh, data1_node *n, { *last = *m = (data1_node *) nmem_malloc (mem, sizeof(**m)); memcpy (*m, n, sizeof(**m)); - + (*m)->parent = parent; (*m)->root = parent->root; (*m)->child = dup_child(dh, n->child, &(*m)->last_child, mem, *m); @@ -293,11 +289,11 @@ static int map_children(data1_handle dh, data1_node *n, data1_maptab *map, { cur = data1_mk_tag ( dh, mem, tag->names->name, 0, pn); - + } } } - + if (mt->next) pn = cur; else if (!m->no_data) @@ -305,6 +301,11 @@ static int map_children(data1_handle dh, data1_node *n, data1_maptab *map, cur->child = dup_child (dh, c->child, &cur->last_child, mem, cur); + if (!m->no_chop) + { + data1_concat_text(dh, mem, cur->child); + data1_chop_text(dh, mem, cur->child); + } } } } @@ -347,6 +348,7 @@ data1_node *data1_map_record (data1_handle dh, data1_node *n, /* * Local variables: * c-basic-offset: 4 + * c-file-style: "Stroustrup" * indent-tabs-mode: nil * End: * vim: shiftwidth=4 tabstop=8 expandtab