sbin/unwind/libunbound/util/rbtree.c

100

rbtree->cmp = cmpf;

sbin/unwind/libunbound/util/rbtree.c

108

rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node)

sbin/unwind/libunbound/util/rbtree.c

124

rbtree->root = right;

sbin/unwind/libunbound/util/rbtree.c

135

rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node)

sbin/unwind/libunbound/util/rbtree.c

151

rbtree->root = left;

sbin/unwind/libunbound/util/rbtree.c

158

rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node)

sbin/unwind/libunbound/util/rbtree.c

163

while (node != rbtree->root && node->parent->color == RED) {

sbin/unwind/libunbound/util/rbtree.c

183

rbtree_rotate_left(rbtree, node);

sbin/unwind/libunbound/util/rbtree.c

188

rbtree_rotate_right(rbtree, node->parent->parent);

sbin/unwind/libunbound/util/rbtree.c

208

rbtree_rotate_right(rbtree, node);

sbin/unwind/libunbound/util/rbtree.c

213

rbtree_rotate_left(rbtree, node->parent->parent);

sbin/unwind/libunbound/util/rbtree.c

217

rbtree->root->color = BLACK;

sbin/unwind/libunbound/util/rbtree.c

228

rbtree_insert (rbtree_type *rbtree, rbnode_type *data)

sbin/unwind/libunbound/util/rbtree.c

234

rbnode_type *node = rbtree->root;

sbin/unwind/libunbound/util/rbtree.c

237

fptr_ok(fptr_whitelist_rbtree_cmp(rbtree->cmp));

sbin/unwind/libunbound/util/rbtree.c

241

if ((r = rbtree->cmp(data->key, node->key)) == 0) {

sbin/unwind/libunbound/util/rbtree.c

257

rbtree->count++;

sbin/unwind/libunbound/util/rbtree.c

267

rbtree->root = data;

sbin/unwind/libunbound/util/rbtree.c

271

rbtree_insert_fixup(rbtree, data);

sbin/unwind/libunbound/util/rbtree.c

281

rbtree_search (rbtree_type *rbtree, const void *key)

sbin/unwind/libunbound/util/rbtree.c

285

if (rbtree_find_less_equal(rbtree, key, &node)) {

sbin/unwind/libunbound/util/rbtree.c

305

static void change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent,

sbin/unwind/libunbound/util/rbtree.c

310

log_assert(rbtree->root == old);

sbin/unwind/libunbound/util/rbtree.c

311

if(rbtree->root == old) rbtree->root = new;

sbin/unwind/libunbound/util/rbtree.c

329

rbtree_delete(rbtree_type *rbtree, const void *key)

sbin/unwind/libunbound/util/rbtree.c

333

if((to_delete = rbtree_search(rbtree, key)) == 0) return 0;

sbin/unwind/libunbound/util/rbtree.c

334

rbtree->count--;

sbin/unwind/libunbound/util/rbtree.c

352

change_parent_ptr(rbtree, to_delete->parent, to_delete, smright);

sbin/unwind/libunbound/util/rbtree.c

354

change_parent_ptr(rbtree, smright->parent, smright, to_delete);

sbin/unwind/libunbound/util/rbtree.c

384

change_parent_ptr(rbtree, to_delete->parent, to_delete, child);

sbin/unwind/libunbound/util/rbtree.c

396

else rbtree_delete_fixup(rbtree, child, to_delete->parent);

sbin/unwind/libunbound/util/rbtree.c

406

static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,

sbin/unwind/libunbound/util/rbtree.c

429

rbtree_rotate_right(rbtree, child_parent);

sbin/unwind/libunbound/util/rbtree.c

430

else rbtree_rotate_left(rbtree, child_parent);

sbin/unwind/libunbound/util/rbtree.c

475

rbtree_rotate_left(rbtree, sibling);

sbin/unwind/libunbound/util/rbtree.c

487

rbtree_rotate_right(rbtree, sibling);

sbin/unwind/libunbound/util/rbtree.c

500

rbtree_rotate_right(rbtree, child_parent);

sbin/unwind/libunbound/util/rbtree.c

506

rbtree_rotate_left(rbtree, child_parent);

sbin/unwind/libunbound/util/rbtree.c

511

rbtree_find_less_equal(rbtree_type *rbtree, const void *key,

sbin/unwind/libunbound/util/rbtree.c

520

node = rbtree->root;

sbin/unwind/libunbound/util/rbtree.c

523

fptr_ok(fptr_whitelist_rbtree_cmp(rbtree->cmp));

sbin/unwind/libunbound/util/rbtree.c

527

r = rbtree->cmp(key, node->key);

sbin/unwind/libunbound/util/rbtree.c

549

rbtree_first (rbtree_type *rbtree)

sbin/unwind/libunbound/util/rbtree.c

553

for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left);

sbin/unwind/libunbound/util/rbtree.c

558

rbtree_last (rbtree_type *rbtree)

sbin/unwind/libunbound/util/rbtree.c

562

for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);

sbin/unwind/libunbound/util/rbtree.c

62

static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);

sbin/unwind/libunbound/util/rbtree.c

64

static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);

