suricata
tree.h File Reference
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

#define _T_ASSERT(a)
 
#define SPLAY_HEAD(name, type)
 
#define SPLAY_INITIALIZER(root)   { NULL }
 
#define SPLAY_INIT(root)
 
#define SPLAY_ENTRY(type)
 
#define SPLAY_LEFT(elm, field)   (elm)->field.spe_left
 
#define SPLAY_RIGHT(elm, field)   (elm)->field.spe_right
 
#define SPLAY_ROOT(head)   (head)->sph_root
 
#define SPLAY_EMPTY(head)   (SPLAY_ROOT(head) == NULL)
 
#define SPLAY_ROTATE_RIGHT(head, tmp, field)
 
#define SPLAY_ROTATE_LEFT(head, tmp, field)
 
#define SPLAY_LINKLEFT(head, tmp, field)
 
#define SPLAY_LINKRIGHT(head, tmp, field)
 
#define SPLAY_ASSEMBLE(head, node, left, right, field)
 
#define SPLAY_PROTOTYPE(name, type, field, cmp)
 
#define SPLAY_GENERATE(name, type, field, cmp)
 
#define SPLAY_NEGINF   -1
 
#define SPLAY_INF   1
 
#define SPLAY_INSERT(name, x, y)   name##_SPLAY_INSERT(x, y)
 
#define SPLAY_REMOVE(name, x, y)   name##_SPLAY_REMOVE(x, y)
 
#define SPLAY_FIND(name, x, y)   name##_SPLAY_FIND(x, y)
 
#define SPLAY_NEXT(name, x, y)   name##_SPLAY_NEXT(x, y)
 
#define SPLAY_MIN(name, x)
 
#define SPLAY_MAX(name, x)
 
#define SPLAY_FOREACH(x, name, head)
 
#define RB_HEAD(name, type)
 
#define RB_INITIALIZER(root)   { NULL }
 
#define RB_INIT(root)
 
#define RB_BLACK   0
 
#define RB_RED   1
 
#define RB_ENTRY(type)
 
#define RB_LEFT(elm, field)   (elm)->field.rbe_left
 
#define RB_RIGHT(elm, field)   (elm)->field.rbe_right
 
#define RB_PARENT(elm, field)   (elm)->field.rbe_parent
 
#define RB_COLOR(elm, field)   (elm)->field.rbe_color
 
#define RB_ROOT(head)   (head)->rbh_root
 
#define RB_EMPTY(head)   (RB_ROOT(head) == NULL)
 
#define RB_SET(elm, parent, field)
 
#define RB_SET_BLACKRED(black, red, field)
 
#define RB_AUGMENT(x)   do {} while (0)
 
#define RB_ROTATE_LEFT(head, elm, tmp, field)
 
#define RB_ROTATE_RIGHT(head, elm, tmp, field)
 
#define RB_PROTOTYPE(name, type, field, cmp)   RB_PROTOTYPE_INTERNAL(name, type, field, cmp,)
 
#define RB_PROTOTYPE_STATIC(name, type, field, cmp)   RB_PROTOTYPE_INTERNAL(name, type, field, cmp, __unused static)
 
#define RB_PROTOTYPE_INTERNAL(name, type, field, cmp, attr)
 
#define RB_PROTOTYPE_INSERT_COLOR(name, type, attr)   attr void name##_RB_INSERT_COLOR(struct name *, struct type *)
 
#define RB_PROTOTYPE_REMOVE_COLOR(name, type, attr)   attr void name##_RB_REMOVE_COLOR(struct name *, struct type *, struct type *)
 
#define RB_PROTOTYPE_REMOVE(name, type, attr)   attr struct type *name##_RB_REMOVE(struct name *, struct type *)
 
#define RB_PROTOTYPE_INSERT(name, type, attr)   attr struct type *name##_RB_INSERT(struct name *, struct type *)
 
#define RB_PROTOTYPE_FIND(name, type, attr)   attr struct type *name##_RB_FIND(struct name *, struct type *)
 
