2003-01-28 21:16:21 +00:00
|
|
|
/*
|
|
|
|
gib_tree.c
|
|
|
|
|
|
|
|
GIB tree handling functions
|
|
|
|
|
|
|
|
Copyright (C) 2003 Brian Koropoff
|
|
|
|
|
|
|
|
Author: Brian Koropoff
|
|
|
|
Date: #DATE#
|
|
|
|
|
|
|
|
This program 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
|
|
|
|
of the License, or (at your option) any later version.
|
|
|
|
|
|
|
|
This program 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:
|
|
|
|
|
|
|
|
Free Software Foundation, Inc.
|
|
|
|
59 Temple Place - Suite 330
|
|
|
|
Boston, MA 02111-1307, USA
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
# include "config.h"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static __attribute__ ((unused)) const char rcsid[] =
|
|
|
|
"$Id$";
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
2003-02-14 08:06:01 +00:00
|
|
|
#include "QF/sys.h"
|
2003-01-28 21:16:21 +00:00
|
|
|
#include "QF/qtypes.h"
|
|
|
|
#include "QF/gib_tree.h"
|
|
|
|
|
|
|
|
gib_tree_t *
|
2003-02-14 08:06:01 +00:00
|
|
|
GIB_Tree_New (gib_tree_flags_t flags)
|
2003-01-28 21:16:21 +00:00
|
|
|
{
|
|
|
|
gib_tree_t *new = calloc (1, sizeof (gib_tree_t));
|
|
|
|
new->flags = flags;
|
2003-01-30 23:26:43 +00:00
|
|
|
// All nodes are created for a reason, so start with 1 ref
|
|
|
|
new->refs = 1;
|
2003-01-28 21:16:21 +00:00
|
|
|
return new;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2003-01-30 23:26:43 +00:00
|
|
|
GIB_Tree_Free_Recursive (gib_tree_t *tree)
|
2003-01-28 21:16:21 +00:00
|
|
|
{
|
|
|
|
gib_tree_t *n;
|
|
|
|
|
2003-01-30 23:26:43 +00:00
|
|
|
if (tree->refs)
|
|
|
|
return;
|
2003-01-28 21:16:21 +00:00
|
|
|
for (; tree; tree = n) {
|
|
|
|
n = tree->next;
|
2003-02-14 08:06:01 +00:00
|
|
|
if (tree->children)
|
2003-01-30 23:26:43 +00:00
|
|
|
// Parent is about to bite the dust, meaning one less reference
|
2003-02-14 08:06:01 +00:00
|
|
|
GIB_Tree_Unref (&tree->children);
|
2003-01-31 21:47:16 +00:00
|
|
|
if (tree->str)
|
|
|
|
free((void *) tree->str);
|
|
|
|
free(tree);
|
2003-01-28 21:16:21 +00:00
|
|
|
}
|
|
|
|
}
|
2003-02-14 08:06:01 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
GIB_Tree_Ref (gib_tree_t **tp)
|
|
|
|
{
|
|
|
|
(*tp)->refs++;
|
|
|
|
Sys_DPrintf ("Ref: %p %u\n", *tp, (*tp)->refs);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
GIB_Tree_Unref (gib_tree_t **tp)
|
|
|
|
{
|
|
|
|
Sys_DPrintf ("Unref: %p %u\n", *tp, (*tp)->refs-1);
|
|
|
|
if (!(--(*tp)->refs)) {
|
|
|
|
GIB_Tree_Free_Recursive (*tp);
|
|
|
|
*tp = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|