Home
last modified time | relevance | path

Searched refs:in_edge (Results 1 - 17 of 17) sorted by relevance

/third_party/ninja/src/
H A Dgraph_test.cc110 Edge* edge = GetNode("out")->in_edge(); in TEST_F()
115 EXPECT_EQ(edge, GetNode("out.imp")->in_edge()); in TEST_F()
152 Edge* edge = GetNode("out.imp")->in_edge(); in TEST_F()
156 EXPECT_EQ(edge, GetNode("out.imp")->in_edge()); in TEST_F()
224 Edge* edge = GetNode("out 1")->in_edge(); in TEST_F()
255 Edge* edge = GetNode("a b")->in_edge(); in TEST_F()
315 Edge* edge = GetNode("out")->in_edge(); in TEST_F()
327 Edge* edge = GetNode("out")->in_edge(); in TEST_F()
339 Edge* edge = GetNode("out")->in_edge(); in TEST_F()
440 Edge* edge = GetNode("a")->in_edge(); in TEST_F()
[all...]
H A Dgraph.cc85 Edge* edge = node->in_edge(); in RecomputeNodeDirty()
131 if (!edge->dyndep_->in_edge() || in RecomputeNodeDirty()
132 edge->dyndep_->in_edge()->outputs_ready()) { in RecomputeNodeDirty()
176 if (Edge* in_edge = (*i)->in_edge()) { in RecomputeNodeDirty()
177 if (!in_edge->outputs_ready_) in RecomputeNodeDirty()
226 Edge* edge = node->in_edge(); in VerifyDAG()
235 while (start != stack->end() && (*start)->in_edge() != edge) in VerifyDAG()
375 if ((*i)->in_edge() && !(*i)->in_edge() in AllInputsReady()
[all...]
H A Dmanifest_parser_test.cc89 Edge* edge = state.GetNode("result", 0)->in_edge(); in TEST_F()
394 Edge* edge = node->in_edge(); in TEST_F()
409 Edge* edge = node->in_edge(); in TEST_F()
955 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F()
964 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F()
973 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F()
984 Edge* edge = state.LookupNode("imp")->in_edge(); in TEST_F()
995 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F()
1006 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F()
1019 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F()
[all...]
H A Dmissing_deps.cc81 Edge* edge = node->in_edge(); in ProcessNode()
111 Edge* edge = node->in_edge(); in ProcessNodeDeps()
123 Edge* deplog_edge = deplog_node->in_edge(); in ProcessNodeDeps()
141 if (dep_nodes[i]->in_edge() == *ne) { in ProcessNodeDeps()
184 Edge* e = to->inputs_[i]->in_edge(); in PathExistsBetween()
H A Dtest.cc128 EXPECT_EQ((*out_node)->in_edge(), *e); in VerifyGraph()
137 if (n->in_edge()) in VerifyGraph()
138 node_edge_set.insert(n->in_edge()); in VerifyGraph()
H A Dninja.cc172 if (n && n->in_edge()) in IsPathDead()
412 if (Edge* edge = node->in_edge()) { in ToolQuery()
488 if ((*n)->in_edge()) { in ToolTargetsList()
489 printf("%s: %s\n", target, (*n)->in_edge()->rule_->name().c_str()); in ToolTargetsList()
491 ToolTargetsList((*n)->in_edge()->inputs_, depth - 1, indent + 1); in ToolTargetsList()
504 if (!(*inps)->in_edge()) in ToolTargetsSourceList()
718 PrintCommands((*in)->in_edge(), seen, mode); in PrintCommands()
762 PrintCommands((*in)->in_edge(), &seen, mode); in ToolCommands()
776 CollectInputs((*in)->in_edge(), seen, result); in CollectInputs()
821 CollectInputs((*in)->in_edge(), in ToolInputs()
[all...]
H A Dbuild.cc99 Edge* edge = node->in_edge(); in AddSubTarget()
409 if (Edge* in_edge = (*v)->in_edge()) { in RefreshDyndepDependents()
410 if (!in_edge->outputs_ready() && in RefreshDyndepDependents()
422 Edge* edge = n->in_edge(); in RefreshDyndepDependents()
609 Edge* in_edge = target->in_edge(); in AddTarget()
610 if (!in_edge || !in_edge->outputs_ready()) { in AddTarget()
620 if (Edge* validation_in_edge = (*n)->in_edge()) { in AddTarget()
[all...]
H A Ddyndep_parser.cc123 if (!node || !node->in_edge()) in ParseEdge()
125 Edge* edge = node->in_edge(); in ParseEdge()
H A Dgraphviz.cc34 Edge* edge = node->in_edge(); in AddTarget()
H A Dclean.cc142 if (!n || (!n->in_edge() && n->out_edges().empty())) { in CleanDead()
151 if (Edge* e = target->in_edge()) { in DoCleanTarget()
H A Ddeps_log.cc371 return node->in_edge() && !node->in_edge()->GetBinding("deps").empty();
H A Ddyndep.cc100 if ((*i)->in_edge()) { in UpdateEdge()
H A Dmissing_deps_test.cc74 Edge* from_edge = from_node->in_edge(); in CreateGraphDependencyBetween()
H A Dstate.cc138 if (node->in_edge()) { in AddOut()
H A Dgraph.h97 Edge* in_edge() const { return in_edge_; } in in_edge() function
H A Dbuild_test.cc763 if (!node->in_edge()) in Dirty()
3707 ASSERT_FALSE(GetNode("tmp.imp")->in_edge()); in TEST_F()
3713 ASSERT_FALSE(GetNode("tmp.imp")->in_edge()->is_phony()); in TEST_F()
/third_party/rust/crates/memchr/bench/data/code/
H A Drust-library.rs29970 let mut in_edge = leaf.first_edge(); in clone() variables
29971 while let Ok(kv) = in_edge.right_kv() { in clone()
29973 in_edge = kv.right_edge(); in clone()
29988 let mut in_edge = internal.first_edge(); in clone() variables
29989 while let Ok(kv) = in_edge.right_kv() { in clone()
29991 in_edge = kv.right_edge(); in clone()
29995 let subtree = clone_subtree(in_edge.descend()); in clone()
[all...]

Completed in 59 milliseconds