U8, U16, U32 data type changes

[o-du/l2.git] / src / cm / cm_llist.c

diff --git a/src/cm/cm_llist.c b/src/cm/cm_llist.c
index a41af96..e9f070d 100644 (file)
--- a/src/cm/cm_llist.c
+++ b/src/cm/cm_llist.c
@@ -61,23 +61,22 @@
 *
 */
 #ifdef ANSI
-PUBLIC Void cmLListInit
+Void cmLListInit
 (
 CmLListCp *lCp                /* list control point */
 )
 #else 
-PUBLIC Void cmLListInit(lCp)
+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
@@ -97,22 +96,21 @@ CmLListCp *lCp;               /* list control point */
 *
 */
 #ifdef ANSI
-PUBLIC Void cmLListAdd2Head
+Void cmLListAdd2Head
 (
 CmLListCp *lCp,               /* list control point */
 CmLList   *node               /* node to be added */
 )
 #else 
-PUBLIC Void cmLListAdd2Head(lCp, node)
+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++;
@@ -124,11 +122,11 @@ CmLList   *node;              /* node to be added */
    if (!node->next)
    {
       lCp->last = node;
-      RETVOID;
+      return;
    }
    
    node->next->prev = node;
-   RETVOID;
+   return;
 } /* end of cmLListAdd2Head */
 
 
@@ -146,22 +144,21 @@ CmLList   *node;              /* node to be added */
 *
 */
 #ifdef ANSI
-PUBLIC Void cmLListAdd2Tail
+Void cmLListAdd2Tail
 (
 CmLListCp *lCp,               /* list control point */
 CmLList   *node               /* node to be added */
 )
 #else 
-PUBLIC Void cmLListAdd2Tail(lCp, node)
+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++;
@@ -173,11 +170,11 @@ CmLList   *node;              /* node to be added */
    if (!node->prev)
    {
       lCp->first = node;
-      RETVOID;
+      return;
    }
    
    node->prev->next = node;
-   RETVOID;
+   return;
 } /* end of cmLListAdd2Tail */
 
 \f
@@ -195,22 +192,21 @@ CmLList   *node;              /* node to be added */
 *
 */
 #ifdef ANSI
-PUBLIC Void cmLListInsCrnt
+Void cmLListInsCrnt
 (
 CmLListCp *lCp,               /* list control point */
 CmLList   *node               /* node to be added */
 )
 #else 
-PUBLIC Void cmLListInsCrnt(lCp, node)
+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++;
@@ -219,7 +215,7 @@ CmLList   *node;              /* node to be added */
    {
      lCp->crnt = lCp->first = lCp->last = node;
      node->next = NULLP;
-     RETVOID;
+     return;
    }
 
    node->next = lCp->crnt;
@@ -232,7 +228,7 @@ CmLList   *node;              /* node to be added */
       lCp->first = node;
    lCp->crnt = node;
    
-   RETVOID;
+   return;
 } /* end of cmLListInsCrnt */
 \f
 /* cm_llist_c_001.main_7 - Add function */
@@ -250,22 +246,21 @@ CmLList   *node;              /* node to be added */
 *
 */
 #ifdef ANSI
-PUBLIC Void cmLListInsAfterCrnt
+Void cmLListInsAfterCrnt
 (
 CmLListCp *lCp,               /* list control point */
 CmLList   *node               /* node to be added */
 )
 #else 
-PUBLIC Void cmLListInsAfterCrnt(lCp, node)
+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++;
@@ -273,7 +268,7 @@ CmLList   *node;              /* node to be added */
    if (lCp->count == 1)
    {
      lCp->crnt = lCp->first = lCp->last = node;
-     RETVOID;
+     return;
    }
 
    node->prev = lCp->crnt;
@@ -286,7 +281,7 @@ CmLList   *node;              /* node to be added */
       lCp->last = node;
    lCp->crnt = node;
    
-   RETVOID;
+   return;
 } /* end of cmLListInsAfterCrnt */
 
 
@@ -307,18 +302,17 @@ CmLList   *node;              /* node to be added */
 *
 */
 #ifdef ANSI
-PUBLIC CmLList *cmLListDelFrm
+CmLList *cmLListDelFrm
 (
 CmLListCp *lCp,                /* list control pointer */
 CmLList *node                  /* node to be removed */
 )
 #else 
-PUBLIC CmLList *cmLListDelFrm(lCp, node)
+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 */
@@ -377,23 +371,22 @@ CmLList *node;                /* node to be removed */
   *
   --*/
 #ifdef ANSI
-PUBLIC Void cmLListCatLList
+Void cmLListCatLList
 (
  CmLListCp *list1,              /*-- list control point --*/
  CmLListCp *list2               /*-- node to be added --*/
  )
 #else 
-PUBLIC Void cmLListCatLList(list1, list2)
+Void cmLListCatLList(list1, list2)
    CmLListCp *list1;              /*-- list control point --*/
    CmLListCp *list2;              /*-- node to be added --*/
 #endif
 {
-   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*/
@@ -415,7 +408,7 @@ PUBLIC Void cmLListCatLList(list1, list2)
 
    cmLListInit(list2);
 
-   RETVOID;
+   return;
 } /*-- end of cmLListCatLList --*/
 
 /**********************************************************************