[mirror_ubuntu-artful-kernel.git] / drivers / acpi / acpica / nsalloc.c

/*******************************************************************************
 *
 * Module Name: nsalloc - Namespace allocation and deletion utilities
 *
 ******************************************************************************/

/*
 * Copyright (C) 2000 - 2008, Intel Corp.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions, and the following disclaimer,
 *    without modification.
 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
 *    substantially similar to the "NO WARRANTY" disclaimer below
 *    ("Disclaimer") and any redistribution must be conditioned upon
 *    including a substantially similar Disclaimer requirement for further
 *    binary redistribution.
 * 3. Neither the names of the above-listed copyright holders nor the names
 *    of any contributors may be used to endorse or promote products derived
 *    from this software without specific prior written permission.
 *
 * Alternatively, this software may be distributed under the terms of the
 * GNU General Public License ("GPL") version 2 as published by the Free
 * Software Foundation.
 *
 * NO WARRANTY
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGES.
 */

#include <acpi/acpi.h>
#include "accommon.h"
#include "acnamesp.h"

#define _COMPONENT          ACPI_NAMESPACE
ACPI_MODULE_NAME("nsalloc")

/*******************************************************************************
 *
 * FUNCTION:    acpi_ns_create_node
 *
 * PARAMETERS:  Name            - Name of the new node (4 char ACPI name)
 *
 * RETURN:      New namespace node (Null on failure)
 *
 * DESCRIPTION: Create a namespace node
 *
 ******************************************************************************/
struct acpi_namespace_node *acpi_ns_create_node(u32 name)
{
	struct acpi_namespace_node *node;
#ifdef ACPI_DBG_TRACK_ALLOCATIONS
	u32 temp;
#endif

	ACPI_FUNCTION_TRACE(ns_create_node);

	node = acpi_os_acquire_object(acpi_gbl_namespace_cache);
	if (!node) {
		return_PTR(NULL);
	}

	ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_allocated++);

#ifdef ACPI_DBG_TRACK_ALLOCATIONS
	temp =
	    acpi_gbl_ns_node_list->total_allocated -
	    acpi_gbl_ns_node_list->total_freed;
	if (temp > acpi_gbl_ns_node_list->max_occupied) {
		acpi_gbl_ns_node_list->max_occupied = temp;
	}
#endif

	node->name.integer = name;
	ACPI_SET_DESCRIPTOR_TYPE(node, ACPI_DESC_TYPE_NAMED);
	return_PTR(node);
}

/*******************************************************************************
 *
 * FUNCTION:    acpi_ns_delete_node
 *
 * PARAMETERS:  Node            - Node to be deleted
 *
 * RETURN:      None
 *
 * DESCRIPTION: Delete a namespace node
 *
 ******************************************************************************/

void acpi_ns_delete_node(struct acpi_namespace_node *node)
{
	struct acpi_namespace_node *parent_node;
	struct acpi_namespace_node *prev_node;
	struct acpi_namespace_node *next_node;

	ACPI_FUNCTION_TRACE_PTR(ns_delete_node, node);

	parent_node = acpi_ns_get_parent_node(node);

	prev_node = NULL;
	next_node = parent_node->child;

	/* Find the node that is the previous peer in the parent's child list */

	while (next_node != node) {
		prev_node = next_node;
		next_node = prev_node->peer;
	}

	if (prev_node) {

		/* Node is not first child, unlink it */

		prev_node->peer = next_node->peer;
		if (next_node->flags & ANOBJ_END_OF_PEER_LIST) {
			prev_node->flags |= ANOBJ_END_OF_PEER_LIST;
		}
	} else {
		/* Node is first child (has no previous peer) */

		if (next_node->flags & ANOBJ_END_OF_PEER_LIST) {

			/* No peers at all */

			parent_node->child = NULL;
		} else {	/* Link peer list to parent */

			parent_node->child = next_node->peer;
		}
	}

	ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_freed++);

	/*
	 * Detach an object if there is one, then delete the node
	 */
	acpi_ns_detach_object(node);
	(void)acpi_os_release_object(acpi_gbl_namespace_cache, node);
	return_VOID;
}

