File: d1_utils.c

package info (click to toggle)
idzebra 2.2.8-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 10,572 kB
  • sloc: ansic: 54,389; xml: 27,058; sh: 5,892; makefile: 1,102; perl: 210; tcl: 64
file content (92 lines) | stat: -rw-r--r-- 2,424 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/* 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
Software Foundation; either version 2, or (at your option) any later
version.

Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

*/

#if HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>

#include <yaz/log.h>
#include <idzebra/data1.h>

void data1_remove_node(data1_handle dh, data1_node *n)
{
    /* n is first childen */
    if (n->parent->child == n)
    {
        n->parent->child = n->next;

        /* n is the only child */
        if(! n->next){
            n->parent->last_child = 0;
        }
    }
    /* n is one of the following childrens */
    else
    {
        data1_node * before;

        /* need to find sibling before me */
        before = n->parent->child;
        while (before->next != n)
            before = before->next;

        before->next = n->next;

        /* n is last child of many */
        if ( n->parent->last_child == n)
            n->parent->last_child = before;
    }
    /* break pointers to root, parent and following siblings */
    n->parent = 0;
    n->root = 0;
    n->next = 0;
}

void data1_remove_idzebra_subtree(data1_handle dh, data1_node *n)
{
    if (n->which == DATA1N_tag && !strcmp(n->u.tag.tag, "idzebra")
        && n->u.tag.attributes)
    {
        data1_xattr *xattr = n->u.tag.attributes;

        for (; xattr; xattr = xattr->next)
        {
            if (!strcmp(xattr->name, "xmlns")
                && !strcmp(xattr->value, "http://www.indexdata.dk/zebra/"))
                data1_remove_node(dh, n);
        }
    }
    if (n->child)
        data1_remove_idzebra_subtree(dh, n->child);
    if (n->next)
        data1_remove_idzebra_subtree(dh, n->next);
}

/*
 * Local variables:
 * c-basic-offset: 4
 * c-file-style: "Stroustrup"
 * indent-tabs-mode: nil
 * End:
 * vim: shiftwidth=4 tabstop=8 expandtab
 */