librnr/dlistvoid.c
void DListVoidDeleteAllNodes(DListVoid_T *pHead)
{
  dnode_t *p, *q, *head;

  LOGDIAG4CALL(_TPTR(pHead));

  if( pHead == NULL )
  {
    return;
  }

  head = &(pHead->m_dnodeHead);

  dlist_for_each_safe(p, q, head)
  {
    DListVoidDeleteNode(pHead, DLISTVOID_ENTRY(p));
  }
}
/*!
 * \brief Unlink and delete all nodes and data from dlist, leaving dlist empty.
 *
 * User data are deleted with a per node callback to the user-supplied
 * data delete function, if any.
 *
 * \param pHead   Pointer to dlist (head). 
 */
\brief Unlink and delete all nodes and data from dlist, leaving dlist empty.
User data are deleted with a per node callback to the user-supplied
data delete function, if any.

\param pHead   Pointer to dlist (head).
\ brief Unlink and delete all nodes and data from dlist leaving dlist empty . User data are deleted with a per node callback to the user - supplied data delete function if any . \ param pHead Pointer to dlist ( head ) .
void DListVoidDeleteAllNodes(DListVoid_T *pHead)
{
  dnode_t *p, *q, *head;
  LOGDIAG4CALL(_TPTR(pHead));
  if( pHead == NULL )
  {
    return;
  }
  head = &(pHead->m_dnodeHead);
  dlist_for_each_safe(p, q, head)
  {
    DListVoidDeleteNode(pHead, DLISTVOID_ENTRY(p));
  }
}
void DListVoidDeleteAllNodes ( DListVoid_T * pHead ) { dnode_t * p , * q , * head ; LOGDIAG4CALL ( _TPTR ( pHead ) ) ; if ( pHead == NULL ) { return ; } head = & ( pHead -> m_dnodeHead ) ; dlist_for_each_safe ( p , q , head ) { DListVoidDeleteNode ( pHead , DLISTVOID_ENTRY ( p ) ) ; } }
\brief Unlink and delete all nodes and data from dlist, leaving dlist empty.
\ brief Unlink and delete all nodes and data from dlist leaving dlist empty .