123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778 |
- #
- #
- # The Nim Compiler
- # (c) Copyright 2015 Andreas Rumpf
- #
- # See the file "copying.txt", included in this
- # distribution, for details about the copyright.
- #
- import pathutils
- when defined(nimPreviewSlimSystem):
- import std/assertions
- template setX(k, field) {.dirty.} =
- a.slots[a.ra].ensureKind(k)
- a.slots[a.ra].field = v
- proc setResult*(a: VmArgs; v: BiggestInt) = setX(rkInt, intVal)
- proc setResult*(a: VmArgs; v: BiggestFloat) = setX(rkFloat, floatVal)
- proc setResult*(a: VmArgs; v: bool) =
- let v = v.ord
- setX(rkInt, intVal)
- proc setResult*(a: VmArgs; v: string) =
- a.slots[a.ra].ensureKind(rkNode)
- a.slots[a.ra].node = newNode(nkStrLit)
- a.slots[a.ra].node.strVal = v
- proc setResult*(a: VmArgs; n: PNode) =
- a.slots[a.ra].ensureKind(rkNode)
- a.slots[a.ra].node = n
- proc setResult*(a: VmArgs; v: AbsoluteDir) = setResult(a, v.string)
- proc setResult*(a: VmArgs; v: seq[string]) =
- a.slots[a.ra].ensureKind(rkNode)
- var n = newNode(nkBracket)
- for x in v: n.add newStrNode(nkStrLit, x)
- a.slots[a.ra].node = n
- proc setResult*(a: VmArgs; v: (BiggestInt, BiggestInt)) =
- a.slots[a.ra].ensureKind(rkNode)
- var tuplen = newNode(nkTupleConstr)
- tuplen.add newIntNode(nkIntLit, v[0])
- tuplen.add newIntNode(nkIntLit, v[1])
- a.slots[a.ra].node = tuplen
- template getReg(a, i): untyped =
- doAssert i < a.rc-1
- a.slots[i+a.rb+1].unsafeAddr
- template getX(k, field): untyped {.dirty.} =
- let p = getReg(a, i)
- doAssert p.kind == k, $p.kind
- p.field
- proc numArgs*(a: VmArgs): int =
- result = a.rc-1
- proc getInt*(a: VmArgs; i: Natural): BiggestInt = getX(rkInt, intVal)
- proc getBool*(a: VmArgs; i: Natural): bool = getInt(a, i) != 0
- proc getFloat*(a: VmArgs; i: Natural): BiggestFloat = getX(rkFloat, floatVal)
- proc getNode*(a: VmArgs; i: Natural): PNode = getX(rkNode, node)
- proc getString*(a: VmArgs; i: Natural): string = getX(rkNode, node).strVal
- proc getVar*(a: VmArgs; i: Natural): PNode =
- let p = getReg(a, i)
- # depending on whether we come from top-level or proc scope, we need to consider 2 cases
- case p.kind
- of rkRegisterAddr: result = p.regAddr.node
- of rkNodeAddr: result = p.nodeAddr[]
- else: raiseAssert $p.kind
- proc getNodeAddr*(a: VmArgs; i: Natural): PNode =
- let nodeAddr = getX(rkNodeAddr, nodeAddr)
- doAssert nodeAddr != nil
- result = nodeAddr[]
|