Lines Matching refs:edge
98 void set_in_edge(Edge* edge) { in_edge_ = edge; }
113 void AddOutEdge(Edge* edge) { out_edges_.push_back(edge); }
114 void AddValidationOutEdge(Edge* edge) { validation_out_edges_.push_back(edge); }
151 /// deps log. If it does not have a producing edge, the build should not
158 /// known edge to produce it.
171 /// An edge in the dependency graph; links between Nodes using Rules.
207 // Append all edge explicit inputs to |*out|. Possibly with shell escaping.
262 // Historical info: how long did this edge take last time,
284 /// Load implicit dependencies for \a edge.
287 bool LoadDeps(Edge* edge, std::string* err);
294 /// Process loaded implicit dependencies for \a edge and update the graph
296 virtual bool ProcessDepfileDeps(Edge* edge,
300 /// Load implicit dependencies for \a edge from a depfile attribute.
302 bool LoadDepFile(Edge* edge, const std::string& path, std::string* err);
304 /// Load implicit dependencies for \a edge from the DepsLog.
306 bool LoadDepsFromLog(Edge* edge, std::string* err);
308 /// Preallocate \a count spaces in the input array on \a edge, returning
310 std::vector<Node*>::iterator PreallocateSpace(Edge* edge, int count);
332 /// Examine inputs, outputs, and command lines to judge whether an edge
339 /// Recompute whether any output of the edge is dirty, if so sets |*dirty|.
341 bool RecomputeOutputsDirty(Edge* edge, Node* most_recent_input,
369 bool RecomputeOutputDirty(const Edge* edge, const Node* most_recent_input,