#define RB_PROTOTYPE_NFIND(name, type, attr)   attr struct type *name##_RB_NFIND(struct name *, struct type *)
 
#define RB_PROTOTYPE_NEXT(name, type, attr)   attr struct type *name##_RB_NEXT(struct type *)
 
#define RB_PROTOTYPE_PREV(name, type, attr)   attr struct type *name##_RB_PREV(struct type *)
 
#define RB_PROTOTYPE_MINMAX(name, type, attr)   attr struct type *name##_RB_MINMAX(struct name *, int)
 
#define RB_GENERATE(name, type, field, cmp)   RB_GENERATE_INTERNAL(name, type, field, cmp,)
 
#define RB_GENERATE_STATIC(name, type, field, cmp)   RB_GENERATE_INTERNAL(name, type, field, cmp, __unused static)
 
#define RB_GENERATE_INTERNAL(name, type, field, cmp, attr)
 
#define RB_GENERATE_INSERT_COLOR(name, type, field, attr)
 
#define RB_GENERATE_REMOVE_COLOR(name, type, field, attr)
 
#define RB_GENERATE_REMOVE(name, type, field, attr)
 
#define RB_GENERATE_INSERT(name, type, field, cmp, attr)
 
#define RB_GENERATE_FIND(name, type, field, cmp, attr)
 
#define RB_GENERATE_NFIND(name, type, field, cmp, attr)
 
#define RB_GENERATE_NEXT(name, type, field, attr)
 
#define RB_GENERATE_PREV(name, type, field, attr)
 
#define RB_GENERATE_MINMAX(name, type, field, attr)
 
#define RB_NEGINF   -1
 
#define RB_INF   1
 
#define RB_INSERT(name, x, y)   name##_RB_INSERT(x, y)
 
#define RB_REMOVE(name, x, y)   name##_RB_REMOVE(x, y)
 
#define RB_FIND(name, x, y)   name##_RB_FIND(x, y)
 
#define RB_NFIND(name, x, y)   name##_RB_NFIND(x, y)
 
#define RB_NEXT(name, x, y)   name##_RB_NEXT(y)
 
#define RB_PREV(name, x, y)   name##_RB_PREV(y)
 
#define RB_MIN(name, x)   name##_RB_MINMAX(x, RB_NEGINF)
 
#define RB_MAX(name, x)   name##_RB_MINMAX(x, RB_INF)
 
#define RB_FOREACH(x, name, head)
 
#define RB_FOREACH_FROM(x, name, y)
 
#define RB_FOREACH_SAFE(x, name, head, y)
 
#define RB_FOREACH_REVERSE(x, name, head)
 
#define RB_FOREACH_REVERSE_FROM(x, name, y)
 
#define RB_FOREACH_REVERSE_SAFE(x, name, head, y)
 

Macro Definition Documentation

◆ _T_ASSERT

#define _T_ASSERT (   a)

Definition at line 38 of file tree.h.

◆ RB_AUGMENT

#define RB_AUGMENT (   x)    do {} while (0)

Definition at line 341 of file tree.h.

◆ RB_BLACK

#define RB_BLACK   0

Definition at line 312 of file tree.h.

◆ RB_COLOR

#define RB_COLOR (   elm,
  field 
)    (elm)->field.rbe_color

Definition at line 325 of file tree.h.

◆ RB_EMPTY

#define RB_EMPTY (   head)    (RB_ROOT(head) == NULL)

Definition at line 327 of file tree.h.

◆ RB_ENTRY

#define RB_ENTRY (   type)
Value:
struct { \
struct type *rbe_left; /* left element */ \
struct type *rbe_right; /* right element */ \
struct type *rbe_parent; /* parent element */ \
int rbe_color; /* node color */ \
}

Definition at line 314 of file tree.h.

◆ RB_FIND

#define RB_FIND (   name,
  x,
 
)    name##_RB_FIND(x, y)

