1288425SjkimNoEcho(' 2288425Sjkim/****************************************************************************** 3288425Sjkim * 4288425Sjkim * Module Name: aslcstyle.y - Production rules for symbolic operators 5288425Sjkim * 6288425Sjkim *****************************************************************************/ 7288425Sjkim 8288425Sjkim/* 9298714Sjkim * Copyright (C) 2000 - 2016, Intel Corp. 10288425Sjkim * All rights reserved. 11288425Sjkim * 12288425Sjkim * Redistribution and use in source and binary forms, with or without 13288425Sjkim * modification, are permitted provided that the following conditions 14288425Sjkim * are met: 15288425Sjkim * 1. Redistributions of source code must retain the above copyright 16288425Sjkim * notice, this list of conditions, and the following disclaimer, 17288425Sjkim * without modification. 18288425Sjkim * 2. Redistributions in binary form must reproduce at minimum a disclaimer 19288425Sjkim * substantially similar to the "NO WARRANTY" disclaimer below 20288425Sjkim * ("Disclaimer") and any redistribution must be conditioned upon 21288425Sjkim * including a substantially similar Disclaimer requirement for further 22288425Sjkim * binary redistribution. 23288425Sjkim * 3. Neither the names of the above-listed copyright holders nor the names 24288425Sjkim * of any contributors may be used to endorse or promote products derived 25288425Sjkim * from this software without specific prior written permission. 26288425Sjkim * 27288425Sjkim * Alternatively, this software may be distributed under the terms of the 28288425Sjkim * GNU General Public License ("GPL") version 2 as published by the Free 29288425Sjkim * Software Foundation. 30288425Sjkim * 31288425Sjkim * NO WARRANTY 32288425Sjkim * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 33288425Sjkim * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 34288425Sjkim * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR 35288425Sjkim * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 36288425Sjkim * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 37288425Sjkim * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 38288425Sjkim * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 39288425Sjkim * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 40288425Sjkim * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING 41288425Sjkim * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 42288425Sjkim * POSSIBILITY OF SUCH DAMAGES. 43288425Sjkim */ 44288425Sjkim 45288425Sjkim') 46288425Sjkim 47288425Sjkim/******************************************************************************* 48288425Sjkim * 49288425Sjkim * Production rules for the symbolic (c-style) operators 50288425Sjkim * 51288425Sjkim ******************************************************************************/ 52288425Sjkim 53288425Sjkim/* 54288425Sjkim * ASL Extensions: C-style math/logical operators and expressions. 55288425Sjkim * The implementation transforms these operators into the standard 56288425Sjkim * AML opcodes and syntax. 57288425Sjkim * 58288425Sjkim * Supported operators and precedence rules (high-to-low) 59288425Sjkim * 60288425Sjkim * NOTE: The operator precedence and associativity rules are 61288425Sjkim * implemented by the tokens in asltokens.y 62288425Sjkim * 63288425Sjkim * (left-to-right): 64288425Sjkim * 1) ( ) expr++ expr-- 65288425Sjkim * 66288425Sjkim * (right-to-left): 67288425Sjkim * 2) ! ~ 68288425Sjkim * 69288425Sjkim * (left-to-right): 70288425Sjkim * 3) * / % 71288425Sjkim * 4) + - 72288425Sjkim * 5) >> << 73288425Sjkim * 6) < > <= >= 74288425Sjkim * 7) == != 75288425Sjkim * 8) & 76288425Sjkim * 9) ^ 77288425Sjkim * 10) | 78288425Sjkim * 11) && 79288425Sjkim * 12) || 80288425Sjkim * 81288425Sjkim * (right-to-left): 82288425Sjkim * 13) = += -= *= /= %= <<= >>= &= ^= |= 83288425Sjkim */ 84288425Sjkim 85288425SjkimExpression 86288425Sjkim 87288425Sjkim /* Unary operators */ 88288425Sjkim 89288425Sjkim : PARSEOP_EXP_LOGICAL_NOT {$<n>$ = TrCreateLeafNode (PARSEOP_LNOT);} 90288425Sjkim TermArg {$$ = TrLinkChildren ($<n>2,1,$3);} 91288425Sjkim | PARSEOP_EXP_NOT {$<n>$ = TrCreateLeafNode (PARSEOP_NOT);} 92288425Sjkim TermArg {$$ = TrLinkChildren ($<n>2,2,$3,TrCreateNullTarget ());} 93288425Sjkim 94288425Sjkim | SuperName PARSEOP_EXP_INCREMENT {$<n>$ = TrCreateLeafNode (PARSEOP_INCREMENT);} 95288425Sjkim {$$ = TrLinkChildren ($<n>3,1,$1);} 96288425Sjkim | SuperName PARSEOP_EXP_DECREMENT {$<n>$ = TrCreateLeafNode (PARSEOP_DECREMENT);} 97288425Sjkim {$$ = TrLinkChildren ($<n>3,1,$1);} 98288425Sjkim 99288425Sjkim /* Binary operators: math and logical */ 100288425Sjkim 101288425Sjkim | TermArg PARSEOP_EXP_ADD {$<n>$ = TrCreateLeafNode (PARSEOP_ADD);} 102288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());} 103288425Sjkim | TermArg PARSEOP_EXP_DIVIDE {$<n>$ = TrCreateLeafNode (PARSEOP_DIVIDE);} 104288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,4,$1,$4,TrCreateNullTarget (), 105288425Sjkim TrCreateNullTarget ());} 106288425Sjkim | TermArg PARSEOP_EXP_MODULO {$<n>$ = TrCreateLeafNode (PARSEOP_MOD);} 107288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());} 108288425Sjkim | TermArg PARSEOP_EXP_MULTIPLY {$<n>$ = TrCreateLeafNode (PARSEOP_MULTIPLY);} 109288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());} 110288425Sjkim | TermArg PARSEOP_EXP_SHIFT_LEFT {$<n>$ = TrCreateLeafNode (PARSEOP_SHIFTLEFT);} 111288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());} 112288425Sjkim | TermArg PARSEOP_EXP_SHIFT_RIGHT {$<n>$ = TrCreateLeafNode (PARSEOP_SHIFTRIGHT);} 113288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());} 114288425Sjkim | TermArg PARSEOP_EXP_SUBTRACT {$<n>$ = TrCreateLeafNode (PARSEOP_SUBTRACT);} 115288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());} 116288425Sjkim 117288425Sjkim | TermArg PARSEOP_EXP_AND {$<n>$ = TrCreateLeafNode (PARSEOP_AND);} 118288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());} 119288425Sjkim | TermArg PARSEOP_EXP_OR {$<n>$ = TrCreateLeafNode (PARSEOP_OR);} 120288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());} 121288425Sjkim | TermArg PARSEOP_EXP_XOR {$<n>$ = TrCreateLeafNode (PARSEOP_XOR);} 122288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());} 123288425Sjkim 124288425Sjkim | TermArg PARSEOP_EXP_GREATER {$<n>$ = TrCreateLeafNode (PARSEOP_LGREATER);} 125288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);} 126288425Sjkim | TermArg PARSEOP_EXP_GREATER_EQUAL {$<n>$ = TrCreateLeafNode (PARSEOP_LGREATEREQUAL);} 127288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);} 128288425Sjkim | TermArg PARSEOP_EXP_LESS {$<n>$ = TrCreateLeafNode (PARSEOP_LLESS);} 129288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);} 130288425Sjkim | TermArg PARSEOP_EXP_LESS_EQUAL {$<n>$ = TrCreateLeafNode (PARSEOP_LLESSEQUAL);} 131288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);} 132288425Sjkim 133288425Sjkim | TermArg PARSEOP_EXP_EQUAL {$<n>$ = TrCreateLeafNode (PARSEOP_LEQUAL);} 134288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);} 135288425Sjkim | TermArg PARSEOP_EXP_NOT_EQUAL {$<n>$ = TrCreateLeafNode (PARSEOP_LNOTEQUAL);} 136288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);} 137288425Sjkim 138288425Sjkim | TermArg PARSEOP_EXP_LOGICAL_AND {$<n>$ = TrCreateLeafNode (PARSEOP_LAND);} 139288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);} 140288425Sjkim | TermArg PARSEOP_EXP_LOGICAL_OR {$<n>$ = TrCreateLeafNode (PARSEOP_LOR);} 141288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);} 142288425Sjkim 143288425Sjkim /* Parentheses */ 144288425Sjkim 145288425Sjkim | '(' TermArg ')' { $$ = $2;} 146288425Sjkim 147288425Sjkim /* Index term -- "= BUF1[5]" on right-hand side of an equals (source) */ 148288425Sjkim 149288425Sjkim | SuperName PARSEOP_EXP_INDEX_LEFT TermArg PARSEOP_EXP_INDEX_RIGHT 150288425Sjkim {$$ = TrCreateLeafNode (PARSEOP_INDEX); 151288425Sjkim TrLinkChildren ($$,3,$1,$3,TrCreateNullTarget ());} 152288425Sjkim ; 153288425Sjkim 154288425Sjkim /* Index term -- "BUF1[5] = " on left-hand side of an equals (target) */ 155288425Sjkim 156288425SjkimIndexExpTerm 157288425Sjkim 158288425Sjkim : SuperName PARSEOP_EXP_INDEX_LEFT TermArg PARSEOP_EXP_INDEX_RIGHT 159288425Sjkim {$$ = TrCreateLeafNode (PARSEOP_INDEX); 160288425Sjkim TrLinkChildren ($$,3,$1,$3,TrCreateNullTarget ());} 161288425Sjkim ; 162288425Sjkim 163288425SjkimEqualsTerm 164288425Sjkim 165288425Sjkim /* All assignment-type operations */ 166288425Sjkim 167288425Sjkim : SuperName PARSEOP_EXP_EQUALS 168288425Sjkim TermArg {$$ = TrCreateAssignmentNode ($1, $3);} 169288425Sjkim 170288425Sjkim | TermArg PARSEOP_EXP_ADD_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_ADD);} 171288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4, 172288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 173288425Sjkim 174288425Sjkim | TermArg PARSEOP_EXP_DIV_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_DIVIDE);} 175288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,4,$1,$4,TrCreateNullTarget (), 176288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 177288425Sjkim 178288425Sjkim | TermArg PARSEOP_EXP_MOD_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_MOD);} 179288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4, 180288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 181288425Sjkim 182288425Sjkim | TermArg PARSEOP_EXP_MUL_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_MULTIPLY);} 183288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4, 184288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 185288425Sjkim 186288425Sjkim | TermArg PARSEOP_EXP_SHL_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_SHIFTLEFT);} 187288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4, 188288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 189288425Sjkim 190288425Sjkim | TermArg PARSEOP_EXP_SHR_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_SHIFTRIGHT);} 191288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4, 192288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 193288425Sjkim 194288425Sjkim | TermArg PARSEOP_EXP_SUB_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_SUBTRACT);} 195288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4, 196288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 197288425Sjkim 198288425Sjkim | TermArg PARSEOP_EXP_AND_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_AND);} 199288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4, 200288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 201288425Sjkim 202288425Sjkim | TermArg PARSEOP_EXP_OR_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_OR);} 203288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4, 204288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 205288425Sjkim 206288425Sjkim | TermArg PARSEOP_EXP_XOR_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_XOR);} 207288425Sjkim TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4, 208288425Sjkim TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));} 209288425Sjkim ; 210