[deliverable/linux.git] / drivers / acpi / acpica / nsalloc.c

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

/*
 * Copyright (C) 2000 - 2010, 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. All node deletions must come through
 *              here. Detaches any attached objects, including any attached
 *              data. If a handler is associated with attached data, it is
 *              invoked before the node is deleted.
 *
 ******************************************************************************/

void acpi_ns_delete_node(struct acpi_namespace_node *node)
{
	union acpi_operand_object *obj_desc;

	ACPI_FUNCTION_NAME(ns_delete_node);

	/* Detach an object if there is one */

	acpi_ns_detach_object(node);

	/*
	 * Delete an attached data object if present (an object that was created
	 * and attached via acpi_attach_data). Note: After any normal object is
	 * detached above, the only possible remaining object is a data object.
	 */
	obj_desc = node->object;
	if (obj_desc && (obj_desc->common.type == ACPI_TYPE_LOCAL_DATA)) {

		/* Invoke the attached data deletion handler if present */

		if (obj_desc->data.handler) {
			obj_desc->data.handler(node, obj_desc->data.pointer);
		}

		acpi_ut_remove_reference(obj_desc);
	}

	/* Now we can delete the node */

	(void)acpi_os_release_object(acpi_gbl_namespace_cache, node);

	ACPI_MEM_TRACKING(acpi_gbl_ns_node_list->total_freed++);
	ACPI_DEBUG_PRINT((ACPI_DB_ALLOCATIONS, "Node %p, Remaining %X\n",
			  node, acpi_gbl_current_node_count));
}

/*******************************************************************************
 *
 * FUNCTION:    acpi_ns_remove_node
 *
 * PARAMETERS:  Node            - Node to be removed/deleted
 *
 * RETURN:      None
 *
 * DESCRIPTION: Remove (unlink) and delete a namespace node
 *
 ******************************************************************************/

