| /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,
119 static void MoveAndSortFullOpsToBack(Graph* graph,
124 static bool NoTempBlocksRemain(const Graph& graph);
134 Graph* graph,
148 static bool ConvertCutToFullOp(Graph* graph,
162 static bool ConvertGraphToDag(Graph* graph,
184 const Graph& graph,
193 static bool AddInstallOpToGraph(Graph* graph,
|
| D | graph_utils.h | 34 uint64_t EdgeWeight(const Graph& graph, const Edge& edge);
48 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index);
50 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()
135 Graph graph(kGroups * kNodesPerGroup + 1); // + 1 for the root node in TEST()
190 const Graph::size_type kNodeCount = counter++; in TEST()
192 Graph graph(kNodeCount); in TEST()
233 const Graph::size_type kNodeCount = counter++; in TEST()
235 Graph graph(kNodeCount); in TEST()
260 const Graph::size_type kNodeCount = counter++; in TEST()
262 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()
124 void DumpGraph(const Graph& graph) { in DumpGraph()
126 for (Graph::size_type i = 0, e = graph.size(); i != e; ++i) { in DumpGraph()
|
| D | tarjan.h | 39 Graph* graph,
42 void Tarjan(Vertex::Index vertex, Graph* graph);
|
| D | tarjan.cc | 35 Graph* graph, in Execute()
40 for (Graph::iterator it = graph->begin(); it != graph->end(); ++it) in Execute()
49 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) { in Tarjan()
|
| D | topological_sort.cc | 30 void TopologicalSortVisit(const Graph& graph, in TopologicalSortVisit()
48 void TopologicalSort(const Graph& graph, vector<Vertex::Index>* out) { in TopologicalSort()
|
| D | inplace_generator.cc | 86 explicit IndexedInstallOperationsDstComparator(Graph* graph) in IndexedInstallOperationsDstComparator()
96 const Graph* const graph_;
101 void InplaceGenerator::CheckGraph(const Graph& graph) { in CheckGraph()
139 bool InplaceGenerator::CutEdges(Graph* graph, in CutEdges()
191 CHECK_EQ(static_cast<Graph::size_type>(1), in CutEdges()
208 Graph* graph, in CreateEdges()
275 Graph* graph, in MoveAndSortFullOpsToBack()
324 Graph* graph, in ConvertCutsToFull()
362 Graph* graph, in AssignBlockForAdjoiningCuts()
478 Graph* graph, in AssignTempBlocks()
[all …]
|
| D | graph_utils_unittest.cc | 36 Graph graph(2); in TEST()
61 Graph graph(3); in TEST()
|
| D | topological_sort.h | 38 void TopologicalSort(const Graph& graph, std::vector<Vertex::Index>* out);
|
| D | cycle_breaker.cc | 39 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) { in BreakCycles()
57 for (Graph::size_type i = 0; i < subgraph_.size(); i++) { in BreakCycles()
69 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 | 81 typedef std::vector<Vertex> Graph; typedef
|
| D | inplace_generator_unittest.cc | 184 Graph graph; in TEST_F()
299 Graph graph(9); in TEST_F()
404 Graph graph(4); in TEST_F()
428 Graph graph(9); in TEST_F()
490 Graph expected_graph(12); in TEST_F()
563 for (Graph::size_type i = 0; i < graph.size() - 1; i++) { in TEST_F()
|
| /system/core/libmemunreachable/ |
| D | Tarjan.h | 55 using Graph = allocator::vector<Node<T>*>; variable
69 void Execute(Graph<T>& graph, SCCList<T>& out);
72 void Tarjan(Node<T>* vertex, Graph<T>& graph);
80 void TarjanAlgorithm<T>::Execute(Graph<T>& graph, SCCList<T>& out) { in Execute()
98 void TarjanAlgorithm<T>::Tarjan(Node<T>* vertex, Graph<T>& graph) { in Tarjan()
127 void Tarjan(Graph<T>& graph, SCCList<T>& out) { in Tarjan()
|
| D | LeakFolding.h | 85 Graph<LeakInfo> leak_graph_;
|
| /system/tools/hidl/test/ |
| D | hidl_test_client.cpp | 1591 IGraph::Graph g; in TEST_F()
1609 IGraph::Graph g; in TEST_F()
|