Definition at line 774 of file tree.h.

◆ RB_FOREACH

#define RB_FOREACH (   x,
  name,
  head 
)
Value:
for ((x) = RB_MIN(name, head); \
(x) != NULL; \
(x) = name##_RB_NEXT(x))

Definition at line 781 of file tree.h.

◆ RB_FOREACH_FROM

#define RB_FOREACH_FROM (   x,
  name,
 
)
Value:
for ((x) = (y); \
((x) != NULL) && ((y) = name##_RB_NEXT(x), (x) != NULL); \
(x) = (y))

Definition at line 786 of file tree.h.

◆ RB_FOREACH_REVERSE

#define RB_FOREACH_REVERSE (   x,
  name,
  head 
)
Value:
for ((x) = RB_MAX(name, head); \
(x) != NULL; \
(x) = name##_RB_PREV(x))

Definition at line 796 of file tree.h.

◆ RB_FOREACH_REVERSE_FROM

#define RB_FOREACH_REVERSE_FROM (   x,
  name,
 
)
Value:
for ((x) = (y); \
((x) != NULL) && ((y) = name##_RB_PREV(x), (x) != NULL); \
(x) = (y))

Definition at line 801 of file tree.h.

◆ RB_FOREACH_REVERSE_SAFE

#define RB_FOREACH_REVERSE_SAFE (   x,
  name,
  head,
 
)
Value:
for ((x) = RB_MAX(name, head); \
((x) != NULL) && ((y) = name##_RB_PREV(x), (x) != NULL); \
(x) = (y))

Definition at line 806 of file tree.h.

◆ RB_FOREACH_SAFE

#define RB_FOREACH_SAFE (   x,
  name,
  head,
 
)
Value:
for ((x) = RB_MIN(name, head); \
((x) != NULL) && ((y) = name##_RB_NEXT(x), (x) != NULL); \
(x) = (y))

Definition at line 791 of file tree.h.

◆ RB_GENERATE

#define RB_GENERATE (   name,
  type,
  field,
  cmp 
)    RB_GENERATE_INTERNAL(name, type, field, cmp,)

Definition at line 421 of file tree.h.

◆ RB_GENERATE_FIND

#define RB_GENERATE_FIND (   name,
  type,
  field,
  cmp,
  attr 
)
Value:
/* Finds the node with the same key as elm */ \
attr struct type * \
name##_RB_FIND(struct name *head, struct type *elm) \
{ \
struct type *tmp = RB_ROOT(head); \
int comp; \
while (tmp) { \
comp = cmp(elm, tmp); \
if (comp < 0) \
tmp = RB_LEFT(tmp, field); \
else if (comp > 0) \
tmp = RB_RIGHT(tmp, field); \
else \
return (tmp); \
} \
return (NULL); \
}

Definition at line 666 of file tree.h.

◆ RB_GENERATE_INSERT

#define RB_GENERATE_INSERT (   name,
  type,
  field,
  cmp,
  attr 
)
Value:
/* Inserts a node into the RB tree */ \
attr struct type * \
name##_RB_INSERT(struct name *head, struct type *elm) \
{ \
struct type *tmp; \
struct type *parent = NULL; \
int comp = 0; \
tmp = RB_ROOT(head); \
while (tmp) { \
parent = tmp; \
comp = (cmp)(elm, parent); \
if (comp < 0) \
tmp = RB_LEFT(tmp, field); \
else if (comp > 0) \
tmp = RB_RIGHT(tmp, field); \
else \
return (tmp); \
} \
RB_SET(elm, parent, field); \
if (parent != NULL) { \
if (comp < 0) \
RB_LEFT(parent, field) = elm; \
RB_RIGHT(parent, field) = elm; \
RB_AUGMENT(parent); \
RB_ROOT(head) = elm; \
name##_RB_INSERT_COLOR(head, elm); \
return (NULL); \
}

Definition at line 634 of file tree.h.

◆ RB_GENERATE_INSERT_COLOR

#define RB_GENERATE_INSERT_COLOR (   name,
  type,
  field,
  attr 
)

