* File: rr_clist.c
*
*/
-#ifdef ANSI
-PUBLIC Void rgSCHRrCListInit
+Void rgSCHRrCListInit
(
RgSchRrCListCp *lCp /* list control point */
)
-#else
-PUBLIC Void rgSCHRrCListInit(lCp)
-RgSchRrCListCp *lCp; /* list control point */
-#endif
{
- TRC2(rgSCHRrCListInit);
lCp->first = (RgSchRrCList *)NULLP;
lCp->crnt = (RgSchRrCList *)NULLP;
lCp->count = 0;
- RETVOID;
+ return;
} /* end of rgSCHRrCListInit */
/* LTE_ADV_FLAG_REMOVED_START */
*
* File: rr_clist.c
*/
-#ifdef ANSI
-PUBLIC Void rgSCHRrCListAdd2Crnt
+Void rgSCHRrCListAdd2Crnt
(
- RgSchRrCListCp *lCp, /* list control point */
- RgSchRrCList *node /* node to be added */
- )
-#else
-PUBLIC Void rgSCHRrCListAdd2Crnt(lCp, node)
- RgSchRrCListCp *lCp; /* list control point */
- RgSchRrCList *node; /* node to be added */
-#endif
+RgSchRrCListCp *lCp, /* list control point */
+RgSchRrCList *node /* node to be added */
+)
{
- TRC2(rgSCHRrCListAdd2Crnt);
#ifdef ERRCHK
if (lCp == (RgSchRrCListCp *)NULLP)
- RETVOID;
+ return;
#endif
lCp->count++;
lCp->crnt = lCp->first;
- RETVOID;
+ return;
}
node->next = lCp->crnt;
lCp->crnt->prev->next = node;
lCp->crnt->prev = node;
- RETVOID;
+ return;
}
/* LTE_ADV_FLAG_REMOVED_END */
* File: rr_clist.c
*
*/
-#ifdef ANSI
-PUBLIC Void rgSCHRrCListAdd2Tail
+Void rgSCHRrCListAdd2Tail
(
RgSchRrCListCp *lCp, /* list control point */
RgSchRrCList *node /* node to be added */
)
-#else
-PUBLIC Void rgSCHRrCListAdd2Tail(lCp, node)
-RgSchRrCListCp *lCp; /* list control point */
-RgSchRrCList *node; /* node to be added */
-#endif
{
- TRC2(rgSCHRrCListAdd2Tail);
#ifdef ERRCHK
if (lCp == (RgSchRrCListCp *)NULLP)
- RETVOID;
+ return;
#endif
lCp->count++;
lCp->crnt = lCp->first;
- RETVOID;
+ return;
}
node->next = lCp->first;
lCp->first->prev->next = node;
lCp->first->prev = node;
- RETVOID;
+ return;
} /* end of rgSCHRrCListAdd2Tail */
/*
* File: rr_clist.c
*
*/
-#ifdef ANSI
-PUBLIC RgSchRrCList *rgSCHRrCListDelFrm
+RgSchRrCList *rgSCHRrCListDelFrm
(
RgSchRrCListCp *lCp, /* list control pointer */
RgSchRrCList *node /* node to be removed */
)
-#else
-PUBLIC RgSchRrCList *rgSCHRrCListDelFrm(lCp, node)
-RgSchRrCListCp *lCp; /* list control pointer */
-RgSchRrCList *node; /* node to be removed */
-#endif
{
- TRC2(rgSCHRrCListDelFrm);
#ifdef ERRCHK
if (lCp == (RgSchRrCListCp *)NULLP)
- RETVALUE(NULLP);
+ return (NULLP);
#endif
if(lCp->count == 0)
{
- RETVALUE(NULLP);
+ return (NULLP);
}
if (lCp->count == 1)
{
lCp->first = lCp->crnt = (RgSchRrCList *)NULLP;
lCp->count = 0;
node->next = node->prev = (RgSchRrCList *)NULLP;
- RETVALUE(node);
+ return (node);
}
- RETVALUE(NULLP);
+ return (NULLP);
}
if (lCp->first == node)
/* Adding this check and guarding the decrement of counter when
node is deleted with reshuffling */
lCp->count--;
- RETVALUE(node);
+ return (node);
}
if(node->prev && node->next)
lCp->crnt = node->next;
}
node->next = node->prev = (RgSchRrCList *)NULLP;
- RETVALUE(node);
+ return (node);
} /* end of rgSCHRrCListDelFrm */
/*
* File: rr_clist.c
*
*/
-#ifdef ANSI
-PUBLIC Void rgSCHRrCListInsrtAtCrnt
+Void rgSCHRrCListInsrtAtCrnt
(
RgSchRrCListCp *lCp, /* list control pointer */
RgSchRrCList *node /* node to be removed */
)
-#else
-PUBLIC Void rgSCHRrCListInsrtAtCrnt(lCp, node)
-RgSchRrCListCp *lCp; /* list control pointer */
-RgSchRrCList *node; /* node to be inserted */
-#endif
{
RgSchRrCList *crnt;
- TRC2(rgSCHRrCListInsrtAtCrnt);
#ifdef ERRCHK
if (lCp == (RgSchRrCListCp *)NULLP)
- RETVOID;
+ return;
#endif
crnt = lCp->crnt;
lCp->count++;
- RETVOID;
+ return;
}
/********************************************************************30**