tree/mux_tree.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "tree.h"
#include "mux_tree.h"

Include dependency graph for mux_tree.c:

Go to the source code of this file.

Defines
#define	FATAL(msgs...)   { fprintf(stderr, ##msgs); exit(1); }
#define	TREAD(to, len, msg)
#define	TSAVE(from, len, msg)
#define	Create(var, typ, count)
Functions
static int	NodeCompare (Node *a, Node *b)
static void	NodeDelete (Node *a)
void	AddEntry (Tree *tree, muxkey_t key, dtype_t type, dsize_t size, void *data)
Node *	FindNode (Tree tree, muxkey_t key)
void	DeleteEntry (Tree *tree, muxkey_t key)
static int	NodeSave (Node *n)
int	SaveTree (FILE *f, Tree tree)
static void	MyLoadTree (FILE *f, Tree *tree, int(*sizefunc)(int))
void	ClearTree (Tree *tree)
void	LoadTree (FILE *f, Tree *tree, int(*sizefunc)(int))
void	UpdateTree (FILE *f, Tree *tree, int(*sizefunc)(int))
void	GoThruTree (Tree tree, int(*func)(Node *))
Variables
static FILE *	tree_file
static int	nodesave_count

---

Define Documentation

#define Create	(	var,
		typ,
		count		)

Value:

if (!(var = (typ *) calloc(sizeof (typ), count))) \
{ fprintf(stderr, "Error mallocating!\n"); exit(1); }

Definition at line 37 of file mux_tree.c.

#define FATAL

(

msgs...

)

{ fprintf(stderr, ##msgs); exit(1); }

Definition at line 15 of file mux_tree.c.

#define TREAD	(	to,
		len,
		msg		)

Value:

if (feof(f)) FATAL("ERROR READING FILE (%s): EOF.\n", msg); \
if (fread(to,1,len,f) != len) \
FATAL("ERROR READING FILE (%s): NOT ENOUGH READ!\n", msg);

Definition at line 18 of file mux_tree.c.

Referenced by MyLoadTree().

#define TSAVE	(	from,
		len,
		msg		)

Value:

if (fwrite(from, 1, len, tree_file) != len) \
FATAL("ERROR WRITING FILE (%s): NOT ENOUGH WRITTEN(?!?)\n", msg);

Definition at line 23 of file mux_tree.c.

Referenced by NodeSave().

---

Function Documentation

void AddEntry	(	Tree *	tree,
		muxkey_t	key,
		dtype_t	type,
		dsize_t	size,
		void *	data
	)

Definition at line 55 of file mux_tree.c.

References Create, rbtc_node_type::data, rbtc_node_type::key, NodeCompare(), NodeDelete(), rbtc_node_type::size, tree_add(), and rbtc_node_type::type.

Referenced by MyLoadTree(), and NewSpecialObject().

{
    Node *foo;

    if (!tree)
        return;
    Create(foo, Node, 1);
    foo->key = key;
    foo->data = data;
    foo->type = type;
    foo->size = size;
    tree_add(tree, NodeCompare, foo, NodeDelete);
}

void ClearTree

(

Tree *

tree

)

Definition at line 155 of file mux_tree.c.

References NodeDelete(), and tree_mung().

Referenced by LoadTree().

{
    tree_mung(tree, NodeDelete);
}

void DeleteEntry	(	Tree *	tree,
		muxkey_t	key
	)

Definition at line 78 of file mux_tree.c.

References FindNode(), rbtc_node_type::key, NodeCompare(), NodeDelete(), and tree_delete().

Referenced by DisposeSpecialObject(), and zap_unneccessary_hcode().

{
    Node foo;

    if (FindNode(*tree, key)) {
        foo.key = key;
        tree_delete(tree, NodeCompare, &foo, NodeDelete);
    }
}

Node* FindNode	(	Tree	tree,
		muxkey_t	key
	)

Definition at line 70 of file mux_tree.c.

References rbtc_node_type::key, NodeCompare(), and tree_srch().

{
    Node foo;

    foo.key = key;
    return tree_srch(&tree, NodeCompare, &foo);
}

