2005-04-17 02:20:36 +04:00
/******************************************************************************
*
* Module Name : pswalk - Parser routines to walk parsed op tree ( s )
*
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*
2006-01-14 00:22:00 +03:00
* Copyright ( C ) 2000 - 2006 , R . Byron Moore
2005-04-17 02:20:36 +04:00
* 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 <acpi/acparser.h>
# define _COMPONENT ACPI_PARSER
2005-08-05 08:44:28 +04:00
ACPI_MODULE_NAME ( " pswalk " )
2005-04-17 02:20:36 +04:00
/*******************************************************************************
*
* FUNCTION : acpi_ps_delete_parse_tree
*
* PARAMETERS : subtree_root - Root of tree ( or subtree ) to delete
*
* RETURN : None
*
* DESCRIPTION : Delete a portion of or an entire parse tree .
*
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2005-08-05 08:44:28 +04:00
void acpi_ps_delete_parse_tree ( union acpi_parse_object * subtree_root )
2005-04-17 02:20:36 +04:00
{
2005-08-05 08:44:28 +04:00
union acpi_parse_object * op = subtree_root ;
union acpi_parse_object * next = NULL ;
union acpi_parse_object * parent = NULL ;
2005-04-17 02:20:36 +04:00
2005-08-05 08:44:28 +04:00
ACPI_FUNCTION_TRACE_PTR ( " ps_delete_parse_tree " , subtree_root ) ;
2005-04-17 02:20:36 +04:00
/* Visit all nodes in the subtree */
while ( op ) {
2006-10-02 08:00:00 +04:00
2005-04-17 02:20:36 +04:00
/* Check if we are not ascending */
if ( op ! = parent ) {
2006-10-02 08:00:00 +04:00
2005-04-17 02:20:36 +04:00
/* Look for an argument or child of the current op */
2005-08-05 08:44:28 +04:00
next = acpi_ps_get_arg ( op , 0 ) ;
2005-04-17 02:20:36 +04:00
if ( next ) {
2006-10-02 08:00:00 +04:00
2005-04-17 02:20:36 +04:00
/* Still going downward in tree (Op is not completed yet) */
op = next ;
continue ;
}
}
2005-04-19 06:49:35 +04:00
/* No more children, this Op is complete. */
2005-04-17 02:20:36 +04:00
next = op - > common . next ;
parent = op - > common . parent ;
2005-08-05 08:44:28 +04:00
acpi_ps_free_op ( op ) ;
2005-04-17 02:20:36 +04:00
2005-04-19 06:49:35 +04:00
/* If we are back to the starting point, the walk is complete. */
2005-04-17 02:20:36 +04:00
if ( op = = subtree_root ) {
return_VOID ;
}
if ( next ) {
op = next ;
2005-08-05 08:44:28 +04:00
} else {
2005-04-17 02:20:36 +04:00
op = parent ;
}
}
2005-04-19 06:49:35 +04:00
2005-04-17 02:20:36 +04:00
return_VOID ;
}