sbin/unwind/libunbound/util/rbtree.c

66

static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);

sbin/unwind/libunbound/util/rbtree.c

68

static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,

sbin/unwind/libunbound/util/rbtree.c

80

rbtree_type *rbtree;

sbin/unwind/libunbound/util/rbtree.c

83

rbtree = (rbtree_type *) malloc(sizeof(rbtree_type));

sbin/unwind/libunbound/util/rbtree.c

84

if (!rbtree) {

sbin/unwind/libunbound/util/rbtree.c

89

rbtree_init(rbtree, cmpf);

sbin/unwind/libunbound/util/rbtree.c

91

return rbtree;

sbin/unwind/libunbound/util/rbtree.c

95

rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *))

sbin/unwind/libunbound/util/rbtree.c

98

rbtree->root = RBTREE_NULL;

sbin/unwind/libunbound/util/rbtree.c

99

rbtree->count = 0;

sbin/unwind/libunbound/util/rbtree.h

102

void rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *));

sbin/unwind/libunbound/util/rbtree.h

110

rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);

sbin/unwind/libunbound/util/rbtree.h

119

rbnode_type *rbtree_delete(rbtree_type *rbtree, const void *key);

sbin/unwind/libunbound/util/rbtree.h

127

rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);

sbin/unwind/libunbound/util/rbtree.h

138