/*******************************************************************************
 *
 * FUNCTION:    acpi_ns_install_node
 *
 * PARAMETERS:  walk_state      - Current state of the walk
 *              parent_node     - The parent of the new Node
 *              Node            - The new Node to install
 *              Type            - ACPI object type of the new Node
 *
 * RETURN:      None
 *
 * DESCRIPTION: Initialize a new namespace node and install it amongst
 *              its peers.
 *
 *              Note: Current namespace lookup is linear search. This appears
 *              to be sufficient as namespace searches consume only a small
 *              fraction of the execution time of the ACPI subsystem.
 *
 ******************************************************************************/

void acpi_ns_install_node(struct acpi_walk_state *walk_state, struct acpi_namespace_node *parent_node,	/* Parent */
			  struct acpi_namespace_node *node,	/* New Child */
			  acpi_object_type type)
{
	acpi_owner_id owner_id = 0;
	struct acpi_namespace_node *child_node;

	ACPI_FUNCTION_TRACE(ns_install_node);

	/*
	 * Get the owner ID from the Walk state
	 * The owner ID is used to track table deletion and
	 * deletion of objects created by methods
	 */
	if (walk_state) {
		owner_id = walk_state->owner_id;
	}

	/* Link the new entry into the parent and existing children */

	child_node = parent_node->child;
	if (!child_node) {
		parent_node->child = node;
		node->flags |= ANOBJ_END_OF_PEER_LIST;
		node->peer = parent_node;
	} else {
		while (!(child_node->flags & ANOBJ_END_OF_PEER_LIST)) {
			child_node = child_node->peer;
		}

		child_node->peer = node;

		/* Clear end-of-list flag */

		child_node->flags &= ~ANOBJ_END_OF_PEER_LIST;
		node->flags |= ANOBJ_END_OF_PEER_LIST;
		node->peer = parent_node;
	}

	/* Init the new entry */

	node->owner_id = owner_id;
	node->type = (u8) type;

	ACPI_DEBUG_PRINT((ACPI_DB_NAMES,
			  "%4.4s (%s) [Node %p Owner %X] added to %4.4s (%s) [Node %p]\n",
			  acpi_ut_get_node_name(node),
			  acpi_ut_get_type_name(node->type), node, owner_id,
			  acpi_ut_get_node_name(parent_node),
			  acpi_ut_get_type_name(parent_node->type),
			  parent_node));

	return_VOID;
}

/*******************************************************************************
 *
 * FUNCTION:    acpi_ns_delete_children
 *
 * PARAMETERS:  parent_node     - Delete this objects children
 *
 * RETURN:      None.
 *
 * DESCRIPTION: Delete all children of the parent object. In other words,
 *              deletes a "scope".
 *
 ******************************************************************************/

void acpi_ns_delete_children(struct acpi_namespace_node *parent_node)
{
	struct acpi_namespace_node *child_node;
	struct acpi_namespace_node *next_node;
	u8 flags;

	ACPI_FUNCTION_TRACE_PTR(ns_delete_children, parent_node);

	if (!parent_node) {
		return_VOID;
	}

	/* If no children, all done! */

	child_node = parent_node->child;
	if (!child_node) {
		return_VOID;
	}

	/*
	 * Deallocate all children at this level
	 */
	do {

		/* Get the things we need */

		next_node = child_node->peer;
		flags = child_node->flags;

		/* Grandchildren should have all been deleted already */

		if (child_node->child) {
			ACPI_ERROR((AE_INFO, "Found a grandchild! P=%p C=%p",
				    parent_node, child_node));
		}

		/* Now we can free this child object */

		ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_freed++);

		ACPI_DEBUG_PRINT((ACPI_DB_ALLOCATIONS,
				  "Object %p, Remaining %X\n", child_node,
				  acpi_gbl_current_node_count));

		/*
		 * Detach an object if there is one, then free the child node
		 */
		acpi_ns_detach_object(child_node);

		/* Now we can delete the node */

		(void)acpi_os_release_object(acpi_gbl_namespace_cache,
					     child_node);

		/* And move on to the next child in the list */

		child_node = next_node;

	} while (!(flags & ANOBJ_END_OF_PEER_LIST));

	/* Clear the parent's child pointer */

	parent_node->child = NULL;

	return_VOID;
}

