[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);

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

		if ((walk_state->method_desc) &&
		    (parent_node != walk_state->method_node)) {
			/*
			 * A method is creating a new node that is not a child of the
			 * method (it is non-local). Mark the executing method as having
			 * modified the namespace. This is used for cleanup when the
			 * method exits.
			 */
			walk_state->method_desc->method.flags |=
			    AOPOBJ_MODIFIED_NAMESPACE;
		}
	}

	/* 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	221
1da177e4	222	if (walk_state) {
a9fc0312 AS	223	/*
	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	*/
1da177e4	227	owner_id = walk_state->owner_id;
a9fc0312 AS	228
	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	*/
	237	walk_state->method_desc->method.flags \|=
	238	AOPOBJ_MODIFIED_NAMESPACE;
	239	}
1da177e4 LT	240	}
	241
	242	/* Link the new entry into the parent and existing children */
	243
c45b5c09 AS	244	node->peer = NULL;
c45b5c09 AS	245	node->parent = parent_node;
1da177e4	246	child_node = parent_node->child;
c45b5c09	247
1da177e4 LT	248	if (!child_node) {
1da177e4 LT	249	parent_node->child = node;
4be44fcd	250	} else {
c45b5c09 AS	251	/* Add node to the end of the peer list */
	252
	253	while (child_node->peer) {
1da177e4 LT	254	child_node = child_node->peer;
	255	}
	256
	257	child_node->peer = node;
1da177e4 LT	258	}
	259
	260	/* Init the new entry */
	261
	262	node->owner_id = owner_id;
	263	node->type = (u8) type;
	264
4be44fcd LB	265	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));
793c2388 BM	272
793c2388 BM	273	return_VOID;
1da177e4 LT	274	}
1da177e4 LT	275
1da177e4 LT	276	/*******************************************************************************
	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
4be44fcd	289	void acpi_ns_delete_children(struct acpi_namespace_node *parent_node)
1da177e4	290	{
4be44fcd	291	struct acpi_namespace_node *next_node;
c45b5c09	292	struct acpi_namespace_node *node_to_delete;
1da177e4	293
b229cf92	294	ACPI_FUNCTION_TRACE_PTR(ns_delete_children, parent_node);
1da177e4 LT	295
	296	if (!parent_node) {
	297	return_VOID;
	298	}
	299
d4913dc6 BM	300	/* Deallocate all children at this level */
d4913dc6 BM	301
c45b5c09 AS	302	next_node = parent_node->child;
c45b5c09 AS	303	while (next_node) {
1da177e4 LT	304
	305	/* Grandchildren should have all been deleted already */
	306
c45b5c09	307	if (next_node->child) {
b8e4d893	308	ACPI_ERROR((AE_INFO, "Found a grandchild! P=%p C=%p",
c45b5c09	309	parent_node, next_node));
1da177e4 LT	310	}
1da177e4 LT	311
8e4319c4 BM	312	/*
	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	*/
c45b5c09 AS	316	node_to_delete = next_node;
	317	next_node = next_node->peer;
	318	acpi_ns_delete_node(node_to_delete);
	319	};
1da177e4	320
1da177e4 LT	321	/* Clear the parent's child pointer */
	322
	323	parent_node->child = NULL;
1da177e4 LT	324	return_VOID;
	325	}
	326
1da177e4 LT	327	/*******************************************************************************
	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	*
	335	* DESCRIPTION: Delete a subtree of the namespace. This includes all objects
	336	* stored within the subtree.
	337	*
	338	******************************************************************************/
	339
4be44fcd	340	void acpi_ns_delete_namespace_subtree(struct acpi_namespace_node *parent_node)
1da177e4	341	{
4be44fcd LB	342	struct acpi_namespace_node *child_node = NULL;
4be44fcd LB	343	u32 level = 1;
1da177e4	344
b229cf92	345	ACPI_FUNCTION_TRACE(ns_delete_namespace_subtree);
1da177e4 LT	346
	347	if (!parent_node) {
	348	return_VOID;
	349	}
	350
	351	/*
	352	* Traverse the tree of objects until we bubble back up
	353	* to where we started.
	354	*/
	355	while (level > 0) {
52fc0b02	356
1da177e4 LT	357	/* Get the next node in this scope (NULL if none) */
1da177e4 LT	358
8c725bf9	359	child_node = acpi_ns_get_next_node(parent_node, child_node);
1da177e4	360	if (child_node) {
52fc0b02	361
1da177e4 LT	362	/* Found a child node - detach any attached object */
1da177e4 LT	363
4be44fcd	364	acpi_ns_detach_object(child_node);
1da177e4 LT	365
	366	/* Check if this node has any children */
	367
8c725bf9	368	if (child_node->child) {
1da177e4 LT	369	/*
	370	* There is at least one child of this node,
	371	* visit the node
	372	*/
	373	level++;
	374	parent_node = child_node;
	375	child_node = NULL;
	376	}
4be44fcd	377	} else {
1da177e4 LT	378	/*
	379	* No more children of this parent node.
	380	* Move up to the grandparent.
	381	*/
	382	level--;
	383
	384	/*
	385	* Now delete all of the children of this parent
	386	* all at the same time.
	387	*/
4be44fcd	388	acpi_ns_delete_children(parent_node);
1da177e4 LT	389
	390	/* New "last child" is this parent node */
	391
	392	child_node = parent_node;
	393
	394	/* Move up the tree to the grandparent */
	395
c45b5c09	396	parent_node = parent_node->parent;
1da177e4 LT	397	}
	398	}
	399
	400	return_VOID;
	401	}
	402
