passes.nim 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209
  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. strutils, options, ast, astalgo, llstream, msgs, platform, os,
  13. condsyms, idents, renderer, types, extccomp, math, magicsys, nversion,
  14. nimsets, syntaxes, times, 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.addSon 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 processModule*(graph: ModuleGraph; module: PSym, stream: PLLStream): bool {.discardable.} =
  97. if graph.stopCompile(): return true
  98. var
  99. p: TParsers
  100. a: TPassContextArray
  101. s: PLLStream
  102. fileIdx = module.fileIdx
  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)
  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)
  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. openParsers(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. closeParsers(p)
  181. if s.kind != llsStdIn: break
  182. closePasses(graph, a)
  183. # id synchronization point for more consistent code generation:
  184. idSynchronizationPoint(1000)
  185. result = true