From 73d866efda92d25b74611f6c0348c8f8d9824e93 Mon Sep 17 00:00:00 2001 From: Mikhail Glushenkov Date: Tue, 6 May 2008 18:07:48 +0000 Subject: Utilize topological sort in CompilationGraph::Build(). This makes more interesting graph topologies possible. Currently all tests pass, but more testing is needed. llvm-svn: 50744 --- llvm/tools/llvmc2/llvmc.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'llvm/tools/llvmc2/llvmc.cpp') diff --git a/llvm/tools/llvmc2/llvmc.cpp b/llvm/tools/llvmc2/llvmc.cpp index aeb8b331b40..87c0e41cdca 100644 --- a/llvm/tools/llvmc2/llvmc.cpp +++ b/llvm/tools/llvmc2/llvmc.cpp @@ -38,7 +38,7 @@ cl::opt OutputFilename("o", cl::desc("Output file name"), cl::opt VerboseMode("v", cl::desc("Enable verbose mode")); cl::opt WriteGraph("write-graph", - cl::desc("Write CompilationGraph.dot file"), + cl::desc("Write compilation-graph.dot file"), cl::Hidden); cl::opt ViewGraph("view-graph", cl::desc("Show compilation graph in GhostView"), @@ -72,7 +72,8 @@ int main(int argc, char** argv) { if (WriteGraph) { graph.writeGraph(); - return 0; + if (!ViewGraph) + return 0; } if (ViewGraph) { @@ -80,7 +81,6 @@ int main(int argc, char** argv) { return 0; } - if (InputFilenames.empty()) { std::cerr << "No input files.\n"; return 1; -- cgit v1.2.3