nssearch.c revision 123315
167754Smsmith/******************************************************************************* 267754Smsmith * 367754Smsmith * Module Name: nssearch - Namespace search 4123315Snjl * $Revision: 99 $ 567754Smsmith * 667754Smsmith ******************************************************************************/ 767754Smsmith 867754Smsmith/****************************************************************************** 967754Smsmith * 1067754Smsmith * 1. Copyright Notice 1167754Smsmith * 12114237Snjl * Some or all of this work - Copyright (c) 1999 - 2003, Intel Corp. 1370243Smsmith * All rights reserved. 1467754Smsmith * 1567754Smsmith * 2. License 1667754Smsmith * 1767754Smsmith * 2.1. This is your license from Intel Corp. under its intellectual property 1867754Smsmith * rights. You may have additional license terms from the party that provided 1967754Smsmith * you this software, covering your right to use that party's intellectual 2067754Smsmith * property rights. 2167754Smsmith * 2267754Smsmith * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a 2367754Smsmith * copy of the source code appearing in this file ("Covered Code") an 2467754Smsmith * irrevocable, perpetual, worldwide license under Intel's copyrights in the 2567754Smsmith * base code distributed originally by Intel ("Original Intel Code") to copy, 2667754Smsmith * make derivatives, distribute, use and display any portion of the Covered 2767754Smsmith * Code in any form, with the right to sublicense such rights; and 2867754Smsmith * 2967754Smsmith * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent 3067754Smsmith * license (with the right to sublicense), under only those claims of Intel 3167754Smsmith * patents that are infringed by the Original Intel Code, to make, use, sell, 3267754Smsmith * offer to sell, and import the Covered Code and derivative works thereof 3367754Smsmith * solely to the minimum extent necessary to exercise the above copyright 3467754Smsmith * license, and in no event shall the patent license extend to any additions 3567754Smsmith * to or modifications of the Original Intel Code. No other license or right 3667754Smsmith * is granted directly or by implication, estoppel or otherwise; 3767754Smsmith * 3867754Smsmith * The above copyright and patent license is granted only if the following 3967754Smsmith * conditions are met: 4067754Smsmith * 4167754Smsmith * 3. Conditions 4267754Smsmith * 4367754Smsmith * 3.1. Redistribution of Source with Rights to Further Distribute Source. 4467754Smsmith * Redistribution of source code of any substantial portion of the Covered 4567754Smsmith * Code or modification with rights to further distribute source must include 4667754Smsmith * the above Copyright Notice, the above License, this list of Conditions, 4767754Smsmith * and the following Disclaimer and Export Compliance provision. In addition, 4867754Smsmith * Licensee must cause all Covered Code to which Licensee contributes to 4967754Smsmith * contain a file documenting the changes Licensee made to create that Covered 5067754Smsmith * Code and the date of any change. Licensee must include in that file the 5167754Smsmith * documentation of any changes made by any predecessor Licensee. Licensee 5267754Smsmith * must include a prominent statement that the modification is derived, 5367754Smsmith * directly or indirectly, from Original Intel Code. 5467754Smsmith * 5567754Smsmith * 3.2. Redistribution of Source with no Rights to Further Distribute Source. 5667754Smsmith * Redistribution of source code of any substantial portion of the Covered 5767754Smsmith * Code or modification without rights to further distribute source must 5867754Smsmith * include the following Disclaimer and Export Compliance provision in the 5967754Smsmith * documentation and/or other materials provided with distribution. In 6067754Smsmith * addition, Licensee may not authorize further sublicense of source of any 6167754Smsmith * portion of the Covered Code, and must include terms to the effect that the 6267754Smsmith * license from Licensee to its licensee is limited to the intellectual 6367754Smsmith * property embodied in the software Licensee provides to its licensee, and 6467754Smsmith * not to intellectual property embodied in modifications its licensee may 6567754Smsmith * make. 6667754Smsmith * 6767754Smsmith * 3.3. Redistribution of Executable. Redistribution in executable form of any 6867754Smsmith * substantial portion of the Covered Code or modification must reproduce the 6967754Smsmith * above Copyright Notice, and the following Disclaimer and Export Compliance 7067754Smsmith * provision in the documentation and/or other materials provided with the 7167754Smsmith * distribution. 7267754Smsmith * 7367754Smsmith * 3.4. Intel retains all right, title, and interest in and to the Original 7467754Smsmith * Intel Code. 7567754Smsmith * 7667754Smsmith * 3.5. Neither the name Intel nor any other trademark owned or controlled by 7767754Smsmith * Intel shall be used in advertising or otherwise to promote the sale, use or 7867754Smsmith * other dealings in products derived from or relating to the Covered Code 7967754Smsmith * without prior written authorization from Intel. 8067754Smsmith * 8167754Smsmith * 4. Disclaimer and Export Compliance 8267754Smsmith * 8367754Smsmith * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED 8467754Smsmith * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE 8567754Smsmith * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE, 8667754Smsmith * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY 8767754Smsmith * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY 8867754Smsmith * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A 8967754Smsmith * PARTICULAR PURPOSE. 9067754Smsmith * 9167754Smsmith * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES 9267754Smsmith * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR 9367754Smsmith * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT, 9467754Smsmith * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY 9567754Smsmith * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL 9667754Smsmith * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS 9767754Smsmith * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY 9867754Smsmith * LIMITED REMEDY. 9967754Smsmith * 10067754Smsmith * 4.3. Licensee shall not export, either directly or indirectly, any of this 10167754Smsmith * software or system incorporating such software without first obtaining any 10267754Smsmith * required license or other approval from the U. S. Department of Commerce or 10367754Smsmith * any other agency or department of the United States Government. In the 10467754Smsmith * event Licensee exports any such software from the United States or 10567754Smsmith * re-exports any such software from a foreign destination, Licensee shall 10667754Smsmith * ensure that the distribution and export/re-export of the software is in 10767754Smsmith * compliance with all laws, regulations, orders, or other restrictions of the 10867754Smsmith * U.S. Export Administration Regulations. Licensee agrees that neither it nor 10967754Smsmith * any of its subsidiaries will export/re-export any technical data, process, 11067754Smsmith * software, or service, directly or indirectly, to any country for which the 11167754Smsmith * United States government or any agency thereof requires an export license, 11267754Smsmith * other governmental approval, or letter of assurance, without first obtaining 11367754Smsmith * such license, approval or letter. 11467754Smsmith * 11567754Smsmith *****************************************************************************/ 11667754Smsmith 11767754Smsmith#define __NSSEARCH_C__ 11867754Smsmith 11967754Smsmith#include "acpi.h" 12067754Smsmith#include "acnamesp.h" 12167754Smsmith 12267754Smsmith 12377424Smsmith#define _COMPONENT ACPI_NAMESPACE 12491116Smsmith ACPI_MODULE_NAME ("nssearch") 12567754Smsmith 12667754Smsmith 12767754Smsmith/******************************************************************************* 12867754Smsmith * 12967754Smsmith * FUNCTION: AcpiNsSearchNode 13067754Smsmith * 13167754Smsmith * PARAMETERS: *TargetName - Ascii ACPI name to search for 132107325Siwasaki * *Node - Starting node where search will begin 13367754Smsmith * Type - Object type to match 13477424Smsmith * **ReturnNode - Where the matched Named obj is returned 13567754Smsmith * 13667754Smsmith * RETURN: Status 13767754Smsmith * 138114237Snjl * DESCRIPTION: Search a single level of the namespace. Performs a 139114237Snjl * simple search of the specified level, and does not add 140107325Siwasaki * entries or search parents. 14167754Smsmith * 14267754Smsmith * 14367754Smsmith * Named object lists are built (and subsequently dumped) in the 14467754Smsmith * order in which the names are encountered during the namespace load; 14567754Smsmith * 14667754Smsmith * All namespace searching is linear in this implementation, but 14767754Smsmith * could be easily modified to support any improved search 14867754Smsmith * algorithm. However, the linear search was chosen for simplicity 14967754Smsmith * and because the trees are small and the other interpreter 15067754Smsmith * execution overhead is relatively high. 15167754Smsmith * 15267754Smsmith ******************************************************************************/ 15367754Smsmith 15467754SmsmithACPI_STATUS 15567754SmsmithAcpiNsSearchNode ( 15667754Smsmith UINT32 TargetName, 15767754Smsmith ACPI_NAMESPACE_NODE *Node, 15891116Smsmith ACPI_OBJECT_TYPE Type, 15967754Smsmith ACPI_NAMESPACE_NODE **ReturnNode) 16067754Smsmith{ 16167754Smsmith ACPI_NAMESPACE_NODE *NextNode; 16267754Smsmith 16367754Smsmith 16491116Smsmith ACPI_FUNCTION_TRACE ("NsSearchNode"); 16567754Smsmith 16671867Smsmith 167102550Siwasaki#ifdef ACPI_DEBUG_OUTPUT 16882367Smsmith if (ACPI_LV_NAMES & AcpiDbgLevel) 16967754Smsmith { 170114237Snjl char *ScopeName; 17177424Smsmith 17291116Smsmith ScopeName = AcpiNsGetExternalPathname (Node); 17371867Smsmith if (ScopeName) 17471867Smsmith { 175123315Snjl ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "Searching %s (%p) For [%4.4s] (%s)\n", 17691116Smsmith ScopeName, Node, (char *) &TargetName, AcpiUtGetTypeName (Type))); 17771867Smsmith 17880062Smsmith ACPI_MEM_FREE (ScopeName); 17971867Smsmith } 18067754Smsmith } 18171867Smsmith#endif 18267754Smsmith 18367754Smsmith /* 184114237Snjl * Search for name at this namespace level, which is to say that we 185107325Siwasaki * must search for the name among the children of this object 18667754Smsmith */ 18767754Smsmith NextNode = Node->Child; 18867754Smsmith while (NextNode) 18967754Smsmith { 19067754Smsmith /* Check for match against the name */ 19167754Smsmith 19299146Siwasaki if (NextNode->Name.Integer == TargetName) 19367754Smsmith { 19467754Smsmith /* 195107325Siwasaki * Found matching entry. 19667754Smsmith */ 19783174Smsmith ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, 198123315Snjl "Name [%4.4s] (%s) %p found in scope [%4.4s] %p\n", 199117521Snjl (char *) &TargetName, AcpiUtGetTypeName (NextNode->Type), 200123315Snjl NextNode, AcpiUtGetNodeName (Node), Node)); 20167754Smsmith 20267754Smsmith *ReturnNode = NextNode; 20367754Smsmith return_ACPI_STATUS (AE_OK); 20467754Smsmith } 20567754Smsmith 20667754Smsmith /* 20767754Smsmith * The last entry in the list points back to the parent, 20867754Smsmith * so a flag is used to indicate the end-of-list 20967754Smsmith */ 21067754Smsmith if (NextNode->Flags & ANOBJ_END_OF_PEER_LIST) 21167754Smsmith { 21267754Smsmith /* Searched entire list, we are done */ 21367754Smsmith 21467754Smsmith break; 21567754Smsmith } 21667754Smsmith 21767754Smsmith /* Didn't match name, move on to the next peer object */ 21867754Smsmith 21967754Smsmith NextNode = NextNode->Peer; 22067754Smsmith } 22167754Smsmith 222107325Siwasaki /* Searched entire namespace level, not found */ 22367754Smsmith 224117521Snjl ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, 225123315Snjl "Name [%4.4s] (%s) not found in search in scope [%4.4s] %p first child %p\n", 226117521Snjl (char *) &TargetName, AcpiUtGetTypeName (Type), 227123315Snjl AcpiUtGetNodeName (Node), Node, Node->Child)); 22867754Smsmith 22967754Smsmith return_ACPI_STATUS (AE_NOT_FOUND); 23067754Smsmith} 23167754Smsmith 23267754Smsmith 23367754Smsmith/******************************************************************************* 23467754Smsmith * 23567754Smsmith * FUNCTION: AcpiNsSearchParentTree 23667754Smsmith * 23767754Smsmith * PARAMETERS: *TargetName - Ascii ACPI name to search for 238107325Siwasaki * *Node - Starting node where search will begin 23967754Smsmith * Type - Object type to match 24077424Smsmith * **ReturnNode - Where the matched Named Obj is returned 24167754Smsmith * 24267754Smsmith * RETURN: Status 24367754Smsmith * 24467754Smsmith * DESCRIPTION: Called when a name has not been found in the current namespace 245107325Siwasaki * level. Before adding it or giving up, ACPI scope rules require 24667754Smsmith * searching enclosing scopes in cases identified by AcpiNsLocal(). 24767754Smsmith * 24867754Smsmith * "A name is located by finding the matching name in the current 24967754Smsmith * name space, and then in the parent name space. If the parent 25067754Smsmith * name space does not contain the name, the search continues 25167754Smsmith * recursively until either the name is found or the name space 25267754Smsmith * does not have a parent (the root of the name space). This 25367754Smsmith * indicates that the name is not found" (From ACPI Specification, 25467754Smsmith * section 5.3) 25567754Smsmith * 25667754Smsmith ******************************************************************************/ 25767754Smsmith 25869450Smsmithstatic ACPI_STATUS 25967754SmsmithAcpiNsSearchParentTree ( 26067754Smsmith UINT32 TargetName, 26167754Smsmith ACPI_NAMESPACE_NODE *Node, 26291116Smsmith ACPI_OBJECT_TYPE Type, 26367754Smsmith ACPI_NAMESPACE_NODE **ReturnNode) 26467754Smsmith{ 26567754Smsmith ACPI_STATUS Status; 26667754Smsmith ACPI_NAMESPACE_NODE *ParentNode; 26767754Smsmith 26867754Smsmith 26991116Smsmith ACPI_FUNCTION_TRACE ("NsSearchParentTree"); 27067754Smsmith 27167754Smsmith 27291116Smsmith ParentNode = AcpiNsGetParentNode (Node); 27367754Smsmith 27467754Smsmith /* 275114237Snjl * If there is no parent (i.e., we are at the root) or 276107325Siwasaki * type is "local", we won't be searching the parent tree. 27767754Smsmith */ 278107325Siwasaki if (!ParentNode) 27967754Smsmith { 280107325Siwasaki ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "[%4.4s] has no parent\n", 281107325Siwasaki (char *) &TargetName)); 282107325Siwasaki return_ACPI_STATUS (AE_NOT_FOUND); 283107325Siwasaki } 28467754Smsmith 285107325Siwasaki if (AcpiNsLocal (Type)) 286107325Siwasaki { 287107325Siwasaki ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, 288107325Siwasaki "[%4.4s] type [%s] must be local to this scope (no parent search)\n", 289107325Siwasaki (char *) &TargetName, AcpiUtGetTypeName (Type))); 29067754Smsmith return_ACPI_STATUS (AE_NOT_FOUND); 29167754Smsmith } 29267754Smsmith 29367754Smsmith /* Search the parent tree */ 29467754Smsmith 29587031Smsmith ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "Searching parent for %4.4s\n", (char *) &TargetName)); 29667754Smsmith 29767754Smsmith /* 29867754Smsmith * Search parents until found the target or we have backed up to 29967754Smsmith * the root 30067754Smsmith */ 30167754Smsmith while (ParentNode) 30267754Smsmith { 30391116Smsmith /* 30487031Smsmith * Search parent scope. Use TYPE_ANY because we don't care about the 30591116Smsmith * object type at this point, we only care about the existence of 30687031Smsmith * the actual name we are searching for. Typechecking comes later. 30787031Smsmith */ 30867754Smsmith Status = AcpiNsSearchNode (TargetName, ParentNode, 30967754Smsmith ACPI_TYPE_ANY, ReturnNode); 31067754Smsmith if (ACPI_SUCCESS (Status)) 31167754Smsmith { 31267754Smsmith return_ACPI_STATUS (Status); 31367754Smsmith } 31467754Smsmith 31567754Smsmith /* 31667754Smsmith * Not found here, go up another level 31767754Smsmith * (until we reach the root) 31867754Smsmith */ 31991116Smsmith ParentNode = AcpiNsGetParentNode (ParentNode); 32067754Smsmith } 32167754Smsmith 32267754Smsmith /* Not found in parent tree */ 32367754Smsmith 32467754Smsmith return_ACPI_STATUS (AE_NOT_FOUND); 32567754Smsmith} 32667754Smsmith 32767754Smsmith 32867754Smsmith/******************************************************************************* 32967754Smsmith * 33067754Smsmith * FUNCTION: AcpiNsSearchAndEnter 33167754Smsmith * 33267754Smsmith * PARAMETERS: TargetName - Ascii ACPI name to search for (4 chars) 33367754Smsmith * WalkState - Current state of the walk 334107325Siwasaki * *Node - Starting node where search will begin 335107325Siwasaki * InterpreterMode - Add names only in ACPI_MODE_LOAD_PASS_x. 33667754Smsmith * Otherwise,search only. 33767754Smsmith * Type - Object type to match 33867754Smsmith * Flags - Flags describing the search restrictions 33977424Smsmith * **ReturnNode - Where the Node is returned 34067754Smsmith * 34167754Smsmith * RETURN: Status 34267754Smsmith * 343107325Siwasaki * DESCRIPTION: Search for a name segment in a single namespace level, 34467754Smsmith * optionally adding it if it is not found. If the passed 34567754Smsmith * Type is not Any and the type previously stored in the 34667754Smsmith * entry was Any (i.e. unknown), update the stored type. 34767754Smsmith * 348107325Siwasaki * In ACPI_IMODE_EXECUTE, search only. 34967754Smsmith * In other modes, search and add if not found. 35067754Smsmith * 35167754Smsmith ******************************************************************************/ 35267754Smsmith 35367754SmsmithACPI_STATUS 35467754SmsmithAcpiNsSearchAndEnter ( 35567754Smsmith UINT32 TargetName, 35667754Smsmith ACPI_WALK_STATE *WalkState, 35767754Smsmith ACPI_NAMESPACE_NODE *Node, 35891116Smsmith ACPI_INTERPRETER_MODE InterpreterMode, 35991116Smsmith ACPI_OBJECT_TYPE Type, 36067754Smsmith UINT32 Flags, 36167754Smsmith ACPI_NAMESPACE_NODE **ReturnNode) 36267754Smsmith{ 36367754Smsmith ACPI_STATUS Status; 36467754Smsmith ACPI_NAMESPACE_NODE *NewNode; 36567754Smsmith 36667754Smsmith 36791116Smsmith ACPI_FUNCTION_TRACE ("NsSearchAndEnter"); 36867754Smsmith 36967754Smsmith 37067754Smsmith /* Parameter validation */ 37167754Smsmith 37267754Smsmith if (!Node || !TargetName || !ReturnNode) 37367754Smsmith { 374102550Siwasaki ACPI_DEBUG_PRINT ((ACPI_DB_ERROR, "Null param: Node %p Name %X ReturnNode %p\n", 37567754Smsmith Node, TargetName, ReturnNode)); 37667754Smsmith 377102550Siwasaki ACPI_REPORT_ERROR (("NsSearchAndEnter: Null parameter\n")); 37867754Smsmith return_ACPI_STATUS (AE_BAD_PARAMETER); 37967754Smsmith } 38067754Smsmith 38167754Smsmith /* Name must consist of printable characters */ 38267754Smsmith 38377424Smsmith if (!AcpiUtValidAcpiName (TargetName)) 38467754Smsmith { 385114237Snjl ACPI_REPORT_ERROR (("NsSearchAndEnter: Bad character in ACPI Name: %X\n", 38667754Smsmith TargetName)); 38767754Smsmith return_ACPI_STATUS (AE_BAD_CHARACTER); 38867754Smsmith } 38967754Smsmith 390107325Siwasaki /* Try to find the name in the namespace level specified by the caller */ 39167754Smsmith 39291116Smsmith *ReturnNode = ACPI_ENTRY_NOT_FOUND; 39377424Smsmith Status = AcpiNsSearchNode (TargetName, Node, Type, ReturnNode); 39467754Smsmith if (Status != AE_NOT_FOUND) 39567754Smsmith { 39667754Smsmith /* 39777424Smsmith * If we found it AND the request specifies that a find is an error, 39877424Smsmith * return the error 39971867Smsmith */ 40071867Smsmith if ((Status == AE_OK) && 40191116Smsmith (Flags & ACPI_NS_ERROR_IF_FOUND)) 40271867Smsmith { 40387031Smsmith Status = AE_ALREADY_EXISTS; 40471867Smsmith } 40571867Smsmith 40671867Smsmith /* 40767754Smsmith * Either found it or there was an error 40867754Smsmith * -- finished either way 40967754Smsmith */ 41067754Smsmith return_ACPI_STATUS (Status); 41167754Smsmith } 41267754Smsmith 41367754Smsmith /* 41487031Smsmith * The name was not found. If we are NOT performing the 41567754Smsmith * first pass (name entry) of loading the namespace, search 41667754Smsmith * the parent tree (all the way to the root if necessary.) 41767754Smsmith * We don't want to perform the parent search when the 41867754Smsmith * namespace is actually being loaded. We want to perform 41967754Smsmith * the search when namespace references are being resolved 42067754Smsmith * (load pass 2) and during the execution phase. 42167754Smsmith */ 42291116Smsmith if ((InterpreterMode != ACPI_IMODE_LOAD_PASS1) && 42391116Smsmith (Flags & ACPI_NS_SEARCH_PARENT)) 42467754Smsmith { 42567754Smsmith /* 426107325Siwasaki * Not found at this level - search parent tree according 42767754Smsmith * to ACPI specification 42867754Smsmith */ 42967754Smsmith Status = AcpiNsSearchParentTree (TargetName, Node, 43067754Smsmith Type, ReturnNode); 43167754Smsmith if (ACPI_SUCCESS (Status)) 43267754Smsmith { 43367754Smsmith return_ACPI_STATUS (Status); 43467754Smsmith } 43567754Smsmith } 43667754Smsmith 43767754Smsmith /* 43867754Smsmith * In execute mode, just search, never add names. Exit now. 43967754Smsmith */ 44091116Smsmith if (InterpreterMode == ACPI_IMODE_EXECUTE) 44167754Smsmith { 44282367Smsmith ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "%4.4s Not found in %p [Not adding]\n", 44387031Smsmith (char *) &TargetName, Node)); 44467754Smsmith 44567754Smsmith return_ACPI_STATUS (AE_NOT_FOUND); 44667754Smsmith } 44767754Smsmith 44867754Smsmith /* Create the new named object */ 44967754Smsmith 45067754Smsmith NewNode = AcpiNsCreateNode (TargetName); 45167754Smsmith if (!NewNode) 45267754Smsmith { 45367754Smsmith return_ACPI_STATUS (AE_NO_MEMORY); 45467754Smsmith } 45567754Smsmith 45667754Smsmith /* Install the new object into the parent's list of children */ 45767754Smsmith 45867754Smsmith AcpiNsInstallNode (WalkState, Node, NewNode, Type); 45967754Smsmith *ReturnNode = NewNode; 46067754Smsmith 46167754Smsmith return_ACPI_STATUS (AE_OK); 46267754Smsmith} 46367754Smsmith 464