1 /****************************************************************************** 2 * 3 * Module Name: asltransform - Parse tree transforms 4 * 5 *****************************************************************************/ 6 7 /****************************************************************************** 8 * 9 * 1. Copyright Notice 10 * 11 * Some or all of this work - Copyright (c) 1999 - 2017, Intel Corp. 12 * All rights reserved. 13 * 14 * 2. License 15 * 16 * 2.1. This is your license from Intel Corp. under its intellectual property 17 * rights. You may have additional license terms from the party that provided 18 * you this software, covering your right to use that party's intellectual 19 * property rights. 20 * 21 * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a 22 * copy of the source code appearing in this file ("Covered Code") an 23 * irrevocable, perpetual, worldwide license under Intel's copyrights in the 24 * base code distributed originally by Intel ("Original Intel Code") to copy, 25 * make derivatives, distribute, use and display any portion of the Covered 26 * Code in any form, with the right to sublicense such rights; and 27 * 28 * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent 29 * license (with the right to sublicense), under only those claims of Intel 30 * patents that are infringed by the Original Intel Code, to make, use, sell, 31 * offer to sell, and import the Covered Code and derivative works thereof 32 * solely to the minimum extent necessary to exercise the above copyright 33 * license, and in no event shall the patent license extend to any additions 34 * to or modifications of the Original Intel Code. No other license or right 35 * is granted directly or by implication, estoppel or otherwise; 36 * 37 * The above copyright and patent license is granted only if the following 38 * conditions are met: 39 * 40 * 3. Conditions 41 * 42 * 3.1. Redistribution of Source with Rights to Further Distribute Source. 43 * Redistribution of source code of any substantial portion of the Covered 44 * Code or modification with rights to further distribute source must include 45 * the above Copyright Notice, the above License, this list of Conditions, 46 * and the following Disclaimer and Export Compliance provision. In addition, 47 * Licensee must cause all Covered Code to which Licensee contributes to 48 * contain a file documenting the changes Licensee made to create that Covered 49 * Code and the date of any change. Licensee must include in that file the 50 * documentation of any changes made by any predecessor Licensee. Licensee 51 * must include a prominent statement that the modification is derived, 52 * directly or indirectly, from Original Intel Code. 53 * 54 * 3.2. Redistribution of Source with no Rights to Further Distribute Source. 55 * Redistribution of source code of any substantial portion of the Covered 56 * Code or modification without rights to further distribute source must 57 * include the following Disclaimer and Export Compliance provision in the 58 * documentation and/or other materials provided with distribution. In 59 * addition, Licensee may not authorize further sublicense of source of any 60 * portion of the Covered Code, and must include terms to the effect that the 61 * license from Licensee to its licensee is limited to the intellectual 62 * property embodied in the software Licensee provides to its licensee, and 63 * not to intellectual property embodied in modifications its licensee may 64 * make. 65 * 66 * 3.3. Redistribution of Executable. Redistribution in executable form of any 67 * substantial portion of the Covered Code or modification must reproduce the 68 * above Copyright Notice, and the following Disclaimer and Export Compliance 69 * provision in the documentation and/or other materials provided with the 70 * distribution. 71 * 72 * 3.4. Intel retains all right, title, and interest in and to the Original 73 * Intel Code. 74 * 75 * 3.5. Neither the name Intel nor any other trademark owned or controlled by 76 * Intel shall be used in advertising or otherwise to promote the sale, use or 77 * other dealings in products derived from or relating to the Covered Code 78 * without prior written authorization from Intel. 79 * 80 * 4. Disclaimer and Export Compliance 81 * 82 * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED 83 * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE 84 * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE, 85 * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY 86 * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY 87 * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A 88 * PARTICULAR PURPOSE. 89 * 90 * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES 91 * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR 92 * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT, 93 * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY 94 * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL 95 * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS 96 * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY 97 * LIMITED REMEDY. 98 * 99 * 4.3. Licensee shall not export, either directly or indirectly, any of this 100 * software or system incorporating such software without first obtaining any 101 * required license or other approval from the U. S. Department of Commerce or 102 * any other agency or department of the United States Government. In the 103 * event Licensee exports any such software from the United States or 104 * re-exports any such software from a foreign destination, Licensee shall 105 * ensure that the distribution and export/re-export of the software is in 106 * compliance with all laws, regulations, orders, or other restrictions of the 107 * U.S. Export Administration Regulations. Licensee agrees that neither it nor 108 * any of its subsidiaries will export/re-export any technical data, process, 109 * software, or service, directly or indirectly, to any country for which the 110 * United States government or any agency thereof requires an export license, 111 * other governmental approval, or letter of assurance, without first obtaining 112 * such license, approval or letter. 113 * 114 ***************************************************************************** 115 * 116 * Alternatively, you may choose to be licensed under the terms of the 117 * following license: 118 * 119 * Redistribution and use in source and binary forms, with or without 120 * modification, are permitted provided that the following conditions 121 * are met: 122 * 1. Redistributions of source code must retain the above copyright 123 * notice, this list of conditions, and the following disclaimer, 124 * without modification. 125 * 2. Redistributions in binary form must reproduce at minimum a disclaimer 126 * substantially similar to the "NO WARRANTY" disclaimer below 127 * ("Disclaimer") and any redistribution must be conditioned upon 128 * including a substantially similar Disclaimer requirement for further 129 * binary redistribution. 130 * 3. Neither the names of the above-listed copyright holders nor the names 131 * of any contributors may be used to endorse or promote products derived 132 * from this software without specific prior written permission. 133 * 134 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 135 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 136 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 137 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 138 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 139 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 140 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 141 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 142 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 143 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 144 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 145 * 146 * Alternatively, you may choose to be licensed under the terms of the 147 * GNU General Public License ("GPL") version 2 as published by the Free 148 * Software Foundation. 149 * 150 *****************************************************************************/ 151 152 #include <contrib/dev/acpica/compiler/aslcompiler.h> 153 #include "aslcompiler.y.h" 154 155 #define _COMPONENT ACPI_COMPILER 156 ACPI_MODULE_NAME ("asltransform") 157 158 /* Local prototypes */ 159 160 static void 161 TrTransformSubtree ( 162 ACPI_PARSE_OBJECT *Op); 163 164 static char * 165 TrAmlGetNextTempName ( 166 ACPI_PARSE_OBJECT *Op, 167 UINT8 *TempCount); 168 169 static void 170 TrAmlInitLineNumbers ( 171 ACPI_PARSE_OBJECT *Op, 172 ACPI_PARSE_OBJECT *Neighbor); 173 174 static void 175 TrAmlInitNode ( 176 ACPI_PARSE_OBJECT *Op, 177 UINT16 ParseOpcode); 178 179 static void 180 TrAmlSetSubtreeParent ( 181 ACPI_PARSE_OBJECT *Op, 182 ACPI_PARSE_OBJECT *Parent); 183 184 static void 185 TrAmlInsertPeer ( 186 ACPI_PARSE_OBJECT *Op, 187 ACPI_PARSE_OBJECT *NewPeer); 188 189 static void 190 TrDoDefinitionBlock ( 191 ACPI_PARSE_OBJECT *Op); 192 193 static void 194 TrDoSwitch ( 195 ACPI_PARSE_OBJECT *StartNode); 196 197 198 /******************************************************************************* 199 * 200 * FUNCTION: TrAmlGetNextTempName 201 * 202 * PARAMETERS: Op - Current parse op 203 * TempCount - Current temporary counter. Was originally 204 * per-module; Currently per method, could be 205 * expanded to per-scope. 206 * 207 * RETURN: A pointer to name (allocated here). 208 * 209 * DESCRIPTION: Generate an ACPI name of the form _T_x. These names are 210 * reserved for use by the ASL compiler. (_T_0 through _T_Z) 211 * 212 ******************************************************************************/ 213 214 static char * 215 TrAmlGetNextTempName ( 216 ACPI_PARSE_OBJECT *Op, 217 UINT8 *TempCount) 218 { 219 char *TempName; 220 221 222 if (*TempCount >= (10 + 26)) /* 0-35 valid: 0-9 and A-Z for TempName[3] */ 223 { 224 /* Too many temps */ 225 226 AslError (ASL_ERROR, ASL_MSG_TOO_MANY_TEMPS, Op, NULL); 227 return (NULL); 228 } 229 230 TempName = UtLocalCalloc (5); 231 232 if (*TempCount < 10) /* 0-9 */ 233 { 234 TempName[3] = (char) (*TempCount + '0'); 235 } 236 else /* 10-35: A-Z */ 237 { 238 TempName[3] = (char) (*TempCount + ('A' - 10)); 239 } 240 241 (*TempCount)++; 242 243 /* First three characters are always "_T_" */ 244 245 TempName[0] = '_'; 246 TempName[1] = 'T'; 247 TempName[2] = '_'; 248 249 return (TempName); 250 } 251 252 253 /******************************************************************************* 254 * 255 * FUNCTION: TrAmlInitLineNumbers 256 * 257 * PARAMETERS: Op - Op to be initialized 258 * Neighbor - Op used for initialization values 259 * 260 * RETURN: None 261 * 262 * DESCRIPTION: Initialized the various line numbers for a parse node. 263 * 264 ******************************************************************************/ 265 266 static void 267 TrAmlInitLineNumbers ( 268 ACPI_PARSE_OBJECT *Op, 269 ACPI_PARSE_OBJECT *Neighbor) 270 { 271 272 Op->Asl.EndLine = Neighbor->Asl.EndLine; 273 Op->Asl.EndLogicalLine = Neighbor->Asl.EndLogicalLine; 274 Op->Asl.LineNumber = Neighbor->Asl.LineNumber; 275 Op->Asl.LogicalByteOffset = Neighbor->Asl.LogicalByteOffset; 276 Op->Asl.LogicalLineNumber = Neighbor->Asl.LogicalLineNumber; 277 } 278 279 280 /******************************************************************************* 281 * 282 * FUNCTION: TrAmlInitNode 283 * 284 * PARAMETERS: Op - Op to be initialized 285 * ParseOpcode - Opcode for this node 286 * 287 * RETURN: None 288 * 289 * DESCRIPTION: Initialize a node with the parse opcode and opcode name. 290 * 291 ******************************************************************************/ 292 293 static void 294 TrAmlInitNode ( 295 ACPI_PARSE_OBJECT *Op, 296 UINT16 ParseOpcode) 297 { 298 299 Op->Asl.ParseOpcode = ParseOpcode; 300 UtSetParseOpName (Op); 301 } 302 303 304 /******************************************************************************* 305 * 306 * FUNCTION: TrAmlSetSubtreeParent 307 * 308 * PARAMETERS: Op - First node in a list of peer nodes 309 * Parent - Parent of the subtree 310 * 311 * RETURN: None 312 * 313 * DESCRIPTION: Set the parent for all peer nodes in a subtree 314 * 315 ******************************************************************************/ 316 317 static void 318 TrAmlSetSubtreeParent ( 319 ACPI_PARSE_OBJECT *Op, 320 ACPI_PARSE_OBJECT *Parent) 321 { 322 ACPI_PARSE_OBJECT *Next; 323 324 325 Next = Op; 326 while (Next) 327 { 328 Next->Asl.Parent = Parent; 329 Next = Next->Asl.Next; 330 } 331 } 332 333 334 /******************************************************************************* 335 * 336 * FUNCTION: TrAmlInsertPeer 337 * 338 * PARAMETERS: Op - First node in a list of peer nodes 339 * NewPeer - Peer node to insert 340 * 341 * RETURN: None 342 * 343 * DESCRIPTION: Insert a new peer node into a list of peers. 344 * 345 ******************************************************************************/ 346 347 static void 348 TrAmlInsertPeer ( 349 ACPI_PARSE_OBJECT *Op, 350 ACPI_PARSE_OBJECT *NewPeer) 351 { 352 353 NewPeer->Asl.Next = Op->Asl.Next; 354 Op->Asl.Next = NewPeer; 355 } 356 357 358 /******************************************************************************* 359 * 360 * FUNCTION: TrAmlTransformWalkBegin 361 * 362 * PARAMETERS: ASL_WALK_CALLBACK 363 * 364 * RETURN: None 365 * 366 * DESCRIPTION: Parse tree walk to generate both the AML opcodes and the AML 367 * operands. 368 * 369 ******************************************************************************/ 370 371 ACPI_STATUS 372 TrAmlTransformWalkBegin ( 373 ACPI_PARSE_OBJECT *Op, 374 UINT32 Level, 375 void *Context) 376 { 377 378 TrTransformSubtree (Op); 379 return (AE_OK); 380 } 381 382 383 /******************************************************************************* 384 * 385 * FUNCTION: TrAmlTransformWalkEnd 386 * 387 * PARAMETERS: ASL_WALK_CALLBACK 388 * 389 * RETURN: None 390 * 391 * DESCRIPTION: Parse tree walk to generate both the AML opcodes and the AML 392 * operands. 393 * 394 ******************************************************************************/ 395 396 ACPI_STATUS 397 TrAmlTransformWalkEnd ( 398 ACPI_PARSE_OBJECT *Op, 399 UINT32 Level, 400 void *Context) 401 { 402 403 /* Save possible Externals list in the DefintionBlock Op */ 404 405 if (Op->Asl.ParseOpcode == PARSEOP_DEFINITION_BLOCK) 406 { 407 Op->Asl.Value.Arg = Gbl_ExternalsListHead; 408 Gbl_ExternalsListHead = NULL; 409 } 410 411 return (AE_OK); 412 } 413 414 415 /******************************************************************************* 416 * 417 * FUNCTION: TrTransformSubtree 418 * 419 * PARAMETERS: Op - The parent parse node 420 * 421 * RETURN: None 422 * 423 * DESCRIPTION: Prepare nodes to be output as AML data and operands. The more 424 * complex AML opcodes require processing of the child nodes 425 * (arguments/operands). 426 * 427 ******************************************************************************/ 428 429 static void 430 TrTransformSubtree ( 431 ACPI_PARSE_OBJECT *Op) 432 { 433 434 if (Op->Asl.AmlOpcode == AML_RAW_DATA_BYTE) 435 { 436 return; 437 } 438 439 switch (Op->Asl.ParseOpcode) 440 { 441 case PARSEOP_DEFINITION_BLOCK: 442 443 TrDoDefinitionBlock (Op); 444 break; 445 446 case PARSEOP_SWITCH: 447 448 TrDoSwitch (Op); 449 break; 450 451 case PARSEOP_METHOD: 452 /* 453 * TBD: Zero the tempname (_T_x) count. Probably shouldn't be a global, 454 * however 455 */ 456 Gbl_TempCount = 0; 457 break; 458 459 case PARSEOP_EXTERNAL: 460 461 if (Gbl_DoExternals == TRUE) 462 { 463 ExDoExternal (Op); 464 } 465 466 break; 467 468 default: 469 470 /* Nothing to do here for other opcodes */ 471 472 break; 473 } 474 } 475 476 477 /******************************************************************************* 478 * 479 * FUNCTION: TrDoDefinitionBlock 480 * 481 * PARAMETERS: Op - Parse node 482 * 483 * RETURN: None 484 * 485 * DESCRIPTION: Find the end of the definition block and set a global to this 486 * node. It is used by the compiler to insert compiler-generated 487 * names at the root level of the namespace. 488 * 489 ******************************************************************************/ 490 491 static void 492 TrDoDefinitionBlock ( 493 ACPI_PARSE_OBJECT *Op) 494 { 495 ACPI_PARSE_OBJECT *Next; 496 UINT32 i; 497 498 499 /* Reset external list when starting a definition block */ 500 501 Gbl_ExternalsListHead = NULL; 502 503 Next = Op->Asl.Child; 504 for (i = 0; i < 5; i++) 505 { 506 Next = Next->Asl.Next; 507 if (i == 0) 508 { 509 /* 510 * This is the table signature. Only the DSDT can be assumed 511 * to be at the root of the namespace; Therefore, namepath 512 * optimization can only be performed on the DSDT. 513 */ 514 if (!ACPI_COMPARE_NAME (Next->Asl.Value.String, ACPI_SIG_DSDT)) 515 { 516 Gbl_ReferenceOptimizationFlag = FALSE; 517 } 518 } 519 } 520 521 Gbl_FirstLevelInsertionNode = Next; 522 } 523 524 525 /******************************************************************************* 526 * 527 * FUNCTION: TrDoSwitch 528 * 529 * PARAMETERS: StartNode - Parse node for SWITCH 530 * 531 * RETURN: None 532 * 533 * DESCRIPTION: Translate ASL SWITCH statement to if/else pairs. There is 534 * no actual AML opcode for SWITCH -- it must be simulated. 535 * 536 ******************************************************************************/ 537 538 static void 539 TrDoSwitch ( 540 ACPI_PARSE_OBJECT *StartNode) 541 { 542 ACPI_PARSE_OBJECT *Next; 543 ACPI_PARSE_OBJECT *CaseOp = NULL; 544 ACPI_PARSE_OBJECT *CaseBlock = NULL; 545 ACPI_PARSE_OBJECT *DefaultOp = NULL; 546 ACPI_PARSE_OBJECT *CurrentParentNode; 547 ACPI_PARSE_OBJECT *Conditional = NULL; 548 ACPI_PARSE_OBJECT *Predicate; 549 ACPI_PARSE_OBJECT *Peer; 550 ACPI_PARSE_OBJECT *NewOp; 551 ACPI_PARSE_OBJECT *NewOp2; 552 ACPI_PARSE_OBJECT *MethodOp; 553 ACPI_PARSE_OBJECT *StoreOp; 554 ACPI_PARSE_OBJECT *BreakOp; 555 ACPI_PARSE_OBJECT *BufferOp; 556 char *PredicateValueName; 557 UINT16 Index; 558 UINT32 Btype; 559 560 561 /* Start node is the Switch() node */ 562 563 CurrentParentNode = StartNode; 564 565 /* Create a new temp name of the form _T_x */ 566 567 PredicateValueName = TrAmlGetNextTempName (StartNode, &Gbl_TempCount); 568 if (!PredicateValueName) 569 { 570 return; 571 } 572 573 /* First child is the Switch() predicate */ 574 575 Next = StartNode->Asl.Child; 576 577 /* 578 * Examine the return type of the Switch Value - 579 * must be Integer/Buffer/String 580 */ 581 Index = (UINT16) (Next->Asl.ParseOpcode - ASL_PARSE_OPCODE_BASE); 582 Btype = AslKeywordMapping[Index].AcpiBtype; 583 if ((Btype != ACPI_BTYPE_INTEGER) && 584 (Btype != ACPI_BTYPE_STRING) && 585 (Btype != ACPI_BTYPE_BUFFER)) 586 { 587 AslError (ASL_WARNING, ASL_MSG_SWITCH_TYPE, Next, NULL); 588 Btype = ACPI_BTYPE_INTEGER; 589 } 590 591 /* CASE statements start at next child */ 592 593 Peer = Next->Asl.Next; 594 while (Peer) 595 { 596 Next = Peer; 597 Peer = Next->Asl.Next; 598 599 if (Next->Asl.ParseOpcode == PARSEOP_CASE) 600 { 601 if (CaseOp) 602 { 603 /* Add an ELSE to complete the previous CASE */ 604 605 NewOp = TrCreateLeafNode (PARSEOP_ELSE); 606 NewOp->Asl.Parent = Conditional->Asl.Parent; 607 TrAmlInitLineNumbers (NewOp, NewOp->Asl.Parent); 608 609 /* Link ELSE node as a peer to the previous IF */ 610 611 TrAmlInsertPeer (Conditional, NewOp); 612 CurrentParentNode = NewOp; 613 } 614 615 CaseOp = Next; 616 Conditional = CaseOp; 617 CaseBlock = CaseOp->Asl.Child->Asl.Next; 618 Conditional->Asl.Child->Asl.Next = NULL; 619 Predicate = CaseOp->Asl.Child; 620 621 if ((Predicate->Asl.ParseOpcode == PARSEOP_PACKAGE) || 622 (Predicate->Asl.ParseOpcode == PARSEOP_VAR_PACKAGE)) 623 { 624 /* 625 * Convert the package declaration to this form: 626 * 627 * If (LNotEqual (Match (Package(<size>){<data>}, 628 * MEQ, _T_x, MTR, Zero, Zero), Ones)) 629 */ 630 NewOp2 = TrCreateLeafNode (PARSEOP_MATCHTYPE_MEQ); 631 Predicate->Asl.Next = NewOp2; 632 TrAmlInitLineNumbers (NewOp2, Conditional); 633 634 NewOp = NewOp2; 635 NewOp2 = TrCreateValuedLeafNode (PARSEOP_NAMESTRING, 636 (UINT64) ACPI_TO_INTEGER (PredicateValueName)); 637 NewOp->Asl.Next = NewOp2; 638 TrAmlInitLineNumbers (NewOp2, Predicate); 639 640 NewOp = NewOp2; 641 NewOp2 = TrCreateLeafNode (PARSEOP_MATCHTYPE_MTR); 642 NewOp->Asl.Next = NewOp2; 643 TrAmlInitLineNumbers (NewOp2, Predicate); 644 645 NewOp = NewOp2; 646 NewOp2 = TrCreateLeafNode (PARSEOP_ZERO); 647 NewOp->Asl.Next = NewOp2; 648 TrAmlInitLineNumbers (NewOp2, Predicate); 649 650 NewOp = NewOp2; 651 NewOp2 = TrCreateLeafNode (PARSEOP_ZERO); 652 NewOp->Asl.Next = NewOp2; 653 TrAmlInitLineNumbers (NewOp2, Predicate); 654 655 NewOp2 = TrCreateLeafNode (PARSEOP_MATCH); 656 NewOp2->Asl.Child = Predicate; /* PARSEOP_PACKAGE */ 657 TrAmlInitLineNumbers (NewOp2, Conditional); 658 TrAmlSetSubtreeParent (Predicate, NewOp2); 659 660 NewOp = NewOp2; 661 NewOp2 = TrCreateLeafNode (PARSEOP_ONES); 662 NewOp->Asl.Next = NewOp2; 663 TrAmlInitLineNumbers (NewOp2, Conditional); 664 665 NewOp2 = TrCreateLeafNode (PARSEOP_LEQUAL); 666 NewOp2->Asl.Child = NewOp; 667 NewOp->Asl.Parent = NewOp2; 668 TrAmlInitLineNumbers (NewOp2, Conditional); 669 TrAmlSetSubtreeParent (NewOp, NewOp2); 670 671 NewOp = NewOp2; 672 NewOp2 = TrCreateLeafNode (PARSEOP_LNOT); 673 NewOp2->Asl.Child = NewOp; 674 NewOp2->Asl.Parent = Conditional; 675 NewOp->Asl.Parent = NewOp2; 676 TrAmlInitLineNumbers (NewOp2, Conditional); 677 678 Conditional->Asl.Child = NewOp2; 679 NewOp2->Asl.Next = CaseBlock; 680 } 681 else 682 { 683 /* 684 * Integer and Buffer case. 685 * 686 * Change CaseOp() to: If (LEqual (SwitchValue, CaseValue)) {...} 687 * Note: SwitchValue is first to allow the CaseValue to be implicitly 688 * converted to the type of SwitchValue if necessary. 689 * 690 * CaseOp->Child is the case value 691 * CaseOp->Child->Peer is the beginning of the case block 692 */ 693 NewOp = TrCreateValuedLeafNode (PARSEOP_NAMESTRING, 694 (UINT64) ACPI_TO_INTEGER (PredicateValueName)); 695 NewOp->Asl.Next = Predicate; 696 TrAmlInitLineNumbers (NewOp, Predicate); 697 698 NewOp2 = TrCreateLeafNode (PARSEOP_LEQUAL); 699 NewOp2->Asl.Parent = Conditional; 700 NewOp2->Asl.Child = NewOp; 701 TrAmlInitLineNumbers (NewOp2, Conditional); 702 703 TrAmlSetSubtreeParent (NewOp, NewOp2); 704 705 Predicate = NewOp2; 706 Predicate->Asl.Next = CaseBlock; 707 708 TrAmlSetSubtreeParent (Predicate, Conditional); 709 Conditional->Asl.Child = Predicate; 710 } 711 712 /* Reinitialize the CASE node to an IF node */ 713 714 TrAmlInitNode (Conditional, PARSEOP_IF); 715 716 /* 717 * The first CASE(IF) is not nested under an ELSE. 718 * All other CASEs are children of a parent ELSE. 719 */ 720 if (CurrentParentNode == StartNode) 721 { 722 Conditional->Asl.Next = NULL; 723 } 724 else 725 { 726 /* 727 * The IF is a child of previous IF/ELSE. It 728 * is therefore without peer. 729 */ 730 CurrentParentNode->Asl.Child = Conditional; 731 Conditional->Asl.Parent = CurrentParentNode; 732 Conditional->Asl.Next = NULL; 733 } 734 } 735 else if (Next->Asl.ParseOpcode == PARSEOP_DEFAULT) 736 { 737 if (DefaultOp) 738 { 739 /* 740 * More than one Default 741 * (Parser does not catch this, must check here) 742 */ 743 AslError (ASL_ERROR, ASL_MSG_MULTIPLE_DEFAULT, Next, NULL); 744 } 745 else 746 { 747 /* Save the DEFAULT node for later, after CASEs */ 748 749 DefaultOp = Next; 750 } 751 } 752 else 753 { 754 /* Unknown peer opcode */ 755 756 AcpiOsPrintf ("Unknown parse opcode for switch statement: %s (%u)\n", 757 Next->Asl.ParseOpName, Next->Asl.ParseOpcode); 758 } 759 } 760 761 /* Add the default case at the end of the if/else construct */ 762 763 if (DefaultOp) 764 { 765 /* If no CASE statements, this is an error - see below */ 766 767 if (CaseOp) 768 { 769 /* Convert the DEFAULT node to an ELSE */ 770 771 TrAmlInitNode (DefaultOp, PARSEOP_ELSE); 772 DefaultOp->Asl.Parent = Conditional->Asl.Parent; 773 774 /* Link ELSE node as a peer to the previous IF */ 775 776 TrAmlInsertPeer (Conditional, DefaultOp); 777 } 778 } 779 780 if (!CaseOp) 781 { 782 AslError (ASL_ERROR, ASL_MSG_NO_CASES, StartNode, NULL); 783 } 784 785 786 /* 787 * Create a Name(_T_x, ...) statement. This statement must appear at the 788 * method level, in case a loop surrounds the switch statement and could 789 * cause the name to be created twice (error). 790 */ 791 792 /* Create the Name node */ 793 794 Predicate = StartNode->Asl.Child; 795 NewOp = TrCreateLeafNode (PARSEOP_NAME); 796 TrAmlInitLineNumbers (NewOp, StartNode); 797 798 /* Find the parent method */ 799 800 Next = StartNode; 801 while ((Next->Asl.ParseOpcode != PARSEOP_METHOD) && 802 (Next->Asl.ParseOpcode != PARSEOP_DEFINITION_BLOCK)) 803 { 804 Next = Next->Asl.Parent; 805 } 806 MethodOp = Next; 807 808 NewOp->Asl.CompileFlags |= NODE_COMPILER_EMITTED; 809 NewOp->Asl.Parent = Next; 810 811 /* Insert name after the method name and arguments */ 812 813 Next = Next->Asl.Child; /* Name */ 814 Next = Next->Asl.Next; /* NumArgs */ 815 Next = Next->Asl.Next; /* SerializeRule */ 816 817 /* 818 * If method is not Serialized, we must make is so, because of the way 819 * that Switch() must be implemented -- we cannot allow multiple threads 820 * to execute this method concurrently since we need to create local 821 * temporary name(s). 822 */ 823 if (Next->Asl.ParseOpcode != PARSEOP_SERIALIZERULE_SERIAL) 824 { 825 AslError (ASL_REMARK, ASL_MSG_SERIALIZED, MethodOp, 826 "Due to use of Switch operator"); 827 Next->Asl.ParseOpcode = PARSEOP_SERIALIZERULE_SERIAL; 828 } 829 830 Next = Next->Asl.Next; /* SyncLevel */ 831 Next = Next->Asl.Next; /* ReturnType */ 832 Next = Next->Asl.Next; /* ParameterTypes */ 833 834 TrAmlInsertPeer (Next, NewOp); 835 TrAmlInitLineNumbers (NewOp, Next); 836 837 /* Create the NameSeg child for the Name node */ 838 839 NewOp2 = TrCreateValuedLeafNode (PARSEOP_NAMESEG, 840 (UINT64) ACPI_TO_INTEGER (PredicateValueName)); 841 TrAmlInitLineNumbers (NewOp2, NewOp); 842 NewOp2->Asl.CompileFlags |= NODE_IS_NAME_DECLARATION; 843 NewOp->Asl.Child = NewOp2; 844 845 /* Create the initial value for the Name. Btype was already validated above */ 846 847 switch (Btype) 848 { 849 case ACPI_BTYPE_INTEGER: 850 851 NewOp2->Asl.Next = TrCreateValuedLeafNode (PARSEOP_ZERO, 852 (UINT64) 0); 853 TrAmlInitLineNumbers (NewOp2->Asl.Next, NewOp); 854 break; 855 856 case ACPI_BTYPE_STRING: 857 858 NewOp2->Asl.Next = TrCreateValuedLeafNode (PARSEOP_STRING_LITERAL, 859 (UINT64) ACPI_TO_INTEGER ("")); 860 TrAmlInitLineNumbers (NewOp2->Asl.Next, NewOp); 861 break; 862 863 case ACPI_BTYPE_BUFFER: 864 865 (void) TrLinkPeerNode (NewOp2, TrCreateValuedLeafNode (PARSEOP_BUFFER, 866 (UINT64) 0)); 867 Next = NewOp2->Asl.Next; 868 TrAmlInitLineNumbers (Next, NewOp2); 869 (void) TrLinkChildren (Next, 1, TrCreateValuedLeafNode (PARSEOP_ZERO, 870 (UINT64) 1)); 871 TrAmlInitLineNumbers (Next->Asl.Child, Next); 872 873 BufferOp = TrCreateValuedLeafNode (PARSEOP_DEFAULT_ARG, (UINT64) 0); 874 TrAmlInitLineNumbers (BufferOp, Next->Asl.Child); 875 (void) TrLinkPeerNode (Next->Asl.Child, BufferOp); 876 877 TrAmlSetSubtreeParent (Next->Asl.Child, Next); 878 break; 879 880 default: 881 882 break; 883 } 884 885 TrAmlSetSubtreeParent (NewOp2, NewOp); 886 887 /* 888 * Transform the Switch() into a While(One)-Break node. 889 * And create a Store() node which will be used to save the 890 * Switch() value. The store is of the form: Store (Value, _T_x) 891 * where _T_x is the temp variable. 892 */ 893 TrAmlInitNode (StartNode, PARSEOP_WHILE); 894 NewOp = TrCreateLeafNode (PARSEOP_ONE); 895 TrAmlInitLineNumbers (NewOp, StartNode); 896 NewOp->Asl.Next = Predicate->Asl.Next; 897 NewOp->Asl.Parent = StartNode; 898 StartNode->Asl.Child = NewOp; 899 900 /* Create a Store() node */ 901 902 StoreOp = TrCreateLeafNode (PARSEOP_STORE); 903 TrAmlInitLineNumbers (StoreOp, NewOp); 904 StoreOp->Asl.Parent = StartNode; 905 TrAmlInsertPeer (NewOp, StoreOp); 906 907 /* Complete the Store subtree */ 908 909 StoreOp->Asl.Child = Predicate; 910 Predicate->Asl.Parent = StoreOp; 911 912 NewOp = TrCreateValuedLeafNode (PARSEOP_NAMESEG, 913 (UINT64) ACPI_TO_INTEGER (PredicateValueName)); 914 TrAmlInitLineNumbers (NewOp, StoreOp); 915 NewOp->Asl.Parent = StoreOp; 916 Predicate->Asl.Next = NewOp; 917 918 /* Create a Break() node and insert it into the end of While() */ 919 920 Conditional = StartNode->Asl.Child; 921 while (Conditional->Asl.Next) 922 { 923 Conditional = Conditional->Asl.Next; 924 } 925 926 BreakOp = TrCreateLeafNode (PARSEOP_BREAK); 927 TrAmlInitLineNumbers (BreakOp, NewOp); 928 BreakOp->Asl.Parent = StartNode; 929 TrAmlInsertPeer (Conditional, BreakOp); 930 } 931