lambdalifting.nim 36 KB

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