astobj2_rbtree.c File Reference

RBTree functions implementing astobj2 containers. More...

#include "asterisk.h"
#include "asterisk/_private.h"
#include "asterisk/astobj2.h"
#include "asterisk/utils.h"
#include "astobj2_private.h"
#include "astobj2_container_private.h"

Include dependency graph for astobj2_rbtree.c:

Go to the source code of this file.

Data Structures
struct	ao2_container_rbtree
struct	rbtree_node
struct	rbtree_traversal_state
struct	rbtree_traversal_state_check

Enumerations
enum	empty_node_direction { GO_LEFT, GO_RIGHT }
enum	equal_node_bias { BIAS_FIRST, BIAS_EQUAL, BIAS_LAST }

Functions
struct ao2_container *	__ao2_container_alloc_rbtree (unsigned int ao2_options, unsigned int container_options, ao2_sort_fn *sort_fn, ao2_callback_fn *cmp_fn, const char *tag, const char *file, int line, const char *func)
static struct ao2_container *	rb_ao2_alloc_empty_clone (struct ao2_container_rbtree *self, const char *tag, const char *file, int line, const char *func)
static struct ao2_container *	rb_ao2_container_init (struct ao2_container_rbtree *self, unsigned int options, ao2_sort_fn *sort_fn, ao2_callback_fn *cmp_fn)
	Initialize a rbtree container. More...
static void	rb_ao2_destroy (struct ao2_container_rbtree *self)
static struct rbtree_node *	rb_ao2_find_first (struct ao2_container_rbtree *self, enum search_flags flags, void *arg, struct rbtree_traversal_state *state)
static struct rbtree_node *	rb_ao2_find_next (struct ao2_container_rbtree *self, struct rbtree_traversal_state *state, struct rbtree_node *prev)
static enum ao2_container_insert	rb_ao2_insert_node (struct ao2_container_rbtree *self, struct rbtree_node *node)
static struct rbtree_node *	rb_ao2_iterator_next (struct ao2_container_rbtree *self, struct rbtree_node *node, enum ao2_iterator_flags flags)
static struct rbtree_node *	rb_ao2_new_node (struct ao2_container_rbtree *self, void *obj_new, const char *tag, const char *file, int line, const char *func)
static void	rb_ao2_node_destructor (void *v_doomed)
static void	rb_delete_fixup (struct ao2_container_rbtree *self, struct rbtree_node *child)
static void	rb_delete_node (struct ao2_container_rbtree *self, struct rbtree_node *doomed)
static enum empty_node_direction	rb_find_empty_direction (struct rbtree_node *empty, ao2_sort_fn *sort_fn, void *obj_right, enum search_flags flags, enum equal_node_bias bias)
static struct rbtree_node *	rb_find_initial (struct ao2_container_rbtree *self, void *obj_right, enum search_flags flags, enum equal_node_bias bias)
static void	rb_insert_fixup (struct ao2_container_rbtree *self, struct rbtree_node *node)
static struct rbtree_node *	rb_node_most_left (struct rbtree_node *node)
static struct rbtree_node *	rb_node_most_right (struct rbtree_node *node)
static struct rbtree_node *	rb_node_next (struct rbtree_node *node)
static struct rbtree_node *	rb_node_next_full (struct rbtree_node *node)
static struct rbtree_node *	rb_node_post (struct rbtree_node *node)
static struct rbtree_node *	rb_node_pre (struct rbtree_node *node)
static struct rbtree_node *	rb_node_prev (struct rbtree_node *node)
static struct rbtree_node *	rb_node_prev_full (struct rbtree_node *node)
static void	rb_rotate_left (struct ao2_container_rbtree *self, struct rbtree_node *node)
static void	rb_rotate_right (struct ao2_container_rbtree *self, struct rbtree_node *node)

Variables
static const struct ao2_container_methods	v_table_rbtree

Detailed Description

RBTree functions implementing astobj2 containers.

Author

Richard Mudgett rmudg.nosp@m.ett@.nosp@m.digiu.nosp@m.m.co.nosp@m.m

Definition in file astobj2_rbtree.c.

Enumeration Type Documentation

empty_node_direction

enum empty_node_direction

Enumerator
GO_LEFT
GO_RIGHT

Definition at line 105 of file astobj2_rbtree.c.

                          {
   GO_LEFT,
   GO_RIGHT,
};

equal_node_bias

enum equal_node_bias

Enumerator
BIAS_FIRST	Bias search toward first matching node in the container.
BIAS_EQUAL	Bias search toward any matching node.
BIAS_LAST	Bias search toward last matching node in the container.

Definition at line 96 of file astobj2_rbtree.c.

                     {
   /*! Bias search toward first matching node in the container. */
   BIAS_FIRST,
   /*! Bias search toward any matching node. */
   BIAS_EQUAL,
   /*! Bias search toward last matching node in the container. */
   BIAS_LAST,
};

Function Documentation

__ao2_container_alloc_rbtree()

struct ao2_container* __ao2_container_alloc_rbtree	(	unsigned int	ao2_options,
		unsigned int	container_options,
		ao2_sort_fn *	sort_fn,
		ao2_callback_fn *	cmp_fn,
		const char *	tag,
		const char *	file,
		int	line,
		const char *	func
	)

Definition at line 2040 of file astobj2_rbtree.c.

References __ao2_alloc(), __LOG_ERROR, ast_log, container_destruct(), NULL, and rb_ao2_container_init().

Referenced by rb_ao2_alloc_empty_clone().

{
   struct ao2_container_rbtree *self;

   if (!sort_fn) {
      /* Sanity checks. */
      ast_log(__LOG_ERROR, file, line, func, "Missing sort_fn()!\n");
      return NULL;
   }

   self = __ao2_alloc(sizeof(*self), container_destruct, ao2_options,
      tag ?: __PRETTY_FUNCTION__, file, line, func);
   return rb_ao2_container_init(self, container_options, sort_fn, cmp_fn);
}

rb_ao2_alloc_empty_clone()

static struct ao2_container* rb_ao2_alloc_empty_clone ( struct ao2_container_rbtree *  self, const char *  tag, const char *  file, int  line, const char *  func  )

static

Definition at line 558 of file astobj2_rbtree.c.

References __ao2_container_alloc_rbtree(), __is_ao2_object, ao2_options_get(), and NULL.

{
   if (!__is_ao2_object(self, file, line, func)) {
      return NULL;
   }

   return __ao2_container_alloc_rbtree(ao2_options_get(self), self->common.options,
      self->common.sort_fn, self->common.cmp_fn, tag, file, line, func);
}

rb_ao2_container_init()

static struct ao2_container* rb_ao2_container_init ( struct ao2_container_rbtree *  self, unsigned int  options, ao2_sort_fn *  sort_fn, ao2_callback_fn *  cmp_fn  )

