blob: f976d848fe8241c0845ad4063d8a86c554aaefec [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/*
Len Brown75a44ce2008-04-23 23:00:13 -04008 * Copyright (C) 2000 - 2008, 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 *
Robert Moore44f6c012005-04-18 22:49:35 -040055 * 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
79 temp =
80 acpi_gbl_ns_node_list->total_allocated -
81 acpi_gbl_ns_node_list->total_freed;
82 if (temp > acpi_gbl_ns_node_list->max_occupied) {
83 acpi_gbl_ns_node_list->max_occupied = temp;
84 }
85#endif
86
Len Brown4be44fc2005-08-05 00:44:28 -040087 node->name.integer = name;
Len Brown4be44fc2005-08-05 00:44:28 -040088 ACPI_SET_DESCRIPTOR_TYPE(node, ACPI_DESC_TYPE_NAMED);
Len Brown4be44fc2005-08-05 00:44:28 -040089 return_PTR(node);
Linus Torvalds1da177e2005-04-16 15:20:36 -070090}
91
Linus Torvalds1da177e2005-04-16 15:20:36 -070092/*******************************************************************************
93 *
94 * FUNCTION: acpi_ns_delete_node
95 *
96 * PARAMETERS: Node - Node to be deleted
97 *
98 * RETURN: None
99 *
100 * DESCRIPTION: Delete a namespace node
101 *
102 ******************************************************************************/
103
Len Brown4be44fc2005-08-05 00:44:28 -0400104void acpi_ns_delete_node(struct acpi_namespace_node *node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105{
Len Brown4be44fc2005-08-05 00:44:28 -0400106 struct acpi_namespace_node *parent_node;
107 struct acpi_namespace_node *prev_node;
108 struct acpi_namespace_node *next_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109
Bob Mooreb229cf92006-04-21 17:15:00 -0400110 ACPI_FUNCTION_TRACE_PTR(ns_delete_node, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700111
Len Brown4be44fc2005-08-05 00:44:28 -0400112 parent_node = acpi_ns_get_parent_node(node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113
114 prev_node = NULL;
115 next_node = parent_node->child;
116
117 /* Find the node that is the previous peer in the parent's child list */
118
119 while (next_node != node) {
120 prev_node = next_node;
121 next_node = prev_node->peer;
122 }
123
124 if (prev_node) {
Bob Moore52fc0b02006-10-02 00:00:00 -0400125
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126 /* Node is not first child, unlink it */
127
128 prev_node->peer = next_node->peer;
129 if (next_node->flags & ANOBJ_END_OF_PEER_LIST) {
130 prev_node->flags |= ANOBJ_END_OF_PEER_LIST;
131 }
Len Brown4be44fc2005-08-05 00:44:28 -0400132 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 /* Node is first child (has no previous peer) */
134
135 if (next_node->flags & ANOBJ_END_OF_PEER_LIST) {
Bob Moore52fc0b02006-10-02 00:00:00 -0400136
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137 /* No peers at all */
138
139 parent_node->child = NULL;
Len Brown4be44fc2005-08-05 00:44:28 -0400140 } else { /* Link peer list to parent */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141
142 parent_node->child = next_node->peer;
143 }
144 }
145
Len Brown4be44fc2005-08-05 00:44:28 -0400146 ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_freed++);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147
148 /*
Bob Moore616861242006-03-17 16:44:00 -0500149 * Detach an object if there is one, then delete the node
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150 */
Len Brown4be44fc2005-08-05 00:44:28 -0400151 acpi_ns_detach_object(node);
Bob Moore616861242006-03-17 16:44:00 -0500152 (void)acpi_os_release_object(acpi_gbl_namespace_cache, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153 return_VOID;
154}
155
Linus Torvalds1da177e2005-04-16 15:20:36 -0700156/*******************************************************************************
157 *
158 * FUNCTION: acpi_ns_install_node
159 *
160 * PARAMETERS: walk_state - Current state of the walk
161 * parent_node - The parent of the new Node
162 * Node - The new Node to install
163 * Type - ACPI object type of the new Node
164 *
165 * RETURN: None
166 *
167 * DESCRIPTION: Initialize a new namespace node and install it amongst
168 * its peers.
169 *
Robert Moore0c9938c2005-07-29 15:15:00 -0700170 * Note: Current namespace lookup is linear search. This appears
171 * to be sufficient as namespace searches consume only a small
172 * fraction of the execution time of the ACPI subsystem.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173 *
174 ******************************************************************************/
175
Len Brown4be44fc2005-08-05 00:44:28 -0400176void acpi_ns_install_node(struct acpi_walk_state *walk_state, struct acpi_namespace_node *parent_node, /* Parent */
177 struct acpi_namespace_node *node, /* New Child */
178 acpi_object_type type)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179{
Len Brown4be44fc2005-08-05 00:44:28 -0400180 acpi_owner_id owner_id = 0;
181 struct acpi_namespace_node *child_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182
Bob Mooreb229cf92006-04-21 17:15:00 -0400183 ACPI_FUNCTION_TRACE(ns_install_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184
185 /*
186 * Get the owner ID from the Walk state
187 * The owner ID is used to track table deletion and
188 * deletion of objects created by methods
189 */
190 if (walk_state) {
191 owner_id = walk_state->owner_id;
192 }
193
194 /* Link the new entry into the parent and existing children */
195
196 child_node = parent_node->child;
197 if (!child_node) {
198 parent_node->child = node;
199 node->flags |= ANOBJ_END_OF_PEER_LIST;
200 node->peer = parent_node;
Len Brown4be44fc2005-08-05 00:44:28 -0400201 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202 while (!(child_node->flags & ANOBJ_END_OF_PEER_LIST)) {
203 child_node = child_node->peer;
204 }
205
206 child_node->peer = node;
207
208 /* Clear end-of-list flag */
209
210 child_node->flags &= ~ANOBJ_END_OF_PEER_LIST;
Robert Moore0c9938c2005-07-29 15:15:00 -0700211 node->flags |= ANOBJ_END_OF_PEER_LIST;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212 node->peer = parent_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213 }
214
215 /* Init the new entry */
216
217 node->owner_id = owner_id;
218 node->type = (u8) type;
219
Len Brown4be44fc2005-08-05 00:44:28 -0400220 ACPI_DEBUG_PRINT((ACPI_DB_NAMES,
221 "%4.4s (%s) [Node %p Owner %X] added to %4.4s (%s) [Node %p]\n",
222 acpi_ut_get_node_name(node),
223 acpi_ut_get_type_name(node->type), node, owner_id,
224 acpi_ut_get_node_name(parent_node),
225 acpi_ut_get_type_name(parent_node->type),
226 parent_node));
Bob Moore793c2382006-03-31 00:00:00 -0500227
228 return_VOID;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700229}
230
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231/*******************************************************************************
232 *
233 * FUNCTION: acpi_ns_delete_children
234 *
235 * PARAMETERS: parent_node - Delete this objects children
236 *
237 * RETURN: None.
238 *
239 * DESCRIPTION: Delete all children of the parent object. In other words,
240 * deletes a "scope".
241 *
242 ******************************************************************************/
243
Len Brown4be44fc2005-08-05 00:44:28 -0400244void acpi_ns_delete_children(struct acpi_namespace_node *parent_node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245{
Len Brown4be44fc2005-08-05 00:44:28 -0400246 struct acpi_namespace_node *child_node;
247 struct acpi_namespace_node *next_node;
Len Brown4be44fc2005-08-05 00:44:28 -0400248 u8 flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249
Bob Mooreb229cf92006-04-21 17:15:00 -0400250 ACPI_FUNCTION_TRACE_PTR(ns_delete_children, parent_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251
252 if (!parent_node) {
253 return_VOID;
254 }
255
256 /* If no children, all done! */
257
258 child_node = parent_node->child;
259 if (!child_node) {
260 return_VOID;
261 }
262
263 /*
264 * Deallocate all children at this level
265 */
266 do {
Bob Moore52fc0b02006-10-02 00:00:00 -0400267
Linus Torvalds1da177e2005-04-16 15:20:36 -0700268 /* Get the things we need */
269
Len Brown4be44fc2005-08-05 00:44:28 -0400270 next_node = child_node->peer;
271 flags = child_node->flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272
273 /* Grandchildren should have all been deleted already */
274
275 if (child_node->child) {
Bob Mooreb8e4d892006-01-27 16:43:00 -0500276 ACPI_ERROR((AE_INFO, "Found a grandchild! P=%p C=%p",
277 parent_node, child_node));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700278 }
279
280 /* Now we can free this child object */
281
Len Brown4be44fc2005-08-05 00:44:28 -0400282 ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_freed++);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283
Len Brown4be44fc2005-08-05 00:44:28 -0400284 ACPI_DEBUG_PRINT((ACPI_DB_ALLOCATIONS,
285 "Object %p, Remaining %X\n", child_node,
286 acpi_gbl_current_node_count));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287
288 /*
289 * Detach an object if there is one, then free the child node
290 */
Len Brown4be44fc2005-08-05 00:44:28 -0400291 acpi_ns_detach_object(child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700292
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293 /* Now we can delete the node */
294
Bob Moore616861242006-03-17 16:44:00 -0500295 (void)acpi_os_release_object(acpi_gbl_namespace_cache,
296 child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297
298 /* And move on to the next child in the list */
299
300 child_node = next_node;
301
302 } while (!(flags & ANOBJ_END_OF_PEER_LIST));
303
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304 /* Clear the parent's child pointer */
305
306 parent_node->child = NULL;
307
308 return_VOID;
309}
310
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311/*******************************************************************************
312 *
313 * FUNCTION: acpi_ns_delete_namespace_subtree
314 *
315 * PARAMETERS: parent_node - Root of the subtree to be deleted
316 *
317 * RETURN: None.
318 *
319 * DESCRIPTION: Delete a subtree of the namespace. This includes all objects
320 * stored within the subtree.
321 *
322 ******************************************************************************/
323
Len Brown4be44fc2005-08-05 00:44:28 -0400324void acpi_ns_delete_namespace_subtree(struct acpi_namespace_node *parent_node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325{
Len Brown4be44fc2005-08-05 00:44:28 -0400326 struct acpi_namespace_node *child_node = NULL;
327 u32 level = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328
Bob Mooreb229cf92006-04-21 17:15:00 -0400329 ACPI_FUNCTION_TRACE(ns_delete_namespace_subtree);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330
331 if (!parent_node) {
332 return_VOID;
333 }
334
335 /*
336 * Traverse the tree of objects until we bubble back up
337 * to where we started.
338 */
339 while (level > 0) {
Bob Moore52fc0b02006-10-02 00:00:00 -0400340
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341 /* Get the next node in this scope (NULL if none) */
342
Bob Moore616861242006-03-17 16:44:00 -0500343 child_node =
344 acpi_ns_get_next_node(ACPI_TYPE_ANY, parent_node,
345 child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346 if (child_node) {
Bob Moore52fc0b02006-10-02 00:00:00 -0400347
Linus Torvalds1da177e2005-04-16 15:20:36 -0700348 /* Found a child node - detach any attached object */
349
Len Brown4be44fc2005-08-05 00:44:28 -0400350 acpi_ns_detach_object(child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351
352 /* Check if this node has any children */
353
Len Brown4be44fc2005-08-05 00:44:28 -0400354 if (acpi_ns_get_next_node
355 (ACPI_TYPE_ANY, child_node, NULL)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700356 /*
357 * There is at least one child of this node,
358 * visit the node
359 */
360 level++;
361 parent_node = child_node;
362 child_node = NULL;
363 }
Len Brown4be44fc2005-08-05 00:44:28 -0400364 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365 /*
366 * No more children of this parent node.
367 * Move up to the grandparent.
368 */
369 level--;
370
371 /*
372 * Now delete all of the children of this parent
373 * all at the same time.
374 */
Len Brown4be44fc2005-08-05 00:44:28 -0400375 acpi_ns_delete_children(parent_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700376
377 /* New "last child" is this parent node */
378
379 child_node = parent_node;
380
381 /* Move up the tree to the grandparent */
382
Len Brown4be44fc2005-08-05 00:44:28 -0400383 parent_node = acpi_ns_get_parent_node(parent_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384 }
385 }
386
387 return_VOID;
388}
389
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390/*******************************************************************************
391 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392 * FUNCTION: acpi_ns_delete_namespace_by_owner
393 *
394 * PARAMETERS: owner_id - All nodes with this owner will be deleted
395 *
396 * RETURN: Status
397 *
398 * DESCRIPTION: Delete entries within the namespace that are owned by a
399 * specific ID. Used to delete entire ACPI tables. All
400 * reference counts are updated.
401 *
Bob Mooref6dd9222006-07-07 20:44:38 -0400402 * MUTEX: Locks namespace during deletion walk.
403 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404 ******************************************************************************/
405
Len Brown4be44fc2005-08-05 00:44:28 -0400406void acpi_ns_delete_namespace_by_owner(acpi_owner_id owner_id)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407{
Len Brown4be44fc2005-08-05 00:44:28 -0400408 struct acpi_namespace_node *child_node;
409 struct acpi_namespace_node *deletion_node;
Len Brown4be44fc2005-08-05 00:44:28 -0400410 struct acpi_namespace_node *parent_node;
Bob Mooref6dd9222006-07-07 20:44:38 -0400411 u32 level;
412 acpi_status status;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413
Bob Mooreb229cf92006-04-21 17:15:00 -0400414 ACPI_FUNCTION_TRACE_U32(ns_delete_namespace_by_owner, owner_id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415
Robert Moore0c9938c2005-07-29 15:15:00 -0700416 if (owner_id == 0) {
417 return_VOID;
418 }
419
Bob Mooref6dd9222006-07-07 20:44:38 -0400420 /* Lock namespace for possible update */
421
422 status = acpi_ut_acquire_mutex(ACPI_MTX_NAMESPACE);
423 if (ACPI_FAILURE(status)) {
424 return_VOID;
425 }
426
Bob Moore616861242006-03-17 16:44:00 -0500427 deletion_node = NULL;
Len Brown4be44fc2005-08-05 00:44:28 -0400428 parent_node = acpi_gbl_root_node;
429 child_node = NULL;
Len Brown4be44fc2005-08-05 00:44:28 -0400430 level = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700431
432 /*
433 * Traverse the tree of nodes until we bubble back up
434 * to where we started.
435 */
436 while (level > 0) {
437 /*
438 * Get the next child of this parent node. When child_node is NULL,
439 * the first child of the parent is returned
440 */
Len Brown4be44fc2005-08-05 00:44:28 -0400441 child_node =
442 acpi_ns_get_next_node(ACPI_TYPE_ANY, parent_node,
443 child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700444
445 if (deletion_node) {
Bob Moore616861242006-03-17 16:44:00 -0500446 acpi_ns_delete_children(deletion_node);
447 acpi_ns_delete_node(deletion_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700448 deletion_node = NULL;
449 }
450
451 if (child_node) {
452 if (child_node->owner_id == owner_id) {
Bob Moore52fc0b02006-10-02 00:00:00 -0400453
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454 /* Found a matching child node - detach any attached object */
455
Len Brown4be44fc2005-08-05 00:44:28 -0400456 acpi_ns_detach_object(child_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457 }
458
459 /* Check if this node has any children */
460
Len Brown4be44fc2005-08-05 00:44:28 -0400461 if (acpi_ns_get_next_node
462 (ACPI_TYPE_ANY, child_node, NULL)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700463 /*
464 * There is at least one child of this node,
465 * visit the node
466 */
467 level++;
468 parent_node = child_node;
469 child_node = NULL;
Len Brown4be44fc2005-08-05 00:44:28 -0400470 } else if (child_node->owner_id == owner_id) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700471 deletion_node = child_node;
472 }
Len Brown4be44fc2005-08-05 00:44:28 -0400473 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474 /*
475 * No more children of this parent node.
476 * Move up to the grandparent.
477 */
478 level--;
479 if (level != 0) {
480 if (parent_node->owner_id == owner_id) {
481 deletion_node = parent_node;
482 }
483 }
484
485 /* New "last child" is this parent node */
486
487 child_node = parent_node;
488
489 /* Move up the tree to the grandparent */
490
Len Brown4be44fc2005-08-05 00:44:28 -0400491 parent_node = acpi_ns_get_parent_node(parent_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700492 }
493 }
494
Bob Mooref6dd9222006-07-07 20:44:38 -0400495 (void)acpi_ut_release_mutex(ACPI_MTX_NAMESPACE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496 return_VOID;
497}