Definition at line 436 of file tree.h.

◆ RB_GENERATE_INTERNAL

#define RB_GENERATE_INTERNAL (   name,
  type,
  field,
  cmp,
  attr 
)
Value:
RB_GENERATE_INSERT_COLOR(name, type, field, attr) \
RB_GENERATE_REMOVE_COLOR(name, type, field, attr) \
RB_GENERATE_INSERT(name, type, field, cmp, attr) \
RB_GENERATE_REMOVE(name, type, field, attr) \
RB_GENERATE_FIND(name, type, field, cmp, attr) \
RB_GENERATE_NFIND(name, type, field, cmp, attr) \
RB_GENERATE_NEXT(name, type, field, attr) \
RB_GENERATE_PREV(name, type, field, attr) \
RB_GENERATE_MINMAX(name, type, field, attr)

Definition at line 425 of file tree.h.

◆ RB_GENERATE_MINMAX

#define RB_GENERATE_MINMAX (   name,
  type,
  field,
  attr 
)
Value:
attr struct type * \
name##_RB_MINMAX(struct name *head, int val) \
{ \
struct type *tmp = RB_ROOT(head); \
struct type *parent = NULL; \
while (tmp) { \
parent = tmp; \
if (val < 0) \
tmp = RB_LEFT(tmp, field); \
else \
tmp = RB_RIGHT(tmp, field); \
} \
return (parent); \
}

Definition at line 753 of file tree.h.

◆ RB_GENERATE_NEXT

#define RB_GENERATE_NEXT (   name,
  type,
  field,
  attr 
)
Value:
/* ARGSUSED */ \
attr struct type * \
name##_RB_NEXT(struct type *elm) \
{ \
if (RB_RIGHT(elm, field)) { \
elm = RB_RIGHT(elm, field); \
while (RB_LEFT(elm, field)) \
elm = RB_LEFT(elm, field); \
} else { \
if (RB_PARENT(elm, field) && \
(elm == RB_LEFT(RB_PARENT(elm, field), field))) \
elm = RB_PARENT(elm, field); \
else { \
while (RB_PARENT(elm, field) && \
(elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
elm = RB_PARENT(elm, field); \
elm = RB_PARENT(elm, field); \
} \
} \
return (elm); \
}

Definition at line 707 of file tree.h.

◆ RB_GENERATE_NFIND

#define RB_GENERATE_NFIND (   name,
  type,
  field,
  cmp,
  attr 
)
Value:
/* Finds the first node greater than or equal to the search key */ \
attr struct type * \
name##_RB_NFIND(struct name *head, struct type *elm) \
{ \
struct type *tmp = RB_ROOT(head); \
struct type *res = NULL; \
int comp; \
while (tmp) { \
comp = cmp(elm, tmp); \
if (comp < 0) { \
res = tmp; \
tmp = RB_LEFT(tmp, field); \
} \
else if (comp > 0) \
tmp = RB_RIGHT(tmp, field); \
else \
return (tmp); \
} \
return (res); \
}

Definition at line 685 of file tree.h.

◆ RB_GENERATE_PREV

#define RB_GENERATE_PREV (   name,
  type,
  field,
  attr 
)
Value:
/* ARGSUSED */ \
attr struct type * \
name##_RB_PREV(struct type *elm) \
{ \
if (RB_LEFT(elm, field)) { \
elm = RB_LEFT(elm, field); \
while (RB_RIGHT(elm, field)) \
elm = RB_RIGHT(elm, field); \
} else { \
if (RB_PARENT(elm, field) && \
(elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
elm = RB_PARENT(elm, field); \
else { \
while (RB_PARENT(elm, field) && \
(elm == RB_LEFT(RB_PARENT(elm, field), field)))\
elm = RB_PARENT(elm, field); \
elm = RB_PARENT(elm, field); \
} \
} \
return (elm); \
}

Definition at line 730 of file tree.h.

◆ RB_GENERATE_REMOVE

#define RB_GENERATE_REMOVE (   name,
  type,
  field,
  attr 
)

Definition at line 563 of file tree.h.

◆ RB_GENERATE_REMOVE_COLOR

#define RB_GENERATE_REMOVE_COLOR (   name,
  type,
  field,
  attr 
)