static

Initialize a rbtree container.

Parameters

self	Container to initialize.
options	Container behaviour options (See enum ao2_container_opts)
sort_fn	Pointer to a sort function.
cmp_fn	Pointer to a compare function used by ao2_find.

Returns

A pointer to a struct container.

Definition at line 2021 of file astobj2_rbtree.c.

References ast_atomic_fetchadd_int(), ao2_container::cmp_fn, NULL, options, ao2_container::sort_fn, and v_table_rbtree.

Referenced by __ao2_container_alloc_rbtree().

{
   if (!self) {
      return NULL;
   }

   self->common.v_table = &v_table_rbtree;
   self->common.sort_fn = sort_fn;
   self->common.cmp_fn = cmp_fn;
   self->common.options = options;

#ifdef AO2_DEBUG
   ast_atomic_fetchadd_int(&ao2.total_containers, 1);
#endif   /* defined(AO2_DEBUG) */

   return (struct ao2_container *) self;
}

rb_ao2_destroy()

static void rb_ao2_destroy ( struct ao2_container_rbtree *  self )

static

Definition at line 1680 of file astobj2_rbtree.c.

References ao2_container_count(), ARRAY_LEN, ast_assert, ast_log, rbtree_node::common, FORMAT, FORMAT2, rbtree_node::is_red, rbtree_node::left, LOG_ERROR, NULL, ao2_container_node::obj, OBJ_SEARCH_OBJECT, rbtree_node::parent, rb_node_most_left(), rb_node_next(), rb_node_pre(), and rbtree_node::right.

{
   /* Check that the container no longer has any nodes */
   if (self->root) {
      ast_log(LOG_ERROR, "Node ref leak.  Red-Black tree container still has nodes!\n");
      ast_assert(0);
   }
}

rb_ao2_find_first()

static struct rbtree_node* rb_ao2_find_first ( struct ao2_container_rbtree *  self, enum search_flags  flags, void *  arg, struct rbtree_traversal_state *  state  )

static

Definition at line 1471 of file astobj2_rbtree.c.

References AO2_CONTAINER_ALLOC_OPT_DUPS_ALLOW, AO2_CONTAINER_ALLOC_OPT_DUPS_MASK, AO2_CONTAINER_ALLOC_OPT_DUPS_OBJ_REJECT, AO2_CONTAINER_ALLOC_OPT_DUPS_REJECT, AO2_CONTAINER_ALLOC_OPT_DUPS_REPLACE, ao2_ref, rbtree_traversal_state::arg, BIAS_EQUAL, BIAS_FIRST, BIAS_LAST, rbtree_node::common, rbtree_traversal_state::flags, NULL, ao2_container_node::obj, OBJ_MULTIPLE, OBJ_NODATA, OBJ_ORDER_ASCENDING, OBJ_ORDER_DESCENDING, OBJ_ORDER_MASK, OBJ_ORDER_POST, OBJ_ORDER_PRE, OBJ_SEARCH_KEY, OBJ_SEARCH_MASK, OBJ_SEARCH_OBJECT, OBJ_SEARCH_PARTIAL_KEY, OBJ_UNLINK, rb_find_initial(), rb_node_most_left(), rb_node_most_right(), rb_node_next_full(), rb_node_post(), rb_node_pre(), rb_node_prev_full(), rbtree_node::right, and rbtree_traversal_state::sort_fn.

{
   struct rbtree_node *node;
   enum equal_node_bias bias;

   if (self->common.destroying) {
      /* Force traversal to be post order for tree destruction. */
      flags = OBJ_UNLINK | OBJ_NODATA | OBJ_MULTIPLE | OBJ_ORDER_POST;
   }

   memset(state, 0, sizeof(*state));
   state->arg = arg;
   state->flags = flags;

   switch (flags & OBJ_SEARCH_MASK) {
   case OBJ_SEARCH_OBJECT:
   case OBJ_SEARCH_KEY:
   case OBJ_SEARCH_PARTIAL_KEY:
      /* We are asked to do a directed search. */
      state->sort_fn = self->common.sort_fn;
      break;
   default:
      /* Don't know, let's visit all nodes */
      state->sort_fn = NULL;
      break;
   }

   if (!self->root) {
      /* Tree is empty. */
      return NULL;
   }

   /* Find first traversal node. */
   switch (flags & OBJ_ORDER_MASK) {
   default:
   case OBJ_ORDER_ASCENDING:
      if (!state->sort_fn) {
         /* Find left most child. */
         node = rb_node_most_left(self->root);
         if (!node->common.obj) {
            node = rb_node_next_full(node);
            if (!node) {
               return NULL;
            }
         }
         break;
      }

      /* Search for initial node. */
      switch (self->common.options & AO2_CONTAINER_ALLOC_OPT_DUPS_MASK) {
      case AO2_CONTAINER_ALLOC_OPT_DUPS_REJECT:
      case AO2_CONTAINER_ALLOC_OPT_DUPS_REPLACE:
         if ((flags & OBJ_SEARCH_MASK) != OBJ_SEARCH_PARTIAL_KEY) {
            /* There are no duplicates allowed. */
            bias = BIAS_EQUAL;
            break;
         }
         /* Fall through */
      default:
      case AO2_CONTAINER_ALLOC_OPT_DUPS_ALLOW:
      case AO2_CONTAINER_ALLOC_OPT_DUPS_OBJ_REJECT:
         /* Find first duplicate node. */
         bias = BIAS_FIRST;
         break;
      }
      node = rb_find_initial(self, arg, flags, bias);
      if (!node) {
         return NULL;
      }
      break;
   case OBJ_ORDER_DESCENDING:
      if (!state->sort_fn) {
         /* Find right most child. */
         node = rb_node_most_right(self->root);
         if (!node->common.obj) {
            node = rb_node_prev_full(node);
            if (!node) {
               return NULL;
            }
         }
         break;
      }

      /* Search for initial node. */
      switch (self->common.options & AO2_CONTAINER_ALLOC_OPT_DUPS_MASK) {
      case AO2_CONTAINER_ALLOC_OPT_DUPS_REJECT:
      case AO2_CONTAINER_ALLOC_OPT_DUPS_REPLACE:
         if ((flags & OBJ_SEARCH_MASK) != OBJ_SEARCH_PARTIAL_KEY) {
            /* There are no duplicates allowed. */
            bias = BIAS_EQUAL;
            break;
         }
         /* Fall through */
      default:
      case AO2_CONTAINER_ALLOC_OPT_DUPS_ALLOW:
      case AO2_CONTAINER_ALLOC_OPT_DUPS_OBJ_REJECT:
         /* Find last duplicate node. */
         bias = BIAS_LAST;
         break;
      }
      node = rb_find_initial(self, arg, flags, bias);
      if (!node) {
         return NULL;
      }
      break;
   case OBJ_ORDER_PRE:
      /* This is a tree structure traversal so we must visit all nodes. */
      state->sort_fn = NULL;

      node = self->root;

      /* Find a non-empty node. */
      while (!node->common.obj) {
         node = rb_node_pre(node);
         if (!node) {
            return NULL;
         }
      }
      break;
   case OBJ_ORDER_POST:
      /* This is a tree structure traversal so we must visit all nodes. */
      state->sort_fn = NULL;

      /* Find the left most childless node. */
      node = self->root;
      for (;;) {
         node = rb_node_most_left(node);
         if (!node->right) {
            /* This node has no children. */
            break;
         }
         node = node->right;
      }

      /* Find a non-empty node. */
      while (!node->common.obj) {
         node = rb_node_post(node);
         if (!node) {
            return NULL;
         }
      }
      break;
   }

   /* We have the first traversal node */
   ao2_ref(node, +1);
   return node;
}

