mirror of
https://git.code.sf.net/p/quake/quakeforge
synced 2024-11-05 20:50:43 +00:00
89 lines
2 KiB
C
89 lines
2 KiB
C
|
/*
|
||
|
|
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>
|
||
|
|
|
||
|
|
#include "QF/qtypes.h"
|
||
|
|
#include "QF/gib_tree.h"
|
||
|
|
|
||
|
|
gib_tree_t *
|
||
|
|
GIB_Tree_New (unsigned int flags)
|
||
|
|
{
|
||
|
|
gib_tree_t *new = calloc (1, sizeof (gib_tree_t));
|
||
|
|
new->flags = flags;
|
||
|
|
return new;
|
||
|
|
}
|
||
|
|
|
||
|
|
static void
|
||
|
|
GIB_Tree_Free (gib_tree_t *tree)
|
||
|
|
{
|
||
|
|
if (tree->str)
|
||
|
|
free((void *) tree->str);
|
||
|
|
if (tree->parent)
|
||
|
|
tree->parent->children = 0;
|
||
|
|
free(tree);
|
||
|
|
}
|
||
|
|
|
||
|
|
void
|
||
|
|
GIB_Tree_Free_Recursive (gib_tree_t *tree, qboolean force)
|
||
|
|
{
|
||
|
|
gib_tree_t *n;
|
||
|
|
|
||
|
|
for (; tree; tree = n) {
|
||
|
|
n = tree->next;
|
||
|
|
// Leave perm nodes and their children alone
|
||
|
|
// (creating a temp child of a perm node is illegal)
|
||
|
|
if (tree->flags & TREE_PERM && !force)
|
||
|
|
return;
|
||
|
|
/* Free the children (but not on virtuals, and don't free nested functions EVER) */
|
||
|
|
if (tree->children && !(tree->children->flags & TREE_FUNC))
|
||
|
|
GIB_Tree_Free_Recursive (tree->children, force);
|
||
|
|
GIB_Tree_Free (tree);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
void
|
||
|
|
GIB_Tree_Add_Flag_Recursive (gib_tree_t *tree, unsigned int flag)
|
||
|
|
{
|
||
|
|
for (; tree; tree = tree->next) {
|
||
|
|
tree->flags |= flag;
|
||
|
|
if (tree->children)
|
||
|
|
GIB_Tree_Add_Flag_Recursive (tree->children, flag);
|
||
|
|
}
|
||
|
|
}
|