Definition at line 482 of file tree.h.

◆ RB_GENERATE_STATIC

#define RB_GENERATE_STATIC (   name,
  type,
  field,
  cmp 
)    RB_GENERATE_INTERNAL(name, type, field, cmp, __unused static)

Definition at line 423 of file tree.h.

◆ RB_HEAD

#define RB_HEAD (   name,
  type 
)
Value:
struct name { \
struct type *rbh_root; /* root of the tree */ \
}

Definition at line 300 of file tree.h.

◆ RB_INF

#define RB_INF   1

Definition at line 770 of file tree.h.

◆ RB_INIT

#define RB_INIT (   root)
Value:
do { \
(root)->rbh_root = NULL; \
} while (/*CONSTCOND*/ 0)

Definition at line 308 of file tree.h.

◆ RB_INITIALIZER

#define RB_INITIALIZER (   root)    { NULL }

Definition at line 305 of file tree.h.

◆ RB_INSERT

#define RB_INSERT (   name,
  x,
 
)    name##_RB_INSERT(x, y)

Definition at line 772 of file tree.h.

◆ RB_LEFT

#define RB_LEFT (   elm,
  field 
)    (elm)->field.rbe_left

Definition at line 322 of file tree.h.

◆ RB_MAX

#define RB_MAX (   name,
 
)    name##_RB_MINMAX(x, RB_INF)

Definition at line 779 of file tree.h.

◆ RB_MIN

#define RB_MIN (   name,
 
)    name##_RB_MINMAX(x, RB_NEGINF)

Definition at line 778 of file tree.h.

◆ RB_NEGINF

#define RB_NEGINF   -1

Definition at line 769 of file tree.h.

◆ RB_NEXT

#define RB_NEXT (   name,
  x,
 
)    name##_RB_NEXT(y)

Definition at line 776 of file tree.h.

◆ RB_NFIND

#define RB_NFIND (   name,
  x,
 
)    name##_RB_NFIND(x, y)

Definition at line 775 of file tree.h.

◆ RB_PARENT

#define RB_PARENT (   elm,
  field 
)    (elm)->field.rbe_parent

Definition at line 324 of file tree.h.

◆ RB_PREV

#define RB_PREV (   name,
  x,
 
)    name##_RB_PREV(y)

Definition at line 777 of file tree.h.

◆ RB_PROTOTYPE

#define RB_PROTOTYPE (   name,
  type,
  field,
  cmp 
)    RB_PROTOTYPE_INTERNAL(name, type, field, cmp,)

Definition at line 385 of file tree.h.

◆ RB_PROTOTYPE_FIND

#define RB_PROTOTYPE_FIND (   name,
  type,
  attr 
)    attr struct type *name##_RB_FIND(struct name *, struct type *)

Definition at line 407 of file tree.h.

◆ RB_PROTOTYPE_INSERT

#define RB_PROTOTYPE_INSERT (   name,
  type,
  attr 
)    attr struct type *name##_RB_INSERT(struct name *, struct type *)

Definition at line 405 of file tree.h.

◆ RB_PROTOTYPE_INSERT_COLOR

#define RB_PROTOTYPE_INSERT_COLOR (   name,
  type,
  attr 
)    attr void name##_RB_INSERT_COLOR(struct name *, struct type *)

Definition at line 399 of file tree.h.

◆ RB_PROTOTYPE_INTERNAL

