123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669 |
- #
- #
- # The Nim Compiler
- # (c) Copyright 2015 Andreas Rumpf
- #
- # See the file "copying.txt", included in this
- # distribution, for details about the copyright.
- #
- ## This module implements lifting for type-bound operations
- ## (``=sink``, ``=``, ``=destroy``, ``=deepCopy``).
- # Todo:
- # - use openArray instead of array to avoid over-specializations
- import modulegraphs, lineinfos, idents, ast, renderer, semdata,
- sighashes, lowerings, options, types, msgs, magicsys, tables
- type
- TLiftCtx = object
- g: ModuleGraph
- info: TLineInfo # for construction
- kind: TTypeAttachedOp
- fn: PSym
- asgnForType: PType
- recurse: bool
- c: PContext # c can be nil, then we are called from lambdalifting!
- proc fillBody(c: var TLiftCtx; t: PType; body, x, y: PNode)
- proc produceSym(g: ModuleGraph; c: PContext; typ: PType; kind: TTypeAttachedOp;
- info: TLineInfo): PSym
- proc createTypeBoundOps*(g: ModuleGraph; c: PContext; orig: PType; info: TLineInfo)
- proc at(a, i: PNode, elemType: PType): PNode =
- result = newNodeI(nkBracketExpr, a.info, 2)
- result.sons[0] = a
- result.sons[1] = i
- result.typ = elemType
- proc fillBodyTup(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- for i in 0 ..< t.len:
- let lit = lowerings.newIntLit(c.g, x.info, i)
- fillBody(c, t.sons[i], body, x.at(lit, t.sons[i]), y.at(lit, t.sons[i]))
- proc dotField(x: PNode, f: PSym): PNode =
- result = newNodeI(nkDotExpr, x.info, 2)
- result.sons[0] = x
- result.sons[1] = newSymNode(f, x.info)
- result.typ = f.typ
- proc fillBodyObj(c: var TLiftCtx; n, body, x, y: PNode) =
- case n.kind
- of nkSym:
- let f = n.sym
- fillBody(c, f.typ, body, x.dotField(f), y.dotField(f))
- of nkNilLit: discard
- of nkRecCase:
- if c.kind in {attachedSink, attachedAsgn, attachedDeepCopy}:
- ## the value needs to be destroyed before we assign the selector
- ## or the value is lost
- let prevKind = c.kind
- c.kind = attachedDestructor
- fillBodyObj(c, n, body, x, y)
- c.kind = prevKind
- # copy the selector:
- fillBodyObj(c, n[0], body, x, y)
- # we need to generate a case statement:
- var caseStmt = newNodeI(nkCaseStmt, c.info)
- # XXX generate 'if' that checks same branches
- # generate selector:
- var access = dotField(x, n[0].sym)
- caseStmt.add(access)
- var emptyBranches = 0
- # copy the branches over, but replace the fields with the for loop body:
- for i in 1 ..< n.len:
- var branch = copyTree(n[i])
- let L = branch.len
- branch.sons[L-1] = newNodeI(nkStmtList, c.info)
- fillBodyObj(c, n[i].lastSon, branch.sons[L-1], x, y)
- if branch.sons[L-1].len == 0: inc emptyBranches
- caseStmt.add(branch)
- if emptyBranches != n.len-1:
- body.add(caseStmt)
- of nkRecList:
- for t in items(n): fillBodyObj(c, t, body, x, y)
- else:
- illFormedAstLocal(n, c.g.config)
- proc fillBodyObjT(c: var TLiftCtx; t: PType, body, x, y: PNode) =
- if t.len > 0 and t.sons[0] != nil:
- fillBodyObjT(c, skipTypes(t.sons[0], abstractPtrs), body, x, y)
- fillBodyObj(c, t.n, body, x, y)
- proc genAddr(g: ModuleGraph; x: PNode): PNode =
- if x.kind == nkHiddenDeref:
- checkSonsLen(x, 1, g.config)
- result = x.sons[0]
- else:
- result = newNodeIT(nkHiddenAddr, x.info, makeVarType(x.typ.owner, x.typ))
- addSon(result, x)
- proc newAsgnCall(g: ModuleGraph; op: PSym; x, y: PNode): PNode =
- #if sfError in op.flags:
- # localError(c.config, x.info, "usage of '$1' is a user-defined error" % op.name.s)
- result = newNodeI(nkCall, x.info)
- result.add newSymNode(op)
- result.add genAddr(g, x)
- result.add y
- proc newAsgnStmt(le, ri: PNode): PNode =
- result = newNodeI(nkAsgn, le.info, 2)
- result.sons[0] = le
- result.sons[1] = ri
- proc newOpCall(op: PSym; x: PNode): PNode =
- result = newNodeIT(nkCall, x.info, op.typ.sons[0])
- result.add(newSymNode(op))
- result.add x
- proc destructorCall(g: ModuleGraph; op: PSym; x: PNode): PNode =
- result = newNodeIT(nkCall, x.info, op.typ.sons[0])
- result.add(newSymNode(op))
- result.add genAddr(g, x)
- proc newDeepCopyCall(op: PSym; x, y: PNode): PNode =
- result = newAsgnStmt(x, newOpCall(op, y))
- proc useNoGc(c: TLiftCtx; t: PType): bool {.inline.} =
- result = c.g.config.selectedGC == gcDestructors and
- ({tfHasGCedMem, tfHasOwned} * t.flags != {} or t.isGCedMem)
- proc instantiateGeneric(c: var TLiftCtx; op: PSym; t, typeInst: PType): PSym =
- if c.c != nil and typeInst != nil:
- result = c.c.instTypeBoundOp(c.c, op, typeInst, c.info, attachedAsgn, 1)
- else:
- localError(c.g.config, c.info,
- "cannot generate destructor for generic type: " & typeToString(t))
- result = nil
- proc considerAsgnOrSink(c: var TLiftCtx; t: PType; body, x, y: PNode;
- field: var PSym): bool =
- if c.g.config.selectedGC == gcDestructors:
- let op = field
- if field != nil and sfOverriden in field.flags:
- if sfError in op.flags:
- incl c.fn.flags, sfError
- #else:
- # markUsed(c.g.config, c.info, op, c.g.usageSym)
- onUse(c.info, op)
- body.add newAsgnCall(c.g, op, x, y)
- result = true
- elif tfHasAsgn in t.flags:
- var op: PSym
- if sameType(t, c.asgnForType):
- # generate recursive call:
- if c.recurse:
- op = c.fn
- else:
- c.recurse = true
- return false
- else:
- op = field
- if op == nil:
- op = produceSym(c.g, c.c, t, c.kind, c.info)
- if sfError in op.flags:
- incl c.fn.flags, sfError
- #else:
- # markUsed(c.g.config, c.info, op, c.g.usageSym)
- onUse(c.info, op)
- # We also now do generic instantiations in the destructor lifting pass:
- if op.ast[genericParamsPos].kind != nkEmpty:
- op = instantiateGeneric(c, op, t, t.typeInst)
- field = op
- #echo "trying to use ", op.ast
- #echo "for ", op.name.s, " "
- #debug(t)
- #return false
- assert op.ast[genericParamsPos].kind == nkEmpty
- body.add newAsgnCall(c.g, op, x, y)
- result = true
- proc addDestructorCall(c: var TLiftCtx; orig: PType; body, x: PNode) =
- let t = orig.skipTypes(abstractInst)
- var op = t.destructor
- if op != nil and sfOverriden in op.flags:
- if op.ast[genericParamsPos].kind != nkEmpty:
- # patch generic destructor:
- op = instantiateGeneric(c, op, t, t.typeInst)
- t.attachedOps[attachedDestructor] = op
- if op == nil and useNoGc(c, t):
- op = produceSym(c.g, c.c, t, attachedDestructor, c.info)
- doAssert op != nil
- doAssert op == t.destructor
- if op != nil:
- #markUsed(c.g.config, c.info, op, c.g.usageSym)
- onUse(c.info, op)
- body.add destructorCall(c.g, op, x)
- elif useNoGc(c, t):
- internalError(c.g.config, c.info,
- "type-bound operator could not be resolved")
- proc considerUserDefinedOp(c: var TLiftCtx; t: PType; body, x, y: PNode): bool =
- case c.kind
- of attachedDestructor:
- var op = t.destructor
- if op != nil and sfOverriden in op.flags:
- if op.ast[genericParamsPos].kind != nkEmpty:
- # patch generic destructor:
- op = instantiateGeneric(c, op, t, t.typeInst)
- t.attachedOps[attachedDestructor] = op
- #markUsed(c.g.config, c.info, op, c.g.usageSym)
- onUse(c.info, op)
- body.add destructorCall(c.g, op, x)
- result = true
- #result = addDestructorCall(c, t, body, x)
- of attachedAsgn:
- result = considerAsgnOrSink(c, t, body, x, y, t.assignment)
- of attachedSink:
- result = considerAsgnOrSink(c, t, body, x, y, t.asink)
- of attachedDeepCopy:
- let op = t.attachedOps[attachedDeepCopy]
- if op != nil:
- #markUsed(c.g.config, c.info, op, c.g.usageSym)
- onUse(c.info, op)
- body.add newDeepCopyCall(op, x, y)
- result = true
- proc defaultOp(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- if c.kind != attachedDestructor:
- body.add newAsgnStmt(x, y)
- proc addVar(father, v, value: PNode) =
- var vpart = newNodeI(nkIdentDefs, v.info, 3)
- vpart.sons[0] = v
- vpart.sons[1] = newNodeI(nkEmpty, v.info)
- vpart.sons[2] = value
- addSon(father, vpart)
- proc declareCounter(c: var TLiftCtx; body: PNode; first: BiggestInt): PNode =
- var temp = newSym(skTemp, getIdent(c.g.cache, lowerings.genPrefix), c.fn, c.info)
- temp.typ = getSysType(c.g, body.info, tyInt)
- incl(temp.flags, sfFromGeneric)
- var v = newNodeI(nkVarSection, c.info)
- result = newSymNode(temp)
- v.addVar(result, lowerings.newIntLit(c.g, body.info, first))
- body.add v
- proc genBuiltin(g: ModuleGraph; magic: TMagic; name: string; i: PNode): PNode =
- result = newNodeI(nkCall, i.info)
- result.add createMagic(g, name, magic).newSymNode
- result.add i
- proc genWhileLoop(c: var TLiftCtx; i, dest: PNode): PNode =
- result = newNodeI(nkWhileStmt, c.info, 2)
- let cmp = genBuiltin(c.g, mLtI, "<", i)
- cmp.add genLen(c.g, dest)
- cmp.typ = getSysType(c.g, c.info, tyBool)
- result.sons[0] = cmp
- result.sons[1] = newNodeI(nkStmtList, c.info)
- proc genIf(c: var TLiftCtx; cond, action: PNode): PNode =
- result = newTree(nkIfStmt, newTree(nkElifBranch, cond, action))
- proc addIncStmt(c: var TLiftCtx; body, i: PNode) =
- let incCall = genBuiltin(c.g, mInc, "inc", i)
- incCall.add lowerings.newIntLit(c.g, c.info, 1)
- body.add incCall
- proc newSeqCall(g: ModuleGraph; x, y: PNode): PNode =
- # don't call genAddr(c, x) here:
- result = genBuiltin(g, mNewSeq, "newSeq", x)
- let lenCall = genBuiltin(g, mLengthSeq, "len", y)
- lenCall.typ = getSysType(g, x.info, tyInt)
- result.add lenCall
- proc setLenStrCall(g: ModuleGraph; x, y: PNode): PNode =
- let lenCall = genBuiltin(g, mLengthStr, "len", y)
- lenCall.typ = getSysType(g, x.info, tyInt)
- result = genBuiltin(g, mSetLengthStr, "setLen", x) # genAddr(g, x))
- result.add lenCall
- proc setLenSeqCall(c: var TLiftCtx; t: PType; x, y: PNode): PNode =
- let lenCall = genBuiltin(c.g, mLengthSeq, "len", y)
- lenCall.typ = getSysType(c.g, x.info, tyInt)
- var op = getSysMagic(c.g, x.info, "setLen", mSetLengthSeq)
- op = instantiateGeneric(c, op, t, t)
- result = newTree(nkCall, newSymNode(op, x.info), x, lenCall)
- proc forallElements(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- let i = declareCounter(c, body, toInt64(firstOrd(c.g.config, t)))
- let whileLoop = genWhileLoop(c, i, x)
- let elemType = t.lastSon
- fillBody(c, elemType, whileLoop.sons[1], x.at(i, elemType),
- y.at(i, elemType))
- addIncStmt(c, whileLoop.sons[1], i)
- body.add whileLoop
- proc fillSeqOp(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- case c.kind
- of attachedAsgn, attachedDeepCopy:
- # we generate:
- # setLen(dest, y.len)
- # var i = 0
- # while i < y.len: dest[i] = y[i]; inc(i)
- # This is usually more efficient than a destroy/create pair.
- body.add setLenSeqCall(c, t, x, y)
- forallElements(c, t, body, x, y)
- of attachedSink:
- let moveCall = genBuiltin(c.g, mMove, "move", x)
- moveCall.add y
- doAssert t.destructor != nil
- moveCall.add destructorCall(c.g, t.destructor, x)
- body.add moveCall
- of attachedDestructor:
- # destroy all elements:
- forallElements(c, t, body, x, y)
- body.add genBuiltin(c.g, mDestroy, "destroy", x)
- proc useSeqOrStrOp(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- createTypeBoundOps(c.g, c.c, t, body.info)
- case c.kind
- of attachedAsgn, attachedDeepCopy:
- doAssert t.assignment != nil
- body.add newAsgnCall(c.g, t.assignment, x, y)
- of attachedSink:
- # we always inline the move for better performance:
- let moveCall = genBuiltin(c.g, mMove, "move", x)
- moveCall.add y
- doAssert t.destructor != nil
- moveCall.add destructorCall(c.g, t.destructor, x)
- body.add moveCall
- # alternatively we could do this:
- when false:
- doAssert t.asink != nil
- body.add newAsgnCall(c.g, t.asink, x, y)
- of attachedDestructor:
- doAssert t.destructor != nil
- body.add destructorCall(c.g, t.destructor, x)
- proc fillStrOp(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- case c.kind
- of attachedAsgn, attachedDeepCopy:
- body.add callCodegenProc(c.g, "nimAsgnStrV2", c.info, genAddr(c.g, x), y)
- of attachedSink:
- let moveCall = genBuiltin(c.g, mMove, "move", x)
- moveCall.add y
- doAssert t.destructor != nil
- moveCall.add destructorCall(c.g, t.destructor, x)
- body.add moveCall
- of attachedDestructor:
- body.add genBuiltin(c.g, mDestroy, "destroy", x)
- proc weakrefOp(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- case c.kind
- of attachedSink:
- # we 'nil' y out afterwards so we *need* to take over its reference
- # count value:
- body.add genIf(c, x, callCodegenProc(c.g, "nimDecWeakRef", c.info, x))
- body.add newAsgnStmt(x, y)
- of attachedAsgn:
- body.add genIf(c, y, callCodegenProc(c.g, "nimIncWeakRef", c.info, y))
- body.add genIf(c, x, callCodegenProc(c.g, "nimDecWeakRef", c.info, x))
- body.add newAsgnStmt(x, y)
- of attachedDestructor:
- # it's better to prepend the destruction of weak refs in order to
- # prevent wrong "dangling refs exist" problems:
- let des = genIf(c, x, callCodegenProc(c.g, "nimDecWeakRef", c.info, x))
- if body.len == 0:
- body.add des
- else:
- body.sons.insert(des, 0)
- of attachedDeepCopy: assert(false, "cannot happen")
- proc ownedRefOp(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- var actions = newNodeI(nkStmtList, c.info)
- let elemType = t.lastSon
- #fillBody(c, elemType, actions, genDeref(x), genDeref(y))
- #var disposeCall = genBuiltin(c.g, mDispose, "dispose", x)
- if isFinal(elemType):
- addDestructorCall(c, elemType, actions, genDeref(x, nkDerefExpr))
- actions.add callCodegenProc(c.g, "nimRawDispose", c.info, x)
- else:
- addDestructorCall(c, elemType, newNodeI(nkStmtList, c.info), genDeref(x, nkDerefExpr))
- actions.add callCodegenProc(c.g, "nimDestroyAndDispose", c.info, x)
- case c.kind
- of attachedSink, attachedAsgn:
- body.add genIf(c, x, actions)
- body.add newAsgnStmt(x, y)
- of attachedDestructor:
- body.add genIf(c, x, actions)
- of attachedDeepCopy: assert(false, "cannot happen")
- proc closureOp(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- if c.kind == attachedDeepCopy:
- # a big problem is that we don't know the environment's type here, so we
- # have to go through some indirection; we delegate this to the codegen:
- let call = newNodeI(nkCall, c.info, 2)
- call.typ = t
- call.sons[0] = newSymNode(createMagic(c.g, "deepCopy", mDeepCopy))
- call.sons[1] = y
- body.add newAsgnStmt(x, call)
- elif optOwnedRefs in c.g.config.globalOptions and
- optRefCheck in c.g.config.options:
- let xx = genBuiltin(c.g, mAccessEnv, "accessEnv", x)
- xx.typ = getSysType(c.g, c.info, tyPointer)
- case c.kind
- of attachedSink:
- # we 'nil' y out afterwards so we *need* to take over its reference
- # count value:
- body.add genIf(c, xx, callCodegenProc(c.g, "nimDecWeakRef", c.info, xx))
- body.add newAsgnStmt(x, y)
- of attachedAsgn:
- let yy = genBuiltin(c.g, mAccessEnv, "accessEnv", y)
- yy.typ = getSysType(c.g, c.info, tyPointer)
- body.add genIf(c, yy, callCodegenProc(c.g, "nimIncWeakRef", c.info, yy))
- body.add genIf(c, xx, callCodegenProc(c.g, "nimDecWeakRef", c.info, xx))
- body.add newAsgnStmt(x, y)
- of attachedDestructor:
- let des = genIf(c, xx, callCodegenProc(c.g, "nimDecWeakRef", c.info, xx))
- if body.len == 0:
- body.add des
- else:
- body.sons.insert(des, 0)
- of attachedDeepCopy: assert(false, "cannot happen")
- proc ownedClosureOp(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- let xx = genBuiltin(c.g, mAccessEnv, "accessEnv", x)
- xx.typ = getSysType(c.g, c.info, tyPointer)
- var actions = newNodeI(nkStmtList, c.info)
- let elemType = t.lastSon
- #discard addDestructorCall(c, elemType, newNodeI(nkStmtList, c.info), genDeref(xx))
- actions.add callCodegenProc(c.g, "nimDestroyAndDispose", c.info, xx)
- case c.kind
- of attachedSink, attachedAsgn:
- body.add genIf(c, xx, actions)
- body.add newAsgnStmt(x, y)
- of attachedDestructor:
- body.add genIf(c, xx, actions)
- of attachedDeepCopy: assert(false, "cannot happen")
- proc fillBody(c: var TLiftCtx; t: PType; body, x, y: PNode) =
- case t.kind
- of tyNone, tyEmpty, tyVoid: discard
- of tyPointer, tySet, tyBool, tyChar, tyEnum, tyInt..tyUInt64, tyCString,
- tyPtr, tyOpt, tyUncheckedArray:
- defaultOp(c, t, body, x, y)
- of tyRef:
- if optOwnedRefs in c.g.config.globalOptions and
- optRefCheck in c.g.config.options:
- weakrefOp(c, t, body, x, y)
- else:
- defaultOp(c, t, body, x, y)
- of tyProc:
- if t.callConv == ccClosure:
- closureOp(c, t, body, x, y)
- else:
- defaultOp(c, t, body, x, y)
- of tyOwned:
- let base = t.skipTypes(abstractInstOwned)
- if optOwnedRefs in c.g.config.globalOptions:
- case base.kind
- of tyRef:
- ownedRefOp(c, base, body, x, y)
- return
- of tyProc:
- if base.callConv == ccClosure:
- ownedClosureOp(c, base, body, x, y)
- return
- else: discard
- defaultOp(c, base, body, x, y)
- of tyArray:
- if tfHasAsgn in t.flags or useNoGc(c, t):
- forallElements(c, t, body, x, y)
- else:
- defaultOp(c, t, body, x, y)
- of tySequence:
- if useNoGc(c, t):
- useSeqOrStrOp(c, t, body, x, y)
- elif c.g.config.selectedGC == gcDestructors:
- # note that tfHasAsgn is propagated so we need the check on
- # 'selectedGC' here to determine if we have the new runtime.
- discard considerUserDefinedOp(c, t, body, x, y)
- elif tfHasAsgn in t.flags:
- if c.kind != attachedDestructor:
- body.add newSeqCall(c.g, x, y)
- forallElements(c, t, body, x, y)
- else:
- defaultOp(c, t, body, x, y)
- of tyString:
- if useNoGc(c, t):
- useSeqOrStrOp(c, t, body, x, y)
- elif tfHasAsgn in t.flags:
- discard considerUserDefinedOp(c, t, body, x, y)
- else:
- defaultOp(c, t, body, x, y)
- of tyObject:
- if not considerUserDefinedOp(c, t, body, x, y):
- fillBodyObjT(c, t, body, x, y)
- of tyDistinct:
- if not considerUserDefinedOp(c, t, body, x, y):
- fillBody(c, t.sons[0].skipTypes(skipPtrs), body, x, y)
- of tyTuple:
- fillBodyTup(c, t, body, x, y)
- of tyVarargs, tyOpenArray:
- if c.kind == attachedDestructor:
- forallElements(c, t, body, x, y)
- else:
- discard "cannot copy openArray"
- of tyFromExpr, tyProxy, tyBuiltInTypeClass, tyUserTypeClass,
- tyUserTypeClassInst, tyCompositeTypeClass, tyAnd, tyOr, tyNot, tyAnything,
- tyGenericParam, tyGenericBody, tyNil, tyUntyped, tyTyped,
- tyTypeDesc, tyGenericInvocation, tyForward:
- #internalError(c.g.config, c.info, "assignment requested for type: " & typeToString(t))
- discard
- of tyVar, tyLent:
- if c.kind != attachedDestructor:
- fillBody(c, lastSon(t), body, x, y)
- of tyOrdinal, tyRange, tyInferred,
- tyGenericInst, tyStatic, tyAlias, tySink:
- fillBody(c, lastSon(t), body, x, y)
- proc produceSymDistinctType(g: ModuleGraph; c: PContext; typ: PType; kind: TTypeAttachedOp; info: TLineInfo): PSym =
- assert typ.kind == tyDistinct
- let baseType = typ[0]
- if baseType.attachedOps[kind] == nil:
- discard produceSym(g, c, baseType, kind, info)
- typ.attachedOps[kind] = baseType.attachedOps[kind]
- result = typ.attachedOps[kind]
- proc produceSym(g: ModuleGraph; c: PContext; typ: PType; kind: TTypeAttachedOp;
- info: TLineInfo): PSym =
- if typ.kind == tyDistinct:
- return produceSymDistinctType(g, c, typ, kind, info)
- var a: TLiftCtx
- a.info = info
- a.g = g
- a.kind = kind
- a.c = c
- let body = newNodeI(nkStmtList, info)
- let procname = getIdent(g.cache, AttachedOpToStr[kind])
- result = newSym(skProc, procname, typ.owner, info)
- a.fn = result
- a.asgnForType = typ
- let dest = newSym(skParam, getIdent(g.cache, "dest"), result, info)
- let src = newSym(skParam, getIdent(g.cache, "src"), result, info)
- dest.typ = makeVarType(typ.owner, typ)
- src.typ = typ
- result.typ = newProcType(info, typ.owner)
- result.typ.addParam dest
- if kind != attachedDestructor:
- result.typ.addParam src
- # register this operation already:
- typ.attachedOps[kind] = result
- var tk: TTypeKind
- if g.config.selectedGC == gcDestructors:
- tk = skipTypes(typ, {tyOrdinal, tyRange, tyInferred, tyGenericInst, tyStatic, tyAlias, tySink}).kind
- else:
- tk = tyNone # no special casing for strings and seqs
- case tk
- of tySequence:
- fillSeqOp(a, typ, body, newSymNode(dest).newDeref, newSymNode(src))
- of tyString:
- fillStrOp(a, typ, body, newSymNode(dest).newDeref, newSymNode(src))
- else:
- fillBody(a, typ, body, newSymNode(dest).newDeref, newSymNode(src))
- var n = newNodeI(nkProcDef, info, bodyPos+1)
- for i in 0 ..< n.len: n.sons[i] = newNodeI(nkEmpty, info)
- n.sons[namePos] = newSymNode(result)
- n.sons[paramsPos] = result.typ.n
- n.sons[bodyPos] = body
- result.ast = n
- incl result.flags, sfFromGeneric
- incl result.flags, sfGeneratedOp
- template liftTypeBoundOps*(c: PContext; typ: PType; info: TLineInfo) =
- discard "now a nop"
- proc patchBody(g: ModuleGraph; c: PContext; n: PNode; info: TLineInfo) =
- if n.kind in nkCallKinds:
- if n[0].kind == nkSym and n[0].sym.magic == mDestroy:
- let t = n[1].typ.skipTypes(abstractVar)
- if t.destructor == nil:
- discard produceSym(g, c, t, attachedDestructor, info)
- if t.destructor != nil:
- if t.destructor.ast[genericParamsPos].kind != nkEmpty:
- internalError(g.config, info, "resolved destructor is generic")
- if t.destructor.magic == mDestroy:
- internalError(g.config, info, "patching mDestroy with mDestroy?")
- n.sons[0] = newSymNode(t.destructor)
- for x in n: patchBody(g, c, x, info)
- template inst(field, t) =
- if field.ast != nil and field.ast[genericParamsPos].kind != nkEmpty:
- if t.typeInst != nil:
- var a: TLiftCtx
- a.info = info
- a.g = g
- a.kind = k
- a.c = c
- field = instantiateGeneric(a, field, t, t.typeInst)
- if field.ast != nil:
- patchBody(g, c, field.ast, info)
- else:
- localError(g.config, info, "unresolved generic parameter")
- proc isTrival(s: PSym): bool {.inline.} = s == nil or s.ast[bodyPos].len == 0
- proc createTypeBoundOps(g: ModuleGraph; c: PContext; orig: PType; info: TLineInfo) =
- ## In the semantic pass this is called in strategic places
- ## to ensure we lift assignment, destructors and moves properly.
- ## The later 'injectdestructors' pass depends on it.
- if orig == nil or {tfCheckedForDestructor, tfHasMeta} * orig.skipTypes({tyAlias}).flags != {}: return
- incl orig.flags, tfCheckedForDestructor
- let h = sighashes.hashType(orig, {CoType, CoConsiderOwned, CoDistinct})
- var canon = g.canonTypes.getOrDefault(h)
- var overwrite = false
- if canon == nil:
- let typ = orig.skipTypes({tyGenericInst, tyAlias, tySink})
- g.canonTypes[h] = typ
- canon = typ
- if canon != orig:
- overwrite = true
- # multiple cases are to distinguish here:
- # 1. we don't know yet if 'typ' has a nontrival destructor.
- # 2. we have a nop destructor. --> mDestroy
- # 3. we have a lifted destructor.
- # 4. We have a custom destructor.
- # 5. We have a (custom) generic destructor.
- # we generate the destructor first so that other operators can depend on it:
- for k in attachedDestructor..attachedSink:
- if canon.attachedOps[k] == nil:
- discard produceSym(g, c, canon, k, info)
- else:
- inst(canon.attachedOps[k], canon)
- if overwrite:
- for k in attachedDestructor..attachedSink:
- orig.attachedOps[k] = canon.attachedOps[k]
- if not isTrival(orig.destructor):
- #or not isTrival(orig.assignment) or
- # not isTrival(orig.sink):
- orig.flags.incl tfHasAsgn
|