rb_ao2_find_next()

static struct rbtree_node* rb_ao2_find_next ( struct ao2_container_rbtree *  self, struct rbtree_traversal_state *  state, struct rbtree_node *  prev  )

static

Definition at line 1270 of file astobj2_rbtree.c.

References ao2_ref, rbtree_traversal_state::arg, rbtree_node::common, rbtree_traversal_state::flags, NULL, ao2_container_node::obj, OBJ_ORDER_ASCENDING, OBJ_ORDER_DESCENDING, OBJ_ORDER_MASK, OBJ_ORDER_POST, OBJ_ORDER_PRE, OBJ_SEARCH_MASK, rb_node_next(), rb_node_post(), rb_node_pre(), rb_node_prev(), and rbtree_traversal_state::sort_fn.

{
   struct rbtree_node *node;
   void *arg;
   enum search_flags flags;
   int cmp;

   arg = state->arg;
   flags = state->flags;

   node = prev;
   for (;;) {
      /* Find next node in traversal order. */
      switch (flags & OBJ_ORDER_MASK) {
      default:
      case OBJ_ORDER_ASCENDING:
         node = rb_node_next(node);
         break;
      case OBJ_ORDER_DESCENDING:
         node = rb_node_prev(node);
         break;
      case OBJ_ORDER_PRE:
         node = rb_node_pre(node);
         break;
      case OBJ_ORDER_POST:
         node = rb_node_post(node);
         break;
      }
      if (!node) {
         /* No more nodes left to traverse. */
         break;
      }
      if (!node->common.obj) {
         /* Node is empty */
         continue;
      }

      if (state->sort_fn) {
         /* Filter node through the sort_fn */
         cmp = state->sort_fn(node->common.obj, arg, flags & OBJ_SEARCH_MASK);
         if (cmp) {
            /* No more nodes in this container are possible to match. */
            break;
         }
      }

      /* We have the next traversal node */
      ao2_ref(node, +1);

      /*
       * Dereferencing the prev node may result in our next node
       * object being removed by another thread.  This could happen if
       * the container uses RW locks and the container was read
       * locked.
       */
      ao2_ref(prev, -1);
      if (node->common.obj) {
         return node;
      }
      prev = node;
   }

   /* No more nodes in the container left to traverse. */
   ao2_ref(prev, -1);
   return NULL;
}

rb_ao2_insert_node()

static enum ao2_container_insert rb_ao2_insert_node ( struct ao2_container_rbtree *  self, struct rbtree_node *  node  )

static

Definition at line 1022 of file astobj2_rbtree.c.

References AO2_CONTAINER_ALLOC_OPT_DUPS_ALLOW, AO2_CONTAINER_ALLOC_OPT_DUPS_MASK, AO2_CONTAINER_ALLOC_OPT_DUPS_OBJ_REJECT, AO2_CONTAINER_ALLOC_OPT_DUPS_REJECT, AO2_CONTAINER_ALLOC_OPT_DUPS_REPLACE, AO2_CONTAINER_ALLOC_OPT_INSERT_BEGIN, AO2_CONTAINER_INSERT_NODE_INSERTED, AO2_CONTAINER_INSERT_NODE_OBJ_REPLACED, AO2_CONTAINER_INSERT_NODE_REJECTED, ao2_ref, ast_assert, BIAS_EQUAL, BIAS_FIRST, BIAS_LAST, rbtree_node::common, GO_LEFT, rbtree_node::is_red, rbtree_node::left, ao2_container_node::obj, OBJ_SEARCH_OBJECT, options, rbtree_node::parent, rb_find_empty_direction(), rb_insert_fixup(), rb_node_most_left(), rb_node_most_right(), rb_node_next_full(), rb_node_prev_full(), rbtree_node::right, and SWAP.

