Code Review
/
o-du
/
l2.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
review
|
tree
raw
|
inline
| side by side
fix for RlcUlActvTsk not getting hit
[o-du/l2.git]
/
src
/
5gnrsch
/
rg_sch_utl_clist.c
diff --git
a/src/5gnrsch/rg_sch_utl_clist.c
b/src/5gnrsch/rg_sch_utl_clist.c
index
ff19314
..
ca1a385
100755
(executable)
--- a/
src/5gnrsch/rg_sch_utl_clist.c
+++ b/
src/5gnrsch/rg_sch_utl_clist.c
@@
-52,12
+52,12
@@
*
*/
#ifdef ANSI
*
*/
#ifdef ANSI
-
PUBLIC
Void rgSCHRrCListInit
+Void rgSCHRrCListInit
(
RgSchRrCListCp *lCp /* list control point */
)
#else
(
RgSchRrCListCp *lCp /* list control point */
)
#else
-
PUBLIC
Void rgSCHRrCListInit(lCp)
+Void rgSCHRrCListInit(lCp)
RgSchRrCListCp *lCp; /* list control point */
#endif
{
RgSchRrCListCp *lCp; /* list control point */
#endif
{
@@
-83,13
+83,13
@@
RgSchRrCListCp *lCp; /* list control point */
* File: rr_clist.c
*/
#ifdef ANSI
* File: rr_clist.c
*/
#ifdef ANSI
-
PUBLIC
Void rgSCHRrCListAdd2Crnt
+Void rgSCHRrCListAdd2Crnt
(
RgSchRrCListCp *lCp, /* list control point */
RgSchRrCList *node /* node to be added */
)
#else
(
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
RgSchRrCListCp *lCp; /* list control point */
RgSchRrCList *node; /* node to be added */
#endif
@@
-136,13
+136,13
@@
PUBLIC Void rgSCHRrCListAdd2Crnt(lCp, node)
*
*/
#ifdef ANSI
*
*/
#ifdef ANSI
-
PUBLIC
Void rgSCHRrCListAdd2Tail
+Void rgSCHRrCListAdd2Tail
(
RgSchRrCListCp *lCp, /* list control point */
RgSchRrCList *node /* node to be added */
)
#else
(
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
RgSchRrCListCp *lCp; /* list control point */
RgSchRrCList *node; /* node to be added */
#endif
@@
-191,13
+191,13
@@
RgSchRrCList *node; /* node to be added */
*
*/
#ifdef ANSI
*
*/
#ifdef ANSI
-
PUBLIC
RgSchRrCList *rgSCHRrCListDelFrm
+RgSchRrCList *rgSCHRrCListDelFrm
(
RgSchRrCListCp *lCp, /* list control pointer */
RgSchRrCList *node /* node to be removed */
)
#else
(
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
RgSchRrCListCp *lCp; /* list control pointer */
RgSchRrCList *node; /* node to be removed */
#endif
@@
-206,12
+206,12
@@
RgSchRrCList *node; /* node to be removed */
#ifdef ERRCHK
if (lCp == (RgSchRrCListCp *)NULLP)
#ifdef ERRCHK
if (lCp == (RgSchRrCListCp *)NULLP)
-
RETVALUE
(NULLP);
+
return
(NULLP);
#endif
if(lCp->count == 0)
{
#endif
if(lCp->count == 0)
{
-
RETVALUE
(NULLP);
+
return
(NULLP);
}
if (lCp->count == 1)
{
}
if (lCp->count == 1)
{
@@
-220,9
+220,9
@@
RgSchRrCList *node; /* node to be removed */
lCp->first = lCp->crnt = (RgSchRrCList *)NULLP;
lCp->count = 0;
node->next = node->prev = (RgSchRrCList *)NULLP;
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)
}
if (lCp->first == node)
@@
-238,7
+238,7
@@
RgSchRrCList *node; /* node to be removed */
/* Adding this check and guarding the decrement of counter when
node is deleted with reshuffling */
lCp->count--;
/* 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)
}
if(node->prev && node->next)
@@
-252,7
+252,7
@@
RgSchRrCList *node; /* node to be removed */
lCp->crnt = node->next;
}
node->next = node->prev = (RgSchRrCList *)NULLP;
lCp->crnt = node->next;
}
node->next = node->prev = (RgSchRrCList *)NULLP;
-
RETVALUE
(node);
+
return
(node);
} /* end of rgSCHRrCListDelFrm */
/*
} /* end of rgSCHRrCListDelFrm */
/*
@@
-270,13
+270,13
@@
RgSchRrCList *node; /* node to be removed */
*
*/
#ifdef ANSI
*
*/
#ifdef ANSI
-
PUBLIC
Void rgSCHRrCListInsrtAtCrnt
+Void rgSCHRrCListInsrtAtCrnt
(
RgSchRrCListCp *lCp, /* list control pointer */
RgSchRrCList *node /* node to be removed */
)
#else
(
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
RgSchRrCListCp *lCp; /* list control pointer */
RgSchRrCList *node; /* node to be inserted */
#endif