diff options
author | Linus Torvalds <torvalds@woody.linux-foundation.org> | 2007-02-07 18:36:08 -0500 |
---|---|---|
committer | Linus Torvalds <torvalds@woody.linux-foundation.org> | 2007-02-07 18:36:08 -0500 |
commit | 21d37bbc65e39a26856de6b14be371ff24e0d03f (patch) | |
tree | a04bb72e191cae13f47462c57bb1641c42b7b52b /drivers/acpi/namespace/nswalk.c | |
parent | bff288c19e8b6217ddd660d4fa42c29a0ab1d58c (diff) | |
parent | 57e1c5c87db512629dd44ddeb882a5aaf0e4299e (diff) |
Merge branch 'release' of git://git.kernel.org/pub/scm/linux/kernel/git/lenb/linux-acpi-2.6
* 'release' of git://git.kernel.org/pub/scm/linux/kernel/git/lenb/linux-acpi-2.6: (140 commits)
ACPICA: reduce table header messages to fit within 80 columns
asus-laptop: merge with ACPICA table update
ACPI: bay: Convert ACPI Bay driver to be compatible with sysfs update.
ACPI: bay: new driver is EXPERIMENTAL
ACPI: bay: make drive_bays static
ACPI: bay: make bay a platform driver
ACPI: bay: remove prototype procfs code
ACPI: bay: delete unused variable
ACPI: bay: new driver adding removable drive bay support
ACPI: dock: check if parent is on dock
ACPICA: fix gcc build warnings
Altix: Add ACPI SSDT PCI device support (hotplug)
Altix: ACPI SSDT PCI device support
ACPICA: reduce conflicts with Altix patch series
ACPI_NUMA: fix HP IA64 simulator issue with extended memory domain
ACPI: fix HP RX2600 IA64 boot
ACPI: build fix for IBM x440 - CONFIG_X86_SUMMIT
ACPICA: Update version to 20070126
ACPICA: Fix for incorrect parameter passed to AcpiTbDeleteTable during table load.
ACPICA: Update copyright to 2007.
...
Diffstat (limited to 'drivers/acpi/namespace/nswalk.c')
-rw-r--r-- | drivers/acpi/namespace/nswalk.c | 65 |
1 files changed, 38 insertions, 27 deletions
diff --git a/drivers/acpi/namespace/nswalk.c b/drivers/acpi/namespace/nswalk.c index c8f6bef16ed0..94eb8f332d94 100644 --- a/drivers/acpi/namespace/nswalk.c +++ b/drivers/acpi/namespace/nswalk.c | |||
@@ -5,7 +5,7 @@ | |||
5 | *****************************************************************************/ | 5 | *****************************************************************************/ |
6 | 6 | ||
7 | /* | 7 | /* |
8 | * Copyright (C) 2000 - 2006, R. Byron Moore | 8 | * Copyright (C) 2000 - 2007, R. Byron Moore |
9 | * All rights reserved. | 9 | * All rights reserved. |
10 | * | 10 | * |
11 | * Redistribution and use in source and binary forms, with or without | 11 | * Redistribution and use in source and binary forms, with or without |
@@ -126,7 +126,7 @@ struct acpi_namespace_node *acpi_ns_get_next_node(acpi_object_type type, | |||
126 | * PARAMETERS: Type - acpi_object_type to search for | 126 | * PARAMETERS: Type - acpi_object_type to search for |
127 | * start_node - Handle in namespace where search begins | 127 | * start_node - Handle in namespace where search begins |
128 | * max_depth - Depth to which search is to reach | 128 | * max_depth - Depth to which search is to reach |
129 | * unlock_before_callback- Whether to unlock the NS before invoking | 129 | * Flags - Whether to unlock the NS before invoking |
130 | * the callback routine | 130 | * the callback routine |
131 | * user_function - Called when an object of "Type" is found | 131 | * user_function - Called when an object of "Type" is found |
132 | * Context - Passed to user function | 132 | * Context - Passed to user function |
@@ -153,7 +153,7 @@ acpi_status | |||
153 | acpi_ns_walk_namespace(acpi_object_type type, | 153 | acpi_ns_walk_namespace(acpi_object_type type, |
154 | acpi_handle start_node, | 154 | acpi_handle start_node, |
155 | u32 max_depth, | 155 | u32 max_depth, |
156 | u8 unlock_before_callback, | 156 | u32 flags, |
157 | acpi_walk_callback user_function, | 157 | acpi_walk_callback user_function, |
158 | void *context, void **return_value) | 158 | void *context, void **return_value) |
159 | { | 159 | { |
@@ -193,20 +193,34 @@ acpi_ns_walk_namespace(acpi_object_type type, | |||
193 | acpi_ns_get_next_node(ACPI_TYPE_ANY, parent_node, | 193 | acpi_ns_get_next_node(ACPI_TYPE_ANY, parent_node, |
194 | child_node); | 194 | child_node); |
195 | if (child_node) { | 195 | if (child_node) { |
196 | /* | 196 | |
197 | * Found node, Get the type if we are not | 197 | /* Found next child, get the type if we are not searching for ANY */ |
198 | * searching for ANY | 198 | |
199 | */ | ||
200 | if (type != ACPI_TYPE_ANY) { | 199 | if (type != ACPI_TYPE_ANY) { |
201 | child_type = child_node->type; | 200 | child_type = child_node->type; |
202 | } | 201 | } |
203 | 202 | ||
204 | if (child_type == type) { | 203 | /* |
204 | * Ignore all temporary namespace nodes (created during control | ||
205 | * method execution) unless told otherwise. These temporary nodes | ||
206 | * can cause a race condition because they can be deleted during the | ||
207 | * execution of the user function (if the namespace is unlocked before | ||
208 | * invocation of the user function.) Only the debugger namespace dump | ||
209 | * will examine the temporary nodes. | ||
210 | */ | ||
211 | if ((child_node->flags & ANOBJ_TEMPORARY) && | ||
212 | !(flags & ACPI_NS_WALK_TEMP_NODES)) { | ||
213 | status = AE_CTRL_DEPTH; | ||
214 | } | ||
215 | |||
216 | /* Type must match requested type */ | ||
217 | |||
218 | else if (child_type == type) { | ||
205 | /* | 219 | /* |
206 | * Found a matching node, invoke the user | 220 | * Found a matching node, invoke the user callback function. |
207 | * callback function | 221 | * Unlock the namespace if flag is set. |
208 | */ | 222 | */ |
209 | if (unlock_before_callback) { | 223 | if (flags & ACPI_NS_WALK_UNLOCK) { |
210 | mutex_status = | 224 | mutex_status = |
211 | acpi_ut_release_mutex | 225 | acpi_ut_release_mutex |
212 | (ACPI_MTX_NAMESPACE); | 226 | (ACPI_MTX_NAMESPACE); |
@@ -216,10 +230,11 @@ acpi_ns_walk_namespace(acpi_object_type type, | |||
216 | } | 230 | } |
217 | } | 231 | } |
218 | 232 | ||
219 | status = user_function(child_node, level, | 233 | status = |
220 | context, return_value); | 234 | user_function(child_node, level, context, |
235 | return_value); | ||
221 | 236 | ||
222 | if (unlock_before_callback) { | 237 | if (flags & ACPI_NS_WALK_UNLOCK) { |
223 | mutex_status = | 238 | mutex_status = |
224 | acpi_ut_acquire_mutex | 239 | acpi_ut_acquire_mutex |
225 | (ACPI_MTX_NAMESPACE); | 240 | (ACPI_MTX_NAMESPACE); |
@@ -251,20 +266,17 @@ acpi_ns_walk_namespace(acpi_object_type type, | |||
251 | } | 266 | } |
252 | 267 | ||
253 | /* | 268 | /* |
254 | * Depth first search: | 269 | * Depth first search: Attempt to go down another level in the |
255 | * Attempt to go down another level in the namespace | 270 | * namespace if we are allowed to. Don't go any further if we have |
256 | * if we are allowed to. Don't go any further if we | 271 | * reached the caller specified maximum depth or if the user |
257 | * have reached the caller specified maximum depth | 272 | * function has specified that the maximum depth has been reached. |
258 | * or if the user function has specified that the | ||
259 | * maximum depth has been reached. | ||
260 | */ | 273 | */ |
261 | if ((level < max_depth) && (status != AE_CTRL_DEPTH)) { | 274 | if ((level < max_depth) && (status != AE_CTRL_DEPTH)) { |
262 | if (acpi_ns_get_next_node | 275 | if (acpi_ns_get_next_node |
263 | (ACPI_TYPE_ANY, child_node, NULL)) { | 276 | (ACPI_TYPE_ANY, child_node, NULL)) { |
264 | /* | 277 | |
265 | * There is at least one child of this | 278 | /* There is at least one child of this node, visit it */ |
266 | * node, visit the onde | 279 | |
267 | */ | ||
268 | level++; | 280 | level++; |
269 | parent_node = child_node; | 281 | parent_node = child_node; |
270 | child_node = NULL; | 282 | child_node = NULL; |
@@ -272,9 +284,8 @@ acpi_ns_walk_namespace(acpi_object_type type, | |||
272 | } | 284 | } |
273 | } else { | 285 | } else { |
274 | /* | 286 | /* |
275 | * No more children of this node (acpi_ns_get_next_node | 287 | * No more children of this node (acpi_ns_get_next_node failed), go |
276 | * failed), go back upwards in the namespace tree to | 288 | * back upwards in the namespace tree to the node's parent. |
277 | * the node's parent. | ||
278 | */ | 289 | */ |
279 | level--; | 290 | level--; |
280 | child_node = parent_node; | 291 | child_node = parent_node; |