Lines Matching refs:want_e
171 void Plan::ScheduleWork(map<Edge*, Want>::iterator want_e) {
172 if (want_e->second == kWantToFinish) {
179 assert(want_e->second == kWantToStart);
180 want_e->second = kWantToFinish;
182 Edge* edge = want_e->first;
233 map<Edge*, Want>::iterator want_e = want_.find(*oe);
234 if (want_e == want_.end())
238 if (!EdgeMaybeReady(want_e, err))
244 bool Plan::EdgeMaybeReady(map<Edge*, Want>::iterator want_e, string* err) {
245 Edge* edge = want_e->first;
247 if (want_e->second != kWantNothing) {
248 ScheduleWork(want_e);
265 map<Edge*, Want>::iterator want_e = want_.find(*oe);
266 if (want_e == want_.end() || want_e->second == kWantNothing)
306 want_e->second = kWantNothing;
340 map<Edge*, Want>::iterator want_e = want_.find(edge);
344 if (want_e == want_.end())
368 map<Edge*, Want>::iterator want_e = want_.find(*oe);
369 if (want_e == want_.end())
371 dyndep_walk.insert(want_e->first);
377 map<Edge*, Want>::iterator want_e = want_.find(*wi);
378 if (want_e == want_.end())
380 if (!EdgeMaybeReady(want_e, err))
424 map<Edge*, Want>::iterator want_e = want_.find(edge);
425 assert(want_e != want_.end());
426 if (want_e->second == kWantNothing) {
427 want_e->second = kWantToStart;
439 map<Edge*, Want>::iterator want_e = want_.find(edge);
440 if (want_e == want_.end())