Lines Matching defs:Edge
32 struct Edge;
97 Edge* in_edge() const { return in_edge_; }
98 void set_in_edge(Edge* edge) { in_edge_ = edge; }
111 const std::vector<Edge*>& out_edges() const { return out_edges_; }
112 const std::vector<Edge*>& validation_out_edges() const { return validation_out_edges_; }
113 void AddOutEdge(Edge* edge) { out_edges_.push_back(edge); }
114 void AddValidationOutEdge(Edge* edge) { validation_out_edges_.push_back(edge); }
142 /// But note that Edge::outputs_ready_ is also used in judging which
157 /// The Edge that produces this Node, or NULL when there is no
159 Edge* in_edge_ = nullptr;
162 std::vector<Edge*> out_edges_;
165 std::vector<Edge*> validation_out_edges_;
172 struct Edge {
179 Edge()
268 bool operator()(const Edge* a, const Edge* b) const {
273 typedef std::set<Edge*, EdgeCmp> EdgeSet;
287 bool LoadDeps(Edge* edge, std::string* err);
296 virtual bool ProcessDepfileDeps(Edge* edge,
302 bool LoadDepFile(Edge* edge, const std::string& path, std::string* err);
306 bool LoadDepsFromLog(Edge* edge, std::string* err);
310 std::vector<Node*>::iterator PreallocateSpace(Edge* edge, int count);
341 bool RecomputeOutputsDirty(Edge* edge, Node* most_recent_input,
369 bool RecomputeOutputDirty(const Edge* edge, const Node* most_recent_input,