aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
* Travis makes us work harder now to actually get OpenJDK 6Seth Tisue2017-10-191-2/+5
| | | | | as per: https://github.com/travis-ci/travis-ci/issues/8199#issuecomment-327246053
* Merge pull request #178 from retronym/tyconJason Zaugg2017-10-132-25/+39
|\ | | | | Fix decision about whether to use a trait or class as the parent
| * Fix race condition in tests and make some tests actually runJason Zaugg2017-10-131-28/+37
| |
| * Add diagnostic for intermittently failing testJason Zaugg2017-10-131-1/+6
| |
| * Fix decision about whether to use a trait or class as the parentJason Zaugg2017-10-131-1/+1
| |
* | Merge pull request #177 from retronym/topic/pushassignJason Zaugg2017-10-133-17/+42
|\ \ | |/ |/| Fix ANF transform for corner case in late transforms
| * Fix ANF transform for corner case in late transformsJason Zaugg2017-09-293-17/+42
|/ | | | | Unfortunately I wasn't able to extract a test case, but the patch has been tested to fix a problem on a real world code base.
* Merge pull request #176 from retronym/topic/extensionsJason Zaugg2017-09-273-26/+116
|\ | | | | Improve generated code and flexibility
| * Eliminate dead statesJason Zaugg2017-09-271-2/+63
| | | | | | | | | | | | | | | | | | | | | | | | | | If a state does nothing but unconditionally transition to the next state, remove it and rewrite predecessors to directly jump to the successor state (or to the first non-dead successor.) While we're doing this, compact the remaining state IDs to be contiguous, which will allow use of a tableswitch in bytecode. Sample bytecode demonstrating a tableswitch: https://gist.github.com/retronym/6880c35b501fc1c91bed7f30c0f2c045
| * Allow result field name to be externally specifiedJason Zaugg2017-09-272-2/+3
| |
| * Support future systems that perform external failure handlingJason Zaugg2017-09-273-11/+20
| |
| * Allow future system to enable more name fresheningJason Zaugg2017-09-272-13/+32
|/
* Merge pull request #173 from SethTisue/scala-2.13.0-M2v0.9.7Seth Tisue2017-08-053-4/+4
|\ | | | | support Scala 2.13.0-M2
| * support Scala 2.13.0-M2Seth Tisue2017-08-053-4/+4
|/ | | | | | | | and also move from 2.12.2 -> 2.12.3, just because and sbt 0.13.15 -> 0.13.16, also just because and scala-sbt-module 1.0.8 -> 1.0.12, because guess why
* Merge pull request #172 from rorygraves/masterJason Zaugg2017-06-2314-46/+53
|\ | | | | Reduce logging overhead and minor cleanups
| * Reduce logging overhead and minor cleanupsRory Graves2017-06-2114-46/+53
|/
* fix busted Maven badgesSeth Tisue2017-05-111-1/+1
|
* Merge pull request #170 from lrytz/module-pluginv0.9.6#2.13.0-M1#8Jason Zaugg2017-05-1017-205/+226
|\ | | | | Use scala-module-plugin, update tag-based publishing
| * Use scala-module-plugin, update tag-based publishingLukas Rytz2017-04-2617-205/+226
|/ | | | | | | The build didn't use the `scala-module-plugin` before but duplicated most of its settings - maybe I missed the reason why this is the case? Also update tag-based publishing to the latest version.
* Merge pull request #167 from jochenschneider/patch-1Jason Zaugg2017-01-301-1/+1
|\ | | | | Typo
| * TypoJochen Schneider2017-01-301-1/+1
|/
* Merge pull request #165 from mpociecha/fix-out-dir-in-testsJason Zaugg2016-11-221-1/+1
|\ | | | | In tests use tmp dir working on all operating systems
| * In tests use tmp dir working on all operating systemsMichał Pociecha2016-11-221-1/+1
|/ | | | After this change tests pass also on Windows.
* Merge pull request #164 from retronym/bump/0.9.7-SNAPSHOTJason Zaugg2016-10-302-5/+5
|\ | | | | Bump to new snapshot version
| * Bump to new snapshot versionJason Zaugg2016-10-302-5/+5
|/
* Merge pull request #163 from retronym/bump/2.12.0v0.9.6Jason Zaugg2016-10-302-2/+2
|\ | | | | Bump to Scala 2.12.0
| * Bump to Scala 2.12.0Jason Zaugg2016-10-302-2/+2
|/
* Merge pull request #162 from retronym/bump/RC2v0.9.6-RC6Jason Zaugg2016-10-182-4/+4
|\ | | | | Bump Scala version to 2.12.0-RC2
| * Bump Scala version to 2.12.0-RC2Jason Zaugg2016-10-172-4/+4
|/
* Document Scala 2.12 supportJason Zaugg2016-09-081-1/+3
|
* Merge pull request #161 from retronym/topic/matrixv0.9.6-RC5Jason Zaugg2016-09-082-11/+9
|\ | | | | Rework build logic to determine which JDK use for release build
| * Rework build logic to determine which JDK use for release buildJason Zaugg2016-09-082-11/+9
| |
* | Merge pull request #142 from knoldus/topic/doc-improvementv0.9.6-RC4Jason Zaugg2016-09-081-0/+18
|\ \ | | | | | | Add dependency information for including in project.
| * | Add dependency information for including in project.Satendra kumar2015-09-251-0/+18
| | | | | | | | | | | | Added dependency information for Maven and SBT so that it is easier for the developers who are new to the library.
* | | Merge pull request #160 from retronym/topic/2.12Jason Zaugg2016-09-088-13/+34
|\ \ \ | | |/ | |/| Compatibility with Scala 2.12.0-RC1
| * | Add maintainence warning in .travis.ymlJason Zaugg2016-09-081-2/+3
| | |
| * | Compatibility with Scala 2.12.0-RC1Jason Zaugg2016-09-088-13/+33
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | - method local lazy vals are now encoded as a single ValDef rather than a ValDef + DefDef pair. We need to treat ValDef-s with the LAZY flag in the same way as we used to treat the DefDef. - Rename one of the symbols `ANF,anf` in the same scope to avoid generating anonymous class names that differ only in case. The compiler warned about this one. - When patching the LabelDefs to have a `Unit` result type, propagate this other LabelDefs conclude with a jump to that label. Not sure why, but without this we now hit an error in the backend about the nonsensical attempt to emit a coercion from void to int. - Use crossScalaVersions in the build and update the Scala versions tested in CI.
* | | Merge pull request #155 from retronym/topic/isCompletedJason Zaugg2016-09-073-12/+15
|\ \ \ | | | | | | | | Rework extension point for checking for already-completed futures
| * | | Rework extension point for checking for already-completed futuresJason Zaugg2016-03-033-12/+15
| |/ / | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | The current extension point assumes that if a future is in the completed state, a subsequent call to get the already completed value will succeed. While this assumption holds for scala.concurrent.Future, it might not hold for a future system that has semantics like a weak reference. This commit uses a single call `getCompleted` to query the state and get the already completed value. This returns null if the value is not available.
* | | Merge pull request #159 from raboof/patch-1Jason Zaugg2016-09-071-1/+2
|\ \ \ | |/ / |/| | Fix dead link to Akka's Dataflow Concurrency
| * | Fix dead link to Akka's Dataflow ConcurrencyArnout Engelen2016-08-051-1/+2
|/ / | | | | And mention it's been removed in favour of this library.
* | Merge pull request #151 from retronym/topic/late-expansion-fixesv0.9.6-RC3Jason Zaugg2016-01-199-82/+495
|\ \ | | | | | | Late expansion fixes
| * | Various fixes to late expansionJason Zaugg2016-01-197-78/+481
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | - Detect cross-state symbol references where the RefTree is nested in a LabelDef. Failure to do so led to ill-scoped local variable references which sometimes manifest as VerifyErrors. - Emit a default case in the Match intended to be a tableswitch. We have to do this ourselves if we expand after pattern matcher - Cleanup generated code to avoid redundant blocks - Avoid unnecessary `matchRes` temporary variable for unit-typed pattern matches - Fix the trace level logging in the ANF transform to restore indented output. - Emit `{ state = nextState; ... }` rather than `try { ... } finally { state = nextState }` in state handlers. This simplifies generated code and has the same meaning, as the code in the state machine isn't reentrant and can't observe the "early" transition of the state.
| * | Use AbstractFunction as a base class to emit leaner codeJason Zaugg2016-01-191-1/+9
| | | | | | | | | | | | | | | | | | | | | | | | | | | Avoids mixing in all the specialized apply variants. We could go further and create an base class for all state machines, but that would require scala-async to be on the runtime classpath, which currently isn't a requirement. For now, I'm keeping it this way.
| * | Hooks to customize code generationJason Zaugg2015-11-103-3/+5
|/ /
* | Merge pull request #143 from retronym/ticket/prescompiler-nested-asyncv0.9.6-RC2Jason Zaugg2015-10-097-17/+63
|\ \ | |/ |/| Avoid spurious "illegal await" error in IDE with nesting
| * Avoid spurious "illegal await" error in IDE with nestingJason Zaugg2015-10-097-17/+63
|/ | | | | | | | | | | | | | | | | | | The presentation compiler runs with `-Ymacro-expand:discard`, which retains the macro expandee in the typechecked trees, rather than substituting in the expansion. This mode was motivated as a means to keep IDE functionality working (e.g. completion, navigation, refactoring) inside macro applications. However, if one has nested async macro applications, as reported in the IDE ticket: https://www.assembla.com/spaces/scala-ide/tickets/1002561 ... the expansion of the outer async application was reporting await calls enclosed by the inner async application. This change tweaks the traversers used for this analysis to stop whenever it sees an async.
* Merge pull request #141 from retronym/ticket/await-extractorv0.9.6-RC1_2.11v0.9.5-RC1_2.11Jason Zaugg2015-09-2411-55/+459
|\ | | | | Enable a compiler plugin to use the async transform after patmat
| * Small cleanups after code reviewJason Zaugg2015-09-233-12/+40
| | | | | | | | | | | | | | | | - More internal docs - Be more frugal with the `NoAwait` attachment, for some AST node types this is implied. - Just use `x`, rather than what was effectively `x.reverseMap(identity).reverse`
| * Enable a compiler plugin to use the async transform after patmatJason Zaugg2015-09-2211-54/+430
|/ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Currently, the async transformation is performed during the typer phase, like all other macros. We have to levy a few artificial restrictions on whern an async boundary may be: for instance we don't support await within a pattern guard. A more natural home for the transform would be after patterns have been translated. The test case in this commit shows how to use the async transform from a custom compiler phase after patmat. The remainder of the commit updates the implementation to handle the new tree shapes. For states that correspond to a label definition, we use `-symbol.id` as the state ID. This made it easier to emit the forward jumps to when processing the label application before we had seen the label definition. I've also made the transformation more efficient in the way it checks whether a given tree encloses an `await` call: we traverse the input tree at the start of the macro, and decorate it with tree attachments containig the answer to this question. Even after the ANF and state machine transforms introduce new layers of synthetic trees, the `containsAwait` code need only traverse shallowly through those trees to find a child that has the cached answer from the original traversal. I had to special case the ANF transform for expressions that always lead to a label jump: we avoids trying to push an assignment to a result variable into `if (cond) jump1() else jump2()`, in trees of the form: ``` % cat sandbox/jump.scala class Test { def test = { (null: Any) match { case _: String => "" case _ => "" } } } % qscalac -Xprint:patmat -Xprint-types sandbox/jump.scala def test: String = { case <synthetic> val x1: Any = (null{Null(null)}: Any){Any}; case5(){ if (x1.isInstanceOf{[T0]=> Boolean}[String]{Boolean}) matchEnd4{(x: String)String}(""{String("")}){String} else case6{()String}(){String}{String} }{String}; case6(){ matchEnd4{(x: String)String}(""{String("")}){String} }{String}; matchEnd4(x: String){ x{String} }{String} }{String} ```
generated by cgit v1.2.3 (git 2.39.1) at 2024-06-20 17:08:08 +0000