2 /******************************************************************************
4 * Module Name: asltransform - Parse tree transforms
6 *****************************************************************************/
8 /******************************************************************************
12 * Some or all of this work - Copyright (c) 1999 - 2010, Intel Corp.
13 * All rights reserved.
17 * 2.1. This is your license from Intel Corp. under its intellectual property
18 * rights. You may have additional license terms from the party that provided
19 * you this software, covering your right to use that party's intellectual
22 * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a
23 * copy of the source code appearing in this file ("Covered Code") an
24 * irrevocable, perpetual, worldwide license under Intel's copyrights in the
25 * base code distributed originally by Intel ("Original Intel Code") to copy,
26 * make derivatives, distribute, use and display any portion of the Covered
27 * Code in any form, with the right to sublicense such rights; and
29 * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent
30 * license (with the right to sublicense), under only those claims of Intel
31 * patents that are infringed by the Original Intel Code, to make, use, sell,
32 * offer to sell, and import the Covered Code and derivative works thereof
33 * solely to the minimum extent necessary to exercise the above copyright
34 * license, and in no event shall the patent license extend to any additions
35 * to or modifications of the Original Intel Code. No other license or right
36 * is granted directly or by implication, estoppel or otherwise;
38 * The above copyright and patent license is granted only if the following
43 * 3.1. Redistribution of Source with Rights to Further Distribute Source.
44 * Redistribution of source code of any substantial portion of the Covered
45 * Code or modification with rights to further distribute source must include
46 * the above Copyright Notice, the above License, this list of Conditions,
47 * and the following Disclaimer and Export Compliance provision. In addition,
48 * Licensee must cause all Covered Code to which Licensee contributes to
49 * contain a file documenting the changes Licensee made to create that Covered
50 * Code and the date of any change. Licensee must include in that file the
51 * documentation of any changes made by any predecessor Licensee. Licensee
52 * must include a prominent statement that the modification is derived,
53 * directly or indirectly, from Original Intel Code.
55 * 3.2. Redistribution of Source with no Rights to Further Distribute Source.
56 * Redistribution of source code of any substantial portion of the Covered
57 * Code or modification without rights to further distribute source must
58 * include the following Disclaimer and Export Compliance provision in the
59 * documentation and/or other materials provided with distribution. In
60 * addition, Licensee may not authorize further sublicense of source of any
61 * portion of the Covered Code, and must include terms to the effect that the
62 * license from Licensee to its licensee is limited to the intellectual
63 * property embodied in the software Licensee provides to its licensee, and
64 * not to intellectual property embodied in modifications its licensee may
67 * 3.3. Redistribution of Executable. Redistribution in executable form of any
68 * substantial portion of the Covered Code or modification must reproduce the
69 * above Copyright Notice, and the following Disclaimer and Export Compliance
70 * provision in the documentation and/or other materials provided with the
73 * 3.4. Intel retains all right, title, and interest in and to the Original
76 * 3.5. Neither the name Intel nor any other trademark owned or controlled by
77 * Intel shall be used in advertising or otherwise to promote the sale, use or
78 * other dealings in products derived from or relating to the Covered Code
79 * without prior written authorization from Intel.
81 * 4. Disclaimer and Export Compliance
83 * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED
84 * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE
85 * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE,
86 * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY
87 * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY
88 * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A
91 * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES
92 * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR
93 * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT,
94 * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY
95 * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL
96 * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS
97 * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY
100 * 4.3. Licensee shall not export, either directly or indirectly, any of this
101 * software or system incorporating such software without first obtaining any
102 * required license or other approval from the U. S. Department of Commerce or
103 * any other agency or department of the United States Government. In the
104 * event Licensee exports any such software from the United States or
105 * re-exports any such software from a foreign destination, Licensee shall
106 * ensure that the distribution and export/re-export of the software is in
107 * compliance with all laws, regulations, orders, or other restrictions of the
108 * U.S. Export Administration Regulations. Licensee agrees that neither it nor
109 * any of its subsidiaries will export/re-export any technical data, process,
110 * software, or service, directly or indirectly, to any country for which the
111 * United States government or any agency thereof requires an export license,
112 * other governmental approval, or letter of assurance, without first obtaining
113 * such license, approval or letter.
115 *****************************************************************************/
118 #include <contrib/dev/acpica/compiler/aslcompiler.h>
119 #include "aslcompiler.y.h"
121 #define _COMPONENT ACPI_COMPILER
122 ACPI_MODULE_NAME ("asltransform")
124 /* Local prototypes */
128 ACPI_PARSE_OBJECT *Op);
131 TrAmlGetNextTempName (
132 ACPI_PARSE_OBJECT *Op,
136 TrAmlInitLineNumbers (
137 ACPI_PARSE_OBJECT *Op,
138 ACPI_PARSE_OBJECT *Neighbor);
142 ACPI_PARSE_OBJECT *Op,
146 TrAmlSetSubtreeParent (
147 ACPI_PARSE_OBJECT *Op,
148 ACPI_PARSE_OBJECT *Parent);
152 ACPI_PARSE_OBJECT *Op,
153 ACPI_PARSE_OBJECT *NewPeer);
156 TrDoDefinitionBlock (
157 ACPI_PARSE_OBJECT *Op);
161 ACPI_PARSE_OBJECT *StartNode);
164 /*******************************************************************************
166 * FUNCTION: TrAmlGetNextTempName
168 * PARAMETERS: Op - Current parse op
169 * TempCount - Current temporary counter. Was originally
170 * per-module; Currently per method, could be
171 * expanded to per-scope.
173 * RETURN: A pointer to name (allocated here).
175 * DESCRIPTION: Generate an ACPI name of the form _T_x. These names are
176 * reserved for use by the ASL compiler. (_T_0 through _T_Z)
178 ******************************************************************************/
181 TrAmlGetNextTempName (
182 ACPI_PARSE_OBJECT *Op,
188 if (*TempCount >= (10+26)) /* 0-35 valid: 0-9 and A-Z for TempName[3] */
192 AslError (ASL_ERROR, ASL_MSG_TOO_MANY_TEMPS, Op, NULL);
196 TempName = UtLocalCalloc (5);
198 if (*TempCount < 10) /* 0-9 */
200 TempName[3] = (char) (*TempCount + '0');
202 else /* 10-35: A-Z */
204 TempName[3] = (char) (*TempCount + ('A' - 10));
208 /* First three characters are always "_T_" */
218 /*******************************************************************************
220 * FUNCTION: TrAmlInitLineNumbers
222 * PARAMETERS: Op - Op to be initialized
223 * Neighbor - Op used for initialization values
227 * DESCRIPTION: Initialized the various line numbers for a parse node.
229 ******************************************************************************/
232 TrAmlInitLineNumbers (
233 ACPI_PARSE_OBJECT *Op,
234 ACPI_PARSE_OBJECT *Neighbor)
237 Op->Asl.EndLine = Neighbor->Asl.EndLine;
238 Op->Asl.EndLogicalLine = Neighbor->Asl.EndLogicalLine;
239 Op->Asl.LineNumber = Neighbor->Asl.LineNumber;
240 Op->Asl.LogicalByteOffset = Neighbor->Asl.LogicalByteOffset;
241 Op->Asl.LogicalLineNumber = Neighbor->Asl.LogicalLineNumber;
245 /*******************************************************************************
247 * FUNCTION: TrAmlInitNode
249 * PARAMETERS: Op - Op to be initialized
250 * ParseOpcode - Opcode for this node
254 * DESCRIPTION: Initialize a node with the parse opcode and opcode name.
256 ******************************************************************************/
260 ACPI_PARSE_OBJECT *Op,
264 Op->Asl.ParseOpcode = ParseOpcode;
265 UtSetParseOpName (Op);
269 /*******************************************************************************
271 * FUNCTION: TrAmlSetSubtreeParent
273 * PARAMETERS: Op - First node in a list of peer nodes
274 * Parent - Parent of the subtree
278 * DESCRIPTION: Set the parent for all peer nodes in a subtree
280 ******************************************************************************/
283 TrAmlSetSubtreeParent (
284 ACPI_PARSE_OBJECT *Op,
285 ACPI_PARSE_OBJECT *Parent)
287 ACPI_PARSE_OBJECT *Next;
293 Next->Asl.Parent = Parent;
294 Next = Next->Asl.Next;
299 /*******************************************************************************
301 * FUNCTION: TrAmlInsertPeer
303 * PARAMETERS: Op - First node in a list of peer nodes
304 * NewPeer - Peer node to insert
308 * DESCRIPTION: Insert a new peer node into a list of peers.
310 ******************************************************************************/
314 ACPI_PARSE_OBJECT *Op,
315 ACPI_PARSE_OBJECT *NewPeer)
318 NewPeer->Asl.Next = Op->Asl.Next;
319 Op->Asl.Next = NewPeer;
323 /*******************************************************************************
325 * FUNCTION: TrAmlTransformWalk
327 * PARAMETERS: ASL_WALK_CALLBACK
331 * DESCRIPTION: Parse tree walk to generate both the AML opcodes and the AML
334 ******************************************************************************/
338 ACPI_PARSE_OBJECT *Op,
343 TrTransformSubtree (Op);
348 /*******************************************************************************
350 * FUNCTION: TrTransformSubtree
352 * PARAMETERS: Op - The parent parse node
356 * DESCRIPTION: Prepare nodes to be output as AML data and operands. The more
357 * complex AML opcodes require processing of the child nodes
358 * (arguments/operands).
360 ******************************************************************************/
364 ACPI_PARSE_OBJECT *Op)
367 if (Op->Asl.AmlOpcode == AML_RAW_DATA_BYTE)
372 switch (Op->Asl.ParseOpcode)
374 case PARSEOP_DEFINITIONBLOCK:
375 TrDoDefinitionBlock (Op);
385 * TBD: Zero the tempname (_T_x) count. Probably shouldn't be a global,
392 /* Nothing to do here for other opcodes */
398 /*******************************************************************************
400 * FUNCTION: TrDoDefinitionBlock
402 * PARAMETERS: Op - Parse node
406 * DESCRIPTION: Find the end of the definition block and set a global to this
407 * node. It is used by the compiler to insert compiler-generated
408 * names at the root level of the namespace.
410 ******************************************************************************/
413 TrDoDefinitionBlock (
414 ACPI_PARSE_OBJECT *Op)
416 ACPI_PARSE_OBJECT *Next;
420 Next = Op->Asl.Child;
421 for (i = 0; i < 5; i++)
423 Next = Next->Asl.Next;
427 * This is the table signature. Only the DSDT can be assumed
428 * to be at the root of the namespace; Therefore, namepath
429 * optimization can only be performed on the DSDT.
431 if (!ACPI_COMPARE_NAME (Next->Asl.Value.String, ACPI_SIG_DSDT))
433 Gbl_ReferenceOptimizationFlag = FALSE;
438 Gbl_FirstLevelInsertionNode = Next;
442 /*******************************************************************************
444 * FUNCTION: TrDoSwitch
446 * PARAMETERS: StartNode - Parse node for SWITCH
451 * DESCRIPTION: Translate ASL SWITCH statement to if/else pairs. There is
452 * no actual AML opcode for SWITCH -- it must be simulated.
454 ******************************************************************************/
458 ACPI_PARSE_OBJECT *StartNode)
460 ACPI_PARSE_OBJECT *Next;
461 ACPI_PARSE_OBJECT *CaseOp = NULL;
462 ACPI_PARSE_OBJECT *CaseBlock = NULL;
463 ACPI_PARSE_OBJECT *DefaultOp = NULL;
464 ACPI_PARSE_OBJECT *CurrentParentNode;
465 ACPI_PARSE_OBJECT *Conditional = NULL;
466 ACPI_PARSE_OBJECT *Predicate;
467 ACPI_PARSE_OBJECT *Peer;
468 ACPI_PARSE_OBJECT *NewOp;
469 ACPI_PARSE_OBJECT *NewOp2;
470 ACPI_PARSE_OBJECT *MethodOp;
471 ACPI_PARSE_OBJECT *StoreOp;
472 ACPI_PARSE_OBJECT *BreakOp;
473 char *PredicateValueName;
478 /* Start node is the Switch() node */
480 CurrentParentNode = StartNode;
482 /* Create a new temp name of the form _T_x */
484 PredicateValueName = TrAmlGetNextTempName (StartNode, &Gbl_TempCount);
485 if (!PredicateValueName)
490 /* First child is the Switch() predicate */
492 Next = StartNode->Asl.Child;
495 * Examine the return type of the Switch Value -
496 * must be Integer/Buffer/String
498 Index = (UINT16) (Next->Asl.ParseOpcode - ASL_PARSE_OPCODE_BASE);
499 Btype = AslKeywordMapping[Index].AcpiBtype;
500 if ((Btype != ACPI_BTYPE_INTEGER) &&
501 (Btype != ACPI_BTYPE_STRING) &&
502 (Btype != ACPI_BTYPE_BUFFER))
504 AslError (ASL_WARNING, ASL_MSG_SWITCH_TYPE, Next, NULL);
505 Btype = ACPI_BTYPE_INTEGER;
508 /* CASE statements start at next child */
510 Peer = Next->Asl.Next;
514 Peer = Next->Asl.Next;
516 if (Next->Asl.ParseOpcode == PARSEOP_CASE)
520 /* Add an ELSE to complete the previous CASE */
526 NewOp = TrCreateLeafNode (PARSEOP_ELSE);
527 NewOp->Asl.Parent = Conditional->Asl.Parent;
528 TrAmlInitLineNumbers (NewOp, NewOp->Asl.Parent);
530 /* Link ELSE node as a peer to the previous IF */
532 TrAmlInsertPeer (Conditional, NewOp);
533 CurrentParentNode = NewOp;
537 Conditional = CaseOp;
538 CaseBlock = CaseOp->Asl.Child->Asl.Next;
539 Conditional->Asl.Child->Asl.Next = NULL;
540 Predicate = CaseOp->Asl.Child;
542 if ((Predicate->Asl.ParseOpcode == PARSEOP_PACKAGE) ||
543 (Predicate->Asl.ParseOpcode == PARSEOP_VAR_PACKAGE))
546 * Convert the package declaration to this form:
548 * If (LNotEqual (Match (Package(<size>){<data>},
549 * MEQ, _T_x, MTR, Zero, Zero), Ones))
551 NewOp2 = TrCreateLeafNode (PARSEOP_MATCHTYPE_MEQ);
552 Predicate->Asl.Next = NewOp2;
553 TrAmlInitLineNumbers (NewOp2, Conditional);
556 NewOp2 = TrCreateValuedLeafNode (PARSEOP_NAMESTRING,
557 (UINT64) ACPI_TO_INTEGER (PredicateValueName));
558 NewOp->Asl.Next = NewOp2;
559 TrAmlInitLineNumbers (NewOp2, Predicate);
562 NewOp2 = TrCreateLeafNode (PARSEOP_MATCHTYPE_MTR);
563 NewOp->Asl.Next = NewOp2;
564 TrAmlInitLineNumbers (NewOp2, Predicate);
567 NewOp2 = TrCreateLeafNode (PARSEOP_ZERO);
568 NewOp->Asl.Next = NewOp2;
569 TrAmlInitLineNumbers (NewOp2, Predicate);
572 NewOp2 = TrCreateLeafNode (PARSEOP_ZERO);
573 NewOp->Asl.Next = NewOp2;
574 TrAmlInitLineNumbers (NewOp2, Predicate);
576 NewOp2 = TrCreateLeafNode (PARSEOP_MATCH);
577 NewOp2->Asl.Child = Predicate; /* PARSEOP_PACKAGE */
578 TrAmlInitLineNumbers (NewOp2, Conditional);
579 TrAmlSetSubtreeParent (Predicate, NewOp2);
582 NewOp2 = TrCreateLeafNode (PARSEOP_ONES);
583 NewOp->Asl.Next = NewOp2;
584 TrAmlInitLineNumbers (NewOp2, Conditional);
586 NewOp2 = TrCreateLeafNode (PARSEOP_LEQUAL);
587 NewOp2->Asl.Child = NewOp;
588 NewOp->Asl.Parent = NewOp2;
589 TrAmlInitLineNumbers (NewOp2, Conditional);
590 TrAmlSetSubtreeParent (NewOp, NewOp2);
593 NewOp2 = TrCreateLeafNode (PARSEOP_LNOT);
594 NewOp2->Asl.Child = NewOp;
595 NewOp2->Asl.Parent = Conditional;
596 NewOp->Asl.Parent = NewOp2;
597 TrAmlInitLineNumbers (NewOp2, Conditional);
599 Conditional->Asl.Child = NewOp2;
600 NewOp2->Asl.Next = CaseBlock;
605 * Integer and Buffer case.
607 * Change CaseOp() to: If (LEqual (SwitchValue, CaseValue)) {...}
608 * Note: SwitchValue is first to allow the CaseValue to be implicitly
609 * converted to the type of SwitchValue if necessary.
611 * CaseOp->Child is the case value
612 * CaseOp->Child->Peer is the beginning of the case block
614 NewOp = TrCreateValuedLeafNode (PARSEOP_NAMESTRING,
615 (UINT64) ACPI_TO_INTEGER (PredicateValueName));
616 NewOp->Asl.Next = Predicate;
617 TrAmlInitLineNumbers (NewOp, Predicate);
619 NewOp2 = TrCreateLeafNode (PARSEOP_LEQUAL);
620 NewOp2->Asl.Parent = Conditional;
621 NewOp2->Asl.Child = NewOp;
622 TrAmlInitLineNumbers (NewOp2, Conditional);
624 TrAmlSetSubtreeParent (NewOp, NewOp2);
627 Predicate->Asl.Next = CaseBlock;
629 TrAmlSetSubtreeParent (Predicate, Conditional);
630 Conditional->Asl.Child = Predicate;
633 /* Reinitialize the CASE node to an IF node */
635 TrAmlInitNode (Conditional, PARSEOP_IF);
638 * The first CASE(IF) is not nested under an ELSE.
639 * All other CASEs are children of a parent ELSE.
641 if (CurrentParentNode == StartNode)
643 Conditional->Asl.Next = NULL;
648 * The IF is a child of previous IF/ELSE. It
649 * is therefore without peer.
651 CurrentParentNode->Asl.Child = Conditional;
652 Conditional->Asl.Parent = CurrentParentNode;
653 Conditional->Asl.Next = NULL;
656 else if (Next->Asl.ParseOpcode == PARSEOP_DEFAULT)
661 * More than one Default
662 * (Parser does not catch this, must check here)
664 AslError (ASL_ERROR, ASL_MSG_MULTIPLE_DEFAULT, Next, NULL);
668 /* Save the DEFAULT node for later, after CASEs */
675 /* Unknown peer opcode */
677 AcpiOsPrintf ("Unknown parse opcode for switch statement: %s (%u)\n",
678 Next->Asl.ParseOpName, Next->Asl.ParseOpcode);
682 /* Add the default case at the end of the if/else construct */
686 /* If no CASE statements, this is an error - see below */
690 /* Convert the DEFAULT node to an ELSE */
697 TrAmlInitNode (DefaultOp, PARSEOP_ELSE);
698 DefaultOp->Asl.Parent = Conditional->Asl.Parent;
700 /* Link ELSE node as a peer to the previous IF */
702 TrAmlInsertPeer (Conditional, DefaultOp);
708 AslError (ASL_ERROR, ASL_MSG_NO_CASES, StartNode, NULL);
713 * Create a Name(_T_x, ...) statement. This statement must appear at the
714 * method level, in case a loop surrounds the switch statement and could
715 * cause the name to be created twice (error).
718 /* Create the Name node */
720 Predicate = StartNode->Asl.Child;
721 NewOp = TrCreateLeafNode (PARSEOP_NAME);
723 /* Find the parent method */
726 while ((Next->Asl.ParseOpcode != PARSEOP_METHOD) &&
727 (Next->Asl.ParseOpcode != PARSEOP_DEFINITIONBLOCK))
729 Next = Next->Asl.Parent;
733 NewOp->Asl.CompileFlags |= NODE_COMPILER_EMITTED;
734 NewOp->Asl.Parent = Next;
736 /* Insert name after the method name and arguments */
738 Next = Next->Asl.Child; /* Name */
739 Next = Next->Asl.Next; /* NumArgs */
740 Next = Next->Asl.Next; /* SerializeRule */
743 * If method is not Serialized, we must make is so, because of the way
744 * that Switch() must be implemented -- we cannot allow multiple threads
745 * to execute this method concurrently since we need to create local
748 if (Next->Asl.ParseOpcode != PARSEOP_SERIALIZERULE_SERIAL)
750 AslError (ASL_REMARK, ASL_MSG_SERIALIZED, MethodOp, "Due to use of Switch operator");
751 Next->Asl.ParseOpcode = PARSEOP_SERIALIZERULE_SERIAL;
754 Next = Next->Asl.Next; /* SyncLevel */
755 Next = Next->Asl.Next; /* ReturnType */
756 Next = Next->Asl.Next; /* ParameterTypes */
758 TrAmlInsertPeer (Next, NewOp);
759 TrAmlInitLineNumbers (NewOp, Next);
761 /* Create the NameSeg child for the Name node */
763 NewOp2 = TrCreateValuedLeafNode (PARSEOP_NAMESEG,
764 (UINT64) ACPI_TO_INTEGER (PredicateValueName));
765 NewOp2->Asl.CompileFlags |= NODE_IS_NAME_DECLARATION;
766 NewOp->Asl.Child = NewOp2;
768 /* Create the initial value for the Name. Btype was already validated above */
772 case ACPI_BTYPE_INTEGER:
773 NewOp2->Asl.Next = TrCreateValuedLeafNode (PARSEOP_ZERO,
777 case ACPI_BTYPE_STRING:
778 NewOp2->Asl.Next = TrCreateValuedLeafNode (PARSEOP_STRING_LITERAL,
779 (UINT64) ACPI_TO_INTEGER (""));
782 case ACPI_BTYPE_BUFFER:
783 (void) TrLinkPeerNode (NewOp2, TrCreateValuedLeafNode (PARSEOP_BUFFER,
785 Next = NewOp2->Asl.Next;
786 (void) TrLinkChildren (Next, 1, TrCreateValuedLeafNode (PARSEOP_ZERO,
788 (void) TrLinkPeerNode (Next->Asl.Child,
789 TrCreateValuedLeafNode (PARSEOP_DEFAULT_ARG, (UINT64) 0));
791 TrAmlSetSubtreeParent (Next->Asl.Child, Next);
798 TrAmlSetSubtreeParent (NewOp2, NewOp);
801 * Transform the Switch() into a While(One)-Break node.
802 * And create a Store() node which will be used to save the
803 * Switch() value. The store is of the form: Store (Value, _T_x)
804 * where _T_x is the temp variable.
806 TrAmlInitNode (StartNode, PARSEOP_WHILE);
807 NewOp = TrCreateLeafNode (PARSEOP_ONE);
808 NewOp->Asl.Next = Predicate->Asl.Next;
809 NewOp->Asl.Parent = StartNode;
810 StartNode->Asl.Child = NewOp;
812 /* Create a Store() node */
814 StoreOp = TrCreateLeafNode (PARSEOP_STORE);
815 StoreOp->Asl.Parent = StartNode;
816 TrAmlInsertPeer (NewOp, StoreOp);
818 /* Complete the Store subtree */
820 StoreOp->Asl.Child = Predicate;
821 Predicate->Asl.Parent = StoreOp;
823 NewOp = TrCreateValuedLeafNode (PARSEOP_NAMESEG,
824 (UINT64) ACPI_TO_INTEGER (PredicateValueName));
825 NewOp->Asl.Parent = StoreOp;
826 Predicate->Asl.Next = NewOp;
828 /* Create a Break() node and insert it into the end of While() */
830 Conditional = StartNode->Asl.Child;
831 while (Conditional->Asl.Next)
833 Conditional = Conditional->Asl.Next;
836 BreakOp = TrCreateLeafNode (PARSEOP_BREAK);
837 BreakOp->Asl.Parent = StartNode;
838 TrAmlInsertPeer (Conditional, BreakOp);