| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| | |
|
| | |
|
| |
|
|
| |
This case already works.
|
| | |
|
| |
|
|
|
| |
Also support AsyncId.async[Nothing], which was triggering a NPE
in the generated `null.asInstanceOf[Nothing]`.
|
| |
|
|
|
| |
When convering If and Match nodes to ANF, set the type to Unit.
Otherwise, erasure might end up casting BoxedUnit to a real type.
|
| |
|
|
|
| |
If we intend to keep CPS fallback around for any length of time
it should probably move there too.
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
| |
- Avoid reset + retypecheck, instead hang onto the original types/symbols
- Eliminated duplication between AsyncDefinitionUseAnalyzer and ExprBuilder
- Instead, decide what do lift *after* running ExprBuilder
- Account for transitive references local classes/objects and lift them
as needed.
- Make the execution context an regular implicit parameter of the macro
- Fixes interaction with existential skolems and singleton types
Fixes #6, #13, #16, #17, #19, #21.
|
| |
|
|
| |
This allows us to cross build against 2.10.x and 2.11.x.
|
| |
|
|
|
|
| |
Rather than as @deprecated.
This commit means we can no longer build against 2.10.0.
|
| |\
| |
| | |
Allow await in applications with multiple argument lists
|
| | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
Before, we levied an implementation restriction to prevent
this. As it turned out, that needlessly prevented use of
`await` in the receiver of a multi-param-list application.
This commit lifts the restriction altogether, and treats
such applications holistically, being careful to preserve the
left-to-right evaluation order of arguments in the translated
code.
- use `TreeInfo.Applied` and `Type#paramss` from `reflect.internal`
to get the info we need
- use the parameter name for the lifted argument val, rather than
`argN`
- encapsulate handling of by-name-ness and parameter names
in `mapArgumentss`
- test for evaluation order preservation
|
| |/
|
|
|
|
| |
- move all CPS-related code to `continuations` sub package
- fix CPS-based async implementation
- enable testing of CPS-based async implementation
|
| |
|
|
| |
This time in the ANF/Inline transformation.
|
| |
|
|
|
|
|
|
|
|
|
| |
Since SI-6187, the default case of a partial function is now included in the tree.
Before, it was a tree attachment, conditionally inserted in the pattern matcher.
I had hoped that that change would allow us to do away with
`RestorePatternMatchingFunctions` altogether, but it seems that
we aren't so lucky.
Instead, I've adapted that transformer to account for the new scheme.
|
| | |
|
| | |
|
| | |
|
| | |
|
| |\
| |
| | |
Topic/patmat partial function
|
| | | |
|
| | |
| |
| |
| |
| |
| |
| | |
- Undo the transformation that takes place in Typers to
leave us with Match(EmptyTree, cases).
- Make sure we don't descend into the cases of such a
tree when peforming the async transform
|
| |/
|
|
|
|
|
|
| |
We need to unwrap and inline `xs`, then
rewrap the result expression with the wildcard
star.
Addresses the first half of #46.
|
| |
|
|
|
|
| |
We use `isExprSafeToInline` from the non-public reflection
API to check. In addtion, we now that an untyped Ident("await$N")
is also an inlinable expression.
|
| | |
|
| |
|
|
|
|
|
|
|
| |
We can allow it, but we need to treat nested
Apply trees holistically, in order to lift out
all the arguments and maintain the correct
evaluation order.
Fixes #33.
|
| |
|
|
|
|
|
|
| |
- If we lift one arg, we must lift them all.
This preserves evaluation order.
- But, never lift an by-name arg
Addresses the first half of #33.
|
| |
|
|
|
|
| |
And change TreeInterrogation to set if via this means,
rather than through a direct means, which seems to
assume too much about classloaders.
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
| |
This augments the on-complete handler for an async state with await as follows:
if (tr.isFailure)
result$async.complete(tr.asInstanceOf[Try[T]])
else {
<resultName> = tr.get.asInstanceOf[<resultType>]
<nextState>
<mkResumeApply>
}
|
| |\
| |
| | |
Port futures tests of scala.concurrent
|
| | | |
|
| | |
| |
| |
| |
| |
| | |
These tests do not use async/await, yet.
Refs #23
|
| | | |
|
| | |
| |
| |
| |
| |
| | |
We need not, and should not, rename definitions
beyond the scope of the async transform, e.g.
in nested classes of function bodies.
|
| | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
To avoid suprises in tree retyping, the instance of this
class is immediately upcase to
StateMachine[Promise[T], ExecContext].
Allow nested non-case classes. These pop up when
we use nested async calls.
Only look for duplicate names in the subtrees
traversed by AsyncTraverser.
|
| | |
| |
| |
| |
| |
| | |
Adapt the compiler's standard ResetAttrs to keep
This() nodes don't refer to a symbol defined in the
current async block.
|
| | |
| |
| |
| |
| |
| |
| |
| | |
There is a fly in the ointment: any This() trees in the provided
code are getting rebound to this class. Sounds like more
resetAttrs fun ahead.
The object also serves as the Future {} thunk.
|
| | |
| |
| |
| |
| |
| |
| | |
Any vals referred to in the body of these
must also be lifted.
Fixes #36
|
| | |
| |
| |
| |
| |
| | |
The type-checking performed in ANF transform is
precarious, and needed to use the original condition/
scrutinee in a throwaway tree to get things to work.
|
| | |
| |
| |
| |
| |
| |
| | |
These gives us something to lift to vars to be accessed
from multiple states of the state machine.
Fixes #35
|
| | | |
|
| |/
|
|
|
|
|
| |
- Add tests where the result of an await is assigned to a variable external
to the async block.
- Clean up HygieneSpec.
|
| | |
|
| |
|
|
|
|
| |
Test nested loops.
Control ANF tracing with another system property.
|
| |
|
|
| |
Closes #21
|
| | |
|
| | |
|
| | |
|
