Lines Matching defs:dependents
251 // its dependents.
321 // Recompute the dirty state of all our direct and indirect dependents now
389 // Collect the transitive closure of dependents and mark their edges
391 set<Node*> dependents;
392 UnmarkDependents(node, &dependents);
394 // Update the dirty state of all dependents and check if their edges
396 for (set<Node*>::iterator i = dependents.begin();
397 i != dependents.end(); ++i) {
434 void Plan::UnmarkDependents(const Node* node, set<Node*>* dependents) {
447 if (dependents->insert(*o).second)
448 UnmarkDependents(*o, dependents);