11c0e1b6dSJung-uk Kim /****************************************************************************** 21c0e1b6dSJung-uk Kim * 31c0e1b6dSJung-uk Kim * Module Name: aslprune - Parse tree prune utility 41c0e1b6dSJung-uk Kim * 51c0e1b6dSJung-uk Kim *****************************************************************************/ 61c0e1b6dSJung-uk Kim 70d84335fSJung-uk Kim /****************************************************************************** 80d84335fSJung-uk Kim * 90d84335fSJung-uk Kim * 1. Copyright Notice 100d84335fSJung-uk Kim * 1132ac4016SJung-uk Kim * Some or all of this work - Copyright (c) 1999 - 2018, Intel Corp. 121c0e1b6dSJung-uk Kim * All rights reserved. 131c0e1b6dSJung-uk Kim * 140d84335fSJung-uk Kim * 2. License 150d84335fSJung-uk Kim * 160d84335fSJung-uk Kim * 2.1. This is your license from Intel Corp. under its intellectual property 170d84335fSJung-uk Kim * rights. You may have additional license terms from the party that provided 180d84335fSJung-uk Kim * you this software, covering your right to use that party's intellectual 190d84335fSJung-uk Kim * property rights. 200d84335fSJung-uk Kim * 210d84335fSJung-uk Kim * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a 220d84335fSJung-uk Kim * copy of the source code appearing in this file ("Covered Code") an 230d84335fSJung-uk Kim * irrevocable, perpetual, worldwide license under Intel's copyrights in the 240d84335fSJung-uk Kim * base code distributed originally by Intel ("Original Intel Code") to copy, 250d84335fSJung-uk Kim * make derivatives, distribute, use and display any portion of the Covered 260d84335fSJung-uk Kim * Code in any form, with the right to sublicense such rights; and 270d84335fSJung-uk Kim * 280d84335fSJung-uk Kim * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent 290d84335fSJung-uk Kim * license (with the right to sublicense), under only those claims of Intel 300d84335fSJung-uk Kim * patents that are infringed by the Original Intel Code, to make, use, sell, 310d84335fSJung-uk Kim * offer to sell, and import the Covered Code and derivative works thereof 320d84335fSJung-uk Kim * solely to the minimum extent necessary to exercise the above copyright 330d84335fSJung-uk Kim * license, and in no event shall the patent license extend to any additions 340d84335fSJung-uk Kim * to or modifications of the Original Intel Code. No other license or right 350d84335fSJung-uk Kim * is granted directly or by implication, estoppel or otherwise; 360d84335fSJung-uk Kim * 370d84335fSJung-uk Kim * The above copyright and patent license is granted only if the following 380d84335fSJung-uk Kim * conditions are met: 390d84335fSJung-uk Kim * 400d84335fSJung-uk Kim * 3. Conditions 410d84335fSJung-uk Kim * 420d84335fSJung-uk Kim * 3.1. Redistribution of Source with Rights to Further Distribute Source. 430d84335fSJung-uk Kim * Redistribution of source code of any substantial portion of the Covered 440d84335fSJung-uk Kim * Code or modification with rights to further distribute source must include 450d84335fSJung-uk Kim * the above Copyright Notice, the above License, this list of Conditions, 460d84335fSJung-uk Kim * and the following Disclaimer and Export Compliance provision. In addition, 470d84335fSJung-uk Kim * Licensee must cause all Covered Code to which Licensee contributes to 480d84335fSJung-uk Kim * contain a file documenting the changes Licensee made to create that Covered 490d84335fSJung-uk Kim * Code and the date of any change. Licensee must include in that file the 500d84335fSJung-uk Kim * documentation of any changes made by any predecessor Licensee. Licensee 510d84335fSJung-uk Kim * must include a prominent statement that the modification is derived, 520d84335fSJung-uk Kim * directly or indirectly, from Original Intel Code. 530d84335fSJung-uk Kim * 540d84335fSJung-uk Kim * 3.2. Redistribution of Source with no Rights to Further Distribute Source. 550d84335fSJung-uk Kim * Redistribution of source code of any substantial portion of the Covered 560d84335fSJung-uk Kim * Code or modification without rights to further distribute source must 570d84335fSJung-uk Kim * include the following Disclaimer and Export Compliance provision in the 580d84335fSJung-uk Kim * documentation and/or other materials provided with distribution. In 590d84335fSJung-uk Kim * addition, Licensee may not authorize further sublicense of source of any 600d84335fSJung-uk Kim * portion of the Covered Code, and must include terms to the effect that the 610d84335fSJung-uk Kim * license from Licensee to its licensee is limited to the intellectual 620d84335fSJung-uk Kim * property embodied in the software Licensee provides to its licensee, and 630d84335fSJung-uk Kim * not to intellectual property embodied in modifications its licensee may 640d84335fSJung-uk Kim * make. 650d84335fSJung-uk Kim * 660d84335fSJung-uk Kim * 3.3. Redistribution of Executable. Redistribution in executable form of any 670d84335fSJung-uk Kim * substantial portion of the Covered Code or modification must reproduce the 680d84335fSJung-uk Kim * above Copyright Notice, and the following Disclaimer and Export Compliance 690d84335fSJung-uk Kim * provision in the documentation and/or other materials provided with the 700d84335fSJung-uk Kim * distribution. 710d84335fSJung-uk Kim * 720d84335fSJung-uk Kim * 3.4. Intel retains all right, title, and interest in and to the Original 730d84335fSJung-uk Kim * Intel Code. 740d84335fSJung-uk Kim * 750d84335fSJung-uk Kim * 3.5. Neither the name Intel nor any other trademark owned or controlled by 760d84335fSJung-uk Kim * Intel shall be used in advertising or otherwise to promote the sale, use or 770d84335fSJung-uk Kim * other dealings in products derived from or relating to the Covered Code 780d84335fSJung-uk Kim * without prior written authorization from Intel. 790d84335fSJung-uk Kim * 800d84335fSJung-uk Kim * 4. Disclaimer and Export Compliance 810d84335fSJung-uk Kim * 820d84335fSJung-uk Kim * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED 830d84335fSJung-uk Kim * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE 840d84335fSJung-uk Kim * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE, 850d84335fSJung-uk Kim * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY 860d84335fSJung-uk Kim * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY 870d84335fSJung-uk Kim * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A 880d84335fSJung-uk Kim * PARTICULAR PURPOSE. 890d84335fSJung-uk Kim * 900d84335fSJung-uk Kim * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES 910d84335fSJung-uk Kim * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR 920d84335fSJung-uk Kim * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT, 930d84335fSJung-uk Kim * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY 940d84335fSJung-uk Kim * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL 950d84335fSJung-uk Kim * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS 960d84335fSJung-uk Kim * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY 970d84335fSJung-uk Kim * LIMITED REMEDY. 980d84335fSJung-uk Kim * 990d84335fSJung-uk Kim * 4.3. Licensee shall not export, either directly or indirectly, any of this 1000d84335fSJung-uk Kim * software or system incorporating such software without first obtaining any 1010d84335fSJung-uk Kim * required license or other approval from the U. S. Department of Commerce or 1020d84335fSJung-uk Kim * any other agency or department of the United States Government. In the 1030d84335fSJung-uk Kim * event Licensee exports any such software from the United States or 1040d84335fSJung-uk Kim * re-exports any such software from a foreign destination, Licensee shall 1050d84335fSJung-uk Kim * ensure that the distribution and export/re-export of the software is in 1060d84335fSJung-uk Kim * compliance with all laws, regulations, orders, or other restrictions of the 1070d84335fSJung-uk Kim * U.S. Export Administration Regulations. Licensee agrees that neither it nor 1080d84335fSJung-uk Kim * any of its subsidiaries will export/re-export any technical data, process, 1090d84335fSJung-uk Kim * software, or service, directly or indirectly, to any country for which the 1100d84335fSJung-uk Kim * United States government or any agency thereof requires an export license, 1110d84335fSJung-uk Kim * other governmental approval, or letter of assurance, without first obtaining 1120d84335fSJung-uk Kim * such license, approval or letter. 1130d84335fSJung-uk Kim * 1140d84335fSJung-uk Kim ***************************************************************************** 1150d84335fSJung-uk Kim * 1160d84335fSJung-uk Kim * Alternatively, you may choose to be licensed under the terms of the 1170d84335fSJung-uk Kim * following license: 1180d84335fSJung-uk Kim * 1191c0e1b6dSJung-uk Kim * Redistribution and use in source and binary forms, with or without 1201c0e1b6dSJung-uk Kim * modification, are permitted provided that the following conditions 1211c0e1b6dSJung-uk Kim * are met: 1221c0e1b6dSJung-uk Kim * 1. Redistributions of source code must retain the above copyright 1231c0e1b6dSJung-uk Kim * notice, this list of conditions, and the following disclaimer, 1241c0e1b6dSJung-uk Kim * without modification. 1251c0e1b6dSJung-uk Kim * 2. Redistributions in binary form must reproduce at minimum a disclaimer 1261c0e1b6dSJung-uk Kim * substantially similar to the "NO WARRANTY" disclaimer below 1271c0e1b6dSJung-uk Kim * ("Disclaimer") and any redistribution must be conditioned upon 1281c0e1b6dSJung-uk Kim * including a substantially similar Disclaimer requirement for further 1291c0e1b6dSJung-uk Kim * binary redistribution. 1301c0e1b6dSJung-uk Kim * 3. Neither the names of the above-listed copyright holders nor the names 1311c0e1b6dSJung-uk Kim * of any contributors may be used to endorse or promote products derived 1321c0e1b6dSJung-uk Kim * from this software without specific prior written permission. 1331c0e1b6dSJung-uk Kim * 1340d84335fSJung-uk Kim * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 1350d84335fSJung-uk Kim * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 1360d84335fSJung-uk Kim * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 1370d84335fSJung-uk Kim * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 1380d84335fSJung-uk Kim * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 1390d84335fSJung-uk Kim * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 1400d84335fSJung-uk Kim * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 1410d84335fSJung-uk Kim * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 1420d84335fSJung-uk Kim * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 1430d84335fSJung-uk Kim * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 1440d84335fSJung-uk Kim * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 1450d84335fSJung-uk Kim * 1460d84335fSJung-uk Kim * Alternatively, you may choose to be licensed under the terms of the 1471c0e1b6dSJung-uk Kim * GNU General Public License ("GPL") version 2 as published by the Free 1481c0e1b6dSJung-uk Kim * Software Foundation. 1491c0e1b6dSJung-uk Kim * 1500d84335fSJung-uk Kim *****************************************************************************/ 1511c0e1b6dSJung-uk Kim 1521c0e1b6dSJung-uk Kim #include <contrib/dev/acpica/compiler/aslcompiler.h> 1531c0e1b6dSJung-uk Kim #include "aslcompiler.y.h" 1541c0e1b6dSJung-uk Kim #include <contrib/dev/acpica/include/acapps.h> 1551c0e1b6dSJung-uk Kim 1561c0e1b6dSJung-uk Kim #define _COMPONENT ACPI_COMPILER 1571c0e1b6dSJung-uk Kim ACPI_MODULE_NAME ("aslprune") 1581c0e1b6dSJung-uk Kim 1591c0e1b6dSJung-uk Kim 1601c0e1b6dSJung-uk Kim /* Local prototypes */ 1611c0e1b6dSJung-uk Kim 1621c0e1b6dSJung-uk Kim static ACPI_STATUS 1631c0e1b6dSJung-uk Kim PrTreePruneWalk ( 1641c0e1b6dSJung-uk Kim ACPI_PARSE_OBJECT *Op, 1651c0e1b6dSJung-uk Kim UINT32 Level, 1661c0e1b6dSJung-uk Kim void *Context); 1671c0e1b6dSJung-uk Kim 1681c0e1b6dSJung-uk Kim static void 1691c0e1b6dSJung-uk Kim PrPrintObjectAtLevel ( 1701c0e1b6dSJung-uk Kim UINT32 Level, 1711c0e1b6dSJung-uk Kim const char *ObjectName); 1721c0e1b6dSJung-uk Kim 1731c0e1b6dSJung-uk Kim 174f8146b88SJung-uk Kim /* Structure used for the pruning parse tree walk */ 175f8146b88SJung-uk Kim 1761c0e1b6dSJung-uk Kim typedef struct acpi_prune_info 1771c0e1b6dSJung-uk Kim { 1781c0e1b6dSJung-uk Kim UINT32 PruneLevel; 1791c0e1b6dSJung-uk Kim UINT16 ParseOpcode; 1801c0e1b6dSJung-uk Kim UINT16 Count; 1811c0e1b6dSJung-uk Kim 1821c0e1b6dSJung-uk Kim } ACPI_PRUNE_INFO; 1831c0e1b6dSJung-uk Kim 1841c0e1b6dSJung-uk Kim 1851c0e1b6dSJung-uk Kim /******************************************************************************* 1861c0e1b6dSJung-uk Kim * 1871c0e1b6dSJung-uk Kim * FUNCTION: AslPruneParseTree 1881c0e1b6dSJung-uk Kim * 1891c0e1b6dSJung-uk Kim * PARAMETERS: PruneDepth - Number of levels to prune 1901c0e1b6dSJung-uk Kim * Type - Prune type (Device, Method, etc.) 1911c0e1b6dSJung-uk Kim * 1921c0e1b6dSJung-uk Kim * RETURN: None 1931c0e1b6dSJung-uk Kim * 1941c0e1b6dSJung-uk Kim * DESCRIPTION: Prune off one or more levels of the ASL parse tree 1951c0e1b6dSJung-uk Kim * 1961c0e1b6dSJung-uk Kim ******************************************************************************/ 1971c0e1b6dSJung-uk Kim 1981c0e1b6dSJung-uk Kim void 1991c0e1b6dSJung-uk Kim AslPruneParseTree ( 2001c0e1b6dSJung-uk Kim UINT32 PruneDepth, 2011c0e1b6dSJung-uk Kim UINT32 Type) 2021c0e1b6dSJung-uk Kim { 2031c0e1b6dSJung-uk Kim ACPI_PRUNE_INFO PruneObj; 2041c0e1b6dSJung-uk Kim 2051c0e1b6dSJung-uk Kim 2061c0e1b6dSJung-uk Kim PruneObj.PruneLevel = PruneDepth; 2071c0e1b6dSJung-uk Kim PruneObj.Count = 0; 2081c0e1b6dSJung-uk Kim 2091c0e1b6dSJung-uk Kim switch (Type) 2101c0e1b6dSJung-uk Kim { 2111c0e1b6dSJung-uk Kim case 0: 2121c0e1b6dSJung-uk Kim PruneObj.ParseOpcode = (UINT16) PARSEOP_DEVICE; 2131c0e1b6dSJung-uk Kim break; 2141c0e1b6dSJung-uk Kim 2151c0e1b6dSJung-uk Kim case 1: 2161c0e1b6dSJung-uk Kim PruneObj.ParseOpcode = (UINT16) PARSEOP_METHOD; 2171c0e1b6dSJung-uk Kim break; 2181c0e1b6dSJung-uk Kim 2191c0e1b6dSJung-uk Kim case 2: 2201c0e1b6dSJung-uk Kim PruneObj.ParseOpcode = (UINT16) PARSEOP_IF; 2211c0e1b6dSJung-uk Kim break; 2221c0e1b6dSJung-uk Kim 2231c0e1b6dSJung-uk Kim default: 2241c0e1b6dSJung-uk Kim AcpiOsPrintf ("Unsupported type: %u\n", Type); 2251c0e1b6dSJung-uk Kim return; 2261c0e1b6dSJung-uk Kim } 2271c0e1b6dSJung-uk Kim 2281c0e1b6dSJung-uk Kim AcpiOsPrintf ("Pruning parse tree, from depth %u\n", 2291c0e1b6dSJung-uk Kim PruneDepth); 2301c0e1b6dSJung-uk Kim 2311c0e1b6dSJung-uk Kim AcpiOsPrintf ("\nRemoving Objects:\n"); 2321c0e1b6dSJung-uk Kim 233*6f1f1a63SJung-uk Kim TrWalkParseTree (AslGbl_ParseTreeRoot, ASL_WALK_VISIT_DOWNWARD, 2341c0e1b6dSJung-uk Kim PrTreePruneWalk, NULL, ACPI_CAST_PTR (void, &PruneObj)); 2351c0e1b6dSJung-uk Kim 2361c0e1b6dSJung-uk Kim AcpiOsPrintf ("\n%u Total Objects Removed\n", PruneObj.Count); 2371c0e1b6dSJung-uk Kim } 2381c0e1b6dSJung-uk Kim 2391c0e1b6dSJung-uk Kim 2401c0e1b6dSJung-uk Kim /******************************************************************************* 2411c0e1b6dSJung-uk Kim * 2421c0e1b6dSJung-uk Kim * FUNCTION: PrPrintObjectAtLevel 2431c0e1b6dSJung-uk Kim * 2441c0e1b6dSJung-uk Kim * PARAMETERS: Level - Current nesting level 2451c0e1b6dSJung-uk Kim * ObjectName - ACPI name for the object 2461c0e1b6dSJung-uk Kim * 2471c0e1b6dSJung-uk Kim * RETURN: None 2481c0e1b6dSJung-uk Kim * 2491c0e1b6dSJung-uk Kim * DESCRIPTION: Print object name with indent 2501c0e1b6dSJung-uk Kim * 2511c0e1b6dSJung-uk Kim ******************************************************************************/ 2521c0e1b6dSJung-uk Kim 2531c0e1b6dSJung-uk Kim static void 2541c0e1b6dSJung-uk Kim PrPrintObjectAtLevel ( 2551c0e1b6dSJung-uk Kim UINT32 Level, 2561c0e1b6dSJung-uk Kim const char *ObjectName) 2571c0e1b6dSJung-uk Kim { 2581c0e1b6dSJung-uk Kim UINT32 i; 2591c0e1b6dSJung-uk Kim 2601c0e1b6dSJung-uk Kim 2611c0e1b6dSJung-uk Kim for (i = 0; i < Level; i++) 2621c0e1b6dSJung-uk Kim { 2631c0e1b6dSJung-uk Kim AcpiOsPrintf (" "); 2641c0e1b6dSJung-uk Kim } 2651c0e1b6dSJung-uk Kim 2661c0e1b6dSJung-uk Kim AcpiOsPrintf ("[%s] at Level [%u]\n", ObjectName, Level); 2671c0e1b6dSJung-uk Kim } 2681c0e1b6dSJung-uk Kim 2691c0e1b6dSJung-uk Kim 2701c0e1b6dSJung-uk Kim /******************************************************************************* 2711c0e1b6dSJung-uk Kim * 2721c0e1b6dSJung-uk Kim * FUNCTION: PrTreePruneWalk 2731c0e1b6dSJung-uk Kim * 2741c0e1b6dSJung-uk Kim * PARAMETERS: Parse tree walk callback 2751c0e1b6dSJung-uk Kim * 2761c0e1b6dSJung-uk Kim * RETURN: Status 2771c0e1b6dSJung-uk Kim * 2781c0e1b6dSJung-uk Kim * DESCRIPTION: Prune off one or more levels of the ASL parse tree 2791c0e1b6dSJung-uk Kim * 2801c0e1b6dSJung-uk Kim * Current objects that can be pruned are: Devices, Methods, and If/Else 2811c0e1b6dSJung-uk Kim * blocks. 2821c0e1b6dSJung-uk Kim * 2831c0e1b6dSJung-uk Kim ******************************************************************************/ 2841c0e1b6dSJung-uk Kim 2851c0e1b6dSJung-uk Kim static ACPI_STATUS 2861c0e1b6dSJung-uk Kim PrTreePruneWalk ( 2871c0e1b6dSJung-uk Kim ACPI_PARSE_OBJECT *Op, 2881c0e1b6dSJung-uk Kim UINT32 Level, 2891c0e1b6dSJung-uk Kim void *Context) 2901c0e1b6dSJung-uk Kim { 2911c0e1b6dSJung-uk Kim ACPI_PRUNE_INFO *PruneObj = (ACPI_PRUNE_INFO *) Context; 2921c0e1b6dSJung-uk Kim 2931c0e1b6dSJung-uk Kim 2941c0e1b6dSJung-uk Kim /* We only care about objects below the Prune Level threshold */ 2951c0e1b6dSJung-uk Kim 2961c0e1b6dSJung-uk Kim if (Level <= PruneObj->PruneLevel) 2971c0e1b6dSJung-uk Kim { 2981c0e1b6dSJung-uk Kim return (AE_OK); 2991c0e1b6dSJung-uk Kim } 3001c0e1b6dSJung-uk Kim 3011c0e1b6dSJung-uk Kim if ((Op->Asl.ParseOpcode != PruneObj->ParseOpcode) && 3021c0e1b6dSJung-uk Kim !(Op->Asl.ParseOpcode == PARSEOP_ELSE && 3031c0e1b6dSJung-uk Kim PruneObj->ParseOpcode == PARSEOP_IF)) 3041c0e1b6dSJung-uk Kim { 3051c0e1b6dSJung-uk Kim return (AE_OK); 3061c0e1b6dSJung-uk Kim } 3071c0e1b6dSJung-uk Kim 3081c0e1b6dSJung-uk Kim switch (Op->Asl.ParseOpcode) 3091c0e1b6dSJung-uk Kim { 3101c0e1b6dSJung-uk Kim case PARSEOP_METHOD: 3111c0e1b6dSJung-uk Kim 3121c0e1b6dSJung-uk Kim AcpiOsPrintf ("Method"); 3131c0e1b6dSJung-uk Kim PrPrintObjectAtLevel (Level, Op->Asl.Child->Asl.Value.Name); 3141c0e1b6dSJung-uk Kim Op->Asl.Child->Asl.Next->Asl.Next->Asl.Next->Asl.Next->Asl.Next->Asl.Next = NULL; 3151c0e1b6dSJung-uk Kim PruneObj->Count++; 3161c0e1b6dSJung-uk Kim break; 3171c0e1b6dSJung-uk Kim 3181c0e1b6dSJung-uk Kim case PARSEOP_DEVICE: 3191c0e1b6dSJung-uk Kim 3201c0e1b6dSJung-uk Kim AcpiOsPrintf ("Device"); 3211c0e1b6dSJung-uk Kim PrPrintObjectAtLevel (Level, Op->Asl.Child->Asl.Value.Name); 3221c0e1b6dSJung-uk Kim Op->Asl.Child->Asl.Next = NULL; 3231c0e1b6dSJung-uk Kim PruneObj->Count++; 3241c0e1b6dSJung-uk Kim break; 3251c0e1b6dSJung-uk Kim 3261c0e1b6dSJung-uk Kim case PARSEOP_IF: 3271c0e1b6dSJung-uk Kim case PARSEOP_ELSE: 3281c0e1b6dSJung-uk Kim 3291c0e1b6dSJung-uk Kim if (Op->Asl.ParseOpcode == PARSEOP_ELSE) 3301c0e1b6dSJung-uk Kim { 3311c0e1b6dSJung-uk Kim PrPrintObjectAtLevel(Level, "Else"); 3321c0e1b6dSJung-uk Kim Op->Asl.Child = NULL; 3331c0e1b6dSJung-uk Kim } 3341c0e1b6dSJung-uk Kim else 3351c0e1b6dSJung-uk Kim { 3361c0e1b6dSJung-uk Kim PrPrintObjectAtLevel(Level, "If"); 3371c0e1b6dSJung-uk Kim Op->Asl.Child->Asl.Next = NULL; 3381c0e1b6dSJung-uk Kim } 3391c0e1b6dSJung-uk Kim 3401c0e1b6dSJung-uk Kim PruneObj->Count++; 3411c0e1b6dSJung-uk Kim break; 3421c0e1b6dSJung-uk Kim 3431c0e1b6dSJung-uk Kim default: 3441c0e1b6dSJung-uk Kim 3451c0e1b6dSJung-uk Kim break; 3461c0e1b6dSJung-uk Kim } 3471c0e1b6dSJung-uk Kim 3481c0e1b6dSJung-uk Kim return (AE_OK); 3491c0e1b6dSJung-uk Kim } 350