JS DCE: use less LinkedHashSets

This commit is contained in:
Anton Bannykh
2021-01-28 14:05:09 +03:00
parent 3c0b226344
commit bbc6d2b993
6 changed files with 44 additions and 17 deletions
@@ -78,11 +78,10 @@ class K2JSDce : CLITool<K2JSDceArguments>() {
val dceResult = DeadCodeElimination.run(files, includedDeclarations, logConsumer)
if (dceResult.status == DeadCodeEliminationStatus.FAILED) return ExitCode.COMPILATION_ERROR
val nodes = dceResult.reachableNodes.filterTo(mutableSetOf()) { it.reachable }
val reachabilitySeverity = if (arguments.printReachabilityInfo) CompilerMessageSeverity.INFO else CompilerMessageSeverity.LOGGING
messageCollector.report(reachabilitySeverity, "")
for (node in nodes.extractRoots()) {
for (node in dceResult.reachableNodes.extractReachableRoots(dceResult.context!!)) {
printTree(
node, { messageCollector.report(reachabilitySeverity, it) },
printNestedMembers = false, showLocations = true