Subversion Repositories Kolibri OS

 *

 * Module Name: asltree - parse tree management

 *

 *****************************************************************************/

 *

 * 1. Copyright Notice

 *

 * Some or all of this work - Copyright (c) 1999 - 2011, Intel Corp.

 * All rights reserved.

 *

 * 2. License

 *

 * 2.1. This is your license from Intel Corp. under its intellectual property

 * rights.  You may have additional license terms from the party that provided

 * you this software, covering your right to use that party's intellectual

 * property rights.

 *

 * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a

 * copy of the source code appearing in this file ("Covered Code") an

 * irrevocable, perpetual, worldwide license under Intel's copyrights in the

 * base code distributed originally by Intel ("Original Intel Code") to copy,

 * make derivatives, distribute, use and display any portion of the Covered

 * Code in any form, with the right to sublicense such rights; and

 *

 * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent

 * license (with the right to sublicense), under only those claims of Intel

 * patents that are infringed by the Original Intel Code, to make, use, sell,

 * offer to sell, and import the Covered Code and derivative works thereof

 * solely to the minimum extent necessary to exercise the above copyright

 * license, and in no event shall the patent license extend to any additions

 * to or modifications of the Original Intel Code.  No other license or right

 * is granted directly or by implication, estoppel or otherwise;

 *

 * The above copyright and patent license is granted only if the following

 * conditions are met:

 *

 * 3. Conditions

 *

 * 3.1. Redistribution of Source with Rights to Further Distribute Source.

 * Redistribution of source code of any substantial portion of the Covered

 * Code or modification with rights to further distribute source must include

 * the above Copyright Notice, the above License, this list of Conditions,

 * and the following Disclaimer and Export Compliance provision.  In addition,

 * Licensee must cause all Covered Code to which Licensee contributes to

 * contain a file documenting the changes Licensee made to create that Covered

 * Code and the date of any change.  Licensee must include in that file the

 * documentation of any changes made by any predecessor Licensee.  Licensee

 * must include a prominent statement that the modification is derived,

 * directly or indirectly, from Original Intel Code.

 *

 * 3.2. Redistribution of Source with no Rights to Further Distribute Source.

 * Redistribution of source code of any substantial portion of the Covered

 * Code or modification without rights to further distribute source must

 * include the following Disclaimer and Export Compliance provision in the

 * documentation and/or other materials provided with distribution.  In

 * addition, Licensee may not authorize further sublicense of source of any

 * portion of the Covered Code, and must include terms to the effect that the

 * license from Licensee to its licensee is limited to the intellectual

 * property embodied in the software Licensee provides to its licensee, and

 * not to intellectual property embodied in modifications its licensee may

 * make.

 *

 * 3.3. Redistribution of Executable. Redistribution in executable form of any

 * substantial portion of the Covered Code or modification must reproduce the

 * above Copyright Notice, and the following Disclaimer and Export Compliance

 * provision in the documentation and/or other materials provided with the

 * distribution.

 *

 * 3.4. Intel retains all right, title, and interest in and to the Original

 * Intel Code.

 *

 * 3.5. Neither the name Intel nor any other trademark owned or controlled by

 * Intel shall be used in advertising or otherwise to promote the sale, use or

 * other dealings in products derived from or relating to the Covered Code

 * without prior written authorization from Intel.

 *

 * 4. Disclaimer and Export Compliance

 *

 * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED

 * HERE.  ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE

 * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT,  ASSISTANCE,

 * INSTALLATION, TRAINING OR OTHER SERVICES.  INTEL WILL NOT PROVIDE ANY

 * UPDATES, ENHANCEMENTS OR EXTENSIONS.  INTEL SPECIFICALLY DISCLAIMS ANY

 * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A

 * PARTICULAR PURPOSE.

 *

 * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES

 * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR

 * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT,

 * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY

 * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL

 * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES.  THESE LIMITATIONS

 * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY

 * LIMITED REMEDY.

 *

 * 4.3. Licensee shall not export, either directly or indirectly, any of this

 * software or system incorporating such software without first obtaining any

 * required license or other approval from the U. S. Department of Commerce or

 * any other agency or department of the United States Government.  In the

 * event Licensee exports any such software from the United States or

 * re-exports any such software from a foreign destination, Licensee shall

 * ensure that the distribution and export/re-export of the software is in

 * compliance with all laws, regulations, orders, or other restrictions of the

 * U.S. Export Administration Regulations. Licensee agrees that neither it nor

 * any of its subsidiaries will export/re-export any technical data, process,

 * software, or service, directly or indirectly, to any country for which the

 * United States government or any agency thereof requires an export license,

 * other governmental approval, or letter of assurance, without first obtaining

 * such license, approval or letter.

 *

 *****************************************************************************/

