aslprimaries.y (9b3ece1c2eb92a881cb2553271e123382bfe31c1) | aslprimaries.y (0d84335f991f528c6f038e79dd5cc0a7770532da) |
---|---|
1NoEcho(' 2/****************************************************************************** 3 * 4 * Module Name: aslprimaries.y - Rules for primary ASL operators | 1NoEcho(' 2/****************************************************************************** 3 * 4 * Module Name: aslprimaries.y - Rules for primary ASL operators |
5 * - Keep this file synched with the 6 * CvParseOpBlockType function in cvcompiler.c |
|
5 * 6 *****************************************************************************/ 7 | 7 * 8 *****************************************************************************/ 9 |
8/* 9 * Copyright (C) 2000 - 2017, Intel Corp. | 10/****************************************************************************** 11 * 12 * 1. Copyright Notice 13 * 14 * Some or all of this work - Copyright (c) 1999 - 2017, Intel Corp. |
10 * All rights reserved. 11 * | 15 * All rights reserved. 16 * |
17 * 2. License 18 * 19 * 2.1. This is your license from Intel Corp. under its intellectual property 20 * rights. You may have additional license terms from the party that provided 21 * you this software, covering your right to use that party's intellectual 22 * property rights. 23 * 24 * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a 25 * copy of the source code appearing in this file ("Covered Code") an 26 * irrevocable, perpetual, worldwide license under Intel's copyrights in the 27 * base code distributed originally by Intel ("Original Intel Code") to copy, 28 * make derivatives, distribute, use and display any portion of the Covered 29 * Code in any form, with the right to sublicense such rights; and 30 * 31 * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent 32 * license (with the right to sublicense), under only those claims of Intel 33 * patents that are infringed by the Original Intel Code, to make, use, sell, 34 * offer to sell, and import the Covered Code and derivative works thereof 35 * solely to the minimum extent necessary to exercise the above copyright 36 * license, and in no event shall the patent license extend to any additions 37 * to or modifications of the Original Intel Code. No other license or right 38 * is granted directly or by implication, estoppel or otherwise; 39 * 40 * The above copyright and patent license is granted only if the following 41 * conditions are met: 42 * 43 * 3. Conditions 44 * 45 * 3.1. Redistribution of Source with Rights to Further Distribute Source. 46 * Redistribution of source code of any substantial portion of the Covered 47 * Code or modification with rights to further distribute source must include 48 * the above Copyright Notice, the above License, this list of Conditions, 49 * and the following Disclaimer and Export Compliance provision. In addition, 50 * Licensee must cause all Covered Code to which Licensee contributes to 51 * contain a file documenting the changes Licensee made to create that Covered 52 * Code and the date of any change. Licensee must include in that file the 53 * documentation of any changes made by any predecessor Licensee. Licensee 54 * must include a prominent statement that the modification is derived, 55 * directly or indirectly, from Original Intel Code. 56 * 57 * 3.2. Redistribution of Source with no Rights to Further Distribute Source. 58 * Redistribution of source code of any substantial portion of the Covered 59 * Code or modification without rights to further distribute source must 60 * include the following Disclaimer and Export Compliance provision in the 61 * documentation and/or other materials provided with distribution. In 62 * addition, Licensee may not authorize further sublicense of source of any 63 * portion of the Covered Code, and must include terms to the effect that the 64 * license from Licensee to its licensee is limited to the intellectual 65 * property embodied in the software Licensee provides to its licensee, and 66 * not to intellectual property embodied in modifications its licensee may 67 * make. 68 * 69 * 3.3. Redistribution of Executable. Redistribution in executable form of any 70 * substantial portion of the Covered Code or modification must reproduce the 71 * above Copyright Notice, and the following Disclaimer and Export Compliance 72 * provision in the documentation and/or other materials provided with the 73 * distribution. 74 * 75 * 3.4. Intel retains all right, title, and interest in and to the Original 76 * Intel Code. 77 * 78 * 3.5. Neither the name Intel nor any other trademark owned or controlled by 79 * Intel shall be used in advertising or otherwise to promote the sale, use or 80 * other dealings in products derived from or relating to the Covered Code 81 * without prior written authorization from Intel. 82 * 83 * 4. Disclaimer and Export Compliance 84 * 85 * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED 86 * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE 87 * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE, 88 * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY 89 * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY 90 * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A 91 * PARTICULAR PURPOSE. 92 * 93 * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES 94 * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR 95 * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT, 96 * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY 97 * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL 98 * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS 99 * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY 100 * LIMITED REMEDY. 101 * 102 * 4.3. Licensee shall not export, either directly or indirectly, any of this 103 * software or system incorporating such software without first obtaining any 104 * required license or other approval from the U. S. Department of Commerce or 105 * any other agency or department of the United States Government. In the 106 * event Licensee exports any such software from the United States or 107 * re-exports any such software from a foreign destination, Licensee shall 108 * ensure that the distribution and export/re-export of the software is in 109 * compliance with all laws, regulations, orders, or other restrictions of the 110 * U.S. Export Administration Regulations. Licensee agrees that neither it nor 111 * any of its subsidiaries will export/re-export any technical data, process, 112 * software, or service, directly or indirectly, to any country for which the 113 * United States government or any agency thereof requires an export license, 114 * other governmental approval, or letter of assurance, without first obtaining 115 * such license, approval or letter. 116 * 117 ***************************************************************************** 118 * 119 * Alternatively, you may choose to be licensed under the terms of the 120 * following license: 121 * |
|
12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions, and the following disclaimer, 17 * without modification. 18 * 2. Redistributions in binary form must reproduce at minimum a disclaimer 19 * substantially similar to the "NO WARRANTY" disclaimer below 20 * ("Disclaimer") and any redistribution must be conditioned upon 21 * including a substantially similar Disclaimer requirement for further 22 * binary redistribution. 23 * 3. Neither the names of the above-listed copyright holders nor the names 24 * of any contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * | 122 * Redistribution and use in source and binary forms, with or without 123 * modification, are permitted provided that the following conditions 124 * are met: 125 * 1. Redistributions of source code must retain the above copyright 126 * notice, this list of conditions, and the following disclaimer, 127 * without modification. 128 * 2. Redistributions in binary form must reproduce at minimum a disclaimer 129 * substantially similar to the "NO WARRANTY" disclaimer below 130 * ("Disclaimer") and any redistribution must be conditioned upon 131 * including a substantially similar Disclaimer requirement for further 132 * binary redistribution. 133 * 3. Neither the names of the above-listed copyright holders nor the names 134 * of any contributors may be used to endorse or promote products derived 135 * from this software without specific prior written permission. 136 * |
27 * Alternatively, this software may be distributed under the terms of the 28 * GNU General Public License ("GPL") version 2 as published by the Free 29 * Software Foundation. 30 * 31 * NO WARRANTY | |
32 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 33 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 137 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 138 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
34 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR | 139 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
35 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 140 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
36 * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 37 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 38 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 39 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 40 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING 41 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 42 * POSSIBILITY OF SUCH DAMAGES. 43 */ | 141 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 142 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 143 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 144 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 145 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 146 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 147 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 148 * 149 * Alternatively, you may choose to be licensed under the terms of the 150 * GNU General Public License ("GPL") version 2 as published by the Free 151 * Software Foundation. 152 * 153 *****************************************************************************/ |
44 45') 46 47 48/******************************************************************************* 49 * 50 * ASL Primary Terms 51 * --- 89 unchanged lines hidden (view full) --- 141 : PARSEOP_BREAK {$$ = TrCreateNode (PARSEOP_BREAK, 0);} 142 ; 143 144BreakPointTerm 145 : PARSEOP_BREAKPOINT {$$ = TrCreateNode (PARSEOP_BREAKPOINT, 0);} 146 ; 147 148BufferTerm | 154 155') 156 157 158/******************************************************************************* 159 * 160 * ASL Primary Terms 161 * --- 89 unchanged lines hidden (view full) --- 251 : PARSEOP_BREAK {$$ = TrCreateNode (PARSEOP_BREAK, 0);} 252 ; 253 254BreakPointTerm 255 : PARSEOP_BREAKPOINT {$$ = TrCreateNode (PARSEOP_BREAKPOINT, 0);} 256 ; 257 258BufferTerm |
149 : PARSEOP_BUFFER {$<n>$ = TrCreateLeafNode (PARSEOP_BUFFER);} | 259 : PARSEOP_BUFFER {$<n>$ = TrCreateLeafNode (PARSEOP_BUFFER); COMMENT_CAPTURE_OFF; } |
150 OptionalDataCount | 260 OptionalDataCount |
151 '{' BufferTermData '}' {$$ = TrLinkChildren ($<n>2,2,$3,$5);} | 261 '{' BufferTermData '}' {$$ = TrLinkChildren ($<n>2,2,$3,$5); COMMENT_CAPTURE_ON;} |
152 ; 153 154BufferTermData 155 : ByteList {} 156 | StringData {} 157 ; 158 159CaseTerm --- 238 unchanged lines hidden (view full) --- 398 ; 399 400ElseIfTerm 401 : IfTerm ElseTerm {$$ = TrLinkPeerNode ($1,$2);} 402 ; 403 404ElseTerm 405 : {$$ = NULL;} | 262 ; 263 264BufferTermData 265 : ByteList {} 266 | StringData {} 267 ; 268 269CaseTerm --- 238 unchanged lines hidden (view full) --- 508 ; 509 510ElseIfTerm 511 : IfTerm ElseTerm {$$ = TrLinkPeerNode ($1,$2);} 512 ; 513 514ElseTerm 515 : {$$ = NULL;} |
406 | PARSEOP_ELSE '{' {$<n>$ = TrCreateLeafNode (PARSEOP_ELSE);} 407 TermList '}' {$$ = TrLinkChildren ($<n>3,1,$4);} | 516 | PARSEOP_ELSE '{' 517 TermList {$<n>$ = TrCreateLeafNode (PARSEOP_ELSE);} 518 '}' {$$ = TrLinkChildren ($<n>4,1,$3);} |
408 409 | PARSEOP_ELSE '{' 410 error '}' {$$ = AslDoError(); yyclearin;} 411 412 | PARSEOP_ELSE 413 error {$$ = AslDoError(); yyclearin;} 414 415 | PARSEOP_ELSEIF --- 124 unchanged lines hidden (view full) --- 540 PARSEOP_CLOSE_PAREN {$$ = TrLinkChildren ($<n>3,2,$4,$5);} 541 | PARSEOP_FROMBCD 542 PARSEOP_OPEN_PAREN 543 error PARSEOP_CLOSE_PAREN {$$ = AslDoError(); yyclearin;} 544 ; 545 546FunctionTerm 547 : PARSEOP_FUNCTION | 519 520 | PARSEOP_ELSE '{' 521 error '}' {$$ = AslDoError(); yyclearin;} 522 523 | PARSEOP_ELSE 524 error {$$ = AslDoError(); yyclearin;} 525 526 | PARSEOP_ELSEIF --- 124 unchanged lines hidden (view full) --- 651 PARSEOP_CLOSE_PAREN {$$ = TrLinkChildren ($<n>3,2,$4,$5);} 652 | PARSEOP_FROMBCD 653 PARSEOP_OPEN_PAREN 654 error PARSEOP_CLOSE_PAREN {$$ = AslDoError(); yyclearin;} 655 ; 656 657FunctionTerm 658 : PARSEOP_FUNCTION |
548 PARSEOP_OPEN_PAREN {$<n>$ = TrCreateLeafNode (PARSEOP_METHOD);} | 659 PARSEOP_OPEN_PAREN {COMMENT_CAPTURE_OFF; $<n>$ = TrCreateLeafNode (PARSEOP_METHOD); } |
549 NameString 550 OptionalParameterTypePackage 551 OptionalParameterTypesPackage | 660 NameString 661 OptionalParameterTypePackage 662 OptionalParameterTypesPackage |
552 PARSEOP_CLOSE_PAREN '{' | 663 PARSEOP_CLOSE_PAREN '{' {COMMENT_CAPTURE_ON; } |
553 TermList '}' {$$ = TrLinkChildren ($<n>3,7, 554 TrSetNodeFlags ($4, NODE_IS_NAME_DECLARATION), 555 TrCreateValuedLeafNode (PARSEOP_BYTECONST, 0), 556 TrCreateLeafNode (PARSEOP_SERIALIZERULE_NOTSERIAL), | 664 TermList '}' {$$ = TrLinkChildren ($<n>3,7, 665 TrSetNodeFlags ($4, NODE_IS_NAME_DECLARATION), 666 TrCreateValuedLeafNode (PARSEOP_BYTECONST, 0), 667 TrCreateLeafNode (PARSEOP_SERIALIZERULE_NOTSERIAL), |
557 TrCreateValuedLeafNode (PARSEOP_BYTECONST, 0),$5,$6,$9);} | 668 TrCreateValuedLeafNode (PARSEOP_BYTECONST, 0),$5,$6,$10);} |
558 | PARSEOP_FUNCTION 559 PARSEOP_OPEN_PAREN 560 error PARSEOP_CLOSE_PAREN {$$ = AslDoError(); yyclearin;} 561 ; 562 563IfTerm 564 : PARSEOP_IF 565 PARSEOP_OPEN_PAREN {$<n>$ = TrCreateLeafNode (PARSEOP_IF);} --- 207 unchanged lines hidden (view full) --- 773 PARSEOP_CLOSE_PAREN {$$ = TrLinkChildren ($<n>3,6,$4,$6,$7,$9,$10,$11);} 774 | PARSEOP_MATCH 775 PARSEOP_OPEN_PAREN 776 error PARSEOP_CLOSE_PAREN {$$ = AslDoError(); yyclearin;} 777 ; 778 779MethodTerm 780 : PARSEOP_METHOD | 669 | PARSEOP_FUNCTION 670 PARSEOP_OPEN_PAREN 671 error PARSEOP_CLOSE_PAREN {$$ = AslDoError(); yyclearin;} 672 ; 673 674IfTerm 675 : PARSEOP_IF 676 PARSEOP_OPEN_PAREN {$<n>$ = TrCreateLeafNode (PARSEOP_IF);} --- 207 unchanged lines hidden (view full) --- 884 PARSEOP_CLOSE_PAREN {$$ = TrLinkChildren ($<n>3,6,$4,$6,$7,$9,$10,$11);} 885 | PARSEOP_MATCH 886 PARSEOP_OPEN_PAREN 887 error PARSEOP_CLOSE_PAREN {$$ = AslDoError(); yyclearin;} 888 ; 889 890MethodTerm 891 : PARSEOP_METHOD |
781 PARSEOP_OPEN_PAREN {$<n>$ = TrCreateLeafNode (PARSEOP_METHOD);} | 892 PARSEOP_OPEN_PAREN {$<n>$ = TrCreateLeafNode (PARSEOP_METHOD); COMMENT_CAPTURE_OFF;} |
782 NameString 783 OptionalByteConstExpr {UtCheckIntegerRange ($5, 0, 7);} 784 OptionalSerializeRuleKeyword 785 OptionalByteConstExpr 786 OptionalParameterTypePackage 787 OptionalParameterTypesPackage | 893 NameString 894 OptionalByteConstExpr {UtCheckIntegerRange ($5, 0, 7);} 895 OptionalSerializeRuleKeyword 896 OptionalByteConstExpr 897 OptionalParameterTypePackage 898 OptionalParameterTypesPackage |
788 PARSEOP_CLOSE_PAREN '{' | 899 PARSEOP_CLOSE_PAREN '{' {COMMENT_CAPTURE_ON;} |
789 TermList '}' {$$ = TrLinkChildren ($<n>3,7, 790 TrSetNodeFlags ($4, NODE_IS_NAME_DECLARATION), | 900 TermList '}' {$$ = TrLinkChildren ($<n>3,7, 901 TrSetNodeFlags ($4, NODE_IS_NAME_DECLARATION), |
791 $5,$7,$8,$9,$10,$13);} | 902 $5,$7,$8,$9,$10,$14);} |
792 | PARSEOP_METHOD 793 PARSEOP_OPEN_PAREN 794 error PARSEOP_CLOSE_PAREN {$$ = AslDoError(); yyclearin;} 795 ; 796 797MidTerm 798 : PARSEOP_MID 799 PARSEOP_OPEN_PAREN {$<n>$ = TrCreateLeafNode (PARSEOP_MID);} --- 564 unchanged lines hidden --- | 903 | PARSEOP_METHOD 904 PARSEOP_OPEN_PAREN 905 error PARSEOP_CLOSE_PAREN {$$ = AslDoError(); yyclearin;} 906 ; 907 908MidTerm 909 : PARSEOP_MID 910 PARSEOP_OPEN_PAREN {$<n>$ = TrCreateLeafNode (PARSEOP_MID);} --- 564 unchanged lines hidden --- |