-
-
Notifications
You must be signed in to change notification settings - Fork 1.5k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
'isolate' builtin; refs nim-lang/RFCs#244 (#15011)
- Loading branch information
Showing
9 changed files
with
194 additions
and
6 deletions.
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 |
---|---|---|
@@ -0,0 +1,117 @@ | ||
# | ||
# | ||
# The Nim Compiler | ||
# (c) Copyright 2020 Andreas Rumpf | ||
# | ||
# See the file "copying.txt", included in this | ||
# distribution, for details about the copyright. | ||
# | ||
|
||
## Implementation of the check that `recover` needs, see | ||
## https://github.com/nim-lang/RFCs/issues/244 for more details. | ||
|
||
import | ||
ast, types, renderer, idents, intsets, options, msgs | ||
|
||
proc canAlias(arg, ret: PType; marker: var IntSet): bool | ||
|
||
proc canAliasN(arg: PType; n: PNode; marker: var IntSet): bool = | ||
case n.kind | ||
of nkRecList: | ||
for i in 0..<n.len: | ||
result = canAliasN(arg, n[i], marker) | ||
if result: return | ||
of nkRecCase: | ||
assert(n[0].kind == nkSym) | ||
result = canAliasN(arg, n[0], marker) | ||
if result: return | ||
for i in 1..<n.len: | ||
case n[i].kind | ||
of nkOfBranch, nkElse: | ||
result = canAliasN(arg, lastSon(n[i]), marker) | ||
if result: return | ||
else: discard | ||
of nkSym: | ||
result = canAlias(arg, n.sym.typ, marker) | ||
else: discard | ||
|
||
proc canAlias(arg, ret: PType; marker: var IntSet): bool = | ||
if containsOrIncl(marker, ret.id): | ||
return false | ||
|
||
if ret.kind in {tyPtr, tyPointer}: | ||
# unsafe so we don't care: | ||
return false | ||
if compareTypes(arg, ret, dcEqIgnoreDistinct): | ||
return true | ||
case ret.kind | ||
of tyObject: | ||
if isFinal(ret): | ||
result = canAliasN(arg, ret.n, marker) | ||
if not result and ret.len > 0 and ret[0] != nil: | ||
result = canAlias(arg, ret[0], marker) | ||
else: | ||
result = true | ||
of tyTuple: | ||
for i in 0..<ret.len: | ||
result = canAlias(arg, ret[i], marker) | ||
if result: break | ||
of tyArray, tySequence, tyDistinct, tyGenericInst, | ||
tyAlias, tyInferred, tySink, tyLent, tyOwned, tyRef: | ||
result = canAlias(arg, ret.lastSon, marker) | ||
of tyProc: | ||
result = ret.callConv == ccClosure | ||
else: | ||
result = false | ||
|
||
proc canAlias(arg, ret: PType): bool = | ||
var marker = initIntSet() | ||
result = canAlias(arg, ret, marker) | ||
|
||
proc checkIsolate*(n: PNode): bool = | ||
if types.containsTyRef(n.typ): | ||
# XXX Maybe require that 'n.typ' is acyclic. This is not much | ||
# worse than the already exisiting inheritance and closure restrictions. | ||
case n.kind | ||
of nkCharLit..nkNilLit: | ||
result = true | ||
of nkCallKinds: | ||
if n[0].typ.flags * {tfGcSafe, tfNoSideEffect} == {}: | ||
return false | ||
for i in 1..<n.len: | ||
if checkIsolate(n[i]): | ||
discard "fine, it is isolated already" | ||
else: | ||
let argType = n[i].typ | ||
if argType != nil and not isCompileTimeOnly(argType) and containsTyRef(argType): | ||
if argType.canAlias(n.typ): | ||
return false | ||
result = true | ||
of nkIfStmt, nkIfExpr: | ||
for it in n: | ||
result = checkIsolate(it.lastSon) | ||
if not result: break | ||
of nkCaseStmt, nkObjConstr: | ||
for i in 1..<n.len: | ||
result = checkIsolate(n[i].lastSon) | ||
if not result: break | ||
of nkBracket, nkTupleConstr, nkPar: | ||
for it in n: | ||
result = checkIsolate(it) | ||
if not result: break | ||
of nkHiddenStdConv, nkHiddenSubConv, nkCast, nkConv: | ||
result = checkIsolate(n[1]) | ||
of nkObjUpConv, nkObjDownConv, nkDotExpr: | ||
result = checkIsolate(n[0]) | ||
of nkStmtList, nkStmtListExpr: | ||
if n.len > 0: | ||
result = checkIsolate(n[^1]) | ||
else: | ||
result = false | ||
else: | ||
# unanalysable expression: | ||
result = false | ||
else: | ||
# no ref, no cry: | ||
result = true | ||
|
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
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 |
---|---|---|
@@ -0,0 +1,31 @@ | ||
# | ||
# | ||
# Nim's Runtime Library | ||
# (c) Copyright 2020 Nim contributors | ||
# | ||
# See the file "copying.txt", included in this | ||
# distribution, for details about the copyright. | ||
# | ||
|
||
## This module implements the `Isolated[T]` type for | ||
## safe construction of isolated subgraphs that can be | ||
## passed efficiently to different channels and threads. | ||
|
||
type | ||
Isolated*[T] = object ## Isolated data can only be moved, not copied. | ||
value: T | ||
|
||
proc `=`*[T](dest: var Isolated[T]; src: Isolated[T]) {.error.} | ||
|
||
proc `=sink`*[T](dest: var Isolated[T]; src: Isolated[T]) {.inline.} = | ||
# delegate to value's sink operation | ||
`=sink`(dest.value, src.value) | ||
|
||
proc `=destroy`*[T](dest: var Isolated[T]) {.inline.} = | ||
# delegate to value's destroy operation | ||
`=destroy`(dest.value) | ||
|
||
func isolate*[T](value: sink T): Isolated[T] {.magic: "Isolate".} | ||
## Create an isolated subgraph from the expression `value`. | ||
## Please read https://github.com/nim-lang/RFCs/issues/244 | ||
## for more details. |
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 |
---|---|---|
@@ -0,0 +1,36 @@ | ||
discard """ | ||
errormsg: "expression cannot be isolated: select(a, b)" | ||
line: 34 | ||
""" | ||
|
||
import std / isolation | ||
|
||
import json, streams | ||
|
||
proc f(): seq[int] = | ||
@[1, 2, 3] | ||
|
||
type | ||
Node = ref object | ||
x: string | ||
|
||
proc g(): Node = nil | ||
|
||
proc select(a, b: Node): Node = | ||
a | ||
|
||
proc main = | ||
discard isolate f() | ||
|
||
|
||
discard isolate g() | ||
|
||
discard isolate select(Node(x: "a"), nil) | ||
discard isolate select(Node(x: "a"), Node(x: "b")) | ||
|
||
discard isolate parseJson(newFileStream("my.json"), "my.json") | ||
|
||
var a, b: Node | ||
discard isolate select(a, b) | ||
|
||
main() |