#define RB_PROTOTYPE_INTERNAL (   name,
  type,
  field,
  cmp,
  attr 
)
Value:
RB_PROTOTYPE_REMOVE_COLOR(name, type, attr); \
RB_PROTOTYPE_INSERT(name, type, attr); \
RB_PROTOTYPE_REMOVE(name, type, attr); \
RB_PROTOTYPE_FIND(name, type, attr); \
RB_PROTOTYPE_NFIND(name, type, attr); \
RB_PROTOTYPE_NEXT(name, type, attr); \
RB_PROTOTYPE_PREV(name, type, attr); \
RB_PROTOTYPE_MINMAX(name, type, attr);

Definition at line 389 of file tree.h.

◆ RB_PROTOTYPE_MINMAX

#define RB_PROTOTYPE_MINMAX (   name,
  type,
  attr 
)    attr struct type *name##_RB_MINMAX(struct name *, int)

Definition at line 415 of file tree.h.

◆ RB_PROTOTYPE_NEXT

#define RB_PROTOTYPE_NEXT (   name,
  type,
  attr 
)    attr struct type *name##_RB_NEXT(struct type *)

Definition at line 411 of file tree.h.

◆ RB_PROTOTYPE_NFIND

#define RB_PROTOTYPE_NFIND (   name,
  type,
  attr 
)    attr struct type *name##_RB_NFIND(struct name *, struct type *)

Definition at line 409 of file tree.h.

◆ RB_PROTOTYPE_PREV

#define RB_PROTOTYPE_PREV (   name,
  type,
  attr 
)    attr struct type *name##_RB_PREV(struct type *)

Definition at line 413 of file tree.h.

◆ RB_PROTOTYPE_REMOVE

#define RB_PROTOTYPE_REMOVE (   name,
  type,
  attr 
)    attr struct type *name##_RB_REMOVE(struct name *, struct type *)

Definition at line 403 of file tree.h.

◆ RB_PROTOTYPE_REMOVE_COLOR

#define RB_PROTOTYPE_REMOVE_COLOR (   name,
  type,
  attr 
)    attr void name##_RB_REMOVE_COLOR(struct name *, struct type *, struct type *)

Definition at line 401 of file tree.h.

◆ RB_PROTOTYPE_STATIC

#define RB_PROTOTYPE_STATIC (   name,
  type,
  field,
  cmp 
)    RB_PROTOTYPE_INTERNAL(name, type, field, cmp, __unused static)

Definition at line 387 of file tree.h.

◆ RB_RED

#define RB_RED   1

Definition at line 313 of file tree.h.

◆ RB_REMOVE

#define RB_REMOVE (   name,
  x,
 
)    name##_RB_REMOVE(x, y)

Definition at line 773 of file tree.h.

◆ RB_RIGHT

#define RB_RIGHT (   elm,
  field 
)    (elm)->field.rbe_right

Definition at line 323 of file tree.h.

◆ RB_ROOT

#define RB_ROOT (   head)    (head)->rbh_root

Definition at line 326 of file tree.h.

◆ RB_ROTATE_LEFT

#define RB_ROTATE_LEFT (   head,
  elm,
  tmp,
  field 
)
Value:
do { \
(tmp) = RB_RIGHT(elm, field); \
if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field)) != NULL) { \
RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
} \
RB_AUGMENT(elm); \
if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \
if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
} else \
(head)->rbh_root = (tmp); \
RB_LEFT(tmp, field) = (elm); \
RB_PARENT(elm, field) = (tmp); \
RB_AUGMENT(tmp); \
if ((RB_PARENT(tmp, field))) \
RB_AUGMENT(RB_PARENT(tmp, field)); \
} while (/*CONSTCOND*/ 0)

Definition at line 344 of file tree.h.

◆ RB_ROTATE_RIGHT

#define RB_ROTATE_RIGHT (   head,
  elm,
  tmp,
  field 
)
Value:
do { \
(tmp) = RB_LEFT(elm, field); \
if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field)) != NULL) { \
RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
} \
RB_AUGMENT(elm); \
if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \
if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
} else \
(head)->rbh_root = (tmp); \
RB_RIGHT(tmp, field) = (elm); \
RB_PARENT(elm, field) = (tmp); \
RB_AUGMENT(tmp); \
if ((RB_PARENT(tmp, field))) \
RB_AUGMENT(RB_PARENT(tmp, field)); \
} while (/*CONSTCOND*/ 0)

