X-Git-Url: https://gerrit.o-ran-sc.org/r/gitweb?a=blobdiff_plain;f=src%2F5gnrsch%2Frg_sch_utl_clist.c;h=c89b7dd2c650e2bf9b3a167d415171bff0b305e3;hb=5d74fef7c9fe6b65a965ceac6bfe812872dab323;hp=4cbec3c1d913e56cbcf6ea709800b8e58455b27e;hpb=3235ecfc7414aa0b72d0ad50db63ae8b5626045b;p=o-du%2Fl2.git

diff --git a/src/5gnrsch/rg_sch_utl_clist.c b/src/5gnrsch/rg_sch_utl_clist.c
index 4cbec3c1d..c89b7dd2c 100755
--- a/src/5gnrsch/rg_sch_utl_clist.c
+++ b/src/5gnrsch/rg_sch_utl_clist.c
@@ -29,18 +29,9 @@
 *********************************************************************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 */
 
 
@@ -61,16 +52,15 @@
 *
 */
 #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
 {
-   TRC2(rgSCHRrCListInit);
    
    lCp->first = (RgSchRrCList *)NULLP;
    lCp->crnt  = (RgSchRrCList *)NULLP;
@@ -92,18 +82,17 @@ RgSchRrCListCp *lCp;               /* list control point */
  *        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
 {
-   TRC2(rgSCHRrCListAdd2Crnt);
 #ifdef ERRCHK
    if (lCp == (RgSchRrCListCp *)NULLP)
       RETVOID;
@@ -145,18 +134,17 @@ PUBLIC Void rgSCHRrCListAdd2Crnt(lCp, node)
 *
 */
 #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
 {
-   TRC2(rgSCHRrCListAdd2Tail);
 
 #ifdef ERRCHK
    if (lCp == (RgSchRrCListCp *)NULLP)
@@ -200,27 +188,26 @@ RgSchRrCList   *node;              /* node to be added */
 *
 */
 #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
 {
-   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)
    {
@@ -229,9 +216,9 @@ RgSchRrCList *node;                /* node to be removed */
          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)
@@ -247,7 +234,7 @@ RgSchRrCList *node;                /* node to be removed */
        /* 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)
@@ -261,7 +248,7 @@ RgSchRrCList *node;                /* node to be removed */
       lCp->crnt = node->next;
    }
    node->next = node->prev = (RgSchRrCList *)NULLP;
-   RETVALUE(node);
+   return (node);
 } /* end of rgSCHRrCListDelFrm */
 
 /*
@@ -279,19 +266,18 @@ RgSchRrCList *node;                /* node to be removed */
 *
 */
 #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
 {
    RgSchRrCList *crnt;
-   TRC2(rgSCHRrCListInsrtAtCrnt);
 
 #ifdef ERRCHK
    if (lCp == (RgSchRrCListCp *)NULLP)