-/*
- * Copyright (c) 1995-2002, Index Data.
- * See the file LICENSE for details.
- * Sebastian Hammer, Adam Dickmeiss
- *
- * $Id: d1_prtree.c,v 1.1 2002-10-22 12:53:33 adam Exp $
- */
+/* $Id: d1_prtree.c,v 1.7 2005-01-15 19:38:18 adam Exp $
+ Copyright (C) 1995-2005
+ Index Data ApS
+
+This file is part of the Zebra server.
+
+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 Zebra; see the file LICENSE.zebra. If not, write to the
+Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
+02111-1307, USA.
+*/
#include <yaz/log.h>
-#include <data1.h>
+#include <idzebra/data1.h>
static void pr_string (FILE *out, const char *str, int len)
{
pr_tree (dh, n->child, out, level+4);
if (n->next)
pr_tree (dh, n->next, out, level);
+ else
+ {
+ if (n->parent && n->parent->last_child != n)
+ fprintf(out, "%*sWARNING: last_child=%p != %p\n", level, "",
+ n->parent->last_child, n);
+ }
}