blob: 15143c44f5e5f3385b9cbecd8a97d61db1024e4e [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*******************************************************************************
2 *
3 * Module Name: nsalloc - Namespace allocation and deletion utilities
4 *
5 ******************************************************************************/
6
7/*
Bob Moore77848132012-01-12 13:27:23 +08008 * Copyright (C) 2000 - 2012, Intel Corp.
Linus Torvalds1da177e2005-04-16 15:20:36 -07009 * 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
Linus Torvalds1da177e2005-04-16 15:20:36 -070044#include <acpi/acpi.h>
Len Browne2f7a772009-01-09 00:30:03 -050045#include "accommon.h"
46#include "acnamesp.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070047
Linus Torvalds1da177e2005-04-16 15:20:36 -070048#define _COMPONENT ACPI_NAMESPACE
Len Brown4be44fc2005-08-05 00:44:28 -040049ACPI_MODULE_NAME("nsalloc")
Linus Torvalds1da177e2005-04-16 15:20:36 -070050
Linus Torvalds1da177e2005-04-16 15:20:36 -070051/*******************************************************************************
52 *
53 * FUNCTION: acpi_ns_create_node
54 *
Bob Mooreba494be2012-07-12 09:40:10 +080055 * PARAMETERS: name - Name of the new node (4 char ACPI name)
Linus Torvalds1da177e2005-04-16 15:20:36 -070056 *
Robert Moore44f6c012005-04-18 22:49:35 -040057 * RETURN: New namespace node (Null on failure)
Linus Torvalds1da177e2005-04-16 15:20:36 -070058 *
59 * DESCRIPTION: Create a namespace node
60 *
61 ******************************************************************************/
Len Brown4be44fc2005-08-05 00:44:28 -040062struct acpi_namespace_node *acpi_ns_create_node(u32 name)
Linus Torvalds1da177e2005-04-16 15:20:36 -070063{
Len Brown4be44fc2005-08-05 00:44:28 -040064 struct acpi_namespace_node *node;
Valery A. Podrezovafbb9e62007-02-02 19:48:23 +030065#ifdef ACPI_DBG_TRACK_ALLOCATIONS
66 u32 temp;
67#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070068
Bob Mooreb229cf92006-04-21 17:15:00 -040069 ACPI_FUNCTION_TRACE(ns_create_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -070070
Bob Moore616861242006-03-17 16:44:00 -050071 node = acpi_os_acquire_object(acpi_gbl_namespace_cache);
Linus Torvalds1da177e2005-04-16 15:20:36 -070072 if (!node) {
Len Brown4be44fc2005-08-05 00:44:28 -040073 return_PTR(NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -070074 }
75
Len Brown4be44fc2005-08-05 00:44:28 -040076 ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_allocated++);
Linus Torvalds1da177e2005-04-16 15:20:36 -070077
Valery A. Podrezovafbb9e62007-02-02 19:48:23 +030078#ifdef ACPI_DBG_TRACK_ALLOCATIONS
Bob Moored4913dc2009-03-06 10:05:18 +080079 temp = acpi_gbl_ns_node_list->total_allocated -
Valery A. Podrezovafbb9e62007-02-02 19:48:23 +030080 acpi_gbl_ns_node_list->total_freed;
81 if (temp > acpi_gbl_ns_node_list->max_occupied) {
82 acpi_gbl_ns_node_list->max_occupied = temp;
83 }
84#endif
85
Len Brown4be44fc2005-08-05 00:44:28 -040086 node->name.integer = name;
Len Brown4be44fc2005-08-05 00:44:28 -040087 ACPI_SET_DESCRIPTOR_TYPE(node, ACPI_DESC_TYPE_NAMED);
Len Brown4be44fc2005-08-05 00:44:28 -040088 return_PTR(node);
Linus Torvalds1da177e2005-04-16 15:20:36 -070089}
90
Linus Torvalds1da177e2005-04-16 15:20:36 -070091/*******************************************************************************
92 *
93 * FUNCTION: acpi_ns_delete_node
94 *
Bob Mooreba494be2012-07-12 09:40:10 +080095 * PARAMETERS: node - Node to be deleted
Linus Torvalds1da177e2005-04-16 15:20:36 -070096 *
97 * RETURN: None
98 *
Bob Moore8e4319c2009-06-29 13:43:27 +080099 * DESCRIPTION: Delete a namespace node. All node deletions must come through
100 * here. Detaches any attached objects, including any attached
101 * data. If a handler is associated with attached data, it is
102 * invoked before the node is deleted.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 *
104 ******************************************************************************/
105
Len Brown4be44fc2005-08-05 00:44:28 -0400106void acpi_ns_delete_node(struct acpi_namespace_node *node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107{
Bob Moore8e4319c2009-06-29 13:43:27 +0800108 union acpi_operand_object *obj_desc;
109
110 ACPI_FUNCTION_NAME(ns_delete_node);
111
112 /* Detach an object if there is one */
113
114 acpi_ns_detach_object(node);
115
116 /*
117 * Delete an attached data object if present (an object that was created
118 * and attached via acpi_attach_data). Note: After any normal object is
119 * detached above, the only possible remaining object is a data object.
120 */
121 obj_desc = node->object;
122 if (obj_desc && (obj_desc->common.type == ACPI_TYPE_LOCAL_DATA)) {
123
124 /* Invoke the attached data deletion handler if present */
125
126 if (obj_desc->data.handler) {
127 obj_desc->data.handler(node, obj_desc->data.pointer);
128 }
129
130 acpi_ut_remove_reference(obj_desc);
131 }
132
133 /* Now we can delete the node */
134
135 (void)acpi_os_release_object(acpi_gbl_namespace_cache, node);
136
137 ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_freed++);
138 ACPI_DEBUG_PRINT((ACPI_DB_ALLOCATIONS, "Node %p, Remaining %X\n",
139 node, acpi_gbl_current_node_count));
140}
141
142/*******************************************************************************
143 *
144 * FUNCTION: acpi_ns_remove_node
145 *
Bob Mooreba494be2012-07-12 09:40:10 +0800146 * PARAMETERS: node - Node to be removed/deleted
Bob Moore8e4319c2009-06-29 13:43:27 +0800147 *
148 * RETURN: None
149 *
150 * DESCRIPTION: Remove (unlink) and delete a namespace node
151 *
152 ******************************************************************************/
153
154void acpi_ns_remove_node(struct acpi_namespace_node *node)
155{
Len Brown4be44fc2005-08-05 00:44:28 -0400156 struct acpi_namespace_node *parent_node;
157 struct acpi_namespace_node *prev_node;
158 struct acpi_namespace_node *next_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159
Bob Moore8e4319c2009-06-29 13:43:27 +0800160 ACPI_FUNCTION_TRACE_PTR(ns_remove_node, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700161
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800162 parent_node = node->parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700163
164 prev_node = NULL;
165 next_node = parent_node->child;
166
167 /* Find the node that is the previous peer in the parent's child list */
168
169 while (next_node != node) {
170 prev_node = next_node;
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800171 next_node = next_node->peer;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 }
173
174 if (prev_node) {
Bob Moore52fc0b02006-10-02 00:00:00 -0400175
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176 /* Node is not first child, unlink it */
177
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800178 prev_node->peer = node->peer;
Len Brown4be44fc2005-08-05 00:44:28 -0400179 } else {
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800180 /*
181 * Node is first child (has no previous peer).
182 * Link peer list to parent
183 */
184 parent_node->child = node->peer;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700185 }
186
Bob Moore8e4319c2009-06-29 13:43:27 +0800187 /* Delete the node and any attached objects */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188
Bob Moore8e4319c2009-06-29 13:43:27 +0800189 acpi_ns_delete_node(node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190 return_VOID;
191}
192
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193/*******************************************************************************
194 *
195 * FUNCTION: acpi_ns_install_node
196 *
197 * PARAMETERS: walk_state - Current state of the walk
198 * parent_node - The parent of the new Node
Bob Mooreba494be2012-07-12 09:40:10 +0800199 * node - The new Node to install
200 * type - ACPI object type of the new Node
Linus Torvalds1da177e2005-04-16 15:20:36 -0700201 *
202 * RETURN: None
203 *
204 * DESCRIPTION: Initialize a new namespace node and install it amongst
205 * its peers.
206 *
Robert Moore0c9938c2005-07-29 15:15:00 -0700207 * Note: Current namespace lookup is linear search. This appears
208 * to be sufficient as namespace searches consume only a small
209 * fraction of the execution time of the ACPI subsystem.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210 *
211 ******************************************************************************/
212
Len Brown4be44fc2005-08-05 00:44:28 -0400213void acpi_ns_install_node(struct acpi_walk_state *walk_state, struct acpi_namespace_node *parent_node, /* Parent */
214 struct acpi_namespace_node *node, /* New Child */
215 acpi_object_type type)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216{
Len Brown4be44fc2005-08-05 00:44:28 -0400217 acpi_owner_id owner_id = 0;
218 struct acpi_namespace_node *child_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700219
Bob Mooreb229cf92006-04-21 17:15:00 -0400220 ACPI_FUNCTION_TRACE(ns_install_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700221
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222 if (walk_state) {
Alexey Starikovskiya9fc0312010-05-26 13:59:51 +0800223 /*
224 * Get the owner ID from the Walk state. The owner ID is used to
225 * track table deletion and deletion of objects created by methods.
226 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700227 owner_id = walk_state->owner_id;
Alexey Starikovskiya9fc0312010-05-26 13:59:51 +0800228
229 if ((walk_state->method_desc) &&
230 (parent_node != walk_state->method_node)) {
231 /*
232 * A method is creating a new node that is not a child of the
233 * method (it is non-local). Mark the executing method as having
234 * modified the namespace. This is used for cleanup when the
235 * method exits.
236 */
Lin Ming26294842011-01-12 09:19:43 +0800237 walk_state->method_desc->method.info_flags |=
238 ACPI_METHOD_MODIFIED_NAMESPACE;
Alexey Starikovskiya9fc0312010-05-26 13:59:51 +0800239 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700240 }
241
242 /* Link the new entry into the parent and existing children */
243
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800244 node->peer = NULL;
245 node->parent = parent_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246 child_node = parent_node->child;
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800247
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248 if (!child_node) {
249 parent_node->child = node;
Len Brown4be44fc2005-08-05 00:44:28 -0400250 } else {
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800251 /* Add node to the end of the peer list */
252
253 while (child_node->peer) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254 child_node = child_node->peer;
255 }
256
257 child_node->peer = node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258 }
259
260 /* Init the new entry */
261
262 node->owner_id = owner_id;
263 node->type = (u8) type;
264
Len Brown4be44fc2005-08-05 00:44:28 -0400265 ACPI_DEBUG_PRINT((ACPI_DB_NAMES,
266 "%4.4s (%s) [Node %p Owner %X] added to %4.4s (%s) [Node %p]\n",
267 acpi_ut_get_node_name(node),
268 acpi_ut_get_type_name(node->type), node, owner_id,
269 acpi_ut_get_node_name(parent_node),
270 acpi_ut_get_type_name(parent_node->type),
271 parent_node));
Bob Moore793c2382006-03-31 00:00:00 -0500272
273 return_VOID;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274}
275
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276/*******************************************************************************
277 *
278 * FUNCTION: acpi_ns_delete_children
279 *
280 * PARAMETERS: parent_node - Delete this objects children
281 *
282 * RETURN: None.
283 *
284 * DESCRIPTION: Delete all children of the parent object. In other words,
285 * deletes a "scope".
286 *
287 ******************************************************************************/
288
Len Brown4be44fc2005-08-05 00:44:28 -0400289void acpi_ns_delete_children(struct acpi_namespace_node *parent_node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290{
Len Brown4be44fc2005-08-05 00:44:28 -0400291 struct acpi_namespace_node *next_node;
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800292 struct acpi_namespace_node *node_to_delete;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293
Bob Mooreb229cf92006-04-21 17:15:00 -0400294 ACPI_FUNCTION_TRACE_PTR(ns_delete_children, parent_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700295
296 if (!parent_node) {
297 return_VOID;
298 }
299
Bob Moored4913dc2009-03-06 10:05:18 +0800300 /* Deallocate all children at this level */
301
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800302 next_node = parent_node->child;
303 while (next_node) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304
305 /* Grandchildren should have all been deleted already */
306
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800307 if (next_node->child) {
Bob Mooreb8e4d892006-01-27 16:43:00 -0500308 ACPI_ERROR((AE_INFO, "Found a grandchild! P=%p C=%p",
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800309 parent_node, next_node));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310 }
311
Bob Moore8e4319c2009-06-29 13:43:27 +0800312 /*
313 * Delete this child node and move on to the next child in the list.
314 * No need to unlink the node since we are deleting the entire branch.
315 */
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800316 node_to_delete = next_node;
317 next_node = next_node->peer;
318 acpi_ns_delete_node(node_to_delete);
319 };
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321 /* Clear the parent's child pointer */
322
323 parent_node->child = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324 return_VOID;
325}
326
Linus Torvalds1da177e2005-04-16 15:20:36 -0700327/*******************************************************************************
328 *
329 * FUNCTION: acpi_ns_delete_namespace_subtree
330 *
331 * PARAMETERS: parent_node - Root of the subtree to be deleted
332 *
333 * RETURN: None.
334 *
Bob Moore73a30902012-10-31 02:26:55 +0000335 * DESCRIPTION: Delete a subtree of the namespace. This includes all objects
Linus Torvalds1da177e2005-04-16 15:20:36 -0700336 * stored within the subtree.
337 *
338 ******************************************************************************/
339
Len Brown4be44fc2005-08-05 00:44:28 -0400340void acpi_ns_delete_namespace_subtree(struct acpi_namespace_node *parent_node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341{
Len Brown4be44fc2005-08-05 00:44:28 -0400342 struct acpi_namespace_node *child_node = NULL;
343 u32 level = 1;
Dana Myers5d3131f2011-01-12 09:09:31 +0800344 acpi_status status;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345
Bob Mooreb229cf92006-04-21 17:15:00 -0400346 ACPI_FUNCTION_TRACE(ns_delete_namespace_subtree);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700347
348 if (!parent_node) {
349 return_VOID;
350 }
351
Dana Myers5d3131f2011-01-12 09:09:31 +0800352 /* Lock namespace for possible update */
353
354 status = acpi_ut_acquire_mutex(ACPI_MTX_NAMESPACE);
355 if (ACPI_FAILURE(status)) {
356 return_VOID;
357 }
358
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359 /*
360 * Traverse the tree of objects until we bubble back up
361 * to where we started.
362 */
363 while (level > 0) {
Bob Moore52fc0b02006-10-02 00:00:00 -0400364
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365 /* Get the next node in this scope (NULL if none) */
366
Bob Moore8c725bf2009-05-21 10:27:51 +0800367 child_node = acpi_ns_get_next_node(parent_node, child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700368 if (child_node) {
Bob Moore52fc0b02006-10-02 00:00:00 -0400369
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370 /* Found a child node - detach any attached object */
371
Len Brown4be44fc2005-08-05 00:44:28 -0400372 acpi_ns_detach_object(child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700373
374 /* Check if this node has any children */
375
Bob Moore8c725bf2009-05-21 10:27:51 +0800376 if (child_node->child) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700377 /*
378 * There is at least one child of this node,
379 * visit the node
380 */
381 level++;
382 parent_node = child_node;
383 child_node = NULL;
384 }
Len Brown4be44fc2005-08-05 00:44:28 -0400385 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386 /*
387 * No more children of this parent node.
388 * Move up to the grandparent.
389 */
390 level--;
391
392 /*
393 * Now delete all of the children of this parent
394 * all at the same time.
395 */
Len Brown4be44fc2005-08-05 00:44:28 -0400396 acpi_ns_delete_children(parent_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700397
398 /* New "last child" is this parent node */
399
400 child_node = parent_node;
401
402 /* Move up the tree to the grandparent */
403
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800404 parent_node = parent_node->parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405 }
406 }
407
Dana Myers5d3131f2011-01-12 09:09:31 +0800408 (void)acpi_ut_release_mutex(ACPI_MTX_NAMESPACE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409 return_VOID;
410}
411
Linus Torvalds1da177e2005-04-16 15:20:36 -0700412/*******************************************************************************
413 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414 * FUNCTION: acpi_ns_delete_namespace_by_owner
415 *
416 * PARAMETERS: owner_id - All nodes with this owner will be deleted
417 *
418 * RETURN: Status
419 *
420 * DESCRIPTION: Delete entries within the namespace that are owned by a
Bob Moore73a30902012-10-31 02:26:55 +0000421 * specific ID. Used to delete entire ACPI tables. All
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422 * reference counts are updated.
423 *
Bob Mooref6dd9222006-07-07 20:44:38 -0400424 * MUTEX: Locks namespace during deletion walk.
425 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426 ******************************************************************************/
427
Len Brown4be44fc2005-08-05 00:44:28 -0400428void acpi_ns_delete_namespace_by_owner(acpi_owner_id owner_id)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429{
Len Brown4be44fc2005-08-05 00:44:28 -0400430 struct acpi_namespace_node *child_node;
431 struct acpi_namespace_node *deletion_node;
Len Brown4be44fc2005-08-05 00:44:28 -0400432 struct acpi_namespace_node *parent_node;
Bob Mooref6dd9222006-07-07 20:44:38 -0400433 u32 level;
434 acpi_status status;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435
Bob Mooreb229cf92006-04-21 17:15:00 -0400436 ACPI_FUNCTION_TRACE_U32(ns_delete_namespace_by_owner, owner_id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437
Robert Moore0c9938c2005-07-29 15:15:00 -0700438 if (owner_id == 0) {
439 return_VOID;
440 }
441
Bob Mooref6dd9222006-07-07 20:44:38 -0400442 /* Lock namespace for possible update */
443
444 status = acpi_ut_acquire_mutex(ACPI_MTX_NAMESPACE);
445 if (ACPI_FAILURE(status)) {
446 return_VOID;
447 }
448
Bob Moore616861242006-03-17 16:44:00 -0500449 deletion_node = NULL;
Len Brown4be44fc2005-08-05 00:44:28 -0400450 parent_node = acpi_gbl_root_node;
451 child_node = NULL;
Len Brown4be44fc2005-08-05 00:44:28 -0400452 level = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700453
454 /*
455 * Traverse the tree of nodes until we bubble back up
456 * to where we started.
457 */
458 while (level > 0) {
459 /*
460 * Get the next child of this parent node. When child_node is NULL,
461 * the first child of the parent is returned
462 */
Bob Moore8c725bf2009-05-21 10:27:51 +0800463 child_node = acpi_ns_get_next_node(parent_node, child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464
465 if (deletion_node) {
Bob Moore616861242006-03-17 16:44:00 -0500466 acpi_ns_delete_children(deletion_node);
Bob Moore8e4319c2009-06-29 13:43:27 +0800467 acpi_ns_remove_node(deletion_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468 deletion_node = NULL;
469 }
470
471 if (child_node) {
472 if (child_node->owner_id == owner_id) {
Bob Moore52fc0b02006-10-02 00:00:00 -0400473
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474 /* Found a matching child node - detach any attached object */
475
Len Brown4be44fc2005-08-05 00:44:28 -0400476 acpi_ns_detach_object(child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477 }
478
479 /* Check if this node has any children */
480
Bob Moore8c725bf2009-05-21 10:27:51 +0800481 if (child_node->child) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700482 /*
483 * There is at least one child of this node,
484 * visit the node
485 */
486 level++;
487 parent_node = child_node;
488 child_node = NULL;
Len Brown4be44fc2005-08-05 00:44:28 -0400489 } else if (child_node->owner_id == owner_id) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700490 deletion_node = child_node;
491 }
Len Brown4be44fc2005-08-05 00:44:28 -0400492 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493 /*
494 * No more children of this parent node.
495 * Move up to the grandparent.
496 */
497 level--;
498 if (level != 0) {
499 if (parent_node->owner_id == owner_id) {
500 deletion_node = parent_node;
501 }
502 }
503
504 /* New "last child" is this parent node */
505
506 child_node = parent_node;
507
508 /* Move up the tree to the grandparent */
509
Alexey Starikovskiyc45b5c02010-05-26 11:53:07 +0800510 parent_node = parent_node->parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511 }
512 }
513
Bob Mooref6dd9222006-07-07 20:44:38 -0400514 (void)acpi_ut_release_mutex(ACPI_MTX_NAMESPACE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515 return_VOID;
516}