ccgstmts.nim 59 KB

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