mtree.h

#ifndef _MTREE_H_
#define _MTREE_H_

#include "../../str.h"
#include "../../parser/msg_parser.h"

#define MT_TREE_SVAL    0       
#define MT_TREE_DW      1
#define MT_TREE_IVAL    2

typedef union {
    int n;
    str s;
} is_t;

typedef struct _mt_dw
{
        unsigned int dstid;
        unsigned int weight;
        struct _mt_dw *next;
} mt_dw_t;

typedef struct _mt_is
{
    is_t tvalue;
    struct _mt_is *next;
} mt_is_t;

typedef struct _mt_node
{
    mt_is_t *tvalues;
    void *data;
    struct _mt_node *child;
} mt_node_t;

#define MT_MAX_DEPTH    32

#define MT_NODE_SIZE    mt_char_list.len

typedef struct _m_tree
{
        str tname;
        str dbtable;
        int type;
        unsigned int nrnodes;
        unsigned int nritems;
        unsigned int memsize;
        mt_node_t *head;
        struct _m_tree *next;
} m_tree_t;


/* prefix tree operations */
int mt_add_to_tree(m_tree_t *pt, str *tprefix, str *svalue);

m_tree_t* mt_get_tree(str *tname);
m_tree_t* mt_get_first_tree();

is_t* mt_get_tvalue(m_tree_t *pt, str *tomatch);
int mt_match_prefix(struct sip_msg *msg, m_tree_t *pt,
                    str *tomatch, int mode);

m_tree_t* mt_init_tree(str* tname, str* dbtable, int type);
void mt_free_tree(m_tree_t *pt);
int mt_print_tree(m_tree_t *pt);
void mt_free_node(mt_node_t *pn, int type);

void mt_char_table_init(void);
int mt_node_set_payload(mt_node_t *node, int type);
int mt_node_unset_payload(mt_node_t *node, int type);

int mt_table_spec(char* val);
void mt_destroy_trees(void);
int mt_defined_trees(void);

m_tree_t *mt_swap_list_head(m_tree_t *ntree);
int mt_init_list_head(void);
m_tree_t *mt_add_tree(m_tree_t **dpt, str *tname, str *dbtable,
                int type);

#endif