passes.nim 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207
  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, 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 openPasses(g: ModuleGraph; a: var TPassContextArray;
  44. module: PSym; idgen: IdGenerator) =
  45. for i in 0..<g.passes.len:
  46. if not isNil(g.passes[i].open):
  47. a[i] = g.passes[i].open(g, module, idgen)
  48. else: a[i] = nil
  49. proc closePasses(graph: ModuleGraph; a: var TPassContextArray) =
  50. var m: PNode = nil
  51. for i in 0..<graph.passes.len:
  52. if not isNil(graph.passes[i].close):
  53. m = graph.passes[i].close(graph, a[i], m)
  54. a[i] = nil # free the memory here
  55. proc processTopLevelStmt(graph: ModuleGraph, n: PNode, a: var TPassContextArray): bool =
  56. # this implements the code transformation pipeline
  57. var m = n
  58. for i in 0..<graph.passes.len:
  59. if not isNil(graph.passes[i].process):
  60. m = graph.passes[i].process(a[i], m)
  61. if isNil(m): return false
  62. result = true
  63. proc resolveMod(conf: ConfigRef; module, relativeTo: string): FileIndex =
  64. let fullPath = findModule(conf, module, relativeTo)
  65. if fullPath.isEmpty:
  66. result = InvalidFileIdx
  67. else:
  68. result = fileInfoIdx(conf, fullPath)
  69. proc processImplicits(graph: ModuleGraph; implicits: seq[string], nodeKind: TNodeKind,
  70. a: var TPassContextArray; m: PSym) =
  71. # XXX fixme this should actually be relative to the config file!
  72. let relativeTo = toFullPath(graph.config, m.info)
  73. for module in items(implicits):
  74. # implicit imports should not lead to a module importing itself
  75. if m.position != resolveMod(graph.config, module, relativeTo).int32:
  76. var importStmt = newNodeI(nodeKind, m.info)
  77. var str = newStrNode(nkStrLit, module)
  78. str.info = m.info
  79. importStmt.add str
  80. if not processTopLevelStmt(graph, importStmt, a): break
  81. const
  82. imperativeCode = {low(TNodeKind)..high(TNodeKind)} - {nkTemplateDef, nkProcDef, nkMethodDef,
  83. nkMacroDef, nkConverterDef, nkIteratorDef, nkFuncDef, nkPragma,
  84. nkExportStmt, nkExportExceptStmt, nkFromStmt, nkImportStmt, nkImportExceptStmt}
  85. proc prepareConfigNotes(graph: ModuleGraph; module: PSym) =
  86. # don't be verbose unless the module belongs to the main package:
  87. if module.getnimblePkgId == graph.config.mainPackageId:
  88. graph.config.notes = graph.config.mainPackageNotes
  89. else:
  90. if graph.config.mainPackageNotes == {}: graph.config.mainPackageNotes = graph.config.notes
  91. graph.config.notes = graph.config.foreignPackageNotes
  92. proc moduleHasChanged*(graph: ModuleGraph; module: PSym): bool {.inline.} =
  93. result = module.id >= 0 or isDefined(graph.config, "nimBackendAssumesChange")
  94. proc processModule*(graph: ModuleGraph; module: PSym; idgen: IdGenerator;
  95. stream: PLLStream): bool {.discardable.} =
  96. if graph.stopCompile(): return true
  97. var
  98. p: Parser
  99. a: TPassContextArray
  100. s: PLLStream
  101. fileIdx = module.fileIdx
  102. prepareConfigNotes(graph, module)
  103. if module.id < 0:
  104. # new module caching mechanism:
  105. for i in 0..<graph.passes.len:
  106. if not isNil(graph.passes[i].open) and not graph.passes[i].isFrontend:
  107. a[i] = graph.passes[i].open(graph, module, idgen)
  108. else:
  109. a[i] = nil
  110. if not graph.stopCompile():
  111. let n = loadNode(graph, module)
  112. var m = n
  113. for i in 0..<graph.passes.len:
  114. if not isNil(graph.passes[i].process) and not graph.passes[i].isFrontend:
  115. m = graph.passes[i].process(a[i], m)
  116. if isNil(m):
  117. break
  118. var m: PNode = nil
  119. for i in 0..<graph.passes.len:
  120. if not isNil(graph.passes[i].close) and not graph.passes[i].isFrontend:
  121. m = graph.passes[i].close(graph, a[i], m)
  122. a[i] = nil
  123. else:
  124. openPasses(graph, a, module, idgen)
  125. if stream == nil:
  126. let filename = toFullPathConsiderDirty(graph.config, fileIdx)
  127. s = llStreamOpen(filename, fmRead)
  128. if s == nil:
  129. rawMessage(graph.config, errCannotOpenFile, filename.string)
  130. return false
  131. else:
  132. s = stream
  133. while true:
  134. openParser(p, fileIdx, s, graph.cache, graph.config)
  135. if module.owner == nil or module.owner.name.s != "stdlib" or module.name.s == "distros":
  136. # XXX what about caching? no processing then? what if I change the
  137. # modules to include between compilation runs? we'd need to track that
  138. # in ROD files. I think we should enable this feature only
  139. # for the interactive mode.
  140. if module.name.s != "nimscriptapi":
  141. processImplicits graph, graph.config.implicitImports, nkImportStmt, a, module
  142. processImplicits graph, graph.config.implicitIncludes, nkIncludeStmt, a, module
  143. while true:
  144. if graph.stopCompile(): break
  145. var n = parseTopLevelStmt(p)
  146. if n.kind == nkEmpty: break
  147. if (sfSystemModule notin module.flags and
  148. ({sfNoForward, sfReorder} * module.flags != {} or
  149. codeReordering in graph.config.features)):
  150. # read everything, no streaming possible
  151. var sl = newNodeI(nkStmtList, n.info)
  152. sl.add n
  153. while true:
  154. var n = parseTopLevelStmt(p)
  155. if n.kind == nkEmpty: break
  156. sl.add n
  157. if sfReorder in module.flags or codeReordering in graph.config.features:
  158. sl = reorder(graph, sl, module)
  159. discard processTopLevelStmt(graph, sl, a)
  160. break
  161. elif n.kind in imperativeCode:
  162. # read everything until the next proc declaration etc.
  163. var sl = newNodeI(nkStmtList, n.info)
  164. sl.add n
  165. var rest: PNode = nil
  166. while true:
  167. var n = parseTopLevelStmt(p)
  168. if n.kind == nkEmpty or n.kind notin imperativeCode:
  169. rest = n
  170. break
  171. sl.add n
  172. #echo "-----\n", sl
  173. if not processTopLevelStmt(graph, sl, a): break
  174. if rest != nil:
  175. #echo "-----\n", rest
  176. if not processTopLevelStmt(graph, rest, a): break
  177. else:
  178. #echo "----- single\n", n
  179. if not processTopLevelStmt(graph, n, a): break
  180. closeParser(p)
  181. if s.kind != llsStdIn: break
  182. closePasses(graph, a)
  183. result = true