lambdalifting.nim 37 KB

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