1a159c266SJung-uk Kim /******************************************************************************* 2a159c266SJung-uk Kim * 3a159c266SJung-uk Kim * Module Name: nsnames - Name manipulation and search 4a159c266SJung-uk Kim * 5a159c266SJung-uk Kim ******************************************************************************/ 6a159c266SJung-uk Kim 7*0d84335fSJung-uk Kim /****************************************************************************** 8*0d84335fSJung-uk Kim * 9*0d84335fSJung-uk Kim * 1. Copyright Notice 10*0d84335fSJung-uk Kim * 11*0d84335fSJung-uk Kim * Some or all of this work - Copyright (c) 1999 - 2017, Intel Corp. 12a159c266SJung-uk Kim * All rights reserved. 13a159c266SJung-uk Kim * 14*0d84335fSJung-uk Kim * 2. License 15*0d84335fSJung-uk Kim * 16*0d84335fSJung-uk Kim * 2.1. This is your license from Intel Corp. under its intellectual property 17*0d84335fSJung-uk Kim * rights. You may have additional license terms from the party that provided 18*0d84335fSJung-uk Kim * you this software, covering your right to use that party's intellectual 19*0d84335fSJung-uk Kim * property rights. 20*0d84335fSJung-uk Kim * 21*0d84335fSJung-uk Kim * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a 22*0d84335fSJung-uk Kim * copy of the source code appearing in this file ("Covered Code") an 23*0d84335fSJung-uk Kim * irrevocable, perpetual, worldwide license under Intel's copyrights in the 24*0d84335fSJung-uk Kim * base code distributed originally by Intel ("Original Intel Code") to copy, 25*0d84335fSJung-uk Kim * make derivatives, distribute, use and display any portion of the Covered 26*0d84335fSJung-uk Kim * Code in any form, with the right to sublicense such rights; and 27*0d84335fSJung-uk Kim * 28*0d84335fSJung-uk Kim * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent 29*0d84335fSJung-uk Kim * license (with the right to sublicense), under only those claims of Intel 30*0d84335fSJung-uk Kim * patents that are infringed by the Original Intel Code, to make, use, sell, 31*0d84335fSJung-uk Kim * offer to sell, and import the Covered Code and derivative works thereof 32*0d84335fSJung-uk Kim * solely to the minimum extent necessary to exercise the above copyright 33*0d84335fSJung-uk Kim * license, and in no event shall the patent license extend to any additions 34*0d84335fSJung-uk Kim * to or modifications of the Original Intel Code. No other license or right 35*0d84335fSJung-uk Kim * is granted directly or by implication, estoppel or otherwise; 36*0d84335fSJung-uk Kim * 37*0d84335fSJung-uk Kim * The above copyright and patent license is granted only if the following 38*0d84335fSJung-uk Kim * conditions are met: 39*0d84335fSJung-uk Kim * 40*0d84335fSJung-uk Kim * 3. Conditions 41*0d84335fSJung-uk Kim * 42*0d84335fSJung-uk Kim * 3.1. Redistribution of Source with Rights to Further Distribute Source. 43*0d84335fSJung-uk Kim * Redistribution of source code of any substantial portion of the Covered 44*0d84335fSJung-uk Kim * Code or modification with rights to further distribute source must include 45*0d84335fSJung-uk Kim * the above Copyright Notice, the above License, this list of Conditions, 46*0d84335fSJung-uk Kim * and the following Disclaimer and Export Compliance provision. In addition, 47*0d84335fSJung-uk Kim * Licensee must cause all Covered Code to which Licensee contributes to 48*0d84335fSJung-uk Kim * contain a file documenting the changes Licensee made to create that Covered 49*0d84335fSJung-uk Kim * Code and the date of any change. Licensee must include in that file the 50*0d84335fSJung-uk Kim * documentation of any changes made by any predecessor Licensee. Licensee 51*0d84335fSJung-uk Kim * must include a prominent statement that the modification is derived, 52*0d84335fSJung-uk Kim * directly or indirectly, from Original Intel Code. 53*0d84335fSJung-uk Kim * 54*0d84335fSJung-uk Kim * 3.2. Redistribution of Source with no Rights to Further Distribute Source. 55*0d84335fSJung-uk Kim * Redistribution of source code of any substantial portion of the Covered 56*0d84335fSJung-uk Kim * Code or modification without rights to further distribute source must 57*0d84335fSJung-uk Kim * include the following Disclaimer and Export Compliance provision in the 58*0d84335fSJung-uk Kim * documentation and/or other materials provided with distribution. In 59*0d84335fSJung-uk Kim * addition, Licensee may not authorize further sublicense of source of any 60*0d84335fSJung-uk Kim * portion of the Covered Code, and must include terms to the effect that the 61*0d84335fSJung-uk Kim * license from Licensee to its licensee is limited to the intellectual 62*0d84335fSJung-uk Kim * property embodied in the software Licensee provides to its licensee, and 63*0d84335fSJung-uk Kim * not to intellectual property embodied in modifications its licensee may 64*0d84335fSJung-uk Kim * make. 65*0d84335fSJung-uk Kim * 66*0d84335fSJung-uk Kim * 3.3. Redistribution of Executable. Redistribution in executable form of any 67*0d84335fSJung-uk Kim * substantial portion of the Covered Code or modification must reproduce the 68*0d84335fSJung-uk Kim * above Copyright Notice, and the following Disclaimer and Export Compliance 69*0d84335fSJung-uk Kim * provision in the documentation and/or other materials provided with the 70*0d84335fSJung-uk Kim * distribution. 71*0d84335fSJung-uk Kim * 72*0d84335fSJung-uk Kim * 3.4. Intel retains all right, title, and interest in and to the Original 73*0d84335fSJung-uk Kim * Intel Code. 74*0d84335fSJung-uk Kim * 75*0d84335fSJung-uk Kim * 3.5. Neither the name Intel nor any other trademark owned or controlled by 76*0d84335fSJung-uk Kim * Intel shall be used in advertising or otherwise to promote the sale, use or 77*0d84335fSJung-uk Kim * other dealings in products derived from or relating to the Covered Code 78*0d84335fSJung-uk Kim * without prior written authorization from Intel. 79*0d84335fSJung-uk Kim * 80*0d84335fSJung-uk Kim * 4. Disclaimer and Export Compliance 81*0d84335fSJung-uk Kim * 82*0d84335fSJung-uk Kim * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED 83*0d84335fSJung-uk Kim * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE 84*0d84335fSJung-uk Kim * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE, 85*0d84335fSJung-uk Kim * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY 86*0d84335fSJung-uk Kim * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY 87*0d84335fSJung-uk Kim * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A 88*0d84335fSJung-uk Kim * PARTICULAR PURPOSE. 89*0d84335fSJung-uk Kim * 90*0d84335fSJung-uk Kim * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES 91*0d84335fSJung-uk Kim * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR 92*0d84335fSJung-uk Kim * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT, 93*0d84335fSJung-uk Kim * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY 94*0d84335fSJung-uk Kim * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL 95*0d84335fSJung-uk Kim * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS 96*0d84335fSJung-uk Kim * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY 97*0d84335fSJung-uk Kim * LIMITED REMEDY. 98*0d84335fSJung-uk Kim * 99*0d84335fSJung-uk Kim * 4.3. Licensee shall not export, either directly or indirectly, any of this 100*0d84335fSJung-uk Kim * software or system incorporating such software without first obtaining any 101*0d84335fSJung-uk Kim * required license or other approval from the U. S. Department of Commerce or 102*0d84335fSJung-uk Kim * any other agency or department of the United States Government. In the 103*0d84335fSJung-uk Kim * event Licensee exports any such software from the United States or 104*0d84335fSJung-uk Kim * re-exports any such software from a foreign destination, Licensee shall 105*0d84335fSJung-uk Kim * ensure that the distribution and export/re-export of the software is in 106*0d84335fSJung-uk Kim * compliance with all laws, regulations, orders, or other restrictions of the 107*0d84335fSJung-uk Kim * U.S. Export Administration Regulations. Licensee agrees that neither it nor 108*0d84335fSJung-uk Kim * any of its subsidiaries will export/re-export any technical data, process, 109*0d84335fSJung-uk Kim * software, or service, directly or indirectly, to any country for which the 110*0d84335fSJung-uk Kim * United States government or any agency thereof requires an export license, 111*0d84335fSJung-uk Kim * other governmental approval, or letter of assurance, without first obtaining 112*0d84335fSJung-uk Kim * such license, approval or letter. 113*0d84335fSJung-uk Kim * 114*0d84335fSJung-uk Kim ***************************************************************************** 115*0d84335fSJung-uk Kim * 116*0d84335fSJung-uk Kim * Alternatively, you may choose to be licensed under the terms of the 117*0d84335fSJung-uk Kim * following license: 118*0d84335fSJung-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 * 134*0d84335fSJung-uk Kim * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 135*0d84335fSJung-uk Kim * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 136*0d84335fSJung-uk Kim * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 137*0d84335fSJung-uk Kim * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 138*0d84335fSJung-uk Kim * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 139*0d84335fSJung-uk Kim * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 140*0d84335fSJung-uk Kim * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 141*0d84335fSJung-uk Kim * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 142*0d84335fSJung-uk Kim * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 143*0d84335fSJung-uk Kim * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 144*0d84335fSJung-uk Kim * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 145*0d84335fSJung-uk Kim * 146*0d84335fSJung-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 * 150*0d84335fSJung-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/amlcode.h> 155a159c266SJung-uk Kim #include <contrib/dev/acpica/include/acnamesp.h> 156a159c266SJung-uk Kim 157a159c266SJung-uk Kim 158a159c266SJung-uk Kim #define _COMPONENT ACPI_NAMESPACE 159a159c266SJung-uk Kim ACPI_MODULE_NAME ("nsnames") 160a159c266SJung-uk Kim 161a159c266SJung-uk Kim 162a159c266SJung-uk Kim /******************************************************************************* 163a159c266SJung-uk Kim * 164a159c266SJung-uk Kim * FUNCTION: AcpiNsGetExternalPathname 165a159c266SJung-uk Kim * 166a159c266SJung-uk Kim * PARAMETERS: Node - Namespace node whose pathname is needed 167a159c266SJung-uk Kim * 168a159c266SJung-uk Kim * RETURN: Pointer to storage containing the fully qualified name of 169a159c266SJung-uk Kim * the node, In external format (name segments separated by path 170a159c266SJung-uk Kim * separators.) 171a159c266SJung-uk Kim * 172a159c266SJung-uk Kim * DESCRIPTION: Used to obtain the full pathname to a namespace node, usually 173a159c266SJung-uk Kim * for error and debug statements. 174a159c266SJung-uk Kim * 175a159c266SJung-uk Kim ******************************************************************************/ 176a159c266SJung-uk Kim 177a159c266SJung-uk Kim char * 178a159c266SJung-uk Kim AcpiNsGetExternalPathname ( 179a159c266SJung-uk Kim ACPI_NAMESPACE_NODE *Node) 180a159c266SJung-uk Kim { 181a159c266SJung-uk Kim char *NameBuffer; 182a159c266SJung-uk Kim 183a159c266SJung-uk Kim 184a159c266SJung-uk Kim ACPI_FUNCTION_TRACE_PTR (NsGetExternalPathname, Node); 185a159c266SJung-uk Kim 186a159c266SJung-uk Kim 187fe0f0bbbSJung-uk Kim NameBuffer = AcpiNsGetNormalizedPathname (Node, FALSE); 188a159c266SJung-uk Kim return_PTR (NameBuffer); 189a159c266SJung-uk Kim } 190a159c266SJung-uk Kim 191a159c266SJung-uk Kim 192a159c266SJung-uk Kim /******************************************************************************* 193a159c266SJung-uk Kim * 194a159c266SJung-uk Kim * FUNCTION: AcpiNsGetPathnameLength 195a159c266SJung-uk Kim * 196a159c266SJung-uk Kim * PARAMETERS: Node - Namespace node 197a159c266SJung-uk Kim * 198a159c266SJung-uk Kim * RETURN: Length of path, including prefix 199a159c266SJung-uk Kim * 200a159c266SJung-uk Kim * DESCRIPTION: Get the length of the pathname string for this node 201a159c266SJung-uk Kim * 202a159c266SJung-uk Kim ******************************************************************************/ 203a159c266SJung-uk Kim 204a159c266SJung-uk Kim ACPI_SIZE 205a159c266SJung-uk Kim AcpiNsGetPathnameLength ( 206a159c266SJung-uk Kim ACPI_NAMESPACE_NODE *Node) 207a159c266SJung-uk Kim { 208a159c266SJung-uk Kim ACPI_SIZE Size; 209a159c266SJung-uk Kim 210a159c266SJung-uk Kim 211a159c266SJung-uk Kim ACPI_FUNCTION_ENTRY (); 212a159c266SJung-uk Kim 213a159c266SJung-uk Kim 214fe0f0bbbSJung-uk Kim Size = AcpiNsBuildNormalizedPath (Node, NULL, 0, FALSE); 215fe0f0bbbSJung-uk Kim return (Size); 216a159c266SJung-uk Kim } 217a159c266SJung-uk Kim 218a159c266SJung-uk Kim 219a159c266SJung-uk Kim /******************************************************************************* 220a159c266SJung-uk Kim * 2211cc50d6bSJung-uk Kim * FUNCTION: AcpiNsHandleToName 2221cc50d6bSJung-uk Kim * 2231cc50d6bSJung-uk Kim * PARAMETERS: TargetHandle - Handle of named object whose name is 2241cc50d6bSJung-uk Kim * to be found 2251cc50d6bSJung-uk Kim * Buffer - Where the name is returned 2261cc50d6bSJung-uk Kim * 2271cc50d6bSJung-uk Kim * RETURN: Status, Buffer is filled with name if status is AE_OK 2281cc50d6bSJung-uk Kim * 2291cc50d6bSJung-uk Kim * DESCRIPTION: Build and return a full namespace name 2301cc50d6bSJung-uk Kim * 2311cc50d6bSJung-uk Kim ******************************************************************************/ 2321cc50d6bSJung-uk Kim 2331cc50d6bSJung-uk Kim ACPI_STATUS 2341cc50d6bSJung-uk Kim AcpiNsHandleToName ( 2351cc50d6bSJung-uk Kim ACPI_HANDLE TargetHandle, 2361cc50d6bSJung-uk Kim ACPI_BUFFER *Buffer) 2371cc50d6bSJung-uk Kim { 2381cc50d6bSJung-uk Kim ACPI_STATUS Status; 2391cc50d6bSJung-uk Kim ACPI_NAMESPACE_NODE *Node; 2401cc50d6bSJung-uk Kim const char *NodeName; 2411cc50d6bSJung-uk Kim 2421cc50d6bSJung-uk Kim 2431cc50d6bSJung-uk Kim ACPI_FUNCTION_TRACE_PTR (NsHandleToName, TargetHandle); 2441cc50d6bSJung-uk Kim 2451cc50d6bSJung-uk Kim 2461cc50d6bSJung-uk Kim Node = AcpiNsValidateHandle (TargetHandle); 2471cc50d6bSJung-uk Kim if (!Node) 2481cc50d6bSJung-uk Kim { 2491cc50d6bSJung-uk Kim return_ACPI_STATUS (AE_BAD_PARAMETER); 2501cc50d6bSJung-uk Kim } 2511cc50d6bSJung-uk Kim 2521cc50d6bSJung-uk Kim /* Validate/Allocate/Clear caller buffer */ 2531cc50d6bSJung-uk Kim 2541cc50d6bSJung-uk Kim Status = AcpiUtInitializeBuffer (Buffer, ACPI_PATH_SEGMENT_LENGTH); 2551cc50d6bSJung-uk Kim if (ACPI_FAILURE (Status)) 2561cc50d6bSJung-uk Kim { 2571cc50d6bSJung-uk Kim return_ACPI_STATUS (Status); 2581cc50d6bSJung-uk Kim } 2591cc50d6bSJung-uk Kim 2601cc50d6bSJung-uk Kim /* Just copy the ACPI name from the Node and zero terminate it */ 2611cc50d6bSJung-uk Kim 2621cc50d6bSJung-uk Kim NodeName = AcpiUtGetNodeName (Node); 2631cc50d6bSJung-uk Kim ACPI_MOVE_NAME (Buffer->Pointer, NodeName); 2641cc50d6bSJung-uk Kim ((char *) Buffer->Pointer) [ACPI_NAME_SIZE] = 0; 2651cc50d6bSJung-uk Kim 2661cc50d6bSJung-uk Kim ACPI_DEBUG_PRINT ((ACPI_DB_EXEC, "%4.4s\n", (char *) Buffer->Pointer)); 2671cc50d6bSJung-uk Kim return_ACPI_STATUS (AE_OK); 2681cc50d6bSJung-uk Kim } 2691cc50d6bSJung-uk Kim 2701cc50d6bSJung-uk Kim 2711cc50d6bSJung-uk Kim /******************************************************************************* 2721cc50d6bSJung-uk Kim * 273a159c266SJung-uk Kim * FUNCTION: AcpiNsHandleToPathname 274a159c266SJung-uk Kim * 275a159c266SJung-uk Kim * PARAMETERS: TargetHandle - Handle of named object whose name is 276a159c266SJung-uk Kim * to be found 277a159c266SJung-uk Kim * Buffer - Where the pathname is returned 278fe0f0bbbSJung-uk Kim * NoTrailing - Remove trailing '_' for each name 279fe0f0bbbSJung-uk Kim * segment 280a159c266SJung-uk Kim * 281a159c266SJung-uk Kim * RETURN: Status, Buffer is filled with pathname if status is AE_OK 282a159c266SJung-uk Kim * 283a159c266SJung-uk Kim * DESCRIPTION: Build and return a full namespace pathname 284a159c266SJung-uk Kim * 285a159c266SJung-uk Kim ******************************************************************************/ 286a159c266SJung-uk Kim 287a159c266SJung-uk Kim ACPI_STATUS 288a159c266SJung-uk Kim AcpiNsHandleToPathname ( 289a159c266SJung-uk Kim ACPI_HANDLE TargetHandle, 290fe0f0bbbSJung-uk Kim ACPI_BUFFER *Buffer, 291fe0f0bbbSJung-uk Kim BOOLEAN NoTrailing) 292a159c266SJung-uk Kim { 293a159c266SJung-uk Kim ACPI_STATUS Status; 294a159c266SJung-uk Kim ACPI_NAMESPACE_NODE *Node; 295a159c266SJung-uk Kim ACPI_SIZE RequiredSize; 296a159c266SJung-uk Kim 297a159c266SJung-uk Kim 298a159c266SJung-uk Kim ACPI_FUNCTION_TRACE_PTR (NsHandleToPathname, TargetHandle); 299a159c266SJung-uk Kim 300a159c266SJung-uk Kim 301a159c266SJung-uk Kim Node = AcpiNsValidateHandle (TargetHandle); 302a159c266SJung-uk Kim if (!Node) 303a159c266SJung-uk Kim { 304a159c266SJung-uk Kim return_ACPI_STATUS (AE_BAD_PARAMETER); 305a159c266SJung-uk Kim } 306a159c266SJung-uk Kim 307a159c266SJung-uk Kim /* Determine size required for the caller buffer */ 308a159c266SJung-uk Kim 309fe0f0bbbSJung-uk Kim RequiredSize = AcpiNsBuildNormalizedPath (Node, NULL, 0, NoTrailing); 310a159c266SJung-uk Kim if (!RequiredSize) 311a159c266SJung-uk Kim { 312a159c266SJung-uk Kim return_ACPI_STATUS (AE_BAD_PARAMETER); 313a159c266SJung-uk Kim } 314a159c266SJung-uk Kim 315a159c266SJung-uk Kim /* Validate/Allocate/Clear caller buffer */ 316a159c266SJung-uk Kim 317a159c266SJung-uk Kim Status = AcpiUtInitializeBuffer (Buffer, RequiredSize); 318a159c266SJung-uk Kim if (ACPI_FAILURE (Status)) 319a159c266SJung-uk Kim { 320a159c266SJung-uk Kim return_ACPI_STATUS (Status); 321a159c266SJung-uk Kim } 322a159c266SJung-uk Kim 323a159c266SJung-uk Kim /* Build the path in the caller buffer */ 324a159c266SJung-uk Kim 325fe0f0bbbSJung-uk Kim (void) AcpiNsBuildNormalizedPath (Node, Buffer->Pointer, 326fe0f0bbbSJung-uk Kim RequiredSize, NoTrailing); 327a159c266SJung-uk Kim if (ACPI_FAILURE (Status)) 328a159c266SJung-uk Kim { 329a159c266SJung-uk Kim return_ACPI_STATUS (Status); 330a159c266SJung-uk Kim } 331a159c266SJung-uk Kim 332a159c266SJung-uk Kim ACPI_DEBUG_PRINT ((ACPI_DB_EXEC, "%s [%X]\n", 333a159c266SJung-uk Kim (char *) Buffer->Pointer, (UINT32) RequiredSize)); 334a159c266SJung-uk Kim return_ACPI_STATUS (AE_OK); 335a159c266SJung-uk Kim } 336fe0f0bbbSJung-uk Kim 337fe0f0bbbSJung-uk Kim 338fe0f0bbbSJung-uk Kim /******************************************************************************* 339fe0f0bbbSJung-uk Kim * 340fe0f0bbbSJung-uk Kim * FUNCTION: AcpiNsBuildNormalizedPath 341fe0f0bbbSJung-uk Kim * 342fe0f0bbbSJung-uk Kim * PARAMETERS: Node - Namespace node 343fe0f0bbbSJung-uk Kim * FullPath - Where the path name is returned 344fe0f0bbbSJung-uk Kim * PathSize - Size of returned path name buffer 345fe0f0bbbSJung-uk Kim * NoTrailing - Remove trailing '_' from each name segment 346fe0f0bbbSJung-uk Kim * 347fe0f0bbbSJung-uk Kim * RETURN: Return 1 if the AML path is empty, otherwise returning (length 348fe0f0bbbSJung-uk Kim * of pathname + 1) which means the 'FullPath' contains a trailing 349fe0f0bbbSJung-uk Kim * null. 350fe0f0bbbSJung-uk Kim * 351fe0f0bbbSJung-uk Kim * DESCRIPTION: Build and return a full namespace pathname. 352fe0f0bbbSJung-uk Kim * Note that if the size of 'FullPath' isn't large enough to 353fe0f0bbbSJung-uk Kim * contain the namespace node's path name, the actual required 354fe0f0bbbSJung-uk Kim * buffer length is returned, and it should be greater than 355fe0f0bbbSJung-uk Kim * 'PathSize'. So callers are able to check the returning value 356fe0f0bbbSJung-uk Kim * to determine the buffer size of 'FullPath'. 357fe0f0bbbSJung-uk Kim * 358fe0f0bbbSJung-uk Kim ******************************************************************************/ 359fe0f0bbbSJung-uk Kim 360fe0f0bbbSJung-uk Kim UINT32 361fe0f0bbbSJung-uk Kim AcpiNsBuildNormalizedPath ( 362fe0f0bbbSJung-uk Kim ACPI_NAMESPACE_NODE *Node, 363fe0f0bbbSJung-uk Kim char *FullPath, 364fe0f0bbbSJung-uk Kim UINT32 PathSize, 365fe0f0bbbSJung-uk Kim BOOLEAN NoTrailing) 366fe0f0bbbSJung-uk Kim { 367fe0f0bbbSJung-uk Kim UINT32 Length = 0, i; 368fe0f0bbbSJung-uk Kim char Name[ACPI_NAME_SIZE]; 369fe0f0bbbSJung-uk Kim BOOLEAN DoNoTrailing; 370fe0f0bbbSJung-uk Kim char c, *Left, *Right; 371fe0f0bbbSJung-uk Kim ACPI_NAMESPACE_NODE *NextNode; 372fe0f0bbbSJung-uk Kim 373fe0f0bbbSJung-uk Kim 374fe0f0bbbSJung-uk Kim ACPI_FUNCTION_TRACE_PTR (NsBuildNormalizedPath, Node); 375fe0f0bbbSJung-uk Kim 376fe0f0bbbSJung-uk Kim 377fe0f0bbbSJung-uk Kim #define ACPI_PATH_PUT8(Path, Size, Byte, Length) \ 378fe0f0bbbSJung-uk Kim do { \ 379fe0f0bbbSJung-uk Kim if ((Length) < (Size)) \ 380fe0f0bbbSJung-uk Kim { \ 381fe0f0bbbSJung-uk Kim (Path)[(Length)] = (Byte); \ 382fe0f0bbbSJung-uk Kim } \ 383fe0f0bbbSJung-uk Kim (Length)++; \ 384fe0f0bbbSJung-uk Kim } while (0) 385fe0f0bbbSJung-uk Kim 386fe0f0bbbSJung-uk Kim /* 387fe0f0bbbSJung-uk Kim * Make sure the PathSize is correct, so that we don't need to 388fe0f0bbbSJung-uk Kim * validate both FullPath and PathSize. 389fe0f0bbbSJung-uk Kim */ 390fe0f0bbbSJung-uk Kim if (!FullPath) 391fe0f0bbbSJung-uk Kim { 392fe0f0bbbSJung-uk Kim PathSize = 0; 393fe0f0bbbSJung-uk Kim } 394fe0f0bbbSJung-uk Kim 395fe0f0bbbSJung-uk Kim if (!Node) 396fe0f0bbbSJung-uk Kim { 397fe0f0bbbSJung-uk Kim goto BuildTrailingNull; 398fe0f0bbbSJung-uk Kim } 399fe0f0bbbSJung-uk Kim 400fe0f0bbbSJung-uk Kim NextNode = Node; 401fe0f0bbbSJung-uk Kim while (NextNode && NextNode != AcpiGbl_RootNode) 402fe0f0bbbSJung-uk Kim { 403fe0f0bbbSJung-uk Kim if (NextNode != Node) 404fe0f0bbbSJung-uk Kim { 405fe0f0bbbSJung-uk Kim ACPI_PATH_PUT8(FullPath, PathSize, AML_DUAL_NAME_PREFIX, Length); 406fe0f0bbbSJung-uk Kim } 407f8146b88SJung-uk Kim 408fe0f0bbbSJung-uk Kim ACPI_MOVE_32_TO_32 (Name, &NextNode->Name); 409fe0f0bbbSJung-uk Kim DoNoTrailing = NoTrailing; 410fe0f0bbbSJung-uk Kim for (i = 0; i < 4; i++) 411fe0f0bbbSJung-uk Kim { 412fe0f0bbbSJung-uk Kim c = Name[4-i-1]; 413fe0f0bbbSJung-uk Kim if (DoNoTrailing && c != '_') 414fe0f0bbbSJung-uk Kim { 415fe0f0bbbSJung-uk Kim DoNoTrailing = FALSE; 416fe0f0bbbSJung-uk Kim } 417fe0f0bbbSJung-uk Kim if (!DoNoTrailing) 418fe0f0bbbSJung-uk Kim { 419fe0f0bbbSJung-uk Kim ACPI_PATH_PUT8(FullPath, PathSize, c, Length); 420fe0f0bbbSJung-uk Kim } 421fe0f0bbbSJung-uk Kim } 422f8146b88SJung-uk Kim 423fe0f0bbbSJung-uk Kim NextNode = NextNode->Parent; 424fe0f0bbbSJung-uk Kim } 425f8146b88SJung-uk Kim 426fe0f0bbbSJung-uk Kim ACPI_PATH_PUT8(FullPath, PathSize, AML_ROOT_PREFIX, Length); 427fe0f0bbbSJung-uk Kim 428fe0f0bbbSJung-uk Kim /* Reverse the path string */ 429fe0f0bbbSJung-uk Kim 430fe0f0bbbSJung-uk Kim if (Length <= PathSize) 431fe0f0bbbSJung-uk Kim { 432fe0f0bbbSJung-uk Kim Left = FullPath; 433fe0f0bbbSJung-uk Kim Right = FullPath+Length - 1; 434f8146b88SJung-uk Kim 435fe0f0bbbSJung-uk Kim while (Left < Right) 436fe0f0bbbSJung-uk Kim { 437fe0f0bbbSJung-uk Kim c = *Left; 438fe0f0bbbSJung-uk Kim *Left++ = *Right; 439fe0f0bbbSJung-uk Kim *Right-- = c; 440fe0f0bbbSJung-uk Kim } 441fe0f0bbbSJung-uk Kim } 442fe0f0bbbSJung-uk Kim 443fe0f0bbbSJung-uk Kim /* Append the trailing null */ 444fe0f0bbbSJung-uk Kim 445fe0f0bbbSJung-uk Kim BuildTrailingNull: 446fe0f0bbbSJung-uk Kim ACPI_PATH_PUT8 (FullPath, PathSize, '\0', Length); 447fe0f0bbbSJung-uk Kim 448fe0f0bbbSJung-uk Kim #undef ACPI_PATH_PUT8 449fe0f0bbbSJung-uk Kim 450fe0f0bbbSJung-uk Kim return_UINT32 (Length); 451fe0f0bbbSJung-uk Kim } 452fe0f0bbbSJung-uk Kim 453fe0f0bbbSJung-uk Kim 454fe0f0bbbSJung-uk Kim /******************************************************************************* 455fe0f0bbbSJung-uk Kim * 456fe0f0bbbSJung-uk Kim * FUNCTION: AcpiNsGetNormalizedPathname 457fe0f0bbbSJung-uk Kim * 458fe0f0bbbSJung-uk Kim * PARAMETERS: Node - Namespace node whose pathname is needed 459fe0f0bbbSJung-uk Kim * NoTrailing - Remove trailing '_' from each name segment 460fe0f0bbbSJung-uk Kim * 461fe0f0bbbSJung-uk Kim * RETURN: Pointer to storage containing the fully qualified name of 462fe0f0bbbSJung-uk Kim * the node, In external format (name segments separated by path 463fe0f0bbbSJung-uk Kim * separators.) 464fe0f0bbbSJung-uk Kim * 465fe0f0bbbSJung-uk Kim * DESCRIPTION: Used to obtain the full pathname to a namespace node, usually 466fe0f0bbbSJung-uk Kim * for error and debug statements. All trailing '_' will be 467fe0f0bbbSJung-uk Kim * removed from the full pathname if 'NoTrailing' is specified.. 468fe0f0bbbSJung-uk Kim * 469fe0f0bbbSJung-uk Kim ******************************************************************************/ 470fe0f0bbbSJung-uk Kim 471fe0f0bbbSJung-uk Kim char * 472fe0f0bbbSJung-uk Kim AcpiNsGetNormalizedPathname ( 473fe0f0bbbSJung-uk Kim ACPI_NAMESPACE_NODE *Node, 474fe0f0bbbSJung-uk Kim BOOLEAN NoTrailing) 475fe0f0bbbSJung-uk Kim { 476fe0f0bbbSJung-uk Kim char *NameBuffer; 477fe0f0bbbSJung-uk Kim ACPI_SIZE Size; 478fe0f0bbbSJung-uk Kim 479fe0f0bbbSJung-uk Kim 480fe0f0bbbSJung-uk Kim ACPI_FUNCTION_TRACE_PTR (NsGetNormalizedPathname, Node); 481fe0f0bbbSJung-uk Kim 482fe0f0bbbSJung-uk Kim 483fe0f0bbbSJung-uk Kim /* Calculate required buffer size based on depth below root */ 484fe0f0bbbSJung-uk Kim 485fe0f0bbbSJung-uk Kim Size = AcpiNsBuildNormalizedPath (Node, NULL, 0, NoTrailing); 486fe0f0bbbSJung-uk Kim if (!Size) 487fe0f0bbbSJung-uk Kim { 488fe0f0bbbSJung-uk Kim return_PTR (NULL); 489fe0f0bbbSJung-uk Kim } 490fe0f0bbbSJung-uk Kim 491fe0f0bbbSJung-uk Kim /* Allocate a buffer to be returned to caller */ 492fe0f0bbbSJung-uk Kim 493fe0f0bbbSJung-uk Kim NameBuffer = ACPI_ALLOCATE_ZEROED (Size); 494fe0f0bbbSJung-uk Kim if (!NameBuffer) 495fe0f0bbbSJung-uk Kim { 496f8146b88SJung-uk Kim ACPI_ERROR ((AE_INFO, 497f8146b88SJung-uk Kim "Could not allocate %u bytes", (UINT32) Size)); 498fe0f0bbbSJung-uk Kim return_PTR (NULL); 499fe0f0bbbSJung-uk Kim } 500fe0f0bbbSJung-uk Kim 501fe0f0bbbSJung-uk Kim /* Build the path in the allocated buffer */ 502fe0f0bbbSJung-uk Kim 503fe0f0bbbSJung-uk Kim (void) AcpiNsBuildNormalizedPath (Node, NameBuffer, Size, NoTrailing); 504fe0f0bbbSJung-uk Kim 505fe0f0bbbSJung-uk Kim return_PTR (NameBuffer); 506fe0f0bbbSJung-uk Kim } 507