/*******************************************************************************
 *
 * FUNCTION:    acpi_ns_delete_namespace_subtree
 *
 * PARAMETERS:  parent_node     - Root of the subtree to be deleted
 *
 * RETURN:      None.
 *
 * DESCRIPTION: Delete a subtree of the namespace.  This includes all objects
 *              stored within the subtree.
 *
 ******************************************************************************/

void acpi_ns_delete_namespace_subtree(struct acpi_namespace_node *parent_node)
{
	struct acpi_namespace_node *child_node = NULL;
	u32 level = 1;

	ACPI_FUNCTION_TRACE(ns_delete_namespace_subtree);

	if (!parent_node) {
		return_VOID;
	}

	/*
	 * Traverse the tree of objects until we bubble back up
	 * to where we started.
	 */
	while (level > 0) {

		/* Get the next node in this scope (NULL if none) */

		child_node =
		    acpi_ns_get_next_node(ACPI_TYPE_ANY, parent_node,
					  child_node);
		if (child_node) {

			/* Found a child node - detach any attached object */

			acpi_ns_detach_object(child_node);

			/* Check if this node has any children */

			if (acpi_ns_get_next_node
			    (ACPI_TYPE_ANY, child_node, NULL)) {
				/*
				 * There is at least one child of this node,
				 * visit the node
				 */
				level++;
				parent_node = child_node;
				child_node = NULL;
			}
		} else {
			/*
			 * No more children of this parent node.
			 * Move up to the grandparent.
			 */
			level--;

			/*
			 * Now delete all of the children of this parent
			 * all at the same time.
			 */
			acpi_ns_delete_children(parent_node);

			/* New "last child" is this parent node */

			child_node = parent_node;

			/* Move up the tree to the grandparent */

			parent_node = acpi_ns_get_parent_node(parent_node);
		}
	}

	return_VOID;
}

/*******************************************************************************
 *
 * FUNCTION:    acpi_ns_delete_namespace_by_owner
 *
 * PARAMETERS:  owner_id    - All nodes with this owner will be deleted
 *
 * RETURN:      Status
 *
 * DESCRIPTION: Delete entries within the namespace that are owned by a
 *              specific ID.  Used to delete entire ACPI tables.  All
 *              reference counts are updated.
 *
 * MUTEX:       Locks namespace during deletion walk.
 *
 ******************************************************************************/

