passes.nim 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221
  1. #
  2. #
  3. # The Nim Compiler
  4. # (c) Copyright 2012 Andreas Rumpf
  5. #
  6. # See the file "copying.txt", included in this
  7. # distribution, for details about the copyright.
  8. #
  9. ## This module implements the passes functionality. A pass must implement the
  10. ## `TPass` interface.
  11. import
  12. options, ast, llstream, msgs,
  13. idents,
  14. syntaxes, idgen, modulegraphs, reorder, rod,
  15. lineinfos, pathutils
  16. type
  17. TPassData* = tuple[input: PNode, closeOutput: PNode]
  18. # a pass is a tuple of procedure vars ``TPass.close`` may produce additional
  19. # nodes. These are passed to the other close procedures.
  20. # This mechanism used to be used for the instantiation of generics.
  21. proc makePass*(open: TPassOpen = nil,
  22. process: TPassProcess = nil,
  23. close: TPassClose = nil,
  24. isFrontend = false): TPass =
  25. result.open = open
  26. result.close = close
  27. result.process = process
  28. result.isFrontend = isFrontend
  29. proc skipCodegen*(config: ConfigRef; n: PNode): bool {.inline.} =
  30. # can be used by codegen passes to determine whether they should do
  31. # something with `n`. Currently, this ignores `n` and uses the global
  32. # error count instead.
  33. result = config.errorCounter > 0
  34. const
  35. maxPasses = 10
  36. type
  37. TPassContextArray = array[0..maxPasses - 1, PPassContext]
  38. proc clearPasses*(g: ModuleGraph) =
  39. g.passes.setLen(0)
  40. proc registerPass*(g: ModuleGraph; p: TPass) =
  41. internalAssert g.config, g.passes.len < maxPasses
  42. g.passes.add(p)
  43. proc carryPass*(g: ModuleGraph; p: TPass, module: PSym;
  44. m: TPassData): TPassData =
  45. var c = p.open(g, module)
  46. result.input = p.process(c, m.input)
  47. result.closeOutput = if p.close != nil: p.close(g, c, m.closeOutput)
  48. else: m.closeOutput
  49. proc carryPasses*(g: ModuleGraph; nodes: PNode, module: PSym;
  50. passes: openArray[TPass]) =
  51. var passdata: TPassData
  52. passdata.input = nodes
  53. for pass in passes:
  54. passdata = carryPass(g, pass, module, passdata)
  55. proc openPasses(g: ModuleGraph; a: var TPassContextArray;
  56. module: PSym) =
  57. for i in 0..<g.passes.len:
  58. if not isNil(g.passes[i].open):
  59. a[i] = g.passes[i].open(g, module)
  60. else: a[i] = nil
  61. proc closePasses(graph: ModuleGraph; a: var TPassContextArray) =
  62. var m: PNode = nil
  63. for i in 0..<graph.passes.len:
  64. if not isNil(graph.passes[i].close): m = graph.passes[i].close(graph, a[i], m)
  65. a[i] = nil # free the memory here
  66. proc processTopLevelStmt(graph: ModuleGraph, n: PNode, a: var TPassContextArray): bool =
  67. # this implements the code transformation pipeline
  68. var m = n
  69. for i in 0..<graph.passes.len:
  70. if not isNil(graph.passes[i].process):
  71. m = graph.passes[i].process(a[i], m)
  72. if isNil(m): return false
  73. result = true
  74. proc resolveMod(conf: ConfigRef; module, relativeTo: string): FileIndex =
  75. let fullPath = findModule(conf, module, relativeTo)
  76. if fullPath.isEmpty:
  77. result = InvalidFileIdx
  78. else:
  79. result = fileInfoIdx(conf, fullPath)
  80. proc processImplicits(graph: ModuleGraph; implicits: seq[string], nodeKind: TNodeKind,
  81. a: var TPassContextArray; m: PSym) =
  82. # XXX fixme this should actually be relative to the config file!
  83. let relativeTo = toFullPath(graph.config, m.info)
  84. for module in items(implicits):
  85. # implicit imports should not lead to a module importing itself
  86. if m.position != resolveMod(graph.config, module, relativeTo).int32:
  87. var importStmt = newNodeI(nodeKind, m.info)
  88. var str = newStrNode(nkStrLit, module)
  89. str.info = m.info
  90. importStmt.add str
  91. if not processTopLevelStmt(graph, importStmt, a): break
  92. const
  93. imperativeCode = {low(TNodeKind)..high(TNodeKind)} - {nkTemplateDef, nkProcDef, nkMethodDef,
  94. nkMacroDef, nkConverterDef, nkIteratorDef, nkFuncDef, nkPragma,
  95. nkExportStmt, nkExportExceptStmt, nkFromStmt, nkImportStmt, nkImportExceptStmt}
  96. proc prepareConfigNotes(graph: ModuleGraph; module: PSym) =
  97. # don't be verbose unless the module belongs to the main package:
  98. if module.getnimblePkgId == graph.config.mainPackageId:
  99. graph.config.notes = graph.config.mainPackageNotes
  100. else:
  101. if graph.config.mainPackageNotes == {}: graph.config.mainPackageNotes = graph.config.notes
  102. graph.config.notes = graph.config.foreignPackageNotes
  103. proc moduleHasChanged*(graph: ModuleGraph; module: PSym): bool {.inline.} =
  104. result = module.id >= 0 or isDefined(graph.config, "nimBackendAssumesChange")
  105. proc processModule*(graph: ModuleGraph; module: PSym, stream: PLLStream): bool {.discardable.} =
  106. if graph.stopCompile(): return true
  107. var
  108. p: Parser
  109. a: TPassContextArray
  110. s: PLLStream
  111. fileIdx = module.fileIdx
  112. prepareConfigNotes(graph, module)
  113. if module.id < 0:
  114. # new module caching mechanism:
  115. for i in 0..<graph.passes.len:
  116. if not isNil(graph.passes[i].open) and not graph.passes[i].isFrontend:
  117. a[i] = graph.passes[i].open(graph, module)
  118. else:
  119. a[i] = nil
  120. if not graph.stopCompile():
  121. let n = loadNode(graph, module)
  122. var m = n
  123. for i in 0..<graph.passes.len:
  124. if not isNil(graph.passes[i].process) and not graph.passes[i].isFrontend:
  125. m = graph.passes[i].process(a[i], m)
  126. if isNil(m):
  127. break
  128. var m: PNode = nil
  129. for i in 0..<graph.passes.len:
  130. if not isNil(graph.passes[i].close) and not graph.passes[i].isFrontend:
  131. m = graph.passes[i].close(graph, a[i], m)
  132. a[i] = nil
  133. else:
  134. openPasses(graph, a, module)
  135. if stream == nil:
  136. let filename = toFullPathConsiderDirty(graph.config, fileIdx)
  137. s = llStreamOpen(filename, fmRead)
  138. if s == nil:
  139. rawMessage(graph.config, errCannotOpenFile, filename.string)
  140. return false
  141. else:
  142. s = stream
  143. while true:
  144. openParser(p, fileIdx, s, graph.cache, graph.config)
  145. if module.owner == nil or module.owner.name.s != "stdlib" or module.name.s == "distros":
  146. # XXX what about caching? no processing then? what if I change the
  147. # modules to include between compilation runs? we'd need to track that
  148. # in ROD files. I think we should enable this feature only
  149. # for the interactive mode.
  150. if module.name.s != "nimscriptapi":
  151. processImplicits graph, graph.config.implicitImports, nkImportStmt, a, module
  152. processImplicits graph, graph.config.implicitIncludes, nkIncludeStmt, a, module
  153. while true:
  154. if graph.stopCompile(): break
  155. var n = parseTopLevelStmt(p)
  156. if n.kind == nkEmpty: break
  157. if (sfSystemModule notin module.flags and
  158. ({sfNoForward, sfReorder} * module.flags != {} or
  159. codeReordering in graph.config.features)):
  160. # read everything, no streaming possible
  161. var sl = newNodeI(nkStmtList, n.info)
  162. sl.add n
  163. while true:
  164. var n = parseTopLevelStmt(p)
  165. if n.kind == nkEmpty: break
  166. sl.add n
  167. if sfReorder in module.flags or codeReordering in graph.config.features:
  168. sl = reorder(graph, sl, module)
  169. discard processTopLevelStmt(graph, sl, a)
  170. break
  171. elif n.kind in imperativeCode:
  172. # read everything until the next proc declaration etc.
  173. var sl = newNodeI(nkStmtList, n.info)
  174. sl.add n
  175. var rest: PNode = nil
  176. while true:
  177. var n = parseTopLevelStmt(p)
  178. if n.kind == nkEmpty or n.kind notin imperativeCode:
  179. rest = n
  180. break
  181. sl.add n
  182. #echo "-----\n", sl
  183. if not processTopLevelStmt(graph, sl, a): break
  184. if rest != nil:
  185. #echo "-----\n", rest
  186. if not processTopLevelStmt(graph, rest, a): break
  187. else:
  188. #echo "----- single\n", n
  189. if not processTopLevelStmt(graph, n, a): break
  190. closeParser(p)
  191. if s.kind != llsStdIn: break
  192. closePasses(graph, a)
  193. # id synchronization point for more consistent code generation:
  194. idSynchronizationPoint(1000)
  195. result = true