headers/private/kernel/util/RadixBitmap.h

57

radix_node *root; // root of radix tree, actually it is an array

src/add-ons/kernel/network/stack/radix.c

1058

register struct radix_node *t, *tt, *ttt;

src/add-ons/kernel/network/stack/radix.c

150

rn_new_radix_mask(register struct radix_node *tt, register struct radix_mask *next)

src/add-ons/kernel/network/stack/radix.c

179

static struct radix_node *

src/add-ons/kernel/network/stack/radix.c

180

rn_search(void *v_arg, struct radix_node *head)

src/add-ons/kernel/network/stack/radix.c

182

register struct radix_node *x;

src/add-ons/kernel/network/stack/radix.c

199

static struct radix_node *

src/add-ons/kernel/network/stack/radix.c

200

rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)

src/add-ons/kernel/network/stack/radix.c

202

register struct radix_node *x;

src/add-ons/kernel/network/stack/radix.c

217

rn_satisfies_leaf(char *trial, register struct radix_node *leaf, int skip)

src/add-ons/kernel/network/stack/radix.c

246

static struct radix_node *

src/add-ons/kernel/network/stack/radix.c

247

rn_newpair(void *v, int b, struct radix_node nodes[2])

src/add-ons/kernel/network/stack/radix.c

249

register struct radix_node *tt = nodes, *t = tt + 1;

src/add-ons/kernel/network/stack/radix.c

271

static struct radix_node *

src/add-ons/kernel/network/stack/radix.c

273

struct radix_node nodes[2])

src/add-ons/kernel/network/stack/radix.c

276

struct radix_node *top = head->rnh_treetop;

src/add-ons/kernel/network/stack/radix.c

278

register struct radix_node *t = rn_search(v_arg, top);

src/add-ons/kernel/network/stack/radix.c

281

struct radix_node *tt;

src/add-ons/kernel/network/stack/radix.c

304

register struct radix_node *p, *x = top;

src/add-ons/kernel/network/stack/radix.c

341

struct radix_node *base, *next;

src/add-ons/kernel/network/stack/radix.c

344

register struct radix_node *rn, *last = 0 /* shut up gcc */;

src/add-ons/kernel/network/stack/radix.c

445

struct radix_node *base, *next;

src/add-ons/kernel/network/stack/radix.c

446

register struct radix_node *rn = h->rnh_treetop;

src/add-ons/kernel/network/stack/radix.c

486

struct radix_node *

src/add-ons/kernel/network/stack/radix.c

489

register struct radix_node *x;

src/add-ons/kernel/network/stack/radix.c

50

static struct radix_node *rn_insert(void *, struct radix_node_head *, int *,

src/add-ons/kernel/network/stack/radix.c

507

struct radix_node *

src/add-ons/kernel/network/stack/radix.c

51

struct radix_node [2]);

src/add-ons/kernel/network/stack/radix.c

511

register struct radix_node *t = head->rnh_treetop, *x;

src/add-ons/kernel/network/stack/radix.c

514

struct radix_node *saved_t, *top = t;

src/add-ons/kernel/network/stack/radix.c

52

static struct radix_node *rn_newpair(void *, int, struct radix_node[2]);

src/add-ons/kernel/network/stack/radix.c

53

static struct radix_node *rn_search(void *, struct radix_node *);

src/add-ons/kernel/network/stack/radix.c

54

static struct radix_node *rn_search_m(void *, struct radix_node *, void *);

src/add-ons/kernel/network/stack/radix.c

613

struct radix_node *

src/add-ons/kernel/network/stack/radix.c

617

register struct radix_node *x;

src/add-ons/kernel/network/stack/radix.c

621

struct radix_node *saved_x;

src/add-ons/kernel/network/stack/radix.c

653

x = (struct radix_node *)calloc(1, max_keylen + 2 * sizeof(*x));

src/add-ons/kernel/network/stack/radix.c

693

struct radix_node *

src/add-ons/kernel/network/stack/radix.c

695

struct radix_node treenodes[2])

src/add-ons/kernel/network/stack/radix.c

698

register struct radix_node *t, *x = 0, *tt;

src/add-ons/kernel/network/stack/radix.c

699

struct radix_node *saved_tt, *top = head->rnh_treetop;

