-
Notifications
You must be signed in to change notification settings - Fork 979
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Call value ternary #1501
Merged
Merged
Call value ternary #1501
Changes from 5 commits
Commits
Show all changes
8 commits
Select commit
Hold shift + click to select a range
cfb53e8
support ternary in call value
0xalpharush eb49e39
support ternaries in both call options, refactor index access
0xalpharush a1a0abe
support parenthetical ternary expr and update tests
0xalpharush a1343a8
update function name
0xalpharush ca252f1
spelling and linting
0xalpharush baf4143
move nested logic into functions
0xalpharush b68f4c1
pylint
0xalpharush 254f02b
Update expression_manipulations.py
montyly File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -28,15 +28,23 @@ def f_expressions( | |
e._expressions.append(x) | ||
|
||
|
||
def f_call(e, x): | ||
def f_call(e: CallExpression, x): | ||
e._arguments.append(x) | ||
|
||
|
||
def f_call_value(e: CallExpression, x): | ||
e._value = x | ||
|
||
|
||
def f_call_gas(e: CallExpression, x): | ||
e._gas = x | ||
|
||
|
||
def f_expression(e, x): | ||
e._expression = x | ||
|
||
|
||
def f_called(e, x): | ||
def f_called(e: CallExpression, x): | ||
e._called = x | ||
|
||
|
||
|
@@ -53,13 +61,20 @@ def __init__(self, expression: Union[AssignmentOperation, ConditionalExpression] | |
self.condition = None | ||
self.copy_expression(expression, self.true_expression, self.false_expression) | ||
|
||
def apply_copy( | ||
def conditional_not_ahead( | ||
self, | ||
next_expr: Expression, | ||
true_expression: Union[AssignmentOperation, MemberAccess], | ||
false_expression: Union[AssignmentOperation, MemberAccess], | ||
f: Callable, | ||
) -> bool: | ||
# look ahead for parenthetical expression (.. ? .. : ..) | ||
if ( | ||
isinstance(next_expr, TupleExpression) | ||
and len(next_expr.expressions) == 1 | ||
and isinstance(next_expr.expressions[0], ConditionalExpression) | ||
): | ||
next_expr = next_expr.expressions[0] | ||
|
||
if isinstance(next_expr, ConditionalExpression): | ||
f(true_expression, copy.copy(next_expr.then_expression)) | ||
|
@@ -91,43 +106,85 @@ def copy_expression( | |
# (.. ? .. : ..).add | ||
if isinstance(expression, MemberAccess): | ||
next_expr = expression.expression | ||
if self.apply_copy(next_expr, true_expression, false_expression, f_expression): | ||
if self.conditional_not_ahead( | ||
next_expr, true_expression, false_expression, f_expression | ||
): | ||
self.copy_expression( | ||
next_expr, true_expression.expression, false_expression.expression | ||
) | ||
|
||
# pylint: disable=too-many-nested-blocks | ||
elif isinstance(expression, (AssignmentOperation, BinaryOperation, TupleExpression)): | ||
true_expression._expressions = [] | ||
false_expression._expressions = [] | ||
|
||
for next_expr in expression.expressions: | ||
if isinstance(next_expr, IndexAccess): | ||
# create an index access for each branch | ||
if isinstance(next_expr.expression_right, ConditionalExpression): | ||
next_expr = _handle_ternary_access( | ||
next_expr, true_expression, false_expression | ||
# TODO: can we get rid of `NoneType` expressions in `TupleExpression`? | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Not sure, my intuition tells me that could happen with unnamed tuple (ex: |
||
if next_expr: | ||
if isinstance(next_expr, IndexAccess): | ||
# create an index access for each branch | ||
# x[if cond ? 1 : 2] -> if cond { x[1] } else { x[2] } | ||
for expr in next_expr.expressions: | ||
if self.conditional_not_ahead( | ||
expr, true_expression, false_expression, f_expressions | ||
): | ||
self.copy_expression( | ||
expr, | ||
true_expression.expressions[-1], | ||
false_expression.expressions[-1], | ||
) | ||
|
||
if self.conditional_not_ahead( | ||
next_expr, true_expression, false_expression, f_expressions | ||
): | ||
# always on last arguments added | ||
self.copy_expression( | ||
next_expr, | ||
true_expression.expressions[-1], | ||
false_expression.expressions[-1], | ||
) | ||
if self.apply_copy(next_expr, true_expression, false_expression, f_expressions): | ||
# always on last arguments added | ||
self.copy_expression( | ||
next_expr, | ||
true_expression.expressions[-1], | ||
false_expression.expressions[-1], | ||
) | ||
|
||
elif isinstance(expression, CallExpression): | ||
next_expr = expression.called | ||
|
||
# case of lib | ||
# (.. ? .. : ..).add | ||
if self.apply_copy(next_expr, true_expression, false_expression, f_called): | ||
if self.conditional_not_ahead(next_expr, true_expression, false_expression, f_called): | ||
self.copy_expression(next_expr, true_expression.called, false_expression.called) | ||
|
||
# In order to handle ternaries in both call options, gas and value, we return early if the | ||
# conditional is not ahead to rewrite both ternaries (see `_rewrite_ternary_as_if_else`). | ||
if expression.call_gas: | ||
# case of (..).func{gas: .. ? .. : ..}() | ||
next_expr = expression.call_gas | ||
if self.conditional_not_ahead( | ||
next_expr, true_expression, false_expression, f_call_gas | ||
): | ||
self.copy_expression( | ||
next_expr, | ||
true_expression.call_gas, | ||
false_expression.call_gas, | ||
) | ||
else: | ||
return | ||
|
||
if expression.call_value: | ||
# case of (..).func{value: .. ? .. : ..}() | ||
next_expr = expression.call_value | ||
if self.conditional_not_ahead( | ||
next_expr, true_expression, false_expression, f_call_value | ||
): | ||
self.copy_expression( | ||
next_expr, | ||
true_expression.call_value, | ||
false_expression.call_value, | ||
) | ||
else: | ||
return | ||
|
||
true_expression._arguments = [] | ||
false_expression._arguments = [] | ||
|
||
for next_expr in expression.arguments: | ||
if self.apply_copy(next_expr, true_expression, false_expression, f_call): | ||
if self.conditional_not_ahead(next_expr, true_expression, false_expression, f_call): | ||
# always on last arguments added | ||
self.copy_expression( | ||
next_expr, | ||
|
@@ -137,7 +194,9 @@ def copy_expression( | |
|
||
elif isinstance(expression, (TypeConversion, UnaryOperation)): | ||
next_expr = expression.expression | ||
if self.apply_copy(next_expr, true_expression, false_expression, f_expression): | ||
if self.conditional_not_ahead( | ||
next_expr, true_expression, false_expression, f_expression | ||
): | ||
self.copy_expression( | ||
expression.expression, | ||
true_expression.expression, | ||
|
@@ -148,35 +207,3 @@ def copy_expression( | |
raise SlitherException( | ||
f"Ternary operation not handled {expression}({type(expression)})" | ||
) | ||
|
||
|
||
def _handle_ternary_access( | ||
next_expr: IndexAccess, | ||
true_expression: AssignmentOperation, | ||
false_expression: AssignmentOperation, | ||
): | ||
""" | ||
Conditional ternary accesses are split into two accesses, one true and one false | ||
E.g. x[if cond ? 1 : 2] -> if cond { x[1] } else { x[2] } | ||
""" | ||
true_index_access = IndexAccess( | ||
next_expr.expression_left, | ||
next_expr.expression_right.then_expression, | ||
next_expr.type, | ||
) | ||
false_index_access = IndexAccess( | ||
next_expr.expression_left, | ||
next_expr.expression_right.else_expression, | ||
next_expr.type, | ||
) | ||
|
||
f_expressions( | ||
true_expression, | ||
true_index_access, | ||
) | ||
f_expressions( | ||
false_expression, | ||
false_index_access, | ||
) | ||
|
||
return next_expr.expression_right |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can we move part of the function's logic into internal functions?
This would reduce the code complexity, and allows us to remove this warning