name-tree.c File Reference

#include "name-tree.h"
#include <string.h>

Macros
#define	minof2(a, b)   ((a) < (b) ? (a) : (b))

Functions
static void	nametree_refresh (ndn_nametree_t *nametree, int num)
static int	nametree_clean (ndn_nametree_t *nametree, int num)
static void	nametree_cleanup (ndn_nametree_t *nametree)
void	ndn_nametree_init (void *memory, ndn_table_id_t capacity)
static int	nametree_create_node (ndn_nametree_t *nametree, uint8_t name[], size_t len)
nametree_entry_t *	ndn_nametree_find (ndn_nametree_t *nametree, uint8_t name[], size_t len)
static nametree_entry_t *	nametree_find_or_insert_try (ndn_nametree_t *nametree, uint8_t name[], size_t len)
nametree_entry_t *	ndn_nametree_find_or_insert (ndn_nametree_t *nametree, uint8_t name[], size_t len)
nametree_entry_t *	ndn_nametree_prefix_match (ndn_nametree_t *nametree, uint8_t name[], size_t len, enum NDN_NAMETREE_ENTRY_TYPE type)
nametree_entry_t *	ndn_nametree_at (ndn_nametree_t *self, ndn_table_id_t id)
ndn_table_id_t	ndn_nametree_getid (ndn_nametree_t *self, nametree_entry_t *entry)

Macro Definition Documentation

minof2

#define minof2	(		a,
			b
	)		((a) < (b) ? (a) : (b))

Function Documentation

nametree_clean()

static int nametree_clean ( ndn_nametree_t *  nametree, int  num  )

static

nametree_cleanup()

static void nametree_cleanup ( ndn_nametree_t *  nametree )

static

nametree_create_node()

static int nametree_create_node ( ndn_nametree_t *  nametree, uint8_t  name[], size_t  len  )

static

nametree_find_or_insert_try()

static nametree_entry_t* nametree_find_or_insert_try ( ndn_nametree_t *  nametree, uint8_t  name[], size_t  len  )

static

nametree_refresh()

static void nametree_refresh ( ndn_nametree_t *  nametree, int  num  )

static