Home
last modified time | relevance | path

Searched refs:rbLeft (Results 1 - 4 of 4) sorted by relevance

/foundation/communication/dsoftbus/components/nstackx/fillp/src/public/src/
H A Drb_tree.c30 x->rbRight = y->rbLeft; in FillpRbRotateLeft()
31 if (y->rbLeft != FILLP_NULL_PTR) { in FillpRbRotateLeft()
32 y->rbLeft->rbParent = x; in FillpRbRotateLeft()
38 if (x == x->rbParent->rbLeft) { in FillpRbRotateLeft()
39 x->rbParent->rbLeft = y; in FillpRbRotateLeft()
48 y->rbLeft = x; in FillpRbRotateLeft()
58 struct RbNode *y = x->rbLeft; in FillpRbRotateRight()
61 x->rbLeft = y->rbRight; in FillpRbRotateRight()
72 x->rbParent->rbLeft = y; in FillpRbRotateRight()
95 if (x == x->rbParent->rbLeft) { in EqualLeft()
[all...]
/foundation/communication/dsoftbus/components/nstackx/fillp/src/public/include/
H A Drb_tree.h30 struct RbNode *rbLeft; member
/foundation/communication/dsoftbus/components/nstackx/fillp/src/app_lib/src/
H A Depoll_app.c44 rbp = rbp->rbLeft; in EpFind()
71 p = &parent->rbLeft; in EpRbtreeInsert()
75 epi->rbn.rbLeft = epi->rbn.rbRight = FILLP_NULL_PTR; in EpRbtreeInsert()
/foundation/communication/dsoftbus/components/nstackx/fillp/src/fillp_lib/src/
H A Dspunge_stack.c153 left = (struct RbNode *)(parent->rbLeft); in RecursiveRbTree()

Completed in 4 milliseconds