{
   int cmp;
   struct rbtree_node *cur;
   struct rbtree_node *next;
   ao2_sort_fn *sort_fn;
   uint32_t options;
   enum equal_node_bias bias;

   if (!self->root) {
      /* The tree is empty. */
      self->root = node;
      return AO2_CONTAINER_INSERT_NODE_INSERTED;
   }

   sort_fn = self->common.sort_fn;
   options = self->common.options;
   switch (options & AO2_CONTAINER_ALLOC_OPT_DUPS_MASK) {
   default:
   case AO2_CONTAINER_ALLOC_OPT_DUPS_ALLOW:
      if (options & AO2_CONTAINER_ALLOC_OPT_INSERT_BEGIN) {
         bias = BIAS_FIRST;
      } else {
         bias = BIAS_LAST;
      }
      break;
   case AO2_CONTAINER_ALLOC_OPT_DUPS_REJECT:
   case AO2_CONTAINER_ALLOC_OPT_DUPS_OBJ_REJECT:
   case AO2_CONTAINER_ALLOC_OPT_DUPS_REPLACE:
      bias = BIAS_EQUAL;
      break;
   }

   /*
    * New nodes are always colored red when initially inserted into
    * the tree.  (Except for the root which is always black.)
    */
   node->is_red = 1;

   /* Find node where normal insert would put a new node. */
   cur = self->root;
   for (;;) {
      if (!cur->common.obj) {
         /* Which direction do we go to insert this node? */
         if (rb_find_empty_direction(cur, sort_fn, node->common.obj, OBJ_SEARCH_OBJECT, bias)
            == GO_LEFT) {
            if (cur->left) {
               cur = cur->left;
               continue;
            }

            /* Node becomes a left child */
            cur->left = node;
            node->parent = cur;
            rb_insert_fixup(self, node);
            return AO2_CONTAINER_INSERT_NODE_INSERTED;
         }
         if (cur->right) {
            cur = cur->right;
            continue;
         }

         /* Node becomes a right child */
         cur->right = node;
         node->parent = cur;
         rb_insert_fixup(self, node);
         return AO2_CONTAINER_INSERT_NODE_INSERTED;
      }
      cmp = sort_fn(cur->common.obj, node->common.obj, OBJ_SEARCH_OBJECT);
      if (cmp > 0) {
         if (cur->left) {
            cur = cur->left;
            continue;
         }

         /* Node becomes a left child */
         cur->left = node;
         node->parent = cur;
         rb_insert_fixup(self, node);
         return AO2_CONTAINER_INSERT_NODE_INSERTED;
      } else if (cmp < 0) {
         if (cur->right) {
            cur = cur->right;
            continue;
         }

         /* Node becomes a right child */
         cur->right = node;
         node->parent = cur;
         rb_insert_fixup(self, node);
         return AO2_CONTAINER_INSERT_NODE_INSERTED;
      }
      switch (bias) {
      case BIAS_FIRST:
         /* Duplicate nodes unconditionally accepted. */
         if (cur->left) {
            cur = cur->left;
            continue;
         }

         /* Node becomes a left child */
         cur->left = node;
         node->parent = cur;
         rb_insert_fixup(self, node);
         return AO2_CONTAINER_INSERT_NODE_INSERTED;
      case BIAS_EQUAL:
         break;
      case BIAS_LAST:
         /* Duplicate nodes unconditionally accepted. */
         if (cur->right) {
            cur = cur->right;
            continue;
         }

         /* Node becomes a right child */
         cur->right = node;
         node->parent = cur;
         rb_insert_fixup(self, node);
         return AO2_CONTAINER_INSERT_NODE_INSERTED;
      }

      break;
   }

   /* Node is a dupliate */
   switch (options & AO2_CONTAINER_ALLOC_OPT_DUPS_MASK) {
   default:
   case AO2_CONTAINER_ALLOC_OPT_DUPS_ALLOW:
      ast_assert(0);/* Case already handled by BIAS_FIRST/BIAS_LAST. */
      return AO2_CONTAINER_INSERT_NODE_REJECTED;
   case AO2_CONTAINER_ALLOC_OPT_DUPS_REJECT:
      /* Reject all objects with the same key. */
      return AO2_CONTAINER_INSERT_NODE_REJECTED;
   case AO2_CONTAINER_ALLOC_OPT_DUPS_OBJ_REJECT:
      if (cur->common.obj == node->common.obj) {
         /* Reject inserting the same object */
         return AO2_CONTAINER_INSERT_NODE_REJECTED;
      }
      next = cur;
      if (options & AO2_CONTAINER_ALLOC_OPT_INSERT_BEGIN) {
         /* Search to end of duplicates for the same object. */
         for (;;) {
            next = rb_node_next_full(next);
            if (!next) {
               break;
            }
            if (next->common.obj == node->common.obj) {
               /* Reject inserting the same object */
               return AO2_CONTAINER_INSERT_NODE_REJECTED;
            }
            cmp = sort_fn(next->common.obj, node->common.obj, OBJ_SEARCH_OBJECT);
            if (cmp) {
               break;
            }
         }

         /* Find first duplicate node. */
         for (;;) {
            next = rb_node_prev_full(cur);
            if (!next) {
               break;
            }
            if (next->common.obj == node->common.obj) {
               /* Reject inserting the same object */
               return AO2_CONTAINER_INSERT_NODE_REJECTED;
            }
            cmp = sort_fn(next->common.obj, node->common.obj, OBJ_SEARCH_OBJECT);
            if (cmp) {
               break;
            }
            cur = next;
         }
         if (!cur->left) {
            /* Node becomes a left child */
            cur->left = node;
         } else {
            /* Node becomes a right child */
            cur = rb_node_most_right(cur->left);
            cur->right = node;
         }
      } else {
         /* Search to beginning of duplicates for the same object. */
         for (;;) {
            next = rb_node_prev_full(next);
            if (!next) {
               break;
            }
            if (next->common.obj == node->common.obj) {
               /* Reject inserting the same object */
               return AO2_CONTAINER_INSERT_NODE_REJECTED;
            }
            cmp = sort_fn(next->common.obj, node->common.obj, OBJ_SEARCH_OBJECT);
            if (cmp) {
               break;
            }
         }

         /* Find last duplicate node. */
         for (;;) {
            next = rb_node_next_full(cur);
            if (!next) {
               break;
            }
            if (next->common.obj == node->common.obj) {
               /* Reject inserting the same object */
               return AO2_CONTAINER_INSERT_NODE_REJECTED;
            }
            cmp = sort_fn(next->common.obj, node->common.obj, OBJ_SEARCH_OBJECT);
            if (cmp) {
               break;
            }
            cur = next;
         }
         if (!cur->right) {
            /* Node becomes a right child */
            cur->right = node;
         } else {
            /* Node becomes a left child */
            cur = rb_node_most_left(cur->right);
            cur->left = node;
         }
      }
      break;
   case AO2_CONTAINER_ALLOC_OPT_DUPS_REPLACE:
      SWAP(cur->common.obj, node->common.obj);
      ao2_ref(node, -1);
      return AO2_CONTAINER_INSERT_NODE_OBJ_REPLACED;
   }

   /* Complete inserting duplicate node. */
   node->parent = cur;
   rb_insert_fixup(self, node);
   return AO2_CONTAINER_INSERT_NODE_INSERTED;
}

rb_ao2_iterator_next()

static struct rbtree_node* rb_ao2_iterator_next ( struct ao2_container_rbtree *  self, struct rbtree_node *  node, enum ao2_iterator_flags  flags  )

static

Definition at line 1635 of file astobj2_rbtree.c.

References AO2_ITERATOR_DESCENDING, rbtree_node::common, NULL, ao2_container_node::obj, rb_node_most_left(), rb_node_most_right(), rb_node_next_full(), and rb_node_prev_full().

{
   if (flags & AO2_ITERATOR_DESCENDING) {
      if (!node) {
         /* Find right most node. */
         if (!self->root) {
            return NULL;
         }
         node = rb_node_most_right(self->root);
         if (node->common.obj) {
            /* Found a non-empty node. */
            return node;
         }
      }
      /* Find next non-empty node. */
      node = rb_node_prev_full(node);
   } else {
      if (!node) {
         /* Find left most node. */
         if (!self->root) {
            return NULL;
         }
         node = rb_node_most_left(self->root);
         if (node->common.obj) {
            /* Found a non-empty node. */
            return node;
         }
      }
      /* Find next non-empty node. */
      node = rb_node_next_full(node);
   }

   return node;
}

rb_ao2_new_node()

static struct rbtree_node* rb_ao2_new_node ( struct ao2_container_rbtree *  self, void *  obj_new, const char *  tag, const char *  file, int  line, const char *  func  )

static

