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