src/add-ons/kernel/network/stack/radix.c

70

static struct radix_mask *rn_new_radix_mask(struct radix_node *tt,

src/add-ons/kernel/network/stack/radix.c

72

static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,

src/add-ons/kernel/network/stack/radix.c

748

struct radix_node *xx = x;

src/add-ons/kernel/network/stack/radix.c

845

struct radix_node *

src/add-ons/kernel/network/stack/radix.c

848

register struct radix_node *t, *p, *x, *tt;

src/add-ons/kernel/network/stack/radix.c

850

struct radix_node *dupedkey, *saved_tt, *top;

src/add-ons/kernel/network/stack/radix.h

101

struct radix_node *(*rnh_addaddr) /* add based on sockaddr */

src/add-ons/kernel/network/stack/radix.h

103

struct radix_node_head *head, struct radix_node nodes[]);

src/add-ons/kernel/network/stack/radix.h

104

struct radix_node *(*rnh_addpkt) /* add based on packet hdr */

src/add-ons/kernel/network/stack/radix.h

106

struct radix_node_head *head, struct radix_node nodes[]);

src/add-ons/kernel/network/stack/radix.h

107

struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */

src/add-ons/kernel/network/stack/radix.h

109

struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */

src/add-ons/kernel/network/stack/radix.h

111

struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */

src/add-ons/kernel/network/stack/radix.h

113

struct radix_node *(*rnh_lookup) /* locate based on sockaddr */

src/add-ons/kernel/network/stack/radix.h

115

struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */

src/add-ons/kernel/network/stack/radix.h

123

(struct radix_node *rn, struct radix_node_head *head);

src/add-ons/kernel/network/stack/radix.h

124

struct radix_node rnh_nodes[3]; /* empty tree for common case */

src/add-ons/kernel/network/stack/radix.h

135

struct radix_node *rn_addmask(void *, int, int);

src/add-ons/kernel/network/stack/radix.h

136

struct radix_node *rn_addroute (void *, void *, struct radix_node_head *,

src/add-ons/kernel/network/stack/radix.h

137

struct radix_node [2]);

src/add-ons/kernel/network/stack/radix.h

138

struct radix_node *rn_delete(void *, void *, struct radix_node_head *);

src/add-ons/kernel/network/stack/radix.h

139

struct radix_node *rn_lookup (void *v_arg, void *m_arg,

src/add-ons/kernel/network/stack/radix.h

141

struct radix_node *rn_match(void *, struct radix_node_head *);

src/add-ons/kernel/network/stack/radix.h

47

struct radix_node *rn_parent; /* parent */

src/add-ons/kernel/network/stack/radix.h

55

struct radix_node *rn_Dupedkey;

src/add-ons/kernel/network/stack/radix.h

59

struct radix_node *rn_L;/* progeny */

src/add-ons/kernel/network/stack/radix.h

60

struct radix_node *rn_R;/* progeny */

src/add-ons/kernel/network/stack/radix.h

87

struct radix_node *rmu_leaf; /* for normal routes */

src/add-ons/kernel/network/stack/radix.h

95

typedef int walktree_f_t(struct radix_node *, void *);

src/add-ons/kernel/network/stack/radix.h

98

struct radix_node *rnh_treetop;

src/system/kernel/util/RadixBitmap.cpp

106

radix_bitmap_init(radix_node *node, uint32 radix, uint32 skip, uint32 slots)

src/system/kernel/util/RadixBitmap.cpp

176

bmp->root = (radix_node *)malloc(bmp->root_size * sizeof(radix_node));

src/system/kernel/util/RadixBitmap.cpp

197

radix_leaf_alloc(radix_node *leaf, radix_slot_t slotIndex, int32 count)

src/system/kernel/util/RadixBitmap.cpp

220

radix_node_alloc(radix_node *node, radix_slot_t slotIndex, int32 count,

src/system/kernel/util/RadixBitmap.cpp

273

radix_leaf_dealloc(radix_node *leaf, radix_slot_t slotIndex, uint32 count)

src/system/kernel/util/RadixBitmap.cpp

285

radix_node_dealloc(radix_node *node, radix_slot_t slotIndex, uint32 count,