int rbtree_find_less_equal(rbtree_type *rbtree, const void *key,

sbin/unwind/libunbound/util/rbtree.h

146

rbnode_type *rbtree_first(rbtree_type *rbtree);

sbin/unwind/libunbound/util/rbtree.h

153

rbnode_type *rbtree_last(rbtree_type *rbtree);

sbin/unwind/libunbound/util/rbtree.h

160

rbnode_type *rbtree_next(rbnode_type *rbtree);

sbin/unwind/libunbound/util/rbtree.h

167

rbnode_type *rbtree_previous(rbnode_type *rbtree);

sbin/unwind/libunbound/util/rbtree.h

173

#define RBTREE_FOR(node, type, rbtree) \

sbin/unwind/libunbound/util/rbtree.h

174

for(node=(type)rbtree_first(rbtree); \

sys/uvm/uvm_addr.c

1411

RBT_GENERATE(uaddr_free_rbtree, vm_map_entry, dfree.rbtree,

sys/uvm/uvm_addr.h

109

RBT_PROTOTYPE(uaddr_free_rbtree, vm_map_entry, dfree.rbtree,

sys/uvm/uvm_map.h

138

RBT_ENTRY(vm_map_entry) rbtree; /* Link freespace tree. */

usr.sbin/nsd/ixfr.c

58

struct rbtree tree;

usr.sbin/nsd/ixfr.h

31

struct rbtree* data;

usr.sbin/nsd/rbtree.c

102

if (!rbtree) {

usr.sbin/nsd/rbtree.c

119

rbtree->root = left;

usr.sbin/nsd/rbtree.c

126

rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node)

usr.sbin/nsd/rbtree.c

131

if (!rbtree) {

usr.sbin/nsd/rbtree.c

136

while (node != rbtree->root && node->parent->color == RED) {

usr.sbin/nsd/rbtree.c

156

rbtree_rotate_left(rbtree, node);

usr.sbin/nsd/rbtree.c

161

rbtree_rotate_right(rbtree, node->parent->parent);

usr.sbin/nsd/rbtree.c

181

rbtree_rotate_right(rbtree, node);

usr.sbin/nsd/rbtree.c

186

rbtree_rotate_left(rbtree, node->parent->parent);

usr.sbin/nsd/rbtree.c

190

rbtree->root->color = BLACK;

usr.sbin/nsd/rbtree.c

201

rbtree_insert (rbtree_type *rbtree, rbnode_type *data)

usr.sbin/nsd/rbtree.c

209

if (!rbtree) {

usr.sbin/nsd/rbtree.c

214

node = rbtree->root;

usr.sbin/nsd/rbtree.c

220

if ((r = rbtree->cmp(data->key, node->key)) == 0) {

usr.sbin/nsd/rbtree.c

236

rbtree->count++;

usr.sbin/nsd/rbtree.c

246

rbtree->root = data;

usr.sbin/nsd/rbtree.c

250

rbtree_insert_fixup(rbtree, data);

usr.sbin/nsd/rbtree.c

260

rbtree_search (rbtree_type *rbtree, const void *key)

usr.sbin/nsd/rbtree.c

265

if (!rbtree) {

usr.sbin/nsd/rbtree.c

269

if (rbtree_find_less_equal(rbtree, key, &node)) {

usr.sbin/nsd/rbtree.c

28

static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);

usr.sbin/nsd/rbtree.c

287

static void change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent, rbnode_type* old, rbnode_type* new)

usr.sbin/nsd/rbtree.c

29

static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);

usr.sbin/nsd/rbtree.c

290

if (!rbtree) {

usr.sbin/nsd/rbtree.c

296

assert(rbtree->root == old);

usr.sbin/nsd/rbtree.c

297

if(rbtree->root == old) rbtree->root = new;

usr.sbin/nsd/rbtree.c

30

static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);

usr.sbin/nsd/rbtree.c

31

static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child, rbnode_type* child_parent);

usr.sbin/nsd/rbtree.c

313

rbtree_delete(rbtree_type *rbtree, const void *key)

usr.sbin/nsd/rbtree.c

319

if (!rbtree) {

usr.sbin/nsd/rbtree.c

323

if((to_delete = rbtree_search(rbtree, key)) == 0) return 0;

usr.sbin/nsd/rbtree.c

324

rbtree->count--;

usr.sbin/nsd/rbtree.c

342

change_parent_ptr(rbtree, to_delete->parent, to_delete, smright);

usr.sbin/nsd/rbtree.c

344

change_parent_ptr(rbtree, smright->parent, smright, to_delete);

usr.sbin/nsd/rbtree.c

374

change_parent_ptr(rbtree, to_delete->parent, to_delete, child);

usr.sbin/nsd/rbtree.c

386

else rbtree_delete_fixup(rbtree, child, to_delete->parent);

usr.sbin/nsd/rbtree.c

396

static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child, rbnode_type* child_parent)

usr.sbin/nsd/rbtree.c

402

if (!rbtree) {

usr.sbin/nsd/rbtree.c

42

rbtree_type *rbtree;

usr.sbin/nsd/rbtree.c

423

rbtree_rotate_right(rbtree, child_parent);

usr.sbin/nsd/rbtree.c

424

else rbtree_rotate_left(rbtree, child_parent);

usr.sbin/nsd/rbtree.c

45

rbtree = (rbtree_type *) region_alloc(region, sizeof(rbtree_type));

usr.sbin/nsd/rbtree.c

46

if (!rbtree) {

usr.sbin/nsd/rbtree.c

469

rbtree_rotate_left(rbtree, sibling);

usr.sbin/nsd/rbtree.c

481

rbtree_rotate_right(rbtree, sibling);

usr.sbin/nsd/rbtree.c

494

rbtree_rotate_right(rbtree, child_parent);

usr.sbin/nsd/rbtree.c

500

rbtree_rotate_left(rbtree, child_parent);

usr.sbin/nsd/rbtree.c

505

rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result)

usr.sbin/nsd/rbtree.c

51

rbtree->root = RBTREE_NULL;

usr.sbin/nsd/rbtree.c

513

if (!rbtree) {

usr.sbin/nsd/rbtree.c

519

node = rbtree->root;

usr.sbin/nsd/rbtree.c

52

rbtree->count = 0;

usr.sbin/nsd/rbtree.c

525

r = rbtree->cmp(key, node->key);

usr.sbin/nsd/rbtree.c

53

rbtree->region = region;

usr.sbin/nsd/rbtree.c

54

rbtree->cmp = cmpf;

usr.sbin/nsd/rbtree.c

547

rbtree_first (rbtree_type *rbtree)

usr.sbin/nsd/rbtree.c

552

if (!rbtree) {

usr.sbin/nsd/rbtree.c

556

for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left);

usr.sbin/nsd/rbtree.c

56

return rbtree;

usr.sbin/nsd/rbtree.c

561

rbtree_last (rbtree_type *rbtree)

usr.sbin/nsd/rbtree.c

566

if (!rbtree) {

usr.sbin/nsd/rbtree.c

570

for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);

usr.sbin/nsd/rbtree.c

64

rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node)

usr.sbin/nsd/rbtree.c

69

if (!rbtree) {

usr.sbin/nsd/rbtree.c

86

rbtree->root = right;

usr.sbin/nsd/rbtree.c

97

rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node)

usr.sbin/nsd/rbtree.h

32

typedef struct rbtree rbtree_type;

usr.sbin/nsd/rbtree.h

51

rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);

usr.sbin/nsd/rbtree.h

54

rbnode_type *rbtree_delete(rbtree_type *rbtree, const void *key);

usr.sbin/nsd/rbtree.h

55

rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);

usr.sbin/nsd/rbtree.h

58

int rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result);

usr.sbin/nsd/rbtree.h

59

rbnode_type *rbtree_first(rbtree_type *rbtree);

usr.sbin/nsd/rbtree.h

60

rbnode_type *rbtree_last(rbtree_type *rbtree);

usr.sbin/nsd/rbtree.h

61

rbnode_type *rbtree_next(rbnode_type *rbtree);

usr.sbin/nsd/rbtree.h

62

rbnode_type *rbtree_previous(rbnode_type *rbtree);

usr.sbin/nsd/rbtree.h

64

#define RBTREE_WALK(rbtree, k, d) \

usr.sbin/nsd/rbtree.h

65

for((rbtree)->_node = rbtree_first(rbtree);\

usr.sbin/nsd/rbtree.h

66

(rbtree)->_node != RBTREE_NULL && ((k) = (rbtree)->_node->key) && \

usr.sbin/nsd/rbtree.h

67

((d) = (void *) (rbtree)->_node); (rbtree)->_node = rbtree_next((rbtree)->_node))

usr.sbin/nsd/rbtree.h

71

#define RBTREE_FOR(node, type, rbtree) \

usr.sbin/nsd/rbtree.h

72

for(node=(type)rbtree_first(rbtree); \

usr.sbin/unbound/util/rbtree.c

100

rbtree->cmp = cmpf;

usr.sbin/unbound/util/rbtree.c

108

rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node)

usr.sbin/unbound/util/rbtree.c

124

rbtree->root = right;

usr.sbin/unbound/util/rbtree.c

135

rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node)

usr.sbin/unbound/util/rbtree.c

151

rbtree->root = left;

usr.sbin/unbound/util/rbtree.c

158

rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node)

usr.sbin/unbound/util/rbtree.c

163

while (node != rbtree->root && node->parent->color == RED) {

usr.sbin/unbound/util/rbtree.c

183

rbtree_rotate_left(rbtree, node);

usr.sbin/unbound/util/rbtree.c

188

rbtree_rotate_right(rbtree, node->parent->parent);

usr.sbin/unbound/util/rbtree.c

208

rbtree_rotate_right(rbtree, node);

usr.sbin/unbound/util/rbtree.c

213

rbtree_rotate_left(rbtree, node->parent->parent);

usr.sbin/unbound/util/rbtree.c

217

rbtree->root->color = BLACK;

usr.sbin/unbound/util/rbtree.c

228

rbtree_insert (rbtree_type *rbtree, rbnode_type *data)

usr.sbin/unbound/util/rbtree.c

234

rbnode_type *node = rbtree->root;

usr.sbin/unbound/util/rbtree.c

237

fptr_ok(fptr_whitelist_rbtree_cmp(rbtree->cmp));

usr.sbin/unbound/util/rbtree.c

241

if ((r = rbtree->cmp(data->key, node->key)) == 0) {

usr.sbin/unbound/util/rbtree.c

257

rbtree->count++;

usr.sbin/unbound/util/rbtree.c

267

rbtree->root = data;

usr.sbin/unbound/util/rbtree.c

271

rbtree_insert_fixup(rbtree, data);

usr.sbin/unbound/util/rbtree.c

281

rbtree_search (rbtree_type *rbtree, const void *key)

usr.sbin/unbound/util/rbtree.c

285

if (rbtree_find_less_equal(rbtree, key, &node)) {

usr.sbin/unbound/util/rbtree.c

305

static void change_parent_ptr(rbtree_type* rbtree, rbnode_type* parent,

usr.sbin/unbound/util/rbtree.c

310

log_assert(rbtree->root == old);

usr.sbin/unbound/util/rbtree.c

311

if(rbtree->root == old) rbtree->root = new;

usr.sbin/unbound/util/rbtree.c

329

rbtree_delete(rbtree_type *rbtree, const void *key)

usr.sbin/unbound/util/rbtree.c

333

if((to_delete = rbtree_search(rbtree, key)) == 0) return 0;

usr.sbin/unbound/util/rbtree.c

334

rbtree->count--;

usr.sbin/unbound/util/rbtree.c

352

change_parent_ptr(rbtree, to_delete->parent, to_delete, smright);

usr.sbin/unbound/util/rbtree.c

354

change_parent_ptr(rbtree, smright->parent, smright, to_delete);

usr.sbin/unbound/util/rbtree.c

384

change_parent_ptr(rbtree, to_delete->parent, to_delete, child);

usr.sbin/unbound/util/rbtree.c

396

else rbtree_delete_fixup(rbtree, child, to_delete->parent);

usr.sbin/unbound/util/rbtree.c

406

static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,

usr.sbin/unbound/util/rbtree.c

429

rbtree_rotate_right(rbtree, child_parent);

usr.sbin/unbound/util/rbtree.c

430

else rbtree_rotate_left(rbtree, child_parent);

usr.sbin/unbound/util/rbtree.c

475

rbtree_rotate_left(rbtree, sibling);

usr.sbin/unbound/util/rbtree.c

487

rbtree_rotate_right(rbtree, sibling);

usr.sbin/unbound/util/rbtree.c

500

rbtree_rotate_right(rbtree, child_parent);

usr.sbin/unbound/util/rbtree.c

506

rbtree_rotate_left(rbtree, child_parent);

usr.sbin/unbound/util/rbtree.c

511

rbtree_find_less_equal(rbtree_type *rbtree, const void *key,

usr.sbin/unbound/util/rbtree.c

520

node = rbtree->root;

usr.sbin/unbound/util/rbtree.c

523

fptr_ok(fptr_whitelist_rbtree_cmp(rbtree->cmp));

usr.sbin/unbound/util/rbtree.c

527

r = rbtree->cmp(key, node->key);

usr.sbin/unbound/util/rbtree.c

549

rbtree_first (rbtree_type *rbtree)

usr.sbin/unbound/util/rbtree.c

553

for (node = rbtree->root; node->left != RBTREE_NULL; node = node->left);

usr.sbin/unbound/util/rbtree.c

558

rbtree_last (rbtree_type *rbtree)

usr.sbin/unbound/util/rbtree.c

562

for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);

usr.sbin/unbound/util/rbtree.c

62

static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);

usr.sbin/unbound/util/rbtree.c

64

static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);

usr.sbin/unbound/util/rbtree.c

66

static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);

usr.sbin/unbound/util/rbtree.c

68

static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,

usr.sbin/unbound/util/rbtree.c

80

rbtree_type *rbtree;

usr.sbin/unbound/util/rbtree.c

83

rbtree = (rbtree_type *) malloc(sizeof(rbtree_type));

usr.sbin/unbound/util/rbtree.c

84

if (!rbtree) {

usr.sbin/unbound/util/rbtree.c

89

rbtree_init(rbtree, cmpf);

usr.sbin/unbound/util/rbtree.c

91

return rbtree;

usr.sbin/unbound/util/rbtree.c

95

rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *))

usr.sbin/unbound/util/rbtree.c

98

rbtree->root = RBTREE_NULL;

usr.sbin/unbound/util/rbtree.c

99

rbtree->count = 0;

usr.sbin/unbound/util/rbtree.h

102

void rbtree_init(rbtree_type *rbtree, int (*cmpf)(const void *, const void *));

usr.sbin/unbound/util/rbtree.h

110

rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);

usr.sbin/unbound/util/rbtree.h

119

rbnode_type *rbtree_delete(rbtree_type *rbtree, const void *key);

usr.sbin/unbound/util/rbtree.h

127

rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);

usr.sbin/unbound/util/rbtree.h

138

int rbtree_find_less_equal(rbtree_type *rbtree, const void *key,

usr.sbin/unbound/util/rbtree.h

146

rbnode_type *rbtree_first(rbtree_type *rbtree);

usr.sbin/unbound/util/rbtree.h

153

rbnode_type *rbtree_last(rbtree_type *rbtree);

usr.sbin/unbound/util/rbtree.h

160

rbnode_type *rbtree_next(rbnode_type *rbtree);

usr.sbin/unbound/util/rbtree.h

167

rbnode_type *rbtree_previous(rbnode_type *rbtree);

usr.sbin/unbound/util/rbtree.h

173

#define RBTREE_FOR(node, type, rbtree) \

usr.sbin/unbound/util/rbtree.h

174

for(node=(type)rbtree_first(rbtree); \