76     struct TagRbTree *pstTree;  member
83 #define RB_SCAN(pstTree, pstNode) do {                                     \  argument
84         (pstNode) = LOS_RbFirstNode((pstTree)); \
85         for (; NULL != (pstNode); (pstNode) = LOS_RbSuccessorNode((pstTree), (pstNode))) {
87 #define RB_SCAN_END(pstTree, pstNode) }                                 \  argument
91 #define RB_SCAN_SAFE(pstTree, pstNode, pstNodeTemp) do {                                           …  argument
92     (pstNode) = LOS_RbFirstNode((pstTree));                    \
93     (pstNodeTemp) = LOS_RbSuccessorNode((pstTree), (pstNode)); \
94 … (pstNode); (pstNode) = (pstNodeTemp), (pstNodeTemp) = LOS_RbSuccessorNode((pstTree), (pstNode))) {
96 #define RB_SCAN_SAFE_END(pstTree, pstNode, pstNodeTemp) }                                          …  argument
100 #define RB_MID_SCAN(pstTree, pstNode) do {                              \  argument
101         for (; NULL != (pstNode); (pstNode) = LOS_RbSuccessorNode((pstTree), (pstNode))) {
103 #define RB_MID_SCAN_END(pstTree, pstNode) }                                     \  argument
107 #define RB_WALK(pstTree, pstNode, pstRbWalk) do {                                     \  argument
109         pstRbWalk = LOS_RbCreateWalk(pstTree);  \
113 #define RB_WALK_END(pstTree, pstNode, pstRbWalk) }                                            \  argument
119 #define RB_COUNT(pstTree) ((pstTree)->ulNodes)  argument
122 VOID *LOS_RbFirstNode(LosRbTree *pstTree);
123 VOID *LOS_RbSuccessorNode(LosRbTree *pstTree, VOID *pstData);
124 VOID LOS_RbInitTree(LosRbTree *pstTree, pfRBCmpKeyFn pfCmpKey, pfRBFreeFn pfFree, pfRBGetKeyFn pfGe…
125 VOID LOS_RbDestroyTree(LosRbTree *pstTree);
126 LosRbNode *LOS_RbGetNextNode(LosRbTree *pstTree, VOID *pKey);
127 ULONG_T LOS_RbGetNode(LosRbTree *pstTree, VOID *pKey, LosRbNode **ppstNode);
128 VOID LOS_RbDelNode(LosRbTree *pstTree, LosRbNode *pstNode);
129 ULONG_T LOS_RbAddNode(LosRbTree *pstTree, LosRbNode *pstNew);
132 LosRbWalk *LOS_RbCreateWalk(LosRbTree *pstTree);