1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
/* $Id: avl_DoWithAll.cpp.h $ */
/** @file
* kAVLDoWithAll - Do with all nodes routine for AVL trees.
*/
/*
* Copyright (C) 2006-2023 Oracle and/or its affiliates.
*
* This file is part of VirtualBox base platform packages, as
* available from https://www.virtualbox.org.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation, in version 3 of the
* License.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <https://www.gnu.org/licenses>.
*
* The contents of this file may alternatively be used under the terms
* of the Common Development and Distribution License Version 1.0
* (CDDL), a copy of it is provided in the "COPYING.CDDL" file included
* in the VirtualBox distribution, in which case the provisions of the
* CDDL are applicable instead of those of the GPL.
*
* You may elect to license modified versions of this file under the
* terms and conditions of either the GPL or the CDDL or both.
*
* SPDX-License-Identifier: GPL-3.0-only OR CDDL-1.0
*/
#ifndef _kAVLDoWithAll_h_
#define _kAVLDoWithAll_h_
/**
* Iterates thru all nodes in the given tree.
* @returns 0 on success. Return from callback on failure.
* @param ppTree Pointer to the AVL-tree root node pointer.
* @param fFromLeft TRUE: Left to right.
* FALSE: Right to left.
* @param pfnCallBack Pointer to callback function.
* @param pvParam Userparameter passed on to the callback function.
*/
KAVL_DECL(int) KAVL_FN(DoWithAll)(PPKAVLNODECORE ppTree, int fFromLeft, PKAVLCALLBACK pfnCallBack, void * pvParam)
{
KAVLSTACK2 AVLStack;
PKAVLNODECORE pNode;
#ifdef KAVL_EQUAL_ALLOWED
PKAVLNODECORE pEqual;
#endif
int rc;
if (*ppTree == KAVL_NULL)
return VINF_SUCCESS;
AVLStack.cEntries = 1;
AVLStack.achFlags[0] = 0;
AVLStack.aEntries[0] = KAVL_GET_POINTER(ppTree);
if (fFromLeft)
{ /* from left */
while (AVLStack.cEntries > 0)
{
pNode = AVLStack.aEntries[AVLStack.cEntries - 1];
/* left */
if (!AVLStack.achFlags[AVLStack.cEntries - 1]++)
{
if (pNode->pLeft != KAVL_NULL)
{
AVLStack.achFlags[AVLStack.cEntries] = 0; /* 0 first, 1 last */
AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pLeft);
continue;
}
}
/* center */
Assert(pNode->uchHeight == RT_MAX(AVL_HEIGHTOF(KAVL_GET_POINTER_NULL(&pNode->pLeft)),
AVL_HEIGHTOF(KAVL_GET_POINTER_NULL(&pNode->pRight))) + 1);
rc = pfnCallBack(pNode, pvParam);
if (rc != VINF_SUCCESS)
return rc;
#ifdef KAVL_EQUAL_ALLOWED
if (pNode->pList != KAVL_NULL)
for (pEqual = KAVL_GET_POINTER(&pNode->pList); pEqual; pEqual = KAVL_GET_POINTER_NULL(&pEqual->pList))
{
rc = pfnCallBack(pEqual, pvParam);
if (rc != VINF_SUCCESS)
return rc;
}
#endif
/* right */
AVLStack.cEntries--;
if (pNode->pRight != KAVL_NULL)
{
AVLStack.achFlags[AVLStack.cEntries] = 0;
AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pRight);
}
} /* while */
}
else
{ /* from right */
while (AVLStack.cEntries > 0)
{
pNode = AVLStack.aEntries[AVLStack.cEntries - 1];
/* right */
if (!AVLStack.achFlags[AVLStack.cEntries - 1]++)
{
if (pNode->pRight != KAVL_NULL)
{
AVLStack.achFlags[AVLStack.cEntries] = 0; /* 0 first, 1 last */
AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pRight);
continue;
}
}
/* center */
Assert(pNode->uchHeight == RT_MAX(AVL_HEIGHTOF(KAVL_GET_POINTER_NULL(&pNode->pLeft)),
AVL_HEIGHTOF(KAVL_GET_POINTER_NULL(&pNode->pRight))) + 1);
rc = pfnCallBack(pNode, pvParam);
if (rc != VINF_SUCCESS)
return rc;
#ifdef KAVL_EQUAL_ALLOWED
if (pNode->pList != KAVL_NULL)
for (pEqual = KAVL_GET_POINTER(&pNode->pList); pEqual; pEqual = KAVL_GET_POINTER_NULL(&pEqual->pList))
{
rc = pfnCallBack(pEqual, pvParam);
if (rc != VINF_SUCCESS)
return rc;
}
#endif
/* left */
AVLStack.cEntries--;
if (pNode->pLeft != KAVL_NULL)
{
AVLStack.achFlags[AVLStack.cEntries] = 0;
AVLStack.aEntries[AVLStack.cEntries++] = KAVL_GET_POINTER(&pNode->pLeft);
}
} /* while */
}
return VINF_SUCCESS;
}
#endif
|
