1 /*******************************************************************************
3 * Module Name: nsalloc - Namespace allocation and deletion utilities
5 ******************************************************************************/
7 /******************************************************************************
11 * Some or all of this work - Copyright (c) 1999 - 2015, Intel Corp.
12 * All rights reserved.
16 * 2.1. This is your license from Intel Corp. under its intellectual property
17 * rights. You may have additional license terms from the party that provided
18 * you this software, covering your right to use that party's intellectual
21 * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a
22 * copy of the source code appearing in this file ("Covered Code") an
23 * irrevocable, perpetual, worldwide license under Intel's copyrights in the
24 * base code distributed originally by Intel ("Original Intel Code") to copy,
25 * make derivatives, distribute, use and display any portion of the Covered
26 * Code in any form, with the right to sublicense such rights; and
28 * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent
29 * license (with the right to sublicense), under only those claims of Intel
30 * patents that are infringed by the Original Intel Code, to make, use, sell,
31 * offer to sell, and import the Covered Code and derivative works thereof
32 * solely to the minimum extent necessary to exercise the above copyright
33 * license, and in no event shall the patent license extend to any additions
34 * to or modifications of the Original Intel Code. No other license or right
35 * is granted directly or by implication, estoppel or otherwise;
37 * The above copyright and patent license is granted only if the following
42 * 3.1. Redistribution of Source with Rights to Further Distribute Source.
43 * Redistribution of source code of any substantial portion of the Covered
44 * Code or modification with rights to further distribute source must include
45 * the above Copyright Notice, the above License, this list of Conditions,
46 * and the following Disclaimer and Export Compliance provision. In addition,
47 * Licensee must cause all Covered Code to which Licensee contributes to
48 * contain a file documenting the changes Licensee made to create that Covered
49 * Code and the date of any change. Licensee must include in that file the
50 * documentation of any changes made by any predecessor Licensee. Licensee
51 * must include a prominent statement that the modification is derived,
52 * directly or indirectly, from Original Intel Code.
54 * 3.2. Redistribution of Source with no Rights to Further Distribute Source.
55 * Redistribution of source code of any substantial portion of the Covered
56 * Code or modification without rights to further distribute source must
57 * include the following Disclaimer and Export Compliance provision in the
58 * documentation and/or other materials provided with distribution. In
59 * addition, Licensee may not authorize further sublicense of source of any
60 * portion of the Covered Code, and must include terms to the effect that the
61 * license from Licensee to its licensee is limited to the intellectual
62 * property embodied in the software Licensee provides to its licensee, and
63 * not to intellectual property embodied in modifications its licensee may
66 * 3.3. Redistribution of Executable. Redistribution in executable form of any
67 * substantial portion of the Covered Code or modification must reproduce the
68 * above Copyright Notice, and the following Disclaimer and Export Compliance
69 * provision in the documentation and/or other materials provided with the
72 * 3.4. Intel retains all right, title, and interest in and to the Original
75 * 3.5. Neither the name Intel nor any other trademark owned or controlled by
76 * Intel shall be used in advertising or otherwise to promote the sale, use or
77 * other dealings in products derived from or relating to the Covered Code
78 * without prior written authorization from Intel.
80 * 4. Disclaimer and Export Compliance
82 * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED
83 * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE
84 * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE,
85 * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY
86 * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY
87 * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A
90 * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES
91 * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR
92 * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT,
93 * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY
94 * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL
95 * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS
96 * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY
99 * 4.3. Licensee shall not export, either directly or indirectly, any of this
100 * software or system incorporating such software without first obtaining any
101 * required license or other approval from the U. S. Department of Commerce or
102 * any other agency or department of the United States Government. In the
103 * event Licensee exports any such software from the United States or
104 * re-exports any such software from a foreign destination, Licensee shall
105 * ensure that the distribution and export/re-export of the software is in
106 * compliance with all laws, regulations, orders, or other restrictions of the
107 * U.S. Export Administration Regulations. Licensee agrees that neither it nor
108 * any of its subsidiaries will export/re-export any technical data, process,
109 * software, or service, directly or indirectly, to any country for which the
110 * United States government or any agency thereof requires an export license,
111 * other governmental approval, or letter of assurance, without first obtaining
112 * such license, approval or letter.
114 *****************************************************************************/
117 #include "accommon.h"
118 #include "acnamesp.h"
121 #define _COMPONENT ACPI_NAMESPACE
122 ACPI_MODULE_NAME ("nsalloc")
125 /*******************************************************************************
127 * FUNCTION: AcpiNsCreateNode
129 * PARAMETERS: Name - Name of the new node (4 char ACPI name)
131 * RETURN: New namespace node (Null on failure)
133 * DESCRIPTION: Create a namespace node
135 ******************************************************************************/
137 ACPI_NAMESPACE_NODE *
141 ACPI_NAMESPACE_NODE *Node;
142 #ifdef ACPI_DBG_TRACK_ALLOCATIONS
147 ACPI_FUNCTION_TRACE (NsCreateNode);
150 Node = AcpiOsAcquireObject (AcpiGbl_NamespaceCache);
156 ACPI_MEM_TRACKING (AcpiGbl_NsNodeList->TotalAllocated++);
158 #ifdef ACPI_DBG_TRACK_ALLOCATIONS
159 Temp = AcpiGbl_NsNodeList->TotalAllocated -
160 AcpiGbl_NsNodeList->TotalFreed;
161 if (Temp > AcpiGbl_NsNodeList->MaxOccupied)
163 AcpiGbl_NsNodeList->MaxOccupied = Temp;
167 Node->Name.Integer = Name;
168 ACPI_SET_DESCRIPTOR_TYPE (Node, ACPI_DESC_TYPE_NAMED);
173 /*******************************************************************************
175 * FUNCTION: AcpiNsDeleteNode
177 * PARAMETERS: Node - Node to be deleted
181 * DESCRIPTION: Delete a namespace node. All node deletions must come through
182 * here. Detaches any attached objects, including any attached
183 * data. If a handler is associated with attached data, it is
184 * invoked before the node is deleted.
186 ******************************************************************************/
190 ACPI_NAMESPACE_NODE *Node)
192 ACPI_OPERAND_OBJECT *ObjDesc;
193 ACPI_OPERAND_OBJECT *NextDesc;
196 ACPI_FUNCTION_NAME (NsDeleteNode);
199 /* Detach an object if there is one */
201 AcpiNsDetachObject (Node);
204 * Delete an attached data object list if present (objects that were
205 * attached via AcpiAttachData). Note: After any normal object is
206 * detached above, the only possible remaining object(s) are data
207 * objects, in a linked list.
209 ObjDesc = Node->Object;
211 (ObjDesc->Common.Type == ACPI_TYPE_LOCAL_DATA))
213 /* Invoke the attached data deletion handler if present */
215 if (ObjDesc->Data.Handler)
217 ObjDesc->Data.Handler (Node, ObjDesc->Data.Pointer);
220 NextDesc = ObjDesc->Common.NextObject;
221 AcpiUtRemoveReference (ObjDesc);
225 /* Special case for the statically allocated root node */
227 if (Node == AcpiGbl_RootNode)
232 /* Now we can delete the node */
234 (void) AcpiOsReleaseObject (AcpiGbl_NamespaceCache, Node);
236 ACPI_MEM_TRACKING (AcpiGbl_NsNodeList->TotalFreed++);
237 ACPI_DEBUG_PRINT ((ACPI_DB_ALLOCATIONS, "Node %p, Remaining %X\n",
238 Node, AcpiGbl_CurrentNodeCount));
242 /*******************************************************************************
244 * FUNCTION: AcpiNsRemoveNode
246 * PARAMETERS: Node - Node to be removed/deleted
250 * DESCRIPTION: Remove (unlink) and delete a namespace node
252 ******************************************************************************/
256 ACPI_NAMESPACE_NODE *Node)
258 ACPI_NAMESPACE_NODE *ParentNode;
259 ACPI_NAMESPACE_NODE *PrevNode;
260 ACPI_NAMESPACE_NODE *NextNode;
263 ACPI_FUNCTION_TRACE_PTR (NsRemoveNode, Node);
266 ParentNode = Node->Parent;
269 NextNode = ParentNode->Child;
271 /* Find the node that is the previous peer in the parent's child list */
273 while (NextNode != Node)
276 NextNode = NextNode->Peer;
281 /* Node is not first child, unlink it */
283 PrevNode->Peer = Node->Peer;
288 * Node is first child (has no previous peer).
289 * Link peer list to parent
291 ParentNode->Child = Node->Peer;
294 /* Delete the node and any attached objects */
296 AcpiNsDeleteNode (Node);
301 /*******************************************************************************
303 * FUNCTION: AcpiNsInstallNode
305 * PARAMETERS: WalkState - Current state of the walk
306 * ParentNode - The parent of the new Node
307 * Node - The new Node to install
308 * Type - ACPI object type of the new Node
312 * DESCRIPTION: Initialize a new namespace node and install it amongst
315 * Note: Current namespace lookup is linear search. This appears
316 * to be sufficient as namespace searches consume only a small
317 * fraction of the execution time of the ACPI subsystem.
319 ******************************************************************************/
323 ACPI_WALK_STATE *WalkState,
324 ACPI_NAMESPACE_NODE *ParentNode, /* Parent */
325 ACPI_NAMESPACE_NODE *Node, /* New Child*/
326 ACPI_OBJECT_TYPE Type)
328 ACPI_OWNER_ID OwnerId = 0;
329 ACPI_NAMESPACE_NODE *ChildNode;
332 ACPI_FUNCTION_TRACE (NsInstallNode);
338 * Get the owner ID from the Walk state. The owner ID is used to
339 * track table deletion and deletion of objects created by methods.
341 OwnerId = WalkState->OwnerId;
343 if ((WalkState->MethodDesc) &&
344 (ParentNode != WalkState->MethodNode))
347 * A method is creating a new node that is not a child of the
348 * method (it is non-local). Mark the executing method as having
349 * modified the namespace. This is used for cleanup when the
352 WalkState->MethodDesc->Method.InfoFlags |= ACPI_METHOD_MODIFIED_NAMESPACE;
356 /* Link the new entry into the parent and existing children */
359 Node->Parent = ParentNode;
360 ChildNode = ParentNode->Child;
364 ParentNode->Child = Node;
368 /* Add node to the end of the peer list */
370 while (ChildNode->Peer)
372 ChildNode = ChildNode->Peer;
375 ChildNode->Peer = Node;
378 /* Init the new entry */
380 Node->OwnerId = OwnerId;
381 Node->Type = (UINT8) Type;
383 ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
384 "%4.4s (%s) [Node %p Owner %X] added to %4.4s (%s) [Node %p]\n",
385 AcpiUtGetNodeName (Node), AcpiUtGetTypeName (Node->Type), Node, OwnerId,
386 AcpiUtGetNodeName (ParentNode), AcpiUtGetTypeName (ParentNode->Type),
393 /*******************************************************************************
395 * FUNCTION: AcpiNsDeleteChildren
397 * PARAMETERS: ParentNode - Delete this objects children
401 * DESCRIPTION: Delete all children of the parent object. In other words,
404 ******************************************************************************/
407 AcpiNsDeleteChildren (
408 ACPI_NAMESPACE_NODE *ParentNode)
410 ACPI_NAMESPACE_NODE *NextNode;
411 ACPI_NAMESPACE_NODE *NodeToDelete;
414 ACPI_FUNCTION_TRACE_PTR (NsDeleteChildren, ParentNode);
422 /* Deallocate all children at this level */
424 NextNode = ParentNode->Child;
427 /* Grandchildren should have all been deleted already */
431 ACPI_ERROR ((AE_INFO, "Found a grandchild! P=%p C=%p",
432 ParentNode, NextNode));
436 * Delete this child node and move on to the next child in the list.
437 * No need to unlink the node since we are deleting the entire branch.
439 NodeToDelete = NextNode;
440 NextNode = NextNode->Peer;
441 AcpiNsDeleteNode (NodeToDelete);
444 /* Clear the parent's child pointer */
446 ParentNode->Child = NULL;
451 /*******************************************************************************
453 * FUNCTION: AcpiNsDeleteNamespaceSubtree
455 * PARAMETERS: ParentNode - Root of the subtree to be deleted
459 * DESCRIPTION: Delete a subtree of the namespace. This includes all objects
460 * stored within the subtree.
462 ******************************************************************************/
465 AcpiNsDeleteNamespaceSubtree (
466 ACPI_NAMESPACE_NODE *ParentNode)
468 ACPI_NAMESPACE_NODE *ChildNode = NULL;
473 ACPI_FUNCTION_TRACE (NsDeleteNamespaceSubtree);
481 /* Lock namespace for possible update */
483 Status = AcpiUtAcquireMutex (ACPI_MTX_NAMESPACE);
484 if (ACPI_FAILURE (Status))
490 * Traverse the tree of objects until we bubble back up
491 * to where we started.
495 /* Get the next node in this scope (NULL if none) */
497 ChildNode = AcpiNsGetNextNode (ParentNode, ChildNode);
500 /* Found a child node - detach any attached object */
502 AcpiNsDetachObject (ChildNode);
504 /* Check if this node has any children */
506 if (ChildNode->Child)
509 * There is at least one child of this node,
513 ParentNode = ChildNode;
520 * No more children of this parent node.
521 * Move up to the grandparent.
526 * Now delete all of the children of this parent
527 * all at the same time.
529 AcpiNsDeleteChildren (ParentNode);
531 /* New "last child" is this parent node */
533 ChildNode = ParentNode;
535 /* Move up the tree to the grandparent */
537 ParentNode = ParentNode->Parent;
541 (void) AcpiUtReleaseMutex (ACPI_MTX_NAMESPACE);
546 /*******************************************************************************
548 * FUNCTION: AcpiNsDeleteNamespaceByOwner
550 * PARAMETERS: OwnerId - All nodes with this owner will be deleted
554 * DESCRIPTION: Delete entries within the namespace that are owned by a
555 * specific ID. Used to delete entire ACPI tables. All
556 * reference counts are updated.
558 * MUTEX: Locks namespace during deletion walk.
560 ******************************************************************************/
563 AcpiNsDeleteNamespaceByOwner (
564 ACPI_OWNER_ID OwnerId)
566 ACPI_NAMESPACE_NODE *ChildNode;
567 ACPI_NAMESPACE_NODE *DeletionNode;
568 ACPI_NAMESPACE_NODE *ParentNode;
573 ACPI_FUNCTION_TRACE_U32 (NsDeleteNamespaceByOwner, OwnerId);
581 /* Lock namespace for possible update */
583 Status = AcpiUtAcquireMutex (ACPI_MTX_NAMESPACE);
584 if (ACPI_FAILURE (Status))
590 ParentNode = AcpiGbl_RootNode;
595 * Traverse the tree of nodes until we bubble back up
596 * to where we started.
601 * Get the next child of this parent node. When ChildNode is NULL,
602 * the first child of the parent is returned
604 ChildNode = AcpiNsGetNextNode (ParentNode, ChildNode);
608 AcpiNsDeleteChildren (DeletionNode);
609 AcpiNsRemoveNode (DeletionNode);
615 if (ChildNode->OwnerId == OwnerId)
617 /* Found a matching child node - detach any attached object */
619 AcpiNsDetachObject (ChildNode);
622 /* Check if this node has any children */
624 if (ChildNode->Child)
627 * There is at least one child of this node,
631 ParentNode = ChildNode;
634 else if (ChildNode->OwnerId == OwnerId)
636 DeletionNode = ChildNode;
642 * No more children of this parent node.
643 * Move up to the grandparent.
648 if (ParentNode->OwnerId == OwnerId)
650 DeletionNode = ParentNode;
654 /* New "last child" is this parent node */
656 ChildNode = ParentNode;
658 /* Move up the tree to the grandparent */
660 ParentNode = ParentNode->Parent;
664 (void) AcpiUtReleaseMutex (ACPI_MTX_NAMESPACE);