Intravision/reactos
1
0
Fork 0
mirror of https://github.com/reactos/reactos.git synced 2025-04-20 20:36:35 +00:00
Code Issues Projects Releases Packages Wiki Activity

[RTL]

Browse source 
Implement RtlDeleteNoSplay which is really just a copy/paste of RtlDelete, but without splaying the tree after deletion of the node. Needed by the filter driver fltmgr.sys. Dedicated to Mr. V ;)

svn path=/trunk/; revision=64818
This commit is contained in:
Hermès Bélusca-Maïto 2014-10-18 23:51:35 +00:00
parent 2b55d972ca
commit eea6067270
1 changed files with 101 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

116
reactos/lib/rtl/splaytree.c
View file

@ -154,17 +154,17 @@ RtlDelete(PRTL_SPLAY_LINKS Links)
N = Links; N = Links;
/* Check if we have two children */ /* Check if we have two children */
if ((RtlLeftChild(N)) && (RtlRightChild(N))) if (RtlLeftChild(N) && RtlRightChild(N))
{ {
/* Get the predecessor */ /* Get the predecessor */
SP = RtlSubtreePredecessor(N); SP = RtlSubtreePredecessor(N);
/* Swap it with N, this will guarantee that N will have only a child */ /* Swap it with N, this will guarantee that N will only have a child */
SwapSplayLinks(SP, N); SwapSplayLinks(SP, N);
} }
/* Check if we have no children */ /* Check if we have no children */
if (!(RtlLeftChild(N)) && !(RtlRightChild(N))) if (!RtlLeftChild(N) && !RtlRightChild(N))
{ {
/* If we are also the root, then the tree is gone */ /* If we are also the root, then the tree is gone */
if (RtlIsRoot(N)) return NULL; if (RtlIsRoot(N)) return NULL;
@ -176,12 +176,12 @@ RtlDelete(PRTL_SPLAY_LINKS Links)
if (RtlIsLeftChild(N)) if (RtlIsLeftChild(N))
{ {
/* N was a left child, so erase its parent's left child link */ /* N was a left child, so erase its parent's left child link */
RtlLeftChild(RtlParent(N)) = NULL; RtlLeftChild(P) = NULL;
} }
else else
{ {
/* N was a right child, so erase its parent's right child link */ /* N was a right child, so erase its parent's right child link */
RtlRightChild(RtlParent(N)) = NULL; RtlRightChild(P) = NULL;
} }
/* And finally splay the parent */ /* And finally splay the parent */
@ -196,44 +196,130 @@ RtlDelete(PRTL_SPLAY_LINKS Links)
} }
else else
{ {
/* We have a right child, get him instead */ /* We have a right child, get it instead */
C = RtlRightChild(N); C = RtlRightChild(N);
} }
/* Check if we are the root entry */ /* Check if we are the root entry */
if (RtlIsRoot(N)) if (RtlIsRoot(N))
{ {
/* Our child is now root, return him */ /* Our child is now root, return it */
C->Parent = C; RtlParent(C) = C;
return C; return C;
} }
/* Get our parent */
P = RtlParent(N);
/* Find out who is referencing us and link to our child instead */ /* Find out who is referencing us and link to our child instead */
if (RtlIsLeftChild(N)) if (RtlIsLeftChild(N))
{ {
/* N was a left child, so set its parent's left child as our child */ /* N was a left child, so set its parent's left child as our child */
RtlLeftChild(RtlParent(N)) = C; RtlLeftChild(P) = C;
} }
else else
{ {
/* N was a right child, so set its parent's right child as our child */ /* N was a right child, so set its parent's right child as our child */
RtlRightChild(RtlParent(N)) = C; RtlRightChild(P) = C;
} }
/* Finally, inherit our parent and splay the parent */ /* Finally, inherit our parent and splay the parent */
C->Parent = N->Parent; RtlParent(C) = P;
return RtlSplay(RtlParent(C)); return RtlSplay(P);
} }
/* /*
* @unimplemented * @implemented
*/ */
VOID VOID
NTAPI NTAPI
RtlDeleteNoSplay(PRTL_SPLAY_LINKS Links, RtlDeleteNoSplay(PRTL_SPLAY_LINKS Links,
PRTL_SPLAY_LINKS *Root) PRTL_SPLAY_LINKS *Root)
{ {
UNIMPLEMENTED; PRTL_SPLAY_LINKS N, P, C, SP;
N = Links;
/* Check if we have two children */
if (RtlLeftChild(N) && RtlRightChild(N))
{
/* Get the predecessor */
SP = RtlSubtreePredecessor(N);
/* If we are the root, the new root will be our predecessor after swapping */
if (RtlIsRoot(N)) *Root = SP;
/* Swap the predecessor with N, this will guarantee that N will only have a child */
SwapSplayLinks(SP, N);
}
/* Check if we have no children */
if (!RtlLeftChild(N) && !RtlRightChild(N))
{
/* If we are also the root, then the tree is gone */
if (RtlIsRoot(N))
{
*Root = NULL;
return;
}
/* Get our parent */
P = RtlParent(N);
/* Find out who is referencing us and delete the reference */
if (RtlIsLeftChild(N))
{
/* N was a left child, so erase its parent's left child link */
RtlLeftChild(P) = NULL;
}
else
{
/* N was a right child, so erase its parent's right child link */
RtlRightChild(P) = NULL;
}
/* We are done */
return;
}
/* If we got here, we have a child (not two: we swapped above!) */
if (RtlLeftChild(N))
{
/* We have a left child, so get it */
C = RtlLeftChild(N);
}
else
{
/* We have a right child, get it instead */
C = RtlRightChild(N);
}
/* Check if we are the root entry */
if (RtlIsRoot(N))
{
/* Our child is now root, return it */
RtlParent(C) = C;
*Root = C;
return;
}
/* Get our parent */
P = RtlParent(N);
/* Find out who is referencing us and link to our child instead */
if (RtlIsLeftChild(N))
{
/* N was a left child, so set its parent's left child as our child */
RtlLeftChild(P) = C;
}
else
{
/* N was a right child, so set its parent's right child as our child */
RtlRightChild(P) = C;
}
/* Finally, inherit our parent and we are done */
RtlParent(C) = P;
return;
} }
/* /*