void acpi_ns_delete_namespace_by_owner(acpi_owner_id owner_id)
{
	struct acpi_namespace_node *child_node;
	struct acpi_namespace_node *deletion_node;
	struct acpi_namespace_node *parent_node;
	u32 level;
	acpi_status status;

	ACPI_FUNCTION_TRACE_U32(ns_delete_namespace_by_owner, owner_id);

	if (owner_id == 0) {
		return_VOID;
	}

	/* Lock namespace for possible update */

	status = acpi_ut_acquire_mutex(ACPI_MTX_NAMESPACE);
	if (ACPI_FAILURE(status)) {
		return_VOID;
	}

	deletion_node = NULL;
	parent_node = acpi_gbl_root_node;
	child_node = NULL;
	level = 1;

	/*
	 * Traverse the tree of nodes until we bubble back up
	 * to where we started.
	 */
	while (level > 0) {
		/*
		 * Get the next child of this parent node. When child_node is NULL,
		 * the first child of the parent is returned
		 */
		child_node =
		    acpi_ns_get_next_node(ACPI_TYPE_ANY, parent_node,
					  child_node);

		if (deletion_node) {
			acpi_ns_delete_children(deletion_node);
			acpi_ns_delete_node(deletion_node);
			deletion_node = NULL;
		}

		if (child_node) {
			if (child_node->owner_id == owner_id) {

				/* Found a matching child node - detach any attached object */

				acpi_ns_detach_object(child_node);
			}

			/* Check if this node has any children */

			if (acpi_ns_get_next_node
			    (ACPI_TYPE_ANY, child_node, NULL)) {
				/*
				 * There is at least one child of this node,
				 * visit the node
				 */
				level++;
				parent_node = child_node;
				child_node = NULL;
			} else if (child_node->owner_id == owner_id) {
				deletion_node = child_node;
			}
		} else {
			/*
			 * No more children of this parent node.
			 * Move up to the grandparent.
			 */
			level--;
			if (level != 0) {
				if (parent_node->owner_id == owner_id) {
					deletion_node = parent_node;
				}
			}

			/* New "last child" is this parent node */

			child_node = parent_node;

			/* Move up the tree to the grandparent */

			parent_node = acpi_ns_get_parent_node(parent_node);
		}
	}

	(void)acpi_ut_release_mutex(ACPI_MTX_NAMESPACE);
	return_VOID;
}
Commit	Line	Data
1da177e4 LT	1	/*******************************************************************************
	2	*
	3	* Module Name: nsalloc - Namespace allocation and deletion utilities
	4	*
	5	******************************************************************************/
	6
	7	/*
75a44ce0	8	* Copyright (C) 2000 - 2008, Intel Corp.
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	44	#include <acpi/acpi.h>
e2f7a777 LB	45	#include "accommon.h"
e2f7a777 LB	46	#include "acnamesp.h"
1da177e4	47
1da177e4	48	#define _COMPONENT ACPI_NAMESPACE
4be44fcd	49	ACPI_MODULE_NAME("nsalloc")
1da177e4	50
1da177e4 LT	51	/*******************************************************************************
	52	*
	53	* FUNCTION: acpi_ns_create_node
	54	*
44f6c012	55	* PARAMETERS: Name - Name of the new node (4 char ACPI name)
1da177e4	56	*
44f6c012	57	* RETURN: New namespace node (Null on failure)
1da177e4 LT	58	*
	59	* DESCRIPTION: Create a namespace node
	60	*
	61	******************************************************************************/
4be44fcd	62	struct acpi_namespace_node *acpi_ns_create_node(u32 name)
1da177e4	63	{
4be44fcd	64	struct acpi_namespace_node *node;
afbb9e65 VP	65	#ifdef ACPI_DBG_TRACK_ALLOCATIONS
	66	u32 temp;
	67	#endif
1da177e4	68
b229cf92	69	ACPI_FUNCTION_TRACE(ns_create_node);
1da177e4	70
61686124	71	node = acpi_os_acquire_object(acpi_gbl_namespace_cache);
1da177e4	72	if (!node) {
4be44fcd	73	return_PTR(NULL);
1da177e4 LT	74	}
1da177e4 LT	75
4be44fcd	76	ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_allocated++);
1da177e4	77
afbb9e65 VP	78	#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
4be44fcd	87	node->name.integer = name;
4be44fcd	88	ACPI_SET_DESCRIPTOR_TYPE(node, ACPI_DESC_TYPE_NAMED);
4be44fcd	89	return_PTR(node);
1da177e4 LT	90	}
1da177e4 LT	91
1da177e4 LT	92	/*******************************************************************************
	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
4be44fcd	104	void acpi_ns_delete_node(struct acpi_namespace_node *node)
1da177e4	105	{
4be44fcd LB	106	struct acpi_namespace_node *parent_node;
	107	struct acpi_namespace_node *prev_node;
	108	struct acpi_namespace_node *next_node;
1da177e4	109
b229cf92	110	ACPI_FUNCTION_TRACE_PTR(ns_delete_node, node);
1da177e4	111
4be44fcd	112	parent_node = acpi_ns_get_parent_node(node);
1da177e4 LT	113
	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) {
52fc0b02	125
1da177e4 LT	126	/* 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	}
4be44fcd	132	} else {
1da177e4 LT	133	/* Node is first child (has no previous peer) */
	134
	135	if (next_node->flags & ANOBJ_END_OF_PEER_LIST) {
52fc0b02	136
1da177e4 LT	137	/* No peers at all */
	138
	139	parent_node->child = NULL;
4be44fcd	140	} else { /* Link peer list to parent */
1da177e4 LT	141
	142	parent_node->child = next_node->peer;
	143	}
	144	}
	145
