diff --git a/compiler/modulegraphs.nim b/compiler/modulegraphs.nim index 87a35b2900..fb8f5cf04b 100644 --- a/compiler/modulegraphs.nim +++ b/compiler/modulegraphs.nim @@ -73,7 +73,7 @@ proc addDep*(g: ModuleGraph; m: PSym, dep: int32) = deps.incl m.position.dependsOn(dep) # we compute the transitive closure later when quering the graph lazily. # this improve efficiency quite a lot: - invalidTransitiveClosure = true + #invalidTransitiveClosure = true proc addIncludeDep*(g: ModuleGraph; module, includeFile: int32) = discard hasKeyOrPut(inclToMod, includeFile, module) diff --git a/compiler/semstmts.nim b/compiler/semstmts.nim index 25d4b3c745..5a59a62c0e 100644 --- a/compiler/semstmts.nim +++ b/compiler/semstmts.nim @@ -1177,11 +1177,22 @@ proc semOverride(c: PContext, s: PSym, n: PNode) = localError(n.info, errGenerated, "'destroy' or 'deepCopy' expected for 'override'") +proc cursorInProcAux(n: PNode): bool = + if inCheckpoint(n.info) != cpNone: return true + for i in 0..