Searched defs:graph (Results 1 – 12 of 12) sorted by relevance
| /system/update_engine/payload_generator/ |
| D | inplace_generator.cc | 86 explicit IndexedInstallOperationsDstComparator(Graph* graph) in IndexedInstallOperationsDstComparator()
101 void InplaceGenerator::CheckGraph(const Graph& graph) { in CheckGraph()
139 bool InplaceGenerator::CutEdges(Graph* graph, 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()
525 bool InplaceGenerator::NoTempBlocksRemain(const Graph& graph) { in NoTempBlocksRemain()
552 bool InplaceGenerator::ConvertCutToFullOp(Graph* graph, in ConvertCutToFullOp()
[all …]
|
| 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 | graph_utils_unittest.cc | 36 Graph graph(2); in TEST() local
61 Graph graph(3); in TEST() local
|
| D | tarjan.cc | 35 Graph* graph, in Execute()
49 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) { in Tarjan()
|
| D | cycle_breaker_unittest.cc | 39 void SetOpForNodes(Graph* graph) { in SetOpForNodes()
60 Graph graph(kNodeCount); in TEST() local
135 Graph graph(kGroups * kNodesPerGroup + 1); // + 1 for the root node in TEST() local
192 Graph graph(kNodeCount); in TEST() local
235 Graph graph(kNodeCount); in TEST() local
262 Graph graph(kNodeCount); in TEST() local
|
| 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()
124 void DumpGraph(const Graph& graph) { in DumpGraph()
|
| D | inplace_generator_unittest.cc | 184 Graph graph; in TEST_F() local
299 Graph graph(9); in TEST_F() local
404 Graph graph(4); in TEST_F() local
428 Graph graph(9); in TEST_F() local
|
| D | tarjan_unittest.cc | 47 Graph graph(kNodeCount); in TEST() local
|
| D | topological_sort_unittest.cc | 66 Graph graph(kNodeCount); in TEST() local
|
| D | cycle_breaker.cc | 39 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) { in BreakCycles()
|
| /system/core/libmemunreachable/ |
| D | Tarjan.h | 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()
|
| /system/extras/simpleperf/ |
| D | README.md | 695 #### Record dwarf based call graph
710 #### Record stack frame based call graph
728 #### Report call graph
|