44f6c01242
Fixed three cases in the interpreter where an "index" argument to an ASL function was still (internally) 32 bits instead of the required 64 bits. This was the Index argument to the Index, Mid, and Match operators. The "strupr" function is now permanently local (acpi_ut_strupr), since this is not a POSIX-defined function and not present in most kernel-level C libraries. References to the C library strupr function have been removed from the headers. Completed the deployment of static functions/prototypes. All prototypes with the static attribute have been moved from the headers to the owning C file. ACPICA 20050329 from Bob Moore An error is now generated if an attempt is made to create a Buffer Field of length zero (A CreateField with a length operand of zero.) The interpreter now issues a warning whenever executable code at the module level is detected during ACPI table load. This will give some idea of the prevalence of this type of code. Implemented support for references to named objects (other than control methods) within package objects. Enhanced package object output for the debug object. Package objects are now completely dumped, showing all elements. Enhanced miscellaneous object output for the debug object. Any object can now be written to the debug object (for example, a device object can be written, and the type of the object will be displayed.) The "static" qualifier has been added to all local functions across the core subsystem. The number of "long" lines (> 80 chars) within the source has been significantly reduced, by about 1/3. Cleaned up all header files to ensure that all CA/iASL functions are prototyped (even static functions) and the formatting is consistent. Two new header files have been added, acopcode.h and acnames.h. Removed several obsolete functions that were no longer used. Signed-off-by: Len Brown <len.brown@intel.com>
114 lines
3.5 KiB
C
114 lines
3.5 KiB
C
/******************************************************************************
|
|
*
|
|
* Module Name: pswalk - Parser routines to walk parsed op tree(s)
|
|
*
|
|
*****************************************************************************/
|
|
|
|
/*
|
|
* Copyright (C) 2000 - 2005, R. Byron Moore
|
|
* 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
|
|
ACPI_MODULE_NAME ("pswalk")
|
|
|
|
|
|
/*******************************************************************************
|
|
*
|
|
* 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.
|
|
*
|
|
******************************************************************************/
|
|
|
|
void
|
|
acpi_ps_delete_parse_tree (
|
|
union acpi_parse_object *subtree_root)
|
|
{
|
|
union acpi_parse_object *op = subtree_root;
|
|
union acpi_parse_object *next = NULL;
|
|
union acpi_parse_object *parent = NULL;
|
|
|
|
|
|
ACPI_FUNCTION_TRACE_PTR ("ps_delete_parse_tree", subtree_root);
|
|
|
|
|
|
/* Visit all nodes in the subtree */
|
|
|
|
while (op) {
|
|
/* Check if we are not ascending */
|
|
|
|
if (op != parent) {
|
|
/* Look for an argument or child of the current op */
|
|
|
|
next = acpi_ps_get_arg (op, 0);
|
|
if (next) {
|
|
/* Still going downward in tree (Op is not completed yet) */
|
|
|
|
op = next;
|
|
continue;
|
|
}
|
|
}
|
|
|
|
/* No more children, this Op is complete. */
|
|
|
|
next = op->common.next;
|
|
parent = op->common.parent;
|
|
|
|
acpi_ps_free_op (op);
|
|
|
|
/* If we are back to the starting point, the walk is complete. */
|
|
|
|
if (op == subtree_root) {
|
|
return_VOID;
|
|
}
|
|
if (next) {
|
|
op = next;
|
|
}
|
|
else {
|
|
op = parent;
|
|
}
|
|
}
|
|
|
|
return_VOID;
|
|
}
|