#include "squid.h"
#include "radix.h"
#include "util.h"

Include dependency graph for radix.c:

Macros
#define	rn_masktop (squid_mask_rnhead->rnh_treetop)

#define	rn_dupedkey rn_u.rn_leaf.rn_Dupedkey

#define	rn_off rn_u.rn_node.rn_Off

#define	rn_l rn_u.rn_node.rn_L

#define	rn_r rn_u.rn_node.rn_R

#define	rm_mask rm_rmu.rmu_mask

#define	rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */

#define	squid_R_Malloc(p, t, n) (p = (t) xmalloc((unsigned int)(n)))

#define	squid_Free(p) xfree((char *)p)

#define	squid_MKGet(m)

#define	squid_MKFree(m) { (m)->rm_mklist = squid_rn_mkfreelist; squid_rn_mkfreelist = (m);}

#define	min(x, y) ((x)<(y)? (x) : (y))

Functions
struct squid_radix_node *	squid_rn_search (void v_arg, struct squid_radix_node head)

struct squid_radix_node *	squid_rn_search_m (void v_arg, struct squid_radix_node head, void *m_arg)

int	squid_rn_refines (void m_arg, void n_arg)

struct squid_radix_node *	squid_rn_lookup (void v_arg, void m_arg, struct squid_radix_node_head *head)

static int	rn_satsifies_leaf (char trial, register struct squid_radix_node leaf, int skip)

struct squid_radix_node *	squid_rn_match (void v_arg, struct squid_radix_node_head head)

struct squid_radix_node *	squid_rn_newpair (void *v, int b, struct squid_radix_node nodes[2])

struct squid_radix_node *	squid_rn_insert (void v_arg, struct squid_radix_node_head head, int *dupentry, struct squid_radix_node nodes[2])

struct squid_radix_node *	squid_rn_addmask (void *n_arg, int search, int skip)

static int	rn_lexobetter (void m_arg, void n_arg)

static struct squid_radix_mask *	rn_new_radix_mask (struct squid_radix_node tt, struct squid_radix_mask next)

struct squid_radix_node *	squid_rn_addroute (void v_arg, void n_arg, struct squid_radix_node_head *head, struct squid_radix_node treenodes[2])

struct squid_radix_node *	squid_rn_delete (void v_arg, void netmask_arg, struct squid_radix_node_head *head)

int	squid_rn_walktree (struct squid_radix_node_head h, int(f)(struct squid_radix_node , void ), void *w)

int	squid_rn_inithead (struct squid_radix_node_head **head, int off)

void	squid_rn_init (void)

Variables
int	squid_max_keylen

struct squid_radix_mask *	squid_rn_mkfreelist

struct squid_radix_node_head *	squid_mask_rnhead

static char *	addmask_key

static unsigned char	normal_chars [] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xFF}

static char *	rn_zeros

static char *	rn_ones

Macro Definition Documentation

◆ min

#define min	(	x,
		y
	)	((x)<(y)? (x) : (y))

Definition at line 114 of file radix.c.

◆ rm_leaf

#define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */

Definition at line 98 of file radix.c.

◆ rm_mask

#define rm_mask rm_rmu.rmu_mask

Definition at line 97 of file radix.c.

◆ rn_dupedkey

#define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey

Definition at line 93 of file radix.c.

◆ rn_l

#define rn_l rn_u.rn_node.rn_L

Definition at line 95 of file radix.c.

◆ rn_masktop

#define rn_masktop (squid_mask_rnhead->rnh_treetop)

Definition at line 92 of file radix.c.

◆ rn_off

#define rn_off rn_u.rn_node.rn_Off

Definition at line 94 of file radix.c.

◆ rn_r

#define rn_r rn_u.rn_node.rn_R

Definition at line 96 of file radix.c.

◆ squid_Free

#define squid_Free ( p ) xfree((char *)p)

Definition at line 102 of file radix.c.

◆ squid_MKFree

#define squid_MKFree ( m ) { (m)->rm_mklist = squid_rn_mkfreelist; squid_rn_mkfreelist = (m);}

Definition at line 111 of file radix.c.

◆ squid_MKGet

#define squid_MKGet ( m )

Value:

    {\
    if (squid_rn_mkfreelist) {\
        m = squid_rn_mkfreelist; \
        squid_rn_mkfreelist = (m)->rm_mklist; \
    } else \
        squid_R_Malloc(m, struct squid_radix_mask *, sizeof (*(m)));\
    }