1 /*******************************************************************************
3 * Module Name: nssearch - Namespace search
6 ******************************************************************************/
8 /******************************************************************************
12 * Some or all of this work - Copyright (c) 1999 - 2005, Intel Corp.
13 * All rights reserved.
17 * 2.1. This is your license from Intel Corp. under its intellectual property
18 * rights. You may have additional license terms from the party that provided
19 * you this software, covering your right to use that party's intellectual
22 * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a
23 * copy of the source code appearing in this file ("Covered Code") an
24 * irrevocable, perpetual, worldwide license under Intel's copyrights in the
25 * base code distributed originally by Intel ("Original Intel Code") to copy,
26 * make derivatives, distribute, use and display any portion of the Covered
27 * Code in any form, with the right to sublicense such rights; and
29 * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent
30 * license (with the right to sublicense), under only those claims of Intel
31 * patents that are infringed by the Original Intel Code, to make, use, sell,
32 * offer to sell, and import the Covered Code and derivative works thereof
33 * solely to the minimum extent necessary to exercise the above copyright
34 * license, and in no event shall the patent license extend to any additions
35 * to or modifications of the Original Intel Code. No other license or right
36 * is granted directly or by implication, estoppel or otherwise;
38 * The above copyright and patent license is granted only if the following
43 * 3.1. Redistribution of Source with Rights to Further Distribute Source.
44 * Redistribution of source code of any substantial portion of the Covered
45 * Code or modification with rights to further distribute source must include
46 * the above Copyright Notice, the above License, this list of Conditions,
47 * and the following Disclaimer and Export Compliance provision. In addition,
48 * Licensee must cause all Covered Code to which Licensee contributes to
49 * contain a file documenting the changes Licensee made to create that Covered
50 * Code and the date of any change. Licensee must include in that file the
51 * documentation of any changes made by any predecessor Licensee. Licensee
52 * must include a prominent statement that the modification is derived,
53 * directly or indirectly, from Original Intel Code.
55 * 3.2. Redistribution of Source with no Rights to Further Distribute Source.
56 * Redistribution of source code of any substantial portion of the Covered
57 * Code or modification without rights to further distribute source must
58 * include the following Disclaimer and Export Compliance provision in the
59 * documentation and/or other materials provided with distribution. In
60 * addition, Licensee may not authorize further sublicense of source of any
61 * portion of the Covered Code, and must include terms to the effect that the
62 * license from Licensee to its licensee is limited to the intellectual
63 * property embodied in the software Licensee provides to its licensee, and
64 * not to intellectual property embodied in modifications its licensee may
67 * 3.3. Redistribution of Executable. Redistribution in executable form of any
68 * substantial portion of the Covered Code or modification must reproduce the
69 * above Copyright Notice, and the following Disclaimer and Export Compliance
70 * provision in the documentation and/or other materials provided with the
73 * 3.4. Intel retains all right, title, and interest in and to the Original
76 * 3.5. Neither the name Intel nor any other trademark owned or controlled by
77 * Intel shall be used in advertising or otherwise to promote the sale, use or
78 * other dealings in products derived from or relating to the Covered Code
79 * without prior written authorization from Intel.
81 * 4. Disclaimer and Export Compliance
83 * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED
84 * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE
85 * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE,
86 * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY
87 * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY
88 * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A
91 * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES
92 * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR
93 * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT,
94 * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY
95 * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL
96 * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS
97 * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY
100 * 4.3. Licensee shall not export, either directly or indirectly, any of this
101 * software or system incorporating such software without first obtaining any
102 * required license or other approval from the U. S. Department of Commerce or
103 * any other agency or department of the United States Government. In the
104 * event Licensee exports any such software from the United States or
105 * re-exports any such software from a foreign destination, Licensee shall
106 * ensure that the distribution and export/re-export of the software is in
107 * compliance with all laws, regulations, orders, or other restrictions of the
108 * U.S. Export Administration Regulations. Licensee agrees that neither it nor
109 * any of its subsidiaries will export/re-export any technical data, process,
110 * software, or service, directly or indirectly, to any country for which the
111 * United States government or any agency thereof requires an export license,
112 * other governmental approval, or letter of assurance, without first obtaining
113 * such license, approval or letter.
115 *****************************************************************************/
117 #define __NSSEARCH_C__
119 #include <contrib/dev/acpica/acpi.h>
120 #include <contrib/dev/acpica/acnamesp.h>
123 #define _COMPONENT ACPI_NAMESPACE
124 ACPI_MODULE_NAME ("nssearch")
126 /* Local prototypes */
129 AcpiNsSearchParentTree (
131 ACPI_NAMESPACE_NODE *Node,
132 ACPI_OBJECT_TYPE Type,
133 ACPI_NAMESPACE_NODE **ReturnNode);
136 /*******************************************************************************
138 * FUNCTION: AcpiNsSearchNode
140 * PARAMETERS: TargetName - Ascii ACPI name to search for
141 * Node - Starting node where search will begin
142 * Type - Object type to match
143 * ReturnNode - Where the matched Named obj is returned
147 * DESCRIPTION: Search a single level of the namespace. Performs a
148 * simple search of the specified level, and does not add
149 * entries or search parents.
152 * Named object lists are built (and subsequently dumped) in the
153 * order in which the names are encountered during the namespace load;
155 * All namespace searching is linear in this implementation, but
156 * could be easily modified to support any improved search
157 * algorithm. However, the linear search was chosen for simplicity
158 * and because the trees are small and the other interpreter
159 * execution overhead is relatively high.
161 ******************************************************************************/
166 ACPI_NAMESPACE_NODE *Node,
167 ACPI_OBJECT_TYPE Type,
168 ACPI_NAMESPACE_NODE **ReturnNode)
170 ACPI_NAMESPACE_NODE *NextNode;
173 ACPI_FUNCTION_TRACE ("NsSearchNode");
176 #ifdef ACPI_DEBUG_OUTPUT
177 if (ACPI_LV_NAMES & AcpiDbgLevel)
181 ScopeName = AcpiNsGetExternalPathname (Node);
184 ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
185 "Searching %s (%p) For [%4.4s] (%s)\n",
186 ScopeName, Node, (char *) &TargetName,
187 AcpiUtGetTypeName (Type)));
189 ACPI_MEM_FREE (ScopeName);
195 * Search for name at this namespace level, which is to say that we
196 * must search for the name among the children of this object
198 NextNode = Node->Child;
201 /* Check for match against the name */
203 if (NextNode->Name.Integer == TargetName)
205 /* Resolve a control method alias if any */
207 if (AcpiNsGetType (NextNode) == ACPI_TYPE_LOCAL_METHOD_ALIAS)
209 NextNode = ACPI_CAST_PTR (ACPI_NAMESPACE_NODE, NextNode->Object);
213 * Found matching entry.
215 ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
216 "Name [%4.4s] (%s) %p found in scope [%4.4s] %p\n",
217 (char *) &TargetName, AcpiUtGetTypeName (NextNode->Type),
218 NextNode, AcpiUtGetNodeName (Node), Node));
220 *ReturnNode = NextNode;
221 return_ACPI_STATUS (AE_OK);
225 * The last entry in the list points back to the parent,
226 * so a flag is used to indicate the end-of-list
228 if (NextNode->Flags & ANOBJ_END_OF_PEER_LIST)
230 /* Searched entire list, we are done */
235 /* Didn't match name, move on to the next peer object */
237 NextNode = NextNode->Peer;
240 /* Searched entire namespace level, not found */
242 ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
243 "Name [%4.4s] (%s) not found in search in scope [%4.4s] %p first child %p\n",
244 (char *) &TargetName, AcpiUtGetTypeName (Type),
245 AcpiUtGetNodeName (Node), Node, Node->Child));
247 return_ACPI_STATUS (AE_NOT_FOUND);
251 /*******************************************************************************
253 * FUNCTION: AcpiNsSearchParentTree
255 * PARAMETERS: TargetName - Ascii ACPI name to search for
256 * Node - Starting node where search will begin
257 * Type - Object type to match
258 * ReturnNode - Where the matched Node is returned
262 * DESCRIPTION: Called when a name has not been found in the current namespace
263 * level. Before adding it or giving up, ACPI scope rules require
264 * searching enclosing scopes in cases identified by AcpiNsLocal().
266 * "A name is located by finding the matching name in the current
267 * name space, and then in the parent name space. If the parent
268 * name space does not contain the name, the search continues
269 * recursively until either the name is found or the name space
270 * does not have a parent (the root of the name space). This
271 * indicates that the name is not found" (From ACPI Specification,
274 ******************************************************************************/
277 AcpiNsSearchParentTree (
279 ACPI_NAMESPACE_NODE *Node,
280 ACPI_OBJECT_TYPE Type,
281 ACPI_NAMESPACE_NODE **ReturnNode)
284 ACPI_NAMESPACE_NODE *ParentNode;
287 ACPI_FUNCTION_TRACE ("NsSearchParentTree");
290 ParentNode = AcpiNsGetParentNode (Node);
293 * If there is no parent (i.e., we are at the root) or type is "local",
294 * we won't be searching the parent tree.
298 ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "[%4.4s] has no parent\n",
299 (char *) &TargetName));
300 return_ACPI_STATUS (AE_NOT_FOUND);
303 if (AcpiNsLocal (Type))
305 ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
306 "[%4.4s] type [%s] must be local to this scope (no parent search)\n",
307 (char *) &TargetName, AcpiUtGetTypeName (Type)));
308 return_ACPI_STATUS (AE_NOT_FOUND);
311 /* Search the parent tree */
313 ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
314 "Searching parent [%4.4s] for [%4.4s]\n",
315 AcpiUtGetNodeName (ParentNode), (char *) &TargetName));
318 * Search parents until target is found or we have backed up to the root
323 * Search parent scope. Use TYPE_ANY because we don't care about the
324 * object type at this point, we only care about the existence of
325 * the actual name we are searching for. Typechecking comes later.
327 Status = AcpiNsSearchNode (TargetName, ParentNode,
328 ACPI_TYPE_ANY, ReturnNode);
329 if (ACPI_SUCCESS (Status))
331 return_ACPI_STATUS (Status);
335 * Not found here, go up another level
336 * (until we reach the root)
338 ParentNode = AcpiNsGetParentNode (ParentNode);
341 /* Not found in parent tree */
343 return_ACPI_STATUS (AE_NOT_FOUND);
347 /*******************************************************************************
349 * FUNCTION: AcpiNsSearchAndEnter
351 * PARAMETERS: TargetName - Ascii ACPI name to search for (4 chars)
352 * WalkState - Current state of the walk
353 * Node - Starting node where search will begin
354 * InterpreterMode - Add names only in ACPI_MODE_LOAD_PASS_x.
355 * Otherwise,search only.
356 * Type - Object type to match
357 * Flags - Flags describing the search restrictions
358 * ReturnNode - Where the Node is returned
362 * DESCRIPTION: Search for a name segment in a single namespace level,
363 * optionally adding it if it is not found. If the passed
364 * Type is not Any and the type previously stored in the
365 * entry was Any (i.e. unknown), update the stored type.
367 * In ACPI_IMODE_EXECUTE, search only.
368 * In other modes, search and add if not found.
370 ******************************************************************************/
373 AcpiNsSearchAndEnter (
375 ACPI_WALK_STATE *WalkState,
376 ACPI_NAMESPACE_NODE *Node,
377 ACPI_INTERPRETER_MODE InterpreterMode,
378 ACPI_OBJECT_TYPE Type,
380 ACPI_NAMESPACE_NODE **ReturnNode)
383 ACPI_NAMESPACE_NODE *NewNode;
386 ACPI_FUNCTION_TRACE ("NsSearchAndEnter");
389 /* Parameter validation */
391 if (!Node || !TargetName || !ReturnNode)
393 ACPI_DEBUG_PRINT ((ACPI_DB_ERROR,
394 "Null param: Node %p Name %X ReturnNode %p\n",
395 Node, TargetName, ReturnNode));
397 ACPI_REPORT_ERROR (("NsSearchAndEnter: Null parameter\n"));
398 return_ACPI_STATUS (AE_BAD_PARAMETER);
401 /* Name must consist of printable characters */
403 if (!AcpiUtValidAcpiName (TargetName))
405 ACPI_REPORT_ERROR (("NsSearchAndEnter: Bad character in ACPI Name: %X\n",
407 return_ACPI_STATUS (AE_BAD_CHARACTER);
410 /* Try to find the name in the namespace level specified by the caller */
412 *ReturnNode = ACPI_ENTRY_NOT_FOUND;
413 Status = AcpiNsSearchNode (TargetName, Node, Type, ReturnNode);
414 if (Status != AE_NOT_FOUND)
417 * If we found it AND the request specifies that a find is an error,
420 if ((Status == AE_OK) &&
421 (Flags & ACPI_NS_ERROR_IF_FOUND))
423 Status = AE_ALREADY_EXISTS;
427 * Either found it or there was an error
428 * -- finished either way
430 return_ACPI_STATUS (Status);
434 * The name was not found. If we are NOT performing the first pass
435 * (name entry) of loading the namespace, search the parent tree (all the
436 * way to the root if necessary.) We don't want to perform the parent
437 * search when the namespace is actually being loaded. We want to perform
438 * the search when namespace references are being resolved (load pass 2)
439 * and during the execution phase.
441 if ((InterpreterMode != ACPI_IMODE_LOAD_PASS1) &&
442 (Flags & ACPI_NS_SEARCH_PARENT))
445 * Not found at this level - search parent tree according to the
448 Status = AcpiNsSearchParentTree (TargetName, Node, Type, ReturnNode);
449 if (ACPI_SUCCESS (Status))
451 return_ACPI_STATUS (Status);
456 * In execute mode, just search, never add names. Exit now.
458 if (InterpreterMode == ACPI_IMODE_EXECUTE)
460 ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
461 "%4.4s Not found in %p [Not adding]\n",
462 (char *) &TargetName, Node));
464 return_ACPI_STATUS (AE_NOT_FOUND);
467 /* Create the new named object */
469 NewNode = AcpiNsCreateNode (TargetName);
472 return_ACPI_STATUS (AE_NO_MEMORY);
475 /* Install the new object into the parent's list of children */
477 AcpiNsInstallNode (WalkState, Node, NewNode, Type);
478 *ReturnNode = NewNode;
480 return_ACPI_STATUS (AE_OK);