Definition at line 904 of file astobj2_rbtree.c.

References __ao2_ref(), AO2_ALLOC_OPT_LOCK_NOLOCK, AO2_ALLOC_OPT_NO_REF_DEBUG, ao2_alloc_options, rbtree_node::common, ao2_container_node::my_container, NULL, ao2_container_node::obj, and rb_ao2_node_destructor().

{
   struct rbtree_node *node;

   node = ao2_alloc_options(sizeof(*node), rb_ao2_node_destructor,
      AO2_ALLOC_OPT_LOCK_NOLOCK | AO2_ALLOC_OPT_NO_REF_DEBUG);
   if (!node) {
      return NULL;
   }

   __ao2_ref(obj_new, +1, tag ?: "Container node creation", file, line, func);
   node->common.obj = obj_new;
   node->common.my_container = (struct ao2_container *) self;

   return node;
}

rb_ao2_node_destructor()

static void rb_ao2_node_destructor ( void *  v_doomed )

static

Definition at line 838 of file astobj2_rbtree.c.

References __adjust_lock(), __container_unlink_node, ao2_container_check(), AO2_LOCK_REQ_WRLOCK, AO2_UNLINK_NODE_UNLINK_OBJECT, AST_DEVMODE, ast_log, ao2_container_rbtree::common, rbtree_node::common, ao2_container::destroying, is_ao2_object, ao2_container_node::is_linked, LOG_ERROR, ao2_container_node::my_container, ao2_container_node::obj, OBJ_NOLOCK, and rb_delete_node().

Referenced by rb_ao2_new_node().

{
   struct rbtree_node *doomed = v_doomed;

   if (doomed->common.is_linked) {
      struct ao2_container_rbtree *my_container;

      /*
       * Promote to write lock if not already there.  Since
       * adjust_lock() can potentially release and block waiting for a
       * write lock, care must be taken to ensure that node references
       * are released before releasing the container references.
       *
       * Node references held by an iterator can only be held while
       * the iterator also holds a reference to the container.  These
       * node references must be unreferenced before the container can
       * be unreferenced to ensure that the node will not get a
       * negative reference and the destructor called twice for the
       * same node.
       */
      my_container = (struct ao2_container_rbtree *) doomed->common.my_container;
#ifdef AST_DEVMODE
      is_ao2_object(my_container);
#endif

      __adjust_lock(my_container, AO2_LOCK_REQ_WRLOCK, 1);

#if defined(AO2_DEBUG)
      if (!my_container->common.destroying
         && ao2_container_check(doomed->common.my_container, OBJ_NOLOCK)) {
         ast_log(LOG_ERROR, "Container integrity failed before node deletion.\n");
      }
#endif   /* defined(AO2_DEBUG) */
      rb_delete_node(my_container, doomed);
#if defined(AO2_DEBUG)
      if (!my_container->common.destroying
         && ao2_container_check(doomed->common.my_container, OBJ_NOLOCK)) {
         ast_log(LOG_ERROR, "Container integrity failed after node deletion.\n");
      }
#endif   /* defined(AO2_DEBUG) */
   }

   /*
    * We could have an object in the node if the container is being
    * destroyed or the node had not been linked in yet.
    */
   if (doomed->common.obj) {
      __container_unlink_node(&doomed->common, AO2_UNLINK_NODE_UNLINK_OBJECT);
   }
}

rb_delete_fixup()

static void rb_delete_fixup ( struct ao2_container_rbtree *  self, struct rbtree_node *  child  )

static

Definition at line 584 of file astobj2_rbtree.c.

References AO2_DEVMODE_STAT, ast_assert, rbtree_node::is_red, rbtree_node::left, NULL, rbtree_node::parent, rb_rotate_left(), rb_rotate_right(), and rbtree_node::right.

Referenced by rb_delete_node().

{
   struct rbtree_node *sibling;

   while (self->root != child && !child->is_red) {
      if (child->parent->left == child) {
         /* Child is a left child. */
         sibling = child->parent->right;
         ast_assert(sibling != NULL);
         if (sibling->is_red) {
            /* Case 1: The child's sibling is red. */
            AO2_DEVMODE_STAT(++self->stats.fixup_delete_left[0]);
            sibling->is_red = 0;
            child->parent->is_red = 1;
            rb_rotate_left(self, child->parent);
            sibling = child->parent->right;
            ast_assert(sibling != NULL);
         }
         /*
          * The sibling is black.  A black node must have two children,
          * or one red child, or no children.
          */
         if ((!sibling->left || !sibling->left->is_red)
            && (!sibling->right || !sibling->right->is_red)) {
            /*
             * Case 2: The sibling is black and both of its children are black.
             *
             * This case handles the two black children or no children
             * possibilities of a black node.
             */
            AO2_DEVMODE_STAT(++self->stats.fixup_delete_left[1]);
            sibling->is_red = 1;
            child = child->parent;
         } else {
            /* At this point the sibling has at least one red child. */
            if (!sibling->right || !sibling->right->is_red) {
               /*
                * Case 3: The sibling is black, its left child is red, and its
                * right child is black.
                */
               AO2_DEVMODE_STAT(++self->stats.fixup_delete_left[2]);
               ast_assert(sibling->left != NULL);
               ast_assert(sibling->left->is_red);
               sibling->left->is_red = 0;
               sibling->is_red = 1;
               rb_rotate_right(self, sibling);
               sibling = child->parent->right;
               ast_assert(sibling != NULL);
            }
            /* Case 4: The sibling is black and its right child is red. */
            AO2_DEVMODE_STAT(++self->stats.fixup_delete_left[3]);
            sibling->is_red = child->parent->is_red;
            child->parent->is_red = 0;
            if (sibling->right) {
               sibling->right->is_red = 0;
            }
            rb_rotate_left(self, child->parent);
            child = self->root;
         }
      } else {
         /* Child is a right child. */
         sibling = child->parent->left;
         ast_assert(sibling != NULL);
         if (sibling->is_red) {
            /* Case 1: The child's sibling is red. */
            AO2_DEVMODE_STAT(++self->stats.fixup_delete_right[0]);
            sibling->is_red = 0;
            child->parent->is_red = 1;
            rb_rotate_right(self, child->parent);
            sibling = child->parent->left;
            ast_assert(sibling != NULL);
         }
         /*
          * The sibling is black.  A black node must have two children,
          * or one red child, or no children.
          */
         if ((!sibling->right || !sibling->right->is_red)
            && (!sibling->left || !sibling->left->is_red)) {
            /*
             * Case 2: The sibling is black and both of its children are black.
             *
             * This case handles the two black children or no children
             * possibilities of a black node.
             */
            AO2_DEVMODE_STAT(++self->stats.fixup_delete_right[1]);
            sibling->is_red = 1;
            child = child->parent;
         } else {
            /* At this point the sibling has at least one red child. */
            if (!sibling->left || !sibling->left->is_red) {
               /*
                * Case 3: The sibling is black, its right child is red, and its
                * left child is black.
                */
               AO2_DEVMODE_STAT(++self->stats.fixup_delete_right[2]);
               ast_assert(sibling->right != NULL);
               ast_assert(sibling->right->is_red);
               sibling->right->is_red = 0;
               sibling->is_red = 1;
               rb_rotate_left(self, sibling);
               sibling = child->parent->left;
               ast_assert(sibling != NULL);
            }
            /* Case 4: The sibling is black and its left child is red. */
            AO2_DEVMODE_STAT(++self->stats.fixup_delete_right[3]);
            sibling->is_red = child->parent->is_red;
            child->parent->is_red = 0;
            if (sibling->left) {
               sibling->left->is_red = 0;
            }
            rb_rotate_right(self, child->parent);
            child = self->root;
         }
      }
   }

   /*
    * Case 2 could leave the child node red and it needs to leave
    * with it black.
    *
    * Case 4 sets the child node to the root which of course must
    * be black.
    */
   child->is_red = 0;
}

