Home
last modified time | relevance | path

Searched refs:want_e (Results 1 - 2 of 2) sorted by relevance

/third_party/ninja/src/
H A Dbuild.cc171 void Plan::ScheduleWork(map<Edge*, Want>::iterator want_e) { in ScheduleWork() argument
172 if (want_e->second == kWantToFinish) { in ScheduleWork()
179 assert(want_e->second == kWantToStart); in ScheduleWork()
180 want_e->second = kWantToFinish; in ScheduleWork()
182 Edge* edge = want_e->first; in ScheduleWork()
233 map<Edge*, Want>::iterator want_e = want_.find(*oe); in NodeFinished() local
234 if (want_e == want_.end()) in NodeFinished()
238 if (!EdgeMaybeReady(want_e, err)) in NodeFinished()
244 bool Plan::EdgeMaybeReady(map<Edge*, Want>::iterator want_e, string* err) { in EdgeMaybeReady() argument
245 Edge* edge = want_e in EdgeMaybeReady()
265 map<Edge*, Want>::iterator want_e = want_.find(*oe); CleanNode() local
340 map<Edge*, Want>::iterator want_e = want_.find(edge); DyndepsLoaded() local
368 map<Edge*, Want>::iterator want_e = want_.find(*oe); DyndepsLoaded() local
377 map<Edge*, Want>::iterator want_e = want_.find(*wi); DyndepsLoaded() local
424 map<Edge*, Want>::iterator want_e = want_.find(edge); RefreshDyndepDependents() local
439 map<Edge*, Want>::iterator want_e = want_.find(edge); UnmarkDependents() local
[all...]
H A Dbuild.h111 bool EdgeMaybeReady(std::map<Edge*, Want>::iterator want_e, std::string* err);
116 void ScheduleWork(std::map<Edge*, Want>::iterator want_e);

Completed in 2 milliseconds