lib/libcrypto/x509/x509_ncons.c

261

GENERAL_SUBTREE *tree;

lib/libcrypto/x509/x509_ncons.c

267

tree = sk_GENERAL_SUBTREE_value(trees, i);

lib/libcrypto/x509/x509_ncons.c

269

if (tree->base->type == GEN_IPADD)

lib/libcrypto/x509/x509_ncons.c

270

print_nc_ipadd(bp, tree->base->d.ip);

lib/libcrypto/x509/x509_ncons.c

272

GENERAL_NAME_print(bp, tree->base);

lib/libcurses/base/key_defined.c

42

find_definition(TRIES * tree, const char *str)

lib/libcurses/base/key_defined.c

48

for (ptr = tree; ptr != 0; ptr = ptr->sibling) {

lib/libcurses/base/tries.c

101

while (*tree != 0) {

lib/libcurses/base/tries.c

102

if (_nc_remove_key(&(*tree)->child, code)) {

lib/libcurses/base/tries.c

105

if ((*tree)->value == code) {

lib/libcurses/base/tries.c

106

if ((*tree)->child) {

lib/libcurses/base/tries.c

108

(*tree)->value = 0;

lib/libcurses/base/tries.c

110

TRIES *to_free = *tree;

lib/libcurses/base/tries.c

111

*tree = (*tree)->sibling;

lib/libcurses/base/tries.c

116

tree = &(*tree)->sibling;

lib/libcurses/base/tries.c

126

_nc_remove_string(TRIES ** tree, const char *string)

lib/libcurses/base/tries.c

128

T((T_CALLED("_nc_remove_string(%p,%s)"), (void *) tree, _nc_visbuf(string)));

lib/libcurses/base/tries.c

133

while (*tree != 0) {

lib/libcurses/base/tries.c

134

if (UChar((*tree)->ch) == UChar(*string)) {

lib/libcurses/base/tries.c

136

returnCode(_nc_remove_string(&(*tree)->child, string + 1));

lib/libcurses/base/tries.c

137

if ((*tree)->child == 0) {

lib/libcurses/base/tries.c

138

TRIES *to_free = *tree;

lib/libcurses/base/tries.c

139

*tree = (*tree)->sibling;

lib/libcurses/base/tries.c

146

tree = &(*tree)->sibling;

lib/libcurses/base/tries.c

53

_nc_expand_try(TRIES * tree, unsigned code, int *count, size_t len)

lib/libcurses/base/tries.c

55

TRIES *ptr = tree;

lib/libcurses/base/tries.c

94

_nc_remove_key(TRIES ** tree, unsigned code)

lib/libcurses/base/tries.c

96

T((T_CALLED("_nc_remove_key(%p,%d)"), (void *) tree, code));

lib/libcurses/tinfo/add_tries.c

116

*tree = NULL;

lib/libcurses/tinfo/add_tries.c

52

_nc_add_to_try(TRIES ** tree, const char *str, unsigned code)

lib/libcurses/tinfo/add_tries.c

58

(void *) *tree, _nc_visbuf(str), code));

lib/libcurses/tinfo/add_tries.c

62

if ((*tree) != 0) {

lib/libcurses/tinfo/add_tries.c

63

ptr = savedptr = (*tree);

lib/libcurses/tinfo/add_tries.c

94

savedptr = ptr = (*tree) = typeCalloc(TRIES, 1);

lib/libfuse/fuse_private.h

104

struct tree vnode_tree;

lib/libfuse/fuse_private.h

141

int tree_check(struct tree *, uint64_t);

lib/libfuse/fuse_private.h

142

void *tree_set(struct tree *, uint64_t, void *);

lib/libfuse/fuse_private.h

143

void *tree_get(struct tree *, uint64_t);

lib/libfuse/fuse_private.h

144

void *tree_pop(struct tree *, uint64_t);

lib/libfuse/fuse_private.h

57

SPLAY_HEAD(tree, treeentry);

lib/libfuse/tree.c

103

SPLAY_GENERATE(tree, treeentry, entry, treeentry_cmp);

lib/libfuse/tree.c

32

SPLAY_PROTOTYPE(tree, treeentry, entry, treeentry_cmp);

lib/libfuse/tree.c

35

tree_check(struct tree *t, uint64_t id)

lib/libfuse/tree.c

40

return (SPLAY_FIND(tree, t, &key) != NULL);

lib/libfuse/tree.c

44

tree_set(struct tree *t, uint64_t id, void *data)

lib/libfuse/tree.c

49

if ((entry = SPLAY_FIND(tree, t, &key)) == NULL) {

lib/libfuse/tree.c

54

SPLAY_INSERT(tree, t, entry);

lib/libfuse/tree.c

63

tree_get(struct tree *t, uint64_t id)

lib/libfuse/tree.c

68

if ((entry = SPLAY_FIND(tree, t, &key)) == NULL) {

lib/libfuse/tree.c

77

tree_pop(struct tree *t, uint64_t id)

lib/libfuse/tree.c

83

if ((entry = SPLAY_FIND(tree, t, &key)) == NULL)

lib/libfuse/tree.c

87

SPLAY_REMOVE(tree, t, entry);

lib/libz/trees.c

201

local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {

lib/libz/trees.c

222

int len = tree[n].Len;

lib/libz/trees.c

225

tree[n].Code = (ush)bi_reverse(next_code[len]++, len);

lib/libz/trees.c

227

Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",

lib/libz/trees.c

228

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));

lib/libz/trees.c

237

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

lib/libz/trees.c

241

# define send_code(s, c, tree) \

lib/libz/trees.c

243

send_bits(s, tree[c].Code, tree[c].Len); }

lib/libz/trees.c

486

#define pqremove(s, tree, top) \

lib/libz/trees.c

490

pqdownheap(s, tree, SMALLEST); \

lib/libz/trees.c

497

#define smaller(tree, n, m, depth) \

lib/libz/trees.c

498

(tree[n].Freq < tree[m].Freq || \

lib/libz/trees.c

499

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

lib/libz/trees.c

507

local void pqdownheap(deflate_state *s, ct_data *tree, int k) {

lib/libz/trees.c

513

smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) {

lib/libz/trees.c

517

if (smaller(tree, v, s->heap[j], s->depth)) break;

lib/libz/trees.c

539

ct_data *tree = desc->dyn_tree;

lib/libz/trees.c

557

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

lib/libz/trees.c

561

bits = tree[tree[n].Dad].Len + 1;

lib/libz/trees.c

563

tree[n].Len = (ush)bits;

lib/libz/trees.c

571

f = tree[n].Freq;

lib/libz/trees.c

603

if ((unsigned) tree[m].Len != (unsigned) bits) {

lib/libz/trees.c

604

Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

lib/libz/trees.c

605

s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;

lib/libz/trees.c

606

tree[m].Len = (ush)bits;

lib/libz/trees.c

626

ct_data *tree = desc->dyn_tree;

lib/libz/trees.c

640

if (tree[n].Freq != 0) {

lib/libz/trees.c

644

tree[n].Len = 0;

lib/libz/trees.c

655

tree[node].Freq = 1;

lib/libz/trees.c

665

for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

lib/libz/trees.c

672

pqremove(s, tree, n); /* n = node of least frequency */

lib/libz/trees.c

679

tree[node].Freq = tree[n].Freq + tree[m].Freq;

lib/libz/trees.c

682

tree[n].Dad = tree[m].Dad = (ush)node;

lib/libz/trees.c

684

if (tree == s->bl_tree) {

lib/libz/trees.c

686

node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);

lib/libz/trees.c

691

pqdownheap(s, tree, SMALLEST);

lib/libz/trees.c

703

gen_codes ((ct_data *)tree, max_code, s->bl_count);

lib/libz/trees.c

710

local void scan_tree(deflate_state *s, ct_data *tree, int max_code) {

lib/libz/trees.c

714

int nextlen = tree[0].Len; /* length of next code */

lib/libz/trees.c

720

tree[max_code + 1].Len = (ush)0xffff; /* guard */

lib/libz/trees.c

723

curlen = nextlen; nextlen = tree[n + 1].Len;

lib/libz/trees.c

751

local void send_tree(deflate_state *s, ct_data *tree, int max_code) {

lib/libz/trees.c

755

int nextlen = tree[0].Len; /* length of next code */

lib/libz/trees.c

764

curlen = nextlen; nextlen = tree[n + 1].Len;

regress/sys/sys/tree/rb/rb-test.c

103

static void print_tree(const struct tree *);

regress/sys/sys/tree/rb/rb-test.c

117

RB_HEAD(tree, node);

regress/sys/sys/tree/rb/rb-test.c

118

struct tree root = RB_INITIALIZER(&root);

regress/sys/sys/tree/rb/rb-test.c

120

RB_PROTOTYPE(tree, node, node_link, compare)

regress/sys/sys/tree/rb/rb-test.c

122

RB_GENERATE(tree, node, node_link, compare)

regress/sys/sys/tree/rb/rb-test.c

212

ins = RB_MIN(tree, &root);

regress/sys/sys/tree/rb/rb-test.c

221

ins = RB_MAX(tree, &root);

regress/sys/sys/tree/rb/rb-test.c

230

assert(RB_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rb-test.c

241

assert(RB_REMOVE(tree, &root, tmp) == tmp);

regress/sys/sys/tree/rb/rb-test.c

244

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

280

assert(RB_REMOVE(tree, &root, tmp) == tmp);

regress/sys/sys/tree/rb/rb-test.c

283

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

314

ins = RB_FIND(tree, &root, tmp);

regress/sys/sys/tree/rb/rb-test.c

316

assert(RB_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rb-test.c

319

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

334

if (RB_REMOVE(tree, &root, ins) != ins)

regress/sys/sys/tree/rb/rb-test.c

358

ins = RB_FIND(tree, &root, tmp);

regress/sys/sys/tree/rb/rb-test.c

362

if (RB_REMOVE(tree, &root, ins) == NULL)

regress/sys/sys/tree/rb/rb-test.c

366

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

381

if (RB_REMOVE(tree, &root, ins) != ins)

regress/sys/sys/tree/rb/rb-test.c

404

ins = RB_NFIND(tree, &root, tmp);

regress/sys/sys/tree/rb/rb-test.c

407

if (RB_REMOVE(tree, &root, ins) == NULL)

regress/sys/sys/tree/rb/rb-test.c

411

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

444

ins = RB_PFIND(tree, &root, tmp);

regress/sys/sys/tree/rb/rb-test.c

447

if (RB_REMOVE(tree, &root, ins) == NULL)

regress/sys/sys/tree/rb/rb-test.c

451

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

480

tmp = RB_MIN(tree, &root);

regress/sys/sys/tree/rb/rb-test.c

484

tmp = RB_NEXT(tree, &root, tmp);

regress/sys/sys/tree/rb/rb-test.c

495

tmp = RB_MAX(tree, &root);

regress/sys/sys/tree/rb/rb-test.c

499

tmp = RB_PREV(tree, &root, tmp);

regress/sys/sys/tree/rb/rb-test.c

513

assert(RB_REMOVE(tree, &root, tmp) == tmp);

regress/sys/sys/tree/rb/rb-test.c

516

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

546

RB_FOREACH(ins, tree, &root) {

regress/sys/sys/tree/rb/rb-test.c

563

RB_FOREACH_REVERSE(ins, tree, &root) {

regress/sys/sys/tree/rb/rb-test.c

581

assert(RB_REMOVE(tree, &root, tmp) == tmp);

regress/sys/sys/tree/rb/rb-test.c

584

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

607

RB_FOREACH_SAFE(ins, tree, &root, tmp) {

regress/sys/sys/tree/rb/rb-test.c

613

assert(RB_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rb-test.c

633

RB_FOREACH_REVERSE_SAFE(ins, tree, &root, tmp) {

regress/sys/sys/tree/rb/rb-test.c

639

assert(RB_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rb-test.c

661

if (RB_INSERT(tree, &root, tmp) != NULL)

regress/sys/sys/tree/rb/rb-test.c

669

if (RB_INSERT_NEXT(tree, &root, ins, tmp) != NULL)

regress/sys/sys/tree/rb/rb-test.c

674

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

687

RB_FOREACH_REVERSE_SAFE(ins, tree, &root, tmp) {

regress/sys/sys/tree/rb/rb-test.c

688

assert(RB_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rb-test.c

710

if (RB_INSERT(tree, &root, tmp) != NULL)

regress/sys/sys/tree/rb/rb-test.c

718

if (RB_INSERT_PREV(tree, &root, ins, tmp) != NULL)

regress/sys/sys/tree/rb/rb-test.c

723

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

736

RB_FOREACH_REVERSE_SAFE(ins, tree, &root, tmp) {

regress/sys/sys/tree/rb/rb-test.c

737

assert(RB_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rb-test.c

763

if (RB_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rb-test.c

785

if (RB_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rb-test.c

807

if (RB_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rb-test.c

831

if (RB_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rb-test.c

855

if (RB_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rb-test.c

885

indent, "", n->key, n->size, RB_RANK(tree, n),

regress/sys/sys/tree/rb/rb-test.c

893

print_tree(const struct tree *t)

regress/sys/sys/tree/rb/rb-test.c

91

struct tree;

regress/sys/sys/tree/rb/rb-test.c

941

if (RB_INSERT(tree, &root, tmp) != NULL)

regress/sys/sys/tree/rb/rb-test.c

951

rank = RB_RANK(tree, RB_ROOT(&root));

regress/sys/sys/tree/rb/rb-test.c

961

RB_INSERT(tree, &root, tmp);

regress/sys/sys/tree/rb/rb-test.c

965

ins = RB_FIND(tree, &root, &it);

regress/sys/sys/tree/rb/rb-test.c

971

ins = RB_NFIND(tree, &root, &it);

regress/sys/sys/tree/rb/rbt-test.c

102

static void print_tree(const struct tree *);

regress/sys/sys/tree/rb/rbt-test.c

116

RBT_HEAD(tree, node);

regress/sys/sys/tree/rb/rbt-test.c

117

struct tree root = RBT_INITIALIZER(&root);

regress/sys/sys/tree/rb/rbt-test.c

119

RBT_PROTOTYPE(tree, node, node_link, compare)

regress/sys/sys/tree/rb/rbt-test.c

121

RBT_GENERATE(tree, node, node_link, compare);

regress/sys/sys/tree/rb/rbt-test.c

188

RBT_INIT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

205

ins = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

211

ins = RBT_MIN(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

220

ins = RBT_MAX(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

227

ins = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

229

assert(RBT_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rbt-test.c

232

assert(ITER == (RBT_ROOT(tree, &root))->size);

regress/sys/sys/tree/rb/rbt-test.c

238

tmp = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

240

assert(RBT_REMOVE(tree, &root, tmp) == tmp);

regress/sys/sys/tree/rb/rbt-test.c

243

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

250

if (!(RBT_EMPTY(&root)) && (RBT_ROOT(tree, &root))->size != ITER - 1 - i)

regress/sys/sys/tree/rb/rbt-test.c

277

tmp = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

279

assert(RBT_REMOVE(tree, &root, tmp) == tmp);

regress/sys/sys/tree/rb/rbt-test.c

282

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

313

ins = RBT_FIND(tree, &root, tmp);

regress/sys/sys/tree/rb/rbt-test.c

315

assert(RBT_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rbt-test.c

318

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

330

ins = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

333

if (RBT_REMOVE(tree, &root, ins) != ins)

regress/sys/sys/tree/rb/rbt-test.c

357

ins = RBT_FIND(tree, &root, tmp);

regress/sys/sys/tree/rb/rbt-test.c

361

if (RBT_REMOVE(tree, &root, ins) == NULL)

regress/sys/sys/tree/rb/rbt-test.c

365

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

377

ins = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

380

if (RBT_REMOVE(tree, &root, ins) != ins)

regress/sys/sys/tree/rb/rbt-test.c

403

ins = RBT_NFIND(tree, &root, tmp);

regress/sys/sys/tree/rb/rbt-test.c

406

if (RBT_REMOVE(tree, &root, ins) == NULL)

regress/sys/sys/tree/rb/rbt-test.c

410

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

443

ins = RBT_PFIND(tree, &root, tmp);

regress/sys/sys/tree/rb/rbt-test.c

446

if (RBT_REMOVE(tree, &root, ins) == NULL)

regress/sys/sys/tree/rb/rbt-test.c

450

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

479

tmp = RBT_MIN(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

483

tmp = RBT_NEXT(tree, tmp);

regress/sys/sys/tree/rb/rbt-test.c

494

tmp = RBT_MAX(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

498

tmp = RBT_PREV(tree, tmp);

regress/sys/sys/tree/rb/rbt-test.c

510

tmp = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

512

assert(RBT_REMOVE(tree, &root, tmp) == tmp);

regress/sys/sys/tree/rb/rbt-test.c

515

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

545

RBT_FOREACH(ins, tree, &root) {

regress/sys/sys/tree/rb/rbt-test.c

562

RBT_FOREACH_REVERSE(ins, tree, &root) {

regress/sys/sys/tree/rb/rbt-test.c

578

tmp = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

580

assert(RBT_REMOVE(tree, &root, tmp) == tmp);

regress/sys/sys/tree/rb/rbt-test.c

583

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

606

RBT_FOREACH_SAFE(ins, tree, &root, tmp) {

regress/sys/sys/tree/rb/rbt-test.c

612

assert(RBT_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rbt-test.c

632

RBT_FOREACH_REVERSE_SAFE(ins, tree, &root, tmp) {

regress/sys/sys/tree/rb/rbt-test.c

638

assert(RBT_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rbt-test.c

660

if (RBT_INSERT(tree, &root, tmp) != NULL)

regress/sys/sys/tree/rb/rbt-test.c

668

if (RBT_INSERT_NEXT(tree, &root, ins, tmp) != NULL)

regress/sys/sys/tree/rb/rbt-test.c

673

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

686

RBT_FOREACH_REVERSE_SAFE(ins, tree, &root, tmp) {

regress/sys/sys/tree/rb/rbt-test.c

687

assert(RBT_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rbt-test.c

709

if (RBT_INSERT(tree, &root, tmp) != NULL)

regress/sys/sys/tree/rb/rbt-test.c

717

if (RBT_INSERT_PREV(tree, &root, ins, tmp) != NULL)

regress/sys/sys/tree/rb/rbt-test.c

722

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

735

RBT_FOREACH_REVERSE_SAFE(ins, tree, &root, tmp) {

regress/sys/sys/tree/rb/rbt-test.c

736

assert(RBT_REMOVE(tree, &root, ins) == ins);

regress/sys/sys/tree/rb/rbt-test.c

759

tmp = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

762

if (RBT_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rbt-test.c

781

tmp = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

784

if (RBT_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rbt-test.c

803

tmp = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

806

if (RBT_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rbt-test.c

827

tmp = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

830

if (RBT_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rbt-test.c

851

tmp = RBT_ROOT(tree, &root);

regress/sys/sys/tree/rb/rbt-test.c

854

if (RBT_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/rb/rbt-test.c

884

indent, "", n->key, n->size, RBT_RANK(tree, n),

regress/sys/sys/tree/rb/rbt-test.c

892

print_tree(const struct tree *t)

regress/sys/sys/tree/rb/rbt-test.c

894

if (RBT_ROOT(tree, t)) print_helper(RBT_ROOT(tree, t), 0);

regress/sys/sys/tree/rb/rbt-test.c

90

struct tree;

regress/sys/sys/tree/rb/rbt-test.c

940

if (RBT_INSERT(tree, &root, tmp) != NULL)

regress/sys/sys/tree/rb/rbt-test.c

945

assert(RBT_ROOT(tree, &root)->size == i + 1);

regress/sys/sys/tree/rb/rbt-test.c

950

rank = RBT_RANK(tree, RBT_ROOT(tree, &root));

regress/sys/sys/tree/rb/rbt-test.c

960

RBT_INSERT(tree, &root, tmp);

regress/sys/sys/tree/rb/rbt-test.c

964

ins = RBT_FIND(tree, &root, &it);

regress/sys/sys/tree/rb/rbt-test.c

970

ins = RBT_NFIND(tree, &root, &it);

regress/sys/sys/tree/splay/splay-test.c

100

if (SPLAY_REMOVE(tree, &root, tmp) != tmp)

regress/sys/sys/tree/splay/splay-test.c

40

SPLAY_HEAD(tree, node) root;

regress/sys/sys/tree/splay/splay-test.c

50

SPLAY_PROTOTYPE(tree, node, node, compare);

regress/sys/sys/tree/splay/splay-test.c

52

SPLAY_GENERATE(tree, node, node, compare);

regress/sys/sys/tree/splay/splay-test.c

72

} while (SPLAY_FIND(tree, &root, tmp) != NULL);

regress/sys/sys/tree/splay/splay-test.c

81

if (SPLAY_INSERT(tree, &root, tmp) != NULL)

regress/sys/sys/tree/splay/splay-test.c

85

ins = SPLAY_MIN(tree, &root);

regress/sys/sys/tree/splay/splay-test.c

89

ins = SPLAY_MAX(tree, &root);

regress/sys/sys/tree/splay/splay-test.c

93

if (SPLAY_REMOVE(tree, &root, tmp) != tmp)

sbin/unwind/libunbound/daemon/acl_list.h

85

rbtree_type tree;

sbin/unwind/libunbound/iterator/iter_donotq.c

126

addr_tree_init(&dq->tree);

sbin/unwind/libunbound/iterator/iter_donotq.c

137

addr_tree_init_parents(&dq->tree);

sbin/unwind/libunbound/iterator/iter_donotq.c

145

return addr_tree_lookup(&donotq->tree, addr, addrlen) != NULL;

sbin/unwind/libunbound/iterator/iter_donotq.c

84

if(!addr_tree_insert(&dq->tree, node, addr, addrlen, net)) {

sbin/unwind/libunbound/iterator/iter_donotq.h

61

rbtree_type tree;

sbin/unwind/libunbound/iterator/iter_fwd.c

131

if(!rbtree_insert(fwd->tree, &node->node)) {

sbin/unwind/libunbound/iterator/iter_fwd.c

150

return (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);

sbin/unwind/libunbound/iterator/iter_fwd.c

167

RBTREE_FOR(node, struct iter_forward_zone*, fwd->tree) {

sbin/unwind/libunbound/iterator/iter_fwd.c

382

if(fwd->tree) {

sbin/unwind/libunbound/iterator/iter_fwd.c

383

lock_unprotect(&fwd->lock, fwd->tree);

sbin/unwind/libunbound/iterator/iter_fwd.c

386

fwd->tree = rbtree_create(fwd_cmp);

sbin/unwind/libunbound/iterator/iter_fwd.c

387

if(!fwd->tree)

sbin/unwind/libunbound/iterator/iter_fwd.c

389

lock_protect(&fwd->lock, fwd->tree, sizeof(*fwd->tree));

sbin/unwind/libunbound/iterator/iter_fwd.c

429

res = (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);

sbin/unwind/libunbound/iterator/iter_fwd.c

450

if(rbtree_find_less_equal(fwd->tree, &key, &res)) {

sbin/unwind/libunbound/iterator/iter_fwd.c

492

n = rbtree_first(fwd->tree);

sbin/unwind/libunbound/iterator/iter_fwd.c

513

if(rbtree_find_less_equal(fwd->tree, &key, &n)) {

sbin/unwind/libunbound/iterator/iter_fwd.c

553

s = sizeof(*fwd) + sizeof(*fwd->tree);

sbin/unwind/libunbound/iterator/iter_fwd.c

554

RBTREE_FOR(p, struct iter_forward_zone*, fwd->tree) {

sbin/unwind/libunbound/iterator/iter_fwd.c

569

(void)rbtree_delete(fwd->tree, &z->node);

sbin/unwind/libunbound/iterator/iter_fwd.c

592

(void)rbtree_delete(fwd->tree, &z->node);

sbin/unwind/libunbound/iterator/iter_fwd.c

632

(void)rbtree_delete(fwd->tree, &z->node);

sbin/unwind/libunbound/iterator/iter_fwd.c

641

rbtree_type* oldtree = fwd->tree;

sbin/unwind/libunbound/iterator/iter_fwd.c

645

if(data->tree) {

sbin/unwind/libunbound/iterator/iter_fwd.c

646

lock_unprotect(&data->lock, data->tree);

sbin/unwind/libunbound/iterator/iter_fwd.c

648

fwd->tree = data->tree;

sbin/unwind/libunbound/iterator/iter_fwd.c

649

data->tree = oldtree;

sbin/unwind/libunbound/iterator/iter_fwd.c

650

lock_protect(&fwd->lock, fwd->tree, sizeof(*fwd->tree));

sbin/unwind/libunbound/iterator/iter_fwd.c

651

lock_protect(&data->lock, data->tree, sizeof(*data->tree));

sbin/unwind/libunbound/iterator/iter_fwd.c

94

if(fwd->tree)

sbin/unwind/libunbound/iterator/iter_fwd.c

95

traverse_postorder(fwd->tree, &delfwdnode, NULL);

sbin/unwind/libunbound/iterator/iter_fwd.c

96

free(fwd->tree);

sbin/unwind/libunbound/iterator/iter_fwd.h

66

rbtree_type* tree;

sbin/unwind/libunbound/iterator/iter_hints.c

182

if(!name_tree_insert(&hints->tree, &node->node, dp->name, dp->namelen,

sbin/unwind/libunbound/iterator/iter_hints.c

447

name_tree_init(&hints->tree);

sbin/unwind/libunbound/iterator/iter_hints.c

476

name_tree_init_parents(&hints->tree);

sbin/unwind/libunbound/iterator/iter_hints.c

491

stub = (struct iter_hints_stub*)name_tree_find(&hints->tree,

sbin/unwind/libunbound/iterator/iter_hints.c

517

r = (struct iter_hints_stub*)name_tree_lookup(&hints->tree, qname,

sbin/unwind/libunbound/iterator/iter_hints.c

554

ret = name_tree_next_root(&hints->tree, qclass);

sbin/unwind/libunbound/iterator/iter_hints.c

567

RBTREE_FOR(p, struct iter_hints_stub*, &hints->tree) {

sbin/unwind/libunbound/iterator/iter_hints.c

581

if((z=(struct iter_hints_stub*)name_tree_find(&hints->tree,

sbin/unwind/libunbound/iterator/iter_hints.c

583

(void)rbtree_delete(&hints->tree, &z->node);

sbin/unwind/libunbound/iterator/iter_hints.c

590

name_tree_init_parents(&hints->tree);

sbin/unwind/libunbound/iterator/iter_hints.c

604

if(!(z=(struct iter_hints_stub*)name_tree_find(&hints->tree,

sbin/unwind/libunbound/iterator/iter_hints.c

609

(void)rbtree_delete(&hints->tree, &z->node);

sbin/unwind/libunbound/iterator/iter_hints.c

61

lock_protect(&hints->lock, &hints->tree, sizeof(hints->tree));

sbin/unwind/libunbound/iterator/iter_hints.c

611

name_tree_init_parents(&hints->tree);

sbin/unwind/libunbound/iterator/iter_hints.c

618

rbnode_type* oldroot = hints->tree.root;

sbin/unwind/libunbound/iterator/iter_hints.c

619

size_t oldcount = hints->tree.count;

sbin/unwind/libunbound/iterator/iter_hints.c

620

hints->tree.root = data->tree.root;

sbin/unwind/libunbound/iterator/iter_hints.c

621

hints->tree.count = data->tree.count;

sbin/unwind/libunbound/iterator/iter_hints.c

622

data->tree.root = oldroot;

sbin/unwind/libunbound/iterator/iter_hints.c

623

data->tree.count = oldcount;

sbin/unwind/libunbound/iterator/iter_hints.c

80

traverse_postorder(&hints->tree, &delhintnode, NULL);

sbin/unwind/libunbound/iterator/iter_hints.h

67

rbtree_type tree;

sbin/unwind/libunbound/services/cache/infra.c

1278

rbtree_type* tree;

sbin/unwind/libunbound/services/cache/infra.c

1286

tree = &infra->wait_limits_cookie_netblock;

sbin/unwind/libunbound/services/cache/infra.c

1287

else tree = &infra->wait_limits_netblock;

sbin/unwind/libunbound/services/cache/infra.c

1288

w = (struct wait_limit_netblock_info*)addr_tree_lookup(tree,

sbin/unwind/libunbound/services/cache/infra.c

244

wait_limit_netblock_findcreate(struct rbtree_type* tree, char* str)

sbin/unwind/libunbound/services/cache/infra.c

257

d = (struct wait_limit_netblock_info*)addr_tree_find(tree, &addr,

sbin/unwind/libunbound/services/cache/infra.c

267

if(!addr_tree_insert(tree, &d->node, &addr, addrlen, net)) {

sbin/unwind/libunbound/services/cache/infra.c

302

wait_limit_netblock_default(struct rbtree_type* tree, char* str, int limit)

sbin/unwind/libunbound/services/cache/infra.c

305

d = wait_limit_netblock_findcreate(tree, str);

sbin/unwind/libunbound/util/data/msgencode.c

111

compress_tree_search(struct compress_tree_node** tree, uint8_t* dname,

sbin/unwind/libunbound/util/data/msgencode.c

116

struct compress_tree_node* p = *tree;

sbin/unwind/libunbound/util/data/msgencode.c

118

struct compress_tree_node** prev = tree;

sbin/unwind/libunbound/util/data/msgencode.c

151

compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname,

sbin/unwind/libunbound/util/data/msgencode.c

158

if(compress_tree_search(tree, dname, labs, &p, &m, insertpt)) {

sbin/unwind/libunbound/util/data/msgencode.c

292

struct regional* region, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

301

(p = compress_tree_lookup(tree, key->rk.dname,

sbin/unwind/libunbound/util/data/msgencode.c

345

struct regional* region, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

352

(p = compress_tree_lookup(tree, dname, labs, &insertpt))) {

sbin/unwind/libunbound/util/data/msgencode.c

380

struct regional* region, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

396

tree, compress_count)) != RETVAL_OK)

sbin/unwind/libunbound/util/data/msgencode.c

463

int do_data, int do_sig, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

493

if((r=compress_owner(key, pkt, region, tree,

sbin/unwind/libunbound/util/data/msgencode.c

505

data->rr_len[j], region, tree, c,

sbin/unwind/libunbound/util/data/msgencode.c

527

pkt, owner_labs, region, tree,

sbin/unwind/libunbound/util/data/msgencode.c

559

struct regional* region, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

576

pkt, num_rrs, timenow, region, 1, 1, tree,

sbin/unwind/libunbound/util/data/msgencode.c

589

pkt, num_rrs, timenow, region, 1, 0, tree,

sbin/unwind/libunbound/util/data/msgencode.c

600

pkt, num_rrs, timenow, region, 0, 1, tree,

sbin/unwind/libunbound/util/data/msgencode.c

613

insert_query(struct query_info* qinfo, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

625

sldns_buffer_position(buffer), region, NULL, tree))

sbin/unwind/libunbound/util/data/msgencode.c

691

struct compress_tree_node* tree = 0;

sbin/unwind/libunbound/util/data/msgencode.c

710

if((r=insert_query(qinfo, &tree, buffer, region)) !=

sbin/unwind/libunbound/util/data/msgencode.c

740

timezero, region, &tree, LDNS_SECTION_ANSWER,

sbin/unwind/libunbound/util/data/msgencode.c

755

0, timenow, region, &tree, LDNS_SECTION_ANSWER, qinfo->qtype,

sbin/unwind/libunbound/util/data/msgencode.c

772

rep->an_numrrsets, timenow, region, &tree,

sbin/unwind/libunbound/util/data/msgencode.c

790

&tree, LDNS_SECTION_ADDITIONAL, qinfo->qtype,

sbin/unwind/libunbound/util/edns.c

128

edns_string_addr_lookup(rbtree_type* tree, struct sockaddr_storage* addr,

sbin/unwind/libunbound/util/edns.c

131

return (struct edns_string_addr*)addr_tree_lookup(tree, addr, addrlen);

sbin/unwind/libunbound/util/edns.c

145

rbtree_type tree = edns_strings->client_strings;

sbin/unwind/libunbound/util/edns.c

152

data->client_strings = tree;

sbin/unwind/libunbound/util/edns.h

141

edns_string_addr_lookup(rbtree_type* tree, struct sockaddr_storage* addr,

sbin/unwind/libunbound/util/rbtree.c

622

traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),

sbin/unwind/libunbound/util/rbtree.c

625

traverse_post(func, arg, tree->root);

sbin/unwind/libunbound/util/rbtree.h

189

void traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),

sbin/unwind/libunbound/util/storage/dnstree.c

106

return rbtree_insert(tree, &node->node) != NULL;

sbin/unwind/libunbound/util/storage/dnstree.c

109

int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,

sbin/unwind/libunbound/util/storage/dnstree.c

117

return rbtree_insert(tree, &node->node) != NULL;

sbin/unwind/libunbound/util/storage/dnstree.c

147

void addr_tree_init_parents(rbtree_type* tree)

sbin/unwind/libunbound/util/storage/dnstree.c

150

(struct addr_tree_node*)rbtree_first(tree));

sbin/unwind/libunbound/util/storage/dnstree.c

153

void name_tree_init_parents(rbtree_type* tree)

sbin/unwind/libunbound/util/storage/dnstree.c

157

RBTREE_FOR(node, struct name_tree_node*, tree) {

sbin/unwind/libunbound/util/storage/dnstree.c

179

struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,

sbin/unwind/libunbound/util/storage/dnstree.c

188

return (struct name_tree_node*)rbtree_search(tree, &key);

sbin/unwind/libunbound/util/storage/dnstree.c

191

struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,

sbin/unwind/libunbound/util/storage/dnstree.c

202

if(rbtree_find_less_equal(tree, &key, &res)) {

sbin/unwind/libunbound/util/storage/dnstree.c

223

struct addr_tree_node* addr_tree_lookup(rbtree_type* tree,

sbin/unwind/libunbound/util/storage/dnstree.c

233

if(rbtree_find_less_equal(tree, &key, &res)) {

sbin/unwind/libunbound/util/storage/dnstree.c

254

struct addr_tree_node* addr_tree_find(rbtree_type* tree,

sbin/unwind/libunbound/util/storage/dnstree.c

263

res = rbtree_search(tree, &key);

sbin/unwind/libunbound/util/storage/dnstree.c

268

name_tree_next_root(rbtree_type* tree, uint16_t* dclass)

sbin/unwind/libunbound/util/storage/dnstree.c

275

n = rbtree_first(tree);

sbin/unwind/libunbound/util/storage/dnstree.c

285

return name_tree_next_root(tree, dclass);

sbin/unwind/libunbound/util/storage/dnstree.c

296

if(rbtree_find_less_equal(tree, &key, &n)) {

sbin/unwind/libunbound/util/storage/dnstree.c

313

return name_tree_next_root(tree, dclass);

sbin/unwind/libunbound/util/storage/dnstree.c

82

void name_tree_init(rbtree_type* tree)

sbin/unwind/libunbound/util/storage/dnstree.c

84

rbtree_init(tree, &name_tree_compare);

sbin/unwind/libunbound/util/storage/dnstree.c

87

void addr_tree_init(rbtree_type* tree)

sbin/unwind/libunbound/util/storage/dnstree.c

89

rbtree_init(tree, &addr_tree_compare);

sbin/unwind/libunbound/util/storage/dnstree.c

92

void addr_tree_addrport_init(rbtree_type* tree)

sbin/unwind/libunbound/util/storage/dnstree.c

94

rbtree_init(tree, &addr_tree_addrport_compare);

sbin/unwind/libunbound/util/storage/dnstree.c

97

int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,

sbin/unwind/libunbound/util/storage/dnstree.h

108

int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,

sbin/unwind/libunbound/util/storage/dnstree.h

116

void name_tree_init_parents(rbtree_type* tree);

sbin/unwind/libunbound/util/storage/dnstree.h

127

struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,

sbin/unwind/libunbound/util/storage/dnstree.h

139

struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,

sbin/unwind/libunbound/util/storage/dnstree.h

148

int name_tree_next_root(rbtree_type* tree, uint16_t* dclass);

sbin/unwind/libunbound/util/storage/dnstree.h

154

void addr_tree_init(rbtree_type* tree);

sbin/unwind/libunbound/util/storage/dnstree.h

161

void addr_tree_addrport_init(rbtree_type* tree);

sbin/unwind/libunbound/util/storage/dnstree.h

173

int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,

sbin/unwind/libunbound/util/storage/dnstree.h

181

void addr_tree_init_parents(rbtree_type* tree);

sbin/unwind/libunbound/util/storage/dnstree.h

197

struct addr_tree_node* addr_tree_lookup(rbtree_type* tree,

sbin/unwind/libunbound/util/storage/dnstree.h

208

struct addr_tree_node* addr_tree_find(rbtree_type* tree,

sbin/unwind/libunbound/util/storage/dnstree.h

94

void name_tree_init(rbtree_type* tree);

sbin/unwind/libunbound/util/tcp_conn_limit.c

147

addr_tree_init(&tcl->tree);

sbin/unwind/libunbound/util/tcp_conn_limit.c

150

addr_tree_init_parents(&tcl->tree);

sbin/unwind/libunbound/util/tcp_conn_limit.c

185

return (struct tcl_addr*)addr_tree_lookup(&tcl->tree,

sbin/unwind/libunbound/util/tcp_conn_limit.c

199

rbtree_type oldtree = tcl->tree;

sbin/unwind/libunbound/util/tcp_conn_limit.c

201

tcl->tree = data->tree;

sbin/unwind/libunbound/util/tcp_conn_limit.c

203

data->tree = oldtree;

sbin/unwind/libunbound/util/tcp_conn_limit.c

80

traverse_postorder(&tcl->tree, tcl_list_free_node, NULL);

sbin/unwind/libunbound/util/tcp_conn_limit.c

97

if(!addr_tree_insert(&tcl->tree, &node->node, addr, addrlen, net)) {

sbin/unwind/libunbound/util/tcp_conn_limit.h

60

rbtree_type tree;

sbin/unwind/libunbound/validator/autotrust.c

2093

tp2 = (struct trust_anchor*)rbtree_search(env->anchors->tree, &key);

sbin/unwind/libunbound/validator/autotrust.c

2150

del_tp = (struct trust_anchor*)rbtree_delete(env->anchors->tree, &key);

sbin/unwind/libunbound/validator/autotrust.c

2350

RBTREE_FOR(tp, struct trust_anchor*, anchors->tree) {

sbin/unwind/libunbound/validator/autotrust.c

355

if(!rbtree_insert(anchors->tree, &tp->node)) {

sbin/unwind/libunbound/validator/autotrust.c

367

(void)rbtree_delete(anchors->tree, tp);

sbin/unwind/libunbound/validator/val_anchor.c

1035

(void)rbtree_delete(anchors->tree, &ta->node);

sbin/unwind/libunbound/validator/val_anchor.c

1149

if(rbtree_find_less_equal(anchors->tree, &key, &res)) {

sbin/unwind/libunbound/validator/val_anchor.c

1202

RBTREE_FOR(ta, struct trust_anchor*, anchors->tree) {

sbin/unwind/libunbound/validator/val_anchor.c

1235

if(rbtree_search(anchors->tree, &key)) {

sbin/unwind/libunbound/validator/val_anchor.c

1262

if(!(ta=(struct trust_anchor*)rbtree_search(anchors->tree, &key))) {

sbin/unwind/libunbound/validator/val_anchor.c

1278

(void)rbtree_delete(anchors->tree, &ta->node);

sbin/unwind/libunbound/validator/val_anchor.c

1370

ta=(struct trust_anchor*)rbtree_first(anchors->tree);

sbin/unwind/libunbound/validator/val_anchor.c

1395

oldtree = anchors->tree;

sbin/unwind/libunbound/validator/val_anchor.c

1398

anchors->tree = data->tree;

sbin/unwind/libunbound/validator/val_anchor.c

1401

data->tree = oldtree;

sbin/unwind/libunbound/validator/val_anchor.c

147

if(anchors->tree)

sbin/unwind/libunbound/validator/val_anchor.c

148

traverse_postorder(anchors->tree, anchors_delfunc, NULL);

sbin/unwind/libunbound/validator/val_anchor.c

149

free(anchors->tree);

sbin/unwind/libunbound/validator/val_anchor.c

161

RBTREE_FOR(node, struct trust_anchor*, anchors->tree) {

sbin/unwind/libunbound/validator/val_anchor.c

209

n = rbtree_search(anchors->tree, &key);

sbin/unwind/libunbound/validator/val_anchor.c

250

rbtree_insert(anchors->tree, &ta->node);

sbin/unwind/libunbound/validator/val_anchor.c

81

a->tree = rbtree_create(anchor_cmp);

sbin/unwind/libunbound/validator/val_anchor.c

82

if(!a->tree) {

sbin/unwind/libunbound/validator/val_anchor.c

996

ta=(struct trust_anchor*)rbtree_first(anchors->tree);

sbin/unwind/libunbound/validator/val_anchor.h

69

rbtree_type* tree;

sbin/unwind/libunbound/validator/val_neg.c

1017

if(zone->tree.count == 0) {

sbin/unwind/libunbound/validator/val_neg.c

1228

if(!data && zone->tree.count != 0) {

sbin/unwind/libunbound/validator/val_neg.c

1231

data = (struct val_neg_data*)rbtree_last(&zone->tree);

sbin/unwind/libunbound/validator/val_neg.c

127

traverse_postorder(&z->tree, &neg_clear_datas, NULL);

sbin/unwind/libunbound/validator/val_neg.c

138

traverse_postorder(&neg->tree, &neg_clear_zones, NULL);

sbin/unwind/libunbound/validator/val_neg.c

217

(void)rbtree_delete(&neg->tree, &p->node);

sbin/unwind/libunbound/validator/val_neg.c

252

(void)rbtree_delete(&z->tree, &p->node);

sbin/unwind/libunbound/validator/val_neg.c

260

if(z->tree.count == 0) {

sbin/unwind/libunbound/validator/val_neg.c

292

rbtree_search(&neg->tree, lookfor.node.key);

sbin/unwind/libunbound/validator/val_neg.c

315

rbtree_search(&zone->tree, lookfor.node.key);

sbin/unwind/libunbound/validator/val_neg.c

381

if(rbtree_find_less_equal(&neg->tree, &key, &res)) {

sbin/unwind/libunbound/validator/val_neg.c

420

if(rbtree_find_less_equal(&zone->tree, &key, &res)) {

sbin/unwind/libunbound/validator/val_neg.c

467

rbtree_init(&zone->tree, &val_neg_data_compare);

sbin/unwind/libunbound/validator/val_neg.c

556

(void)rbtree_insert(&neg->tree, &p->node);

sbin/unwind/libunbound/validator/val_neg.c

794

(void)rbtree_insert(&zone->tree, &p->node);

sbin/unwind/libunbound/validator/val_neg.c

933

if(zone->tree.count == 0) {

sbin/unwind/libunbound/validator/val_neg.c

958

if(rbtree_find_less_equal(&zone->tree, &key, &r)) {

sbin/unwind/libunbound/validator/val_neg.c

97

rbtree_init(&neg->tree, &val_neg_zone_compare);

sbin/unwind/libunbound/validator/val_neg.h

123

rbtree_type tree;

sbin/unwind/libunbound/validator/val_neg.h

72

rbtree_type tree;

sbin/unwind/resolver.c

2152

find_force(struct force_tree *tree, char *qname, struct uw_resolver **res)

sbin/unwind/resolver.c

2159

if (RB_EMPTY(tree))

sbin/unwind/resolver.c

2166

n = RB_FIND(force_tree, tree, &e);

sys/arch/arm64/stand/efiboot/fdt.c

102

char *start = (char *)tree.header;

sys/arch/arm64/stand/efiboot/fdt.c

104

tree.header->fh_size = htobe32(tree.end - start);

sys/arch/arm64/stand/efiboot/fdt.c

105

tree.header->fh_struct_off = htobe32(tree.tree - start);

sys/arch/arm64/stand/efiboot/fdt.c

106

tree.header->fh_strings_off = htobe32(tree.strings - start);

sys/arch/arm64/stand/efiboot/fdt.c

107

tree.header->fh_reserve_off = htobe32(tree.memory - start);

sys/arch/arm64/stand/efiboot/fdt.c

108

tree.header->fh_strings_size = htobe32(tree.strings_size);

sys/arch/arm64/stand/efiboot/fdt.c

109

if (tree.version >= 17)

sys/arch/arm64/stand/efiboot/fdt.c

110

tree.header->fh_struct_size = htobe32(tree.struct_size);

sys/arch/arm64/stand/efiboot/fdt.c

134

if (num > tree.strings_size)

sys/arch/arm64/stand/efiboot/fdt.c

136

return (tree.strings) ? (tree.strings + num) : NULL;

sys/arch/arm64/stand/efiboot/fdt.c

143

char *end = tree.strings + tree.strings_size;

sys/arch/arm64/stand/efiboot/fdt.c

145

if (end + len > tree.end)

sys/arch/arm64/stand/efiboot/fdt.c

148

tree.strings_size += len;

sys/arch/arm64/stand/efiboot/fdt.c

152

return (end - tree.strings);

sys/arch/arm64/stand/efiboot/fdt.c

235

char *end = tree.strings + tree.strings_size;

sys/arch/arm64/stand/efiboot/fdt.c

260

if (end + delta > tree.end)

sys/arch/arm64/stand/efiboot/fdt.c

265

tree.struct_size += delta;

sys/arch/arm64/stand/efiboot/fdt.c

266

tree.strings += delta;

sys/arch/arm64/stand/efiboot/fdt.c

279

char *end = tree.strings + tree.strings_size;

sys/arch/arm64/stand/efiboot/fdt.c

291

if (end + 3 * sizeof(uint32_t) > tree.end)

sys/arch/arm64/stand/efiboot/fdt.c

297

tree.struct_size += 3 * sizeof(uint32_t);

sys/arch/arm64/stand/efiboot/fdt.c

298

tree.strings += 3 * sizeof(uint32_t);

sys/arch/arm64/stand/efiboot/fdt.c

311

char *end = tree.strings + tree.strings_size;

sys/arch/arm64/stand/efiboot/fdt.c

320

if (end + len > tree.end)

sys/arch/arm64/stand/efiboot/fdt.c

331

tree.struct_size += len;

sys/arch/arm64/stand/efiboot/fdt.c

332

tree.strings += len;

sys/arch/arm64/stand/efiboot/fdt.c

37

static struct fdt tree;

sys/arch/arm64/stand/efiboot/fdt.c

381

ptr = skip_nops((uint32_t *)tree.tree);

sys/arch/arm64/stand/efiboot/fdt.c

76

memset(&tree, 0, sizeof(struct fdt));

sys/arch/arm64/stand/efiboot/fdt.c

85

tree.header = (struct fdt_head *)fdt;

sys/arch/arm64/stand/efiboot/fdt.c

86

tree.tree = (char *)fdt + betoh32(tree.header->fh_struct_off);

sys/arch/arm64/stand/efiboot/fdt.c

87

tree.strings = (char *)fdt + betoh32(tree.header->fh_strings_off);

sys/arch/arm64/stand/efiboot/fdt.c

88

tree.memory = (char *)fdt + betoh32(tree.header->fh_reserve_off);

sys/arch/arm64/stand/efiboot/fdt.c

89

tree.end = (char *)fdt + betoh32(tree.header->fh_size);

sys/arch/arm64/stand/efiboot/fdt.c

90

tree.version = version;

sys/arch/arm64/stand/efiboot/fdt.c

91

tree.strings_size = betoh32(tree.header->fh_strings_size);

sys/arch/arm64/stand/efiboot/fdt.c

92

if (tree.version >= 17)

sys/arch/arm64/stand/efiboot/fdt.c

93

tree.struct_size = betoh32(tree.header->fh_struct_size);

sys/arch/arm64/stand/efiboot/fdt.h

34

char *tree;

sys/arch/armv7/stand/efiboot/fdt.c

102

char *start = (char *)tree.header;

sys/arch/armv7/stand/efiboot/fdt.c

104

tree.header->fh_size = htobe32(tree.end - start);

sys/arch/armv7/stand/efiboot/fdt.c

105

tree.header->fh_struct_off = htobe32(tree.tree - start);

sys/arch/armv7/stand/efiboot/fdt.c

106

tree.header->fh_strings_off = htobe32(tree.strings - start);

sys/arch/armv7/stand/efiboot/fdt.c

107

tree.header->fh_reserve_off = htobe32(tree.memory - start);

sys/arch/armv7/stand/efiboot/fdt.c

108

tree.header->fh_strings_size = htobe32(tree.strings_size);

sys/arch/armv7/stand/efiboot/fdt.c

109

if (tree.version >= 17)

sys/arch/armv7/stand/efiboot/fdt.c

110

tree.header->fh_struct_size = htobe32(tree.struct_size);

sys/arch/armv7/stand/efiboot/fdt.c

134

if (num > tree.strings_size)

sys/arch/armv7/stand/efiboot/fdt.c

136

return (tree.strings) ? (tree.strings + num) : NULL;

sys/arch/armv7/stand/efiboot/fdt.c

143

char *end = tree.strings + tree.strings_size;

sys/arch/armv7/stand/efiboot/fdt.c

145

if (end + len > tree.end)

sys/arch/armv7/stand/efiboot/fdt.c

148

tree.strings_size += len;

sys/arch/armv7/stand/efiboot/fdt.c

152

return (end - tree.strings);

sys/arch/armv7/stand/efiboot/fdt.c

235

char *end = tree.strings + tree.strings_size;

sys/arch/armv7/stand/efiboot/fdt.c

260

if (end + delta > tree.end)

sys/arch/armv7/stand/efiboot/fdt.c

265

tree.struct_size += delta;

sys/arch/armv7/stand/efiboot/fdt.c

266

tree.strings += delta;

sys/arch/armv7/stand/efiboot/fdt.c

279

char *end = tree.strings + tree.strings_size;

sys/arch/armv7/stand/efiboot/fdt.c

291

if (end + 3 * sizeof(uint32_t) > tree.end)

sys/arch/armv7/stand/efiboot/fdt.c

297

tree.struct_size += 3 * sizeof(uint32_t);

sys/arch/armv7/stand/efiboot/fdt.c

298

tree.strings += 3 * sizeof(uint32_t);

sys/arch/armv7/stand/efiboot/fdt.c

311

char *end = tree.strings + tree.strings_size;

sys/arch/armv7/stand/efiboot/fdt.c

320

if (end + len > tree.end)

sys/arch/armv7/stand/efiboot/fdt.c

331

tree.struct_size += len;

sys/arch/armv7/stand/efiboot/fdt.c

332

tree.strings += len;

sys/arch/armv7/stand/efiboot/fdt.c

37

static struct fdt tree;

sys/arch/armv7/stand/efiboot/fdt.c

381

ptr = skip_nops((uint32_t *)tree.tree);

sys/arch/armv7/stand/efiboot/fdt.c

76

memset(&tree, 0, sizeof(struct fdt));

sys/arch/armv7/stand/efiboot/fdt.c

85

tree.header = (struct fdt_head *)fdt;

sys/arch/armv7/stand/efiboot/fdt.c

86

tree.tree = (char *)fdt + betoh32(tree.header->fh_struct_off);

sys/arch/armv7/stand/efiboot/fdt.c

87

tree.strings = (char *)fdt + betoh32(tree.header->fh_strings_off);

sys/arch/armv7/stand/efiboot/fdt.c

88

tree.memory = (char *)fdt + betoh32(tree.header->fh_reserve_off);

sys/arch/armv7/stand/efiboot/fdt.c

89

tree.end = (char *)fdt + betoh32(tree.header->fh_size);

sys/arch/armv7/stand/efiboot/fdt.c

90

tree.version = version;

sys/arch/armv7/stand/efiboot/fdt.c

91

tree.strings_size = betoh32(tree.header->fh_strings_size);

sys/arch/armv7/stand/efiboot/fdt.c

92

if (tree.version >= 17)

sys/arch/armv7/stand/efiboot/fdt.c

93

tree.struct_size = betoh32(tree.header->fh_struct_size);

sys/arch/armv7/stand/efiboot/fdt.h

34

char *tree;

sys/arch/riscv64/stand/efiboot/fdt.c

102

char *start = (char *)tree.header;

sys/arch/riscv64/stand/efiboot/fdt.c

104

tree.header->fh_size = htobe32(tree.end - start);

sys/arch/riscv64/stand/efiboot/fdt.c

105

tree.header->fh_struct_off = htobe32(tree.tree - start);

sys/arch/riscv64/stand/efiboot/fdt.c

106

tree.header->fh_strings_off = htobe32(tree.strings - start);

sys/arch/riscv64/stand/efiboot/fdt.c

107

tree.header->fh_reserve_off = htobe32(tree.memory - start);

sys/arch/riscv64/stand/efiboot/fdt.c

108

tree.header->fh_strings_size = htobe32(tree.strings_size);

sys/arch/riscv64/stand/efiboot/fdt.c

109

if (tree.version >= 17)

sys/arch/riscv64/stand/efiboot/fdt.c

110

tree.header->fh_struct_size = htobe32(tree.struct_size);

sys/arch/riscv64/stand/efiboot/fdt.c

134

if (num > tree.strings_size)

sys/arch/riscv64/stand/efiboot/fdt.c

136

return (tree.strings) ? (tree.strings + num) : NULL;

sys/arch/riscv64/stand/efiboot/fdt.c

143

char *end = tree.strings + tree.strings_size;

sys/arch/riscv64/stand/efiboot/fdt.c

145

if (end + len > tree.end)

sys/arch/riscv64/stand/efiboot/fdt.c

148

tree.strings_size += len;

sys/arch/riscv64/stand/efiboot/fdt.c

152

return (end - tree.strings);

sys/arch/riscv64/stand/efiboot/fdt.c

235

char *end = tree.strings + tree.strings_size;

sys/arch/riscv64/stand/efiboot/fdt.c

260

if (end + delta > tree.end)

sys/arch/riscv64/stand/efiboot/fdt.c

265

tree.struct_size += delta;

sys/arch/riscv64/stand/efiboot/fdt.c

266

tree.strings += delta;

sys/arch/riscv64/stand/efiboot/fdt.c

279

char *end = tree.strings + tree.strings_size;

sys/arch/riscv64/stand/efiboot/fdt.c

291

if (end + 3 * sizeof(uint32_t) > tree.end)

sys/arch/riscv64/stand/efiboot/fdt.c

297

tree.struct_size += 3 * sizeof(uint32_t);

sys/arch/riscv64/stand/efiboot/fdt.c

298

tree.strings += 3 * sizeof(uint32_t);

sys/arch/riscv64/stand/efiboot/fdt.c

311

char *end = tree.strings + tree.strings_size;

sys/arch/riscv64/stand/efiboot/fdt.c

320

if (end + len > tree.end)

sys/arch/riscv64/stand/efiboot/fdt.c

331

tree.struct_size += len;

sys/arch/riscv64/stand/efiboot/fdt.c

332

tree.strings += len;

sys/arch/riscv64/stand/efiboot/fdt.c

37

static struct fdt tree;

sys/arch/riscv64/stand/efiboot/fdt.c

381

ptr = skip_nops((uint32_t *)tree.tree);

sys/arch/riscv64/stand/efiboot/fdt.c

76

memset(&tree, 0, sizeof(struct fdt));

sys/arch/riscv64/stand/efiboot/fdt.c

85

tree.header = (struct fdt_head *)fdt;

sys/arch/riscv64/stand/efiboot/fdt.c

86

tree.tree = (char *)fdt + betoh32(tree.header->fh_struct_off);

sys/arch/riscv64/stand/efiboot/fdt.c

87

tree.strings = (char *)fdt + betoh32(tree.header->fh_strings_off);

sys/arch/riscv64/stand/efiboot/fdt.c

88

tree.memory = (char *)fdt + betoh32(tree.header->fh_reserve_off);

sys/arch/riscv64/stand/efiboot/fdt.c

89

tree.end = (char *)fdt + betoh32(tree.header->fh_size);

sys/arch/riscv64/stand/efiboot/fdt.c

90

tree.version = version;

sys/arch/riscv64/stand/efiboot/fdt.c

91

tree.strings_size = betoh32(tree.header->fh_strings_size);

sys/arch/riscv64/stand/efiboot/fdt.c

92

if (tree.version >= 17)

sys/arch/riscv64/stand/efiboot/fdt.c

93

tree.struct_size = betoh32(tree.header->fh_struct_size);

sys/arch/riscv64/stand/efiboot/fdt.h

34

char *tree;

sys/dev/ofw/fdt.c

100

tree.struct_size = betoh32(tree.header->fh_struct_size);

sys/dev/ofw/fdt.c

1001

void *node = (char *)tree.header + handle;

sys/dev/ofw/fdt.c

1068

void *node = (char *)tree.header + handle;

sys/dev/ofw/fdt.c

1086

void *node = (char *)tree.header + handle;

sys/dev/ofw/fdt.c

109

char *start = (char *)tree.header;

sys/dev/ofw/fdt.c

111

tree.header->fh_size = htobe32(tree.end - start);

sys/dev/ofw/fdt.c

112

tree.header->fh_struct_off = htobe32(tree.tree - start);

sys/dev/ofw/fdt.c

113

tree.header->fh_strings_off = htobe32(tree.strings - start);

sys/dev/ofw/fdt.c

114

tree.header->fh_reserve_off = htobe32(tree.memory - start);

sys/dev/ofw/fdt.c

115

tree.header->fh_strings_size = htobe32(tree.strings_size);

sys/dev/ofw/fdt.c

116

if (tree.version >= 17)

sys/dev/ofw/fdt.c

117

tree.header->fh_struct_size = htobe32(tree.struct_size);

sys/dev/ofw/fdt.c

141

if (num > tree.strings_size)

sys/dev/ofw/fdt.c

143

return (tree.strings) ? (tree.strings + num) : NULL;

sys/dev/ofw/fdt.c

150

char *end = tree.strings + tree.strings_size;

sys/dev/ofw/fdt.c

152

memmove(end + len, end, tree.end - end);

sys/dev/ofw/fdt.c

153

tree.strings_size += len;

sys/dev/ofw/fdt.c

154

if (tree.tree > tree.strings)

sys/dev/ofw/fdt.c

155

tree.tree += len;

sys/dev/ofw/fdt.c

156

if (tree.memory > tree.strings)

sys/dev/ofw/fdt.c

157

tree.memory += len;

sys/dev/ofw/fdt.c

158

tree.end += len;

sys/dev/ofw/fdt.c

162

return (end - tree.strings);

sys/dev/ofw/fdt.c

270

tree.end - (char *)next);

sys/dev/ofw/fdt.c

271

tree.struct_size += delta;

sys/dev/ofw/fdt.c

272

if (tree.strings > tree.tree)

sys/dev/ofw/fdt.c

273

tree.strings += delta;

sys/dev/ofw/fdt.c

274

if (tree.memory > tree.tree)

sys/dev/ofw/fdt.c

275

tree.memory += delta;

sys/dev/ofw/fdt.c

276

tree.end += delta;

sys/dev/ofw/fdt.c

302

memmove(ptr + 3, ptr, tree.end - (char *)ptr);

sys/dev/ofw/fdt.c

303

tree.struct_size += 3 * sizeof(uint32_t);

sys/dev/ofw/fdt.c

304

if (tree.strings > tree.tree)

sys/dev/ofw/fdt.c

305

tree.strings += 3 * sizeof(uint32_t);

sys/dev/ofw/fdt.c

306

if (tree.memory > tree.tree)

sys/dev/ofw/fdt.c

307

tree.memory += 3 * sizeof(uint32_t);

sys/dev/ofw/fdt.c

308

tree.end += 3 * sizeof(uint32_t);

sys/dev/ofw/fdt.c

354

ptr = skip_nops((uint32_t *)tree.tree);

sys/dev/ofw/fdt.c

44

static struct fdt tree;

sys/dev/ofw/fdt.c

83

bzero(&tree, sizeof(struct fdt));

sys/dev/ofw/fdt.c

861

void *node = (char *)tree.header + handle;

sys/dev/ofw/fdt.c

867

return node ? ((char *)node - (char *)tree.header) : 0;

sys/dev/ofw/fdt.c

873

void *node = (char *)tree.header + handle;

sys/dev/ofw/fdt.c

876

return node ? ((char *)node - (char *)tree.header) : 0;

sys/dev/ofw/fdt.c

882

void *node = (char *)tree.header + handle;

sys/dev/ofw/fdt.c

885

return node ? ((char *)node - (char *)tree.header) : 0;

sys/dev/ofw/fdt.c

894

return node ? ((char *)node - (char *)tree.header) : -1;

sys/dev/ofw/fdt.c

900

void *node = (char *)tree.header + handle;

sys/dev/ofw/fdt.c

914

return (char *)child - (char *)tree.header;

sys/dev/ofw/fdt.c

92

tree.header = (struct fdt_head *)fdt;

sys/dev/ofw/fdt.c

925

return (char *)child - (char *)tree.header;

sys/dev/ofw/fdt.c

93

tree.tree = (char *)fdt + betoh32(tree.header->fh_struct_off);

sys/dev/ofw/fdt.c

936

return node ? ((char *)node - (char *)tree.header) : 0;

sys/dev/ofw/fdt.c

94

tree.strings = (char *)fdt + betoh32(tree.header->fh_strings_off);

sys/dev/ofw/fdt.c

942

void *node = (char *)tree.header + handle;

sys/dev/ofw/fdt.c

95

tree.memory = (char *)fdt + betoh32(tree.header->fh_reserve_off);

sys/dev/ofw/fdt.c

96

tree.end = (char *)fdt + betoh32(tree.header->fh_size);

sys/dev/ofw/fdt.c

969

void *node = (char *)tree.header + handle;

sys/dev/ofw/fdt.c

97

tree.version = version;

sys/dev/ofw/fdt.c

98

tree.strings_size = betoh32(tree.header->fh_strings_size);

sys/dev/ofw/fdt.c

99

if (tree.version >= 17)

sys/dev/ofw/fdt.h

34

char *tree;

sys/dev/pci/drm/amd/display/dc/inc/hw/mpc.h

401

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/inc/hw/mpc.h

425

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/inc/hw/mpc.h

522

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/inc/hw/mpc.h

546

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/inc/hw/mpc.h

564

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/inc/hw/mpc.h

582

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/inc/hw/mpc.h

631

struct mpc_tree *tree);

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

127

struct mpcc *mpc1_get_mpcc_for_dpp(struct mpc_tree *tree, int dpp_id)

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

129

struct mpcc *tmp_mpcc = tree->opp_list;

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

181

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

197

struct mpcc *temp_mpcc = tree->opp_list;

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

221

REG_SET(MPCC_OPP_ID[mpcc_id], 0, MPCC_OPP_ID, tree->opp_id);

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

224

REG_SET(MPCC_UPDATE_LOCK_SEL[mpcc_id], 0, MPCC_UPDATE_LOCK_SEL, tree->opp_id);

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

227

if (tree->opp_list == insert_above_mpcc) {

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

229

tree->opp_list = new_mpcc;

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

230

REG_UPDATE(MUX[tree->opp_id], MPC_OUT_MUX, mpcc_id);

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

233

struct mpcc *temp_mpcc = tree->opp_list;

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

273

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

280

if (tree->opp_list == mpcc_to_remove) {

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

285

tree->opp_list = mpcc_to_remove->mpcc_bot;

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

286

REG_UPDATE(MUX[tree->opp_id], MPC_OUT_MUX, tree->opp_list->mpcc_id);

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

289

tree->opp_list = NULL;

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

290

REG_UPDATE(MUX[tree->opp_id], MPC_OUT_MUX, 0xf);

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

294

struct mpcc *temp_mpcc = tree->opp_list;

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

398

struct mpc_tree *tree)

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

409

REG_GET(MUX[tree->opp_id], MPC_OUT_MUX, &out_mux);

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

420

if ((opp_id == tree->opp_id) && (top_sel != 0xf)) {

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

426

tree->opp_list = mpcc;

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.c

431

if ((opp_id == tree->opp_id) && (top_sel != 0xf)) {

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.h

143

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.h

152

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.h

182

struct mpc_tree *tree);

sys/dev/pci/drm/amd/display/dc/mpc/dcn10/dcn10_mpc.h

189

struct mpc_tree *tree,

sys/dev/pci/drm/amd/display/dc/mpc/dcn20/dcn20_mpc.c

525

static struct mpcc *mpc2_get_mpcc_for_dpp(struct mpc_tree *tree, int dpp_id)

sys/dev/pci/drm/amd/display/dc/mpc/dcn20/dcn20_mpc.c

527

struct mpcc *tmp_mpcc = tree->opp_list;

sys/dev/pci/drm/drm_buddy.c

104

enum drm_buddy_free_tree tree)

sys/dev/pci/drm/drm_buddy.c

107

&mm->free_trees[tree][drm_buddy_block_order(block)],

sys/dev/pci/drm/drm_buddy.c

115

enum drm_buddy_free_tree tree;

sys/dev/pci/drm/drm_buddy.c

118

tree = get_block_tree(block);

sys/dev/pci/drm/drm_buddy.c

119

root = &mm->free_trees[tree][order];

sys/dev/pci/drm/drm_buddy.c

1303

unsigned int tree;

sys/dev/pci/drm/drm_buddy.c

1305

for_each_free_tree(tree) {

sys/dev/pci/drm/drm_buddy.c

1306

root = &mm->free_trees[tree][order];

sys/dev/pci/drm/drm_buddy.c

147

enum drm_buddy_free_tree tree;

sys/dev/pci/drm/drm_buddy.c

152

tree = get_block_tree(block);

sys/dev/pci/drm/drm_buddy.c

153

rbtree_insert(mm, block, tree);

sys/dev/pci/drm/drm_buddy.c

239

unsigned int tree, order;

sys/dev/pci/drm/drm_buddy.c

248

for_each_free_tree(tree) {

sys/dev/pci/drm/drm_buddy.c

25

#define for_each_free_tree(tree) \

sys/dev/pci/drm/drm_buddy.c

250

struct rb_node *iter = rb_last(&mm->free_trees[tree][i]);

sys/dev/pci/drm/drm_buddy.c

26

for ((tree) = 0; (tree) < DRM_BUDDY_MAX_FREE_TREES; (tree)++)

sys/dev/pci/drm/drm_buddy.c

723

enum drm_buddy_free_tree tree)

sys/dev/pci/drm/drm_buddy.c

730

root = &mm->free_trees[tree][i];

sys/dev/pci/drm/drm_buddy.c

756

enum drm_buddy_free_tree tree;

sys/dev/pci/drm/drm_buddy.c

760

tree = (flags & DRM_BUDDY_CLEAR_ALLOCATION) ?

sys/dev/pci/drm/drm_buddy.c

764

block = get_maxblock(mm, order, tree);

sys/dev/pci/drm/drm_buddy.c

771

root = &mm->free_trees[tree][tmp];

sys/dev/pci/drm/drm_buddy.c

780

tree = (tree == DRM_BUDDY_CLEAR_TREE) ?

sys/dev/pci/drm/drm_buddy.c

784

root = &mm->free_trees[tree][tmp];

sys/dev/pci/drm/drm_buddy.c

930

unsigned int tree, order;

sys/dev/pci/drm/drm_buddy.c

942

for_each_free_tree(tree) {

sys/dev/pci/drm/drm_buddy.c

946

root = &mm->free_trees[tree][order];

sys/dev/pci/drm/drm_gpuvm.c

1075

gpuvm->rb.tree = RB_ROOT_CACHED;

sys/dev/pci/drm/drm_gpuvm.c

1118

drm_WARN(gpuvm->drm, !RB_EMPTY_ROOT(&gpuvm->rb.tree.rb_root),

sys/dev/pci/drm/drm_gpuvm.c

1794

if (drm_gpuva_it_iter_first(&gpuvm->rb.tree,

sys/dev/pci/drm/drm_gpuvm.c

1801

drm_gpuva_it_insert(va, &gpuvm->rb.tree);

sys/dev/pci/drm/drm_gpuvm.c

1855

drm_gpuva_it_remove(va, &va->vm->rb.tree);

sys/dev/pci/drm/drm_gpuvm.c

1965

return drm_gpuva_it_iter_first(&gpuvm->rb.tree, addr, last);

sys/dev/pci/drm/drm_gpuvm.c

2016

return drm_gpuva_it_iter_first(&gpuvm->rb.tree, start - 1, start);

sys/dev/pci/drm/drm_gpuvm.c

2038

return drm_gpuva_it_iter_first(&gpuvm->rb.tree, end, end + 1);

sys/dev/pci/drm/drm_linux.c

812

SPLAY_INIT(&idr->tree);

sys/dev/pci/drm/drm_linux.c

821

while ((id = SPLAY_MIN(idr_tree, &idr->tree))) {

sys/dev/pci/drm/drm_linux.c

822

SPLAY_REMOVE(idr_tree, &idr->tree, id);

sys/dev/pci/drm/drm_linux.c

860

while (SPLAY_INSERT(idr_tree, &idr->tree, id)) {

sys/dev/pci/drm/drm_linux.c

893

while (SPLAY_INSERT(idr_tree, &idr->tree, id)) {

sys/dev/pci/drm/drm_linux.c

916

res = SPLAY_FIND(idr_tree, &idr->tree, &find);

sys/dev/pci/drm/drm_linux.c

931

res = SPLAY_FIND(idr_tree, &idr->tree, &find);

sys/dev/pci/drm/drm_linux.c

933

SPLAY_REMOVE(idr_tree, &idr->tree, res);

sys/dev/pci/drm/drm_linux.c

946

res = SPLAY_FIND(idr_tree, &idr->tree, &find);

sys/dev/pci/drm/drm_linux.c

957

SPLAY_FOREACH(res, idr_tree, &idr->tree) {

sys/dev/pci/drm/drm_linux.c

973

SPLAY_FOREACH(id, idr_tree, &idr->tree) {

sys/dev/pci/drm/i915/gem/i915_gem_object_types.h

282

struct rb_root tree;

sys/dev/pci/drm/i915/i915_active.c

143

ref->cache = fetch_node(ref->tree.rb_node);

sys/dev/pci/drm/i915/i915_active.c

148

rb_erase(&ref->cache->node, &ref->tree);

sys/dev/pci/drm/i915/i915_active.c

149

root = ref->tree;

sys/dev/pci/drm/i915/i915_active.c

152

rb_link_node(&ref->cache->node, NULL, &ref->tree.rb_node);

sys/dev/pci/drm/i915/i915_active.c

153

rb_insert_color(&ref->cache->node, &ref->tree);

sys/dev/pci/drm/i915/i915_active.c

154

GEM_BUG_ON(ref->tree.rb_node != &ref->cache->node);

sys/dev/pci/drm/i915/i915_active.c

275

it = fetch_node(ref->tree.rb_node);

sys/dev/pci/drm/i915/i915_active.c

305

p = &ref->tree.rb_node;

sys/dev/pci/drm/i915/i915_active.c

336

rb_insert_color(&node->node, &ref->tree);

sys/dev/pci/drm/i915/i915_active.c

359

ref->tree = RB_ROOT;

sys/dev/pci/drm/i915/i915_active.c

583

rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) {

sys/dev/pci/drm/i915/i915_active.c

704

rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) {

sys/dev/pci/drm/i915/i915_active.c

775

if (RB_EMPTY_ROOT(&ref->tree))

sys/dev/pci/drm/i915/i915_active.c

793

p = ref->tree.rb_node;

sys/dev/pci/drm/i915/i915_active.c

846

rb_erase(p, &ref->tree); /* Hide from waits and sibling allocations */

sys/dev/pci/drm/i915/i915_active.c

965

p = &ref->tree.rb_node;

sys/dev/pci/drm/i915/i915_active.c

978

rb_insert_color(&node->node, &ref->tree);

sys/dev/pci/drm/i915/i915_active_types.h

31

struct rb_root tree;

sys/dev/pci/drm/i915/i915_gem.c

895

rb_erase(&vma->obj_node, &obj->vma.tree);

sys/dev/pci/drm/i915/i915_vma.c

1810

rb_erase(&vma->obj_node, &obj->vma.tree);

sys/dev/pci/drm/i915/i915_vma.c

246

p = &obj->vma.tree.rb_node;

sys/dev/pci/drm/i915/i915_vma.c

267

rb_insert_color(&vma->obj_node, &obj->vma.tree);

sys/dev/pci/drm/i915/i915_vma.c

301

rb = obj->vma.tree.rb_node;

sys/dev/pci/drm/i915/selftests/i915_active.c

289

rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) {

sys/dev/pci/drm/i915/selftests/i915_active.c

340

rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node)

sys/dev/pci/drm/include/drm/drm_gpuvm.h

260

struct rb_root_cached tree;

sys/dev/pci/drm/include/linux/idr.h

33

SPLAY_HEAD(idr_tree, idr_entry) tree;

sys/dev/pci/drm/include/linux/idr.h

39

.tree = SPLAY_INITIALIZER(&name.idr.tree), \

sys/dev/pci/drm/include/linux/idr.h

71

return SPLAY_EMPTY(&idr->tree);

sys/dev/pci/drm/include/linux/idr.h

80

.idr = { SPLAY_INITIALIZER(&name.idr.tree) } \

sys/kern/vfs_cache.c

87

cache_tree_init(struct namecache_rb_cache *tree)

sys/kern/vfs_cache.c

89

RBT_INIT(namecache_rb_cache, tree);

sys/lib/libz/trees.c

201

local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {

sys/lib/libz/trees.c

222

int len = tree[n].Len;

sys/lib/libz/trees.c

225

tree[n].Code = (ush)bi_reverse(next_code[len]++, len);

sys/lib/libz/trees.c

227

Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",

sys/lib/libz/trees.c

228

n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));

sys/lib/libz/trees.c

237

# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)

sys/lib/libz/trees.c

241

# define send_code(s, c, tree) \

sys/lib/libz/trees.c

243

send_bits(s, tree[c].Code, tree[c].Len); }

sys/lib/libz/trees.c

486

#define pqremove(s, tree, top) \

sys/lib/libz/trees.c

490

pqdownheap(s, tree, SMALLEST); \

sys/lib/libz/trees.c

497

#define smaller(tree, n, m, depth) \

sys/lib/libz/trees.c

498

(tree[n].Freq < tree[m].Freq || \

sys/lib/libz/trees.c

499

(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))

sys/lib/libz/trees.c

507

local void pqdownheap(deflate_state *s, ct_data *tree, int k) {

sys/lib/libz/trees.c

513

smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) {

sys/lib/libz/trees.c

517

if (smaller(tree, v, s->heap[j], s->depth)) break;

sys/lib/libz/trees.c

539

ct_data *tree = desc->dyn_tree;

sys/lib/libz/trees.c

557

tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */

sys/lib/libz/trees.c

561

bits = tree[tree[n].Dad].Len + 1;

sys/lib/libz/trees.c

563

tree[n].Len = (ush)bits;

sys/lib/libz/trees.c

571

f = tree[n].Freq;

sys/lib/libz/trees.c

603

if ((unsigned) tree[m].Len != (unsigned) bits) {

sys/lib/libz/trees.c

604

Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

sys/lib/libz/trees.c

605

s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;

sys/lib/libz/trees.c

606

tree[m].Len = (ush)bits;

sys/lib/libz/trees.c

626

ct_data *tree = desc->dyn_tree;

sys/lib/libz/trees.c

640

if (tree[n].Freq != 0) {

sys/lib/libz/trees.c

644

tree[n].Len = 0;

sys/lib/libz/trees.c

655

tree[node].Freq = 1;

sys/lib/libz/trees.c

665

for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

sys/lib/libz/trees.c

672

pqremove(s, tree, n); /* n = node of least frequency */

sys/lib/libz/trees.c

679

tree[node].Freq = tree[n].Freq + tree[m].Freq;

sys/lib/libz/trees.c

682

tree[n].Dad = tree[m].Dad = (ush)node;

sys/lib/libz/trees.c

684

if (tree == s->bl_tree) {

sys/lib/libz/trees.c

686

node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);

sys/lib/libz/trees.c

691

pqdownheap(s, tree, SMALLEST);

sys/lib/libz/trees.c

703

gen_codes ((ct_data *)tree, max_code, s->bl_count);

sys/lib/libz/trees.c

710

local void scan_tree(deflate_state *s, ct_data *tree, int max_code) {

sys/lib/libz/trees.c

714

int nextlen = tree[0].Len; /* length of next code */

sys/lib/libz/trees.c

720

tree[max_code + 1].Len = (ush)0xffff; /* guard */

sys/lib/libz/trees.c

723

curlen = nextlen; nextlen = tree[n + 1].Len;

sys/lib/libz/trees.c

751

local void send_tree(deflate_state *s, ct_data *tree, int max_code) {

sys/lib/libz/trees.c

755

int nextlen = tree[0].Len; /* length of next code */

sys/lib/libz/trees.c

764

curlen = nextlen; nextlen = tree[n + 1].Len;

sys/net/pf_ioctl.c

1404

pf_statelim_rb_find(struct pf_statelim_id_tree *tree,

sys/net/pf_ioctl.c

1407

return (RBT_FIND(pf_statelim_id_tree, tree, key));

sys/net/pf_ioctl.c

1411

pf_statelim_rb_nfind(struct pf_statelim_id_tree *tree,

sys/net/pf_ioctl.c

1414

return (RBT_NFIND(pf_statelim_id_tree, tree, key));

sys/net/pf_ioctl.c

1623

pf_sourcelim_rb_find(struct pf_sourcelim_id_tree *tree,

sys/net/pf_ioctl.c

1626

return (RBT_FIND(pf_sourcelim_id_tree, tree, key));

sys/net/pf_ioctl.c

1630

pf_sourcelim_rb_nfind(struct pf_sourcelim_id_tree *tree,

sys/net/pf_ioctl.c

1633

return (RBT_NFIND(pf_sourcelim_id_tree, tree, key));

sys/net/pf_ioctl.c

1692

pf_source_rb_find(struct pf_source_ioc_tree *tree,

sys/net/pf_ioctl.c

1695

return (RBT_FIND(pf_source_ioc_tree, tree, key));

sys/net/pf_ioctl.c

1699

pf_source_rb_nfind(struct pf_source_ioc_tree *tree,

sys/net/pf_ioctl.c

1702

return (RBT_NFIND(pf_source_ioc_tree, tree, key));

usr.bin/bc/bc.y

748

struct tree *p;

usr.bin/bc/bc.y

92

static struct tree *instructions = NULL;

usr.bin/file/magic-dump.c

55

RB_FOREACH(ml, magic_tree, &m->tree)

usr.bin/file/magic-load.c

1081

RB_INIT(&m->tree);

usr.bin/file/magic-load.c

1164

RB_INSERT(magic_tree, &m->tree, ml);

usr.bin/file/magic-test.c

1398

RB_FOREACH(ml, magic_tree, &m->tree) {

usr.bin/file/magic.h

152

struct magic_tree tree;

usr.bin/find/find.c

140

FTS *tree; /* pointer to top of FTS hierarchy */

usr.bin/find/find.c

179

if (!(tree = fts_open(paths, ftsoptions, NULL)))

usr.bin/find/find.c

185

entry = fts_read(tree);

usr.bin/find/find.c

226

(void)fts_close(tree);

usr.bin/find/function.c

1055

fts_set(tree, entry, FTS_SKIP);

usr.bin/find/function.c

115

extern FTS *tree;

usr.bin/find/function.c

1442

if (fts_set(tree, entry, FTS_SKIP))

usr.bin/ssh/sftp-usergroup.c

64

idname_enter(struct idname_tree *tree, u_int id, const char *name)

usr.bin/ssh/sftp-usergroup.c

72

if (RB_INSERT(idname_tree, tree, idname) != NULL)

usr.bin/ssh/sftp-usergroup.c

77

idname_lookup(struct idname_tree *tree, u_int id)

usr.bin/ssh/sftp-usergroup.c

83

if ((found = RB_FIND(idname_tree, tree, &idname)) != NULL)

usr.bin/tmux/arguments.c

141

RB_INIT(&args->tree);

usr.bin/tmux/arguments.c

375

RB_FOREACH(entry, args_tree, &args->tree) {

usr.bin/tmux/arguments.c

437

RB_FOREACH_SAFE(entry, args_tree, &args->tree, entry1) {

usr.bin/tmux/arguments.c

438

RB_REMOVE(args_tree, &args->tree, entry);

usr.bin/tmux/arguments.c

49

struct args_tree tree;

usr.bin/tmux/arguments.c

549

RB_FOREACH(entry, args_tree, &args->tree) {

usr.bin/tmux/arguments.c

562

RB_FOREACH(entry, args_tree, &args->tree) {

usr.bin/tmux/arguments.c

664

RB_INSERT(args_tree, &args->tree, entry);

usr.bin/tmux/arguments.c

690

*entry = RB_MIN(args_tree, &args->tree);

usr.bin/tmux/arguments.c

700

*entry = RB_NEXT(args_tree, &args->tree, *entry);

usr.bin/tmux/arguments.c

80

return (RB_FIND(args_tree, &args->tree, &entry));

usr.bin/tmux/file.c

101

cf->tree = files;

usr.bin/tmux/file.c

131

cf->tree = &cf->c->files;

usr.bin/tmux/file.c

149

if (cf->tree != NULL)

usr.bin/tmux/file.c

150

RB_REMOVE(client_files, cf->tree, cf);

usr.bin/tmux/file.c

561

RB_REMOVE(client_files, cf->tree, cf);

usr.bin/tmux/file.c

691

RB_REMOVE(client_files, cf->tree, cf);

usr.bin/tmux/format.c

160

RB_HEAD(format_entry_tree, format_entry) tree;

usr.bin/tmux/format.c

3720

RB_FOREACH(fe, format_entry_tree, &from->tree) {

usr.bin/tmux/format.c

3751

RB_INIT(&ft->tree);

usr.bin/tmux/format.c

3774

RB_FOREACH_SAFE(fe, format_entry_tree, &ft->tree, fe1) {

usr.bin/tmux/format.c

3775

RB_REMOVE(format_entry_tree, &ft->tree, fe);

usr.bin/tmux/format.c

3829

RB_FOREACH(fe, format_entry_tree, &ft->tree) {

usr.bin/tmux/format.c

3855

fe_now = RB_INSERT(format_entry_tree, &ft->tree, fe);

usr.bin/tmux/format.c

3880

fe_now = RB_INSERT(format_entry_tree, &ft->tree, fe);

usr.bin/tmux/format.c

3904

fe_now = RB_INSERT(format_entry_tree, &ft->tree, fe);

usr.bin/tmux/format.c

4038

fe = RB_FIND(format_entry_tree, &ft->tree, &fe_find);

usr.bin/tmux/hyperlinks.c

118

struct hyperlinks *hl = hlu->tree;

usr.bin/tmux/hyperlinks.c

169

hlu->tree = hl;

usr.bin/tmux/hyperlinks.c

50

struct hyperlinks *tree;

usr.bin/tmux/options.c

176

RB_INIT(&oo->tree);

usr.bin/tmux/options.c

186

RB_FOREACH_SAFE(o, options_tree, &oo->tree, tmp)

usr.bin/tmux/options.c

206

return (RB_MIN(options_tree, &oo->tree));

usr.bin/tmux/options.c

212

return (RB_NEXT(options_tree, &oo->tree, o));

usr.bin/tmux/options.c

220

found = RB_FIND(options_tree, &oo->tree, &o);

usr.bin/tmux/options.c

223

return (RB_FIND(options_tree, &oo->tree, &o));

usr.bin/tmux/options.c

344

RB_INSERT(options_tree, &oo->tree, o);

usr.bin/tmux/options.c

357

RB_REMOVE(options_tree, &oo->tree, o);

usr.bin/tmux/options.c

64

RB_HEAD(options_tree, options_entry) tree;

usr.sbin/bgpd/rde.h

60

struct rib_tree tree;

usr.sbin/bgpd/rde_rib.c

42

struct rib flowrib = { .id = 1, .tree = RB_INITIALIZER(&flowrib.tree) };

usr.sbin/bgpd/rde_rib.c

90

return (&rib->tree);

usr.sbin/dhcpd/bootp.c

273

netmask_tree.tree = NULL;

usr.sbin/dhcpd/confpars.c

1000

struct tree *t;

usr.sbin/dhcpd/confpars.c

1100

tree = tree_concat(tree,

usr.sbin/dhcpd/confpars.c

1111

tree = tree_concat(tree,

usr.sbin/dhcpd/confpars.c

1131

tree = tree_concat(tree,

usr.sbin/dhcpd/confpars.c

1140

tree = tree_concat(tree, t);

usr.sbin/dhcpd/confpars.c

1154

tree = tree_concat(tree, tree_const(buf, 4));

usr.sbin/dhcpd/confpars.c

1167

tree = tree_concat(tree, tree_const(buf, 2));

usr.sbin/dhcpd/confpars.c

1180

tree = tree_concat(tree, tree_const(buf, 1));

usr.sbin/dhcpd/confpars.c

1202

tree = tree_concat(tree, tree_const(buf, 1));

usr.sbin/dhcpd/confpars.c

1207

tree = tree_concat(tree, tree_const(&cprefix,

usr.sbin/dhcpd/confpars.c

1210

tree = tree_concat(tree, tree_const(

usr.sbin/dhcpd/confpars.c

1217

tree = tree_concat(tree, t);

usr.sbin/dhcpd/confpars.c

1242

group->options[option->code] = tree_cache(tree);

usr.sbin/dhcpd/confpars.c

1502

struct tree *

usr.sbin/dhcpd/confpars.c

1505

struct tree *rv = NULL;

usr.sbin/dhcpd/confpars.c

199

struct tree *tree;

usr.sbin/dhcpd/confpars.c

365

tree = parse_ip_addr_or_hostname(cfile, 0);

usr.sbin/dhcpd/confpars.c

366

if (!tree)

usr.sbin/dhcpd/confpars.c

368

cache = tree_cache(tree);

usr.sbin/dhcpd/confpars.c

382

tree = parse_ip_addr_or_hostname(cfile, 0);

usr.sbin/dhcpd/confpars.c

383

if (!tree)

usr.sbin/dhcpd/confpars.c

385

group->options[DHO_DHCP_SERVER_IDENTIFIER] = tree_cache(tree);

usr.sbin/dhcpd/confpars.c

587

host->group->options[DHO_HOST_NAME]->tree =

usr.sbin/dhcpd/confpars.c

903

struct tree *

usr.sbin/dhcpd/confpars.c

911

struct tree *rv;

usr.sbin/dhcpd/confpars.c

961

struct tree *tree = NULL;

usr.sbin/dhcpd/confpars.c

962

struct tree *tmp;

usr.sbin/dhcpd/confpars.c

966

if (tree)

usr.sbin/dhcpd/confpars.c

967

tree = tree_concat(tree, tmp);

usr.sbin/dhcpd/confpars.c

969

tree = tmp;

usr.sbin/dhcpd/confpars.c

977

return tree_cache(tree);

usr.sbin/dhcpd/confpars.c

999

struct tree *tree = NULL;

usr.sbin/dhcpd/dhcp.c

1055

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1070

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1082

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1123

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1137

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1161

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1174

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1188

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1201

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1231

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

1258

state->options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

600

options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

610

options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

623

options[i]->tree = NULL;

usr.sbin/dhcpd/dhcp.c

635

options[i]->tree = NULL;

usr.sbin/dhcpd/dhcpd.h

359

struct tree *parse_ip_addr_or_hostname(FILE *, int);

usr.sbin/dhcpd/dhcpd.h

368

struct tree *parse_domain_and_comp(FILE *);

usr.sbin/dhcpd/dhcpd.h

372

struct tree_cache *tree_cache(struct tree *);

usr.sbin/dhcpd/dhcpd.h

373

struct tree *tree_const(unsigned char *, int);

usr.sbin/dhcpd/dhcpd.h

374

struct tree *tree_concat(struct tree *, struct tree *);

usr.sbin/dhcpd/dhcpd.h

375

struct tree *tree_limit(struct tree *, int);

usr.sbin/dhcpd/tree.c

111

struct tree *

usr.sbin/dhcpd/tree.c

112

tree_concat(struct tree *left, struct tree *right)

usr.sbin/dhcpd/tree.c

114

struct tree *nt;

usr.sbin/dhcpd/tree.c

148

nt = calloc(1, sizeof(struct tree));

usr.sbin/dhcpd/tree.c

157

struct tree *

usr.sbin/dhcpd/tree.c

158

tree_limit(struct tree *tree, int limit)

usr.sbin/dhcpd/tree.c

160

struct tree *rv;

usr.sbin/dhcpd/tree.c

163

if (tree->op == TREE_CONST) {

usr.sbin/dhcpd/tree.c

164

if (tree->data.const_val.len > limit)

usr.sbin/dhcpd/tree.c

165

tree->data.const_val.len = limit;

usr.sbin/dhcpd/tree.c

166

return tree;

usr.sbin/dhcpd/tree.c

170

rv = calloc(1, sizeof(struct tree));

usr.sbin/dhcpd/tree.c

176

rv->data.limit.tree = tree;

usr.sbin/dhcpd/tree.c

192

if (!tree_cache->tree)

usr.sbin/dhcpd/tree.c

197

tree_cache->tree);

usr.sbin/dhcpd/tree.c

224

tree_evaluate_recurse(&bufix, &bp, &bc, tree_cache->tree);

usr.sbin/dhcpd/tree.c

239

int *bufcount, struct tree *tree)

usr.sbin/dhcpd/tree.c

244

switch (tree->op) {

usr.sbin/dhcpd/tree.c

247

tree->data.concat.left);

usr.sbin/dhcpd/tree.c

249

tree->data.concat.right);

usr.sbin/dhcpd/tree.c

255

do_data_copy(bufix, bufp, bufcount, tree->data.const_val.data,

usr.sbin/dhcpd/tree.c

256

tree->data.const_val.len);

usr.sbin/dhcpd/tree.c

261

limit = *bufix + tree->data.limit.limit;

usr.sbin/dhcpd/tree.c

263

tree->data.limit.tree);

usr.sbin/dhcpd/tree.c

268

log_warnx("Bad node id in tree: %d.", tree->op);

usr.sbin/dhcpd/tree.c

60

struct tree *);

usr.sbin/dhcpd/tree.c

77

tree_cache(struct tree *tree)

usr.sbin/dhcpd/tree.c

87

tc->tree = tree;

usr.sbin/dhcpd/tree.c

91

struct tree *

usr.sbin/dhcpd/tree.c

95

struct tree *nt;

usr.sbin/dhcpd/tree.c

98

nt = calloc(1, sizeof(struct tree));

usr.sbin/dhcpd/tree.h

59

struct tree *left;

usr.sbin/dhcpd/tree.h

60

struct tree *right;

usr.sbin/dhcpd/tree.h

70

struct tree *tree;

usr.sbin/dhcpd/tree.h

90

struct tree *tree;

usr.sbin/nsd/ixfr.c

102

pcomp->tree.root = RBTREE_NULL;

usr.sbin/nsd/ixfr.c

103

pcomp->tree.count = 0;

usr.sbin/nsd/ixfr.c

135

found = (struct rrcompress_entry*)rbtree_search(&pcomp->tree, &key);

usr.sbin/nsd/ixfr.c

158

(void)rbtree_insert(&pcomp->tree, &entry->node);

usr.sbin/nsd/ixfr.c

58

struct rbtree tree;

usr.sbin/nsd/ixfr.c

88

pcomp->tree.root = RBTREE_NULL;

usr.sbin/nsd/ixfr.c

89

pcomp->tree.count = 0;

usr.sbin/nsd/ixfr.c

90

pcomp->tree.region = NULL;

usr.sbin/nsd/ixfr.c

91

pcomp->tree.cmp = &compression_cmp;

usr.sbin/nsd/namedb.c

161

zone_del_domain_in_hash_tree(rbtree_type* tree, rbnode_type* node)

usr.sbin/nsd/namedb.c

163

if(!node->key || !tree)

usr.sbin/nsd/namedb.c

165

rbtree_delete(tree, node->key);

usr.sbin/nsd/namedb.c

290

void hash_tree_delete(region_type* region, rbtree_type* tree)

usr.sbin/nsd/namedb.c

292

region_recycle(region, tree, sizeof(rbtree_type));

usr.sbin/nsd/namedb.c

296

void zone_add_domain_in_hash_tree(region_type* region, rbtree_type** tree,

usr.sbin/nsd/namedb.c

300

if(!*tree)

usr.sbin/nsd/namedb.c

301

*tree = rbtree_create(region, cmpf);

usr.sbin/nsd/namedb.c

303

&& rbtree_search(*tree, domain) == node)

usr.sbin/nsd/namedb.c

307

rbtree_insert(*tree, node);

usr.sbin/nsd/namedb.h

256

void zone_add_domain_in_hash_tree(region_type* region, rbtree_type** tree,

usr.sbin/nsd/namedb.h

259

void zone_del_domain_in_hash_tree(rbtree_type* tree, rbnode_type* node);

usr.sbin/nsd/namedb.h

260

void hash_tree_delete(region_type* region, rbtree_type* tree);

usr.sbin/nsd/nsec3.c

368

hash_tree_clear(rbtree_type* tree)

usr.sbin/nsd/nsec3.c

370

if(!tree) return;

usr.sbin/nsd/nsec3.c

386

tree->count = 0;

usr.sbin/nsd/nsec3.c

387

tree->root = RBTREE_NULL;

usr.sbin/nsd/nsec3.c

697

process_first(rbtree_type* tree, uint8_t* hash, rbnode_type** p,

usr.sbin/nsd/nsec3.c

705

if(!tree) {

usr.sbin/nsd/nsec3.c

716

if(rbtree_find_less_equal(tree, &d, p)) {

usr.sbin/nsd/nsec3.c

721

*p = rbtree_first(tree);

usr.sbin/nsd/nsec3.c

731

process_end(rbtree_type* tree, uint8_t* hash, rbnode_type** p,

usr.sbin/nsd/nsec3.c

739

if(!tree) {

usr.sbin/nsd/nsec3.c

750

if(rbtree_find_less_equal(tree, &d, p)) {

usr.sbin/nsd/nsec3.c

757

*p = rbtree_first(tree);

usr.sbin/nsd/xfrd-notify.c

117

rbtree_insert(tree, (rbnode_type*)not);

usr.sbin/nsd/xfrd-notify.c

541

xfrd_send_notify(rbtree_type* tree, const dname_type* apex, struct xfrd_soa* new_soa)

usr.sbin/nsd/xfrd-notify.c

545

rbtree_search(tree, apex);

usr.sbin/nsd/xfrd-notify.c

554

notify_handle_master_zone_soainfo(rbtree_type* tree,

usr.sbin/nsd/xfrd-notify.c

559

rbtree_search(tree, apex);

usr.sbin/nsd/xfrd-notify.c

572

close_notify_fds(rbtree_type* tree)

usr.sbin/nsd/xfrd-notify.c

575

RBTREE_FOR(zone, struct notify_zone*, tree)

usr.sbin/nsd/xfrd-notify.c

93

init_notify_send(rbtree_type* tree, region_type* region,

usr.sbin/nsd/xfrd-notify.h

80

void init_notify_send(rbtree_type* tree, region_type* region,

usr.sbin/nsd/xfrd-notify.h

86

void xfrd_send_notify(rbtree_type* tree, const struct dname* apex,

usr.sbin/nsd/xfrd-notify.h

93

void notify_handle_master_zone_soainfo(rbtree_type* tree,

usr.sbin/nsd/xfrd-notify.h

97

void close_notify_fds(rbtree_type* tree);

usr.sbin/ospf6d/rde.c

1355

prefix_tree_add(struct prefix_tree *tree, struct lsa_link *lsa)

usr.sbin/ospf6d/rde.c

1383

old = RB_INSERT(prefix_tree, tree, new);

usr.sbin/ospf6d/rde.c

1404

struct prefix_tree tree;

usr.sbin/ospf6d/rde.c

1412

RB_INIT(&tree);

usr.sbin/ospf6d/rde.c

1425

prefix_tree_add(&tree, &v->lsa->data.link);

usr.sbin/ospf6d/rde.c

1440

prefix_tree_add(&tree, &v->lsa->data.link);

usr.sbin/ospf6d/rde.c

1456

RB_FOREACH(node, prefix_tree, &tree) {

usr.sbin/ospf6d/rde.c

1463

while (!RB_EMPTY(&tree))

usr.sbin/ospf6d/rde.c

1464

free(RB_REMOVE(prefix_tree, &tree, RB_ROOT(&tree)));

usr.sbin/ospf6d/rde.c

943

struct lsa_tree *tree = &area->lsa_tree;

usr.sbin/ospf6d/rde.c

958

RB_FOREACH(v, lsa_tree, tree)

usr.sbin/ospf6d/rde_lsdb.c

467

struct lsa_tree *tree;

usr.sbin/ospf6d/rde_lsdb.c

473

tree = &asext_tree;

usr.sbin/ospf6d/rde_lsdb.c

475

tree = &nbr->area->lsa_tree;

usr.sbin/ospf6d/rde_lsdb.c

477

tree = &nbr->iface->lsa_tree;

usr.sbin/ospf6d/rde_lsdb.c

481

new = vertex_get(lsa, nbr, tree);

usr.sbin/ospf6d/rde_lsdb.c

482

old = RB_INSERT(lsa_tree, tree, new);

usr.sbin/ospf6d/rde_lsdb.c

492

RB_INSERT(lsa_tree, tree, new);

usr.sbin/ospf6d/rde_lsdb.c

502

RB_INSERT(lsa_tree, tree, new);

usr.sbin/ospf6d/rde_lsdb.c

577

struct lsa_tree *tree;

usr.sbin/ospf6d/rde_lsdb.c

580

tree = &asext_tree;

usr.sbin/ospf6d/rde_lsdb.c

582

tree = &iface->area->lsa_tree;

usr.sbin/ospf6d/rde_lsdb.c

584

tree = &iface->lsa_tree;

usr.sbin/ospf6d/rde_lsdb.c

588

return lsa_find_tree(tree, type, ls_id, adv_rtr);

usr.sbin/ospf6d/rde_lsdb.c

593

lsa_find_tree(struct lsa_tree *tree, u_int16_t type, u_int32_t ls_id,

usr.sbin/ospf6d/rde_lsdb.c

603

v = RB_FIND(lsa_tree, tree, &key);

usr.sbin/ospf6d/rde_lsdb.c

660

lsa_find_lsid(struct lsa_tree *tree, int (*cmp)(struct lsa *, struct lsa *),

usr.sbin/ospf6d/rde_lsdb.c

674

v = RB_NFIND(lsa_tree, tree, &key);

usr.sbin/ospf6d/rde_lsdb.c

68

vertex_get(struct lsa *lsa, struct rde_nbr *nbr, struct lsa_tree *tree)

usr.sbin/ospf6d/rde_lsdb.c

691

v = RB_NEXT(lsa_tree, tree, v);

usr.sbin/ospf6d/rde_lsdb.c

726

struct lsa_tree *tree = &nbr->area->lsa_tree;

usr.sbin/ospf6d/rde_lsdb.c

730

RB_FOREACH(v, lsa_tree, tree) {

usr.sbin/ospf6d/rde_lsdb.c

744

if (tree == &asext_tree)

usr.sbin/ospf6d/rde_lsdb.c

746

if (tree == &nbr->area->lsa_tree)

usr.sbin/ospf6d/rde_lsdb.c

747

tree = &nbr->iface->lsa_tree;

usr.sbin/ospf6d/rde_lsdb.c

749

tree = &asext_tree;

usr.sbin/ospf6d/rde_lsdb.c

754

lsa_dump(struct lsa_tree *tree, int imsg_type, pid_t pid)

usr.sbin/ospf6d/rde_lsdb.c

758

RB_FOREACH(v, lsa_tree, tree) {

usr.sbin/ospf6d/rde_lsdb.c

85

v->lsa_tree = tree;

usr.sbin/ospf6d/rde_lsdb.c

936

struct lsa_tree *tree = &area->lsa_tree;

usr.sbin/ospf6d/rde_lsdb.c

940

for (v = RB_MIN(lsa_tree, tree); v != NULL; v = nv) {

usr.sbin/ospf6d/rde_lsdb.c

941

nv = RB_NEXT(lsa_tree, tree, v);

usr.sbin/ospf6d/rde_spf.c

450

struct lsa_tree *tree = &area->lsa_tree;

usr.sbin/ospf6d/rde_spf.c

453

RB_FOREACH(v, lsa_tree, tree) {

usr.sbin/ospfd/rde.c

884

struct lsa_tree *tree = &area->lsa_tree;

usr.sbin/ospfd/rde.c

899

RB_FOREACH(v, lsa_tree, tree) {

usr.sbin/ospfd/rde_lsdb.c

383

struct lsa_tree *tree;

usr.sbin/ospfd/rde_lsdb.c

390

tree = &asext_tree;

usr.sbin/ospfd/rde_lsdb.c

392

tree = &nbr->iface->lsa_tree;

usr.sbin/ospfd/rde_lsdb.c

394

tree = &nbr->area->lsa_tree;

usr.sbin/ospfd/rde_lsdb.c

396

new = vertex_get(lsa, nbr, tree);

usr.sbin/ospfd/rde_lsdb.c

397

old = RB_INSERT(lsa_tree, tree, new);

usr.sbin/ospfd/rde_lsdb.c

407

RB_INSERT(lsa_tree, tree, new);

usr.sbin/ospfd/rde_lsdb.c

417

RB_INSERT(lsa_tree, tree, new);

usr.sbin/ospfd/rde_lsdb.c

490

struct lsa_tree *tree;

usr.sbin/ospfd/rde_lsdb.c

494

tree = &asext_tree;

usr.sbin/ospfd/rde_lsdb.c

496

tree = &iface->lsa_tree;

usr.sbin/ospfd/rde_lsdb.c

498

tree = &iface->area->lsa_tree;

usr.sbin/ospfd/rde_lsdb.c

500

return lsa_find_tree(tree, type, ls_id, adv_rtr);

usr.sbin/ospfd/rde_lsdb.c

511

lsa_find_tree(struct lsa_tree *tree, u_int16_t type, u_int32_t ls_id,

usr.sbin/ospfd/rde_lsdb.c

521

v = RB_FIND(lsa_tree, tree, &key);

usr.sbin/ospfd/rde_lsdb.c

536

struct lsa_tree *tree = &area->lsa_tree;

usr.sbin/ospfd/rde_lsdb.c

540

RB_FOREACH(v, lsa_tree, tree) {

usr.sbin/ospfd/rde_lsdb.c

571

struct lsa_tree *tree = &nbr->area->lsa_tree;

usr.sbin/ospfd/rde_lsdb.c

575

RB_FOREACH(v, lsa_tree, tree) {

usr.sbin/ospfd/rde_lsdb.c

595

if (tree == &asext_tree)

usr.sbin/ospfd/rde_lsdb.c

597

if (tree == &nbr->area->lsa_tree)

usr.sbin/ospfd/rde_lsdb.c

598

tree = &nbr->iface->lsa_tree;

usr.sbin/ospfd/rde_lsdb.c

602

tree = &asext_tree;

usr.sbin/ospfd/rde_lsdb.c

607

lsa_dump(struct lsa_tree *tree, int imsg_type, pid_t pid)

usr.sbin/ospfd/rde_lsdb.c

611

RB_FOREACH(v, lsa_tree, tree) {

usr.sbin/ospfd/rde_lsdb.c

67

vertex_get(struct lsa *lsa, struct rde_nbr *nbr, struct lsa_tree *tree)

usr.sbin/ospfd/rde_lsdb.c

785

struct lsa_tree *tree = &area->lsa_tree;

usr.sbin/ospfd/rde_lsdb.c

789

for (v = RB_MIN(lsa_tree, tree); v != NULL; v = nv) {

usr.sbin/ospfd/rde_lsdb.c

790

nv = RB_NEXT(lsa_tree, tree, v);

usr.sbin/ospfd/rde_lsdb.c

84

v->lsa_tree = tree;

usr.sbin/ospfd/rde_spf.c

361

struct lsa_tree *tree = &area->lsa_tree;

usr.sbin/ospfd/rde_spf.c

364

RB_FOREACH(v, lsa_tree, tree) {

usr.sbin/radiusd/eap2mschap_local.h

112

RB_ENTRY(access_req) tree;

usr.sbin/radiusd/eap2mschap_local.h

209

RB_PROTOTYPE_STATIC(access_reqt, access_req, tree, access_request_compar);

usr.sbin/radiusd/radiusd_eap2mschap.c

283

RB_GENERATE_STATIC(access_reqt, access_req, tree, access_request_compar);

usr.sbin/radiusd/radiusd_ipcp.c

1430

RB_GENERATE_STATIC(assigned_ipv4_tree, assigned_ipv4, tree,

usr.sbin/radiusd/radiusd_ipcp.c

1432

RB_GENERATE_STATIC(user_tree, user, tree, user_compar);

usr.sbin/radiusd/radiusd_ipcp.c

223

RB_PROTOTYPE_STATIC(assigned_ipv4_tree, assigned_ipv4, tree,

usr.sbin/radiusd/radiusd_ipcp.c

225

RB_PROTOTYPE_STATIC(user_tree, user, tree, user_compar);

usr.sbin/radiusd/radiusd_ipcp.c

67

RB_ENTRY(user) tree;

usr.sbin/radiusd/radiusd_ipcp.c

99

RB_ENTRY(assigned_ipv4) tree;

usr.sbin/rpki-client/aspa.c

292

aspa_insert_vaps(char *fn, struct vap_tree *tree, struct aspa *aspa,

usr.sbin/rpki-client/aspa.c

305

if ((found = RB_INSERT(vap_tree, tree, v)) != NULL) {

usr.sbin/rpki-client/ccr.c

697

ccr_insert_tas(struct ccr_tas_tree *tree, const struct cert *cert)

usr.sbin/rpki-client/ccr.c

709

if (RB_INSERT(ccr_tas_tree, tree, cts) != NULL)

usr.sbin/rpki-client/ccr.c

714

ccr_insert_mft_sub(struct ccr_mft_tree *tree, const struct cert *cert)

usr.sbin/rpki-client/ccr.c

723

if ((m = RB_FIND(ccr_mft_tree, tree, &needle)) == NULL)

usr.sbin/rpki-client/ccr.c

757

ccr_insert_mft(struct ccr_mft_tree *tree, const struct mft *mft)

usr.sbin/rpki-client/ccr.c

777

if (RB_INSERT(ccr_mft_tree, tree, ccr_mft) != NULL)

usr.sbin/rpki-client/ccr.c

782

ccr_insert_roa(struct ccr_vrp_tree *tree, const struct roa *roa)

usr.sbin/rpki-client/ccr.c

796

if (RB_INSERT(ccr_vrp_tree, tree, vrp) != NULL)

usr.sbin/rpki-client/cert.c

2353

insert_brk(struct brk_tree *tree, struct cert *cert, int asid)

usr.sbin/rpki-client/cert.c

2372

if ((found = RB_INSERT(brk_tree, tree, b)) != NULL) {

usr.sbin/rpki-client/cert.c

2387

cert_insert_brks(struct brk_tree *tree, struct cert *cert)

usr.sbin/rpki-client/cert.c

2394

insert_brk(tree, cert, cert->ases[i].id);

usr.sbin/rpki-client/cert.c

2399

insert_brk(tree, cert, asid);

usr.sbin/rpki-client/cert.c

2433

cert_insert_nca(struct nca_tree *tree, const struct cert *cert, struct repo *rp)

usr.sbin/rpki-client/cert.c

2450

if (RB_INSERT(nca_tree, tree, nca) != NULL)

usr.sbin/rpki-client/cert.c

2456

cert_remove_nca(struct nca_tree *tree, int cid, struct repo *rp)

usr.sbin/rpki-client/cert.c

2460

if ((found = RB_FIND(nca_tree, tree, &needle)) != NULL) {

usr.sbin/rpki-client/cert.c

2461

RB_REMOVE(nca_tree, tree, found);

usr.sbin/rpki-client/parser.c

1155

repo_tree_free(struct repo_tree *tree)

usr.sbin/rpki-client/parser.c

1162

RB_FOREACH_SAFE(repo, repo_tree, tree, trepo) {

usr.sbin/rpki-client/parser.c

1163

RB_REMOVE(repo_tree, tree, repo);

usr.sbin/rpki-client/repo.c

138

filepath_add(struct filepath_tree *tree, char *file, int id, time_t mtime,

usr.sbin/rpki-client/repo.c

152

if ((rfp = RB_INSERT(filepath_tree, tree, fp)) != NULL) {

usr.sbin/rpki-client/repo.c

1685

repo_cleanup_rrdp(struct filepath_tree *tree)

usr.sbin/rpki-client/repo.c

170

filepath_find(struct filepath_tree *tree, char *file)

usr.sbin/rpki-client/repo.c

1718

if (!filepath_exists(tree, fn)) {

usr.sbin/rpki-client/repo.c

174

return RB_FIND(filepath_tree, tree, &needle);

usr.sbin/rpki-client/repo.c

1743

repo_move_valid(struct filepath_tree *tree)

usr.sbin/rpki-client/repo.c

1751

RB_FOREACH_SAFE(fp, filepath_tree, tree, nfp) {

usr.sbin/rpki-client/repo.c

1793

RB_REMOVE(filepath_tree, tree, fp);

usr.sbin/rpki-client/repo.c

1799

if ((ofp = RB_INSERT(filepath_tree, tree, fp)) != NULL) {

usr.sbin/rpki-client/repo.c

1802

filepath_put(tree, ofp);

usr.sbin/rpki-client/repo.c

181

filepath_exists(struct filepath_tree *tree, char *file)

usr.sbin/rpki-client/repo.c

183

return filepath_find(tree, file) != NULL;

usr.sbin/rpki-client/repo.c

1845

repo_cleanup_entry(FTSENT *e, struct filepath_tree *tree, int cachefd)

usr.sbin/rpki-client/repo.c

1853

if (filepath_exists(tree, path)) {

usr.sbin/rpki-client/repo.c

190

filepath_valid(struct filepath_tree *tree, char *file, int id)

usr.sbin/rpki-client/repo.c

194

if ((fp = filepath_find(tree, file)) == NULL)

usr.sbin/rpki-client/repo.c

2001

repo_cleanup(struct filepath_tree *tree, int cachefd)

usr.sbin/rpki-client/repo.c

2008

repo_move_valid(tree);

usr.sbin/rpki-client/repo.c

2010

repo_cleanup_rrdp(tree);

usr.sbin/rpki-client/repo.c

2016

repo_cleanup_entry(e, tree, cachefd);

usr.sbin/rpki-client/repo.c

203

filepath_put(struct filepath_tree *tree, struct filepath *fp)

usr.sbin/rpki-client/repo.c

205

RB_REMOVE(filepath_tree, tree, fp);

usr.sbin/rpki-client/repo.c

214

filepath_free(struct filepath_tree *tree)

usr.sbin/rpki-client/repo.c

218

RB_FOREACH_SAFE(fp, filepath_tree, tree, nfp)

usr.sbin/rpki-client/repo.c

219

filepath_put(tree, fp);

usr.sbin/rpki-client/roa.c

335

roa_insert_vrps(struct vrp_tree *tree, struct roa *roa, struct repo *rp)

usr.sbin/rpki-client/roa.c

356

if ((found = RB_INSERT(vrp_tree, tree, v)) != NULL) {

usr.sbin/rpki-client/spl.c

360

spl_insert_vsps(struct vsp_tree *tree, struct spl *spl, struct repo *rp)

usr.sbin/rpki-client/spl.c

374

if ((found = RB_INSERT(vsp_tree, tree, vsp)) != NULL) {

usr.sbin/smtpd/aliases.c

177

RB_FOREACH(xn, expandtree, &lk.expand->tree) {

usr.sbin/smtpd/aliases.c

64

RB_FOREACH(xn, expandtree, &lk.expand->tree) {

usr.sbin/smtpd/bounce.c

94

static struct tree wait_fd;

usr.sbin/smtpd/control.c

64

static struct tree ctl_conns;

usr.sbin/smtpd/control.c

65

static struct tree ctl_count;

usr.sbin/smtpd/expand.c

100

RB_REMOVE(expandtree, &expand->tree, xn);

usr.sbin/smtpd/expand.c

30

return RB_FIND(expandtree, &expand->tree, key);

usr.sbin/smtpd/expand.c

40

RB_FOREACH(xn, expandtree, &expand->tree) {

usr.sbin/smtpd/expand.c

82

RB_INSERT(expandtree, &expand->tree, xn);

usr.sbin/smtpd/expand.c

99

while ((xn = RB_ROOT(&expand->tree)) != NULL) {

usr.sbin/smtpd/lka_filter.c

122

static struct tree sessions;

usr.sbin/smtpd/lka_session.c

54

static struct tree sessions;

usr.sbin/smtpd/lka_session.c

69

RB_INIT(&lks->expand.tree);

usr.sbin/smtpd/mda.c

97

static struct tree sessions;

usr.sbin/smtpd/mda.c

98

static struct tree users;

usr.sbin/smtpd/mta.c

141

static struct tree wait_mx;

usr.sbin/smtpd/mta.c

142

static struct tree wait_preference;

usr.sbin/smtpd/mta.c

143

static struct tree wait_secret;

usr.sbin/smtpd/mta.c

144

static struct tree wait_smarthost;

usr.sbin/smtpd/mta.c

145

static struct tree wait_source;

usr.sbin/smtpd/mta.c

146

static struct tree flush_evp;

usr.sbin/smtpd/mta.c

162

struct tree deferred;

usr.sbin/smtpd/mta_session.c

144

static struct mta_session *mta_tree_pop(struct tree *, uint64_t);

usr.sbin/smtpd/mta_session.c

183

static struct tree wait_helo;

usr.sbin/smtpd/mta_session.c

184

static struct tree wait_ptr;

usr.sbin/smtpd/mta_session.c

185

static struct tree wait_fd;

usr.sbin/smtpd/mta_session.c

186

static struct tree wait_tls_init;

usr.sbin/smtpd/mta_session.c

187

static struct tree wait_tls_verify;

usr.sbin/smtpd/mta_session.c

353

mta_tree_pop(struct tree *wait, uint64_t reqid)

usr.sbin/smtpd/queue_backend.c

45

static struct tree evpcache_tree;

usr.sbin/smtpd/queue_fs.c

61

struct tree evpcount;

usr.sbin/smtpd/queue_ram.c

36

struct tree envelopes;

usr.sbin/smtpd/queue_ram.c

39

static struct tree messages;

usr.sbin/smtpd/scheduler_ramqueue.c

145

static struct tree updates;

usr.sbin/smtpd/scheduler_ramqueue.c

146

static struct tree holdqs[3]; /* delivery type */

usr.sbin/smtpd/scheduler_ramqueue.c

32

struct tree envelopes;

usr.sbin/smtpd/scheduler_ramqueue.c

73

struct tree messages;

usr.sbin/smtpd/smtp_session.c

284

static struct tree wait_lka_helo;

usr.sbin/smtpd/smtp_session.c

285

static struct tree wait_lka_mail;

usr.sbin/smtpd/smtp_session.c

286

static struct tree wait_lka_rcpt;

usr.sbin/smtpd/smtp_session.c

287

static struct tree wait_parent_auth;

usr.sbin/smtpd/smtp_session.c

288

static struct tree wait_queue_msg;

usr.sbin/smtpd/smtp_session.c

289

static struct tree wait_queue_fd;

usr.sbin/smtpd/smtp_session.c

290

static struct tree wait_queue_commit;

usr.sbin/smtpd/smtp_session.c

291

static struct tree wait_ssl_init;

usr.sbin/smtpd/smtp_session.c

292

static struct tree wait_ssl_verify;

usr.sbin/smtpd/smtp_session.c

293

static struct tree wait_filters;

usr.sbin/smtpd/smtp_session.c

294

static struct tree wait_filter_fd;

usr.sbin/smtpd/smtpd.c

141

struct tree children;

usr.sbin/smtpd/smtpd.h

449

RB_HEAD(expandtree, expandnode) tree;

usr.sbin/smtpd/smtpd.h

822

struct tree connectors;

usr.sbin/smtpd/tree.c

100

if ((entry = SPLAY_FIND(_tree, &t->tree, &key)) == NULL)

usr.sbin/smtpd/tree.c

107

tree_pop(struct tree *t, uint64_t id)

usr.sbin/smtpd/tree.c

113

if ((entry = SPLAY_FIND(_tree, &t->tree, &key)) == NULL)

usr.sbin/smtpd/tree.c

117

SPLAY_REMOVE(_tree, &t->tree, entry);

usr.sbin/smtpd/tree.c

125

tree_xpop(struct tree *t, uint64_t id)

usr.sbin/smtpd/tree.c

131

if ((entry = SPLAY_FIND(_tree, &t->tree, &key)) == NULL)

usr.sbin/smtpd/tree.c

135

SPLAY_REMOVE(_tree, &t->tree, entry);

usr.sbin/smtpd/tree.c

143

tree_poproot(struct tree *t, uint64_t *id, void **data)

usr.sbin/smtpd/tree.c

147

entry = SPLAY_ROOT(&t->tree);

usr.sbin/smtpd/tree.c

154

SPLAY_REMOVE(_tree, &t->tree, entry);

usr.sbin/smtpd/tree.c

162

tree_root(struct tree *t, uint64_t *id, void **data)

usr.sbin/smtpd/tree.c

166

entry = SPLAY_ROOT(&t->tree);

usr.sbin/smtpd/tree.c

177

tree_iter(struct tree *t, void **hdl, uint64_t *id, void **data)

usr.sbin/smtpd/tree.c

182

curr = SPLAY_MIN(_tree, &t->tree);

usr.sbin/smtpd/tree.c

184

curr = SPLAY_NEXT(_tree, &t->tree, curr);

usr.sbin/smtpd/tree.c

199

tree_iterfrom(struct tree *t, void **hdl, uint64_t k, uint64_t *id, void **data)

usr.sbin/smtpd/tree.c

205

curr = SPLAY_MIN(_tree, &t->tree);

usr.sbin/smtpd/tree.c

208

curr = SPLAY_FIND(_tree, &t->tree, &key);

usr.sbin/smtpd/tree.c

210

SPLAY_INSERT(_tree, &t->tree, &key);

usr.sbin/smtpd/tree.c

211

curr = SPLAY_NEXT(_tree, &t->tree, &key);

usr.sbin/smtpd/tree.c

212

SPLAY_REMOVE(_tree, &t->tree, &key);

usr.sbin/smtpd/tree.c

216

curr = SPLAY_NEXT(_tree, &t->tree, curr);

usr.sbin/smtpd/tree.c

231

tree_merge(struct tree *dst, struct tree *src)

usr.sbin/smtpd/tree.c

235

while (!SPLAY_EMPTY(&src->tree)) {

usr.sbin/smtpd/tree.c

236

entry = SPLAY_ROOT(&src->tree);

usr.sbin/smtpd/tree.c

237

SPLAY_REMOVE(_tree, &src->tree, entry);

usr.sbin/smtpd/tree.c

238

if (SPLAY_INSERT(_tree, &dst->tree, entry))

usr.sbin/smtpd/tree.c

38

tree_check(struct tree *t, uint64_t id)

usr.sbin/smtpd/tree.c

43

return (SPLAY_FIND(_tree, &t->tree, &key) != NULL);

usr.sbin/smtpd/tree.c

47

tree_set(struct tree *t, uint64_t id, void *data)

usr.sbin/smtpd/tree.c

53

if ((entry = SPLAY_FIND(_tree, &t->tree, &key)) == NULL) {

usr.sbin/smtpd/tree.c

57

SPLAY_INSERT(_tree, &t->tree, entry);

usr.sbin/smtpd/tree.c

69

tree_xset(struct tree *t, uint64_t id, void *data)

usr.sbin/smtpd/tree.c

77

if (SPLAY_INSERT(_tree, &t->tree, entry))

usr.sbin/smtpd/tree.c

83

tree_get(struct tree *t, uint64_t id)

usr.sbin/smtpd/tree.c

88

if ((entry = SPLAY_FIND(_tree, &t->tree, &key)) == NULL)

usr.sbin/smtpd/tree.c

95

tree_xget(struct tree *t, uint64_t id)

usr.sbin/smtpd/tree.h

26

struct _tree tree;

usr.sbin/smtpd/tree.h

32

#define tree_init(t) do { SPLAY_INIT(&((t)->tree)); (t)->count = 0; } while(0)

usr.sbin/smtpd/tree.h

33

#define tree_empty(t) SPLAY_EMPTY(&((t)->tree))

usr.sbin/smtpd/tree.h

35

int tree_check(struct tree *, uint64_t);

usr.sbin/smtpd/tree.h

36

void *tree_set(struct tree *, uint64_t, void *);

usr.sbin/smtpd/tree.h

37

void tree_xset(struct tree *, uint64_t, void *);

usr.sbin/smtpd/tree.h

38

void *tree_get(struct tree *, uint64_t);

usr.sbin/smtpd/tree.h

39

void *tree_xget(struct tree *, uint64_t);

usr.sbin/smtpd/tree.h

40

void *tree_pop(struct tree *, uint64_t);

usr.sbin/smtpd/tree.h

41

void *tree_xpop(struct tree *, uint64_t);

usr.sbin/smtpd/tree.h

42

int tree_poproot(struct tree *, uint64_t *, void **);

usr.sbin/smtpd/tree.h

43

int tree_root(struct tree *, uint64_t *, void **);

usr.sbin/smtpd/tree.h

44

int tree_iter(struct tree *, void **, uint64_t *, void **);

usr.sbin/smtpd/tree.h

45

int tree_iterfrom(struct tree *, void **, uint64_t, uint64_t *, void **);

usr.sbin/smtpd/tree.h

46

void tree_merge(struct tree *, struct tree *);

usr.sbin/unbound/daemon/acl_list.c

166

if(!(node=(struct acl_addr*)addr_tree_find(&acl->tree, &addr,

usr.sbin/unbound/daemon/acl_list.c

187

if(!(node=(struct acl_addr*)addr_tree_find(&acl->tree, addr,

usr.sbin/unbound/daemon/acl_list.c

531

addr_tree_init(&acl->tree);

usr.sbin/unbound/daemon/acl_list.c

552

addr_tree_init_parents(&acl->tree);

usr.sbin/unbound/daemon/acl_list.c

565

addr_tree_addrport_init(&acl_interface->tree);

usr.sbin/unbound/daemon/acl_list.c

757

addr_tree_init_parents(&acl_interface->tree);

usr.sbin/unbound/daemon/acl_list.c

772

return (struct acl_addr*)addr_tree_lookup(&acl->tree,

usr.sbin/unbound/daemon/acl_list.c

823

rbtree_type oldtree = acl->tree;

usr.sbin/unbound/daemon/acl_list.c

825

acl->tree = data->tree;

usr.sbin/unbound/daemon/acl_list.c

827

data->tree = oldtree;

usr.sbin/unbound/daemon/acl_list.c

87

if(!addr_tree_insert(&acl->tree, &node->node, addr, addrlen, net)) {

usr.sbin/unbound/daemon/acl_list.h

85

rbtree_type tree;

usr.sbin/unbound/daemon/remote.c

1881

addrtree_traverse(struct addrtree* tree, int is_ipv6, time_t now,

usr.sbin/unbound/daemon/remote.c

1888

addrtree_traverse_visit_node(tree->root, (addrkey_t*)addr,

usr.sbin/unbound/daemon/remote.c

2935

RBTREE_FOR(a, struct trust_anchor*, worker->env.anchors->tree) {

usr.sbin/unbound/daemon/remote.c

3320

RBTREE_FOR(z, struct iter_forward_zone*, fwds->tree) {

usr.sbin/unbound/daemon/remote.c

3351

RBTREE_FOR(z, struct iter_hints_stub*, &worker->env.hints->tree) {

usr.sbin/unbound/daemon/remote.c

5580

if(fr->worker->daemon->tcl->tree.count != 0)

usr.sbin/unbound/daemon/worker.c

1048

RBTREE_FOR(ta, struct trust_anchor*, w->env.anchors->tree) {

usr.sbin/unbound/edns-subnet/addrtree.c

115

node_size(const struct addrtree *tree, const struct addrnode *n)

usr.sbin/unbound/edns-subnet/addrtree.c

118

(n->elem?tree->sizefunc(n->elem):0);

usr.sbin/unbound/edns-subnet/addrtree.c

125

struct addrtree *tree;

usr.sbin/unbound/edns-subnet/addrtree.c

128

tree = (struct addrtree *)calloc(1, sizeof(*tree));

usr.sbin/unbound/edns-subnet/addrtree.c

129

if (!tree)

usr.sbin/unbound/edns-subnet/addrtree.c

131

tree->root = node_create(tree, NULL, 0, 0);

usr.sbin/unbound/edns-subnet/addrtree.c

132

if (!tree->root) {

usr.sbin/unbound/edns-subnet/addrtree.c

133

free(tree);

usr.sbin/unbound/edns-subnet/addrtree.c

136

tree->size_bytes = sizeof *tree + sizeof *tree->root;

usr.sbin/unbound/edns-subnet/addrtree.c

137

tree->first = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

138

tree->last = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

139

tree->max_depth = max_depth;

usr.sbin/unbound/edns-subnet/addrtree.c

140

tree->delfunc = delfunc;

usr.sbin/unbound/edns-subnet/addrtree.c

141

tree->sizefunc = sizefunc;

usr.sbin/unbound/edns-subnet/addrtree.c

142

tree->env = env;

usr.sbin/unbound/edns-subnet/addrtree.c

143

tree->node_count = 0;

usr.sbin/unbound/edns-subnet/addrtree.c

144

tree->max_node_count = max_node_count;

usr.sbin/unbound/edns-subnet/addrtree.c

145

return tree;

usr.sbin/unbound/edns-subnet/addrtree.c

154

clean_node(struct addrtree *tree, struct addrnode *node)

usr.sbin/unbound/edns-subnet/addrtree.c

157

tree->size_bytes -= tree->sizefunc(node->elem);

usr.sbin/unbound/edns-subnet/addrtree.c

158

tree->delfunc(tree->env, node->elem);

usr.sbin/unbound/edns-subnet/addrtree.c

165

lru_pop(struct addrtree *tree, struct addrnode *node)

usr.sbin/unbound/edns-subnet/addrtree.c

167

if (node == tree->first) {

usr.sbin/unbound/edns-subnet/addrtree.c

169

tree->first = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

170

tree->last = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

172

tree->first = node->next;

usr.sbin/unbound/edns-subnet/addrtree.c

173

tree->first->prev = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

175

} else if (node == tree->last) { /* but not the first */

usr.sbin/unbound/edns-subnet/addrtree.c

176

tree->last = node->prev;

usr.sbin/unbound/edns-subnet/addrtree.c

177

tree->last->next = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

186

lru_push(struct addrtree *tree, struct addrnode *node)

usr.sbin/unbound/edns-subnet/addrtree.c

188

if (!tree->first) {

usr.sbin/unbound/edns-subnet/addrtree.c

189

tree->first = node;

usr.sbin/unbound/edns-subnet/addrtree.c

192

tree->last->next = node;

usr.sbin/unbound/edns-subnet/addrtree.c

193

node->prev = tree->last;

usr.sbin/unbound/edns-subnet/addrtree.c

195

tree->last = node;

usr.sbin/unbound/edns-subnet/addrtree.c

201

lru_update(struct addrtree *tree, struct addrnode *node)

usr.sbin/unbound/edns-subnet/addrtree.c

203

if (tree->root == node) return;

usr.sbin/unbound/edns-subnet/addrtree.c

204

lru_pop(tree, node);

usr.sbin/unbound/edns-subnet/addrtree.c

205

lru_push(tree, node);

usr.sbin/unbound/edns-subnet/addrtree.c

215

purge_node(struct addrtree *tree, struct addrnode *node)

usr.sbin/unbound/edns-subnet/addrtree.c

221

clean_node(tree, node);

usr.sbin/unbound/edns-subnet/addrtree.c

224

tree->node_count--;

usr.sbin/unbound/edns-subnet/addrtree.c

232

tree->size_bytes -= node_size(tree, node);

usr.sbin/unbound/edns-subnet/addrtree.c

235

lru_pop(tree, node);

usr.sbin/unbound/edns-subnet/addrtree.c

244

lru_cleanup(struct addrtree *tree)

usr.sbin/unbound/edns-subnet/addrtree.c

248

if (tree->max_node_count == 0) return;

usr.sbin/unbound/edns-subnet/addrtree.c

249

while (tree->node_count > tree->max_node_count) {

usr.sbin/unbound/edns-subnet/addrtree.c

250

n = tree->first;

usr.sbin/unbound/edns-subnet/addrtree.c

256

lru_update(tree, n);

usr.sbin/unbound/edns-subnet/addrtree.c

260

purge_node(tree, n);

usr.sbin/unbound/edns-subnet/addrtree.c

266

purge_node(tree, p);

usr.sbin/unbound/edns-subnet/addrtree.c

272

addrtree_size(const struct addrtree *tree)

usr.sbin/unbound/edns-subnet/addrtree.c

274

return tree?tree->size_bytes:0;

usr.sbin/unbound/edns-subnet/addrtree.c

277

void addrtree_delete(struct addrtree *tree)

usr.sbin/unbound/edns-subnet/addrtree.c

280

if (!tree) return;

usr.sbin/unbound/edns-subnet/addrtree.c

281

clean_node(tree, tree->root);

usr.sbin/unbound/edns-subnet/addrtree.c

282

free(tree->root);

usr.sbin/unbound/edns-subnet/addrtree.c

283

tree->size_bytes -= sizeof(struct addrnode);

usr.sbin/unbound/edns-subnet/addrtree.c

284

while ((n = tree->first)) {

usr.sbin/unbound/edns-subnet/addrtree.c

285

tree->first = n->next;

usr.sbin/unbound/edns-subnet/addrtree.c

286

clean_node(tree, n);

usr.sbin/unbound/edns-subnet/addrtree.c

287

tree->size_bytes -= node_size(tree, n);

usr.sbin/unbound/edns-subnet/addrtree.c

292

log_assert(sizeof *tree == addrtree_size(tree));

usr.sbin/unbound/edns-subnet/addrtree.c

293

free(tree);

usr.sbin/unbound/edns-subnet/addrtree.c

361

addrtree_insert(struct addrtree *tree, const addrkey_t *addr,

usr.sbin/unbound/edns-subnet/addrtree.c

370

node = tree->root;

usr.sbin/unbound/edns-subnet/addrtree.c

374

if (tree->max_depth < scope) scope = tree->max_depth;

usr.sbin/unbound/edns-subnet/addrtree.c

384

clean_node(tree, node);

usr.sbin/unbound/edns-subnet/addrtree.c

389

tree->size_bytes += tree->sizefunc(elem);

usr.sbin/unbound/edns-subnet/addrtree.c

399

purge_node(tree, edge->node);

usr.sbin/unbound/edns-subnet/addrtree.c

404

newnode = node_create(tree, elem, scope, ttl);

usr.sbin/unbound/edns-subnet/addrtree.c

408

clean_node(tree, newnode);

usr.sbin/unbound/edns-subnet/addrtree.c

409

tree->node_count--;

usr.sbin/unbound/edns-subnet/addrtree.c

413

tree->size_bytes += node_size(tree, newnode);

usr.sbin/unbound/edns-subnet/addrtree.c

414

lru_push(tree, newnode);

usr.sbin/unbound/edns-subnet/addrtree.c

415

lru_cleanup(tree);

usr.sbin/unbound/edns-subnet/addrtree.c

431

if (!(newnode = node_create(tree, NULL, 0, 0)))

usr.sbin/unbound/edns-subnet/addrtree.c

436

clean_node(tree, newnode);

usr.sbin/unbound/edns-subnet/addrtree.c

437

tree->node_count--;

usr.sbin/unbound/edns-subnet/addrtree.c

441

lru_push(tree, newnode);

usr.sbin/unbound/edns-subnet/addrtree.c

456

tree->size_bytes += node_size(tree, newnode);

usr.sbin/unbound/edns-subnet/addrtree.c

461

newnode = node_create(tree, elem, scope, ttl);

usr.sbin/unbound/edns-subnet/addrtree.c

464

clean_node(tree, newnode);

usr.sbin/unbound/edns-subnet/addrtree.c

465

tree->node_count--;

usr.sbin/unbound/edns-subnet/addrtree.c

469

tree->size_bytes += node_size(tree, newnode);

usr.sbin/unbound/edns-subnet/addrtree.c

470

lru_push(tree, newnode);

usr.sbin/unbound/edns-subnet/addrtree.c

472

lru_cleanup(tree);

usr.sbin/unbound/edns-subnet/addrtree.c

478

addrtree_find(struct addrtree *tree, const addrkey_t *addr,

usr.sbin/unbound/edns-subnet/addrtree.c

481

struct addrnode *node = tree->root;

usr.sbin/unbound/edns-subnet/addrtree.c

500

lru_update(tree, node);

usr.sbin/unbound/edns-subnet/addrtree.c

90

node_create(struct addrtree *tree, void *elem, addrlen_t scope,

usr.sbin/unbound/edns-subnet/addrtree.c

97

tree->node_count++;

usr.sbin/unbound/edns-subnet/addrtree.h

130

size_t addrtree_size(const struct addrtree *tree);

usr.sbin/unbound/edns-subnet/addrtree.h

150

void addrtree_delete(struct addrtree *tree);

usr.sbin/unbound/edns-subnet/addrtree.h

167

void addrtree_insert(struct addrtree *tree, const addrkey_t *addr,

usr.sbin/unbound/edns-subnet/addrtree.h

180

struct addrnode * addrtree_find(struct addrtree *tree,

usr.sbin/unbound/edns-subnet/subnetmod.c

355

struct addrtree *tree;

usr.sbin/unbound/edns-subnet/subnetmod.c

361

tree = data->tree4;

usr.sbin/unbound/edns-subnet/subnetmod.c

367

tree = data->tree6;

usr.sbin/unbound/edns-subnet/subnetmod.c

369

return tree;

usr.sbin/unbound/edns-subnet/subnetmod.c

376

struct addrtree *tree;

usr.sbin/unbound/edns-subnet/subnetmod.c

424

if (!(tree = get_tree(lru_entry->data, edns, sne, qstate->env->cfg))) {

usr.sbin/unbound/edns-subnet/subnetmod.c

450

diff_size = (int)tree->size_bytes;

usr.sbin/unbound/edns-subnet/subnetmod.c

451

addrtree_insert(tree, (addrkey_t*)edns->subnet_addr,

usr.sbin/unbound/edns-subnet/subnetmod.c

454

diff_size = (int)tree->size_bytes - diff_size;

usr.sbin/unbound/edns-subnet/subnetmod.c

476

struct addrtree *tree;

usr.sbin/unbound/edns-subnet/subnetmod.c

489

tree = (ecs->subnet_addr_fam == EDNSSUBNET_ADDRFAM_IP4)?

usr.sbin/unbound/edns-subnet/subnetmod.c

491

if (!tree) { /* qinfo in cache but not for this family */

usr.sbin/unbound/edns-subnet/subnetmod.c

495

node = addrtree_find(tree, (addrkey_t*)ecs->subnet_addr,

usr.sbin/unbound/iterator/iter_donotq.c

126

addr_tree_init(&dq->tree);

usr.sbin/unbound/iterator/iter_donotq.c

137

addr_tree_init_parents(&dq->tree);

usr.sbin/unbound/iterator/iter_donotq.c

145

return addr_tree_lookup(&donotq->tree, addr, addrlen) != NULL;

usr.sbin/unbound/iterator/iter_donotq.c

84

if(!addr_tree_insert(&dq->tree, node, addr, addrlen, net)) {

usr.sbin/unbound/iterator/iter_donotq.h

61

rbtree_type tree;

usr.sbin/unbound/iterator/iter_fwd.c

131

if(!rbtree_insert(fwd->tree, &node->node)) {

usr.sbin/unbound/iterator/iter_fwd.c

150

return (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);

usr.sbin/unbound/iterator/iter_fwd.c

167

RBTREE_FOR(node, struct iter_forward_zone*, fwd->tree) {

usr.sbin/unbound/iterator/iter_fwd.c

382

if(fwd->tree) {

usr.sbin/unbound/iterator/iter_fwd.c

383

lock_unprotect(&fwd->lock, fwd->tree);

usr.sbin/unbound/iterator/iter_fwd.c

386

fwd->tree = rbtree_create(fwd_cmp);

usr.sbin/unbound/iterator/iter_fwd.c

387

if(!fwd->tree)

usr.sbin/unbound/iterator/iter_fwd.c

389

lock_protect(&fwd->lock, fwd->tree, sizeof(*fwd->tree));

usr.sbin/unbound/iterator/iter_fwd.c

429

res = (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);

usr.sbin/unbound/iterator/iter_fwd.c

450

if(rbtree_find_less_equal(fwd->tree, &key, &res)) {

usr.sbin/unbound/iterator/iter_fwd.c

492

n = rbtree_first(fwd->tree);

usr.sbin/unbound/iterator/iter_fwd.c

513

if(rbtree_find_less_equal(fwd->tree, &key, &n)) {

usr.sbin/unbound/iterator/iter_fwd.c

553

s = sizeof(*fwd) + sizeof(*fwd->tree);

usr.sbin/unbound/iterator/iter_fwd.c

554

RBTREE_FOR(p, struct iter_forward_zone*, fwd->tree) {

usr.sbin/unbound/iterator/iter_fwd.c

569

(void)rbtree_delete(fwd->tree, &z->node);

usr.sbin/unbound/iterator/iter_fwd.c

592

(void)rbtree_delete(fwd->tree, &z->node);

usr.sbin/unbound/iterator/iter_fwd.c

632

(void)rbtree_delete(fwd->tree, &z->node);

usr.sbin/unbound/iterator/iter_fwd.c

641

rbtree_type* oldtree = fwd->tree;

usr.sbin/unbound/iterator/iter_fwd.c

645

if(data->tree) {

usr.sbin/unbound/iterator/iter_fwd.c

646

lock_unprotect(&data->lock, data->tree);

usr.sbin/unbound/iterator/iter_fwd.c

648

fwd->tree = data->tree;

usr.sbin/unbound/iterator/iter_fwd.c

649

data->tree = oldtree;

usr.sbin/unbound/iterator/iter_fwd.c

650

lock_protect(&fwd->lock, fwd->tree, sizeof(*fwd->tree));

usr.sbin/unbound/iterator/iter_fwd.c

651

lock_protect(&data->lock, data->tree, sizeof(*data->tree));

usr.sbin/unbound/iterator/iter_fwd.c

94

if(fwd->tree)

usr.sbin/unbound/iterator/iter_fwd.c

95

traverse_postorder(fwd->tree, &delfwdnode, NULL);

usr.sbin/unbound/iterator/iter_fwd.c

96

free(fwd->tree);

usr.sbin/unbound/iterator/iter_fwd.h

66

rbtree_type* tree;

usr.sbin/unbound/iterator/iter_hints.c

182

if(!name_tree_insert(&hints->tree, &node->node, dp->name, dp->namelen,

usr.sbin/unbound/iterator/iter_hints.c

447

name_tree_init(&hints->tree);

usr.sbin/unbound/iterator/iter_hints.c

476

name_tree_init_parents(&hints->tree);

usr.sbin/unbound/iterator/iter_hints.c

491

stub = (struct iter_hints_stub*)name_tree_find(&hints->tree,

usr.sbin/unbound/iterator/iter_hints.c

517

r = (struct iter_hints_stub*)name_tree_lookup(&hints->tree, qname,

usr.sbin/unbound/iterator/iter_hints.c

554

ret = name_tree_next_root(&hints->tree, qclass);

usr.sbin/unbound/iterator/iter_hints.c

567

RBTREE_FOR(p, struct iter_hints_stub*, &hints->tree) {

usr.sbin/unbound/iterator/iter_hints.c

581

if((z=(struct iter_hints_stub*)name_tree_find(&hints->tree,

usr.sbin/unbound/iterator/iter_hints.c

583

(void)rbtree_delete(&hints->tree, &z->node);

usr.sbin/unbound/iterator/iter_hints.c

590

name_tree_init_parents(&hints->tree);

usr.sbin/unbound/iterator/iter_hints.c

604

if(!(z=(struct iter_hints_stub*)name_tree_find(&hints->tree,

usr.sbin/unbound/iterator/iter_hints.c

609

(void)rbtree_delete(&hints->tree, &z->node);

usr.sbin/unbound/iterator/iter_hints.c

61

lock_protect(&hints->lock, &hints->tree, sizeof(hints->tree));

usr.sbin/unbound/iterator/iter_hints.c

611

name_tree_init_parents(&hints->tree);

usr.sbin/unbound/iterator/iter_hints.c

618

rbnode_type* oldroot = hints->tree.root;

usr.sbin/unbound/iterator/iter_hints.c

619

size_t oldcount = hints->tree.count;

usr.sbin/unbound/iterator/iter_hints.c

620

hints->tree.root = data->tree.root;

usr.sbin/unbound/iterator/iter_hints.c

621

hints->tree.count = data->tree.count;

usr.sbin/unbound/iterator/iter_hints.c

622

data->tree.root = oldroot;

usr.sbin/unbound/iterator/iter_hints.c

623

data->tree.count = oldcount;

usr.sbin/unbound/iterator/iter_hints.c

80

traverse_postorder(&hints->tree, &delhintnode, NULL);

usr.sbin/unbound/iterator/iter_hints.h

67

rbtree_type tree;

usr.sbin/unbound/services/cache/infra.c

1278

rbtree_type* tree;

usr.sbin/unbound/services/cache/infra.c

1286

tree = &infra->wait_limits_cookie_netblock;

usr.sbin/unbound/services/cache/infra.c

1287

else tree = &infra->wait_limits_netblock;

usr.sbin/unbound/services/cache/infra.c

1288

w = (struct wait_limit_netblock_info*)addr_tree_lookup(tree,

usr.sbin/unbound/services/cache/infra.c

244

wait_limit_netblock_findcreate(struct rbtree_type* tree, char* str)

usr.sbin/unbound/services/cache/infra.c

257

d = (struct wait_limit_netblock_info*)addr_tree_find(tree, &addr,

usr.sbin/unbound/services/cache/infra.c

267

if(!addr_tree_insert(tree, &d->node, &addr, addrlen, net)) {

usr.sbin/unbound/services/cache/infra.c

302

wait_limit_netblock_default(struct rbtree_type* tree, char* str, int limit)

usr.sbin/unbound/services/cache/infra.c

305

d = wait_limit_netblock_findcreate(tree, str);

usr.sbin/unbound/testcode/memstats.c

102

get_codeline(rbtree_type* tree, char* key, char* func)

usr.sbin/unbound/testcode/memstats.c

104

struct codeline* cl = (struct codeline*)rbtree_search(tree, key);

usr.sbin/unbound/testcode/memstats.c

121

(void)rbtree_insert(tree, &cl->node);

usr.sbin/unbound/testcode/memstats.c

128

read_malloc_stat(char* line, rbtree_type* tree)

usr.sbin/unbound/testcode/memstats.c

144

cl = get_codeline(tree, codeline, name);

usr.sbin/unbound/testcode/memstats.c

153

read_calloc_stat(char* line, rbtree_type* tree)

usr.sbin/unbound/testcode/memstats.c

170

cl = get_codeline(tree, codeline, name);

usr.sbin/unbound/testcode/memstats.c

190

readfile(rbtree_type* tree, const char* fname)

usr.sbin/unbound/testcode/memstats.c

212

read_malloc_stat(buf, tree);

usr.sbin/unbound/testcode/memstats.c

214

read_calloc_stat(buf, tree);

usr.sbin/unbound/testcode/memstats.c

226

printstats(rbtree_type* tree)

usr.sbin/unbound/testcode/memstats.c

230

RBTREE_FOR(cl, struct codeline*, tree) {

usr.sbin/unbound/testcode/memstats.c

238

(long long)tcalls, (long)tree->count);

usr.sbin/unbound/testcode/memstats.c

245

rbtree_type* tree = 0;

usr.sbin/unbound/testcode/memstats.c

250

tree = rbtree_create(codeline_cmp);

usr.sbin/unbound/testcode/memstats.c

251

if(!tree)

usr.sbin/unbound/testcode/memstats.c

253

readfile(tree, argv[1]);

usr.sbin/unbound/testcode/memstats.c

254

printstats(tree);

usr.sbin/unbound/testcode/unitecs.c

100

if (depth > tree->max_depth) return 15;

usr.sbin/unbound/testcode/unitecs.c

113

if ((r = addrtree_inconsistent_subtree(tree, edge, depth+1)) != 0)

usr.sbin/unbound/testcode/unitecs.c

119

static int addrtree_inconsistent(struct addrtree* tree)

usr.sbin/unbound/testcode/unitecs.c

124

if (!tree) return 0;

usr.sbin/unbound/testcode/unitecs.c

125

if (!tree->root) return 1;

usr.sbin/unbound/testcode/unitecs.c

128

edge = tree->root->edge[i];

usr.sbin/unbound/testcode/unitecs.c

132

if ((r = addrtree_inconsistent_subtree(tree, edge, 1)) != 0)

usr.sbin/unbound/testcode/unitecs.c

94

static int addrtree_inconsistent_subtree(struct addrtree* tree,

usr.sbin/unbound/testcode/unitmain.c

703

struct rbtree_type* tree = respip_set_get_tree(set);

usr.sbin/unbound/testcode/unitmain.c

711

node = (struct resp_addr*)addr_tree_find(tree, &addr, addrlen, net);

usr.sbin/unbound/testcode/unitmain.c

721

unit_assert(actions_len == (int)tree->count);

usr.sbin/unbound/testcode/unitmain.c

847

struct rbtree_type* tree;

usr.sbin/unbound/testcode/unitmain.c

852

tree = respip_set_get_tree(set);

usr.sbin/unbound/testcode/unitmain.c

853

node = (struct resp_addr*)addr_tree_find(tree, &addr, addrlen, net);

usr.sbin/unbound/testcode/unitneg.c

251

if(neg->tree.count == 0) {

usr.sbin/unbound/testcode/unitneg.c

257

walk = rbtree_first(&neg->tree); /* first highest parent, big count */

usr.sbin/unbound/testcode/unitneg.c

263

walk = rbtree_first(&neg->tree);

usr.sbin/unbound/testcode/unitneg.c

283

walk = rbtree_first(&z->tree); /* first is highest parent */

usr.sbin/unbound/testcode/unitneg.c

289

walk = rbtree_first(&z->tree);

usr.sbin/unbound/testcode/unitneg.c

314

RBTREE_FOR(z, struct val_neg_zone*, &neg->tree) {

usr.sbin/unbound/testcode/unitneg.c

315

res += z->tree.count;

usr.sbin/unbound/testcode/unitneg.c

326

RBTREE_FOR(z, struct val_neg_zone*, &neg->tree) {

usr.sbin/unbound/testcode/unitneg.c

328

d = (struct val_neg_data*)rbtree_first(&z->tree);

usr.sbin/unbound/testcode/unitneg.c

370

RBTREE_FOR(d, struct val_neg_data*, &zone->tree) {

usr.sbin/unbound/testcode/unitneg.c

385

RBTREE_FOR(z, struct val_neg_zone*, &neg->tree) {

usr.sbin/unbound/testcode/unitneg.c

422

RBTREE_FOR(d, struct val_neg_data*, &zone->tree) {

usr.sbin/unbound/testcode/unitneg.c

432

unit_assert(zone->tree.cmp == &val_neg_data_compare);

usr.sbin/unbound/testcode/unitneg.c

435

if(zone->tree.count == 0)

usr.sbin/unbound/testcode/unitneg.c

443

(int)zone->tree.count);

usr.sbin/unbound/testcode/unitneg.c

480

unit_assert(neg->tree.cmp == &val_neg_zone_compare);

usr.sbin/unbound/testcode/unitneg.c

482

if(neg->tree.count == 0) {

usr.sbin/unbound/testcode/unitneg.c

484

unit_assert(neg->tree.count == 0);

usr.sbin/unbound/testcode/unitneg.c

495

RBTREE_FOR(z, struct val_neg_zone*, &neg->tree) {

usr.sbin/unbound/testcode/unitneg.c

62

printf("%d zones\n", (int)neg->tree.count);

usr.sbin/unbound/testcode/unitneg.c

63

RBTREE_FOR(z, struct val_neg_zone*, &neg->tree) {

usr.sbin/unbound/testcode/unitneg.c

68

(int)z->tree.count);

usr.sbin/unbound/testcode/unitneg.c

70

RBTREE_FOR(z, struct val_neg_zone*, &neg->tree) {

usr.sbin/unbound/testcode/unitneg.c

76

(int)z->tree.count);

usr.sbin/unbound/testcode/unitneg.c

85

RBTREE_FOR(d, struct val_neg_data*, &z->tree) {

usr.sbin/unbound/util/data/msgencode.c

111

compress_tree_search(struct compress_tree_node** tree, uint8_t* dname,

usr.sbin/unbound/util/data/msgencode.c

116

struct compress_tree_node* p = *tree;

usr.sbin/unbound/util/data/msgencode.c

118

struct compress_tree_node** prev = tree;

usr.sbin/unbound/util/data/msgencode.c

151

compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname,

usr.sbin/unbound/util/data/msgencode.c

158

if(compress_tree_search(tree, dname, labs, &p, &m, insertpt)) {

usr.sbin/unbound/util/data/msgencode.c

292

struct regional* region, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

301

(p = compress_tree_lookup(tree, key->rk.dname,

usr.sbin/unbound/util/data/msgencode.c

345

struct regional* region, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

352

(p = compress_tree_lookup(tree, dname, labs, &insertpt))) {

usr.sbin/unbound/util/data/msgencode.c

380

struct regional* region, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

396

tree, compress_count)) != RETVAL_OK)

usr.sbin/unbound/util/data/msgencode.c

463

int do_data, int do_sig, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

493

if((r=compress_owner(key, pkt, region, tree,

usr.sbin/unbound/util/data/msgencode.c

505

data->rr_len[j], region, tree, c,

usr.sbin/unbound/util/data/msgencode.c

527

pkt, owner_labs, region, tree,

usr.sbin/unbound/util/data/msgencode.c

559

struct regional* region, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

576

pkt, num_rrs, timenow, region, 1, 1, tree,

usr.sbin/unbound/util/data/msgencode.c

589

pkt, num_rrs, timenow, region, 1, 0, tree,

usr.sbin/unbound/util/data/msgencode.c

600

pkt, num_rrs, timenow, region, 0, 1, tree,

usr.sbin/unbound/util/data/msgencode.c

613

insert_query(struct query_info* qinfo, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

625

sldns_buffer_position(buffer), region, NULL, tree))

usr.sbin/unbound/util/data/msgencode.c

691

struct compress_tree_node* tree = 0;

usr.sbin/unbound/util/data/msgencode.c

710

if((r=insert_query(qinfo, &tree, buffer, region)) !=

usr.sbin/unbound/util/data/msgencode.c

740

timezero, region, &tree, LDNS_SECTION_ANSWER,

usr.sbin/unbound/util/data/msgencode.c

755

0, timenow, region, &tree, LDNS_SECTION_ANSWER, qinfo->qtype,

usr.sbin/unbound/util/data/msgencode.c

772

rep->an_numrrsets, timenow, region, &tree,

usr.sbin/unbound/util/data/msgencode.c

790

&tree, LDNS_SECTION_ADDITIONAL, qinfo->qtype,

usr.sbin/unbound/util/edns.c

128

edns_string_addr_lookup(rbtree_type* tree, struct sockaddr_storage* addr,

usr.sbin/unbound/util/edns.c

131

return (struct edns_string_addr*)addr_tree_lookup(tree, addr, addrlen);

usr.sbin/unbound/util/edns.c

145

rbtree_type tree = edns_strings->client_strings;

usr.sbin/unbound/util/edns.c

152

data->client_strings = tree;

usr.sbin/unbound/util/edns.h

141

edns_string_addr_lookup(rbtree_type* tree, struct sockaddr_storage* addr,

usr.sbin/unbound/util/rbtree.c

622

traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),

usr.sbin/unbound/util/rbtree.c

625

traverse_post(func, arg, tree->root);

usr.sbin/unbound/util/rbtree.h

189

void traverse_postorder(rbtree_type* tree, void (*func)(rbnode_type*, void*),

usr.sbin/unbound/util/storage/dnstree.c

106

return rbtree_insert(tree, &node->node) != NULL;

usr.sbin/unbound/util/storage/dnstree.c

109

int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,

usr.sbin/unbound/util/storage/dnstree.c

117

return rbtree_insert(tree, &node->node) != NULL;

usr.sbin/unbound/util/storage/dnstree.c

147

void addr_tree_init_parents(rbtree_type* tree)

usr.sbin/unbound/util/storage/dnstree.c

150

(struct addr_tree_node*)rbtree_first(tree));

usr.sbin/unbound/util/storage/dnstree.c

153

void name_tree_init_parents(rbtree_type* tree)

usr.sbin/unbound/util/storage/dnstree.c

157

RBTREE_FOR(node, struct name_tree_node*, tree) {

usr.sbin/unbound/util/storage/dnstree.c

179

struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,

usr.sbin/unbound/util/storage/dnstree.c

188

return (struct name_tree_node*)rbtree_search(tree, &key);

usr.sbin/unbound/util/storage/dnstree.c

191

struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,

usr.sbin/unbound/util/storage/dnstree.c

202

if(rbtree_find_less_equal(tree, &key, &res)) {

usr.sbin/unbound/util/storage/dnstree.c

223

struct addr_tree_node* addr_tree_lookup(rbtree_type* tree,

usr.sbin/unbound/util/storage/dnstree.c

233

if(rbtree_find_less_equal(tree, &key, &res)) {

usr.sbin/unbound/util/storage/dnstree.c

254

struct addr_tree_node* addr_tree_find(rbtree_type* tree,

usr.sbin/unbound/util/storage/dnstree.c

263

res = rbtree_search(tree, &key);

usr.sbin/unbound/util/storage/dnstree.c

268

name_tree_next_root(rbtree_type* tree, uint16_t* dclass)

usr.sbin/unbound/util/storage/dnstree.c

275

n = rbtree_first(tree);

usr.sbin/unbound/util/storage/dnstree.c

285

return name_tree_next_root(tree, dclass);

usr.sbin/unbound/util/storage/dnstree.c

296

if(rbtree_find_less_equal(tree, &key, &n)) {

usr.sbin/unbound/util/storage/dnstree.c

313

return name_tree_next_root(tree, dclass);

usr.sbin/unbound/util/storage/dnstree.c

82

void name_tree_init(rbtree_type* tree)

usr.sbin/unbound/util/storage/dnstree.c

84

rbtree_init(tree, &name_tree_compare);

usr.sbin/unbound/util/storage/dnstree.c

87

void addr_tree_init(rbtree_type* tree)

usr.sbin/unbound/util/storage/dnstree.c

89

rbtree_init(tree, &addr_tree_compare);

usr.sbin/unbound/util/storage/dnstree.c

92

void addr_tree_addrport_init(rbtree_type* tree)

usr.sbin/unbound/util/storage/dnstree.c

94

rbtree_init(tree, &addr_tree_addrport_compare);

usr.sbin/unbound/util/storage/dnstree.c

97

int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,

usr.sbin/unbound/util/storage/dnstree.h

108

int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,

usr.sbin/unbound/util/storage/dnstree.h

116

void name_tree_init_parents(rbtree_type* tree);

usr.sbin/unbound/util/storage/dnstree.h

127

struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,

usr.sbin/unbound/util/storage/dnstree.h

139

struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,

usr.sbin/unbound/util/storage/dnstree.h

148

int name_tree_next_root(rbtree_type* tree, uint16_t* dclass);

usr.sbin/unbound/util/storage/dnstree.h

154

void addr_tree_init(rbtree_type* tree);

usr.sbin/unbound/util/storage/dnstree.h

161

void addr_tree_addrport_init(rbtree_type* tree);

usr.sbin/unbound/util/storage/dnstree.h

173

int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,

usr.sbin/unbound/util/storage/dnstree.h

181

void addr_tree_init_parents(rbtree_type* tree);

usr.sbin/unbound/util/storage/dnstree.h

197

struct addr_tree_node* addr_tree_lookup(rbtree_type* tree,

usr.sbin/unbound/util/storage/dnstree.h

208

struct addr_tree_node* addr_tree_find(rbtree_type* tree,

usr.sbin/unbound/util/storage/dnstree.h

94

void name_tree_init(rbtree_type* tree);

usr.sbin/unbound/util/tcp_conn_limit.c

147

addr_tree_init(&tcl->tree);

usr.sbin/unbound/util/tcp_conn_limit.c

150

addr_tree_init_parents(&tcl->tree);

usr.sbin/unbound/util/tcp_conn_limit.c

185

return (struct tcl_addr*)addr_tree_lookup(&tcl->tree,

usr.sbin/unbound/util/tcp_conn_limit.c

199

rbtree_type oldtree = tcl->tree;

usr.sbin/unbound/util/tcp_conn_limit.c

201

tcl->tree = data->tree;

usr.sbin/unbound/util/tcp_conn_limit.c

203

data->tree = oldtree;

usr.sbin/unbound/util/tcp_conn_limit.c

80

traverse_postorder(&tcl->tree, tcl_list_free_node, NULL);

usr.sbin/unbound/util/tcp_conn_limit.c

97

if(!addr_tree_insert(&tcl->tree, &node->node, addr, addrlen, net)) {

usr.sbin/unbound/util/tcp_conn_limit.h

60

rbtree_type tree;

usr.sbin/unbound/validator/autotrust.c

2089

tp2 = (struct trust_anchor*)rbtree_search(env->anchors->tree, &key);

usr.sbin/unbound/validator/autotrust.c

2146

del_tp = (struct trust_anchor*)rbtree_delete(env->anchors->tree, &key);

usr.sbin/unbound/validator/autotrust.c

2346

RBTREE_FOR(tp, struct trust_anchor*, anchors->tree) {

usr.sbin/unbound/validator/autotrust.c

355

if(!rbtree_insert(anchors->tree, &tp->node)) {

usr.sbin/unbound/validator/autotrust.c

367

(void)rbtree_delete(anchors->tree, tp);

usr.sbin/unbound/validator/val_anchor.c

1035

(void)rbtree_delete(anchors->tree, &ta->node);

usr.sbin/unbound/validator/val_anchor.c

1149

if(rbtree_find_less_equal(anchors->tree, &key, &res)) {

usr.sbin/unbound/validator/val_anchor.c

1202

RBTREE_FOR(ta, struct trust_anchor*, anchors->tree) {

usr.sbin/unbound/validator/val_anchor.c

1235

if(rbtree_search(anchors->tree, &key)) {

usr.sbin/unbound/validator/val_anchor.c

1262

if(!(ta=(struct trust_anchor*)rbtree_search(anchors->tree, &key))) {

usr.sbin/unbound/validator/val_anchor.c

1278

(void)rbtree_delete(anchors->tree, &ta->node);

usr.sbin/unbound/validator/val_anchor.c

1370

ta=(struct trust_anchor*)rbtree_first(anchors->tree);

usr.sbin/unbound/validator/val_anchor.c

1395

oldtree = anchors->tree;

usr.sbin/unbound/validator/val_anchor.c

1398

anchors->tree = data->tree;

usr.sbin/unbound/validator/val_anchor.c

1401

data->tree = oldtree;

usr.sbin/unbound/validator/val_anchor.c

147

if(anchors->tree)

usr.sbin/unbound/validator/val_anchor.c

148

traverse_postorder(anchors->tree, anchors_delfunc, NULL);

usr.sbin/unbound/validator/val_anchor.c

149

free(anchors->tree);

usr.sbin/unbound/validator/val_anchor.c

161

RBTREE_FOR(node, struct trust_anchor*, anchors->tree) {

usr.sbin/unbound/validator/val_anchor.c

209

n = rbtree_search(anchors->tree, &key);

usr.sbin/unbound/validator/val_anchor.c

250

rbtree_insert(anchors->tree, &ta->node);

usr.sbin/unbound/validator/val_anchor.c

81

a->tree = rbtree_create(anchor_cmp);

usr.sbin/unbound/validator/val_anchor.c

82

if(!a->tree) {

usr.sbin/unbound/validator/val_anchor.c

996

ta=(struct trust_anchor*)rbtree_first(anchors->tree);

usr.sbin/unbound/validator/val_anchor.h

69

rbtree_type* tree;

usr.sbin/unbound/validator/val_neg.c

1017

if(zone->tree.count == 0) {

usr.sbin/unbound/validator/val_neg.c

1228

if(!data && zone->tree.count != 0) {

usr.sbin/unbound/validator/val_neg.c

1231

data = (struct val_neg_data*)rbtree_last(&zone->tree);

usr.sbin/unbound/validator/val_neg.c

127

traverse_postorder(&z->tree, &neg_clear_datas, NULL);

usr.sbin/unbound/validator/val_neg.c

138

traverse_postorder(&neg->tree, &neg_clear_zones, NULL);

usr.sbin/unbound/validator/val_neg.c

217

(void)rbtree_delete(&neg->tree, &p->node);

usr.sbin/unbound/validator/val_neg.c

252

(void)rbtree_delete(&z->tree, &p->node);

usr.sbin/unbound/validator/val_neg.c

260

if(z->tree.count == 0) {

usr.sbin/unbound/validator/val_neg.c

292

rbtree_search(&neg->tree, lookfor.node.key);

usr.sbin/unbound/validator/val_neg.c

315

rbtree_search(&zone->tree, lookfor.node.key);

usr.sbin/unbound/validator/val_neg.c

381

if(rbtree_find_less_equal(&neg->tree, &key, &res)) {

usr.sbin/unbound/validator/val_neg.c

420

if(rbtree_find_less_equal(&zone->tree, &key, &res)) {

usr.sbin/unbound/validator/val_neg.c

467

rbtree_init(&zone->tree, &val_neg_data_compare);

usr.sbin/unbound/validator/val_neg.c

556

(void)rbtree_insert(&neg->tree, &p->node);

usr.sbin/unbound/validator/val_neg.c

794

(void)rbtree_insert(&zone->tree, &p->node);

usr.sbin/unbound/validator/val_neg.c

933

if(zone->tree.count == 0) {

usr.sbin/unbound/validator/val_neg.c

958

if(rbtree_find_less_equal(&zone->tree, &key, &r)) {

usr.sbin/unbound/validator/val_neg.c

97

rbtree_init(&neg->tree, &val_neg_zone_compare);

usr.sbin/unbound/validator/val_neg.h

123

rbtree_type tree;

usr.sbin/unbound/validator/val_neg.h

72

rbtree_type tree;