graph.cc - OpenGrok cross reference for /third

Lines Matching defs:node
60         Node* node = nodes.front();

66         if (!RecomputeNodeDirty(node, &stack, &new_validation_nodes, err))

82 bool DependencyScan::RecomputeNodeDirty(Node* node, std::vector<Node*>* stack,

85     Edge* edge = node->in_edge();

87         // If we already visited this leaf node then we are done.

88         if (node->status_known())

90         // This node has no in-edge; it is dirty if it is missing.

91         if (!node->StatIfNecessary(disk_interface_, err))

93         if (!node->exists())

94             EXPLAIN("%s has no in-edge and is missing", node->path().c_str());

95         node->set_dirty(!node->exists());

104     if (!VerifyDAG(node, stack, err))

109     stack->push_back(node);

161     // cycle detector if the validation node depends on this node.

219     assert(stack->back() == node);

225 bool DependencyScan::VerifyDAG(Node* node, vector<Node*>* stack, string* err) {

226     Edge* edge = node->in_edge();

239     // Make the cycle clear by reporting its start as the node at its end

245     *start = node;

291         // on the fake node and get the latest mtime of the dependencies

363 bool DependencyScan::LoadDyndeps(Node* node, string* err) const {

364     return dyndep_loader_.LoadDyndeps(node, err);

367 bool DependencyScan::LoadDyndeps(Node* node, DyndepFile* ddf,

369     return dyndep_loader_.LoadDyndeps(node, ddf, err);

424     // Each variable definition can be seen as a node in a graph that looks

436     // during recursive expansion. Entering a node adds an item to the

437     // stack, leaving the node removes it.

440     // to never record the starting node in the stack when beginning a new

645     bool operator()(const Node* node) const {

646         StringPiece opath = StringPiece(node->path());

727         Node* node = state_->GetNode(*i, slash_bits);

728         *implicit_dep = node;

729         node->AddOutEdge(edge);

754         Node* node = deps->nodes[i];

755         *implicit_dep = node;

756         node->AddOutEdge(edge);