passes.nim 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  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 gCmdLineInfo = newLineInfo(FileIndex(0), 1, 1)
  84. let relativeTo = toFullPath(graph.config, m.info)
  85. for module in items(implicits):
  86. # implicit imports should not lead to a module importing itself
  87. if m.position != resolveMod(graph.config, module, relativeTo).int32:
  88. var importStmt = newNodeI(nodeKind, m.info)
  89. var str = newStrNode(nkStrLit, module)
  90. str.info = m.info
  91. importStmt.addSon str
  92. if not processTopLevelStmt(graph, importStmt, a): break
  93. const
  94. imperativeCode = {low(TNodeKind)..high(TNodeKind)} - {nkTemplateDef, nkProcDef, nkMethodDef,
  95. nkMacroDef, nkConverterDef, nkIteratorDef, nkFuncDef, nkPragma,
  96. nkExportStmt, nkExportExceptStmt, nkFromStmt, nkImportStmt, nkImportExceptStmt}
  97. proc processModule*(graph: ModuleGraph; module: PSym, stream: PLLStream): bool {.discardable.} =
  98. if graph.stopCompile(): return true
  99. var
  100. p: TParsers
  101. a: TPassContextArray
  102. s: PLLStream
  103. fileIdx = module.fileIdx
  104. if module.id < 0:
  105. # new module caching mechanism:
  106. for i in 0 ..< graph.passes.len:
  107. if not isNil(graph.passes[i].open) and not graph.passes[i].isFrontend:
  108. a[i] = graph.passes[i].open(graph, module)
  109. else:
  110. a[i] = nil
  111. if not graph.stopCompile():
  112. let n = loadNode(graph, module)
  113. var m = n
  114. for i in 0 ..< graph.passes.len:
  115. if not isNil(graph.passes[i].process) and not graph.passes[i].isFrontend:
  116. m = graph.passes[i].process(a[i], m)
  117. if isNil(m):
  118. break
  119. var m: PNode = nil
  120. for i in 0 ..< graph.passes.len:
  121. if not isNil(graph.passes[i].close) and not graph.passes[i].isFrontend:
  122. m = graph.passes[i].close(graph, a[i], m)
  123. a[i] = nil
  124. else:
  125. openPasses(graph, a, module)
  126. if stream == nil:
  127. let filename = toFullPathConsiderDirty(graph.config, fileIdx)
  128. s = llStreamOpen(filename, fmRead)
  129. if s == nil:
  130. rawMessage(graph.config, errCannotOpenFile, filename.string)
  131. return false
  132. else:
  133. s = stream
  134. while true:
  135. openParsers(p, fileIdx, s, graph.cache, graph.config)
  136. if module.owner == nil or module.owner.name.s != "stdlib" or module.name.s == "distros":
  137. # XXX what about caching? no processing then? what if I change the
  138. # modules to include between compilation runs? we'd need to track that
  139. # in ROD files. I think we should enable this feature only
  140. # for the interactive mode.
  141. if module.name.s != "nimscriptapi":
  142. processImplicits graph, graph.config.implicitImports, nkImportStmt, a, module
  143. processImplicits graph, graph.config.implicitIncludes, nkIncludeStmt, a, module
  144. while true:
  145. if graph.stopCompile(): break
  146. var n = parseTopLevelStmt(p)
  147. if n.kind == nkEmpty: break
  148. if (sfSystemModule notin module.flags and
  149. ({sfNoForward, sfReorder} * module.flags != {} or
  150. codeReordering in graph.config.features)):
  151. # read everything, no streaming possible
  152. var sl = newNodeI(nkStmtList, n.info)
  153. sl.add n
  154. while true:
  155. var n = parseTopLevelStmt(p)
  156. if n.kind == nkEmpty: break
  157. sl.add n
  158. if sfReorder in module.flags or codeReordering in graph.config.features:
  159. sl = reorder(graph, sl, module)
  160. discard processTopLevelStmt(graph, sl, a)
  161. break
  162. elif n.kind in imperativeCode:
  163. # read everything until the next proc declaration etc.
  164. var sl = newNodeI(nkStmtList, n.info)
  165. sl.add n
  166. var rest: PNode = nil
  167. while true:
  168. var n = parseTopLevelStmt(p)
  169. if n.kind == nkEmpty or n.kind notin imperativeCode:
  170. rest = n
  171. break
  172. sl.add n
  173. #echo "-----\n", sl
  174. if not processTopLevelStmt(graph, sl, a): break
  175. if rest != nil:
  176. #echo "-----\n", rest
  177. if not processTopLevelStmt(graph, rest, a): break
  178. else:
  179. #echo "----- single\n", n
  180. if not processTopLevelStmt(graph, n, a): break
  181. closeParsers(p)
  182. if s.kind != llsStdIn: break
  183. closePasses(graph, a)
  184. # id synchronization point for more consistent code generation:
  185. idSynchronizationPoint(1000)
  186. result = true