1*3446Smrj /******************************************************************************* 2*3446Smrj * 3*3446Smrj * Module Name: nsnames - Name manipulation and search 4*3446Smrj * $Revision: 1.97 $ 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 #define __NSNAMES_C__ 118*3446Smrj 119*3446Smrj #include "acpi.h" 120*3446Smrj #include "amlcode.h" 121*3446Smrj #include "acnamesp.h" 122*3446Smrj 123*3446Smrj 124*3446Smrj #define _COMPONENT ACPI_NAMESPACE 125*3446Smrj ACPI_MODULE_NAME ("nsnames") 126*3446Smrj 127*3446Smrj 128*3446Smrj /******************************************************************************* 129*3446Smrj * 130*3446Smrj * FUNCTION: AcpiNsBuildExternalPath 131*3446Smrj * 132*3446Smrj * PARAMETERS: Node - NS node whose pathname is needed 133*3446Smrj * Size - Size of the pathname 134*3446Smrj * *NameBuffer - Where to return the pathname 135*3446Smrj * 136*3446Smrj * RETURN: Places the pathname into the NameBuffer, in external format 137*3446Smrj * (name segments separated by path separators) 138*3446Smrj * 139*3446Smrj * DESCRIPTION: Generate a full pathaname 140*3446Smrj * 141*3446Smrj ******************************************************************************/ 142*3446Smrj 143*3446Smrj void 144*3446Smrj AcpiNsBuildExternalPath ( 145*3446Smrj ACPI_NAMESPACE_NODE *Node, 146*3446Smrj ACPI_SIZE Size, 147*3446Smrj char *NameBuffer) 148*3446Smrj { 149*3446Smrj ACPI_SIZE Index; 150*3446Smrj ACPI_NAMESPACE_NODE *ParentNode; 151*3446Smrj 152*3446Smrj 153*3446Smrj ACPI_FUNCTION_ENTRY (); 154*3446Smrj 155*3446Smrj 156*3446Smrj /* Special case for root */ 157*3446Smrj 158*3446Smrj Index = Size - 1; 159*3446Smrj if (Index < ACPI_NAME_SIZE) 160*3446Smrj { 161*3446Smrj NameBuffer[0] = AML_ROOT_PREFIX; 162*3446Smrj NameBuffer[1] = 0; 163*3446Smrj return; 164*3446Smrj } 165*3446Smrj 166*3446Smrj /* Store terminator byte, then build name backwards */ 167*3446Smrj 168*3446Smrj ParentNode = Node; 169*3446Smrj NameBuffer[Index] = 0; 170*3446Smrj 171*3446Smrj while ((Index > ACPI_NAME_SIZE) && (ParentNode != AcpiGbl_RootNode)) 172*3446Smrj { 173*3446Smrj Index -= ACPI_NAME_SIZE; 174*3446Smrj 175*3446Smrj /* Put the name into the buffer */ 176*3446Smrj 177*3446Smrj ACPI_MOVE_32_TO_32 ((NameBuffer + Index), &ParentNode->Name); 178*3446Smrj ParentNode = AcpiNsGetParentNode (ParentNode); 179*3446Smrj 180*3446Smrj /* Prefix name with the path separator */ 181*3446Smrj 182*3446Smrj Index--; 183*3446Smrj NameBuffer[Index] = ACPI_PATH_SEPARATOR; 184*3446Smrj } 185*3446Smrj 186*3446Smrj /* Overwrite final separator with the root prefix character */ 187*3446Smrj 188*3446Smrj NameBuffer[Index] = AML_ROOT_PREFIX; 189*3446Smrj 190*3446Smrj if (Index != 0) 191*3446Smrj { 192*3446Smrj ACPI_ERROR ((AE_INFO, 193*3446Smrj "Could not construct pathname; index=%X, size=%X, Path=%s", 194*3446Smrj (UINT32) Index, (UINT32) Size, &NameBuffer[Size])); 195*3446Smrj } 196*3446Smrj 197*3446Smrj return; 198*3446Smrj } 199*3446Smrj 200*3446Smrj 201*3446Smrj #ifdef ACPI_DEBUG_OUTPUT 202*3446Smrj /******************************************************************************* 203*3446Smrj * 204*3446Smrj * FUNCTION: AcpiNsGetExternalPathname 205*3446Smrj * 206*3446Smrj * PARAMETERS: Node - Namespace node whose pathname is needed 207*3446Smrj * 208*3446Smrj * RETURN: Pointer to storage containing the fully qualified name of 209*3446Smrj * the node, In external format (name segments separated by path 210*3446Smrj * separators.) 211*3446Smrj * 212*3446Smrj * DESCRIPTION: Used for debug printing in AcpiNsSearchTable(). 213*3446Smrj * 214*3446Smrj ******************************************************************************/ 215*3446Smrj 216*3446Smrj char * 217*3446Smrj AcpiNsGetExternalPathname ( 218*3446Smrj ACPI_NAMESPACE_NODE *Node) 219*3446Smrj { 220*3446Smrj char *NameBuffer; 221*3446Smrj ACPI_SIZE Size; 222*3446Smrj 223*3446Smrj 224*3446Smrj ACPI_FUNCTION_TRACE_PTR (NsGetExternalPathname, Node); 225*3446Smrj 226*3446Smrj 227*3446Smrj /* Calculate required buffer size based on depth below root */ 228*3446Smrj 229*3446Smrj Size = AcpiNsGetPathnameLength (Node); 230*3446Smrj 231*3446Smrj /* Allocate a buffer to be returned to caller */ 232*3446Smrj 233*3446Smrj NameBuffer = ACPI_ALLOCATE_ZEROED (Size); 234*3446Smrj if (!NameBuffer) 235*3446Smrj { 236*3446Smrj ACPI_ERROR ((AE_INFO, "Allocation failure")); 237*3446Smrj return_PTR (NULL); 238*3446Smrj } 239*3446Smrj 240*3446Smrj /* Build the path in the allocated buffer */ 241*3446Smrj 242*3446Smrj AcpiNsBuildExternalPath (Node, Size, NameBuffer); 243*3446Smrj return_PTR (NameBuffer); 244*3446Smrj } 245*3446Smrj #endif 246*3446Smrj 247*3446Smrj 248*3446Smrj /******************************************************************************* 249*3446Smrj * 250*3446Smrj * FUNCTION: AcpiNsGetPathnameLength 251*3446Smrj * 252*3446Smrj * PARAMETERS: Node - Namespace node 253*3446Smrj * 254*3446Smrj * RETURN: Length of path, including prefix 255*3446Smrj * 256*3446Smrj * DESCRIPTION: Get the length of the pathname string for this node 257*3446Smrj * 258*3446Smrj ******************************************************************************/ 259*3446Smrj 260*3446Smrj ACPI_SIZE 261*3446Smrj AcpiNsGetPathnameLength ( 262*3446Smrj ACPI_NAMESPACE_NODE *Node) 263*3446Smrj { 264*3446Smrj ACPI_SIZE Size; 265*3446Smrj ACPI_NAMESPACE_NODE *NextNode; 266*3446Smrj 267*3446Smrj 268*3446Smrj ACPI_FUNCTION_ENTRY (); 269*3446Smrj 270*3446Smrj 271*3446Smrj /* 272*3446Smrj * Compute length of pathname as 5 * number of name segments. 273*3446Smrj * Go back up the parent tree to the root 274*3446Smrj */ 275*3446Smrj Size = 0; 276*3446Smrj NextNode = Node; 277*3446Smrj 278*3446Smrj while (NextNode && (NextNode != AcpiGbl_RootNode)) 279*3446Smrj { 280*3446Smrj Size += ACPI_PATH_SEGMENT_LENGTH; 281*3446Smrj NextNode = AcpiNsGetParentNode (NextNode); 282*3446Smrj } 283*3446Smrj 284*3446Smrj if (!Size) 285*3446Smrj { 286*3446Smrj Size = 1; /* Root node case */ 287*3446Smrj } 288*3446Smrj 289*3446Smrj return (Size + 1); /* +1 for null string terminator */ 290*3446Smrj } 291*3446Smrj 292*3446Smrj 293*3446Smrj /******************************************************************************* 294*3446Smrj * 295*3446Smrj * FUNCTION: AcpiNsHandleToPathname 296*3446Smrj * 297*3446Smrj * PARAMETERS: TargetHandle - Handle of named object whose name is 298*3446Smrj * to be found 299*3446Smrj * Buffer - Where the pathname is returned 300*3446Smrj * 301*3446Smrj * RETURN: Status, Buffer is filled with pathname if status is AE_OK 302*3446Smrj * 303*3446Smrj * DESCRIPTION: Build and return a full namespace pathname 304*3446Smrj * 305*3446Smrj ******************************************************************************/ 306*3446Smrj 307*3446Smrj ACPI_STATUS 308*3446Smrj AcpiNsHandleToPathname ( 309*3446Smrj ACPI_HANDLE TargetHandle, 310*3446Smrj ACPI_BUFFER *Buffer) 311*3446Smrj { 312*3446Smrj ACPI_STATUS Status; 313*3446Smrj ACPI_NAMESPACE_NODE *Node; 314*3446Smrj ACPI_SIZE RequiredSize; 315*3446Smrj 316*3446Smrj 317*3446Smrj ACPI_FUNCTION_TRACE_PTR (NsHandleToPathname, TargetHandle); 318*3446Smrj 319*3446Smrj 320*3446Smrj Node = AcpiNsMapHandleToNode (TargetHandle); 321*3446Smrj if (!Node) 322*3446Smrj { 323*3446Smrj return_ACPI_STATUS (AE_BAD_PARAMETER); 324*3446Smrj } 325*3446Smrj 326*3446Smrj /* Determine size required for the caller buffer */ 327*3446Smrj 328*3446Smrj RequiredSize = AcpiNsGetPathnameLength (Node); 329*3446Smrj 330*3446Smrj /* Validate/Allocate/Clear caller buffer */ 331*3446Smrj 332*3446Smrj Status = AcpiUtInitializeBuffer (Buffer, RequiredSize); 333*3446Smrj if (ACPI_FAILURE (Status)) 334*3446Smrj { 335*3446Smrj return_ACPI_STATUS (Status); 336*3446Smrj } 337*3446Smrj 338*3446Smrj /* Build the path in the caller buffer */ 339*3446Smrj 340*3446Smrj AcpiNsBuildExternalPath (Node, RequiredSize, Buffer->Pointer); 341*3446Smrj 342*3446Smrj ACPI_DEBUG_PRINT ((ACPI_DB_EXEC, "%s [%X]\n", 343*3446Smrj (char *) Buffer->Pointer, (UINT32) RequiredSize)); 344*3446Smrj return_ACPI_STATUS (AE_OK); 345*3446Smrj } 346*3446Smrj 347*3446Smrj 348