lambdalifting.nim 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997
  1. #
  2. #
  3. # The Nim Compiler
  4. # (c) Copyright 2015 Andreas Rumpf
  5. #
  6. # See the file "copying.txt", included in this
  7. # distribution, for details about the copyright.
  8. #
  9. # This file implements lambda lifting for the transformator.
  10. import
  11. options, ast, astalgo, msgs,
  12. idents, renderer, types, magicsys, lowerings, modulegraphs, lineinfos,
  13. transf, liftdestructors, typeallowed
  14. import std/[strutils, tables, intsets]
  15. when defined(nimPreviewSlimSystem):
  16. import std/assertions
  17. discard """
  18. The basic approach is that captured vars need to be put on the heap and
  19. that the calling chain needs to be explicitly modelled. Things to consider:
  20. proc a =
  21. var v = 0
  22. proc b =
  23. var w = 2
  24. for x in 0..3:
  25. proc c = capture v, w, x
  26. c()
  27. b()
  28. for x in 0..4:
  29. proc d = capture x
  30. d()
  31. Needs to be translated into:
  32. proc a =
  33. var cl: *
  34. new cl
  35. cl.v = 0
  36. proc b(cl) =
  37. var bcl: *
  38. new bcl
  39. bcl.w = 2
  40. bcl.up = cl
  41. for x in 0..3:
  42. var bcl2: *
  43. new bcl2
  44. bcl2.up = bcl
  45. bcl2.up2 = cl
  46. bcl2.x = x
  47. proc c(cl) = capture cl.up2.v, cl.up.w, cl.x
  48. c(bcl2)
  49. c(bcl)
  50. b(cl)
  51. for x in 0..4:
  52. var acl2: *
  53. new acl2
  54. acl2.x = x
  55. proc d(cl) = capture cl.x
  56. d(acl2)
  57. Closures as interfaces:
  58. proc outer: T =
  59. var captureMe: TObject # value type required for efficiency
  60. proc getter(): int = result = captureMe.x
  61. proc setter(x: int) = captureMe.x = x
  62. result = (getter, setter)
  63. Is translated to:
  64. proc outer: T =
  65. var cl: *
  66. new cl
  67. proc getter(cl): int = result = cl.captureMe.x
  68. proc setter(cl: *, x: int) = cl.captureMe.x = x
  69. result = ((cl, getter), (cl, setter))
  70. For 'byref' capture, the outer proc needs to access the captured var through
  71. the indirection too. For 'bycopy' capture, the outer proc accesses the var
  72. not through the indirection.
  73. Possible optimizations:
  74. 1) If the closure contains a single 'ref' and this
  75. reference is not re-assigned (check ``sfAddrTaken`` flag) make this the
  76. closure. This is an important optimization if closures are used as
  77. interfaces.
  78. 2) If the closure does not escape, put it onto the stack, not on the heap.
  79. 3) Dataflow analysis would help to eliminate the 'up' indirections.
  80. 4) If the captured var is not actually used in the outer proc (common?),
  81. put it into an inner proc.
  82. """
  83. # Important things to keep in mind:
  84. # * Don't base the analysis on nkProcDef et al. This doesn't work for
  85. # instantiated (formerly generic) procs. The analysis has to look at nkSym.
  86. # This also means we need to prevent the same proc is processed multiple
  87. # times via the 'processed' set.
  88. # * Keep in mind that the owner of some temporaries used to be unreliable.
  89. # * For closure iterators we merge the "real" potential closure with the
  90. # local storage requirements for efficiency. This means closure iterators
  91. # have slightly different semantics from ordinary closures.
  92. # ---------------- essential helpers -------------------------------------
  93. const
  94. upName* = ":up" # field name for the 'up' reference
  95. paramName* = ":envP"
  96. envName* = ":env"
  97. proc newCall(a: PSym, b: PNode): PNode =
  98. result = newNodeI(nkCall, a.info)
  99. result.add newSymNode(a)
  100. result.add b
  101. proc createClosureIterStateType*(g: ModuleGraph; iter: PSym; idgen: IdGenerator): PType =
  102. var n = newNodeI(nkRange, iter.info)
  103. n.add newIntNode(nkIntLit, -1)
  104. n.add newIntNode(nkIntLit, 0)
  105. result = newType(tyRange, idgen, iter)
  106. result.n = n
  107. var intType = nilOrSysInt(g)
  108. if intType.isNil: intType = newType(tyInt, idgen, iter)
  109. rawAddSon(result, intType)
  110. proc createStateField(g: ModuleGraph; iter: PSym; idgen: IdGenerator): PSym =
  111. result = newSym(skField, getIdent(g.cache, ":state"), idgen, iter, iter.info)
  112. result.typ = createClosureIterStateType(g, iter, idgen)
  113. template isIterator*(owner: PSym): bool =
  114. owner.kind == skIterator and owner.typ.callConv == ccClosure
  115. proc createEnvObj(g: ModuleGraph; idgen: IdGenerator; owner: PSym; info: TLineInfo): PType =
  116. result = createObj(g, idgen, owner, info, final=false)
  117. if owner.isIterator:
  118. rawAddField(result, createStateField(g, owner, idgen))
  119. proc getClosureIterResult*(g: ModuleGraph; iter: PSym; idgen: IdGenerator): PSym =
  120. if resultPos < iter.ast.len:
  121. result = iter.ast[resultPos].sym
  122. else:
  123. # XXX a bit hacky:
  124. result = newSym(skResult, getIdent(g.cache, ":result"), idgen, iter, iter.info, {})
  125. result.typ = iter.typ.returnType
  126. incl(result.flags, sfUsed)
  127. iter.ast.add newSymNode(result)
  128. proc addHiddenParam(routine: PSym, param: PSym) =
  129. assert param.kind == skParam
  130. var params = routine.ast[paramsPos]
  131. # -1 is correct here as param.position is 0 based but we have at position 0
  132. # some nkEffect node:
  133. param.position = routine.typ.n.len-1
  134. params.add newSymNode(param)
  135. #incl(routine.typ.flags, tfCapturesEnv)
  136. assert sfFromGeneric in param.flags
  137. #echo "produced environment: ", param.id, " for ", routine.id
  138. proc getEnvParam*(routine: PSym): PSym =
  139. let params = routine.ast[paramsPos]
  140. let hidden = lastSon(params)
  141. if hidden.kind == nkSym and hidden.sym.kind == skParam and hidden.sym.name.s == paramName:
  142. result = hidden.sym
  143. assert sfFromGeneric in result.flags
  144. else:
  145. result = nil
  146. proc getHiddenParam(g: ModuleGraph; routine: PSym): PSym =
  147. result = getEnvParam(routine)
  148. if result.isNil:
  149. # writeStackTrace()
  150. localError(g.config, routine.info, "internal error: could not find env param for " & routine.name.s)
  151. result = routine
  152. proc interestingVar(s: PSym): bool {.inline.} =
  153. result = s.kind in {skVar, skLet, skTemp, skForVar, skParam, skResult} and
  154. sfGlobal notin s.flags and
  155. s.typ.kind notin {tyStatic, tyTypeDesc}
  156. proc illegalCapture(s: PSym): bool {.inline.} =
  157. result = classifyViewType(s.typ) != noView or s.kind == skResult
  158. proc isInnerProc(s: PSym): bool =
  159. if s.kind in {skProc, skFunc, skMethod, skConverter, skIterator} and s.magic == mNone:
  160. result = s.skipGenericOwner.kind in routineKinds
  161. else:
  162. result = false
  163. proc newAsgnStmt(le, ri: PNode, info: TLineInfo): PNode =
  164. # Bugfix: unfortunately we cannot use 'nkFastAsgn' here as that would
  165. # mean to be able to capture string literals which have no GC header.
  166. # However this can only happen if the capture happens through a parameter,
  167. # which is however the only case when we generate an assignment in the first
  168. # place.
  169. result = newNodeI(nkAsgn, info, 2)
  170. result[0] = le
  171. result[1] = ri
  172. proc makeClosure*(g: ModuleGraph; idgen: IdGenerator; prc: PSym; env: PNode; info: TLineInfo): PNode =
  173. result = newNodeIT(nkClosure, info, prc.typ)
  174. result.add(newSymNode(prc))
  175. if env == nil:
  176. result.add(newNodeIT(nkNilLit, info, getSysType(g, info, tyNil)))
  177. else:
  178. if env.skipConv.kind == nkClosure:
  179. localError(g.config, info, "internal error: taking closure of closure")
  180. result.add(env)
  181. #if isClosureIterator(result.typ):
  182. createTypeBoundOps(g, nil, result.typ, info, idgen)
  183. if tfHasAsgn in result.typ.flags or optSeqDestructors in g.config.globalOptions:
  184. prc.flags.incl sfInjectDestructors
  185. template liftingHarmful(conf: ConfigRef; owner: PSym): bool =
  186. ## lambda lifting can be harmful for JS-like code generators.
  187. let isCompileTime = sfCompileTime in owner.flags or owner.kind == skMacro
  188. jsNoLambdaLifting in conf.legacyFeatures and conf.backend == backendJs and not isCompileTime
  189. proc createTypeBoundOpsLL(g: ModuleGraph; refType: PType; info: TLineInfo; idgen: IdGenerator; owner: PSym) =
  190. if owner.kind != skMacro:
  191. createTypeBoundOps(g, nil, refType.elementType, info, idgen)
  192. createTypeBoundOps(g, nil, refType, info, idgen)
  193. if tfHasAsgn in refType.flags or optSeqDestructors in g.config.globalOptions:
  194. owner.flags.incl sfInjectDestructors
  195. proc genCreateEnv(env: PNode): PNode =
  196. var c = newNodeIT(nkObjConstr, env.info, env.typ)
  197. c.add newNodeIT(nkType, env.info, env.typ)
  198. let e = copyTree(env)
  199. e.flags.incl nfFirstWrite
  200. result = newAsgnStmt(e, c)
  201. proc liftIterSym*(g: ModuleGraph; n: PNode; idgen: IdGenerator; owner: PSym): PNode =
  202. # transforms (iter) to (let env = newClosure[iter](); (iter, env))
  203. if liftingHarmful(g.config, owner): return n
  204. let iter = n.sym
  205. assert iter.isIterator
  206. result = newNodeIT(nkStmtListExpr, n.info, iter.typ)
  207. let hp = getHiddenParam(g, iter)
  208. var env: PNode
  209. if owner.isIterator:
  210. let it = getHiddenParam(g, owner)
  211. addUniqueField(it.typ.skipTypes({tyOwned})[0], hp, g.cache, idgen)
  212. env = indirectAccess(newSymNode(it), hp, hp.info)
  213. else:
  214. let e = newSym(skLet, iter.name, idgen, owner, n.info)
  215. e.typ = hp.typ
  216. e.flags = hp.flags
  217. env = newSymNode(e)
  218. var v = newNodeI(nkVarSection, n.info)
  219. addVar(v, env)
  220. result.add(v)
  221. # add 'new' statement:
  222. #result.add newCall(getSysSym(g, n.info, "internalNew"), env)
  223. result.add genCreateEnv(env)
  224. createTypeBoundOpsLL(g, env.typ, n.info, idgen, owner)
  225. result.add makeClosure(g, idgen, iter, env, n.info)
  226. # ------------------ new stuff -------------------------------------------
  227. proc markAsClosure(g: ModuleGraph; owner: PSym; n: PNode) =
  228. let s = n.sym
  229. let isEnv = s.name.id == getIdent(g.cache, ":env").id
  230. if illegalCapture(s):
  231. localError(g.config, n.info,
  232. ("'$1' is of type <$2> which cannot be captured as it would violate memory" &
  233. " safety, declared here: $3; using '-d:nimNoLentIterators' helps in some cases." &
  234. " Consider using a <ref $2> which can be captured.") %
  235. [s.name.s, typeToString(s.typ), g.config$s.info])
  236. elif not (owner.typ.isClosure or owner.isNimcall and not owner.isExplicitCallConv or isEnv):
  237. localError(g.config, n.info, "illegal capture '$1' because '$2' has the calling convention: <$3>" %
  238. [s.name.s, owner.name.s, $owner.typ.callConv])
  239. incl(owner.typ.flags, tfCapturesEnv)
  240. if not isEnv:
  241. owner.typ.callConv = ccClosure
  242. type
  243. DetectionPass = object
  244. processed, capturedVars: IntSet
  245. ownerToType: Table[int, PType]
  246. somethingToDo: bool
  247. inTypeOf: bool
  248. graph: ModuleGraph
  249. idgen: IdGenerator
  250. proc initDetectionPass(g: ModuleGraph; fn: PSym; idgen: IdGenerator): DetectionPass =
  251. result = DetectionPass(processed: toIntSet([fn.id]),
  252. capturedVars: initIntSet(), ownerToType: initTable[int, PType](),
  253. graph: g, idgen: idgen
  254. )
  255. discard """
  256. proc outer =
  257. var a, b: int
  258. proc innerA = use(a)
  259. proc innerB = use(b); innerA()
  260. # --> innerA and innerB need to *share* the closure type!
  261. This is why need to store the 'ownerToType' table and use it
  262. during .closure'fication.
  263. """
  264. proc getEnvTypeForOwner(c: var DetectionPass; owner: PSym;
  265. info: TLineInfo): PType =
  266. result = c.ownerToType.getOrDefault(owner.id)
  267. if result.isNil:
  268. let env = getEnvParam(owner)
  269. if env.isNil or not owner.isIterator:
  270. result = newType(tyRef, c.idgen, owner)
  271. let obj = createEnvObj(c.graph, c.idgen, owner, info)
  272. rawAddSon(result, obj)
  273. else:
  274. result = env.typ
  275. c.ownerToType[owner.id] = result
  276. proc asOwnedRef(c: var DetectionPass; t: PType): PType =
  277. if optOwnedRefs in c.graph.config.globalOptions:
  278. assert t.kind == tyRef
  279. result = newType(tyOwned, c.idgen, t.owner)
  280. result.flags.incl tfHasOwned
  281. result.rawAddSon t
  282. else:
  283. result = t
  284. proc getEnvTypeForOwnerUp(c: var DetectionPass; owner: PSym;
  285. info: TLineInfo): PType =
  286. var r = c.getEnvTypeForOwner(owner, info)
  287. result = newType(tyPtr, c.idgen, owner)
  288. rawAddSon(result, r.skipTypes({tyOwned, tyRef, tyPtr}))
  289. proc createUpField(c: var DetectionPass; dest, dep: PSym; info: TLineInfo) =
  290. let refObj = c.getEnvTypeForOwner(dest, info) # getHiddenParam(dest).typ
  291. let obj = refObj.skipTypes({tyOwned, tyRef, tyPtr})
  292. # The assumption here is that gcDestructors means we cannot deal
  293. # with cycles properly, so it's better to produce a weak ref (=ptr) here.
  294. # This seems to be generally correct but since it's a bit risky it's disabled
  295. # for now.
  296. # XXX This is wrong for the 'hamming' test, so remove this logic again.
  297. let fieldType = if isDefined(c.graph.config, "nimCycleBreaker"):
  298. c.getEnvTypeForOwnerUp(dep, info) #getHiddenParam(dep).typ
  299. else:
  300. c.getEnvTypeForOwner(dep, info)
  301. if refObj == fieldType:
  302. localError(c.graph.config, dep.info, "internal error: invalid up reference computed")
  303. let upIdent = getIdent(c.graph.cache, upName)
  304. let upField = lookupInRecord(obj.n, upIdent)
  305. if upField != nil:
  306. if upField.typ.skipTypes({tyOwned, tyRef, tyPtr}) != fieldType.skipTypes({tyOwned, tyRef, tyPtr}):
  307. localError(c.graph.config, dep.info, "internal error: up references do not agree")
  308. when false:
  309. if c.graph.config.selectedGC == gcDestructors and sfCursor notin upField.flags:
  310. localError(c.graph.config, dep.info, "internal error: up reference is not a .cursor")
  311. else:
  312. let result = newSym(skField, upIdent, c.idgen, obj.owner, obj.owner.info)
  313. result.typ = fieldType
  314. when false:
  315. if c.graph.config.selectedGC == gcDestructors:
  316. result.flags.incl sfCursor
  317. rawAddField(obj, result)
  318. discard """
  319. There are a couple of possibilities of how to implement closure
  320. iterators that capture outer variables in a traditional sense
  321. (aka closure closure iterators).
  322. 1. Transform iter() to iter(state, capturedEnv). So use 2 hidden
  323. parameters.
  324. 2. Add the captured vars directly to 'state'.
  325. 3. Make capturedEnv an up-reference of 'state'.
  326. We do (3) here because (2) is obviously wrong and (1) is wrong too.
  327. Consider:
  328. proc outer =
  329. var xx = 9
  330. iterator foo() =
  331. var someState = 3
  332. proc bar = echo someState
  333. proc baz = someState = 0
  334. baz()
  335. bar()
  336. """
  337. proc isTypeOf(n: PNode): bool =
  338. n.kind == nkSym and n.sym.magic in {mTypeOf, mType}
  339. proc addClosureParam(c: var DetectionPass; fn: PSym; info: TLineInfo) =
  340. var cp = getEnvParam(fn)
  341. let owner = if fn.kind == skIterator: fn else: fn.skipGenericOwner
  342. let t = c.getEnvTypeForOwner(owner, info)
  343. if cp == nil:
  344. cp = newSym(skParam, getIdent(c.graph.cache, paramName), c.idgen, fn, fn.info)
  345. incl(cp.flags, sfFromGeneric)
  346. cp.typ = t
  347. addHiddenParam(fn, cp)
  348. elif cp.typ != t and fn.kind != skIterator:
  349. localError(c.graph.config, fn.info, "internal error: inconsistent environment type")
  350. #echo "adding closure to ", fn.name.s
  351. proc detectCapturedVars(n: PNode; owner: PSym; c: var DetectionPass) =
  352. case n.kind
  353. of nkSym:
  354. let s = n.sym
  355. if s.kind in {skProc, skFunc, skMethod, skConverter, skIterator} and
  356. s.typ != nil and s.typ.callConv == ccClosure:
  357. # this handles the case that the inner proc was declared as
  358. # .closure but does not actually capture anything:
  359. addClosureParam(c, s, n.info)
  360. c.somethingToDo = true
  361. let innerProc = isInnerProc(s)
  362. if innerProc:
  363. if s.isIterator: c.somethingToDo = true
  364. if not c.processed.containsOrIncl(s.id):
  365. let body = transformBody(c.graph, c.idgen, s, {useCache})
  366. detectCapturedVars(body, s, c)
  367. let ow = s.skipGenericOwner
  368. let innerClosure = innerProc and s.typ.callConv == ccClosure and not s.isIterator
  369. let interested = interestingVar(s)
  370. if ow == owner:
  371. if owner.isIterator:
  372. c.somethingToDo = true
  373. addClosureParam(c, owner, n.info)
  374. # direct or indirect dependency:
  375. elif innerClosure or interested:
  376. discard """
  377. proc outer() =
  378. var x: int
  379. proc inner() =
  380. proc innerInner() =
  381. echo x
  382. innerInner()
  383. inner()
  384. # inner() takes a closure too!
  385. """
  386. # mark 'owner' as taking a closure:
  387. c.somethingToDo = true
  388. markAsClosure(c.graph, owner, n)
  389. addClosureParam(c, owner, n.info)
  390. #echo "capturing ", n.info
  391. # variable 's' is actually captured:
  392. if interestingVar(s):
  393. if not c.capturedVars.contains(s.id):
  394. if not c.inTypeOf: c.capturedVars.incl(s.id)
  395. let obj = c.getEnvTypeForOwner(ow, n.info).skipTypes({tyOwned, tyRef, tyPtr})
  396. #getHiddenParam(owner).typ.skipTypes({tyOwned, tyRef, tyPtr})
  397. discard addField(obj, s, c.graph.cache, c.idgen)
  398. # create required upFields:
  399. var w = owner.skipGenericOwner
  400. if isInnerProc(w) or owner.isIterator:
  401. if owner.isIterator: w = owner
  402. let last = if ow.isIterator: ow.skipGenericOwner else: ow
  403. while w != nil and w.kind != skModule and last != w:
  404. discard """
  405. proc outer =
  406. var a, b: int
  407. proc outerB =
  408. proc innerA = use(a)
  409. proc innerB = use(b); innerA()
  410. # --> make outerB of calling convention .closure and
  411. # give it the same env type that outer's env var gets:
  412. """
  413. let up = w.skipGenericOwner
  414. #echo "up for ", w.name.s, " up ", up.name.s
  415. markAsClosure(c.graph, w, n)
  416. addClosureParam(c, w, n.info) # , ow
  417. createUpField(c, w, up, n.info)
  418. w = up
  419. of nkEmpty..pred(nkSym), succ(nkSym)..nkNilLit,
  420. nkTemplateDef, nkTypeSection, nkProcDef, nkMethodDef,
  421. nkConverterDef, nkMacroDef, nkFuncDef, nkCommentStmt,
  422. nkTypeOfExpr, nkMixinStmt, nkBindStmt:
  423. discard
  424. of nkLambdaKinds, nkIteratorDef:
  425. if n.typ != nil:
  426. detectCapturedVars(n[namePos], owner, c)
  427. of nkReturnStmt:
  428. detectCapturedVars(n[0], owner, c)
  429. of nkIdentDefs:
  430. detectCapturedVars(n[^1], owner, c)
  431. else:
  432. if n.isCallExpr and n[0].isTypeOf:
  433. c.inTypeOf = true
  434. for i in 0..<n.len:
  435. detectCapturedVars(n[i], owner, c)
  436. c.inTypeOf = false
  437. type
  438. LiftingPass = object
  439. processed: IntSet
  440. envVars: Table[int, PNode]
  441. inContainer: int
  442. unownedEnvVars: Table[int, PNode] # only required for --newruntime
  443. proc initLiftingPass(fn: PSym): LiftingPass =
  444. result = LiftingPass(processed: toIntSet([fn.id]),
  445. envVars: initTable[int, PNode]())
  446. proc accessViaEnvParam(g: ModuleGraph; n: PNode; owner: PSym): PNode =
  447. let s = n.sym
  448. # Type based expression construction for simplicity:
  449. let envParam = getHiddenParam(g, owner)
  450. if not envParam.isNil:
  451. var access = newSymNode(envParam)
  452. var obj = access.typ.elementType
  453. while true:
  454. assert obj.kind == tyObject
  455. let field = getFieldFromObj(obj, s)
  456. if field != nil:
  457. return rawIndirectAccess(access, field, n.info)
  458. let upField = lookupInRecord(obj.n, getIdent(g.cache, upName))
  459. if upField == nil: break
  460. access = rawIndirectAccess(access, upField, n.info)
  461. obj = access.typ.baseClass
  462. localError(g.config, n.info, "internal error: environment misses: " & s.name.s)
  463. result = n
  464. proc newEnvVar(cache: IdentCache; owner: PSym; typ: PType; info: TLineInfo; idgen: IdGenerator): PNode =
  465. var v = newSym(skVar, getIdent(cache, envName), idgen, owner, info)
  466. v.flags = {sfShadowed, sfGeneratedOp}
  467. v.typ = typ
  468. result = newSymNode(v)
  469. when false:
  470. if owner.kind == skIterator and owner.typ.callConv == ccClosure:
  471. let it = getHiddenParam(owner)
  472. addUniqueField(it.typ.elementType, v)
  473. result = indirectAccess(newSymNode(it), v, v.info)
  474. else:
  475. result = newSymNode(v)
  476. proc setupEnvVar(owner: PSym; d: var DetectionPass;
  477. c: var LiftingPass; info: TLineInfo): PNode =
  478. if owner.isIterator:
  479. return getHiddenParam(d.graph, owner).newSymNode
  480. result = c.envVars.getOrDefault(owner.id)
  481. if result.isNil:
  482. let envVarType = d.ownerToType.getOrDefault(owner.id)
  483. if envVarType.isNil:
  484. localError d.graph.config, owner.info, "internal error: could not determine closure type"
  485. result = newEnvVar(d.graph.cache, owner, asOwnedRef(d, envVarType), info, d.idgen)
  486. c.envVars[owner.id] = result
  487. if optOwnedRefs in d.graph.config.globalOptions:
  488. var v = newSym(skVar, getIdent(d.graph.cache, envName & "Alt"), d.idgen, owner, info)
  489. v.flags = {sfShadowed, sfGeneratedOp}
  490. v.typ = envVarType
  491. c.unownedEnvVars[owner.id] = newSymNode(v)
  492. proc getUpViaParam(g: ModuleGraph; owner: PSym): PNode =
  493. let p = getHiddenParam(g, owner)
  494. result = p.newSymNode
  495. if owner.isIterator:
  496. let upField = lookupInRecord(p.typ.skipTypes({tyOwned, tyRef, tyPtr}).n, getIdent(g.cache, upName))
  497. if upField == nil:
  498. localError(g.config, owner.info, "could not find up reference for closure iter")
  499. else:
  500. result = rawIndirectAccess(result, upField, p.info)
  501. proc rawClosureCreation(owner: PSym;
  502. d: var DetectionPass; c: var LiftingPass;
  503. info: TLineInfo): PNode =
  504. result = newNodeI(nkStmtList, owner.info)
  505. var env: PNode
  506. if owner.isIterator:
  507. env = getHiddenParam(d.graph, owner).newSymNode
  508. else:
  509. env = setupEnvVar(owner, d, c, info)
  510. if env.kind == nkSym:
  511. var v = newNodeI(nkVarSection, env.info)
  512. addVar(v, env)
  513. result.add(v)
  514. if optOwnedRefs in d.graph.config.globalOptions:
  515. let unowned = c.unownedEnvVars[owner.id]
  516. assert unowned != nil
  517. addVar(v, unowned)
  518. # add 'new' statement:
  519. result.add genCreateEnv(env)
  520. if optOwnedRefs in d.graph.config.globalOptions:
  521. let unowned = c.unownedEnvVars[owner.id]
  522. assert unowned != nil
  523. let env2 = copyTree(env)
  524. env2.typ = unowned.typ
  525. result.add newAsgnStmt(unowned, env2, env.info)
  526. createTypeBoundOpsLL(d.graph, unowned.typ, env.info, d.idgen, owner)
  527. # add assignment statements for captured parameters:
  528. for i in 1..<owner.typ.n.len:
  529. let local = owner.typ.n[i].sym
  530. if local.id in d.capturedVars:
  531. let fieldAccess = indirectAccess(env, local, env.info)
  532. # add ``env.param = param``
  533. result.add(newAsgnStmt(fieldAccess, newSymNode(local), env.info))
  534. if owner.kind != skMacro:
  535. createTypeBoundOps(d.graph, nil, fieldAccess.typ, env.info, d.idgen)
  536. if tfHasAsgn in fieldAccess.typ.flags or optSeqDestructors in d.graph.config.globalOptions:
  537. owner.flags.incl sfInjectDestructors
  538. let upField = lookupInRecord(env.typ.skipTypes({tyOwned, tyRef, tyPtr}).n, getIdent(d.graph.cache, upName))
  539. if upField != nil:
  540. let up = getUpViaParam(d.graph, owner)
  541. if up != nil and upField.typ.skipTypes({tyOwned, tyRef, tyPtr}) == up.typ.skipTypes({tyOwned, tyRef, tyPtr}):
  542. result.add(newAsgnStmt(rawIndirectAccess(env, upField, env.info),
  543. up, env.info))
  544. #elif oldenv != nil and oldenv.typ == upField.typ:
  545. # result.add(newAsgnStmt(rawIndirectAccess(env, upField, env.info),
  546. # oldenv, env.info))
  547. else:
  548. localError(d.graph.config, env.info, "internal error: cannot create up reference")
  549. # we are not in the sem'check phase anymore! so pass 'nil' for the PContext
  550. # and hope for the best:
  551. createTypeBoundOpsLL(d.graph, env.typ, owner.info, d.idgen, owner)
  552. proc finishClosureCreation(owner: PSym; d: var DetectionPass; c: LiftingPass;
  553. info: TLineInfo; res: PNode) =
  554. if optOwnedRefs in d.graph.config.globalOptions:
  555. let unowned = c.unownedEnvVars[owner.id]
  556. assert unowned != nil
  557. let nilLit = newNodeIT(nkNilLit, info, unowned.typ)
  558. res.add newAsgnStmt(unowned, nilLit, info)
  559. createTypeBoundOpsLL(d.graph, unowned.typ, info, d.idgen, owner)
  560. proc closureCreationForIter(iter: PNode;
  561. d: var DetectionPass; c: var LiftingPass): PNode =
  562. result = newNodeIT(nkStmtListExpr, iter.info, iter.sym.typ)
  563. let owner = iter.sym.skipGenericOwner
  564. var v = newSym(skVar, getIdent(d.graph.cache, envName), d.idgen, owner, iter.info)
  565. incl(v.flags, sfShadowed)
  566. v.typ = asOwnedRef(d, getHiddenParam(d.graph, iter.sym).typ)
  567. var vnode: PNode
  568. if owner.isIterator:
  569. let it = getHiddenParam(d.graph, owner)
  570. addUniqueField(it.typ.skipTypes({tyOwned, tyRef, tyPtr}), v, d.graph.cache, d.idgen)
  571. vnode = indirectAccess(newSymNode(it), v, v.info)
  572. else:
  573. vnode = v.newSymNode
  574. var vs = newNodeI(nkVarSection, iter.info)
  575. addVar(vs, vnode)
  576. result.add(vs)
  577. result.add genCreateEnv(vnode)
  578. createTypeBoundOpsLL(d.graph, vnode.typ, iter.info, d.idgen, owner)
  579. let upField = lookupInRecord(v.typ.skipTypes({tyOwned, tyRef, tyPtr}).n, getIdent(d.graph.cache, upName))
  580. if upField != nil:
  581. let u = setupEnvVar(owner, d, c, iter.info)
  582. if u.typ.skipTypes({tyOwned, tyRef, tyPtr}) == upField.typ.skipTypes({tyOwned, tyRef, tyPtr}):
  583. result.add(newAsgnStmt(rawIndirectAccess(vnode, upField, iter.info),
  584. u, iter.info))
  585. else:
  586. localError(d.graph.config, iter.info, "internal error: cannot create up reference for iter")
  587. result.add makeClosure(d.graph, d.idgen, iter.sym, vnode, iter.info)
  588. proc accessViaEnvVar(n: PNode; owner: PSym; d: var DetectionPass;
  589. c: var LiftingPass): PNode =
  590. var access = setupEnvVar(owner, d, c, n.info)
  591. if optOwnedRefs in d.graph.config.globalOptions:
  592. access = c.unownedEnvVars[owner.id]
  593. let obj = access.typ.skipTypes({tyOwned, tyRef, tyPtr})
  594. let field = getFieldFromObj(obj, n.sym)
  595. if field != nil:
  596. result = rawIndirectAccess(access, field, n.info)
  597. else:
  598. localError(d.graph.config, n.info, "internal error: not part of closure object type")
  599. result = n
  600. proc getStateField*(g: ModuleGraph; owner: PSym): PSym =
  601. getHiddenParam(g, owner).typ.skipTypes({tyOwned, tyRef, tyPtr}).n[0].sym
  602. proc liftCapturedVars(n: PNode; owner: PSym; d: var DetectionPass;
  603. c: var LiftingPass): PNode
  604. proc symToClosure(n: PNode; owner: PSym; d: var DetectionPass;
  605. c: var LiftingPass): PNode =
  606. let s = n.sym
  607. if s == owner:
  608. # recursive calls go through (lambda, hiddenParam):
  609. let available = getHiddenParam(d.graph, owner)
  610. result = makeClosure(d.graph, d.idgen, s, available.newSymNode, n.info)
  611. elif s.isIterator:
  612. result = closureCreationForIter(n, d, c)
  613. elif s.skipGenericOwner == owner:
  614. # direct dependency, so use the outer's env variable:
  615. result = makeClosure(d.graph, d.idgen, s, setupEnvVar(owner, d, c, n.info), n.info)
  616. else:
  617. result = nil
  618. let available = getHiddenParam(d.graph, owner)
  619. let wanted = getHiddenParam(d.graph, s).typ
  620. # ugh: call through some other inner proc;
  621. var access = newSymNode(available)
  622. while true:
  623. if access.typ == wanted:
  624. return makeClosure(d.graph, d.idgen, s, access, n.info)
  625. let obj = access.typ.skipTypes({tyOwned, tyRef, tyPtr})
  626. let upField = lookupInRecord(obj.n, getIdent(d.graph.cache, upName))
  627. if upField == nil:
  628. localError(d.graph.config, n.info, "internal error: no environment found")
  629. return n
  630. access = rawIndirectAccess(access, upField, n.info)
  631. proc liftCapturedVars(n: PNode; owner: PSym; d: var DetectionPass;
  632. c: var LiftingPass): PNode =
  633. result = n
  634. case n.kind
  635. of nkSym:
  636. let s = n.sym
  637. if isInnerProc(s):
  638. if not c.processed.containsOrIncl(s.id):
  639. #if s.name.s == "temp":
  640. # echo renderTree(s.getBody, {renderIds})
  641. let oldInContainer = c.inContainer
  642. c.inContainer = 0
  643. var body = transformBody(d.graph, d.idgen, s, {})
  644. body = liftCapturedVars(body, s, d, c)
  645. if c.envVars.getOrDefault(s.id).isNil:
  646. s.transformedBody = body
  647. else:
  648. s.transformedBody = newTree(nkStmtList, rawClosureCreation(s, d, c, n.info), body)
  649. finishClosureCreation(s, d, c, n.info, s.transformedBody)
  650. c.inContainer = oldInContainer
  651. if s.typ.callConv == ccClosure:
  652. result = symToClosure(n, owner, d, c)
  653. elif s.id in d.capturedVars:
  654. if s.owner != owner:
  655. result = accessViaEnvParam(d.graph, n, owner)
  656. else:
  657. result = accessViaEnvVar(n, owner, d, c)
  658. of nkEmpty..pred(nkSym), succ(nkSym)..nkNilLit, nkComesFrom,
  659. nkTemplateDef, nkTypeSection, nkProcDef, nkMethodDef, nkConverterDef,
  660. nkMacroDef, nkFuncDef, nkMixinStmt, nkBindStmt:
  661. discard
  662. of nkClosure:
  663. if n[1].kind == nkNilLit:
  664. n[0] = liftCapturedVars(n[0], owner, d, c)
  665. let x = n[0].skipConv
  666. if x.kind == nkClosure:
  667. #localError(n.info, "internal error: closure to closure created")
  668. # now we know better, so patch it:
  669. n[0] = x[0]
  670. n[1] = x[1]
  671. of nkLambdaKinds, nkIteratorDef:
  672. if n.typ != nil and n[namePos].kind == nkSym:
  673. let oldInContainer = c.inContainer
  674. c.inContainer = 0
  675. let m = newSymNode(n[namePos].sym)
  676. m.typ = n.typ
  677. result = liftCapturedVars(m, owner, d, c)
  678. c.inContainer = oldInContainer
  679. of nkHiddenStdConv:
  680. if n.len == 2:
  681. n[1] = liftCapturedVars(n[1], owner, d, c)
  682. if n[1].kind == nkClosure: result = n[1]
  683. of nkReturnStmt:
  684. if n[0].kind in {nkAsgn, nkFastAsgn, nkSinkAsgn}:
  685. # we have a `result = result` expression produced by the closure
  686. # transform, let's not touch the LHS in order to make the lifting pass
  687. # correct when `result` is lifted
  688. n[0][1] = liftCapturedVars(n[0][1], owner, d, c)
  689. else:
  690. n[0] = liftCapturedVars(n[0], owner, d, c)
  691. of nkTypeOfExpr:
  692. result = n
  693. else:
  694. if n.isCallExpr and n[0].isTypeOf:
  695. return
  696. if owner.isIterator:
  697. if nfLL in n.flags:
  698. # special case 'when nimVm' due to bug #3636:
  699. n[1] = liftCapturedVars(n[1], owner, d, c)
  700. return
  701. let inContainer = n.kind in {nkObjConstr, nkBracket}
  702. if inContainer: inc c.inContainer
  703. for i in 0..<n.len:
  704. n[i] = liftCapturedVars(n[i], owner, d, c)
  705. if inContainer: dec c.inContainer
  706. # ------------------ old stuff -------------------------------------------
  707. proc semCaptureSym*(s, owner: PSym) =
  708. discard """
  709. proc outer() =
  710. var x: int
  711. proc inner() =
  712. proc innerInner() =
  713. echo x
  714. innerInner()
  715. inner()
  716. # inner() takes a closure too!
  717. """
  718. proc propagateClosure(start, last: PSym) =
  719. var o = start
  720. while o != nil and o.kind != skModule:
  721. if o == last: break
  722. o.typ.callConv = ccClosure
  723. o = o.skipGenericOwner
  724. if interestingVar(s) and s.kind != skResult:
  725. if owner.typ != nil and not isGenericRoutine(owner):
  726. # XXX: is this really safe?
  727. # if we capture a var from another generic routine,
  728. # it won't be consider captured.
  729. var o = owner.skipGenericOwner
  730. while o != nil and o.kind != skModule:
  731. if s.owner == o:
  732. if owner.typ.callConv == ccClosure or owner.kind == skIterator or
  733. owner.typ.callConv == ccNimCall and tfExplicitCallConv notin owner.typ.flags:
  734. owner.typ.callConv = ccClosure
  735. propagateClosure(owner.skipGenericOwner, s.owner)
  736. else:
  737. discard "do not produce an error here, but later"
  738. #echo "computing .closure for ", owner.name.s, " because of ", s.name.s
  739. o = o.skipGenericOwner
  740. # since the analysis is not entirely correct, we don't set 'tfCapturesEnv'
  741. # here
  742. proc liftIterToProc*(g: ModuleGraph; fn: PSym; body: PNode; ptrType: PType;
  743. idgen: IdGenerator): PNode =
  744. var d = initDetectionPass(g, fn, idgen)
  745. var c = initLiftingPass(fn)
  746. # pretend 'fn' is a closure iterator for the analysis:
  747. let oldKind = fn.kind
  748. let oldCC = fn.typ.callConv
  749. fn.transitionRoutineSymKind(skIterator)
  750. fn.typ.callConv = ccClosure
  751. d.ownerToType[fn.id] = ptrType
  752. detectCapturedVars(body, fn, d)
  753. result = liftCapturedVars(body, fn, d, c)
  754. fn.transitionRoutineSymKind(oldKind)
  755. fn.typ.callConv = oldCC
  756. proc liftLambdas*(g: ModuleGraph; fn: PSym, body: PNode; tooEarly: var bool;
  757. idgen: IdGenerator; flags: TransformFlags): PNode =
  758. let isCompileTime = sfCompileTime in fn.flags or fn.kind == skMacro
  759. if body.kind == nkEmpty or (jsNoLambdaLifting in g.config.legacyFeatures and
  760. g.config.backend == backendJs and not isCompileTime) or
  761. (fn.skipGenericOwner.kind != skModule and force notin flags):
  762. # ignore forward declaration:
  763. result = body
  764. tooEarly = true
  765. if fn.isIterator:
  766. var d = initDetectionPass(g, fn, idgen)
  767. addClosureParam(d, fn, body.info)
  768. else:
  769. var d = initDetectionPass(g, fn, idgen)
  770. detectCapturedVars(body, fn, d)
  771. if not d.somethingToDo and fn.isIterator:
  772. addClosureParam(d, fn, body.info)
  773. d.somethingToDo = true
  774. if d.somethingToDo:
  775. var c = initLiftingPass(fn)
  776. result = liftCapturedVars(body, fn, d, c)
  777. # echo renderTree(result, {renderIds})
  778. if c.envVars.getOrDefault(fn.id) != nil:
  779. result = newTree(nkStmtList, rawClosureCreation(fn, d, c, body.info), result)
  780. finishClosureCreation(fn, d, c, body.info, result)
  781. else:
  782. result = body
  783. #if fn.name.s == "get2":
  784. # echo "had something to do ", d.somethingToDo
  785. # echo renderTree(result, {renderIds})
  786. proc liftLambdasForTopLevel*(module: PSym, body: PNode): PNode =
  787. # XXX implement it properly
  788. result = body
  789. # ------------------- iterator transformation --------------------------------
  790. proc liftForLoop*(g: ModuleGraph; body: PNode; idgen: IdGenerator; owner: PSym): PNode =
  791. # problem ahead: the iterator could be invoked indirectly, but then
  792. # we don't know what environment to create here:
  793. #
  794. # iterator count(): int =
  795. # yield 0
  796. #
  797. # iterator count2(): int =
  798. # var x = 3
  799. # yield x
  800. # inc x
  801. # yield x
  802. #
  803. # proc invoke(iter: iterator(): int) =
  804. # for x in iter(): echo x
  805. #
  806. # --> When to create the closure? --> for the (count) occurrence!
  807. discard """
  808. for i in foo(): ...
  809. Is transformed to:
  810. cl = createClosure()
  811. while true:
  812. let i = foo(cl)
  813. if (nkBreakState(cl.state)):
  814. break
  815. ...
  816. """
  817. if liftingHarmful(g.config, owner): return body
  818. if not (body.kind == nkForStmt and body[^2].kind in nkCallKinds):
  819. localError(g.config, body.info, "ignored invalid for loop")
  820. return body
  821. var call = body[^2]
  822. result = newNodeI(nkStmtList, body.info)
  823. # static binding?
  824. var env: PSym = nil
  825. let op = call[0]
  826. if op.kind == nkSym and op.sym.isIterator:
  827. # createClosure()
  828. let iter = op.sym
  829. let hp = getHiddenParam(g, iter)
  830. env = newSym(skLet, iter.name, idgen, owner, body.info)
  831. env.typ = hp.typ
  832. env.flags = hp.flags
  833. var v = newNodeI(nkVarSection, body.info)
  834. addVar(v, newSymNode(env))
  835. result.add(v)
  836. # add 'new' statement:
  837. result.add genCreateEnv(env.newSymNode)
  838. createTypeBoundOpsLL(g, env.typ, body.info, idgen, owner)
  839. elif op.kind == nkStmtListExpr:
  840. let closure = op.lastSon
  841. if closure.kind == nkClosure:
  842. call[0] = closure
  843. for i in 0..<op.len-1:
  844. result.add op[i]
  845. var loopBody = newNodeI(nkStmtList, body.info, 3)
  846. var whileLoop = newNodeI(nkWhileStmt, body.info, 2)
  847. whileLoop[0] = newIntTypeNode(1, getSysType(g, body.info, tyBool))
  848. whileLoop[1] = loopBody
  849. result.add whileLoop
  850. # setup loopBody:
  851. # gather vars in a tuple:
  852. var v2 = newNodeI(nkLetSection, body.info)
  853. var vpart = newNodeI(if body.len == 3: nkIdentDefs else: nkVarTuple, body.info)
  854. if body.len == 3 and body[0].kind == nkVarTuple:
  855. vpart = body[0] # fixes for (i,j) in walk() # bug #15924
  856. else:
  857. for i in 0..<body.len-2:
  858. if body[i].kind == nkSym:
  859. body[i].sym.transitionToLet()
  860. vpart.add body[i]
  861. vpart.add newNodeI(nkEmpty, body.info) # no explicit type
  862. if not env.isNil:
  863. call[0] = makeClosure(g, idgen, call[0].sym, env.newSymNode, body.info)
  864. vpart.add call
  865. v2.add vpart
  866. loopBody[0] = v2
  867. var bs = newNodeI(nkBreakState, body.info)
  868. bs.add call[0]
  869. let ibs = newNodeI(nkIfStmt, body.info)
  870. let elifBranch = newNodeI(nkElifBranch, body.info)
  871. elifBranch.add(bs)
  872. let br = newNodeI(nkBreakStmt, body.info)
  873. br.add(g.emptyNode)
  874. elifBranch.add(br)
  875. ibs.add(elifBranch)
  876. loopBody[1] = ibs
  877. loopBody[2] = body[^1]