* File: cm_llist.c
*
*/
-#ifdef ANSI
-PUBLIC Void cmLListInit
+Void cmLListInit
(
CmLListCp *lCp /* list control point */
)
-#else
-PUBLIC Void cmLListInit(lCp)
-CmLListCp *lCp; /* list control point */
-#endif
{
- TRC3(cmLListInit);
lCp->first = (CmLList *)NULLP;
lCp->last = (CmLList *)NULLP;
lCp->crnt = (CmLList *)NULLP;
lCp->count = 0;
- RETVOID;
+ return;
} /* end of cmLListInit */
\f
* File: cm_llist.c
*
*/
-#ifdef ANSI
-PUBLIC Void cmLListAdd2Head
+Void cmLListAdd2Head
(
CmLListCp *lCp, /* list control point */
CmLList *node /* node to be added */
)
-#else
-PUBLIC Void cmLListAdd2Head(lCp, node)
-CmLListCp *lCp; /* list control point */
-CmLList *node; /* node to be added */
-#endif
{
- TRC3(cmLListAdd2Head);
#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 */
* File: cm_llist.c
*
*/
-#ifdef ANSI
-PUBLIC Void cmLListAdd2Tail
+Void cmLListAdd2Tail
(
CmLListCp *lCp, /* list control point */
CmLList *node /* node to be added */
)
-#else
-PUBLIC Void cmLListAdd2Tail(lCp, node)
-CmLListCp *lCp; /* list control point */
-CmLList *node; /* node to be added */
-#endif
{
- TRC3(cmLListAdd2Tail);
#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
* File: cm_llist.c
*
*/
-#ifdef ANSI
-PUBLIC Void cmLListInsCrnt
+Void cmLListInsCrnt
(
CmLListCp *lCp, /* list control point */
CmLList *node /* node to be added */
)
-#else
-PUBLIC Void cmLListInsCrnt(lCp, node)
-CmLListCp *lCp; /* list control point */
-CmLList *node; /* node to be added */
-#endif
{
- TRC3(cmLListInsCrnt);
#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 */
* File: cm_llist.c
*
*/
-#ifdef ANSI
-PUBLIC Void cmLListInsAfterCrnt
+Void cmLListInsAfterCrnt
(
CmLListCp *lCp, /* list control point */
CmLList *node /* node to be added */
)
-#else
-PUBLIC Void cmLListInsAfterCrnt(lCp, node)
-CmLListCp *lCp; /* list control point */
-CmLList *node; /* node to be added */
-#endif
{
- TRC3(cmLListInsAfterCrnt);
#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 */
* File: cm_llist.c
*
*/
-#ifdef ANSI
-PUBLIC CmLList *cmLListDelFrm
+CmLList *cmLListDelFrm
(
CmLListCp *lCp, /* list control pointer */
CmLList *node /* node to be removed */
)
-#else
-PUBLIC CmLList *cmLListDelFrm(lCp, node)
-CmLListCp *lCp; /* list control pointer */
-CmLList *node; /* node to be removed */
-#endif
{
- TRC3(cmLListDelFrm);
#ifdef ERRCHK
/* cm_llist_c_001.main_8 : added null check for node */
* File: cm_llist.c
*
--*/
-#ifdef ANSI
-PUBLIC Void cmLListCatLList
+Void cmLListCatLList
(
- CmLListCp *list1, /*-- list control point --*/
- CmLListCp *list2 /*-- node to be added --*/
- )
-#else
-PUBLIC Void cmLListCatLList(list1, list2)
- CmLListCp *list1; /*-- list control point --*/
- CmLListCp *list2; /*-- node to be added --*/
-#endif
+CmLListCp *list1, /*-- list control point --*/
+CmLListCp *list2 /*-- node to be added --*/
+)
{
- TRC3(cmLListCatLList);
/*-- 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 --*/
/**********************************************************************