4be44fcd	146	ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_freed++);
1da177e4 LT	147
1da177e4 LT	148	/*
61686124	149	* Detach an object if there is one, then delete the node
1da177e4	150	*/
4be44fcd	151	acpi_ns_detach_object(node);
61686124	152	(void)acpi_os_release_object(acpi_gbl_namespace_cache, node);
1da177e4 LT	153	return_VOID;
	154	}
	155
1da177e4 LT	156	/*******************************************************************************
	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	*
0c9938cc RM	170	* 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.
1da177e4 LT	173	*
	174	******************************************************************************/
	175
4be44fcd LB	176	void 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)
1da177e4	179	{
4be44fcd LB	180	acpi_owner_id owner_id = 0;
4be44fcd LB	181	struct acpi_namespace_node *child_node;
1da177e4	182
b229cf92	183	ACPI_FUNCTION_TRACE(ns_install_node);
1da177e4 LT	184
	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;
4be44fcd	201	} else {
1da177e4 LT	202	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;
0c9938cc	211	node->flags \|= ANOBJ_END_OF_PEER_LIST;
1da177e4	212	node->peer = parent_node;
1da177e4 LT	213	}
	214
	215	/* Init the new entry */
	216
	217	node->owner_id = owner_id;
	218	node->type = (u8) type;
	219
4be44fcd LB	220	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));
793c2388 BM	227
793c2388 BM	228	return_VOID;
1da177e4 LT	229	}
1da177e4 LT	230
1da177e4 LT	231	/*******************************************************************************
	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
4be44fcd	244	void acpi_ns_delete_children(struct acpi_namespace_node *parent_node)
1da177e4	245	{
4be44fcd LB	246	struct acpi_namespace_node *child_node;
4be44fcd LB	247	struct acpi_namespace_node *next_node;
4be44fcd	248	u8 flags;
1da177e4	249
b229cf92	250	ACPI_FUNCTION_TRACE_PTR(ns_delete_children, parent_node);
1da177e4 LT	251
	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 {
52fc0b02	267
1da177e4 LT	268	/* Get the things we need */
1da177e4 LT	269
4be44fcd LB	270	next_node = child_node->peer;
4be44fcd LB	271	flags = child_node->flags;
1da177e4 LT	272
	273	/* Grandchildren should have all been deleted already */
	274
	275	if (child_node->child) {
b8e4d893 BM	276	ACPI_ERROR((AE_INFO, "Found a grandchild! P=%p C=%p",
b8e4d893 BM	277	parent_node, child_node));
1da177e4 LT	278	}
	279
	280	/* Now we can free this child object */
	281
4be44fcd	282	ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_freed++);
1da177e4	283
4be44fcd LB	284	ACPI_DEBUG_PRINT((ACPI_DB_ALLOCATIONS,
	285	"Object %p, Remaining %X\n", child_node,
	286	acpi_gbl_current_node_count));
1da177e4 LT	287
	288	/*
	289	* Detach an object if there is one, then free the child node
	290	*/
4be44fcd	291	acpi_ns_detach_object(child_node);
1da177e4	292
1da177e4 LT	293	/* Now we can delete the node */
1da177e4 LT	294
61686124 BM	295	(void)acpi_os_release_object(acpi_gbl_namespace_cache,
61686124 BM	296	child_node);
1da177e4 LT	297
	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
1da177e4 LT	304	/* Clear the parent's child pointer */
	305
	306	parent_node->child = NULL;
	307
	308	return_VOID;
	309	}
	310
1da177e4 LT	311	/*******************************************************************************
	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
4be44fcd	324	void acpi_ns_delete_namespace_subtree(struct acpi_namespace_node *parent_node)
1da177e4	325	{
4be44fcd LB	326	struct acpi_namespace_node *child_node = NULL;
4be44fcd LB	327	u32 level = 1;
1da177e4	328
b229cf92	329	ACPI_FUNCTION_TRACE(ns_delete_namespace_subtree);
1da177e4 LT	330
	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) {
52fc0b02	340
1da177e4 LT	341	/* Get the next node in this scope (NULL if none) */
1da177e4 LT	342
61686124 BM	343	child_node =
	344	acpi_ns_get_next_node(ACPI_TYPE_ANY, parent_node,
	345	child_node);
