nssearch.c revision 107325
1/*******************************************************************************
2 *
3 * Module Name: nssearch - Namespace search
4 *              $Revision: 92 $
5 *
6 ******************************************************************************/
7
8/******************************************************************************
9 *
10 * 1. Copyright Notice
11 *
12 * Some or all of this work - Copyright (c) 1999 - 2002, Intel Corp.
13 * All rights reserved.
14 *
15 * 2. License
16 *
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
20 * property rights.
21 *
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
28 *
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;
37 *
38 * The above copyright and patent license is granted only if the following
39 * conditions are met:
40 *
41 * 3. Conditions
42 *
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.
54 *
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
65 * make.
66 *
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
71 * distribution.
72 *
73 * 3.4. Intel retains all right, title, and interest in and to the Original
74 * Intel Code.
75 *
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.
80 *
81 * 4. Disclaimer and Export Compliance
82 *
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
89 * PARTICULAR PURPOSE.
90 *
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
98 * LIMITED REMEDY.
99 *
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.
114 *
115 *****************************************************************************/
116
117#define __NSSEARCH_C__
118
119#include "acpi.h"
120#include "acnamesp.h"
121
122
123#define _COMPONENT          ACPI_NAMESPACE
124        ACPI_MODULE_NAME    ("nssearch")
125
126
127/*******************************************************************************
128 *
129 * FUNCTION:    AcpiNsSearchNode
130 *
131 * PARAMETERS:  *TargetName         - Ascii ACPI name to search for
132 *              *Node               - Starting node where search will begin
133 *              Type                - Object type to match
134 *              **ReturnNode        - Where the matched Named obj is returned
135 *
136 * RETURN:      Status
137 *
138 * DESCRIPTION: Search a single level of the namespace.  Performs a
139 *              simple search of the specified level, and does not add
140 *              entries or search parents.
141 *
142 *
143 *      Named object lists are built (and subsequently dumped) in the
144 *      order in which the names are encountered during the namespace load;
145 *
146 *      All namespace searching is linear in this implementation, but
147 *      could be easily modified to support any improved search
148 *      algorithm.  However, the linear search was chosen for simplicity
149 *      and because the trees are small and the other interpreter
150 *      execution overhead is relatively high.
151 *
152 ******************************************************************************/
153
154ACPI_STATUS
155AcpiNsSearchNode (
156    UINT32                  TargetName,
157    ACPI_NAMESPACE_NODE     *Node,
158    ACPI_OBJECT_TYPE        Type,
159    ACPI_NAMESPACE_NODE     **ReturnNode)
160{
161    ACPI_NAMESPACE_NODE     *NextNode;
162
163
164    ACPI_FUNCTION_TRACE ("NsSearchNode");
165
166
167#ifdef ACPI_DEBUG_OUTPUT
168    if (ACPI_LV_NAMES & AcpiDbgLevel)
169    {
170        NATIVE_CHAR         *ScopeName;
171
172        ScopeName = AcpiNsGetExternalPathname (Node);
173        if (ScopeName)
174        {
175            ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "Searching %s [%p] For %4.4s (%s)\n",
176                ScopeName, Node, (char *) &TargetName, AcpiUtGetTypeName (Type)));
177
178            ACPI_MEM_FREE (ScopeName);
179        }
180    }
181#endif
182
183    /*
184     * Search for name at this namespace level, which is to say that we
185     * must search for the name among the children of this object
186     */
187    NextNode = Node->Child;
188    while (NextNode)
189    {
190        /* Check for match against the name */
191
192        if (NextNode->Name.Integer == TargetName)
193        {
194            /*
195             * Found matching entry.
196             */
197            ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
198                "Name %4.4s Type [%s] found at %p\n",
199                (char *) &TargetName, AcpiUtGetTypeName (NextNode->Type), NextNode));
200
201            *ReturnNode = NextNode;
202            return_ACPI_STATUS (AE_OK);
203        }
204
205        /*
206         * The last entry in the list points back to the parent,
207         * so a flag is used to indicate the end-of-list
208         */
209        if (NextNode->Flags & ANOBJ_END_OF_PEER_LIST)
210        {
211            /* Searched entire list, we are done */
212
213            break;
214        }
215
216        /* Didn't match name, move on to the next peer object */
217
218        NextNode = NextNode->Peer;
219    }
220
221    /* Searched entire namespace level, not found */
222
223    ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "Name %4.4s Type [%s] not found at %p\n",
224        (char *) &TargetName, AcpiUtGetTypeName (Type), NextNode));
225
226    return_ACPI_STATUS (AE_NOT_FOUND);
227}
228
229
230/*******************************************************************************
231 *
232 * FUNCTION:    AcpiNsSearchParentTree
233 *
234 * PARAMETERS:  *TargetName         - Ascii ACPI name to search for
235 *              *Node               - Starting node where search will begin
236 *              Type                - Object type to match
237 *              **ReturnNode        - Where the matched Named Obj is returned
238 *
239 * RETURN:      Status
240 *
241 * DESCRIPTION: Called when a name has not been found in the current namespace
242 *              level.  Before adding it or giving up, ACPI scope rules require
243 *              searching enclosing scopes in cases identified by AcpiNsLocal().
244 *
245 *              "A name is located by finding the matching name in the current
246 *              name space, and then in the parent name space. If the parent
247 *              name space does not contain the name, the search continues
248 *              recursively until either the name is found or the name space
249 *              does not have a parent (the root of the name space).  This
250 *              indicates that the name is not found" (From ACPI Specification,
251 *              section 5.3)
252 *
253 ******************************************************************************/
254
255static ACPI_STATUS
256AcpiNsSearchParentTree (
257    UINT32                  TargetName,
258    ACPI_NAMESPACE_NODE     *Node,
259    ACPI_OBJECT_TYPE        Type,
260    ACPI_NAMESPACE_NODE     **ReturnNode)
261{
262    ACPI_STATUS             Status;
263    ACPI_NAMESPACE_NODE     *ParentNode;
264
265
266    ACPI_FUNCTION_TRACE ("NsSearchParentTree");
267
268
269    ParentNode = AcpiNsGetParentNode (Node);
270
271    /*
272     * If there is no parent (i.e., we are at the root) or
273     * type is "local", we won't be searching the parent tree.
274     */
275    if (!ParentNode)
276    {
277        ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "[%4.4s] has no parent\n",
278            (char *) &TargetName));
279         return_ACPI_STATUS (AE_NOT_FOUND);
280    }
281
282    if (AcpiNsLocal (Type))
283    {
284        ACPI_DEBUG_PRINT ((ACPI_DB_NAMES,
285            "[%4.4s] type [%s] must be local to this scope (no parent search)\n",
286            (char *) &TargetName, AcpiUtGetTypeName (Type)));
287        return_ACPI_STATUS (AE_NOT_FOUND);
288    }
289
290    /* Search the parent tree */
291
292    ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "Searching parent for %4.4s\n", (char *) &TargetName));
293
294    /*
295     * Search parents until found the target or we have backed up to
296     * the root
297     */
298    while (ParentNode)
299    {
300        /*
301         * Search parent scope.  Use TYPE_ANY because we don't care about the
302         * object type at this point, we only care about the existence of
303         * the actual name we are searching for.  Typechecking comes later.
304         */
305        Status = AcpiNsSearchNode (TargetName, ParentNode,
306                                        ACPI_TYPE_ANY, ReturnNode);
307        if (ACPI_SUCCESS (Status))
308        {
309            return_ACPI_STATUS (Status);
310        }
311
312        /*
313         * Not found here, go up another level
314         * (until we reach the root)
315         */
316        ParentNode = AcpiNsGetParentNode (ParentNode);
317    }
318
319    /* Not found in parent tree */
320
321    return_ACPI_STATUS (AE_NOT_FOUND);
322}
323
324
325/*******************************************************************************
326 *
327 * FUNCTION:    AcpiNsSearchAndEnter
328 *
329 * PARAMETERS:  TargetName          - Ascii ACPI name to search for (4 chars)
330 *              WalkState           - Current state of the walk
331 *              *Node               - Starting node where search will begin
332 *              InterpreterMode     - Add names only in ACPI_MODE_LOAD_PASS_x.
333 *                                    Otherwise,search only.
334 *              Type                - Object type to match
335 *              Flags               - Flags describing the search restrictions
336 *              **ReturnNode        - Where the Node is returned
337 *
338 * RETURN:      Status
339 *
340 * DESCRIPTION: Search for a name segment in a single namespace level,
341 *              optionally adding it if it is not found.  If the passed
342 *              Type is not Any and the type previously stored in the
343 *              entry was Any (i.e. unknown), update the stored type.
344 *
345 *              In ACPI_IMODE_EXECUTE, search only.
346 *              In other modes, search and add if not found.
347 *
348 ******************************************************************************/
349
350ACPI_STATUS
351AcpiNsSearchAndEnter (
352    UINT32                  TargetName,
353    ACPI_WALK_STATE         *WalkState,
354    ACPI_NAMESPACE_NODE     *Node,
355    ACPI_INTERPRETER_MODE   InterpreterMode,
356    ACPI_OBJECT_TYPE        Type,
357    UINT32                  Flags,
358    ACPI_NAMESPACE_NODE     **ReturnNode)
359{
360    ACPI_STATUS             Status;
361    ACPI_NAMESPACE_NODE     *NewNode;
362
363
364    ACPI_FUNCTION_TRACE ("NsSearchAndEnter");
365
366
367    /* Parameter validation */
368
369    if (!Node || !TargetName || !ReturnNode)
370    {
371        ACPI_DEBUG_PRINT ((ACPI_DB_ERROR, "Null param: Node %p Name %X ReturnNode %p\n",
372            Node, TargetName, ReturnNode));
373
374        ACPI_REPORT_ERROR (("NsSearchAndEnter: Null parameter\n"));
375        return_ACPI_STATUS (AE_BAD_PARAMETER);
376    }
377
378    /* Name must consist of printable characters */
379
380    if (!AcpiUtValidAcpiName (TargetName))
381    {
382        ACPI_REPORT_ERROR (("NsSearchAndEnter: Bad character in ACPI Name: %X\n",
383            TargetName));
384        return_ACPI_STATUS (AE_BAD_CHARACTER);
385    }
386
387    /* Try to find the name in the namespace level specified by the caller */
388
389    *ReturnNode = ACPI_ENTRY_NOT_FOUND;
390    Status = AcpiNsSearchNode (TargetName, Node, Type, ReturnNode);
391    if (Status != AE_NOT_FOUND)
392    {
393        /*
394         * If we found it AND the request specifies that a find is an error,
395         * return the error
396         */
397        if ((Status == AE_OK) &&
398            (Flags & ACPI_NS_ERROR_IF_FOUND))
399        {
400            Status = AE_ALREADY_EXISTS;
401        }
402
403        /*
404         * Either found it or there was an error
405         * -- finished either way
406         */
407        return_ACPI_STATUS (Status);
408    }
409
410    /*
411     * The name was not found.  If we are NOT performing the
412     * first pass (name entry) of loading the namespace, search
413     * the parent tree (all the way to the root if necessary.)
414     * We don't want to perform the parent search when the
415     * namespace is actually being loaded.  We want to perform
416     * the search when namespace references are being resolved
417     * (load pass 2) and during the execution phase.
418     */
419    if ((InterpreterMode != ACPI_IMODE_LOAD_PASS1) &&
420        (Flags & ACPI_NS_SEARCH_PARENT))
421    {
422        /*
423         * Not found at this level - search parent tree according
424         * to ACPI specification
425         */
426        Status = AcpiNsSearchParentTree (TargetName, Node,
427                                            Type, ReturnNode);
428        if (ACPI_SUCCESS (Status))
429        {
430            return_ACPI_STATUS (Status);
431        }
432    }
433
434    /*
435     * In execute mode, just search, never add names.  Exit now.
436     */
437    if (InterpreterMode == ACPI_IMODE_EXECUTE)
438    {
439        ACPI_DEBUG_PRINT ((ACPI_DB_NAMES, "%4.4s Not found in %p [Not adding]\n",
440            (char *) &TargetName, Node));
441
442        return_ACPI_STATUS (AE_NOT_FOUND);
443    }
444
445    /* Create the new named object */
446
447    NewNode = AcpiNsCreateNode (TargetName);
448    if (!NewNode)
449    {
450        return_ACPI_STATUS (AE_NO_MEMORY);
451    }
452
453    /* Install the new object into the parent's list of children */
454
455    AcpiNsInstallNode (WalkState, Node, NewNode, Type);
456    *ReturnNode = NewNode;
457
458    return_ACPI_STATUS (AE_OK);
459}
460
461