void acpi_ns_remove_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_remove_node, node);

	parent_node = node->parent;

	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 = next_node->peer;
	}

	if (prev_node) {

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

		prev_node->peer = node->peer;
	} else {
		/*
		 * Node is first child (has no previous peer).
		 * Link peer list to parent
		 */
		parent_node->child = node->peer;
	}

	/* Delete the node and any attached objects */

	acpi_ns_delete_node(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 */

	node->peer = NULL;
	node->parent = parent_node;
	child_node = parent_node->child;

	if (!child_node) {
		parent_node->child = node;
	} else {
		/* Add node to the end of the peer list */

		while (child_node->peer) {
			child_node = child_node->peer;
		}

		child_node->peer = 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 *next_node;
	struct acpi_namespace_node *node_to_delete;

	ACPI_FUNCTION_TRACE_PTR(ns_delete_children, parent_node);

	if (!parent_node) {
		return_VOID;
	}

	/* Deallocate all children at this level */

	next_node = parent_node->child;
	while (next_node) {

		/* Grandchildren should have all been deleted already */

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

		/*
		 * Delete this child node and move on to the next child in the list.
		 * No need to unlink the node since we are deleting the entire branch.
		 */
		node_to_delete = next_node;
		next_node = next_node->peer;
		acpi_ns_delete_node(node_to_delete);
	};

	/* 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(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 (child_node->child) {
				/*
				 * 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 = parent_node->parent;
		}
	}

	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(parent_node, child_node);

		if (deletion_node) {
			acpi_ns_delete_children(deletion_node);
			acpi_ns_remove_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 (child_node->child) {
				/*
				 * 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 = parent_node->parent;
		}
	}

	(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	/*
a8357b0c	8	* Copyright (C) 2000 - 2010, 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	78	#ifdef ACPI_DBG_TRACK_ALLOCATIONS
d4913dc6	79	temp = acpi_gbl_ns_node_list->total_allocated -
afbb9e65 VP	80	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
4be44fcd	86	node->name.integer = name;
4be44fcd	87	ACPI_SET_DESCRIPTOR_TYPE(node, ACPI_DESC_TYPE_NAMED);
4be44fcd	88	return_PTR(node);
1da177e4 LT	89	}
1da177e4 LT	90
1da177e4 LT	91	/*******************************************************************************
	92	*
	93	* FUNCTION: acpi_ns_delete_node
	94	*
	95	* PARAMETERS: Node - Node to be deleted
	96	*
	97	* RETURN: None
	98	*
8e4319c4 BM	99	* 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.
1da177e4 LT	103	*
	104	******************************************************************************/
	105
4be44fcd	106	void acpi_ns_delete_node(struct acpi_namespace_node *node)
8e4319c4 BM	107	{
	108	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	*
	146	* PARAMETERS: Node - Node to be removed/deleted
	147	*
	148	* RETURN: None
	149	*
	150	* DESCRIPTION: Remove (unlink) and delete a namespace node
	151	*
	152	******************************************************************************/
	153
	154	void acpi_ns_remove_node(struct acpi_namespace_node *node)
1da177e4	155	{
4be44fcd LB	156	struct acpi_namespace_node *parent_node;
	157	struct acpi_namespace_node *prev_node;
	158	struct acpi_namespace_node *next_node;
1da177e4	159
8e4319c4	160	ACPI_FUNCTION_TRACE_PTR(ns_remove_node, node);
1da177e4	161
c45b5c09	162	parent_node = node->parent;
1da177e4 LT	163
	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;
c45b5c09	171	next_node = next_node->peer;
1da177e4 LT	172	}
	173
	174	if (prev_node) {
52fc0b02	175
1da177e4 LT	176	/* Node is not first child, unlink it */
1da177e4 LT	177
c45b5c09	178	prev_node->peer = node->peer;
4be44fcd	179	} else {
c45b5c09 AS	180	/*
	181	* Node is first child (has no previous peer).
	182	* Link peer list to parent
	183	*/
	184	parent_node->child = node->peer;
1da177e4 LT	185	}
1da177e4 LT	186
8e4319c4	187	/* Delete the node and any attached objects */
d4913dc6	188
8e4319c4	189	acpi_ns_delete_node(node);
1da177e4 LT	190	return_VOID;
	191	}
	192
1da177e4 LT	193	/*******************************************************************************
	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
	199	* Node - The new Node to install
	200	* Type - ACPI object type of the new Node
	201	*
	202	* RETURN: None
	203	*
	204	* DESCRIPTION: Initialize a new namespace node and install it amongst
	205	* its peers.
	206	*
0c9938cc RM	207	* 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.
1da177e4 LT	210	*
	211	******************************************************************************/
	212
4be44fcd LB	213	void 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)
1da177e4	216	{
4be44fcd LB	217	acpi_owner_id owner_id = 0;
4be44fcd LB	218	struct acpi_namespace_node *child_node;
1da177e4	219
b229cf92	220	ACPI_FUNCTION_TRACE(ns_install_node);
1da177e4 LT	221
1da177e4 LT	222	/*
d4913dc6 BM	223	* Get the owner ID from the Walk state. The owner ID is used to track
d4913dc6 BM	224	* table deletion and deletion of objects created by methods.
1da177e4 LT	225	*/
	226	if (walk_state) {
	227	owner_id = walk_state->owner_id;
	228	}
	229
	230	/* Link the new entry into the parent and existing children */
	231
c45b5c09 AS	232	node->peer = NULL;
c45b5c09 AS	233	node->parent = parent_node;
1da177e4	234	child_node = parent_node->child;
c45b5c09	235
1da177e4 LT	236	if (!child_node) {
1da177e4 LT	237	parent_node->child = node;
4be44fcd	238	} else {
c45b5c09 AS	239	/* Add node to the end of the peer list */
	240
	241	while (child_node->peer) {
1da177e4 LT	242	child_node = child_node->peer;
	243	}
	244
	245	child_node->peer = node;
1da177e4 LT	246	}
	247
	248	/* Init the new entry */
	249
	250	node->owner_id = owner_id;
	251	node->type = (u8) type;
	252
4be44fcd LB	253	ACPI_DEBUG_PRINT((ACPI_DB_NAMES,
	254	"%4.4s (%s) [Node %p Owner %X] added to %4.4s (%s) [Node %p]\n",
	255	acpi_ut_get_node_name(node),
	256	acpi_ut_get_type_name(node->type), node, owner_id,
	257	acpi_ut_get_node_name(parent_node),
	258	acpi_ut_get_type_name(parent_node->type),
	259	parent_node));
793c2388 BM	260
793c2388 BM	261	return_VOID;
1da177e4 LT	262	}
1da177e4 LT	263
1da177e4 LT	264	/*******************************************************************************
	265	*
	266	* FUNCTION: acpi_ns_delete_children
	267	*
	268	* PARAMETERS: parent_node - Delete this objects children
	269	*
	270	* RETURN: None.
	271	*
	272	* DESCRIPTION: Delete all children of the parent object. In other words,
	273	* deletes a "scope".
	274	*
	275	******************************************************************************/
	276
4be44fcd	277	void acpi_ns_delete_children(struct acpi_namespace_node *parent_node)
1da177e4	278	{
4be44fcd	279	struct acpi_namespace_node *next_node;
c45b5c09	280	struct acpi_namespace_node *node_to_delete;
1da177e4	281
b229cf92	282	ACPI_FUNCTION_TRACE_PTR(ns_delete_children, parent_node);
1da177e4 LT	283
	284	if (!parent_node) {
	285	return_VOID;
	286	}
	287
d4913dc6 BM	288	/* Deallocate all children at this level */
d4913dc6 BM	289
c45b5c09 AS	290	next_node = parent_node->child;
c45b5c09 AS	291	while (next_node) {
1da177e4 LT	292
	293	/* Grandchildren should have all been deleted already */
	294
c45b5c09	295	if (next_node->child) {
b8e4d893	296	ACPI_ERROR((AE_INFO, "Found a grandchild! P=%p C=%p",
c45b5c09	297	parent_node, next_node));
1da177e4 LT	298	}
1da177e4 LT	299
8e4319c4 BM	300	/*
	301	* Delete this child node and move on to the next child in the list.
	302	* No need to unlink the node since we are deleting the entire branch.
	303	*/
c45b5c09 AS	304	node_to_delete = next_node;
	305	next_node = next_node->peer;
	306	acpi_ns_delete_node(node_to_delete);
	307	};
1da177e4	308
1da177e4 LT	309	/* Clear the parent's child pointer */
	310
	311	parent_node->child = NULL;
1da177e4 LT	312	return_VOID;
	313	}
	314
1da177e4 LT	315	/*******************************************************************************
	316	*
	317	* FUNCTION: acpi_ns_delete_namespace_subtree
	318	*
	319	* PARAMETERS: parent_node - Root of the subtree to be deleted
	320	*
	321	* RETURN: None.
	322	*
	323	* DESCRIPTION: Delete a subtree of the namespace. This includes all objects
	324	* stored within the subtree.
	325	*
	326	******************************************************************************/
	327
4be44fcd	328	void acpi_ns_delete_namespace_subtree(struct acpi_namespace_node *parent_node)
1da177e4	329	{
4be44fcd LB	330	struct acpi_namespace_node *child_node = NULL;
4be44fcd LB	331	u32 level = 1;
1da177e4	332
b229cf92	333	ACPI_FUNCTION_TRACE(ns_delete_namespace_subtree);
1da177e4 LT	334
	335	if (!parent_node) {
	336	return_VOID;
	337	}
	338
	339	/*
	340	* Traverse the tree of objects until we bubble back up
	341	* to where we started.
	342	*/
	343	while (level > 0) {
52fc0b02	344
1da177e4 LT	345	/* Get the next node in this scope (NULL if none) */
1da177e4 LT	346
8c725bf9	347	child_node = acpi_ns_get_next_node(parent_node, child_node);
1da177e4	348	if (child_node) {
52fc0b02	349
1da177e4 LT	350	/* Found a child node - detach any attached object */
1da177e4 LT	351
4be44fcd	352	acpi_ns_detach_object(child_node);
1da177e4 LT	353
	354	/* Check if this node has any children */
	355
8c725bf9	356	if (child_node->child) {
1da177e4 LT	357	/*
	358	* There is at least one child of this node,
	359	* visit the node
	360	*/
	361	level++;
	362	parent_node = child_node;
	363	child_node = NULL;
	364	}
4be44fcd	365	} else {
1da177e4 LT	366	/*
	367	* No more children of this parent node.
	368	* Move up to the grandparent.
	369	*/
	370	level--;
	371
	372	/*
	373	* Now delete all of the children of this parent
	374	* all at the same time.
	375	*/
4be44fcd	376	acpi_ns_delete_children(parent_node);
1da177e4 LT	377
	378	/* New "last child" is this parent node */
	379
	380	child_node = parent_node;
	381
	382	/* Move up the tree to the grandparent */
	383
c45b5c09	384	parent_node = parent_node->parent;
1da177e4 LT	385	}
	386	}
	387
	388	return_VOID;
	389	}
	390
1da177e4 LT	391	/*******************************************************************************
	392	*
	393	* FUNCTION: acpi_ns_delete_namespace_by_owner
	394	*
	395	* PARAMETERS: owner_id - All nodes with this owner will be deleted
	396	*
	397	* RETURN: Status
	398	*
	399	* DESCRIPTION: Delete entries within the namespace that are owned by a
	400	* specific ID. Used to delete entire ACPI tables. All
	401	* reference counts are updated.
	402	*
f6dd9221 BM	403	* MUTEX: Locks namespace during deletion walk.
f6dd9221 BM	404	*
1da177e4 LT	405	******************************************************************************/
1da177e4 LT	406
4be44fcd	407	void acpi_ns_delete_namespace_by_owner(acpi_owner_id owner_id)
1da177e4	408	{
4be44fcd LB	409	struct acpi_namespace_node *child_node;
4be44fcd LB	410	struct acpi_namespace_node *deletion_node;
4be44fcd	411	struct acpi_namespace_node *parent_node;
f6dd9221 BM	412	u32 level;
f6dd9221 BM	413	acpi_status status;
1da177e4	414
b229cf92	415	ACPI_FUNCTION_TRACE_U32(ns_delete_namespace_by_owner, owner_id);
1da177e4	416
0c9938cc RM	417	if (owner_id == 0) {
	418	return_VOID;
	419	}
	420
f6dd9221 BM	421	/* Lock namespace for possible update */
	422
	423	status = acpi_ut_acquire_mutex(ACPI_MTX_NAMESPACE);
	424	if (ACPI_FAILURE(status)) {
	425	return_VOID;
	426	}
	427
61686124	428	deletion_node = NULL;
4be44fcd LB	429	parent_node = acpi_gbl_root_node;
4be44fcd LB	430	child_node = NULL;
4be44fcd	431	level = 1;
1da177e4 LT	432
	433	/*
	434	* Traverse the tree of nodes until we bubble back up
	435	* to where we started.
	436	*/
	437	while (level > 0) {
	438	/*
	439	* Get the next child of this parent node. When child_node is NULL,
	440	* the first child of the parent is returned
	441	*/
8c725bf9	442	child_node = acpi_ns_get_next_node(parent_node, child_node);
1da177e4 LT	443
1da177e4 LT	444	if (deletion_node) {
61686124	445	acpi_ns_delete_children(deletion_node);
8e4319c4	446	acpi_ns_remove_node(deletion_node);
1da177e4 LT	447	deletion_node = NULL;
	448	}
	449
	450	if (child_node) {
	451	if (child_node->owner_id == owner_id) {
52fc0b02	452
1da177e4 LT	453	/* Found a matching child node - detach any attached object */
1da177e4 LT	454
4be44fcd	455	acpi_ns_detach_object(child_node);
1da177e4 LT	456	}
	457
	458	/* Check if this node has any children */
	459
8c725bf9	460	if (child_node->child) {
1da177e4 LT	461	/*
	462	* There is at least one child of this node,
	463	* visit the node
	464	*/
	465	level++;
	466	parent_node = child_node;
	467	child_node = NULL;
4be44fcd	468	} else if (child_node->owner_id == owner_id) {
1da177e4 LT	469	deletion_node = child_node;
1da177e4 LT	470	}
4be44fcd	471	} else {
1da177e4 LT	472	/*
	473	* No more children of this parent node.
	474	* Move up to the grandparent.
	475	*/
	476	level--;
	477	if (level != 0) {
	478	if (parent_node->owner_id == owner_id) {
	479	deletion_node = parent_node;
	480	}
	481	}
	482
	483	/* New "last child" is this parent node */
	484
	485	child_node = parent_node;
	486
	487	/* Move up the tree to the grandparent */
	488
c45b5c09	489	parent_node = parent_node->parent;
1da177e4 LT	490	}
	491	}
	492
f6dd9221	493	(void)acpi_ut_release_mutex(ACPI_MTX_NAMESPACE);
1da177e4 LT	494	return_VOID;
1da177e4 LT	495	}