rb_delete_node()

static void rb_delete_node ( struct ao2_container_rbtree *  self, struct rbtree_node *  doomed  )

static

Definition at line 720 of file astobj2_rbtree.c.

References AO2_DEVMODE_STAT, ast_assert, rbtree_node::is_red, rbtree_node::left, NULL, rbtree_node::parent, rb_delete_fixup(), rb_node_most_left(), rbtree_node::right, and SWAP.

Referenced by rb_ao2_node_destructor().

{
   struct rbtree_node *child;
   int need_fixup;

   if (doomed->left && doomed->right) {
      struct rbtree_node *next;
      int is_red;

      /*
       * The doomed node has two children.
       *
       * Find the next child node and swap it with the doomed node in
       * the tree.
       */
      AO2_DEVMODE_STAT(++self->stats.delete_children[2]);
      next = rb_node_most_left(doomed->right);
      SWAP(doomed->parent, next->parent);
      SWAP(doomed->left, next->left);
      SWAP(doomed->right, next->right);
      is_red = doomed->is_red;
      doomed->is_red = next->is_red;
      next->is_red = is_red;

      /* Link back in the next node. */
      if (!next->parent) {
         /* Doomed was the root so we get a new root node. */
         self->root = next;
      } else if (next->parent->left == doomed) {
         /* Doomed was the left child. */
         next->parent->left = next;
      } else {
         /* Doomed was the right child. */
         next->parent->right = next;
      }
      next->left->parent = next;
      if (next->right == next) {
         /* The next node was the right child of doomed. */
         next->right = doomed;
         doomed->parent = next;
      } else {
         next->right->parent = next;
         doomed->parent->left = doomed;
      }

      /* The doomed node has no left child now. */
      ast_assert(doomed->left == NULL);

      /*
       * We don't have to link the right child back in with doomed
       * since we are going to link it with doomed's parent anyway.
       */
      child = doomed->right;
   } else {
      /* Doomed has at most one child. */
      child = doomed->left;
      if (!child) {
         child = doomed->right;
      }
   }
   if (child) {
      AO2_DEVMODE_STAT(++self->stats.delete_children[1]);
   } else {
      AO2_DEVMODE_STAT(++self->stats.delete_children[0]);
   }

   need_fixup = (!doomed->is_red && !self->common.destroying);
   if (need_fixup && !child) {
      /*
       * Use the doomed node as a place holder node for the
       * nonexistent child so we also don't have to pass to the fixup
       * routine the parent and which child the deleted node came
       * from.
       */
      rb_delete_fixup(self, doomed);
      ast_assert(doomed->left == NULL);
      ast_assert(doomed->right == NULL);
      ast_assert(!doomed->is_red);
   }

   /* Link the child in place of doomed. */
   if (!doomed->parent) {
      /* Doomed was the root so we get a new root node. */
      self->root = child;
   } else if (doomed->parent->left == doomed) {
      /* Doomed was the left child. */
      doomed->parent->left = child;
   } else {
      /* Doomed was the right child. */
      doomed->parent->right = child;
   }
   if (child) {
      child->parent = doomed->parent;
      if (need_fixup) {
         rb_delete_fixup(self, child);
      }
   }

   AO2_DEVMODE_STAT(--self->common.nodes);
}

rb_find_empty_direction()

static enum empty_node_direction rb_find_empty_direction ( struct rbtree_node *  empty, ao2_sort_fn *  sort_fn, void *  obj_right, enum search_flags  flags, enum equal_node_bias  bias  )

static

Definition at line 355 of file astobj2_rbtree.c.

References BIAS_FIRST, BIAS_LAST, rbtree_node::common, GO_LEFT, GO_RIGHT, rbtree_node::left, ao2_container_node::obj, rbtree_node::parent, rb_node_most_left(), rb_node_most_right(), and rbtree_node::right.

Referenced by rb_ao2_insert_node(), and rb_find_initial().

{
   int cmp;
   struct rbtree_node *cur;
   struct rbtree_node *right_most;

   /* Try for a quick definite go left. */
   if (!empty->left) {
      /* The empty node has no left child. */
      return GO_RIGHT;
   }
   right_most = rb_node_most_right(empty->left);
   if (right_most->common.obj) {
      cmp = sort_fn(right_most->common.obj, obj_right, flags);
      if (cmp < 0) {
         return GO_RIGHT;
      }
      if (cmp == 0 && bias == BIAS_LAST) {
         return GO_RIGHT;
      }
      return GO_LEFT;
   }

   /* Try for a quick definite go right. */
   if (!empty->right) {
      /* The empty node has no right child. */
      return GO_LEFT;
   }
   cur = rb_node_most_left(empty->right);
   if (cur->common.obj) {
      cmp = sort_fn(cur->common.obj, obj_right, flags);
      if (cmp > 0) {
         return GO_LEFT;
      }
      if (cmp == 0 && bias == BIAS_FIRST) {
         return GO_LEFT;
      }
      return GO_RIGHT;
   }

   /*
    * Have to scan the previous nodes from the right_most node of
    * the left subtree for the first non-empty node to determine
    * direction.
    */
   cur = right_most;
   for (;;) {
      /* Find previous node. */
      if (cur->left) {
         cur = rb_node_most_right(cur->left);
      } else {
         /* Find the parent that the node is a right child of. */
         for (;;) {
            if (cur->parent == empty) {
               /* The left side of the empty node is all empty nodes. */
               return GO_RIGHT;
            }
            if (cur->parent->right == cur) {
               /* We are the right child.  The parent is the previous node. */
               cur = cur->parent;
               break;
            }
            cur = cur->parent;
         }
      }

      if (cur->common.obj) {
         cmp = sort_fn(cur->common.obj, obj_right, flags);
         if (cmp < 0) {
            return GO_RIGHT;
         }
         if (cmp == 0 && bias == BIAS_LAST) {
            return GO_RIGHT;
         }
         return GO_LEFT;
      }
   }
}