1da177e4 LT	403	/*******************************************************************************
	404	*
	405	* FUNCTION: acpi_ns_delete_namespace_by_owner
	406	*
	407	* PARAMETERS: owner_id - All nodes with this owner will be deleted
	408	*
	409	* RETURN: Status
	410	*
	411	* DESCRIPTION: Delete entries within the namespace that are owned by a
	412	* specific ID. Used to delete entire ACPI tables. All
	413	* reference counts are updated.
	414	*
f6dd9221 BM	415	* MUTEX: Locks namespace during deletion walk.
f6dd9221 BM	416	*
1da177e4 LT	417	******************************************************************************/
1da177e4 LT	418
4be44fcd	419	void acpi_ns_delete_namespace_by_owner(acpi_owner_id owner_id)
1da177e4	420	{
4be44fcd LB	421	struct acpi_namespace_node *child_node;
4be44fcd LB	422	struct acpi_namespace_node *deletion_node;
4be44fcd	423	struct acpi_namespace_node *parent_node;
f6dd9221 BM	424	u32 level;
f6dd9221 BM	425	acpi_status status;
1da177e4	426
b229cf92	427	ACPI_FUNCTION_TRACE_U32(ns_delete_namespace_by_owner, owner_id);
1da177e4	428
0c9938cc RM	429	if (owner_id == 0) {
	430	return_VOID;
	431	}
	432
f6dd9221 BM	433	/* Lock namespace for possible update */
	434
	435	status = acpi_ut_acquire_mutex(ACPI_MTX_NAMESPACE);
	436	if (ACPI_FAILURE(status)) {
	437	return_VOID;
	438	}
	439
61686124	440	deletion_node = NULL;
4be44fcd LB	441	parent_node = acpi_gbl_root_node;
4be44fcd LB	442	child_node = NULL;
4be44fcd	443	level = 1;
1da177e4 LT	444
	445	/*
	446	* Traverse the tree of nodes until we bubble back up
	447	* to where we started.
	448	*/
	449	while (level > 0) {
	450	/*
	451	* Get the next child of this parent node. When child_node is NULL,
	452	* the first child of the parent is returned
	453	*/
8c725bf9	454	child_node = acpi_ns_get_next_node(parent_node, child_node);
1da177e4 LT	455
1da177e4 LT	456	if (deletion_node) {
61686124	457	acpi_ns_delete_children(deletion_node);
8e4319c4	458	acpi_ns_remove_node(deletion_node);
1da177e4 LT	459	deletion_node = NULL;
	460	}
	461
	462	if (child_node) {
	463	if (child_node->owner_id == owner_id) {
52fc0b02	464
1da177e4 LT	465	/* Found a matching child node - detach any attached object */
1da177e4 LT	466
4be44fcd	467	acpi_ns_detach_object(child_node);
1da177e4 LT	468	}
	469
	470	/* Check if this node has any children */
	471
8c725bf9	472	if (child_node->child) {
1da177e4 LT	473	/*
	474	* There is at least one child of this node,
	475	* visit the node
	476	*/
	477	level++;
	478	parent_node = child_node;
	479	child_node = NULL;
4be44fcd	480	} else if (child_node->owner_id == owner_id) {
1da177e4 LT	481	deletion_node = child_node;
1da177e4 LT	482	}
4be44fcd	483	} else {
1da177e4 LT	484	/*
	485	* No more children of this parent node.
	486	* Move up to the grandparent.
	487	*/
	488	level--;
	489	if (level != 0) {
	490	if (parent_node->owner_id == owner_id) {
	491	deletion_node = parent_node;
	492	}
	493	}
	494
	495	/* New "last child" is this parent node */
	496
	497	child_node = parent_node;
	498
	499	/* Move up the tree to the grandparent */
	500
c45b5c09	501	parent_node = parent_node->parent;
1da177e4 LT	502	}
	503	}
	504
f6dd9221	505	(void)acpi_ut_release_mutex(ACPI_MTX_NAMESPACE);
1da177e4 LT	506	return_VOID;
1da177e4 LT	507	}