#include "aslcompiler.y.h"

#include 

        ACPI_MODULE_NAME    ("asltree")

TrGetNextNode (

    void);

TrGetNodeFlagName (

    UINT32                  Flags);

 *

 * FUNCTION:    TrGetNextNode

 *

 * PARAMETERS:  None

 *

 * RETURN:      New parse node.  Aborts on allocation failure

 *

 * DESCRIPTION: Allocate a new parse node for the parse tree.  Bypass the local

 *              dynamic memory manager for performance reasons (This has a

 *              major impact on the speed of the compiler.)

 *

 ******************************************************************************/

TrGetNextNode (

    void)

{

    {

        Gbl_NodeCacheNext = UtLocalCalloc (sizeof (ACPI_PARSE_OBJECT) *

                                ASL_NODE_CACHE_SIZE);

        Gbl_NodeCacheLast = Gbl_NodeCacheNext + ASL_NODE_CACHE_SIZE;

    }

}

 *

 * FUNCTION:    TrAllocateNode

 *

 * PARAMETERS:  ParseOpcode         - Opcode to be assigned to the node

 *

 * RETURN:      New parse node.  Aborts on allocation failure

 *

 * DESCRIPTION: Allocate and initialize a new parse node for the parse tree

 *

 ******************************************************************************/

TrAllocateNode (

    UINT32                  ParseOpcode)

{

    ACPI_PARSE_OBJECT       *Op;

    Op->Asl.Filename          = Gbl_Files[ASL_FILE_INPUT].Filename;

    Op->Asl.LineNumber        = Gbl_CurrentLineNumber;

    Op->Asl.LogicalLineNumber = Gbl_LogicalLineNumber;

    Op->Asl.LogicalByteOffset = Gbl_CurrentLineOffset;

    Op->Asl.Column            = Gbl_CurrentColumn;

    return Op;

}

 *

 * FUNCTION:    TrReleaseNode

 *

 * PARAMETERS:  Op            - Op to be released

 *

 * RETURN:      None

 *

 * DESCRIPTION: "release" a node.  In truth, nothing is done since the node

 *              is part of a larger buffer

 *

 ******************************************************************************/

TrReleaseNode (

    ACPI_PARSE_OBJECT       *Op)

{

}

 *

 * FUNCTION:    TrUpdateNode

 *

 * PARAMETERS:  ParseOpcode         - New opcode to be assigned to the node

 *              Op                - An existing parse node

 *

 * RETURN:      The updated node

 *

 * DESCRIPTION: Change the parse opcode assigned to a node.  Usually used to

 *              change an opcode to DEFAULT_ARG so that the node is ignored

 *              during the code generation.  Also used to set generic integers

 *              to a specific size (8, 16, 32, or 64 bits)

 *

 ******************************************************************************/

TrUpdateNode (

    UINT32                  ParseOpcode,

    ACPI_PARSE_OBJECT       *Op)

{

    {

        return NULL;

    }

        "\nUpdateNode: Old - %s, New - %s\n\n",

        UtGetOpName (Op->Asl.ParseOpcode),

        UtGetOpName (ParseOpcode));

    {

        switch (ParseOpcode)

        {

        case PARSEOP_BYTECONST:

            Op->Asl.Value.Integer = 0xFF;

            break;

            Op->Asl.Value.Integer = 0xFFFF;

            break;

            Op->Asl.Value.Integer = 0xFFFFFFFF;

            break;

            /* Don't care about others, don't need to check QWORD */

            break;

        }

    }

    UtSetParseOpName (Op);

     * For the BYTE, WORD, and DWORD constants, make sure that the integer

     * that was passed in will actually fit into the data type

     */

    switch (ParseOpcode)

    {

    case PARSEOP_BYTECONST:

        Op = UtCheckIntegerRange (Op, 0x00, ACPI_UINT8_MAX);

        break;

        Op = UtCheckIntegerRange (Op, 0x00, ACPI_UINT16_MAX);

        break;

        Op = UtCheckIntegerRange (Op, 0x00, ACPI_UINT32_MAX);

        break;

        /* Don't care about others, don't need to check QWORD */

        break;

    }

}

 *

 * FUNCTION:    TrGetNodeFlagName

 *

 * PARAMETERS:  Flags               - Flags word to be decoded

 *

 * RETURN:      Name string. Always returns a valid string pointer.

 *

 * DESCRIPTION: Decode a flags word

 *

 ******************************************************************************/

