1*3446Smrj /****************************************************************************** 2*3446Smrj * 3*3446Smrj * Module Name: nswalk - Functions for walking the ACPI namespace 4*3446Smrj * $Revision: 1.41 $ 5*3446Smrj * 6*3446Smrj *****************************************************************************/ 7*3446Smrj 8*3446Smrj /****************************************************************************** 9*3446Smrj * 10*3446Smrj * 1. Copyright Notice 11*3446Smrj * 12*3446Smrj * Some or all of this work - Copyright (c) 1999 - 2006, Intel Corp. 13*3446Smrj * All rights reserved. 14*3446Smrj * 15*3446Smrj * 2. License 16*3446Smrj * 17*3446Smrj * 2.1. This is your license from Intel Corp. under its intellectual property 18*3446Smrj * rights. You may have additional license terms from the party that provided 19*3446Smrj * you this software, covering your right to use that party's intellectual 20*3446Smrj * property rights. 21*3446Smrj * 22*3446Smrj * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a 23*3446Smrj * copy of the source code appearing in this file ("Covered Code") an 24*3446Smrj * irrevocable, perpetual, worldwide license under Intel's copyrights in the 25*3446Smrj * base code distributed originally by Intel ("Original Intel Code") to copy, 26*3446Smrj * make derivatives, distribute, use and display any portion of the Covered 27*3446Smrj * Code in any form, with the right to sublicense such rights; and 28*3446Smrj * 29*3446Smrj * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent 30*3446Smrj * license (with the right to sublicense), under only those claims of Intel 31*3446Smrj * patents that are infringed by the Original Intel Code, to make, use, sell, 32*3446Smrj * offer to sell, and import the Covered Code and derivative works thereof 33*3446Smrj * solely to the minimum extent necessary to exercise the above copyright 34*3446Smrj * license, and in no event shall the patent license extend to any additions 35*3446Smrj * to or modifications of the Original Intel Code. No other license or right 36*3446Smrj * is granted directly or by implication, estoppel or otherwise; 37*3446Smrj * 38*3446Smrj * The above copyright and patent license is granted only if the following 39*3446Smrj * conditions are met: 40*3446Smrj * 41*3446Smrj * 3. Conditions 42*3446Smrj * 43*3446Smrj * 3.1. Redistribution of Source with Rights to Further Distribute Source. 44*3446Smrj * Redistribution of source code of any substantial portion of the Covered 45*3446Smrj * Code or modification with rights to further distribute source must include 46*3446Smrj * the above Copyright Notice, the above License, this list of Conditions, 47*3446Smrj * and the following Disclaimer and Export Compliance provision. In addition, 48*3446Smrj * Licensee must cause all Covered Code to which Licensee contributes to 49*3446Smrj * contain a file documenting the changes Licensee made to create that Covered 50*3446Smrj * Code and the date of any change. Licensee must include in that file the 51*3446Smrj * documentation of any changes made by any predecessor Licensee. Licensee 52*3446Smrj * must include a prominent statement that the modification is derived, 53*3446Smrj * directly or indirectly, from Original Intel Code. 54*3446Smrj * 55*3446Smrj * 3.2. Redistribution of Source with no Rights to Further Distribute Source. 56*3446Smrj * Redistribution of source code of any substantial portion of the Covered 57*3446Smrj * Code or modification without rights to further distribute source must 58*3446Smrj * include the following Disclaimer and Export Compliance provision in the 59*3446Smrj * documentation and/or other materials provided with distribution. In 60*3446Smrj * addition, Licensee may not authorize further sublicense of source of any 61*3446Smrj * portion of the Covered Code, and must include terms to the effect that the 62*3446Smrj * license from Licensee to its licensee is limited to the intellectual 63*3446Smrj * property embodied in the software Licensee provides to its licensee, and 64*3446Smrj * not to intellectual property embodied in modifications its licensee may 65*3446Smrj * make. 66*3446Smrj * 67*3446Smrj * 3.3. Redistribution of Executable. Redistribution in executable form of any 68*3446Smrj * substantial portion of the Covered Code or modification must reproduce the 69*3446Smrj * above Copyright Notice, and the following Disclaimer and Export Compliance 70*3446Smrj * provision in the documentation and/or other materials provided with the 71*3446Smrj * distribution. 72*3446Smrj * 73*3446Smrj * 3.4. Intel retains all right, title, and interest in and to the Original 74*3446Smrj * Intel Code. 75*3446Smrj * 76*3446Smrj * 3.5. Neither the name Intel nor any other trademark owned or controlled by 77*3446Smrj * Intel shall be used in advertising or otherwise to promote the sale, use or 78*3446Smrj * other dealings in products derived from or relating to the Covered Code 79*3446Smrj * without prior written authorization from Intel. 80*3446Smrj * 81*3446Smrj * 4. Disclaimer and Export Compliance 82*3446Smrj * 83*3446Smrj * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED 84*3446Smrj * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE 85*3446Smrj * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE, 86*3446Smrj * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY 87*3446Smrj * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY 88*3446Smrj * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A 89*3446Smrj * PARTICULAR PURPOSE. 90*3446Smrj * 91*3446Smrj * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES 92*3446Smrj * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR 93*3446Smrj * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT, 94*3446Smrj * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY 95*3446Smrj * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL 96*3446Smrj * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS 97*3446Smrj * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY 98*3446Smrj * LIMITED REMEDY. 99*3446Smrj * 100*3446Smrj * 4.3. Licensee shall not export, either directly or indirectly, any of this 101*3446Smrj * software or system incorporating such software without first obtaining any 102*3446Smrj * required license or other approval from the U. S. Department of Commerce or 103*3446Smrj * any other agency or department of the United States Government. In the 104*3446Smrj * event Licensee exports any such software from the United States or 105*3446Smrj * re-exports any such software from a foreign destination, Licensee shall 106*3446Smrj * ensure that the distribution and export/re-export of the software is in 107*3446Smrj * compliance with all laws, regulations, orders, or other restrictions of the 108*3446Smrj * U.S. Export Administration Regulations. Licensee agrees that neither it nor 109*3446Smrj * any of its subsidiaries will export/re-export any technical data, process, 110*3446Smrj * software, or service, directly or indirectly, to any country for which the 111*3446Smrj * United States government or any agency thereof requires an export license, 112*3446Smrj * other governmental approval, or letter of assurance, without first obtaining 113*3446Smrj * such license, approval or letter. 114*3446Smrj * 115*3446Smrj *****************************************************************************/ 116*3446Smrj 117*3446Smrj 118*3446Smrj #define __NSWALK_C__ 119*3446Smrj 120*3446Smrj #include "acpi.h" 121*3446Smrj #include "acnamesp.h" 122*3446Smrj 123*3446Smrj 124*3446Smrj #define _COMPONENT ACPI_NAMESPACE 125*3446Smrj ACPI_MODULE_NAME ("nswalk") 126*3446Smrj 127*3446Smrj 128*3446Smrj /******************************************************************************* 129*3446Smrj * 130*3446Smrj * FUNCTION: AcpiNsGetNextNode 131*3446Smrj * 132*3446Smrj * PARAMETERS: Type - Type of node to be searched for 133*3446Smrj * ParentNode - Parent node whose children we are 134*3446Smrj * getting 135*3446Smrj * ChildNode - Previous child that was found. 136*3446Smrj * The NEXT child will be returned 137*3446Smrj * 138*3446Smrj * RETURN: ACPI_NAMESPACE_NODE - Pointer to the NEXT child or NULL if 139*3446Smrj * none is found. 140*3446Smrj * 141*3446Smrj * DESCRIPTION: Return the next peer node within the namespace. If Handle 142*3446Smrj * is valid, Scope is ignored. Otherwise, the first node 143*3446Smrj * within Scope is returned. 144*3446Smrj * 145*3446Smrj ******************************************************************************/ 146*3446Smrj 147*3446Smrj ACPI_NAMESPACE_NODE * 148*3446Smrj AcpiNsGetNextNode ( 149*3446Smrj ACPI_OBJECT_TYPE Type, 150*3446Smrj ACPI_NAMESPACE_NODE *ParentNode, 151*3446Smrj ACPI_NAMESPACE_NODE *ChildNode) 152*3446Smrj { 153*3446Smrj ACPI_NAMESPACE_NODE *NextNode = NULL; 154*3446Smrj 155*3446Smrj 156*3446Smrj ACPI_FUNCTION_ENTRY (); 157*3446Smrj 158*3446Smrj 159*3446Smrj if (!ChildNode) 160*3446Smrj { 161*3446Smrj /* It's really the parent's _scope_ that we want */ 162*3446Smrj 163*3446Smrj if (ParentNode->Child) 164*3446Smrj { 165*3446Smrj NextNode = ParentNode->Child; 166*3446Smrj } 167*3446Smrj } 168*3446Smrj 169*3446Smrj else 170*3446Smrj { 171*3446Smrj /* Start search at the NEXT node */ 172*3446Smrj 173*3446Smrj NextNode = AcpiNsGetNextValidNode (ChildNode); 174*3446Smrj } 175*3446Smrj 176*3446Smrj /* If any type is OK, we are done */ 177*3446Smrj 178*3446Smrj if (Type == ACPI_TYPE_ANY) 179*3446Smrj { 180*3446Smrj /* NextNode is NULL if we are at the end-of-list */ 181*3446Smrj 182*3446Smrj return (NextNode); 183*3446Smrj } 184*3446Smrj 185*3446Smrj /* Must search for the node -- but within this scope only */ 186*3446Smrj 187*3446Smrj while (NextNode) 188*3446Smrj { 189*3446Smrj /* If type matches, we are done */ 190*3446Smrj 191*3446Smrj if (NextNode->Type == Type) 192*3446Smrj { 193*3446Smrj return (NextNode); 194*3446Smrj } 195*3446Smrj 196*3446Smrj /* Otherwise, move on to the next node */ 197*3446Smrj 198*3446Smrj NextNode = AcpiNsGetNextValidNode (NextNode); 199*3446Smrj } 200*3446Smrj 201*3446Smrj /* Not found */ 202*3446Smrj 203*3446Smrj return (NULL); 204*3446Smrj } 205*3446Smrj 206*3446Smrj 207*3446Smrj /******************************************************************************* 208*3446Smrj * 209*3446Smrj * FUNCTION: AcpiNsWalkNamespace 210*3446Smrj * 211*3446Smrj * PARAMETERS: Type - ACPI_OBJECT_TYPE to search for 212*3446Smrj * StartNode - Handle in namespace where search begins 213*3446Smrj * MaxDepth - Depth to which search is to reach 214*3446Smrj * UnlockBeforeCallback- Whether to unlock the NS before invoking 215*3446Smrj * the callback routine 216*3446Smrj * UserFunction - Called when an object of "Type" is found 217*3446Smrj * Context - Passed to user function 218*3446Smrj * ReturnValue - from the UserFunction if terminated early. 219*3446Smrj * Otherwise, returns NULL. 220*3446Smrj * RETURNS: Status 221*3446Smrj * 222*3446Smrj * DESCRIPTION: Performs a modified depth-first walk of the namespace tree, 223*3446Smrj * starting (and ending) at the node specified by StartHandle. 224*3446Smrj * The UserFunction is called whenever a node that matches 225*3446Smrj * the type parameter is found. If the user function returns 226*3446Smrj * a non-zero value, the search is terminated immediately and this 227*3446Smrj * value is returned to the caller. 228*3446Smrj * 229*3446Smrj * The point of this procedure is to provide a generic namespace 230*3446Smrj * walk routine that can be called from multiple places to 231*3446Smrj * provide multiple services; the User Function can be tailored 232*3446Smrj * to each task, whether it is a print function, a compare 233*3446Smrj * function, etc. 234*3446Smrj * 235*3446Smrj ******************************************************************************/ 236*3446Smrj 237*3446Smrj ACPI_STATUS 238*3446Smrj AcpiNsWalkNamespace ( 239*3446Smrj ACPI_OBJECT_TYPE Type, 240*3446Smrj ACPI_HANDLE StartNode, 241*3446Smrj UINT32 MaxDepth, 242*3446Smrj BOOLEAN UnlockBeforeCallback, 243*3446Smrj ACPI_WALK_CALLBACK UserFunction, 244*3446Smrj void *Context, 245*3446Smrj void **ReturnValue) 246*3446Smrj { 247*3446Smrj ACPI_STATUS Status; 248*3446Smrj ACPI_STATUS MutexStatus; 249*3446Smrj ACPI_NAMESPACE_NODE *ChildNode; 250*3446Smrj ACPI_NAMESPACE_NODE *ParentNode; 251*3446Smrj ACPI_OBJECT_TYPE ChildType; 252*3446Smrj UINT32 Level; 253*3446Smrj 254*3446Smrj 255*3446Smrj ACPI_FUNCTION_TRACE (NsWalkNamespace); 256*3446Smrj 257*3446Smrj 258*3446Smrj /* Special case for the namespace Root Node */ 259*3446Smrj 260*3446Smrj if (StartNode == ACPI_ROOT_OBJECT) 261*3446Smrj { 262*3446Smrj StartNode = AcpiGbl_RootNode; 263*3446Smrj } 264*3446Smrj 265*3446Smrj /* Null child means "get first node" */ 266*3446Smrj 267*3446Smrj ParentNode = StartNode; 268*3446Smrj ChildNode = NULL; 269*3446Smrj ChildType = ACPI_TYPE_ANY; 270*3446Smrj Level = 1; 271*3446Smrj 272*3446Smrj /* 273*3446Smrj * Traverse the tree of nodes until we bubble back up to where we 274*3446Smrj * started. When Level is zero, the loop is done because we have 275*3446Smrj * bubbled up to (and passed) the original parent handle (StartEntry) 276*3446Smrj */ 277*3446Smrj while (Level > 0) 278*3446Smrj { 279*3446Smrj /* Get the next node in this scope. Null if not found */ 280*3446Smrj 281*3446Smrj Status = AE_OK; 282*3446Smrj ChildNode = AcpiNsGetNextNode (ACPI_TYPE_ANY, ParentNode, ChildNode); 283*3446Smrj if (ChildNode) 284*3446Smrj { 285*3446Smrj /* 286*3446Smrj * Found node, Get the type if we are not 287*3446Smrj * searching for ANY 288*3446Smrj */ 289*3446Smrj if (Type != ACPI_TYPE_ANY) 290*3446Smrj { 291*3446Smrj ChildType = ChildNode->Type; 292*3446Smrj } 293*3446Smrj 294*3446Smrj if (ChildType == Type) 295*3446Smrj { 296*3446Smrj /* 297*3446Smrj * Found a matching node, invoke the user 298*3446Smrj * callback function 299*3446Smrj */ 300*3446Smrj if (UnlockBeforeCallback) 301*3446Smrj { 302*3446Smrj MutexStatus = AcpiUtReleaseMutex (ACPI_MTX_NAMESPACE); 303*3446Smrj if (ACPI_FAILURE (MutexStatus)) 304*3446Smrj { 305*3446Smrj return_ACPI_STATUS (MutexStatus); 306*3446Smrj } 307*3446Smrj } 308*3446Smrj 309*3446Smrj Status = UserFunction (ChildNode, Level, 310*3446Smrj Context, ReturnValue); 311*3446Smrj 312*3446Smrj if (UnlockBeforeCallback) 313*3446Smrj { 314*3446Smrj MutexStatus = AcpiUtAcquireMutex (ACPI_MTX_NAMESPACE); 315*3446Smrj if (ACPI_FAILURE (MutexStatus)) 316*3446Smrj { 317*3446Smrj return_ACPI_STATUS (MutexStatus); 318*3446Smrj } 319*3446Smrj } 320*3446Smrj 321*3446Smrj switch (Status) 322*3446Smrj { 323*3446Smrj case AE_OK: 324*3446Smrj case AE_CTRL_DEPTH: 325*3446Smrj 326*3446Smrj /* Just keep going */ 327*3446Smrj break; 328*3446Smrj 329*3446Smrj case AE_CTRL_TERMINATE: 330*3446Smrj 331*3446Smrj /* Exit now, with OK status */ 332*3446Smrj 333*3446Smrj return_ACPI_STATUS (AE_OK); 334*3446Smrj 335*3446Smrj default: 336*3446Smrj 337*3446Smrj /* All others are valid exceptions */ 338*3446Smrj 339*3446Smrj return_ACPI_STATUS (Status); 340*3446Smrj } 341*3446Smrj } 342*3446Smrj 343*3446Smrj /* 344*3446Smrj * Depth first search: 345*3446Smrj * Attempt to go down another level in the namespace 346*3446Smrj * if we are allowed to. Don't go any further if we 347*3446Smrj * have reached the caller specified maximum depth 348*3446Smrj * or if the user function has specified that the 349*3446Smrj * maximum depth has been reached. 350*3446Smrj */ 351*3446Smrj if ((Level < MaxDepth) && (Status != AE_CTRL_DEPTH)) 352*3446Smrj { 353*3446Smrj if (AcpiNsGetNextNode (ACPI_TYPE_ANY, ChildNode, NULL)) 354*3446Smrj { 355*3446Smrj /* 356*3446Smrj * There is at least one child of this 357*3446Smrj * node, visit the onde 358*3446Smrj */ 359*3446Smrj Level++; 360*3446Smrj ParentNode = ChildNode; 361*3446Smrj ChildNode = NULL; 362*3446Smrj } 363*3446Smrj } 364*3446Smrj } 365*3446Smrj else 366*3446Smrj { 367*3446Smrj /* 368*3446Smrj * No more children of this node (AcpiNsGetNextNode 369*3446Smrj * failed), go back upwards in the namespace tree to 370*3446Smrj * the node's parent. 371*3446Smrj */ 372*3446Smrj Level--; 373*3446Smrj ChildNode = ParentNode; 374*3446Smrj ParentNode = AcpiNsGetParentNode (ParentNode); 375*3446Smrj } 376*3446Smrj } 377*3446Smrj 378*3446Smrj /* Complete walk, not terminated by user function */ 379*3446Smrj 380*3446Smrj return_ACPI_STATUS (AE_OK); 381*3446Smrj } 382*3446Smrj 383*3446Smrj 384