mirror of https://github.com/F-Stack/f-stack.git
210 lines
10 KiB
Plaintext
210 lines
10 KiB
Plaintext
NoEcho('
|
|
/******************************************************************************
|
|
*
|
|
* Module Name: aslcstyle.y - Production rules for symbolic operators
|
|
*
|
|
*****************************************************************************/
|
|
|
|
/*
|
|
* Copyright (C) 2000 - 2016, Intel Corp.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions, and the following disclaimer,
|
|
* without modification.
|
|
* 2. Redistributions in binary form must reproduce at minimum a disclaimer
|
|
* substantially similar to the "NO WARRANTY" disclaimer below
|
|
* ("Disclaimer") and any redistribution must be conditioned upon
|
|
* including a substantially similar Disclaimer requirement for further
|
|
* binary redistribution.
|
|
* 3. Neither the names of the above-listed copyright holders nor the names
|
|
* of any contributors may be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
*
|
|
* Alternatively, this software may be distributed under the terms of the
|
|
* GNU General Public License ("GPL") version 2 as published by the Free
|
|
* Software Foundation.
|
|
*
|
|
* NO WARRANTY
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
|
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGES.
|
|
*/
|
|
|
|
')
|
|
|
|
/*******************************************************************************
|
|
*
|
|
* Production rules for the symbolic (c-style) operators
|
|
*
|
|
******************************************************************************/
|
|
|
|
/*
|
|
* ASL Extensions: C-style math/logical operators and expressions.
|
|
* The implementation transforms these operators into the standard
|
|
* AML opcodes and syntax.
|
|
*
|
|
* Supported operators and precedence rules (high-to-low)
|
|
*
|
|
* NOTE: The operator precedence and associativity rules are
|
|
* implemented by the tokens in asltokens.y
|
|
*
|
|
* (left-to-right):
|
|
* 1) ( ) expr++ expr--
|
|
*
|
|
* (right-to-left):
|
|
* 2) ! ~
|
|
*
|
|
* (left-to-right):
|
|
* 3) * / %
|
|
* 4) + -
|
|
* 5) >> <<
|
|
* 6) < > <= >=
|
|
* 7) == !=
|
|
* 8) &
|
|
* 9) ^
|
|
* 10) |
|
|
* 11) &&
|
|
* 12) ||
|
|
*
|
|
* (right-to-left):
|
|
* 13) = += -= *= /= %= <<= >>= &= ^= |=
|
|
*/
|
|
|
|
Expression
|
|
|
|
/* Unary operators */
|
|
|
|
: PARSEOP_EXP_LOGICAL_NOT {$<n>$ = TrCreateLeafNode (PARSEOP_LNOT);}
|
|
TermArg {$$ = TrLinkChildren ($<n>2,1,$3);}
|
|
| PARSEOP_EXP_NOT {$<n>$ = TrCreateLeafNode (PARSEOP_NOT);}
|
|
TermArg {$$ = TrLinkChildren ($<n>2,2,$3,TrCreateNullTarget ());}
|
|
|
|
| SuperName PARSEOP_EXP_INCREMENT {$<n>$ = TrCreateLeafNode (PARSEOP_INCREMENT);}
|
|
{$$ = TrLinkChildren ($<n>3,1,$1);}
|
|
| SuperName PARSEOP_EXP_DECREMENT {$<n>$ = TrCreateLeafNode (PARSEOP_DECREMENT);}
|
|
{$$ = TrLinkChildren ($<n>3,1,$1);}
|
|
|
|
/* Binary operators: math and logical */
|
|
|
|
| TermArg PARSEOP_EXP_ADD {$<n>$ = TrCreateLeafNode (PARSEOP_ADD);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());}
|
|
| TermArg PARSEOP_EXP_DIVIDE {$<n>$ = TrCreateLeafNode (PARSEOP_DIVIDE);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,4,$1,$4,TrCreateNullTarget (),
|
|
TrCreateNullTarget ());}
|
|
| TermArg PARSEOP_EXP_MODULO {$<n>$ = TrCreateLeafNode (PARSEOP_MOD);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());}
|
|
| TermArg PARSEOP_EXP_MULTIPLY {$<n>$ = TrCreateLeafNode (PARSEOP_MULTIPLY);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());}
|
|
| TermArg PARSEOP_EXP_SHIFT_LEFT {$<n>$ = TrCreateLeafNode (PARSEOP_SHIFTLEFT);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());}
|
|
| TermArg PARSEOP_EXP_SHIFT_RIGHT {$<n>$ = TrCreateLeafNode (PARSEOP_SHIFTRIGHT);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());}
|
|
| TermArg PARSEOP_EXP_SUBTRACT {$<n>$ = TrCreateLeafNode (PARSEOP_SUBTRACT);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());}
|
|
|
|
| TermArg PARSEOP_EXP_AND {$<n>$ = TrCreateLeafNode (PARSEOP_AND);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());}
|
|
| TermArg PARSEOP_EXP_OR {$<n>$ = TrCreateLeafNode (PARSEOP_OR);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());}
|
|
| TermArg PARSEOP_EXP_XOR {$<n>$ = TrCreateLeafNode (PARSEOP_XOR);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,TrCreateNullTarget ());}
|
|
|
|
| TermArg PARSEOP_EXP_GREATER {$<n>$ = TrCreateLeafNode (PARSEOP_LGREATER);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);}
|
|
| TermArg PARSEOP_EXP_GREATER_EQUAL {$<n>$ = TrCreateLeafNode (PARSEOP_LGREATEREQUAL);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);}
|
|
| TermArg PARSEOP_EXP_LESS {$<n>$ = TrCreateLeafNode (PARSEOP_LLESS);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);}
|
|
| TermArg PARSEOP_EXP_LESS_EQUAL {$<n>$ = TrCreateLeafNode (PARSEOP_LLESSEQUAL);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);}
|
|
|
|
| TermArg PARSEOP_EXP_EQUAL {$<n>$ = TrCreateLeafNode (PARSEOP_LEQUAL);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);}
|
|
| TermArg PARSEOP_EXP_NOT_EQUAL {$<n>$ = TrCreateLeafNode (PARSEOP_LNOTEQUAL);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);}
|
|
|
|
| TermArg PARSEOP_EXP_LOGICAL_AND {$<n>$ = TrCreateLeafNode (PARSEOP_LAND);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);}
|
|
| TermArg PARSEOP_EXP_LOGICAL_OR {$<n>$ = TrCreateLeafNode (PARSEOP_LOR);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,2,$1,$4);}
|
|
|
|
/* Parentheses */
|
|
|
|
| '(' TermArg ')' { $$ = $2;}
|
|
|
|
/* Index term -- "= BUF1[5]" on right-hand side of an equals (source) */
|
|
|
|
| SuperName PARSEOP_EXP_INDEX_LEFT TermArg PARSEOP_EXP_INDEX_RIGHT
|
|
{$$ = TrCreateLeafNode (PARSEOP_INDEX);
|
|
TrLinkChildren ($$,3,$1,$3,TrCreateNullTarget ());}
|
|
;
|
|
|
|
/* Index term -- "BUF1[5] = " on left-hand side of an equals (target) */
|
|
|
|
IndexExpTerm
|
|
|
|
: SuperName PARSEOP_EXP_INDEX_LEFT TermArg PARSEOP_EXP_INDEX_RIGHT
|
|
{$$ = TrCreateLeafNode (PARSEOP_INDEX);
|
|
TrLinkChildren ($$,3,$1,$3,TrCreateNullTarget ());}
|
|
;
|
|
|
|
EqualsTerm
|
|
|
|
/* All assignment-type operations */
|
|
|
|
: SuperName PARSEOP_EXP_EQUALS
|
|
TermArg {$$ = TrCreateAssignmentNode ($1, $3);}
|
|
|
|
| TermArg PARSEOP_EXP_ADD_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_ADD);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
|
|
| TermArg PARSEOP_EXP_DIV_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_DIVIDE);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,4,$1,$4,TrCreateNullTarget (),
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
|
|
| TermArg PARSEOP_EXP_MOD_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_MOD);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
|
|
| TermArg PARSEOP_EXP_MUL_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_MULTIPLY);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
|
|
| TermArg PARSEOP_EXP_SHL_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_SHIFTLEFT);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
|
|
| TermArg PARSEOP_EXP_SHR_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_SHIFTRIGHT);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
|
|
| TermArg PARSEOP_EXP_SUB_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_SUBTRACT);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
|
|
| TermArg PARSEOP_EXP_AND_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_AND);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
|
|
| TermArg PARSEOP_EXP_OR_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_OR);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
|
|
| TermArg PARSEOP_EXP_XOR_EQ {$<n>$ = TrCreateLeafNode (PARSEOP_XOR);}
|
|
TermArg {$$ = TrLinkChildren ($<n>3,3,$1,$4,
|
|
TrSetNodeFlags (TrCreateTargetOperand ($1, NULL), NODE_IS_TARGET));}
|
|
;
|