TrGetNodeFlagName (

    UINT32                  Flags)

{

    {

    case NODE_VISITED:

        return ("NODE_VISITED");

        return ("NODE_AML_PACKAGE");

        return ("NODE_IS_TARGET");

        return ("NODE_IS_RESOURCE_DESC");

        return ("NODE_IS_RESOURCE_FIELD");

        return ("NODE_HAS_NO_EXIT");

        return ("NODE_IF_HAS_NO_EXIT");

        return ("NODE_NAME_INTERNALIZED");

        return ("NODE_METHOD_NO_RETVAL");

        return ("NODE_METHOD_SOME_NO_RETVAL");

        return ("NODE_RESULT_NOT_USED");

        return ("NODE_METHOD_TYPED");

        return ("NODE_IS_BIT_OFFSET");

        return ("NODE_COMPILE_TIME_CONST");

        return ("NODE_IS_TERM_ARG");

        return ("NODE_WAS_ONES_OP");

        return ("NODE_IS_NAME_DECLARATION");

        return ("Multiple Flags (or unknown flag) set");

    }

}

 *

 * FUNCTION:    TrSetNodeFlags

 *

 * PARAMETERS:  Op                  - An existing parse node

 *              Flags               - New flags word

 *

 * RETURN:      The updated parser op

 *

 * DESCRIPTION: Set bits in the node flags word.  Will not clear bits, only set

 *

 ******************************************************************************/

TrSetNodeFlags (

    ACPI_PARSE_OBJECT       *Op,

    UINT32                  Flags)

{

        "\nSetNodeFlags: Op %p, %8.8X %s\n\n", Op, Flags,

        TrGetNodeFlagName (Flags));

    {

        return NULL;

    }

}

 *

 * FUNCTION:    TrSetEndLineNumber

 *

 * PARAMETERS:  Op                - An existing parse node

 *

 * RETURN:      None.

 *

 * DESCRIPTION: Set the ending line numbers (file line and logical line) of a

 *              parse node to the current line numbers.

 *

 ******************************************************************************/

TrSetEndLineNumber (

    ACPI_PARSE_OBJECT       *Op)

{

    {

        return;

    }

    Op->Asl.EndLogicalLine = Gbl_LogicalLineNumber;

}

 *

 * FUNCTION:    TrCreateLeafNode

 *

 * PARAMETERS:  ParseOpcode         - New opcode to be assigned to the node

 *

 * RETURN:      Pointer to the new node.  Aborts on allocation failure

 *

 * DESCRIPTION: Create a simple leaf node (no children or peers, and no value

 *              assigned to the node)

 *

 ******************************************************************************/

TrCreateLeafNode (

    UINT32                  ParseOpcode)

{

    ACPI_PARSE_OBJECT       *Op;

        "\nCreateLeafNode  Ln/Col %u/%u NewNode %p  Op %s\n\n",

        Op->Asl.LineNumber, Op->Asl.Column, Op, UtGetOpName(ParseOpcode));

}

 *

 * FUNCTION:    TrCreateConstantLeafNode

 *

 * PARAMETERS:  ParseOpcode         - The constant opcode

 *

 * RETURN:      Pointer to the new node.  Aborts on allocation failure

 *

 * DESCRIPTION: Create a leaf node (no children or peers) for one of the

 *              special constants - __LINE__, __FILE__, and __DATE__.

 *

 * Note: An implemenation of __FUNC__ cannot happen here because we don't

 * have a full parse tree at this time and cannot find the parent control

 * method. If it is ever needed, __FUNC__ must be implemented later, after

 * the parse tree has been fully constructed.

 *

 ******************************************************************************/

TrCreateConstantLeafNode (

    UINT32                  ParseOpcode)

