bt-int.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include "MALLOC.h"
#include "bt-int.h"

Include dependency graph for bt-int.c:

Go to the source code of this file.

Functions
int	BTI_init (struct bti_node **n)
int	BTI_add (struct bti_node **n, int value)
int	BTI_dump (struct bti_node **n)
int	BTI_done (struct bti_node **n)

---

Function Documentation

int BTI_add	(	struct bti_node **	n,
		int	value
	)

Definition at line 17 of file bt-int.c.

References data, bti_node::data, dir, bti_node::l, MALLOC, n, NULL, p, and bti_node::r.

Referenced by OLE_follow_chain().

{
        int collision = 0;
        int dir = 0;
        struct bti_node *p = NULL, *node = *n;

        /*      fprintf(stdout,"Adding %d to %p\n", value, *n);*/
        while (node != NULL)
        {
                if (value > node->data) { p = node; dir=1;  node = node->r; }
                else if (value < node->data) { p = node; dir=-1; node = node->l; }
                else if (value == node->data) 
                {
                        collision = 1;
                        break;
                }
        }

        if (collision == 0)
        {
                struct bti_node *leaf;

                leaf = MALLOC(sizeof(struct bti_node));
                if (leaf == NULL)
                {
                        return -1;
                }

                leaf->data = value;
                leaf->l = leaf->r = NULL;

                if (p != NULL)
                {
                        switch (dir) {
                                case 1: 
                                        p->r = leaf;
                                        break;
                                case -1: 
                                        p->l = leaf;
                                        break;
                        }
                } else {
                        *n = leaf;
                }


        }

        return collision;
}

Here is the caller graph for this function:

int BTI_done

(

struct bti_node **

n

)

Definition at line 83 of file bt-int.c.

References BTI_done(), FREE, bti_node::l, n, NULL, and bti_node::r.

Referenced by BTI_done(), and OLE_follow_chain().

{
        struct bti_node *node;

        if (n == NULL) return 0;
        if (*n == NULL) return 0;

        node = *n;
        
        if (node->l) BTI_done(&(node->l)); 
        if (node->r) BTI_done(&(node->r));
        if (*n) { FREE(*n); *n = NULL; }

        return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int BTI_dump

(

struct bti_node **

n

)

Definition at line 69 of file bt-int.c.

References BTI_dump(), bti_node::data, bti_node::l, n, and bti_node::r.

Referenced by BTI_dump().

{
                struct bti_node *node;

        node = *n;
        
        if (node->l) BTI_dump(&(node->l)); 
        if (*n) { fprintf(stdout,"%d, ", node->data); }
        if (node->r) BTI_dump(&(node->r));

        return 0;

}

Here is the call graph for this function:

Here is the caller graph for this function:

int BTI_init

(

struct bti_node **

n

)

Definition at line 10 of file bt-int.c.

References n, and NULL.

Referenced by OLE_follow_chain().

{
        *n = NULL;

        return 0;
}

Here is the caller graph for this function:

---