Definition at line 364 of file tree.h.

◆ RB_SET

#define RB_SET (   elm,
  parent,
  field 
)
Value:
do { \
RB_PARENT(elm, field) = parent; \
RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
RB_COLOR(elm, field) = RB_RED; \
} while (/*CONSTCOND*/ 0)

Definition at line 329 of file tree.h.

◆ RB_SET_BLACKRED

#define RB_SET_BLACKRED (   black,
  red,
  field 
)
Value:
do { \
RB_COLOR(black, field) = RB_BLACK; \
RB_COLOR(red, field) = RB_RED; \
} while (/*CONSTCOND*/ 0)

Definition at line 335 of file tree.h.

◆ SPLAY_ASSEMBLE

#define SPLAY_ASSEMBLE (   head,
  node,
  left,
  right,
  field 
)
Value:
do { \
SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
} while (/*CONSTCOND*/ 0)

Definition at line 116 of file tree.h.

◆ SPLAY_EMPTY

#define SPLAY_EMPTY (   head)    (SPLAY_ROOT(head) == NULL)

Definition at line 89 of file tree.h.

◆ SPLAY_ENTRY

#define SPLAY_ENTRY (   type)
Value:
struct { \
struct type *spe_left; /* left element */ \
struct type *spe_right; /* right element */ \
}

Definition at line 80 of file tree.h.

◆ SPLAY_FIND

#define SPLAY_FIND (   name,
  x,
 
)    name##_SPLAY_FIND(x, y)

Definition at line 287 of file tree.h.

◆ SPLAY_FOREACH

#define SPLAY_FOREACH (   x,
  name,
  head 
)
Value:
for ((x) = SPLAY_MIN(name, head); \
(x) != NULL; \
(x) = SPLAY_NEXT(name, head, x))

Definition at line 294 of file tree.h.

◆ SPLAY_GENERATE

#define SPLAY_GENERATE (   name,
  type,
  field,
  cmp 
)

Definition at line 167 of file tree.h.

◆ SPLAY_HEAD

#define SPLAY_HEAD (   name,
  type 
)
Value:
struct name { \
struct type *sph_root; /* root of the tree */ \
}

Definition at line 68 of file tree.h.

◆ SPLAY_INF

#define SPLAY_INF   1

Definition at line 283 of file tree.h.

◆ SPLAY_INIT

#define SPLAY_INIT (   root)
Value:
do { \
(root)->sph_root = NULL; \
} while (/*CONSTCOND*/ 0)

Definition at line 76 of file tree.h.

◆ SPLAY_INITIALIZER

#define SPLAY_INITIALIZER (   root)    { NULL }

Definition at line 73 of file tree.h.

◆ SPLAY_INSERT

#define SPLAY_INSERT (   name,
  x,
 
)    name##_SPLAY_INSERT(x, y)

Definition at line 285 of file tree.h.

◆ SPLAY_LEFT

#define SPLAY_LEFT (   elm,
  field 
)    (elm)->field.spe_left

Definition at line 86 of file tree.h.

◆ SPLAY_LINKLEFT

#define SPLAY_LINKLEFT (   head,
  tmp,
  field 
)
Value:
do { \
SPLAY_LEFT(tmp, field) = (head)->sph_root; \
tmp = (head)->sph_root; \
(head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
} while (/*CONSTCOND*/ 0)

Definition at line 104 of file tree.h.

◆ SPLAY_LINKRIGHT

#define SPLAY_LINKRIGHT (   head,
  tmp,
  field 
)
Value:
do { \
SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
tmp = (head)->sph_root; \
(head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
} while (/*CONSTCOND*/ 0)

Definition at line 110 of file tree.h.

◆ SPLAY_MAX

#define SPLAY_MAX (   name,
 
)
Value:
(SPLAY_EMPTY(x) ? NULL \
: name##_SPLAY_MIN_MAX(x, SPLAY_INF))

Definition at line 291 of file tree.h.

◆ SPLAY_MIN

#define SPLAY_MIN (   name,
 
)
Value:
(SPLAY_EMPTY(x) ? NULL \
: name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF))