{

    ACPI_PARSE_OBJECT       *Op = NULL;

    time_t                  CurrentTime;

    char                    *StaticTimeString;

    char                    *TimeString;

    {

    case PARSEOP___LINE__:

        Op = TrAllocateNode (PARSEOP_INTEGER);

        Op->Asl.Value.Integer = Op->Asl.LineNumber;

        break;

        Op = TrAllocateNode (PARSEOP_STRING_LITERAL);

        break;

        Op = TrAllocateNode (PARSEOP_STRING_LITERAL);

        StaticTimeString = ctime (&CurrentTime);

        TimeString = UtLocalCalloc (strlen (StaticTimeString) + 1);

        strcpy (TimeString, StaticTimeString);

        Op->Asl.Value.String = TimeString;

        break;

        return (NULL);

    }

        "\nCreateConstantLeafNode  Ln/Col %u/%u NewNode %p  Op %s  Value %8.8X%8.8X  ",

        Op->Asl.LineNumber, Op->Asl.Column, Op, UtGetOpName (ParseOpcode),

        ACPI_FORMAT_UINT64 (Op->Asl.Value.Integer));

    return (Op);

}

 *

 * FUNCTION:    TrCreateValuedLeafNode

 *

 * PARAMETERS:  ParseOpcode         - New opcode to be assigned to the node

 *              Value               - Value to be assigned to the node

 *

 * RETURN:      Pointer to the new node.  Aborts on allocation failure

 *

 * DESCRIPTION: Create a leaf node (no children or peers) with a value

 *              assigned to it

 *

 ******************************************************************************/

TrCreateValuedLeafNode (

    UINT32                  ParseOpcode,

    UINT64                  Value)

{

    ACPI_PARSE_OBJECT       *Op;

        "\nCreateValuedLeafNode  Ln/Col %u/%u NewNode %p  Op %s  Value %8.8X%8.8X  ",

        Op->Asl.LineNumber, Op->Asl.Column, Op, UtGetOpName(ParseOpcode),

        ACPI_FORMAT_UINT64 (Value));

    Op->Asl.Value.Integer = Value;

    {

    case PARSEOP_STRING_LITERAL:

        DbgPrint (ASL_PARSE_OUTPUT, "STRING->%s", Value);

        break;

        DbgPrint (ASL_PARSE_OUTPUT, "NAMESEG->%s", Value);

        break;

        DbgPrint (ASL_PARSE_OUTPUT, "NAMESTRING->%s", Value);

        break;

        DbgPrint (ASL_PARSE_OUTPUT, "EISAID->%s", Value);

        break;

        DbgPrint (ASL_PARSE_OUTPUT, "METHOD");

        break;

        DbgPrint (ASL_PARSE_OUTPUT, "INTEGER");

        break;

        break;

    }

    return Op;

}

 *

 * FUNCTION:    TrCreateNode

 *

 * PARAMETERS:  ParseOpcode         - Opcode to be assigned to the node

 *              NumChildren         - Number of children to follow

 *              ...                 - A list of child nodes to link to the new

 *                                    node.  NumChildren long.

 *

 * RETURN:      Pointer to the new node.  Aborts on allocation failure

 *

 * DESCRIPTION: Create a new parse node and link together a list of child

 *              nodes underneath the new node.

 *

 ******************************************************************************/

TrCreateNode (

    UINT32                  ParseOpcode,

    UINT32                  NumChildren,

    ...)

{

    ACPI_PARSE_OBJECT       *Op;

    ACPI_PARSE_OBJECT       *Child;

    ACPI_PARSE_OBJECT       *PrevChild;

    va_list                 ap;

    UINT32                  i;

    BOOLEAN                 FirstChild;

        "\nCreateNode  Ln/Col %u/%u NewParent %p Child %u Op %s  ",

        Op->Asl.LineNumber, Op->Asl.Column, Op, NumChildren, UtGetOpName(ParseOpcode));

    {

    case PARSEOP_DEFINITIONBLOCK:

        RootNode = Op;

        DbgPrint (ASL_PARSE_OUTPUT, "DEFINITION_BLOCK (Tree Completed)->");

        break;

        DbgPrint (ASL_PARSE_OUTPUT, "OPREGION->");

        break;

        DbgPrint (ASL_PARSE_OUTPUT, "OR->");

        break;

        /* Nothing to do for other opcodes */

        break;

    }

    FirstChild = TRUE;

    for (i = 0; i < NumChildren; i++)

    {

        /* Get the next child */

        DbgPrint (ASL_PARSE_OUTPUT, "%p, ", Child);

         * If child is NULL, this means that an optional argument

         * was omitted.  We must create a placeholder with a special

         * opcode (DEFAULT_ARG) so that the code generator will know

         * that it must emit the correct default for this argument

         */

        if (!Child)

        {

            Child = TrAllocateNode (PARSEOP_DEFAULT_ARG);

        }

        {

            FirstChild = FALSE;

            Op->Asl.Child = Child;

        }

        {

            PrevChild->Asl.Next = Child;

        };

         * This child might be a list, point all nodes in the list

         * to the same parent

         */

        while (Child->Asl.Next)

        {

            Child = Child->Asl.Next;

            Child->Asl.Parent = Op;

        }

    }

    va_end(ap);

    return Op;

}

 *

 * FUNCTION:    TrLinkChildren

 *

 * PARAMETERS:  Op                - An existing parse node

 *              NumChildren         - Number of children to follow

 *              ...                 - A list of child nodes to link to the new

 *                                    node.  NumChildren long.

 *

 * RETURN:      The updated (linked) node

 *

 * DESCRIPTION: Link a group of nodes to an existing parse node

 *

 ******************************************************************************/

