librnr/include/rnr/dlist.h
static inline void _dlist_add(dnode_t *node, dnode_t *prev, dnode_t *next)
{
  next->prev = node;
  node->next = next;
  node->prev = prev;
  prev->next = node;
}
/*!
 * \brief insert a new entry between two known consecutive entries
 *
 * \param node  the new node to be inserted
 * \param prev  previous node to new node
 * \param next  next node to new node
 *
 * \note This is only for internal list manipulation where we know the prev/next
 *       entries already!
 */
\brief insert a new entry between two known consecutive entries
\param node  the new node to be inserted
\param prev  previous node to new node
\param next  next node to new node

\note This is only for internal list manipulation where we know the prev/next
entries already!
\ brief insert a new entry between two known consecutive entries \ param node the new node to be inserted \ param prev previous node to new node \ param next next node to new node \ note This is only for internal list manipulation where we know the prev / next entries already!
static inline void _dlist_add(dnode_t *node, dnode_t *prev, dnode_t *next)
{
  next->prev = node;
  node->next = next;
  node->prev = prev;
  prev->next = node;
}
static inline void _dlist_add ( dnode_t * node , dnode_t * prev , dnode_t * next ) { next -> prev = node ; node -> next = next ; node -> prev = prev ; prev -> next = node ; }
\brief insert a new entry between two known consecutive entries
 \param node  the new node to be inserted
 \param prev  previous node to new node
 \param next  next node to new node
\ brief insert a new entry between two known consecutive entries \ param node the new node to be inserted \ param prev previous node to new node \ param next next node to new node