*********************************************************************21*/
/* header include files (.h) */
-
-#include "envopt.h" /* environment options */
-#include "envdep.h" /* environment dependent */
-#include "envind.h" /* environment independent */
-
-#include "gen.h" /* general layer */
-#include "ssi.h" /* system services */
+#include "common_def.h"
/* header/extern include files (.x) */
-
-#include "gen.x" /* general layer */
-#include "ssi.x" /* system services */
#include "rg_sch_clist.x" /* common functions */
*
*/
#ifdef ANSI
-PUBLIC Void rgSCHRrCListInit
+Void rgSCHRrCListInit
(
RgSchRrCListCp *lCp /* list control point */
)
#else
-PUBLIC Void rgSCHRrCListInit(lCp)
+Void rgSCHRrCListInit(lCp)
RgSchRrCListCp *lCp; /* list control point */
#endif
{
* 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)
+Void rgSCHRrCListAdd2Crnt(lCp, node)
RgSchRrCListCp *lCp; /* list control point */
RgSchRrCList *node; /* node to be added */
#endif
*
*/
#ifdef ANSI
-PUBLIC Void rgSCHRrCListAdd2Tail
+Void rgSCHRrCListAdd2Tail
(
RgSchRrCListCp *lCp, /* list control point */
RgSchRrCList *node /* node to be added */
)
#else
-PUBLIC Void rgSCHRrCListAdd2Tail(lCp, node)
+Void rgSCHRrCListAdd2Tail(lCp, node)
RgSchRrCListCp *lCp; /* list control point */
RgSchRrCList *node; /* node to be added */
#endif
*
*/
#ifdef ANSI
-PUBLIC RgSchRrCList *rgSCHRrCListDelFrm
+RgSchRrCList *rgSCHRrCListDelFrm
(
RgSchRrCListCp *lCp, /* list control pointer */
RgSchRrCList *node /* node to be removed */
)
#else
-PUBLIC RgSchRrCList *rgSCHRrCListDelFrm(lCp, node)
+RgSchRrCList *rgSCHRrCListDelFrm(lCp, node)
RgSchRrCListCp *lCp; /* list control pointer */
RgSchRrCList *node; /* node to be removed */
#endif
#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 */
/*
*
*/
#ifdef ANSI
-PUBLIC Void rgSCHRrCListInsrtAtCrnt
+Void rgSCHRrCListInsrtAtCrnt
(
RgSchRrCListCp *lCp, /* list control pointer */
RgSchRrCList *node /* node to be removed */
)
#else
-PUBLIC Void rgSCHRrCListInsrtAtCrnt(lCp, node)
+Void rgSCHRrCListInsrtAtCrnt(lCp, node)
RgSchRrCListCp *lCp; /* list control pointer */
RgSchRrCList *node; /* node to be inserted */
#endif