1da177e4	346	if (child_node) {
52fc0b02	347
1da177e4 LT	348	/* Found a child node - detach any attached object */
1da177e4 LT	349
4be44fcd	350	acpi_ns_detach_object(child_node);
1da177e4 LT	351
	352	/* Check if this node has any children */
	353
4be44fcd LB	354	if (acpi_ns_get_next_node
4be44fcd LB	355	(ACPI_TYPE_ANY, child_node, NULL)) {
1da177e4 LT	356	/*
	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	}
4be44fcd	364	} else {
1da177e4 LT	365	/*
	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	*/
4be44fcd	375	acpi_ns_delete_children(parent_node);
1da177e4 LT	376
	377	/* New "last child" is this parent node */
	378
	379	child_node = parent_node;
	380
	381	/* Move up the tree to the grandparent */
	382
4be44fcd	383	parent_node = acpi_ns_get_parent_node(parent_node);
1da177e4 LT	384	}
	385	}
	386
	387	return_VOID;
	388	}
	389
1da177e4 LT	390	/*******************************************************************************
	391	*
	392	* 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	*
f6dd9221 BM	402	* MUTEX: Locks namespace during deletion walk.
f6dd9221 BM	403	*
1da177e4 LT	404	******************************************************************************/
1da177e4 LT	405
4be44fcd	406	void acpi_ns_delete_namespace_by_owner(acpi_owner_id owner_id)
1da177e4	407	{
4be44fcd LB	408	struct acpi_namespace_node *child_node;
4be44fcd LB	409	struct acpi_namespace_node *deletion_node;
4be44fcd	410	struct acpi_namespace_node *parent_node;
f6dd9221 BM	411	u32 level;
f6dd9221 BM	412	acpi_status status;
1da177e4	413
b229cf92	414	ACPI_FUNCTION_TRACE_U32(ns_delete_namespace_by_owner, owner_id);
1da177e4	415
0c9938cc RM	416	if (owner_id == 0) {
	417	return_VOID;
	418	}
	419
f6dd9221 BM	420	/* 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
61686124	427	deletion_node = NULL;
4be44fcd LB	428	parent_node = acpi_gbl_root_node;
4be44fcd LB	429	child_node = NULL;
4be44fcd	430	level = 1;
1da177e4 LT	431
	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	*/
4be44fcd LB	441	child_node =
	442	acpi_ns_get_next_node(ACPI_TYPE_ANY, parent_node,
	443	child_node);
1da177e4 LT	444
1da177e4 LT	445	if (deletion_node) {
61686124 BM	446	acpi_ns_delete_children(deletion_node);
61686124 BM	447	acpi_ns_delete_node(deletion_node);
1da177e4 LT	448	deletion_node = NULL;
	449	}
	450
	451	if (child_node) {
	452	if (child_node->owner_id == owner_id) {
52fc0b02	453
1da177e4 LT	454	/* Found a matching child node - detach any attached object */
1da177e4 LT	455
4be44fcd	456	acpi_ns_detach_object(child_node);
1da177e4 LT	457	}
	458
	459	/* Check if this node has any children */
	460
4be44fcd LB	461	if (acpi_ns_get_next_node
4be44fcd LB	462	(ACPI_TYPE_ANY, child_node, NULL)) {
1da177e4 LT	463	/*
	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;
4be44fcd	470	} else if (child_node->owner_id == owner_id) {
1da177e4 LT	471	deletion_node = child_node;
1da177e4 LT	472	}
4be44fcd	473	} else {
1da177e4 LT	474	/*
	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
4be44fcd	491	parent_node = acpi_ns_get_parent_node(parent_node);
1da177e4 LT	492	}
	493	}
	494
f6dd9221	495	(void)acpi_ut_release_mutex(ACPI_MTX_NAMESPACE);
1da177e4 LT	496	return_VOID;
1da177e4 LT	497	}