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
70d84335fSJung-uk Kim /******************************************************************************
80d84335fSJung-uk Kim *
90d84335fSJung-uk Kim * 1. Copyright Notice
100d84335fSJung-uk Kim *
11*58308fadSJung-uk Kim * Some or all of this work - Copyright (c) 1999 - 2025, 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/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 *
AcpiNsGetExternalPathname(ACPI_NAMESPACE_NODE * Node)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
AcpiNsGetPathnameLength(ACPI_NAMESPACE_NODE * Node)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
2115f9b24faSJung-uk Kim /* Validate the Node */
212a159c266SJung-uk Kim
2135f9b24faSJung-uk Kim if (ACPI_GET_DESCRIPTOR_TYPE (Node) != ACPI_DESC_TYPE_NAMED)
2145f9b24faSJung-uk Kim {
2155f9b24faSJung-uk Kim ACPI_ERROR ((AE_INFO,
2165f9b24faSJung-uk Kim "Invalid/cached reference target node: %p, descriptor type %d",
2175f9b24faSJung-uk Kim Node, ACPI_GET_DESCRIPTOR_TYPE (Node)));
2185f9b24faSJung-uk Kim return (0);
2195f9b24faSJung-uk Kim }
220a159c266SJung-uk Kim
221fe0f0bbbSJung-uk Kim Size = AcpiNsBuildNormalizedPath (Node, NULL, 0, FALSE);
222fe0f0bbbSJung-uk Kim return (Size);
223a159c266SJung-uk Kim }
224a159c266SJung-uk Kim
225a159c266SJung-uk Kim
226a159c266SJung-uk Kim /*******************************************************************************
227a159c266SJung-uk Kim *
2281cc50d6bSJung-uk Kim * FUNCTION: AcpiNsHandleToName
2291cc50d6bSJung-uk Kim *
2301cc50d6bSJung-uk Kim * PARAMETERS: TargetHandle - Handle of named object whose name is
2311cc50d6bSJung-uk Kim * to be found
2321cc50d6bSJung-uk Kim * Buffer - Where the name is returned
2331cc50d6bSJung-uk Kim *
2341cc50d6bSJung-uk Kim * RETURN: Status, Buffer is filled with name if status is AE_OK
2351cc50d6bSJung-uk Kim *
2361cc50d6bSJung-uk Kim * DESCRIPTION: Build and return a full namespace name
2371cc50d6bSJung-uk Kim *
2381cc50d6bSJung-uk Kim ******************************************************************************/
2391cc50d6bSJung-uk Kim
2401cc50d6bSJung-uk Kim ACPI_STATUS
AcpiNsHandleToName(ACPI_HANDLE TargetHandle,ACPI_BUFFER * Buffer)2411cc50d6bSJung-uk Kim AcpiNsHandleToName (
2421cc50d6bSJung-uk Kim ACPI_HANDLE TargetHandle,
2431cc50d6bSJung-uk Kim ACPI_BUFFER *Buffer)
2441cc50d6bSJung-uk Kim {
2451cc50d6bSJung-uk Kim ACPI_STATUS Status;
2461cc50d6bSJung-uk Kim ACPI_NAMESPACE_NODE *Node;
2471cc50d6bSJung-uk Kim const char *NodeName;
2481cc50d6bSJung-uk Kim
2491cc50d6bSJung-uk Kim
2501cc50d6bSJung-uk Kim ACPI_FUNCTION_TRACE_PTR (NsHandleToName, TargetHandle);
2511cc50d6bSJung-uk Kim
2521cc50d6bSJung-uk Kim
2531cc50d6bSJung-uk Kim Node = AcpiNsValidateHandle (TargetHandle);
2541cc50d6bSJung-uk Kim if (!Node)
2551cc50d6bSJung-uk Kim {
2561cc50d6bSJung-uk Kim return_ACPI_STATUS (AE_BAD_PARAMETER);
2571cc50d6bSJung-uk Kim }
2581cc50d6bSJung-uk Kim
2591cc50d6bSJung-uk Kim /* Validate/Allocate/Clear caller buffer */
2601cc50d6bSJung-uk Kim
2611cc50d6bSJung-uk Kim Status = AcpiUtInitializeBuffer (Buffer, ACPI_PATH_SEGMENT_LENGTH);
2621cc50d6bSJung-uk Kim if (ACPI_FAILURE (Status))
2631cc50d6bSJung-uk Kim {
2641cc50d6bSJung-uk Kim return_ACPI_STATUS (Status);
2651cc50d6bSJung-uk Kim }
2661cc50d6bSJung-uk Kim
2671cc50d6bSJung-uk Kim /* Just copy the ACPI name from the Node and zero terminate it */
2681cc50d6bSJung-uk Kim
2691cc50d6bSJung-uk Kim NodeName = AcpiUtGetNodeName (Node);
270278f0de6SJung-uk Kim ACPI_COPY_NAMESEG (Buffer->Pointer, NodeName);
271278f0de6SJung-uk Kim ((char *) Buffer->Pointer) [ACPI_NAMESEG_SIZE] = 0;
2721cc50d6bSJung-uk Kim
2731cc50d6bSJung-uk Kim ACPI_DEBUG_PRINT ((ACPI_DB_EXEC, "%4.4s\n", (char *) Buffer->Pointer));
2741cc50d6bSJung-uk Kim return_ACPI_STATUS (AE_OK);
2751cc50d6bSJung-uk Kim }
2761cc50d6bSJung-uk Kim
2771cc50d6bSJung-uk Kim
2781cc50d6bSJung-uk Kim /*******************************************************************************
2791cc50d6bSJung-uk Kim *
280a159c266SJung-uk Kim * FUNCTION: AcpiNsHandleToPathname
281a159c266SJung-uk Kim *
282a159c266SJung-uk Kim * PARAMETERS: TargetHandle - Handle of named object whose name is
283a159c266SJung-uk Kim * to be found
284a159c266SJung-uk Kim * Buffer - Where the pathname is returned
285fe0f0bbbSJung-uk Kim * NoTrailing - Remove trailing '_' for each name
286fe0f0bbbSJung-uk Kim * segment
287a159c266SJung-uk Kim *
288a159c266SJung-uk Kim * RETURN: Status, Buffer is filled with pathname if status is AE_OK
289a159c266SJung-uk Kim *
290a159c266SJung-uk Kim * DESCRIPTION: Build and return a full namespace pathname
291a159c266SJung-uk Kim *
292a159c266SJung-uk Kim ******************************************************************************/
293a159c266SJung-uk Kim
294a159c266SJung-uk Kim ACPI_STATUS
AcpiNsHandleToPathname(ACPI_HANDLE TargetHandle,ACPI_BUFFER * Buffer,BOOLEAN NoTrailing)295a159c266SJung-uk Kim AcpiNsHandleToPathname (
296a159c266SJung-uk Kim ACPI_HANDLE TargetHandle,
297fe0f0bbbSJung-uk Kim ACPI_BUFFER *Buffer,
298fe0f0bbbSJung-uk Kim BOOLEAN NoTrailing)
299a159c266SJung-uk Kim {
300a159c266SJung-uk Kim ACPI_STATUS Status;
301a159c266SJung-uk Kim ACPI_NAMESPACE_NODE *Node;
302a159c266SJung-uk Kim ACPI_SIZE RequiredSize;
303a159c266SJung-uk Kim
304a159c266SJung-uk Kim
305a159c266SJung-uk Kim ACPI_FUNCTION_TRACE_PTR (NsHandleToPathname, TargetHandle);
306a159c266SJung-uk Kim
307a159c266SJung-uk Kim
308a159c266SJung-uk Kim Node = AcpiNsValidateHandle (TargetHandle);
309a159c266SJung-uk Kim if (!Node)
310a159c266SJung-uk Kim {
311a159c266SJung-uk Kim return_ACPI_STATUS (AE_BAD_PARAMETER);
312a159c266SJung-uk Kim }
313a159c266SJung-uk Kim
314a159c266SJung-uk Kim /* Determine size required for the caller buffer */
315a159c266SJung-uk Kim
316fe0f0bbbSJung-uk Kim RequiredSize = AcpiNsBuildNormalizedPath (Node, NULL, 0, NoTrailing);
317a159c266SJung-uk Kim if (!RequiredSize)
318a159c266SJung-uk Kim {
319a159c266SJung-uk Kim return_ACPI_STATUS (AE_BAD_PARAMETER);
320a159c266SJung-uk Kim }
321a159c266SJung-uk Kim
322a159c266SJung-uk Kim /* Validate/Allocate/Clear caller buffer */
323a159c266SJung-uk Kim
324a159c266SJung-uk Kim Status = AcpiUtInitializeBuffer (Buffer, RequiredSize);
325a159c266SJung-uk Kim if (ACPI_FAILURE (Status))
326a159c266SJung-uk Kim {
327a159c266SJung-uk Kim return_ACPI_STATUS (Status);
328a159c266SJung-uk Kim }
329a159c266SJung-uk Kim
330a159c266SJung-uk Kim /* Build the path in the caller buffer */
331a159c266SJung-uk Kim
332fe0f0bbbSJung-uk Kim (void) AcpiNsBuildNormalizedPath (Node, Buffer->Pointer,
333ec0234b4SJung-uk Kim (UINT32) RequiredSize, NoTrailing);
334a159c266SJung-uk Kim
335a159c266SJung-uk Kim ACPI_DEBUG_PRINT ((ACPI_DB_EXEC, "%s [%X]\n",
336a159c266SJung-uk Kim (char *) Buffer->Pointer, (UINT32) RequiredSize));
337a159c266SJung-uk Kim return_ACPI_STATUS (AE_OK);
338a159c266SJung-uk Kim }
339fe0f0bbbSJung-uk Kim
340fe0f0bbbSJung-uk Kim
341fe0f0bbbSJung-uk Kim /*******************************************************************************
342fe0f0bbbSJung-uk Kim *
343fe0f0bbbSJung-uk Kim * FUNCTION: AcpiNsBuildNormalizedPath
344fe0f0bbbSJung-uk Kim *
345fe0f0bbbSJung-uk Kim * PARAMETERS: Node - Namespace node
346fe0f0bbbSJung-uk Kim * FullPath - Where the path name is returned
347fe0f0bbbSJung-uk Kim * PathSize - Size of returned path name buffer
348fe0f0bbbSJung-uk Kim * NoTrailing - Remove trailing '_' from each name segment
349fe0f0bbbSJung-uk Kim *
350fe0f0bbbSJung-uk Kim * RETURN: Return 1 if the AML path is empty, otherwise returning (length
351fe0f0bbbSJung-uk Kim * of pathname + 1) which means the 'FullPath' contains a trailing
352fe0f0bbbSJung-uk Kim * null.
353fe0f0bbbSJung-uk Kim *
354fe0f0bbbSJung-uk Kim * DESCRIPTION: Build and return a full namespace pathname.
355fe0f0bbbSJung-uk Kim * Note that if the size of 'FullPath' isn't large enough to
356fe0f0bbbSJung-uk Kim * contain the namespace node's path name, the actual required
357fe0f0bbbSJung-uk Kim * buffer length is returned, and it should be greater than
358fe0f0bbbSJung-uk Kim * 'PathSize'. So callers are able to check the returning value
359fe0f0bbbSJung-uk Kim * to determine the buffer size of 'FullPath'.
360fe0f0bbbSJung-uk Kim *
361fe0f0bbbSJung-uk Kim ******************************************************************************/
362fe0f0bbbSJung-uk Kim
363fe0f0bbbSJung-uk Kim UINT32
AcpiNsBuildNormalizedPath(ACPI_NAMESPACE_NODE * Node,char * FullPath,UINT32 PathSize,BOOLEAN NoTrailing)364fe0f0bbbSJung-uk Kim AcpiNsBuildNormalizedPath (
365fe0f0bbbSJung-uk Kim ACPI_NAMESPACE_NODE *Node,
366fe0f0bbbSJung-uk Kim char *FullPath,
367fe0f0bbbSJung-uk Kim UINT32 PathSize,
368fe0f0bbbSJung-uk Kim BOOLEAN NoTrailing)
369fe0f0bbbSJung-uk Kim {
370fe0f0bbbSJung-uk Kim UINT32 Length = 0, i;
371*58308fadSJung-uk Kim char Name[ACPI_NAMESEG_SIZE] ACPI_NONSTRING;
372fe0f0bbbSJung-uk Kim BOOLEAN DoNoTrailing;
373fe0f0bbbSJung-uk Kim char c, *Left, *Right;
374fe0f0bbbSJung-uk Kim ACPI_NAMESPACE_NODE *NextNode;
375fe0f0bbbSJung-uk Kim
376fe0f0bbbSJung-uk Kim
377fe0f0bbbSJung-uk Kim ACPI_FUNCTION_TRACE_PTR (NsBuildNormalizedPath, Node);
378fe0f0bbbSJung-uk Kim
379fe0f0bbbSJung-uk Kim
380fe0f0bbbSJung-uk Kim #define ACPI_PATH_PUT8(Path, Size, Byte, Length) \
381fe0f0bbbSJung-uk Kim do { \
382fe0f0bbbSJung-uk Kim if ((Length) < (Size)) \
383fe0f0bbbSJung-uk Kim { \
384fe0f0bbbSJung-uk Kim (Path)[(Length)] = (Byte); \
385fe0f0bbbSJung-uk Kim } \
386fe0f0bbbSJung-uk Kim (Length)++; \
387fe0f0bbbSJung-uk Kim } while (0)
388fe0f0bbbSJung-uk Kim
389fe0f0bbbSJung-uk Kim /*
390fe0f0bbbSJung-uk Kim * Make sure the PathSize is correct, so that we don't need to
391fe0f0bbbSJung-uk Kim * validate both FullPath and PathSize.
392fe0f0bbbSJung-uk Kim */
393fe0f0bbbSJung-uk Kim if (!FullPath)
394fe0f0bbbSJung-uk Kim {
395fe0f0bbbSJung-uk Kim PathSize = 0;
396fe0f0bbbSJung-uk Kim }
397fe0f0bbbSJung-uk Kim
398fe0f0bbbSJung-uk Kim if (!Node)
399fe0f0bbbSJung-uk Kim {
400fe0f0bbbSJung-uk Kim goto BuildTrailingNull;
401fe0f0bbbSJung-uk Kim }
402fe0f0bbbSJung-uk Kim
403fe0f0bbbSJung-uk Kim NextNode = Node;
404fe0f0bbbSJung-uk Kim while (NextNode && NextNode != AcpiGbl_RootNode)
405fe0f0bbbSJung-uk Kim {
406fe0f0bbbSJung-uk Kim if (NextNode != Node)
407fe0f0bbbSJung-uk Kim {
408fe0f0bbbSJung-uk Kim ACPI_PATH_PUT8(FullPath, PathSize, AML_DUAL_NAME_PREFIX, Length);
409fe0f0bbbSJung-uk Kim }
410f8146b88SJung-uk Kim
411fe0f0bbbSJung-uk Kim ACPI_MOVE_32_TO_32 (Name, &NextNode->Name);
412fe0f0bbbSJung-uk Kim DoNoTrailing = NoTrailing;
413fe0f0bbbSJung-uk Kim for (i = 0; i < 4; i++)
414fe0f0bbbSJung-uk Kim {
415fe0f0bbbSJung-uk Kim c = Name[4-i-1];
416fe0f0bbbSJung-uk Kim if (DoNoTrailing && c != '_')
417fe0f0bbbSJung-uk Kim {
418fe0f0bbbSJung-uk Kim DoNoTrailing = FALSE;
419fe0f0bbbSJung-uk Kim }
420fe0f0bbbSJung-uk Kim if (!DoNoTrailing)
421fe0f0bbbSJung-uk Kim {
422fe0f0bbbSJung-uk Kim ACPI_PATH_PUT8(FullPath, PathSize, c, Length);
423fe0f0bbbSJung-uk Kim }
424fe0f0bbbSJung-uk Kim }
425f8146b88SJung-uk Kim
426fe0f0bbbSJung-uk Kim NextNode = NextNode->Parent;
427fe0f0bbbSJung-uk Kim }
428f8146b88SJung-uk Kim
429fe0f0bbbSJung-uk Kim ACPI_PATH_PUT8(FullPath, PathSize, AML_ROOT_PREFIX, Length);
430fe0f0bbbSJung-uk Kim
431fe0f0bbbSJung-uk Kim /* Reverse the path string */
432fe0f0bbbSJung-uk Kim
433fe0f0bbbSJung-uk Kim if (Length <= PathSize)
434fe0f0bbbSJung-uk Kim {
435fe0f0bbbSJung-uk Kim Left = FullPath;
436fe0f0bbbSJung-uk Kim Right = FullPath+Length - 1;
437f8146b88SJung-uk Kim
438fe0f0bbbSJung-uk Kim while (Left < Right)
439fe0f0bbbSJung-uk Kim {
440fe0f0bbbSJung-uk Kim c = *Left;
441fe0f0bbbSJung-uk Kim *Left++ = *Right;
442fe0f0bbbSJung-uk Kim *Right-- = c;
443fe0f0bbbSJung-uk Kim }
444fe0f0bbbSJung-uk Kim }
445fe0f0bbbSJung-uk Kim
446fe0f0bbbSJung-uk Kim /* Append the trailing null */
447fe0f0bbbSJung-uk Kim
448fe0f0bbbSJung-uk Kim BuildTrailingNull:
449fe0f0bbbSJung-uk Kim ACPI_PATH_PUT8 (FullPath, PathSize, '\0', Length);
450fe0f0bbbSJung-uk Kim
451fe0f0bbbSJung-uk Kim #undef ACPI_PATH_PUT8
452fe0f0bbbSJung-uk Kim
453fe0f0bbbSJung-uk Kim return_UINT32 (Length);
454fe0f0bbbSJung-uk Kim }
455fe0f0bbbSJung-uk Kim
456fe0f0bbbSJung-uk Kim
457fe0f0bbbSJung-uk Kim /*******************************************************************************
458fe0f0bbbSJung-uk Kim *
459fe0f0bbbSJung-uk Kim * FUNCTION: AcpiNsGetNormalizedPathname
460fe0f0bbbSJung-uk Kim *
461fe0f0bbbSJung-uk Kim * PARAMETERS: Node - Namespace node whose pathname is needed
462fe0f0bbbSJung-uk Kim * NoTrailing - Remove trailing '_' from each name segment
463fe0f0bbbSJung-uk Kim *
464fe0f0bbbSJung-uk Kim * RETURN: Pointer to storage containing the fully qualified name of
465fe0f0bbbSJung-uk Kim * the node, In external format (name segments separated by path
466fe0f0bbbSJung-uk Kim * separators.)
467fe0f0bbbSJung-uk Kim *
468fe0f0bbbSJung-uk Kim * DESCRIPTION: Used to obtain the full pathname to a namespace node, usually
469fe0f0bbbSJung-uk Kim * for error and debug statements. All trailing '_' will be
470fe0f0bbbSJung-uk Kim * removed from the full pathname if 'NoTrailing' is specified..
471fe0f0bbbSJung-uk Kim *
472fe0f0bbbSJung-uk Kim ******************************************************************************/
473fe0f0bbbSJung-uk Kim
474fe0f0bbbSJung-uk Kim char *
AcpiNsGetNormalizedPathname(ACPI_NAMESPACE_NODE * Node,BOOLEAN NoTrailing)475fe0f0bbbSJung-uk Kim AcpiNsGetNormalizedPathname (
476fe0f0bbbSJung-uk Kim ACPI_NAMESPACE_NODE *Node,
477fe0f0bbbSJung-uk Kim BOOLEAN NoTrailing)
478fe0f0bbbSJung-uk Kim {
479fe0f0bbbSJung-uk Kim char *NameBuffer;
480fe0f0bbbSJung-uk Kim ACPI_SIZE Size;
481fe0f0bbbSJung-uk Kim
482fe0f0bbbSJung-uk Kim
483fe0f0bbbSJung-uk Kim ACPI_FUNCTION_TRACE_PTR (NsGetNormalizedPathname, Node);
484fe0f0bbbSJung-uk Kim
485fe0f0bbbSJung-uk Kim
486fe0f0bbbSJung-uk Kim /* Calculate required buffer size based on depth below root */
487fe0f0bbbSJung-uk Kim
488fe0f0bbbSJung-uk Kim Size = AcpiNsBuildNormalizedPath (Node, NULL, 0, NoTrailing);
489fe0f0bbbSJung-uk Kim if (!Size)
490fe0f0bbbSJung-uk Kim {
491fe0f0bbbSJung-uk Kim return_PTR (NULL);
492fe0f0bbbSJung-uk Kim }
493fe0f0bbbSJung-uk Kim
494fe0f0bbbSJung-uk Kim /* Allocate a buffer to be returned to caller */
495fe0f0bbbSJung-uk Kim
496fe0f0bbbSJung-uk Kim NameBuffer = ACPI_ALLOCATE_ZEROED (Size);
497fe0f0bbbSJung-uk Kim if (!NameBuffer)
498fe0f0bbbSJung-uk Kim {
499f8146b88SJung-uk Kim ACPI_ERROR ((AE_INFO,
500f8146b88SJung-uk Kim "Could not allocate %u bytes", (UINT32) Size));
501fe0f0bbbSJung-uk Kim return_PTR (NULL);
502fe0f0bbbSJung-uk Kim }
503fe0f0bbbSJung-uk Kim
504fe0f0bbbSJung-uk Kim /* Build the path in the allocated buffer */
505fe0f0bbbSJung-uk Kim
506ec0234b4SJung-uk Kim (void) AcpiNsBuildNormalizedPath (Node, NameBuffer, (UINT32) Size, NoTrailing);
507fe0f0bbbSJung-uk Kim
508ff879b07SJung-uk Kim ACPI_DEBUG_PRINT_RAW ((ACPI_DB_NAMES, "%s: Path \"%s\"\n",
509ff879b07SJung-uk Kim ACPI_GET_FUNCTION_NAME, NameBuffer));
510ff879b07SJung-uk Kim
511fe0f0bbbSJung-uk Kim return_PTR (NameBuffer);
512fe0f0bbbSJung-uk Kim }
513b7b7e711SJung-uk Kim
514b7b7e711SJung-uk Kim
515b7b7e711SJung-uk Kim /*******************************************************************************
516b7b7e711SJung-uk Kim *
517b7b7e711SJung-uk Kim * FUNCTION: AcpiNsBuildPrefixedPathname
518b7b7e711SJung-uk Kim *
519b7b7e711SJung-uk Kim * PARAMETERS: PrefixScope - Scope/Path that prefixes the internal path
520b7b7e711SJung-uk Kim * InternalPath - Name or path of the namespace node
521b7b7e711SJung-uk Kim *
522b7b7e711SJung-uk Kim * RETURN: None
523b7b7e711SJung-uk Kim *
524b7b7e711SJung-uk Kim * DESCRIPTION: Construct a fully qualified pathname from a concatenation of:
525b7b7e711SJung-uk Kim * 1) Path associated with the PrefixScope namespace node
526b7b7e711SJung-uk Kim * 2) External path representation of the Internal path
527b7b7e711SJung-uk Kim *
528b7b7e711SJung-uk Kim ******************************************************************************/
529b7b7e711SJung-uk Kim
530b7b7e711SJung-uk Kim char *
AcpiNsBuildPrefixedPathname(ACPI_GENERIC_STATE * PrefixScope,const char * InternalPath)531b7b7e711SJung-uk Kim AcpiNsBuildPrefixedPathname (
532b7b7e711SJung-uk Kim ACPI_GENERIC_STATE *PrefixScope,
533b7b7e711SJung-uk Kim const char *InternalPath)
534b7b7e711SJung-uk Kim {
535b7b7e711SJung-uk Kim ACPI_STATUS Status;
536b7b7e711SJung-uk Kim char *FullPath = NULL;
537b7b7e711SJung-uk Kim char *ExternalPath = NULL;
538b7b7e711SJung-uk Kim char *PrefixPath = NULL;
539ec0234b4SJung-uk Kim ACPI_SIZE PrefixPathLength = 0;
540b7b7e711SJung-uk Kim
541b7b7e711SJung-uk Kim
542b7b7e711SJung-uk Kim /* If there is a prefix, get the pathname to it */
543b7b7e711SJung-uk Kim
544b7b7e711SJung-uk Kim if (PrefixScope && PrefixScope->Scope.Node)
545b7b7e711SJung-uk Kim {
546b7b7e711SJung-uk Kim PrefixPath = AcpiNsGetNormalizedPathname (PrefixScope->Scope.Node, TRUE);
547b7b7e711SJung-uk Kim if (PrefixPath)
548b7b7e711SJung-uk Kim {
549b7b7e711SJung-uk Kim PrefixPathLength = strlen (PrefixPath);
550b7b7e711SJung-uk Kim }
551b7b7e711SJung-uk Kim }
552b7b7e711SJung-uk Kim
553b7b7e711SJung-uk Kim Status = AcpiNsExternalizeName (ACPI_UINT32_MAX, InternalPath,
554b7b7e711SJung-uk Kim NULL, &ExternalPath);
555b7b7e711SJung-uk Kim if (ACPI_FAILURE (Status))
556b7b7e711SJung-uk Kim {
557b7b7e711SJung-uk Kim goto Cleanup;
558b7b7e711SJung-uk Kim }
559b7b7e711SJung-uk Kim
560b7b7e711SJung-uk Kim /* Merge the prefix path and the path. 2 is for one dot and trailing null */
561b7b7e711SJung-uk Kim
562b7b7e711SJung-uk Kim FullPath = ACPI_ALLOCATE_ZEROED (
563b7b7e711SJung-uk Kim PrefixPathLength + strlen (ExternalPath) + 2);
564b7b7e711SJung-uk Kim if (!FullPath)
565b7b7e711SJung-uk Kim {
566b7b7e711SJung-uk Kim goto Cleanup;
567b7b7e711SJung-uk Kim }
568b7b7e711SJung-uk Kim
569b7b7e711SJung-uk Kim /* Don't merge if the External path is already fully qualified */
570b7b7e711SJung-uk Kim
571b7b7e711SJung-uk Kim if (PrefixPath &&
572b7b7e711SJung-uk Kim (*ExternalPath != '\\') &&
573b7b7e711SJung-uk Kim (*ExternalPath != '^'))
574b7b7e711SJung-uk Kim {
575b7b7e711SJung-uk Kim strcat (FullPath, PrefixPath);
576b7b7e711SJung-uk Kim if (PrefixPath[1])
577b7b7e711SJung-uk Kim {
578b7b7e711SJung-uk Kim strcat (FullPath, ".");
579b7b7e711SJung-uk Kim }
580b7b7e711SJung-uk Kim }
581b7b7e711SJung-uk Kim
582b7b7e711SJung-uk Kim AcpiNsNormalizePathname (ExternalPath);
583b7b7e711SJung-uk Kim strcat (FullPath, ExternalPath);
584b7b7e711SJung-uk Kim
585b7b7e711SJung-uk Kim Cleanup:
586b7b7e711SJung-uk Kim if (PrefixPath)
587b7b7e711SJung-uk Kim {
588b7b7e711SJung-uk Kim ACPI_FREE (PrefixPath);
589b7b7e711SJung-uk Kim }
590b7b7e711SJung-uk Kim if (ExternalPath)
591b7b7e711SJung-uk Kim {
592b7b7e711SJung-uk Kim ACPI_FREE (ExternalPath);
593b7b7e711SJung-uk Kim }
594b7b7e711SJung-uk Kim
595b7b7e711SJung-uk Kim return (FullPath);
596b7b7e711SJung-uk Kim }
597b7b7e711SJung-uk Kim
598b7b7e711SJung-uk Kim
599b7b7e711SJung-uk Kim /*******************************************************************************
600b7b7e711SJung-uk Kim *
601b7b7e711SJung-uk Kim * FUNCTION: AcpiNsNormalizePathname
602b7b7e711SJung-uk Kim *
603b7b7e711SJung-uk Kim * PARAMETERS: OriginalPath - Path to be normalized, in External format
604b7b7e711SJung-uk Kim *
605b7b7e711SJung-uk Kim * RETURN: The original path is processed in-place
606b7b7e711SJung-uk Kim *
607b7b7e711SJung-uk Kim * DESCRIPTION: Remove trailing underscores from each element of a path.
608b7b7e711SJung-uk Kim *
609b7b7e711SJung-uk Kim * For example: \A___.B___.C___ becomes \A.B.C
610b7b7e711SJung-uk Kim *
611b7b7e711SJung-uk Kim ******************************************************************************/
612b7b7e711SJung-uk Kim
6133ee58df5SJung-uk Kim void
AcpiNsNormalizePathname(char * OriginalPath)614b7b7e711SJung-uk Kim AcpiNsNormalizePathname (
615b7b7e711SJung-uk Kim char *OriginalPath)
616b7b7e711SJung-uk Kim {
617b7b7e711SJung-uk Kim char *InputPath = OriginalPath;
618b7b7e711SJung-uk Kim char *NewPathBuffer;
619b7b7e711SJung-uk Kim char *NewPath;
620b7b7e711SJung-uk Kim UINT32 i;
621b7b7e711SJung-uk Kim
622b7b7e711SJung-uk Kim
623b7b7e711SJung-uk Kim /* Allocate a temp buffer in which to construct the new path */
624b7b7e711SJung-uk Kim
625b7b7e711SJung-uk Kim NewPathBuffer = ACPI_ALLOCATE_ZEROED (strlen (InputPath) + 1);
626b7b7e711SJung-uk Kim NewPath = NewPathBuffer;
627b7b7e711SJung-uk Kim if (!NewPathBuffer)
628b7b7e711SJung-uk Kim {
629b7b7e711SJung-uk Kim return;
630b7b7e711SJung-uk Kim }
631b7b7e711SJung-uk Kim
632b7b7e711SJung-uk Kim /* Special characters may appear at the beginning of the path */
633b7b7e711SJung-uk Kim
634b7b7e711SJung-uk Kim if (*InputPath == '\\')
635b7b7e711SJung-uk Kim {
636b7b7e711SJung-uk Kim *NewPath = *InputPath;
637b7b7e711SJung-uk Kim NewPath++;
638b7b7e711SJung-uk Kim InputPath++;
639b7b7e711SJung-uk Kim }
640b7b7e711SJung-uk Kim
641b7b7e711SJung-uk Kim while (*InputPath == '^')
642b7b7e711SJung-uk Kim {
643b7b7e711SJung-uk Kim *NewPath = *InputPath;
644b7b7e711SJung-uk Kim NewPath++;
645b7b7e711SJung-uk Kim InputPath++;
646b7b7e711SJung-uk Kim }
647b7b7e711SJung-uk Kim
648b7b7e711SJung-uk Kim /* Remainder of the path */
649b7b7e711SJung-uk Kim
650b7b7e711SJung-uk Kim while (*InputPath)
651b7b7e711SJung-uk Kim {
652b7b7e711SJung-uk Kim /* Do one nameseg at a time */
653b7b7e711SJung-uk Kim
654278f0de6SJung-uk Kim for (i = 0; (i < ACPI_NAMESEG_SIZE) && *InputPath; i++)
655b7b7e711SJung-uk Kim {
656b7b7e711SJung-uk Kim if ((i == 0) || (*InputPath != '_')) /* First char is allowed to be underscore */
657b7b7e711SJung-uk Kim {
658b7b7e711SJung-uk Kim *NewPath = *InputPath;
659b7b7e711SJung-uk Kim NewPath++;
660b7b7e711SJung-uk Kim }
661b7b7e711SJung-uk Kim
662b7b7e711SJung-uk Kim InputPath++;
663b7b7e711SJung-uk Kim }
664b7b7e711SJung-uk Kim
665b7b7e711SJung-uk Kim /* Dot means that there are more namesegs to come */
666b7b7e711SJung-uk Kim
667b7b7e711SJung-uk Kim if (*InputPath == '.')
668b7b7e711SJung-uk Kim {
669b7b7e711SJung-uk Kim *NewPath = *InputPath;
670b7b7e711SJung-uk Kim NewPath++;
671b7b7e711SJung-uk Kim InputPath++;
672b7b7e711SJung-uk Kim }
673b7b7e711SJung-uk Kim }
674b7b7e711SJung-uk Kim
675b7b7e711SJung-uk Kim *NewPath = 0;
676b7b7e711SJung-uk Kim strcpy (OriginalPath, NewPathBuffer);
677b7b7e711SJung-uk Kim ACPI_FREE (NewPathBuffer);
678b7b7e711SJung-uk Kim }
679