Lines Matching refs:want_
90 want_.clear();
119 // If an entry in want_ does not already exist for edge, create an entry which
122 want_.insert(make_pair(edge, kWantNothing));
194 map<Edge*, Want>::iterator e = want_.find(edge);
195 assert(e != want_.end());
209 want_.erase(e);
233 map<Edge*, Want>::iterator want_e = want_.find(*oe);
234 if (want_e == want_.end())
265 map<Edge*, Want>::iterator want_e = want_.find(*oe);
266 if (want_e == want_.end() || 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())
377 map<Edge*, Want>::iterator want_e = want_.find(*wi);
378 if (want_e == want_.end())
424 map<Edge*, Want>::iterator want_e = want_.find(edge);
425 assert(want_e != want_.end());
439 map<Edge*, Want>::iterator want_e = want_.find(edge);
440 if (want_e == want_.end())
455 printf("pending: %d\n", (int)want_.size());
456 for (map<Edge*, Want>::const_iterator e = want_.begin(); e != want_.end(); ++e) {