lCp->crnt = (CmLList *)NULLP;
lCp->count = 0;
- RETVOID;
+ return;
} /* end of cmLListInit */
\f
#ifdef ERRCHK
if (lCp == (CmLListCp *)NULLP)
- RETVOID;
+ return;
#endif
lCp->count++;
if (!node->next)
{
lCp->last = node;
- RETVOID;
+ return;
}
node->next->prev = node;
- RETVOID;
+ return;
} /* end of cmLListAdd2Head */
#ifdef ERRCHK
if (lCp == (CmLListCp *)NULLP)
- RETVOID;
+ return;
#endif
lCp->count++;
if (!node->prev)
{
lCp->first = node;
- RETVOID;
+ return;
}
node->prev->next = node;
- RETVOID;
+ return;
} /* end of cmLListAdd2Tail */
\f
#ifdef ERRCHK
if (!lCp)
- RETVOID;
+ return;
#endif
lCp->count++;
{
lCp->crnt = lCp->first = lCp->last = node;
node->next = NULLP;
- RETVOID;
+ return;
}
node->next = lCp->crnt;
lCp->first = node;
lCp->crnt = node;
- RETVOID;
+ return;
} /* end of cmLListInsCrnt */
\f
/* cm_llist_c_001.main_7 - Add function */
#ifdef ERRCHK
if (!lCp)
- RETVOID;
+ return;
#endif
lCp->count++;
if (lCp->count == 1)
{
lCp->crnt = lCp->first = lCp->last = node;
- RETVOID;
+ return;
}
node->prev = lCp->crnt;
lCp->last = node;
lCp->crnt = node;
- RETVOID;
+ return;
} /* end of cmLListInsAfterCrnt */
/*-- if the second list is empty nothing to do --*/
if(list2->count == 0)
{
- RETVOID;
+ return;
}
/*-- if the first list is empty make first the same as second*/
cmLListInit(list2);
- RETVOID;
+ return;
} /*-- end of cmLListCatLList --*/
/**********************************************************************