rb_find_initial()

static struct rbtree_node* rb_find_initial ( struct ao2_container_rbtree *  self, void *  obj_right, enum search_flags  flags, enum equal_node_bias  bias  )

static

Definition at line 1353 of file astobj2_rbtree.c.

References BIAS_EQUAL, BIAS_FIRST, BIAS_LAST, rbtree_node::common, GO_LEFT, rbtree_node::left, NULL, ao2_container_node::obj, OBJ_SEARCH_MASK, rb_find_empty_direction(), rb_node_next_full(), rb_node_prev_full(), and rbtree_node::right.

Referenced by rb_ao2_find_first().

{
   int cmp;
   enum search_flags sort_flags;
   struct rbtree_node *node;
   struct rbtree_node *next = NULL;
   ao2_sort_fn *sort_fn;

   sort_flags = flags & OBJ_SEARCH_MASK;
   sort_fn = self->common.sort_fn;

   /* Find node where normal search would find it. */
   node = self->root;
   if (!node) {
      return NULL;
   }
   for (;;) {
      if (!node->common.obj) {
         /* Which direction do we go to find the node? */
         if (rb_find_empty_direction(node, sort_fn, obj_right, sort_flags, bias)
            == GO_LEFT) {
            next = node->left;
         } else {
            next = node->right;
         }
         if (!next) {
            switch (bias) {
            case BIAS_FIRST:
               /* Check successor node for match. */
               next = rb_node_next_full(node);
               break;
            case BIAS_EQUAL:
               break;
            case BIAS_LAST:
               /* Check previous node for match. */
               next = rb_node_prev_full(node);
               break;
            }
            if (next) {
               cmp = sort_fn(next->common.obj, obj_right, sort_flags);
               if (cmp == 0) {
                  /* Found the first/last matching node. */
                  return next;
               }
               next = NULL;
            }

            /* No match found. */
            return next;
         }
      } else {
         cmp = sort_fn(node->common.obj, obj_right, sort_flags);
         if (cmp > 0) {
            next = node->left;
         } else if (cmp < 0) {
            next = node->right;
         } else {
            switch (bias) {
            case BIAS_FIRST:
               next = node->left;
               break;
            case BIAS_EQUAL:
               return node;
            case BIAS_LAST:
               next = node->right;
               break;
            }
            if (!next) {
               /* Found the first/last matching node. */
               return node;
            }
         }
         if (!next) {
            switch (bias) {
            case BIAS_FIRST:
               if (cmp < 0) {
                  /* Check successor node for match. */
                  next = rb_node_next_full(node);
               }
               break;
            case BIAS_EQUAL:
               break;
            case BIAS_LAST:
               if (cmp > 0) {
                  /* Check previous node for match. */
                  next = rb_node_prev_full(node);
               }
               break;
            }
            if (next) {
               cmp = sort_fn(next->common.obj, obj_right, sort_flags);
               if (cmp == 0) {
                  /* Found the first/last matching node. */
                  return next;
               }
            }

            /* No match found. */
            return NULL;
         }
      }
      node = next;
   }
}

rb_insert_fixup()

static void rb_insert_fixup ( struct ao2_container_rbtree *  self, struct rbtree_node *  node  )

static

Definition at line 933 of file astobj2_rbtree.c.

References AO2_DEVMODE_STAT, ast_assert, rbtree_node::is_red, rbtree_node::left, NULL, rbtree_node::parent, rb_rotate_left(), rb_rotate_right(), and rbtree_node::right.

Referenced by rb_ao2_insert_node().

{
   struct rbtree_node *g_parent; /* Grand parent node. */

   while (node->parent && node->parent->is_red) {
      g_parent = node->parent->parent;

      /* The grand parent must exist if the parent is red. */
      ast_assert(g_parent != NULL);

      if (node->parent == g_parent->left) {
         /* The parent is a left child. */
         if (g_parent->right && g_parent->right->is_red) {
            /* Case 1: Push the black down from the grand parent node. */
            AO2_DEVMODE_STAT(++self->stats.fixup_insert_left[0]);
            g_parent->right->is_red = 0;
            g_parent->left->is_red = 0;
            g_parent->is_red = 1;

            node = g_parent;
         } else {
            /* The uncle node is black. */
            if (node->parent->right == node) {
               /*
                * Case 2: The node is a right child.
                *
                * Which node is the grand parent does not change.
                */
               AO2_DEVMODE_STAT(++self->stats.fixup_insert_left[1]);
               node = node->parent;
               rb_rotate_left(self, node);
            }
            /* Case 3: The node is a left child. */
            AO2_DEVMODE_STAT(++self->stats.fixup_insert_left[2]);
            node->parent->is_red = 0;
            g_parent->is_red = 1;
            rb_rotate_right(self, g_parent);
         }
      } else {
         /* The parent is a right child. */
         if (g_parent->left && g_parent->left->is_red) {
            /* Case 1: Push the black down from the grand parent node. */
            AO2_DEVMODE_STAT(++self->stats.fixup_insert_right[0]);
            g_parent->left->is_red = 0;
            g_parent->right->is_red = 0;
            g_parent->is_red = 1;

            node = g_parent;
         } else {
            /* The uncle node is black. */
            if (node->parent->left == node) {
               /*
                * Case 2: The node is a left child.
                *
                * Which node is the grand parent does not change.
                */
               AO2_DEVMODE_STAT(++self->stats.fixup_insert_right[1]);
               node = node->parent;
               rb_rotate_right(self, node);
            }
            /* Case 3: The node is a right child. */
            AO2_DEVMODE_STAT(++self->stats.fixup_insert_right[2]);
            node->parent->is_red = 0;
            g_parent->is_red = 1;
            rb_rotate_left(self, g_parent);
         }
      }
   }

   /*
    * The root could be red here because:
    * 1) We just inserted the root node in an empty tree.
    *
    * 2) Case 1 could leave the root red if the grand parent were
    * the root.
    */
   self->root->is_red = 0;
}

rb_node_most_left()

static struct rbtree_node* rb_node_most_left ( struct rbtree_node *  node )

static

Definition at line 137 of file astobj2_rbtree.c.

References rbtree_node::left.

Referenced by rb_ao2_destroy(), rb_ao2_find_first(), rb_ao2_insert_node(), rb_ao2_iterator_next(), rb_delete_node(), rb_find_empty_direction(), rb_node_next(), and rb_node_post().

{
   while (node->left) {
      node = node->left;
   }

   return node;
}