TrLinkChildren (

    ACPI_PARSE_OBJECT       *Op,

    UINT32                  NumChildren,

    ...)

{

    ACPI_PARSE_OBJECT       *Child;

    ACPI_PARSE_OBJECT       *PrevChild;

    va_list                 ap;

    UINT32                  i;

    BOOLEAN                 FirstChild;

        "\nLinkChildren  Line [%u to %u] NewParent %p Child %u Op %s  ",

        Op->Asl.LineNumber, Op->Asl.EndLine,

        Op, NumChildren, UtGetOpName(Op->Asl.ParseOpcode));

    {

    case PARSEOP_DEFINITIONBLOCK:

        RootNode = Op;

        DbgPrint (ASL_PARSE_OUTPUT, "DEFINITION_BLOCK (Tree Completed)->");

        break;

        DbgPrint (ASL_PARSE_OUTPUT, "OPREGION->");

        break;

        DbgPrint (ASL_PARSE_OUTPUT, "OR->");

        break;

        /* Nothing to do for other opcodes */

        break;

    }

    FirstChild = TRUE;

    for (i = 0; i < NumChildren; i++)

    {

        Child = va_arg (ap, ACPI_PARSE_OBJECT *);

        {

            AslError (ASL_WARNING, ASL_MSG_COMPILER_INTERNAL, Child,

                "Child node list invalid");

            return Op;

        }

         * If child is NULL, this means that an optional argument

         * was omitted.  We must create a placeholder with a special

         * opcode (DEFAULT_ARG) so that the code generator will know

         * that it must emit the correct default for this argument

         */

        if (!Child)

        {

            Child = TrAllocateNode (PARSEOP_DEFAULT_ARG);

        }

        {

            FirstChild = FALSE;

            Op->Asl.Child = Child;

        }

        {

            PrevChild->Asl.Next = Child;

        };

         * This child might be a list, point all nodes in the list

         * to the same parent

         */

        while (Child->Asl.Next)

        {

            Child = Child->Asl.Next;

            Child->Asl.Parent = Op;

        }

        PrevChild = Child;

    }

    va_end(ap);

    return Op;

}

 *

 * FUNCTION:    TrLinkPeerNode

 *

 * PARAMETERS:  Op1           - First peer

 *              Op2           - Second peer

 *

 * RETURN:      Op1 or the non-null node.

 *

 * DESCRIPTION: Link two nodes as peers.  Handles cases where one peer is null.

 *

 ******************************************************************************/

TrLinkPeerNode (

    ACPI_PARSE_OBJECT       *Op1,

    ACPI_PARSE_OBJECT       *Op2)