void GoThruTree	(	Tree	tree,
		int(*)(Node *)	func
	)

Definition at line 171 of file mux_tree.c.

References tree_trav().

{
    tree_trav(&tree, func);
}

void LoadTree	(	FILE *	f,
		Tree *	tree,
		int(*)(int)	sizefunc
	)

Definition at line 160 of file mux_tree.c.

References ClearTree(), and MyLoadTree().

{
    ClearTree(tree);
    MyLoadTree(f, tree, sizefunc);
}

static void MyLoadTree	(	FILE *	f,
		Tree *	tree,
		int(*)(int)	sizefunc
	)			[static]

Definition at line 115 of file mux_tree.c.

References AddEntry(), and TREAD.

Referenced by LoadTree(), and UpdateTree().

{
    muxkey_t key;
    dtype_t type;
    dsize_t osize;
    int nsize, rsize;
    void *data;

    TREAD(&key, sizeof(key), "first key");
    while (key >= 0 && !feof(f)) {
        TREAD(&type, sizeof(type), "type");
        TREAD(&osize, sizeof(osize), "size");
        if (sizefunc && (rsize = sizefunc(type)) >= 0) {
            nsize = osize > rsize ? osize : rsize;
        } else
            nsize = rsize = osize;
        if (nsize) {
            if (!(data = malloc(nsize))) {
                printf("Error malloccing!\n");
                exit(1);
            }
            if (osize)
                TREAD(data, osize, "data");

            if (nsize > osize)
                memset(data + osize, 0, nsize - osize);
        } else
            data = NULL;

        /* Set node size to the real type size, rather than the read size,
         * so that the object will get 'truncated' to the right size on the
         * next dump.
         */
        AddEntry(tree, key, type, rsize, data);
        TREAD(&key, sizeof(key), "new key");
    }
}

static int NodeCompare	(	Node *	a,
		Node *	b
	)			[static]

Definition at line 41 of file mux_tree.c.

References rbtc_node_type::key.

Referenced by AddEntry(), DeleteEntry(), and FindNode().

{
    if (a->key < b->key)
        return -1;
    return (a->key > b->key);
}

static void NodeDelete

(

Node *

a

)

[static]

Definition at line 48 of file mux_tree.c.

References rbtc_node_type::data.

Referenced by AddEntry(), ClearTree(), and DeleteEntry().

{
    if (a->data)
        free((void *) a->data);
    free((void *) a);
}

static int NodeSave

(

Node *

n

)

[static]

Definition at line 92 of file mux_tree.c.

References rbtc_node_type::data, rbtc_node_type::key, nodesave_count, rbtc_node_type::size, TSAVE, and rbtc_node_type::type.

Referenced by SaveTree().

{
    TSAVE(&n->key, sizeof(n->key), "key");
    TSAVE(&n->type, sizeof(n->type), "type");
    TSAVE(&n->size, sizeof(n->size), "size");
    if (n->size > 0)
        TSAVE(n->data, n->size, "data");
    nodesave_count++;
    return 1;
}

int SaveTree	(	FILE *	f,
		Tree	tree
	)

Definition at line 103 of file mux_tree.c.

References NodeSave(), nodesave_count, tree_file, and tree_trav().

{
    muxkey_t key;

    nodesave_count = 0;
    tree_file = f;
    tree_trav(&tree, NodeSave);
    key = -1;
    fwrite(&key, sizeof(key), 1, tree_file);
    return nodesave_count;
}

void UpdateTree	(	FILE *	f,
		Tree *	tree,
		int(*)(int)	sizefunc
	)

Definition at line 166 of file mux_tree.c.

References MyLoadTree().

Referenced by load_xcode().

{
    MyLoadTree(f, tree, sizefunc);
}

---

Variable Documentation

int nodesave_count [static]

Definition at line 90 of file mux_tree.c.

Referenced by NodeSave(), and SaveTree().

FILE* tree_file [static]

Definition at line 88 of file mux_tree.c.

Referenced by SaveTree().

---