nsalloc.c revision 1.1.1.17 1 1.1 jruoho /*******************************************************************************
2 1.1 jruoho *
3 1.1 jruoho * Module Name: nsalloc - Namespace allocation and deletion utilities
4 1.1 jruoho *
5 1.1 jruoho ******************************************************************************/
6 1.1 jruoho
7 1.1.1.16 christos /******************************************************************************
8 1.1.1.16 christos *
9 1.1.1.16 christos * 1. Copyright Notice
10 1.1.1.16 christos *
11 1.1.1.17 christos * Some or all of this work - Copyright (c) 1999 - 2025, Intel Corp.
12 1.1 jruoho * All rights reserved.
13 1.1 jruoho *
14 1.1.1.16 christos * 2. License
15 1.1.1.16 christos *
16 1.1.1.16 christos * 2.1. This is your license from Intel Corp. under its intellectual property
17 1.1.1.16 christos * rights. You may have additional license terms from the party that provided
18 1.1.1.16 christos * you this software, covering your right to use that party's intellectual
19 1.1.1.16 christos * property rights.
20 1.1.1.16 christos *
21 1.1.1.16 christos * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a
22 1.1.1.16 christos * copy of the source code appearing in this file ("Covered Code") an
23 1.1.1.16 christos * irrevocable, perpetual, worldwide license under Intel's copyrights in the
24 1.1.1.16 christos * base code distributed originally by Intel ("Original Intel Code") to copy,
25 1.1.1.16 christos * make derivatives, distribute, use and display any portion of the Covered
26 1.1.1.16 christos * Code in any form, with the right to sublicense such rights; and
27 1.1.1.16 christos *
28 1.1.1.16 christos * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent
29 1.1.1.16 christos * license (with the right to sublicense), under only those claims of Intel
30 1.1.1.16 christos * patents that are infringed by the Original Intel Code, to make, use, sell,
31 1.1.1.16 christos * offer to sell, and import the Covered Code and derivative works thereof
32 1.1.1.16 christos * solely to the minimum extent necessary to exercise the above copyright
33 1.1.1.16 christos * license, and in no event shall the patent license extend to any additions
34 1.1.1.16 christos * to or modifications of the Original Intel Code. No other license or right
35 1.1.1.16 christos * is granted directly or by implication, estoppel or otherwise;
36 1.1.1.16 christos *
37 1.1.1.16 christos * The above copyright and patent license is granted only if the following
38 1.1.1.16 christos * conditions are met:
39 1.1.1.16 christos *
40 1.1.1.16 christos * 3. Conditions
41 1.1.1.16 christos *
42 1.1.1.16 christos * 3.1. Redistribution of Source with Rights to Further Distribute Source.
43 1.1.1.16 christos * Redistribution of source code of any substantial portion of the Covered
44 1.1.1.16 christos * Code or modification with rights to further distribute source must include
45 1.1.1.16 christos * the above Copyright Notice, the above License, this list of Conditions,
46 1.1.1.16 christos * and the following Disclaimer and Export Compliance provision. In addition,
47 1.1.1.16 christos * Licensee must cause all Covered Code to which Licensee contributes to
48 1.1.1.16 christos * contain a file documenting the changes Licensee made to create that Covered
49 1.1.1.16 christos * Code and the date of any change. Licensee must include in that file the
50 1.1.1.16 christos * documentation of any changes made by any predecessor Licensee. Licensee
51 1.1.1.16 christos * must include a prominent statement that the modification is derived,
52 1.1.1.16 christos * directly or indirectly, from Original Intel Code.
53 1.1.1.16 christos *
54 1.1.1.16 christos * 3.2. Redistribution of Source with no Rights to Further Distribute Source.
55 1.1.1.16 christos * Redistribution of source code of any substantial portion of the Covered
56 1.1.1.16 christos * Code or modification without rights to further distribute source must
57 1.1.1.16 christos * include the following Disclaimer and Export Compliance provision in the
58 1.1.1.16 christos * documentation and/or other materials provided with distribution. In
59 1.1.1.16 christos * addition, Licensee may not authorize further sublicense of source of any
60 1.1.1.16 christos * portion of the Covered Code, and must include terms to the effect that the
61 1.1.1.16 christos * license from Licensee to its licensee is limited to the intellectual
62 1.1.1.16 christos * property embodied in the software Licensee provides to its licensee, and
63 1.1.1.16 christos * not to intellectual property embodied in modifications its licensee may
64 1.1.1.16 christos * make.
65 1.1.1.16 christos *
66 1.1.1.16 christos * 3.3. Redistribution of Executable. Redistribution in executable form of any
67 1.1.1.16 christos * substantial portion of the Covered Code or modification must reproduce the
68 1.1.1.16 christos * above Copyright Notice, and the following Disclaimer and Export Compliance
69 1.1.1.16 christos * provision in the documentation and/or other materials provided with the
70 1.1.1.16 christos * distribution.
71 1.1.1.16 christos *
72 1.1.1.16 christos * 3.4. Intel retains all right, title, and interest in and to the Original
73 1.1.1.16 christos * Intel Code.
74 1.1.1.16 christos *
75 1.1.1.16 christos * 3.5. Neither the name Intel nor any other trademark owned or controlled by
76 1.1.1.16 christos * Intel shall be used in advertising or otherwise to promote the sale, use or
77 1.1.1.16 christos * other dealings in products derived from or relating to the Covered Code
78 1.1.1.16 christos * without prior written authorization from Intel.
79 1.1.1.16 christos *
80 1.1.1.16 christos * 4. Disclaimer and Export Compliance
81 1.1.1.16 christos *
82 1.1.1.16 christos * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED
83 1.1.1.16 christos * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE
84 1.1.1.16 christos * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE,
85 1.1.1.16 christos * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY
86 1.1.1.16 christos * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY
87 1.1.1.16 christos * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A
88 1.1.1.16 christos * PARTICULAR PURPOSE.
89 1.1.1.16 christos *
90 1.1.1.16 christos * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES
91 1.1.1.16 christos * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR
92 1.1.1.16 christos * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT,
93 1.1.1.16 christos * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY
94 1.1.1.16 christos * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL
95 1.1.1.16 christos * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS
96 1.1.1.16 christos * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY
97 1.1.1.16 christos * LIMITED REMEDY.
98 1.1.1.16 christos *
99 1.1.1.16 christos * 4.3. Licensee shall not export, either directly or indirectly, any of this
100 1.1.1.16 christos * software or system incorporating such software without first obtaining any
101 1.1.1.16 christos * required license or other approval from the U. S. Department of Commerce or
102 1.1.1.16 christos * any other agency or department of the United States Government. In the
103 1.1.1.16 christos * event Licensee exports any such software from the United States or
104 1.1.1.16 christos * re-exports any such software from a foreign destination, Licensee shall
105 1.1.1.16 christos * ensure that the distribution and export/re-export of the software is in
106 1.1.1.16 christos * compliance with all laws, regulations, orders, or other restrictions of the
107 1.1.1.16 christos * U.S. Export Administration Regulations. Licensee agrees that neither it nor
108 1.1.1.16 christos * any of its subsidiaries will export/re-export any technical data, process,
109 1.1.1.16 christos * software, or service, directly or indirectly, to any country for which the
110 1.1.1.16 christos * United States government or any agency thereof requires an export license,
111 1.1.1.16 christos * other governmental approval, or letter of assurance, without first obtaining
112 1.1.1.16 christos * such license, approval or letter.
113 1.1.1.16 christos *
114 1.1.1.16 christos *****************************************************************************
115 1.1.1.16 christos *
116 1.1.1.16 christos * Alternatively, you may choose to be licensed under the terms of the
117 1.1.1.16 christos * following license:
118 1.1.1.16 christos *
119 1.1.1.2 jruoho * Redistribution and use in source and binary forms, with or without
120 1.1.1.2 jruoho * modification, are permitted provided that the following conditions
121 1.1.1.2 jruoho * are met:
122 1.1.1.2 jruoho * 1. Redistributions of source code must retain the above copyright
123 1.1.1.2 jruoho * notice, this list of conditions, and the following disclaimer,
124 1.1.1.2 jruoho * without modification.
125 1.1.1.2 jruoho * 2. Redistributions in binary form must reproduce at minimum a disclaimer
126 1.1.1.2 jruoho * substantially similar to the "NO WARRANTY" disclaimer below
127 1.1.1.2 jruoho * ("Disclaimer") and any redistribution must be conditioned upon
128 1.1.1.2 jruoho * including a substantially similar Disclaimer requirement for further
129 1.1.1.2 jruoho * binary redistribution.
130 1.1.1.2 jruoho * 3. Neither the names of the above-listed copyright holders nor the names
131 1.1.1.2 jruoho * of any contributors may be used to endorse or promote products derived
132 1.1.1.2 jruoho * from this software without specific prior written permission.
133 1.1.1.2 jruoho *
134 1.1.1.2 jruoho * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
135 1.1.1.2 jruoho * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
136 1.1.1.13 christos * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
137 1.1.1.2 jruoho * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
138 1.1.1.16 christos * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
139 1.1.1.16 christos * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
140 1.1.1.16 christos * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
141 1.1.1.16 christos * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
142 1.1.1.16 christos * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
143 1.1.1.16 christos * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
144 1.1.1.16 christos * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
145 1.1.1.16 christos *
146 1.1.1.16 christos * Alternatively, you may choose to be licensed under the terms of the
147 1.1.1.16 christos * GNU General Public License ("GPL") version 2 as published by the Free
148 1.1.1.16 christos * Software Foundation.
149 1.1.1.16 christos *
150 1.1.1.16 christos *****************************************************************************/
151 1.1 jruoho
152 1.1 jruoho #include "acpi.h"
153 1.1 jruoho #include "accommon.h"
154 1.1 jruoho #include "acnamesp.h"
155 1.1 jruoho
156 1.1 jruoho
157 1.1 jruoho #define _COMPONENT ACPI_NAMESPACE
158 1.1 jruoho ACPI_MODULE_NAME ("nsalloc")
159 1.1 jruoho
160 1.1 jruoho
161 1.1 jruoho /*******************************************************************************
162 1.1 jruoho *
163 1.1 jruoho * FUNCTION: AcpiNsCreateNode
164 1.1 jruoho *
165 1.1 jruoho * PARAMETERS: Name - Name of the new node (4 char ACPI name)
166 1.1 jruoho *
167 1.1 jruoho * RETURN: New namespace node (Null on failure)
168 1.1 jruoho *
169 1.1 jruoho * DESCRIPTION: Create a namespace node
170 1.1 jruoho *
171 1.1 jruoho ******************************************************************************/
172 1.1 jruoho
173 1.1 jruoho ACPI_NAMESPACE_NODE *
174 1.1 jruoho AcpiNsCreateNode (
175 1.1 jruoho UINT32 Name)
176 1.1 jruoho {
177 1.1 jruoho ACPI_NAMESPACE_NODE *Node;
178 1.1 jruoho #ifdef ACPI_DBG_TRACK_ALLOCATIONS
179 1.1 jruoho UINT32 Temp;
180 1.1 jruoho #endif
181 1.1 jruoho
182 1.1 jruoho
183 1.1 jruoho ACPI_FUNCTION_TRACE (NsCreateNode);
184 1.1 jruoho
185 1.1 jruoho
186 1.1 jruoho Node = AcpiOsAcquireObject (AcpiGbl_NamespaceCache);
187 1.1 jruoho if (!Node)
188 1.1 jruoho {
189 1.1 jruoho return_PTR (NULL);
190 1.1 jruoho }
191 1.1 jruoho
192 1.1 jruoho ACPI_MEM_TRACKING (AcpiGbl_NsNodeList->TotalAllocated++);
193 1.1 jruoho
194 1.1 jruoho #ifdef ACPI_DBG_TRACK_ALLOCATIONS
195 1.1 jruoho Temp = AcpiGbl_NsNodeList->TotalAllocated -
196 1.1.1.6 christos AcpiGbl_NsNodeList->TotalFreed;
197 1.1 jruoho if (Temp > AcpiGbl_NsNodeList->MaxOccupied)
198 1.1 jruoho {
199 1.1 jruoho AcpiGbl_NsNodeList->MaxOccupied = Temp;
200 1.1 jruoho }
201 1.1 jruoho #endif
202 1.1 jruoho
203 1.1 jruoho Node->Name.Integer = Name;
204 1.1 jruoho ACPI_SET_DESCRIPTOR_TYPE (Node, ACPI_DESC_TYPE_NAMED);
205 1.1 jruoho return_PTR (Node);
206 1.1 jruoho }
207 1.1 jruoho
208 1.1 jruoho
209 1.1 jruoho /*******************************************************************************
210 1.1 jruoho *
211 1.1 jruoho * FUNCTION: AcpiNsDeleteNode
212 1.1 jruoho *
213 1.1 jruoho * PARAMETERS: Node - Node to be deleted
214 1.1 jruoho *
215 1.1 jruoho * RETURN: None
216 1.1 jruoho *
217 1.1 jruoho * DESCRIPTION: Delete a namespace node. All node deletions must come through
218 1.1 jruoho * here. Detaches any attached objects, including any attached
219 1.1 jruoho * data. If a handler is associated with attached data, it is
220 1.1 jruoho * invoked before the node is deleted.
221 1.1 jruoho *
222 1.1 jruoho ******************************************************************************/
223 1.1 jruoho
224 1.1 jruoho void
225 1.1 jruoho AcpiNsDeleteNode (
226 1.1 jruoho ACPI_NAMESPACE_NODE *Node)
227 1.1 jruoho {
228 1.1 jruoho ACPI_OPERAND_OBJECT *ObjDesc;
229 1.1.1.3 christos ACPI_OPERAND_OBJECT *NextDesc;
230 1.1 jruoho
231 1.1 jruoho
232 1.1 jruoho ACPI_FUNCTION_NAME (NsDeleteNode);
233 1.1 jruoho
234 1.1 jruoho
235 1.1.1.9 christos if (!Node)
236 1.1.1.9 christos {
237 1.1.1.9 christos return_VOID;
238 1.1.1.9 christos }
239 1.1.1.9 christos
240 1.1 jruoho /* Detach an object if there is one */
241 1.1 jruoho
242 1.1 jruoho AcpiNsDetachObject (Node);
243 1.1 jruoho
244 1.1 jruoho /*
245 1.1.1.3 christos * Delete an attached data object list if present (objects that were
246 1.1.1.3 christos * attached via AcpiAttachData). Note: After any normal object is
247 1.1.1.3 christos * detached above, the only possible remaining object(s) are data
248 1.1.1.3 christos * objects, in a linked list.
249 1.1 jruoho */
250 1.1 jruoho ObjDesc = Node->Object;
251 1.1.1.3 christos while (ObjDesc &&
252 1.1 jruoho (ObjDesc->Common.Type == ACPI_TYPE_LOCAL_DATA))
253 1.1 jruoho {
254 1.1 jruoho /* Invoke the attached data deletion handler if present */
255 1.1 jruoho
256 1.1 jruoho if (ObjDesc->Data.Handler)
257 1.1 jruoho {
258 1.1 jruoho ObjDesc->Data.Handler (Node, ObjDesc->Data.Pointer);
259 1.1 jruoho }
260 1.1 jruoho
261 1.1.1.3 christos NextDesc = ObjDesc->Common.NextObject;
262 1.1 jruoho AcpiUtRemoveReference (ObjDesc);
263 1.1.1.3 christos ObjDesc = NextDesc;
264 1.1.1.3 christos }
265 1.1.1.3 christos
266 1.1.1.3 christos /* Special case for the statically allocated root node */
267 1.1.1.3 christos
268 1.1.1.3 christos if (Node == AcpiGbl_RootNode)
269 1.1.1.3 christos {
270 1.1.1.3 christos return;
271 1.1 jruoho }
272 1.1 jruoho
273 1.1 jruoho /* Now we can delete the node */
274 1.1 jruoho
275 1.1 jruoho (void) AcpiOsReleaseObject (AcpiGbl_NamespaceCache, Node);
276 1.1 jruoho
277 1.1 jruoho ACPI_MEM_TRACKING (AcpiGbl_NsNodeList->TotalFreed++);
278 1.1 jruoho ACPI_DEBUG_PRINT ((ACPI_DB_ALLOCATIONS, "Node %p, Remaining %X\n",
279 1.1 jruoho Node, AcpiGbl_CurrentNodeCount));
280 1.1 jruoho }
281 1.1 jruoho
282 1.1 jruoho
283 1.1 jruoho /*******************************************************************************
284 1.1 jruoho *
285 1.1 jruoho * FUNCTION: AcpiNsRemoveNode
286 1.1 jruoho *
287 1.1 jruoho * PARAMETERS: Node - Node to be removed/deleted
288 1.1 jruoho *
289 1.1 jruoho * RETURN: None
290 1.1 jruoho *
291 1.1 jruoho * DESCRIPTION: Remove (unlink) and delete a namespace node
292 1.1 jruoho *
293 1.1 jruoho ******************************************************************************/
294 1.1 jruoho
295 1.1 jruoho void
296 1.1 jruoho AcpiNsRemoveNode (
297 1.1 jruoho ACPI_NAMESPACE_NODE *Node)
298 1.1 jruoho {
299 1.1 jruoho ACPI_NAMESPACE_NODE *ParentNode;
300 1.1 jruoho ACPI_NAMESPACE_NODE *PrevNode;
301 1.1 jruoho ACPI_NAMESPACE_NODE *NextNode;
302 1.1 jruoho
303 1.1 jruoho
304 1.1 jruoho ACPI_FUNCTION_TRACE_PTR (NsRemoveNode, Node);
305 1.1 jruoho
306 1.1 jruoho
307 1.1 jruoho ParentNode = Node->Parent;
308 1.1 jruoho
309 1.1 jruoho PrevNode = NULL;
310 1.1 jruoho NextNode = ParentNode->Child;
311 1.1 jruoho
312 1.1 jruoho /* Find the node that is the previous peer in the parent's child list */
313 1.1 jruoho
314 1.1 jruoho while (NextNode != Node)
315 1.1 jruoho {
316 1.1 jruoho PrevNode = NextNode;
317 1.1 jruoho NextNode = NextNode->Peer;
318 1.1 jruoho }
319 1.1 jruoho
320 1.1 jruoho if (PrevNode)
321 1.1 jruoho {
322 1.1 jruoho /* Node is not first child, unlink it */
323 1.1 jruoho
324 1.1 jruoho PrevNode->Peer = Node->Peer;
325 1.1 jruoho }
326 1.1 jruoho else
327 1.1 jruoho {
328 1.1 jruoho /*
329 1.1 jruoho * Node is first child (has no previous peer).
330 1.1 jruoho * Link peer list to parent
331 1.1 jruoho */
332 1.1 jruoho ParentNode->Child = Node->Peer;
333 1.1 jruoho }
334 1.1 jruoho
335 1.1 jruoho /* Delete the node and any attached objects */
336 1.1 jruoho
337 1.1 jruoho AcpiNsDeleteNode (Node);
338 1.1 jruoho return_VOID;
339 1.1 jruoho }
340 1.1 jruoho
341 1.1 jruoho
342 1.1 jruoho /*******************************************************************************
343 1.1 jruoho *
344 1.1 jruoho * FUNCTION: AcpiNsInstallNode
345 1.1 jruoho *
346 1.1 jruoho * PARAMETERS: WalkState - Current state of the walk
347 1.1 jruoho * ParentNode - The parent of the new Node
348 1.1 jruoho * Node - The new Node to install
349 1.1 jruoho * Type - ACPI object type of the new Node
350 1.1 jruoho *
351 1.1 jruoho * RETURN: None
352 1.1 jruoho *
353 1.1 jruoho * DESCRIPTION: Initialize a new namespace node and install it amongst
354 1.1 jruoho * its peers.
355 1.1 jruoho *
356 1.1 jruoho * Note: Current namespace lookup is linear search. This appears
357 1.1 jruoho * to be sufficient as namespace searches consume only a small
358 1.1 jruoho * fraction of the execution time of the ACPI subsystem.
359 1.1 jruoho *
360 1.1 jruoho ******************************************************************************/
361 1.1 jruoho
362 1.1 jruoho void
363 1.1 jruoho AcpiNsInstallNode (
364 1.1 jruoho ACPI_WALK_STATE *WalkState,
365 1.1 jruoho ACPI_NAMESPACE_NODE *ParentNode, /* Parent */
366 1.1 jruoho ACPI_NAMESPACE_NODE *Node, /* New Child*/
367 1.1 jruoho ACPI_OBJECT_TYPE Type)
368 1.1 jruoho {
369 1.1 jruoho ACPI_OWNER_ID OwnerId = 0;
370 1.1 jruoho ACPI_NAMESPACE_NODE *ChildNode;
371 1.1 jruoho
372 1.1 jruoho
373 1.1 jruoho ACPI_FUNCTION_TRACE (NsInstallNode);
374 1.1 jruoho
375 1.1 jruoho
376 1.1 jruoho if (WalkState)
377 1.1 jruoho {
378 1.1 jruoho /*
379 1.1 jruoho * Get the owner ID from the Walk state. The owner ID is used to
380 1.1 jruoho * track table deletion and deletion of objects created by methods.
381 1.1 jruoho */
382 1.1 jruoho OwnerId = WalkState->OwnerId;
383 1.1 jruoho
384 1.1 jruoho if ((WalkState->MethodDesc) &&
385 1.1 jruoho (ParentNode != WalkState->MethodNode))
386 1.1 jruoho {
387 1.1 jruoho /*
388 1.1 jruoho * A method is creating a new node that is not a child of the
389 1.1 jruoho * method (it is non-local). Mark the executing method as having
390 1.1 jruoho * modified the namespace. This is used for cleanup when the
391 1.1 jruoho * method exits.
392 1.1 jruoho */
393 1.1.1.6 christos WalkState->MethodDesc->Method.InfoFlags |=
394 1.1.1.6 christos ACPI_METHOD_MODIFIED_NAMESPACE;
395 1.1 jruoho }
396 1.1 jruoho }
397 1.1 jruoho
398 1.1 jruoho /* Link the new entry into the parent and existing children */
399 1.1 jruoho
400 1.1 jruoho Node->Peer = NULL;
401 1.1 jruoho Node->Parent = ParentNode;
402 1.1 jruoho ChildNode = ParentNode->Child;
403 1.1 jruoho
404 1.1 jruoho if (!ChildNode)
405 1.1 jruoho {
406 1.1 jruoho ParentNode->Child = Node;
407 1.1 jruoho }
408 1.1 jruoho else
409 1.1 jruoho {
410 1.1 jruoho /* Add node to the end of the peer list */
411 1.1 jruoho
412 1.1 jruoho while (ChildNode->Peer)
413 1.1 jruoho {
414 1.1 jruoho ChildNode = ChildNode->Peer;
415 1.1 jruoho }
416 1.1 jruoho
417 1.1 jruoho ChildNode->Peer = Node;
418 1.1 jruoho }
419 1.1 jruoho
420 1.1 jruoho /* Init the new entry */
421 1.1 jruoho
422 1.1 jruoho Node->OwnerId = OwnerId;
423 1.1 jruoho Node->Type = (UINT8) Type;
424 1.1 jruoho
425 1.1 jruoho ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
426 1.1.1.10 christos "%4.4s (%s) [Node %p Owner %3.3X] added to %4.4s (%s) [Node %p]\n",
427 1.1 jruoho AcpiUtGetNodeName (Node), AcpiUtGetTypeName (Node->Type), Node, OwnerId,
428 1.1 jruoho AcpiUtGetNodeName (ParentNode), AcpiUtGetTypeName (ParentNode->Type),
429 1.1 jruoho ParentNode));
430 1.1 jruoho
431 1.1 jruoho return_VOID;
432 1.1 jruoho }
433 1.1 jruoho
434 1.1 jruoho
435 1.1 jruoho /*******************************************************************************
436 1.1 jruoho *
437 1.1 jruoho * FUNCTION: AcpiNsDeleteChildren
438 1.1 jruoho *
439 1.1 jruoho * PARAMETERS: ParentNode - Delete this objects children
440 1.1 jruoho *
441 1.1 jruoho * RETURN: None.
442 1.1 jruoho *
443 1.1 jruoho * DESCRIPTION: Delete all children of the parent object. In other words,
444 1.1 jruoho * deletes a "scope".
445 1.1 jruoho *
446 1.1 jruoho ******************************************************************************/
447 1.1 jruoho
448 1.1 jruoho void
449 1.1 jruoho AcpiNsDeleteChildren (
450 1.1 jruoho ACPI_NAMESPACE_NODE *ParentNode)
451 1.1 jruoho {
452 1.1 jruoho ACPI_NAMESPACE_NODE *NextNode;
453 1.1 jruoho ACPI_NAMESPACE_NODE *NodeToDelete;
454 1.1 jruoho
455 1.1 jruoho
456 1.1 jruoho ACPI_FUNCTION_TRACE_PTR (NsDeleteChildren, ParentNode);
457 1.1 jruoho
458 1.1 jruoho
459 1.1 jruoho if (!ParentNode)
460 1.1 jruoho {
461 1.1 jruoho return_VOID;
462 1.1 jruoho }
463 1.1 jruoho
464 1.1 jruoho /* Deallocate all children at this level */
465 1.1 jruoho
466 1.1 jruoho NextNode = ParentNode->Child;
467 1.1 jruoho while (NextNode)
468 1.1 jruoho {
469 1.1 jruoho /* Grandchildren should have all been deleted already */
470 1.1 jruoho
471 1.1 jruoho if (NextNode->Child)
472 1.1 jruoho {
473 1.1 jruoho ACPI_ERROR ((AE_INFO, "Found a grandchild! P=%p C=%p",
474 1.1 jruoho ParentNode, NextNode));
475 1.1 jruoho }
476 1.1 jruoho
477 1.1 jruoho /*
478 1.1 jruoho * Delete this child node and move on to the next child in the list.
479 1.1 jruoho * No need to unlink the node since we are deleting the entire branch.
480 1.1 jruoho */
481 1.1 jruoho NodeToDelete = NextNode;
482 1.1 jruoho NextNode = NextNode->Peer;
483 1.1 jruoho AcpiNsDeleteNode (NodeToDelete);
484 1.1.1.12 christos }
485 1.1 jruoho
486 1.1 jruoho /* Clear the parent's child pointer */
487 1.1 jruoho
488 1.1 jruoho ParentNode->Child = NULL;
489 1.1 jruoho return_VOID;
490 1.1 jruoho }
491 1.1 jruoho
492 1.1 jruoho
493 1.1 jruoho /*******************************************************************************
494 1.1 jruoho *
495 1.1 jruoho * FUNCTION: AcpiNsDeleteNamespaceSubtree
496 1.1 jruoho *
497 1.1 jruoho * PARAMETERS: ParentNode - Root of the subtree to be deleted
498 1.1 jruoho *
499 1.1 jruoho * RETURN: None.
500 1.1 jruoho *
501 1.1.1.3 christos * DESCRIPTION: Delete a subtree of the namespace. This includes all objects
502 1.1 jruoho * stored within the subtree.
503 1.1 jruoho *
504 1.1 jruoho ******************************************************************************/
505 1.1 jruoho
506 1.1 jruoho void
507 1.1 jruoho AcpiNsDeleteNamespaceSubtree (
508 1.1 jruoho ACPI_NAMESPACE_NODE *ParentNode)
509 1.1 jruoho {
510 1.1 jruoho ACPI_NAMESPACE_NODE *ChildNode = NULL;
511 1.1 jruoho UINT32 Level = 1;
512 1.1.1.2 jruoho ACPI_STATUS Status;
513 1.1 jruoho
514 1.1 jruoho
515 1.1 jruoho ACPI_FUNCTION_TRACE (NsDeleteNamespaceSubtree);
516 1.1 jruoho
517 1.1 jruoho
518 1.1 jruoho if (!ParentNode)
519 1.1 jruoho {
520 1.1 jruoho return_VOID;
521 1.1 jruoho }
522 1.1 jruoho
523 1.1.1.2 jruoho /* Lock namespace for possible update */
524 1.1.1.2 jruoho
525 1.1.1.2 jruoho Status = AcpiUtAcquireMutex (ACPI_MTX_NAMESPACE);
526 1.1.1.2 jruoho if (ACPI_FAILURE (Status))
527 1.1.1.2 jruoho {
528 1.1.1.2 jruoho return_VOID;
529 1.1.1.2 jruoho }
530 1.1.1.2 jruoho
531 1.1 jruoho /*
532 1.1 jruoho * Traverse the tree of objects until we bubble back up
533 1.1 jruoho * to where we started.
534 1.1 jruoho */
535 1.1 jruoho while (Level > 0)
536 1.1 jruoho {
537 1.1 jruoho /* Get the next node in this scope (NULL if none) */
538 1.1 jruoho
539 1.1 jruoho ChildNode = AcpiNsGetNextNode (ParentNode, ChildNode);
540 1.1 jruoho if (ChildNode)
541 1.1 jruoho {
542 1.1 jruoho /* Found a child node - detach any attached object */
543 1.1 jruoho
544 1.1 jruoho AcpiNsDetachObject (ChildNode);
545 1.1 jruoho
546 1.1 jruoho /* Check if this node has any children */
547 1.1 jruoho
548 1.1 jruoho if (ChildNode->Child)
549 1.1 jruoho {
550 1.1 jruoho /*
551 1.1 jruoho * There is at least one child of this node,
552 1.1 jruoho * visit the node
553 1.1 jruoho */
554 1.1 jruoho Level++;
555 1.1 jruoho ParentNode = ChildNode;
556 1.1 jruoho ChildNode = NULL;
557 1.1 jruoho }
558 1.1 jruoho }
559 1.1 jruoho else
560 1.1 jruoho {
561 1.1 jruoho /*
562 1.1 jruoho * No more children of this parent node.
563 1.1 jruoho * Move up to the grandparent.
564 1.1 jruoho */
565 1.1 jruoho Level--;
566 1.1 jruoho
567 1.1 jruoho /*
568 1.1 jruoho * Now delete all of the children of this parent
569 1.1 jruoho * all at the same time.
570 1.1 jruoho */
571 1.1 jruoho AcpiNsDeleteChildren (ParentNode);
572 1.1 jruoho
573 1.1 jruoho /* New "last child" is this parent node */
574 1.1 jruoho
575 1.1 jruoho ChildNode = ParentNode;
576 1.1 jruoho
577 1.1 jruoho /* Move up the tree to the grandparent */
578 1.1 jruoho
579 1.1 jruoho ParentNode = ParentNode->Parent;
580 1.1 jruoho }
581 1.1 jruoho }
582 1.1 jruoho
583 1.1.1.2 jruoho (void) AcpiUtReleaseMutex (ACPI_MTX_NAMESPACE);
584 1.1 jruoho return_VOID;
585 1.1 jruoho }
586 1.1 jruoho
587 1.1 jruoho
588 1.1 jruoho /*******************************************************************************
589 1.1 jruoho *
590 1.1 jruoho * FUNCTION: AcpiNsDeleteNamespaceByOwner
591 1.1 jruoho *
592 1.1 jruoho * PARAMETERS: OwnerId - All nodes with this owner will be deleted
593 1.1 jruoho *
594 1.1 jruoho * RETURN: Status
595 1.1 jruoho *
596 1.1 jruoho * DESCRIPTION: Delete entries within the namespace that are owned by a
597 1.1.1.3 christos * specific ID. Used to delete entire ACPI tables. All
598 1.1 jruoho * reference counts are updated.
599 1.1 jruoho *
600 1.1 jruoho * MUTEX: Locks namespace during deletion walk.
601 1.1 jruoho *
602 1.1 jruoho ******************************************************************************/
603 1.1 jruoho
604 1.1 jruoho void
605 1.1 jruoho AcpiNsDeleteNamespaceByOwner (
606 1.1 jruoho ACPI_OWNER_ID OwnerId)
607 1.1 jruoho {
608 1.1 jruoho ACPI_NAMESPACE_NODE *ChildNode;
609 1.1 jruoho ACPI_NAMESPACE_NODE *DeletionNode;
610 1.1 jruoho ACPI_NAMESPACE_NODE *ParentNode;
611 1.1 jruoho UINT32 Level;
612 1.1 jruoho ACPI_STATUS Status;
613 1.1 jruoho
614 1.1 jruoho
615 1.1 jruoho ACPI_FUNCTION_TRACE_U32 (NsDeleteNamespaceByOwner, OwnerId);
616 1.1 jruoho
617 1.1 jruoho
618 1.1 jruoho if (OwnerId == 0)
619 1.1 jruoho {
620 1.1 jruoho return_VOID;
621 1.1 jruoho }
622 1.1 jruoho
623 1.1 jruoho /* Lock namespace for possible update */
624 1.1 jruoho
625 1.1 jruoho Status = AcpiUtAcquireMutex (ACPI_MTX_NAMESPACE);
626 1.1 jruoho if (ACPI_FAILURE (Status))
627 1.1 jruoho {
628 1.1 jruoho return_VOID;
629 1.1 jruoho }
630 1.1 jruoho
631 1.1 jruoho DeletionNode = NULL;
632 1.1 jruoho ParentNode = AcpiGbl_RootNode;
633 1.1 jruoho ChildNode = NULL;
634 1.1 jruoho Level = 1;
635 1.1 jruoho
636 1.1 jruoho /*
637 1.1 jruoho * Traverse the tree of nodes until we bubble back up
638 1.1 jruoho * to where we started.
639 1.1 jruoho */
640 1.1 jruoho while (Level > 0)
641 1.1 jruoho {
642 1.1 jruoho /*
643 1.1 jruoho * Get the next child of this parent node. When ChildNode is NULL,
644 1.1 jruoho * the first child of the parent is returned
645 1.1 jruoho */
646 1.1 jruoho ChildNode = AcpiNsGetNextNode (ParentNode, ChildNode);
647 1.1 jruoho
648 1.1 jruoho if (DeletionNode)
649 1.1 jruoho {
650 1.1 jruoho AcpiNsDeleteChildren (DeletionNode);
651 1.1 jruoho AcpiNsRemoveNode (DeletionNode);
652 1.1 jruoho DeletionNode = NULL;
653 1.1 jruoho }
654 1.1 jruoho
655 1.1 jruoho if (ChildNode)
656 1.1 jruoho {
657 1.1 jruoho if (ChildNode->OwnerId == OwnerId)
658 1.1 jruoho {
659 1.1 jruoho /* Found a matching child node - detach any attached object */
660 1.1 jruoho
661 1.1 jruoho AcpiNsDetachObject (ChildNode);
662 1.1 jruoho }
663 1.1 jruoho
664 1.1 jruoho /* Check if this node has any children */
665 1.1 jruoho
666 1.1 jruoho if (ChildNode->Child)
667 1.1 jruoho {
668 1.1 jruoho /*
669 1.1 jruoho * There is at least one child of this node,
670 1.1 jruoho * visit the node
671 1.1 jruoho */
672 1.1 jruoho Level++;
673 1.1 jruoho ParentNode = ChildNode;
674 1.1 jruoho ChildNode = NULL;
675 1.1 jruoho }
676 1.1 jruoho else if (ChildNode->OwnerId == OwnerId)
677 1.1 jruoho {
678 1.1 jruoho DeletionNode = ChildNode;
679 1.1 jruoho }
680 1.1 jruoho }
681 1.1 jruoho else
682 1.1 jruoho {
683 1.1 jruoho /*
684 1.1 jruoho * No more children of this parent node.
685 1.1 jruoho * Move up to the grandparent.
686 1.1 jruoho */
687 1.1 jruoho Level--;
688 1.1 jruoho if (Level != 0)
689 1.1 jruoho {
690 1.1 jruoho if (ParentNode->OwnerId == OwnerId)
691 1.1 jruoho {
692 1.1 jruoho DeletionNode = ParentNode;
693 1.1 jruoho }
694 1.1 jruoho }
695 1.1 jruoho
696 1.1 jruoho /* New "last child" is this parent node */
697 1.1 jruoho
698 1.1 jruoho ChildNode = ParentNode;
699 1.1 jruoho
700 1.1 jruoho /* Move up the tree to the grandparent */
701 1.1 jruoho
702 1.1 jruoho ParentNode = ParentNode->Parent;
703 1.1 jruoho }
704 1.1 jruoho }
705 1.1 jruoho
706 1.1 jruoho (void) AcpiUtReleaseMutex (ACPI_MTX_NAMESPACE);
707 1.1 jruoho return_VOID;
708 1.1 jruoho }
709