{

    ACPI_PARSE_OBJECT       *Next;

        "\nLinkPeerNode: 1=%p (%s), 2=%p (%s)\n\n",

        Op1, Op1 ? UtGetOpName(Op1->Asl.ParseOpcode) : NULL,

        Op2, Op2 ? UtGetOpName(Op2->Asl.ParseOpcode) : NULL);

    {

        DbgPrint (ASL_PARSE_OUTPUT, "\nTwo Null nodes!\n");

        return Op1;

    }

    {

        return Op1;

    }

    {

        return Op2;

    }

    {

        DbgPrint (ASL_DEBUG_OUTPUT,

            "\n\n************* Internal error, linking node to itself %p\n\n\n",

            Op1);

        AslError (ASL_WARNING, ASL_MSG_COMPILER_INTERNAL, Op1,

            "Linking node to itself");

        return Op1;

    }

     * Op 1 may already have a peer list (such as an IF/ELSE pair),

     * so we must walk to the end of the list and attach the new

     * peer at the end

     */

    Next = Op1;

    while (Next->Asl.Next)

    {

        Next = Next->Asl.Next;

    }

    return Op1;

}

 *

 * FUNCTION:    TrLinkPeerNodes

 *

 * PARAMETERS:  NumPeers            - The number of nodes in the list to follow

 *              ...                 - A list of nodes to link together as peers

 *

 * RETURN:      The first node in the list (head of the peer list)

 *

 * DESCRIPTION: Link together an arbitrary number of peer nodes.

 *

 ******************************************************************************/

TrLinkPeerNodes (

    UINT32                  NumPeers,

    ...)

{

    ACPI_PARSE_OBJECT       *This;

    ACPI_PARSE_OBJECT       *Next;

    va_list                 ap;

    UINT32                  i;

    ACPI_PARSE_OBJECT       *Start;

        "\nLinkPeerNodes: (%u) ", NumPeers);

    This = va_arg (ap, ACPI_PARSE_OBJECT *);

    Start = This;

     * Link all peers

     */

    for (i = 0; i < (NumPeers -1); i++)

    {

        DbgPrint (ASL_PARSE_OUTPUT, "%u=%p ", (i+1), This);

        {

            This = This->Asl.Next;

        }

        if (!Next)

        {

            Next = TrAllocateNode (PARSEOP_DEFAULT_ARG);

        }

        This = Next;

    }

    va_end (ap);

    return (Start);

}

 *

 * FUNCTION:    TrLinkChildNode

 *

 * PARAMETERS:  Op1           - Parent node

 *              Op2           - Op to become a child

 *

 * RETURN:      The parent node

 *

 * DESCRIPTION: Link two nodes together as a parent and child

 *

 ******************************************************************************/

TrLinkChildNode (

    ACPI_PARSE_OBJECT       *Op1,

    ACPI_PARSE_OBJECT       *Op2)

{

    ACPI_PARSE_OBJECT       *Next;

        "\nLinkChildNode: Parent=%p (%s), Child=%p (%s)\n\n",

        Op1, Op1 ? UtGetOpName(Op1->Asl.ParseOpcode): NULL,

        Op2, Op2 ? UtGetOpName(Op2->Asl.ParseOpcode): NULL);

    {

        return Op1;

    }

    while (Next)

    {

        Next->Asl.Parent = Op1;

        Next = Next->Asl.Next;

    }

}

 *

 * FUNCTION:    TrWalkParseTree

 *

 * PARAMETERS:  Visitation              - Type of walk

 *              DescendingCallback      - Called during tree descent

 *              AscendingCallback       - Called during tree ascent

 *              Context                 - To be passed to the callbacks

 *

 * RETURN:      Status from callback(s)

 *

 * DESCRIPTION: Walk the entire parse tree.

 *

 ******************************************************************************/

TrWalkParseTree (

    ACPI_PARSE_OBJECT       *Op,

    UINT32                  Visitation,

    ASL_WALK_CALLBACK       DescendingCallback,

    ASL_WALK_CALLBACK       AscendingCallback,

    void                    *Context)

{

    UINT32                  Level;

    BOOLEAN                 NodePreviouslyVisited;

    ACPI_PARSE_OBJECT       *StartOp = Op;

    ACPI_STATUS             Status;

    {

        return (AE_OK);

    }

    NodePreviouslyVisited = FALSE;

    {

    case ASL_WALK_VISIT_DOWNWARD:

        {

            if (!NodePreviouslyVisited)

            {

                /* Let the callback process the node. */

                if (ACPI_SUCCESS (Status))

                {

                    /* Visit children first, once */

                    {

                        Level++;

                        Op = Op->Asl.Child;

                        continue;

                    }

                }

                else if (Status != AE_CTRL_DEPTH)

                {

                    /* Exit immediately on any error */

                }

            }

            {

                break;

            }

            {

                Op = Op->Asl.Next;

                NodePreviouslyVisited = FALSE;

            }

            else

            {

                /* No children or peers, re-visit parent */

                {

                    Level--;

                }

                Op = Op->Asl.Parent;

                NodePreviouslyVisited = TRUE;