ccgstmts.nim 58 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642
  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. # included from cgen.nim
  10. const
  11. RangeExpandLimit = 256 # do not generate ranges
  12. # over 'RangeExpandLimit' elements
  13. stringCaseThreshold = 8
  14. # above X strings a hash-switch for strings is generated
  15. proc registerTraverseProc(p: BProc, v: PSym) =
  16. var traverseProc = ""
  17. if p.config.selectedGC in {gcMarkAndSweep, gcHooks, gcRefc} and
  18. optOwnedRefs notin p.config.globalOptions and
  19. containsGarbageCollectedRef(v.loc.t):
  20. # we register a specialized marked proc here; this has the advantage
  21. # that it works out of the box for thread local storage then :-)
  22. traverseProc = genTraverseProcForGlobal(p.module, v, v.info)
  23. if traverseProc.len != 0 and not p.hcrOn:
  24. if sfThread in v.flags:
  25. appcg(p.module, p.module.preInitProc.procSec(cpsInit),
  26. "$n\t#nimRegisterThreadLocalMarker($1);$n$n", [traverseProc])
  27. else:
  28. appcg(p.module, p.module.preInitProc.procSec(cpsInit),
  29. "$n\t#nimRegisterGlobalMarker($1);$n$n", [traverseProc])
  30. proc isAssignedImmediately(conf: ConfigRef; n: PNode): bool {.inline.} =
  31. if n.kind == nkEmpty:
  32. result = false
  33. elif n.kind in nkCallKinds and n[0] != nil and n[0].typ != nil and n[0].typ.skipTypes(abstractInst).kind == tyProc:
  34. if n[0].kind == nkSym and sfConstructor in n[0].sym.flags:
  35. result = true
  36. elif isInvalidReturnType(conf, n[0].typ, true):
  37. # var v = f()
  38. # is transformed into: var v; f(addr v)
  39. # where 'f' **does not** initialize the result!
  40. result = false
  41. else:
  42. result = true
  43. elif isInvalidReturnType(conf, n.typ, false):
  44. result = false
  45. else:
  46. result = true
  47. proc inExceptBlockLen(p: BProc): int =
  48. result = 0
  49. for x in p.nestedTryStmts:
  50. if x.inExcept: result.inc
  51. proc startBlockInternal(p: BProc): int {.discardable.} =
  52. inc(p.labels)
  53. result = p.blocks.len
  54. p.blocks.add initBlock()
  55. p.blocks[result].id = p.labels
  56. p.blocks[result].nestedTryStmts = p.nestedTryStmts.len.int16
  57. p.blocks[result].nestedExceptStmts = p.inExceptBlockLen.int16
  58. template startBlock(p: BProc, start: FormatStr = "{$n",
  59. args: varargs[Rope]): int =
  60. lineCg(p, cpsStmts, start, args)
  61. startBlockInternal(p)
  62. proc endBlock(p: BProc)
  63. proc genVarTuple(p: BProc, n: PNode) =
  64. if n.kind != nkVarTuple: internalError(p.config, n.info, "genVarTuple")
  65. # if we have a something that's been captured, use the lowering instead:
  66. for i in 0..<n.len-2:
  67. if n[i].kind != nkSym:
  68. genStmts(p, lowerTupleUnpacking(p.module.g.graph, n, p.module.idgen, p.prc))
  69. return
  70. # check only the first son
  71. var forHcr = treatGlobalDifferentlyForHCR(p.module, n[0].sym)
  72. let hcrCond = if forHcr: getTempName(p.module) else: ""
  73. var hcrGlobals: seq[tuple[loc: TLoc, tp: Rope]] = @[]
  74. # determine if the tuple is constructed at top-level scope or inside of a block (if/while/block)
  75. let isGlobalInBlock = forHcr and p.blocks.len > 2
  76. # do not close and reopen blocks if this is a 'global' but inside of a block (if/while/block)
  77. forHcr = forHcr and not isGlobalInBlock
  78. if forHcr:
  79. # check with the boolean if the initializing code for the tuple should be ran
  80. lineCg(p, cpsStmts, "if ($1)$n", [hcrCond])
  81. startBlock(p)
  82. genLineDir(p, n)
  83. var tup = initLocExpr(p, n[^1])
  84. var t = tup.t.skipTypes(abstractInst)
  85. for i in 0..<n.len-2:
  86. let vn = n[i]
  87. let v = vn.sym
  88. if sfCompileTime in v.flags: continue
  89. if sfGlobal in v.flags:
  90. assignGlobalVar(p, vn, "")
  91. genObjectInit(p, cpsInit, v.typ, v.loc, constructObj)
  92. registerTraverseProc(p, v)
  93. else:
  94. assignLocalVar(p, vn)
  95. initLocalVar(p, v, immediateAsgn=isAssignedImmediately(p.config, n[^1]))
  96. var field = initLoc(locExpr, vn, tup.storage)
  97. if t.kind == tyTuple:
  98. field.r = "$1.Field$2" % [rdLoc(tup), rope(i)]
  99. else:
  100. if t.n[i].kind != nkSym: internalError(p.config, n.info, "genVarTuple")
  101. field.r = "$1.$2" % [rdLoc(tup), mangleRecFieldName(p.module, t.n[i].sym)]
  102. putLocIntoDest(p, v.loc, field)
  103. if forHcr or isGlobalInBlock:
  104. hcrGlobals.add((loc: v.loc, tp: "NULL"))
  105. if forHcr:
  106. # end the block where the tuple gets initialized
  107. endBlock(p)
  108. if forHcr or isGlobalInBlock:
  109. # insert the registration of the globals for the different parts of the tuple at the
  110. # start of the current scope (after they have been iterated) and init a boolean to
  111. # check if any of them is newly introduced and the initializing code has to be ran
  112. lineCg(p, cpsLocals, "NIM_BOOL $1 = NIM_FALSE;$n", [hcrCond])
  113. for curr in hcrGlobals:
  114. lineCg(p, cpsLocals, "$1 |= hcrRegisterGlobal($4, \"$2\", sizeof($3), $5, (void**)&$2);$N",
  115. [hcrCond, curr.loc.r, rdLoc(curr.loc), getModuleDllPath(p.module, n[0].sym), curr.tp])
  116. proc loadInto(p: BProc, le, ri: PNode, a: var TLoc) {.inline.} =
  117. if ri.kind in nkCallKinds and (ri[0].kind != nkSym or
  118. ri[0].sym.magic == mNone):
  119. genAsgnCall(p, le, ri, a)
  120. else:
  121. # this is a hacky way to fix #1181 (tmissingderef)::
  122. #
  123. # var arr1 = cast[ptr array[4, int8]](addr foo)[]
  124. #
  125. # However, fixing this properly really requires modelling 'array' as
  126. # a 'struct' in C to preserve dereferencing semantics completely. Not
  127. # worth the effort until version 1.0 is out.
  128. a.flags.incl(lfEnforceDeref)
  129. expr(p, ri, a)
  130. proc assignLabel(b: var TBlock; result: var Rope) {.inline.} =
  131. b.label = "LA" & b.id.rope
  132. result.add b.label
  133. proc blockBody(b: var TBlock; result: var Rope) =
  134. result.add b.sections[cpsLocals]
  135. if b.frameLen > 0:
  136. result.addf("FR_.len+=$1;$n", [b.frameLen.rope])
  137. result.add(b.sections[cpsInit])
  138. result.add(b.sections[cpsStmts])
  139. proc endBlock(p: BProc, blockEnd: Rope) =
  140. let topBlock = p.blocks.len-1
  141. # the block is merged into the parent block
  142. p.blocks[topBlock].blockBody(p.blocks[topBlock-1].sections[cpsStmts])
  143. setLen(p.blocks, topBlock)
  144. # this is done after the block is popped so $n is
  145. # properly indented when pretty printing is enabled
  146. line(p, cpsStmts, blockEnd)
  147. proc endBlock(p: BProc) =
  148. let topBlock = p.blocks.len - 1
  149. let frameLen = p.blocks[topBlock].frameLen
  150. var blockEnd: Rope = ""
  151. if frameLen > 0:
  152. blockEnd.addf("FR_.len-=$1;$n", [frameLen.rope])
  153. if p.blocks[topBlock].label.len != 0:
  154. blockEnd.addf("} $1: ;$n", [p.blocks[topBlock].label])
  155. else:
  156. blockEnd.addf("}$n", [])
  157. endBlock(p, blockEnd)
  158. proc genSimpleBlock(p: BProc, stmts: PNode) {.inline.} =
  159. startBlock(p)
  160. genStmts(p, stmts)
  161. endBlock(p)
  162. proc exprBlock(p: BProc, n: PNode, d: var TLoc) =
  163. startBlock(p)
  164. expr(p, n, d)
  165. endBlock(p)
  166. template preserveBreakIdx(body: untyped): untyped =
  167. var oldBreakIdx = p.breakIdx
  168. body
  169. p.breakIdx = oldBreakIdx
  170. proc genState(p: BProc, n: PNode) =
  171. internalAssert p.config, n.len == 1
  172. let n0 = n[0]
  173. if n0.kind == nkIntLit:
  174. let idx = n[0].intVal
  175. linefmt(p, cpsStmts, "STATE$1: ;$n", [idx])
  176. elif n0.kind == nkStrLit:
  177. linefmt(p, cpsStmts, "$1: ;$n", [n0.strVal])
  178. proc blockLeaveActions(p: BProc, howManyTrys, howManyExcepts: int) =
  179. # Called by return and break stmts.
  180. # Deals with issues faced when jumping out of try/except/finally stmts.
  181. var stack = newSeq[tuple[fin: PNode, inExcept: bool, label: Natural]](0)
  182. inc p.withinBlockLeaveActions
  183. for i in 1..howManyTrys:
  184. let tryStmt = p.nestedTryStmts.pop
  185. if p.config.exc == excSetjmp:
  186. # Pop safe points generated by try
  187. if not tryStmt.inExcept:
  188. linefmt(p, cpsStmts, "#popSafePoint();$n", [])
  189. # Pop this try-stmt of the list of nested trys
  190. # so we don't infinite recurse on it in the next step.
  191. stack.add(tryStmt)
  192. # Find finally-stmt for this try-stmt
  193. # and generate a copy of its sons
  194. var finallyStmt = tryStmt.fin
  195. if finallyStmt != nil:
  196. genStmts(p, finallyStmt[0])
  197. dec p.withinBlockLeaveActions
  198. # push old elements again:
  199. for i in countdown(howManyTrys-1, 0):
  200. p.nestedTryStmts.add(stack[i])
  201. # Pop exceptions that was handled by the
  202. # except-blocks we are in
  203. if noSafePoints notin p.flags:
  204. for i in countdown(howManyExcepts-1, 0):
  205. linefmt(p, cpsStmts, "#popCurrentException();$n", [])
  206. proc genGotoState(p: BProc, n: PNode) =
  207. # we resist the temptation to translate it into duff's device as it later
  208. # will be translated into computed gotos anyway for GCC at least:
  209. # switch (x.state) {
  210. # case 0: goto STATE0;
  211. # ...
  212. var a: TLoc = initLocExpr(p, n[0])
  213. lineF(p, cpsStmts, "switch ($1) {$n", [rdLoc(a)])
  214. p.flags.incl beforeRetNeeded
  215. lineF(p, cpsStmts, "case -1:$n", [])
  216. blockLeaveActions(p,
  217. howManyTrys = p.nestedTryStmts.len,
  218. howManyExcepts = p.inExceptBlockLen)
  219. lineF(p, cpsStmts, " goto BeforeRet_;$n", [])
  220. var statesCounter = lastOrd(p.config, n[0].typ)
  221. if n.len >= 2 and n[1].kind == nkIntLit:
  222. statesCounter = getInt(n[1])
  223. let prefix = if n.len == 3 and n[2].kind == nkStrLit: n[2].strVal.rope
  224. else: rope"STATE"
  225. for i in 0i64..toInt64(statesCounter):
  226. lineF(p, cpsStmts, "case $2: goto $1$2;$n", [prefix, rope(i)])
  227. lineF(p, cpsStmts, "}$n", [])
  228. proc genBreakState(p: BProc, n: PNode, d: var TLoc) =
  229. var a: TLoc
  230. d = initLoc(locExpr, n, OnUnknown)
  231. if n[0].kind == nkClosure:
  232. a = initLocExpr(p, n[0][1])
  233. d.r = "(((NI*) $1)[1] < 0)" % [rdLoc(a)]
  234. else:
  235. a = initLocExpr(p, n[0])
  236. # the environment is guaranteed to contain the 'state' field at offset 1:
  237. d.r = "((((NI*) $1.ClE_0)[1]) < 0)" % [rdLoc(a)]
  238. proc genGotoVar(p: BProc; value: PNode) =
  239. if value.kind notin {nkCharLit..nkUInt64Lit}:
  240. localError(p.config, value.info, "'goto' target must be a literal value")
  241. else:
  242. lineF(p, cpsStmts, "goto NIMSTATE_$#;$n", [value.intVal.rope])
  243. proc genBracedInit(p: BProc, n: PNode; isConst: bool; optionalType: PType; result: var Rope)
  244. proc potentialValueInit(p: BProc; v: PSym; value: PNode; result: var Rope) =
  245. if lfDynamicLib in v.loc.flags or sfThread in v.flags or p.hcrOn:
  246. discard "nothing to do"
  247. elif sfGlobal in v.flags and value != nil and isDeepConstExpr(value, p.module.compileToCpp) and
  248. p.withinLoop == 0 and not containsGarbageCollectedRef(v.typ):
  249. #echo "New code produced for ", v.name.s, " ", p.config $ value.info
  250. genBracedInit(p, value, isConst = false, v.typ, result)
  251. proc genCppVarForCtor(p: BProc, v: PSym; vn, value: PNode; decl: var Rope) =
  252. var params = newRopeAppender()
  253. var argsCounter = 0
  254. let typ = skipTypes(value[0].typ, abstractInst)
  255. assert(typ.kind == tyProc)
  256. for i in 1..<value.len:
  257. assert(typ.len == typ.n.len)
  258. genOtherArg(p, value, i, typ, params, argsCounter)
  259. if params.len == 0:
  260. decl = runtimeFormat("$#;\n", [decl])
  261. else:
  262. decl = runtimeFormat("$#($#);\n", [decl, params])
  263. proc genSingleVar(p: BProc, v: PSym; vn, value: PNode) =
  264. if sfGoto in v.flags:
  265. # translate 'var state {.goto.} = X' into 'goto LX':
  266. genGotoVar(p, value)
  267. return
  268. let imm = isAssignedImmediately(p.config, value)
  269. let isCppCtorCall = p.module.compileToCpp and imm and
  270. value.kind in nkCallKinds and value[0].kind == nkSym and
  271. v.typ.kind != tyPtr and sfConstructor in value[0].sym.flags
  272. var targetProc = p
  273. var valueAsRope = ""
  274. potentialValueInit(p, v, value, valueAsRope)
  275. if sfGlobal in v.flags:
  276. if v.flags * {sfImportc, sfExportc} == {sfImportc} and
  277. value.kind == nkEmpty and
  278. v.loc.flags * {lfHeader, lfNoDecl} != {}:
  279. return
  280. if sfPure in v.flags:
  281. # v.owner.kind != skModule:
  282. targetProc = p.module.preInitProc
  283. if isCppCtorCall and not containsHiddenPointer(v.typ):
  284. callGlobalVarCppCtor(targetProc, v, vn, value)
  285. else:
  286. assignGlobalVar(targetProc, vn, valueAsRope)
  287. # XXX: be careful here.
  288. # Global variables should not be zeromem-ed within loops
  289. # (see bug #20).
  290. # That's why we are doing the construction inside the preInitProc.
  291. # genObjectInit relies on the C runtime's guarantees that
  292. # global variables will be initialized to zero.
  293. if valueAsRope.len == 0:
  294. var loc = v.loc
  295. # When the native TLS is unavailable, a global thread-local variable needs
  296. # one more layer of indirection in order to access the TLS block.
  297. # Only do this for complex types that may need a call to `objectInit`
  298. if sfThread in v.flags and emulatedThreadVars(p.config) and
  299. isComplexValueType(v.typ):
  300. loc = initLocExprSingleUse(p.module.preInitProc, vn)
  301. genObjectInit(p.module.preInitProc, cpsInit, v.typ, loc, constructObj)
  302. # Alternative construction using default constructor (which may zeromem):
  303. # if sfImportc notin v.flags: constructLoc(p.module.preInitProc, v.loc)
  304. if sfExportc in v.flags and p.module.g.generatedHeader != nil:
  305. genVarPrototype(p.module.g.generatedHeader, vn)
  306. registerTraverseProc(p, v)
  307. else:
  308. if imm and p.module.compileToCpp and p.splitDecls == 0 and
  309. not containsHiddenPointer(v.typ) and
  310. nimErrorFlagAccessed notin p.flags:
  311. # C++ really doesn't like things like 'Foo f; f = x' as that invokes a
  312. # parameterless constructor followed by an assignment operator. So we
  313. # generate better code here: 'Foo f = x;'
  314. genLineDir(p, vn)
  315. var decl = localVarDecl(p, vn)
  316. var tmp: TLoc
  317. if isCppCtorCall:
  318. genCppVarForCtor(p, v, vn, value, decl)
  319. line(p, cpsStmts, decl)
  320. else:
  321. tmp = initLocExprSingleUse(p, value)
  322. lineF(p, cpsStmts, "$# = $#;\n", [decl, tmp.rdLoc])
  323. return
  324. assignLocalVar(p, vn)
  325. initLocalVar(p, v, imm)
  326. let traverseProc = "NULL"
  327. # If the var is in a block (control flow like if/while or a block) in global scope just
  328. # register the so called "global" so it can be used later on. There is no need to close
  329. # and reopen of if (nim_hcr_do_init_) blocks because we are in one already anyway.
  330. var forHcr = treatGlobalDifferentlyForHCR(p.module, v)
  331. if forHcr and targetProc.blocks.len > 3 and v.owner.kind == skModule:
  332. # put it in the locals section - mainly because of loops which
  333. # use the var in a call to resetLoc() in the statements section
  334. lineCg(targetProc, cpsLocals, "hcrRegisterGlobal($3, \"$1\", sizeof($2), $4, (void**)&$1);$n",
  335. [v.loc.r, rdLoc(v.loc), getModuleDllPath(p.module, v), traverseProc])
  336. # nothing special left to do later on - let's avoid closing and reopening blocks
  337. forHcr = false
  338. # we close and reopen the global if (nim_hcr_do_init_) blocks in the main Init function
  339. # for the module so we can have globals and top-level code be interleaved and still
  340. # be able to re-run it but without the top level code - just the init of globals
  341. if forHcr:
  342. lineCg(targetProc, cpsStmts, "if (hcrRegisterGlobal($3, \"$1\", sizeof($2), $4, (void**)&$1))$N",
  343. [v.loc.r, rdLoc(v.loc), getModuleDllPath(p.module, v), traverseProc])
  344. startBlock(targetProc)
  345. if value.kind != nkEmpty and valueAsRope.len == 0:
  346. genLineDir(targetProc, vn)
  347. if not isCppCtorCall:
  348. loadInto(targetProc, vn, value, v.loc)
  349. if forHcr:
  350. endBlock(targetProc)
  351. proc genSingleVar(p: BProc, a: PNode) =
  352. let v = a[0].sym
  353. if sfCompileTime in v.flags:
  354. # fix issue #12640
  355. # {.global, compileTime.} pragma in proc
  356. if sfGlobal in v.flags and p.prc != nil and p.prc.kind == skProc:
  357. discard
  358. else:
  359. return
  360. genSingleVar(p, v, a[0], a[2])
  361. proc genClosureVar(p: BProc, a: PNode) =
  362. var immediateAsgn = a[2].kind != nkEmpty
  363. var v: TLoc = initLocExpr(p, a[0])
  364. genLineDir(p, a)
  365. if immediateAsgn:
  366. loadInto(p, a[0], a[2], v)
  367. elif sfNoInit notin a[0][1].sym.flags:
  368. constructLoc(p, v)
  369. proc genVarStmt(p: BProc, n: PNode) =
  370. for it in n.sons:
  371. if it.kind == nkCommentStmt: continue
  372. if it.kind == nkIdentDefs:
  373. # can be a lifted var nowadays ...
  374. if it[0].kind == nkSym:
  375. genSingleVar(p, it)
  376. else:
  377. genClosureVar(p, it)
  378. else:
  379. genVarTuple(p, it)
  380. proc genIf(p: BProc, n: PNode, d: var TLoc) =
  381. #
  382. # { if (!expr1) goto L1;
  383. # thenPart }
  384. # goto LEnd
  385. # L1:
  386. # { if (!expr2) goto L2;
  387. # thenPart2 }
  388. # goto LEnd
  389. # L2:
  390. # { elsePart }
  391. # Lend:
  392. var
  393. a: TLoc
  394. lelse: TLabel
  395. if not isEmptyType(n.typ) and d.k == locNone:
  396. d = getTemp(p, n.typ)
  397. genLineDir(p, n)
  398. let lend = getLabel(p)
  399. for it in n.sons:
  400. # bug #4230: avoid false sharing between branches:
  401. if d.k == locTemp and isEmptyType(n.typ): d.k = locNone
  402. if it.len == 2:
  403. startBlock(p)
  404. a = initLocExprSingleUse(p, it[0])
  405. lelse = getLabel(p)
  406. inc(p.labels)
  407. lineF(p, cpsStmts, "if (!$1) goto $2;$n",
  408. [rdLoc(a), lelse])
  409. if p.module.compileToCpp:
  410. # avoid "jump to label crosses initialization" error:
  411. p.s(cpsStmts).add "{"
  412. expr(p, it[1], d)
  413. p.s(cpsStmts).add "}"
  414. else:
  415. expr(p, it[1], d)
  416. endBlock(p)
  417. if n.len > 1:
  418. lineF(p, cpsStmts, "goto $1;$n", [lend])
  419. fixLabel(p, lelse)
  420. elif it.len == 1:
  421. startBlock(p)
  422. expr(p, it[0], d)
  423. endBlock(p)
  424. else: internalError(p.config, n.info, "genIf()")
  425. if n.len > 1: fixLabel(p, lend)
  426. proc genReturnStmt(p: BProc, t: PNode) =
  427. if nfPreventCg in t.flags: return
  428. p.flags.incl beforeRetNeeded
  429. genLineDir(p, t)
  430. if (t[0].kind != nkEmpty): genStmts(p, t[0])
  431. blockLeaveActions(p,
  432. howManyTrys = p.nestedTryStmts.len,
  433. howManyExcepts = p.inExceptBlockLen)
  434. if (p.finallySafePoints.len > 0) and noSafePoints notin p.flags:
  435. # If we're in a finally block, and we came here by exception
  436. # consume it before we return.
  437. var safePoint = p.finallySafePoints[^1]
  438. linefmt(p, cpsStmts, "if ($1.status != 0) #popCurrentException();$n", [safePoint])
  439. lineF(p, cpsStmts, "goto BeforeRet_;$n", [])
  440. proc genGotoForCase(p: BProc; caseStmt: PNode) =
  441. for i in 1..<caseStmt.len:
  442. startBlock(p)
  443. let it = caseStmt[i]
  444. for j in 0..<it.len-1:
  445. if it[j].kind == nkRange:
  446. localError(p.config, it.info, "range notation not available for computed goto")
  447. return
  448. let val = getOrdValue(it[j])
  449. lineF(p, cpsStmts, "NIMSTATE_$#:$n", [val.rope])
  450. genStmts(p, it.lastSon)
  451. endBlock(p)
  452. iterator fieldValuePairs(n: PNode): tuple[memberSym, valueSym: PNode] =
  453. assert(n.kind in {nkLetSection, nkVarSection})
  454. for identDefs in n:
  455. if identDefs.kind == nkIdentDefs:
  456. let valueSym = identDefs[^1]
  457. for i in 0..<identDefs.len-2:
  458. let memberSym = identDefs[i]
  459. yield((memberSym: memberSym, valueSym: valueSym))
  460. proc genComputedGoto(p: BProc; n: PNode) =
  461. # first pass: Generate array of computed labels:
  462. # flatten the loop body because otherwise let and var sections
  463. # wrapped inside stmt lists by inject destructors won't be recognised
  464. let n = n.flattenStmts()
  465. var casePos = -1
  466. var arraySize: int = 0
  467. for i in 0..<n.len:
  468. let it = n[i]
  469. if it.kind == nkCaseStmt:
  470. if lastSon(it).kind != nkOfBranch:
  471. localError(p.config, it.info,
  472. "case statement must be exhaustive for computed goto"); return
  473. casePos = i
  474. if enumHasHoles(it[0].typ):
  475. localError(p.config, it.info,
  476. "case statement cannot work on enums with holes for computed goto"); return
  477. let aSize = lengthOrd(p.config, it[0].typ)
  478. if aSize > 10_000:
  479. localError(p.config, it.info,
  480. "case statement has too many cases for computed goto"); return
  481. arraySize = toInt(aSize)
  482. if firstOrd(p.config, it[0].typ) != 0:
  483. localError(p.config, it.info,
  484. "case statement has to start at 0 for computed goto"); return
  485. if casePos < 0:
  486. localError(p.config, n.info, "no case statement found for computed goto"); return
  487. var id = p.labels+1
  488. inc p.labels, arraySize+1
  489. let tmp = "TMP$1_" % [id.rope]
  490. var gotoArray = "static void* $#[$#] = {" % [tmp, arraySize.rope]
  491. for i in 1..arraySize-1:
  492. gotoArray.addf("&&TMP$#_, ", [rope(id+i)])
  493. gotoArray.addf("&&TMP$#_};$n", [rope(id+arraySize)])
  494. line(p, cpsLocals, gotoArray)
  495. for j in 0..<casePos:
  496. genStmts(p, n[j])
  497. let caseStmt = n[casePos]
  498. var a: TLoc = initLocExpr(p, caseStmt[0])
  499. # first goto:
  500. lineF(p, cpsStmts, "goto *$#[$#];$n", [tmp, a.rdLoc])
  501. for i in 1..<caseStmt.len:
  502. startBlock(p)
  503. let it = caseStmt[i]
  504. for j in 0..<it.len-1:
  505. if it[j].kind == nkRange:
  506. localError(p.config, it.info, "range notation not available for computed goto")
  507. return
  508. let val = getOrdValue(it[j])
  509. var lit = newRopeAppender()
  510. intLiteral(toInt64(val)+id+1, lit)
  511. lineF(p, cpsStmts, "TMP$#_:$n", [lit])
  512. genStmts(p, it.lastSon)
  513. for j in casePos+1..<n.len:
  514. genStmts(p, n[j])
  515. for j in 0..<casePos:
  516. # prevent new local declarations
  517. # compile declarations as assignments
  518. let it = n[j]
  519. if it.kind in {nkLetSection, nkVarSection}:
  520. let asgn = copyNode(it)
  521. asgn.transitionSonsKind(nkAsgn)
  522. asgn.sons.setLen 2
  523. for sym, value in it.fieldValuePairs:
  524. if value.kind != nkEmpty:
  525. asgn[0] = sym
  526. asgn[1] = value
  527. genStmts(p, asgn)
  528. else:
  529. genStmts(p, it)
  530. var a: TLoc = initLocExpr(p, caseStmt[0])
  531. lineF(p, cpsStmts, "goto *$#[$#];$n", [tmp, a.rdLoc])
  532. endBlock(p)
  533. for j in casePos+1..<n.len:
  534. genStmts(p, n[j])
  535. proc genWhileStmt(p: BProc, t: PNode) =
  536. # we don't generate labels here as for example GCC would produce
  537. # significantly worse code
  538. var
  539. a: TLoc
  540. assert(t.len == 2)
  541. inc(p.withinLoop)
  542. genLineDir(p, t)
  543. preserveBreakIdx:
  544. var loopBody = t[1]
  545. if loopBody.stmtsContainPragma(wComputedGoto) and
  546. hasComputedGoto in CC[p.config.cCompiler].props:
  547. # for closure support weird loop bodies are generated:
  548. if loopBody.len == 2 and loopBody[0].kind == nkEmpty:
  549. loopBody = loopBody[1]
  550. genComputedGoto(p, loopBody)
  551. else:
  552. p.breakIdx = startBlock(p, "while (1) {$n")
  553. p.blocks[p.breakIdx].isLoop = true
  554. a = initLocExpr(p, t[0])
  555. if (t[0].kind != nkIntLit) or (t[0].intVal == 0):
  556. lineF(p, cpsStmts, "if (!$1) goto ", [rdLoc(a)])
  557. assignLabel(p.blocks[p.breakIdx], p.s(cpsStmts))
  558. appcg(p, cpsStmts, ";$n", [])
  559. genStmts(p, loopBody)
  560. if optProfiler in p.options:
  561. # invoke at loop body exit:
  562. linefmt(p, cpsStmts, "#nimProfile();$n", [])
  563. endBlock(p)
  564. dec(p.withinLoop)
  565. proc genBlock(p: BProc, n: PNode, d: var TLoc) =
  566. if not isEmptyType(n.typ):
  567. # bug #4505: allocate the temp in the outer scope
  568. # so that it can escape the generated {}:
  569. if d.k == locNone:
  570. d = getTemp(p, n.typ)
  571. d.flags.incl(lfEnforceDeref)
  572. preserveBreakIdx:
  573. p.breakIdx = startBlock(p)
  574. if n[0].kind != nkEmpty:
  575. # named block?
  576. assert(n[0].kind == nkSym)
  577. var sym = n[0].sym
  578. sym.loc.k = locOther
  579. sym.position = p.breakIdx+1
  580. expr(p, n[1], d)
  581. endBlock(p)
  582. proc genParForStmt(p: BProc, t: PNode) =
  583. assert(t.len == 3)
  584. inc(p.withinLoop)
  585. genLineDir(p, t)
  586. preserveBreakIdx:
  587. let forLoopVar = t[0].sym
  588. assignLocalVar(p, t[0])
  589. #initLoc(forLoopVar.loc, locLocalVar, forLoopVar.typ, onStack)
  590. #discard mangleName(forLoopVar)
  591. let call = t[1]
  592. assert(call.len == 4 or call.len == 5)
  593. var rangeA = initLocExpr(p, call[1])
  594. var rangeB = initLocExpr(p, call[2])
  595. # $n at the beginning because of #9710
  596. if call.len == 4: # procName(a, b, annotation)
  597. if call[0].sym.name.s == "||": # `||`(a, b, annotation)
  598. lineF(p, cpsStmts, "$n#pragma omp $4$n" &
  599. "for ($1 = $2; $1 <= $3; ++$1)",
  600. [forLoopVar.loc.rdLoc,
  601. rangeA.rdLoc, rangeB.rdLoc,
  602. call[3].getStr.rope])
  603. else:
  604. lineF(p, cpsStmts, "$n#pragma $4$n" &
  605. "for ($1 = $2; $1 <= $3; ++$1)",
  606. [forLoopVar.loc.rdLoc,
  607. rangeA.rdLoc, rangeB.rdLoc,
  608. call[3].getStr.rope])
  609. else: # `||`(a, b, step, annotation)
  610. var step: TLoc = initLocExpr(p, call[3])
  611. lineF(p, cpsStmts, "$n#pragma omp $5$n" &
  612. "for ($1 = $2; $1 <= $3; $1 += $4)",
  613. [forLoopVar.loc.rdLoc,
  614. rangeA.rdLoc, rangeB.rdLoc, step.rdLoc,
  615. call[4].getStr.rope])
  616. p.breakIdx = startBlock(p)
  617. p.blocks[p.breakIdx].isLoop = true
  618. genStmts(p, t[2])
  619. endBlock(p)
  620. dec(p.withinLoop)
  621. proc genBreakStmt(p: BProc, t: PNode) =
  622. var idx = p.breakIdx
  623. if t[0].kind != nkEmpty:
  624. # named break?
  625. assert(t[0].kind == nkSym)
  626. var sym = t[0].sym
  627. doAssert(sym.loc.k == locOther)
  628. idx = sym.position-1
  629. else:
  630. # an unnamed 'break' can only break a loop after 'transf' pass:
  631. while idx >= 0 and not p.blocks[idx].isLoop: dec idx
  632. if idx < 0 or not p.blocks[idx].isLoop:
  633. internalError(p.config, t.info, "no loop to break")
  634. p.blocks[idx].label = "LA" & p.blocks[idx].id.rope
  635. blockLeaveActions(p,
  636. p.nestedTryStmts.len - p.blocks[idx].nestedTryStmts,
  637. p.inExceptBlockLen - p.blocks[idx].nestedExceptStmts)
  638. genLineDir(p, t)
  639. lineF(p, cpsStmts, "goto $1;$n", [p.blocks[idx].label])
  640. proc raiseExit(p: BProc) =
  641. assert p.config.exc == excGoto
  642. if nimErrorFlagDisabled notin p.flags:
  643. p.flags.incl nimErrorFlagAccessed
  644. if p.nestedTryStmts.len == 0:
  645. p.flags.incl beforeRetNeeded
  646. # easy case, simply goto 'ret':
  647. lineCg(p, cpsStmts, "if (NIM_UNLIKELY(*nimErr_)) goto BeforeRet_;$n", [])
  648. else:
  649. lineCg(p, cpsStmts, "if (NIM_UNLIKELY(*nimErr_)) goto LA$1_;$n",
  650. [p.nestedTryStmts[^1].label])
  651. proc finallyActions(p: BProc) =
  652. if p.config.exc != excGoto and p.nestedTryStmts.len > 0 and p.nestedTryStmts[^1].inExcept:
  653. # if the current try stmt have a finally block,
  654. # we must execute it before reraising
  655. let finallyBlock = p.nestedTryStmts[^1].fin
  656. if finallyBlock != nil:
  657. genSimpleBlock(p, finallyBlock[0])
  658. proc raiseInstr(p: BProc; result: var Rope) =
  659. if p.config.exc == excGoto:
  660. let L = p.nestedTryStmts.len
  661. if L == 0:
  662. p.flags.incl beforeRetNeeded
  663. # easy case, simply goto 'ret':
  664. result.add ropecg(p.module, "goto BeforeRet_;$n", [])
  665. else:
  666. # raise inside an 'except' must go to the finally block,
  667. # raise outside an 'except' block must go to the 'except' list.
  668. result.add ropecg(p.module, "goto LA$1_;$n",
  669. [p.nestedTryStmts[L-1].label])
  670. # + ord(p.nestedTryStmts[L-1].inExcept)])
  671. proc genRaiseStmt(p: BProc, t: PNode) =
  672. if t[0].kind != nkEmpty:
  673. var a: TLoc = initLocExprSingleUse(p, t[0])
  674. finallyActions(p)
  675. var e = rdLoc(a)
  676. discard getTypeDesc(p.module, t[0].typ)
  677. var typ = skipTypes(t[0].typ, abstractPtrs)
  678. # XXX For reasons that currently escape me, this is only required by the new
  679. # C++ based exception handling:
  680. if p.config.exc == excCpp:
  681. blockLeaveActions(p, howManyTrys = 0, howManyExcepts = p.inExceptBlockLen)
  682. genLineDir(p, t)
  683. if isImportedException(typ, p.config):
  684. lineF(p, cpsStmts, "throw $1;$n", [e])
  685. else:
  686. lineCg(p, cpsStmts, "#raiseExceptionEx((#Exception*)$1, $2, $3, $4, $5);$n",
  687. [e, makeCString(typ.sym.name.s),
  688. makeCString(if p.prc != nil: p.prc.name.s else: p.module.module.name.s),
  689. quotedFilename(p.config, t.info), toLinenumber(t.info)])
  690. if optOwnedRefs in p.config.globalOptions:
  691. lineCg(p, cpsStmts, "$1 = NIM_NIL;$n", [e])
  692. else:
  693. finallyActions(p)
  694. genLineDir(p, t)
  695. linefmt(p, cpsStmts, "#reraiseException();$n", [])
  696. raiseInstr(p, p.s(cpsStmts))
  697. template genCaseGenericBranch(p: BProc, b: PNode, e: TLoc,
  698. rangeFormat, eqFormat: FormatStr, labl: TLabel) =
  699. var x, y: TLoc
  700. for i in 0..<b.len - 1:
  701. if b[i].kind == nkRange:
  702. x = initLocExpr(p, b[i][0])
  703. y = initLocExpr(p, b[i][1])
  704. lineCg(p, cpsStmts, rangeFormat,
  705. [rdCharLoc(e), rdCharLoc(x), rdCharLoc(y), labl])
  706. else:
  707. x = initLocExpr(p, b[i])
  708. lineCg(p, cpsStmts, eqFormat, [rdCharLoc(e), rdCharLoc(x), labl])
  709. proc genCaseSecondPass(p: BProc, t: PNode, d: var TLoc,
  710. labId, until: int): TLabel =
  711. var lend = getLabel(p)
  712. for i in 1..until:
  713. # bug #4230: avoid false sharing between branches:
  714. if d.k == locTemp and isEmptyType(t.typ): d.k = locNone
  715. lineF(p, cpsStmts, "LA$1_: ;$n", [rope(labId + i)])
  716. if t[i].kind == nkOfBranch:
  717. exprBlock(p, t[i][^1], d)
  718. lineF(p, cpsStmts, "goto $1;$n", [lend])
  719. else:
  720. exprBlock(p, t[i][0], d)
  721. result = lend
  722. template genIfForCaseUntil(p: BProc, t: PNode, d: var TLoc,
  723. rangeFormat, eqFormat: FormatStr,
  724. until: int, a: TLoc): TLabel =
  725. # generate a C-if statement for a Nim case statement
  726. var res: TLabel
  727. var labId = p.labels
  728. for i in 1..until:
  729. inc(p.labels)
  730. if t[i].kind == nkOfBranch: # else statement
  731. genCaseGenericBranch(p, t[i], a, rangeFormat, eqFormat,
  732. "LA" & rope(p.labels) & "_")
  733. else:
  734. lineF(p, cpsStmts, "goto LA$1_;$n", [rope(p.labels)])
  735. if until < t.len-1:
  736. inc(p.labels)
  737. var gotoTarget = p.labels
  738. lineF(p, cpsStmts, "goto LA$1_;$n", [rope(gotoTarget)])
  739. res = genCaseSecondPass(p, t, d, labId, until)
  740. lineF(p, cpsStmts, "LA$1_: ;$n", [rope(gotoTarget)])
  741. else:
  742. res = genCaseSecondPass(p, t, d, labId, until)
  743. res
  744. template genCaseGeneric(p: BProc, t: PNode, d: var TLoc,
  745. rangeFormat, eqFormat: FormatStr) =
  746. var a: TLoc = initLocExpr(p, t[0])
  747. var lend = genIfForCaseUntil(p, t, d, rangeFormat, eqFormat, t.len-1, a)
  748. fixLabel(p, lend)
  749. proc genCaseStringBranch(p: BProc, b: PNode, e: TLoc, labl: TLabel,
  750. stringKind: TTypeKind,
  751. branches: var openArray[Rope]) =
  752. var x: TLoc
  753. for i in 0..<b.len - 1:
  754. assert(b[i].kind != nkRange)
  755. x = initLocExpr(p, b[i])
  756. var j: int = 0
  757. case b[i].kind
  758. of nkStrLit..nkTripleStrLit:
  759. j = int(hashString(p.config, b[i].strVal) and high(branches))
  760. of nkNilLit: j = 0
  761. else:
  762. assert false, "invalid string case branch node kind"
  763. if stringKind == tyCstring:
  764. appcg(p.module, branches[j], "if (#eqCstrings($1, $2)) goto $3;$n",
  765. [rdLoc(e), rdLoc(x), labl])
  766. else:
  767. appcg(p.module, branches[j], "if (#eqStrings($1, $2)) goto $3;$n",
  768. [rdLoc(e), rdLoc(x), labl])
  769. proc genStringCase(p: BProc, t: PNode, stringKind: TTypeKind, d: var TLoc) =
  770. # count how many constant strings there are in the case:
  771. var strings = 0
  772. for i in 1..<t.len:
  773. if t[i].kind == nkOfBranch: inc(strings, t[i].len - 1)
  774. if strings > stringCaseThreshold:
  775. var bitMask = math.nextPowerOfTwo(strings) - 1
  776. var branches: seq[Rope]
  777. newSeq(branches, bitMask + 1)
  778. var a: TLoc = initLocExpr(p, t[0]) # first pass: generate ifs+goto:
  779. var labId = p.labels
  780. for i in 1..<t.len:
  781. inc(p.labels)
  782. if t[i].kind == nkOfBranch:
  783. genCaseStringBranch(p, t[i], a, "LA" & rope(p.labels) & "_",
  784. stringKind, branches)
  785. else:
  786. # else statement: nothing to do yet
  787. # but we reserved a label, which we use later
  788. discard
  789. if stringKind == tyCstring:
  790. linefmt(p, cpsStmts, "switch (#hashCstring($1) & $2) {$n",
  791. [rdLoc(a), bitMask])
  792. else:
  793. linefmt(p, cpsStmts, "switch (#hashString($1) & $2) {$n",
  794. [rdLoc(a), bitMask])
  795. for j in 0..high(branches):
  796. if branches[j] != "":
  797. var lit = newRopeAppender()
  798. intLiteral(j, lit)
  799. lineF(p, cpsStmts, "case $1: $n$2break;$n",
  800. [lit, branches[j]])
  801. lineF(p, cpsStmts, "}$n", []) # else statement:
  802. if t[^1].kind != nkOfBranch:
  803. lineF(p, cpsStmts, "goto LA$1_;$n", [rope(p.labels)])
  804. # third pass: generate statements
  805. var lend = genCaseSecondPass(p, t, d, labId, t.len-1)
  806. fixLabel(p, lend)
  807. else:
  808. if stringKind == tyCstring:
  809. genCaseGeneric(p, t, d, "", "if (#eqCstrings($1, $2)) goto $3;$n")
  810. else:
  811. genCaseGeneric(p, t, d, "", "if (#eqStrings($1, $2)) goto $3;$n")
  812. proc branchHasTooBigRange(b: PNode): bool =
  813. result = false
  814. for it in b:
  815. # last son is block
  816. if (it.kind == nkRange) and
  817. it[1].intVal - it[0].intVal > RangeExpandLimit:
  818. return true
  819. proc ifSwitchSplitPoint(p: BProc, n: PNode): int =
  820. result = 0
  821. for i in 1..<n.len:
  822. var branch = n[i]
  823. var stmtBlock = lastSon(branch)
  824. if stmtBlock.stmtsContainPragma(wLinearScanEnd):
  825. result = i
  826. elif hasSwitchRange notin CC[p.config.cCompiler].props:
  827. if branch.kind == nkOfBranch and branchHasTooBigRange(branch):
  828. result = i
  829. proc genCaseRange(p: BProc, branch: PNode) =
  830. for j in 0..<branch.len-1:
  831. if branch[j].kind == nkRange:
  832. if hasSwitchRange in CC[p.config.cCompiler].props:
  833. var litA = newRopeAppender()
  834. var litB = newRopeAppender()
  835. genLiteral(p, branch[j][0], litA)
  836. genLiteral(p, branch[j][1], litB)
  837. lineF(p, cpsStmts, "case $1 ... $2:$n", [litA, litB])
  838. else:
  839. var v = copyNode(branch[j][0])
  840. while v.intVal <= branch[j][1].intVal:
  841. var litA = newRopeAppender()
  842. genLiteral(p, v, litA)
  843. lineF(p, cpsStmts, "case $1:$n", [litA])
  844. inc(v.intVal)
  845. else:
  846. var litA = newRopeAppender()
  847. genLiteral(p, branch[j], litA)
  848. lineF(p, cpsStmts, "case $1:$n", [litA])
  849. proc genOrdinalCase(p: BProc, n: PNode, d: var TLoc) =
  850. # analyse 'case' statement:
  851. var splitPoint = ifSwitchSplitPoint(p, n)
  852. # generate if part (might be empty):
  853. var a: TLoc = initLocExpr(p, n[0])
  854. var lend = if splitPoint > 0: genIfForCaseUntil(p, n, d,
  855. rangeFormat = "if ($1 >= $2 && $1 <= $3) goto $4;$n",
  856. eqFormat = "if ($1 == $2) goto $3;$n",
  857. splitPoint, a) else: ""
  858. # generate switch part (might be empty):
  859. if splitPoint+1 < n.len:
  860. lineF(p, cpsStmts, "switch ($1) {$n", [rdCharLoc(a)])
  861. var hasDefault = false
  862. for i in splitPoint+1..<n.len:
  863. # bug #4230: avoid false sharing between branches:
  864. if d.k == locTemp and isEmptyType(n.typ): d.k = locNone
  865. var branch = n[i]
  866. if branch.kind == nkOfBranch:
  867. genCaseRange(p, branch)
  868. else:
  869. # else part of case statement:
  870. lineF(p, cpsStmts, "default:$n", [])
  871. hasDefault = true
  872. exprBlock(p, branch.lastSon, d)
  873. lineF(p, cpsStmts, "break;$n", [])
  874. if (hasAssume in CC[p.config.cCompiler].props) and not hasDefault:
  875. lineF(p, cpsStmts, "default: __assume(0);$n", [])
  876. lineF(p, cpsStmts, "}$n", [])
  877. if lend != "": fixLabel(p, lend)
  878. proc genCase(p: BProc, t: PNode, d: var TLoc) =
  879. genLineDir(p, t)
  880. if not isEmptyType(t.typ) and d.k == locNone:
  881. d = getTemp(p, t.typ)
  882. case skipTypes(t[0].typ, abstractVarRange).kind
  883. of tyString:
  884. genStringCase(p, t, tyString, d)
  885. of tyCstring:
  886. genStringCase(p, t, tyCstring, d)
  887. of tyFloat..tyFloat128:
  888. genCaseGeneric(p, t, d, "if ($1 >= $2 && $1 <= $3) goto $4;$n",
  889. "if ($1 == $2) goto $3;$n")
  890. else:
  891. if t[0].kind == nkSym and sfGoto in t[0].sym.flags:
  892. genGotoForCase(p, t)
  893. else:
  894. genOrdinalCase(p, t, d)
  895. proc genRestoreFrameAfterException(p: BProc) =
  896. if optStackTrace in p.module.config.options:
  897. if hasCurFramePointer notin p.flags:
  898. p.flags.incl hasCurFramePointer
  899. p.procSec(cpsLocals).add(ropecg(p.module, "\tTFrame* _nimCurFrame;$n", []))
  900. p.procSec(cpsInit).add(ropecg(p.module, "\t_nimCurFrame = #getFrame();$n", []))
  901. linefmt(p, cpsStmts, "#setFrame(_nimCurFrame);$n", [])
  902. proc genTryCpp(p: BProc, t: PNode, d: var TLoc) =
  903. #[ code to generate:
  904. std::exception_ptr error;
  905. try {
  906. body;
  907. } catch (Exception e) {
  908. error = std::current_exception();
  909. if (ofExpr(e, TypeHere)) {
  910. error = nullptr; // handled
  911. } else if (...) {
  912. } else {
  913. throw;
  914. }
  915. } catch(...) {
  916. // C++ exception occured, not under Nim's control.
  917. }
  918. {
  919. /* finally: */
  920. printf('fin!\n');
  921. if (error) std::rethrow_exception(error); // re-raise the exception
  922. }
  923. ]#
  924. p.module.includeHeader("<exception>")
  925. if not isEmptyType(t.typ) and d.k == locNone:
  926. d = getTemp(p, t.typ)
  927. genLineDir(p, t)
  928. inc(p.labels, 2)
  929. let etmp = p.labels
  930. lineCg(p, cpsStmts, "std::exception_ptr T$1_;$n", [etmp])
  931. let fin = if t[^1].kind == nkFinally: t[^1] else: nil
  932. p.nestedTryStmts.add((fin, false, 0.Natural))
  933. if t.kind == nkHiddenTryStmt:
  934. lineCg(p, cpsStmts, "try {$n", [])
  935. expr(p, t[0], d)
  936. lineCg(p, cpsStmts, "}$n", [])
  937. else:
  938. startBlock(p, "try {$n")
  939. expr(p, t[0], d)
  940. endBlock(p)
  941. # First pass: handle Nim based exceptions:
  942. lineCg(p, cpsStmts, "catch (#Exception* T$1_) {$n", [etmp+1])
  943. genRestoreFrameAfterException(p)
  944. # an unhandled exception happened!
  945. lineCg(p, cpsStmts, "T$1_ = std::current_exception();$n", [etmp])
  946. p.nestedTryStmts[^1].inExcept = true
  947. var hasImportedCppExceptions = false
  948. var i = 1
  949. var hasIf = false
  950. var hasElse = false
  951. while (i < t.len) and (t[i].kind == nkExceptBranch):
  952. # bug #4230: avoid false sharing between branches:
  953. if d.k == locTemp and isEmptyType(t.typ): d.k = locNone
  954. if t[i].len == 1:
  955. hasImportedCppExceptions = true
  956. # general except section:
  957. hasElse = true
  958. if hasIf: lineF(p, cpsStmts, "else ", [])
  959. startBlock(p)
  960. # we handled the error:
  961. expr(p, t[i][0], d)
  962. linefmt(p, cpsStmts, "#popCurrentException();$n", [])
  963. endBlock(p)
  964. else:
  965. var orExpr = newRopeAppender()
  966. var exvar = PNode(nil)
  967. for j in 0..<t[i].len - 1:
  968. var typeNode = t[i][j]
  969. if t[i][j].isInfixAs():
  970. typeNode = t[i][j][1]
  971. exvar = t[i][j][2] # ex1 in `except ExceptType as ex1:`
  972. assert(typeNode.kind == nkType)
  973. if isImportedException(typeNode.typ, p.config):
  974. hasImportedCppExceptions = true
  975. else:
  976. if orExpr.len != 0: orExpr.add("||")
  977. let memberName = if p.module.compileToCpp: "m_type" else: "Sup.m_type"
  978. if optTinyRtti in p.config.globalOptions:
  979. let checkFor = $getObjDepth(typeNode.typ)
  980. appcg(p.module, orExpr, "#isObjDisplayCheck(#nimBorrowCurrentException()->$1, $2, $3)", [memberName, checkFor, $genDisplayElem(MD5Digest(hashType(typeNode.typ, p.config)))])
  981. else:
  982. let checkFor = genTypeInfoV1(p.module, typeNode.typ, typeNode.info)
  983. appcg(p.module, orExpr, "#isObj(#nimBorrowCurrentException()->$1, $2)", [memberName, checkFor])
  984. if orExpr.len != 0:
  985. if hasIf:
  986. startBlock(p, "else if ($1) {$n", [orExpr])
  987. else:
  988. startBlock(p, "if ($1) {$n", [orExpr])
  989. hasIf = true
  990. if exvar != nil:
  991. fillLocalName(p, exvar.sym)
  992. fillLoc(exvar.sym.loc, locTemp, exvar, OnStack)
  993. linefmt(p, cpsStmts, "$1 $2 = T$3_;$n", [getTypeDesc(p.module, exvar.sym.typ),
  994. rdLoc(exvar.sym.loc), rope(etmp+1)])
  995. # we handled the error:
  996. linefmt(p, cpsStmts, "T$1_ = nullptr;$n", [etmp])
  997. expr(p, t[i][^1], d)
  998. linefmt(p, cpsStmts, "#popCurrentException();$n", [])
  999. endBlock(p)
  1000. inc(i)
  1001. if hasIf and not hasElse:
  1002. linefmt(p, cpsStmts, "else throw;$n", [etmp])
  1003. linefmt(p, cpsStmts, "}$n", [])
  1004. # Second pass: handle C++ based exceptions:
  1005. template genExceptBranchBody(body: PNode) {.dirty.} =
  1006. genRestoreFrameAfterException(p)
  1007. #linefmt(p, cpsStmts, "T$1_ = std::current_exception();$n", [etmp])
  1008. expr(p, body, d)
  1009. var catchAllPresent = false
  1010. incl p.flags, noSafePoints # mark as not needing 'popCurrentException'
  1011. if hasImportedCppExceptions:
  1012. for i in 1..<t.len:
  1013. if t[i].kind != nkExceptBranch: break
  1014. # bug #4230: avoid false sharing between branches:
  1015. if d.k == locTemp and isEmptyType(t.typ): d.k = locNone
  1016. if t[i].len == 1:
  1017. # general except section:
  1018. startBlock(p, "catch (...) {$n", [])
  1019. genExceptBranchBody(t[i][0])
  1020. endBlock(p)
  1021. catchAllPresent = true
  1022. else:
  1023. for j in 0..<t[i].len-1:
  1024. var typeNode = t[i][j]
  1025. if t[i][j].isInfixAs():
  1026. typeNode = t[i][j][1]
  1027. if isImportedException(typeNode.typ, p.config):
  1028. let exvar = t[i][j][2] # ex1 in `except ExceptType as ex1:`
  1029. fillLocalName(p, exvar.sym)
  1030. fillLoc(exvar.sym.loc, locTemp, exvar, OnStack)
  1031. startBlock(p, "catch ($1& $2) {$n", getTypeDesc(p.module, typeNode.typ), rdLoc(exvar.sym.loc))
  1032. genExceptBranchBody(t[i][^1]) # exception handler body will duplicated for every type
  1033. endBlock(p)
  1034. elif isImportedException(typeNode.typ, p.config):
  1035. startBlock(p, "catch ($1&) {$n", getTypeDesc(p.module, t[i][j].typ))
  1036. genExceptBranchBody(t[i][^1]) # exception handler body will duplicated for every type
  1037. endBlock(p)
  1038. excl p.flags, noSafePoints
  1039. discard pop(p.nestedTryStmts)
  1040. # general finally block:
  1041. if t.len > 0 and t[^1].kind == nkFinally:
  1042. if not catchAllPresent:
  1043. startBlock(p, "catch (...) {$n", [])
  1044. genRestoreFrameAfterException(p)
  1045. linefmt(p, cpsStmts, "T$1_ = std::current_exception();$n", [etmp])
  1046. endBlock(p)
  1047. startBlock(p)
  1048. genStmts(p, t[^1][0])
  1049. linefmt(p, cpsStmts, "if (T$1_) std::rethrow_exception(T$1_);$n", [etmp])
  1050. endBlock(p)
  1051. proc genTryCppOld(p: BProc, t: PNode, d: var TLoc) =
  1052. # There are two versions we generate, depending on whether we
  1053. # catch C++ exceptions, imported via .importcpp or not. The
  1054. # code can be easier if there are no imported C++ exceptions
  1055. # to deal with.
  1056. # code to generate:
  1057. #
  1058. # try
  1059. # {
  1060. # myDiv(4, 9);
  1061. # } catch (NimExceptionType1&) {
  1062. # body
  1063. # } catch (NimExceptionType2&) {
  1064. # finallyPart()
  1065. # raise;
  1066. # }
  1067. # catch(...) {
  1068. # general_handler_body
  1069. # }
  1070. # finallyPart();
  1071. template genExceptBranchBody(body: PNode) {.dirty.} =
  1072. genRestoreFrameAfterException(p)
  1073. expr(p, body, d)
  1074. if not isEmptyType(t.typ) and d.k == locNone:
  1075. d = getTemp(p, t.typ)
  1076. genLineDir(p, t)
  1077. cgsym(p.module, "popCurrentExceptionEx")
  1078. let fin = if t[^1].kind == nkFinally: t[^1] else: nil
  1079. p.nestedTryStmts.add((fin, false, 0.Natural))
  1080. startBlock(p, "try {$n")
  1081. expr(p, t[0], d)
  1082. endBlock(p)
  1083. var catchAllPresent = false
  1084. p.nestedTryStmts[^1].inExcept = true
  1085. for i in 1..<t.len:
  1086. if t[i].kind != nkExceptBranch: break
  1087. # bug #4230: avoid false sharing between branches:
  1088. if d.k == locTemp and isEmptyType(t.typ): d.k = locNone
  1089. if t[i].len == 1:
  1090. # general except section:
  1091. catchAllPresent = true
  1092. startBlock(p, "catch (...) {$n")
  1093. genExceptBranchBody(t[i][0])
  1094. endBlock(p)
  1095. else:
  1096. for j in 0..<t[i].len-1:
  1097. if t[i][j].isInfixAs():
  1098. let exvar = t[i][j][2] # ex1 in `except ExceptType as ex1:`
  1099. fillLocalName(p, exvar.sym)
  1100. fillLoc(exvar.sym.loc, locTemp, exvar, OnUnknown)
  1101. startBlock(p, "catch ($1& $2) {$n", getTypeDesc(p.module, t[i][j][1].typ), rdLoc(exvar.sym.loc))
  1102. else:
  1103. startBlock(p, "catch ($1&) {$n", getTypeDesc(p.module, t[i][j].typ))
  1104. genExceptBranchBody(t[i][^1]) # exception handler body will duplicated for every type
  1105. endBlock(p)
  1106. discard pop(p.nestedTryStmts)
  1107. if t[^1].kind == nkFinally:
  1108. # c++ does not have finally, therefore code needs to be generated twice
  1109. if not catchAllPresent:
  1110. # finally requires catch all presence
  1111. startBlock(p, "catch (...) {$n")
  1112. genStmts(p, t[^1][0])
  1113. line(p, cpsStmts, "throw;\n")
  1114. endBlock(p)
  1115. genSimpleBlock(p, t[^1][0])
  1116. proc bodyCanRaise(p: BProc; n: PNode): bool =
  1117. case n.kind
  1118. of nkCallKinds:
  1119. result = canRaiseDisp(p, n[0])
  1120. if not result:
  1121. # also check the arguments:
  1122. for i in 1 ..< n.len:
  1123. if bodyCanRaise(p, n[i]): return true
  1124. of nkRaiseStmt:
  1125. result = true
  1126. of nkTypeSection, nkProcDef, nkConverterDef, nkMethodDef, nkIteratorDef,
  1127. nkMacroDef, nkTemplateDef, nkLambda, nkDo, nkFuncDef:
  1128. result = false
  1129. else:
  1130. for i in 0 ..< safeLen(n):
  1131. if bodyCanRaise(p, n[i]): return true
  1132. result = false
  1133. proc genTryGoto(p: BProc; t: PNode; d: var TLoc) =
  1134. let fin = if t[^1].kind == nkFinally: t[^1] else: nil
  1135. inc p.labels
  1136. let lab = p.labels
  1137. let hasExcept = t[1].kind == nkExceptBranch
  1138. if hasExcept: inc p.withinTryWithExcept
  1139. p.nestedTryStmts.add((fin, false, Natural lab))
  1140. p.flags.incl nimErrorFlagAccessed
  1141. if not isEmptyType(t.typ) and d.k == locNone:
  1142. d = getTemp(p, t.typ)
  1143. expr(p, t[0], d)
  1144. if 1 < t.len and t[1].kind == nkExceptBranch:
  1145. startBlock(p, "if (NIM_UNLIKELY(*nimErr_)) {$n")
  1146. else:
  1147. startBlock(p)
  1148. linefmt(p, cpsStmts, "LA$1_:;$n", [lab])
  1149. p.nestedTryStmts[^1].inExcept = true
  1150. var i = 1
  1151. while (i < t.len) and (t[i].kind == nkExceptBranch):
  1152. inc p.labels
  1153. let nextExcept = p.labels
  1154. p.nestedTryStmts[^1].label = nextExcept
  1155. # bug #4230: avoid false sharing between branches:
  1156. if d.k == locTemp and isEmptyType(t.typ): d.k = locNone
  1157. if t[i].len == 1:
  1158. # general except section:
  1159. if i > 1: lineF(p, cpsStmts, "else", [])
  1160. startBlock(p)
  1161. # we handled the exception, remember this:
  1162. linefmt(p, cpsStmts, "*nimErr_ = NIM_FALSE;$n", [])
  1163. expr(p, t[i][0], d)
  1164. else:
  1165. var orExpr = newRopeAppender()
  1166. for j in 0..<t[i].len - 1:
  1167. assert(t[i][j].kind == nkType)
  1168. if orExpr.len != 0: orExpr.add("||")
  1169. let memberName = if p.module.compileToCpp: "m_type" else: "Sup.m_type"
  1170. if optTinyRtti in p.config.globalOptions:
  1171. let checkFor = $getObjDepth(t[i][j].typ)
  1172. appcg(p.module, orExpr, "#isObjDisplayCheck(#nimBorrowCurrentException()->$1, $2, $3)",
  1173. [memberName, checkFor, $genDisplayElem(MD5Digest(hashType(t[i][j].typ, p.config)))])
  1174. else:
  1175. let checkFor = genTypeInfoV1(p.module, t[i][j].typ, t[i][j].info)
  1176. appcg(p.module, orExpr, "#isObj(#nimBorrowCurrentException()->$1, $2)", [memberName, checkFor])
  1177. if i > 1: line(p, cpsStmts, "else ")
  1178. startBlock(p, "if ($1) {$n", [orExpr])
  1179. # we handled the exception, remember this:
  1180. linefmt(p, cpsStmts, "*nimErr_ = NIM_FALSE;$n", [])
  1181. expr(p, t[i][^1], d)
  1182. linefmt(p, cpsStmts, "#popCurrentException();$n", [])
  1183. linefmt(p, cpsStmts, "LA$1_:;$n", [nextExcept])
  1184. endBlock(p)
  1185. inc(i)
  1186. discard pop(p.nestedTryStmts)
  1187. endBlock(p)
  1188. if i < t.len and t[i].kind == nkFinally:
  1189. startBlock(p)
  1190. if not bodyCanRaise(p, t[i][0]):
  1191. # this is an important optimization; most destroy blocks are detected not to raise an
  1192. # exception and so we help the C optimizer by not mutating nimErr_ pointlessly:
  1193. genStmts(p, t[i][0])
  1194. else:
  1195. # pretend we did handle the error for the safe execution of the 'finally' section:
  1196. p.procSec(cpsLocals).add(ropecg(p.module, "NIM_BOOL oldNimErrFin$1_;$n", [lab]))
  1197. linefmt(p, cpsStmts, "oldNimErrFin$1_ = *nimErr_; *nimErr_ = NIM_FALSE;$n", [lab])
  1198. genStmts(p, t[i][0])
  1199. # this is correct for all these cases:
  1200. # 1. finally is run during ordinary control flow
  1201. # 2. finally is run after 'except' block handling: these however set the
  1202. # error back to nil.
  1203. # 3. finally is run for exception handling code without any 'except'
  1204. # handler present or only handlers that did not match.
  1205. linefmt(p, cpsStmts, "*nimErr_ = oldNimErrFin$1_;$n", [lab])
  1206. endBlock(p)
  1207. raiseExit(p)
  1208. if hasExcept: inc p.withinTryWithExcept
  1209. proc genTrySetjmp(p: BProc, t: PNode, d: var TLoc) =
  1210. # code to generate:
  1211. #
  1212. # XXX: There should be a standard dispatch algorithm
  1213. # that's used both here and with multi-methods
  1214. #
  1215. # TSafePoint sp;
  1216. # pushSafePoint(&sp);
  1217. # sp.status = setjmp(sp.context);
  1218. # if (sp.status == 0) {
  1219. # myDiv(4, 9);
  1220. # popSafePoint();
  1221. # } else {
  1222. # popSafePoint();
  1223. # /* except DivisionByZero: */
  1224. # if (sp.status == DivisionByZero) {
  1225. # printf('Division by Zero\n');
  1226. # clearException();
  1227. # } else {
  1228. # clearException();
  1229. # }
  1230. # }
  1231. # {
  1232. # /* finally: */
  1233. # printf('fin!\n');
  1234. # }
  1235. # if (exception not cleared)
  1236. # propagateCurrentException();
  1237. #
  1238. if not isEmptyType(t.typ) and d.k == locNone:
  1239. d = getTemp(p, t.typ)
  1240. let quirkyExceptions = p.config.exc == excQuirky or
  1241. (t.kind == nkHiddenTryStmt and sfSystemModule in p.module.module.flags)
  1242. if not quirkyExceptions:
  1243. p.module.includeHeader("<setjmp.h>")
  1244. else:
  1245. p.flags.incl noSafePoints
  1246. genLineDir(p, t)
  1247. cgsym(p.module, "Exception")
  1248. var safePoint: Rope = ""
  1249. if not quirkyExceptions:
  1250. safePoint = getTempName(p.module)
  1251. linefmt(p, cpsLocals, "#TSafePoint $1;$n", [safePoint])
  1252. linefmt(p, cpsStmts, "#pushSafePoint(&$1);$n", [safePoint])
  1253. if isDefined(p.config, "nimStdSetjmp"):
  1254. linefmt(p, cpsStmts, "$1.status = setjmp($1.context);$n", [safePoint])
  1255. elif isDefined(p.config, "nimSigSetjmp"):
  1256. linefmt(p, cpsStmts, "$1.status = sigsetjmp($1.context, 0);$n", [safePoint])
  1257. elif isDefined(p.config, "nimBuiltinSetjmp"):
  1258. linefmt(p, cpsStmts, "$1.status = __builtin_setjmp($1.context);$n", [safePoint])
  1259. elif isDefined(p.config, "nimRawSetjmp"):
  1260. if isDefined(p.config, "mswindows"):
  1261. if isDefined(p.config, "vcc") or isDefined(p.config, "clangcl"):
  1262. # For the vcc compiler, use `setjmp()` with one argument.
  1263. # See https://docs.microsoft.com/en-us/cpp/c-runtime-library/reference/setjmp?view=msvc-170
  1264. linefmt(p, cpsStmts, "$1.status = setjmp($1.context);$n", [safePoint])
  1265. else:
  1266. # The Windows `_setjmp()` takes two arguments, with the second being an
  1267. # undocumented buffer used by the SEH mechanism for stack unwinding.
  1268. # Mingw-w64 has been trying to get it right for years, but it's still
  1269. # prone to stack corruption during unwinding, so we disable that by setting
  1270. # it to NULL.
  1271. # More details: https://github.com/status-im/nimbus-eth2/issues/3121
  1272. linefmt(p, cpsStmts, "$1.status = _setjmp($1.context, 0);$n", [safePoint])
  1273. else:
  1274. linefmt(p, cpsStmts, "$1.status = _setjmp($1.context);$n", [safePoint])
  1275. else:
  1276. linefmt(p, cpsStmts, "$1.status = setjmp($1.context);$n", [safePoint])
  1277. lineCg(p, cpsStmts, "if ($1.status == 0) {$n", [safePoint])
  1278. let fin = if t[^1].kind == nkFinally: t[^1] else: nil
  1279. p.nestedTryStmts.add((fin, quirkyExceptions, 0.Natural))
  1280. expr(p, t[0], d)
  1281. if not quirkyExceptions:
  1282. linefmt(p, cpsStmts, "#popSafePoint();$n", [])
  1283. lineCg(p, cpsStmts, "}$n", [])
  1284. startBlock(p, "else {$n")
  1285. linefmt(p, cpsStmts, "#popSafePoint();$n", [])
  1286. genRestoreFrameAfterException(p)
  1287. elif 1 < t.len and t[1].kind == nkExceptBranch:
  1288. startBlock(p, "if (#nimBorrowCurrentException()) {$n")
  1289. else:
  1290. startBlock(p)
  1291. p.nestedTryStmts[^1].inExcept = true
  1292. var i = 1
  1293. while (i < t.len) and (t[i].kind == nkExceptBranch):
  1294. # bug #4230: avoid false sharing between branches:
  1295. if d.k == locTemp and isEmptyType(t.typ): d.k = locNone
  1296. if t[i].len == 1:
  1297. # general except section:
  1298. if i > 1: lineF(p, cpsStmts, "else", [])
  1299. startBlock(p)
  1300. if not quirkyExceptions:
  1301. linefmt(p, cpsStmts, "$1.status = 0;$n", [safePoint])
  1302. expr(p, t[i][0], d)
  1303. linefmt(p, cpsStmts, "#popCurrentException();$n", [])
  1304. endBlock(p)
  1305. else:
  1306. var orExpr = newRopeAppender()
  1307. for j in 0..<t[i].len - 1:
  1308. assert(t[i][j].kind == nkType)
  1309. if orExpr.len != 0: orExpr.add("||")
  1310. let memberName = if p.module.compileToCpp: "m_type" else: "Sup.m_type"
  1311. if optTinyRtti in p.config.globalOptions:
  1312. let checkFor = $getObjDepth(t[i][j].typ)
  1313. appcg(p.module, orExpr, "#isObjDisplayCheck(#nimBorrowCurrentException()->$1, $2, $3)", [memberName, checkFor, $genDisplayElem(MD5Digest(hashType(t[i][j].typ, p.config)))])
  1314. else:
  1315. let checkFor = genTypeInfoV1(p.module, t[i][j].typ, t[i][j].info)
  1316. appcg(p.module, orExpr, "#isObj(#nimBorrowCurrentException()->$1, $2)", [memberName, checkFor])
  1317. if i > 1: line(p, cpsStmts, "else ")
  1318. startBlock(p, "if ($1) {$n", [orExpr])
  1319. if not quirkyExceptions:
  1320. linefmt(p, cpsStmts, "$1.status = 0;$n", [safePoint])
  1321. expr(p, t[i][^1], d)
  1322. linefmt(p, cpsStmts, "#popCurrentException();$n", [])
  1323. endBlock(p)
  1324. inc(i)
  1325. discard pop(p.nestedTryStmts)
  1326. endBlock(p) # end of else block
  1327. if i < t.len and t[i].kind == nkFinally:
  1328. p.finallySafePoints.add(safePoint)
  1329. startBlock(p)
  1330. genStmts(p, t[i][0])
  1331. # pretend we handled the exception in a 'finally' so that we don't
  1332. # re-raise the unhandled one but instead keep the old one (it was
  1333. # not popped either):
  1334. if not quirkyExceptions and getCompilerProc(p.module.g.graph, "nimLeaveFinally") != nil:
  1335. linefmt(p, cpsStmts, "if ($1.status != 0) #nimLeaveFinally();$n", [safePoint])
  1336. endBlock(p)
  1337. discard pop(p.finallySafePoints)
  1338. if not quirkyExceptions:
  1339. linefmt(p, cpsStmts, "if ($1.status != 0) #reraiseException();$n", [safePoint])
  1340. proc genAsmOrEmitStmt(p: BProc, t: PNode, isAsmStmt=false; result: var Rope) =
  1341. var res = ""
  1342. for it in t.sons:
  1343. case it.kind
  1344. of nkStrLit..nkTripleStrLit:
  1345. res.add(it.strVal)
  1346. of nkSym:
  1347. var sym = it.sym
  1348. if sym.kind in {skProc, skFunc, skIterator, skMethod}:
  1349. var a: TLoc = initLocExpr(p, it)
  1350. res.add($rdLoc(a))
  1351. elif sym.kind == skType:
  1352. res.add($getTypeDesc(p.module, sym.typ))
  1353. else:
  1354. discard getTypeDesc(p.module, skipTypes(sym.typ, abstractPtrs))
  1355. fillBackendName(p.module, sym)
  1356. res.add($sym.loc.r)
  1357. of nkTypeOfExpr:
  1358. res.add($getTypeDesc(p.module, it.typ))
  1359. else:
  1360. discard getTypeDesc(p.module, skipTypes(it.typ, abstractPtrs))
  1361. var a: TLoc = initLocExpr(p, it)
  1362. res.add($a.rdLoc)
  1363. if isAsmStmt and hasGnuAsm in CC[p.config.cCompiler].props:
  1364. for x in splitLines(res):
  1365. var j = 0
  1366. while j < x.len and x[j] in {' ', '\t'}: inc(j)
  1367. if j < x.len:
  1368. if x[j] in {'"', ':'}:
  1369. # don't modify the line if already in quotes or
  1370. # some clobber register list:
  1371. result.add(x); result.add("\L")
  1372. else:
  1373. # ignore empty lines
  1374. result.add("\"")
  1375. result.add(x.replace("\"", "\\\""))
  1376. result.add("\\n\"\n")
  1377. else:
  1378. res.add("\L")
  1379. result.add res.rope
  1380. proc genAsmStmt(p: BProc, t: PNode) =
  1381. assert(t.kind == nkAsmStmt)
  1382. genLineDir(p, t)
  1383. var s = newRopeAppender()
  1384. genAsmOrEmitStmt(p, t, isAsmStmt=true, s)
  1385. # see bug #2362, "top level asm statements" seem to be a mis-feature
  1386. # but even if we don't do this, the example in #2362 cannot possibly
  1387. # work:
  1388. if p.prc == nil:
  1389. # top level asm statement?
  1390. p.module.s[cfsProcHeaders].add runtimeFormat(CC[p.config.cCompiler].asmStmtFrmt, [s])
  1391. else:
  1392. addIndent p, p.s(cpsStmts)
  1393. p.s(cpsStmts).add runtimeFormat(CC[p.config.cCompiler].asmStmtFrmt, [s])
  1394. proc determineSection(n: PNode): TCFileSection =
  1395. result = cfsProcHeaders
  1396. if n.len >= 1 and n[0].kind in {nkStrLit..nkTripleStrLit}:
  1397. let sec = n[0].strVal
  1398. if sec.startsWith("/*TYPESECTION*/"): result = cfsForwardTypes # TODO WORKAROUND
  1399. elif sec.startsWith("/*VARSECTION*/"): result = cfsVars
  1400. elif sec.startsWith("/*INCLUDESECTION*/"): result = cfsHeaders
  1401. proc genEmit(p: BProc, t: PNode) =
  1402. var s = newRopeAppender()
  1403. genAsmOrEmitStmt(p, t[1], false, s)
  1404. if p.prc == nil:
  1405. # top level emit pragma?
  1406. let section = determineSection(t[1])
  1407. genCLineDir(p.module.s[section], t.info, p.config)
  1408. p.module.s[section].add(s)
  1409. else:
  1410. genLineDir(p, t)
  1411. line(p, cpsStmts, s)
  1412. proc genPragma(p: BProc, n: PNode) =
  1413. for i in 0..<n.len:
  1414. let it = n[i]
  1415. case whichPragma(it)
  1416. of wEmit: genEmit(p, it)
  1417. of wPush:
  1418. processPushBackendOption(p.optionsStack, p.options, n, i+1)
  1419. of wPop:
  1420. processPopBackendOption(p.optionsStack, p.options)
  1421. else: discard
  1422. proc genDiscriminantCheck(p: BProc, a, tmp: TLoc, objtype: PType,
  1423. field: PSym) =
  1424. var t = skipTypes(objtype, abstractVar)
  1425. assert t.kind == tyObject
  1426. discard genTypeInfoV1(p.module, t, a.lode.info)
  1427. if not containsOrIncl(p.module.declaredThings, field.id):
  1428. appcg(p.module, cfsVars, "extern $1",
  1429. [discriminatorTableDecl(p.module, t, field)])
  1430. var lit = newRopeAppender()
  1431. intLiteral(toInt64(lengthOrd(p.config, field.typ))+1, lit)
  1432. lineCg(p, cpsStmts,
  1433. "#FieldDiscriminantCheck((NI)(NU)($1), (NI)(NU)($2), $3, $4);$n",
  1434. [rdLoc(a), rdLoc(tmp), discriminatorTableName(p.module, t, field),
  1435. lit])
  1436. if p.config.exc == excGoto:
  1437. raiseExit(p)
  1438. when false:
  1439. proc genCaseObjDiscMapping(p: BProc, e: PNode, t: PType, field: PSym; d: var TLoc) =
  1440. const ObjDiscMappingProcSlot = -5
  1441. var theProc: PSym = nil
  1442. for idx, p in items(t.methods):
  1443. if idx == ObjDiscMappingProcSlot:
  1444. theProc = p
  1445. break
  1446. if theProc == nil:
  1447. theProc = genCaseObjDiscMapping(t, field, e.info, p.module.g.graph, p.module.idgen)
  1448. t.methods.add((ObjDiscMappingProcSlot, theProc))
  1449. var call = newNodeIT(nkCall, e.info, getSysType(p.module.g.graph, e.info, tyUInt8))
  1450. call.add newSymNode(theProc)
  1451. call.add e
  1452. expr(p, call, d)
  1453. proc asgnFieldDiscriminant(p: BProc, e: PNode) =
  1454. var dotExpr = e[0]
  1455. if dotExpr.kind == nkCheckedFieldExpr: dotExpr = dotExpr[0]
  1456. var a = initLocExpr(p, e[0])
  1457. var tmp: TLoc = getTemp(p, a.t)
  1458. expr(p, e[1], tmp)
  1459. if p.inUncheckedAssignSection == 0:
  1460. let field = dotExpr[1].sym
  1461. genDiscriminantCheck(p, a, tmp, dotExpr[0].typ, field)
  1462. message(p.config, e.info, warnCaseTransition)
  1463. genAssignment(p, a, tmp, {})
  1464. proc genAsgn(p: BProc, e: PNode, fastAsgn: bool) =
  1465. if e[0].kind == nkSym and sfGoto in e[0].sym.flags:
  1466. genLineDir(p, e)
  1467. genGotoVar(p, e[1])
  1468. elif optFieldCheck in p.options and isDiscriminantField(e[0]):
  1469. genLineDir(p, e)
  1470. asgnFieldDiscriminant(p, e)
  1471. else:
  1472. let le = e[0]
  1473. let ri = e[1]
  1474. var a: TLoc = initLoc(locNone, le, OnUnknown)
  1475. discard getTypeDesc(p.module, le.typ.skipTypes(skipPtrs), dkVar)
  1476. a.flags.incl(lfEnforceDeref)
  1477. a.flags.incl(lfPrepareForMutation)
  1478. genLineDir(p, le) # it can be a nkBracketExpr, which may raise
  1479. expr(p, le, a)
  1480. a.flags.excl(lfPrepareForMutation)
  1481. if fastAsgn: incl(a.flags, lfNoDeepCopy)
  1482. assert(a.t != nil)
  1483. genLineDir(p, ri)
  1484. loadInto(p, le, ri, a)
  1485. proc genStmts(p: BProc, t: PNode) =
  1486. var a: TLoc = default(TLoc)
  1487. let isPush = p.config.hasHint(hintExtendedContext)
  1488. if isPush: pushInfoContext(p.config, t.info)
  1489. expr(p, t, a)
  1490. if isPush: popInfoContext(p.config)
  1491. internalAssert p.config, a.k in {locNone, locTemp, locLocalVar, locExpr}