Definition at line 289 of file tree.h.

◆ SPLAY_NEGINF

#define SPLAY_NEGINF   -1

Definition at line 282 of file tree.h.

◆ SPLAY_NEXT

#define SPLAY_NEXT (   name,
  x,
 
)    name##_SPLAY_NEXT(x, y)

Definition at line 288 of file tree.h.

◆ SPLAY_PROTOTYPE

#define SPLAY_PROTOTYPE (   name,
  type,
  field,
  cmp 
)

Definition at line 125 of file tree.h.

◆ SPLAY_REMOVE

#define SPLAY_REMOVE (   name,
  x,
 
)    name##_SPLAY_REMOVE(x, y)

Definition at line 286 of file tree.h.

◆ SPLAY_RIGHT

#define SPLAY_RIGHT (   elm,
  field 
)    (elm)->field.spe_right

Definition at line 87 of file tree.h.

◆ SPLAY_ROOT

#define SPLAY_ROOT (   head)    (head)->sph_root

Definition at line 88 of file tree.h.

◆ SPLAY_ROTATE_LEFT

#define SPLAY_ROTATE_LEFT (   head,
  tmp,
  field 
)
Value:
do { \
SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
SPLAY_LEFT(tmp, field) = (head)->sph_root; \
(head)->sph_root = tmp; \
} while (/*CONSTCOND*/ 0)

Definition at line 98 of file tree.h.

◆ SPLAY_ROTATE_RIGHT

#define SPLAY_ROTATE_RIGHT (   head,
  tmp,
  field 
)
Value:
do { \
SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
(head)->sph_root = tmp; \
} while (/*CONSTCOND*/ 0)

Definition at line 92 of file tree.h.

RB_BLACK
#define RB_BLACK
Definition: tree.h:312
RB_PARENT
#define RB_PARENT(elm, field)
Definition: tree.h:324
SPLAY_NEGINF
#define SPLAY_NEGINF
Definition: tree.h:282
SPLAY_MIN
#define SPLAY_MIN(name, x)
Definition: tree.h:289
RB_RED
#define RB_RED
Definition: tree.h:313
RB_LEFT
#define RB_LEFT(elm, field)
Definition: tree.h:322
RB_MIN
#define RB_MIN(name, x)
Definition: tree.h:778
SPLAY_INF
#define SPLAY_INF
Definition: tree.h:283
SPLAY_LEFT
#define SPLAY_LEFT(elm, field)
Definition: tree.h:86
type
uint8_t type
Definition: decode-icmpv4.h:2
RB_ROOT
#define RB_ROOT(head)
Definition: tree.h:326
res
PoolThreadReserved res
Definition: stream-tcp-private.h:60
RB_MAX
#define RB_MAX(name, x)
Definition: tree.h:779
RB_GENERATE_INSERT_COLOR
#define RB_GENERATE_INSERT_COLOR(name, type, field, attr)
Definition: tree.h:436
SPLAY_EMPTY
#define SPLAY_EMPTY(head)
Definition: tree.h:89
SPLAY_RIGHT
#define SPLAY_RIGHT(elm, field)
Definition: tree.h:87
RB_RIGHT
#define RB_RIGHT(elm, field)
Definition: tree.h:323
head
Flow * head
Definition: flow-hash.h:2
SPLAY_NEXT
#define SPLAY_NEXT(name, x, y)
Definition: tree.h:288
RB_PROTOTYPE_INSERT_COLOR
#define RB_PROTOTYPE_INSERT_COLOR(name, type, attr)
Definition: tree.h:399