Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /******************************************************************************* |
2 | * | |
3 | * Module Name: nssearch - Namespace search | |
4 | * | |
5 | ******************************************************************************/ | |
6 | ||
7 | /* | |
4a90c7e8 | 8 | * Copyright (C) 2000 - 2006, R. Byron Moore |
1da177e4 LT |
9 | * All rights reserved. |
10 | * | |
11 | * Redistribution and use in source and binary forms, with or without | |
12 | * modification, are permitted provided that the following conditions | |
13 | * are met: | |
14 | * 1. Redistributions of source code must retain the above copyright | |
15 | * notice, this list of conditions, and the following disclaimer, | |
16 | * without modification. | |
17 | * 2. Redistributions in binary form must reproduce at minimum a disclaimer | |
18 | * substantially similar to the "NO WARRANTY" disclaimer below | |
19 | * ("Disclaimer") and any redistribution must be conditioned upon | |
20 | * including a substantially similar Disclaimer requirement for further | |
21 | * binary redistribution. | |
22 | * 3. Neither the names of the above-listed copyright holders nor the names | |
23 | * of any contributors may be used to endorse or promote products derived | |
24 | * from this software without specific prior written permission. | |
25 | * | |
26 | * Alternatively, this software may be distributed under the terms of the | |
27 | * GNU General Public License ("GPL") version 2 as published by the Free | |
28 | * Software Foundation. | |
29 | * | |
30 | * NO WARRANTY | |
31 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
32 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
33 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR | |
34 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
35 | * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
36 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
37 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
38 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | |
39 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING | |
40 | * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
41 | * POSSIBILITY OF SUCH DAMAGES. | |
42 | */ | |
43 | ||
1da177e4 LT |
44 | #include <acpi/acpi.h> |
45 | #include <acpi/acnamesp.h> | |
46 | ||
1da177e4 | 47 | #define _COMPONENT ACPI_NAMESPACE |
4be44fcd | 48 | ACPI_MODULE_NAME("nssearch") |
1da177e4 | 49 | |
44f6c012 | 50 | /* Local prototypes */ |
44f6c012 | 51 | static acpi_status |
4be44fcd LB |
52 | acpi_ns_search_parent_tree(u32 target_name, |
53 | struct acpi_namespace_node *node, | |
54 | acpi_object_type type, | |
55 | struct acpi_namespace_node **return_node); | |
1da177e4 LT |
56 | |
57 | /******************************************************************************* | |
58 | * | |
59 | * FUNCTION: acpi_ns_search_node | |
60 | * | |
44f6c012 RM |
61 | * PARAMETERS: target_name - Ascii ACPI name to search for |
62 | * Node - Starting node where search will begin | |
63 | * Type - Object type to match | |
64 | * return_node - Where the matched Named obj is returned | |
1da177e4 LT |
65 | * |
66 | * RETURN: Status | |
67 | * | |
68 | * DESCRIPTION: Search a single level of the namespace. Performs a | |
69 | * simple search of the specified level, and does not add | |
70 | * entries or search parents. | |
71 | * | |
72 | * | |
73 | * Named object lists are built (and subsequently dumped) in the | |
74 | * order in which the names are encountered during the namespace load; | |
75 | * | |
76 | * All namespace searching is linear in this implementation, but | |
77 | * could be easily modified to support any improved search | |
78 | * algorithm. However, the linear search was chosen for simplicity | |
79 | * and because the trees are small and the other interpreter | |
80 | * execution overhead is relatively high. | |
81 | * | |
82 | ******************************************************************************/ | |
83 | ||
84 | acpi_status | |
4be44fcd LB |
85 | acpi_ns_search_node(u32 target_name, |
86 | struct acpi_namespace_node *node, | |
87 | acpi_object_type type, | |
88 | struct acpi_namespace_node **return_node) | |
1da177e4 | 89 | { |
4be44fcd | 90 | struct acpi_namespace_node *next_node; |
1da177e4 | 91 | |
4be44fcd | 92 | ACPI_FUNCTION_TRACE("ns_search_node"); |
1da177e4 LT |
93 | |
94 | #ifdef ACPI_DEBUG_OUTPUT | |
95 | if (ACPI_LV_NAMES & acpi_dbg_level) { | |
4be44fcd | 96 | char *scope_name; |
1da177e4 | 97 | |
4be44fcd | 98 | scope_name = acpi_ns_get_external_pathname(node); |
1da177e4 | 99 | if (scope_name) { |
4be44fcd LB |
100 | ACPI_DEBUG_PRINT((ACPI_DB_NAMES, |
101 | "Searching %s (%p) For [%4.4s] (%s)\n", | |
defba1d8 BM |
102 | scope_name, node, ACPI_CAST_PTR(char, |
103 | &target_name), | |
4be44fcd | 104 | acpi_ut_get_type_name(type))); |
1da177e4 | 105 | |
8313524a | 106 | ACPI_FREE(scope_name); |
1da177e4 LT |
107 | } |
108 | } | |
109 | #endif | |
110 | ||
111 | /* | |
112 | * Search for name at this namespace level, which is to say that we | |
113 | * must search for the name among the children of this object | |
114 | */ | |
115 | next_node = node->child; | |
116 | while (next_node) { | |
52fc0b02 | 117 | |
1da177e4 LT |
118 | /* Check for match against the name */ |
119 | ||
120 | if (next_node->name.integer == target_name) { | |
52fc0b02 | 121 | |
1da177e4 LT |
122 | /* Resolve a control method alias if any */ |
123 | ||
4be44fcd LB |
124 | if (acpi_ns_get_type(next_node) == |
125 | ACPI_TYPE_LOCAL_METHOD_ALIAS) { | |
126 | next_node = | |
127 | ACPI_CAST_PTR(struct acpi_namespace_node, | |
128 | next_node->object); | |
1da177e4 LT |
129 | } |
130 | ||
131 | /* | |
132 | * Found matching entry. | |
133 | */ | |
4be44fcd LB |
134 | ACPI_DEBUG_PRINT((ACPI_DB_NAMES, |
135 | "Name [%4.4s] (%s) %p found in scope [%4.4s] %p\n", | |
defba1d8 | 136 | ACPI_CAST_PTR(char, &target_name), |
4be44fcd LB |
137 | acpi_ut_get_type_name(next_node-> |
138 | type), | |
139 | next_node, | |
140 | acpi_ut_get_node_name(node), node)); | |
1da177e4 LT |
141 | |
142 | *return_node = next_node; | |
4be44fcd | 143 | return_ACPI_STATUS(AE_OK); |
1da177e4 LT |
144 | } |
145 | ||
146 | /* | |
147 | * The last entry in the list points back to the parent, | |
148 | * so a flag is used to indicate the end-of-list | |
149 | */ | |
150 | if (next_node->flags & ANOBJ_END_OF_PEER_LIST) { | |
52fc0b02 | 151 | |
1da177e4 LT |
152 | /* Searched entire list, we are done */ |
153 | ||
154 | break; | |
155 | } | |
156 | ||
157 | /* Didn't match name, move on to the next peer object */ | |
158 | ||
159 | next_node = next_node->peer; | |
160 | } | |
161 | ||
162 | /* Searched entire namespace level, not found */ | |
163 | ||
4be44fcd LB |
164 | ACPI_DEBUG_PRINT((ACPI_DB_NAMES, |
165 | "Name [%4.4s] (%s) not found in search in scope [%4.4s] %p first child %p\n", | |
defba1d8 BM |
166 | ACPI_CAST_PTR(char, &target_name), |
167 | acpi_ut_get_type_name(type), | |
4be44fcd | 168 | acpi_ut_get_node_name(node), node, node->child)); |
1da177e4 | 169 | |
4be44fcd | 170 | return_ACPI_STATUS(AE_NOT_FOUND); |
1da177e4 LT |
171 | } |
172 | ||
1da177e4 LT |
173 | /******************************************************************************* |
174 | * | |
175 | * FUNCTION: acpi_ns_search_parent_tree | |
176 | * | |
44f6c012 RM |
177 | * PARAMETERS: target_name - Ascii ACPI name to search for |
178 | * Node - Starting node where search will begin | |
179 | * Type - Object type to match | |
180 | * return_node - Where the matched Node is returned | |
1da177e4 LT |
181 | * |
182 | * RETURN: Status | |
183 | * | |
184 | * DESCRIPTION: Called when a name has not been found in the current namespace | |
185 | * level. Before adding it or giving up, ACPI scope rules require | |
186 | * searching enclosing scopes in cases identified by acpi_ns_local(). | |
187 | * | |
188 | * "A name is located by finding the matching name in the current | |
189 | * name space, and then in the parent name space. If the parent | |
190 | * name space does not contain the name, the search continues | |
191 | * recursively until either the name is found or the name space | |
192 | * does not have a parent (the root of the name space). This | |
193 | * indicates that the name is not found" (From ACPI Specification, | |
194 | * section 5.3) | |
195 | * | |
196 | ******************************************************************************/ | |
197 | ||
198 | static acpi_status | |
4be44fcd LB |
199 | acpi_ns_search_parent_tree(u32 target_name, |
200 | struct acpi_namespace_node *node, | |
201 | acpi_object_type type, | |
202 | struct acpi_namespace_node **return_node) | |
1da177e4 | 203 | { |
4be44fcd LB |
204 | acpi_status status; |
205 | struct acpi_namespace_node *parent_node; | |
1da177e4 | 206 | |
4be44fcd | 207 | ACPI_FUNCTION_TRACE("ns_search_parent_tree"); |
1da177e4 | 208 | |
4be44fcd | 209 | parent_node = acpi_ns_get_parent_node(node); |
1da177e4 LT |
210 | |
211 | /* | |
212 | * If there is no parent (i.e., we are at the root) or type is "local", | |
213 | * we won't be searching the parent tree. | |
214 | */ | |
215 | if (!parent_node) { | |
4be44fcd | 216 | ACPI_DEBUG_PRINT((ACPI_DB_NAMES, "[%4.4s] has no parent\n", |
defba1d8 | 217 | ACPI_CAST_PTR(char, &target_name))); |
4be44fcd | 218 | return_ACPI_STATUS(AE_NOT_FOUND); |
1da177e4 LT |
219 | } |
220 | ||
4be44fcd LB |
221 | if (acpi_ns_local(type)) { |
222 | ACPI_DEBUG_PRINT((ACPI_DB_NAMES, | |
223 | "[%4.4s] type [%s] must be local to this scope (no parent search)\n", | |
defba1d8 | 224 | ACPI_CAST_PTR(char, &target_name), |
4be44fcd LB |
225 | acpi_ut_get_type_name(type))); |
226 | return_ACPI_STATUS(AE_NOT_FOUND); | |
1da177e4 LT |
227 | } |
228 | ||
229 | /* Search the parent tree */ | |
230 | ||
4be44fcd LB |
231 | ACPI_DEBUG_PRINT((ACPI_DB_NAMES, |
232 | "Searching parent [%4.4s] for [%4.4s]\n", | |
233 | acpi_ut_get_node_name(parent_node), | |
defba1d8 | 234 | ACPI_CAST_PTR(char, &target_name))); |
1da177e4 LT |
235 | |
236 | /* | |
237 | * Search parents until target is found or we have backed up to the root | |
238 | */ | |
239 | while (parent_node) { | |
240 | /* | |
241 | * Search parent scope. Use TYPE_ANY because we don't care about the | |
242 | * object type at this point, we only care about the existence of | |
243 | * the actual name we are searching for. Typechecking comes later. | |
244 | */ | |
4be44fcd LB |
245 | status = acpi_ns_search_node(target_name, parent_node, |
246 | ACPI_TYPE_ANY, return_node); | |
247 | if (ACPI_SUCCESS(status)) { | |
248 | return_ACPI_STATUS(status); | |
1da177e4 LT |
249 | } |
250 | ||
251 | /* | |
252 | * Not found here, go up another level | |
253 | * (until we reach the root) | |
254 | */ | |
4be44fcd | 255 | parent_node = acpi_ns_get_parent_node(parent_node); |
1da177e4 LT |
256 | } |
257 | ||
258 | /* Not found in parent tree */ | |
259 | ||
4be44fcd | 260 | return_ACPI_STATUS(AE_NOT_FOUND); |
1da177e4 LT |
261 | } |
262 | ||
1da177e4 LT |
263 | /******************************************************************************* |
264 | * | |
265 | * FUNCTION: acpi_ns_search_and_enter | |
266 | * | |
267 | * PARAMETERS: target_name - Ascii ACPI name to search for (4 chars) | |
268 | * walk_state - Current state of the walk | |
44f6c012 | 269 | * Node - Starting node where search will begin |
1da177e4 LT |
270 | * interpreter_mode - Add names only in ACPI_MODE_LOAD_PASS_x. |
271 | * Otherwise,search only. | |
272 | * Type - Object type to match | |
273 | * Flags - Flags describing the search restrictions | |
44f6c012 | 274 | * return_node - Where the Node is returned |
1da177e4 LT |
275 | * |
276 | * RETURN: Status | |
277 | * | |
278 | * DESCRIPTION: Search for a name segment in a single namespace level, | |
279 | * optionally adding it if it is not found. If the passed | |
280 | * Type is not Any and the type previously stored in the | |
281 | * entry was Any (i.e. unknown), update the stored type. | |
282 | * | |
283 | * In ACPI_IMODE_EXECUTE, search only. | |
284 | * In other modes, search and add if not found. | |
285 | * | |
286 | ******************************************************************************/ | |
287 | ||
288 | acpi_status | |
4be44fcd LB |
289 | acpi_ns_search_and_enter(u32 target_name, |
290 | struct acpi_walk_state *walk_state, | |
291 | struct acpi_namespace_node *node, | |
292 | acpi_interpreter_mode interpreter_mode, | |
293 | acpi_object_type type, | |
294 | u32 flags, struct acpi_namespace_node **return_node) | |
1da177e4 | 295 | { |
4be44fcd LB |
296 | acpi_status status; |
297 | struct acpi_namespace_node *new_node; | |
1da177e4 | 298 | |
4be44fcd | 299 | ACPI_FUNCTION_TRACE("ns_search_and_enter"); |
1da177e4 LT |
300 | |
301 | /* Parameter validation */ | |
302 | ||
303 | if (!node || !target_name || !return_node) { | |
b8e4d893 BM |
304 | ACPI_ERROR((AE_INFO, |
305 | "Null param: Node %p Name %X return_node %p", | |
306 | node, target_name, return_node)); | |
4be44fcd | 307 | return_ACPI_STATUS(AE_BAD_PARAMETER); |
1da177e4 LT |
308 | } |
309 | ||
310 | /* Name must consist of printable characters */ | |
311 | ||
4be44fcd | 312 | if (!acpi_ut_valid_acpi_name(target_name)) { |
b8e4d893 BM |
313 | ACPI_ERROR((AE_INFO, "Bad character in ACPI Name: %X", |
314 | target_name)); | |
4be44fcd | 315 | return_ACPI_STATUS(AE_BAD_CHARACTER); |
1da177e4 LT |
316 | } |
317 | ||
318 | /* Try to find the name in the namespace level specified by the caller */ | |
319 | ||
320 | *return_node = ACPI_ENTRY_NOT_FOUND; | |
4be44fcd | 321 | status = acpi_ns_search_node(target_name, node, type, return_node); |
1da177e4 LT |
322 | if (status != AE_NOT_FOUND) { |
323 | /* | |
324 | * If we found it AND the request specifies that a find is an error, | |
325 | * return the error | |
326 | */ | |
4be44fcd | 327 | if ((status == AE_OK) && (flags & ACPI_NS_ERROR_IF_FOUND)) { |
1da177e4 LT |
328 | status = AE_ALREADY_EXISTS; |
329 | } | |
330 | ||
331 | /* | |
332 | * Either found it or there was an error | |
333 | * -- finished either way | |
334 | */ | |
4be44fcd | 335 | return_ACPI_STATUS(status); |
1da177e4 LT |
336 | } |
337 | ||
338 | /* | |
339 | * The name was not found. If we are NOT performing the first pass | |
340 | * (name entry) of loading the namespace, search the parent tree (all the | |
341 | * way to the root if necessary.) We don't want to perform the parent | |
342 | * search when the namespace is actually being loaded. We want to perform | |
343 | * the search when namespace references are being resolved (load pass 2) | |
344 | * and during the execution phase. | |
345 | */ | |
346 | if ((interpreter_mode != ACPI_IMODE_LOAD_PASS1) && | |
4be44fcd | 347 | (flags & ACPI_NS_SEARCH_PARENT)) { |
1da177e4 LT |
348 | /* |
349 | * Not found at this level - search parent tree according to the | |
350 | * ACPI specification | |
351 | */ | |
4be44fcd LB |
352 | status = |
353 | acpi_ns_search_parent_tree(target_name, node, type, | |
354 | return_node); | |
355 | if (ACPI_SUCCESS(status)) { | |
356 | return_ACPI_STATUS(status); | |
1da177e4 LT |
357 | } |
358 | } | |
359 | ||
360 | /* | |
361 | * In execute mode, just search, never add names. Exit now. | |
362 | */ | |
363 | if (interpreter_mode == ACPI_IMODE_EXECUTE) { | |
4be44fcd LB |
364 | ACPI_DEBUG_PRINT((ACPI_DB_NAMES, |
365 | "%4.4s Not found in %p [Not adding]\n", | |
defba1d8 | 366 | ACPI_CAST_PTR(char, &target_name), node)); |
1da177e4 | 367 | |
4be44fcd | 368 | return_ACPI_STATUS(AE_NOT_FOUND); |
1da177e4 LT |
369 | } |
370 | ||
371 | /* Create the new named object */ | |
372 | ||
4be44fcd | 373 | new_node = acpi_ns_create_node(target_name); |
1da177e4 | 374 | if (!new_node) { |
4be44fcd | 375 | return_ACPI_STATUS(AE_NO_MEMORY); |
1da177e4 LT |
376 | } |
377 | ||
378 | /* Install the new object into the parent's list of children */ | |
379 | ||
4be44fcd | 380 | acpi_ns_install_node(walk_state, node, new_node, type); |
1da177e4 LT |
381 | *return_node = new_node; |
382 | ||
4be44fcd | 383 | return_ACPI_STATUS(AE_OK); |
1da177e4 | 384 | } |