6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-13 20:32:21 +00:00
Code Issues Projects Releases Wiki Activity

Add some comments.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@63364 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Mikhail Glushenkov 2009-01-30 02:12:57 +00:00
parent 072e99ef9b
commit 7ba6052852
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
tools/llvmc/driver/CompilationGraph.cpp
View File

@ -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;