| /system/update_engine/payload_generator/ |
| D | inplace_generator.h | 72 static void CheckGraph(const Graph& graph);
93 static bool CutEdges(Graph* graph,
100 static void CreateEdges(Graph* graph, const std::vector<Block>& blocks);
117 static void MoveAndSortFullOpsToBack(Graph* graph,
122 static bool NoTempBlocksRemain(const Graph& graph);
132 Graph* graph,
146 static bool ConvertCutToFullOp(Graph* graph,
160 static bool ConvertGraphToDag(Graph* graph,
182 const Graph& graph,
191 static bool AddInstallOpToGraph(Graph* graph,
|
| D | graph_utils.h | 34 uint64_t EdgeWeight(const Graph& graph, const Edge& edge);
46 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index);
48 void DumpGraph(const Graph& graph);
|
| D | cycle_breaker.h | 46 void BreakCycles(const Graph& graph, std::set<Edge>* out_cut_edges);
59 Graph subgraph_; // "A_K" in the paper
60 Graph blocked_graph_; // "B" in the paper
|
| D | cycle_breaker_unittest.cc | 39 void SetOpForNodes(Graph* graph) { in SetOpForNodes()
58 const Graph::size_type kNodeCount = counter++; in TEST()
60 Graph graph(kNodeCount); in TEST()
134 Graph graph(kGroups * kNodesPerGroup + 1); // + 1 for the root node in TEST()
191 const Graph::size_type kNodeCount = counter++; in TEST()
193 Graph graph(kNodeCount); in TEST()
234 const Graph::size_type kNodeCount = counter++; in TEST()
236 Graph graph(kNodeCount); in TEST()
261 const Graph::size_type kNodeCount = counter++; in TEST()
263 Graph graph(kNodeCount); in TEST()
|
| D | graph_utils.cc | 38 uint64_t EdgeWeight(const Graph& graph, const Edge& edge) { in EdgeWeight()
95 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index) { in DropIncomingEdgesTo()
98 for (Graph::iterator it = graph->begin(), e = graph->end(); it != e; ++it) { in DropIncomingEdgesTo()
126 void DumpGraph(const Graph& graph) { in DumpGraph()
128 for (Graph::size_type i = 0, e = graph.size(); i != e; ++i) { in DumpGraph()
|
| D | tarjan.h | 39 Graph* graph,
43 void Tarjan(Vertex::Index vertex, Graph* graph);
|
| D | tarjan.cc | 34 Graph* graph, in Execute()
39 for (Graph::iterator it = graph->begin(); it != graph->end(); ++it) in Execute()
48 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) { in Tarjan()
|
| D | topological_sort.cc | 30 void TopologicalSortVisit(const Graph& graph, in TopologicalSortVisit()
49 void TopologicalSort(const Graph& graph, vector<Vertex::Index>* out) { in TopologicalSort()
|
| D | inplace_generator.cc | 88 explicit IndexedInstallOperationsDstComparator(Graph* graph) in IndexedInstallOperationsDstComparator()
98 const Graph* const graph_;
103 void InplaceGenerator::CheckGraph(const Graph& graph) { in CheckGraph()
139 bool InplaceGenerator::CutEdges(Graph* graph, in CutEdges()
190 CHECK_EQ(static_cast<Graph::size_type>(1), in CutEdges()
206 void InplaceGenerator::CreateEdges(Graph* graph, const vector<Block>& blocks) { in CreateEdges()
271 Graph* graph, vector<Vertex::Index>* op_indexes) { in MoveAndSortFullOpsToBack()
319 Graph* graph, in ConvertCutsToFull()
354 Graph* graph, in AssignBlockForAdjoiningCuts()
468 Graph* graph, in AssignTempBlocks()
[all …]
|
| D | topological_sort.h | 38 void TopologicalSort(const Graph& graph, std::vector<Vertex::Index>* out);
|
| D | graph_utils_unittest.cc | 36 Graph graph(2); in TEST()
60 Graph graph(3); in TEST()
|
| D | cycle_breaker.cc | 40 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) { in BreakCycles()
58 for (Graph::size_type i = 0; i < subgraph_.size(); i++) { in BreakCycles()
70 for (Graph::size_type j = i; j < subgraph_.size(); j++) { in BreakCycles()
|
| D | topological_sort_unittest.cc | 64 const Graph::size_type kNodeCount = counter++; in TEST()
66 Graph graph(kNodeCount); in TEST()
|
| D | tarjan_unittest.cc | 45 const Graph::size_type kNodeCount = 8; in TEST()
47 Graph graph(kNodeCount); in TEST()
|
| D | graph_types.h | 78 typedef std::vector<Vertex> Graph; typedef
|
| D | inplace_generator_unittest.cc | 186 Graph graph; in TEST_F()
301 Graph graph(9); in TEST_F()
406 Graph graph(4); in TEST_F()
430 Graph graph(9); in TEST_F()
492 Graph expected_graph(12); in TEST_F()
565 for (Graph::size_type i = 0; i < graph.size() - 1; i++) { in TEST_F()
|
| /system/core/libmemunreachable/ |
| D | Tarjan.h | 58 using Graph = allocator::vector<Node<T>*>; variable
72 void Execute(Graph<T>& graph, SCCList<T>& out);
76 void Tarjan(Node<T>* vertex, Graph<T>& graph);
84 void TarjanAlgorithm<T>::Execute(Graph<T>& graph, SCCList<T>& out) { in Execute()
102 void TarjanAlgorithm<T>::Tarjan(Node<T>* vertex, Graph<T>& graph) { in Tarjan()
131 void Tarjan(Graph<T>& graph, SCCList<T>& out) { in Tarjan()
|
| D | LeakFolding.h | 94 Graph<LeakInfo> leak_graph_;
|
| /system/tools/hidl/test/hidl_test/ |
| D | hidl_test_client.cpp | 2571 IGraph::Graph g; in TEST_F()
2589 IGraph::Graph g; in TEST_F()
|