X-Git-Url: https://gerrit.o-ran-sc.org/r/gitweb?a=blobdiff_plain;f=src%2F5gnrsch%2Frg_sch_utl_clist.c;h=101f6b9bd9f7b9c8b3b325223df952bf0bf88918;hb=def50dc175cebc67238db5f1acd5ff322a2279bd;hp=ff1931491b0b20d2ddd6e55641ff8f8eab1c3545;hpb=105199ef642ffe9736ea24a01d4546578fa25e60;p=o-du%2Fl2.git diff --git a/src/5gnrsch/rg_sch_utl_clist.c b/src/5gnrsch/rg_sch_utl_clist.c index ff1931491..101f6b9bd 100755 --- a/src/5gnrsch/rg_sch_utl_clist.c +++ b/src/5gnrsch/rg_sch_utl_clist.c @@ -52,22 +52,21 @@ * */ #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; lCp->count = 0; - RETVOID; + return; } /* end of rgSCHRrCListInit */ /* LTE_ADV_FLAG_REMOVED_START */ @@ -83,21 +82,20 @@ 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; + return; #endif lCp->count++; @@ -110,7 +108,7 @@ PUBLIC Void rgSCHRrCListAdd2Crnt(lCp, node) lCp->crnt = lCp->first; - RETVOID; + return; } node->next = lCp->crnt; @@ -118,7 +116,7 @@ PUBLIC Void rgSCHRrCListAdd2Crnt(lCp, node) lCp->crnt->prev->next = node; lCp->crnt->prev = node; - RETVOID; + return; } /* LTE_ADV_FLAG_REMOVED_END */ @@ -136,22 +134,21 @@ 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) - RETVOID; + return; #endif lCp->count++; @@ -164,7 +161,7 @@ RgSchRrCList *node; /* node to be added */ lCp->crnt = lCp->first; - RETVOID; + return; } node->next = lCp->first; @@ -172,7 +169,7 @@ RgSchRrCList *node; /* node to be added */ lCp->first->prev->next = node; lCp->first->prev = node; - RETVOID; + return; } /* end of rgSCHRrCListAdd2Tail */ /* @@ -191,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) { @@ -220,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) @@ -238,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) @@ -252,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 */ /* @@ -270,23 +266,22 @@ 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) - RETVOID; + return; #endif crnt = lCp->crnt; @@ -299,7 +294,7 @@ RgSchRrCList *node; /* node to be inserted */ lCp->count++; - RETVOID; + return; } /********************************************************************30**