Lines Matching refs:end
68 nodes.insert(nodes.end(), new_validation_nodes.begin(),
69 new_validation_nodes.end());
73 validation_nodes->insert(validation_nodes->end(),
75 new_validation_nodes.end());
142 o != edge->outputs_.end(); ++o) {
164 validation_nodes->insert(validation_nodes->end(),
165 edge->validations_.begin(), edge->validations_.end());
170 i != edge->inputs_.end(); ++i) {
203 o != edge->outputs_.end(); ++o) {
235 while (start != stack->end() && (*start)->in_edge() != edge)
237 assert(start != stack->end());
239 // Make the cycle clear by reporting its start as the node at its end
249 for (vector<Node*>::const_iterator i = start; i != stack->end(); ++i) {
255 if ((start + 1) == stack->end() && edge->maybe_phonycycle_diagnostic()) {
268 o != edge->outputs_.end(); ++o) {
374 i != inputs_.end(); ++i) {
445 auto it = std::find(lookups_.begin(), lookups_.end(), var);
446 if (it != lookups_.end()) {
448 for (; it != lookups_.end(); ++it)
493 it != inputs_.end(); ++it) {
549 i != inputs_.end() && *i != NULL; ++i) {
554 i != outputs_.end() && *i != NULL; ++i) {
560 i != validations_.end() && *i != NULL; ++i) {
617 e != out_edges().end() && *e != NULL; ++e) {
623 e != validation_out_edges().end() && *e != NULL; ++e) {
705 o != depfile.outs_.end(); ++o) {
707 if (std::find_if(edge->outputs_.begin(), edge->outputs_.end(), m) == edge->outputs_.end()) {
724 i != depfile_ins->end(); ++i, ++implicit_dep) {
763 edge->inputs_.insert(edge->inputs_.end() - edge->order_only_deps_,
766 return edge->inputs_.end() - edge->order_only_deps_ - count;