rb_node_most_right()

static struct rbtree_node* rb_node_most_right ( struct rbtree_node *  node )

static

Definition at line 155 of file astobj2_rbtree.c.

References rbtree_node::right.

Referenced by rb_ao2_find_first(), rb_ao2_insert_node(), rb_ao2_iterator_next(), rb_find_empty_direction(), and rb_node_prev().

{
   while (node->right) {
      node = node->right;
   }

   return node;
}

rb_node_next()

static struct rbtree_node* rb_node_next ( struct rbtree_node *  node )

static

Definition at line 174 of file astobj2_rbtree.c.

References rbtree_node::left, NULL, rbtree_node::parent, rb_node_most_left(), and rbtree_node::right.

Referenced by rb_ao2_destroy(), rb_ao2_find_next(), and rb_node_next_full().

{
   if (node->right) {
      return rb_node_most_left(node->right);
   }

   /* Find the parent that the node is a left child of. */
   while (node->parent) {
      if (node->parent->left == node) {
         /* We are the left child.  The parent is the next node. */
         return node->parent;
      }
      node = node->parent;
   }
   return NULL;
}

rb_node_next_full()

static struct rbtree_node* rb_node_next_full ( struct rbtree_node *  node )

static

Definition at line 309 of file astobj2_rbtree.c.

References rbtree_node::common, ao2_container_node::obj, and rb_node_next().

Referenced by rb_ao2_find_first(), rb_ao2_insert_node(), rb_ao2_iterator_next(), and rb_find_initial().

{
   for (;;) {
      node = rb_node_next(node);
      if (!node || node->common.obj) {
         return node;
      }
   }
}

rb_node_post()

static struct rbtree_node* rb_node_post ( struct rbtree_node *  node )

static

Definition at line 264 of file astobj2_rbtree.c.

References rbtree_node::left, NULL, rbtree_node::parent, rb_node_most_left(), and rbtree_node::right.

Referenced by rb_ao2_find_first(), and rb_ao2_find_next().

{
   /* This node's children have already been visited. */
   for (;;) {
      if (!node->parent) {
         return NULL;
      }
      if (node->parent->left == node) {
         /* We came up the left child. */
         node = node->parent;

         /*
          * Find the right child's left most childless node.
          */
         while (node->right) {
            node = rb_node_most_left(node->right);
         }

         /*
          * This node's left child has already been visited or it doesn't
          * have any children.
          */
         return node;
      }

      /*
       * We came up the right child.
       *
       * This node's children have already been visited.  Time to
       * visit the parent.
       */
      return node->parent;
   }
}

rb_node_pre()

static struct rbtree_node* rb_node_pre ( struct rbtree_node *  node )

static

Definition at line 228 of file astobj2_rbtree.c.

References rbtree_node::left, NULL, rbtree_node::parent, and rbtree_node::right.

Referenced by rb_ao2_destroy(), rb_ao2_find_first(), and rb_ao2_find_next().

{
   /* Visit the children if the node has any. */
   if (node->left) {
      return node->left;
   }
   if (node->right) {
      return node->right;
   }

   /* Time to go back up. */
   for (;;) {
      if (!node->parent) {
         return NULL;
      }
      if (node->parent->left == node && node->parent->right) {
         /*
          * We came up the left child and there's a right child.  Visit
          * it.
          */
         return node->parent->right;
      }
      node = node->parent;
   }
}

rb_node_prev()

static struct rbtree_node* rb_node_prev ( struct rbtree_node *  node )

static

Definition at line 201 of file astobj2_rbtree.c.

References rbtree_node::left, NULL, rbtree_node::parent, rb_node_most_right(), and rbtree_node::right.

Referenced by rb_ao2_find_next(), and rb_node_prev_full().

{
   if (node->left) {
      return rb_node_most_right(node->left);
   }

   /* Find the parent that the node is a right child of. */
   while (node->parent) {
      if (node->parent->right == node) {
         /* We are the right child.  The parent is the previous node. */
         return node->parent;
      }
      node = node->parent;
   }
   return NULL;
}

rb_node_prev_full()

static struct rbtree_node* rb_node_prev_full ( struct rbtree_node *  node )

static

Definition at line 329 of file astobj2_rbtree.c.

References rbtree_node::common, ao2_container_node::obj, and rb_node_prev().

Referenced by rb_ao2_find_first(), rb_ao2_insert_node(), rb_ao2_iterator_next(), and rb_find_initial().

{
   for (;;) {
      node = rb_node_prev(node);
      if (!node || node->common.obj) {
         return node;
      }
   }
}

rb_rotate_left()

static void rb_rotate_left ( struct ao2_container_rbtree *  self, struct rbtree_node *  node  )

static

< Node's right child.

Definition at line 459 of file astobj2_rbtree.c.

References rbtree_node::left, rbtree_node::parent, and rbtree_node::right.

Referenced by rb_delete_fixup(), and rb_insert_fixup().

{
   struct rbtree_node *child; /*!< Node's right child. */

   child = node->right;

   /* Link the node's parent to the child. */
   if (!node->parent) {
      /* Node is the root so we get a new root node. */
      self->root = child;
   } else if (node->parent->left == node) {
      /* Node is a left child. */
      node->parent->left = child;
   } else {
      /* Node is a right child. */
      node->parent->right = child;
   }
   child->parent = node->parent;

   /* Link node's right subtree to the child's left subtree. */
   node->right = child->left;
   if (node->right) {
      node->right->parent = node;
   }

   /* Link the node to the child's left. */
   node->parent = child;
   child->left = node;
}

rb_rotate_right()

static void rb_rotate_right ( struct ao2_container_rbtree *  self, struct rbtree_node *  node  )

static

< Node's left child.

Definition at line 514 of file astobj2_rbtree.c.

References rbtree_node::left, rbtree_node::parent, and rbtree_node::right.

Referenced by rb_delete_fixup(), and rb_insert_fixup().

{
   struct rbtree_node *child; /*!< Node's left child. */

   child = node->left;

   /* Link the node's parent to the child. */
   if (!node->parent) {
      /* Node is the root so we get a new root node. */
      self->root = child;
   } else if (node->parent->right == node) {
      /* Node is a right child. */
      node->parent->right = child;
   } else {
      /* Node is a left child. */
      node->parent->left = child;
   }
   child->parent = node->parent;

   /* Link node's left subtree to the child's right subtree. */
   node->left = child->right;
   if (node->left) {
      node->left->parent = node;
   }

   /* Link the node to the child's right. */
   node->parent = child;
   child->right = node;
}

Variable Documentation

v_table_rbtree

const struct ao2_container_methods v_table_rbtree

static

rbtree container virtual method table.

Definition at line 1996 of file astobj2_rbtree.c.

Referenced by rb_ao2_container_init().