Home
last modified time | relevance | path

Searched refs:graph_utils (Results 1 – 8 of 8) sorted by relevance

/system/update_engine/payload_generator/
Dgraph_utils_unittest.cc56 EXPECT_EQ(4U, graph_utils::EdgeWeight(graph, make_pair(0, 1))); in TEST()
63 graph_utils::AddReadBeforeDep(&graph[0], 1, 3); in TEST()
70 graph_utils::AddReadBeforeDep(&graph[0], 1, 4); in TEST()
77 graph_utils::AddReadBeforeDepExtents(&graph[2], 1, in TEST()
87 graph_utils::DropWriteBeforeDeps(&graph[2].out_edges); in TEST()
91 graph_utils::DropIncomingEdgesTo(&graph, 1); in TEST()
Dgraph_utils.h31 namespace graph_utils {
Dinplace_generator.cc152 scratch_blocks_used += graph_utils::EdgeWeight(*graph, edge); in CutEdges()
154 scratch_allocator.Allocate(graph_utils::EdgeWeight(*graph, edge)); in CutEdges()
181 graph_utils::EdgeWeight(*graph, edge) * kBlockSize); in CutEdges()
446 graph_utils::AddReadBeforeDepExtents( in AssignBlockForAdjoiningCuts()
562 graph_utils::DropWriteBeforeDeps(&out_edges); in ConvertCutToFullOp()
588 graph_utils::DropIncomingEdgesTo(graph, cut.old_dst); in ConvertCutToFullOp()
652 graph_utils::DumpGraph(*graph); in ConvertGraphToDag()
Dgraph_utils.cc36 namespace graph_utils { namespace
Dcycle_breaker.cc120 uint64_t edge_weight = graph_utils::EdgeWeight(subgraph_, edge); in HandleCircuit()
Dinplace_generator_unittest.cc468 graph_utils::DumpGraph(graph); in TEST_F()
/system/update_engine/
Dupdate_engine.gyp392 'payload_generator/graph_utils.cc',
DAndroid.mk577 payload_generator/graph_utils.cc \