#endif 
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;#ifdef ACPI_ALPHABETIC_NAMESPACE	struct acpi_namespace_node      *previous_child_node;#endif	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 {#ifdef ACPI_ALPHABETIC_NAMESPACE		/*		 * Walk the list whilst searching for the correct		 * alphabetic placement.		 */		previous_child_node = NULL;		while (acpi_ns_compare_names (acpi_ut_get_node_name (child_node),				 acpi_ut_get_node_name (node)) < 0) {			if (child_node->flags & ANOBJ_END_OF_PEER_LIST) {				/* Last peer;  Clear end-of-list flag */				child_node->flags &= ~ANOBJ_END_OF_PEER_LIST;				/* This node is the new peer to the child node */				child_node->peer = node;				/* This node is the new end-of-list */				node->flags |= ANOBJ_END_OF_PEER_LIST;				node->peer = parent_node;				break;			}			/* Get next peer */			previous_child_node = child_node;			child_node = child_node->peer;		}		/* Did the node get inserted at the end-of-list? */		if (!(node->flags & ANOBJ_END_OF_PEER_LIST)) {			/*			 * Loop above terminated without reaching the end-of-list.			 * Insert the new node at the current location			 */			if (previous_child_node) {				/* Insert node alphabetically */				node->peer = child_node;				previous_child_node->peer = node;			}			else {				/* Insert node alphabetically at start of list */				node->peer = child_node;				parent_node->child = 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;#endif	}	/* 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));	/*	 * Increment the reference count(s) of all parents up to	 * the root!	 */	while ((node = acpi_ns_get_parent_node (node)) != NULL) {		node->reference_count++;	}	return_VOID;}
4520	/local/tlutelli/issta_data/temp/c/2005_temp/2005/4520/0c9938cc75057c0fca1af55a55dcfc2842436695/nsalloc.c/clean/drivers/acpi/namespace/nsalloc.c