Lines Matching defs:edges
164 // Test that two edges from one output can both execute.
293 deque<Edge*> edges;
294 FindWorkSorted(&edges, 5);
297 Edge *edge = edges[i];
304 Edge* edge = edges[4];
310 plan_.EdgeFinished(edges.front(), Plan::kEdgeSucceeded, &err);
312 edges.pop_front();
327 for (deque<Edge*>::iterator it = edges.begin(); it != edges.end(); ++it) {
680 // All active edges were already completed immediately when started,
682 // control the order of edges by the name of the first output.
731 // covering behavior involving multiple active edges.
994 // added nodes, but not phony edges to the graph.
1250 // 2. Edge is marked as dirty, causing dependent edges to always rebuild
1255 // 5. Edge is marked as dirty, causing dependent edges to always rebuild
3002 // not generate new edges.
3968 // correspond to implicit outputs added to other edges by other dyndep