Add some comments.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@63364 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/tools/llvmc/driver/CompilationGraph.cpp b/tools/llvmc/driver/CompilationGraph.cpp
index 2c59ee6314c0975eee6a3b2fed9285b76c28fbed..238ef6f42a78691f2222e6fbe0c088196450bdac 100644 (file)
--- a/tools/llvmc/driver/CompilationGraph.cpp
+++ b/tools/llvmc/driver/CompilationGraph.cpp
@@ -390,6 +390,8 @@ int CompilationGraph::CheckMultipleDefaultEdges() const {
   int ret = 0;
   InputLanguagesSet Dummy;
 
+  // For all nodes, just iterate over the outgoing edges and check if there is
+  // more than one edge with maximum weight.
   for (const_nodes_iterator B = this->NodesMap.begin(),
          E = this->NodesMap.end(); B != E; ++B) {
     const Node& N = B->second;
@@ -423,6 +425,9 @@ int CompilationGraph::CheckCycles() {
   std::queue<Node*> Q;
   Q.push(&getNode("root"));
 
+  // Try to delete all nodes that have no ingoing edges, starting from the
+  // root. If there are any nodes left after this operation, then we have a
+  // cycle. This relies on '--check-graph' not performing the topological sort.
   while (!Q.empty()) {
     Node* A = Q.front();
     Q.pop();
@@ -447,7 +452,6 @@ int CompilationGraph::CheckCycles() {
   return 0;
 }
 
-
 int CompilationGraph::Check () {
   // We try to catch as many errors as we can in one go.
   int ret = 0;