mirror of
https://github.com/nim-lang/Nim.git
synced 2026-01-05 04:27:44 +00:00
364 lines
13 KiB
Nim
364 lines
13 KiB
Nim
#
|
|
#
|
|
# Nim's Runtime Library
|
|
# (c) Copyright 2015 Dominik Picheta
|
|
#
|
|
# See the file "copying.txt", included in this
|
|
# distribution, for details about the copyright.
|
|
#
|
|
|
|
## `asyncdispatch` module depends on the `asyncmacro` module to work properly.
|
|
|
|
import macros, strutils, asyncfutures
|
|
|
|
|
|
# TODO: Ref https://github.com/nim-lang/Nim/issues/5617
|
|
# TODO: Add more line infos
|
|
proc newCallWithLineInfo(fromNode: NimNode; theProc: NimNode, args: varargs[NimNode]): NimNode =
|
|
result = newCall(theProc, args)
|
|
result.copyLineInfo(fromNode)
|
|
|
|
template createCb(retFutureSym, iteratorNameSym,
|
|
strName, identName, futureVarCompletions: untyped) =
|
|
bind finished
|
|
|
|
var nameIterVar = iteratorNameSym
|
|
proc identName {.closure.} =
|
|
try:
|
|
if not nameIterVar.finished:
|
|
var next = nameIterVar()
|
|
# Continue while the yielded future is already finished.
|
|
while (not next.isNil) and next.finished:
|
|
next = nameIterVar()
|
|
if nameIterVar.finished:
|
|
break
|
|
|
|
if next == nil:
|
|
if not retFutureSym.finished:
|
|
let msg = "Async procedure ($1) yielded `nil`, are you await'ing a " &
|
|
"`nil` Future?"
|
|
raise newException(AssertionDefect, msg % strName)
|
|
else:
|
|
{.gcsafe.}:
|
|
{.push hint[ConvFromXtoItselfNotNeeded]: off.}
|
|
next.addCallback cast[proc() {.closure, gcsafe.}](identName)
|
|
{.pop.}
|
|
except:
|
|
futureVarCompletions
|
|
if retFutureSym.finished:
|
|
# Take a look at tasyncexceptions for the bug which this fixes.
|
|
# That test explains it better than I can here.
|
|
raise
|
|
else:
|
|
retFutureSym.fail(getCurrentException())
|
|
identName()
|
|
|
|
proc createFutureVarCompletions(futureVarIdents: seq[NimNode],
|
|
fromNode: NimNode): NimNode {.compileTime.} =
|
|
result = newNimNode(nnkStmtList, fromNode)
|
|
# Add calls to complete each FutureVar parameter.
|
|
for ident in futureVarIdents:
|
|
# Only complete them if they have not been completed already by the user.
|
|
# In the meantime, this was really useful for debugging :)
|
|
#result.add(newCall(newIdentNode("echo"), newStrLitNode(fromNode.lineinfo)))
|
|
result.add newIfStmt(
|
|
(
|
|
newCall(newIdentNode("not"),
|
|
newDotExpr(ident, newIdentNode("finished"))),
|
|
newCallWithLineInfo(fromNode, newIdentNode("complete"), ident)
|
|
)
|
|
)
|
|
|
|
proc processBody(node, retFutureSym: NimNode,
|
|
subTypeIsVoid: bool,
|
|
futureVarIdents: seq[NimNode]): NimNode {.compileTime.} =
|
|
#echo(node.treeRepr)
|
|
result = node
|
|
case node.kind
|
|
of nnkReturnStmt:
|
|
result = newNimNode(nnkStmtList, node)
|
|
|
|
# As I've painfully found out, the order here really DOES matter.
|
|
result.add createFutureVarCompletions(futureVarIdents, node)
|
|
|
|
if node[0].kind == nnkEmpty:
|
|
if not subTypeIsVoid:
|
|
result.add newCall(newIdentNode("complete"), retFutureSym,
|
|
newIdentNode("result"))
|
|
else:
|
|
result.add newCall(newIdentNode("complete"), retFutureSym)
|
|
else:
|
|
let x = node[0].processBody(retFutureSym, subTypeIsVoid,
|
|
futureVarIdents)
|
|
if x.kind == nnkYieldStmt: result.add x
|
|
else:
|
|
result.add newCall(newIdentNode("complete"), retFutureSym, x)
|
|
|
|
result.add newNimNode(nnkReturnStmt, node).add(newNilLit())
|
|
return # Don't process the children of this return stmt
|
|
of RoutineNodes-{nnkTemplateDef}:
|
|
# skip all the nested procedure definitions
|
|
return
|
|
else: discard
|
|
|
|
for i in 0 ..< result.len:
|
|
result[i] = processBody(result[i], retFutureSym, subTypeIsVoid,
|
|
futureVarIdents)
|
|
|
|
# echo result.repr
|
|
|
|
proc getName(node: NimNode): string {.compileTime.} =
|
|
case node.kind
|
|
of nnkPostfix:
|
|
return node[1].strVal
|
|
of nnkIdent, nnkSym:
|
|
return node.strVal
|
|
of nnkEmpty:
|
|
return "anonymous"
|
|
else:
|
|
error("Unknown name.", node)
|
|
|
|
proc getFutureVarIdents(params: NimNode): seq[NimNode] {.compileTime.} =
|
|
result = @[]
|
|
for i in 1 ..< len(params):
|
|
expectKind(params[i], nnkIdentDefs)
|
|
if params[i][1].kind == nnkBracketExpr and
|
|
params[i][1][0].eqIdent(FutureVar.astToStr):
|
|
## eqIdent: first char is case sensitive!!!
|
|
result.add(params[i][0])
|
|
|
|
proc isInvalidReturnType(typeName: string): bool =
|
|
return typeName notin ["Future"] #, "FutureStream"]
|
|
|
|
proc verifyReturnType(typeName: string, node: NimNode = nil) {.compileTime.} =
|
|
if typeName.isInvalidReturnType:
|
|
error("Expected return type of 'Future' got '$1'" %
|
|
typeName, node)
|
|
|
|
template await*(f: typed): untyped {.used.} =
|
|
static:
|
|
error "await expects Future[T], got " & $typeof(f)
|
|
|
|
template await*[T](f: Future[T]): auto {.used.} =
|
|
var internalTmpFuture: FutureBase = f
|
|
yield internalTmpFuture
|
|
(cast[typeof(f)](internalTmpFuture)).read()
|
|
|
|
proc asyncSingleProc(prc: NimNode): NimNode {.compileTime.} =
|
|
## This macro transforms a single procedure into a closure iterator.
|
|
## The `async` macro supports a stmtList holding multiple async procedures.
|
|
if prc.kind == nnkProcTy:
|
|
result = prc
|
|
if prc[0][0].kind == nnkEmpty:
|
|
result[0][0] = parseExpr("Future[void]")
|
|
return result
|
|
|
|
if prc.kind notin {nnkProcDef, nnkLambda, nnkMethodDef, nnkDo}:
|
|
error("Cannot transform this node kind into an async proc." &
|
|
" proc/method definition or lambda node expected.", prc)
|
|
|
|
if prc[4].kind != nnkEmpty:
|
|
for prag in prc[4]:
|
|
if prag.eqIdent("discardable"):
|
|
error("Cannot make async proc discardable. Futures have to be " &
|
|
"checked with `asyncCheck` instead of discarded", prag)
|
|
|
|
let prcName = prc.name.getName
|
|
|
|
var returnType = prc.params[0]
|
|
var baseType: NimNode
|
|
if returnType.kind in nnkCallKinds and returnType[0].eqIdent("owned") and
|
|
returnType.len == 2:
|
|
returnType = returnType[1]
|
|
# Verify that the return type is a Future[T]
|
|
if returnType.kind == nnkBracketExpr:
|
|
let fut = repr(returnType[0])
|
|
verifyReturnType(fut, returnType[0])
|
|
baseType = returnType[1]
|
|
elif returnType.kind in nnkCallKinds and returnType[0].eqIdent("[]"):
|
|
let fut = repr(returnType[1])
|
|
verifyReturnType(fut, returnType[0])
|
|
baseType = returnType[2]
|
|
elif returnType.kind == nnkEmpty:
|
|
baseType = returnType
|
|
else:
|
|
verifyReturnType(repr(returnType), returnType)
|
|
|
|
let subtypeIsVoid = returnType.kind == nnkEmpty or
|
|
(baseType.kind == nnkIdent and returnType[1].eqIdent("void"))
|
|
|
|
let futureVarIdents = getFutureVarIdents(prc.params)
|
|
|
|
var outerProcBody = newNimNode(nnkStmtList, prc.body)
|
|
|
|
# Extract the documentation comment from the original procedure declaration.
|
|
# Note that we're not removing it from the body in order not to make this
|
|
# transformation even more complex.
|
|
let body2 = extractDocCommentsAndRunnables(prc.body)
|
|
|
|
# -> var retFuture = newFuture[T]()
|
|
var retFutureSym = genSym(nskVar, "retFuture")
|
|
var subRetType =
|
|
if returnType.kind == nnkEmpty: newIdentNode("void")
|
|
else: baseType
|
|
outerProcBody.add(
|
|
newVarStmt(retFutureSym,
|
|
newCall(
|
|
newNimNode(nnkBracketExpr, prc.body).add(
|
|
newIdentNode("newFuture"),
|
|
subRetType),
|
|
newLit(prcName)))) # Get type from return type of this proc
|
|
|
|
# -> iterator nameIter(): FutureBase {.closure.} =
|
|
# -> {.push warning[resultshadowed]: off.}
|
|
# -> var result: T
|
|
# -> {.pop.}
|
|
# -> <proc_body>
|
|
# -> complete(retFuture, result)
|
|
var iteratorNameSym = genSym(nskIterator, $prcName & "Iter")
|
|
var procBody = prc.body.processBody(retFutureSym, subtypeIsVoid,
|
|
futureVarIdents)
|
|
# don't do anything with forward bodies (empty)
|
|
if procBody.kind != nnkEmpty:
|
|
# fix #13899, defer should not escape its original scope
|
|
procBody = newStmtList(newTree(nnkBlockStmt, newEmptyNode(), procBody))
|
|
|
|
procBody.add(createFutureVarCompletions(futureVarIdents, nil))
|
|
|
|
if not subtypeIsVoid:
|
|
procBody.insert(0, newNimNode(nnkPragma).add(newIdentNode("push"),
|
|
newNimNode(nnkExprColonExpr).add(newNimNode(nnkBracketExpr).add(
|
|
newIdentNode("warning"), newIdentNode("resultshadowed")),
|
|
newIdentNode("off")))) # -> {.push warning[resultshadowed]: off.}
|
|
|
|
procBody.insert(1, newNimNode(nnkVarSection, prc.body).add(
|
|
newIdentDefs(newIdentNode("result"), baseType))) # -> var result: T
|
|
|
|
procBody.insert(2, newNimNode(nnkPragma).add(
|
|
newIdentNode("pop"))) # -> {.pop.})
|
|
|
|
procBody.add(
|
|
newCall(newIdentNode("complete"),
|
|
retFutureSym, newIdentNode("result"))) # -> complete(retFuture, result)
|
|
else:
|
|
# -> complete(retFuture)
|
|
procBody.add(newCall(newIdentNode("complete"), retFutureSym))
|
|
|
|
var closureIterator = newProc(iteratorNameSym, [parseExpr("owned(FutureBase)")],
|
|
procBody, nnkIteratorDef)
|
|
closureIterator.pragma = newNimNode(nnkPragma, lineInfoFrom = prc.body)
|
|
closureIterator.addPragma(newIdentNode("closure"))
|
|
|
|
# If proc has an explicit gcsafe pragma, we add it to iterator as well.
|
|
if prc.pragma.findChild(it.kind in {nnkSym, nnkIdent} and $it ==
|
|
"gcsafe") != nil:
|
|
closureIterator.addPragma(newIdentNode("gcsafe"))
|
|
outerProcBody.add(closureIterator)
|
|
|
|
# -> createCb(retFuture)
|
|
# NOTE: The NimAsyncContinueSuffix is checked for in asyncfutures.nim to produce
|
|
# friendlier stack traces:
|
|
var cbName = genSym(nskProc, prcName & NimAsyncContinueSuffix)
|
|
var procCb = getAst createCb(retFutureSym, iteratorNameSym,
|
|
newStrLitNode(prcName),
|
|
cbName,
|
|
createFutureVarCompletions(futureVarIdents, nil))
|
|
outerProcBody.add procCb
|
|
|
|
# -> return retFuture
|
|
outerProcBody.add newNimNode(nnkReturnStmt, prc.body[^1]).add(retFutureSym)
|
|
|
|
result = prc
|
|
|
|
if subtypeIsVoid:
|
|
# Add discardable pragma.
|
|
if returnType.kind == nnkEmpty:
|
|
# Add Future[void]
|
|
result.params[0] = parseExpr("owned(Future[void])")
|
|
|
|
# based on the yglukhov's patch to chronos: https://github.com/status-im/nim-chronos/pull/47
|
|
if procBody.kind != nnkEmpty:
|
|
body2.add quote do:
|
|
`outerProcBody`
|
|
result.body = body2
|
|
|
|
#echo(treeRepr(result))
|
|
#if prcName == "recvLineInto":
|
|
# echo(toStrLit(result))
|
|
|
|
macro async*(prc: untyped): untyped =
|
|
## Macro which processes async procedures into the appropriate
|
|
## iterators and yield statements.
|
|
if prc.kind == nnkStmtList:
|
|
result = newStmtList()
|
|
for oneProc in prc:
|
|
result.add asyncSingleProc(oneProc)
|
|
else:
|
|
result = asyncSingleProc(prc)
|
|
when defined(nimDumpAsync):
|
|
echo repr result
|
|
|
|
proc splitParamType(paramType: NimNode, async: bool): NimNode =
|
|
result = paramType
|
|
if paramType.kind == nnkInfix and paramType[0].strVal in ["|", "or"]:
|
|
let firstAsync = "async" in paramType[1].strVal.normalize
|
|
let secondAsync = "async" in paramType[2].strVal.normalize
|
|
|
|
if firstAsync:
|
|
result = paramType[if async: 1 else: 2]
|
|
elif secondAsync:
|
|
result = paramType[if async: 2 else: 1]
|
|
|
|
proc stripReturnType(returnType: NimNode): NimNode =
|
|
# Strip out the 'Future' from 'Future[T]'.
|
|
result = returnType
|
|
if returnType.kind == nnkBracketExpr:
|
|
let fut = repr(returnType[0])
|
|
verifyReturnType(fut, returnType)
|
|
result = returnType[1]
|
|
|
|
proc splitProc(prc: NimNode): (NimNode, NimNode) =
|
|
## Takes a procedure definition which takes a generic union of arguments,
|
|
## for example: proc (socket: Socket | AsyncSocket).
|
|
## It transforms them so that `proc (socket: Socket)` and
|
|
## `proc (socket: AsyncSocket)` are returned.
|
|
|
|
result[0] = prc.copyNimTree()
|
|
# Retrieve the `T` inside `Future[T]`.
|
|
let returnType = stripReturnType(result[0][3][0])
|
|
result[0][3][0] = splitParamType(returnType, async = false)
|
|
for i in 1 ..< result[0][3].len:
|
|
# Sync proc (0) -> FormalParams (3) -> IdentDefs, the parameter (i) ->
|
|
# parameter type (1).
|
|
result[0][3][i][1] = splitParamType(result[0][3][i][1], async=false)
|
|
var multisyncAwait = quote:
|
|
template await(value: typed): untyped =
|
|
value
|
|
|
|
result[0][^1] = nnkStmtList.newTree(multisyncAwait, result[0][^1])
|
|
|
|
result[1] = prc.copyNimTree()
|
|
if result[1][3][0].kind == nnkBracketExpr:
|
|
result[1][3][0][1] = splitParamType(result[1][3][0][1], async = true)
|
|
for i in 1 ..< result[1][3].len:
|
|
# Async proc (1) -> FormalParams (3) -> IdentDefs, the parameter (i) ->
|
|
# parameter type (1).
|
|
result[1][3][i][1] = splitParamType(result[1][3][i][1], async = true)
|
|
|
|
macro multisync*(prc: untyped): untyped =
|
|
## Macro which processes async procedures into both asynchronous and
|
|
## synchronous procedures.
|
|
##
|
|
## The generated async procedures use the `async` macro, whereas the
|
|
## generated synchronous procedures simply strip off the `await` calls.
|
|
let (sync, asyncPrc) = splitProc(prc)
|
|
result = newStmtList()
|
|
result.add(asyncSingleProc(asyncPrc))
|
|
result.add(sync)
|
|
# echo result.repr
|
|
|
|
# overload for await as a fallback handler, based on the yglukhov's patch to chronos: https://github.com/status-im/nim-chronos/pull/47
|
|
# template await*(f: typed): untyped =
|
|
# static:
|
|
# error "await only available within {.async.}"
|