| 1541 | } |
| 1542 | |
| 1543 | void cmComputeLinkDepends::VisitComponent(size_t c) |
| 1544 | { |
| 1545 | // Check if the node has already been visited. |
| 1546 | if (this->ComponentVisited[c]) { |
| 1547 | return; |
| 1548 | } |
| 1549 | |
| 1550 | // We are now visiting this component so mark it. |
| 1551 | this->ComponentVisited[c] = 1; |
| 1552 | |
| 1553 | // Visit the neighbors of the component first. |
| 1554 | // Run in reverse order so the topological order will preserve the |
| 1555 | // original order where there are no constraints. |
| 1556 | EdgeList const& nl = this->CCG->GetComponentGraphEdges(c); |
| 1557 | for (cmGraphEdge const& edge : cmReverseRange(nl)) { |
| 1558 | this->VisitComponent(edge); |
| 1559 | } |
| 1560 | |
| 1561 | // Assign an ordering id to this component. |
| 1562 | this->ComponentOrder[c] = --this->ComponentOrderId; |
| 1563 | } |
| 1564 | |
| 1565 | void cmComputeLinkDepends::VisitEntry(size_t index) |
| 1566 | { |
no test coverage detected